For(int start, int end, int by = 1) {\\n for (int i = start; by > 0 ? (i <= end) : (i >= end); i += by) yield return i;\\n }\\n\\n static IEnumerable<int> Concat(params IEnumerable<int>[] ranges) => ranges.Aggregate((acc, r) => acc.Concat(r));\\n static int Pow(this int b, int e) => (int)Math.Pow(b, e);\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"100 cls\\n110 prod = 1 : sum = 0\\n120 x = 5 : y = -5 : z = -2\\n130 uno = 1 : tres = 3 : siete = 7\\n140 for j = -tres to (3^3) step tres : process(j) : next j\\n150 for j = -siete to siete step x : process(j) : next j\\n160 for j = 555 to 550-y : process(j) : next j\\n170 for j = 22 to -28 step -tres : process(j) : next j\\n180 for j = 1927 to 1939 : process(j) : next j\\n190 for j = x to y step z : process(j) : next j\\n200 for j = (11^x) to (11^x)+uno : process(j) : next j\\n210 print \\\" sum= \\\";sum\\n220 print \\\"prod= \\\";prod\\n230 end\\n240 sub process(x)\\n250 sum = sum+abs(x)\\n260 if abs(prod) < (2^27) and x <> 0 then prod = prod*x\\n270 end sub\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"(let ((prod 1)\\t\\t\\t\\t; Initialize aggregator\\n (sum 0)\\n (x 5)\\t\\t\\t\\t; Initialize variables\\n (y -5)\\n (z -2)\\n (one 1)\\n (three 3)\\n (seven 7))\\n\\n (flet ((loop-body (j)\\t\\t\\t; Set the loop function\\n\\t (incf sum (abs j))\\n\\t (if (and (< (abs prod) (expt 2 27))\\n\\t\\t (/= j 0))\\n\\t\\t(setf prod (* prod j)))))\\n\\n (do ((i (- three) (incf i three)))\\t; Just a serie of individual loops\\n\\t((> i (expt 3 3)))\\n (loop-body i))\\n (do ((i (- seven) (incf i x)))\\n\\t((> i seven))\\n (loop-body i))\\n (do ((i 555 (incf i -1)))\\n\\t((< i (- 550 y)))\\n (loop-body i))\\n (do ((i 22 (incf i (- three))))\\n\\t((< i -28))\\n (loop-body i))\\n (do ((i 1927 (incf i)))\\n\\t((> i 1939))\\n (loop-body i))\\n (do ((i x (incf i z)))\\n\\t((< i y))\\n (loop-body i))\\n (do ((i (expt 11 x) (incf i)))\\n\\t((> i (+ (expt 11 x) one)))\\n (loop-body i)))\\n\\n (format t \\\"~&sum = ~14<~:d~>\\\" sum)\\n (format t \\\"~&prod = ~14<~:d~>\\\" prod))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(let ((prod 1)\\n (sum 0)\\n (x 5)\\n (y -5)\\n (z -2)\\n (one 1)\\n (three 3)\\n (seven 7))\\n\\n (flet ((loop-body (j)\\t\\t\\t; Set the loop function\\n\\t (incf sum (abs j))\\n\\t (if (and (< (abs prod) (expt 2 27))\\n\\t\\t (/= j 0))\\n\\t (setf prod (* prod j)))))\\n\\n (dolist (lst `((,(- three) ,(expt 3 3) ,three)\\n\\t\\t (,(- seven) ,seven ,x)\\n\\t\\t (555 ,(- 550 y) -1)\\n\\t\\t (22 -28 ,(- three))\\n\\t\\t (1927 1939 1)\\n\\t\\t (,x ,y ,z)\\n\\t\\t (,(expt 11 x) ,(+ (expt 11 x) one) 1)))\\n (do ((i (car lst) (incf i (caddr lst))))\\n\\t ((if (plusp (caddr lst))\\n\\t (> i (cadr lst))\\n\\t (< i (cadr lst))))\\n\\t(loop-body i))))\\n\\n (format t \\\"~&sum = ~14<~:d~>\\\" sum)\\n (format t \\\"~&prod = ~14<~:d~>\\\" prod))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"program with_multiple_ranges;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils;\\n\\nvar\\n prod: Int64 = 1;\\n sum: Int64 = 0;\\n\\nfunction labs(value: Int64): Int64;\\nbegin\\n Result := value;\\n if value < 0 then\\n Result := -Result;\\nend;\\n\\nprocedure process(j: Int64);\\nbegin\\n sum := sum + (abs(j));\\n if (labs(prod) < (1 shl 27)) and (j <> 0) then\\n prod := prod * j;\\nend;\\n\\nfunction ipow(n: Integer; e: Cardinal): Int64;\\nvar\\n pr: Int64;\\n max, i: Cardinal;\\nbegin\\n result := n;\\n if e = 0 then\\n Exit(1);\\n max := e;\\n for i := 2 to max do\\n result := result * n;\\nend;\\n\\nvar\\n j: Int64;\\n p: Int64;\\n\\nconst\\n x = 5;\\n y = -5;\\n z = -2;\\n one = 1;\\n three = 3;\\n seven = 7;\\n\\nbegin\\n p := ipow(11, x);\\n\\n j := -three;\\n while j <= ipow(3, 3) do\\n begin\\n process(j);\\n inc(j, three);\\n end;\\n\\n j := -seven;\\n while j <= seven do\\n begin\\n process(j);\\n inc(j, x);\\n end;\\n\\n j := 555;\\n while j <= (550 - y) do\\n begin\\n process(j);\\n inc(j, x);\\n end;\\n\\n j := 22;\\n while j >= -28 do\\n begin\\n process(j);\\n dec(j, three);\\n end;\\n\\n j := 1927;\\n while j <= 1939 do\\n begin\\n process(j);\\n inc(j);\\n end;\\n\\n j := x;\\n while j >= y do\\n begin\\n process(j);\\n dec(j, -z);\\n end;\\n\\n j := p;\\n while j <= p + one do\\n begin\\n process(j);\\n inc(j);\\n end;\\n\\n writeln(format('sum = %d ', [sum]));\\n writeln(format('prod = %d ', [prod]));\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"class\\n\\tAPPLICATION\\n\\ncreate\\n\\tmake\\n\\nfeature\\n\\n\\tprod, sum, x, y, z, one, three, seven: INTEGER\\n\\n\\tmake\\n\\t\\tlocal\\n\\t\\t\\tprocess: PROCEDURE\\n\\t\\tdo\\n\\t\\t\\tprod := 1; x := 5; y := -5; z := -2; one := 1; three := 3; seven := 7\\n\\t\\t\\tprocess := (agent (j: INTEGER)\\n\\t\\t\\t\\t\\t\\t\\t\\tdo\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tprint (j.out + \\\", \\\")\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tsum := sum + j.abs\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif prod.abs < 2^27 and j /= 0 then\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tprod := prod * j\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\t\\t\\t\\t\\tend)\\n\\n\\t\\t\\tacross (-three |..| (3^3).truncated_to_integer).new_cursor + (three - 1) as ic loop process.call (ic.item) end\\n\\t\\t\\tacross (-seven |..| seven).new_cursor + (x - 1)\\tas ic loop process.call (ic.item) end\\n\\t\\t\\tacross 555 |..| (550 - y) as ic loop process.call (ic.item) end\\n\\t\\t\\tacross (-26 |..| 22).new_cursor + (three - 1) as ic loop process.call (ic.item) end\\n\\t\\t\\tacross 1927 |..| 1939 as ic loop process.call (ic.item) end\\n\\t\\t\\tacross (y |..| x).new_cursor + (-z - 1)\\tas ic loop process.call (ic.item) end\\n\\t\\t\\tacross (11^x).truncated_to_integer |..| ((11^x).truncated_to_integer + 1) as ic loop process.call (ic.item) end\\n\\n\\t\\t\\tprint (\\\"%N\\\")\\n\\t\\t\\tprint (\\\"sum = \\\" + sum.out + \\\"%N\\\") \\t\\t-- sum = 348,173\\n\\t\\t\\tprint (\\\"prod = \\\" + prod.out + \\\"%N\\\")\\t\\t-- prod = -793,618,560\\n\\t\\tend\\n\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"class\\n\\tAPPLICATION\\n\\ncreate\\n\\tmake\\n\\nfeature\\n\\n\\tprod, sum, x, y, z, one, three, seven: INTEGER\\n\\n\\tmake\\n\\t\\tlocal\\n\\t\\t\\tprocess: PROCEDURE\\n\\t\\tdo\\n\\t\\t\\tprod := 1; x := 5; y := -5; z := -2; one := 1; three := 3; seven := 7\\n\\t\\t\\tprocess := (agent (j: INTEGER)\\n\\t\\t\\t\\t\\t\\t\\t\\tdo\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tprint (j.out + \\\", \\\")\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tsum := sum + j.abs\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif prod.abs < 2^27 and j /= 0 then\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tprod := prod * j\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\t\\t\\t\\t\\tend)\\n\\n\\t\\t\\t⟳ ic: (-three |..| (3^3).truncated_to_integer).new_cursor + (three - 1) ¦ process.call (ic) ⟲\\n\\t\\t\\t⟳ ic: (-seven |..| seven).new_cursor + (x - 1) ¦ process.call (ic) ⟲\\n\\t\\t\\t⟳ ic:555 |..| (550 - y) ¦ process.call (ic) ⟲\\n\\t\\t\\t⟳ ic: (-26 |..| 22).new_cursor + (three - 1) ¦ process.call (ic) ⟲\\n\\t\\t\\t⟳ ic: 1927 |..| 1939 ¦ process.call (ic) ⟲\\n\\t\\t\\t⟳ ic: (y |..| x).new_cursor + (-z - 1) ¦ process.call (ic) ⟲\\n\\t\\t\\t⟳ ic: (11^x).truncated_to_integer |..| ((11^x).truncated_to_integer + 1) ¦ process.call (ic) ⟲\\n\\n\\t\\t\\tprint (\\\"%N\\\")\\n\\t\\t\\tprint (\\\"sum = \\\" + sum.out + \\\"%N\\\") \\t\\t-- sum = 348,173\\n\\t\\t\\tprint (\\\"prod = \\\" + prod.out + \\\"%N\\\")\\t\\t-- prod = -793,618,560\\n\\t\\tend\\n\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"// Loops/With multiple ranges. Nigel Galloway: June 13th., 2022\\nlet x,y,z,one,three,seven=5,-5,-2,1,3,7\\nlet Range=[-three..three..pown 3 3]@[-7..x..seven]@[555..550-y]@[22..-three.. -28]@[1927..1939]@[x..z..y]@[pown 11 x..(pown 11 x)+1]\\nprintfn \\\"Sum=%d Product=%d\\\" (Range|>Seq.sumBy(abs)) (Range|>Seq.filter((<>)0)|>Seq.fold(fun n g->if abs n<pown 2 27 then n*g else n) 1)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: formatting kernel locals math math.functions math.ranges\\nsequences sequences.generalizations tools.memory.private ;\\n\\n[let ! Allow lexical variables.\\n 1 :> prod! ! Start with a product of unity.\\n 0 :> sum! ! \\\" \\\" \\\" sum \\\" zero.\\n 5 :> x\\n -5 :> y\\n -2 :> z\\n 1 :> one\\n 3 :> three\\n 7 :> seven\\n\\n three neg 3 3 ^ three <range> ! Create array\\n seven neg seven x <range> ! of 7 ranges.\\n 555 550 y - [a,b]\\n 22 -28 three neg <range>\\n 1927 1939 [a,b]\\n x y z <range>\\n 11 x ^ 11 x ^ 1 + [a,b] 7 narray\\n\\n [\\n [\\n :> j j abs sum + sum!\\n prod abs 2 27 ^ < j zero? not and\\n [ prod j * prod! ] when\\n ] each ! Loop over range.\\n ] each ! Loop over array of ranges.\\n\\n ! SUM and PROD are used for verification of J incrementation.\\n sum prod [ commas ] bi@ \\\" sum= %s\\\\nprod= %s\\\\n\\\" printf\\n]\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Dim Shared As Long prod, sum\\n\\nSub process(x As Long)\\n sum += Abs(x)\\n If Abs(prod) < (2 ^ 27) And x <> 0 Then prod *= x\\nEnd Sub\\n\\nDim j As Long\\nprod = 1\\nsum = 0\\nDim As Integer x = 5, y = -5, z = -2\\nDim As Integer one = 1, three = 3, seven = 7\\n\\nFor j = -three To (3 ^ 3) Step three: process(j): Next j\\nFor j = -seven To seven Step x: process(j): Next j\\nFor j = 555 To 550 - y: process(j): Next j\\nFor j = 22 To -28 Step -three: process(j): Next j\\nFor j = 1927 To 1939: process(j): Next j\\nFor j = x To y Step z: process(j): Next j\\nFor j = (11 ^ x) To (11 ^ x) + one: process(j): Next j\\n\\nPrint Using \\\" sum= ###,###\\\"; sum\\nPrint Using \\\"prod= ####,###,###\\\"; prod\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"window 1, @\\\"Loops with Ranges\\\", ( 0, 0, 400, 400 )\\n\\nbegin globals\\nNSInteger sum = 0\\nfloat prod = 1\\nend globals\\n\\nlocal fn process( x as float )\\nsum += abs(x)\\nif abs(prod) < (2 ^ 27) and x <> 0 then prod = prod * x\\nend fn\\n\\nNSInteger j\\nNSInteger x = 5, y = -5, z = -2\\nNSInteger one = 1, three = 3, seven = 7\\n\\nfor j = -three to (3 ^ 3) step three: fn process(j): next j\\nfor j = -seven to seven step x: fn process(j): next j\\nfor j = 555 to 550 - y: fn process(j): next j\\nfor j = 22 to -28 step -three: fn process(j): next j\\nfor j = 1927 to 1939: fn process(j): next j\\nfor j = x to y step z: fn process(j): next j\\nfor j = (11 ^ x) to (11 ^ x) + one: fn process(j): next j\\n\\nprint using \\\" sum = ###,###\\\"; sum\\nprint using \\\"prod =-####,###,###\\\"; prod\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc pow(n int, e uint) int {\\n if e == 0 {\\n return 1\\n }\\n prod := n\\n for i := uint(2); i <= e; i++ {\\n prod *= n\\n }\\n return prod\\n}\\n\\nfunc abs(n int) int {\\n if n >= 0 {\\n return n\\n }\\n return -n\\n}\\n\\nfunc commatize(n int) string {\\n s := fmt.Sprintf(\\\"%d\\\", n)\\n if n < 0 {\\n s = s[1:]\\n }\\n le := len(s)\\n for i := le - 3; i >= 1; i -= 3 {\\n s = s[0:i] + \\\",\\\" + s[i:]\\n }\\n if n >= 0 {\\n return \\\" \\\" + s\\n }\\n return \\\"-\\\" + s\\n}\\n\\nfunc main() {\\n prod := 1\\n sum := 0\\n const (\\n x = 5\\n y = -5\\n z = -2\\n one = 1\\n three = 3\\n seven = 7\\n )\\n p := pow(11, x)\\n var j int\\n\\n process := func() {\\n sum += abs(j)\\n if abs(prod) < (1<<27) && j != 0 {\\n prod *= j\\n }\\n }\\n\\n for j = -three; j <= pow(3, 3); j += three {\\n process()\\n }\\n for j = -seven; j <= seven; j += x {\\n process()\\n }\\n for j = 555; j <= 550-y; j++ {\\n process()\\n }\\n for j = 22; j >= -28; j -= three {\\n process()\\n }\\n for j = 1927; j <= 1939; j++ {\\n process()\\n }\\n for j = x; j >= y; j -= -z {\\n process()\\n }\\n for j = p; j <= p+one; j++ {\\n process()\\n }\\n fmt.Println(\\\"sum = \\\", commatize(sum))\\n fmt.Println(\\\"prod = \\\", commatize(prod))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def (prod, sum, x, y, z, one, three, seven) = [1, 0, +5, -5, -2, 1, 3, 7]\\n\\nfor (\\n j in (\\n ((-three) .. (3**3) ).step(three)\\n + ((-seven) .. (+seven) ).step(x)\\n + (555 .. (550-y) )\\n + (22 .. (-28) ).step(three) // This is correct!\\n // Groovy interprets positive step size as stride through the LIST ELEMENTS as ordered\\n // and negative step size as stride through the REVERSED LIST ELEMENTS as ordered\\n // so step(-3) gives: -28, -25, -22, ... , 20\\n // while step(3) gives: 22, 19, 16, ... , -26\\n + (1927 .. 1939 )\\n + (x .. y ).step(z)\\n + (11**x .. (11**x + one))\\n )\\n) {\\n\\n sum = sum + j.abs()\\n if ( prod.abs() < 2**27 && j != 0) prod *= j\\n}\\n\\nprintln \\\" sum= ${sum}\\\"\\nprintln \\\"prod= ${prod}\\\"\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"loop :: (b -> a -> b) -> b -> [[a]] -> b\\nloop = foldl . foldl\\n\\nexample = let\\n x = 5\\n y = -5\\n z = -2\\n one = 1\\n three = 3\\n seven = 7\\n in\\n loop\\n -- body\\n (\\n \\\\(sum, prod) j ->\\n (\\n sum + abs j,\\n if abs prod < 2^27 && j /= 0\\n then prod * j else prod\\n )\\n )\\n -- initial state\\n (0, 1)\\n -- ranges\\n [ [-three, -three + three .. 3^3]\\n , [-seven, -seven + x .. seven]\\n , [555 .. 550 - y]\\n , [22, 22 - three .. -28]\\n , [1927 .. 1939]\\n , [x, x + z .. y]\\n , [11^x .. 11^x + one] ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"TO=: {{\\n 'N M'=. 2{.y,1\\n x:x+M*i.>.(1+N-x)%M\\n}}\\n\\nBY=: ,\\n\\n{{\\n PROD=: 1\\n SUM=: 0\\n X=: +5\\n Y=: -5\\n Z=: -2\\n ONE=: 1\\n THREE=: 3\\n SEVEN=: 7\\n\\n for_J. ;do >cutLF {{)n\\n < (-THREE) TO (3^3) BY THREE\\n < (-SEVEN) TO (+SEVEN) BY X\\n < 555 TO 550-Y\\n < 22 TO _28 BY -THREE\\n < 1927 TO 1939\\n < X TO Y BY Z\\n < (11^X) TO (11^X) + ONE\\n}} do.\\n SUM=: SUM+|J\\n if. ((|PROD)<2^27) * J~:0 do. PROD=: PROD*J end.\\n end.\\n echo ' SUM= ',\\\":SUM\\n echo 'PROD= ',\\\":PROD\\n}}0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.List;\\n\\npublic class LoopsWithMultipleRanges {\\n\\n private static long sum = 0;\\n private static long prod = 1;\\n\\n public static void main(String[] args) {\\n long x = 5;\\n long y = -5;\\n long z = -2;\\n long one = 1;\\n long three = 3;\\n long seven = 7;\\n\\n List<Long> jList = new ArrayList<>();\\n for ( long j = -three ; j <= pow(3, 3) ; j += three ) jList.add(j);\\n for ( long j = -seven ; j <= seven ; j += x ) jList.add(j);\\n for ( long j = 555 ; j <= 550-y ; j += 1 ) jList.add(j);\\n for ( long j = 22 ; j >= -28 ; j += -three ) jList.add(j);\\n for ( long j = 1927 ; j <= 1939 ; j += 1 ) jList.add(j);\\n for ( long j = x ; j >= y ; j += z ) jList.add(j);\\n for ( long j = pow(11, x) ; j <= pow(11, x) + one ; j += 1 ) jList.add(j);\\n\\n List<Long> prodList = new ArrayList<>();\\n for ( long j : jList ) {\\n sum += Math.abs(j);\\n if ( Math.abs(prod) < pow(2, 27) && j != 0 ) {\\n prodList.add(j);\\n prod *= j;\\n }\\n }\\n\\n System.out.printf(\\\" sum = %,d%n\\\", sum);\\n System.out.printf(\\\"prod = %,d%n\\\", prod);\\n System.out.printf(\\\"j values = %s%n\\\", jList);\\n System.out.printf(\\\"prod values = %s%n\\\", prodList);\\n }\\n\\n private static long pow(long base, long exponent) {\\n return (long) Math.pow(base, exponent);\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# If using gojq, one may want to preserve integer precision, so:\\ndef power($b): . as $in | reduce range(0;$b) as $i (1; . * $in);\\n\\n{ prod: 1, # start with a product of unity.\\n sum: 0, # henceforth skip redundant comments.\\n x: 5,\\n y: -5,\\n z: -2,\\n one: 1,\\n three: 3,\\n seven: 7 }\\n| .x as $x\\n| reduce (range(-.three; 1 + 3|power(3); .three),\\n range(-.seven; 1 + .seven; .x),\\n range( 555; 1 + 550 - .y),\\n range( 22; -1 -28; -.three),\\n range(1927 ; 1 + 1939),\\n range(.x ; .y; .z),\\n range(11|power($x); 1 + ( 11 | power($x)) + .one)) as $j (.;\\n .sum += ($j|length) # add absolute value of $j (!)\\n | if (.prod|length) < (2|power(27)) and $j != 0\\n\\t then .prod *= $j\\n\\t else .\\n\\t end )\\n| \\\"sum= \\\\(.sum)\\\",\\n \\\"prod= \\\\(.prod)\\\"\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Formatting\\n\\nfunction PL1example()\\n\\n # all variables are DECLARED as integers.\\n prod = 1; # start with a product of unity.\\n sum = 0; # \\\" \\\" \\\" sum \\\" zero.\\n x = +5;\\n y = -5;\\n z = -2;\\n one = 1;\\n three = 3;\\n seven = 7;\\n # (below) ** is exponentiation: 4**3=64\\n for j in [ -three : three : 3^3 ;\\n -seven : x : +seven ;\\n 555 : 550 - y ;\\n 22 : -three : -28 ;\\n 1927 : 1939 ;\\n x : z : y ;\\n 11^x : 11^x + one ]\\n # ABS(n) = absolute value\\n sum = sum + abs(j); # add absolute value of J.\\n if abs(prod) < 2^27 && j !=0 prod = prod*j # PROD is small enough & J\\n end; # not 0, then multiply it.\\n end # SUM and PROD are used for verification of J incrementation.\\n println(\\\" sum = $(format(sum, commas=true))\\\"); # display strings to term.\\n println(\\\"prod = $(format(prod, commas=true))\\\"); # \\\" \\\" \\\" \\\"\\nend\\n\\nPL1example()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// Version 1.2.70\\n\\nimport kotlin.math.abs\\n\\ninfix fun Int.pow(e: Int): Int {\\n if (e == 0) return 1\\n var prod = this\\n for (i in 2..e) {\\n prod *= this\\n }\\n return prod\\n}\\n\\nfun main(args: Array<String>) {\\n var prod = 1\\n var sum = 0\\n val x = 5\\n val y = -5\\n val z = -2\\n val one = 1\\n val three = 3\\n val seven = 7\\n val p = 11 pow x\\n fun process(j: Int) {\\n sum += abs(j)\\n if (abs(prod) < (1 shl 27) && j != 0) prod *= j\\n }\\n\\n for (j in -three..(3 pow 3) step three) process(j)\\n for (j in -seven..seven step x) process(j)\\n for (j in 555..550-y) process(j)\\n for (j in 22 downTo -28 step three) process(j)\\n for (j in 1927..1939) process(j)\\n for (j in x downTo y step -z) process(j)\\n for (j in p..p + one) process(j)\\n System.out.printf(\\\"sum = % ,d\\\\n\\\", sum)\\n System.out.printf(\\\"prod = % ,d\\\\n\\\", prod)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"import kotlin.math.abs\\nimport kotlin.math.pow\\n\\nprivate infix fun Int.`^`(exponent: Int): Int = toDouble().pow(exponent).toInt()\\n\\nfun main() {\\n var prod = 1\\n var sum = 0\\n val x = 5\\n val y = -5\\n val z = -2\\n val one = 1\\n val three = 3\\n val seven = 7\\n val p = 11 `^` x\\n\\n for (j in sequenceOf(\\n -three..(3 `^` 3) step three,\\n -seven..seven step x,\\n 555..550-y,\\n 22 downTo -28 step three,\\n 1927..1939,\\n x downTo y step -z,\\n p..p + one\\n ).flatten()) {\\n sum += abs(j)\\n if (abs(prod) < (2 `^` 27) && j != 0) prod *= j\\n }\\n System.out.printf(\\\"sum = % ,d\\\\n\\\", sum)\\n System.out.printf(\\\"prod = % ,d\\\\n\\\", prod)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"-- support:\\nfunction T(t) return setmetatable(t, {__index=table}) end\\ntable.range = function(t,a,b,c) local s=T{} for i=a,b,c or 1 do s[#s+1]=i end return s end\\ntable.clone = function(t) local s=T{} for k,v in ipairs(t) do s[k]=v end return s end\\ntable.chain = function(t,u) local s=t:clone() for i=1,#u do s[#s+1]=u[i] end return s end\\nunpack = unpack or table.unpack -- polyfill 5.2 vs 5.3\\n\\n-- impl:\\n-- Multi-Range-Loop\\n-- param: table of tables of range specs\\n-- return: iterator over the chain of all ranges\\nfunction mrl(tt)\\n local s=T{}\\n for _,t in ipairs(tt) do s=s:chain(T{}:range(unpack(t))) end\\n return ipairs(s)\\nend\\n\\n-- demo:\\nprod,sum,x,y,z,one,three,seven = 1,0,5,-5,-2,1,3,7\\nfor _,j in mrl{\\n { -three, 3^3, three },\\n { -seven, seven, x },\\n { 555, 550-y },\\n { 22, -28, -three },\\n { 1927, 1939 },\\n { x, y, z },\\n { 11^x, 11^x+1 }} do\\n sum = sum + math.abs(j)\\n if math.abs(prod) < 2^27 and j~=0 then prod = prod * j end\\nend\\nprint(\\\" sum= \\\" .. sum)\\nprint(\\\"prod= \\\" .. prod)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module MultipleLoop {\\n\\tdef long prod=1, sum=0, x=+5,y=-5, z=-2, one=1, three=3, seven=7, j\\n\\tRange=lambda (a, b, c=1) ->{\\n\\t\\t=lambda a, b, c (&f)-> {\\n\\t\\t\\tif compare(a,b)=sgn(c) then =false else =true: f=a: a+=c\\n\\t\\t}\\n\\t}\\n\\tMultipleRange=Lambda -> {\\n\\t\\ta=array([]) ' convert stack items in current stack [] to an array of items\\n\\t\\t=lambda a, k=0 (&f) ->{\\n\\t\\t\\tdo : if k<len(a) Else exit\\n\\t\\t\\tif a#eval(k, &f) then =true: exit\\n\\t\\t\\tk++ : always\\n\\t\\t}\\n\\t}\\n\\tExec=MultipleRange(Range(-three, 3**3, three), Range(-seven, +seven, x), Range(555, 550-y), Range(22, -28, -three), Range(1927, 1939), Range(x,y,z), Range(11**x, 11**x+one))\\n\\tj=0\\n\\twhile Exec(&j)\\n\\t\\tsum+=abs(j)\\n\\t\\tif abs(prod) < 2^27 And j <> 0 then prod*=j\\n\\tEnd While\\n\\t\\n\\tPrint \\\"sum=\\\";sum\\n\\tPrint \\\"prod=\\\";prod\\n}\\nMultipleLoop\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"prod = 1;\\nsum = 0;\\nx = 5;\\ny = -5;\\nz = -2;\\none = 1;\\nthree = 3;\\nseven = 7;\\nDo[\\n sum += Abs[j];\\n If[Abs[prod] < 2^27 \\\\[And] j != 0, prod *= j];\\n ,\\n {j,\\n Join[\\n Range[-three, 3^3, three],\\n Range[-seven, seven, x],\\n Range[555, 550 - y],\\n Range[22, -28, -three],\\n Range[1927, 1939],\\n Range[x, y, z],\\n Range[11^x, 11^x + one]\\n ]\\n }\\n ]\\nsum\\nprod\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import math, strutils\\n\\nvar\\n prod = 1\\n sum = 0\\n\\nlet\\n x = +5\\n y = -5\\n z = -2\\n one = 1\\n three = 3\\n seven = 7\\n\\nproc body(j: int) =\\n sum += abs(j)\\n if abs(prod) < 2^27 and j != 0: prod *= j\\n\\n\\nfor j in countup(-three, 3^3, three): body(j)\\nfor j in countup(-seven, seven, x): body(j)\\nfor j in countup(555, 550 - y): body(j)\\nfor j in countdown(22, -28, three): body(j)\\nfor j in countup(1927, 1939): body(j)\\nfor j in countdown(x, y, -z): body(j)\\nfor j in countup(11^x, 11^x + one): body(j)\\n\\nlet s = ($sum).insertSep(',')\\nlet p = ($prod).insertSep(',')\\nlet m = max(s.len, p.len)\\necho \\\" sum = \\\", s.align(m)\\necho \\\"prod = \\\", p.align(m)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"import math, strutils\\n\\nvar\\n prod = 1\\n sum = 0\\n\\nlet\\n x = +5\\n y = -5\\n z = -2\\n one = 1\\n three = 3\\n seven = 7\\n\\ntype Range = tuple[first, last, step: int]\\n\\nfunc initRange(first, last, step = 1): Range = (first, last, step)\\n\\niterator loop(ranges: varargs[Range]): int =\\n for r in ranges:\\n if r.step > 0:\\n for i in countup(r.first, r.last, r.step):\\n yield i\\n elif r.step < 0:\\n for i in countdown(r.first, r.last, -r.step):\\n yield i\\n else:\\n raise newException(ValueError, \\\"step cannot be zero\\\")\\n\\nfor j in loop(initRange(-three, 3^3, three),\\n initRange(-seven, seven, x),\\n initRange(555, 550 - y),\\n initRange(22, -28, three),\\n initRange(1927, 1939),\\n initRange(x, y, -z),\\n initRange(11^x, 11^x + one)):\\n sum += abs(j)\\n if abs(prod) < 2^27 and j != 0: prod *= j\\n\\nlet s = ($sum).insertSep(',')\\nlet p = ($prod).insertSep(',')\\nlet m = max(s.len, p.len)\\necho \\\" sum = \\\", s.align(m)\\necho \\\"prod = \\\", p.align(m)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"for j in loop((-three, 3^3, three),\\n (-seven, seven, x),\\n (555, 550 - y),\\n (22, -28, three),\\n (1927, 1939, 1),\\n (x, y, -z),\\n (11^x, 11^x + one)):\\n sum += abs(j)\\n if abs(prod) < 2^27 and j != 0: prod *= j\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use constant one => 1;\\nuse constant three => 3;\\nuse constant seven => 7;\\nuse constant x => 5;\\nuse constant yy => -5; # 'y' conflicts with use as equivalent to 'tr' operator (a carry-over from 'sed')\\nuse constant z => -2;\\n\\nmy $prod = 1;\\n\\nsub from_to_by {\\n my($begin,$end,$skip) = @_;\\n my $n = 0;\\n grep{ !($n++ % abs $skip) } $begin <= $end ? $begin..$end : reverse $end..$begin;\\n}\\n\\nsub commatize {\\n (my $s = reverse shift) =~ s/(.{3})/$1,/g;\\n $s =~ s/,(-?)$/$1/;\\n $s = reverse $s;\\n}\\n\\nfor my $j (\\n from_to_by(-three,3**3,three),\\n from_to_by(-seven,seven,x),\\n 555 .. 550 - yy,\\n from_to_by(22,-28,-three),\\n 1927 .. 1939,\\n from_to_by(x,yy,z),\\n 11**x .. 11**x+one,\\n ) {\\n $sum += abs($j);\\n $prod *= $j if $j and abs($prod) < 2**27;\\n}\\n\\nprintf \\\"%-8s %12s\\\\n\\\", 'Sum:', commatize $sum;\\nprintf \\\"%-8s %12s\\\\n\\\", 'Product:', commatize $prod;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">prod</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">total</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (renamed as sum is a Phix builtin)</span>\\n <span style=\\\"color: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">z</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">one</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">three</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">seven</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">7</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">loopset</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">three</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">power</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;\\\">three</span> <span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">seven</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">seven</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">555</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">550</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>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">22</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">28</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">three</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">1927</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1939</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;\\\">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 <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">11</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;\\\">one</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</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;\\\">loopset</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;\\\">f</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">t</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;\\\">loopset</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</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;\\\">f</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">total</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #7060A8;\\\">abs</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: #7060A8;\\\">abs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">prod</span><span style=\\\"color: #0000FF;\\\">)<</span><span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">27</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">prod</span> <span style=\\\"color: #0000FF;\\\">*=</span> <span style=\\\"color: #000000;\\\">j</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: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" sum = %,d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">total</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;\\\">\\\"prod = %,d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">prod</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"/# Rosetta Code problem: https://rosettacode.org/wiki/Loops/With_multiple_ranges\\nby Galileo, 11/2022 #/\\n\\ninclude ..\\\\Utilitys.pmt\\n\\n1 var prod\\n0 var total\\n+5 var x\\n-5 var y\\n-2 var z\\n1 var one\\n3 var three\\n7 var seven\\n\\n( ( three neg 3 3 power three )\\n ( seven neg seven x )\\n ( 555 550 y - 1 )\\n ( 22 -28 three neg )\\n ( 1927 1939 1 )\\n ( x y z )\\n ( 11 x power 11 x power one + 1 ) )\\n\\nlen for\\n get for\\n dup abs total + var total\\n dup prod abs 2 27 power < and if prod * var prod else drop endif\\n endfor\\nendfor\\n\\n( \\\" sum = \\\" total \\\"\\\\n\\\" \\\"prod = \\\" prod ) lprint\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"foreach(I in 1..3, J in 4..6, K in 7..9)\\n % ...\\nend\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"go =>\\n Prod= 1,\\n Sum= 0,\\n X= +5,\\n Y= -5,\\n Z= -2,\\n One= 1,\\n Three= 3,\\n Seven= 7,\\n Ranges = [-Three..Three..3**3,\\n -Seven..X.. +Seven,\\n 555..550-Y,\\n 22..-Three..-28,\\n 1927..1939,\\n X..Z..Y,\\n 11**X..11**X + One\\n ],\\n foreach(Range in Ranges, J in Range)\\n Sum := Sum + abs(J),\\n if abs(Prod) < 2**27, J != 0 then\\n Prod := Prod * J\\n end\\n end,\\n println(sum=Sum),\\n println(prod=Prod),\\n nl.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \" % ...\\n foreach(J in [-Three..Three..3**3,\\n -Seven..X.. +Seven,\\n 555..550-Y,\\n 22..-Three..-28,\\n 1927..1939,\\n X..Z..Y,\\n 11**X..11**X + One\\n ].flatten\\n )\\n Sum := Sum + abs(J),\\n if abs(Prod) < 2**27, J != 0 then\\n Prod := Prod * J\\n end\\n end,\\n % ...\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"for(Lo,Hi,Step,Lo) :- Step>0, Lo=<Hi.\\nfor(Lo,Hi,Step,Val) :- Step>0, plus(Lo,Step,V), V=<Hi, !, for(V,Hi,Step,Val).\\nfor(Hi,Lo,Step,Hi) :- Step<0, Lo=<Hi.\\nfor(Hi,Lo,Step,Val) :- Step<0, plus(Hi,Step,V), Lo=<V, !, for(V,Lo,Step,Val).\\n\\nsym(x,5). % symbolic lookups for values\\nsym(y,-5).\\nsym(z,-2).\\nsym(one,1).\\nsym(three,3).\\nsym(seven,7).\\n\\nrange(-three,3^3,three). % as close as we can syntactically get\\nrange(-seven,seven,x).\\nrange(555,550-y,1).\\nrange(22,-28, -three).\\nrange(1927,1939,1).\\nrange(x,y,z).\\nrange(11^x,11^x+one,1).\\n\\ntranslate(V, V) :- number(V), !. % difference list based parser\\ntranslate(S, V) :- sym(S,V), !.\\ntranslate(-S, V) :- translate(S,V0), !, V is -V0.\\ntranslate(A+B, V) :- translate(A,A0), translate(B, B0), !, V is A0+B0.\\ntranslate(A-B, V) :- translate(A,A0), translate(B, B0), !, V is A0-B0.\\ntranslate(A^B, V) :- translate(A,A0), translate(B, B0), !, V is A0^B0.\\n\\nrange_value(Val) :- % enumerate values for all ranges in order\\n\\trange(From,To,Step),\\n\\ttranslate(From,F), translate(To,T), translate(Step,S),\\n\\tfor(F,T,S,Val).\\n\\ncalc_values([], S, P, S, P). % calculate all values in generated order\\ncalc_values([J|Js], S, P, Sum, Product) :-\\n S0 is S + abs(J), ((abs(P)< 2^27, J \\\\= 0) -> P0 is P * J; P0=P),\\n !, calc_values(Js, S0, P0, Sum, Product).\\n\\ncalc_values(Sum, Product) :- % Find the sum and product\\n\\tfindall(V, range_value(V), Values),\\n\\tcalc_values(Values, 0, 1, Sum, Product).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"#X = 5 : #Y = -5 : #Z = -2\\n#ONE = 1 : #THREE = 3 : #SEVEN = 7\\nDefine j.i\\nGlobal prod.i = 1, sum.i = 0\\n\\nMacro ipow(n, e)\\n Int(Pow(n, e))\\nEndMacro\\n\\nMacro ifn(x)\\n FormatNumber(x,0,\\\".\\\",\\\",\\\")\\nEndMacro\\n\\nMacro loop_for(start, stop, step_for=1)\\n For j = start To stop Step step_for\\n proc(j)\\n Next\\nEndMacro\\n\\nProcedure proc(j.i)\\n sum + Abs(j)\\n If (Abs(prod) < ipow(2 , 27)) And (j<>0)\\n prod * j\\n EndIf\\nEndProcedure\\n\\nloop_for(-#THREE, ipow(3, 3), #THREE)\\nloop_for(-#SEVEN, #SEVEN, #X)\\nloop_for(555, 550 - #Y)\\nloop_for(22, -28, -#THREE)\\nloop_for(1927, 1939)\\nloop_for(#X, #Y, #Z)\\nloop_for(ipow(11, #X), ipow(11, #X) + 1)\\n\\nIf OpenConsole(\\\"Loops/with multiple ranges\\\")\\n PrintN(\\\"sum = \\\" + ifn(sum))\\n PrintN(\\\"prod = \\\" + ifn(prod))\\n Input()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"from itertools import chain\\n\\nprod, sum_, x, y, z, one,three,seven = 1, 0, 5, -5, -2, 1, 3, 7\\n\\ndef _range(x, y, z=1):\\n return range(x, y + (1 if z > 0 else -1), z)\\n\\nprint(f'list(_range(x, y, z)) = {list(_range(x, y, z))}')\\nprint(f'list(_range(-seven, seven, x)) = {list(_range(-seven, seven, x))}')\\n\\nfor j in chain(_range(-three, 3**3, three), _range(-seven, seven, x),\\n _range(555, 550 - y), _range(22, -28, -three),\\n _range(1927, 1939), _range(x, y, z),\\n _range(11**x, 11**x + 1)):\\n sum_ += abs(j)\\n if abs(prod) < 2**27 and (j != 0):\\n prod *= j\\nprint(f' sum= {sum_}\\\\nprod= {prod}')\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'Task\\n'Simulate/translate the above PL/I program snippet as best as possible\\n' in your language, with particular emphasis on the do loop\\n' construct.\\n'The do index must be incremented/decremented in the same order shown.\\n'If feasible, add commas to the two output numbers (being displayed).\\n'Show all output here.\\n\\n'Unknown DO multiple conditions behaviour:\\n' this code implements a sequential/serial set of ranges mode for DO condition\\n\\nDim As Integer prod, sum, x, y, z, one, three, seven\\nDim As _Integer64 Count(1 To 7)\\nDim As Integer Index, IndexCondition\\n\\nprod = 1\\nsum = 0\\nx = 5\\ny = -5\\nz = -2\\none = 1\\nthree = 3\\nseven = 7\\nCount(1) = -three\\nCount(2) = -seven\\nCount(3) = 555\\nCount(4) = 22\\nCount(5) = 1927\\nCount(6) = x\\nCount(7) = 11 ^ x\\nIndexCondition = 1\\nDo\\n If IndexCondition = 1 Then\\n If Count(1) + three < 3 ^ 3 Then Count(1) = Count(1) + three Else IndexCondition = 2\\n ElseIf IndexCondition = 2 Then\\n If Count(2) + x < seven Then Count(2) = Count(2) + x Else IndexCondition = 3\\n ElseIf IndexCondition = 3 Then\\n If Count(3) - 1 > 550 - y Then Count(3) = Count(3) - 1 Else IndexCondition = 4\\n ElseIf IndexCondition = 4 Then\\n If Count(4) - three > -28 Then Count(4) = Count(4) - three Else IndexCondition = 5\\n ElseIf IndexCondition = 5 Then\\n If Count(5) + 1 < 1939 Then Count(5) = Count(5) + 1 Else IndexCondition = 6\\n ElseIf IndexCondition = 6 Then\\n If Count(6) + z < y Then Count(6) = Count(6) + z Else IndexCondition = 7\\n ElseIf IndexCondition = 7 Then\\n If Count(7) + 1 < 11 ^ (x + one) Then Count(7) = Count(7) + 1 Else Exit Do\\n End If\\n\\n sum = sum + Abs(Count(IndexCondition))\\n If Abs(prod) < 2 ^ 27 And (j <> 0) Then prod = prod * Count(IndexCondition)\\n Print sum\\n Print prod\\n\\nLoop\\n\",\n \"language\": \"QB64\"\n },\n {\n \"code\": \"sub comma { ($^i < 0 ?? '-' !! '') ~ $i.abs.flip.comb(3).join(',').flip }\\n\\nmy \\\\x = 5;\\nmy \\\\y = -5;\\nmy \\\\z = -2;\\nmy \\\\one = 1;\\nmy \\\\three = 3;\\nmy \\\\seven = 7;\\n\\nmy $j = flat\\n ( -three, *+three … 3³ ),\\n ( -seven, *+x …^ * > seven ),\\n ( 555 .. 550 - y ),\\n ( 22, *-three …^ * < -28 ),\\n ( 1927 .. 1939 ),\\n ( x, *+z …^ * < y ),\\n ( 11**x .. 11**x + one );\\n\\nput 'j sequence: ', $j;\\nput ' Sum: ', comma [+] $j».abs;\\nput ' Product: ', comma ([\\\\*] $j.grep: so +*).first: *.abs > 2²⁷;\\n\\n# Or, an alternate method for generating the 'j' sequence, employing user-defined\\n# operators to preserve the 'X to Y by Z' layout of the example code.\\n# Note that these operators will only work for monotonic sequences.\\n\\nsub infix:<to> { $^a ... $^b }\\nsub infix:<by> { $^a[0, $^b.abs ... *] }\\n\\n$j = cache flat\\n -three to 3**3 by three ,\\n -seven to seven by x ,\\n 555 to (550 - y) ,\\n 22 to -28 by -three ,\\n 1927 to 1939 by one ,\\n x to y by z ,\\n 11**x to (11**x + one) ;\\n\\nput \\\"\\\\nLiteral minded variant:\\\";\\nput ' Sum: ', comma [+] $j».abs;\\nput ' Product: ', comma ([\\\\*] $j.grep: so +*).first: *.abs > 2²⁷;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"Red [\\\"For loop with multiple ranges\\\"]\\n\\n->: make op! function [start end][\\n res: copy []\\n repeat n 1 + absolute to-integer end - start [\\n append res start + either start > end [1 - n][n - 1]\\n ]\\n]\\nby: make op! function [s w] [extract s absolute w]\\n\\nfor: function ['word ranges body][\\n inp: copy []\\n foreach c reduce ranges [append inp c]\\n foreach i inp [set word i do body]\\n]\\n\\n prod: 1\\n sum: 0\\n x: +5\\n y: -5\\n z: -2\\n one: 1\\nthree: 3\\nseven: 7\\n\\nfor j [\\n 0 - three -> (3 ** 3) by three\\n 0 - seven -> seven by x\\n 555 -> (550 - y)\\n 22 -> -28 by (0 - three)\\n 1927 -> 1939\\n x -> y by z\\n 11 ** x -> (11 ** x + one)\\n] [\\n sum: sum + absolute j;\\n if all [(absolute prod) < power 2 27 j <> 0] [prod: prod * j]\\n]\\nprint [\\\"sum: \\\" sum \\\"^/prod:\\\" prod]\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"/*REXX program emulates a multiple─range DO loop (all variables can be any numbers). */\\n prod= 1;\\n sum= 0;\\n x= +5;\\n y= -5;\\n z= -2;\\n one= 1;\\nthree= 3;\\nseven= 7;\\n\\n do j= -three to 3**3 by three ; call meat; end;\\n do j= -seven to seven by x ; call meat; end;\\n do j= 555 to 550 - y ; call meat; end;\\n do j= 22 to -28 by -three ; call meat; end;\\n do j= 1927 to 1939 ; call meat; end;\\n do j= x to y by z ; call meat; end;\\n do j= 11**x to 11**x + one ; call meat; end;\\n\\nsay ' sum= ' || commas( sum); /*display SUM with commas. */\\nsay 'prod= ' || commas(prod); /* \\\" PROD \\\" \\\" */\\nexit; /*stick a fork in it, we're done.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncommas: procedure; parse arg _; n= _'.9'; #= 123456789; b= verify(n, #, \\\"M\\\")\\n e= verify(n, #'0', , verify(n, #\\\"0.\\\", 'M') ) - 4\\n do j=e to b by -3; _= insert(',', _, j); end; return _\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nmeat: sum= sum + abs(j);\\n if abs(prod)<2**27 & j\\\\==0 then prod= prod * j;\\n return;\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"prod = 1\\ntotal = 0\\nx = 5\\ny = -5\\nz = -2\\none = 1\\nthree = 3\\nseven = 7\\n\\nloopset = [[-three,pow(3,3),three],\\n [-seven,seven,x],\\n [555,550 - y,1],\\n [22,-28,-three],\\n [1927,1939,1],\\n [x,y,z],\\n [pow(11,x),pow(11,x) + one,1]]\\n\\nfor i=1 to len(loopset)\\n f = loopset[i][1]\\n t = loopset[i][2]\\n s = loopset[i][3]\\n for j=f to t step s\\n total += fabs(j)\\n if fabs(prod)<pow(2,27) and j!=0\\n prod *= j\\n ok\\n next\\nnext\\n\\nsee \\\"total = \\\" + total + nl\\nsee \\\"product = \\\" + prod + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"x, y, z, one, three, seven = 5, -5, -2, 1, 3, 7\\n\\n\\nenums = (-three).step(3**3, three) +\\n (-seven).step(seven, x) +\\n 555 .step(550-y, -1) +\\n 22 .step(-28, -three) +\\n (1927..1939) + # just toying, 1927.step(1939) is fine too\\n x .step(y, z) +\\n (11**x) .step(11**x + one)\\n# enums is an enumerator, consisting of a bunch of chained enumerators,\\n# none of which has actually produced a value.\\n\\nputs \\\"Sum of absolute numbers: #{enums.sum(&:abs)}\\\"\\nprod = enums.inject(1){|prod, j| ((prod.abs < 2**27) && j!=0) ? prod*j : prod}\\nputs \\\"Product (but not really): #{prod}\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"prod := 1.\\nsum := 0.\\nx := 5.\\ny := -5.\\nz := -2.\\none := 1.\\nthree := 3.\\nseven := 7.\\n\\n(three negated to: 3**3 by: three ) ,\\n(seven negated to: seven by: x ) ,\\n(555 to: 550-y ) ,\\n(22 to: -28 by: three negated) ,\\n(1927 to: 1939 ) ,\\n(x to: y by:z ) ,\\n(11**x to: 11**x + one )\\n do:[:j |\\n sum := sum + j abs.\\n ((prod abs < (2**27)) and:[ j ~= 0 ]) ifTrue:[\\n prod := prod*j\\n ].\\n ].\\nTranscript show:' sum = '; showCR:sum.\\nTranscript show:'prod = '; showCR:prod\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"prod := 1.\\nsum := 0.\\nx := 5.\\ny := -5.\\nz := -2.\\none := 1.\\nthree := 3.\\nseven := 7.\\n\\naction :=\\n [:j |\\n sum := sum + j abs.\\n ((prod abs < (2**27)) and:[ j ~= 0 ]) ifTrue:[\\n prod := prod*j\\n ].\\n ].\\n\\n(three negated to: 3**3 by: three ) do:action.\\n(seven negated to: seven by: x ) do:action.\\n(555 to: 550-y ) do:action.\\n(22 to: -28 by: three negated) do:action.\\n(1927 to: 1939 ) do:action.\\n(x to: y by:z ) do:action.\\n(11**x to: 11**x + one ) do:action.\\nTranscript show:' sum = '; showCR:sum.\\nTranscript show:'prod = '; showCR:prod\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"...\\n{\\n (three negated to: 3**3 by: three ) .\\n (seven negated to: seven by: x ) .\\n (555 to: 550-y ) .\\n (22 to: -28 by: three negated) .\\n (1927 to: 1939 ) .\\n (x to: y by:z ) .\\n (11**x to: 11**x + one ) .\\n} do:[:eachRange |\\n eachRange\\n select:[:j | ((prod abs < (2**27)) and:[ j ~= 0 ]) ]\\n thenDo:[:j | prod := prod*j ].\\n ]\\n].\\n...\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"** arg\\n ^ self raisedTo: arg\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"SUB process(x)\\n LET sum = sum + abs(x)\\n IF abs(prod) < (2 ^ 27) and x <> 0 then LET prod = prod * x\\nEND SUB\\n\\nLET prod = 1\\nLET sum = 0\\nLET x = 5\\nLET y = -5\\nLET z = -2\\nLET one = 1\\nLET three = 3\\nLET seven = 7\\n\\nFOR j = -three to (3 ^ 3) step three\\n CALL process(j)\\nNEXT j\\nFOR j = -seven To seven Step x\\n CALL process(j)\\nNEXT j\\nFOR j = 555 to 550 - y\\n CALL process(j)\\nNEXT j\\nFOR j = 22 to -28 step -three\\n CALL process(j)\\nNEXT j\\nFOR j = 1927 to 1939\\n CALL process(j)\\nNEXT j\\nFOR j = x to y step z\\n CALL process(j)\\nNEXT j\\nFOR j = (11 ^ x) to (11 ^ x) + one\\n CALL process(j)\\nNEXT j\\nPRINT \\\" sum= \\\"; sum\\nPRINT \\\"prod= \\\"; prod\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"(defmacro mfor (:form f (var . range-triplets) . forms)\\n (with-gensyms (body toval stepval test)\\n ^(let (,var)\\n (flet ((,body () ,*forms))\\n ,*(append-each ((rt (tuples 3 range-triplets)))\\n (mac-param-bind f (from to step) rt\\n ^((set ,var ,from)\\n (for* ((,toval ,to)\\n (,stepval ,step)\\n (,test (if (<= ,var ,toval)\\n (fun <=) (fun >=))))\\n ([,test ,var ,toval])\\n ((inc ,var ,stepval))\\n (,body)))))))))\\n\\n(let ((prod 1) (sum 0)\\n (x 5) (y -5) (z -2)\\n (one 1) (three 3) (seven 7))\\n (mfor (j (- three) (expt 3 3) three\\n (- seven) seven x\\n 555 (- 550 y) 1\\n 22 -28 (- three)\\n 1927 1939 1\\n x y z\\n (expt 11 x) (succ (expt 11 x)) 1)\\n (upd sum (+ (abs j)))\\n (if (and (< (abs prod) (ash 1 27))\\n (nzerop j))\\n (upd prod (* j))))\\n (put-line `sum = @sum; prod = @prod`))\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"const int CHARBIT = 8;\\nlong prod = 1;\\nlong sum = 0;\\n\\nlong labs(long n) {\\n long mask = n >> ((long)sizeof(long) * CHARBIT - 1);\\n return ((n + mask) ^ mask);\\n}\\n\\nlong lpow(long base_num, long exp)\\n{\\n long result = 1;\\n while (true)\\n {\\n if ((exp & 1) != 0) result *= base_num;\\n exp >>= 1;\\n if (exp == 0) break;\\n base_num *= base_num;\\n }\\n return result;\\n}\\n\\nvoid process(long j) {\\n sum += labs(j);\\n if (labs(prod) < (1 << 27) && j != 0) prod *= j;\\n}\\n\\nvoid main() {\\n const int x = 5;\\n const int y = -5;\\n const int z = -2;\\n const int one = 1;\\n const int three = 3;\\n const int seven = 11;\\n long p = lpow(11, x);\\n\\n for (int j = -three; j <= lpow(3, 3); j += three ) process(j);\\n for (int j = -seven; j <= seven; j += x) process(j);\\n for (int j = 555; j <= 550 - y; ++j) process(j);\\n for (int j = 22; j >= -28; j -= three) process(j);\\n for (int j = 1928; j <= 1939; ++j) process(j);\\n for (int j = x; j >= y; j -= -z) process(j);\\n for (long j = p; j <= p + one; ++j) process(j);\\n stdout.printf(\\\"sum = %10ld\\\\n\\\", sum);\\n stdout.printf(\\\"prod = %10ld\\\\n\\\", prod);\\n}\\n\",\n \"language\": \"Vala\"\n },\n {\n \"code\": \"Dim prod As Long, sum As Long\\nPublic Sub LoopsWithMultipleRanges()\\n Dim x As Integer, y As Integer, z As Integer, one As Integer, three As Integer, seven As Integer, j As Long\\n prod = 1\\n sum = 0\\n x = 5\\n y = -5\\n z = -2\\n one = 1\\n three = 3\\n seven = 7\\n For j = -three To pow(3, 3) Step three: Call process(j): Next j\\n For j = -seven To seven Step x: Call process(j): Next j\\n For j = 555 To 550 - y: Call process(j): Next j\\n For j = 22 To -28 Step -three: Call process(j): Next j\\n For j = 1927 To 1939: Call process(j): Next j\\n For j = x To y Step z: Call process(j): Next j\\n For j = pow(11, x) To pow(11, x) + one: Call process(j): Next j\\n Debug.Print \\\" sum= \\\" & Format(sum, \\\"#,##0\\\")\\n Debug.Print \\\"prod= \\\" & Format(prod, \\\"#,##0\\\")\\nEnd Sub\\nPrivate Function pow(x As Long, y As Integer) As Long\\n pow = WorksheetFunction.Power(x, y)\\nEnd Function\\nPrivate Sub process(x As Long)\\n sum = sum + Abs(x)\\n If Abs(prod) < pow(2, 27) And x <> 0 Then prod = prod * x\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Partial Module Program\\n ' Stop and Step are language keywords and must be escaped with brackets.\\n Iterator Function Range(start As Integer, [stop] As Integer, Optional [step] As Integer = 1) As IEnumerable(Of Integer)\\n For i = start To [stop] Step [step]\\n Yield i\\n Next\\n End Function\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"Imports System.Globalization\\n\\nPartial Module Program\\n Sub Main()\\n ' All variables are inferred to be of type Integer.\\n Dim prod = 1,\\n sum = 0,\\n x = +5,\\n y = -5,\\n z = -2,\\n one = 1,\\n three = 3,\\n seven = 7\\n\\n ' The exponent operator compiles to a call to Math.Pow, which returns Double, and so must be converted back to Integer.\\n For Each j In Range(-three, CInt(3 ^ 3), 3 ).\\n Concat(Range(-seven, +seven, x )).\\n Concat(Range(555, 550 - y )).\\n Concat(Range(22, -28, -three)).\\n Concat(Range(1927, 1939 )).\\n Concat(Range(x, y, z )).\\n Concat(Range(CInt(11 ^ x), CInt(11 ^ x) + one ))\\n\\n sum = sum + Math.Abs(j)\\n If Math.Abs(prod) < 2 ^ 27 AndAlso j <> 0 Then prod = prod * j\\n Next\\n\\n ' The invariant format info by default has two decimal places.\\n Dim format As New NumberFormatInfo() With {\\n .NumberDecimalDigits = 0\\n }\\n\\n Console.WriteLine(String.Format(format, \\\" sum= {0:N}\\\", sum))\\n Console.WriteLine(String.Format(format, \\\"prod= {0:N}\\\", prod))\\n End Sub\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \" <Runtime.CompilerServices.Extension>\\n Function ConcatRange(source As IEnumerable(Of Integer), start As Integer, [stop] As Integer, Optional [step] As Integer = 1) As IEnumerable(Of Integer)\\n Return source.Concat(Range(start, [stop], [step]))\\n End Function\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \" For Each j In Range(-three, CInt(3 ^ 3), 3 ).\\n ConcatRange(-seven, +seven, x ).\\n ConcatRange(555, 550 - y ).\\n ConcatRange(22, -28, -three).\\n ConcatRange(1927, 1939 ).\\n ConcatRange(x, y, z ).\\n ConcatRange(CInt(11 ^ x), CInt(11 ^ x) + one )\\n Next\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \" Function Range(ParamArray ranges() As (start As Integer, [stop] As Integer, [step] As Integer)) As IEnumerable(Of Integer)\\n ' Note: SelectMany is equivalent to bind, flatMap, etc.\\n Return ranges.SelectMany(Function(r) Range(r.start, r.stop, r.step))\\n End Function\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \" For Each j In Range((-three, CInt(3 ^ 3), 3 ),\\n (-seven, +seven, x ),\\n (555, 550 - y, 1 ),\\n (22, -28, -three ),\\n (1927, 1939, 1 ),\\n (x, y, z ),\\n (CInt(11 ^ x), CInt(11 ^ x) + one, 1 ))\\n Next\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \" Function Range(ParamArray ranges As Integer()()) As IEnumerable(Of Integer)\\n Return ranges.SelectMany(Function(r) Range(r(0), r(1), If(r.Length < 3, 1, r(2))))\\n End Function\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \" For Each j In Range({-three, CInt(3 ^ 3), 3 },\\n {-seven, +seven, x },\\n {555, 550 - y },\\n {22, -28, -three },\\n {1927, 1939 },\\n {x, y, z },\\n {CInt(11 ^ x), CInt(11 ^ x) + one })\\n Next\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar prod = 1\\nvar sum = 0\\nvar x = 5\\nvar y = -5\\nvar z = -2\\nvar one = 1\\nvar three = 3\\nvar seven = 7\\nvar p = 11.pow(x)\\nvar j = 0\\n\\nvar process = Fn.new {\\n sum = sum + j.abs\\n if (prod.abs < (1 << 27) && j != 0) prod = prod * j\\n}\\n\\nj = -three\\nwhile (j <= 3.pow(3)) {\\n process.call()\\n j = j + three\\n}\\n\\nj = -seven\\nwhile (j <= seven) {\\n process.call()\\n j = j + x\\n}\\n\\nj = 555\\nwhile (j <= 550 - y) {\\n process.call()\\n j = j + 1\\n}\\n\\nj = 22\\nwhile (j >= -28) {\\n process.call()\\n j = j - three\\n}\\n\\nj = 1927\\nwhile (j <= 1939) {\\n process.call()\\n j = j + 1\\n}\\n\\nj = x\\nwhile (j >= y) {\\n process.call()\\n j = j - (-z)\\n}\\n\\nj = p\\nwhile (j <= p + one) {\\n process.call()\\n j = j + 1\\n}\\n\\nFmt.print(\\\"sum = $,d\\\", sum)\\nFmt.print(\\\"prod = $,d\\\", prod)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func IPow(A, B); \\\\Return A**B\\nint A, B;\\nreturn fix(Pow(float(A), float(B)));\\n\\nint Prod, Sum, X, Y, Z, One, Three, Seven, J;\\n\\n proc Block;\\n begin \\\\ABS(n) = absolute value\\n Sum:= Sum + abs(J); \\\\add absolute value of J.\\n if abs(Prod)<1<<27 & J#0 then Prod:=Prod*J; \\\\PROD is small enough & J\\n end; \\\\not 0, then multiply it.\\n\\nbegin \\\\all variables are DECLARED as integers.\\n Prod:= 1; \\\\start with a product of unity.\\n Sum:= 0; \\\\ \\\" \\\" \\\" sum \\\" zero.\\n X:= +5;\\n Y:= -5;\\n Z:= -2;\\n One:= 1;\\n Three:= 3;\\n Seven:= 7;\\n\\n for J:= -Three to 3*3*3 do [Block; J:= J+Three-1];\\n for J:= -Seven to +Seven do [Block; J:= J+X-1];\\n for J:= 555 to 550 - Y do Block;\\n for J:= 22 downto -28 do [Block; J:= J-Three+1];\\n for J:= 1927 to 1939 do Block;\\n for J:= X downto Y do [Block; J:= J+Z+1];\\n for J:= IPow(11,X) to IPow(11,X)+One do Block;\\n\\n \\\\SUM and PROD are used for verification of J incrementation.\\nText(0, \\\" Sum= \\\"); IntOut(0, Sum); CrLf(0); \\\\display strings to term.\\nText(0, \\\"Prod= \\\"); IntOut(0, Prod); CrLf(0); \\\\ \\\" \\\" \\\" \\\"\\nend\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"sub process(x)\\n\\tsum = sum + abs(x)\\n\\tif abs(prod) < (2 ^ 27) and x <> 0 then prod = prod * x : fi\\nend sub\\n\\nprod = 1\\nsum = 0\\nx = 5 : y = -5 : z = -2\\none = 1 : three = 3 : seven = 7\\n\\nfor j = -three to (3 ^ 3) step three: process(j): next j\\nfor j = -seven to seven step x: process(j): next j\\nfor j = 555 to 550 - y: process(j): next j\\nfor j = 22 to -28 step -three: process(j): next j\\nfor j = 1927 to 1939: process(j): next j\\nfor j = x to y step z: process(j): next j\\nfor j = (11 ^ x) to (11 ^ x) + one: process(j): next j\\n\\nprint \\\" sum= \\\", sum using \\\"###,###\\\"\\nprint \\\"prod= \\\", prod using \\\"####,###,###\\\"\\nend\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"prod,sum := 1,0; /* start with a product of unity, sum of 0 */\\nx,y,z := 5, -5, -2;\\none,three,seven := 1,3,7;\\nforeach j in (Walker.chain([-three..(3).pow(3),three], // do these sequentially\\n [-seven..seven,x], [555..550 - y], [22..-28,-three], #[start..last,step]\\n [1927..1939], [x..y,z], [(11).pow(x)..(11).pow(x) + one])){\\n sum+=j.abs();\\t/* add absolute value of J */\\n if(prod.abs()<(2).pow(27) and j!=0) prod*=j; /* PROD is small enough & J */\\n}\\n/* SUM and PROD are used for verification of J incrementation */\\nprintln(\\\"sum = %,d\\\\nprod = %,d\\\".fmt(sum,prod));\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Loops-With-multiple-ranges"}}},{"rowIdx":451,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Loop modifiers\nfrom: http://rosettacode.org/wiki/Loops/Wrong_ranges\nnote: Iteration\n","language":"00-META"},{"code":"Some languages have syntax or function(s) to generate a range of numeric values from a start value, a stop value, and an increment.\n\nThe purpose of this task is to select the range syntax/function that would generate at least two increasing numbers when given a stop value more than the start value and a positive increment of less than half the difference. You are then to use that ''same'' syntax/function but with different parameters; and show, here, what would happen.\n\nUse these values if possible:\n::::: {| class=\"wikitable\"\n!start ||stop ||increment ||Comment\n|-\n| -2||2||1||Normal\n|-\n| -2||2||0||Zero increment\n|-\n| -2||2||-1||Increments away from stop value\n|-\n| -2||2||10||First increment is beyond stop value\n|-\n|2||-2||1||Start more than stop: positive increment\n|-\n|2||2||1||Start equal stop: positive increment\n|-\n|2||2||-1||Start equal stop: negative increment\n|-\n|2||2||0||Start equal stop: zero increment\n|-\n|0||0||0||Start equal stop equal zero: zero increment\n|}\n\n;Related tasks:\n* [[Loop over multiple arrays simultaneously]]\n* [[Loops/Break]]\n* [[Loops/Continue]]\n* [[Loops/Do-while]]\n* [[Loops/Downward for]]\n* [[Loops/For]]\n* [[Loops/For with a specified step]]\n* [[Loops/Foreach]]\n* [[Loops/Increment loop index within loop body]]\n* [[Loops/Infinite]]\n* [[Loops/N plus one half]]\n* [[Loops/Nested]]\n* [[Loops/While]]\n* [[Loops/with multiple ranges]]\n* [[Loops/Wrong ranges]]\n<br><br>\n\n","language":"00-TASK"},{"code":"F displayRange(first, last, step)\n print(‘(#2, #2, #2): ’.format(first, last, step), end' ‘’)\n I step == 0\n print(‘not allowed.’)\n E\n print(Array((first..last).step(step)))\n\nL(f, l, s) [(-2, 2, 1), (-2, 2, 0), (-2, 2, -1),\n (-2, 2, 10), (2, -2, 1), ( 2, 2, 1),\n ( 2, 2, -1), (2, 2, 0), ( 0, 0, 0)]\n displayRange(f, l, s)\n","language":"11l"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\nwith Ada.Strings.Unbounded; use Ada.Strings.Unbounded;\nwith Ada.Text_IO.Unbounded_IO; use Ada.Text_IO.Unbounded_IO;\n\nprocedure Main is\n procedure print_range(start : integer; stop : integer; step : integer) is\n Num : Integer := start;\n begin\n Put(\"Range(\" & start'Image & \", \" & stop'image &\n \", \" & step'image & \") => \");\n if stop < start then\n Put_Line(\"Error: stop must be no less than start!\");\n elsif step not in positive then\n Put_Line(\"Error: increment must be greater than 0!\");\n elsif start = stop then\n Put_Line(start'image);\n else\n while num <= stop loop\n Put(num'Image);\n num := num + step;\n end loop;\n New_Line;\n end if;\n end print_range;\n\n type test_record is record\n start : integer;\n stop : integer;\n step : integer;\n comment : unbounded_string := null_unbounded_string;\n end record;\n\n tests : array(1..9) of test_record :=\n ( 1 => (-2, 2, 1, To_Unbounded_String(\"Normal\")),\n 2 => (-2, 2, 0, To_Unbounded_String(\"Zero increment\")),\n 3 => (-2, 2, -1, To_Unbounded_String(\"Increments away from stop value\")),\n 4 => (-2, 2, 10, To_Unbounded_String(\"First increment is beyond stop value\")),\n 5 => (2, -1, 1, To_Unbounded_String(\"Start more than stop: positive increment\")),\n 6 => (2, 2, 1, To_Unbounded_String(\"Start equal stop: positive increment\")),\n 7 => (2, 2, -1, To_Unbounded_String(\"Start equal stop: negative increment\")),\n 8 => (2, 2, 0, To_Unbounded_String(\"Start equal stop: zero increment\")),\n 9 => (0, 0, 0, To_Unbounded_String(\"Start equal stop equal zero: zero increment\")));\n\n\nbegin\n for test of tests loop\n Put(Test.Comment); Put(\" : \");\n print_range(test.start, test.stop, test.step);\n New_line;\n end loop;\nend Main;\n","language":"Ada"},{"code":"BEGIN\n # returns the first n elements of the sequences of values specified by start, stop and increment #\n PROC sequence = ( INT n, start, stop, increment )[]INT:\n BEGIN\n [ 1 : n ]INT s;\n FOR j FROM LWB s TO UPB s DO s[ j ] := 0 OD;\n INT s pos := LWB s - 1;\n FOR j FROM start BY increment TO stop WHILE s pos < n DO\n s[ s pos +:= 1 ] := j\n OD;\n s[ LWB s : s pos ]\n END # sequence # ;\n\n # tests the sequence procedure #\n PROC test sequence = ( INT start, stop, increment, STRING legend )VOID:\n BEGIN\n []INT s = sequence( 10, start, stop, increment );\n print( ( legend, \": \" ) );\n FOR i FROM LWB s TO UPB s DO print( ( \" \", whole( s[ i ], -4 ) ) ) OD;\n print( ( newline ) )\n END # test sequence # ;\n # task trest cases #\n\n test sequence( -2, 2, 1, \"Normal \" );\n test sequence( -2, 2, 0, \"Zero increment \" );\n test sequence( -2, 2, -1, \"Increments away from stop value \" );\n test sequence( -2, 2, 10, \"First increment is beyond stop value \" );\n test sequence( 2, -2, 1, \"Start more than stop: positive increment \" );\n test sequence( 2, 2, 1, \"Start equal stop: positive increment \" );\n test sequence( 2, 2, -1, \"Start equal stop: negative increment \" );\n test sequence( 2, 2, 0, \"Start equal stop: zero increment \" );\n test sequence( 0, 0, 0, \"Start equal stop equal zero: zero increment\" )\n\nEND\n","language":"ALGOL-68"},{"code":"begin\n % sets the first n elements of s to the sequences of values specified by start, stop and increment %\n % s( 0 ) is set to the number of elements of s that have been set, in case the sequence ends before n %\n procedure sequence ( integer array s ( * )\n ; integer value n, start, stop, increment\n ) ;\n begin\n integer sPos;\n for j := 0 until n do s( j ) := 0;\n sPos := 1;\n for j := start step increment until stop do begin\n if sPos > n then goto done;\n s( sPos ) := j;\n s( 0 ) := s( 0 ) + 1;\n sPos := sPos + 1;\n end for_j ;\ndone:\n end sequence ;\n % tests the sequence procedure %\n procedure testSequence( integer value start, stop, increment\n ; string(48) value legend\n ) ;\n begin\n integer array s ( 0 :: 10 );\n sequence( s, 10, start, stop, increment );\n s_w := 0; % set output formating %\n i_w := 4;\n write( legend, \": \" );\n for i := 1 until s( 0 ) do writeon( s( i ) )\n end testSequence ;\n % task trest cases %\n testSequence( -2, 2, 1, \"Normal\" );\n testSequence( -2, 2, 0, \"Zero increment\" );\n testSequence( -2, 2, -1, \"Increments away from stop value\" );\n testSequence( -2, 2, 10, \"First increment is beyond stop value\" );\n testSequence( 2, -2, 1, \"Start more than stop: positive increment\" );\n testSequence( 2, 2, 1, \"Start equal stop: positive increment\" );\n testSequence( 2, 2, -1, \"Start equal stop: negative increment\" );\n testSequence( 2, 2, 0, \"Start equal stop: zero increment\" );\n testSequence( 0, 0, 0, \"Start equal stop equal zero: zero increment\" )\nend.\n","language":"ALGOL-W"},{"code":"0 LIMIT = 10 :MAX=1E37\n10 DATA-2,2,1,NORMAL\n20 DATA-2,2,0,ZERO INCREMENT\n30 DATA-2,2,-1,INCREMENTS AWAY FROM STOP VALUE\n40 DATA-2,2,10,FIRST INCREMENT IS BEYOND STOP VALUE\n50 DATA2,-2,1,\"START MORE THAN STOP: POSITIVE INCREMENT\n60 DATA2,2,1,\"START EQUAL STOP: POSITIVE INCREMENT\n70 DATA2,2,-1,\"START EQUAL STOP: NEGATIVE INCREMENT\n80 DATA2,2,0,\"START EQUAL STOP: ZERO INCREMENT\n90 DATA0,0,0,\"START EQUAL STOP EQUAL ZERO: ZERO INCREMENT\n100 FOR I = 1 TO 9\n110 READ START,FINISH,INCR,COMMENT$\n120 PRINT CHR$(13)COMMENT$\n130 LAST = FINISH\n140 REM D = SGN(FINISH - START)\n150 REM IF D AND NOT (D = SGN(INCR)) THEN LAST = SGN(INCR)*MAX\n160 PRINT TAB(5)CHR$(91)\" \"MID$(\" \",(START<0)+1)START\" TO \"MID$(\" \",(FINISH<0)+1)FINISH\" STEP \"MID$(\" \",(INCR<0)+1)INCR\" ] \";\n170 COUNT = 0\n180 PRINT MID$(\" \",(START<0)+1);\n190 FOR J = START TO LAST STEP INCR\n200 PRINT MID$(\" \",(COUNT=0)+1)J;\n210 IF COUNT < LIMIT THEN COUNT = COUNT + 1 : NEXT J\n220 IF COUNT = LIMIT THEN PRINT \" ... \";:if ABS(LAST) = MAX THEN PRINT MID$(\"-\",SGN(LAST)+2,1)\"INFINITY\";\n230 NEXT I\n","language":"Applesoft-BASIC"},{"code":"print \"start stop increment\"\n\nloop @[\n neg 2 2 1\n neg 2 2 0\n neg 2 2 neg 1\n neg 2 2 10\n 2 neg 2 1\n 2 2 1\n 2 2 neg 1\n 2 2 0\n 0 0 0 ]\n[start stop increment] ->\n print [\n pad ~\"|start|\" 2 pad ~\"|stop|\" 7 pad ~\"|increment|\" 7\n pad \"->\" 9 try? -> @range.step: increment start stop\n else -> \"Error\"\n ]\n","language":"Arturo"},{"code":"# syntax: GAWK -f LOOPS_WRONG_RANGES.AWK\nBEGIN {\n arr[++n] = \"-2, 2, 1,Normal\"\n arr[++n] = \"-2, 2, 0,Zero increment\"\n arr[++n] = \"-2, 2,-1,Increments away from stop value\"\n arr[++n] = \"-2, 2,10,First increment is beyond stop value\"\n arr[++n] = \" 2,-2, 1,Start more than stop: positive increment\"\n arr[++n] = \" 2, 2, 1,Start equal stop: positive increment\"\n arr[++n] = \" 2, 2,-1,Start equal stop: negative increment\"\n arr[++n] = \" 2, 2, 0,Start equal stop: zero increment\"\n arr[++n] = \" 0, 0, 0,Start equal stop equal zero: zero increment\"\n print(\"start,stop,increment,comment\")\n for (i=1; i<=n; i++) {\n split(arr[i],A,\",\")\n printf(\"%-52s : \",arr[i])\n count = 0\n for (j=A[1]; j<=A[2] && count<10; j+=A[3]) {\n printf(\"%d \",j)\n count++\n }\n printf(\"\\n\")\n }\n exit(0)\n}\n","language":"AWK"},{"code":"arraybase 1\ndim start(9) : dim fin(9) : dim inc(9) : dim cmt$(9)\nstart[1] = -2 : fin[1] = 2 : inc[1] = 1 : cmt$[1] = \"Normal\"\nstart[2] = -2 : fin[2] = 2 : inc[2] = 0 : cmt$[2] = \"Zero increment\"\nstart[3] = -2 : fin[3] = 2 : inc[3] = -1 : cmt$[3] = \"Increments away from stop value\"\nstart[4] = -2 : fin[4] = 2 : inc[4] = 10 : cmt$[4] = \"First increment is beyond stop value\"\nstart[5] = 2 : fin[5] = -2 : inc[5] = 1 : cmt$[5] = \"Start more than stop: positive increment\"\nstart[6] = 2 : fin[6] = 2 : inc[6] = 1 : cmt$[6] = \"Start equal stop: positive increment\"\nstart[7] = 2 : fin[7] = 2 : inc[7] = -1 : cmt$[7] = \"Start equal stop: negative increment\"\nstart[8] = 2 : fin[8] = 2 : inc[8] = 0 : cmt$[8] = \"Start equal stop: zero increment\"\nstart[9] = 0 : fin[9] = 0 : inc[9] = 0 : cmt$[9] = \"Start equal stop equal zero: zero increment\"\n\nfor i = 1 to 9\n contar = 0\n print cmt$[i]\n print \" Bucle de \"; start[i]; \" a \"; fin[i]; \" en incrementos de \"; inc[i]\n for vr = start[i] to fin[i] step inc[i]\n print \" Índice del bucle = \"; vr\n contar = contar + 1\n if contar = 10 then\n print \" Saliendo de un bucle infinito\"\n exit for\n endif\n next vr\n print \" Bucle terminado\" & chr(10) & chr(10)\nnext i\nend\n","language":"BASIC256"},{"code":"#include <stdio.h>\n\n#define TRUE 1\n#define FALSE 0\n\ntypedef int bool;\n\ntypedef struct {\n int start, stop, incr;\n const char *comment;\n} S;\n\nS examples[9] = {\n {-2, 2, 1, \"Normal\"},\n {-2, 2, 0, \"Zero increment\"},\n {-2, 2, -1, \"Increments away from stop value\"},\n {-2, 2, 10, \"First increment is beyond stop value\"},\n {2, -2, 1, \"Start more than stop: positive increment\"},\n {2, 2, 1, \"Start equal stop: positive increment\"},\n {2, 2, -1, \"Start equal stop: negative increment\"},\n {2, 2, 0, \"Start equal stop: zero increment\"},\n {0, 0, 0, \"Start equal stop equal zero: zero increment\"}\n};\n\nint main() {\n int i, j, c;\n bool empty;\n S s;\n const int limit = 10;\n for (i = 0; i < 9; ++i) {\n s = examples[i];\n printf(\"%s\\n\", s.comment);\n printf(\"Range(%d, %d, %d) -> [\", s.start, s.stop, s.incr);\n empty = TRUE;\n for (j = s.start, c = 0; j <= s.stop && c < limit; j += s.incr, ++c) {\n printf(\"%d \", j);\n empty = FALSE;\n }\n if (!empty) printf(\"\\b\");\n printf(\"]\\n\\n\");\n }\n return 0;\n}\n","language":"C"},{"code":"#include <cstdint>\n#include <iomanip>\n#include <iostream>\n#include <string>\n#include <vector>\n\nstruct LoopData {\n\tint32_t start;\n\tint32_t stop;\n\tint32_t increment;\n\tstd::string comment;\n};\n\nvoid print_vector(const std::vector<int32_t>& list) {\n\tstd::cout << \"[\";\n\tfor ( uint64_t i = 0; i < list.size(); ++i ) {\n\t\tstd::cout << list[i];\n\t\tif ( i < list.size() - 1 ) {\n\t\t\tstd::cout << \", \";\n\t\t}\n\t}\n\tstd::cout << \"]\";\n}\n\nvoid runTest(const LoopData& loop_data) {\n\tstd::vector<int32_t> values{};\n\tfor ( int32_t i = loop_data.start; i <= loop_data.stop; i += loop_data.increment ) {\n\t\tvalues.emplace_back(i);\n\t\tif ( values.size() >= 10 ) {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tstd::cout << std::left << std::setw(45) << loop_data.comment; print_vector(values);\n\tstd::cout << ( values.size() == 10 ? \" (loops forever)\" : \"\" ) << std::endl;\n}\n\nint main() {\n\trunTest(LoopData(-2, 2, 1, \"Normal\"));\n\trunTest(LoopData(-2, 2, 0, \"Zero increment\"));\n\trunTest(LoopData(-2, 2, -1, \"Increments away from stop value\"));\n\trunTest(LoopData(-2, 2, 10, \"First increment is beyond stop value\"));\n\trunTest(LoopData(2, -2, 1, \"Start more than stop: positive increment\"));\n\trunTest(LoopData(2, 2, 1, \"Start equal stop: positive increment\"));\n\trunTest(LoopData(2, 2, -1, \"Start equal stop: negative increment\"));\n\trunTest(LoopData(2, 2, 0, \"Start equal stop: zero increment\"));\n\trunTest(LoopData(0, 0, 0, \"Start equal stop equal zero: zero increment\"));\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\n\nstatic class Program\n{\n static void Main()\n {\n Example(-2, 2, 1, \"Normal\");\n Example(-2, 2, 0, \"Zero increment\");\n Example(-2, 2, -1, \"Increments away from stop value\");\n Example(-2, 2, 10, \"First increment is beyond stop value\");\n Example(2, -2, 1, \"Start more than stop: positive increment\");\n Example(2, 2, 1, \"Start equal stop: positive increment\");\n Example(2, 2, -1, \"Start equal stop: negative increment\");\n Example(2, 2, 0, \"Start equal stop: zero increment\");\n Example(0, 0, 0, \"Start equal stop equal zero: zero increment\");\n }\n\n static IEnumerable<int> Range(int start, int stop, int increment)\n {\n // To replicate the (arguably more correct) behavior of VB.NET:\n //for (int i = start; increment >= 0 ? i <= stop : stop <= i; i += increment)\n\n // Decompiling the IL emitted by the VB compiler (uses shifting right by 31 as the signum function and bitwise xor in place of the conditional expression):\n //for (int i = start; ((increment >> 31) ^ i) <= ((increment >> 31) ^ stop); i += increment)\n\n // \"Naïve\" translation.\n for (int i = start; i <= stop; i += increment)\n yield return i;\n }\n\n static void Example(int start, int stop, int increment, string comment)\n {\n // Add a space, pad to length 50 with hyphens, and add another space.\n Console.Write((comment + \" \").PadRight(50, '-') + \" \");\n\n const int MAX_ITER = 9;\n\n int iteration = 0;\n foreach (int i in Range(start, stop, increment))\n {\n Console.Write(\"{0,2} \", i);\n\n if (++iteration > MAX_ITER) break;\n }\n\n Console.WriteLine();\n }\n}\n","language":"C-sharp"},{"code":"using System;\n\nstatic class Program {\n struct S {\n public int Start, Stop, Incr;\n public string Comment;\n }\n\n static readonly S[] examples = {\n new S{Start=-2, Stop=2, Incr=1, Comment=\"Normal\"},\n new S{Start=-2, Stop=2, Incr=0, Comment=\"Zero increment\"},\n new S{Start=-2, Stop=2, Incr=-1, Comment=\"Increments away from stop value\"},\n new S{Start=-2, Stop=2, Incr=10, Comment=\"First increment is beyond stop value\"},\n new S{Start=2, Stop=-2, Incr=1, Comment=\"Start more than stop: positive increment\"},\n new S{Start=2, Stop=2, Incr=1, Comment=\"Start equal stop: positive increment\"},\n new S{Start=2, Stop=2, Incr=-1, Comment=\"Start equal stop: negative increment\"},\n new S{Start=2, Stop=2, Incr=0, Comment=\"Start equal stop: zero increment\"},\n new S{Start=0, Stop=0, Incr=0, Comment=\"Start equal stop equal zero: zero increment\"}\n };\n\n static int Main() {\n const int limit = 10;\n bool empty;\n for (int i = 0; i < 9; ++i) {\n S s = examples[i];\n Console.Write(\"{0}\\n\", s.Comment);\n Console.Write(\"Range({0:d}, {1:d}, {2:d}) -> [\", s.Start, s.Stop, s.Incr);\n empty = true;\n for (int j = s.Start, c = 0; j <= s.Stop && c < limit; j += s.Incr, ++c) {\n Console.Write(\"{0:d} \", j);\n empty = false;\n }\n if (!empty) Console.Write(\"\\b\");\n Console.Write(\"]\\n\\n\");\n }\n return 0;\n }\n}\n","language":"C-sharp"},{"code":"100 cls\n110 for i = 1 to 9\n120 contar = 0\n130 read start,fin,inc,cmt$\n140 print cmt$\n150 print \" Bucle de \";start;\"a \";fin;\" en incrementos de \";inc\n160 for vr = start to fin step inc\n170 print \" Indice del bucle = \";vr\n180 contar = contar+1\n190 if contar = 10 then\n200 print \" Saliendo de un bucle infinito\"\n210 goto 240\n220 endif\n230 next vr\n240 print \" Bucle terminado\" : print : print\n250 next i\n260 end\n270 data -2,2,1,\"Normal\",-2,2,0,\"Zero increment\",-2,2,-1,\"Increments away from stop value\"\n280 data -2,2,10,\"First increment is beyond stop value\",2,-2,1,\"Start more than stop: positive increment\"\n290 data 2,2,1,\"Start equal stop: positive increment\",2,2,-1,\"Start equal stop: negative increment\"\n300 data 2,2,0,\"Start equal stop: zero increment\",0,0,0,\"Start equal stop equal zero: zero increment\"\n","language":"Chipmunk-Basic"},{"code":"(dolist (lst '((-2 2 1 \"Normal\")\t ; Iterate the parameters list `start' `stop' `increment' and `comment'\n\t (-2 2 0 \"Zero increment\")\n\t (-2 2 -1 \"Increments away from stop value\")\n\t (-2 2 10 \"First increment is beyond stop value\")\n\t ( 2 -2 1 \"Start more than stop: positive increment\")\n\t ( 2 2 1 \"Start equal stop: positive increment\")\n\t ( 2 2 -1 \"Start equal stop: negative increment\")\n\t ( 2 2 0 \"Start equal stop: zero increment\")\n\t ( 0 0 0 \"Start equal stop equal zero: zero increment\")))\n (do ((i (car lst) (incf i (caddr lst))) ; Initialize `start' and set `increment'\n (result ())\t\t\t ; Initialize the result list\n (loop-max 0 (incf loop-max)))\t ; Initialize a loop limit\n ((or (> i (cadr lst))\t\t ; Break condition to `stop'\n\t (> loop-max 10))\t\t ; Break condition to loop limit\n (format t \"~&~44a: ~{~3d ~}\"\t ; Finally print\n\t (cadddr lst)\t\t ; The `comment'\n\t (reverse result)))\t ; The in(de)creased numbers into result\n (push i result)))\t\t\t ; Add the number to result\n","language":"Common-Lisp"},{"code":"program Wrong_ranges;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils;\n\nprocedure Example(start, stop, Increment: Integer; comment: string);\nvar\n MAX_ITER, iteration, i: Integer;\nbegin\n Write((comment + ' ').PadRight(50, '-') + ' ');\n MAX_ITER := 9;\n iteration := 0;\n\n if Increment = 1 then\n begin\n for i := start to stop do\n begin\n Write(i: 2, ' ');\n inc(iteration);\n if iteration >= MAX_ITER then\n Break;\n end;\n Writeln;\n exit;\n end;\n\n if Increment = -1 then\n begin\n for i := start downto stop do\n begin\n Write(i: 2, ' ');\n inc(iteration);\n if iteration >= MAX_ITER then\n Break;\n end;\n Writeln;\n exit;\n end;\n\n Writeln('Not supported');\nend;\n\nbegin\n Example(-2, 2, 1, 'Normal');\n Example(-2, 2, 0, 'Zero increment');\n Example(-2, 2, -1, 'Increments away from stop value');\n Example(-2, 2, 10, 'First increment is beyond stop value');\n Example(2, -2, 1, 'Start more than stop: positive increment');\n Example(2, 2, 1, 'Start equal stop: positive increment');\n Example(2, 2, -1, 'Start equal stop: negative increment');\n Example(2, 2, 0, 'Start equal stop: zero increment');\n Example(0, 0, 0, 'Start equal stop equal zero: zero increment');\n Readln;\nend.\n","language":"Delphi"},{"code":"program Wrong_rangesEnumerator;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils;\n\ntype\n TRange = record\n private\n Fincrement: Integer;\n FIndex: Integer;\n FStart, FStop, FValue: Integer;\n function GetCurrent: Integer; inline;\n public\n constructor Create(start, stop, Increment: Integer);\n function MoveNext: Boolean; inline;\n function GetEnumerator: TRange;\n property Current: Integer read GetCurrent;\n end;\n\n{ TEnumerator<T> }\n\nconstructor TRange.Create(start, stop, Increment: Integer);\nbegin\n FStart := start;\n FStop := stop;\n Fincrement := Increment;\n FValue := start - Increment;\nend;\n\nfunction TRange.GetCurrent: Integer;\nbegin\n Result := FValue;\nend;\n\nfunction TRange.GetEnumerator: TRange;\nbegin\n Result := self;\nend;\n\nfunction TRange.MoveNext: Boolean;\nbegin\n FValue := FValue + Fincrement;\n if (Fincrement > 0) and (FValue > FStop) then\n exit(False);\n\n if (Fincrement < 0) and (FValue < FStop) then\n exit(False);\n\n Result := True;\nend;\n\nprocedure Example(start, stop, Increment: Integer; comment: string);\nvar\n MAX_ITER, iteration, i, e: Integer;\nbegin\n Write((comment + ' ').PadRight(50, '-') + ' ');\n MAX_ITER := 9;\n iteration := 0;\n\n for e in TRange.Create(start, stop, Increment) do\n begin\n Write(e: 2, ' ');\n inc(iteration);\n if iteration >= MAX_ITER then\n Break;\n end;\n\n Writeln;\nend;\n\nbegin\n Example(-2, 2, 1, 'Normal');\n Example(-2, 2, 0, 'Zero increment');\n Example(-2, 2, -1, 'Increments away from stop value');\n Example(-2, 2, 10, 'First increment is beyond stop value');\n Example(2, -2, 1, 'Start more than stop: positive increment');\n Example(2, 2, 1, 'Start equal stop: positive increment');\n Example(2, 2, -1, 'Start equal stop: negative increment');\n Example(2, 2, 0, 'Start equal stop: zero increment');\n Example(0, 0, 0, 'Start equal stop equal zero: zero increment');\n Readln;\nend.\n","language":"Delphi"},{"code":"example\n\t\t-- Loops/Wrong ranges\n\tdo\n\t\t⟳ ic:(-2 |..| 2) ¦ \t\t\t\tdo_nothing ⟲ -- 2 \t2 \t 1 \tNormal\n\t\t⟳ ic:(-2 |..| 2).new_cursor + 0 ¦ \t\tdo_nothing ⟲ -- -2 \t2 \t 0 \tZero increment\n\t\t⟳ ic:(-2 |..| 2).new_cursor - 1 ¦ \t\tdo_nothing ⟲ -- -2 \t2 \t-1 \tIncrements away from stop value\n\t\t⟳ ic:(-2 |..| 2).new_cursor + 10 ¦ \t\tdo_nothing ⟲ -- -2 \t2 \t10 \tFirst increment is beyond stop value\n\t\t⟳ ic:(-2 |..| 2).new_cursor.reversed ¦ \t\tdo_nothing ⟲ -- 2 \t-2 \t 1 \tStart more than stop: positive increment\n\t\t⟳ ic:(2 |..| 2) ¦ \t\t\t\tdo_nothing ⟲ -- 2 \t2 \t 1 \tStart equal stop: positive increment\n\t\t⟳ ic:(2 |..| 2).new_cursor - 1 ¦ \t\tdo_nothing ⟲ -- 2 \t2 \t-1 \tStart equal stop: negative increment\n\t\t⟳ ic:(2 |..| 2).new_cursor + 0 ¦ \t\tdo_nothing ⟲ -- 2 \t2 \t 0 \tStart equal stop: zero increment\n\t\t⟳ ic:(0 |..| 0).new_cursor + 0 ¦ \t\tdo_nothing ⟲ -- 0 \t0 \t 0 \tStart equal stop equal zero: zero increment\n\tend\n","language":"Eiffel"},{"code":"USING: continuations formatting io kernel math.ranges\nprettyprint sequences ;\n\n: try-range ( from length step -- )\n [ <range> { } like . ]\n [ 4drop \"Exception: divide by zero.\" print ] recover ;\n\n{\n { -2 2 1 } { 2 2 0 } { -2 2 -1 } { -2 2 10 } { 2 -2 1 }\n { 2 2 1 } { 2 2 -1 } { 2 2 0 } { 0 0 0 }\n}\n[\n first3\n [ \"%2d %2d %2d <range> => \" printf ]\n [ try-range ] 3bi\n] each\n","language":"Factor"},{"code":"for a = -2 to 2 by 1 do !(a,' '); od;\nfor a = -2 to 2 by 0 do !(a,' '); od;\nfor a = -2 to 2 by -1 do !(a,' '); od;\nfor a = -2 to 2 by 10 do !(a,' '); od;\nfor a = 2 to -2 by 1 do !(a,' '); od;\nfor a = 2 to 2 by 1 do !(a,' '); od;\nfor a = 2 to 2 by -1 do !(a,' '); od;\nfor a = 2 to 2 by 0 do !(a,' '); od;\nfor a = 0 to 0 by 0 do !(a,' '); od;\n","language":"Fermat"},{"code":": test-seq ( start stop inc -- )\n cr rot dup .\" start: \" 2 .r\n rot dup .\" stop: \" 2 .r\n rot dup .\" inc: \" 2 .r .\" | \"\n -rot swap do i . dup +loop drop ;\n-2 2 1 test-seq\n-2 2 0 test-seq\n-2 2 -1 test-seq\n-2 2 10 test-seq\n 2 -2 1 test-seq\n 2 2 1 test-seq\n 2 2 -1 test-seq\n 2 2 0 test-seq\n 0 0 0 test-seq\n","language":"Forth"},{"code":": test-seq ( start stop inc -- )\n cr rot dup .\" start: \" 2 .r\n rot dup .\" stop: \" 2 .r\n rot dup .\" inc: \" 2 .r .\" | \"\n -rot swap ?do i . dup +loop drop ;\n-2 2 1 test-seq\n-2 2 0 test-seq\n-2 2 -1 test-seq\n-2 2 10 test-seq\n 2 -2 1 test-seq\n 2 2 1 test-seq\n 2 2 -1 test-seq\n 2 2 0 test-seq\n 0 0 0 test-seq\n","language":"Forth"},{"code":"data -2,2,1,\"Normal\",-2,2,0,\"Zero increment\",-2,2,-1,\"Increments away from stop value\"\ndata -2,2,10,\"First increment is beyond stop value\",2,-2,1,\"Start more than stop: positive increment\"\ndata 2,2,1,\"Start equal stop: positive increment\",2,2,-1,\"Start equal stop: negative increment\"\ndata 2,2,0,\"Start equal stop: zero increment\",0,0,0,\"Start equal stop equal zero: zero increment\"\n\ndim as integer i, start, fin, inc, vr, count\ndim as string cmt\nfor i = 1 to 9\n count = 0\n read start, fin, inc, cmt\n print cmt\n print using \" Looping from ### to ### in increments of ##\"; start; fin; inc\n for vr = start to fin step inc\n print \" Loop index = \",vr\n count += 1\n if count = 10 then\n print \" Breaking infinite loop\"\n exit for\n end if\n next vr\n print \" Loop finished\"\n print\n print\nnext i\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\ntype S struct {\n start, stop, incr int\n comment string\n}\n\nvar examples = []S{\n {-2, 2, 1, \"Normal\"},\n {-2, 2, 0, \"Zero increment\"},\n {-2, 2, -1, \"Increments away from stop value\"},\n {-2, 2, 10, \"First increment is beyond stop value\"},\n {2, -2, 1, \"Start more than stop: positive increment\"},\n {2, 2, 1, \"Start equal stop: positive increment\"},\n {2, 2, -1, \"Start equal stop: negative increment\"},\n {2, 2, 0, \"Start equal stop: zero increment\"},\n {0, 0, 0, \"Start equal stop equal zero: zero increment\"},\n}\n\nfunc sequence(s S, limit int) []int {\n var seq []int\n for i, c := s.start, 0; i <= s.stop && c < limit; i, c = i+s.incr, c+1 {\n seq = append(seq, i)\n }\n return seq\n}\n\nfunc main() {\n const limit = 10\n for _, ex := range examples {\n fmt.Println(ex.comment)\n fmt.Printf(\"Range(%d, %d, %d) -> \", ex.start, ex.stop, ex.incr)\n fmt.Println(sequence(ex, limit))\n fmt.Println()\n }\n}\n","language":"Go"},{"code":"import Data.List\n\nmain = putStrLn $ showTable True '|' '-' '+' table\n\ntable = [[\"start\",\"stop\",\"increment\",\"Comment\",\"Code\",\"Result/Analysis\"]\n ,[\"-2\",\"2\",\"1\",\"Normal\",\"[-2,-1..2] or [-2..2]\",show [-2,-1..2]]\n ,[\"-2\",\"2\",\"0\",\"Zero increment\",\"[-2,-2..2]\",\"Infinite loop of -2 <=> repeat -2\"]\n ,[\"-2\",\"2\",\"-1\",\"Increments away from stop value\",\"[-2,-3..2]\",show [-2,-3..2]]\n ,[\"-2\",\"2\",\"10\",\"First increment is beyond stop value\",\"[-2,8..2]\",show [-2,8..2]]\n ,[\"2\",\"-2\",\"1\",\"Start more than stop: positive increment\",\"[2,3.. -2]\",show [2,3.. -2]]\n ,[\"2\",\"2\",\"1\",\"Start equal stop: positive increment\",\"[2,3..2]\",show [2,3..2]]\n ,[\"2\",\"2\",\"-1\",\"Start equal stop: negative increment\",\"[2,1..2]\",show [2,1..2]]\n ,[\"2\",\"2\",\"0\",\"Start equal stop: zero increment\",\"[2,2..2]\",\"Infinite loop of 2 <=> repeat 2\"]\n ,[\"0\",\"0\",\"0\",\"Start equal stop equal zero: zero increment\",\"[0,0..0]\", \"Infinite loop of 0 <=> repeat 0\"]]\n\nshowTable::Bool -> Char -> Char -> Char -> [[String]] -> String\nshowTable _ _ _ _ [] = []\nshowTable header ver hor sep contents = unlines $ hr:(if header then z:hr:zs else intersperse hr zss) ++ [hr]\n where\n vss = map (map length) $ contents\n ms = map maximum $ transpose vss ::[Int]\n hr = concatMap (\\ n -> sep : replicate n hor) ms ++ [sep]\n top = replicate (length hr) hor\n bss = map (\\ps -> map (flip replicate ' ') $ zipWith (-) ms ps) $ vss\n zss@(z:zs) = zipWith (\\us bs -> (concat $ zipWith (\\x y -> (ver:x) ++ y) us bs) ++ [ver]) contents bss\n","language":"Haskell"},{"code":"import Algorithms as algo;\n\nclass Example {\n _start = none;\n _stop = none;\n _step = none;\n _comment = none;\n}\n\nmain() {\n examples = [\n Example( -2, 2, 1, \"Normal\" ),\n Example( 2, 2, 0, \"Start equal stop: zero increment\" ),\n Example( 0, 0, 0, \"Start equal stop equal zero: zero increment\" ),\n Example( 2, 2, 1, \"Start equal stop: positive increment\" ),\n Example( 2, 2, -1, \"Start equal stop: negative increment\" ),\n Example( -2, 2, 10, \"First increment is beyond stop value\" ),\n Example( -2, 2, 0, \"Zero increment, stop greater than start\" ),\n Example( -2, 2, -1, \"Increments away from stop value\" ),\n Example( 2, -2, 1, \"Start more than stop: positive increment\" )\n ];\n for ( ex : examples ) {\n print(\n \"{}\\nRange( {}, {}, {} ) -> \".format(\n ex._comment, ex._start, ex._stop, ex._step\n )\n );\n r = algo.range( ex._start, ex._stop, ex._step );\n print(\n \"{}\\n\\n\".format(\n algo.materialize( algo.slice( r, 22 ), list )\n )\n );\n }\n}\n","language":"Huginn"},{"code":"genrange=: {{\n 'start stop increment'=. y\n start+increment*i.1+<.(stop-start)%increment\n}}\n","language":"J"},{"code":" genrange 9 2 _2 NB. valid\n9 7 5 3\n genrange _2 2 1 NB. valid\n_2 _1 0 1 2\n genrange _2 2 0 NB. invalid: requires at least an infinity of values\n|domain error: genrange\n genrange _2 2 _1 NB. projects backwards from _2\n_4 _3 _2\n genrange _2 2 10 NB. valid\n_2\n genrange 2 _2 1 NB. projects backwards from 2\n4 3 2\n genrange 2 2 1 NB. valid (increment is irrelevant)\n2\n genrange 2 2 _1 NB. valid (increment is irrelevant)\n2\n genrange 2 2 0 NB. valid (increment is irrelevant)\n2\n genrange 0 0 0 NB. valid (increment is irrelevant)\n0\n","language":"J"},{"code":"import java.util.ArrayList;\nimport java.util.List;\n\npublic class LoopsWrongRanges {\n\n public static void main(String[] args) {\n runTest(new LoopTest(-2, 2, 1, \"Normal\"));\n runTest(new LoopTest(-2, 2, 0, \"Zero increment\"));\n runTest(new LoopTest(-2, 2, -1, \"Increments away from stop value\"));\n runTest(new LoopTest(-2, 2, 10, \"First increment is beyond stop value\"));\n runTest(new LoopTest(2, -2, 1, \"Start more than stop: positive increment\"));\n runTest(new LoopTest(2, 2, 1, \"Start equal stop: positive increment\"));\n runTest(new LoopTest(2, 2, -1, \"Start equal stop: negative increment\"));\n runTest(new LoopTest(2, 2, 0, \"Start equal stop: zero increment\"));\n runTest(new LoopTest(0, 0, 0, \"Start equal stop equal zero: zero increment\"));\n }\n\n private static void runTest(LoopTest loopTest) {\n List<Integer> values = new ArrayList<>();\n for (int i = loopTest.start ; i <= loopTest.stop ; i += loopTest.increment ) {\n values.add(i);\n if ( values.size() >= 10 ) {\n break;\n }\n }\n System.out.printf(\"%-45s %s%s%n\", loopTest.comment, values, values.size()==10 ? \" (loops forever)\" : \"\");\n }\n\n private static class LoopTest {\n int start;\n int stop;\n int increment;\n String comment;\n public LoopTest(int start, int stop, int increment, String comment) {\n this.start = start;\n this.stop = stop;\n this.increment = increment;\n this.comment = comment;\n }\n }\n\n}\n","language":"Java"},{"code":"collect(-2:1:2) # → [-2, -1, 0, 1, 2]\ncollect(-2:0:2) # fails\ncollect(-2:-1:2) # → []\ncollect(-2:10:2) # → [-2]\ncollect(2:1:-2) # → []\ncollect(2:1:2) # → [2]\ncollect(2:-1:2) # → [2]\ncollect(2:0:2) # fails\ncollect(0:0:0) # fails\n","language":"Julia"},{"code":"// Version 1.2.70\n\nclass Example(val start: Int, val stop: Int, val incr: Int, val comment: String)\n\nvar examples = listOf(\n Example(-2, 2, 1, \"Normal\"),\n Example(-2, 2, 0, \"Zero increment\"),\n Example(-2, 2, -1, \"Increments away from stop value\"),\n Example(-2, 2, 10, \"First increment is beyond stop value\"),\n Example(2, -2, 1, \"Start more than stop: positive increment\"),\n Example(2, 2, 1, \"Start equal stop: positive increment\"),\n Example(2, 2, -1, \"Start equal stop: negative increment\"),\n Example(2, 2, 0, \"Start equal stop: zero increment\"),\n Example(0, 0, 0, \"Start equal stop equal zero: zero increment\")\n)\n\nfun sequence(ex: Example, limit: Int) =\n if (ex.incr == 0) {\n List(limit) { ex.start }\n }\n else {\n val res = mutableListOf<Int>()\n var c = 0\n var i = ex.start\n while (i <= ex.stop && c < limit) {\n res.add(i)\n i += ex.incr\n c++\n }\n res\n }\n\nfun main(args: Array<String>) {\n for (ex in examples) {\n println(ex.comment)\n System.out.printf(\"Range(%d, %d, %d) -> \", ex.start, ex.stop, ex.incr)\n println(sequence(ex, 10))\n println()\n }\n}\n","language":"Kotlin"},{"code":"val .data = qs:block END\n start stop increment comment\n -2 2 1 Normal\n -2 2 0 Zero increment\n -2 2 -1 Increments away from stop value\n -2 2 10 First increment is beyond stop value\n 2 -2 1 Start more than stop: positive increment\n 2 2 1 Start equal stop: positive increment\n 2 2 -1 Start equal stop: negative increment\n 2 2 0 Start equal stop: zero increment\n 0 0 0 Start equal stop equal zero: zero increment\nEND\n\nvar .table = submatches(RE/([^ ]+) +([^ ]+) +([^ ]+) +(.+)\\n?/, .data)\n\nval .f = fn(.x) number .x\nfor .i in 2..len(.table) {\n .table[.i] = map [.f, .f, .f, _], .table[.i]\n}\n\nfor .test in rest(.table) {\n val .start, .stop, .inc, .comment = .test\n {\n val .series = series(.start .. .stop, .inc)\n catch {\n writeln $\"\\.comment;\\nERROR: \\._err[\"msg\"]:L200(...);\\n\"\n } else {\n writeln $\"\\.comment;\\nresult: \\.series;\\n\"\n }\n }\n}\n","language":"Langur"},{"code":"tests = {\n { -2, 2, 1, \"Normal\" },\n {-2, 2, 0, \"Zero increment\" }, -- 5.4 error\n {-2, 2, -1, \"Increments away from stop value\" },\n {-2, 2, 10, \"First increment is beyond stop value\" },\n { 2, -2, 1, \"Start more than stop: positive increment\" },\n { 2, 2, 1, \"Start equal stop: positive increment\" },\n { 2, 2, -1, \"Start equal stop: negative increment\" },\n { 2, 2, 0, \"Start equal stop: zero increment\" }, -- 5.4 error\n { 0, 0, 0, \"Start equal stop equal zero: zero increment\" } -- 5.4 error\n}\nunpack = unpack or table.unpack -- polyfill 5.2 vs 5.3\nfor _,test in ipairs(tests) do\n start,stop,incr,desc = unpack(test)\n io.write(string.format(\"%-44s (%2d, %2d, %2d) : \",desc,start,stop,incr))\n local sta,err = pcall(function()\n local n = 0\n for i = start,stop,incr do\n io.write(string.format(\"%2d, \", i))\n n=n+1 if n>=10 then io.write(\"...\") break end\n end\n io.write(\"\\n\")\n end)\n if err then io.write(\"RUNTIME ERROR!\\n\") end\nend\n","language":"Lua"},{"code":"# Normal\nseq(-2..2, 1);\n\n# Zero increment\nseq(-2..2, 0);\n\n# Increments away from stop value\nseq(-2..2, -1);\n\n# First increment is beyond stop value\nseq(-2..2, 10);\n\n# Start more than stop: positive increment\nseq(2..-2, 1);\n\n# Start equal stop: positive increment\nseq(2..2, 1);\n\n# Start equal stop: negative increment\nseq(2..2, -1);\n\n# Start equal stop: zero increment\nseq(2..2, 0);\n\n# Start equal stop equal zero: zero increment\nseq(0..0, 0);\n","language":"Maple"},{"code":"Table[i, {i, -2, 2, 1}]\nTable[i, {i, -2, 2, 0}]\nTable[i, {i, -2, 2, -1}]\nTable[i, {i, -2, 2, 10}]\nTable[i, {i, 2, -2, 1}]\nTable[i, {i, 2, 2, 1}]\nTable[i, {i, 2, 2, -1}]\nTable[i, {i, 2, 2, 0}]\nTable[i, {i, 0, 0, 0}]\n","language":"Mathematica"},{"code":"100 CLS : REM 100 HOME for Applesoft BASIC : REM DELETE line for Minimal BASIC\n110 DATA -2,2,1,\"Normal\",-2,2,0,\"Zero increment\"\n120 DATA -2,2,-1,\"Increments away from stop value\"\n130 DATA -2,2,10,\"First increment is beyond stop value\"\n140 DATA 2,-2,1,\"Start more than stop: positive increment\"\n150 DATA 2,2,1,\"Start equal stop: positive increment\"\n160 DATA 2,2,-1,\"Start equal stop: negative increment\"\n170 DATA 2,2,0,\"Start equal stop: zero increment\"\n180 DATA 0,0,0,\"Start equal stop equal zero: zero increment\"\n190 FOR j = 1 TO 9\n200 LET c = 0\n210 READ s, f, i, t$\n220 PRINT t$\n230 PRINT \" Bucle de \"; s; \"a \"; f; \" en incrementos de \"; i\n240 FOR v = s TO f STEP i\n250 PRINT \" Indice del bucle = \"; v\n260 LET c = c + 1\n270 IF c <> 10 THEN 300\n280 PRINT \" Saliendo de un bucle infinito\"\n290 GOTO 310\n300 NEXT v\n310 PRINT \" Bucle terminado\"\n320 PRINT\n330 NEXT j\n340 END\n","language":"Minimal-BASIC"},{"code":"import sequtils, strformat\n\nproc displayRange(first, last, step: int) =\n\n stdout.write &\"({first:>2}, {last:>2}, {step:>2}): \"\n\n echo if step > 0: ($toSeq(countup(first, last, step)))[1..^1]\n elif step < 0: ($toSeq(countdown(first, last, -step)))[1..^1]\n else: \"not allowed.\"\n\nfor (f, l, s) in [(-2, 2, 1), (-2, 2, 0), (-2, 2, -1),\n (-2, 2, 10), (2, -2, 1), (2, 2, 1),\n (2, 2, -1), (2, 2, 0), (0, 0, 0)]:\n displayRange(f, l, s)\n","language":"Nim"},{"code":"for $i (\n [ -2, 2, 1], #1 Normal\n [ -2, 2, 0], #2 Zero increment\n [ -2, 2, -1], #3 Increments away from stop value\n [ -2, 2, 10], #4 First increment is beyond stop value\n [ 2, -2, 1], #5 Start more than stop: positive increment\n [ 2, 2, 1], #6 Start equal stop: positive increment\n [ 2, 2, -1], #7 Start equal stop: negative increment\n [ 2, 2, 0], #8 Start equal stop: zero increment\n [ 0, 0, 0], #9 Start equal stop equal zero: zero increment\n) {\n $iter = gen_seq(@$i);\n printf \"start: %3d stop: %3d incr: %3d | \", @$i;\n printf \"%4s\", &$iter for 1..10;\n print \"\\n\";\n}\n\nsub gen_seq {\n my($start,$stop,$increment) = @_;\n $n = 0;\n return sub {\n $term = $start + $n++ * $increment;\n return $term > $stop ? '' : $term;\n }\n}\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">stop</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">legend</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">bFor</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;\">if</span> <span style=\"color: #000000;\">bFor</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">try</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">start</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">stop</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">step</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">i</span>\n <span style=\"color: #008080;\">if</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: #000000;\">9</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: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">catch</span> <span style=\"color: #000000;\">e</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">E_USER</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">try</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">i</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">start</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">stop</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">stop</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;\">i</span>\n <span style=\"color: #008080;\">if</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: #000000;\">9</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: #000080;font-style:italic;\">-- if i=stop then exit end if\n -- if step=0 then exit end if</span>\n <span style=\"color: #000000;\">i</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">step</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: #7060A8;\">sprint</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: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%-43s: %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">legend</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;\">procedure</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;\">2</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #008080;\">iff</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: #008000;\">\"for\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">\"while\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">test</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> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Normal\"</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;\">test</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> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Zero increment\"</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;\">test</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><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Increments away from stop value\"</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;\">test</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><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"First increment is beyond stop value\"</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;\">test</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> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Start more than stop: positive increment\"</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;\">test</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> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Start equal stop: positive increment\"</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;\">test</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><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Start equal stop: negative increment\"</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;\">test</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> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Start equal stop: zero increment\"</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;\">test</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: #008000;\">\"Start equal stop equal zero: zero increment\"</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;\">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":"loops:procedure options (main);\n declare i fixed binary;\n\n put skip list ('-2 to 2 by 1:');\n do i = -2 to 2 by 1;\n put edit (i) (f(3));\n end;\n put skip list ('-2 to 2 by 0: infinite loop, prints -2');\n\n put skip list ('-2 to 2 by -1: [no values printed]');\n do i = -2 to 2 by -1;\n put edit (i) (f(3));\n end;\n\n put skip list ('-2 to 2 by 10:');\n do i = -2 to 2 by 1;\n put edit (i) (f(3));\n end;\n\n put skip list (' 2 to 2 by 1:');\n do i = 2 to 2 by 1;\n put edit (i) (f(3));\n end;\n\n put skip list (' 2 to 2 by -1:');\n do i = 2 to 2 by -1;\n put edit (i) (f(3));\n end;\n\n put skip list (' 2 to 2 by 0: infinite loop, prints 2');\n put skip list (' 0 to 0 by 0: infinite loop, prints 0');\n\nend loops;\n","language":"PL-I"},{"code":"import re\nfrom itertools import islice # To limit execution if it would generate huge values\n# list(islice('ABCDEFG', 2)) --> ['A', 'B']\n# list(islice('ABCDEFG', 4)) --> ['A', 'B', 'C', 'D']\n\n\ndata = '''\nstart \tstop \tincrement \tComment\n-2 \t2 \t1 \tNormal\n-2 \t2 \t0 \tZero increment\n-2 \t2 \t-1 \tIncrements away from stop value\n-2 \t2 \t10 \tFirst increment is beyond stop value\n2 \t-2 \t1 \tStart more than stop: positive increment\n2 \t2 \t1 \tStart equal stop: positive increment\n2 \t2 \t-1 \tStart equal stop: negative increment\n2 \t2 \t0 \tStart equal stop: zero increment\n0 \t0 \t0 \tStart equal stop equal zero: zero increment\n'''\n\ntable = [re.split(r'\\s\\s+', line.strip()) for line in data.strip().split('\\n')]\n#%%\nfor _start, _stop, _increment, comment in table[1:]:\n start, stop, increment = [int(x) for x in (_start, _stop, _increment)]\n print(f'{comment.upper()}:\\n range({start}, {stop}, {increment})')\n values = None\n try:\n values = list(islice(range(start, stop, increment), 999))\n except ValueError as e:\n print(' !!ERROR!!', e)\n if values is not None:\n if len(values) < 22:\n print(' =', values)\n else:\n print(' =', str(values[:22])[:-1], '...')\n","language":"Python"},{"code":"seq(from = -2, to = 2, by = 1)#Output: -2 -1 0 1 2\nseq(from = -2, to = 2, by = 0)#Fails: \"invalid '(to - from)/by'\"\nseq(from = -2, to = 2, by = -1)#Fails: As in the notes above - \"Specifying to - from and by of opposite signs is an error.\"\nseq(from = -2, to = 2, by = 10)#Output: -2\nseq(from = 2, to = -2, by = 1)#Fails: Same as the third case.\nseq(from = 2, to = 2, by = 1)#Output: 2\nseq(from = 2, to = 2, by = -1)#Output: 2\nseq(from = 2, to = 2, by = 0)#Output: 2\nseq(from = 0, to = 0, by = 0)#Output: 0\n","language":"R"},{"code":"#lang racket\n\n(require racket/sandbox)\n\n(define tests '([-2 2 1 \"Normal\"]\n [-2 2 0 \"Zero increment\"]\n [-2 2 -1 \"Increments away from stop value\"]\n [-2 2 10 \"First increment is beyond stop value\"]\n [2 -2 1 \"Start more than stop: positive increment\"]\n [2 2 1 \"Start equal stop: positive increment\"]\n [2 2 -1 \"Start equal stop: negative increment\"]\n [2 2 0 \"Start equal stop: zero increment\"]\n [0 0 0 \"Start equal stop equal zero: zero increment\"]))\n\n(for ([test (in-list tests)])\n (match-define (list st ed inc desc) test)\n (printf \"~a:\\n (in-range ~a ~a ~a) = ~a\\n\\n\"\n desc st ed inc\n (with-handlers ([exn:fail:resource? (thunk* 'timeout)])\n (with-limits 1 #f\n (sequence->list (in-range st ed inc))))))\n","language":"Racket"},{"code":"# Given sequence definitions\n# start stop inc. Comment\nfor -2, 2, 1, # Normal\n -2, 2, 0, # Zero increment\n -2, 2, -1, # Increments away from stop value\n -2, 2, 10, # First increment is beyond stop value\n 2, -2, 1, # Start more than stop: positive increment\n 2, 2, 1, # Start equal stop: positive increment\n 2, 2, -1, # Start equal stop: negative increment\n 2, 2, 0, # Start equal stop: zero increment\n 0, 0, 0, # Start equal stop equal zero: zero increment\n\n# Additional \"problematic\" sequences\n 1, Inf, 3, # Endpoint literally at infinity\n 0, π, τ/8, # Floating point numbers\n 1.4, *, -7.1 # Whatever\n\n -> $start, $stop, $inc {\n my $seq = flat ($start, *+$inc … $stop);\n printf \"Start: %3s, Stop: %3s, Increment: %3s | \", $start, $stop.Str, $inc;\n # only show up to the first 15 elements of possibly infinite sequences\n put $seq[^15].grep: +*.defined\n}\n\n# For that matter the start and end values don't need to be numeric either. Both\n# or either can be a function, list, or other object. Really anything that a\n# \"successor\" function can be defined for and produces a value.\nsay \"\\nDemonstration of some other specialized sequence operator functionality:\";\n# Start with a list, iterate by multiplying the previous 3 terms together\n# and end with a term defined by a function.\nput 1, -.5, 2.sqrt, * × * × * … *.abs < 1e-2;\n\n# Start with an array, iterate by rotating, end when 0 is in the last place.\nsay [0,1,2,3,4,5], *.rotate(-1).Array … !*.tail;\n\n# Iterate strings backwards.\nput 'xp' … 'xf';\n","language":"Raku"},{"code":"/*REXX program demonstrates several versions of DO loops with \"unusual\" iterations. */\n@.=; @.1= ' -2 2 1 ' /*\"normal\". */\n @.2= ' -2 2 0 ' /*\"normal\", zero increment.*/\n @.3= ' -2 2 -1 ' /*increases away from stop, neg increment.*/\n @.4= ' -2 2 10 ' /*1st increment > stop, positive increment.*/\n @.5= ' 2 -2 1 ' /*start > stop, positive increment.*/\n @.6= ' 2 2 1 ' /*start equals stop, positive increment.*/\n @.7= ' 2 2 -1 ' /*start equals stop, negative increment.*/\n @.8= ' 2 2 0 ' /*start equals stop, zero increment.*/\n @.9= ' 0 0 0 ' /*start equals stop, zero increment.*/\nzLim= 10 /*a limit to check for runaway (race) loop.*/\n /*a zero increment is not an error in REXX.*/\n do k=1 while @.k\\=='' /*perform a DO loop with several ranges. */\n parse var @.k x y z . /*obtain the three values for a DO loop. */\n say\n say center('start of performing DO loop number ' k \" with range: \" x y z, 79, '═')\n zz= 0\n do j=x to y by z until zz>=zLim /* ◄─── perform the DO loop.*/\n say ' j ───►' right(j, max(3, length(j) ) ) /*right justify J for alignment*/\n if z==0 then zz= zz + 1 /*if zero inc, count happenings*/\n end /*j*/\n\n if zz>=zLim then say 'the DO loop for the ' k \" entry was terminated (runaway).\"\n say center(' end of performing DO loop number ' k \" with range: \" x y z, 79, '─')\n say\n end /*k*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"examples = [\n [ -2, 2, 1],\n [ -2, 2, 0],\n [ -2, 2, -1],\n [ -2, 2, 10],\n [ 2, -2, 1],\n [ 2, 2, 1],\n [ 2, 2, -1],\n [ 2, 2, 0],\n [ 0, 0, 0]\n ]\n\nexamples.each do |start, stop, step|\n as = (start..stop).step(step)\n puts \"#{as.inspect} size: #{as.size}\"\nend\n","language":"Ruby"},{"code":"$ include \"seed7_05.s7i\";\n\nconst proc: testLoop (in integer: start, in integer: stop, in integer: incr, in string: comment) is func\n local\n const integer: limit is 10;\n var integer: number is 0;\n var integer: count is 0;\n begin\n writeln(comment);\n write(\"Range(\" <& start <& \", \" <& stop <& \", \" <& incr <& \") -> [ \");\n block\n for number range start to stop step incr do\n write(number <& \" \");\n incr(count);\n if count >= limit then\n raise RANGE_ERROR;\n end if;\n end for;\n exception\n catch RANGE_ERROR: noop;\n end block;\n writeln(\"]\");\n writeln;\n end func;\n\nconst proc: main is func\n begin\n testLoop(-2, 2, 1, \"Normal\");\n testLoop(-2, 2, 0, \"Zero increment\");\n testLoop(-2, 2, -1, \"Increments away from stop value\");\n testLoop(-2, 2, 10, \"First increment is beyond stop value\");\n testLoop( 2, -2, 1, \"Start more than stop: positive increment\");\n testLoop( 2, 2, 1, \"Start equal stop: positive increment\");\n testLoop( 2, 2, -1, \"Start equal stop: negative increment\");\n testLoop( 2, 2, 0, \"Start equal stop: zero increment\");\n testLoop( 0, 0, 0, \"Start equal stop equal zero: zero increment\");\n end func;\n","language":"Seed7"},{"code":"startExpr to:stopExpr by:incExpr do:[..]\n","language":"Smalltalk"},{"code":"MAX_ITER := 15.\n#(\n (-2 2 1 'Normal')\n (-2 2 0 'Zero increment')\n (-2 2 -1 'Increments away from stop value')\n (-2 2 10 'First increment is beyond stop value')\n (2 -2 1 'Start more than stop: positive increment')\n (2 2 1 'Start equal stop: positive increment')\n (2 2 -1 'Start equal stop: negative increment')\n (2 2 0 'Start equal stop: zero increment')\n (0 0 0 'Start equal stop equal zero: zero increment')\n) do:[:testParams |\n |start stop inc info countIter|\n\n start := testParams first.\n stop := testParams second.\n inc := testParams third.\n info := testParams fourth.\n Transcript show:(info paddedTo:50 with:$.).\n\n countIter := 0.\n [:exit |\n start to:stop by:inc do:[:n |\n Transcript space; show:n.\n (countIter := countIter + 1) > MAX_ITER ifTrue:[\n Transcript show:'...'.\n exit value\n ].\n ].\n ] valueWithExit.\n Transcript cr.\n].\n","language":"Smalltalk"},{"code":"struct Seq {\n start int\n stop int\n incr int\n comment string\n}\n\nconst examples = [\n Seq{-2, 2, 1, \"Normal\"},\n Seq{-2, 2, 0, \"Zero increment\"},\n Seq{-2, 2, -1, \"Increments away from stop value\"},\n Seq{-2, 2, 10, \"First increment is beyond stop value\"},\n Seq{2, -2, 1, \"Start more than stop: positive increment\"},\n Seq{2, 2, 1, \"Start equal stop: positive increment\"},\n Seq{2, 2, -1, \"Start equal stop: negative increment\"},\n Seq{2, 2, 0, \"Start equal stop: zero increment\"},\n Seq{0, 0, 0, \"Start equal stop equal zero: zero increment\"},\n]\n\nfn sequence(s Seq, limit int) []int {\n mut seq := []int{}\n for i, c := s.start, 0; i <= s.stop && c < limit; i, c = i+s.incr, c+1 {\n seq << i\n }\n return seq\n}\n\nfn main() {\n limit := 10\n for ex in examples {\n println(ex.comment)\n print(\"Range($ex.start, $ex.stop, $ex.incr) -> \")\n println(sequence(ex, limit))\n println('')\n }\n}\n","language":"V-(Vlang)"},{"code":"static void example(int start, int stop, int increment, string comment) {\n const int MAX_ITER = 9;\n int iteration = 0;\n stdout.printf(\"%-50s\", comment);\n for (int i = start; i <= stop; i += increment) {\n stdout.printf(\"%3d \", i);\n if (++iteration > MAX_ITER) break;\n }\n stdout.printf(\"\\n\");\n}\n\nvoid main () {\n example(-2, 2, 1, \"Normal\");\n example(-2, 2, 0, \"Zero increment\");\n example(-2, 2, -1, \"Increments away from stop value\");\n example(-2, 2, 10, \"First increment is beyond stop value\");\n example(2, -2, 1, \"Start more than stop: positive increment\");\n example(2, 2, 1, \"Start equals stop: positive increment\");\n example(2, 2, -1, \"Start equals stop: negative increment\");\n example(2, 2, 0, \"Start equals stop: zero increment\");\n example(0, 0, 0, \"Start equals stop equal zero: zero increment\");\n}\n","language":"Vala"},{"code":"Public Sub LoopsWrongRanges()\n Call Example(-2, 2, 1, \"Normal\")\n Call Example(-2, 2, 0, \"Zero increment\")\n Call Example(-2, 2, -1, \"Increments away from stop value\")\n Call Example(-2, 2, 10, \"First increment is beyond stop value\")\n Call Example(2, -2, 1, \"Start more than stop: positive increment\")\n Call Example(2, 2, 1, \"Start equal stop: positive increment\")\n Call Example(2, 2, -1, \"Start equal stop: negative increment\")\n Call Example(2, 2, 0, \"Start equal stop: zero increment\")\n Call Example(0, 0, 0, \"Start equal stop equal zero: zero increment\")\nEnd Sub\nPrivate Sub Example(start As Integer, stop_ As Integer, by As Integer, comment As String)\n Dim i As Integer\n Dim c As Integer\n Const limit = 10\n c = 0\n Debug.Print start; \" \"; stop_; \" \"; by; \" | \";\n For i = start To stop_ Step by\n Debug.Print i & \",\";\n c = c + 1\n If c > limit Then Exit For\n Next i\n Debug.Print\n Debug.Print comment & vbCrLf\nEnd Sub\n","language":"VBA"},{"code":"Module Program\n Sub Main()\n Example(-2, 2, 1, \"Normal\")\n Example(-2, 2, 0, \"Zero increment\")\n Example(-2, 2, -1, \"Increments away from stop value\")\n Example(-2, 2, 10, \"First increment is beyond stop value\")\n Example(2, -2, 1, \"Start more than stop: positive increment\")\n Example(2, 2, 1, \"Start equal stop: positive increment\")\n Example(2, 2, -1, \"Start equal stop: negative increment\")\n Example(2, 2, 0, \"Start equal stop: zero increment\")\n Example(0, 0, 0, \"Start equal stop equal zero: zero increment\")\n End Sub\n\n ' Stop is a keyword and must be escaped using brackets.\n Iterator Function Range(start As Integer, [stop] As Integer, increment As Integer) As IEnumerable(Of Integer)\n For i = start To [stop] Step increment\n Yield i\n Next\n End Function\n\n Sub Example(start As Integer, [stop] As Integer, increment As Integer, comment As String)\n ' Add a space, pad to length 50 with hyphens, and add another space.\n Console.Write((comment & \" \").PadRight(50, \"-\"c) & \" \")\n\n Const MAX_ITER = 9\n\n Dim iteration = 0\n ' The For Each loop enumerates the IEnumerable.\n For Each i In Range(start, [stop], increment)\n Console.Write(\"{0,2} \", i)\n\n iteration += 1\n If iteration > MAX_ITER Then Exit For\n Next\n\n Console.WriteLine()\n End Sub\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"./fmt\" for Fmt\n\nvar loop = Fn.new { |start, stop, inc|\n System.write(\"%(Fmt.v(\"dm\", 3, [start, stop, inc], 0, \" \", \"[]\")) -> \")\n var count = 0\n var limit = 10\n var i = start\n while (i <= stop) {\n System.write(\"%(i) \")\n count = count + 1\n if (count == limit) break\n i = i + inc\n }\n System.print()\n}\n\nvar tests = [\n [-2, 2, 1], [-2, 2, 0], [-2, 2, -1], [-2, 2, 10], [2, -2, 1], [2, 2, 1], [2, 2, -1], [2, 2, 0], [0, 0, 0]\n]\nfor (test in tests) loop.call(test[0], test[1], test[2])\n","language":"Wren"},{"code":"include xpllib; \\for Print\n\ndef \\S\\ Start, Stop, Incr, Comment;\nint S, Examples, I, J, C, Empty;\ndef Limit = 10;\n[Examples:= [\n [-2, 2, 1, \"Normal\"],\n [-2, 2, 0, \"Zero increment\"],\n [-2, 2, -1, \"Increments away from stop value\"],\n [-2, 2, 10, \"First increment is beyond stop value\"],\n [2, -2, 1, \"Start more than stop: positive increment\"],\n [2, 2, 1, \"Start equal stop: positive increment\"],\n [2, 2, -1, \"Start equal stop: negative increment\"],\n [2, 2, 0, \"Start equal stop: zero increment\"],\n [0, 0, 0, \"Start equal stop equal zero: zero increment\"]\n ];\nfor I:= 0 to 9-1 do\n [S:= Examples(I);\n Print(\"%s\\n\", S(Comment));\n Print(\"Range(%d, %d, %d) -> [\", S(Start), S(Stop), S(Incr));\n Empty:= true;\n\\\\ for (j:= s.start, c:= 0; j <= s.stop && c < limit; j += s.incr, ++c)\n J:= S(Start); C:= 0;\n while J <= S(Stop) and C < Limit do\n [Print(\"%d \", J);\n Empty:= false;\n J:= J + S(Incr); C:= C+1;\n ];\n if not Empty then ChOut(0, $08 \\BS\\);\n Print(\"]\\n\\n\");\n ]\n]\n","language":"XPL0"},{"code":"data -2,2,1,\"Normal\",-2,2,0,\"Zero increment\",-2,2,-1,\"Increments away from stop value\"\ndata -2,2,10,\"First increment is beyond stop value\",2,-2,1,\"Start more than stop: positive increment\"\ndata 2,2,1,\"Start equal stop: positive increment\",2,2,-1,\"Start equal stop: negative increment\"\ndata 2,2,0,\"Start equal stop: zero increment\",0,0,0,\"Start equal stop equal zero: zero increment\"\n\nfor i = 1 to 9\n contar = 0\n read start, fin, inc, cmt$\n print cmt$\n print \" Bucle de \", start, \" a \", fin, \" en incrementos de \", inc\n for vr = start to fin step inc\n print \" Indice del bucle = \", vr\n contar = contar + 1\n if contar = 10 then\n print \" Saliendo de un bucle infinito\"\n break\n endif\n next vr\n print \" Bucle terminado\\n\\n\"\nnext i\nend\n","language":"Yabasic"},{"code":"const std = @import(\"std\");\nconst stdout = @import(\"std\").io.getStdOut().writer();\n\nconst limit = 10;\n\nfn printRange(start: isize, stop: isize, step: isize, comment: []const u8) !void {\n try stdout.print(\"{s}\\r\\x1b[43C: \", .{comment});\n var c: u8 = 0;\n var n = start;\n while (n <= stop) : (n += step) {\n c += 1;\n if (c > limit) break;\n try stdout.print(\"{d} \", .{n});\n }\n try stdout.print(\"\\n\", .{});\n}\n\npub fn main() !void {\n try printRange(-2, 2, 1, \"Normal\");\n try printRange(-2, 2, 0, \"Zero increment\");\n try printRange(-2, 2, -1, \"Increments away from stop value\");\n try printRange(-2, 2, 10, \"First increment is beyond stop value\");\n try printRange(2, -2, 1, \"Start more than stop: positive increment\");\n try printRange(2, 2, 1, \"Start equal stop: positive increment\");\n try printRange(2, 2, -1, \"Start equal stop: negative increment\");\n try printRange(2, 2, 0, \"Start equal stop: zero increment\");\n try printRange(0, 0, 0, \"Start equal stop equal zero: zero increment\");\n}\n","language":"Zig"},{"code":"// zero increment (ie infnite loop) throws an error\n// if stop is \"*\", the loop is has no end (ie infinite)\n// stop is included unless step steps skips it\n// if start > stop is a dead loop\n// ranges ([a..b,c]) are lazy lists\nfcn looper([(start,stop,increment)]){\n print(\" %3s %3s\\t%2d --> \".fmt(start,stop,increment));\n try{ foreach n in ([start..stop,increment]){ print(n,\" \") } }\n catch{ print(__exception) }\n println();\n}\nprintln(\"start stop increment\");\nT( T(-2,2,1),T(-2,2,0),T(-2,2,-1),T(-2,2,10),T( 2,-2,1),\n T( 2,2,1),T( 2,2,-1),T( 2,2,0),T( 0,0,0),\n T(0.0, (0.0).pi, 0.7853981633974483), T(\"a\",\"e\",1), T(\"e\",\"a\",1) )\n.apply2(looper); // apply2 is apply (map) without saving results\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Loop modifiers\\nfrom: http://rosettacode.org/wiki/Loops/Wrong_ranges\\nnote: Iteration\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Some languages have syntax or function(s) to generate a range of numeric values from a start value, a stop value, and an increment.\\n\\nThe purpose of this task is to select the range syntax/function that would generate at least two increasing numbers when given a stop value more than the start value and a positive increment of less than half the difference. You are then to use that ''same'' syntax/function but with different parameters; and show, here, what would happen.\\n\\nUse these values if possible:\\n::::: {| class=\\\"wikitable\\\"\\n!start ||stop ||increment ||Comment\\n|-\\n| -2||2||1||Normal\\n|-\\n| -2||2||0||Zero increment\\n|-\\n| -2||2||-1||Increments away from stop value\\n|-\\n| -2||2||10||First increment is beyond stop value\\n|-\\n|2||-2||1||Start more than stop: positive increment\\n|-\\n|2||2||1||Start equal stop: positive increment\\n|-\\n|2||2||-1||Start equal stop: negative increment\\n|-\\n|2||2||0||Start equal stop: zero increment\\n|-\\n|0||0||0||Start equal stop equal zero: zero increment\\n|}\\n\\n;Related tasks:\\n* [[Loop over multiple arrays simultaneously]]\\n* [[Loops/Break]]\\n* [[Loops/Continue]]\\n* [[Loops/Do-while]]\\n* [[Loops/Downward for]]\\n* [[Loops/For]]\\n* [[Loops/For with a specified step]]\\n* [[Loops/Foreach]]\\n* [[Loops/Increment loop index within loop body]]\\n* [[Loops/Infinite]]\\n* [[Loops/N plus one half]]\\n* [[Loops/Nested]]\\n* [[Loops/While]]\\n* [[Loops/with multiple ranges]]\\n* [[Loops/Wrong ranges]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F displayRange(first, last, step)\\n print(‘(#2, #2, #2): ’.format(first, last, step), end' ‘’)\\n I step == 0\\n print(‘not allowed.’)\\n E\\n print(Array((first..last).step(step)))\\n\\nL(f, l, s) [(-2, 2, 1), (-2, 2, 0), (-2, 2, -1),\\n (-2, 2, 10), (2, -2, 1), ( 2, 2, 1),\\n ( 2, 2, -1), (2, 2, 0), ( 0, 0, 0)]\\n displayRange(f, l, s)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\nwith Ada.Strings.Unbounded; use Ada.Strings.Unbounded;\\nwith Ada.Text_IO.Unbounded_IO; use Ada.Text_IO.Unbounded_IO;\\n\\nprocedure Main is\\n procedure print_range(start : integer; stop : integer; step : integer) is\\n Num : Integer := start;\\n begin\\n Put(\\\"Range(\\\" & start'Image & \\\", \\\" & stop'image &\\n \\\", \\\" & step'image & \\\") => \\\");\\n if stop < start then\\n Put_Line(\\\"Error: stop must be no less than start!\\\");\\n elsif step not in positive then\\n Put_Line(\\\"Error: increment must be greater than 0!\\\");\\n elsif start = stop then\\n Put_Line(start'image);\\n else\\n while num <= stop loop\\n Put(num'Image);\\n num := num + step;\\n end loop;\\n New_Line;\\n end if;\\n end print_range;\\n\\n type test_record is record\\n start : integer;\\n stop : integer;\\n step : integer;\\n comment : unbounded_string := null_unbounded_string;\\n end record;\\n\\n tests : array(1..9) of test_record :=\\n ( 1 => (-2, 2, 1, To_Unbounded_String(\\\"Normal\\\")),\\n 2 => (-2, 2, 0, To_Unbounded_String(\\\"Zero increment\\\")),\\n 3 => (-2, 2, -1, To_Unbounded_String(\\\"Increments away from stop value\\\")),\\n 4 => (-2, 2, 10, To_Unbounded_String(\\\"First increment is beyond stop value\\\")),\\n 5 => (2, -1, 1, To_Unbounded_String(\\\"Start more than stop: positive increment\\\")),\\n 6 => (2, 2, 1, To_Unbounded_String(\\\"Start equal stop: positive increment\\\")),\\n 7 => (2, 2, -1, To_Unbounded_String(\\\"Start equal stop: negative increment\\\")),\\n 8 => (2, 2, 0, To_Unbounded_String(\\\"Start equal stop: zero increment\\\")),\\n 9 => (0, 0, 0, To_Unbounded_String(\\\"Start equal stop equal zero: zero increment\\\")));\\n\\n\\nbegin\\n for test of tests loop\\n Put(Test.Comment); Put(\\\" : \\\");\\n print_range(test.start, test.stop, test.step);\\n New_line;\\n end loop;\\nend Main;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"BEGIN\\n # returns the first n elements of the sequences of values specified by start, stop and increment #\\n PROC sequence = ( INT n, start, stop, increment )[]INT:\\n BEGIN\\n [ 1 : n ]INT s;\\n FOR j FROM LWB s TO UPB s DO s[ j ] := 0 OD;\\n INT s pos := LWB s - 1;\\n FOR j FROM start BY increment TO stop WHILE s pos < n DO\\n s[ s pos +:= 1 ] := j\\n OD;\\n s[ LWB s : s pos ]\\n END # sequence # ;\\n\\n # tests the sequence procedure #\\n PROC test sequence = ( INT start, stop, increment, STRING legend )VOID:\\n BEGIN\\n []INT s = sequence( 10, start, stop, increment );\\n print( ( legend, \\\": \\\" ) );\\n FOR i FROM LWB s TO UPB s DO print( ( \\\" \\\", whole( s[ i ], -4 ) ) ) OD;\\n print( ( newline ) )\\n END # test sequence # ;\\n # task trest cases #\\n\\n test sequence( -2, 2, 1, \\\"Normal \\\" );\\n test sequence( -2, 2, 0, \\\"Zero increment \\\" );\\n test sequence( -2, 2, -1, \\\"Increments away from stop value \\\" );\\n test sequence( -2, 2, 10, \\\"First increment is beyond stop value \\\" );\\n test sequence( 2, -2, 1, \\\"Start more than stop: positive increment \\\" );\\n test sequence( 2, 2, 1, \\\"Start equal stop: positive increment \\\" );\\n test sequence( 2, 2, -1, \\\"Start equal stop: negative increment \\\" );\\n test sequence( 2, 2, 0, \\\"Start equal stop: zero increment \\\" );\\n test sequence( 0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\" )\\n\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin\\n % sets the first n elements of s to the sequences of values specified by start, stop and increment %\\n % s( 0 ) is set to the number of elements of s that have been set, in case the sequence ends before n %\\n procedure sequence ( integer array s ( * )\\n ; integer value n, start, stop, increment\\n ) ;\\n begin\\n integer sPos;\\n for j := 0 until n do s( j ) := 0;\\n sPos := 1;\\n for j := start step increment until stop do begin\\n if sPos > n then goto done;\\n s( sPos ) := j;\\n s( 0 ) := s( 0 ) + 1;\\n sPos := sPos + 1;\\n end for_j ;\\ndone:\\n end sequence ;\\n % tests the sequence procedure %\\n procedure testSequence( integer value start, stop, increment\\n ; string(48) value legend\\n ) ;\\n begin\\n integer array s ( 0 :: 10 );\\n sequence( s, 10, start, stop, increment );\\n s_w := 0; % set output formating %\\n i_w := 4;\\n write( legend, \\\": \\\" );\\n for i := 1 until s( 0 ) do writeon( s( i ) )\\n end testSequence ;\\n % task trest cases %\\n testSequence( -2, 2, 1, \\\"Normal\\\" );\\n testSequence( -2, 2, 0, \\\"Zero increment\\\" );\\n testSequence( -2, 2, -1, \\\"Increments away from stop value\\\" );\\n testSequence( -2, 2, 10, \\\"First increment is beyond stop value\\\" );\\n testSequence( 2, -2, 1, \\\"Start more than stop: positive increment\\\" );\\n testSequence( 2, 2, 1, \\\"Start equal stop: positive increment\\\" );\\n testSequence( 2, 2, -1, \\\"Start equal stop: negative increment\\\" );\\n testSequence( 2, 2, 0, \\\"Start equal stop: zero increment\\\" );\\n testSequence( 0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\" )\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"0 LIMIT = 10 :MAX=1E37\\n10 DATA-2,2,1,NORMAL\\n20 DATA-2,2,0,ZERO INCREMENT\\n30 DATA-2,2,-1,INCREMENTS AWAY FROM STOP VALUE\\n40 DATA-2,2,10,FIRST INCREMENT IS BEYOND STOP VALUE\\n50 DATA2,-2,1,\\\"START MORE THAN STOP: POSITIVE INCREMENT\\n60 DATA2,2,1,\\\"START EQUAL STOP: POSITIVE INCREMENT\\n70 DATA2,2,-1,\\\"START EQUAL STOP: NEGATIVE INCREMENT\\n80 DATA2,2,0,\\\"START EQUAL STOP: ZERO INCREMENT\\n90 DATA0,0,0,\\\"START EQUAL STOP EQUAL ZERO: ZERO INCREMENT\\n100 FOR I = 1 TO 9\\n110 READ START,FINISH,INCR,COMMENT$\\n120 PRINT CHR$(13)COMMENT$\\n130 LAST = FINISH\\n140 REM D = SGN(FINISH - START)\\n150 REM IF D AND NOT (D = SGN(INCR)) THEN LAST = SGN(INCR)*MAX\\n160 PRINT TAB(5)CHR$(91)\\\" \\\"MID$(\\\" \\\",(START<0)+1)START\\\" TO \\\"MID$(\\\" \\\",(FINISH<0)+1)FINISH\\\" STEP \\\"MID$(\\\" \\\",(INCR<0)+1)INCR\\\" ] \\\";\\n170 COUNT = 0\\n180 PRINT MID$(\\\" \\\",(START<0)+1);\\n190 FOR J = START TO LAST STEP INCR\\n200 PRINT MID$(\\\" \\\",(COUNT=0)+1)J;\\n210 IF COUNT < LIMIT THEN COUNT = COUNT + 1 : NEXT J\\n220 IF COUNT = LIMIT THEN PRINT \\\" ... \\\";:if ABS(LAST) = MAX THEN PRINT MID$(\\\"-\\\",SGN(LAST)+2,1)\\\"INFINITY\\\";\\n230 NEXT I\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"print \\\"start stop increment\\\"\\n\\nloop @[\\n neg 2 2 1\\n neg 2 2 0\\n neg 2 2 neg 1\\n neg 2 2 10\\n 2 neg 2 1\\n 2 2 1\\n 2 2 neg 1\\n 2 2 0\\n 0 0 0 ]\\n[start stop increment] ->\\n print [\\n pad ~\\\"|start|\\\" 2 pad ~\\\"|stop|\\\" 7 pad ~\\\"|increment|\\\" 7\\n pad \\\"->\\\" 9 try? -> @range.step: increment start stop\\n else -> \\\"Error\\\"\\n ]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"# syntax: GAWK -f LOOPS_WRONG_RANGES.AWK\\nBEGIN {\\n arr[++n] = \\\"-2, 2, 1,Normal\\\"\\n arr[++n] = \\\"-2, 2, 0,Zero increment\\\"\\n arr[++n] = \\\"-2, 2,-1,Increments away from stop value\\\"\\n arr[++n] = \\\"-2, 2,10,First increment is beyond stop value\\\"\\n arr[++n] = \\\" 2,-2, 1,Start more than stop: positive increment\\\"\\n arr[++n] = \\\" 2, 2, 1,Start equal stop: positive increment\\\"\\n arr[++n] = \\\" 2, 2,-1,Start equal stop: negative increment\\\"\\n arr[++n] = \\\" 2, 2, 0,Start equal stop: zero increment\\\"\\n arr[++n] = \\\" 0, 0, 0,Start equal stop equal zero: zero increment\\\"\\n print(\\\"start,stop,increment,comment\\\")\\n for (i=1; i<=n; i++) {\\n split(arr[i],A,\\\",\\\")\\n printf(\\\"%-52s : \\\",arr[i])\\n count = 0\\n for (j=A[1]; j<=A[2] && count<10; j+=A[3]) {\\n printf(\\\"%d \\\",j)\\n count++\\n }\\n printf(\\\"\\\\n\\\")\\n }\\n exit(0)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"arraybase 1\\ndim start(9) : dim fin(9) : dim inc(9) : dim cmt$(9)\\nstart[1] = -2 : fin[1] = 2 : inc[1] = 1 : cmt$[1] = \\\"Normal\\\"\\nstart[2] = -2 : fin[2] = 2 : inc[2] = 0 : cmt$[2] = \\\"Zero increment\\\"\\nstart[3] = -2 : fin[3] = 2 : inc[3] = -1 : cmt$[3] = \\\"Increments away from stop value\\\"\\nstart[4] = -2 : fin[4] = 2 : inc[4] = 10 : cmt$[4] = \\\"First increment is beyond stop value\\\"\\nstart[5] = 2 : fin[5] = -2 : inc[5] = 1 : cmt$[5] = \\\"Start more than stop: positive increment\\\"\\nstart[6] = 2 : fin[6] = 2 : inc[6] = 1 : cmt$[6] = \\\"Start equal stop: positive increment\\\"\\nstart[7] = 2 : fin[7] = 2 : inc[7] = -1 : cmt$[7] = \\\"Start equal stop: negative increment\\\"\\nstart[8] = 2 : fin[8] = 2 : inc[8] = 0 : cmt$[8] = \\\"Start equal stop: zero increment\\\"\\nstart[9] = 0 : fin[9] = 0 : inc[9] = 0 : cmt$[9] = \\\"Start equal stop equal zero: zero increment\\\"\\n\\nfor i = 1 to 9\\n contar = 0\\n print cmt$[i]\\n print \\\" Bucle de \\\"; start[i]; \\\" a \\\"; fin[i]; \\\" en incrementos de \\\"; inc[i]\\n for vr = start[i] to fin[i] step inc[i]\\n print \\\" Índice del bucle = \\\"; vr\\n contar = contar + 1\\n if contar = 10 then\\n print \\\" Saliendo de un bucle infinito\\\"\\n exit for\\n endif\\n next vr\\n print \\\" Bucle terminado\\\" & chr(10) & chr(10)\\nnext i\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\n#define TRUE 1\\n#define FALSE 0\\n\\ntypedef int bool;\\n\\ntypedef struct {\\n int start, stop, incr;\\n const char *comment;\\n} S;\\n\\nS examples[9] = {\\n {-2, 2, 1, \\\"Normal\\\"},\\n {-2, 2, 0, \\\"Zero increment\\\"},\\n {-2, 2, -1, \\\"Increments away from stop value\\\"},\\n {-2, 2, 10, \\\"First increment is beyond stop value\\\"},\\n {2, -2, 1, \\\"Start more than stop: positive increment\\\"},\\n {2, 2, 1, \\\"Start equal stop: positive increment\\\"},\\n {2, 2, -1, \\\"Start equal stop: negative increment\\\"},\\n {2, 2, 0, \\\"Start equal stop: zero increment\\\"},\\n {0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\"}\\n};\\n\\nint main() {\\n int i, j, c;\\n bool empty;\\n S s;\\n const int limit = 10;\\n for (i = 0; i < 9; ++i) {\\n s = examples[i];\\n printf(\\\"%s\\\\n\\\", s.comment);\\n printf(\\\"Range(%d, %d, %d) -> [\\\", s.start, s.stop, s.incr);\\n empty = TRUE;\\n for (j = s.start, c = 0; j <= s.stop && c < limit; j += s.incr, ++c) {\\n printf(\\\"%d \\\", j);\\n empty = FALSE;\\n }\\n if (!empty) printf(\\\"\\\\b\\\");\\n printf(\\\"]\\\\n\\\\n\\\");\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <cstdint>\\n#include <iomanip>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\n\\nstruct LoopData {\\n\\tint32_t start;\\n\\tint32_t stop;\\n\\tint32_t increment;\\n\\tstd::string comment;\\n};\\n\\nvoid print_vector(const std::vector<int32_t>& list) {\\n\\tstd::cout << \\\"[\\\";\\n\\tfor ( uint64_t i = 0; i < list.size(); ++i ) {\\n\\t\\tstd::cout << list[i];\\n\\t\\tif ( i < list.size() - 1 ) {\\n\\t\\t\\tstd::cout << \\\", \\\";\\n\\t\\t}\\n\\t}\\n\\tstd::cout << \\\"]\\\";\\n}\\n\\nvoid runTest(const LoopData& loop_data) {\\n\\tstd::vector<int32_t> values{};\\n\\tfor ( int32_t i = loop_data.start; i <= loop_data.stop; i += loop_data.increment ) {\\n\\t\\tvalues.emplace_back(i);\\n\\t\\tif ( values.size() >= 10 ) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tstd::cout << std::left << std::setw(45) << loop_data.comment; print_vector(values);\\n\\tstd::cout << ( values.size() == 10 ? \\\" (loops forever)\\\" : \\\"\\\" ) << std::endl;\\n}\\n\\nint main() {\\n\\trunTest(LoopData(-2, 2, 1, \\\"Normal\\\"));\\n\\trunTest(LoopData(-2, 2, 0, \\\"Zero increment\\\"));\\n\\trunTest(LoopData(-2, 2, -1, \\\"Increments away from stop value\\\"));\\n\\trunTest(LoopData(-2, 2, 10, \\\"First increment is beyond stop value\\\"));\\n\\trunTest(LoopData(2, -2, 1, \\\"Start more than stop: positive increment\\\"));\\n\\trunTest(LoopData(2, 2, 1, \\\"Start equal stop: positive increment\\\"));\\n\\trunTest(LoopData(2, 2, -1, \\\"Start equal stop: negative increment\\\"));\\n\\trunTest(LoopData(2, 2, 0, \\\"Start equal stop: zero increment\\\"));\\n\\trunTest(LoopData(0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\"));\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\n\\nstatic class Program\\n{\\n static void Main()\\n {\\n Example(-2, 2, 1, \\\"Normal\\\");\\n Example(-2, 2, 0, \\\"Zero increment\\\");\\n Example(-2, 2, -1, \\\"Increments away from stop value\\\");\\n Example(-2, 2, 10, \\\"First increment is beyond stop value\\\");\\n Example(2, -2, 1, \\\"Start more than stop: positive increment\\\");\\n Example(2, 2, 1, \\\"Start equal stop: positive increment\\\");\\n Example(2, 2, -1, \\\"Start equal stop: negative increment\\\");\\n Example(2, 2, 0, \\\"Start equal stop: zero increment\\\");\\n Example(0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\");\\n }\\n\\n static IEnumerable<int> Range(int start, int stop, int increment)\\n {\\n // To replicate the (arguably more correct) behavior of VB.NET:\\n //for (int i = start; increment >= 0 ? i <= stop : stop <= i; i += increment)\\n\\n // Decompiling the IL emitted by the VB compiler (uses shifting right by 31 as the signum function and bitwise xor in place of the conditional expression):\\n //for (int i = start; ((increment >> 31) ^ i) <= ((increment >> 31) ^ stop); i += increment)\\n\\n // \\\"Naïve\\\" translation.\\n for (int i = start; i <= stop; i += increment)\\n yield return i;\\n }\\n\\n static void Example(int start, int stop, int increment, string comment)\\n {\\n // Add a space, pad to length 50 with hyphens, and add another space.\\n Console.Write((comment + \\\" \\\").PadRight(50, '-') + \\\" \\\");\\n\\n const int MAX_ITER = 9;\\n\\n int iteration = 0;\\n foreach (int i in Range(start, stop, increment))\\n {\\n Console.Write(\\\"{0,2} \\\", i);\\n\\n if (++iteration > MAX_ITER) break;\\n }\\n\\n Console.WriteLine();\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\n\\nstatic class Program {\\n struct S {\\n public int Start, Stop, Incr;\\n public string Comment;\\n }\\n\\n static readonly S[] examples = {\\n new S{Start=-2, Stop=2, Incr=1, Comment=\\\"Normal\\\"},\\n new S{Start=-2, Stop=2, Incr=0, Comment=\\\"Zero increment\\\"},\\n new S{Start=-2, Stop=2, Incr=-1, Comment=\\\"Increments away from stop value\\\"},\\n new S{Start=-2, Stop=2, Incr=10, Comment=\\\"First increment is beyond stop value\\\"},\\n new S{Start=2, Stop=-2, Incr=1, Comment=\\\"Start more than stop: positive increment\\\"},\\n new S{Start=2, Stop=2, Incr=1, Comment=\\\"Start equal stop: positive increment\\\"},\\n new S{Start=2, Stop=2, Incr=-1, Comment=\\\"Start equal stop: negative increment\\\"},\\n new S{Start=2, Stop=2, Incr=0, Comment=\\\"Start equal stop: zero increment\\\"},\\n new S{Start=0, Stop=0, Incr=0, Comment=\\\"Start equal stop equal zero: zero increment\\\"}\\n };\\n\\n static int Main() {\\n const int limit = 10;\\n bool empty;\\n for (int i = 0; i < 9; ++i) {\\n S s = examples[i];\\n Console.Write(\\\"{0}\\\\n\\\", s.Comment);\\n Console.Write(\\\"Range({0:d}, {1:d}, {2:d}) -> [\\\", s.Start, s.Stop, s.Incr);\\n empty = true;\\n for (int j = s.Start, c = 0; j <= s.Stop && c < limit; j += s.Incr, ++c) {\\n Console.Write(\\\"{0:d} \\\", j);\\n empty = false;\\n }\\n if (!empty) Console.Write(\\\"\\\\b\\\");\\n Console.Write(\\\"]\\\\n\\\\n\\\");\\n }\\n return 0;\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"100 cls\\n110 for i = 1 to 9\\n120 contar = 0\\n130 read start,fin,inc,cmt$\\n140 print cmt$\\n150 print \\\" Bucle de \\\";start;\\\"a \\\";fin;\\\" en incrementos de \\\";inc\\n160 for vr = start to fin step inc\\n170 print \\\" Indice del bucle = \\\";vr\\n180 contar = contar+1\\n190 if contar = 10 then\\n200 print \\\" Saliendo de un bucle infinito\\\"\\n210 goto 240\\n220 endif\\n230 next vr\\n240 print \\\" Bucle terminado\\\" : print : print\\n250 next i\\n260 end\\n270 data -2,2,1,\\\"Normal\\\",-2,2,0,\\\"Zero increment\\\",-2,2,-1,\\\"Increments away from stop value\\\"\\n280 data -2,2,10,\\\"First increment is beyond stop value\\\",2,-2,1,\\\"Start more than stop: positive increment\\\"\\n290 data 2,2,1,\\\"Start equal stop: positive increment\\\",2,2,-1,\\\"Start equal stop: negative increment\\\"\\n300 data 2,2,0,\\\"Start equal stop: zero increment\\\",0,0,0,\\\"Start equal stop equal zero: zero increment\\\"\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"(dolist (lst '((-2 2 1 \\\"Normal\\\")\\t ; Iterate the parameters list `start' `stop' `increment' and `comment'\\n\\t (-2 2 0 \\\"Zero increment\\\")\\n\\t (-2 2 -1 \\\"Increments away from stop value\\\")\\n\\t (-2 2 10 \\\"First increment is beyond stop value\\\")\\n\\t ( 2 -2 1 \\\"Start more than stop: positive increment\\\")\\n\\t ( 2 2 1 \\\"Start equal stop: positive increment\\\")\\n\\t ( 2 2 -1 \\\"Start equal stop: negative increment\\\")\\n\\t ( 2 2 0 \\\"Start equal stop: zero increment\\\")\\n\\t ( 0 0 0 \\\"Start equal stop equal zero: zero increment\\\")))\\n (do ((i (car lst) (incf i (caddr lst))) ; Initialize `start' and set `increment'\\n (result ())\\t\\t\\t ; Initialize the result list\\n (loop-max 0 (incf loop-max)))\\t ; Initialize a loop limit\\n ((or (> i (cadr lst))\\t\\t ; Break condition to `stop'\\n\\t (> loop-max 10))\\t\\t ; Break condition to loop limit\\n (format t \\\"~&~44a: ~{~3d ~}\\\"\\t ; Finally print\\n\\t (cadddr lst)\\t\\t ; The `comment'\\n\\t (reverse result)))\\t ; The in(de)creased numbers into result\\n (push i result)))\\t\\t\\t ; Add the number to result\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"program Wrong_ranges;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils;\\n\\nprocedure Example(start, stop, Increment: Integer; comment: string);\\nvar\\n MAX_ITER, iteration, i: Integer;\\nbegin\\n Write((comment + ' ').PadRight(50, '-') + ' ');\\n MAX_ITER := 9;\\n iteration := 0;\\n\\n if Increment = 1 then\\n begin\\n for i := start to stop do\\n begin\\n Write(i: 2, ' ');\\n inc(iteration);\\n if iteration >= MAX_ITER then\\n Break;\\n end;\\n Writeln;\\n exit;\\n end;\\n\\n if Increment = -1 then\\n begin\\n for i := start downto stop do\\n begin\\n Write(i: 2, ' ');\\n inc(iteration);\\n if iteration >= MAX_ITER then\\n Break;\\n end;\\n Writeln;\\n exit;\\n end;\\n\\n Writeln('Not supported');\\nend;\\n\\nbegin\\n Example(-2, 2, 1, 'Normal');\\n Example(-2, 2, 0, 'Zero increment');\\n Example(-2, 2, -1, 'Increments away from stop value');\\n Example(-2, 2, 10, 'First increment is beyond stop value');\\n Example(2, -2, 1, 'Start more than stop: positive increment');\\n Example(2, 2, 1, 'Start equal stop: positive increment');\\n Example(2, 2, -1, 'Start equal stop: negative increment');\\n Example(2, 2, 0, 'Start equal stop: zero increment');\\n Example(0, 0, 0, 'Start equal stop equal zero: zero increment');\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"program Wrong_rangesEnumerator;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils;\\n\\ntype\\n TRange = record\\n private\\n Fincrement: Integer;\\n FIndex: Integer;\\n FStart, FStop, FValue: Integer;\\n function GetCurrent: Integer; inline;\\n public\\n constructor Create(start, stop, Increment: Integer);\\n function MoveNext: Boolean; inline;\\n function GetEnumerator: TRange;\\n property Current: Integer read GetCurrent;\\n end;\\n\\n{ TEnumerator<T> }\\n\\nconstructor TRange.Create(start, stop, Increment: Integer);\\nbegin\\n FStart := start;\\n FStop := stop;\\n Fincrement := Increment;\\n FValue := start - Increment;\\nend;\\n\\nfunction TRange.GetCurrent: Integer;\\nbegin\\n Result := FValue;\\nend;\\n\\nfunction TRange.GetEnumerator: TRange;\\nbegin\\n Result := self;\\nend;\\n\\nfunction TRange.MoveNext: Boolean;\\nbegin\\n FValue := FValue + Fincrement;\\n if (Fincrement > 0) and (FValue > FStop) then\\n exit(False);\\n\\n if (Fincrement < 0) and (FValue < FStop) then\\n exit(False);\\n\\n Result := True;\\nend;\\n\\nprocedure Example(start, stop, Increment: Integer; comment: string);\\nvar\\n MAX_ITER, iteration, i, e: Integer;\\nbegin\\n Write((comment + ' ').PadRight(50, '-') + ' ');\\n MAX_ITER := 9;\\n iteration := 0;\\n\\n for e in TRange.Create(start, stop, Increment) do\\n begin\\n Write(e: 2, ' ');\\n inc(iteration);\\n if iteration >= MAX_ITER then\\n Break;\\n end;\\n\\n Writeln;\\nend;\\n\\nbegin\\n Example(-2, 2, 1, 'Normal');\\n Example(-2, 2, 0, 'Zero increment');\\n Example(-2, 2, -1, 'Increments away from stop value');\\n Example(-2, 2, 10, 'First increment is beyond stop value');\\n Example(2, -2, 1, 'Start more than stop: positive increment');\\n Example(2, 2, 1, 'Start equal stop: positive increment');\\n Example(2, 2, -1, 'Start equal stop: negative increment');\\n Example(2, 2, 0, 'Start equal stop: zero increment');\\n Example(0, 0, 0, 'Start equal stop equal zero: zero increment');\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"example\\n\\t\\t-- Loops/Wrong ranges\\n\\tdo\\n\\t\\t⟳ ic:(-2 |..| 2) ¦ \\t\\t\\t\\tdo_nothing ⟲ -- 2 \\t2 \\t 1 \\tNormal\\n\\t\\t⟳ ic:(-2 |..| 2).new_cursor + 0 ¦ \\t\\tdo_nothing ⟲ -- -2 \\t2 \\t 0 \\tZero increment\\n\\t\\t⟳ ic:(-2 |..| 2).new_cursor - 1 ¦ \\t\\tdo_nothing ⟲ -- -2 \\t2 \\t-1 \\tIncrements away from stop value\\n\\t\\t⟳ ic:(-2 |..| 2).new_cursor + 10 ¦ \\t\\tdo_nothing ⟲ -- -2 \\t2 \\t10 \\tFirst increment is beyond stop value\\n\\t\\t⟳ ic:(-2 |..| 2).new_cursor.reversed ¦ \\t\\tdo_nothing ⟲ -- 2 \\t-2 \\t 1 \\tStart more than stop: positive increment\\n\\t\\t⟳ ic:(2 |..| 2) ¦ \\t\\t\\t\\tdo_nothing ⟲ -- 2 \\t2 \\t 1 \\tStart equal stop: positive increment\\n\\t\\t⟳ ic:(2 |..| 2).new_cursor - 1 ¦ \\t\\tdo_nothing ⟲ -- 2 \\t2 \\t-1 \\tStart equal stop: negative increment\\n\\t\\t⟳ ic:(2 |..| 2).new_cursor + 0 ¦ \\t\\tdo_nothing ⟲ -- 2 \\t2 \\t 0 \\tStart equal stop: zero increment\\n\\t\\t⟳ ic:(0 |..| 0).new_cursor + 0 ¦ \\t\\tdo_nothing ⟲ -- 0 \\t0 \\t 0 \\tStart equal stop equal zero: zero increment\\n\\tend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"USING: continuations formatting io kernel math.ranges\\nprettyprint sequences ;\\n\\n: try-range ( from length step -- )\\n [ <range> { } like . ]\\n [ 4drop \\\"Exception: divide by zero.\\\" print ] recover ;\\n\\n{\\n { -2 2 1 } { 2 2 0 } { -2 2 -1 } { -2 2 10 } { 2 -2 1 }\\n { 2 2 1 } { 2 2 -1 } { 2 2 0 } { 0 0 0 }\\n}\\n[\\n first3\\n [ \\\"%2d %2d %2d <range> => \\\" printf ]\\n [ try-range ] 3bi\\n] each\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"for a = -2 to 2 by 1 do !(a,' '); od;\\nfor a = -2 to 2 by 0 do !(a,' '); od;\\nfor a = -2 to 2 by -1 do !(a,' '); od;\\nfor a = -2 to 2 by 10 do !(a,' '); od;\\nfor a = 2 to -2 by 1 do !(a,' '); od;\\nfor a = 2 to 2 by 1 do !(a,' '); od;\\nfor a = 2 to 2 by -1 do !(a,' '); od;\\nfor a = 2 to 2 by 0 do !(a,' '); od;\\nfor a = 0 to 0 by 0 do !(a,' '); od;\\n\",\n \"language\": \"Fermat\"\n },\n {\n \"code\": \": test-seq ( start stop inc -- )\\n cr rot dup .\\\" start: \\\" 2 .r\\n rot dup .\\\" stop: \\\" 2 .r\\n rot dup .\\\" inc: \\\" 2 .r .\\\" | \\\"\\n -rot swap do i . dup +loop drop ;\\n-2 2 1 test-seq\\n-2 2 0 test-seq\\n-2 2 -1 test-seq\\n-2 2 10 test-seq\\n 2 -2 1 test-seq\\n 2 2 1 test-seq\\n 2 2 -1 test-seq\\n 2 2 0 test-seq\\n 0 0 0 test-seq\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": test-seq ( start stop inc -- )\\n cr rot dup .\\\" start: \\\" 2 .r\\n rot dup .\\\" stop: \\\" 2 .r\\n rot dup .\\\" inc: \\\" 2 .r .\\\" | \\\"\\n -rot swap ?do i . dup +loop drop ;\\n-2 2 1 test-seq\\n-2 2 0 test-seq\\n-2 2 -1 test-seq\\n-2 2 10 test-seq\\n 2 -2 1 test-seq\\n 2 2 1 test-seq\\n 2 2 -1 test-seq\\n 2 2 0 test-seq\\n 0 0 0 test-seq\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"data -2,2,1,\\\"Normal\\\",-2,2,0,\\\"Zero increment\\\",-2,2,-1,\\\"Increments away from stop value\\\"\\ndata -2,2,10,\\\"First increment is beyond stop value\\\",2,-2,1,\\\"Start more than stop: positive increment\\\"\\ndata 2,2,1,\\\"Start equal stop: positive increment\\\",2,2,-1,\\\"Start equal stop: negative increment\\\"\\ndata 2,2,0,\\\"Start equal stop: zero increment\\\",0,0,0,\\\"Start equal stop equal zero: zero increment\\\"\\n\\ndim as integer i, start, fin, inc, vr, count\\ndim as string cmt\\nfor i = 1 to 9\\n count = 0\\n read start, fin, inc, cmt\\n print cmt\\n print using \\\" Looping from ### to ### in increments of ##\\\"; start; fin; inc\\n for vr = start to fin step inc\\n print \\\" Loop index = \\\",vr\\n count += 1\\n if count = 10 then\\n print \\\" Breaking infinite loop\\\"\\n exit for\\n end if\\n next vr\\n print \\\" Loop finished\\\"\\n print\\n print\\nnext i\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\ntype S struct {\\n start, stop, incr int\\n comment string\\n}\\n\\nvar examples = []S{\\n {-2, 2, 1, \\\"Normal\\\"},\\n {-2, 2, 0, \\\"Zero increment\\\"},\\n {-2, 2, -1, \\\"Increments away from stop value\\\"},\\n {-2, 2, 10, \\\"First increment is beyond stop value\\\"},\\n {2, -2, 1, \\\"Start more than stop: positive increment\\\"},\\n {2, 2, 1, \\\"Start equal stop: positive increment\\\"},\\n {2, 2, -1, \\\"Start equal stop: negative increment\\\"},\\n {2, 2, 0, \\\"Start equal stop: zero increment\\\"},\\n {0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\"},\\n}\\n\\nfunc sequence(s S, limit int) []int {\\n var seq []int\\n for i, c := s.start, 0; i <= s.stop && c < limit; i, c = i+s.incr, c+1 {\\n seq = append(seq, i)\\n }\\n return seq\\n}\\n\\nfunc main() {\\n const limit = 10\\n for _, ex := range examples {\\n fmt.Println(ex.comment)\\n fmt.Printf(\\\"Range(%d, %d, %d) -> \\\", ex.start, ex.stop, ex.incr)\\n fmt.Println(sequence(ex, limit))\\n fmt.Println()\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List\\n\\nmain = putStrLn $ showTable True '|' '-' '+' table\\n\\ntable = [[\\\"start\\\",\\\"stop\\\",\\\"increment\\\",\\\"Comment\\\",\\\"Code\\\",\\\"Result/Analysis\\\"]\\n ,[\\\"-2\\\",\\\"2\\\",\\\"1\\\",\\\"Normal\\\",\\\"[-2,-1..2] or [-2..2]\\\",show [-2,-1..2]]\\n ,[\\\"-2\\\",\\\"2\\\",\\\"0\\\",\\\"Zero increment\\\",\\\"[-2,-2..2]\\\",\\\"Infinite loop of -2 <=> repeat -2\\\"]\\n ,[\\\"-2\\\",\\\"2\\\",\\\"-1\\\",\\\"Increments away from stop value\\\",\\\"[-2,-3..2]\\\",show [-2,-3..2]]\\n ,[\\\"-2\\\",\\\"2\\\",\\\"10\\\",\\\"First increment is beyond stop value\\\",\\\"[-2,8..2]\\\",show [-2,8..2]]\\n ,[\\\"2\\\",\\\"-2\\\",\\\"1\\\",\\\"Start more than stop: positive increment\\\",\\\"[2,3.. -2]\\\",show [2,3.. -2]]\\n ,[\\\"2\\\",\\\"2\\\",\\\"1\\\",\\\"Start equal stop: positive increment\\\",\\\"[2,3..2]\\\",show [2,3..2]]\\n ,[\\\"2\\\",\\\"2\\\",\\\"-1\\\",\\\"Start equal stop: negative increment\\\",\\\"[2,1..2]\\\",show [2,1..2]]\\n ,[\\\"2\\\",\\\"2\\\",\\\"0\\\",\\\"Start equal stop: zero increment\\\",\\\"[2,2..2]\\\",\\\"Infinite loop of 2 <=> repeat 2\\\"]\\n ,[\\\"0\\\",\\\"0\\\",\\\"0\\\",\\\"Start equal stop equal zero: zero increment\\\",\\\"[0,0..0]\\\", \\\"Infinite loop of 0 <=> repeat 0\\\"]]\\n\\nshowTable::Bool -> Char -> Char -> Char -> [[String]] -> String\\nshowTable _ _ _ _ [] = []\\nshowTable header ver hor sep contents = unlines $ hr:(if header then z:hr:zs else intersperse hr zss) ++ [hr]\\n where\\n vss = map (map length) $ contents\\n ms = map maximum $ transpose vss ::[Int]\\n hr = concatMap (\\\\ n -> sep : replicate n hor) ms ++ [sep]\\n top = replicate (length hr) hor\\n bss = map (\\\\ps -> map (flip replicate ' ') $ zipWith (-) ms ps) $ vss\\n zss@(z:zs) = zipWith (\\\\us bs -> (concat $ zipWith (\\\\x y -> (ver:x) ++ y) us bs) ++ [ver]) contents bss\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Algorithms as algo;\\n\\nclass Example {\\n _start = none;\\n _stop = none;\\n _step = none;\\n _comment = none;\\n}\\n\\nmain() {\\n examples = [\\n Example( -2, 2, 1, \\\"Normal\\\" ),\\n Example( 2, 2, 0, \\\"Start equal stop: zero increment\\\" ),\\n Example( 0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\" ),\\n Example( 2, 2, 1, \\\"Start equal stop: positive increment\\\" ),\\n Example( 2, 2, -1, \\\"Start equal stop: negative increment\\\" ),\\n Example( -2, 2, 10, \\\"First increment is beyond stop value\\\" ),\\n Example( -2, 2, 0, \\\"Zero increment, stop greater than start\\\" ),\\n Example( -2, 2, -1, \\\"Increments away from stop value\\\" ),\\n Example( 2, -2, 1, \\\"Start more than stop: positive increment\\\" )\\n ];\\n for ( ex : examples ) {\\n print(\\n \\\"{}\\\\nRange( {}, {}, {} ) -> \\\".format(\\n ex._comment, ex._start, ex._stop, ex._step\\n )\\n );\\n r = algo.range( ex._start, ex._stop, ex._step );\\n print(\\n \\\"{}\\\\n\\\\n\\\".format(\\n algo.materialize( algo.slice( r, 22 ), list )\\n )\\n );\\n }\\n}\\n\",\n \"language\": \"Huginn\"\n },\n {\n \"code\": \"genrange=: {{\\n 'start stop increment'=. y\\n start+increment*i.1+<.(stop-start)%increment\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" genrange 9 2 _2 NB. valid\\n9 7 5 3\\n genrange _2 2 1 NB. valid\\n_2 _1 0 1 2\\n genrange _2 2 0 NB. invalid: requires at least an infinity of values\\n|domain error: genrange\\n genrange _2 2 _1 NB. projects backwards from _2\\n_4 _3 _2\\n genrange _2 2 10 NB. valid\\n_2\\n genrange 2 _2 1 NB. projects backwards from 2\\n4 3 2\\n genrange 2 2 1 NB. valid (increment is irrelevant)\\n2\\n genrange 2 2 _1 NB. valid (increment is irrelevant)\\n2\\n genrange 2 2 0 NB. valid (increment is irrelevant)\\n2\\n genrange 0 0 0 NB. valid (increment is irrelevant)\\n0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.List;\\n\\npublic class LoopsWrongRanges {\\n\\n public static void main(String[] args) {\\n runTest(new LoopTest(-2, 2, 1, \\\"Normal\\\"));\\n runTest(new LoopTest(-2, 2, 0, \\\"Zero increment\\\"));\\n runTest(new LoopTest(-2, 2, -1, \\\"Increments away from stop value\\\"));\\n runTest(new LoopTest(-2, 2, 10, \\\"First increment is beyond stop value\\\"));\\n runTest(new LoopTest(2, -2, 1, \\\"Start more than stop: positive increment\\\"));\\n runTest(new LoopTest(2, 2, 1, \\\"Start equal stop: positive increment\\\"));\\n runTest(new LoopTest(2, 2, -1, \\\"Start equal stop: negative increment\\\"));\\n runTest(new LoopTest(2, 2, 0, \\\"Start equal stop: zero increment\\\"));\\n runTest(new LoopTest(0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\"));\\n }\\n\\n private static void runTest(LoopTest loopTest) {\\n List<Integer> values = new ArrayList<>();\\n for (int i = loopTest.start ; i <= loopTest.stop ; i += loopTest.increment ) {\\n values.add(i);\\n if ( values.size() >= 10 ) {\\n break;\\n }\\n }\\n System.out.printf(\\\"%-45s %s%s%n\\\", loopTest.comment, values, values.size()==10 ? \\\" (loops forever)\\\" : \\\"\\\");\\n }\\n\\n private static class LoopTest {\\n int start;\\n int stop;\\n int increment;\\n String comment;\\n public LoopTest(int start, int stop, int increment, String comment) {\\n this.start = start;\\n this.stop = stop;\\n this.increment = increment;\\n this.comment = comment;\\n }\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"collect(-2:1:2) # → [-2, -1, 0, 1, 2]\\ncollect(-2:0:2) # fails\\ncollect(-2:-1:2) # → []\\ncollect(-2:10:2) # → [-2]\\ncollect(2:1:-2) # → []\\ncollect(2:1:2) # → [2]\\ncollect(2:-1:2) # → [2]\\ncollect(2:0:2) # fails\\ncollect(0:0:0) # fails\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// Version 1.2.70\\n\\nclass Example(val start: Int, val stop: Int, val incr: Int, val comment: String)\\n\\nvar examples = listOf(\\n Example(-2, 2, 1, \\\"Normal\\\"),\\n Example(-2, 2, 0, \\\"Zero increment\\\"),\\n Example(-2, 2, -1, \\\"Increments away from stop value\\\"),\\n Example(-2, 2, 10, \\\"First increment is beyond stop value\\\"),\\n Example(2, -2, 1, \\\"Start more than stop: positive increment\\\"),\\n Example(2, 2, 1, \\\"Start equal stop: positive increment\\\"),\\n Example(2, 2, -1, \\\"Start equal stop: negative increment\\\"),\\n Example(2, 2, 0, \\\"Start equal stop: zero increment\\\"),\\n Example(0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\")\\n)\\n\\nfun sequence(ex: Example, limit: Int) =\\n if (ex.incr == 0) {\\n List(limit) { ex.start }\\n }\\n else {\\n val res = mutableListOf<Int>()\\n var c = 0\\n var i = ex.start\\n while (i <= ex.stop && c < limit) {\\n res.add(i)\\n i += ex.incr\\n c++\\n }\\n res\\n }\\n\\nfun main(args: Array<String>) {\\n for (ex in examples) {\\n println(ex.comment)\\n System.out.printf(\\\"Range(%d, %d, %d) -> \\\", ex.start, ex.stop, ex.incr)\\n println(sequence(ex, 10))\\n println()\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"val .data = qs:block END\\n start stop increment comment\\n -2 2 1 Normal\\n -2 2 0 Zero increment\\n -2 2 -1 Increments away from stop value\\n -2 2 10 First increment is beyond stop value\\n 2 -2 1 Start more than stop: positive increment\\n 2 2 1 Start equal stop: positive increment\\n 2 2 -1 Start equal stop: negative increment\\n 2 2 0 Start equal stop: zero increment\\n 0 0 0 Start equal stop equal zero: zero increment\\nEND\\n\\nvar .table = submatches(RE/([^ ]+) +([^ ]+) +([^ ]+) +(.+)\\\\n?/, .data)\\n\\nval .f = fn(.x) number .x\\nfor .i in 2..len(.table) {\\n .table[.i] = map [.f, .f, .f, _], .table[.i]\\n}\\n\\nfor .test in rest(.table) {\\n val .start, .stop, .inc, .comment = .test\\n {\\n val .series = series(.start .. .stop, .inc)\\n catch {\\n writeln $\\\"\\\\.comment;\\\\nERROR: \\\\._err[\\\"msg\\\"]:L200(...);\\\\n\\\"\\n } else {\\n writeln $\\\"\\\\.comment;\\\\nresult: \\\\.series;\\\\n\\\"\\n }\\n }\\n}\\n\",\n \"language\": \"Langur\"\n },\n {\n \"code\": \"tests = {\\n { -2, 2, 1, \\\"Normal\\\" },\\n {-2, 2, 0, \\\"Zero increment\\\" }, -- 5.4 error\\n {-2, 2, -1, \\\"Increments away from stop value\\\" },\\n {-2, 2, 10, \\\"First increment is beyond stop value\\\" },\\n { 2, -2, 1, \\\"Start more than stop: positive increment\\\" },\\n { 2, 2, 1, \\\"Start equal stop: positive increment\\\" },\\n { 2, 2, -1, \\\"Start equal stop: negative increment\\\" },\\n { 2, 2, 0, \\\"Start equal stop: zero increment\\\" }, -- 5.4 error\\n { 0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\" } -- 5.4 error\\n}\\nunpack = unpack or table.unpack -- polyfill 5.2 vs 5.3\\nfor _,test in ipairs(tests) do\\n start,stop,incr,desc = unpack(test)\\n io.write(string.format(\\\"%-44s (%2d, %2d, %2d) : \\\",desc,start,stop,incr))\\n local sta,err = pcall(function()\\n local n = 0\\n for i = start,stop,incr do\\n io.write(string.format(\\\"%2d, \\\", i))\\n n=n+1 if n>=10 then io.write(\\\"...\\\") break end\\n end\\n io.write(\\\"\\\\n\\\")\\n end)\\n if err then io.write(\\\"RUNTIME ERROR!\\\\n\\\") end\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"# Normal\\nseq(-2..2, 1);\\n\\n# Zero increment\\nseq(-2..2, 0);\\n\\n# Increments away from stop value\\nseq(-2..2, -1);\\n\\n# First increment is beyond stop value\\nseq(-2..2, 10);\\n\\n# Start more than stop: positive increment\\nseq(2..-2, 1);\\n\\n# Start equal stop: positive increment\\nseq(2..2, 1);\\n\\n# Start equal stop: negative increment\\nseq(2..2, -1);\\n\\n# Start equal stop: zero increment\\nseq(2..2, 0);\\n\\n# Start equal stop equal zero: zero increment\\nseq(0..0, 0);\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"Table[i, {i, -2, 2, 1}]\\nTable[i, {i, -2, 2, 0}]\\nTable[i, {i, -2, 2, -1}]\\nTable[i, {i, -2, 2, 10}]\\nTable[i, {i, 2, -2, 1}]\\nTable[i, {i, 2, 2, 1}]\\nTable[i, {i, 2, 2, -1}]\\nTable[i, {i, 2, 2, 0}]\\nTable[i, {i, 0, 0, 0}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"100 CLS : REM 100 HOME for Applesoft BASIC : REM DELETE line for Minimal BASIC\\n110 DATA -2,2,1,\\\"Normal\\\",-2,2,0,\\\"Zero increment\\\"\\n120 DATA -2,2,-1,\\\"Increments away from stop value\\\"\\n130 DATA -2,2,10,\\\"First increment is beyond stop value\\\"\\n140 DATA 2,-2,1,\\\"Start more than stop: positive increment\\\"\\n150 DATA 2,2,1,\\\"Start equal stop: positive increment\\\"\\n160 DATA 2,2,-1,\\\"Start equal stop: negative increment\\\"\\n170 DATA 2,2,0,\\\"Start equal stop: zero increment\\\"\\n180 DATA 0,0,0,\\\"Start equal stop equal zero: zero increment\\\"\\n190 FOR j = 1 TO 9\\n200 LET c = 0\\n210 READ s, f, i, t$\\n220 PRINT t$\\n230 PRINT \\\" Bucle de \\\"; s; \\\"a \\\"; f; \\\" en incrementos de \\\"; i\\n240 FOR v = s TO f STEP i\\n250 PRINT \\\" Indice del bucle = \\\"; v\\n260 LET c = c + 1\\n270 IF c <> 10 THEN 300\\n280 PRINT \\\" Saliendo de un bucle infinito\\\"\\n290 GOTO 310\\n300 NEXT v\\n310 PRINT \\\" Bucle terminado\\\"\\n320 PRINT\\n330 NEXT j\\n340 END\\n\",\n \"language\": \"Minimal-BASIC\"\n },\n {\n \"code\": \"import sequtils, strformat\\n\\nproc displayRange(first, last, step: int) =\\n\\n stdout.write &\\\"({first:>2}, {last:>2}, {step:>2}): \\\"\\n\\n echo if step > 0: ($toSeq(countup(first, last, step)))[1..^1]\\n elif step < 0: ($toSeq(countdown(first, last, -step)))[1..^1]\\n else: \\\"not allowed.\\\"\\n\\nfor (f, l, s) in [(-2, 2, 1), (-2, 2, 0), (-2, 2, -1),\\n (-2, 2, 10), (2, -2, 1), (2, 2, 1),\\n (2, 2, -1), (2, 2, 0), (0, 0, 0)]:\\n displayRange(f, l, s)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"for $i (\\n [ -2, 2, 1], #1 Normal\\n [ -2, 2, 0], #2 Zero increment\\n [ -2, 2, -1], #3 Increments away from stop value\\n [ -2, 2, 10], #4 First increment is beyond stop value\\n [ 2, -2, 1], #5 Start more than stop: positive increment\\n [ 2, 2, 1], #6 Start equal stop: positive increment\\n [ 2, 2, -1], #7 Start equal stop: negative increment\\n [ 2, 2, 0], #8 Start equal stop: zero increment\\n [ 0, 0, 0], #9 Start equal stop equal zero: zero increment\\n) {\\n $iter = gen_seq(@$i);\\n printf \\\"start: %3d stop: %3d incr: %3d | \\\", @$i;\\n printf \\\"%4s\\\", &$iter for 1..10;\\n print \\\"\\\\n\\\";\\n}\\n\\nsub gen_seq {\\n my($start,$stop,$increment) = @_;\\n $n = 0;\\n return sub {\\n $term = $start + $n++ * $increment;\\n return $term > $stop ? '' : $term;\\n }\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">stop</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">legend</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">bFor</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;\\\">if</span> <span style=\\\"color: #000000;\\\">bFor</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">try</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">start</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">stop</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">step</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">i</span>\\n <span style=\\\"color: #008080;\\\">if</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: #000000;\\\">9</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: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">catch</span> <span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">E_USER</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">try</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">start</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">stop</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">stop</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;\\\">i</span>\\n <span style=\\\"color: #008080;\\\">if</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: #000000;\\\">9</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: #000080;font-style:italic;\\\">-- if i=stop then exit end if\\n -- if step=0 then exit end if</span>\\n <span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">step</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: #7060A8;\\\">sprint</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: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%-43s: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">legend</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;\\\">procedure</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;\\\">2</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008080;\\\">iff</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: #008000;\\\">\\\"for\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">\\\"while\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">test</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> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Normal\\\"</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;\\\">test</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> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Zero increment\\\"</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;\\\">test</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><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Increments away from stop value\\\"</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;\\\">test</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><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"First increment is beyond stop value\\\"</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;\\\">test</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> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Start more than stop: positive increment\\\"</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;\\\">test</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> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Start equal stop: positive increment\\\"</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;\\\">test</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><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Start equal stop: negative increment\\\"</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;\\\">test</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> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Start equal stop: zero increment\\\"</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;\\\">test</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: #008000;\\\">\\\"Start equal stop equal zero: zero increment\\\"</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;\\\">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\": \"loops:procedure options (main);\\n declare i fixed binary;\\n\\n put skip list ('-2 to 2 by 1:');\\n do i = -2 to 2 by 1;\\n put edit (i) (f(3));\\n end;\\n put skip list ('-2 to 2 by 0: infinite loop, prints -2');\\n\\n put skip list ('-2 to 2 by -1: [no values printed]');\\n do i = -2 to 2 by -1;\\n put edit (i) (f(3));\\n end;\\n\\n put skip list ('-2 to 2 by 10:');\\n do i = -2 to 2 by 1;\\n put edit (i) (f(3));\\n end;\\n\\n put skip list (' 2 to 2 by 1:');\\n do i = 2 to 2 by 1;\\n put edit (i) (f(3));\\n end;\\n\\n put skip list (' 2 to 2 by -1:');\\n do i = 2 to 2 by -1;\\n put edit (i) (f(3));\\n end;\\n\\n put skip list (' 2 to 2 by 0: infinite loop, prints 2');\\n put skip list (' 0 to 0 by 0: infinite loop, prints 0');\\n\\nend loops;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"import re\\nfrom itertools import islice # To limit execution if it would generate huge values\\n# list(islice('ABCDEFG', 2)) --> ['A', 'B']\\n# list(islice('ABCDEFG', 4)) --> ['A', 'B', 'C', 'D']\\n\\n\\ndata = '''\\nstart \\tstop \\tincrement \\tComment\\n-2 \\t2 \\t1 \\tNormal\\n-2 \\t2 \\t0 \\tZero increment\\n-2 \\t2 \\t-1 \\tIncrements away from stop value\\n-2 \\t2 \\t10 \\tFirst increment is beyond stop value\\n2 \\t-2 \\t1 \\tStart more than stop: positive increment\\n2 \\t2 \\t1 \\tStart equal stop: positive increment\\n2 \\t2 \\t-1 \\tStart equal stop: negative increment\\n2 \\t2 \\t0 \\tStart equal stop: zero increment\\n0 \\t0 \\t0 \\tStart equal stop equal zero: zero increment\\n'''\\n\\ntable = [re.split(r'\\\\s\\\\s+', line.strip()) for line in data.strip().split('\\\\n')]\\n#%%\\nfor _start, _stop, _increment, comment in table[1:]:\\n start, stop, increment = [int(x) for x in (_start, _stop, _increment)]\\n print(f'{comment.upper()}:\\\\n range({start}, {stop}, {increment})')\\n values = None\\n try:\\n values = list(islice(range(start, stop, increment), 999))\\n except ValueError as e:\\n print(' !!ERROR!!', e)\\n if values is not None:\\n if len(values) < 22:\\n print(' =', values)\\n else:\\n print(' =', str(values[:22])[:-1], '...')\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"seq(from = -2, to = 2, by = 1)#Output: -2 -1 0 1 2\\nseq(from = -2, to = 2, by = 0)#Fails: \\\"invalid '(to - from)/by'\\\"\\nseq(from = -2, to = 2, by = -1)#Fails: As in the notes above - \\\"Specifying to - from and by of opposite signs is an error.\\\"\\nseq(from = -2, to = 2, by = 10)#Output: -2\\nseq(from = 2, to = -2, by = 1)#Fails: Same as the third case.\\nseq(from = 2, to = 2, by = 1)#Output: 2\\nseq(from = 2, to = 2, by = -1)#Output: 2\\nseq(from = 2, to = 2, by = 0)#Output: 2\\nseq(from = 0, to = 0, by = 0)#Output: 0\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require racket/sandbox)\\n\\n(define tests '([-2 2 1 \\\"Normal\\\"]\\n [-2 2 0 \\\"Zero increment\\\"]\\n [-2 2 -1 \\\"Increments away from stop value\\\"]\\n [-2 2 10 \\\"First increment is beyond stop value\\\"]\\n [2 -2 1 \\\"Start more than stop: positive increment\\\"]\\n [2 2 1 \\\"Start equal stop: positive increment\\\"]\\n [2 2 -1 \\\"Start equal stop: negative increment\\\"]\\n [2 2 0 \\\"Start equal stop: zero increment\\\"]\\n [0 0 0 \\\"Start equal stop equal zero: zero increment\\\"]))\\n\\n(for ([test (in-list tests)])\\n (match-define (list st ed inc desc) test)\\n (printf \\\"~a:\\\\n (in-range ~a ~a ~a) = ~a\\\\n\\\\n\\\"\\n desc st ed inc\\n (with-handlers ([exn:fail:resource? (thunk* 'timeout)])\\n (with-limits 1 #f\\n (sequence->list (in-range st ed inc))))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"# Given sequence definitions\\n# start stop inc. Comment\\nfor -2, 2, 1, # Normal\\n -2, 2, 0, # Zero increment\\n -2, 2, -1, # Increments away from stop value\\n -2, 2, 10, # First increment is beyond stop value\\n 2, -2, 1, # Start more than stop: positive increment\\n 2, 2, 1, # Start equal stop: positive increment\\n 2, 2, -1, # Start equal stop: negative increment\\n 2, 2, 0, # Start equal stop: zero increment\\n 0, 0, 0, # Start equal stop equal zero: zero increment\\n\\n# Additional \\\"problematic\\\" sequences\\n 1, Inf, 3, # Endpoint literally at infinity\\n 0, π, τ/8, # Floating point numbers\\n 1.4, *, -7.1 # Whatever\\n\\n -> $start, $stop, $inc {\\n my $seq = flat ($start, *+$inc … $stop);\\n printf \\\"Start: %3s, Stop: %3s, Increment: %3s | \\\", $start, $stop.Str, $inc;\\n # only show up to the first 15 elements of possibly infinite sequences\\n put $seq[^15].grep: +*.defined\\n}\\n\\n# For that matter the start and end values don't need to be numeric either. Both\\n# or either can be a function, list, or other object. Really anything that a\\n# \\\"successor\\\" function can be defined for and produces a value.\\nsay \\\"\\\\nDemonstration of some other specialized sequence operator functionality:\\\";\\n# Start with a list, iterate by multiplying the previous 3 terms together\\n# and end with a term defined by a function.\\nput 1, -.5, 2.sqrt, * × * × * … *.abs < 1e-2;\\n\\n# Start with an array, iterate by rotating, end when 0 is in the last place.\\nsay [0,1,2,3,4,5], *.rotate(-1).Array … !*.tail;\\n\\n# Iterate strings backwards.\\nput 'xp' … 'xf';\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program demonstrates several versions of DO loops with \\\"unusual\\\" iterations. */\\n@.=; @.1= ' -2 2 1 ' /*\\\"normal\\\". */\\n @.2= ' -2 2 0 ' /*\\\"normal\\\", zero increment.*/\\n @.3= ' -2 2 -1 ' /*increases away from stop, neg increment.*/\\n @.4= ' -2 2 10 ' /*1st increment > stop, positive increment.*/\\n @.5= ' 2 -2 1 ' /*start > stop, positive increment.*/\\n @.6= ' 2 2 1 ' /*start equals stop, positive increment.*/\\n @.7= ' 2 2 -1 ' /*start equals stop, negative increment.*/\\n @.8= ' 2 2 0 ' /*start equals stop, zero increment.*/\\n @.9= ' 0 0 0 ' /*start equals stop, zero increment.*/\\nzLim= 10 /*a limit to check for runaway (race) loop.*/\\n /*a zero increment is not an error in REXX.*/\\n do k=1 while @.k\\\\=='' /*perform a DO loop with several ranges. */\\n parse var @.k x y z . /*obtain the three values for a DO loop. */\\n say\\n say center('start of performing DO loop number ' k \\\" with range: \\\" x y z, 79, '═')\\n zz= 0\\n do j=x to y by z until zz>=zLim /* ◄─── perform the DO loop.*/\\n say ' j ───►' right(j, max(3, length(j) ) ) /*right justify J for alignment*/\\n if z==0 then zz= zz + 1 /*if zero inc, count happenings*/\\n end /*j*/\\n\\n if zz>=zLim then say 'the DO loop for the ' k \\\" entry was terminated (runaway).\\\"\\n say center(' end of performing DO loop number ' k \\\" with range: \\\" x y z, 79, '─')\\n say\\n end /*k*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"examples = [\\n [ -2, 2, 1],\\n [ -2, 2, 0],\\n [ -2, 2, -1],\\n [ -2, 2, 10],\\n [ 2, -2, 1],\\n [ 2, 2, 1],\\n [ 2, 2, -1],\\n [ 2, 2, 0],\\n [ 0, 0, 0]\\n ]\\n\\nexamples.each do |start, stop, step|\\n as = (start..stop).step(step)\\n puts \\\"#{as.inspect} size: #{as.size}\\\"\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst proc: testLoop (in integer: start, in integer: stop, in integer: incr, in string: comment) is func\\n local\\n const integer: limit is 10;\\n var integer: number is 0;\\n var integer: count is 0;\\n begin\\n writeln(comment);\\n write(\\\"Range(\\\" <& start <& \\\", \\\" <& stop <& \\\", \\\" <& incr <& \\\") -> [ \\\");\\n block\\n for number range start to stop step incr do\\n write(number <& \\\" \\\");\\n incr(count);\\n if count >= limit then\\n raise RANGE_ERROR;\\n end if;\\n end for;\\n exception\\n catch RANGE_ERROR: noop;\\n end block;\\n writeln(\\\"]\\\");\\n writeln;\\n end func;\\n\\nconst proc: main is func\\n begin\\n testLoop(-2, 2, 1, \\\"Normal\\\");\\n testLoop(-2, 2, 0, \\\"Zero increment\\\");\\n testLoop(-2, 2, -1, \\\"Increments away from stop value\\\");\\n testLoop(-2, 2, 10, \\\"First increment is beyond stop value\\\");\\n testLoop( 2, -2, 1, \\\"Start more than stop: positive increment\\\");\\n testLoop( 2, 2, 1, \\\"Start equal stop: positive increment\\\");\\n testLoop( 2, 2, -1, \\\"Start equal stop: negative increment\\\");\\n testLoop( 2, 2, 0, \\\"Start equal stop: zero increment\\\");\\n testLoop( 0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\");\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"startExpr to:stopExpr by:incExpr do:[..]\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"MAX_ITER := 15.\\n#(\\n (-2 2 1 'Normal')\\n (-2 2 0 'Zero increment')\\n (-2 2 -1 'Increments away from stop value')\\n (-2 2 10 'First increment is beyond stop value')\\n (2 -2 1 'Start more than stop: positive increment')\\n (2 2 1 'Start equal stop: positive increment')\\n (2 2 -1 'Start equal stop: negative increment')\\n (2 2 0 'Start equal stop: zero increment')\\n (0 0 0 'Start equal stop equal zero: zero increment')\\n) do:[:testParams |\\n |start stop inc info countIter|\\n\\n start := testParams first.\\n stop := testParams second.\\n inc := testParams third.\\n info := testParams fourth.\\n Transcript show:(info paddedTo:50 with:$.).\\n\\n countIter := 0.\\n [:exit |\\n start to:stop by:inc do:[:n |\\n Transcript space; show:n.\\n (countIter := countIter + 1) > MAX_ITER ifTrue:[\\n Transcript show:'...'.\\n exit value\\n ].\\n ].\\n ] valueWithExit.\\n Transcript cr.\\n].\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"struct Seq {\\n start int\\n stop int\\n incr int\\n comment string\\n}\\n\\nconst examples = [\\n Seq{-2, 2, 1, \\\"Normal\\\"},\\n Seq{-2, 2, 0, \\\"Zero increment\\\"},\\n Seq{-2, 2, -1, \\\"Increments away from stop value\\\"},\\n Seq{-2, 2, 10, \\\"First increment is beyond stop value\\\"},\\n Seq{2, -2, 1, \\\"Start more than stop: positive increment\\\"},\\n Seq{2, 2, 1, \\\"Start equal stop: positive increment\\\"},\\n Seq{2, 2, -1, \\\"Start equal stop: negative increment\\\"},\\n Seq{2, 2, 0, \\\"Start equal stop: zero increment\\\"},\\n Seq{0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\"},\\n]\\n\\nfn sequence(s Seq, limit int) []int {\\n mut seq := []int{}\\n for i, c := s.start, 0; i <= s.stop && c < limit; i, c = i+s.incr, c+1 {\\n seq << i\\n }\\n return seq\\n}\\n\\nfn main() {\\n limit := 10\\n for ex in examples {\\n println(ex.comment)\\n print(\\\"Range($ex.start, $ex.stop, $ex.incr) -> \\\")\\n println(sequence(ex, limit))\\n println('')\\n }\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"static void example(int start, int stop, int increment, string comment) {\\n const int MAX_ITER = 9;\\n int iteration = 0;\\n stdout.printf(\\\"%-50s\\\", comment);\\n for (int i = start; i <= stop; i += increment) {\\n stdout.printf(\\\"%3d \\\", i);\\n if (++iteration > MAX_ITER) break;\\n }\\n stdout.printf(\\\"\\\\n\\\");\\n}\\n\\nvoid main () {\\n example(-2, 2, 1, \\\"Normal\\\");\\n example(-2, 2, 0, \\\"Zero increment\\\");\\n example(-2, 2, -1, \\\"Increments away from stop value\\\");\\n example(-2, 2, 10, \\\"First increment is beyond stop value\\\");\\n example(2, -2, 1, \\\"Start more than stop: positive increment\\\");\\n example(2, 2, 1, \\\"Start equals stop: positive increment\\\");\\n example(2, 2, -1, \\\"Start equals stop: negative increment\\\");\\n example(2, 2, 0, \\\"Start equals stop: zero increment\\\");\\n example(0, 0, 0, \\\"Start equals stop equal zero: zero increment\\\");\\n}\\n\",\n \"language\": \"Vala\"\n },\n {\n \"code\": \"Public Sub LoopsWrongRanges()\\n Call Example(-2, 2, 1, \\\"Normal\\\")\\n Call Example(-2, 2, 0, \\\"Zero increment\\\")\\n Call Example(-2, 2, -1, \\\"Increments away from stop value\\\")\\n Call Example(-2, 2, 10, \\\"First increment is beyond stop value\\\")\\n Call Example(2, -2, 1, \\\"Start more than stop: positive increment\\\")\\n Call Example(2, 2, 1, \\\"Start equal stop: positive increment\\\")\\n Call Example(2, 2, -1, \\\"Start equal stop: negative increment\\\")\\n Call Example(2, 2, 0, \\\"Start equal stop: zero increment\\\")\\n Call Example(0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\")\\nEnd Sub\\nPrivate Sub Example(start As Integer, stop_ As Integer, by As Integer, comment As String)\\n Dim i As Integer\\n Dim c As Integer\\n Const limit = 10\\n c = 0\\n Debug.Print start; \\\" \\\"; stop_; \\\" \\\"; by; \\\" | \\\";\\n For i = start To stop_ Step by\\n Debug.Print i & \\\",\\\";\\n c = c + 1\\n If c > limit Then Exit For\\n Next i\\n Debug.Print\\n Debug.Print comment & vbCrLf\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Module Program\\n Sub Main()\\n Example(-2, 2, 1, \\\"Normal\\\")\\n Example(-2, 2, 0, \\\"Zero increment\\\")\\n Example(-2, 2, -1, \\\"Increments away from stop value\\\")\\n Example(-2, 2, 10, \\\"First increment is beyond stop value\\\")\\n Example(2, -2, 1, \\\"Start more than stop: positive increment\\\")\\n Example(2, 2, 1, \\\"Start equal stop: positive increment\\\")\\n Example(2, 2, -1, \\\"Start equal stop: negative increment\\\")\\n Example(2, 2, 0, \\\"Start equal stop: zero increment\\\")\\n Example(0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\")\\n End Sub\\n\\n ' Stop is a keyword and must be escaped using brackets.\\n Iterator Function Range(start As Integer, [stop] As Integer, increment As Integer) As IEnumerable(Of Integer)\\n For i = start To [stop] Step increment\\n Yield i\\n Next\\n End Function\\n\\n Sub Example(start As Integer, [stop] As Integer, increment As Integer, comment As String)\\n ' Add a space, pad to length 50 with hyphens, and add another space.\\n Console.Write((comment & \\\" \\\").PadRight(50, \\\"-\\\"c) & \\\" \\\")\\n\\n Const MAX_ITER = 9\\n\\n Dim iteration = 0\\n ' The For Each loop enumerates the IEnumerable.\\n For Each i In Range(start, [stop], increment)\\n Console.Write(\\\"{0,2} \\\", i)\\n\\n iteration += 1\\n If iteration > MAX_ITER Then Exit For\\n Next\\n\\n Console.WriteLine()\\n End Sub\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar loop = Fn.new { |start, stop, inc|\\n System.write(\\\"%(Fmt.v(\\\"dm\\\", 3, [start, stop, inc], 0, \\\" \\\", \\\"[]\\\")) -> \\\")\\n var count = 0\\n var limit = 10\\n var i = start\\n while (i <= stop) {\\n System.write(\\\"%(i) \\\")\\n count = count + 1\\n if (count == limit) break\\n i = i + inc\\n }\\n System.print()\\n}\\n\\nvar tests = [\\n [-2, 2, 1], [-2, 2, 0], [-2, 2, -1], [-2, 2, 10], [2, -2, 1], [2, 2, 1], [2, 2, -1], [2, 2, 0], [0, 0, 0]\\n]\\nfor (test in tests) loop.call(test[0], test[1], test[2])\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"include xpllib; \\\\for Print\\n\\ndef \\\\S\\\\ Start, Stop, Incr, Comment;\\nint S, Examples, I, J, C, Empty;\\ndef Limit = 10;\\n[Examples:= [\\n [-2, 2, 1, \\\"Normal\\\"],\\n [-2, 2, 0, \\\"Zero increment\\\"],\\n [-2, 2, -1, \\\"Increments away from stop value\\\"],\\n [-2, 2, 10, \\\"First increment is beyond stop value\\\"],\\n [2, -2, 1, \\\"Start more than stop: positive increment\\\"],\\n [2, 2, 1, \\\"Start equal stop: positive increment\\\"],\\n [2, 2, -1, \\\"Start equal stop: negative increment\\\"],\\n [2, 2, 0, \\\"Start equal stop: zero increment\\\"],\\n [0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\"]\\n ];\\nfor I:= 0 to 9-1 do\\n [S:= Examples(I);\\n Print(\\\"%s\\\\n\\\", S(Comment));\\n Print(\\\"Range(%d, %d, %d) -> [\\\", S(Start), S(Stop), S(Incr));\\n Empty:= true;\\n\\\\\\\\ for (j:= s.start, c:= 0; j <= s.stop && c < limit; j += s.incr, ++c)\\n J:= S(Start); C:= 0;\\n while J <= S(Stop) and C < Limit do\\n [Print(\\\"%d \\\", J);\\n Empty:= false;\\n J:= J + S(Incr); C:= C+1;\\n ];\\n if not Empty then ChOut(0, $08 \\\\BS\\\\);\\n Print(\\\"]\\\\n\\\\n\\\");\\n ]\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"data -2,2,1,\\\"Normal\\\",-2,2,0,\\\"Zero increment\\\",-2,2,-1,\\\"Increments away from stop value\\\"\\ndata -2,2,10,\\\"First increment is beyond stop value\\\",2,-2,1,\\\"Start more than stop: positive increment\\\"\\ndata 2,2,1,\\\"Start equal stop: positive increment\\\",2,2,-1,\\\"Start equal stop: negative increment\\\"\\ndata 2,2,0,\\\"Start equal stop: zero increment\\\",0,0,0,\\\"Start equal stop equal zero: zero increment\\\"\\n\\nfor i = 1 to 9\\n contar = 0\\n read start, fin, inc, cmt$\\n print cmt$\\n print \\\" Bucle de \\\", start, \\\" a \\\", fin, \\\" en incrementos de \\\", inc\\n for vr = start to fin step inc\\n print \\\" Indice del bucle = \\\", vr\\n contar = contar + 1\\n if contar = 10 then\\n print \\\" Saliendo de un bucle infinito\\\"\\n break\\n endif\\n next vr\\n print \\\" Bucle terminado\\\\n\\\\n\\\"\\nnext i\\nend\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"const std = @import(\\\"std\\\");\\nconst stdout = @import(\\\"std\\\").io.getStdOut().writer();\\n\\nconst limit = 10;\\n\\nfn printRange(start: isize, stop: isize, step: isize, comment: []const u8) !void {\\n try stdout.print(\\\"{s}\\\\r\\\\x1b[43C: \\\", .{comment});\\n var c: u8 = 0;\\n var n = start;\\n while (n <= stop) : (n += step) {\\n c += 1;\\n if (c > limit) break;\\n try stdout.print(\\\"{d} \\\", .{n});\\n }\\n try stdout.print(\\\"\\\\n\\\", .{});\\n}\\n\\npub fn main() !void {\\n try printRange(-2, 2, 1, \\\"Normal\\\");\\n try printRange(-2, 2, 0, \\\"Zero increment\\\");\\n try printRange(-2, 2, -1, \\\"Increments away from stop value\\\");\\n try printRange(-2, 2, 10, \\\"First increment is beyond stop value\\\");\\n try printRange(2, -2, 1, \\\"Start more than stop: positive increment\\\");\\n try printRange(2, 2, 1, \\\"Start equal stop: positive increment\\\");\\n try printRange(2, 2, -1, \\\"Start equal stop: negative increment\\\");\\n try printRange(2, 2, 0, \\\"Start equal stop: zero increment\\\");\\n try printRange(0, 0, 0, \\\"Start equal stop equal zero: zero increment\\\");\\n}\\n\",\n \"language\": \"Zig\"\n },\n {\n \"code\": \"// zero increment (ie infnite loop) throws an error\\n// if stop is \\\"*\\\", the loop is has no end (ie infinite)\\n// stop is included unless step steps skips it\\n// if start > stop is a dead loop\\n// ranges ([a..b,c]) are lazy lists\\nfcn looper([(start,stop,increment)]){\\n print(\\\" %3s %3s\\\\t%2d --> \\\".fmt(start,stop,increment));\\n try{ foreach n in ([start..stop,increment]){ print(n,\\\" \\\") } }\\n catch{ print(__exception) }\\n println();\\n}\\nprintln(\\\"start stop increment\\\");\\nT( T(-2,2,1),T(-2,2,0),T(-2,2,-1),T(-2,2,10),T( 2,-2,1),\\n T( 2,2,1),T( 2,2,-1),T( 2,2,0),T( 0,0,0),\\n T(0.0, (0.0).pi, 0.7853981633974483), T(\\\"a\\\",\\\"e\\\",1), T(\\\"e\\\",\\\"a\\\",1) )\\n.apply2(looper); // apply2 is apply (map) without saving results\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Loops-Wrong-ranges"}}},{"rowIdx":452,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/LU_decomposition\nnote: Matrices\n","language":"00-META"},{"code":"Every square matrix <math>A</math> can be decomposed into a product of a lower triangular matrix <math>L</math> and a upper triangular matrix <math>U</math>, \nas described in [[wp:LU decomposition|LU decomposition]].\n\n:<math>A = LU</math>\n\nIt is a modified form of Gaussian elimination. \nWhile the [[Cholesky decomposition]] only works for symmetric, \npositive definite matrices, the more general LU decomposition \nworks for any square matrix. \n\nThere are several algorithms for calculating L and U. \nTo derive ''Crout's algorithm'' for a 3x3 example, \nwe have to solve the following system:\n\n:<math>\nA =\n\\begin{pmatrix}\n a_{11} & a_{12} & a_{13}\\\\\n a_{21} & a_{22} & a_{23}\\\\\n a_{31} & a_{32} & a_{33}\\\\\n\\end{pmatrix}\n=\n\\begin{pmatrix}\n l_{11} & 0 & 0 \\\\\n l_{21} & l_{22} & 0 \\\\\n l_{31} & l_{32} & l_{33}\\\\\n\\end{pmatrix}\n\\begin{pmatrix}\n u_{11} & u_{12} & u_{13} \\\\\n 0 & u_{22} & u_{23} \\\\\n 0 & 0 & u_{33}\n\\end{pmatrix}\n= LU\n</math>\n\nWe now would have to solve 9 equations with 12 unknowns. To make the system uniquely solvable, usually the diagonal elements of <math>L</math> are set to 1\n\n:<math>l_{11}=1</math>\n:<math>l_{22}=1</math>\n:<math>l_{33}=1</math>\n\nso we get a solvable system of 9 unknowns and 9 equations.\n\n:<math>\nA =\n\\begin{pmatrix}\n a_{11} & a_{12} & a_{13}\\\\\n a_{21} & a_{22} & a_{23}\\\\\n a_{31} & a_{32} & a_{33}\\\\\n\\end{pmatrix}\n=\n\\begin{pmatrix}\n 1 & 0 & 0 \\\\\n l_{21} & 1 & 0 \\\\\n l_{31} & l_{32} & 1\\\\\n\\end{pmatrix}\n\\begin{pmatrix}\n u_{11} & u_{12} & u_{13} \\\\\n 0 & u_{22} & u_{23} \\\\\n 0 & 0 & u_{33}\n\\end{pmatrix}\n=\n\\begin{pmatrix}\n u_{11} & u_{12} & u_{13} \\\\\n u_{11}l_{21} & u_{12}l_{21}+u_{22} & u_{13}l_{21}+u_{23} \\\\\n u_{11}l_{31} & u_{12}l_{31}+u_{22}l_{32} & u_{13}l_{31} + u_{23}l_{32}+u_{33}\n\\end{pmatrix}\n= LU\n</math>\n\nSolving for the other <math>l</math> and <math>u</math>, we get the following equations:\n\n:<math>u_{11}=a_{11}</math>\n:<math>u_{12}=a_{12}</math>\n:<math>u_{13}=a_{13}</math>\n\n:<math>u_{22}=a_{22} - u_{12}l_{21}</math>\n:<math>u_{23}=a_{23} - u_{13}l_{21}</math>\n\n:<math>u_{33}=a_{33} - (u_{13}l_{31} + u_{23}l_{32})</math>\n\nand for <math>l</math>:\n\n:<math>l_{21}=\\frac{1}{u_{11}} a_{21}</math>\n:<math>l_{31}=\\frac{1}{u_{11}} a_{31}</math>\n\n:<math>l_{32}=\\frac{1}{u_{22}} (a_{32} - u_{12}l_{31})</math>\n\nWe see that there is a calculation pattern, which can be expressed as the following formulas, first for <math>U</math>\n\n:<math>u_{ij} = a_{ij} - \\sum_{k=1}^{i-1} u_{kj}l_{ik}</math>\n\nand then for <math>L</math>\n\n:<math>l_{ij} = \\frac{1}{u_{jj}} (a_{ij} - \\sum_{k=1}^{j-1} u_{kj}l_{ik})</math>\n\nWe see in the second formula that to get the <math>l_{ij}</math> below the diagonal, we have to divide by the diagonal element (pivot) <math>u_{jj}</math>, so we get problems when <math>u_{jj}</math> is either 0 or very small, which leads to numerical instability. \n\nThe solution to this problem is ''pivoting'' <math>A</math>, which means rearranging the rows of <math>A</math>, prior to the <math>LU</math> decomposition, in a way that the largest element of each column gets onto the diagonal of <math>A</math>. Rearranging the rows means to multiply <math>A</math> by a permutation matrix <math>P</math>:\n\n:<math>PA \\Rightarrow A'</math>\n\nExample:\n\n:<math>\n\\begin{pmatrix}\n 0 & 1 \\\\\n 1 & 0 \n\\end{pmatrix}\n\\begin{pmatrix}\n 1 & 4 \\\\\n 2 & 3 \n\\end{pmatrix}\n\\Rightarrow\n\\begin{pmatrix}\n 2 & 3 \\\\\n 1 & 4 \n\\end{pmatrix}\n</math>\n\nThe decomposition algorithm is then applied on the rearranged matrix so that\n\n:<math>PA = LU</math>\n\n\n;Task description:\nThe task is to implement a routine which will take a square nxn matrix <math>A</math> and return a lower triangular matrix <math>L</math>, a upper triangular matrix <math>U</math> and a permutation matrix <math>P</math>, \nso that the above equation is fulfilled. \n\nYou should then test it on the following two examples and include your output.\n\n\n;Example 1:\n<pre>\nA\n\n1 3 5\n2 4 7\n1 1 0\n\nL\n\n1.00000 0.00000 0.00000\n0.50000 1.00000 0.00000\n0.50000 -1.00000 1.00000\n\nU\n\n2.00000 4.00000 7.00000\n0.00000 1.00000 1.50000\n0.00000 0.00000 -2.00000\n\nP\n\n0 1 0\n1 0 0\n0 0 1\n</pre>\n\n;Example 2:\n<pre>\nA\n\n11 9 24 2\n 1 5 2 6\n 3 17 18 1\n 2 5 7 1\n\nL\n\n1.00000 0.00000 0.00000 0.00000\n0.27273 1.00000 0.00000 0.00000\n0.09091 0.28750 1.00000 0.00000\n0.18182 0.23125 0.00360 1.00000\n\nU\n\n11.00000 9.00000 24.00000 2.00000\n 0.00000 14.54545 11.45455 0.45455\n 0.00000 0.00000 -3.47500 5.68750\n 0.00000 0.00000 0.00000 0.51079\n\nP\n\n1 0 0 0\n0 0 1 0\n0 1 0 0\n0 0 0 1\n</pre>\n<br><br>\n\n","language":"00-TASK"},{"code":"F pprint(m)\n L(row) m\n print(row)\n\nF matrix_mul(a, b)\n V result = [[0.0] * a.len] * a.len\n L(j) 0 .< a.len\n L(i) 0 .< a.len\n V r = 0.0\n L(k) 0 .< a.len\n r += a[i][k] * b[k][j]\n result[i][j] = r\n R result\n\nF pivotize(m)\n ‘Creates the pivoting matrix for m.’\n V n = m.len\n V ID = (0 .< n).map(j -> (0 .< @n).map(i -> Float(i == @j)))\n L(j) 0 .< n\n V row = max(j .< n, key' i -> abs(@m[i][@j]))\n I j != row\n swap(&ID[j], &ID[row])\n R ID\n\nF lu(A)\n ‘Decomposes a nxn matrix A by PA=lU and returns l, U and P.’\n V n = A.len\n V l = [[0.0] * n] * n\n V U = [[0.0] * n] * n\n V P = pivotize(A)\n V A2 = matrix_mul(P, A)\n L(j) 0 .< n\n l[j][j] = 1.0\n L(i) 0 .. j\n V s1 = sum((0 .< i).map(k -> @U[k][@j] * @l[@i][k]))\n U[i][j] = A2[i][j] - s1\n L(i) j .< n\n V s2 = sum((0 .< j).map(k -> @U[k][@j] * @l[@i][k]))\n l[i][j] = (A2[i][j] - s2) / U[j][j]\n R (l, U, P)\n\nV a = [[1, 3, 5], [2, 4, 7], [1, 1, 0]]\nL(part) lu(a)\n pprint(part)\n print()\nprint()\nV b = [[11, 9, 24, 2], [1, 5, 2, 6], [3, 17, 18, 1], [2, 5, 7, 1]]\nL(part) lu(b)\n pprint(part)\n print()\n","language":"11l"},{"code":"with Ada.Numerics.Generic_Real_Arrays;\ngeneric\n with package Matrix is new Ada.Numerics.Generic_Real_Arrays (<>);\npackage Decomposition is\n\n -- decompose a square matrix A by PA = LU\n procedure Decompose (A : Matrix.Real_Matrix; P, L, U : out Matrix.Real_Matrix);\n\nend Decomposition;\n","language":"Ada"},{"code":"package body Decomposition is\n\n procedure Swap_Rows (M : in out Matrix.Real_Matrix; From, To : Natural) is\n Temporary : Matrix.Real;\n begin\n if From = To then\n return;\n end if;\n for I in M'Range (2) loop\n Temporary := M (M'First (1) + From, I);\n M (M'First (1) + From, I) := M (M'First (1) + To, I);\n M (M'First (1) + To, I) := Temporary;\n end loop;\n end Swap_Rows;\n\n function Pivoting_Matrix\n (M : Matrix.Real_Matrix)\n return Matrix.Real_Matrix\n is\n use type Matrix.Real;\n Order : constant Positive := M'Length (1);\n Result : Matrix.Real_Matrix := Matrix.Unit_Matrix (Order);\n Max : Matrix.Real;\n Row : Natural;\n begin\n for J in 0 .. Order - 1 loop\n Max := M (M'First (1) + J, M'First (2) + J);\n Row := J;\n for I in J .. Order - 1 loop\n if M (M'First (1) + I, M'First (2) + J) > Max then\n Max := M (M'First (1) + I, M'First (2) + J);\n Row := I;\n end if;\n end loop;\n if J /= Row then\n -- swap rows J and Row\n Swap_Rows (Result, J, Row);\n end if;\n end loop;\n return Result;\n end Pivoting_Matrix;\n\n procedure Decompose (A : Matrix.Real_Matrix; P, L, U : out Matrix.Real_Matrix) is\n use type Matrix.Real_Matrix, Matrix.Real;\n Order : constant Positive := A'Length (1);\n A2 : Matrix.Real_Matrix (A'Range (1), A'Range (2));\n S : Matrix.Real;\n begin\n L := (others => (others => 0.0));\n U := (others => (others => 0.0));\n P := Pivoting_Matrix (A);\n A2 := P * A;\n for J in 0 .. Order - 1 loop\n L (L'First (1) + J, L'First (2) + J) := 1.0;\n for I in 0 .. J loop\n S := 0.0;\n for K in 0 .. I - 1 loop\n S := S + U (U'First (1) + K, U'First (2) + J) *\n L (L'First (1) + I, L'First (2) + K);\n end loop;\n U (U'First (1) + I, U'First (2) + J) :=\n A2 (A2'First (1) + I, A2'First (2) + J) - S;\n end loop;\n for I in J + 1 .. Order - 1 loop\n S := 0.0;\n for K in 0 .. J loop\n S := S + U (U'First (1) + K, U'First (2) + J) *\n L (L'First (1) + I, L'First (2) + K);\n end loop;\n L (L'First (1) + I, L'First (2) + J) :=\n (A2 (A2'First (1) + I, A2'First (2) + J) - S) /\n U (U'First (1) + J, U'First (2) + J);\n end loop;\n end loop;\n end Decompose;\n\nend Decomposition;\n","language":"Ada"},{"code":"with Ada.Numerics.Real_Arrays;\nwith Ada.Text_IO;\nwith Decomposition;\nprocedure Decompose_Example is\n package Real_Decomposition is new Decomposition\n (Matrix => Ada.Numerics.Real_Arrays);\n\n package Real_IO is new Ada.Text_IO.Float_IO (Float);\n\n procedure Print (M : Ada.Numerics.Real_Arrays.Real_Matrix) is\n begin\n for Row in M'Range (1) loop\n for Col in M'Range (2) loop\n Real_IO.Put (M (Row, Col), 3, 2, 0);\n end loop;\n Ada.Text_IO.New_Line;\n end loop;\n end Print;\n\n Example_1 : constant Ada.Numerics.Real_Arrays.Real_Matrix :=\n ((1.0, 3.0, 5.0),\n (2.0, 4.0, 7.0),\n (1.0, 1.0, 0.0));\n P_1, L_1, U_1 : Ada.Numerics.Real_Arrays.Real_Matrix (Example_1'Range (1),\n Example_1'Range (2));\n Example_2 : constant Ada.Numerics.Real_Arrays.Real_Matrix :=\n ((11.0, 9.0, 24.0, 2.0),\n (1.0, 5.0, 2.0, 6.0),\n (3.0, 17.0, 18.0, 1.0),\n (2.0, 5.0, 7.0, 1.0));\n P_2, L_2, U_2 : Ada.Numerics.Real_Arrays.Real_Matrix (Example_2'Range (1),\n Example_2'Range (2));\nbegin\n Real_Decomposition.Decompose (A => Example_1,\n P => P_1,\n L => L_1,\n U => U_1);\n Real_Decomposition.Decompose (A => Example_2,\n P => P_2,\n L => L_2,\n U => U_2);\n Ada.Text_IO.Put_Line (\"Example 1:\");\n Ada.Text_IO.Put_Line (\"A:\"); Print (Example_1);\n Ada.Text_IO.Put_Line (\"L:\"); Print (L_1);\n Ada.Text_IO.Put_Line (\"U:\"); Print (U_1);\n Ada.Text_IO.Put_Line (\"P:\"); Print (P_1);\n Ada.Text_IO.New_Line;\n Ada.Text_IO.Put_Line (\"Example 2:\");\n Ada.Text_IO.Put_Line (\"A:\"); Print (Example_2);\n Ada.Text_IO.Put_Line (\"L:\"); Print (L_2);\n Ada.Text_IO.Put_Line (\"U:\"); Print (U_2);\n Ada.Text_IO.Put_Line (\"P:\"); Print (P_2);\nend Decompose_Example;\n","language":"Ada"},{"code":"(* There is a \"little matrix library\" included below. Not all of it is\n used, though unused parts may prove useful for playing with the\n code.\n\n One might, by the way, find interesting how I get the P matrix from\n a permutation vector. *)\n\n%{^\n#include <math.h>\n#include <float.h>\n%}\n\n#include \"share/atspre_staload.hats\"\n\nmacdef NAN = g0f2f ($extval (float, \"NAN\"))\nmacdef Zero = g0i2f 0\nmacdef One = g0i2f 1\n\n(* You can substitute an \"fma\" function for this definition: *)\nmacdef multiply_and_add (x, y, z) = (,(x) * ,(y)) + ,(z)\n\nexception Exc_degenerate_problem of string\n\n(*------------------------------------------------------------------*)\n(* A \"little matrix library\" *)\n\ntypedef Matrix_Index_Map (m1 : int, n1 : int, m0 : int, n0 : int) =\n {i1, j1 : pos | i1 <= m1; j1 <= n1}\n (int i1, int j1) -<cloref0>\n [i0, j0 : pos | i0 <= m0; j0 <= n0]\n @(int i0, int j0)\n\ndatatype Real_Matrix (tk : tkind,\n m1 : int, n1 : int,\n m0 : int, n0 : int) =\n| Real_Matrix of (matrixref (g0float tk, m0, n0),\n int m1, int n1, int m0, int n0,\n Matrix_Index_Map (m1, n1, m0, n0))\ntypedef Real_Matrix (tk : tkind, m1 : int, n1 : int) =\n [m0, n0 : pos] Real_Matrix (tk, m1, n1, m0, n0)\ntypedef Real_Vector (tk : tkind, m1 : int, n1 : int) =\n [m1 == 1 || n1 == 1] Real_Matrix (tk, m1, n1)\ntypedef Real_Row (tk : tkind, n1 : int) = Real_Vector (tk, 1, n1)\ntypedef Real_Column (tk : tkind, m1 : int) = Real_Vector (tk, m1, 1)\n\nextern fn {tk : tkind}\nReal_Matrix_make_elt :\n {m0, n0 : pos}\n (int m0, int n0, g0float tk) -< !wrt >\n Real_Matrix (tk, m0, n0, m0, n0)\n\nextern fn {tk : tkind}\nReal_Matrix_copy :\n {m1, n1 : pos}\n Real_Matrix (tk, m1, n1) -< !refwrt > Real_Matrix (tk, m1, n1)\n\nextern fn {tk : tkind}\nReal_Matrix_copy_to :\n {m1, n1 : pos}\n (Real_Matrix (tk, m1, n1), (* destination *)\n Real_Matrix (tk, m1, n1)) -< !refwrt >\n void\n\nextern fn {tk : tkind}\nReal_Matrix_fill_with_elt :\n {m1, n1 : pos}\n (Real_Matrix (tk, m1, n1), g0float tk) -< !refwrt > void\n\nextern fn {}\nReal_Matrix_dimension :\n {tk : tkind}\n {m1, n1 : pos}\n Real_Matrix (tk, m1, n1) -<> @(int m1, int n1)\n\nextern fn {tk : tkind}\nReal_Matrix_get_at :\n {m1, n1 : pos}\n {i1, j1 : pos | i1 <= m1; j1 <= n1}\n (Real_Matrix (tk, m1, n1), int i1, int j1) -< !ref > g0float tk\n\nextern fn {tk : tkind}\nReal_Matrix_set_at :\n {m1, n1 : pos}\n {i1, j1 : pos | i1 <= m1; j1 <= n1}\n (Real_Matrix (tk, m1, n1), int i1, int j1, g0float tk) -< !refwrt >\n void\n\nextern fn {}\nReal_Matrix_apply_index_map :\n {tk : tkind}\n {m1, n1 : pos}\n {m0, n0 : pos}\n (Real_Matrix (tk, m0, n0), int m1, int n1,\n Matrix_Index_Map (m1, n1, m0, n0)) -<>\n Real_Matrix (tk, m1, n1)\n\nextern fn {}\nReal_Matrix_transpose :\n (* This is transposed INDEXING. It does NOT copy the data. *)\n {tk : tkind}\n {m1, n1 : pos}\n {m0, n0 : pos}\n Real_Matrix (tk, m1, n1, m0, n0) -<>\n Real_Matrix (tk, n1, m1, m0, n0)\n\nextern fn {}\nReal_Matrix_block :\n (* This is block (submatrix) INDEXING. It does NOT copy the data. *)\n {tk : tkind}\n {p0, p1 : pos | p0 <= p1}\n {q0, q1 : pos | q0 <= q1}\n {m1, n1 : pos | p1 <= m1; q1 <= n1}\n {m0, n0 : pos}\n (Real_Matrix (tk, m1, n1, m0, n0),\n int p0, int p1, int q0, int q1) -<>\n Real_Matrix (tk, p1 - p0 + 1, q1 - q0 + 1, m0, n0)\n\nextern fn {tk : tkind}\nReal_Matrix_unit_matrix :\n {m : pos}\n int m -< !refwrt > Real_Matrix (tk, m, m)\n\nextern fn {tk : tkind}\nReal_Matrix_unit_matrix_to :\n {m : pos}\n Real_Matrix (tk, m, m) -< !refwrt > void\n\nextern fn {tk : tkind}\nReal_Matrix_matrix_sum :\n {m, n : pos}\n (Real_Matrix (tk, m, n), Real_Matrix (tk, m, n)) -< !refwrt >\n Real_Matrix (tk, m, n)\n\nextern fn {tk : tkind}\nReal_Matrix_matrix_sum_to :\n {m, n : pos}\n (Real_Matrix (tk, m, n), (* destination*)\n Real_Matrix (tk, m, n),\n Real_Matrix (tk, m, n)) -< !refwrt >\n void\n\nextern fn {tk : tkind}\nReal_Matrix_matrix_difference :\n {m, n : pos}\n (Real_Matrix (tk, m, n), Real_Matrix (tk, m, n)) -< !refwrt >\n Real_Matrix (tk, m, n)\n\nextern fn {tk : tkind}\nReal_Matrix_matrix_difference_to :\n {m, n : pos}\n (Real_Matrix (tk, m, n), (* destination*)\n Real_Matrix (tk, m, n),\n Real_Matrix (tk, m, n)) -< !refwrt >\n void\n\nextern fn {tk : tkind}\nReal_Matrix_matrix_product :\n {m, n, p : pos}\n (Real_Matrix (tk, m, n), Real_Matrix (tk, n, p)) -< !refwrt >\n Real_Matrix (tk, m, p)\n\nextern fn {tk : tkind}\nReal_Matrix_matrix_product_to :\n (* For the matrix product, the destination should not be the same as\n either of the other matrices. *)\n {m, n, p : pos}\n (Real_Matrix (tk, m, p), (* destination*)\n Real_Matrix (tk, m, n),\n Real_Matrix (tk, n, p)) -< !refwrt >\n void\n\nextern fn {tk : tkind}\nReal_Matrix_scalar_product :\n {m, n : pos}\n (Real_Matrix (tk, m, n), g0float tk) -< !refwrt >\n Real_Matrix (tk, m, n)\n\nextern fn {tk : tkind}\nReal_Matrix_scalar_product_2 :\n {m, n : pos}\n (g0float tk, Real_Matrix (tk, m, n)) -< !refwrt >\n Real_Matrix (tk, m, n)\n\nextern fn {tk : tkind}\nReal_Matrix_scalar_product :\n {m, n : pos}\n (Real_Matrix (tk, m, n), g0float tk) -< !refwrt >\n Real_Matrix (tk, m, n)\n\nextern fn {tk : tkind}\nReal_Matrix_scalar_product_2 :\n {m, n : pos}\n (g0float tk, Real_Matrix (tk, m, n)) -< !refwrt >\n Real_Matrix (tk, m, n)\n\nextern fn {tk : tkind}\nReal_Matrix_scalar_product_to :\n {m, n : pos}\n (Real_Matrix (tk, m, n), (* destination*)\n Real_Matrix (tk, m, n),\n g0float tk) -< !refwrt >\n void\n\nextern fn {tk : tkind} (* Useful for debugging. *)\nReal_Matrix_fprint :\n {m, n : pos}\n (FILEref, Real_Matrix (tk, m, n)) -<1> void\n\noverload copy with Real_Matrix_copy\noverload copy_to with Real_Matrix_copy_to\noverload fill_with_elt with Real_Matrix_fill_with_elt\noverload dimension with Real_Matrix_dimension\noverload [] with Real_Matrix_get_at\noverload [] with Real_Matrix_set_at\noverload apply_index_map with Real_Matrix_apply_index_map\noverload transpose with Real_Matrix_transpose\noverload block with Real_Matrix_block\noverload unit_matrix with Real_Matrix_unit_matrix\noverload unit_matrix_to with Real_Matrix_unit_matrix_to\noverload matrix_sum with Real_Matrix_matrix_sum\noverload matrix_sum_to with Real_Matrix_matrix_sum_to\noverload matrix_difference with Real_Matrix_matrix_difference\noverload matrix_difference_to with Real_Matrix_matrix_difference_to\noverload matrix_product with Real_Matrix_matrix_product\noverload matrix_product_to with Real_Matrix_matrix_product_to\noverload scalar_product with Real_Matrix_scalar_product\noverload scalar_product with Real_Matrix_scalar_product_2\noverload scalar_product_to with Real_Matrix_scalar_product_to\noverload + with matrix_sum\noverload - with matrix_difference\noverload * with matrix_product\noverload * with scalar_product\n\n(*------------------------------------------------------------------*)\n(* Implementation of the \"little matrix library\" *)\n\nimplement {tk}\nReal_Matrix_make_elt (m0, n0, elt) =\n Real_Matrix (matrixref_make_elt<g0float tk> (i2sz m0, i2sz n0, elt),\n m0, n0, m0, n0, lam (i1, j1) => @(i1, j1))\n\nimplement {}\nReal_Matrix_dimension A =\n case+ A of Real_Matrix (_, m1, n1, _, _, _) => @(m1, n1)\n\nimplement {tk}\nReal_Matrix_get_at (A, i1, j1) =\n let\n val+ Real_Matrix (storage, _, _, _, n0, index_map) = A\n val @(i0, j0) = index_map (i1, j1)\n in\n matrixref_get_at<g0float tk> (storage, pred i0, n0, pred j0)\n end\n\nimplement {tk}\nReal_Matrix_set_at (A, i1, j1, x) =\n let\n val+ Real_Matrix (storage, _, _, _, n0, index_map) = A\n val @(i0, j0) = index_map (i1, j1)\n in\n matrixref_set_at<g0float tk> (storage, pred i0, n0, pred j0, x)\n end\n\nimplement {}\nReal_Matrix_apply_index_map (A, m1, n1, index_map) =\n (* This is not the most efficient way to acquire new indexing, but\n it will work. It requires three closures, instead of the two\n needed by our implementations of \"transpose\" and \"block\". *)\n let\n val+ Real_Matrix (storage, m1a, n1a, m0, n0, index_map_1a) = A\n in\n Real_Matrix (storage, m1, n1, m0, n0,\n lam (i1, j1) =>\n index_map_1a (i1a, j1a) where\n { val @(i1a, j1a) = index_map (i1, j1) })\n end\n\nimplement {}\nReal_Matrix_transpose A =\n let\n val+ Real_Matrix (storage, m1, n1, m0, n0, index_map) = A\n in\n Real_Matrix (storage, n1, m1, m0, n0,\n lam (i1, j1) => index_map (j1, i1))\n end\n\nimplement {}\nReal_Matrix_block (A, p0, p1, q0, q1) =\n let\n val+ Real_Matrix (storage, m1, n1, m0, n0, index_map) = A\n in\n Real_Matrix (storage, succ (p1 - p0), succ (q1 - q0), m0, n0,\n lam (i1, j1) =>\n index_map (p0 + pred i1, q0 + pred j1))\n end\n\nimplement {tk}\nReal_Matrix_copy A =\n let\n val @(m1, n1) = dimension A\n val C = Real_Matrix_make_elt<tk> (m1, n1, A[1, 1])\n val () = copy_to<tk> (C, A)\n in\n C\n end\n\nimplement {tk}\nReal_Matrix_copy_to (Dst, Src) =\n let\n val @(m1, n1) = dimension Src\n prval [m1 : int] EQINT () = eqint_make_gint m1\n prval [n1 : int] EQINT () = eqint_make_gint n1\n\n var i : intGte 1\n in\n for* {i : pos | i <= m1 + 1} .<(m1 + 1) - i>.\n (i : int i) =>\n (i := 1; i <> succ m1; i := succ i)\n let\n var j : intGte 1\n in\n for* {j : pos | j <= n1 + 1} .<(n1 + 1) - j>.\n (j : int j) =>\n (j := 1; j <> succ n1; j := succ j)\n Dst[i, j] := Src[i, j]\n end\n end\n\nimplement {tk}\nReal_Matrix_fill_with_elt (A, elt) =\n let\n val @(m1, n1) = dimension A\n prval [m1 : int] EQINT () = eqint_make_gint m1\n prval [n1 : int] EQINT () = eqint_make_gint n1\n\n var i : intGte 1\n in\n for* {i : pos | i <= m1 + 1} .<(m1 + 1) - i>.\n (i : int i) =>\n (i := 1; i <> succ m1; i := succ i)\n let\n var j : intGte 1\n in\n for* {j : pos | j <= n1 + 1} .<(n1 + 1) - j>.\n (j : int j) =>\n (j := 1; j <> succ n1; j := succ j)\n A[i, j] := elt\n end\n end\n\nimplement {tk}\nReal_Matrix_unit_matrix {m} m =\n let\n val A = Real_Matrix_make_elt<tk> (m, m, Zero)\n var i : intGte 1\n in\n for* {i : pos | i <= m + 1} .<(m + 1) - i>.\n (i : int i) =>\n (i := 1; i <> succ m; i := succ i)\n A[i, i] := One;\n A\n end\n\nimplement {tk}\nReal_Matrix_unit_matrix_to A =\n let\n val @(m, _) = dimension A\n prval [m : int] EQINT () = eqint_make_gint m\n\n var i : intGte 1\n in\n for* {i : pos | i <= m + 1} .<(m + 1) - i>.\n (i : int i) =>\n (i := 1; i <> succ m; i := succ i)\n let\n var j : intGte 1\n in\n for* {j : pos | j <= m + 1} .<(m + 1) - j>.\n (j : int j) =>\n (j := 1; j <> succ m; j := succ j)\n A[i, j] := (if i = j then One else Zero)\n end\n end\n\nimplement {tk}\nReal_Matrix_matrix_sum (A, B) =\n let\n val @(m, n) = dimension A\n val C = Real_Matrix_make_elt<tk> (m, n, NAN)\n val () = matrix_sum_to<tk> (C, A, B)\n in\n C\n end\n\nimplement {tk}\nReal_Matrix_matrix_sum_to (C, A, B) =\n let\n val @(m, n) = dimension A\n prval [m : int] EQINT () = eqint_make_gint m\n prval [n : int] EQINT () = eqint_make_gint n\n\n var i : intGte 1\n in\n for* {i : pos | i <= m + 1} .<(m + 1) - i>.\n (i : int i) =>\n (i := 1; i <> succ m; i := succ i)\n let\n var j : intGte 1\n in\n for* {j : pos | j <= n + 1} .<(n + 1) - j>.\n (j : int j) =>\n (j := 1; j <> succ n; j := succ j)\n C[i, j] := A[i, j] + B[i, j]\n end\n end\n\nimplement {tk}\nReal_Matrix_matrix_difference (A, B) =\n let\n val @(m, n) = dimension A\n val C = Real_Matrix_make_elt<tk> (m, n, NAN)\n val () = matrix_difference_to<tk> (C, A, B)\n in\n C\n end\n\nimplement {tk}\nReal_Matrix_matrix_difference_to (C, A, B) =\n let\n val @(m, n) = dimension A\n prval [m : int] EQINT () = eqint_make_gint m\n prval [n : int] EQINT () = eqint_make_gint n\n\n var i : intGte 1\n in\n for* {i : pos | i <= m + 1} .<(m + 1) - i>.\n (i : int i) =>\n (i := 1; i <> succ m; i := succ i)\n let\n var j : intGte 1\n in\n for* {j : pos | j <= n + 1} .<(n + 1) - j>.\n (j : int j) =>\n (j := 1; j <> succ n; j := succ j)\n C[i, j] := A[i, j] - B[i, j]\n end\n end\n\nimplement {tk}\nReal_Matrix_matrix_product (A, B) =\n let\n val @(m, n) = dimension A and @(_, p) = dimension B\n val C = Real_Matrix_make_elt<tk> (m, p, NAN)\n val () = matrix_product_to<tk> (C, A, B)\n in\n C\n end\n\nimplement {tk}\nReal_Matrix_matrix_product_to (C, A, B) =\n let\n val @(m, n) = dimension A and @(_, p) = dimension B\n prval [m : int] EQINT () = eqint_make_gint m\n prval [n : int] EQINT () = eqint_make_gint n\n prval [p : int] EQINT () = eqint_make_gint p\n\n var i : intGte 1\n in\n for* {i : pos | i <= m + 1} .<(m + 1) - i>.\n (i : int i) =>\n (i := 1; i <> succ m; i := succ i)\n let\n var k : intGte 1\n in\n for* {k : pos | k <= p + 1} .<(p + 1) - k>.\n (k : int k) =>\n (k := 1; k <> succ p; k := succ k)\n let\n var j : intGte 1\n in\n C[i, k] := A[i, 1] * B[1, k];\n for* {j : pos | j <= n + 1} .<(n + 1) - j>.\n (j : int j) =>\n (j := 2; j <> succ n; j := succ j)\n C[i, k] :=\n multiply_and_add (A[i, j], B[j, k], C[i, k])\n end\n end\n end\n\nimplement {tk}\nReal_Matrix_scalar_product (A, r) =\n let\n val @(m, n) = dimension A\n val C = Real_Matrix_make_elt<tk> (m, n, NAN)\n val () = scalar_product_to<tk> (C, A, r)\n in\n C\n end\n\nimplement {tk}\nReal_Matrix_scalar_product_2 (r, A) =\n Real_Matrix_scalar_product<tk> (A, r)\n\nimplement {tk}\nReal_Matrix_scalar_product_to (C, A, r) =\n let\n val @(m, n) = dimension A\n prval [m : int] EQINT () = eqint_make_gint m\n prval [n : int] EQINT () = eqint_make_gint n\n\n var i : intGte 1\n in\n for* {i : pos | i <= m + 1} .<(m + 1) - i>.\n (i : int i) =>\n (i := 1; i <> succ m; i := succ i)\n let\n var j : intGte 1\n in\n for* {j : pos | j <= n + 1} .<(n + 1) - j>.\n (j : int j) =>\n (j := 1; j <> succ n; j := succ j)\n C[i, j] := A[i, j] * r\n end\n end\n\nimplement {tk}\nReal_Matrix_fprint {m, n} (outf, A) =\n let\n val @(m, n) = dimension A\n var i : intGte 1\n in\n for* {i : pos | i <= m + 1} .<(m + 1) - i>.\n (i : int i) =>\n (i := 1; i <> succ m; i := succ i)\n let\n var j : intGte 1\n in\n for* {j : pos | j <= n + 1} .<(n + 1) - j>.\n (j : int j) =>\n (j := 1; j <> succ n; j := succ j)\n let\n typedef FILEstar = $extype\"FILE *\"\n extern castfn FILEref2star : FILEref -<> FILEstar\n val _ = $extfcall (int, \"fprintf\", FILEref2star outf,\n \"%12.6lf\", A[i, j])\n in\n end;\n fprintln! (outf)\n end\n end\n\n(*------------------------------------------------------------------*)\n(* LUP decomposition. Based on\n https://en.wikipedia.org/w/index.php?title=LU_decomposition&oldid=1146366204#C_code_example\n *)\n\nextern fn {tk : tkind}\nReal_Matrix_LUP_decomposition :\n {n : pos}\n (Real_Matrix (tk, n, n),\n g0float tk (* tolerance *) ) -< !exnrefwrt >\n @(Real_Matrix (tk, n, n),\n Real_Matrix (tk, n, n),\n Real_Matrix (tk, n, n))\n\noverload LUP_decomposition with Real_Matrix_LUP_decomposition\n\nimplement {tk}\nReal_Matrix_LUP_decomposition {n} (A, tol) =\n let\n val @(n, _) = dimension A\n typedef one_to_n = intBtwe (1, n)\n\n (* The initial permutation is [1,2,3,...,n]. *)\n implement\n array_tabulate$fopr<one_to_n> i =\n let\n val i = g1ofg0 (sz2i (succ i))\n val () = assertloc ((1 <= i) * (i <= n))\n in\n i\n end\n val permutation =\n $effmask_all arrayref_tabulate<one_to_n> (i2sz n)\n fn\n index_map : Matrix_Index_Map (n, n, n, n) =\n lam (i1, j1) => $effmask_ref\n (@(i0, j1) where { val i0 = permutation[i1 - 1] })\n\n val A = apply_index_map (copy<tk> A, n, n, index_map)\n\n fun\n select_pivot {i, k : pos | i <= k; k <= n + 1}\n .<(n + 1) - k>.\n (i : int i,\n k : int k,\n max_abs : g0float tk,\n k_max_abs : intBtwe (i, n))\n :<!ref> @(g0float tk, intBtwe (i, n)) =\n if k = succ n then\n @(max_abs, k_max_abs)\n else\n let\n val absval = A[k, i]\n in\n if absval > max_abs then\n select_pivot (i, succ k, absval, k)\n else\n select_pivot (i, succ k, max_abs, k_max_abs)\n end\n\n fn {}\n exchange_rows (i1 : one_to_n,\n i2 : one_to_n) :<!refwrt> void =\n if i1 <> i2 then\n let\n val k1 = permutation[pred i1]\n and k2 = permutation[pred i2]\n in\n permutation[pred i1] := k2;\n permutation[pred i2] := k1\n end\n\n val () =\n let\n var i : Int\n in\n for* {i : pos | i <= n + 1} .<(n + 1) - i>.\n (i : int i) =>\n (i := 1; i <> succ n; i := succ i)\n let\n val @(maxabs, i_pivot) = select_pivot (i, i, Zero, i)\n prval [i_pivot : int] EQINT () = eqint_make_gint i_pivot\n var j : Int\n in\n if maxabs < tol then\n $raise Exc_degenerate_problem\n (\"Real_Matrix_LUP_decomposition\");\n exchange_rows (i_pivot, i);\n for* {j : int | i + 1 <= j; j <= n + 1}\n .<(n + 1) - j>.\n (j : int j) =>\n (j := succ i; j <> succ n; j := succ j)\n let\n var k : Int\n in\n A[j, i] := A[j, i] / A[i, i];\n for* {k : int | i + 1 <= k; k <= n + 1}\n .<(n + 1) - k>.\n (k : int k) =>\n (k := succ i; k <> succ n; k := succ k)\n A[j, k] :=\n multiply_and_add\n (~A[j, i], A[i, k], A[j, k])\n end\n end\n end\n\n val U = A\n val L = Real_Matrix_unit_matrix<tk> n\n val () =\n let\n var i : Int\n in\n for* {i : int | 2 <= i; i <= n + 1} .<(n + 1) - i>.\n (i : int i) =>\n (i := 2; i <> succ n; i := succ i)\n let\n var j : Int\n in\n for* {j : pos | j <= i} .<i - j>.\n (j : int j) =>\n (j := 1; j <> i; j := succ j)\n begin\n L[i, j] := U[i, j];\n U[i, j] := Zero\n end\n end\n end\n val P = apply_index_map (Real_Matrix_unit_matrix<tk> n,\n n, n, index_map)\n in\n @(L, U, P)\n end\n\n(*------------------------------------------------------------------*)\n\nimplement\nmain0 () =\n (* I use tolerances of zero, secure in the knowledge that IEEE\n floating point will not crash the program just because a matrix\n was singular. :) *)\n let\n val A = Real_Matrix_make_elt<dblknd> (3, 3, NAN)\n val () =\n (A[1, 1] := 1.0; A[1, 2] := 3.0; A[1, 3] := 5.0;\n A[2, 1] := 2.0; A[2, 2] := 4.0; A[2, 3] := 7.0;\n A[3, 1] := 1.0; A[3, 2] := 1.0; A[3, 3] := 0.0)\n val @(L, U, P) = LUP_decomposition (A, 0.0)\n val () = println! \"A\"\n val () = Real_Matrix_fprint (stdout_ref, A)\n val () = println! \"L\"\n val () = Real_Matrix_fprint (stdout_ref, L)\n val () = println! \"U\"\n val () = Real_Matrix_fprint (stdout_ref, U)\n val () = println! \"P\"\n val () = Real_Matrix_fprint (stdout_ref, P)\n val () = println! \"PA - LU\"\n val () = Real_Matrix_fprint (stdout_ref, P * A - L * U)\n\n val () = println! \"\\n------------------------------------------\\n\"\n\n val A = Real_Matrix_make_elt<dblknd> (4, 4, NAN)\n val () =\n (A[1, 1] := 11.0; A[1, 2] := 9.0; A[1, 3] := 24.0; A[1, 4] := 2.0;\n A[2, 1] := 1.0; A[2, 2] := 5.0; A[2, 3] := 2.0; A[2, 4] := 6.0;\n A[3, 1] := 3.0; A[3, 2] := 17.0; A[3, 3] := 18.0; A[3, 4] := 1.0;\n A[4, 1] := 2.0; A[4, 2] := 5.0; A[4, 3] := 7.0; A[4, 4] := 1.0)\n val @(L, U, P) = LUP_decomposition (A, 0.0)\n val () = println! \"A\"\n val () = Real_Matrix_fprint (stdout_ref, A)\n val () = println! \"L\"\n val () = Real_Matrix_fprint (stdout_ref, L)\n val () = println! \"U\"\n val () = Real_Matrix_fprint (stdout_ref, U)\n val () = println! \"P\"\n val () = Real_Matrix_fprint (stdout_ref, P)\n val () = println! \"PA - LU\"\n val () = Real_Matrix_fprint (stdout_ref, P * A - L * U)\n\n val () = println! \"\\n------------------------------------------\\n\"\n\n val () = println! (\"I have added an example having an asymmetric\",\n \" permutation\\nmatrix, \",\n \"because I needed one for testing:\")\n val () = println! ()\n\n val A = Real_Matrix_make_elt<dblknd> (4, 4, NAN)\n val () =\n (A[1, 1] := 11.0; A[1, 2] := 9.0; A[1, 3] := 24.0; A[1, 4] := 2.0;\n A[2, 1] := 1.0; A[2, 2] := 5.0; A[2, 3] := 2.0; A[2, 4] := 6.0;\n A[3, 1] := 3.0; A[3, 2] := 175.0; A[3, 3] := 18.0; A[3, 4] := 1.0;\n A[4, 1] := 2.0; A[4, 2] := 5.0; A[4, 3] := 7.0; A[4, 4] := 1.0)\n val @(L, U, P) = LUP_decomposition (A, 0.0)\n val () = println! \"A\"\n val () = Real_Matrix_fprint (stdout_ref, A)\n val () = println! \"L\"\n val () = Real_Matrix_fprint (stdout_ref, L)\n val () = println! \"U\"\n val () = Real_Matrix_fprint (stdout_ref, U)\n val () = println! \"P\"\n val () = Real_Matrix_fprint (stdout_ref, P)\n val () = println! \"PA - LU\"\n val () = Real_Matrix_fprint (stdout_ref, P * A - L * U)\n in\n end\n\n(*------------------------------------------------------------------*)\n","language":"ATS"},{"code":";--------------------------\nLU_decomposition(A){\n P := Pivot(A)\n A_ := Multiply_Matrix(P, A)\n\n U := [], L := [], n := A_.Count()\n loop % n {\n i := A_Index\n loop % n {\n j := A_Index\n\n Sigma := 0, k := 1\n while (k <= i-1)\n Sigma += (U[k, j] * L[i, k]), k++\n U[i, j] := A_[i, j] - Sigma\n\n Sigma := 0, k := 1\n while (k <= j-1)\n Sigma += (U[k, j] * L[i, k]), k++\n L[i, j] := (A_[i, j] - Sigma) / U[j, j]\n }\n }\n return [L, U, P]\n}\n;--------------------------\nPivot(M){\n n := M.Count(), P := [], i := 0\n while (i++ < n){\n P.push([])\n j := 0\n while (j++ < n)\n P[i].push(i=j ? 1 : 0)\n }\n i := 0\n while (i++ < n){\n maxm := M[i, i], row := i, j := i\n while (j++ < n)\n if (M[j, i] > maxm)\n maxm := M[j, i], row := j\n if (i != row)\n tmp := P[i], P[i] := P[row], P[row] := tmp\n }\n return P\n}\n;--------------------------\nMultiply_Matrix(A,B){\n if (A[1].Count() <> B.Count())\n return\n RCols := A[1].Count()>B[1].Count()?A[1].Count():B[1].Count()\n RRows := A.Count()>B.Count()?A.Count():B.Count(), R := []\n Loop, % RRows {\n RRow:=A_Index\n loop, % RCols {\n RCol:=A_Index, v := 0\n loop % A[1].Count()\n col := A_Index, v += A[RRow, col] * B[col,RCol]\n R[RRow,RCol] := v\n }\n }\n return R\n}\n;--------------------------\nShowMatrix(L, f:=3){\n for r, obj in L{\n row := \"\"\n for c, v in obj\n row .= Format(\"{:.\" f \"f}\", v) \", \"\n output .= \"[\" trim(row, \", \") \"]`n,\"\n }\n return \"[\" Trim(output, \"`n,\") \"]\"\n}\n;--------------------------\n","language":"AutoHotkey"},{"code":"A1 := [[1, 3, 5]\n , [2, 4, 7]\n , [1, 1, 0]]\n\nA2 := [[11, 9, 24, 2]\n ,[1, 5, 2, 6]\n ,[3, 17, 18, 1]\n ,[2, 5, 7, 1]]\n\nloop 2 {\n L := LU_Decomposition(A%A_Index%)\n result .= \"\"\n . \"A:=`n\" ShowMatrix(A%A_Index%, 4)\n . \"`n`nL:=`n\" ShowMatrix(L.1)\n . \"`n`nU:=`n\" ShowMatrix(L.2)\n . \"`n`nP:=`n\" ShowMatrix(L.3)\n . \"`n--------------------------------`n\"\n}\nMsgBox, 262144, , % result\nreturn\n","language":"AutoHotkey"},{"code":" DIM A1(2,2)\n A1() = 1, 3, 5, 2, 4, 7, 1, 1, 0\n PROCLUdecomposition(A1(), L1(), U1(), P1())\n PRINT \"L1:\" ' FNshowmatrix(L1())\n PRINT \"U1:\" ' FNshowmatrix(U1())\n PRINT \"P1:\" ' FNshowmatrix(P1())\n\n DIM A2(3,3)\n A2() = 11, 9, 24, 2, 1, 5, 2, 6, 3, 17, 18, 1, 2, 5, 7, 1\n PROCLUdecomposition(A2(), L2(), U2(), P2())\n PRINT \"L2:\" ' FNshowmatrix(L2())\n PRINT \"U2:\" ' FNshowmatrix(U2())\n PRINT \"P2:\" ' FNshowmatrix(P2())\n END\n\n DEF PROCLUdecomposition(a(), RETURN l(), RETURN u(), RETURN p())\n LOCAL i%, j%, k%, n%, s, b() : n% = DIM(a(),2)\n DIM l(n%,n%), u(n%,n%), b(n%,n%)\n PROCpivot(a(), p())\n b() = p() . a()\n FOR j% = 0 TO n%\n l(j%,j%) = 1\n FOR i% = 0 TO j%\n s = 0\n FOR k% = 0 TO i% : s += u(k%,j%) * l(i%,k%) : NEXT\n u(i%,j%) = b(i%,j%) - s\n NEXT\n FOR i% = j% TO n%\n s = 0\n FOR k% = 0 TO j% : s += u(k%,j%) * l(i%,k%) : NEXT\n IF i%<>j% l(i%,j%) = (b(i%,j%) - s) / u(j%,j%)\n NEXT\n NEXT j%\n ENDPROC\n\n DEF PROCpivot(a(), RETURN p())\n LOCAL i%, j%, m%, n%, r% : n% = DIM(a(),2)\n DIM p(n%,n%) : FOR i% = 0 TO n% : p(i%,i%) = 1 : NEXT\n FOR i% = 0 TO n%\n m% = a(i%,i%)\n r% = i%\n FOR j% = i% TO n%\n IF a(j%,i%) > m% m% = a(j%,i%) : r% = j%\n NEXT\n IF i%<>r% THEN\n FOR j% = 0 TO n% : SWAP p(i%,j%),p(r%,j%) : NEXT\n ENDIF\n NEXT i%\n ENDPROC\n\n DEF FNshowmatrix(a())\n LOCAL @%, i%, j%, a$\n @% = &102050A\n FOR i% = 0 TO DIM(a(),1)\n FOR j% = 0 TO DIM(a(),2)\n a$ += STR$(a(i%,j%)) + \", \"\n NEXT\n a$ = LEFT$(LEFT$(a$)) + CHR$(13) + CHR$(10)\n NEXT i%\n = a$\n","language":"BBC-BASIC"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\n#define foreach(a, b, c) for (int a = b; a < c; a++)\n#define for_i foreach(i, 0, n)\n#define for_j foreach(j, 0, n)\n#define for_k foreach(k, 0, n)\n#define for_ij for_i for_j\n#define for_ijk for_ij for_k\n#define _dim int n\n#define _swap(x, y) { typeof(x) tmp = x; x = y; y = tmp; }\n#define _sum_k(a, b, c, s) { s = 0; foreach(k, a, b) s+= c; }\n\ntypedef double **mat;\n\n#define _zero(a) mat_zero(a, n)\nvoid mat_zero(mat x, int n) { for_ij x[i][j] = 0; }\n\n#define _new(a) a = mat_new(n)\nmat mat_new(_dim)\n{\n\tmat x = malloc(sizeof(double*) * n);\n\tx[0] = malloc(sizeof(double) * n * n);\n\n\tfor_i x[i] = x[0] + n * i;\n\t_zero(x);\n\n\treturn x;\n}\n\n#define _copy(a) mat_copy(a, n)\nmat mat_copy(void *s, _dim)\n{\n\tmat x = mat_new(n);\n\tfor_ij x[i][j] = ((double (*)[n])s)[i][j];\n\treturn x;\n}\n\n#define _del(x) mat_del(x)\nvoid mat_del(mat x) { free(x[0]); free(x); }\n\n#define _QUOT(x) #x\n#define QUOTE(x) _QUOT(x)\n#define _show(a) printf(QUOTE(a)\" =\");mat_show(a, 0, n)\nvoid mat_show(mat x, char *fmt, _dim)\n{\n\tif (!fmt) fmt = \"%8.4g\";\n\tfor_i {\n\t\tprintf(i ? \" \" : \" [ \");\n\t\tfor_j {\n\t\t\tprintf(fmt, x[i][j]);\n\t\t\tprintf(j < n - 1 ? \" \" : i == n - 1 ? \" ]\\n\" : \"\\n\");\n\t\t}\n\t}\n}\n\n#define _mul(a, b) mat_mul(a, b, n)\nmat mat_mul(mat a, mat b, _dim)\n{\n\tmat c = _new(c);\n\tfor_ijk c[i][j] += a[i][k] * b[k][j];\n\treturn c;\n}\n\n#define _pivot(a, b) mat_pivot(a, b, n)\nvoid mat_pivot(mat a, mat p, _dim)\n{\n\tfor_ij { p[i][j] = (i == j); }\n\tfor_i {\n\t\tint max_j = i;\n\t\tforeach(j, i, n)\n\t\t\tif (fabs(a[j][i]) > fabs(a[max_j][i])) max_j = j;\n\n\t\tif (max_j != i)\n\t\t\tfor_k { _swap(p[i][k], p[max_j][k]); }\n\t}\n}\n\n#define _LU(a, l, u, p) mat_LU(a, l, u, p, n)\nvoid mat_LU(mat A, mat L, mat U, mat P, _dim)\n{\n\t_zero(L); _zero(U);\n\t_pivot(A, P);\n\n\tmat Aprime = _mul(P, A);\n\n\tfor_i { L[i][i] = 1; }\n\tfor_ij {\n\t\tdouble s;\n\t\tif (j <= i) {\n\t\t\t_sum_k(0, j, L[j][k] * U[k][i], s)\n\t\t\tU[j][i] = Aprime[j][i] - s;\n\t\t}\n\t\tif (j >= i) {\n\t\t\t_sum_k(0, i, L[j][k] * U[k][i], s);\n\t\t\tL[j][i] = (Aprime[j][i] - s) / U[i][i];\n\t\t}\n\t}\n\n\t_del(Aprime);\n}\n\ndouble A3[][3] = {{ 1, 3, 5 }, { 2, 4, 7 }, { 1, 1, 0 }};\ndouble A4[][4] = {{11, 9, 24, 2}, {1, 5, 2, 6}, {3, 17, 18, 1}, {2, 5, 7, 1}};\n\nint main()\n{\n\tint n = 3;\n\tmat A, L, P, U;\n\n\t_new(L); _new(P); _new(U);\n\tA = _copy(A3);\n\t_LU(A, L, U, P);\n\t_show(A); _show(L); _show(U); _show(P);\n\t_del(A); _del(L); _del(U); _del(P);\n\n\tprintf(\"\\n\");\n\n\tn = 4;\n\n\t_new(L); _new(P); _new(U);\n\tA = _copy(A4);\n\t_LU(A, L, U, P);\n\t_show(A); _show(L); _show(U); _show(P);\n\t_del(A); _del(L); _del(U); _del(P);\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <cassert>\n#include <cmath>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <numeric>\n#include <sstream>\n#include <vector>\n\ntemplate <typename scalar_type> class matrix {\npublic:\n matrix(size_t rows, size_t columns)\n : rows_(rows), columns_(columns), elements_(rows * columns) {}\n\n matrix(size_t rows, size_t columns, scalar_type value)\n : rows_(rows), columns_(columns), elements_(rows * columns, value) {}\n\n matrix(size_t rows, size_t columns,\n const std::initializer_list<std::initializer_list<scalar_type>>& values)\n : rows_(rows), columns_(columns), elements_(rows * columns) {\n assert(values.size() <= rows_);\n size_t i = 0;\n for (const auto& row : values) {\n assert(row.size() <= columns_);\n std::copy(begin(row), end(row), &elements_[i]);\n i += columns_;\n }\n }\n\n size_t rows() const { return rows_; }\n size_t columns() const { return columns_; }\n\n const scalar_type& operator()(size_t row, size_t column) const {\n assert(row < rows_);\n assert(column < columns_);\n return elements_[row * columns_ + column];\n }\n scalar_type& operator()(size_t row, size_t column) {\n assert(row < rows_);\n assert(column < columns_);\n return elements_[row * columns_ + column];\n }\nprivate:\n size_t rows_;\n size_t columns_;\n std::vector<scalar_type> elements_;\n};\n\ntemplate <typename scalar_type>\nvoid print(std::wostream& out, const matrix<scalar_type>& a) {\n const wchar_t* box_top_left = L\"\\x23a1\";\n const wchar_t* box_top_right = L\"\\x23a4\";\n const wchar_t* box_left = L\"\\x23a2\";\n const wchar_t* box_right = L\"\\x23a5\";\n const wchar_t* box_bottom_left = L\"\\x23a3\";\n const wchar_t* box_bottom_right = L\"\\x23a6\";\n\n const int precision = 5;\n size_t rows = a.rows(), columns = a.columns();\n std::vector<size_t> width(columns);\n for (size_t column = 0; column < columns; ++column) {\n size_t max_width = 0;\n for (size_t row = 0; row < rows; ++row) {\n std::ostringstream str;\n str << std::fixed << std::setprecision(precision) << a(row, column);\n max_width = std::max(max_width, str.str().length());\n }\n width[column] = max_width;\n }\n out << std::fixed << std::setprecision(precision);\n for (size_t row = 0; row < rows; ++row) {\n const bool top(row == 0), bottom(row + 1 == rows);\n out << (top ? box_top_left : (bottom ? box_bottom_left : box_left));\n for (size_t column = 0; column < columns; ++column) {\n if (column > 0)\n out << L' ';\n out << std::setw(width[column]) << a(row, column);\n }\n out << (top ? box_top_right : (bottom ? box_bottom_right : box_right));\n out << L'\\n';\n }\n}\n\n// Return value is a tuple with elements (lower, upper, pivot)\ntemplate <typename scalar_type>\nauto lu_decompose(const matrix<scalar_type>& input) {\n assert(input.rows() == input.columns());\n size_t n = input.rows();\n std::vector<size_t> perm(n);\n std::iota(perm.begin(), perm.end(), 0);\n matrix<scalar_type> lower(n, n);\n matrix<scalar_type> upper(n, n);\n matrix<scalar_type> input1(input);\n for (size_t j = 0; j < n; ++j) {\n size_t max_index = j;\n scalar_type max_value = 0;\n for (size_t i = j; i < n; ++i) {\n scalar_type value = std::abs(input1(perm[i], j));\n if (value > max_value) {\n max_index = i;\n max_value = value;\n }\n }\n if (max_value <= std::numeric_limits<scalar_type>::epsilon())\n throw std::runtime_error(\"matrix is singular\");\n if (j != max_index)\n std::swap(perm[j], perm[max_index]);\n size_t jj = perm[j];\n for (size_t i = j + 1; i < n; ++i) {\n size_t ii = perm[i];\n input1(ii, j) /= input1(jj, j);\n for (size_t k = j + 1; k < n; ++k)\n input1(ii, k) -= input1(ii, j) * input1(jj, k);\n }\n }\n\n for (size_t j = 0; j < n; ++j) {\n lower(j, j) = 1;\n for (size_t i = j + 1; i < n; ++i)\n lower(i, j) = input1(perm[i], j);\n for (size_t i = 0; i <= j; ++i)\n upper(i, j) = input1(perm[i], j);\n }\n\n matrix<scalar_type> pivot(n, n);\n for (size_t i = 0; i < n; ++i)\n pivot(i, perm[i]) = 1;\n\n return std::make_tuple(lower, upper, pivot);\n}\n\ntemplate <typename scalar_type>\nvoid show_lu_decomposition(const matrix<scalar_type>& input) {\n try {\n std::wcout << L\"A\\n\";\n print(std::wcout, input);\n auto result(lu_decompose(input));\n std::wcout << L\"\\nL\\n\";\n print(std::wcout, std::get<0>(result));\n std::wcout << L\"\\nU\\n\";\n print(std::wcout, std::get<1>(result));\n std::wcout << L\"\\nP\\n\";\n print(std::wcout, std::get<2>(result));\n } catch (const std::exception& ex) {\n std::cerr << ex.what() << '\\n';\n }\n}\n\nint main() {\n std::wcout.imbue(std::locale(\"\"));\n std::wcout << L\"Example 1:\\n\";\n matrix<double> matrix1(3, 3,\n {{1, 3, 5},\n {2, 4, 7},\n {1, 1, 0}});\n show_lu_decomposition(matrix1);\n std::wcout << '\\n';\n\n std::wcout << L\"Example 2:\\n\";\n matrix<double> matrix2(4, 4,\n {{11, 9, 24, 2},\n {1, 5, 2, 6},\n {3, 17, 18, 1},\n {2, 5, 7, 1}});\n show_lu_decomposition(matrix2);\n std::wcout << '\\n';\n\n std::wcout << L\"Example 3:\\n\";\n matrix<double> matrix3(3, 3,\n {{-5, -6, -3},\n {-1, 0, -2},\n {-3, -4, -7}});\n show_lu_decomposition(matrix3);\n std::wcout << '\\n';\n\n std::wcout << L\"Example 4:\\n\";\n matrix<double> matrix4(3, 3,\n {{1, 2, 3},\n {4, 5, 6},\n {7, 8, 9}});\n show_lu_decomposition(matrix4);\n\n return 0;\n}\n","language":"C++"},{"code":";; Creates a nxn identity matrix.\n(defun eye (n)\n (let ((I (make-array `(,n ,n) :initial-element 0)))\n (loop for j from 0 to (- n 1) do\n (setf (aref I j j) 1))\n I))\n\n;; Swap two rows l and k of a mxn matrix A, which is a 2D array.\n(defun swap-rows (A l k)\n (let* ((n (cadr (array-dimensions A)))\n (row (make-array n :initial-element 0)))\n (loop for j from 0 to (- n 1) do\n (setf (aref row j) (aref A l j))\n (setf (aref A l j) (aref A k j))\n (setf (aref A k j) (aref row j)))))\n\n;; Creates the pivoting matrix for A.\n(defun pivotize (A)\n (let* ((n (car (array-dimensions A)))\n (P (eye n)))\n (loop for j from 0 to (- n 1) do\n (let ((max (aref A j j))\n (row j))\n (loop for i from j to (- n 1) do\n (if (> (aref A i j) max)\n (setq max (aref A i j)\n row i)))\n (if (not (= j row))\n (swap-rows P j row))))\n\n ;; Return P.\n P))\n\n;; Decomposes a square matrix A by PA=LU and returns L, U and P.\n(defun lu (A)\n (let* ((n (car (array-dimensions A)))\n (L (make-array `(,n ,n) :initial-element 0))\n (U (make-array `(,n ,n) :initial-element 0))\n (P (pivotize A))\n (A (mmul P A)))\n\n (loop for j from 0 to (- n 1) do\n (setf (aref L j j) 1)\n (loop for i from 0 to j do\n (setf (aref U i j)\n (- (aref A i j)\n (loop for k from 0 to (- i 1)\n sum (* (aref U k j)\n (aref L i k))))))\n (loop for i from j to (- n 1) do\n (setf (aref L i j)\n (/ (- (aref A i j)\n (loop for k from 0 to (- j 1)\n sum (* (aref U k j)\n (aref L i k))))\n (aref U j j)))))\n\n ;; Return L, U and P.\n (values L U P)))\n","language":"Common-Lisp"},{"code":"(setf g (make-array '(3 3) :initial-contents '((1 3 5) (2 4 7)(1 1 0))))\n#2A((1 3 5) (2 4 7) (1 1 0))\n\n(lu g)\n#2A((1 0 0) (1/2 1 0) (1/2 -1 1))\n#2A((2 4 7) (0 1 3/2) (0 0 -2))\n#2A((0 1 0) (1 0 0) (0 0 1))\n","language":"Common-Lisp"},{"code":"(setf h (make-array '(4 4) :initial-contents '((11 9 24 2)(1 5 2 6)(3 17 18 1)(2 5 7 1))))\n#2A((11 9 24 2) (1 5 2 6) (3 17 18 1) (2 5 7 1))\n\n(lup h)\n#2A((1 0 0 0) (3/11 1 0 0) (1/11 23/80 1 0) (2/11 37/160 1/278 1))\n#2A((11 9 24 2) (0 160/11 126/11 5/11) (0 0 -139/40 91/16) (0 0 0 71/139))\n#2A((1 0 0 0) (0 0 1 0) (0 1 0 0) (0 0 0 1))\n","language":"Common-Lisp"},{"code":"import std.stdio, std.algorithm, std.typecons, std.numeric,\n std.array, std.conv, std.string, std.range;\n\nbool isRectangular(T)(in T[][] m) pure nothrow @nogc {\n return m.all!(r => r.length == m[0].length);\n}\n\nbool isSquare(T)(in T[][] m) pure nothrow @nogc {\n return m.isRectangular && m[0].length == m.length;\n}\n\nT[][] matrixMul(T)(in T[][] A, in T[][] B) pure nothrow\nin {\n assert(A.isRectangular && B.isRectangular &&\n !A.empty && !B.empty && A[0].length == B.length);\n} body {\n auto result = new T[][](A.length, B[0].length);\n auto aux = new T[B.length];\n\n foreach (immutable j; 0 .. B[0].length) {\n foreach (immutable k, const row; B)\n aux[k] = row[j];\n foreach (immutable i, const ai; A)\n result[i][j] = dotProduct(ai, aux);\n }\n\n return result;\n}\n\n/// Creates the pivoting matrix for m.\nT[][] pivotize(T)(immutable T[][] m) pure nothrow\nin {\n assert(m.isSquare);\n} body {\n immutable n = m.length;\n auto id = iota(n)\n .map!((in j) => n.iota.map!(i => T(i == j)).array)\n .array;\n\n foreach (immutable i; 0 .. n) {\n // immutable row = iota(i, n).reduce!(max!(j => m[j][i]));\n T maxm = m[i][i];\n size_t row = i;\n foreach (immutable j; i .. n)\n if (m[j][i] > maxm) {\n maxm = m[j][i];\n row = j;\n }\n\n if (i != row)\n swap(id[i], id[row]);\n }\n\n return id;\n}\n\n/// Decomposes a square matrix A by PA=LU and returns L, U and P.\nTuple!(T[][],\"L\", T[][],\"U\", const T[][],\"P\")\nlu(T)(immutable T[][] A) pure nothrow\nin {\n assert(A.isSquare);\n} body {\n immutable n = A.length;\n auto L = new T[][](n, n);\n auto U = new T[][](n, n);\n foreach (immutable i; 0 .. n) {\n L[i][i .. $] = 0;\n U[i][0 .. i] = 0;\n }\n\n immutable P = A.pivotize!T;\n immutable A2 = matrixMul!T(P, A);\n\n foreach (immutable j; 0 .. n) {\n L[j][j] = 1;\n foreach (immutable i; 0 .. j+1) {\n T s1 = 0;\n foreach (immutable k; 0 .. i)\n s1 += U[k][j] * L[i][k];\n U[i][j] = A2[i][j] - s1;\n }\n foreach (immutable i; j .. n) {\n T s2 = 0;\n foreach (immutable k; 0 .. j)\n s2 += U[k][j] * L[i][k];\n L[i][j] = (A2[i][j] - s2) / U[j][j];\n }\n }\n\n return typeof(return)(L, U, P);\n}\n\nvoid main() {\n immutable a = [[1.0, 3, 5],\n [2.0, 4, 7],\n [1.0, 1, 0]];\n immutable b = [[11.0, 9, 24, 2],\n [1.0, 5, 2, 6],\n [3.0, 17, 18, 1],\n [2.0, 5, 7, 1]];\n\n auto f = \"[%([%(%.1f, %)],\\n %)]]\\n\\n\".replicate(3);\n foreach (immutable m; [a, b])\n writefln(f, lu(m).tupleof);\n}\n","language":"D"},{"code":"(lib 'matrix) ;; the matrix library provides LU-decomposition\n(decimals 5)\n\n(define A (list->array' (1 3 5 2 4 7 1 1 0 ) 3 3))\n(define PLU (matrix-lu-decompose A)) ;; -> list of three matrices, P, Lower, Upper\n\n(array-print (first PLU))\n0 1 0\n1 0 0\n0 0 1\n(array-print (second PLU))\n1 0 0\n0.5 1 0\n0.5 -1 1\n(array-print (caddr PLU))\n2 4 7\n0 1 1.5\n0 0 -2\n\n(define A (list->array '(11 9 24 2 1 5 2 6 3 17 18 1 2 5 7 1 ) 4 4))\n(define PLU (matrix-lu-decompose A)) ;; -> list of three matrices, P, Lower, Upper\n(array-print (first PLU))\n1 0 0 0\n0 0 1 0\n0 1 0 0\n0 0 0 1\n\n(array-print (second PLU))\n1 0 0 0\n0.27273 1 0 0\n0.09091 0.2875 1 0\n0.18182 0.23125 0.0036 1\n\n(array-print (caddr PLU))\n11 9 24 2\n0 14.54545 11.45455 0.45455\n0 0 -3.475 5.6875\n0 0 0 0.51079\n","language":"EchoLisp"},{"code":"program lu1\n implicit none\n call check( reshape([real(8)::1,2,1,3,4,1,5,7,0 ],[3,3]) )\n call check( reshape([real(8)::11,1,3,2,9,5,17,5,24,2,18,7,2,6,1,1],[4,4]) )\n\ncontains\n\n subroutine check(a)\n real(8), intent(in) :: a(:,:)\n integer :: i,j,n\n real(8), allocatable :: aa(:,:),l(:,:),u(:,:)\n integer, allocatable :: p(:,:)\n integer, allocatable :: ipiv(:)\n n = size(a,1)\n allocate(aa(n,n),l(n,n),u(n,n),p(n,n),ipiv(n))\n forall (j=1:n,i=1:n)\n aa(i,j) = a(i,j)\n u (i,j) = 0d0\n p (i,j) = merge(1 ,0 ,i.eq.j)\n l (i,j) = merge(1d0,0d0,i.eq.j)\n end forall\n call lu(aa, ipiv)\n do i = 1,n\n l(i, :i-1) = aa(i, :i-1)\n u(i,i: ) = aa(i,i: )\n end do\n p(ipiv,:) = p\n call mat_print('a',a)\n call mat_print('p',p)\n call mat_print('l',l)\n call mat_print('u',u)\n print *, \"residual\"\n print *, \"|| P.A - L.U || = \", maxval(abs(matmul(p,a)-matmul(l,u)))\n end subroutine\n\n subroutine lu(a,p)\n! in situ decomposition, corresponds to LAPACK's dgebtrf\n real(8), intent(inout) :: a(:,:)\n integer, intent(out ) :: p(:)\n integer :: n, i,j,k,kmax\n n = size(a,1)\n p = [ ( i, i=1,n ) ]\n do k = 1,n-1\n kmax = maxloc(abs(a(p(k:),k)),1) + k-1\n if (kmax /= k ) then\n p([k, kmax]) = p([kmax, k])\n a([k, kmax],:) = a([kmax, k],:)\n end if\n a(k+1:,k) = a(k+1:,k) / a(k,k)\n forall (j=k+1:n) a(k+1:,j) = a(k+1:,j) - a(k,j)*a(k+1:,k)\n end do\n end subroutine\n\n subroutine mat_print(amsg,a)\n character(*), intent(in) :: amsg\n class (*), intent(in) :: a(:,:)\n integer :: i\n print*,' '\n print*,amsg\n do i=1,size(a,1)\n select type (a)\n type is (real(8)) ; print'(100f8.2)',a(i,:)\n type is (integer) ; print'(100i8 )',a(i,:)\n end select\n end do\n print*,' '\n end subroutine\n\nend program\n","language":"Fortran"},{"code":"package main\n\nimport \"fmt\"\n\ntype matrix [][]float64\n\nfunc zero(n int) matrix {\n r := make([][]float64, n)\n a := make([]float64, n*n)\n for i := range r {\n r[i] = a[n*i : n*(i+1)]\n }\n return r\n}\n\nfunc eye(n int) matrix {\n r := zero(n)\n for i := range r {\n r[i][i] = 1\n }\n return r\n}\n\nfunc (m matrix) print(label string) {\n if label > \"\" {\n fmt.Printf(\"%s:\\n\", label)\n }\n for _, r := range m {\n for _, e := range r {\n fmt.Printf(\" %9.5f\", e)\n }\n fmt.Println()\n }\n}\n\nfunc (a matrix) pivotize() matrix {\n p := eye(len(a))\n for j, r := range a {\n max := r[j]\n row := j\n for i := j; i < len(a); i++ {\n if a[i][j] > max {\n max = a[i][j]\n row = i\n }\n }\n if j != row {\n // swap rows\n p[j], p[row] = p[row], p[j]\n }\n }\n return p\n}\n\nfunc (m1 matrix) mul(m2 matrix) matrix {\n r := zero(len(m1))\n for i, r1 := range m1 {\n for j := range m2 {\n for k := range m1 {\n r[i][j] += r1[k] * m2[k][j]\n }\n }\n }\n return r\n}\n\nfunc (a matrix) lu() (l, u, p matrix) {\n l = zero(len(a))\n u = zero(len(a))\n p = a.pivotize()\n a = p.mul(a)\n for j := range a {\n l[j][j] = 1\n for i := 0; i <= j; i++ {\n sum := 0.\n for k := 0; k < i; k++ {\n sum += u[k][j] * l[i][k]\n }\n u[i][j] = a[i][j] - sum\n }\n for i := j; i < len(a); i++ {\n sum := 0.\n for k := 0; k < j; k++ {\n sum += u[k][j] * l[i][k]\n }\n l[i][j] = (a[i][j] - sum) / u[j][j]\n }\n }\n return\n}\n\nfunc main() {\n showLU(matrix{\n {1, 3, 5},\n {2, 4, 7},\n {1, 1, 0}})\n showLU(matrix{\n {11, 9, 24, 2},\n {1, 5, 2, 6},\n {3, 17, 18, 1},\n {2, 5, 7, 1}})\n}\n\nfunc showLU(a matrix) {\n a.print(\"\\na\")\n l, u, p := a.lu()\n l.print(\"l\")\n u.print(\"u\")\n p.print(\"p\")\n}\n","language":"Go"},{"code":"package main\n\nimport \"fmt\"\n\ntype matrix struct {\n stride int\n ele []float64\n}\n\nfunc (m *matrix) print(heading string) {\n if heading > \"\" {\n fmt.Print(\"\\n\", heading, \"\\n\")\n }\n for e := 0; e < len(m.ele); e += m.stride {\n fmt.Printf(\"%8.5f \", m.ele[e:e+m.stride])\n fmt.Println()\n }\n}\n\nfunc (m1 *matrix) mul(m2 *matrix) (m3 *matrix, ok bool) {\n if m1.stride*m2.stride != len(m2.ele) {\n return nil, false\n }\n m3 = &matrix{m2.stride, make([]float64, (len(m1.ele)/m1.stride)*m2.stride)}\n for m1c0, m3x := 0, 0; m1c0 < len(m1.ele); m1c0 += m1.stride {\n for m2r0 := 0; m2r0 < m2.stride; m2r0++ {\n for m1x, m2x := m1c0, m2r0; m2x < len(m2.ele); m2x += m2.stride {\n m3.ele[m3x] += m1.ele[m1x] * m2.ele[m2x]\n m1x++\n }\n m3x++\n }\n }\n return m3, true\n}\n\nfunc zero(rows, cols int) *matrix {\n return &matrix{cols, make([]float64, rows*cols)}\n}\n\nfunc eye(n int) *matrix {\n m := zero(n, n)\n for ix := 0; ix < len(m.ele); ix += n + 1 {\n m.ele[ix] = 1\n }\n return m\n}\n\nfunc (a *matrix) pivotize() *matrix {\n pv := make([]int, a.stride)\n for i := range pv {\n pv[i] = i\n }\n for j, dx := 0, 0; j < a.stride; j++ {\n row := j\n max := a.ele[dx]\n for i, ixcj := j, dx; i < a.stride; i++ {\n if a.ele[ixcj] > max {\n max = a.ele[ixcj]\n row = i\n }\n ixcj += a.stride\n }\n if j != row {\n pv[row], pv[j] = pv[j], pv[row]\n }\n dx += a.stride + 1\n }\n p := zero(a.stride, a.stride)\n for r, c := range pv {\n p.ele[r*a.stride+c] = 1\n }\n return p\n}\n\nfunc (a *matrix) lu() (l, u, p *matrix) {\n l = zero(a.stride, a.stride)\n u = zero(a.stride, a.stride)\n p = a.pivotize()\n a, _ = p.mul(a)\n for j, jxc0 := 0, 0; j < a.stride; j++ {\n l.ele[jxc0+j] = 1\n for i, ixc0 := 0, 0; ixc0 <= jxc0; i++ {\n sum := 0.\n for k, kxcj := 0, j; k < i; k++ {\n sum += u.ele[kxcj] * l.ele[ixc0+k]\n kxcj += a.stride\n }\n u.ele[ixc0+j] = a.ele[ixc0+j] - sum\n ixc0 += a.stride\n }\n for ixc0 := jxc0; ixc0 < len(a.ele); ixc0 += a.stride {\n sum := 0.\n for k, kxcj := 0, j; k < j; k++ {\n sum += u.ele[kxcj] * l.ele[ixc0+k]\n kxcj += a.stride\n }\n l.ele[ixc0+j] = (a.ele[ixc0+j] - sum) / u.ele[jxc0+j]\n }\n jxc0 += a.stride\n }\n return\n}\n\nfunc main() {\n showLU(&matrix{3, []float64{\n 1, 3, 5,\n 2, 4, 7,\n 1, 1, 0}})\n showLU(&matrix{4, []float64{\n 11, 9, 24, 2,\n 1, 5, 2, 6,\n 3, 17, 18, 1,\n 2, 5, 7, 1}})\n}\n\nfunc showLU(a *matrix) {\n a.print(\"\\na\")\n l, u, p := a.lu()\n l.print(\"l\")\n u.print(\"u\")\n p.print(\"p\")\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n\n \"gonum.org/v1/gonum/mat\"\n)\n\nfunc main() {\n showLU(mat.NewDense(3, 3, []float64{\n 1, 3, 5,\n 2, 4, 7,\n 1, 1, 0,\n }))\n fmt.Println()\n showLU(mat.NewDense(4, 4, []float64{\n 11, 9, 24, 2,\n 1, 5, 2, 6,\n 3, 17, 18, 1,\n 2, 5, 7, 1,\n }))\n}\n\nfunc showLU(a *mat.Dense) {\n fmt.Printf(\"a: %v\\n\\n\", mat.Formatted(a, mat.Prefix(\" \")))\n var lu mat.LU\n lu.Factorize(a)\n l := lu.LTo(nil)\n u := lu.UTo(nil)\n fmt.Printf(\"l: %.5f\\n\\n\", mat.Formatted(l, mat.Prefix(\" \")))\n fmt.Printf(\"u: %.5f\\n\\n\", mat.Formatted(u, mat.Prefix(\" \")))\n fmt.Println(\"p:\", lu.Pivot(nil))\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n\n mat \"github.com/skelterjohn/go.matrix\"\n)\n\nfunc main() {\n showLU(mat.MakeDenseMatrixStacked([][]float64{\n {1, 3, 5},\n {2, 4, 7},\n {1, 1, 0}}))\n showLU(mat.MakeDenseMatrixStacked([][]float64{\n {11, 9, 24, 2},\n {1, 5, 2, 6},\n {3, 17, 18, 1},\n {2, 5, 7, 1}}))\n}\n\nfunc showLU(a *mat.DenseMatrix) {\n fmt.Printf(\"\\na:\\n%v\\n\", a)\n l, u, p := a.LU()\n fmt.Printf(\"l:\\n%v\\n\", l)\n fmt.Printf(\"u:\\n%v\\n\", u)\n fmt.Printf(\"p:\\n%v\\n\", p)\n}\n","language":"Go"},{"code":"import Data.List\nimport Data.Maybe\nimport Text.Printf\n\n-- a matrix is represented as a list of columns\nmmult :: Num a => [[a]] -> [[a]] -> [[a]]\nmmult a b = [ [ sum $ zipWith (*) ak bj | ak <- (transpose a) ] | bj <- b ]\n\nnth mA i j = (mA !! j) !! i\n\nidMatrixPart n m k = [ [if (i==j) then 1 else 0 | i <- [1..n]] | j <- [k..m]]\nidMatrix n = idMatrixPart n n 1\n\npermMatrix n ix1 ix2 =\n [ [ if ((i==ix1 && j==ix2) || (i==ix2 && j==ix1) || (i==j && j /= ix1 && i /= ix2))\n then 1 else 0| i <- [0..n-1]] | j <- [0..n-1]]\npermMatrix_inv n ix1 ix2 = permMatrix n ix2 ix1\n\n-- count k from zero\nelimColumn :: Int -> [[Rational]] -> Int -> [Rational]\nelimMatrix :: Int -> [[Rational]] -> Int -> [[Rational]]\nelimMatrix_inv :: Int -> [[Rational]] -> Int -> [[Rational]]\n\nelimColumn n mA k = [(let mAkk = (nth mA k k) in if (i>k) then (-(nth mA i k)/mAkk)\n else if (i==k) then 1 else 0) | i <- [0..n-1]]\nelimMatrix n mA k = (idMatrixPart n k 1) ++ [elimColumn n mA k] ++ (idMatrixPart n n (k+2))\nelimMatrix_inv n mA k = (idMatrixPart n k 1) ++ --mA is elimMatrix there\n [let c = (mA!!k) in [if (i==k) then 1 else if (i<k) then 0 else (-(c!!i)) | i <- [0..n-1]]]\n ++ (idMatrixPart n n (k+2))\n\nswapIndx :: [[Rational]] -> Int -> Int\nswapIndx mA k = fromMaybe k (findIndex (>0) (drop k (mA!!k)))\n\n-- LUP; lupStep returns [L:U:P]\npaStep_recP :: Int -> [[Rational]] -> [[Rational]] -> [[Rational]] -> Int -> [[[Rational]]]\npaStep_recM :: Int -> [[Rational]] -> [[Rational]] -> [[Rational]] -> Int -> [[[Rational]]]\nlupStep :: Int -> [[Rational]] -> [[[Rational]]]\n\npaStep_recP n mP mA mL cnt =\n let mPt = permMatrix n cnt (swapIndx mA cnt) in\n let mPtInv = permMatrix_inv n cnt (swapIndx mA cnt) in\n if (cnt >= n) then [(mmult mP mL),mA,mP] else\n (paStep_recM n (mmult mPt mP) (mmult mPt mA) (mmult mL mPtInv) cnt)\n\npaStep_recM n mP mA mL cnt =\n let mMt = elimMatrix n mA cnt in\n let mMtInv = elimMatrix_inv n mMt cnt in\n paStep_recP n mP (mmult mMt mA) (mmult mL mMtInv) (cnt + 1)\n\nlupStep n mA = paStep_recP n (idMatrix n) mA (idMatrix n) 0\n\n--IO\nmatrixFromRationalToString m = concat $ intersperse \"\\n\"\n (map (\\x -> unwords $ printf \"%8.4f\" <$> (x::[Double]))\n (transpose (matrixFromRational m))) where\n matrixFromRational m = map (\\x -> map fromRational x) m\n\nsolveTask mY = let mLUP = lupStep (length mY) mY in\n putStrLn (\"A: \\n\" ++ matrixFromRationalToString mY) >>\n putStrLn (\"L: \\n\" ++ matrixFromRationalToString (mLUP!!0)) >>\n putStrLn (\"U: \\n\" ++ matrixFromRationalToString (mLUP!!1)) >>\n putStrLn (\"P: \\n\" ++ matrixFromRationalToString (mLUP!!2)) >>\n putStrLn (\"Verify: PA\\n\" ++ matrixFromRationalToString (mmult (mLUP!!2) mY)) >>\n putStrLn (\"Verify: LU\\n\" ++ matrixFromRationalToString (mmult (mLUP!!0) (mLUP!!1)))\n\nmY1 = [[1, 2, 1], [3, 4, 7], [5, 7, 0]] :: [[Rational]]\nmY2 = [[11, 1, 3, 2], [9, 5, 17, 5], [24, 2, 18, 7], [2, 6, 1, 1]] :: [[Rational]]\nmain = putStrLn \"Task1: \\n\" >> solveTask mY1 >>\n putStrLn \"Task2: \\n\" >> solveTask mY2\n","language":"Haskell"},{"code":"import Numeric.LinearAlgebra\n\na1, a2 :: Matrix R\na1 = (3><3)\n [1,3,5\n ,2,4,7\n ,1,1,0]\n\na2 = (4><4)\n [11, 9, 24, 2\n , 1, 5, 2, 6\n , 3, 17, 18, 1\n , 2, 5, 7, 1]\n\nmain = do\n print $ lu a1\n print $ lu a2\n","language":"Haskell"},{"code":"module Main\n\nimport Data.Vect\n\nMatrix : Nat -> Nat -> Type -> Type\nMatrix m n t = Vect m (Vect n t)\n\n-- Creates list from 0 to n (not including n)\nupTo : (m : Nat) -> Vect m (Fin m)\nupTo Z = []\nupTo (S n) = 0 :: (map FS (upTo n))\n\n-- Creates list from 0 to n-1 (not including n-1)\nupToM1 : (m : Nat) -> (sz ** Vect sz (Fin m))\nupToM1 m = case (upTo m) of\n (y::ys) => (_ ** init(y::ys))\n [] => (_ ** [])\n\n-- Creates list from i to n (not including n)\nfromUpTo : {n : Nat} -> Fin n -> (sz ** Vect sz (Fin n))\nfromUpTo {n} m = filter (>= m) (upTo n)\n\n-- Creates list from i+1 to n (not including n)\nfromUpTo1 : {n : Nat} -> Fin n -> (sz ** Vect sz (Fin n))\nfromUpTo1 {n} m with (fromUpTo m)\n | (_ ** xs) = case xs of\n (y::ys) => (_ ** ys)\n [] => (_ ** [])\n\n\n-- Create Zero Matrix of size m by n\nzeros : (m : Nat) -> (n : Nat) -> Matrix m n Double\nzeros m n = replicate m (replicate n 0.0)\n\nreplaceAtM : (Fin m, Fin n) -> t -> Matrix m n t -> Matrix m n t\nreplaceAtM (i, j) e a = replaceAt i (replaceAt j e (index i a)) a\n\n-- Create Identity Matrix of size m by m\neye : (m : Nat) -> Matrix m m Double\neye m = map create1Vec (upTo m)\n where\n set1 : Vect m Double -> Fin m -> Vect m Double\n set1 a n = replaceAt n 1.0 a\n\n create1Vec : Fin m -> Vect m Double\n create1Vec n = set1 (replicate m 0.0) n\n\n\nindexM : (Fin m, Fin n) -> Matrix m n t -> t\nindexM (i, j) a = index j (index i a)\n\n\n-- Obtain index for the row containing the\n-- largest absolute value for the given column\ncolAbsMaxIndex : Fin m -> Fin m -> Matrix m m Double -> Fin m\ncolAbsMaxIndex startRow col a {m} with (fromUpTo startRow)\n | (_ ** xs) =\n snd $ foldl (\\(absMax, idx), curIdx =>\n let curAbsVal = abs(indexM (curIdx, col) a) in\n if (curAbsVal > absMax)\n then (curAbsVal, curIdx)\n else (absMax, idx)\n ) (0.0, startRow) xs\n\n\n-- Swaps two rows in a given matrix\nswapRows : Fin m -> Fin m -> Matrix m n t -> Matrix m n t\nswapRows r1 r2 a = replaceAt r2 tempRow $ replaceAt r1 (index r2 a) a\n where tempRow = index r1 a\n\n\n-- Swaps two individual values in a matrix\nswapValues : (Fin m, Fin m) -> (Fin m, Fin m) -> Matrix m m Double -> Matrix m m Double\nswapValues (i1, j1) (i2, j2) m = replaceAtM (i2, j2) v1 $ replaceAtM (i1, j1) v2 m\n where\n v1 = indexM (i1, j1) m\n v2 = indexM (i2, j2) m\n\n-- Perform row Swap on Lower Triangular Matrix\nlSwapRow : Fin m -> Fin m -> Matrix m m Double -> Matrix m m Double\nlSwapRow row1 row2 l {m} with (filter (< row1) (upTo m))\n | (_ ** xs) = foldl (\\l',col => swapValues (row1, col) (row2, col) l') l xs\n\n\nrowSwap : Fin m -> (Matrix m m Double, Matrix m m Double, Matrix m m Double) ->\n (Matrix m m Double, Matrix m m Double, Matrix m m Double)\nrowSwap col (l,u,p) = (lSwapRow col row l, swapRows col row u, swapRows col row p)\n where row = colAbsMaxIndex col col u\n\n\ncalc : (Fin m) -> (Fin m) -> (Matrix m m Double, Matrix m m Double) ->\n (Matrix m m Double, Matrix m m Double)\ncalc i j (l, u) {m} = (l', u')\n where\n l' : Matrix m m Double\n l' = replaceAtM (j, i) ((indexM (j, i) u) / indexM (i, i) u) l\n\n u'' : (Fin m) -> (Matrix m m Double) -> (Matrix m m Double)\n u'' k u = replaceAtM (j, k) ((indexM (j, k) u) -\n ((indexM (j, i) l') * (indexM (i, k) u))) u\n\n u' : (Matrix m m Double)\n u' with (fromUpTo i) | (_ ** xs) = foldl (\\curU, idx => u'' idx curU) u xs\n\n\n-- Perform a single iteration of the algorithm for the given column\niteration : Fin m -> (Matrix m m Double, Matrix m m Double, Matrix m m Double) ->\n (Matrix m m Double, Matrix m m Double, Matrix m m Double)\niteration i lup {m} = iterate' (rowSwap i lup)\n\n where\n modify : (Matrix m m Double, Matrix m m Double) ->\n (Matrix m m Double, Matrix m m Double)\n modify lu with (fromUpTo1 i) | (_ ** xs) =\n foldl (\\lu',j => calc i j lu') lu xs\n\n iterate' : (Matrix m m Double, Matrix m m Double, Matrix m m Double) ->\n (Matrix m m Double, Matrix m m Double, Matrix m m Double)\n iterate' (l, u, p) with (modify (l, u)) | (l', u') = (l', u', p)\n\n\n-- Generate L, U, P matricies from a given square matrix.\n-- Where L * U = A, and P is the permutation matrix\nluDecompose : Matrix m m Double -> (Matrix m m Double, Matrix m m Double, Matrix m m Double)\nluDecompose a {m} with (upToM1 m)\n | (_ ** xs) = foldl (\\lup,idx => iteration idx lup) (eye m,a,eye m) xs\n\n\n\nex1 : (Matrix 3 3 Double, Matrix 3 3 Double, Matrix 3 3 Double)\nex1 = luDecompose [[1, 3, 5], [2, 4, 7], [1, 1, 0]]\n\nex2 : (Matrix 4 4 Double, Matrix 4 4 Double, Matrix 4 4 Double)\nex2 = luDecompose [[11, 9, 24, 2], [1, 5, 2, 6], [3, 17, 18, 1], [2, 5, 7, 1]]\n\nprintEx : (Matrix n n Double, Matrix n n Double, Matrix n n Double) -> IO ()\nprintEx (l, u, p) = do\n putStr \"l:\"\n print l\n putStrLn \"\\n\"\n\n putStr \"u:\"\n print u\n putStrLn \"\\n\"\n\n putStr \"p:\"\n print p\n putStrLn \"\\n\"\n\nmain : IO()\nmain = do\n putStrLn \"Solution 1:\"\n printEx ex1\n putStrLn \"Solution 2:\"\n printEx ex2\n","language":"Idris"},{"code":"mp=: +/ .*\n\nLU=: 3 : 0\n 'm n'=. $ A=. y\n if. 1=m do.\n p ; (=1) ; p{\"1 A [ p=. C. (n-1);~.0,(0~:,A)i.1\n else.\n m2=. >.m%2\n 'p1 L1 U1'=. LU m2{.A\n D=. (/:p1) {\"1 m2}.A\n F=. m2 {.\"1 D\n E=. m2 {.\"1 U1\n FE1=. F mp %. E\n G=. m2}.\"1 D - FE1 mp U1\n 'p2 L2 U2'=. LU G\n p3=. (i.m2),m2+p2\n H=. (/:p3) {\"1 U1\n (p1{p3) ; (L1,FE1,.L2) ; H,(-n){.\"1 U2\n end.\n)\n\npermtomat=: 1 {.~\"0 -@>:@:/:\nLUdecompose=: (permtomat&.>@{. , }.)@:LU\n","language":"J"},{"code":" A=:3 3$1 3 5 2 4 7 1 1 0\n LUdecompose A\n┌─────┬─────┬───────┐\n│1 0 0│1 0 0│1 3 5│\n│0 1 0│2 1 0│0 _2 _3│\n│0 0 1│1 1 1│0 0 _2│\n└─────┴─────┴───────┘\n mp/> LUdecompose A\n1 3 5\n2 4 7\n1 1 0\n\n A=:4 4$11 9 24 2 1 5 2 6 3 17 18 1 2 5 7 1\n LUdecompose A\n┌───────┬─────────────────────────────┬─────────────────────────────┐\n│1 0 0 0│ 1 0 0 0│11 9 24 2│\n│0 1 0 0│0.0909091 1 0 0│ 0 4.18182 _0.181818 5.81818│\n│0 0 1 0│ 0.272727 3.47826 1 0│ 0 0 12.087 _19.7826│\n│0 0 0 1│ 0.181818 0.804348 0.230216 1│ 0 0 0 0.510791│\n└───────┴─────────────────────────────┴─────────────────────────────┘\n mp/> LUdecompose A\n11 9 24 2\n 1 5 2 6\n 3 17 18 1\n 2 5 7 1\n","language":"J"},{"code":"import static java.util.Arrays.stream;\nimport java.util.Locale;\nimport static java.util.stream.IntStream.range;\n\npublic class Test {\n\n static double dotProduct(double[] a, double[] b) {\n return range(0, a.length).mapToDouble(i -> a[i] * b[i]).sum();\n }\n\n static double[][] matrixMul(double[][] A, double[][] B) {\n double[][] result = new double[A.length][B[0].length];\n double[] aux = new double[B.length];\n\n for (int j = 0; j < B[0].length; j++) {\n\n for (int k = 0; k < B.length; k++)\n aux[k] = B[k][j];\n\n for (int i = 0; i < A.length; i++)\n result[i][j] = dotProduct(A[i], aux);\n }\n return result;\n }\n\n static double[][] pivotize(double[][] m) {\n int n = m.length;\n double[][] id = range(0, n).mapToObj(j -> range(0, n)\n .mapToDouble(i -> i == j ? 1 : 0).toArray())\n .toArray(double[][]::new);\n\n for (int i = 0; i < n; i++) {\n double maxm = m[i][i];\n int row = i;\n for (int j = i; j < n; j++)\n if (m[j][i] > maxm) {\n maxm = m[j][i];\n row = j;\n }\n\n if (i != row) {\n double[] tmp = id[i];\n id[i] = id[row];\n id[row] = tmp;\n }\n }\n return id;\n }\n\n static double[][][] lu(double[][] A) {\n int n = A.length;\n double[][] L = new double[n][n];\n double[][] U = new double[n][n];\n double[][] P = pivotize(A);\n double[][] A2 = matrixMul(P, A);\n\n for (int j = 0; j < n; j++) {\n L[j][j] = 1;\n for (int i = 0; i < j + 1; i++) {\n double s1 = 0;\n for (int k = 0; k < i; k++)\n s1 += U[k][j] * L[i][k];\n U[i][j] = A2[i][j] - s1;\n }\n for (int i = j; i < n; i++) {\n double s2 = 0;\n for (int k = 0; k < j; k++)\n s2 += U[k][j] * L[i][k];\n L[i][j] = (A2[i][j] - s2) / U[j][j];\n }\n }\n return new double[][][]{L, U, P};\n }\n\n static void print(double[][] m) {\n stream(m).forEach(a -> {\n stream(a).forEach(n -> System.out.printf(Locale.US, \"%5.1f \", n));\n System.out.println();\n });\n System.out.println();\n }\n\n public static void main(String[] args) {\n double[][] a = {{1.0, 3, 5}, {2.0, 4, 7}, {1.0, 1, 0}};\n\n double[][] b = {{11.0, 9, 24, 2}, {1.0, 5, 2, 6}, {3.0, 17, 18, 1},\n {2.0, 5, 7, 1}};\n\n for (double[][] m : lu(a))\n print(m);\n\n System.out.println();\n\n for (double[][] m : lu(b))\n print(m);\n }\n}\n","language":"Java"},{"code":"const mult=(a, b)=>{\n let res = new Array(a.length);\n for (let r = 0; r < a.length; ++r) {\n res[r] = new Array(b[0].length);\n for (let c = 0; c < b[0].length; ++c) {\n res[r][c] = 0;\n for (let i = 0; i < a[0].length; ++i)\n res[r][c] += a[r][i] * b[i][c];\n }\n }\n return res;\n}\n\nconst lu = (mat) => {\n let lower = [],upper = [],n=mat.length;;\n for(let i=0;i<n;i++){\n lower.push([]);\n upper.push([]);\n for(let j=0;j<n;j++){\n lower[i].push(0);\n upper[i].push(0);\n }\n }\n for (let i = 0; i < n; i++) {\n for (let k = i; k < n; k++){\n let sum = 0;\n for (let j = 0; j < i; j++)\n sum += (lower[i][j] * upper[j][k]);\n upper[i][k] = mat[i][k] - sum;\n }\n for (let k = i; k < n; k++) {\n if (i == k)\n lower[i][i] = 1;\n else{\n let sum = 0;\n for (let j = 0; j < i; j++)\n sum += (lower[k][j] * upper[j][i]);\n lower[k][i] = (mat[k][i] - sum) / upper[i][i];\n }\n }\n }\n return [lower,upper];\n}\n\nconst pivot = (m) =>{\n let n = m.length;\n let id = [];\n for(let i=0;i<n;i++){\n id.push([]);\n for(let j=0;j<n;j++){\n if(i===j)\n id[i].push(1);\n else\n id[i].push(0);\n }\n }\n for (let i = 0; i < n; i++) {\n let maxm = m[i][i];\n let row = i;\n for (let j = i; j < n; j++)\n if (m[j][i] > maxm) {\n maxm = m[j][i];\n row = j;\n }\n if (i != row) {\n let tmp = id[i];\n id[i] = id[row];\n id[row] = tmp;\n }\n }\n return id;\n}\n\nconst luDecomposition=(A)=>{\n const P = pivot(A);\n A = mult(P,A);\n return [...lu(A),P];\n}\n","language":"JavaScript"},{"code":"# Create an m x n matrix\ndef matrix(m; n; init):\n if m == 0 then []\n elif m == 1 then [range(0;n)] | map(init)\n elif m > 0 then\n matrix(1;n;init) as $row\n | [range(0;m)] | map( $row )\n else error(\"matrix\\(m);_;_) invalid\")\n end ;\n\ndef I(n): matrix(n;n;0) as $m\n | reduce range(0;n) as $i ($m; . | setpath( [$i,$i]; 1));\n\ndef dot_product(a; b):\n reduce range(0;a|length) as $i (0; . + (a[$i] * b[$i]) );\n\n# transpose/0 expects its input to be a rectangular matrix\ndef transpose:\n if (.[0] | length) == 0 then []\n else [map(.[0])] + (map(.[1:]) | transpose)\n end ;\n\n# A and B should both be numeric matrices, A being m by n, and B being n by p.\ndef multiply(A; B):\n (B[0]|length) as $p\n | (B|transpose) as $BT\n | reduce range(0; A|length) as $i\n ([];\n reduce range(0; $p) as $j\n (.;\n .[$i][$j] = dot_product( A[$i]; $BT[$j] ) ));\n\ndef swap_rows(i;j):\n if i == j then .\n else .[i] as $i | .[i] = .[j] | .[j] = $i\n end ;\n\n# Print a matrix neatly, each cell occupying n spaces, but without truncation\ndef neatly(n):\n def right: tostring | ( \" \" * (n-length) + .);\n . as $in\n | length as $length\n | reduce range (0;$length) as $i\n (\"\"; . + reduce range(0;$length) as $j\n (\"\"; \"\\(.) \\($in[$i][$j] | right )\" ) + \"\\n\" ) ;\n","language":"Jq"},{"code":"# Create the pivot matrix for the input matrix.\n# Use \"range(0;$n) as $i\" to handle ill-conditioned cases.\ndef pivotize:\n def abs: if .<0 then -. else . end;\n length as $n\n | . as $m\n | reduce range(0;$n) as $j\n (I($n);\n # state: [row; max]\n (reduce range(0; $n) as $i\n ([$j, $m[$j][$j]|abs ];\n ($m[$i][$j]|abs) as $a\n | if $a > .[1] then [ $i, $a ] else . end) | .[0]) as $row\n | swap_rows( $j; $row)\n ) ;\n\n# Decompose the input nxn matrix A by PA=LU and return [L, U, P].\ndef lup:\n def div(i;j):\n if j == 0 then if i==0 then 0 else error(\"\\(i)/0\") end\n else i/j\n end;\n . as $A\n | length as $n\n | I($n) as $L # matrix($n; $n; 0.0) as $L\n | matrix($n; $n; 0.0) as $U\n | ($A|pivotize) as $P\n | multiply($P;$A) as $A2\n # state: [L, U]\n | reduce range(0; $n) as $i ( [$L, $U];\n reduce range(0; $n) as $j (.;\n .[0] as $L\n | .[1] as $U\n | if ($j >= $i) then\n (reduce range(0;$i) as $k (0; . + ($U[$k][$j] * $L[$i][$k] ))) as $s1\n | [$L, ($U| setpath([$i,$j]; ($A2[$i][$j] - $s1))) ]\n else\n (reduce range(0;$j) as $k (0; . + ($U[$k][$j] * $L[$i][$k]))) as $s2\n | [ ($L | setpath([$i,$j]; div(($A2[$i][$j] - $s2) ; $U[$j][$j] ))), $U ]\n end ))\n | . + [ $P ]\n;\n","language":"Jq"},{"code":"def a: [[1, 3, 5], [2, 4, 7], [1, 1, 0]];\na | lup[] | neatly(4)\n","language":"Jq"},{"code":" $ /usr/local/bin/jq -M -n -r -f LU.jq\n 1 0 0\n 0.5 1 0\n 0.5 -1 1\n\n 2 4 7\n 0 1 1.5\n 0 0 -2\n\n 0 1 0\n 1 0 0\n 0 0 1\n","language":"Jq"},{"code":"def b: [[11,9,24,2],[1,5,2,6],[3,17,18,1],[2,5,7,1]];\nb | lup[] | neatly(21)\n","language":"Jq"},{"code":"$ /usr/local/bin/jq -M -n -r -f LU.jq\n 1 0 0 0\n 0.2727272727272727 1 0 0\n 0.09090909090909091 0.2875 1 0\n 0.18181818181818182 0.23124999999999996 0.0035971223021580693 1\n\n 11 9 24 2\n 0 14.545454545454547 11.454545454545455 0.4545454545454546\n 0 0 -3.4749999999999996 5.6875\n 0 0 0 0.510791366906476\n\n 1 0 0 0\n 0 0 1 0\n 0 1 0 0\n 0 0 0 1\n","language":"Jq"},{"code":"# A|lup|verify(A) should be true\ndef verify(A):\n .[0] as $L | .[1] as $U | .[2] as $P\n | multiply($P; A) == multiply($L; $U);\n\ndef A:\n [[1, 1, 1, 1],\n [1, 1, -1, -1],\n [1, -1, 0, 0],\n [0, 0, 1, -1]];\n\nA|lup|verify(A)\n","language":"Jq"},{"code":"// version 1.1.4-3\n\ntypealias Vector = DoubleArray\ntypealias Matrix = Array<Vector>\n\noperator fun Matrix.times(other: Matrix): Matrix {\n val rows1 = this.size\n val cols1 = this[0].size\n val rows2 = other.size\n val cols2 = other[0].size\n require(cols1 == rows2)\n val result = Matrix(rows1) { Vector(cols2) }\n for (i in 0 until rows1) {\n for (j in 0 until cols2) {\n for (k in 0 until rows2) {\n result[i][j] += this[i][k] * other[k][j]\n }\n }\n }\n return result\n}\n\nfun pivotize(m: Matrix): Matrix {\n val n = m.size\n val im = Array(n) { Vector(n) }\n for (i in 0 until n) im[i][i] = 1.0\n for (i in 0 until n) {\n var max = m[i][i]\n var row = i\n for (j in i until n) {\n if (m[j][i] > max) {\n max = m[j][i]\n row = j\n }\n }\n if (i != row) {\n val t = im[i]\n im[i] = im[row]\n im[row] = t\n }\n }\n return im\n}\n\nfun lu(a: Matrix): Array<Matrix> {\n val n = a.size\n val l = Array(n) { Vector(n) }\n val u = Array(n) { Vector(n) }\n val p = pivotize(a)\n val a2 = p * a\n\n for (j in 0 until n) {\n l[j][j] = 1.0\n for (i in 0 until j + 1) {\n var sum = 0.0\n for (k in 0 until i) sum += u[k][j] * l[i][k]\n u[i][j] = a2[i][j] - sum\n }\n for (i in j until n) {\n var sum2 = 0.0\n for(k in 0 until j) sum2 += u[k][j] * l[i][k]\n l[i][j] = (a2[i][j] - sum2) / u[j][j]\n }\n }\n return arrayOf(l, u, p)\n}\n\nfun printMatrix(title: String, m: Matrix, f: String) {\n val n = m.size\n println(\"\\n$title\\n\")\n for (i in 0 until n) {\n for (j in 0 until n) print(\"${f.format(m[i][j])} \")\n println()\n }\n}\n\nfun main(args: Array<String>) {\n val a1 = arrayOf(\n doubleArrayOf( 1.0, 3.0, 5.0),\n doubleArrayOf( 2.0, 4.0, 7.0),\n doubleArrayOf( 1.0, 1.0, 0.0)\n )\n val (l1, u1, p1) = lu(a1)\n println(\"EXAMPLE 1:-\")\n printMatrix(\"A:\", a1, \"%1.0f\")\n printMatrix(\"L:\", l1, \"% 7.5f\")\n printMatrix(\"U:\", u1, \"% 8.5f\")\n printMatrix(\"P:\", p1, \"%1.0f\")\n\n val a2 = arrayOf(\n doubleArrayOf(11.0, 9.0, 24.0, 2.0),\n doubleArrayOf( 1.0, 5.0, 2.0, 6.0),\n doubleArrayOf( 3.0, 17.0, 18.0, 1.0),\n doubleArrayOf( 2.0, 5.0, 7.0, 1.0)\n )\n val (l2, u2, p2) = lu(a2)\n println(\"\\nEXAMPLE 2:-\")\n printMatrix(\"A:\", a2, \"%2.0f\")\n printMatrix(\"L:\", l2, \"%7.5f\")\n printMatrix(\"U:\", u2, \"%8.5f\")\n printMatrix(\"P:\", p2, \"%1.0f\")\n}\n","language":"Kotlin"},{"code":"import std\n\n// derived from JAMA v1.03\n\n// rectangular input array A is transformed in place to LU form\n\ndef LUDecomposition(LU):\n // Use a \"left-looking\", dot-product, Crout/Doolittle algorithm.\n let m = LU.length\n let n = LU[0].length\n let piv = map(m): _\n var pivsign = 1\n let LUcolj = map(m): 0.0\n // Outer loop.\n for(n) j:\n // Make a copy of the j-th column to localize references\n for(m) i:\n LUcolj[i] = LU[i][j]\n // Apply previous transformations\n for(m) i:\n let LUrowi = LU[i]\n // Most of the time is spent in the following dot product\n let kmax = min(i,j)\n var s = 0.0\n for(kmax) k:\n s += LUrowi[k] * LUcolj[k]\n s = LUcolj[i] - s\n LUcolj[i] = s\n LUrowi[j] = s\n // Find pivot and exchange if necessary.\n var p = j\n var i = j+1\n while i < m:\n if abs(LUcolj[i]) > abs(LUcolj[p]):\n p = i\n i += 1\n if p != j:\n for(n) k:\n let t = LU[p][k]\n LU[p][k] = LU[j][k]\n LU[j][k] = t\n let k = piv[p]\n piv[p] = piv[j]\n piv[j] = k\n pivsign = -pivsign\n // Compute multipliers.\n if j < m and LU[j][j] != 0.0:\n i = j+1\n while i < m:\n LU[i][j] /= LU[j][j]\n i += 1\n return piv\n\ndef print_A(A):\n print \"A:\"\n for(A) row:\n print row\n\ndef print_L(LU):\n print \"L:\"\n for(LU) lurow, i:\n let row = map(lurow.length): 0.0\n for(lurow) x, j:\n if i > j:\n row[j] = x\n else: if i == j:\n row[j] = 1.0\n print row\n\ndef print_U(LU):\n print \"U:\"\n for(LU) lurow, i:\n let row = map(lurow.length): 0.0\n for(lurow) x, j:\n if i <= j:\n row[j] = x\n print row\n\ndef print_P(piv):\n print \"P:\"\n for(piv) j:\n let row = map(piv.length): 0\n row[j] = 1\n print row\n\nvar A = [[1., 3., 5.],\n [2., 4., 7.],\n [1., 1., 0.]]\n\nprint_A A\nvar piv = LUDecomposition(A)\nprint_L A\nprint_U A\nprint_P piv\n\nA = [[11., 9., 24., 2.],\n [ 1., 5., 2., 6.],\n [ 3., 17., 18., 1.],\n [ 2., 5., 7., 1.]]\n\nprint_A A\npiv = LUDecomposition(A)\nprint_L A\nprint_U A\nprint_P piv\n","language":"Lobster"},{"code":"A:=<<1.0|3.0|5.0>,<2.0|4.0|7.0>,<1.0|1.0|0.0>>:\n\nLinearAlgebra:-LUDecomposition(A);\n","language":"Maple"},{"code":"A:=<<11.0|9.0|24.0|2.0>,<1.0|5.0|2.0|6.0>,\n <3.0|17.0|18.0|1.0>,<2.0|5.0|7.0|1.0>>:\n\nwith(LinearAlgebra):\n\nLUDecomposition(A);\n","language":"Maple"},{"code":"(*Ex1*)a = {{1, 3, 5}, {2, 4, 7}, {1, 1, 0}};\n{lu, p, c} = LUDecomposition[a];\nl = LowerTriangularize[lu, -1] + IdentityMatrix[Length[p]];\nu = UpperTriangularize[lu];\nP = Part[IdentityMatrix[Length[p]], p] ;\nMatrixForm /@ {P.a , P, l, u, l.u}\n\n(*Ex2*)a = {{11, 9, 24, 2}, {1, 5, 2, 6}, {3, 17, 18, 1}, {2, 5, 7, 1}};\n{lu, p, c} = LUDecomposition[a];\nl = LowerTriangularize[lu, -1] + IdentityMatrix[Length[p]];\nu = UpperTriangularize[lu];\nP = Part[IdentityMatrix[Length[p]], p] ;\nMatrixForm /@ {P.a , P, l, u, l.u}\n","language":"Mathematica"},{"code":" A = [\n 1 3 5\n 2 4 7\n 1 1 0];\n\n [L,U,P] = lu(A)\n","language":"MATLAB"},{"code":" A = [\n 11 9 24 2\n 1 5 2 6\n 3 17 18 1\n 2 5 7 1 ];\n\n [L,U,P] = lu(A)\n","language":"MATLAB"},{"code":"function [ P, L, U ] = LUdecomposition(A)\n\n% Ensures A is n by n\nsz = size(A);\nif sz(1)~=sz(2)\n fprintf('A is not n by n\\n');\n clear x;\n return;\nend\n\nn = sz(1);\nL = eye(n);\nP = eye(n);\nU = A;\n\nfor i=1:sz(1)\n\n % Row reducing\n if U(i,i)==0\n maximum = max(abs(U(i:end,1)));\n for k=1:n\n if maximum == abs(U(k,i))\n temp = U(1,:);\n U(1,:) = U(k,:);\n U(k,:) = temp;\n\n temp = P(:,1);\n P(1,:) = P(k,:);\n P(k,:) = temp;\n end\n end\n\n end\n\n if U(i,i)~=1\n temp = eye(n);\n temp(i,i)=U(i,i);\n L = L * temp;\n U(i,:) = U(i,:)/U(i,i); %Ensures the pivots are 1.\n end\n\n if i~=sz(1)\n\n for j=i+1:length(U)\n temp = eye(n);\n temp(j,i) = U(j,i);\n L = L * temp;\n U(j,:) = U(j,:)-U(j,i)*U(i,:);\n\n end\n end\n\n\nend\nP = P';\nend\n","language":"MATLAB"},{"code":"/* LU decomposition is built-in */\n\na: hilbert_matrix(4)$\n\n/* LU in \"packed\" form */\n\nlup: lu_factor(a);\n/* [matrix([1, 1/2, 1/3, 1/4 ],\n [1/2, 1/12, 1/12, 3/40 ],\n [1/3, 1, 1/180, 1/120 ],\n [1/4, 9/10, 3/2, 1/2800]),\n [1, 2, 3, 4], generalring] */\n\n/* extract actual factors */\n\nget_lu_factors(lup);\n/* [matrix([1, 0, 0, 0],\n [0, 1, 0, 0],\n [0, 0, 1, 0],\n [0, 0, 0, 1]),\n\n matrix([1, 0, 0, 0],\n [1/2, 1, 0, 0],\n [1/3, 1, 1, 0],\n [1/4, 9/10, 3/2, 1]),\n\n matrix([1, 1/2, 1/3, 1/4 ],\n [0, 1/12, 1/12, 3/40 ],\n [0, 0, 1/180, 1/120 ],\n [0, 0, 0, 1/2800])\n ] */\n\n/* solve for a given right-hand side */\n\nlu_backsub(lup, transpose([1, 1, -1, -1]));\n/* matrix([-204], [2100], [-4740], [2940]) */\n","language":"Maxima"},{"code":"import macros, strutils\nimport strfmt\n\ntype\n\n Matrix[M, N: static int] = array[1..M, array[1..N, float]]\n SquareMatrix[N: static int] = Matrix[N, N]\n\n\n# Templates to allow to use more natural notation for indexing.\ntemplate `[]`(m: Matrix; i, j: int): float = m[i][j]\ntemplate `[]=`(m: Matrix; i, j: int; val: float) = m[i][j] = val\n\n\nfunc `*`[M, N, P: static int](a: Matrix[M, N]; b: Matrix[N, P]): Matrix[M, P] =\n ## Matrix multiplication.\n for i in 1..M:\n for j in 1..P:\n for k in 1..N:\n result[i, j] += a[i, k] * b[k, j]\n\n\nfunc pivotize[N: static int](m: SquareMatrix[N]): SquareMatrix[N] =\n\n for i in 1..N: result[i, i] = 1\n\n for i in 1..N:\n var max = m[i, i]\n var row = i\n for j in i..N:\n if m[j, i] > max:\n max = m[j, i]\n row = j\n if i != row:\n swap result[i], result[row]\n\n\nfunc lu[N: static int](m: SquareMatrix[N]): tuple[l, u, p: SquareMatrix[N]] =\n\n result.p = m.pivotize()\n let m2 = result.p * m\n\n for j in 1..N:\n result.l[j, j] = 1\n for i in 1..j:\n var sum = 0.0\n for k in 1..<i: sum += result.u[k, j] * result.l[i, k]\n result.u[i, j] = m2[i, j] - sum\n for i in j..N:\n var sum = 0.0\n for k in 1..<j: sum += result.u[k, j] * result.l[i, k]\n result.l[i, j] = (m2[i, j] - sum) / result.u[j, j]\n\n\nproc print(m: Matrix; title, f: string) =\n echo '\\n', title\n for i in 1..m.N:\n for j in 1..m.N:\n stdout.write m[i, j].format(f), \" \"\n stdout.write '\\n'\n\n\nwhen isMainModule:\n\n const A1: SquareMatrix[3] = [[1.0, 3.0, 5.0],\n [2.0, 4.0, 7.0],\n [1.0, 1.0, 0.0]]\n\n let (l1, u1, p1) = A1.lu()\n echo \"\\nExample 2:\"\n A1.print(\"A:\", \"1.0f\")\n l1.print(\"L:\", \"8.5f\")\n u1.print(\"U:\", \"8.5f\")\n p1.print(\"P:\", \"1.0f\")\n\n\n const A2: SquareMatrix[4] = [[11.0, 9.0, 24.0, 2.0],\n [ 1.0, 5.0, 2.0, 6.0],\n [ 3.0, 17.0, 18.0, 1.0],\n [ 2.0, 5.0, 7.0, 1.0]]\n\n let (l2, u2, p2) = A2.lu()\n echo \"Example 1:\"\n A2.print(\"A:\", \"2.0f\")\n l2.print(\"L:\", \"8.5f\")\n u2.print(\"U:\", \"8.5f\")\n p2.print(\"P:\", \"1.0f\")\n","language":"Nim"},{"code":"matlup(M) =\n{\n my (L = matid(#M), U = M, P = L);\n\n for (i = 1, #M-1, \\\\ pivoting\n p = M[z=i,i];\n for (k = i, #M, if (M[k,i] > p, p = M[z=k,i]));\n\n if (i != z, \\\\ swap rows\n k = U[i,]; U[i,] = U[z,]; U[z,] = k;\n k = P[i,]; P[i,] = P[z,]; P[z,] = k;\n );\n );\n\n for (i = 1, #M-1, \\\\ decompose\n for (k = i+1, #M,\n L[k,i] = U[k,i] / U[i,i];\n for (j = i, #M, U[k,j] -= L[k,i] * U[i,j])\n )\n );\n\n [L,U,P] \\\\ return L,U,P triple matrix\n}\n","language":"PARI-GP"},{"code":"use List::Util qw(sum);\n\nfor $test (\n [[1, 3, 5],\n [2, 4, 7],\n [1, 1, 0]],\n\n [[11, 9, 24, 2],\n [ 1, 5, 2, 6],\n [ 3, 17, 18, 1],\n [ 2, 5, 7, 1]]\n) {\n my($P, $AP, $L, $U) = lu(@$test);\n say_it('A matrix', @$test);\n say_it('P matrix', @$P);\n say_it('AP matrix', @$AP);\n say_it('L matrix', @$L);\n say_it('U matrix', @$U);\n\n}\n\nsub lu {\n my (@a) = @_;\n my $n = +@a;\n my @P = pivotize(@a);\n my $AP = mmult(\\@P, \\@a);\n my @L = matrix_ident($n);\n my @U = matrix_zero($n);\n for $i (0..$n-1) {\n for $j (0..$n-1) {\n if ($j >= $i) {\n $U[$i][$j] = $$AP[$i][$j] - sum map { $U[$_][$j] * $L[$i][$_] } 0..$i-1;\n } else {\n $L[$i][$j] = ($$AP[$i][$j] - sum map { $U[$_][$j] * $L[$i][$_] } 0..$j-1) / $U[$j][$j];\n }\n }\n }\n return \\@P, $AP, \\@L, \\@U;\n}\n\nsub pivotize {\n my(@m) = @_;\n my $size = +@m;\n my @id = matrix_ident($size);\n for $i (0..$size-1) {\n my $max = $m[$i][$i];\n my $row = $i;\n for $j ($i .. $size-2) {\n if ($m[$j][$i] > $max) {\n $max = $m[$j][$i];\n $row = $j;\n }\n }\n ($id[$row],$id[$i]) = ($id[$i],$id[$row]) if $row != $i;\n }\n @id\n}\n\nsub matrix_zero { my($n) = @_; map { [ (0) x $n ] } 0..$n-1 }\nsub matrix_ident { my($n) = @_; map { [ (0) x $_, 1, (0) x ($n-1 - $_) ] } 0..$n-1 }\n\nsub mmult {\n local *a = shift;\n local *b = shift;\n my @p = [];\n my $rows = @a;\n my $cols = @{ $b[0] };\n my $n = @b - 1;\n for (my $r = 0 ; $r < $rows ; ++$r) {\n for (my $c = 0 ; $c < $cols ; ++$c) {\n $p[$r][$c] += $a[$r][$_] * $b[$_][$c] foreach 0 .. $n;\n }\n }\n return [@p];\n}\n\nsub say_it {\n my($message, @array) = @_;\n print \"$message\\n\";\n $line = sprintf join(\"\\n\" => map join(\" \" => map(sprintf(\"%8.5f\", $_), @$_)), @{+\\@array}).\"\\n\";\n $line =~ s/\\.00000/ /g;\n $line =~ s/0000\\b/ /g;\n print \"$line\\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;\">matrix_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">b</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;\">a</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: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</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;\">if</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">c</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: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</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: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</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;\">a</span><span style=\"color: #0000FF;\">)</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: #7060A8;\">length</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: #008080;\">do</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;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">c</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: #0000FF;\">+=</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]*</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">j</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: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">c</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;\">pivotize</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">m</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: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">im</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: #000000;\">0</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: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">im</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: #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: #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;\">atom</span> <span style=\"color: #000000;\">mx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">m</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>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">row</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">i</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: #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;\">m</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;\">mx</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">mx</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;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">row</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">j</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;\">i</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">row</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">im</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">im</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">row</span><span style=\"color: #0000FF;\">]}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">im</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">row</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">im</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;\">return</span> <span style=\"color: #000000;\">im</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;\">lu</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">a</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: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">l</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: #000000;\">0</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;\">u</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: #000000;\">0</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;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pivotize</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">a2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">matrix_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">)</span>\n\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: #000000;\">l</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: #0000FF;\">=</span> <span style=\"color: #000000;\">1.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: #000000;\">j</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">sum1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0.0</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: #000000;\">i</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">sum1</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">u</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</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;\">l</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">u</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: #0000FF;\">=</span> <span style=\"color: #000000;\">a2</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: #0000FF;\">-</span> <span style=\"color: #000000;\">sum1</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;\">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;\">atom</span> <span style=\"color: #000000;\">sum2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0.0</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: #000000;\">j</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">sum2</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">u</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</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;\">l</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">l</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: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a2</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: #0000FF;\">-</span> <span style=\"color: #000000;\">sum2</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">/</span> <span style=\"color: #000000;\">u</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>\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: #0000FF;\">{</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">u</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">p</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;\">a</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;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5</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;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7</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;\">0</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{{</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">24</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;\">1</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: #000000;\">6</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">17</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>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7</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;\">a</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"== a,l,u,p: ==\"</span>\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lu</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</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><span style=\"color: #004600;\">pp_Pause</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;\">for</span>\n<!--\n","language":"Phix"},{"code":"(subscriptrange, fofl, size): /* 2 Nov. 2013 */\nLU_Decomposition: procedure options (main);\n declare a1(3,3) float (18) initial ( 1, 3, 5,\n 2, 4, 7,\n 1, 1, 0);\n declare a2(4,4) float (18) initial (11, 9, 24, 2,\n 1, 5, 2, 6,\n 3, 17, 18, 1,\n 2, 5, 7, 1);\n call check(a1);\n call check(a2);\n\n\n/* In-situ decomposition */\nLU: procedure(a, p);\n declare a(*,*) float (18);\n declare p(*) fixed binary;\n declare (maximum, rtemp) float (18);\n declare (n, i, j, k, ii, temp) fixed binary;\n\n n = hbound(a,1);\n do i = 1 to n; p(i) = i; end;\n\n do k = 1 to n-1;\n\n maximum = 0; ii = k;\n do i = k to n;\n if maximum < abs(a(p(i),k)) then\n do; maximum = abs(a(p(i),k)); ii = i; end;\n end;\n if ii ^= k then do; temp = p(k); p(k) = p(ii); p(ii) = temp; end;\n\n do i = k+1 to n; a(p(i),k) = a(p(i),k) / a(p(k),k); end;\n\n do j = k+1 to n;\n do i = k+1 to n;\n a(p(i),j) = a(p(i),j) - a(p(i),k) * a(p(k),j);\n end;\n end;\n\n end;\nend LU;\n\nCHECK: procedure(a);\n declare a(*,*) float (18) nonassignable;\n\n declare aa(hbound(a,1), hbound(a,2)) float (18);\n declare L(hbound(a,1), hbound(a,2)) float (18);\n declare U(hbound(a,1), hbound(a,2)) float (18);\n declare (p(hbound(a,1), hbound(a,2)), ipiv(hbound(a,1)) ) fixed binary;\n declare pp(hbound(a,1), hbound(a,2)) fixed binary;\n declare (i, j, n, temp(hbound(a,1))) fixed binary;\n\n n = hbound(a,1);\n aa = A; /* work with a copy */\n P = 0; L = 0; U = 0;\n do i = 1 to n;\n p(i,i) = 1; L(i,i) = 1; /* convert permutation vector to a matrix */\n end;\n\n call LU(aa, ipiv);\n\n do i = 1 to n;\n do j = 1 to i-1; L(i,j) = aa(ipiv(i),j); end;\n do j = i to n; U(i,j) = aa(ipiv(i),j); end;\n end;\n\n pp = p;\n do i = 1 to n;\n p(ipiv(i), *) = pp(i,*);\n end;\n\n put skip list ('A');\n put edit (A) (skip, (n) f(10,5));\n\n put skip list ('P');\n put edit (P) (skip, (n) f(11));\n\n put skip list ('L');\n put edit (L) (skip, (n) f(10,5));\n\n put skip list ('U');\n put edit (U) (skip, (n) f(10,5));\n\nend CHECK;\n\nend LU_Decomposition;\n","language":"PL-I"},{"code":"from pprint import pprint\n\ndef matrixMul(A, B):\n TB = zip(*B)\n return [[sum(ea*eb for ea,eb in zip(a,b)) for b in TB] for a in A]\n\ndef pivotize(m):\n \"\"\"Creates the pivoting matrix for m.\"\"\"\n n = len(m)\n ID = [[float(i == j) for i in xrange(n)] for j in xrange(n)]\n for j in xrange(n):\n row = max(xrange(j, n), key=lambda i: abs(m[i][j]))\n if j != row:\n ID[j], ID[row] = ID[row], ID[j]\n return ID\n\ndef lu(A):\n \"\"\"Decomposes a nxn matrix A by PA=LU and returns L, U and P.\"\"\"\n n = len(A)\n L = [[0.0] * n for i in xrange(n)]\n U = [[0.0] * n for i in xrange(n)]\n P = pivotize(A)\n A2 = matrixMul(P, A)\n for j in xrange(n):\n L[j][j] = 1.0\n for i in xrange(j+1):\n s1 = sum(U[k][j] * L[i][k] for k in xrange(i))\n U[i][j] = A2[i][j] - s1\n for i in xrange(j, n):\n s2 = sum(U[k][j] * L[i][k] for k in xrange(j))\n L[i][j] = (A2[i][j] - s2) / U[j][j]\n return (L, U, P)\n\na = [[1, 3, 5], [2, 4, 7], [1, 1, 0]]\nfor part in lu(a):\n pprint(part, width=19)\n print\nprint\nb = [[11,9,24,2],[1,5,2,6],[3,17,18,1],[2,5,7,1]]\nfor part in lu(b):\n pprint(part)\n print\n","language":"Python"},{"code":"library(Matrix)\nA <- matrix(c(1, 3, 5, 2, 4, 7, 1, 1, 0), 3, 3, byrow=T)\ndim(A) <- c(3, 3)\nexpand(lu(A))\n","language":"R"},{"code":"#lang racket\n(require math)\n(define A (matrix\n [[1 3 5]\n [2 4 7]\n [1 1 0]]))\n\n(matrix-lu A)\n; result:\n; (mutable-array #[#[1 0 0]\n; #[2 1 0]\n; #[1 1 1]])\n; (mutable-array #[#[1 3 5]\n; #[0 -2 -3]\n; #[0 0 -2]])\n","language":"Racket"},{"code":"for ( [1, 3, 5], # Test Matrices\n [2, 4, 7],\n [1, 1, 0]\n ),\n ( [11, 9, 24, 2],\n [ 1, 5, 2, 6],\n [ 3, 17, 18, 1],\n [ 2, 5, 7, 1]\n )\n -> @test {\n say-it 'A Matrix', @test;\n say-it( .[0], @(.[1]) ) for 'P Matrix', 'Aʼ Matrix', 'L Matrix', 'U Matrix' Z, lu @test;\n}\n\nsub lu (@a) {\n die unless @a.&is-square;\n my $n = @a;\n my @P = pivotize @a;\n my @Aʼ = mmult @P, @a;\n my @L = matrix-ident $n;\n my @U = matrix-zero $n;\n for ^$n X ^$n -> ($i,$j) {\n if $j ≥ $i { @U[$i;$j] = @Aʼ[$i;$j] - [+] map { @U[$_;$j] × @L[$i;$_] }, ^$i }\n else { @L[$i;$j] = (@Aʼ[$i;$j] - [+] map { @U[$_;$j] × @L[$i;$_] }, ^$j) / @U[$j;$j] }\n }\n @P, @Aʼ, @L, @U;\n}\n\nsub pivotize (@m) {\n my $size = @m;\n my @id = matrix-ident $size;\n for ^$size -> $i {\n my $max = @m[$i;$i];\n my $row = $i;\n for $i ..^ $size -> $j {\n if @m[$j;$i] > $max {\n $max = @m[$j;$i];\n $row = $j;\n }\n }\n @id[$row, $i] = @id[$i, $row] if $row != $i;\n }\n @id\n}\n\nsub is-square (@m) { so @m == all @m }\n\nsub matrix-zero ($n, $m = $n) { map { [ flat 0 xx $n ] }, ^$m }\n\nsub matrix-ident ($n) { map { [ flat 0 xx $_, 1, 0 xx $n - 1 - $_ ] }, ^$n }\n\nsub mmult(@a,@b) {\n my @p;\n for ^@a X ^@b[0] -> ($r, $c) {\n @p[$r;$c] += @a[$r;$_] × @b[$_;$c] for ^@b;\n }\n @p\n}\n\nsub rat-int ($num) {\n return $num unless $num ~~ Rat;\n return $num.narrow if $num.narrow ~~ Int;\n $num.nude.join: '/';\n\n}\n\nsub say-it ($message, @array) {\n say \"\\n$message\";\n $_».&rat-int.fmt(\"%7s\").say for @array;\n}\n","language":"Raku"},{"code":"/*REXX program creates a matrix from console input, performs/shows LU decomposition.*/\n#= 0; P.= 0; PA.= 0; L.= 0; U.= 0 /*initialize some variables to zero. */\nparse arg x /*obtain matrix elements from the C.L. */\n call bldAMat; call showMat 'A' /*build and display A matrix.*/\n call bldPmat; call showMat 'P' /* \" \" \" P \" */\n call multMat; call showMat 'PA' /* \" \" \" PA \" */\n do y=1 for N; call bldUmat; call bldLmat /*build U and L \" */\n end /*y*/\n call showMat 'L'; call showMat 'U' /*display L and U \" */\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nbldAMat: ?= words(x); do N=1 for ? until N**2>=? /*find matrix size. */\n end /*N*/\n if N**2\\==? then do; say '***error*** wrong # of elements entered:' ?; exit 9\n end\n do r=1 for N /*build A matrix.*/\n do c=1 for N; #= # + 1; _= word(x, #); A.r.c= _\n if \\datatype(_, 'N') then call er \"element isn't numeric: \" _\n end /*c*/\n end /*r*/; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nbldLmat: do r=1 for N /*build lower matrix.*/\n do c=1 for N; if r==c then do; L.r.c= 1; iterate; end\n if c\\==y | r==c | c>r then iterate\n _= PA.r.c\n do k=1 for c-1; _= _ - U.k.c * L.r.k\n end /*k*/\n L.r.c= _ / U.c.c\n end /*c*/\n end /*r*/; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nbldPmat: c= N; do r=N by -1 for N; P.r.c= 1; c= c + 1 /*build perm. matrix.*/\n if c>N then c= N%2; if c==N then c= 1\n end /*r*/; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nbldUmat: do r=1 for N; if r\\==y then iterate /*build upper matrix.*/\n do c=1 for N; if c<r then iterate\n _= PA.r.c\n do k=1 for r-1; _= _ - U.k.c * L.r.k\n end /*k*/\n U.r.c= _ / 1\n end /*c*/\n end /*r*/; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nmultMat: do i=1 for N /*multiply matrix P and A ──► PA */\n do j=1 for N\n do k=1 for N; pa.i.j= (pa.i.j + p.i.k * a.k.j) / 1\n end /*k*/\n end /*j*/ /*÷ by one does normalization [↑]. */\n end /*i*/; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nshowMat: parse arg mat,rows,cols; say; rows= word(rows N,1); cols= word(cols rows,1)\n w= 0; do r=1 for rows\n do c=1 for cols; w= max(w, length( value( mat'.'r\".\"c ) ) )\n end /*c*/\n end /*r*/\n say center(mat 'matrix', cols * (w + 1) + 7, \"─\") /*display the header.*/\n do r=1 for rows; _=\n do c=1 for cols; _= _ right( value(mat'.'r\".\"c), w + 1)\n end /*c*/\n say _\n end /*r*/; return\n","language":"REXX"},{"code":"require 'matrix'\n\nclass Matrix\n def lu_decomposition\n p = get_pivot\n tmp = p * self\n u = Matrix.zero(row_size).to_a\n l = Matrix.identity(row_size).to_a\n (0 ... row_size).each do |i|\n (0 ... row_size).each do |j|\n if j >= i\n # upper\n u[i][j] = tmp[i,j] - (0 ... i).inject(0.0) {|sum, k| sum + u[k][j] * l[i][k]}\n else\n # lower\n l[i][j] = (tmp[i,j] - (0 ... j).inject(0.0) {|sum, k| sum + u[k][j] * l[i][k]}) / u[j][j]\n end\n end\n end\n [ Matrix[*l], Matrix[*u], p ]\n end\n\n def get_pivot\n raise ArgumentError, \"must be square\" unless square?\n id = Matrix.identity(row_size).to_a\n (0 ... row_size).each do |i|\n max = self[i,i]\n row = i\n (i ... row_size).each do |j|\n if self[j,i] > max\n max = self[j,i]\n row = j\n end\n end\n id[i], id[row] = id[row], id[i]\n end\n Matrix[*id]\n end\n\n def pretty_print(format, head=nil)\n puts head if head\n puts each_slice(column_size).map{|row| format*row_size % row}\n end\nend\n\nputs \"Example 1:\"\na = Matrix[[1, 3, 5],\n [2, 4, 7],\n [1, 1, 0]]\na.pretty_print(\" %2d\", \"A\")\nl, u, p = a.lu_decomposition\nl.pretty_print(\" %8.5f\", \"L\")\nu.pretty_print(\" %8.5f\", \"U\")\np.pretty_print(\" %d\", \"P\")\n\nputs \"\\nExample 2:\"\na = Matrix[[11, 9,24,2],\n [ 1, 5, 2,6],\n [ 3,17,18,1],\n [ 2, 5, 7,1]]\na.pretty_print(\" %2d\", \"A\")\nl, u, p = a.lu_decomposition\nl.pretty_print(\" %8.5f\", \"L\")\nu.pretty_print(\" %8.5f\", \"U\")\np.pretty_print(\" %d\", \"P\")\n","language":"Ruby"},{"code":"l, u, p = a.lup_decomposition\nl.pretty_print(\" %8.5f\", \"L\")\nu.pretty_print(\" %8.5f\", \"U\")\np.pretty_print(\" %d\", \"P\")\n","language":"Ruby"},{"code":"#![allow(non_snake_case)]\nuse ndarray::{Array, Axis, Array2, arr2, Zip, NdFloat, s};\n\nfn main() {\n println!(\"Example 1:\");\n let A: Array2<f64> = arr2(&[\n [1.0, 3.0, 5.0],\n [2.0, 4.0, 7.0],\n [1.0, 1.0, 0.0],\n ]);\n println!(\"A \\n {}\", A);\n let (L, U, P) = lu_decomp(A);\n println!(\"L \\n {}\", L);\n println!(\"U \\n {}\", U);\n println!(\"P \\n {}\", P);\n\n println!(\"\\nExample 2:\");\n let A: Array2<f64> = arr2(&[\n [11.0, 9.0, 24.0, 2.0],\n [1.0, 5.0, 2.0, 6.0],\n [3.0, 17.0, 18.0, 1.0],\n [2.0, 5.0, 7.0, 1.0],\n ]);\n println!(\"A \\n {}\", A);\n let (L, U, P) = lu_decomp(A);\n println!(\"L \\n {}\", L);\n println!(\"U \\n {}\", U);\n println!(\"P \\n {}\", P);\n}\n\nfn pivot<T>(A: &Array2<T>) -> Array2<T>\nwhere T: NdFloat {\n let matrix_dimension = A.rows();\n let mut P: Array2<T> = Array::eye(matrix_dimension);\n for (i, column) in A.axis_iter(Axis(1)).enumerate() {\n // find idx of maximum value in column i\n let mut max_pos = i;\n for j in i..matrix_dimension {\n if column[max_pos].abs() < column[j].abs() {\n max_pos = j;\n }\n }\n // swap rows of P if necessary\n if max_pos != i {\n swap_rows(&mut P, i, max_pos);\n }\n }\n P\n}\n\nfn swap_rows<T>(A: &mut Array2<T>, idx_row1: usize, idx_row2: usize)\nwhere T: NdFloat {\n // to swap rows, get two ArrayViewMuts for the corresponding rows\n // and apply swap elementwise using ndarray::Zip\n let (.., mut matrix_rest) = A.view_mut().split_at(Axis(0), idx_row1);\n let (row0, mut matrix_rest) = matrix_rest.view_mut().split_at(Axis(0), 1);\n let (_matrix_helper, mut matrix_rest) = matrix_rest.view_mut().split_at(Axis(0), idx_row2 - idx_row1 - 1);\n let (row1, ..) = matrix_rest.view_mut().split_at(Axis(0), 1);\n Zip::from(row0).and(row1).apply(std::mem::swap);\n}\n\nfn lu_decomp<T>(A: Array2<T>) -> (Array2<T>, Array2<T>, Array2<T>)\nwhere T: NdFloat {\n\n let matrix_dimension = A.rows();\n assert_eq!(matrix_dimension, A.cols(), \"Tried LU decomposition with a non-square matrix.\");\n let P = pivot(&A);\n let pivotized_A = P.dot(&A);\n\n let mut L: Array2<T> = Array::eye(matrix_dimension);\n let mut U: Array2<T> = Array::zeros((matrix_dimension, matrix_dimension));\n for idx_col in 0..matrix_dimension {\n // fill U\n for idx_row in 0..idx_col+1 {\n U[[idx_row, idx_col]] = pivotized_A[[idx_row, idx_col]] -\n U.slice(s![0..idx_row,idx_col]).dot(&L.slice(s![idx_row,0..idx_row]));\n }\n // fill L\n for idx_row in idx_col+1..matrix_dimension {\n L[[idx_row, idx_col]] = (pivotized_A[[idx_row, idx_col]] -\n U.slice(s![0..idx_col,idx_col]).dot(&L.slice(s![idx_row,0..idx_col]))) /\n U[[idx_col, idx_col]];\n }\n }\n (L, U, P)\n}\n","language":"Rust"},{"code":"use abstalg::*;\npub struct Matrix2D<'a, F>\nwhere\n F: Field,\n{\n field: MatrixRing<F>,\n data: &'a mut Vec<<F as Domain>::Elem>,\n rows: usize,\n cols: usize,\n}\n\nimpl<'a, F: Field + Clone> Matrix2D<'a, F> {\n pub fn new(field: F, data: &'a mut Vec<<F as Domain>::Elem>, rows: usize, cols: usize) -> Self {\n assert_eq!(rows * cols, data.len(), \"Data does not match dimensions\");\n Matrix2D {\n field: MatrixRing::<F>::new(field, rows),\n data,\n rows,\n cols,\n }\n }\n\n pub fn get(&self, row: usize, col: usize) -> &<F as Domain>::Elem {\n assert!(row < self.rows && col < self.cols, \"Index out of bounds\");\n &self.data[row * self.cols + col]\n }\n\n pub fn get_mut(&mut self, row: usize, col: usize) -> &mut <F as Domain>::Elem {\n assert!(row < self.rows && col < self.cols, \"Index out of bounds\");\n &mut self.data[row * self.cols + col]\n }\n\n pub fn get_row(&self, row: usize) -> Vec<<F as Domain>::Elem> {\n assert!(row < self.rows, \"Row index out of bounds\");\n let mut result = Vec::new();\n for col in 0..self.cols {\n result.push(self.get(row, col).clone());\n }\n result\n }\n\n pub fn get_col(&self, col: usize) -> Vec<<F as Domain>::Elem> {\n assert!(col < self.cols, \"Column index out of bounds\");\n let mut result = Vec::new();\n for row in 0..self.rows {\n result.push(self.get(row, col).clone());\n }\n result\n }\n\n pub fn set_row(&mut self, row: usize, new_row: Vec<<F as Domain>::Elem>) {\n assert!(row < self.rows, \"Row index out of bounds\");\n assert_eq!(new_row.len(), self.cols, \"New row has wrong length\");\n for col in 0..self.cols {\n *self.get_mut(row, col) = new_row[col].clone();\n }\n }\n\n pub fn set_col(&mut self, col: usize, new_col: Vec<<F as Domain>::Elem>) {\n assert!(col < self.cols, \"Column index out of bounds\");\n assert_eq!(new_col.len(), self.rows, \"New column has wrong length\");\n for row in 0..self.rows {\n *self.get_mut(row, col) = new_col[row].clone();\n }\n }\n\n pub fn swap_rows(&mut self, row1: usize, row2: usize) {\n assert!(\n row1 < self.rows && row2 < self.rows,\n \"Row index out of bounds\"\n );\n if row1 != row2 {\n for col in 0..self.cols {\n let temp = self.get(row1, col).clone();\n *self.get_mut(row1, col) = self.get(row2, col).clone();\n *self.get_mut(row2, col) = temp;\n }\n }\n }\n pub fn l_u_decomposition(&mut self) -> Result<Vec<<F as Domain>::Elem>, String>\n where\n F: Clone,\n {\n // Let base = field.base()\n let base = self.field.base().clone();\n // Let v_a = VectorAlgebra(base, cols)\n let v_a = VectorAlgebra::new(base.clone(), self.cols);\n // Let the_l_matrix = I (creates an identity matrix)\n let mut the_l_matrix: Vec<_> = self.field.int(1);\n // Let l_matrix = Matrix2D(base, the_l_matrix, rows, cols)\n let mut l_matrix = Matrix2D::new(base.clone(), &mut the_l_matrix, self.rows, self.cols);\n\n // For each pivot in min(rows, cols)\n for pivot in 0..std::cmp::min(self.rows, self.cols) {\n // Let pivot_row = self.get_row(pivot)\n let pivot_row = self.get_row(pivot);\n // If pivot element (pivot_row[pivot]) is zero, LU decomposition is not possible\n if base.is_zero(&pivot_row[pivot]) {\n return Err(\n \"LU decomposition without pivoting is not possible for this matrix\".into(),\n );\n }\n // Let pivot_entry_inv = 1 / pivot_row[pivot]\n let pivot_entry_inv = base.inv(&pivot_row[pivot]);\n\n // For each row_idx in (pivot + 1) to rows\n for row_idx in (pivot + 1)..self.rows {\n // Let row = self.get_row(row_idx)\n let mut row = self.get_row(row_idx);\n // Let scale = row[pivot] * pivot_entry_inv\n let scale = base.mul(&row[pivot], &pivot_entry_inv);\n\n // row += -scale * pivot_row (Vector addition and scalar multiplication)\n v_a.add_assign(\n &mut row,\n &v_a.neg(&mul_vector(&v_a, scale.clone(), pivot_row.clone())),\n );\n\n // l_matrix[row_idx][pivot] = scale\n *l_matrix.get_mut(row_idx, pivot) = scale;\n // self.set_row(row_idx, row) (Sets the modified row back into the matrix)\n self.set_row(row_idx, row);\n }\n }\n // Returns the L matrix\n Ok(the_l_matrix)\n }\n\n pub fn p_l_u_decomposition(\n &self,\n ) -> Result<\n (\n Vec<<F as Domain>::Elem>,\n Vec<<F as Domain>::Elem>,\n Vec<<F as Domain>::Elem>,\n ),\n String,\n >\n where\n F: Clone,\n {\n let base = self.field.base().clone();\n let mut self2 = (*self.data).clone();\n let mut cloned_vector = Matrix2D::new(base.clone(), &mut self2, self.rows, self.cols);\n let mut pivot_row = 0;\n\n let mut the_p_matrix: Vec<_> = self.field.zero();\n let mut p_matrix = Matrix2D::new(base.clone(), &mut the_p_matrix, self.rows, self.cols);\n //let mut u_matrix = self.clone(); //Initializes the U matrix as a copy of the original matrix\n\n for pivot_col in 0..self.cols {\n // Find a non-zero entry in the pivot column\n let swap_row = (pivot_row..self.rows)\n .find(|&row| !base.equals(cloned_vector.get(row, pivot_col), &base.zero()));\n match swap_row {\n Some(swap_row) => {\n // Swap rows in U and P matrices to bring the non-zero entry to the pivot position\n cloned_vector.swap_rows(pivot_row, swap_row);\n p_matrix.swap_rows(pivot_row, swap_row);\n pivot_row += 1;\n }\n None => {\n // If there are no non-zero entries in the pivot column, just proceed to the next column\n }\n }\n }\n\n // Set the diagonals of P to 1\n for i in 0..self.rows {\n *p_matrix.get_mut(i, i) = base.one();\n }\n\n // Run the LU decomposition on the permuted U matrix\n let l_u_result = cloned_vector.l_u_decomposition();\n\n match l_u_result {\n Ok(the_l_matrix) => Ok((the_p_matrix, the_l_matrix, cloned_vector.data.clone())),\n Err(e) => Err(e),\n }\n }\n}\n\nuse std::{error::Error, fmt};\nimpl<'a, T> fmt::Display for Matrix2D<'a, T>\nwhere\n <T as Domain>::Elem: fmt::Display,\n T: Field,\n{\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n for row in 0..self.rows {\n for col in 0..self.cols {\n write!(f, \"{} \", self.get(row, col))?;\n }\n writeln!(f)?;\n }\n Ok(())\n }\n}\n\nfn mul_vector<T>(\n f: &VectorAlgebra<T>,\n a: <T as Domain>::Elem,\n d: Vec<<T as Domain>::Elem>,\n) -> <VectorAlgebra<T> as Domain>::Elem\nwhere\n T: Field,\n{\n f.mul(&d, &f.diagonal(a))\n}\n\n#[cfg(test)]\nmod tests {\n use super::*; // bring into scope everything from the parent module\n use abstalg::ReducedFractions;\n use abstalg::I32;\n\n fn test_p_l_u_decomposition(matrix: Vec<isize>, size: usize) {\n // This test assumes that the base field is rational numbers.\n // Create a test 4x4 matrix\n let (matrix, size): (Vec<isize>, usize) =\n (vec![11, 9, 24, 2, 1, 5, 2, 6, 3, 17, 18, 1, 2, 5, 7, 1], 4);\n let field = abstalg::ReducedFractions::new(abstalg::I32);\n let matrix_ring = MatrixRing::new(field.clone(), size);\n let mut matrix: Vec<_> = matrix.clone().into_iter().map(|i| field.int(i)).collect();\n let mut matrix2d = Matrix2D::new(field.clone(), &mut matrix, size, size);\n\n // Decompose the matrix using the p_l_u_decomposition function\n let p_l_u_decomposition_result = matrix2d.p_l_u_decomposition().unwrap();\n let (mut p_matrix, mut l_matrix, mut u_matrix) = p_l_u_decomposition_result;\n\n // Convert the matrices back to Matrix2D form for printing\n let p_matrix2d = Matrix2D::new(field.clone(), &mut p_matrix, size, size);\n let l_matrix2d = Matrix2D::new(field.clone(), &mut l_matrix, size, size);\n let u_matrix2d = Matrix2D::new(field.clone(), &mut u_matrix, size, size);\n\n println!(\"P={} L={} U={}\", p_matrix2d, l_matrix2d, u_matrix2d,);\n\n // Multiply the resulting P, L, and U matrices\n let p_l = matrix_ring.mul(&p_matrix, &l_matrix);\n let mut p_l_u = matrix_ring.mul(&p_l, &u_matrix);\n\n //let p_l_u_2d = Matrix2D::new(field.clone(), &mut p_l_u, 4, 4);\n // Check that the product of P, L, and U is equal to the original matrix\n assert_eq!(matrix, p_l_u);\n }\n\n #[test]\n fn test_p_l_u_decomposition_example() {\n test_p_l_u_decomposition(vec![\n 11, 9, 24, 2,\n 1, 5, 2, 6,\n 3, 17, 18, 1,\n 2, 5, 7, 1,\n ], 4);\n test_p_l_u_decomposition(vec![\n 1, 3, 5,\n 2, 4, 7,\n 1, 1, 0,\n ], 3);\n }\n}\n","language":"Rust"},{"code":"func is_square(m) { m.all { .len == m.len } }\nfunc matrix_zero(n, m=n) { m.of { n.of(0) } }\nfunc matrix_ident(n) { n.of {|i| [i.of(0)..., 1, (n - i - 1).of(0)...] } }\n\nfunc pivotize(m) {\n var size = m.len\n var id = matrix_ident(size)\n for i in (^size) {\n var max = m[i][i]\n var row = i\n for j in (i ..^ size) {\n if (m[j][i] > max) {\n max = m[j][i]\n row = j\n }\n }\n if (row != i) {\n id.swap(row, i)\n }\n }\n return id\n}\n\nfunc mmult(a, b) {\n var p = []\n for r in ^a, c in ^b[0], i in ^b {\n p[r][c] := 0 += (a[r][i] * b[i][c])\n }\n return p\n}\n\nfunc lu(a) {\n is_square(a) || die \"Defined only for square matrices!\";\n var n = a.len\n var P = pivotize(a)\n var Aʼ = mmult(P, a)\n var L = matrix_ident(n)\n var U = matrix_zero(n)\n for i in ^n, j in ^n {\n if (j >= i) {\n U[i][j] = (Aʼ[i][j] - sum(^i, { U[_][j] * L[i][_] }))\n } else {\n L[i][j] = ((Aʼ[i][j] - sum(^j, { U[_][j] * L[i][_] })) / U[j][j])\n }\n }\n return [P, Aʼ, L, U]\n}\n\nfunc say_it(message, array) {\n say \"\\n#{message}\"\n array.each { |row|\n say row.map{\"%7s\" % .as_rat}.join(' ')\n }\n}\n\nvar t = [[\n %n(1 3 5),\n %n(2 4 7),\n %n(1 1 0),\n],[\n %n(11 9 24 2),\n %n( 1 5 2 6),\n %n( 3 17 18 1),\n %n( 2 5 7 1),\n]]\n\nt.each { |test|\n say_it('A Matrix', test)\n for a,b in (['P Matrix', 'Aʼ Matrix', 'L Matrix', 'U Matrix'] ~Z lu(test)) {\n say_it(a, b)\n }\n}\n","language":"Sidef"},{"code":"mata\n: lud(a=(1,3,5\\2,4,7\\1,1,0),l=.,u=.,p=.)\n\n: a\n 1 2 3\n +-------------+\n 1 | 1 3 5 |\n 2 | 2 4 7 |\n 3 | 1 1 0 |\n +-------------+\n\n: l\n 1 2 3\n +----------------+\n 1 | 1 0 0 |\n 2 | .5 1 0 |\n 3 | .5 -1 1 |\n +----------------+\n\n: u\n 1 2 3\n +-------------------+\n 1 | 2 4 7 |\n 2 | 0 1 1.5 |\n 3 | 0 0 -2 |\n +-------------------+\n\n: p\n 1\n +-----+\n 1 | 2 |\n 2 | 1 |\n 3 | 3 |\n +-----+\n","language":"Stata"},{"code":"void ludec(real matrix a, real matrix l, real matrix u, real vector p) {\n\treal scalar i,j,n,s\n\treal vector js\n\t\n\tl = a\n\tn = rows(a)\n\tp = 1::n\n\tfor (i=1; i<n; i++) {\n\t\tmaxindex(abs(l[i::n,i]), 1, js=., .)\n\t\tj = js[1]+i-1\n\t\tif (j!=i) {\n\t\t\tl[(i\\j),.] = l[(j\\i),.]\n\t\t\tp[(i\\j)] = p[(j\\i)]\n\t\t}\n\t\tfor (j=i+1; j<=n; j++) {\n\t\t\tl[j,i] = s = l[j,i]/l[i,i]\n\t\t\tl[j,i+1..n] = l[j,i+1..n]-s*l[i,i+1..n]\n\t\t}\n\t}\n\t\n\tu = uppertriangle(l)\n\tl = lowertriangle(l, 1)\n}\n","language":"Stata"},{"code":": ludec(a=(1,3,5\\2,4,7\\1,1,0),l=.,u=.,p=.)\n\n: a\n 1 2 3\n +-------------+\n 1 | 1 3 5 |\n 2 | 2 4 7 |\n 3 | 1 1 0 |\n +-------------+\n\n: l\n 1 2 3\n +----------------+\n 1 | 1 0 0 |\n 2 | .5 1 0 |\n 3 | .5 -1 1 |\n +----------------+\n\n: u\n 1 2 3\n +-------------------+\n 1 | 2 4 7 |\n 2 | 0 1 1.5 |\n 3 | 0 0 -2 |\n +-------------------+\n\n: p\n 1\n +-----+\n 1 | 2 |\n 2 | 1 |\n 3 | 3 |\n +-----+\n","language":"Stata"},{"code":"package require Tcl 8.5\nnamespace eval matrix {\n namespace path {::tcl::mathfunc ::tcl::mathop}\n\n # Construct an identity matrix of the given size\n proc identity {order} {\n\tset m [lrepeat $order [lrepeat $order 0]]\n\tfor {set i 0} {$i < $order} {incr i} {\n\t lset m $i $i 1\n\t}\n\treturn $m\n }\n\n # Produce the pivot matrix for a given matrix\n proc pivotize {matrix} {\n\tset n [llength $matrix]\n\tset p [identity $n]\n\tfor {set j 0} {$j < $n} {incr j} {\n\t set max [lindex $matrix $j $j]\n\t set row $j\n\t for {set i $j} {$i < $n} {incr i} {\n\t\tif {[lindex $matrix $i $j] > $max} {\n\t\t set max [lindex $matrix $i $j]\n\t\t set row $i\n\t\t}\n\t }\n\t if {$j != $row} {\n\t\t# Row swap inlined; too trivial to have separate procedure\n\t\tset tmp [lindex $p $j]\n\t\tlset p $j [lindex $p $row]\n\t\tlset p $row $tmp\n\t }\n\t}\n\treturn $p\n }\n\n # Decompose a square matrix A by PA=LU and return L, U and P\n proc luDecompose {A} {\n\tset n [llength $A]\n\tset L [lrepeat $n [lrepeat $n 0]]\n\tset U $L\n\tset P [pivotize $A]\n\tset A [multiply $P $A]\n\n\tfor {set j 0} {$j < $n} {incr j} {\n\t lset L $j $j 1\n\t for {set i 0} {$i <= $j} {incr i} {\n\t\tlset U $i $j [- [lindex $A $i $j] [SumMul $L $U $i $j $i]]\n\t }\n\t for {set i $j} {$i < $n} {incr i} {\n\t\tset sum [SumMul $L $U $i $j $j]\n\t\tlset L $i $j [/ [- [lindex $A $i $j] $sum] [lindex $U $j $j]]\n\t }\n\t}\n\n\treturn [list $L $U $P]\n }\n\n # Helper that makes inner loop nicer; multiplies column and row,\n # possibly partially...\n proc SumMul {A B i j kmax} {\n\tset s 0.0\n\tfor {set k 0} {$k < $kmax} {incr k} {\n\t set s [+ $s [* [lindex $A $i $k] [lindex $B $k $j]]]\n\t}\n\treturn $s\n }\n}\n","language":"Tcl"},{"code":"# Code adapted from Matrix_multiplication and Matrix_transposition tasks\nnamespace eval matrix {\n # Get the size of a matrix; assumes that all rows are the same length, which\n # is a basic well-formed-ness condition...\n proc size {m} {\n\tset rows [llength $m]\n\tset cols [llength [lindex $m 0]]\n\treturn [list $rows $cols]\n }\n\n # Matrix multiplication implementation\n proc multiply {a b} {\n\tlassign [size $a] a_rows a_cols\n\tlassign [size $b] b_rows b_cols\n\tif {$a_cols != $b_rows} {\n\t error \"incompatible sizes: a($a_rows, $a_cols), b($b_rows, $b_cols)\"\n\t}\n\tset temp [lrepeat $a_rows [lrepeat $b_cols 0]]\n\tfor {set i 0} {$i < $a_rows} {incr i} {\n\t for {set j 0} {$j < $b_cols} {incr j} {\n\t\tlset temp $i $j [SumMul $a $b $i $j $a_cols]\n\t }\n\t}\n\treturn $temp\n }\n\n # Pretty printer for matrices\n proc print {matrix {fmt \"%g\"}} {\n\tset max [Widest $matrix $fmt]\n\tlassign [size $matrix] rows cols\n\tforeach row $matrix {\n\t foreach val $row width $max {\n\t\tputs -nonewline [format \"%*s \" $width [format $fmt $val]]\n\t }\n\t puts \"\"\n\t}\n }\n proc Widest {m fmt} {\n\tlassign [size $m] rows cols\n\tset max [lrepeat $cols 0]\n\tforeach row $m {\n\t for {set j 0} {$j < $cols} {incr j} {\n\t\tset s [format $fmt [lindex $row $j]]\n\t\tlset max $j [max [lindex $max $j] [string length $s]]\n\t }\n\t}\n\treturn $max\n }\n}\n","language":"Tcl"},{"code":"# This does the decomposition and prints it out nicely\nproc demo {A} {\n lassign [matrix::luDecompose $A] L U P\n foreach v {A L U P} {\n\tupvar 0 $v matrix\n\tputs \"${v}:\"\n\tmatrix::print $matrix %.5g\n\tif {$v ne \"P\"} {puts \"---------------------------------\"}\n }\n}\ndemo {{1 3 5} {2 4 7} {1 1 0}}\nputs \"=================================\"\ndemo {{11 9 24 2} {1 5 2 6} {3 17 18 1} {2 5 7 1}}\n","language":"Tcl"},{"code":"Option Base 1\nPrivate Function pivotize(m As Variant) As Variant\n Dim n As Integer: n = UBound(m)\n Dim im() As Double\n ReDim im(n, n)\n For i = 1 To n\n For j = 1 To n\n im(i, j) = 0\n Next j\n im(i, i) = 1\n Next i\n For i = 1 To n\n mx = Abs(m(i, i))\n row_ = i\n For j = i To n\n If Abs(m(j, i)) > mx Then\n mx = Abs(m(j, i))\n row_ = j\n End If\n Next j\n If i <> Row Then\n For j = 1 To n\n tmp = im(i, j)\n im(i, j) = im(row_, j)\n im(row_, j) = tmp\n Next j\n End If\n Next i\n pivotize = im\nEnd Function\n\nPrivate Function lu(a As Variant) As Variant\n Dim n As Integer: n = UBound(a)\n Dim l() As Double\n ReDim l(n, n)\n For i = 1 To n\n For j = 1 To n\n l(i, j) = 0\n Next j\n Next i\n u = l\n p = pivotize(a)\n a2 = WorksheetFunction.MMult(p, a)\n For j = 1 To n\n l(j, j) = 1#\n For i = 1 To j\n sum1 = 0#\n For k = 1 To i\n sum1 = sum1 + u(k, j) * l(i, k)\n Next k\n u(i, j) = a2(i, j) - sum1\n Next i\n For i = j + 1 To n\n sum2 = 0#\n For k = 1 To j\n sum2 = sum2 + u(k, j) * l(i, k)\n Next k\n l(i, j) = (a2(i, j) - sum2) / u(j, j)\n Next i\n Next j\n Dim res(4) As Variant\n res(1) = a\n res(2) = l\n res(3) = u\n res(4) = p\n lu = res\nEnd Function\n\nPublic Sub main()\n\n a = [{1, 3, 5; 2, 4, 7; 1, 1, 0}]\n Debug.Print \"== a,l,u,p: ==\"\n result = lu(a)\n For i = 1 To 4\n For j = 1 To UBound(result(1))\n For k = 1 To UBound(result(1), 2)\n Debug.Print result(i)(j, k),\n Next k\n Debug.Print\n Next j\n Debug.Print\n Next i\n a = [{11, 9,24, 2; 1, 5, 2, 6; 3,17,18, 1; 2, 5, 7, 1}]\n Debug.Print \"== a,l,u,p: ==\"\n result = lu(a)\n For i = 1 To 4\n For j = 1 To UBound(result(1))\n For k = 1 To UBound(result(1), 2)\n Debug.Print Format(result(i)(j, k), \"0.#####\"),\n Next k\n Debug.Print\n Next j\n Debug.Print\n Next i\nEnd Sub\n","language":"VBA"},{"code":"import \"./matrix\" for Matrix\nimport \"./fmt\" for Fmt\n\nvar arrays = [\n [ [1, 3, 5],\n [2, 4, 7],\n [1, 1, 0] ],\n\n [ [11, 9, 24, 2],\n [ 1, 5, 2, 6],\n [ 3, 17, 18, 1],\n [ 2, 5, 7, 1] ]\n]\n\nfor (array in arrays) {\n var m = Matrix.new(array)\n System.print(\"A\\n\")\n Fmt.mprint(m, 2, 0)\n System.print(\"\\nL\\n\")\n var lup = m.lup\n Fmt.mprint(lup[0], 8, 5)\n System.print(\"\\nU\\n\")\n Fmt.mprint(lup[1], 8, 5)\n System.print(\"\\nP\\n\")\n Fmt.mprint(lup[2], 2, 0)\n System.print()\n}\n","language":"Wren"},{"code":"var [const] GSL=Import(\"zklGSL\");\t// libGSL (GNU Scientific Library)\nfcn luTask(A){\n A.LUDecompose();\t// in place, contains L & U\n L:=A.copy().lowerTriangle().setDiagonal(0,0,1);\n U:=A.copy().upperTriangle();\n return(L,U);\n}\n\nA:=GSL.Matrix(3,3).set(1,3,5, 2,4,7, 1,1,0); // example 1\nL,U:=luTask(A);\nprintln(\"L:\\n\",L.format(),\"\\nU:\\n\",U.format());\n\nA:=GSL.Matrix(4,4).set(11.0, 9.0, 24.0, 2.0,\t// example 2\n\t\t\t1.0, 5.0, 2.0, 6.0,\n\t\t\t3.0, 17.0, 18.0, 1.0,\n\t\t\t2.0, 5.0, 7.0, 1.0);\nL,U:=luTask(A);\nprintln(\"L:\\n\",L.format(8,4),\"\\nU:\\n\",U.format(8,4));\n","language":"Zkl"},{"code":"fcn make_array(n,m,v){ (m).pump(List.createLong(m).write,v)*n }\nfcn eye(n){ // Creates a nxn identity matrix.\n I:=make_array(n,n,0.0);\n foreach j in (n){ I[j][j]=1.0 }\n I\n}\n\n// Creates the pivoting matrix for A.\nfcn pivotize(A){\n n:=A.len();\t// rows\n P:=eye(n);\n foreach i in (n){\n max,row:=A[i][i],i;\n foreach j in ([i..n-1]){\n if(A[j][i]>max) max,row=A[j][i],j;\n }\n if(i!=row) P.swap(i,row);\n }\n // Return P.\n P\n}\n\n// Decomposes a square matrix A by PA=LU and returns L, U and P.\nfcn lu(A){\n n:=A.len();\n L:=eye(n);\n U:=make_array(n,n,0.0);\n P:=pivotize(A);\n A=matMult(P,A);\n\n foreach j in (n){\n foreach i in (j+1){\n U[i][j]=A[i][j] - (i).reduce('wrap(s,k){ s + U[k][j]*L[i][k] },0.0);\n }\n foreach i in ([j..n-1]){\n L[i][j]=( A[i][j] -\n\t\t (j).reduce('wrap(s,k){ s + U[k][j]*L[i][k] },0.0) ) /\n\t\t U[j][j];\n }\n }\n // Return L, U and P.\n return(L,U,P);\n}\n\nfcn matMult(a,b){\n n,m,p:=a[0].len(),a.len(),b[0].len();\n ans:=make_array(n,m,0.0);\n foreach i,j,k in (m,p,n){ ans[i][j]+=a[i][k]*b[k][j]; }\n ans\n}\n","language":"Zkl"},{"code":"g:=L(L(1.0,3.0,5.0),L(2.0,4.0,7.0),L(1.0,1.0,0.0));\nlu(g).apply2(\"println\");\n","language":"Zkl"},{"code":"lu(L( L(11.0, 9.0, 24.0, 2.0),\n L( 1.0, 5.0, 2.0, 6.0),\n L( 3.0, 17.0, 18.0, 1.0),\n L( 2.0, 5.0, 7.0, 1.0) )).apply2(T(printM,Console.writeln.fpM(\"-\")));\n\nfcn printM(m) { m.pump(Console.println,rowFmt) }\nfcn rowFmt(row){ (\"%9.5f \"*row.len()).fmt(row.xplode()) }\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/LU_decomposition\\nnote: Matrices\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Every square matrix <math>A</math> can be decomposed into a product of a lower triangular matrix <math>L</math> and a upper triangular matrix <math>U</math>, \\nas described in [[wp:LU decomposition|LU decomposition]].\\n\\n:<math>A = LU</math>\\n\\nIt is a modified form of Gaussian elimination. \\nWhile the [[Cholesky decomposition]] only works for symmetric, \\npositive definite matrices, the more general LU decomposition \\nworks for any square matrix. \\n\\nThere are several algorithms for calculating L and U. \\nTo derive ''Crout's algorithm'' for a 3x3 example, \\nwe have to solve the following system:\\n\\n:<math>\\nA =\\n\\\\begin{pmatrix}\\n a_{11} & a_{12} & a_{13}\\\\\\\\\\n a_{21} & a_{22} & a_{23}\\\\\\\\\\n a_{31} & a_{32} & a_{33}\\\\\\\\\\n\\\\end{pmatrix}\\n=\\n\\\\begin{pmatrix}\\n l_{11} & 0 & 0 \\\\\\\\\\n l_{21} & l_{22} & 0 \\\\\\\\\\n l_{31} & l_{32} & l_{33}\\\\\\\\\\n\\\\end{pmatrix}\\n\\\\begin{pmatrix}\\n u_{11} & u_{12} & u_{13} \\\\\\\\\\n 0 & u_{22} & u_{23} \\\\\\\\\\n 0 & 0 & u_{33}\\n\\\\end{pmatrix}\\n= LU\\n</math>\\n\\nWe now would have to solve 9 equations with 12 unknowns. To make the system uniquely solvable, usually the diagonal elements of <math>L</math> are set to 1\\n\\n:<math>l_{11}=1</math>\\n:<math>l_{22}=1</math>\\n:<math>l_{33}=1</math>\\n\\nso we get a solvable system of 9 unknowns and 9 equations.\\n\\n:<math>\\nA =\\n\\\\begin{pmatrix}\\n a_{11} & a_{12} & a_{13}\\\\\\\\\\n a_{21} & a_{22} & a_{23}\\\\\\\\\\n a_{31} & a_{32} & a_{33}\\\\\\\\\\n\\\\end{pmatrix}\\n=\\n\\\\begin{pmatrix}\\n 1 & 0 & 0 \\\\\\\\\\n l_{21} & 1 & 0 \\\\\\\\\\n l_{31} & l_{32} & 1\\\\\\\\\\n\\\\end{pmatrix}\\n\\\\begin{pmatrix}\\n u_{11} & u_{12} & u_{13} \\\\\\\\\\n 0 & u_{22} & u_{23} \\\\\\\\\\n 0 & 0 & u_{33}\\n\\\\end{pmatrix}\\n=\\n\\\\begin{pmatrix}\\n u_{11} & u_{12} & u_{13} \\\\\\\\\\n u_{11}l_{21} & u_{12}l_{21}+u_{22} & u_{13}l_{21}+u_{23} \\\\\\\\\\n u_{11}l_{31} & u_{12}l_{31}+u_{22}l_{32} & u_{13}l_{31} + u_{23}l_{32}+u_{33}\\n\\\\end{pmatrix}\\n= LU\\n</math>\\n\\nSolving for the other <math>l</math> and <math>u</math>, we get the following equations:\\n\\n:<math>u_{11}=a_{11}</math>\\n:<math>u_{12}=a_{12}</math>\\n:<math>u_{13}=a_{13}</math>\\n\\n:<math>u_{22}=a_{22} - u_{12}l_{21}</math>\\n:<math>u_{23}=a_{23} - u_{13}l_{21}</math>\\n\\n:<math>u_{33}=a_{33} - (u_{13}l_{31} + u_{23}l_{32})</math>\\n\\nand for <math>l</math>:\\n\\n:<math>l_{21}=\\\\frac{1}{u_{11}} a_{21}</math>\\n:<math>l_{31}=\\\\frac{1}{u_{11}} a_{31}</math>\\n\\n:<math>l_{32}=\\\\frac{1}{u_{22}} (a_{32} - u_{12}l_{31})</math>\\n\\nWe see that there is a calculation pattern, which can be expressed as the following formulas, first for <math>U</math>\\n\\n:<math>u_{ij} = a_{ij} - \\\\sum_{k=1}^{i-1} u_{kj}l_{ik}</math>\\n\\nand then for <math>L</math>\\n\\n:<math>l_{ij} = \\\\frac{1}{u_{jj}} (a_{ij} - \\\\sum_{k=1}^{j-1} u_{kj}l_{ik})</math>\\n\\nWe see in the second formula that to get the <math>l_{ij}</math> below the diagonal, we have to divide by the diagonal element (pivot) <math>u_{jj}</math>, so we get problems when <math>u_{jj}</math> is either 0 or very small, which leads to numerical instability. \\n\\nThe solution to this problem is ''pivoting'' <math>A</math>, which means rearranging the rows of <math>A</math>, prior to the <math>LU</math> decomposition, in a way that the largest element of each column gets onto the diagonal of <math>A</math>. Rearranging the rows means to multiply <math>A</math> by a permutation matrix <math>P</math>:\\n\\n:<math>PA \\\\Rightarrow A'</math>\\n\\nExample:\\n\\n:<math>\\n\\\\begin{pmatrix}\\n 0 & 1 \\\\\\\\\\n 1 & 0 \\n\\\\end{pmatrix}\\n\\\\begin{pmatrix}\\n 1 & 4 \\\\\\\\\\n 2 & 3 \\n\\\\end{pmatrix}\\n\\\\Rightarrow\\n\\\\begin{pmatrix}\\n 2 & 3 \\\\\\\\\\n 1 & 4 \\n\\\\end{pmatrix}\\n</math>\\n\\nThe decomposition algorithm is then applied on the rearranged matrix so that\\n\\n:<math>PA = LU</math>\\n\\n\\n;Task description:\\nThe task is to implement a routine which will take a square nxn matrix <math>A</math> and return a lower triangular matrix <math>L</math>, a upper triangular matrix <math>U</math> and a permutation matrix <math>P</math>, \\nso that the above equation is fulfilled. \\n\\nYou should then test it on the following two examples and include your output.\\n\\n\\n;Example 1:\\n<pre>\\nA\\n\\n1 3 5\\n2 4 7\\n1 1 0\\n\\nL\\n\\n1.00000 0.00000 0.00000\\n0.50000 1.00000 0.00000\\n0.50000 -1.00000 1.00000\\n\\nU\\n\\n2.00000 4.00000 7.00000\\n0.00000 1.00000 1.50000\\n0.00000 0.00000 -2.00000\\n\\nP\\n\\n0 1 0\\n1 0 0\\n0 0 1\\n</pre>\\n\\n;Example 2:\\n<pre>\\nA\\n\\n11 9 24 2\\n 1 5 2 6\\n 3 17 18 1\\n 2 5 7 1\\n\\nL\\n\\n1.00000 0.00000 0.00000 0.00000\\n0.27273 1.00000 0.00000 0.00000\\n0.09091 0.28750 1.00000 0.00000\\n0.18182 0.23125 0.00360 1.00000\\n\\nU\\n\\n11.00000 9.00000 24.00000 2.00000\\n 0.00000 14.54545 11.45455 0.45455\\n 0.00000 0.00000 -3.47500 5.68750\\n 0.00000 0.00000 0.00000 0.51079\\n\\nP\\n\\n1 0 0 0\\n0 0 1 0\\n0 1 0 0\\n0 0 0 1\\n</pre>\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F pprint(m)\\n L(row) m\\n print(row)\\n\\nF matrix_mul(a, b)\\n V result = [[0.0] * a.len] * a.len\\n L(j) 0 .< a.len\\n L(i) 0 .< a.len\\n V r = 0.0\\n L(k) 0 .< a.len\\n r += a[i][k] * b[k][j]\\n result[i][j] = r\\n R result\\n\\nF pivotize(m)\\n ‘Creates the pivoting matrix for m.’\\n V n = m.len\\n V ID = (0 .< n).map(j -> (0 .< @n).map(i -> Float(i == @j)))\\n L(j) 0 .< n\\n V row = max(j .< n, key' i -> abs(@m[i][@j]))\\n I j != row\\n swap(&ID[j], &ID[row])\\n R ID\\n\\nF lu(A)\\n ‘Decomposes a nxn matrix A by PA=lU and returns l, U and P.’\\n V n = A.len\\n V l = [[0.0] * n] * n\\n V U = [[0.0] * n] * n\\n V P = pivotize(A)\\n V A2 = matrix_mul(P, A)\\n L(j) 0 .< n\\n l[j][j] = 1.0\\n L(i) 0 .. j\\n V s1 = sum((0 .< i).map(k -> @U[k][@j] * @l[@i][k]))\\n U[i][j] = A2[i][j] - s1\\n L(i) j .< n\\n V s2 = sum((0 .< j).map(k -> @U[k][@j] * @l[@i][k]))\\n l[i][j] = (A2[i][j] - s2) / U[j][j]\\n R (l, U, P)\\n\\nV a = [[1, 3, 5], [2, 4, 7], [1, 1, 0]]\\nL(part) lu(a)\\n pprint(part)\\n print()\\nprint()\\nV b = [[11, 9, 24, 2], [1, 5, 2, 6], [3, 17, 18, 1], [2, 5, 7, 1]]\\nL(part) lu(b)\\n pprint(part)\\n print()\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Numerics.Generic_Real_Arrays;\\ngeneric\\n with package Matrix is new Ada.Numerics.Generic_Real_Arrays (<>);\\npackage Decomposition is\\n\\n -- decompose a square matrix A by PA = LU\\n procedure Decompose (A : Matrix.Real_Matrix; P, L, U : out Matrix.Real_Matrix);\\n\\nend Decomposition;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package body Decomposition is\\n\\n procedure Swap_Rows (M : in out Matrix.Real_Matrix; From, To : Natural) is\\n Temporary : Matrix.Real;\\n begin\\n if From = To then\\n return;\\n end if;\\n for I in M'Range (2) loop\\n Temporary := M (M'First (1) + From, I);\\n M (M'First (1) + From, I) := M (M'First (1) + To, I);\\n M (M'First (1) + To, I) := Temporary;\\n end loop;\\n end Swap_Rows;\\n\\n function Pivoting_Matrix\\n (M : Matrix.Real_Matrix)\\n return Matrix.Real_Matrix\\n is\\n use type Matrix.Real;\\n Order : constant Positive := M'Length (1);\\n Result : Matrix.Real_Matrix := Matrix.Unit_Matrix (Order);\\n Max : Matrix.Real;\\n Row : Natural;\\n begin\\n for J in 0 .. Order - 1 loop\\n Max := M (M'First (1) + J, M'First (2) + J);\\n Row := J;\\n for I in J .. Order - 1 loop\\n if M (M'First (1) + I, M'First (2) + J) > Max then\\n Max := M (M'First (1) + I, M'First (2) + J);\\n Row := I;\\n end if;\\n end loop;\\n if J /= Row then\\n -- swap rows J and Row\\n Swap_Rows (Result, J, Row);\\n end if;\\n end loop;\\n return Result;\\n end Pivoting_Matrix;\\n\\n procedure Decompose (A : Matrix.Real_Matrix; P, L, U : out Matrix.Real_Matrix) is\\n use type Matrix.Real_Matrix, Matrix.Real;\\n Order : constant Positive := A'Length (1);\\n A2 : Matrix.Real_Matrix (A'Range (1), A'Range (2));\\n S : Matrix.Real;\\n begin\\n L := (others => (others => 0.0));\\n U := (others => (others => 0.0));\\n P := Pivoting_Matrix (A);\\n A2 := P * A;\\n for J in 0 .. Order - 1 loop\\n L (L'First (1) + J, L'First (2) + J) := 1.0;\\n for I in 0 .. J loop\\n S := 0.0;\\n for K in 0 .. I - 1 loop\\n S := S + U (U'First (1) + K, U'First (2) + J) *\\n L (L'First (1) + I, L'First (2) + K);\\n end loop;\\n U (U'First (1) + I, U'First (2) + J) :=\\n A2 (A2'First (1) + I, A2'First (2) + J) - S;\\n end loop;\\n for I in J + 1 .. Order - 1 loop\\n S := 0.0;\\n for K in 0 .. J loop\\n S := S + U (U'First (1) + K, U'First (2) + J) *\\n L (L'First (1) + I, L'First (2) + K);\\n end loop;\\n L (L'First (1) + I, L'First (2) + J) :=\\n (A2 (A2'First (1) + I, A2'First (2) + J) - S) /\\n U (U'First (1) + J, U'First (2) + J);\\n end loop;\\n end loop;\\n end Decompose;\\n\\nend Decomposition;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Numerics.Real_Arrays;\\nwith Ada.Text_IO;\\nwith Decomposition;\\nprocedure Decompose_Example is\\n package Real_Decomposition is new Decomposition\\n (Matrix => Ada.Numerics.Real_Arrays);\\n\\n package Real_IO is new Ada.Text_IO.Float_IO (Float);\\n\\n procedure Print (M : Ada.Numerics.Real_Arrays.Real_Matrix) is\\n begin\\n for Row in M'Range (1) loop\\n for Col in M'Range (2) loop\\n Real_IO.Put (M (Row, Col), 3, 2, 0);\\n end loop;\\n Ada.Text_IO.New_Line;\\n end loop;\\n end Print;\\n\\n Example_1 : constant Ada.Numerics.Real_Arrays.Real_Matrix :=\\n ((1.0, 3.0, 5.0),\\n (2.0, 4.0, 7.0),\\n (1.0, 1.0, 0.0));\\n P_1, L_1, U_1 : Ada.Numerics.Real_Arrays.Real_Matrix (Example_1'Range (1),\\n Example_1'Range (2));\\n Example_2 : constant Ada.Numerics.Real_Arrays.Real_Matrix :=\\n ((11.0, 9.0, 24.0, 2.0),\\n (1.0, 5.0, 2.0, 6.0),\\n (3.0, 17.0, 18.0, 1.0),\\n (2.0, 5.0, 7.0, 1.0));\\n P_2, L_2, U_2 : Ada.Numerics.Real_Arrays.Real_Matrix (Example_2'Range (1),\\n Example_2'Range (2));\\nbegin\\n Real_Decomposition.Decompose (A => Example_1,\\n P => P_1,\\n L => L_1,\\n U => U_1);\\n Real_Decomposition.Decompose (A => Example_2,\\n P => P_2,\\n L => L_2,\\n U => U_2);\\n Ada.Text_IO.Put_Line (\\\"Example 1:\\\");\\n Ada.Text_IO.Put_Line (\\\"A:\\\"); Print (Example_1);\\n Ada.Text_IO.Put_Line (\\\"L:\\\"); Print (L_1);\\n Ada.Text_IO.Put_Line (\\\"U:\\\"); Print (U_1);\\n Ada.Text_IO.Put_Line (\\\"P:\\\"); Print (P_1);\\n Ada.Text_IO.New_Line;\\n Ada.Text_IO.Put_Line (\\\"Example 2:\\\");\\n Ada.Text_IO.Put_Line (\\\"A:\\\"); Print (Example_2);\\n Ada.Text_IO.Put_Line (\\\"L:\\\"); Print (L_2);\\n Ada.Text_IO.Put_Line (\\\"U:\\\"); Print (U_2);\\n Ada.Text_IO.Put_Line (\\\"P:\\\"); Print (P_2);\\nend Decompose_Example;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"(* There is a \\\"little matrix library\\\" included below. Not all of it is\\n used, though unused parts may prove useful for playing with the\\n code.\\n\\n One might, by the way, find interesting how I get the P matrix from\\n a permutation vector. *)\\n\\n%{^\\n#include <math.h>\\n#include <float.h>\\n%}\\n\\n#include \\\"share/atspre_staload.hats\\\"\\n\\nmacdef NAN = g0f2f ($extval (float, \\\"NAN\\\"))\\nmacdef Zero = g0i2f 0\\nmacdef One = g0i2f 1\\n\\n(* You can substitute an \\\"fma\\\" function for this definition: *)\\nmacdef multiply_and_add (x, y, z) = (,(x) * ,(y)) + ,(z)\\n\\nexception Exc_degenerate_problem of string\\n\\n(*------------------------------------------------------------------*)\\n(* A \\\"little matrix library\\\" *)\\n\\ntypedef Matrix_Index_Map (m1 : int, n1 : int, m0 : int, n0 : int) =\\n {i1, j1 : pos | i1 <= m1; j1 <= n1}\\n (int i1, int j1) -<cloref0>\\n [i0, j0 : pos | i0 <= m0; j0 <= n0]\\n @(int i0, int j0)\\n\\ndatatype Real_Matrix (tk : tkind,\\n m1 : int, n1 : int,\\n m0 : int, n0 : int) =\\n| Real_Matrix of (matrixref (g0float tk, m0, n0),\\n int m1, int n1, int m0, int n0,\\n Matrix_Index_Map (m1, n1, m0, n0))\\ntypedef Real_Matrix (tk : tkind, m1 : int, n1 : int) =\\n [m0, n0 : pos] Real_Matrix (tk, m1, n1, m0, n0)\\ntypedef Real_Vector (tk : tkind, m1 : int, n1 : int) =\\n [m1 == 1 || n1 == 1] Real_Matrix (tk, m1, n1)\\ntypedef Real_Row (tk : tkind, n1 : int) = Real_Vector (tk, 1, n1)\\ntypedef Real_Column (tk : tkind, m1 : int) = Real_Vector (tk, m1, 1)\\n\\nextern fn {tk : tkind}\\nReal_Matrix_make_elt :\\n {m0, n0 : pos}\\n (int m0, int n0, g0float tk) -< !wrt >\\n Real_Matrix (tk, m0, n0, m0, n0)\\n\\nextern fn {tk : tkind}\\nReal_Matrix_copy :\\n {m1, n1 : pos}\\n Real_Matrix (tk, m1, n1) -< !refwrt > Real_Matrix (tk, m1, n1)\\n\\nextern fn {tk : tkind}\\nReal_Matrix_copy_to :\\n {m1, n1 : pos}\\n (Real_Matrix (tk, m1, n1), (* destination *)\\n Real_Matrix (tk, m1, n1)) -< !refwrt >\\n void\\n\\nextern fn {tk : tkind}\\nReal_Matrix_fill_with_elt :\\n {m1, n1 : pos}\\n (Real_Matrix (tk, m1, n1), g0float tk) -< !refwrt > void\\n\\nextern fn {}\\nReal_Matrix_dimension :\\n {tk : tkind}\\n {m1, n1 : pos}\\n Real_Matrix (tk, m1, n1) -<> @(int m1, int n1)\\n\\nextern fn {tk : tkind}\\nReal_Matrix_get_at :\\n {m1, n1 : pos}\\n {i1, j1 : pos | i1 <= m1; j1 <= n1}\\n (Real_Matrix (tk, m1, n1), int i1, int j1) -< !ref > g0float tk\\n\\nextern fn {tk : tkind}\\nReal_Matrix_set_at :\\n {m1, n1 : pos}\\n {i1, j1 : pos | i1 <= m1; j1 <= n1}\\n (Real_Matrix (tk, m1, n1), int i1, int j1, g0float tk) -< !refwrt >\\n void\\n\\nextern fn {}\\nReal_Matrix_apply_index_map :\\n {tk : tkind}\\n {m1, n1 : pos}\\n {m0, n0 : pos}\\n (Real_Matrix (tk, m0, n0), int m1, int n1,\\n Matrix_Index_Map (m1, n1, m0, n0)) -<>\\n Real_Matrix (tk, m1, n1)\\n\\nextern fn {}\\nReal_Matrix_transpose :\\n (* This is transposed INDEXING. It does NOT copy the data. *)\\n {tk : tkind}\\n {m1, n1 : pos}\\n {m0, n0 : pos}\\n Real_Matrix (tk, m1, n1, m0, n0) -<>\\n Real_Matrix (tk, n1, m1, m0, n0)\\n\\nextern fn {}\\nReal_Matrix_block :\\n (* This is block (submatrix) INDEXING. It does NOT copy the data. *)\\n {tk : tkind}\\n {p0, p1 : pos | p0 <= p1}\\n {q0, q1 : pos | q0 <= q1}\\n {m1, n1 : pos | p1 <= m1; q1 <= n1}\\n {m0, n0 : pos}\\n (Real_Matrix (tk, m1, n1, m0, n0),\\n int p0, int p1, int q0, int q1) -<>\\n Real_Matrix (tk, p1 - p0 + 1, q1 - q0 + 1, m0, n0)\\n\\nextern fn {tk : tkind}\\nReal_Matrix_unit_matrix :\\n {m : pos}\\n int m -< !refwrt > Real_Matrix (tk, m, m)\\n\\nextern fn {tk : tkind}\\nReal_Matrix_unit_matrix_to :\\n {m : pos}\\n Real_Matrix (tk, m, m) -< !refwrt > void\\n\\nextern fn {tk : tkind}\\nReal_Matrix_matrix_sum :\\n {m, n : pos}\\n (Real_Matrix (tk, m, n), Real_Matrix (tk, m, n)) -< !refwrt >\\n Real_Matrix (tk, m, n)\\n\\nextern fn {tk : tkind}\\nReal_Matrix_matrix_sum_to :\\n {m, n : pos}\\n (Real_Matrix (tk, m, n), (* destination*)\\n Real_Matrix (tk, m, n),\\n Real_Matrix (tk, m, n)) -< !refwrt >\\n void\\n\\nextern fn {tk : tkind}\\nReal_Matrix_matrix_difference :\\n {m, n : pos}\\n (Real_Matrix (tk, m, n), Real_Matrix (tk, m, n)) -< !refwrt >\\n Real_Matrix (tk, m, n)\\n\\nextern fn {tk : tkind}\\nReal_Matrix_matrix_difference_to :\\n {m, n : pos}\\n (Real_Matrix (tk, m, n), (* destination*)\\n Real_Matrix (tk, m, n),\\n Real_Matrix (tk, m, n)) -< !refwrt >\\n void\\n\\nextern fn {tk : tkind}\\nReal_Matrix_matrix_product :\\n {m, n, p : pos}\\n (Real_Matrix (tk, m, n), Real_Matrix (tk, n, p)) -< !refwrt >\\n Real_Matrix (tk, m, p)\\n\\nextern fn {tk : tkind}\\nReal_Matrix_matrix_product_to :\\n (* For the matrix product, the destination should not be the same as\\n either of the other matrices. *)\\n {m, n, p : pos}\\n (Real_Matrix (tk, m, p), (* destination*)\\n Real_Matrix (tk, m, n),\\n Real_Matrix (tk, n, p)) -< !refwrt >\\n void\\n\\nextern fn {tk : tkind}\\nReal_Matrix_scalar_product :\\n {m, n : pos}\\n (Real_Matrix (tk, m, n), g0float tk) -< !refwrt >\\n Real_Matrix (tk, m, n)\\n\\nextern fn {tk : tkind}\\nReal_Matrix_scalar_product_2 :\\n {m, n : pos}\\n (g0float tk, Real_Matrix (tk, m, n)) -< !refwrt >\\n Real_Matrix (tk, m, n)\\n\\nextern fn {tk : tkind}\\nReal_Matrix_scalar_product :\\n {m, n : pos}\\n (Real_Matrix (tk, m, n), g0float tk) -< !refwrt >\\n Real_Matrix (tk, m, n)\\n\\nextern fn {tk : tkind}\\nReal_Matrix_scalar_product_2 :\\n {m, n : pos}\\n (g0float tk, Real_Matrix (tk, m, n)) -< !refwrt >\\n Real_Matrix (tk, m, n)\\n\\nextern fn {tk : tkind}\\nReal_Matrix_scalar_product_to :\\n {m, n : pos}\\n (Real_Matrix (tk, m, n), (* destination*)\\n Real_Matrix (tk, m, n),\\n g0float tk) -< !refwrt >\\n void\\n\\nextern fn {tk : tkind} (* Useful for debugging. *)\\nReal_Matrix_fprint :\\n {m, n : pos}\\n (FILEref, Real_Matrix (tk, m, n)) -<1> void\\n\\noverload copy with Real_Matrix_copy\\noverload copy_to with Real_Matrix_copy_to\\noverload fill_with_elt with Real_Matrix_fill_with_elt\\noverload dimension with Real_Matrix_dimension\\noverload [] with Real_Matrix_get_at\\noverload [] with Real_Matrix_set_at\\noverload apply_index_map with Real_Matrix_apply_index_map\\noverload transpose with Real_Matrix_transpose\\noverload block with Real_Matrix_block\\noverload unit_matrix with Real_Matrix_unit_matrix\\noverload unit_matrix_to with Real_Matrix_unit_matrix_to\\noverload matrix_sum with Real_Matrix_matrix_sum\\noverload matrix_sum_to with Real_Matrix_matrix_sum_to\\noverload matrix_difference with Real_Matrix_matrix_difference\\noverload matrix_difference_to with Real_Matrix_matrix_difference_to\\noverload matrix_product with Real_Matrix_matrix_product\\noverload matrix_product_to with Real_Matrix_matrix_product_to\\noverload scalar_product with Real_Matrix_scalar_product\\noverload scalar_product with Real_Matrix_scalar_product_2\\noverload scalar_product_to with Real_Matrix_scalar_product_to\\noverload + with matrix_sum\\noverload - with matrix_difference\\noverload * with matrix_product\\noverload * with scalar_product\\n\\n(*------------------------------------------------------------------*)\\n(* Implementation of the \\\"little matrix library\\\" *)\\n\\nimplement {tk}\\nReal_Matrix_make_elt (m0, n0, elt) =\\n Real_Matrix (matrixref_make_elt<g0float tk> (i2sz m0, i2sz n0, elt),\\n m0, n0, m0, n0, lam (i1, j1) => @(i1, j1))\\n\\nimplement {}\\nReal_Matrix_dimension A =\\n case+ A of Real_Matrix (_, m1, n1, _, _, _) => @(m1, n1)\\n\\nimplement {tk}\\nReal_Matrix_get_at (A, i1, j1) =\\n let\\n val+ Real_Matrix (storage, _, _, _, n0, index_map) = A\\n val @(i0, j0) = index_map (i1, j1)\\n in\\n matrixref_get_at<g0float tk> (storage, pred i0, n0, pred j0)\\n end\\n\\nimplement {tk}\\nReal_Matrix_set_at (A, i1, j1, x) =\\n let\\n val+ Real_Matrix (storage, _, _, _, n0, index_map) = A\\n val @(i0, j0) = index_map (i1, j1)\\n in\\n matrixref_set_at<g0float tk> (storage, pred i0, n0, pred j0, x)\\n end\\n\\nimplement {}\\nReal_Matrix_apply_index_map (A, m1, n1, index_map) =\\n (* This is not the most efficient way to acquire new indexing, but\\n it will work. It requires three closures, instead of the two\\n needed by our implementations of \\\"transpose\\\" and \\\"block\\\". *)\\n let\\n val+ Real_Matrix (storage, m1a, n1a, m0, n0, index_map_1a) = A\\n in\\n Real_Matrix (storage, m1, n1, m0, n0,\\n lam (i1, j1) =>\\n index_map_1a (i1a, j1a) where\\n { val @(i1a, j1a) = index_map (i1, j1) })\\n end\\n\\nimplement {}\\nReal_Matrix_transpose A =\\n let\\n val+ Real_Matrix (storage, m1, n1, m0, n0, index_map) = A\\n in\\n Real_Matrix (storage, n1, m1, m0, n0,\\n lam (i1, j1) => index_map (j1, i1))\\n end\\n\\nimplement {}\\nReal_Matrix_block (A, p0, p1, q0, q1) =\\n let\\n val+ Real_Matrix (storage, m1, n1, m0, n0, index_map) = A\\n in\\n Real_Matrix (storage, succ (p1 - p0), succ (q1 - q0), m0, n0,\\n lam (i1, j1) =>\\n index_map (p0 + pred i1, q0 + pred j1))\\n end\\n\\nimplement {tk}\\nReal_Matrix_copy A =\\n let\\n val @(m1, n1) = dimension A\\n val C = Real_Matrix_make_elt<tk> (m1, n1, A[1, 1])\\n val () = copy_to<tk> (C, A)\\n in\\n C\\n end\\n\\nimplement {tk}\\nReal_Matrix_copy_to (Dst, Src) =\\n let\\n val @(m1, n1) = dimension Src\\n prval [m1 : int] EQINT () = eqint_make_gint m1\\n prval [n1 : int] EQINT () = eqint_make_gint n1\\n\\n var i : intGte 1\\n in\\n for* {i : pos | i <= m1 + 1} .<(m1 + 1) - i>.\\n (i : int i) =>\\n (i := 1; i <> succ m1; i := succ i)\\n let\\n var j : intGte 1\\n in\\n for* {j : pos | j <= n1 + 1} .<(n1 + 1) - j>.\\n (j : int j) =>\\n (j := 1; j <> succ n1; j := succ j)\\n Dst[i, j] := Src[i, j]\\n end\\n end\\n\\nimplement {tk}\\nReal_Matrix_fill_with_elt (A, elt) =\\n let\\n val @(m1, n1) = dimension A\\n prval [m1 : int] EQINT () = eqint_make_gint m1\\n prval [n1 : int] EQINT () = eqint_make_gint n1\\n\\n var i : intGte 1\\n in\\n for* {i : pos | i <= m1 + 1} .<(m1 + 1) - i>.\\n (i : int i) =>\\n (i := 1; i <> succ m1; i := succ i)\\n let\\n var j : intGte 1\\n in\\n for* {j : pos | j <= n1 + 1} .<(n1 + 1) - j>.\\n (j : int j) =>\\n (j := 1; j <> succ n1; j := succ j)\\n A[i, j] := elt\\n end\\n end\\n\\nimplement {tk}\\nReal_Matrix_unit_matrix {m} m =\\n let\\n val A = Real_Matrix_make_elt<tk> (m, m, Zero)\\n var i : intGte 1\\n in\\n for* {i : pos | i <= m + 1} .<(m + 1) - i>.\\n (i : int i) =>\\n (i := 1; i <> succ m; i := succ i)\\n A[i, i] := One;\\n A\\n end\\n\\nimplement {tk}\\nReal_Matrix_unit_matrix_to A =\\n let\\n val @(m, _) = dimension A\\n prval [m : int] EQINT () = eqint_make_gint m\\n\\n var i : intGte 1\\n in\\n for* {i : pos | i <= m + 1} .<(m + 1) - i>.\\n (i : int i) =>\\n (i := 1; i <> succ m; i := succ i)\\n let\\n var j : intGte 1\\n in\\n for* {j : pos | j <= m + 1} .<(m + 1) - j>.\\n (j : int j) =>\\n (j := 1; j <> succ m; j := succ j)\\n A[i, j] := (if i = j then One else Zero)\\n end\\n end\\n\\nimplement {tk}\\nReal_Matrix_matrix_sum (A, B) =\\n let\\n val @(m, n) = dimension A\\n val C = Real_Matrix_make_elt<tk> (m, n, NAN)\\n val () = matrix_sum_to<tk> (C, A, B)\\n in\\n C\\n end\\n\\nimplement {tk}\\nReal_Matrix_matrix_sum_to (C, A, B) =\\n let\\n val @(m, n) = dimension A\\n prval [m : int] EQINT () = eqint_make_gint m\\n prval [n : int] EQINT () = eqint_make_gint n\\n\\n var i : intGte 1\\n in\\n for* {i : pos | i <= m + 1} .<(m + 1) - i>.\\n (i : int i) =>\\n (i := 1; i <> succ m; i := succ i)\\n let\\n var j : intGte 1\\n in\\n for* {j : pos | j <= n + 1} .<(n + 1) - j>.\\n (j : int j) =>\\n (j := 1; j <> succ n; j := succ j)\\n C[i, j] := A[i, j] + B[i, j]\\n end\\n end\\n\\nimplement {tk}\\nReal_Matrix_matrix_difference (A, B) =\\n let\\n val @(m, n) = dimension A\\n val C = Real_Matrix_make_elt<tk> (m, n, NAN)\\n val () = matrix_difference_to<tk> (C, A, B)\\n in\\n C\\n end\\n\\nimplement {tk}\\nReal_Matrix_matrix_difference_to (C, A, B) =\\n let\\n val @(m, n) = dimension A\\n prval [m : int] EQINT () = eqint_make_gint m\\n prval [n : int] EQINT () = eqint_make_gint n\\n\\n var i : intGte 1\\n in\\n for* {i : pos | i <= m + 1} .<(m + 1) - i>.\\n (i : int i) =>\\n (i := 1; i <> succ m; i := succ i)\\n let\\n var j : intGte 1\\n in\\n for* {j : pos | j <= n + 1} .<(n + 1) - j>.\\n (j : int j) =>\\n (j := 1; j <> succ n; j := succ j)\\n C[i, j] := A[i, j] - B[i, j]\\n end\\n end\\n\\nimplement {tk}\\nReal_Matrix_matrix_product (A, B) =\\n let\\n val @(m, n) = dimension A and @(_, p) = dimension B\\n val C = Real_Matrix_make_elt<tk> (m, p, NAN)\\n val () = matrix_product_to<tk> (C, A, B)\\n in\\n C\\n end\\n\\nimplement {tk}\\nReal_Matrix_matrix_product_to (C, A, B) =\\n let\\n val @(m, n) = dimension A and @(_, p) = dimension B\\n prval [m : int] EQINT () = eqint_make_gint m\\n prval [n : int] EQINT () = eqint_make_gint n\\n prval [p : int] EQINT () = eqint_make_gint p\\n\\n var i : intGte 1\\n in\\n for* {i : pos | i <= m + 1} .<(m + 1) - i>.\\n (i : int i) =>\\n (i := 1; i <> succ m; i := succ i)\\n let\\n var k : intGte 1\\n in\\n for* {k : pos | k <= p + 1} .<(p + 1) - k>.\\n (k : int k) =>\\n (k := 1; k <> succ p; k := succ k)\\n let\\n var j : intGte 1\\n in\\n C[i, k] := A[i, 1] * B[1, k];\\n for* {j : pos | j <= n + 1} .<(n + 1) - j>.\\n (j : int j) =>\\n (j := 2; j <> succ n; j := succ j)\\n C[i, k] :=\\n multiply_and_add (A[i, j], B[j, k], C[i, k])\\n end\\n end\\n end\\n\\nimplement {tk}\\nReal_Matrix_scalar_product (A, r) =\\n let\\n val @(m, n) = dimension A\\n val C = Real_Matrix_make_elt<tk> (m, n, NAN)\\n val () = scalar_product_to<tk> (C, A, r)\\n in\\n C\\n end\\n\\nimplement {tk}\\nReal_Matrix_scalar_product_2 (r, A) =\\n Real_Matrix_scalar_product<tk> (A, r)\\n\\nimplement {tk}\\nReal_Matrix_scalar_product_to (C, A, r) =\\n let\\n val @(m, n) = dimension A\\n prval [m : int] EQINT () = eqint_make_gint m\\n prval [n : int] EQINT () = eqint_make_gint n\\n\\n var i : intGte 1\\n in\\n for* {i : pos | i <= m + 1} .<(m + 1) - i>.\\n (i : int i) =>\\n (i := 1; i <> succ m; i := succ i)\\n let\\n var j : intGte 1\\n in\\n for* {j : pos | j <= n + 1} .<(n + 1) - j>.\\n (j : int j) =>\\n (j := 1; j <> succ n; j := succ j)\\n C[i, j] := A[i, j] * r\\n end\\n end\\n\\nimplement {tk}\\nReal_Matrix_fprint {m, n} (outf, A) =\\n let\\n val @(m, n) = dimension A\\n var i : intGte 1\\n in\\n for* {i : pos | i <= m + 1} .<(m + 1) - i>.\\n (i : int i) =>\\n (i := 1; i <> succ m; i := succ i)\\n let\\n var j : intGte 1\\n in\\n for* {j : pos | j <= n + 1} .<(n + 1) - j>.\\n (j : int j) =>\\n (j := 1; j <> succ n; j := succ j)\\n let\\n typedef FILEstar = $extype\\\"FILE *\\\"\\n extern castfn FILEref2star : FILEref -<> FILEstar\\n val _ = $extfcall (int, \\\"fprintf\\\", FILEref2star outf,\\n \\\"%12.6lf\\\", A[i, j])\\n in\\n end;\\n fprintln! (outf)\\n end\\n end\\n\\n(*------------------------------------------------------------------*)\\n(* LUP decomposition. Based on\\n https://en.wikipedia.org/w/index.php?title=LU_decomposition&oldid=1146366204#C_code_example\\n *)\\n\\nextern fn {tk : tkind}\\nReal_Matrix_LUP_decomposition :\\n {n : pos}\\n (Real_Matrix (tk, n, n),\\n g0float tk (* tolerance *) ) -< !exnrefwrt >\\n @(Real_Matrix (tk, n, n),\\n Real_Matrix (tk, n, n),\\n Real_Matrix (tk, n, n))\\n\\noverload LUP_decomposition with Real_Matrix_LUP_decomposition\\n\\nimplement {tk}\\nReal_Matrix_LUP_decomposition {n} (A, tol) =\\n let\\n val @(n, _) = dimension A\\n typedef one_to_n = intBtwe (1, n)\\n\\n (* The initial permutation is [1,2,3,...,n]. *)\\n implement\\n array_tabulate$fopr<one_to_n> i =\\n let\\n val i = g1ofg0 (sz2i (succ i))\\n val () = assertloc ((1 <= i) * (i <= n))\\n in\\n i\\n end\\n val permutation =\\n $effmask_all arrayref_tabulate<one_to_n> (i2sz n)\\n fn\\n index_map : Matrix_Index_Map (n, n, n, n) =\\n lam (i1, j1) => $effmask_ref\\n (@(i0, j1) where { val i0 = permutation[i1 - 1] })\\n\\n val A = apply_index_map (copy<tk> A, n, n, index_map)\\n\\n fun\\n select_pivot {i, k : pos | i <= k; k <= n + 1}\\n .<(n + 1) - k>.\\n (i : int i,\\n k : int k,\\n max_abs : g0float tk,\\n k_max_abs : intBtwe (i, n))\\n :<!ref> @(g0float tk, intBtwe (i, n)) =\\n if k = succ n then\\n @(max_abs, k_max_abs)\\n else\\n let\\n val absval = A[k, i]\\n in\\n if absval > max_abs then\\n select_pivot (i, succ k, absval, k)\\n else\\n select_pivot (i, succ k, max_abs, k_max_abs)\\n end\\n\\n fn {}\\n exchange_rows (i1 : one_to_n,\\n i2 : one_to_n) :<!refwrt> void =\\n if i1 <> i2 then\\n let\\n val k1 = permutation[pred i1]\\n and k2 = permutation[pred i2]\\n in\\n permutation[pred i1] := k2;\\n permutation[pred i2] := k1\\n end\\n\\n val () =\\n let\\n var i : Int\\n in\\n for* {i : pos | i <= n + 1} .<(n + 1) - i>.\\n (i : int i) =>\\n (i := 1; i <> succ n; i := succ i)\\n let\\n val @(maxabs, i_pivot) = select_pivot (i, i, Zero, i)\\n prval [i_pivot : int] EQINT () = eqint_make_gint i_pivot\\n var j : Int\\n in\\n if maxabs < tol then\\n $raise Exc_degenerate_problem\\n (\\\"Real_Matrix_LUP_decomposition\\\");\\n exchange_rows (i_pivot, i);\\n for* {j : int | i + 1 <= j; j <= n + 1}\\n .<(n + 1) - j>.\\n (j : int j) =>\\n (j := succ i; j <> succ n; j := succ j)\\n let\\n var k : Int\\n in\\n A[j, i] := A[j, i] / A[i, i];\\n for* {k : int | i + 1 <= k; k <= n + 1}\\n .<(n + 1) - k>.\\n (k : int k) =>\\n (k := succ i; k <> succ n; k := succ k)\\n A[j, k] :=\\n multiply_and_add\\n (~A[j, i], A[i, k], A[j, k])\\n end\\n end\\n end\\n\\n val U = A\\n val L = Real_Matrix_unit_matrix<tk> n\\n val () =\\n let\\n var i : Int\\n in\\n for* {i : int | 2 <= i; i <= n + 1} .<(n + 1) - i>.\\n (i : int i) =>\\n (i := 2; i <> succ n; i := succ i)\\n let\\n var j : Int\\n in\\n for* {j : pos | j <= i} .<i - j>.\\n (j : int j) =>\\n (j := 1; j <> i; j := succ j)\\n begin\\n L[i, j] := U[i, j];\\n U[i, j] := Zero\\n end\\n end\\n end\\n val P = apply_index_map (Real_Matrix_unit_matrix<tk> n,\\n n, n, index_map)\\n in\\n @(L, U, P)\\n end\\n\\n(*------------------------------------------------------------------*)\\n\\nimplement\\nmain0 () =\\n (* I use tolerances of zero, secure in the knowledge that IEEE\\n floating point will not crash the program just because a matrix\\n was singular. :) *)\\n let\\n val A = Real_Matrix_make_elt<dblknd> (3, 3, NAN)\\n val () =\\n (A[1, 1] := 1.0; A[1, 2] := 3.0; A[1, 3] := 5.0;\\n A[2, 1] := 2.0; A[2, 2] := 4.0; A[2, 3] := 7.0;\\n A[3, 1] := 1.0; A[3, 2] := 1.0; A[3, 3] := 0.0)\\n val @(L, U, P) = LUP_decomposition (A, 0.0)\\n val () = println! \\\"A\\\"\\n val () = Real_Matrix_fprint (stdout_ref, A)\\n val () = println! \\\"L\\\"\\n val () = Real_Matrix_fprint (stdout_ref, L)\\n val () = println! \\\"U\\\"\\n val () = Real_Matrix_fprint (stdout_ref, U)\\n val () = println! \\\"P\\\"\\n val () = Real_Matrix_fprint (stdout_ref, P)\\n val () = println! \\\"PA - LU\\\"\\n val () = Real_Matrix_fprint (stdout_ref, P * A - L * U)\\n\\n val () = println! \\\"\\\\n------------------------------------------\\\\n\\\"\\n\\n val A = Real_Matrix_make_elt<dblknd> (4, 4, NAN)\\n val () =\\n (A[1, 1] := 11.0; A[1, 2] := 9.0; A[1, 3] := 24.0; A[1, 4] := 2.0;\\n A[2, 1] := 1.0; A[2, 2] := 5.0; A[2, 3] := 2.0; A[2, 4] := 6.0;\\n A[3, 1] := 3.0; A[3, 2] := 17.0; A[3, 3] := 18.0; A[3, 4] := 1.0;\\n A[4, 1] := 2.0; A[4, 2] := 5.0; A[4, 3] := 7.0; A[4, 4] := 1.0)\\n val @(L, U, P) = LUP_decomposition (A, 0.0)\\n val () = println! \\\"A\\\"\\n val () = Real_Matrix_fprint (stdout_ref, A)\\n val () = println! \\\"L\\\"\\n val () = Real_Matrix_fprint (stdout_ref, L)\\n val () = println! \\\"U\\\"\\n val () = Real_Matrix_fprint (stdout_ref, U)\\n val () = println! \\\"P\\\"\\n val () = Real_Matrix_fprint (stdout_ref, P)\\n val () = println! \\\"PA - LU\\\"\\n val () = Real_Matrix_fprint (stdout_ref, P * A - L * U)\\n\\n val () = println! \\\"\\\\n------------------------------------------\\\\n\\\"\\n\\n val () = println! (\\\"I have added an example having an asymmetric\\\",\\n \\\" permutation\\\\nmatrix, \\\",\\n \\\"because I needed one for testing:\\\")\\n val () = println! ()\\n\\n val A = Real_Matrix_make_elt<dblknd> (4, 4, NAN)\\n val () =\\n (A[1, 1] := 11.0; A[1, 2] := 9.0; A[1, 3] := 24.0; A[1, 4] := 2.0;\\n A[2, 1] := 1.0; A[2, 2] := 5.0; A[2, 3] := 2.0; A[2, 4] := 6.0;\\n A[3, 1] := 3.0; A[3, 2] := 175.0; A[3, 3] := 18.0; A[3, 4] := 1.0;\\n A[4, 1] := 2.0; A[4, 2] := 5.0; A[4, 3] := 7.0; A[4, 4] := 1.0)\\n val @(L, U, P) = LUP_decomposition (A, 0.0)\\n val () = println! \\\"A\\\"\\n val () = Real_Matrix_fprint (stdout_ref, A)\\n val () = println! \\\"L\\\"\\n val () = Real_Matrix_fprint (stdout_ref, L)\\n val () = println! \\\"U\\\"\\n val () = Real_Matrix_fprint (stdout_ref, U)\\n val () = println! \\\"P\\\"\\n val () = Real_Matrix_fprint (stdout_ref, P)\\n val () = println! \\\"PA - LU\\\"\\n val () = Real_Matrix_fprint (stdout_ref, P * A - L * U)\\n in\\n end\\n\\n(*------------------------------------------------------------------*)\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \";--------------------------\\nLU_decomposition(A){\\n P := Pivot(A)\\n A_ := Multiply_Matrix(P, A)\\n\\n U := [], L := [], n := A_.Count()\\n loop % n {\\n i := A_Index\\n loop % n {\\n j := A_Index\\n\\n Sigma := 0, k := 1\\n while (k <= i-1)\\n Sigma += (U[k, j] * L[i, k]), k++\\n U[i, j] := A_[i, j] - Sigma\\n\\n Sigma := 0, k := 1\\n while (k <= j-1)\\n Sigma += (U[k, j] * L[i, k]), k++\\n L[i, j] := (A_[i, j] - Sigma) / U[j, j]\\n }\\n }\\n return [L, U, P]\\n}\\n;--------------------------\\nPivot(M){\\n n := M.Count(), P := [], i := 0\\n while (i++ < n){\\n P.push([])\\n j := 0\\n while (j++ < n)\\n P[i].push(i=j ? 1 : 0)\\n }\\n i := 0\\n while (i++ < n){\\n maxm := M[i, i], row := i, j := i\\n while (j++ < n)\\n if (M[j, i] > maxm)\\n maxm := M[j, i], row := j\\n if (i != row)\\n tmp := P[i], P[i] := P[row], P[row] := tmp\\n }\\n return P\\n}\\n;--------------------------\\nMultiply_Matrix(A,B){\\n if (A[1].Count() <> B.Count())\\n return\\n RCols := A[1].Count()>B[1].Count()?A[1].Count():B[1].Count()\\n RRows := A.Count()>B.Count()?A.Count():B.Count(), R := []\\n Loop, % RRows {\\n RRow:=A_Index\\n loop, % RCols {\\n RCol:=A_Index, v := 0\\n loop % A[1].Count()\\n col := A_Index, v += A[RRow, col] * B[col,RCol]\\n R[RRow,RCol] := v\\n }\\n }\\n return R\\n}\\n;--------------------------\\nShowMatrix(L, f:=3){\\n for r, obj in L{\\n row := \\\"\\\"\\n for c, v in obj\\n row .= Format(\\\"{:.\\\" f \\\"f}\\\", v) \\\", \\\"\\n output .= \\\"[\\\" trim(row, \\\", \\\") \\\"]`n,\\\"\\n }\\n return \\\"[\\\" Trim(output, \\\"`n,\\\") \\\"]\\\"\\n}\\n;--------------------------\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"A1 := [[1, 3, 5]\\n , [2, 4, 7]\\n , [1, 1, 0]]\\n\\nA2 := [[11, 9, 24, 2]\\n ,[1, 5, 2, 6]\\n ,[3, 17, 18, 1]\\n ,[2, 5, 7, 1]]\\n\\nloop 2 {\\n L := LU_Decomposition(A%A_Index%)\\n result .= \\\"\\\"\\n . \\\"A:=`n\\\" ShowMatrix(A%A_Index%, 4)\\n . \\\"`n`nL:=`n\\\" ShowMatrix(L.1)\\n . \\\"`n`nU:=`n\\\" ShowMatrix(L.2)\\n . \\\"`n`nP:=`n\\\" ShowMatrix(L.3)\\n . \\\"`n--------------------------------`n\\\"\\n}\\nMsgBox, 262144, , % result\\nreturn\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \" DIM A1(2,2)\\n A1() = 1, 3, 5, 2, 4, 7, 1, 1, 0\\n PROCLUdecomposition(A1(), L1(), U1(), P1())\\n PRINT \\\"L1:\\\" ' FNshowmatrix(L1())\\n PRINT \\\"U1:\\\" ' FNshowmatrix(U1())\\n PRINT \\\"P1:\\\" ' FNshowmatrix(P1())\\n\\n DIM A2(3,3)\\n A2() = 11, 9, 24, 2, 1, 5, 2, 6, 3, 17, 18, 1, 2, 5, 7, 1\\n PROCLUdecomposition(A2(), L2(), U2(), P2())\\n PRINT \\\"L2:\\\" ' FNshowmatrix(L2())\\n PRINT \\\"U2:\\\" ' FNshowmatrix(U2())\\n PRINT \\\"P2:\\\" ' FNshowmatrix(P2())\\n END\\n\\n DEF PROCLUdecomposition(a(), RETURN l(), RETURN u(), RETURN p())\\n LOCAL i%, j%, k%, n%, s, b() : n% = DIM(a(),2)\\n DIM l(n%,n%), u(n%,n%), b(n%,n%)\\n PROCpivot(a(), p())\\n b() = p() . a()\\n FOR j% = 0 TO n%\\n l(j%,j%) = 1\\n FOR i% = 0 TO j%\\n s = 0\\n FOR k% = 0 TO i% : s += u(k%,j%) * l(i%,k%) : NEXT\\n u(i%,j%) = b(i%,j%) - s\\n NEXT\\n FOR i% = j% TO n%\\n s = 0\\n FOR k% = 0 TO j% : s += u(k%,j%) * l(i%,k%) : NEXT\\n IF i%<>j% l(i%,j%) = (b(i%,j%) - s) / u(j%,j%)\\n NEXT\\n NEXT j%\\n ENDPROC\\n\\n DEF PROCpivot(a(), RETURN p())\\n LOCAL i%, j%, m%, n%, r% : n% = DIM(a(),2)\\n DIM p(n%,n%) : FOR i% = 0 TO n% : p(i%,i%) = 1 : NEXT\\n FOR i% = 0 TO n%\\n m% = a(i%,i%)\\n r% = i%\\n FOR j% = i% TO n%\\n IF a(j%,i%) > m% m% = a(j%,i%) : r% = j%\\n NEXT\\n IF i%<>r% THEN\\n FOR j% = 0 TO n% : SWAP p(i%,j%),p(r%,j%) : NEXT\\n ENDIF\\n NEXT i%\\n ENDPROC\\n\\n DEF FNshowmatrix(a())\\n LOCAL @%, i%, j%, a$\\n @% = &102050A\\n FOR i% = 0 TO DIM(a(),1)\\n FOR j% = 0 TO DIM(a(),2)\\n a$ += STR$(a(i%,j%)) + \\\", \\\"\\n NEXT\\n a$ = LEFT$(LEFT$(a$)) + CHR$(13) + CHR$(10)\\n NEXT i%\\n = a$\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <math.h>\\n\\n#define foreach(a, b, c) for (int a = b; a < c; a++)\\n#define for_i foreach(i, 0, n)\\n#define for_j foreach(j, 0, n)\\n#define for_k foreach(k, 0, n)\\n#define for_ij for_i for_j\\n#define for_ijk for_ij for_k\\n#define _dim int n\\n#define _swap(x, y) { typeof(x) tmp = x; x = y; y = tmp; }\\n#define _sum_k(a, b, c, s) { s = 0; foreach(k, a, b) s+= c; }\\n\\ntypedef double **mat;\\n\\n#define _zero(a) mat_zero(a, n)\\nvoid mat_zero(mat x, int n) { for_ij x[i][j] = 0; }\\n\\n#define _new(a) a = mat_new(n)\\nmat mat_new(_dim)\\n{\\n\\tmat x = malloc(sizeof(double*) * n);\\n\\tx[0] = malloc(sizeof(double) * n * n);\\n\\n\\tfor_i x[i] = x[0] + n * i;\\n\\t_zero(x);\\n\\n\\treturn x;\\n}\\n\\n#define _copy(a) mat_copy(a, n)\\nmat mat_copy(void *s, _dim)\\n{\\n\\tmat x = mat_new(n);\\n\\tfor_ij x[i][j] = ((double (*)[n])s)[i][j];\\n\\treturn x;\\n}\\n\\n#define _del(x) mat_del(x)\\nvoid mat_del(mat x) { free(x[0]); free(x); }\\n\\n#define _QUOT(x) #x\\n#define QUOTE(x) _QUOT(x)\\n#define _show(a) printf(QUOTE(a)\\\" =\\\");mat_show(a, 0, n)\\nvoid mat_show(mat x, char *fmt, _dim)\\n{\\n\\tif (!fmt) fmt = \\\"%8.4g\\\";\\n\\tfor_i {\\n\\t\\tprintf(i ? \\\" \\\" : \\\" [ \\\");\\n\\t\\tfor_j {\\n\\t\\t\\tprintf(fmt, x[i][j]);\\n\\t\\t\\tprintf(j < n - 1 ? \\\" \\\" : i == n - 1 ? \\\" ]\\\\n\\\" : \\\"\\\\n\\\");\\n\\t\\t}\\n\\t}\\n}\\n\\n#define _mul(a, b) mat_mul(a, b, n)\\nmat mat_mul(mat a, mat b, _dim)\\n{\\n\\tmat c = _new(c);\\n\\tfor_ijk c[i][j] += a[i][k] * b[k][j];\\n\\treturn c;\\n}\\n\\n#define _pivot(a, b) mat_pivot(a, b, n)\\nvoid mat_pivot(mat a, mat p, _dim)\\n{\\n\\tfor_ij { p[i][j] = (i == j); }\\n\\tfor_i {\\n\\t\\tint max_j = i;\\n\\t\\tforeach(j, i, n)\\n\\t\\t\\tif (fabs(a[j][i]) > fabs(a[max_j][i])) max_j = j;\\n\\n\\t\\tif (max_j != i)\\n\\t\\t\\tfor_k { _swap(p[i][k], p[max_j][k]); }\\n\\t}\\n}\\n\\n#define _LU(a, l, u, p) mat_LU(a, l, u, p, n)\\nvoid mat_LU(mat A, mat L, mat U, mat P, _dim)\\n{\\n\\t_zero(L); _zero(U);\\n\\t_pivot(A, P);\\n\\n\\tmat Aprime = _mul(P, A);\\n\\n\\tfor_i { L[i][i] = 1; }\\n\\tfor_ij {\\n\\t\\tdouble s;\\n\\t\\tif (j <= i) {\\n\\t\\t\\t_sum_k(0, j, L[j][k] * U[k][i], s)\\n\\t\\t\\tU[j][i] = Aprime[j][i] - s;\\n\\t\\t}\\n\\t\\tif (j >= i) {\\n\\t\\t\\t_sum_k(0, i, L[j][k] * U[k][i], s);\\n\\t\\t\\tL[j][i] = (Aprime[j][i] - s) / U[i][i];\\n\\t\\t}\\n\\t}\\n\\n\\t_del(Aprime);\\n}\\n\\ndouble A3[][3] = {{ 1, 3, 5 }, { 2, 4, 7 }, { 1, 1, 0 }};\\ndouble A4[][4] = {{11, 9, 24, 2}, {1, 5, 2, 6}, {3, 17, 18, 1}, {2, 5, 7, 1}};\\n\\nint main()\\n{\\n\\tint n = 3;\\n\\tmat A, L, P, U;\\n\\n\\t_new(L); _new(P); _new(U);\\n\\tA = _copy(A3);\\n\\t_LU(A, L, U, P);\\n\\t_show(A); _show(L); _show(U); _show(P);\\n\\t_del(A); _del(L); _del(U); _del(P);\\n\\n\\tprintf(\\\"\\\\n\\\");\\n\\n\\tn = 4;\\n\\n\\t_new(L); _new(P); _new(U);\\n\\tA = _copy(A4);\\n\\t_LU(A, L, U, P);\\n\\t_show(A); _show(L); _show(U); _show(P);\\n\\t_del(A); _del(L); _del(U); _del(P);\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <cassert>\\n#include <cmath>\\n#include <iomanip>\\n#include <iostream>\\n#include <limits>\\n#include <numeric>\\n#include <sstream>\\n#include <vector>\\n\\ntemplate <typename scalar_type> class matrix {\\npublic:\\n matrix(size_t rows, size_t columns)\\n : rows_(rows), columns_(columns), elements_(rows * columns) {}\\n\\n matrix(size_t rows, size_t columns, scalar_type value)\\n : rows_(rows), columns_(columns), elements_(rows * columns, value) {}\\n\\n matrix(size_t rows, size_t columns,\\n const std::initializer_list<std::initializer_list<scalar_type>>& values)\\n : rows_(rows), columns_(columns), elements_(rows * columns) {\\n assert(values.size() <= rows_);\\n size_t i = 0;\\n for (const auto& row : values) {\\n assert(row.size() <= columns_);\\n std::copy(begin(row), end(row), &elements_[i]);\\n i += columns_;\\n }\\n }\\n\\n size_t rows() const { return rows_; }\\n size_t columns() const { return columns_; }\\n\\n const scalar_type& operator()(size_t row, size_t column) const {\\n assert(row < rows_);\\n assert(column < columns_);\\n return elements_[row * columns_ + column];\\n }\\n scalar_type& operator()(size_t row, size_t column) {\\n assert(row < rows_);\\n assert(column < columns_);\\n return elements_[row * columns_ + column];\\n }\\nprivate:\\n size_t rows_;\\n size_t columns_;\\n std::vector<scalar_type> elements_;\\n};\\n\\ntemplate <typename scalar_type>\\nvoid print(std::wostream& out, const matrix<scalar_type>& a) {\\n const wchar_t* box_top_left = L\\\"\\\\x23a1\\\";\\n const wchar_t* box_top_right = L\\\"\\\\x23a4\\\";\\n const wchar_t* box_left = L\\\"\\\\x23a2\\\";\\n const wchar_t* box_right = L\\\"\\\\x23a5\\\";\\n const wchar_t* box_bottom_left = L\\\"\\\\x23a3\\\";\\n const wchar_t* box_bottom_right = L\\\"\\\\x23a6\\\";\\n\\n const int precision = 5;\\n size_t rows = a.rows(), columns = a.columns();\\n std::vector<size_t> width(columns);\\n for (size_t column = 0; column < columns; ++column) {\\n size_t max_width = 0;\\n for (size_t row = 0; row < rows; ++row) {\\n std::ostringstream str;\\n str << std::fixed << std::setprecision(precision) << a(row, column);\\n max_width = std::max(max_width, str.str().length());\\n }\\n width[column] = max_width;\\n }\\n out << std::fixed << std::setprecision(precision);\\n for (size_t row = 0; row < rows; ++row) {\\n const bool top(row == 0), bottom(row + 1 == rows);\\n out << (top ? box_top_left : (bottom ? box_bottom_left : box_left));\\n for (size_t column = 0; column < columns; ++column) {\\n if (column > 0)\\n out << L' ';\\n out << std::setw(width[column]) << a(row, column);\\n }\\n out << (top ? box_top_right : (bottom ? box_bottom_right : box_right));\\n out << L'\\\\n';\\n }\\n}\\n\\n// Return value is a tuple with elements (lower, upper, pivot)\\ntemplate <typename scalar_type>\\nauto lu_decompose(const matrix<scalar_type>& input) {\\n assert(input.rows() == input.columns());\\n size_t n = input.rows();\\n std::vector<size_t> perm(n);\\n std::iota(perm.begin(), perm.end(), 0);\\n matrix<scalar_type> lower(n, n);\\n matrix<scalar_type> upper(n, n);\\n matrix<scalar_type> input1(input);\\n for (size_t j = 0; j < n; ++j) {\\n size_t max_index = j;\\n scalar_type max_value = 0;\\n for (size_t i = j; i < n; ++i) {\\n scalar_type value = std::abs(input1(perm[i], j));\\n if (value > max_value) {\\n max_index = i;\\n max_value = value;\\n }\\n }\\n if (max_value <= std::numeric_limits<scalar_type>::epsilon())\\n throw std::runtime_error(\\\"matrix is singular\\\");\\n if (j != max_index)\\n std::swap(perm[j], perm[max_index]);\\n size_t jj = perm[j];\\n for (size_t i = j + 1; i < n; ++i) {\\n size_t ii = perm[i];\\n input1(ii, j) /= input1(jj, j);\\n for (size_t k = j + 1; k < n; ++k)\\n input1(ii, k) -= input1(ii, j) * input1(jj, k);\\n }\\n }\\n\\n for (size_t j = 0; j < n; ++j) {\\n lower(j, j) = 1;\\n for (size_t i = j + 1; i < n; ++i)\\n lower(i, j) = input1(perm[i], j);\\n for (size_t i = 0; i <= j; ++i)\\n upper(i, j) = input1(perm[i], j);\\n }\\n\\n matrix<scalar_type> pivot(n, n);\\n for (size_t i = 0; i < n; ++i)\\n pivot(i, perm[i]) = 1;\\n\\n return std::make_tuple(lower, upper, pivot);\\n}\\n\\ntemplate <typename scalar_type>\\nvoid show_lu_decomposition(const matrix<scalar_type>& input) {\\n try {\\n std::wcout << L\\\"A\\\\n\\\";\\n print(std::wcout, input);\\n auto result(lu_decompose(input));\\n std::wcout << L\\\"\\\\nL\\\\n\\\";\\n print(std::wcout, std::get<0>(result));\\n std::wcout << L\\\"\\\\nU\\\\n\\\";\\n print(std::wcout, std::get<1>(result));\\n std::wcout << L\\\"\\\\nP\\\\n\\\";\\n print(std::wcout, std::get<2>(result));\\n } catch (const std::exception& ex) {\\n std::cerr << ex.what() << '\\\\n';\\n }\\n}\\n\\nint main() {\\n std::wcout.imbue(std::locale(\\\"\\\"));\\n std::wcout << L\\\"Example 1:\\\\n\\\";\\n matrix<double> matrix1(3, 3,\\n {{1, 3, 5},\\n {2, 4, 7},\\n {1, 1, 0}});\\n show_lu_decomposition(matrix1);\\n std::wcout << '\\\\n';\\n\\n std::wcout << L\\\"Example 2:\\\\n\\\";\\n matrix<double> matrix2(4, 4,\\n {{11, 9, 24, 2},\\n {1, 5, 2, 6},\\n {3, 17, 18, 1},\\n {2, 5, 7, 1}});\\n show_lu_decomposition(matrix2);\\n std::wcout << '\\\\n';\\n\\n std::wcout << L\\\"Example 3:\\\\n\\\";\\n matrix<double> matrix3(3, 3,\\n {{-5, -6, -3},\\n {-1, 0, -2},\\n {-3, -4, -7}});\\n show_lu_decomposition(matrix3);\\n std::wcout << '\\\\n';\\n\\n std::wcout << L\\\"Example 4:\\\\n\\\";\\n matrix<double> matrix4(3, 3,\\n {{1, 2, 3},\\n {4, 5, 6},\\n {7, 8, 9}});\\n show_lu_decomposition(matrix4);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \";; Creates a nxn identity matrix.\\n(defun eye (n)\\n (let ((I (make-array `(,n ,n) :initial-element 0)))\\n (loop for j from 0 to (- n 1) do\\n (setf (aref I j j) 1))\\n I))\\n\\n;; Swap two rows l and k of a mxn matrix A, which is a 2D array.\\n(defun swap-rows (A l k)\\n (let* ((n (cadr (array-dimensions A)))\\n (row (make-array n :initial-element 0)))\\n (loop for j from 0 to (- n 1) do\\n (setf (aref row j) (aref A l j))\\n (setf (aref A l j) (aref A k j))\\n (setf (aref A k j) (aref row j)))))\\n\\n;; Creates the pivoting matrix for A.\\n(defun pivotize (A)\\n (let* ((n (car (array-dimensions A)))\\n (P (eye n)))\\n (loop for j from 0 to (- n 1) do\\n (let ((max (aref A j j))\\n (row j))\\n (loop for i from j to (- n 1) do\\n (if (> (aref A i j) max)\\n (setq max (aref A i j)\\n row i)))\\n (if (not (= j row))\\n (swap-rows P j row))))\\n\\n ;; Return P.\\n P))\\n\\n;; Decomposes a square matrix A by PA=LU and returns L, U and P.\\n(defun lu (A)\\n (let* ((n (car (array-dimensions A)))\\n (L (make-array `(,n ,n) :initial-element 0))\\n (U (make-array `(,n ,n) :initial-element 0))\\n (P (pivotize A))\\n (A (mmul P A)))\\n\\n (loop for j from 0 to (- n 1) do\\n (setf (aref L j j) 1)\\n (loop for i from 0 to j do\\n (setf (aref U i j)\\n (- (aref A i j)\\n (loop for k from 0 to (- i 1)\\n sum (* (aref U k j)\\n (aref L i k))))))\\n (loop for i from j to (- n 1) do\\n (setf (aref L i j)\\n (/ (- (aref A i j)\\n (loop for k from 0 to (- j 1)\\n sum (* (aref U k j)\\n (aref L i k))))\\n (aref U j j)))))\\n\\n ;; Return L, U and P.\\n (values L U P)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(setf g (make-array '(3 3) :initial-contents '((1 3 5) (2 4 7)(1 1 0))))\\n#2A((1 3 5) (2 4 7) (1 1 0))\\n\\n(lu g)\\n#2A((1 0 0) (1/2 1 0) (1/2 -1 1))\\n#2A((2 4 7) (0 1 3/2) (0 0 -2))\\n#2A((0 1 0) (1 0 0) (0 0 1))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(setf h (make-array '(4 4) :initial-contents '((11 9 24 2)(1 5 2 6)(3 17 18 1)(2 5 7 1))))\\n#2A((11 9 24 2) (1 5 2 6) (3 17 18 1) (2 5 7 1))\\n\\n(lup h)\\n#2A((1 0 0 0) (3/11 1 0 0) (1/11 23/80 1 0) (2/11 37/160 1/278 1))\\n#2A((11 9 24 2) (0 160/11 126/11 5/11) (0 0 -139/40 91/16) (0 0 0 71/139))\\n#2A((1 0 0 0) (0 0 1 0) (0 1 0 0) (0 0 0 1))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.algorithm, std.typecons, std.numeric,\\n std.array, std.conv, std.string, std.range;\\n\\nbool isRectangular(T)(in T[][] m) pure nothrow @nogc {\\n return m.all!(r => r.length == m[0].length);\\n}\\n\\nbool isSquare(T)(in T[][] m) pure nothrow @nogc {\\n return m.isRectangular && m[0].length == m.length;\\n}\\n\\nT[][] matrixMul(T)(in T[][] A, in T[][] B) pure nothrow\\nin {\\n assert(A.isRectangular && B.isRectangular &&\\n !A.empty && !B.empty && A[0].length == B.length);\\n} body {\\n auto result = new T[][](A.length, B[0].length);\\n auto aux = new T[B.length];\\n\\n foreach (immutable j; 0 .. B[0].length) {\\n foreach (immutable k, const row; B)\\n aux[k] = row[j];\\n foreach (immutable i, const ai; A)\\n result[i][j] = dotProduct(ai, aux);\\n }\\n\\n return result;\\n}\\n\\n/// Creates the pivoting matrix for m.\\nT[][] pivotize(T)(immutable T[][] m) pure nothrow\\nin {\\n assert(m.isSquare);\\n} body {\\n immutable n = m.length;\\n auto id = iota(n)\\n .map!((in j) => n.iota.map!(i => T(i == j)).array)\\n .array;\\n\\n foreach (immutable i; 0 .. n) {\\n // immutable row = iota(i, n).reduce!(max!(j => m[j][i]));\\n T maxm = m[i][i];\\n size_t row = i;\\n foreach (immutable j; i .. n)\\n if (m[j][i] > maxm) {\\n maxm = m[j][i];\\n row = j;\\n }\\n\\n if (i != row)\\n swap(id[i], id[row]);\\n }\\n\\n return id;\\n}\\n\\n/// Decomposes a square matrix A by PA=LU and returns L, U and P.\\nTuple!(T[][],\\\"L\\\", T[][],\\\"U\\\", const T[][],\\\"P\\\")\\nlu(T)(immutable T[][] A) pure nothrow\\nin {\\n assert(A.isSquare);\\n} body {\\n immutable n = A.length;\\n auto L = new T[][](n, n);\\n auto U = new T[][](n, n);\\n foreach (immutable i; 0 .. n) {\\n L[i][i .. $] = 0;\\n U[i][0 .. i] = 0;\\n }\\n\\n immutable P = A.pivotize!T;\\n immutable A2 = matrixMul!T(P, A);\\n\\n foreach (immutable j; 0 .. n) {\\n L[j][j] = 1;\\n foreach (immutable i; 0 .. j+1) {\\n T s1 = 0;\\n foreach (immutable k; 0 .. i)\\n s1 += U[k][j] * L[i][k];\\n U[i][j] = A2[i][j] - s1;\\n }\\n foreach (immutable i; j .. n) {\\n T s2 = 0;\\n foreach (immutable k; 0 .. j)\\n s2 += U[k][j] * L[i][k];\\n L[i][j] = (A2[i][j] - s2) / U[j][j];\\n }\\n }\\n\\n return typeof(return)(L, U, P);\\n}\\n\\nvoid main() {\\n immutable a = [[1.0, 3, 5],\\n [2.0, 4, 7],\\n [1.0, 1, 0]];\\n immutable b = [[11.0, 9, 24, 2],\\n [1.0, 5, 2, 6],\\n [3.0, 17, 18, 1],\\n [2.0, 5, 7, 1]];\\n\\n auto f = \\\"[%([%(%.1f, %)],\\\\n %)]]\\\\n\\\\n\\\".replicate(3);\\n foreach (immutable m; [a, b])\\n writefln(f, lu(m).tupleof);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"(lib 'matrix) ;; the matrix library provides LU-decomposition\\n(decimals 5)\\n\\n(define A (list->array' (1 3 5 2 4 7 1 1 0 ) 3 3))\\n(define PLU (matrix-lu-decompose A)) ;; -> list of three matrices, P, Lower, Upper\\n\\n(array-print (first PLU))\\n0 1 0\\n1 0 0\\n0 0 1\\n(array-print (second PLU))\\n1 0 0\\n0.5 1 0\\n0.5 -1 1\\n(array-print (caddr PLU))\\n2 4 7\\n0 1 1.5\\n0 0 -2\\n\\n(define A (list->array '(11 9 24 2 1 5 2 6 3 17 18 1 2 5 7 1 ) 4 4))\\n(define PLU (matrix-lu-decompose A)) ;; -> list of three matrices, P, Lower, Upper\\n(array-print (first PLU))\\n1 0 0 0\\n0 0 1 0\\n0 1 0 0\\n0 0 0 1\\n\\n(array-print (second PLU))\\n1 0 0 0\\n0.27273 1 0 0\\n0.09091 0.2875 1 0\\n0.18182 0.23125 0.0036 1\\n\\n(array-print (caddr PLU))\\n11 9 24 2\\n0 14.54545 11.45455 0.45455\\n0 0 -3.475 5.6875\\n0 0 0 0.51079\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"program lu1\\n implicit none\\n call check( reshape([real(8)::1,2,1,3,4,1,5,7,0 ],[3,3]) )\\n call check( reshape([real(8)::11,1,3,2,9,5,17,5,24,2,18,7,2,6,1,1],[4,4]) )\\n\\ncontains\\n\\n subroutine check(a)\\n real(8), intent(in) :: a(:,:)\\n integer :: i,j,n\\n real(8), allocatable :: aa(:,:),l(:,:),u(:,:)\\n integer, allocatable :: p(:,:)\\n integer, allocatable :: ipiv(:)\\n n = size(a,1)\\n allocate(aa(n,n),l(n,n),u(n,n),p(n,n),ipiv(n))\\n forall (j=1:n,i=1:n)\\n aa(i,j) = a(i,j)\\n u (i,j) = 0d0\\n p (i,j) = merge(1 ,0 ,i.eq.j)\\n l (i,j) = merge(1d0,0d0,i.eq.j)\\n end forall\\n call lu(aa, ipiv)\\n do i = 1,n\\n l(i, :i-1) = aa(i, :i-1)\\n u(i,i: ) = aa(i,i: )\\n end do\\n p(ipiv,:) = p\\n call mat_print('a',a)\\n call mat_print('p',p)\\n call mat_print('l',l)\\n call mat_print('u',u)\\n print *, \\\"residual\\\"\\n print *, \\\"|| P.A - L.U || = \\\", maxval(abs(matmul(p,a)-matmul(l,u)))\\n end subroutine\\n\\n subroutine lu(a,p)\\n! in situ decomposition, corresponds to LAPACK's dgebtrf\\n real(8), intent(inout) :: a(:,:)\\n integer, intent(out ) :: p(:)\\n integer :: n, i,j,k,kmax\\n n = size(a,1)\\n p = [ ( i, i=1,n ) ]\\n do k = 1,n-1\\n kmax = maxloc(abs(a(p(k:),k)),1) + k-1\\n if (kmax /= k ) then\\n p([k, kmax]) = p([kmax, k])\\n a([k, kmax],:) = a([kmax, k],:)\\n end if\\n a(k+1:,k) = a(k+1:,k) / a(k,k)\\n forall (j=k+1:n) a(k+1:,j) = a(k+1:,j) - a(k,j)*a(k+1:,k)\\n end do\\n end subroutine\\n\\n subroutine mat_print(amsg,a)\\n character(*), intent(in) :: amsg\\n class (*), intent(in) :: a(:,:)\\n integer :: i\\n print*,' '\\n print*,amsg\\n do i=1,size(a,1)\\n select type (a)\\n type is (real(8)) ; print'(100f8.2)',a(i,:)\\n type is (integer) ; print'(100i8 )',a(i,:)\\n end select\\n end do\\n print*,' '\\n end subroutine\\n\\nend program\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\ntype matrix [][]float64\\n\\nfunc zero(n int) matrix {\\n r := make([][]float64, n)\\n a := make([]float64, n*n)\\n for i := range r {\\n r[i] = a[n*i : n*(i+1)]\\n }\\n return r\\n}\\n\\nfunc eye(n int) matrix {\\n r := zero(n)\\n for i := range r {\\n r[i][i] = 1\\n }\\n return r\\n}\\n\\nfunc (m matrix) print(label string) {\\n if label > \\\"\\\" {\\n fmt.Printf(\\\"%s:\\\\n\\\", label)\\n }\\n for _, r := range m {\\n for _, e := range r {\\n fmt.Printf(\\\" %9.5f\\\", e)\\n }\\n fmt.Println()\\n }\\n}\\n\\nfunc (a matrix) pivotize() matrix {\\n p := eye(len(a))\\n for j, r := range a {\\n max := r[j]\\n row := j\\n for i := j; i < len(a); i++ {\\n if a[i][j] > max {\\n max = a[i][j]\\n row = i\\n }\\n }\\n if j != row {\\n // swap rows\\n p[j], p[row] = p[row], p[j]\\n }\\n }\\n return p\\n}\\n\\nfunc (m1 matrix) mul(m2 matrix) matrix {\\n r := zero(len(m1))\\n for i, r1 := range m1 {\\n for j := range m2 {\\n for k := range m1 {\\n r[i][j] += r1[k] * m2[k][j]\\n }\\n }\\n }\\n return r\\n}\\n\\nfunc (a matrix) lu() (l, u, p matrix) {\\n l = zero(len(a))\\n u = zero(len(a))\\n p = a.pivotize()\\n a = p.mul(a)\\n for j := range a {\\n l[j][j] = 1\\n for i := 0; i <= j; i++ {\\n sum := 0.\\n for k := 0; k < i; k++ {\\n sum += u[k][j] * l[i][k]\\n }\\n u[i][j] = a[i][j] - sum\\n }\\n for i := j; i < len(a); i++ {\\n sum := 0.\\n for k := 0; k < j; k++ {\\n sum += u[k][j] * l[i][k]\\n }\\n l[i][j] = (a[i][j] - sum) / u[j][j]\\n }\\n }\\n return\\n}\\n\\nfunc main() {\\n showLU(matrix{\\n {1, 3, 5},\\n {2, 4, 7},\\n {1, 1, 0}})\\n showLU(matrix{\\n {11, 9, 24, 2},\\n {1, 5, 2, 6},\\n {3, 17, 18, 1},\\n {2, 5, 7, 1}})\\n}\\n\\nfunc showLU(a matrix) {\\n a.print(\\\"\\\\na\\\")\\n l, u, p := a.lu()\\n l.print(\\\"l\\\")\\n u.print(\\\"u\\\")\\n p.print(\\\"p\\\")\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\ntype matrix struct {\\n stride int\\n ele []float64\\n}\\n\\nfunc (m *matrix) print(heading string) {\\n if heading > \\\"\\\" {\\n fmt.Print(\\\"\\\\n\\\", heading, \\\"\\\\n\\\")\\n }\\n for e := 0; e < len(m.ele); e += m.stride {\\n fmt.Printf(\\\"%8.5f \\\", m.ele[e:e+m.stride])\\n fmt.Println()\\n }\\n}\\n\\nfunc (m1 *matrix) mul(m2 *matrix) (m3 *matrix, ok bool) {\\n if m1.stride*m2.stride != len(m2.ele) {\\n return nil, false\\n }\\n m3 = &matrix{m2.stride, make([]float64, (len(m1.ele)/m1.stride)*m2.stride)}\\n for m1c0, m3x := 0, 0; m1c0 < len(m1.ele); m1c0 += m1.stride {\\n for m2r0 := 0; m2r0 < m2.stride; m2r0++ {\\n for m1x, m2x := m1c0, m2r0; m2x < len(m2.ele); m2x += m2.stride {\\n m3.ele[m3x] += m1.ele[m1x] * m2.ele[m2x]\\n m1x++\\n }\\n m3x++\\n }\\n }\\n return m3, true\\n}\\n\\nfunc zero(rows, cols int) *matrix {\\n return &matrix{cols, make([]float64, rows*cols)}\\n}\\n\\nfunc eye(n int) *matrix {\\n m := zero(n, n)\\n for ix := 0; ix < len(m.ele); ix += n + 1 {\\n m.ele[ix] = 1\\n }\\n return m\\n}\\n\\nfunc (a *matrix) pivotize() *matrix {\\n pv := make([]int, a.stride)\\n for i := range pv {\\n pv[i] = i\\n }\\n for j, dx := 0, 0; j < a.stride; j++ {\\n row := j\\n max := a.ele[dx]\\n for i, ixcj := j, dx; i < a.stride; i++ {\\n if a.ele[ixcj] > max {\\n max = a.ele[ixcj]\\n row = i\\n }\\n ixcj += a.stride\\n }\\n if j != row {\\n pv[row], pv[j] = pv[j], pv[row]\\n }\\n dx += a.stride + 1\\n }\\n p := zero(a.stride, a.stride)\\n for r, c := range pv {\\n p.ele[r*a.stride+c] = 1\\n }\\n return p\\n}\\n\\nfunc (a *matrix) lu() (l, u, p *matrix) {\\n l = zero(a.stride, a.stride)\\n u = zero(a.stride, a.stride)\\n p = a.pivotize()\\n a, _ = p.mul(a)\\n for j, jxc0 := 0, 0; j < a.stride; j++ {\\n l.ele[jxc0+j] = 1\\n for i, ixc0 := 0, 0; ixc0 <= jxc0; i++ {\\n sum := 0.\\n for k, kxcj := 0, j; k < i; k++ {\\n sum += u.ele[kxcj] * l.ele[ixc0+k]\\n kxcj += a.stride\\n }\\n u.ele[ixc0+j] = a.ele[ixc0+j] - sum\\n ixc0 += a.stride\\n }\\n for ixc0 := jxc0; ixc0 < len(a.ele); ixc0 += a.stride {\\n sum := 0.\\n for k, kxcj := 0, j; k < j; k++ {\\n sum += u.ele[kxcj] * l.ele[ixc0+k]\\n kxcj += a.stride\\n }\\n l.ele[ixc0+j] = (a.ele[ixc0+j] - sum) / u.ele[jxc0+j]\\n }\\n jxc0 += a.stride\\n }\\n return\\n}\\n\\nfunc main() {\\n showLU(&matrix{3, []float64{\\n 1, 3, 5,\\n 2, 4, 7,\\n 1, 1, 0}})\\n showLU(&matrix{4, []float64{\\n 11, 9, 24, 2,\\n 1, 5, 2, 6,\\n 3, 17, 18, 1,\\n 2, 5, 7, 1}})\\n}\\n\\nfunc showLU(a *matrix) {\\n a.print(\\\"\\\\na\\\")\\n l, u, p := a.lu()\\n l.print(\\\"l\\\")\\n u.print(\\\"u\\\")\\n p.print(\\\"p\\\")\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n\\n \\\"gonum.org/v1/gonum/mat\\\"\\n)\\n\\nfunc main() {\\n showLU(mat.NewDense(3, 3, []float64{\\n 1, 3, 5,\\n 2, 4, 7,\\n 1, 1, 0,\\n }))\\n fmt.Println()\\n showLU(mat.NewDense(4, 4, []float64{\\n 11, 9, 24, 2,\\n 1, 5, 2, 6,\\n 3, 17, 18, 1,\\n 2, 5, 7, 1,\\n }))\\n}\\n\\nfunc showLU(a *mat.Dense) {\\n fmt.Printf(\\\"a: %v\\\\n\\\\n\\\", mat.Formatted(a, mat.Prefix(\\\" \\\")))\\n var lu mat.LU\\n lu.Factorize(a)\\n l := lu.LTo(nil)\\n u := lu.UTo(nil)\\n fmt.Printf(\\\"l: %.5f\\\\n\\\\n\\\", mat.Formatted(l, mat.Prefix(\\\" \\\")))\\n fmt.Printf(\\\"u: %.5f\\\\n\\\\n\\\", mat.Formatted(u, mat.Prefix(\\\" \\\")))\\n fmt.Println(\\\"p:\\\", lu.Pivot(nil))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n\\n mat \\\"github.com/skelterjohn/go.matrix\\\"\\n)\\n\\nfunc main() {\\n showLU(mat.MakeDenseMatrixStacked([][]float64{\\n {1, 3, 5},\\n {2, 4, 7},\\n {1, 1, 0}}))\\n showLU(mat.MakeDenseMatrixStacked([][]float64{\\n {11, 9, 24, 2},\\n {1, 5, 2, 6},\\n {3, 17, 18, 1},\\n {2, 5, 7, 1}}))\\n}\\n\\nfunc showLU(a *mat.DenseMatrix) {\\n fmt.Printf(\\\"\\\\na:\\\\n%v\\\\n\\\", a)\\n l, u, p := a.LU()\\n fmt.Printf(\\\"l:\\\\n%v\\\\n\\\", l)\\n fmt.Printf(\\\"u:\\\\n%v\\\\n\\\", u)\\n fmt.Printf(\\\"p:\\\\n%v\\\\n\\\", p)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List\\nimport Data.Maybe\\nimport Text.Printf\\n\\n-- a matrix is represented as a list of columns\\nmmult :: Num a => [[a]] -> [[a]] -> [[a]]\\nmmult a b = [ [ sum $ zipWith (*) ak bj | ak <- (transpose a) ] | bj <- b ]\\n\\nnth mA i j = (mA !! j) !! i\\n\\nidMatrixPart n m k = [ [if (i==j) then 1 else 0 | i <- [1..n]] | j <- [k..m]]\\nidMatrix n = idMatrixPart n n 1\\n\\npermMatrix n ix1 ix2 =\\n [ [ if ((i==ix1 && j==ix2) || (i==ix2 && j==ix1) || (i==j && j /= ix1 && i /= ix2))\\n then 1 else 0| i <- [0..n-1]] | j <- [0..n-1]]\\npermMatrix_inv n ix1 ix2 = permMatrix n ix2 ix1\\n\\n-- count k from zero\\nelimColumn :: Int -> [[Rational]] -> Int -> [Rational]\\nelimMatrix :: Int -> [[Rational]] -> Int -> [[Rational]]\\nelimMatrix_inv :: Int -> [[Rational]] -> Int -> [[Rational]]\\n\\nelimColumn n mA k = [(let mAkk = (nth mA k k) in if (i>k) then (-(nth mA i k)/mAkk)\\n else if (i==k) then 1 else 0) | i <- [0..n-1]]\\nelimMatrix n mA k = (idMatrixPart n k 1) ++ [elimColumn n mA k] ++ (idMatrixPart n n (k+2))\\nelimMatrix_inv n mA k = (idMatrixPart n k 1) ++ --mA is elimMatrix there\\n [let c = (mA!!k) in [if (i==k) then 1 else if (i<k) then 0 else (-(c!!i)) | i <- [0..n-1]]]\\n ++ (idMatrixPart n n (k+2))\\n\\nswapIndx :: [[Rational]] -> Int -> Int\\nswapIndx mA k = fromMaybe k (findIndex (>0) (drop k (mA!!k)))\\n\\n-- LUP; lupStep returns [L:U:P]\\npaStep_recP :: Int -> [[Rational]] -> [[Rational]] -> [[Rational]] -> Int -> [[[Rational]]]\\npaStep_recM :: Int -> [[Rational]] -> [[Rational]] -> [[Rational]] -> Int -> [[[Rational]]]\\nlupStep :: Int -> [[Rational]] -> [[[Rational]]]\\n\\npaStep_recP n mP mA mL cnt =\\n let mPt = permMatrix n cnt (swapIndx mA cnt) in\\n let mPtInv = permMatrix_inv n cnt (swapIndx mA cnt) in\\n if (cnt >= n) then [(mmult mP mL),mA,mP] else\\n (paStep_recM n (mmult mPt mP) (mmult mPt mA) (mmult mL mPtInv) cnt)\\n\\npaStep_recM n mP mA mL cnt =\\n let mMt = elimMatrix n mA cnt in\\n let mMtInv = elimMatrix_inv n mMt cnt in\\n paStep_recP n mP (mmult mMt mA) (mmult mL mMtInv) (cnt + 1)\\n\\nlupStep n mA = paStep_recP n (idMatrix n) mA (idMatrix n) 0\\n\\n--IO\\nmatrixFromRationalToString m = concat $ intersperse \\\"\\\\n\\\"\\n (map (\\\\x -> unwords $ printf \\\"%8.4f\\\" <$> (x::[Double]))\\n (transpose (matrixFromRational m))) where\\n matrixFromRational m = map (\\\\x -> map fromRational x) m\\n\\nsolveTask mY = let mLUP = lupStep (length mY) mY in\\n putStrLn (\\\"A: \\\\n\\\" ++ matrixFromRationalToString mY) >>\\n putStrLn (\\\"L: \\\\n\\\" ++ matrixFromRationalToString (mLUP!!0)) >>\\n putStrLn (\\\"U: \\\\n\\\" ++ matrixFromRationalToString (mLUP!!1)) >>\\n putStrLn (\\\"P: \\\\n\\\" ++ matrixFromRationalToString (mLUP!!2)) >>\\n putStrLn (\\\"Verify: PA\\\\n\\\" ++ matrixFromRationalToString (mmult (mLUP!!2) mY)) >>\\n putStrLn (\\\"Verify: LU\\\\n\\\" ++ matrixFromRationalToString (mmult (mLUP!!0) (mLUP!!1)))\\n\\nmY1 = [[1, 2, 1], [3, 4, 7], [5, 7, 0]] :: [[Rational]]\\nmY2 = [[11, 1, 3, 2], [9, 5, 17, 5], [24, 2, 18, 7], [2, 6, 1, 1]] :: [[Rational]]\\nmain = putStrLn \\\"Task1: \\\\n\\\" >> solveTask mY1 >>\\n putStrLn \\\"Task2: \\\\n\\\" >> solveTask mY2\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Numeric.LinearAlgebra\\n\\na1, a2 :: Matrix R\\na1 = (3><3)\\n [1,3,5\\n ,2,4,7\\n ,1,1,0]\\n\\na2 = (4><4)\\n [11, 9, 24, 2\\n , 1, 5, 2, 6\\n , 3, 17, 18, 1\\n , 2, 5, 7, 1]\\n\\nmain = do\\n print $ lu a1\\n print $ lu a2\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"module Main\\n\\nimport Data.Vect\\n\\nMatrix : Nat -> Nat -> Type -> Type\\nMatrix m n t = Vect m (Vect n t)\\n\\n-- Creates list from 0 to n (not including n)\\nupTo : (m : Nat) -> Vect m (Fin m)\\nupTo Z = []\\nupTo (S n) = 0 :: (map FS (upTo n))\\n\\n-- Creates list from 0 to n-1 (not including n-1)\\nupToM1 : (m : Nat) -> (sz ** Vect sz (Fin m))\\nupToM1 m = case (upTo m) of\\n (y::ys) => (_ ** init(y::ys))\\n [] => (_ ** [])\\n\\n-- Creates list from i to n (not including n)\\nfromUpTo : {n : Nat} -> Fin n -> (sz ** Vect sz (Fin n))\\nfromUpTo {n} m = filter (>= m) (upTo n)\\n\\n-- Creates list from i+1 to n (not including n)\\nfromUpTo1 : {n : Nat} -> Fin n -> (sz ** Vect sz (Fin n))\\nfromUpTo1 {n} m with (fromUpTo m)\\n | (_ ** xs) = case xs of\\n (y::ys) => (_ ** ys)\\n [] => (_ ** [])\\n\\n\\n-- Create Zero Matrix of size m by n\\nzeros : (m : Nat) -> (n : Nat) -> Matrix m n Double\\nzeros m n = replicate m (replicate n 0.0)\\n\\nreplaceAtM : (Fin m, Fin n) -> t -> Matrix m n t -> Matrix m n t\\nreplaceAtM (i, j) e a = replaceAt i (replaceAt j e (index i a)) a\\n\\n-- Create Identity Matrix of size m by m\\neye : (m : Nat) -> Matrix m m Double\\neye m = map create1Vec (upTo m)\\n where\\n set1 : Vect m Double -> Fin m -> Vect m Double\\n set1 a n = replaceAt n 1.0 a\\n\\n create1Vec : Fin m -> Vect m Double\\n create1Vec n = set1 (replicate m 0.0) n\\n\\n\\nindexM : (Fin m, Fin n) -> Matrix m n t -> t\\nindexM (i, j) a = index j (index i a)\\n\\n\\n-- Obtain index for the row containing the\\n-- largest absolute value for the given column\\ncolAbsMaxIndex : Fin m -> Fin m -> Matrix m m Double -> Fin m\\ncolAbsMaxIndex startRow col a {m} with (fromUpTo startRow)\\n | (_ ** xs) =\\n snd $ foldl (\\\\(absMax, idx), curIdx =>\\n let curAbsVal = abs(indexM (curIdx, col) a) in\\n if (curAbsVal > absMax)\\n then (curAbsVal, curIdx)\\n else (absMax, idx)\\n ) (0.0, startRow) xs\\n\\n\\n-- Swaps two rows in a given matrix\\nswapRows : Fin m -> Fin m -> Matrix m n t -> Matrix m n t\\nswapRows r1 r2 a = replaceAt r2 tempRow $ replaceAt r1 (index r2 a) a\\n where tempRow = index r1 a\\n\\n\\n-- Swaps two individual values in a matrix\\nswapValues : (Fin m, Fin m) -> (Fin m, Fin m) -> Matrix m m Double -> Matrix m m Double\\nswapValues (i1, j1) (i2, j2) m = replaceAtM (i2, j2) v1 $ replaceAtM (i1, j1) v2 m\\n where\\n v1 = indexM (i1, j1) m\\n v2 = indexM (i2, j2) m\\n\\n-- Perform row Swap on Lower Triangular Matrix\\nlSwapRow : Fin m -> Fin m -> Matrix m m Double -> Matrix m m Double\\nlSwapRow row1 row2 l {m} with (filter (< row1) (upTo m))\\n | (_ ** xs) = foldl (\\\\l',col => swapValues (row1, col) (row2, col) l') l xs\\n\\n\\nrowSwap : Fin m -> (Matrix m m Double, Matrix m m Double, Matrix m m Double) ->\\n (Matrix m m Double, Matrix m m Double, Matrix m m Double)\\nrowSwap col (l,u,p) = (lSwapRow col row l, swapRows col row u, swapRows col row p)\\n where row = colAbsMaxIndex col col u\\n\\n\\ncalc : (Fin m) -> (Fin m) -> (Matrix m m Double, Matrix m m Double) ->\\n (Matrix m m Double, Matrix m m Double)\\ncalc i j (l, u) {m} = (l', u')\\n where\\n l' : Matrix m m Double\\n l' = replaceAtM (j, i) ((indexM (j, i) u) / indexM (i, i) u) l\\n\\n u'' : (Fin m) -> (Matrix m m Double) -> (Matrix m m Double)\\n u'' k u = replaceAtM (j, k) ((indexM (j, k) u) -\\n ((indexM (j, i) l') * (indexM (i, k) u))) u\\n\\n u' : (Matrix m m Double)\\n u' with (fromUpTo i) | (_ ** xs) = foldl (\\\\curU, idx => u'' idx curU) u xs\\n\\n\\n-- Perform a single iteration of the algorithm for the given column\\niteration : Fin m -> (Matrix m m Double, Matrix m m Double, Matrix m m Double) ->\\n (Matrix m m Double, Matrix m m Double, Matrix m m Double)\\niteration i lup {m} = iterate' (rowSwap i lup)\\n\\n where\\n modify : (Matrix m m Double, Matrix m m Double) ->\\n (Matrix m m Double, Matrix m m Double)\\n modify lu with (fromUpTo1 i) | (_ ** xs) =\\n foldl (\\\\lu',j => calc i j lu') lu xs\\n\\n iterate' : (Matrix m m Double, Matrix m m Double, Matrix m m Double) ->\\n (Matrix m m Double, Matrix m m Double, Matrix m m Double)\\n iterate' (l, u, p) with (modify (l, u)) | (l', u') = (l', u', p)\\n\\n\\n-- Generate L, U, P matricies from a given square matrix.\\n-- Where L * U = A, and P is the permutation matrix\\nluDecompose : Matrix m m Double -> (Matrix m m Double, Matrix m m Double, Matrix m m Double)\\nluDecompose a {m} with (upToM1 m)\\n | (_ ** xs) = foldl (\\\\lup,idx => iteration idx lup) (eye m,a,eye m) xs\\n\\n\\n\\nex1 : (Matrix 3 3 Double, Matrix 3 3 Double, Matrix 3 3 Double)\\nex1 = luDecompose [[1, 3, 5], [2, 4, 7], [1, 1, 0]]\\n\\nex2 : (Matrix 4 4 Double, Matrix 4 4 Double, Matrix 4 4 Double)\\nex2 = luDecompose [[11, 9, 24, 2], [1, 5, 2, 6], [3, 17, 18, 1], [2, 5, 7, 1]]\\n\\nprintEx : (Matrix n n Double, Matrix n n Double, Matrix n n Double) -> IO ()\\nprintEx (l, u, p) = do\\n putStr \\\"l:\\\"\\n print l\\n putStrLn \\\"\\\\n\\\"\\n\\n putStr \\\"u:\\\"\\n print u\\n putStrLn \\\"\\\\n\\\"\\n\\n putStr \\\"p:\\\"\\n print p\\n putStrLn \\\"\\\\n\\\"\\n\\nmain : IO()\\nmain = do\\n putStrLn \\\"Solution 1:\\\"\\n printEx ex1\\n putStrLn \\\"Solution 2:\\\"\\n printEx ex2\\n\",\n \"language\": \"Idris\"\n },\n {\n \"code\": \"mp=: +/ .*\\n\\nLU=: 3 : 0\\n 'm n'=. $ A=. y\\n if. 1=m do.\\n p ; (=1) ; p{\\\"1 A [ p=. C. (n-1);~.0,(0~:,A)i.1\\n else.\\n m2=. >.m%2\\n 'p1 L1 U1'=. LU m2{.A\\n D=. (/:p1) {\\\"1 m2}.A\\n F=. m2 {.\\\"1 D\\n E=. m2 {.\\\"1 U1\\n FE1=. F mp %. E\\n G=. m2}.\\\"1 D - FE1 mp U1\\n 'p2 L2 U2'=. LU G\\n p3=. (i.m2),m2+p2\\n H=. (/:p3) {\\\"1 U1\\n (p1{p3) ; (L1,FE1,.L2) ; H,(-n){.\\\"1 U2\\n end.\\n)\\n\\npermtomat=: 1 {.~\\\"0 -@>:@:/:\\nLUdecompose=: (permtomat&.>@{. , }.)@:LU\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" A=:3 3$1 3 5 2 4 7 1 1 0\\n LUdecompose A\\n┌─────┬─────┬───────┐\\n│1 0 0│1 0 0│1 3 5│\\n│0 1 0│2 1 0│0 _2 _3│\\n│0 0 1│1 1 1│0 0 _2│\\n└─────┴─────┴───────┘\\n mp/> LUdecompose A\\n1 3 5\\n2 4 7\\n1 1 0\\n\\n A=:4 4$11 9 24 2 1 5 2 6 3 17 18 1 2 5 7 1\\n LUdecompose A\\n┌───────┬─────────────────────────────┬─────────────────────────────┐\\n│1 0 0 0│ 1 0 0 0│11 9 24 2│\\n│0 1 0 0│0.0909091 1 0 0│ 0 4.18182 _0.181818 5.81818│\\n│0 0 1 0│ 0.272727 3.47826 1 0│ 0 0 12.087 _19.7826│\\n│0 0 0 1│ 0.181818 0.804348 0.230216 1│ 0 0 0 0.510791│\\n└───────┴─────────────────────────────┴─────────────────────────────┘\\n mp/> LUdecompose A\\n11 9 24 2\\n 1 5 2 6\\n 3 17 18 1\\n 2 5 7 1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import static java.util.Arrays.stream;\\nimport java.util.Locale;\\nimport static java.util.stream.IntStream.range;\\n\\npublic class Test {\\n\\n static double dotProduct(double[] a, double[] b) {\\n return range(0, a.length).mapToDouble(i -> a[i] * b[i]).sum();\\n }\\n\\n static double[][] matrixMul(double[][] A, double[][] B) {\\n double[][] result = new double[A.length][B[0].length];\\n double[] aux = new double[B.length];\\n\\n for (int j = 0; j < B[0].length; j++) {\\n\\n for (int k = 0; k < B.length; k++)\\n aux[k] = B[k][j];\\n\\n for (int i = 0; i < A.length; i++)\\n result[i][j] = dotProduct(A[i], aux);\\n }\\n return result;\\n }\\n\\n static double[][] pivotize(double[][] m) {\\n int n = m.length;\\n double[][] id = range(0, n).mapToObj(j -> range(0, n)\\n .mapToDouble(i -> i == j ? 1 : 0).toArray())\\n .toArray(double[][]::new);\\n\\n for (int i = 0; i < n; i++) {\\n double maxm = m[i][i];\\n int row = i;\\n for (int j = i; j < n; j++)\\n if (m[j][i] > maxm) {\\n maxm = m[j][i];\\n row = j;\\n }\\n\\n if (i != row) {\\n double[] tmp = id[i];\\n id[i] = id[row];\\n id[row] = tmp;\\n }\\n }\\n return id;\\n }\\n\\n static double[][][] lu(double[][] A) {\\n int n = A.length;\\n double[][] L = new double[n][n];\\n double[][] U = new double[n][n];\\n double[][] P = pivotize(A);\\n double[][] A2 = matrixMul(P, A);\\n\\n for (int j = 0; j < n; j++) {\\n L[j][j] = 1;\\n for (int i = 0; i < j + 1; i++) {\\n double s1 = 0;\\n for (int k = 0; k < i; k++)\\n s1 += U[k][j] * L[i][k];\\n U[i][j] = A2[i][j] - s1;\\n }\\n for (int i = j; i < n; i++) {\\n double s2 = 0;\\n for (int k = 0; k < j; k++)\\n s2 += U[k][j] * L[i][k];\\n L[i][j] = (A2[i][j] - s2) / U[j][j];\\n }\\n }\\n return new double[][][]{L, U, P};\\n }\\n\\n static void print(double[][] m) {\\n stream(m).forEach(a -> {\\n stream(a).forEach(n -> System.out.printf(Locale.US, \\\"%5.1f \\\", n));\\n System.out.println();\\n });\\n System.out.println();\\n }\\n\\n public static void main(String[] args) {\\n double[][] a = {{1.0, 3, 5}, {2.0, 4, 7}, {1.0, 1, 0}};\\n\\n double[][] b = {{11.0, 9, 24, 2}, {1.0, 5, 2, 6}, {3.0, 17, 18, 1},\\n {2.0, 5, 7, 1}};\\n\\n for (double[][] m : lu(a))\\n print(m);\\n\\n System.out.println();\\n\\n for (double[][] m : lu(b))\\n print(m);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"const mult=(a, b)=>{\\n let res = new Array(a.length);\\n for (let r = 0; r < a.length; ++r) {\\n res[r] = new Array(b[0].length);\\n for (let c = 0; c < b[0].length; ++c) {\\n res[r][c] = 0;\\n for (let i = 0; i < a[0].length; ++i)\\n res[r][c] += a[r][i] * b[i][c];\\n }\\n }\\n return res;\\n}\\n\\nconst lu = (mat) => {\\n let lower = [],upper = [],n=mat.length;;\\n for(let i=0;i<n;i++){\\n lower.push([]);\\n upper.push([]);\\n for(let j=0;j<n;j++){\\n lower[i].push(0);\\n upper[i].push(0);\\n }\\n }\\n for (let i = 0; i < n; i++) {\\n for (let k = i; k < n; k++){\\n let sum = 0;\\n for (let j = 0; j < i; j++)\\n sum += (lower[i][j] * upper[j][k]);\\n upper[i][k] = mat[i][k] - sum;\\n }\\n for (let k = i; k < n; k++) {\\n if (i == k)\\n lower[i][i] = 1;\\n else{\\n let sum = 0;\\n for (let j = 0; j < i; j++)\\n sum += (lower[k][j] * upper[j][i]);\\n lower[k][i] = (mat[k][i] - sum) / upper[i][i];\\n }\\n }\\n }\\n return [lower,upper];\\n}\\n\\nconst pivot = (m) =>{\\n let n = m.length;\\n let id = [];\\n for(let i=0;i<n;i++){\\n id.push([]);\\n for(let j=0;j<n;j++){\\n if(i===j)\\n id[i].push(1);\\n else\\n id[i].push(0);\\n }\\n }\\n for (let i = 0; i < n; i++) {\\n let maxm = m[i][i];\\n let row = i;\\n for (let j = i; j < n; j++)\\n if (m[j][i] > maxm) {\\n maxm = m[j][i];\\n row = j;\\n }\\n if (i != row) {\\n let tmp = id[i];\\n id[i] = id[row];\\n id[row] = tmp;\\n }\\n }\\n return id;\\n}\\n\\nconst luDecomposition=(A)=>{\\n const P = pivot(A);\\n A = mult(P,A);\\n return [...lu(A),P];\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Create an m x n matrix\\ndef matrix(m; n; init):\\n if m == 0 then []\\n elif m == 1 then [range(0;n)] | map(init)\\n elif m > 0 then\\n matrix(1;n;init) as $row\\n | [range(0;m)] | map( $row )\\n else error(\\\"matrix\\\\(m);_;_) invalid\\\")\\n end ;\\n\\ndef I(n): matrix(n;n;0) as $m\\n | reduce range(0;n) as $i ($m; . | setpath( [$i,$i]; 1));\\n\\ndef dot_product(a; b):\\n reduce range(0;a|length) as $i (0; . + (a[$i] * b[$i]) );\\n\\n# transpose/0 expects its input to be a rectangular matrix\\ndef transpose:\\n if (.[0] | length) == 0 then []\\n else [map(.[0])] + (map(.[1:]) | transpose)\\n end ;\\n\\n# A and B should both be numeric matrices, A being m by n, and B being n by p.\\ndef multiply(A; B):\\n (B[0]|length) as $p\\n | (B|transpose) as $BT\\n | reduce range(0; A|length) as $i\\n ([];\\n reduce range(0; $p) as $j\\n (.;\\n .[$i][$j] = dot_product( A[$i]; $BT[$j] ) ));\\n\\ndef swap_rows(i;j):\\n if i == j then .\\n else .[i] as $i | .[i] = .[j] | .[j] = $i\\n end ;\\n\\n# Print a matrix neatly, each cell occupying n spaces, but without truncation\\ndef neatly(n):\\n def right: tostring | ( \\\" \\\" * (n-length) + .);\\n . as $in\\n | length as $length\\n | reduce range (0;$length) as $i\\n (\\\"\\\"; . + reduce range(0;$length) as $j\\n (\\\"\\\"; \\\"\\\\(.) \\\\($in[$i][$j] | right )\\\" ) + \\\"\\\\n\\\" ) ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Create the pivot matrix for the input matrix.\\n# Use \\\"range(0;$n) as $i\\\" to handle ill-conditioned cases.\\ndef pivotize:\\n def abs: if .<0 then -. else . end;\\n length as $n\\n | . as $m\\n | reduce range(0;$n) as $j\\n (I($n);\\n # state: [row; max]\\n (reduce range(0; $n) as $i\\n ([$j, $m[$j][$j]|abs ];\\n ($m[$i][$j]|abs) as $a\\n | if $a > .[1] then [ $i, $a ] else . end) | .[0]) as $row\\n | swap_rows( $j; $row)\\n ) ;\\n\\n# Decompose the input nxn matrix A by PA=LU and return [L, U, P].\\ndef lup:\\n def div(i;j):\\n if j == 0 then if i==0 then 0 else error(\\\"\\\\(i)/0\\\") end\\n else i/j\\n end;\\n . as $A\\n | length as $n\\n | I($n) as $L # matrix($n; $n; 0.0) as $L\\n | matrix($n; $n; 0.0) as $U\\n | ($A|pivotize) as $P\\n | multiply($P;$A) as $A2\\n # state: [L, U]\\n | reduce range(0; $n) as $i ( [$L, $U];\\n reduce range(0; $n) as $j (.;\\n .[0] as $L\\n | .[1] as $U\\n | if ($j >= $i) then\\n (reduce range(0;$i) as $k (0; . + ($U[$k][$j] * $L[$i][$k] ))) as $s1\\n | [$L, ($U| setpath([$i,$j]; ($A2[$i][$j] - $s1))) ]\\n else\\n (reduce range(0;$j) as $k (0; . + ($U[$k][$j] * $L[$i][$k]))) as $s2\\n | [ ($L | setpath([$i,$j]; div(($A2[$i][$j] - $s2) ; $U[$j][$j] ))), $U ]\\n end ))\\n | . + [ $P ]\\n;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def a: [[1, 3, 5], [2, 4, 7], [1, 1, 0]];\\na | lup[] | neatly(4)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \" $ /usr/local/bin/jq -M -n -r -f LU.jq\\n 1 0 0\\n 0.5 1 0\\n 0.5 -1 1\\n\\n 2 4 7\\n 0 1 1.5\\n 0 0 -2\\n\\n 0 1 0\\n 1 0 0\\n 0 0 1\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def b: [[11,9,24,2],[1,5,2,6],[3,17,18,1],[2,5,7,1]];\\nb | lup[] | neatly(21)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ /usr/local/bin/jq -M -n -r -f LU.jq\\n 1 0 0 0\\n 0.2727272727272727 1 0 0\\n 0.09090909090909091 0.2875 1 0\\n 0.18181818181818182 0.23124999999999996 0.0035971223021580693 1\\n\\n 11 9 24 2\\n 0 14.545454545454547 11.454545454545455 0.4545454545454546\\n 0 0 -3.4749999999999996 5.6875\\n 0 0 0 0.510791366906476\\n\\n 1 0 0 0\\n 0 0 1 0\\n 0 1 0 0\\n 0 0 0 1\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# A|lup|verify(A) should be true\\ndef verify(A):\\n .[0] as $L | .[1] as $U | .[2] as $P\\n | multiply($P; A) == multiply($L; $U);\\n\\ndef A:\\n [[1, 1, 1, 1],\\n [1, 1, -1, -1],\\n [1, -1, 0, 0],\\n [0, 0, 1, -1]];\\n\\nA|lup|verify(A)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"// version 1.1.4-3\\n\\ntypealias Vector = DoubleArray\\ntypealias Matrix = Array<Vector>\\n\\noperator fun Matrix.times(other: Matrix): Matrix {\\n val rows1 = this.size\\n val cols1 = this[0].size\\n val rows2 = other.size\\n val cols2 = other[0].size\\n require(cols1 == rows2)\\n val result = Matrix(rows1) { Vector(cols2) }\\n for (i in 0 until rows1) {\\n for (j in 0 until cols2) {\\n for (k in 0 until rows2) {\\n result[i][j] += this[i][k] * other[k][j]\\n }\\n }\\n }\\n return result\\n}\\n\\nfun pivotize(m: Matrix): Matrix {\\n val n = m.size\\n val im = Array(n) { Vector(n) }\\n for (i in 0 until n) im[i][i] = 1.0\\n for (i in 0 until n) {\\n var max = m[i][i]\\n var row = i\\n for (j in i until n) {\\n if (m[j][i] > max) {\\n max = m[j][i]\\n row = j\\n }\\n }\\n if (i != row) {\\n val t = im[i]\\n im[i] = im[row]\\n im[row] = t\\n }\\n }\\n return im\\n}\\n\\nfun lu(a: Matrix): Array<Matrix> {\\n val n = a.size\\n val l = Array(n) { Vector(n) }\\n val u = Array(n) { Vector(n) }\\n val p = pivotize(a)\\n val a2 = p * a\\n\\n for (j in 0 until n) {\\n l[j][j] = 1.0\\n for (i in 0 until j + 1) {\\n var sum = 0.0\\n for (k in 0 until i) sum += u[k][j] * l[i][k]\\n u[i][j] = a2[i][j] - sum\\n }\\n for (i in j until n) {\\n var sum2 = 0.0\\n for(k in 0 until j) sum2 += u[k][j] * l[i][k]\\n l[i][j] = (a2[i][j] - sum2) / u[j][j]\\n }\\n }\\n return arrayOf(l, u, p)\\n}\\n\\nfun printMatrix(title: String, m: Matrix, f: String) {\\n val n = m.size\\n println(\\\"\\\\n$title\\\\n\\\")\\n for (i in 0 until n) {\\n for (j in 0 until n) print(\\\"${f.format(m[i][j])} \\\")\\n println()\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val a1 = arrayOf(\\n doubleArrayOf( 1.0, 3.0, 5.0),\\n doubleArrayOf( 2.0, 4.0, 7.0),\\n doubleArrayOf( 1.0, 1.0, 0.0)\\n )\\n val (l1, u1, p1) = lu(a1)\\n println(\\\"EXAMPLE 1:-\\\")\\n printMatrix(\\\"A:\\\", a1, \\\"%1.0f\\\")\\n printMatrix(\\\"L:\\\", l1, \\\"% 7.5f\\\")\\n printMatrix(\\\"U:\\\", u1, \\\"% 8.5f\\\")\\n printMatrix(\\\"P:\\\", p1, \\\"%1.0f\\\")\\n\\n val a2 = arrayOf(\\n doubleArrayOf(11.0, 9.0, 24.0, 2.0),\\n doubleArrayOf( 1.0, 5.0, 2.0, 6.0),\\n doubleArrayOf( 3.0, 17.0, 18.0, 1.0),\\n doubleArrayOf( 2.0, 5.0, 7.0, 1.0)\\n )\\n val (l2, u2, p2) = lu(a2)\\n println(\\\"\\\\nEXAMPLE 2:-\\\")\\n printMatrix(\\\"A:\\\", a2, \\\"%2.0f\\\")\\n printMatrix(\\\"L:\\\", l2, \\\"%7.5f\\\")\\n printMatrix(\\\"U:\\\", u2, \\\"%8.5f\\\")\\n printMatrix(\\\"P:\\\", p2, \\\"%1.0f\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"import std\\n\\n// derived from JAMA v1.03\\n\\n// rectangular input array A is transformed in place to LU form\\n\\ndef LUDecomposition(LU):\\n // Use a \\\"left-looking\\\", dot-product, Crout/Doolittle algorithm.\\n let m = LU.length\\n let n = LU[0].length\\n let piv = map(m): _\\n var pivsign = 1\\n let LUcolj = map(m): 0.0\\n // Outer loop.\\n for(n) j:\\n // Make a copy of the j-th column to localize references\\n for(m) i:\\n LUcolj[i] = LU[i][j]\\n // Apply previous transformations\\n for(m) i:\\n let LUrowi = LU[i]\\n // Most of the time is spent in the following dot product\\n let kmax = min(i,j)\\n var s = 0.0\\n for(kmax) k:\\n s += LUrowi[k] * LUcolj[k]\\n s = LUcolj[i] - s\\n LUcolj[i] = s\\n LUrowi[j] = s\\n // Find pivot and exchange if necessary.\\n var p = j\\n var i = j+1\\n while i < m:\\n if abs(LUcolj[i]) > abs(LUcolj[p]):\\n p = i\\n i += 1\\n if p != j:\\n for(n) k:\\n let t = LU[p][k]\\n LU[p][k] = LU[j][k]\\n LU[j][k] = t\\n let k = piv[p]\\n piv[p] = piv[j]\\n piv[j] = k\\n pivsign = -pivsign\\n // Compute multipliers.\\n if j < m and LU[j][j] != 0.0:\\n i = j+1\\n while i < m:\\n LU[i][j] /= LU[j][j]\\n i += 1\\n return piv\\n\\ndef print_A(A):\\n print \\\"A:\\\"\\n for(A) row:\\n print row\\n\\ndef print_L(LU):\\n print \\\"L:\\\"\\n for(LU) lurow, i:\\n let row = map(lurow.length): 0.0\\n for(lurow) x, j:\\n if i > j:\\n row[j] = x\\n else: if i == j:\\n row[j] = 1.0\\n print row\\n\\ndef print_U(LU):\\n print \\\"U:\\\"\\n for(LU) lurow, i:\\n let row = map(lurow.length): 0.0\\n for(lurow) x, j:\\n if i <= j:\\n row[j] = x\\n print row\\n\\ndef print_P(piv):\\n print \\\"P:\\\"\\n for(piv) j:\\n let row = map(piv.length): 0\\n row[j] = 1\\n print row\\n\\nvar A = [[1., 3., 5.],\\n [2., 4., 7.],\\n [1., 1., 0.]]\\n\\nprint_A A\\nvar piv = LUDecomposition(A)\\nprint_L A\\nprint_U A\\nprint_P piv\\n\\nA = [[11., 9., 24., 2.],\\n [ 1., 5., 2., 6.],\\n [ 3., 17., 18., 1.],\\n [ 2., 5., 7., 1.]]\\n\\nprint_A A\\npiv = LUDecomposition(A)\\nprint_L A\\nprint_U A\\nprint_P piv\\n\",\n \"language\": \"Lobster\"\n },\n {\n \"code\": \"A:=<<1.0|3.0|5.0>,<2.0|4.0|7.0>,<1.0|1.0|0.0>>:\\n\\nLinearAlgebra:-LUDecomposition(A);\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"A:=<<11.0|9.0|24.0|2.0>,<1.0|5.0|2.0|6.0>,\\n <3.0|17.0|18.0|1.0>,<2.0|5.0|7.0|1.0>>:\\n\\nwith(LinearAlgebra):\\n\\nLUDecomposition(A);\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"(*Ex1*)a = {{1, 3, 5}, {2, 4, 7}, {1, 1, 0}};\\n{lu, p, c} = LUDecomposition[a];\\nl = LowerTriangularize[lu, -1] + IdentityMatrix[Length[p]];\\nu = UpperTriangularize[lu];\\nP = Part[IdentityMatrix[Length[p]], p] ;\\nMatrixForm /@ {P.a , P, l, u, l.u}\\n\\n(*Ex2*)a = {{11, 9, 24, 2}, {1, 5, 2, 6}, {3, 17, 18, 1}, {2, 5, 7, 1}};\\n{lu, p, c} = LUDecomposition[a];\\nl = LowerTriangularize[lu, -1] + IdentityMatrix[Length[p]];\\nu = UpperTriangularize[lu];\\nP = Part[IdentityMatrix[Length[p]], p] ;\\nMatrixForm /@ {P.a , P, l, u, l.u}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \" A = [\\n 1 3 5\\n 2 4 7\\n 1 1 0];\\n\\n [L,U,P] = lu(A)\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \" A = [\\n 11 9 24 2\\n 1 5 2 6\\n 3 17 18 1\\n 2 5 7 1 ];\\n\\n [L,U,P] = lu(A)\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"function [ P, L, U ] = LUdecomposition(A)\\n\\n% Ensures A is n by n\\nsz = size(A);\\nif sz(1)~=sz(2)\\n fprintf('A is not n by n\\\\n');\\n clear x;\\n return;\\nend\\n\\nn = sz(1);\\nL = eye(n);\\nP = eye(n);\\nU = A;\\n\\nfor i=1:sz(1)\\n\\n % Row reducing\\n if U(i,i)==0\\n maximum = max(abs(U(i:end,1)));\\n for k=1:n\\n if maximum == abs(U(k,i))\\n temp = U(1,:);\\n U(1,:) = U(k,:);\\n U(k,:) = temp;\\n\\n temp = P(:,1);\\n P(1,:) = P(k,:);\\n P(k,:) = temp;\\n end\\n end\\n\\n end\\n\\n if U(i,i)~=1\\n temp = eye(n);\\n temp(i,i)=U(i,i);\\n L = L * temp;\\n U(i,:) = U(i,:)/U(i,i); %Ensures the pivots are 1.\\n end\\n\\n if i~=sz(1)\\n\\n for j=i+1:length(U)\\n temp = eye(n);\\n temp(j,i) = U(j,i);\\n L = L * temp;\\n U(j,:) = U(j,:)-U(j,i)*U(i,:);\\n\\n end\\n end\\n\\n\\nend\\nP = P';\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"/* LU decomposition is built-in */\\n\\na: hilbert_matrix(4)$\\n\\n/* LU in \\\"packed\\\" form */\\n\\nlup: lu_factor(a);\\n/* [matrix([1, 1/2, 1/3, 1/4 ],\\n [1/2, 1/12, 1/12, 3/40 ],\\n [1/3, 1, 1/180, 1/120 ],\\n [1/4, 9/10, 3/2, 1/2800]),\\n [1, 2, 3, 4], generalring] */\\n\\n/* extract actual factors */\\n\\nget_lu_factors(lup);\\n/* [matrix([1, 0, 0, 0],\\n [0, 1, 0, 0],\\n [0, 0, 1, 0],\\n [0, 0, 0, 1]),\\n\\n matrix([1, 0, 0, 0],\\n [1/2, 1, 0, 0],\\n [1/3, 1, 1, 0],\\n [1/4, 9/10, 3/2, 1]),\\n\\n matrix([1, 1/2, 1/3, 1/4 ],\\n [0, 1/12, 1/12, 3/40 ],\\n [0, 0, 1/180, 1/120 ],\\n [0, 0, 0, 1/2800])\\n ] */\\n\\n/* solve for a given right-hand side */\\n\\nlu_backsub(lup, transpose([1, 1, -1, -1]));\\n/* matrix([-204], [2100], [-4740], [2940]) */\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"import macros, strutils\\nimport strfmt\\n\\ntype\\n\\n Matrix[M, N: static int] = array[1..M, array[1..N, float]]\\n SquareMatrix[N: static int] = Matrix[N, N]\\n\\n\\n# Templates to allow to use more natural notation for indexing.\\ntemplate `[]`(m: Matrix; i, j: int): float = m[i][j]\\ntemplate `[]=`(m: Matrix; i, j: int; val: float) = m[i][j] = val\\n\\n\\nfunc `*`[M, N, P: static int](a: Matrix[M, N]; b: Matrix[N, P]): Matrix[M, P] =\\n ## Matrix multiplication.\\n for i in 1..M:\\n for j in 1..P:\\n for k in 1..N:\\n result[i, j] += a[i, k] * b[k, j]\\n\\n\\nfunc pivotize[N: static int](m: SquareMatrix[N]): SquareMatrix[N] =\\n\\n for i in 1..N: result[i, i] = 1\\n\\n for i in 1..N:\\n var max = m[i, i]\\n var row = i\\n for j in i..N:\\n if m[j, i] > max:\\n max = m[j, i]\\n row = j\\n if i != row:\\n swap result[i], result[row]\\n\\n\\nfunc lu[N: static int](m: SquareMatrix[N]): tuple[l, u, p: SquareMatrix[N]] =\\n\\n result.p = m.pivotize()\\n let m2 = result.p * m\\n\\n for j in 1..N:\\n result.l[j, j] = 1\\n for i in 1..j:\\n var sum = 0.0\\n for k in 1..<i: sum += result.u[k, j] * result.l[i, k]\\n result.u[i, j] = m2[i, j] - sum\\n for i in j..N:\\n var sum = 0.0\\n for k in 1..<j: sum += result.u[k, j] * result.l[i, k]\\n result.l[i, j] = (m2[i, j] - sum) / result.u[j, j]\\n\\n\\nproc print(m: Matrix; title, f: string) =\\n echo '\\\\n', title\\n for i in 1..m.N:\\n for j in 1..m.N:\\n stdout.write m[i, j].format(f), \\\" \\\"\\n stdout.write '\\\\n'\\n\\n\\nwhen isMainModule:\\n\\n const A1: SquareMatrix[3] = [[1.0, 3.0, 5.0],\\n [2.0, 4.0, 7.0],\\n [1.0, 1.0, 0.0]]\\n\\n let (l1, u1, p1) = A1.lu()\\n echo \\\"\\\\nExample 2:\\\"\\n A1.print(\\\"A:\\\", \\\"1.0f\\\")\\n l1.print(\\\"L:\\\", \\\"8.5f\\\")\\n u1.print(\\\"U:\\\", \\\"8.5f\\\")\\n p1.print(\\\"P:\\\", \\\"1.0f\\\")\\n\\n\\n const A2: SquareMatrix[4] = [[11.0, 9.0, 24.0, 2.0],\\n [ 1.0, 5.0, 2.0, 6.0],\\n [ 3.0, 17.0, 18.0, 1.0],\\n [ 2.0, 5.0, 7.0, 1.0]]\\n\\n let (l2, u2, p2) = A2.lu()\\n echo \\\"Example 1:\\\"\\n A2.print(\\\"A:\\\", \\\"2.0f\\\")\\n l2.print(\\\"L:\\\", \\\"8.5f\\\")\\n u2.print(\\\"U:\\\", \\\"8.5f\\\")\\n p2.print(\\\"P:\\\", \\\"1.0f\\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"matlup(M) =\\n{\\n my (L = matid(#M), U = M, P = L);\\n\\n for (i = 1, #M-1, \\\\\\\\ pivoting\\n p = M[z=i,i];\\n for (k = i, #M, if (M[k,i] > p, p = M[z=k,i]));\\n\\n if (i != z, \\\\\\\\ swap rows\\n k = U[i,]; U[i,] = U[z,]; U[z,] = k;\\n k = P[i,]; P[i,] = P[z,]; P[z,] = k;\\n );\\n );\\n\\n for (i = 1, #M-1, \\\\\\\\ decompose\\n for (k = i+1, #M,\\n L[k,i] = U[k,i] / U[i,i];\\n for (j = i, #M, U[k,j] -= L[k,i] * U[i,j])\\n )\\n );\\n\\n [L,U,P] \\\\\\\\ return L,U,P triple matrix\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use List::Util qw(sum);\\n\\nfor $test (\\n [[1, 3, 5],\\n [2, 4, 7],\\n [1, 1, 0]],\\n\\n [[11, 9, 24, 2],\\n [ 1, 5, 2, 6],\\n [ 3, 17, 18, 1],\\n [ 2, 5, 7, 1]]\\n) {\\n my($P, $AP, $L, $U) = lu(@$test);\\n say_it('A matrix', @$test);\\n say_it('P matrix', @$P);\\n say_it('AP matrix', @$AP);\\n say_it('L matrix', @$L);\\n say_it('U matrix', @$U);\\n\\n}\\n\\nsub lu {\\n my (@a) = @_;\\n my $n = +@a;\\n my @P = pivotize(@a);\\n my $AP = mmult(\\\\@P, \\\\@a);\\n my @L = matrix_ident($n);\\n my @U = matrix_zero($n);\\n for $i (0..$n-1) {\\n for $j (0..$n-1) {\\n if ($j >= $i) {\\n $U[$i][$j] = $$AP[$i][$j] - sum map { $U[$_][$j] * $L[$i][$_] } 0..$i-1;\\n } else {\\n $L[$i][$j] = ($$AP[$i][$j] - sum map { $U[$_][$j] * $L[$i][$_] } 0..$j-1) / $U[$j][$j];\\n }\\n }\\n }\\n return \\\\@P, $AP, \\\\@L, \\\\@U;\\n}\\n\\nsub pivotize {\\n my(@m) = @_;\\n my $size = +@m;\\n my @id = matrix_ident($size);\\n for $i (0..$size-1) {\\n my $max = $m[$i][$i];\\n my $row = $i;\\n for $j ($i .. $size-2) {\\n if ($m[$j][$i] > $max) {\\n $max = $m[$j][$i];\\n $row = $j;\\n }\\n }\\n ($id[$row],$id[$i]) = ($id[$i],$id[$row]) if $row != $i;\\n }\\n @id\\n}\\n\\nsub matrix_zero { my($n) = @_; map { [ (0) x $n ] } 0..$n-1 }\\nsub matrix_ident { my($n) = @_; map { [ (0) x $_, 1, (0) x ($n-1 - $_) ] } 0..$n-1 }\\n\\nsub mmult {\\n local *a = shift;\\n local *b = shift;\\n my @p = [];\\n my $rows = @a;\\n my $cols = @{ $b[0] };\\n my $n = @b - 1;\\n for (my $r = 0 ; $r < $rows ; ++$r) {\\n for (my $c = 0 ; $c < $cols ; ++$c) {\\n $p[$r][$c] += $a[$r][$_] * $b[$_][$c] foreach 0 .. $n;\\n }\\n }\\n return [@p];\\n}\\n\\nsub say_it {\\n my($message, @array) = @_;\\n print \\\"$message\\\\n\\\";\\n $line = sprintf join(\\\"\\\\n\\\" => map join(\\\" \\\" => map(sprintf(\\\"%8.5f\\\", $_), @$_)), @{+\\\\@array}).\\\"\\\\n\\\";\\n $line =~ s/\\\\.00000/ /g;\\n $line =~ s/0000\\\\b/ /g;\\n print \\\"$line\\\\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;\\\">matrix_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">b</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;\\\">a</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: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</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;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">c</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: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</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: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</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;\\\">a</span><span style=\\\"color: #0000FF;\\\">)</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: #7060A8;\\\">length</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: #008080;\\\">do</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;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">c</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: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]*</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">j</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: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">c</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;\\\">pivotize</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">m</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: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">im</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: #000000;\\\">0</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: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">im</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: #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: #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;\\\">atom</span> <span style=\\\"color: #000000;\\\">mx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">m</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>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">row</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">i</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: #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;\\\">m</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;\\\">mx</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">mx</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;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">row</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">j</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;\\\">i</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">row</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">im</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">im</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">row</span><span style=\\\"color: #0000FF;\\\">]}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">im</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">row</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">im</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;\\\">return</span> <span style=\\\"color: #000000;\\\">im</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;\\\">lu</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">a</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: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">l</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: #000000;\\\">0</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;\\\">u</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: #000000;\\\">0</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;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pivotize</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">a2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">matrix_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\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: #000000;\\\">l</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: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1.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: #000000;\\\">j</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">sum1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0.0</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: #000000;\\\">i</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">sum1</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">u</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</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;\\\">l</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">u</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: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">a2</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: #0000FF;\\\">-</span> <span style=\\\"color: #000000;\\\">sum1</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;\\\">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;\\\">atom</span> <span style=\\\"color: #000000;\\\">sum2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0.0</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: #000000;\\\">j</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">sum2</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">u</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</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;\\\">l</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">l</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: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a2</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: #0000FF;\\\">-</span> <span style=\\\"color: #000000;\\\">sum2</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">/</span> <span style=\\\"color: #000000;\\\">u</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>\\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: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">u</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">p</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;\\\">a</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;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5</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;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7</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;\\\">0</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">24</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;\\\">1</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: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">17</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>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7</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;\\\">a</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"== a,l,u,p: ==\\\"</span>\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lu</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</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><span style=\\\"color: #004600;\\\">pp_Pause</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;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(subscriptrange, fofl, size): /* 2 Nov. 2013 */\\nLU_Decomposition: procedure options (main);\\n declare a1(3,3) float (18) initial ( 1, 3, 5,\\n 2, 4, 7,\\n 1, 1, 0);\\n declare a2(4,4) float (18) initial (11, 9, 24, 2,\\n 1, 5, 2, 6,\\n 3, 17, 18, 1,\\n 2, 5, 7, 1);\\n call check(a1);\\n call check(a2);\\n\\n\\n/* In-situ decomposition */\\nLU: procedure(a, p);\\n declare a(*,*) float (18);\\n declare p(*) fixed binary;\\n declare (maximum, rtemp) float (18);\\n declare (n, i, j, k, ii, temp) fixed binary;\\n\\n n = hbound(a,1);\\n do i = 1 to n; p(i) = i; end;\\n\\n do k = 1 to n-1;\\n\\n maximum = 0; ii = k;\\n do i = k to n;\\n if maximum < abs(a(p(i),k)) then\\n do; maximum = abs(a(p(i),k)); ii = i; end;\\n end;\\n if ii ^= k then do; temp = p(k); p(k) = p(ii); p(ii) = temp; end;\\n\\n do i = k+1 to n; a(p(i),k) = a(p(i),k) / a(p(k),k); end;\\n\\n do j = k+1 to n;\\n do i = k+1 to n;\\n a(p(i),j) = a(p(i),j) - a(p(i),k) * a(p(k),j);\\n end;\\n end;\\n\\n end;\\nend LU;\\n\\nCHECK: procedure(a);\\n declare a(*,*) float (18) nonassignable;\\n\\n declare aa(hbound(a,1), hbound(a,2)) float (18);\\n declare L(hbound(a,1), hbound(a,2)) float (18);\\n declare U(hbound(a,1), hbound(a,2)) float (18);\\n declare (p(hbound(a,1), hbound(a,2)), ipiv(hbound(a,1)) ) fixed binary;\\n declare pp(hbound(a,1), hbound(a,2)) fixed binary;\\n declare (i, j, n, temp(hbound(a,1))) fixed binary;\\n\\n n = hbound(a,1);\\n aa = A; /* work with a copy */\\n P = 0; L = 0; U = 0;\\n do i = 1 to n;\\n p(i,i) = 1; L(i,i) = 1; /* convert permutation vector to a matrix */\\n end;\\n\\n call LU(aa, ipiv);\\n\\n do i = 1 to n;\\n do j = 1 to i-1; L(i,j) = aa(ipiv(i),j); end;\\n do j = i to n; U(i,j) = aa(ipiv(i),j); end;\\n end;\\n\\n pp = p;\\n do i = 1 to n;\\n p(ipiv(i), *) = pp(i,*);\\n end;\\n\\n put skip list ('A');\\n put edit (A) (skip, (n) f(10,5));\\n\\n put skip list ('P');\\n put edit (P) (skip, (n) f(11));\\n\\n put skip list ('L');\\n put edit (L) (skip, (n) f(10,5));\\n\\n put skip list ('U');\\n put edit (U) (skip, (n) f(10,5));\\n\\nend CHECK;\\n\\nend LU_Decomposition;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"from pprint import pprint\\n\\ndef matrixMul(A, B):\\n TB = zip(*B)\\n return [[sum(ea*eb for ea,eb in zip(a,b)) for b in TB] for a in A]\\n\\ndef pivotize(m):\\n \\\"\\\"\\\"Creates the pivoting matrix for m.\\\"\\\"\\\"\\n n = len(m)\\n ID = [[float(i == j) for i in xrange(n)] for j in xrange(n)]\\n for j in xrange(n):\\n row = max(xrange(j, n), key=lambda i: abs(m[i][j]))\\n if j != row:\\n ID[j], ID[row] = ID[row], ID[j]\\n return ID\\n\\ndef lu(A):\\n \\\"\\\"\\\"Decomposes a nxn matrix A by PA=LU and returns L, U and P.\\\"\\\"\\\"\\n n = len(A)\\n L = [[0.0] * n for i in xrange(n)]\\n U = [[0.0] * n for i in xrange(n)]\\n P = pivotize(A)\\n A2 = matrixMul(P, A)\\n for j in xrange(n):\\n L[j][j] = 1.0\\n for i in xrange(j+1):\\n s1 = sum(U[k][j] * L[i][k] for k in xrange(i))\\n U[i][j] = A2[i][j] - s1\\n for i in xrange(j, n):\\n s2 = sum(U[k][j] * L[i][k] for k in xrange(j))\\n L[i][j] = (A2[i][j] - s2) / U[j][j]\\n return (L, U, P)\\n\\na = [[1, 3, 5], [2, 4, 7], [1, 1, 0]]\\nfor part in lu(a):\\n pprint(part, width=19)\\n print\\nprint\\nb = [[11,9,24,2],[1,5,2,6],[3,17,18,1],[2,5,7,1]]\\nfor part in lu(b):\\n pprint(part)\\n print\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"library(Matrix)\\nA <- matrix(c(1, 3, 5, 2, 4, 7, 1, 1, 0), 3, 3, byrow=T)\\ndim(A) <- c(3, 3)\\nexpand(lu(A))\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(require math)\\n(define A (matrix\\n [[1 3 5]\\n [2 4 7]\\n [1 1 0]]))\\n\\n(matrix-lu A)\\n; result:\\n; (mutable-array #[#[1 0 0]\\n; #[2 1 0]\\n; #[1 1 1]])\\n; (mutable-array #[#[1 3 5]\\n; #[0 -2 -3]\\n; #[0 0 -2]])\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"for ( [1, 3, 5], # Test Matrices\\n [2, 4, 7],\\n [1, 1, 0]\\n ),\\n ( [11, 9, 24, 2],\\n [ 1, 5, 2, 6],\\n [ 3, 17, 18, 1],\\n [ 2, 5, 7, 1]\\n )\\n -> @test {\\n say-it 'A Matrix', @test;\\n say-it( .[0], @(.[1]) ) for 'P Matrix', 'Aʼ Matrix', 'L Matrix', 'U Matrix' Z, lu @test;\\n}\\n\\nsub lu (@a) {\\n die unless @a.&is-square;\\n my $n = @a;\\n my @P = pivotize @a;\\n my @Aʼ = mmult @P, @a;\\n my @L = matrix-ident $n;\\n my @U = matrix-zero $n;\\n for ^$n X ^$n -> ($i,$j) {\\n if $j ≥ $i { @U[$i;$j] = @Aʼ[$i;$j] - [+] map { @U[$_;$j] × @L[$i;$_] }, ^$i }\\n else { @L[$i;$j] = (@Aʼ[$i;$j] - [+] map { @U[$_;$j] × @L[$i;$_] }, ^$j) / @U[$j;$j] }\\n }\\n @P, @Aʼ, @L, @U;\\n}\\n\\nsub pivotize (@m) {\\n my $size = @m;\\n my @id = matrix-ident $size;\\n for ^$size -> $i {\\n my $max = @m[$i;$i];\\n my $row = $i;\\n for $i ..^ $size -> $j {\\n if @m[$j;$i] > $max {\\n $max = @m[$j;$i];\\n $row = $j;\\n }\\n }\\n @id[$row, $i] = @id[$i, $row] if $row != $i;\\n }\\n @id\\n}\\n\\nsub is-square (@m) { so @m == all @m }\\n\\nsub matrix-zero ($n, $m = $n) { map { [ flat 0 xx $n ] }, ^$m }\\n\\nsub matrix-ident ($n) { map { [ flat 0 xx $_, 1, 0 xx $n - 1 - $_ ] }, ^$n }\\n\\nsub mmult(@a,@b) {\\n my @p;\\n for ^@a X ^@b[0] -> ($r, $c) {\\n @p[$r;$c] += @a[$r;$_] × @b[$_;$c] for ^@b;\\n }\\n @p\\n}\\n\\nsub rat-int ($num) {\\n return $num unless $num ~~ Rat;\\n return $num.narrow if $num.narrow ~~ Int;\\n $num.nude.join: '/';\\n\\n}\\n\\nsub say-it ($message, @array) {\\n say \\\"\\\\n$message\\\";\\n $_».&rat-int.fmt(\\\"%7s\\\").say for @array;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program creates a matrix from console input, performs/shows LU decomposition.*/\\n#= 0; P.= 0; PA.= 0; L.= 0; U.= 0 /*initialize some variables to zero. */\\nparse arg x /*obtain matrix elements from the C.L. */\\n call bldAMat; call showMat 'A' /*build and display A matrix.*/\\n call bldPmat; call showMat 'P' /* \\\" \\\" \\\" P \\\" */\\n call multMat; call showMat 'PA' /* \\\" \\\" \\\" PA \\\" */\\n do y=1 for N; call bldUmat; call bldLmat /*build U and L \\\" */\\n end /*y*/\\n call showMat 'L'; call showMat 'U' /*display L and U \\\" */\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nbldAMat: ?= words(x); do N=1 for ? until N**2>=? /*find matrix size. */\\n end /*N*/\\n if N**2\\\\==? then do; say '***error*** wrong # of elements entered:' ?; exit 9\\n end\\n do r=1 for N /*build A matrix.*/\\n do c=1 for N; #= # + 1; _= word(x, #); A.r.c= _\\n if \\\\datatype(_, 'N') then call er \\\"element isn't numeric: \\\" _\\n end /*c*/\\n end /*r*/; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nbldLmat: do r=1 for N /*build lower matrix.*/\\n do c=1 for N; if r==c then do; L.r.c= 1; iterate; end\\n if c\\\\==y | r==c | c>r then iterate\\n _= PA.r.c\\n do k=1 for c-1; _= _ - U.k.c * L.r.k\\n end /*k*/\\n L.r.c= _ / U.c.c\\n end /*c*/\\n end /*r*/; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nbldPmat: c= N; do r=N by -1 for N; P.r.c= 1; c= c + 1 /*build perm. matrix.*/\\n if c>N then c= N%2; if c==N then c= 1\\n end /*r*/; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nbldUmat: do r=1 for N; if r\\\\==y then iterate /*build upper matrix.*/\\n do c=1 for N; if c<r then iterate\\n _= PA.r.c\\n do k=1 for r-1; _= _ - U.k.c * L.r.k\\n end /*k*/\\n U.r.c= _ / 1\\n end /*c*/\\n end /*r*/; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nmultMat: do i=1 for N /*multiply matrix P and A ──► PA */\\n do j=1 for N\\n do k=1 for N; pa.i.j= (pa.i.j + p.i.k * a.k.j) / 1\\n end /*k*/\\n end /*j*/ /*÷ by one does normalization [↑]. */\\n end /*i*/; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nshowMat: parse arg mat,rows,cols; say; rows= word(rows N,1); cols= word(cols rows,1)\\n w= 0; do r=1 for rows\\n do c=1 for cols; w= max(w, length( value( mat'.'r\\\".\\\"c ) ) )\\n end /*c*/\\n end /*r*/\\n say center(mat 'matrix', cols * (w + 1) + 7, \\\"─\\\") /*display the header.*/\\n do r=1 for rows; _=\\n do c=1 for cols; _= _ right( value(mat'.'r\\\".\\\"c), w + 1)\\n end /*c*/\\n say _\\n end /*r*/; return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"require 'matrix'\\n\\nclass Matrix\\n def lu_decomposition\\n p = get_pivot\\n tmp = p * self\\n u = Matrix.zero(row_size).to_a\\n l = Matrix.identity(row_size).to_a\\n (0 ... row_size).each do |i|\\n (0 ... row_size).each do |j|\\n if j >= i\\n # upper\\n u[i][j] = tmp[i,j] - (0 ... i).inject(0.0) {|sum, k| sum + u[k][j] * l[i][k]}\\n else\\n # lower\\n l[i][j] = (tmp[i,j] - (0 ... j).inject(0.0) {|sum, k| sum + u[k][j] * l[i][k]}) / u[j][j]\\n end\\n end\\n end\\n [ Matrix[*l], Matrix[*u], p ]\\n end\\n\\n def get_pivot\\n raise ArgumentError, \\\"must be square\\\" unless square?\\n id = Matrix.identity(row_size).to_a\\n (0 ... row_size).each do |i|\\n max = self[i,i]\\n row = i\\n (i ... row_size).each do |j|\\n if self[j,i] > max\\n max = self[j,i]\\n row = j\\n end\\n end\\n id[i], id[row] = id[row], id[i]\\n end\\n Matrix[*id]\\n end\\n\\n def pretty_print(format, head=nil)\\n puts head if head\\n puts each_slice(column_size).map{|row| format*row_size % row}\\n end\\nend\\n\\nputs \\\"Example 1:\\\"\\na = Matrix[[1, 3, 5],\\n [2, 4, 7],\\n [1, 1, 0]]\\na.pretty_print(\\\" %2d\\\", \\\"A\\\")\\nl, u, p = a.lu_decomposition\\nl.pretty_print(\\\" %8.5f\\\", \\\"L\\\")\\nu.pretty_print(\\\" %8.5f\\\", \\\"U\\\")\\np.pretty_print(\\\" %d\\\", \\\"P\\\")\\n\\nputs \\\"\\\\nExample 2:\\\"\\na = Matrix[[11, 9,24,2],\\n [ 1, 5, 2,6],\\n [ 3,17,18,1],\\n [ 2, 5, 7,1]]\\na.pretty_print(\\\" %2d\\\", \\\"A\\\")\\nl, u, p = a.lu_decomposition\\nl.pretty_print(\\\" %8.5f\\\", \\\"L\\\")\\nu.pretty_print(\\\" %8.5f\\\", \\\"U\\\")\\np.pretty_print(\\\" %d\\\", \\\"P\\\")\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"l, u, p = a.lup_decomposition\\nl.pretty_print(\\\" %8.5f\\\", \\\"L\\\")\\nu.pretty_print(\\\" %8.5f\\\", \\\"U\\\")\\np.pretty_print(\\\" %d\\\", \\\"P\\\")\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"#![allow(non_snake_case)]\\nuse ndarray::{Array, Axis, Array2, arr2, Zip, NdFloat, s};\\n\\nfn main() {\\n println!(\\\"Example 1:\\\");\\n let A: Array2<f64> = arr2(&[\\n [1.0, 3.0, 5.0],\\n [2.0, 4.0, 7.0],\\n [1.0, 1.0, 0.0],\\n ]);\\n println!(\\\"A \\\\n {}\\\", A);\\n let (L, U, P) = lu_decomp(A);\\n println!(\\\"L \\\\n {}\\\", L);\\n println!(\\\"U \\\\n {}\\\", U);\\n println!(\\\"P \\\\n {}\\\", P);\\n\\n println!(\\\"\\\\nExample 2:\\\");\\n let A: Array2<f64> = arr2(&[\\n [11.0, 9.0, 24.0, 2.0],\\n [1.0, 5.0, 2.0, 6.0],\\n [3.0, 17.0, 18.0, 1.0],\\n [2.0, 5.0, 7.0, 1.0],\\n ]);\\n println!(\\\"A \\\\n {}\\\", A);\\n let (L, U, P) = lu_decomp(A);\\n println!(\\\"L \\\\n {}\\\", L);\\n println!(\\\"U \\\\n {}\\\", U);\\n println!(\\\"P \\\\n {}\\\", P);\\n}\\n\\nfn pivot<T>(A: &Array2<T>) -> Array2<T>\\nwhere T: NdFloat {\\n let matrix_dimension = A.rows();\\n let mut P: Array2<T> = Array::eye(matrix_dimension);\\n for (i, column) in A.axis_iter(Axis(1)).enumerate() {\\n // find idx of maximum value in column i\\n let mut max_pos = i;\\n for j in i..matrix_dimension {\\n if column[max_pos].abs() < column[j].abs() {\\n max_pos = j;\\n }\\n }\\n // swap rows of P if necessary\\n if max_pos != i {\\n swap_rows(&mut P, i, max_pos);\\n }\\n }\\n P\\n}\\n\\nfn swap_rows<T>(A: &mut Array2<T>, idx_row1: usize, idx_row2: usize)\\nwhere T: NdFloat {\\n // to swap rows, get two ArrayViewMuts for the corresponding rows\\n // and apply swap elementwise using ndarray::Zip\\n let (.., mut matrix_rest) = A.view_mut().split_at(Axis(0), idx_row1);\\n let (row0, mut matrix_rest) = matrix_rest.view_mut().split_at(Axis(0), 1);\\n let (_matrix_helper, mut matrix_rest) = matrix_rest.view_mut().split_at(Axis(0), idx_row2 - idx_row1 - 1);\\n let (row1, ..) = matrix_rest.view_mut().split_at(Axis(0), 1);\\n Zip::from(row0).and(row1).apply(std::mem::swap);\\n}\\n\\nfn lu_decomp<T>(A: Array2<T>) -> (Array2<T>, Array2<T>, Array2<T>)\\nwhere T: NdFloat {\\n\\n let matrix_dimension = A.rows();\\n assert_eq!(matrix_dimension, A.cols(), \\\"Tried LU decomposition with a non-square matrix.\\\");\\n let P = pivot(&A);\\n let pivotized_A = P.dot(&A);\\n\\n let mut L: Array2<T> = Array::eye(matrix_dimension);\\n let mut U: Array2<T> = Array::zeros((matrix_dimension, matrix_dimension));\\n for idx_col in 0..matrix_dimension {\\n // fill U\\n for idx_row in 0..idx_col+1 {\\n U[[idx_row, idx_col]] = pivotized_A[[idx_row, idx_col]] -\\n U.slice(s![0..idx_row,idx_col]).dot(&L.slice(s![idx_row,0..idx_row]));\\n }\\n // fill L\\n for idx_row in idx_col+1..matrix_dimension {\\n L[[idx_row, idx_col]] = (pivotized_A[[idx_row, idx_col]] -\\n U.slice(s![0..idx_col,idx_col]).dot(&L.slice(s![idx_row,0..idx_col]))) /\\n U[[idx_col, idx_col]];\\n }\\n }\\n (L, U, P)\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"use abstalg::*;\\npub struct Matrix2D<'a, F>\\nwhere\\n F: Field,\\n{\\n field: MatrixRing<F>,\\n data: &'a mut Vec<<F as Domain>::Elem>,\\n rows: usize,\\n cols: usize,\\n}\\n\\nimpl<'a, F: Field + Clone> Matrix2D<'a, F> {\\n pub fn new(field: F, data: &'a mut Vec<<F as Domain>::Elem>, rows: usize, cols: usize) -> Self {\\n assert_eq!(rows * cols, data.len(), \\\"Data does not match dimensions\\\");\\n Matrix2D {\\n field: MatrixRing::<F>::new(field, rows),\\n data,\\n rows,\\n cols,\\n }\\n }\\n\\n pub fn get(&self, row: usize, col: usize) -> &<F as Domain>::Elem {\\n assert!(row < self.rows && col < self.cols, \\\"Index out of bounds\\\");\\n &self.data[row * self.cols + col]\\n }\\n\\n pub fn get_mut(&mut self, row: usize, col: usize) -> &mut <F as Domain>::Elem {\\n assert!(row < self.rows && col < self.cols, \\\"Index out of bounds\\\");\\n &mut self.data[row * self.cols + col]\\n }\\n\\n pub fn get_row(&self, row: usize) -> Vec<<F as Domain>::Elem> {\\n assert!(row < self.rows, \\\"Row index out of bounds\\\");\\n let mut result = Vec::new();\\n for col in 0..self.cols {\\n result.push(self.get(row, col).clone());\\n }\\n result\\n }\\n\\n pub fn get_col(&self, col: usize) -> Vec<<F as Domain>::Elem> {\\n assert!(col < self.cols, \\\"Column index out of bounds\\\");\\n let mut result = Vec::new();\\n for row in 0..self.rows {\\n result.push(self.get(row, col).clone());\\n }\\n result\\n }\\n\\n pub fn set_row(&mut self, row: usize, new_row: Vec<<F as Domain>::Elem>) {\\n assert!(row < self.rows, \\\"Row index out of bounds\\\");\\n assert_eq!(new_row.len(), self.cols, \\\"New row has wrong length\\\");\\n for col in 0..self.cols {\\n *self.get_mut(row, col) = new_row[col].clone();\\n }\\n }\\n\\n pub fn set_col(&mut self, col: usize, new_col: Vec<<F as Domain>::Elem>) {\\n assert!(col < self.cols, \\\"Column index out of bounds\\\");\\n assert_eq!(new_col.len(), self.rows, \\\"New column has wrong length\\\");\\n for row in 0..self.rows {\\n *self.get_mut(row, col) = new_col[row].clone();\\n }\\n }\\n\\n pub fn swap_rows(&mut self, row1: usize, row2: usize) {\\n assert!(\\n row1 < self.rows && row2 < self.rows,\\n \\\"Row index out of bounds\\\"\\n );\\n if row1 != row2 {\\n for col in 0..self.cols {\\n let temp = self.get(row1, col).clone();\\n *self.get_mut(row1, col) = self.get(row2, col).clone();\\n *self.get_mut(row2, col) = temp;\\n }\\n }\\n }\\n pub fn l_u_decomposition(&mut self) -> Result<Vec<<F as Domain>::Elem>, String>\\n where\\n F: Clone,\\n {\\n // Let base = field.base()\\n let base = self.field.base().clone();\\n // Let v_a = VectorAlgebra(base, cols)\\n let v_a = VectorAlgebra::new(base.clone(), self.cols);\\n // Let the_l_matrix = I (creates an identity matrix)\\n let mut the_l_matrix: Vec<_> = self.field.int(1);\\n // Let l_matrix = Matrix2D(base, the_l_matrix, rows, cols)\\n let mut l_matrix = Matrix2D::new(base.clone(), &mut the_l_matrix, self.rows, self.cols);\\n\\n // For each pivot in min(rows, cols)\\n for pivot in 0..std::cmp::min(self.rows, self.cols) {\\n // Let pivot_row = self.get_row(pivot)\\n let pivot_row = self.get_row(pivot);\\n // If pivot element (pivot_row[pivot]) is zero, LU decomposition is not possible\\n if base.is_zero(&pivot_row[pivot]) {\\n return Err(\\n \\\"LU decomposition without pivoting is not possible for this matrix\\\".into(),\\n );\\n }\\n // Let pivot_entry_inv = 1 / pivot_row[pivot]\\n let pivot_entry_inv = base.inv(&pivot_row[pivot]);\\n\\n // For each row_idx in (pivot + 1) to rows\\n for row_idx in (pivot + 1)..self.rows {\\n // Let row = self.get_row(row_idx)\\n let mut row = self.get_row(row_idx);\\n // Let scale = row[pivot] * pivot_entry_inv\\n let scale = base.mul(&row[pivot], &pivot_entry_inv);\\n\\n // row += -scale * pivot_row (Vector addition and scalar multiplication)\\n v_a.add_assign(\\n &mut row,\\n &v_a.neg(&mul_vector(&v_a, scale.clone(), pivot_row.clone())),\\n );\\n\\n // l_matrix[row_idx][pivot] = scale\\n *l_matrix.get_mut(row_idx, pivot) = scale;\\n // self.set_row(row_idx, row) (Sets the modified row back into the matrix)\\n self.set_row(row_idx, row);\\n }\\n }\\n // Returns the L matrix\\n Ok(the_l_matrix)\\n }\\n\\n pub fn p_l_u_decomposition(\\n &self,\\n ) -> Result<\\n (\\n Vec<<F as Domain>::Elem>,\\n Vec<<F as Domain>::Elem>,\\n Vec<<F as Domain>::Elem>,\\n ),\\n String,\\n >\\n where\\n F: Clone,\\n {\\n let base = self.field.base().clone();\\n let mut self2 = (*self.data).clone();\\n let mut cloned_vector = Matrix2D::new(base.clone(), &mut self2, self.rows, self.cols);\\n let mut pivot_row = 0;\\n\\n let mut the_p_matrix: Vec<_> = self.field.zero();\\n let mut p_matrix = Matrix2D::new(base.clone(), &mut the_p_matrix, self.rows, self.cols);\\n //let mut u_matrix = self.clone(); //Initializes the U matrix as a copy of the original matrix\\n\\n for pivot_col in 0..self.cols {\\n // Find a non-zero entry in the pivot column\\n let swap_row = (pivot_row..self.rows)\\n .find(|&row| !base.equals(cloned_vector.get(row, pivot_col), &base.zero()));\\n match swap_row {\\n Some(swap_row) => {\\n // Swap rows in U and P matrices to bring the non-zero entry to the pivot position\\n cloned_vector.swap_rows(pivot_row, swap_row);\\n p_matrix.swap_rows(pivot_row, swap_row);\\n pivot_row += 1;\\n }\\n None => {\\n // If there are no non-zero entries in the pivot column, just proceed to the next column\\n }\\n }\\n }\\n\\n // Set the diagonals of P to 1\\n for i in 0..self.rows {\\n *p_matrix.get_mut(i, i) = base.one();\\n }\\n\\n // Run the LU decomposition on the permuted U matrix\\n let l_u_result = cloned_vector.l_u_decomposition();\\n\\n match l_u_result {\\n Ok(the_l_matrix) => Ok((the_p_matrix, the_l_matrix, cloned_vector.data.clone())),\\n Err(e) => Err(e),\\n }\\n }\\n}\\n\\nuse std::{error::Error, fmt};\\nimpl<'a, T> fmt::Display for Matrix2D<'a, T>\\nwhere\\n <T as Domain>::Elem: fmt::Display,\\n T: Field,\\n{\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n for row in 0..self.rows {\\n for col in 0..self.cols {\\n write!(f, \\\"{} \\\", self.get(row, col))?;\\n }\\n writeln!(f)?;\\n }\\n Ok(())\\n }\\n}\\n\\nfn mul_vector<T>(\\n f: &VectorAlgebra<T>,\\n a: <T as Domain>::Elem,\\n d: Vec<<T as Domain>::Elem>,\\n) -> <VectorAlgebra<T> as Domain>::Elem\\nwhere\\n T: Field,\\n{\\n f.mul(&d, &f.diagonal(a))\\n}\\n\\n#[cfg(test)]\\nmod tests {\\n use super::*; // bring into scope everything from the parent module\\n use abstalg::ReducedFractions;\\n use abstalg::I32;\\n\\n fn test_p_l_u_decomposition(matrix: Vec<isize>, size: usize) {\\n // This test assumes that the base field is rational numbers.\\n // Create a test 4x4 matrix\\n let (matrix, size): (Vec<isize>, usize) =\\n (vec![11, 9, 24, 2, 1, 5, 2, 6, 3, 17, 18, 1, 2, 5, 7, 1], 4);\\n let field = abstalg::ReducedFractions::new(abstalg::I32);\\n let matrix_ring = MatrixRing::new(field.clone(), size);\\n let mut matrix: Vec<_> = matrix.clone().into_iter().map(|i| field.int(i)).collect();\\n let mut matrix2d = Matrix2D::new(field.clone(), &mut matrix, size, size);\\n\\n // Decompose the matrix using the p_l_u_decomposition function\\n let p_l_u_decomposition_result = matrix2d.p_l_u_decomposition().unwrap();\\n let (mut p_matrix, mut l_matrix, mut u_matrix) = p_l_u_decomposition_result;\\n\\n // Convert the matrices back to Matrix2D form for printing\\n let p_matrix2d = Matrix2D::new(field.clone(), &mut p_matrix, size, size);\\n let l_matrix2d = Matrix2D::new(field.clone(), &mut l_matrix, size, size);\\n let u_matrix2d = Matrix2D::new(field.clone(), &mut u_matrix, size, size);\\n\\n println!(\\\"P={} L={} U={}\\\", p_matrix2d, l_matrix2d, u_matrix2d,);\\n\\n // Multiply the resulting P, L, and U matrices\\n let p_l = matrix_ring.mul(&p_matrix, &l_matrix);\\n let mut p_l_u = matrix_ring.mul(&p_l, &u_matrix);\\n\\n //let p_l_u_2d = Matrix2D::new(field.clone(), &mut p_l_u, 4, 4);\\n // Check that the product of P, L, and U is equal to the original matrix\\n assert_eq!(matrix, p_l_u);\\n }\\n\\n #[test]\\n fn test_p_l_u_decomposition_example() {\\n test_p_l_u_decomposition(vec![\\n 11, 9, 24, 2,\\n 1, 5, 2, 6,\\n 3, 17, 18, 1,\\n 2, 5, 7, 1,\\n ], 4);\\n test_p_l_u_decomposition(vec![\\n 1, 3, 5,\\n 2, 4, 7,\\n 1, 1, 0,\\n ], 3);\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"func is_square(m) { m.all { .len == m.len } }\\nfunc matrix_zero(n, m=n) { m.of { n.of(0) } }\\nfunc matrix_ident(n) { n.of {|i| [i.of(0)..., 1, (n - i - 1).of(0)...] } }\\n\\nfunc pivotize(m) {\\n var size = m.len\\n var id = matrix_ident(size)\\n for i in (^size) {\\n var max = m[i][i]\\n var row = i\\n for j in (i ..^ size) {\\n if (m[j][i] > max) {\\n max = m[j][i]\\n row = j\\n }\\n }\\n if (row != i) {\\n id.swap(row, i)\\n }\\n }\\n return id\\n}\\n\\nfunc mmult(a, b) {\\n var p = []\\n for r in ^a, c in ^b[0], i in ^b {\\n p[r][c] := 0 += (a[r][i] * b[i][c])\\n }\\n return p\\n}\\n\\nfunc lu(a) {\\n is_square(a) || die \\\"Defined only for square matrices!\\\";\\n var n = a.len\\n var P = pivotize(a)\\n var Aʼ = mmult(P, a)\\n var L = matrix_ident(n)\\n var U = matrix_zero(n)\\n for i in ^n, j in ^n {\\n if (j >= i) {\\n U[i][j] = (Aʼ[i][j] - sum(^i, { U[_][j] * L[i][_] }))\\n } else {\\n L[i][j] = ((Aʼ[i][j] - sum(^j, { U[_][j] * L[i][_] })) / U[j][j])\\n }\\n }\\n return [P, Aʼ, L, U]\\n}\\n\\nfunc say_it(message, array) {\\n say \\\"\\\\n#{message}\\\"\\n array.each { |row|\\n say row.map{\\\"%7s\\\" % .as_rat}.join(' ')\\n }\\n}\\n\\nvar t = [[\\n %n(1 3 5),\\n %n(2 4 7),\\n %n(1 1 0),\\n],[\\n %n(11 9 24 2),\\n %n( 1 5 2 6),\\n %n( 3 17 18 1),\\n %n( 2 5 7 1),\\n]]\\n\\nt.each { |test|\\n say_it('A Matrix', test)\\n for a,b in (['P Matrix', 'Aʼ Matrix', 'L Matrix', 'U Matrix'] ~Z lu(test)) {\\n say_it(a, b)\\n }\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"mata\\n: lud(a=(1,3,5\\\\2,4,7\\\\1,1,0),l=.,u=.,p=.)\\n\\n: a\\n 1 2 3\\n +-------------+\\n 1 | 1 3 5 |\\n 2 | 2 4 7 |\\n 3 | 1 1 0 |\\n +-------------+\\n\\n: l\\n 1 2 3\\n +----------------+\\n 1 | 1 0 0 |\\n 2 | .5 1 0 |\\n 3 | .5 -1 1 |\\n +----------------+\\n\\n: u\\n 1 2 3\\n +-------------------+\\n 1 | 2 4 7 |\\n 2 | 0 1 1.5 |\\n 3 | 0 0 -2 |\\n +-------------------+\\n\\n: p\\n 1\\n +-----+\\n 1 | 2 |\\n 2 | 1 |\\n 3 | 3 |\\n +-----+\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"void ludec(real matrix a, real matrix l, real matrix u, real vector p) {\\n\\treal scalar i,j,n,s\\n\\treal vector js\\n\\t\\n\\tl = a\\n\\tn = rows(a)\\n\\tp = 1::n\\n\\tfor (i=1; i<n; i++) {\\n\\t\\tmaxindex(abs(l[i::n,i]), 1, js=., .)\\n\\t\\tj = js[1]+i-1\\n\\t\\tif (j!=i) {\\n\\t\\t\\tl[(i\\\\j),.] = l[(j\\\\i),.]\\n\\t\\t\\tp[(i\\\\j)] = p[(j\\\\i)]\\n\\t\\t}\\n\\t\\tfor (j=i+1; j<=n; j++) {\\n\\t\\t\\tl[j,i] = s = l[j,i]/l[i,i]\\n\\t\\t\\tl[j,i+1..n] = l[j,i+1..n]-s*l[i,i+1..n]\\n\\t\\t}\\n\\t}\\n\\t\\n\\tu = uppertriangle(l)\\n\\tl = lowertriangle(l, 1)\\n}\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \": ludec(a=(1,3,5\\\\2,4,7\\\\1,1,0),l=.,u=.,p=.)\\n\\n: a\\n 1 2 3\\n +-------------+\\n 1 | 1 3 5 |\\n 2 | 2 4 7 |\\n 3 | 1 1 0 |\\n +-------------+\\n\\n: l\\n 1 2 3\\n +----------------+\\n 1 | 1 0 0 |\\n 2 | .5 1 0 |\\n 3 | .5 -1 1 |\\n +----------------+\\n\\n: u\\n 1 2 3\\n +-------------------+\\n 1 | 2 4 7 |\\n 2 | 0 1 1.5 |\\n 3 | 0 0 -2 |\\n +-------------------+\\n\\n: p\\n 1\\n +-----+\\n 1 | 2 |\\n 2 | 1 |\\n 3 | 3 |\\n +-----+\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"package require Tcl 8.5\\nnamespace eval matrix {\\n namespace path {::tcl::mathfunc ::tcl::mathop}\\n\\n # Construct an identity matrix of the given size\\n proc identity {order} {\\n\\tset m [lrepeat $order [lrepeat $order 0]]\\n\\tfor {set i 0} {$i < $order} {incr i} {\\n\\t lset m $i $i 1\\n\\t}\\n\\treturn $m\\n }\\n\\n # Produce the pivot matrix for a given matrix\\n proc pivotize {matrix} {\\n\\tset n [llength $matrix]\\n\\tset p [identity $n]\\n\\tfor {set j 0} {$j < $n} {incr j} {\\n\\t set max [lindex $matrix $j $j]\\n\\t set row $j\\n\\t for {set i $j} {$i < $n} {incr i} {\\n\\t\\tif {[lindex $matrix $i $j] > $max} {\\n\\t\\t set max [lindex $matrix $i $j]\\n\\t\\t set row $i\\n\\t\\t}\\n\\t }\\n\\t if {$j != $row} {\\n\\t\\t# Row swap inlined; too trivial to have separate procedure\\n\\t\\tset tmp [lindex $p $j]\\n\\t\\tlset p $j [lindex $p $row]\\n\\t\\tlset p $row $tmp\\n\\t }\\n\\t}\\n\\treturn $p\\n }\\n\\n # Decompose a square matrix A by PA=LU and return L, U and P\\n proc luDecompose {A} {\\n\\tset n [llength $A]\\n\\tset L [lrepeat $n [lrepeat $n 0]]\\n\\tset U $L\\n\\tset P [pivotize $A]\\n\\tset A [multiply $P $A]\\n\\n\\tfor {set j 0} {$j < $n} {incr j} {\\n\\t lset L $j $j 1\\n\\t for {set i 0} {$i <= $j} {incr i} {\\n\\t\\tlset U $i $j [- [lindex $A $i $j] [SumMul $L $U $i $j $i]]\\n\\t }\\n\\t for {set i $j} {$i < $n} {incr i} {\\n\\t\\tset sum [SumMul $L $U $i $j $j]\\n\\t\\tlset L $i $j [/ [- [lindex $A $i $j] $sum] [lindex $U $j $j]]\\n\\t }\\n\\t}\\n\\n\\treturn [list $L $U $P]\\n }\\n\\n # Helper that makes inner loop nicer; multiplies column and row,\\n # possibly partially...\\n proc SumMul {A B i j kmax} {\\n\\tset s 0.0\\n\\tfor {set k 0} {$k < $kmax} {incr k} {\\n\\t set s [+ $s [* [lindex $A $i $k] [lindex $B $k $j]]]\\n\\t}\\n\\treturn $s\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"# Code adapted from Matrix_multiplication and Matrix_transposition tasks\\nnamespace eval matrix {\\n # Get the size of a matrix; assumes that all rows are the same length, which\\n # is a basic well-formed-ness condition...\\n proc size {m} {\\n\\tset rows [llength $m]\\n\\tset cols [llength [lindex $m 0]]\\n\\treturn [list $rows $cols]\\n }\\n\\n # Matrix multiplication implementation\\n proc multiply {a b} {\\n\\tlassign [size $a] a_rows a_cols\\n\\tlassign [size $b] b_rows b_cols\\n\\tif {$a_cols != $b_rows} {\\n\\t error \\\"incompatible sizes: a($a_rows, $a_cols), b($b_rows, $b_cols)\\\"\\n\\t}\\n\\tset temp [lrepeat $a_rows [lrepeat $b_cols 0]]\\n\\tfor {set i 0} {$i < $a_rows} {incr i} {\\n\\t for {set j 0} {$j < $b_cols} {incr j} {\\n\\t\\tlset temp $i $j [SumMul $a $b $i $j $a_cols]\\n\\t }\\n\\t}\\n\\treturn $temp\\n }\\n\\n # Pretty printer for matrices\\n proc print {matrix {fmt \\\"%g\\\"}} {\\n\\tset max [Widest $matrix $fmt]\\n\\tlassign [size $matrix] rows cols\\n\\tforeach row $matrix {\\n\\t foreach val $row width $max {\\n\\t\\tputs -nonewline [format \\\"%*s \\\" $width [format $fmt $val]]\\n\\t }\\n\\t puts \\\"\\\"\\n\\t}\\n }\\n proc Widest {m fmt} {\\n\\tlassign [size $m] rows cols\\n\\tset max [lrepeat $cols 0]\\n\\tforeach row $m {\\n\\t for {set j 0} {$j < $cols} {incr j} {\\n\\t\\tset s [format $fmt [lindex $row $j]]\\n\\t\\tlset max $j [max [lindex $max $j] [string length $s]]\\n\\t }\\n\\t}\\n\\treturn $max\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"# This does the decomposition and prints it out nicely\\nproc demo {A} {\\n lassign [matrix::luDecompose $A] L U P\\n foreach v {A L U P} {\\n\\tupvar 0 $v matrix\\n\\tputs \\\"${v}:\\\"\\n\\tmatrix::print $matrix %.5g\\n\\tif {$v ne \\\"P\\\"} {puts \\\"---------------------------------\\\"}\\n }\\n}\\ndemo {{1 3 5} {2 4 7} {1 1 0}}\\nputs \\\"=================================\\\"\\ndemo {{11 9 24 2} {1 5 2 6} {3 17 18 1} {2 5 7 1}}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"Option Base 1\\nPrivate Function pivotize(m As Variant) As Variant\\n Dim n As Integer: n = UBound(m)\\n Dim im() As Double\\n ReDim im(n, n)\\n For i = 1 To n\\n For j = 1 To n\\n im(i, j) = 0\\n Next j\\n im(i, i) = 1\\n Next i\\n For i = 1 To n\\n mx = Abs(m(i, i))\\n row_ = i\\n For j = i To n\\n If Abs(m(j, i)) > mx Then\\n mx = Abs(m(j, i))\\n row_ = j\\n End If\\n Next j\\n If i <> Row Then\\n For j = 1 To n\\n tmp = im(i, j)\\n im(i, j) = im(row_, j)\\n im(row_, j) = tmp\\n Next j\\n End If\\n Next i\\n pivotize = im\\nEnd Function\\n\\nPrivate Function lu(a As Variant) As Variant\\n Dim n As Integer: n = UBound(a)\\n Dim l() As Double\\n ReDim l(n, n)\\n For i = 1 To n\\n For j = 1 To n\\n l(i, j) = 0\\n Next j\\n Next i\\n u = l\\n p = pivotize(a)\\n a2 = WorksheetFunction.MMult(p, a)\\n For j = 1 To n\\n l(j, j) = 1#\\n For i = 1 To j\\n sum1 = 0#\\n For k = 1 To i\\n sum1 = sum1 + u(k, j) * l(i, k)\\n Next k\\n u(i, j) = a2(i, j) - sum1\\n Next i\\n For i = j + 1 To n\\n sum2 = 0#\\n For k = 1 To j\\n sum2 = sum2 + u(k, j) * l(i, k)\\n Next k\\n l(i, j) = (a2(i, j) - sum2) / u(j, j)\\n Next i\\n Next j\\n Dim res(4) As Variant\\n res(1) = a\\n res(2) = l\\n res(3) = u\\n res(4) = p\\n lu = res\\nEnd Function\\n\\nPublic Sub main()\\n\\n a = [{1, 3, 5; 2, 4, 7; 1, 1, 0}]\\n Debug.Print \\\"== a,l,u,p: ==\\\"\\n result = lu(a)\\n For i = 1 To 4\\n For j = 1 To UBound(result(1))\\n For k = 1 To UBound(result(1), 2)\\n Debug.Print result(i)(j, k),\\n Next k\\n Debug.Print\\n Next j\\n Debug.Print\\n Next i\\n a = [{11, 9,24, 2; 1, 5, 2, 6; 3,17,18, 1; 2, 5, 7, 1}]\\n Debug.Print \\\"== a,l,u,p: ==\\\"\\n result = lu(a)\\n For i = 1 To 4\\n For j = 1 To UBound(result(1))\\n For k = 1 To UBound(result(1), 2)\\n Debug.Print Format(result(i)(j, k), \\\"0.#####\\\"),\\n Next k\\n Debug.Print\\n Next j\\n Debug.Print\\n Next i\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"import \\\"./matrix\\\" for Matrix\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar arrays = [\\n [ [1, 3, 5],\\n [2, 4, 7],\\n [1, 1, 0] ],\\n\\n [ [11, 9, 24, 2],\\n [ 1, 5, 2, 6],\\n [ 3, 17, 18, 1],\\n [ 2, 5, 7, 1] ]\\n]\\n\\nfor (array in arrays) {\\n var m = Matrix.new(array)\\n System.print(\\\"A\\\\n\\\")\\n Fmt.mprint(m, 2, 0)\\n System.print(\\\"\\\\nL\\\\n\\\")\\n var lup = m.lup\\n Fmt.mprint(lup[0], 8, 5)\\n System.print(\\\"\\\\nU\\\\n\\\")\\n Fmt.mprint(lup[1], 8, 5)\\n System.print(\\\"\\\\nP\\\\n\\\")\\n Fmt.mprint(lup[2], 2, 0)\\n System.print()\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"var [const] GSL=Import(\\\"zklGSL\\\");\\t// libGSL (GNU Scientific Library)\\nfcn luTask(A){\\n A.LUDecompose();\\t// in place, contains L & U\\n L:=A.copy().lowerTriangle().setDiagonal(0,0,1);\\n U:=A.copy().upperTriangle();\\n return(L,U);\\n}\\n\\nA:=GSL.Matrix(3,3).set(1,3,5, 2,4,7, 1,1,0); // example 1\\nL,U:=luTask(A);\\nprintln(\\\"L:\\\\n\\\",L.format(),\\\"\\\\nU:\\\\n\\\",U.format());\\n\\nA:=GSL.Matrix(4,4).set(11.0, 9.0, 24.0, 2.0,\\t// example 2\\n\\t\\t\\t1.0, 5.0, 2.0, 6.0,\\n\\t\\t\\t3.0, 17.0, 18.0, 1.0,\\n\\t\\t\\t2.0, 5.0, 7.0, 1.0);\\nL,U:=luTask(A);\\nprintln(\\\"L:\\\\n\\\",L.format(8,4),\\\"\\\\nU:\\\\n\\\",U.format(8,4));\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn make_array(n,m,v){ (m).pump(List.createLong(m).write,v)*n }\\nfcn eye(n){ // Creates a nxn identity matrix.\\n I:=make_array(n,n,0.0);\\n foreach j in (n){ I[j][j]=1.0 }\\n I\\n}\\n\\n// Creates the pivoting matrix for A.\\nfcn pivotize(A){\\n n:=A.len();\\t// rows\\n P:=eye(n);\\n foreach i in (n){\\n max,row:=A[i][i],i;\\n foreach j in ([i..n-1]){\\n if(A[j][i]>max) max,row=A[j][i],j;\\n }\\n if(i!=row) P.swap(i,row);\\n }\\n // Return P.\\n P\\n}\\n\\n// Decomposes a square matrix A by PA=LU and returns L, U and P.\\nfcn lu(A){\\n n:=A.len();\\n L:=eye(n);\\n U:=make_array(n,n,0.0);\\n P:=pivotize(A);\\n A=matMult(P,A);\\n\\n foreach j in (n){\\n foreach i in (j+1){\\n U[i][j]=A[i][j] - (i).reduce('wrap(s,k){ s + U[k][j]*L[i][k] },0.0);\\n }\\n foreach i in ([j..n-1]){\\n L[i][j]=( A[i][j] -\\n\\t\\t (j).reduce('wrap(s,k){ s + U[k][j]*L[i][k] },0.0) ) /\\n\\t\\t U[j][j];\\n }\\n }\\n // Return L, U and P.\\n return(L,U,P);\\n}\\n\\nfcn matMult(a,b){\\n n,m,p:=a[0].len(),a.len(),b[0].len();\\n ans:=make_array(n,m,0.0);\\n foreach i,j,k in (m,p,n){ ans[i][j]+=a[i][k]*b[k][j]; }\\n ans\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"g:=L(L(1.0,3.0,5.0),L(2.0,4.0,7.0),L(1.0,1.0,0.0));\\nlu(g).apply2(\\\"println\\\");\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"lu(L( L(11.0, 9.0, 24.0, 2.0),\\n L( 1.0, 5.0, 2.0, 6.0),\\n L( 3.0, 17.0, 18.0, 1.0),\\n L( 2.0, 5.0, 7.0, 1.0) )).apply2(T(printM,Console.writeln.fpM(\\\"-\\\")));\\n\\nfcn printM(m) { m.pump(Console.println,rowFmt) }\\nfcn rowFmt(row){ (\\\"%9.5f \\\"*row.len()).fmt(row.xplode()) }\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"LU-decomposition"}}},{"rowIdx":453,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Lucky_and_even_lucky_numbers\n","language":"00-META"},{"code":"<small>Note that in the following explanation list indices are assumed to start at ''one''.</small>\n\n;Definition of lucky numbers\n''[[wp:Lucky number|Lucky numbers]]'' are positive integers that are formed by:\n\n# Form a list of all the positive odd integers > 0<br><math>1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39 ...</math>\n# Return the first number from the list (which is '''1''').\n# <small>(Loop begins here)</small>\n#* Note then return the second number from the list (which is '''3''').\n#* Discard every third, (as noted), number from the list to form the new list<br><math>1, 3, 7, 9, 13, 15, 19, 21, 25, 27, 31, 33, 37, 39, 43, 45, 49, 51, 55, 57 ...</math>\n# <small>(Expanding the loop a few more times...)</small>\n#* Note then return the third number from the list (which is '''7''').\n#* Discard every 7<sup>th</sup>, (as noted), number from the list to form the new list<br><math>1, 3, 7, 9, 13, 15, 21, 25, 27, 31, 33, 37, 43, 45, 49, 51, 55, 57, 63, 67 ...</math>\n#* Note then return the 4<sup>th</sup> number from the list (which is '''9''').\n#* Discard every 9<sup>th</sup>, (as noted), number from the list to form the new list<br><math>1, 3, 7, 9, 13, 15, 21, 25, 31, 33, 37, 43, 45, 49, 51, 55, 63, 67, 69, 73 ...</math>\n#* Take the 5<sup>th</sup>, i.e. '''13'''. Remove every 13<sup>th</sup>.\n#* Take the 6<sup>th</sup>, i.e. '''15'''. Remove every 15<sup>th</sup>.\n#* Take the 7<sup>th</sup>, i.e. '''21'''. Remove every 21<sup>th</sup>.\n#* Take the 8<sup>th</sup>, i.e. '''25'''. Remove every 25<sup>th</sup>.\n# <small>(Rule for the loop)</small>\n#* Note the <math>n</math><sup>th</sup>, which is <math>m</math>.\n#* Remove every <math>m</math><sup>th</sup>.\n#* Increment <math>n</math>.\n\n;Definition of even lucky numbers\nThis follows the same rules as the definition of lucky numbers above ''except for the very first step'':\n# Form a list of all the positive '''even''' integers > 0<br><math>2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40 ...</math>\n# Return the first number from the list (which is '''2''').\n# <small>(Loop begins here)</small>\n#* Note then return the second number from the list (which is '''4''').\n#* Discard every 4<sup>th</sup>, (as noted), number from the list to form the new list<br><math>2, 4, 6, 10, 12, 14, 18, 20, 22, 26, 28, 30, 34, 36, 38, 42, 44, 46, 50, 52 ...</math>\n# <small>(Expanding the loop a few more times...)</small>\n#* Note then return the third number from the list (which is '''6''').\n#* Discard every 6<sup>th</sup>, (as noted), number from the list to form the new list<br><math>2, 4, 6, 10, 12, 18, 20, 22, 26, 28, 34, 36, 38, 42, 44, 50, 52, 54, 58, 60 ...</math>\n#* Take the 4<sup>th</sup>, i.e. '''10'''. Remove every 10<sup>th</sup>.\n#* Take the 5<sup>th</sup>, i.e. '''12'''. Remove every 12<sup>th</sup>.\n# <small>(Rule for the loop)</small>\n#* Note the <math>n</math><sup>th</sup>, which is <math>m</math>.\n#* Remove every <math>m</math><sup>th</sup>.\n#* Increment <math>n</math>.\n\n;Task requirements\n* Write one or two subroutines (functions) to generate ''lucky numbers'' and ''even lucky numbers'' \n* Write a command-line interface to allow selection of which kind of numbers and which number(s). Since input is from the command line, tests should be made for the common errors:\n** missing arguments\n** too many arguments\n** number (or numbers) aren't legal\n** misspelled argument ('''lucky''' or '''evenLucky''')\n* The command line handling should:\n** support mixed case handling of the (non-numeric) arguments\n** support printing a particular number\n** support printing a range of numbers by their index\n** support printing a range of numbers by their values\n* The resulting list of numbers should be printed on a single line.\n\n<br>The program should support the arguments:\n<pre>\n what is displayed (on a single line)\n argument(s) (optional verbiage is encouraged)\n ╔═══════════════════╦════════════════════════════════════════════════════╗\n ║ j ║ Jth lucky number ║\n ║ j , lucky ║ Jth lucky number ║\n ║ j , evenLucky ║ Jth even lucky number ║\n ║ ║ ║\n ║ j k ║ Jth through Kth (inclusive) lucky numbers ║\n ║ j k lucky ║ Jth through Kth (inclusive) lucky numbers ║\n ║ j k evenLucky ║ Jth through Kth (inclusive) even lucky numbers ║\n ║ ║ ║\n ║ j -k ║ all lucky numbers in the range j ──► |k| ║\n ║ j -k lucky ║ all lucky numbers in the range j ──► |k| ║\n ║ j -k evenLucky ║ all even lucky numbers in the range j ──► |k| ║\n ╚═══════════════════╩════════════════════════════════════════════════════╝\n where |k| is the absolute value of k\n</pre>\nDemonstrate the program by:\n* showing the first twenty ''lucky'' numbers\n* showing the first twenty ''even lucky'' numbers\n* showing all ''lucky'' numbers between 6,000 and 6,100 (inclusive)\n* showing all ''even lucky'' numbers in the same range as above\n* showing the 10,000<sup>th</sup> ''lucky'' number (extra credit)\n* showing the 10,000<sup>th</sup> ''even lucky'' number (extra credit)\n\n;See also:\n* This task is related to the [[Sieve of Eratosthenes]] task.\n* OEIS Wiki [http://oeis.org/wiki/Lucky_numbers Lucky numbers].\n* Sequence [https://oeis.org/A000959 A000959 lucky numbers] on The On-Line Encyclopedia of Integer Sequences.\n* Sequence [https://oeis.org/A045954 A045954 even lucky numbers or ELN] on The On-Line Encyclopedia of Integer Sequences.\n* Entry [http://mathworld.wolfram.com/LuckyNumber.html lucky numbers] on The Eric Weisstein's World of Mathematics.<br><br>\n\n","language":"00-TASK"},{"code":"-V NoValue = 0\n\nF initLuckyNumbers(nelems, evenlucky, limit = -1)\n [Int] result\n L(i) 0 .< nelems\n V k = i\n L(j) (result.len - 1 .< 0).step(-1)\n k = k * result[j] I/ (result[j] - 1)\n V n = 2 * k + 1 + evenlucky\n I limit != -1 & n > limit\n L.break\n result.append(n)\n R result\n\nF name(evenlucky)\n R [‘Lucky’, ‘Even lucky’][evenlucky]\n\nF printSingle(j, evenlucky)\n V luckySeq = initLuckyNumbers(j, evenlucky)\n print(name(evenlucky)‘ number at index ’j‘ is ’luckySeq[j - 1])\n\nF printRange(j, k, evenlucky)\n V luckySeq = initLuckyNumbers(k, evenlucky)\n print(name(evenlucky)‘ numbers at indexes ’j‘ to ’k‘ are: ’, end' ‘’)\n L(idx) j - 1 .< k\n I idx != j - 1\n print(‘, ’, end' ‘’)\n print(luckySeq[idx], end' ‘’)\n print()\n\nF printInRange(j, k, evenlucky)\n V luckySeq = initLuckyNumbers(k, evenlucky, k)\n print(name(evenlucky)‘ numbers between ’j‘ to ’k‘ are: ’, end' ‘’)\n V first = 1B\n L(val) luckySeq\n I val > j\n I first\n first = 0B\n E\n print(‘, ’, end' ‘’)\n print(val, end' ‘’)\n print()\n\nF process_args(args)\n assert(args.len C 1..3, ‘Wrong number of arguments’)\n\n // First argument: \"j\" value.\n V j = Int(args[0])\n\n V k = NoValue\n // Second argument: \"k\" value or a comma.\n I args.len > 1\n I args[1] == ‘,’\n // Must be followed by the kind of lucky number.\n assert(args.len == 3, ‘Missing kind argument’)\n E\n k = Int(args[1])\n assert(k != 0, ‘Expected a non null number’)\n\n V evenlucky = 0\n // Third argument: number kind.\n I args.len == 3\n V kind = args[2].lowercase()\n assert(kind C (‘lucky’, ‘evenlucky’), ‘Wrong kind’)\n I kind == ‘evenlucky’\n evenlucky = 1\n\n I k == NoValue\n // Print jth value.\n printSingle(j, evenlucky)\n E I k > 0\n // Print jth to kth values.\n printRange(j, k, evenlucky)\n E\n // Print values in range j..(-k).\n printInRange(j, -k, evenlucky)\n\n:start:\nI 1B\n L(args) [‘1 20’, ‘1 20 evenlucky’, ‘6000 -6100’, ‘6000 -6100 evenlucky’, ‘10000’, ‘10000 , lucky’, ‘10000 , evenlucky’]\n print(‘Command line arguments: ’args)\n process_args(args.split(‘ ’))\n print()\nE\n process_args(:argv[1..])\n","language":"11l"},{"code":"#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n\n#define LUCKY_SIZE 60000\nint luckyOdd[LUCKY_SIZE];\nint luckyEven[LUCKY_SIZE];\n\nvoid compactLucky(int luckyArray[]) {\n int i, j, k;\n\n for (i = 0; i < LUCKY_SIZE; i++) {\n if (luckyArray[i] == 0) {\n j = i;\n break;\n }\n }\n\n for (j = i + 1; j < LUCKY_SIZE; j++) {\n if (luckyArray[j] > 0) {\n luckyArray[i++] = luckyArray[j];\n }\n }\n\n for (; i < LUCKY_SIZE; i++) {\n luckyArray[i] = 0;\n }\n}\n\nvoid initialize() {\n int i, j;\n\n // unfiltered\n for (i = 0; i < LUCKY_SIZE; i++) {\n luckyEven[i] = 2 * i + 2;\n luckyOdd[i] = 2 * i + 1;\n }\n\n // odd filter\n for (i = 1; i < LUCKY_SIZE; i++) {\n if (luckyOdd[i] > 0) {\n for (j = luckyOdd[i] - 1; j < LUCKY_SIZE; j += luckyOdd[i]) {\n luckyOdd[j] = 0;\n }\n compactLucky(luckyOdd);\n }\n }\n\n // even filter\n for (i = 1; i < LUCKY_SIZE; i++) {\n if (luckyEven[i] > 0) {\n for (j = luckyEven[i] - 1; j < LUCKY_SIZE; j += luckyEven[i]) {\n luckyEven[j] = 0;\n }\n compactLucky(luckyEven);\n }\n }\n}\n\nvoid printBetween(size_t j, size_t k, bool even) {\n int i;\n\n if (even) {\n if (luckyEven[j] == 0 || luckyEven[k] == 0) {\n fprintf(stderr, \"At least one argument is too large\\n\");\n exit(EXIT_FAILURE);\n }\n printf(\"Lucky even numbers between %d and %d are:\", j, k);\n for (i = 0; luckyEven[i] != 0; i++) {\n if (luckyEven[i] > k) {\n break;\n }\n if (luckyEven[i] > j) {\n printf(\" %d\", luckyEven[i]);\n }\n }\n } else {\n if (luckyOdd[j] == 0 || luckyOdd[k] == 0) {\n fprintf(stderr, \"At least one argument is too large\\n\");\n exit(EXIT_FAILURE);\n }\n printf(\"Lucky numbers between %d and %d are:\", j, k);\n for (i = 0; luckyOdd[i] != 0; i++) {\n if (luckyOdd[i] > k) {\n break;\n }\n if (luckyOdd[i] > j) {\n printf(\" %d\", luckyOdd[i]);\n }\n }\n }\n printf(\"\\n\");\n}\n\nvoid printRange(size_t j, size_t k, bool even) {\n int i;\n\n if (even) {\n if (luckyEven[k] == 0) {\n fprintf(stderr, \"The argument is too large\\n\");\n exit(EXIT_FAILURE);\n }\n printf(\"Lucky even numbers %d to %d are:\", j, k);\n for (i = j - 1; i < k; i++) {\n printf(\" %d\", luckyEven[i]);\n }\n } else {\n if (luckyOdd[k] == 0) {\n fprintf(stderr, \"The argument is too large\\n\");\n exit(EXIT_FAILURE);\n }\n printf(\"Lucky numbers %d to %d are:\", j, k);\n for (i = j - 1; i < k; i++) {\n printf(\" %d\", luckyOdd[i]);\n }\n }\n printf(\"\\n\");\n}\n\nvoid printSingle(size_t j, bool even) {\n if (even) {\n if (luckyEven[j] == 0) {\n fprintf(stderr, \"The argument is too large\\n\");\n exit(EXIT_FAILURE);\n }\n printf(\"Lucky even number %d=%d\\n\", j, luckyEven[j - 1]);\n } else {\n if (luckyOdd[j] == 0) {\n fprintf(stderr, \"The argument is too large\\n\");\n exit(EXIT_FAILURE);\n }\n printf(\"Lucky number %d=%d\\n\", j, luckyOdd[j - 1]);\n }\n}\n\nvoid help() {\n printf(\"./lucky j [k] [--lucky|--evenLucky]\\n\");\n printf(\"\\n\");\n printf(\" argument(s) | what is displayed\\n\");\n printf(\"==============================================\\n\");\n printf(\"-j=m | mth lucky number\\n\");\n printf(\"-j=m --lucky | mth lucky number\\n\");\n printf(\"-j=m --evenLucky | mth even lucky number\\n\");\n printf(\"-j=m -k=n | mth through nth (inclusive) lucky numbers\\n\");\n printf(\"-j=m -k=n --lucky | mth through nth (inclusive) lucky numbers\\n\");\n printf(\"-j=m -k=n --evenLucky | mth through nth (inclusive) even lucky numbers\\n\");\n printf(\"-j=m -k=-n | all lucky numbers in the range [m, n]\\n\");\n printf(\"-j=m -k=-n --lucky | all lucky numbers in the range [m, n]\\n\");\n printf(\"-j=m -k=-n --evenLucky | all even lucky numbers in the range [m, n]\\n\");\n}\n\nvoid process(int argc, char *argv[]) {\n bool evenLucky = false;\n int j = 0;\n int k = 0;\n\n bool good = false;\n int i;\n\n for (i = 1; i < argc; ++i) {\n if ('-' == argv[i][0]) {\n if ('-' == argv[i][1]) {\n // long args\n if (0 == strcmp(\"--lucky\", argv[i])) {\n evenLucky = false;\n } else if (0 == strcmp(\"--evenLucky\", argv[i])) {\n evenLucky = true;\n } else {\n fprintf(stderr, \"Unknown long argument: [%s]\\n\", argv[i]);\n exit(EXIT_FAILURE);\n }\n } else {\n // short args\n if ('j' == argv[i][1] && '=' == argv[i][2] && argv[i][3] != 0) {\n good = true;\n j = atoi(&argv[i][3]);\n } else if ('k' == argv[i][1] && '=' == argv[i][2]) {\n k = atoi(&argv[i][3]);\n } else {\n fprintf(stderr, \"Unknown short argument: [%s]\\n\", argv[i]);\n exit(EXIT_FAILURE);\n }\n }\n } else {\n fprintf(stderr, \"Unknown argument: [%s]\\n\", argv[i]);\n exit(EXIT_FAILURE);\n }\n }\n\n if (!good) {\n help();\n exit(EXIT_FAILURE);\n }\n\n if (k > 0) {\n printRange(j, k, evenLucky);\n } else if (k < 0) {\n printBetween(j, -k, evenLucky);\n } else {\n printSingle(j, evenLucky);\n }\n}\n\nvoid test() {\n printRange(1, 20, false);\n printRange(1, 20, true);\n\n printBetween(6000, 6100, false);\n printBetween(6000, 6100, true);\n\n printSingle(10000, false);\n printSingle(10000, true);\n}\n\nint main(int argc, char *argv[]) {\n initialize();\n\n //test();\n\n if (argc < 2) {\n help();\n return 1;\n }\n process(argc, argv);\n\n return 0;\n}\n","language":"C"},{"code":"#include <algorithm>\n#include <iostream>\n#include <iterator>\n#include <vector>\n\nconst int luckySize = 60000;\nstd::vector<int> luckyEven(luckySize);\nstd::vector<int> luckyOdd(luckySize);\n\nvoid init() {\n for (int i = 0; i < luckySize; ++i) {\n luckyEven[i] = i * 2 + 2;\n luckyOdd[i] = i * 2 + 1;\n }\n}\n\nvoid filterLuckyEven() {\n for (size_t n = 2; n < luckyEven.size(); ++n) {\n int m = luckyEven[n - 1];\n int end = (luckyEven.size() / m) * m - 1;\n for (int j = end; j >= m - 1; j -= m) {\n std::copy(luckyEven.begin() + j + 1, luckyEven.end(), luckyEven.begin() + j);\n luckyEven.pop_back();\n }\n }\n}\n\nvoid filterLuckyOdd() {\n for (size_t n = 2; n < luckyOdd.size(); ++n) {\n int m = luckyOdd[n - 1];\n int end = (luckyOdd.size() / m) * m - 1;\n for (int j = end; j >= m - 1; j -= m) {\n std::copy(luckyOdd.begin() + j + 1, luckyOdd.end(), luckyOdd.begin() + j);\n luckyOdd.pop_back();\n }\n }\n}\n\nvoid printBetween(size_t j, size_t k, bool even) {\n std::ostream_iterator<int> out_it{ std::cout, \", \" };\n\n if (even) {\n size_t max = luckyEven.back();\n if (j > max || k > max) {\n std::cerr << \"At least one are is too big\\n\";\n exit(EXIT_FAILURE);\n }\n\n std::cout << \"Lucky even numbers between \" << j << \" and \" << k << \" are: \";\n std::copy_if(luckyEven.begin(), luckyEven.end(), out_it, [j, k](size_t n) {\n return j <= n && n <= k;\n });\n } else {\n size_t max = luckyOdd.back();\n if (j > max || k > max) {\n std::cerr << \"At least one are is too big\\n\";\n exit(EXIT_FAILURE);\n }\n\n std::cout << \"Lucky numbers between \" << j << \" and \" << k << \" are: \";\n std::copy_if(luckyOdd.begin(), luckyOdd.end(), out_it, [j, k](size_t n) {\n return j <= n && n <= k;\n });\n }\n std::cout << '\\n';\n}\n\nvoid printRange(size_t j, size_t k, bool even) {\n std::ostream_iterator<int> out_it{ std::cout, \", \" };\n if (even) {\n if (k >= luckyEven.size()) {\n std::cerr << \"The argument is too large\\n\";\n exit(EXIT_FAILURE);\n }\n std::cout << \"Lucky even numbers \" << j << \" to \" << k << \" are: \";\n std::copy(luckyEven.begin() + j - 1, luckyEven.begin() + k, out_it);\n } else {\n if (k >= luckyOdd.size()) {\n std::cerr << \"The argument is too large\\n\";\n exit(EXIT_FAILURE);\n }\n std::cout << \"Lucky numbers \" << j << \" to \" << k << \" are: \";\n std::copy(luckyOdd.begin() + j - 1, luckyOdd.begin() + k, out_it);\n }\n}\n\nvoid printSingle(size_t j, bool even) {\n if (even) {\n if (j >= luckyEven.size()) {\n std::cerr << \"The argument is too large\\n\";\n exit(EXIT_FAILURE);\n }\n std::cout << \"Lucky even number \" << j << \"=\" << luckyEven[j - 1] << '\\n';\n } else {\n if (j >= luckyOdd.size()) {\n std::cerr << \"The argument is too large\\n\";\n exit(EXIT_FAILURE);\n }\n std::cout << \"Lucky number \" << j << \"=\" << luckyOdd[j - 1] << '\\n';\n }\n}\n\nvoid help() {\n std::cout << \"./lucky j [k] [--lucky|--evenLucky]\\n\";\n std::cout << \"\\n\";\n std::cout << \" argument(s) | what is displayed\\n\";\n std::cout << \"==============================================\\n\";\n std::cout << \"-j=m | mth lucky number\\n\";\n std::cout << \"-j=m --lucky | mth lucky number\\n\";\n std::cout << \"-j=m --evenLucky | mth even lucky number\\n\";\n std::cout << \"-j=m -k=n | mth through nth (inclusive) lucky numbers\\n\";\n std::cout << \"-j=m -k=n --lucky | mth through nth (inclusive) lucky numbers\\n\";\n std::cout << \"-j=m -k=n --evenLucky | mth through nth (inclusive) even lucky numbers\\n\";\n std::cout << \"-j=m -k=-n | all lucky numbers in the range [m, n]\\n\";\n std::cout << \"-j=m -k=-n --lucky | all lucky numbers in the range [m, n]\\n\";\n std::cout << \"-j=m -k=-n --evenLucky | all even lucky numbers in the range [m, n]\\n\";\n}\n\nint main(int argc, char **argv) {\n bool evenLucky = false;\n int j = 0;\n int k = 0;\n\n // skip arg 0, because that is just the executable name\n if (argc < 2) {\n help();\n exit(EXIT_FAILURE);\n }\n\n bool good = false;\n for (int i = 1; i < argc; ++i) {\n if ('-' == argv[i][0]) {\n if ('-' == argv[i][1]) {\n // long args\n if (0 == strcmp(\"--lucky\", argv[i])) {\n evenLucky = false;\n } else if (0 == strcmp(\"--evenLucky\", argv[i])) {\n evenLucky = true;\n } else {\n std::cerr << \"Unknown long argument: [\" << argv[i] << \"]\\n\";\n exit(EXIT_FAILURE);\n }\n } else {\n // short args\n if ('j' == argv[i][1] && '=' == argv[i][2] && argv[i][3] != 0) {\n good = true;\n j = atoi(&argv[i][3]);\n } else if ('k' == argv[i][1] && '=' == argv[i][2]) {\n k = atoi(&argv[i][3]);\n } else {\n std::cerr << \"Unknown short argument: \" << argv[i] << '\\n';\n exit(EXIT_FAILURE);\n }\n }\n } else {\n std::cerr << \"Unknown argument: \" << argv[i] << '\\n';\n exit(EXIT_FAILURE);\n }\n }\n if (!good) {\n help();\n exit(EXIT_FAILURE);\n }\n\n init();\n filterLuckyEven();\n filterLuckyOdd();\n if (k > 0) {\n printRange(j, k, evenLucky);\n } else if (k < 0) {\n printBetween(j, -k, evenLucky);\n } else {\n printSingle(j, evenLucky);\n }\n\n return 0;\n}\n","language":"C++"},{"code":"import std.algorithm;\nimport std.concurrency;\nimport std.conv;\nimport std.getopt;\nimport std.range;\nimport std.stdio;\n\nauto lucky(bool even, int nmax=200_000) {\n import std.container.array;\n\n int start = even ? 2 : 1;\n\n return new Generator!int({\n auto ln = make!(Array!int)(iota(start,nmax,2));\n\n // yield the first number\n yield(ln[0]);\n\n int n=1;\n for(; n<ln.length/2+1; n++) {\n yield(ln[n]);\n\n int step = ln[n]-1;\n\n // remove the non-lucky numbers related to the current lucky number\n for (int i=step; i<ln.length; i+=step) {\n ln.linearRemove(ln[].drop(i).take(1));\n }\n }\n\n // yield all remaining values\n foreach(val; ln[n..$]) {\n yield(val);\n }\n });\n}\n\nvoid help(Option[] opt) {\n defaultGetoptPrinter(\"./lucky j [k] [--lucky|--evenLucky]\", opt);\n\n writeln;\n writeln(\" argument(s) | what is displayed\");\n writeln(\"==============================================\");\n writeln(\"-j=m | mth lucky number\");\n writeln(\"-j=m --lucky | mth lucky number\");\n writeln(\"-j=m --evenLucky | mth even lucky number\");\n writeln(\"-j=m -k=n | mth through nth (inclusive) lucky numbers\");\n writeln(\"-j=m -k=n --lucky | mth through nth (inclusive) lucky numbers\");\n writeln(\"-j=m -k=n --evenLucky | mth through nth (inclusive) even lucky numbers\");\n writeln(\"-j=m -k=-n | all lucky numbers in the range [m, n]\");\n writeln(\"-j=m -k=-n --lucky | all lucky numbers in the range [m, n]\");\n writeln(\"-j=m -k=-n --evenLucky | all even lucky numbers in the range [m, n]\");\n}\n\nvoid main(string[] args) {\n int j;\n int k;\n bool evenLucky = false;\n\n void luckyOpt() {\n evenLucky = false;\n }\n auto helpInformation = getopt(\n args,\n std.getopt.config.passThrough,\n std.getopt.config.required,\n \"j\", \"The starting point to generate lucky numbers\", &j,\n \"k\", \"The ending point for generating lucky numbers\", &k,\n \"lucky\", \"Specify to generate a list of lucky numbers\", &luckyOpt,\n \"evenLucky\", \"Specify to generate a list of even lucky numbers\", &evenLucky\n );\n\n if (helpInformation.helpWanted) {\n help(helpInformation.options);\n return;\n }\n\n if (k>0) {\n lucky(evenLucky).drop(j-1).take(k-j+1).writeln;\n } else if (k<0) {\n auto f = (int a) => j<=a && a<=-k;\n lucky(evenLucky, -k).filter!f.writeln;\n } else {\n lucky(evenLucky).drop(j-1).take(1).writeln;\n }\n}\n","language":"D"},{"code":"// Odd and Even Lucky Numbers. Nigel Galloway: October 3rd., 2020\nlet rec fN i g e l=seq{yield! i|>Seq.skip g|>Seq.take(e-g-1)\n let n=Seq.chunkBySize e i|>Seq.collect(Seq.take(e-1)) in yield! fN n (e-1) (Seq.item l n) (l+1)}\nlet oLuck,eLuck=let rec fG g=seq{yield g; yield! fG(g+2)} in (fN(fG 1) 0 3 2,fN(fG 2) 0 4 2)\n","language":"F-Sharp"},{"code":"package main\n\nimport (\n \"fmt\"\n \"log\"\n \"os\"\n \"strconv\"\n \"strings\"\n)\n\nconst luckySize = 60000\n\nvar luckyOdd = make([]int, luckySize)\nvar luckyEven = make([]int, luckySize)\n\nfunc init() {\n for i := 0; i < luckySize; i++ {\n luckyOdd[i] = i*2 + 1\n luckyEven[i] = i*2 + 2\n }\n}\n\nfunc filterLuckyOdd() {\n for n := 2; n < len(luckyOdd); n++ {\n m := luckyOdd[n-1]\n end := (len(luckyOdd)/m)*m - 1\n for j := end; j >= m-1; j -= m {\n copy(luckyOdd[j:], luckyOdd[j+1:])\n luckyOdd = luckyOdd[:len(luckyOdd)-1]\n }\n }\n}\n\nfunc filterLuckyEven() {\n for n := 2; n < len(luckyEven); n++ {\n m := luckyEven[n-1]\n end := (len(luckyEven)/m)*m - 1\n for j := end; j >= m-1; j -= m {\n copy(luckyEven[j:], luckyEven[j+1:])\n luckyEven = luckyEven[:len(luckyEven)-1]\n }\n }\n}\n\nfunc printSingle(j int, odd bool) error {\n if odd {\n if j >= len(luckyOdd) {\n return fmt.Errorf(\"the argument, %d, is too big\", j)\n }\n fmt.Println(\"Lucky number\", j, \"=\", luckyOdd[j-1])\n } else {\n if j >= len(luckyEven) {\n return fmt.Errorf(\"the argument, %d, is too big\", j)\n }\n fmt.Println(\"Lucky even number\", j, \"=\", luckyEven[j-1])\n }\n return nil\n}\n\nfunc printRange(j, k int, odd bool) error {\n if odd {\n if k >= len(luckyOdd) {\n return fmt.Errorf(\"the argument, %d, is too big\", k)\n }\n fmt.Println(\"Lucky numbers\", j, \"to\", k, \"are:\")\n fmt.Println(luckyOdd[j-1 : k])\n } else {\n if k >= len(luckyEven) {\n return fmt.Errorf(\"the argument, %d, is too big\", k)\n }\n fmt.Println(\"Lucky even numbers\", j, \"to\", k, \"are:\")\n fmt.Println(luckyEven[j-1 : k])\n }\n return nil\n}\n\nfunc printBetween(j, k int, odd bool) error {\n var r []int\n if odd {\n max := luckyOdd[len(luckyOdd)-1]\n if j > max || k > max {\n return fmt.Errorf(\"at least one argument, %d or %d, is too big\", j, k)\n }\n for _, num := range luckyOdd {\n if num < j {\n continue\n }\n if num > k {\n break\n }\n r = append(r, num)\n }\n fmt.Println(\"Lucky numbers between\", j, \"and\", k, \"are:\")\n fmt.Println(r)\n } else {\n max := luckyEven[len(luckyEven)-1]\n if j > max || k > max {\n return fmt.Errorf(\"at least one argument, %d or %d, is too big\", j, k)\n }\n for _, num := range luckyEven {\n if num < j {\n continue\n }\n if num > k {\n break\n }\n r = append(r, num)\n }\n fmt.Println(\"Lucky even numbers between\", j, \"and\", k, \"are:\")\n fmt.Println(r)\n }\n return nil\n}\n\nfunc main() {\n nargs := len(os.Args)\n if nargs < 2 || nargs > 4 {\n log.Fatal(\"there must be between 1 and 3 command line arguments\")\n }\n filterLuckyOdd()\n filterLuckyEven()\n j, err := strconv.Atoi(os.Args[1])\n if err != nil || j < 1 {\n log.Fatalf(\"first argument, %s, must be a positive integer\", os.Args[1])\n }\n if nargs == 2 {\n if err := printSingle(j, true); err != nil {\n log.Fatal(err)\n }\n return\n }\n\n if nargs == 3 {\n k, err := strconv.Atoi(os.Args[2])\n if err != nil {\n log.Fatalf(\"second argument, %s, must be an integer\", os.Args[2])\n }\n if k >= 0 {\n if j > k {\n log.Fatalf(\"second argument, %d, can't be less than first, %d\", k, j)\n }\n if err := printRange(j, k, true); err != nil {\n log.Fatal(err)\n }\n } else {\n l := -k\n if j > l {\n log.Fatalf(\"second argument, %d, can't be less in absolute value than first, %d\", k, j)\n }\n if err := printBetween(j, l, true); err != nil {\n log.Fatal(err)\n }\n }\n return\n }\n\n var odd bool\n switch lucky := strings.ToLower(os.Args[3]); lucky {\n case \"lucky\":\n odd = true\n case \"evenlucky\":\n odd = false\n default:\n log.Fatalf(\"third argument, %s, is invalid\", os.Args[3])\n }\n if os.Args[2] == \",\" {\n if err := printSingle(j, odd); err != nil {\n log.Fatal(err)\n }\n return\n }\n\n k, err := strconv.Atoi(os.Args[2])\n if err != nil {\n log.Fatal(\"second argument must be an integer or a comma\")\n }\n if k >= 0 {\n if j > k {\n log.Fatalf(\"second argument, %d, can't be less than first, %d\", k, j)\n }\n if err := printRange(j, k, odd); err != nil {\n log.Fatal(err)\n }\n } else {\n l := -k\n if j > l {\n log.Fatalf(\"second argument, %d, can't be less in absolute value than first, %d\", k, j)\n }\n if err := printBetween(j, l, odd); err != nil {\n log.Fatal(err)\n }\n }\n}\n","language":"Go"},{"code":"import System.Environment\nimport Text.Regex.Posix\n\ndata Lucky = Lucky | EvenLucky\n\nhelpMessage :: IO ()\nhelpMessage = do\n putStrLn \" what is displayed (on a single line)\"\n putStrLn \" argument(s) (optional verbiage is encouraged)\"\n putStrLn \"======================|===================================================\"\n putStrLn \" j | Jth lucky number \"\n putStrLn \" j , lucky | Jth lucky number \"\n putStrLn \" j , evenLucky | Jth even lucky number \"\n putStrLn \" \"\n putStrLn \" j k | Jth through Kth (inclusive) lucky numbers \"\n putStrLn \" j k lucky | Jth through Kth (inclusive) lucky numbers \"\n putStrLn \" j k evenlucky | Jth through Kth (inclusive) even lucky numbers \"\n putStrLn \" \"\n putStrLn \" j -k | all lucky numbers in the range j -> |k| \"\n putStrLn \" j -k lucky | all lucky numbers in the range j -> |k| \"\n putStrLn \" j -k evenlucky | all even lucky numbers in the range j -> |k| \"\n putStrLn \"======================|===================================================\"\n\noddNumbers :: [Int]\noddNumbers = filter odd [1..]\n\nevenNumbers :: [Int]\nevenNumbers = filter even [1..]\n\nluckyNumbers :: [Int] -> [Int]\nluckyNumbers xs =\n let i = 3 in\n sieve i xs\n where\n sieve i (ln:s:xs) =\n ln : sieve (i + 1) (s : [x | (n, x) <- zip [i..] xs, rem n s /= 0])\n\nnth :: Int -> Lucky -> Int\nnth j Lucky = luckyNumbers oddNumbers !! (j-1)\nnth j EvenLucky = luckyNumbers evenNumbers !! (j-1)\n\nrange :: Int -> Int -> Lucky -> [Int]\nrange x x2 Lucky = drop (x-1) (take x2 (luckyNumbers oddNumbers))\nrange x x2 EvenLucky = drop (x-1) (take x2 (luckyNumbers evenNumbers))\n\ninterval :: Int -> Int -> Lucky -> [Int]\ninterval x x2 Lucky = dropWhile (<x) (takeWhile (<=x2) (luckyNumbers oddNumbers))\ninterval x x2 EvenLucky = dropWhile (<x) (takeWhile (<=x2) (luckyNumbers evenNumbers))\n\nlucky :: [String] -> Lucky\nlucky xs =\n if \"evenLucky\" `elem` xs\n then EvenLucky\n else Lucky\n\nreadn :: String -> Int\nreadn s = read s :: Int\n\nisInt :: String -> Bool\nisInt s = not (null (s =~ \"-?[0-9]{0,10}\" :: String))\n\nmain :: IO ()\nmain = do\n args <- getArgs\n if head args == \"--help\" || null args\n then\n helpMessage\n else\n let l = lucky args in\n case map readn (filter isInt args) of\n [] -> do\n putStrLn \"Invalid input, missing arguments\"\n putStrLn \"Type --help\"\n [x] -> print (nth x l)\n [x, x2] -> if x2 > 0\n then print (range x x2 l)\n else print (interval x (-x2) l)\n _ -> do\n putStrLn \"Invalid input, wrong number of arguments\"\n putStrLn \"Type --help\"\n","language":"Haskell"},{"code":"luckySeq=:3 :0\n 1 luckySeq y\n:\n len=.0\n nth=.0\n seq=.x+2*i.4*y\n while. len~:#seq do.\n len=. #seq\n nth=. nth+1\n seq=. nth exclude seq\n end.\n)\n\nexclude=: ] #~ 1 - #@] $ -@{ {. 1:\n\nlucky=:''\nevenLucky=:0\nprogram=:3 :0\n range=: |y-.0\n seq=. (1+0 e.y) luckySeq >./range\n if. 0><./y do.\n (#~ e.&(thru/range)) seq\n else.\n (<:thru/range) { seq\n end.\n)\n\nthru=: <./ + i.@(+*)@-~\n","language":"J"},{"code":" program 1 20\n1 3 7 9 13 15 21 25 31 33 37 43 49 51 63 67 69 73 75 79\n program 1 20,evenLucky\n2 4 6 10 12 18 20 22 26 34 36 42 44 50 52 54 58 68 70 76\n program 6000,-6100\n6009 6019 6031 6049 6055 6061 6079 6093\n program 6000,-6100,evenLucky\n6018 6020 6022 6026 6036 6038 6050 6058 6074 6090 6092\n","language":"J"},{"code":"import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\n\npublic class LuckyNumbers {\n\n private static int MAX = 200000;\n private static List<Integer> luckyEven = luckyNumbers(MAX, true);\n private static List<Integer> luckyOdd = luckyNumbers(MAX, false);\n\n public static void main(String[] args) {\n // Case 1 and 2\n if ( args.length == 1 || ( args.length == 2 && args[1].compareTo(\"lucky\") == 0 ) ) {\n int n = Integer.parseInt(args[0]);\n System.out.printf(\"LuckyNumber(%d) = %d%n\", n, luckyOdd.get(n-1));\n }\n // Case 3\n else if ( args.length == 2 && args[1].compareTo(\"evenLucky\") == 0 ) {\n int n = Integer.parseInt(args[0]);\n System.out.printf(\"EvenLuckyNumber(%d) = %d%n\", n, luckyEven.get(n-1));\n }\n // Case 4 through 9\n else if ( args.length == 2 || args.length == 3 ) {\n int j = Integer.parseInt(args[0]);\n int k = Integer.parseInt(args[1]);\n // Case 4 and 5\n if ( ( args.length == 2 && k > 0 ) || (args.length == 3 && k > 0 && args[2].compareTo(\"lucky\") == 0 ) ) {\n System.out.printf(\"LuckyNumber(%d) through LuckyNumber(%d) = %s%n\", j, k, luckyOdd.subList(j-1, k));\n }\n // Case 6\n else if ( args.length == 3 && k > 0 && args[2].compareTo(\"evenLucky\") == 0 ) {\n System.out.printf(\"EvenLuckyNumber(%d) through EvenLuckyNumber(%d) = %s%n\", j, k, luckyEven.subList(j-1, k));\n }\n // Case 7 and 8\n else if ( ( args.length == 2 && k < 0 ) || (args.length == 3 && k < 0 && args[2].compareTo(\"lucky\") == 0 ) ) {\n int n = Collections.binarySearch(luckyOdd, j);\n int m = Collections.binarySearch(luckyOdd, -k);\n System.out.printf(\"Lucky Numbers in the range %d to %d inclusive = %s%n\", j, -k, luckyOdd.subList(n < 0 ? -n-1 : n, m < 0 ? -m-1 : m+1));\n }\n // Case 9\n else if ( args.length == 3 && k < 0 && args[2].compareTo(\"evenLucky\") == 0 ) {\n int n = Collections.binarySearch(luckyEven, j);\n int m = Collections.binarySearch(luckyEven, -k);\n System.out.printf(\"Even Lucky Numbers in the range %d to %d inclusive = %s%n\", j, -k, luckyEven.subList(n < 0 ? -n-1 : n, m < 0 ? -m-1 : m+1));\n }\n }\n }\n\n private static List<Integer> luckyNumbers(int max, boolean even) {\n List<Integer> luckyList = new ArrayList<>();\n for ( int i = even ? 2 : 1 ; i <= max ; i += 2 ) {\n luckyList.add(i);\n }\n int start = 1;\n boolean removed = true;\n while ( removed ) {\n removed = false;\n int increment = luckyList.get(start);\n List<Integer> remove = new ArrayList<>();\n for ( int i = increment-1 ; i < luckyList.size() ; i += increment ) {\n remove.add(0, i);\n removed = true;\n }\n for ( int i : remove ) {\n luckyList.remove(i);\n }\n start++;\n }\n return luckyList;\n }\n\n}\n","language":"Java"},{"code":"function luckyNumbers(opts={}) {\n /**************************************************************************\\\n | OPTIONS |\n |**************************************************************************|\n | even ...... boolean ............. return even/uneven numbers |\n | (default: false) |\n | |\n | nth ....... number ............... return nth number |\n | |\n | through ... number ............... return numbers from #1 to number |\n | OR array[from, to] ... return numbers on index |\n | from array[from] to array[to] |\n | |\n | range ..... array[from, to] ...... return numbers between from and to |\n \\**************************************************************************/\n\n opts.even = opts.even || false;\n if (typeof opts.through == 'number') opts.through = [0, opts.through];\n let out = [],\n x = opts.even ? 2 : 1,\n max = opts.range ? opts.range[1] * 3\n : opts.through ? opts.through[1] * 12\n : opts.nth ? opts.nth * 15\n : 2000;\n\n for (x; x <= max; x = x+2) out.push(x); // fill\n for (x = 1; x < Math.floor(out.length / 2); x++) { // sieve\n let i = out.length;\n while (i--)\n (i+1) % out[x] == 0 && out.splice(i, 1);\n }\n\n if (opts.nth) return out[opts.nth-1];\n if (opts.through) return out.slice(opts.through[0], opts.through[1]);\n if (opts.range) return out.filter(function(val) {\n return val >= opts.range[0] && val <= opts.range[1];\n });\n return out;\n}\n\n/* TESTING */\n// blank\nconsole.log( luckyNumbers() );\n// showing the first twenty lucky numbers\nconsole.log( luckyNumbers({through: 20}) );\n// showing the first twenty even lucky numbers\nconsole.log( luckyNumbers({even: true, through: 20}) );\n// showing all lucky numbers between 6,000 and 6,100 (inclusive)\nconsole.log( luckyNumbers({range: [6000, 6100]}) );\n// showing all even lucky numbers in the same range as above\nconsole.log( luckyNumbers({even: true, range: [6000, 6100]}) );\n// showing the 10,000th lucky number (extra credit)\nconsole.log( luckyNumbers({nth: 10000}) );\n// showing the 10,000th even lucky number (extra credit)\nconsole.log( luckyNumbers({even: true, nth: 10000}) );\n","language":"JavaScript"},{"code":"(function() {\n document.write(`\n <table>\n <tr><th>argument(s)<br>space separated</th><th>gives</th></tr>\n <tr><td>$j</td><td><i>j</i><sup>th</sup> lucky number</tr>\n <tr><td>$j lucky</td><td><i>j</i><sup>th</sup> lucky number</tr>\n <tr><td>$j evenLucky</td><td><i>j</i><sup>th</sup> even lucky number</tr>\n <tr><td> </td><td> </td></tr>\n <tr><td>$j $k</td><td><i>J</i><sup>th</sup> through <i>k</i><sup>th</sup> (inclusive) lucky numbers</td></tr>\n <tr><td>$j $k lucky</td><td><i>J</i><sup>th</sup> through <i>k</i><sup>th</sup> (inclusive) lucky numbers</td></tr>\n <tr><td>$j $k evenLucky</td><td><i>J</i><sup>th</sup> through <i>k</i><sup>th</sup> (inclusive) even lucky numbers</td></tr>\n <tr><td> </td><td> </td></tr>\n <tr><td>-$j</td><td>all lucky numbers in the range 1 .. |<i>j</i>|*</tr>\n <tr><td>$j -$k</td><td>all lucky numbers in the range <i>j</i> .. |<i>k</i>|*</tr>\n <tr><td>$j -$k lucky</td><td>all lucky numbers in the range <i>j</i> .. |<i>k</i>|*</tr>\n <tr><td>$j -$k evenLucky</td><td>all even lucky numbers in the range <i>j</i> .. |<i>k</i>|*</tr>\n </table>\n <p>* where |<i>x</i>| is the absolute value of <i>x</i></p>\n `);\n let args = prompt('Enter a luckyNumbers argument string:').split(' '),\n numbers = [],\n strings = [],\n obj = {}, // object to pass to our luckyNumbers function\n msg = '';\n for (let x = 0; x < args.length; x++) {\n if (isNaN(parseInt(args[x]))) strings.push(args[x].toUpperCase());\n else numbers.push(parseInt(args[x]));\n }\n // check strings\n switch (true) {\n case (strings.length > 1):\n msg += 'Too many arguments.';\n break;\n case (strings.length == 0): break;\n case (strings[0] != 'LUCKY' && strings[0] != 'EVENLUCKY'):\n msg += `Unknown argument: ${strings[0]}.`;\n break;\n case (strings[0] == 'EVENLUCKY'): obj.even = true;\n }\n // check numbers\n switch (true) {\n case (numbers.length == 0):\n msg += 'Missing number argument.';\n break;\n case (numbers.length > 2):\n msg += 'Too many number arguments.';\n break;\n case (numbers.length == 1):\n if (numbers[0] > 0) obj.nth = numbers[0];\n else obj.through = Math.abs(numbers[0]);\n break;\n case (numbers.length == 2):\n // both negative\n if (numbers[0] < 0 && numbers[1] < 0) {\n msg += 'Missing positive argument';\n break;\n }\n // negative + positive\n numbers.sort();\n if (numbers[0] < 0 && numbers[1] > 0) {\n obj.range = [numbers[1], Math.abs(numbers[0])];\n break;\n }\n // both positive\n if (numbers[0] > 0 && numbers[1] > 0) {\n obj.through = [numbers[0]-1, numbers[1]];\n }\n }\n if (msg.length > 0)\n document.write(`<p>${msg}<br>Reload to try again</p>`);\n else {\n let res;\n try { res = luckyNumbers(obj); }\n catch (err) {\n document.write(`<p>${err}<br>Reload to try again</p>`);\n }\n finally {\n if (typeof res == 'object' ) res = res.join(', ');\n document.write(`\n <p>\n <b>Input: </b>${args.join(' ')}<br>\n <b>Result: </b>${res}\n </p>\n <p>Reload to continue</p>\n `)\n }\n }\n})();\n","language":"JavaScript"},{"code":"# Preliminaries:\n# This def can be omitted if using jq or gojq:\ndef range($a;$b;$c): $a | while(. < $b; .+$c);\n\n# jaq does not support string interpolation so, for brevity:\ndef tos: tostring;\n\n# The following def should be modified if an alternative mechanism for\n# reading the parameter arguments is used:\ndef args: {args: [splits(\" *\")]};\n\ndef argsSize: .args|length;\n\n# Input: an array\n# Emit the items in the array until the condition on the items is met.\n# The item for which the condition is first met is NOT emitted.\ndef emit_until(cond):\n length as $length\n | if $length == 0 or (.[0]|cond) then empty\n else . as $in\n | {i:0, ok: true}\n | while(.ok;\n .i+=1\n | .ok = .i < $length and ($in[.i] | cond | not) )\n | $in[.i]\n end;\n\n# input: a number or a string\n# If the input is or can be converted to a number using tonumber, then return the number\n# else return false.\ndef isnumber:\n if type == \"number\" then .\n elif type == \"string\" then tonumber? // false\n else false\n end;\n\n# input: anything\n# output: a boolean\ndef isinteger:\n if type == \"number\" then . == floor\n else isnumber as $x\n | if $x then $x | (. == floor) else false end\n end;\n\n# mark and collapse\ndef removeEvery($n):\n reduce range($n-1; length; $n) as $i (.; .[$i]=null)\n | map(select(.));\n\n# Input: {lucky}\ndef filterLucky:\n (.lucky|length) as $length\n | .n = 2\n | until( .n >= $length;\n .lucky[.n-1] as $m\n | if $m then .lucky |= removeEvery($m) | .n += 1\n else .n = $length\n end )\n | del(.n);\n\ndef printSingle($j):\n if $j >= 1 + (.lucky|length) then \"Argument is too big\" | error\n else\n (if .odd then \"Lucky number #\" else \"Lucky even number #\" end)\n + ($j|tos) + \" = \" + (.lucky[$j-1]|tos)\n end;\n\n# like jq's range($j-1; $k)\ndef printRange($j; $k):\n if $k >= (.lucky|length) then \"Argument \" + ($k|tos) + \" is too big\" | error\n elif .odd\n then \"Lucky numbers \" + ($j|tos) + \" to \" + ($k|tos) + \" inclusive are:\",\n .lucky[$j-1:$k]\n else \"Lucky even numbers \" + ($j|tos) + \" to \" + ($k|tos) + \" inclusive are:\",\n .lucky[$j-1:$k]\n end;\n\ndef printBetween($j; $k):\n .lucky[-1] as $max\n | if $j > $max or $k > $max\n then \"At least one argument is too big\" | error\n else\n (if .odd\n then \"Lucky numbers between \" + ($j|tos) + \" and \" + ($k|tos) + \" are:\"\n else \"Lucky even numbers between \" + ($j|tos) + \" and \" + ($k|tos) + \" are:\"\n end),\n [.lucky | emit_until(. > $k) | select(. >= $j)]\n end;\n\ndef odd:\n if argsSize < 3 then true\n else (.args[2] | tostring | ascii_downcase)\n | if . == \"lucky\" or . == \"odd\" then true\n elif . == \"evenlucky\" or . == \"even\" then false\n else \"Third argument \" + (.args[2]|tos) + \" is invalid\" | error\n end\n end;\n\n# Input: {odd}\ndef init($n):\n if .odd\n then .lucky = reduce range(0;$n) as $i (null; . + [$i*2 + 1])\n else .lucky = reduce range(0;$n) as $i (null; . + [$i*2 + 2])\n end;\n\n# Emit {args, j, k, odd, single} or raise an error\ndef gatherArgs:\n args\n | if argsSize | (. < 1 or . > 3)\n then \"There must be between 1 and 3 command line arguments\" | error\n else .j = (.args[0] | isnumber )\n | .k = (.args[1] | isnumber )\n | .single = (argsSize == 1 or .args[1] == \",\")\n | .odd = odd\n | if (.j | isinteger | not) or (.j < 1)\n then \"First argument \" + (.args[0]|tos) + \" must be a positive integer\" | error\n elif argsSize >= 2 and .args[1] != \",\" and (.k | isinteger | not)\n then \"Second argument \" + (.args[1]|tos) + \" must be an integer or ,\" | error\n else .\n end\n | if .k and .k >= 0 and .j > .k\n then \"Second argument cannot be less than first\" | error\n else .\n end\n end ;\n\ndef start:\n gatherArgs\n | (if .k then (if .k > 0 then .k else null end) else .j end) as $size\n | (if $size then ($size | . * (tostring|length|.*.)) else -.k end) as $size\n | init($size)\n | filterLucky\n | if .single then printSingle(.j)\n elif .k > 0 then printRange(.j; .k)\n else .k |= - .\n | if (.j > .k)\n then \"The second argument cannot be less in absolute value than first\" | error\n else printBetween(.j; .k)\n end\n end;\n\nstart\n","language":"Jq"},{"code":"using Base, StringDistances\n\nstruct Lucky\n start::Int\n nmax::Int\n Lucky(iseven, nmax) = new(iseven ? 2 : 1, nmax)\nend\n\nstruct LuckyState\n nextindex::Int\n sequence::Vector{Int}\nend\n\nBase.eltype(iter::Lucky) = Int\n\nfunction Base.iterate(iter::Lucky, state = LuckyState(1, collect(iter.start:2:iter.nmax)))\n if length(state.sequence) < state.nextindex\n return nothing\n elseif state.nextindex == 1\n return (iter.start, LuckyState(2, state.sequence))\n end\n result = state.sequence[state.nextindex]\n newsequence = Vector{Int}()\n for (i, el) in enumerate(state.sequence)\n if i % result != 0\n push!(newsequence, el)\n end\n end\n (result, LuckyState(state.nextindex + 1, newsequence))\nend\n\nfunction luckyindex(j, wanteven, k=0)\n topindex = max(j, k) + 4\n luck = Lucky(wanteven, topindex * 20)\n iter_result = iterate(luck)\n while iter_result != nothing\n (elem, state) = iter_result\n iter_result = iterate(luck, state)\n if iter_result != nothing && iter_result[2].nextindex > topindex\n return iter_result[2].sequence[k > j ? (j:k) : j]\n end\n end\n throw(\"Index $j out of range for nmax of $(luck.nmax).\")\nend\n\nfunction luckyrange(j, k, wanteven)\n topvalue = max(j, k)\n luck = Lucky(wanteven, topvalue + 1)\n iter_result = iterate(luck)\n (elem, state) = iter_result # save next to last result\n while iter_result != nothing\n (elem, state) = iter_result\n iter_result = iterate(luck, state)\n end\n filter(x -> (j <= x <= k), state.sequence)\nend\n\nfunction helpdisplay(exitlevel=1)\n println(\"\\n\", PROGRAM_FILE, \" j [-][k] [lucky|evenLucky]\")\n println(\"\\tj: index wanted or a starting point (index or value)\",\n \"\\n\\tk: optional ending point (index), \\n\\t-k: optional ending point (value)\\n\")\n helpstring =\n\"\"\" | Argument(s) | What is printed |\n |--------------------------------------------------------------------------|\n | j | jth lucky number (required argument) |\n | j , lucky | jth lucky number |\n | j , evenLucky | jth even lucky number |\n | j k | jth through kth (inclusive) lucky numbers |\n | j k lucky | jth through kth (inclusive) lucky numbers |\n | j k evenLucky | jth through kth (inclusive) even lucky numbers |\n | j -k | all lucky numbers in the value range [m, |k|] |\n | j -k lucky | all lucky numbers in the value range [m, |k|] |\n | j -k evenLucky | all even lucky numbers in the value range [m, |k|] |\n |--------------------------------------------------------------------------|\\n\\n\"\"\"\n\n println(helpstring)\n exit(exitlevel)\nend\n\nfunction parsecommandline()\n comma = false\n evenLucky = false\n range = false\n j = k = 0\n if length(ARGS) < 1\n helpdisplay()\n end\n for (pos, arg) in enumerate(ARGS)\n if pos == 1\n j = tryparse(Int, arg)\n if j == nothing\n println(\"The first argument must be a positive integer.\\n\")\n helpdisplay()\n end\n elseif pos == 2 || (pos == 3 && comma)\n k = tryparse(Int, arg)\n if k == nothing\n k = 0\n if arg == \",\"\n comma = true\n continue\n elseif arg == \"lucky\"\n continue\n elseif arg == \"evenLucky\"\n evenLucky = true\n elseif compare(Hamming(), arg, \"lucky\") > 0.4 || compare(Hamming(), arg, \"evenLucky\") > 0.4\n println(\"Did you misspell \\\"lucky\\\" or \\\"evenLucky\\\"? Check capitalization.\\n\")\n helpdisplay()\n else\n helpdisplay()\n end\n elseif k < 0\n k = -k\n range = true\n end\n elseif pos == 3 || pos == 4 && comma\n if arg == \",\"\n comma = true\n continue\n elseif arg == \"lucky\"\n continue\n elseif arg == \"evenLucky\"\n evenLucky = true\n elseif compare(Hamming(), arg, \"lucky\") > 0.1 || compare(Hamming(), arg, \"evenLucky\") > 0.1\n println(\"Did you misspell \"\\lucky\\\" or \"\\evenLucky\\\"?\\n\\n\")\n helpdisplay()\n else\n helpdisplay()\n end\n elseif arg == \"lucky\"\n continue\n elseif arg == \"evenLucky\"\n evenLucky = true\n else\n println(\"Too many arguments.\\n\")\n helpdisplay()\n end\n end\n (j, k, evenLucky, range)\nend\n\nfunction runopts()\n (j, k, evenLucky, range) = parsecommandline()\n if j < 1 || (k != 0 && j >= k)\n throw(\"Lucky number integer parameters out of range: $(typeof(j)), $j, $(typeof(k)), $k\")\n end\n if range\n println(luckyrange(j, k, evenLucky))\n else\n println(luckyindex(j, evenLucky, k))\n end\nend\n\nrunopts()\n","language":"Julia"},{"code":"// version 1.1.51\n\ntypealias IAE = IllegalArgumentException\n\nval luckyOdd = MutableList(100000) { it * 2 + 1 }\nval luckyEven = MutableList(100000) { it * 2 + 2 }\n\nfun filterLuckyOdd() {\n var n = 2\n while (n < luckyOdd.size) {\n val m = luckyOdd[n - 1]\n val end = (luckyOdd.size / m) * m - 1\n for (j in end downTo m - 1 step m) luckyOdd.removeAt(j)\n n++\n }\n}\n\nfun filterLuckyEven() {\n var n = 2\n while (n < luckyEven.size) {\n val m = luckyEven[n - 1]\n val end = (luckyEven.size / m) * m - 1\n for (j in end downTo m - 1 step m) luckyEven.removeAt(j)\n n++\n }\n}\n\nfun printSingle(j: Int, odd: Boolean) {\n if (odd) {\n if (j >= luckyOdd.size) throw IAE(\"Argument is too big\")\n println(\"Lucky number $j = ${luckyOdd[j - 1]}\")\n }\n else {\n if (j >= luckyEven.size) throw IAE(\"Argument is too big\")\n println(\"Lucky even number $j = ${luckyEven[j - 1]}\")\n }\n}\n\nfun printRange(j: Int, k: Int, odd: Boolean) {\n if (odd) {\n if (k >= luckyOdd.size) throw IAE(\"Argument is too big\")\n println(\"Lucky numbers $j to $k are:\\n${luckyOdd.drop(j - 1).take(k - j + 1)}\")\n }\n else {\n if (k >= luckyEven.size) throw IAE(\"Argument is too big\")\n println(\"Lucky even numbers $j to $k are:\\n${luckyEven.drop(j - 1).take(k - j + 1)}\")\n }\n}\n\nfun printBetween(j: Int, k: Int, odd: Boolean) {\n val range = mutableListOf<Int>()\n if (odd) {\n val max = luckyOdd[luckyOdd.lastIndex]\n if (j > max || k > max) {\n throw IAE(\"At least one argument is too big\")\n }\n for (num in luckyOdd) {\n if (num < j) continue\n if (num > k) break\n range.add(num)\n }\n println(\"Lucky numbers between $j and $k are:\\n$range\")\n }\n else {\n val max = luckyEven[luckyEven.lastIndex]\n if (j > max || k > max) {\n throw IAE(\"At least one argument is too big\")\n }\n for (num in luckyEven) {\n if (num < j) continue\n if (num > k) break\n range.add(num)\n }\n println(\"Lucky even numbers between $j and $k are:\\n$range\")\n }\n}\n\nfun main(args: Array<String>) {\n if (args.size !in 1..3) throw IAE(\"There must be between 1 and 3 command line arguments\")\n filterLuckyOdd()\n filterLuckyEven()\n val j = args[0].toIntOrNull()\n if (j == null || j < 1) throw IAE(\"First argument must be a positive integer\")\n if (args.size == 1) { printSingle(j, true); return }\n\n if (args.size == 2) {\n val k = args[1].toIntOrNull()\n if (k == null) throw IAE(\"Second argument must be an integer\")\n if (k >= 0) {\n if (j > k) throw IAE(\"Second argument can't be less than first\")\n printRange(j, k, true)\n }\n else {\n val l = -k\n if (j > l) throw IAE(\"The second argument can't be less in absolute value than first\")\n printBetween(j, l, true)\n }\n return\n }\n\n var odd =\n if (args[2].toLowerCase() == \"lucky\") true\n else if (args[2].toLowerCase() == \"evenlucky\") false\n else throw IAE(\"Third argument is invalid\")\n\n if (args[1] == \",\") {\n printSingle(j, odd)\n return\n }\n\n val k = args[1].toIntOrNull()\n if (k == null) throw IAE(\"Second argument must be an integer or a comma\")\n\n if (k >= 0) {\n if (j > k) throw IAE(\"Second argument can't be less than first\")\n printRange(j, k, odd)\n }\n else {\n val l = -k\n if (j > l) throw IAE(\"The second argument can't be less in absolute value than first\")\n printBetween(j, l, odd)\n }\n}\n","language":"Kotlin"},{"code":"ClearAll[GetLuckies, GetEvenLuckies]\nGetLuckies[max_] := Module[{luckies, f, i},\n luckies = Range[1, max, 2];\n f[n_] := Block[{k = luckies[[n]]}, luckies = Delete[luckies, Table[{k}, {k, k, Length@luckies, k}]]];\n i = 2;\n While[i < Length[luckies],\n f[i];\n i++\n ];\n luckies\n ]\nGetEvenLuckies[max_] := Module[{lst, i, len},\n lst = Range[2, max, 2];\n i = 2;\n While[i <= (len = Length@lst) && (k = lst[[i]]) <= len,\n lst = Drop[lst, {k, len, k}];\n i++\n ];\n lst\n ]\nGiveLucky[s_String] := GiveLucky[StringSplit[s, \" \"]]\nGiveLucky[args_List] := Module[{argc = Length[args], j, k, type},\n If[argc > 3,\n Print[\"Too many arguments\"]\n ,\n If[argc == 0,\n Print[\"Too few arguments\"]\n ,\n Switch[argc, 1,\n j = Interpreter[\"Integer\"][args[[1]]];\n If[! FailureQ[j],\n If[j > 0,\n Print@GetLuckies[20 j][[j]]\n ,\n Print[\"j should be positive\"]\n ]\n ,\n Print[\"one argument that is not an integer\"]\n ]\n , 2,\n j = Interpreter[\"Integer\"][args[[1]]];\n k = Interpreter[\"Integer\"][args[[2]]];\n If[! FailureQ[j] \\[And] ! FailureQ[k],\n If[j > 0,\n If[k > 0,\n Print@GetLuckies[20 k][[j ;; k]]\n ,\n Print@Select[GetLuckies[-k], GreaterEqualThan[j]]\n ]\n ,\n Print[\"j should be positive\"]\n ]\n ,\n Print[\"one of the two arguments is not an integer\\[Ellipsis]\"]\n ]\n , 3,\n If[args[[2]] === \",\",\n j = Interpreter[\"Integer\"][args[[1]]];\n If[! FailureQ[j],\n If[j > 0,\n type = args[[3]];\n If[MatchQ[type, \"evenLucky\" | \"lucky\"],\n If[type === \"evenLucky\",\n Print@GetEvenLuckies[20 j][[j]]\n ,\n Print@GetLuckies[20 j][[j]]\n ]\n ,\n Print[\"unknown type \", type]\n ]\n ,\n Print[\"j should be positive\"]\n ]\n ,\n Print[\"j should be an integer\"]\n ]\n ,\n j = Interpreter[\"Integer\"][args[[1]]];\n k = Interpreter[\"Integer\"][args[[2]]];\n If[! FailureQ[j] \\[And] ! FailureQ[k],\n If[j > 0,\n type = args[[3]];\n If[k > 0,\n If[MatchQ[type, \"evenLucky\" | \"lucky\"],\n If[type === \"evenLucky\",\n Print@GetEvenLuckies[20 k][[j ;; k]]\n ,\n Print@GetLuckies[20 k][[j ;; k]]\n ]\n ,\n Print[\"unknown type \", type]\n ]\n ,\n If[MatchQ[type, \"evenLucky\" | \"lucky\"],\n If[type === \"evenLucky\",\n Print@Select[GetEvenLuckies[-k], GreaterEqualThan[j]]\n ,\n Print@Select[GetLuckies[-k], GreaterEqualThan[j]]\n ]\n ,\n Print[\"unknown type \", type]\n ]\n ]\n ,\n Print[\"j should be positive\"]\n ]\n ,\n Print[\"one of the two arguments is not an integer\\[Ellipsis]\"]\n ]\n ]\n ]\n ]\n ]\n ]\nGiveLucky[Last@$ScriptCommandLine]\n","language":"Mathematica"},{"code":"import os, strformat, strutils\n\ntype LuckyKind {.pure.} = enum Lucky = \"lucky\", EvenLucky = \"evenlucky\"\n\nconst NoValue = 0 # Indicates that no value have been specified.\n\n\n####################################################################################################\n# Lucky numbers generation.\n\nfunc initLuckyNumbers(nelems: int; kind: LuckyKind): seq[int] =\n ## Initialize a list of lucky numbers.\n result = newSeqOfCap[int](nelems)\n for i in 0..<nelems:\n var k = i\n for j in countdown(result.high, 1):\n k = k * result[j] div (result[j] - 1)\n result.add 2 * k + 1 + ord(kind)\n\n\n####################################################################################################\n# Printing.\n\ntemplate name(kind: LuckyKind): string =\n if kind == Lucky: \"Lucky\" else: \"Even lucky\"\n\nproc printSingle(j: int; kind: LuckyKind) =\n ## Print the lucky number at a given index.\n let luckySeq = initLuckyNumbers(j, kind)\n echo &\"{name(kind)} number at index {j} is {luckySeq[j - 1]}\"\n\nproc printRange(j, k: int; kind: LuckyKind) =\n ## print the luck numbers in a range of indexes.\n let luckySeq = initLuckyNumbers(k, kind)\n var list = &\"{name(kind)} numbers at indexes {j} to {k} are: \"\n let start = list.len\n for idx in (j - 1)..(k - 1):\n list.addSep(\", \", start)\n list.add $luckySeq[idx]\n echo list\n\nproc printInRange(j, k: int; kind: LuckyKind) =\n ## Print the lucky numbers in a range of values.\n let luckySeq = initLuckyNumbers(k, kind) # \"k\" is greater than needed.\n var list = &\"{name(kind)} numbers between {j} to {k} are: \"\n let start = list.len\n for val in luckySeq:\n if val > k: break\n if val > j:\n list.addSep(\", \", start)\n list.add $val\n echo list\n\n\n####################################################################################################\n# Command line parsing.\n\nproc parseCommandLine(): tuple[j, k: int; kind: LuckyKind] =\n ## Parse the command line.\n\n # Internal exception to catch invalid argument value.\n type InvalidArgumentError = object of ValueError\n\n template raiseError(message, value = \"\") =\n ## Raise an InvalidArgumentError.\n raise newException(InvalidArgumentError, message & value & '.')\n\n\n result = (Novalue, Novalue, Lucky)\n\n try:\n\n if paramCount() notin 1..3: raiseError \"Wrong number of arguments\"\n\n # First argument: \"j\" value.\n let p1 = paramStr(1)\n try:\n result.j = parseInt(p1)\n if result.j <= 0: raiseError \"Expected a positive number, got: \", p1\n except ValueError:\n raiseError \"Expected an integer, got: \", p1\n\n # Second argument: \"k\" value or a comma.\n if paramCount() > 1:\n let p2 = paramStr(2)\n if p2 == \",\":\n # Must be followed by the kind of lucky number.\n if paramCount() != 3: raiseError \"Missing kind argument\"\n else:\n try:\n result.k = parseInt(p2)\n if result.k == 0: raiseError \"Expected a non null number, got: \", p2\n except ValueError:\n raiseError \"Expected an integer, got: \", p2\n\n # Third argument: number kind.\n if paramCount() == 3:\n let p3 = paramStr(3)\n try:\n result.kind = parseEnum[LuckyKind](p3.toLowerAscii())\n except ValueError:\n raiseError \"Wrong kind: \", p3\n\n except InvalidArgumentError:\n quit getCurrentExceptionMsg()\n\n\n#———————————————————————————————————————————————————————————————————————————————————————————————————\n# Main program.\n\nlet (j, k, kind) = parseCommandLine()\n\nif k == NoValue:\n # Print jth value.\n printSingle(j, kind)\n\nelif k > 0:\n # Print jth to kth values.\n printRange(j, k, kind)\n\nelse:\n # Print values in range j..(-k).\n printInRange(j, -k, kind)\n","language":"Nim"},{"code":"use Perl6::GatherTake;\n\nsub luck {\nmy($a,$b) = @_;\n\ngather {\n my $i = $b;\n my(@taken,@rotor,$j);\n\n take 0; # 0th index is a placeholder\n push @taken, take $a;\n\n while () {\n for ($j = 0; $j < @rotor; $j++) {\n --$rotor[$j] or last;\n }\n if ($j < @rotor) {\n $rotor[$j] = $taken[$j+1];\n }\n else {\n take $i;\n push @taken, $i;\n push @rotor, $i - @taken;\n }\n $i += 2;\n }\n}\n}\n\n# fiddle with user input\n$j = shift || usage();\n$k = shift || ',';\n$l = shift || 'lucky';\nusage() unless $k =~ /,|-?\\d+/;\nusage() unless $l =~ /^(even)?lucky$/i;\nsub usage { print \"Args must be: j [,|k|-k] [lucky|evenlucky]\\n\" and exit }\n\n# seed the iterator\nmy $lucky = $l =~ /^l/i ? luck(1,3) : luck(2,4);\n\n# access values from 'lazy' list\nif ($k eq ',') {\n print $lucky->[$j]\n} elsif ($k > $j) {\n print $lucky->[$_] . ' ' for $j..$k\n} elsif ($k < 0) {\n while () { last if abs($k) < $lucky->[$i++] } # must first extend the array\n print join ' ', grep { $_ >= $j and $_ <= abs($k) } @$lucky\n}\n\nprint \"\\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;\">luckyMax</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">120000</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">lucky</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">filterLucky</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;\">2</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;\">lucky</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">m</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">lucky</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">],</span>\n <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: #000000;\">1</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">k</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: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lucky</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">mod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">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>\n <span style=\"color: #000000;\">lucky</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">lucky</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</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;\">if</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;\">lucky</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: #000000;\">lucky</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">lucky</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>\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;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">helptxt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n argument(s) | what is displayed\n =======================================\n j | jth lucky number\n j [,] lucky | jth lucky number\n j [,] evenLucky | jth even lucky number\n j k | jth through kth (inclusive) lucky numbers\n j k lucky | jth through kth (inclusive) lucky numbers\n j k evenLucky | jth through kth (inclusive) even lucky numbers\n j -k | all lucky numbers in the range j to k\n j -k lucky | all lucky numbers in the range j to k\n j -k evenLucky | all even lucky numbers in the range j to k\n \"\"\"</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">fatal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">msg</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;\">msg</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;\">helptxt</span><span style=\"color: #0000FF;\">)</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 <span style=\"color: #7060A8;\">abort</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;\">procedure</span> <span style=\"color: #000000;\">process</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">cl</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">--\n -- Allow eg \"lucky j , evenLucky\" to be == \"lucky j evenLucky\"\n --</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cl</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">3</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">cl</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;\">then</span> <span style=\"color: #000000;\">cl</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> <span style=\"color: #0000FF;\">=</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;\">j</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">k</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">single</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">range</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">oddluck</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: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cl</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">cli</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">cl</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;\">cli</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]<=</span><span style=\"color: #008000;\">'9'</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000080;font-style:italic;\">-- (includes '-')</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">scanf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cl</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #008000;\">\"%d\"</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;\">d</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">fatal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"unrecognised \"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">cli</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;\">i</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">fatal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"too many numbers\"</span><span style=\"color: #0000FF;\">)</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;\">n</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><span style=\"color: #000000;\">1</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;\">1</span> <span style=\"color: #008080;\">then</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: #000000;\">fatal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"first argument must be a positive integer\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">j</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">n</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">single</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">range</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</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;\">if</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">j</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">fatal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"second argument cannot be less than first\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">k</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;\">else</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cli</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"lucky\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"evenLucky\"</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;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">fatal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"unrecognised \"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">cli</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;\">i</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cl</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">fatal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cli</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\" must be last parameter\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">oddluck</span> <span style=\"color: #0000FF;\">=</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;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #000000;\">lucky</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">luckyMax</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">oddluck</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">filterLucky</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;\">\"Output when args are %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cl</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">evenstr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">oddluck</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">\"even \"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">single</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">></span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lucky</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">fatal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"the argument, %d, is too big\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">))</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;\">\"Lucky %snumber %d = %d\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">evenstr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">lucky</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">range</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">></span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lucky</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">fatal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"the argument, %d, is too big\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">))</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;\">\"Lucky %snumbers %d to %d are: %v\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">evenstr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">lucky</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">lucky</span><span style=\"color: #0000FF;\">[$]</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">fatal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"start of range is too big\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">lucky</span><span style=\"color: #0000FF;\">[$]</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">fatal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"end of range is too big\"</span><span style=\"color: #0000FF;\">)</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;\">m</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">abs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">binary_search</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">lucky</span><span style=\"color: #0000FF;\">)),</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">binary_search</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">lucky</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;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">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;\">1</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;\">\"Lucky %snumbers between %d and %d are: %v\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">evenstr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">lucky</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>\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;\">procedure</span> <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">cl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">command_line</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;\">cl</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000080;font-style:italic;\">-- fatal(\"at least one argument must be supplied\") -- (if preferred)</span>\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;\">\"1 20\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"1 20 evenLucky\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"20 lucky\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"20 evenLucky\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"6000 -6100\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"6000 -6100 evenLucky\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"10000 lucky\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"10000 evenLucky\"</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #000080;font-style:italic;\">-- (done this way to exercise the real command line handling...)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">cl</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #000000;\">cl</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: #000080;font-style:italic;\">-- (compiled)</span>\n <span style=\"color: #000000;\">cl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">cl</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;\">elsif</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()=</span><span style=\"color: #004600;\">WINDOWS</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000080;font-style:italic;\">-- (and interpreted)</span>\n <span style=\"color: #000000;\">cl</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: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cl</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #008000;\">\"pw\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"p\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (pw.exe -> p.exe)</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;\">cl</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</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;\">cl</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: #000000;\">cl</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;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"\\\"%s\\\"\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">cl</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;\">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;\">t</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: #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: #000080;font-style:italic;\">-- (...except when we can't do that, of course)</span>\n <span style=\"color: #000000;\">process</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tests</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">]))</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">cmd</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">join</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;\">cl</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">tests</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">]))</span>\n <span style=\"color: #000080;font-style:italic;\">-- printf(1,\"running %s\\n\",{cmd})</span>\n <span style=\"color: #0000FF;\">{}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">system_exec</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cmd</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;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"tests complete\\n\"</span><span style=\"color: #0000FF;\">)</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 <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">cl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">cl</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">..$]</span> <span style=\"color: #000080;font-style:italic;\">-- ({1,2} are {interperter,source} or {exe,exe})</span>\n <span style=\"color: #000000;\">process</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cl</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":"(off *Even)\n\n(de nn (Lst N)\n (seek\n '((L)\n (when (car L) (=0 (dec 'N))) )\n Lst ) )\n\n(de lucky (B)\n (let Lst (range (if *Even 2 1) B 2)\n (for A (cdr Lst)\n (for (L (nn Lst A) L (nn (cdr L) A))\n (set L) ) )\n (filter bool Lst) ) )\n\n(argv . *Argv) # without validations\n(when (= \"evenLucky\" (last *Argv)) (on *Even))\n(setq *Lst (lucky 7000))\n(let (A (format (car *Argv)) B (format (cadr *Argv)))\n (println\n (if (lt0 B)\n (filter '((N) (<= A N (abs B))) *Lst)\n (head B (nth *Lst A)) ) ) )\n","language":"PicoLisp"},{"code":"from __future__ import print_function\n\ndef lgen(even=False, nmax=1000000):\n start = 2 if even else 1\n n, lst = 1, list(range(start, nmax + 1, 2))\n lenlst = len(lst)\n yield lst[0]\n while n < lenlst and lst[n] < lenlst:\n yield lst[n]\n n, lst = n + 1, [j for i,j in enumerate(lst, 1) if i % lst[n]]\n lenlst = len(lst)\n # drain\n for i in lst[n:]:\n yield i\n","language":"Python"},{"code":"from itertools import islice\nimport sys, re\n\nclass ArgumentError(Exception):\n pass\ndef arghandler(argstring):\n match_obj = re.match( r\"\"\"(?mx)\n (?:\n (?P<SINGLE>\n (?: ^ (?P<SINGLEL> \\d+ ) (?: | \\s , \\s lucky ) \\s* $ )\n |(?: ^ (?P<SINGLEE> \\d+ ) (?: | \\s , \\s evenLucky ) \\s* $ )\n )\n |(?P<KTH>\n (?: ^ (?P<KTHL> \\d+ \\s \\d+ ) (?: | \\s lucky ) \\s* $ )\n |(?: ^ (?P<KTHE> \\d+ \\s \\d+ ) (?: | \\s evenLucky ) \\s* $ )\n )\n |(?P<RANGE>\n (?: ^ (?P<RANGEL> \\d+ \\s -\\d+ ) (?: | \\s lucky ) \\s* $ )\n |(?: ^ (?P<RANGEE> \\d+ \\s -\\d+ ) (?: | \\s evenLucky ) \\s* $ )\n )\n )\"\"\", argstring)\n\n if match_obj:\n # Retrieve group(s) by name\n SINGLEL = match_obj.group('SINGLEL')\n SINGLEE = match_obj.group('SINGLEE')\n KTHL = match_obj.group('KTHL')\n KTHE = match_obj.group('KTHE')\n RANGEL = match_obj.group('RANGEL')\n RANGEE = match_obj.group('RANGEE')\n if SINGLEL:\n j = int(SINGLEL)\n assert 0 < j < 10001, \"Argument out of range\"\n print(\"Single %i'th lucky number:\" % j, end=' ')\n print( list(islice(lgen(), j-1, j))[0] )\n elif SINGLEE:\n j = int(SINGLEE)\n assert 0 < j < 10001, \"Argument out of range\"\n print(\"Single %i'th even lucky number:\" % j, end=' ')\n print( list(islice(lgen(even=True), j-1, j))[0] )\n elif KTHL:\n j, k = [int(num) for num in KTHL.split()]\n assert 0 < j < 10001, \"first argument out of range\"\n assert 0 < k < 10001 and k > j, \"second argument out of range\"\n print(\"List of %i ... %i lucky numbers:\" % (j, k), end=' ')\n for n, luck in enumerate(lgen(), 1):\n if n > k: break\n if n >=j: print(luck, end = ', ')\n print('')\n elif KTHE:\n j, k = [int(num) for num in KTHE.split()]\n assert 0 < j < 10001, \"first argument out of range\"\n assert 0 < k < 10001 and k > j, \"second argument out of range\"\n print(\"List of %i ... %i even lucky numbers:\" % (j, k), end=' ')\n for n, luck in enumerate(lgen(even=True), 1):\n if n > k: break\n if n >=j: print(luck, end = ', ')\n print('')\n elif RANGEL:\n j, k = [int(num) for num in RANGEL.split()]\n assert 0 < j < 10001, \"first argument out of range\"\n assert 0 < -k < 10001 and -k > j, \"second argument out of range\"\n k = -k\n print(\"List of lucky numbers in the range %i ... %i :\" % (j, k), end=' ')\n for n in lgen():\n if n > k: break\n if n >=j: print(n, end = ', ')\n print('')\n elif RANGEE:\n j, k = [int(num) for num in RANGEE.split()]\n assert 0 < j < 10001, \"first argument out of range\"\n assert 0 < -k < 10001 and -k > j, \"second argument out of range\"\n k = -k\n print(\"List of even lucky numbers in the range %i ... %i :\" % (j, k), end=' ')\n for n in lgen(even=True):\n if n > k: break\n if n >=j: print(n, end = ', ')\n print('')\n else:\n raise ArgumentError('''\n\n Error Parsing Arguments!\n\n Expected Arguments of the form (where j and k are integers):\n\n j # Jth lucky number\n j , lucky # Jth lucky number\n j , evenLucky # Jth even lucky number\n #\n j k # Jth through Kth (inclusive) lucky numbers\n j k lucky # Jth through Kth (inclusive) lucky numbers\n j k evenLucky # Jth through Kth (inclusive) even lucky numbers\n #\n j -k # all lucky numbers in the range j --? |k|\n j -k lucky # all lucky numbers in the range j --? |k|\n j -k evenLucky # all even lucky numbers in the range j --? |k|\n ''')\n\nif __name__ == '__main__':\n arghandler(' '.join(sys.argv[1:]))\n","language":"Python"},{"code":"from itertools import count\ndef lgen(even=False):\n lucky = []\n if not even:\n yield 1\n for k in count(1):\n for l in reversed(lucky):\n k = (k*l)//(l-1)\n lucky.append(2*k+1 + even)\n yield 2*k+1 + even\n","language":"Python"},{"code":"sub luck(\\a,\\b) {\n gather {\n\tmy @taken = take a;\n\tmy @rotor;\n\tmy $i = b;\n\n\tloop {\n\t loop (my $j = 0; $j < @rotor; $j++) {\n\t\t--@rotor[$j] or last;\n\t }\n\t if $j < @rotor {\n\t\t@rotor[$j] = @taken[$j+1];\n\t }\n\t else {\n\t\tpush @taken, take $i;\n\t\tpush @rotor, $i - @taken;\n\t }\n\t $i += 2;\n\t}\n }\n}\n\nconstant @lucky = luck(1,3);\nconstant @evenlucky = luck(2,4);\n\nsubset Luck where m:i/^ 'even'? 'lucky' $/;\n\nmulti MAIN (Int $num where * > 0) {\n say @lucky[$num-1];\n}\n\nmulti MAIN (Int $num where * > 0, ',', Luck $howlucky = 'lucky') {\n say @::(lc $howlucky)[$num-1];\n}\n\nmulti MAIN (Int $first where * > 0, Int $last where * > 0, Luck $howlucky = 'lucky') {\n say @::(lc $howlucky)[$first-1 .. $last - 1];\n}\n\nmulti MAIN (Int $min where * > 0, Int $neg-max where * < 0, Luck $howlucky = 'lucky') {\n say grep * >= $min, (@::(lc $howlucky) ...^ * > abs $neg-max);\n}\n","language":"Raku"},{"code":"/*REXX program displays lucky or evenLucky integers (numbers or a number range).*/\nparse arg bot top func _ . /*obtain required & optional arguments.*/\nif func=='' then func= 'lucky' /*Not specified? Then use the default.*/\ns= left('s', bot\\==top & top\\==\",\") /*plural results (or maybe not plural).*/\nsay func 'number's\":\" bot top '───►' $lucky(bot, top, func, _)\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n$lucky: arg x,y,f,?; if y=='' | y==\",\" then y= x /*obtain some arguments; set Y.*/\n #= 0; $=; ny= y<0 /*set variable NOY: value range*/\n if f=='' then f= 'LUCKY'; lucky= (f==\"LUCKY\") /*assume LUCKY if omitted. */\n if f\\=='LUCKY' & f\\=='EVENLUCKY' then return 'function not valid: ' f\n if arg()>3 & ?\\='' then return \"too many arguments entered: \" ?\n if x='' then return \"1st argument is missing.\"\n if x<1 then return \"1st argument isn't a positive integer: \" x\n if \\datatype(x,'W') then return \"1st argument isn't an integer: \" x\n if \\datatype(y,'W') then return \"2nd argument isn't an integer: \" y\n if x>ay then return \"2nd argument is less than 1st arg.\"\n ay=abs(y); yL=ay; if y>0 then yL= y*10 + y + y /*adjust the upper Y limit. */\n /* [↓] build LUCKY | EVENLUCKY*/\n do j=1 until j>=yL /*construct list pos. integers.*/\n if j//2==(\\lucky) then iterate /*EVENLUCKY? Use only even ints*/\n\n if lucky then if (j+1)//6==0 then iterate /*prune if mod 6 ≡ zero.*/\n else nop /*balance the IF-THEN logic.*/\n else if j //8==0 then iterate /*prune next if mod 8 ≡ zero.*/\n #= # + 1 /*bump the counter of numbers. */\n $= $ j /*append integer to the $ list.*/\n end /*j*/\n q=0\n do p=3 until q==''; q= word($, p) /*start to prune integer list.*/\n if q># then leave /*if integer is too large, stop*/\n do j=#%q*q by -q to q /*elide every Qth integer. */\n $= delword($, j, 1) /*delete a particular number. */\n #= # -1 /*decrease the integer count. */\n end /*j*/ /*delete from the right side. */\n end /*p*/\n @.=\n do k=1; parse var $ q $; if q=='' then leave; @.k= q\n end /*k*/\n @.0=k-1\n do m=1 for # /*restrict the found integers. */\n if (\\ny & (m<x | m>ay)) | (ny & (@.m<x | @.m>ay)) then @.m=\n end /*m*/ /* [↑] a list of #s or a range*/\n _=\n do b=1 for @.0; _= _ @.b /*construct a list of integers.*/\n end /*b*/\n return space(_) /*remove superfluous blanks. */\n","language":"REXX"},{"code":"# Project : Lucky and even lucky numbers\n\nlucky = list(50)\ndellucky = []\nfor n = 1 to 50\n lucky[n] = 2*n-1\nnext\nsee \"the first 20 lucky numbers:\" + nl\nluckynumbers(lucky)\nshowarray(lucky)\nsee nl\n\nlucky = list(50)\ndellucky = []\nfor n = 1 to 50\n lucky[n] = 2*n\nnext\nsee \"the first 20 even lucky numbers:\" + nl\nluckynumbers(lucky)\nshowarray(lucky)\nsee nl\n\nlucky = list(20000)\ndellucky = []\nfor n = 1 to 10000\n lucky[n] = 2*n-1\nnext\nsee \"lucky numbers between 6,000 and 6,100:\" + nl\nluckynumbers2(lucky)\nshowarray2(lucky)\nsee nl\n\nlucky = list(20000)\ndellucky = []\nfor n = 1 to 10000\n lucky[n] = 2*n\nnext\nsee \"even lucky numbers between 6,000 and 6,100:\" + nl\nluckynumbers2(lucky)\nshowarray2(lucky)\nsee nl\n\nfunc luckynumbers(lucky)\n for n = 2 to len(lucky)\n dellucky = []\n for m = lucky[n] to len(lucky) step lucky[n]\n add(dellucky, m)\n next\n for p = len(dellucky) to 1 step -1\n del(lucky, dellucky[p])\n next\n next\n\nfunc luckynumbers2(lucky)\n for n = 2 to len(lucky)\n dellucky = []\n for m = lucky[n] to len(lucky) step lucky[n]\n add(dellucky, m)\n next\n for p = len(dellucky) to 1 step -1\n del(lucky, dellucky[p])\n next\n if lucky[n] >= 6100\n exit\n ok\nnext\n\nfunc showarray(vect)\n see \"[\"\n svect = \"\"\n for n = 1 to 20\n svect = svect + vect[n] + \", \"\n next\n svect = left(svect, len(svect) - 2)\n see svect\n see \"]\" + nl\n\nfunc showarray2(vect)\n see \"[\"\n svect = \"\"\n for n = 1 to len(vect)\n if vect[n] >= 6000 and vect[n] <= 6100\n svect = svect + vect[n] + \", \"\n ok\n next\n svect = left(svect, len(svect) - 2)\n see svect\n see \"]\" + nl\n","language":"Ring"},{"code":"def generator(even=false, nmax=1000000)\n start = even ? 2 : 1\n Enumerator.new do |y|\n n = 1\n ary = [0] + (start..nmax).step(2).to_a # adds [0] to revise the 0 beginnings.\n y << ary[n]\n while (m = ary[n+=1]) < ary.size\n y << m\n (m...ary.size).step(m){|i| ary[i]=nil}\n ary.compact! # remove nil\n end\n # drain\n ary[n..-1].each{|i| y << i}\n raise StopIteration\n end\nend\n\ndef lucky(argv)\n j, k = argv[0].to_i, argv[1].to_i\n mode = /even/i=~argv[2] ? :'even lucky' : :lucky\n seq = generator(mode == :'even lucky')\n ord = ->(n){\"#{n}#{(n%100).between?(11,19) ? 'th' : %w[th st nd rd th th th th th th][n%10]}\"}\n if k.zero?\n puts \"#{ord[j]} #{mode} number: #{seq.take(j).last}\"\n elsif 0 < k\n puts \"#{ord[j]} through #{ord[k]} (inclusive) #{mode} numbers\",\n \" #{seq.take(k)[j-1..-1]}\"\n else\n k = -k\n ary = []\n loop do\n case num=seq.next\n when 1...j\n when j..k then ary << num\n else break\n end\n end\n puts \"all #{mode} numbers in the range #{j}..#{k}\",\n \" #{ary}\"\n end\nend\n\nif __FILE__ == $0\n lucky(ARGV)\nend\n","language":"Ruby"},{"code":"struct LuckyNumbers : Sequence, IteratorProtocol {\n let even: Bool\n let through: Int\n\n private var drainI = 0\n private var n = 0\n private var lst: [Int]\n\n init(even: Bool = false, through: Int = 1_000_000) {\n self.even = even\n self.through = through\n self.lst = Array(stride(from: even ? 2 : 1, through: through, by: 2))\n }\n\n mutating func next() -> Int? {\n guard n != 0 else {\n defer { n += 1 }\n\n return lst[0]\n }\n\n while n < lst.count && lst[n] < lst.count {\n let retVal = lst[n]\n\n lst = lst.enumerated().filter({ ($0.offset + 1) % lst[n] != 0 }).map({ $0.element })\n n += 1\n\n return retVal\n }\n\n if drainI == 0 {\n lst = Array(lst.dropFirst(n))\n }\n\n while drainI < lst.count {\n defer { drainI += 1 }\n\n return lst[drainI]\n }\n\n return nil\n }\n}\n","language":"Swift"},{"code":"let args = Array(CommandLine.arguments.dropFirst())\n\nguard let sj = args.first, let j = Int(sj), j > 0, j <= 10_000 else {\n fatalError(\"Incorrect j\")\n}\n\nfunc evenString(_ even: Bool) -> String {\n return even ? \"even\" : \"\"\n}\n\nfunc jLuckyNumber(_ j: Int, even: Bool) {\n print(\"The \\(j)th \\(evenString(even)) lucky number is \\(Array(LuckyNumbers(even: even))[j-1..<j].first!)\")\n}\n\nfunc luckyNumbersKth(j: Int, k: Int, even: Bool) {\n print(\"List of \\(j) ... \\(k) \\(evenString(even)) lucky numbers: \", terminator: \"\")\n\n for (offset, luck) in LuckyNumbers(even: even).lazy.enumerated() {\n guard offset + 1 <= k else { break }\n\n if offset + 1 >= j {\n print(luck, terminator: \", \")\n }\n }\n\n print()\n}\n\nfunc luckyNumbersRange(j: Int, k: Int, even: Bool) {\n print(\"List of \\(evenString(even)) lucky numbers in the range \\(j) ... \\(-k): \", terminator: \"\")\n\n for lucky in LuckyNumbers(even: even).lazy {\n guard lucky <= -k else { break }\n\n if lucky >= j {\n print(lucky, terminator: \", \")\n }\n }\n\n print()\n}\n\nswitch args.count {\ncase 1:\n jLuckyNumber(j, even: false)\ncase 2:\n switch Int(args.last!) {\n case let k? where k > 0 && k <= 10_000 && k > j:\n luckyNumbersKth(j: j, k: k, even: false)\n case let k? where k < 0 && -k > j:\n luckyNumbersRange(j: j, k: k, even: false)\n case _:\n fatalError(\"Bad args\")\n }\ncase 3:\n switch (Int(args[1]), args.last!) {\n case (nil, \"lucky\"):\n jLuckyNumber(j, even: false)\n case (nil, \"evenLucky\"):\n jLuckyNumber(j, even: true)\n case let (k?, \"lucky\") where k > 0 && k <= 10_000 && k > j:\n luckyNumbersKth(j: j, k: k, even: false)\n case let (k?, \"evenLucky\") where k > 0 && k <= 10_000 && k > j:\n luckyNumbersKth(j: j, k: k, even: true)\n case let (k?, \"lucky\") where k < 0 && -k > j:\n luckyNumbersRange(j: j, k: k, even: false)\n case let (k?, \"evenLucky\") where k < 0 && -k > j:\n luckyNumbersRange(j: j, k: k, even: true)\n case _:\n fatalError(\"Bad args\")\n }\ncase _:\n fatalError()\n}\n","language":"Swift"},{"code":"#!/usr/bin/env tclsh8.6\npackage require Tcl 8.6\n\nproc lgen {{even false} {nmax 200000}} {\n coroutine lgen.[incr ::lgen] apply {{start nmax} {\n\tset n 1\n\tfor {set i $start} {$i <= $nmax+1} {incr i 2} {lappend lst $i}\n\tyield [info coroutine]\n\tyield [lindex $lst 0]\n\twhile {$n < [llength $lst] && [lindex $lst $n] < [llength $lst]} {\n\t yield [lindex $lst $n]\n\t set lst [set i 0;lmap j $lst {\n\t\tif {[incr i] % [lindex $lst $n]} {set j} else continue\n\t }]\n\t incr n\n\t}\n\tforeach i [lrange $lst $n end] {\n\t yield $i\n\t}\n }} [expr {$even ? 2 : 1}] $nmax\n}\n\nproc collectIndices {generator from to} {\n set result {}\n for {set i 0} {$i <= $to} {incr i} {\n\tset n [$generator]\n\tif {$i >= $from} {lappend result $n}\n }\n rename $generator {}\n return $result\n}\nproc collectValues {generator from to} {\n set result {}\n while 1 {\n\tset n [$generator]\n\tif {$n > $to} break\n\tif {$n >= $from} {lappend result $n}\n }\n rename $generator {}\n return $result\n}\n\nif {$argc<1||$argc>3} {\n puts stderr \"wrong # args: should be \\\"$argv0 from ?to? ?evenOdd?\\\"\"\n exit 1\n}\nlassign $argv from to evenOdd\nif {$argc < 3} {set evenOdd lucky}\nif {$argc < 2} {set to ,}\nif {![string is integer -strict $from] || $from < 1} {\n puts stderr \"\\\"from\\\" must be positive integer\"\n exit 1\n} elseif {$to ne \",\" && (![string is integer -strict $to] || $to == 0)} {\n puts stderr \"\\\"to\\\" must be positive integer or comma\"\n exit 1\n} elseif {[set evenOdd [string tolower $evenOdd]] ni {lucky evenlucky}} {\n puts stderr \"\\\"evenOdd\\\" must be \\\"lucky\\\" or \\\"evenLucky\\\"\"\n exit 1\n}\nset l [lgen [expr {$evenOdd eq \"evenlucky\"}]]\nset evenOdd [lindex {\"lucky\" \"even lucky\"} [expr {$evenOdd eq \"evenlucky\"}]]\nif {$to eq \",\"} {\n puts \"$from'th $evenOdd number = [collectIndices $l [incr from -1] $from]\"\n} elseif {$to < 0} {\n set to [expr {-$to}]\n puts \"all $evenOdd numbers from $from to $to: [join [collectValues $l $from $to] ,]\"\n} else {\n puts \"$from'th to $to'th $evenOdd numbers: [join [collectIndices $l [incr from -1] [incr to -1]] ,]\"\n}\n","language":"Tcl"},{"code":"import \"os\" for Process\nimport \"./iterate\" for Stepped\nimport \"./str\" for Str\n\nvar luckyOdd = List.filled(1e5, 0)\nvar luckyEven = List.filled(1e5, 0)\n\nvar init = Fn.new {\n for (i in 0...1e5) {\n luckyOdd[i] = i*2 + 1\n luckyEven[i] = i*2 + 2\n }\n}\n\nvar filterLuckyOdd = Fn.new {\n var n = 2\n while (n < luckyOdd.count) {\n var m = luckyOdd[n-1]\n var end = (luckyOdd.count/m).floor * m - 1\n for (j in Stepped.descend(end..m-1, m)) luckyOdd.removeAt(j)\n n = n + 1\n }\n}\n\nvar filterLuckyEven = Fn.new {\n var n = 2\n while (n < luckyEven.count) {\n var m = luckyEven[n-1]\n var end = (luckyEven.count/m).floor * m - 1\n for (j in Stepped.descend(end..m-1, m)) luckyEven.removeAt(j)\n n = n + 1\n }\n}\n\nvar printSingle = Fn.new { |j, odd|\n if (odd) {\n if (j >= luckyOdd.count) Fiber.abort(\"Argument is too big\")\n System.print(\"Lucky number %(j) = %(luckyOdd[j-1])\")\n } else {\n if (j >= luckyEven.count) Fiber.abort(\"Argument is too big\")\n System.print(\"Lucky even number %(j) = %(luckyEven[j-1])\")\n }\n}\n\nvar printRange = Fn.new { |j, k, odd|\n if (odd) {\n if (k >= luckyOdd.count) Fiber.abort(\"Argument is too big\")\n var rng = luckyOdd.skip(j-1).take(k-j+1).toList\n System.print(\"Lucky numbers %(j) to %(k) are:\\n %(rng)\")\n } else {\n if (k >= luckyEven.count) Fiber.abort(\"Argument is too big\")\n var rng = luckyEven.skip(j-1).take(k-j+1).toList\n System.print(\"Lucky even numbers %(j) to %(k) are:\\n %(rng)\")\n }\n}\n\nvar printBetween = Fn.new { |j, k, odd|\n var rng = []\n if (odd) {\n var max = luckyOdd[-1]\n if (j > max || k > max) {\n Fiber.abort(\"At least one argument is too big\")\n }\n for (num in luckyOdd) {\n if (num >= j) {\n if (num > k) break\n rng.add(num)\n }\n }\n System.print(\"Lucky numbers between %(j) and %(k) are:\\n%(rng)\")\n } else {\n var max = luckyEven[-1]\n if (j > max || k > max) {\n Fiber.abort(\"At least one argument is too big\")\n }\n for (num in luckyEven) {\n if (num >= j) {\n if (num > k) break\n rng.add(num)\n }\n }\n System.print(\"Lucky even numbers between %(j) and %(k) are:\\n%(rng)\")\n }\n}\n\nvar args = Process.arguments\nvar argsSize = args.count\nif (argsSize < 1 || argsSize > 3) Fiber.abort(\"There must be between 1 and 3 command line arguments\")\ninit.call()\nfilterLuckyOdd.call()\nfilterLuckyEven.call()\nvar j = Num.fromString(args[0])\nif (j.type != Num || !j.isInteger || j < 1) Fiber.abort(\"First argument must be a positive integer\")\nif (argsSize == 1) {\n printSingle.call(j, true)\n return\n}\n\nif (argsSize == 2) {\n var k = Num.fromString(args[1])\n if (k.type != Num || !k.isInteger) Fiber.abort(\"Second argument must be an integer\")\n if (k >= 0) {\n if (j > k) Fiber.abort(\"Second argument can't be less than first\")\n printRange.call(j, k, true)\n } else {\n var l = -k\n if (j > l) Fiber.abort(\"The second argument can't be less in absolute value than first\")\n printBetween.call(j, l, true)\n }\n return\n}\n\nargs[2] = Str.lower(args[2])\nvar odd = (args[2] == \"lucky\") ? true :\n (args[2] == \"evenlucky\") ? false : Fiber.abort(\"Third argument is invalid\")\n\nif (args[1] == \",\") {\n printSingle.call(j, odd)\n return\n}\n\nvar k = Num.fromString(args[1])\nif (!((k.type == Num && k.isInteger) || (k.type == String && k == \",\"))) {\n Fiber.abort(\"Second argument must be an integer or a comma\")\n}\nif (k >= 0) {\n if (j > k) Fiber.abort(\"Second argument can't be less than first\")\n printRange.call(j, k, odd)\n} else {\n var l = -k\n if (j > l) Fiber.abort(\"The second argument can't be less in absolute value than first\")\n printBetween.call(j, l, odd)\n}\n","language":"Wren"},{"code":"fcn lgen(a){\n ns,idx:=[a..*,2],2;\n vm.yield(ns.next());\n while(1){\n n:=ns.next();\n vm.yield(n);\n ns=ns.tweak(skipper.fp1(n,Ref(idx+=1))); // tack on another filter\n }\n}\nfcn skipper(n,skp,cnt){ z:=cnt.inc(); if(z%skp==0) Void.Skip else n }\n","language":"Zkl"},{"code":"cmdLineArgs,j,k,start:=vm.arglist,Void,Void,1;\ntry{\n j=cmdLineArgs[0].toInt();\n na:=cmdLineArgs.len();\n if(na>1){\n if(cmdLineArgs[1]==\",\")\n start=cmdLineArgs[2][0].toLower()==\"e\" and 2 or 1;\n else{\n\t k=cmdLineArgs[1].toInt();\n\t if(na>2)\n\t start=cmdLineArgs[2][0].toLower()==\"e\" and 2 or 1;\n }\n }\n}catch{\n fcn options{\n \"args: j | j , [even]lucky | j k [even]lucky | j -k [even]lucky\"\n .println();\n System.exit(1);\n }()\n}\nluckies:=Utils.Generator(lgen,start);\ntry{\n if(Void==k) luckies.drop(j-1).next().println();\n else{\n if(k>0) luckies.drop(j-1).walk(k-j+1).println();\n else{ k=-k;\n\t while((n:=luckies.next())<j){}\n\t luckies.push(n);\n\t luckies.pump(List,'wrap(n){ n<=k and n or Void.Stop }).println();\n }\n }\n}catch(TheEnd){ options() }\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Lucky_and_even_lucky_numbers\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"<small>Note that in the following explanation list indices are assumed to start at ''one''.</small>\\n\\n;Definition of lucky numbers\\n''[[wp:Lucky number|Lucky numbers]]'' are positive integers that are formed by:\\n\\n# Form a list of all the positive odd integers > 0<br><math>1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39 ...</math>\\n# Return the first number from the list (which is '''1''').\\n# <small>(Loop begins here)</small>\\n#* Note then return the second number from the list (which is '''3''').\\n#* Discard every third, (as noted), number from the list to form the new list<br><math>1, 3, 7, 9, 13, 15, 19, 21, 25, 27, 31, 33, 37, 39, 43, 45, 49, 51, 55, 57 ...</math>\\n# <small>(Expanding the loop a few more times...)</small>\\n#* Note then return the third number from the list (which is '''7''').\\n#* Discard every 7<sup>th</sup>, (as noted), number from the list to form the new list<br><math>1, 3, 7, 9, 13, 15, 21, 25, 27, 31, 33, 37, 43, 45, 49, 51, 55, 57, 63, 67 ...</math>\\n#* Note then return the 4<sup>th</sup> number from the list (which is '''9''').\\n#* Discard every 9<sup>th</sup>, (as noted), number from the list to form the new list<br><math>1, 3, 7, 9, 13, 15, 21, 25, 31, 33, 37, 43, 45, 49, 51, 55, 63, 67, 69, 73 ...</math>\\n#* Take the 5<sup>th</sup>, i.e. '''13'''. Remove every 13<sup>th</sup>.\\n#* Take the 6<sup>th</sup>, i.e. '''15'''. Remove every 15<sup>th</sup>.\\n#* Take the 7<sup>th</sup>, i.e. '''21'''. Remove every 21<sup>th</sup>.\\n#* Take the 8<sup>th</sup>, i.e. '''25'''. Remove every 25<sup>th</sup>.\\n# <small>(Rule for the loop)</small>\\n#* Note the <math>n</math><sup>th</sup>, which is <math>m</math>.\\n#* Remove every <math>m</math><sup>th</sup>.\\n#* Increment <math>n</math>.\\n\\n;Definition of even lucky numbers\\nThis follows the same rules as the definition of lucky numbers above ''except for the very first step'':\\n# Form a list of all the positive '''even''' integers > 0<br><math>2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40 ...</math>\\n# Return the first number from the list (which is '''2''').\\n# <small>(Loop begins here)</small>\\n#* Note then return the second number from the list (which is '''4''').\\n#* Discard every 4<sup>th</sup>, (as noted), number from the list to form the new list<br><math>2, 4, 6, 10, 12, 14, 18, 20, 22, 26, 28, 30, 34, 36, 38, 42, 44, 46, 50, 52 ...</math>\\n# <small>(Expanding the loop a few more times...)</small>\\n#* Note then return the third number from the list (which is '''6''').\\n#* Discard every 6<sup>th</sup>, (as noted), number from the list to form the new list<br><math>2, 4, 6, 10, 12, 18, 20, 22, 26, 28, 34, 36, 38, 42, 44, 50, 52, 54, 58, 60 ...</math>\\n#* Take the 4<sup>th</sup>, i.e. '''10'''. Remove every 10<sup>th</sup>.\\n#* Take the 5<sup>th</sup>, i.e. '''12'''. Remove every 12<sup>th</sup>.\\n# <small>(Rule for the loop)</small>\\n#* Note the <math>n</math><sup>th</sup>, which is <math>m</math>.\\n#* Remove every <math>m</math><sup>th</sup>.\\n#* Increment <math>n</math>.\\n\\n;Task requirements\\n* Write one or two subroutines (functions) to generate ''lucky numbers'' and ''even lucky numbers'' \\n* Write a command-line interface to allow selection of which kind of numbers and which number(s). Since input is from the command line, tests should be made for the common errors:\\n** missing arguments\\n** too many arguments\\n** number (or numbers) aren't legal\\n** misspelled argument ('''lucky''' or '''evenLucky''')\\n* The command line handling should:\\n** support mixed case handling of the (non-numeric) arguments\\n** support printing a particular number\\n** support printing a range of numbers by their index\\n** support printing a range of numbers by their values\\n* The resulting list of numbers should be printed on a single line.\\n\\n<br>The program should support the arguments:\\n<pre>\\n what is displayed (on a single line)\\n argument(s) (optional verbiage is encouraged)\\n ╔═══════════════════╦════════════════════════════════════════════════════╗\\n ║ j ║ Jth lucky number ║\\n ║ j , lucky ║ Jth lucky number ║\\n ║ j , evenLucky ║ Jth even lucky number ║\\n ║ ║ ║\\n ║ j k ║ Jth through Kth (inclusive) lucky numbers ║\\n ║ j k lucky ║ Jth through Kth (inclusive) lucky numbers ║\\n ║ j k evenLucky ║ Jth through Kth (inclusive) even lucky numbers ║\\n ║ ║ ║\\n ║ j -k ║ all lucky numbers in the range j ──► |k| ║\\n ║ j -k lucky ║ all lucky numbers in the range j ──► |k| ║\\n ║ j -k evenLucky ║ all even lucky numbers in the range j ──► |k| ║\\n ╚═══════════════════╩════════════════════════════════════════════════════╝\\n where |k| is the absolute value of k\\n</pre>\\nDemonstrate the program by:\\n* showing the first twenty ''lucky'' numbers\\n* showing the first twenty ''even lucky'' numbers\\n* showing all ''lucky'' numbers between 6,000 and 6,100 (inclusive)\\n* showing all ''even lucky'' numbers in the same range as above\\n* showing the 10,000<sup>th</sup> ''lucky'' number (extra credit)\\n* showing the 10,000<sup>th</sup> ''even lucky'' number (extra credit)\\n\\n;See also:\\n* This task is related to the [[Sieve of Eratosthenes]] task.\\n* OEIS Wiki [http://oeis.org/wiki/Lucky_numbers Lucky numbers].\\n* Sequence [https://oeis.org/A000959 A000959 lucky numbers] on The On-Line Encyclopedia of Integer Sequences.\\n* Sequence [https://oeis.org/A045954 A045954 even lucky numbers or ELN] on The On-Line Encyclopedia of Integer Sequences.\\n* Entry [http://mathworld.wolfram.com/LuckyNumber.html lucky numbers] on The Eric Weisstein's World of Mathematics.<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"-V NoValue = 0\\n\\nF initLuckyNumbers(nelems, evenlucky, limit = -1)\\n [Int] result\\n L(i) 0 .< nelems\\n V k = i\\n L(j) (result.len - 1 .< 0).step(-1)\\n k = k * result[j] I/ (result[j] - 1)\\n V n = 2 * k + 1 + evenlucky\\n I limit != -1 & n > limit\\n L.break\\n result.append(n)\\n R result\\n\\nF name(evenlucky)\\n R [‘Lucky’, ‘Even lucky’][evenlucky]\\n\\nF printSingle(j, evenlucky)\\n V luckySeq = initLuckyNumbers(j, evenlucky)\\n print(name(evenlucky)‘ number at index ’j‘ is ’luckySeq[j - 1])\\n\\nF printRange(j, k, evenlucky)\\n V luckySeq = initLuckyNumbers(k, evenlucky)\\n print(name(evenlucky)‘ numbers at indexes ’j‘ to ’k‘ are: ’, end' ‘’)\\n L(idx) j - 1 .< k\\n I idx != j - 1\\n print(‘, ’, end' ‘’)\\n print(luckySeq[idx], end' ‘’)\\n print()\\n\\nF printInRange(j, k, evenlucky)\\n V luckySeq = initLuckyNumbers(k, evenlucky, k)\\n print(name(evenlucky)‘ numbers between ’j‘ to ’k‘ are: ’, end' ‘’)\\n V first = 1B\\n L(val) luckySeq\\n I val > j\\n I first\\n first = 0B\\n E\\n print(‘, ’, end' ‘’)\\n print(val, end' ‘’)\\n print()\\n\\nF process_args(args)\\n assert(args.len C 1..3, ‘Wrong number of arguments’)\\n\\n // First argument: \\\"j\\\" value.\\n V j = Int(args[0])\\n\\n V k = NoValue\\n // Second argument: \\\"k\\\" value or a comma.\\n I args.len > 1\\n I args[1] == ‘,’\\n // Must be followed by the kind of lucky number.\\n assert(args.len == 3, ‘Missing kind argument’)\\n E\\n k = Int(args[1])\\n assert(k != 0, ‘Expected a non null number’)\\n\\n V evenlucky = 0\\n // Third argument: number kind.\\n I args.len == 3\\n V kind = args[2].lowercase()\\n assert(kind C (‘lucky’, ‘evenlucky’), ‘Wrong kind’)\\n I kind == ‘evenlucky’\\n evenlucky = 1\\n\\n I k == NoValue\\n // Print jth value.\\n printSingle(j, evenlucky)\\n E I k > 0\\n // Print jth to kth values.\\n printRange(j, k, evenlucky)\\n E\\n // Print values in range j..(-k).\\n printInRange(j, -k, evenlucky)\\n\\n:start:\\nI 1B\\n L(args) [‘1 20’, ‘1 20 evenlucky’, ‘6000 -6100’, ‘6000 -6100 evenlucky’, ‘10000’, ‘10000 , lucky’, ‘10000 , evenlucky’]\\n print(‘Command line arguments: ’args)\\n process_args(args.split(‘ ’))\\n print()\\nE\\n process_args(:argv[1..])\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"#include <stdbool.h>\\n#include <stdio.h>\\n#include <stdlib.h>\\n\\n#define LUCKY_SIZE 60000\\nint luckyOdd[LUCKY_SIZE];\\nint luckyEven[LUCKY_SIZE];\\n\\nvoid compactLucky(int luckyArray[]) {\\n int i, j, k;\\n\\n for (i = 0; i < LUCKY_SIZE; i++) {\\n if (luckyArray[i] == 0) {\\n j = i;\\n break;\\n }\\n }\\n\\n for (j = i + 1; j < LUCKY_SIZE; j++) {\\n if (luckyArray[j] > 0) {\\n luckyArray[i++] = luckyArray[j];\\n }\\n }\\n\\n for (; i < LUCKY_SIZE; i++) {\\n luckyArray[i] = 0;\\n }\\n}\\n\\nvoid initialize() {\\n int i, j;\\n\\n // unfiltered\\n for (i = 0; i < LUCKY_SIZE; i++) {\\n luckyEven[i] = 2 * i + 2;\\n luckyOdd[i] = 2 * i + 1;\\n }\\n\\n // odd filter\\n for (i = 1; i < LUCKY_SIZE; i++) {\\n if (luckyOdd[i] > 0) {\\n for (j = luckyOdd[i] - 1; j < LUCKY_SIZE; j += luckyOdd[i]) {\\n luckyOdd[j] = 0;\\n }\\n compactLucky(luckyOdd);\\n }\\n }\\n\\n // even filter\\n for (i = 1; i < LUCKY_SIZE; i++) {\\n if (luckyEven[i] > 0) {\\n for (j = luckyEven[i] - 1; j < LUCKY_SIZE; j += luckyEven[i]) {\\n luckyEven[j] = 0;\\n }\\n compactLucky(luckyEven);\\n }\\n }\\n}\\n\\nvoid printBetween(size_t j, size_t k, bool even) {\\n int i;\\n\\n if (even) {\\n if (luckyEven[j] == 0 || luckyEven[k] == 0) {\\n fprintf(stderr, \\\"At least one argument is too large\\\\n\\\");\\n exit(EXIT_FAILURE);\\n }\\n printf(\\\"Lucky even numbers between %d and %d are:\\\", j, k);\\n for (i = 0; luckyEven[i] != 0; i++) {\\n if (luckyEven[i] > k) {\\n break;\\n }\\n if (luckyEven[i] > j) {\\n printf(\\\" %d\\\", luckyEven[i]);\\n }\\n }\\n } else {\\n if (luckyOdd[j] == 0 || luckyOdd[k] == 0) {\\n fprintf(stderr, \\\"At least one argument is too large\\\\n\\\");\\n exit(EXIT_FAILURE);\\n }\\n printf(\\\"Lucky numbers between %d and %d are:\\\", j, k);\\n for (i = 0; luckyOdd[i] != 0; i++) {\\n if (luckyOdd[i] > k) {\\n break;\\n }\\n if (luckyOdd[i] > j) {\\n printf(\\\" %d\\\", luckyOdd[i]);\\n }\\n }\\n }\\n printf(\\\"\\\\n\\\");\\n}\\n\\nvoid printRange(size_t j, size_t k, bool even) {\\n int i;\\n\\n if (even) {\\n if (luckyEven[k] == 0) {\\n fprintf(stderr, \\\"The argument is too large\\\\n\\\");\\n exit(EXIT_FAILURE);\\n }\\n printf(\\\"Lucky even numbers %d to %d are:\\\", j, k);\\n for (i = j - 1; i < k; i++) {\\n printf(\\\" %d\\\", luckyEven[i]);\\n }\\n } else {\\n if (luckyOdd[k] == 0) {\\n fprintf(stderr, \\\"The argument is too large\\\\n\\\");\\n exit(EXIT_FAILURE);\\n }\\n printf(\\\"Lucky numbers %d to %d are:\\\", j, k);\\n for (i = j - 1; i < k; i++) {\\n printf(\\\" %d\\\", luckyOdd[i]);\\n }\\n }\\n printf(\\\"\\\\n\\\");\\n}\\n\\nvoid printSingle(size_t j, bool even) {\\n if (even) {\\n if (luckyEven[j] == 0) {\\n fprintf(stderr, \\\"The argument is too large\\\\n\\\");\\n exit(EXIT_FAILURE);\\n }\\n printf(\\\"Lucky even number %d=%d\\\\n\\\", j, luckyEven[j - 1]);\\n } else {\\n if (luckyOdd[j] == 0) {\\n fprintf(stderr, \\\"The argument is too large\\\\n\\\");\\n exit(EXIT_FAILURE);\\n }\\n printf(\\\"Lucky number %d=%d\\\\n\\\", j, luckyOdd[j - 1]);\\n }\\n}\\n\\nvoid help() {\\n printf(\\\"./lucky j [k] [--lucky|--evenLucky]\\\\n\\\");\\n printf(\\\"\\\\n\\\");\\n printf(\\\" argument(s) | what is displayed\\\\n\\\");\\n printf(\\\"==============================================\\\\n\\\");\\n printf(\\\"-j=m | mth lucky number\\\\n\\\");\\n printf(\\\"-j=m --lucky | mth lucky number\\\\n\\\");\\n printf(\\\"-j=m --evenLucky | mth even lucky number\\\\n\\\");\\n printf(\\\"-j=m -k=n | mth through nth (inclusive) lucky numbers\\\\n\\\");\\n printf(\\\"-j=m -k=n --lucky | mth through nth (inclusive) lucky numbers\\\\n\\\");\\n printf(\\\"-j=m -k=n --evenLucky | mth through nth (inclusive) even lucky numbers\\\\n\\\");\\n printf(\\\"-j=m -k=-n | all lucky numbers in the range [m, n]\\\\n\\\");\\n printf(\\\"-j=m -k=-n --lucky | all lucky numbers in the range [m, n]\\\\n\\\");\\n printf(\\\"-j=m -k=-n --evenLucky | all even lucky numbers in the range [m, n]\\\\n\\\");\\n}\\n\\nvoid process(int argc, char *argv[]) {\\n bool evenLucky = false;\\n int j = 0;\\n int k = 0;\\n\\n bool good = false;\\n int i;\\n\\n for (i = 1; i < argc; ++i) {\\n if ('-' == argv[i][0]) {\\n if ('-' == argv[i][1]) {\\n // long args\\n if (0 == strcmp(\\\"--lucky\\\", argv[i])) {\\n evenLucky = false;\\n } else if (0 == strcmp(\\\"--evenLucky\\\", argv[i])) {\\n evenLucky = true;\\n } else {\\n fprintf(stderr, \\\"Unknown long argument: [%s]\\\\n\\\", argv[i]);\\n exit(EXIT_FAILURE);\\n }\\n } else {\\n // short args\\n if ('j' == argv[i][1] && '=' == argv[i][2] && argv[i][3] != 0) {\\n good = true;\\n j = atoi(&argv[i][3]);\\n } else if ('k' == argv[i][1] && '=' == argv[i][2]) {\\n k = atoi(&argv[i][3]);\\n } else {\\n fprintf(stderr, \\\"Unknown short argument: [%s]\\\\n\\\", argv[i]);\\n exit(EXIT_FAILURE);\\n }\\n }\\n } else {\\n fprintf(stderr, \\\"Unknown argument: [%s]\\\\n\\\", argv[i]);\\n exit(EXIT_FAILURE);\\n }\\n }\\n\\n if (!good) {\\n help();\\n exit(EXIT_FAILURE);\\n }\\n\\n if (k > 0) {\\n printRange(j, k, evenLucky);\\n } else if (k < 0) {\\n printBetween(j, -k, evenLucky);\\n } else {\\n printSingle(j, evenLucky);\\n }\\n}\\n\\nvoid test() {\\n printRange(1, 20, false);\\n printRange(1, 20, true);\\n\\n printBetween(6000, 6100, false);\\n printBetween(6000, 6100, true);\\n\\n printSingle(10000, false);\\n printSingle(10000, true);\\n}\\n\\nint main(int argc, char *argv[]) {\\n initialize();\\n\\n //test();\\n\\n if (argc < 2) {\\n help();\\n return 1;\\n }\\n process(argc, argv);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <iostream>\\n#include <iterator>\\n#include <vector>\\n\\nconst int luckySize = 60000;\\nstd::vector<int> luckyEven(luckySize);\\nstd::vector<int> luckyOdd(luckySize);\\n\\nvoid init() {\\n for (int i = 0; i < luckySize; ++i) {\\n luckyEven[i] = i * 2 + 2;\\n luckyOdd[i] = i * 2 + 1;\\n }\\n}\\n\\nvoid filterLuckyEven() {\\n for (size_t n = 2; n < luckyEven.size(); ++n) {\\n int m = luckyEven[n - 1];\\n int end = (luckyEven.size() / m) * m - 1;\\n for (int j = end; j >= m - 1; j -= m) {\\n std::copy(luckyEven.begin() + j + 1, luckyEven.end(), luckyEven.begin() + j);\\n luckyEven.pop_back();\\n }\\n }\\n}\\n\\nvoid filterLuckyOdd() {\\n for (size_t n = 2; n < luckyOdd.size(); ++n) {\\n int m = luckyOdd[n - 1];\\n int end = (luckyOdd.size() / m) * m - 1;\\n for (int j = end; j >= m - 1; j -= m) {\\n std::copy(luckyOdd.begin() + j + 1, luckyOdd.end(), luckyOdd.begin() + j);\\n luckyOdd.pop_back();\\n }\\n }\\n}\\n\\nvoid printBetween(size_t j, size_t k, bool even) {\\n std::ostream_iterator<int> out_it{ std::cout, \\\", \\\" };\\n\\n if (even) {\\n size_t max = luckyEven.back();\\n if (j > max || k > max) {\\n std::cerr << \\\"At least one are is too big\\\\n\\\";\\n exit(EXIT_FAILURE);\\n }\\n\\n std::cout << \\\"Lucky even numbers between \\\" << j << \\\" and \\\" << k << \\\" are: \\\";\\n std::copy_if(luckyEven.begin(), luckyEven.end(), out_it, [j, k](size_t n) {\\n return j <= n && n <= k;\\n });\\n } else {\\n size_t max = luckyOdd.back();\\n if (j > max || k > max) {\\n std::cerr << \\\"At least one are is too big\\\\n\\\";\\n exit(EXIT_FAILURE);\\n }\\n\\n std::cout << \\\"Lucky numbers between \\\" << j << \\\" and \\\" << k << \\\" are: \\\";\\n std::copy_if(luckyOdd.begin(), luckyOdd.end(), out_it, [j, k](size_t n) {\\n return j <= n && n <= k;\\n });\\n }\\n std::cout << '\\\\n';\\n}\\n\\nvoid printRange(size_t j, size_t k, bool even) {\\n std::ostream_iterator<int> out_it{ std::cout, \\\", \\\" };\\n if (even) {\\n if (k >= luckyEven.size()) {\\n std::cerr << \\\"The argument is too large\\\\n\\\";\\n exit(EXIT_FAILURE);\\n }\\n std::cout << \\\"Lucky even numbers \\\" << j << \\\" to \\\" << k << \\\" are: \\\";\\n std::copy(luckyEven.begin() + j - 1, luckyEven.begin() + k, out_it);\\n } else {\\n if (k >= luckyOdd.size()) {\\n std::cerr << \\\"The argument is too large\\\\n\\\";\\n exit(EXIT_FAILURE);\\n }\\n std::cout << \\\"Lucky numbers \\\" << j << \\\" to \\\" << k << \\\" are: \\\";\\n std::copy(luckyOdd.begin() + j - 1, luckyOdd.begin() + k, out_it);\\n }\\n}\\n\\nvoid printSingle(size_t j, bool even) {\\n if (even) {\\n if (j >= luckyEven.size()) {\\n std::cerr << \\\"The argument is too large\\\\n\\\";\\n exit(EXIT_FAILURE);\\n }\\n std::cout << \\\"Lucky even number \\\" << j << \\\"=\\\" << luckyEven[j - 1] << '\\\\n';\\n } else {\\n if (j >= luckyOdd.size()) {\\n std::cerr << \\\"The argument is too large\\\\n\\\";\\n exit(EXIT_FAILURE);\\n }\\n std::cout << \\\"Lucky number \\\" << j << \\\"=\\\" << luckyOdd[j - 1] << '\\\\n';\\n }\\n}\\n\\nvoid help() {\\n std::cout << \\\"./lucky j [k] [--lucky|--evenLucky]\\\\n\\\";\\n std::cout << \\\"\\\\n\\\";\\n std::cout << \\\" argument(s) | what is displayed\\\\n\\\";\\n std::cout << \\\"==============================================\\\\n\\\";\\n std::cout << \\\"-j=m | mth lucky number\\\\n\\\";\\n std::cout << \\\"-j=m --lucky | mth lucky number\\\\n\\\";\\n std::cout << \\\"-j=m --evenLucky | mth even lucky number\\\\n\\\";\\n std::cout << \\\"-j=m -k=n | mth through nth (inclusive) lucky numbers\\\\n\\\";\\n std::cout << \\\"-j=m -k=n --lucky | mth through nth (inclusive) lucky numbers\\\\n\\\";\\n std::cout << \\\"-j=m -k=n --evenLucky | mth through nth (inclusive) even lucky numbers\\\\n\\\";\\n std::cout << \\\"-j=m -k=-n | all lucky numbers in the range [m, n]\\\\n\\\";\\n std::cout << \\\"-j=m -k=-n --lucky | all lucky numbers in the range [m, n]\\\\n\\\";\\n std::cout << \\\"-j=m -k=-n --evenLucky | all even lucky numbers in the range [m, n]\\\\n\\\";\\n}\\n\\nint main(int argc, char **argv) {\\n bool evenLucky = false;\\n int j = 0;\\n int k = 0;\\n\\n // skip arg 0, because that is just the executable name\\n if (argc < 2) {\\n help();\\n exit(EXIT_FAILURE);\\n }\\n\\n bool good = false;\\n for (int i = 1; i < argc; ++i) {\\n if ('-' == argv[i][0]) {\\n if ('-' == argv[i][1]) {\\n // long args\\n if (0 == strcmp(\\\"--lucky\\\", argv[i])) {\\n evenLucky = false;\\n } else if (0 == strcmp(\\\"--evenLucky\\\", argv[i])) {\\n evenLucky = true;\\n } else {\\n std::cerr << \\\"Unknown long argument: [\\\" << argv[i] << \\\"]\\\\n\\\";\\n exit(EXIT_FAILURE);\\n }\\n } else {\\n // short args\\n if ('j' == argv[i][1] && '=' == argv[i][2] && argv[i][3] != 0) {\\n good = true;\\n j = atoi(&argv[i][3]);\\n } else if ('k' == argv[i][1] && '=' == argv[i][2]) {\\n k = atoi(&argv[i][3]);\\n } else {\\n std::cerr << \\\"Unknown short argument: \\\" << argv[i] << '\\\\n';\\n exit(EXIT_FAILURE);\\n }\\n }\\n } else {\\n std::cerr << \\\"Unknown argument: \\\" << argv[i] << '\\\\n';\\n exit(EXIT_FAILURE);\\n }\\n }\\n if (!good) {\\n help();\\n exit(EXIT_FAILURE);\\n }\\n\\n init();\\n filterLuckyEven();\\n filterLuckyOdd();\\n if (k > 0) {\\n printRange(j, k, evenLucky);\\n } else if (k < 0) {\\n printBetween(j, -k, evenLucky);\\n } else {\\n printSingle(j, evenLucky);\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"import std.algorithm;\\nimport std.concurrency;\\nimport std.conv;\\nimport std.getopt;\\nimport std.range;\\nimport std.stdio;\\n\\nauto lucky(bool even, int nmax=200_000) {\\n import std.container.array;\\n\\n int start = even ? 2 : 1;\\n\\n return new Generator!int({\\n auto ln = make!(Array!int)(iota(start,nmax,2));\\n\\n // yield the first number\\n yield(ln[0]);\\n\\n int n=1;\\n for(; n<ln.length/2+1; n++) {\\n yield(ln[n]);\\n\\n int step = ln[n]-1;\\n\\n // remove the non-lucky numbers related to the current lucky number\\n for (int i=step; i<ln.length; i+=step) {\\n ln.linearRemove(ln[].drop(i).take(1));\\n }\\n }\\n\\n // yield all remaining values\\n foreach(val; ln[n..$]) {\\n yield(val);\\n }\\n });\\n}\\n\\nvoid help(Option[] opt) {\\n defaultGetoptPrinter(\\\"./lucky j [k] [--lucky|--evenLucky]\\\", opt);\\n\\n writeln;\\n writeln(\\\" argument(s) | what is displayed\\\");\\n writeln(\\\"==============================================\\\");\\n writeln(\\\"-j=m | mth lucky number\\\");\\n writeln(\\\"-j=m --lucky | mth lucky number\\\");\\n writeln(\\\"-j=m --evenLucky | mth even lucky number\\\");\\n writeln(\\\"-j=m -k=n | mth through nth (inclusive) lucky numbers\\\");\\n writeln(\\\"-j=m -k=n --lucky | mth through nth (inclusive) lucky numbers\\\");\\n writeln(\\\"-j=m -k=n --evenLucky | mth through nth (inclusive) even lucky numbers\\\");\\n writeln(\\\"-j=m -k=-n | all lucky numbers in the range [m, n]\\\");\\n writeln(\\\"-j=m -k=-n --lucky | all lucky numbers in the range [m, n]\\\");\\n writeln(\\\"-j=m -k=-n --evenLucky | all even lucky numbers in the range [m, n]\\\");\\n}\\n\\nvoid main(string[] args) {\\n int j;\\n int k;\\n bool evenLucky = false;\\n\\n void luckyOpt() {\\n evenLucky = false;\\n }\\n auto helpInformation = getopt(\\n args,\\n std.getopt.config.passThrough,\\n std.getopt.config.required,\\n \\\"j\\\", \\\"The starting point to generate lucky numbers\\\", &j,\\n \\\"k\\\", \\\"The ending point for generating lucky numbers\\\", &k,\\n \\\"lucky\\\", \\\"Specify to generate a list of lucky numbers\\\", &luckyOpt,\\n \\\"evenLucky\\\", \\\"Specify to generate a list of even lucky numbers\\\", &evenLucky\\n );\\n\\n if (helpInformation.helpWanted) {\\n help(helpInformation.options);\\n return;\\n }\\n\\n if (k>0) {\\n lucky(evenLucky).drop(j-1).take(k-j+1).writeln;\\n } else if (k<0) {\\n auto f = (int a) => j<=a && a<=-k;\\n lucky(evenLucky, -k).filter!f.writeln;\\n } else {\\n lucky(evenLucky).drop(j-1).take(1).writeln;\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"// Odd and Even Lucky Numbers. Nigel Galloway: October 3rd., 2020\\nlet rec fN i g e l=seq{yield! i|>Seq.skip g|>Seq.take(e-g-1)\\n let n=Seq.chunkBySize e i|>Seq.collect(Seq.take(e-1)) in yield! fN n (e-1) (Seq.item l n) (l+1)}\\nlet oLuck,eLuck=let rec fG g=seq{yield g; yield! fG(g+2)} in (fN(fG 1) 0 3 2,fN(fG 2) 0 4 2)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"log\\\"\\n \\\"os\\\"\\n \\\"strconv\\\"\\n \\\"strings\\\"\\n)\\n\\nconst luckySize = 60000\\n\\nvar luckyOdd = make([]int, luckySize)\\nvar luckyEven = make([]int, luckySize)\\n\\nfunc init() {\\n for i := 0; i < luckySize; i++ {\\n luckyOdd[i] = i*2 + 1\\n luckyEven[i] = i*2 + 2\\n }\\n}\\n\\nfunc filterLuckyOdd() {\\n for n := 2; n < len(luckyOdd); n++ {\\n m := luckyOdd[n-1]\\n end := (len(luckyOdd)/m)*m - 1\\n for j := end; j >= m-1; j -= m {\\n copy(luckyOdd[j:], luckyOdd[j+1:])\\n luckyOdd = luckyOdd[:len(luckyOdd)-1]\\n }\\n }\\n}\\n\\nfunc filterLuckyEven() {\\n for n := 2; n < len(luckyEven); n++ {\\n m := luckyEven[n-1]\\n end := (len(luckyEven)/m)*m - 1\\n for j := end; j >= m-1; j -= m {\\n copy(luckyEven[j:], luckyEven[j+1:])\\n luckyEven = luckyEven[:len(luckyEven)-1]\\n }\\n }\\n}\\n\\nfunc printSingle(j int, odd bool) error {\\n if odd {\\n if j >= len(luckyOdd) {\\n return fmt.Errorf(\\\"the argument, %d, is too big\\\", j)\\n }\\n fmt.Println(\\\"Lucky number\\\", j, \\\"=\\\", luckyOdd[j-1])\\n } else {\\n if j >= len(luckyEven) {\\n return fmt.Errorf(\\\"the argument, %d, is too big\\\", j)\\n }\\n fmt.Println(\\\"Lucky even number\\\", j, \\\"=\\\", luckyEven[j-1])\\n }\\n return nil\\n}\\n\\nfunc printRange(j, k int, odd bool) error {\\n if odd {\\n if k >= len(luckyOdd) {\\n return fmt.Errorf(\\\"the argument, %d, is too big\\\", k)\\n }\\n fmt.Println(\\\"Lucky numbers\\\", j, \\\"to\\\", k, \\\"are:\\\")\\n fmt.Println(luckyOdd[j-1 : k])\\n } else {\\n if k >= len(luckyEven) {\\n return fmt.Errorf(\\\"the argument, %d, is too big\\\", k)\\n }\\n fmt.Println(\\\"Lucky even numbers\\\", j, \\\"to\\\", k, \\\"are:\\\")\\n fmt.Println(luckyEven[j-1 : k])\\n }\\n return nil\\n}\\n\\nfunc printBetween(j, k int, odd bool) error {\\n var r []int\\n if odd {\\n max := luckyOdd[len(luckyOdd)-1]\\n if j > max || k > max {\\n return fmt.Errorf(\\\"at least one argument, %d or %d, is too big\\\", j, k)\\n }\\n for _, num := range luckyOdd {\\n if num < j {\\n continue\\n }\\n if num > k {\\n break\\n }\\n r = append(r, num)\\n }\\n fmt.Println(\\\"Lucky numbers between\\\", j, \\\"and\\\", k, \\\"are:\\\")\\n fmt.Println(r)\\n } else {\\n max := luckyEven[len(luckyEven)-1]\\n if j > max || k > max {\\n return fmt.Errorf(\\\"at least one argument, %d or %d, is too big\\\", j, k)\\n }\\n for _, num := range luckyEven {\\n if num < j {\\n continue\\n }\\n if num > k {\\n break\\n }\\n r = append(r, num)\\n }\\n fmt.Println(\\\"Lucky even numbers between\\\", j, \\\"and\\\", k, \\\"are:\\\")\\n fmt.Println(r)\\n }\\n return nil\\n}\\n\\nfunc main() {\\n nargs := len(os.Args)\\n if nargs < 2 || nargs > 4 {\\n log.Fatal(\\\"there must be between 1 and 3 command line arguments\\\")\\n }\\n filterLuckyOdd()\\n filterLuckyEven()\\n j, err := strconv.Atoi(os.Args[1])\\n if err != nil || j < 1 {\\n log.Fatalf(\\\"first argument, %s, must be a positive integer\\\", os.Args[1])\\n }\\n if nargs == 2 {\\n if err := printSingle(j, true); err != nil {\\n log.Fatal(err)\\n }\\n return\\n }\\n\\n if nargs == 3 {\\n k, err := strconv.Atoi(os.Args[2])\\n if err != nil {\\n log.Fatalf(\\\"second argument, %s, must be an integer\\\", os.Args[2])\\n }\\n if k >= 0 {\\n if j > k {\\n log.Fatalf(\\\"second argument, %d, can't be less than first, %d\\\", k, j)\\n }\\n if err := printRange(j, k, true); err != nil {\\n log.Fatal(err)\\n }\\n } else {\\n l := -k\\n if j > l {\\n log.Fatalf(\\\"second argument, %d, can't be less in absolute value than first, %d\\\", k, j)\\n }\\n if err := printBetween(j, l, true); err != nil {\\n log.Fatal(err)\\n }\\n }\\n return\\n }\\n\\n var odd bool\\n switch lucky := strings.ToLower(os.Args[3]); lucky {\\n case \\\"lucky\\\":\\n odd = true\\n case \\\"evenlucky\\\":\\n odd = false\\n default:\\n log.Fatalf(\\\"third argument, %s, is invalid\\\", os.Args[3])\\n }\\n if os.Args[2] == \\\",\\\" {\\n if err := printSingle(j, odd); err != nil {\\n log.Fatal(err)\\n }\\n return\\n }\\n\\n k, err := strconv.Atoi(os.Args[2])\\n if err != nil {\\n log.Fatal(\\\"second argument must be an integer or a comma\\\")\\n }\\n if k >= 0 {\\n if j > k {\\n log.Fatalf(\\\"second argument, %d, can't be less than first, %d\\\", k, j)\\n }\\n if err := printRange(j, k, odd); err != nil {\\n log.Fatal(err)\\n }\\n } else {\\n l := -k\\n if j > l {\\n log.Fatalf(\\\"second argument, %d, can't be less in absolute value than first, %d\\\", k, j)\\n }\\n if err := printBetween(j, l, odd); err != nil {\\n log.Fatal(err)\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import System.Environment\\nimport Text.Regex.Posix\\n\\ndata Lucky = Lucky | EvenLucky\\n\\nhelpMessage :: IO ()\\nhelpMessage = do\\n putStrLn \\\" what is displayed (on a single line)\\\"\\n putStrLn \\\" argument(s) (optional verbiage is encouraged)\\\"\\n putStrLn \\\"======================|===================================================\\\"\\n putStrLn \\\" j | Jth lucky number \\\"\\n putStrLn \\\" j , lucky | Jth lucky number \\\"\\n putStrLn \\\" j , evenLucky | Jth even lucky number \\\"\\n putStrLn \\\" \\\"\\n putStrLn \\\" j k | Jth through Kth (inclusive) lucky numbers \\\"\\n putStrLn \\\" j k lucky | Jth through Kth (inclusive) lucky numbers \\\"\\n putStrLn \\\" j k evenlucky | Jth through Kth (inclusive) even lucky numbers \\\"\\n putStrLn \\\" \\\"\\n putStrLn \\\" j -k | all lucky numbers in the range j -> |k| \\\"\\n putStrLn \\\" j -k lucky | all lucky numbers in the range j -> |k| \\\"\\n putStrLn \\\" j -k evenlucky | all even lucky numbers in the range j -> |k| \\\"\\n putStrLn \\\"======================|===================================================\\\"\\n\\noddNumbers :: [Int]\\noddNumbers = filter odd [1..]\\n\\nevenNumbers :: [Int]\\nevenNumbers = filter even [1..]\\n\\nluckyNumbers :: [Int] -> [Int]\\nluckyNumbers xs =\\n let i = 3 in\\n sieve i xs\\n where\\n sieve i (ln:s:xs) =\\n ln : sieve (i + 1) (s : [x | (n, x) <- zip [i..] xs, rem n s /= 0])\\n\\nnth :: Int -> Lucky -> Int\\nnth j Lucky = luckyNumbers oddNumbers !! (j-1)\\nnth j EvenLucky = luckyNumbers evenNumbers !! (j-1)\\n\\nrange :: Int -> Int -> Lucky -> [Int]\\nrange x x2 Lucky = drop (x-1) (take x2 (luckyNumbers oddNumbers))\\nrange x x2 EvenLucky = drop (x-1) (take x2 (luckyNumbers evenNumbers))\\n\\ninterval :: Int -> Int -> Lucky -> [Int]\\ninterval x x2 Lucky = dropWhile (<x) (takeWhile (<=x2) (luckyNumbers oddNumbers))\\ninterval x x2 EvenLucky = dropWhile (<x) (takeWhile (<=x2) (luckyNumbers evenNumbers))\\n\\nlucky :: [String] -> Lucky\\nlucky xs =\\n if \\\"evenLucky\\\" `elem` xs\\n then EvenLucky\\n else Lucky\\n\\nreadn :: String -> Int\\nreadn s = read s :: Int\\n\\nisInt :: String -> Bool\\nisInt s = not (null (s =~ \\\"-?[0-9]{0,10}\\\" :: String))\\n\\nmain :: IO ()\\nmain = do\\n args <- getArgs\\n if head args == \\\"--help\\\" || null args\\n then\\n helpMessage\\n else\\n let l = lucky args in\\n case map readn (filter isInt args) of\\n [] -> do\\n putStrLn \\\"Invalid input, missing arguments\\\"\\n putStrLn \\\"Type --help\\\"\\n [x] -> print (nth x l)\\n [x, x2] -> if x2 > 0\\n then print (range x x2 l)\\n else print (interval x (-x2) l)\\n _ -> do\\n putStrLn \\\"Invalid input, wrong number of arguments\\\"\\n putStrLn \\\"Type --help\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"luckySeq=:3 :0\\n 1 luckySeq y\\n:\\n len=.0\\n nth=.0\\n seq=.x+2*i.4*y\\n while. len~:#seq do.\\n len=. #seq\\n nth=. nth+1\\n seq=. nth exclude seq\\n end.\\n)\\n\\nexclude=: ] #~ 1 - #@] $ -@{ {. 1:\\n\\nlucky=:''\\nevenLucky=:0\\nprogram=:3 :0\\n range=: |y-.0\\n seq=. (1+0 e.y) luckySeq >./range\\n if. 0><./y do.\\n (#~ e.&(thru/range)) seq\\n else.\\n (<:thru/range) { seq\\n end.\\n)\\n\\nthru=: <./ + i.@(+*)@-~\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" program 1 20\\n1 3 7 9 13 15 21 25 31 33 37 43 49 51 63 67 69 73 75 79\\n program 1 20,evenLucky\\n2 4 6 10 12 18 20 22 26 34 36 42 44 50 52 54 58 68 70 76\\n program 6000,-6100\\n6009 6019 6031 6049 6055 6061 6079 6093\\n program 6000,-6100,evenLucky\\n6018 6020 6022 6026 6036 6038 6050 6058 6074 6090 6092\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.Collections;\\nimport java.util.List;\\n\\npublic class LuckyNumbers {\\n\\n private static int MAX = 200000;\\n private static List<Integer> luckyEven = luckyNumbers(MAX, true);\\n private static List<Integer> luckyOdd = luckyNumbers(MAX, false);\\n\\n public static void main(String[] args) {\\n // Case 1 and 2\\n if ( args.length == 1 || ( args.length == 2 && args[1].compareTo(\\\"lucky\\\") == 0 ) ) {\\n int n = Integer.parseInt(args[0]);\\n System.out.printf(\\\"LuckyNumber(%d) = %d%n\\\", n, luckyOdd.get(n-1));\\n }\\n // Case 3\\n else if ( args.length == 2 && args[1].compareTo(\\\"evenLucky\\\") == 0 ) {\\n int n = Integer.parseInt(args[0]);\\n System.out.printf(\\\"EvenLuckyNumber(%d) = %d%n\\\", n, luckyEven.get(n-1));\\n }\\n // Case 4 through 9\\n else if ( args.length == 2 || args.length == 3 ) {\\n int j = Integer.parseInt(args[0]);\\n int k = Integer.parseInt(args[1]);\\n // Case 4 and 5\\n if ( ( args.length == 2 && k > 0 ) || (args.length == 3 && k > 0 && args[2].compareTo(\\\"lucky\\\") == 0 ) ) {\\n System.out.printf(\\\"LuckyNumber(%d) through LuckyNumber(%d) = %s%n\\\", j, k, luckyOdd.subList(j-1, k));\\n }\\n // Case 6\\n else if ( args.length == 3 && k > 0 && args[2].compareTo(\\\"evenLucky\\\") == 0 ) {\\n System.out.printf(\\\"EvenLuckyNumber(%d) through EvenLuckyNumber(%d) = %s%n\\\", j, k, luckyEven.subList(j-1, k));\\n }\\n // Case 7 and 8\\n else if ( ( args.length == 2 && k < 0 ) || (args.length == 3 && k < 0 && args[2].compareTo(\\\"lucky\\\") == 0 ) ) {\\n int n = Collections.binarySearch(luckyOdd, j);\\n int m = Collections.binarySearch(luckyOdd, -k);\\n System.out.printf(\\\"Lucky Numbers in the range %d to %d inclusive = %s%n\\\", j, -k, luckyOdd.subList(n < 0 ? -n-1 : n, m < 0 ? -m-1 : m+1));\\n }\\n // Case 9\\n else if ( args.length == 3 && k < 0 && args[2].compareTo(\\\"evenLucky\\\") == 0 ) {\\n int n = Collections.binarySearch(luckyEven, j);\\n int m = Collections.binarySearch(luckyEven, -k);\\n System.out.printf(\\\"Even Lucky Numbers in the range %d to %d inclusive = %s%n\\\", j, -k, luckyEven.subList(n < 0 ? -n-1 : n, m < 0 ? -m-1 : m+1));\\n }\\n }\\n }\\n\\n private static List<Integer> luckyNumbers(int max, boolean even) {\\n List<Integer> luckyList = new ArrayList<>();\\n for ( int i = even ? 2 : 1 ; i <= max ; i += 2 ) {\\n luckyList.add(i);\\n }\\n int start = 1;\\n boolean removed = true;\\n while ( removed ) {\\n removed = false;\\n int increment = luckyList.get(start);\\n List<Integer> remove = new ArrayList<>();\\n for ( int i = increment-1 ; i < luckyList.size() ; i += increment ) {\\n remove.add(0, i);\\n removed = true;\\n }\\n for ( int i : remove ) {\\n luckyList.remove(i);\\n }\\n start++;\\n }\\n return luckyList;\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function luckyNumbers(opts={}) {\\n /**************************************************************************\\\\\\n | OPTIONS |\\n |**************************************************************************|\\n | even ...... boolean ............. return even/uneven numbers |\\n | (default: false) |\\n | |\\n | nth ....... number ............... return nth number |\\n | |\\n | through ... number ............... return numbers from #1 to number |\\n | OR array[from, to] ... return numbers on index |\\n | from array[from] to array[to] |\\n | |\\n | range ..... array[from, to] ...... return numbers between from and to |\\n \\\\**************************************************************************/\\n\\n opts.even = opts.even || false;\\n if (typeof opts.through == 'number') opts.through = [0, opts.through];\\n let out = [],\\n x = opts.even ? 2 : 1,\\n max = opts.range ? opts.range[1] * 3\\n : opts.through ? opts.through[1] * 12\\n : opts.nth ? opts.nth * 15\\n : 2000;\\n\\n for (x; x <= max; x = x+2) out.push(x); // fill\\n for (x = 1; x < Math.floor(out.length / 2); x++) { // sieve\\n let i = out.length;\\n while (i--)\\n (i+1) % out[x] == 0 && out.splice(i, 1);\\n }\\n\\n if (opts.nth) return out[opts.nth-1];\\n if (opts.through) return out.slice(opts.through[0], opts.through[1]);\\n if (opts.range) return out.filter(function(val) {\\n return val >= opts.range[0] && val <= opts.range[1];\\n });\\n return out;\\n}\\n\\n/* TESTING */\\n// blank\\nconsole.log( luckyNumbers() );\\n// showing the first twenty lucky numbers\\nconsole.log( luckyNumbers({through: 20}) );\\n// showing the first twenty even lucky numbers\\nconsole.log( luckyNumbers({even: true, through: 20}) );\\n// showing all lucky numbers between 6,000 and 6,100 (inclusive)\\nconsole.log( luckyNumbers({range: [6000, 6100]}) );\\n// showing all even lucky numbers in the same range as above\\nconsole.log( luckyNumbers({even: true, range: [6000, 6100]}) );\\n// showing the 10,000th lucky number (extra credit)\\nconsole.log( luckyNumbers({nth: 10000}) );\\n// showing the 10,000th even lucky number (extra credit)\\nconsole.log( luckyNumbers({even: true, nth: 10000}) );\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(function() {\\n document.write(`\\n <table>\\n <tr><th>argument(s)<br>space separated</th><th>gives</th></tr>\\n <tr><td>$j</td><td><i>j</i><sup>th</sup> lucky number</tr>\\n <tr><td>$j lucky</td><td><i>j</i><sup>th</sup> lucky number</tr>\\n <tr><td>$j evenLucky</td><td><i>j</i><sup>th</sup> even lucky number</tr>\\n <tr><td> </td><td> </td></tr>\\n <tr><td>$j $k</td><td><i>J</i><sup>th</sup> through <i>k</i><sup>th</sup> (inclusive) lucky numbers</td></tr>\\n <tr><td>$j $k lucky</td><td><i>J</i><sup>th</sup> through <i>k</i><sup>th</sup> (inclusive) lucky numbers</td></tr>\\n <tr><td>$j $k evenLucky</td><td><i>J</i><sup>th</sup> through <i>k</i><sup>th</sup> (inclusive) even lucky numbers</td></tr>\\n <tr><td> </td><td> </td></tr>\\n <tr><td>-$j</td><td>all lucky numbers in the range 1 .. |<i>j</i>|*</tr>\\n <tr><td>$j -$k</td><td>all lucky numbers in the range <i>j</i> .. |<i>k</i>|*</tr>\\n <tr><td>$j -$k lucky</td><td>all lucky numbers in the range <i>j</i> .. |<i>k</i>|*</tr>\\n <tr><td>$j -$k evenLucky</td><td>all even lucky numbers in the range <i>j</i> .. |<i>k</i>|*</tr>\\n </table>\\n <p>* where |<i>x</i>| is the absolute value of <i>x</i></p>\\n `);\\n let args = prompt('Enter a luckyNumbers argument string:').split(' '),\\n numbers = [],\\n strings = [],\\n obj = {}, // object to pass to our luckyNumbers function\\n msg = '';\\n for (let x = 0; x < args.length; x++) {\\n if (isNaN(parseInt(args[x]))) strings.push(args[x].toUpperCase());\\n else numbers.push(parseInt(args[x]));\\n }\\n // check strings\\n switch (true) {\\n case (strings.length > 1):\\n msg += 'Too many arguments.';\\n break;\\n case (strings.length == 0): break;\\n case (strings[0] != 'LUCKY' && strings[0] != 'EVENLUCKY'):\\n msg += `Unknown argument: ${strings[0]}.`;\\n break;\\n case (strings[0] == 'EVENLUCKY'): obj.even = true;\\n }\\n // check numbers\\n switch (true) {\\n case (numbers.length == 0):\\n msg += 'Missing number argument.';\\n break;\\n case (numbers.length > 2):\\n msg += 'Too many number arguments.';\\n break;\\n case (numbers.length == 1):\\n if (numbers[0] > 0) obj.nth = numbers[0];\\n else obj.through = Math.abs(numbers[0]);\\n break;\\n case (numbers.length == 2):\\n // both negative\\n if (numbers[0] < 0 && numbers[1] < 0) {\\n msg += 'Missing positive argument';\\n break;\\n }\\n // negative + positive\\n numbers.sort();\\n if (numbers[0] < 0 && numbers[1] > 0) {\\n obj.range = [numbers[1], Math.abs(numbers[0])];\\n break;\\n }\\n // both positive\\n if (numbers[0] > 0 && numbers[1] > 0) {\\n obj.through = [numbers[0]-1, numbers[1]];\\n }\\n }\\n if (msg.length > 0)\\n document.write(`<p>${msg}<br>Reload to try again</p>`);\\n else {\\n let res;\\n try { res = luckyNumbers(obj); }\\n catch (err) {\\n document.write(`<p>${err}<br>Reload to try again</p>`);\\n }\\n finally {\\n if (typeof res == 'object' ) res = res.join(', ');\\n document.write(`\\n <p>\\n <b>Input: </b>${args.join(' ')}<br>\\n <b>Result: </b>${res}\\n </p>\\n <p>Reload to continue</p>\\n `)\\n }\\n }\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Preliminaries:\\n# This def can be omitted if using jq or gojq:\\ndef range($a;$b;$c): $a | while(. < $b; .+$c);\\n\\n# jaq does not support string interpolation so, for brevity:\\ndef tos: tostring;\\n\\n# The following def should be modified if an alternative mechanism for\\n# reading the parameter arguments is used:\\ndef args: {args: [splits(\\\" *\\\")]};\\n\\ndef argsSize: .args|length;\\n\\n# Input: an array\\n# Emit the items in the array until the condition on the items is met.\\n# The item for which the condition is first met is NOT emitted.\\ndef emit_until(cond):\\n length as $length\\n | if $length == 0 or (.[0]|cond) then empty\\n else . as $in\\n | {i:0, ok: true}\\n | while(.ok;\\n .i+=1\\n | .ok = .i < $length and ($in[.i] | cond | not) )\\n | $in[.i]\\n end;\\n\\n# input: a number or a string\\n# If the input is or can be converted to a number using tonumber, then return the number\\n# else return false.\\ndef isnumber:\\n if type == \\\"number\\\" then .\\n elif type == \\\"string\\\" then tonumber? // false\\n else false\\n end;\\n\\n# input: anything\\n# output: a boolean\\ndef isinteger:\\n if type == \\\"number\\\" then . == floor\\n else isnumber as $x\\n | if $x then $x | (. == floor) else false end\\n end;\\n\\n# mark and collapse\\ndef removeEvery($n):\\n reduce range($n-1; length; $n) as $i (.; .[$i]=null)\\n | map(select(.));\\n\\n# Input: {lucky}\\ndef filterLucky:\\n (.lucky|length) as $length\\n | .n = 2\\n | until( .n >= $length;\\n .lucky[.n-1] as $m\\n | if $m then .lucky |= removeEvery($m) | .n += 1\\n else .n = $length\\n end )\\n | del(.n);\\n\\ndef printSingle($j):\\n if $j >= 1 + (.lucky|length) then \\\"Argument is too big\\\" | error\\n else\\n (if .odd then \\\"Lucky number #\\\" else \\\"Lucky even number #\\\" end)\\n + ($j|tos) + \\\" = \\\" + (.lucky[$j-1]|tos)\\n end;\\n\\n# like jq's range($j-1; $k)\\ndef printRange($j; $k):\\n if $k >= (.lucky|length) then \\\"Argument \\\" + ($k|tos) + \\\" is too big\\\" | error\\n elif .odd\\n then \\\"Lucky numbers \\\" + ($j|tos) + \\\" to \\\" + ($k|tos) + \\\" inclusive are:\\\",\\n .lucky[$j-1:$k]\\n else \\\"Lucky even numbers \\\" + ($j|tos) + \\\" to \\\" + ($k|tos) + \\\" inclusive are:\\\",\\n .lucky[$j-1:$k]\\n end;\\n\\ndef printBetween($j; $k):\\n .lucky[-1] as $max\\n | if $j > $max or $k > $max\\n then \\\"At least one argument is too big\\\" | error\\n else\\n (if .odd\\n then \\\"Lucky numbers between \\\" + ($j|tos) + \\\" and \\\" + ($k|tos) + \\\" are:\\\"\\n else \\\"Lucky even numbers between \\\" + ($j|tos) + \\\" and \\\" + ($k|tos) + \\\" are:\\\"\\n end),\\n [.lucky | emit_until(. > $k) | select(. >= $j)]\\n end;\\n\\ndef odd:\\n if argsSize < 3 then true\\n else (.args[2] | tostring | ascii_downcase)\\n | if . == \\\"lucky\\\" or . == \\\"odd\\\" then true\\n elif . == \\\"evenlucky\\\" or . == \\\"even\\\" then false\\n else \\\"Third argument \\\" + (.args[2]|tos) + \\\" is invalid\\\" | error\\n end\\n end;\\n\\n# Input: {odd}\\ndef init($n):\\n if .odd\\n then .lucky = reduce range(0;$n) as $i (null; . + [$i*2 + 1])\\n else .lucky = reduce range(0;$n) as $i (null; . + [$i*2 + 2])\\n end;\\n\\n# Emit {args, j, k, odd, single} or raise an error\\ndef gatherArgs:\\n args\\n | if argsSize | (. < 1 or . > 3)\\n then \\\"There must be between 1 and 3 command line arguments\\\" | error\\n else .j = (.args[0] | isnumber )\\n | .k = (.args[1] | isnumber )\\n | .single = (argsSize == 1 or .args[1] == \\\",\\\")\\n | .odd = odd\\n | if (.j | isinteger | not) or (.j < 1)\\n then \\\"First argument \\\" + (.args[0]|tos) + \\\" must be a positive integer\\\" | error\\n elif argsSize >= 2 and .args[1] != \\\",\\\" and (.k | isinteger | not)\\n then \\\"Second argument \\\" + (.args[1]|tos) + \\\" must be an integer or ,\\\" | error\\n else .\\n end\\n | if .k and .k >= 0 and .j > .k\\n then \\\"Second argument cannot be less than first\\\" | error\\n else .\\n end\\n end ;\\n\\ndef start:\\n gatherArgs\\n | (if .k then (if .k > 0 then .k else null end) else .j end) as $size\\n | (if $size then ($size | . * (tostring|length|.*.)) else -.k end) as $size\\n | init($size)\\n | filterLucky\\n | if .single then printSingle(.j)\\n elif .k > 0 then printRange(.j; .k)\\n else .k |= - .\\n | if (.j > .k)\\n then \\\"The second argument cannot be less in absolute value than first\\\" | error\\n else printBetween(.j; .k)\\n end\\n end;\\n\\nstart\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Base, StringDistances\\n\\nstruct Lucky\\n start::Int\\n nmax::Int\\n Lucky(iseven, nmax) = new(iseven ? 2 : 1, nmax)\\nend\\n\\nstruct LuckyState\\n nextindex::Int\\n sequence::Vector{Int}\\nend\\n\\nBase.eltype(iter::Lucky) = Int\\n\\nfunction Base.iterate(iter::Lucky, state = LuckyState(1, collect(iter.start:2:iter.nmax)))\\n if length(state.sequence) < state.nextindex\\n return nothing\\n elseif state.nextindex == 1\\n return (iter.start, LuckyState(2, state.sequence))\\n end\\n result = state.sequence[state.nextindex]\\n newsequence = Vector{Int}()\\n for (i, el) in enumerate(state.sequence)\\n if i % result != 0\\n push!(newsequence, el)\\n end\\n end\\n (result, LuckyState(state.nextindex + 1, newsequence))\\nend\\n\\nfunction luckyindex(j, wanteven, k=0)\\n topindex = max(j, k) + 4\\n luck = Lucky(wanteven, topindex * 20)\\n iter_result = iterate(luck)\\n while iter_result != nothing\\n (elem, state) = iter_result\\n iter_result = iterate(luck, state)\\n if iter_result != nothing && iter_result[2].nextindex > topindex\\n return iter_result[2].sequence[k > j ? (j:k) : j]\\n end\\n end\\n throw(\\\"Index $j out of range for nmax of $(luck.nmax).\\\")\\nend\\n\\nfunction luckyrange(j, k, wanteven)\\n topvalue = max(j, k)\\n luck = Lucky(wanteven, topvalue + 1)\\n iter_result = iterate(luck)\\n (elem, state) = iter_result # save next to last result\\n while iter_result != nothing\\n (elem, state) = iter_result\\n iter_result = iterate(luck, state)\\n end\\n filter(x -> (j <= x <= k), state.sequence)\\nend\\n\\nfunction helpdisplay(exitlevel=1)\\n println(\\\"\\\\n\\\", PROGRAM_FILE, \\\" j [-][k] [lucky|evenLucky]\\\")\\n println(\\\"\\\\tj: index wanted or a starting point (index or value)\\\",\\n \\\"\\\\n\\\\tk: optional ending point (index), \\\\n\\\\t-k: optional ending point (value)\\\\n\\\")\\n helpstring =\\n\\\"\\\"\\\" | Argument(s) | What is printed |\\n |--------------------------------------------------------------------------|\\n | j | jth lucky number (required argument) |\\n | j , lucky | jth lucky number |\\n | j , evenLucky | jth even lucky number |\\n | j k | jth through kth (inclusive) lucky numbers |\\n | j k lucky | jth through kth (inclusive) lucky numbers |\\n | j k evenLucky | jth through kth (inclusive) even lucky numbers |\\n | j -k | all lucky numbers in the value range [m, |k|] |\\n | j -k lucky | all lucky numbers in the value range [m, |k|] |\\n | j -k evenLucky | all even lucky numbers in the value range [m, |k|] |\\n |--------------------------------------------------------------------------|\\\\n\\\\n\\\"\\\"\\\"\\n\\n println(helpstring)\\n exit(exitlevel)\\nend\\n\\nfunction parsecommandline()\\n comma = false\\n evenLucky = false\\n range = false\\n j = k = 0\\n if length(ARGS) < 1\\n helpdisplay()\\n end\\n for (pos, arg) in enumerate(ARGS)\\n if pos == 1\\n j = tryparse(Int, arg)\\n if j == nothing\\n println(\\\"The first argument must be a positive integer.\\\\n\\\")\\n helpdisplay()\\n end\\n elseif pos == 2 || (pos == 3 && comma)\\n k = tryparse(Int, arg)\\n if k == nothing\\n k = 0\\n if arg == \\\",\\\"\\n comma = true\\n continue\\n elseif arg == \\\"lucky\\\"\\n continue\\n elseif arg == \\\"evenLucky\\\"\\n evenLucky = true\\n elseif compare(Hamming(), arg, \\\"lucky\\\") > 0.4 || compare(Hamming(), arg, \\\"evenLucky\\\") > 0.4\\n println(\\\"Did you misspell \\\\\\\"lucky\\\\\\\" or \\\\\\\"evenLucky\\\\\\\"? Check capitalization.\\\\n\\\")\\n helpdisplay()\\n else\\n helpdisplay()\\n end\\n elseif k < 0\\n k = -k\\n range = true\\n end\\n elseif pos == 3 || pos == 4 && comma\\n if arg == \\\",\\\"\\n comma = true\\n continue\\n elseif arg == \\\"lucky\\\"\\n continue\\n elseif arg == \\\"evenLucky\\\"\\n evenLucky = true\\n elseif compare(Hamming(), arg, \\\"lucky\\\") > 0.1 || compare(Hamming(), arg, \\\"evenLucky\\\") > 0.1\\n println(\\\"Did you misspell \\\"\\\\lucky\\\\\\\" or \\\"\\\\evenLucky\\\\\\\"?\\\\n\\\\n\\\")\\n helpdisplay()\\n else\\n helpdisplay()\\n end\\n elseif arg == \\\"lucky\\\"\\n continue\\n elseif arg == \\\"evenLucky\\\"\\n evenLucky = true\\n else\\n println(\\\"Too many arguments.\\\\n\\\")\\n helpdisplay()\\n end\\n end\\n (j, k, evenLucky, range)\\nend\\n\\nfunction runopts()\\n (j, k, evenLucky, range) = parsecommandline()\\n if j < 1 || (k != 0 && j >= k)\\n throw(\\\"Lucky number integer parameters out of range: $(typeof(j)), $j, $(typeof(k)), $k\\\")\\n end\\n if range\\n println(luckyrange(j, k, evenLucky))\\n else\\n println(luckyindex(j, evenLucky, k))\\n end\\nend\\n\\nrunopts()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.51\\n\\ntypealias IAE = IllegalArgumentException\\n\\nval luckyOdd = MutableList(100000) { it * 2 + 1 }\\nval luckyEven = MutableList(100000) { it * 2 + 2 }\\n\\nfun filterLuckyOdd() {\\n var n = 2\\n while (n < luckyOdd.size) {\\n val m = luckyOdd[n - 1]\\n val end = (luckyOdd.size / m) * m - 1\\n for (j in end downTo m - 1 step m) luckyOdd.removeAt(j)\\n n++\\n }\\n}\\n\\nfun filterLuckyEven() {\\n var n = 2\\n while (n < luckyEven.size) {\\n val m = luckyEven[n - 1]\\n val end = (luckyEven.size / m) * m - 1\\n for (j in end downTo m - 1 step m) luckyEven.removeAt(j)\\n n++\\n }\\n}\\n\\nfun printSingle(j: Int, odd: Boolean) {\\n if (odd) {\\n if (j >= luckyOdd.size) throw IAE(\\\"Argument is too big\\\")\\n println(\\\"Lucky number $j = ${luckyOdd[j - 1]}\\\")\\n }\\n else {\\n if (j >= luckyEven.size) throw IAE(\\\"Argument is too big\\\")\\n println(\\\"Lucky even number $j = ${luckyEven[j - 1]}\\\")\\n }\\n}\\n\\nfun printRange(j: Int, k: Int, odd: Boolean) {\\n if (odd) {\\n if (k >= luckyOdd.size) throw IAE(\\\"Argument is too big\\\")\\n println(\\\"Lucky numbers $j to $k are:\\\\n${luckyOdd.drop(j - 1).take(k - j + 1)}\\\")\\n }\\n else {\\n if (k >= luckyEven.size) throw IAE(\\\"Argument is too big\\\")\\n println(\\\"Lucky even numbers $j to $k are:\\\\n${luckyEven.drop(j - 1).take(k - j + 1)}\\\")\\n }\\n}\\n\\nfun printBetween(j: Int, k: Int, odd: Boolean) {\\n val range = mutableListOf<Int>()\\n if (odd) {\\n val max = luckyOdd[luckyOdd.lastIndex]\\n if (j > max || k > max) {\\n throw IAE(\\\"At least one argument is too big\\\")\\n }\\n for (num in luckyOdd) {\\n if (num < j) continue\\n if (num > k) break\\n range.add(num)\\n }\\n println(\\\"Lucky numbers between $j and $k are:\\\\n$range\\\")\\n }\\n else {\\n val max = luckyEven[luckyEven.lastIndex]\\n if (j > max || k > max) {\\n throw IAE(\\\"At least one argument is too big\\\")\\n }\\n for (num in luckyEven) {\\n if (num < j) continue\\n if (num > k) break\\n range.add(num)\\n }\\n println(\\\"Lucky even numbers between $j and $k are:\\\\n$range\\\")\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n if (args.size !in 1..3) throw IAE(\\\"There must be between 1 and 3 command line arguments\\\")\\n filterLuckyOdd()\\n filterLuckyEven()\\n val j = args[0].toIntOrNull()\\n if (j == null || j < 1) throw IAE(\\\"First argument must be a positive integer\\\")\\n if (args.size == 1) { printSingle(j, true); return }\\n\\n if (args.size == 2) {\\n val k = args[1].toIntOrNull()\\n if (k == null) throw IAE(\\\"Second argument must be an integer\\\")\\n if (k >= 0) {\\n if (j > k) throw IAE(\\\"Second argument can't be less than first\\\")\\n printRange(j, k, true)\\n }\\n else {\\n val l = -k\\n if (j > l) throw IAE(\\\"The second argument can't be less in absolute value than first\\\")\\n printBetween(j, l, true)\\n }\\n return\\n }\\n\\n var odd =\\n if (args[2].toLowerCase() == \\\"lucky\\\") true\\n else if (args[2].toLowerCase() == \\\"evenlucky\\\") false\\n else throw IAE(\\\"Third argument is invalid\\\")\\n\\n if (args[1] == \\\",\\\") {\\n printSingle(j, odd)\\n return\\n }\\n\\n val k = args[1].toIntOrNull()\\n if (k == null) throw IAE(\\\"Second argument must be an integer or a comma\\\")\\n\\n if (k >= 0) {\\n if (j > k) throw IAE(\\\"Second argument can't be less than first\\\")\\n printRange(j, k, odd)\\n }\\n else {\\n val l = -k\\n if (j > l) throw IAE(\\\"The second argument can't be less in absolute value than first\\\")\\n printBetween(j, l, odd)\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"ClearAll[GetLuckies, GetEvenLuckies]\\nGetLuckies[max_] := Module[{luckies, f, i},\\n luckies = Range[1, max, 2];\\n f[n_] := Block[{k = luckies[[n]]}, luckies = Delete[luckies, Table[{k}, {k, k, Length@luckies, k}]]];\\n i = 2;\\n While[i < Length[luckies],\\n f[i];\\n i++\\n ];\\n luckies\\n ]\\nGetEvenLuckies[max_] := Module[{lst, i, len},\\n lst = Range[2, max, 2];\\n i = 2;\\n While[i <= (len = Length@lst) && (k = lst[[i]]) <= len,\\n lst = Drop[lst, {k, len, k}];\\n i++\\n ];\\n lst\\n ]\\nGiveLucky[s_String] := GiveLucky[StringSplit[s, \\\" \\\"]]\\nGiveLucky[args_List] := Module[{argc = Length[args], j, k, type},\\n If[argc > 3,\\n Print[\\\"Too many arguments\\\"]\\n ,\\n If[argc == 0,\\n Print[\\\"Too few arguments\\\"]\\n ,\\n Switch[argc, 1,\\n j = Interpreter[\\\"Integer\\\"][args[[1]]];\\n If[! FailureQ[j],\\n If[j > 0,\\n Print@GetLuckies[20 j][[j]]\\n ,\\n Print[\\\"j should be positive\\\"]\\n ]\\n ,\\n Print[\\\"one argument that is not an integer\\\"]\\n ]\\n , 2,\\n j = Interpreter[\\\"Integer\\\"][args[[1]]];\\n k = Interpreter[\\\"Integer\\\"][args[[2]]];\\n If[! FailureQ[j] \\\\[And] ! FailureQ[k],\\n If[j > 0,\\n If[k > 0,\\n Print@GetLuckies[20 k][[j ;; k]]\\n ,\\n Print@Select[GetLuckies[-k], GreaterEqualThan[j]]\\n ]\\n ,\\n Print[\\\"j should be positive\\\"]\\n ]\\n ,\\n Print[\\\"one of the two arguments is not an integer\\\\[Ellipsis]\\\"]\\n ]\\n , 3,\\n If[args[[2]] === \\\",\\\",\\n j = Interpreter[\\\"Integer\\\"][args[[1]]];\\n If[! FailureQ[j],\\n If[j > 0,\\n type = args[[3]];\\n If[MatchQ[type, \\\"evenLucky\\\" | \\\"lucky\\\"],\\n If[type === \\\"evenLucky\\\",\\n Print@GetEvenLuckies[20 j][[j]]\\n ,\\n Print@GetLuckies[20 j][[j]]\\n ]\\n ,\\n Print[\\\"unknown type \\\", type]\\n ]\\n ,\\n Print[\\\"j should be positive\\\"]\\n ]\\n ,\\n Print[\\\"j should be an integer\\\"]\\n ]\\n ,\\n j = Interpreter[\\\"Integer\\\"][args[[1]]];\\n k = Interpreter[\\\"Integer\\\"][args[[2]]];\\n If[! FailureQ[j] \\\\[And] ! FailureQ[k],\\n If[j > 0,\\n type = args[[3]];\\n If[k > 0,\\n If[MatchQ[type, \\\"evenLucky\\\" | \\\"lucky\\\"],\\n If[type === \\\"evenLucky\\\",\\n Print@GetEvenLuckies[20 k][[j ;; k]]\\n ,\\n Print@GetLuckies[20 k][[j ;; k]]\\n ]\\n ,\\n Print[\\\"unknown type \\\", type]\\n ]\\n ,\\n If[MatchQ[type, \\\"evenLucky\\\" | \\\"lucky\\\"],\\n If[type === \\\"evenLucky\\\",\\n Print@Select[GetEvenLuckies[-k], GreaterEqualThan[j]]\\n ,\\n Print@Select[GetLuckies[-k], GreaterEqualThan[j]]\\n ]\\n ,\\n Print[\\\"unknown type \\\", type]\\n ]\\n ]\\n ,\\n Print[\\\"j should be positive\\\"]\\n ]\\n ,\\n Print[\\\"one of the two arguments is not an integer\\\\[Ellipsis]\\\"]\\n ]\\n ]\\n ]\\n ]\\n ]\\n ]\\nGiveLucky[Last@$ScriptCommandLine]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import os, strformat, strutils\\n\\ntype LuckyKind {.pure.} = enum Lucky = \\\"lucky\\\", EvenLucky = \\\"evenlucky\\\"\\n\\nconst NoValue = 0 # Indicates that no value have been specified.\\n\\n\\n####################################################################################################\\n# Lucky numbers generation.\\n\\nfunc initLuckyNumbers(nelems: int; kind: LuckyKind): seq[int] =\\n ## Initialize a list of lucky numbers.\\n result = newSeqOfCap[int](nelems)\\n for i in 0..<nelems:\\n var k = i\\n for j in countdown(result.high, 1):\\n k = k * result[j] div (result[j] - 1)\\n result.add 2 * k + 1 + ord(kind)\\n\\n\\n####################################################################################################\\n# Printing.\\n\\ntemplate name(kind: LuckyKind): string =\\n if kind == Lucky: \\\"Lucky\\\" else: \\\"Even lucky\\\"\\n\\nproc printSingle(j: int; kind: LuckyKind) =\\n ## Print the lucky number at a given index.\\n let luckySeq = initLuckyNumbers(j, kind)\\n echo &\\\"{name(kind)} number at index {j} is {luckySeq[j - 1]}\\\"\\n\\nproc printRange(j, k: int; kind: LuckyKind) =\\n ## print the luck numbers in a range of indexes.\\n let luckySeq = initLuckyNumbers(k, kind)\\n var list = &\\\"{name(kind)} numbers at indexes {j} to {k} are: \\\"\\n let start = list.len\\n for idx in (j - 1)..(k - 1):\\n list.addSep(\\\", \\\", start)\\n list.add $luckySeq[idx]\\n echo list\\n\\nproc printInRange(j, k: int; kind: LuckyKind) =\\n ## Print the lucky numbers in a range of values.\\n let luckySeq = initLuckyNumbers(k, kind) # \\\"k\\\" is greater than needed.\\n var list = &\\\"{name(kind)} numbers between {j} to {k} are: \\\"\\n let start = list.len\\n for val in luckySeq:\\n if val > k: break\\n if val > j:\\n list.addSep(\\\", \\\", start)\\n list.add $val\\n echo list\\n\\n\\n####################################################################################################\\n# Command line parsing.\\n\\nproc parseCommandLine(): tuple[j, k: int; kind: LuckyKind] =\\n ## Parse the command line.\\n\\n # Internal exception to catch invalid argument value.\\n type InvalidArgumentError = object of ValueError\\n\\n template raiseError(message, value = \\\"\\\") =\\n ## Raise an InvalidArgumentError.\\n raise newException(InvalidArgumentError, message & value & '.')\\n\\n\\n result = (Novalue, Novalue, Lucky)\\n\\n try:\\n\\n if paramCount() notin 1..3: raiseError \\\"Wrong number of arguments\\\"\\n\\n # First argument: \\\"j\\\" value.\\n let p1 = paramStr(1)\\n try:\\n result.j = parseInt(p1)\\n if result.j <= 0: raiseError \\\"Expected a positive number, got: \\\", p1\\n except ValueError:\\n raiseError \\\"Expected an integer, got: \\\", p1\\n\\n # Second argument: \\\"k\\\" value or a comma.\\n if paramCount() > 1:\\n let p2 = paramStr(2)\\n if p2 == \\\",\\\":\\n # Must be followed by the kind of lucky number.\\n if paramCount() != 3: raiseError \\\"Missing kind argument\\\"\\n else:\\n try:\\n result.k = parseInt(p2)\\n if result.k == 0: raiseError \\\"Expected a non null number, got: \\\", p2\\n except ValueError:\\n raiseError \\\"Expected an integer, got: \\\", p2\\n\\n # Third argument: number kind.\\n if paramCount() == 3:\\n let p3 = paramStr(3)\\n try:\\n result.kind = parseEnum[LuckyKind](p3.toLowerAscii())\\n except ValueError:\\n raiseError \\\"Wrong kind: \\\", p3\\n\\n except InvalidArgumentError:\\n quit getCurrentExceptionMsg()\\n\\n\\n#———————————————————————————————————————————————————————————————————————————————————————————————————\\n# Main program.\\n\\nlet (j, k, kind) = parseCommandLine()\\n\\nif k == NoValue:\\n # Print jth value.\\n printSingle(j, kind)\\n\\nelif k > 0:\\n # Print jth to kth values.\\n printRange(j, k, kind)\\n\\nelse:\\n # Print values in range j..(-k).\\n printInRange(j, -k, kind)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use Perl6::GatherTake;\\n\\nsub luck {\\nmy($a,$b) = @_;\\n\\ngather {\\n my $i = $b;\\n my(@taken,@rotor,$j);\\n\\n take 0; # 0th index is a placeholder\\n push @taken, take $a;\\n\\n while () {\\n for ($j = 0; $j < @rotor; $j++) {\\n --$rotor[$j] or last;\\n }\\n if ($j < @rotor) {\\n $rotor[$j] = $taken[$j+1];\\n }\\n else {\\n take $i;\\n push @taken, $i;\\n push @rotor, $i - @taken;\\n }\\n $i += 2;\\n }\\n}\\n}\\n\\n# fiddle with user input\\n$j = shift || usage();\\n$k = shift || ',';\\n$l = shift || 'lucky';\\nusage() unless $k =~ /,|-?\\\\d+/;\\nusage() unless $l =~ /^(even)?lucky$/i;\\nsub usage { print \\\"Args must be: j [,|k|-k] [lucky|evenlucky]\\\\n\\\" and exit }\\n\\n# seed the iterator\\nmy $lucky = $l =~ /^l/i ? luck(1,3) : luck(2,4);\\n\\n# access values from 'lazy' list\\nif ($k eq ',') {\\n print $lucky->[$j]\\n} elsif ($k > $j) {\\n print $lucky->[$_] . ' ' for $j..$k\\n} elsif ($k < 0) {\\n while () { last if abs($k) < $lucky->[$i++] } # must first extend the array\\n print join ' ', grep { $_ >= $j and $_ <= abs($k) } @$lucky\\n}\\n\\nprint \\\"\\\\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;\\\">luckyMax</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">120000</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">lucky</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">filterLucky</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;\\\">2</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;\\\">lucky</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">m</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">lucky</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <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: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">k</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: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lucky</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">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>\\n <span style=\\\"color: #000000;\\\">lucky</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">lucky</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</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;\\\">if</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;\\\">lucky</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: #000000;\\\">lucky</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">lucky</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>\\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;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">helptxt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n argument(s) | what is displayed\\n =======================================\\n j | jth lucky number\\n j [,] lucky | jth lucky number\\n j [,] evenLucky | jth even lucky number\\n j k | jth through kth (inclusive) lucky numbers\\n j k lucky | jth through kth (inclusive) lucky numbers\\n j k evenLucky | jth through kth (inclusive) even lucky numbers\\n j -k | all lucky numbers in the range j to k\\n j -k lucky | all lucky numbers in the range j to k\\n j -k evenLucky | all even lucky numbers in the range j to k\\n \\\"\\\"\\\"</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">fatal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">msg</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;\\\">msg</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;\\\">helptxt</span><span style=\\\"color: #0000FF;\\\">)</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 <span style=\\\"color: #7060A8;\\\">abort</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;\\\">procedure</span> <span style=\\\"color: #000000;\\\">process</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">cl</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- Allow eg \\\"lucky j , evenLucky\\\" to be == \\\"lucky j evenLucky\\\"\\n --</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cl</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">3</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">cl</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;\\\">then</span> <span style=\\\"color: #000000;\\\">cl</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> <span style=\\\"color: #0000FF;\\\">=</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;\\\">j</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">k</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">single</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">range</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">oddluck</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: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cl</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">cli</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">cl</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;\\\">cli</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]<=</span><span style=\\\"color: #008000;\\\">'9'</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (includes '-')</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">scanf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cl</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #008000;\\\">\\\"%d\\\"</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;\\\">d</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">fatal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"unrecognised \\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">cli</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;\\\">i</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">fatal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"too many numbers\\\"</span><span style=\\\"color: #0000FF;\\\">)</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;\\\">n</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><span style=\\\"color: #000000;\\\">1</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;\\\">1</span> <span style=\\\"color: #008080;\\\">then</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: #000000;\\\">fatal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"first argument must be a positive integer\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">j</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">n</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">single</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">range</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</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;\\\">if</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">j</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">fatal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"second argument cannot be less than first\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">k</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;\\\">else</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cli</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"lucky\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"evenLucky\\\"</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;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">fatal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"unrecognised \\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">cli</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;\\\">i</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cl</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">fatal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cli</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\" must be last parameter\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">oddluck</span> <span style=\\\"color: #0000FF;\\\">=</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;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #000000;\\\">lucky</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">luckyMax</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">oddluck</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">filterLucky</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;\\\">\\\"Output when args are %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cl</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">evenstr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">oddluck</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">\\\"even \\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">single</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lucky</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">fatal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"the argument, %d, is too big\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">))</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;\\\">\\\"Lucky %snumber %d = %d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">evenstr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">lucky</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]})</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">range</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lucky</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">fatal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"the argument, %d, is too big\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">))</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;\\\">\\\"Lucky %snumbers %d to %d are: %v\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">evenstr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">lucky</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]})</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">lucky</span><span style=\\\"color: #0000FF;\\\">[$]</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">fatal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"start of range is too big\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">lucky</span><span style=\\\"color: #0000FF;\\\">[$]</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">fatal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"end of range is too big\\\"</span><span style=\\\"color: #0000FF;\\\">)</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;\\\">m</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">abs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">binary_search</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">lucky</span><span style=\\\"color: #0000FF;\\\">)),</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">binary_search</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">lucky</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;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">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;\\\">1</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;\\\">\\\"Lucky %snumbers between %d and %d are: %v\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">evenstr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">lucky</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>\\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;\\\">procedure</span> <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">cl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">command_line</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;\\\">cl</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- fatal(\\\"at least one argument must be supplied\\\") -- (if preferred)</span>\\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;\\\">\\\"1 20\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"1 20 evenLucky\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"20 lucky\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"20 evenLucky\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"6000 -6100\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"6000 -6100 evenLucky\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"10000 lucky\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"10000 evenLucky\\\"</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- (done this way to exercise the real command line handling...)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">cl</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #000000;\\\">cl</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: #000080;font-style:italic;\\\">-- (compiled)</span>\\n <span style=\\\"color: #000000;\\\">cl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">cl</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;\\\">elsif</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()=</span><span style=\\\"color: #004600;\\\">WINDOWS</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (and interpreted)</span>\\n <span style=\\\"color: #000000;\\\">cl</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: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cl</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #008000;\\\">\\\"pw\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"p\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (pw.exe -> p.exe)</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;\\\">cl</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</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;\\\">cl</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: #000000;\\\">cl</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;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"\\\\\\\"%s\\\\\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">cl</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;\\\">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;\\\">t</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: #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: #000080;font-style:italic;\\\">-- (...except when we can't do that, of course)</span>\\n <span style=\\\"color: #000000;\\\">process</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tests</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">]))</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">cmd</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">join</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;\\\">cl</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">tests</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">]))</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- printf(1,\\\"running %s\\\\n\\\",{cmd})</span>\\n <span style=\\\"color: #0000FF;\\\">{}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">system_exec</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cmd</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;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"tests complete\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</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 <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">cl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">cl</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">..$]</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- ({1,2} are {interperter,source} or {exe,exe})</span>\\n <span style=\\\"color: #000000;\\\">process</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cl</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\": \"(off *Even)\\n\\n(de nn (Lst N)\\n (seek\\n '((L)\\n (when (car L) (=0 (dec 'N))) )\\n Lst ) )\\n\\n(de lucky (B)\\n (let Lst (range (if *Even 2 1) B 2)\\n (for A (cdr Lst)\\n (for (L (nn Lst A) L (nn (cdr L) A))\\n (set L) ) )\\n (filter bool Lst) ) )\\n\\n(argv . *Argv) # without validations\\n(when (= \\\"evenLucky\\\" (last *Argv)) (on *Even))\\n(setq *Lst (lucky 7000))\\n(let (A (format (car *Argv)) B (format (cadr *Argv)))\\n (println\\n (if (lt0 B)\\n (filter '((N) (<= A N (abs B))) *Lst)\\n (head B (nth *Lst A)) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"from __future__ import print_function\\n\\ndef lgen(even=False, nmax=1000000):\\n start = 2 if even else 1\\n n, lst = 1, list(range(start, nmax + 1, 2))\\n lenlst = len(lst)\\n yield lst[0]\\n while n < lenlst and lst[n] < lenlst:\\n yield lst[n]\\n n, lst = n + 1, [j for i,j in enumerate(lst, 1) if i % lst[n]]\\n lenlst = len(lst)\\n # drain\\n for i in lst[n:]:\\n yield i\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from itertools import islice\\nimport sys, re\\n\\nclass ArgumentError(Exception):\\n pass\\ndef arghandler(argstring):\\n match_obj = re.match( r\\\"\\\"\\\"(?mx)\\n (?:\\n (?P<SINGLE>\\n (?: ^ (?P<SINGLEL> \\\\d+ ) (?: | \\\\s , \\\\s lucky ) \\\\s* $ )\\n |(?: ^ (?P<SINGLEE> \\\\d+ ) (?: | \\\\s , \\\\s evenLucky ) \\\\s* $ )\\n )\\n |(?P<KTH>\\n (?: ^ (?P<KTHL> \\\\d+ \\\\s \\\\d+ ) (?: | \\\\s lucky ) \\\\s* $ )\\n |(?: ^ (?P<KTHE> \\\\d+ \\\\s \\\\d+ ) (?: | \\\\s evenLucky ) \\\\s* $ )\\n )\\n |(?P<RANGE>\\n (?: ^ (?P<RANGEL> \\\\d+ \\\\s -\\\\d+ ) (?: | \\\\s lucky ) \\\\s* $ )\\n |(?: ^ (?P<RANGEE> \\\\d+ \\\\s -\\\\d+ ) (?: | \\\\s evenLucky ) \\\\s* $ )\\n )\\n )\\\"\\\"\\\", argstring)\\n\\n if match_obj:\\n # Retrieve group(s) by name\\n SINGLEL = match_obj.group('SINGLEL')\\n SINGLEE = match_obj.group('SINGLEE')\\n KTHL = match_obj.group('KTHL')\\n KTHE = match_obj.group('KTHE')\\n RANGEL = match_obj.group('RANGEL')\\n RANGEE = match_obj.group('RANGEE')\\n if SINGLEL:\\n j = int(SINGLEL)\\n assert 0 < j < 10001, \\\"Argument out of range\\\"\\n print(\\\"Single %i'th lucky number:\\\" % j, end=' ')\\n print( list(islice(lgen(), j-1, j))[0] )\\n elif SINGLEE:\\n j = int(SINGLEE)\\n assert 0 < j < 10001, \\\"Argument out of range\\\"\\n print(\\\"Single %i'th even lucky number:\\\" % j, end=' ')\\n print( list(islice(lgen(even=True), j-1, j))[0] )\\n elif KTHL:\\n j, k = [int(num) for num in KTHL.split()]\\n assert 0 < j < 10001, \\\"first argument out of range\\\"\\n assert 0 < k < 10001 and k > j, \\\"second argument out of range\\\"\\n print(\\\"List of %i ... %i lucky numbers:\\\" % (j, k), end=' ')\\n for n, luck in enumerate(lgen(), 1):\\n if n > k: break\\n if n >=j: print(luck, end = ', ')\\n print('')\\n elif KTHE:\\n j, k = [int(num) for num in KTHE.split()]\\n assert 0 < j < 10001, \\\"first argument out of range\\\"\\n assert 0 < k < 10001 and k > j, \\\"second argument out of range\\\"\\n print(\\\"List of %i ... %i even lucky numbers:\\\" % (j, k), end=' ')\\n for n, luck in enumerate(lgen(even=True), 1):\\n if n > k: break\\n if n >=j: print(luck, end = ', ')\\n print('')\\n elif RANGEL:\\n j, k = [int(num) for num in RANGEL.split()]\\n assert 0 < j < 10001, \\\"first argument out of range\\\"\\n assert 0 < -k < 10001 and -k > j, \\\"second argument out of range\\\"\\n k = -k\\n print(\\\"List of lucky numbers in the range %i ... %i :\\\" % (j, k), end=' ')\\n for n in lgen():\\n if n > k: break\\n if n >=j: print(n, end = ', ')\\n print('')\\n elif RANGEE:\\n j, k = [int(num) for num in RANGEE.split()]\\n assert 0 < j < 10001, \\\"first argument out of range\\\"\\n assert 0 < -k < 10001 and -k > j, \\\"second argument out of range\\\"\\n k = -k\\n print(\\\"List of even lucky numbers in the range %i ... %i :\\\" % (j, k), end=' ')\\n for n in lgen(even=True):\\n if n > k: break\\n if n >=j: print(n, end = ', ')\\n print('')\\n else:\\n raise ArgumentError('''\\n\\n Error Parsing Arguments!\\n\\n Expected Arguments of the form (where j and k are integers):\\n\\n j # Jth lucky number\\n j , lucky # Jth lucky number\\n j , evenLucky # Jth even lucky number\\n #\\n j k # Jth through Kth (inclusive) lucky numbers\\n j k lucky # Jth through Kth (inclusive) lucky numbers\\n j k evenLucky # Jth through Kth (inclusive) even lucky numbers\\n #\\n j -k # all lucky numbers in the range j --? |k|\\n j -k lucky # all lucky numbers in the range j --? |k|\\n j -k evenLucky # all even lucky numbers in the range j --? |k|\\n ''')\\n\\nif __name__ == '__main__':\\n arghandler(' '.join(sys.argv[1:]))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from itertools import count\\ndef lgen(even=False):\\n lucky = []\\n if not even:\\n yield 1\\n for k in count(1):\\n for l in reversed(lucky):\\n k = (k*l)//(l-1)\\n lucky.append(2*k+1 + even)\\n yield 2*k+1 + even\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"sub luck(\\\\a,\\\\b) {\\n gather {\\n\\tmy @taken = take a;\\n\\tmy @rotor;\\n\\tmy $i = b;\\n\\n\\tloop {\\n\\t loop (my $j = 0; $j < @rotor; $j++) {\\n\\t\\t--@rotor[$j] or last;\\n\\t }\\n\\t if $j < @rotor {\\n\\t\\t@rotor[$j] = @taken[$j+1];\\n\\t }\\n\\t else {\\n\\t\\tpush @taken, take $i;\\n\\t\\tpush @rotor, $i - @taken;\\n\\t }\\n\\t $i += 2;\\n\\t}\\n }\\n}\\n\\nconstant @lucky = luck(1,3);\\nconstant @evenlucky = luck(2,4);\\n\\nsubset Luck where m:i/^ 'even'? 'lucky' $/;\\n\\nmulti MAIN (Int $num where * > 0) {\\n say @lucky[$num-1];\\n}\\n\\nmulti MAIN (Int $num where * > 0, ',', Luck $howlucky = 'lucky') {\\n say @::(lc $howlucky)[$num-1];\\n}\\n\\nmulti MAIN (Int $first where * > 0, Int $last where * > 0, Luck $howlucky = 'lucky') {\\n say @::(lc $howlucky)[$first-1 .. $last - 1];\\n}\\n\\nmulti MAIN (Int $min where * > 0, Int $neg-max where * < 0, Luck $howlucky = 'lucky') {\\n say grep * >= $min, (@::(lc $howlucky) ...^ * > abs $neg-max);\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program displays lucky or evenLucky integers (numbers or a number range).*/\\nparse arg bot top func _ . /*obtain required & optional arguments.*/\\nif func=='' then func= 'lucky' /*Not specified? Then use the default.*/\\ns= left('s', bot\\\\==top & top\\\\==\\\",\\\") /*plural results (or maybe not plural).*/\\nsay func 'number's\\\":\\\" bot top '───►' $lucky(bot, top, func, _)\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n$lucky: arg x,y,f,?; if y=='' | y==\\\",\\\" then y= x /*obtain some arguments; set Y.*/\\n #= 0; $=; ny= y<0 /*set variable NOY: value range*/\\n if f=='' then f= 'LUCKY'; lucky= (f==\\\"LUCKY\\\") /*assume LUCKY if omitted. */\\n if f\\\\=='LUCKY' & f\\\\=='EVENLUCKY' then return 'function not valid: ' f\\n if arg()>3 & ?\\\\='' then return \\\"too many arguments entered: \\\" ?\\n if x='' then return \\\"1st argument is missing.\\\"\\n if x<1 then return \\\"1st argument isn't a positive integer: \\\" x\\n if \\\\datatype(x,'W') then return \\\"1st argument isn't an integer: \\\" x\\n if \\\\datatype(y,'W') then return \\\"2nd argument isn't an integer: \\\" y\\n if x>ay then return \\\"2nd argument is less than 1st arg.\\\"\\n ay=abs(y); yL=ay; if y>0 then yL= y*10 + y + y /*adjust the upper Y limit. */\\n /* [↓] build LUCKY | EVENLUCKY*/\\n do j=1 until j>=yL /*construct list pos. integers.*/\\n if j//2==(\\\\lucky) then iterate /*EVENLUCKY? Use only even ints*/\\n\\n if lucky then if (j+1)//6==0 then iterate /*prune if mod 6 ≡ zero.*/\\n else nop /*balance the IF-THEN logic.*/\\n else if j //8==0 then iterate /*prune next if mod 8 ≡ zero.*/\\n #= # + 1 /*bump the counter of numbers. */\\n $= $ j /*append integer to the $ list.*/\\n end /*j*/\\n q=0\\n do p=3 until q==''; q= word($, p) /*start to prune integer list.*/\\n if q># then leave /*if integer is too large, stop*/\\n do j=#%q*q by -q to q /*elide every Qth integer. */\\n $= delword($, j, 1) /*delete a particular number. */\\n #= # -1 /*decrease the integer count. */\\n end /*j*/ /*delete from the right side. */\\n end /*p*/\\n @.=\\n do k=1; parse var $ q $; if q=='' then leave; @.k= q\\n end /*k*/\\n @.0=k-1\\n do m=1 for # /*restrict the found integers. */\\n if (\\\\ny & (m<x | m>ay)) | (ny & (@.m<x | @.m>ay)) then @.m=\\n end /*m*/ /* [↑] a list of #s or a range*/\\n _=\\n do b=1 for @.0; _= _ @.b /*construct a list of integers.*/\\n end /*b*/\\n return space(_) /*remove superfluous blanks. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Lucky and even lucky numbers\\n\\nlucky = list(50)\\ndellucky = []\\nfor n = 1 to 50\\n lucky[n] = 2*n-1\\nnext\\nsee \\\"the first 20 lucky numbers:\\\" + nl\\nluckynumbers(lucky)\\nshowarray(lucky)\\nsee nl\\n\\nlucky = list(50)\\ndellucky = []\\nfor n = 1 to 50\\n lucky[n] = 2*n\\nnext\\nsee \\\"the first 20 even lucky numbers:\\\" + nl\\nluckynumbers(lucky)\\nshowarray(lucky)\\nsee nl\\n\\nlucky = list(20000)\\ndellucky = []\\nfor n = 1 to 10000\\n lucky[n] = 2*n-1\\nnext\\nsee \\\"lucky numbers between 6,000 and 6,100:\\\" + nl\\nluckynumbers2(lucky)\\nshowarray2(lucky)\\nsee nl\\n\\nlucky = list(20000)\\ndellucky = []\\nfor n = 1 to 10000\\n lucky[n] = 2*n\\nnext\\nsee \\\"even lucky numbers between 6,000 and 6,100:\\\" + nl\\nluckynumbers2(lucky)\\nshowarray2(lucky)\\nsee nl\\n\\nfunc luckynumbers(lucky)\\n for n = 2 to len(lucky)\\n dellucky = []\\n for m = lucky[n] to len(lucky) step lucky[n]\\n add(dellucky, m)\\n next\\n for p = len(dellucky) to 1 step -1\\n del(lucky, dellucky[p])\\n next\\n next\\n\\nfunc luckynumbers2(lucky)\\n for n = 2 to len(lucky)\\n dellucky = []\\n for m = lucky[n] to len(lucky) step lucky[n]\\n add(dellucky, m)\\n next\\n for p = len(dellucky) to 1 step -1\\n del(lucky, dellucky[p])\\n next\\n if lucky[n] >= 6100\\n exit\\n ok\\nnext\\n\\nfunc showarray(vect)\\n see \\\"[\\\"\\n svect = \\\"\\\"\\n for n = 1 to 20\\n svect = svect + vect[n] + \\\", \\\"\\n next\\n svect = left(svect, len(svect) - 2)\\n see svect\\n see \\\"]\\\" + nl\\n\\nfunc showarray2(vect)\\n see \\\"[\\\"\\n svect = \\\"\\\"\\n for n = 1 to len(vect)\\n if vect[n] >= 6000 and vect[n] <= 6100\\n svect = svect + vect[n] + \\\", \\\"\\n ok\\n next\\n svect = left(svect, len(svect) - 2)\\n see svect\\n see \\\"]\\\" + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def generator(even=false, nmax=1000000)\\n start = even ? 2 : 1\\n Enumerator.new do |y|\\n n = 1\\n ary = [0] + (start..nmax).step(2).to_a # adds [0] to revise the 0 beginnings.\\n y << ary[n]\\n while (m = ary[n+=1]) < ary.size\\n y << m\\n (m...ary.size).step(m){|i| ary[i]=nil}\\n ary.compact! # remove nil\\n end\\n # drain\\n ary[n..-1].each{|i| y << i}\\n raise StopIteration\\n end\\nend\\n\\ndef lucky(argv)\\n j, k = argv[0].to_i, argv[1].to_i\\n mode = /even/i=~argv[2] ? :'even lucky' : :lucky\\n seq = generator(mode == :'even lucky')\\n ord = ->(n){\\\"#{n}#{(n%100).between?(11,19) ? 'th' : %w[th st nd rd th th th th th th][n%10]}\\\"}\\n if k.zero?\\n puts \\\"#{ord[j]} #{mode} number: #{seq.take(j).last}\\\"\\n elsif 0 < k\\n puts \\\"#{ord[j]} through #{ord[k]} (inclusive) #{mode} numbers\\\",\\n \\\" #{seq.take(k)[j-1..-1]}\\\"\\n else\\n k = -k\\n ary = []\\n loop do\\n case num=seq.next\\n when 1...j\\n when j..k then ary << num\\n else break\\n end\\n end\\n puts \\\"all #{mode} numbers in the range #{j}..#{k}\\\",\\n \\\" #{ary}\\\"\\n end\\nend\\n\\nif __FILE__ == $0\\n lucky(ARGV)\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"struct LuckyNumbers : Sequence, IteratorProtocol {\\n let even: Bool\\n let through: Int\\n\\n private var drainI = 0\\n private var n = 0\\n private var lst: [Int]\\n\\n init(even: Bool = false, through: Int = 1_000_000) {\\n self.even = even\\n self.through = through\\n self.lst = Array(stride(from: even ? 2 : 1, through: through, by: 2))\\n }\\n\\n mutating func next() -> Int? {\\n guard n != 0 else {\\n defer { n += 1 }\\n\\n return lst[0]\\n }\\n\\n while n < lst.count && lst[n] < lst.count {\\n let retVal = lst[n]\\n\\n lst = lst.enumerated().filter({ ($0.offset + 1) % lst[n] != 0 }).map({ $0.element })\\n n += 1\\n\\n return retVal\\n }\\n\\n if drainI == 0 {\\n lst = Array(lst.dropFirst(n))\\n }\\n\\n while drainI < lst.count {\\n defer { drainI += 1 }\\n\\n return lst[drainI]\\n }\\n\\n return nil\\n }\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"let args = Array(CommandLine.arguments.dropFirst())\\n\\nguard let sj = args.first, let j = Int(sj), j > 0, j <= 10_000 else {\\n fatalError(\\\"Incorrect j\\\")\\n}\\n\\nfunc evenString(_ even: Bool) -> String {\\n return even ? \\\"even\\\" : \\\"\\\"\\n}\\n\\nfunc jLuckyNumber(_ j: Int, even: Bool) {\\n print(\\\"The \\\\(j)th \\\\(evenString(even)) lucky number is \\\\(Array(LuckyNumbers(even: even))[j-1..<j].first!)\\\")\\n}\\n\\nfunc luckyNumbersKth(j: Int, k: Int, even: Bool) {\\n print(\\\"List of \\\\(j) ... \\\\(k) \\\\(evenString(even)) lucky numbers: \\\", terminator: \\\"\\\")\\n\\n for (offset, luck) in LuckyNumbers(even: even).lazy.enumerated() {\\n guard offset + 1 <= k else { break }\\n\\n if offset + 1 >= j {\\n print(luck, terminator: \\\", \\\")\\n }\\n }\\n\\n print()\\n}\\n\\nfunc luckyNumbersRange(j: Int, k: Int, even: Bool) {\\n print(\\\"List of \\\\(evenString(even)) lucky numbers in the range \\\\(j) ... \\\\(-k): \\\", terminator: \\\"\\\")\\n\\n for lucky in LuckyNumbers(even: even).lazy {\\n guard lucky <= -k else { break }\\n\\n if lucky >= j {\\n print(lucky, terminator: \\\", \\\")\\n }\\n }\\n\\n print()\\n}\\n\\nswitch args.count {\\ncase 1:\\n jLuckyNumber(j, even: false)\\ncase 2:\\n switch Int(args.last!) {\\n case let k? where k > 0 && k <= 10_000 && k > j:\\n luckyNumbersKth(j: j, k: k, even: false)\\n case let k? where k < 0 && -k > j:\\n luckyNumbersRange(j: j, k: k, even: false)\\n case _:\\n fatalError(\\\"Bad args\\\")\\n }\\ncase 3:\\n switch (Int(args[1]), args.last!) {\\n case (nil, \\\"lucky\\\"):\\n jLuckyNumber(j, even: false)\\n case (nil, \\\"evenLucky\\\"):\\n jLuckyNumber(j, even: true)\\n case let (k?, \\\"lucky\\\") where k > 0 && k <= 10_000 && k > j:\\n luckyNumbersKth(j: j, k: k, even: false)\\n case let (k?, \\\"evenLucky\\\") where k > 0 && k <= 10_000 && k > j:\\n luckyNumbersKth(j: j, k: k, even: true)\\n case let (k?, \\\"lucky\\\") where k < 0 && -k > j:\\n luckyNumbersRange(j: j, k: k, even: false)\\n case let (k?, \\\"evenLucky\\\") where k < 0 && -k > j:\\n luckyNumbersRange(j: j, k: k, even: true)\\n case _:\\n fatalError(\\\"Bad args\\\")\\n }\\ncase _:\\n fatalError()\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"#!/usr/bin/env tclsh8.6\\npackage require Tcl 8.6\\n\\nproc lgen {{even false} {nmax 200000}} {\\n coroutine lgen.[incr ::lgen] apply {{start nmax} {\\n\\tset n 1\\n\\tfor {set i $start} {$i <= $nmax+1} {incr i 2} {lappend lst $i}\\n\\tyield [info coroutine]\\n\\tyield [lindex $lst 0]\\n\\twhile {$n < [llength $lst] && [lindex $lst $n] < [llength $lst]} {\\n\\t yield [lindex $lst $n]\\n\\t set lst [set i 0;lmap j $lst {\\n\\t\\tif {[incr i] % [lindex $lst $n]} {set j} else continue\\n\\t }]\\n\\t incr n\\n\\t}\\n\\tforeach i [lrange $lst $n end] {\\n\\t yield $i\\n\\t}\\n }} [expr {$even ? 2 : 1}] $nmax\\n}\\n\\nproc collectIndices {generator from to} {\\n set result {}\\n for {set i 0} {$i <= $to} {incr i} {\\n\\tset n [$generator]\\n\\tif {$i >= $from} {lappend result $n}\\n }\\n rename $generator {}\\n return $result\\n}\\nproc collectValues {generator from to} {\\n set result {}\\n while 1 {\\n\\tset n [$generator]\\n\\tif {$n > $to} break\\n\\tif {$n >= $from} {lappend result $n}\\n }\\n rename $generator {}\\n return $result\\n}\\n\\nif {$argc<1||$argc>3} {\\n puts stderr \\\"wrong # args: should be \\\\\\\"$argv0 from ?to? ?evenOdd?\\\\\\\"\\\"\\n exit 1\\n}\\nlassign $argv from to evenOdd\\nif {$argc < 3} {set evenOdd lucky}\\nif {$argc < 2} {set to ,}\\nif {![string is integer -strict $from] || $from < 1} {\\n puts stderr \\\"\\\\\\\"from\\\\\\\" must be positive integer\\\"\\n exit 1\\n} elseif {$to ne \\\",\\\" && (![string is integer -strict $to] || $to == 0)} {\\n puts stderr \\\"\\\\\\\"to\\\\\\\" must be positive integer or comma\\\"\\n exit 1\\n} elseif {[set evenOdd [string tolower $evenOdd]] ni {lucky evenlucky}} {\\n puts stderr \\\"\\\\\\\"evenOdd\\\\\\\" must be \\\\\\\"lucky\\\\\\\" or \\\\\\\"evenLucky\\\\\\\"\\\"\\n exit 1\\n}\\nset l [lgen [expr {$evenOdd eq \\\"evenlucky\\\"}]]\\nset evenOdd [lindex {\\\"lucky\\\" \\\"even lucky\\\"} [expr {$evenOdd eq \\\"evenlucky\\\"}]]\\nif {$to eq \\\",\\\"} {\\n puts \\\"$from'th $evenOdd number = [collectIndices $l [incr from -1] $from]\\\"\\n} elseif {$to < 0} {\\n set to [expr {-$to}]\\n puts \\\"all $evenOdd numbers from $from to $to: [join [collectValues $l $from $to] ,]\\\"\\n} else {\\n puts \\\"$from'th to $to'th $evenOdd numbers: [join [collectIndices $l [incr from -1] [incr to -1]] ,]\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"os\\\" for Process\\nimport \\\"./iterate\\\" for Stepped\\nimport \\\"./str\\\" for Str\\n\\nvar luckyOdd = List.filled(1e5, 0)\\nvar luckyEven = List.filled(1e5, 0)\\n\\nvar init = Fn.new {\\n for (i in 0...1e5) {\\n luckyOdd[i] = i*2 + 1\\n luckyEven[i] = i*2 + 2\\n }\\n}\\n\\nvar filterLuckyOdd = Fn.new {\\n var n = 2\\n while (n < luckyOdd.count) {\\n var m = luckyOdd[n-1]\\n var end = (luckyOdd.count/m).floor * m - 1\\n for (j in Stepped.descend(end..m-1, m)) luckyOdd.removeAt(j)\\n n = n + 1\\n }\\n}\\n\\nvar filterLuckyEven = Fn.new {\\n var n = 2\\n while (n < luckyEven.count) {\\n var m = luckyEven[n-1]\\n var end = (luckyEven.count/m).floor * m - 1\\n for (j in Stepped.descend(end..m-1, m)) luckyEven.removeAt(j)\\n n = n + 1\\n }\\n}\\n\\nvar printSingle = Fn.new { |j, odd|\\n if (odd) {\\n if (j >= luckyOdd.count) Fiber.abort(\\\"Argument is too big\\\")\\n System.print(\\\"Lucky number %(j) = %(luckyOdd[j-1])\\\")\\n } else {\\n if (j >= luckyEven.count) Fiber.abort(\\\"Argument is too big\\\")\\n System.print(\\\"Lucky even number %(j) = %(luckyEven[j-1])\\\")\\n }\\n}\\n\\nvar printRange = Fn.new { |j, k, odd|\\n if (odd) {\\n if (k >= luckyOdd.count) Fiber.abort(\\\"Argument is too big\\\")\\n var rng = luckyOdd.skip(j-1).take(k-j+1).toList\\n System.print(\\\"Lucky numbers %(j) to %(k) are:\\\\n %(rng)\\\")\\n } else {\\n if (k >= luckyEven.count) Fiber.abort(\\\"Argument is too big\\\")\\n var rng = luckyEven.skip(j-1).take(k-j+1).toList\\n System.print(\\\"Lucky even numbers %(j) to %(k) are:\\\\n %(rng)\\\")\\n }\\n}\\n\\nvar printBetween = Fn.new { |j, k, odd|\\n var rng = []\\n if (odd) {\\n var max = luckyOdd[-1]\\n if (j > max || k > max) {\\n Fiber.abort(\\\"At least one argument is too big\\\")\\n }\\n for (num in luckyOdd) {\\n if (num >= j) {\\n if (num > k) break\\n rng.add(num)\\n }\\n }\\n System.print(\\\"Lucky numbers between %(j) and %(k) are:\\\\n%(rng)\\\")\\n } else {\\n var max = luckyEven[-1]\\n if (j > max || k > max) {\\n Fiber.abort(\\\"At least one argument is too big\\\")\\n }\\n for (num in luckyEven) {\\n if (num >= j) {\\n if (num > k) break\\n rng.add(num)\\n }\\n }\\n System.print(\\\"Lucky even numbers between %(j) and %(k) are:\\\\n%(rng)\\\")\\n }\\n}\\n\\nvar args = Process.arguments\\nvar argsSize = args.count\\nif (argsSize < 1 || argsSize > 3) Fiber.abort(\\\"There must be between 1 and 3 command line arguments\\\")\\ninit.call()\\nfilterLuckyOdd.call()\\nfilterLuckyEven.call()\\nvar j = Num.fromString(args[0])\\nif (j.type != Num || !j.isInteger || j < 1) Fiber.abort(\\\"First argument must be a positive integer\\\")\\nif (argsSize == 1) {\\n printSingle.call(j, true)\\n return\\n}\\n\\nif (argsSize == 2) {\\n var k = Num.fromString(args[1])\\n if (k.type != Num || !k.isInteger) Fiber.abort(\\\"Second argument must be an integer\\\")\\n if (k >= 0) {\\n if (j > k) Fiber.abort(\\\"Second argument can't be less than first\\\")\\n printRange.call(j, k, true)\\n } else {\\n var l = -k\\n if (j > l) Fiber.abort(\\\"The second argument can't be less in absolute value than first\\\")\\n printBetween.call(j, l, true)\\n }\\n return\\n}\\n\\nargs[2] = Str.lower(args[2])\\nvar odd = (args[2] == \\\"lucky\\\") ? true :\\n (args[2] == \\\"evenlucky\\\") ? false : Fiber.abort(\\\"Third argument is invalid\\\")\\n\\nif (args[1] == \\\",\\\") {\\n printSingle.call(j, odd)\\n return\\n}\\n\\nvar k = Num.fromString(args[1])\\nif (!((k.type == Num && k.isInteger) || (k.type == String && k == \\\",\\\"))) {\\n Fiber.abort(\\\"Second argument must be an integer or a comma\\\")\\n}\\nif (k >= 0) {\\n if (j > k) Fiber.abort(\\\"Second argument can't be less than first\\\")\\n printRange.call(j, k, odd)\\n} else {\\n var l = -k\\n if (j > l) Fiber.abort(\\\"The second argument can't be less in absolute value than first\\\")\\n printBetween.call(j, l, odd)\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn lgen(a){\\n ns,idx:=[a..*,2],2;\\n vm.yield(ns.next());\\n while(1){\\n n:=ns.next();\\n vm.yield(n);\\n ns=ns.tweak(skipper.fp1(n,Ref(idx+=1))); // tack on another filter\\n }\\n}\\nfcn skipper(n,skp,cnt){ z:=cnt.inc(); if(z%skp==0) Void.Skip else n }\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"cmdLineArgs,j,k,start:=vm.arglist,Void,Void,1;\\ntry{\\n j=cmdLineArgs[0].toInt();\\n na:=cmdLineArgs.len();\\n if(na>1){\\n if(cmdLineArgs[1]==\\\",\\\")\\n start=cmdLineArgs[2][0].toLower()==\\\"e\\\" and 2 or 1;\\n else{\\n\\t k=cmdLineArgs[1].toInt();\\n\\t if(na>2)\\n\\t start=cmdLineArgs[2][0].toLower()==\\\"e\\\" and 2 or 1;\\n }\\n }\\n}catch{\\n fcn options{\\n \\\"args: j | j , [even]lucky | j k [even]lucky | j -k [even]lucky\\\"\\n .println();\\n System.exit(1);\\n }()\\n}\\nluckies:=Utils.Generator(lgen,start);\\ntry{\\n if(Void==k) luckies.drop(j-1).next().println();\\n else{\\n if(k>0) luckies.drop(j-1).walk(k-j+1).println();\\n else{ k=-k;\\n\\t while((n:=luckies.next())<j){}\\n\\t luckies.push(n);\\n\\t luckies.pump(List,'wrap(n){ n<=k and n or Void.Stop }).println();\\n }\\n }\\n}catch(TheEnd){ options() }\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Lucky-and-even-lucky-numbers"}}},{"rowIdx":454,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Prime Numbers\nfrom: http://rosettacode.org/wiki/Ludic_numbers\nnote: Sieves\n","language":"00-META"},{"code":"[https://oeis.org/wiki/Ludic_numbers Ludic numbers] are related to prime numbers as they are generated by a sieve quite like the [[Sieve of Eratosthenes]] is used to generate prime numbers.\n\nThe first ludic number is <span style=\"color:blue;font-weight:bold\">1</span>.\n\nTo generate succeeding ludic numbers create an array of increasing integers starting from <span style=\"color:blue;font-weight:bold\">2</span>.\n:<code><span style=\"color:blue;font-weight:bold\">2</span> 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ...</code>\n(Loop)\n* Take the first member of the resultant array as the next ludic number <span style=\"color:blue;font-weight:bold\">2</span>.\n* Remove every '''2<sup>nd</sup>''' indexed item from the array (including the first).\n::<code><span style=\"color:blue;font-weight:bold\"><s>2</s></span> 3 <s>4</s> 5 <s>6</s> 7 <s>8</s> 9 <s>10</s> 11 <s>12</s> 13 <s>14</s> 15 <s>16</s> 17 <s>18</s> 19 <s>20</s> 21 <s>22</s> 23 <s>24</s> 25 <s>26</s> ...</code>\n* (Unrolling a few loops...)\n* Take the first member of the resultant array as the next ludic number <span style=\"color:blue;font-weight:bold\">3</span>.\n* Remove every '''3<sup>rd</sup>''' indexed item from the array (including the first).\n::<code><span style=\"color:blue;font-weight:bold\"><s>3</s></span> 5 7 <s>9</s> 11 13 <s>15</s> 17 19 <s>21</s> 23 25 <s>27</s> 29 31 <s>33</s> 35 37 <s>39</s> 41 43 <s>45</s> 47 49 <s>51</s> ...</code>\n* Take the first member of the resultant array as the next ludic number <span style=\"color:blue;font-weight:bold\">5</span>.\n* Remove every '''5<sup>th</sup>''' indexed item from the array (including the first).\n::<code><span style=\"color:blue;font-weight:bold\"><s>5</s></span> 7 11 13 17 <s>19</s> 23 25 29 31 <s>35</s> 37 41 43 47 <s>49</s> 53 55 59 61 <s>65</s> 67 71 73 77 ...</code>\n* Take the first member of the resultant array as the next ludic number <span style=\"color:blue;font-weight:bold\">7</span>.\n* Remove every '''7<sup>th</sup>''' indexed item from the array (including the first).\n::<code><span style=\"color:blue;font-weight:bold\"><s>7</s></span> 11 13 17 23 25 29 <s>31</s> 37 41 43 47 53 55 <s>59</s> 61 67 71 73 77 83 <s>85</s> 89 91 97 ...</code>\n* <big><b> ... </b></big>\n* Take the first member of the current array as the next ludic number <span style=\"color:blue;font-weight:bold\">L</span>.\n* Remove every '''L<sup>th</sup>''' indexed item from the array (including the first).\n* <big><b> ... </b></big>\n\n\n\n;Task:\n* Generate and show here the first 25 ludic numbers.\n* How many ludic numbers are there less than or equal to 1000?\n* Show the 2000..2005<sup>th</sup> ludic numbers.\n\n\n<br>\n;Stretch goal:\nShow all triplets of ludic numbers < 250.\n* A triplet is any three numbers <big><math>x,</math> <math>x+2,</math> <math>x+6</math> </big> where all three numbers are also ludic numbers. \n\n<br><br>\n\n","language":"00-TASK"},{"code":"F ludic(nmax = 100000)\n V r = [1]\n V lst = Array(2..nmax)\n L !lst.empty\n r.append(lst[0])\n [Int] newlst\n V step = lst[0]\n L(i) 0 .< lst.len\n I i % step != 0\n newlst.append(lst[i])\n lst = newlst\n R r\n\nV ludics = ludic()\nprint(‘First 25 ludic primes:’)\nprint(ludics[0.<25])\nprint(\"\\nThere are #. ludic numbers <= 1000\".format(sum(ludics.filter(l -> l <= 1000).map(l -> 1))))\nprint(\"\\n2000'th..2005'th ludic primes:\")\nprint(ludics[2000 - 1 .. 2004])\nV n = 250\nV triplets = ludics.filter(x -> x + 6 < :n &\n x + 2 C :ludics &\n x + 6 C :ludics).map(x -> (x, x + 2, x + 6))\nprint(\"\\nThere are #. triplets less than #.:\\n #.\".format(triplets.len, n, triplets))\n","language":"11l"},{"code":"* Ludic numbers 23/04/2016\nLUDICN CSECT\n USING LUDICN,R15 set base register\n LH R9,NMAX r9=nmax\n SRA R9,1 r9=nmax/2\n LA R6,2 i=2\nLOOPI1 CR R6,R9 do i=2 to nmax/2\n BH ELOOPI1\n LA R1,LUDIC-1(R6) @ludic(i)\n CLI 0(R1),X'01' if ludic(i)\n BNE ELOOPJ1\n SR R8,R8 n=0\n LA R7,1(R6) j=i+1\nLOOPJ1 CH R7,NMAX do j=i+1 to nmax\n BH ELOOPJ1\n LA R1,LUDIC-1(R7) @ludic(j)\n CLI 0(R1),X'01' if ludic(j)\n BNE NOTJ1\n LA R8,1(R8) n=n+1\nNOTJ1 CR R8,R6 if n=i\n BNE NDIFI\n LA R1,LUDIC-1(R7) @ludic(j)\n MVI 0(R1),X'00' ludic(j)=false\n SR R8,R8 n=0\nNDIFI LA R7,1(R7) j=j+1\n B LOOPJ1\nELOOPJ1 LA R6,1(R6) i=i+1\n B LOOPI1\nELOOPI1 XPRNT =C'First 25 ludic numbers:',23\n LA R10,BUF @buf=0\n SR R8,R8 n=0\n LA R6,1 i=1\nLOOPI2 CH R6,NMAX do i=1 to nmax\n BH ELOOPI2\n LA R1,LUDIC-1(R6) @ludic(i)\n CLI 0(R1),X'01' if ludic(i)\n BNE NOTI2\n XDECO R6,XDEC i\n MVC 0(4,R10),XDEC+8 output i\n LA R10,4(R10) @buf=@buf+4\n LA R8,1(R8) n=n+1\n LR R2,R8 n\n SRDA R2,32\n D R2,=F'5' r2=mod(n,5)\n LTR R2,R2 if mod(n,5)=0\n BNZ NOTI2\n XPRNT BUF,20\n LA R10,BUF @buf=0\nNOTI2 EQU *\n CH R8,=H'25' if n=25\n BE ELOOPI2\n LA R6,1(R6) i=i+1\n B LOOPI2\nELOOPI2 MVC BUF(25),=C'Ludic numbers below 1000:'\n SR R8,R8 n=0\n LA R6,1 i=1\nLOOPI3 CH R6,=H'999' do i=1 to 999\n BH ELOOPI3\n LA R1,LUDIC-1(R6) @ludic(i)\n CLI 0(R1),X'01' if ludic(i)\n BNE NOTI3\n LA R8,1(R8) n=n+1\nNOTI3 LA R6,1(R6) i=i+1\n B LOOPI3\nELOOPI3 XDECO R8,XDEC edit n\n MVC BUF+25(6),XDEC+6 output n\n XPRNT BUF,31 print buffer\n MVC BUF(80),=CL80'Ludic numbers 2000 to 2005:'\n LA R10,BUF+28 @buf=28\n SR R8,R8 n=0\n LA R6,1 i=1\nLOOPI4 CH R6,NMAX do i=1 to nmax\n BH ELOOPI4\n LA R1,LUDIC-1(R6) @ludic(i)\n CLI 0(R1),X'01' if ludic(i)\n BNE NOTI4\n LA R8,1(R8) n=n+1\n CH R8,=H'2000' if n>=2000\n BL NOTI4\n XDECO R6,XDEC edit i\n MVC 0(6,R10),XDEC+6 output i\n LA R10,6(R10) @buf=@buf+6\n CH R8,=H'2005' if n=2005\n BE ELOOPI4\nNOTI4 LA R6,1(R6) i=i+1\n B LOOPI4\nELOOPI4 XPRNT BUF,80 print buffer\n XPRNT =C'Ludic triplets below 250:',25\n LA R6,1 i=1\nLOOPI5 CH R6,=H'243' do i=1 to 243\n BH ELOOPI5\n LA R1,LUDIC-1(R6) @ludic(i)\n CLI 0(R1),X'01' if ludic(i)\n BNE ITERI5\n LA R1,LUDIC+1(R6) @ludic(i+2)\n CLI 0(R1),X'01' if ludic(i+2)\n BNE ITERI5\n LA R1,LUDIC+5(R6) @ludic(i+6)\n CLI 0(R1),X'01' if ludic(i+6)\n BNE ITERI5\n MVC BUF+0(1),=C'[' [\n XDECO R6,XDEC edit i\n MVC BUF+1(4),XDEC+8 output i\n LA R2,2(R6) i+2\n XDECO R2,XDEC edit i+2\n MVC BUF+5(4),XDEC+8 output i+2\n LA R2,6(R6) i+6\n XDECO R2,XDEC edit i+6\n MVC BUF+9(4),XDEC+8 output i+6\n MVC BUF+13(1),=C']' ]\n XPRNT BUF,14 print buffer\nITERI5 LA R6,1(R6) i=i+1\n B LOOPI5\nELOOPI5 XR R15,R15 set return code\n BR R14 return to caller\n LTORG\nBUF DS CL80 buffer\nXDEC DS CL12 decimal editor\nNMAX DC H'25000' nmax\nLUDIC DC 25000X'01' ludic(nmax)=true\n YREGS\n END LUDICN\n","language":"360-Assembly"},{"code":"CLASS lcl_ludic DEFINITION CREATE PUBLIC.\n\n PUBLIC SECTION.\n TYPES: t_ludics TYPE SORTED TABLE OF i WITH UNIQUE KEY table_line.\n TYPES: BEGIN OF t_triplet,\n i1 TYPE i,\n i2 TYPE i,\n i3 TYPE i,\n END OF t_triplet.\n TYPES: t_triplets TYPE STANDARD TABLE OF t_triplet WITH EMPTY KEY.\n\n CLASS-METHODS:\n ludic_up_to\n IMPORTING i_int TYPE i\n RETURNING VALUE(r_ludics) TYPE t_ludics,\n get_triplets\n IMPORTING i_ludics TYPE t_ludics\n RETURNING VALUE(r_triplets) TYPE t_triplets.\n\n \"RETURNING parameters (CallByValue) only used for readability of the demo\n \"in \"Real Life\" you should use EXPORTING (CallByRef) for tables\n\nENDCLASS.\n\ncl_demo_output=>begin_section( 'First 25 Ludics' ).\ncl_demo_output=>write( lcl_ludic=>ludic_up_to( 110 ) ).\n\ncl_demo_output=>begin_section( 'Ludics up to 1000' ).\ncl_demo_output=>write( lines( lcl_ludic=>ludic_up_to( 1000 ) ) ).\n\ncl_demo_output=>begin_section( '2000th - 2005th Ludics' ).\nDATA(ludics) = lcl_ludic=>ludic_up_to( 22000 ).\ncl_demo_output=>write( VALUE lcl_ludic=>t_ludics( FOR i = 2000 WHILE i <= 2005 ( ludics[ i ] ) ) ).\n\ncl_demo_output=>begin_section( 'Triplets up to 250' ).\ncl_demo_output=>write( lcl_ludic=>get_triplets( lcl_ludic=>ludic_up_to( 250 ) ) ).\n\ncl_demo_output=>display( ).\n\nCLASS lcl_ludic IMPLEMENTATION.\n\n METHOD ludic_up_to.\n\n r_ludics = VALUE #( FOR i = 2 WHILE i <= i_int ( i ) ).\n\n DATA(cursor) = 0.\n\n WHILE cursor < lines( r_ludics ).\n\n cursor = cursor + 1.\n DATA(this_ludic) = r_ludics[ cursor ].\n DATA(remove_cursor) = cursor + this_ludic.\n\n WHILE remove_cursor <= lines( r_ludics ).\n DELETE r_ludics INDEX remove_cursor.\n remove_cursor = remove_cursor + this_ludic - 1.\n ENDWHILE.\n\n ENDWHILE.\n\n INSERT 1 INTO TABLE r_ludics. \"add one as the first Ludic number (per definition)\n\n ENDMETHOD.\n\n METHOD get_triplets.\n\n DATA(i) = 0.\n WHILE i < lines( i_ludics ) - 2.\n i = i + 1.\n\n DATA(this_ludic) = i_ludics[ i ].\n IF line_exists( i_ludics[ table_line = this_ludic + 2 ] )\n AND line_exists( i_ludics[ table_line = this_ludic + 6 ] ).\n r_triplets = VALUE #(\n BASE r_triplets\n ( i1 = i_ludics[ table_line = this_ludic ]\n i2 = i_ludics[ table_line = this_ludic + 2 ]\n i3 = i_ludics[ table_line = this_ludic + 6 ]\n )\n ).\n ENDIF.\n\n ENDWHILE.\n\n ENDMETHOD.\n\nENDCLASS.\n","language":"ABAP"},{"code":"DEFINE NOTLUDIC=\"0\"\nDEFINE LUDIC=\"1\"\nDEFINE UNKNOWN=\"2\"\n\nPROC LudicSieve(BYTE ARRAY a INT count)\n INT i,j,k\n\n SetBlock(a,count,UNKNOWN)\n a(0)=NOTLUDIC\n a(1)=LUDIC\n\n i=2\n WHILE i<count\n DO\n IF a(i)=UNKNOWN THEN\n a(i)=LUDIC\n j=i k=0\n WHILE j<count\n DO\n IF a(j)=UNKNOWN THEN\n k==+1\n IF k=i THEN\n a(j)=NOTLUDIC\n k=0\n FI\n FI\n j==+1\n OD\n FI\n i==+1\n Poke(77,0) ;turn off the attract mode\n OD\nRETURN\n\nPROC PrintLudicNumbers(BYTE ARRAY a INT count,first,last)\n INT i,j\n\n i=1 j=0\n WHILE i<count AND j<=last\n DO\n IF a(i)=LUDIC THEN\n IF j>=first THEN\n PrintI(i) Put(32)\n FI\n j==+1\n FI\n i==+1\n OD\n PutE() PutE()\nRETURN\n\nINT FUNC CountLudicNumbers(BYTE ARRAY a INT max)\n INT i,res\n\n res=0\n FOR i=1 TO max\n DO\n IF a(i)=LUDIC THEN\n res==+1\n FI\n OD\nRETURN (res)\n\nPROC PrintLudicTriplets(BYTE ARRAY a INT max)\n INT i,j\n\n j=0\n FOR i=0 TO max-6\n DO\n IF a(i)=LUDIC AND a(i+2)=LUDIC AND a(i+6)=LUDIC THEN\n j==+1\n PrintF(\"%I. %I-%I-%I%E\",j,i,i+2,i+6)\n FI\n OD\nRETURN\n\nPROC Main()\n DEFINE COUNT=\"22000\"\n BYTE ARRAY lud(COUNT+1)\n INT i,n\n\n PrintE(\"Please wait...\")\n LudicSieve(lud,COUNT+1)\n Put(125) PutE() ;clear the screen\n\n PrintE(\"First 25 ludic numbers:\")\n PrintLudicNumbers(lud,COUNT+1,0,24)\n\n n=CountLudicNumbers(lud,1000)\n PrintF(\"There are %I ludic numbers <= 1000%E%E\",n)\n\n PrintE(\"2000'th..2005'th ludic numbers:\")\n PrintLudicNumbers(lud,COUNT+1,1999,2004)\n\n PrintE(\"Ludic triplets below 250\")\n PrintLudicTriplets(lud,249)\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_IO;\nwith Ada.Containers.Vectors;\n\nprocedure Ludic_Numbers is\n\n package Lucid_Lists is\n new Ada.Containers.Vectors (Positive, Natural);\n use Lucid_Lists;\n\n List : Vector;\n\n procedure Fill is\n use type Ada.Containers.Count_Type;\n Vec : Vector;\n Lucid : Natural;\n Index : Positive;\n begin\n Append (List, 1);\n\n for I in 2 .. 22_000 loop\n Append (Vec, I);\n end loop;\n\n loop\n Lucid := First_Element (Vec);\n Append (List, Lucid);\n\n Index := First_Index (Vec);\n loop\n Delete (Vec, Index);\n Index := Index + Lucid - 1;\n exit when Index > Last_Index (Vec);\n end loop;\n\n exit when Length (Vec) <= 1;\n end loop;\n\n end Fill;\n\n procedure Put_Lucid (First, Last : in Natural) is\n use Ada.Text_IO;\n begin\n Put_Line (\"Lucid numbers \" & First'Image & \" to \" & Last'Image & \":\");\n for I in First .. Last loop\n Put (Natural'(List (I))'Image);\n end loop;\n New_Line;\n end Put_Lucid;\n\n procedure Count_Lucid (Below : in Natural) is\n Count : Natural := 0;\n begin\n for Lucid of List loop\n if Lucid <= Below then\n Count := Count + 1;\n end if;\n end loop;\n Ada.Text_IO.Put_Line (\"There are \" & Count'Image & \" lucid numbers <=\" & Below'Image);\n end Count_Lucid;\n\n procedure Find_Triplets (Limit : in Natural) is\n\n function Is_Lucid (Value : in Natural) return Boolean is\n begin\n for X in 1 .. Limit loop\n if List (X) = Value then\n return True;\n end if;\n end loop;\n return False;\n end Is_Lucid;\n\n use Ada.Text_IO;\n Index : Natural;\n Lucid : Natural;\n begin\n Put_Line (\"All triplets of lucid numbers <\" & Limit'Image);\n Index := First_Index (List);\n while List (Index) < Limit loop\n Lucid := List (Index);\n if Is_Lucid (Lucid + 2) and Is_Lucid (Lucid + 6) then\n Put (\"(\");\n Put (Lucid'Image);\n Put (Natural'(Lucid + 2)'Image);\n Put (Natural'(Lucid + 6)'Image);\n Put_Line (\")\");\n end if;\n Index := Index + 1;\n end loop;\n end Find_Triplets;\n\nbegin\n Fill;\n Put_Lucid (First => 1,\n Last => 25);\n Count_Lucid (Below => 1000);\n Put_Lucid (First => 2000,\n Last => 2005);\n Find_Triplets (Limit => 250);\nend Ludic_Numbers;\n","language":"Ada"},{"code":"# find some Ludic numbers #\n\n# sieve the Ludic numbers up to 30 000 #\nINT max number = 30 000;\n[ 1 : max number ]INT candidates;\nFOR n TO UPB candidates DO candidates[ n ] := n OD;\nFOR n FROM 2 TO UPB candidates OVER 2 DO\n IF candidates[ n ] /= 0 THEN\n # have a ludic number #\n INT number count := -1;\n FOR remove pos FROM n TO UPB candidates DO\n IF candidates[ remove pos ] /= 0 THEN\n # have a number we haven't elminated yet #\n number count +:= 1;\n IF number count = n THEN\n # this number should be removed #\n candidates[ remove pos ] := 0;\n number count := 0\n FI\n FI\n OD\n FI\nOD;\n# show some Ludic numbers and counts #\nprint( ( \"Ludic numbers: \" ) );\nINT ludic count := 0;\nFOR n TO UPB candidates DO\n IF candidates[ n ] /= 0 THEN\n # have a ludic number #\n ludic count +:= 1;\n IF ludic count < 26 THEN\n # this is one of the first few Ludic numbers #\n print( ( \" \", whole( n, 0 ) ) );\n IF ludic count = 25 THEN\n print( ( \" ...\", newline ) )\n FI\n FI;\n IF ludic count = 2000 THEN\n print( ( \"Ludic numbers 2000-2005: \", whole( n, 0 ) ) )\n ELIF ludic count > 2000 AND ludic count < 2006 THEN\n print( ( \" \", whole( n, 0 ) ) );\n IF ludic count = 2005 THEN\n print( ( newline ) )\n FI\n FI\n FI;\n IF n = 1000 THEN\n # count ludic numbers up to 1000 #\n print( ( \"There are \", whole( ludic count, 0 ), \" Ludic numbers up to 1000\", newline ) )\n FI\nOD;\n# find the Ludic triplets below 250 #\nprint( ( \"Ludic triplets below 250:\", newline ) );\nFOR n TO 250 - 6 DO\n IF candidates[ n ] /= 0 AND candidates[ n + 2 ] /= 0 AND candidates[ n + 6 ] /= 0 THEN\n # have a triplet #\n print( ( \" \", whole( n, -3 ), \", \", whole( n + 2, -3 ), \", \", whole( n + 6, -3 ), newline ) )\n FI\nOD\n","language":"ALGOL-68"},{"code":"-- Generate a list of the ludic numbers up to and including n.\non ludicsTo(n)\n if (n < 1) then return {}\n -- Start with an array of numbers from 2 to n and a ludic collection already containing 1.\n script o\n property array : {}\n property ludics : {1}\n end script\n repeat with i from 2 to n\n set end of o's array to i\n end repeat\n -- Collect ludics and sieve the array until a ludic matches or exceeds the remaining\n -- array length, at which point the array contains just the remaining ludics.\n set thisLudic to 2\n set arrayLength to n - 1\n repeat while (thisLudic < arrayLength)\n set end of o's ludics to thisLudic\n repeat with i from 1 to arrayLength by thisLudic\n set item i of o's array to missing value\n end repeat\n set o's array to o's array's numbers\n set thisLudic to beginning of o's array\n set arrayLength to (count o's array)\n end repeat\n\n return (o's ludics) & (o's array)\nend ludicsTo\n\non doTask()\n script o\n property ludics : ludicsTo(22000)\n end script\n\n set output to {}\n set astid to AppleScript's text item delimiters\n set AppleScript's text item delimiters to \", \"\n set end of output to \"First 25 ludic numbers:\"\n set end of output to (items 1 thru 25 of o's ludics) as text\n repeat with i from 1 to (count o's ludics)\n if (item i of o's ludics > 1000) then exit repeat\n end repeat\n set end of output to \"There are \" & (i - 1) & \" ludic numbers ≤ 1000.\"\n set end of output to \"2000th-2005th ludic numbers:\"\n set end of output to (items 2000 thru 2005 of o's ludics) as text\n set end of output to \"Triplets < 250:\"\n set triplets to {}\n repeat with x in o's ludics\n set x to x's contents\n if (x > 243) then exit repeat\n if ((x + 2) is in o's ludics) and ((x + 6) is in o's ludics) then\n set end of triplets to \"{\" & {x, x + 2, x + 6} & \"}\"\n end if\n end repeat\n set end of output to triplets as text\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 doTask\n\nreturn doTask()\n","language":"AppleScript"},{"code":"\"First 25 ludic numbers:\n1, 2, 3, 5, 7, 11, 13, 17, 23, 25, 29, 37, 41, 43, 47, 53, 61, 67, 71, 77, 83, 89, 91, 97, 107\nThere are 142 ludic numbers ≤ 1000.\n2000th-2005th ludic numbers:\n21475, 21481, 21487, 21493, 21503, 21511\nTriplets < 250:\n{1, 3, 7}, {5, 7, 11}, {11, 13, 17}, {23, 25, 29}, {41, 43, 47}, {173, 175, 179}, {221, 223, 227}, {233, 235, 239}\"\n","language":"AppleScript"},{"code":"ludicGen: function [nmax][\n result: [1]\n lst: new 2..nmax+1\n i: 0\n worked: false\n while [and? [not? empty? lst] [i < size lst]][\n item: lst\\[i]\n result: result ++ item\n del: 0\n worked: false\n while [del < size lst][\n worked: true\n remove 'lst .index del\n del: dec del + item\n ]\n if not? worked -> i: i + 1\n ]\n return result\n]\n\nludics: ludicGen 25000\n\nprint \"The first 25 ludic numbers:\"\nprint first.n: 25 ludics\n\nleThan1000: select ludics => [& =< 1000]\nprint [\"\\nThere are\" size leThan1000 \"ludic numbers less than/or equal to 1000\\n\"]\n\nprint [\"The ludic numbers from 2000th to 2005th are:\" slice ludics 1999 2004 \"\\n\"]\n\nprint \"The triplets of ludic numbers less than 250 are:\"\nprint map select ludics 'x [\n all? @[ x < 250\n contains? ludics x+2\n contains? ludics x+6\n ]\n] 't -> @[t, t+2, t+6]\n","language":"Arturo"},{"code":"#NoEnv\nSetBatchLines, -1\nLudic := LudicSieve(22000)\n\nLoop, 25 ; the first 25 ludic numbers\n\tTask1 .= Ludic[A_Index] \" \"\n\nfor i, Val in Ludic ; the number of ludic numbers less than or equal to 1000\n\tif (Val <= 1000)\n\t\tTask2++\n\telse\n\t\tbreak\n\nLoop, 6 ; the 2000..2005'th ludic numbers\n\tTask3 .= Ludic[1999 + A_Index] \" \"\n\nfor i, Val in Ludic { ; all triplets of ludic numbers < 250\n\tif (Val + 6 > 249)\n\t\tbreak\n\tif (Ludic[i + 1] = Val + 2 && Ludic[i + 2] = Val + 6 || i = 1)\n\t\tTask4 .= \"(\" Val \" \" Val + 2 \" \" Val + 6 \") \"\n}\n\nMsgBox, % \"First 25:`t`t\" Task1\n\t. \"`nLudics below 1000:`t\" Task2\n\t. \"`nLudic 2000 to 2005:`t\" Task3\n\t. \"`nTriples below 250:`t\" Task4\nreturn\n\nLudicSieve(Limit) {\n\tArr := [], Ludic := []\n\tLoop, % Limit\n\t\tArr.Insert(A_Index)\n\tLudic.Insert(Arr.Remove(1))\n\twhile Arr.MaxIndex() != 1 {\n\t\tLudic.Insert(n := Arr.Remove(1))\n\t\t, Removed := 0\n\t\tLoop, % Arr.MaxIndex() // n {\n\t\t\tArr.Remove(A_Index * n - Removed)\n\t\t\t, Removed++\n\t\t}\n\t}\n\tLudic.Insert(Arr[1])\n\treturn Ludic\n}\n","language":"AutoHotkey"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n\ntypedef unsigned uint;\ntypedef struct { uint i, v; } filt_t;\n\n// ludics with at least so many elements and reach at least such value\nuint* ludic(uint min_len, uint min_val, uint *len)\n{\n\tuint cap, i, v, active = 1, nf = 0;\n\tfilt_t *f = calloc(cap = 2, sizeof(*f));\n\tf[1].i = 4;\n\n\tfor (v = 1; ; ++v) {\n\t\tfor (i = 1; i < active && --f[i].i; i++);\n\n\t\tif (i < active)\n\t\t\tf[i].i = f[i].v;\n\t\telse if (nf == f[i].i)\n\t\t\tf[i].i = f[i].v, ++active; // enable one more filter\n\t\telse {\n\t\t\tif (nf >= cap)\n\t\t\t\tf = realloc(f, sizeof(*f) * (cap*=2));\n\t\t\tf[nf] = (filt_t){ v + nf, v };\n\t\t\tif (++nf >= min_len && v >= min_val) break;\n\t\t}\n\t}\n\n\t// pack the sequence into a uint[]\n\t// filt_t struct was used earlier for cache locality in loops\n\tuint *x = (void*) f;\n\tfor (i = 0; i < nf; i++) x[i] = f[i].v;\n\tx = realloc(x, sizeof(*x) * nf);\n\n\t*len = nf;\n\treturn x;\n}\n\nint find(uint *a, uint v)\n{\n\tuint i;\n\tfor (i = 0; a[i] <= v; i++)\n\t\tif (v == a[i]) return 1;\n\treturn 0;\n}\n\nint main(void)\n{\n\tuint len, i, *x = ludic(2005, 1000, &len);\n\n\tprintf(\"First 25:\");\n\tfor (i = 0; i < 25; i++) printf(\" %u\", x[i]);\n\tputchar('\\n');\n\n\tfor (i = 0; x[i] <= 1000; i++);\n\tprintf(\"Ludics below 1000: %u\\n\", i);\n\n\tprintf(\"Ludic 2000 to 2005:\");\n\tfor (i = 2000; i <= 2005; i++) printf(\" %u\", x[i - 1]);\n\tputchar('\\n');\n\n\tprintf(\"Triples below 250:\");\n\tfor (i = 0; x[i] + 6 <= 250; i++)\n\t\tif (find(x, x[i] + 2) && find(x, x[i] + 6))\n\t\t\tprintf(\" (%u %u %u)\", x[i], x[i] + 2, x[i] + 6);\n\n\tputchar('\\n');\n\n\tfree(x);\n\treturn 0;\n}\n","language":"C"},{"code":"#include <vector>\n#include <iostream>\nusing namespace std;\n\nclass ludic\n{\npublic:\n void ludicList()\n {\n _list.push_back( 1 );\n\n vector<int> v;\n for( int x = 2; x < 22000; x++ )\n v.push_back( x );\n\n while( true )\n {\n vector<int>::iterator i = v.begin();\n int z = *i;\n _list.push_back( z );\n\n while( true )\n {\n i = v.erase( i );\n if( distance( i, v.end() ) <= z - 1 ) break;\n advance( i, z - 1 );\n }\n if( v.size() < 1 ) return;\n }\n }\n\n void show( int s, int e )\n {\n for( int x = s; x < e; x++ )\n cout << _list[x] << \" \";\n }\n\n void findTriplets( int e )\n {\n int lu, x = 0;\n while( _list[x] < e )\n {\n lu = _list[x];\n if( inList( lu + 2 ) && inList( lu + 6 ) )\n cout << \"(\" << lu << \" \" << lu + 2 << \" \" << lu + 6 << \")\\n\";\n x++;\n }\n }\n\n int count( int e )\n {\n int x = 0, c = 0;\n while( _list[x++] <= 1000 ) c++;\n return c;\n }\n\nprivate:\n bool inList( int lu )\n {\n for( int x = 0; x < 250; x++ )\n if( _list[x] == lu ) return true;\n return false;\n }\n\n vector<int> _list;\n};\n\nint main( int argc, char* argv[] )\n{\n ludic l;\n l.ludicList();\n cout << \"first 25 ludic numbers:\" << \"\\n\";\n l.show( 0, 25 );\n cout << \"\\n\\nThere are \" << l.count( 1000 ) << \" ludic numbers <= 1000\" << \"\\n\";\n cout << \"\\n2000 to 2005'th ludic numbers:\" << \"\\n\";\n l.show( 1999, 2005 );\n cout << \"\\n\\nall triplets of ludic numbers < 250:\" << \"\\n\";\n l.findTriplets( 250 );\n cout << \"\\n\\n\";\n return system( \"pause\" );\n}\n","language":"C++"},{"code":"using System;\nusing System.Linq;\nusing System.Collections.Generic;\n\npublic class Program\n{\n public static void Main()\n {\n Console.WriteLine(\"First 25 ludic numbers:\");\n Console.WriteLine(string.Join(\", \", LudicNumbers(150).Take(25)));\n Console.WriteLine();\n\n Console.WriteLine($\"There are {LudicNumbers(1001).Count()} ludic numbers below 1000\");\n Console.WriteLine();\n\n foreach (var ludic in LudicNumbers(22000).Skip(1999).Take(6)\n .Select((n, i) => $\"#{i+2000} = {n}\")) {\n Console.WriteLine(ludic);\n }\n Console.WriteLine();\n\n Console.WriteLine(\"Triplets below 250:\");\n var queue = new Queue<int>(5);\n foreach (int x in LudicNumbers(255)) {\n if (queue.Count == 5) queue.Dequeue();\n queue.Enqueue(x);\n if (x - 6 < 250 && queue.Contains(x - 6) && queue.Contains(x - 4)) {\n Console.WriteLine($\"{x-6}, {x-4}, {x}\");\n }\n }\n }\n\n public static IEnumerable<int> LudicNumbers(int limit) {\n yield return 1;\n //Like a linked list, but with value types.\n //Create 2 extra entries at the start to avoid ugly index calculations\n //and another at the end to avoid checking for index-out-of-bounds.\n Entry[] values = Enumerable.Range(0, limit + 1).Select(n => new Entry(n)).ToArray();\n for (int i = 2; i < limit; i = values[i].Next) {\n yield return values[i].N;\n int start = i;\n while (start < limit) {\n Unlink(values, start);\n for (int step = 0; step < i && start < limit; step++)\n start = values[start].Next;\n }\n }\n }\n\n static void Unlink(Entry[] values, int index) {\n values[values[index].Prev].Next = values[index].Next;\n values[values[index].Next].Prev = values[index].Prev;\n }\n\n}\n\nstruct Entry\n{\n public Entry(int n) : this() {\n N = n;\n Prev = n - 1;\n Next = n + 1;\n }\n\n public int N { get; }\n public int Prev { get; set; }\n public int Next { get; set; }\n}\n","language":"C-sharp"},{"code":"(defn ints-from [n]\n (cons n (lazy-seq (ints-from (inc n)))))\n\n(defn drop-nth [n seq]\n (cond\n (zero? n) seq\n (empty? seq) []\n :else (concat (take (dec n) seq) (lazy-seq (drop-nth n (drop n seq))))))\n\n(def ludic ((fn ludic\n ([] (ludic 1))\n ([n] (ludic n (ints-from (inc n))))\n ([n [f & r]] (cons n (lazy-seq (ludic f (drop-nth f r))))))))\n\n(defn ludic? [n] (= (first (filter (partial <= n) ludic)) n))\n\n(print \"First 25: \")\n(println (take 25 ludic))\n(print \"Count below 1000: \")\n(println (count (take-while (partial > 1000) ludic)))\n(print \"2000th through 2005th: \")\n(println (map (partial nth ludic) (range 1999 2005)))\n(print \"Triplets < 250: \")\n(println (filter (partial every? ludic?)\n (for [i (range 250)] (list i (+ i 2) (+ i 6)))))\n","language":"Clojure"},{"code":"(defun ludic-numbers (max &optional n)\n (loop with numbers = (make-array (1+ max) :element-type 'boolean :initial-element t)\n for i from 2 to max\n until (and n (= num-results (1- n))) ; 1 will be added at the end\n when (aref numbers i)\n collect i into results\n and count t into num-results\n and do (loop for j from i to max\n count (aref numbers j) into counter\n when (= (mod counter i) 1)\n do (setf (aref numbers j) nil))\n finally (return (cons 1 results))))\n\n(defun main ()\n (format t \"First 25 ludic numbers:~%\")\n (format t \"~{~D~^ ~}~%\" (ludic-numbers 100 25))\n (terpri)\n (format t \"How many ludic numbers <= 1000?~%\")\n (format t \"~D~%\" (length (ludic-numbers 1000)))\n (terpri)\n (let ((numbers (ludic-numbers 30000 2005)))\n (format t \"~{#~D: ~D~%~}\"\n (mapcan #'list '(2000 2001 2002 2003 2004 2005) (nthcdr 1999 numbers))))\n (terpri)\n (loop with numbers = (ludic-numbers 250)\n initially (format t \"Triplets:~%\")\n for x in numbers\n when (and (find (+ x 2) numbers)\n (find (+ x 6) numbers))\n do (format t \"~3D ~3D ~3D~%\" x (+ x 2) (+ x 6))))\n","language":"Common-Lisp"},{"code":"struct Ludics(T) {\n int opApply(int delegate(in ref T) dg) {\n int result;\n T[] rotor, taken = [T(1)];\n result = dg(taken[0]);\n if (result) return result;\n\n for (T i = 2; ; i++) { // Shoud be stopped if T has a max.\n size_t j = 0;\n for (; j < rotor.length; j++)\n if (!--rotor[j])\n break;\n\n if (j < rotor.length) {\n rotor[j] = taken[j + 1];\n } else {\n result = dg(i);\n if (result) return result;\n taken ~= i;\n rotor ~= taken[j + 1];\n }\n }\n }\n}\n\nvoid main() {\n import std.stdio, std.range, std.algorithm;\n\n // std.algorithm.take can't be used here.\n uint[] L;\n foreach (const x; Ludics!uint())\n if (L.length < 2005)\n L ~= x;\n else\n break;\n\n writeln(\"First 25 ludic primes:\\n\", L.take(25));\n writefln(\"\\nThere are %d ludic numbers <= 1000.\",\n L.until!q{ a > 1000 }.walkLength);\n\n writeln(\"\\n2000'th .. 2005'th ludic primes:\\n\", L[1999 .. 2005]);\n\n enum m = 250;\n const triplets = L.filter!(x => x + 6 < m &&\n L.canFind(x + 2) && L.canFind(x + 6))\n // Ugly output:\n //.map!(x => tuple(x, x + 2, x + 6)).array;\n .map!(x => [x, x + 2, x + 6]).array;\n writefln(\"\\nThere are %d triplets less than %d:\\n%s\",\n triplets.length, m, triplets);\n}\n","language":"D"},{"code":"struct Ludics(T) {\n T[] rotor, taken = [T(1)];\n T i;\n size_t j;\n T front = 1; // = taken[0];\n bool running = false;\n static immutable bool empty = false;\n\n void popFront() pure nothrow @safe {\n if (running)\n goto RESUME;\n else\n running = true;\n\n i = 2;\n while (true) {\n j = 0;\n\n while (j < rotor.length) {\n rotor[j]--;\n if (!rotor[j])\n break;\n j++;\n }\n if (j < rotor.length) {\n rotor[j] = taken[j + 1];\n } else {\n front = i;\n return;\n RESUME:\n taken ~= i;\n rotor ~= taken[j + 1];\n }\n i++; // Could overflow if T has a max.\n }\n }\n}\n\nvoid main() {\n import std.stdio, std.range, std.algorithm, std.array;\n\n Ludics!uint L;\n writeln(\"First 25 ludic primes:\\n\", L.take(25));\n writefln(\"\\nThere are %d ludic numbers <= 1000.\",\n L.until!q{ a > 1000 }.walkLength);\n\n writeln(\"\\n2000'th .. 2005'th ludic primes:\\n\", L.drop(1999).take(6));\n\n enum uint m = 250;\n const few = L.until!(x => x > m).array;\n const triplets = few.filter!(x => x + 6 < m && few.canFind(x + 2)\n && few.canFind(x + 6))\n // Ugly output:\n //.map!(x => tuple(x, x + 2, x + 6)).array;\n .map!(x => [x, x + 2, x + 6]).array;\n writefln(\"\\nThere are %d triplets less than %d:\\n%s\",\n triplets.length, m, triplets);\n}\n","language":"D"},{"code":"void main() {\n import std.stdio, std.range, std.algorithm, std.concurrency;\n\n Generator!T ludics(T)() {\n return new typeof(return)({\n T[] rotor, taken = [T(1)];\n yield(taken[0]);\n\n for (T i = 2; ; i++) { // Shoud be stopped if T has a max.\n size_t j = 0;\n for (; j < rotor.length; j++)\n if (!--rotor[j])\n break;\n\n if (j < rotor.length) {\n rotor[j] = taken[j + 1];\n } else {\n yield(i);\n taken ~= i;\n rotor ~= taken[j + 1];\n }\n }\n });\n }\n\n const L = ludics!uint.take(2005).array;\n\n writeln(\"First 25 ludic primes:\\n\", L.take(25));\n writefln(\"\\nThere are %d ludic numbers <= 1000.\",\n L.until!q{ a > 1000 }.walkLength);\n\n writeln(\"\\n2000'th .. 2005'th ludic primes:\\n\", L[1999 .. 2005]);\n\n enum m = 250;\n const triplets = L.filter!(x => x + 6 < m &&\n L.canFind(x + 2) && L.canFind(x + 6))\n // Ugly output:\n //.map!(x => tuple(x, x + 2, x + 6)).array;\n .map!(x => [x, x + 2, x + 6]).array;\n writefln(\"\\nThere are %d triplets less than %d:\\n%s\",\n triplets.length, m, triplets);\n}\n","language":"D"},{"code":"class\n\tLUDIC_NUMBERS\n\ncreate\n\tmake\n\nfeature\n\n\tmake (n: INTEGER)\n\t\t\t-- Initialized arrays for find_ludic_numbers.\n\t\trequire\n\t\t\tn_positive: n > 0\n\t\tlocal\n\t\t\ti: INTEGER\n\t\tdo\n\t\t\tcreate initial.make_filled (0, 1, n - 1)\n\t\t\tcreate ludic_numbers.make_filled (1, 1, 1)\n\t\t\tfrom\n\t\t\t\ti := 2\n\t\t\tuntil\n\t\t\t\ti > n\n\t\t\tloop\n\t\t\t\tinitial.put (i, i - 1)\n\t\t\t\ti := i + 1\n\t\t\tend\n\t\t\tfind_ludic_numbers\n\t\tend\n\n\tludic_numbers: ARRAY [INTEGER]\n\nfeature {NONE}\n\n\tinitial: ARRAY [INTEGER]\n\n\tfind_ludic_numbers\n\t\t\t-- Ludic numbers in array ludic_numbers.\n\t\tlocal\n\t\t\tcount: INTEGER\n\t\t\tnew_array: ARRAY [INTEGER]\n\t\t\tlast: INTEGER\n\t\tdo\n\t\t\tcreate new_array.make_from_array (initial)\n\t\t\tlast := initial.count\n\t\t\tfrom\n\t\t\t\tcount := 1\n\t\t\tuntil\n\t\t\t\tcount > last\n\t\t\tloop\n\t\t\t\tif ludic_numbers [ludic_numbers.count] /= new_array [1] then\n\t\t\t\t\tludic_numbers.force (new_array [1], count + 1)\n\t\t\t\tend\n\t\t\t\tnew_array := delete_i_elements (new_array)\n\t\t\t\tcount := count + 1\n\t\t\tend\n\t\tend\n\n\tdelete_i_elements (ar: ARRAY [INTEGER]): ARRAY [INTEGER]\n\t\t\t--- Array with all multiples of 'ar[1]' deleted.\n\t\trequire\n\t\t\tar_not_empty: ar.count > 0\n\t\tlocal\n\t\t\ts_array: ARRAY [INTEGER]\n\t\t\ti, k: INTEGER\n\t\t\tlength: INTEGER\n\t\tdo\n\t\t\tcreate s_array.make_empty\n\t\t\tlength := ar.count\n\t\t\tfrom\n\t\t\t\ti := 0\n\t\t\t\tk := 1\n\t\t\tuntil\n\t\t\t\ti = length\n\t\t\tloop\n\t\t\t\tif (i) \\\\ (ar [1]) /= 0 then\n\t\t\t\t\ts_array.force (ar [i + 1], k)\n\t\t\t\t\tk := k + 1\n\t\t\t\tend\n\t\t\t\ti := i + 1\n\t\t\tend\n\t\t\tif s_array.count = 0 then\n\t\t\t\tResult := ar\n\t\t\telse\n\t\t\t\tResult := s_array\n\t\t\tend\n\t\tensure\n\t\t\tnot_empty: not Result.is_empty\n\t\tend\n\nend\n","language":"Eiffel"},{"code":"class\n\tAPPLICATION\n\ncreate\n\tmake\n\nfeature\n\n\tmake\n\t\tlocal\n\t\t\tk, count: INTEGER\n\t\tdo\n\t\t\tcreate ludic.make (22000)\n\t\t\tio.put_string (\"%NLudic numbers up to 25. %N\")\n\t\t\tacross\n\t\t\t\tludic.ludic_numbers.subarray (1, 25) as ld\n\t\t\tloop\n\t\t\t\tio.put_string (ld.item.out + \"%N\")\n\t\t\tend\n\t\t\tio.put_string (\"%NLudic numbers from 2000 ... 2005. %N\")\n\t\t\tacross\n\t\t\t\tludic.ludic_numbers.subarray (2000, 2005) as ld\n\t\t\tloop\n\t\t\t\tio.put_string (ld.item.out + \"%N\")\n\t\t\tend\n\t\t\tio.put_string (\"%NNumber of Ludic numbers smaller than 1000. %N\")\n\t\t\tfrom\n\t\t\t\tk := 1\n\t\t\tuntil\n\t\t\t\tludic.ludic_numbers [k] >= 1000\n\t\t\tloop\n\t\t\t\tk := k + 1\n\t\t\t\tcount := count + 1\n\t\t\tend\n\t\t\tio.put_integer (count)\n\t\tend\n\n\tludic: LUDIC_NUMBERS\n\nend\n","language":"Eiffel"},{"code":"defmodule Ludic do\n def numbers(n \\\\ 100000) do\n [h|t] = Enum.to_list(1..n)\n numbers(t, [h])\n end\n\n defp numbers(list, nums) when length(list) < hd(list), do: Enum.reverse(nums, list)\n defp numbers([h|_]=list, nums) do\n Enum.drop_every(list, h) |> numbers([h | nums])\n end\n\n def task do\n IO.puts \"First 25 : #{inspect numbers(200) |> Enum.take(25)}\"\n IO.puts \"Below 1000: #{length(numbers(1000))}\"\n tuple = numbers(25000) |> List.to_tuple\n IO.puts \"2000..2005th: #{ inspect for i <- 1999..2004, do: elem(tuple, i) }\"\n ludic = numbers(250)\n triple = for x <- ludic, x+2 in ludic, x+6 in ludic, do: [x, x+2, x+6]\n IO.puts \"Triples below 250: #{inspect triple, char_lists: :as_lists}\"\n end\nend\n\nLudic.task\n","language":"Elixir"},{"code":"USING: formatting fry kernel make math math.ranges namespaces\nprettyprint.config sequences sequences.extras ;\nIN: rosetta-code.ludic-numbers\n\n: next-ludic ( seq -- seq' )\n dup first '[ nip _ mod zero? not ] filter-index ;\n\n: ludics-upto-2005 ( -- a )\n 22,000 2 swap [a,b] [ ! 22k suffices to produce 2005 ludics\n 1 , [ building get length 2005 = ]\n [ dup first , next-ludic ] until drop\n ] { } make ;\n\n: ludic-demo ( -- )\n 100 margin set ludics-upto-2005\n [ 6 tail* ] [ [ 1000 < ] count ] [ 25 head ] tri\n \"First 25 ludic numbers:\\n%u\\n\\n\"\n \"Count of ludic numbers less than 1000:\\n%d\\n\\n\"\n \"Ludic numbers 2000 to 2005:\\n%u\\n\" [ printf ] tri@ ;\n\nMAIN: ludic-demo\n","language":"Factor"},{"code":"program ludic_numbers\n implicit none\n\n integer, parameter :: nmax = 25000\n logical :: ludic(nmax) = .true.\n integer :: i, j, n\n\n do i = 2, nmax / 2\n if (ludic(i)) then\n n = 0\n do j = i+1, nmax\n if(ludic(j)) n = n + 1\n if(n == i) then\n ludic(j) = .false.\n n = 0\n end if\n end do\n end if\n end do\n\n write(*, \"(a)\", advance = \"no\") \"First 25 Ludic numbers: \"\n n = 0\n do i = 1, nmax\n if(ludic(i)) then\n write(*, \"(i0, 1x)\", advance = \"no\") i\n n = n + 1\n end if\n if(n == 25) exit\n end do\n\n write(*, \"(/, a)\", advance = \"no\") \"Ludic numbers below 1000: \"\n write(*, \"(i0)\") count(ludic(:999))\n\n write(*, \"(a)\", advance = \"no\") \"Ludic numbers 2000 to 2005: \"\n n = 0\n do i = 1, nmax\n if(ludic(i)) then\n n = n + 1\n if(n >= 2000) then\n write(*, \"(i0, 1x)\", advance = \"no\") i\n if(n == 2005) exit\n end if\n end if\n end do\n\n write(*, \"(/, a)\", advance = \"no\") \"Ludic Triplets below 250: \"\n do i = 1, 243\n if(ludic(i) .and. ludic(i+2) .and. ludic(i+6)) then\n write(*, \"(a, 2(i0, 1x), i0, a, 1x)\", advance = \"no\") \"[\", i, i+2, i+6, \"]\"\n end if\n end do\n\nend program\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\n' As it would be too expensive to actually remove elements from the array\n' we instead set an element to 0 if it has been removed.\n\nSub ludic(n As Integer, lu() As Integer)\n If n < 1 Then Return\n Redim lu(1 To n)\n lu(1) = 1\n If n = 1 Then Return\n Dim As Integer count = 1, count2\n Dim As Integer i, j, k = 1\n Dim As Integer ub = 22000 '' big enough to deal with up to 2005 ludic numbers\n Dim a(2 To ub) As Integer\n For i = 2 To ub : a(i) = i : Next\n\n Do\n k += 1\n\n For i = k to ub\n If a(i) > 0 Then\n count += 1\n lu(count) = a(i)\n If n = count Then Return\n a(i) = 0\n k = i\n Exit For\n End If\n Next\n\n count2 = 0\n j = k + 1\n\n While j <= ub\n If a(j) > 0 Then\n count2 +=1\n If count2 = k Then\n a(j) = 0\n count2 = 0\n End If\n End If\n j += 1\n Wend\n Loop\n\nEnd Sub\n\nDim i As Integer\nDim lu() As Integer\nludic(2005, lu())\nPrint \"The first 25 Ludic numbers are :\"\nFor i = 1 To 25\n Print Using \"###\"; lu(i);\n Print \" \";\nNext\nPrint\n\nDim As Integer Count = 0\nFor i = 1 To 1000\n If lu(i) <= 1000 Then\n count += 1\n Else\n Exit For\n End If\nNext\nPrint\nPrint \"There are\"; count; \" Ludic numbers <= 1000\"\nPrint\n\nPrint \"The 2000th to 2005th Ludics are :\"\nFor i = 2000 To 2005\n Print lu(i); \" \";\nNext\nPrint : Print\n\nPrint \"The Ludic triplets below 250 are : \"\nDim As Integer j, k, ldc\nDim b As Boolean\nFor i = 1 To 248\n ldc = lu(i)\n If ldc >= 244 Then Exit For\n b = False\n For j = i + 1 To 249\n If lu(j) = ldc + 2 Then\n b = True\n k = j\n Exit For\n ElseIf lu(j) > ldc + 2 Then\n Exit For\n End If\n Next j\n If b = False Then Continue For\n For j = k + 1 To 250\n If lu(j) = ldc + 6 Then\n Print \"(\"; Str(ldc); \",\"; ldc + 2; \",\"; ldc + 6; \")\"\n Exit For\n ElseIf lu(j) > ldc + 6 Then\n Exit For\n End If\n Next j\nNext i\nErase lu\nPrint\n\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\n// Ludic returns a slice of Ludic numbers stopping after\n// either n entries or when max is exceeded.\n// Either argument may be <=0 to disable that limit.\nfunc Ludic(n int, max int) []uint32 {\n\tconst maxInt32 = 1<<31 - 1 // i.e. math.MaxInt32\n\tif max > 0 && n < 0 {\n\t\tn = maxInt32\n\t}\n\tif n < 1 {\n\t\treturn nil\n\t}\n\tif max < 0 {\n\t\tmax = maxInt32\n\t}\n\tsieve := make([]uint32, 10760) // XXX big enough for 2005 Ludics\n\tsieve[0] = 1\n\tsieve[1] = 2\n\tif n > 2 {\n\t\t// We start with even numbers already removed\n\t\tfor i, j := 2, uint32(3); i < len(sieve); i, j = i+1, j+2 {\n\t\t\tsieve[i] = j\n\t\t}\n\t\t// We leave the Ludic numbers in place,\n\t\t// k is the index of the next Ludic\n\t\tfor k := 2; k < n; k++ {\n\t\t\tl := int(sieve[k])\n\t\t\tif l >= max {\n\t\t\t\tn = k\n\t\t\t\tbreak\n\t\t\t}\n\t\t\ti := l\n\t\t\tl--\n\t\t\t// last is the last valid index\n\t\t\tlast := k + i - 1\n\t\t\tfor j := k + i + 1; j < len(sieve); i, j = i+1, j+1 {\n\t\t\t\tlast = k + i\n\t\t\t\tsieve[last] = sieve[j]\n\t\t\t\tif i%l == 0 {\n\t\t\t\t\tj++\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Truncate down to only the valid entries\n\t\t\tif last < len(sieve)-1 {\n\t\t\t\tsieve = sieve[:last+1]\n\t\t\t}\n\t\t}\n\t}\n\tif n > len(sieve) {\n\t\tpanic(\"program error\") // should never happen\n\t}\n\treturn sieve[:n]\n}\n\nfunc has(x []uint32, v uint32) bool {\n\tfor i := 0; i < len(x) && x[i] <= v; i++ {\n\t\tif x[i] == v {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\nfunc main() {\n\t// Ludic() is so quick we just call it repeatedly\n\tfmt.Println(\"First 25:\", Ludic(25, -1))\n\tfmt.Println(\"Numner of Ludics below 1000:\", len(Ludic(-1, 1000)))\n\tfmt.Println(\"Ludic 2000 to 2005:\", Ludic(2005, -1)[1999:])\n\n\tfmt.Print(\"Tripples below 250:\")\n\tx := Ludic(-1, 250)\n\tfor i, v := range x[:len(x)-2] {\n\t\tif has(x[i+1:], v+2) && has(x[i+2:], v+6) {\n\t\t\tfmt.Printf(\", (%d %d %d)\", v, v+2, v+6)\n\t\t}\n\t}\n\tfmt.Println()\n}\n","language":"Go"},{"code":"import Data.List (unfoldr, genericSplitAt)\n\nludic :: [Integer]\nludic = 1 : unfoldr (\\xs@(x:_) -> Just (x, dropEvery x xs)) [2 ..]\n where\n dropEvery n = concatMap tail . unfoldr (Just . genericSplitAt n)\n\nmain :: IO ()\nmain = do\n print $ take 25 ludic\n (print . length) $ takeWhile (<= 1000) ludic\n print $ take 6 $ drop 1999 ludic\n-- haven't done triplets task yet\n","language":"Haskell"},{"code":"ludic = 1:2 : f 3 [3..] [(4,2)] where\n\tf n (x:xs) yy@((i,y):ys)\n\t\t| n == i = f n (dropEvery y xs) ys\n\t\t| otherwise = x : f (1+n) xs (yy ++ [(n+x, x)])\n\ndropEvery n s = a ++ dropEvery n (tail b) where\n\t(a,b) = splitAt (n-1) s\n\nmain = print $ ludic !! 10000\n","language":"Haskell"},{"code":"global num, cascade, sieve, nfilter\n\nprocedure main(A)\n lds := ludic(2005)\t\t# All we need for the four tasks.\n every writes(\"First 25:\" | (\" \"||!lds)\\25 | \"\\n\")\n every (n := 0) +:= (!lds < 1000, 1)\n write(\"There are \",n,\" Ludic numbers < 1000.\")\n every writes(\"2000th through 2005th: \" | (lds[2000 to 20005]||\" \") | \"\\n\")\n writes(\"Triplets:\")\n every (250 > (x := !lds)) & (250 > (x+2 = !lds)) & (250 > (x+6 = !lds)) do\n writes(\" [\",x,\",\",x+2,\",\",x+6,\"]\")\n write()\nend\n\nprocedure ludic(limit)\n candidates := create seq(2)\n put(cascade := [], create {\n repeat {\n report(l := num, limit)\n put(cascade, create (cnt:=0, repeat ((cnt+:=1)%l=0, @sieve) | @@nfilter))\n cascade[-2] :=: cascade[-1] # keep this sink as the last filter\n @sieve\n }\n })\n sieve := create while num := @candidates do @@(nfilter := create !cascade)\n report(1, limit)\n return @sieve\nend\n\nprocedure report(ludic, limit)\n static count, lds\n initial {count := 0; lds := []}\n if (count +:= 1) > limit then lds@&main\n put(lds, ludic)\nend\n","language":"Icon"},{"code":" ludic =: _1 |.!.1 [: {.\"1 [: (#~ 0 ~: {. | i.@#)^:a: 2 + i.\n","language":"J"},{"code":" # ludic 110 NB. 110 is sufficient to generate 25 Ludic numbers\n25\n ludic 110 NB. First 25 Ludic numbers\n1 2 3 5 7 11 13 17 23 25 29 37 41 43 47 53 61 67 71 77 83 89 91 97 107\n\n #ludic 1000 NB. 142 Ludic numbers <= 1000\n142\n\n # ludic 22000 NB. 22000 is sufficient to generate > 2005 Ludic numbers\n2042\n (2000+i.6) { ludic 22000 NB. Ludic numbers 2000-2005\n21481 21487 21493 21503 21511 21523\n\n 0 2 6 (] (*./ .e.~ # |:@]) +/) ludic 250 NB. Ludic triplets <= 250\n 1 3 7\n 5 7 11\n 11 13 17\n 23 25 29\n 41 43 47\n173 175 179\n221 223 227\n233 235 239\n","language":"J"},{"code":"import java.util.ArrayList;\nimport java.util.List;\n\npublic class Ludic{\n\tpublic static List<Integer> ludicUpTo(int n){\n\t\tList<Integer> ludics = new ArrayList<Integer>(n);\n\t\tfor(int i = 1; i <= n; i++){ //fill the initial list\n\t\t\tludics.add(i);\n\t\t}\n\t\t\n\t\t//start at index 1 because the first ludic number is 1 and we don't remove anything for it\n\t\tfor(int cursor = 1; cursor < ludics.size(); cursor++){\n\t\t\tint thisLudic = ludics.get(cursor); //the first item in the list is a ludic number\n\t\t\tint removeCursor = cursor + thisLudic; //start removing that many items later\n\t\t\twhile(removeCursor < ludics.size()){\n\t\t\t\tludics.remove(removeCursor);\t\t //remove the next item\n\t\t\t\tremoveCursor = removeCursor + thisLudic - 1; //move the removal cursor up as many spaces as we need to\n\t\t\t\t\t\t\t\t\t //then back one to make up for the item we just removed\n\t\t\t}\n\t\t}\n\t\treturn ludics;\n\t}\n\t\n\tpublic static List<List<Integer>> getTriplets(List<Integer> ludics){\n\t\tList<List<Integer>> triplets = new ArrayList<List<Integer>>();\n\t\tfor(int i = 0; i < ludics.size() - 2; i++){ //only need to check up to the third to last item\n\t\t\tint thisLudic = ludics.get(i);\n\t\t\tif(ludics.contains(thisLudic + 2) && ludics.contains(thisLudic + 6)){\n\t\t\t\tList<Integer> triplet = new ArrayList<Integer>(3);\n\t\t\t\ttriplet.add(thisLudic);\n\t\t\t\ttriplet.add(thisLudic + 2);\n\t\t\t\ttriplet.add(thisLudic + 6);\n\t\t\t\ttriplets.add(triplet);\n\t\t\t}\n\t\t}\n\t\treturn triplets;\n\t}\n\t\n\tpublic static void main(String[] srgs){\n\t\tSystem.out.println(\"First 25 Ludics: \" + ludicUpTo(110));\t\t\t\t//110 will get us 25 numbers\n\t\tSystem.out.println(\"Ludics up to 1000: \" + ludicUpTo(1000).size());\n\t\tSystem.out.println(\"2000th - 2005th Ludics: \" + ludicUpTo(22000).subList(1999, 2005)); //22000 will get us 2005 numbers\n\t\tSystem.out.println(\"Triplets up to 250: \" + getTriplets(ludicUpTo(250)));\n\t}\n}\n","language":"Java"},{"code":"/**\n * Boilerplate to simply get an array filled between 2 numbers\n * @param {!number} s Start here (inclusive)\n * @param {!number} e End here (inclusive)\n */\nconst makeArr = (s, e) => new Array(e + 1 - s).fill(s).map((e, i) => e + i);\n\n/**\n * Remove every n-th element from the given array\n * @param {!Array} arr\n * @param {!number} n\n * @return {!Array}\n */\nconst filterAtInc = (arr, n) => arr.filter((e, i) => (i + 1) % n);\n\n/**\n * Generate ludic numbers\n * @param {!Array} arr\n * @param {!Array} result\n * @return {!Array}\n */\nconst makeLudic = (arr, result) => {\n const iter = arr.shift();\n result.push(iter);\n return arr.length ? makeLudic(filterAtInc(arr, iter), result) : result;\n};\n\n/**\n * Our Ludic numbers. This is a bit of a cheat, as we already know beforehand\n * up to where our seed array needs to go in order to exactly get to the\n * 2005th Ludic number.\n * @type {!Array<!number>}\n */\nconst ludicResult = makeLudic(makeArr(2, 21512), [1]);\n\n\n// Below is just logging out the results.\n/**\n * Given a number, return a function that takes an array, and return the\n * count of all elements smaller than the given\n * @param {!number} n\n * @return {!Function}\n */\nconst smallerThanN = n => arr => {\n return arr.reduce((p,c) => {\n return c <= n ? p + 1 : p\n }, 0)\n};\nconst smallerThan1K = smallerThanN(1000);\n\nconsole.log('\\nFirst 25 Ludic Numbers:');\nconsole.log(ludicResult.filter((e, i) => i < 25).join(', '));\n\nconsole.log('\\nTotal Ludic numbers smaller than 1000:');\nconsole.log(smallerThan1K(ludicResult));\n\nconsole.log('\\nThe 2000th to 2005th ludic numbers:');\nconsole.log(ludicResult.filter((e, i) => i > 1998).join(', '));\n\nconsole.log('\\nTriplets smaller than 250:');\nludicResult.forEach(e => {\n if (e + 6 < 250 && ludicResult.indexOf(e + 2) > 0 && ludicResult.indexOf(e + 6) > 0) {\n console.log([e, e + 2, e + 6].join(', '));\n }\n});\n","language":"JavaScript"},{"code":"# This method for sieving turns out to be the fastest in jq.\n# Input: an array to be sieved.\n# Output: if the array length is less then $n then empty, else the sieved array.\ndef sieve($n):\n if length<$n then empty\n else . as $in\n | reduce range(0;length) as $i ([]; if $i % $n == 0 then . else . + [$in[$i]] end)\n end;\n\n# Generate a stream of ludic numbers based on sieving range(2; $nmax+1)\ndef ludic($nmax):\n def l:\n .[0] as $next\n | $next, (sieve($next)|l);\n 1, ([range(2; $nmax+1)] | l);\n\n# Output: an array of the first . ludic primes (including 1)\ndef first_ludic_primes:\n . as $n\n | def l:\n . as $k\n | [ludic(10*$k)] as $a\n | if ($a|length) >= $n then $a[:$n]\n else (10*$k) | l\n end;\n l;\n\n# Output: an array of the ludic numbers less than .\ndef ludic_primes:\n . as $n\n | def l:\n . as $k\n | [ludic(10*$k)] as $a\n | if $a[-1] >= $n then $a | map(select(. < $n))\n else (10*$k) | l\n end;\n l;\n\n# Output; a stream of triplets of ludic numbers, where each member of the triplet is less than .\ndef triplets:\n ludic_primes as $primes\n | $primes[] as $p\n | $primes\n | bsearch($p) as $i\n | if $i >= 0\n then $primes[$i+1:]\n | select( bsearch($p+2) >= 0 and\n bsearch($p+6) >= 0)\n | [$p, $p+2, $p+6]\n else empty\n end;\n\n\n\"First 25 ludic primes:\", (25|first_ludic_primes),\n\"\\nThere are \\(1000|ludic_primes|length) ludic numbers <= 1000\",\n( \"The \\n2000th to 2005th ludic primes are:\",\n (2005|first_ludic_primes)[2000:]),\n( [250 | triplets]\n | \"\\nThere are \\(length) triplets less than 250:\",\n .[] )\n","language":"Jq"},{"code":"function ludic_filter{T<:Integer}(n::T)\n 0 < n || throw(DomainError())\n slud = trues(n)\n for i in 2:(n-1)\n slud[i] || continue\n x = 0\n for j in (i+1):n\n slud[j] || continue\n x += 1\n x %= i\n x == 0 || continue\n slud[j] = false\n end\n end\n return slud\nend\n\nludlen = 10^5\nslud = ludic_filter(ludlen)\nludics = collect(1:ludlen)[slud]\n\nn = 25\nprintln(\"Generate and show here the first \", n, \" ludic numbers.\")\nprint(\" \")\ncrwid = 76\nwid = 0\nfor i in 1:(n-1)\n s = @sprintf \"%d, \" ludics[i]\n wid += length(s)\n if crwid < wid\n print(\"\\n \")\n wid = 0\n end\n print(s)\nend\nprintln(ludics[n])\n\nn = 10^3\nprintln()\nprintln(\"How many ludic numbers are there less than or equal to \", n, \"?\")\nprintln(\" \", sum(slud[1:n]))\n\nlo = 2000\nhi = lo+5\nprintln()\nprintln(\"Show the \", lo, \"..\", hi, \"'th ludic numbers.\")\nfor i in lo:hi\n println(\" Ludic(\", i, \") = \", ludics[i])\nend\n\nn = 250\nprintln()\nprintln(\"Show all triplets of ludic numbers < \", n)\nfor i = 1:n-7\n slud[i] || continue\n j = i+2\n slud[j] || continue\n k = i+6\n slud[k] || continue\n println(\" \", i, \", \", j, \", \", k)\nend\n","language":"Julia"},{"code":"// version 1.0.6\n\n/* Rather than remove elements from a MutableList which would be a relatively expensive operation\n we instead use two arrays:\n\n 1. An array of the Ludic numbers to be returned.\n 2. A 'working' array of a suitable size whose elements are set to 0 to denote removal. */\n\nfun ludic(n: Int): IntArray {\n if (n < 1) return IntArray(0)\n val lu = IntArray(n) // array of Ludic numbers required\n lu[0] = 1\n if (n == 1) return lu\n var count = 1\n var count2: Int\n var j: Int\n var k = 1\n var ub = n * 11 // big enough to deal with up to 2005 ludic numbers\n val a = IntArray(ub) { it } // working array\n while (true) {\n k += 1\n for (i in k until ub) {\n if (a[i] > 0) {\n count +=1\n lu[count - 1] = a[i]\n if (n == count) return lu\n a[i] = 0\n k = i\n break\n }\n }\n count2 = 0\n j = k + 1\n while (j < ub) {\n if (a[j] > 0) {\n count2 +=1\n if (count2 == k) {\n a[j] = 0\n count2 = 0\n }\n }\n j += 1\n }\n }\n}\n\nfun main(args: Array<String>) {\n val lu: IntArray = ludic(2005)\n println(\"The first 25 Ludic numbers are :\")\n for (i in 0 .. 24) print(\"%4d\".format(lu[i]))\n\n val count = lu.count { it <= 1000 }\n println(\"\\n\\nThere are $count Ludic numbers <= 1000\" )\n\n println(\"\\nThe 2000th to 2005th Ludics are :\")\n for (i in 1999 .. 2004) print(\"${lu[i]} \")\n\n println(\"\\n\\nThe Ludic triplets below 250 are : \")\n var k: Int = 0\n var ldc: Int\n var b: Boolean\n for (i in 0 .. 247) {\n ldc = lu[i]\n if (ldc >= 244) break\n b = false\n for (j in i + 1 .. 248) {\n if (lu[j] == ldc + 2) {\n b = true\n k = j\n break\n }\n else if (lu[j] > ldc + 2) break\n }\n if (!b) continue\n for (j in k + 1 .. 249) {\n if (lu[j] == ldc + 6) {\n println(\"($ldc, ${ldc + 2}, ${ldc + 6})\")\n break\n }\n else if (lu[j] > ldc + 6) break\n }\n }\n}\n","language":"Kotlin"},{"code":"-- Return table of ludic numbers below limit\nfunction ludics (limit)\n local ludList, numList, index = {1}, {}\n for n = 2, limit do table.insert(numList, n) end\n while #numList > 0 do\n index = numList[1]\n table.insert(ludList, index)\n for key = #numList, 1, -1 do\n if key % index == 1 then table.remove(numList, key) end\n end\n end\n return ludList\nend\n\n-- Return true if n is found in t or false otherwise\nfunction foundIn (t, n)\n for k, v in pairs(t) do\n if v == n then return true end\n end\n return false\nend\n\n-- Display msg followed by all values in t\nfunction show (msg, t)\n io.write(msg)\n for _, v in pairs(t) do io.write(\" \" .. v) end\n print(\"\\n\")\nend\n\n-- Main procedure\nlocal first25, under1k, inRange, tripList, triplets = {}, 0, {}, {}, {}\nfor k, v in pairs(ludics(30000)) do\n if k <= 25 then table.insert(first25, v) end\n if v <= 1000 then under1k = under1k + 1 end\n if k >= 2000 and k <= 2005 then table.insert(inRange, v) end\n if v < 250 then table.insert(tripList, v) end\nend\nfor _, x in pairs(tripList) do\n if foundIn(tripList, x + 2) and foundIn(tripList, x + 6) then\n table.insert(triplets, \"\\n{\" .. x .. \",\" .. x+2 .. \",\" .. x+6 .. \"}\")\n end\nend\nshow(\"First 25:\", first25)\nprint(under1k .. \" are less than or equal to 1000\\n\")\nshow(\"2000th to 2005th:\", inRange)\nshow(\"Triplets:\", triplets)\n","language":"Lua"},{"code":"n=10^5;\nLudic={1};\nseq=Range[2,n];\nClearAll[DoStep]\nDoStep[seq:{f_,___}]:=Module[{out=seq},\n AppendTo[Ludic,f];\n out[[;;;;f]]=Sequence[];\n out\n]\nNest[DoStep,seq,2500];\n\nLudic[[;; 25]]\nLengthWhile[Ludic, # < 1000 &]\nLudic[[2000 ;; 2005]]\nSelect[Subsets[Select[Ludic, # < 250 &], {3}], Differences[#] == {2, 4} &]\n","language":"Mathematica"},{"code":"import strutils\n\ntype LudicArray[N: static int] = array[1..N, int]\n\nfunc initLudicArray[N: static int](): LudicArray[N] =\n ## Initialize an array of ludic numbers.\n result[1] = 1\n for i in 2..N:\n var k = 0\n for j in countdown(i - 1, 2):\n k = k * result[j] div (result[j] - 1) + 1\n result[i] = k + 2\n\n\nproc print(text: string; list: openArray[int]) =\n ## Print a text followed by a list of ludic numbers.\n var line = text\n let start = line.len\n for val in list:\n line.addSep(\", \", start)\n line.add $val\n echo line\n\n\nfunc isLudic(ludicArray: LudicArray; n, start: Positive): bool =\n ## Check if a number \"n\" is ludic, starting search from index \"start\".\n for idx in start..ludicArray.N:\n let val = ludicArray[idx]\n if n == val: return true\n if n < val: break\n\n\nwhen isMainModule:\n\n let ludicArray = initLudicArray[2005]()\n\n print \"The 25 first ludic numbers are: \", ludicArray[1..25]\n\n var count = 0\n for n in ludicArray:\n if n > 1000: break\n inc count\n echo \"\\nThere are \", count, \" ludic numbers less or equal to 1000.\"\n\n print \"\\nThe 2000th to 2005th ludic numbers are: \", ludicArray[2000..2005]\n\n echo \"\\nThe triplets of ludic numbers less than 250 are:\"\n var line = \"\"\n for i, n in ludicArray:\n if n >= 244:\n echo line\n break\n if ludicArray.isLudic(n + 2, i + 1) and ludicArray.isLudic(n + 6, i + 2):\n line.addSep(\", \")\n line.add \"($1, $2, $3)\".format(n, n + 2, n + 6)\n","language":"Nim"},{"code":"use Collection.Generic;\n\nclass Ludic {\n function : Main(args : String[]) ~ Nil {\n ludics := LudicUpTo(110);\n Show(\"First 25 Ludics: \", ludics, 0, ludics->Size());\n System.IO.Console->Print(\"Ludics up to 1000: \")->PrintLine(LudicUpTo(1000)->Size());\n ludics := LudicUpTo(22000);\n Show(\"2000th - 2005th Ludics: \", ludics, 1999, 2005);\n Show(\"Triplets up to 250: \", GetTriplets(LudicUpTo(250)));\n }\n\n function : LudicUpTo(n : Int) ~ CompareVector<IntHolder> {\n ludics := CompareVector->New()<IntHolder>;\n for(i := 1; i <= n; i++;){\n ludics->AddBack(i);\n };\n\n for(cursor := 1; cursor < ludics->Size(); cursor++;) {\n thisLudic := ludics->Get(cursor);\n removeCursor := cursor + thisLudic;\n while(removeCursor < ludics->Size()){\n ludics->Remove(removeCursor);\n removeCursor := removeCursor + thisLudic - 1;\n };\n };\n\n return ludics;\n }\n\n function : GetTriplets(ludics : CompareVector<IntHolder>) ~ Vector<CompareVector<IntHolder> > {\n triplets := Vector->New()<CompareVector<IntHolder> >;\n\n for(i := 0; i < ludics->Size() - 2; i++;){\n thisLudic := ludics->Get(i);\n if(ludics->Has(thisLudic + 2) & ludics->Has(thisLudic + 6)){\n triplet := CompareVector->New()<IntHolder>;\n triplet->AddBack(thisLudic);\n triplet->AddBack(thisLudic + 2);\n triplet->AddBack(thisLudic + 6);\n triplets->AddBack(triplet);\n };\n };\n\n return triplets;\n }\n\n function : Show(title : String, ludics : CompareVector<IntHolder>, start : Int, end : Int) ~ Nil {\n title->Print();\n '['->Print();\n for(i := start; i < end; i +=1;) {\n ludics->Get(i)->Get()->Print();\n if(i + 1 < ludics->Size()) {\n ','->Print();\n };\n };\n ']'->PrintLine();\n }\n\n function : Show(title : String, triplets : Vector<CompareVector<IntHolder> >) ~ Nil {\n title->PrintLine();\n each(i : triplets) {\n triplet := triplets->Get(i);\n Show(\"\\t\", triplet, 0, triplet->Size());\n };\n }\n}\n","language":"Objeck"},{"code":": ludic(n)\n| ludics l p |\n ListBuffer newSize(n) seqFrom(2, n) over addAll ->l\n ListBuffer newSize(n) dup add(1) dup ->ludics\n\n while(l notEmpty) [\n l removeFirst dup ludics add ->p\n l size p / p * while(dup 1 > ) [ dup l removeAt drop p - ] drop\n ] ;\n\n: ludics\n| l i |\n ludic(22000) ->l\n \"First 25 : \" print l left(25) println\n \"Below 1000 : \" print l filter(#[ 1000 < ]) size println\n \"2000 to 2005 : \" print l extract(2000, 2005) println\n\n 250 loop: i [\n l include(i) ifFalse: [ continue ]\n l include(i 2 +) ifFalse: [ continue ]\n l include(i 6 +) ifFalse: [ continue ]\n i print \", \" print i 2 + print \", \" print i 6 + println\n ] ;\n","language":"Oforth"},{"code":"\\\\ Creating Vlf - Vector of ludic numbers' flags,\n\\\\ where the index of each flag=1 is the ludic number.\n\\\\ 2/28/16 aev\nludic(maxn)={my(Vlf=vector(maxn,z,1),n2=maxn\\2,k,j1);\nfor(i=2,n2,\n if(Vlf[i], k=0; j1=i+1;\n for(j=j1,maxn, if(Vlf[j], k++); if(k==i, Vlf[j]=0; k=0))\n );\n );\nreturn(Vlf);\n}\n\n{\n\\\\ Required tests:\nmy(Vr,L=List(),k=0,maxn=25000);\nVr=ludic(maxn);\nprint(\"The first 25 Ludic numbers: \");\nfor(i=1,maxn, if(Vr[i]==1, k++; print1(i,\" \"); if(k==25, break)));\nprint(\"\");print(\"\");\nk=0;\nfor(i=1,999, if(Vr[i]==1, k++));\nprint(\"Ludic numbers below 1000: \",k);\nprint(\"\");\nk=0;\nprint(\"Ludic numbers 2000 to 2005: \");\nfor(i=1,maxn, if(Vr[i]==1, k++; if(k>=2000&&k<=2005, listput(L,i)); if(k>2005, break)));\nfor(i=1,6, print1(L[i],\" \"));\nprint(\"\"); print(\"\");\nprint(\"Ludic Triplets below 250: \");\nfor(i=1,250, if(Vr[i]&&Vr[i+2]&&Vr[i+6], print1(\"(\",i,\" \",i+2,\" \",i+6,\") \")));\n}\n","language":"PARI-GP"},{"code":"\\\\ Creating Vl - Vector of ludic numbers.\n\\\\ 2/28/16 aev\nludic2(maxn)={my(Vw=vector(maxn, x, x+1),Vl=Vec([1]),vwn=#Vw,i);\nwhile(vwn>0, i=Vw[1]; Vl=concat(Vl,[i]);\n Vw=vector((vwn*(i-1))\\i,x,Vw[(x*i+i-2)\\(i-1)]); vwn=#Vw\n); return(Vl);\n}\n{\n\\\\ Required tests:\nmy(Vr,L=List(),k=0,maxn=22000,vrs,vi);\nVr=ludic2(maxn); vrs=#Vr;\nprint(\"The first 25 Ludic numbers: \");\nfor(i=1,25, print1(Vr[i],\" \"));\nprint(\"\");print(\"\");\nk=0;\nfor(i=1,vrs, if(Vr[i]<1000, k++, break));\nprint(\"Ludic numbers below 1000: \",k);\nprint(\"\");\nk=0;\nprint(\"Ludic numbers 2000 to 2005: \");\nfor(i=2000,2005, print1(Vr[i],\" \"));\nprint(\"\");print(\"\");\nprint(\"Ludic Triplets below 250: \");\nfor(i=1,vrs, vi=Vr[i]; if(i==1,print1(\"(\",vi,\" \",vi+2,\" \",vi+6,\") \"); next); if(vi+6<250,if(Vr[i+1]==vi+2&&Vr[i+2]==vi+6, print1(\"(\",vi,\" \",vi+2,\" \",vi+6,\") \"))));\n}\n","language":"PARI-GP"},{"code":"program lucid;\n{$IFDEF FPC}\n {$MODE objFPC} // useful for x64\n{$ENDIF}\n\nconst\n //66164 -> last < 1000*1000;\n maxLudicCnt = 2005;//must be > 1\ntype\n\n tDelta = record\n dNum,\n dCnt : LongInt;\n end;\n\n tpDelta = ^tDelta;\n tLudicList = array of tDelta;\n\n tArrdelta =array[0..0] of tDelta;\n tpLl = ^tArrdelta;\n\nfunction isLudic(plL:tpLl;maxIdx:nativeInt):boolean;\nvar\n i,\n cn : NativeInt;\nBegin\n //check if n is 'hit' by a prior ludic number\n For i := 1 to maxIdx do\n with plL^[i] do\n Begin\n //Mask read modify write reread\n //dec(dCnt);IF dCnt= 0\n cn := dCnt;\n IF cn = 1 then\n Begin\n dcnt := dNum;\n isLudic := false;\n EXIT;\n end;\n dcnt := cn-1;\n end;\n isLudic := true;\nend;\n\nprocedure CreateLudicList(var Ll:tLudicList);\nvar\n plL : tpLl;\n n,LudicCnt : NativeUint;\nbegin\n // special case 1\n n := 1;\n Ll[0].dNum := 1;\n\n plL := @Ll[0];\n LudicCnt := 0;\n repeat\n inc(n);\n If isLudic(plL,LudicCnt ) then\n Begin\n inc(LudicCnt);\n with plL^[LudicCnt] do\n Begin\n dNum := n;\n dCnt := n;\n end;\n IF (LudicCnt >= High(LL)) then\n BREAK;\n end;\n until false;\nend;\n\nprocedure firstN(var Ll:tLudicList;cnt: NativeUint);\nvar\n i : NativeInt;\nBegin\n writeln('First ',cnt,' ludic numbers:');\n For i := 0 to cnt-2 do\n write(Ll[i].dNum,',');\n writeln(Ll[cnt-1].dNum);\nend;\n\nprocedure triples(var Ll:tLudicList;max: NativeUint);\nvar\n i,\n chk : NativeUint;\nBegin\n // special case 1,3,7\n writeln('Ludic triples below ',max);\n write('(',ll[0].dNum,',',ll[2].dNum,',',ll[4].dNum,') ');\n\n For i := 1 to High(Ll) do\n Begin\n chk := ll[i].dNum;\n If chk> max then\n break;\n If (ll[i+2].dNum = chk+6) AND (ll[i+1].dNum = chk+2) then\n write('(',ll[i].dNum,',',ll[i+1].dNum,',',ll[i+2].dNum,') ');\n end;\n writeln;\n writeln;\nend;\n\nprocedure LastLucid(var Ll:tLudicList;start,cnt: NativeUint);\nvar\n limit,i : NativeUint;\nBegin\n dec(start);\n limit := high(Ll);\n IF cnt >= limit then\n cnt := limit;\n if start+cnt >limit then\n start := limit-cnt;\n writeln(Start+1,'.th to ',Start+cnt+1,'.th ludic number');\n For i := 0 to cnt-1 do\n write(Ll[i+start].dNum,',');\n writeln(Ll[start+cnt].dNum);\n writeln;\nend;\n\nfunction CountLudic(var Ll:tLudicList;Limit: NativeUint):NativeUint;\nvar\n i,res : NativeUint;\nBegin\n res := 0;\n For i := 0 to High(Ll) do begin\n IF Ll[i].dnum <= Limit then\n inc(res)\n else\n BREAK;\n CountLudic:= res;\nend;\n\nend;\nvar\n LudicList : tLudicList;\nBEGIN\n setlength(LudicList,maxLudicCnt);\n CreateLudicList(LudicList);\n firstN(LudicList,25);\n writeln('There are ',CountLudic(LudicList,1000),' ludic numbers below 1000');\n LastLucid(LudicList,2000,5);\n LastLucid(LudicList,maxLudicCnt,5);\n triples(LudicList,250);//all-> (LudicList,LudicList[High(LudicList)].dNum);\nEND.\n","language":"Pascal"},{"code":"program ludic;\n{$IFDEF FPC}{$MODE DELPHI}{$ELSE}{$APPTYPE CONSOLE}{$ENDIF}\nuses\n sysutils;\nconst\n MAXNUM =21511;// > 1\n //1561333;-> 100000 ludic numbers\n //1561243,1561291,1561301,1561307,1561313,1561333\ntype\n tarrLudic = array of byte;\n tLudics = array of LongWord;\n\nvar\n Ludiclst : tarrLudic;\n\nprocedure Firsttwentyfive;\nvar\n i,actLudic : NativeInt;\nBegin\n writeln('First 25 ludic numbers');\n actLudic:= 1;\n For i := 1 to 25 do\n Begin\n write(actLudic:3,',');\n inc(actLudic,Ludiclst[actLudic]);\n IF i MOD 5 = 0 then\n writeln(#8#32);\n end;\n writeln;\nend;\n\nprocedure CountBelowOneThousand;\nvar\n cnt,actLudic : NativeInt;\nBegin\n write('Count of ludic numbers below 1000 = ');\n actLudic:= 1;\n cnt := 1;\n while actLudic <= 1000 do\n Begin\n inc(actLudic,Ludiclst[actLudic]);\n inc(cnt);\n end;\n dec(cnt);\n writeln(cnt);writeln;\nend;\n\nprocedure Show2000til2005;\nvar\n cnt,actLudic : NativeInt;\nBegin\n writeln('ludic number #2000 to #2005');\n actLudic:= 1;\n cnt := 1;\n while cnt < 2000 do\n Begin\n inc(actLudic,Ludiclst[actLudic]);\n inc(cnt);\n end;\n while cnt < 2005 do\n Begin\n write(actLudic,',');\n inc(actLudic,Ludiclst[actLudic]);\n inc(cnt);\n end;\n writeln(actLudic);writeln;\nend;\n\nprocedure ShowTriplets;\nvar\n actLudic,lastDelta : NativeInt;\nBegin\n writeln('ludic numbers triplets below 250');\n actLudic:= 1;\n while actLudic < 250-5 do\n Begin\n IF (Ludiclst[actLudic] <> 0) AND\n (Ludiclst[actLudic+2] <> 0) AND\n (Ludiclst[actLudic+6] <> 0) then\n writeln('{',actLudic,'|',actLudic+2,'|',actLudic+6,'} ');\n inc(actLudic);\n end;\n writeln;\nend;\n\nprocedure CheckMaxdist;\nvar\n actLudic,Delta,MaxDelta : NativeInt;\nBegin\n MaxDelta := 0;\n actLudic:= 1;\n repeat\n delta := Ludiclst[actLudic];\n inc(actLudic,delta);\n IF MAxDelta<delta then\n MAxDelta:= delta;\n until actLudic>= MAXNUM;\n writeln('MaxDist ',MAxDelta);writeln;\nend;\n\nfunction GetLudics:tLudics;\n//Array of byte containing the distance to next ludic number\n//eliminated numbers are set to 0\nvar\n i,actLudic,actcnt,delta,actPos,lastPos,ludicCnt: NativeInt;\nBegin\n setlength(Ludiclst,MAXNUM+1);\n For i := MAXNUM downto 0 do\n Ludiclst[i]:= 1;\n actLudic := 1;\n ludicCnt := 1;\n\n repeat\n inc(actLudic,Ludiclst[actLudic]);\n IF actLudic> MAXNUM then\n BREAK;\n inc(ludicCnt);\n actPos := actLudic;\n actcnt := 0;\n // Only if there are enough ludics left\n IF MaxNum-ludicCnt-actPos > actPos then\n Begin\n //eliminate every element in actLudic-distance\n //delta so i can set Ludiclst[actpos] to zero\n delta := Ludiclst[actpos];\n repeat\n lastPos := actPos;\n inc(actpos,delta);\n if actPos>=MAXNUM then\n BREAK;\n delta := Ludiclst[actpos];\n inc(actcnt);\n IF actcnt= actLudic then\n Begin\n inc(Ludiclst[LastPos],delta);\n //mark as not ludic\n Ludiclst[actpos] := 0;\n actcnt := 0;\n end;\n until false;\n end;\n until false;\n writeln(ludicCnt,' ludic numbers upto ',MAXNUM,#13#10);\nend;\n\nBEGIN\n GetLudics;\n CheckMaxdist;\n Firsttwentyfive;CountBelowOneThousand;Show2000til2005;ShowTriplets ;\n setlength(Ludiclst,0)\nEND.\n","language":"Pascal"},{"code":"#!/usr/bin/perl\nuse warnings;\nuse strict;\nuse feature qw{ say };\n\n{ my @ludic = (1);\n my $max = 3;\n my @candidates;\n\n sub sieve {\n my $l = shift;\n for (my $i = 0; $i <= $#candidates; $i += $l) {\n splice @candidates, $i, 1;\n }\n }\n\n sub ludic {\n my ($type, $n) = @_;\n die \"Arg0 Type must be 'count' or 'max'\\n\"\n unless grep $_ eq $type, qw( count max );\n die \"Arg1 Number must be > 0\\n\" if 0 >= $n;\n\n return (@ludic[ 0 .. $n - 1 ]) if 'count' eq $type and @ludic >= $n;\n\n return (grep $_ <= $n, @ludic) if 'max' eq $type and $ludic[-1] >= $n;\n\n while (1) {\n if (@candidates) {\n last if ('max' eq $type and $candidates[0] > $n)\n or ($n == @ludic);\n\n push @ludic, $candidates[0];\n sieve($ludic[-1] - 1);\n\n } else {\n $max *= 2;\n @candidates = 2 .. $max;\n for my $l (@ludic) {\n sieve($l - 1) unless 1 == $l;\n }\n }\n }\n return (@ludic)\n }\n\n}\n\nmy @triplet;\nmy %ludic;\nundef @ludic{ ludic(max => 250) };\nfor my $i (keys %ludic) {\n push @triplet, $i if exists $ludic{ $i + 2 } and exists $ludic { $i + 6 };\n}\n\nsay 'First 25: ', join ' ', ludic(count => 25);\nsay 'Count < 1000: ', scalar ludic(max => 1000);\nsay '2000..2005th: ', join ' ', (ludic(count => 2005))[1999 .. 2004];\nsay 'triplets < 250: ', join ' ',\n map { '(' . join(' ',$_, $_ + 2, $_ + 6) . ')' }\n sort { $a <=> $b } @triplet;\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">LUMAX</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">25000</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">ludic</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;\">LUMAX</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</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;\">LUMAX</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">ludic</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;\">n</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;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">LUMAX</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">ludic</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;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">i</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">ludic</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;\">n</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;\">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\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">s</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;\">LUMAX</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">ludic</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;\">s</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">i</span>\n <span style=\"color: #008080;\">if</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;\">25</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;\">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;\">\"First 25 Ludic numbers: %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">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;\">\"Ludic numbers below 1000: %d\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ludic</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">1000</span><span style=\"color: #0000FF;\">])})</span>\n <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #000000;\">n</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: #000000;\">LUMAX</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">ludic</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;\">n</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">2000</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>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2005</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;\">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: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Ludic numbers 2000 to 2005: %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">sprint</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: #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;\">243</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">ludic</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">ludic</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;\">and</span> <span style=\"color: #000000;\">ludic</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">6</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: #7060A8;\">append</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;\">i</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;\">6</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;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"There are %d Ludic triplets below 250: %s\\n\"</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: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)})</span>\n<!--\n","language":"Phix"},{"code":"ludic(N) = Ludic =>\n ludic(2..N, [1], Ludic).\nludic([], Ludic0, Ludic) =>\n Ludic = Ludic0.reverse().\nludic(T, Ludic0, Ludic) =>\n T2 = ludic_keep(T),\n ludic(T2,[T[1]|Ludic0],Ludic).\n\n% which elements to keep\nludic_keep([]) = [].\nludic_keep([H|List]) = Ludic =>\n ludic_keep(H,1,List,[],Ludic).\n\nludic_keep(_H,_C,[],Ludic0,Ludic) ?=>\n Ludic = Ludic0.reverse().\nludic_keep(H,C,[H1|T],Ludic0,Ludic) =>\n (\n C mod H > 0 ->\n ludic_keep(H,C+1,T,[H1|Ludic0],Ludic)\n ;\n ludic_keep(H,C+1,T,Ludic0,Ludic)\n ).\n","language":"Picat"},{"code":"ludic2(N) = Ludic =>\n A = 1..N,\n Ludic = [1],\n A := delete(A, 1),\n while(A.length > 0)\n T = A[1],\n Ludic := Ludic ++ [T],\n A := delete(A,T),\n A := [A[J] : J in 1..A.length, J mod T > 0]\n end.\n","language":"Picat"},{"code":"go =>\n time(check(ludic)),\n time(check(ludic2)),\n nl.\n\ncheck(LudicFunc) =>\n println(ludicFunc=LudicFunc),\n\n Ludic1000 = apply(LudicFunc,1000),\n\n % first 25\n println(first_25=Ludic1000[1..25]),\n\n % below 1000\n println(num_below_1000=Ludic1000.length),\n\n % 2000..2005\n Ludic22000 = apply(LudicFunc,22000),\n println(len_22000=Ludic22000.length),\n println(ludic_2000_2005=[Ludic22000[I] : I in 2000..2005]),\n\n % Triplets\n Ludic2500 = apply(LudicFunc,2500),\n Triplets=[[N,N+2,N+6] : N in 1..Ludic2500.length,\n membchk(N,Ludic2500),\n membchk(N+2,Ludic2500),\n membchk(N+6,Ludic2500)],\n foreach(Triplet in Triplets)\n println(Triplet)\n end,\n nl.\n","language":"Picat"},{"code":"(de drop (Lst)\n (let N (car Lst)\n (make\n (for (I . X) (cdr Lst)\n (unless (=0 (% I N)) (link X)) ) ) ) )\n\n(de comb (M Lst)\n (cond\n ((=0 M) '(NIL))\n ((not Lst))\n (T\n (conc\n (mapcar\n '((Y) (cons (car Lst) Y))\n (comb (dec M) (cdr Lst)) )\n (comb M (cdr Lst)) ) ) ) )\n\n(de ludic (N)\n (let Ludic (range 1 100000)\n (make\n (link (pop 'Ludic))\n (do (dec N)\n (link (car Ludic))\n (setq Ludic (drop Ludic)) ) ) ) )\n\n(let L (ludic 2005)\n (println (head 25 L))\n (println (cnt '((X) (< X 1000)) L))\n (println (tail 6 L))\n (println\n (filter\n '((Lst)\n (and\n (= (+ 2 (car Lst)) (cadr Lst))\n (= (+ 6 (car Lst)) (caddr Lst)) ) )\n (comb\n 3\n (filter '((X) (< X 250)) L) ) ) ) )\n\n(bye)\n","language":"PicoLisp"},{"code":"Ludic_numbers: procedure options (main); /* 18 April 2014 */\n declare V(2:22000) fixed, L(2200) fixed;\n declare (step, i, j, k, n) fixed binary;\n\nLudic: procedure;\n n = hbound(V,1); k = 1; L(1) = 1;\n do i = 2 to n; V(i) = i; end;\n\n do forever;\n\n k = k + 1; L(k), step = V(2);\n\n do i = 2 to n by step;\n V(i) = 0;\n end;\n call compress;\n if L(k) >= 21511 then leave;\n end;\n\n put skip list ('The first 25 Ludic numbers are:');\n put skip edit ( (L(i) do i = 1 to 25) ) (F(4));\n\n k = 0;\n do i = 1 by 1;\n if L(i) < 1000 then k = k + 1; else leave;\n end;\n\n put skip list ('There are ' || trim(k) || ' Ludic numbers < 1000');\n put skip list ('Six Ludic numbers from the 2000-th:');\n put skip edit ( (L(i) do i = 2000 to 2005) ) (f(7));\n /* Triples are values of the form x, x+2, x+6 */\n put skip list ('Triples are:');\n put skip;\n i = 1;\n put edit ('(', L(1), L(3), L(5), ') ' ) (A, 3 F(4), A);\n do i = 1 by 1 while (L(i+2) <= 250);\n if (L(i) = L(i+1) - 2) & (L(i) = L(i+2) - 6) then\n put edit ('(', L(i), L(i+1), L(i+2), ') ' ) (A, 3 F(4), A);\n end;\n\ncompress: procedure;\n j = 2;\n do i = 2 to n;\n if V(i) ^= 0 then do; V(j) = V(i); j = j + 1; end;\n end;\n n = j-1;\nend compress;\n\nend Ludic;\n\ncall Ludic;\n\nend Ludic_numbers;\n","language":"PL-I"},{"code":"SET SERVEROUTPUT ON\nDECLARE\n c_limit CONSTANT PLS_INTEGER := 25000;\n TYPE t_nums IS TABLE OF PLS_INTEGER INDEX BY PLS_INTEGER;\n v_nums t_nums;\n v_ludic t_nums;\n v_count_ludic PLS_INTEGER;\n v_count_pos PLS_INTEGER;\n v_pos PLS_INTEGER;\n v_next_ludic PLS_INTEGER;\n\n FUNCTION is_ludic(p_num PLS_INTEGER) RETURN BOOLEAN IS\n BEGIN\n FOR i IN 1..v_ludic.COUNT LOOP\n EXIT WHEN v_ludic(i) > p_num;\n IF v_ludic(i) = p_num THEN\n RETURN TRUE;\n END IF;\n END LOOP;\n RETURN FALSE;\n END;\n\nBEGIN\n FOR i IN 1..c_limit LOOP\n v_nums(i) := i;\n END LOOP;\n\n v_count_ludic := 1;\n v_next_ludic := 1;\n v_ludic(v_count_ludic) := v_next_ludic;\n v_nums.DELETE(1);\n\n WHILE v_nums.COUNT > 0 LOOP\n v_pos := v_nums.FIRST;\n v_next_ludic := v_nums(v_pos);\n v_count_ludic := v_count_ludic + 1;\n v_ludic(v_count_ludic) := v_next_ludic;\n v_count_pos := 0;\n WHILE v_pos IS NOT NULL LOOP\n IF MOD(v_count_pos, v_next_ludic) = 0 THEN\n v_nums.DELETE(v_pos);\n END IF;\n v_pos := v_nums.NEXT(v_pos);\n v_count_pos := v_count_pos + 1;\n END LOOP;\n END LOOP;\n\n dbms_output.put_line('Generate and show here the first 25 ludic numbers.');\n FOR i IN 1..25 LOOP\n dbms_output.put(v_ludic(i) || ' ');\n END LOOP;\n dbms_output.put_line('');\n\n dbms_output.put_line('How many ludic numbers are there less than or equal to 1000?');\n v_count_ludic := 0;\n FOR i IN 1..v_ludic.COUNT LOOP\n EXIT WHEN v_ludic(i) > 1000;\n v_count_ludic := v_count_ludic + 1;\n END LOOP;\n dbms_output.put_line(v_count_ludic);\n\n dbms_output.put_line('Show the 2000..2005''th ludic numbers.');\n FOR i IN 2000..2005 LOOP\n dbms_output.put(v_ludic(i) || ' ');\n END LOOP;\n dbms_output.put_line('');\n\n dbms_output.put_line('A triplet is any three numbers x, x + 2, x + 6 where all three numbers are also ludic numbers.');\n dbms_output.put_line('Show all triplets of ludic numbers < 250 (Stretch goal)');\n FOR i IN 1..v_ludic.COUNT LOOP\n EXIT WHEN (v_ludic(i)+6) >= 250;\n IF is_ludic(v_ludic(i)+2) AND is_ludic(v_ludic(i)+6) THEN\n dbms_output.put_line(v_ludic(i) || ', ' || (v_ludic(i)+2) || ', ' || (v_ludic(i)+6));\n END IF;\n END LOOP;\n\nEND;\n/\n","language":"PL-SQL"},{"code":"# Start with a pool large enough to meet the requirements\n$Pool = [System.Collections.ArrayList]( 2..22000 )\n\n# Start with 1, because it's grandfathered in\n$Ludic = @( 1 )\n\n# While the size of the pool is still larger than the next Ludic number...\nWhile ( $Pool.Count -gt $Pool[0] )\n {\n # Add the next Ludic number to the list\n $Ludic += $Pool[0]\n\n # Remove from the pool all entries whose index is a multiple of the next Ludic number\n [math]::Truncate( ( $Pool.Count - 1 )/ $Pool[0])..0 | ForEach { $Pool.RemoveAt( $_ * $Pool[0] ) }\n }\n\n# Add the rest of the numbers in the pool to the list of Ludic numbers\n$Ludic += $Pool.ToArray()\n","language":"PowerShell"},{"code":"# Display the first 25 Ludic numbers\n$Ludic[0..24] -join \", \"\n''\n\n# Display the count of all Ludic numbers under 1000\n$Ludic.Where{ $_ -le 1000 }.Count\n''\n\n# Display the 2000th through the 2005th Ludic number\n$Ludic[1999..2004] -join \", \"\n''\n\n# Display all Ludic triplets less than 250\n$TripletStart = $Ludic.Where{ $_ -lt 244 -and ( $_ + 2 ) -in $Ludic -and ( $_ + 6 ) -in $Ludic }\n$TripletStart.ForEach{ $_, ( $_ + 2 ), ( $_ + 6 ) -join \", \" }\n","language":"PowerShell"},{"code":"% John Devou: 26-Nov-2021\n\nd(_,_,[],[]).\nd(N,N,[_|Xs],Rs):- d(N,1,Xs,Rs).\nd(N,M,[X|Xs],[X|Rs]):- M < N, M_ is M+1, d(N,M_,Xs,Rs).\n\nl([],[]).\nl([X|Xs],[X|Rs]):- d(X,1,Xs,Ys), l(Ys,Rs).\n\n% g(N,L):- generate in L a list with Ludic numbers up to N\n\ng(N,[1|X]):- numlist(2,N,L), l(L,X).\n\ns(0,Xs,[],Xs).\ns(N,[X|Xs],[X|Ls],Rs):- N > 0, M is N-1, s(M,Xs,Ls,Rs).\n\nt([X,Y,Z|_],[X,Y,Z]):- Y =:= X+2, Z =:= X+6.\nt([_,Y,Z|Xs],R):- t([Y,Z|Xs],R).\n\n% tasks\n\nt1:- g(500,L), s(25,L,X,_), write(X), !.\nt2:- g(1000,L), length(L,X), write(X), !.\nt3:- g(22000,L), s(1999,L,_,R), s(6,R,X,_), write(X), !.\nt4:- g(249,L), findall(A, t(L,A), X), write(X), !.\n","language":"Prolog"},{"code":"EnableExplicit\nIf Not OpenConsole() : End 1 : EndIf\n\n#NMAX=25000\n\nDim ludic.b(#NMAX)\nFillMemory(@ludic(0),SizeOf(Byte)*#NMAX,#True,#PB_Byte)\n\nDefine.i i,j,n,c1,c2\nDefine r1$,r2$,r3$,r4$\n\nFor i=2 To Int(#NMAX/2)\n If ludic(i)\n n=0\n For j=i+1 To #NMAX\n If ludic(j) : n+1 : EndIf\n If n=i : ludic(j)=#False : n=0 : EndIf\n Next j\n EndIf\nNext i\n\nn=0 : c1=0 : c2=0\nFor i=1 To #NMAX\n If ludic(i) And n<25 : n+1 : r1$+Str(i)+\" \" : EndIf\n If i<=1000 : c1+Bool(ludic(i)) : EndIf\n c2+Bool(ludic(i))\n If c2>=2000 And c2<=2005 And ludic(i) : r3$+Str(i)+\" \" : EndIf\n If i<243 And ludic(i) And ludic(i+2) And ludic(i+6)\n r4$+\"[\"+Str(i)+\" \"+Str(i+2)+\" \"+Str(i+6)+\"] \"\n EndIf\nNext\nr2$=Str(c1)\n\nPrintN(\"First 25 Ludic numbers: \" +r1$)\nPrintN(\"Ludic numbers below 1000: \" +r2$)\nPrintN(\"Ludic numbers 2000 to 2005: \" +r3$)\nPrintN(\"Ludic Triplets below 250: \" +r4$)\nInput()\nEnd\n","language":"PureBasic"},{"code":"def ludic(nmax=100000):\n yield 1\n lst = list(range(2, nmax + 1))\n while lst:\n yield lst[0]\n del lst[::lst[0]]\n\nludics = [l for l in ludic()]\n\nprint('First 25 ludic primes:')\nprint(ludics[:25])\nprint(\"\\nThere are %i ludic numbers <= 1000\"\n % sum(1 for l in ludics if l <= 1000))\nprint(\"\\n2000'th..2005'th ludic primes:\")\nprint(ludics[2000-1: 2005])\n\nn = 250\ntriplets = [(x, x+2, x+6)\n for x in ludics\n if x+6 < n and x+2 in ludics and x+6 in ludics]\nprint('\\nThere are %i triplets less than %i:\\n %r'\n % (len(triplets), n, triplets))\n","language":"Python"},{"code":"def ludic(nmax=64):\n yield 1\n taken = []\n while True:\n lst, nmax = list(range(2, nmax + 1)), nmax * 2\n for t in taken:\n del lst[::t]\n while lst:\n t = lst[0]\n taken.append(t)\n yield t\n del lst[::t]\n","language":"Python"},{"code":"def ludic():\n yield 1\n ludics = []\n while True:\n k = 0\n for j in reversed(ludics):\n k = (k*j)//(j-1) + 1\n ludics.append(k+2)\n yield k+2\ndef triplets():\n a, b, c, d = 0, 0, 0, 0\n for k in ludic():\n if k-4 in (b, c, d) and k-6 in (a, b, c):\n yield k-6, k-4, k\n a, b, c, d = b, c, d, k\n\nfirst_25 = [k for i, k in zip(range(25), gen_ludic())]\nprint(f'First 25 ludic numbers: {first_25}')\ncount = 0\nfor k in gen_ludic():\n if k > 1000:\n break\n count += 1\nprint(f'Number of ludic numbers <= 1000: {count}')\nit = iter(gen_ludic())\nfor i in range(1999):\n next(it)\nludic2000 = [next(it) for i in range(6)]\nprint(f'Ludic numbers 2000..2005: {ludic2000}')\n\nprint('Ludic triplets < 250:')\nfor a, b, c in triplets():\n if c >= 250:\n break\n print(f'[{a}, {b}, {c}]')\n","language":"Python"},{"code":" [ 0 over of\n swap times\n [ i 1+ swap i poke ]\n 1 split\n [ dup 0 peek\n rot over join unrot\n over size over > while\n 1 - temp put\n [] swap\n [ behead drop\n temp share split\n dip join\n dup [] = until ]\n drop temp release\n again ]\n drop behead drop join ] is ludic ( n --> [ )\n\n 999 ludic\n say \"First 25 ludic numbers: \"\n dup 25 split drop echo\n cr cr\n say \"There are \"\n size echo\n say \" ludic numbers less than 1000.\"\n cr cr\n 25000 ludic\n say \"Ludic numbers 2000 to 2005: \"\n 1999 split nip 6 split drop echo\n","language":"Quackery"},{"code":"#lang racket\n(define lucid-sieve-size 25000) ; this should be enough to do me!\n(define lucid?\n (let ((lucid-bytes-sieve\n (delay\n (define sieve-bytes (make-bytes lucid-sieve-size 1))\n (bytes-set! sieve-bytes 0 0) ; not a lucid number\n (define (sieve-pass L)\n (let loop ((idx (add1 L)) (skip (sub1 L)))\n (cond\n [(= idx lucid-sieve-size)\n (for/first ((rv (in-range (add1 L) lucid-sieve-size))\n #:unless (zero? (bytes-ref sieve-bytes rv))) rv)]\n [(zero? (bytes-ref sieve-bytes idx))\n (loop (add1 idx) skip)]\n [(= skip 0)\n (bytes-set! sieve-bytes idx 0)\n (loop (add1 idx) (sub1 L))]\n [else (loop (add1 idx) (sub1 skip))])))\n (let loop ((l 2))\n (when l (loop (sieve-pass l))))\n sieve-bytes)))\n\n (λ (n) (= 1 (bytes-ref (force lucid-bytes-sieve) n)))))\n\n(define (dnl . things) (for-each displayln things))\n\n(dnl\n \"Generate and show here the first 25 ludic numbers.\"\n (for/list ((_ 25) (l (sequence-filter lucid? (in-naturals)))) l)\n \"How many ludic numbers are there less than or equal to 1000?\"\n (for/sum ((n 1001) #:when (lucid? n)) 1)\n \"Show the 2000..2005'th ludic numbers.\"\n (for/list ((i 2006) (l (sequence-filter lucid? (in-naturals))) #:when (>= i 2000)) l)\n #<<EOS\nA triplet is any three numbers x, x + 2, x + 6 where all three numbers are\nalso ludic numbers. Show all triplets of ludic numbers < 250 (Stretch goal)\nEOS\n (for/list ((x (in-range 250)) #:when (and (lucid? x) (lucid? (+ x 2)) (lucid? (+ x 6))))\n (list x (+ x 2) (+ x 6))))\n","language":"Racket"},{"code":"constant @ludic = gather {\n my @taken = take 1;\n my @rotor;\n\n for 2..* -> $i {\n loop (my $j = 0; $j < @rotor; $j++) {\n --@rotor[$j] or last;\n }\n if $j < @rotor {\n @rotor[$j] = @taken[$j+1];\n }\n else {\n push @taken, take $i;\n push @rotor, @taken[$j+1];\n }\n }\n }\n\nsay @ludic[^25];\nsay \"Number of Ludic numbers <= 1000: \", +(@ludic ...^ * > 1000);\nsay \"Ludic numbers 2000..2005: \", @ludic[1999..2004];\n\nmy \\l250 = set @ludic ...^ * > 250;\nsay \"Ludic triples < 250: \", gather\n for l250.keys.sort -> $a {\n my $b = $a + 2;\n my $c = $a + 6;\n take \"<$a $b $c>\" if $b ∈ l250 and $c ∈ l250;\n }\n","language":"Raku"},{"code":"/*REXX program gens/shows (a range of) ludic numbers, or a count when a range is used.*/\nparse arg N count bot top triples . /*obtain optional arguments from the CL*/\nif N=='' | N==\",\" then N= 25 /*Not specified? Then use the default.*/\nif count=='' | count==\",\" then count= 1000 /* \" \" \" \" \" \" */\nif bot=='' | bot==\",\" then bot= 2000 /* \" \" \" \" \" \" */\nif top=='' | top==\",\" then top= 2005 /* \" \" \" \" \" \" */\nif triples=='' | triples==\",\" then triples= 249 /* \" \" \" \" \" \" */\n#= 0 /*the number of ludic numbers (so far).*/\n$= ludic( max(N, count, bot, top, triples) ) /*generate enough ludic nums*/\nsay 'The first ' N \" ludic numbers: \" subword($,1,25) /*display 1st N ludic nums*/\n do j=1 until word($, j) > count /*search up to a specific #.*/\n end /*j*/\nsay\nsay \"There are \" j - 1 ' ludic numbers that are ≤ ' count\nsay\nsay \"The \" bot '───►' top ' (inclusive) ludic numbers are: ' subword($, bot)\n@= /*list of ludic triples found (so far).*/\n do j=1 for words($)\n _= word($, j) /*it is known that ludic _ exists. */\n if _>=triples then leave /*only process up to a specific number.*/\n if wordpos(_+2, $)==0 | wordpos(_+6, $)==0 then iterate /*Not triple? Skip it.*/\n #= # + 1 /*bump the triple counter. */\n @= @ '◄'_ _+2 _+6\"► \" /*append the newly found triple ──► @ */\n end /*j*/\nsay\nif @=='' then say 'From 1──►'triples\", no triples found.\"\n else say 'From 1──►'triples\", \" # ' triples found:' @\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nludic: procedure; parse arg m,,@; $= 1 2 /*$≡ludic numbers superset; @≡sequence*/\n do j=3 by 2 to m*15; @= @ j /*construct an initial list of numbers.*/\n end /*j*/\n @= @' '; n= words(@) /*append a blank to the number sequence*/\n do while n\\==0; f= word(@, 1) /*examine the first word in the @ list.*/\n $= $ f /*add the word to the $ list. */\n do d=1 by f while d<=n; n= n-1 /*use 1st number, elide all occurrences*/\n @= changestr(' 'word(@, d)\" \", @, ' . ') /*cross─out a number in @ */\n end /*d*/ /* [↑] done eliding the \"1st\" number. */\n @= translate(@, , .) /*change dots to blanks; count numbers.*/\n end /*while*/ /* [↑] done eliding ludic numbers. */\n return subword($, 1, m) /*return a range of ludic numbers. */\n","language":"REXX"},{"code":"# Project : Ludic numbers\n\nludic = list(300)\nresludic = []\nnr = 1\nfor n = 1 to len(ludic)\n ludic[n] = n+1\nnext\nsee \"the first 25 Ludic numbers are:\" + nl\nludicnumbers(ludic)\nshowarray(resludic)\nsee nl\n\nsee \"Ludic numbers below 1000: \"\nludic = list(3000)\nresludic = []\nfor n = 1 to len(ludic)\n ludic[n] = n+1\nnext\nludicnumbers(ludic)\nshowarray2(resludic)\nsee nr\nsee nl + nl\n\nsee \"the 2000..2005th Ludic numbers are:\" + nl\nludic = list(60000)\nresludic = []\nfor n = 1 to len(ludic)\n ludic[n] = n+1\nnext\nludicnumbers(ludic)\nshowarray3(resludic)\n\nfunc ludicnumbers(ludic)\n for n = 1 to len(ludic)\n delludic = []\n for m = 1 to len(ludic) step ludic[1]\n add(delludic, m)\n next\n add(resludic, ludic[1])\n for p = len(delludic) to 1 step -1\n del(ludic, delludic[p])\n next\n next\n\nfunc showarray(vect)\n see \"[1, \"\n svect = \"\"\n for n = 1 to 24\n svect = svect + vect[n] + \", \"\n next\n svect = left(svect, len(svect) - 2)\n see svect\n see \"]\" + nl\n\nfunc showarray2(vect)\n for n = 1 to len(vect)\n if vect[n] <= 1000\n nr = nr + 1\n ok\n next\n return nr\n\nfunc showarray3(vect)\n see \"[\"\n svect = \"\"\n for n = 1999 to 2004\n svect = svect + vect[n] + \", \"\n next\n svect = left(svect, len(svect) - 2)\n see svect\n see \"]\" + nl\n","language":"Ring"},{"code":"def ludic(nmax=100000)\n Enumerator.new do |y|\n y << 1\n ary = *2..nmax\n until ary.empty?\n y << (n = ary.first)\n (0...ary.size).step(n){|i| ary[i] = nil}\n ary.compact!\n end\n end\nend\n\nputs \"First 25 Ludic numbers:\", ludic.first(25).to_s\n\nputs \"Ludics below 1000:\", ludic(1000).count\n\nputs \"Ludic numbers 2000 to 2005:\", ludic.first(2005).last(6).to_s\n\nludics = ludic(250).to_a\nputs \"Ludic triples below 250:\",\n ludics.select{|x| ludics.include?(x+2) and ludics.include?(x+6)}.map{|x| [x, x+2, x+6]}.to_s\n","language":"Ruby"},{"code":"const ARRAY_MAX: usize = 25_000;\nconst LUDIC_MAX: usize = 2100;\n\n/// Calculates and returns the first `LUDIC_MAX` Ludic numbers.\n///\n/// Needs a sufficiently large `ARRAY_MAX`.\nfn ludic_numbers() -> Vec<usize> {\n // The first two Ludic numbers\n let mut numbers = vec![1, 2];\n // We start the array with an immediate first removal to reduce memory usage by\n // collecting only odd numbers.\n numbers.extend((3..ARRAY_MAX).step_by(2));\n\n // We keep the correct Ludic numbers in place, removing the incorrect ones.\n for ludic_idx in 2..LUDIC_MAX {\n let next_ludic = numbers[ludic_idx];\n\n // We remove incorrect numbers by counting the indices after the correct numbers.\n // We start from zero and keep until we reach the potentially incorrect numbers.\n // Then we keep only those not divisible by the `next_ludic`.\n let mut idx = 0;\n numbers.retain(|_| {\n let keep = idx <= ludic_idx || (idx - ludic_idx) % next_ludic != 0;\n idx += 1;\n keep\n });\n }\n\n numbers\n}\n\nfn main() {\n let ludic_numbers = ludic_numbers();\n\n print!(\"First 25: \");\n print_n_ludics(&ludic_numbers, 25);\n println!();\n print!(\"Number of Ludics below 1000: \");\n print_num_ludics_upto(&ludic_numbers, 1000);\n println!();\n print!(\"Ludics from 2000 to 2005: \");\n print_ludics_from_to(&ludic_numbers, 2000, 2005);\n println!();\n println!(\"Triplets below 250: \");\n print_triplets_until(&ludic_numbers, 250);\n}\n\n/// Prints the first `n` Ludic numbers.\nfn print_n_ludics(x: &[usize], n: usize) {\n println!(\"{:?}\", &x[..n]);\n}\n\n/// Calculates how many Ludic numbers are below `max_num`.\nfn print_num_ludics_upto(x: &[usize], max_num: usize) {\n let num = x.iter().take_while(|&&i| i < max_num).count();\n println!(\"{}\", num);\n}\n\n/// Prints Ludic numbers between two numbers.\nfn print_ludics_from_to(x: &[usize], from: usize, to: usize) {\n println!(\"{:?}\", &x[from - 1..to - 1]);\n}\n\n/// Calculates triplets until a certain Ludic number.\nfn triplets_below(ludics: &[usize], limit: usize) -> Vec<(usize, usize, usize)> {\n ludics\n .iter()\n .enumerate()\n .take_while(|&(_, &num)| num < limit)\n .filter_map(|(idx, &number)| {\n let triplet_2 = number + 2;\n let triplet_3 = number + 6;\n\n // Search for the other two triplet numbers. We know they are larger than\n // `number` so we can give the searches lower bounds of `idx + 1` and\n // `idx + 2`. We also know that the `n + 2` number can only ever be two\n // numbers away from the previous and the `n + 6` number can only be four\n // away (because we removed some in between). Short circuiting and doing\n // the check more likely to fail first are also useful.\n let is_triplet = ludics[idx + 1..idx + 3].binary_search(&triplet_2).is_ok()\n && ludics[idx + 2..idx + 5].binary_search(&triplet_3).is_ok();\n\n if is_triplet {\n Some((number, triplet_2, triplet_3))\n } else {\n None\n }\n })\n .collect()\n}\n\n/// Prints triplets until a certain Ludic number.\nfn print_triplets_until(ludics: &[usize], limit: usize) {\n for (number, triplet_2, triplet_3) in triplets_below(ludics, limit) {\n println!(\"{} {} {}\", number, triplet_2, triplet_3);\n }\n}\n","language":"Rust"},{"code":"object Ludic {\n def main(args: Array[String]): Unit = {\n println(\n s\"\"\"|First 25 Ludic Numbers: ${ludic.take(25).mkString(\", \")}\n |Ludic Numbers <= 1000: ${ludic.takeWhile(_ <= 1000).size}\n |2000-2005th Ludic Numbers: ${ludic.slice(1999, 2005).mkString(\", \")}\n |Triplets <= 250: ${triplets.takeWhile(_._3 <= 250).mkString(\", \")}\"\"\".stripMargin)\n }\n\n def dropByN[T](lst: LazyList[T], len: Int): LazyList[T] = lst.grouped(len).flatMap(_.init).to(LazyList)\n def ludic: LazyList[Int] = 1 #:: LazyList.unfold(LazyList.from(2)){case n +: ns => Some((n, dropByN(ns, n)))}\n def triplets: LazyList[(Int, Int, Int)] = LazyList.from(1).map(n => (n, n + 2, n + 6)).filter{case (a, b, c) => Seq(a, b, c).forall(ludic.takeWhile(_ <= c).contains)}\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n\nconst func set of integer: ludicNumbers (in integer: n) is func\n result\n var set of integer: ludicNumbers is {1};\n local\n var set of integer: sieve is EMPTY_SET;\n var integer: ludicNumber is 0;\n var integer: number is 0;\n var integer: count is 0;\n begin\n sieve := {2 .. n};\n while sieve <> EMPTY_SET do\n ludicNumber := min(sieve);\n incl(ludicNumbers, ludicNumber);\n count := 0;\n for number range sieve do\n if count rem ludicNumber = 0 then\n excl(sieve, number);\n end if;\n incr(count);\n end for;\n end while;\n end func;\n\nconst integer: limit is 22000;\nconst set of integer: ludicNumbers is ludicNumbers(limit);\n\nconst proc: main is func\n local\n var integer: number is 0;\n var integer: count is 0;\n begin\n write(\"First 25:\");\n for number range ludicNumbers until count = 25 do\n write(\" \" <& number);\n incr(count);\n end for;\n writeln;\n count := 0;\n for number range ludicNumbers until number > 1000 do\n incr(count);\n end for;\n writeln(\"Ludics below 1000: \" <& count);\n write(\"Ludic 2000 to 2005:\");\n count := 0;\n for number range ludicNumbers until count >= 2005 do\n incr(count);\n if count >= 2000 then\n write(\" \" <& number);\n end if;\n end for;\n writeln;\n write(\"Triples below 250:\");\n for number range ludicNumbers until number > 250 do\n if number + 2 in ludicNumbers and number + 6 in ludicNumbers then\n write(\" (\" <& number <& \", \" <& number + 2 <& \", \" <& number + 6 <& \")\");\n end if;\n end for;\n writeln;\n end func;\n","language":"Seed7"},{"code":"import <Utilities/Set.sl>;\n\nludic(v(1), result(1)) :=\n\tlet\n\t\tn := head(v);\n\t\tfiltered[i] := v[i] when (i-1) mod n /= 0;\n\tin\n\tresult when size(v) < 1 else\n\tludic(filtered, result ++ [n]);\n\t\t\ncount : int(1) * int * int -> int;\ncount(v(1), top, index) :=\n\tindex-1 when v[index] > top else\n\tcount(v, top, index + 1);\n\nmain() :=\n\tlet\n\t\tludics := ludic(2...100000, [1]);\n\t\tludics250 := ludics[1 ... count(ludics, 250, 1)];\n\t\ttriplets[i] := [i, i+2, i+6] when elementOf(i+2, ludics250) and elementOf(i+6, ludics250)\n\t\t\t\t\t\t\tforeach i within ludics250;\n\tin\n\t\t\"First 25:\\n\" ++ toString(ludics[1...25]) ++\n\t\t\"\\n\\nLudics below 1000:\\n\" ++ toString(count(ludics, 1000, 1)) ++\n\t\t\"\\n\\nLudic 2000 to 2005:\\n\" ++ toString(ludics[2000...2005]) ++\n\t\t\"\\n\\nTriples below 250:\\n\" ++ toString(triplets) ;\n","language":"SequenceL"},{"code":"func ludics_upto(nmax=100000) {\n Enumerator({ |collect|\n collect(1)\n var arr = @(2..nmax)\n while (arr) {\n collect(var n = arr[0])\n arr.range.by(n).each {|i| arr[i] = nil}\n arr.compact!\n }\n })\n}\n\nfunc ludics_first(n) {\n ludics_upto(n * n.log2).first(n)\n}\n\nsay(\"First 25 Ludic numbers: \", ludics_first(25).join(' '))\nsay(\"Ludics below 1000: \", ludics_upto(1000).len)\nsay(\"Ludic numbers 2000 to 2005: \", ludics_first(2005).last(6).join(' '))\n\nvar a = ludics_upto(250).to_a\nsay(\"Ludic triples below 250: \", a.grep{|x| a.contains_all([x+2, x+6]) } \\\n .map {|x| '(' + [x, x+2, x+6].join(' ') + ')' } \\\n .join(' '))\n","language":"Sidef"},{"code":"open List;\n\nfun Ludi [] = []\n | Ludi (T as h::L) =\n let\n fun next (h:: L ) =\n let\n val nw = #2 (ListPair.unzip (filter (fn (a,b) => a mod #2 h <> 0) L) )\n in\n ListPair.zip ( List.tabulate(List.length nw,fn i=>i) ,nw)\n end\n in\n h :: Ludi ( next T)\n end;\n\nval ludics = 1:: (#2 (ListPair.unzip(Ludi (ListPair.zip ( List.tabulate(25000,fn i=>i),tabulate (25000,fn i=>i+2)) )) ));\n\napp ((fn e => print (e^\" \")) o Int.toString ) (take (ludics,25));\nlength (filter (fn e=> e <= 1000) ludics);\ndrop (take (ludics,2005),1999);\n","language":"Standard-ML"},{"code":"package require Tcl 8.6\n\nproc ludic n {\n global ludicList ludicGenerator\n for {} {[llength $ludicList] <= $n} {lappend ludicList $i} {\n\tset i [$ludicGenerator]\n\tset ludicGenerator [coroutine L_$i apply {{gen k} {\n\t yield [info coroutine]\n\t while true {\n\t\tset val [$gen]\n\t\tif {[incr i] == $k} {set i 0} else {yield $val}\n\t }\n\t}} $ludicGenerator $i]\n }\n return [lindex $ludicList $n]\n}\n# Bootstrap the generator sequence\nset ludicList [list 1]\nset ludicGenerator [coroutine L_1 apply {{} {\n set n 1\n yield [info coroutine]\n while true {yield [incr n]}\n}}]\n\n# Default of 1000 is not enough\ninterp recursionlimit {} 5000\n\nfor {set i 0;set l {}} {$i < 25} {incr i} {lappend l [ludic $i]}\nputs \"first25: [join $l ,]\"\n\nfor {set i 0} {[ludic $i] <= 1000} {incr i} {}\nputs \"below=1000: $i\"\n\nfor {set i 1999;set l {}} {$i < 2005} {incr i} {lappend l [ludic $i]}\nputs \"2000-2005: [join $l ,]\"\n\nfor {set i 0} {[ludic $i] < 256} {incr i} {set isl([ludic $i]) $i}\nfor {set i 1;set l {}} {$i < 250} {incr i} {\n if {[info exists isl($i)] && [info exists isl([expr {$i+2}])] && [info exists isl([expr {$i+6}])]} {\n\tlappend l ($i,[expr {$i+2}],[expr {$i+6}])\n }\n}\nputs \"triplets: [join $l ,]\"\n","language":"Tcl"},{"code":"const max_i32 = 1<<31 - 1 // i.e. math.MaxInt32\n// ludic returns a slice of ludic numbers stopping after\n// either n entries or when max is exceeded.\n// Either argument may be <=0 to disable that limit.\nfn ludic(nn int, m int) []u32 {\n mut n := nn\n mut max := m\n if max > 0 && n < 0 {\n n = max_i32\n }\n if n < 1 {\n return []\n }\n if max < 0 {\n max = max_i32\n }\n mut sieve := []u32{len: 10760} // XXX big enough for 2005 ludics\n sieve[0] = 1\n sieve[1] = 2\n if n > 2 {\n // We start with even numbers already removed\n for i, j := 2, u32(3); i < sieve.len; i, j = i+1, j+2 {\n sieve[i] = j\n }\n // We leave the ludic numbers in place,\n // k is the index of the next ludic\n for k := 2; k < n; k++ {\n mut l := int(sieve[k])\n if l >= max {\n n = k\n break\n }\n mut i := l\n l--\n // last is the last valid index\n mut last := k + i - 1\n for j := k + i + 1; j < sieve.len; i, j = i+1, j+1 {\n last = k + i\n sieve[last] = sieve[j]\n if i%l == 0 {\n j++\n }\n }\n // Truncate down to only the valid entries\n if last < sieve.len-1 {\n sieve = sieve[..last+1]\n }\n }\n }\n if n > sieve.len {\n panic(\"program error\") // should never happen\n }\n return sieve[..n]\n}\n\nfn has(x []u32, v u32) bool {\n for i := 0; i < x.len && x[i] <= v; i++ {\n if x[i] == v {\n return true\n }\n }\n return false\n}\n\nfn main() {\n // ludic() is so quick we just call it repeatedly\n println(\"First 25: ${ludic(25, -1)}\")\n println(\"Numner of ludics below 1000: ${ludic(-1, 1000).len}\")\n println(\"ludic 2000 to 2005: ${ludic(2005, -1)[1999..]}\")\n\n print(\"Tripples below 250:\")\n x := ludic(-1, 250)\n for i, v in x[..x.len-2] {\n if has(x[i+1..], v+2) && has(x[i+2..], v+6) {\n print(\", ($v ${v+2} ${v+6})\")\n }\n }\n println('')\n}\n","language":"V-(Vlang)"},{"code":"Set list = CreateObject(\"System.Collections.Arraylist\")\nSet ludic = CreateObject(\"System.Collections.Arraylist\")\n\n'populate the list\nFor i = 1 To 25000\n\tlist.Add i\nNext\n\n'set 1 as the first ludic number\nludic.Add list(0)\nlist.RemoveAt(0)\n\n'variable to count ludic numbers <= 1000\nup_to_1k = 1\n\n'determine the succeeding ludic numbers\nFor j = 2 To 2005\n\tIf list.Count > 0 Then\n\t\tIf list(0) <= 1000 Then\n\t\t\tup_to_1k = up_to_1k + 1\n\t\tEnd If\n\t\tludic.Add list(0)\n\tElse\n\t\tExit For\n\tEnd If\n\tincrement = list(0) - 1\n\tn = 0\n\tDo While n <= list.Count - 1\n\t\tlist.RemoveAt(n)\n\t\tn = n + increment\n\tLoop\nNext\n\n'the first 25 ludics\nWScript.StdOut.WriteLine \"First 25 Ludic Numbers:\"\nFor k = 0 To 24\n\tIf k < 24 Then\n\t\tWScript.StdOut.Write ludic(k) & \", \"\n\tElse\n\t\tWScript.StdOut.Write ludic(k)\n\tEnd If\nNext\nWScript.StdOut.WriteBlankLines(2)\n\n'the number of ludics up to 1000\nWScript.StdOut.WriteLine \"Ludics up to 1000: \"\nWScript.StdOut.WriteLine up_to_1k\nWScript.StdOut.WriteBlankLines(1)\n\n'2000th - 2005th ludics\nWScript.StdOut.WriteLine \"The 2000th - 2005th Ludic Numbers:\"\nFor k = 1999 To 2004\n\tIf k < 2004 Then\n\t\tWScript.StdOut.Write ludic(k) & \", \"\n\tElse\n\t\tWScript.StdOut.Write ludic(k)\n\tEnd If\nNext\nWScript.StdOut.WriteBlankLines(2)\n\n'triplets up to 250: x, x+2, and x+6\nWScript.StdOut.WriteLine \"Ludic Triplets up to 250: \"\ntriplets = \"\"\nk = 0\nDo While ludic(k) + 6 <= 250\n\tx2 = ludic(k) + 2\n\tx6 = ludic(k) + 6\n\tIf ludic.IndexOf(x2,1) > 0 And ludic.IndexOf(x6,1) > 0 Then\n\t\ttriplets = triplets & ludic(k) & \", \" & x2 & \", \" & x6 & vbCrLf\n\tEnd If\n\tk = k + 1\nLoop\nWScript.StdOut.WriteLine triplets\n","language":"VBScript"},{"code":"import \"./fmt\" for Fmt\n\nvar ludic = Fn.new { |n, max|\n var maxInt32 = 2.pow(31) - 1\n if (max > 0 && n < 0) n = maxInt32\n if (n < 1) return []\n if (max < 0) max = maxInt32\n var sieve = List.filled(10760, 0)\n sieve[0] = 1\n sieve[1] = 2\n if (n > 2) {\n var j = 3\n for (i in 2...sieve.count) {\n sieve[i] = j\n j = j + 2\n }\n for (k in 2...n) {\n var l = sieve[k]\n if (l >= max) {\n n = k\n break\n }\n var i = l\n l = l - 1\n var last = k + i - 1\n var j = k + i + 1\n while (j < sieve.count) {\n last = k + i\n sieve[last] = sieve[j]\n if (i%l == 0) j = j + 1\n i = i + 1\n j = j + 1\n }\n if (last < sieve.count-1) sieve = sieve[0..last]\n }\n }\n if (n > sieve.count) Fiber.abort(\"Program error.\")\n return sieve[0...n]\n}\n\nvar has = Fn.new { |x, v|\n var i = 0\n while (i < x.count && x[i] <= v) {\n if (x[i] == v) return true\n i = i + 1\n }\n return false\n}\n\nSystem.print(\"First 25: %(ludic.call(25, -1))\")\nSystem.print(\"Number of Ludics below 1000: %(ludic.call(-1, 1000).count)\")\nSystem.print(\"Ludics 2000 to 2005: %(ludic.call(2005, -1)[1999..-1])\")\nSystem.print(\"Triplets below 250:\")\nvar x = ludic.call(-1, 250)\nvar i = 0\nvar triples = []\nfor (v in x.take(x.count-2)) {\n if (has.call(x[i+1..-1], v+2) && has.call(x[i+2..-1], v+6)) {\n triples.add([v, v+2, v+6])\n }\n i = i + 1\n}\nSystem.print(triples)\n","language":"Wren"},{"code":"def Size = 25000;\nchar Sieve(1+Size);\nint I, Count, Ludic;\n[\\Make sieve for Ludic numbers\nfor I:= 1 to Size do Sieve(I):= true;\nLudic:= 2;\nloop [I:= Ludic; Count:= Ludic;\n loop [repeat I:= I+1;\n if I > Size then quit;\n until Sieve(I);\n Count:= Count-1;\n if Count = 0 then\n [Sieve(I):= false;\n Count:= Ludic;\n ];\n ];\n repeat Ludic:= Ludic+1;\n if Ludic > Size then quit;\n until Sieve(Ludic);\n ];\n\\Show first 25 Ludic numbers\nCount:= 0; I:= 1;\nloop [if Sieve(I) then\n [IntOut(0, I); ChOut(0, ^ );\n Count:= Count+1;\n if Count >= 25 then quit;\n ];\n I:= I+1;\n ];\nCrLf(0);\n\\Show how many Ludic numbers are <= 1000\nCount:= 0;\nfor I:= 1 to 1000 do\n if Sieve(I) then Count:= Count+1;\nIntOut(0, Count);\nCrLf(0);\n\\Show Ludic numbers from 2000 to 2005\nCount:= 0; I:= 1;\nloop [if Sieve(I) then\n [Count:= Count+1;\n if Count >= 2000 then\n [IntOut(0, I); ChOut(0, ^ )];\n if Count >= 2005 then quit;\n ];\n I:= I+1;\n ];\nCrLf(0);\n\\Show triplets of Ludic numbers < 250\nfor I:= 1 to 250-1-6 do\n if Sieve(I) & Sieve(I+2) & Sieve(I+6) then\n [ChOut(0, ^();\n IntOut(0, I); ChOut(0, ^ );\n IntOut(0, I+2); ChOut(0, ^ );\n IntOut(0, I+6); Text(0, \") \");\n ];\nCrLf(0);\n]\n","language":"XPL0"},{"code":"fcn dropNth(n,seq){\n seq.tweak(fcn(n,skipper,idx){ if(0==idx.inc()%skipper) Void.Skip else n }\n\t .fp1(n,Ref(1))) // skip every nth number of previous sequence\n}\nfcn ludic{ //-->Walker\n Walker(fcn(rw){ w:=rw.value; n:=w.next(); rw.set(dropNth(n,w)); n }\n\t .fp(Ref([3..*,2]))) // odd numbers starting at 3\n .push(1,2); // first two Ludic numbers\n}\n","language":"Zkl"},{"code":"ludic().walk(25).toString(*).println();\nludic().reduce(fcn(sum,n){ if(n<1000) return(sum+1); return(Void.Stop,sum); },0).println();\nludic().drop(1999).walk(6).println(); // Ludic's between 2000 & 2005\n\nls:=ludic().filter(fcn(n){ (n<250) and True or Void.Stop }); // Ludic's < 250\nls.filter('wrap(n){ ls.holds(n+2) and ls.holds(n+6) }).apply(fcn(n){ T(n,n+2,n+6) }).println();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Prime Numbers\\nfrom: http://rosettacode.org/wiki/Ludic_numbers\\nnote: Sieves\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"[https://oeis.org/wiki/Ludic_numbers Ludic numbers] are related to prime numbers as they are generated by a sieve quite like the [[Sieve of Eratosthenes]] is used to generate prime numbers.\\n\\nThe first ludic number is <span style=\\\"color:blue;font-weight:bold\\\">1</span>.\\n\\nTo generate succeeding ludic numbers create an array of increasing integers starting from <span style=\\\"color:blue;font-weight:bold\\\">2</span>.\\n:<code><span style=\\\"color:blue;font-weight:bold\\\">2</span> 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ...</code>\\n(Loop)\\n* Take the first member of the resultant array as the next ludic number <span style=\\\"color:blue;font-weight:bold\\\">2</span>.\\n* Remove every '''2<sup>nd</sup>''' indexed item from the array (including the first).\\n::<code><span style=\\\"color:blue;font-weight:bold\\\"><s>2</s></span> 3 <s>4</s> 5 <s>6</s> 7 <s>8</s> 9 <s>10</s> 11 <s>12</s> 13 <s>14</s> 15 <s>16</s> 17 <s>18</s> 19 <s>20</s> 21 <s>22</s> 23 <s>24</s> 25 <s>26</s> ...</code>\\n* (Unrolling a few loops...)\\n* Take the first member of the resultant array as the next ludic number <span style=\\\"color:blue;font-weight:bold\\\">3</span>.\\n* Remove every '''3<sup>rd</sup>''' indexed item from the array (including the first).\\n::<code><span style=\\\"color:blue;font-weight:bold\\\"><s>3</s></span> 5 7 <s>9</s> 11 13 <s>15</s> 17 19 <s>21</s> 23 25 <s>27</s> 29 31 <s>33</s> 35 37 <s>39</s> 41 43 <s>45</s> 47 49 <s>51</s> ...</code>\\n* Take the first member of the resultant array as the next ludic number <span style=\\\"color:blue;font-weight:bold\\\">5</span>.\\n* Remove every '''5<sup>th</sup>''' indexed item from the array (including the first).\\n::<code><span style=\\\"color:blue;font-weight:bold\\\"><s>5</s></span> 7 11 13 17 <s>19</s> 23 25 29 31 <s>35</s> 37 41 43 47 <s>49</s> 53 55 59 61 <s>65</s> 67 71 73 77 ...</code>\\n* Take the first member of the resultant array as the next ludic number <span style=\\\"color:blue;font-weight:bold\\\">7</span>.\\n* Remove every '''7<sup>th</sup>''' indexed item from the array (including the first).\\n::<code><span style=\\\"color:blue;font-weight:bold\\\"><s>7</s></span> 11 13 17 23 25 29 <s>31</s> 37 41 43 47 53 55 <s>59</s> 61 67 71 73 77 83 <s>85</s> 89 91 97 ...</code>\\n* <big><b> ... </b></big>\\n* Take the first member of the current array as the next ludic number <span style=\\\"color:blue;font-weight:bold\\\">L</span>.\\n* Remove every '''L<sup>th</sup>''' indexed item from the array (including the first).\\n* <big><b> ... </b></big>\\n\\n\\n\\n;Task:\\n* Generate and show here the first 25 ludic numbers.\\n* How many ludic numbers are there less than or equal to 1000?\\n* Show the 2000..2005<sup>th</sup> ludic numbers.\\n\\n\\n<br>\\n;Stretch goal:\\nShow all triplets of ludic numbers < 250.\\n* A triplet is any three numbers <big><math>x,</math> <math>x+2,</math> <math>x+6</math> </big> where all three numbers are also ludic numbers. \\n\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F ludic(nmax = 100000)\\n V r = [1]\\n V lst = Array(2..nmax)\\n L !lst.empty\\n r.append(lst[0])\\n [Int] newlst\\n V step = lst[0]\\n L(i) 0 .< lst.len\\n I i % step != 0\\n newlst.append(lst[i])\\n lst = newlst\\n R r\\n\\nV ludics = ludic()\\nprint(‘First 25 ludic primes:’)\\nprint(ludics[0.<25])\\nprint(\\\"\\\\nThere are #. ludic numbers <= 1000\\\".format(sum(ludics.filter(l -> l <= 1000).map(l -> 1))))\\nprint(\\\"\\\\n2000'th..2005'th ludic primes:\\\")\\nprint(ludics[2000 - 1 .. 2004])\\nV n = 250\\nV triplets = ludics.filter(x -> x + 6 < :n &\\n x + 2 C :ludics &\\n x + 6 C :ludics).map(x -> (x, x + 2, x + 6))\\nprint(\\\"\\\\nThere are #. triplets less than #.:\\\\n #.\\\".format(triplets.len, n, triplets))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Ludic numbers 23/04/2016\\nLUDICN CSECT\\n USING LUDICN,R15 set base register\\n LH R9,NMAX r9=nmax\\n SRA R9,1 r9=nmax/2\\n LA R6,2 i=2\\nLOOPI1 CR R6,R9 do i=2 to nmax/2\\n BH ELOOPI1\\n LA R1,LUDIC-1(R6) @ludic(i)\\n CLI 0(R1),X'01' if ludic(i)\\n BNE ELOOPJ1\\n SR R8,R8 n=0\\n LA R7,1(R6) j=i+1\\nLOOPJ1 CH R7,NMAX do j=i+1 to nmax\\n BH ELOOPJ1\\n LA R1,LUDIC-1(R7) @ludic(j)\\n CLI 0(R1),X'01' if ludic(j)\\n BNE NOTJ1\\n LA R8,1(R8) n=n+1\\nNOTJ1 CR R8,R6 if n=i\\n BNE NDIFI\\n LA R1,LUDIC-1(R7) @ludic(j)\\n MVI 0(R1),X'00' ludic(j)=false\\n SR R8,R8 n=0\\nNDIFI LA R7,1(R7) j=j+1\\n B LOOPJ1\\nELOOPJ1 LA R6,1(R6) i=i+1\\n B LOOPI1\\nELOOPI1 XPRNT =C'First 25 ludic numbers:',23\\n LA R10,BUF @buf=0\\n SR R8,R8 n=0\\n LA R6,1 i=1\\nLOOPI2 CH R6,NMAX do i=1 to nmax\\n BH ELOOPI2\\n LA R1,LUDIC-1(R6) @ludic(i)\\n CLI 0(R1),X'01' if ludic(i)\\n BNE NOTI2\\n XDECO R6,XDEC i\\n MVC 0(4,R10),XDEC+8 output i\\n LA R10,4(R10) @buf=@buf+4\\n LA R8,1(R8) n=n+1\\n LR R2,R8 n\\n SRDA R2,32\\n D R2,=F'5' r2=mod(n,5)\\n LTR R2,R2 if mod(n,5)=0\\n BNZ NOTI2\\n XPRNT BUF,20\\n LA R10,BUF @buf=0\\nNOTI2 EQU *\\n CH R8,=H'25' if n=25\\n BE ELOOPI2\\n LA R6,1(R6) i=i+1\\n B LOOPI2\\nELOOPI2 MVC BUF(25),=C'Ludic numbers below 1000:'\\n SR R8,R8 n=0\\n LA R6,1 i=1\\nLOOPI3 CH R6,=H'999' do i=1 to 999\\n BH ELOOPI3\\n LA R1,LUDIC-1(R6) @ludic(i)\\n CLI 0(R1),X'01' if ludic(i)\\n BNE NOTI3\\n LA R8,1(R8) n=n+1\\nNOTI3 LA R6,1(R6) i=i+1\\n B LOOPI3\\nELOOPI3 XDECO R8,XDEC edit n\\n MVC BUF+25(6),XDEC+6 output n\\n XPRNT BUF,31 print buffer\\n MVC BUF(80),=CL80'Ludic numbers 2000 to 2005:'\\n LA R10,BUF+28 @buf=28\\n SR R8,R8 n=0\\n LA R6,1 i=1\\nLOOPI4 CH R6,NMAX do i=1 to nmax\\n BH ELOOPI4\\n LA R1,LUDIC-1(R6) @ludic(i)\\n CLI 0(R1),X'01' if ludic(i)\\n BNE NOTI4\\n LA R8,1(R8) n=n+1\\n CH R8,=H'2000' if n>=2000\\n BL NOTI4\\n XDECO R6,XDEC edit i\\n MVC 0(6,R10),XDEC+6 output i\\n LA R10,6(R10) @buf=@buf+6\\n CH R8,=H'2005' if n=2005\\n BE ELOOPI4\\nNOTI4 LA R6,1(R6) i=i+1\\n B LOOPI4\\nELOOPI4 XPRNT BUF,80 print buffer\\n XPRNT =C'Ludic triplets below 250:',25\\n LA R6,1 i=1\\nLOOPI5 CH R6,=H'243' do i=1 to 243\\n BH ELOOPI5\\n LA R1,LUDIC-1(R6) @ludic(i)\\n CLI 0(R1),X'01' if ludic(i)\\n BNE ITERI5\\n LA R1,LUDIC+1(R6) @ludic(i+2)\\n CLI 0(R1),X'01' if ludic(i+2)\\n BNE ITERI5\\n LA R1,LUDIC+5(R6) @ludic(i+6)\\n CLI 0(R1),X'01' if ludic(i+6)\\n BNE ITERI5\\n MVC BUF+0(1),=C'[' [\\n XDECO R6,XDEC edit i\\n MVC BUF+1(4),XDEC+8 output i\\n LA R2,2(R6) i+2\\n XDECO R2,XDEC edit i+2\\n MVC BUF+5(4),XDEC+8 output i+2\\n LA R2,6(R6) i+6\\n XDECO R2,XDEC edit i+6\\n MVC BUF+9(4),XDEC+8 output i+6\\n MVC BUF+13(1),=C']' ]\\n XPRNT BUF,14 print buffer\\nITERI5 LA R6,1(R6) i=i+1\\n B LOOPI5\\nELOOPI5 XR R15,R15 set return code\\n BR R14 return to caller\\n LTORG\\nBUF DS CL80 buffer\\nXDEC DS CL12 decimal editor\\nNMAX DC H'25000' nmax\\nLUDIC DC 25000X'01' ludic(nmax)=true\\n YREGS\\n END LUDICN\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"CLASS lcl_ludic DEFINITION CREATE PUBLIC.\\n\\n PUBLIC SECTION.\\n TYPES: t_ludics TYPE SORTED TABLE OF i WITH UNIQUE KEY table_line.\\n TYPES: BEGIN OF t_triplet,\\n i1 TYPE i,\\n i2 TYPE i,\\n i3 TYPE i,\\n END OF t_triplet.\\n TYPES: t_triplets TYPE STANDARD TABLE OF t_triplet WITH EMPTY KEY.\\n\\n CLASS-METHODS:\\n ludic_up_to\\n IMPORTING i_int TYPE i\\n RETURNING VALUE(r_ludics) TYPE t_ludics,\\n get_triplets\\n IMPORTING i_ludics TYPE t_ludics\\n RETURNING VALUE(r_triplets) TYPE t_triplets.\\n\\n \\\"RETURNING parameters (CallByValue) only used for readability of the demo\\n \\\"in \\\"Real Life\\\" you should use EXPORTING (CallByRef) for tables\\n\\nENDCLASS.\\n\\ncl_demo_output=>begin_section( 'First 25 Ludics' ).\\ncl_demo_output=>write( lcl_ludic=>ludic_up_to( 110 ) ).\\n\\ncl_demo_output=>begin_section( 'Ludics up to 1000' ).\\ncl_demo_output=>write( lines( lcl_ludic=>ludic_up_to( 1000 ) ) ).\\n\\ncl_demo_output=>begin_section( '2000th - 2005th Ludics' ).\\nDATA(ludics) = lcl_ludic=>ludic_up_to( 22000 ).\\ncl_demo_output=>write( VALUE lcl_ludic=>t_ludics( FOR i = 2000 WHILE i <= 2005 ( ludics[ i ] ) ) ).\\n\\ncl_demo_output=>begin_section( 'Triplets up to 250' ).\\ncl_demo_output=>write( lcl_ludic=>get_triplets( lcl_ludic=>ludic_up_to( 250 ) ) ).\\n\\ncl_demo_output=>display( ).\\n\\nCLASS lcl_ludic IMPLEMENTATION.\\n\\n METHOD ludic_up_to.\\n\\n r_ludics = VALUE #( FOR i = 2 WHILE i <= i_int ( i ) ).\\n\\n DATA(cursor) = 0.\\n\\n WHILE cursor < lines( r_ludics ).\\n\\n cursor = cursor + 1.\\n DATA(this_ludic) = r_ludics[ cursor ].\\n DATA(remove_cursor) = cursor + this_ludic.\\n\\n WHILE remove_cursor <= lines( r_ludics ).\\n DELETE r_ludics INDEX remove_cursor.\\n remove_cursor = remove_cursor + this_ludic - 1.\\n ENDWHILE.\\n\\n ENDWHILE.\\n\\n INSERT 1 INTO TABLE r_ludics. \\\"add one as the first Ludic number (per definition)\\n\\n ENDMETHOD.\\n\\n METHOD get_triplets.\\n\\n DATA(i) = 0.\\n WHILE i < lines( i_ludics ) - 2.\\n i = i + 1.\\n\\n DATA(this_ludic) = i_ludics[ i ].\\n IF line_exists( i_ludics[ table_line = this_ludic + 2 ] )\\n AND line_exists( i_ludics[ table_line = this_ludic + 6 ] ).\\n r_triplets = VALUE #(\\n BASE r_triplets\\n ( i1 = i_ludics[ table_line = this_ludic ]\\n i2 = i_ludics[ table_line = this_ludic + 2 ]\\n i3 = i_ludics[ table_line = this_ludic + 6 ]\\n )\\n ).\\n ENDIF.\\n\\n ENDWHILE.\\n\\n ENDMETHOD.\\n\\nENDCLASS.\\n\",\n \"language\": \"ABAP\"\n },\n {\n \"code\": \"DEFINE NOTLUDIC=\\\"0\\\"\\nDEFINE LUDIC=\\\"1\\\"\\nDEFINE UNKNOWN=\\\"2\\\"\\n\\nPROC LudicSieve(BYTE ARRAY a INT count)\\n INT i,j,k\\n\\n SetBlock(a,count,UNKNOWN)\\n a(0)=NOTLUDIC\\n a(1)=LUDIC\\n\\n i=2\\n WHILE i<count\\n DO\\n IF a(i)=UNKNOWN THEN\\n a(i)=LUDIC\\n j=i k=0\\n WHILE j<count\\n DO\\n IF a(j)=UNKNOWN THEN\\n k==+1\\n IF k=i THEN\\n a(j)=NOTLUDIC\\n k=0\\n FI\\n FI\\n j==+1\\n OD\\n FI\\n i==+1\\n Poke(77,0) ;turn off the attract mode\\n OD\\nRETURN\\n\\nPROC PrintLudicNumbers(BYTE ARRAY a INT count,first,last)\\n INT i,j\\n\\n i=1 j=0\\n WHILE i<count AND j<=last\\n DO\\n IF a(i)=LUDIC THEN\\n IF j>=first THEN\\n PrintI(i) Put(32)\\n FI\\n j==+1\\n FI\\n i==+1\\n OD\\n PutE() PutE()\\nRETURN\\n\\nINT FUNC CountLudicNumbers(BYTE ARRAY a INT max)\\n INT i,res\\n\\n res=0\\n FOR i=1 TO max\\n DO\\n IF a(i)=LUDIC THEN\\n res==+1\\n FI\\n OD\\nRETURN (res)\\n\\nPROC PrintLudicTriplets(BYTE ARRAY a INT max)\\n INT i,j\\n\\n j=0\\n FOR i=0 TO max-6\\n DO\\n IF a(i)=LUDIC AND a(i+2)=LUDIC AND a(i+6)=LUDIC THEN\\n j==+1\\n PrintF(\\\"%I. %I-%I-%I%E\\\",j,i,i+2,i+6)\\n FI\\n OD\\nRETURN\\n\\nPROC Main()\\n DEFINE COUNT=\\\"22000\\\"\\n BYTE ARRAY lud(COUNT+1)\\n INT i,n\\n\\n PrintE(\\\"Please wait...\\\")\\n LudicSieve(lud,COUNT+1)\\n Put(125) PutE() ;clear the screen\\n\\n PrintE(\\\"First 25 ludic numbers:\\\")\\n PrintLudicNumbers(lud,COUNT+1,0,24)\\n\\n n=CountLudicNumbers(lud,1000)\\n PrintF(\\\"There are %I ludic numbers <= 1000%E%E\\\",n)\\n\\n PrintE(\\\"2000'th..2005'th ludic numbers:\\\")\\n PrintLudicNumbers(lud,COUNT+1,1999,2004)\\n\\n PrintE(\\\"Ludic triplets below 250\\\")\\n PrintLudicTriplets(lud,249)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\nwith Ada.Containers.Vectors;\\n\\nprocedure Ludic_Numbers is\\n\\n package Lucid_Lists is\\n new Ada.Containers.Vectors (Positive, Natural);\\n use Lucid_Lists;\\n\\n List : Vector;\\n\\n procedure Fill is\\n use type Ada.Containers.Count_Type;\\n Vec : Vector;\\n Lucid : Natural;\\n Index : Positive;\\n begin\\n Append (List, 1);\\n\\n for I in 2 .. 22_000 loop\\n Append (Vec, I);\\n end loop;\\n\\n loop\\n Lucid := First_Element (Vec);\\n Append (List, Lucid);\\n\\n Index := First_Index (Vec);\\n loop\\n Delete (Vec, Index);\\n Index := Index + Lucid - 1;\\n exit when Index > Last_Index (Vec);\\n end loop;\\n\\n exit when Length (Vec) <= 1;\\n end loop;\\n\\n end Fill;\\n\\n procedure Put_Lucid (First, Last : in Natural) is\\n use Ada.Text_IO;\\n begin\\n Put_Line (\\\"Lucid numbers \\\" & First'Image & \\\" to \\\" & Last'Image & \\\":\\\");\\n for I in First .. Last loop\\n Put (Natural'(List (I))'Image);\\n end loop;\\n New_Line;\\n end Put_Lucid;\\n\\n procedure Count_Lucid (Below : in Natural) is\\n Count : Natural := 0;\\n begin\\n for Lucid of List loop\\n if Lucid <= Below then\\n Count := Count + 1;\\n end if;\\n end loop;\\n Ada.Text_IO.Put_Line (\\\"There are \\\" & Count'Image & \\\" lucid numbers <=\\\" & Below'Image);\\n end Count_Lucid;\\n\\n procedure Find_Triplets (Limit : in Natural) is\\n\\n function Is_Lucid (Value : in Natural) return Boolean is\\n begin\\n for X in 1 .. Limit loop\\n if List (X) = Value then\\n return True;\\n end if;\\n end loop;\\n return False;\\n end Is_Lucid;\\n\\n use Ada.Text_IO;\\n Index : Natural;\\n Lucid : Natural;\\n begin\\n Put_Line (\\\"All triplets of lucid numbers <\\\" & Limit'Image);\\n Index := First_Index (List);\\n while List (Index) < Limit loop\\n Lucid := List (Index);\\n if Is_Lucid (Lucid + 2) and Is_Lucid (Lucid + 6) then\\n Put (\\\"(\\\");\\n Put (Lucid'Image);\\n Put (Natural'(Lucid + 2)'Image);\\n Put (Natural'(Lucid + 6)'Image);\\n Put_Line (\\\")\\\");\\n end if;\\n Index := Index + 1;\\n end loop;\\n end Find_Triplets;\\n\\nbegin\\n Fill;\\n Put_Lucid (First => 1,\\n Last => 25);\\n Count_Lucid (Below => 1000);\\n Put_Lucid (First => 2000,\\n Last => 2005);\\n Find_Triplets (Limit => 250);\\nend Ludic_Numbers;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# find some Ludic numbers #\\n\\n# sieve the Ludic numbers up to 30 000 #\\nINT max number = 30 000;\\n[ 1 : max number ]INT candidates;\\nFOR n TO UPB candidates DO candidates[ n ] := n OD;\\nFOR n FROM 2 TO UPB candidates OVER 2 DO\\n IF candidates[ n ] /= 0 THEN\\n # have a ludic number #\\n INT number count := -1;\\n FOR remove pos FROM n TO UPB candidates DO\\n IF candidates[ remove pos ] /= 0 THEN\\n # have a number we haven't elminated yet #\\n number count +:= 1;\\n IF number count = n THEN\\n # this number should be removed #\\n candidates[ remove pos ] := 0;\\n number count := 0\\n FI\\n FI\\n OD\\n FI\\nOD;\\n# show some Ludic numbers and counts #\\nprint( ( \\\"Ludic numbers: \\\" ) );\\nINT ludic count := 0;\\nFOR n TO UPB candidates DO\\n IF candidates[ n ] /= 0 THEN\\n # have a ludic number #\\n ludic count +:= 1;\\n IF ludic count < 26 THEN\\n # this is one of the first few Ludic numbers #\\n print( ( \\\" \\\", whole( n, 0 ) ) );\\n IF ludic count = 25 THEN\\n print( ( \\\" ...\\\", newline ) )\\n FI\\n FI;\\n IF ludic count = 2000 THEN\\n print( ( \\\"Ludic numbers 2000-2005: \\\", whole( n, 0 ) ) )\\n ELIF ludic count > 2000 AND ludic count < 2006 THEN\\n print( ( \\\" \\\", whole( n, 0 ) ) );\\n IF ludic count = 2005 THEN\\n print( ( newline ) )\\n FI\\n FI\\n FI;\\n IF n = 1000 THEN\\n # count ludic numbers up to 1000 #\\n print( ( \\\"There are \\\", whole( ludic count, 0 ), \\\" Ludic numbers up to 1000\\\", newline ) )\\n FI\\nOD;\\n# find the Ludic triplets below 250 #\\nprint( ( \\\"Ludic triplets below 250:\\\", newline ) );\\nFOR n TO 250 - 6 DO\\n IF candidates[ n ] /= 0 AND candidates[ n + 2 ] /= 0 AND candidates[ n + 6 ] /= 0 THEN\\n # have a triplet #\\n print( ( \\\" \\\", whole( n, -3 ), \\\", \\\", whole( n + 2, -3 ), \\\", \\\", whole( n + 6, -3 ), newline ) )\\n FI\\nOD\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"-- Generate a list of the ludic numbers up to and including n.\\non ludicsTo(n)\\n if (n < 1) then return {}\\n -- Start with an array of numbers from 2 to n and a ludic collection already containing 1.\\n script o\\n property array : {}\\n property ludics : {1}\\n end script\\n repeat with i from 2 to n\\n set end of o's array to i\\n end repeat\\n -- Collect ludics and sieve the array until a ludic matches or exceeds the remaining\\n -- array length, at which point the array contains just the remaining ludics.\\n set thisLudic to 2\\n set arrayLength to n - 1\\n repeat while (thisLudic < arrayLength)\\n set end of o's ludics to thisLudic\\n repeat with i from 1 to arrayLength by thisLudic\\n set item i of o's array to missing value\\n end repeat\\n set o's array to o's array's numbers\\n set thisLudic to beginning of o's array\\n set arrayLength to (count o's array)\\n end repeat\\n\\n return (o's ludics) & (o's array)\\nend ludicsTo\\n\\non doTask()\\n script o\\n property ludics : ludicsTo(22000)\\n end script\\n\\n set output to {}\\n set astid to AppleScript's text item delimiters\\n set AppleScript's text item delimiters to \\\", \\\"\\n set end of output to \\\"First 25 ludic numbers:\\\"\\n set end of output to (items 1 thru 25 of o's ludics) as text\\n repeat with i from 1 to (count o's ludics)\\n if (item i of o's ludics > 1000) then exit repeat\\n end repeat\\n set end of output to \\\"There are \\\" & (i - 1) & \\\" ludic numbers ≤ 1000.\\\"\\n set end of output to \\\"2000th-2005th ludic numbers:\\\"\\n set end of output to (items 2000 thru 2005 of o's ludics) as text\\n set end of output to \\\"Triplets < 250:\\\"\\n set triplets to {}\\n repeat with x in o's ludics\\n set x to x's contents\\n if (x > 243) then exit repeat\\n if ((x + 2) is in o's ludics) and ((x + 6) is in o's ludics) then\\n set end of triplets to \\\"{\\\" & {x, x + 2, x + 6} & \\\"}\\\"\\n end if\\n end repeat\\n set end of output to triplets as text\\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 doTask\\n\\nreturn doTask()\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"\\\"First 25 ludic numbers:\\n1, 2, 3, 5, 7, 11, 13, 17, 23, 25, 29, 37, 41, 43, 47, 53, 61, 67, 71, 77, 83, 89, 91, 97, 107\\nThere are 142 ludic numbers ≤ 1000.\\n2000th-2005th ludic numbers:\\n21475, 21481, 21487, 21493, 21503, 21511\\nTriplets < 250:\\n{1, 3, 7}, {5, 7, 11}, {11, 13, 17}, {23, 25, 29}, {41, 43, 47}, {173, 175, 179}, {221, 223, 227}, {233, 235, 239}\\\"\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"ludicGen: function [nmax][\\n result: [1]\\n lst: new 2..nmax+1\\n i: 0\\n worked: false\\n while [and? [not? empty? lst] [i < size lst]][\\n item: lst\\\\[i]\\n result: result ++ item\\n del: 0\\n worked: false\\n while [del < size lst][\\n worked: true\\n remove 'lst .index del\\n del: dec del + item\\n ]\\n if not? worked -> i: i + 1\\n ]\\n return result\\n]\\n\\nludics: ludicGen 25000\\n\\nprint \\\"The first 25 ludic numbers:\\\"\\nprint first.n: 25 ludics\\n\\nleThan1000: select ludics => [& =< 1000]\\nprint [\\\"\\\\nThere are\\\" size leThan1000 \\\"ludic numbers less than/or equal to 1000\\\\n\\\"]\\n\\nprint [\\\"The ludic numbers from 2000th to 2005th are:\\\" slice ludics 1999 2004 \\\"\\\\n\\\"]\\n\\nprint \\\"The triplets of ludic numbers less than 250 are:\\\"\\nprint map select ludics 'x [\\n all? @[ x < 250\\n contains? ludics x+2\\n contains? ludics x+6\\n ]\\n] 't -> @[t, t+2, t+6]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"#NoEnv\\nSetBatchLines, -1\\nLudic := LudicSieve(22000)\\n\\nLoop, 25 ; the first 25 ludic numbers\\n\\tTask1 .= Ludic[A_Index] \\\" \\\"\\n\\nfor i, Val in Ludic ; the number of ludic numbers less than or equal to 1000\\n\\tif (Val <= 1000)\\n\\t\\tTask2++\\n\\telse\\n\\t\\tbreak\\n\\nLoop, 6 ; the 2000..2005'th ludic numbers\\n\\tTask3 .= Ludic[1999 + A_Index] \\\" \\\"\\n\\nfor i, Val in Ludic { ; all triplets of ludic numbers < 250\\n\\tif (Val + 6 > 249)\\n\\t\\tbreak\\n\\tif (Ludic[i + 1] = Val + 2 && Ludic[i + 2] = Val + 6 || i = 1)\\n\\t\\tTask4 .= \\\"(\\\" Val \\\" \\\" Val + 2 \\\" \\\" Val + 6 \\\") \\\"\\n}\\n\\nMsgBox, % \\\"First 25:`t`t\\\" Task1\\n\\t. \\\"`nLudics below 1000:`t\\\" Task2\\n\\t. \\\"`nLudic 2000 to 2005:`t\\\" Task3\\n\\t. \\\"`nTriples below 250:`t\\\" Task4\\nreturn\\n\\nLudicSieve(Limit) {\\n\\tArr := [], Ludic := []\\n\\tLoop, % Limit\\n\\t\\tArr.Insert(A_Index)\\n\\tLudic.Insert(Arr.Remove(1))\\n\\twhile Arr.MaxIndex() != 1 {\\n\\t\\tLudic.Insert(n := Arr.Remove(1))\\n\\t\\t, Removed := 0\\n\\t\\tLoop, % Arr.MaxIndex() // n {\\n\\t\\t\\tArr.Remove(A_Index * n - Removed)\\n\\t\\t\\t, Removed++\\n\\t\\t}\\n\\t}\\n\\tLudic.Insert(Arr[1])\\n\\treturn Ludic\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n\\ntypedef unsigned uint;\\ntypedef struct { uint i, v; } filt_t;\\n\\n// ludics with at least so many elements and reach at least such value\\nuint* ludic(uint min_len, uint min_val, uint *len)\\n{\\n\\tuint cap, i, v, active = 1, nf = 0;\\n\\tfilt_t *f = calloc(cap = 2, sizeof(*f));\\n\\tf[1].i = 4;\\n\\n\\tfor (v = 1; ; ++v) {\\n\\t\\tfor (i = 1; i < active && --f[i].i; i++);\\n\\n\\t\\tif (i < active)\\n\\t\\t\\tf[i].i = f[i].v;\\n\\t\\telse if (nf == f[i].i)\\n\\t\\t\\tf[i].i = f[i].v, ++active; // enable one more filter\\n\\t\\telse {\\n\\t\\t\\tif (nf >= cap)\\n\\t\\t\\t\\tf = realloc(f, sizeof(*f) * (cap*=2));\\n\\t\\t\\tf[nf] = (filt_t){ v + nf, v };\\n\\t\\t\\tif (++nf >= min_len && v >= min_val) break;\\n\\t\\t}\\n\\t}\\n\\n\\t// pack the sequence into a uint[]\\n\\t// filt_t struct was used earlier for cache locality in loops\\n\\tuint *x = (void*) f;\\n\\tfor (i = 0; i < nf; i++) x[i] = f[i].v;\\n\\tx = realloc(x, sizeof(*x) * nf);\\n\\n\\t*len = nf;\\n\\treturn x;\\n}\\n\\nint find(uint *a, uint v)\\n{\\n\\tuint i;\\n\\tfor (i = 0; a[i] <= v; i++)\\n\\t\\tif (v == a[i]) return 1;\\n\\treturn 0;\\n}\\n\\nint main(void)\\n{\\n\\tuint len, i, *x = ludic(2005, 1000, &len);\\n\\n\\tprintf(\\\"First 25:\\\");\\n\\tfor (i = 0; i < 25; i++) printf(\\\" %u\\\", x[i]);\\n\\tputchar('\\\\n');\\n\\n\\tfor (i = 0; x[i] <= 1000; i++);\\n\\tprintf(\\\"Ludics below 1000: %u\\\\n\\\", i);\\n\\n\\tprintf(\\\"Ludic 2000 to 2005:\\\");\\n\\tfor (i = 2000; i <= 2005; i++) printf(\\\" %u\\\", x[i - 1]);\\n\\tputchar('\\\\n');\\n\\n\\tprintf(\\\"Triples below 250:\\\");\\n\\tfor (i = 0; x[i] + 6 <= 250; i++)\\n\\t\\tif (find(x, x[i] + 2) && find(x, x[i] + 6))\\n\\t\\t\\tprintf(\\\" (%u %u %u)\\\", x[i], x[i] + 2, x[i] + 6);\\n\\n\\tputchar('\\\\n');\\n\\n\\tfree(x);\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <vector>\\n#include <iostream>\\nusing namespace std;\\n\\nclass ludic\\n{\\npublic:\\n void ludicList()\\n {\\n _list.push_back( 1 );\\n\\n vector<int> v;\\n for( int x = 2; x < 22000; x++ )\\n v.push_back( x );\\n\\n while( true )\\n {\\n vector<int>::iterator i = v.begin();\\n int z = *i;\\n _list.push_back( z );\\n\\n while( true )\\n {\\n i = v.erase( i );\\n if( distance( i, v.end() ) <= z - 1 ) break;\\n advance( i, z - 1 );\\n }\\n if( v.size() < 1 ) return;\\n }\\n }\\n\\n void show( int s, int e )\\n {\\n for( int x = s; x < e; x++ )\\n cout << _list[x] << \\\" \\\";\\n }\\n\\n void findTriplets( int e )\\n {\\n int lu, x = 0;\\n while( _list[x] < e )\\n {\\n lu = _list[x];\\n if( inList( lu + 2 ) && inList( lu + 6 ) )\\n cout << \\\"(\\\" << lu << \\\" \\\" << lu + 2 << \\\" \\\" << lu + 6 << \\\")\\\\n\\\";\\n x++;\\n }\\n }\\n\\n int count( int e )\\n {\\n int x = 0, c = 0;\\n while( _list[x++] <= 1000 ) c++;\\n return c;\\n }\\n\\nprivate:\\n bool inList( int lu )\\n {\\n for( int x = 0; x < 250; x++ )\\n if( _list[x] == lu ) return true;\\n return false;\\n }\\n\\n vector<int> _list;\\n};\\n\\nint main( int argc, char* argv[] )\\n{\\n ludic l;\\n l.ludicList();\\n cout << \\\"first 25 ludic numbers:\\\" << \\\"\\\\n\\\";\\n l.show( 0, 25 );\\n cout << \\\"\\\\n\\\\nThere are \\\" << l.count( 1000 ) << \\\" ludic numbers <= 1000\\\" << \\\"\\\\n\\\";\\n cout << \\\"\\\\n2000 to 2005'th ludic numbers:\\\" << \\\"\\\\n\\\";\\n l.show( 1999, 2005 );\\n cout << \\\"\\\\n\\\\nall triplets of ludic numbers < 250:\\\" << \\\"\\\\n\\\";\\n l.findTriplets( 250 );\\n cout << \\\"\\\\n\\\\n\\\";\\n return system( \\\"pause\\\" );\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Linq;\\nusing System.Collections.Generic;\\n\\npublic class Program\\n{\\n public static void Main()\\n {\\n Console.WriteLine(\\\"First 25 ludic numbers:\\\");\\n Console.WriteLine(string.Join(\\\", \\\", LudicNumbers(150).Take(25)));\\n Console.WriteLine();\\n\\n Console.WriteLine($\\\"There are {LudicNumbers(1001).Count()} ludic numbers below 1000\\\");\\n Console.WriteLine();\\n\\n foreach (var ludic in LudicNumbers(22000).Skip(1999).Take(6)\\n .Select((n, i) => $\\\"#{i+2000} = {n}\\\")) {\\n Console.WriteLine(ludic);\\n }\\n Console.WriteLine();\\n\\n Console.WriteLine(\\\"Triplets below 250:\\\");\\n var queue = new Queue<int>(5);\\n foreach (int x in LudicNumbers(255)) {\\n if (queue.Count == 5) queue.Dequeue();\\n queue.Enqueue(x);\\n if (x - 6 < 250 && queue.Contains(x - 6) && queue.Contains(x - 4)) {\\n Console.WriteLine($\\\"{x-6}, {x-4}, {x}\\\");\\n }\\n }\\n }\\n\\n public static IEnumerable<int> LudicNumbers(int limit) {\\n yield return 1;\\n //Like a linked list, but with value types.\\n //Create 2 extra entries at the start to avoid ugly index calculations\\n //and another at the end to avoid checking for index-out-of-bounds.\\n Entry[] values = Enumerable.Range(0, limit + 1).Select(n => new Entry(n)).ToArray();\\n for (int i = 2; i < limit; i = values[i].Next) {\\n yield return values[i].N;\\n int start = i;\\n while (start < limit) {\\n Unlink(values, start);\\n for (int step = 0; step < i && start < limit; step++)\\n start = values[start].Next;\\n }\\n }\\n }\\n\\n static void Unlink(Entry[] values, int index) {\\n values[values[index].Prev].Next = values[index].Next;\\n values[values[index].Next].Prev = values[index].Prev;\\n }\\n\\n}\\n\\nstruct Entry\\n{\\n public Entry(int n) : this() {\\n N = n;\\n Prev = n - 1;\\n Next = n + 1;\\n }\\n\\n public int N { get; }\\n public int Prev { get; set; }\\n public int Next { get; set; }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn ints-from [n]\\n (cons n (lazy-seq (ints-from (inc n)))))\\n\\n(defn drop-nth [n seq]\\n (cond\\n (zero? n) seq\\n (empty? seq) []\\n :else (concat (take (dec n) seq) (lazy-seq (drop-nth n (drop n seq))))))\\n\\n(def ludic ((fn ludic\\n ([] (ludic 1))\\n ([n] (ludic n (ints-from (inc n))))\\n ([n [f & r]] (cons n (lazy-seq (ludic f (drop-nth f r))))))))\\n\\n(defn ludic? [n] (= (first (filter (partial <= n) ludic)) n))\\n\\n(print \\\"First 25: \\\")\\n(println (take 25 ludic))\\n(print \\\"Count below 1000: \\\")\\n(println (count (take-while (partial > 1000) ludic)))\\n(print \\\"2000th through 2005th: \\\")\\n(println (map (partial nth ludic) (range 1999 2005)))\\n(print \\\"Triplets < 250: \\\")\\n(println (filter (partial every? ludic?)\\n (for [i (range 250)] (list i (+ i 2) (+ i 6)))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defun ludic-numbers (max &optional n)\\n (loop with numbers = (make-array (1+ max) :element-type 'boolean :initial-element t)\\n for i from 2 to max\\n until (and n (= num-results (1- n))) ; 1 will be added at the end\\n when (aref numbers i)\\n collect i into results\\n and count t into num-results\\n and do (loop for j from i to max\\n count (aref numbers j) into counter\\n when (= (mod counter i) 1)\\n do (setf (aref numbers j) nil))\\n finally (return (cons 1 results))))\\n\\n(defun main ()\\n (format t \\\"First 25 ludic numbers:~%\\\")\\n (format t \\\"~{~D~^ ~}~%\\\" (ludic-numbers 100 25))\\n (terpri)\\n (format t \\\"How many ludic numbers <= 1000?~%\\\")\\n (format t \\\"~D~%\\\" (length (ludic-numbers 1000)))\\n (terpri)\\n (let ((numbers (ludic-numbers 30000 2005)))\\n (format t \\\"~{#~D: ~D~%~}\\\"\\n (mapcan #'list '(2000 2001 2002 2003 2004 2005) (nthcdr 1999 numbers))))\\n (terpri)\\n (loop with numbers = (ludic-numbers 250)\\n initially (format t \\\"Triplets:~%\\\")\\n for x in numbers\\n when (and (find (+ x 2) numbers)\\n (find (+ x 6) numbers))\\n do (format t \\\"~3D ~3D ~3D~%\\\" x (+ x 2) (+ x 6))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"struct Ludics(T) {\\n int opApply(int delegate(in ref T) dg) {\\n int result;\\n T[] rotor, taken = [T(1)];\\n result = dg(taken[0]);\\n if (result) return result;\\n\\n for (T i = 2; ; i++) { // Shoud be stopped if T has a max.\\n size_t j = 0;\\n for (; j < rotor.length; j++)\\n if (!--rotor[j])\\n break;\\n\\n if (j < rotor.length) {\\n rotor[j] = taken[j + 1];\\n } else {\\n result = dg(i);\\n if (result) return result;\\n taken ~= i;\\n rotor ~= taken[j + 1];\\n }\\n }\\n }\\n}\\n\\nvoid main() {\\n import std.stdio, std.range, std.algorithm;\\n\\n // std.algorithm.take can't be used here.\\n uint[] L;\\n foreach (const x; Ludics!uint())\\n if (L.length < 2005)\\n L ~= x;\\n else\\n break;\\n\\n writeln(\\\"First 25 ludic primes:\\\\n\\\", L.take(25));\\n writefln(\\\"\\\\nThere are %d ludic numbers <= 1000.\\\",\\n L.until!q{ a > 1000 }.walkLength);\\n\\n writeln(\\\"\\\\n2000'th .. 2005'th ludic primes:\\\\n\\\", L[1999 .. 2005]);\\n\\n enum m = 250;\\n const triplets = L.filter!(x => x + 6 < m &&\\n L.canFind(x + 2) && L.canFind(x + 6))\\n // Ugly output:\\n //.map!(x => tuple(x, x + 2, x + 6)).array;\\n .map!(x => [x, x + 2, x + 6]).array;\\n writefln(\\\"\\\\nThere are %d triplets less than %d:\\\\n%s\\\",\\n triplets.length, m, triplets);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"struct Ludics(T) {\\n T[] rotor, taken = [T(1)];\\n T i;\\n size_t j;\\n T front = 1; // = taken[0];\\n bool running = false;\\n static immutable bool empty = false;\\n\\n void popFront() pure nothrow @safe {\\n if (running)\\n goto RESUME;\\n else\\n running = true;\\n\\n i = 2;\\n while (true) {\\n j = 0;\\n\\n while (j < rotor.length) {\\n rotor[j]--;\\n if (!rotor[j])\\n break;\\n j++;\\n }\\n if (j < rotor.length) {\\n rotor[j] = taken[j + 1];\\n } else {\\n front = i;\\n return;\\n RESUME:\\n taken ~= i;\\n rotor ~= taken[j + 1];\\n }\\n i++; // Could overflow if T has a max.\\n }\\n }\\n}\\n\\nvoid main() {\\n import std.stdio, std.range, std.algorithm, std.array;\\n\\n Ludics!uint L;\\n writeln(\\\"First 25 ludic primes:\\\\n\\\", L.take(25));\\n writefln(\\\"\\\\nThere are %d ludic numbers <= 1000.\\\",\\n L.until!q{ a > 1000 }.walkLength);\\n\\n writeln(\\\"\\\\n2000'th .. 2005'th ludic primes:\\\\n\\\", L.drop(1999).take(6));\\n\\n enum uint m = 250;\\n const few = L.until!(x => x > m).array;\\n const triplets = few.filter!(x => x + 6 < m && few.canFind(x + 2)\\n && few.canFind(x + 6))\\n // Ugly output:\\n //.map!(x => tuple(x, x + 2, x + 6)).array;\\n .map!(x => [x, x + 2, x + 6]).array;\\n writefln(\\\"\\\\nThere are %d triplets less than %d:\\\\n%s\\\",\\n triplets.length, m, triplets);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.range, std.algorithm, std.concurrency;\\n\\n Generator!T ludics(T)() {\\n return new typeof(return)({\\n T[] rotor, taken = [T(1)];\\n yield(taken[0]);\\n\\n for (T i = 2; ; i++) { // Shoud be stopped if T has a max.\\n size_t j = 0;\\n for (; j < rotor.length; j++)\\n if (!--rotor[j])\\n break;\\n\\n if (j < rotor.length) {\\n rotor[j] = taken[j + 1];\\n } else {\\n yield(i);\\n taken ~= i;\\n rotor ~= taken[j + 1];\\n }\\n }\\n });\\n }\\n\\n const L = ludics!uint.take(2005).array;\\n\\n writeln(\\\"First 25 ludic primes:\\\\n\\\", L.take(25));\\n writefln(\\\"\\\\nThere are %d ludic numbers <= 1000.\\\",\\n L.until!q{ a > 1000 }.walkLength);\\n\\n writeln(\\\"\\\\n2000'th .. 2005'th ludic primes:\\\\n\\\", L[1999 .. 2005]);\\n\\n enum m = 250;\\n const triplets = L.filter!(x => x + 6 < m &&\\n L.canFind(x + 2) && L.canFind(x + 6))\\n // Ugly output:\\n //.map!(x => tuple(x, x + 2, x + 6)).array;\\n .map!(x => [x, x + 2, x + 6]).array;\\n writefln(\\\"\\\\nThere are %d triplets less than %d:\\\\n%s\\\",\\n triplets.length, m, triplets);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"class\\n\\tLUDIC_NUMBERS\\n\\ncreate\\n\\tmake\\n\\nfeature\\n\\n\\tmake (n: INTEGER)\\n\\t\\t\\t-- Initialized arrays for find_ludic_numbers.\\n\\t\\trequire\\n\\t\\t\\tn_positive: n > 0\\n\\t\\tlocal\\n\\t\\t\\ti: INTEGER\\n\\t\\tdo\\n\\t\\t\\tcreate initial.make_filled (0, 1, n - 1)\\n\\t\\t\\tcreate ludic_numbers.make_filled (1, 1, 1)\\n\\t\\t\\tfrom\\n\\t\\t\\t\\ti := 2\\n\\t\\t\\tuntil\\n\\t\\t\\t\\ti > n\\n\\t\\t\\tloop\\n\\t\\t\\t\\tinitial.put (i, i - 1)\\n\\t\\t\\t\\ti := i + 1\\n\\t\\t\\tend\\n\\t\\t\\tfind_ludic_numbers\\n\\t\\tend\\n\\n\\tludic_numbers: ARRAY [INTEGER]\\n\\nfeature {NONE}\\n\\n\\tinitial: ARRAY [INTEGER]\\n\\n\\tfind_ludic_numbers\\n\\t\\t\\t-- Ludic numbers in array ludic_numbers.\\n\\t\\tlocal\\n\\t\\t\\tcount: INTEGER\\n\\t\\t\\tnew_array: ARRAY [INTEGER]\\n\\t\\t\\tlast: INTEGER\\n\\t\\tdo\\n\\t\\t\\tcreate new_array.make_from_array (initial)\\n\\t\\t\\tlast := initial.count\\n\\t\\t\\tfrom\\n\\t\\t\\t\\tcount := 1\\n\\t\\t\\tuntil\\n\\t\\t\\t\\tcount > last\\n\\t\\t\\tloop\\n\\t\\t\\t\\tif ludic_numbers [ludic_numbers.count] /= new_array [1] then\\n\\t\\t\\t\\t\\tludic_numbers.force (new_array [1], count + 1)\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tnew_array := delete_i_elements (new_array)\\n\\t\\t\\t\\tcount := count + 1\\n\\t\\t\\tend\\n\\t\\tend\\n\\n\\tdelete_i_elements (ar: ARRAY [INTEGER]): ARRAY [INTEGER]\\n\\t\\t\\t--- Array with all multiples of 'ar[1]' deleted.\\n\\t\\trequire\\n\\t\\t\\tar_not_empty: ar.count > 0\\n\\t\\tlocal\\n\\t\\t\\ts_array: ARRAY [INTEGER]\\n\\t\\t\\ti, k: INTEGER\\n\\t\\t\\tlength: INTEGER\\n\\t\\tdo\\n\\t\\t\\tcreate s_array.make_empty\\n\\t\\t\\tlength := ar.count\\n\\t\\t\\tfrom\\n\\t\\t\\t\\ti := 0\\n\\t\\t\\t\\tk := 1\\n\\t\\t\\tuntil\\n\\t\\t\\t\\ti = length\\n\\t\\t\\tloop\\n\\t\\t\\t\\tif (i) \\\\\\\\ (ar [1]) /= 0 then\\n\\t\\t\\t\\t\\ts_array.force (ar [i + 1], k)\\n\\t\\t\\t\\t\\tk := k + 1\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\ti := i + 1\\n\\t\\t\\tend\\n\\t\\t\\tif s_array.count = 0 then\\n\\t\\t\\t\\tResult := ar\\n\\t\\t\\telse\\n\\t\\t\\t\\tResult := s_array\\n\\t\\t\\tend\\n\\t\\tensure\\n\\t\\t\\tnot_empty: not Result.is_empty\\n\\t\\tend\\n\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"class\\n\\tAPPLICATION\\n\\ncreate\\n\\tmake\\n\\nfeature\\n\\n\\tmake\\n\\t\\tlocal\\n\\t\\t\\tk, count: INTEGER\\n\\t\\tdo\\n\\t\\t\\tcreate ludic.make (22000)\\n\\t\\t\\tio.put_string (\\\"%NLudic numbers up to 25. %N\\\")\\n\\t\\t\\tacross\\n\\t\\t\\t\\tludic.ludic_numbers.subarray (1, 25) as ld\\n\\t\\t\\tloop\\n\\t\\t\\t\\tio.put_string (ld.item.out + \\\"%N\\\")\\n\\t\\t\\tend\\n\\t\\t\\tio.put_string (\\\"%NLudic numbers from 2000 ... 2005. %N\\\")\\n\\t\\t\\tacross\\n\\t\\t\\t\\tludic.ludic_numbers.subarray (2000, 2005) as ld\\n\\t\\t\\tloop\\n\\t\\t\\t\\tio.put_string (ld.item.out + \\\"%N\\\")\\n\\t\\t\\tend\\n\\t\\t\\tio.put_string (\\\"%NNumber of Ludic numbers smaller than 1000. %N\\\")\\n\\t\\t\\tfrom\\n\\t\\t\\t\\tk := 1\\n\\t\\t\\tuntil\\n\\t\\t\\t\\tludic.ludic_numbers [k] >= 1000\\n\\t\\t\\tloop\\n\\t\\t\\t\\tk := k + 1\\n\\t\\t\\t\\tcount := count + 1\\n\\t\\t\\tend\\n\\t\\t\\tio.put_integer (count)\\n\\t\\tend\\n\\n\\tludic: LUDIC_NUMBERS\\n\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"defmodule Ludic do\\n def numbers(n \\\\\\\\ 100000) do\\n [h|t] = Enum.to_list(1..n)\\n numbers(t, [h])\\n end\\n\\n defp numbers(list, nums) when length(list) < hd(list), do: Enum.reverse(nums, list)\\n defp numbers([h|_]=list, nums) do\\n Enum.drop_every(list, h) |> numbers([h | nums])\\n end\\n\\n def task do\\n IO.puts \\\"First 25 : #{inspect numbers(200) |> Enum.take(25)}\\\"\\n IO.puts \\\"Below 1000: #{length(numbers(1000))}\\\"\\n tuple = numbers(25000) |> List.to_tuple\\n IO.puts \\\"2000..2005th: #{ inspect for i <- 1999..2004, do: elem(tuple, i) }\\\"\\n ludic = numbers(250)\\n triple = for x <- ludic, x+2 in ludic, x+6 in ludic, do: [x, x+2, x+6]\\n IO.puts \\\"Triples below 250: #{inspect triple, char_lists: :as_lists}\\\"\\n end\\nend\\n\\nLudic.task\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"USING: formatting fry kernel make math math.ranges namespaces\\nprettyprint.config sequences sequences.extras ;\\nIN: rosetta-code.ludic-numbers\\n\\n: next-ludic ( seq -- seq' )\\n dup first '[ nip _ mod zero? not ] filter-index ;\\n\\n: ludics-upto-2005 ( -- a )\\n 22,000 2 swap [a,b] [ ! 22k suffices to produce 2005 ludics\\n 1 , [ building get length 2005 = ]\\n [ dup first , next-ludic ] until drop\\n ] { } make ;\\n\\n: ludic-demo ( -- )\\n 100 margin set ludics-upto-2005\\n [ 6 tail* ] [ [ 1000 < ] count ] [ 25 head ] tri\\n \\\"First 25 ludic numbers:\\\\n%u\\\\n\\\\n\\\"\\n \\\"Count of ludic numbers less than 1000:\\\\n%d\\\\n\\\\n\\\"\\n \\\"Ludic numbers 2000 to 2005:\\\\n%u\\\\n\\\" [ printf ] tri@ ;\\n\\nMAIN: ludic-demo\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"program ludic_numbers\\n implicit none\\n\\n integer, parameter :: nmax = 25000\\n logical :: ludic(nmax) = .true.\\n integer :: i, j, n\\n\\n do i = 2, nmax / 2\\n if (ludic(i)) then\\n n = 0\\n do j = i+1, nmax\\n if(ludic(j)) n = n + 1\\n if(n == i) then\\n ludic(j) = .false.\\n n = 0\\n end if\\n end do\\n end if\\n end do\\n\\n write(*, \\\"(a)\\\", advance = \\\"no\\\") \\\"First 25 Ludic numbers: \\\"\\n n = 0\\n do i = 1, nmax\\n if(ludic(i)) then\\n write(*, \\\"(i0, 1x)\\\", advance = \\\"no\\\") i\\n n = n + 1\\n end if\\n if(n == 25) exit\\n end do\\n\\n write(*, \\\"(/, a)\\\", advance = \\\"no\\\") \\\"Ludic numbers below 1000: \\\"\\n write(*, \\\"(i0)\\\") count(ludic(:999))\\n\\n write(*, \\\"(a)\\\", advance = \\\"no\\\") \\\"Ludic numbers 2000 to 2005: \\\"\\n n = 0\\n do i = 1, nmax\\n if(ludic(i)) then\\n n = n + 1\\n if(n >= 2000) then\\n write(*, \\\"(i0, 1x)\\\", advance = \\\"no\\\") i\\n if(n == 2005) exit\\n end if\\n end if\\n end do\\n\\n write(*, \\\"(/, a)\\\", advance = \\\"no\\\") \\\"Ludic Triplets below 250: \\\"\\n do i = 1, 243\\n if(ludic(i) .and. ludic(i+2) .and. ludic(i+6)) then\\n write(*, \\\"(a, 2(i0, 1x), i0, a, 1x)\\\", advance = \\\"no\\\") \\\"[\\\", i, i+2, i+6, \\\"]\\\"\\n end if\\n end do\\n\\nend program\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\n' As it would be too expensive to actually remove elements from the array\\n' we instead set an element to 0 if it has been removed.\\n\\nSub ludic(n As Integer, lu() As Integer)\\n If n < 1 Then Return\\n Redim lu(1 To n)\\n lu(1) = 1\\n If n = 1 Then Return\\n Dim As Integer count = 1, count2\\n Dim As Integer i, j, k = 1\\n Dim As Integer ub = 22000 '' big enough to deal with up to 2005 ludic numbers\\n Dim a(2 To ub) As Integer\\n For i = 2 To ub : a(i) = i : Next\\n\\n Do\\n k += 1\\n\\n For i = k to ub\\n If a(i) > 0 Then\\n count += 1\\n lu(count) = a(i)\\n If n = count Then Return\\n a(i) = 0\\n k = i\\n Exit For\\n End If\\n Next\\n\\n count2 = 0\\n j = k + 1\\n\\n While j <= ub\\n If a(j) > 0 Then\\n count2 +=1\\n If count2 = k Then\\n a(j) = 0\\n count2 = 0\\n End If\\n End If\\n j += 1\\n Wend\\n Loop\\n\\nEnd Sub\\n\\nDim i As Integer\\nDim lu() As Integer\\nludic(2005, lu())\\nPrint \\\"The first 25 Ludic numbers are :\\\"\\nFor i = 1 To 25\\n Print Using \\\"###\\\"; lu(i);\\n Print \\\" \\\";\\nNext\\nPrint\\n\\nDim As Integer Count = 0\\nFor i = 1 To 1000\\n If lu(i) <= 1000 Then\\n count += 1\\n Else\\n Exit For\\n End If\\nNext\\nPrint\\nPrint \\\"There are\\\"; count; \\\" Ludic numbers <= 1000\\\"\\nPrint\\n\\nPrint \\\"The 2000th to 2005th Ludics are :\\\"\\nFor i = 2000 To 2005\\n Print lu(i); \\\" \\\";\\nNext\\nPrint : Print\\n\\nPrint \\\"The Ludic triplets below 250 are : \\\"\\nDim As Integer j, k, ldc\\nDim b As Boolean\\nFor i = 1 To 248\\n ldc = lu(i)\\n If ldc >= 244 Then Exit For\\n b = False\\n For j = i + 1 To 249\\n If lu(j) = ldc + 2 Then\\n b = True\\n k = j\\n Exit For\\n ElseIf lu(j) > ldc + 2 Then\\n Exit For\\n End If\\n Next j\\n If b = False Then Continue For\\n For j = k + 1 To 250\\n If lu(j) = ldc + 6 Then\\n Print \\\"(\\\"; Str(ldc); \\\",\\\"; ldc + 2; \\\",\\\"; ldc + 6; \\\")\\\"\\n Exit For\\n ElseIf lu(j) > ldc + 6 Then\\n Exit For\\n End If\\n Next j\\nNext i\\nErase lu\\nPrint\\n\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\n// Ludic returns a slice of Ludic numbers stopping after\\n// either n entries or when max is exceeded.\\n// Either argument may be <=0 to disable that limit.\\nfunc Ludic(n int, max int) []uint32 {\\n\\tconst maxInt32 = 1<<31 - 1 // i.e. math.MaxInt32\\n\\tif max > 0 && n < 0 {\\n\\t\\tn = maxInt32\\n\\t}\\n\\tif n < 1 {\\n\\t\\treturn nil\\n\\t}\\n\\tif max < 0 {\\n\\t\\tmax = maxInt32\\n\\t}\\n\\tsieve := make([]uint32, 10760) // XXX big enough for 2005 Ludics\\n\\tsieve[0] = 1\\n\\tsieve[1] = 2\\n\\tif n > 2 {\\n\\t\\t// We start with even numbers already removed\\n\\t\\tfor i, j := 2, uint32(3); i < len(sieve); i, j = i+1, j+2 {\\n\\t\\t\\tsieve[i] = j\\n\\t\\t}\\n\\t\\t// We leave the Ludic numbers in place,\\n\\t\\t// k is the index of the next Ludic\\n\\t\\tfor k := 2; k < n; k++ {\\n\\t\\t\\tl := int(sieve[k])\\n\\t\\t\\tif l >= max {\\n\\t\\t\\t\\tn = k\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t\\ti := l\\n\\t\\t\\tl--\\n\\t\\t\\t// last is the last valid index\\n\\t\\t\\tlast := k + i - 1\\n\\t\\t\\tfor j := k + i + 1; j < len(sieve); i, j = i+1, j+1 {\\n\\t\\t\\t\\tlast = k + i\\n\\t\\t\\t\\tsieve[last] = sieve[j]\\n\\t\\t\\t\\tif i%l == 0 {\\n\\t\\t\\t\\t\\tj++\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t// Truncate down to only the valid entries\\n\\t\\t\\tif last < len(sieve)-1 {\\n\\t\\t\\t\\tsieve = sieve[:last+1]\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif n > len(sieve) {\\n\\t\\tpanic(\\\"program error\\\") // should never happen\\n\\t}\\n\\treturn sieve[:n]\\n}\\n\\nfunc has(x []uint32, v uint32) bool {\\n\\tfor i := 0; i < len(x) && x[i] <= v; i++ {\\n\\t\\tif x[i] == v {\\n\\t\\t\\treturn true\\n\\t\\t}\\n\\t}\\n\\treturn false\\n}\\n\\nfunc main() {\\n\\t// Ludic() is so quick we just call it repeatedly\\n\\tfmt.Println(\\\"First 25:\\\", Ludic(25, -1))\\n\\tfmt.Println(\\\"Numner of Ludics below 1000:\\\", len(Ludic(-1, 1000)))\\n\\tfmt.Println(\\\"Ludic 2000 to 2005:\\\", Ludic(2005, -1)[1999:])\\n\\n\\tfmt.Print(\\\"Tripples below 250:\\\")\\n\\tx := Ludic(-1, 250)\\n\\tfor i, v := range x[:len(x)-2] {\\n\\t\\tif has(x[i+1:], v+2) && has(x[i+2:], v+6) {\\n\\t\\t\\tfmt.Printf(\\\", (%d %d %d)\\\", v, v+2, v+6)\\n\\t\\t}\\n\\t}\\n\\tfmt.Println()\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List (unfoldr, genericSplitAt)\\n\\nludic :: [Integer]\\nludic = 1 : unfoldr (\\\\xs@(x:_) -> Just (x, dropEvery x xs)) [2 ..]\\n where\\n dropEvery n = concatMap tail . unfoldr (Just . genericSplitAt n)\\n\\nmain :: IO ()\\nmain = do\\n print $ take 25 ludic\\n (print . length) $ takeWhile (<= 1000) ludic\\n print $ take 6 $ drop 1999 ludic\\n-- haven't done triplets task yet\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"ludic = 1:2 : f 3 [3..] [(4,2)] where\\n\\tf n (x:xs) yy@((i,y):ys)\\n\\t\\t| n == i = f n (dropEvery y xs) ys\\n\\t\\t| otherwise = x : f (1+n) xs (yy ++ [(n+x, x)])\\n\\ndropEvery n s = a ++ dropEvery n (tail b) where\\n\\t(a,b) = splitAt (n-1) s\\n\\nmain = print $ ludic !! 10000\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"global num, cascade, sieve, nfilter\\n\\nprocedure main(A)\\n lds := ludic(2005)\\t\\t# All we need for the four tasks.\\n every writes(\\\"First 25:\\\" | (\\\" \\\"||!lds)\\\\25 | \\\"\\\\n\\\")\\n every (n := 0) +:= (!lds < 1000, 1)\\n write(\\\"There are \\\",n,\\\" Ludic numbers < 1000.\\\")\\n every writes(\\\"2000th through 2005th: \\\" | (lds[2000 to 20005]||\\\" \\\") | \\\"\\\\n\\\")\\n writes(\\\"Triplets:\\\")\\n every (250 > (x := !lds)) & (250 > (x+2 = !lds)) & (250 > (x+6 = !lds)) do\\n writes(\\\" [\\\",x,\\\",\\\",x+2,\\\",\\\",x+6,\\\"]\\\")\\n write()\\nend\\n\\nprocedure ludic(limit)\\n candidates := create seq(2)\\n put(cascade := [], create {\\n repeat {\\n report(l := num, limit)\\n put(cascade, create (cnt:=0, repeat ((cnt+:=1)%l=0, @sieve) | @@nfilter))\\n cascade[-2] :=: cascade[-1] # keep this sink as the last filter\\n @sieve\\n }\\n })\\n sieve := create while num := @candidates do @@(nfilter := create !cascade)\\n report(1, limit)\\n return @sieve\\nend\\n\\nprocedure report(ludic, limit)\\n static count, lds\\n initial {count := 0; lds := []}\\n if (count +:= 1) > limit then lds@&main\\n put(lds, ludic)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \" ludic =: _1 |.!.1 [: {.\\\"1 [: (#~ 0 ~: {. | i.@#)^:a: 2 + i.\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" # ludic 110 NB. 110 is sufficient to generate 25 Ludic numbers\\n25\\n ludic 110 NB. First 25 Ludic numbers\\n1 2 3 5 7 11 13 17 23 25 29 37 41 43 47 53 61 67 71 77 83 89 91 97 107\\n\\n #ludic 1000 NB. 142 Ludic numbers <= 1000\\n142\\n\\n # ludic 22000 NB. 22000 is sufficient to generate > 2005 Ludic numbers\\n2042\\n (2000+i.6) { ludic 22000 NB. Ludic numbers 2000-2005\\n21481 21487 21493 21503 21511 21523\\n\\n 0 2 6 (] (*./ .e.~ # |:@]) +/) ludic 250 NB. Ludic triplets <= 250\\n 1 3 7\\n 5 7 11\\n 11 13 17\\n 23 25 29\\n 41 43 47\\n173 175 179\\n221 223 227\\n233 235 239\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.List;\\n\\npublic class Ludic{\\n\\tpublic static List<Integer> ludicUpTo(int n){\\n\\t\\tList<Integer> ludics = new ArrayList<Integer>(n);\\n\\t\\tfor(int i = 1; i <= n; i++){ //fill the initial list\\n\\t\\t\\tludics.add(i);\\n\\t\\t}\\n\\t\\t\\n\\t\\t//start at index 1 because the first ludic number is 1 and we don't remove anything for it\\n\\t\\tfor(int cursor = 1; cursor < ludics.size(); cursor++){\\n\\t\\t\\tint thisLudic = ludics.get(cursor); //the first item in the list is a ludic number\\n\\t\\t\\tint removeCursor = cursor + thisLudic; //start removing that many items later\\n\\t\\t\\twhile(removeCursor < ludics.size()){\\n\\t\\t\\t\\tludics.remove(removeCursor);\\t\\t //remove the next item\\n\\t\\t\\t\\tremoveCursor = removeCursor + thisLudic - 1; //move the removal cursor up as many spaces as we need to\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t //then back one to make up for the item we just removed\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ludics;\\n\\t}\\n\\t\\n\\tpublic static List<List<Integer>> getTriplets(List<Integer> ludics){\\n\\t\\tList<List<Integer>> triplets = new ArrayList<List<Integer>>();\\n\\t\\tfor(int i = 0; i < ludics.size() - 2; i++){ //only need to check up to the third to last item\\n\\t\\t\\tint thisLudic = ludics.get(i);\\n\\t\\t\\tif(ludics.contains(thisLudic + 2) && ludics.contains(thisLudic + 6)){\\n\\t\\t\\t\\tList<Integer> triplet = new ArrayList<Integer>(3);\\n\\t\\t\\t\\ttriplet.add(thisLudic);\\n\\t\\t\\t\\ttriplet.add(thisLudic + 2);\\n\\t\\t\\t\\ttriplet.add(thisLudic + 6);\\n\\t\\t\\t\\ttriplets.add(triplet);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn triplets;\\n\\t}\\n\\t\\n\\tpublic static void main(String[] srgs){\\n\\t\\tSystem.out.println(\\\"First 25 Ludics: \\\" + ludicUpTo(110));\\t\\t\\t\\t//110 will get us 25 numbers\\n\\t\\tSystem.out.println(\\\"Ludics up to 1000: \\\" + ludicUpTo(1000).size());\\n\\t\\tSystem.out.println(\\\"2000th - 2005th Ludics: \\\" + ludicUpTo(22000).subList(1999, 2005)); //22000 will get us 2005 numbers\\n\\t\\tSystem.out.println(\\\"Triplets up to 250: \\\" + getTriplets(ludicUpTo(250)));\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"/**\\n * Boilerplate to simply get an array filled between 2 numbers\\n * @param {!number} s Start here (inclusive)\\n * @param {!number} e End here (inclusive)\\n */\\nconst makeArr = (s, e) => new Array(e + 1 - s).fill(s).map((e, i) => e + i);\\n\\n/**\\n * Remove every n-th element from the given array\\n * @param {!Array} arr\\n * @param {!number} n\\n * @return {!Array}\\n */\\nconst filterAtInc = (arr, n) => arr.filter((e, i) => (i + 1) % n);\\n\\n/**\\n * Generate ludic numbers\\n * @param {!Array} arr\\n * @param {!Array} result\\n * @return {!Array}\\n */\\nconst makeLudic = (arr, result) => {\\n const iter = arr.shift();\\n result.push(iter);\\n return arr.length ? makeLudic(filterAtInc(arr, iter), result) : result;\\n};\\n\\n/**\\n * Our Ludic numbers. This is a bit of a cheat, as we already know beforehand\\n * up to where our seed array needs to go in order to exactly get to the\\n * 2005th Ludic number.\\n * @type {!Array<!number>}\\n */\\nconst ludicResult = makeLudic(makeArr(2, 21512), [1]);\\n\\n\\n// Below is just logging out the results.\\n/**\\n * Given a number, return a function that takes an array, and return the\\n * count of all elements smaller than the given\\n * @param {!number} n\\n * @return {!Function}\\n */\\nconst smallerThanN = n => arr => {\\n return arr.reduce((p,c) => {\\n return c <= n ? p + 1 : p\\n }, 0)\\n};\\nconst smallerThan1K = smallerThanN(1000);\\n\\nconsole.log('\\\\nFirst 25 Ludic Numbers:');\\nconsole.log(ludicResult.filter((e, i) => i < 25).join(', '));\\n\\nconsole.log('\\\\nTotal Ludic numbers smaller than 1000:');\\nconsole.log(smallerThan1K(ludicResult));\\n\\nconsole.log('\\\\nThe 2000th to 2005th ludic numbers:');\\nconsole.log(ludicResult.filter((e, i) => i > 1998).join(', '));\\n\\nconsole.log('\\\\nTriplets smaller than 250:');\\nludicResult.forEach(e => {\\n if (e + 6 < 250 && ludicResult.indexOf(e + 2) > 0 && ludicResult.indexOf(e + 6) > 0) {\\n console.log([e, e + 2, e + 6].join(', '));\\n }\\n});\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# This method for sieving turns out to be the fastest in jq.\\n# Input: an array to be sieved.\\n# Output: if the array length is less then $n then empty, else the sieved array.\\ndef sieve($n):\\n if length<$n then empty\\n else . as $in\\n | reduce range(0;length) as $i ([]; if $i % $n == 0 then . else . + [$in[$i]] end)\\n end;\\n\\n# Generate a stream of ludic numbers based on sieving range(2; $nmax+1)\\ndef ludic($nmax):\\n def l:\\n .[0] as $next\\n | $next, (sieve($next)|l);\\n 1, ([range(2; $nmax+1)] | l);\\n\\n# Output: an array of the first . ludic primes (including 1)\\ndef first_ludic_primes:\\n . as $n\\n | def l:\\n . as $k\\n | [ludic(10*$k)] as $a\\n | if ($a|length) >= $n then $a[:$n]\\n else (10*$k) | l\\n end;\\n l;\\n\\n# Output: an array of the ludic numbers less than .\\ndef ludic_primes:\\n . as $n\\n | def l:\\n . as $k\\n | [ludic(10*$k)] as $a\\n | if $a[-1] >= $n then $a | map(select(. < $n))\\n else (10*$k) | l\\n end;\\n l;\\n\\n# Output; a stream of triplets of ludic numbers, where each member of the triplet is less than .\\ndef triplets:\\n ludic_primes as $primes\\n | $primes[] as $p\\n | $primes\\n | bsearch($p) as $i\\n | if $i >= 0\\n then $primes[$i+1:]\\n | select( bsearch($p+2) >= 0 and\\n bsearch($p+6) >= 0)\\n | [$p, $p+2, $p+6]\\n else empty\\n end;\\n\\n\\n\\\"First 25 ludic primes:\\\", (25|first_ludic_primes),\\n\\\"\\\\nThere are \\\\(1000|ludic_primes|length) ludic numbers <= 1000\\\",\\n( \\\"The \\\\n2000th to 2005th ludic primes are:\\\",\\n (2005|first_ludic_primes)[2000:]),\\n( [250 | triplets]\\n | \\\"\\\\nThere are \\\\(length) triplets less than 250:\\\",\\n .[] )\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function ludic_filter{T<:Integer}(n::T)\\n 0 < n || throw(DomainError())\\n slud = trues(n)\\n for i in 2:(n-1)\\n slud[i] || continue\\n x = 0\\n for j in (i+1):n\\n slud[j] || continue\\n x += 1\\n x %= i\\n x == 0 || continue\\n slud[j] = false\\n end\\n end\\n return slud\\nend\\n\\nludlen = 10^5\\nslud = ludic_filter(ludlen)\\nludics = collect(1:ludlen)[slud]\\n\\nn = 25\\nprintln(\\\"Generate and show here the first \\\", n, \\\" ludic numbers.\\\")\\nprint(\\\" \\\")\\ncrwid = 76\\nwid = 0\\nfor i in 1:(n-1)\\n s = @sprintf \\\"%d, \\\" ludics[i]\\n wid += length(s)\\n if crwid < wid\\n print(\\\"\\\\n \\\")\\n wid = 0\\n end\\n print(s)\\nend\\nprintln(ludics[n])\\n\\nn = 10^3\\nprintln()\\nprintln(\\\"How many ludic numbers are there less than or equal to \\\", n, \\\"?\\\")\\nprintln(\\\" \\\", sum(slud[1:n]))\\n\\nlo = 2000\\nhi = lo+5\\nprintln()\\nprintln(\\\"Show the \\\", lo, \\\"..\\\", hi, \\\"'th ludic numbers.\\\")\\nfor i in lo:hi\\n println(\\\" Ludic(\\\", i, \\\") = \\\", ludics[i])\\nend\\n\\nn = 250\\nprintln()\\nprintln(\\\"Show all triplets of ludic numbers < \\\", n)\\nfor i = 1:n-7\\n slud[i] || continue\\n j = i+2\\n slud[j] || continue\\n k = i+6\\n slud[k] || continue\\n println(\\\" \\\", i, \\\", \\\", j, \\\", \\\", k)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\n/* Rather than remove elements from a MutableList which would be a relatively expensive operation\\n we instead use two arrays:\\n\\n 1. An array of the Ludic numbers to be returned.\\n 2. A 'working' array of a suitable size whose elements are set to 0 to denote removal. */\\n\\nfun ludic(n: Int): IntArray {\\n if (n < 1) return IntArray(0)\\n val lu = IntArray(n) // array of Ludic numbers required\\n lu[0] = 1\\n if (n == 1) return lu\\n var count = 1\\n var count2: Int\\n var j: Int\\n var k = 1\\n var ub = n * 11 // big enough to deal with up to 2005 ludic numbers\\n val a = IntArray(ub) { it } // working array\\n while (true) {\\n k += 1\\n for (i in k until ub) {\\n if (a[i] > 0) {\\n count +=1\\n lu[count - 1] = a[i]\\n if (n == count) return lu\\n a[i] = 0\\n k = i\\n break\\n }\\n }\\n count2 = 0\\n j = k + 1\\n while (j < ub) {\\n if (a[j] > 0) {\\n count2 +=1\\n if (count2 == k) {\\n a[j] = 0\\n count2 = 0\\n }\\n }\\n j += 1\\n }\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val lu: IntArray = ludic(2005)\\n println(\\\"The first 25 Ludic numbers are :\\\")\\n for (i in 0 .. 24) print(\\\"%4d\\\".format(lu[i]))\\n\\n val count = lu.count { it <= 1000 }\\n println(\\\"\\\\n\\\\nThere are $count Ludic numbers <= 1000\\\" )\\n\\n println(\\\"\\\\nThe 2000th to 2005th Ludics are :\\\")\\n for (i in 1999 .. 2004) print(\\\"${lu[i]} \\\")\\n\\n println(\\\"\\\\n\\\\nThe Ludic triplets below 250 are : \\\")\\n var k: Int = 0\\n var ldc: Int\\n var b: Boolean\\n for (i in 0 .. 247) {\\n ldc = lu[i]\\n if (ldc >= 244) break\\n b = false\\n for (j in i + 1 .. 248) {\\n if (lu[j] == ldc + 2) {\\n b = true\\n k = j\\n break\\n }\\n else if (lu[j] > ldc + 2) break\\n }\\n if (!b) continue\\n for (j in k + 1 .. 249) {\\n if (lu[j] == ldc + 6) {\\n println(\\\"($ldc, ${ldc + 2}, ${ldc + 6})\\\")\\n break\\n }\\n else if (lu[j] > ldc + 6) break\\n }\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"-- Return table of ludic numbers below limit\\nfunction ludics (limit)\\n local ludList, numList, index = {1}, {}\\n for n = 2, limit do table.insert(numList, n) end\\n while #numList > 0 do\\n index = numList[1]\\n table.insert(ludList, index)\\n for key = #numList, 1, -1 do\\n if key % index == 1 then table.remove(numList, key) end\\n end\\n end\\n return ludList\\nend\\n\\n-- Return true if n is found in t or false otherwise\\nfunction foundIn (t, n)\\n for k, v in pairs(t) do\\n if v == n then return true end\\n end\\n return false\\nend\\n\\n-- Display msg followed by all values in t\\nfunction show (msg, t)\\n io.write(msg)\\n for _, v in pairs(t) do io.write(\\\" \\\" .. v) end\\n print(\\\"\\\\n\\\")\\nend\\n\\n-- Main procedure\\nlocal first25, under1k, inRange, tripList, triplets = {}, 0, {}, {}, {}\\nfor k, v in pairs(ludics(30000)) do\\n if k <= 25 then table.insert(first25, v) end\\n if v <= 1000 then under1k = under1k + 1 end\\n if k >= 2000 and k <= 2005 then table.insert(inRange, v) end\\n if v < 250 then table.insert(tripList, v) end\\nend\\nfor _, x in pairs(tripList) do\\n if foundIn(tripList, x + 2) and foundIn(tripList, x + 6) then\\n table.insert(triplets, \\\"\\\\n{\\\" .. x .. \\\",\\\" .. x+2 .. \\\",\\\" .. x+6 .. \\\"}\\\")\\n end\\nend\\nshow(\\\"First 25:\\\", first25)\\nprint(under1k .. \\\" are less than or equal to 1000\\\\n\\\")\\nshow(\\\"2000th to 2005th:\\\", inRange)\\nshow(\\\"Triplets:\\\", triplets)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"n=10^5;\\nLudic={1};\\nseq=Range[2,n];\\nClearAll[DoStep]\\nDoStep[seq:{f_,___}]:=Module[{out=seq},\\n AppendTo[Ludic,f];\\n out[[;;;;f]]=Sequence[];\\n out\\n]\\nNest[DoStep,seq,2500];\\n\\nLudic[[;; 25]]\\nLengthWhile[Ludic, # < 1000 &]\\nLudic[[2000 ;; 2005]]\\nSelect[Subsets[Select[Ludic, # < 250 &], {3}], Differences[#] == {2, 4} &]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import strutils\\n\\ntype LudicArray[N: static int] = array[1..N, int]\\n\\nfunc initLudicArray[N: static int](): LudicArray[N] =\\n ## Initialize an array of ludic numbers.\\n result[1] = 1\\n for i in 2..N:\\n var k = 0\\n for j in countdown(i - 1, 2):\\n k = k * result[j] div (result[j] - 1) + 1\\n result[i] = k + 2\\n\\n\\nproc print(text: string; list: openArray[int]) =\\n ## Print a text followed by a list of ludic numbers.\\n var line = text\\n let start = line.len\\n for val in list:\\n line.addSep(\\\", \\\", start)\\n line.add $val\\n echo line\\n\\n\\nfunc isLudic(ludicArray: LudicArray; n, start: Positive): bool =\\n ## Check if a number \\\"n\\\" is ludic, starting search from index \\\"start\\\".\\n for idx in start..ludicArray.N:\\n let val = ludicArray[idx]\\n if n == val: return true\\n if n < val: break\\n\\n\\nwhen isMainModule:\\n\\n let ludicArray = initLudicArray[2005]()\\n\\n print \\\"The 25 first ludic numbers are: \\\", ludicArray[1..25]\\n\\n var count = 0\\n for n in ludicArray:\\n if n > 1000: break\\n inc count\\n echo \\\"\\\\nThere are \\\", count, \\\" ludic numbers less or equal to 1000.\\\"\\n\\n print \\\"\\\\nThe 2000th to 2005th ludic numbers are: \\\", ludicArray[2000..2005]\\n\\n echo \\\"\\\\nThe triplets of ludic numbers less than 250 are:\\\"\\n var line = \\\"\\\"\\n for i, n in ludicArray:\\n if n >= 244:\\n echo line\\n break\\n if ludicArray.isLudic(n + 2, i + 1) and ludicArray.isLudic(n + 6, i + 2):\\n line.addSep(\\\", \\\")\\n line.add \\\"($1, $2, $3)\\\".format(n, n + 2, n + 6)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use Collection.Generic;\\n\\nclass Ludic {\\n function : Main(args : String[]) ~ Nil {\\n ludics := LudicUpTo(110);\\n Show(\\\"First 25 Ludics: \\\", ludics, 0, ludics->Size());\\n System.IO.Console->Print(\\\"Ludics up to 1000: \\\")->PrintLine(LudicUpTo(1000)->Size());\\n ludics := LudicUpTo(22000);\\n Show(\\\"2000th - 2005th Ludics: \\\", ludics, 1999, 2005);\\n Show(\\\"Triplets up to 250: \\\", GetTriplets(LudicUpTo(250)));\\n }\\n\\n function : LudicUpTo(n : Int) ~ CompareVector<IntHolder> {\\n ludics := CompareVector->New()<IntHolder>;\\n for(i := 1; i <= n; i++;){\\n ludics->AddBack(i);\\n };\\n\\n for(cursor := 1; cursor < ludics->Size(); cursor++;) {\\n thisLudic := ludics->Get(cursor);\\n removeCursor := cursor + thisLudic;\\n while(removeCursor < ludics->Size()){\\n ludics->Remove(removeCursor);\\n removeCursor := removeCursor + thisLudic - 1;\\n };\\n };\\n\\n return ludics;\\n }\\n\\n function : GetTriplets(ludics : CompareVector<IntHolder>) ~ Vector<CompareVector<IntHolder> > {\\n triplets := Vector->New()<CompareVector<IntHolder> >;\\n\\n for(i := 0; i < ludics->Size() - 2; i++;){\\n thisLudic := ludics->Get(i);\\n if(ludics->Has(thisLudic + 2) & ludics->Has(thisLudic + 6)){\\n triplet := CompareVector->New()<IntHolder>;\\n triplet->AddBack(thisLudic);\\n triplet->AddBack(thisLudic + 2);\\n triplet->AddBack(thisLudic + 6);\\n triplets->AddBack(triplet);\\n };\\n };\\n\\n return triplets;\\n }\\n\\n function : Show(title : String, ludics : CompareVector<IntHolder>, start : Int, end : Int) ~ Nil {\\n title->Print();\\n '['->Print();\\n for(i := start; i < end; i +=1;) {\\n ludics->Get(i)->Get()->Print();\\n if(i + 1 < ludics->Size()) {\\n ','->Print();\\n };\\n };\\n ']'->PrintLine();\\n }\\n\\n function : Show(title : String, triplets : Vector<CompareVector<IntHolder> >) ~ Nil {\\n title->PrintLine();\\n each(i : triplets) {\\n triplet := triplets->Get(i);\\n Show(\\\"\\\\t\\\", triplet, 0, triplet->Size());\\n };\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \": ludic(n)\\n| ludics l p |\\n ListBuffer newSize(n) seqFrom(2, n) over addAll ->l\\n ListBuffer newSize(n) dup add(1) dup ->ludics\\n\\n while(l notEmpty) [\\n l removeFirst dup ludics add ->p\\n l size p / p * while(dup 1 > ) [ dup l removeAt drop p - ] drop\\n ] ;\\n\\n: ludics\\n| l i |\\n ludic(22000) ->l\\n \\\"First 25 : \\\" print l left(25) println\\n \\\"Below 1000 : \\\" print l filter(#[ 1000 < ]) size println\\n \\\"2000 to 2005 : \\\" print l extract(2000, 2005) println\\n\\n 250 loop: i [\\n l include(i) ifFalse: [ continue ]\\n l include(i 2 +) ifFalse: [ continue ]\\n l include(i 6 +) ifFalse: [ continue ]\\n i print \\\", \\\" print i 2 + print \\\", \\\" print i 6 + println\\n ] ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"\\\\\\\\ Creating Vlf - Vector of ludic numbers' flags,\\n\\\\\\\\ where the index of each flag=1 is the ludic number.\\n\\\\\\\\ 2/28/16 aev\\nludic(maxn)={my(Vlf=vector(maxn,z,1),n2=maxn\\\\2,k,j1);\\nfor(i=2,n2,\\n if(Vlf[i], k=0; j1=i+1;\\n for(j=j1,maxn, if(Vlf[j], k++); if(k==i, Vlf[j]=0; k=0))\\n );\\n );\\nreturn(Vlf);\\n}\\n\\n{\\n\\\\\\\\ Required tests:\\nmy(Vr,L=List(),k=0,maxn=25000);\\nVr=ludic(maxn);\\nprint(\\\"The first 25 Ludic numbers: \\\");\\nfor(i=1,maxn, if(Vr[i]==1, k++; print1(i,\\\" \\\"); if(k==25, break)));\\nprint(\\\"\\\");print(\\\"\\\");\\nk=0;\\nfor(i=1,999, if(Vr[i]==1, k++));\\nprint(\\\"Ludic numbers below 1000: \\\",k);\\nprint(\\\"\\\");\\nk=0;\\nprint(\\\"Ludic numbers 2000 to 2005: \\\");\\nfor(i=1,maxn, if(Vr[i]==1, k++; if(k>=2000&&k<=2005, listput(L,i)); if(k>2005, break)));\\nfor(i=1,6, print1(L[i],\\\" \\\"));\\nprint(\\\"\\\"); print(\\\"\\\");\\nprint(\\\"Ludic Triplets below 250: \\\");\\nfor(i=1,250, if(Vr[i]&&Vr[i+2]&&Vr[i+6], print1(\\\"(\\\",i,\\\" \\\",i+2,\\\" \\\",i+6,\\\") \\\")));\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"\\\\\\\\ Creating Vl - Vector of ludic numbers.\\n\\\\\\\\ 2/28/16 aev\\nludic2(maxn)={my(Vw=vector(maxn, x, x+1),Vl=Vec([1]),vwn=#Vw,i);\\nwhile(vwn>0, i=Vw[1]; Vl=concat(Vl,[i]);\\n Vw=vector((vwn*(i-1))\\\\i,x,Vw[(x*i+i-2)\\\\(i-1)]); vwn=#Vw\\n); return(Vl);\\n}\\n{\\n\\\\\\\\ Required tests:\\nmy(Vr,L=List(),k=0,maxn=22000,vrs,vi);\\nVr=ludic2(maxn); vrs=#Vr;\\nprint(\\\"The first 25 Ludic numbers: \\\");\\nfor(i=1,25, print1(Vr[i],\\\" \\\"));\\nprint(\\\"\\\");print(\\\"\\\");\\nk=0;\\nfor(i=1,vrs, if(Vr[i]<1000, k++, break));\\nprint(\\\"Ludic numbers below 1000: \\\",k);\\nprint(\\\"\\\");\\nk=0;\\nprint(\\\"Ludic numbers 2000 to 2005: \\\");\\nfor(i=2000,2005, print1(Vr[i],\\\" \\\"));\\nprint(\\\"\\\");print(\\\"\\\");\\nprint(\\\"Ludic Triplets below 250: \\\");\\nfor(i=1,vrs, vi=Vr[i]; if(i==1,print1(\\\"(\\\",vi,\\\" \\\",vi+2,\\\" \\\",vi+6,\\\") \\\"); next); if(vi+6<250,if(Vr[i+1]==vi+2&&Vr[i+2]==vi+6, print1(\\\"(\\\",vi,\\\" \\\",vi+2,\\\" \\\",vi+6,\\\") \\\"))));\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"program lucid;\\n{$IFDEF FPC}\\n {$MODE objFPC} // useful for x64\\n{$ENDIF}\\n\\nconst\\n //66164 -> last < 1000*1000;\\n maxLudicCnt = 2005;//must be > 1\\ntype\\n\\n tDelta = record\\n dNum,\\n dCnt : LongInt;\\n end;\\n\\n tpDelta = ^tDelta;\\n tLudicList = array of tDelta;\\n\\n tArrdelta =array[0..0] of tDelta;\\n tpLl = ^tArrdelta;\\n\\nfunction isLudic(plL:tpLl;maxIdx:nativeInt):boolean;\\nvar\\n i,\\n cn : NativeInt;\\nBegin\\n //check if n is 'hit' by a prior ludic number\\n For i := 1 to maxIdx do\\n with plL^[i] do\\n Begin\\n //Mask read modify write reread\\n //dec(dCnt);IF dCnt= 0\\n cn := dCnt;\\n IF cn = 1 then\\n Begin\\n dcnt := dNum;\\n isLudic := false;\\n EXIT;\\n end;\\n dcnt := cn-1;\\n end;\\n isLudic := true;\\nend;\\n\\nprocedure CreateLudicList(var Ll:tLudicList);\\nvar\\n plL : tpLl;\\n n,LudicCnt : NativeUint;\\nbegin\\n // special case 1\\n n := 1;\\n Ll[0].dNum := 1;\\n\\n plL := @Ll[0];\\n LudicCnt := 0;\\n repeat\\n inc(n);\\n If isLudic(plL,LudicCnt ) then\\n Begin\\n inc(LudicCnt);\\n with plL^[LudicCnt] do\\n Begin\\n dNum := n;\\n dCnt := n;\\n end;\\n IF (LudicCnt >= High(LL)) then\\n BREAK;\\n end;\\n until false;\\nend;\\n\\nprocedure firstN(var Ll:tLudicList;cnt: NativeUint);\\nvar\\n i : NativeInt;\\nBegin\\n writeln('First ',cnt,' ludic numbers:');\\n For i := 0 to cnt-2 do\\n write(Ll[i].dNum,',');\\n writeln(Ll[cnt-1].dNum);\\nend;\\n\\nprocedure triples(var Ll:tLudicList;max: NativeUint);\\nvar\\n i,\\n chk : NativeUint;\\nBegin\\n // special case 1,3,7\\n writeln('Ludic triples below ',max);\\n write('(',ll[0].dNum,',',ll[2].dNum,',',ll[4].dNum,') ');\\n\\n For i := 1 to High(Ll) do\\n Begin\\n chk := ll[i].dNum;\\n If chk> max then\\n break;\\n If (ll[i+2].dNum = chk+6) AND (ll[i+1].dNum = chk+2) then\\n write('(',ll[i].dNum,',',ll[i+1].dNum,',',ll[i+2].dNum,') ');\\n end;\\n writeln;\\n writeln;\\nend;\\n\\nprocedure LastLucid(var Ll:tLudicList;start,cnt: NativeUint);\\nvar\\n limit,i : NativeUint;\\nBegin\\n dec(start);\\n limit := high(Ll);\\n IF cnt >= limit then\\n cnt := limit;\\n if start+cnt >limit then\\n start := limit-cnt;\\n writeln(Start+1,'.th to ',Start+cnt+1,'.th ludic number');\\n For i := 0 to cnt-1 do\\n write(Ll[i+start].dNum,',');\\n writeln(Ll[start+cnt].dNum);\\n writeln;\\nend;\\n\\nfunction CountLudic(var Ll:tLudicList;Limit: NativeUint):NativeUint;\\nvar\\n i,res : NativeUint;\\nBegin\\n res := 0;\\n For i := 0 to High(Ll) do begin\\n IF Ll[i].dnum <= Limit then\\n inc(res)\\n else\\n BREAK;\\n CountLudic:= res;\\nend;\\n\\nend;\\nvar\\n LudicList : tLudicList;\\nBEGIN\\n setlength(LudicList,maxLudicCnt);\\n CreateLudicList(LudicList);\\n firstN(LudicList,25);\\n writeln('There are ',CountLudic(LudicList,1000),' ludic numbers below 1000');\\n LastLucid(LudicList,2000,5);\\n LastLucid(LudicList,maxLudicCnt,5);\\n triples(LudicList,250);//all-> (LudicList,LudicList[High(LudicList)].dNum);\\nEND.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"program ludic;\\n{$IFDEF FPC}{$MODE DELPHI}{$ELSE}{$APPTYPE CONSOLE}{$ENDIF}\\nuses\\n sysutils;\\nconst\\n MAXNUM =21511;// > 1\\n //1561333;-> 100000 ludic numbers\\n //1561243,1561291,1561301,1561307,1561313,1561333\\ntype\\n tarrLudic = array of byte;\\n tLudics = array of LongWord;\\n\\nvar\\n Ludiclst : tarrLudic;\\n\\nprocedure Firsttwentyfive;\\nvar\\n i,actLudic : NativeInt;\\nBegin\\n writeln('First 25 ludic numbers');\\n actLudic:= 1;\\n For i := 1 to 25 do\\n Begin\\n write(actLudic:3,',');\\n inc(actLudic,Ludiclst[actLudic]);\\n IF i MOD 5 = 0 then\\n writeln(#8#32);\\n end;\\n writeln;\\nend;\\n\\nprocedure CountBelowOneThousand;\\nvar\\n cnt,actLudic : NativeInt;\\nBegin\\n write('Count of ludic numbers below 1000 = ');\\n actLudic:= 1;\\n cnt := 1;\\n while actLudic <= 1000 do\\n Begin\\n inc(actLudic,Ludiclst[actLudic]);\\n inc(cnt);\\n end;\\n dec(cnt);\\n writeln(cnt);writeln;\\nend;\\n\\nprocedure Show2000til2005;\\nvar\\n cnt,actLudic : NativeInt;\\nBegin\\n writeln('ludic number #2000 to #2005');\\n actLudic:= 1;\\n cnt := 1;\\n while cnt < 2000 do\\n Begin\\n inc(actLudic,Ludiclst[actLudic]);\\n inc(cnt);\\n end;\\n while cnt < 2005 do\\n Begin\\n write(actLudic,',');\\n inc(actLudic,Ludiclst[actLudic]);\\n inc(cnt);\\n end;\\n writeln(actLudic);writeln;\\nend;\\n\\nprocedure ShowTriplets;\\nvar\\n actLudic,lastDelta : NativeInt;\\nBegin\\n writeln('ludic numbers triplets below 250');\\n actLudic:= 1;\\n while actLudic < 250-5 do\\n Begin\\n IF (Ludiclst[actLudic] <> 0) AND\\n (Ludiclst[actLudic+2] <> 0) AND\\n (Ludiclst[actLudic+6] <> 0) then\\n writeln('{',actLudic,'|',actLudic+2,'|',actLudic+6,'} ');\\n inc(actLudic);\\n end;\\n writeln;\\nend;\\n\\nprocedure CheckMaxdist;\\nvar\\n actLudic,Delta,MaxDelta : NativeInt;\\nBegin\\n MaxDelta := 0;\\n actLudic:= 1;\\n repeat\\n delta := Ludiclst[actLudic];\\n inc(actLudic,delta);\\n IF MAxDelta<delta then\\n MAxDelta:= delta;\\n until actLudic>= MAXNUM;\\n writeln('MaxDist ',MAxDelta);writeln;\\nend;\\n\\nfunction GetLudics:tLudics;\\n//Array of byte containing the distance to next ludic number\\n//eliminated numbers are set to 0\\nvar\\n i,actLudic,actcnt,delta,actPos,lastPos,ludicCnt: NativeInt;\\nBegin\\n setlength(Ludiclst,MAXNUM+1);\\n For i := MAXNUM downto 0 do\\n Ludiclst[i]:= 1;\\n actLudic := 1;\\n ludicCnt := 1;\\n\\n repeat\\n inc(actLudic,Ludiclst[actLudic]);\\n IF actLudic> MAXNUM then\\n BREAK;\\n inc(ludicCnt);\\n actPos := actLudic;\\n actcnt := 0;\\n // Only if there are enough ludics left\\n IF MaxNum-ludicCnt-actPos > actPos then\\n Begin\\n //eliminate every element in actLudic-distance\\n //delta so i can set Ludiclst[actpos] to zero\\n delta := Ludiclst[actpos];\\n repeat\\n lastPos := actPos;\\n inc(actpos,delta);\\n if actPos>=MAXNUM then\\n BREAK;\\n delta := Ludiclst[actpos];\\n inc(actcnt);\\n IF actcnt= actLudic then\\n Begin\\n inc(Ludiclst[LastPos],delta);\\n //mark as not ludic\\n Ludiclst[actpos] := 0;\\n actcnt := 0;\\n end;\\n until false;\\n end;\\n until false;\\n writeln(ludicCnt,' ludic numbers upto ',MAXNUM,#13#10);\\nend;\\n\\nBEGIN\\n GetLudics;\\n CheckMaxdist;\\n Firsttwentyfive;CountBelowOneThousand;Show2000til2005;ShowTriplets ;\\n setlength(Ludiclst,0)\\nEND.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\nuse warnings;\\nuse strict;\\nuse feature qw{ say };\\n\\n{ my @ludic = (1);\\n my $max = 3;\\n my @candidates;\\n\\n sub sieve {\\n my $l = shift;\\n for (my $i = 0; $i <= $#candidates; $i += $l) {\\n splice @candidates, $i, 1;\\n }\\n }\\n\\n sub ludic {\\n my ($type, $n) = @_;\\n die \\\"Arg0 Type must be 'count' or 'max'\\\\n\\\"\\n unless grep $_ eq $type, qw( count max );\\n die \\\"Arg1 Number must be > 0\\\\n\\\" if 0 >= $n;\\n\\n return (@ludic[ 0 .. $n - 1 ]) if 'count' eq $type and @ludic >= $n;\\n\\n return (grep $_ <= $n, @ludic) if 'max' eq $type and $ludic[-1] >= $n;\\n\\n while (1) {\\n if (@candidates) {\\n last if ('max' eq $type and $candidates[0] > $n)\\n or ($n == @ludic);\\n\\n push @ludic, $candidates[0];\\n sieve($ludic[-1] - 1);\\n\\n } else {\\n $max *= 2;\\n @candidates = 2 .. $max;\\n for my $l (@ludic) {\\n sieve($l - 1) unless 1 == $l;\\n }\\n }\\n }\\n return (@ludic)\\n }\\n\\n}\\n\\nmy @triplet;\\nmy %ludic;\\nundef @ludic{ ludic(max => 250) };\\nfor my $i (keys %ludic) {\\n push @triplet, $i if exists $ludic{ $i + 2 } and exists $ludic { $i + 6 };\\n}\\n\\nsay 'First 25: ', join ' ', ludic(count => 25);\\nsay 'Count < 1000: ', scalar ludic(max => 1000);\\nsay '2000..2005th: ', join ' ', (ludic(count => 2005))[1999 .. 2004];\\nsay 'triplets < 250: ', join ' ',\\n map { '(' . join(' ',$_, $_ + 2, $_ + 6) . ')' }\\n sort { $a <=> $b } @triplet;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">LUMAX</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">25000</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">ludic</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;\\\">LUMAX</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</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;\\\">LUMAX</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">ludic</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;\\\">n</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;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">LUMAX</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">ludic</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;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">ludic</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;\\\">n</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;\\\">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\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</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;\\\">LUMAX</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">ludic</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;\\\">s</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">i</span>\\n <span style=\\\"color: #008080;\\\">if</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;\\\">25</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;\\\">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;\\\">\\\"First 25 Ludic numbers: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">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;\\\">\\\"Ludic numbers below 1000: %d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ludic</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">1000</span><span style=\\\"color: #0000FF;\\\">])})</span>\\n <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #000000;\\\">n</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: #000000;\\\">LUMAX</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">ludic</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;\\\">n</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">2000</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>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2005</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;\\\">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: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Ludic numbers 2000 to 2005: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">sprint</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: #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;\\\">243</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">ludic</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">ludic</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;\\\">and</span> <span style=\\\"color: #000000;\\\">ludic</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">6</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: #7060A8;\\\">append</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;\\\">i</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;\\\">6</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;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"There are %d Ludic triplets below 250: %s\\\\n\\\"</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: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"ludic(N) = Ludic =>\\n ludic(2..N, [1], Ludic).\\nludic([], Ludic0, Ludic) =>\\n Ludic = Ludic0.reverse().\\nludic(T, Ludic0, Ludic) =>\\n T2 = ludic_keep(T),\\n ludic(T2,[T[1]|Ludic0],Ludic).\\n\\n% which elements to keep\\nludic_keep([]) = [].\\nludic_keep([H|List]) = Ludic =>\\n ludic_keep(H,1,List,[],Ludic).\\n\\nludic_keep(_H,_C,[],Ludic0,Ludic) ?=>\\n Ludic = Ludic0.reverse().\\nludic_keep(H,C,[H1|T],Ludic0,Ludic) =>\\n (\\n C mod H > 0 ->\\n ludic_keep(H,C+1,T,[H1|Ludic0],Ludic)\\n ;\\n ludic_keep(H,C+1,T,Ludic0,Ludic)\\n ).\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"ludic2(N) = Ludic =>\\n A = 1..N,\\n Ludic = [1],\\n A := delete(A, 1),\\n while(A.length > 0)\\n T = A[1],\\n Ludic := Ludic ++ [T],\\n A := delete(A,T),\\n A := [A[J] : J in 1..A.length, J mod T > 0]\\n end.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"go =>\\n time(check(ludic)),\\n time(check(ludic2)),\\n nl.\\n\\ncheck(LudicFunc) =>\\n println(ludicFunc=LudicFunc),\\n\\n Ludic1000 = apply(LudicFunc,1000),\\n\\n % first 25\\n println(first_25=Ludic1000[1..25]),\\n\\n % below 1000\\n println(num_below_1000=Ludic1000.length),\\n\\n % 2000..2005\\n Ludic22000 = apply(LudicFunc,22000),\\n println(len_22000=Ludic22000.length),\\n println(ludic_2000_2005=[Ludic22000[I] : I in 2000..2005]),\\n\\n % Triplets\\n Ludic2500 = apply(LudicFunc,2500),\\n Triplets=[[N,N+2,N+6] : N in 1..Ludic2500.length,\\n membchk(N,Ludic2500),\\n membchk(N+2,Ludic2500),\\n membchk(N+6,Ludic2500)],\\n foreach(Triplet in Triplets)\\n println(Triplet)\\n end,\\n nl.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de drop (Lst)\\n (let N (car Lst)\\n (make\\n (for (I . X) (cdr Lst)\\n (unless (=0 (% I N)) (link X)) ) ) ) )\\n\\n(de comb (M Lst)\\n (cond\\n ((=0 M) '(NIL))\\n ((not Lst))\\n (T\\n (conc\\n (mapcar\\n '((Y) (cons (car Lst) Y))\\n (comb (dec M) (cdr Lst)) )\\n (comb M (cdr Lst)) ) ) ) )\\n\\n(de ludic (N)\\n (let Ludic (range 1 100000)\\n (make\\n (link (pop 'Ludic))\\n (do (dec N)\\n (link (car Ludic))\\n (setq Ludic (drop Ludic)) ) ) ) )\\n\\n(let L (ludic 2005)\\n (println (head 25 L))\\n (println (cnt '((X) (< X 1000)) L))\\n (println (tail 6 L))\\n (println\\n (filter\\n '((Lst)\\n (and\\n (= (+ 2 (car Lst)) (cadr Lst))\\n (= (+ 6 (car Lst)) (caddr Lst)) ) )\\n (comb\\n 3\\n (filter '((X) (< X 250)) L) ) ) ) )\\n\\n(bye)\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"Ludic_numbers: procedure options (main); /* 18 April 2014 */\\n declare V(2:22000) fixed, L(2200) fixed;\\n declare (step, i, j, k, n) fixed binary;\\n\\nLudic: procedure;\\n n = hbound(V,1); k = 1; L(1) = 1;\\n do i = 2 to n; V(i) = i; end;\\n\\n do forever;\\n\\n k = k + 1; L(k), step = V(2);\\n\\n do i = 2 to n by step;\\n V(i) = 0;\\n end;\\n call compress;\\n if L(k) >= 21511 then leave;\\n end;\\n\\n put skip list ('The first 25 Ludic numbers are:');\\n put skip edit ( (L(i) do i = 1 to 25) ) (F(4));\\n\\n k = 0;\\n do i = 1 by 1;\\n if L(i) < 1000 then k = k + 1; else leave;\\n end;\\n\\n put skip list ('There are ' || trim(k) || ' Ludic numbers < 1000');\\n put skip list ('Six Ludic numbers from the 2000-th:');\\n put skip edit ( (L(i) do i = 2000 to 2005) ) (f(7));\\n /* Triples are values of the form x, x+2, x+6 */\\n put skip list ('Triples are:');\\n put skip;\\n i = 1;\\n put edit ('(', L(1), L(3), L(5), ') ' ) (A, 3 F(4), A);\\n do i = 1 by 1 while (L(i+2) <= 250);\\n if (L(i) = L(i+1) - 2) & (L(i) = L(i+2) - 6) then\\n put edit ('(', L(i), L(i+1), L(i+2), ') ' ) (A, 3 F(4), A);\\n end;\\n\\ncompress: procedure;\\n j = 2;\\n do i = 2 to n;\\n if V(i) ^= 0 then do; V(j) = V(i); j = j + 1; end;\\n end;\\n n = j-1;\\nend compress;\\n\\nend Ludic;\\n\\ncall Ludic;\\n\\nend Ludic_numbers;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"SET SERVEROUTPUT ON\\nDECLARE\\n c_limit CONSTANT PLS_INTEGER := 25000;\\n TYPE t_nums IS TABLE OF PLS_INTEGER INDEX BY PLS_INTEGER;\\n v_nums t_nums;\\n v_ludic t_nums;\\n v_count_ludic PLS_INTEGER;\\n v_count_pos PLS_INTEGER;\\n v_pos PLS_INTEGER;\\n v_next_ludic PLS_INTEGER;\\n\\n FUNCTION is_ludic(p_num PLS_INTEGER) RETURN BOOLEAN IS\\n BEGIN\\n FOR i IN 1..v_ludic.COUNT LOOP\\n EXIT WHEN v_ludic(i) > p_num;\\n IF v_ludic(i) = p_num THEN\\n RETURN TRUE;\\n END IF;\\n END LOOP;\\n RETURN FALSE;\\n END;\\n\\nBEGIN\\n FOR i IN 1..c_limit LOOP\\n v_nums(i) := i;\\n END LOOP;\\n\\n v_count_ludic := 1;\\n v_next_ludic := 1;\\n v_ludic(v_count_ludic) := v_next_ludic;\\n v_nums.DELETE(1);\\n\\n WHILE v_nums.COUNT > 0 LOOP\\n v_pos := v_nums.FIRST;\\n v_next_ludic := v_nums(v_pos);\\n v_count_ludic := v_count_ludic + 1;\\n v_ludic(v_count_ludic) := v_next_ludic;\\n v_count_pos := 0;\\n WHILE v_pos IS NOT NULL LOOP\\n IF MOD(v_count_pos, v_next_ludic) = 0 THEN\\n v_nums.DELETE(v_pos);\\n END IF;\\n v_pos := v_nums.NEXT(v_pos);\\n v_count_pos := v_count_pos + 1;\\n END LOOP;\\n END LOOP;\\n\\n dbms_output.put_line('Generate and show here the first 25 ludic numbers.');\\n FOR i IN 1..25 LOOP\\n dbms_output.put(v_ludic(i) || ' ');\\n END LOOP;\\n dbms_output.put_line('');\\n\\n dbms_output.put_line('How many ludic numbers are there less than or equal to 1000?');\\n v_count_ludic := 0;\\n FOR i IN 1..v_ludic.COUNT LOOP\\n EXIT WHEN v_ludic(i) > 1000;\\n v_count_ludic := v_count_ludic + 1;\\n END LOOP;\\n dbms_output.put_line(v_count_ludic);\\n\\n dbms_output.put_line('Show the 2000..2005''th ludic numbers.');\\n FOR i IN 2000..2005 LOOP\\n dbms_output.put(v_ludic(i) || ' ');\\n END LOOP;\\n dbms_output.put_line('');\\n\\n dbms_output.put_line('A triplet is any three numbers x, x + 2, x + 6 where all three numbers are also ludic numbers.');\\n dbms_output.put_line('Show all triplets of ludic numbers < 250 (Stretch goal)');\\n FOR i IN 1..v_ludic.COUNT LOOP\\n EXIT WHEN (v_ludic(i)+6) >= 250;\\n IF is_ludic(v_ludic(i)+2) AND is_ludic(v_ludic(i)+6) THEN\\n dbms_output.put_line(v_ludic(i) || ', ' || (v_ludic(i)+2) || ', ' || (v_ludic(i)+6));\\n END IF;\\n END LOOP;\\n\\nEND;\\n/\\n\",\n \"language\": \"PL-SQL\"\n },\n {\n \"code\": \"# Start with a pool large enough to meet the requirements\\n$Pool = [System.Collections.ArrayList]( 2..22000 )\\n\\n# Start with 1, because it's grandfathered in\\n$Ludic = @( 1 )\\n\\n# While the size of the pool is still larger than the next Ludic number...\\nWhile ( $Pool.Count -gt $Pool[0] )\\n {\\n # Add the next Ludic number to the list\\n $Ludic += $Pool[0]\\n\\n # Remove from the pool all entries whose index is a multiple of the next Ludic number\\n [math]::Truncate( ( $Pool.Count - 1 )/ $Pool[0])..0 | ForEach { $Pool.RemoveAt( $_ * $Pool[0] ) }\\n }\\n\\n# Add the rest of the numbers in the pool to the list of Ludic numbers\\n$Ludic += $Pool.ToArray()\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"# Display the first 25 Ludic numbers\\n$Ludic[0..24] -join \\\", \\\"\\n''\\n\\n# Display the count of all Ludic numbers under 1000\\n$Ludic.Where{ $_ -le 1000 }.Count\\n''\\n\\n# Display the 2000th through the 2005th Ludic number\\n$Ludic[1999..2004] -join \\\", \\\"\\n''\\n\\n# Display all Ludic triplets less than 250\\n$TripletStart = $Ludic.Where{ $_ -lt 244 -and ( $_ + 2 ) -in $Ludic -and ( $_ + 6 ) -in $Ludic }\\n$TripletStart.ForEach{ $_, ( $_ + 2 ), ( $_ + 6 ) -join \\\", \\\" }\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"% John Devou: 26-Nov-2021\\n\\nd(_,_,[],[]).\\nd(N,N,[_|Xs],Rs):- d(N,1,Xs,Rs).\\nd(N,M,[X|Xs],[X|Rs]):- M < N, M_ is M+1, d(N,M_,Xs,Rs).\\n\\nl([],[]).\\nl([X|Xs],[X|Rs]):- d(X,1,Xs,Ys), l(Ys,Rs).\\n\\n% g(N,L):- generate in L a list with Ludic numbers up to N\\n\\ng(N,[1|X]):- numlist(2,N,L), l(L,X).\\n\\ns(0,Xs,[],Xs).\\ns(N,[X|Xs],[X|Ls],Rs):- N > 0, M is N-1, s(M,Xs,Ls,Rs).\\n\\nt([X,Y,Z|_],[X,Y,Z]):- Y =:= X+2, Z =:= X+6.\\nt([_,Y,Z|Xs],R):- t([Y,Z|Xs],R).\\n\\n% tasks\\n\\nt1:- g(500,L), s(25,L,X,_), write(X), !.\\nt2:- g(1000,L), length(L,X), write(X), !.\\nt3:- g(22000,L), s(1999,L,_,R), s(6,R,X,_), write(X), !.\\nt4:- g(249,L), findall(A, t(L,A), X), write(X), !.\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"EnableExplicit\\nIf Not OpenConsole() : End 1 : EndIf\\n\\n#NMAX=25000\\n\\nDim ludic.b(#NMAX)\\nFillMemory(@ludic(0),SizeOf(Byte)*#NMAX,#True,#PB_Byte)\\n\\nDefine.i i,j,n,c1,c2\\nDefine r1$,r2$,r3$,r4$\\n\\nFor i=2 To Int(#NMAX/2)\\n If ludic(i)\\n n=0\\n For j=i+1 To #NMAX\\n If ludic(j) : n+1 : EndIf\\n If n=i : ludic(j)=#False : n=0 : EndIf\\n Next j\\n EndIf\\nNext i\\n\\nn=0 : c1=0 : c2=0\\nFor i=1 To #NMAX\\n If ludic(i) And n<25 : n+1 : r1$+Str(i)+\\\" \\\" : EndIf\\n If i<=1000 : c1+Bool(ludic(i)) : EndIf\\n c2+Bool(ludic(i))\\n If c2>=2000 And c2<=2005 And ludic(i) : r3$+Str(i)+\\\" \\\" : EndIf\\n If i<243 And ludic(i) And ludic(i+2) And ludic(i+6)\\n r4$+\\\"[\\\"+Str(i)+\\\" \\\"+Str(i+2)+\\\" \\\"+Str(i+6)+\\\"] \\\"\\n EndIf\\nNext\\nr2$=Str(c1)\\n\\nPrintN(\\\"First 25 Ludic numbers: \\\" +r1$)\\nPrintN(\\\"Ludic numbers below 1000: \\\" +r2$)\\nPrintN(\\\"Ludic numbers 2000 to 2005: \\\" +r3$)\\nPrintN(\\\"Ludic Triplets below 250: \\\" +r4$)\\nInput()\\nEnd\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"def ludic(nmax=100000):\\n yield 1\\n lst = list(range(2, nmax + 1))\\n while lst:\\n yield lst[0]\\n del lst[::lst[0]]\\n\\nludics = [l for l in ludic()]\\n\\nprint('First 25 ludic primes:')\\nprint(ludics[:25])\\nprint(\\\"\\\\nThere are %i ludic numbers <= 1000\\\"\\n % sum(1 for l in ludics if l <= 1000))\\nprint(\\\"\\\\n2000'th..2005'th ludic primes:\\\")\\nprint(ludics[2000-1: 2005])\\n\\nn = 250\\ntriplets = [(x, x+2, x+6)\\n for x in ludics\\n if x+6 < n and x+2 in ludics and x+6 in ludics]\\nprint('\\\\nThere are %i triplets less than %i:\\\\n %r'\\n % (len(triplets), n, triplets))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def ludic(nmax=64):\\n yield 1\\n taken = []\\n while True:\\n lst, nmax = list(range(2, nmax + 1)), nmax * 2\\n for t in taken:\\n del lst[::t]\\n while lst:\\n t = lst[0]\\n taken.append(t)\\n yield t\\n del lst[::t]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def ludic():\\n yield 1\\n ludics = []\\n while True:\\n k = 0\\n for j in reversed(ludics):\\n k = (k*j)//(j-1) + 1\\n ludics.append(k+2)\\n yield k+2\\ndef triplets():\\n a, b, c, d = 0, 0, 0, 0\\n for k in ludic():\\n if k-4 in (b, c, d) and k-6 in (a, b, c):\\n yield k-6, k-4, k\\n a, b, c, d = b, c, d, k\\n\\nfirst_25 = [k for i, k in zip(range(25), gen_ludic())]\\nprint(f'First 25 ludic numbers: {first_25}')\\ncount = 0\\nfor k in gen_ludic():\\n if k > 1000:\\n break\\n count += 1\\nprint(f'Number of ludic numbers <= 1000: {count}')\\nit = iter(gen_ludic())\\nfor i in range(1999):\\n next(it)\\nludic2000 = [next(it) for i in range(6)]\\nprint(f'Ludic numbers 2000..2005: {ludic2000}')\\n\\nprint('Ludic triplets < 250:')\\nfor a, b, c in triplets():\\n if c >= 250:\\n break\\n print(f'[{a}, {b}, {c}]')\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ 0 over of\\n swap times\\n [ i 1+ swap i poke ]\\n 1 split\\n [ dup 0 peek\\n rot over join unrot\\n over size over > while\\n 1 - temp put\\n [] swap\\n [ behead drop\\n temp share split\\n dip join\\n dup [] = until ]\\n drop temp release\\n again ]\\n drop behead drop join ] is ludic ( n --> [ )\\n\\n 999 ludic\\n say \\\"First 25 ludic numbers: \\\"\\n dup 25 split drop echo\\n cr cr\\n say \\\"There are \\\"\\n size echo\\n say \\\" ludic numbers less than 1000.\\\"\\n cr cr\\n 25000 ludic\\n say \\\"Ludic numbers 2000 to 2005: \\\"\\n 1999 split nip 6 split drop echo\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"#lang racket\\n(define lucid-sieve-size 25000) ; this should be enough to do me!\\n(define lucid?\\n (let ((lucid-bytes-sieve\\n (delay\\n (define sieve-bytes (make-bytes lucid-sieve-size 1))\\n (bytes-set! sieve-bytes 0 0) ; not a lucid number\\n (define (sieve-pass L)\\n (let loop ((idx (add1 L)) (skip (sub1 L)))\\n (cond\\n [(= idx lucid-sieve-size)\\n (for/first ((rv (in-range (add1 L) lucid-sieve-size))\\n #:unless (zero? (bytes-ref sieve-bytes rv))) rv)]\\n [(zero? (bytes-ref sieve-bytes idx))\\n (loop (add1 idx) skip)]\\n [(= skip 0)\\n (bytes-set! sieve-bytes idx 0)\\n (loop (add1 idx) (sub1 L))]\\n [else (loop (add1 idx) (sub1 skip))])))\\n (let loop ((l 2))\\n (when l (loop (sieve-pass l))))\\n sieve-bytes)))\\n\\n (λ (n) (= 1 (bytes-ref (force lucid-bytes-sieve) n)))))\\n\\n(define (dnl . things) (for-each displayln things))\\n\\n(dnl\\n \\\"Generate and show here the first 25 ludic numbers.\\\"\\n (for/list ((_ 25) (l (sequence-filter lucid? (in-naturals)))) l)\\n \\\"How many ludic numbers are there less than or equal to 1000?\\\"\\n (for/sum ((n 1001) #:when (lucid? n)) 1)\\n \\\"Show the 2000..2005'th ludic numbers.\\\"\\n (for/list ((i 2006) (l (sequence-filter lucid? (in-naturals))) #:when (>= i 2000)) l)\\n #<<EOS\\nA triplet is any three numbers x, x + 2, x + 6 where all three numbers are\\nalso ludic numbers. Show all triplets of ludic numbers < 250 (Stretch goal)\\nEOS\\n (for/list ((x (in-range 250)) #:when (and (lucid? x) (lucid? (+ x 2)) (lucid? (+ x 6))))\\n (list x (+ x 2) (+ x 6))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"constant @ludic = gather {\\n my @taken = take 1;\\n my @rotor;\\n\\n for 2..* -> $i {\\n loop (my $j = 0; $j < @rotor; $j++) {\\n --@rotor[$j] or last;\\n }\\n if $j < @rotor {\\n @rotor[$j] = @taken[$j+1];\\n }\\n else {\\n push @taken, take $i;\\n push @rotor, @taken[$j+1];\\n }\\n }\\n }\\n\\nsay @ludic[^25];\\nsay \\\"Number of Ludic numbers <= 1000: \\\", +(@ludic ...^ * > 1000);\\nsay \\\"Ludic numbers 2000..2005: \\\", @ludic[1999..2004];\\n\\nmy \\\\l250 = set @ludic ...^ * > 250;\\nsay \\\"Ludic triples < 250: \\\", gather\\n for l250.keys.sort -> $a {\\n my $b = $a + 2;\\n my $c = $a + 6;\\n take \\\"<$a $b $c>\\\" if $b ∈ l250 and $c ∈ l250;\\n }\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program gens/shows (a range of) ludic numbers, or a count when a range is used.*/\\nparse arg N count bot top triples . /*obtain optional arguments from the CL*/\\nif N=='' | N==\\\",\\\" then N= 25 /*Not specified? Then use the default.*/\\nif count=='' | count==\\\",\\\" then count= 1000 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif bot=='' | bot==\\\",\\\" then bot= 2000 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif top=='' | top==\\\",\\\" then top= 2005 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif triples=='' | triples==\\\",\\\" then triples= 249 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n#= 0 /*the number of ludic numbers (so far).*/\\n$= ludic( max(N, count, bot, top, triples) ) /*generate enough ludic nums*/\\nsay 'The first ' N \\\" ludic numbers: \\\" subword($,1,25) /*display 1st N ludic nums*/\\n do j=1 until word($, j) > count /*search up to a specific #.*/\\n end /*j*/\\nsay\\nsay \\\"There are \\\" j - 1 ' ludic numbers that are ≤ ' count\\nsay\\nsay \\\"The \\\" bot '───►' top ' (inclusive) ludic numbers are: ' subword($, bot)\\n@= /*list of ludic triples found (so far).*/\\n do j=1 for words($)\\n _= word($, j) /*it is known that ludic _ exists. */\\n if _>=triples then leave /*only process up to a specific number.*/\\n if wordpos(_+2, $)==0 | wordpos(_+6, $)==0 then iterate /*Not triple? Skip it.*/\\n #= # + 1 /*bump the triple counter. */\\n @= @ '◄'_ _+2 _+6\\\"► \\\" /*append the newly found triple ──► @ */\\n end /*j*/\\nsay\\nif @=='' then say 'From 1──►'triples\\\", no triples found.\\\"\\n else say 'From 1──►'triples\\\", \\\" # ' triples found:' @\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nludic: procedure; parse arg m,,@; $= 1 2 /*$≡ludic numbers superset; @≡sequence*/\\n do j=3 by 2 to m*15; @= @ j /*construct an initial list of numbers.*/\\n end /*j*/\\n @= @' '; n= words(@) /*append a blank to the number sequence*/\\n do while n\\\\==0; f= word(@, 1) /*examine the first word in the @ list.*/\\n $= $ f /*add the word to the $ list. */\\n do d=1 by f while d<=n; n= n-1 /*use 1st number, elide all occurrences*/\\n @= changestr(' 'word(@, d)\\\" \\\", @, ' . ') /*cross─out a number in @ */\\n end /*d*/ /* [↑] done eliding the \\\"1st\\\" number. */\\n @= translate(@, , .) /*change dots to blanks; count numbers.*/\\n end /*while*/ /* [↑] done eliding ludic numbers. */\\n return subword($, 1, m) /*return a range of ludic numbers. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Ludic numbers\\n\\nludic = list(300)\\nresludic = []\\nnr = 1\\nfor n = 1 to len(ludic)\\n ludic[n] = n+1\\nnext\\nsee \\\"the first 25 Ludic numbers are:\\\" + nl\\nludicnumbers(ludic)\\nshowarray(resludic)\\nsee nl\\n\\nsee \\\"Ludic numbers below 1000: \\\"\\nludic = list(3000)\\nresludic = []\\nfor n = 1 to len(ludic)\\n ludic[n] = n+1\\nnext\\nludicnumbers(ludic)\\nshowarray2(resludic)\\nsee nr\\nsee nl + nl\\n\\nsee \\\"the 2000..2005th Ludic numbers are:\\\" + nl\\nludic = list(60000)\\nresludic = []\\nfor n = 1 to len(ludic)\\n ludic[n] = n+1\\nnext\\nludicnumbers(ludic)\\nshowarray3(resludic)\\n\\nfunc ludicnumbers(ludic)\\n for n = 1 to len(ludic)\\n delludic = []\\n for m = 1 to len(ludic) step ludic[1]\\n add(delludic, m)\\n next\\n add(resludic, ludic[1])\\n for p = len(delludic) to 1 step -1\\n del(ludic, delludic[p])\\n next\\n next\\n\\nfunc showarray(vect)\\n see \\\"[1, \\\"\\n svect = \\\"\\\"\\n for n = 1 to 24\\n svect = svect + vect[n] + \\\", \\\"\\n next\\n svect = left(svect, len(svect) - 2)\\n see svect\\n see \\\"]\\\" + nl\\n\\nfunc showarray2(vect)\\n for n = 1 to len(vect)\\n if vect[n] <= 1000\\n nr = nr + 1\\n ok\\n next\\n return nr\\n\\nfunc showarray3(vect)\\n see \\\"[\\\"\\n svect = \\\"\\\"\\n for n = 1999 to 2004\\n svect = svect + vect[n] + \\\", \\\"\\n next\\n svect = left(svect, len(svect) - 2)\\n see svect\\n see \\\"]\\\" + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def ludic(nmax=100000)\\n Enumerator.new do |y|\\n y << 1\\n ary = *2..nmax\\n until ary.empty?\\n y << (n = ary.first)\\n (0...ary.size).step(n){|i| ary[i] = nil}\\n ary.compact!\\n end\\n end\\nend\\n\\nputs \\\"First 25 Ludic numbers:\\\", ludic.first(25).to_s\\n\\nputs \\\"Ludics below 1000:\\\", ludic(1000).count\\n\\nputs \\\"Ludic numbers 2000 to 2005:\\\", ludic.first(2005).last(6).to_s\\n\\nludics = ludic(250).to_a\\nputs \\\"Ludic triples below 250:\\\",\\n ludics.select{|x| ludics.include?(x+2) and ludics.include?(x+6)}.map{|x| [x, x+2, x+6]}.to_s\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"const ARRAY_MAX: usize = 25_000;\\nconst LUDIC_MAX: usize = 2100;\\n\\n/// Calculates and returns the first `LUDIC_MAX` Ludic numbers.\\n///\\n/// Needs a sufficiently large `ARRAY_MAX`.\\nfn ludic_numbers() -> Vec<usize> {\\n // The first two Ludic numbers\\n let mut numbers = vec![1, 2];\\n // We start the array with an immediate first removal to reduce memory usage by\\n // collecting only odd numbers.\\n numbers.extend((3..ARRAY_MAX).step_by(2));\\n\\n // We keep the correct Ludic numbers in place, removing the incorrect ones.\\n for ludic_idx in 2..LUDIC_MAX {\\n let next_ludic = numbers[ludic_idx];\\n\\n // We remove incorrect numbers by counting the indices after the correct numbers.\\n // We start from zero and keep until we reach the potentially incorrect numbers.\\n // Then we keep only those not divisible by the `next_ludic`.\\n let mut idx = 0;\\n numbers.retain(|_| {\\n let keep = idx <= ludic_idx || (idx - ludic_idx) % next_ludic != 0;\\n idx += 1;\\n keep\\n });\\n }\\n\\n numbers\\n}\\n\\nfn main() {\\n let ludic_numbers = ludic_numbers();\\n\\n print!(\\\"First 25: \\\");\\n print_n_ludics(&ludic_numbers, 25);\\n println!();\\n print!(\\\"Number of Ludics below 1000: \\\");\\n print_num_ludics_upto(&ludic_numbers, 1000);\\n println!();\\n print!(\\\"Ludics from 2000 to 2005: \\\");\\n print_ludics_from_to(&ludic_numbers, 2000, 2005);\\n println!();\\n println!(\\\"Triplets below 250: \\\");\\n print_triplets_until(&ludic_numbers, 250);\\n}\\n\\n/// Prints the first `n` Ludic numbers.\\nfn print_n_ludics(x: &[usize], n: usize) {\\n println!(\\\"{:?}\\\", &x[..n]);\\n}\\n\\n/// Calculates how many Ludic numbers are below `max_num`.\\nfn print_num_ludics_upto(x: &[usize], max_num: usize) {\\n let num = x.iter().take_while(|&&i| i < max_num).count();\\n println!(\\\"{}\\\", num);\\n}\\n\\n/// Prints Ludic numbers between two numbers.\\nfn print_ludics_from_to(x: &[usize], from: usize, to: usize) {\\n println!(\\\"{:?}\\\", &x[from - 1..to - 1]);\\n}\\n\\n/// Calculates triplets until a certain Ludic number.\\nfn triplets_below(ludics: &[usize], limit: usize) -> Vec<(usize, usize, usize)> {\\n ludics\\n .iter()\\n .enumerate()\\n .take_while(|&(_, &num)| num < limit)\\n .filter_map(|(idx, &number)| {\\n let triplet_2 = number + 2;\\n let triplet_3 = number + 6;\\n\\n // Search for the other two triplet numbers. We know they are larger than\\n // `number` so we can give the searches lower bounds of `idx + 1` and\\n // `idx + 2`. We also know that the `n + 2` number can only ever be two\\n // numbers away from the previous and the `n + 6` number can only be four\\n // away (because we removed some in between). Short circuiting and doing\\n // the check more likely to fail first are also useful.\\n let is_triplet = ludics[idx + 1..idx + 3].binary_search(&triplet_2).is_ok()\\n && ludics[idx + 2..idx + 5].binary_search(&triplet_3).is_ok();\\n\\n if is_triplet {\\n Some((number, triplet_2, triplet_3))\\n } else {\\n None\\n }\\n })\\n .collect()\\n}\\n\\n/// Prints triplets until a certain Ludic number.\\nfn print_triplets_until(ludics: &[usize], limit: usize) {\\n for (number, triplet_2, triplet_3) in triplets_below(ludics, limit) {\\n println!(\\\"{} {} {}\\\", number, triplet_2, triplet_3);\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object Ludic {\\n def main(args: Array[String]): Unit = {\\n println(\\n s\\\"\\\"\\\"|First 25 Ludic Numbers: ${ludic.take(25).mkString(\\\", \\\")}\\n |Ludic Numbers <= 1000: ${ludic.takeWhile(_ <= 1000).size}\\n |2000-2005th Ludic Numbers: ${ludic.slice(1999, 2005).mkString(\\\", \\\")}\\n |Triplets <= 250: ${triplets.takeWhile(_._3 <= 250).mkString(\\\", \\\")}\\\"\\\"\\\".stripMargin)\\n }\\n\\n def dropByN[T](lst: LazyList[T], len: Int): LazyList[T] = lst.grouped(len).flatMap(_.init).to(LazyList)\\n def ludic: LazyList[Int] = 1 #:: LazyList.unfold(LazyList.from(2)){case n +: ns => Some((n, dropByN(ns, n)))}\\n def triplets: LazyList[(Int, Int, Int)] = LazyList.from(1).map(n => (n, n + 2, n + 6)).filter{case (a, b, c) => Seq(a, b, c).forall(ludic.takeWhile(_ <= c).contains)}\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst func set of integer: ludicNumbers (in integer: n) is func\\n result\\n var set of integer: ludicNumbers is {1};\\n local\\n var set of integer: sieve is EMPTY_SET;\\n var integer: ludicNumber is 0;\\n var integer: number is 0;\\n var integer: count is 0;\\n begin\\n sieve := {2 .. n};\\n while sieve <> EMPTY_SET do\\n ludicNumber := min(sieve);\\n incl(ludicNumbers, ludicNumber);\\n count := 0;\\n for number range sieve do\\n if count rem ludicNumber = 0 then\\n excl(sieve, number);\\n end if;\\n incr(count);\\n end for;\\n end while;\\n end func;\\n\\nconst integer: limit is 22000;\\nconst set of integer: ludicNumbers is ludicNumbers(limit);\\n\\nconst proc: main is func\\n local\\n var integer: number is 0;\\n var integer: count is 0;\\n begin\\n write(\\\"First 25:\\\");\\n for number range ludicNumbers until count = 25 do\\n write(\\\" \\\" <& number);\\n incr(count);\\n end for;\\n writeln;\\n count := 0;\\n for number range ludicNumbers until number > 1000 do\\n incr(count);\\n end for;\\n writeln(\\\"Ludics below 1000: \\\" <& count);\\n write(\\\"Ludic 2000 to 2005:\\\");\\n count := 0;\\n for number range ludicNumbers until count >= 2005 do\\n incr(count);\\n if count >= 2000 then\\n write(\\\" \\\" <& number);\\n end if;\\n end for;\\n writeln;\\n write(\\\"Triples below 250:\\\");\\n for number range ludicNumbers until number > 250 do\\n if number + 2 in ludicNumbers and number + 6 in ludicNumbers then\\n write(\\\" (\\\" <& number <& \\\", \\\" <& number + 2 <& \\\", \\\" <& number + 6 <& \\\")\\\");\\n end if;\\n end for;\\n writeln;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"import <Utilities/Set.sl>;\\n\\nludic(v(1), result(1)) :=\\n\\tlet\\n\\t\\tn := head(v);\\n\\t\\tfiltered[i] := v[i] when (i-1) mod n /= 0;\\n\\tin\\n\\tresult when size(v) < 1 else\\n\\tludic(filtered, result ++ [n]);\\n\\t\\t\\ncount : int(1) * int * int -> int;\\ncount(v(1), top, index) :=\\n\\tindex-1 when v[index] > top else\\n\\tcount(v, top, index + 1);\\n\\nmain() :=\\n\\tlet\\n\\t\\tludics := ludic(2...100000, [1]);\\n\\t\\tludics250 := ludics[1 ... count(ludics, 250, 1)];\\n\\t\\ttriplets[i] := [i, i+2, i+6] when elementOf(i+2, ludics250) and elementOf(i+6, ludics250)\\n\\t\\t\\t\\t\\t\\t\\tforeach i within ludics250;\\n\\tin\\n\\t\\t\\\"First 25:\\\\n\\\" ++ toString(ludics[1...25]) ++\\n\\t\\t\\\"\\\\n\\\\nLudics below 1000:\\\\n\\\" ++ toString(count(ludics, 1000, 1)) ++\\n\\t\\t\\\"\\\\n\\\\nLudic 2000 to 2005:\\\\n\\\" ++ toString(ludics[2000...2005]) ++\\n\\t\\t\\\"\\\\n\\\\nTriples below 250:\\\\n\\\" ++ toString(triplets) ;\\n\",\n \"language\": \"SequenceL\"\n },\n {\n \"code\": \"func ludics_upto(nmax=100000) {\\n Enumerator({ |collect|\\n collect(1)\\n var arr = @(2..nmax)\\n while (arr) {\\n collect(var n = arr[0])\\n arr.range.by(n).each {|i| arr[i] = nil}\\n arr.compact!\\n }\\n })\\n}\\n\\nfunc ludics_first(n) {\\n ludics_upto(n * n.log2).first(n)\\n}\\n\\nsay(\\\"First 25 Ludic numbers: \\\", ludics_first(25).join(' '))\\nsay(\\\"Ludics below 1000: \\\", ludics_upto(1000).len)\\nsay(\\\"Ludic numbers 2000 to 2005: \\\", ludics_first(2005).last(6).join(' '))\\n\\nvar a = ludics_upto(250).to_a\\nsay(\\\"Ludic triples below 250: \\\", a.grep{|x| a.contains_all([x+2, x+6]) } \\\\\\n .map {|x| '(' + [x, x+2, x+6].join(' ') + ')' } \\\\\\n .join(' '))\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"open List;\\n\\nfun Ludi [] = []\\n | Ludi (T as h::L) =\\n let\\n fun next (h:: L ) =\\n let\\n val nw = #2 (ListPair.unzip (filter (fn (a,b) => a mod #2 h <> 0) L) )\\n in\\n ListPair.zip ( List.tabulate(List.length nw,fn i=>i) ,nw)\\n end\\n in\\n h :: Ludi ( next T)\\n end;\\n\\nval ludics = 1:: (#2 (ListPair.unzip(Ludi (ListPair.zip ( List.tabulate(25000,fn i=>i),tabulate (25000,fn i=>i+2)) )) ));\\n\\napp ((fn e => print (e^\\\" \\\")) o Int.toString ) (take (ludics,25));\\nlength (filter (fn e=> e <= 1000) ludics);\\ndrop (take (ludics,2005),1999);\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"package require Tcl 8.6\\n\\nproc ludic n {\\n global ludicList ludicGenerator\\n for {} {[llength $ludicList] <= $n} {lappend ludicList $i} {\\n\\tset i [$ludicGenerator]\\n\\tset ludicGenerator [coroutine L_$i apply {{gen k} {\\n\\t yield [info coroutine]\\n\\t while true {\\n\\t\\tset val [$gen]\\n\\t\\tif {[incr i] == $k} {set i 0} else {yield $val}\\n\\t }\\n\\t}} $ludicGenerator $i]\\n }\\n return [lindex $ludicList $n]\\n}\\n# Bootstrap the generator sequence\\nset ludicList [list 1]\\nset ludicGenerator [coroutine L_1 apply {{} {\\n set n 1\\n yield [info coroutine]\\n while true {yield [incr n]}\\n}}]\\n\\n# Default of 1000 is not enough\\ninterp recursionlimit {} 5000\\n\\nfor {set i 0;set l {}} {$i < 25} {incr i} {lappend l [ludic $i]}\\nputs \\\"first25: [join $l ,]\\\"\\n\\nfor {set i 0} {[ludic $i] <= 1000} {incr i} {}\\nputs \\\"below=1000: $i\\\"\\n\\nfor {set i 1999;set l {}} {$i < 2005} {incr i} {lappend l [ludic $i]}\\nputs \\\"2000-2005: [join $l ,]\\\"\\n\\nfor {set i 0} {[ludic $i] < 256} {incr i} {set isl([ludic $i]) $i}\\nfor {set i 1;set l {}} {$i < 250} {incr i} {\\n if {[info exists isl($i)] && [info exists isl([expr {$i+2}])] && [info exists isl([expr {$i+6}])]} {\\n\\tlappend l ($i,[expr {$i+2}],[expr {$i+6}])\\n }\\n}\\nputs \\\"triplets: [join $l ,]\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"const max_i32 = 1<<31 - 1 // i.e. math.MaxInt32\\n// ludic returns a slice of ludic numbers stopping after\\n// either n entries or when max is exceeded.\\n// Either argument may be <=0 to disable that limit.\\nfn ludic(nn int, m int) []u32 {\\n mut n := nn\\n mut max := m\\n if max > 0 && n < 0 {\\n n = max_i32\\n }\\n if n < 1 {\\n return []\\n }\\n if max < 0 {\\n max = max_i32\\n }\\n mut sieve := []u32{len: 10760} // XXX big enough for 2005 ludics\\n sieve[0] = 1\\n sieve[1] = 2\\n if n > 2 {\\n // We start with even numbers already removed\\n for i, j := 2, u32(3); i < sieve.len; i, j = i+1, j+2 {\\n sieve[i] = j\\n }\\n // We leave the ludic numbers in place,\\n // k is the index of the next ludic\\n for k := 2; k < n; k++ {\\n mut l := int(sieve[k])\\n if l >= max {\\n n = k\\n break\\n }\\n mut i := l\\n l--\\n // last is the last valid index\\n mut last := k + i - 1\\n for j := k + i + 1; j < sieve.len; i, j = i+1, j+1 {\\n last = k + i\\n sieve[last] = sieve[j]\\n if i%l == 0 {\\n j++\\n }\\n }\\n // Truncate down to only the valid entries\\n if last < sieve.len-1 {\\n sieve = sieve[..last+1]\\n }\\n }\\n }\\n if n > sieve.len {\\n panic(\\\"program error\\\") // should never happen\\n }\\n return sieve[..n]\\n}\\n\\nfn has(x []u32, v u32) bool {\\n for i := 0; i < x.len && x[i] <= v; i++ {\\n if x[i] == v {\\n return true\\n }\\n }\\n return false\\n}\\n\\nfn main() {\\n // ludic() is so quick we just call it repeatedly\\n println(\\\"First 25: ${ludic(25, -1)}\\\")\\n println(\\\"Numner of ludics below 1000: ${ludic(-1, 1000).len}\\\")\\n println(\\\"ludic 2000 to 2005: ${ludic(2005, -1)[1999..]}\\\")\\n\\n print(\\\"Tripples below 250:\\\")\\n x := ludic(-1, 250)\\n for i, v in x[..x.len-2] {\\n if has(x[i+1..], v+2) && has(x[i+2..], v+6) {\\n print(\\\", ($v ${v+2} ${v+6})\\\")\\n }\\n }\\n println('')\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Set list = CreateObject(\\\"System.Collections.Arraylist\\\")\\nSet ludic = CreateObject(\\\"System.Collections.Arraylist\\\")\\n\\n'populate the list\\nFor i = 1 To 25000\\n\\tlist.Add i\\nNext\\n\\n'set 1 as the first ludic number\\nludic.Add list(0)\\nlist.RemoveAt(0)\\n\\n'variable to count ludic numbers <= 1000\\nup_to_1k = 1\\n\\n'determine the succeeding ludic numbers\\nFor j = 2 To 2005\\n\\tIf list.Count > 0 Then\\n\\t\\tIf list(0) <= 1000 Then\\n\\t\\t\\tup_to_1k = up_to_1k + 1\\n\\t\\tEnd If\\n\\t\\tludic.Add list(0)\\n\\tElse\\n\\t\\tExit For\\n\\tEnd If\\n\\tincrement = list(0) - 1\\n\\tn = 0\\n\\tDo While n <= list.Count - 1\\n\\t\\tlist.RemoveAt(n)\\n\\t\\tn = n + increment\\n\\tLoop\\nNext\\n\\n'the first 25 ludics\\nWScript.StdOut.WriteLine \\\"First 25 Ludic Numbers:\\\"\\nFor k = 0 To 24\\n\\tIf k < 24 Then\\n\\t\\tWScript.StdOut.Write ludic(k) & \\\", \\\"\\n\\tElse\\n\\t\\tWScript.StdOut.Write ludic(k)\\n\\tEnd If\\nNext\\nWScript.StdOut.WriteBlankLines(2)\\n\\n'the number of ludics up to 1000\\nWScript.StdOut.WriteLine \\\"Ludics up to 1000: \\\"\\nWScript.StdOut.WriteLine up_to_1k\\nWScript.StdOut.WriteBlankLines(1)\\n\\n'2000th - 2005th ludics\\nWScript.StdOut.WriteLine \\\"The 2000th - 2005th Ludic Numbers:\\\"\\nFor k = 1999 To 2004\\n\\tIf k < 2004 Then\\n\\t\\tWScript.StdOut.Write ludic(k) & \\\", \\\"\\n\\tElse\\n\\t\\tWScript.StdOut.Write ludic(k)\\n\\tEnd If\\nNext\\nWScript.StdOut.WriteBlankLines(2)\\n\\n'triplets up to 250: x, x+2, and x+6\\nWScript.StdOut.WriteLine \\\"Ludic Triplets up to 250: \\\"\\ntriplets = \\\"\\\"\\nk = 0\\nDo While ludic(k) + 6 <= 250\\n\\tx2 = ludic(k) + 2\\n\\tx6 = ludic(k) + 6\\n\\tIf ludic.IndexOf(x2,1) > 0 And ludic.IndexOf(x6,1) > 0 Then\\n\\t\\ttriplets = triplets & ludic(k) & \\\", \\\" & x2 & \\\", \\\" & x6 & vbCrLf\\n\\tEnd If\\n\\tk = k + 1\\nLoop\\nWScript.StdOut.WriteLine triplets\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar ludic = Fn.new { |n, max|\\n var maxInt32 = 2.pow(31) - 1\\n if (max > 0 && n < 0) n = maxInt32\\n if (n < 1) return []\\n if (max < 0) max = maxInt32\\n var sieve = List.filled(10760, 0)\\n sieve[0] = 1\\n sieve[1] = 2\\n if (n > 2) {\\n var j = 3\\n for (i in 2...sieve.count) {\\n sieve[i] = j\\n j = j + 2\\n }\\n for (k in 2...n) {\\n var l = sieve[k]\\n if (l >= max) {\\n n = k\\n break\\n }\\n var i = l\\n l = l - 1\\n var last = k + i - 1\\n var j = k + i + 1\\n while (j < sieve.count) {\\n last = k + i\\n sieve[last] = sieve[j]\\n if (i%l == 0) j = j + 1\\n i = i + 1\\n j = j + 1\\n }\\n if (last < sieve.count-1) sieve = sieve[0..last]\\n }\\n }\\n if (n > sieve.count) Fiber.abort(\\\"Program error.\\\")\\n return sieve[0...n]\\n}\\n\\nvar has = Fn.new { |x, v|\\n var i = 0\\n while (i < x.count && x[i] <= v) {\\n if (x[i] == v) return true\\n i = i + 1\\n }\\n return false\\n}\\n\\nSystem.print(\\\"First 25: %(ludic.call(25, -1))\\\")\\nSystem.print(\\\"Number of Ludics below 1000: %(ludic.call(-1, 1000).count)\\\")\\nSystem.print(\\\"Ludics 2000 to 2005: %(ludic.call(2005, -1)[1999..-1])\\\")\\nSystem.print(\\\"Triplets below 250:\\\")\\nvar x = ludic.call(-1, 250)\\nvar i = 0\\nvar triples = []\\nfor (v in x.take(x.count-2)) {\\n if (has.call(x[i+1..-1], v+2) && has.call(x[i+2..-1], v+6)) {\\n triples.add([v, v+2, v+6])\\n }\\n i = i + 1\\n}\\nSystem.print(triples)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"def Size = 25000;\\nchar Sieve(1+Size);\\nint I, Count, Ludic;\\n[\\\\Make sieve for Ludic numbers\\nfor I:= 1 to Size do Sieve(I):= true;\\nLudic:= 2;\\nloop [I:= Ludic; Count:= Ludic;\\n loop [repeat I:= I+1;\\n if I > Size then quit;\\n until Sieve(I);\\n Count:= Count-1;\\n if Count = 0 then\\n [Sieve(I):= false;\\n Count:= Ludic;\\n ];\\n ];\\n repeat Ludic:= Ludic+1;\\n if Ludic > Size then quit;\\n until Sieve(Ludic);\\n ];\\n\\\\Show first 25 Ludic numbers\\nCount:= 0; I:= 1;\\nloop [if Sieve(I) then\\n [IntOut(0, I); ChOut(0, ^ );\\n Count:= Count+1;\\n if Count >= 25 then quit;\\n ];\\n I:= I+1;\\n ];\\nCrLf(0);\\n\\\\Show how many Ludic numbers are <= 1000\\nCount:= 0;\\nfor I:= 1 to 1000 do\\n if Sieve(I) then Count:= Count+1;\\nIntOut(0, Count);\\nCrLf(0);\\n\\\\Show Ludic numbers from 2000 to 2005\\nCount:= 0; I:= 1;\\nloop [if Sieve(I) then\\n [Count:= Count+1;\\n if Count >= 2000 then\\n [IntOut(0, I); ChOut(0, ^ )];\\n if Count >= 2005 then quit;\\n ];\\n I:= I+1;\\n ];\\nCrLf(0);\\n\\\\Show triplets of Ludic numbers < 250\\nfor I:= 1 to 250-1-6 do\\n if Sieve(I) & Sieve(I+2) & Sieve(I+6) then\\n [ChOut(0, ^();\\n IntOut(0, I); ChOut(0, ^ );\\n IntOut(0, I+2); ChOut(0, ^ );\\n IntOut(0, I+6); Text(0, \\\") \\\");\\n ];\\nCrLf(0);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"fcn dropNth(n,seq){\\n seq.tweak(fcn(n,skipper,idx){ if(0==idx.inc()%skipper) Void.Skip else n }\\n\\t .fp1(n,Ref(1))) // skip every nth number of previous sequence\\n}\\nfcn ludic{ //-->Walker\\n Walker(fcn(rw){ w:=rw.value; n:=w.next(); rw.set(dropNth(n,w)); n }\\n\\t .fp(Ref([3..*,2]))) // odd numbers starting at 3\\n .push(1,2); // first two Ludic numbers\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"ludic().walk(25).toString(*).println();\\nludic().reduce(fcn(sum,n){ if(n<1000) return(sum+1); return(Void.Stop,sum); },0).println();\\nludic().drop(1999).walk(6).println(); // Ludic's between 2000 & 2005\\n\\nls:=ludic().filter(fcn(n){ (n<250) and True or Void.Stop }); // Ludic's < 250\\nls.filter('wrap(n){ ls.holds(n+2) and ls.holds(n+6) }).apply(fcn(n){ T(n,n+2,n+6) }).println();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Ludic-numbers"}}},{"rowIdx":455,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Luhn_test_of_credit_card_numbers\nnote: Checksums\n","language":"00-META"},{"code":"The [[wp:Luhn algorithm|Luhn test]] is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits.\n\nThose companies using credit card numbers that can be validated by the Luhn test have numbers that pass the following test:\n# Reverse the order of the digits in the number.\n# Take the first, third, ... and every other odd digit in the reversed digits and sum them to form the partial sum s1\n# Taking the second, fourth ... and every other even digit in the reversed digits:\n:# Multiply each digit by two and sum the digits if the answer is greater than nine to form partial sums for the even digits\n:# Sum the partial sums of the even digits to form s2\n# If s1 + s2 ends in zero then the original number is in the form of a valid credit card number as verified by the Luhn test.\n\n<br>\nFor example, if the trial number is 49927398716:\n<pre>Reverse the digits:\n 61789372994\nSum the odd digits:\n 6 + 7 + 9 + 7 + 9 + 4 = 42 = s1\nThe even digits:\n 1, 8, 3, 2, 9\n Two times each even digit:\n 2, 16, 6, 4, 18\n Sum the digits of each multiplication:\n 2, 7, 6, 4, 9\n Sum the last:\n 2 + 7 + 6 + 4 + 9 = 28 = s2\n\ns1 + s2 = 70 which ends in zero which means that 49927398716 passes the Luhn test</pre>\n\n\n;Task:\nWrite a function/method/procedure/subroutine that will validate a number with the Luhn test, and \n<br>use it to validate the following numbers:\n 49927398716\n 49927398717\n 1234567812345678\n 1234567812345670\n\n<br>\n;Related tasks:\n* [[SEDOLs|SEDOL]]\n* [[Calculate International Securities Identification Number|ISIN]]\n<br><br>\n\n","language":"00-TASK"},{"code":"F luhn(n)\n V ch = String(n)\n V sum = 0\n V chParity = ch.len % 2\n L(i) (ch.len-1 .. 0).step(-1)\n V j = Int(ch[i])\n I (i + 1) % 2 != chParity\n j *= 2\n I j > 9\n j -= 9\n sum += j\n R sum % 10 == 0\n\nL(n) (49927398716,\n 49927398717,\n 1234567812345678,\n 1234567812345670)\n print(luhn(n))\n","language":"11l"},{"code":"* Luhn test of credit card numbers 22/05/2016\nLUHNTEST CSECT\n USING LUHNTEST,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 R9,T @t(k)\n LA R8,N for n\nLOOPK EQU * for k=1 to n\n LR R4,R9 @t(k),@s[1]\n LA R6,1 from i=1\n LA R7,M to m\nLOOPI1 CR R6,R7 for i=1 to m\n BH ELOOPI1 leave i\n CLI 0(R4),C' ' if mid(s,i,1)=\" \"\n BNE ITERI1 then\n BCTR R6,0 i-1\n ST R6,L l=i-1\n B ELOOPI1 exit for\n* end if\nITERI1 LA R4,1(R4) next @s[i]\n LA R6,1(R6) i=i+1\n B LOOPI1 next i\nELOOPI1 EQU * out of loop i\n MVC W,BLANK w=\" \"\n LA R4,W iw=@w\n LR R5,R9 is=@s\n A R5,L is=@s+l\n BCTR R5,0 is=s+l-1\n L R6,L i=l\n LA R7,1 to 1\nLOOPI2 CR R6,R7 for i=l to 1 by -1\n BL ELOOPI2 leave i\n MVC 0(1,R4),0(R5) mid(w,iw,1)=mid(s,is,1)\n LA R4,1(R4) iw=iw+1\n BCTR R5,0 is=is-1\n BCTR R6,0 i=i-1\n B LOOPI2 next i\nELOOPI2 EQU * out of loop i\n LA R11,0 s1=0\n LA R12,0 s2=0\n LA R6,1 i=1\n L R7,L to l\nLOOPI3 CR R6,R7 for i=1 to l\n BH ELOOPI3 leave i\n LA R2,W-1 @w-1\n AR R2,R6 w[i]\n MVC CI,0(R2) ci=mid(w,i,1)\n NI CI,X'0F' zap upper half byte\n LR R4,R6 i\n SRDA R4,32 >>32\n D R4,=F'2' i/2\n LTR R4,R4 if mod(i,2)>0\n BNH NOTMOD then\n XR R2,R2 clear\n IC R2,CI z=cint(mid(w,i,1))\n AR R11,R2 s1=s1+cint(mid(w,i,1))\n B EIFMOD else\nNOTMOD XR R2,R2 clear\n IC R2,CI cint(mid(w,i,1))\n SLA R2,1 *2\n ST R2,Z z=cint(mid(w,i,1))*2\n C R2,=F'10' if z<10\n BNL GE10 then\n A R12,Z s2=s2+z\n B EIF10 else\nGE10 L R2,Z z\n CVD R2,PL8 binary to packed\n UNPK CL16,PL8 packed to zoned\n OI CL16+15,X'F0' zoned to char (zap sign)\n MVC X(1),CL16+15 x=right(cstr(z),1)\n NI X,X'0F' zap upper half byte\n XR R2,R2 r2=0\n IC R2,X r2=cint(right(cstr(z),1))\n AR R12,R2 s2=s2+r2\n LA R12,1(R12) s2=s2+cint(right(cstr(z),1))+1\nEIF10 EQU * end if\nEIFMOD EQU * end if\n LA R6,1(R6) i=i+1\n B LOOPI3 next i\nELOOPI3 EQU * out of loop i\n LR R1,R11 s1\n AR R1,R12 s1+s2\n CVD R1,PL8 binary to packed\n UNPK CL16,PL8 packed to zoned\n CLI CL16+15,X'C0' if right(cstr(s1+s2),1)=\"0\"\n BNE NOTZERO then\n MVC R,=CL8'Valid' r=\"Valid\"\n B ECLI else\nNOTZERO MVC R,=CL8'Invalid' r=\"Invalid\"\nECLI EQU * end if\n MVC PG(M),0(R9) t(k)\n MVC PG+M+1(L'R),R r\n XPRNT PG,L'PG print buffer\n LA R9,M(R9) at=at+m\n BCT R8,LOOPK next k\n L R13,4(0,R13) epilog\n LM R14,R12,12(R13) \"\n XR R15,R15 \"\n BR R14 exit\nN EQU (TEND-T)/L'T\nM EQU 20\nT DC CL(M)'49927398716 '\n DC CL(M)'49927398717 '\n DC CL(M)'1234567812345678 '\n DC CL(M)'1234567812345670 '\nTEND DS 0C\nW DS CL(M)\nBLANK DC CL(M)' '\nL DS F\nZ DS F\nPL8 DS PL8\nCL16 DS CL16\nCI DS C\nX DS C\nR DS CL8\nPG DC CL80' ' buffer\n YREGS\n END LUHNTEST\n","language":"360-Assembly"},{"code":"\torg\t100h\n\tjmp \tdemo\n\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t;;;\tCheck if the 0-terminated string at HL passes the Luhn test.\n\t;;;\tReturns with carry clear if the string passes, carry set\n\t;;;\tif the string fails.\nluhn:\tmvi\tb,0\t; Counter\n\tmov\td,b\t; D = S1+S2 (we don't need to keep them separate)\nlscan:\tmov\ta,m\t; Get byte\n\tinx \th\t; Increment pointer\n\tinr\tb\t; Increment counter\n\tana\ta\t; Is it 0?\n\tjnz\tlscan\t; If not, try next byte\n\tdcx\th\t; Go to the byte before the 0\n\tdcx\th\n\tdcr\tb\t; Decrement counter\n\trz\t\t; If 0, the string was empty, return.\nlloop:\tmvi\tc,'0'\t; ASCII zero\n\tmov\ta,d\t; Add odd digit to the total\n\tadd\tm\n\tsub\tc\t; Subtract ASCII zero\n\tmov\td,a\n\tdcr\tb\t; If last digit, we're done\n\tjz\tldone\n\tdcx\th\t; Go back one byte\n\tmov\ta,m\t; Get even digit\n\tsub\tc\t; Subtract ASCII zero\n\tadd\ta\t; Multiply by two\n\tmvi\tc,9\t; 10-1, compensate for extra subtraction loop\nldiv:\tinr\tc\t; Find two digits using trial subtraction\n\tsui\t10\t\t\n\tjnc\tldiv\n\tadd\tc\t; Add the possible second digit in\n\tadd\td\t; Add it to the total\n\tmov\td,a\n\tdcx\th\t; Go back one byte\n\tdcr\tb\t; Done yet?\n\tjnz\tlloop\nldone:\tmov\ta,d\t; See if total is divisible by 10\n\tmvi\tb,10\nlchk:\tsub\tb\t; Trial subtraction, subtract 10\n\trz\t\t; If zero, it is divisible, return (carry clear)\n\trc\t\t; If carry, it is not divisible, return (carry set)\n\tjmp\tlchk\n\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t;;;\tRun the routine on the argument given on the CP/M command line\ndemo:\tlxi\th,80h\t; Zero-terminate the command line argument\n\tmov\ta,m\n\tadd\tl\n\tmov\tl,a\n\tinr\tl\n\tmvi\tm,0\n\tmvi\tl,82h\t; Run the 'luhn' subroutine\n\tcall \tluhn\n\tmvi\tc,9\n\tlxi\td,pass\t; Carry clear = print 'Pass'\n\tjnc\t5\n\tlxi\td,fail\t; Carry set = print 'Fail'\n\tjmp\t5\npass:\tdb\t'Pass$'\nfail:\tdb\t'Fail$'\n","language":"8080-Assembly"},{"code":"\tbits\t16\n\tcpu\t8086\n\torg\t100h\nsection\t.text\n\tjmp\tdemo\t\n\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t;;; \tCheck whether the 0-terminated string at DS:SI passes the Luhn\n\t;;; \ttest. Returns with carry clear if the string passes, carry\n\t;;;\tset if the string fails.\nluhn:\tpush\tes\t; Keep original ES, and set ES=DS so SCASB can be used.\n\tpush\tds\t; \"REP DS:SCASB\" is a bad idea, because the 286 has a\n\tpop\tes\t; bug where it \"forgets\" the 2nd prefix if interrupted!\n\tmov\tdi,si\t; DI = pointer\n\txor\tax,ax\t; Zero to test against\n\txor\tbl,bl\t; BL = S1+S2\n\tmov\tdx,0A30h\t; DH = 10 (divisor), DL = '0' (ASCII zero)\n\txor\tcx,cx\t; Set counter to 65535\n\tdec\tcx\n\tcld\t\t; Seek forwards\n\trepnz\tscasb\t; Find zero\n\tdec\tdi\t; SCASB goes one byte too far\n\txchg\tsi,di\t; SI = pointer, DI = end (or rather, beginning)\n\tmov\tcx,si\t; CX = counter\n\tsub\tcx,di\n\tjcxz\t.done\t; Empty string = stop\n\tdec\tsi\t; We don't need the zero itself\n\tstd\t\t; Seek backwards\n.loop:\tlodsb\t\t; Get number in odd position\n\tsub\tal,dl\t; Subtract ASCII zero\n\tadd\tbl,al\t; Add to total\n\tdec\tcx\t; One fewer character\n\tjz\t.done\t; No more characters = stop\n\tlodsb\t\t; Get number in even position\n\tsub\tal,dl\t; Subtract ASCII zero\n\tadd\tal,al\t; Multiply by two\n\txor\tah,ah\t; AX = AL\n\tdiv\tdh\t; Divide by 10; AL=quotient, AH=remainder\n\tadd\tal,ah\t; Add the two \"digits\" together\n\tadd\tbl,al\t; Add to total\n\tloop \t.loop\t; Decrement CX and loop\n.done:\txor\tah,ah\t; Divide total by 10\n\tmov\tal,bl\n\tdiv\tdh\n\tand\tah,ah\t; If remainder 0, then return with carry clear\n\tjz\t.out\n\tstc\t\t; Set carry (remainder wasn't 0, the test failed)\n.out:\tcld\t\t; Clean up: clear direction flag,\n\tpop\tes\t; and restore ES.\n\tret\n\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t;;;\tRun the 'luhn' routine on the argument given on the MS-DOS\n\t;;;\tcommand line.\ndemo:\tmov\tsi,80h\t\t\t; Zero-terminate the argument\n\txor\tbh,bh\n\tmov\tbl,[si]\n\tmov\t[si+bx+1],bh\n\tinc\tsi\n\tinc\tsi\n\tcall \tluhn\t\t\t; Call the routine\n\tmov\tah,9\n\tmov\tdx,pass\t\t\t; If carry is clear, print 'Pass'\n\tjnc\tprint\n\tmov\tdx,fail\t\t\t; Otherwise, print 'fail'\nprint:\tint\t21h\n\tret\nsection\t.data\npass:\tdb\t'Pass$'\nfail:\tdb\t'Fail$'\n","language":"8086-Assembly"},{"code":"\\ Adapted from the C version:\n: remap \\ n1 -- n2\n [0,2,4,6,8,1,3,5,7,9]\n swap caseof ;\n\n: luhn \\ s -- f\n 0 swap\n s:rev\n (\n '0 n:-\n swap 2 n:mod if remap then\n n:+\n ) s:each\n 10 n:mod not ;\n\n: test-luhn \\ s --\n dup . space\n luhn if \"OK\" else \"FAIL\" then . cr ;\n\n\"49927398716\" test-luhn\n\"49927398717\" test-luhn\n\"1234567812345678\" test-luhn\n\"1234567812345670\" test-luhn\n\nbye\n","language":"8th"},{"code":"METHOD luhn_check.\n\n DATA: sum(1) TYPE n VALUE 0. \" Sum of checksum.\n DATA: current TYPE i. \" Current digit.\n DATA: odd TYPE i VALUE 1. \" Multiplier.\n DATA: len TYPE i. \" String crowler.\n\n\n \" Luhn algorithm.\n len = NUMOFCHAR( pi_string ) - 1.\n WHILE ( len >= 0 ).\n current = pi_string+len(1) * odd.\n IF ( current > 9 ).\n current = current - 9. \" Digits sum.\n ENDIF.\n sum = sum + current.\n odd = 3 - odd. \" 1 <--> 2 Swich\n len = len - 1. \" Move to next charcter.\n ENDWHILE.\n\n \" Validation check.\n IF ( sum = 0 ).\n pr_valid = abap_true.\n ELSE.\n pr_valid = abap_false.\n ENDIF.\n\nENDMETHOD.\n","language":"ABAP"},{"code":"(include-book \"arithmetic-3/top\" :dir :system)\n\n(defun digits (n)\n (if (zp n)\n nil\n (cons (mod n 10)\n (digits (floor n 10)))))\n\n(defun sum (xs)\n (if (endp xs)\n 0\n (+ (first xs)\n (sum (rest xs)))))\n\n(defun double-and-sum-digits (xs)\n (if (endp xs)\n nil\n (cons (sum (digits (* 2 (first xs))))\n (double-and-sum-digits (rest xs)))))\n\n(defun dmx (xs)\n (if (endp (rest xs))\n (mv xs nil)\n (mv-let (odds evens)\n (dmx (rest (rest xs)))\n (mv (cons (first xs) odds)\n (cons (second xs) evens)))))\n\n(defun luhn (n)\n (mv-let (odds evens)\n (dmx (digits n))\n (= (mod (+ (sum odds)\n (sum (double-and-sum-digits evens)))\n 10)\n 0)))\n","language":"ACL2"},{"code":"PROC ReverseDigits(CHAR ARRAY n,rev)\n BYTE i,j\n\n i=n(0)\n WHILE i>0 AND n(i)='0\n DO\n i==-1\n OD\n\n j=1\n WHILE i>0\n DO\n rev(j)=n(i)\n j==+1 i==-1\n OD\n rev(0)=j-1\nRETURN\n\nBYTE FUNC SumOddDigits(CHAR ARRAY n)\n BYTE sum,i\n\n sum=0\n FOR i=1 TO n(0) STEP 2\n DO\n sum==+ValB(n(i))\n OD\nRETURN(sum)\n\nBYTE FUNC SumEvenDigitsMultiplied(CHAR ARRAY n)\n BYTE sum,i,v\n\n sum=0\n FOR i=2 TO n(0) STEP 2\n DO\n v=ValB(n(i))*2\n IF v>9 THEN v==-9 FI\n sum==+v\n OD\nRETURN(sum)\n\nBYTE FUNC Luhn(CHAR ARRAY n)\n CHAR ARRAY rev(20)\n BYTE s1,s2\n\n ReverseDigits(n,rev)\n s1=SumOddDigits(rev)\n s2=SumEvenDigitsMultiplied(rev)\n\n IF (s1+s2) MOD 10=0 THEN\n RETURN(1)\n FI\nRETURN(0)\n\nPROC Test(CHAR ARRAY n)\n PrintF(\"%S is \",n)\n IF Luhn(n) THEN\n PrintE(\"valid\")\n ELSE\n PrintE(\"invalid\")\n FI\nRETURN\n\nPROC Main()\n Test(\"49927398716\")\n Test(\"49927398717\")\n Test(\"1234567812345678\")\n Test(\"1234567812345670\")\nRETURN\n","language":"Action-"},{"code":"function isValid(numString:String):Boolean\n{\n\tvar isOdd:Boolean = true;\n\tvar oddSum:uint = 0;\n\tvar evenSum:uint = 0;\n\tfor(var i:int = numString.length - 1; i >= 0; i--)\n\t{\n\t\tvar digit:uint = uint(numString.charAt(i))\n\t\tif(isOdd) oddSum += digit;\n\t\telse evenSum += digit/5 + (2*digit) % 10;\n\t\tisOdd = !isOdd;\n\t}\n\tif((oddSum + evenSum) % 10 == 0) return true;\n\treturn false;\n}\n\ntrace(isValid(\"49927398716\"));\ntrace(isValid(\"49927398717\"));\ntrace(isValid(\"1234567812345678\"));\ntrace(isValid(\"1234567812345670\"));\n","language":"ActionScript"},{"code":"with Ada.Text_IO;\nuse Ada.Text_IO;\n\nprocedure Luhn is\n\n function Luhn_Test (Number: String) return Boolean is\n Sum : Natural := 0;\n Odd : Boolean := True;\n Digit: Natural range 0 .. 9;\n begin\n for p in reverse Number'Range loop\n Digit := Integer'Value (Number (p..p));\n if Odd then\n Sum := Sum + Digit;\n else\n Sum := Sum + (Digit*2 mod 10) + (Digit / 5);\n end if;\n Odd := not Odd;\n end loop;\n return (Sum mod 10) = 0;\n end Luhn_Test;\n\nbegin\n\n Put_Line (Boolean'Image (Luhn_Test (\"49927398716\")));\n Put_Line (Boolean'Image (Luhn_Test (\"49927398717\")));\n Put_Line (Boolean'Image (Luhn_Test (\"1234567812345678\")));\n Put_Line (Boolean'Image (Luhn_Test (\"1234567812345670\")));\n\nend Luhn;\n","language":"Ada"},{"code":"PROC to int = (CHAR c)INT:\n ABS c - ABS \"0\";\n\nPROC confirm = (STRING id)BOOL:\n(\n BOOL is odd digit := TRUE;\n INT s := 0;\n STRING cp;\n\n FOR cp key FROM UPB id BY -1 TO LWB id DO\n INT k := to int(id[cp key]);\n s +:=\n IF is odd digit THEN k\n ELIF k /= 9 THEN 2*k MOD 9\n ELSE 9\n FI;\n is odd digit := NOT is odd digit\n OD;\n 0 = s MOD 10\n);\n\nmain:\n(\n []STRING t cases = (\n \"49927398716\",\n \"49927398717\",\n \"1234567812345678\",\n \"1234567812345670\"\n );\n FOR cp key TO UPB t cases DO\n STRING cp = t cases[cp key];\n print((cp, \": \", confirm(cp), new line))\n OD\n)\n","language":"ALGOL-68"},{"code":"% returns true if ccNumber passes the Luhn test, false otherwise %\n% as Algol W has fixed length strings, the length of the number %\n% must be specified in ccLength %\nlogical procedure LuhnTest ( string(32) value ccNumber\n ; integer value ccLength\n ) ;\nbegin\n integer checkSum;\n logical oddDigit, isValid;\n checkSum := 0;\n isValid := oddDigit := true;\n for cPos := ccLength step -1 until 1 do begin\n integer digit;\n digit := decode( ccNumber( cPos - 1 // 1 ) ) - decode( \"0\" );\n if digit < 0 or digit > 9 then isValid := false\n else if oddDigit\n then checkSum := checkSum + digit\n else checkSum := checkSum + ( case digit + 1 of ( 0, 2, 4, 6, 8\n , 1, 3, 5, 7, 9\n )\n );\n oddDigit := not oddDigit\n end for_cPos ;\n isValid and ( ( checkSum rem 10 ) = 0 )\nend LuhnTest\n","language":"ALGOL-W"},{"code":"begin\n % external procedure that returns true if ccNumber passes the Luhn test, false otherwise %\n logical procedure LuhnTest ( string(32) value ccNumber\n ; integer value ccLength\n ) ; algol \"LUHN\" ;\n\n\n % task test cases %\n\n procedure testLuhnTest ( string(32) value ccNumber\n ; integer value ccLength\n ) ;\n write( s_w := 0, ccNumber, if LuhnTest( ccNumber, ccLength ) then \" is valid\" else \" is invalid\" );\n\n testLuhnTest( \"49927398716\", 11 );\n testLuhnTest( \"49927398717\", 11 );\n testLuhnTest( \"1234567812345678\", 16 );\n testLuhnTest( \"1234567812345670\", 16 )\n\nend.\n","language":"ALGOL-W"},{"code":"LuhnTest←{\n digits←⍎¨⍵ ⍝ Characters to digits\n doubled←2∘×@(⌽⍤~1 0⍴⍨≢)⊢digits ⍝ Double every other digit\n partial←-∘9@(9∘<)⊢doubled ⍝ Subtract 9 is equivalent to sum of digits for the domain 10≤x≤19\n 0=10|+/partial ⍝ Valid if sum is a multiple of 10\n }\n","language":"APL"},{"code":" ∇ ret←LuhnTest num;s1;s2\n[1] num←⌽((⌈10⍟num)/10)⊤num\n[2] s1←+/((⍴num)⍴1 0)/num\n[3] s2←+/∊(⊂10 10)⊤¨2×((⍴num)⍴0 1)/num\n[4] ret←0=10⊤s1+s2\n ∇\n","language":"APL"},{"code":"-- luhn :: String -> Bool\non luhn(s)\n -- True if the digit string represents\n -- a valid Luhn credit card number.\n\n script divMod10Sum\n on |λ|(a, x)\n a + x div 10 + x mod 10\n end |λ|\n end script\n\n 0 = foldl(divMod10Sum, 0, ¬\n zipWith(my mul, ¬\n map(my int, reverse of (characters of s)), ¬\n cycle({1, 2}))) mod 10\nend luhn\n\n\n--------------------------- TEST ---------------------------\non run\n map(luhn, ¬\n {\"49927398716\", \"49927398717\", ¬\n \"1234567812345678\", \"1234567812345670\"})\n\n --> {true, false, false, true}\nend run\n\n\n---------------- REUSABLE GENERIC FUNCTIONS ----------------\n\n-- cycle :: [a] -> Generator [a]\non cycle(xs)\n script\n property lng : 1 + (length of xs)\n property i : missing value\n on |λ|()\n if missing value is i then\n set i to 1\n else\n set nxt to (1 + i) mod lng\n if 0 = ((1 + i) mod lng) then\n set i to 1\n else\n set i to nxt\n end if\n end if\n return item i of xs\n end |λ|\n end script\nend cycle\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-- int :: String -> Int\non int(s)\n s as integer\nend int\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-- 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-- 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-- 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-- mul (*) :: Num a => a -> a -> a\non mul(a, b)\n a * b\nend mul\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-- 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":"on luhnTest(n)\n -- Accept only text input.\n if (n's class is not text) then return false\n -- Edit out any spaces or dashes.\n set astid to AppleScript's text item delimiters\n set AppleScript's text item delimiters to {space, \"-\"}\n set n to n's text items\n set AppleScript's text item delimiters to \"\"\n set n to n as text\n set AppleScript's text item delimiters to astid\n -- Check that what's left is numeric.\n try\n n as number\n on error\n return false\n end try\n\n -- Do the calculation two digits at a time, starting at the end of the text and working back.\n set sum to 0\n repeat with i from ((count n) - 1) to 1 by -2\n set n2 to (text i thru (i + 1) of n) as integer\n tell n2 div 10 mod 10 * 2 to set sum to sum + it div 10 + it mod 10 + n2 mod 10\n end repeat\n -- If there's an odd digit left over, add that in too.\n if (i is 2) then set sum to sum + (character 1 of n)\n\n return (sum mod 10 is 0)\nend luhnTest\n\n-- Test code:\nset testResults to {}\nrepeat with testNumber in {\"49927398716\", \"49927398717\", \"1234567812345678\", \"1234567812345670\"}\n set end of testResults to {testNumber:testNumber's contents, valid:luhnTest(testNumber)}\nend repeat\nreturn testResults\n","language":"AppleScript"},{"code":"{{testNumber:\"49927398716\", valid:true}, {testNumber:\"49927398717\", valid:false}, {testNumber:\"1234567812345678\", valid:false}, {testNumber:\"1234567812345670\", valid:true}}\n","language":"AppleScript"},{"code":".text\n.global _start\n_start:\n ldr r0, =example_numbers\n bl test_number\n\n add r1, r0, #1\n bl length\n add r0, r1, r0\n bl test_number\n\n add r1, r0, #1\n bl length\n add r0, r1, r0\n bl test_number\n\n add r1, r0, #1\n bl length\n add r0, r1, r0\n bl test_number\n\n mov r0, #0\n mov r7, #1\n swi 0\n\ntest_number:\n push {r0, lr}\n bl print_string\n\n bl luhn_test\n cmp r0, #1\n ldreq r0, =valid_message\n ldrne r0, =invalid_message\n bl print_string\n pop {r0, lr}\n mov pc, lr\n\n\n\nprint_string:\n push {r0-r7, lr}\n mov r1, r0 @ string to print\n bl length\n mov r2, r0 @ length of string\n mov r0, #1 @ write to stdout\n mov r7, #4 @ SYS_WRITE\n swi 0 @ call system interupt\n pop {r0-r7, lr}\n mov pc, lr\n\n@ r0 address of credit card number string\n@ returns result in r0\nluhn_test:\n push {r1-r7, lr}\n mov r1, r0\n bl isNumerical @ check if string is a number\n cmp r0, #1\n bne .luhn_test_end @ exit if not number\n mov r0, r1\n ldr r1, =reversed_string @ address to store reversed string\n bl reverse @ reverse string\n push {r0}\n bl length @ get length of string\n mov r4, r0 @ store string length in r4\n pop {r0}\n mov r2, #0 @ string index\n mov r6, #0 @ sum of odd digits\n mov r7, #0 @ sum of even digits\n .loadNext:\n ldrb r3, [r1, r2] @ load byte into r3\n sub r3, #'0' @ convert letter to digit\n and r5, r2, #1 @ test if index is even or odd\n cmp r5, #0\n beq .odd_digit\n bne .even_digit\n .odd_digit:\n add r6, r3 @ add digit to sum if odd\n b .continue @ skip next step\n .even_digit:\n lsl r3, #1 @ multiply digit by 2\n cmp r3, #10 @ sum digits\n subge r3, #10 @ get digit in 1s place\n addge r3, #1 @ add 1 for the 10s place\n add r7, r3 @ add digit sum to the total\n\n .continue:\n add r2, #1 @ increment digit index\n cmp r2, r4 @ check if at end of string\n blt .loadNext\n\n add r0, r6, r7 @ add even and odd sum\n mov r3, r0 @ copy sum to r3\n ldr r1, =429496730 @ (2^32-1)/10\n sub r0, r0, r0, lsr #30 @ divide by 10\n umull r2, r0, r1, r0\n mov r1, #10\n mul r0, r1 @ multiply the r0 by 10 to see if divisible\n cmp r0, r3 @ compare with the original value in r3\n .luhn_test_end:\n movne r0, #0 @ return false if invalid card number\n moveq r0, #1 @ return true if valid card number\n pop {r1-r7, lr}\n mov pc, lr\n\nlength:\n push {r1-r2, lr}\n mov r2, r0 @ start of string address\n .loop:\n ldrb r1, [r2], #1 @ load byte from address r2 and increment\n cmp r1, #0 @ check for end of string\n bne .loop @ load next byte if not 0\n sub r0, r2, r0 @ subtract end of string address from start\n sub r0, #1 @ end of line from count\n pop {r1-r2, lr}\n mov pc, lr\n\n@ reverses a string\n@ r0 address of string to reverse\n@ r1 address to store reversed string\nreverse:\n push {r0-r5, lr}\n push {r0, lr}\n bl length @ get length of string to reverse\n mov r3, r0 @ backword index\n pop {r0, lr}\n mov r4, #0 @ fowrard index\n .reverse_next:\n sub r3, #1 @ decrement backword index\n ldrb r5, [r0, r3] @ load byte from original string at index\n strb r5, [r1, r4] @ copy byte to reversed string\n add r4, #1 @ increment fowrard index\n cmp r3, #0 @ check if any characters are left\n bge .reverse_next\n\n mov r5, #0\n strb r5, [r1, r4] @ write null byte to terminate reversed string\n pop {r0-r5, lr}\n mov pc, lr\n\nisNumerical:\n push {r1, lr}\n .isNumerical_checkNext:\n ldrb r1, [r0], #1\n cmp r1, #0\n beq .isNumerical_true\n cmp r1, #'0'\n blt .isNumerical_false\n cmp r1, #'9'\n bgt .isNumerical_false\n b .isNumerical_checkNext\n .isNumerical_false:\n mov r0, #0\n b .isNumerical_end\n .isNumerical_true:\n mov r0, #1\n .isNumerical_end:\n pop {r1, lr}\n mov pc, lr\n\n\n.data\nvalid_message:\n .asciz \" valid card number\\n\"\ninvalid_message:\n .asciz \" invalid card number\\n\"\n\nreversed_string:\n .space 32\n\nexample_numbers:\n .asciz \"49927398716\"\n .asciz \"49927398717\"\n .asciz \"1234567812345678\"\n .asciz \"1234567812345670\"\n","language":"ARM-Assembly"},{"code":"digits: function [n][\n res: new []\n while -> n > 0 [\n 'res ++ n % 10\n n: n / 10\n ]\n res\n]\n\nluhn?: function [n][\n s1: new 0\n s2: new 0\n loop.with: 'i digits n 'd [\n if? even? i -> 's1 + d\n else [\n 'd * 2\n if d > 9 -> 'd - 9\n 's2 + d\n ]\n ]\n zero? (s1 + s2) % 10\n]\n\nprint luhn? 49927398716\nprint luhn? 49927398717\nprint luhn? 1234567812345678\nprint luhn? 1234567812345670\n","language":"Arturo"},{"code":"; Originally submitted by Laszlo:\n; http://www.autohotkey.com/forum/post-229412.html#229412\n\nMsgBox % LuhnTest(49927398716)\nMsgBox % LuhnTest(49927398717)\nMsgBox % LuhnTest(1234567812345678)\nMsgBox % LuhnTest(1234567812345670)\n\nReturn\n\n;-----------------------------\n\nLuhnTest(Number)\n{\n MultFactor := 2 - ( StrLen(Number) & 1 ) , Sum := 0\n Loop, Parse, Number\n Sum += ( ( 9 < ( Temp := MultFactor * A_LoopField ) ) ? Temp - 9 : Temp ) , MultFactor := 3 - MultFactor\n Return !Mod(Sum,10)\n}\n","language":"AutoHotkey"},{"code":"Global $avarray[4] = [49927398716, 49927398717, 1234567812345678, 1234567812345670]\nFor $i = 0 To 3\n\tcheckLuhn($avarray[$i])\nNext\n\nFunc checkLuhn($number)\n\t$sum = 0\n\t$numDigits = StringSplit($number, \"\")\n\tFor $i = $numDigits[0] - 1 To 1 Step -2\n\t\t$numDigits[$i] = $numDigits[$i] * 2\n\t\tIf $numDigits[$i] >= 10 Then $numDigits[$i] -= 9\n\tNext\n\tFor $i = 1 To $numDigits[0]\n\t\t$sum += $numDigits[$i]\n\tNext\n\tIf StringRight($sum, 1) = \"0\" Then\n\t\tConsoleWrite(\"Luhn-Check (\" & $number & \") : True\" & @CRLF)\n\t\tReturn True\n\tElse\n\t\tConsoleWrite(\"Luhn-Check (\" & $number & \") : False\" & @CRLF)\n\t\tReturn False\n\tEndIf\nEndFunc ;==>checkLuhn\n","language":"AutoIt"},{"code":"#!/usr/bin/awk -f\nBEGIN {\n A[1] = 49927398716;\n A[2] = 49927398717;\n A[3] = 1234567812345678;\n A[4] = 1234567812345670;\n A[5] = \"01234567897\";\n A[6] = \"01234567890\";\n A[7] = \"00000000000\";\n for (k in A) print \"isLuhn(\"A[k]\"): \",isLuhn(A[k]);\t\n}\n\nfunction isLuhn(cardno) {\n s = 0;\n m = \"0246813579\";\n n = length(cardno);\n for (k = n; 0 < k; k -= 2) {\n\ts += substr(cardno, k, 1);\n }\n for (k = n-1; 0 < k; k -= 2) {\n\ts += substr(m, substr(cardno, k, 1)+1, 1);\n }\n return ((s%10)==0);\t\n}\n","language":"AWK"},{"code":"dim card$(5)\ncard$[1]=\"49927398716\"\ncard$[2]=\"49927398717\"\ncard$[3]=\"1234567812345678\"\ncard$[4]=\"1234567812345670\"\n\nfor test = 1 to 4\n odd = True\n sum = 0\n for n = length(card$[test]) to 1 step -1\n num = int(mid(card$[test],n,1))\n if odd then\n sum += num\n odd = False\n else\n num *= 2\n if num <= 9 then\n sum += num\n else\n sum += int(left(string(num),1)) + int(right(string(num),1))\n end if\n odd = True\n end if\n next\n if sum mod 10 = 0 then\n print card$[test], \"True\"\n else\n print card$[test], \"False\"\n end if\nnext test\n","language":"BASIC256"},{"code":"@echo off\nsetlocal enabledelayedexpansion\n\ncall :luhn 49927398716\ncall :luhn 49927398717\ncall :luhn 1234567812345678\ncall :luhn 1234567812345670\nexit /b 0\n\n:luhn\nset \"input=%1\"\nset \"cnt=0\"\nset \"s1=0\"\nset \"s2=0\"\n:digit_loop\nset /a \"cnt-=1\"\nset /a \"isOdd=(-%cnt%)%%2\"\n\nif !isodd! equ 1 (\n\tset /a \"s1+=!input:~%cnt%,1!\"\n) else (\n\tset /a \"twice=!input:~%cnt%,1!*2\"\n\tif !twice! geq 10 (\n\t\tset /a \"s2+=!twice:~0,1!+!twice:~1,1!\"\n\t) else (\n\t\tset /a \"s2+=!twice!\"\n\t)\n)\nif \"!input:~%cnt%!\"==\"!input!\" (\n\tset /a \"sum=(!s1!+!s2!)%%10\"\n\tif !sum! equ 0 (echo !input! is valid.) else (echo !input! is not valid.)\n\tgoto :EOF\n)\ngoto digit_loop\n","language":"Batch-File"},{"code":" FOR card% = 1 TO 4\n READ cardnumber$\n IF FNluhn(cardnumber$) THEN\n PRINT \"Card number \" cardnumber$ \" is valid\"\n ELSE\n PRINT \"Card number \" cardnumber$ \" is invalid\"\n ENDIF\n NEXT card%\n END\n\n DATA 49927398716, 49927398717, 1234567812345678, 1234567812345670\n\n DEF FNluhn(card$)\n LOCAL I%, L%, N%, S%\n L% = LEN(card$)\n FOR I% = 1 TO L%\n N% = VAL(MID$(card$, L%-I%+1, 1))\n IF I% AND 1 THEN\n S% += N%\n ELSE\n N% *= 2\n S% += N% MOD 10 + N% DIV 10\n ENDIF\n NEXT\n = (S% MOD 10) = 0\n","language":"BBC-BASIC"},{"code":"/* Return 1 if number passes Luhn test, else 0 */\ndefine l(n) {\n auto m, o, s, x\n\n o = scale\n scale = 0\n\n m = 1\n while (n > 0) {\n x = (n % 10) * m\n if (x > 9) x -= 9\n s += x\n m = 3 - m\n n /= 10\n }\n\n s %= 10\n scale = o\n if (s) return(0)\n return(1)\n}\n\nl(49927398716)\nl(49927398717)\nl(1234567812345678)\nl(1234567812345670)\n","language":"Bc"},{"code":"get \"libhdr\"\n\nlet luhn(s) = valof\n$( let sum=0 and fac=1\n for i = s%0 to 1 by -1\n $( unless '0' <= s%i <= '9' resultis false\n sum := sum + fac*(s%i - '0') rem 10 + fac*(s%i - '0')/10\n fac := 3 - fac\n $)\n resultis sum rem 10 = 0\n$)\n\nlet show(s) be\n writef(\"%S: %S*N\", s, luhn(s) -> \"pass\", \"fail\")\n\nlet start() be\n$( show(\"49927398716\")\n show(\"49927398717\")\n show(\"1234567812345678\")\n show(\"1234567812345670\")\n$)\n","language":"BCPL"},{"code":"v 1 >$0 v v <\n>&:19+`|v < >v 5 6 7 8\n^ \\ <>09p19p>09g+09p:|>2*:19+%19g+19p19+/19g+19p:|\n 2 3 4 > v\n v\"invalid\"<10 9\n |%+91+g91g90<\n v \"valid\"<\n >:#,_@\n 11\n","language":"Befunge"},{"code":"Luhn ← (0=10|⊢)∘(+´(10|⊢)+⊢≥10˙)∘(⊢×≠⥊1‿2˙)∘(⌽•Fmt-'0'˙)\n\n(⍉⊢≍Luhn¨) ⟨49927398716,49927398717,1234567812345678,1234567812345670⟩\n","language":"BQN"},{"code":" ( luhn\n = sum odd even\n . 0:?sum\n & rev$!arg:?arg\n & whl\n ' ( @( !arg\n : %?odd\n ( %?even ?arg\n | :?arg&0:?even\n )\n )\n & !odd+mod$(2*!even.10)+div$(!even.5)+!sum:?sum\n )\n & mod$(!sum.10):0\n )\n& ( test\n =\n . out\n $ (!arg \":\" (luhn$!arg&true|false))\n )\n& test$49927398716\n& test$49927398717\n& test$1234567812345678\n& test$1234567812345670\n& ;\n","language":"Bracmat"},{"code":">>>>>>>>>+>,----------[ READ CHARACTERS UNTIL \\N AND\n >++++++++[<----->-]<++>>>>>>+>,----------] SUBTRACT ASCII 0 FROM EACH\n<-<<<<<<< GO TO LAST DIGIT\n[ WHILE THERE ARE DIGITS\n >>>>>>>>[-<<<<<<<+>>>>>>>]<<<<<<<< ADD RUNNING TOTAL TO ODD DGT\n <<<<<<< GO TO EVEN DIGIT\n [ IF THERE IS ONE\n >[->++<]>[-<+>] MUL BY TWO\n >>>++++++++++<<<<[ DIVMOD BY TEN\n >>>[-]+>-[<-<]<[<<] DECR DIVISOR\n >>[ IF ZERO\n >++++++++++>+<<-]<<< SET TO TEN; INCR QUOTIENT\n -] DECR DIVIDEND UNTIL ZERO\n ++++++++++>>>>[-<<<<->>>>] CALCULATE REMAINDER\n >[-<<<<<+>>>>>] ADD QUOTIENT TO IT\n >>[-<<<<<<<+>>>>>>>]<<<<<<<< THEN ADD RUNNING TOTAL\n <<<<< ZERO BEFORE NEXT ODD DIGIT\n ]<< GO TO NEXT ODD DIGIT\n]\n>>>>>>>-[+>>-]> GO TO TOTAL\n>>>>++++++++++<<<<[ MODULO TEN\n >>>[-]+>-[<-<]<[<<] DECR DIVISOR\n >>[>++++++++++<-] IF ZERO SET BACK TO TEN\n<<<-] DECR DIVIDEND UNTIL ZERO\n>>>++++++++++>[-<->]< REMAINDER: TEN MINUS DIVISOR\n<<<<<<++++++++++[-> VALUES FOR ASCII OUTPUT\n +++++++++++> 110\n ++++++++++> 100\n ++++++++> 80\n +++++++<<<<] 70\n>>>>>+> GO BACK TO REMAINDER\n[<<.<<---.<-----.+++.<] IF NOT ZERO FAIL\n<[<<.<---.<+++++..<] IF ZERO PASS\n++++++++++. NEWLINE\n","language":"Brainf---"},{"code":":import std/Combinator .\n:import std/Math .\n:import std/List .\n\nluhn number→list → reverse → check → (\\mod (+10)) → zero?\n\tcheck y [[[[0 [[[6 \\5 (4 + (5 odd even)) 1]]] 1]]]] k (+0)\n\t\todd 2\n\t\teven digit-sum (2 ⋅ (+2))\n\n:test (luhn (+61789372994)) ([[1]])\n:test (luhn (+49927398716)) ([[1]])\n:test (luhn (+49927398717)) ([[0]])\n:test (luhn (+1234567812345678)) ([[0]])\n:test (luhn (+1234567812345670)) ([[1]])\n","language":"Bruijn"},{"code":"tt \"Remove whitespace\"vv\npe \"Eval to number\"vv\n<- \"Reverse digits\"vv\nXX \"Split number into digits\"vv\n\n{\n { \"Odd digits\"vv\n 2EN\n }\n\n { \"Even digits\"vv\n 2en\n {\n 2.* \"Double\"vv\n ^^ 9.> \"<test>=Duplicate greater than 9\"vv\n {\n XX++ \"Sum digits\"vv\n }if \"If <test>\"vv\n }m[ \"For each even digit\"vv\n }\n}M- \"Cool map. Create array of each branch applied to argument.\"vv\n\n{++}m[ \"Sum each block (odd & even)\"vv\n++ \"Sum these\"vv\n[- \"Last digit\"vv\n0== \"Equal to zero\"vv\nQ \"Pretty print\"vv\n","language":"Burlesque"},{"code":"#include <string.h>\n#include <stdio.h>\n\nint luhn(const char* cc)\n{\n\tconst int m[] = {0,2,4,6,8,1,3,5,7,9}; // mapping for rule 3\n\tint i, odd = 1, sum = 0;\n\n\tfor (i = strlen(cc); i--; odd = !odd) {\n\t\tint digit = cc[i] - '0';\n\t\tsum += odd ? digit : m[digit];\n\t}\n\n\treturn sum % 10 == 0;\n}\n\nint main()\n{\n\tconst char* cc[] = {\n\t\t\"49927398716\",\n\t\t\"49927398717\",\n\t\t\"1234567812345678\",\n\t\t\"1234567812345670\",\n\t\t0\n\t};\n\tint i;\n\n\tfor (i = 0; cc[i]; i++)\n\t\tprintf(\"%16s\\t%s\\n\", cc[i], luhn(cc[i]) ? \"ok\" : \"not ok\");\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iostream>\nusing namespace std;\n\nint toInt(const char c)\n{\n return c-'0';\n}\n\nint confirm( const char *id)\n{\n bool is_odd_dgt = true;\n int s = 0;\n const char *cp;\n\n for(cp=id; *cp; cp++);\n while(cp > id) {\n --cp;\n int k = toInt(*cp);\n if (is_odd_dgt) {\n s += k;\n }\n else {\n s += (k!=9)? (2*k)%9 : 9;\n }\n\tis_odd_dgt = !is_odd_dgt;\n }\n return 0 == s%10;\n}\n\nint main( )\n{\n const char * t_cases[] = {\n \"49927398716\",\n \"49927398717\",\n \"1234567812345678\",\n \"1234567812345670\",\n NULL,\n };\n for ( const char **cp = t_cases; *cp; cp++) {\n cout << *cp << \": \" << confirm(*cp) << endl;\n }\n return 0;\n}\n","language":"C++"},{"code":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nbool luhn( const string& id)\n{\n static const int m[10] = {0,2,4,6,8,1,3,5,7,9}; // mapping for rule 3\n bool is_odd_dgt = false;\n auto lambda = [&](int a, char c) {return a + ((is_odd_dgt = !is_odd_dgt) ? c-'0' : m[c-'0']);};\n int s = std::accumulate(id.rbegin(), id.rend(), 0, lambda);\n return 0 == s%10;\n}\n\nint main( )\n{\n auto t_cases = {\"49927398716\", \"49927398717\", \"1234567812345678\", \"1234567812345670\"};\n auto print = [](const string & s) {cout << s << \": \" << luhn(s) << endl;};\n for_each(t_cases.begin(), t_cases.end(), print);\n return 0;\n}\n","language":"C++"},{"code":"#include <iostream>\n#include <type_traits>\n\ntemplate<size_t I, int... Args>\nstruct find_impl;\n\ntemplate<int A, int... Args>\nstruct find_impl<0, A, Args...> {\n using type = std::integral_constant<int, A>;\n};\n\ntemplate<int A, int B, int... Args>\nstruct find_impl<0, A, B, Args...> {\n using type = std::integral_constant<int, A>;\n};\n\ntemplate<size_t I, int A, int B, int... Args>\nstruct find_impl<I, A, B, Args...> {\n using type = typename find_impl<I-1, B, Args...>::type;\n};\n\nnamespace detail {\ntemplate<typename, typename>\nstruct append_sequence\n{};\n\ntemplate<typename T, typename... Ts>\nstruct append_sequence<T, std::tuple<Ts...>> {\n using type = std::tuple<Ts..., T>;\n};\n\ntemplate<typename... Ts>\nstruct reverse_sequence {\n using type = std::tuple<>;\n};\n\ntemplate<typename T, typename... Ts>\nstruct reverse_sequence<T, Ts...> {\n using type = typename append_sequence<\n T,\n typename reverse_sequence<Ts...>::type\n >::type;\n};\n}\n\ntemplate<size_t I>\nusing rule3 = typename find_impl<I, 0, 2, 4, 6, 8, 1, 3, 5, 7, 9>::type;\n\ntemplate<int A, char C, bool dgt>\nstruct calc\n : std::integral_constant<int, A + C - '0'>\n{};\n\ntemplate<int A, char C>\nstruct calc<A, C, false>\n : std::integral_constant<int, A + rule3<C - '0'>::type::value>\n{};\n\ntemplate<typename Acc, bool Dgt, char...>\nstruct luhn_impl;\n\ntemplate<typename Acc, bool Dgt, char A, char... Args>\nstruct luhn_impl<Acc, Dgt, A, Args...> {\n using type = typename calc<Acc::value, A, Dgt>::type;\n};\n\ntemplate<typename Acc, bool Dgt, char A, char B, char... Args>\nstruct luhn_impl<Acc, Dgt, A, B, Args...> {\n using type =\n typename luhn_impl<typename calc<Acc::value, A, Dgt>::type, !Dgt, B, Args...>::type;\n};\n\ntemplate<typename>\nstruct luhn;\n\ntemplate<typename... Args>\nstruct luhn<std::tuple<Args...>> {\n using type = typename luhn_impl<std::integral_constant<int, 0>, true, Args::value...>::type;\n constexpr static bool result = (type::value % 10) == 0;\n};\n\ntemplate<char... Args>\nbool operator \"\" _luhn() {\n return luhn<typename detail::reverse_sequence<std::integral_constant<char, Args>...>::type>::result;\n}\n\nint main() {\n std::cout << std::boolalpha;\n std::cout << 49927398716_luhn << std::endl;\n std::cout << 49927398717_luhn << std::endl;\n std::cout << 1234567812345678_luhn << std::endl;\n std::cout << 1234567812345670_luhn << std::endl;\n return 0;\n}\n","language":"C++"},{"code":" public static class Luhn\n {\n public static bool LuhnCheck(this string cardNumber)\n {\n return LuhnCheck(cardNumber.Select(c => c - '0').ToArray());\n }\n\n private static bool LuhnCheck(this int[] digits)\n {\n return GetCheckValue(digits) == 0;\n }\n\n private static int GetCheckValue(int[] digits)\n {\n return digits.Select((d, i) => i % 2 == digits.Length % 2 ? ((2 * d) % 10) + d / 5 : d).Sum() % 10;\n }\n }\n\n public static class TestProgram\n {\n public static void Main()\n {\n long[] testNumbers = {49927398716, 49927398717, 1234567812345678, 1234567812345670};\n foreach (var testNumber in testNumbers)\n Console.WriteLine(\"{0} is {1}valid\", testNumber, testNumber.ToString().LuhnCheck() ? \"\" : \"not \");\n }\n }\n","language":"C-sharp"},{"code":"using System;\nusing System.Linq;\n\nnamespace Luhn\n{\n class Program\n {\n public static bool luhn(long n)\n {\n long nextdigit, sum = 0;\n bool alt = false;\n while (n != 0)\n {\n nextdigit = n % 10;\n if (alt)\n {\n nextdigit *= 2;\n nextdigit -= (nextdigit > 9) ? 9 : 0;\n }\n sum += nextdigit;\n alt = !alt;\n n /= 10;\n }\n return (sum % 10 == 0);\n }\n\n public static bool luhnLinq(long n)\n {\n string s = n.ToString();\n return s.Select((c, i) => (c - '0') << ((s.Length - i - 1) & 1)).Sum(n => n > 9 ? n - 9 : n) % 10 == 0;\n }\n\n static void Main(string[] args)\n {\n long[] given = new long[] {49927398716, 49927398717, 1234567812345678, 1234567812345670};\n foreach (long num in given)\n {\n string valid = (luhn(num)) ? \" is valid\" : \" is not valid\";\n Console.WriteLine(num + valid);\n }\n\n }\n }\n}\n","language":"C-sharp"},{"code":"using System;\nnamespace Luhn_Test\n{\n\tpublic static class Extensions\n\t{\n\t\tpublic static string Reverse(this string s )\n\t\t{\n\t\t char[] charArray = s.ToCharArray();\n\t\t Array.Reverse( charArray );\n\t\t return new string( charArray );\n\t\t}\n\t}\n\tclass Program\n\t{\n\t\tpublic static bool Luhn(long x)\n\t\t{\n\t\t\tlong s1=0;\n\t\t\tlong s2=0;\n\t\t\tbool STATE=x%10!=0; // If it ends with zero, we want the order to be the other way around\n\t\t\tx=long.Parse(x.ToString().Reverse());\n\t\t\twhile (x!=0)\n\t\t\t{\n\t\t\t\ts1+=STATE?x%10:0;\n\t\t\t\ts2+=STATE?0:((x%10)*2>9)?(((x%10)*2/10)+((x%10)*2)%10):((x%10)*2);\n\t\t\t\tSTATE=!STATE; //Switch state\n\t\t\t\tx/=10; //Cut the last digit and continue\n\t\t\t}\n\t\t\treturn ((s1+s2)%10==0); //Check if it ends with zero, if so, return true, otherwise,false.\n\t\t}\n\t\tpublic static void Main(string[] args)\n\t\t{\n\t\t\tlong[] ks = {1234567812345670, 49927398717, 1234567812345678 ,1234567812345670 };\n\t\t\tforeach (long k in ks)\n\t\t\t{\n\t\t\tConsole.WriteLine(\"{0} is {1} Valid.\",k,Luhn(k)?\"\":\"Not\");\t\n\t\t\t}\n\t\tStart:\n\t\t\ttry {\n\t\t\tConsole.WriteLine(\"Enter your credit:\");\n\t\t\tlong x=long.Parse(Console.ReadLine());\n\t\t\tConsole.WriteLine(\"{0} Valid.\",Luhn(x)?\"\":\"Not\");\n\t\t\tgoto Start;\n\t\t\t}\n\t\t\tcatch (FormatException)\n\t\t\t{\n\t\t\t\tgoto Start;\n\t\t\t}\t\t\t\n\t\t}\n\t}\n}\n","language":"C-sharp"},{"code":"using System;\nusing System.Linq;\n\npublic class CreditCardLogic\n{\n static Func<char, int> charToInt = c => c - '0';\n\n static Func<int, int> doubleDigit = n => (n * 2).ToString().Select(charToInt).Sum();\n\n static Func<int, bool> isOddIndex = index => index % 2 == 0;\n\n public static bool LuhnCheck(string creditCardNumber)\n {\n var checkSum = creditCardNumber\n .Select(charToInt)\n .Reverse()\n .Select((digit, index) => isOddIndex(index) ? digit : doubleDigit(digit))\n .Sum();\n\n return checkSum % 10 == 0;\n }\n}\n","language":"C-sharp"},{"code":"using System;\nusing EuropaRTL.Utilities;\n\npublic static partial class Algoritmhs\n{\n public static bool CheckLuhn(long n)\n {\n int s1 = n.Shatter(true).Subset(2).Arithmetic('+');\n int s2 = n.Shatter(true).Subset(1, -1, 2).ArithmeticRA('*', 2).ShatterAndSum().Arithmetic('+');\n return (s1 + s2) % 10 == 0 ? true : false;\n }\n}\nclass Program\n{\n static void Main(string[] args)\n {\n long[] ll = {\n 49927398716,\n 49927398717,\n 1234567812345678,\n 1234567812345670\n };\n foreach (var item in ll)\n {\n item.ToString().WriteLine();\n Algoritmhs.CheckLuhn(item).ToString().WriteLine();\n }\n Console.ReadKey();\n }\n}\n","language":"C-sharp"},{"code":"shared void run() {\n\tvalue numbers = \"49927398716\n\t 49927398717\n\t 1234567812345678\n\t 1234567812345670\";\n\tfor(number in numbers.lines) {\n\t\tprint(\"``number`` passes? ``luhn(number)``\");\n\t}\n}\n\nshared Boolean luhn(String number) {\n\tvalue digits = number\n\t\t\t.reversed\n\t\t\t.map(Character.string)\n\t\t\t.map(Integer.parse)\n\t\t\t.narrow<Integer>();\n\tvalue s1 = sum { 0, *digits.by(2) };\n\tvalue s2 = sum {\n\t\t0,\n\t\t*digits\n\t\t\t.skip(1)\n\t\t\t.by(2)\n\t\t\t.map(curry(times<Integer>)(2))\n\t\t\t.map((Integer element) => element / 10 + element % 10)\n\t};\n\treturn (s1 + s2) % 10 == 0;\n}\n","language":"Ceylon"},{"code":"100 cls\n110 rem Luhn test\n120 dim card$(5)\n130 card$(1) = \"49927398716\"\n140 card$(2) = \"49927398717\"\n150 card$(3) = \"1234567812345678\"\n160 card$(4) = \"1234567812345670\"\n170 for test = 1 to 4\n180 odd = true\n190 sum = 0\n200 for n = len(card$(test)) to 1 step -1\n210 num = val(mid$(card$(test),n,1))\n220 if odd then\n230 sum = sum+num\n240 odd = false\n250 else\n260 num = num*2\n270 if num <= 9 then\n280 sum = sum+num\n290 else\n300 sum = sum+val(left$(str$(num),1))+val(right$(str$(num),1))\n310 endif\n320 odd = true\n330 endif\n340 next\n350 if sum mod 10 = 0 then\n360 print card$(test),\"True\"\n370 else\n380 print card$(test),\"False\"\n390 endif\n400 next test\n","language":"Chipmunk-Basic"},{"code":"(defn luhn? [cc]\n (let [factors (cycle [1 2])\n numbers (map #(Character/digit % 10) cc)\n sum (reduce + (map #(+ (quot % 10) (mod % 10))\n (map * (reverse numbers) factors)))]\n (zero? (mod sum 10))))\n\n(doseq [n [\"49927398716\" \"49927398717\" \"1234567812345678\" \"1234567812345670\"]]\n (println (luhn? n)))\n","language":"Clojure"},{"code":"luhn = proc (num: string) returns (bool) signals (bad_format)\n total: int := 0\n even: bool := true\n for i: int in int$from_to_by(string$size(num), 1, -1) do\n digit: int := int$parse(string$c2s(num[i])) resignal bad_format\n even := ~even\n if even then\n digit := 2 * digit\n if digit >= 10 then digit := digit//10 + 1 end\n end\n total := total + digit\n end\n return(total // 10 = 0)\nend luhn\n\nstart_up = proc ()\n po: stream := stream$primary_output()\n tests: sequence[string] := sequence[string]$\n [\"49927398716\", \"49927398717\", \"1234567812345678\", \"1234567812345670\"]\n for test: string in sequence[string]$elements(tests) do\n stream$puts(po, test || \": \")\n if luhn(test)\n then stream$putl(po, \"pass\")\n else stream$putl(po, \"fail\")\n end\n end\nend start_up\n","language":"CLU"},{"code":" IDENTIFICATION DIVISION.\n PROGRAM-ID. LUHNTEST.\n ENVIRONMENT DIVISION.\n INPUT-OUTPUT SECTION.\n data division.\n WORKING-STORAGE SECTION.\n 01 inp-card.\n 03 inp-card-ch pic x(01) occurs 20 times.\n 01 ws-result pic 9(01).\n 88 pass-luhn-test value 0.\n\n PROCEDURE DIVISION.\n move \"49927398716\" to inp-card\n perform test-card\n move \"49927398717\" to inp-card\n perform test-card\n move \"1234567812345678\" to inp-card\n perform test-card\n move \"1234567812345670\" to inp-card\n perform test-card\n stop run\n .\n test-card.\n call \"LUHN\" using inp-card, ws-result\n if pass-luhn-test\n display \"input=\" inp-card \"pass\"\n else\n display \"input=\" inp-card \"fail\"\n .\n\n END PROGRAM LUHNTEST.\n IDENTIFICATION DIVISION.\n PROGRAM-ID. LUHN.\n ENVIRONMENT DIVISION.\n INPUT-OUTPUT SECTION.\n DATA DIVISION.\n WORKING-STORAGE SECTION.\n 01 maxlen pic 9(02) comp value 16.\n 01 inplen pic 9(02) comp value 0.\n 01 i pic 9(02) comp value 0.\n 01 j pic 9(02) comp value 0.\n 01 l pic 9(02) comp value 0.\n 01 dw pic 9(02) comp value 0.\n 01 ws-total pic 9(03) comp value 0.\n 01 ws-prod pic 99.\n 01 filler redefines ws-prod.\n 03 ws-prod-tens pic 9.\n 03 ws-prod-units pic 9.\n 01 ws-card.\n 03 filler occurs 16 times depending on maxlen.\n 05 ws-card-ch pic x(01).\n 05 ws-card-digit redefines ws-card-ch pic 9(01).\n LINKAGE SECTION.\n 01 inp-card.\n 03 inp-card-ch pic x(01) occurs 20 times.\n 01 ws-result pic 9(01).\n 88 pass-luhn-test value 0.\n\n PROCEDURE DIVISION using inp-card, ws-result.\n perform varying i from 1 by +1\n until i > maxlen\n or inp-card-ch (i) = space\n end-perform\n compute l = i - 1\n compute inplen = l\n perform varying j from 1 by +1\n until j > inplen\n if l < 1\n move \"0\" to ws-card-ch (j)\n else\n move inp-card-ch (l) to ws-card-ch (j)\n compute l = l - 1\n end-if\n end-perform\n move 0 to ws-total\n perform varying i from 1 by +1\n until i > inplen\n compute dw = 2 - (i - 2 * function integer (i / 2))\n compute ws-prod = ws-card-digit (i) * dw\n compute ws-total = ws-total\n + ws-prod-tens\n + ws-prod-units\n end-perform\n compute ws-result = ws-total - 10 * function integer (ws-total / 10)\n goback\n .\n END PROGRAM LUHN.\n","language":"COBOL"},{"code":"0010 FUNC luhn(s$) CLOSED\n0020 total#:=0\n0030 even#:=TRUE\n0040 FOR i#:=LEN(s$) TO 1 STEP -1 DO\n0050 digit#:=VAL(s$(i#))\n0060 even#:=NOT even#\n0070 IF even# THEN digit#:=(2*digit#) DIV 10+(2*digit#) MOD 10\n0080 total#:+digit#\n0090 ENDFOR i#\n0100 RETURN total# MOD 10=0\n0110 ENDFUNC luhn\n0120 //\n0130 PROC test(s$)\n0140 PRINT s$,\": \",\n0150 IF luhn(s$) THEN\n0160 PRINT \"pass\"\n0170 ELSE\n0180 PRINT \"fail\"\n0190 ENDIF\n0200 ENDPROC test\n0210 //\n0220 test(\"49927398716\")\n0230 test(\"49927398717\")\n0240 test(\"1234567812345678\")\n0250 test(\"1234567812345670\")\n0260 END\n","language":"Comal"},{"code":"(defun luhn (n)\n (labels ((sum-digits (n) (if (> n 9) (- n 9) n)))\n (let ((n* (reverse n)) (l (length n)))\n (let ((s1 (loop for i from 0 below l by 2\n\t\t summing (digit-char-p (aref n* i))))\n\t (s2 (loop for i from 1 below l by 2\n\t\t summing (sum-digits (* 2 (digit-char-p (aref n* i)))))))\n\t(zerop (mod (+ s1 s2) 10))))))\n","language":"Common-Lisp"},{"code":"(require :curly)\n(use-package :curly)\n(enable-curly-syntax)\n\n(defun luhn (seq)\n (labels ((sum-digits (n) (if (> n 9) (- n 9) n)))\n (funcall {zerop (mod * 10) (apply #'+) (mapcar #'sum-digits)\n\t (mapcar #'* '#1=(1 2 . #1#)) (map 'list #'digit-char-p) reverse} seq)))\n","language":"Common-Lisp"},{"code":"include \"cowgol.coh\";\n\n# Given a string containing the digits of a credit card number,\n# see if it passes the Luhn test.\nsub luhn(card: [uint8]): (ok: uint8) is\n # Scan ahead to last digit, counting digits\n var n: uint8 := 0;\n while [card] != 0 loop\n n := n + 1;\n card := @next card;\n end loop;\n\n var sum: uint8 := 0;\n while n > 0 loop\n # odd digit is simply added\n card := @prev card;\n n := n - 1;\n sum := sum + ([card] - '0');\n\n # if uneven amount of digits, stop\n if n == 0 then break; end if;\n\n # even digit\n card := @prev card;\n n := n - 1;\n var digit := [card] - '0';\n\n # it is good to avoid unnecessary multiplication/\n # division, since 8-bit processors and microcontrollers\n # don't tend to have that in hardware\n if digit < 5 then\n sum := sum + digit + digit;\n else\n digit := digit - 5;\n sum := sum + digit + digit + 1;\n end if;\n end loop;\n\n # there is no boolean type, comparisons only work\n # in conditionals; this is the only way to return\n # a status\n if sum % 10 == 0 then\n ok := 1;\n else\n ok := 0;\n end if;\nend sub;\n\n\n# Test and print\nsub test(card: [uint8]) is\n var msg: [uint8][] := {\"Fail\", \"Pass\"};\n print(card);\n print(\": \");\n print(msg[luhn(card)]);\n print_nl();\nend sub;\n\ntest(\"49927398716\");\ntest(\"49927398717\");\ntest(\"1234567812345678\");\ntest(\"1234567812345670\");\n","language":"Cowgol"},{"code":"def luhn_valid?(n) # Card values can be numbers or strings\n d2sum = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\n sum, n = 0, n.to_u64\n while n > 0; sum += n%10; n //= 10; sum += d2sum[n%10]; n //= 10 end\n sum % 10 == 0\nend\n\ncards = [49927398716, \"49927398717\", 1234567812345678, \"1234567812345670\"]\ncards.each{ |i| puts \"#{i}: #{luhn_valid?(i)}\" }\n","language":"Crystal"},{"code":"import std.algorithm, std.range, std.string;\n\nenum luhnTest = (in string n) pure /*nothrow*/ @safe /*@nogc*/ =>\n retro(n)\n .zip(only(1, 2).cycle)\n .map!(p => (p[0] - '0') * p[1])\n .map!(d => d / 10 + d % 10)\n .sum % 10 == 0;\n\nvoid main() {\n assert(\"49927398716 49927398717 1234567812345678 1234567812345670\"\n .split.map!luhnTest.equal([true, false, false, true]));\n}\n","language":"D"},{"code":"import std.algorithm;\n\nbool luhnTest(in string num) @safe pure nothrow @nogc {\n uint sum;\n foreach_reverse (immutable i, immutable n; num) {\n immutable uint ord = n - '\\u0030';\n sum += ((num.length - i) & 1) ? ord : ord / 5 + (2 * ord) % 10;\n }\n return sum % 10 == 0;\n}\n\nvoid main() {\n immutable data = [\"49927398716\",\n \"49927398717\",\n \"1234567812345678\",\n \"1234567812345670\"];\n assert(data.map!luhnTest.equal([true, false, false, true]));\n}\n","language":"D"},{"code":"import std.stdio;\n\nstruct Interval(T) {\n immutable T a, b;\n\n this(in T a_, in T b_) pure nothrow @nogc {\n this.a = a_;\n this.b = b_;\n }\n\n bool opBinaryRight(string op=\"in\")(in T x)\n const pure nothrow @nogc {\n return x >= a && x <= b;\n }\n\n pure nothrow @safe @nogc const invariant {\n assert(a <= b);\n }\n}\n\nInterval!T interval(T)(in T a, in T b) pure nothrow @nogc {\n return Interval!T(a, b);\n}\n\n\nbool luhnTest(in string num) pure nothrow @nogc\nin {\n assert(num.length <= 20);\n} body {\n int sum = 0;\n bool od = true;\n bool ok = true;\n immutable int numLen = num.length;\n\n foreach_reverse (immutable p; 0 .. numLen) {\n immutable int i = num[p] - '0';\n if (i !in interval(0, 9)) {\n ok = false;\n break;\n }\n\n immutable int x = ((i * 2) % 10) + (i / 5);\n assert((numLen - p) in interval(0, 19));\n assert(sum in interval(0, (numLen - p) * 10));\n assert(i in interval(0, 9));\n assert(x in interval(0, 9));\n sum += od ? i : x;\n od = !od;\n }\n\n return ok && (sum % 10) == 0;\n}\n\n\nvoid main() {\n foreach (immutable n; [\"49927398716\", \"49927398717\",\n \"1234567812345678\", \"1234567812345670\",\n \"123456781234567D\"])\n writefln(\"%s is %svalid\", n, luhnTest(n) ? \"\" : \"not \");\n}\n","language":"D"},{"code":"{Test data arrays}\n\nconst Num1: array [0..10] of byte = (4,9,9,2,7,3,9,8,7,1,6);\nconst Num2: array [0..10] of byte = (4,9,9,2,7,3,9,8,7,1,7);\nconst Num3: array [0..15] of byte = (1,2,3,4,5,6,7,8,1,2,3,4,5,6,7,8);\nconst Num4: array [0..15] of byte = (1,2,3,4,5,6,7,8,1,2,3,4,5,6,7,0);\n\n{Simplifies cases where we have to sum a two digit number}\n\nconst DigitSum: array [0..18] of byte = (0,1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9);\n\nfunction ValidateCreditCard(CardNum: array of byte): boolean;\n{Validate a Credit Card number}\nvar I,J,Len,Sum,Sum1,Sum2: integer;\nvar Rev: array of byte;\nbegin\nSum1:=0; Sum2:=0;\nLen:=High(CardNum);\nfor I:=Len downto 0 do\n if ((I-Len) and 1)=0 then Sum1:=Sum1 + CardNum[I]\n else Sum2:=Sum2 + DigitSum[CardNum[I]*2];\nSum:=Sum1+Sum2;\nResult:=(Sum mod 10)=0;\nend;\n\n\nfunction CardNumberToStr(CardNum: array of byte): string;\n{Convert card number to a string}\nvar I: integer;\nbegin\nResult:='';\nfor I:=0 to High(CardNum) do\nResult:=Result+IntToStr(CardNum[I]);\nend;\n\n\nprocedure TestDisplayNumber(Memo: TMemo; Num: array of byte);\n{Test a credit card number and display results}\nvar S: string;\nbegin\nS:=CardNumberToStr(Num);\nif ValidateCreditCard(Num) then S:=S+': Valid'\nelse S:=S+': Not Valid';\nMemo.Lines.Add(S);\nend;\n\n\nprocedure TestCreditCardNums(Memo: TMemo);\n{Test all credit card numbers}\nbegin\nTestDisplayNumber(Memo,Num1);\nTestDisplayNumber(Memo,Num2);\nTestDisplayNumber(Memo,Num3);\nTestDisplayNumber(Memo,Num4);\nend;\n","language":"Delphi"},{"code":"proc nonrec luhn(*char num) bool:\n [10] byte map = (0, 2, 4, 6, 8, 1, 3, 5, 7, 9);\n byte total, digit;\n *char start;\n bool even;\n\n start := num;\n total := 0;\n even := true;\n while num* /= '\\e' do num := num + 1 od;\n while\n num := num - 1;\n num >= start\n do\n digit := num* - '0';\n even := not even;\n if even then digit := map[digit] fi;\n total := total + digit\n od;\n\n total % 10 = 0\ncorp\n\nproc nonrec test(*char num) void:\n writeln(num, \": \", if luhn(num) then \"pass\" else \"fail\" fi)\ncorp\n\nproc nonrec main() void:\n test(\"49927398716\");\n test(\"49927398717\");\n test(\"1234567812345678\");\n test(\"1234567812345670\")\ncorp\n","language":"Draco"},{"code":"func luhn cc$ .\n for i = len cc$ downto 1\n odd = 1 - odd\n dig = number substr cc$ i 1\n if odd = 0\n dig = 2 * dig\n if dig >= 10\n dig -= 9\n .\n .\n sum += dig\n .\n return if sum mod 10 = 0\n.\ncc$[] = [ \"49927398716\" \"49927398717\" \"1234567812345678\" \"1234567812345670\" ]\nfor cc$ in cc$[]\n write cc$ & \" \"\n if luhn cc$ = 1\n print \"is valid\"\n else\n print \"is not valid\"\n .\n.\n","language":"EasyLang"},{"code":";; value for 'even' numbers\n(define (even-val n) (if (> n 4) (+ n n -9) (+ n n)))\n\n;;Luhn test\n;; input : a string of decimal digits\n;; output #t or #f\n(define (valid nums (odd #f ))\n (let ((nums (map string->number (reverse (string->list nums)))))\n (= 0 (modulo\n (for/sum ((n nums)) (set! odd (not odd)) (if odd n (even-val n)))\n 10))))\n\n(valid \"49927398716\") → #t\n(valid \"1234567812345670\") → #t\n(valid \"1234567812345678\") → #f\n(valid \"49927398717\") → #f\n","language":"EchoLisp"},{"code":"defmodule Luhn do\n def valid?(cc) when is_binary(cc), do: String.to_integer(cc) |> valid?\n def valid?(cc) when is_integer(cc) do\n 0 == Integer.digits(cc)\n |> Enum.reverse\n |> Enum.chunk(2, 2, [0])\n |> Enum.reduce(0, fn([odd, even], sum) -> Enum.sum([sum, odd | Integer.digits(even*2)]) end)\n |> rem(10)\n end\nend\n\nnumbers = ~w(49927398716 49927398717 1234567812345678 1234567812345670)\nfor n <- numbers, do: IO.puts \"#{n}: #{Luhn.valid?(n)}\"\n","language":"Elixir"},{"code":"(require 'seq)\n\n(defun luhn (str)\n \"Check if STR is a valid credit card number using the Luhn algorithm.\"\n (if (string-match-p \"[^0-9]\" str)\n (error \"String contains invalid character\")\n (let ((digit-list (reverse (mapcar #'(lambda (x) (- x 48))\n (string-to-list str)))))\n (zerop\n (mod (apply #'+ (seq-map-indexed\n (lambda (elt idx)\n (if (not (zerop (% idx 2)))\n (if (> (* 2 elt) 9)\n (- (* 2 elt) 9)\n (* 2 elt))\n elt))\n digit-list))\n 10)))))\n\n(mapcar #'luhn '(\"49927398716\" \"49927398717\" \"1234567812345678\" \"1234567812345670\"))\n","language":"Emacs-Lisp"},{"code":"-module(luhn_test).\n\n-export( [credit_card/1, task/0] ).\n\nluhn_sum([Odd, Even |Rest]) when Even >= 5 ->\n Odd + 2 * Even - 10 + 1 + luhn_sum(Rest);\nluhn_sum([Odd, Even |Rest]) ->\n Odd + 2 * Even + luhn_sum(Rest);\nluhn_sum([Odd]) ->\n Odd;\nluhn_sum([]) ->\n 0.\n\ncheck( Sum ) when (Sum rem 10) =:= 0 -> valid;\ncheck( _Sum ) -> invalid.\n\ncredit_card(Digits) ->\n check(luhn_sum(lists:map(fun(D) -> D-$0 end, lists:reverse(Digits)))).\n\ntask() ->\n Numbers = [\"49927398716\", \"49927398717\", \"1234567812345678\", \"1234567812345670\"],\n [io:fwrite(\"~s: ~p~n\", [X, credit_card(X)]) || X <- Numbers].\n","language":"Erlang"},{"code":"function luhn(sequence cc)\n integer isOdd, oddSum, evenSum, digit\n isOdd = 1\n oddSum = 0\n evenSum = 0\n for i = length(cc) to 1 by -1 do\n digit = cc[i] - '0'\n if isOdd then\n oddSum += digit\n else\n evenSum += floor(digit / 5) + remainder(2 * digit, 10)\n end if\n isOdd = not isOdd\n end for\n return not remainder(oddSum + evenSum, 10)\nend function\n\nconstant cc_numbers = {\n \"49927398716\",\n \"49927398717\",\n \"1234567812345678\",\n \"1234567812345670\"\n}\n\nfor i = 1 to length(cc_numbers) do\n printf(1,\"%s = %d\\n\", {cc_numbers[i], luhn(cc_numbers[i])})\nend for\n","language":"Euphoria"},{"code":"luhnChecked\n=LAMBDA(s,\n LET(\n ns, REVERSECOLS(VALUE(CHARSROW(s))),\n ixs, SEQUENCE(1, COLUMNS(ns), 1, 1),\n\n 0 = MOD(SUM(\n FILTER(ns, 0 <> MOD(ixs, 2))\n ) + (\n LAMBDA(n,\n DIGITSUM(\n CONCAT(TEXT(2 * n, \"0\"))\n )\n )(\n FILTER(ns, 0 = MOD(ixs, 2))\n )\n ),\n 10\n )\n )\n)\n","language":"Excel"},{"code":"CHARSROW\n=LAMBDA(s,\n MID(s,\n SEQUENCE(1, LEN(s), 1, 1),\n 1\n )\n)\n\n\nDIGITSUM\n=LAMBDA(s,\n SUM(VALUE(\n MID(s,\n SEQUENCE(LEN(s), 1, 1, 1),\n 1\n )\n ))\n)\n\n\nREVERSECOLS\n=LAMBDA(xs,\n LET(\n n, COLUMNS(xs),\n\n SORTBY(\n xs,\n SEQUENCE(1, n, n, -1)\n )\n )\n)\n","language":"Excel"},{"code":"let luhn (s:string) =\n let rec g r c = function\n | 0 -> r\n | i ->\n let d = ((int s.[i - 1]) - 48) <<< c\n g (r + if d < 10 then d else d - 9) (1 - c) (i - 1)\n (g 0 0 s.Length) % 10 = 0\n","language":"F-Sharp"},{"code":"USING: kernel math math.parser math.order math.ranges sequences ;\nIN: luhn\n\n: reversed-digits ( n -- list )\n { } swap\n [ dup 0 > ]\n [ 10 /mod swapd suffix swap ]\n while drop ;\n\n: luhn-digit ( n -- n )\n reversed-digits dup length <iota> [\n 2dup swap nth\n swap odd? [ 2 * 10 /mod + ] when\n ] map sum 10 mod\n nip ;\n\n: luhn? ( n -- ? )\n luhn-digit 0 = ;\n","language":"Factor"},{"code":": luhn ( addr len -- ? )\n 0 >r over + ( R: sum )\n begin 1- 2dup <=\n while \\ odd\n dup c@ [char] 0 -\n r> + >r\n 1- 2dup <=\n while \\ even\n dup c@ [char] 0 -\n 2* 10 /mod + \\ even digits doubled, split, and summed\n r> + >r\n repeat then\n 2drop r> 10 mod 0= ;\n\ns\" 49927398716\" luhn . \\ -1\ns\" 49927398717\" luhn . \\ 0\ns\" 1234567812345678\" luhn . \\ 0\ns\" 1234567812345670\" luhn . \\ -1\n","language":"Forth"},{"code":"program luhn\n implicit none\n integer :: nargs\n character(len=20) :: arg\n integer :: alen, i, dr\n integer, allocatable :: number(:)\n integer, parameter :: drmap(0:9) = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\n\n ! Get number\n nargs = command_argument_count()\n if (nargs /= 1) then\n stop\n end if\n call get_command_argument(1, arg, alen)\n allocate(number(alen))\n do i=1, alen\n number(alen-i+1) = iachar(arg(i:i)) - iachar('0')\n end do\n\n ! Calculate number\n dr = 0\n do i=1, alen\n dr = dr + merge(drmap(number(i)), number(i), mod(i,2) == 0)\n end do\n\n if (mod(dr,10) == 0) then\n write(*,'(a,i0)') arg(1:alen)//' is valid'\n else\n write(*,'(a,i0)') arg(1:alen)//' is not valid'\n end if\nend program luhn\n\n! Results:\n! 49927398716 is valid\n! 49927398717 is not valid\n! 1234567812345678 is not valid\n! 1234567812345670 is valid\n","language":"Fortran"},{"code":"program luhn;\n\n function lunh(arg: string): boolean;\n var\n i, sum: integer;\n temp: byte;\n begin\n sum := 0;\n for i:= length(arg) downto 1 do begin // Run the characters backwards\n temp := byte(arg[i])-48; // Convert from ASCII to byte\n if (length(arg)-i) mod 2 = 0\n then sum := sum + temp // Odd characters just add\n else if temp < 5\n then sum := sum + 2*temp // Even characters add double\n else sum := sum + (2*temp)-9; // or sum the digits of the doubling\n end;\n result := sum mod 10 = 0; // Return true if sum ends in a 0\n end;\n\nbegin\n writeln(' 49927398716: ', lunh('49927398716'));\n writeln(' 49927398717: ', lunh('49927398717'));\n writeln('1234567812345678: ', lunh('1234567812345678'));\n writeln('1234567812345670: ', lunh('1234567812345670'));\nend.\n","language":"Free-Pascal-Lazarus"},{"code":"' version 05-07-2015\n' compile with: fbc -s console\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 luhntest(cardnr As String) As Integer\n\n cardnr = Trim(cardnr) ' we don't want spaces\n Dim As String reverse_nr = cardnr\n Dim As Integer i, j, s1, s2, l = Len(cardnr) - 1\n\n ' reverse string\n For i = 0 To l\n reverse_nr[i] = cardnr[l - i]\n Next\n ' sum odd numbers\n For i = 0 To l Step 2\n s1 = s1 + (reverse_nr[i] - Asc(\"0\"))\n Next\n ' sum even numbers\n For i = 1 To l Step 2\n j = reverse_nr[i] - Asc(\"0\")\n j = j * 2\n If j > 9 Then j = j Mod 10 + 1\n s2 = s2 + j\n Next\n\n If (s1 + s2) Mod 10 = 0 Then\n Return TRUE\n Else\n Return FALSE\n End If\n\nEnd Function\n\n' ------=< MAIN >=------\n\nDim As String input_nr(1 To ...) = {\"49927398716\", \"49927398717\",_\n \"1234567812345678\", \"1234567812345670\"}\nDim As Integer a\n\nPrint \"Task test number 49927398716 should be TRUE, report back as \";\nPrint IIf(luhntest(\"49927398716\" ) = TRUE, \"TRUE\", \"FALSE\")\nPrint : Print\n\nPrint \"test card nr:\"\nFor a = 1 To UBound(input_nr)\n Print input_nr(a); \" = \"; IIf(luhntest(input_nr(a)) = TRUE, \"TRUE\", \"FALSE\")\nNext\n\n' empty keyboard buffer\nWhile InKey <> \"\" : Wend\nPrint : Print \"hit any key to end program\"\nSleep\nEnd\n","language":"FreeBASIC"},{"code":"def luhn_checksum( card_number ) =\n def digits_of( n ) = [int(d) | d <- n.toString()]\n\n digits = digits_of( card_number ).reverse()\n odd_digits = digits(0:digits.length():2)\n even_digits = digits(1:digits.length():2)\n (sum( odd_digits ) + sum( sum(digits_of(d*2)) | d <- even_digits )) mod 10\n\ndef is_luhn_valid( card_number ) = luhn_checksum( card_number ) == 0\n\nfor n <- [49927398716, 49927398717, 1234567812345678, 1234567812345670]\n println( n + ' is ' + (if is_luhn_valid(n) then 'valid' else 'invalid') )\n","language":"FunL"},{"code":"include \"NSLog.incl\"\n\nlocal fn LuhnCheck( cardStr as CFStringRef ) as BOOL\n NSInteger i, j, count, s1 = 0, s2 = 0\n BOOL result = NO\n\n // Build array of individual numbers in credit card string\n NSUInteger strLength = len(cardStr)\n CFMUtableArrayRef mutArr = fn MutableArrayWithCapacity(strLength)\n for i = 0 to strLength - 1\n CFStringRef tempStr = fn StringWithFormat( @\"%C\", fn StringCharacterAtIndex( cardStr, i ) )\n MutableArrayInsertObjectAtIndex( mutArr, tempStr, i )\n next\n\n // Reverse the number array\n CFArrayRef reversedArray = fn EnumeratorAllObjects( fn ArrayReverseObjectEnumerator( mutArr ) )\n\n // Get number of array elements\n count = len(reversedArray)\n\n // Handle odd numbers\n for i = 0 to count - 1 step 2\n s1 = s1 + fn StringIntegerValue( reversedArray[i] )\n next\n\n // Hnadle even numbers\n for i = 1 to count - 1 step 2\n j = fn StringIntegerValue( reversedArray[i] )\n j = j * 2\n if j > 9 then j = j mod 10 + 1\n s2 = s2 + j\n next\n\n if (s1 + s2) mod 10 = 0 then result = YES else result = NO\nend fn = result\n\nNSLogClear\nif fn LuhnCheck( @\"49927398716\" ) then NSLog (@\"%@ is valid.\", @\"49927398716\" ) else NSLog (@\"%@ is not valid.\", @\"49927398716\" )\nif fn LuhnCheck( @\"49927398717\" ) then NSLog (@\"%@ is valid.\", @\"49927398717\" ) else NSLog (@\"%@ is not valid.\", @\"49927398717\" )\nif fn LuhnCheck( @\"1234567812345678\" ) then NSLog (@\"%@ is valid.\", @\"1234567812345678\" ) else NSLog (@\"%@ is not valid.\", @\"1234567812345678\" )\nif fn LuhnCheck( @\"1234567812345670\" ) then NSLog (@\"%@ is valid.\", @\"1234567812345670\" ) else NSLog (@\"%@ is not valid.\", @\"1234567812345670\" )\n\nHandleEvents\n","language":"FutureBasic"},{"code":"Public Sub Main()\nDim sTrial As String[] = [\"49927398716\", \"49927398717\", \"1234567812345678\", \"1234567812345670\"]\nDim sRev As String\nDim siCount, siOdd, siEven, siHold, siQty As Short\n\nFor siQty = 0 To sTrial.Max\n\n siOdd = 0\n siEven = 0\n sRev = \"\"\n\n For siCount = Len(sTrial[siQty]) DownTo 1\n sRev &= Mid(sTrial[siQty], siCount, 1)\n Next\n\n For siCount = 1 To Len(sRev)\n If Odd(siCount) Then siOdd += Val(Mid(sRev, siCount, 1))\n If Even(siCount) Then\n siHold = Val(Mid(sRev, siCount, 1)) * 2\n If siHold > 9 Then\n siEven += Val(Mid(Str(siHold), 1, 1)) + Val(Mid(Str(siHold), 2, 1))\n Else\n siEven += Val(Mid(sRev, siCount, 1)) * 2\n End If\n End If\n Next\n\n sRev = Str(siOdd + siEven)\n If sRev Ends \"0\" Then\n Print sTrial[siQty] & \" is a valid number\"\n Else\n Print sTrial[siQty] & \" is NOT a valid number\"\n End If\nNext\n\nEnd\n","language":"Gambas"},{"code":"IsLuhn := function(n)\n\tlocal c, d, i, j, r;\n\td := \"0123456789\";\n\tj := 1;\n\tr := 0;\n\tfor c in Reversed(String(n)) do\n\t\ti := Position(d, c);\n\t\tif i = fail then\n\t\t\tcontinue;\n\t\tfi;\n\t\ti := j*(i - 1);\n\t\tr := r + QuoInt(i, 10) + RemInt(i, 10);\n\t\tj := 3 - j;\n\tod;\n\treturn RemInt(r, 10) = 0;\nend;\n\nList([49927398716, 49927398717, 1234567812345678, 1234567812345670], IsLuhn);\n# [ true, false, false, true ]\n\n# Will also work on strings, and will skip non-digits\nIsLuhn(\"4-992-739-871-6\");\n# true\n","language":"GAP"},{"code":"package main\n\nimport (\n \"fmt\"\n \"strings\"\n)\n\nconst input = `49927398716\n49927398717\n1234567812345678\n1234567812345670`\n\nvar t = [...]int{0, 2, 4, 6, 8, 1, 3, 5, 7, 9}\n\nfunc luhn(s string) bool {\n odd := len(s) & 1\n var sum int\n for i, c := range s {\n if c < '0' || c > '9' {\n return false\n }\n if i&1 == odd {\n sum += t[c-'0']\n } else {\n sum += int(c - '0')\n }\n }\n return sum%10 == 0\n}\n\nfunc main() {\n for _, s := range strings.Split(input, \"\\n\") {\n fmt.Println(s, luhn(s))\n }\n}\n","language":"Go"},{"code":"def checkLuhn(number) {\n int total\n (number as String).reverse().eachWithIndex { ch, index ->\n def digit = Integer.parseInt(ch)\n total += (index % 2 ==0) ? digit : [0, 2, 4, 6, 8, 1, 3, 5, 7, 9][digit]\n }\n total % 10 == 0\n}\n","language":"Groovy"},{"code":"def verifyLuhn(number, expected) {\n println \"Checking: $number (${checkLuhn(number)})\"\n assert expected == checkLuhn(number)\n}\n\n[49927398716: true, 49927398717: false, 1234567812345678: false, 1234567812345670: true].each { number, expected ->\n verifyLuhn number, expected\n}\n","language":"Groovy"},{"code":"import Data.Char (digitToInt)\nluhn = (0 ==) . (`mod` 10) . sum . map (uncurry (+) . (`divMod` 10)) .\n zipWith (*) (cycle [1,2]) . map digitToInt . reverse\n","language":"Haskell"},{"code":"map luhn [\"49927398716\", \"49927398717\", \"1234567812345678\", \"1234567812345670\"]\n[True,False,False,True]\n","language":"Haskell"},{"code":"import Data.Char (digitToInt)\nimport Data.List (transpose)\nimport Data.List.Split (chunksOf)\n\nluhn :: String -> Bool\nluhn x = 0 == rem (s1 + s2) 10\n where\n stringInts = fmap digitToInt\n [odds, evens] =\n (transpose . chunksOf 2)\n (stringInts $ reverse x)\n s1 = sum odds\n s2 = sum $ sum . stringInts . show . (2 *) <$> evens\n\nmain :: IO ()\nmain =\n mapM_\n (print . ((,) <*> luhn))\n [ \"49927398716\",\n \"49927398717\",\n \"1234567812345678\",\n \"1234567812345670\"\n ]\n","language":"Haskell"},{"code":"CHARACTER numbers=\"49927398716 49927398717 1234567812345678 1234567812345670 \"\n\nDO nr = 1, 4\n EDIT(Text=numbers, ITeM=nr, Parse=number)\n sum_odds = 0\n sum_even = 0\n DO i = LEN(number), 1, -2\n sum_odds = sum_odds + ICHAR(number(i)) - 48\n IF(i > 1) THEN\n even2 = 2 * (ICHAR(number(i-1)) - 48)\n sum_even = sum_even + MOD(even2, 10) + INT(even2/10)\n ENDIF\n ENDDO\n valid = (0 == MOD(sum_odds + sum_even, 10))\n WRITE() number, \" is \", \"invalid\"(1 + 2*valid:)\nENDDO\n","language":"HicEst"},{"code":"procedure main(aL)\nevery write(i := !aL ,\" - \", ((\\isluhn10(i),\"valid\")|\"invalid\") \\ 1)\nend\n\nprocedure isluhn10(i) #: isluhn10(i) returns i (if i passes luhn10) or fails\nlocal sum\n\nsum :=0\nreverse(integer(i)) ? while not pos(0) do {\n sum +:= move(1)\n sum +:= map(move(1),\"0123456789\",\"0246813579\")\n }\n\nreturn (sum % 10 = 0,i)\nend\n","language":"Icon"},{"code":"100 PROGRAM \"CredCard.bas\"\n110 DO\n120 PRINT :PRINT \"Credit card number:\":INPUT PROMPT \">\":CCN$\n130 IF CCN$=\"\" THEN EXIT DO\n140 IF LUHN(TRIM$(CCN$)) THEN\n150 PRINT \"Card number is valid.\"\n160 ELSE\n170 SET #102:INK 3:PRINT \"Card number is invalid.\":SET #102:INK 1\n180 END IF\n190 LOOP\n200 DEF LUHN(CCN$)\n210 LET L=LEN(CCN$):LET S=0\n220 FOR I=1 TO L\n230 LET N=VAL(CCN$(L-I+1))\n240 IF I BAND 1 THEN\n250 LET S=S+N\n260 ELSE\n270 LET N=N*2:LET S=S+MOD(N,10)+INT(N/10)\n280 END IF\n290 NEXT\n300 LET LUHN=MOD(S,10)=0\n310 END DEF\n320 DEF TRIM$(S$)\n330 LET T$=\"\"\n340 FOR I=1 TO LEN(S$)\n350 IF S$(I)>CHR$(47) AND S$(I)<CHR$(58) THEN LET T$=T$&S$(I)\n360 NEXT\n370 LET TRIM$=T$\n380 END DEF\n","language":"IS-BASIC"},{"code":"luhn=: 0 = 10 (| +/@,) 10 #.inv 1 2 *&|: _2 \".\"0\\ |.\n","language":"J"},{"code":" luhn&> '49927398716';'49927398717';'1234567812345678';'1234567812345670'\n1 0 0 1\n","language":"J"},{"code":"public class Luhn {\n public static void main(String[] args) {\n System.out.println(luhnTest(\"49927398716\"));\n System.out.println(luhnTest(\"49927398717\"));\n System.out.println(luhnTest(\"1234567812345678\"));\n System.out.println(luhnTest(\"1234567812345670\"));\n }\n\n public static boolean luhnTest(String number){\n int s1 = 0, s2 = 0;\n String reverse = new StringBuffer(number).reverse().toString();\n for(int i = 0 ;i < reverse.length();i++){\n int digit = Character.digit(reverse.charAt(i), 10);\n if(i % 2 == 0){//this is for odd digits, they are 1-indexed in the algorithm\n s1 += digit;\n }else{//add 2 * digit for 0-4, add 2 * digit - 9 for 5-9\n s2 += 2 * digit;\n if(digit >= 5){\n s2 -= 9;\n }\n }\n }\n return (s1 + s2) % 10 == 0;\n }\n}\n","language":"Java"},{"code":"mod10check = function(cc) {\n return $A(cc).reverse().map(Number).inject(0, function(s, d, i) {\n return s + (i % 2 == 1 ? (d == 9 ? 9 : (d * 2) % 9) : d);\n }) % 10 == 0;\n};\n['49927398716','49927398717','1234567812345678','1234567812345670'].each(function(i){alert(mod10check(i))});\n","language":"JavaScript"},{"code":"var LuhnCheck = (function()\n{\n\tvar luhnArr = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9];\n\treturn function(str)\n\t{\n\t\tvar counter = 0;\n\t\tvar incNum;\n\t\tvar odd = false;\n\t\tvar temp = String(str).replace(/[^\\d]/g, \"\");\n\t\tif ( temp.length == 0)\n\t\t\treturn false;\n\t\tfor (var i = temp.length-1; i >= 0; --i)\n\t\t{\n\t\t\tincNum = parseInt(temp.charAt(i), 10);\n\t\t\tcounter += (odd = !odd)? incNum : luhnArr[incNum];\n\t\t}\n\t\treturn (counter%10 == 0);\n\t}\n})();\n","language":"JavaScript"},{"code":"var luhn10 = function(a,b,c,d,e) {\n for(d = +a[b = a.length-1], e=0; b--;)\n c = +a[b], d += ++e % 2 ? 2 * c % 10 + (c > 4) : c;\n return !(d%10)\n};\n\n// returns true\nluhn10('4111111111111111')\n\n// returns false\nluhn10('4111111111111112')\n","language":"JavaScript"},{"code":"const lunhCheck = (str) => {\n const sumDigit = (c) => (c < 10) ? c :\n sumDigit( Math.trunc(c / 10) + (c % 10));\n\n return str.split('').reverse()\n .map(Number)\n .map((c, i) => i % 2 !== 0 ? sumDigit(c * 2) : c)\n .reduce((acc,v) => acc + v) % 10 === 0;\n};\n\nlunhCheck('49927398716'); // returns true\nlunhCheck('49927398717'); // returns false\nlunhCheck('1234567812345678'); // returns false\nlunhCheck('1234567812345670'); // returns true\n","language":"JavaScript"},{"code":"def luhn:\n def odds: . as $in | reduce range(0; length) as $i\n ([]; if ($i % 2) == 0 then . + [$in[$i]] else . end);\n def evens: . as $in | reduce range(1; length) as $i\n ([]; if ($i % 2) == 1 then . + [$in[$i]] else . end);\n def digits: map([.]|implode|tonumber);\n def sumdigits: tostring | explode | digits | add;\n\n (tostring | explode | reverse ) as $reverse\n | ($reverse | odds | digits | add) as $s1\n | ($reverse | evens | digits | map(. * 2 | sumdigits) | add) as $s2\n | 0 == ($s1 + $s2) % 10 ;\n","language":"Jq"},{"code":" ( 49927398716,\n 49927398717,\n 1234567812345678,\n 1234567812345670\n ) | \"\\(.) => \\(luhn)\";\n","language":"Jq"},{"code":"luhntest(x::Integer) = (sum(digits(x)[1:2:end]) + sum(map(x -> sum(digits(x)), 2 * digits(x)[2:2:end]))) % 10 == 0\n","language":"Julia"},{"code":"function luhntest(x::Integer)\n d = reverse(digits(x))\n s = sum(d[1:2:end])\n s += sum(sum.(digits.(2d[2:2:end])))\n return s % 10 == 0\nend\n\nfor card in [49927398716, 49927398717, 1234567812345678, 1234567812345670]\n println(luhntest(card) ? \"PASS \" : \"FAIL \", card)\nend\n","language":"Julia"},{"code":"so: {+/x@2*!_ceil(#x)%2}\nse: {+/{+/0$'$x}'2*x@1+2*!(#x)%2}\nluhn: {n:|0$'$x; 0=((se n)+so n)!10}\n","language":"K"},{"code":"luhn2: {~(+/,//10_vs'1 2*+-1 2#((#n)!2){x,0}/n:0$'|$x)\n","language":"K"},{"code":" luhn'49927398716 49927398717 1234567812345678 1234567812345670\n1 0 0 1\n luhn2'49927398716 49927398717 1234567812345678 1234567812345670\n1 0 0 1\n","language":"K"},{"code":"luhn:{[cc]\n digits:0$/:|cc / convert chars to digit ints\n s:digits*(#cc)#1 2 / evens doubled, odds not\n nines:+/s>9 / number of sums greater than 9\n :~((+/s)-(9*nines))!10 / sum minus the nines is mod ten?\n }\n","language":"K"},{"code":" test:(\"49927398716\";\"49927398717\";\"1234567812345678\";\"1234567812345670\")\n luhn'test\n1 0 0 1\n","language":"K"},{"code":"// version 1.0\n\nfun checkLuhn(number: String): Boolean {\n var isOdd = true\n var sum = 0\n\n for (index in number.indices.reversed()) {\n val digit = number[index] - '0'\n sum += if (isOdd) digit else (digit * 2).let { (it / 10) + (it % 10) }\n isOdd = !isOdd\n }\n\n return (sum % 10) == 0\n}\n\nfun main(args: Array<String>) {\n val numbers = arrayOf(\"49927398716\", \"49927398717\", \"1234567812345678\", \"1234567812345670\")\n for (number in numbers)\n println(\"${number.padEnd(16)} is ${if(checkLuhn(number)) \"valid\" else \"invalid\"}\")\n}\n","language":"Kotlin"},{"code":"val .luhntest = fn(.s) {\n val .t = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\n val .numbers = s2n .s\n val .oddeven = len(.numbers) rem 2\n\n for[=0] .i of .numbers {\n _for += if(.i rem 2 == .oddeven: .numbers[.i]; .t[.numbers[.i]+1])\n } div 10\n}\n\nval .tests = h{\n \"49927398716\": true,\n \"49927398717\": false,\n \"1234567812345678\": false,\n \"1234567812345670\": true,\n}\n\nfor .key of .tests {\n val .pass = .luhntest(.key)\n write .key, \": \", .pass\n writeln if(.pass == .tests[.key]: \"\"; \" (LUHN TEST FAILED)\")\n}\n","language":"Langur"},{"code":"#!/usr/bin/lasso9\n\ndefine luhn_check(number) => {\n local(\n rev = #number->asString,\n checksum = 0\n )\n #rev->reverse\n iterate(#rev, local(digit)) => {\n if((loop_count % 2) == 0) => {\n #checksum += (2 * integer(#digit))\n integer(#digit) >= 5 ? #checksum -= 9\n else\n #checksum += integer(#digit)\n }\n }\n (#checksum % 10) != 0 ? return false\n return true\n}\n\nstdoutnl(luhn_check(49927398716)) // true\nstdoutnl(luhn_check(49927398717)) // false\nstdoutnl(luhn_check(1234567812345678)) // false\nstdoutnl(luhn_check(1234567812345670)) // true\n","language":"Lasso"},{"code":"' [RC] Luhn test\n\ncard$(1)=\"49927398716\"\ncard$(2)=\"49927398717\"\ncard$(3)=\"1234567812345678\"\ncard$(4)=\"1234567812345670\"\n\nfor test = 1 to 4\n odd=1\n sum = 0\n for n = len(card$(test)) to 1 step -1\n num=val(mid$(card$(test),n,1))\n if odd then\n sum = sum + num\n odd=0\n else\n num=num*2\n if num<=9 then\n sum = sum + num\n else\n sum = sum + val(left$(str$(num),1)) + val(right$(str$(num),1))\n end if\n odd=1\n end if\n next\n if sum mod 10 = 0 then\n print card$(test),\"True\"\n else\n print card$(test),\"False\"\n end if\nnext\n","language":"Liberty-BASIC"},{"code":"function LuhnTest cc\n local s1,evens, s2\n repeat with n = 1 to len(cc)\n if n mod 2 is not 0 then\n add (char -n of cc) to s1\n else\n put (char -n of cc) * 2 into evens\n if evens > 9 then subtract 9 from evens\n add evens to s2\n end if\n end repeat\n return the last char of (s1 + s2) is 0\nend LuhnTest\n\n-- test\nrepeat for each item ccno in \"49927398716,49927398717,1234567812345678,1234567812345670\"\n put ccno && LuhnTest(ccno) & cr after luhncheck\nend repeat\nput luhncheck\n\n49927398716 true\n49927398717 false\n1234567812345678 false\n1234567812345670 true\n","language":"LiveCode"},{"code":"to small? :list\n output or [empty? :list] [empty? bf :list]\nend\nto every.other :list\n if small? :list [output :list]\n output fput first :list every.other bf bf :list\nend\nto wordtolist :word\n output map.se [?] :word\nend\n\nto double.digit :digit\n output item :digit {0 2 4 6 8 1 3 5 7 9}@0\n ; output ifelse :digit < 5 [2*:digit] [1 + modulo 2*:digit 10]\nend\n\nto luhn :credit\n localmake \"digits reverse filter [number? ?] wordtolist :credit\n localmake \"s1 apply \"sum every.other :digits\n localmake \"s2 apply \"sum map \"double.digit every.other bf :digits\n output equal? 0 last sum :s1 :s2\nend\n\nshow luhn \"49927398716 ; true\nshow luhn \"49927398717 ; false\nshow luhn \"1234-5678-1234-5678 ; false\nshow luhn \"1234-5678-1234-5670 ; true\n","language":"Logo"},{"code":"function luhn(n)\n n=string.reverse(n)\n print(n)\n local s1=0\n --sum odd digits\n for i=1,n:len(),2 do\n s1=s1+n:sub(i,i)\n end\n --evens\n local s2=0\n for i=2,n:len(),2 do\n local doubled=n:sub(i,i)*2\n doubled=string.gsub(doubled,'(%d)(%d)',function(a,b)return a+b end)\n s2=s2+doubled\n end\n print(s1)\n print(s2)\n local total=s1+s2\n if total%10==0 then\n return true\n end\n return false\nend\n\n-- Note that this function takes strings, not numbers.\n-- 16-digit numbers tend to be problematic\n-- when looking at individual digits.\nprint(luhn'49927398716')\nprint(luhn'49927398717')\nprint(luhn'1234567812345678')\nprint(luhn'1234567812345670')\n","language":"Lua"},{"code":"Module Checkit {\n Function luhntest(cardnr$) {\n\n cardnr$ = Trim$(cardnr$) ' we don't want spaces\n if len(cardnr$)=0 then exit\n Dim Base 0, reverse_nr$(Len(cardnr$))\n Def integer i, j, s1, s2, l , l2\n Let l=Len(cardnr$)-1, l2=l+1\n\n ' reverse string\n For i = 0 To l\n reverse_nr$(i) = mid$(cardnr$,l2-i,1)\n Next i\n ' sum odd numbers\n For i = 0 To l Step 2\n s1 = s1 + (Asc(reverse_nr$(i)) - Asc(\"0\"))\n Next i\n ' sum even numbers\n For i = 1 To l Step 2\n j = Asc(reverse_nr$(i)) - Asc(\"0\")\n j = j * 2\n If j > 9 Then j = j Mod 10 + 1\n s2 = s2 + j\n Next i\n\n If (s1 + s2) Mod 10 = 0 Then\n = 1=1\n Else\n = 1=0\n End If\n }\n Flush\n Data \"49927398716\", \"49927398717\", \"1234567812345678\", \"1234567812345670\"\n while not empty\n over\n print letter$;\" = \";luhntest(letter$)\n end while\n}\nCheckit\n","language":"M2000-Interpreter"},{"code":" .TITLE LUHN\n .MCALL .GTLIN,.PRINT,.EXIT\nLUHN:: .GTLIN #5$\n MOV #5$,R0\n TSTB (R0)\n BEQ 2$\n JSR PC,TEST\n BNE 1$\n .PRINT #3$\n BR LUHN\n1$: .PRINT #4$\n BR LUHN\n2$: .EXIT\n3$: .ASCIZ /PASS/\n4$: .ASCIZ /FAIL/\n5$: .BLKB 200\n .EVEN\n\nTEST: MOV R0,R1\n CLR R2\n1$: TSTB (R0)+\n BNE 1$\n DEC R0\n2$: MOVB -(R0),R3\n SUB #60,R3\n ADD R3,R2\n CMP R0,R1\n BLOS 3$\n MOVB -(R0),R3\n SUB #60,R3\n MOVB 4$(R3),R3\n ADD R3,R2\n CMP R0,R1\n BHI 2$\n3$: SUB #12,R2\n BHI 3$\n RTS PC\n4$: .BYTE ^D0,^D2,^D4,^D6,^D8\n .BYTE ^D1,^D3,^D5,^D7,^D9\n .END LUHN\n","language":"MACRO-11"},{"code":"LuhnQ[nb_] := (Mod[Total[(2*ToExpression[#[[2;;All;;2]]]) /. {z_?(Function[v, v>9]) -> z-9}]\n + Total[ToExpression[#[[1;;All;;2]]]], 10] == 0)& [Characters[StringReverse[ToString[nb]]] ]\n\nLuhnQ /@ {49927398716, 49927398717, 1234567812345678, 1234567812345670}\n->{True, False, False, True}\n","language":"Mathematica"},{"code":"LuhnQ[n_Integer] :=\n Block[{digits = Reverse@IntegerDigits@n},\n Mod[Total[{digits[[;; ;; 2]],\n IntegerDigits[2 #] & /@ digits[[2 ;; ;; 2]]}, -1], 10] == 0]\n\nLuhnQ /@ {49927398716, 49927398717, 1234567812345678, 1234567812345670}\n","language":"Mathematica"},{"code":"function passed = luhn(num)\nif nargin == 0 % evaluate test cases\n testnum = [49927398716 49927398717 1234567812345678 1234567812345670];\n for num = testnum\n disp([int2str(num) ': ' int2str(luhn(num))])\n end\n return\nend\n% luhn function starts here\nd = int2str(num) - '0';\t% convert number into vector of digits\nm = [2:2:8,1:2:9];\t% rule 3: maps 1:9 to [2 4 6 8 1 3 5 7 9]\npassed = ~mod(sum(d(end:-2:1)) + sum(m(d(end-1:-2:1))), 10);\nend\n","language":"MATLAB"},{"code":"((dup 10 <) 'quote (((10 mod) (10 div)) cleave) 'cons linrec) :digits\n((0 0) dip (pop 'succ dip over even?) partition ((pop pop) dip) dip) :evens/odds\n((2 * digits sum) map sum) :evens-sum\n(digits evens/odds ('evens-sum 'sum) => spread + 10 mod 0 ==) :luhn?\n\n(49927398716 49927398717 1234567812345678 1234567812345670)\n(dup print! \" \" print! luhn? puts!) foreach\n","language":"Min"},{"code":"isValid = function(s)\n sum = 0\n odd = true\n for i in range(s.len-1)\n d = val(s[i])\n sum = sum + d * (2 - odd)\n if not odd and d > 4 then sum = sum - 9\n odd = not odd\n end for\n return sum % 10 == 0\nend function\n\ntest = function(s)\n if isValid(s) then print s + \": valid\" else print s + \": invalid\"\nend function\n\ntest \"49927398716\"\ntest \"49927398717\"\ntest \"1234567812345678\"\ntest \"1234567812345670\"\n","language":"MiniScript"},{"code":"LUHN(C)\n NEW ODD,EVEN,S\n SET S=$REVERSE(C)\n SET ODD=0 FOR I=1:2:$LENGTH(S) SET ODD=ODD+$EXTRACT(S,I)\n SET EVEN=0 FOR I=2:2:$LENGTH(S) SET T=$EXTRACT(S,I)*2 SET EVEN=EVEN+$SELECT(T<=9:T,T>9:$EXTRACT(T,1)+$EXTRACT(T,2))\n QUIT '((ODD+EVEN)#10)\n","language":"MUMPS"},{"code":"def reverse_str(string)\n to_return = \"\"\n\n for i in range(len(string) - 1, 0, -1)\n to_return += string[i]\n end for\n\n return to_return\nend reverse_str\n\ndef luhnTest(number)\n s1 = 0; s2 = 0\n reversed = reverse_str(number)\n for i in range(0, len(reversed) - 1)\n digit = int(reversed[i])\n if (i % 2) = 0\n s1 += digit\n else\n s2 += 2 * digit\n if digit >= 5\n s2 -= 9\n end if\n end if\n end for\n\n return ((s1 + s2) % 10) = 0\nend luhnTest\n\nprintln luhnTest(\"49927398716\")\nprintln luhnTest(\"49927398717\")\nprintln luhnTest(\"1234567812345678\")\nprintln luhnTest(\"1234567812345670\")\n","language":"Nanoquery"},{"code":"class LuhnTest\n\n method main(args=String[]) static\n cc\t = 0\n cc[1] = '49927398716'\n cc[2] = '49927398717'\n cc[3] = '1234567812345678'\n cc[4] = '1234567812345670'\n\n loop k=1 while cc[k] <> 0\n r = checksum(cc[k])\n if r==0 then say cc[k].right(20) 'passed'\n else say cc[k].right(20) 'failed'\n end\n\n -- Luhn algorithm checksum for credit card numbers\n method checksum(t) static\n if t.length()//2 then t = '0't --pad # on left with 0\n t = t.reverse()\n s = 0\n loop j = 1 to t.length()-1 by 2\n q = 2*t.substr(j+1,1)\n if q>9 then q = q.left(1) + q.right(1)\n s= s+t.substr(j,1)+q\n end\n return s//10\\==0\n","language":"NetRexx"},{"code":"proc luhn(cc: string): bool =\n const m = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\n var sum = 0\n var odd = true\n for i in countdown(cc.high, 0):\n let digit = ord(cc[i]) - ord('0')\n sum += (if odd: digit else: m[digit])\n odd = not odd\n result = sum mod 10 == 0\n\nfor cc in [\"49927398716\", \"49927398717\", \"1234567812345678\", \"1234567812345670\"]:\n echo cc, ' ', luhn(cc)\n","language":"Nim"},{"code":"bundle Default {\n class Luhn {\n function : IsValid(cc : String) ~ Bool {\n isOdd := true;\n oddSum := 0;\n evenSum := 0;\n\n for(i := cc->Size() - 1; i >= 0; i -= 1;) {\n digit : Int := cc->Get(i) - '0';\n if(isOdd) {\n oddSum += digit;\n }\n else {\n evenSum += digit / 5 + (2 * digit) % 10;\n };\n isOdd := isOdd <> true;\n };\n\n return (oddSum + evenSum) % 10 = 0;\n }\n\n function : Main(args : String[]) ~ Nil {\n IsValid(\"49927398716\")->PrintLine();\n IsValid(\"49927398717\")->PrintLine();\n IsValid(\"1234567812345678\")->PrintLine();\n IsValid(\"1234567812345670\")->PrintLine();\n }\n }\n}\n","language":"Objeck"},{"code":"- (NSArray *) toCharArray {\n\t\n\tNSMutableArray *characters = [[NSMutableArray alloc] initWithCapacity:[self length]];\n\tfor (int i=0; i < [self length]; i++) {\n\t\tNSString *ichar = [NSString stringWithFormat:@\"%C\", [self characterAtIndex:i]];\n\t\t[characters addObject:ichar];\n\t}\n\t\n\treturn characters;\n}\n\n+ (BOOL) luhnCheck:(NSString *)stringToTest {\n\t\n\tNSArray *stringAsChars = [stringToTest toCharArray];\n\t\n\tBOOL isOdd = YES;\n\tint oddSum = 0;\n\tint evenSum = 0;\n\t\n\tfor (int i = [stringToTest length] - 1; i >= 0; i--) {\n\t\t\n\t\tint digit = [(NSString *)stringAsChars[i] intValue];\n\t\t\n\t\tif (isOdd)\n\t\t\toddSum += digit;\n\t\telse\n\t\t\tevenSum += digit/5 + (2*digit) % 10;\n\t\t\t\n\t\tisOdd = !isOdd;\t\t\t\t\n\t}\n\t\n\treturn ((oddSum + evenSum) % 10 == 0);\n}\n\nBOOL test0 = [self luhnCheck:@\"49927398716\"]; //Result = YES\nBOOL test1 = [self luhnCheck:@\"49927398717\"]; //Result = NO\nBOOL test2 = [self luhnCheck:@\"1234567812345678\"]; //Result = NO\t\t\t\t\nBOOL test3 = [self luhnCheck:@\"1234567812345670\"]; //Result = YES\n","language":"Objective-C"},{"code":"let luhn s =\n let rec g r c = function\n | 0 -> r\n | i ->\n let d = c * ((int_of_char s.[i-1]) - 48) in\n g (r + (d/10) + (d mod 10)) (3-c) (i-1)\n in\n (g 0 1 (String.length s)) mod 10 = 0\n;;\n","language":"OCaml"},{"code":"# List.map luhn [ \"49927398716\"; \"49927398717\"; \"1234567812345678\"; \"1234567812345670\" ];;\n- : bool list = [true; false; false; true]\n","language":"OCaml"},{"code":" function y = isluhn(s);\n\tif isnumeric(s) s = mat2str(s); end; \t% make sure s is a string\n\td = s-'0';\t% convert string into vector of digits\n\tm = [2:2:8,1:2:9];\t% rule 3: maps [1:9] -> i\n\ty = ~mod(sum(d(end:-2:1)) + sum(m(d(end-1:-2:1))),10);\n end;\n","language":"Octave"},{"code":" isluhn('49927398716')\n\tans = 1\n isluhn('49927398717')\n\tans = 0\n isluhn('1234567812345678')\n\tans = 0\n isluhn('1234567812345670')\n\tans = 1\n","language":"Octave"},{"code":": luhnTest(n)\n| s i |\n n asString reverse ->s\n 0 s size loop: i [\n i s at asDigit\n i isEven ifTrue: [ 2 * dup 10 >= ifTrue: [ 9 - ] ] +\n ]\n 10 mod ==0 ;\n","language":"Oforth"},{"code":"FUNCTION fnLuhnAlgorithm RETURNS LOGICAL\n (INPUT pcNumber AS CHARACTER):\n/*------------------------------------------------------------------------------\n Purpose: Applies Luhn Algorithm to check a Number\n Notes: Returns True/False Validation based on check digit\n------------------------------------------------------------------------------*/\n DEFINE VARIABLE cNum AS CHARACTER NO-UNDO.\n DEFINE VARIABLE iCheck AS INTEGER NO-UNDO.\n DEFINE VARIABLE iLength AS INTEGER NO-UNDO.\n DEFINE VARIABLE iLoopCnt AS INTEGER NO-UNDO.\n DEFINE VARIABLE iNum AS INTEGER NO-UNDO.\n DEFINE VARIABLE iNum1 AS INTEGER NO-UNDO.\n DEFINE VARIABLE iNum2 AS INTEGER NO-UNDO.\n DEFINE VARIABLE iTestLength AS INTEGER NO-UNDO.\n\n ASSIGN\n iLength = LENGTH(pcNumber)\n iTestLength = iLength - 1\n iCheck = 1. /* 1 for the check digit we skip */\n\n DO iLoopCnt = iTestLength TO 1 BY -1:\n ASSIGN\n iNum = INTEGER(SUBSTR(pcNumber,iLoopCnt,1))\n iCheck = iCheck + 1.\n\n IF iCheck MODULO 2 = 1 THEN\n ASSIGN iNum1 = iNum1 + iNum.\n ELSE\n DO:\n ASSIGN iNum2 = iNum * 2.\n IF iNum2 < 10 THEN\n ASSIGN iNum1 = iNum1 + iNum2.\n ELSE\n ASSIGN\n cNum = STRING(iNum2)\n iNum1 = iNum1 + INTEGER(SUBSTR(cNum,1,1)) + INTEGER(SUBSTR(cNum,2,1)).\n END.\n END.\n\n ASSIGN\n iNum2 = iNum1 * 9\n iNum = iNum2 MODULO 10.\n\n IF iNum = INTEGER(SUBSTR(pcNumber,iLength,1)) THEN\n RETURN TRUE.\n ELSE\n RETURN FALSE.\n\nEND FUNCTION. /* fnLuhnAlgorithm */\n","language":"OpenEdge-Progress"},{"code":"#include <order/interpreter.h>\n\n#define ORDER_PP_DEF_8luhn ORDER_PP_FN( \\\n8fn(8N, 8if(8is_seq(8N), 8luhn_wk(8num_to_seq(8N)), 8false)) )\n\n#define ORDER_PP_DEF_8num_to_seq ORDER_PP_FN( \\\n8fn(8N, 8seq_push_back(8seq(8seq_last(8N)), 8seq_pop_back(8N))) )\n\n#define ORDER_PP_DEF_8luhn_wk ORDER_PP_FN( \\\n8fn(8N, \\\n 8lets((8P, 8unzip(8N, 8nil, 8nil, 8true)) \\\n (8O, 8seq_fold(8plus, 0, 8tuple_at_0(8P))) \\\n (8E, 8seq_fold(8plus, 0, \\\n 8seq_map(8dig_map, 8tuple_at_1(8P)))), \\\n 8is_0(8remainder(8plus(8O, 8E), 10)))) )\n\n#define ORDER_PP_DEF_8dig_map ORDER_PP_FN( \\\n8fn(8X, 8tuple_at(8X, 8tuple(0,2,4,6,8,1,3,5,7,9))) )\n\n#define ORDER_PP_DEF_8unzip ORDER_PP_FN( \\\n8fn(8S, 8L, 8R, 8O, \\\n 8if(8is_nil(8S), \\\n 8pair(8L, 8R), \\\n 8if(8O, \\\n 8unzip(8seq_tail(8S), 8seq_push_back(8seq_head(8S), 8L), \\\n 8R, 8false), \\\n 8unzip(8seq_tail(8S), 8L, \\\n 8seq_push_back(8seq_head(8S), 8R), 8true)))) )\n\nORDER_PP(8seq_to_tuple(\n 8seq_map(8luhn, 8seq(8nat(4,9,9,2,7,3,9,8,7,1,6),\n 8nat(4,9,9,2,7,3,9,8,7,1,7),\n 8nat(1,2,3,4,5,6,7,8,1,2,3,4,5,6,7,8),\n 8nat(1,2,3,4,5,6,7,8,1,2,3,4,5,6,7,0)))\n))\n","language":"Order"},{"code":"(8true,8false,8false,8true)\n","language":"Order"},{"code":"declare\n fun {Luhn N}\n {Sum {List.mapInd {Reverse {Digits N}}\n fun {$ Idx Dig}\n if {IsEven Idx} then {Sum {Digits 2*Dig}}\n else Dig\n end\n end}}\n mod 10 == 0\n end\n\n fun {Digits N}\n {Map {Int.toString N} fun {$ D} D - &0 end}\n end\n\n fun {Sum Xs}\n {FoldL Xs Number.'+' 0}\n end\nin\n {Show\n {Map\n [49927398716 49927398717 1234567812345678 1234567812345670]\n Luhn}}\n","language":"Oz"},{"code":"program luhnTestOfCreditCardNumbers(input, output);\n\ntype\n\t{\n\t\t`string(…)` is an Extended Pascal, ISO 10206, extension.\n\t\t`string(64)` discriminates the “schema” data type `string`\n\t\tto contain at most 64 `char` values.\n\t}\n\tcreditCardNumber = string(64);\n\n{\n\t\\brief determines whether a string contains digits only\n\t\n\t\\param sample the string to inspect\n\t\\return `false` iff `sample` contains non-digit characters\n}\n{ Extended Pascal: `protected` means the function cannot modify `sample` }\nfunction containsDigitsOnly(protected sample: creditCardNumber): Boolean;\nvar\n\t{ EP: the `… value []` initializes this variable as an empty set }\n\tcharacters: set of char value [];\n\t{ `sample.capacity` refers to `64` in this code. }\n\ti: 1..sample.capacity;\nbegin\n\tfor i := 1 to length(sample) do\n\tbegin\n\t\t{ Union of sets indicated by `+`. }\n\t\tcharacters := characters + [sample[i]]\n\tend;\n\t\n\t{\n\t\tIn a Pascal `function` definition,\n\t\tthere must be one assignment to the (implicit) variable\n\t\tbearing the same name as of the function.\n\t\tThis will be the return value.\n\t}\n\t{ NB: This will return `true` even if `length(sample)` is zero. }\n\tcontainsDigitsOnly := card(characters - ['0'..'9']) = 0\n\t{ `card` is an Extended Pascal extension. }\nend;\n\n{\n\t\\brief determines whether a string complies with ISO/IEC 7812-1 Luhn test\n\t\n\t\\param sample the potentially correct credit card number\n\t\\return `true` if verification succeeds\n}\nfunction luhnCheck(protected sample: creditCardNumber): Boolean;\n\t{\n\t\tThis _nested_ function is only accessible _within_ `luhnCheck`.\n\t\tOutsourcing this code allows us to write a neat expression below.\n\t}\n\tfunction check: Boolean;\n\tvar\n\t\t{ Using `integer` sub-ranges ensures only these values are assigned. }\n\t\tsum: 0..maxInt value 0;\n\t\ti: 0..sample.capacity-1;\n\tbegin\n\t\tfor i := 0 to length(sample) - 1 do\n\t\tbegin\n\t\t\t{ `1 + ord(odd(i))` produces an alternating scale factor `* 1`/`* 2`. }\n\t\t\tsum := sum + (1 + ord(odd(i))) *\n\t\t\t\t{ Obtain digit value for `integer` calculation. }\n\t\t\t\t(ord(sample[length(sample) - i]) - ord('0')) -\n\t\t\t\t{ Reverse operation if digit sum > 9, i.e. we added “too much”. }\n\t\t\t\tord(odd(i) and (sample[length(sample) - i] >= '5')) * 9\n\t\tend;\n\t\t\n\t\tcheck := sum mod 10 = 0\n\tend;\nbegin\n\t{\n\t\tThe Extended Pascal Boolean operator `and_then` (and `or_else`)\n\t\tallows for “short-circuit evaluation”.\n\t\tOtherwise, in Pascal `and` and `or` mandate complete evaluation.\n\t}\n\tluhnCheck := (length(sample) > 0) and_then containsDigitsOnly(sample)\n\t\tand_then check\nend;\n\n{ === MAIN ============================================================= }\nvar\n\ts: creditCardNumber;\nbegin\n\t{ `EOF` is short for `EOF(input)`. }\n\twhile not EOF do\n\tbegin\n\t\treadLn(s); { equivalent to `readLn(input, s)` }\n\t\twriteLn(luhnCheck(s)) { = `writeLn(output, …)` }\n\tend\nend.\n","language":"Pascal"},{"code":"sub luhn_test\n{\n my @rev = reverse split //,$_[0];\n my ($sum1,$sum2,$i) = (0,0,0);\n\n for(my $i=0;$i<@rev;$i+=2)\n {\n $sum1 += $rev[$i];\n last if $i == $#rev;\n $sum2 += 2*$rev[$i+1]%10 + int(2*$rev[$i+1]/10);\n }\n return ($sum1+$sum2) % 10 == 0;\n}\nprint luhn_test('49927398716');\nprint luhn_test('49927398717');\nprint luhn_test('1234567812345678');\nprint luhn_test('1234567812345670');\n","language":"Perl"},{"code":"sub luhn {\n my (@n,$i,$sum) = split //, reverse $_[0];\n my @a = map {int(2*$_ / 10) + (2*$_ % 10)} (0..9);\n map {$sum += $i++ % 2 ? $a[$_] : $_} @n;\n return ($sum % 10) ? 0 : 1;\n}\n\n# Test and display\nmap {print luhn($_), \": $_\\n\"}\n qw(49927398716 49927398717 1234567812345678 1234567812345670);\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;\">Luhn</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">st</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">d</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;\">st</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">st</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]-</span><span style=\"color: #008000;\">'0'</span>\n <span style=\"color: #000000;\">s</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;\">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;\">d</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;\">4</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">9</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;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)=</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;\">procedure</span> <span style=\"color: #000000;\">test</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: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%20s : %t\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">Luhn</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;\">procedure</span>\n\n <span style=\"color: #7060A8;\">papply</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #008000;\">\"49927398716\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"49927398717\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1234567812345678\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1234567812345670\"</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"$numbers = \"49927398716 49927398717 1234567812345678 1234567812345670\";\nforeach (split(' ', $numbers) as $n)\n echo \"$n is \", luhnTest($n) ? 'valid' : 'not valid', '</br>';\n\nfunction luhnTest($num) {\n $len = strlen($num);\n for ($i = $len-1; $i >= 0; $i--) {\n $ord = ord($num[$i]);\n if (($len - 1) & $i) {\n $sum += $ord;\n } else {\n $sum += $ord / 5 + (2 * $ord) % 10;\n }\n }\n return $sum % 10 == 0;\n}\n","language":"PHP"},{"code":"function luhn_test($num) {\n $str = '';\n foreach( array_reverse( str_split( $num ) ) as $i => $c ) $str .= ($i % 2 ? $c * 2 : $c );\n return array_sum( str_split($str) ) % 10 == 0;\n}\n\nforeach (array('49927398716','49927398717','1234567812345678','1234567812345670') as $n)\n echo \"$n is \", luhn_test($n) ? 'valid' : 'not valid', \"</br>\\n\";\n","language":"PHP"},{"code":"go =>\n Nums = [\"49927398716\",\"49927398717\",\"1234567812345678\",\"1234567812345670\"],\n foreach (N in Nums)\n println([N, isluhn10(N)])\n end,\n nl.\n\n%\n% isluhn10(num) returns 1 is valid, else 0\n%\n% Assumption: input num is a string.\n%\nisluhn10(Num) = V =>\n X = [I : I in Num.reverse()] ++ [\"\"],\n Digits = \"0246813579\",\n M = new_map([(I.to_string()=Digits[I+1]) : I in 0..9]),\n V1 = sum([X[I].to_integer() + M.get2(X[I+1].to_string(),0) : I in 1..2..Num.length]),\n V := cond(V1 mod 10 == 0, 1, 0).\n\n% A variant of Map.get with conversions\nget2(M, Key, Default)=V =>\n if M.has_key(Key) then V= M.get(Key).to_integer() else V=Default end.\n","language":"Picat"},{"code":"(de luhn (Num) # 'Num' may be a number or a string\n (=0\n (%\n (sum\n '((C F)\n (setq C (- (char C) 48))\n (if F\n C # Odd\n (+ (/ C 5) (% (* 2 C) 10)) ) ) # Even\n (flip (chop Num))\n '(T NIL .) )\n 10 ) ) )\n","language":"PicoLisp"},{"code":"test: procedure options (main);\n\n declare (cardnumber, rcn) character (20) varying;\n declare (i, k, s1, s2) fixed binary;\n\n get edit (cardnumber) (L);\n cardnumber = trim(cardnumber);\n rcn = reverse(cardnumber);\n s1, s2 = 0;\n /* Sum the odd-numbered digits */\n do i = 1 to length(rcn) by 2;\n s1 = s1 + substr(rcn, i, 1);\n end;\n /* Twice the even-numbered digits. */\n do i = 2 to length(rcn) by 2;\n k = 2 * substr(rcn, i, 1);\n s2 = s2 + mod(k,10) + trunc(k/10);\n end;\n if mod(s1 + s2, 10) = 0 then\n put skip edit (cardnumber, ' passes the Luhn test' )(a);\n else\n put skip edit (cardnumber, ' does not pass the Luhn test' )(a);\n put skip list (s1 + s2);\nend test;\n","language":"PL-I"},{"code":"100H:\nBDOS: PROCEDURE(F,A); DECLARE F BYTE, A ADDRESS; GO TO 5; END BDOS;\nEXIT: PROCEDURE; GO TO 0; END EXIT;\nPRINT: PROCEDURE(S); DECLARE S ADDRESS; CALL BDOS(9,S); END PRINT;\n\nLUHN: PROCEDURE(NUM) BYTE;\n DECLARE MAP DATA (0, 2, 4, 6, 8, 1, 3, 5, 7, 9);\n DECLARE (START, NUM, MASK, TOTAL) ADDRESS;\n DECLARE (CHR BASED NUM, DGT) BYTE;\n START = NUM;\n\n DO WHILE CHR <> '$'; NUM = NUM + 1; END;\n MASK = NUM := NUM - 1;\n TOTAL = 0;\n DO WHILE NUM >= START;\n DGT = CHR - '0';\n IF NUM XOR MASK THEN DGT = MAP(DGT);\n TOTAL = TOTAL + DGT;\n NUM = NUM - 1;\n END;\n RETURN TOTAL MOD 10 = 0;\nEND LUHN;\n\nDECLARE TEST (4) ADDRESS, I BYTE;\nTEST(0) = .'49927398716$';\nTEST(1) = .'49927398717$';\nTEST(2) = .'1234567812345678$';\nTEST(3) = .'1234567812345670$';\n\nDO I=0 TO LAST(TEST);\n CALL PRINT(TEST(I));\n CALL PRINT(.': $');\n IF LUHN(TEST(I))\n THEN CALL PRINT(.'PASS$');\n ELSE CALL PRINT(.'FAIL$');\n CALL PRINT(.(13,10,'$'));\nEND;\nCALL EXIT;\nEOF\n","language":"PL-M"},{"code":"FUNCTION algoLuhn ( p_numeroVerif VARCHAR2 )\n RETURN NUMBER\n IS\n i NUMBER;\n v_NBi SMALLINT;\n v_retour SMALLINT;\n v_somme NUMBER := 0;\n v_nbCar NUMBER;\n\n BEGIN\n v_nbCar := LENGTH(p_numeroVerif);\n\n FOR i IN 1..v_nbCar\n LOOP\n v_NBi := TO_NUMBER(SUBSTR(p_numeroVerif,v_nbCar+1-i,1));\n\n v_somme := v_somme\n + MOD(i,2) * v_NBi\n + MOD(i+1,2) * SIGN(-SIGN(v_Nbi-4)+1) * (2*v_NBi)\n + MOD(i+1,2) * SIGN( SIGN(v_Nbi-5)+1) * (2*v_NBi-9);\n\n END LOOP;\n\n v_retour := SIGN(MOD(v_somme,10));\n\n RETURN v_retour;\n\n EXCEPTION\n WHEN OTHERS\n THEN\n RETURN 1;\n\n END algoLuhn;\n","language":"PL-SQL"},{"code":"To run:\nStart up.\nTest whether \"49927398716\" will pass the luhn test.\nTest whether \"49927398717\" will pass the luhn test.\nTest whether \"1234567812345678\" will pass the luhn test.\nTest whether \"1234567812345670\" will pass the luhn test.\nWait for the escape key.\nShut down.\n\nTo test whether a string will pass the luhn test:\nWrite the string then \": \" on the console without advancing.\nIf the string will pass the luhn test, write \"valid\" on the console; exit.\nWrite \"invalid\" on the console.\n\nA sum is a number.\n\nTo decide if a string will pass the luhn test:\nIf the string is blank, say no.\nPrivatize the string.\nReverse the string.\nPut 0 into a first sum.\nPut 0 into a second sum.\nPut 1 into a count.\nSlap a rider on the string.\nLoop.\nIf the rider's source is blank, break.\nPut the rider's source's first's target into a byte.\nIf the byte is not any digit, say no.\nConvert the byte to a number.\nIf the count is odd, add the number to the first sum; bump the count; bump the rider; repeat.\nDouble the number.\nIf the number is greater than 9, digital root the number.\nAdd the number to the second sum.\nBump the count. Bump the rider.\nRepeat.\nIf the first sum plus the second sum is evenly divisible by 10, say yes.\nSay no.\n\nTo digital root a number:\nDivide the number by 10 giving a quotient and a remainder.\nPut the quotient plus the remainder into the number.\n\nTo convert a byte to a number:\nIf the byte is any digit, put the byte minus 48 into the number.\n","language":"Plain-English"},{"code":"#COMPILE EXE\n#DIM ALL\n#COMPILER PBCC 6\n\nFUNCTION LuhnCheckPassed(BYVAL dgts AS STRING) AS INTEGER\nLOCAL i, s, s1 AS DWORD\n dgts = STRREVERSE$(dgts)\n FOR i = 1 TO LEN(dgts) STEP 2\n s += VAL(MID$(dgts, i, 1))\n NEXT i\n FOR i = 2 TO LEN(dgts) STEP 2\n s1 = 2 * VAL(MID$(dgts, i, 1))\n IF s1 >= 10 THEN\n s -= 9\n END IF\n s += s1\n NEXT i\n FUNCTION = NOT ISTRUE (s MOD 10)\nEND FUNCTION\n\nFUNCTION PBMAIN () AS LONG\n ' this test is expected to pass:\n CON.PRINT IIF$(LuhnCheckPassed(\"49927398716\"), \"passed\", \"failed\")\n ' this test is expected to fail:\n CON.PRINT IIF$(LuhnCheckPassed(\"49927398717\"), \"passed\", \"failed\")\n ' this test is expected to fail:\n CON.PRINT IIF$(LuhnCheckPassed(\"1234567812345678\"), \"passed\", \"failed\")\n ' this test is expected to pass:\n CON.PRINT IIF$(LuhnCheckPassed(\"1234567812345670\"), \"passed\", \"failed\")\nEND FUNCTION\n","language":"PowerBASIC"},{"code":"function Test-LuhnNumber\n{\n <#\n .SYNOPSIS\n Tests validity of credit card numbers.\n .DESCRIPTION\n Tests validity of credit card numbers using the Luhn test.\n .PARAMETER Number\n The number must be 11 or 16 digits.\n .EXAMPLE\n Test-LuhnNumber 49927398716\n .EXAMPLE\n [int64[]]$numbers = 49927398716, 49927398717, 1234567812345678, 1234567812345670\n C:\\PS>$numbers | ForEach-Object {\n \"{0,-17}: {1}\" -f $_,\"$(if(Test-LuhnNumber $_) {'Is valid.'} else {'Is not valid.'})\"\n }\n #>\n [CmdletBinding()]\n [OutputType([bool])]\n Param\n (\n [Parameter(Mandatory=$true,\n Position=0)]\n [ValidateScript({$_.Length -eq 11 -or $_.Length -eq 16})]\n [ValidatePattern(\"^\\d+$\")]\n [string]\n $Number\n )\n\n $digits = ([Regex]::Matches($Number,'.','RightToLeft')).Value\n\n $digits |\n ForEach-Object `\n -Begin {$i = 1} `\n -Process {if ($i++ % 2) {$_}} |\n ForEach-Object `\n -Begin {$sumOdds = 0} `\n -Process {$sumOdds += [Char]::GetNumericValue($_)}\n $digits |\n ForEach-Object `\n -Begin {$i = 0} `\n -Process {if ($i++ % 2) {$_}} |\n ForEach-Object `\n -Process {[Char]::GetNumericValue($_) * 2} |\n ForEach-Object `\n -Begin {$sumEvens = 0} `\n -Process {\n $_number = $_.ToString()\n if ($_number.Length -eq 1)\n {\n $sumEvens += [Char]::GetNumericValue($_number)\n }\n elseif ($_number.Length -eq 2)\n {\n $sumEvens += [Char]::GetNumericValue($_number[0]) + [Char]::GetNumericValue($_number[1])\n }\n }\n\n ($sumOdds + $sumEvens).ToString()[-1] -eq \"0\"\n}\n","language":"PowerShell"},{"code":"Test-LuhnNumber 49927398716\n","language":"PowerShell"},{"code":"49927398716, 49927398717, 1234567812345678, 1234567812345670 | ForEach-Object {\n \"{0,-17}: {1}\" -f $_,\"$(if(Test-LuhnNumber $_) {'Is valid.'} else {'Is not valid.'})\"\n}\n","language":"PowerShell"},{"code":"DataSection\n Sample:\n Data.s \"49927398716\"\n Data.s \"49927398717\"\n Data.s \"1234567812345678\"\n Data.s \"1234567812345670\"\n Data.s \"\"\nEndDataSection\n\nProcedure isValid(cardNumber.s)\n Protected i, length, s1, s2, s2a\n\n cardNumber = ReverseString(cardNumber)\n length = Len(cardNumber)\n For i = 1 To length Step 2\n s1 + Val(Mid(cardNumber, i, 1))\n Next\n\n For i = 2 To length Step 2\n s2a = Val(Mid(cardNumber, i, 1)) * 2\n If s2a < 10\n s2 + s2a\n Else\n s2 + 1 + Val(Right(Str(s2a), 1))\n EndIf\n Next\n\n If Right(Str(s1 + s2), 1) = \"0\"\n ProcedureReturn #True\n Else\n ProcedureReturn #False\n EndIf\nEndProcedure\n\n\nIf OpenConsole()\n Define cardNumber.s\n\n Restore Sample\n Repeat\n Read.s cardNumber\n If cardNumber <> \"\"\n Print(cardNumber + \" is \")\n If isValid(cardNumber)\n PrintN(\"valid\")\n Else\n PrintN(\"not valid\")\n EndIf\n EndIf\n Until cardNumber = \"\"\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\")\n Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":">>> def luhn(n):\n\tr = [int(ch) for ch in str(n)][::-1]\n\treturn (sum(r[0::2]) + sum(sum(divmod(d*2,10)) for d in r[1::2])) % 10 == 0\n\n>>> for n in (49927398716, 49927398717, 1234567812345678, 1234567812345670):\n\tprint(n, luhn(n))\n","language":"Python"},{"code":"'''Luhn test of credit card numbers'''\n\nfrom operator import add, mul\nfrom functools import reduce\nfrom itertools import cycle\n\n\n# luhn :: Integer -> Bool\ndef luhn(n):\n '''True if n is a valid Luhn credit card number.'''\n def divMod10Sum(a, x):\n return a + add(*divmod(x, 10))\n return 0 == reduce(\n divMod10Sum,\n map(\n mul,\n cycle([1, 2]),\n map(int, reversed(str(n)))\n ),\n 0\n ) % 10\n\n\n# ---------------------------TEST---------------------------\n# main :: IO ()\ndef main():\n '''Tests'''\n print(list(\n map(luhn, [\n 49927398716, 49927398717,\n 1234567812345678, 1234567812345670\n ])\n ))\n\n\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"'''Luhn test of credit card numbers'''\n\nfrom itertools import cycle\n\n\n# luhn :: String -> Bool\ndef luhn(k):\n '''True if k is a valid Luhn credit card number string\n '''\n def asDigits(s):\n return (int(c) for c in s)\n\n return 0 == sum(map(\n lambda f, x: f(x),\n cycle([\n lambda n: n,\n lambda n: sum(asDigits(str(2 * n)))\n ]),\n asDigits(reversed(k))\n )) % 10\n\n\n# ------------------------- TEST -------------------------\n# main :: IO ()\ndef main():\n '''Tests'''\n print('\\n'.join([\n repr((x, luhn(x))) for x in [\n \"49927398716\",\n \"49927398717\",\n \"1234567812345678\",\n \"1234567812345670\"\n ]\n ]))\n\n\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":">>> def vérifLuhn(ch):\n sum = 0\n chParity = len(ch) % 2\n for i in range (len(ch)-1, -1, -1):\n j = int(ch[i])\n if ((i + 1) % 2 != chParity):\n j = j * 2\n if (j > 9):\n j = j - 9\n sum = sum + j\n print(\"value calculated = \", str(sum))\n return sum % 10 == 0\n\nfor n in (49927398716, 49927398717, 1234567812345678, 1234567812345670):\n print (str(n)+\" =>\", vérifLuhn(str(n)))\n","language":"Python"},{"code":"sd:{s:0; while[x<>0; s+:x mod 10; x:floor x%10]; s} / Sum digits of x\nluhn:{\n r:reverse string x; / Reversed credit card number\n o:(\"I\"$) each r[2*til ceiling (count r) % 2]; / Odd-indexed numbers\n e:(\"I\"$) each r[1+2*til floor (count r) % 2]; / Even-indexed numbers\n 0=(sum o,sd each e*2) mod 10 / Return 1b if checksum ends in 0; 0b otherwise\n}\n","language":"Q"},{"code":"CONST True = -1: False = NOT True\n\nDIM card$(5)\ncard$(1) = \"49927398716\"\ncard$(2) = \"49927398717\"\ncard$(3) = \"1234567812345678\"\ncard$(4) = \"1234567812345670\"\n\nFOR test = 1 TO 4\n odd = True\n sum = 0\n FOR n = LEN(card$(test)) TO 1 STEP -1\n num = VAL(MID$(card$(test), n, 1))\n IF odd THEN\n sum = sum + num\n odd = False\n ELSE\n num = num * 2\n IF num <= 9 THEN\n sum = sum + num\n ELSE\n sum = sum + VAL(LEFT$(STR$(num), 1)) + VAL(RIGHT$(STR$(num), 1))\n END IF\n odd = True\n END IF\n NEXT\n IF sum MOD 10 = 0 THEN\n PRINT card$(test), \"True\"\n ELSE\n PRINT card$(test), \"False\"\n END IF\nNEXT test\n","language":"QBasic"},{"code":" [ 1 & ] is odd ( n --> b )\n\n [ [] swap\n [ 10 /mod\n rot join swap\n dup 0 = until ]\n drop ] is digits ( n --> [ )\n\n [ [] [] rot\n dup size odd dip\n [ witheach\n [ nested join\n swap ] ]\n not if swap ] is unzip ( [ --> [ [ )\n\n [ [] swap\n witheach\n [ 2 *\n 10 /mod +\n join ] ] is 2*digitsum ( [ --> [ )\n\n [ behead swap\n witheach + ] is sum ( [ --> n )\n\n [ digits\n reverse\n unzip\n 2*digitsum\n sum\n swap sum\n + 10 mod 0 = ] is luhn ( n --> b )\n\n\n' [ 49927398716 49927398717\n 1234567812345678 1234567812345670 ]\n\nwitheach\n [ dup echo\n luhn iff\n [ say \" valid\" ]\n else\n [ say \" invalid\" ]\n cr ]\n","language":"Quackery"},{"code":"is.luhn <- function(cc){\n numbers <- as.numeric(rev(unlist(strsplit(cc,\"\"))))\n (sum(numbers[seq(1,length(numbers),by=2)]) + sum({numbers[seq(2,length(numbers),by=2)]*2 ->.; .%%10 +.%/%10})) %% 10 == 0\n}\n\nsapply(c(\"49927398716\",\"49927398717\",\"1234567812345678\",\"1234567812345670\"),is.luhn)\n","language":"R"},{"code":"#lang racket\n\n(define (luhn-test n)\n (let loop ([n n] [odd? #t] [s 0])\n (if (zero? n)\n (zero? (modulo s 10))\n (let*-values ([(q r) (quotient/remainder n 10)]\n [(rq rr) (quotient/remainder (* (if odd? 1 2) r) 10)])\n (loop q (not odd?) (+ s rq rr))))))\n\n(map luhn-test '(49927398716 49927398717 1234567812345678 1234567812345670))\n;; -> '(#t #f #f #t)\n","language":"Racket"},{"code":"sub luhn-test ($number --> Bool) {\n my @digits = $number.comb.reverse;\n my $sum = @digits[0,2...*].sum\n + @digits[1,3...*].map({ |($_ * 2).comb }).sum;\n return $sum %% 10;\n}\n\n# And we can test it like this:\n\nuse Test;\n\nmy @cc-numbers =\n '49927398716' => True,\n '49927398717' => False,\n '1234567812345678' => False,\n '1234567812345670' => True;\n\nplan @cc-numbers.elems;\n\nfor @cc-numbers».kv -> ($cc, $expected-result) {\n is luhn-test(+$cc), $expected-result,\n \"$cc {$expected-result ?? 'passes' !! 'does not pass'} the Luhn test.\";\n}\n","language":"Raku"},{"code":"$ENTRY Go {\n = <Test '49927398716'>\n <Test '49927398717'>\n <Test '1234567812345678'>\n <Test '1234567812345670'>;\n};\n\nTest {\n e.Digits = <Prout e.Digits ': ' <Luhn e.Digits>>;\n};\n\nLuhn {\n (s.Sum) e.Digits s.Even s.Odd,\n <Mul 2 <Numb s.Even>>: s.Even2,\n <Divmod s.Even2 10>: (s.EvenD1) s.EvenD2,\n <+ s.EvenD1 s.EvenD2>: s.EvenV,\n <+ <Numb s.Odd> s.EvenV>: s.Step\n = <Luhn (<+ s.Sum s.Step>) e.Digits>;\n (s.Sum) s.Odd = <Luhn (<+ s.Sum <Numb s.Odd>>)>;\n (s.Sum), <Divmod s.Sum 10>: (s.Rest) s.Last,\n s.Last: {\n 0 = Valid;\n s.X = Invalid;\n };\n e.Digits = <Luhn (0) e.Digits>;\n};\n","language":"Refal"},{"code":"/*REXX program validates credit card numbers using the Luhn algorithm. */\n#.=; #.1= 49927398716 /*the 1st sample credit card number. */\n #.2= 49927398717 /* \" 2nd \" \" \" \" */\n #.3= 1234567812345678 /* \" 3rd \" \" \" \" */\n #.4= 1234567812345670 /* \" 4th \" \" \" \" */\n do k=1 while #.k\\=='' /*validate all the credit card numbers.*/\n say right( Luhn(#.k), 9) ' the Luhn test, credit card number: ' #.k\n end /*k*/ /* [↑] function returns passed│flunked.*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nLuhn: procedure; parse arg x; $= 0 /*get credit card number; zero $ sum. */\n y= reverse( left(0, length(x) // 2)x) /*add leading zero if needed, reverse. */\n do j=1 to length(y)-1 by 2; _= substr(y, j+1, 1) * 2\n $= $ + substr(y, j, 1) + left(_, 1) + substr(_, 2, 1, 0) /* ◄────────┐*/\n end /*j*/ /*sum odd and even decimal digits ►────┘*/\n return word('passed flunked',1+($//10==0)) /*$ ending in zero? Then the # passed.*/\n","language":"REXX"},{"code":"/* Rexx ***************************************************\n* 09.04.2013 Walter Pachl\n* Implements the task's description in a rather concise way\n* Instead of reverting the ccn work it backwards\n**********************************************************/\nnumeric digits 20\n\npush 49927398716\npush 49927398717\npush 1234567812345678\npush 1234567812345670\n\ndo while queued() > 0\n parse pull ccnum\n if luhn(ccnum) then ln = 'passed'\n else ln = 'failed'\n say right(ccnum, 20) ln\n end\nreturn\nexit\n\nluhn:\nParse Arg ccn /* credit card number */\nsum=0 /* initialize test sum */\neven=0 /* even indicator */\nDo i=length(ccn) To 1 By -1 /* process all digits */\n c=substr(ccn,i,1) /* pick one digit at a time */\n If even Then Do /* even numbered digit */\n c=c*2 /* double it */\n If c>=10 Then /* 10, 12, 14, 16, 18 */\n c=c-9 /* Sum of the two digits */\n End /* end of even numbered */\n even=\\even /* flip even indicator */\n sum=sum+c /* add into test sum */\n End\nReturn right(sum,1)=0 /* ok if last digit is 0 */\n","language":"REXX"},{"code":"decimals(0)\n\ntest = [\"49927398716\", \"49927398717\", \"1234567812345678\", \"1234567812345670\"]\nfor n = 1 to len(test)\n see test[n] + \" -> \" + cardtest(test[n]) + nl\nnext\n\nfunc cardtest(numstr)\n revstring = revstr(numstr)\n s1 = revodd(revstring)\n s2 = reveven(revstring)\n s3 =right(string(s1+s2), 1)\n if s3 = \"0\"\n return \"Valid\"\n else\n return \"Invalid\"\n ok\n\nfunc revstr(str)\n strnew = \"\"\n for nr = len(str) to 1 step -1\n strnew = strnew + str[nr]\n next\n return strnew\n\nfunc revodd(str)\n strnew = \"\"\n for nr = 1 to len(str) step 2\n strnew = strnew + str[nr]\n next\n sumodd = 0\n for p = 1 to len(strnew)\n sumodd = sumodd + number(strnew[p])\n next\n return sumodd\n\nfunc reveven(str)\n strnew = \"\"\n for nr = 2 to len(str) step 2\n strnew = strnew + str[nr]\n next\n lsteven = []\n for p = 1 to len(strnew)\n add(lsteven, string(2*number(strnew[p])))\n next\n arreven = list(len(lsteven))\n for q = 1 to len(lsteven)\n sum = 0\n for w = 1 to len(lsteven[q])\n sum = sum + lsteven[q][w]\n next\n arreven[q] = sum\n next\n sumarr = 0\n for x = 1 to len(arreven)\n sumarr = sumarr + arreven[x]\n next\n return sumarr\n","language":"Ring"},{"code":" def luhn_valid?(str)\n str.scan(/\\d/).reverse #using str.to_i.digits fails for cases with leading zeros\n .each_slice(2)\n .sum { |i, k = 0| i.to_i + ((k.to_i)*2).digits.sum }\n .modulo(10).zero?\n end\n\n[\"49927398716\", \"49927398717\", \"1234567812345678\", \"1234567812345670\"].map{ |i| luhn_valid?(i) }\n","language":"Ruby"},{"code":"def luhn_valid?(n) # Card values can be numbers or strings\n d2sum = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\n sum, num = 0, n.to_i\n num.digits.each_with_index { |digit, i| sum += i.even? ? digit : d2sum[digit] }\n sum % 10 == 0\nend\n\ncards = [49927398716, \"49927398717\", 1234567812345678, \"1234567812345670\"]\ncards.each{ |i| puts \"#{i}: #{luhn_valid?(i)}\" }\n","language":"Ruby"},{"code":"card$(1) = \"49927398716\"\ncard$(2) = \"49927398717\"\ncard$(3) = \"1234567812345678\"\ncard$(4) = \"1234567812345670\"\n\nfor i = 1 to 4\nprint card$(i);\" \";luhn$(card$(i))\nnext i\n\nFUNCTION luhn$(card$)\n lc = len(card$)\n for i = lc to 1 step -1\n digit = val(mid$(card$,i,1))\n if ((lc -i) mod 2) = 0 then chkSum = chkSum + digit else chkSum = chkSum + int(digit * 2.2)\n next i\n if chkSum mod 10 = 0 then luhn$ = \"True\" else luhn$ = \"False\"\nend function\n","language":"Run-BASIC"},{"code":"extern crate luhn_test_of_credit_card_numbers;\n\nuse luhn_test_of_credit_card_numbers::luhn_test;\n\nfn validate_isin(isin: &str) -> bool {\n if !isin.chars().all(|x| x.is_alphanumeric()) || isin.len() != 12 {\n return false;\n }\n if !isin[..2].chars().all(|x| x.is_alphabetic())\n || !isin[2..12].chars().all(|x| x.is_alphanumeric())\n || !isin.chars().last().unwrap().is_numeric()\n {\n return false;\n }\n\n let bytes = isin.as_bytes();\n\n let s2 = bytes\n .iter()\n .flat_map(|&c| {\n if c.is_ascii_digit() {\n vec![c]\n } else {\n (c + 10 - ('A' as u8)).to_string().into_bytes()\n }\n })\n .collect::<Vec<u8>>();\n\n let string = std::str::from_utf8(&s2).unwrap();\n let number = string.parse::<u64>().unwrap();\n\n return luhn_test(number as u64);\n}\n\n#[cfg(test)]\nmod tests {\n use super::validate_isin;\n\n #[test]\n fn test_validate_isin() {\n assert_eq!(validate_isin(\"US0378331005\"), true);\n assert_eq!(validate_isin(\"US0373831005\"), false);\n assert_eq!(validate_isin(\"U50378331005\"), false);\n assert_eq!(validate_isin(\"US03378331005\"), false);\n assert_eq!(validate_isin(\"AU0000XVGZA3\"), true);\n assert_eq!(validate_isin(\"AU0000VXGZA3\"), true);\n assert_eq!(validate_isin(\"FR0000988040\"), true);\n }\n}\n","language":"Rust"},{"code":"object Luhn {\n private def parse(s: String): Seq[Int] = s.map{c =>\n assert(c.isDigit)\n c.asDigit\n }\n def checksum(digits: Seq[Int]): Int = {\n digits.reverse.zipWithIndex.foldLeft(0){case (sum,(digit,i))=>\n if (i%2 == 0) sum + digit\n else sum + (digit*2)/10 + (digit*2)%10\n } % 10\n }\n def validate(digits: Seq[Int]): Boolean = checksum(digits) == 0\n def checksum(number: String): Int = checksum(parse(number))\n def validate(number: String): Boolean = validate(parse(number))\n}\n\nobject LuhnTest extends App {\n Seq((\"49927398716\", true),\n (\"49927398717\", false),\n (\"1234567812345678\", false),\n (\"1234567812345670\", true)\n ).foreach { case (n, expected) =>\n println(s\"$n ${Luhn.validate(n)}\")\n assert(Luhn.validate(n) == expected)\n }\n}\n","language":"Scala"},{"code":" def luhnTest1(number: String): Boolean = {\n var (odd, sum) = (true, 0)\n\n for (int <- number.reverse.map { _.toString.toShort }) {\n if (odd) sum += int\n else sum += (int * 2 % 10) + (int / 5)\n odd = !odd\n }\n sum % 10 == 0\n }\n","language":"Scala"},{"code":"(define luhn\n (lambda (n)\n (let loop ((number n)\n (index 0)\n (result 0))\n (if (= 0 number)\n (= 0 (remainder result 10))\n (loop (quotient number 10)\n (+ index 1)\n (+ result\n (if (even? index)\n (remainder number 10)\n (let ((part (* 2 (remainder number 10))))\n (+ (remainder part 10) (quotient part 10))))))))))\n","language":"Scheme"},{"code":"# Split number into double evens and odds\ns/.*/&: /\n: split\ns/\\([0-4]\\)\\([0-9]\\):\\(.*\\) /:\\1\\1\\3 \\2/\ns/\\([5-9]\\)\\([0-9]\\):\\(.*\\) /:1\\1\\1\\3 \\2/\nt split\n\n# Set up addition lookup table\ns/\\([0-9]\\)*:\\(.*\\) \\(.*\\)/\\1\\2\\3:0123456789012345678/\n\n: add\ns/\\([0-9]\\)0:/\\1:/\ns/\\([0-9]\\)1:\\(.*\\1.\\{0\\}\\([0-9]\\).*\\)/\\3:\\2/\ns/\\([0-9]\\)2:\\(.*\\1.\\{1\\}\\([0-9]\\).*\\)/\\3:\\2/\ns/\\([0-9]\\)3:\\(.*\\1.\\{2\\}\\([0-9]\\).*\\)/\\3:\\2/\ns/\\([0-9]\\)4:\\(.*\\1.\\{3\\}\\([0-9]\\).*\\)/\\3:\\2/\ns/\\([0-9]\\)5:\\(.*\\1.\\{4\\}\\([0-9]\\).*\\)/\\3:\\2/\ns/\\([0-9]\\)6:\\(.*\\1.\\{5\\}\\([0-9]\\).*\\)/\\3:\\2/\ns/\\([0-9]\\)7:\\(.*\\1.\\{6\\}\\([0-9]\\).*\\)/\\3:\\2/\ns/\\([0-9]\\)8:\\(.*\\1.\\{7\\}\\([0-9]\\).*\\)/\\3:\\2/\ns/\\([0-9]\\)9:\\(.*\\1.\\{8\\}\\([0-9]\\).*\\)/\\3:\\2/\nt add\n\n/0:/a\\\nPass\n/0:/!a\\\nFail\nd\n","language":"Sed"},{"code":"$ include \"seed7_05.s7i\";\n\nconst func boolean: luhnTest (in string: cardNumber) is func\n result\n var boolean: luhnTest is FALSE;\n local\n var integer: index is 0;\n var integer: digit is 0;\n var boolean: isOdd is TRUE;\n var integer: oddSum is 0;\n var integer: evenSum is 0;\n begin\n for index range length(cardNumber) downto 1 do\n digit := integer parse str(cardNumber[index]);\n if isOdd then\n oddSum +:= digit;\n else\n evenSum +:= digit div 5 + (2 * digit) rem 10;\n end if;\n isOdd := not isOdd;\n end for;\n luhnTest := (oddSum + evenSum) rem 10 = 0;\n end func;\n\nconst proc: main is func\n local\n var string: cardNumber is \"\";\n begin\n for cardNumber range [] (\"49927398716\", \"49927398717\", \"1234567812345678\", \"1234567812345670\") do\n writeln(cardNumber <& \": \" <& luhnTest(cardNumber));\n end for;\n end func;\n","language":"Seed7"},{"code":"function LuhnCheck ccNum\n\tput length of ccNum into numDigits\n\tput the last character of ccNum into total\n\tput numDigits modulo 2 into parity\n\trepeat for each character of the first numDigits - 1 characters of ccNum\n\t\tput it into digit\n\t\tif (the counter - 1) modulo 2 equals parity\n\t\t\tmultiply digit by 2\t\n\t\tend if\n\t\tif digit is greater than 9\n\t\t\tsubtract 9 from digit\n\t\tend if\n\t\tadd digit to total\n\tend repeat\n\treturn total is divisible by 10\nend LuhnCheck\n","language":"SenseTalk"},{"code":"repeat for each item of (49927398716, 49927398717, 1234567812345678, 1234567812345670)\n\tput it && LuhnCheck(it)\nend repeat\n","language":"SenseTalk"},{"code":"main(args(2)) :=\n\tsum(luhnTest(asciiToInt(args[1]) - asciiToInt('0'))) mod 10 = 0;\n\ns2Mapping := [0,2,4,6,8,1,3,5,7,9];\n\nluhnTest(x(1))[i] :=\n\tx[i] when i mod 2 = size(x) mod 2 else\n\ts2Mapping[x[i] + 1];\n","language":"SequenceL"},{"code":"(define mapi\n _ _ [] -> []\n F N [X | Xs] -> [(F N X) | (mapi F (+ N 1) Xs)])\n\n(define double\n X -> (let Y (* 2 X) (if (> Y 9) (- Y 9) Y)))\n\n(define luhn?\n Number ->\n (let Exploded (explode Number)\n Digits (map (/. H (- (string->n H) 48)) Exploded)\n Reversed (reverse Digits)\n Doubled (mapi (/. N X (if (= 1 (shen.mod N 2)) (double X) X)) 0 Reversed)\n Summed (sum Doubled)\n Modded (shen.mod Summed 10)\n (= 0 Modded)))\n\n\"Expected: [true false false true]\"\n\n(map (function luhn?) [\"49927398716\" \"49927398717\" \"1234567812345678\" \"1234567812345670\"])\n","language":"Shen"},{"code":"func luhn (n) {\n static a = {|j| (2*j // 10) + (2*j % 10) }.map(^10)\n\n var checksum = n.digits.map_kv {|i,j|\n i.is_odd ? a[j] : j\n }.sum\n\n checksum % 10 == 0\n}\n\nfor n in [49927398716, 49927398717, 1234567812345678, 1234567812345670] {\n say [n, luhn(n)]\n}\n","language":"Sidef"},{"code":" define('luhn(n)a,d,i,j,sum') :(luhn_end)\nluhn n = reverse(n); a = array('0:9')\nln1 a<i> = (2 * i / 10) + remdr(2 * i,10)\n i = lt(i,9) i + 1 :s(ln1)\nln2 n len(1) . d = :f(ln3)\n d = ne(remdr(j,2),0) a<d>; j = j + 1\n sum = sum + d :(ln2)\nln3 luhn = 0; luhn = eq(remdr(sum,10),0) 1 :(return)\nluhn_end\n\n ok = array('0:1')\n ok<0> = 'FAIL'\n ok<1> = 'OK'\n\n* Test and display\n define('test(n)') :(test_end)\ntest output = n ': ' ok<luhn(n)> :(return)\ntest_end\n\n test('49927398716')\n test('49927398717')\n test('1234567812345678')\n test('1234567812345670')\nend\n","language":"SNOBOL4"},{"code":"#!/usr/local/bin/spar\npragma annotate( summary, \"luhn test of credit card numbers\" )\n @( description, \"The Luhn test is used by some credit card companies to \" )\n @( description, \"distinguish valid credit card numbers from what could be a random selection of digits.\" )\n @( see_also, \"https://rosettacode.org/wiki/Luhn_test_of_credit_card_number\" )\n @( author, \"Ken O. Burtch\" );\npragma license( unrestricted );\n\npragma restriction( no_external_commands );\n\nprocedure luhn is\n\n bad_digit : exception;\n\n -- return true if the card number passes the luhn test\n\n function is_luhn( card_number : string) return boolean is\n card_num_len : constant natural := strings.length( card_number );\n checksum: natural := 0;\n ch : character;\n begin\n for i in reverse 1..card_num_len loop\n ch := strings.element( card_number, i );\n if strings.is_digit( ch ) then\n declare\n ord : constant natural := numerics.pos(ch);\n begin\n if ((card_num_len-1) and (i-1) ) /= 0 then\n checksum := @ + ord;\n else\n checksum := @ + numerics.floor(ord / 5) + ((2*ord) mod 10);\n end if;\n end;\n else\n raise bad_digit;\n end if;\n end loop;\n return checksum mod 10 = 0;\n end is_luhn;\n\n -- check a credit card and display the result\n\n procedure check_card( card_number : string ) is\n begin\n put( card_number )\n @( \": \" )\n @( is_luhn( card_number ) );\n new_line;\n end check_card;\n\nbegin\n check_card(\"49927398716\");\n check_card(\"49927398717\");\n check_card(\"1234567812345678\");\n check_card(\"1234567812345670\");\nend luhn;\n","language":"SparForte"},{"code":"with Spark_IO;\n--# inherit Spark_IO;\n--# main_program;\nprocedure Luhn\n--# global in out Spark_IO.Outputs;\n--# derives Spark_IO.Outputs from *;\nis\n\n function Luhn_Test (Num : String) return Boolean\n --# pre Num'Last <= 20;\n is\n Sum : Integer := 0;\n Od : Boolean := True;\n Int : Integer;\n X : Integer;\n OK : Boolean := True;\n begin\n for P in reverse Integer range Num'Range loop\n Int := Character'Pos(Num(P)) - Character'Pos('0');\n if Int not in 0 .. 9 then\n OK := False;\n exit;\n end if;\n X := (((Int*2) mod 10) + (Int / 5));\n --# assert Num'Last - P in 0 .. 19\n --# and Sum in 0 .. (Num'Last - P) * 10\n --# and Int in 0 .. 9\n --# and X in 0 .. 10;\n if Od then\n Sum := Sum + Int;\n else\n Sum := Sum + X;\n end if;\n Od := not Od;\n end loop;\n return OK and (Sum mod 10) = 0;\n end Luhn_Test;\n\n procedure Do_Test (Num : in String)\n --# global in out Spark_IO.Outputs;\n --# derives Spark_IO.Outputs from *, Num;\n --# pre Num'Last <= 20;\n is\n begin\n Spark_IO.Put_String(Spark_IO.Standard_Output, Num, 16);\n if Luhn_Test(Num) then\n Spark_IO.Put_String(Spark_IO.Standard_Output, \" is valid.\", 0);\n else\n Spark_IO.Put_String(Spark_IO.Standard_Output, \" is not valid.\", 0);\n end if;\n Spark_IO.New_Line(Spark_IO.Standard_Output, 1);\n end Do_Test;\n\nbegin\n Do_Test(\"49927398716\");\n Do_Test(\"49927398717\");\n Do_Test(\"1234567812345678\");\n Do_Test(\"1234567812345670\");\n Do_Test(\"123456781234567D\");\nend Luhn;\n","language":"SPARK"},{"code":"--#SET TERMINATOR @\n\nSET SERVEROUTPUT ON @\n\nCREATE OR REPLACE FUNCTION LUHN_TEST (\n IN NUMBER VARCHAR(24)\n ) RETURNS SMALLINT\n --) RETURNS BOOLEAN\n BEGIN\n DECLARE TYPE CARD_NUMBER AS VARCHAR(1) ARRAY [24];\n DECLARE LENGTH SMALLINT;\n DECLARE REVERSE CARD_NUMBER;\n DECLARE I SMALLINT;\n DECLARE POS SMALLINT;\n DECLARE S1 SMALLINT;\n DECLARE S2 SMALLINT;\n DECLARE TEMP SMALLINT;\n DECLARE RET SMALLINT;\n --DECLARE RET BOOLEAN;\n DECLARE INVALID_CHAR CONDITION FOR SQLSTATE 'LUHN1';\n\n -- Reverse the order of the digits in the number.\n SET LENGTH = LENGTH(NUMBER);\n SET I = 1;\n WHILE (I <= LENGTH) DO\n SET POS = LENGTH - I + 1;\n SET REVERSE[POS] = SUBSTR(NUMBER, I, 1);\n IF (ASCII(REVERSE[POS]) < 48 OR 57 < ASCII(REVERSE[POS])) THEN\n SIGNAL INVALID_CHAR SET MESSAGE_TEXT = 'Invalid character, not a digit';\n END IF;\n SET I = I + 1;\n END WHILE;\n\n -- Take the first, third, ... and every other odd digit in the reversed digits and sum them to form the partial sum s1\n SET S1 = 0;\n SET I = 1;\n WHILE (I <= LENGTH) DO\n IF (MOD(I, 2) = 1) THEN\n SET S1 = S1 + REVERSE[I];\n END IF;\n -- CALL DBMS_OUTPUT.PUT_LINE('I ' || I || ', S1 ' || S1 || ', val ' || REVERSE[I]);\n SET I = I + 1;\n END WHILE;\n\n -- Taking the second, fourth ... and every other even digit in the reversed digits:\n SET S2 = 0;\n SET TEMP = 0;\n SET I = 1;\n WHILE (I <= LENGTH) DO\n IF (MOD(I, 2) = 0) THEN\n -- Multiply each digit by two and sum the digits if the answer is greater than nine to form partial sums for the even digits\n SET TEMP = REVERSE[I] * 2;\n IF (TEMP > 9) THEN\n SET TEMP = (TEMP / 10) + (MOD(TEMP, 10));\n END IF;\n -- Sum the partial sums of the even digits to form s2\n SET S2 = S2 + TEMP;\n END IF;\n -- CALL DBMS_OUTPUT.PUT_LINE('I ' || I || ', S2 ' || S2 || ', TEMP ' || TEMP || ' val ' || REVERSE[I]);\n SET I = I + 1;\n END WHILE;\n\n -- If s1 + s2 ends in zero then the original number is in the form of a valid credit card number as verified by the Luhn test.\n SET RET = 1;\n --SET RET = FALSE;\n SET TEMP = S1 + S2;\n IF (MOD(TEMP, 10) = 0) THEN\n SET RET = 0;\n --SET RET = TRUE;\n CALL DBMS_OUTPUT.PUT_LINE('It is a valid number ' || S1 || '+' || S2 || '=' || TEMP);\n ELSE\n CALL DBMS_OUTPUT.PUT_LINE('It is NOT a valid number ' || S1 || '+' || S2 || '=' || TEMP);\n END IF;\n RETURN RET;\n END\n@\n","language":"SQL-PL"},{"code":"local\n fun revDigits 0 = []\n | revDigits n = (n mod 10) :: revDigits (n div 10)\n\n fun digitSum n = if n > 9 then digitSum (n div 10 + n mod 10)\n else n\n\n fun luhn_sum [] = 0\n | luhn_sum [d] = d\n | luhn_sum (d::d'::ds) = d + digitSum (2*d') + luhn_sum ds\nin\n fun luhn_test n = luhn_sum (revDigits n) mod 10 = 0\n\n val res = map luhn_test [49927398716, 49927398717, 1234567812345678, 1234567812345670];\nend;\n\n(*\n[opening file \"luhn.sml\"]\n> val luhn_test = fn : int -> bool\n val res = [true, false, false, true] : bool list\n[closing file \"luhn.sml\"]\n*)\n","language":"Standard-ML"},{"code":"func luhn(_ number: String) -> Bool {\n return number.reversed().enumerated().map({\n let digit = Int(String($0.element))!\n let even = $0.offset % 2 == 0\n return even ? digit : digit == 9 ? 9 : digit * 2 % 9\n }).reduce(0, +) % 10 == 0\n}\n\nluhn(\"49927398716\") // true\nluhn(\"49927398717\") // false\n","language":"Swift"},{"code":"package require Tcl 8.5\nproc luhn digitString {\n if {[regexp {[^0-9]} $digitString]} {error \"not a number\"}\n set sum 0\n set flip 1\n foreach ch [lreverse [split $digitString {}]] {\n\tincr sum [lindex {\n\t {0 1 2 3 4 5 6 7 8 9}\n\t {0 2 4 6 8 1 3 5 7 9}\n\t} [expr {[incr flip] & 1}] $ch]\n }\n return [expr {($sum % 10) == 0}]\n}\n","language":"Tcl"},{"code":"foreach testNumber {\n 49927398716\n 49927398717\n 1234567812345678\n 1234567812345670\n} {\n puts [format \"%s is %s\" $testNumber \\\n\t [lindex {\"NOT valid\" \"valid\"} [luhn $testNumber]]]\n}\n","language":"Tcl"},{"code":"variable number {\n type = \"string\"\n}\n\nlocals {\n digits = reverse(split(\"\", var.number))\n count = length(local.digits)\n odds = [for i in range(local.count): local.digits[i] if i%2==0]\n evens = [for i in range(local.count): local.digits[i] if i%2==1]\n s1 = length(flatten([for d in local.odds: range(d)]))\n doubles = [for d in local.evens: d * 2]\n partials = [for d in local.doubles: d < 10 ? d : floor(d/10)+d%10]\n s2 = length(flatten([for p in local.partials: range(p)]))\n check = (local.s1 + local.s2) % 10\n}\n\noutput \"valid\" {\n value = local.check == 0\n}\n","language":"Terraform"},{"code":"PROGRAM:LUHN\n:Disp \"ENTER NUMBER\"\n:Input Str1\n:0→S\n:0→E\n:For(I,length(Str1),1,-1)\n :inString(\"0123456789\",sub(Str1,I,1))–1→X\n :If X<0\n :Goto BA\n :If E≠0\n :Then\n :2X→X\n :If X>9\n :X–9→X\n :End\n :X+S→S\n :not(E)→E\n:End\n:If fPart(S/10)=0\n:Then\n :Disp \"GOOD CARD\"\n:Else\n :Lbl BA\n :Disp \"BAD CARD\"\n:End\n","language":"TI-83-BASIC"},{"code":"CREATE FUNCTION dbo._CreditCardNumCheck( @strCCNum VarChar(40) )\nRETURNS VarChar(7)\nAS\nBEGIN\n\tDECLARE @string\t\t\tVarChar(40) = REVERSE(@strCCNum); -- usage: set once, never changed\n\tDECLARE @strS2Values\t\tVarChar(10) = '0246813579'; -- constant: maps digits to their S2 summed values\n\tDECLARE @table\t\t\tTABLE (ID INT, Value INT, S_Value INT); -- ID=digit position. S_Value is used for SUM().\n\tDECLARE @p\t\t\tINT = 0; -- loop counter: position in string\n\t-- Convert the reversed string's digits into rows in a table variable, S_Values to be updated afterwards\n\tWHILE @p < LEN(@string)\n\t\tBEGIN\n\t\t\tSET @p = @p+1;\n\t\t\tINSERT INTO @table (ID,Value,S_Value) VALUES (@p, CONVERT(INT,SUBSTRING(@string,@p,1)), 0);\n\t\tEND\n\t-- Update S_Value column : the digit's value to be summed (for even-positioned digits this is mapped via @strS2Values)\n\tUPDATE @table SET S_Value = CASE WHEN ID % 2 = 1 THEN Value ELSE CONVERT(INT,SUBSTRING(@strS2Values,Value+1,1)) END\n\t-- If the SUM of S_Values ends in 0 (modulo 10 = 0) then the CC Number is valid\n\tRETURN CASE WHEN (SELECT SUM(S_Value) FROM @table) % 10 = 0 THEN 'Valid' ELSE 'Invalid' END\nEND\n","language":"Transact-SQL"},{"code":"LET true = -1\nLET false = 0\n\nDIM card$(5)\nLET card$(1) = \"49927398716\"\nLET card$(2) = \"49927398717\"\nLET card$(3) = \"1234567812345678\"\nLET card$(4) = \"1234567812345670\"\n\nFOR test = 1 TO 4\n LET odd = true\n LET sum = 0\n FOR n = LEN(card$(test)) TO 1 STEP -1\n LET num = VAL((card$(test))[n:n+1-1])\n IF odd<>0 THEN\n LET sum = sum + num\n LET odd = false\n ELSE\n LET num = num*2\n IF num <= 9 THEN\n LET sum = sum + num\n ELSE\n LET sum = sum + VAL((STR$(num))[1:1]) + VAL((STR$(num))[LEN(STR$(num))-1+1:maxnum])\n END IF\n LET odd = true\n END IF\n NEXT n\n IF remainder(round(sum),10) = 0 THEN PRINT card$(test), \"True\" ELSE PRINT card$(test), \"False\"\nNEXT test\nEND\n","language":"True-BASIC"},{"code":"$$ MODE TUSCRIPT\nMODE DATA\n$$ SET cardnumbers=*\n49927398716\n49927398717\n1234567812345678\n1234567812345670\n$$ MODE TUSCRIPT\n-> collecting information for output-format\nSET length=MAX_LENGTH(cardnumbers)\nSET adjust=length+2\n\nLOOP c=cardnumbers\n-> \">/\" = any digit\nSET cstring=STRINGS (c,\":>/:\")\nSET creverse=REVERSE (cstring)\nSET s1=evenx2=esum=s2=\"\"\n LOOP n,oe=creverse\n SET modrest=MOD(n,2)\n IF (modrest==0) THEN\n SET even=oe*2\n IF (even>9) THEN\n SET estring=STRINGS (even,\":>/:\")\n SET esum=SUM (estring)\n SET s2=APPEND (s2,esum)\n ELSE\n SET s2=APPEND (s2,even)\n ENDIF\n ELSE\n SET s1=APPEND(s1,oe)\n ENDIF\n ENDLOOP\nSET s1=SUM(s1),s2=SUM(s2)\nSET checksum=s1+s2\nSET c=CENTER(c,-adjust)\nIF (checksum.ew.\"0\") THEN\n PRINT c,\"true\"\nELSE\n PRINT c,\"false\"\nENDIF\nENDLOOP\n","language":"TUSCRIPT"},{"code":"@(do (defun luhn (num)\n (for ((i 1) (sum 0))\n ((not (zerop num)) (zerop (mod sum 10)))\n ((inc i) (set num (trunc num 10)))\n (let ((dig (mod num 10)))\n (if (oddp i)\n (inc sum dig)\n (let ((dig2 (* 2 dig)))\n (inc sum (+ (trunc dig2 10) (mod dig2 10)))))))))\n@(collect :vars nil)\n@{ccnumber /[0-9]+/}\n@(output)\n@ccnumber -> @(if (luhn (int-str ccnumber 10)) \"good\" \"bad\")\n@(end)\n@(end)\n","language":"TXR"},{"code":"function luhn {\n typeset n p s t=('0123456789' '0516273849')\n while ((-n<${#1})); do\n p=\"${t[n--%2]%${1:n:1}*}\"\n ((s+=${#p}))\n done\n ((s%10))\n}\n\nfor c in 49927398716 49927398717 1234567812345678 1234567812345670; do\n if luhn $c; then\n echo $c is invalid\n else\n echo $c is valid\n fi\ndone\n","language":"UNIX-Shell"},{"code":"#import std\n#import nat\n\nluhn = %nP; %np*hxiNCNCS; not remainder\\10+ //sum:-0@DrlrHK32 ~&iK27K28TK25 iota10\n","language":"Ursala"},{"code":"#cast %bL\n\ntest = luhn* <49927398716,49927398717,1234567812345678,1234567812345670>\n","language":"Ursala"},{"code":"const (\n input = '49927398716\n49927398717\n1234567812345678\n1234567812345670'\n\n t = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\n)\n\nfn luhn(s string) bool {\n odd := s.len & 1\n mut sum := 0\n for i, c in s.split('') {\n if c < '0' || c > '9' {\n return false\n }\n if i&1 == odd {\n sum += t[c.int()-'0'.int()]\n } else {\n sum += c.int() - '0'.int()\n }\n }\n return sum%10 == 0\n}\n\nfn main() {\n for s in input.split(\"\\n\") {\n println('$s ${luhn(s)}')\n }\n}\n","language":"V-(Vlang)"},{"code":"Option Explicit\n\nSub Main()\n Debug.Print \"Number 49927398716 is \"; Luhn(\"49927398716\")\n Debug.Print \"Number 49927398717 is \"; Luhn(\"49927398717\")\n Debug.Print \"Number 1234567812345678 is \"; Luhn(\"1234567812345678\")\n Debug.Print \"Number 1234567812345670 is \"; Luhn(\"1234567812345670\")\nEnd Sub\nPrivate Function Luhn(Nb As String) As String\nDim t$, i&, Summ&, s&\n t = StrReverse(Nb)\n For i = 1 To Len(t) Step 2\n Summ = Summ + CInt(Mid(t, i, 1))\n Next i\n For i = 2 To Len(t) Step 2\n s = 2 * (CInt(Mid(t, i, 1)))\n If s >= 10 Then\n Summ = Summ - 9\n End If\n Summ = Summ + s\n Next i\n If Summ Mod 10 = 0 Then\n Luhn = \"valid\"\n Else\n Luhn = \"invalid\"\n End If\nEnd Function\n","language":"VBA"},{"code":"Function Luhn_Test(cc)\n\tcc = RevString(cc)\n\ts1 = 0\n\ts2 = 0\n\tFor i = 1 To Len(cc)\n\t\tIf i Mod 2 > 0 Then\n\t\t\ts1 = s1 + CInt(Mid(cc,i,1))\n\t\tElse\n\t\t\ttmp = CInt(Mid(cc,i,1))*2\n\t\t\tIf tmp < 10 Then\n\t\t\t\ts2 = s2 + tmp\n\t\t\tElse\n\t\t\t\ts2 = s2 + CInt(Right(CStr(tmp),1)) + 1\n\t\t\tEnd If\n\t\tEnd If\n\tNext\n\tIf Right(CStr(s1 + s2),1) = \"0\" Then\n\t\tLuhn_Test = \"Valid\"\n\tElse\n\t\tLuhn_Test = \"Invalid\"\n\tEnd If\nEnd Function\n\nFunction RevString(s)\n\tFor i = Len(s) To 1 Step -1\n\t\tRevString = RevString & Mid(s,i,1)\n\tNext\nEnd Function\n\nWScript.Echo \"49927398716 is \" & Luhn_Test(\"49927398716\")\nWScript.Echo \"49927398717 is \" & Luhn_Test(\"49927398717\")\t\t\t\nWScript.Echo \"1234567812345678 is \" & Luhn_Test(\"1234567812345678\")\nWScript.Echo \"1234567812345670 is \" & Luhn_Test(\"1234567812345670\")\n","language":"VBScript"},{"code":"Public Function LuhnCheckPassed(ByVal dgts As String) As Boolean\nDim i As Long, s As Long, s1 As Long\n dgts = VBA.StrReverse(dgts)\n For i = 1 To Len(dgts) Step 2\n s = s + CInt(Mid$(dgts, i, 1))\n Next i\n For i = 2 To Len(dgts) Step 2\n s1 = 2 * (CInt(Mid$(dgts, i, 1)))\n If s1 >= 10 Then\n s = s - 9\n End If\n s = s + s1\n Next i\n LuhnCheckPassed = Not CBool(s Mod 10)\nEnd Function\n","language":"Visual-Basic"},{"code":"Sub Main()\n Debug.Assert LuhnCheckPassed(\"49927398716\")\n Debug.Assert Not LuhnCheckPassed(\"49927398717\")\n Debug.Assert Not LuhnCheckPassed(\"1234567812345678\")\n Debug.Assert LuhnCheckPassed(\"1234567812345670\")\nEnd Sub\n","language":"Visual-Basic"},{"code":" Imports System.Linq\n Function ValidLuhn(value As String)\n Return value.Select(Function(c, i) (AscW(c) - 48) << ((value.Length - i - 1) And 1)).Sum(Function(n) If(n > 9, n - 9, n)) Mod 10 = 0\n End Function\n Sub Main()\n Console.WriteLine(ValidLuhn(\"49927398716\"))\n Console.WriteLine(ValidLuhn(\"49927398717\"))\n Console.WriteLine(ValidLuhn(\"1234567812345678\"))\n Console.WriteLine(ValidLuhn(\"1234567812345670\"))\n End Sub\n","language":"Visual-Basic-.NET"},{"code":"import \"./fmt\" for Fmt\nimport \"./iterate\" for Stepped\n\nvar luhn = Fn.new { |s|\n // reverse digits\n s = s[-1..0]\n // sum the odd digits\n var s1 = Stepped.new(s, 2).reduce(0) { |sum, d| sum + d.bytes[0] - 48 }\n // sum two times the even digits\n var s2 = Stepped.new(s[1..-1], 2).reduce(0) { |sum, d|\n var d2 = (d.bytes[0] - 48) * 2\n return sum + ((d2 > 9) ? d2%10 + 1 : d2)\n }\n // check if s1 + s2 ends in zero\n return (s1 + s2)%10 == 0\n}\n\nvar tests = [ \"49927398716\", \"49927398717\", \"1234567812345678\", \"1234567812345670\"]\nfor (test in tests) {\n var ans = (luhn.call(test)) ? \"pass\" : \"fail\"\n Fmt.print(\"$-16s -> $s\", test, ans)\n}\n","language":"Wren"},{"code":"Public Function Modulus10(digits As String) as String\n //\n // Confirm the digits are really, well, digits\n //\n\n dim validator as new RegEx\n validator.SearchPattern = \"\\A\\d+\\z\"\n if validator.Search( digits ) is nil then\n //\n // Raise an exception or something\n //\n end if\n\n static doublingTable() as string = array( \"0\", \"2\", \"4\", \"6\", \"8\", \"1\", \"3\", \"5\", \"7\", \"9\" )\n\n dim digitArr() as string = digits.Split( \"\" )\n for i as integer = digitArr.Ubound downto 0 step 2\n digitArr( i ) = doublingTable( digitArr( i ).Val )\n next\n\n dim sum as integer\n for each digit as string in digitArr\n sum = sum + digit.Val\n next\n\n dim check as integer = ( sum * 9 ) mod 10\n return str( check )\nEnd Function\n\nPublic Function ValidateMod10(digits As String) as Boolean\n dim checkDigit as string = digits.Right( 1 )\n digits = digits.Left( digits.Len - 1 )\n\n return Modulus10( digits ) = checkDigit\nEnd Function\n","language":"Xojo"},{"code":"string 0; \\use zero-terminated strings\n\nfunc Valid(Str); \\Return 'true' if digits in Str pass Luhn test\nchar Str;\nint Len, Sum, I, Dig;\n[Len:= 0; \\find length of Str\nwhile Str(Len) do Len:= Len+1;\nSum:= 0; \\sum even and odd digits\nfor I:= 0 to Len-1 do \\(no need to reverse)\n [if (I xor Len) and 1 then\n Sum:= Sum + Str(I) - ^0\n else [Dig:= Str(I) - ^0;\n Dig:= Dig*2;\n Sum:= Sum + Dig/10 + rem(0);\n ];\n ];\nreturn rem(Sum/10) = 0;\n];\n\nint Luhn, N;\n[Luhn:= [\"49927398716\",\n \"49927398717\",\n \"1234567812345678\",\n \"1234567812345670\"];\nfor N:= 0 to 4-1 do\n [Text(0, Luhn(N));\n Text(0, if Valid(Luhn(N))\n then \" is valid\"\n else \" is not valid\");\n CrLf(0);\n ];\n]\n","language":"XPL0"},{"code":"dim card$(5)\ncard$(1)=\"49927398716\"\ncard$(2)=\"49927398717\"\ncard$(3)=\"1234567812345678\"\ncard$(4)=\"1234567812345670\"\n\nfor test = 1 to 4\n odd = true\n sum = 0\n for n = len(card$(test)) to 1 step -1\n num = val(mid$(card$(test),n,1))\n if odd then\n sum = sum + num\n odd = false\n else\n num = num * 2\n if num <= 9 then\n sum = sum + num\n else\n sum = sum + val(left$(str$(num),1)) + val(right$(str$(num),1))\n fi\n odd = true\n fi\n next\n if mod(sum, 10) = 0 then\n print card$(test), chr$(9), \"True\"\n else\n print card$(test), chr$(9), \"False\"\n fi\nnext test\n","language":"Yabasic"},{"code":"fcn luhnTest(n){\n 0 == (n.split().reverse().reduce(fcn(s,n,clk){\n s + if(clk.next()) n else 2*n%10 + n/5 },0,Walker.cycle(1,0)) %10)\n}\n","language":"Zkl"},{"code":"T(49927398716,49927398717,1234567812345678,1234567812345670)\n.apply(luhnTest).println();\n","language":"Zkl"},{"code":"10 LET c$=\"49927398716\": GO SUB 1000\n20 LET c$=\"49927398717\": GO SUB 1000\n30 LET c$=\"1234567812345678\": GO SUB 1000\n40 LET c$=\"1234567812345670\": GO SUB 1000\n999 STOP\n1000 REM *************\n1001 REM * LUHN TEST *\n1002 REM *************\n1010 LET r$=\"\"\n1020 FOR i=LEN c$ TO 1 STEP -1\n1030 LET r$=r$+c$(i)\n1040 NEXT i\n1050 LET s1=0: LET s2=0\n1060 FOR i=1 TO LEN r$ STEP 2\n1070 LET s1=s1+VAL r$(i)\n1080 NEXT i\n1090 FOR i=2 TO LEN r$ STEP 2\n1100 LET s2sub=VAL r$(i)*2\n1110 IF s2sub>=10 THEN LET s2sub=1+s2sub-10\n1120 LET s2=s2+s2sub\n1130 NEXT i\n1140 LET s$=STR$ (s1+s2)\n1150 IF s$(LEN s$)=\"0\" THEN PRINT c$;\" VALID!\": LET retval=1: RETURN\n1160 PRINT c$;\" INVALID!\": LET retval=0: RETURN\n","language":"ZX-Spectrum-Basic"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Luhn_test_of_credit_card_numbers\\nnote: Checksums\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"The [[wp:Luhn algorithm|Luhn test]] is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits.\\n\\nThose companies using credit card numbers that can be validated by the Luhn test have numbers that pass the following test:\\n# Reverse the order of the digits in the number.\\n# Take the first, third, ... and every other odd digit in the reversed digits and sum them to form the partial sum s1\\n# Taking the second, fourth ... and every other even digit in the reversed digits:\\n:# Multiply each digit by two and sum the digits if the answer is greater than nine to form partial sums for the even digits\\n:# Sum the partial sums of the even digits to form s2\\n# If s1 + s2 ends in zero then the original number is in the form of a valid credit card number as verified by the Luhn test.\\n\\n<br>\\nFor example, if the trial number is 49927398716:\\n<pre>Reverse the digits:\\n 61789372994\\nSum the odd digits:\\n 6 + 7 + 9 + 7 + 9 + 4 = 42 = s1\\nThe even digits:\\n 1, 8, 3, 2, 9\\n Two times each even digit:\\n 2, 16, 6, 4, 18\\n Sum the digits of each multiplication:\\n 2, 7, 6, 4, 9\\n Sum the last:\\n 2 + 7 + 6 + 4 + 9 = 28 = s2\\n\\ns1 + s2 = 70 which ends in zero which means that 49927398716 passes the Luhn test</pre>\\n\\n\\n;Task:\\nWrite a function/method/procedure/subroutine that will validate a number with the Luhn test, and \\n<br>use it to validate the following numbers:\\n 49927398716\\n 49927398717\\n 1234567812345678\\n 1234567812345670\\n\\n<br>\\n;Related tasks:\\n* [[SEDOLs|SEDOL]]\\n* [[Calculate International Securities Identification Number|ISIN]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F luhn(n)\\n V ch = String(n)\\n V sum = 0\\n V chParity = ch.len % 2\\n L(i) (ch.len-1 .. 0).step(-1)\\n V j = Int(ch[i])\\n I (i + 1) % 2 != chParity\\n j *= 2\\n I j > 9\\n j -= 9\\n sum += j\\n R sum % 10 == 0\\n\\nL(n) (49927398716,\\n 49927398717,\\n 1234567812345678,\\n 1234567812345670)\\n print(luhn(n))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Luhn test of credit card numbers 22/05/2016\\nLUHNTEST CSECT\\n USING LUHNTEST,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 R9,T @t(k)\\n LA R8,N for n\\nLOOPK EQU * for k=1 to n\\n LR R4,R9 @t(k),@s[1]\\n LA R6,1 from i=1\\n LA R7,M to m\\nLOOPI1 CR R6,R7 for i=1 to m\\n BH ELOOPI1 leave i\\n CLI 0(R4),C' ' if mid(s,i,1)=\\\" \\\"\\n BNE ITERI1 then\\n BCTR R6,0 i-1\\n ST R6,L l=i-1\\n B ELOOPI1 exit for\\n* end if\\nITERI1 LA R4,1(R4) next @s[i]\\n LA R6,1(R6) i=i+1\\n B LOOPI1 next i\\nELOOPI1 EQU * out of loop i\\n MVC W,BLANK w=\\\" \\\"\\n LA R4,W iw=@w\\n LR R5,R9 is=@s\\n A R5,L is=@s+l\\n BCTR R5,0 is=s+l-1\\n L R6,L i=l\\n LA R7,1 to 1\\nLOOPI2 CR R6,R7 for i=l to 1 by -1\\n BL ELOOPI2 leave i\\n MVC 0(1,R4),0(R5) mid(w,iw,1)=mid(s,is,1)\\n LA R4,1(R4) iw=iw+1\\n BCTR R5,0 is=is-1\\n BCTR R6,0 i=i-1\\n B LOOPI2 next i\\nELOOPI2 EQU * out of loop i\\n LA R11,0 s1=0\\n LA R12,0 s2=0\\n LA R6,1 i=1\\n L R7,L to l\\nLOOPI3 CR R6,R7 for i=1 to l\\n BH ELOOPI3 leave i\\n LA R2,W-1 @w-1\\n AR R2,R6 w[i]\\n MVC CI,0(R2) ci=mid(w,i,1)\\n NI CI,X'0F' zap upper half byte\\n LR R4,R6 i\\n SRDA R4,32 >>32\\n D R4,=F'2' i/2\\n LTR R4,R4 if mod(i,2)>0\\n BNH NOTMOD then\\n XR R2,R2 clear\\n IC R2,CI z=cint(mid(w,i,1))\\n AR R11,R2 s1=s1+cint(mid(w,i,1))\\n B EIFMOD else\\nNOTMOD XR R2,R2 clear\\n IC R2,CI cint(mid(w,i,1))\\n SLA R2,1 *2\\n ST R2,Z z=cint(mid(w,i,1))*2\\n C R2,=F'10' if z<10\\n BNL GE10 then\\n A R12,Z s2=s2+z\\n B EIF10 else\\nGE10 L R2,Z z\\n CVD R2,PL8 binary to packed\\n UNPK CL16,PL8 packed to zoned\\n OI CL16+15,X'F0' zoned to char (zap sign)\\n MVC X(1),CL16+15 x=right(cstr(z),1)\\n NI X,X'0F' zap upper half byte\\n XR R2,R2 r2=0\\n IC R2,X r2=cint(right(cstr(z),1))\\n AR R12,R2 s2=s2+r2\\n LA R12,1(R12) s2=s2+cint(right(cstr(z),1))+1\\nEIF10 EQU * end if\\nEIFMOD EQU * end if\\n LA R6,1(R6) i=i+1\\n B LOOPI3 next i\\nELOOPI3 EQU * out of loop i\\n LR R1,R11 s1\\n AR R1,R12 s1+s2\\n CVD R1,PL8 binary to packed\\n UNPK CL16,PL8 packed to zoned\\n CLI CL16+15,X'C0' if right(cstr(s1+s2),1)=\\\"0\\\"\\n BNE NOTZERO then\\n MVC R,=CL8'Valid' r=\\\"Valid\\\"\\n B ECLI else\\nNOTZERO MVC R,=CL8'Invalid' r=\\\"Invalid\\\"\\nECLI EQU * end if\\n MVC PG(M),0(R9) t(k)\\n MVC PG+M+1(L'R),R r\\n XPRNT PG,L'PG print buffer\\n LA R9,M(R9) at=at+m\\n BCT R8,LOOPK next k\\n L R13,4(0,R13) epilog\\n LM R14,R12,12(R13) \\\"\\n XR R15,R15 \\\"\\n BR R14 exit\\nN EQU (TEND-T)/L'T\\nM EQU 20\\nT DC CL(M)'49927398716 '\\n DC CL(M)'49927398717 '\\n DC CL(M)'1234567812345678 '\\n DC CL(M)'1234567812345670 '\\nTEND DS 0C\\nW DS CL(M)\\nBLANK DC CL(M)' '\\nL DS F\\nZ DS F\\nPL8 DS PL8\\nCL16 DS CL16\\nCI DS C\\nX DS C\\nR DS CL8\\nPG DC CL80' ' buffer\\n YREGS\\n END LUHNTEST\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"\\torg\\t100h\\n\\tjmp \\tdemo\\n\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t;;;\\tCheck if the 0-terminated string at HL passes the Luhn test.\\n\\t;;;\\tReturns with carry clear if the string passes, carry set\\n\\t;;;\\tif the string fails.\\nluhn:\\tmvi\\tb,0\\t; Counter\\n\\tmov\\td,b\\t; D = S1+S2 (we don't need to keep them separate)\\nlscan:\\tmov\\ta,m\\t; Get byte\\n\\tinx \\th\\t; Increment pointer\\n\\tinr\\tb\\t; Increment counter\\n\\tana\\ta\\t; Is it 0?\\n\\tjnz\\tlscan\\t; If not, try next byte\\n\\tdcx\\th\\t; Go to the byte before the 0\\n\\tdcx\\th\\n\\tdcr\\tb\\t; Decrement counter\\n\\trz\\t\\t; If 0, the string was empty, return.\\nlloop:\\tmvi\\tc,'0'\\t; ASCII zero\\n\\tmov\\ta,d\\t; Add odd digit to the total\\n\\tadd\\tm\\n\\tsub\\tc\\t; Subtract ASCII zero\\n\\tmov\\td,a\\n\\tdcr\\tb\\t; If last digit, we're done\\n\\tjz\\tldone\\n\\tdcx\\th\\t; Go back one byte\\n\\tmov\\ta,m\\t; Get even digit\\n\\tsub\\tc\\t; Subtract ASCII zero\\n\\tadd\\ta\\t; Multiply by two\\n\\tmvi\\tc,9\\t; 10-1, compensate for extra subtraction loop\\nldiv:\\tinr\\tc\\t; Find two digits using trial subtraction\\n\\tsui\\t10\\t\\t\\n\\tjnc\\tldiv\\n\\tadd\\tc\\t; Add the possible second digit in\\n\\tadd\\td\\t; Add it to the total\\n\\tmov\\td,a\\n\\tdcx\\th\\t; Go back one byte\\n\\tdcr\\tb\\t; Done yet?\\n\\tjnz\\tlloop\\nldone:\\tmov\\ta,d\\t; See if total is divisible by 10\\n\\tmvi\\tb,10\\nlchk:\\tsub\\tb\\t; Trial subtraction, subtract 10\\n\\trz\\t\\t; If zero, it is divisible, return (carry clear)\\n\\trc\\t\\t; If carry, it is not divisible, return (carry set)\\n\\tjmp\\tlchk\\n\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t;;;\\tRun the routine on the argument given on the CP/M command line\\ndemo:\\tlxi\\th,80h\\t; Zero-terminate the command line argument\\n\\tmov\\ta,m\\n\\tadd\\tl\\n\\tmov\\tl,a\\n\\tinr\\tl\\n\\tmvi\\tm,0\\n\\tmvi\\tl,82h\\t; Run the 'luhn' subroutine\\n\\tcall \\tluhn\\n\\tmvi\\tc,9\\n\\tlxi\\td,pass\\t; Carry clear = print 'Pass'\\n\\tjnc\\t5\\n\\tlxi\\td,fail\\t; Carry set = print 'Fail'\\n\\tjmp\\t5\\npass:\\tdb\\t'Pass$'\\nfail:\\tdb\\t'Fail$'\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \"\\tbits\\t16\\n\\tcpu\\t8086\\n\\torg\\t100h\\nsection\\t.text\\n\\tjmp\\tdemo\\t\\n\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t;;; \\tCheck whether the 0-terminated string at DS:SI passes the Luhn\\n\\t;;; \\ttest. Returns with carry clear if the string passes, carry\\n\\t;;;\\tset if the string fails.\\nluhn:\\tpush\\tes\\t; Keep original ES, and set ES=DS so SCASB can be used.\\n\\tpush\\tds\\t; \\\"REP DS:SCASB\\\" is a bad idea, because the 286 has a\\n\\tpop\\tes\\t; bug where it \\\"forgets\\\" the 2nd prefix if interrupted!\\n\\tmov\\tdi,si\\t; DI = pointer\\n\\txor\\tax,ax\\t; Zero to test against\\n\\txor\\tbl,bl\\t; BL = S1+S2\\n\\tmov\\tdx,0A30h\\t; DH = 10 (divisor), DL = '0' (ASCII zero)\\n\\txor\\tcx,cx\\t; Set counter to 65535\\n\\tdec\\tcx\\n\\tcld\\t\\t; Seek forwards\\n\\trepnz\\tscasb\\t; Find zero\\n\\tdec\\tdi\\t; SCASB goes one byte too far\\n\\txchg\\tsi,di\\t; SI = pointer, DI = end (or rather, beginning)\\n\\tmov\\tcx,si\\t; CX = counter\\n\\tsub\\tcx,di\\n\\tjcxz\\t.done\\t; Empty string = stop\\n\\tdec\\tsi\\t; We don't need the zero itself\\n\\tstd\\t\\t; Seek backwards\\n.loop:\\tlodsb\\t\\t; Get number in odd position\\n\\tsub\\tal,dl\\t; Subtract ASCII zero\\n\\tadd\\tbl,al\\t; Add to total\\n\\tdec\\tcx\\t; One fewer character\\n\\tjz\\t.done\\t; No more characters = stop\\n\\tlodsb\\t\\t; Get number in even position\\n\\tsub\\tal,dl\\t; Subtract ASCII zero\\n\\tadd\\tal,al\\t; Multiply by two\\n\\txor\\tah,ah\\t; AX = AL\\n\\tdiv\\tdh\\t; Divide by 10; AL=quotient, AH=remainder\\n\\tadd\\tal,ah\\t; Add the two \\\"digits\\\" together\\n\\tadd\\tbl,al\\t; Add to total\\n\\tloop \\t.loop\\t; Decrement CX and loop\\n.done:\\txor\\tah,ah\\t; Divide total by 10\\n\\tmov\\tal,bl\\n\\tdiv\\tdh\\n\\tand\\tah,ah\\t; If remainder 0, then return with carry clear\\n\\tjz\\t.out\\n\\tstc\\t\\t; Set carry (remainder wasn't 0, the test failed)\\n.out:\\tcld\\t\\t; Clean up: clear direction flag,\\n\\tpop\\tes\\t; and restore ES.\\n\\tret\\n\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t;;;\\tRun the 'luhn' routine on the argument given on the MS-DOS\\n\\t;;;\\tcommand line.\\ndemo:\\tmov\\tsi,80h\\t\\t\\t; Zero-terminate the argument\\n\\txor\\tbh,bh\\n\\tmov\\tbl,[si]\\n\\tmov\\t[si+bx+1],bh\\n\\tinc\\tsi\\n\\tinc\\tsi\\n\\tcall \\tluhn\\t\\t\\t; Call the routine\\n\\tmov\\tah,9\\n\\tmov\\tdx,pass\\t\\t\\t; If carry is clear, print 'Pass'\\n\\tjnc\\tprint\\n\\tmov\\tdx,fail\\t\\t\\t; Otherwise, print 'fail'\\nprint:\\tint\\t21h\\n\\tret\\nsection\\t.data\\npass:\\tdb\\t'Pass$'\\nfail:\\tdb\\t'Fail$'\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \"\\\\ Adapted from the C version:\\n: remap \\\\ n1 -- n2\\n [0,2,4,6,8,1,3,5,7,9]\\n swap caseof ;\\n\\n: luhn \\\\ s -- f\\n 0 swap\\n s:rev\\n (\\n '0 n:-\\n swap 2 n:mod if remap then\\n n:+\\n ) s:each\\n 10 n:mod not ;\\n\\n: test-luhn \\\\ s --\\n dup . space\\n luhn if \\\"OK\\\" else \\\"FAIL\\\" then . cr ;\\n\\n\\\"49927398716\\\" test-luhn\\n\\\"49927398717\\\" test-luhn\\n\\\"1234567812345678\\\" test-luhn\\n\\\"1234567812345670\\\" test-luhn\\n\\nbye\\n\",\n \"language\": \"8th\"\n },\n {\n \"code\": \"METHOD luhn_check.\\n\\n DATA: sum(1) TYPE n VALUE 0. \\\" Sum of checksum.\\n DATA: current TYPE i. \\\" Current digit.\\n DATA: odd TYPE i VALUE 1. \\\" Multiplier.\\n DATA: len TYPE i. \\\" String crowler.\\n\\n\\n \\\" Luhn algorithm.\\n len = NUMOFCHAR( pi_string ) - 1.\\n WHILE ( len >= 0 ).\\n current = pi_string+len(1) * odd.\\n IF ( current > 9 ).\\n current = current - 9. \\\" Digits sum.\\n ENDIF.\\n sum = sum + current.\\n odd = 3 - odd. \\\" 1 <--> 2 Swich\\n len = len - 1. \\\" Move to next charcter.\\n ENDWHILE.\\n\\n \\\" Validation check.\\n IF ( sum = 0 ).\\n pr_valid = abap_true.\\n ELSE.\\n pr_valid = abap_false.\\n ENDIF.\\n\\nENDMETHOD.\\n\",\n \"language\": \"ABAP\"\n },\n {\n \"code\": \"(include-book \\\"arithmetic-3/top\\\" :dir :system)\\n\\n(defun digits (n)\\n (if (zp n)\\n nil\\n (cons (mod n 10)\\n (digits (floor n 10)))))\\n\\n(defun sum (xs)\\n (if (endp xs)\\n 0\\n (+ (first xs)\\n (sum (rest xs)))))\\n\\n(defun double-and-sum-digits (xs)\\n (if (endp xs)\\n nil\\n (cons (sum (digits (* 2 (first xs))))\\n (double-and-sum-digits (rest xs)))))\\n\\n(defun dmx (xs)\\n (if (endp (rest xs))\\n (mv xs nil)\\n (mv-let (odds evens)\\n (dmx (rest (rest xs)))\\n (mv (cons (first xs) odds)\\n (cons (second xs) evens)))))\\n\\n(defun luhn (n)\\n (mv-let (odds evens)\\n (dmx (digits n))\\n (= (mod (+ (sum odds)\\n (sum (double-and-sum-digits evens)))\\n 10)\\n 0)))\\n\",\n \"language\": \"ACL2\"\n },\n {\n \"code\": \"PROC ReverseDigits(CHAR ARRAY n,rev)\\n BYTE i,j\\n\\n i=n(0)\\n WHILE i>0 AND n(i)='0\\n DO\\n i==-1\\n OD\\n\\n j=1\\n WHILE i>0\\n DO\\n rev(j)=n(i)\\n j==+1 i==-1\\n OD\\n rev(0)=j-1\\nRETURN\\n\\nBYTE FUNC SumOddDigits(CHAR ARRAY n)\\n BYTE sum,i\\n\\n sum=0\\n FOR i=1 TO n(0) STEP 2\\n DO\\n sum==+ValB(n(i))\\n OD\\nRETURN(sum)\\n\\nBYTE FUNC SumEvenDigitsMultiplied(CHAR ARRAY n)\\n BYTE sum,i,v\\n\\n sum=0\\n FOR i=2 TO n(0) STEP 2\\n DO\\n v=ValB(n(i))*2\\n IF v>9 THEN v==-9 FI\\n sum==+v\\n OD\\nRETURN(sum)\\n\\nBYTE FUNC Luhn(CHAR ARRAY n)\\n CHAR ARRAY rev(20)\\n BYTE s1,s2\\n\\n ReverseDigits(n,rev)\\n s1=SumOddDigits(rev)\\n s2=SumEvenDigitsMultiplied(rev)\\n\\n IF (s1+s2) MOD 10=0 THEN\\n RETURN(1)\\n FI\\nRETURN(0)\\n\\nPROC Test(CHAR ARRAY n)\\n PrintF(\\\"%S is \\\",n)\\n IF Luhn(n) THEN\\n PrintE(\\\"valid\\\")\\n ELSE\\n PrintE(\\\"invalid\\\")\\n FI\\nRETURN\\n\\nPROC Main()\\n Test(\\\"49927398716\\\")\\n Test(\\\"49927398717\\\")\\n Test(\\\"1234567812345678\\\")\\n Test(\\\"1234567812345670\\\")\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"function isValid(numString:String):Boolean\\n{\\n\\tvar isOdd:Boolean = true;\\n\\tvar oddSum:uint = 0;\\n\\tvar evenSum:uint = 0;\\n\\tfor(var i:int = numString.length - 1; i >= 0; i--)\\n\\t{\\n\\t\\tvar digit:uint = uint(numString.charAt(i))\\n\\t\\tif(isOdd) oddSum += digit;\\n\\t\\telse evenSum += digit/5 + (2*digit) % 10;\\n\\t\\tisOdd = !isOdd;\\n\\t}\\n\\tif((oddSum + evenSum) % 10 == 0) return true;\\n\\treturn false;\\n}\\n\\ntrace(isValid(\\\"49927398716\\\"));\\ntrace(isValid(\\\"49927398717\\\"));\\ntrace(isValid(\\\"1234567812345678\\\"));\\ntrace(isValid(\\\"1234567812345670\\\"));\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\nuse Ada.Text_IO;\\n\\nprocedure Luhn is\\n\\n function Luhn_Test (Number: String) return Boolean is\\n Sum : Natural := 0;\\n Odd : Boolean := True;\\n Digit: Natural range 0 .. 9;\\n begin\\n for p in reverse Number'Range loop\\n Digit := Integer'Value (Number (p..p));\\n if Odd then\\n Sum := Sum + Digit;\\n else\\n Sum := Sum + (Digit*2 mod 10) + (Digit / 5);\\n end if;\\n Odd := not Odd;\\n end loop;\\n return (Sum mod 10) = 0;\\n end Luhn_Test;\\n\\nbegin\\n\\n Put_Line (Boolean'Image (Luhn_Test (\\\"49927398716\\\")));\\n Put_Line (Boolean'Image (Luhn_Test (\\\"49927398717\\\")));\\n Put_Line (Boolean'Image (Luhn_Test (\\\"1234567812345678\\\")));\\n Put_Line (Boolean'Image (Luhn_Test (\\\"1234567812345670\\\")));\\n\\nend Luhn;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"PROC to int = (CHAR c)INT:\\n ABS c - ABS \\\"0\\\";\\n\\nPROC confirm = (STRING id)BOOL:\\n(\\n BOOL is odd digit := TRUE;\\n INT s := 0;\\n STRING cp;\\n\\n FOR cp key FROM UPB id BY -1 TO LWB id DO\\n INT k := to int(id[cp key]);\\n s +:=\\n IF is odd digit THEN k\\n ELIF k /= 9 THEN 2*k MOD 9\\n ELSE 9\\n FI;\\n is odd digit := NOT is odd digit\\n OD;\\n 0 = s MOD 10\\n);\\n\\nmain:\\n(\\n []STRING t cases = (\\n \\\"49927398716\\\",\\n \\\"49927398717\\\",\\n \\\"1234567812345678\\\",\\n \\\"1234567812345670\\\"\\n );\\n FOR cp key TO UPB t cases DO\\n STRING cp = t cases[cp key];\\n print((cp, \\\": \\\", confirm(cp), new line))\\n OD\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"% returns true if ccNumber passes the Luhn test, false otherwise %\\n% as Algol W has fixed length strings, the length of the number %\\n% must be specified in ccLength %\\nlogical procedure LuhnTest ( string(32) value ccNumber\\n ; integer value ccLength\\n ) ;\\nbegin\\n integer checkSum;\\n logical oddDigit, isValid;\\n checkSum := 0;\\n isValid := oddDigit := true;\\n for cPos := ccLength step -1 until 1 do begin\\n integer digit;\\n digit := decode( ccNumber( cPos - 1 // 1 ) ) - decode( \\\"0\\\" );\\n if digit < 0 or digit > 9 then isValid := false\\n else if oddDigit\\n then checkSum := checkSum + digit\\n else checkSum := checkSum + ( case digit + 1 of ( 0, 2, 4, 6, 8\\n , 1, 3, 5, 7, 9\\n )\\n );\\n oddDigit := not oddDigit\\n end for_cPos ;\\n isValid and ( ( checkSum rem 10 ) = 0 )\\nend LuhnTest\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"begin\\n % external procedure that returns true if ccNumber passes the Luhn test, false otherwise %\\n logical procedure LuhnTest ( string(32) value ccNumber\\n ; integer value ccLength\\n ) ; algol \\\"LUHN\\\" ;\\n\\n\\n % task test cases %\\n\\n procedure testLuhnTest ( string(32) value ccNumber\\n ; integer value ccLength\\n ) ;\\n write( s_w := 0, ccNumber, if LuhnTest( ccNumber, ccLength ) then \\\" is valid\\\" else \\\" is invalid\\\" );\\n\\n testLuhnTest( \\\"49927398716\\\", 11 );\\n testLuhnTest( \\\"49927398717\\\", 11 );\\n testLuhnTest( \\\"1234567812345678\\\", 16 );\\n testLuhnTest( \\\"1234567812345670\\\", 16 )\\n\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"LuhnTest←{\\n digits←⍎¨⍵ ⍝ Characters to digits\\n doubled←2∘×@(⌽⍤~1 0⍴⍨≢)⊢digits ⍝ Double every other digit\\n partial←-∘9@(9∘<)⊢doubled ⍝ Subtract 9 is equivalent to sum of digits for the domain 10≤x≤19\\n 0=10|+/partial ⍝ Valid if sum is a multiple of 10\\n }\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \" ∇ ret←LuhnTest num;s1;s2\\n[1] num←⌽((⌈10⍟num)/10)⊤num\\n[2] s1←+/((⍴num)⍴1 0)/num\\n[3] s2←+/∊(⊂10 10)⊤¨2×((⍴num)⍴0 1)/num\\n[4] ret←0=10⊤s1+s2\\n ∇\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"-- luhn :: String -> Bool\\non luhn(s)\\n -- True if the digit string represents\\n -- a valid Luhn credit card number.\\n\\n script divMod10Sum\\n on |λ|(a, x)\\n a + x div 10 + x mod 10\\n end |λ|\\n end script\\n\\n 0 = foldl(divMod10Sum, 0, ¬\\n zipWith(my mul, ¬\\n map(my int, reverse of (characters of s)), ¬\\n cycle({1, 2}))) mod 10\\nend luhn\\n\\n\\n--------------------------- TEST ---------------------------\\non run\\n map(luhn, ¬\\n {\\\"49927398716\\\", \\\"49927398717\\\", ¬\\n \\\"1234567812345678\\\", \\\"1234567812345670\\\"})\\n\\n --> {true, false, false, true}\\nend run\\n\\n\\n---------------- REUSABLE GENERIC FUNCTIONS ----------------\\n\\n-- cycle :: [a] -> Generator [a]\\non cycle(xs)\\n script\\n property lng : 1 + (length of xs)\\n property i : missing value\\n on |λ|()\\n if missing value is i then\\n set i to 1\\n else\\n set nxt to (1 + i) mod lng\\n if 0 = ((1 + i) mod lng) then\\n set i to 1\\n else\\n set i to nxt\\n end if\\n end if\\n return item i of xs\\n end |λ|\\n end script\\nend cycle\\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-- int :: String -> Int\\non int(s)\\n s as integer\\nend int\\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-- 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-- 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-- 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-- mul (*) :: Num a => a -> a -> a\\non mul(a, b)\\n a * b\\nend mul\\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-- 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\": \"on luhnTest(n)\\n -- Accept only text input.\\n if (n's class is not text) then return false\\n -- Edit out any spaces or dashes.\\n set astid to AppleScript's text item delimiters\\n set AppleScript's text item delimiters to {space, \\\"-\\\"}\\n set n to n's text items\\n set AppleScript's text item delimiters to \\\"\\\"\\n set n to n as text\\n set AppleScript's text item delimiters to astid\\n -- Check that what's left is numeric.\\n try\\n n as number\\n on error\\n return false\\n end try\\n\\n -- Do the calculation two digits at a time, starting at the end of the text and working back.\\n set sum to 0\\n repeat with i from ((count n) - 1) to 1 by -2\\n set n2 to (text i thru (i + 1) of n) as integer\\n tell n2 div 10 mod 10 * 2 to set sum to sum + it div 10 + it mod 10 + n2 mod 10\\n end repeat\\n -- If there's an odd digit left over, add that in too.\\n if (i is 2) then set sum to sum + (character 1 of n)\\n\\n return (sum mod 10 is 0)\\nend luhnTest\\n\\n-- Test code:\\nset testResults to {}\\nrepeat with testNumber in {\\\"49927398716\\\", \\\"49927398717\\\", \\\"1234567812345678\\\", \\\"1234567812345670\\\"}\\n set end of testResults to {testNumber:testNumber's contents, valid:luhnTest(testNumber)}\\nend repeat\\nreturn testResults\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{{testNumber:\\\"49927398716\\\", valid:true}, {testNumber:\\\"49927398717\\\", valid:false}, {testNumber:\\\"1234567812345678\\\", valid:false}, {testNumber:\\\"1234567812345670\\\", valid:true}}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \".text\\n.global _start\\n_start:\\n ldr r0, =example_numbers\\n bl test_number\\n\\n add r1, r0, #1\\n bl length\\n add r0, r1, r0\\n bl test_number\\n\\n add r1, r0, #1\\n bl length\\n add r0, r1, r0\\n bl test_number\\n\\n add r1, r0, #1\\n bl length\\n add r0, r1, r0\\n bl test_number\\n\\n mov r0, #0\\n mov r7, #1\\n swi 0\\n\\ntest_number:\\n push {r0, lr}\\n bl print_string\\n\\n bl luhn_test\\n cmp r0, #1\\n ldreq r0, =valid_message\\n ldrne r0, =invalid_message\\n bl print_string\\n pop {r0, lr}\\n mov pc, lr\\n\\n\\n\\nprint_string:\\n push {r0-r7, lr}\\n mov r1, r0 @ string to print\\n bl length\\n mov r2, r0 @ length of string\\n mov r0, #1 @ write to stdout\\n mov r7, #4 @ SYS_WRITE\\n swi 0 @ call system interupt\\n pop {r0-r7, lr}\\n mov pc, lr\\n\\n@ r0 address of credit card number string\\n@ returns result in r0\\nluhn_test:\\n push {r1-r7, lr}\\n mov r1, r0\\n bl isNumerical @ check if string is a number\\n cmp r0, #1\\n bne .luhn_test_end @ exit if not number\\n mov r0, r1\\n ldr r1, =reversed_string @ address to store reversed string\\n bl reverse @ reverse string\\n push {r0}\\n bl length @ get length of string\\n mov r4, r0 @ store string length in r4\\n pop {r0}\\n mov r2, #0 @ string index\\n mov r6, #0 @ sum of odd digits\\n mov r7, #0 @ sum of even digits\\n .loadNext:\\n ldrb r3, [r1, r2] @ load byte into r3\\n sub r3, #'0' @ convert letter to digit\\n and r5, r2, #1 @ test if index is even or odd\\n cmp r5, #0\\n beq .odd_digit\\n bne .even_digit\\n .odd_digit:\\n add r6, r3 @ add digit to sum if odd\\n b .continue @ skip next step\\n .even_digit:\\n lsl r3, #1 @ multiply digit by 2\\n cmp r3, #10 @ sum digits\\n subge r3, #10 @ get digit in 1s place\\n addge r3, #1 @ add 1 for the 10s place\\n add r7, r3 @ add digit sum to the total\\n\\n .continue:\\n add r2, #1 @ increment digit index\\n cmp r2, r4 @ check if at end of string\\n blt .loadNext\\n\\n add r0, r6, r7 @ add even and odd sum\\n mov r3, r0 @ copy sum to r3\\n ldr r1, =429496730 @ (2^32-1)/10\\n sub r0, r0, r0, lsr #30 @ divide by 10\\n umull r2, r0, r1, r0\\n mov r1, #10\\n mul r0, r1 @ multiply the r0 by 10 to see if divisible\\n cmp r0, r3 @ compare with the original value in r3\\n .luhn_test_end:\\n movne r0, #0 @ return false if invalid card number\\n moveq r0, #1 @ return true if valid card number\\n pop {r1-r7, lr}\\n mov pc, lr\\n\\nlength:\\n push {r1-r2, lr}\\n mov r2, r0 @ start of string address\\n .loop:\\n ldrb r1, [r2], #1 @ load byte from address r2 and increment\\n cmp r1, #0 @ check for end of string\\n bne .loop @ load next byte if not 0\\n sub r0, r2, r0 @ subtract end of string address from start\\n sub r0, #1 @ end of line from count\\n pop {r1-r2, lr}\\n mov pc, lr\\n\\n@ reverses a string\\n@ r0 address of string to reverse\\n@ r1 address to store reversed string\\nreverse:\\n push {r0-r5, lr}\\n push {r0, lr}\\n bl length @ get length of string to reverse\\n mov r3, r0 @ backword index\\n pop {r0, lr}\\n mov r4, #0 @ fowrard index\\n .reverse_next:\\n sub r3, #1 @ decrement backword index\\n ldrb r5, [r0, r3] @ load byte from original string at index\\n strb r5, [r1, r4] @ copy byte to reversed string\\n add r4, #1 @ increment fowrard index\\n cmp r3, #0 @ check if any characters are left\\n bge .reverse_next\\n\\n mov r5, #0\\n strb r5, [r1, r4] @ write null byte to terminate reversed string\\n pop {r0-r5, lr}\\n mov pc, lr\\n\\nisNumerical:\\n push {r1, lr}\\n .isNumerical_checkNext:\\n ldrb r1, [r0], #1\\n cmp r1, #0\\n beq .isNumerical_true\\n cmp r1, #'0'\\n blt .isNumerical_false\\n cmp r1, #'9'\\n bgt .isNumerical_false\\n b .isNumerical_checkNext\\n .isNumerical_false:\\n mov r0, #0\\n b .isNumerical_end\\n .isNumerical_true:\\n mov r0, #1\\n .isNumerical_end:\\n pop {r1, lr}\\n mov pc, lr\\n\\n\\n.data\\nvalid_message:\\n .asciz \\\" valid card number\\\\n\\\"\\ninvalid_message:\\n .asciz \\\" invalid card number\\\\n\\\"\\n\\nreversed_string:\\n .space 32\\n\\nexample_numbers:\\n .asciz \\\"49927398716\\\"\\n .asciz \\\"49927398717\\\"\\n .asciz \\\"1234567812345678\\\"\\n .asciz \\\"1234567812345670\\\"\\n\",\n \"language\": \"ARM-Assembly\"\n },\n {\n \"code\": \"digits: function [n][\\n res: new []\\n while -> n > 0 [\\n 'res ++ n % 10\\n n: n / 10\\n ]\\n res\\n]\\n\\nluhn?: function [n][\\n s1: new 0\\n s2: new 0\\n loop.with: 'i digits n 'd [\\n if? even? i -> 's1 + d\\n else [\\n 'd * 2\\n if d > 9 -> 'd - 9\\n 's2 + d\\n ]\\n ]\\n zero? (s1 + s2) % 10\\n]\\n\\nprint luhn? 49927398716\\nprint luhn? 49927398717\\nprint luhn? 1234567812345678\\nprint luhn? 1234567812345670\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"; Originally submitted by Laszlo:\\n; http://www.autohotkey.com/forum/post-229412.html#229412\\n\\nMsgBox % LuhnTest(49927398716)\\nMsgBox % LuhnTest(49927398717)\\nMsgBox % LuhnTest(1234567812345678)\\nMsgBox % LuhnTest(1234567812345670)\\n\\nReturn\\n\\n;-----------------------------\\n\\nLuhnTest(Number)\\n{\\n MultFactor := 2 - ( StrLen(Number) & 1 ) , Sum := 0\\n Loop, Parse, Number\\n Sum += ( ( 9 < ( Temp := MultFactor * A_LoopField ) ) ? Temp - 9 : Temp ) , MultFactor := 3 - MultFactor\\n Return !Mod(Sum,10)\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"Global $avarray[4] = [49927398716, 49927398717, 1234567812345678, 1234567812345670]\\nFor $i = 0 To 3\\n\\tcheckLuhn($avarray[$i])\\nNext\\n\\nFunc checkLuhn($number)\\n\\t$sum = 0\\n\\t$numDigits = StringSplit($number, \\\"\\\")\\n\\tFor $i = $numDigits[0] - 1 To 1 Step -2\\n\\t\\t$numDigits[$i] = $numDigits[$i] * 2\\n\\t\\tIf $numDigits[$i] >= 10 Then $numDigits[$i] -= 9\\n\\tNext\\n\\tFor $i = 1 To $numDigits[0]\\n\\t\\t$sum += $numDigits[$i]\\n\\tNext\\n\\tIf StringRight($sum, 1) = \\\"0\\\" Then\\n\\t\\tConsoleWrite(\\\"Luhn-Check (\\\" & $number & \\\") : True\\\" & @CRLF)\\n\\t\\tReturn True\\n\\tElse\\n\\t\\tConsoleWrite(\\\"Luhn-Check (\\\" & $number & \\\") : False\\\" & @CRLF)\\n\\t\\tReturn False\\n\\tEndIf\\nEndFunc ;==>checkLuhn\\n\",\n \"language\": \"AutoIt\"\n },\n {\n \"code\": \"#!/usr/bin/awk -f\\nBEGIN {\\n A[1] = 49927398716;\\n A[2] = 49927398717;\\n A[3] = 1234567812345678;\\n A[4] = 1234567812345670;\\n A[5] = \\\"01234567897\\\";\\n A[6] = \\\"01234567890\\\";\\n A[7] = \\\"00000000000\\\";\\n for (k in A) print \\\"isLuhn(\\\"A[k]\\\"): \\\",isLuhn(A[k]);\\t\\n}\\n\\nfunction isLuhn(cardno) {\\n s = 0;\\n m = \\\"0246813579\\\";\\n n = length(cardno);\\n for (k = n; 0 < k; k -= 2) {\\n\\ts += substr(cardno, k, 1);\\n }\\n for (k = n-1; 0 < k; k -= 2) {\\n\\ts += substr(m, substr(cardno, k, 1)+1, 1);\\n }\\n return ((s%10)==0);\\t\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"dim card$(5)\\ncard$[1]=\\\"49927398716\\\"\\ncard$[2]=\\\"49927398717\\\"\\ncard$[3]=\\\"1234567812345678\\\"\\ncard$[4]=\\\"1234567812345670\\\"\\n\\nfor test = 1 to 4\\n odd = True\\n sum = 0\\n for n = length(card$[test]) to 1 step -1\\n num = int(mid(card$[test],n,1))\\n if odd then\\n sum += num\\n odd = False\\n else\\n num *= 2\\n if num <= 9 then\\n sum += num\\n else\\n sum += int(left(string(num),1)) + int(right(string(num),1))\\n end if\\n odd = True\\n end if\\n next\\n if sum mod 10 = 0 then\\n print card$[test], \\\"True\\\"\\n else\\n print card$[test], \\\"False\\\"\\n end if\\nnext test\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off\\nsetlocal enabledelayedexpansion\\n\\ncall :luhn 49927398716\\ncall :luhn 49927398717\\ncall :luhn 1234567812345678\\ncall :luhn 1234567812345670\\nexit /b 0\\n\\n:luhn\\nset \\\"input=%1\\\"\\nset \\\"cnt=0\\\"\\nset \\\"s1=0\\\"\\nset \\\"s2=0\\\"\\n:digit_loop\\nset /a \\\"cnt-=1\\\"\\nset /a \\\"isOdd=(-%cnt%)%%2\\\"\\n\\nif !isodd! equ 1 (\\n\\tset /a \\\"s1+=!input:~%cnt%,1!\\\"\\n) else (\\n\\tset /a \\\"twice=!input:~%cnt%,1!*2\\\"\\n\\tif !twice! geq 10 (\\n\\t\\tset /a \\\"s2+=!twice:~0,1!+!twice:~1,1!\\\"\\n\\t) else (\\n\\t\\tset /a \\\"s2+=!twice!\\\"\\n\\t)\\n)\\nif \\\"!input:~%cnt%!\\\"==\\\"!input!\\\" (\\n\\tset /a \\\"sum=(!s1!+!s2!)%%10\\\"\\n\\tif !sum! equ 0 (echo !input! is valid.) else (echo !input! is not valid.)\\n\\tgoto :EOF\\n)\\ngoto digit_loop\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" FOR card% = 1 TO 4\\n READ cardnumber$\\n IF FNluhn(cardnumber$) THEN\\n PRINT \\\"Card number \\\" cardnumber$ \\\" is valid\\\"\\n ELSE\\n PRINT \\\"Card number \\\" cardnumber$ \\\" is invalid\\\"\\n ENDIF\\n NEXT card%\\n END\\n\\n DATA 49927398716, 49927398717, 1234567812345678, 1234567812345670\\n\\n DEF FNluhn(card$)\\n LOCAL I%, L%, N%, S%\\n L% = LEN(card$)\\n FOR I% = 1 TO L%\\n N% = VAL(MID$(card$, L%-I%+1, 1))\\n IF I% AND 1 THEN\\n S% += N%\\n ELSE\\n N% *= 2\\n S% += N% MOD 10 + N% DIV 10\\n ENDIF\\n NEXT\\n = (S% MOD 10) = 0\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"/* Return 1 if number passes Luhn test, else 0 */\\ndefine l(n) {\\n auto m, o, s, x\\n\\n o = scale\\n scale = 0\\n\\n m = 1\\n while (n > 0) {\\n x = (n % 10) * m\\n if (x > 9) x -= 9\\n s += x\\n m = 3 - m\\n n /= 10\\n }\\n\\n s %= 10\\n scale = o\\n if (s) return(0)\\n return(1)\\n}\\n\\nl(49927398716)\\nl(49927398717)\\nl(1234567812345678)\\nl(1234567812345670)\\n\",\n \"language\": \"Bc\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\nlet luhn(s) = valof\\n$( let sum=0 and fac=1\\n for i = s%0 to 1 by -1\\n $( unless '0' <= s%i <= '9' resultis false\\n sum := sum + fac*(s%i - '0') rem 10 + fac*(s%i - '0')/10\\n fac := 3 - fac\\n $)\\n resultis sum rem 10 = 0\\n$)\\n\\nlet show(s) be\\n writef(\\\"%S: %S*N\\\", s, luhn(s) -> \\\"pass\\\", \\\"fail\\\")\\n\\nlet start() be\\n$( show(\\\"49927398716\\\")\\n show(\\\"49927398717\\\")\\n show(\\\"1234567812345678\\\")\\n show(\\\"1234567812345670\\\")\\n$)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"v 1 >$0 v v <\\n>&:19+`|v < >v 5 6 7 8\\n^ \\\\ <>09p19p>09g+09p:|>2*:19+%19g+19p19+/19g+19p:|\\n 2 3 4 > v\\n v\\\"invalid\\\"<10 9\\n |%+91+g91g90<\\n v \\\"valid\\\"<\\n >:#,_@\\n 11\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \"Luhn ← (0=10|⊢)∘(+´(10|⊢)+⊢≥10˙)∘(⊢×≠⥊1‿2˙)∘(⌽•Fmt-'0'˙)\\n\\n(⍉⊢≍Luhn¨) ⟨49927398716,49927398717,1234567812345678,1234567812345670⟩\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \" ( luhn\\n = sum odd even\\n . 0:?sum\\n & rev$!arg:?arg\\n & whl\\n ' ( @( !arg\\n : %?odd\\n ( %?even ?arg\\n | :?arg&0:?even\\n )\\n )\\n & !odd+mod$(2*!even.10)+div$(!even.5)+!sum:?sum\\n )\\n & mod$(!sum.10):0\\n )\\n& ( test\\n =\\n . out\\n $ (!arg \\\":\\\" (luhn$!arg&true|false))\\n )\\n& test$49927398716\\n& test$49927398717\\n& test$1234567812345678\\n& test$1234567812345670\\n& ;\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \">>>>>>>>>+>,----------[ READ CHARACTERS UNTIL \\\\N AND\\n >++++++++[<----->-]<++>>>>>>+>,----------] SUBTRACT ASCII 0 FROM EACH\\n<-<<<<<<< GO TO LAST DIGIT\\n[ WHILE THERE ARE DIGITS\\n >>>>>>>>[-<<<<<<<+>>>>>>>]<<<<<<<< ADD RUNNING TOTAL TO ODD DGT\\n <<<<<<< GO TO EVEN DIGIT\\n [ IF THERE IS ONE\\n >[->++<]>[-<+>] MUL BY TWO\\n >>>++++++++++<<<<[ DIVMOD BY TEN\\n >>>[-]+>-[<-<]<[<<] DECR DIVISOR\\n >>[ IF ZERO\\n >++++++++++>+<<-]<<< SET TO TEN; INCR QUOTIENT\\n -] DECR DIVIDEND UNTIL ZERO\\n ++++++++++>>>>[-<<<<->>>>] CALCULATE REMAINDER\\n >[-<<<<<+>>>>>] ADD QUOTIENT TO IT\\n >>[-<<<<<<<+>>>>>>>]<<<<<<<< THEN ADD RUNNING TOTAL\\n <<<<< ZERO BEFORE NEXT ODD DIGIT\\n ]<< GO TO NEXT ODD DIGIT\\n]\\n>>>>>>>-[+>>-]> GO TO TOTAL\\n>>>>++++++++++<<<<[ MODULO TEN\\n >>>[-]+>-[<-<]<[<<] DECR DIVISOR\\n >>[>++++++++++<-] IF ZERO SET BACK TO TEN\\n<<<-] DECR DIVIDEND UNTIL ZERO\\n>>>++++++++++>[-<->]< REMAINDER: TEN MINUS DIVISOR\\n<<<<<<++++++++++[-> VALUES FOR ASCII OUTPUT\\n +++++++++++> 110\\n ++++++++++> 100\\n ++++++++> 80\\n +++++++<<<<] 70\\n>>>>>+> GO BACK TO REMAINDER\\n[<<.<<---.<-----.+++.<] IF NOT ZERO FAIL\\n<[<<.<---.<+++++..<] IF ZERO PASS\\n++++++++++. NEWLINE\\n\",\n \"language\": \"Brainf---\"\n },\n {\n \"code\": \":import std/Combinator .\\n:import std/Math .\\n:import std/List .\\n\\nluhn number→list → reverse → check → (\\\\mod (+10)) → zero?\\n\\tcheck y [[[[0 [[[6 \\\\5 (4 + (5 odd even)) 1]]] 1]]]] k (+0)\\n\\t\\todd 2\\n\\t\\teven digit-sum (2 ⋅ (+2))\\n\\n:test (luhn (+61789372994)) ([[1]])\\n:test (luhn (+49927398716)) ([[1]])\\n:test (luhn (+49927398717)) ([[0]])\\n:test (luhn (+1234567812345678)) ([[0]])\\n:test (luhn (+1234567812345670)) ([[1]])\\n\",\n \"language\": \"Bruijn\"\n },\n {\n \"code\": \"tt \\\"Remove whitespace\\\"vv\\npe \\\"Eval to number\\\"vv\\n<- \\\"Reverse digits\\\"vv\\nXX \\\"Split number into digits\\\"vv\\n\\n{\\n { \\\"Odd digits\\\"vv\\n 2EN\\n }\\n\\n { \\\"Even digits\\\"vv\\n 2en\\n {\\n 2.* \\\"Double\\\"vv\\n ^^ 9.> \\\"<test>=Duplicate greater than 9\\\"vv\\n {\\n XX++ \\\"Sum digits\\\"vv\\n }if \\\"If <test>\\\"vv\\n }m[ \\\"For each even digit\\\"vv\\n }\\n}M- \\\"Cool map. Create array of each branch applied to argument.\\\"vv\\n\\n{++}m[ \\\"Sum each block (odd & even)\\\"vv\\n++ \\\"Sum these\\\"vv\\n[- \\\"Last digit\\\"vv\\n0== \\\"Equal to zero\\\"vv\\nQ \\\"Pretty print\\\"vv\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"#include <string.h>\\n#include <stdio.h>\\n\\nint luhn(const char* cc)\\n{\\n\\tconst int m[] = {0,2,4,6,8,1,3,5,7,9}; // mapping for rule 3\\n\\tint i, odd = 1, sum = 0;\\n\\n\\tfor (i = strlen(cc); i--; odd = !odd) {\\n\\t\\tint digit = cc[i] - '0';\\n\\t\\tsum += odd ? digit : m[digit];\\n\\t}\\n\\n\\treturn sum % 10 == 0;\\n}\\n\\nint main()\\n{\\n\\tconst char* cc[] = {\\n\\t\\t\\\"49927398716\\\",\\n\\t\\t\\\"49927398717\\\",\\n\\t\\t\\\"1234567812345678\\\",\\n\\t\\t\\\"1234567812345670\\\",\\n\\t\\t0\\n\\t};\\n\\tint i;\\n\\n\\tfor (i = 0; cc[i]; i++)\\n\\t\\tprintf(\\\"%16s\\\\t%s\\\\n\\\", cc[i], luhn(cc[i]) ? \\\"ok\\\" : \\\"not ok\\\");\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\nusing namespace std;\\n\\nint toInt(const char c)\\n{\\n return c-'0';\\n}\\n\\nint confirm( const char *id)\\n{\\n bool is_odd_dgt = true;\\n int s = 0;\\n const char *cp;\\n\\n for(cp=id; *cp; cp++);\\n while(cp > id) {\\n --cp;\\n int k = toInt(*cp);\\n if (is_odd_dgt) {\\n s += k;\\n }\\n else {\\n s += (k!=9)? (2*k)%9 : 9;\\n }\\n\\tis_odd_dgt = !is_odd_dgt;\\n }\\n return 0 == s%10;\\n}\\n\\nint main( )\\n{\\n const char * t_cases[] = {\\n \\\"49927398716\\\",\\n \\\"49927398717\\\",\\n \\\"1234567812345678\\\",\\n \\\"1234567812345670\\\",\\n NULL,\\n };\\n for ( const char **cp = t_cases; *cp; cp++) {\\n cout << *cp << \\\": \\\" << confirm(*cp) << endl;\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nbool luhn( const string& id)\\n{\\n static const int m[10] = {0,2,4,6,8,1,3,5,7,9}; // mapping for rule 3\\n bool is_odd_dgt = false;\\n auto lambda = [&](int a, char c) {return a + ((is_odd_dgt = !is_odd_dgt) ? c-'0' : m[c-'0']);};\\n int s = std::accumulate(id.rbegin(), id.rend(), 0, lambda);\\n return 0 == s%10;\\n}\\n\\nint main( )\\n{\\n auto t_cases = {\\\"49927398716\\\", \\\"49927398717\\\", \\\"1234567812345678\\\", \\\"1234567812345670\\\"};\\n auto print = [](const string & s) {cout << s << \\\": \\\" << luhn(s) << endl;};\\n for_each(t_cases.begin(), t_cases.end(), print);\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <type_traits>\\n\\ntemplate<size_t I, int... Args>\\nstruct find_impl;\\n\\ntemplate<int A, int... Args>\\nstruct find_impl<0, A, Args...> {\\n using type = std::integral_constant<int, A>;\\n};\\n\\ntemplate<int A, int B, int... Args>\\nstruct find_impl<0, A, B, Args...> {\\n using type = std::integral_constant<int, A>;\\n};\\n\\ntemplate<size_t I, int A, int B, int... Args>\\nstruct find_impl<I, A, B, Args...> {\\n using type = typename find_impl<I-1, B, Args...>::type;\\n};\\n\\nnamespace detail {\\ntemplate<typename, typename>\\nstruct append_sequence\\n{};\\n\\ntemplate<typename T, typename... Ts>\\nstruct append_sequence<T, std::tuple<Ts...>> {\\n using type = std::tuple<Ts..., T>;\\n};\\n\\ntemplate<typename... Ts>\\nstruct reverse_sequence {\\n using type = std::tuple<>;\\n};\\n\\ntemplate<typename T, typename... Ts>\\nstruct reverse_sequence<T, Ts...> {\\n using type = typename append_sequence<\\n T,\\n typename reverse_sequence<Ts...>::type\\n >::type;\\n};\\n}\\n\\ntemplate<size_t I>\\nusing rule3 = typename find_impl<I, 0, 2, 4, 6, 8, 1, 3, 5, 7, 9>::type;\\n\\ntemplate<int A, char C, bool dgt>\\nstruct calc\\n : std::integral_constant<int, A + C - '0'>\\n{};\\n\\ntemplate<int A, char C>\\nstruct calc<A, C, false>\\n : std::integral_constant<int, A + rule3<C - '0'>::type::value>\\n{};\\n\\ntemplate<typename Acc, bool Dgt, char...>\\nstruct luhn_impl;\\n\\ntemplate<typename Acc, bool Dgt, char A, char... Args>\\nstruct luhn_impl<Acc, Dgt, A, Args...> {\\n using type = typename calc<Acc::value, A, Dgt>::type;\\n};\\n\\ntemplate<typename Acc, bool Dgt, char A, char B, char... Args>\\nstruct luhn_impl<Acc, Dgt, A, B, Args...> {\\n using type =\\n typename luhn_impl<typename calc<Acc::value, A, Dgt>::type, !Dgt, B, Args...>::type;\\n};\\n\\ntemplate<typename>\\nstruct luhn;\\n\\ntemplate<typename... Args>\\nstruct luhn<std::tuple<Args...>> {\\n using type = typename luhn_impl<std::integral_constant<int, 0>, true, Args::value...>::type;\\n constexpr static bool result = (type::value % 10) == 0;\\n};\\n\\ntemplate<char... Args>\\nbool operator \\\"\\\" _luhn() {\\n return luhn<typename detail::reverse_sequence<std::integral_constant<char, Args>...>::type>::result;\\n}\\n\\nint main() {\\n std::cout << std::boolalpha;\\n std::cout << 49927398716_luhn << std::endl;\\n std::cout << 49927398717_luhn << std::endl;\\n std::cout << 1234567812345678_luhn << std::endl;\\n std::cout << 1234567812345670_luhn << std::endl;\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \" public static class Luhn\\n {\\n public static bool LuhnCheck(this string cardNumber)\\n {\\n return LuhnCheck(cardNumber.Select(c => c - '0').ToArray());\\n }\\n\\n private static bool LuhnCheck(this int[] digits)\\n {\\n return GetCheckValue(digits) == 0;\\n }\\n\\n private static int GetCheckValue(int[] digits)\\n {\\n return digits.Select((d, i) => i % 2 == digits.Length % 2 ? ((2 * d) % 10) + d / 5 : d).Sum() % 10;\\n }\\n }\\n\\n public static class TestProgram\\n {\\n public static void Main()\\n {\\n long[] testNumbers = {49927398716, 49927398717, 1234567812345678, 1234567812345670};\\n foreach (var testNumber in testNumbers)\\n Console.WriteLine(\\\"{0} is {1}valid\\\", testNumber, testNumber.ToString().LuhnCheck() ? \\\"\\\" : \\\"not \\\");\\n }\\n }\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\nusing System.Linq;\\n\\nnamespace Luhn\\n{\\n class Program\\n {\\n public static bool luhn(long n)\\n {\\n long nextdigit, sum = 0;\\n bool alt = false;\\n while (n != 0)\\n {\\n nextdigit = n % 10;\\n if (alt)\\n {\\n nextdigit *= 2;\\n nextdigit -= (nextdigit > 9) ? 9 : 0;\\n }\\n sum += nextdigit;\\n alt = !alt;\\n n /= 10;\\n }\\n return (sum % 10 == 0);\\n }\\n\\n public static bool luhnLinq(long n)\\n {\\n string s = n.ToString();\\n return s.Select((c, i) => (c - '0') << ((s.Length - i - 1) & 1)).Sum(n => n > 9 ? n - 9 : n) % 10 == 0;\\n }\\n\\n static void Main(string[] args)\\n {\\n long[] given = new long[] {49927398716, 49927398717, 1234567812345678, 1234567812345670};\\n foreach (long num in given)\\n {\\n string valid = (luhn(num)) ? \\\" is valid\\\" : \\\" is not valid\\\";\\n Console.WriteLine(num + valid);\\n }\\n\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\nnamespace Luhn_Test\\n{\\n\\tpublic static class Extensions\\n\\t{\\n\\t\\tpublic static string Reverse(this string s )\\n\\t\\t{\\n\\t\\t char[] charArray = s.ToCharArray();\\n\\t\\t Array.Reverse( charArray );\\n\\t\\t return new string( charArray );\\n\\t\\t}\\n\\t}\\n\\tclass Program\\n\\t{\\n\\t\\tpublic static bool Luhn(long x)\\n\\t\\t{\\n\\t\\t\\tlong s1=0;\\n\\t\\t\\tlong s2=0;\\n\\t\\t\\tbool STATE=x%10!=0; // If it ends with zero, we want the order to be the other way around\\n\\t\\t\\tx=long.Parse(x.ToString().Reverse());\\n\\t\\t\\twhile (x!=0)\\n\\t\\t\\t{\\n\\t\\t\\t\\ts1+=STATE?x%10:0;\\n\\t\\t\\t\\ts2+=STATE?0:((x%10)*2>9)?(((x%10)*2/10)+((x%10)*2)%10):((x%10)*2);\\n\\t\\t\\t\\tSTATE=!STATE; //Switch state\\n\\t\\t\\t\\tx/=10; //Cut the last digit and continue\\n\\t\\t\\t}\\n\\t\\t\\treturn ((s1+s2)%10==0); //Check if it ends with zero, if so, return true, otherwise,false.\\n\\t\\t}\\n\\t\\tpublic static void Main(string[] args)\\n\\t\\t{\\n\\t\\t\\tlong[] ks = {1234567812345670, 49927398717, 1234567812345678 ,1234567812345670 };\\n\\t\\t\\tforeach (long k in ks)\\n\\t\\t\\t{\\n\\t\\t\\tConsole.WriteLine(\\\"{0} is {1} Valid.\\\",k,Luhn(k)?\\\"\\\":\\\"Not\\\");\\t\\n\\t\\t\\t}\\n\\t\\tStart:\\n\\t\\t\\ttry {\\n\\t\\t\\tConsole.WriteLine(\\\"Enter your credit:\\\");\\n\\t\\t\\tlong x=long.Parse(Console.ReadLine());\\n\\t\\t\\tConsole.WriteLine(\\\"{0} Valid.\\\",Luhn(x)?\\\"\\\":\\\"Not\\\");\\n\\t\\t\\tgoto Start;\\n\\t\\t\\t}\\n\\t\\t\\tcatch (FormatException)\\n\\t\\t\\t{\\n\\t\\t\\t\\tgoto Start;\\n\\t\\t\\t}\\t\\t\\t\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\nusing System.Linq;\\n\\npublic class CreditCardLogic\\n{\\n static Func<char, int> charToInt = c => c - '0';\\n\\n static Func<int, int> doubleDigit = n => (n * 2).ToString().Select(charToInt).Sum();\\n\\n static Func<int, bool> isOddIndex = index => index % 2 == 0;\\n\\n public static bool LuhnCheck(string creditCardNumber)\\n {\\n var checkSum = creditCardNumber\\n .Select(charToInt)\\n .Reverse()\\n .Select((digit, index) => isOddIndex(index) ? digit : doubleDigit(digit))\\n .Sum();\\n\\n return checkSum % 10 == 0;\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\nusing EuropaRTL.Utilities;\\n\\npublic static partial class Algoritmhs\\n{\\n public static bool CheckLuhn(long n)\\n {\\n int s1 = n.Shatter(true).Subset(2).Arithmetic('+');\\n int s2 = n.Shatter(true).Subset(1, -1, 2).ArithmeticRA('*', 2).ShatterAndSum().Arithmetic('+');\\n return (s1 + s2) % 10 == 0 ? true : false;\\n }\\n}\\nclass Program\\n{\\n static void Main(string[] args)\\n {\\n long[] ll = {\\n 49927398716,\\n 49927398717,\\n 1234567812345678,\\n 1234567812345670\\n };\\n foreach (var item in ll)\\n {\\n item.ToString().WriteLine();\\n Algoritmhs.CheckLuhn(item).ToString().WriteLine();\\n }\\n Console.ReadKey();\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"shared void run() {\\n\\tvalue numbers = \\\"49927398716\\n\\t 49927398717\\n\\t 1234567812345678\\n\\t 1234567812345670\\\";\\n\\tfor(number in numbers.lines) {\\n\\t\\tprint(\\\"``number`` passes? ``luhn(number)``\\\");\\n\\t}\\n}\\n\\nshared Boolean luhn(String number) {\\n\\tvalue digits = number\\n\\t\\t\\t.reversed\\n\\t\\t\\t.map(Character.string)\\n\\t\\t\\t.map(Integer.parse)\\n\\t\\t\\t.narrow<Integer>();\\n\\tvalue s1 = sum { 0, *digits.by(2) };\\n\\tvalue s2 = sum {\\n\\t\\t0,\\n\\t\\t*digits\\n\\t\\t\\t.skip(1)\\n\\t\\t\\t.by(2)\\n\\t\\t\\t.map(curry(times<Integer>)(2))\\n\\t\\t\\t.map((Integer element) => element / 10 + element % 10)\\n\\t};\\n\\treturn (s1 + s2) % 10 == 0;\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"100 cls\\n110 rem Luhn test\\n120 dim card$(5)\\n130 card$(1) = \\\"49927398716\\\"\\n140 card$(2) = \\\"49927398717\\\"\\n150 card$(3) = \\\"1234567812345678\\\"\\n160 card$(4) = \\\"1234567812345670\\\"\\n170 for test = 1 to 4\\n180 odd = true\\n190 sum = 0\\n200 for n = len(card$(test)) to 1 step -1\\n210 num = val(mid$(card$(test),n,1))\\n220 if odd then\\n230 sum = sum+num\\n240 odd = false\\n250 else\\n260 num = num*2\\n270 if num <= 9 then\\n280 sum = sum+num\\n290 else\\n300 sum = sum+val(left$(str$(num),1))+val(right$(str$(num),1))\\n310 endif\\n320 odd = true\\n330 endif\\n340 next\\n350 if sum mod 10 = 0 then\\n360 print card$(test),\\\"True\\\"\\n370 else\\n380 print card$(test),\\\"False\\\"\\n390 endif\\n400 next test\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"(defn luhn? [cc]\\n (let [factors (cycle [1 2])\\n numbers (map #(Character/digit % 10) cc)\\n sum (reduce + (map #(+ (quot % 10) (mod % 10))\\n (map * (reverse numbers) factors)))]\\n (zero? (mod sum 10))))\\n\\n(doseq [n [\\\"49927398716\\\" \\\"49927398717\\\" \\\"1234567812345678\\\" \\\"1234567812345670\\\"]]\\n (println (luhn? n)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"luhn = proc (num: string) returns (bool) signals (bad_format)\\n total: int := 0\\n even: bool := true\\n for i: int in int$from_to_by(string$size(num), 1, -1) do\\n digit: int := int$parse(string$c2s(num[i])) resignal bad_format\\n even := ~even\\n if even then\\n digit := 2 * digit\\n if digit >= 10 then digit := digit//10 + 1 end\\n end\\n total := total + digit\\n end\\n return(total // 10 = 0)\\nend luhn\\n\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n tests: sequence[string] := sequence[string]$\\n [\\\"49927398716\\\", \\\"49927398717\\\", \\\"1234567812345678\\\", \\\"1234567812345670\\\"]\\n for test: string in sequence[string]$elements(tests) do\\n stream$puts(po, test || \\\": \\\")\\n if luhn(test)\\n then stream$putl(po, \\\"pass\\\")\\n else stream$putl(po, \\\"fail\\\")\\n end\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. LUHNTEST.\\n ENVIRONMENT DIVISION.\\n INPUT-OUTPUT SECTION.\\n data division.\\n WORKING-STORAGE SECTION.\\n 01 inp-card.\\n 03 inp-card-ch pic x(01) occurs 20 times.\\n 01 ws-result pic 9(01).\\n 88 pass-luhn-test value 0.\\n\\n PROCEDURE DIVISION.\\n move \\\"49927398716\\\" to inp-card\\n perform test-card\\n move \\\"49927398717\\\" to inp-card\\n perform test-card\\n move \\\"1234567812345678\\\" to inp-card\\n perform test-card\\n move \\\"1234567812345670\\\" to inp-card\\n perform test-card\\n stop run\\n .\\n test-card.\\n call \\\"LUHN\\\" using inp-card, ws-result\\n if pass-luhn-test\\n display \\\"input=\\\" inp-card \\\"pass\\\"\\n else\\n display \\\"input=\\\" inp-card \\\"fail\\\"\\n .\\n\\n END PROGRAM LUHNTEST.\\n IDENTIFICATION DIVISION.\\n PROGRAM-ID. LUHN.\\n ENVIRONMENT DIVISION.\\n INPUT-OUTPUT SECTION.\\n DATA DIVISION.\\n WORKING-STORAGE SECTION.\\n 01 maxlen pic 9(02) comp value 16.\\n 01 inplen pic 9(02) comp value 0.\\n 01 i pic 9(02) comp value 0.\\n 01 j pic 9(02) comp value 0.\\n 01 l pic 9(02) comp value 0.\\n 01 dw pic 9(02) comp value 0.\\n 01 ws-total pic 9(03) comp value 0.\\n 01 ws-prod pic 99.\\n 01 filler redefines ws-prod.\\n 03 ws-prod-tens pic 9.\\n 03 ws-prod-units pic 9.\\n 01 ws-card.\\n 03 filler occurs 16 times depending on maxlen.\\n 05 ws-card-ch pic x(01).\\n 05 ws-card-digit redefines ws-card-ch pic 9(01).\\n LINKAGE SECTION.\\n 01 inp-card.\\n 03 inp-card-ch pic x(01) occurs 20 times.\\n 01 ws-result pic 9(01).\\n 88 pass-luhn-test value 0.\\n\\n PROCEDURE DIVISION using inp-card, ws-result.\\n perform varying i from 1 by +1\\n until i > maxlen\\n or inp-card-ch (i) = space\\n end-perform\\n compute l = i - 1\\n compute inplen = l\\n perform varying j from 1 by +1\\n until j > inplen\\n if l < 1\\n move \\\"0\\\" to ws-card-ch (j)\\n else\\n move inp-card-ch (l) to ws-card-ch (j)\\n compute l = l - 1\\n end-if\\n end-perform\\n move 0 to ws-total\\n perform varying i from 1 by +1\\n until i > inplen\\n compute dw = 2 - (i - 2 * function integer (i / 2))\\n compute ws-prod = ws-card-digit (i) * dw\\n compute ws-total = ws-total\\n + ws-prod-tens\\n + ws-prod-units\\n end-perform\\n compute ws-result = ws-total - 10 * function integer (ws-total / 10)\\n goback\\n .\\n END PROGRAM LUHN.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"0010 FUNC luhn(s$) CLOSED\\n0020 total#:=0\\n0030 even#:=TRUE\\n0040 FOR i#:=LEN(s$) TO 1 STEP -1 DO\\n0050 digit#:=VAL(s$(i#))\\n0060 even#:=NOT even#\\n0070 IF even# THEN digit#:=(2*digit#) DIV 10+(2*digit#) MOD 10\\n0080 total#:+digit#\\n0090 ENDFOR i#\\n0100 RETURN total# MOD 10=0\\n0110 ENDFUNC luhn\\n0120 //\\n0130 PROC test(s$)\\n0140 PRINT s$,\\\": \\\",\\n0150 IF luhn(s$) THEN\\n0160 PRINT \\\"pass\\\"\\n0170 ELSE\\n0180 PRINT \\\"fail\\\"\\n0190 ENDIF\\n0200 ENDPROC test\\n0210 //\\n0220 test(\\\"49927398716\\\")\\n0230 test(\\\"49927398717\\\")\\n0240 test(\\\"1234567812345678\\\")\\n0250 test(\\\"1234567812345670\\\")\\n0260 END\\n\",\n \"language\": \"Comal\"\n },\n {\n \"code\": \"(defun luhn (n)\\n (labels ((sum-digits (n) (if (> n 9) (- n 9) n)))\\n (let ((n* (reverse n)) (l (length n)))\\n (let ((s1 (loop for i from 0 below l by 2\\n\\t\\t summing (digit-char-p (aref n* i))))\\n\\t (s2 (loop for i from 1 below l by 2\\n\\t\\t summing (sum-digits (* 2 (digit-char-p (aref n* i)))))))\\n\\t(zerop (mod (+ s1 s2) 10))))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(require :curly)\\n(use-package :curly)\\n(enable-curly-syntax)\\n\\n(defun luhn (seq)\\n (labels ((sum-digits (n) (if (> n 9) (- n 9) n)))\\n (funcall {zerop (mod * 10) (apply #'+) (mapcar #'sum-digits)\\n\\t (mapcar #'* '#1=(1 2 . #1#)) (map 'list #'digit-char-p) reverse} seq)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\n# Given a string containing the digits of a credit card number,\\n# see if it passes the Luhn test.\\nsub luhn(card: [uint8]): (ok: uint8) is\\n # Scan ahead to last digit, counting digits\\n var n: uint8 := 0;\\n while [card] != 0 loop\\n n := n + 1;\\n card := @next card;\\n end loop;\\n\\n var sum: uint8 := 0;\\n while n > 0 loop\\n # odd digit is simply added\\n card := @prev card;\\n n := n - 1;\\n sum := sum + ([card] - '0');\\n\\n # if uneven amount of digits, stop\\n if n == 0 then break; end if;\\n\\n # even digit\\n card := @prev card;\\n n := n - 1;\\n var digit := [card] - '0';\\n\\n # it is good to avoid unnecessary multiplication/\\n # division, since 8-bit processors and microcontrollers\\n # don't tend to have that in hardware\\n if digit < 5 then\\n sum := sum + digit + digit;\\n else\\n digit := digit - 5;\\n sum := sum + digit + digit + 1;\\n end if;\\n end loop;\\n\\n # there is no boolean type, comparisons only work\\n # in conditionals; this is the only way to return\\n # a status\\n if sum % 10 == 0 then\\n ok := 1;\\n else\\n ok := 0;\\n end if;\\nend sub;\\n\\n\\n# Test and print\\nsub test(card: [uint8]) is\\n var msg: [uint8][] := {\\\"Fail\\\", \\\"Pass\\\"};\\n print(card);\\n print(\\\": \\\");\\n print(msg[luhn(card)]);\\n print_nl();\\nend sub;\\n\\ntest(\\\"49927398716\\\");\\ntest(\\\"49927398717\\\");\\ntest(\\\"1234567812345678\\\");\\ntest(\\\"1234567812345670\\\");\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"def luhn_valid?(n) # Card values can be numbers or strings\\n d2sum = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\\n sum, n = 0, n.to_u64\\n while n > 0; sum += n%10; n //= 10; sum += d2sum[n%10]; n //= 10 end\\n sum % 10 == 0\\nend\\n\\ncards = [49927398716, \\\"49927398717\\\", 1234567812345678, \\\"1234567812345670\\\"]\\ncards.each{ |i| puts \\\"#{i}: #{luhn_valid?(i)}\\\" }\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.algorithm, std.range, std.string;\\n\\nenum luhnTest = (in string n) pure /*nothrow*/ @safe /*@nogc*/ =>\\n retro(n)\\n .zip(only(1, 2).cycle)\\n .map!(p => (p[0] - '0') * p[1])\\n .map!(d => d / 10 + d % 10)\\n .sum % 10 == 0;\\n\\nvoid main() {\\n assert(\\\"49927398716 49927398717 1234567812345678 1234567812345670\\\"\\n .split.map!luhnTest.equal([true, false, false, true]));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.algorithm;\\n\\nbool luhnTest(in string num) @safe pure nothrow @nogc {\\n uint sum;\\n foreach_reverse (immutable i, immutable n; num) {\\n immutable uint ord = n - '\\\\u0030';\\n sum += ((num.length - i) & 1) ? ord : ord / 5 + (2 * ord) % 10;\\n }\\n return sum % 10 == 0;\\n}\\n\\nvoid main() {\\n immutable data = [\\\"49927398716\\\",\\n \\\"49927398717\\\",\\n \\\"1234567812345678\\\",\\n \\\"1234567812345670\\\"];\\n assert(data.map!luhnTest.equal([true, false, false, true]));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio;\\n\\nstruct Interval(T) {\\n immutable T a, b;\\n\\n this(in T a_, in T b_) pure nothrow @nogc {\\n this.a = a_;\\n this.b = b_;\\n }\\n\\n bool opBinaryRight(string op=\\\"in\\\")(in T x)\\n const pure nothrow @nogc {\\n return x >= a && x <= b;\\n }\\n\\n pure nothrow @safe @nogc const invariant {\\n assert(a <= b);\\n }\\n}\\n\\nInterval!T interval(T)(in T a, in T b) pure nothrow @nogc {\\n return Interval!T(a, b);\\n}\\n\\n\\nbool luhnTest(in string num) pure nothrow @nogc\\nin {\\n assert(num.length <= 20);\\n} body {\\n int sum = 0;\\n bool od = true;\\n bool ok = true;\\n immutable int numLen = num.length;\\n\\n foreach_reverse (immutable p; 0 .. numLen) {\\n immutable int i = num[p] - '0';\\n if (i !in interval(0, 9)) {\\n ok = false;\\n break;\\n }\\n\\n immutable int x = ((i * 2) % 10) + (i / 5);\\n assert((numLen - p) in interval(0, 19));\\n assert(sum in interval(0, (numLen - p) * 10));\\n assert(i in interval(0, 9));\\n assert(x in interval(0, 9));\\n sum += od ? i : x;\\n od = !od;\\n }\\n\\n return ok && (sum % 10) == 0;\\n}\\n\\n\\nvoid main() {\\n foreach (immutable n; [\\\"49927398716\\\", \\\"49927398717\\\",\\n \\\"1234567812345678\\\", \\\"1234567812345670\\\",\\n \\\"123456781234567D\\\"])\\n writefln(\\\"%s is %svalid\\\", n, luhnTest(n) ? \\\"\\\" : \\\"not \\\");\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"{Test data arrays}\\n\\nconst Num1: array [0..10] of byte = (4,9,9,2,7,3,9,8,7,1,6);\\nconst Num2: array [0..10] of byte = (4,9,9,2,7,3,9,8,7,1,7);\\nconst Num3: array [0..15] of byte = (1,2,3,4,5,6,7,8,1,2,3,4,5,6,7,8);\\nconst Num4: array [0..15] of byte = (1,2,3,4,5,6,7,8,1,2,3,4,5,6,7,0);\\n\\n{Simplifies cases where we have to sum a two digit number}\\n\\nconst DigitSum: array [0..18] of byte = (0,1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9);\\n\\nfunction ValidateCreditCard(CardNum: array of byte): boolean;\\n{Validate a Credit Card number}\\nvar I,J,Len,Sum,Sum1,Sum2: integer;\\nvar Rev: array of byte;\\nbegin\\nSum1:=0; Sum2:=0;\\nLen:=High(CardNum);\\nfor I:=Len downto 0 do\\n if ((I-Len) and 1)=0 then Sum1:=Sum1 + CardNum[I]\\n else Sum2:=Sum2 + DigitSum[CardNum[I]*2];\\nSum:=Sum1+Sum2;\\nResult:=(Sum mod 10)=0;\\nend;\\n\\n\\nfunction CardNumberToStr(CardNum: array of byte): string;\\n{Convert card number to a string}\\nvar I: integer;\\nbegin\\nResult:='';\\nfor I:=0 to High(CardNum) do\\nResult:=Result+IntToStr(CardNum[I]);\\nend;\\n\\n\\nprocedure TestDisplayNumber(Memo: TMemo; Num: array of byte);\\n{Test a credit card number and display results}\\nvar S: string;\\nbegin\\nS:=CardNumberToStr(Num);\\nif ValidateCreditCard(Num) then S:=S+': Valid'\\nelse S:=S+': Not Valid';\\nMemo.Lines.Add(S);\\nend;\\n\\n\\nprocedure TestCreditCardNums(Memo: TMemo);\\n{Test all credit card numbers}\\nbegin\\nTestDisplayNumber(Memo,Num1);\\nTestDisplayNumber(Memo,Num2);\\nTestDisplayNumber(Memo,Num3);\\nTestDisplayNumber(Memo,Num4);\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"proc nonrec luhn(*char num) bool:\\n [10] byte map = (0, 2, 4, 6, 8, 1, 3, 5, 7, 9);\\n byte total, digit;\\n *char start;\\n bool even;\\n\\n start := num;\\n total := 0;\\n even := true;\\n while num* /= '\\\\e' do num := num + 1 od;\\n while\\n num := num - 1;\\n num >= start\\n do\\n digit := num* - '0';\\n even := not even;\\n if even then digit := map[digit] fi;\\n total := total + digit\\n od;\\n\\n total % 10 = 0\\ncorp\\n\\nproc nonrec test(*char num) void:\\n writeln(num, \\\": \\\", if luhn(num) then \\\"pass\\\" else \\\"fail\\\" fi)\\ncorp\\n\\nproc nonrec main() void:\\n test(\\\"49927398716\\\");\\n test(\\\"49927398717\\\");\\n test(\\\"1234567812345678\\\");\\n test(\\\"1234567812345670\\\")\\ncorp\\n\",\n \"language\": \"Draco\"\n },\n {\n \"code\": \"func luhn cc$ .\\n for i = len cc$ downto 1\\n odd = 1 - odd\\n dig = number substr cc$ i 1\\n if odd = 0\\n dig = 2 * dig\\n if dig >= 10\\n dig -= 9\\n .\\n .\\n sum += dig\\n .\\n return if sum mod 10 = 0\\n.\\ncc$[] = [ \\\"49927398716\\\" \\\"49927398717\\\" \\\"1234567812345678\\\" \\\"1234567812345670\\\" ]\\nfor cc$ in cc$[]\\n write cc$ & \\\" \\\"\\n if luhn cc$ = 1\\n print \\\"is valid\\\"\\n else\\n print \\\"is not valid\\\"\\n .\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \";; value for 'even' numbers\\n(define (even-val n) (if (> n 4) (+ n n -9) (+ n n)))\\n\\n;;Luhn test\\n;; input : a string of decimal digits\\n;; output #t or #f\\n(define (valid nums (odd #f ))\\n (let ((nums (map string->number (reverse (string->list nums)))))\\n (= 0 (modulo\\n (for/sum ((n nums)) (set! odd (not odd)) (if odd n (even-val n)))\\n 10))))\\n\\n(valid \\\"49927398716\\\") → #t\\n(valid \\\"1234567812345670\\\") → #t\\n(valid \\\"1234567812345678\\\") → #f\\n(valid \\\"49927398717\\\") → #f\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"defmodule Luhn do\\n def valid?(cc) when is_binary(cc), do: String.to_integer(cc) |> valid?\\n def valid?(cc) when is_integer(cc) do\\n 0 == Integer.digits(cc)\\n |> Enum.reverse\\n |> Enum.chunk(2, 2, [0])\\n |> Enum.reduce(0, fn([odd, even], sum) -> Enum.sum([sum, odd | Integer.digits(even*2)]) end)\\n |> rem(10)\\n end\\nend\\n\\nnumbers = ~w(49927398716 49927398717 1234567812345678 1234567812345670)\\nfor n <- numbers, do: IO.puts \\\"#{n}: #{Luhn.valid?(n)}\\\"\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"(require 'seq)\\n\\n(defun luhn (str)\\n \\\"Check if STR is a valid credit card number using the Luhn algorithm.\\\"\\n (if (string-match-p \\\"[^0-9]\\\" str)\\n (error \\\"String contains invalid character\\\")\\n (let ((digit-list (reverse (mapcar #'(lambda (x) (- x 48))\\n (string-to-list str)))))\\n (zerop\\n (mod (apply #'+ (seq-map-indexed\\n (lambda (elt idx)\\n (if (not (zerop (% idx 2)))\\n (if (> (* 2 elt) 9)\\n (- (* 2 elt) 9)\\n (* 2 elt))\\n elt))\\n digit-list))\\n 10)))))\\n\\n(mapcar #'luhn '(\\\"49927398716\\\" \\\"49927398717\\\" \\\"1234567812345678\\\" \\\"1234567812345670\\\"))\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"-module(luhn_test).\\n\\n-export( [credit_card/1, task/0] ).\\n\\nluhn_sum([Odd, Even |Rest]) when Even >= 5 ->\\n Odd + 2 * Even - 10 + 1 + luhn_sum(Rest);\\nluhn_sum([Odd, Even |Rest]) ->\\n Odd + 2 * Even + luhn_sum(Rest);\\nluhn_sum([Odd]) ->\\n Odd;\\nluhn_sum([]) ->\\n 0.\\n\\ncheck( Sum ) when (Sum rem 10) =:= 0 -> valid;\\ncheck( _Sum ) -> invalid.\\n\\ncredit_card(Digits) ->\\n check(luhn_sum(lists:map(fun(D) -> D-$0 end, lists:reverse(Digits)))).\\n\\ntask() ->\\n Numbers = [\\\"49927398716\\\", \\\"49927398717\\\", \\\"1234567812345678\\\", \\\"1234567812345670\\\"],\\n [io:fwrite(\\\"~s: ~p~n\\\", [X, credit_card(X)]) || X <- Numbers].\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"function luhn(sequence cc)\\n integer isOdd, oddSum, evenSum, digit\\n isOdd = 1\\n oddSum = 0\\n evenSum = 0\\n for i = length(cc) to 1 by -1 do\\n digit = cc[i] - '0'\\n if isOdd then\\n oddSum += digit\\n else\\n evenSum += floor(digit / 5) + remainder(2 * digit, 10)\\n end if\\n isOdd = not isOdd\\n end for\\n return not remainder(oddSum + evenSum, 10)\\nend function\\n\\nconstant cc_numbers = {\\n \\\"49927398716\\\",\\n \\\"49927398717\\\",\\n \\\"1234567812345678\\\",\\n \\\"1234567812345670\\\"\\n}\\n\\nfor i = 1 to length(cc_numbers) do\\n printf(1,\\\"%s = %d\\\\n\\\", {cc_numbers[i], luhn(cc_numbers[i])})\\nend for\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"luhnChecked\\n=LAMBDA(s,\\n LET(\\n ns, REVERSECOLS(VALUE(CHARSROW(s))),\\n ixs, SEQUENCE(1, COLUMNS(ns), 1, 1),\\n\\n 0 = MOD(SUM(\\n FILTER(ns, 0 <> MOD(ixs, 2))\\n ) + (\\n LAMBDA(n,\\n DIGITSUM(\\n CONCAT(TEXT(2 * n, \\\"0\\\"))\\n )\\n )(\\n FILTER(ns, 0 = MOD(ixs, 2))\\n )\\n ),\\n 10\\n )\\n )\\n)\\n\",\n \"language\": \"Excel\"\n },\n {\n \"code\": \"CHARSROW\\n=LAMBDA(s,\\n MID(s,\\n SEQUENCE(1, LEN(s), 1, 1),\\n 1\\n )\\n)\\n\\n\\nDIGITSUM\\n=LAMBDA(s,\\n SUM(VALUE(\\n MID(s,\\n SEQUENCE(LEN(s), 1, 1, 1),\\n 1\\n )\\n ))\\n)\\n\\n\\nREVERSECOLS\\n=LAMBDA(xs,\\n LET(\\n n, COLUMNS(xs),\\n\\n SORTBY(\\n xs,\\n SEQUENCE(1, n, n, -1)\\n )\\n )\\n)\\n\",\n \"language\": \"Excel\"\n },\n {\n \"code\": \"let luhn (s:string) =\\n let rec g r c = function\\n | 0 -> r\\n | i ->\\n let d = ((int s.[i - 1]) - 48) <<< c\\n g (r + if d < 10 then d else d - 9) (1 - c) (i - 1)\\n (g 0 0 s.Length) % 10 = 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: kernel math math.parser math.order math.ranges sequences ;\\nIN: luhn\\n\\n: reversed-digits ( n -- list )\\n { } swap\\n [ dup 0 > ]\\n [ 10 /mod swapd suffix swap ]\\n while drop ;\\n\\n: luhn-digit ( n -- n )\\n reversed-digits dup length <iota> [\\n 2dup swap nth\\n swap odd? [ 2 * 10 /mod + ] when\\n ] map sum 10 mod\\n nip ;\\n\\n: luhn? ( n -- ? )\\n luhn-digit 0 = ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": luhn ( addr len -- ? )\\n 0 >r over + ( R: sum )\\n begin 1- 2dup <=\\n while \\\\ odd\\n dup c@ [char] 0 -\\n r> + >r\\n 1- 2dup <=\\n while \\\\ even\\n dup c@ [char] 0 -\\n 2* 10 /mod + \\\\ even digits doubled, split, and summed\\n r> + >r\\n repeat then\\n 2drop r> 10 mod 0= ;\\n\\ns\\\" 49927398716\\\" luhn . \\\\ -1\\ns\\\" 49927398717\\\" luhn . \\\\ 0\\ns\\\" 1234567812345678\\\" luhn . \\\\ 0\\ns\\\" 1234567812345670\\\" luhn . \\\\ -1\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"program luhn\\n implicit none\\n integer :: nargs\\n character(len=20) :: arg\\n integer :: alen, i, dr\\n integer, allocatable :: number(:)\\n integer, parameter :: drmap(0:9) = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\\n\\n ! Get number\\n nargs = command_argument_count()\\n if (nargs /= 1) then\\n stop\\n end if\\n call get_command_argument(1, arg, alen)\\n allocate(number(alen))\\n do i=1, alen\\n number(alen-i+1) = iachar(arg(i:i)) - iachar('0')\\n end do\\n\\n ! Calculate number\\n dr = 0\\n do i=1, alen\\n dr = dr + merge(drmap(number(i)), number(i), mod(i,2) == 0)\\n end do\\n\\n if (mod(dr,10) == 0) then\\n write(*,'(a,i0)') arg(1:alen)//' is valid'\\n else\\n write(*,'(a,i0)') arg(1:alen)//' is not valid'\\n end if\\nend program luhn\\n\\n! Results:\\n! 49927398716 is valid\\n! 49927398717 is not valid\\n! 1234567812345678 is not valid\\n! 1234567812345670 is valid\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"program luhn;\\n\\n function lunh(arg: string): boolean;\\n var\\n i, sum: integer;\\n temp: byte;\\n begin\\n sum := 0;\\n for i:= length(arg) downto 1 do begin // Run the characters backwards\\n temp := byte(arg[i])-48; // Convert from ASCII to byte\\n if (length(arg)-i) mod 2 = 0\\n then sum := sum + temp // Odd characters just add\\n else if temp < 5\\n then sum := sum + 2*temp // Even characters add double\\n else sum := sum + (2*temp)-9; // or sum the digits of the doubling\\n end;\\n result := sum mod 10 = 0; // Return true if sum ends in a 0\\n end;\\n\\nbegin\\n writeln(' 49927398716: ', lunh('49927398716'));\\n writeln(' 49927398717: ', lunh('49927398717'));\\n writeln('1234567812345678: ', lunh('1234567812345678'));\\n writeln('1234567812345670: ', lunh('1234567812345670'));\\nend.\\n\",\n \"language\": \"Free-Pascal-Lazarus\"\n },\n {\n \"code\": \"' version 05-07-2015\\n' compile with: fbc -s console\\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 luhntest(cardnr As String) As Integer\\n\\n cardnr = Trim(cardnr) ' we don't want spaces\\n Dim As String reverse_nr = cardnr\\n Dim As Integer i, j, s1, s2, l = Len(cardnr) - 1\\n\\n ' reverse string\\n For i = 0 To l\\n reverse_nr[i] = cardnr[l - i]\\n Next\\n ' sum odd numbers\\n For i = 0 To l Step 2\\n s1 = s1 + (reverse_nr[i] - Asc(\\\"0\\\"))\\n Next\\n ' sum even numbers\\n For i = 1 To l Step 2\\n j = reverse_nr[i] - Asc(\\\"0\\\")\\n j = j * 2\\n If j > 9 Then j = j Mod 10 + 1\\n s2 = s2 + j\\n Next\\n\\n If (s1 + s2) Mod 10 = 0 Then\\n Return TRUE\\n Else\\n Return FALSE\\n End If\\n\\nEnd Function\\n\\n' ------=< MAIN >=------\\n\\nDim As String input_nr(1 To ...) = {\\\"49927398716\\\", \\\"49927398717\\\",_\\n \\\"1234567812345678\\\", \\\"1234567812345670\\\"}\\nDim As Integer a\\n\\nPrint \\\"Task test number 49927398716 should be TRUE, report back as \\\";\\nPrint IIf(luhntest(\\\"49927398716\\\" ) = TRUE, \\\"TRUE\\\", \\\"FALSE\\\")\\nPrint : Print\\n\\nPrint \\\"test card nr:\\\"\\nFor a = 1 To UBound(input_nr)\\n Print input_nr(a); \\\" = \\\"; IIf(luhntest(input_nr(a)) = TRUE, \\\"TRUE\\\", \\\"FALSE\\\")\\nNext\\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\": \"def luhn_checksum( card_number ) =\\n def digits_of( n ) = [int(d) | d <- n.toString()]\\n\\n digits = digits_of( card_number ).reverse()\\n odd_digits = digits(0:digits.length():2)\\n even_digits = digits(1:digits.length():2)\\n (sum( odd_digits ) + sum( sum(digits_of(d*2)) | d <- even_digits )) mod 10\\n\\ndef is_luhn_valid( card_number ) = luhn_checksum( card_number ) == 0\\n\\nfor n <- [49927398716, 49927398717, 1234567812345678, 1234567812345670]\\n println( n + ' is ' + (if is_luhn_valid(n) then 'valid' else 'invalid') )\\n\",\n \"language\": \"FunL\"\n },\n {\n \"code\": \"include \\\"NSLog.incl\\\"\\n\\nlocal fn LuhnCheck( cardStr as CFStringRef ) as BOOL\\n NSInteger i, j, count, s1 = 0, s2 = 0\\n BOOL result = NO\\n\\n // Build array of individual numbers in credit card string\\n NSUInteger strLength = len(cardStr)\\n CFMUtableArrayRef mutArr = fn MutableArrayWithCapacity(strLength)\\n for i = 0 to strLength - 1\\n CFStringRef tempStr = fn StringWithFormat( @\\\"%C\\\", fn StringCharacterAtIndex( cardStr, i ) )\\n MutableArrayInsertObjectAtIndex( mutArr, tempStr, i )\\n next\\n\\n // Reverse the number array\\n CFArrayRef reversedArray = fn EnumeratorAllObjects( fn ArrayReverseObjectEnumerator( mutArr ) )\\n\\n // Get number of array elements\\n count = len(reversedArray)\\n\\n // Handle odd numbers\\n for i = 0 to count - 1 step 2\\n s1 = s1 + fn StringIntegerValue( reversedArray[i] )\\n next\\n\\n // Hnadle even numbers\\n for i = 1 to count - 1 step 2\\n j = fn StringIntegerValue( reversedArray[i] )\\n j = j * 2\\n if j > 9 then j = j mod 10 + 1\\n s2 = s2 + j\\n next\\n\\n if (s1 + s2) mod 10 = 0 then result = YES else result = NO\\nend fn = result\\n\\nNSLogClear\\nif fn LuhnCheck( @\\\"49927398716\\\" ) then NSLog (@\\\"%@ is valid.\\\", @\\\"49927398716\\\" ) else NSLog (@\\\"%@ is not valid.\\\", @\\\"49927398716\\\" )\\nif fn LuhnCheck( @\\\"49927398717\\\" ) then NSLog (@\\\"%@ is valid.\\\", @\\\"49927398717\\\" ) else NSLog (@\\\"%@ is not valid.\\\", @\\\"49927398717\\\" )\\nif fn LuhnCheck( @\\\"1234567812345678\\\" ) then NSLog (@\\\"%@ is valid.\\\", @\\\"1234567812345678\\\" ) else NSLog (@\\\"%@ is not valid.\\\", @\\\"1234567812345678\\\" )\\nif fn LuhnCheck( @\\\"1234567812345670\\\" ) then NSLog (@\\\"%@ is valid.\\\", @\\\"1234567812345670\\\" ) else NSLog (@\\\"%@ is not valid.\\\", @\\\"1234567812345670\\\" )\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"Public Sub Main()\\nDim sTrial As String[] = [\\\"49927398716\\\", \\\"49927398717\\\", \\\"1234567812345678\\\", \\\"1234567812345670\\\"]\\nDim sRev As String\\nDim siCount, siOdd, siEven, siHold, siQty As Short\\n\\nFor siQty = 0 To sTrial.Max\\n\\n siOdd = 0\\n siEven = 0\\n sRev = \\\"\\\"\\n\\n For siCount = Len(sTrial[siQty]) DownTo 1\\n sRev &= Mid(sTrial[siQty], siCount, 1)\\n Next\\n\\n For siCount = 1 To Len(sRev)\\n If Odd(siCount) Then siOdd += Val(Mid(sRev, siCount, 1))\\n If Even(siCount) Then\\n siHold = Val(Mid(sRev, siCount, 1)) * 2\\n If siHold > 9 Then\\n siEven += Val(Mid(Str(siHold), 1, 1)) + Val(Mid(Str(siHold), 2, 1))\\n Else\\n siEven += Val(Mid(sRev, siCount, 1)) * 2\\n End If\\n End If\\n Next\\n\\n sRev = Str(siOdd + siEven)\\n If sRev Ends \\\"0\\\" Then\\n Print sTrial[siQty] & \\\" is a valid number\\\"\\n Else\\n Print sTrial[siQty] & \\\" is NOT a valid number\\\"\\n End If\\nNext\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"IsLuhn := function(n)\\n\\tlocal c, d, i, j, r;\\n\\td := \\\"0123456789\\\";\\n\\tj := 1;\\n\\tr := 0;\\n\\tfor c in Reversed(String(n)) do\\n\\t\\ti := Position(d, c);\\n\\t\\tif i = fail then\\n\\t\\t\\tcontinue;\\n\\t\\tfi;\\n\\t\\ti := j*(i - 1);\\n\\t\\tr := r + QuoInt(i, 10) + RemInt(i, 10);\\n\\t\\tj := 3 - j;\\n\\tod;\\n\\treturn RemInt(r, 10) = 0;\\nend;\\n\\nList([49927398716, 49927398717, 1234567812345678, 1234567812345670], IsLuhn);\\n# [ true, false, false, true ]\\n\\n# Will also work on strings, and will skip non-digits\\nIsLuhn(\\\"4-992-739-871-6\\\");\\n# true\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"strings\\\"\\n)\\n\\nconst input = `49927398716\\n49927398717\\n1234567812345678\\n1234567812345670`\\n\\nvar t = [...]int{0, 2, 4, 6, 8, 1, 3, 5, 7, 9}\\n\\nfunc luhn(s string) bool {\\n odd := len(s) & 1\\n var sum int\\n for i, c := range s {\\n if c < '0' || c > '9' {\\n return false\\n }\\n if i&1 == odd {\\n sum += t[c-'0']\\n } else {\\n sum += int(c - '0')\\n }\\n }\\n return sum%10 == 0\\n}\\n\\nfunc main() {\\n for _, s := range strings.Split(input, \\\"\\\\n\\\") {\\n fmt.Println(s, luhn(s))\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def checkLuhn(number) {\\n int total\\n (number as String).reverse().eachWithIndex { ch, index ->\\n def digit = Integer.parseInt(ch)\\n total += (index % 2 ==0) ? digit : [0, 2, 4, 6, 8, 1, 3, 5, 7, 9][digit]\\n }\\n total % 10 == 0\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def verifyLuhn(number, expected) {\\n println \\\"Checking: $number (${checkLuhn(number)})\\\"\\n assert expected == checkLuhn(number)\\n}\\n\\n[49927398716: true, 49927398717: false, 1234567812345678: false, 1234567812345670: true].each { number, expected ->\\n verifyLuhn number, expected\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Data.Char (digitToInt)\\nluhn = (0 ==) . (`mod` 10) . sum . map (uncurry (+) . (`divMod` 10)) .\\n zipWith (*) (cycle [1,2]) . map digitToInt . reverse\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"map luhn [\\\"49927398716\\\", \\\"49927398717\\\", \\\"1234567812345678\\\", \\\"1234567812345670\\\"]\\n[True,False,False,True]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Char (digitToInt)\\nimport Data.List (transpose)\\nimport Data.List.Split (chunksOf)\\n\\nluhn :: String -> Bool\\nluhn x = 0 == rem (s1 + s2) 10\\n where\\n stringInts = fmap digitToInt\\n [odds, evens] =\\n (transpose . chunksOf 2)\\n (stringInts $ reverse x)\\n s1 = sum odds\\n s2 = sum $ sum . stringInts . show . (2 *) <$> evens\\n\\nmain :: IO ()\\nmain =\\n mapM_\\n (print . ((,) <*> luhn))\\n [ \\\"49927398716\\\",\\n \\\"49927398717\\\",\\n \\\"1234567812345678\\\",\\n \\\"1234567812345670\\\"\\n ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"CHARACTER numbers=\\\"49927398716 49927398717 1234567812345678 1234567812345670 \\\"\\n\\nDO nr = 1, 4\\n EDIT(Text=numbers, ITeM=nr, Parse=number)\\n sum_odds = 0\\n sum_even = 0\\n DO i = LEN(number), 1, -2\\n sum_odds = sum_odds + ICHAR(number(i)) - 48\\n IF(i > 1) THEN\\n even2 = 2 * (ICHAR(number(i-1)) - 48)\\n sum_even = sum_even + MOD(even2, 10) + INT(even2/10)\\n ENDIF\\n ENDDO\\n valid = (0 == MOD(sum_odds + sum_even, 10))\\n WRITE() number, \\\" is \\\", \\\"invalid\\\"(1 + 2*valid:)\\nENDDO\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"procedure main(aL)\\nevery write(i := !aL ,\\\" - \\\", ((\\\\isluhn10(i),\\\"valid\\\")|\\\"invalid\\\") \\\\ 1)\\nend\\n\\nprocedure isluhn10(i) #: isluhn10(i) returns i (if i passes luhn10) or fails\\nlocal sum\\n\\nsum :=0\\nreverse(integer(i)) ? while not pos(0) do {\\n sum +:= move(1)\\n sum +:= map(move(1),\\\"0123456789\\\",\\\"0246813579\\\")\\n }\\n\\nreturn (sum % 10 = 0,i)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"100 PROGRAM \\\"CredCard.bas\\\"\\n110 DO\\n120 PRINT :PRINT \\\"Credit card number:\\\":INPUT PROMPT \\\">\\\":CCN$\\n130 IF CCN$=\\\"\\\" THEN EXIT DO\\n140 IF LUHN(TRIM$(CCN$)) THEN\\n150 PRINT \\\"Card number is valid.\\\"\\n160 ELSE\\n170 SET #102:INK 3:PRINT \\\"Card number is invalid.\\\":SET #102:INK 1\\n180 END IF\\n190 LOOP\\n200 DEF LUHN(CCN$)\\n210 LET L=LEN(CCN$):LET S=0\\n220 FOR I=1 TO L\\n230 LET N=VAL(CCN$(L-I+1))\\n240 IF I BAND 1 THEN\\n250 LET S=S+N\\n260 ELSE\\n270 LET N=N*2:LET S=S+MOD(N,10)+INT(N/10)\\n280 END IF\\n290 NEXT\\n300 LET LUHN=MOD(S,10)=0\\n310 END DEF\\n320 DEF TRIM$(S$)\\n330 LET T$=\\\"\\\"\\n340 FOR I=1 TO LEN(S$)\\n350 IF S$(I)>CHR$(47) AND S$(I)<CHR$(58) THEN LET T$=T$&S$(I)\\n360 NEXT\\n370 LET TRIM$=T$\\n380 END DEF\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \"luhn=: 0 = 10 (| +/@,) 10 #.inv 1 2 *&|: _2 \\\".\\\"0\\\\ |.\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" luhn&> '49927398716';'49927398717';'1234567812345678';'1234567812345670'\\n1 0 0 1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class Luhn {\\n public static void main(String[] args) {\\n System.out.println(luhnTest(\\\"49927398716\\\"));\\n System.out.println(luhnTest(\\\"49927398717\\\"));\\n System.out.println(luhnTest(\\\"1234567812345678\\\"));\\n System.out.println(luhnTest(\\\"1234567812345670\\\"));\\n }\\n\\n public static boolean luhnTest(String number){\\n int s1 = 0, s2 = 0;\\n String reverse = new StringBuffer(number).reverse().toString();\\n for(int i = 0 ;i < reverse.length();i++){\\n int digit = Character.digit(reverse.charAt(i), 10);\\n if(i % 2 == 0){//this is for odd digits, they are 1-indexed in the algorithm\\n s1 += digit;\\n }else{//add 2 * digit for 0-4, add 2 * digit - 9 for 5-9\\n s2 += 2 * digit;\\n if(digit >= 5){\\n s2 -= 9;\\n }\\n }\\n }\\n return (s1 + s2) % 10 == 0;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"mod10check = function(cc) {\\n return $A(cc).reverse().map(Number).inject(0, function(s, d, i) {\\n return s + (i % 2 == 1 ? (d == 9 ? 9 : (d * 2) % 9) : d);\\n }) % 10 == 0;\\n};\\n['49927398716','49927398717','1234567812345678','1234567812345670'].each(function(i){alert(mod10check(i))});\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"var LuhnCheck = (function()\\n{\\n\\tvar luhnArr = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9];\\n\\treturn function(str)\\n\\t{\\n\\t\\tvar counter = 0;\\n\\t\\tvar incNum;\\n\\t\\tvar odd = false;\\n\\t\\tvar temp = String(str).replace(/[^\\\\d]/g, \\\"\\\");\\n\\t\\tif ( temp.length == 0)\\n\\t\\t\\treturn false;\\n\\t\\tfor (var i = temp.length-1; i >= 0; --i)\\n\\t\\t{\\n\\t\\t\\tincNum = parseInt(temp.charAt(i), 10);\\n\\t\\t\\tcounter += (odd = !odd)? incNum : luhnArr[incNum];\\n\\t\\t}\\n\\t\\treturn (counter%10 == 0);\\n\\t}\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"var luhn10 = function(a,b,c,d,e) {\\n for(d = +a[b = a.length-1], e=0; b--;)\\n c = +a[b], d += ++e % 2 ? 2 * c % 10 + (c > 4) : c;\\n return !(d%10)\\n};\\n\\n// returns true\\nluhn10('4111111111111111')\\n\\n// returns false\\nluhn10('4111111111111112')\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"const lunhCheck = (str) => {\\n const sumDigit = (c) => (c < 10) ? c :\\n sumDigit( Math.trunc(c / 10) + (c % 10));\\n\\n return str.split('').reverse()\\n .map(Number)\\n .map((c, i) => i % 2 !== 0 ? sumDigit(c * 2) : c)\\n .reduce((acc,v) => acc + v) % 10 === 0;\\n};\\n\\nlunhCheck('49927398716'); // returns true\\nlunhCheck('49927398717'); // returns false\\nlunhCheck('1234567812345678'); // returns false\\nlunhCheck('1234567812345670'); // returns true\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def luhn:\\n def odds: . as $in | reduce range(0; length) as $i\\n ([]; if ($i % 2) == 0 then . + [$in[$i]] else . end);\\n def evens: . as $in | reduce range(1; length) as $i\\n ([]; if ($i % 2) == 1 then . + [$in[$i]] else . end);\\n def digits: map([.]|implode|tonumber);\\n def sumdigits: tostring | explode | digits | add;\\n\\n (tostring | explode | reverse ) as $reverse\\n | ($reverse | odds | digits | add) as $s1\\n | ($reverse | evens | digits | map(. * 2 | sumdigits) | add) as $s2\\n | 0 == ($s1 + $s2) % 10 ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \" ( 49927398716,\\n 49927398717,\\n 1234567812345678,\\n 1234567812345670\\n ) | \\\"\\\\(.) => \\\\(luhn)\\\";\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"luhntest(x::Integer) = (sum(digits(x)[1:2:end]) + sum(map(x -> sum(digits(x)), 2 * digits(x)[2:2:end]))) % 10 == 0\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"function luhntest(x::Integer)\\n d = reverse(digits(x))\\n s = sum(d[1:2:end])\\n s += sum(sum.(digits.(2d[2:2:end])))\\n return s % 10 == 0\\nend\\n\\nfor card in [49927398716, 49927398717, 1234567812345678, 1234567812345670]\\n println(luhntest(card) ? \\\"PASS \\\" : \\\"FAIL \\\", card)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"so: {+/x@2*!_ceil(#x)%2}\\nse: {+/{+/0$'$x}'2*x@1+2*!(#x)%2}\\nluhn: {n:|0$'$x; 0=((se n)+so n)!10}\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"luhn2: {~(+/,//10_vs'1 2*+-1 2#((#n)!2){x,0}/n:0$'|$x)\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \" luhn'49927398716 49927398717 1234567812345678 1234567812345670\\n1 0 0 1\\n luhn2'49927398716 49927398717 1234567812345678 1234567812345670\\n1 0 0 1\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"luhn:{[cc]\\n digits:0$/:|cc / convert chars to digit ints\\n s:digits*(#cc)#1 2 / evens doubled, odds not\\n nines:+/s>9 / number of sums greater than 9\\n :~((+/s)-(9*nines))!10 / sum minus the nines is mod ten?\\n }\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \" test:(\\\"49927398716\\\";\\\"49927398717\\\";\\\"1234567812345678\\\";\\\"1234567812345670\\\")\\n luhn'test\\n1 0 0 1\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"// version 1.0\\n\\nfun checkLuhn(number: String): Boolean {\\n var isOdd = true\\n var sum = 0\\n\\n for (index in number.indices.reversed()) {\\n val digit = number[index] - '0'\\n sum += if (isOdd) digit else (digit * 2).let { (it / 10) + (it % 10) }\\n isOdd = !isOdd\\n }\\n\\n return (sum % 10) == 0\\n}\\n\\nfun main(args: Array<String>) {\\n val numbers = arrayOf(\\\"49927398716\\\", \\\"49927398717\\\", \\\"1234567812345678\\\", \\\"1234567812345670\\\")\\n for (number in numbers)\\n println(\\\"${number.padEnd(16)} is ${if(checkLuhn(number)) \\\"valid\\\" else \\\"invalid\\\"}\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"val .luhntest = fn(.s) {\\n val .t = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\\n val .numbers = s2n .s\\n val .oddeven = len(.numbers) rem 2\\n\\n for[=0] .i of .numbers {\\n _for += if(.i rem 2 == .oddeven: .numbers[.i]; .t[.numbers[.i]+1])\\n } div 10\\n}\\n\\nval .tests = h{\\n \\\"49927398716\\\": true,\\n \\\"49927398717\\\": false,\\n \\\"1234567812345678\\\": false,\\n \\\"1234567812345670\\\": true,\\n}\\n\\nfor .key of .tests {\\n val .pass = .luhntest(.key)\\n write .key, \\\": \\\", .pass\\n writeln if(.pass == .tests[.key]: \\\"\\\"; \\\" (LUHN TEST FAILED)\\\")\\n}\\n\",\n \"language\": \"Langur\"\n },\n {\n \"code\": \"#!/usr/bin/lasso9\\n\\ndefine luhn_check(number) => {\\n local(\\n rev = #number->asString,\\n checksum = 0\\n )\\n #rev->reverse\\n iterate(#rev, local(digit)) => {\\n if((loop_count % 2) == 0) => {\\n #checksum += (2 * integer(#digit))\\n integer(#digit) >= 5 ? #checksum -= 9\\n else\\n #checksum += integer(#digit)\\n }\\n }\\n (#checksum % 10) != 0 ? return false\\n return true\\n}\\n\\nstdoutnl(luhn_check(49927398716)) // true\\nstdoutnl(luhn_check(49927398717)) // false\\nstdoutnl(luhn_check(1234567812345678)) // false\\nstdoutnl(luhn_check(1234567812345670)) // true\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"' [RC] Luhn test\\n\\ncard$(1)=\\\"49927398716\\\"\\ncard$(2)=\\\"49927398717\\\"\\ncard$(3)=\\\"1234567812345678\\\"\\ncard$(4)=\\\"1234567812345670\\\"\\n\\nfor test = 1 to 4\\n odd=1\\n sum = 0\\n for n = len(card$(test)) to 1 step -1\\n num=val(mid$(card$(test),n,1))\\n if odd then\\n sum = sum + num\\n odd=0\\n else\\n num=num*2\\n if num<=9 then\\n sum = sum + num\\n else\\n sum = sum + val(left$(str$(num),1)) + val(right$(str$(num),1))\\n end if\\n odd=1\\n end if\\n next\\n if sum mod 10 = 0 then\\n print card$(test),\\\"True\\\"\\n else\\n print card$(test),\\\"False\\\"\\n end if\\nnext\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"function LuhnTest cc\\n local s1,evens, s2\\n repeat with n = 1 to len(cc)\\n if n mod 2 is not 0 then\\n add (char -n of cc) to s1\\n else\\n put (char -n of cc) * 2 into evens\\n if evens > 9 then subtract 9 from evens\\n add evens to s2\\n end if\\n end repeat\\n return the last char of (s1 + s2) is 0\\nend LuhnTest\\n\\n-- test\\nrepeat for each item ccno in \\\"49927398716,49927398717,1234567812345678,1234567812345670\\\"\\n put ccno && LuhnTest(ccno) & cr after luhncheck\\nend repeat\\nput luhncheck\\n\\n49927398716 true\\n49927398717 false\\n1234567812345678 false\\n1234567812345670 true\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"to small? :list\\n output or [empty? :list] [empty? bf :list]\\nend\\nto every.other :list\\n if small? :list [output :list]\\n output fput first :list every.other bf bf :list\\nend\\nto wordtolist :word\\n output map.se [?] :word\\nend\\n\\nto double.digit :digit\\n output item :digit {0 2 4 6 8 1 3 5 7 9}@0\\n ; output ifelse :digit < 5 [2*:digit] [1 + modulo 2*:digit 10]\\nend\\n\\nto luhn :credit\\n localmake \\\"digits reverse filter [number? ?] wordtolist :credit\\n localmake \\\"s1 apply \\\"sum every.other :digits\\n localmake \\\"s2 apply \\\"sum map \\\"double.digit every.other bf :digits\\n output equal? 0 last sum :s1 :s2\\nend\\n\\nshow luhn \\\"49927398716 ; true\\nshow luhn \\\"49927398717 ; false\\nshow luhn \\\"1234-5678-1234-5678 ; false\\nshow luhn \\\"1234-5678-1234-5670 ; true\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"function luhn(n)\\n n=string.reverse(n)\\n print(n)\\n local s1=0\\n --sum odd digits\\n for i=1,n:len(),2 do\\n s1=s1+n:sub(i,i)\\n end\\n --evens\\n local s2=0\\n for i=2,n:len(),2 do\\n local doubled=n:sub(i,i)*2\\n doubled=string.gsub(doubled,'(%d)(%d)',function(a,b)return a+b end)\\n s2=s2+doubled\\n end\\n print(s1)\\n print(s2)\\n local total=s1+s2\\n if total%10==0 then\\n return true\\n end\\n return false\\nend\\n\\n-- Note that this function takes strings, not numbers.\\n-- 16-digit numbers tend to be problematic\\n-- when looking at individual digits.\\nprint(luhn'49927398716')\\nprint(luhn'49927398717')\\nprint(luhn'1234567812345678')\\nprint(luhn'1234567812345670')\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Checkit {\\n Function luhntest(cardnr$) {\\n\\n cardnr$ = Trim$(cardnr$) ' we don't want spaces\\n if len(cardnr$)=0 then exit\\n Dim Base 0, reverse_nr$(Len(cardnr$))\\n Def integer i, j, s1, s2, l , l2\\n Let l=Len(cardnr$)-1, l2=l+1\\n\\n ' reverse string\\n For i = 0 To l\\n reverse_nr$(i) = mid$(cardnr$,l2-i,1)\\n Next i\\n ' sum odd numbers\\n For i = 0 To l Step 2\\n s1 = s1 + (Asc(reverse_nr$(i)) - Asc(\\\"0\\\"))\\n Next i\\n ' sum even numbers\\n For i = 1 To l Step 2\\n j = Asc(reverse_nr$(i)) - Asc(\\\"0\\\")\\n j = j * 2\\n If j > 9 Then j = j Mod 10 + 1\\n s2 = s2 + j\\n Next i\\n\\n If (s1 + s2) Mod 10 = 0 Then\\n = 1=1\\n Else\\n = 1=0\\n End If\\n }\\n Flush\\n Data \\\"49927398716\\\", \\\"49927398717\\\", \\\"1234567812345678\\\", \\\"1234567812345670\\\"\\n while not empty\\n over\\n print letter$;\\\" = \\\";luhntest(letter$)\\n end while\\n}\\nCheckit\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \" .TITLE LUHN\\n .MCALL .GTLIN,.PRINT,.EXIT\\nLUHN:: .GTLIN #5$\\n MOV #5$,R0\\n TSTB (R0)\\n BEQ 2$\\n JSR PC,TEST\\n BNE 1$\\n .PRINT #3$\\n BR LUHN\\n1$: .PRINT #4$\\n BR LUHN\\n2$: .EXIT\\n3$: .ASCIZ /PASS/\\n4$: .ASCIZ /FAIL/\\n5$: .BLKB 200\\n .EVEN\\n\\nTEST: MOV R0,R1\\n CLR R2\\n1$: TSTB (R0)+\\n BNE 1$\\n DEC R0\\n2$: MOVB -(R0),R3\\n SUB #60,R3\\n ADD R3,R2\\n CMP R0,R1\\n BLOS 3$\\n MOVB -(R0),R3\\n SUB #60,R3\\n MOVB 4$(R3),R3\\n ADD R3,R2\\n CMP R0,R1\\n BHI 2$\\n3$: SUB #12,R2\\n BHI 3$\\n RTS PC\\n4$: .BYTE ^D0,^D2,^D4,^D6,^D8\\n .BYTE ^D1,^D3,^D5,^D7,^D9\\n .END LUHN\\n\",\n \"language\": \"MACRO-11\"\n },\n {\n \"code\": \"LuhnQ[nb_] := (Mod[Total[(2*ToExpression[#[[2;;All;;2]]]) /. {z_?(Function[v, v>9]) -> z-9}]\\n + Total[ToExpression[#[[1;;All;;2]]]], 10] == 0)& [Characters[StringReverse[ToString[nb]]] ]\\n\\nLuhnQ /@ {49927398716, 49927398717, 1234567812345678, 1234567812345670}\\n->{True, False, False, True}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"LuhnQ[n_Integer] :=\\n Block[{digits = Reverse@IntegerDigits@n},\\n Mod[Total[{digits[[;; ;; 2]],\\n IntegerDigits[2 #] & /@ digits[[2 ;; ;; 2]]}, -1], 10] == 0]\\n\\nLuhnQ /@ {49927398716, 49927398717, 1234567812345678, 1234567812345670}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function passed = luhn(num)\\nif nargin == 0 % evaluate test cases\\n testnum = [49927398716 49927398717 1234567812345678 1234567812345670];\\n for num = testnum\\n disp([int2str(num) ': ' int2str(luhn(num))])\\n end\\n return\\nend\\n% luhn function starts here\\nd = int2str(num) - '0';\\t% convert number into vector of digits\\nm = [2:2:8,1:2:9];\\t% rule 3: maps 1:9 to [2 4 6 8 1 3 5 7 9]\\npassed = ~mod(sum(d(end:-2:1)) + sum(m(d(end-1:-2:1))), 10);\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"((dup 10 <) 'quote (((10 mod) (10 div)) cleave) 'cons linrec) :digits\\n((0 0) dip (pop 'succ dip over even?) partition ((pop pop) dip) dip) :evens/odds\\n((2 * digits sum) map sum) :evens-sum\\n(digits evens/odds ('evens-sum 'sum) => spread + 10 mod 0 ==) :luhn?\\n\\n(49927398716 49927398717 1234567812345678 1234567812345670)\\n(dup print! \\\" \\\" print! luhn? puts!) foreach\\n\",\n \"language\": \"Min\"\n },\n {\n \"code\": \"isValid = function(s)\\n sum = 0\\n odd = true\\n for i in range(s.len-1)\\n d = val(s[i])\\n sum = sum + d * (2 - odd)\\n if not odd and d > 4 then sum = sum - 9\\n odd = not odd\\n end for\\n return sum % 10 == 0\\nend function\\n\\ntest = function(s)\\n if isValid(s) then print s + \\\": valid\\\" else print s + \\\": invalid\\\"\\nend function\\n\\ntest \\\"49927398716\\\"\\ntest \\\"49927398717\\\"\\ntest \\\"1234567812345678\\\"\\ntest \\\"1234567812345670\\\"\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"LUHN(C)\\n NEW ODD,EVEN,S\\n SET S=$REVERSE(C)\\n SET ODD=0 FOR I=1:2:$LENGTH(S) SET ODD=ODD+$EXTRACT(S,I)\\n SET EVEN=0 FOR I=2:2:$LENGTH(S) SET T=$EXTRACT(S,I)*2 SET EVEN=EVEN+$SELECT(T<=9:T,T>9:$EXTRACT(T,1)+$EXTRACT(T,2))\\n QUIT '((ODD+EVEN)#10)\\n\",\n \"language\": \"MUMPS\"\n },\n {\n \"code\": \"def reverse_str(string)\\n to_return = \\\"\\\"\\n\\n for i in range(len(string) - 1, 0, -1)\\n to_return += string[i]\\n end for\\n\\n return to_return\\nend reverse_str\\n\\ndef luhnTest(number)\\n s1 = 0; s2 = 0\\n reversed = reverse_str(number)\\n for i in range(0, len(reversed) - 1)\\n digit = int(reversed[i])\\n if (i % 2) = 0\\n s1 += digit\\n else\\n s2 += 2 * digit\\n if digit >= 5\\n s2 -= 9\\n end if\\n end if\\n end for\\n\\n return ((s1 + s2) % 10) = 0\\nend luhnTest\\n\\nprintln luhnTest(\\\"49927398716\\\")\\nprintln luhnTest(\\\"49927398717\\\")\\nprintln luhnTest(\\\"1234567812345678\\\")\\nprintln luhnTest(\\\"1234567812345670\\\")\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"class LuhnTest\\n\\n method main(args=String[]) static\\n cc\\t = 0\\n cc[1] = '49927398716'\\n cc[2] = '49927398717'\\n cc[3] = '1234567812345678'\\n cc[4] = '1234567812345670'\\n\\n loop k=1 while cc[k] <> 0\\n r = checksum(cc[k])\\n if r==0 then say cc[k].right(20) 'passed'\\n else say cc[k].right(20) 'failed'\\n end\\n\\n -- Luhn algorithm checksum for credit card numbers\\n method checksum(t) static\\n if t.length()//2 then t = '0't --pad # on left with 0\\n t = t.reverse()\\n s = 0\\n loop j = 1 to t.length()-1 by 2\\n q = 2*t.substr(j+1,1)\\n if q>9 then q = q.left(1) + q.right(1)\\n s= s+t.substr(j,1)+q\\n end\\n return s//10\\\\==0\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"proc luhn(cc: string): bool =\\n const m = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\\n var sum = 0\\n var odd = true\\n for i in countdown(cc.high, 0):\\n let digit = ord(cc[i]) - ord('0')\\n sum += (if odd: digit else: m[digit])\\n odd = not odd\\n result = sum mod 10 == 0\\n\\nfor cc in [\\\"49927398716\\\", \\\"49927398717\\\", \\\"1234567812345678\\\", \\\"1234567812345670\\\"]:\\n echo cc, ' ', luhn(cc)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"bundle Default {\\n class Luhn {\\n function : IsValid(cc : String) ~ Bool {\\n isOdd := true;\\n oddSum := 0;\\n evenSum := 0;\\n\\n for(i := cc->Size() - 1; i >= 0; i -= 1;) {\\n digit : Int := cc->Get(i) - '0';\\n if(isOdd) {\\n oddSum += digit;\\n }\\n else {\\n evenSum += digit / 5 + (2 * digit) % 10;\\n };\\n isOdd := isOdd <> true;\\n };\\n\\n return (oddSum + evenSum) % 10 = 0;\\n }\\n\\n function : Main(args : String[]) ~ Nil {\\n IsValid(\\\"49927398716\\\")->PrintLine();\\n IsValid(\\\"49927398717\\\")->PrintLine();\\n IsValid(\\\"1234567812345678\\\")->PrintLine();\\n IsValid(\\\"1234567812345670\\\")->PrintLine();\\n }\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"- (NSArray *) toCharArray {\\n\\t\\n\\tNSMutableArray *characters = [[NSMutableArray alloc] initWithCapacity:[self length]];\\n\\tfor (int i=0; i < [self length]; i++) {\\n\\t\\tNSString *ichar = [NSString stringWithFormat:@\\\"%C\\\", [self characterAtIndex:i]];\\n\\t\\t[characters addObject:ichar];\\n\\t}\\n\\t\\n\\treturn characters;\\n}\\n\\n+ (BOOL) luhnCheck:(NSString *)stringToTest {\\n\\t\\n\\tNSArray *stringAsChars = [stringToTest toCharArray];\\n\\t\\n\\tBOOL isOdd = YES;\\n\\tint oddSum = 0;\\n\\tint evenSum = 0;\\n\\t\\n\\tfor (int i = [stringToTest length] - 1; i >= 0; i--) {\\n\\t\\t\\n\\t\\tint digit = [(NSString *)stringAsChars[i] intValue];\\n\\t\\t\\n\\t\\tif (isOdd)\\n\\t\\t\\toddSum += digit;\\n\\t\\telse\\n\\t\\t\\tevenSum += digit/5 + (2*digit) % 10;\\n\\t\\t\\t\\n\\t\\tisOdd = !isOdd;\\t\\t\\t\\t\\n\\t}\\n\\t\\n\\treturn ((oddSum + evenSum) % 10 == 0);\\n}\\n\\nBOOL test0 = [self luhnCheck:@\\\"49927398716\\\"]; //Result = YES\\nBOOL test1 = [self luhnCheck:@\\\"49927398717\\\"]; //Result = NO\\nBOOL test2 = [self luhnCheck:@\\\"1234567812345678\\\"]; //Result = NO\\t\\t\\t\\t\\nBOOL test3 = [self luhnCheck:@\\\"1234567812345670\\\"]; //Result = YES\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"let luhn s =\\n let rec g r c = function\\n | 0 -> r\\n | i ->\\n let d = c * ((int_of_char s.[i-1]) - 48) in\\n g (r + (d/10) + (d mod 10)) (3-c) (i-1)\\n in\\n (g 0 1 (String.length s)) mod 10 = 0\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"# List.map luhn [ \\\"49927398716\\\"; \\\"49927398717\\\"; \\\"1234567812345678\\\"; \\\"1234567812345670\\\" ];;\\n- : bool list = [true; false; false; true]\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \" function y = isluhn(s);\\n\\tif isnumeric(s) s = mat2str(s); end; \\t% make sure s is a string\\n\\td = s-'0';\\t% convert string into vector of digits\\n\\tm = [2:2:8,1:2:9];\\t% rule 3: maps [1:9] -> i\\n\\ty = ~mod(sum(d(end:-2:1)) + sum(m(d(end-1:-2:1))),10);\\n end;\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \" isluhn('49927398716')\\n\\tans = 1\\n isluhn('49927398717')\\n\\tans = 0\\n isluhn('1234567812345678')\\n\\tans = 0\\n isluhn('1234567812345670')\\n\\tans = 1\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \": luhnTest(n)\\n| s i |\\n n asString reverse ->s\\n 0 s size loop: i [\\n i s at asDigit\\n i isEven ifTrue: [ 2 * dup 10 >= ifTrue: [ 9 - ] ] +\\n ]\\n 10 mod ==0 ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"FUNCTION fnLuhnAlgorithm RETURNS LOGICAL\\n (INPUT pcNumber AS CHARACTER):\\n/*------------------------------------------------------------------------------\\n Purpose: Applies Luhn Algorithm to check a Number\\n Notes: Returns True/False Validation based on check digit\\n------------------------------------------------------------------------------*/\\n DEFINE VARIABLE cNum AS CHARACTER NO-UNDO.\\n DEFINE VARIABLE iCheck AS INTEGER NO-UNDO.\\n DEFINE VARIABLE iLength AS INTEGER NO-UNDO.\\n DEFINE VARIABLE iLoopCnt AS INTEGER NO-UNDO.\\n DEFINE VARIABLE iNum AS INTEGER NO-UNDO.\\n DEFINE VARIABLE iNum1 AS INTEGER NO-UNDO.\\n DEFINE VARIABLE iNum2 AS INTEGER NO-UNDO.\\n DEFINE VARIABLE iTestLength AS INTEGER NO-UNDO.\\n\\n ASSIGN\\n iLength = LENGTH(pcNumber)\\n iTestLength = iLength - 1\\n iCheck = 1. /* 1 for the check digit we skip */\\n\\n DO iLoopCnt = iTestLength TO 1 BY -1:\\n ASSIGN\\n iNum = INTEGER(SUBSTR(pcNumber,iLoopCnt,1))\\n iCheck = iCheck + 1.\\n\\n IF iCheck MODULO 2 = 1 THEN\\n ASSIGN iNum1 = iNum1 + iNum.\\n ELSE\\n DO:\\n ASSIGN iNum2 = iNum * 2.\\n IF iNum2 < 10 THEN\\n ASSIGN iNum1 = iNum1 + iNum2.\\n ELSE\\n ASSIGN\\n cNum = STRING(iNum2)\\n iNum1 = iNum1 + INTEGER(SUBSTR(cNum,1,1)) + INTEGER(SUBSTR(cNum,2,1)).\\n END.\\n END.\\n\\n ASSIGN\\n iNum2 = iNum1 * 9\\n iNum = iNum2 MODULO 10.\\n\\n IF iNum = INTEGER(SUBSTR(pcNumber,iLength,1)) THEN\\n RETURN TRUE.\\n ELSE\\n RETURN FALSE.\\n\\nEND FUNCTION. /* fnLuhnAlgorithm */\\n\",\n \"language\": \"OpenEdge-Progress\"\n },\n {\n \"code\": \"#include <order/interpreter.h>\\n\\n#define ORDER_PP_DEF_8luhn ORDER_PP_FN( \\\\\\n8fn(8N, 8if(8is_seq(8N), 8luhn_wk(8num_to_seq(8N)), 8false)) )\\n\\n#define ORDER_PP_DEF_8num_to_seq ORDER_PP_FN( \\\\\\n8fn(8N, 8seq_push_back(8seq(8seq_last(8N)), 8seq_pop_back(8N))) )\\n\\n#define ORDER_PP_DEF_8luhn_wk ORDER_PP_FN( \\\\\\n8fn(8N, \\\\\\n 8lets((8P, 8unzip(8N, 8nil, 8nil, 8true)) \\\\\\n (8O, 8seq_fold(8plus, 0, 8tuple_at_0(8P))) \\\\\\n (8E, 8seq_fold(8plus, 0, \\\\\\n 8seq_map(8dig_map, 8tuple_at_1(8P)))), \\\\\\n 8is_0(8remainder(8plus(8O, 8E), 10)))) )\\n\\n#define ORDER_PP_DEF_8dig_map ORDER_PP_FN( \\\\\\n8fn(8X, 8tuple_at(8X, 8tuple(0,2,4,6,8,1,3,5,7,9))) )\\n\\n#define ORDER_PP_DEF_8unzip ORDER_PP_FN( \\\\\\n8fn(8S, 8L, 8R, 8O, \\\\\\n 8if(8is_nil(8S), \\\\\\n 8pair(8L, 8R), \\\\\\n 8if(8O, \\\\\\n 8unzip(8seq_tail(8S), 8seq_push_back(8seq_head(8S), 8L), \\\\\\n 8R, 8false), \\\\\\n 8unzip(8seq_tail(8S), 8L, \\\\\\n 8seq_push_back(8seq_head(8S), 8R), 8true)))) )\\n\\nORDER_PP(8seq_to_tuple(\\n 8seq_map(8luhn, 8seq(8nat(4,9,9,2,7,3,9,8,7,1,6),\\n 8nat(4,9,9,2,7,3,9,8,7,1,7),\\n 8nat(1,2,3,4,5,6,7,8,1,2,3,4,5,6,7,8),\\n 8nat(1,2,3,4,5,6,7,8,1,2,3,4,5,6,7,0)))\\n))\\n\",\n \"language\": \"Order\"\n },\n {\n \"code\": \"(8true,8false,8false,8true)\\n\",\n \"language\": \"Order\"\n },\n {\n \"code\": \"declare\\n fun {Luhn N}\\n {Sum {List.mapInd {Reverse {Digits N}}\\n fun {$ Idx Dig}\\n if {IsEven Idx} then {Sum {Digits 2*Dig}}\\n else Dig\\n end\\n end}}\\n mod 10 == 0\\n end\\n\\n fun {Digits N}\\n {Map {Int.toString N} fun {$ D} D - &0 end}\\n end\\n\\n fun {Sum Xs}\\n {FoldL Xs Number.'+' 0}\\n end\\nin\\n {Show\\n {Map\\n [49927398716 49927398717 1234567812345678 1234567812345670]\\n Luhn}}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"program luhnTestOfCreditCardNumbers(input, output);\\n\\ntype\\n\\t{\\n\\t\\t`string(…)` is an Extended Pascal, ISO 10206, extension.\\n\\t\\t`string(64)` discriminates the “schema” data type `string`\\n\\t\\tto contain at most 64 `char` values.\\n\\t}\\n\\tcreditCardNumber = string(64);\\n\\n{\\n\\t\\\\brief determines whether a string contains digits only\\n\\t\\n\\t\\\\param sample the string to inspect\\n\\t\\\\return `false` iff `sample` contains non-digit characters\\n}\\n{ Extended Pascal: `protected` means the function cannot modify `sample` }\\nfunction containsDigitsOnly(protected sample: creditCardNumber): Boolean;\\nvar\\n\\t{ EP: the `… value []` initializes this variable as an empty set }\\n\\tcharacters: set of char value [];\\n\\t{ `sample.capacity` refers to `64` in this code. }\\n\\ti: 1..sample.capacity;\\nbegin\\n\\tfor i := 1 to length(sample) do\\n\\tbegin\\n\\t\\t{ Union of sets indicated by `+`. }\\n\\t\\tcharacters := characters + [sample[i]]\\n\\tend;\\n\\t\\n\\t{\\n\\t\\tIn a Pascal `function` definition,\\n\\t\\tthere must be one assignment to the (implicit) variable\\n\\t\\tbearing the same name as of the function.\\n\\t\\tThis will be the return value.\\n\\t}\\n\\t{ NB: This will return `true` even if `length(sample)` is zero. }\\n\\tcontainsDigitsOnly := card(characters - ['0'..'9']) = 0\\n\\t{ `card` is an Extended Pascal extension. }\\nend;\\n\\n{\\n\\t\\\\brief determines whether a string complies with ISO/IEC 7812-1 Luhn test\\n\\t\\n\\t\\\\param sample the potentially correct credit card number\\n\\t\\\\return `true` if verification succeeds\\n}\\nfunction luhnCheck(protected sample: creditCardNumber): Boolean;\\n\\t{\\n\\t\\tThis _nested_ function is only accessible _within_ `luhnCheck`.\\n\\t\\tOutsourcing this code allows us to write a neat expression below.\\n\\t}\\n\\tfunction check: Boolean;\\n\\tvar\\n\\t\\t{ Using `integer` sub-ranges ensures only these values are assigned. }\\n\\t\\tsum: 0..maxInt value 0;\\n\\t\\ti: 0..sample.capacity-1;\\n\\tbegin\\n\\t\\tfor i := 0 to length(sample) - 1 do\\n\\t\\tbegin\\n\\t\\t\\t{ `1 + ord(odd(i))` produces an alternating scale factor `* 1`/`* 2`. }\\n\\t\\t\\tsum := sum + (1 + ord(odd(i))) *\\n\\t\\t\\t\\t{ Obtain digit value for `integer` calculation. }\\n\\t\\t\\t\\t(ord(sample[length(sample) - i]) - ord('0')) -\\n\\t\\t\\t\\t{ Reverse operation if digit sum > 9, i.e. we added “too much”. }\\n\\t\\t\\t\\tord(odd(i) and (sample[length(sample) - i] >= '5')) * 9\\n\\t\\tend;\\n\\t\\t\\n\\t\\tcheck := sum mod 10 = 0\\n\\tend;\\nbegin\\n\\t{\\n\\t\\tThe Extended Pascal Boolean operator `and_then` (and `or_else`)\\n\\t\\tallows for “short-circuit evaluation”.\\n\\t\\tOtherwise, in Pascal `and` and `or` mandate complete evaluation.\\n\\t}\\n\\tluhnCheck := (length(sample) > 0) and_then containsDigitsOnly(sample)\\n\\t\\tand_then check\\nend;\\n\\n{ === MAIN ============================================================= }\\nvar\\n\\ts: creditCardNumber;\\nbegin\\n\\t{ `EOF` is short for `EOF(input)`. }\\n\\twhile not EOF do\\n\\tbegin\\n\\t\\treadLn(s); { equivalent to `readLn(input, s)` }\\n\\t\\twriteLn(luhnCheck(s)) { = `writeLn(output, …)` }\\n\\tend\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"sub luhn_test\\n{\\n my @rev = reverse split //,$_[0];\\n my ($sum1,$sum2,$i) = (0,0,0);\\n\\n for(my $i=0;$i<@rev;$i+=2)\\n {\\n $sum1 += $rev[$i];\\n last if $i == $#rev;\\n $sum2 += 2*$rev[$i+1]%10 + int(2*$rev[$i+1]/10);\\n }\\n return ($sum1+$sum2) % 10 == 0;\\n}\\nprint luhn_test('49927398716');\\nprint luhn_test('49927398717');\\nprint luhn_test('1234567812345678');\\nprint luhn_test('1234567812345670');\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"sub luhn {\\n my (@n,$i,$sum) = split //, reverse $_[0];\\n my @a = map {int(2*$_ / 10) + (2*$_ % 10)} (0..9);\\n map {$sum += $i++ % 2 ? $a[$_] : $_} @n;\\n return ($sum % 10) ? 0 : 1;\\n}\\n\\n# Test and display\\nmap {print luhn($_), \\\": $_\\\\n\\\"}\\n qw(49927398716 49927398717 1234567812345678 1234567812345670);\\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;\\\">Luhn</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">st</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">d</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;\\\">st</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">st</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]-</span><span style=\\\"color: #008000;\\\">'0'</span>\\n <span style=\\\"color: #000000;\\\">s</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;\\\">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;\\\">d</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;\\\">4</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">9</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;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)=</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;\\\">procedure</span> <span style=\\\"color: #000000;\\\">test</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: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%20s : %t\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">Luhn</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;\\\">procedure</span>\\n\\n <span style=\\\"color: #7060A8;\\\">papply</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #008000;\\\">\\\"49927398716\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"49927398717\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1234567812345678\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1234567812345670\\\"</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\": \"$numbers = \\\"49927398716 49927398717 1234567812345678 1234567812345670\\\";\\nforeach (split(' ', $numbers) as $n)\\n echo \\\"$n is \\\", luhnTest($n) ? 'valid' : 'not valid', '</br>';\\n\\nfunction luhnTest($num) {\\n $len = strlen($num);\\n for ($i = $len-1; $i >= 0; $i--) {\\n $ord = ord($num[$i]);\\n if (($len - 1) & $i) {\\n $sum += $ord;\\n } else {\\n $sum += $ord / 5 + (2 * $ord) % 10;\\n }\\n }\\n return $sum % 10 == 0;\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"function luhn_test($num) {\\n $str = '';\\n foreach( array_reverse( str_split( $num ) ) as $i => $c ) $str .= ($i % 2 ? $c * 2 : $c );\\n return array_sum( str_split($str) ) % 10 == 0;\\n}\\n\\nforeach (array('49927398716','49927398717','1234567812345678','1234567812345670') as $n)\\n echo \\\"$n is \\\", luhn_test($n) ? 'valid' : 'not valid', \\\"</br>\\\\n\\\";\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"go =>\\n Nums = [\\\"49927398716\\\",\\\"49927398717\\\",\\\"1234567812345678\\\",\\\"1234567812345670\\\"],\\n foreach (N in Nums)\\n println([N, isluhn10(N)])\\n end,\\n nl.\\n\\n%\\n% isluhn10(num) returns 1 is valid, else 0\\n%\\n% Assumption: input num is a string.\\n%\\nisluhn10(Num) = V =>\\n X = [I : I in Num.reverse()] ++ [\\\"\\\"],\\n Digits = \\\"0246813579\\\",\\n M = new_map([(I.to_string()=Digits[I+1]) : I in 0..9]),\\n V1 = sum([X[I].to_integer() + M.get2(X[I+1].to_string(),0) : I in 1..2..Num.length]),\\n V := cond(V1 mod 10 == 0, 1, 0).\\n\\n% A variant of Map.get with conversions\\nget2(M, Key, Default)=V =>\\n if M.has_key(Key) then V= M.get(Key).to_integer() else V=Default end.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de luhn (Num) # 'Num' may be a number or a string\\n (=0\\n (%\\n (sum\\n '((C F)\\n (setq C (- (char C) 48))\\n (if F\\n C # Odd\\n (+ (/ C 5) (% (* 2 C) 10)) ) ) # Even\\n (flip (chop Num))\\n '(T NIL .) )\\n 10 ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"test: procedure options (main);\\n\\n declare (cardnumber, rcn) character (20) varying;\\n declare (i, k, s1, s2) fixed binary;\\n\\n get edit (cardnumber) (L);\\n cardnumber = trim(cardnumber);\\n rcn = reverse(cardnumber);\\n s1, s2 = 0;\\n /* Sum the odd-numbered digits */\\n do i = 1 to length(rcn) by 2;\\n s1 = s1 + substr(rcn, i, 1);\\n end;\\n /* Twice the even-numbered digits. */\\n do i = 2 to length(rcn) by 2;\\n k = 2 * substr(rcn, i, 1);\\n s2 = s2 + mod(k,10) + trunc(k/10);\\n end;\\n if mod(s1 + s2, 10) = 0 then\\n put skip edit (cardnumber, ' passes the Luhn test' )(a);\\n else\\n put skip edit (cardnumber, ' does not pass the Luhn test' )(a);\\n put skip list (s1 + s2);\\nend test;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"100H:\\nBDOS: PROCEDURE(F,A); DECLARE F BYTE, A ADDRESS; GO TO 5; END BDOS;\\nEXIT: PROCEDURE; GO TO 0; END EXIT;\\nPRINT: PROCEDURE(S); DECLARE S ADDRESS; CALL BDOS(9,S); END PRINT;\\n\\nLUHN: PROCEDURE(NUM) BYTE;\\n DECLARE MAP DATA (0, 2, 4, 6, 8, 1, 3, 5, 7, 9);\\n DECLARE (START, NUM, MASK, TOTAL) ADDRESS;\\n DECLARE (CHR BASED NUM, DGT) BYTE;\\n START = NUM;\\n\\n DO WHILE CHR <> '$'; NUM = NUM + 1; END;\\n MASK = NUM := NUM - 1;\\n TOTAL = 0;\\n DO WHILE NUM >= START;\\n DGT = CHR - '0';\\n IF NUM XOR MASK THEN DGT = MAP(DGT);\\n TOTAL = TOTAL + DGT;\\n NUM = NUM - 1;\\n END;\\n RETURN TOTAL MOD 10 = 0;\\nEND LUHN;\\n\\nDECLARE TEST (4) ADDRESS, I BYTE;\\nTEST(0) = .'49927398716$';\\nTEST(1) = .'49927398717$';\\nTEST(2) = .'1234567812345678$';\\nTEST(3) = .'1234567812345670$';\\n\\nDO I=0 TO LAST(TEST);\\n CALL PRINT(TEST(I));\\n CALL PRINT(.': $');\\n IF LUHN(TEST(I))\\n THEN CALL PRINT(.'PASS$');\\n ELSE CALL PRINT(.'FAIL$');\\n CALL PRINT(.(13,10,'$'));\\nEND;\\nCALL EXIT;\\nEOF\\n\",\n \"language\": \"PL-M\"\n },\n {\n \"code\": \"FUNCTION algoLuhn ( p_numeroVerif VARCHAR2 )\\n RETURN NUMBER\\n IS\\n i NUMBER;\\n v_NBi SMALLINT;\\n v_retour SMALLINT;\\n v_somme NUMBER := 0;\\n v_nbCar NUMBER;\\n\\n BEGIN\\n v_nbCar := LENGTH(p_numeroVerif);\\n\\n FOR i IN 1..v_nbCar\\n LOOP\\n v_NBi := TO_NUMBER(SUBSTR(p_numeroVerif,v_nbCar+1-i,1));\\n\\n v_somme := v_somme\\n + MOD(i,2) * v_NBi\\n + MOD(i+1,2) * SIGN(-SIGN(v_Nbi-4)+1) * (2*v_NBi)\\n + MOD(i+1,2) * SIGN( SIGN(v_Nbi-5)+1) * (2*v_NBi-9);\\n\\n END LOOP;\\n\\n v_retour := SIGN(MOD(v_somme,10));\\n\\n RETURN v_retour;\\n\\n EXCEPTION\\n WHEN OTHERS\\n THEN\\n RETURN 1;\\n\\n END algoLuhn;\\n\",\n \"language\": \"PL-SQL\"\n },\n {\n \"code\": \"To run:\\nStart up.\\nTest whether \\\"49927398716\\\" will pass the luhn test.\\nTest whether \\\"49927398717\\\" will pass the luhn test.\\nTest whether \\\"1234567812345678\\\" will pass the luhn test.\\nTest whether \\\"1234567812345670\\\" will pass the luhn test.\\nWait for the escape key.\\nShut down.\\n\\nTo test whether a string will pass the luhn test:\\nWrite the string then \\\": \\\" on the console without advancing.\\nIf the string will pass the luhn test, write \\\"valid\\\" on the console; exit.\\nWrite \\\"invalid\\\" on the console.\\n\\nA sum is a number.\\n\\nTo decide if a string will pass the luhn test:\\nIf the string is blank, say no.\\nPrivatize the string.\\nReverse the string.\\nPut 0 into a first sum.\\nPut 0 into a second sum.\\nPut 1 into a count.\\nSlap a rider on the string.\\nLoop.\\nIf the rider's source is blank, break.\\nPut the rider's source's first's target into a byte.\\nIf the byte is not any digit, say no.\\nConvert the byte to a number.\\nIf the count is odd, add the number to the first sum; bump the count; bump the rider; repeat.\\nDouble the number.\\nIf the number is greater than 9, digital root the number.\\nAdd the number to the second sum.\\nBump the count. Bump the rider.\\nRepeat.\\nIf the first sum plus the second sum is evenly divisible by 10, say yes.\\nSay no.\\n\\nTo digital root a number:\\nDivide the number by 10 giving a quotient and a remainder.\\nPut the quotient plus the remainder into the number.\\n\\nTo convert a byte to a number:\\nIf the byte is any digit, put the byte minus 48 into the number.\\n\",\n \"language\": \"Plain-English\"\n },\n {\n \"code\": \"#COMPILE EXE\\n#DIM ALL\\n#COMPILER PBCC 6\\n\\nFUNCTION LuhnCheckPassed(BYVAL dgts AS STRING) AS INTEGER\\nLOCAL i, s, s1 AS DWORD\\n dgts = STRREVERSE$(dgts)\\n FOR i = 1 TO LEN(dgts) STEP 2\\n s += VAL(MID$(dgts, i, 1))\\n NEXT i\\n FOR i = 2 TO LEN(dgts) STEP 2\\n s1 = 2 * VAL(MID$(dgts, i, 1))\\n IF s1 >= 10 THEN\\n s -= 9\\n END IF\\n s += s1\\n NEXT i\\n FUNCTION = NOT ISTRUE (s MOD 10)\\nEND FUNCTION\\n\\nFUNCTION PBMAIN () AS LONG\\n ' this test is expected to pass:\\n CON.PRINT IIF$(LuhnCheckPassed(\\\"49927398716\\\"), \\\"passed\\\", \\\"failed\\\")\\n ' this test is expected to fail:\\n CON.PRINT IIF$(LuhnCheckPassed(\\\"49927398717\\\"), \\\"passed\\\", \\\"failed\\\")\\n ' this test is expected to fail:\\n CON.PRINT IIF$(LuhnCheckPassed(\\\"1234567812345678\\\"), \\\"passed\\\", \\\"failed\\\")\\n ' this test is expected to pass:\\n CON.PRINT IIF$(LuhnCheckPassed(\\\"1234567812345670\\\"), \\\"passed\\\", \\\"failed\\\")\\nEND FUNCTION\\n\",\n \"language\": \"PowerBASIC\"\n },\n {\n \"code\": \"function Test-LuhnNumber\\n{\\n <#\\n .SYNOPSIS\\n Tests validity of credit card numbers.\\n .DESCRIPTION\\n Tests validity of credit card numbers using the Luhn test.\\n .PARAMETER Number\\n The number must be 11 or 16 digits.\\n .EXAMPLE\\n Test-LuhnNumber 49927398716\\n .EXAMPLE\\n [int64[]]$numbers = 49927398716, 49927398717, 1234567812345678, 1234567812345670\\n C:\\\\PS>$numbers | ForEach-Object {\\n \\\"{0,-17}: {1}\\\" -f $_,\\\"$(if(Test-LuhnNumber $_) {'Is valid.'} else {'Is not valid.'})\\\"\\n }\\n #>\\n [CmdletBinding()]\\n [OutputType([bool])]\\n Param\\n (\\n [Parameter(Mandatory=$true,\\n Position=0)]\\n [ValidateScript({$_.Length -eq 11 -or $_.Length -eq 16})]\\n [ValidatePattern(\\\"^\\\\d+$\\\")]\\n [string]\\n $Number\\n )\\n\\n $digits = ([Regex]::Matches($Number,'.','RightToLeft')).Value\\n\\n $digits |\\n ForEach-Object `\\n -Begin {$i = 1} `\\n -Process {if ($i++ % 2) {$_}} |\\n ForEach-Object `\\n -Begin {$sumOdds = 0} `\\n -Process {$sumOdds += [Char]::GetNumericValue($_)}\\n $digits |\\n ForEach-Object `\\n -Begin {$i = 0} `\\n -Process {if ($i++ % 2) {$_}} |\\n ForEach-Object `\\n -Process {[Char]::GetNumericValue($_) * 2} |\\n ForEach-Object `\\n -Begin {$sumEvens = 0} `\\n -Process {\\n $_number = $_.ToString()\\n if ($_number.Length -eq 1)\\n {\\n $sumEvens += [Char]::GetNumericValue($_number)\\n }\\n elseif ($_number.Length -eq 2)\\n {\\n $sumEvens += [Char]::GetNumericValue($_number[0]) + [Char]::GetNumericValue($_number[1])\\n }\\n }\\n\\n ($sumOdds + $sumEvens).ToString()[-1] -eq \\\"0\\\"\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Test-LuhnNumber 49927398716\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"49927398716, 49927398717, 1234567812345678, 1234567812345670 | ForEach-Object {\\n \\\"{0,-17}: {1}\\\" -f $_,\\\"$(if(Test-LuhnNumber $_) {'Is valid.'} else {'Is not valid.'})\\\"\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"DataSection\\n Sample:\\n Data.s \\\"49927398716\\\"\\n Data.s \\\"49927398717\\\"\\n Data.s \\\"1234567812345678\\\"\\n Data.s \\\"1234567812345670\\\"\\n Data.s \\\"\\\"\\nEndDataSection\\n\\nProcedure isValid(cardNumber.s)\\n Protected i, length, s1, s2, s2a\\n\\n cardNumber = ReverseString(cardNumber)\\n length = Len(cardNumber)\\n For i = 1 To length Step 2\\n s1 + Val(Mid(cardNumber, i, 1))\\n Next\\n\\n For i = 2 To length Step 2\\n s2a = Val(Mid(cardNumber, i, 1)) * 2\\n If s2a < 10\\n s2 + s2a\\n Else\\n s2 + 1 + Val(Right(Str(s2a), 1))\\n EndIf\\n Next\\n\\n If Right(Str(s1 + s2), 1) = \\\"0\\\"\\n ProcedureReturn #True\\n Else\\n ProcedureReturn #False\\n EndIf\\nEndProcedure\\n\\n\\nIf OpenConsole()\\n Define cardNumber.s\\n\\n Restore Sample\\n Repeat\\n Read.s cardNumber\\n If cardNumber <> \\\"\\\"\\n Print(cardNumber + \\\" is \\\")\\n If isValid(cardNumber)\\n PrintN(\\\"valid\\\")\\n Else\\n PrintN(\\\"not valid\\\")\\n EndIf\\n EndIf\\n Until cardNumber = \\\"\\\"\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\")\\n Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \">>> def luhn(n):\\n\\tr = [int(ch) for ch in str(n)][::-1]\\n\\treturn (sum(r[0::2]) + sum(sum(divmod(d*2,10)) for d in r[1::2])) % 10 == 0\\n\\n>>> for n in (49927398716, 49927398717, 1234567812345678, 1234567812345670):\\n\\tprint(n, luhn(n))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Luhn test of credit card numbers'''\\n\\nfrom operator import add, mul\\nfrom functools import reduce\\nfrom itertools import cycle\\n\\n\\n# luhn :: Integer -> Bool\\ndef luhn(n):\\n '''True if n is a valid Luhn credit card number.'''\\n def divMod10Sum(a, x):\\n return a + add(*divmod(x, 10))\\n return 0 == reduce(\\n divMod10Sum,\\n map(\\n mul,\\n cycle([1, 2]),\\n map(int, reversed(str(n)))\\n ),\\n 0\\n ) % 10\\n\\n\\n# ---------------------------TEST---------------------------\\n# main :: IO ()\\ndef main():\\n '''Tests'''\\n print(list(\\n map(luhn, [\\n 49927398716, 49927398717,\\n 1234567812345678, 1234567812345670\\n ])\\n ))\\n\\n\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Luhn test of credit card numbers'''\\n\\nfrom itertools import cycle\\n\\n\\n# luhn :: String -> Bool\\ndef luhn(k):\\n '''True if k is a valid Luhn credit card number string\\n '''\\n def asDigits(s):\\n return (int(c) for c in s)\\n\\n return 0 == sum(map(\\n lambda f, x: f(x),\\n cycle([\\n lambda n: n,\\n lambda n: sum(asDigits(str(2 * n)))\\n ]),\\n asDigits(reversed(k))\\n )) % 10\\n\\n\\n# ------------------------- TEST -------------------------\\n# main :: IO ()\\ndef main():\\n '''Tests'''\\n print('\\\\n'.join([\\n repr((x, luhn(x))) for x in [\\n \\\"49927398716\\\",\\n \\\"49927398717\\\",\\n \\\"1234567812345678\\\",\\n \\\"1234567812345670\\\"\\n ]\\n ]))\\n\\n\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \">>> def vérifLuhn(ch):\\n sum = 0\\n chParity = len(ch) % 2\\n for i in range (len(ch)-1, -1, -1):\\n j = int(ch[i])\\n if ((i + 1) % 2 != chParity):\\n j = j * 2\\n if (j > 9):\\n j = j - 9\\n sum = sum + j\\n print(\\\"value calculated = \\\", str(sum))\\n return sum % 10 == 0\\n\\nfor n in (49927398716, 49927398717, 1234567812345678, 1234567812345670):\\n print (str(n)+\\\" =>\\\", vérifLuhn(str(n)))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"sd:{s:0; while[x<>0; s+:x mod 10; x:floor x%10]; s} / Sum digits of x\\nluhn:{\\n r:reverse string x; / Reversed credit card number\\n o:(\\\"I\\\"$) each r[2*til ceiling (count r) % 2]; / Odd-indexed numbers\\n e:(\\\"I\\\"$) each r[1+2*til floor (count r) % 2]; / Even-indexed numbers\\n 0=(sum o,sd each e*2) mod 10 / Return 1b if checksum ends in 0; 0b otherwise\\n}\\n\",\n \"language\": \"Q\"\n },\n {\n \"code\": \"CONST True = -1: False = NOT True\\n\\nDIM card$(5)\\ncard$(1) = \\\"49927398716\\\"\\ncard$(2) = \\\"49927398717\\\"\\ncard$(3) = \\\"1234567812345678\\\"\\ncard$(4) = \\\"1234567812345670\\\"\\n\\nFOR test = 1 TO 4\\n odd = True\\n sum = 0\\n FOR n = LEN(card$(test)) TO 1 STEP -1\\n num = VAL(MID$(card$(test), n, 1))\\n IF odd THEN\\n sum = sum + num\\n odd = False\\n ELSE\\n num = num * 2\\n IF num <= 9 THEN\\n sum = sum + num\\n ELSE\\n sum = sum + VAL(LEFT$(STR$(num), 1)) + VAL(RIGHT$(STR$(num), 1))\\n END IF\\n odd = True\\n END IF\\n NEXT\\n IF sum MOD 10 = 0 THEN\\n PRINT card$(test), \\\"True\\\"\\n ELSE\\n PRINT card$(test), \\\"False\\\"\\n END IF\\nNEXT test\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \" [ 1 & ] is odd ( n --> b )\\n\\n [ [] swap\\n [ 10 /mod\\n rot join swap\\n dup 0 = until ]\\n drop ] is digits ( n --> [ )\\n\\n [ [] [] rot\\n dup size odd dip\\n [ witheach\\n [ nested join\\n swap ] ]\\n not if swap ] is unzip ( [ --> [ [ )\\n\\n [ [] swap\\n witheach\\n [ 2 *\\n 10 /mod +\\n join ] ] is 2*digitsum ( [ --> [ )\\n\\n [ behead swap\\n witheach + ] is sum ( [ --> n )\\n\\n [ digits\\n reverse\\n unzip\\n 2*digitsum\\n sum\\n swap sum\\n + 10 mod 0 = ] is luhn ( n --> b )\\n\\n\\n' [ 49927398716 49927398717\\n 1234567812345678 1234567812345670 ]\\n\\nwitheach\\n [ dup echo\\n luhn iff\\n [ say \\\" valid\\\" ]\\n else\\n [ say \\\" invalid\\\" ]\\n cr ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"is.luhn <- function(cc){\\n numbers <- as.numeric(rev(unlist(strsplit(cc,\\\"\\\"))))\\n (sum(numbers[seq(1,length(numbers),by=2)]) + sum({numbers[seq(2,length(numbers),by=2)]*2 ->.; .%%10 +.%/%10})) %% 10 == 0\\n}\\n\\nsapply(c(\\\"49927398716\\\",\\\"49927398717\\\",\\\"1234567812345678\\\",\\\"1234567812345670\\\"),is.luhn)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (luhn-test n)\\n (let loop ([n n] [odd? #t] [s 0])\\n (if (zero? n)\\n (zero? (modulo s 10))\\n (let*-values ([(q r) (quotient/remainder n 10)]\\n [(rq rr) (quotient/remainder (* (if odd? 1 2) r) 10)])\\n (loop q (not odd?) (+ s rq rr))))))\\n\\n(map luhn-test '(49927398716 49927398717 1234567812345678 1234567812345670))\\n;; -> '(#t #f #f #t)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub luhn-test ($number --> Bool) {\\n my @digits = $number.comb.reverse;\\n my $sum = @digits[0,2...*].sum\\n + @digits[1,3...*].map({ |($_ * 2).comb }).sum;\\n return $sum %% 10;\\n}\\n\\n# And we can test it like this:\\n\\nuse Test;\\n\\nmy @cc-numbers =\\n '49927398716' => True,\\n '49927398717' => False,\\n '1234567812345678' => False,\\n '1234567812345670' => True;\\n\\nplan @cc-numbers.elems;\\n\\nfor @cc-numbers».kv -> ($cc, $expected-result) {\\n is luhn-test(+$cc), $expected-result,\\n \\\"$cc {$expected-result ?? 'passes' !! 'does not pass'} the Luhn test.\\\";\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"$ENTRY Go {\\n = <Test '49927398716'>\\n <Test '49927398717'>\\n <Test '1234567812345678'>\\n <Test '1234567812345670'>;\\n};\\n\\nTest {\\n e.Digits = <Prout e.Digits ': ' <Luhn e.Digits>>;\\n};\\n\\nLuhn {\\n (s.Sum) e.Digits s.Even s.Odd,\\n <Mul 2 <Numb s.Even>>: s.Even2,\\n <Divmod s.Even2 10>: (s.EvenD1) s.EvenD2,\\n <+ s.EvenD1 s.EvenD2>: s.EvenV,\\n <+ <Numb s.Odd> s.EvenV>: s.Step\\n = <Luhn (<+ s.Sum s.Step>) e.Digits>;\\n (s.Sum) s.Odd = <Luhn (<+ s.Sum <Numb s.Odd>>)>;\\n (s.Sum), <Divmod s.Sum 10>: (s.Rest) s.Last,\\n s.Last: {\\n 0 = Valid;\\n s.X = Invalid;\\n };\\n e.Digits = <Luhn (0) e.Digits>;\\n};\\n\",\n \"language\": \"Refal\"\n },\n {\n \"code\": \"/*REXX program validates credit card numbers using the Luhn algorithm. */\\n#.=; #.1= 49927398716 /*the 1st sample credit card number. */\\n #.2= 49927398717 /* \\\" 2nd \\\" \\\" \\\" \\\" */\\n #.3= 1234567812345678 /* \\\" 3rd \\\" \\\" \\\" \\\" */\\n #.4= 1234567812345670 /* \\\" 4th \\\" \\\" \\\" \\\" */\\n do k=1 while #.k\\\\=='' /*validate all the credit card numbers.*/\\n say right( Luhn(#.k), 9) ' the Luhn test, credit card number: ' #.k\\n end /*k*/ /* [↑] function returns passed│flunked.*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nLuhn: procedure; parse arg x; $= 0 /*get credit card number; zero $ sum. */\\n y= reverse( left(0, length(x) // 2)x) /*add leading zero if needed, reverse. */\\n do j=1 to length(y)-1 by 2; _= substr(y, j+1, 1) * 2\\n $= $ + substr(y, j, 1) + left(_, 1) + substr(_, 2, 1, 0) /* ◄────────┐*/\\n end /*j*/ /*sum odd and even decimal digits ►────┘*/\\n return word('passed flunked',1+($//10==0)) /*$ ending in zero? Then the # passed.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/* Rexx ***************************************************\\n* 09.04.2013 Walter Pachl\\n* Implements the task's description in a rather concise way\\n* Instead of reverting the ccn work it backwards\\n**********************************************************/\\nnumeric digits 20\\n\\npush 49927398716\\npush 49927398717\\npush 1234567812345678\\npush 1234567812345670\\n\\ndo while queued() > 0\\n parse pull ccnum\\n if luhn(ccnum) then ln = 'passed'\\n else ln = 'failed'\\n say right(ccnum, 20) ln\\n end\\nreturn\\nexit\\n\\nluhn:\\nParse Arg ccn /* credit card number */\\nsum=0 /* initialize test sum */\\neven=0 /* even indicator */\\nDo i=length(ccn) To 1 By -1 /* process all digits */\\n c=substr(ccn,i,1) /* pick one digit at a time */\\n If even Then Do /* even numbered digit */\\n c=c*2 /* double it */\\n If c>=10 Then /* 10, 12, 14, 16, 18 */\\n c=c-9 /* Sum of the two digits */\\n End /* end of even numbered */\\n even=\\\\even /* flip even indicator */\\n sum=sum+c /* add into test sum */\\n End\\nReturn right(sum,1)=0 /* ok if last digit is 0 */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"decimals(0)\\n\\ntest = [\\\"49927398716\\\", \\\"49927398717\\\", \\\"1234567812345678\\\", \\\"1234567812345670\\\"]\\nfor n = 1 to len(test)\\n see test[n] + \\\" -> \\\" + cardtest(test[n]) + nl\\nnext\\n\\nfunc cardtest(numstr)\\n revstring = revstr(numstr)\\n s1 = revodd(revstring)\\n s2 = reveven(revstring)\\n s3 =right(string(s1+s2), 1)\\n if s3 = \\\"0\\\"\\n return \\\"Valid\\\"\\n else\\n return \\\"Invalid\\\"\\n ok\\n\\nfunc revstr(str)\\n strnew = \\\"\\\"\\n for nr = len(str) to 1 step -1\\n strnew = strnew + str[nr]\\n next\\n return strnew\\n\\nfunc revodd(str)\\n strnew = \\\"\\\"\\n for nr = 1 to len(str) step 2\\n strnew = strnew + str[nr]\\n next\\n sumodd = 0\\n for p = 1 to len(strnew)\\n sumodd = sumodd + number(strnew[p])\\n next\\n return sumodd\\n\\nfunc reveven(str)\\n strnew = \\\"\\\"\\n for nr = 2 to len(str) step 2\\n strnew = strnew + str[nr]\\n next\\n lsteven = []\\n for p = 1 to len(strnew)\\n add(lsteven, string(2*number(strnew[p])))\\n next\\n arreven = list(len(lsteven))\\n for q = 1 to len(lsteven)\\n sum = 0\\n for w = 1 to len(lsteven[q])\\n sum = sum + lsteven[q][w]\\n next\\n arreven[q] = sum\\n next\\n sumarr = 0\\n for x = 1 to len(arreven)\\n sumarr = sumarr + arreven[x]\\n next\\n return sumarr\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \" def luhn_valid?(str)\\n str.scan(/\\\\d/).reverse #using str.to_i.digits fails for cases with leading zeros\\n .each_slice(2)\\n .sum { |i, k = 0| i.to_i + ((k.to_i)*2).digits.sum }\\n .modulo(10).zero?\\n end\\n\\n[\\\"49927398716\\\", \\\"49927398717\\\", \\\"1234567812345678\\\", \\\"1234567812345670\\\"].map{ |i| luhn_valid?(i) }\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"def luhn_valid?(n) # Card values can be numbers or strings\\n d2sum = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\\n sum, num = 0, n.to_i\\n num.digits.each_with_index { |digit, i| sum += i.even? ? digit : d2sum[digit] }\\n sum % 10 == 0\\nend\\n\\ncards = [49927398716, \\\"49927398717\\\", 1234567812345678, \\\"1234567812345670\\\"]\\ncards.each{ |i| puts \\\"#{i}: #{luhn_valid?(i)}\\\" }\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"card$(1) = \\\"49927398716\\\"\\ncard$(2) = \\\"49927398717\\\"\\ncard$(3) = \\\"1234567812345678\\\"\\ncard$(4) = \\\"1234567812345670\\\"\\n\\nfor i = 1 to 4\\nprint card$(i);\\\" \\\";luhn$(card$(i))\\nnext i\\n\\nFUNCTION luhn$(card$)\\n lc = len(card$)\\n for i = lc to 1 step -1\\n digit = val(mid$(card$,i,1))\\n if ((lc -i) mod 2) = 0 then chkSum = chkSum + digit else chkSum = chkSum + int(digit * 2.2)\\n next i\\n if chkSum mod 10 = 0 then luhn$ = \\\"True\\\" else luhn$ = \\\"False\\\"\\nend function\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"extern crate luhn_test_of_credit_card_numbers;\\n\\nuse luhn_test_of_credit_card_numbers::luhn_test;\\n\\nfn validate_isin(isin: &str) -> bool {\\n if !isin.chars().all(|x| x.is_alphanumeric()) || isin.len() != 12 {\\n return false;\\n }\\n if !isin[..2].chars().all(|x| x.is_alphabetic())\\n || !isin[2..12].chars().all(|x| x.is_alphanumeric())\\n || !isin.chars().last().unwrap().is_numeric()\\n {\\n return false;\\n }\\n\\n let bytes = isin.as_bytes();\\n\\n let s2 = bytes\\n .iter()\\n .flat_map(|&c| {\\n if c.is_ascii_digit() {\\n vec![c]\\n } else {\\n (c + 10 - ('A' as u8)).to_string().into_bytes()\\n }\\n })\\n .collect::<Vec<u8>>();\\n\\n let string = std::str::from_utf8(&s2).unwrap();\\n let number = string.parse::<u64>().unwrap();\\n\\n return luhn_test(number as u64);\\n}\\n\\n#[cfg(test)]\\nmod tests {\\n use super::validate_isin;\\n\\n #[test]\\n fn test_validate_isin() {\\n assert_eq!(validate_isin(\\\"US0378331005\\\"), true);\\n assert_eq!(validate_isin(\\\"US0373831005\\\"), false);\\n assert_eq!(validate_isin(\\\"U50378331005\\\"), false);\\n assert_eq!(validate_isin(\\\"US03378331005\\\"), false);\\n assert_eq!(validate_isin(\\\"AU0000XVGZA3\\\"), true);\\n assert_eq!(validate_isin(\\\"AU0000VXGZA3\\\"), true);\\n assert_eq!(validate_isin(\\\"FR0000988040\\\"), true);\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object Luhn {\\n private def parse(s: String): Seq[Int] = s.map{c =>\\n assert(c.isDigit)\\n c.asDigit\\n }\\n def checksum(digits: Seq[Int]): Int = {\\n digits.reverse.zipWithIndex.foldLeft(0){case (sum,(digit,i))=>\\n if (i%2 == 0) sum + digit\\n else sum + (digit*2)/10 + (digit*2)%10\\n } % 10\\n }\\n def validate(digits: Seq[Int]): Boolean = checksum(digits) == 0\\n def checksum(number: String): Int = checksum(parse(number))\\n def validate(number: String): Boolean = validate(parse(number))\\n}\\n\\nobject LuhnTest extends App {\\n Seq((\\\"49927398716\\\", true),\\n (\\\"49927398717\\\", false),\\n (\\\"1234567812345678\\\", false),\\n (\\\"1234567812345670\\\", true)\\n ).foreach { case (n, expected) =>\\n println(s\\\"$n ${Luhn.validate(n)}\\\")\\n assert(Luhn.validate(n) == expected)\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \" def luhnTest1(number: String): Boolean = {\\n var (odd, sum) = (true, 0)\\n\\n for (int <- number.reverse.map { _.toString.toShort }) {\\n if (odd) sum += int\\n else sum += (int * 2 % 10) + (int / 5)\\n odd = !odd\\n }\\n sum % 10 == 0\\n }\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define luhn\\n (lambda (n)\\n (let loop ((number n)\\n (index 0)\\n (result 0))\\n (if (= 0 number)\\n (= 0 (remainder result 10))\\n (loop (quotient number 10)\\n (+ index 1)\\n (+ result\\n (if (even? index)\\n (remainder number 10)\\n (let ((part (* 2 (remainder number 10))))\\n (+ (remainder part 10) (quotient part 10))))))))))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"# Split number into double evens and odds\\ns/.*/&: /\\n: split\\ns/\\\\([0-4]\\\\)\\\\([0-9]\\\\):\\\\(.*\\\\) /:\\\\1\\\\1\\\\3 \\\\2/\\ns/\\\\([5-9]\\\\)\\\\([0-9]\\\\):\\\\(.*\\\\) /:1\\\\1\\\\1\\\\3 \\\\2/\\nt split\\n\\n# Set up addition lookup table\\ns/\\\\([0-9]\\\\)*:\\\\(.*\\\\) \\\\(.*\\\\)/\\\\1\\\\2\\\\3:0123456789012345678/\\n\\n: add\\ns/\\\\([0-9]\\\\)0:/\\\\1:/\\ns/\\\\([0-9]\\\\)1:\\\\(.*\\\\1.\\\\{0\\\\}\\\\([0-9]\\\\).*\\\\)/\\\\3:\\\\2/\\ns/\\\\([0-9]\\\\)2:\\\\(.*\\\\1.\\\\{1\\\\}\\\\([0-9]\\\\).*\\\\)/\\\\3:\\\\2/\\ns/\\\\([0-9]\\\\)3:\\\\(.*\\\\1.\\\\{2\\\\}\\\\([0-9]\\\\).*\\\\)/\\\\3:\\\\2/\\ns/\\\\([0-9]\\\\)4:\\\\(.*\\\\1.\\\\{3\\\\}\\\\([0-9]\\\\).*\\\\)/\\\\3:\\\\2/\\ns/\\\\([0-9]\\\\)5:\\\\(.*\\\\1.\\\\{4\\\\}\\\\([0-9]\\\\).*\\\\)/\\\\3:\\\\2/\\ns/\\\\([0-9]\\\\)6:\\\\(.*\\\\1.\\\\{5\\\\}\\\\([0-9]\\\\).*\\\\)/\\\\3:\\\\2/\\ns/\\\\([0-9]\\\\)7:\\\\(.*\\\\1.\\\\{6\\\\}\\\\([0-9]\\\\).*\\\\)/\\\\3:\\\\2/\\ns/\\\\([0-9]\\\\)8:\\\\(.*\\\\1.\\\\{7\\\\}\\\\([0-9]\\\\).*\\\\)/\\\\3:\\\\2/\\ns/\\\\([0-9]\\\\)9:\\\\(.*\\\\1.\\\\{8\\\\}\\\\([0-9]\\\\).*\\\\)/\\\\3:\\\\2/\\nt add\\n\\n/0:/a\\\\\\nPass\\n/0:/!a\\\\\\nFail\\nd\\n\",\n \"language\": \"Sed\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst func boolean: luhnTest (in string: cardNumber) is func\\n result\\n var boolean: luhnTest is FALSE;\\n local\\n var integer: index is 0;\\n var integer: digit is 0;\\n var boolean: isOdd is TRUE;\\n var integer: oddSum is 0;\\n var integer: evenSum is 0;\\n begin\\n for index range length(cardNumber) downto 1 do\\n digit := integer parse str(cardNumber[index]);\\n if isOdd then\\n oddSum +:= digit;\\n else\\n evenSum +:= digit div 5 + (2 * digit) rem 10;\\n end if;\\n isOdd := not isOdd;\\n end for;\\n luhnTest := (oddSum + evenSum) rem 10 = 0;\\n end func;\\n\\nconst proc: main is func\\n local\\n var string: cardNumber is \\\"\\\";\\n begin\\n for cardNumber range [] (\\\"49927398716\\\", \\\"49927398717\\\", \\\"1234567812345678\\\", \\\"1234567812345670\\\") do\\n writeln(cardNumber <& \\\": \\\" <& luhnTest(cardNumber));\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"function LuhnCheck ccNum\\n\\tput length of ccNum into numDigits\\n\\tput the last character of ccNum into total\\n\\tput numDigits modulo 2 into parity\\n\\trepeat for each character of the first numDigits - 1 characters of ccNum\\n\\t\\tput it into digit\\n\\t\\tif (the counter - 1) modulo 2 equals parity\\n\\t\\t\\tmultiply digit by 2\\t\\n\\t\\tend if\\n\\t\\tif digit is greater than 9\\n\\t\\t\\tsubtract 9 from digit\\n\\t\\tend if\\n\\t\\tadd digit to total\\n\\tend repeat\\n\\treturn total is divisible by 10\\nend LuhnCheck\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"repeat for each item of (49927398716, 49927398717, 1234567812345678, 1234567812345670)\\n\\tput it && LuhnCheck(it)\\nend repeat\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"main(args(2)) :=\\n\\tsum(luhnTest(asciiToInt(args[1]) - asciiToInt('0'))) mod 10 = 0;\\n\\ns2Mapping := [0,2,4,6,8,1,3,5,7,9];\\n\\nluhnTest(x(1))[i] :=\\n\\tx[i] when i mod 2 = size(x) mod 2 else\\n\\ts2Mapping[x[i] + 1];\\n\",\n \"language\": \"SequenceL\"\n },\n {\n \"code\": \"(define mapi\\n _ _ [] -> []\\n F N [X | Xs] -> [(F N X) | (mapi F (+ N 1) Xs)])\\n\\n(define double\\n X -> (let Y (* 2 X) (if (> Y 9) (- Y 9) Y)))\\n\\n(define luhn?\\n Number ->\\n (let Exploded (explode Number)\\n Digits (map (/. H (- (string->n H) 48)) Exploded)\\n Reversed (reverse Digits)\\n Doubled (mapi (/. N X (if (= 1 (shen.mod N 2)) (double X) X)) 0 Reversed)\\n Summed (sum Doubled)\\n Modded (shen.mod Summed 10)\\n (= 0 Modded)))\\n\\n\\\"Expected: [true false false true]\\\"\\n\\n(map (function luhn?) [\\\"49927398716\\\" \\\"49927398717\\\" \\\"1234567812345678\\\" \\\"1234567812345670\\\"])\\n\",\n \"language\": \"Shen\"\n },\n {\n \"code\": \"func luhn (n) {\\n static a = {|j| (2*j // 10) + (2*j % 10) }.map(^10)\\n\\n var checksum = n.digits.map_kv {|i,j|\\n i.is_odd ? a[j] : j\\n }.sum\\n\\n checksum % 10 == 0\\n}\\n\\nfor n in [49927398716, 49927398717, 1234567812345678, 1234567812345670] {\\n say [n, luhn(n)]\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \" define('luhn(n)a,d,i,j,sum') :(luhn_end)\\nluhn n = reverse(n); a = array('0:9')\\nln1 a<i> = (2 * i / 10) + remdr(2 * i,10)\\n i = lt(i,9) i + 1 :s(ln1)\\nln2 n len(1) . d = :f(ln3)\\n d = ne(remdr(j,2),0) a<d>; j = j + 1\\n sum = sum + d :(ln2)\\nln3 luhn = 0; luhn = eq(remdr(sum,10),0) 1 :(return)\\nluhn_end\\n\\n ok = array('0:1')\\n ok<0> = 'FAIL'\\n ok<1> = 'OK'\\n\\n* Test and display\\n define('test(n)') :(test_end)\\ntest output = n ': ' ok<luhn(n)> :(return)\\ntest_end\\n\\n test('49927398716')\\n test('49927398717')\\n test('1234567812345678')\\n test('1234567812345670')\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"#!/usr/local/bin/spar\\npragma annotate( summary, \\\"luhn test of credit card numbers\\\" )\\n @( description, \\\"The Luhn test is used by some credit card companies to \\\" )\\n @( description, \\\"distinguish valid credit card numbers from what could be a random selection of digits.\\\" )\\n @( see_also, \\\"https://rosettacode.org/wiki/Luhn_test_of_credit_card_number\\\" )\\n @( author, \\\"Ken O. Burtch\\\" );\\npragma license( unrestricted );\\n\\npragma restriction( no_external_commands );\\n\\nprocedure luhn is\\n\\n bad_digit : exception;\\n\\n -- return true if the card number passes the luhn test\\n\\n function is_luhn( card_number : string) return boolean is\\n card_num_len : constant natural := strings.length( card_number );\\n checksum: natural := 0;\\n ch : character;\\n begin\\n for i in reverse 1..card_num_len loop\\n ch := strings.element( card_number, i );\\n if strings.is_digit( ch ) then\\n declare\\n ord : constant natural := numerics.pos(ch);\\n begin\\n if ((card_num_len-1) and (i-1) ) /= 0 then\\n checksum := @ + ord;\\n else\\n checksum := @ + numerics.floor(ord / 5) + ((2*ord) mod 10);\\n end if;\\n end;\\n else\\n raise bad_digit;\\n end if;\\n end loop;\\n return checksum mod 10 = 0;\\n end is_luhn;\\n\\n -- check a credit card and display the result\\n\\n procedure check_card( card_number : string ) is\\n begin\\n put( card_number )\\n @( \\\": \\\" )\\n @( is_luhn( card_number ) );\\n new_line;\\n end check_card;\\n\\nbegin\\n check_card(\\\"49927398716\\\");\\n check_card(\\\"49927398717\\\");\\n check_card(\\\"1234567812345678\\\");\\n check_card(\\\"1234567812345670\\\");\\nend luhn;\\n\",\n \"language\": \"SparForte\"\n },\n {\n \"code\": \"with Spark_IO;\\n--# inherit Spark_IO;\\n--# main_program;\\nprocedure Luhn\\n--# global in out Spark_IO.Outputs;\\n--# derives Spark_IO.Outputs from *;\\nis\\n\\n function Luhn_Test (Num : String) return Boolean\\n --# pre Num'Last <= 20;\\n is\\n Sum : Integer := 0;\\n Od : Boolean := True;\\n Int : Integer;\\n X : Integer;\\n OK : Boolean := True;\\n begin\\n for P in reverse Integer range Num'Range loop\\n Int := Character'Pos(Num(P)) - Character'Pos('0');\\n if Int not in 0 .. 9 then\\n OK := False;\\n exit;\\n end if;\\n X := (((Int*2) mod 10) + (Int / 5));\\n --# assert Num'Last - P in 0 .. 19\\n --# and Sum in 0 .. (Num'Last - P) * 10\\n --# and Int in 0 .. 9\\n --# and X in 0 .. 10;\\n if Od then\\n Sum := Sum + Int;\\n else\\n Sum := Sum + X;\\n end if;\\n Od := not Od;\\n end loop;\\n return OK and (Sum mod 10) = 0;\\n end Luhn_Test;\\n\\n procedure Do_Test (Num : in String)\\n --# global in out Spark_IO.Outputs;\\n --# derives Spark_IO.Outputs from *, Num;\\n --# pre Num'Last <= 20;\\n is\\n begin\\n Spark_IO.Put_String(Spark_IO.Standard_Output, Num, 16);\\n if Luhn_Test(Num) then\\n Spark_IO.Put_String(Spark_IO.Standard_Output, \\\" is valid.\\\", 0);\\n else\\n Spark_IO.Put_String(Spark_IO.Standard_Output, \\\" is not valid.\\\", 0);\\n end if;\\n Spark_IO.New_Line(Spark_IO.Standard_Output, 1);\\n end Do_Test;\\n\\nbegin\\n Do_Test(\\\"49927398716\\\");\\n Do_Test(\\\"49927398717\\\");\\n Do_Test(\\\"1234567812345678\\\");\\n Do_Test(\\\"1234567812345670\\\");\\n Do_Test(\\\"123456781234567D\\\");\\nend Luhn;\\n\",\n \"language\": \"SPARK\"\n },\n {\n \"code\": \"--#SET TERMINATOR @\\n\\nSET SERVEROUTPUT ON @\\n\\nCREATE OR REPLACE FUNCTION LUHN_TEST (\\n IN NUMBER VARCHAR(24)\\n ) RETURNS SMALLINT\\n --) RETURNS BOOLEAN\\n BEGIN\\n DECLARE TYPE CARD_NUMBER AS VARCHAR(1) ARRAY [24];\\n DECLARE LENGTH SMALLINT;\\n DECLARE REVERSE CARD_NUMBER;\\n DECLARE I SMALLINT;\\n DECLARE POS SMALLINT;\\n DECLARE S1 SMALLINT;\\n DECLARE S2 SMALLINT;\\n DECLARE TEMP SMALLINT;\\n DECLARE RET SMALLINT;\\n --DECLARE RET BOOLEAN;\\n DECLARE INVALID_CHAR CONDITION FOR SQLSTATE 'LUHN1';\\n\\n -- Reverse the order of the digits in the number.\\n SET LENGTH = LENGTH(NUMBER);\\n SET I = 1;\\n WHILE (I <= LENGTH) DO\\n SET POS = LENGTH - I + 1;\\n SET REVERSE[POS] = SUBSTR(NUMBER, I, 1);\\n IF (ASCII(REVERSE[POS]) < 48 OR 57 < ASCII(REVERSE[POS])) THEN\\n SIGNAL INVALID_CHAR SET MESSAGE_TEXT = 'Invalid character, not a digit';\\n END IF;\\n SET I = I + 1;\\n END WHILE;\\n\\n -- Take the first, third, ... and every other odd digit in the reversed digits and sum them to form the partial sum s1\\n SET S1 = 0;\\n SET I = 1;\\n WHILE (I <= LENGTH) DO\\n IF (MOD(I, 2) = 1) THEN\\n SET S1 = S1 + REVERSE[I];\\n END IF;\\n -- CALL DBMS_OUTPUT.PUT_LINE('I ' || I || ', S1 ' || S1 || ', val ' || REVERSE[I]);\\n SET I = I + 1;\\n END WHILE;\\n\\n -- Taking the second, fourth ... and every other even digit in the reversed digits:\\n SET S2 = 0;\\n SET TEMP = 0;\\n SET I = 1;\\n WHILE (I <= LENGTH) DO\\n IF (MOD(I, 2) = 0) THEN\\n -- Multiply each digit by two and sum the digits if the answer is greater than nine to form partial sums for the even digits\\n SET TEMP = REVERSE[I] * 2;\\n IF (TEMP > 9) THEN\\n SET TEMP = (TEMP / 10) + (MOD(TEMP, 10));\\n END IF;\\n -- Sum the partial sums of the even digits to form s2\\n SET S2 = S2 + TEMP;\\n END IF;\\n -- CALL DBMS_OUTPUT.PUT_LINE('I ' || I || ', S2 ' || S2 || ', TEMP ' || TEMP || ' val ' || REVERSE[I]);\\n SET I = I + 1;\\n END WHILE;\\n\\n -- If s1 + s2 ends in zero then the original number is in the form of a valid credit card number as verified by the Luhn test.\\n SET RET = 1;\\n --SET RET = FALSE;\\n SET TEMP = S1 + S2;\\n IF (MOD(TEMP, 10) = 0) THEN\\n SET RET = 0;\\n --SET RET = TRUE;\\n CALL DBMS_OUTPUT.PUT_LINE('It is a valid number ' || S1 || '+' || S2 || '=' || TEMP);\\n ELSE\\n CALL DBMS_OUTPUT.PUT_LINE('It is NOT a valid number ' || S1 || '+' || S2 || '=' || TEMP);\\n END IF;\\n RETURN RET;\\n END\\n@\\n\",\n \"language\": \"SQL-PL\"\n },\n {\n \"code\": \"local\\n fun revDigits 0 = []\\n | revDigits n = (n mod 10) :: revDigits (n div 10)\\n\\n fun digitSum n = if n > 9 then digitSum (n div 10 + n mod 10)\\n else n\\n\\n fun luhn_sum [] = 0\\n | luhn_sum [d] = d\\n | luhn_sum (d::d'::ds) = d + digitSum (2*d') + luhn_sum ds\\nin\\n fun luhn_test n = luhn_sum (revDigits n) mod 10 = 0\\n\\n val res = map luhn_test [49927398716, 49927398717, 1234567812345678, 1234567812345670];\\nend;\\n\\n(*\\n[opening file \\\"luhn.sml\\\"]\\n> val luhn_test = fn : int -> bool\\n val res = [true, false, false, true] : bool list\\n[closing file \\\"luhn.sml\\\"]\\n*)\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"func luhn(_ number: String) -> Bool {\\n return number.reversed().enumerated().map({\\n let digit = Int(String($0.element))!\\n let even = $0.offset % 2 == 0\\n return even ? digit : digit == 9 ? 9 : digit * 2 % 9\\n }).reduce(0, +) % 10 == 0\\n}\\n\\nluhn(\\\"49927398716\\\") // true\\nluhn(\\\"49927398717\\\") // false\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"package require Tcl 8.5\\nproc luhn digitString {\\n if {[regexp {[^0-9]} $digitString]} {error \\\"not a number\\\"}\\n set sum 0\\n set flip 1\\n foreach ch [lreverse [split $digitString {}]] {\\n\\tincr sum [lindex {\\n\\t {0 1 2 3 4 5 6 7 8 9}\\n\\t {0 2 4 6 8 1 3 5 7 9}\\n\\t} [expr {[incr flip] & 1}] $ch]\\n }\\n return [expr {($sum % 10) == 0}]\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"foreach testNumber {\\n 49927398716\\n 49927398717\\n 1234567812345678\\n 1234567812345670\\n} {\\n puts [format \\\"%s is %s\\\" $testNumber \\\\\\n\\t [lindex {\\\"NOT valid\\\" \\\"valid\\\"} [luhn $testNumber]]]\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"variable number {\\n type = \\\"string\\\"\\n}\\n\\nlocals {\\n digits = reverse(split(\\\"\\\", var.number))\\n count = length(local.digits)\\n odds = [for i in range(local.count): local.digits[i] if i%2==0]\\n evens = [for i in range(local.count): local.digits[i] if i%2==1]\\n s1 = length(flatten([for d in local.odds: range(d)]))\\n doubles = [for d in local.evens: d * 2]\\n partials = [for d in local.doubles: d < 10 ? d : floor(d/10)+d%10]\\n s2 = length(flatten([for p in local.partials: range(p)]))\\n check = (local.s1 + local.s2) % 10\\n}\\n\\noutput \\\"valid\\\" {\\n value = local.check == 0\\n}\\n\",\n \"language\": \"Terraform\"\n },\n {\n \"code\": \"PROGRAM:LUHN\\n:Disp \\\"ENTER NUMBER\\\"\\n:Input Str1\\n:0→S\\n:0→E\\n:For(I,length(Str1),1,-1)\\n :inString(\\\"0123456789\\\",sub(Str1,I,1))–1→X\\n :If X<0\\n :Goto BA\\n :If E≠0\\n :Then\\n :2X→X\\n :If X>9\\n :X–9→X\\n :End\\n :X+S→S\\n :not(E)→E\\n:End\\n:If fPart(S/10)=0\\n:Then\\n :Disp \\\"GOOD CARD\\\"\\n:Else\\n :Lbl BA\\n :Disp \\\"BAD CARD\\\"\\n:End\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"CREATE FUNCTION dbo._CreditCardNumCheck( @strCCNum VarChar(40) )\\nRETURNS VarChar(7)\\nAS\\nBEGIN\\n\\tDECLARE @string\\t\\t\\tVarChar(40) = REVERSE(@strCCNum); -- usage: set once, never changed\\n\\tDECLARE @strS2Values\\t\\tVarChar(10) = '0246813579'; -- constant: maps digits to their S2 summed values\\n\\tDECLARE @table\\t\\t\\tTABLE (ID INT, Value INT, S_Value INT); -- ID=digit position. S_Value is used for SUM().\\n\\tDECLARE @p\\t\\t\\tINT = 0; -- loop counter: position in string\\n\\t-- Convert the reversed string's digits into rows in a table variable, S_Values to be updated afterwards\\n\\tWHILE @p < LEN(@string)\\n\\t\\tBEGIN\\n\\t\\t\\tSET @p = @p+1;\\n\\t\\t\\tINSERT INTO @table (ID,Value,S_Value) VALUES (@p, CONVERT(INT,SUBSTRING(@string,@p,1)), 0);\\n\\t\\tEND\\n\\t-- Update S_Value column : the digit's value to be summed (for even-positioned digits this is mapped via @strS2Values)\\n\\tUPDATE @table SET S_Value = CASE WHEN ID % 2 = 1 THEN Value ELSE CONVERT(INT,SUBSTRING(@strS2Values,Value+1,1)) END\\n\\t-- If the SUM of S_Values ends in 0 (modulo 10 = 0) then the CC Number is valid\\n\\tRETURN CASE WHEN (SELECT SUM(S_Value) FROM @table) % 10 = 0 THEN 'Valid' ELSE 'Invalid' END\\nEND\\n\",\n \"language\": \"Transact-SQL\"\n },\n {\n \"code\": \"LET true = -1\\nLET false = 0\\n\\nDIM card$(5)\\nLET card$(1) = \\\"49927398716\\\"\\nLET card$(2) = \\\"49927398717\\\"\\nLET card$(3) = \\\"1234567812345678\\\"\\nLET card$(4) = \\\"1234567812345670\\\"\\n\\nFOR test = 1 TO 4\\n LET odd = true\\n LET sum = 0\\n FOR n = LEN(card$(test)) TO 1 STEP -1\\n LET num = VAL((card$(test))[n:n+1-1])\\n IF odd<>0 THEN\\n LET sum = sum + num\\n LET odd = false\\n ELSE\\n LET num = num*2\\n IF num <= 9 THEN\\n LET sum = sum + num\\n ELSE\\n LET sum = sum + VAL((STR$(num))[1:1]) + VAL((STR$(num))[LEN(STR$(num))-1+1:maxnum])\\n END IF\\n LET odd = true\\n END IF\\n NEXT n\\n IF remainder(round(sum),10) = 0 THEN PRINT card$(test), \\\"True\\\" ELSE PRINT card$(test), \\\"False\\\"\\nNEXT test\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nMODE DATA\\n$$ SET cardnumbers=*\\n49927398716\\n49927398717\\n1234567812345678\\n1234567812345670\\n$$ MODE TUSCRIPT\\n-> collecting information for output-format\\nSET length=MAX_LENGTH(cardnumbers)\\nSET adjust=length+2\\n\\nLOOP c=cardnumbers\\n-> \\\">/\\\" = any digit\\nSET cstring=STRINGS (c,\\\":>/:\\\")\\nSET creverse=REVERSE (cstring)\\nSET s1=evenx2=esum=s2=\\\"\\\"\\n LOOP n,oe=creverse\\n SET modrest=MOD(n,2)\\n IF (modrest==0) THEN\\n SET even=oe*2\\n IF (even>9) THEN\\n SET estring=STRINGS (even,\\\":>/:\\\")\\n SET esum=SUM (estring)\\n SET s2=APPEND (s2,esum)\\n ELSE\\n SET s2=APPEND (s2,even)\\n ENDIF\\n ELSE\\n SET s1=APPEND(s1,oe)\\n ENDIF\\n ENDLOOP\\nSET s1=SUM(s1),s2=SUM(s2)\\nSET checksum=s1+s2\\nSET c=CENTER(c,-adjust)\\nIF (checksum.ew.\\\"0\\\") THEN\\n PRINT c,\\\"true\\\"\\nELSE\\n PRINT c,\\\"false\\\"\\nENDIF\\nENDLOOP\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"@(do (defun luhn (num)\\n (for ((i 1) (sum 0))\\n ((not (zerop num)) (zerop (mod sum 10)))\\n ((inc i) (set num (trunc num 10)))\\n (let ((dig (mod num 10)))\\n (if (oddp i)\\n (inc sum dig)\\n (let ((dig2 (* 2 dig)))\\n (inc sum (+ (trunc dig2 10) (mod dig2 10)))))))))\\n@(collect :vars nil)\\n@{ccnumber /[0-9]+/}\\n@(output)\\n@ccnumber -> @(if (luhn (int-str ccnumber 10)) \\\"good\\\" \\\"bad\\\")\\n@(end)\\n@(end)\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"function luhn {\\n typeset n p s t=('0123456789' '0516273849')\\n while ((-n<${#1})); do\\n p=\\\"${t[n--%2]%${1:n:1}*}\\\"\\n ((s+=${#p}))\\n done\\n ((s%10))\\n}\\n\\nfor c in 49927398716 49927398717 1234567812345678 1234567812345670; do\\n if luhn $c; then\\n echo $c is invalid\\n else\\n echo $c is valid\\n fi\\ndone\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#import std\\n#import nat\\n\\nluhn = %nP; %np*hxiNCNCS; not remainder\\\\10+ //sum:-0@DrlrHK32 ~&iK27K28TK25 iota10\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"#cast %bL\\n\\ntest = luhn* <49927398716,49927398717,1234567812345678,1234567812345670>\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"const (\\n input = '49927398716\\n49927398717\\n1234567812345678\\n1234567812345670'\\n\\n t = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9]\\n)\\n\\nfn luhn(s string) bool {\\n odd := s.len & 1\\n mut sum := 0\\n for i, c in s.split('') {\\n if c < '0' || c > '9' {\\n return false\\n }\\n if i&1 == odd {\\n sum += t[c.int()-'0'.int()]\\n } else {\\n sum += c.int() - '0'.int()\\n }\\n }\\n return sum%10 == 0\\n}\\n\\nfn main() {\\n for s in input.split(\\\"\\\\n\\\") {\\n println('$s ${luhn(s)}')\\n }\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Option Explicit\\n\\nSub Main()\\n Debug.Print \\\"Number 49927398716 is \\\"; Luhn(\\\"49927398716\\\")\\n Debug.Print \\\"Number 49927398717 is \\\"; Luhn(\\\"49927398717\\\")\\n Debug.Print \\\"Number 1234567812345678 is \\\"; Luhn(\\\"1234567812345678\\\")\\n Debug.Print \\\"Number 1234567812345670 is \\\"; Luhn(\\\"1234567812345670\\\")\\nEnd Sub\\nPrivate Function Luhn(Nb As String) As String\\nDim t$, i&, Summ&, s&\\n t = StrReverse(Nb)\\n For i = 1 To Len(t) Step 2\\n Summ = Summ + CInt(Mid(t, i, 1))\\n Next i\\n For i = 2 To Len(t) Step 2\\n s = 2 * (CInt(Mid(t, i, 1)))\\n If s >= 10 Then\\n Summ = Summ - 9\\n End If\\n Summ = Summ + s\\n Next i\\n If Summ Mod 10 = 0 Then\\n Luhn = \\\"valid\\\"\\n Else\\n Luhn = \\\"invalid\\\"\\n End If\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Function Luhn_Test(cc)\\n\\tcc = RevString(cc)\\n\\ts1 = 0\\n\\ts2 = 0\\n\\tFor i = 1 To Len(cc)\\n\\t\\tIf i Mod 2 > 0 Then\\n\\t\\t\\ts1 = s1 + CInt(Mid(cc,i,1))\\n\\t\\tElse\\n\\t\\t\\ttmp = CInt(Mid(cc,i,1))*2\\n\\t\\t\\tIf tmp < 10 Then\\n\\t\\t\\t\\ts2 = s2 + tmp\\n\\t\\t\\tElse\\n\\t\\t\\t\\ts2 = s2 + CInt(Right(CStr(tmp),1)) + 1\\n\\t\\t\\tEnd If\\n\\t\\tEnd If\\n\\tNext\\n\\tIf Right(CStr(s1 + s2),1) = \\\"0\\\" Then\\n\\t\\tLuhn_Test = \\\"Valid\\\"\\n\\tElse\\n\\t\\tLuhn_Test = \\\"Invalid\\\"\\n\\tEnd If\\nEnd Function\\n\\nFunction RevString(s)\\n\\tFor i = Len(s) To 1 Step -1\\n\\t\\tRevString = RevString & Mid(s,i,1)\\n\\tNext\\nEnd Function\\n\\nWScript.Echo \\\"49927398716 is \\\" & Luhn_Test(\\\"49927398716\\\")\\nWScript.Echo \\\"49927398717 is \\\" & Luhn_Test(\\\"49927398717\\\")\\t\\t\\t\\nWScript.Echo \\\"1234567812345678 is \\\" & Luhn_Test(\\\"1234567812345678\\\")\\nWScript.Echo \\\"1234567812345670 is \\\" & Luhn_Test(\\\"1234567812345670\\\")\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"Public Function LuhnCheckPassed(ByVal dgts As String) As Boolean\\nDim i As Long, s As Long, s1 As Long\\n dgts = VBA.StrReverse(dgts)\\n For i = 1 To Len(dgts) Step 2\\n s = s + CInt(Mid$(dgts, i, 1))\\n Next i\\n For i = 2 To Len(dgts) Step 2\\n s1 = 2 * (CInt(Mid$(dgts, i, 1)))\\n If s1 >= 10 Then\\n s = s - 9\\n End If\\n s = s + s1\\n Next i\\n LuhnCheckPassed = Not CBool(s Mod 10)\\nEnd Function\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"Sub Main()\\n Debug.Assert LuhnCheckPassed(\\\"49927398716\\\")\\n Debug.Assert Not LuhnCheckPassed(\\\"49927398717\\\")\\n Debug.Assert Not LuhnCheckPassed(\\\"1234567812345678\\\")\\n Debug.Assert LuhnCheckPassed(\\\"1234567812345670\\\")\\nEnd Sub\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \" Imports System.Linq\\n Function ValidLuhn(value As String)\\n Return value.Select(Function(c, i) (AscW(c) - 48) << ((value.Length - i - 1) And 1)).Sum(Function(n) If(n > 9, n - 9, n)) Mod 10 = 0\\n End Function\\n Sub Main()\\n Console.WriteLine(ValidLuhn(\\\"49927398716\\\"))\\n Console.WriteLine(ValidLuhn(\\\"49927398717\\\"))\\n Console.WriteLine(ValidLuhn(\\\"1234567812345678\\\"))\\n Console.WriteLine(ValidLuhn(\\\"1234567812345670\\\"))\\n End Sub\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\nimport \\\"./iterate\\\" for Stepped\\n\\nvar luhn = Fn.new { |s|\\n // reverse digits\\n s = s[-1..0]\\n // sum the odd digits\\n var s1 = Stepped.new(s, 2).reduce(0) { |sum, d| sum + d.bytes[0] - 48 }\\n // sum two times the even digits\\n var s2 = Stepped.new(s[1..-1], 2).reduce(0) { |sum, d|\\n var d2 = (d.bytes[0] - 48) * 2\\n return sum + ((d2 > 9) ? d2%10 + 1 : d2)\\n }\\n // check if s1 + s2 ends in zero\\n return (s1 + s2)%10 == 0\\n}\\n\\nvar tests = [ \\\"49927398716\\\", \\\"49927398717\\\", \\\"1234567812345678\\\", \\\"1234567812345670\\\"]\\nfor (test in tests) {\\n var ans = (luhn.call(test)) ? \\\"pass\\\" : \\\"fail\\\"\\n Fmt.print(\\\"$-16s -> $s\\\", test, ans)\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"Public Function Modulus10(digits As String) as String\\n //\\n // Confirm the digits are really, well, digits\\n //\\n\\n dim validator as new RegEx\\n validator.SearchPattern = \\\"\\\\A\\\\d+\\\\z\\\"\\n if validator.Search( digits ) is nil then\\n //\\n // Raise an exception or something\\n //\\n end if\\n\\n static doublingTable() as string = array( \\\"0\\\", \\\"2\\\", \\\"4\\\", \\\"6\\\", \\\"8\\\", \\\"1\\\", \\\"3\\\", \\\"5\\\", \\\"7\\\", \\\"9\\\" )\\n\\n dim digitArr() as string = digits.Split( \\\"\\\" )\\n for i as integer = digitArr.Ubound downto 0 step 2\\n digitArr( i ) = doublingTable( digitArr( i ).Val )\\n next\\n\\n dim sum as integer\\n for each digit as string in digitArr\\n sum = sum + digit.Val\\n next\\n\\n dim check as integer = ( sum * 9 ) mod 10\\n return str( check )\\nEnd Function\\n\\nPublic Function ValidateMod10(digits As String) as Boolean\\n dim checkDigit as string = digits.Right( 1 )\\n digits = digits.Left( digits.Len - 1 )\\n\\n return Modulus10( digits ) = checkDigit\\nEnd Function\\n\",\n \"language\": \"Xojo\"\n },\n {\n \"code\": \"string 0; \\\\use zero-terminated strings\\n\\nfunc Valid(Str); \\\\Return 'true' if digits in Str pass Luhn test\\nchar Str;\\nint Len, Sum, I, Dig;\\n[Len:= 0; \\\\find length of Str\\nwhile Str(Len) do Len:= Len+1;\\nSum:= 0; \\\\sum even and odd digits\\nfor I:= 0 to Len-1 do \\\\(no need to reverse)\\n [if (I xor Len) and 1 then\\n Sum:= Sum + Str(I) - ^0\\n else [Dig:= Str(I) - ^0;\\n Dig:= Dig*2;\\n Sum:= Sum + Dig/10 + rem(0);\\n ];\\n ];\\nreturn rem(Sum/10) = 0;\\n];\\n\\nint Luhn, N;\\n[Luhn:= [\\\"49927398716\\\",\\n \\\"49927398717\\\",\\n \\\"1234567812345678\\\",\\n \\\"1234567812345670\\\"];\\nfor N:= 0 to 4-1 do\\n [Text(0, Luhn(N));\\n Text(0, if Valid(Luhn(N))\\n then \\\" is valid\\\"\\n else \\\" is not valid\\\");\\n CrLf(0);\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"dim card$(5)\\ncard$(1)=\\\"49927398716\\\"\\ncard$(2)=\\\"49927398717\\\"\\ncard$(3)=\\\"1234567812345678\\\"\\ncard$(4)=\\\"1234567812345670\\\"\\n\\nfor test = 1 to 4\\n odd = true\\n sum = 0\\n for n = len(card$(test)) to 1 step -1\\n num = val(mid$(card$(test),n,1))\\n if odd then\\n sum = sum + num\\n odd = false\\n else\\n num = num * 2\\n if num <= 9 then\\n sum = sum + num\\n else\\n sum = sum + val(left$(str$(num),1)) + val(right$(str$(num),1))\\n fi\\n odd = true\\n fi\\n next\\n if mod(sum, 10) = 0 then\\n print card$(test), chr$(9), \\\"True\\\"\\n else\\n print card$(test), chr$(9), \\\"False\\\"\\n fi\\nnext test\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"fcn luhnTest(n){\\n 0 == (n.split().reverse().reduce(fcn(s,n,clk){\\n s + if(clk.next()) n else 2*n%10 + n/5 },0,Walker.cycle(1,0)) %10)\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"T(49927398716,49927398717,1234567812345678,1234567812345670)\\n.apply(luhnTest).println();\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"10 LET c$=\\\"49927398716\\\": GO SUB 1000\\n20 LET c$=\\\"49927398717\\\": GO SUB 1000\\n30 LET c$=\\\"1234567812345678\\\": GO SUB 1000\\n40 LET c$=\\\"1234567812345670\\\": GO SUB 1000\\n999 STOP\\n1000 REM *************\\n1001 REM * LUHN TEST *\\n1002 REM *************\\n1010 LET r$=\\\"\\\"\\n1020 FOR i=LEN c$ TO 1 STEP -1\\n1030 LET r$=r$+c$(i)\\n1040 NEXT i\\n1050 LET s1=0: LET s2=0\\n1060 FOR i=1 TO LEN r$ STEP 2\\n1070 LET s1=s1+VAL r$(i)\\n1080 NEXT i\\n1090 FOR i=2 TO LEN r$ STEP 2\\n1100 LET s2sub=VAL r$(i)*2\\n1110 IF s2sub>=10 THEN LET s2sub=1+s2sub-10\\n1120 LET s2=s2+s2sub\\n1130 NEXT i\\n1140 LET s$=STR$ (s1+s2)\\n1150 IF s$(LEN s$)=\\\"0\\\" THEN PRINT c$;\\\" VALID!\\\": LET retval=1: RETURN\\n1160 PRINT c$;\\\" INVALID!\\\": LET retval=0: RETURN\\n\",\n \"language\": \"ZX-Spectrum-Basic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Luhn-test-of-credit-card-numbers"}}},{"rowIdx":456,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/LZW_compression\nnote: Compression\n","language":"00-META"},{"code":"The Lempel-Ziv-Welch (LZW) algorithm provides loss-less data compression.\n\nYou can read a complete description of it in the [[wp:Lempel-Ziv-Welch|Wikipedia article]] on the subject. It was patented, but it entered the public domain in 2004.\n<br><br>\n\n","language":"00-TASK"},{"code":"F compress(uncompressed)\n V dict_size = 256\n V dictionary = Dict((0 .< dict_size).map(i -> (String(Char(code' i)), i)))\n V w = ‘’\n [Int] result\n L(c) uncompressed\n V wc = w‘’c\n I wc C dictionary\n w = wc\n E\n result.append(dictionary[w])\n dictionary[wc] = dict_size\n dict_size++\n w = c\n\n I !w.empty\n result.append(dictionary[w])\n\n R result\n\nF decompress([Int] &compressed)\n V dict_size = 256\n V dictionary = Dict((0 .< dict_size).map(i -> (i, String(Char(code' i)))))\n V result = ‘’\n V w = String(Char(code' compressed.pop(0)))\n result ‘’= w\n L(k) compressed\n V entry = ‘’\n I k C dictionary\n entry = dictionary[k]\n E I k == dict_size\n entry = w‘’w[0]\n E\n exit(‘Bad compressed k: ’k)\n result ‘’= entry\n dictionary[dict_size] = w‘’entry[0]\n dict_size++\n w = entry\n\n R result\n\nV compressed = compress(‘TOBEORNOTTOBEORTOBEORNOT’)\nprint(compressed)\nprint(decompress(&compressed))\n","language":"11l"},{"code":"package LZW is\n\n MAX_CODE : constant := 4095;\n\n type Codes is new Natural range 0 .. MAX_CODE;\n type Compressed_Data is array (Positive range <>) of Codes;\n\n function Compress (Cleartext : in String) return Compressed_Data;\n function Decompress (Data : in Compressed_Data) return String;\n\nend LZW;\n","language":"Ada"},{"code":"with Ada.Containers.Ordered_Maps;\nwith Ada.Strings.Unbounded;\n\npackage body LZW is\n package UStrings renames Ada.Strings.Unbounded;\n use type UStrings.Unbounded_String;\n\n --------------\n -- Compress --\n --------------\n\n function Compress (Cleartext : in String) return Compressed_Data is\n -- translate String to Code-ID\n package String_To_Code is new Ada.Containers.Ordered_Maps (\n Key_Type => UStrings.Unbounded_String,\n Element_Type => Codes);\n\n Dictionary : String_To_Code.Map;\n -- Next unused Code-ID\n Next_Entry : Codes := 256;\n\n -- maximum same length as input, compression ratio always >=1.0\n Result : Compressed_Data (1 .. Cleartext'Length);\n -- position for next Code-ID\n Result_Index : Natural := 1;\n\n -- current and next input string\n Current_Word : UStrings.Unbounded_String :=\n UStrings.Null_Unbounded_String;\n Next_Word : UStrings.Unbounded_String :=\n UStrings.Null_Unbounded_String;\n begin\n -- initialize Dictionary\n for C in Character loop\n String_To_Code.Insert\n (Dictionary,\n UStrings.Null_Unbounded_String & C,\n Character'Pos (C));\n end loop;\n\n for Index in Cleartext'Range loop\n -- add character to current word\n Next_Word := Current_Word & Cleartext (Index);\n if String_To_Code.Contains (Dictionary, Next_Word) then\n -- already in dictionary, continue with next character\n Current_Word := Next_Word;\n else\n -- insert code for current word to result\n Result (Result_Index) :=\n String_To_Code.Element (Dictionary, Current_Word);\n Result_Index := Result_Index + 1;\n -- add new Code to Dictionary\n String_To_Code.Insert (Dictionary, Next_Word, Next_Entry);\n Next_Entry := Next_Entry + 1;\n -- reset current word to one character\n Current_Word := UStrings.Null_Unbounded_String &\n Cleartext (Index);\n end if;\n end loop;\n -- Last word was not entered\n Result (Result_Index) :=\n String_To_Code.Element (Dictionary, Current_Word);\n -- return correct array size\n return Result (1 .. Result_Index);\n end Compress;\n\n ----------------\n -- Decompress --\n ----------------\n\n function Decompress (Data : in Compressed_Data) return String is\n -- translate Code-ID to String\n type Code_To_String is array (Codes) of UStrings.Unbounded_String;\n\n Dictionary : Code_To_String;\n -- next unused Code-ID\n Next_Entry : Codes := 256;\n\n -- initialize resulting string as empty string\n Result : UStrings.Unbounded_String := UStrings.Null_Unbounded_String;\n\n Next_Code : Codes;\n -- first code has to be in dictionary\n Last_Code : Codes := Data (1);\n -- suffix appended to last string for new dictionary entry\n Suffix : Character;\n begin\n -- initialize Dictionary\n for C in Character loop\n Dictionary (Codes (Character'Pos (C))) :=\n UStrings.Null_Unbounded_String & C;\n end loop;\n\n -- output first Code-ID\n UStrings.Append (Result, Dictionary (Last_Code));\n for Index in 2 .. Data'Last loop\n Next_Code := Data (Index);\n if Next_Code <= Next_Entry then\n -- next Code-ID already in dictionary -> append first char\n Suffix := UStrings.Element (Dictionary (Next_Code), 1);\n else\n -- next Code-ID not in dictionary -> use char from last ID\n Suffix := UStrings.Element (Dictionary (Last_Code), 1);\n end if;\n -- expand the dictionary\n Dictionary (Next_Entry) := Dictionary (Last_Code) & Suffix;\n Next_Entry := Next_Entry + 1;\n -- output the current Code-ID to result\n UStrings.Append (Result, Dictionary (Next_Code));\n Last_Code := Next_Code;\n end loop;\n -- return String\n return UStrings.To_String (Result);\n end Decompress;\n\nend LZW;\n","language":"Ada"},{"code":"with LZW;\nwith Ada.Text_IO;\n\nprocedure Test is\n package Text_IO renames Ada.Text_IO;\n package Code_IO is new Ada.Text_IO.Integer_IO (LZW.Codes);\n\n Test_Data : constant LZW.Compressed_Data :=\n LZW.Compress (\"TOBEORNOTTOBEORTOBEORNOT\");\nbegin\n for Index in Test_Data'Range loop\n Code_IO.Put (Test_Data (Index), 0);\n Text_IO.Put (\" \");\n end loop;\n Text_IO.New_Line;\n declare\n Cleartext : constant String := LZW.Decompress (Test_Data);\n begin\n Text_IO.Put_Line (Cleartext);\n end;\nend Test;\n","language":"Ada"},{"code":" 0 PLAIN$ = \"TOBEORNOTTOBEORTOBEORNOT\"\n 10 GOSUB 200\"ENCODE PLAIN$\n 20 FOR I = 1 TO LEN (ENCODE$) STEP 2\n 30 PRINT S$ ASC ( MID$ (ENCODE$,I)) + 256 * ASC ( MID$ (ENCODE$,I + 1));\n 40 LET S$ = \" \"\n 50 NEXT\n 60 PRINT\n 70 GOSUB 300\"DECODE ENCODE$\n 80 PRINT PLAIN$;\n 90 END\n\n 100 FOR C = 0 TO 1E9 STEP 0\n 110 IF I > S THEN RETURN\n 120 FOR D = 1 TO L - 1\n 130 IF W$ < > DICT$(D) THEN NEXT D\n 140 IF D > = L THEN RETURN\n 150 LET I = I + 1\n 160 LET W$ = W$ + MID$ (PLAIN$,I,1)\n 170 LET C = D\n 180 NEXT C\n 190 RETURN\n\n REM ENCODE PLAIN$ RETURN ENCODE$\n 200 IF NOT DI THEN DIM DICT$(4095)\n 210 FOR I = 0 TO 255:DICT$(I) = CHR$ (I): NEXT\n 220 LET DI = 1 : L = I : S = LEN (PLAIN$):ENCODE$ = \"\"\n 230 LET W$ = LEFT$ (PLAIN$,1)\n 240 FOR I = 1 TO 1E9 STEP 0\n 250 GOSUB 100\n 260 LET DICT$(L) = W$:L = L + 1:W$ = RIGHT$ (W$,1)\n 270 LET C% = C / 256:ENCODE$ = ENCODE$ + CHR$ (C - C% * 256) + CHR$ (C%)\n 280 IF I < = S THEN NEXT I\n 290 RETURN\n\n REM DECODE ENCODE$ RETURN PLAIN$\n 300 IF NOT DI THEN DIM DICT$(4095)\n 310 FOR I = 0 TO 255:DICT$(I) = CHR$ (I): NEXT\n 320 LET DI = 1 : L = I\n 330 FOR I = L TO 4095:DICT$(I) = \"\": NEXT\n 340 LET C = ASC (ENCODE$) + 256 * ASC ( MID$ (ENCODE$,2))\n 350 LET W$ = DICT$(C)\n 360 LET PLAIN$ = W$\n 370 LET S = LEN (ENCODE$)\n 380 IF S < 4 THEN RETURN\n 400 FOR I = 3 TO S STEP 2\n 410 LET C = ASC ( MID$ (ENCODE$,I)) + 256 * ASC ( MID$ (ENCODE$,I + 1))\n 420 IF C < L THEN T$ = DICT$(C)\n 430 IF C > = L THEN T$ = W$ + LEFT$ (W$,1)\n 440 LET PLAIN$ = PLAIN$ + T$\n 450 LET DICT$(L) = W$ + LEFT$ (T$,1)\n 460 LET L = L + 1\n 470 LET W$ = T$\n 480 NEXT\n 490 RETURN\n","language":"Applesoft-BASIC"},{"code":"compress: function [str][\n dict: #[]\n loop 0..255 'i -> dict\\[to :char i]: i\n\n w: \"\"\n result: new []\n loop str 'c [\n wc: w ++ c\n if? key? dict wc -> w: wc\n else [\n 'result ++ dict\\[w]\n dict\\[wc]: size dict\n w: to :string c\n ]\n ]\n\n if 0 < size w -> 'result ++ dict\\[w]\n return result\n]\n\n\ndecompress: function [compressed][\n dict: #[]\n arr: new compressed\n loop 0..255 'i -> dict\\[i]: to :string to :char i\n\n w: dict\\[first arr]\n remove 'arr .index 0\n\n result: w\n loop arr 'k [\n entry: \"\"\n if? key? dict k -> entry: dict\\[k]\n else [\n if? k = size dict -> entry: w ++ first w\n else -> panic ~\"Error with compressed: |k|\"\n ]\n 'result ++ entry\n dict\\[size dict]: w ++ first entry\n w: entry\n ]\n return result\n]\n\ncompressed: compress \"TOBEORNOTTOBEORTOBEORNOT\"\nprint \"Compressed:\"\nprint compressed\nprint \"\"\n\ndecompressed: decompress compressed\nprint \"Decompressed:\"\nprint decompressed\n","language":"Arturo"},{"code":"==comp\nTOBEORNOTTOBEORTOBEORNOT\nTo be or not to be that is the question!\n\"There is nothing permanent except change.\" --- Heraclitus [540 -- 475 BCE]\n\n==decomp\n84,79,66,69,79,82,78,79,84,256,258,260,265,259,261,263\n84,111,32,98,101,32,111,114,32,110,111,116,32,116,257,259,268,104,97,267,105,115,272,260,113,117,101,115,116,105,111,110,33\n34,84,104,101,114,101,32,105,115,32,110,111,116,104,105,110,103,32,112,259,109,97,110,101,110,116,32,101,120,99,101,112,281,99,104,277,103,101,46,34,32,296,45,298,296,32,72,259,97,99,108,105,116,117,264,32,91,53,52,48,32,299,52,55,53,32,66,67,69,93\n","language":"AWK"},{"code":"# ported from Python\nBEGIN {\n is_comp = 0\n is_decomp = 0\n}\n\n{\n if ($0 == \"\") next\n\n if ($1 == \"==comp\") {\n is_comp = 1\n is_decomp = 0\n print \"\\ncompressing...\"\n next\n }\n\n if ($1 == \"==decomp\") {\n is_comp = 0\n is_decomp = 1\n print \"\\ndecompressing...\"\n next\n }\n\n if (is_comp) print compress($0)\n\n if (is_decomp) print decompress($0)\n}\n\nfunction compress(str, dict_size, i, dictionary, w, result, len, uncompressed, c, wc ) {\n dict_size = 256\n for (i = 0; i <= dict_size; i++) dictionary[chr(i)] = i\n\n w = \"\"\n result = \"\"\n len = split(str, uncompressed, \"\")\n for (i = 1; i <= len; i++) {\n c = uncompressed[i]\n wc = w c\n if (wc in dictionary) w = wc\n else {\n result = result \",\" dictionary[w]\n dictionary[wc] = dict_size++\n w = c\n }\n }\n if (length(w)) result = result \",\" dictionary[w]\n return substr(result,2)\n return \"[\" substr(result,2) \"]\"\n}\n\nfunction decompress(str) {\n dict_size = 256\n for (i = 0; i <= dict_size; i++) dictionary[i] = chr(i)\n\n result = \"\"\n len = split(str, compressed, \",\")\n w = chr(compressed[1])\n result = result w\n for (i = 2; i <= len; i++) {\n k = compressed[i]\n if (k in dictionary) entry = dictionary[k]\n else if (k == dict_size) entry = w substr(w,1,1)\n else { entry = \"*\" }\n result = result entry\n dictionary[dict_size++] = w substr(entry,1,1)\n w = entry\n }\n return result\n}\n\nfunction chr(c) {\n return sprintf(\"%c\", c + 0)\n}\n","language":"AWK"},{"code":"CONST lzw_data$ = \"TOBEORNOTTOBEORTOBEORNOT\"\n\nPRINT \"LZWData: \", lzw_data$\nencoded$ = Encode_LZW$(lzw_data$)\nPRINT \"Encoded: \", encoded$\nPRINT \"Decoded: \", Decode_LZW$(encoded$)\n\n'----------------------------------------------------------\n\nFUNCTION Encode_LZW$(sample$)\n\n LOCAL dict ASSOC int\n LOCAL ch$, buf$, result$\n LOCAL nr, x\n\n FOR nr = 0 TO 255\n dict(CHR$(nr)) = nr\n NEXT\n\n FOR x = 1 TO LEN(sample$)\n\n ch$ = MID$(sample$, x, 1)\n\n IF dict(buf$ & ch$) THEN\n buf$ = buf$ & ch$\n ELSE\n result$ = APPEND$(result$, 0, STR$(dict(buf$)))\n dict(buf$ & ch$) = nr\n INCR nr\n buf$ = ch$\n END IF\n NEXT\n\n result$ = APPEND$(result$, 0, STR$(dict(buf$)))\n\n RETURN result$\n\nEND FUNCTION\n\n'----------------------------------------------------------\n\nFUNCTION Decode_LZW$(sample$)\n\n LOCAL list$ ASSOC STRING\n LOCAL old$, ch$, x$, out$, result$\n LOCAL nr\n\n FOR nr = 0 TO 255\n list$(STR$(nr)) = CHR$(nr)\n NEXT\n\n old$ = TOKEN$(sample$, 1)\n\n ch$ = list$(old$)\n result$ = ch$\n\n FOR x$ IN LAST$(sample$, 1)\n\n IF NOT(LEN(list$(x$))) THEN\n out$ = list$(old$)\n out$ = out$ & ch$\n ELSE\n out$ = list$(x$)\n END IF\n\n result$ = result$ & out$\n ch$ = LEFT$(out$, 1)\n list$(STR$(nr)) = list$(old$) & ch$\n\n INCR nr\n old$ = x$\n NEXT\n\n RETURN result$\n\nEND FUNCTION\n","language":"BaCon"},{"code":" plaintext$ = \"TOBEORNOTTOBEORTOBEORNOT\"\n encodeLZW$ = FNencodeLZW(plaintext$)\n FOR i% = 1 TO LEN(encodeLZW$) STEP 2\n PRINT ; ASCMID$(encodeLZW$,i%) + 256*ASCMID$(encodeLZW$,i%+1) \" \" ;\n NEXT\n PRINT ' FNdecodeLZW(encodeLZW$)\n END\n\n DEF FNencodeLZW(i$)\n LOCAL c%, d%, i%, l%, o$, w$, dict$()\n DIM dict$(4095)\n FOR i% = 0 TO 255 : dict$(i%) = CHR$(i%) : NEXT\n l% = i%\n i% = 1\n w$ = LEFT$(i$,1)\n REPEAT\n d% = 0\n REPEAT\n c% = d%\n IF i% > LEN(i$) EXIT REPEAT\n FOR d% = 1 TO l%-1\n IF w$ = dict$(d%) EXIT FOR\n NEXT d%\n IF d% < l% i% += 1 : w$ += MID$(i$, i%, 1)\n UNTIL d% >= l%\n dict$(l%) = w$ : l% += 1 : w$ = RIGHT$(w$)\n o$ += CHR$(c% MOD 256) + CHR$(c% DIV 256)\n UNTIL i% >= LEN(i$)\n = o$\n\n DEF FNdecodeLZW(i$)\n LOCAL c%, i%, l%, o$, t$, w$, dict$()\n DIM dict$(4095)\n FOR i% = 0 TO 255 : dict$(i%) = CHR$(i%) : NEXT\n l% = i%\n c% = ASC(i$) + 256*ASCMID$(i$,2)\n w$ = dict$(c%)\n o$ = w$\n IF LEN(i$) < 4 THEN = o$\n FOR i% = 3 TO LEN(i$) STEP 2\n c% = ASCMID$(i$,i%) + 256*ASCMID$(i$,i%+1)\n IF c% < l% t$ = dict$(c%) ELSE t$ = w$ + LEFT$(w$,1)\n o$ += t$\n dict$(l%) = w$ + LEFT$(t$,1)\n l% += 1\n w$ = t$\n NEXT\n = o$\n","language":"BBC-BASIC"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <stdint.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys/types.h>\n#include <sys/stat.h>\n\n/* -------- aux stuff ---------- */\nvoid* mem_alloc(size_t item_size, size_t n_item)\n{\n size_t *x = calloc(1, sizeof(size_t)*2 + n_item * item_size);\n x[0] = item_size;\n x[1] = n_item;\n return x + 2;\n}\n\nvoid* mem_extend(void *m, size_t new_n)\n{\n size_t *x = (size_t*)m - 2;\n x = realloc(x, sizeof(size_t) * 2 + *x * new_n);\n if (new_n > x[1])\n memset((char*)(x + 2) + x[0] * x[1], 0, x[0] * (new_n - x[1]));\n x[1] = new_n;\n return x + 2;\n}\n\ninline void _clear(void *m)\n{\n size_t *x = (size_t*)m - 2;\n memset(m, 0, x[0] * x[1]);\n}\n\n#define _new(type, n) mem_alloc(sizeof(type), n)\n#define _del(m) { free((size_t*)(m) - 2); m = 0; }\n#define _len(m) *((size_t*)m - 1)\n#define _setsize(m, n) m = mem_extend(m, n)\n#define _extend(m) m = mem_extend(m, _len(m) * 2)\n\n\n/* ----------- LZW stuff -------------- */\ntypedef uint8_t byte;\ntypedef uint16_t ushort;\n\n#define M_CLR 256 /* clear table marker */\n#define M_EOD 257 /* end-of-data marker */\n#define M_NEW 258 /* new code index */\n\n/* encode and decode dictionary structures.\n for encoding, entry at code index is a list of indices that follow current one,\n i.e. if code 97 is 'a', code 387 is 'ab', and code 1022 is 'abc',\n then dict[97].next['b'] = 387, dict[387].next['c'] = 1022, etc. */\ntypedef struct {\n ushort next[256];\n} lzw_enc_t;\n\n/* for decoding, dictionary contains index of whatever prefix index plus trailing\n byte. i.e. like previous example,\n dict[1022] = { c: 'c', prev: 387 },\n dict[387] = { c: 'b', prev: 97 },\n dict[97] = { c: 'a', prev: 0 }\n the \"back\" element is used for temporarily chaining indices when resolving\n a code to bytes\n */\ntypedef struct {\n ushort prev, back;\n byte c;\n} lzw_dec_t;\n\nbyte* lzw_encode(byte *in, int max_bits)\n{\n int len = _len(in), bits = 9, next_shift = 512;\n ushort code, c, nc, next_code = M_NEW;\n lzw_enc_t *d = _new(lzw_enc_t, 512);\n\n if (max_bits > 15) max_bits = 15;\n if (max_bits < 9 ) max_bits = 12;\n\n byte *out = _new(ushort, 4);\n int out_len = 0, o_bits = 0;\n uint32_t tmp = 0;\n\n inline void write_bits(ushort x) {\n tmp = (tmp << bits) | x;\n o_bits += bits;\n if (_len(out) <= out_len) _extend(out);\n while (o_bits >= 8) {\n o_bits -= 8;\n out[out_len++] = tmp >> o_bits;\n tmp &= (1 << o_bits) - 1;\n }\n }\n\n //write_bits(M_CLR);\n for (code = *(in++); --len; ) {\n c = *(in++);\n if ((nc = d[code].next[c]))\n code = nc;\n else {\n write_bits(code);\n nc = d[code].next[c] = next_code++;\n code = c;\n }\n\n /* next new code would be too long for current table */\n if (next_code == next_shift) {\n /* either reset table back to 9 bits */\n if (++bits > max_bits) {\n /* table clear marker must occur before bit reset */\n write_bits(M_CLR);\n\n bits = 9;\n next_shift = 512;\n next_code = M_NEW;\n _clear(d);\n } else /* or extend table */\n _setsize(d, next_shift *= 2);\n }\n }\n\n write_bits(code);\n write_bits(M_EOD);\n if (tmp) write_bits(tmp);\n\n _del(d);\n\n _setsize(out, out_len);\n return out;\n}\n\nbyte* lzw_decode(byte *in)\n{\n byte *out = _new(byte, 4);\n int out_len = 0;\n\n inline void write_out(byte c)\n {\n while (out_len >= _len(out)) _extend(out);\n out[out_len++] = c;\n }\n\n lzw_dec_t *d = _new(lzw_dec_t, 512);\n int len, j, next_shift = 512, bits = 9, n_bits = 0;\n ushort code, c, t, next_code = M_NEW;\n\n uint32_t tmp = 0;\n inline void get_code() {\n while(n_bits < bits) {\n if (len > 0) {\n len --;\n tmp = (tmp << 8) | *(in++);\n n_bits += 8;\n } else {\n tmp = tmp << (bits - n_bits);\n n_bits = bits;\n }\n }\n n_bits -= bits;\n code = tmp >> n_bits;\n tmp &= (1 << n_bits) - 1;\n }\n\n inline void clear_table() {\n _clear(d);\n for (j = 0; j < 256; j++) d[j].c = j;\n next_code = M_NEW;\n next_shift = 512;\n bits = 9;\n };\n\n clear_table(); /* in case encoded bits didn't start with M_CLR */\n for (len = _len(in); len;) {\n get_code();\n if (code == M_EOD) break;\n if (code == M_CLR) {\n clear_table();\n continue;\n }\n\n if (code >= next_code) {\n fprintf(stderr, \"Bad sequence\\n\");\n _del(out);\n goto bail;\n }\n\n d[next_code].prev = c = code;\n while (c > 255) {\n t = d[c].prev; d[t].back = c; c = t;\n }\n\n d[next_code - 1].c = c;\n\n while (d[c].back) {\n write_out(d[c].c);\n t = d[c].back; d[c].back = 0; c = t;\n }\n write_out(d[c].c);\n\n if (++next_code >= next_shift) {\n if (++bits > 16) {\n /* if input was correct, we'd have hit M_CLR before this */\n fprintf(stderr, \"Too many bits\\n\");\n _del(out);\n goto bail;\n }\n _setsize(d, next_shift *= 2);\n }\n }\n\n /* might be ok, so just whine, don't be drastic */\n if (code != M_EOD) fputs(\"Bits did not end in EOD\\n\", stderr);\n\n _setsize(out, out_len);\nbail: _del(d);\n return out;\n}\n\nint main()\n{\n int i, fd = open(\"unixdict.txt\", O_RDONLY);\n\n if (fd == -1) {\n fprintf(stderr, \"Can't read file\\n\");\n return 1;\n };\n\n struct stat st;\n fstat(fd, &st);\n\n byte *in = _new(char, st.st_size);\n read(fd, in, st.st_size);\n _setsize(in, st.st_size);\n close(fd);\n\n printf(\"input size: %d\\n\", _len(in));\n\n byte *enc = lzw_encode(in, 9);\n printf(\"encoded size: %d\\n\", _len(enc));\n\n byte *dec = lzw_decode(enc);\n printf(\"decoded size: %d\\n\", _len(dec));\n\n for (i = 0; i < _len(dec); i++)\n if (dec[i] != in[i]) {\n printf(\"bad decode at %d\\n\", i);\n break;\n }\n\n if (i == _len(dec)) printf(\"Decoded ok\\n\");\n\n\n _del(in);\n _del(enc);\n _del(dec);\n\n return 0;\n}\n","language":"C"},{"code":"#include <string>\n#include <map>\n\n// Compress a string to a list of output symbols.\n// The result will be written to the output iterator\n// starting at \"result\"; the final iterator is returned.\ntemplate <typename Iterator>\nIterator compress(const std::string &uncompressed, Iterator result) {\n // Build the dictionary.\n int dictSize = 256;\n std::map<std::string,int> dictionary;\n for (int i = 0; i < 256; i++)\n dictionary[std::string(1, i)] = i;\n\n std::string w;\n for (std::string::const_iterator it = uncompressed.begin();\n it != uncompressed.end(); ++it) {\n char c = *it;\n std::string wc = w + c;\n if (dictionary.count(wc))\n w = wc;\n else {\n *result++ = dictionary[w];\n // Add wc to the dictionary.\n dictionary[wc] = dictSize++;\n w = std::string(1, c);\n }\n }\n\n // Output the code for w.\n if (!w.empty())\n *result++ = dictionary[w];\n return result;\n}\n\n// Decompress a list of output ks to a string.\n// \"begin\" and \"end\" must form a valid range of ints\ntemplate <typename Iterator>\nstd::string decompress(Iterator begin, Iterator end) {\n // Build the dictionary.\n int dictSize = 256;\n std::map<int,std::string> dictionary;\n for (int i = 0; i < 256; i++)\n dictionary[i] = std::string(1, i);\n\n std::string w(1, *begin++);\n std::string result = w;\n std::string entry;\n for ( ; begin != end; begin++) {\n int k = *begin;\n if (dictionary.count(k))\n entry = dictionary[k];\n else if (k == dictSize)\n entry = w + w[0];\n else\n throw \"Bad compressed k\";\n\n result += entry;\n\n // Add w+entry[0] to the dictionary.\n dictionary[dictSize++] = w + entry[0];\n\n w = entry;\n }\n return result;\n}\n\n#include <iostream>\n#include <iterator>\n#include <vector>\n\nint main() {\n std::vector<int> compressed;\n compress(\"TOBEORNOTTOBEORTOBEORNOT\", std::back_inserter(compressed));\n copy(compressed.begin(), compressed.end(), std::ostream_iterator<int>(std::cout, \", \"));\n std::cout << std::endl;\n std::string decompressed = decompress(compressed.begin(), compressed.end());\n std::cout << decompressed << std::endl;\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nnamespace LZW\n{\n public class Program\n {\n public static void Main(string[] args)\n {\n List<int> compressed = Compress(\"TOBEORNOTTOBEORTOBEORNOT\");\n Console.WriteLine(string.Join(\", \", compressed));\n string decompressed = Decompress(compressed);\n Console.WriteLine(decompressed);\n }\n\n public static List<int> Compress(string uncompressed)\n {\n // build the dictionary\n Dictionary<string, int> dictionary = new Dictionary<string, int>();\n for (int i = 0; i < 256; i++)\n dictionary.Add(((char)i).ToString(), i);\n\n string w = string.Empty;\n List<int> compressed = new List<int>();\n\n foreach (char c in uncompressed)\n {\n string wc = w + c;\n if (dictionary.ContainsKey(wc))\n {\n w = wc;\n }\n else\n {\n // write w to output\n compressed.Add(dictionary[w]);\n // wc is a new sequence; add it to the dictionary\n dictionary.Add(wc, dictionary.Count);\n w = c.ToString();\n }\n }\n\n // write remaining output if necessary\n if (!string.IsNullOrEmpty(w))\n compressed.Add(dictionary[w]);\n\n return compressed;\n }\n\n public static string Decompress(List<int> compressed)\n {\n // build the dictionary\n Dictionary<int, string> dictionary = new Dictionary<int, string>();\n for (int i = 0; i < 256; i++)\n dictionary.Add(i, ((char)i).ToString());\n\n string w = dictionary[compressed[0]];\n compressed.RemoveAt(0);\n StringBuilder decompressed = new StringBuilder(w);\n\n foreach (int k in compressed)\n {\n string entry = null;\n if (dictionary.ContainsKey(k))\n entry = dictionary[k];\n else if (k == dictionary.Count)\n entry = w + w[0];\n\n decompressed.Append(entry);\n\n // new sequence; add it to the dictionary\n dictionary.Add(dictionary.Count, w + entry[0]);\n\n w = entry;\n }\n\n return decompressed.ToString();\n }\n }\n}\n","language":"C-sharp"},{"code":"(defn make-dict []\n (let [vals (range 0 256)]\n (zipmap (map (comp #'list #'char) vals) vals)))\n\n(defn compress [#^String text]\n (loop [t (seq text)\n r '()\n w '()\n dict (make-dict)\n s 256]\n (let [c (first t)]\n (if c\n (let [wc (cons c w)]\n (if (get dict wc)\n (recur (rest t) r wc dict s)\n (recur (rest t) (cons (get dict w) r) (list c) (assoc dict wc s) (inc s))))\n (reverse (if w (cons (get dict w) r) r))))))\n\n(compress \"TOBEORNOTTOBEORTOBEORNOT\")\n","language":"Clojure"},{"code":"(84 79 66 69 79 82 78 79 84 256 258 260 265 259 261 263)\n","language":"Clojure"},{"code":"lzw = (s) ->\n dct = {} # map substrings to codes between 256 and 4096\n stream = [] # array of compression results\n\n # initialize basic ASCII characters\n for code_num in [0..255]\n c = String.fromCharCode(code_num)\n dct[c] = code_num\n code_num = 256\n\n i = 0\n while i < s.length\n # Find word and new_word\n # word = longest substr already encountered, or next character\n # new_word = word plus next character, a new substr to encode\n word = ''\n j = i\n while j < s.length\n new_word = word + s[j]\n break if !dct[new_word]\n word = new_word\n j += 1\n\n # stream out the code for the substring\n stream.push dct[word]\n\n # build up our encoding dictionary\n if code_num < 4096\n dct[new_word] = code_num\n code_num += 1\n\n # advance thru the string\n i += word.length\n stream\n\nconsole.log lzw \"TOBEORNOTTOBEORTOBEORNOT\"\n","language":"CoffeeScript"},{"code":"(declaim (ftype (function (vector vector &optional fixnum fixnum) vector)\n vector-append))\n(defun vector-append (old new &optional (start2 0) end2)\n (declare (optimize (speed 3) (safety 0) (debug 0)))\n (prog1 old\n (let* ((old-fill (fill-pointer old))\n (new-fill (+ old-fill (length new))))\n (when (> new-fill (array-dimension old 0))\n (adjust-array old (* 4 new-fill)))\n (setf (fill-pointer old) new-fill)\n (replace old new :start1 old-fill :start2 start2 :end2 end2))))\n\n(declaim (ftype (function (vector t) vector) vector-append1))\n(defun vector-append1 (old new)\n (prog1 old\n (let* ((old-fill (fill-pointer old))\n (new-fill (1+ old-fill)))\n (when (> new-fill (array-dimension old 0))\n (adjust-array old (* 4 new-fill)))\n (setf (fill-pointer old) new-fill)\n (setf (aref old old-fill) new))))\n\n(declaim (ftype (function (&optional t) vector) make-empty-vector))\n(defun make-empty-vector (&optional (element-type t))\n (make-array 0 :element-type element-type :fill-pointer 0 :adjustable t))\n\n\n(declaim (ftype (function (t &optional t) vector) make-vector-with-elt))\n(defun make-vector-with-elt (elt &optional (element-type t))\n (make-array 1 :element-type element-type\n :fill-pointer 1\n :adjustable t\n :initial-element elt))\n\n(declaim (ftype (function (vector t) vector) vector-append1-new))\n(defun vector-append1-new (old new)\n (vector-append1 (vector-append (make-empty-vector 'octet) old)\n new))\n\n(declaim (ftype (function (vector vector) vector) vector-append-new))\n(defun vector-append-new (old new)\n (vector-append (vector-append (make-empty-vector 'octet) old)\n new))\n\n(deftype octet () '(unsigned-byte 8))\n\n(declaim (ftype (function () hash-table) build-dictionary))\n(defun build-dictionary ()\n (let ((dictionary (make-hash-table :test #'equalp)))\n (loop for i below 256\n do (let ((vec (make-vector-with-elt i 'octet)))\n (setf (gethash vec dictionary) vec)))\n dictionary))\n\n(declaim (ftype (function ((vector octet)) (vector octet))\n lzw-compress-octets))\n(defun lzw-compress-octets (octets)\n (declare (optimize (speed 3) (safety 0) (debug 0)))\n (loop with dictionary-size of-type fixnum = 256\n with w = (make-empty-vector 'octet)\n with result = (make-empty-vector 't)\n with dictionary = (build-dictionary)\n for c across octets\n for wc = (vector-append1-new w c)\n if (gethash wc dictionary) do (setq w wc)\n else do\n (vector-append result (gethash w dictionary))\n (setf (gethash wc dictionary)\n (make-vector-with-elt dictionary-size))\n (incf dictionary-size)\n (setq w (make-vector-with-elt c 'octet))\n finally (unless (zerop (length (the (vector octet) w)))\n (vector-append result (gethash w dictionary)))\n (return result)))\n\n(declaim (ftype (function (vector) (vector octet)) lzw-decompress))\n(defun #1=lzw-decompress (octets)\n (declare (optimize (speed 3) (safety 0) (debug 0)))\n (when (zerop (length octets))\n (return-from #1# (make-empty-vector 'octet)))\n (loop with dictionary-size = 256\n with dictionary = (build-dictionary)\n with result = (make-vector-with-elt (aref octets 0) 'octet)\n with w = (copy-seq result)\n for i from 1 below (length octets)\n for k = (make-vector-with-elt (aref octets i) 't)\n for entry = (or (gethash k dictionary)\n (if (equalp k dictionary-size)\n (vector-append1-new w (aref w 0))\n (error \"bad compresed entry at pos ~S\" i)))\n do (vector-append result entry)\n (setf (gethash (make-vector-with-elt dictionary-size) dictionary)\n (vector-append1-new w (aref entry 0)))\n (incf dictionary-size)\n (setq w entry)\n finally (return result)))\n\n(defgeneric lzw-compress (datum)\n (:method ((string string))\n (lzw-compress (babel:string-to-octets string)))\n (:method ((octets vector))\n (lzw-compress-octets octets)))\n\n(defun lzw-decompress-to-string (octets)\n (babel:octets-to-string (lzw-decompress octets)))\n\n(defun test (string)\n (assert (equal #2=(lzw-decompress-to-string (lzw-compress string)) string) ()\n \"Can't compress ~S properly, got ~S instead\" string #2#)\n t)\n","language":"Common-Lisp"},{"code":"CL-USER> (test \"TOBEORNOTTOBEORTOBEORNOT\")\nT\nCL-USER> (lzw-compress \"TOBEORNOTTOBEORTOBEORNOT\")\n#(84 79 66 69 79 82 78 79 84 256 258 260 265 259 261 263)\nCL-USER> (lzw-decompress-to-string *)\n\"TOBEORNOTTOBEORTOBEORNOT\"\n","language":"Common-Lisp"},{"code":"import std.stdio, std.array;\n\nauto compress(in string original) pure nothrow {\n int[string] dict;\n foreach (immutable char c; char.min .. char.max + 1)\n dict[[c]] = c;\n\n string w;\n int[] result;\n foreach (immutable ch; original)\n if (w ~ ch in dict)\n w = w ~ ch;\n else {\n result ~= dict[w];\n dict[w ~ ch] = dict.length;\n w = [ch];\n }\n return w.empty ? result : (result ~ dict[w]);\n}\n\nauto decompress(in int[] compressed) pure nothrow {\n auto dict = new string[char.max - char.min + 1];\n foreach (immutable char c; char.min .. char.max + 1)\n dict[c] = [c];\n\n auto w = dict[compressed[0]];\n auto result = w;\n foreach (immutable k; compressed[1 .. $]) {\n auto entry = (k < dict.length) ? dict[k] : w ~ w[0];\n result ~= entry;\n dict ~= w ~ entry[0];\n w = entry;\n }\n return result;\n}\n\nvoid main() {\n auto comp = \"TOBEORNOTTOBEORTOBEORNOT\".compress;\n writeln(comp, \"\\n\", comp.decompress);\n}\n","language":"D"},{"code":"struct LZW {\n import std.array: empty;\n\n // T is ubyte instead of char because D strings are UTF-8.\n alias T = ubyte;\n alias Tcomp = ushort;\n static assert(Tcomp.sizeof > 1);\n alias Ta = immutable(T)[];\n\n enum int initDictSize = 256;\n static immutable ubyte[initDictSize] bytes;\n static this() {\n foreach (immutable T i; 0 .. initDictSize)\n bytes[i] = i;\n }\n\n static Tcomp[] compress(immutable scope T[] original) pure nothrow @safe\n out(result) {\n if (!original.empty)\n assert(result[0] < initDictSize);\n } body {\n if (original.empty)\n return [];\n Tcomp[Ta] dict;\n foreach (immutable b; bytes)\n dict[[b]] = b;\n\n // Here built-in slices give lower efficiency.\n struct Slice {\n size_t start, end;\n @property opSlice() const pure nothrow @safe @nogc {\n return original[start .. end];\n }\n alias opSlice this;\n }\n\n Slice w;\n Tcomp[] result;\n foreach (immutable i; 0 .. original.length) {\n auto wc = Slice(w.start, w.end + 1); // Extend slice.\n if (wc in dict) {\n w = wc;\n } else {\n result ~= dict[w];\n assert(dict.length < Tcomp.max); // Overflow guard.\n dict[wc] = cast(Tcomp)dict.length;\n w = Slice(i, i + 1);\n }\n }\n\n if (!w.empty)\n result ~= dict[w];\n return result;\n }\n\n static Ta decompress(in Tcomp[] compressed) pure @safe\n in {\n if (!compressed.empty)\n assert(compressed[0] < initDictSize, \"Bad compressed\");\n } body {\n if (compressed.empty)\n return [];\n\n auto dict = new Ta[initDictSize];\n foreach (immutable b; bytes)\n dict[b] = [b];\n\n auto w = dict[compressed[0]];\n auto result = w;\n foreach (immutable k; compressed[1 .. $]) {\n Ta entry;\n if (k < dict.length)\n entry = dict[k];\n else if (k == dict.length)\n entry = w ~ w[0];\n else\n throw new Exception(\"Bad compressed k.\");\n result ~= entry;\n\n dict ~= w ~ entry[0];\n w = entry;\n }\n\n return result;\n }\n}\n\nvoid main() {\n import std.stdio, std.string;\n\n immutable txt = \"TOBEORNOTTOBEORTOBEORNOT\";\n immutable compressed = LZW.compress(txt.representation);\n compressed.writeln;\n LZW.decompress(compressed).assumeUTF.writeln;\n}\n","language":"D"},{"code":"enum Marker: ushort {\n CLR = 256, // Clear table marker.\n EOD = 257, // End-of-data marker.\n NEW = 258 // New code index.\n}\n\n\nubyte[] lzwEncode(scope const(ubyte)[] inp, in uint maxBits) pure nothrow\nin {\n assert(maxBits >= 9 && maxBits <= 16);\n} body {\n // Encode dictionary array. For encoding, entry at\n // code index is a list of indices that follow current one,\n // i.e. if code 97 is 'a', code 387 is 'ab', and code 1022 is 'abc',\n // then dict[97].next['b'] = 387, dict[387].next['c'] = 1022, etc.\n alias LZWenc = ushort[256];\n\n auto len = inp.length;\n uint bits = 9;\n auto d = new LZWenc[512];\n\n auto result = new ubyte[16];\n size_t outLen = 0;\n size_t oBits = 0;\n uint tmp = 0;\n\n void writeBits(in ushort x) nothrow {\n tmp = (tmp << bits) | x;\n oBits += bits;\n if (result.length / 2 <= outLen)\n result.length *= 2;\n while (oBits >= 8) {\n oBits -= 8;\n assert(tmp >> oBits <= ubyte.max);\n result[outLen] = cast(ubyte)(tmp >> oBits);\n outLen++;\n tmp &= (1 << oBits) - 1;\n }\n }\n\n // writeBits(Marker.CLR);\n ushort nextCode = Marker.NEW;\n uint nextShift = 512;\n ushort code = inp[0];\n inp = inp[1 .. $]; // popFront.\n while (--len) {\n ushort c = inp[0];\n inp = inp[1 .. $]; // popFront.\n ushort nc = d[code][c];\n if (nc) {\n code = nc;\n } else {\n writeBits(code);\n nc = d[code][c] = nextCode;\n nextCode++;\n code = c;\n }\n\n // Next new code would be too long for current table.\n if (nextCode == nextShift) {\n // Either reset table back to 9 bits.\n bits++;\n if (bits > maxBits) {\n // Table clear marker must occur before bit reset.\n writeBits(Marker.CLR);\n\n bits = 9;\n nextShift = 512;\n nextCode = Marker.NEW;\n d[] = LZWenc.init;\n } else { // Or extend table.\n nextShift *= 2;\n d.length = nextShift;\n }\n }\n }\n\n writeBits(code);\n writeBits(Marker.EOD);\n if (tmp) {\n assert(tmp <= ushort.max);\n writeBits(cast(ushort)tmp);\n }\n\n return result[0 .. outLen];\n}\n\n\nubyte[] lzwDecode(scope const(ubyte)[] inp) pure {\n // For decoding, dictionary contains index of whatever prefix\n // index plus trailing ubyte. i.e. like previous example,\n // dict[1022] = { c: 'c', prev: 387 },\n // dict[387] = { c: 'b', prev: 97 },\n // dict[97] = { c: 'a', prev: 0 }\n // the \"back\" element is used for temporarily chaining indices\n // when resolving a code to bytes.\n static struct LZWdec {\n ushort prev, back;\n ubyte c;\n }\n\n auto result = new ubyte[4];\n uint outLen = 0;\n\n void writeOut(in ubyte c) nothrow {\n while (outLen >= result.length)\n result.length *= 2;\n result[outLen] = c;\n outLen++;\n }\n\n auto d = new LZWdec[512];\n ushort code = 0;\n uint bits = 9;\n uint len = 0;\n uint nBits = 0;\n uint tmp = 0;\n\n void getCode() nothrow {\n while (nBits < bits) {\n if (len > 0) {\n len--;\n tmp = (tmp << 8) | inp[0];\n inp = inp[1 .. $]; // popFront.\n nBits += 8;\n } else {\n tmp = tmp << (bits - nBits);\n nBits = bits;\n }\n }\n\n nBits -= bits;\n assert(tmp >> nBits <= ushort.max);\n code = cast(ushort)(tmp >> nBits);\n tmp &= (1 << nBits) - 1;\n }\n\n uint nextShift = 512;\n ushort nextCode = Marker.NEW;\n\n void clearTable() nothrow {\n d[] = LZWdec.init;\n foreach (immutable ubyte j; 0 .. 256)\n d[j].c = j;\n nextCode = Marker.NEW;\n nextShift = 512;\n bits = 9;\n }\n\n clearTable(); // In case encoded bits didn't start with Marker.CLR.\n for (len = inp.length; len;) {\n getCode();\n if (code == Marker.EOD)\n break;\n if (code == Marker.CLR) {\n clearTable();\n continue;\n }\n\n if (code >= nextCode)\n throw new Error(\"Bad sequence.\");\n\n auto c = code;\n d[nextCode].prev = c;\n while (c > 255) {\n immutable t = d[c].prev;\n d[t].back = c;\n c = t;\n }\n\n assert(c <= ubyte.max);\n d[nextCode - 1].c = cast(ubyte)c;\n\n while (d[c].back) {\n writeOut(d[c].c);\n immutable t = d[c].back;\n d[c].back = 0;\n c = t;\n }\n writeOut(d[c].c);\n\n nextCode++;\n if (nextCode >= nextShift) {\n bits++;\n if (bits > 16) {\n // If input was correct, we'd have hit Marker.CLR before this.\n throw new Error(\"Too many bits.\");\n }\n nextShift *= 2;\n d.length = nextShift;\n }\n }\n\n // Might be OK, so throw just an exception.\n if (code != Marker.EOD)\n throw new Exception(\"Bits did not end in EOD\");\n\n return result[0 .. outLen];\n}\n\n\nvoid main() {\n import std.stdio, std.file;\n\n const inputData = cast(ubyte[])read(\"unixdict.txt\");\n writeln(\"Input size: \", inputData.length);\n\n immutable encoded = lzwEncode(inputData, 12);\n writeln(\"Encoded size: \", encoded.length);\n\n immutable decoded = lzwDecode(encoded);\n writeln(\"Decoded size: \", decoded.length);\n\n if (inputData.length != decoded.length)\n return writeln(\"Error: decoded size differs\");\n\n foreach (immutable i, immutable x; inputData)\n if (x != decoded[i])\n return writeln(\"Bad decode at \", i);\n\n \"Decoded OK.\".writeln;\n}\n","language":"D"},{"code":"Module: LZW\nSynopsis: LZW implementation for Rosetta code\n\ndefine method output(n :: <integer>)\n format-out(\"%d \", n);\nend;\n\ndefine method contains?(dict, var)\n let x = element(dict, var, default: #f);\n x ~= #f;\nend;\n\ndefine method byte->string(c)\n add(\"\", as(<character>, c));\nend;\n\ndefine method compress(input :: <string>) => <vector>;\n let result = make(<vector>);\n let dict = make(<string-table>);\n for (x from 0 to 255)\n dict[byte->string(x)] := x;\n end;\n\n let next-code = 256;\n let cur-seq = \"\";\n for (c in input)\n let wc = add(cur-seq, c);\n if (contains?(dict, wc))\n cur-seq := wc;\n else\n result := add(result, dict[cur-seq]);\n dict[wc] := next-code;\n next-code := next-code + 1;\n cur-seq := add(\"\", c);\n end\n end;\n unless (empty?(cur-seq))\n result := add(result, dict[cur-seq]);\n end;\n result\nend;\n\nformat-out(\"%=\\n\", compress(\"TOBEORNOTTOBEORTOBEORNOT\"))\n","language":"Dylan"},{"code":"class\n APPLICATION\n\ncreate\n make\n\nfeature {NONE}\n\n make\n local\n test: LINKED_LIST [INTEGER]\n do\n create test.make\n test := compress (\"TOBEORNOTTOBEORTOBEORNOT\")\n across\n test as t\n loop\n io.put_string (t.item.out + \" \")\n end\n io.new_line\n io.put_string (decompress (test))\n end\n\n decompress (compressed: LINKED_LIST [INTEGER]): STRING\n --Decompressed version of 'compressed'.\n local\n dictsize, i, k: INTEGER\n dictionary: HASH_TABLE [STRING, INTEGER]\n w, entry: STRING\n char: CHARACTER_8\n do\n dictsize := 256\n create dictionary.make (300)\n create entry.make_empty\n create Result.make_empty\n from\n i := 0\n until\n i > 256\n loop\n char := i.to_character_8\n dictionary.put (char.out, i)\n i := i + 1\n end\n w := compressed.first.to_character_8.out\n compressed.go_i_th (1)\n compressed.remove\n Result := w\n from\n k := 1\n until\n k > compressed.count\n loop\n if attached dictionary.at (compressed [k]) as ata then\n entry := ata\n elseif compressed [k] = dictsize then\n entry := w + w.at (1).out\n else\n io.put_string (\"EXEPTION\")\n end\n Result := Result + entry\n dictsize := dictsize + 1\n dictionary.put (w + entry.at (1).out, dictsize)\n w := entry\n k := k + 1\n end\n end\n\n compress (uncompressed: STRING): LINKED_LIST [INTEGER]\n -- Compressed version of 'uncompressed'.\n local\n dictsize: INTEGER\n dictionary: HASH_TABLE [INTEGER, STRING]\n i: INTEGER\n w, wc: STRING\n char: CHARACTER_8\n do\n dictsize := 256\n create dictionary.make (256)\n create w.make_empty\n from\n i := 0\n until\n i > 256\n loop\n char := i.to_character_8\n dictionary.put (i, char.out)\n i := i + 1\n end\n create Result.make\n from\n i := 1\n until\n i > uncompressed.count\n loop\n wc := w + uncompressed [i].out\n if dictionary.has (wc) then\n w := wc\n else\n Result.extend (dictionary.at (w))\n dictSize := dictSize + 1\n dictionary.put (dictSize, wc)\n w := \"\" + uncompressed [i].out\n end\n i := i + 1\n end\n if w.count > 0 then\n Result.extend (dictionary.at (w))\n end\n end\n\nend\n","language":"Eiffel"},{"code":"defmodule LZW do\n @encode_map Enum.into(0..255, Map.new, &{[&1],&1})\n @decode_map Enum.into(0..255, Map.new, &{&1,[&1]})\n\n def encode(str), do: encode(to_char_list(str), @encode_map, 256, [])\n\n defp encode([h], d, _, out), do: Enum.reverse([d[[h]] | out])\n defp encode([h|t], d, free, out) do\n val = d[[h]]\n find_match(t, [h], val, d, free, out)\n end\n\n defp find_match([h|t], l, lastval, d, free, out) do\n case Map.fetch(d, [h|l]) do\n {:ok, val} -> find_match(t, [h|l], val, d, free, out)\n :error -> d1 = Map.put(d, [h|l], free)\n encode([h|t], d1, free+1, [lastval | out])\n end\n end\n defp find_match([], _, lastval, _, _, out), do: Enum.reverse([lastval | out])\n\n def decode([h|t]) do\n val = @decode_map[h]\n decode(t, val, 256, @decode_map, val)\n end\n\n defp decode([], _, _, _, l), do: Enum.reverse(l) |> to_string\n defp decode([h|t], old, free, d, l) do\n val = if h == free, do: old ++ [List.first(old)], else: d[h]\n add = [List.last(val) | old]\n d1 = Map.put(d, free, add)\n decode(t, val, free+1, d1, val++l)\n end\nend\n\nstr = \"TOBEORNOTTOBEORTOBEORNOT\"\nIO.inspect enc = LZW.encode(str)\nIO.inspect dec = LZW.decode(enc)\nIO.inspect str == dec\n","language":"Elixir"},{"code":"type LzwCompression\nfun compress ← List by text uncompressed\n List output ← int[]\n text working ← Text.EMPTY\n Map symbolTable ← text%int[].with(256, <int i|text%int(chr(i) => i))\n for each text c in uncompressed\n text augmented ← working + c\n\tif symbolTable.has(augmented)\n\t working ← augmented\n\telse\n\t symbolTable.insert(augmented, symbolTable.length)\n\t int i ← symbolTable[working]\n\t output.append(i)\n\t working ← c\n\tend\n end\n if not working.isEmpty()\n int i ← symbolTable[working]\n\toutput.append(i)\n end\n return output\nend\nfun decompress ← text by List compressed\n Map symbolTable ← int%text[].with(256, <int i|int%text(i => chr(i)))\n text working ← symbolTable[compressed[0]]\n text output ← *working\n for each int i in compressed.extract(1)\n text s\n if symbolTable.has(i)\n s ← symbolTable[i]\n else if i æ symbolTable.length # cScSc problem\n s ← working + working[0]\n else\n\t error(65, \"Error decompressing\")\n end\n output.append(s)\n symbolTable.insert(symbolTable.length, working + s[0])\n working ← s\n end\n return output\nend\nList compressed = compress(\"TOBEORNOTTOBEORTOBEORNOT\")\nwriteLine(compressed)\ntext decompressed = decompress(compressed)\nwriteLine(decompressed)\n","language":"EMal"},{"code":"-module(lzw).\n\n-export([test/0, encode/1, decode/1]).\n\n-import(lists, [reverse/1, reverse/2]).\n\ntest() ->\n Str = \"TOBEORNOTTOBEORTOBEORNOT\",\n [84,79,66,69,79,82,78,79,84,256,258,260,265,259,261,263] =\n encode(Str),\n Str = decode(encode(Str)),\n ok.\n\nencode(Str) ->\n D = init(dict:new()),\n encode(Str, D, 256, []).\n\nencode([H], D, _, Out) ->\n Val = dict:fetch([H], D),\n reverse([Val|Out]);\nencode([H|T], D, Free, Out) ->\n Val = dict:fetch([H], D),\n find_match(T, [H], Val, D, Free, Out).\n\nfind_match([H|T], L, LastVal, D, Free, Out) ->\n case dict:find([H|L], D) of\n {ok, Val} ->\n find_match(T, [H|L], Val, D, Free, Out);\n error ->\n D1 = dict:store([H|L], Free, D),\n encode([H|T], D1, Free+1, [LastVal|Out])\n end;\nfind_match([], _, LastVal, _, _, Out) ->\n reverse([LastVal|Out]).\n\ndecode([H|T]) ->\n D = init1(dict:new()),\n Val = dict:fetch(H, D),\n decode(T, Val, 256, D, Val).\n\ndecode([], _, _, _, L) ->\n reverse(L);\ndecode([H|T], Old, Free, D, L) ->\n Val = dict:fetch(H, D),\n Add = [lists:last(Val)|Old],\n D1 = dict:store(Free, Add, D),\n decode(T, Val, Free+1, D1, Val ++ L).\n\ninit(D) -> init(255, D).\n\ninit(0, D) -> D;\ninit(N, D) -> D1 = dict:store([N],N,D), init(N-1, D1).\n\ninit1(D) -> init1(255, D).\n\ninit1(0, D) -> D;\ninit1(N, D) -> D1 = dict:store(N,[N],D), init1(N-1, D1).\n","language":"Erlang"},{"code":"256 value next-symbol\n\n\\ current string fragment\n\ncreate w 256 allot \\ counted string\n\n: w=c ( c -- ) w 1+ c! 1 w c! ;\n: w+c ( c -- ) w count + c! w c@ 1+ w c! ;\n\n\\ Compression\n\n\\ dictionary of strings to symbols\n0 value dict\n\n: init-dict table to dict 256 to next-symbol dict set-current ;\n\n: free-dict forth-wordlist set-current ;\n\n: in-dict? ( key len -- ? ) \\ can assume len > 1\n dict search-wordlist dup if nip then ;\n\n: lookup-dict ( key len -- symbol )\n dup 1 = if drop c@ exit then\n dict search-wordlist if >body @ else abort\" bad-dict!\" then ;\n\n: put-dict ( data key len -- )\n nextname create , ;\n\n\\ output buffer of symbols\n\\ in real life, these symbols would be packed into octets\nvariable out-size\ncreate out 256 cells allot\n\n: output ( symbol -- )\n dup out out-size @ cells + ! 1 out-size +!\n dup 256 < if emit space else . then ;\n\n: compress ( addr len -- )\n init-dict 0 out-size !\n over c@ w=c 1 /string\n bounds do\n i c@ w+c\n w count in-dict? 0= if\n w count 1- lookup-dict output\n next-symbol dup w count put-dict\n 1+ to next-symbol\n i c@ w=c\n then\n loop\n w count lookup-dict output\n free-dict ;\n\n\\ Decompression\n\n\\ array of symbols to strings (in real code this would need to be growable)\n\\ next-symbol is reused for the size of this table\ncreate symtab 256 cells allot\n0 value start\n\n: init-symtab 256 to next-symbol here to start ;\n\n: free-symtab start here - allot ;\n\n: get-symbol ( symbol -- addr len )\n dup 256 < if pad c! pad 1 exit then\n 256 - cells symtab + @ count ;\n\n: add-symbol ( addr len -- )\n here symtab next-symbol 256 - cells + !\n s,\n next-symbol 1+ to next-symbol ;\n\ncreate entry 256 allot\n\n: decompress ( addr len -- )\n init-symtab\n over @ dup emit w=c\n cells bounds cell+ do\n i @ next-symbol < if\n i @ get-symbol entry place\n else i @ next-symbol = if\n w 1+ c@ w count + c! w count 1+ entry place\n else\n abort\" bad symbol!\"\n then then\n entry count type \\ output\n entry 1+ c@ w+c\n w count add-symbol\n entry count w place\n 1 cells +loop\n free-symtab ;\n\n\\ Testing\n\ns\" TOBEORNOTTOBEORTOBEORNOT\" compress cr\n\\ T O B E O R N O T 256 258 260 265 259 261 263\n\nout out-size @ decompress cr\n\\ TOBEORNOTTOBEORTOBEORNOT\n","language":"Forth"},{"code":"!\n! lzw_shared_parameters.f90\n!\n! LZW Common Variables Used by Coder and Decoder\n!\n! Author: Pedro Garcia Freitas <sawp@sawp.com.br>\n! May, 2011\n!\n! License: Creative Commons http://creativecommons.org/licenses/by-nc-nd/3.0/\n!\n MODULE LZW_SHARED_PARAMETERS\n IMPLICIT NONE\n!\n! PARAMETER definitions\n!\n INTEGER , PARAMETER :: COMPILER_INTEGER_SIZE = 32 , BITS = 12 , FILEIN = 66 , &\n & FILEOUT = 99 , MAX_VALUE = (2**BITS) - 1 , &\n & MAX_CODE = MAX_VALUE - 1 , MAX_DICTIONARY_SIZE = 5021 , &\n & SYMBOL_SIZE = 8 , MISSING_BITS = COMPILER_INTEGER_SIZE - &\n & SYMBOL_SIZE\n!\n! Local variables\n!\n INTEGER , DIMENSION(0:MAX_DICTIONARY_SIZE) :: concatenatedsymbols\n INTEGER , DIMENSION(0:MAX_DICTIONARY_SIZE) :: prefixcodes\n INTEGER :: the_status = 0\n\n! change this if compiler dont use 32 bits for integer\n\n END MODULE LZW_SHARED_PARAMETERS\n!\n! codecIO.f90\n!\n! bit IO routines for coder and encoder.\n!\n! Author: Pedro Garcia Freitas <sawp@sawp.com.br>\n! May, 2011\n!\n! License: Creative Commons http://creativecommons.org/licenses/by-nc-nd/3.0/\n!\n MODULE CODECIO\n USE LZW_SHARED_PARAMETERS\n IMPLICIT NONE\n!\n CONTAINS\n SUBROUTINE SETOUTPUTCODE(Code)\n IMPLICIT NONE\n!\n! Dummy arguments\n!\n INTEGER :: Code\n INTENT (IN) Code\n!\n! Local variables\n!\n INTEGER :: buffer\n INTEGER :: outputbitbuffer = 0\n INTEGER :: outputbitcount = 0\n INTEGER :: shift\n INTEGER :: shiftedsymbol\n!\n shift = COMPILER_INTEGER_SIZE - BITS - outputbitcount\n shiftedsymbol = ISHFT(Code , shift)\n outputbitbuffer = IOR(outputbitbuffer , shiftedsymbol)\n outputbitcount = outputbitcount + BITS\n\n DO WHILE(outputbitcount >= SYMBOL_SIZE)\n! IF( outputbitcount<SYMBOL_SIZE )EXIT\n buffer = ISHFT(outputbitbuffer , -MISSING_BITS)\n CALL SETRAWBYTE(buffer)\n outputbitbuffer = ISHFT(outputbitbuffer , SYMBOL_SIZE)\n outputbitcount = outputbitcount - SYMBOL_SIZE\n END DO\n RETURN\n END SUBROUTINE SETOUTPUTCODE\n\n\n SUBROUTINE SETRAWBYTE(Symbol)\n IMPLICIT NONE\n!\n! Dummy arguments\n!\n INTEGER :: Symbol\n INTENT (IN) Symbol\n!\n\n CALL FPUTC(FILEOUT , ACHAR(Symbol))\n END SUBROUTINE SETRAWBYTE\n\n\n FUNCTION GETRAWBYTE()\n IMPLICIT NONE\n!\n! Dummy arguments\n!\n INTEGER :: GETRAWBYTE\n!\n! Local variables\n!\n CHARACTER :: bufferedbyte\n!\n CALL FGETC(FILEIN , bufferedbyte , THE_status)\n GETRAWBYTE = IACHAR(bufferedbyte)\n END FUNCTION GETRAWBYTE\n\n FUNCTION GETINPUTCODE()\n IMPLICIT NONE\n!\n! Dummy arguments\n!\n INTEGER :: GETINPUTCODE\n!\n! Local variables\n!\n INTEGER :: inputbitbuffer = 0\n INTEGER :: inputbitcounter = 0\n INTEGER :: integerinputbuff\n INTEGER :: returnn\n INTEGER :: shiftedbit\n!\n DO WHILE( inputbitcounter <= MISSING_BITS )\n! IF( inputbitcounter>MISSING_BITS )EXIT\n integerinputbuff = GETRAWBYTE()\n shiftedbit = ISHFT(integerinputbuff , MISSING_BITS - inputbitcounter)\n inputbitbuffer = IOR(inputbitbuffer , shiftedbit)\n inputbitcounter = inputbitcounter + SYMBOL_SIZE\n END DO\n\n returnn = ISHFT(inputbitbuffer , BITS - COMPILER_INTEGER_SIZE)\n inputbitbuffer = ISHFT(inputbitbuffer , BITS)\n inputbitcounter = inputbitcounter - BITS\n GETINPUTCODE = returnn\n RETURN\n END FUNCTION GETINPUTCODE\nend module codecIO\n! lzw_encoder.f90\n!\n! LZW Coder (Compressor)\n!\n! Author: Pedro Garcia Freitas <sawp@sawp.com.br>\n! May, 2011\n!\n! License: Creative Commons http://creativecommons.org/licenses/by-nc-nd/3.0/\n!\n MODULE LZW_ENCODER\n USE LZW_SHARED_PARAMETERS\n USE CODECIO\n IMPLICIT NONE\n!\n! PARAMETER definitions\n!\n INTEGER , PARAMETER :: HASH_SHIFT = BITS - SYMBOL_SIZE\n!\n! Local variables\n!\n INTEGER , DIMENSION(0:MAX_DICTIONARY_SIZE) :: symbolvalues\n CONTAINS\n SUBROUTINE COMPRESS()\n IMPLICIT NONE\n!\n! Local variables\n!\n INTEGER :: codedsymbol\n INTEGER :: my_index\n INTEGER :: nextsymbol\n INTEGER :: symbol\n CHARACTER :: bufferedbyte\n!\n nextsymbol = COMPILER_INTEGER_SIZE*SYMBOL_SIZE\n SYMbolvalues(:) = -1\n\n! codedsymbol = GETRAWBYTE()\n CALL FGETC(FILEIN , bufferedbyte , THE_status)\n codedsymbol = IACHAR(bufferedbyte)\n!Can be hand optimized - optimization\n DO WHILE(THE_status == 0)\n! symbol = GETRAWBYTE() ! Manual inline of function\n CALL FGETC(FILEIN , bufferedbyte , THE_status)\n symbol = IACHAR(bufferedbyte)\n IF( THE_status/=0 )CYCLE\n\n my_index = GETPOSITIONONDICTIONARY(codedsymbol , symbol)\n IF( SYMbolvalues(my_index)/= - 1 )THEN\n codedsymbol = SYMbolvalues(my_index)\n ELSE\n IF( nextsymbol<=MAX_CODE )THEN\n SYMbolvalues(my_index) = nextsymbol\n nextsymbol = nextsymbol + 1\n PREfixcodes(my_index) = codedsymbol\n CONcatenatedsymbols(my_index) = symbol\n END IF\n CALL SETOUTPUTCODE(codedsymbol)\n codedsymbol = symbol\n END IF\n END DO\n CALL SETOUTPUTCODE(codedsymbol)\n CALL SETOUTPUTCODE(MAX_VALUE)\n CALL SETOUTPUTCODE(0)\n END SUBROUTINE COMPRESS\n\nfunction getPositionOnDictionary(hashPrefix, hashSymbol)\n integer, intent(in) :: hashPrefix\n integer, intent(in) :: hashSymbol\n integer :: getPositionOnDictionary\n integer :: index\n integer :: offset\n\n index = ishft(hashSymbol, HASH_SHIFT)\n index = ieor(index, hashPrefix)\n if (index == 0) then\n offset = 1\n else\n offset = MAX_DICTIONARY_SIZE - index\n endif\n\n do\n if (symbolValues(index) == -1) then\n getPositionOnDictionary = index\n exit\n endif\n\n if (prefixCodes(index) == hashPrefix .and. &\n & concatenatedSymbols(index) == hashSymbol) then\n getPositionOnDictionary = index\n exit\n endif\n\n index = index - offset\n if (index < 0) then\n index = index + MAX_DICTIONARY_SIZE\n endif\n end do\n return\n end function\n\nend module LZW_Encoder\n! lzw_decoder.f90\n!\n! LZW Decoder (Expanssor)\n!\n! Author: Pedro Garcia Freitas <sawp@sawp.com.br>\n! May, 2011\n!\n! License: Creative Commons http://creativecommons.org/licenses/by-nc-nd/3.0/\n!\n MODULE LZW_DECODER\n USE LZW_SHARED_PARAMETERS\n USE CODECIO\n IMPLICIT NONE\n!\n! Derived Type definitions\n!\n TYPE :: DECODE_BUFFER_STACK\n INTEGER , DIMENSION(0:MAX_DICTIONARY_SIZE) :: DECODERSTACK\n INTEGER :: TOP\n END TYPE DECODE_BUFFER_STACK\n!\n! Local variables\n!\n TYPE(DECODE_BUFFER_STACK) :: stack\n CONTAINS\n!\n! Can be hand optimized - optimization\n SUBROUTINE DECOMPRESS()\n IMPLICIT NONE\n!\n! Local variables\n!\n INTEGER :: newsymbol\n INTEGER :: nextsymbol\n INTEGER :: oldsymbol\n INTEGER :: popedsymbol\n INTEGER :: symbol\n!\n nextsymbol = COMPILER_INTEGER_SIZE*SYMBOL_SIZE\n oldsymbol = GETINPUTCODE()\n symbol = oldsymbol\n\n CALL SETRAWBYTE(oldsymbol)\n\n DO\n newsymbol = GETINPUTCODE()\n\n IF( newsymbol==MAX_VALUE )RETURN\n\n IF( newsymbol>=nextsymbol )THEN\n STAck%DECODERSTACK(0) = symbol\n CALL DECODESYMBOL(STAck%DECODERSTACK(1:) , oldsymbol)\n ELSE\n CALL DECODESYMBOL(STAck%DECODERSTACK(:) , newsymbol)\n END IF\n\n symbol = STAck%DECODERSTACK(STAck%TOP)\n\n DO WHILE ( STAck%TOP>=0 )\n popedsymbol = STAck%DECODERSTACK(STAck%TOP)\n CALL SETRAWBYTE(popedsymbol)\n STAck%TOP = STAck%TOP - 1\n END DO\n\n IF( nextsymbol<=MAX_CODE )THEN\n PREfixcodes(nextsymbol) = oldsymbol\n CONcatenatedsymbols(nextsymbol) = symbol\n nextsymbol = nextsymbol + 1\n END IF\n oldsymbol = newsymbol\n END DO\n RETURN\n END SUBROUTINE DECOMPRESS\n\n SUBROUTINE DECODESYMBOL(Buffer , Code)\n IMPLICIT NONE\n!\n! Dummy arguments\n!\n INTEGER :: Code\n INTEGER , DIMENSION(:) :: Buffer\n INTENT (IN) Code\n INTENT (INOUT) Buffer\n!\n! Local variables\n!\n INTEGER :: i\n INTEGER :: j\n INTEGER :: symbol\n!\n j = 0\n symbol = Code\n STAck%TOP = 0\n DO WHILE ( symbol>=COMPILER_INTEGER_SIZE*SYMBOL_SIZE )\n ! IF( symbol<COMPILER_INTEGER_SIZE*SYMBOL_SIZE )EXIT\n\n IF( j>=MAX_CODE )THEN\n PRINT * , \"Decoding error\"\n STOP\n END IF\n\n i = STAck%TOP + 1\n Buffer(i) = CONcatenatedsymbols(symbol)\n symbol = PREfixcodes(symbol)\n STAck%TOP = STAck%TOP + 1\n j = j + 1\n END DO\n i = j + 1\n Buffer(i) = symbol\n END SUBROUTINE DECODESYMBOL\nend module LZW_Decoder\n! lzw.f90\n!\n! LZW Coder and Decoder\n!\n! Author: Pedro Garcia Freitas <sawp@sawp.com.br>\n! May, 2011\n!\n! License: Creative Commons http://creativecommons.org/licenses/by-nc-nd/3.0/\n!\n\n MODULE LZW\n USE LZW_SHARED_PARAMETERS\n USE LZW_ENCODER\n USE LZW_DECODER\n IMPLICIT NONE\n CONTAINS\n SUBROUTINE INIT(Input , Output , Operation , Filename)\n IMPLICIT NONE\n!\n! Dummy arguments\n!\n CHARACTER(100) :: Filename\n CHARACTER(100) :: Input\n CHARACTER(1) :: Operation\n CHARACTER(100) :: Output\n INTENT (IN) Filename , Input , Operation , Output\n!\n IF( Operation/='d' .AND. Operation/='e' )THEN\n PRINT * , \"Usage: \" // TRIM(Filename) // \" <operation> input output\"\n PRINT * , \"Possible operations: \"\n PRINT * , \" e -> encode (compress)\"\n PRINT * , \" d -> decode (inflate)\"\n STOP\n END IF\n\n OPEN(UNIT = FILEIN , FILE = Input , ACTION = \"read\" , STATUS = \"old\" , &\n &ACCESS = 'stream' , FORM = \"formatted\")\n OPEN(UNIT = FILEOUT , FILE = Output , ACTION = \"write\" , STATUS = \"replace\" , &\n & ACCESS = 'stream' , FORM = \"formatted\")\n\n IF( Operation=='d' )THEN\n PRINT * , \"Decoding...\"\n CALL DECOMPRESS()\n ELSE\n PRINT * , \"Encoding...\"\n CALL COMPRESS()\n END IF\n\n CLOSE(UNIT = FILEIN)\n CLOSE(UNIT = FILEOUT)\n END SUBROUTINE INIT\nend module LZW\n!\n PROGRAM MAIN\n USE LZW\n IMPLICIT NONE\n!\n! Local variables\n!\n CHARACTER(100) :: filename\n REAL :: finish\n CHARACTER(100) :: input\n CHARACTER(1) :: operation\n CHARACTER(100) :: output\n REAL :: start\n!\n CALL GETARG(0 , filename)\n CALL GETARG(1 , operation)\n CALL GETARG(2 , input)\n CALL GETARG(3 , output)\n CALL CPU_TIME(start)\n CALL INIT(input , output , operation , filename)\n CALL CPU_TIME(finish)\n PRINT '(\"Time = \",f6.3,\" seconds.\")' , finish - start\n END PROGRAM MAIN\n","language":"Fortran"},{"code":"' version 22-02-2019\n' compile with: fbc -s console\n\nType dict\n prefix As Integer\n B As String\nEnd Type\n\nSub init(dictionary() As dict, ByRef last As ULong)\n\n For i As ULong = 0 To 255\n dictionary(i).prefix = -1\n dictionary(i).B = Chr(i)\n Next\n last = 255\n\nEnd Sub\n\nFunction encode_LZW(dictionary() As dict, last_entry As ULong, input_str As String) As String\n\n If Len(input_str) < 2 Then\n Print \"input string is to short\"\n Return \"\"\n End If\n\n Dim As String word, output_str, char\n Dim As ULong i = 1, index, j, len_input = Len(input_str)\n\n Do\n If i > len_input Then\n output_str = output_str + \" \" + Str(index)\n Return output_str ' no more chars to process. we are done\n End If\n char = Mid(Input_str, i, 1)\n i += 1\n For j = 0 To last_entry\n If dictionary(j).B = word + char Then\n word += char\n index = j\n Continue Do\n End If\n Next\n output_str = output_str + \" \" + Str(index)\n last_entry = last_entry +1\n dictionary(last_entry).B = word + char\n dictionary(last_entry).prefix = index\n word = char : index = Asc(char)\n Loop\n\nEnd Function\n\nFunction decode_LZW(dictionary() As dict, last_entry As ULong, input_str As String) As String\n\n Dim As String temp, word, output_str\n Dim As ULong i, i1 = 1, j, index\n input_str = Trim(input_str)\n Dim As ULong len_input = Len(input_str)\n input_str = input_str + \" \"\n\n i = InStr(i1, input_str, \" \")\n index = Val(Mid(Input_str, i1, i - i1))\n word = dictionary(index).B\n output_str = word\n i1 = i +1\n Do\n i = InStr(i1, input_str, \" \")\n If i >= len_input Then\n index = Val(Mid(input_str, i1))\n output_str = output_str + dictionary(index).B\n Return output_str\n End If\n index = Val(Mid(Input_str, i1, i - i1))\n i1 = i +1\n If index <= last_entry Then\n temp = dictionary(index).B\n Else\n temp = word + Left(word, 1)\n End If\n output_str = output_str + temp\n last_entry = last_entry +1\n dictionary(last_entry).B = word + Left(temp, 1)\n word = temp\n Loop\n\nEnd Function\n\n' ------=< MAIN >=------\n\nDim As ULong last_entry, max_bit = 9\nDim As ULong dict_max = 1 Shl max_bit -1\nDim As String output_str, input_str = \"TOBEORNOTTOBEORTOBEORNOT\"\nDim As dict dictionary()\n\nPrint \" input str: \";input_str\n\nReDim dictionary(dict_max +1)\ninit(dictionary(), last_entry)\noutput_str = encode_LZW(dictionary(), last_entry, input_str)\nPrint \"encoded str: \";output_str\n\nReDim dictionary(dict_max +1)\ninit(dictionary(), last_entry)\noutput_str = decode_LZW(dictionary(), last_entry, output_str)\nPrint \"decoded str: \"; output_str\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\t\"fmt\"\n\t\"log\"\n\t\"strings\"\n)\n\n// Compress a string to a list of output symbols.\nfunc compress(uncompressed string) []int {\n\t// Build the dictionary.\n\tdictSize := 256\n\t// We actually want a map of []byte -> int but\n\t// slices are not acceptable map key types.\n\tdictionary := make(map[string]int, dictSize)\n\tfor i := 0; i < dictSize; i++ {\n\t\t// Ugly mess to work around not having a []byte key type.\n\t\t// Using `string(i)` would do utf8 encoding for i>127.\n\t\tdictionary[string([]byte{byte(i)})] = i\n\t}\n\n\tvar result []int\n\tvar w []byte\n\tfor i := 0; i < len(uncompressed); i++ {\n\t\tc := uncompressed[i]\n\t\twc := append(w, c)\n\t\tif _, ok := dictionary[string(wc)]; ok {\n\t\t\tw = wc\n\t\t} else {\n\t\t\tresult = append(result, dictionary[string(w)])\n\t\t\t// Add wc to the dictionary.\n\t\t\tdictionary[string(wc)] = dictSize\n\t\t\tdictSize++\n\t\t\t//w = []byte{c}, but re-using wc\n\t\t\twc[0] = c\n\t\t\tw = wc[:1]\n\t\t}\n\t}\n\n\tif len(w) > 0 {\n\t\t// Output the code for w.\n\t\tresult = append(result, dictionary[string(w)])\n\t}\n\treturn result\n}\n\ntype BadSymbolError int\n\nfunc (e BadSymbolError) Error() string {\n\treturn fmt.Sprint(\"Bad compressed symbol \", int(e))\n}\n\n// Decompress a list of output symbols to a string.\nfunc decompress(compressed []int) (string, error) {\n\t// Build the dictionary.\n\tdictSize := 256\n\tdictionary := make(map[int][]byte, dictSize)\n\tfor i := 0; i < dictSize; i++ {\n\t\tdictionary[i] = []byte{byte(i)}\n\t}\n\n\tvar result strings.Builder\n\tvar w []byte\n\tfor _, k := range compressed {\n\t\tvar entry []byte\n\t\tif x, ok := dictionary[k]; ok {\n\t\t\t//entry = x, but ensuring any append will make a copy\n\t\t\tentry = x[:len(x):len(x)]\n\t\t} else if k == dictSize && len(w) > 0 {\n\t\t\tentry = append(w, w[0])\n\t\t} else {\n\t\t\treturn result.String(), BadSymbolError(k)\n\t\t}\n\t\tresult.Write(entry)\n\n\t\tif len(w) > 0 {\n\t\t\t// Add w+entry[0] to the dictionary.\n\t\t\tw = append(w, entry[0])\n\t\t\tdictionary[dictSize] = w\n\t\t\tdictSize++\n\t\t}\n\t\tw = entry\n\t}\n\treturn result.String(), nil\n}\n\nfunc main() {\n\tcompressed := compress(\"TOBEORNOTTOBEORTOBEORNOT\")\n\tfmt.Println(compressed)\n\tdecompressed, err := decompress(compressed)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tfmt.Println(decompressed)\n}\n","language":"Go"},{"code":"def compress = { text ->\n def dictionary = (0..<256).inject([:]) { map, ch -> map.\"${(char)ch}\" = ch; map }\n def w = '', compressed = []\n text.each { ch ->\n def wc = \"$w$ch\"\n if (dictionary[wc]) {\n w = wc\n } else {\n compressed << dictionary[w]\n dictionary[wc] = dictionary.size()\n w = \"$ch\"\n }\n }\n if (w) { compressed << dictionary[w] }\n compressed\n}\n\ndef decompress = { compressed ->\n def dictionary = (0..<256).inject([:]) { map, ch -> map[ch] = \"${(char)ch}\"; map }\n int dictSize = 128;\n String w = \"${(char)compressed[0]}\"\n StringBuffer result = new StringBuffer(w)\n\n compressed.drop(1).each { k ->\n String entry = dictionary[k]\n if (!entry) {\n if (k != dictionary.size()) throw new IllegalArgumentException(\"Bad compressed k $k\")\n entry = \"$w${w[0]}\"\n }\n result << entry\n\n dictionary[dictionary.size()] = \"$w${entry[0]}\"\n w = entry\n }\n\n result.toString()\n}\n","language":"Groovy"},{"code":"def plaintext = 'TOBEORNOTTOBEORTOBEORNOT'\ndef compressed = compress(plaintext)\ndef result = decompress(compressed)\n\nprintln \"\"\"\\\n Plaintext: '$plaintext'\n Compressed: $compressed\n Uncompressed: '$result'\"\"\".stripIndent()\n","language":"Groovy"},{"code":"import Data.List (elemIndex, tails)\nimport Data.Maybe (fromJust)\n\ndoLZW :: Eq a => [a] -> [a] -> [Int]\ndoLZW _ [] = []\ndoLZW as (x:xs) = lzw (return <$> as) [x] xs\n where\n lzw a w [] = [fromJust $ elemIndex w a]\n lzw a w (x:xs)\n | w_ `elem` a = lzw a w_ xs\n | otherwise = fromJust (elemIndex w a) : lzw (a ++ [w_]) [x] xs\n where\n w_ = w ++ [x]\n\nundoLZW :: [a] -> [Int] -> [a]\nundoLZW _ [] = []\nundoLZW a cs =\n cs >>=\n (!!)\n (foldl\n ((.) <$> (++) <*>\n (\\x xs -> return (((++) <$> head <*> take 1 . last) ((x !!) <$> xs))))\n (return <$> a)\n (take2 cs))\n\ntake2 :: [a] -> [[a]]\ntake2 xs = filter ((2 ==) . length) (take 2 <$> tails xs)\n\nmain :: IO ()\nmain = do\n print $ doLZW ['\\0' .. '\\255'] \"TOBEORNOTTOBEORTOBEORNOT\"\n print $\n undoLZW\n ['\\0' .. '\\255']\n [84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263]\n print $\n ((==) <*> ((.) <$> undoLZW <*> doLZW) ['\\NUL' .. '\\255'])\n \"TOBEORNOTTOBEORTOBEORNOT\"\n","language":"Haskell"},{"code":"encodeLZW =: 4 : 0\n d=. ;/x\n r=.0$0\n wc=.w=.{.y\n for_c. }.y do.\n wc=.w,c\n if. d e.~ <wc do. w=.wc else.\n r=. r, d i.<w\n d=.d,<wc\n w=.c\n end.\n end.\n r, d i.<w\n)\n","language":"J"},{"code":"decodeLZW =: 4 : 0\n d=.;/x\n w=.r=. >d{~{.y\n ds=. #d\n for_c. }.y do.\n select. * c-ds\n case. _1 do. r=.r,e=.>c{d\n case. 0 do. r=.r,e=.w,{.w\n case. do. 'error' return.\n end.\n d=.d,< w,{.e\n w=.e\n ds=.ds+1\n end.\n ;r\n)\n","language":"J"},{"code":"import java.util.*;\n\npublic class LZW {\n /** Compress a string to a list of output symbols. */\n public static List<Integer> compress(String uncompressed) {\n // Build the dictionary.\n int dictSize = 256;\n Map<String,Integer> dictionary = new HashMap<String,Integer>();\n for (int i = 0; i < 256; i++)\n dictionary.put(\"\" + (char)i, i);\n\n String w = \"\";\n List<Integer> result = new ArrayList<Integer>();\n for (char c : uncompressed.toCharArray()) {\n String wc = w + c;\n if (dictionary.containsKey(wc))\n w = wc;\n else {\n result.add(dictionary.get(w));\n // Add wc to the dictionary.\n dictionary.put(wc, dictSize++);\n w = \"\" + c;\n }\n }\n\n // Output the code for w.\n if (!w.equals(\"\"))\n result.add(dictionary.get(w));\n return result;\n }\n\n /** Decompress a list of output ks to a string. */\n public static String decompress(List<Integer> compressed) {\n // Build the dictionary.\n int dictSize = 256;\n Map<Integer,String> dictionary = new HashMap<Integer,String>();\n for (int i = 0; i < 256; i++)\n dictionary.put(i, \"\" + (char)i);\n\n String w = \"\" + (char)(int)compressed.remove(0);\n StringBuffer result = new StringBuffer(w);\n for (int k : compressed) {\n String entry;\n if (dictionary.containsKey(k))\n entry = dictionary.get(k);\n else if (k == dictSize)\n entry = w + w.charAt(0);\n else\n throw new IllegalArgumentException(\"Bad compressed k: \" + k);\n\n result.append(entry);\n\n // Add w+entry[0] to the dictionary.\n dictionary.put(dictSize++, w + entry.charAt(0));\n\n w = entry;\n }\n return result.toString();\n }\n\n public static void main(String[] args) {\n List<Integer> compressed = compress(\"TOBEORNOTTOBEORTOBEORNOT\");\n System.out.println(compressed);\n String decompressed = decompress(compressed);\n System.out.println(decompressed);\n }\n}\n","language":"Java"},{"code":"[84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263]\nTOBEORNOTTOBEORTOBEORNOT\n","language":"Java"},{"code":"//LZW Compression/Decompression for Strings\nvar LZW = {\n compress: function (uncompressed) {\n \"use strict\";\n // Build the dictionary.\n var i,\n dictionary = {},\n c,\n wc,\n w = \"\",\n result = [],\n dictSize = 256;\n for (i = 0; i < 256; i += 1) {\n dictionary[String.fromCharCode(i)] = i;\n }\n\n for (i = 0; i < uncompressed.length; i += 1) {\n c = uncompressed.charAt(i);\n wc = w + c;\n //Do not use dictionary[wc] because javascript arrays\n //will return values for array['pop'], array['push'] etc\n // if (dictionary[wc]) {\n if (dictionary.hasOwnProperty(wc)) {\n w = wc;\n } else {\n result.push(dictionary[w]);\n // Add wc to the dictionary.\n dictionary[wc] = dictSize++;\n w = String(c);\n }\n }\n\n // Output the code for w.\n if (w !== \"\") {\n result.push(dictionary[w]);\n }\n return result;\n },\n\n\n decompress: function (compressed) {\n \"use strict\";\n // Build the dictionary.\n var i,\n dictionary = [],\n w,\n result,\n k,\n entry = \"\",\n dictSize = 256;\n for (i = 0; i < 256; i += 1) {\n dictionary[i] = String.fromCharCode(i);\n }\n\n w = String.fromCharCode(compressed[0]);\n result = w;\n for (i = 1; i < compressed.length; i += 1) {\n k = compressed[i];\n if (dictionary[k]) {\n entry = dictionary[k];\n } else {\n if (k === dictSize) {\n entry = w + w.charAt(0);\n } else {\n return null;\n }\n }\n\n result += entry;\n\n // Add w+entry[0] to the dictionary.\n dictionary[dictSize++] = w + entry.charAt(0);\n\n w = entry;\n }\n return result;\n }\n}, // For Test Purposes\n comp = LZW.compress(\"TOBEORNOTTOBEORTOBEORNOT\"),\n decomp = LZW.decompress(comp);\ndocument.write(comp + '<br>' + decomp);\n","language":"JavaScript"},{"code":"'use strict';\n/**\n Namespace for LZW compression and decompression.\n Methods:\n LZW.compress(uncompressed)\n LZW.decompress(compressed)\n*/\nclass LZW\n{\n /**\n Perform the LZW compression\n uncompressed - String. The string on which to perform the compression.\n */\n static compress(uncompressed)\n {\n // Initialize dictionary\n let dictionary = {};\n for (let i = 0; i < 256; i++)\n {\n dictionary[String.fromCharCode(i)] = i;\n }\n\n let word = '';\n let result = [];\n let dictSize = 256;\n\n for (let i = 0, len = uncompressed.length; i < len; i++)\n {\n let curChar = uncompressed[i];\n let joinedWord = word + curChar;\n\n // Do not use dictionary[joinedWord] because javascript objects\n // will return values for myObject['toString']\n if (dictionary.hasOwnProperty(joinedWord))\n {\n word = joinedWord;\n }\n else\n {\n result.push(dictionary[word]);\n // Add wc to the dictionary.\n dictionary[joinedWord] = dictSize++;\n word = curChar;\n }\n }\n\n if (word !== '')\n {\n result.push(dictionary[word]);\n }\n\n return result;\n }\n\n /**\n Decompress LZW array generated by LZW.compress()\n compressed - Array. The array that holds LZW compressed data.\n */\n static decompress(compressed)\n {\n // Initialize Dictionary (inverse of compress)\n let dictionary = {};\n for (let i = 0; i < 256; i++)\n {\n dictionary[i] = String.fromCharCode(i);\n }\n\n let word = String.fromCharCode(compressed[0]);\n let result = word;\n let entry = '';\n let dictSize = 256;\n\n for (let i = 1, len = compressed.length; i < len; i++)\n {\n let curNumber = compressed[i];\n\n if (dictionary[curNumber] !== undefined)\n {\n entry = dictionary[curNumber];\n }\n else\n {\n if (curNumber === dictSize)\n {\n entry = word + word[0];\n }\n else\n {\n throw 'Error in processing';\n return null;\n }\n }\n\n result += entry;\n\n // Add word + entry[0] to dictionary\n dictionary[dictSize++] = word + entry[0];\n\n word = entry;\n }\n\n return result;\n }\n}\n\nlet comp = LZW.compress('TOBEORNOTTOBEORTOBEORNOT');\nlet decomp = LZW.decompress(comp);\n\nconsole.log(`${comp}\n${decomp}`);\n","language":"JavaScript"},{"code":"# LZW compression/decompression for strings\ndef lzw_compress:\n def decode: [.] | implode;\n # Build the dictionary:\n 256 as $dictSize\n | (reduce range(0; $dictSize) as $i ({}; .[ $i | decode ] = $i)) as $dictionary\n | reduce explode[] as $i\n ( [$dictionary, $dictSize, \"\", []]; # state: [dictionary, dictSize, w, result]\n .[0] as $dictionary\n | .[1] as $dictSize\n | .[2] as $w\n | ($i | decode) as $c\n | ($w + $c ) as $wc\n | if $dictionary[$wc] then .[2] = $wc\n else\n .[2] = $c # w = c\n | .[3] += [$dictionary[$w]] # result += dictionary[w]\n | .[0][$wc] = $dictSize # Add wc to the dictionary\n | .[1] += 1 # dictSize ++\n end\n )\n # Output the code for w unless w == \"\":\n | if .[2] == \"\" then .[3]\n else .[3] + [.[0][.[2]]]\n end\n;\n\ndef lzw_decompress:\n def decode: [.] | implode;\n # Build the dictionary - an array of strings\n 256 as $dictSize\n | (reduce range(0; $dictSize) as $i ([]; .[ $i ] = ($i|decode))) as $dictionary\n | (.[0]|decode) as $w\n | reduce .[1:][] as $k\n ( [ $dictionary, $dictSize, $w, $w]; # state: [dictionary, dictSize, w, result]\n .[0][$k] as $entry\n | (if $entry then $entry\n elif $k == .[1] then .[2] + .[2][0:1]\n else error(\"lzw_decompress: k=\\($k)\")\n end) as $entry\n | .[3] += $entry # result += entry\n | .[0][.[1]] = .[2] + $entry[0:1] # dictionary[dictSize] = w + entry.charAt(0);\n | .[1] += 1 # dictSize++\n | .[2] = $entry # w = entry\n ) | .[3]\n;\n","language":"Jq"},{"code":"\"TOBEORNOTTOBEORTOBEORNOT\" | lzw_compress| lzw_decompress\n","language":"Jq"},{"code":"function compressLZW(decompressed::String)\n dictsize = 256\n dict = Dict{String,Int}(string(Char(i)) => i for i in 0:dictsize)\n result = Vector{Int}(undef, 0)\n w = \"\"\n for c in decompressed\n wc = string(w, c)\n if haskey(dict, wc)\n w = wc\n else\n push!(result, dict[w])\n dict[wc] = dictsize\n dictsize += 1\n w = string(c)\n end\n end\n if !isempty(w) push!(result, dict[w]) end\n return result\nend\n\nfunction decompressLZW(compressed::Vector{Int})\n dictsize = 256\n dict = Dict{Int,String}(i => string('\\0' + i) for i in 0:dictsize)\n result = IOBuffer()\n w = string(Char(popfirst!(compressed)))\n write(result, w)\n for k in compressed\n if haskey(dict, k)\n entry = dict[k]\n elseif k == dictsize\n entry = string(w, w[1])\n else\n error(\"bad compressed k: $k\")\n end\n write(result, entry)\n dict[dictsize] = string(w, entry[1])\n dictsize += 1\n w = entry\n end\n return String(take!(result))\nend\n\noriginal = [\"0123456789\", \"TOBEORNOTTOBEORTOBEORNOT\", \"dudidudidudida\"]\ncompressed = compressLZW.(original)\ndecompressed = decompressLZW.(compressed)\n\nfor (word, comp, decomp) in zip(original, compressed, decompressed)\n comprate = (length(word) - length(comp)) / length(word) * 100\n println(\"Original: $word\\n-> Compressed: $comp (compr.rate: $(round(comprate, digits=2))%)\\n-> Decompressed: $decomp\")\nend\n","language":"Julia"},{"code":"// version 1.1.2\n\nobject Lzw {\n /** Compress a string to a list of output symbols. */\n fun compress(uncompressed: String): MutableList<Int> {\n // Build the dictionary.\n var dictSize = 256\n val dictionary = mutableMapOf<String, Int>()\n (0 until dictSize).forEach { dictionary.put(it.toChar().toString(), it)}\n\n var w = \"\"\n val result = mutableListOf<Int>()\n for (c in uncompressed) {\n val wc = w + c\n if (dictionary.containsKey(wc))\n w = wc\n else {\n result.add(dictionary[w]!!)\n // Add wc to the dictionary.\n dictionary.put(wc, dictSize++)\n w = c.toString()\n }\n }\n\n // Output the code for w\n if (!w.isEmpty()) result.add(dictionary[w]!!)\n return result\n }\n\n /** Decompress a list of output symbols to a string. */\n fun decompress(compressed: MutableList<Int>): String {\n // Build the dictionary.\n var dictSize = 256\n val dictionary = mutableMapOf<Int, String>()\n (0 until dictSize).forEach { dictionary.put(it, it.toChar().toString())}\n\n var w = compressed.removeAt(0).toChar().toString()\n val result = StringBuilder(w)\n for (k in compressed) {\n var entry: String\n if (dictionary.containsKey(k))\n entry = dictionary[k]!!\n else if (k == dictSize)\n entry = w + w[0]\n else\n throw IllegalArgumentException(\"Bad compressed k: $k\")\n result.append(entry)\n\n // Add w + entry[0] to the dictionary.\n dictionary.put(dictSize++, w + entry[0])\n w = entry\n }\n return result.toString()\n }\n}\n\nfun main(args: Array<String>) {\n val compressed = Lzw.compress(\"TOBEORNOTTOBEORTOBEORNOT\")\n println(compressed)\n val decompressed = Lzw.decompress(compressed)\n println(decompressed)\n}\n","language":"Kotlin"},{"code":" DIM LZW(1, 1)\n DIM JDlzw(1)\n DIM JDch$(1)\n LET maxBits = 20 ' maximum bit width of the dictionary: minimum=12; maximum=21\n LET resetDictionary = 1 ' flag to reset the dictionary when it gets full: 1=TRUE; 0=FALSE\n LET printDictionary = 0 ' output encoding and decoding dictionaries to files\n LET maxChunkSize = 2 ^ 14 ' maximum size of the data buffer\n LET dSize = 2 ^ maxBits ' maximum dictionary size\n LET JDext$ = \".lzw\" ' file extension used for created archives\n FILEDIALOG \"Select a file to test LZW...\", \"*.*\", inputName$\n IF inputName$ = \"\" THEN END\n DO ' get fullPath\\ and fileName.ext\n P = X\n X = INSTR(inputName$, \"\\\", (X + 1))\n LOOP UNTIL X = 0\n filePath$ = LEFT$(inputName$, P)\n fileName$ = MID$(inputName$, (P + 1))\n DO ' get fileName and .ext\n P = X\n X = INSTR(fileName$, \".\", (X + 1))\n LOOP UNTIL X = 0\n fileExt$ = MID$(fileName$, P)\n fileName$ = LEFT$(fileName$, (P - 1))\n\n GOSUB [lzwEncode]\n GOSUB [lzwDecode]\n\n END\n\n''''''''''''''''''''''''''''''''''''''''\n' Start LZW Encoder ''''''''''''''''''''\n[lzwEncode]\n REDIM LZW(dSize, 4)\n LET EMPTY=-1:PREFIX=0:BYTE=1:FIRST=2:LESS=3:MORE=4:bmxCorrect=1\n LET bitsRemain=0:remainIndex=0:tagCount=0:currentBitSize=8:fileTag$=\"\"\n FOR dNext = 0 TO 255 ' initialize dictionary for LZW\n ' LZW(dNext, PREFIX) = EMPTY ' prefix index of '<index>' <B>\n ' LZW(dNext, BYTE) = dNext ' byte value of <index> '<B>'\n LZW(dNext, FIRST) = EMPTY ' first index to use <index><B> as prefix\n ' LZW(dNext, LESS) = EMPTY ' lesser index of binary search tree for <B>\n ' LZW(dNext, MORE) = EMPTY ' greater index of binary search tree for <B>\n NEXT dNext\n OPEN inputName$ FOR INPUT AS #lzwIN\n IF LOF(#lzwIN) < 2 THEN\n CLOSE #lzwIN\n END\n END IF\n OPEN fileName$ + fileExt$ + JDext$ FOR OUTPUT AS #lzwOUT\n GOSUB [StartFileChunk]\n chnkPoint = 1\n IF maxBits < 12 THEN maxBits = 12\n IF maxBits > 21 THEN maxBits = 21\n settings = maxBits - 12 ' setting for dictionary size; 1st decimal +12\n IF resetDictionary THEN settings = settings + 100 ' setting for dictionary type; 2nd decimal even=static, odd=adaptive\n #lzwOUT, CHR$(settings); ' save settings as 1st byte of output\n orgIndex = ASC(LEFT$(fileChunk$, 1)) ' read 1st byte into <index>\n WHILE fileChunk$ <> \"\" ' while the buffer is not empty\n DO ' begin the main encoder loop\n chnkPoint = chnkPoint + 1\n savIndex = FIRST ' initialize the save-to index\n prvIndex = orgIndex ' initialize the previous index in search\n newByte = ASC(MID$(fileChunk$, chnkPoint, 1)) ' read <B>\n dSearch = LZW(orgIndex, FIRST) ' first search index for this <index> in the dictionary\n WHILE (dSearch > EMPTY) ' while <index> is present in the dictionary\n IF LZW(dSearch, BYTE) = newByte THEN EXIT WHILE ' if <index><B> is found\n IF newByte < LZW(dSearch, BYTE) THEN ' else if new <B> is less than <index><B>\n savIndex = LESS ' follow lesser binary tree\n ELSE\n savIndex = MORE ' else follow greater binary tree\n END IF\n prvIndex = dSearch ' set previous <index>\n dSearch = LZW(dSearch, savIndex) ' read next search <index> from binary tree\n WEND\n IF dSearch = EMPTY THEN ' if <index><B> was not found in the dictionary\n GOSUB [WriteIndex] ' write <index> to the output\n IF dNext < dSize THEN ' save <index><B> into the dictionary\n LZW(prvIndex, savIndex) = dNext\n LZW(dNext, PREFIX) = orgIndex\n LZW(dNext, BYTE) = newByte\n LZW(dNext, FIRST) = EMPTY\n LZW(dNext, LESS) = EMPTY\n LZW(dNext, MORE) = EMPTY\n IF dNext = (2 ^ currentBitSize) THEN currentBitSize = currentBitSize + 1\n dNext = dNext + 1\n ELSE ' else reset the dictionary... or maybe not\n IF resetDictionary THEN\n GOSUB [PrintEncode]\n REDIM LZW(dSize, 4)\n FOR dNext = 0 TO 255\n LZW(dNext, FIRST) = EMPTY\n NEXT dNext\n currentBitSize = 8\n bmxCorrect = 0\n END IF\n END IF\n orgIndex = newByte ' set <index> = <B>\n ELSE ' if <index><B> was found in the dictionary,\n orgIndex = dSearch ' then set <index> = <index><B>\n END IF\n LOOP WHILE chnkPoint < chunk ' loop until the chunk has been processed\n GOSUB [GetFileChunk] ' refill the buffer\n WEND ' loop until the buffer is empty\n GOSUB [WriteIndex]\n IF bitsRemain > 0 THEN #lzwOUT, CHR$(remainIndex);\n CLOSE #lzwOUT\n CLOSE #lzwIN\n IF bmxCorrect THEN ' correct the settings, if needed\n IF (currentBitSize < maxBits) OR resetDictionary THEN\n IF currentBitSize < 12 THEN currentBitSize = 12\n OPEN fileName$ + fileExt$ + JDext$ FOR BINARY AS #lzwOUT\n #lzwOUT, CHR$(currentBitSize - 12);\n CLOSE #lzwOUT\n END IF\n END IF\n GOSUB [PrintEncode]\n REDIM LZW(1, 1)\n RETURN\n\n[WriteIndex]\n X = orgIndex ' add remaining bits to input\n IF bitsRemain > 0 THEN X = remainIndex + (X * (2 ^ bitsRemain))\n bitsRemain = bitsRemain + currentBitSize ' add current bit size to output stack\n WHILE bitsRemain > 7 ' if 8 or more bits are to be written\n #lzwOUT, CHR$(X MOD 256); ' attatch lower 8 bits to output string\n X = INT(X / 256) ' shift input value down by 2^8\n bitsRemain = bitsRemain - 8 ' adjust counters\n WEND\n remainIndex = X ' retain trailing bits for next write\n RETURN\n\n' End LZW Encoder ''''''''''''''''''''''\n''''''''''''''''''''''''''''''''''''''''\n\n[StartFileChunk]\n sizeOfFile = LOF(#lzwIN) ' set EOF marker\n bytesRemaining = sizeOfFile ' set EOF counter\n chunk = maxChunkSize ' set max buffer size\n[GetFileChunk]\n fileChunk$ = \"\"\n IF bytesRemaining < 1 THEN RETURN\n IF chunk > bytesRemaining THEN chunk = bytesRemaining\n bytesRemaining = bytesRemaining - chunk\n fileChunk$ = INPUT$(#lzwIN, chunk)\n chnkPoint = 0\n RETURN\n\n''''''''''''''''''''''''''''''''''''''''\n' Start LZW Decoder ''''''''''''''''''''\n[lzwDecode]\n LET EMPTY=-1:bitsRemain=0:tagCount=0:fileTag$=\"\"\n OPEN fileName$ + fileExt$ + JDext$ FOR INPUT AS #lzwIN\n OPEN fileName$ + \".Copy\" + fileExt$ FOR OUTPUT AS #lzwOUT\n GOSUB [StartFileChunk]\n chnkPoint = 2\n settings = ASC(fileChunk$)\n maxBits = VAL(RIGHT$(STR$(settings), 1)) + 12\n dSize = 2 ^ maxBits\n IF settings > 99 THEN resetDictionary = 1\n GOSUB [ResetLZW]\n oldIndex = orgIndex\n WHILE fileChunk$ <> \"\"\n ' decode current index and write to file\n GOSUB [GetIndex]\n IF JDch$(orgIndex) = \"\" THEN\n tmpIndex = oldIndex\n tmp$ = JDch$(tmpIndex)\n WHILE JDlzw(tmpIndex) > EMPTY\n tmpIndex = JDlzw(tmpIndex)\n tmp$ = JDch$(tmpIndex) + tmp$\n WEND\n tmp$ = tmp$ + LEFT$(tmp$, 1)\n ELSE\n tmpIndex = orgIndex\n tmp$ = JDch$(tmpIndex)\n WHILE JDlzw(tmpIndex) > EMPTY\n tmpIndex = JDlzw(tmpIndex)\n tmp$ = JDch$(tmpIndex) + tmp$\n WEND\n END IF\n #lzwOUT, tmp$;\n ' add next dictionary entry or reset dictionary\n IF dNext < dSize THEN\n JDlzw(dNext) = oldIndex\n JDch$(dNext) = LEFT$(tmp$, 1)\n dNext = dNext + 1\n IF dNext = (2 ^ currentBitSize) THEN\n IF maxBits > currentBitSize THEN\n currentBitSize = currentBitSize + 1\n ELSE\n IF resetDictionary THEN\n GOSUB [PrintDecode]\n GOSUB [ResetLZW]\n END IF\n END IF\n END IF\n END IF\n oldIndex = orgIndex\n WEND\n CLOSE #lzwOUT\n CLOSE #lzwIN\n GOSUB [PrintDecode]\n REDIM JDlzw(1)\n REDIM JDch$(1)\n RETURN\n\n[GetIndex]\n byteCount = 0:orgIndex = 0\n bitsToGrab = currentBitSize - bitsRemain\n IF bitsRemain > 0 THEN\n orgIndex = lastByte\n byteCount = 1\n END IF\n WHILE bitsToGrab > 0\n lastByte = ASC(MID$(fileChunk$, chnkPoint, 1))\n orgIndex = orgIndex + (lastByte * (2 ^ (byteCount * 8)))\n IF chnkPoint = chunk THEN GOSUB [GetFileChunk]\n chnkPoint = chnkPoint + 1\n byteCount = byteCount + 1\n bitsToGrab = bitsToGrab - 8\n WEND\n IF bitsRemain > 0 THEN orgIndex = orgIndex / (2 ^ (8 - bitsRemain))\n orgIndex = orgIndex AND ((2 ^ currentBitSize) - 1)\n bitsRemain = bitsToGrab * (-1)\n RETURN\n\n[ResetLZW]\n REDIM JDlzw(dSize)\n REDIM JDch$(dSize)\n FOR dNext = 0 TO 255\n JDlzw(dNext) = EMPTY ' Prefix index\n JDch$(dNext) = CHR$(dNext) ' New byte value\n NEXT dNext\n currentBitSize = 8\n GOSUB [GetIndex]\n #lzwOUT, JDch$(orgIndex);\n currentBitSize = 9\n RETURN\n\n' End LZW Decoder ''''''''''''''''''''''\n''''''''''''''''''''''''''''''''''''''''\n\n''''''''''''''''''''''''''''''''''''''''\n[PrintEncode]\n IF printDictionary < 1 THEN RETURN\n OPEN \"Encode_\" + fileTag$ + fileName$ + \".txt\" FOR OUTPUT AS #dictOUT\n FOR X = 0 TO 255\n LZW(X, PREFIX) = EMPTY\n LZW(X, BYTE) = X\n NEXT X\n FOR X = dNext TO 0 STEP -1\n tmpIndex = X\n tmp$ = CHR$(LZW(tmpIndex, BYTE))\n WHILE LZW(tmpIndex, PREFIX) > EMPTY\n tmpIndex = LZW(tmpIndex, PREFIX)\n tmp$ = CHR$(LZW(tmpIndex, BYTE)) + tmp$\n WEND\n #dictOUT, X; \":\"; tmp$\n NEXT X\n CLOSE #dictOUT\n tagCount = tagCount + 1\n fileTag$ = STR$(tagCount) + \"_\"\n RETURN\n\n[PrintDecode]\n IF printDictionary < 1 THEN RETURN\n OPEN \"Decode_\" + fileTag$ + fileName$ + \".txt\" FOR OUTPUT AS #dictOUT\n FOR X = dNext TO 0 STEP -1\n tmpIndex = X\n tmp$ = JDch$(tmpIndex)\n WHILE JDlzw(tmpIndex) > EMPTY\n tmpIndex = JDlzw(tmpIndex)\n tmp$ = JDch$(tmpIndex) + tmp$\n WEND\n #dictOUT, X; \":\"; tmp$\n NEXT X\n CLOSE #dictOUT\n tagCount = tagCount + 1\n fileTag$ = STR$(tagCount) + \"_\"\n RETURN\n''''''''''''''''''''''''''''''''''''''''\n","language":"Liberty-BASIC"},{"code":"local function compress(uncompressed) -- string\n local dictionary, result, dictSize, w, c = {}, {}, 255, \"\"\n for i = 0, 255 do\n dictionary[string.char(i)] = i\n end\n for i = 1, #uncompressed do\n c = string.sub(uncompressed, i, i)\n if dictionary[w .. c] then\n w = w .. c\n else\n table.insert(result, dictionary[w])\n dictSize = dictSize + 1\n dictionary[w .. c] = dictSize\n w = c\n end\n end\n if w ~= \"\" then\n table.insert(result, dictionary[w])\n end\n return result\nend\n\nlocal function decompress(compressed) -- table\n local dictionary, dictSize, entry, w, k = {}, 256, \"\", string.char(compressed[1])\n local result = {w}\n for i = 0, 255 do\n dictionary[i] = string.char(i)\n end\n for i = 2, #compressed do\n k = compressed[i]\n if dictionary[k] then\n entry = dictionary[k]\n elseif k == dictSize then\n entry = w .. string.sub(w, 1, 1)\n else\n return nil, i\n end\n table.insert(result, entry)\n dictionary[dictSize] = w .. string.sub(entry, 1, 1)\n dictSize = dictSize + 1\n w = entry\n end\n return table.concat(result)\nend\n\nlocal example = \"TOBEORNOTTOBEORTOBEORNOT\"\nlocal com = compress(example)\nlocal dec = decompress(com)\nprint(table.concat(com, \", \"))\nprint(dec)\n","language":"Lua"},{"code":"Module BBCtrans {\n \\\\ LZW compression\n plaintext$=\"TOBEORNOTTOBEORTOBEORNOT\"\n Function encodeLZW$(i$) {\n Def long c, d, i, l, o$, w$\n DIM dict$(0 to 4095)\n FOR i = 0 TO 255 : dict$(i) = CHR$(i) : NEXT i\n l = i\n i = 1\n w$ = LEFT$(i$,1)\n REPEAT{\n d = 0\n REPEAT {\n c = d\n IF i > LEN(i$) THEN EXIT\n FOR d = 1 TO l-1\n IF w$ = dict$(d) THEN EXIT\n NEXT d\n IF d < l Then i += 1 : w$ += MID$(i$, i, 1)\n } UNTIL d >= l\n dict$(l) = w$ : l += 1 : w$ = RIGHT$(w$, 1)\n o$ += CHR$(c MOD 256) + CHR$(c DIV 256)\n } UNTIL i > LEN(i$)\n = o$\n }\n encodeLZW$ = encodeLZW$(plaintext$)\n FOR i = 1 TO LEN(encodeLZW$) STEP 2\n PRINT ASC(MID$(encodeLZW$,i)) + 256*ASC(MID$(encodeLZW$,i+1));\" \";\n NEXT i\n Print\n Function decodeLZW$(i$) {\n Def c, i, l, o$, t$, w$\n DIM dict$(0 to 4095)\n FOR i = 0 TO 255 : dict$(i) = CHR$(i) : NEXT i\n l = i\n c = ASC(i$) + 256*ASC(MID$(i$,2))\n w$ = dict$(c)\n o$ = w$\n IF LEN(i$) < 4 THEN = o$\n FOR i = 3 TO LEN(i$) STEP 2\n c = ASC(MID$(i$,i)) + 256*ASC(MID$(i$,i+1))\n IF c < l Then { t$ = dict$(c) } ELSE t$ = w$ + LEFT$(w$,1)\n o$ += t$\n dict$(l) = w$ + LEFT$(t$,1)\n l += 1\n w$ = t$\n NEXT i\n = o$\n }\n Print decodeLZW$(encodeLZW$)\n}\nBBCtrans\n","language":"M2000-Interpreter"},{"code":"Module FastM2000 {\n plaintext$=\"TOBEORNOTTOBEORTOBEORNOT\"\n Function encodeLZW$(i$) {\n Def long c, d, i, l, o$, w$\n Inventory dict\n For i = 0 to 255 {Append dict , Chr$(i):=i}\n l = i\n i = 1\n w$ = LEFT$(i$,1)\n REPEAT{\n d = 0\n Repeat {\n c = d\n IF i > Len(i$) Then Exit\n if exist(dict, w$) Then {\n d=eval(dict)\n } Else Append dict, w$:=l: Exit\n if d<l Then i += 1 : w$ += Mid$(i$, i, 1)\n } Until d >= l\n l += 1 : w$ = Right$(w$, 1)\n o$ += Chr$(c Mod 256) + Chr$(c div 256)\n } Until i > Len(i$)\n = o$\n }\n encodeLZW$ = encodeLZW$(plaintext$)\n Document Doc$\n For i = 1 to Len(encodeLZW$) STEP 2\n Doc$= Str$(Asc(Mid$(encodeLZW$,i)) + 256*Asc(Mid$(encodeLZW$,i+1)))\n Next i\n Doc$={\n }\n Function decodeLZW$(i$) {\n Def c, i, l, o$, t$, w$\n Inventory Dict\n For i = 0 to 255 {Append dict , i:=chr$(i)}\n l = i\n c = Asc(i$) + 256*Asc(Mid$(i$,2))\n w$ = dict$(c)\n o$ = w$\n IF Len(i$) < 4 Then = o$\n For i = 3 to Len(i$) STEP 2 {\n c = Asc(Mid$(i$,i)) + 256*Asc(Mid$(i$,i+1))\n IF c < l Then {\n t$ = dict$(c)\n } Else t$ = w$ + LEFT$(w$,1)\n o$ += t$\n Append dict, l:=w$ + LEFT$(t$,1)\n l += 1 : w$ = t$\n }\n = o$\n }\n Doc$=decodeLZW$(encodeLZW$)+{\n }\n Clipboard Doc$\n Report Doc$\n}\nFastM2000\n","language":"M2000-Interpreter"},{"code":"compress[uncompressed_] :=\n Module[{dictsize, dictionary, w, result, wc},\n dictsize = 256;\n dictionary = # -> # & /@ FromCharacterCode /@ Range@dictsize;\n w = \"\";\n result = {};\n Do[wc = w <> c;\n If[MemberQ[dictionary[[All, 1]], wc],\n w = wc,\n AppendTo[result, w /. dictionary];\n AppendTo[dictionary, wc -> dictsize];\n dictsize++;\n w = c],\n {c, Characters[uncompressed]}];\n AppendTo[result, w /. dictionary];\n result];\ndecompress::bc = \"Bad compressed `1`\";\ndecompress[compressed_] :=\n Module[{dictsize, dictionary, w, result, entry},\n dictsize = 256;\n dictionary = # -> # & /@ FromCharacterCode /@ Range@dictsize;\n w = result = compressed[[1]];\n Do[Which[MemberQ[dictionary[[All, 1]], k],\n entry = k /. dictionary,\n k == dictsize,\n entry = w <> StringTake[w, 1],\n True,\n Message[decompress::bc, k]];\n result = result <> entry;\n AppendTo[dictionary, dictsize -> w <> StringTake[entry, 1]];\n dictsize++;\n w = entry,\n {k, compressed[[2 ;;]]}];\n result];\n(*How to use:*)\ncompress[\"TOBEORNOTTOBEORTOBEORNOT\"]\ndecompress[%]\n","language":"Mathematica"},{"code":"import tables\n\nproc compress*(uncompressed: string): seq[int] =\n\n # Build the dictionary.\n var dictionary: Table[string, int]\n for i in 0..255: dictionary[$chr(i)] = i\n\n var w = \"\"\n for c in uncompressed:\n var wc = w & c\n if wc in dictionary:\n w = wc\n else:\n # Writes \"w\" to output.\n result.add dictionary[w]\n # \"wc\" is a new sequence: add it to the dictionary.\n dictionary[wc] = dictionary.len\n w = $c\n\n # Write remaining output if necessary.\n if w.len > 0: result.add dictionary[w]\n\n\nproc decompress*(compressed: var seq[int]): string =\n\n # Build the dictionary.\n var dictionary: Table[int, string]\n for i in 0..255: dictionary[i] = $chr(i)\n\n var w = dictionary[compressed[0]]\n compressed.delete(0)\n\n result = w\n for k in compressed:\n var entry: string\n if k in dictionary:\n entry = dictionary[k]\n elif k == dictionary.len:\n entry = w & w[0]\n else:\n raise newException(ValueError, \"Bad compressed k: \" & $k)\n result.add entry\n # New sequence: add it to the dictionary.\n dictionary[dictionary.len] = w & entry[0]\n w = entry\n\n\nwhen isMainModule:\n var compressed = compress(\"TOBEORNOTTOBEORTOBEORNOT\")\n echo compressed\n var decompressed = decompress(compressed)\n echo decompressed\n","language":"Nim"},{"code":"use Collection;\n\nclass LZW {\n function : Main(args : String[]) ~ Nil {\n compressed := Compress(\"TOBEORNOTTOBEORTOBEORNOT\");\n Show(compressed);\n decompressed := Decompress(compressed);\n decompressed->PrintLine();\n }\n\n function : native : Compress(uncompressed : String) ~ IntVector {\n # Build the dictionary.\n dictSize := 256;\n dictionary := StringMap->New();\n for (i := 0; i < 256; i+=1;) {\n key := \"\";\n key->Append(i->As(Char));\n dictionary->Insert(key, IntHolder->New(i));\n };\n\n w := \"\";\n result := IntVector->New();\n\n each (i : uncompressed) {\n c := uncompressed->Get(i);\n wc := String->New(w);\n wc->Append(c);\n if (dictionary->Has(wc)) {\n w := wc;\n }\n else {\n value := dictionary->Find(w)->As(IntHolder);\n result->AddBack(value->Get());\n # Add wc to the dictionary.\n dictionary->Insert(wc, IntHolder->New(dictSize));\n dictSize+=1;\n w := \"\";\n w->Append(c);\n };\n };\n\n # Output the code for w.\n if (w->Size() > 0) {\n value := dictionary->Find(w)->As(IntHolder);\n result->AddBack(value->Get());\n };\n\n return result;\n }\n\n function : Decompress(compressed : IntVector) ~ String {\n # Build the dictionary.\n dictSize := 256;\n dictionary := IntMap->New();\n for (i := 0; i < 256; i+=1;) {\n value := \"\";\n value->Append(i->As(Char));\n dictionary->Insert(i, value);\n };\n\n w := \"\";\n found := compressed->Remove(0);\n w->Append(found->As(Char));\n\n result := String->New(w);\n each (i : compressed) {\n k := compressed->Get(i);\n\n entry : String;\n if (dictionary->Has(k)) {\n entry := dictionary->Find(k);\n }\n else if (k = dictSize) {\n entry := String->New(w);\n entry->Append(w->Get(0));\n }\n else {\n return \"\";\n };\n result->Append(entry);\n\n # Add w+entry[0] to the dictionary.\n value := String->New(w);\n value->Append(entry->Get(0));\n dictionary->Insert(dictSize, value);\n dictSize+=1;\n\n w := entry;\n };\n\n return result;\n }\n\n function : Show(results : IntVector) ~ Nil {\n \"[\"->Print();\n each(i : results) {\n results->Get(i)->Print();\n if(i + 1 < results->Size()) {\n \", \"->Print();\n };\n };\n \"]\"->PrintLine();\n }\n}\n","language":"Objeck"},{"code":"#import <Foundation/Foundation.h>\n#import <stdio.h>\n\n@interface LZWCompressor : NSObject\n{\n @private\n NSMutableArray *iostream;\n NSMutableDictionary *dict;\n NSUInteger codemark;\n}\n\n-(instancetype) init;\n-(instancetype) initWithArray: (NSMutableArray *) stream;\n-(BOOL) compressData: (NSData *) string;\n-(void) setArray: (NSMutableArray *) stream;\n-(NSArray *) getArray;\n@end\n\n@implementation LZWCompressor : NSObject\n\n-(instancetype) init\n{\n self = [super init];\n if ( self )\n {\n iostream = nil;\n codemark = 256;\n dict = [[NSMutableDictionary alloc] initWithCapacity: 512];\n }\n return self;\n}\n\n-(instancetype) initWithArray: (NSMutableArray *) stream\n{\n self = [self init];\n if ( self )\n {\n [self setArray: stream];\n }\n return self;\n}\n\n-(void) setArray: (NSMutableArray *) stream\n{\n iostream = stream;\n}\n\n-(BOOL) compressData: (NSData *) string;\n{\n // prepare dict\n for(NSUInteger i=0; i < 256; i++)\n {\n unsigned char j = i;\n NSData *s = [NSData dataWithBytes: &j length: 1];\n dict[s] = @(i);\n }\n\n NSData *w = [NSData data];\n\n for(NSUInteger i=0; i < [string length]; i++)\n {\n NSMutableData *wc = [NSMutableData dataWithData: w];\n [wc appendData: [string subdataWithRange: NSMakeRange(i, 1)]];\n if ( dict[wc] != nil )\n {\n w = wc;\n } else {\n [iostream addObject: dict[w]];\n dict[wc] = @(codemark);\n codemark++;\n w = [string subdataWithRange: NSMakeRange(i, 1)];\n }\n }\n if ( [w length] != 0 )\n {\n [iostream addObject: dict[w]];\n }\n return YES;\n}\n\n-(NSArray *) getArray\n{\n return iostream;\n}\n\n@end\n","language":"Objective-C"},{"code":"NSString *text = @\"TOBEORNOTTOBEORTOBEORNOT\";\n\nint main()\n{\n @autoreleasepool {\n\n NSMutableArray *array = [[NSMutableArray alloc] init];\n LZWCompressor *lzw = [[LZWCompressor alloc]\n initWithArray: array ];\n if ( lzw )\n {\n [lzw compressData: [text dataUsingEncoding: NSUTF8StringEncoding]];\n for ( id obj in array )\n {\n printf(\"%u\\n\", [obj unsignedIntValue]);\n }\n }\n\n }\n return EXIT_SUCCESS;\n}\n","language":"Objective-C"},{"code":"#directory \"+extlib\" (* or maybe \"+site-lib/extlib/\" *)\n#load \"extLib.cma\"\nopen ExtString\n\n(** compress a string to a list of output symbols *)\nlet compress ~uncompressed =\n (* build the dictionary *)\n let dict_size = 256 in\n let dictionary = Hashtbl.create 397 in\n for i=0 to 255 do\n let str = String.make 1 (char_of_int i) in\n Hashtbl.add dictionary str i\n done;\n\n let f = (fun (w, dict_size, result) c ->\n let c = String.make 1 c in\n let wc = w ^ c in\n if Hashtbl.mem dictionary wc then\n (wc, dict_size, result)\n else\n begin\n (* add wc to the dictionary *)\n Hashtbl.add dictionary wc dict_size;\n let this = Hashtbl.find dictionary w in\n (c, dict_size + 1, this::result)\n end\n ) in\n let w, _, result =\n String.fold_left f (\"\", dict_size, []) uncompressed\n in\n\n (* output the code for w *)\n let result =\n if w = \"\"\n then result\n else (Hashtbl.find dictionary w) :: result\n in\n\n (List.rev result)\n;;\n\nexception ValueError of string\n\n(** decompress a list of output symbols to a string *)\nlet decompress ~compressed =\n (* build the dictionary *)\n let dict_size = 256 in\n let dictionary = Hashtbl.create 397 in\n for i=0 to pred dict_size do\n let str = String.make 1 (char_of_int i) in\n Hashtbl.add dictionary i str\n done;\n\n let w, compressed =\n match compressed with\n | hd::tl -> (String.make 1 (char_of_int hd)), tl\n | [] -> failwith \"empty input\"\n in\n\n let result = [w] in\n\n let result, _, _ =\n List.fold_left (fun (result, w, dict_size) k ->\n let entry =\n if Hashtbl.mem dictionary k then\n Hashtbl.find dictionary k\n else if k = Hashtbl.length dictionary then\n w ^ (String.make 1 w.[0])\n else\n raise(ValueError(Printf.sprintf \"Bad compressed k: %d\" k))\n in\n let result = entry :: result in\n\n (* add (w ^ entry.[0]) to the dictionary *)\n Hashtbl.add dictionary dict_size (w ^ (String.make 1 entry.[0]));\n (result, entry, dict_size + 1)\n ) (result, w, dict_size) compressed\n in\n (List.rev result)\n;;\n","language":"OCaml"},{"code":"val compress : uncompressed:string -> int list\nval decompress : compressed:int list -> string list\n","language":"OCaml"},{"code":"let greatest = List.fold_left max 0 ;;\n\n(** number of bits needed to encode the integer m *)\nlet n_bits m =\n let m = float m in\n let rec aux n =\n let max = (2. ** n) -. 1. in\n if max >= m then int_of_float n\n else aux (n +. 1.0)\n in\n aux 1.0\n;;\n\nlet write_compressed ~filename ~compressed =\n let nbits = n_bits(greatest compressed) in\n let oc = open_out filename in\n output_byte oc nbits;\n let ob = IO.output_bits(IO.output_channel oc) in\n List.iter (IO.write_bits ob nbits) compressed;\n IO.flush_bits ob;\n close_out oc;\n;;\n\nlet read_compressed ~filename =\n let ic = open_in filename in\n let nbits = input_byte ic in\n let ib = IO.input_bits(IO.input_channel ic) in\n let rec loop acc =\n try\n let code = IO.read_bits ib nbits in\n loop (code::acc)\n with _ -> List.rev acc\n in\n let compressed = loop [] in\n let result = decompress ~compressed in\n let buf = Buffer.create 2048 in\n List.iter (Buffer.add_string buf) result;\n (Buffer.contents buf)\n;;\n","language":"OCaml"},{"code":"(define (compress str)\n(let loop ((dc (fold (lambda (f x) ; dictionary (simplest, not optimized), with reversed codes\n (cons (list x) (cons x f)))\n '() (iota 256)))\n (w '()) ; output sequence (reversed)\n (s 256) ; maximal dictionary code value + 1\n (x '()) ; current sequence\n (r (str-iter str))); input stream\n (cond\n ((null? r)\n (reverse (cons (cadr (member x dc)) w)))\n ((pair? r)\n (let ((xy (cons (car r) x)))\n (if (member xy dc)\n (loop dc w s xy (cdr r))\n (loop (cons xy (cons s dc)) ; update dictionary with xy . s\n (cons (cadr (member x dc)) w) ; add code to output stream\n (+ s 1) ; increase code\n (list (car r)) ; new current sequence\n (cdr r))))) ; next input\n (else\n (loop dc w s x (r)))))\n)\n\n(print (compress \"TOBEORNOTTOBEORTOBEORNOT\")) ; => (84 79 66 69 79 82 78 79 84 256 258 260 265 259 261 263)\n","language":"Ol"},{"code":"(define (decompress str)\n(let loop ((dc (fold (lambda (f x) ; dictionary (simplest, not optimized), with reversed codes\n (cons x (cons (list x) f)))\n '() (iota 256)))\n (w '()) ; output sequence (reversed)\n (s 256) ; maximal dictionary code value + 1\n (x '()) ; current symbols sequence\n (r (str-iter str))); input stream\n (cond\n ((null? r)\n (reverse w))\n ((pair? r)\n (let*((y (cadr (member (car r) dc)))\n (xy (append y x)))\n (if (member xy dc)\n (loop dc (append y w) s xy (cdr r)) ; вряд ли такое будет...\n (loop (cons s (cons xy dc)) ; update dictionary with xy . s\n (append y w) ; add phrase to output stream\n (+ s 1)\n y ; new initial code\n (cdr r))))) ; next input\n (else\n (loop dc w s x (r))))))\n\n(print (runes->string\n (decompress (runes->string '(84 79 66 69 79 82 78 79 84 256 258 260 265 259 261 263)))))\n; => TOBEORNOTTOBEORTOBEEORNOT\n","language":"Ol"},{"code":"# Compress a string to a list of output symbols.\nsub compress {\n my $uncompressed = shift;\n\n # Build the dictionary.\n my $dict_size = 256;\n my %dictionary = map {chr $_ => chr $_} 0..$dict_size-1;\n\n my $w = \"\";\n my @result;\n foreach my $c (split '', $uncompressed) {\n my $wc = $w . $c;\n if (exists $dictionary{$wc}) {\n $w = $wc;\n } else {\n push @result, $dictionary{$w};\n # Add wc to the dictionary.\n $dictionary{$wc} = $dict_size;\n $dict_size++;\n $w = $c;\n }\n }\n\n # Output the code for w.\n if ($w) {\n push @result, $dictionary{$w};\n }\n return @result;\n}\n\n# Decompress a list of output ks to a string.\nsub decompress {\n my @compressed = @_;\n\n # Build the dictionary.\n my $dict_size = 256;\n my %dictionary = map {chr $_ => chr $_} 0..$dict_size-1;\n\n my $w = shift @compressed;\n my $result = $w;\n foreach my $k (@compressed) {\n my $entry;\n if (exists $dictionary{$k}) {\n $entry = $dictionary{$k};\n } elsif ($k == $dict_size) {\n $entry = $w . substr($w,0,1);\n } else {\n die \"Bad compressed k: $k\";\n }\n $result .= $entry;\n\n # Add w+entry[0] to the dictionary.\n $dictionary{$dict_size} = $w . substr($entry,0,1);\n $dict_size++;\n\n $w = $entry;\n }\n return $result;\n}\n\n# How to use:\nmy @compressed = compress('TOBEORNOTTOBEORTOBEORNOT');\nprint \"@compressed\\n\";\nmy $decompressed = decompress(@compressed);\nprint \"$decompressed\\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;\">compress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">uncompressed</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">dict</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">new_dict</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">result</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">dictSize</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">255</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">c</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">word</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;\">0</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">255</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">setd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"\"</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: #000000;\">dict</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;\">uncompressed</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">uncompressed</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: #7060A8;\">getd_index</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dict</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">word</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">c</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">result</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">getd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dict</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">dictSize</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #7060A8;\">setd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dictSize</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dict</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">word</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</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;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #008000;\">\"\"</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">result</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">getd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dict</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">destroy_dict</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dict</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">result</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;\">decompress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">compressed</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">dict</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">new_dict</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">dictSize</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">255</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ki</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">dent</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">result</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">word</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;\">0</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">255</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">setd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dict</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;\">compressed</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">compressed</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">ki</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">getd_index</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dict</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">ki</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">dent</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">getd_by_index</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ki</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dict</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">dictSize</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">dent</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #004600;\">NULL</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: #000000;\">result</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">dent</span>\n <span style=\"color: #7060A8;\">setd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dictSize</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">dent</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">dict</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">dictSize</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">word</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">dent</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">destroy_dict</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dict</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">result</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;\">example</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"TOBEORNOTTOBEORTOBEORNOT\"</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">com</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">compress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">example</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">com</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #004600;\">pp_IntCh</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">pp_Maxlen</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">90</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">decompress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">com</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"class LZW\n{\n function compress($unc) {\n $i;$c;$wc;\n $w = \"\";\n $dictionary = array();\n $result = array();\n $dictSize = 256;\n for ($i = 0; $i < 256; $i += 1) {\n $dictionary[chr($i)] = $i;\n }\n for ($i = 0; $i < strlen($unc); $i++) {\n $c = $unc[$i];\n $wc = $w.$c;\n if (array_key_exists($w.$c, $dictionary)) {\n $w = $w.$c;\n } else {\n array_push($result,$dictionary[$w]);\n $dictionary[$wc] = $dictSize++;\n $w = (string)$c;\n }\n }\n if ($w !== \"\") {\n array_push($result,$dictionary[$w]);\n }\n return implode(\",\",$result);\n }\n\n function decompress($com) {\n $com = explode(\",\",$com);\n $i;$w;$k;$result;\n $dictionary = array();\n $entry = \"\";\n $dictSize = 256;\n for ($i = 0; $i < 256; $i++) {\n $dictionary[$i] = chr($i);\n }\n $w = chr($com[0]);\n $result = $w;\n for ($i = 1; $i < count($com);$i++) {\n $k = $com[$i];\n if (isset($dictionary[$k])) {\n $entry = $dictionary[$k];\n } else {\n if ($k === $dictSize) {\n $entry = $w.$w[0];\n } else {\n return null;\n }\n }\n $result .= $entry;\n $dictionary[$dictSize++] = $w . $entry[0];\n $w = $entry;\n }\n return $result;\n }\n}\n\n//How to use\n$str = 'TOBEORNOTTOBEORTOBEORNOT';\n$lzw = new LZW();\n$com = $lzw->compress($str);\n$dec = $lzw->decompress($com);\necho $com . \"<br>\" . $dec;\n","language":"PHP"},{"code":"go =>\n S = \"TOBEORNOTTOBEORTOBEORNOT\",\n println(s=S),\n println(len=S.length),\n\n Compressed = compress(S),\n println(compressed=Compressed),\n println(len=Compressed.length),\n\n Uncompressed = uncompress(Compressed),\n println(uncompressed=Uncompressed),\n\n printf(\"compressed to %3.3f%%\\n\", 100*(Compressed.length / S.length)),\n\n if S = Uncompressed then\n println(\"Same!\")\n else\n println(\"Error: S != Uncompressed!\"),\n printf(\"S.length: %d Uncompressed.length: %d\\n\", S.length, Uncompressed.length),\n edit(S,Uncompressed,Distance,Diffs),\n println(distance=Distance),\n println(diffs=Diffs)\n end,\n nl.\n\ncompress(Uncompressed) = Compressed =>\n DictSize = 256,\n Dict = new_map([C=C : I in 1..DictSize-1, C=chr(I).to_string()]),\n W = \"\",\n Result = [],\n foreach(C in Uncompressed)\n C := C.to_string(),\n WC = W ++ C,\n if Dict.has_key(WC) then\n W := WC\n else\n Result := Result ++ [Dict.get(W)],\n Dict.put(WC, DictSize),\n DictSize := DictSize + 1,\n W := C\n end\n end,\n if W.length > 0 then\n Result := Result ++ [Dict.get(W)]\n end,\n Compressed = Result.\n\nuncompress(Compressed) = Uncompressed =>\n DictSize = 256,\n Dict = new_map([ C=C : I in 1..DictSize-1, C=chr(I).to_string()]),\n W = Compressed.first(),\n Compressed := Compressed.tail(),\n Result = W,\n\n Entry = \"\",\n foreach(K in Compressed)\n if Dict.has_key(K) then\n Entry := Dict.get(K)\n elseif K == DictSize then\n Entry := W ++ W[1].to_string()\n else\n printf(\"Bad compressed K: %w\\n\", K)\n end,\n Result := Result ++ Entry,\n Dict.put(DictSize,(W ++ Entry[1].to_string())),\n DictSize := DictSize + 1,\n W := Entry\n end,\n Uncompressed = Result.flatten().\n\n%\n% Computing the minimal editing distance of two given lists\n%\ntable(+,+,min,-)\nedit([],[],D,Diffs) => D=0, Diffs=[].\nedit([X|Xs],[X|Ys],D,Diffs) => % copy\n edit(Xs,Ys,D,Diffs).\nedit(Xs,[Y|Ys],D,Diffs) ?=> % insert\n edit(Xs,Ys,D1,Diffs1),\n D=D1+1,\n Diffs = [insert=Y,xPos=Xs.length,yPos=Ys.length|Diffs1].\nedit([X|Xs],Ys,D,Diffs) => % delete\n edit(Xs,Ys,D1,Diffs1),\n D=D1+1,\n Diffs = [[delete=X,xPos=Xs.length,yPos=Ys.length]|Diffs1].\n","language":"Picat"},{"code":"(de lzwCompress (Lst)\n (let (Codes 255 Dict)\n (balance 'Dict\n (make\n (for C Codes\n (link (cons (char C) C)) ) ) )\n (make\n (let W (pop 'Lst)\n (for C Lst\n (let WC (pack W C)\n (if (lup Dict WC)\n (setq W WC)\n (link (cdr (lup Dict W)))\n (idx 'Dict (cons WC (inc 'Codes)) T)\n (setq W C) ) ) )\n (and W (link (cdr (lup Dict W)))) ) ) ) )\n\n(de lzwDecompress (Lst)\n (let (Codes 255 Dict)\n (balance 'Dict\n (make\n (for C Codes\n (link (list C (char C))) ) ) )\n (make\n (let W NIL\n (for N Lst\n (let WC (if (lup Dict N) (cdr @) (cons (last W) W))\n (chain (reverse WC))\n (when W\n (idx 'Dict (cons (inc 'Codes) (cons (last WC) W)) T) )\n (setq W WC) ) ) ) ) ) )\n","language":"PicoLisp"},{"code":"*process source xref attributes or(!);\n lzwt: Proc Options(main);\n\n Dcl (LEFT,LENGTH,SUBSTR,TRANSLATE,TRIM,UNSPEC) Builtin;\n Dcl SYSPRINT Print;\n\n Dcl str Char(50) Var Init('TOBEORNOTTOBEORTOBEORNOT');\n Dcl compressed Char(80) Var;\n Dcl decompressed Char(80) Var;\n\n Dcl 1 dict(0:300),\n 2 key Char(5) Var,\n 2 inx Bin Fixed(16) Unsigned;\n Dcl dict_size Bin Fixed(31) Init(256);\n Dcl hi Bin Fixed(16) Unsigned Init(65535);\n\n Put Edit('str=',str)(Skip,a,a);\n compressed = compress(str);\n Put Edit(compressed)(Skip,a);\n decompressed = decompress(compressed);\n Put Edit('dec=',decompressed)(Skip,a,a);\n If decompressed=str Then\n Put Edit('decompression ok')(Skip,a);\n Else\n Put Edit('decompression not ok')(Skip,a);\n\n compress: Proc(s) Returns(Char(80) Var);\n Dcl s Char(*) Var;\n Dcl res Char(80) Var;\n Dcl i Bin Fixed(31);\n Dcl c Char(1);\n Dcl w Char(5) Var;\n Dcl wc Char(5) Var;\n dict.key='';\n Dcl ii Bin Fixed(8) Unsigned;\n Do i=0 To 255;\n ii=i;\n Unspec(c)=unspec(ii);\n dict.key(i)=c;\n dict.inx(i)=i;\n End;\n res='[';\n w='';\n Do i=1 To length(s);\n c=substr(s,i,1);\n wc=w!!c;\n If dicti(wc)^=hi Then Do;\n w=wc;\n End;\n Else Do;\n res=res!!trim(dicti(w))!!', ';\n Call dict_add(wc,dict_size);\n w=c;\n End;\n End;\n If w^='' Then\n res=res!!trim(dicti(w))!!', ';\n substr(res,length(res)-1,1)=']';\n Return(res);\n\n dicti: Proc(needle) Returns(Bin Fixed(31));\n Dcl needle Char(*) Var;\n Dcl i Bin Fixed(31);\n Do i=1 To dict_size;\n If dict.key(i)=needle Then\n Return(i);\n End;\n Return(hi);\n End;\n\n dict_add: Proc(needle,dict_size);\n Dcl needle Char(*) Var;\n Dcl dict_size Bin Fixed(31);\n dict.key(dict_size)=needle;\n dict.inx(dict_size)=dict_size;\n dict_size+=1;\n End;\n\n End;\n\n decompress: Proc(s) Returns(Char(80) Var);\n Dcl s Char(80) Var;\n Dcl ss Char(80) Var;\n Dcl words(50) Char(5) Var;\n Dcl wn Bin Fixed(31);\n Dcl ww Bin Fixed(31);\n Dcl c Char(1);\n Dcl entry Char(5) Var;\n Dcl w Char(5) Var;\n Dcl res Char(80) Var;\n ss=translate(s,' ','[],');\n Call mk_words(ss,words,wn);\n dict.key='';\n dict.inx=hi;\n Dcl i Bin Fixed(31);\n Dcl ii Bin Fixed(8) Unsigned;\n Dcl dict(0:300) Char(5) Var;\n Dcl dict_size Bin Fixed(31);\n Do i=0 To 255;\n ii=i;\n Unspec(c)=unspec(ii);\n dict(i)=c;\n End;\n dict_size=256;\n ww=words(1);\n w=dict(ww);\n res=w;\n Do i=2 To wn;\n ww=words(i);\n Select;\n When(dict(ww)^='')\n entry=dict(ww);\n When(ww=dict_size)\n entry=w!!substr(w,1,1);\n Otherwise\n Put Edit('Bad compressed k: ',ww)(Skip,a,a);\n End;\n res=res!!entry;\n dict(dict_size)=w!!substr(entry,1,1);\n dict_size+=1;\n w=entry;\n End;\n Return(res);\n End;\n\n mk_words: Proc(st,arr,arrn);\n Dcl st Char(*) Var;\n Dcl sv Char(80) Var;\n Dcl arr(*) Char(5) Var;\n Dcl arrn Bin fixed(31);\n Dcl elem Char(5) Var;\n arrn=0;\n sv=st!!' ';\n elem='';\n Do While(length(sv)>0);\n If left(sv,1)=' ' Then Do;\n If elem>'' Then Do;\n arrn+=1;\n arr(arrn)=elem;\n elem='';\n End;\n End;\n Else\n elem=elem!!left(sv,1);\n sv=substr(sv,2);\n End;\n End;\n Return;\n\n End;\n","language":"PL-I"},{"code":"Procedure compress(uncompressed.s, List result.u())\n ;Compress a string to a list of output symbols\n\n ;Build the dictionary.\n Protected dict_size = 255, i\n newmap dict.u()\n For i = 0 To 254\n dict(Chr(i + 1)) = i\n Next\n\n Protected w.s, wc.s, *c.Character = @uncompressed\n w = \"\"\n LastElement(result())\n While *c\\c <> #Null\n wc = w + Chr(*c\\c)\n If FindMapElement(dict(), wc)\n w = wc\n Else\n AddElement(result())\n result() = dict(w)\n ;Add wc to the dictionary\n dict(wc) = dict_size\n dict_size + 1 ;no check is performed for overfilling the dictionary.\n w = Chr(*c\\c)\n EndIf\n *c + 1\n Wend\n\n ;Output the code for w\n If w\n AddElement(result())\n result() = dict(w)\n EndIf\nEndProcedure\n\nProcedure.s decompress(List compressed.u())\n ;Decompress a list of encoded values to a string\n If ListSize(compressed()) = 0: ProcedureReturn \"\": EndIf\n\n ;Build the dictionary.\n Protected dict_size = 255, i\n\n Dim dict.s(255)\n For i = 1 To 255\n dict(i - 1) = Chr(i)\n Next\n\n Protected w.s, entry.s, result.s\n FirstElement(compressed())\n w = dict(compressed())\n result = w\n\n i = 0\n While NextElement(compressed())\n i + 1\n If compressed() < dict_size\n entry = dict(compressed())\n ElseIf i = dict_size\n entry = w + Left(w, 1)\n Else\n MessageRequester(\"Error\",\"Bad compression at [\" + Str(i) + \"]\")\n ProcedureReturn result;abort\n EndIf\n result + entry\n ;Add w + Left(entry, 1) to the dictionary\n If ArraySize(dict()) <= dict_size\n Redim dict(dict_size + 256)\n EndIf\n dict(dict_size) = w + Left(entry, 1)\n dict_size + 1 ;no check is performed for overfilling the dictionary.\n\n w = entry\n Wend\n ProcedureReturn result\nEndProcedure\n\nIf OpenConsole()\n ;How to use:\n\n Define initial.s, decompressed.s\n\n Print(\"Type something: \")\n initial = Input()\n NewList compressed.u()\n compress(initial, compressed())\n ForEach compressed()\n Print(Str(compressed()) + \" \")\n Next\n PrintN(\"\")\n\n decompressed = decompress(compressed())\n PrintN(decompressed)\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\")\n Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"def compress(uncompressed):\n \"\"\"Compress a string to a list of output symbols.\"\"\"\n\n # Build the dictionary.\n dict_size = 256\n dictionary = dict((chr(i), i) for i in range(dict_size))\n # in Python 3: dictionary = {chr(i): i for i in range(dict_size)}\n\n w = \"\"\n result = []\n for c in uncompressed:\n wc = w + c\n if wc in dictionary:\n w = wc\n else:\n result.append(dictionary[w])\n # Add wc to the dictionary.\n dictionary[wc] = dict_size\n dict_size += 1\n w = c\n\n # Output the code for w.\n if w:\n result.append(dictionary[w])\n return result\n\n\ndef decompress(compressed):\n \"\"\"Decompress a list of output ks to a string.\"\"\"\n from io import StringIO\n\n # Build the dictionary.\n dict_size = 256\n dictionary = dict((i, chr(i)) for i in range(dict_size))\n # in Python 3: dictionary = {i: chr(i) for i in range(dict_size)}\n\n # use StringIO, otherwise this becomes O(N^2)\n # due to string concatenation in a loop\n result = StringIO()\n w = chr(compressed.pop(0))\n result.write(w)\n for k in compressed:\n if k in dictionary:\n entry = dictionary[k]\n elif k == dict_size:\n entry = w + w[0]\n else:\n raise ValueError('Bad compressed k: %s' % k)\n result.write(entry)\n\n # Add w+entry[0] to the dictionary.\n dictionary[dict_size] = w + entry[0]\n dict_size += 1\n\n w = entry\n return result.getvalue()\n\n\n# How to use:\ncompressed = compress('TOBEORNOTTOBEORTOBEORNOT')\nprint (compressed)\ndecompressed = decompress(compressed)\nprint (decompressed)\n","language":"Python"},{"code":"#lang racket\n; utilities\n(define-syntax def (make-rename-transformer #'define))\n(define (dict-ref d w) (hash-ref d w #f))\n(define (append-char w c) (string-append w (string c)))\n(define (append-first w s) (append-char w (string-ref s 0)))\n\n;; Compress a string with LZW\n(define (compress uncompressed)\n (def d (make-hash))\n (def (dict-add d w) (hash-set! d w (hash-count d)))\n ; build initial dictionary\n (for ([i (in-range 256)])\n (def s (string (integer->char i)))\n (hash-set! d s s))\n ; compress the string\n (def result '())\n (def (emit! i) (set! result (cons i result)))\n (def w \"\")\n (for ([c uncompressed])\n (define wc (append-char w c))\n (cond\n [(dict-ref d wc) (set! w wc)]\n [else (emit! (dict-ref d w))\n (dict-add d wc)\n (set! w (string c))]))\n (emit! (dict-ref d w))\n (reverse result))\n\n;; Decompress a LZW compressed string\n(define (decompress compressed)\n (def d (make-hash))\n (def (dict-add! w) (hash-set! d (hash-count d) w))\n ; build initial dictionary\n (for ([i (in-range 256)])\n (def s (string (integer->char i)))\n (hash-set! d s s))\n ; decompress the list\n (def w (first compressed))\n (apply string-append\n w\n (for/list ([k (rest compressed)])\n (def entry\n (or (dict-ref d k)\n (if (eqv? k (hash-count d))\n (append-first w w)\n (error 'lzq-decompress \"faulty input\"))))\n (dict-add! (append-first w entry))\n (set! w entry)\n entry)))\n\n(def uncompressed \"TOBEORNOTTOBEORTOBEORNOT\")\n(displayln uncompressed)\n(def compressed (compress uncompressed))\n(displayln compressed)\n(def decompressed (decompress compressed))\n(displayln decompressed)\n","language":"Racket"},{"code":"# 20200421 Updated Raku programming solution ; add unicode support\n\nsub compress(Str $uncompressed --> Seq) {\n my $dict-size = 256;\n my %dictionary = (.chr => .chr for ^$dict-size);\n\n my $w = \"\";\n gather {\n for $uncompressed.encode('utf8').list.chrs.comb -> $c {\n my $wc = $w ~ $c;\n if %dictionary{$wc}:exists { $w = $wc }\n else {\n take %dictionary{$w};\n %dictionary{$wc} = +%dictionary;\n $w = $c;\n }\n }\n\n take %dictionary{$w} if $w.chars;\n }\n}\n\nsub decompress(@compressed --> Str) {\n my $dict-size = 256;\n my %dictionary = (.chr => .chr for ^$dict-size);\n\n my $w = shift @compressed;\n ( Blob.new: flat ( gather {\n take $w;\n for @compressed -> $k {\n my $entry;\n if %dictionary{$k}:exists { take $entry = %dictionary{$k} }\n elsif $k == $dict-size { take $entry = $w ~ $w.substr(0,1) }\n else { die \"Bad compressed k: $k\" }\n\n %dictionary{$dict-size++} = $w ~ $entry.substr(0,1);\n $w = $entry;\n }\n } )».ords ).decode('utf-8')\n}\n\nsay my @compressed = compress('TOBEORNOTTOBEORTOBEORNOT');\nsay decompress(@compressed);\n\n@compressed = compress('こんにちは𝒳𝒴𝒵こんにちは𝒳𝒴𝒵こんにちは𝒳𝒴𝒵');\nsay decompress(@compressed);\n","language":"Raku"},{"code":"/* REXX ---------------------------------------------------------------\n* 20.07.2014 Walter Pachl translated from Java\n* 21.07.2014 WP allow for blanks in the string\n*--------------------------------------------------------------------*/\nParse Arg str\ndefault=\"TOBEORNOTTOBEORTOBEORNOT\"\nIf str='' Then\n str=default\n/* str=space(str,0) */\nSay 'str='str\ncompressed = compress(str)\nSay compressed\nIf str=default Then Do\n cx='[84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263]'\n If cx==compressed Then Say 'compression ok'\n End\ndecompressed = decompress(compressed)\nSay 'dec='decompressed\nIf decompressed=str Then Say 'decompression ok'\nExit\n\ncompress: Procedure\nParse Arg uncompressed\ndict.=''\nDo i=0 To 255\n z=d2c(i)\n d.i=z\n dict.z=i\n End\ndict_size=256\nres='['\nw=''\nDo i=1 To length(uncompressed)\n c=substr(uncompressed,i,1)\n wc=w||c\n If dict.wc<>'' Then\n w=wc\n Else Do\n res=res||dict.w', '\n dict.wc=dict_size\n dict_size=dict_size+1\n w=c\n End\n End\nIf w<>'' Then\n res=res||dict.w', '\nReturn left(res,length(res)-2)']'\n\ndecompress: Procedure\nParse Arg compressed\ncompressed=space(translate(compressed,'','[],'))\nd.=''\nDo i=0 To 255\n z=d2c(i)\n d.i=z\n End\ndict_size=256\nParse Var compressed w compressed\nres=d.w\nw=d.w\nDo i=1 To words(compressed)\n k=word(compressed,i)\n Select\n When d.k<>'' | d.k==' ' then /* allow for blank */\n entry=d.k\n When k=dict_size Then\n entry=w||substr(w,1,1)\n Otherwise\n Say \"Bad compressed k: \" k\n End\n res=res||entry\n d.dict_size=w||substr(entry,1,1)\n dict_size=dict_size+1\n w=entry\n End\nReturn res\n","language":"REXX"},{"code":"/*REXX program compresses text using the LZW (Lempel─Ziv─Welch), and reconstitutes it.*/\n$$$= '\"There is nothing permanent except change.\" ─── Heraclitus [540 ── 475 BCE]'\nparse arg text; if text='' then text= $$$ /*get an optional argument from the CL.*/\n say 'original text=' text /* [↑] Not specified? Then use default*/\ncypher= LZWc(text) /*compress text using the LZW algorithm*/\n say 'reconstituted=' LZWd(cypher) /*display the reconstituted string. */\nsay; say ' LZW integers=' cypher /* \" \" LZW integers used. */\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nLZWi: arg i,@.; #=256; do j=0 for #; _=d2c(j); if i then @.j=_; else @._=j; end; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nLZWc: procedure; parse arg y,,$; call LZWi 0; w= /*LZW compress.*/\n do k=1 for length(y)+1; z= w || substr(y, k, 1)\n if @.z=='' then do; $= $ @.w; @.z= #; #= # + 1; w= substr(y, k, 1); end\n else w= z /*#: the dictionary size.*/\n end /*k*/; return substr($, 2) /*elide a leading blank. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nLZWd: procedure; parse arg x y; call LZWi 1; $= @.x; w= $ /*LZW decompress.*/\n do k=1 for words(y); z= word(y, k)\n if @.z\\=='' | @.k==\" \" then ?= @.z\n else if z==# then ?= w || left(w, 1)\n $= $ || ?\n @.#= w || left(?, 1); w= ?; #= # + 1 /*bump dict. size*/\n end /*k*/; return $\n","language":"REXX"},{"code":"# Project : LZW compression\n\nplaintext = \"TOBEORNOTTOBEORTOBEORNOT\"\nresult = []\nencode = encodelzw(plaintext)\nfor i = 1 to len(encode) step 2\n add(result,ascii(substr(encode,i,1)) + 256*ascii(substr(encode,i+1,1)))\nnext\nshowarray(result)\nsee decodelzw(encode)\n\nfunc encodelzw(text)\n o = \"\"\n dict = list(4096)\n for i = 1 to 255\n dict[i] = char(i)\n next\n l = i\n i = 1\n w = left(text,1)\n while i < len(text)\n d = 0\n while d < l\n c = d\n if i > len(text)\n exit\n ok\n for d = 1 to l\n if w = dict[d]\n exit\n ok\n next\n if d < l\n i = i + 1\n w = w + substr(text,i,1)\n ok\n end\n dict[l] = w\n l = l + 1\n w = right(w,1)\n o = o + char(c % 256) + char(floor(c / 256))\n end\n return o\n\nfunc decodelzw(text)\n o = \"\"\n dict = list(4096)\n for i = 1 to 255\n dict[i] = char(i)\n next\n l = i\n c = ascii(left(text,1)) + 256*ascii(substr(text,2,1))\n w = dict[c]\n o = w\n if len(text) < 4\n return o\n ok\n for i = 3 to len(text) step 2\n c = ascii(substr(text,i,1)) + 256*ascii(substr(text,i+1,1))\n if c < l\n t = dict[c]\n else\n t = w + left(w,1)\n ok\n o = o + t\n dict[l] = w + left(t,1)\n l = l + 1\n w = t\n next\n return o\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 + nl\n","language":"Ring"},{"code":"# Compress a string to a list of output symbols.\ndef compress(uncompressed)\n # Build the dictionary.\n dict_size = 256\n dictionary = Hash[ Array.new(dict_size) {|i| [i.chr, i.chr]} ]\n\n w = \"\"\n result = []\n for c in uncompressed.split('')\n wc = w + c\n if dictionary.has_key?(wc)\n w = wc\n else\n result << dictionary[w]\n # Add wc to the dictionary.\n dictionary[wc] = dict_size\n dict_size += 1\n w = c\n end\n end\n\n # Output the code for w.\n result << dictionary[w] unless w.empty?\n result\nend\n\n# Decompress a list of output ks to a string.\ndef decompress(compressed)\n # Build the dictionary.\n dict_size = 256\n dictionary = Hash[ Array.new(dict_size) {|i| [i.chr, i.chr]} ]\n\n w = result = compressed.shift\n for k in compressed\n if dictionary.has_key?(k)\n entry = dictionary[k]\n elsif k == dict_size\n entry = w + w[0,1]\n else\n raise 'Bad compressed k: %s' % k\n end\n result += entry\n\n # Add w+entry[0] to the dictionary.\n dictionary[dict_size] = w + entry[0,1]\n dict_size += 1\n\n w = entry\n end\n result\nend\n\n# How to use:\ncompressed = compress('TOBEORNOTTOBEORTOBEORNOT')\np compressed\ndecompressed = decompress(compressed)\nputs decompressed\n","language":"Ruby"},{"code":"use std::collections::HashMap;\n\nfn compress(data: &[u8]) -> Vec<u32> {\n // Build initial dictionary.\n let mut dictionary: HashMap<Vec<u8>, u32> = (0u32..=255)\n .map(|i| (vec![i as u8], i))\n .collect();\n\n let mut w = Vec::new();\n let mut compressed = Vec::new();\n\n for &b in data {\n let mut wc = w.clone();\n wc.push(b);\n\n if dictionary.contains_key(&wc) {\n w = wc;\n } else {\n // Write w to output.\n compressed.push(dictionary[&w]);\n\n // wc is a new sequence; add it to the dictionary.\n dictionary.insert(wc, dictionary.len() as u32);\n w.clear();\n w.push(b);\n }\n }\n\n // Write remaining output if necessary.\n if !w.is_empty() {\n compressed.push(dictionary[&w]);\n }\n\n compressed\n}\n\nfn decompress(mut data: &[u32]) -> Vec<u8> {\n // Build the dictionary.\n let mut dictionary: HashMap::<u32, Vec<u8>> = (0u32..=255)\n .map(|i| (i, vec![i as u8]))\n .collect();\n\n let mut w = dictionary[&data[0]].clone();\n data = &data[1..];\n let mut decompressed = w.clone();\n\n for &k in data {\n let entry = if dictionary.contains_key(&k) {\n dictionary[&k].clone()\n } else if k == dictionary.len() as u32 {\n let mut entry = w.clone();\n entry.push(w[0]);\n entry\n } else {\n panic!(\"Invalid dictionary!\");\n };\n\n decompressed.extend_from_slice(&entry);\n\n // New sequence; add it to the dictionary.\n w.push(entry[0]);\n dictionary.insert(dictionary.len() as u32, w);\n\n w = entry;\n }\n\n decompressed\n}\n\nfn main() {\n let compressed = compress(\"TOBEORNOTTOBEORTOBEORNOT\".as_bytes());\n println!(\"{:?}\", compressed);\n\n let decompressed = decompress(&compressed);\n let decompressed = String::from_utf8(decompressed).unwrap();\n println!(\"{}\", decompressed);\n}\n","language":"Rust"},{"code":"def compress(tc:String) = {\n //initial dictionary\n val startDict = (1 to 255).map(a=>(\"\"+a.toChar,a)).toMap\n val (fullDict, result, remain) = tc.foldLeft ((startDict, List[Int](), \"\")) {\n case ((dict,res,leftOver),nextChar) =>\n if (dict.contains(leftOver + nextChar)) // current substring already in dict\n (dict, res, leftOver+nextChar)\n else if (dict.size < 4096) // add to dictionary\n (dict + ((leftOver+nextChar, dict.size+1)), dict(leftOver) :: res, \"\"+nextChar)\n else // dictionary is full\n (dict, dict(leftOver) :: res, \"\"+nextChar)\n }\n if (remain.isEmpty) result.reverse else (fullDict(remain) :: result).reverse\n}\n\ndef decompress(ns: List[Int]): String = {\n val startDict = (1 to 255).map(a=>(a,\"\"+a.toChar)).toMap\n val (_, result, _) =\n ns.foldLeft[(Map[Int, String], List[String], Option[(Int, String)])]((startDict, Nil, None)) {\n case ((dict, result, conjecture), n) => {\n dict.get(n) match {\n case Some(output) => {\n val (newDict, newCode) = conjecture match {\n case Some((code, prefix)) => ((dict + (code -> (prefix + output.head))), code + 1)\n case None => (dict, dict.size + 1)\n }\n (newDict, output :: result, Some(newCode -> output))\n }\n case None => {\n // conjecture being None would be an encoding error\n val (code, prefix) = conjecture.get\n val output = prefix + prefix.head\n (dict + (code -> output), output :: result, Some(code + 1 -> output))\n }\n }\n }\n }\n result.reverse.mkString(\"\")\n}\n// test\nval text = \"TOBEORNOTTOBEORTOBEORNOT\"\nval compressed = compress(text)\nprintln(compressed)\nval result = decompress(compressed)\nprintln(result)\n","language":"Scala"},{"code":"; Get the list reference number for a member or #f if not found\n(define (member-string-ref m l)\n (define r #f)\n (let loop ((i 0))\n (if (< i (length l))\n (if (not (string=? (list-ref l i) m))\n (loop (+ i 1))\n (set! r i))))\n r)\n\n;; Compress a string with LZW\n(define (lzw-compress uncompressed)\n (define dictionary '())\n (define n 0)\n (define result '())\n (set! uncompressed (string->list uncompressed))\n\n ;; Setup Dictionary\n (let dict-setup ((c 0))\n (if (> 256 c)\n (begin\n (set! dictionary (append dictionary\n (list (string (integer->char c)))))\n (set! n (+ n 1))\n (dict-setup (+ c 1)))))\n\n ;; Compress the string\n (let compress ((w \"\") (ci 0))\n (define c (string (list-ref uncompressed ci)))\n (define wc \"\")\n (set! wc (string-append w c))\n (if (member-string-ref wc dictionary)\n (set! w wc)\n (begin\n (set! result (append result\n (list (member-string-ref w dictionary))))\n (set! dictionary (append dictionary (list wc)))\n (set! n (+ n 1))\n (set! w c)))\n (if (eqv? ci (- (length uncompressed) 1))\n (set! result (append result\n (list (member-string-ref w dictionary))))\n (compress w (+ ci 1))))\n result)\n\n;; Decompress a LZW compressed string (input should be a list of integers)\n(define (lzw-decompress compressed)\n (define dictionary '())\n (define n 0)\n (define result \"\")\n\n ;; Setup Dictionary\n (let dict-setup ((c 0))\n (if (> 256 c)\n (begin\n (set! dictionary (append dictionary\n (list (string (integer->char c)))))\n (set! n (+ n 1))\n (dict-setup (+ c 1)))))\n\n ;; Decompress the list\n (let decompress ((k (list-ref compressed 0)) (ci 0))\n (define kn #f)\n ;; Add to dictionary\n (if (> (length compressed) (+ ci 1))\n (begin\n (set! kn (list-ref compressed (+ ci 1)))\n (if (< kn (length dictionary))\n (set! dictionary\n (append dictionary\n (list (string-append\n (list-ref dictionary k)\n (string (string-ref (list-ref dictionary kn) 0)))))))))\n\n ;; Build the resulting string\n (set! result (string-append result (list-ref dictionary k)))\n\n (if (not (eqv? ci (- (length compressed) 1)))\n (decompress kn (+ ci 1))))\n result)\n\n(define compressed (lzw-compress \"TOBEORNOTTOBEORTOBEORNOT\"))\n(display compressed) (newline)\n(define decompressed (lzw-decompress compressed))\n(display decompressed) (newline)\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n\nconst func string: lzwCompress (in string: uncompressed) is func\n result\n var string: compressed is \"\";\n local\n var char: ch is ' ';\n var hash [string] char: mydict is (hash [string] char).value;\n var string: buffer is \"\";\n var string: xstr is \"\";\n begin\n for ch range chr(0) to chr(255) do\n mydict @:= [str(ch)] ch;\n end for;\n for ch range uncompressed do\n xstr := buffer & str(ch);\n if xstr in mydict then\n buffer &:= str(ch)\n else\n compressed &:= str(mydict[buffer]);\n mydict @:= [xstr] chr(length(mydict));\n buffer := str(ch);\n end if;\n end for;\n if buffer <> \"\" then\n compressed &:= str(mydict[buffer]);\n end if;\n end func;\n\nconst func string: lzwDecompress (in string: compressed) is func\n result\n var string: uncompressed is \"\";\n local\n var char: ch is ' ';\n var hash [char] string: mydict is (hash [char] string).value;\n var string: buffer is \"\";\n var string: current is \"\";\n var string: chain is \"\";\n begin\n for ch range chr(0) to chr(255) do\n mydict @:= [ch] str(ch);\n end for;\n for ch range compressed do\n if buffer = \"\" then\n buffer := mydict[ch];\n uncompressed &:= buffer;\n elsif ch <= chr(255) then\n current := mydict[ch];\n uncompressed &:= current;\n chain := buffer & current;\n mydict @:= [chr(length(mydict))] chain;\n buffer := current;\n else\n if ch in mydict then\n chain := mydict[ch];\n else\n chain := buffer & str(buffer[1]);\n end if;\n uncompressed &:= chain;\n mydict @:= [chr(length(mydict))] buffer & str(chain[1]);\n buffer := chain;\n end if;\n end for;\n end func;\n\nconst proc: main is func\n local\n var string: compressed is \"\";\n var string: uncompressed is \"\";\n begin\n compressed := lzwCompress(\"TOBEORNOTTOBEORTOBEORNOT\");\n writeln(literal(compressed));\n uncompressed := lzwDecompress(compressed);\n writeln(uncompressed);\n end func;\n","language":"Seed7"},{"code":"# Compress a string to a list of output symbols.\nfunc compress(String uncompressed) -> Array {\n\n # Build the dictionary.\n var dict_size = 256\n var dictionary = Hash()\n\n for i in range(dict_size) {\n dictionary{i.chr} = i.chr\n }\n\n var w = ''\n var result = []\n uncompressed.each { |c|\n var wc = w+c\n if (dictionary.exists(wc)) {\n w = wc\n } else {\n result << dictionary{w}\n # Add wc to the dictionary.\n dictionary{wc} = dict_size\n dict_size++\n w = c\n }\n }\n\n # Output the code for w.\n if (w != '') {\n result << dictionary{w}\n }\n\n return result\n}\n\n# Decompress a list of output ks to a string.\nfunc decompress(Array compressed) -> String {\n\n # Build the dictionary.\n var dict_size = 256\n var dictionary = Hash()\n\n for i in range(dict_size) {\n dictionary{i.chr} = i.chr\n }\n\n var w = compressed.shift\n var result = w\n compressed.each { |k|\n var entry = nil\n if (dictionary.exists(k)) {\n entry = dictionary{k}\n } elsif (k == dict_size) {\n entry = w+w.first\n } else {\n die \"Bad compressed k: #{k}\"\n }\n result += entry\n\n # Add w+entry[0] to the dictionary.\n dictionary{dict_size} = w+entry.first\n dict_size++\n\n w = entry\n }\n return result\n}\n\n# How to use:\nvar compressed = compress('TOBEORNOTTOBEORTOBEORNOT')\nsay compressed.join(' ')\nvar decompressed = decompress(compressed)\nsay decompressed\n","language":"Sidef"},{"code":"class LZW {\n class func compress(_ uncompressed:String) -> [Int] {\n var dict = [String : Int]()\n\n for i in 0 ..< 256 {\n let s = String(Unicode.Scalar(UInt8(i)))\n dict[s] = i\n }\n\n var dictSize = 256\n var w = \"\"\n var result = [Int]()\n for c in uncompressed {\n let wc = w + String(c)\n if dict[wc] != nil {\n w = wc\n } else {\n result.append(dict[w]!)\n dict[wc] = dictSize\n dictSize += 1\n w = String(c)\n }\n }\n\n if w != \"\" {\n result.append(dict[w]!)\n }\n return result\n }\n\n class func decompress(_ compressed:[Int]) -> String? {\n var dict = [Int : String]()\n\n for i in 0 ..< 256 {\n dict[i] = String(Unicode.Scalar(UInt8(i)))\n }\n\n var dictSize = 256\n var w = String(Unicode.Scalar(UInt8(compressed[0])))\n var result = w\n for k in compressed[1 ..< compressed.count] {\n let entry : String\n if let x = dict[k] {\n entry = x\n } else if k == dictSize {\n entry = w + String(w[w.startIndex])\n } else {\n return nil\n }\n\n result += entry\n dict[dictSize] = w + String(entry[entry.startIndex])\n dictSize += 1\n w = entry\n }\n return result\n }\n}\n\nlet comp = LZW.compress(\"TOBEORNOTTOBEORTOBEORNOT\")\nprint(comp)\n\nif let decomp = LZW.decompress(comp) {\n print(decomp)\n}\n","language":"Swift"},{"code":"namespace eval LZW {\n variable char2int\n variable chars\n for {set i 0} {$i < 256} {incr i} {\n set char [binary format c $i]\n set char2int($char) $i\n lappend chars $char\n }\n}\n\nproc LZW::encode {data} {\n variable char2int\n array set dict [array get char2int]\n\n set w \"\"\n set result [list]\n\n foreach c [split $data \"\"] {\n set wc $w$c\n if {[info exists dict($wc)]} {\n set w $wc\n } else {\n lappend result $dict($w)\n set dict($wc) [array size dict]\n set w $c\n }\n }\n lappend result $dict($w)\n}\n\nproc LZW::decode {cdata} {\n variable chars\n set dict $chars\n\n set k [lindex $cdata 0]\n set w [lindex $dict $k]\n set result $w\n\n foreach k [lrange $cdata 1 end] {\n set currSizeDict [llength $dict]\n if {$k < $currSizeDict} {\n set entry [lindex $dict $k]\n } elseif {$k == $currSizeDict} {\n set entry $w[string index $w 0]\n } else {\n error \"invalid code ($k) in ($cdata)\"\n }\n append result $entry\n lappend dict $w[string index $entry 0]\n set w $entry\n }\n return $result\n}\n\nset s TOBEORNOTTOBEORTOBEORNOT#\nset e [LZW::encode $s] ;# ==> 84 79 66 69 79 82 78 79 84 256 258 260 265 259 261 263 35\nset d [LZW::decode $e] ;# ==> TOBEORNOTTOBEORTOBEORNOT#\n\n# or\nif {$s eq [LZW::decode [LZW::encode $s]]} then {puts success} else {puts fail} ;# ==> success\n","language":"Tcl"},{"code":"Option Explicit\nConst numchars=127 'plain ASCII\n\nFunction LZWCompress(si)\n Dim oDict, intMaxCode, i,z,ii,ss,strCurrent,strNext,j\n Set oDict = CreateObject(\"Scripting.Dictionary\")\n ReDim a(Len(si))\n\n intMaxCode = numchars\n For i = 0 To numchars\n oDict.Add Chr(i), i\n Next\n 'strCurrent = ofread.ReadText(1)\n strCurrent = Left(si,1)\n j=0\n For ii=2 To Len(si)\n strNext = Mid(si,ii,1)\n ss=strCurrent & strNext\n If oDict.Exists(ss) Then\n strCurrent = ss\n Else\n a(j)=oDict.Item(strCurrent) :j=j+1\n intMaxCode = intMaxCode + 1\n oDict.Add ss, intMaxCode\n strCurrent = strNext\n End If\n Next\n a(j)=oDict.Item(strCurrent)\n ReDim preserve a(j)\n LZWCompress=a\n Set oDict = Nothing\nEnd Function\n\nFunction lzwUncompress(sc)\n Dim intNext, intCurrent, intMaxCode, i,ss,istr,s,j\n s=\"\"\n reDim dict(1000)\n intMaxCode = numchars\n For i = 0 To numchars : dict(i)= Chr(i) : Next\n intCurrent=sc(0)\n\n For j=1 To UBound(sc)\n ss=dict(intCurrent)\n s= s & ss\n intMaxCode = intMaxCode + 1\n intnext=sc(j)\n If intNext<intMaxCode Then\n dict(intMaxCode)=ss & Left(dict(intNext), 1)\n Else\n dict(intMaxCode)=ss & Left(ss, 1)\n End If\n intCurrent = intNext\n Next\n s= s & dict(intCurrent)\n lzwUncompress=s\nEnd function\n\nSub printvec(a)\n Dim s,i,x\n s=\"(\"\n For i=0 To UBound (a)\n s=s & x & a(i)\n x=\", \"\n Next\n WScript.echo s &\")\"\nEnd sub\n\nDim a,b\nb=\"TOBEORNOTTOBEORTOBEORNOT\"\nWScript.Echo b\na=LZWCompress (b)\nprintvec(a)\nWScript.echo lzwUncompress (a )\nwscript.quit 1\n","language":"VBScript"},{"code":"class LZW {\n /* Compress a string to a list of output symbols. */\n static compress(uncompressed) {\n // Build the dictionary.\n var dictSize = 256\n var dictionary = {}\n for (i in 0...dictSize) dictionary[String.fromByte(i)] = i\n var w = \"\"\n var result = []\n for (c in uncompressed.bytes) {\n var cs = String.fromByte(c)\n var wc = w + cs\n if (dictionary.containsKey(wc)) {\n w = wc\n } else {\n result.add(dictionary[w])\n // Add wc to the dictionary.\n dictionary[wc] = dictSize\n dictSize = dictSize + 1\n w = cs\n }\n }\n\n // Output the code for w\n if (w != \"\") result.add(dictionary[w])\n return result\n }\n\n /* Decompress a list of output symbols to a string. */\n static decompress(compressed) {\n // Build the dictionary.\n var dictSize = 256\n var dictionary = {}\n for (i in 0...dictSize) dictionary[i] = String.fromByte(i)\n var w = String.fromByte(compressed[0])\n var result = w\n for (k in compressed.skip(1)) {\n var entry\n if (dictionary.containsKey(k)) {\n entry = dictionary[k]\n } else if (k == dictSize) {\n entry = w + String.fromByte(w.bytes[0])\n } else {\n Fiber.abort(\"Bad compressed k: %(k)\")\n }\n result = result + entry\n\n // Add w + entry[0] to the dictionary.\n dictionary[dictSize] = w + String.fromByte(entry.bytes[0])\n dictSize = dictSize + 1\n w = entry\n }\n return result\n }\n}\n\nvar compressed = LZW.compress(\"TOBEORNOTTOBEORTOBEORNOT\")\nSystem.print(compressed)\nvar decompressed = LZW.decompress(compressed)\nSystem.print(decompressed)\n","language":"Wren"},{"code":" Function compress(str as String) As String\n Dim i as integer\n Dim w as String = \"\"\n Dim c as String\n Dim strLen as Integer\n Dim wc as string\n Dim dic() as string\n Dim result() as string\n Dim lookup as integer\n Dim startPos as integer = 0\n Dim combined as String\n\n strLen = len(str)\n\n dic = populateDictionary\n\n for i = 1 to strLen\n c = str.mid(i, 1)\n wc = w + c\n\n startPos = getStartPos(wc)\n\n lookup = findArrayPos(dic, wc, startPos)\n if (lookup <> -1) then\n w = wc\n Else\n startPos = getStartPos(w)\n lookup = findArrayPos(dic, w, startPos)\n if lookup <> -1 then\n result.Append(lookup.ToText)\n end if\n dic.append(wc)\n w = c\n end if\n next i\n\n if (w <> \"\") then\n startPos = getStartPos(w)\n lookup = findArrayPos(dic, w, startPos)\n result.Append(lookup.ToText)\n end if\n\n return join(result, \",\")\n End Function\n\n Function decompress(str as string) As string\n dim comStr() as string\n dim w as string\n dim result as string\n dim comStrLen as integer\n dim entry as string\n dim dic() as string\n dim i as integer\n\n comStr = str.Split(\",\")\n comStrLen = comStr.Ubound\n dic = populateDictionary\n\n w = chr(val(comStr(0)))\n result = w\n for i = 1 to comStrLen\n entry = dic(val(comStr(i)))\n result = result + entry\n dic.append(w + entry.mid(1,1))\n w = entry\n next i\n\n return result\n End Function\n\n Private Function findArrayPos(arr() as String, search as String, start as integer) As Integer\n dim arraySize as Integer\n dim arrayPosition as Integer = -1\n dim i as Integer\n\n arraySize = UBound(arr)\n\n for i = start to arraySize\n if (strcomp(arr(i), search, 0) = 0) then\n arrayPosition = i\n exit\n end if\n next i\n\n return arrayPosition\n End Function\n\n Private Function getStartPos(str as String) As integer\n if (len(str) = 1) then\n return 0\n else\n return 255\n end if\n End Function\n\n Private Function populateDictionary() As string()\n dim dic() as string\n dim i as integer\n\n for i = 0 to 255\n dic.append(Chr(i))\n next i\n\n return dic\n End Function\n","language":"Xojo"},{"code":"fcn lzwCompress(uncompressed){ // text-->list of 12 bit ints\n dictionary:=(256).pump(Dictionary(),fcn(n){ return(n.toChar(),n) });\n w,compressed:=\"\",List();\n foreach c in (uncompressed){\n wc:=w+c;\n if(dictionary.holds(wc)) w=wc;\n else{\n compressed.append(dictionary[w]); // 12 bits\n dictionary[wc]=dictionary.len();\n w=c;\n }\n }\n if(w) compressed.append(dictionary[w]);\n compressed\n}\nfcn lzwUncompress(compressed){ // compressed data-->text\n dictionary:=(256).pump(Dictionary(),fcn(n){ return(n,n.toChar()) });\n w,decommpressed:=dictionary[compressed[0]],Data(Void,w);\n foreach k in (compressed[1,*]){\n if(dictionary.holds(k)) entry:=dictionary[k];\n else if(k==dictionary.len()) entry:=w+w[0];\n else throw(Exception.ValueError(\"Invalid compressed data\"));\n decommpressed.append(entry);\n dictionary.add(dictionary.len(),w+entry[0]);\n w=entry;\n }\n decommpressed.text\n}\n","language":"Zkl"},{"code":"compressed:=lzwCompress(\"TOBEORNOTTOBEORTOBEORNOT\");\ncompressed.toString(*).println();\n\nlzwUncompress(compressed).println();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/LZW_compression\\nnote: Compression\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"The Lempel-Ziv-Welch (LZW) algorithm provides loss-less data compression.\\n\\nYou can read a complete description of it in the [[wp:Lempel-Ziv-Welch|Wikipedia article]] on the subject. It was patented, but it entered the public domain in 2004.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F compress(uncompressed)\\n V dict_size = 256\\n V dictionary = Dict((0 .< dict_size).map(i -> (String(Char(code' i)), i)))\\n V w = ‘’\\n [Int] result\\n L(c) uncompressed\\n V wc = w‘’c\\n I wc C dictionary\\n w = wc\\n E\\n result.append(dictionary[w])\\n dictionary[wc] = dict_size\\n dict_size++\\n w = c\\n\\n I !w.empty\\n result.append(dictionary[w])\\n\\n R result\\n\\nF decompress([Int] &compressed)\\n V dict_size = 256\\n V dictionary = Dict((0 .< dict_size).map(i -> (i, String(Char(code' i)))))\\n V result = ‘’\\n V w = String(Char(code' compressed.pop(0)))\\n result ‘’= w\\n L(k) compressed\\n V entry = ‘’\\n I k C dictionary\\n entry = dictionary[k]\\n E I k == dict_size\\n entry = w‘’w[0]\\n E\\n exit(‘Bad compressed k: ’k)\\n result ‘’= entry\\n dictionary[dict_size] = w‘’entry[0]\\n dict_size++\\n w = entry\\n\\n R result\\n\\nV compressed = compress(‘TOBEORNOTTOBEORTOBEORNOT’)\\nprint(compressed)\\nprint(decompress(&compressed))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"package LZW is\\n\\n MAX_CODE : constant := 4095;\\n\\n type Codes is new Natural range 0 .. MAX_CODE;\\n type Compressed_Data is array (Positive range <>) of Codes;\\n\\n function Compress (Cleartext : in String) return Compressed_Data;\\n function Decompress (Data : in Compressed_Data) return String;\\n\\nend LZW;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Containers.Ordered_Maps;\\nwith Ada.Strings.Unbounded;\\n\\npackage body LZW is\\n package UStrings renames Ada.Strings.Unbounded;\\n use type UStrings.Unbounded_String;\\n\\n --------------\\n -- Compress --\\n --------------\\n\\n function Compress (Cleartext : in String) return Compressed_Data is\\n -- translate String to Code-ID\\n package String_To_Code is new Ada.Containers.Ordered_Maps (\\n Key_Type => UStrings.Unbounded_String,\\n Element_Type => Codes);\\n\\n Dictionary : String_To_Code.Map;\\n -- Next unused Code-ID\\n Next_Entry : Codes := 256;\\n\\n -- maximum same length as input, compression ratio always >=1.0\\n Result : Compressed_Data (1 .. Cleartext'Length);\\n -- position for next Code-ID\\n Result_Index : Natural := 1;\\n\\n -- current and next input string\\n Current_Word : UStrings.Unbounded_String :=\\n UStrings.Null_Unbounded_String;\\n Next_Word : UStrings.Unbounded_String :=\\n UStrings.Null_Unbounded_String;\\n begin\\n -- initialize Dictionary\\n for C in Character loop\\n String_To_Code.Insert\\n (Dictionary,\\n UStrings.Null_Unbounded_String & C,\\n Character'Pos (C));\\n end loop;\\n\\n for Index in Cleartext'Range loop\\n -- add character to current word\\n Next_Word := Current_Word & Cleartext (Index);\\n if String_To_Code.Contains (Dictionary, Next_Word) then\\n -- already in dictionary, continue with next character\\n Current_Word := Next_Word;\\n else\\n -- insert code for current word to result\\n Result (Result_Index) :=\\n String_To_Code.Element (Dictionary, Current_Word);\\n Result_Index := Result_Index + 1;\\n -- add new Code to Dictionary\\n String_To_Code.Insert (Dictionary, Next_Word, Next_Entry);\\n Next_Entry := Next_Entry + 1;\\n -- reset current word to one character\\n Current_Word := UStrings.Null_Unbounded_String &\\n Cleartext (Index);\\n end if;\\n end loop;\\n -- Last word was not entered\\n Result (Result_Index) :=\\n String_To_Code.Element (Dictionary, Current_Word);\\n -- return correct array size\\n return Result (1 .. Result_Index);\\n end Compress;\\n\\n ----------------\\n -- Decompress --\\n ----------------\\n\\n function Decompress (Data : in Compressed_Data) return String is\\n -- translate Code-ID to String\\n type Code_To_String is array (Codes) of UStrings.Unbounded_String;\\n\\n Dictionary : Code_To_String;\\n -- next unused Code-ID\\n Next_Entry : Codes := 256;\\n\\n -- initialize resulting string as empty string\\n Result : UStrings.Unbounded_String := UStrings.Null_Unbounded_String;\\n\\n Next_Code : Codes;\\n -- first code has to be in dictionary\\n Last_Code : Codes := Data (1);\\n -- suffix appended to last string for new dictionary entry\\n Suffix : Character;\\n begin\\n -- initialize Dictionary\\n for C in Character loop\\n Dictionary (Codes (Character'Pos (C))) :=\\n UStrings.Null_Unbounded_String & C;\\n end loop;\\n\\n -- output first Code-ID\\n UStrings.Append (Result, Dictionary (Last_Code));\\n for Index in 2 .. Data'Last loop\\n Next_Code := Data (Index);\\n if Next_Code <= Next_Entry then\\n -- next Code-ID already in dictionary -> append first char\\n Suffix := UStrings.Element (Dictionary (Next_Code), 1);\\n else\\n -- next Code-ID not in dictionary -> use char from last ID\\n Suffix := UStrings.Element (Dictionary (Last_Code), 1);\\n end if;\\n -- expand the dictionary\\n Dictionary (Next_Entry) := Dictionary (Last_Code) & Suffix;\\n Next_Entry := Next_Entry + 1;\\n -- output the current Code-ID to result\\n UStrings.Append (Result, Dictionary (Next_Code));\\n Last_Code := Next_Code;\\n end loop;\\n -- return String\\n return UStrings.To_String (Result);\\n end Decompress;\\n\\nend LZW;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with LZW;\\nwith Ada.Text_IO;\\n\\nprocedure Test is\\n package Text_IO renames Ada.Text_IO;\\n package Code_IO is new Ada.Text_IO.Integer_IO (LZW.Codes);\\n\\n Test_Data : constant LZW.Compressed_Data :=\\n LZW.Compress (\\\"TOBEORNOTTOBEORTOBEORNOT\\\");\\nbegin\\n for Index in Test_Data'Range loop\\n Code_IO.Put (Test_Data (Index), 0);\\n Text_IO.Put (\\\" \\\");\\n end loop;\\n Text_IO.New_Line;\\n declare\\n Cleartext : constant String := LZW.Decompress (Test_Data);\\n begin\\n Text_IO.Put_Line (Cleartext);\\n end;\\nend Test;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \" 0 PLAIN$ = \\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\n 10 GOSUB 200\\\"ENCODE PLAIN$\\n 20 FOR I = 1 TO LEN (ENCODE$) STEP 2\\n 30 PRINT S$ ASC ( MID$ (ENCODE$,I)) + 256 * ASC ( MID$ (ENCODE$,I + 1));\\n 40 LET S$ = \\\" \\\"\\n 50 NEXT\\n 60 PRINT\\n 70 GOSUB 300\\\"DECODE ENCODE$\\n 80 PRINT PLAIN$;\\n 90 END\\n\\n 100 FOR C = 0 TO 1E9 STEP 0\\n 110 IF I > S THEN RETURN\\n 120 FOR D = 1 TO L - 1\\n 130 IF W$ < > DICT$(D) THEN NEXT D\\n 140 IF D > = L THEN RETURN\\n 150 LET I = I + 1\\n 160 LET W$ = W$ + MID$ (PLAIN$,I,1)\\n 170 LET C = D\\n 180 NEXT C\\n 190 RETURN\\n\\n REM ENCODE PLAIN$ RETURN ENCODE$\\n 200 IF NOT DI THEN DIM DICT$(4095)\\n 210 FOR I = 0 TO 255:DICT$(I) = CHR$ (I): NEXT\\n 220 LET DI = 1 : L = I : S = LEN (PLAIN$):ENCODE$ = \\\"\\\"\\n 230 LET W$ = LEFT$ (PLAIN$,1)\\n 240 FOR I = 1 TO 1E9 STEP 0\\n 250 GOSUB 100\\n 260 LET DICT$(L) = W$:L = L + 1:W$ = RIGHT$ (W$,1)\\n 270 LET C% = C / 256:ENCODE$ = ENCODE$ + CHR$ (C - C% * 256) + CHR$ (C%)\\n 280 IF I < = S THEN NEXT I\\n 290 RETURN\\n\\n REM DECODE ENCODE$ RETURN PLAIN$\\n 300 IF NOT DI THEN DIM DICT$(4095)\\n 310 FOR I = 0 TO 255:DICT$(I) = CHR$ (I): NEXT\\n 320 LET DI = 1 : L = I\\n 330 FOR I = L TO 4095:DICT$(I) = \\\"\\\": NEXT\\n 340 LET C = ASC (ENCODE$) + 256 * ASC ( MID$ (ENCODE$,2))\\n 350 LET W$ = DICT$(C)\\n 360 LET PLAIN$ = W$\\n 370 LET S = LEN (ENCODE$)\\n 380 IF S < 4 THEN RETURN\\n 400 FOR I = 3 TO S STEP 2\\n 410 LET C = ASC ( MID$ (ENCODE$,I)) + 256 * ASC ( MID$ (ENCODE$,I + 1))\\n 420 IF C < L THEN T$ = DICT$(C)\\n 430 IF C > = L THEN T$ = W$ + LEFT$ (W$,1)\\n 440 LET PLAIN$ = PLAIN$ + T$\\n 450 LET DICT$(L) = W$ + LEFT$ (T$,1)\\n 460 LET L = L + 1\\n 470 LET W$ = T$\\n 480 NEXT\\n 490 RETURN\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"compress: function [str][\\n dict: #[]\\n loop 0..255 'i -> dict\\\\[to :char i]: i\\n\\n w: \\\"\\\"\\n result: new []\\n loop str 'c [\\n wc: w ++ c\\n if? key? dict wc -> w: wc\\n else [\\n 'result ++ dict\\\\[w]\\n dict\\\\[wc]: size dict\\n w: to :string c\\n ]\\n ]\\n\\n if 0 < size w -> 'result ++ dict\\\\[w]\\n return result\\n]\\n\\n\\ndecompress: function [compressed][\\n dict: #[]\\n arr: new compressed\\n loop 0..255 'i -> dict\\\\[i]: to :string to :char i\\n\\n w: dict\\\\[first arr]\\n remove 'arr .index 0\\n\\n result: w\\n loop arr 'k [\\n entry: \\\"\\\"\\n if? key? dict k -> entry: dict\\\\[k]\\n else [\\n if? k = size dict -> entry: w ++ first w\\n else -> panic ~\\\"Error with compressed: |k|\\\"\\n ]\\n 'result ++ entry\\n dict\\\\[size dict]: w ++ first entry\\n w: entry\\n ]\\n return result\\n]\\n\\ncompressed: compress \\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\nprint \\\"Compressed:\\\"\\nprint compressed\\nprint \\\"\\\"\\n\\ndecompressed: decompress compressed\\nprint \\\"Decompressed:\\\"\\nprint decompressed\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"==comp\\nTOBEORNOTTOBEORTOBEORNOT\\nTo be or not to be that is the question!\\n\\\"There is nothing permanent except change.\\\" --- Heraclitus [540 -- 475 BCE]\\n\\n==decomp\\n84,79,66,69,79,82,78,79,84,256,258,260,265,259,261,263\\n84,111,32,98,101,32,111,114,32,110,111,116,32,116,257,259,268,104,97,267,105,115,272,260,113,117,101,115,116,105,111,110,33\\n34,84,104,101,114,101,32,105,115,32,110,111,116,104,105,110,103,32,112,259,109,97,110,101,110,116,32,101,120,99,101,112,281,99,104,277,103,101,46,34,32,296,45,298,296,32,72,259,97,99,108,105,116,117,264,32,91,53,52,48,32,299,52,55,53,32,66,67,69,93\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"# ported from Python\\nBEGIN {\\n is_comp = 0\\n is_decomp = 0\\n}\\n\\n{\\n if ($0 == \\\"\\\") next\\n\\n if ($1 == \\\"==comp\\\") {\\n is_comp = 1\\n is_decomp = 0\\n print \\\"\\\\ncompressing...\\\"\\n next\\n }\\n\\n if ($1 == \\\"==decomp\\\") {\\n is_comp = 0\\n is_decomp = 1\\n print \\\"\\\\ndecompressing...\\\"\\n next\\n }\\n\\n if (is_comp) print compress($0)\\n\\n if (is_decomp) print decompress($0)\\n}\\n\\nfunction compress(str, dict_size, i, dictionary, w, result, len, uncompressed, c, wc ) {\\n dict_size = 256\\n for (i = 0; i <= dict_size; i++) dictionary[chr(i)] = i\\n\\n w = \\\"\\\"\\n result = \\\"\\\"\\n len = split(str, uncompressed, \\\"\\\")\\n for (i = 1; i <= len; i++) {\\n c = uncompressed[i]\\n wc = w c\\n if (wc in dictionary) w = wc\\n else {\\n result = result \\\",\\\" dictionary[w]\\n dictionary[wc] = dict_size++\\n w = c\\n }\\n }\\n if (length(w)) result = result \\\",\\\" dictionary[w]\\n return substr(result,2)\\n return \\\"[\\\" substr(result,2) \\\"]\\\"\\n}\\n\\nfunction decompress(str) {\\n dict_size = 256\\n for (i = 0; i <= dict_size; i++) dictionary[i] = chr(i)\\n\\n result = \\\"\\\"\\n len = split(str, compressed, \\\",\\\")\\n w = chr(compressed[1])\\n result = result w\\n for (i = 2; i <= len; i++) {\\n k = compressed[i]\\n if (k in dictionary) entry = dictionary[k]\\n else if (k == dict_size) entry = w substr(w,1,1)\\n else { entry = \\\"*\\\" }\\n result = result entry\\n dictionary[dict_size++] = w substr(entry,1,1)\\n w = entry\\n }\\n return result\\n}\\n\\nfunction chr(c) {\\n return sprintf(\\\"%c\\\", c + 0)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"CONST lzw_data$ = \\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\n\\nPRINT \\\"LZWData: \\\", lzw_data$\\nencoded$ = Encode_LZW$(lzw_data$)\\nPRINT \\\"Encoded: \\\", encoded$\\nPRINT \\\"Decoded: \\\", Decode_LZW$(encoded$)\\n\\n'----------------------------------------------------------\\n\\nFUNCTION Encode_LZW$(sample$)\\n\\n LOCAL dict ASSOC int\\n LOCAL ch$, buf$, result$\\n LOCAL nr, x\\n\\n FOR nr = 0 TO 255\\n dict(CHR$(nr)) = nr\\n NEXT\\n\\n FOR x = 1 TO LEN(sample$)\\n\\n ch$ = MID$(sample$, x, 1)\\n\\n IF dict(buf$ & ch$) THEN\\n buf$ = buf$ & ch$\\n ELSE\\n result$ = APPEND$(result$, 0, STR$(dict(buf$)))\\n dict(buf$ & ch$) = nr\\n INCR nr\\n buf$ = ch$\\n END IF\\n NEXT\\n\\n result$ = APPEND$(result$, 0, STR$(dict(buf$)))\\n\\n RETURN result$\\n\\nEND FUNCTION\\n\\n'----------------------------------------------------------\\n\\nFUNCTION Decode_LZW$(sample$)\\n\\n LOCAL list$ ASSOC STRING\\n LOCAL old$, ch$, x$, out$, result$\\n LOCAL nr\\n\\n FOR nr = 0 TO 255\\n list$(STR$(nr)) = CHR$(nr)\\n NEXT\\n\\n old$ = TOKEN$(sample$, 1)\\n\\n ch$ = list$(old$)\\n result$ = ch$\\n\\n FOR x$ IN LAST$(sample$, 1)\\n\\n IF NOT(LEN(list$(x$))) THEN\\n out$ = list$(old$)\\n out$ = out$ & ch$\\n ELSE\\n out$ = list$(x$)\\n END IF\\n\\n result$ = result$ & out$\\n ch$ = LEFT$(out$, 1)\\n list$(STR$(nr)) = list$(old$) & ch$\\n\\n INCR nr\\n old$ = x$\\n NEXT\\n\\n RETURN result$\\n\\nEND FUNCTION\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \" plaintext$ = \\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\n encodeLZW$ = FNencodeLZW(plaintext$)\\n FOR i% = 1 TO LEN(encodeLZW$) STEP 2\\n PRINT ; ASCMID$(encodeLZW$,i%) + 256*ASCMID$(encodeLZW$,i%+1) \\\" \\\" ;\\n NEXT\\n PRINT ' FNdecodeLZW(encodeLZW$)\\n END\\n\\n DEF FNencodeLZW(i$)\\n LOCAL c%, d%, i%, l%, o$, w$, dict$()\\n DIM dict$(4095)\\n FOR i% = 0 TO 255 : dict$(i%) = CHR$(i%) : NEXT\\n l% = i%\\n i% = 1\\n w$ = LEFT$(i$,1)\\n REPEAT\\n d% = 0\\n REPEAT\\n c% = d%\\n IF i% > LEN(i$) EXIT REPEAT\\n FOR d% = 1 TO l%-1\\n IF w$ = dict$(d%) EXIT FOR\\n NEXT d%\\n IF d% < l% i% += 1 : w$ += MID$(i$, i%, 1)\\n UNTIL d% >= l%\\n dict$(l%) = w$ : l% += 1 : w$ = RIGHT$(w$)\\n o$ += CHR$(c% MOD 256) + CHR$(c% DIV 256)\\n UNTIL i% >= LEN(i$)\\n = o$\\n\\n DEF FNdecodeLZW(i$)\\n LOCAL c%, i%, l%, o$, t$, w$, dict$()\\n DIM dict$(4095)\\n FOR i% = 0 TO 255 : dict$(i%) = CHR$(i%) : NEXT\\n l% = i%\\n c% = ASC(i$) + 256*ASCMID$(i$,2)\\n w$ = dict$(c%)\\n o$ = w$\\n IF LEN(i$) < 4 THEN = o$\\n FOR i% = 3 TO LEN(i$) STEP 2\\n c% = ASCMID$(i$,i%) + 256*ASCMID$(i$,i%+1)\\n IF c% < l% t$ = dict$(c%) ELSE t$ = w$ + LEFT$(w$,1)\\n o$ += t$\\n dict$(l%) = w$ + LEFT$(t$,1)\\n l% += 1\\n w$ = t$\\n NEXT\\n = o$\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <stdint.h>\\n#include <unistd.h>\\n#include <fcntl.h>\\n#include <sys/types.h>\\n#include <sys/stat.h>\\n\\n/* -------- aux stuff ---------- */\\nvoid* mem_alloc(size_t item_size, size_t n_item)\\n{\\n size_t *x = calloc(1, sizeof(size_t)*2 + n_item * item_size);\\n x[0] = item_size;\\n x[1] = n_item;\\n return x + 2;\\n}\\n\\nvoid* mem_extend(void *m, size_t new_n)\\n{\\n size_t *x = (size_t*)m - 2;\\n x = realloc(x, sizeof(size_t) * 2 + *x * new_n);\\n if (new_n > x[1])\\n memset((char*)(x + 2) + x[0] * x[1], 0, x[0] * (new_n - x[1]));\\n x[1] = new_n;\\n return x + 2;\\n}\\n\\ninline void _clear(void *m)\\n{\\n size_t *x = (size_t*)m - 2;\\n memset(m, 0, x[0] * x[1]);\\n}\\n\\n#define _new(type, n) mem_alloc(sizeof(type), n)\\n#define _del(m) { free((size_t*)(m) - 2); m = 0; }\\n#define _len(m) *((size_t*)m - 1)\\n#define _setsize(m, n) m = mem_extend(m, n)\\n#define _extend(m) m = mem_extend(m, _len(m) * 2)\\n\\n\\n/* ----------- LZW stuff -------------- */\\ntypedef uint8_t byte;\\ntypedef uint16_t ushort;\\n\\n#define M_CLR 256 /* clear table marker */\\n#define M_EOD 257 /* end-of-data marker */\\n#define M_NEW 258 /* new code index */\\n\\n/* encode and decode dictionary structures.\\n for encoding, entry at code index is a list of indices that follow current one,\\n i.e. if code 97 is 'a', code 387 is 'ab', and code 1022 is 'abc',\\n then dict[97].next['b'] = 387, dict[387].next['c'] = 1022, etc. */\\ntypedef struct {\\n ushort next[256];\\n} lzw_enc_t;\\n\\n/* for decoding, dictionary contains index of whatever prefix index plus trailing\\n byte. i.e. like previous example,\\n dict[1022] = { c: 'c', prev: 387 },\\n dict[387] = { c: 'b', prev: 97 },\\n dict[97] = { c: 'a', prev: 0 }\\n the \\\"back\\\" element is used for temporarily chaining indices when resolving\\n a code to bytes\\n */\\ntypedef struct {\\n ushort prev, back;\\n byte c;\\n} lzw_dec_t;\\n\\nbyte* lzw_encode(byte *in, int max_bits)\\n{\\n int len = _len(in), bits = 9, next_shift = 512;\\n ushort code, c, nc, next_code = M_NEW;\\n lzw_enc_t *d = _new(lzw_enc_t, 512);\\n\\n if (max_bits > 15) max_bits = 15;\\n if (max_bits < 9 ) max_bits = 12;\\n\\n byte *out = _new(ushort, 4);\\n int out_len = 0, o_bits = 0;\\n uint32_t tmp = 0;\\n\\n inline void write_bits(ushort x) {\\n tmp = (tmp << bits) | x;\\n o_bits += bits;\\n if (_len(out) <= out_len) _extend(out);\\n while (o_bits >= 8) {\\n o_bits -= 8;\\n out[out_len++] = tmp >> o_bits;\\n tmp &= (1 << o_bits) - 1;\\n }\\n }\\n\\n //write_bits(M_CLR);\\n for (code = *(in++); --len; ) {\\n c = *(in++);\\n if ((nc = d[code].next[c]))\\n code = nc;\\n else {\\n write_bits(code);\\n nc = d[code].next[c] = next_code++;\\n code = c;\\n }\\n\\n /* next new code would be too long for current table */\\n if (next_code == next_shift) {\\n /* either reset table back to 9 bits */\\n if (++bits > max_bits) {\\n /* table clear marker must occur before bit reset */\\n write_bits(M_CLR);\\n\\n bits = 9;\\n next_shift = 512;\\n next_code = M_NEW;\\n _clear(d);\\n } else /* or extend table */\\n _setsize(d, next_shift *= 2);\\n }\\n }\\n\\n write_bits(code);\\n write_bits(M_EOD);\\n if (tmp) write_bits(tmp);\\n\\n _del(d);\\n\\n _setsize(out, out_len);\\n return out;\\n}\\n\\nbyte* lzw_decode(byte *in)\\n{\\n byte *out = _new(byte, 4);\\n int out_len = 0;\\n\\n inline void write_out(byte c)\\n {\\n while (out_len >= _len(out)) _extend(out);\\n out[out_len++] = c;\\n }\\n\\n lzw_dec_t *d = _new(lzw_dec_t, 512);\\n int len, j, next_shift = 512, bits = 9, n_bits = 0;\\n ushort code, c, t, next_code = M_NEW;\\n\\n uint32_t tmp = 0;\\n inline void get_code() {\\n while(n_bits < bits) {\\n if (len > 0) {\\n len --;\\n tmp = (tmp << 8) | *(in++);\\n n_bits += 8;\\n } else {\\n tmp = tmp << (bits - n_bits);\\n n_bits = bits;\\n }\\n }\\n n_bits -= bits;\\n code = tmp >> n_bits;\\n tmp &= (1 << n_bits) - 1;\\n }\\n\\n inline void clear_table() {\\n _clear(d);\\n for (j = 0; j < 256; j++) d[j].c = j;\\n next_code = M_NEW;\\n next_shift = 512;\\n bits = 9;\\n };\\n\\n clear_table(); /* in case encoded bits didn't start with M_CLR */\\n for (len = _len(in); len;) {\\n get_code();\\n if (code == M_EOD) break;\\n if (code == M_CLR) {\\n clear_table();\\n continue;\\n }\\n\\n if (code >= next_code) {\\n fprintf(stderr, \\\"Bad sequence\\\\n\\\");\\n _del(out);\\n goto bail;\\n }\\n\\n d[next_code].prev = c = code;\\n while (c > 255) {\\n t = d[c].prev; d[t].back = c; c = t;\\n }\\n\\n d[next_code - 1].c = c;\\n\\n while (d[c].back) {\\n write_out(d[c].c);\\n t = d[c].back; d[c].back = 0; c = t;\\n }\\n write_out(d[c].c);\\n\\n if (++next_code >= next_shift) {\\n if (++bits > 16) {\\n /* if input was correct, we'd have hit M_CLR before this */\\n fprintf(stderr, \\\"Too many bits\\\\n\\\");\\n _del(out);\\n goto bail;\\n }\\n _setsize(d, next_shift *= 2);\\n }\\n }\\n\\n /* might be ok, so just whine, don't be drastic */\\n if (code != M_EOD) fputs(\\\"Bits did not end in EOD\\\\n\\\", stderr);\\n\\n _setsize(out, out_len);\\nbail: _del(d);\\n return out;\\n}\\n\\nint main()\\n{\\n int i, fd = open(\\\"unixdict.txt\\\", O_RDONLY);\\n\\n if (fd == -1) {\\n fprintf(stderr, \\\"Can't read file\\\\n\\\");\\n return 1;\\n };\\n\\n struct stat st;\\n fstat(fd, &st);\\n\\n byte *in = _new(char, st.st_size);\\n read(fd, in, st.st_size);\\n _setsize(in, st.st_size);\\n close(fd);\\n\\n printf(\\\"input size: %d\\\\n\\\", _len(in));\\n\\n byte *enc = lzw_encode(in, 9);\\n printf(\\\"encoded size: %d\\\\n\\\", _len(enc));\\n\\n byte *dec = lzw_decode(enc);\\n printf(\\\"decoded size: %d\\\\n\\\", _len(dec));\\n\\n for (i = 0; i < _len(dec); i++)\\n if (dec[i] != in[i]) {\\n printf(\\\"bad decode at %d\\\\n\\\", i);\\n break;\\n }\\n\\n if (i == _len(dec)) printf(\\\"Decoded ok\\\\n\\\");\\n\\n\\n _del(in);\\n _del(enc);\\n _del(dec);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <string>\\n#include <map>\\n\\n// Compress a string to a list of output symbols.\\n// The result will be written to the output iterator\\n// starting at \\\"result\\\"; the final iterator is returned.\\ntemplate <typename Iterator>\\nIterator compress(const std::string &uncompressed, Iterator result) {\\n // Build the dictionary.\\n int dictSize = 256;\\n std::map<std::string,int> dictionary;\\n for (int i = 0; i < 256; i++)\\n dictionary[std::string(1, i)] = i;\\n\\n std::string w;\\n for (std::string::const_iterator it = uncompressed.begin();\\n it != uncompressed.end(); ++it) {\\n char c = *it;\\n std::string wc = w + c;\\n if (dictionary.count(wc))\\n w = wc;\\n else {\\n *result++ = dictionary[w];\\n // Add wc to the dictionary.\\n dictionary[wc] = dictSize++;\\n w = std::string(1, c);\\n }\\n }\\n\\n // Output the code for w.\\n if (!w.empty())\\n *result++ = dictionary[w];\\n return result;\\n}\\n\\n// Decompress a list of output ks to a string.\\n// \\\"begin\\\" and \\\"end\\\" must form a valid range of ints\\ntemplate <typename Iterator>\\nstd::string decompress(Iterator begin, Iterator end) {\\n // Build the dictionary.\\n int dictSize = 256;\\n std::map<int,std::string> dictionary;\\n for (int i = 0; i < 256; i++)\\n dictionary[i] = std::string(1, i);\\n\\n std::string w(1, *begin++);\\n std::string result = w;\\n std::string entry;\\n for ( ; begin != end; begin++) {\\n int k = *begin;\\n if (dictionary.count(k))\\n entry = dictionary[k];\\n else if (k == dictSize)\\n entry = w + w[0];\\n else\\n throw \\\"Bad compressed k\\\";\\n\\n result += entry;\\n\\n // Add w+entry[0] to the dictionary.\\n dictionary[dictSize++] = w + entry[0];\\n\\n w = entry;\\n }\\n return result;\\n}\\n\\n#include <iostream>\\n#include <iterator>\\n#include <vector>\\n\\nint main() {\\n std::vector<int> compressed;\\n compress(\\\"TOBEORNOTTOBEORTOBEORNOT\\\", std::back_inserter(compressed));\\n copy(compressed.begin(), compressed.end(), std::ostream_iterator<int>(std::cout, \\\", \\\"));\\n std::cout << std::endl;\\n std::string decompressed = decompress(compressed.begin(), compressed.end());\\n std::cout << decompressed << std::endl;\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Text;\\n\\nnamespace LZW\\n{\\n public class Program\\n {\\n public static void Main(string[] args)\\n {\\n List<int> compressed = Compress(\\\"TOBEORNOTTOBEORTOBEORNOT\\\");\\n Console.WriteLine(string.Join(\\\", \\\", compressed));\\n string decompressed = Decompress(compressed);\\n Console.WriteLine(decompressed);\\n }\\n\\n public static List<int> Compress(string uncompressed)\\n {\\n // build the dictionary\\n Dictionary<string, int> dictionary = new Dictionary<string, int>();\\n for (int i = 0; i < 256; i++)\\n dictionary.Add(((char)i).ToString(), i);\\n\\n string w = string.Empty;\\n List<int> compressed = new List<int>();\\n\\n foreach (char c in uncompressed)\\n {\\n string wc = w + c;\\n if (dictionary.ContainsKey(wc))\\n {\\n w = wc;\\n }\\n else\\n {\\n // write w to output\\n compressed.Add(dictionary[w]);\\n // wc is a new sequence; add it to the dictionary\\n dictionary.Add(wc, dictionary.Count);\\n w = c.ToString();\\n }\\n }\\n\\n // write remaining output if necessary\\n if (!string.IsNullOrEmpty(w))\\n compressed.Add(dictionary[w]);\\n\\n return compressed;\\n }\\n\\n public static string Decompress(List<int> compressed)\\n {\\n // build the dictionary\\n Dictionary<int, string> dictionary = new Dictionary<int, string>();\\n for (int i = 0; i < 256; i++)\\n dictionary.Add(i, ((char)i).ToString());\\n\\n string w = dictionary[compressed[0]];\\n compressed.RemoveAt(0);\\n StringBuilder decompressed = new StringBuilder(w);\\n\\n foreach (int k in compressed)\\n {\\n string entry = null;\\n if (dictionary.ContainsKey(k))\\n entry = dictionary[k];\\n else if (k == dictionary.Count)\\n entry = w + w[0];\\n\\n decompressed.Append(entry);\\n\\n // new sequence; add it to the dictionary\\n dictionary.Add(dictionary.Count, w + entry[0]);\\n\\n w = entry;\\n }\\n\\n return decompressed.ToString();\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn make-dict []\\n (let [vals (range 0 256)]\\n (zipmap (map (comp #'list #'char) vals) vals)))\\n\\n(defn compress [#^String text]\\n (loop [t (seq text)\\n r '()\\n w '()\\n dict (make-dict)\\n s 256]\\n (let [c (first t)]\\n (if c\\n (let [wc (cons c w)]\\n (if (get dict wc)\\n (recur (rest t) r wc dict s)\\n (recur (rest t) (cons (get dict w) r) (list c) (assoc dict wc s) (inc s))))\\n (reverse (if w (cons (get dict w) r) r))))))\\n\\n(compress \\\"TOBEORNOTTOBEORTOBEORNOT\\\")\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(84 79 66 69 79 82 78 79 84 256 258 260 265 259 261 263)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"lzw = (s) ->\\n dct = {} # map substrings to codes between 256 and 4096\\n stream = [] # array of compression results\\n\\n # initialize basic ASCII characters\\n for code_num in [0..255]\\n c = String.fromCharCode(code_num)\\n dct[c] = code_num\\n code_num = 256\\n\\n i = 0\\n while i < s.length\\n # Find word and new_word\\n # word = longest substr already encountered, or next character\\n # new_word = word plus next character, a new substr to encode\\n word = ''\\n j = i\\n while j < s.length\\n new_word = word + s[j]\\n break if !dct[new_word]\\n word = new_word\\n j += 1\\n\\n # stream out the code for the substring\\n stream.push dct[word]\\n\\n # build up our encoding dictionary\\n if code_num < 4096\\n dct[new_word] = code_num\\n code_num += 1\\n\\n # advance thru the string\\n i += word.length\\n stream\\n\\nconsole.log lzw \\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(declaim (ftype (function (vector vector &optional fixnum fixnum) vector)\\n vector-append))\\n(defun vector-append (old new &optional (start2 0) end2)\\n (declare (optimize (speed 3) (safety 0) (debug 0)))\\n (prog1 old\\n (let* ((old-fill (fill-pointer old))\\n (new-fill (+ old-fill (length new))))\\n (when (> new-fill (array-dimension old 0))\\n (adjust-array old (* 4 new-fill)))\\n (setf (fill-pointer old) new-fill)\\n (replace old new :start1 old-fill :start2 start2 :end2 end2))))\\n\\n(declaim (ftype (function (vector t) vector) vector-append1))\\n(defun vector-append1 (old new)\\n (prog1 old\\n (let* ((old-fill (fill-pointer old))\\n (new-fill (1+ old-fill)))\\n (when (> new-fill (array-dimension old 0))\\n (adjust-array old (* 4 new-fill)))\\n (setf (fill-pointer old) new-fill)\\n (setf (aref old old-fill) new))))\\n\\n(declaim (ftype (function (&optional t) vector) make-empty-vector))\\n(defun make-empty-vector (&optional (element-type t))\\n (make-array 0 :element-type element-type :fill-pointer 0 :adjustable t))\\n\\n\\n(declaim (ftype (function (t &optional t) vector) make-vector-with-elt))\\n(defun make-vector-with-elt (elt &optional (element-type t))\\n (make-array 1 :element-type element-type\\n :fill-pointer 1\\n :adjustable t\\n :initial-element elt))\\n\\n(declaim (ftype (function (vector t) vector) vector-append1-new))\\n(defun vector-append1-new (old new)\\n (vector-append1 (vector-append (make-empty-vector 'octet) old)\\n new))\\n\\n(declaim (ftype (function (vector vector) vector) vector-append-new))\\n(defun vector-append-new (old new)\\n (vector-append (vector-append (make-empty-vector 'octet) old)\\n new))\\n\\n(deftype octet () '(unsigned-byte 8))\\n\\n(declaim (ftype (function () hash-table) build-dictionary))\\n(defun build-dictionary ()\\n (let ((dictionary (make-hash-table :test #'equalp)))\\n (loop for i below 256\\n do (let ((vec (make-vector-with-elt i 'octet)))\\n (setf (gethash vec dictionary) vec)))\\n dictionary))\\n\\n(declaim (ftype (function ((vector octet)) (vector octet))\\n lzw-compress-octets))\\n(defun lzw-compress-octets (octets)\\n (declare (optimize (speed 3) (safety 0) (debug 0)))\\n (loop with dictionary-size of-type fixnum = 256\\n with w = (make-empty-vector 'octet)\\n with result = (make-empty-vector 't)\\n with dictionary = (build-dictionary)\\n for c across octets\\n for wc = (vector-append1-new w c)\\n if (gethash wc dictionary) do (setq w wc)\\n else do\\n (vector-append result (gethash w dictionary))\\n (setf (gethash wc dictionary)\\n (make-vector-with-elt dictionary-size))\\n (incf dictionary-size)\\n (setq w (make-vector-with-elt c 'octet))\\n finally (unless (zerop (length (the (vector octet) w)))\\n (vector-append result (gethash w dictionary)))\\n (return result)))\\n\\n(declaim (ftype (function (vector) (vector octet)) lzw-decompress))\\n(defun #1=lzw-decompress (octets)\\n (declare (optimize (speed 3) (safety 0) (debug 0)))\\n (when (zerop (length octets))\\n (return-from #1# (make-empty-vector 'octet)))\\n (loop with dictionary-size = 256\\n with dictionary = (build-dictionary)\\n with result = (make-vector-with-elt (aref octets 0) 'octet)\\n with w = (copy-seq result)\\n for i from 1 below (length octets)\\n for k = (make-vector-with-elt (aref octets i) 't)\\n for entry = (or (gethash k dictionary)\\n (if (equalp k dictionary-size)\\n (vector-append1-new w (aref w 0))\\n (error \\\"bad compresed entry at pos ~S\\\" i)))\\n do (vector-append result entry)\\n (setf (gethash (make-vector-with-elt dictionary-size) dictionary)\\n (vector-append1-new w (aref entry 0)))\\n (incf dictionary-size)\\n (setq w entry)\\n finally (return result)))\\n\\n(defgeneric lzw-compress (datum)\\n (:method ((string string))\\n (lzw-compress (babel:string-to-octets string)))\\n (:method ((octets vector))\\n (lzw-compress-octets octets)))\\n\\n(defun lzw-decompress-to-string (octets)\\n (babel:octets-to-string (lzw-decompress octets)))\\n\\n(defun test (string)\\n (assert (equal #2=(lzw-decompress-to-string (lzw-compress string)) string) ()\\n \\\"Can't compress ~S properly, got ~S instead\\\" string #2#)\\n t)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"CL-USER> (test \\\"TOBEORNOTTOBEORTOBEORNOT\\\")\\nT\\nCL-USER> (lzw-compress \\\"TOBEORNOTTOBEORTOBEORNOT\\\")\\n#(84 79 66 69 79 82 78 79 84 256 258 260 265 259 261 263)\\nCL-USER> (lzw-decompress-to-string *)\\n\\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.array;\\n\\nauto compress(in string original) pure nothrow {\\n int[string] dict;\\n foreach (immutable char c; char.min .. char.max + 1)\\n dict[[c]] = c;\\n\\n string w;\\n int[] result;\\n foreach (immutable ch; original)\\n if (w ~ ch in dict)\\n w = w ~ ch;\\n else {\\n result ~= dict[w];\\n dict[w ~ ch] = dict.length;\\n w = [ch];\\n }\\n return w.empty ? result : (result ~ dict[w]);\\n}\\n\\nauto decompress(in int[] compressed) pure nothrow {\\n auto dict = new string[char.max - char.min + 1];\\n foreach (immutable char c; char.min .. char.max + 1)\\n dict[c] = [c];\\n\\n auto w = dict[compressed[0]];\\n auto result = w;\\n foreach (immutable k; compressed[1 .. $]) {\\n auto entry = (k < dict.length) ? dict[k] : w ~ w[0];\\n result ~= entry;\\n dict ~= w ~ entry[0];\\n w = entry;\\n }\\n return result;\\n}\\n\\nvoid main() {\\n auto comp = \\\"TOBEORNOTTOBEORTOBEORNOT\\\".compress;\\n writeln(comp, \\\"\\\\n\\\", comp.decompress);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"struct LZW {\\n import std.array: empty;\\n\\n // T is ubyte instead of char because D strings are UTF-8.\\n alias T = ubyte;\\n alias Tcomp = ushort;\\n static assert(Tcomp.sizeof > 1);\\n alias Ta = immutable(T)[];\\n\\n enum int initDictSize = 256;\\n static immutable ubyte[initDictSize] bytes;\\n static this() {\\n foreach (immutable T i; 0 .. initDictSize)\\n bytes[i] = i;\\n }\\n\\n static Tcomp[] compress(immutable scope T[] original) pure nothrow @safe\\n out(result) {\\n if (!original.empty)\\n assert(result[0] < initDictSize);\\n } body {\\n if (original.empty)\\n return [];\\n Tcomp[Ta] dict;\\n foreach (immutable b; bytes)\\n dict[[b]] = b;\\n\\n // Here built-in slices give lower efficiency.\\n struct Slice {\\n size_t start, end;\\n @property opSlice() const pure nothrow @safe @nogc {\\n return original[start .. end];\\n }\\n alias opSlice this;\\n }\\n\\n Slice w;\\n Tcomp[] result;\\n foreach (immutable i; 0 .. original.length) {\\n auto wc = Slice(w.start, w.end + 1); // Extend slice.\\n if (wc in dict) {\\n w = wc;\\n } else {\\n result ~= dict[w];\\n assert(dict.length < Tcomp.max); // Overflow guard.\\n dict[wc] = cast(Tcomp)dict.length;\\n w = Slice(i, i + 1);\\n }\\n }\\n\\n if (!w.empty)\\n result ~= dict[w];\\n return result;\\n }\\n\\n static Ta decompress(in Tcomp[] compressed) pure @safe\\n in {\\n if (!compressed.empty)\\n assert(compressed[0] < initDictSize, \\\"Bad compressed\\\");\\n } body {\\n if (compressed.empty)\\n return [];\\n\\n auto dict = new Ta[initDictSize];\\n foreach (immutable b; bytes)\\n dict[b] = [b];\\n\\n auto w = dict[compressed[0]];\\n auto result = w;\\n foreach (immutable k; compressed[1 .. $]) {\\n Ta entry;\\n if (k < dict.length)\\n entry = dict[k];\\n else if (k == dict.length)\\n entry = w ~ w[0];\\n else\\n throw new Exception(\\\"Bad compressed k.\\\");\\n result ~= entry;\\n\\n dict ~= w ~ entry[0];\\n w = entry;\\n }\\n\\n return result;\\n }\\n}\\n\\nvoid main() {\\n import std.stdio, std.string;\\n\\n immutable txt = \\\"TOBEORNOTTOBEORTOBEORNOT\\\";\\n immutable compressed = LZW.compress(txt.representation);\\n compressed.writeln;\\n LZW.decompress(compressed).assumeUTF.writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"enum Marker: ushort {\\n CLR = 256, // Clear table marker.\\n EOD = 257, // End-of-data marker.\\n NEW = 258 // New code index.\\n}\\n\\n\\nubyte[] lzwEncode(scope const(ubyte)[] inp, in uint maxBits) pure nothrow\\nin {\\n assert(maxBits >= 9 && maxBits <= 16);\\n} body {\\n // Encode dictionary array. For encoding, entry at\\n // code index is a list of indices that follow current one,\\n // i.e. if code 97 is 'a', code 387 is 'ab', and code 1022 is 'abc',\\n // then dict[97].next['b'] = 387, dict[387].next['c'] = 1022, etc.\\n alias LZWenc = ushort[256];\\n\\n auto len = inp.length;\\n uint bits = 9;\\n auto d = new LZWenc[512];\\n\\n auto result = new ubyte[16];\\n size_t outLen = 0;\\n size_t oBits = 0;\\n uint tmp = 0;\\n\\n void writeBits(in ushort x) nothrow {\\n tmp = (tmp << bits) | x;\\n oBits += bits;\\n if (result.length / 2 <= outLen)\\n result.length *= 2;\\n while (oBits >= 8) {\\n oBits -= 8;\\n assert(tmp >> oBits <= ubyte.max);\\n result[outLen] = cast(ubyte)(tmp >> oBits);\\n outLen++;\\n tmp &= (1 << oBits) - 1;\\n }\\n }\\n\\n // writeBits(Marker.CLR);\\n ushort nextCode = Marker.NEW;\\n uint nextShift = 512;\\n ushort code = inp[0];\\n inp = inp[1 .. $]; // popFront.\\n while (--len) {\\n ushort c = inp[0];\\n inp = inp[1 .. $]; // popFront.\\n ushort nc = d[code][c];\\n if (nc) {\\n code = nc;\\n } else {\\n writeBits(code);\\n nc = d[code][c] = nextCode;\\n nextCode++;\\n code = c;\\n }\\n\\n // Next new code would be too long for current table.\\n if (nextCode == nextShift) {\\n // Either reset table back to 9 bits.\\n bits++;\\n if (bits > maxBits) {\\n // Table clear marker must occur before bit reset.\\n writeBits(Marker.CLR);\\n\\n bits = 9;\\n nextShift = 512;\\n nextCode = Marker.NEW;\\n d[] = LZWenc.init;\\n } else { // Or extend table.\\n nextShift *= 2;\\n d.length = nextShift;\\n }\\n }\\n }\\n\\n writeBits(code);\\n writeBits(Marker.EOD);\\n if (tmp) {\\n assert(tmp <= ushort.max);\\n writeBits(cast(ushort)tmp);\\n }\\n\\n return result[0 .. outLen];\\n}\\n\\n\\nubyte[] lzwDecode(scope const(ubyte)[] inp) pure {\\n // For decoding, dictionary contains index of whatever prefix\\n // index plus trailing ubyte. i.e. like previous example,\\n // dict[1022] = { c: 'c', prev: 387 },\\n // dict[387] = { c: 'b', prev: 97 },\\n // dict[97] = { c: 'a', prev: 0 }\\n // the \\\"back\\\" element is used for temporarily chaining indices\\n // when resolving a code to bytes.\\n static struct LZWdec {\\n ushort prev, back;\\n ubyte c;\\n }\\n\\n auto result = new ubyte[4];\\n uint outLen = 0;\\n\\n void writeOut(in ubyte c) nothrow {\\n while (outLen >= result.length)\\n result.length *= 2;\\n result[outLen] = c;\\n outLen++;\\n }\\n\\n auto d = new LZWdec[512];\\n ushort code = 0;\\n uint bits = 9;\\n uint len = 0;\\n uint nBits = 0;\\n uint tmp = 0;\\n\\n void getCode() nothrow {\\n while (nBits < bits) {\\n if (len > 0) {\\n len--;\\n tmp = (tmp << 8) | inp[0];\\n inp = inp[1 .. $]; // popFront.\\n nBits += 8;\\n } else {\\n tmp = tmp << (bits - nBits);\\n nBits = bits;\\n }\\n }\\n\\n nBits -= bits;\\n assert(tmp >> nBits <= ushort.max);\\n code = cast(ushort)(tmp >> nBits);\\n tmp &= (1 << nBits) - 1;\\n }\\n\\n uint nextShift = 512;\\n ushort nextCode = Marker.NEW;\\n\\n void clearTable() nothrow {\\n d[] = LZWdec.init;\\n foreach (immutable ubyte j; 0 .. 256)\\n d[j].c = j;\\n nextCode = Marker.NEW;\\n nextShift = 512;\\n bits = 9;\\n }\\n\\n clearTable(); // In case encoded bits didn't start with Marker.CLR.\\n for (len = inp.length; len;) {\\n getCode();\\n if (code == Marker.EOD)\\n break;\\n if (code == Marker.CLR) {\\n clearTable();\\n continue;\\n }\\n\\n if (code >= nextCode)\\n throw new Error(\\\"Bad sequence.\\\");\\n\\n auto c = code;\\n d[nextCode].prev = c;\\n while (c > 255) {\\n immutable t = d[c].prev;\\n d[t].back = c;\\n c = t;\\n }\\n\\n assert(c <= ubyte.max);\\n d[nextCode - 1].c = cast(ubyte)c;\\n\\n while (d[c].back) {\\n writeOut(d[c].c);\\n immutable t = d[c].back;\\n d[c].back = 0;\\n c = t;\\n }\\n writeOut(d[c].c);\\n\\n nextCode++;\\n if (nextCode >= nextShift) {\\n bits++;\\n if (bits > 16) {\\n // If input was correct, we'd have hit Marker.CLR before this.\\n throw new Error(\\\"Too many bits.\\\");\\n }\\n nextShift *= 2;\\n d.length = nextShift;\\n }\\n }\\n\\n // Might be OK, so throw just an exception.\\n if (code != Marker.EOD)\\n throw new Exception(\\\"Bits did not end in EOD\\\");\\n\\n return result[0 .. outLen];\\n}\\n\\n\\nvoid main() {\\n import std.stdio, std.file;\\n\\n const inputData = cast(ubyte[])read(\\\"unixdict.txt\\\");\\n writeln(\\\"Input size: \\\", inputData.length);\\n\\n immutable encoded = lzwEncode(inputData, 12);\\n writeln(\\\"Encoded size: \\\", encoded.length);\\n\\n immutable decoded = lzwDecode(encoded);\\n writeln(\\\"Decoded size: \\\", decoded.length);\\n\\n if (inputData.length != decoded.length)\\n return writeln(\\\"Error: decoded size differs\\\");\\n\\n foreach (immutable i, immutable x; inputData)\\n if (x != decoded[i])\\n return writeln(\\\"Bad decode at \\\", i);\\n\\n \\\"Decoded OK.\\\".writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"Module: LZW\\nSynopsis: LZW implementation for Rosetta code\\n\\ndefine method output(n :: <integer>)\\n format-out(\\\"%d \\\", n);\\nend;\\n\\ndefine method contains?(dict, var)\\n let x = element(dict, var, default: #f);\\n x ~= #f;\\nend;\\n\\ndefine method byte->string(c)\\n add(\\\"\\\", as(<character>, c));\\nend;\\n\\ndefine method compress(input :: <string>) => <vector>;\\n let result = make(<vector>);\\n let dict = make(<string-table>);\\n for (x from 0 to 255)\\n dict[byte->string(x)] := x;\\n end;\\n\\n let next-code = 256;\\n let cur-seq = \\\"\\\";\\n for (c in input)\\n let wc = add(cur-seq, c);\\n if (contains?(dict, wc))\\n cur-seq := wc;\\n else\\n result := add(result, dict[cur-seq]);\\n dict[wc] := next-code;\\n next-code := next-code + 1;\\n cur-seq := add(\\\"\\\", c);\\n end\\n end;\\n unless (empty?(cur-seq))\\n result := add(result, dict[cur-seq]);\\n end;\\n result\\nend;\\n\\nformat-out(\\\"%=\\\\n\\\", compress(\\\"TOBEORNOTTOBEORTOBEORNOT\\\"))\\n\",\n \"language\": \"Dylan\"\n },\n {\n \"code\": \"class\\n APPLICATION\\n\\ncreate\\n make\\n\\nfeature {NONE}\\n\\n make\\n local\\n test: LINKED_LIST [INTEGER]\\n do\\n create test.make\\n test := compress (\\\"TOBEORNOTTOBEORTOBEORNOT\\\")\\n across\\n test as t\\n loop\\n io.put_string (t.item.out + \\\" \\\")\\n end\\n io.new_line\\n io.put_string (decompress (test))\\n end\\n\\n decompress (compressed: LINKED_LIST [INTEGER]): STRING\\n --Decompressed version of 'compressed'.\\n local\\n dictsize, i, k: INTEGER\\n dictionary: HASH_TABLE [STRING, INTEGER]\\n w, entry: STRING\\n char: CHARACTER_8\\n do\\n dictsize := 256\\n create dictionary.make (300)\\n create entry.make_empty\\n create Result.make_empty\\n from\\n i := 0\\n until\\n i > 256\\n loop\\n char := i.to_character_8\\n dictionary.put (char.out, i)\\n i := i + 1\\n end\\n w := compressed.first.to_character_8.out\\n compressed.go_i_th (1)\\n compressed.remove\\n Result := w\\n from\\n k := 1\\n until\\n k > compressed.count\\n loop\\n if attached dictionary.at (compressed [k]) as ata then\\n entry := ata\\n elseif compressed [k] = dictsize then\\n entry := w + w.at (1).out\\n else\\n io.put_string (\\\"EXEPTION\\\")\\n end\\n Result := Result + entry\\n dictsize := dictsize + 1\\n dictionary.put (w + entry.at (1).out, dictsize)\\n w := entry\\n k := k + 1\\n end\\n end\\n\\n compress (uncompressed: STRING): LINKED_LIST [INTEGER]\\n -- Compressed version of 'uncompressed'.\\n local\\n dictsize: INTEGER\\n dictionary: HASH_TABLE [INTEGER, STRING]\\n i: INTEGER\\n w, wc: STRING\\n char: CHARACTER_8\\n do\\n dictsize := 256\\n create dictionary.make (256)\\n create w.make_empty\\n from\\n i := 0\\n until\\n i > 256\\n loop\\n char := i.to_character_8\\n dictionary.put (i, char.out)\\n i := i + 1\\n end\\n create Result.make\\n from\\n i := 1\\n until\\n i > uncompressed.count\\n loop\\n wc := w + uncompressed [i].out\\n if dictionary.has (wc) then\\n w := wc\\n else\\n Result.extend (dictionary.at (w))\\n dictSize := dictSize + 1\\n dictionary.put (dictSize, wc)\\n w := \\\"\\\" + uncompressed [i].out\\n end\\n i := i + 1\\n end\\n if w.count > 0 then\\n Result.extend (dictionary.at (w))\\n end\\n end\\n\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"defmodule LZW do\\n @encode_map Enum.into(0..255, Map.new, &{[&1],&1})\\n @decode_map Enum.into(0..255, Map.new, &{&1,[&1]})\\n\\n def encode(str), do: encode(to_char_list(str), @encode_map, 256, [])\\n\\n defp encode([h], d, _, out), do: Enum.reverse([d[[h]] | out])\\n defp encode([h|t], d, free, out) do\\n val = d[[h]]\\n find_match(t, [h], val, d, free, out)\\n end\\n\\n defp find_match([h|t], l, lastval, d, free, out) do\\n case Map.fetch(d, [h|l]) do\\n {:ok, val} -> find_match(t, [h|l], val, d, free, out)\\n :error -> d1 = Map.put(d, [h|l], free)\\n encode([h|t], d1, free+1, [lastval | out])\\n end\\n end\\n defp find_match([], _, lastval, _, _, out), do: Enum.reverse([lastval | out])\\n\\n def decode([h|t]) do\\n val = @decode_map[h]\\n decode(t, val, 256, @decode_map, val)\\n end\\n\\n defp decode([], _, _, _, l), do: Enum.reverse(l) |> to_string\\n defp decode([h|t], old, free, d, l) do\\n val = if h == free, do: old ++ [List.first(old)], else: d[h]\\n add = [List.last(val) | old]\\n d1 = Map.put(d, free, add)\\n decode(t, val, free+1, d1, val++l)\\n end\\nend\\n\\nstr = \\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\nIO.inspect enc = LZW.encode(str)\\nIO.inspect dec = LZW.decode(enc)\\nIO.inspect str == dec\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"type LzwCompression\\nfun compress ← List by text uncompressed\\n List output ← int[]\\n text working ← Text.EMPTY\\n Map symbolTable ← text%int[].with(256, <int i|text%int(chr(i) => i))\\n for each text c in uncompressed\\n text augmented ← working + c\\n\\tif symbolTable.has(augmented)\\n\\t working ← augmented\\n\\telse\\n\\t symbolTable.insert(augmented, symbolTable.length)\\n\\t int i ← symbolTable[working]\\n\\t output.append(i)\\n\\t working ← c\\n\\tend\\n end\\n if not working.isEmpty()\\n int i ← symbolTable[working]\\n\\toutput.append(i)\\n end\\n return output\\nend\\nfun decompress ← text by List compressed\\n Map symbolTable ← int%text[].with(256, <int i|int%text(i => chr(i)))\\n text working ← symbolTable[compressed[0]]\\n text output ← *working\\n for each int i in compressed.extract(1)\\n text s\\n if symbolTable.has(i)\\n s ← symbolTable[i]\\n else if i æ symbolTable.length # cScSc problem\\n s ← working + working[0]\\n else\\n\\t error(65, \\\"Error decompressing\\\")\\n end\\n output.append(s)\\n symbolTable.insert(symbolTable.length, working + s[0])\\n working ← s\\n end\\n return output\\nend\\nList compressed = compress(\\\"TOBEORNOTTOBEORTOBEORNOT\\\")\\nwriteLine(compressed)\\ntext decompressed = decompress(compressed)\\nwriteLine(decompressed)\\n\",\n \"language\": \"EMal\"\n },\n {\n \"code\": \"-module(lzw).\\n\\n-export([test/0, encode/1, decode/1]).\\n\\n-import(lists, [reverse/1, reverse/2]).\\n\\ntest() ->\\n Str = \\\"TOBEORNOTTOBEORTOBEORNOT\\\",\\n [84,79,66,69,79,82,78,79,84,256,258,260,265,259,261,263] =\\n encode(Str),\\n Str = decode(encode(Str)),\\n ok.\\n\\nencode(Str) ->\\n D = init(dict:new()),\\n encode(Str, D, 256, []).\\n\\nencode([H], D, _, Out) ->\\n Val = dict:fetch([H], D),\\n reverse([Val|Out]);\\nencode([H|T], D, Free, Out) ->\\n Val = dict:fetch([H], D),\\n find_match(T, [H], Val, D, Free, Out).\\n\\nfind_match([H|T], L, LastVal, D, Free, Out) ->\\n case dict:find([H|L], D) of\\n {ok, Val} ->\\n find_match(T, [H|L], Val, D, Free, Out);\\n error ->\\n D1 = dict:store([H|L], Free, D),\\n encode([H|T], D1, Free+1, [LastVal|Out])\\n end;\\nfind_match([], _, LastVal, _, _, Out) ->\\n reverse([LastVal|Out]).\\n\\ndecode([H|T]) ->\\n D = init1(dict:new()),\\n Val = dict:fetch(H, D),\\n decode(T, Val, 256, D, Val).\\n\\ndecode([], _, _, _, L) ->\\n reverse(L);\\ndecode([H|T], Old, Free, D, L) ->\\n Val = dict:fetch(H, D),\\n Add = [lists:last(Val)|Old],\\n D1 = dict:store(Free, Add, D),\\n decode(T, Val, Free+1, D1, Val ++ L).\\n\\ninit(D) -> init(255, D).\\n\\ninit(0, D) -> D;\\ninit(N, D) -> D1 = dict:store([N],N,D), init(N-1, D1).\\n\\ninit1(D) -> init1(255, D).\\n\\ninit1(0, D) -> D;\\ninit1(N, D) -> D1 = dict:store(N,[N],D), init1(N-1, D1).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"256 value next-symbol\\n\\n\\\\ current string fragment\\n\\ncreate w 256 allot \\\\ counted string\\n\\n: w=c ( c -- ) w 1+ c! 1 w c! ;\\n: w+c ( c -- ) w count + c! w c@ 1+ w c! ;\\n\\n\\\\ Compression\\n\\n\\\\ dictionary of strings to symbols\\n0 value dict\\n\\n: init-dict table to dict 256 to next-symbol dict set-current ;\\n\\n: free-dict forth-wordlist set-current ;\\n\\n: in-dict? ( key len -- ? ) \\\\ can assume len > 1\\n dict search-wordlist dup if nip then ;\\n\\n: lookup-dict ( key len -- symbol )\\n dup 1 = if drop c@ exit then\\n dict search-wordlist if >body @ else abort\\\" bad-dict!\\\" then ;\\n\\n: put-dict ( data key len -- )\\n nextname create , ;\\n\\n\\\\ output buffer of symbols\\n\\\\ in real life, these symbols would be packed into octets\\nvariable out-size\\ncreate out 256 cells allot\\n\\n: output ( symbol -- )\\n dup out out-size @ cells + ! 1 out-size +!\\n dup 256 < if emit space else . then ;\\n\\n: compress ( addr len -- )\\n init-dict 0 out-size !\\n over c@ w=c 1 /string\\n bounds do\\n i c@ w+c\\n w count in-dict? 0= if\\n w count 1- lookup-dict output\\n next-symbol dup w count put-dict\\n 1+ to next-symbol\\n i c@ w=c\\n then\\n loop\\n w count lookup-dict output\\n free-dict ;\\n\\n\\\\ Decompression\\n\\n\\\\ array of symbols to strings (in real code this would need to be growable)\\n\\\\ next-symbol is reused for the size of this table\\ncreate symtab 256 cells allot\\n0 value start\\n\\n: init-symtab 256 to next-symbol here to start ;\\n\\n: free-symtab start here - allot ;\\n\\n: get-symbol ( symbol -- addr len )\\n dup 256 < if pad c! pad 1 exit then\\n 256 - cells symtab + @ count ;\\n\\n: add-symbol ( addr len -- )\\n here symtab next-symbol 256 - cells + !\\n s,\\n next-symbol 1+ to next-symbol ;\\n\\ncreate entry 256 allot\\n\\n: decompress ( addr len -- )\\n init-symtab\\n over @ dup emit w=c\\n cells bounds cell+ do\\n i @ next-symbol < if\\n i @ get-symbol entry place\\n else i @ next-symbol = if\\n w 1+ c@ w count + c! w count 1+ entry place\\n else\\n abort\\\" bad symbol!\\\"\\n then then\\n entry count type \\\\ output\\n entry 1+ c@ w+c\\n w count add-symbol\\n entry count w place\\n 1 cells +loop\\n free-symtab ;\\n\\n\\\\ Testing\\n\\ns\\\" TOBEORNOTTOBEORTOBEORNOT\\\" compress cr\\n\\\\ T O B E O R N O T 256 258 260 265 259 261 263\\n\\nout out-size @ decompress cr\\n\\\\ TOBEORNOTTOBEORTOBEORNOT\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"!\\n! lzw_shared_parameters.f90\\n!\\n! LZW Common Variables Used by Coder and Decoder\\n!\\n! Author: Pedro Garcia Freitas <sawp@sawp.com.br>\\n! May, 2011\\n!\\n! License: Creative Commons http://creativecommons.org/licenses/by-nc-nd/3.0/\\n!\\n MODULE LZW_SHARED_PARAMETERS\\n IMPLICIT NONE\\n!\\n! PARAMETER definitions\\n!\\n INTEGER , PARAMETER :: COMPILER_INTEGER_SIZE = 32 , BITS = 12 , FILEIN = 66 , &\\n & FILEOUT = 99 , MAX_VALUE = (2**BITS) - 1 , &\\n & MAX_CODE = MAX_VALUE - 1 , MAX_DICTIONARY_SIZE = 5021 , &\\n & SYMBOL_SIZE = 8 , MISSING_BITS = COMPILER_INTEGER_SIZE - &\\n & SYMBOL_SIZE\\n!\\n! Local variables\\n!\\n INTEGER , DIMENSION(0:MAX_DICTIONARY_SIZE) :: concatenatedsymbols\\n INTEGER , DIMENSION(0:MAX_DICTIONARY_SIZE) :: prefixcodes\\n INTEGER :: the_status = 0\\n\\n! change this if compiler dont use 32 bits for integer\\n\\n END MODULE LZW_SHARED_PARAMETERS\\n!\\n! codecIO.f90\\n!\\n! bit IO routines for coder and encoder.\\n!\\n! Author: Pedro Garcia Freitas <sawp@sawp.com.br>\\n! May, 2011\\n!\\n! License: Creative Commons http://creativecommons.org/licenses/by-nc-nd/3.0/\\n!\\n MODULE CODECIO\\n USE LZW_SHARED_PARAMETERS\\n IMPLICIT NONE\\n!\\n CONTAINS\\n SUBROUTINE SETOUTPUTCODE(Code)\\n IMPLICIT NONE\\n!\\n! Dummy arguments\\n!\\n INTEGER :: Code\\n INTENT (IN) Code\\n!\\n! Local variables\\n!\\n INTEGER :: buffer\\n INTEGER :: outputbitbuffer = 0\\n INTEGER :: outputbitcount = 0\\n INTEGER :: shift\\n INTEGER :: shiftedsymbol\\n!\\n shift = COMPILER_INTEGER_SIZE - BITS - outputbitcount\\n shiftedsymbol = ISHFT(Code , shift)\\n outputbitbuffer = IOR(outputbitbuffer , shiftedsymbol)\\n outputbitcount = outputbitcount + BITS\\n\\n DO WHILE(outputbitcount >= SYMBOL_SIZE)\\n! IF( outputbitcount<SYMBOL_SIZE )EXIT\\n buffer = ISHFT(outputbitbuffer , -MISSING_BITS)\\n CALL SETRAWBYTE(buffer)\\n outputbitbuffer = ISHFT(outputbitbuffer , SYMBOL_SIZE)\\n outputbitcount = outputbitcount - SYMBOL_SIZE\\n END DO\\n RETURN\\n END SUBROUTINE SETOUTPUTCODE\\n\\n\\n SUBROUTINE SETRAWBYTE(Symbol)\\n IMPLICIT NONE\\n!\\n! Dummy arguments\\n!\\n INTEGER :: Symbol\\n INTENT (IN) Symbol\\n!\\n\\n CALL FPUTC(FILEOUT , ACHAR(Symbol))\\n END SUBROUTINE SETRAWBYTE\\n\\n\\n FUNCTION GETRAWBYTE()\\n IMPLICIT NONE\\n!\\n! Dummy arguments\\n!\\n INTEGER :: GETRAWBYTE\\n!\\n! Local variables\\n!\\n CHARACTER :: bufferedbyte\\n!\\n CALL FGETC(FILEIN , bufferedbyte , THE_status)\\n GETRAWBYTE = IACHAR(bufferedbyte)\\n END FUNCTION GETRAWBYTE\\n\\n FUNCTION GETINPUTCODE()\\n IMPLICIT NONE\\n!\\n! Dummy arguments\\n!\\n INTEGER :: GETINPUTCODE\\n!\\n! Local variables\\n!\\n INTEGER :: inputbitbuffer = 0\\n INTEGER :: inputbitcounter = 0\\n INTEGER :: integerinputbuff\\n INTEGER :: returnn\\n INTEGER :: shiftedbit\\n!\\n DO WHILE( inputbitcounter <= MISSING_BITS )\\n! IF( inputbitcounter>MISSING_BITS )EXIT\\n integerinputbuff = GETRAWBYTE()\\n shiftedbit = ISHFT(integerinputbuff , MISSING_BITS - inputbitcounter)\\n inputbitbuffer = IOR(inputbitbuffer , shiftedbit)\\n inputbitcounter = inputbitcounter + SYMBOL_SIZE\\n END DO\\n\\n returnn = ISHFT(inputbitbuffer , BITS - COMPILER_INTEGER_SIZE)\\n inputbitbuffer = ISHFT(inputbitbuffer , BITS)\\n inputbitcounter = inputbitcounter - BITS\\n GETINPUTCODE = returnn\\n RETURN\\n END FUNCTION GETINPUTCODE\\nend module codecIO\\n! lzw_encoder.f90\\n!\\n! LZW Coder (Compressor)\\n!\\n! Author: Pedro Garcia Freitas <sawp@sawp.com.br>\\n! May, 2011\\n!\\n! License: Creative Commons http://creativecommons.org/licenses/by-nc-nd/3.0/\\n!\\n MODULE LZW_ENCODER\\n USE LZW_SHARED_PARAMETERS\\n USE CODECIO\\n IMPLICIT NONE\\n!\\n! PARAMETER definitions\\n!\\n INTEGER , PARAMETER :: HASH_SHIFT = BITS - SYMBOL_SIZE\\n!\\n! Local variables\\n!\\n INTEGER , DIMENSION(0:MAX_DICTIONARY_SIZE) :: symbolvalues\\n CONTAINS\\n SUBROUTINE COMPRESS()\\n IMPLICIT NONE\\n!\\n! Local variables\\n!\\n INTEGER :: codedsymbol\\n INTEGER :: my_index\\n INTEGER :: nextsymbol\\n INTEGER :: symbol\\n CHARACTER :: bufferedbyte\\n!\\n nextsymbol = COMPILER_INTEGER_SIZE*SYMBOL_SIZE\\n SYMbolvalues(:) = -1\\n\\n! codedsymbol = GETRAWBYTE()\\n CALL FGETC(FILEIN , bufferedbyte , THE_status)\\n codedsymbol = IACHAR(bufferedbyte)\\n!Can be hand optimized - optimization\\n DO WHILE(THE_status == 0)\\n! symbol = GETRAWBYTE() ! Manual inline of function\\n CALL FGETC(FILEIN , bufferedbyte , THE_status)\\n symbol = IACHAR(bufferedbyte)\\n IF( THE_status/=0 )CYCLE\\n\\n my_index = GETPOSITIONONDICTIONARY(codedsymbol , symbol)\\n IF( SYMbolvalues(my_index)/= - 1 )THEN\\n codedsymbol = SYMbolvalues(my_index)\\n ELSE\\n IF( nextsymbol<=MAX_CODE )THEN\\n SYMbolvalues(my_index) = nextsymbol\\n nextsymbol = nextsymbol + 1\\n PREfixcodes(my_index) = codedsymbol\\n CONcatenatedsymbols(my_index) = symbol\\n END IF\\n CALL SETOUTPUTCODE(codedsymbol)\\n codedsymbol = symbol\\n END IF\\n END DO\\n CALL SETOUTPUTCODE(codedsymbol)\\n CALL SETOUTPUTCODE(MAX_VALUE)\\n CALL SETOUTPUTCODE(0)\\n END SUBROUTINE COMPRESS\\n\\nfunction getPositionOnDictionary(hashPrefix, hashSymbol)\\n integer, intent(in) :: hashPrefix\\n integer, intent(in) :: hashSymbol\\n integer :: getPositionOnDictionary\\n integer :: index\\n integer :: offset\\n\\n index = ishft(hashSymbol, HASH_SHIFT)\\n index = ieor(index, hashPrefix)\\n if (index == 0) then\\n offset = 1\\n else\\n offset = MAX_DICTIONARY_SIZE - index\\n endif\\n\\n do\\n if (symbolValues(index) == -1) then\\n getPositionOnDictionary = index\\n exit\\n endif\\n\\n if (prefixCodes(index) == hashPrefix .and. &\\n & concatenatedSymbols(index) == hashSymbol) then\\n getPositionOnDictionary = index\\n exit\\n endif\\n\\n index = index - offset\\n if (index < 0) then\\n index = index + MAX_DICTIONARY_SIZE\\n endif\\n end do\\n return\\n end function\\n\\nend module LZW_Encoder\\n! lzw_decoder.f90\\n!\\n! LZW Decoder (Expanssor)\\n!\\n! Author: Pedro Garcia Freitas <sawp@sawp.com.br>\\n! May, 2011\\n!\\n! License: Creative Commons http://creativecommons.org/licenses/by-nc-nd/3.0/\\n!\\n MODULE LZW_DECODER\\n USE LZW_SHARED_PARAMETERS\\n USE CODECIO\\n IMPLICIT NONE\\n!\\n! Derived Type definitions\\n!\\n TYPE :: DECODE_BUFFER_STACK\\n INTEGER , DIMENSION(0:MAX_DICTIONARY_SIZE) :: DECODERSTACK\\n INTEGER :: TOP\\n END TYPE DECODE_BUFFER_STACK\\n!\\n! Local variables\\n!\\n TYPE(DECODE_BUFFER_STACK) :: stack\\n CONTAINS\\n!\\n! Can be hand optimized - optimization\\n SUBROUTINE DECOMPRESS()\\n IMPLICIT NONE\\n!\\n! Local variables\\n!\\n INTEGER :: newsymbol\\n INTEGER :: nextsymbol\\n INTEGER :: oldsymbol\\n INTEGER :: popedsymbol\\n INTEGER :: symbol\\n!\\n nextsymbol = COMPILER_INTEGER_SIZE*SYMBOL_SIZE\\n oldsymbol = GETINPUTCODE()\\n symbol = oldsymbol\\n\\n CALL SETRAWBYTE(oldsymbol)\\n\\n DO\\n newsymbol = GETINPUTCODE()\\n\\n IF( newsymbol==MAX_VALUE )RETURN\\n\\n IF( newsymbol>=nextsymbol )THEN\\n STAck%DECODERSTACK(0) = symbol\\n CALL DECODESYMBOL(STAck%DECODERSTACK(1:) , oldsymbol)\\n ELSE\\n CALL DECODESYMBOL(STAck%DECODERSTACK(:) , newsymbol)\\n END IF\\n\\n symbol = STAck%DECODERSTACK(STAck%TOP)\\n\\n DO WHILE ( STAck%TOP>=0 )\\n popedsymbol = STAck%DECODERSTACK(STAck%TOP)\\n CALL SETRAWBYTE(popedsymbol)\\n STAck%TOP = STAck%TOP - 1\\n END DO\\n\\n IF( nextsymbol<=MAX_CODE )THEN\\n PREfixcodes(nextsymbol) = oldsymbol\\n CONcatenatedsymbols(nextsymbol) = symbol\\n nextsymbol = nextsymbol + 1\\n END IF\\n oldsymbol = newsymbol\\n END DO\\n RETURN\\n END SUBROUTINE DECOMPRESS\\n\\n SUBROUTINE DECODESYMBOL(Buffer , Code)\\n IMPLICIT NONE\\n!\\n! Dummy arguments\\n!\\n INTEGER :: Code\\n INTEGER , DIMENSION(:) :: Buffer\\n INTENT (IN) Code\\n INTENT (INOUT) Buffer\\n!\\n! Local variables\\n!\\n INTEGER :: i\\n INTEGER :: j\\n INTEGER :: symbol\\n!\\n j = 0\\n symbol = Code\\n STAck%TOP = 0\\n DO WHILE ( symbol>=COMPILER_INTEGER_SIZE*SYMBOL_SIZE )\\n ! IF( symbol<COMPILER_INTEGER_SIZE*SYMBOL_SIZE )EXIT\\n\\n IF( j>=MAX_CODE )THEN\\n PRINT * , \\\"Decoding error\\\"\\n STOP\\n END IF\\n\\n i = STAck%TOP + 1\\n Buffer(i) = CONcatenatedsymbols(symbol)\\n symbol = PREfixcodes(symbol)\\n STAck%TOP = STAck%TOP + 1\\n j = j + 1\\n END DO\\n i = j + 1\\n Buffer(i) = symbol\\n END SUBROUTINE DECODESYMBOL\\nend module LZW_Decoder\\n! lzw.f90\\n!\\n! LZW Coder and Decoder\\n!\\n! Author: Pedro Garcia Freitas <sawp@sawp.com.br>\\n! May, 2011\\n!\\n! License: Creative Commons http://creativecommons.org/licenses/by-nc-nd/3.0/\\n!\\n\\n MODULE LZW\\n USE LZW_SHARED_PARAMETERS\\n USE LZW_ENCODER\\n USE LZW_DECODER\\n IMPLICIT NONE\\n CONTAINS\\n SUBROUTINE INIT(Input , Output , Operation , Filename)\\n IMPLICIT NONE\\n!\\n! Dummy arguments\\n!\\n CHARACTER(100) :: Filename\\n CHARACTER(100) :: Input\\n CHARACTER(1) :: Operation\\n CHARACTER(100) :: Output\\n INTENT (IN) Filename , Input , Operation , Output\\n!\\n IF( Operation/='d' .AND. Operation/='e' )THEN\\n PRINT * , \\\"Usage: \\\" // TRIM(Filename) // \\\" <operation> input output\\\"\\n PRINT * , \\\"Possible operations: \\\"\\n PRINT * , \\\" e -> encode (compress)\\\"\\n PRINT * , \\\" d -> decode (inflate)\\\"\\n STOP\\n END IF\\n\\n OPEN(UNIT = FILEIN , FILE = Input , ACTION = \\\"read\\\" , STATUS = \\\"old\\\" , &\\n &ACCESS = 'stream' , FORM = \\\"formatted\\\")\\n OPEN(UNIT = FILEOUT , FILE = Output , ACTION = \\\"write\\\" , STATUS = \\\"replace\\\" , &\\n & ACCESS = 'stream' , FORM = \\\"formatted\\\")\\n\\n IF( Operation=='d' )THEN\\n PRINT * , \\\"Decoding...\\\"\\n CALL DECOMPRESS()\\n ELSE\\n PRINT * , \\\"Encoding...\\\"\\n CALL COMPRESS()\\n END IF\\n\\n CLOSE(UNIT = FILEIN)\\n CLOSE(UNIT = FILEOUT)\\n END SUBROUTINE INIT\\nend module LZW\\n!\\n PROGRAM MAIN\\n USE LZW\\n IMPLICIT NONE\\n!\\n! Local variables\\n!\\n CHARACTER(100) :: filename\\n REAL :: finish\\n CHARACTER(100) :: input\\n CHARACTER(1) :: operation\\n CHARACTER(100) :: output\\n REAL :: start\\n!\\n CALL GETARG(0 , filename)\\n CALL GETARG(1 , operation)\\n CALL GETARG(2 , input)\\n CALL GETARG(3 , output)\\n CALL CPU_TIME(start)\\n CALL INIT(input , output , operation , filename)\\n CALL CPU_TIME(finish)\\n PRINT '(\\\"Time = \\\",f6.3,\\\" seconds.\\\")' , finish - start\\n END PROGRAM MAIN\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' version 22-02-2019\\n' compile with: fbc -s console\\n\\nType dict\\n prefix As Integer\\n B As String\\nEnd Type\\n\\nSub init(dictionary() As dict, ByRef last As ULong)\\n\\n For i As ULong = 0 To 255\\n dictionary(i).prefix = -1\\n dictionary(i).B = Chr(i)\\n Next\\n last = 255\\n\\nEnd Sub\\n\\nFunction encode_LZW(dictionary() As dict, last_entry As ULong, input_str As String) As String\\n\\n If Len(input_str) < 2 Then\\n Print \\\"input string is to short\\\"\\n Return \\\"\\\"\\n End If\\n\\n Dim As String word, output_str, char\\n Dim As ULong i = 1, index, j, len_input = Len(input_str)\\n\\n Do\\n If i > len_input Then\\n output_str = output_str + \\\" \\\" + Str(index)\\n Return output_str ' no more chars to process. we are done\\n End If\\n char = Mid(Input_str, i, 1)\\n i += 1\\n For j = 0 To last_entry\\n If dictionary(j).B = word + char Then\\n word += char\\n index = j\\n Continue Do\\n End If\\n Next\\n output_str = output_str + \\\" \\\" + Str(index)\\n last_entry = last_entry +1\\n dictionary(last_entry).B = word + char\\n dictionary(last_entry).prefix = index\\n word = char : index = Asc(char)\\n Loop\\n\\nEnd Function\\n\\nFunction decode_LZW(dictionary() As dict, last_entry As ULong, input_str As String) As String\\n\\n Dim As String temp, word, output_str\\n Dim As ULong i, i1 = 1, j, index\\n input_str = Trim(input_str)\\n Dim As ULong len_input = Len(input_str)\\n input_str = input_str + \\\" \\\"\\n\\n i = InStr(i1, input_str, \\\" \\\")\\n index = Val(Mid(Input_str, i1, i - i1))\\n word = dictionary(index).B\\n output_str = word\\n i1 = i +1\\n Do\\n i = InStr(i1, input_str, \\\" \\\")\\n If i >= len_input Then\\n index = Val(Mid(input_str, i1))\\n output_str = output_str + dictionary(index).B\\n Return output_str\\n End If\\n index = Val(Mid(Input_str, i1, i - i1))\\n i1 = i +1\\n If index <= last_entry Then\\n temp = dictionary(index).B\\n Else\\n temp = word + Left(word, 1)\\n End If\\n output_str = output_str + temp\\n last_entry = last_entry +1\\n dictionary(last_entry).B = word + Left(temp, 1)\\n word = temp\\n Loop\\n\\nEnd Function\\n\\n' ------=< MAIN >=------\\n\\nDim As ULong last_entry, max_bit = 9\\nDim As ULong dict_max = 1 Shl max_bit -1\\nDim As String output_str, input_str = \\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\nDim As dict dictionary()\\n\\nPrint \\\" input str: \\\";input_str\\n\\nReDim dictionary(dict_max +1)\\ninit(dictionary(), last_entry)\\noutput_str = encode_LZW(dictionary(), last_entry, input_str)\\nPrint \\\"encoded str: \\\";output_str\\n\\nReDim dictionary(dict_max +1)\\ninit(dictionary(), last_entry)\\noutput_str = decode_LZW(dictionary(), last_entry, output_str)\\nPrint \\\"decoded str: \\\"; output_str\\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\\t\\\"fmt\\\"\\n\\t\\\"log\\\"\\n\\t\\\"strings\\\"\\n)\\n\\n// Compress a string to a list of output symbols.\\nfunc compress(uncompressed string) []int {\\n\\t// Build the dictionary.\\n\\tdictSize := 256\\n\\t// We actually want a map of []byte -> int but\\n\\t// slices are not acceptable map key types.\\n\\tdictionary := make(map[string]int, dictSize)\\n\\tfor i := 0; i < dictSize; i++ {\\n\\t\\t// Ugly mess to work around not having a []byte key type.\\n\\t\\t// Using `string(i)` would do utf8 encoding for i>127.\\n\\t\\tdictionary[string([]byte{byte(i)})] = i\\n\\t}\\n\\n\\tvar result []int\\n\\tvar w []byte\\n\\tfor i := 0; i < len(uncompressed); i++ {\\n\\t\\tc := uncompressed[i]\\n\\t\\twc := append(w, c)\\n\\t\\tif _, ok := dictionary[string(wc)]; ok {\\n\\t\\t\\tw = wc\\n\\t\\t} else {\\n\\t\\t\\tresult = append(result, dictionary[string(w)])\\n\\t\\t\\t// Add wc to the dictionary.\\n\\t\\t\\tdictionary[string(wc)] = dictSize\\n\\t\\t\\tdictSize++\\n\\t\\t\\t//w = []byte{c}, but re-using wc\\n\\t\\t\\twc[0] = c\\n\\t\\t\\tw = wc[:1]\\n\\t\\t}\\n\\t}\\n\\n\\tif len(w) > 0 {\\n\\t\\t// Output the code for w.\\n\\t\\tresult = append(result, dictionary[string(w)])\\n\\t}\\n\\treturn result\\n}\\n\\ntype BadSymbolError int\\n\\nfunc (e BadSymbolError) Error() string {\\n\\treturn fmt.Sprint(\\\"Bad compressed symbol \\\", int(e))\\n}\\n\\n// Decompress a list of output symbols to a string.\\nfunc decompress(compressed []int) (string, error) {\\n\\t// Build the dictionary.\\n\\tdictSize := 256\\n\\tdictionary := make(map[int][]byte, dictSize)\\n\\tfor i := 0; i < dictSize; i++ {\\n\\t\\tdictionary[i] = []byte{byte(i)}\\n\\t}\\n\\n\\tvar result strings.Builder\\n\\tvar w []byte\\n\\tfor _, k := range compressed {\\n\\t\\tvar entry []byte\\n\\t\\tif x, ok := dictionary[k]; ok {\\n\\t\\t\\t//entry = x, but ensuring any append will make a copy\\n\\t\\t\\tentry = x[:len(x):len(x)]\\n\\t\\t} else if k == dictSize && len(w) > 0 {\\n\\t\\t\\tentry = append(w, w[0])\\n\\t\\t} else {\\n\\t\\t\\treturn result.String(), BadSymbolError(k)\\n\\t\\t}\\n\\t\\tresult.Write(entry)\\n\\n\\t\\tif len(w) > 0 {\\n\\t\\t\\t// Add w+entry[0] to the dictionary.\\n\\t\\t\\tw = append(w, entry[0])\\n\\t\\t\\tdictionary[dictSize] = w\\n\\t\\t\\tdictSize++\\n\\t\\t}\\n\\t\\tw = entry\\n\\t}\\n\\treturn result.String(), nil\\n}\\n\\nfunc main() {\\n\\tcompressed := compress(\\\"TOBEORNOTTOBEORTOBEORNOT\\\")\\n\\tfmt.Println(compressed)\\n\\tdecompressed, err := decompress(compressed)\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\tfmt.Println(decompressed)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def compress = { text ->\\n def dictionary = (0..<256).inject([:]) { map, ch -> map.\\\"${(char)ch}\\\" = ch; map }\\n def w = '', compressed = []\\n text.each { ch ->\\n def wc = \\\"$w$ch\\\"\\n if (dictionary[wc]) {\\n w = wc\\n } else {\\n compressed << dictionary[w]\\n dictionary[wc] = dictionary.size()\\n w = \\\"$ch\\\"\\n }\\n }\\n if (w) { compressed << dictionary[w] }\\n compressed\\n}\\n\\ndef decompress = { compressed ->\\n def dictionary = (0..<256).inject([:]) { map, ch -> map[ch] = \\\"${(char)ch}\\\"; map }\\n int dictSize = 128;\\n String w = \\\"${(char)compressed[0]}\\\"\\n StringBuffer result = new StringBuffer(w)\\n\\n compressed.drop(1).each { k ->\\n String entry = dictionary[k]\\n if (!entry) {\\n if (k != dictionary.size()) throw new IllegalArgumentException(\\\"Bad compressed k $k\\\")\\n entry = \\\"$w${w[0]}\\\"\\n }\\n result << entry\\n\\n dictionary[dictionary.size()] = \\\"$w${entry[0]}\\\"\\n w = entry\\n }\\n\\n result.toString()\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def plaintext = 'TOBEORNOTTOBEORTOBEORNOT'\\ndef compressed = compress(plaintext)\\ndef result = decompress(compressed)\\n\\nprintln \\\"\\\"\\\"\\\\\\n Plaintext: '$plaintext'\\n Compressed: $compressed\\n Uncompressed: '$result'\\\"\\\"\\\".stripIndent()\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Data.List (elemIndex, tails)\\nimport Data.Maybe (fromJust)\\n\\ndoLZW :: Eq a => [a] -> [a] -> [Int]\\ndoLZW _ [] = []\\ndoLZW as (x:xs) = lzw (return <$> as) [x] xs\\n where\\n lzw a w [] = [fromJust $ elemIndex w a]\\n lzw a w (x:xs)\\n | w_ `elem` a = lzw a w_ xs\\n | otherwise = fromJust (elemIndex w a) : lzw (a ++ [w_]) [x] xs\\n where\\n w_ = w ++ [x]\\n\\nundoLZW :: [a] -> [Int] -> [a]\\nundoLZW _ [] = []\\nundoLZW a cs =\\n cs >>=\\n (!!)\\n (foldl\\n ((.) <$> (++) <*>\\n (\\\\x xs -> return (((++) <$> head <*> take 1 . last) ((x !!) <$> xs))))\\n (return <$> a)\\n (take2 cs))\\n\\ntake2 :: [a] -> [[a]]\\ntake2 xs = filter ((2 ==) . length) (take 2 <$> tails xs)\\n\\nmain :: IO ()\\nmain = do\\n print $ doLZW ['\\\\0' .. '\\\\255'] \\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\n print $\\n undoLZW\\n ['\\\\0' .. '\\\\255']\\n [84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263]\\n print $\\n ((==) <*> ((.) <$> undoLZW <*> doLZW) ['\\\\NUL' .. '\\\\255'])\\n \\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"encodeLZW =: 4 : 0\\n d=. ;/x\\n r=.0$0\\n wc=.w=.{.y\\n for_c. }.y do.\\n wc=.w,c\\n if. d e.~ <wc do. w=.wc else.\\n r=. r, d i.<w\\n d=.d,<wc\\n w=.c\\n end.\\n end.\\n r, d i.<w\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"decodeLZW =: 4 : 0\\n d=.;/x\\n w=.r=. >d{~{.y\\n ds=. #d\\n for_c. }.y do.\\n select. * c-ds\\n case. _1 do. r=.r,e=.>c{d\\n case. 0 do. r=.r,e=.w,{.w\\n case. do. 'error' return.\\n end.\\n d=.d,< w,{.e\\n w=.e\\n ds=.ds+1\\n end.\\n ;r\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.*;\\n\\npublic class LZW {\\n /** Compress a string to a list of output symbols. */\\n public static List<Integer> compress(String uncompressed) {\\n // Build the dictionary.\\n int dictSize = 256;\\n Map<String,Integer> dictionary = new HashMap<String,Integer>();\\n for (int i = 0; i < 256; i++)\\n dictionary.put(\\\"\\\" + (char)i, i);\\n\\n String w = \\\"\\\";\\n List<Integer> result = new ArrayList<Integer>();\\n for (char c : uncompressed.toCharArray()) {\\n String wc = w + c;\\n if (dictionary.containsKey(wc))\\n w = wc;\\n else {\\n result.add(dictionary.get(w));\\n // Add wc to the dictionary.\\n dictionary.put(wc, dictSize++);\\n w = \\\"\\\" + c;\\n }\\n }\\n\\n // Output the code for w.\\n if (!w.equals(\\\"\\\"))\\n result.add(dictionary.get(w));\\n return result;\\n }\\n\\n /** Decompress a list of output ks to a string. */\\n public static String decompress(List<Integer> compressed) {\\n // Build the dictionary.\\n int dictSize = 256;\\n Map<Integer,String> dictionary = new HashMap<Integer,String>();\\n for (int i = 0; i < 256; i++)\\n dictionary.put(i, \\\"\\\" + (char)i);\\n\\n String w = \\\"\\\" + (char)(int)compressed.remove(0);\\n StringBuffer result = new StringBuffer(w);\\n for (int k : compressed) {\\n String entry;\\n if (dictionary.containsKey(k))\\n entry = dictionary.get(k);\\n else if (k == dictSize)\\n entry = w + w.charAt(0);\\n else\\n throw new IllegalArgumentException(\\\"Bad compressed k: \\\" + k);\\n\\n result.append(entry);\\n\\n // Add w+entry[0] to the dictionary.\\n dictionary.put(dictSize++, w + entry.charAt(0));\\n\\n w = entry;\\n }\\n return result.toString();\\n }\\n\\n public static void main(String[] args) {\\n List<Integer> compressed = compress(\\\"TOBEORNOTTOBEORTOBEORNOT\\\");\\n System.out.println(compressed);\\n String decompressed = decompress(compressed);\\n System.out.println(decompressed);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"[84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263]\\nTOBEORNOTTOBEORTOBEORNOT\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"//LZW Compression/Decompression for Strings\\nvar LZW = {\\n compress: function (uncompressed) {\\n \\\"use strict\\\";\\n // Build the dictionary.\\n var i,\\n dictionary = {},\\n c,\\n wc,\\n w = \\\"\\\",\\n result = [],\\n dictSize = 256;\\n for (i = 0; i < 256; i += 1) {\\n dictionary[String.fromCharCode(i)] = i;\\n }\\n\\n for (i = 0; i < uncompressed.length; i += 1) {\\n c = uncompressed.charAt(i);\\n wc = w + c;\\n //Do not use dictionary[wc] because javascript arrays\\n //will return values for array['pop'], array['push'] etc\\n // if (dictionary[wc]) {\\n if (dictionary.hasOwnProperty(wc)) {\\n w = wc;\\n } else {\\n result.push(dictionary[w]);\\n // Add wc to the dictionary.\\n dictionary[wc] = dictSize++;\\n w = String(c);\\n }\\n }\\n\\n // Output the code for w.\\n if (w !== \\\"\\\") {\\n result.push(dictionary[w]);\\n }\\n return result;\\n },\\n\\n\\n decompress: function (compressed) {\\n \\\"use strict\\\";\\n // Build the dictionary.\\n var i,\\n dictionary = [],\\n w,\\n result,\\n k,\\n entry = \\\"\\\",\\n dictSize = 256;\\n for (i = 0; i < 256; i += 1) {\\n dictionary[i] = String.fromCharCode(i);\\n }\\n\\n w = String.fromCharCode(compressed[0]);\\n result = w;\\n for (i = 1; i < compressed.length; i += 1) {\\n k = compressed[i];\\n if (dictionary[k]) {\\n entry = dictionary[k];\\n } else {\\n if (k === dictSize) {\\n entry = w + w.charAt(0);\\n } else {\\n return null;\\n }\\n }\\n\\n result += entry;\\n\\n // Add w+entry[0] to the dictionary.\\n dictionary[dictSize++] = w + entry.charAt(0);\\n\\n w = entry;\\n }\\n return result;\\n }\\n}, // For Test Purposes\\n comp = LZW.compress(\\\"TOBEORNOTTOBEORTOBEORNOT\\\"),\\n decomp = LZW.decompress(comp);\\ndocument.write(comp + '<br>' + decomp);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"'use strict';\\n/**\\n Namespace for LZW compression and decompression.\\n Methods:\\n LZW.compress(uncompressed)\\n LZW.decompress(compressed)\\n*/\\nclass LZW\\n{\\n /**\\n Perform the LZW compression\\n uncompressed - String. The string on which to perform the compression.\\n */\\n static compress(uncompressed)\\n {\\n // Initialize dictionary\\n let dictionary = {};\\n for (let i = 0; i < 256; i++)\\n {\\n dictionary[String.fromCharCode(i)] = i;\\n }\\n\\n let word = '';\\n let result = [];\\n let dictSize = 256;\\n\\n for (let i = 0, len = uncompressed.length; i < len; i++)\\n {\\n let curChar = uncompressed[i];\\n let joinedWord = word + curChar;\\n\\n // Do not use dictionary[joinedWord] because javascript objects\\n // will return values for myObject['toString']\\n if (dictionary.hasOwnProperty(joinedWord))\\n {\\n word = joinedWord;\\n }\\n else\\n {\\n result.push(dictionary[word]);\\n // Add wc to the dictionary.\\n dictionary[joinedWord] = dictSize++;\\n word = curChar;\\n }\\n }\\n\\n if (word !== '')\\n {\\n result.push(dictionary[word]);\\n }\\n\\n return result;\\n }\\n\\n /**\\n Decompress LZW array generated by LZW.compress()\\n compressed - Array. The array that holds LZW compressed data.\\n */\\n static decompress(compressed)\\n {\\n // Initialize Dictionary (inverse of compress)\\n let dictionary = {};\\n for (let i = 0; i < 256; i++)\\n {\\n dictionary[i] = String.fromCharCode(i);\\n }\\n\\n let word = String.fromCharCode(compressed[0]);\\n let result = word;\\n let entry = '';\\n let dictSize = 256;\\n\\n for (let i = 1, len = compressed.length; i < len; i++)\\n {\\n let curNumber = compressed[i];\\n\\n if (dictionary[curNumber] !== undefined)\\n {\\n entry = dictionary[curNumber];\\n }\\n else\\n {\\n if (curNumber === dictSize)\\n {\\n entry = word + word[0];\\n }\\n else\\n {\\n throw 'Error in processing';\\n return null;\\n }\\n }\\n\\n result += entry;\\n\\n // Add word + entry[0] to dictionary\\n dictionary[dictSize++] = word + entry[0];\\n\\n word = entry;\\n }\\n\\n return result;\\n }\\n}\\n\\nlet comp = LZW.compress('TOBEORNOTTOBEORTOBEORNOT');\\nlet decomp = LZW.decompress(comp);\\n\\nconsole.log(`${comp}\\n${decomp}`);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# LZW compression/decompression for strings\\ndef lzw_compress:\\n def decode: [.] | implode;\\n # Build the dictionary:\\n 256 as $dictSize\\n | (reduce range(0; $dictSize) as $i ({}; .[ $i | decode ] = $i)) as $dictionary\\n | reduce explode[] as $i\\n ( [$dictionary, $dictSize, \\\"\\\", []]; # state: [dictionary, dictSize, w, result]\\n .[0] as $dictionary\\n | .[1] as $dictSize\\n | .[2] as $w\\n | ($i | decode) as $c\\n | ($w + $c ) as $wc\\n | if $dictionary[$wc] then .[2] = $wc\\n else\\n .[2] = $c # w = c\\n | .[3] += [$dictionary[$w]] # result += dictionary[w]\\n | .[0][$wc] = $dictSize # Add wc to the dictionary\\n | .[1] += 1 # dictSize ++\\n end\\n )\\n # Output the code for w unless w == \\\"\\\":\\n | if .[2] == \\\"\\\" then .[3]\\n else .[3] + [.[0][.[2]]]\\n end\\n;\\n\\ndef lzw_decompress:\\n def decode: [.] | implode;\\n # Build the dictionary - an array of strings\\n 256 as $dictSize\\n | (reduce range(0; $dictSize) as $i ([]; .[ $i ] = ($i|decode))) as $dictionary\\n | (.[0]|decode) as $w\\n | reduce .[1:][] as $k\\n ( [ $dictionary, $dictSize, $w, $w]; # state: [dictionary, dictSize, w, result]\\n .[0][$k] as $entry\\n | (if $entry then $entry\\n elif $k == .[1] then .[2] + .[2][0:1]\\n else error(\\\"lzw_decompress: k=\\\\($k)\\\")\\n end) as $entry\\n | .[3] += $entry # result += entry\\n | .[0][.[1]] = .[2] + $entry[0:1] # dictionary[dictSize] = w + entry.charAt(0);\\n | .[1] += 1 # dictSize++\\n | .[2] = $entry # w = entry\\n ) | .[3]\\n;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"\\\"TOBEORNOTTOBEORTOBEORNOT\\\" | lzw_compress| lzw_decompress\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function compressLZW(decompressed::String)\\n dictsize = 256\\n dict = Dict{String,Int}(string(Char(i)) => i for i in 0:dictsize)\\n result = Vector{Int}(undef, 0)\\n w = \\\"\\\"\\n for c in decompressed\\n wc = string(w, c)\\n if haskey(dict, wc)\\n w = wc\\n else\\n push!(result, dict[w])\\n dict[wc] = dictsize\\n dictsize += 1\\n w = string(c)\\n end\\n end\\n if !isempty(w) push!(result, dict[w]) end\\n return result\\nend\\n\\nfunction decompressLZW(compressed::Vector{Int})\\n dictsize = 256\\n dict = Dict{Int,String}(i => string('\\\\0' + i) for i in 0:dictsize)\\n result = IOBuffer()\\n w = string(Char(popfirst!(compressed)))\\n write(result, w)\\n for k in compressed\\n if haskey(dict, k)\\n entry = dict[k]\\n elseif k == dictsize\\n entry = string(w, w[1])\\n else\\n error(\\\"bad compressed k: $k\\\")\\n end\\n write(result, entry)\\n dict[dictsize] = string(w, entry[1])\\n dictsize += 1\\n w = entry\\n end\\n return String(take!(result))\\nend\\n\\noriginal = [\\\"0123456789\\\", \\\"TOBEORNOTTOBEORTOBEORNOT\\\", \\\"dudidudidudida\\\"]\\ncompressed = compressLZW.(original)\\ndecompressed = decompressLZW.(compressed)\\n\\nfor (word, comp, decomp) in zip(original, compressed, decompressed)\\n comprate = (length(word) - length(comp)) / length(word) * 100\\n println(\\\"Original: $word\\\\n-> Compressed: $comp (compr.rate: $(round(comprate, digits=2))%)\\\\n-> Decompressed: $decomp\\\")\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nobject Lzw {\\n /** Compress a string to a list of output symbols. */\\n fun compress(uncompressed: String): MutableList<Int> {\\n // Build the dictionary.\\n var dictSize = 256\\n val dictionary = mutableMapOf<String, Int>()\\n (0 until dictSize).forEach { dictionary.put(it.toChar().toString(), it)}\\n\\n var w = \\\"\\\"\\n val result = mutableListOf<Int>()\\n for (c in uncompressed) {\\n val wc = w + c\\n if (dictionary.containsKey(wc))\\n w = wc\\n else {\\n result.add(dictionary[w]!!)\\n // Add wc to the dictionary.\\n dictionary.put(wc, dictSize++)\\n w = c.toString()\\n }\\n }\\n\\n // Output the code for w\\n if (!w.isEmpty()) result.add(dictionary[w]!!)\\n return result\\n }\\n\\n /** Decompress a list of output symbols to a string. */\\n fun decompress(compressed: MutableList<Int>): String {\\n // Build the dictionary.\\n var dictSize = 256\\n val dictionary = mutableMapOf<Int, String>()\\n (0 until dictSize).forEach { dictionary.put(it, it.toChar().toString())}\\n\\n var w = compressed.removeAt(0).toChar().toString()\\n val result = StringBuilder(w)\\n for (k in compressed) {\\n var entry: String\\n if (dictionary.containsKey(k))\\n entry = dictionary[k]!!\\n else if (k == dictSize)\\n entry = w + w[0]\\n else\\n throw IllegalArgumentException(\\\"Bad compressed k: $k\\\")\\n result.append(entry)\\n\\n // Add w + entry[0] to the dictionary.\\n dictionary.put(dictSize++, w + entry[0])\\n w = entry\\n }\\n return result.toString()\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val compressed = Lzw.compress(\\\"TOBEORNOTTOBEORTOBEORNOT\\\")\\n println(compressed)\\n val decompressed = Lzw.decompress(compressed)\\n println(decompressed)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \" DIM LZW(1, 1)\\n DIM JDlzw(1)\\n DIM JDch$(1)\\n LET maxBits = 20 ' maximum bit width of the dictionary: minimum=12; maximum=21\\n LET resetDictionary = 1 ' flag to reset the dictionary when it gets full: 1=TRUE; 0=FALSE\\n LET printDictionary = 0 ' output encoding and decoding dictionaries to files\\n LET maxChunkSize = 2 ^ 14 ' maximum size of the data buffer\\n LET dSize = 2 ^ maxBits ' maximum dictionary size\\n LET JDext$ = \\\".lzw\\\" ' file extension used for created archives\\n FILEDIALOG \\\"Select a file to test LZW...\\\", \\\"*.*\\\", inputName$\\n IF inputName$ = \\\"\\\" THEN END\\n DO ' get fullPath\\\\ and fileName.ext\\n P = X\\n X = INSTR(inputName$, \\\"\\\\\\\", (X + 1))\\n LOOP UNTIL X = 0\\n filePath$ = LEFT$(inputName$, P)\\n fileName$ = MID$(inputName$, (P + 1))\\n DO ' get fileName and .ext\\n P = X\\n X = INSTR(fileName$, \\\".\\\", (X + 1))\\n LOOP UNTIL X = 0\\n fileExt$ = MID$(fileName$, P)\\n fileName$ = LEFT$(fileName$, (P - 1))\\n\\n GOSUB [lzwEncode]\\n GOSUB [lzwDecode]\\n\\n END\\n\\n''''''''''''''''''''''''''''''''''''''''\\n' Start LZW Encoder ''''''''''''''''''''\\n[lzwEncode]\\n REDIM LZW(dSize, 4)\\n LET EMPTY=-1:PREFIX=0:BYTE=1:FIRST=2:LESS=3:MORE=4:bmxCorrect=1\\n LET bitsRemain=0:remainIndex=0:tagCount=0:currentBitSize=8:fileTag$=\\\"\\\"\\n FOR dNext = 0 TO 255 ' initialize dictionary for LZW\\n ' LZW(dNext, PREFIX) = EMPTY ' prefix index of '<index>' <B>\\n ' LZW(dNext, BYTE) = dNext ' byte value of <index> '<B>'\\n LZW(dNext, FIRST) = EMPTY ' first index to use <index><B> as prefix\\n ' LZW(dNext, LESS) = EMPTY ' lesser index of binary search tree for <B>\\n ' LZW(dNext, MORE) = EMPTY ' greater index of binary search tree for <B>\\n NEXT dNext\\n OPEN inputName$ FOR INPUT AS #lzwIN\\n IF LOF(#lzwIN) < 2 THEN\\n CLOSE #lzwIN\\n END\\n END IF\\n OPEN fileName$ + fileExt$ + JDext$ FOR OUTPUT AS #lzwOUT\\n GOSUB [StartFileChunk]\\n chnkPoint = 1\\n IF maxBits < 12 THEN maxBits = 12\\n IF maxBits > 21 THEN maxBits = 21\\n settings = maxBits - 12 ' setting for dictionary size; 1st decimal +12\\n IF resetDictionary THEN settings = settings + 100 ' setting for dictionary type; 2nd decimal even=static, odd=adaptive\\n #lzwOUT, CHR$(settings); ' save settings as 1st byte of output\\n orgIndex = ASC(LEFT$(fileChunk$, 1)) ' read 1st byte into <index>\\n WHILE fileChunk$ <> \\\"\\\" ' while the buffer is not empty\\n DO ' begin the main encoder loop\\n chnkPoint = chnkPoint + 1\\n savIndex = FIRST ' initialize the save-to index\\n prvIndex = orgIndex ' initialize the previous index in search\\n newByte = ASC(MID$(fileChunk$, chnkPoint, 1)) ' read <B>\\n dSearch = LZW(orgIndex, FIRST) ' first search index for this <index> in the dictionary\\n WHILE (dSearch > EMPTY) ' while <index> is present in the dictionary\\n IF LZW(dSearch, BYTE) = newByte THEN EXIT WHILE ' if <index><B> is found\\n IF newByte < LZW(dSearch, BYTE) THEN ' else if new <B> is less than <index><B>\\n savIndex = LESS ' follow lesser binary tree\\n ELSE\\n savIndex = MORE ' else follow greater binary tree\\n END IF\\n prvIndex = dSearch ' set previous <index>\\n dSearch = LZW(dSearch, savIndex) ' read next search <index> from binary tree\\n WEND\\n IF dSearch = EMPTY THEN ' if <index><B> was not found in the dictionary\\n GOSUB [WriteIndex] ' write <index> to the output\\n IF dNext < dSize THEN ' save <index><B> into the dictionary\\n LZW(prvIndex, savIndex) = dNext\\n LZW(dNext, PREFIX) = orgIndex\\n LZW(dNext, BYTE) = newByte\\n LZW(dNext, FIRST) = EMPTY\\n LZW(dNext, LESS) = EMPTY\\n LZW(dNext, MORE) = EMPTY\\n IF dNext = (2 ^ currentBitSize) THEN currentBitSize = currentBitSize + 1\\n dNext = dNext + 1\\n ELSE ' else reset the dictionary... or maybe not\\n IF resetDictionary THEN\\n GOSUB [PrintEncode]\\n REDIM LZW(dSize, 4)\\n FOR dNext = 0 TO 255\\n LZW(dNext, FIRST) = EMPTY\\n NEXT dNext\\n currentBitSize = 8\\n bmxCorrect = 0\\n END IF\\n END IF\\n orgIndex = newByte ' set <index> = <B>\\n ELSE ' if <index><B> was found in the dictionary,\\n orgIndex = dSearch ' then set <index> = <index><B>\\n END IF\\n LOOP WHILE chnkPoint < chunk ' loop until the chunk has been processed\\n GOSUB [GetFileChunk] ' refill the buffer\\n WEND ' loop until the buffer is empty\\n GOSUB [WriteIndex]\\n IF bitsRemain > 0 THEN #lzwOUT, CHR$(remainIndex);\\n CLOSE #lzwOUT\\n CLOSE #lzwIN\\n IF bmxCorrect THEN ' correct the settings, if needed\\n IF (currentBitSize < maxBits) OR resetDictionary THEN\\n IF currentBitSize < 12 THEN currentBitSize = 12\\n OPEN fileName$ + fileExt$ + JDext$ FOR BINARY AS #lzwOUT\\n #lzwOUT, CHR$(currentBitSize - 12);\\n CLOSE #lzwOUT\\n END IF\\n END IF\\n GOSUB [PrintEncode]\\n REDIM LZW(1, 1)\\n RETURN\\n\\n[WriteIndex]\\n X = orgIndex ' add remaining bits to input\\n IF bitsRemain > 0 THEN X = remainIndex + (X * (2 ^ bitsRemain))\\n bitsRemain = bitsRemain + currentBitSize ' add current bit size to output stack\\n WHILE bitsRemain > 7 ' if 8 or more bits are to be written\\n #lzwOUT, CHR$(X MOD 256); ' attatch lower 8 bits to output string\\n X = INT(X / 256) ' shift input value down by 2^8\\n bitsRemain = bitsRemain - 8 ' adjust counters\\n WEND\\n remainIndex = X ' retain trailing bits for next write\\n RETURN\\n\\n' End LZW Encoder ''''''''''''''''''''''\\n''''''''''''''''''''''''''''''''''''''''\\n\\n[StartFileChunk]\\n sizeOfFile = LOF(#lzwIN) ' set EOF marker\\n bytesRemaining = sizeOfFile ' set EOF counter\\n chunk = maxChunkSize ' set max buffer size\\n[GetFileChunk]\\n fileChunk$ = \\\"\\\"\\n IF bytesRemaining < 1 THEN RETURN\\n IF chunk > bytesRemaining THEN chunk = bytesRemaining\\n bytesRemaining = bytesRemaining - chunk\\n fileChunk$ = INPUT$(#lzwIN, chunk)\\n chnkPoint = 0\\n RETURN\\n\\n''''''''''''''''''''''''''''''''''''''''\\n' Start LZW Decoder ''''''''''''''''''''\\n[lzwDecode]\\n LET EMPTY=-1:bitsRemain=0:tagCount=0:fileTag$=\\\"\\\"\\n OPEN fileName$ + fileExt$ + JDext$ FOR INPUT AS #lzwIN\\n OPEN fileName$ + \\\".Copy\\\" + fileExt$ FOR OUTPUT AS #lzwOUT\\n GOSUB [StartFileChunk]\\n chnkPoint = 2\\n settings = ASC(fileChunk$)\\n maxBits = VAL(RIGHT$(STR$(settings), 1)) + 12\\n dSize = 2 ^ maxBits\\n IF settings > 99 THEN resetDictionary = 1\\n GOSUB [ResetLZW]\\n oldIndex = orgIndex\\n WHILE fileChunk$ <> \\\"\\\"\\n ' decode current index and write to file\\n GOSUB [GetIndex]\\n IF JDch$(orgIndex) = \\\"\\\" THEN\\n tmpIndex = oldIndex\\n tmp$ = JDch$(tmpIndex)\\n WHILE JDlzw(tmpIndex) > EMPTY\\n tmpIndex = JDlzw(tmpIndex)\\n tmp$ = JDch$(tmpIndex) + tmp$\\n WEND\\n tmp$ = tmp$ + LEFT$(tmp$, 1)\\n ELSE\\n tmpIndex = orgIndex\\n tmp$ = JDch$(tmpIndex)\\n WHILE JDlzw(tmpIndex) > EMPTY\\n tmpIndex = JDlzw(tmpIndex)\\n tmp$ = JDch$(tmpIndex) + tmp$\\n WEND\\n END IF\\n #lzwOUT, tmp$;\\n ' add next dictionary entry or reset dictionary\\n IF dNext < dSize THEN\\n JDlzw(dNext) = oldIndex\\n JDch$(dNext) = LEFT$(tmp$, 1)\\n dNext = dNext + 1\\n IF dNext = (2 ^ currentBitSize) THEN\\n IF maxBits > currentBitSize THEN\\n currentBitSize = currentBitSize + 1\\n ELSE\\n IF resetDictionary THEN\\n GOSUB [PrintDecode]\\n GOSUB [ResetLZW]\\n END IF\\n END IF\\n END IF\\n END IF\\n oldIndex = orgIndex\\n WEND\\n CLOSE #lzwOUT\\n CLOSE #lzwIN\\n GOSUB [PrintDecode]\\n REDIM JDlzw(1)\\n REDIM JDch$(1)\\n RETURN\\n\\n[GetIndex]\\n byteCount = 0:orgIndex = 0\\n bitsToGrab = currentBitSize - bitsRemain\\n IF bitsRemain > 0 THEN\\n orgIndex = lastByte\\n byteCount = 1\\n END IF\\n WHILE bitsToGrab > 0\\n lastByte = ASC(MID$(fileChunk$, chnkPoint, 1))\\n orgIndex = orgIndex + (lastByte * (2 ^ (byteCount * 8)))\\n IF chnkPoint = chunk THEN GOSUB [GetFileChunk]\\n chnkPoint = chnkPoint + 1\\n byteCount = byteCount + 1\\n bitsToGrab = bitsToGrab - 8\\n WEND\\n IF bitsRemain > 0 THEN orgIndex = orgIndex / (2 ^ (8 - bitsRemain))\\n orgIndex = orgIndex AND ((2 ^ currentBitSize) - 1)\\n bitsRemain = bitsToGrab * (-1)\\n RETURN\\n\\n[ResetLZW]\\n REDIM JDlzw(dSize)\\n REDIM JDch$(dSize)\\n FOR dNext = 0 TO 255\\n JDlzw(dNext) = EMPTY ' Prefix index\\n JDch$(dNext) = CHR$(dNext) ' New byte value\\n NEXT dNext\\n currentBitSize = 8\\n GOSUB [GetIndex]\\n #lzwOUT, JDch$(orgIndex);\\n currentBitSize = 9\\n RETURN\\n\\n' End LZW Decoder ''''''''''''''''''''''\\n''''''''''''''''''''''''''''''''''''''''\\n\\n''''''''''''''''''''''''''''''''''''''''\\n[PrintEncode]\\n IF printDictionary < 1 THEN RETURN\\n OPEN \\\"Encode_\\\" + fileTag$ + fileName$ + \\\".txt\\\" FOR OUTPUT AS #dictOUT\\n FOR X = 0 TO 255\\n LZW(X, PREFIX) = EMPTY\\n LZW(X, BYTE) = X\\n NEXT X\\n FOR X = dNext TO 0 STEP -1\\n tmpIndex = X\\n tmp$ = CHR$(LZW(tmpIndex, BYTE))\\n WHILE LZW(tmpIndex, PREFIX) > EMPTY\\n tmpIndex = LZW(tmpIndex, PREFIX)\\n tmp$ = CHR$(LZW(tmpIndex, BYTE)) + tmp$\\n WEND\\n #dictOUT, X; \\\":\\\"; tmp$\\n NEXT X\\n CLOSE #dictOUT\\n tagCount = tagCount + 1\\n fileTag$ = STR$(tagCount) + \\\"_\\\"\\n RETURN\\n\\n[PrintDecode]\\n IF printDictionary < 1 THEN RETURN\\n OPEN \\\"Decode_\\\" + fileTag$ + fileName$ + \\\".txt\\\" FOR OUTPUT AS #dictOUT\\n FOR X = dNext TO 0 STEP -1\\n tmpIndex = X\\n tmp$ = JDch$(tmpIndex)\\n WHILE JDlzw(tmpIndex) > EMPTY\\n tmpIndex = JDlzw(tmpIndex)\\n tmp$ = JDch$(tmpIndex) + tmp$\\n WEND\\n #dictOUT, X; \\\":\\\"; tmp$\\n NEXT X\\n CLOSE #dictOUT\\n tagCount = tagCount + 1\\n fileTag$ = STR$(tagCount) + \\\"_\\\"\\n RETURN\\n''''''''''''''''''''''''''''''''''''''''\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"local function compress(uncompressed) -- string\\n local dictionary, result, dictSize, w, c = {}, {}, 255, \\\"\\\"\\n for i = 0, 255 do\\n dictionary[string.char(i)] = i\\n end\\n for i = 1, #uncompressed do\\n c = string.sub(uncompressed, i, i)\\n if dictionary[w .. c] then\\n w = w .. c\\n else\\n table.insert(result, dictionary[w])\\n dictSize = dictSize + 1\\n dictionary[w .. c] = dictSize\\n w = c\\n end\\n end\\n if w ~= \\\"\\\" then\\n table.insert(result, dictionary[w])\\n end\\n return result\\nend\\n\\nlocal function decompress(compressed) -- table\\n local dictionary, dictSize, entry, w, k = {}, 256, \\\"\\\", string.char(compressed[1])\\n local result = {w}\\n for i = 0, 255 do\\n dictionary[i] = string.char(i)\\n end\\n for i = 2, #compressed do\\n k = compressed[i]\\n if dictionary[k] then\\n entry = dictionary[k]\\n elseif k == dictSize then\\n entry = w .. string.sub(w, 1, 1)\\n else\\n return nil, i\\n end\\n table.insert(result, entry)\\n dictionary[dictSize] = w .. string.sub(entry, 1, 1)\\n dictSize = dictSize + 1\\n w = entry\\n end\\n return table.concat(result)\\nend\\n\\nlocal example = \\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\nlocal com = compress(example)\\nlocal dec = decompress(com)\\nprint(table.concat(com, \\\", \\\"))\\nprint(dec)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module BBCtrans {\\n \\\\\\\\ LZW compression\\n plaintext$=\\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\n Function encodeLZW$(i$) {\\n Def long c, d, i, l, o$, w$\\n DIM dict$(0 to 4095)\\n FOR i = 0 TO 255 : dict$(i) = CHR$(i) : NEXT i\\n l = i\\n i = 1\\n w$ = LEFT$(i$,1)\\n REPEAT{\\n d = 0\\n REPEAT {\\n c = d\\n IF i > LEN(i$) THEN EXIT\\n FOR d = 1 TO l-1\\n IF w$ = dict$(d) THEN EXIT\\n NEXT d\\n IF d < l Then i += 1 : w$ += MID$(i$, i, 1)\\n } UNTIL d >= l\\n dict$(l) = w$ : l += 1 : w$ = RIGHT$(w$, 1)\\n o$ += CHR$(c MOD 256) + CHR$(c DIV 256)\\n } UNTIL i > LEN(i$)\\n = o$\\n }\\n encodeLZW$ = encodeLZW$(plaintext$)\\n FOR i = 1 TO LEN(encodeLZW$) STEP 2\\n PRINT ASC(MID$(encodeLZW$,i)) + 256*ASC(MID$(encodeLZW$,i+1));\\\" \\\";\\n NEXT i\\n Print\\n Function decodeLZW$(i$) {\\n Def c, i, l, o$, t$, w$\\n DIM dict$(0 to 4095)\\n FOR i = 0 TO 255 : dict$(i) = CHR$(i) : NEXT i\\n l = i\\n c = ASC(i$) + 256*ASC(MID$(i$,2))\\n w$ = dict$(c)\\n o$ = w$\\n IF LEN(i$) < 4 THEN = o$\\n FOR i = 3 TO LEN(i$) STEP 2\\n c = ASC(MID$(i$,i)) + 256*ASC(MID$(i$,i+1))\\n IF c < l Then { t$ = dict$(c) } ELSE t$ = w$ + LEFT$(w$,1)\\n o$ += t$\\n dict$(l) = w$ + LEFT$(t$,1)\\n l += 1\\n w$ = t$\\n NEXT i\\n = o$\\n }\\n Print decodeLZW$(encodeLZW$)\\n}\\nBBCtrans\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Module FastM2000 {\\n plaintext$=\\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\n Function encodeLZW$(i$) {\\n Def long c, d, i, l, o$, w$\\n Inventory dict\\n For i = 0 to 255 {Append dict , Chr$(i):=i}\\n l = i\\n i = 1\\n w$ = LEFT$(i$,1)\\n REPEAT{\\n d = 0\\n Repeat {\\n c = d\\n IF i > Len(i$) Then Exit\\n if exist(dict, w$) Then {\\n d=eval(dict)\\n } Else Append dict, w$:=l: Exit\\n if d<l Then i += 1 : w$ += Mid$(i$, i, 1)\\n } Until d >= l\\n l += 1 : w$ = Right$(w$, 1)\\n o$ += Chr$(c Mod 256) + Chr$(c div 256)\\n } Until i > Len(i$)\\n = o$\\n }\\n encodeLZW$ = encodeLZW$(plaintext$)\\n Document Doc$\\n For i = 1 to Len(encodeLZW$) STEP 2\\n Doc$= Str$(Asc(Mid$(encodeLZW$,i)) + 256*Asc(Mid$(encodeLZW$,i+1)))\\n Next i\\n Doc$={\\n }\\n Function decodeLZW$(i$) {\\n Def c, i, l, o$, t$, w$\\n Inventory Dict\\n For i = 0 to 255 {Append dict , i:=chr$(i)}\\n l = i\\n c = Asc(i$) + 256*Asc(Mid$(i$,2))\\n w$ = dict$(c)\\n o$ = w$\\n IF Len(i$) < 4 Then = o$\\n For i = 3 to Len(i$) STEP 2 {\\n c = Asc(Mid$(i$,i)) + 256*Asc(Mid$(i$,i+1))\\n IF c < l Then {\\n t$ = dict$(c)\\n } Else t$ = w$ + LEFT$(w$,1)\\n o$ += t$\\n Append dict, l:=w$ + LEFT$(t$,1)\\n l += 1 : w$ = t$\\n }\\n = o$\\n }\\n Doc$=decodeLZW$(encodeLZW$)+{\\n }\\n Clipboard Doc$\\n Report Doc$\\n}\\nFastM2000\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"compress[uncompressed_] :=\\n Module[{dictsize, dictionary, w, result, wc},\\n dictsize = 256;\\n dictionary = # -> # & /@ FromCharacterCode /@ Range@dictsize;\\n w = \\\"\\\";\\n result = {};\\n Do[wc = w <> c;\\n If[MemberQ[dictionary[[All, 1]], wc],\\n w = wc,\\n AppendTo[result, w /. dictionary];\\n AppendTo[dictionary, wc -> dictsize];\\n dictsize++;\\n w = c],\\n {c, Characters[uncompressed]}];\\n AppendTo[result, w /. dictionary];\\n result];\\ndecompress::bc = \\\"Bad compressed `1`\\\";\\ndecompress[compressed_] :=\\n Module[{dictsize, dictionary, w, result, entry},\\n dictsize = 256;\\n dictionary = # -> # & /@ FromCharacterCode /@ Range@dictsize;\\n w = result = compressed[[1]];\\n Do[Which[MemberQ[dictionary[[All, 1]], k],\\n entry = k /. dictionary,\\n k == dictsize,\\n entry = w <> StringTake[w, 1],\\n True,\\n Message[decompress::bc, k]];\\n result = result <> entry;\\n AppendTo[dictionary, dictsize -> w <> StringTake[entry, 1]];\\n dictsize++;\\n w = entry,\\n {k, compressed[[2 ;;]]}];\\n result];\\n(*How to use:*)\\ncompress[\\\"TOBEORNOTTOBEORTOBEORNOT\\\"]\\ndecompress[%]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import tables\\n\\nproc compress*(uncompressed: string): seq[int] =\\n\\n # Build the dictionary.\\n var dictionary: Table[string, int]\\n for i in 0..255: dictionary[$chr(i)] = i\\n\\n var w = \\\"\\\"\\n for c in uncompressed:\\n var wc = w & c\\n if wc in dictionary:\\n w = wc\\n else:\\n # Writes \\\"w\\\" to output.\\n result.add dictionary[w]\\n # \\\"wc\\\" is a new sequence: add it to the dictionary.\\n dictionary[wc] = dictionary.len\\n w = $c\\n\\n # Write remaining output if necessary.\\n if w.len > 0: result.add dictionary[w]\\n\\n\\nproc decompress*(compressed: var seq[int]): string =\\n\\n # Build the dictionary.\\n var dictionary: Table[int, string]\\n for i in 0..255: dictionary[i] = $chr(i)\\n\\n var w = dictionary[compressed[0]]\\n compressed.delete(0)\\n\\n result = w\\n for k in compressed:\\n var entry: string\\n if k in dictionary:\\n entry = dictionary[k]\\n elif k == dictionary.len:\\n entry = w & w[0]\\n else:\\n raise newException(ValueError, \\\"Bad compressed k: \\\" & $k)\\n result.add entry\\n # New sequence: add it to the dictionary.\\n dictionary[dictionary.len] = w & entry[0]\\n w = entry\\n\\n\\nwhen isMainModule:\\n var compressed = compress(\\\"TOBEORNOTTOBEORTOBEORNOT\\\")\\n echo compressed\\n var decompressed = decompress(compressed)\\n echo decompressed\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use Collection;\\n\\nclass LZW {\\n function : Main(args : String[]) ~ Nil {\\n compressed := Compress(\\\"TOBEORNOTTOBEORTOBEORNOT\\\");\\n Show(compressed);\\n decompressed := Decompress(compressed);\\n decompressed->PrintLine();\\n }\\n\\n function : native : Compress(uncompressed : String) ~ IntVector {\\n # Build the dictionary.\\n dictSize := 256;\\n dictionary := StringMap->New();\\n for (i := 0; i < 256; i+=1;) {\\n key := \\\"\\\";\\n key->Append(i->As(Char));\\n dictionary->Insert(key, IntHolder->New(i));\\n };\\n\\n w := \\\"\\\";\\n result := IntVector->New();\\n\\n each (i : uncompressed) {\\n c := uncompressed->Get(i);\\n wc := String->New(w);\\n wc->Append(c);\\n if (dictionary->Has(wc)) {\\n w := wc;\\n }\\n else {\\n value := dictionary->Find(w)->As(IntHolder);\\n result->AddBack(value->Get());\\n # Add wc to the dictionary.\\n dictionary->Insert(wc, IntHolder->New(dictSize));\\n dictSize+=1;\\n w := \\\"\\\";\\n w->Append(c);\\n };\\n };\\n\\n # Output the code for w.\\n if (w->Size() > 0) {\\n value := dictionary->Find(w)->As(IntHolder);\\n result->AddBack(value->Get());\\n };\\n\\n return result;\\n }\\n\\n function : Decompress(compressed : IntVector) ~ String {\\n # Build the dictionary.\\n dictSize := 256;\\n dictionary := IntMap->New();\\n for (i := 0; i < 256; i+=1;) {\\n value := \\\"\\\";\\n value->Append(i->As(Char));\\n dictionary->Insert(i, value);\\n };\\n\\n w := \\\"\\\";\\n found := compressed->Remove(0);\\n w->Append(found->As(Char));\\n\\n result := String->New(w);\\n each (i : compressed) {\\n k := compressed->Get(i);\\n\\n entry : String;\\n if (dictionary->Has(k)) {\\n entry := dictionary->Find(k);\\n }\\n else if (k = dictSize) {\\n entry := String->New(w);\\n entry->Append(w->Get(0));\\n }\\n else {\\n return \\\"\\\";\\n };\\n result->Append(entry);\\n\\n # Add w+entry[0] to the dictionary.\\n value := String->New(w);\\n value->Append(entry->Get(0));\\n dictionary->Insert(dictSize, value);\\n dictSize+=1;\\n\\n w := entry;\\n };\\n\\n return result;\\n }\\n\\n function : Show(results : IntVector) ~ Nil {\\n \\\"[\\\"->Print();\\n each(i : results) {\\n results->Get(i)->Print();\\n if(i + 1 < results->Size()) {\\n \\\", \\\"->Print();\\n };\\n };\\n \\\"]\\\"->PrintLine();\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"#import <Foundation/Foundation.h>\\n#import <stdio.h>\\n\\n@interface LZWCompressor : NSObject\\n{\\n @private\\n NSMutableArray *iostream;\\n NSMutableDictionary *dict;\\n NSUInteger codemark;\\n}\\n\\n-(instancetype) init;\\n-(instancetype) initWithArray: (NSMutableArray *) stream;\\n-(BOOL) compressData: (NSData *) string;\\n-(void) setArray: (NSMutableArray *) stream;\\n-(NSArray *) getArray;\\n@end\\n\\n@implementation LZWCompressor : NSObject\\n\\n-(instancetype) init\\n{\\n self = [super init];\\n if ( self )\\n {\\n iostream = nil;\\n codemark = 256;\\n dict = [[NSMutableDictionary alloc] initWithCapacity: 512];\\n }\\n return self;\\n}\\n\\n-(instancetype) initWithArray: (NSMutableArray *) stream\\n{\\n self = [self init];\\n if ( self )\\n {\\n [self setArray: stream];\\n }\\n return self;\\n}\\n\\n-(void) setArray: (NSMutableArray *) stream\\n{\\n iostream = stream;\\n}\\n\\n-(BOOL) compressData: (NSData *) string;\\n{\\n // prepare dict\\n for(NSUInteger i=0; i < 256; i++)\\n {\\n unsigned char j = i;\\n NSData *s = [NSData dataWithBytes: &j length: 1];\\n dict[s] = @(i);\\n }\\n\\n NSData *w = [NSData data];\\n\\n for(NSUInteger i=0; i < [string length]; i++)\\n {\\n NSMutableData *wc = [NSMutableData dataWithData: w];\\n [wc appendData: [string subdataWithRange: NSMakeRange(i, 1)]];\\n if ( dict[wc] != nil )\\n {\\n w = wc;\\n } else {\\n [iostream addObject: dict[w]];\\n dict[wc] = @(codemark);\\n codemark++;\\n w = [string subdataWithRange: NSMakeRange(i, 1)];\\n }\\n }\\n if ( [w length] != 0 )\\n {\\n [iostream addObject: dict[w]];\\n }\\n return YES;\\n}\\n\\n-(NSArray *) getArray\\n{\\n return iostream;\\n}\\n\\n@end\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"NSString *text = @\\\"TOBEORNOTTOBEORTOBEORNOT\\\";\\n\\nint main()\\n{\\n @autoreleasepool {\\n\\n NSMutableArray *array = [[NSMutableArray alloc] init];\\n LZWCompressor *lzw = [[LZWCompressor alloc]\\n initWithArray: array ];\\n if ( lzw )\\n {\\n [lzw compressData: [text dataUsingEncoding: NSUTF8StringEncoding]];\\n for ( id obj in array )\\n {\\n printf(\\\"%u\\\\n\\\", [obj unsignedIntValue]);\\n }\\n }\\n\\n }\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"#directory \\\"+extlib\\\" (* or maybe \\\"+site-lib/extlib/\\\" *)\\n#load \\\"extLib.cma\\\"\\nopen ExtString\\n\\n(** compress a string to a list of output symbols *)\\nlet compress ~uncompressed =\\n (* build the dictionary *)\\n let dict_size = 256 in\\n let dictionary = Hashtbl.create 397 in\\n for i=0 to 255 do\\n let str = String.make 1 (char_of_int i) in\\n Hashtbl.add dictionary str i\\n done;\\n\\n let f = (fun (w, dict_size, result) c ->\\n let c = String.make 1 c in\\n let wc = w ^ c in\\n if Hashtbl.mem dictionary wc then\\n (wc, dict_size, result)\\n else\\n begin\\n (* add wc to the dictionary *)\\n Hashtbl.add dictionary wc dict_size;\\n let this = Hashtbl.find dictionary w in\\n (c, dict_size + 1, this::result)\\n end\\n ) in\\n let w, _, result =\\n String.fold_left f (\\\"\\\", dict_size, []) uncompressed\\n in\\n\\n (* output the code for w *)\\n let result =\\n if w = \\\"\\\"\\n then result\\n else (Hashtbl.find dictionary w) :: result\\n in\\n\\n (List.rev result)\\n;;\\n\\nexception ValueError of string\\n\\n(** decompress a list of output symbols to a string *)\\nlet decompress ~compressed =\\n (* build the dictionary *)\\n let dict_size = 256 in\\n let dictionary = Hashtbl.create 397 in\\n for i=0 to pred dict_size do\\n let str = String.make 1 (char_of_int i) in\\n Hashtbl.add dictionary i str\\n done;\\n\\n let w, compressed =\\n match compressed with\\n | hd::tl -> (String.make 1 (char_of_int hd)), tl\\n | [] -> failwith \\\"empty input\\\"\\n in\\n\\n let result = [w] in\\n\\n let result, _, _ =\\n List.fold_left (fun (result, w, dict_size) k ->\\n let entry =\\n if Hashtbl.mem dictionary k then\\n Hashtbl.find dictionary k\\n else if k = Hashtbl.length dictionary then\\n w ^ (String.make 1 w.[0])\\n else\\n raise(ValueError(Printf.sprintf \\\"Bad compressed k: %d\\\" k))\\n in\\n let result = entry :: result in\\n\\n (* add (w ^ entry.[0]) to the dictionary *)\\n Hashtbl.add dictionary dict_size (w ^ (String.make 1 entry.[0]));\\n (result, entry, dict_size + 1)\\n ) (result, w, dict_size) compressed\\n in\\n (List.rev result)\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"val compress : uncompressed:string -> int list\\nval decompress : compressed:int list -> string list\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let greatest = List.fold_left max 0 ;;\\n\\n(** number of bits needed to encode the integer m *)\\nlet n_bits m =\\n let m = float m in\\n let rec aux n =\\n let max = (2. ** n) -. 1. in\\n if max >= m then int_of_float n\\n else aux (n +. 1.0)\\n in\\n aux 1.0\\n;;\\n\\nlet write_compressed ~filename ~compressed =\\n let nbits = n_bits(greatest compressed) in\\n let oc = open_out filename in\\n output_byte oc nbits;\\n let ob = IO.output_bits(IO.output_channel oc) in\\n List.iter (IO.write_bits ob nbits) compressed;\\n IO.flush_bits ob;\\n close_out oc;\\n;;\\n\\nlet read_compressed ~filename =\\n let ic = open_in filename in\\n let nbits = input_byte ic in\\n let ib = IO.input_bits(IO.input_channel ic) in\\n let rec loop acc =\\n try\\n let code = IO.read_bits ib nbits in\\n loop (code::acc)\\n with _ -> List.rev acc\\n in\\n let compressed = loop [] in\\n let result = decompress ~compressed in\\n let buf = Buffer.create 2048 in\\n List.iter (Buffer.add_string buf) result;\\n (Buffer.contents buf)\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"(define (compress str)\\n(let loop ((dc (fold (lambda (f x) ; dictionary (simplest, not optimized), with reversed codes\\n (cons (list x) (cons x f)))\\n '() (iota 256)))\\n (w '()) ; output sequence (reversed)\\n (s 256) ; maximal dictionary code value + 1\\n (x '()) ; current sequence\\n (r (str-iter str))); input stream\\n (cond\\n ((null? r)\\n (reverse (cons (cadr (member x dc)) w)))\\n ((pair? r)\\n (let ((xy (cons (car r) x)))\\n (if (member xy dc)\\n (loop dc w s xy (cdr r))\\n (loop (cons xy (cons s dc)) ; update dictionary with xy . s\\n (cons (cadr (member x dc)) w) ; add code to output stream\\n (+ s 1) ; increase code\\n (list (car r)) ; new current sequence\\n (cdr r))))) ; next input\\n (else\\n (loop dc w s x (r)))))\\n)\\n\\n(print (compress \\\"TOBEORNOTTOBEORTOBEORNOT\\\")) ; => (84 79 66 69 79 82 78 79 84 256 258 260 265 259 261 263)\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"(define (decompress str)\\n(let loop ((dc (fold (lambda (f x) ; dictionary (simplest, not optimized), with reversed codes\\n (cons x (cons (list x) f)))\\n '() (iota 256)))\\n (w '()) ; output sequence (reversed)\\n (s 256) ; maximal dictionary code value + 1\\n (x '()) ; current symbols sequence\\n (r (str-iter str))); input stream\\n (cond\\n ((null? r)\\n (reverse w))\\n ((pair? r)\\n (let*((y (cadr (member (car r) dc)))\\n (xy (append y x)))\\n (if (member xy dc)\\n (loop dc (append y w) s xy (cdr r)) ; вряд ли такое будет...\\n (loop (cons s (cons xy dc)) ; update dictionary with xy . s\\n (append y w) ; add phrase to output stream\\n (+ s 1)\\n y ; new initial code\\n (cdr r))))) ; next input\\n (else\\n (loop dc w s x (r))))))\\n\\n(print (runes->string\\n (decompress (runes->string '(84 79 66 69 79 82 78 79 84 256 258 260 265 259 261 263)))))\\n; => TOBEORNOTTOBEORTOBEEORNOT\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"# Compress a string to a list of output symbols.\\nsub compress {\\n my $uncompressed = shift;\\n\\n # Build the dictionary.\\n my $dict_size = 256;\\n my %dictionary = map {chr $_ => chr $_} 0..$dict_size-1;\\n\\n my $w = \\\"\\\";\\n my @result;\\n foreach my $c (split '', $uncompressed) {\\n my $wc = $w . $c;\\n if (exists $dictionary{$wc}) {\\n $w = $wc;\\n } else {\\n push @result, $dictionary{$w};\\n # Add wc to the dictionary.\\n $dictionary{$wc} = $dict_size;\\n $dict_size++;\\n $w = $c;\\n }\\n }\\n\\n # Output the code for w.\\n if ($w) {\\n push @result, $dictionary{$w};\\n }\\n return @result;\\n}\\n\\n# Decompress a list of output ks to a string.\\nsub decompress {\\n my @compressed = @_;\\n\\n # Build the dictionary.\\n my $dict_size = 256;\\n my %dictionary = map {chr $_ => chr $_} 0..$dict_size-1;\\n\\n my $w = shift @compressed;\\n my $result = $w;\\n foreach my $k (@compressed) {\\n my $entry;\\n if (exists $dictionary{$k}) {\\n $entry = $dictionary{$k};\\n } elsif ($k == $dict_size) {\\n $entry = $w . substr($w,0,1);\\n } else {\\n die \\\"Bad compressed k: $k\\\";\\n }\\n $result .= $entry;\\n\\n # Add w+entry[0] to the dictionary.\\n $dictionary{$dict_size} = $w . substr($entry,0,1);\\n $dict_size++;\\n\\n $w = $entry;\\n }\\n return $result;\\n}\\n\\n# How to use:\\nmy @compressed = compress('TOBEORNOTTOBEORTOBEORNOT');\\nprint \\\"@compressed\\\\n\\\";\\nmy $decompressed = decompress(@compressed);\\nprint \\\"$decompressed\\\\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;\\\">compress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">uncompressed</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">dict</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">new_dict</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">result</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">dictSize</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">255</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">c</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">word</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;\\\">0</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">255</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">setd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"\\\"</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: #000000;\\\">dict</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;\\\">uncompressed</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">uncompressed</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: #7060A8;\\\">getd_index</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dict</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">word</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">c</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">result</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">getd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dict</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">dictSize</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #7060A8;\\\">setd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dictSize</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dict</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">word</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</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;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">result</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">getd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dict</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">destroy_dict</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dict</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">result</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;\\\">decompress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">compressed</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">dict</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">new_dict</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">dictSize</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">255</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ki</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">dent</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">result</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">word</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;\\\">0</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">255</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">setd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dict</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;\\\">compressed</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">compressed</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">ki</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">getd_index</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dict</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">ki</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">dent</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">getd_by_index</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ki</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dict</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">dictSize</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">dent</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004600;\\\">NULL</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: #000000;\\\">result</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">dent</span>\\n <span style=\\\"color: #7060A8;\\\">setd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dictSize</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">dent</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">dict</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">dictSize</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">word</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">dent</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">destroy_dict</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dict</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">result</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;\\\">example</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"TOBEORNOTTOBEORTOBEORNOT\\\"</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">com</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">compress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">example</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">com</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #004600;\\\">pp_IntCh</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">pp_Maxlen</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">90</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">decompress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">com</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"class LZW\\n{\\n function compress($unc) {\\n $i;$c;$wc;\\n $w = \\\"\\\";\\n $dictionary = array();\\n $result = array();\\n $dictSize = 256;\\n for ($i = 0; $i < 256; $i += 1) {\\n $dictionary[chr($i)] = $i;\\n }\\n for ($i = 0; $i < strlen($unc); $i++) {\\n $c = $unc[$i];\\n $wc = $w.$c;\\n if (array_key_exists($w.$c, $dictionary)) {\\n $w = $w.$c;\\n } else {\\n array_push($result,$dictionary[$w]);\\n $dictionary[$wc] = $dictSize++;\\n $w = (string)$c;\\n }\\n }\\n if ($w !== \\\"\\\") {\\n array_push($result,$dictionary[$w]);\\n }\\n return implode(\\\",\\\",$result);\\n }\\n\\n function decompress($com) {\\n $com = explode(\\\",\\\",$com);\\n $i;$w;$k;$result;\\n $dictionary = array();\\n $entry = \\\"\\\";\\n $dictSize = 256;\\n for ($i = 0; $i < 256; $i++) {\\n $dictionary[$i] = chr($i);\\n }\\n $w = chr($com[0]);\\n $result = $w;\\n for ($i = 1; $i < count($com);$i++) {\\n $k = $com[$i];\\n if (isset($dictionary[$k])) {\\n $entry = $dictionary[$k];\\n } else {\\n if ($k === $dictSize) {\\n $entry = $w.$w[0];\\n } else {\\n return null;\\n }\\n }\\n $result .= $entry;\\n $dictionary[$dictSize++] = $w . $entry[0];\\n $w = $entry;\\n }\\n return $result;\\n }\\n}\\n\\n//How to use\\n$str = 'TOBEORNOTTOBEORTOBEORNOT';\\n$lzw = new LZW();\\n$com = $lzw->compress($str);\\n$dec = $lzw->decompress($com);\\necho $com . \\\"<br>\\\" . $dec;\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"go =>\\n S = \\\"TOBEORNOTTOBEORTOBEORNOT\\\",\\n println(s=S),\\n println(len=S.length),\\n\\n Compressed = compress(S),\\n println(compressed=Compressed),\\n println(len=Compressed.length),\\n\\n Uncompressed = uncompress(Compressed),\\n println(uncompressed=Uncompressed),\\n\\n printf(\\\"compressed to %3.3f%%\\\\n\\\", 100*(Compressed.length / S.length)),\\n\\n if S = Uncompressed then\\n println(\\\"Same!\\\")\\n else\\n println(\\\"Error: S != Uncompressed!\\\"),\\n printf(\\\"S.length: %d Uncompressed.length: %d\\\\n\\\", S.length, Uncompressed.length),\\n edit(S,Uncompressed,Distance,Diffs),\\n println(distance=Distance),\\n println(diffs=Diffs)\\n end,\\n nl.\\n\\ncompress(Uncompressed) = Compressed =>\\n DictSize = 256,\\n Dict = new_map([C=C : I in 1..DictSize-1, C=chr(I).to_string()]),\\n W = \\\"\\\",\\n Result = [],\\n foreach(C in Uncompressed)\\n C := C.to_string(),\\n WC = W ++ C,\\n if Dict.has_key(WC) then\\n W := WC\\n else\\n Result := Result ++ [Dict.get(W)],\\n Dict.put(WC, DictSize),\\n DictSize := DictSize + 1,\\n W := C\\n end\\n end,\\n if W.length > 0 then\\n Result := Result ++ [Dict.get(W)]\\n end,\\n Compressed = Result.\\n\\nuncompress(Compressed) = Uncompressed =>\\n DictSize = 256,\\n Dict = new_map([ C=C : I in 1..DictSize-1, C=chr(I).to_string()]),\\n W = Compressed.first(),\\n Compressed := Compressed.tail(),\\n Result = W,\\n\\n Entry = \\\"\\\",\\n foreach(K in Compressed)\\n if Dict.has_key(K) then\\n Entry := Dict.get(K)\\n elseif K == DictSize then\\n Entry := W ++ W[1].to_string()\\n else\\n printf(\\\"Bad compressed K: %w\\\\n\\\", K)\\n end,\\n Result := Result ++ Entry,\\n Dict.put(DictSize,(W ++ Entry[1].to_string())),\\n DictSize := DictSize + 1,\\n W := Entry\\n end,\\n Uncompressed = Result.flatten().\\n\\n%\\n% Computing the minimal editing distance of two given lists\\n%\\ntable(+,+,min,-)\\nedit([],[],D,Diffs) => D=0, Diffs=[].\\nedit([X|Xs],[X|Ys],D,Diffs) => % copy\\n edit(Xs,Ys,D,Diffs).\\nedit(Xs,[Y|Ys],D,Diffs) ?=> % insert\\n edit(Xs,Ys,D1,Diffs1),\\n D=D1+1,\\n Diffs = [insert=Y,xPos=Xs.length,yPos=Ys.length|Diffs1].\\nedit([X|Xs],Ys,D,Diffs) => % delete\\n edit(Xs,Ys,D1,Diffs1),\\n D=D1+1,\\n Diffs = [[delete=X,xPos=Xs.length,yPos=Ys.length]|Diffs1].\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de lzwCompress (Lst)\\n (let (Codes 255 Dict)\\n (balance 'Dict\\n (make\\n (for C Codes\\n (link (cons (char C) C)) ) ) )\\n (make\\n (let W (pop 'Lst)\\n (for C Lst\\n (let WC (pack W C)\\n (if (lup Dict WC)\\n (setq W WC)\\n (link (cdr (lup Dict W)))\\n (idx 'Dict (cons WC (inc 'Codes)) T)\\n (setq W C) ) ) )\\n (and W (link (cdr (lup Dict W)))) ) ) ) )\\n\\n(de lzwDecompress (Lst)\\n (let (Codes 255 Dict)\\n (balance 'Dict\\n (make\\n (for C Codes\\n (link (list C (char C))) ) ) )\\n (make\\n (let W NIL\\n (for N Lst\\n (let WC (if (lup Dict N) (cdr @) (cons (last W) W))\\n (chain (reverse WC))\\n (when W\\n (idx 'Dict (cons (inc 'Codes) (cons (last WC) W)) T) )\\n (setq W WC) ) ) ) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"*process source xref attributes or(!);\\n lzwt: Proc Options(main);\\n\\n Dcl (LEFT,LENGTH,SUBSTR,TRANSLATE,TRIM,UNSPEC) Builtin;\\n Dcl SYSPRINT Print;\\n\\n Dcl str Char(50) Var Init('TOBEORNOTTOBEORTOBEORNOT');\\n Dcl compressed Char(80) Var;\\n Dcl decompressed Char(80) Var;\\n\\n Dcl 1 dict(0:300),\\n 2 key Char(5) Var,\\n 2 inx Bin Fixed(16) Unsigned;\\n Dcl dict_size Bin Fixed(31) Init(256);\\n Dcl hi Bin Fixed(16) Unsigned Init(65535);\\n\\n Put Edit('str=',str)(Skip,a,a);\\n compressed = compress(str);\\n Put Edit(compressed)(Skip,a);\\n decompressed = decompress(compressed);\\n Put Edit('dec=',decompressed)(Skip,a,a);\\n If decompressed=str Then\\n Put Edit('decompression ok')(Skip,a);\\n Else\\n Put Edit('decompression not ok')(Skip,a);\\n\\n compress: Proc(s) Returns(Char(80) Var);\\n Dcl s Char(*) Var;\\n Dcl res Char(80) Var;\\n Dcl i Bin Fixed(31);\\n Dcl c Char(1);\\n Dcl w Char(5) Var;\\n Dcl wc Char(5) Var;\\n dict.key='';\\n Dcl ii Bin Fixed(8) Unsigned;\\n Do i=0 To 255;\\n ii=i;\\n Unspec(c)=unspec(ii);\\n dict.key(i)=c;\\n dict.inx(i)=i;\\n End;\\n res='[';\\n w='';\\n Do i=1 To length(s);\\n c=substr(s,i,1);\\n wc=w!!c;\\n If dicti(wc)^=hi Then Do;\\n w=wc;\\n End;\\n Else Do;\\n res=res!!trim(dicti(w))!!', ';\\n Call dict_add(wc,dict_size);\\n w=c;\\n End;\\n End;\\n If w^='' Then\\n res=res!!trim(dicti(w))!!', ';\\n substr(res,length(res)-1,1)=']';\\n Return(res);\\n\\n dicti: Proc(needle) Returns(Bin Fixed(31));\\n Dcl needle Char(*) Var;\\n Dcl i Bin Fixed(31);\\n Do i=1 To dict_size;\\n If dict.key(i)=needle Then\\n Return(i);\\n End;\\n Return(hi);\\n End;\\n\\n dict_add: Proc(needle,dict_size);\\n Dcl needle Char(*) Var;\\n Dcl dict_size Bin Fixed(31);\\n dict.key(dict_size)=needle;\\n dict.inx(dict_size)=dict_size;\\n dict_size+=1;\\n End;\\n\\n End;\\n\\n decompress: Proc(s) Returns(Char(80) Var);\\n Dcl s Char(80) Var;\\n Dcl ss Char(80) Var;\\n Dcl words(50) Char(5) Var;\\n Dcl wn Bin Fixed(31);\\n Dcl ww Bin Fixed(31);\\n Dcl c Char(1);\\n Dcl entry Char(5) Var;\\n Dcl w Char(5) Var;\\n Dcl res Char(80) Var;\\n ss=translate(s,' ','[],');\\n Call mk_words(ss,words,wn);\\n dict.key='';\\n dict.inx=hi;\\n Dcl i Bin Fixed(31);\\n Dcl ii Bin Fixed(8) Unsigned;\\n Dcl dict(0:300) Char(5) Var;\\n Dcl dict_size Bin Fixed(31);\\n Do i=0 To 255;\\n ii=i;\\n Unspec(c)=unspec(ii);\\n dict(i)=c;\\n End;\\n dict_size=256;\\n ww=words(1);\\n w=dict(ww);\\n res=w;\\n Do i=2 To wn;\\n ww=words(i);\\n Select;\\n When(dict(ww)^='')\\n entry=dict(ww);\\n When(ww=dict_size)\\n entry=w!!substr(w,1,1);\\n Otherwise\\n Put Edit('Bad compressed k: ',ww)(Skip,a,a);\\n End;\\n res=res!!entry;\\n dict(dict_size)=w!!substr(entry,1,1);\\n dict_size+=1;\\n w=entry;\\n End;\\n Return(res);\\n End;\\n\\n mk_words: Proc(st,arr,arrn);\\n Dcl st Char(*) Var;\\n Dcl sv Char(80) Var;\\n Dcl arr(*) Char(5) Var;\\n Dcl arrn Bin fixed(31);\\n Dcl elem Char(5) Var;\\n arrn=0;\\n sv=st!!' ';\\n elem='';\\n Do While(length(sv)>0);\\n If left(sv,1)=' ' Then Do;\\n If elem>'' Then Do;\\n arrn+=1;\\n arr(arrn)=elem;\\n elem='';\\n End;\\n End;\\n Else\\n elem=elem!!left(sv,1);\\n sv=substr(sv,2);\\n End;\\n End;\\n Return;\\n\\n End;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"Procedure compress(uncompressed.s, List result.u())\\n ;Compress a string to a list of output symbols\\n\\n ;Build the dictionary.\\n Protected dict_size = 255, i\\n newmap dict.u()\\n For i = 0 To 254\\n dict(Chr(i + 1)) = i\\n Next\\n\\n Protected w.s, wc.s, *c.Character = @uncompressed\\n w = \\\"\\\"\\n LastElement(result())\\n While *c\\\\c <> #Null\\n wc = w + Chr(*c\\\\c)\\n If FindMapElement(dict(), wc)\\n w = wc\\n Else\\n AddElement(result())\\n result() = dict(w)\\n ;Add wc to the dictionary\\n dict(wc) = dict_size\\n dict_size + 1 ;no check is performed for overfilling the dictionary.\\n w = Chr(*c\\\\c)\\n EndIf\\n *c + 1\\n Wend\\n\\n ;Output the code for w\\n If w\\n AddElement(result())\\n result() = dict(w)\\n EndIf\\nEndProcedure\\n\\nProcedure.s decompress(List compressed.u())\\n ;Decompress a list of encoded values to a string\\n If ListSize(compressed()) = 0: ProcedureReturn \\\"\\\": EndIf\\n\\n ;Build the dictionary.\\n Protected dict_size = 255, i\\n\\n Dim dict.s(255)\\n For i = 1 To 255\\n dict(i - 1) = Chr(i)\\n Next\\n\\n Protected w.s, entry.s, result.s\\n FirstElement(compressed())\\n w = dict(compressed())\\n result = w\\n\\n i = 0\\n While NextElement(compressed())\\n i + 1\\n If compressed() < dict_size\\n entry = dict(compressed())\\n ElseIf i = dict_size\\n entry = w + Left(w, 1)\\n Else\\n MessageRequester(\\\"Error\\\",\\\"Bad compression at [\\\" + Str(i) + \\\"]\\\")\\n ProcedureReturn result;abort\\n EndIf\\n result + entry\\n ;Add w + Left(entry, 1) to the dictionary\\n If ArraySize(dict()) <= dict_size\\n Redim dict(dict_size + 256)\\n EndIf\\n dict(dict_size) = w + Left(entry, 1)\\n dict_size + 1 ;no check is performed for overfilling the dictionary.\\n\\n w = entry\\n Wend\\n ProcedureReturn result\\nEndProcedure\\n\\nIf OpenConsole()\\n ;How to use:\\n\\n Define initial.s, decompressed.s\\n\\n Print(\\\"Type something: \\\")\\n initial = Input()\\n NewList compressed.u()\\n compress(initial, compressed())\\n ForEach compressed()\\n Print(Str(compressed()) + \\\" \\\")\\n Next\\n PrintN(\\\"\\\")\\n\\n decompressed = decompress(compressed())\\n PrintN(decompressed)\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\")\\n Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"def compress(uncompressed):\\n \\\"\\\"\\\"Compress a string to a list of output symbols.\\\"\\\"\\\"\\n\\n # Build the dictionary.\\n dict_size = 256\\n dictionary = dict((chr(i), i) for i in range(dict_size))\\n # in Python 3: dictionary = {chr(i): i for i in range(dict_size)}\\n\\n w = \\\"\\\"\\n result = []\\n for c in uncompressed:\\n wc = w + c\\n if wc in dictionary:\\n w = wc\\n else:\\n result.append(dictionary[w])\\n # Add wc to the dictionary.\\n dictionary[wc] = dict_size\\n dict_size += 1\\n w = c\\n\\n # Output the code for w.\\n if w:\\n result.append(dictionary[w])\\n return result\\n\\n\\ndef decompress(compressed):\\n \\\"\\\"\\\"Decompress a list of output ks to a string.\\\"\\\"\\\"\\n from io import StringIO\\n\\n # Build the dictionary.\\n dict_size = 256\\n dictionary = dict((i, chr(i)) for i in range(dict_size))\\n # in Python 3: dictionary = {i: chr(i) for i in range(dict_size)}\\n\\n # use StringIO, otherwise this becomes O(N^2)\\n # due to string concatenation in a loop\\n result = StringIO()\\n w = chr(compressed.pop(0))\\n result.write(w)\\n for k in compressed:\\n if k in dictionary:\\n entry = dictionary[k]\\n elif k == dict_size:\\n entry = w + w[0]\\n else:\\n raise ValueError('Bad compressed k: %s' % k)\\n result.write(entry)\\n\\n # Add w+entry[0] to the dictionary.\\n dictionary[dict_size] = w + entry[0]\\n dict_size += 1\\n\\n w = entry\\n return result.getvalue()\\n\\n\\n# How to use:\\ncompressed = compress('TOBEORNOTTOBEORTOBEORNOT')\\nprint (compressed)\\ndecompressed = decompress(compressed)\\nprint (decompressed)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n; utilities\\n(define-syntax def (make-rename-transformer #'define))\\n(define (dict-ref d w) (hash-ref d w #f))\\n(define (append-char w c) (string-append w (string c)))\\n(define (append-first w s) (append-char w (string-ref s 0)))\\n\\n;; Compress a string with LZW\\n(define (compress uncompressed)\\n (def d (make-hash))\\n (def (dict-add d w) (hash-set! d w (hash-count d)))\\n ; build initial dictionary\\n (for ([i (in-range 256)])\\n (def s (string (integer->char i)))\\n (hash-set! d s s))\\n ; compress the string\\n (def result '())\\n (def (emit! i) (set! result (cons i result)))\\n (def w \\\"\\\")\\n (for ([c uncompressed])\\n (define wc (append-char w c))\\n (cond\\n [(dict-ref d wc) (set! w wc)]\\n [else (emit! (dict-ref d w))\\n (dict-add d wc)\\n (set! w (string c))]))\\n (emit! (dict-ref d w))\\n (reverse result))\\n\\n;; Decompress a LZW compressed string\\n(define (decompress compressed)\\n (def d (make-hash))\\n (def (dict-add! w) (hash-set! d (hash-count d) w))\\n ; build initial dictionary\\n (for ([i (in-range 256)])\\n (def s (string (integer->char i)))\\n (hash-set! d s s))\\n ; decompress the list\\n (def w (first compressed))\\n (apply string-append\\n w\\n (for/list ([k (rest compressed)])\\n (def entry\\n (or (dict-ref d k)\\n (if (eqv? k (hash-count d))\\n (append-first w w)\\n (error 'lzq-decompress \\\"faulty input\\\"))))\\n (dict-add! (append-first w entry))\\n (set! w entry)\\n entry)))\\n\\n(def uncompressed \\\"TOBEORNOTTOBEORTOBEORNOT\\\")\\n(displayln uncompressed)\\n(def compressed (compress uncompressed))\\n(displayln compressed)\\n(def decompressed (decompress compressed))\\n(displayln decompressed)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"# 20200421 Updated Raku programming solution ; add unicode support\\n\\nsub compress(Str $uncompressed --> Seq) {\\n my $dict-size = 256;\\n my %dictionary = (.chr => .chr for ^$dict-size);\\n\\n my $w = \\\"\\\";\\n gather {\\n for $uncompressed.encode('utf8').list.chrs.comb -> $c {\\n my $wc = $w ~ $c;\\n if %dictionary{$wc}:exists { $w = $wc }\\n else {\\n take %dictionary{$w};\\n %dictionary{$wc} = +%dictionary;\\n $w = $c;\\n }\\n }\\n\\n take %dictionary{$w} if $w.chars;\\n }\\n}\\n\\nsub decompress(@compressed --> Str) {\\n my $dict-size = 256;\\n my %dictionary = (.chr => .chr for ^$dict-size);\\n\\n my $w = shift @compressed;\\n ( Blob.new: flat ( gather {\\n take $w;\\n for @compressed -> $k {\\n my $entry;\\n if %dictionary{$k}:exists { take $entry = %dictionary{$k} }\\n elsif $k == $dict-size { take $entry = $w ~ $w.substr(0,1) }\\n else { die \\\"Bad compressed k: $k\\\" }\\n\\n %dictionary{$dict-size++} = $w ~ $entry.substr(0,1);\\n $w = $entry;\\n }\\n } )».ords ).decode('utf-8')\\n}\\n\\nsay my @compressed = compress('TOBEORNOTTOBEORTOBEORNOT');\\nsay decompress(@compressed);\\n\\n@compressed = compress('こんにちは𝒳𝒴𝒵こんにちは𝒳𝒴𝒵こんにちは𝒳𝒴𝒵');\\nsay decompress(@compressed);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/* REXX ---------------------------------------------------------------\\n* 20.07.2014 Walter Pachl translated from Java\\n* 21.07.2014 WP allow for blanks in the string\\n*--------------------------------------------------------------------*/\\nParse Arg str\\ndefault=\\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\nIf str='' Then\\n str=default\\n/* str=space(str,0) */\\nSay 'str='str\\ncompressed = compress(str)\\nSay compressed\\nIf str=default Then Do\\n cx='[84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263]'\\n If cx==compressed Then Say 'compression ok'\\n End\\ndecompressed = decompress(compressed)\\nSay 'dec='decompressed\\nIf decompressed=str Then Say 'decompression ok'\\nExit\\n\\ncompress: Procedure\\nParse Arg uncompressed\\ndict.=''\\nDo i=0 To 255\\n z=d2c(i)\\n d.i=z\\n dict.z=i\\n End\\ndict_size=256\\nres='['\\nw=''\\nDo i=1 To length(uncompressed)\\n c=substr(uncompressed,i,1)\\n wc=w||c\\n If dict.wc<>'' Then\\n w=wc\\n Else Do\\n res=res||dict.w', '\\n dict.wc=dict_size\\n dict_size=dict_size+1\\n w=c\\n End\\n End\\nIf w<>'' Then\\n res=res||dict.w', '\\nReturn left(res,length(res)-2)']'\\n\\ndecompress: Procedure\\nParse Arg compressed\\ncompressed=space(translate(compressed,'','[],'))\\nd.=''\\nDo i=0 To 255\\n z=d2c(i)\\n d.i=z\\n End\\ndict_size=256\\nParse Var compressed w compressed\\nres=d.w\\nw=d.w\\nDo i=1 To words(compressed)\\n k=word(compressed,i)\\n Select\\n When d.k<>'' | d.k==' ' then /* allow for blank */\\n entry=d.k\\n When k=dict_size Then\\n entry=w||substr(w,1,1)\\n Otherwise\\n Say \\\"Bad compressed k: \\\" k\\n End\\n res=res||entry\\n d.dict_size=w||substr(entry,1,1)\\n dict_size=dict_size+1\\n w=entry\\n End\\nReturn res\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program compresses text using the LZW (Lempel─Ziv─Welch), and reconstitutes it.*/\\n$$$= '\\\"There is nothing permanent except change.\\\" ─── Heraclitus [540 ── 475 BCE]'\\nparse arg text; if text='' then text= $$$ /*get an optional argument from the CL.*/\\n say 'original text=' text /* [↑] Not specified? Then use default*/\\ncypher= LZWc(text) /*compress text using the LZW algorithm*/\\n say 'reconstituted=' LZWd(cypher) /*display the reconstituted string. */\\nsay; say ' LZW integers=' cypher /* \\\" \\\" LZW integers used. */\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nLZWi: arg i,@.; #=256; do j=0 for #; _=d2c(j); if i then @.j=_; else @._=j; end; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nLZWc: procedure; parse arg y,,$; call LZWi 0; w= /*LZW compress.*/\\n do k=1 for length(y)+1; z= w || substr(y, k, 1)\\n if @.z=='' then do; $= $ @.w; @.z= #; #= # + 1; w= substr(y, k, 1); end\\n else w= z /*#: the dictionary size.*/\\n end /*k*/; return substr($, 2) /*elide a leading blank. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nLZWd: procedure; parse arg x y; call LZWi 1; $= @.x; w= $ /*LZW decompress.*/\\n do k=1 for words(y); z= word(y, k)\\n if @.z\\\\=='' | @.k==\\\" \\\" then ?= @.z\\n else if z==# then ?= w || left(w, 1)\\n $= $ || ?\\n @.#= w || left(?, 1); w= ?; #= # + 1 /*bump dict. size*/\\n end /*k*/; return $\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : LZW compression\\n\\nplaintext = \\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\nresult = []\\nencode = encodelzw(plaintext)\\nfor i = 1 to len(encode) step 2\\n add(result,ascii(substr(encode,i,1)) + 256*ascii(substr(encode,i+1,1)))\\nnext\\nshowarray(result)\\nsee decodelzw(encode)\\n\\nfunc encodelzw(text)\\n o = \\\"\\\"\\n dict = list(4096)\\n for i = 1 to 255\\n dict[i] = char(i)\\n next\\n l = i\\n i = 1\\n w = left(text,1)\\n while i < len(text)\\n d = 0\\n while d < l\\n c = d\\n if i > len(text)\\n exit\\n ok\\n for d = 1 to l\\n if w = dict[d]\\n exit\\n ok\\n next\\n if d < l\\n i = i + 1\\n w = w + substr(text,i,1)\\n ok\\n end\\n dict[l] = w\\n l = l + 1\\n w = right(w,1)\\n o = o + char(c % 256) + char(floor(c / 256))\\n end\\n return o\\n\\nfunc decodelzw(text)\\n o = \\\"\\\"\\n dict = list(4096)\\n for i = 1 to 255\\n dict[i] = char(i)\\n next\\n l = i\\n c = ascii(left(text,1)) + 256*ascii(substr(text,2,1))\\n w = dict[c]\\n o = w\\n if len(text) < 4\\n return o\\n ok\\n for i = 3 to len(text) step 2\\n c = ascii(substr(text,i,1)) + 256*ascii(substr(text,i+1,1))\\n if c < l\\n t = dict[c]\\n else\\n t = w + left(w,1)\\n ok\\n o = o + t\\n dict[l] = w + left(t,1)\\n l = l + 1\\n w = t\\n next\\n return o\\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 + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"# Compress a string to a list of output symbols.\\ndef compress(uncompressed)\\n # Build the dictionary.\\n dict_size = 256\\n dictionary = Hash[ Array.new(dict_size) {|i| [i.chr, i.chr]} ]\\n\\n w = \\\"\\\"\\n result = []\\n for c in uncompressed.split('')\\n wc = w + c\\n if dictionary.has_key?(wc)\\n w = wc\\n else\\n result << dictionary[w]\\n # Add wc to the dictionary.\\n dictionary[wc] = dict_size\\n dict_size += 1\\n w = c\\n end\\n end\\n\\n # Output the code for w.\\n result << dictionary[w] unless w.empty?\\n result\\nend\\n\\n# Decompress a list of output ks to a string.\\ndef decompress(compressed)\\n # Build the dictionary.\\n dict_size = 256\\n dictionary = Hash[ Array.new(dict_size) {|i| [i.chr, i.chr]} ]\\n\\n w = result = compressed.shift\\n for k in compressed\\n if dictionary.has_key?(k)\\n entry = dictionary[k]\\n elsif k == dict_size\\n entry = w + w[0,1]\\n else\\n raise 'Bad compressed k: %s' % k\\n end\\n result += entry\\n\\n # Add w+entry[0] to the dictionary.\\n dictionary[dict_size] = w + entry[0,1]\\n dict_size += 1\\n\\n w = entry\\n end\\n result\\nend\\n\\n# How to use:\\ncompressed = compress('TOBEORNOTTOBEORTOBEORNOT')\\np compressed\\ndecompressed = decompress(compressed)\\nputs decompressed\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use std::collections::HashMap;\\n\\nfn compress(data: &[u8]) -> Vec<u32> {\\n // Build initial dictionary.\\n let mut dictionary: HashMap<Vec<u8>, u32> = (0u32..=255)\\n .map(|i| (vec![i as u8], i))\\n .collect();\\n\\n let mut w = Vec::new();\\n let mut compressed = Vec::new();\\n\\n for &b in data {\\n let mut wc = w.clone();\\n wc.push(b);\\n\\n if dictionary.contains_key(&wc) {\\n w = wc;\\n } else {\\n // Write w to output.\\n compressed.push(dictionary[&w]);\\n\\n // wc is a new sequence; add it to the dictionary.\\n dictionary.insert(wc, dictionary.len() as u32);\\n w.clear();\\n w.push(b);\\n }\\n }\\n\\n // Write remaining output if necessary.\\n if !w.is_empty() {\\n compressed.push(dictionary[&w]);\\n }\\n\\n compressed\\n}\\n\\nfn decompress(mut data: &[u32]) -> Vec<u8> {\\n // Build the dictionary.\\n let mut dictionary: HashMap::<u32, Vec<u8>> = (0u32..=255)\\n .map(|i| (i, vec![i as u8]))\\n .collect();\\n\\n let mut w = dictionary[&data[0]].clone();\\n data = &data[1..];\\n let mut decompressed = w.clone();\\n\\n for &k in data {\\n let entry = if dictionary.contains_key(&k) {\\n dictionary[&k].clone()\\n } else if k == dictionary.len() as u32 {\\n let mut entry = w.clone();\\n entry.push(w[0]);\\n entry\\n } else {\\n panic!(\\\"Invalid dictionary!\\\");\\n };\\n\\n decompressed.extend_from_slice(&entry);\\n\\n // New sequence; add it to the dictionary.\\n w.push(entry[0]);\\n dictionary.insert(dictionary.len() as u32, w);\\n\\n w = entry;\\n }\\n\\n decompressed\\n}\\n\\nfn main() {\\n let compressed = compress(\\\"TOBEORNOTTOBEORTOBEORNOT\\\".as_bytes());\\n println!(\\\"{:?}\\\", compressed);\\n\\n let decompressed = decompress(&compressed);\\n let decompressed = String::from_utf8(decompressed).unwrap();\\n println!(\\\"{}\\\", decompressed);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"def compress(tc:String) = {\\n //initial dictionary\\n val startDict = (1 to 255).map(a=>(\\\"\\\"+a.toChar,a)).toMap\\n val (fullDict, result, remain) = tc.foldLeft ((startDict, List[Int](), \\\"\\\")) {\\n case ((dict,res,leftOver),nextChar) =>\\n if (dict.contains(leftOver + nextChar)) // current substring already in dict\\n (dict, res, leftOver+nextChar)\\n else if (dict.size < 4096) // add to dictionary\\n (dict + ((leftOver+nextChar, dict.size+1)), dict(leftOver) :: res, \\\"\\\"+nextChar)\\n else // dictionary is full\\n (dict, dict(leftOver) :: res, \\\"\\\"+nextChar)\\n }\\n if (remain.isEmpty) result.reverse else (fullDict(remain) :: result).reverse\\n}\\n\\ndef decompress(ns: List[Int]): String = {\\n val startDict = (1 to 255).map(a=>(a,\\\"\\\"+a.toChar)).toMap\\n val (_, result, _) =\\n ns.foldLeft[(Map[Int, String], List[String], Option[(Int, String)])]((startDict, Nil, None)) {\\n case ((dict, result, conjecture), n) => {\\n dict.get(n) match {\\n case Some(output) => {\\n val (newDict, newCode) = conjecture match {\\n case Some((code, prefix)) => ((dict + (code -> (prefix + output.head))), code + 1)\\n case None => (dict, dict.size + 1)\\n }\\n (newDict, output :: result, Some(newCode -> output))\\n }\\n case None => {\\n // conjecture being None would be an encoding error\\n val (code, prefix) = conjecture.get\\n val output = prefix + prefix.head\\n (dict + (code -> output), output :: result, Some(code + 1 -> output))\\n }\\n }\\n }\\n }\\n result.reverse.mkString(\\\"\\\")\\n}\\n// test\\nval text = \\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\nval compressed = compress(text)\\nprintln(compressed)\\nval result = decompress(compressed)\\nprintln(result)\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"; Get the list reference number for a member or #f if not found\\n(define (member-string-ref m l)\\n (define r #f)\\n (let loop ((i 0))\\n (if (< i (length l))\\n (if (not (string=? (list-ref l i) m))\\n (loop (+ i 1))\\n (set! r i))))\\n r)\\n\\n;; Compress a string with LZW\\n(define (lzw-compress uncompressed)\\n (define dictionary '())\\n (define n 0)\\n (define result '())\\n (set! uncompressed (string->list uncompressed))\\n\\n ;; Setup Dictionary\\n (let dict-setup ((c 0))\\n (if (> 256 c)\\n (begin\\n (set! dictionary (append dictionary\\n (list (string (integer->char c)))))\\n (set! n (+ n 1))\\n (dict-setup (+ c 1)))))\\n\\n ;; Compress the string\\n (let compress ((w \\\"\\\") (ci 0))\\n (define c (string (list-ref uncompressed ci)))\\n (define wc \\\"\\\")\\n (set! wc (string-append w c))\\n (if (member-string-ref wc dictionary)\\n (set! w wc)\\n (begin\\n (set! result (append result\\n (list (member-string-ref w dictionary))))\\n (set! dictionary (append dictionary (list wc)))\\n (set! n (+ n 1))\\n (set! w c)))\\n (if (eqv? ci (- (length uncompressed) 1))\\n (set! result (append result\\n (list (member-string-ref w dictionary))))\\n (compress w (+ ci 1))))\\n result)\\n\\n;; Decompress a LZW compressed string (input should be a list of integers)\\n(define (lzw-decompress compressed)\\n (define dictionary '())\\n (define n 0)\\n (define result \\\"\\\")\\n\\n ;; Setup Dictionary\\n (let dict-setup ((c 0))\\n (if (> 256 c)\\n (begin\\n (set! dictionary (append dictionary\\n (list (string (integer->char c)))))\\n (set! n (+ n 1))\\n (dict-setup (+ c 1)))))\\n\\n ;; Decompress the list\\n (let decompress ((k (list-ref compressed 0)) (ci 0))\\n (define kn #f)\\n ;; Add to dictionary\\n (if (> (length compressed) (+ ci 1))\\n (begin\\n (set! kn (list-ref compressed (+ ci 1)))\\n (if (< kn (length dictionary))\\n (set! dictionary\\n (append dictionary\\n (list (string-append\\n (list-ref dictionary k)\\n (string (string-ref (list-ref dictionary kn) 0)))))))))\\n\\n ;; Build the resulting string\\n (set! result (string-append result (list-ref dictionary k)))\\n\\n (if (not (eqv? ci (- (length compressed) 1)))\\n (decompress kn (+ ci 1))))\\n result)\\n\\n(define compressed (lzw-compress \\\"TOBEORNOTTOBEORTOBEORNOT\\\"))\\n(display compressed) (newline)\\n(define decompressed (lzw-decompress compressed))\\n(display decompressed) (newline)\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst func string: lzwCompress (in string: uncompressed) is func\\n result\\n var string: compressed is \\\"\\\";\\n local\\n var char: ch is ' ';\\n var hash [string] char: mydict is (hash [string] char).value;\\n var string: buffer is \\\"\\\";\\n var string: xstr is \\\"\\\";\\n begin\\n for ch range chr(0) to chr(255) do\\n mydict @:= [str(ch)] ch;\\n end for;\\n for ch range uncompressed do\\n xstr := buffer & str(ch);\\n if xstr in mydict then\\n buffer &:= str(ch)\\n else\\n compressed &:= str(mydict[buffer]);\\n mydict @:= [xstr] chr(length(mydict));\\n buffer := str(ch);\\n end if;\\n end for;\\n if buffer <> \\\"\\\" then\\n compressed &:= str(mydict[buffer]);\\n end if;\\n end func;\\n\\nconst func string: lzwDecompress (in string: compressed) is func\\n result\\n var string: uncompressed is \\\"\\\";\\n local\\n var char: ch is ' ';\\n var hash [char] string: mydict is (hash [char] string).value;\\n var string: buffer is \\\"\\\";\\n var string: current is \\\"\\\";\\n var string: chain is \\\"\\\";\\n begin\\n for ch range chr(0) to chr(255) do\\n mydict @:= [ch] str(ch);\\n end for;\\n for ch range compressed do\\n if buffer = \\\"\\\" then\\n buffer := mydict[ch];\\n uncompressed &:= buffer;\\n elsif ch <= chr(255) then\\n current := mydict[ch];\\n uncompressed &:= current;\\n chain := buffer & current;\\n mydict @:= [chr(length(mydict))] chain;\\n buffer := current;\\n else\\n if ch in mydict then\\n chain := mydict[ch];\\n else\\n chain := buffer & str(buffer[1]);\\n end if;\\n uncompressed &:= chain;\\n mydict @:= [chr(length(mydict))] buffer & str(chain[1]);\\n buffer := chain;\\n end if;\\n end for;\\n end func;\\n\\nconst proc: main is func\\n local\\n var string: compressed is \\\"\\\";\\n var string: uncompressed is \\\"\\\";\\n begin\\n compressed := lzwCompress(\\\"TOBEORNOTTOBEORTOBEORNOT\\\");\\n writeln(literal(compressed));\\n uncompressed := lzwDecompress(compressed);\\n writeln(uncompressed);\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"# Compress a string to a list of output symbols.\\nfunc compress(String uncompressed) -> Array {\\n\\n # Build the dictionary.\\n var dict_size = 256\\n var dictionary = Hash()\\n\\n for i in range(dict_size) {\\n dictionary{i.chr} = i.chr\\n }\\n\\n var w = ''\\n var result = []\\n uncompressed.each { |c|\\n var wc = w+c\\n if (dictionary.exists(wc)) {\\n w = wc\\n } else {\\n result << dictionary{w}\\n # Add wc to the dictionary.\\n dictionary{wc} = dict_size\\n dict_size++\\n w = c\\n }\\n }\\n\\n # Output the code for w.\\n if (w != '') {\\n result << dictionary{w}\\n }\\n\\n return result\\n}\\n\\n# Decompress a list of output ks to a string.\\nfunc decompress(Array compressed) -> String {\\n\\n # Build the dictionary.\\n var dict_size = 256\\n var dictionary = Hash()\\n\\n for i in range(dict_size) {\\n dictionary{i.chr} = i.chr\\n }\\n\\n var w = compressed.shift\\n var result = w\\n compressed.each { |k|\\n var entry = nil\\n if (dictionary.exists(k)) {\\n entry = dictionary{k}\\n } elsif (k == dict_size) {\\n entry = w+w.first\\n } else {\\n die \\\"Bad compressed k: #{k}\\\"\\n }\\n result += entry\\n\\n # Add w+entry[0] to the dictionary.\\n dictionary{dict_size} = w+entry.first\\n dict_size++\\n\\n w = entry\\n }\\n return result\\n}\\n\\n# How to use:\\nvar compressed = compress('TOBEORNOTTOBEORTOBEORNOT')\\nsay compressed.join(' ')\\nvar decompressed = decompress(compressed)\\nsay decompressed\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"class LZW {\\n class func compress(_ uncompressed:String) -> [Int] {\\n var dict = [String : Int]()\\n\\n for i in 0 ..< 256 {\\n let s = String(Unicode.Scalar(UInt8(i)))\\n dict[s] = i\\n }\\n\\n var dictSize = 256\\n var w = \\\"\\\"\\n var result = [Int]()\\n for c in uncompressed {\\n let wc = w + String(c)\\n if dict[wc] != nil {\\n w = wc\\n } else {\\n result.append(dict[w]!)\\n dict[wc] = dictSize\\n dictSize += 1\\n w = String(c)\\n }\\n }\\n\\n if w != \\\"\\\" {\\n result.append(dict[w]!)\\n }\\n return result\\n }\\n\\n class func decompress(_ compressed:[Int]) -> String? {\\n var dict = [Int : String]()\\n\\n for i in 0 ..< 256 {\\n dict[i] = String(Unicode.Scalar(UInt8(i)))\\n }\\n\\n var dictSize = 256\\n var w = String(Unicode.Scalar(UInt8(compressed[0])))\\n var result = w\\n for k in compressed[1 ..< compressed.count] {\\n let entry : String\\n if let x = dict[k] {\\n entry = x\\n } else if k == dictSize {\\n entry = w + String(w[w.startIndex])\\n } else {\\n return nil\\n }\\n\\n result += entry\\n dict[dictSize] = w + String(entry[entry.startIndex])\\n dictSize += 1\\n w = entry\\n }\\n return result\\n }\\n}\\n\\nlet comp = LZW.compress(\\\"TOBEORNOTTOBEORTOBEORNOT\\\")\\nprint(comp)\\n\\nif let decomp = LZW.decompress(comp) {\\n print(decomp)\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"namespace eval LZW {\\n variable char2int\\n variable chars\\n for {set i 0} {$i < 256} {incr i} {\\n set char [binary format c $i]\\n set char2int($char) $i\\n lappend chars $char\\n }\\n}\\n\\nproc LZW::encode {data} {\\n variable char2int\\n array set dict [array get char2int]\\n\\n set w \\\"\\\"\\n set result [list]\\n\\n foreach c [split $data \\\"\\\"] {\\n set wc $w$c\\n if {[info exists dict($wc)]} {\\n set w $wc\\n } else {\\n lappend result $dict($w)\\n set dict($wc) [array size dict]\\n set w $c\\n }\\n }\\n lappend result $dict($w)\\n}\\n\\nproc LZW::decode {cdata} {\\n variable chars\\n set dict $chars\\n\\n set k [lindex $cdata 0]\\n set w [lindex $dict $k]\\n set result $w\\n\\n foreach k [lrange $cdata 1 end] {\\n set currSizeDict [llength $dict]\\n if {$k < $currSizeDict} {\\n set entry [lindex $dict $k]\\n } elseif {$k == $currSizeDict} {\\n set entry $w[string index $w 0]\\n } else {\\n error \\\"invalid code ($k) in ($cdata)\\\"\\n }\\n append result $entry\\n lappend dict $w[string index $entry 0]\\n set w $entry\\n }\\n return $result\\n}\\n\\nset s TOBEORNOTTOBEORTOBEORNOT#\\nset e [LZW::encode $s] ;# ==> 84 79 66 69 79 82 78 79 84 256 258 260 265 259 261 263 35\\nset d [LZW::decode $e] ;# ==> TOBEORNOTTOBEORTOBEORNOT#\\n\\n# or\\nif {$s eq [LZW::decode [LZW::encode $s]]} then {puts success} else {puts fail} ;# ==> success\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"Option Explicit\\nConst numchars=127 'plain ASCII\\n\\nFunction LZWCompress(si)\\n Dim oDict, intMaxCode, i,z,ii,ss,strCurrent,strNext,j\\n Set oDict = CreateObject(\\\"Scripting.Dictionary\\\")\\n ReDim a(Len(si))\\n\\n intMaxCode = numchars\\n For i = 0 To numchars\\n oDict.Add Chr(i), i\\n Next\\n 'strCurrent = ofread.ReadText(1)\\n strCurrent = Left(si,1)\\n j=0\\n For ii=2 To Len(si)\\n strNext = Mid(si,ii,1)\\n ss=strCurrent & strNext\\n If oDict.Exists(ss) Then\\n strCurrent = ss\\n Else\\n a(j)=oDict.Item(strCurrent) :j=j+1\\n intMaxCode = intMaxCode + 1\\n oDict.Add ss, intMaxCode\\n strCurrent = strNext\\n End If\\n Next\\n a(j)=oDict.Item(strCurrent)\\n ReDim preserve a(j)\\n LZWCompress=a\\n Set oDict = Nothing\\nEnd Function\\n\\nFunction lzwUncompress(sc)\\n Dim intNext, intCurrent, intMaxCode, i,ss,istr,s,j\\n s=\\\"\\\"\\n reDim dict(1000)\\n intMaxCode = numchars\\n For i = 0 To numchars : dict(i)= Chr(i) : Next\\n intCurrent=sc(0)\\n\\n For j=1 To UBound(sc)\\n ss=dict(intCurrent)\\n s= s & ss\\n intMaxCode = intMaxCode + 1\\n intnext=sc(j)\\n If intNext<intMaxCode Then\\n dict(intMaxCode)=ss & Left(dict(intNext), 1)\\n Else\\n dict(intMaxCode)=ss & Left(ss, 1)\\n End If\\n intCurrent = intNext\\n Next\\n s= s & dict(intCurrent)\\n lzwUncompress=s\\nEnd function\\n\\nSub printvec(a)\\n Dim s,i,x\\n s=\\\"(\\\"\\n For i=0 To UBound (a)\\n s=s & x & a(i)\\n x=\\\", \\\"\\n Next\\n WScript.echo s &\\\")\\\"\\nEnd sub\\n\\nDim a,b\\nb=\\\"TOBEORNOTTOBEORTOBEORNOT\\\"\\nWScript.Echo b\\na=LZWCompress (b)\\nprintvec(a)\\nWScript.echo lzwUncompress (a )\\nwscript.quit 1\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"class LZW {\\n /* Compress a string to a list of output symbols. */\\n static compress(uncompressed) {\\n // Build the dictionary.\\n var dictSize = 256\\n var dictionary = {}\\n for (i in 0...dictSize) dictionary[String.fromByte(i)] = i\\n var w = \\\"\\\"\\n var result = []\\n for (c in uncompressed.bytes) {\\n var cs = String.fromByte(c)\\n var wc = w + cs\\n if (dictionary.containsKey(wc)) {\\n w = wc\\n } else {\\n result.add(dictionary[w])\\n // Add wc to the dictionary.\\n dictionary[wc] = dictSize\\n dictSize = dictSize + 1\\n w = cs\\n }\\n }\\n\\n // Output the code for w\\n if (w != \\\"\\\") result.add(dictionary[w])\\n return result\\n }\\n\\n /* Decompress a list of output symbols to a string. */\\n static decompress(compressed) {\\n // Build the dictionary.\\n var dictSize = 256\\n var dictionary = {}\\n for (i in 0...dictSize) dictionary[i] = String.fromByte(i)\\n var w = String.fromByte(compressed[0])\\n var result = w\\n for (k in compressed.skip(1)) {\\n var entry\\n if (dictionary.containsKey(k)) {\\n entry = dictionary[k]\\n } else if (k == dictSize) {\\n entry = w + String.fromByte(w.bytes[0])\\n } else {\\n Fiber.abort(\\\"Bad compressed k: %(k)\\\")\\n }\\n result = result + entry\\n\\n // Add w + entry[0] to the dictionary.\\n dictionary[dictSize] = w + String.fromByte(entry.bytes[0])\\n dictSize = dictSize + 1\\n w = entry\\n }\\n return result\\n }\\n}\\n\\nvar compressed = LZW.compress(\\\"TOBEORNOTTOBEORTOBEORNOT\\\")\\nSystem.print(compressed)\\nvar decompressed = LZW.decompress(compressed)\\nSystem.print(decompressed)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \" Function compress(str as String) As String\\n Dim i as integer\\n Dim w as String = \\\"\\\"\\n Dim c as String\\n Dim strLen as Integer\\n Dim wc as string\\n Dim dic() as string\\n Dim result() as string\\n Dim lookup as integer\\n Dim startPos as integer = 0\\n Dim combined as String\\n\\n strLen = len(str)\\n\\n dic = populateDictionary\\n\\n for i = 1 to strLen\\n c = str.mid(i, 1)\\n wc = w + c\\n\\n startPos = getStartPos(wc)\\n\\n lookup = findArrayPos(dic, wc, startPos)\\n if (lookup <> -1) then\\n w = wc\\n Else\\n startPos = getStartPos(w)\\n lookup = findArrayPos(dic, w, startPos)\\n if lookup <> -1 then\\n result.Append(lookup.ToText)\\n end if\\n dic.append(wc)\\n w = c\\n end if\\n next i\\n\\n if (w <> \\\"\\\") then\\n startPos = getStartPos(w)\\n lookup = findArrayPos(dic, w, startPos)\\n result.Append(lookup.ToText)\\n end if\\n\\n return join(result, \\\",\\\")\\n End Function\\n\\n Function decompress(str as string) As string\\n dim comStr() as string\\n dim w as string\\n dim result as string\\n dim comStrLen as integer\\n dim entry as string\\n dim dic() as string\\n dim i as integer\\n\\n comStr = str.Split(\\\",\\\")\\n comStrLen = comStr.Ubound\\n dic = populateDictionary\\n\\n w = chr(val(comStr(0)))\\n result = w\\n for i = 1 to comStrLen\\n entry = dic(val(comStr(i)))\\n result = result + entry\\n dic.append(w + entry.mid(1,1))\\n w = entry\\n next i\\n\\n return result\\n End Function\\n\\n Private Function findArrayPos(arr() as String, search as String, start as integer) As Integer\\n dim arraySize as Integer\\n dim arrayPosition as Integer = -1\\n dim i as Integer\\n\\n arraySize = UBound(arr)\\n\\n for i = start to arraySize\\n if (strcomp(arr(i), search, 0) = 0) then\\n arrayPosition = i\\n exit\\n end if\\n next i\\n\\n return arrayPosition\\n End Function\\n\\n Private Function getStartPos(str as String) As integer\\n if (len(str) = 1) then\\n return 0\\n else\\n return 255\\n end if\\n End Function\\n\\n Private Function populateDictionary() As string()\\n dim dic() as string\\n dim i as integer\\n\\n for i = 0 to 255\\n dic.append(Chr(i))\\n next i\\n\\n return dic\\n End Function\\n\",\n \"language\": \"Xojo\"\n },\n {\n \"code\": \"fcn lzwCompress(uncompressed){ // text-->list of 12 bit ints\\n dictionary:=(256).pump(Dictionary(),fcn(n){ return(n.toChar(),n) });\\n w,compressed:=\\\"\\\",List();\\n foreach c in (uncompressed){\\n wc:=w+c;\\n if(dictionary.holds(wc)) w=wc;\\n else{\\n compressed.append(dictionary[w]); // 12 bits\\n dictionary[wc]=dictionary.len();\\n w=c;\\n }\\n }\\n if(w) compressed.append(dictionary[w]);\\n compressed\\n}\\nfcn lzwUncompress(compressed){ // compressed data-->text\\n dictionary:=(256).pump(Dictionary(),fcn(n){ return(n,n.toChar()) });\\n w,decommpressed:=dictionary[compressed[0]],Data(Void,w);\\n foreach k in (compressed[1,*]){\\n if(dictionary.holds(k)) entry:=dictionary[k];\\n else if(k==dictionary.len()) entry:=w+w[0];\\n else throw(Exception.ValueError(\\\"Invalid compressed data\\\"));\\n decommpressed.append(entry);\\n dictionary.add(dictionary.len(),w+entry[0]);\\n w=entry;\\n }\\n decommpressed.text\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"compressed:=lzwCompress(\\\"TOBEORNOTTOBEORTOBEORNOT\\\");\\ncompressed.toString(*).println();\\n\\nlzwUncompress(compressed).println();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"LZW-compression"}}},{"rowIdx":457,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Möbius_function\nnote: Prime Numbers\n","language":"00-META"},{"code":"The classical '''Möbius function: μ(n)''' is an important multiplicative function in number theory and combinatorics.\n\nThere are several ways to implement a Möbius function.\n\nA fairly straightforward method is to find the prime factors of a positive integer '''n''', then define '''μ(n)''' based on the sum of the primitive factors. It has the values '''{−1, 0, 1}''' depending on the factorization of '''n''':\n\n:* '''μ(1)''' is defined to be '''1'''.\n\n:* '''μ(n) = 1''' if '''n''' is a square-free positive integer with an '''even''' number of prime factors.\n\n:* '''μ(n) = −1''' if '''n''' is a square-free positive integer with an '''odd''' number of prime factors.\n\n:* '''μ(n) = 0''' if '''n''' has a '''squared''' prime factor.\n\n\n;Task:\n:* Write a routine (function, procedure, whatever) '''μ(n)''' to find the Möbius number for a positive integer '''n'''.\n\n:* Use that routine to find and display here, on this page, at least the first 99 terms in a grid layout. (Not just one long line or column of numbers.)\n\n\n;See also:\n:*; [[wp:Möbius function|Wikipedia: Möbius function]]\n\n\n;Related Tasks:\n:*; [[Mertens function]]\n<br><br>\n\n","language":"00-TASK"},{"code":"F isPrime(n)\n I n < 2\n R 0B\n L(i) 2 .. n\n I i * i <= n & n % i == 0\n R 0B\n R 1B\n\nF mobius(n)\n I n == 1\n R 1\n\n V p = 0\n L(i) 1 .. n\n I n % i == 0 & isPrime(i)\n I n % (i * i) == 0\n R 0\n E\n p = p + 1\n\n I p % 2 != 0\n R -1\n E\n R 1\n\nprint(‘Mobius numbers from 1..99:’)\n\nL(i) 1..99\n print(f:‘{mobius(i):4}’, end' ‘’)\n\n I i % 20 == 0\n print()\n","language":"11l"},{"code":"BEGIN\n # show the first 199 values of the moebius function #\n INT sq root = 1 000;\n INT mu max = sq root * sq root;\n [ 1 : mu max ]INT mu;\n FOR i FROM LWB mu TO UPB mu DO mu[ i ] := 1 OD;\n FOR i FROM 2 TO sq root DO\n IF mu[ i ] = 1 THEN\n # for each factor found, swap + and - #\n FOR j FROM i BY i TO UPB mu DO mu[ j ] *:= -i OD;\n FOR j FROM i * i BY i * i TO UPB mu DO mu[ j ] := 0 OD\n FI\n OD;\n FOR i FROM 2 TO UPB mu DO\n IF mu[ i ] = i THEN mu[ i ] := 1\n ELIF mu[ i ] = -i THEN mu[ i ] := -1\n ELIF mu[ i ] < 0 THEN mu[ i ] := 1\n ELIF mu[ i ] > 0 THEN mu[ i ] := -1\n # ELSE mu[ i ] = 0 so no change #\n FI\n OD;\n print( ( \"First 199 terms of the möbius function are as follows:\", newline, \" \" ) );\n FOR i TO 199 DO\n print( ( whole( mu[ i ], -4 ) ) );\n IF ( i + 1 ) MOD 20 = 0 THEN print( ( newline ) ) FI\n OD\nEND\n","language":"ALGOL-68"},{"code":"#include <basico.h>\n\n#proto cálculodeMobius(_X_)\n#synon _cálculodeMobius calcularMobius\n\nalgoritmo\n\n imprimir (\"Mobius numbers from 1..199\\n\")\n i=0, s=1\n iterar grupo( ++i, #(i<=199), calcular Mobius (i), \\\n solo si (#( iszero(s%20) ), NL;s=0 ), imprimir, ++s )\n saltar\nterminar\n\nsubrutinas\n\ncálculo de Mobius (n)\n si( #(n==0) ) ; tomar '\" \"'\n sino si( #(n==1) ); tomar '\" 1\"'\n sino; p=0\n iterar para (i=1, #(i<=n+1), ++i)\n si ( #( iszero(n%i) && isprime(i)) )\n cuando ( #( iszero(n%(i*i)) ) ){\n tomar '\" 0\"'; ir a (herejía) /* ¡! */\n } ++p\n fin si\n siguiente\n tomar si ( es impar(p), \" -1\", \" 1\" )\n fin si\n\n/* ¡Dios! ¡Purifica esta mierda! ----+ */\n /* | */\nherejía: /* <----------------------+ */\n retornar\n","language":"Amazing-Hopper"},{"code":"10 HOME\n20 FOR t = 0 TO 9\n30 FOR u = 1 TO 10\n40 n = 10*t+u\n50 GOSUB 130\n60 IF STR$(m) = \"0\" THEN PRINT \" 0\";\n70 IF STR$(m) = \"1\" THEN PRINT \" 1\";\n80 IF STR$(m) = \"-1\" THEN PRINT \" -1\";\n90 NEXT u\n100 PRINT\n110 NEXT t\n120 END\n130 IF n = 1 THEN m = 1 : RETURN\n140 m = 1 : f = 2\n150 IF (n-INT(n/(f*f))*(f*f)) = 0 THEN m = 0 : RETURN\n160 IF (n-INT(n/(f))*(f)) = 0 THEN GOSUB 200\n170 f = f+1\n180 IF f <= n THEN GOTO 150\n190 RETURN\n200 m = -m\n210 n = n/f\n220 RETURN\n230 END\n","language":"Applesoft-BASIC"},{"code":"mobius: function [n][\n if n=0 -> return \"\"\n if n=1 -> return 1\n f: factors.prime n\n\n if f <> unique f -> return 0\n if? odd? size f -> return neg 1\n else -> return 1\n]\n\nloop split.every:20 map 0..199 => mobius 'a ->\n print map a => [pad to :string & 3]\n","language":"Arturo"},{"code":"loop 100\n result .= SubStr(\" \" Möbius(A_Index), -1) . (Mod(A_Index, 10) ? \" \" : \"`n\")\nMsgBox, 262144, , % result\nreturn\n\nMöbius(n){\n if n=1\n return 1\n x := prime_factors(n)\n c := x.Count()\n sq := []\n for i, v in x\n if sq[v]\n return 0\n else\n sq[v] := 1\n return (c/2 = floor(c/2)) ? 1 : -1\n}\n\nprime_factors(n) {\n if (n <= 3)\n return [n]\n ans := [], done := false\n while !done {\n if !Mod(n, 2)\n ans.push(2), n /= 2\n else if !Mod(n, 3)\n ans.push(3), n /= 3\n else if (n = 1)\n return ans\n else {\n sr := sqrt(n), done := true, i := 6\n while (i <= sr+6) {\n if !Mod(n, i-1) { ; is n divisible by i-1?\n ans.push(i-1), n /= i-1, done := false\n break\n }\n if !Mod(n, i+1) { ; is n divisible by i+1?\n ans.push(i+1), n /= i+1, done := false\n break\n }\n i += 6\n }}}\n ans.push(Format(\"{:d}\", n))\n return ans\n}\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f MOBIUS_FUNCTION.AWK\n# converted from Java\nBEGIN {\n printf(\"first 199 terms of the mobius sequence:\\n \")\n for (n=1; n<200; n++) {\n printf(\"%3d\",mobius(n))\n if ((n+1) % 20 == 0) {\n printf(\"\\n\")\n }\n }\n exit(0)\n}\nfunction mobius(n, i,j,mu_max) {\n if (n in MU) {\n return(MU[n])\n }\n mu_max = 1000000\n for (i=0; i<mu_max; i++) { # populate array\n MU[i] = 1\n }\n for (i=2; i<=int(sqrt(mu_max)); i++ ) {\n if (MU[i] == 1) {\n for (j=i; j<=mu_max; j+=i) { # for each factor found, swap + and -\n MU[j] *= -i\n }\n for (j=i*i; j<=mu_max; j+=i*i) { # square factor = 0\n MU[j] = 0\n }\n }\n }\n for (i=2; i<=mu_max; i++) {\n if (MU[i] == i) {\n MU[i] = 1\n }\n else if (MU[i] == -i) {\n MU[i] = -1\n }\n else if (MU[i] < 0) {\n MU[i] = 1\n }\n else if (MU[i] > 0) {\n MU[i] = -1\n }\n }\n return(MU[n])\n}\n","language":"AWK"},{"code":"function mobius(n)\n\tif n = 1 then return 1\n\tfor d = 2 to int(sqr(n))\n\t\tif n mod d = 0 then\n\t\t\tif n mod (d*d) = 0 then return 0\n\t\t\treturn -mobius(n/d)\n\t\tend if\n\tnext d\n\treturn -1\nend function\n\noutstr$ = \" . \"\nfor i = 1 to 200\n\tif mobius(i) >= 0 then outstr$ += \" \"\n\toutstr$ += string(mobius(i)) + \" \"\n\tif i mod 10 = 9 then\n\t\tprint outstr$\n\t\toutstr$ = \"\"\n\tend if\nnext i\nend\n","language":"BASIC256"},{"code":"#include <math.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint main() {\n const int MU_MAX = 1000000;\n int i, j;\n int *mu;\n int sqroot;\n\n sqroot = (int)sqrt(MU_MAX);\n\n mu = malloc((MU_MAX + 1) * sizeof(int));\n\n for (i = 0; i < MU_MAX;i++) {\n mu[i] = 1;\n }\n\n for (i = 2; i <= sqroot; i++) {\n if (mu[i] == 1) {\n // for each factor found, swap + and -\n for (j = i; j <= MU_MAX; j += i) {\n mu[j] *= -i;\n }\n // square factor = 0\n for (j = i * i; j <= MU_MAX; j += i * i) {\n mu[j] = 0;\n }\n }\n }\n\n for (i = 2; i <= MU_MAX; i++) {\n if (mu[i] == i) {\n mu[i] = 1;\n } else if (mu[i] == -i) {\n mu[i] = -1;\n } else if (mu[i] < 0) {\n mu[i] = 1;\n } else if (mu[i] > 0) {\n mu[i] = -1;\n }\n }\n\n printf(\"First 199 terms of the möbius function are as follows:\\n \");\n for (i = 1; i < 200; i++) {\n printf(\"%2d \", mu[i]);\n if ((i + 1) % 20 == 0) {\n printf(\"\\n\");\n }\n }\n\n free(mu);\n return 0;\n}\n","language":"C"},{"code":"#include <iomanip>\n#include <iostream>\n#include <vector>\n\nconstexpr int MU_MAX = 1'000'000;\nstd::vector<int> MU;\n\nint mobiusFunction(int n) {\n if (!MU.empty()) {\n return MU[n];\n }\n\n // Populate array\n MU.resize(MU_MAX + 1, 1);\n int root = sqrt(MU_MAX);\n\n for (int i = 2; i <= root; i++) {\n if (MU[i] == 1) {\n // for each factor found, swap + and -\n for (int j = i; j <= MU_MAX; j += i) {\n MU[j] *= -i;\n }\n // square factor = 0\n for (int j = i * i; j <= MU_MAX; j += i * i) {\n MU[j] = 0;\n }\n }\n }\n\n for (int i = 2; i <= MU_MAX; i++) {\n if (MU[i] == i) {\n MU[i] = 1;\n } else if (MU[i] == -i) {\n MU[i] = -1;\n } else if (MU[i] < 0) {\n MU[i] = 1;\n } else if (MU[i] > 0) {\n MU[i] = -1;\n }\n }\n\n return MU[n];\n}\n\nint main() {\n std::cout << \"First 199 terms of the möbius function are as follows:\\n \";\n for (int n = 1; n < 200; n++) {\n std::cout << std::setw(2) << mobiusFunction(n) << \" \";\n if ((n + 1) % 20 == 0) {\n std::cout << '\\n';\n }\n }\n\n return 0;\n}\n","language":"C++"},{"code":"10 CLS\n20 FOR t = 0 TO 9\n30 FOR u = 1 TO 10\n40 n = 10 * t + u\n50 GOSUB 110\n60 PRINT USING \"## \"; m;\n70 NEXT u\n80 PRINT\n90 NEXT t\n100 END\n110 IF n = 1 THEN m = 1: RETURN\n120 m = 1: f = 2\n130 IF n MOD (f * f) = 0 THEN m = 0: RETURN\n140 IF n MOD f = 0 THEN GOSUB 180\n150 f = f + 1\n160 IF f <= n THEN GOTO 130\n170 RETURN\n180 m = -m\n190 n = n / f\n200 RETURN\n210 END\n","language":"Chipmunk-Basic"},{"code":"import std.math;\nimport std.stdio;\n\nimmutable MU_MAX = 1_000_000;\n\nint mobiusFunction(int n) {\n static initialized = false;\n static int[MU_MAX + 1] MU;\n\n if (initialized) {\n return MU[n];\n }\n\n // populate array\n MU[] = 1;\n int root = cast(int) sqrt(cast(real) MU_MAX);\n\n for (int i = 2; i <= root; i++) {\n if (MU[i] == 1) {\n // for each factor found, swap + and -\n for (int j = i; j <= MU_MAX; j += i) {\n MU[j] *= -i;\n }\n // square factor = 0\n for (int j = i * i; j <= MU_MAX; j += i * i) {\n MU[j] = 0;\n }\n }\n }\n\n for (int i = 2; i <= MU_MAX; i++) {\n if (MU[i] == i) {\n MU[i] = 1;\n } else if (MU[i] == -i) {\n MU[i] = -1;\n } else if (MU[i] < 0) {\n MU[i] = 1;\n } else if (MU[i] > 0) {\n MU[i] = -1;\n }\n }\n\n initialized = true;\n return MU[n];\n}\n\nvoid main() {\n writeln(\"First 199 terms of the möbius function are as follows:\");\n write(\" \");\n for (int n = 1; n < 200; n++) {\n writef(\"%2d \", mobiusFunction(n));\n if ((n + 1) % 20 == 0) {\n writeln;\n }\n }\n}\n","language":"D"},{"code":"function IsPrime(N: int64): boolean;\n{Fast, optimised prime test}\nvar I,Stop: int64;\nbegin\nif (N = 2) or (N=3) then Result:=true\nelse if (n <= 1) or ((n mod 2) = 0) or ((n mod 3) = 0) then Result:= false\nelse\n begin\n I:=5;\n Stop:=Trunc(sqrt(N+0.0));\n Result:=False;\n while I<=Stop do\n begin\n if ((N mod I) = 0) or ((N mod (I + 2)) = 0) then exit;\n Inc(I,6);\n end;\n Result:=True;\n end;\nend;\n\n\n\nfunction GetNextPrime(var Start: integer): integer;\n{Get the next prime number after Start}\n{Start is passed by \"reference,\" so the\n{original variable is incremented}\nbegin\nrepeat Inc(Start)\nuntil IsPrime(Start);\nResult:=Start;\nend;\n\n\ntype TIntArray = array of integer;\n\n\nprocedure StoreNumber(N: integer; var IA: TIntArray);\n{Expand and store number in array}\nbegin\nSetLength(IA,Length(IA)+1);\nIA[High(IA)]:=N;\nend;\n\n\nprocedure GetPrimeFactors(N: integer; var Facts: TIntArray);\n{Get all the prime factors of a number}\nvar I: integer;\nbegin\nI:=2;\nrepeat\n\tbegin\n\tif (N mod I) = 0 then\n\t\tbegin\n\t\tStoreNumber(I,Facts);\n\t\tN:=N div I;\n\t\tend\n\telse GetNextPrime(I);\n\tend\nuntil N=1;\nend;\n\n\n\nfunction HasDuplicates(IA: TIntArray): boolean;\n{Look for duplicates factors in array}\nvar I: integer;\nbegin\nResult:=True;\nfor I:=0 to Length(IA)-1 do\n if IA[I]=IA[I+1] then exit;\nResult:=False;\nend;\n\n\nfunction Moebius(N: integer): integer;\n{Get moebius function of number}\nvar I: integer;\nvar Factors: TIntArray;\nvar Even,Square: boolean;\nbegin\n{Collect all prime factors}\nSetLength(Factors,0);\nGetPrimeFactors(N,Factors);\n{Are there an even number of factors?}\nEven:=(Length(Factors) and 1)=0;\n{If there are duplicates, there are perfect squares}\nSquare:=HasDuplicates(Factors);\n{Return the Moebius function value}\nif Square then Result:=0\nelse if Even then Result:=1\nelse Result:=-1;\nend;\n\nprocedure TestMoebiusFactors(Memo: TMemo);\n{Test Moebius function for 1..200-1}\nvar N,M: integer;\nvar S: string;\nbegin\nS:='';\nfor N:=1 to 199 do\n\tbegin\n\tM:=Moebius(N);\n\tS:=S+Format('%3d',[M]);\n\tif (N mod 20)=19 then S:=S+#$0D#$0A\n\tend;\nMemo.Text:=S;\nend;\n","language":"Delphi"},{"code":"mu_max = 100000\nsqroot = floor sqrt mu_max\n#\nfor i to mu_max\n mu[] &= 1\n.\nfor i = 2 to sqroot\n if mu[i] = 1\n for j = i step i to mu_max\n mu[j] *= -i\n .\n for j = i * i step i * i to mu_max\n mu[j] = 0\n .\n .\n.\nfor i = 2 to mu_max\n if mu[i] = i\n mu[i] = 1\n elif mu[i] = -i\n mu[i] = -1\n elif mu[i] < 0\n mu[i] = 1\n elif mu[i] > 0\n mu[i] = -1\n .\n.\nnumfmt 0 3\nfor i = 1 to 100\n write mu[i]\n if i mod 10 = 0\n print \"\"\n .\n.\n","language":"EasyLang"},{"code":"// Möbius function. Nigel Galloway: January 31st., 2021\nlet fN g=let n=primes32()\n let rec fN i g e l=match (l/g,l%g,e) with (1,0,false)->i\n |(n,0,false)->fN (0-i) g true n\n |(_,0,true) ->0\n |_ ->fN i (Seq.head n) false l\n fN -1 (Seq.head n) false g\nlet mobius=seq{yield 1; yield! Seq.initInfinite((+)2>>fN)}\nmobius|>Seq.take 500|>Seq.chunkBySize 25|>Seq.iter(fun n->Array.iter(printf \"%3d\") n;printfn \"\")\n","language":"F-Sharp"},{"code":"USING: formatting grouping io math.extras math.ranges sequences ;\n\n\"First 199 terms of the Möbius sequence:\" print\n199 [1,b] [ mobius ] map \" \" prefix 20 group\n[ [ \"%3s\" printf ] each nl ] each\n","language":"Factor"},{"code":"program moebius\n use iso_fortran_env, only: output_unit\n\n integer, parameter :: mu_max=1000000, line_break=20\n integer, parameter :: sqroot=int(sqrt(real(mu_max)))\n integer :: i, j\n integer, dimension(mu_max) :: mu\n\n mu = 1\n\n do i = 2, sqroot\n if (mu(i) == 1) then\n do j = i, mu_max, i\n mu(j) = mu(j) * (-i)\n end do\n\n do j = i**2, mu_max, i**2\n mu(j) = 0\n end do\n end if\n end do\n\n do i = 2, mu_max\n if (mu(i) == i) then\n mu(i) = 1\n else if (mu(i) == -i) then\n mu(i) = -1\n else if (mu(i) < 0) then\n mu(i) = 1\n else if (mu(i) > 0) then\n mu(i) = -1\n end if\n end do\n\n write(output_unit,*) \"The first 199 terms of the Möbius sequence are:\"\n write(output_unit,'(3x)', advance=\"no\") ! Alignment of first number\n do i = 1, 199\n write(output_unit,'(I2,x)', advance=\"no\") mu(i)\n if (modulo(i+1, line_break) == 0) write(output_unit,*)\n end do\nend program moebius\n","language":"Fortran"},{"code":"function mobius( n as uinteger ) as integer\n if n = 1 then return 1\n for d as uinteger = 2 to int(sqr(n))\n if n mod d = 0 then\n if n mod (d*d) = 0 then return 0\n return -mobius(n/d)\n end if\n next d\n return -1\nend function\n\ndim as string outstr = \" . \"\nfor i as uinteger = 1 to 200\n if mobius(i)>=0 then outstr += \" \"\n outstr += str(mobius(i))+\" \"\n if i mod 10 = 9 then\n print outstr\n outstr = \"\"\n end if\nnext i\n","language":"FreeBASIC"},{"code":"local fn IsPrime( n as long ) as BOOL\n BOOL result = YES\n long i\n\n if ( n < 2 ) then result = NO : exit fn\n for i = 2 to n + 1\n if ( i * i <= n ) and ( n mod i == 0 )\n result = NO : exit fn\n end if\n next\nend fn = result\n\nlocal fn Mobius( n as long ) as long\n long i, p = 0, result = 0\n\n if ( n == 1 ) then result = 1 : exit fn\n for i = 1 to n + 1\n if ( n mod i == 0 ) and ( fn IsPrime( i ) == YES )\n if ( n mod ( i * i ) == 0 )\n result = 0 : exit fn\n else\n p++\n end if\n end if\n next\n if( p mod 2 != 0 )\n result = -1\n else\n result = 1\n end if\nend fn = result\n\nwindow 1, @\"Möbius function\", (0,0,600,300)\n\nprintf @\"First 100 terms of Mobius sequence:\"\n\nlong i\nfor i = 1 to 100\n printf @\"%2ld\\t\", fn Mobius(i)\n if ( i mod 20 == 0 ) then print\nnext\n\nHandleEvents\n","language":"FutureBasic"},{"code":"package main\n\nimport \"fmt\"\n\nfunc möbius(to int) []int {\n if to < 1 {\n to = 1\n }\n mobs := make([]int, to+1) // all zero by default\n primes := []int{2}\n for i := 1; i <= to; i++ {\n j := i\n cp := 0 // counts prime factors\n spf := false // true if there is a square prime factor\n for _, p := range primes {\n if p > j {\n break\n }\n if j%p == 0 {\n j /= p\n cp++\n }\n if j%p == 0 {\n spf = true\n break\n }\n }\n if cp == 0 && i > 2 {\n cp = 1\n primes = append(primes, i)\n }\n if !spf {\n if cp%2 == 0 {\n mobs[i] = 1\n } else {\n mobs[i] = -1\n }\n }\n }\n return mobs\n}\n\nfunc main() {\n mobs := möbius(199)\n fmt.Println(\"Möbius sequence - First 199 terms:\")\n for i := 0; i < 200; i++ {\n if i == 0 {\n fmt.Print(\" \")\n continue\n }\n if i%20 == 0 {\n fmt.Println()\n }\n fmt.Printf(\" % d\", mobs[i])\n }\n}\n","language":"Go"},{"code":"10 FOR T = 0 TO 9\n20 FOR U = 1 TO 10\n30 N = 10*T + U\n40 GOSUB 100\n50 PRINT USING \"## \";M;\n60 NEXT U\n70 PRINT\n80 NEXT T\n90 END\n100 IF N = 1 THEN M = 1 : RETURN\n110 M = 1 : F = 2\n120 IF N MOD (F*F) = 0 THEN M = 0 : RETURN\n130 IF N MOD F = 0 THEN GOSUB 170\n140 F = F + 1\n150 IF F <= N THEN GOTO 120\n160 RETURN\n170 M = -M\n180 N = N/F\n190 RETURN\n","language":"GW-BASIC"},{"code":"import Data.List (intercalate)\nimport Data.List.Split (chunksOf)\nimport Data.Vector.Unboxed (toList)\nimport Math.NumberTheory.ArithmeticFunctions.Moebius (Moebius(..),\n sieveBlockMoebius)\nimport System.Environment (getArgs, getProgName)\nimport System.IO (hPutStrLn, stderr)\nimport Text.Read (readMaybe)\n\n-- Calculate the Möbius function, μ(n), for a sequence of values starting at 1.\nmoebiusBlock :: Word -> [Moebius]\nmoebiusBlock = toList . sieveBlockMoebius 1\n\nshowMoebiusBlock :: Word -> [Moebius] -> String\nshowMoebiusBlock cols = intercalate \"\\n\" . map (concatMap showMoebius) .\n chunksOf (fromIntegral cols)\n where showMoebius MoebiusN = \" -1\"\n showMoebius MoebiusZ = \" 0\"\n showMoebius MoebiusP = \" 1\"\n\nmain :: IO ()\nmain = do\n prog <- getProgName\n args <- map readMaybe <$> getArgs\n case args of\n [Just cols, Just n] ->\n putStrLn (\"μ(n) for 1 ≤ n ≤ \" ++ show n ++ \":\\n\") >>\n putStrLn (showMoebiusBlock cols $ moebiusBlock n)\n _ -> hPutStrLn stderr $ \"Usage: \" ++ prog ++ \" num-columns maximum-number\"\n","language":"Haskell"},{"code":"mu=: */@:-@~:@q:\n","language":"J"},{"code":" mu >: i. 10 20\n 1 _1 _1 0 _1 1 _1 0 0 1 _1 0 _1 1 1 0 _1 0 _1 0\n 1 1 _1 0 0 1 0 0 _1 _1 _1 0 1 1 1 0 _1 1 1 0\n_1 _1 _1 0 0 1 _1 0 0 0 1 0 _1 0 1 0 1 1 _1 0\n_1 1 0 0 1 _1 _1 0 1 _1 _1 0 _1 1 0 0 1 _1 _1 0\n 0 1 _1 0 1 1 1 0 _1 0 1 0 1 1 1 0 _1 0 0 0\n_1 _1 _1 0 _1 1 _1 0 _1 _1 1 0 _1 _1 1 0 0 1 1 0\n 0 1 1 0 0 0 _1 0 1 _1 _1 0 1 1 0 0 _1 _1 _1 0\n 1 1 1 0 1 1 0 0 _1 0 _1 0 0 _1 1 0 _1 1 1 0\n 1 0 _1 0 _1 1 _1 0 0 _1 0 0 _1 _1 0 0 1 1 _1 0\n_1 _1 1 0 1 _1 1 0 0 _1 _1 0 _1 1 _1 0 _1 0 _1 0\n","language":"J"},{"code":"public class MöbiusFunction {\n\n public static void main(String[] args) {\n System.out.printf(\"First 199 terms of the möbius function are as follows:%n \");\n for ( int n = 1 ; n < 200 ; n++ ) {\n System.out.printf(\"%2d \", möbiusFunction(n));\n if ( (n+1) % 20 == 0 ) {\n System.out.printf(\"%n\");\n }\n }\n }\n\n private static int MU_MAX = 1_000_000;\n private static int[] MU = null;\n\n // Compute mobius function via sieve\n private static int möbiusFunction(int n) {\n if ( MU != null ) {\n return MU[n];\n }\n\n // Populate array\n MU = new int[MU_MAX+1];\n int sqrt = (int) Math.sqrt(MU_MAX);\n for ( int i = 0 ; i < MU_MAX ; i++ ) {\n MU[i] = 1;\n }\n\n for ( int i = 2 ; i <= sqrt ; i++ ) {\n if ( MU[i] == 1 ) {\n // for each factor found, swap + and -\n for ( int j = i ; j <= MU_MAX ; j += i ) {\n MU[j] *= -i;\n }\n // square factor = 0\n for ( int j = i*i ; j <= MU_MAX ; j += i*i ) {\n MU[j] = 0;\n }\n }\n }\n\n for ( int i = 2 ; i <= MU_MAX ; i++ ) {\n if ( MU[i] == i ) {\n MU[i] = 1;\n }\n else if ( MU[i] == -i ) {\n MU[i] = -1;\n }\n else if ( MU[i] < 0 ) {\n MU[i] = 1;\n }\n else if ( MU[i] > 0 ) {\n MU[i] = -1;\n }\n }\n return MU[n];\n }\n\n}\n","language":"Java"},{"code":"# Input: a non-negative integer, $n\n# Output: an array of size $n + 1 such that the nth-mobius number is .[$n]\n# i.e. $n|mobius_array[-1]\n# For example, the first mobius number could be evaluated by 1|mobius_array[-1].\ndef mobius_array:\n . as $n\n | ($n|sqrt) as $sqrt\n | reduce range(2; 1 + $sqrt) as $i ([range(0; $n + 1) | 1];\n if .[$i] == 1\n then # for each factor found, swap + and -\n reduce range($i; $n + 1; $i) as $j (.; .[$j] *= -$i)\n | ($i*$i) as $isq # square factor = 0\n | reduce range($isq; $n + 1; $isq) as $j (.; .[$j] = 0 )\n else .\n end )\n | reduce range(2; 1 + $n) as $i (.;\n if .[$i] == $i then .[$i] = 1\n elif .[$i] == -$i then .[$i] = -1\n elif .[$i] < 0 then .[$i] = 1\n elif .[$i] > 0 then .[$i] = -1\n else .[$i] = 0 # avoid \"-0\"\n end);\n\n# For one-off computations:\ndef mu($n): $n | mobius_array[-1];\n","language":"Jq"},{"code":"def nwise($n):\n def n: if length <= $n then . else .[0:$n] , (.[$n:] | n) end;\n n;\n\ndef task:\n def pp: if . >=0 then \" \\(.)\" else tostring end;\n (199 | mobius_array) as $mu\n | \"The first 199 Möbius numbers are:\",\n ([\" \", (range(1; 200) | $mu[.] | pp )]\n | nwise(20)\n | join(\" \") ) ;\n\ntask\n","language":"Jq"},{"code":"# relatively_prime(previous) tests whether the input integer is prime\n# relative to the primes in the array \"previous\":\ndef relatively_prime(previous):\n . as $in\n | (previous|length) as $plen\n # state: [found, ix]\n | [false, 0]\n | until( .[0] or .[1] >= $plen;\n [ ($in % previous[.[1]]) == 0, .[1] + 1] )\n | .[0] | not ;\n\n# Emit a stream in increasing order of all primes (from 2 onwards)\n# that are less than or equal to mx:\ndef primes(mx):\n # The helper function, next, has arity 0 for tail recursion optimization;\n # it expects its input to be the array of previously found primes:\n def next:\n . as $previous\n | ($previous | .[length-1]) as $last\n | if ($last >= mx) then empty\n else ((2 + $last)\n | until( relatively_prime($previous) ; . + 2)) as $nextp\n | if $nextp <= mx\n then $nextp, (( $previous + [$nextp] ) | next)\n\t else empty\n end\n end;\n if mx <= 1 then empty\n elif mx == 2 then 2\n else (2, 3, ([2,3] | next))\n end ;\n\n# Return an array of the distinct prime factors of . in increasing order\ndef prime_factors:\n\n # Return an array of prime factors of . given that \"primes\"\n # is an array of relevant primes:\n def pf($primes):\n if . <= 1 then []\n else . as $in\n | if ($in | relatively_prime($primes)) then [$in]\n else reduce $primes[] as $p\n ([];\n if ($in % $p) != 0 then .\n \t else . + [$p] + (($in / $p) | pf($primes))\n\t end)\n end\n | unique\n end;\n\n if . <= 1 then []\n else . as $in\n | pf( [ primes( (1+$in) | sqrt | floor) ] )\n end;\n","language":"Jq"},{"code":"def isSquareFree:\n . as $n\n | 2\n | until ( (. * . > $n) or . == 0;\n if ($n % (.*.) == 0) then 0 # i.e. stop\n elif . > 2 then . + 2\n else . + 1\n end )\n | . != 0;\n\ndef mu:\n . as $n\n | if . < 1 then \"Argument to mu must be a positive integer\" | error\n elif . == 1 then 1\n else if isSquareFree\n then if ((prime_factors|length) % 2 == 0) then 1\n else -1\n end\n else 0\n end\n end;\n","language":"Jq"},{"code":"def nwise($n):\n def n: if length <= $n then . else .[0:$n] , (.[$n:] | n) end;\n n;\n\ndef task:\n def pp: if . >=0 then \" \\(.)\" else tostring end;\n \"The first 199 Möbius numbers are:\",\n ([\" \", (range(1; 200) | mu | pp )]\n | nwise(20)\n | join(\" \") ) ;\n\ntask\n","language":"Jq"},{"code":"using Primes\n\n# modified from reinermartin's PR at https://github.com/JuliaMath/Primes.jl/pull/70/files\nfunction moebius(n::Integer)\n @assert n > 0\n m(p, e) = p == 0 ? 0 : e == 1 ? -1 : 0\n reduce(*, m(p, e) for (p, e) in factor(n) if p ≥ 0; init=1)\nend\nμ(n) = moebius(n)\n\nprint(\"First 199 terms of the Möbius sequence:\\n \")\nfor n in 1:199\n print(lpad(μ(n), 3), n % 20 == 19 ? \"\\n\" : \"\")\nend\n","language":"Julia"},{"code":"import kotlin.math.sqrt\n\nfun main() {\n println(\"First 199 terms of the möbius function are as follows:\")\n print(\" \")\n for (n in 1..199) {\n print(\"%2d \".format(mobiusFunction(n)))\n if ((n + 1) % 20 == 0) {\n println()\n }\n }\n}\n\nprivate const val MU_MAX = 1000000\nprivate var MU: IntArray? = null\n\n// Compute mobius function via sieve\nprivate fun mobiusFunction(n: Int): Int {\n if (MU != null) {\n return MU!![n]\n }\n\n // Populate array\n MU = IntArray(MU_MAX + 1)\n val sqrt = sqrt(MU_MAX.toDouble()).toInt()\n for (i in 0 until MU_MAX) {\n MU!![i] = 1\n }\n for (i in 2..sqrt) {\n if (MU!![i] == 1) {\n // for each factor found, swap + and -\n for (j in i..MU_MAX step i) {\n MU!![j] *= -i\n }\n // square factor = 0\n for (j in i * i..MU_MAX step i * i) {\n MU!![j] = 0\n }\n }\n }\n for (i in 2..MU_MAX) {\n when {\n MU!![i] == i -> {\n MU!![i] = 1\n }\n MU!![i] == -i -> {\n MU!![i] = -1\n }\n MU!![i] < 0 -> {\n MU!![i] = 1\n }\n MU!![i] > 0 -> {\n MU!![i] = -1\n }\n }\n }\n return MU!![n]\n}\n","language":"Kotlin"},{"code":"function buildArray(size, value)\n local tbl = {}\n for i=1, size do\n table.insert(tbl, value)\n end\n return tbl\nend\n\nMU_MAX = 1000000\nsqroot = math.sqrt(MU_MAX)\nmu = buildArray(MU_MAX, 1)\n\nfor i=2, sqroot do\n if mu[i] == 1 then\n -- for each factor found, swap + and -\n for j=i, MU_MAX, i do\n mu[j] = mu[j] * -i\n end\n -- square factor = 0\n for j=i*i, MU_MAX, i*i do\n mu[j] = 0\n end\n end\nend\n\nfor i=2, MU_MAX do\n if mu[i] == i then\n mu[i] = 1\n elseif mu[i] == -i then\n mu[i] = -1\n elseif mu[i] < 0 then\n mu[i] = 1\n elseif mu[i] > 0 then\n mu[i] = -1\n end\nend\n\nprint(\"First 199 terms of the mobius function are as follows:\")\nio.write(\" \")\nfor i=1, 199 do\n io.write(string.format(\"%2d \", mu[i]))\n if (i + 1) % 20 == 0 then\n print()\n end\nend\n","language":"Lua"},{"code":"Grid[Partition[MoebiusMu[Range[99]], UpTo[10]]]\n","language":"Mathematica"},{"code":"10 REM Moebius function\n20 FOR T = 0 TO 9\n30 FOR U = 1 TO 10\n40 LET N = 10*T+U\n50 GOSUB 110\n60 PRINT M;\" \";\n70 NEXT U\n80 PRINT\n90 NEXT T\n100 END\n\n110 LET M = 1\n120 IF N = 1 THEN 230\n130 LET F = 2\n140 LET F2 = F*F\n150 IF INT(N/F2)*F2 <> N THEN 180\n160 LET M = 0\n170 GOTO 230\n180 IF INT(N/F)*F <> N THEN 210\n190 LET M = -M\n200 LET N = N/F\n210 LET F = F+1\n220 IF F <= N THEN 140\n230 RETURN\n","language":"Minimal-BASIC"},{"code":"import std/[math, sequtils, strformat]\n\nfunc getStep(n: int): int {.inline.} =\n result = 1 + n shl 2 - n shr 1 shl 1\n\nfunc primeFac(n: int): seq[int] =\n var\n maxq = int(sqrt(float(n)))\n d = 1\n q: int = 2 + (n and 1) # Start with 2 or 3 according to oddity.\n\n while q <= maxq and n %% q != 0:\n q = getStep(d)\n inc d\n if q <= maxq:\n let q1 = primeFac(n /% q)\n let q2 = primeFac(q)\n result = concat(q2, q1, result)\n else:\n result.add(n)\n\nfunc squareFree(num: int): bool =\n let fact = primeFac num\n\n for i in fact:\n if fact.count(i) > 1:\n return false\n\n return true\n\nfunc mobius(num: int): int =\n if num == 1: return num\n\n let fact = primeFac num\n\n for i in fact:\n ## check if it has a squared prime factor\n if fact.count(i) == 2:\n return 0\n\n if num.squareFree:\n if fact.len mod 2 == 0:\n return 1\n else:\n return -1\n\nwhen isMainModule:\n echo \"The first 199 möbius numbers are:\"\n\n for i in 1..199:\n stdout.write fmt\"{mobius(i):4}\"\n if i mod 20 == 0:\n echo \"\" # print newline\n","language":"Nim"},{"code":"{\n for(i = 1, 99,\n print1(moebius(i) \" \");\n if(i % 10 == 0, print(\"\\n\"););\n );\n}\n","language":"PARI-GP"},{"code":"use utf8;\nuse strict;\nuse warnings;\nuse feature 'say';\nuse List::Util 'uniq';\n\nsub prime_factors {\n my ($n, $d, @factors) = (shift, 1);\n while ($n > 1 and $d++) {\n $n /= $d, push @factors, $d until $n % $d;\n }\n @factors\n}\n\nsub μ {\n my @p = prime_factors(shift);\n @p == uniq(@p) ? 0 == @p%2 ? 1 : -1 : 0;\n}\n\nmy @möebius;\npush @möebius, μ($_) for 1 .. (my $upto = 199);\n\nsay \"Möbius sequence - First $upto terms:\\n\" .\n (' 'x4 . sprintf \"@{['%4d' x $upto]}\", @möebius) =~ s/((.){80})/$1\\n/gr;\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;\">Moebius</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;\">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> <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">f</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">prime_factors</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</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: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">f</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;\">i</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: #008080;\">return</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;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">odd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">length</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><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;\">s</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: #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;\">199</span> <span style=\"color: #008080;\">do</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</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;\">\"%3d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">Moebius</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: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join_by</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;\">20</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">))</span>\n<!--\n","language":"Phix"},{"code":"# Python Program to evaluate\n# Mobius def M(N) = 1 if N = 1\n# M(N) = 0 if any prime factor\n# of N is contained twice\n# M(N) = (-1)^(no of distinct\n# prime factors)\n# Python Program to\n# evaluate Mobius def\n# M(N) = 1 if N = 1\n# M(N) = 0 if any\n# prime factor of\n# N is contained twice\n# M(N) = (-1)^(no of\n# distinct prime factors)\n\n# def to check if\n# n is prime or not\ndef isPrime(n) :\n\n if (n < 2) :\n return False\n for i in range(2, n + 1) :\n if (i * i <= n and n % i == 0) :\n return False\n return True\n\ndef mobius(N) :\n\n # Base Case\n if (N == 1) :\n return 1\n\n # For a prime factor i\n # check if i^2 is also\n # a factor.\n p = 0\n for i in range(1, N + 1) :\n if (N % i == 0 and\n isPrime(i)) :\n\n # Check if N is\n # divisible by i^2\n if (N % (i * i) == 0) :\n return 0\n else :\n\n # i occurs only once,\n # increase f\n p = p + 1\n\n # All prime factors are\n # contained only once\n # Return 1 if p is even\n # else -1\n if(p % 2 != 0) :\n return -1\n else :\n return 1\n\n# Driver Code\nprint(\"Mobius numbers from 1..99:\")\n\nfor i in range(1, 100):\n print(f\"{mobius(i):>4}\", end = '')\n\n if i % 20 == 0: print()\n# This code is contributed by\n# Manish Shaw(manishshaw1)\n","language":"Python"},{"code":"# Python Program to evaluate\n# Mobius def M(N) = 1 if N = 1\n# M(N) = 0 if any prime factor\n# of N is contained twice\n# M(N) = (-1)^(no of distinct\n# prime factors)\nimport math\n\n# def to check if n\n# is prime or not\ndef isPrime(n) :\n\n if (n < 2) :\n return False\n for i in range(2, n + 1) :\n if (n % i == 0) :\n return False\n i = i * i\n return True\n\ndef mobius(n) :\n\n p = 0\n\n # Handling 2 separately\n if (n % 2 == 0) :\n\n n = int(n / 2)\n p = p + 1\n\n # If 2^2 also\n # divides N\n if (n % 2 == 0) :\n return 0\n\n\n # Check for all\n # other prime factors\n for i in range(3, int(math.sqrt(n)) + 1) :\n\n # If i divides n\n if (n % i == 0) :\n\n n = int(n / i)\n p = p + 1\n\n # If i^2 also\n # divides N\n if (n % i == 0) :\n return 0\n i = i + 2\n\n if(p % 2 == 0) :\n return -1\n else :\n return 1\n\n# Driver Code\nprint(\"Mobius numbers from 1..99:\")\n\nfor i in range(1, 100):\n print(f\"{mobius(i):>4}\", end = '')\n# This code is contributed by\n# Manish Shaw(manishshaw1)\n","language":"Python"},{"code":" [ false swap\n behead swap\n [ witheach\n [ tuck != if\n done\n dip not\n conclude ] ]\n drop ] is square ( [ --> b )\n\n [ 1 & ] is odd ( n --> b )\n\n [ dup 1 = if done\n primefactors\n dup square iff\n [ drop 0 ] done\n size odd iff\n -1 else 1 ] is mobius ( n --> n )\n\n say \"First 199 terms:\" cr\n say \" \"\n 199 times\n [ i^ 1+ mobius\n dup -1 > if sp\n echo\n i^ 1+ 20 mod\n 19 = iff cr\n else [ sp sp ] ]\n","language":"Quackery"},{"code":"use Prime::Factor;\n\nsub μ (Int \\n) {\n return 0 if n %% (4|9|25|49|121);\n my @p = prime-factors(n);\n +@p == +@p.unique ?? +@p %% 2 ?? 1 !! -1 !! 0\n}\n\nmy @möbius = lazy flat '', 1, (2..*).hyper.map: &μ;\n\n# The Task\nput \"Möbius sequence - First 199 terms:\\n\",\n @möbius[^200]».fmt('%3s').batch(20).join: \"\\n\";\n","language":"Raku"},{"code":"/*REXX pgm computes & shows a value grid of the Möbius function for a range of integers.*/\nparse arg LO HI grp . /*obtain optional arguments from the CL*/\nif LO=='' | LO==\",\" then LO= 0 /*Not specified? Then use the default.*/\nif HI=='' | HI==\",\" then HI= 199 /* \" \" \" \" \" \" */\nif grp=='' | grp==\",\" then grp= 20 /* \" \" \" \" \" \" */\n /* ______ */\ncall genP HI /*generate primes up to the √ HI */\nsay center(' The Möbius sequence from ' LO \" ──► \" HI\" \", max(50, grp*3), '═') /*title*/\n$= /*variable holds output grid of GRP #s.*/\n do j=LO to HI; $= $ right( mobius(j), 2) /*process some numbers from LO ──► HI.*/\n if words($)==grp then do; say substr($, 2); $= /*show grid if fully populated,*/\n end /* and nullify it for more #s.*/\n end /*j*/ /*for small grids, using wordCnt is OK.*/\n\nif $\\=='' then say substr($, 2) /*handle any residual numbers not shown*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nmobius: procedure expose @.; parse arg x /*obtain a integer to be tested for mu.*/\n if x<1 then return '∙' /*special? Then return symbol for null.*/\n #= 0 /*start with a value of zero. */\n do k=1; p= @.k /*get the Kth (pre─generated) prime.*/\n if p>x then leave /*prime (P) > X? Then we're done. */\n if p*p>x then do; #= #+1; leave /*prime (P**2 > X? Bump # and leave.*/\n end\n if x//p==0 then do; #= #+1 /*X divisible by P? Bump mu number. */\n x= x % p /* Divide by prime. */\n if x//p==0 then return 0 /*X÷by P? Then return zero*/\n end\n end /*k*/ /*# (below) is almost always small, <9*/\n if #//2==0 then return 1 /*Is # even? Then return postive 1 */\n return -1 /* \" \" odd? \" \" negative 1. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngenP: @.1=2; @.2=3; @.3=5; @.4=7; @.5=11; @.6= 13; nP=6 /*assign low primes; # primes.*/\n do lim=nP until lim*lim>=HI /*only keep primes up to the sqrt(HI).*/\n end /*lim*/\n do j=@.nP+4 by 2 to HI /*only find odd primes from here on. */\n parse var j '' -1 _;if _==5 then iterate /*Is last digit a \"5\"? Then not prime*/\n if j// 3==0 then iterate /*is J divisible by 3? \" \" \" */\n if j// 7==0 then iterate /* \" \" \" \" 7? \" \" \" */\n if j//11==0 then iterate /* \" \" \" \" 11? \" \" \" */\n if j//13==0 then iterate /* \" \" \" \" 13? \" \" \" */\n do k=7 while k*k<=j /*divide by some generated odd primes. */\n if j // @.k==0 then iterate j /*Is J divisible by P? Then not prime*/\n end /*k*/ /* [↓] a prime (J) has been found. */\n nP= nP+1; if nP<=HI then @.nP= j /*bump prime count; assign prime to @.*/\n end /*j*/; return\n","language":"REXX"},{"code":"mobStr = \" . \"\n\nfor i = 1 to 200\n if mobius(i) >= 0\n mobStr + = \" \"\n ok\n temp = string(mobius(i))\n if left(temp,2) = \"-0\"\n temp = right(temp,len(temp)-1)\n ok\n mobStr += temp + \" \"\n if i % 10 = 9\n see mobStr + nl\n mobStr = \" \"\n ok\nnext\n\nfunc mobius(n)\n if n = 1\n return 1\n ok\n for d = 2 to ceil(sqrt(n))\n if n % d = 0\n if n % (d*d) = 0\n return 0\n ok\n return -mobius(n/d)\n ok\n next\n return -1\n","language":"Ring"},{"code":"require 'prime'\n\ndef μ(n)\n pd = n.prime_division\n return 0 unless pd.map(&:last).all?(1)\n pd.size.even? ? 1 : -1\nend\n\n([\" \"] + (1..199).map{|n|\"%2s\" % μ(n)}).each_slice(20){|line| puts line.join(\" \") }\n","language":"Ruby"},{"code":"fn moebius(mut x: u64) -> i8 {\n let mut prime_count = 0;\n\n // If x is divisible by the given factor this macro counts the factor and divides it out.\n // It then returns zero if x is still divisible by the factor.\n macro_rules! divide_x_by {\n ($factor:expr) => {\n if x % $factor == 0 {\n x /= $factor;\n prime_count += 1;\n if x % $factor == 0 {\n return 0;\n }\n }\n };\n }\n\n // Handle 2 and 3 separately,\n divide_x_by!(2);\n divide_x_by!(3);\n\n // then use a wheel sieve to check the remaining factors <= √x.\n for i in (5..=isqrt(x)).step_by(6) {\n divide_x_by!(i);\n divide_x_by!(i + 2);\n }\n\n // There can exist one prime factor larger than √x,\n // in that case we can check if x is still larger than one, and then count it.\n if x > 1 {\n prime_count += 1;\n }\n\n if prime_count % 2 == 0 {\n 1\n } else {\n -1\n }\n}\n\n/// Returns the largest integer smaller than or equal to `√n`\nconst fn isqrt(n: u64) -> u64 {\n if n <= 1 {\n n\n } else {\n let mut x0 = u64::pow(2, n.ilog2() / 2 + 1);\n let mut x1 = (x0 + n / x0) / 2;\n while x1 < x0 {\n x0 = x1;\n x1 = (x0 + n / x0) / 2;\n }\n x0\n }\n}\n\nfn main() {\n const ROWS: u64 = 10;\n const COLS: u64 = 20;\n println!(\n \"Values of the Möbius function, μ(x), for x between 0 and {}:\",\n COLS * ROWS\n );\n for i in 0..ROWS {\n for j in 0..=COLS {\n let x = COLS * i + j;\n let μ = moebius(x);\n if μ >= 0 {\n // Print an extra space if there's no minus sign in front of the output\n // in order to align the numbers in a nice grid.\n print!(\" \");\n }\n print!(\"{μ} \");\n }\n println!();\n }\n let x = u64::MAX;\n println!(\"\\nμ({x}) = {}\", moebius(x));\n}\n","language":"Rust"},{"code":"say moebius(53) #=> -1\nsay moebius(54) #=> 0\nsay moebius(55) #=> 1\n","language":"Sidef"},{"code":"func μ(n) {\n var f = n.factor_exp.map { .tail }\n f.any { _ > 1 } ? 0 : ((-1)**f.sum)\n}\n\nwith (199) { |n|\n say \"Values of the Möbius function for numbers in the range 1..#{n}:\"\n [' '] + (1..n->map(μ)) -> each_slice(20, {|*line|\n say line.map { '%2s' % _ }.join(' ')\n })\n}\n","language":"Sidef"},{"code":" PRINT \"Enter an integer\"\n INPUT N\n IF N < 0 THEN LET N = -N\n IF N < 2 THEN GOTO 100 + N\n LET C = 1\n LET F = 2\n 10 IF ((N/F)/F)*F*F = N THEN GOTO 100\n IF (N/F)*F = N THEN GOTO 30\n 20 LET F = F + 1\n IF F<=N THEN GOTO 10\n GOTO 100 + C\n 30 LET N = N / F\n LET C = -C\n GOTO 20\n 99 PRINT \"-1\"\n END\n100 PRINT \"0\"\n END\n101 PRINT \"1\"\n END\n","language":"Tiny-BASIC"},{"code":"import \"./fmt\" for Fmt\nimport \"./math\" for Int\n\nvar isSquareFree = Fn.new { |n|\n var i = 2\n while (i * i <= n) {\n if (n%(i*i) == 0) return false\n i = (i > 2) ? i + 2 : i + 1\n }\n return true\n}\n\nvar mu = Fn.new { |n|\n if (n < 1) Fiber.abort(\"Argument must be a positive integer\")\n if (n == 1) return 1\n var sqFree = isSquareFree.call(n)\n var factors = Int.primeFactors(n)\n if (sqFree && factors.count % 2 == 0) return 1\n if (sqFree) return -1\n return 0\n}\n\nSystem.print(\"The first 199 Möbius numbers are:\")\nfor (i in 0..9) {\n for (j in 0..19) {\n if (i == 0 && j == 0) {\n System.write(\" \")\n } else {\n Fmt.write(\"$ 3d \", mu.call(i*20 + j))\n }\n }\n System.print()\n}\n","language":"Wren"},{"code":"func Mobius(N);\nint N, Cnt, F, K;\n[Cnt:= 0;\nF:= 2; K:= 0;\nrepeat if rem(N/F) = 0 then\n [Cnt:= Cnt+1;\n N:= N/F;\n K:= K+1;\n if K >= 2 then return 0;\n ]\n else [F:= F+1; K:= 0];\nuntil F > N;\nreturn if Cnt&1 then -1 else 1;\n];\n\nint N;\n[Format(3, 0);\nText(0, \" \");\nfor N:= 1 to 199 do\n [RlOut(0, float(Mobius(N)));\n if rem(N/20) = 19 then CrLf(0);\n ];\n]\n","language":"XPL0"},{"code":"outstr$ = \" . \"\nfor i = 1 to 200\n if mobius(i) >= 0 then outstr$ = outstr$ + \" \" : fi\n outstr$ = outstr$ + str$(mobius(i)) + \" \"\n if mod(i, 10) = 9 then\n print outstr$\n outstr$ = \"\"\n end if\nnext i\nend\n\nsub mobius(n)\n if n = 1 then return 1 : fi\n for d = 2 to int(sqr(n))\n if mod(n, d) = 0 then\n if mod(n, (d*d)) = 0 then return 0 : fi\n return -mobius(n/d)\n end if\n next d\n return -1\nend sub\n","language":"Yabasic"},{"code":"fcn mobius(n){\n pf:=primeFactors(n);\n sq:=pf.filter1('wrap(f){ (n % (f*f))==0 }); // False if square free\n if(sq==False){ if(pf.len().isEven) 1 else -1 }\n else 0\n}\nfcn primeFactors(n){ // Return a list of prime 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)) # both are tail recursion\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"},{"code":"[1..199].apply(mobius)\n.pump(Console.println, T(Void.Read,19,False),\n\tfcn{ vm.arglist.pump(String,\"%3d\".fmt) });\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Möbius_function\\nnote: Prime Numbers\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"The classical '''Möbius function: μ(n)''' is an important multiplicative function in number theory and combinatorics.\\n\\nThere are several ways to implement a Möbius function.\\n\\nA fairly straightforward method is to find the prime factors of a positive integer '''n''', then define '''μ(n)''' based on the sum of the primitive factors. It has the values '''{−1, 0, 1}''' depending on the factorization of '''n''':\\n\\n:* '''μ(1)''' is defined to be '''1'''.\\n\\n:* '''μ(n) = 1''' if '''n''' is a square-free positive integer with an '''even''' number of prime factors.\\n\\n:* '''μ(n) = −1''' if '''n''' is a square-free positive integer with an '''odd''' number of prime factors.\\n\\n:* '''μ(n) = 0''' if '''n''' has a '''squared''' prime factor.\\n\\n\\n;Task:\\n:* Write a routine (function, procedure, whatever) '''μ(n)''' to find the Möbius number for a positive integer '''n'''.\\n\\n:* Use that routine to find and display here, on this page, at least the first 99 terms in a grid layout. (Not just one long line or column of numbers.)\\n\\n\\n;See also:\\n:*; [[wp:Möbius function|Wikipedia: Möbius function]]\\n\\n\\n;Related Tasks:\\n:*; [[Mertens function]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F isPrime(n)\\n I n < 2\\n R 0B\\n L(i) 2 .. n\\n I i * i <= n & n % i == 0\\n R 0B\\n R 1B\\n\\nF mobius(n)\\n I n == 1\\n R 1\\n\\n V p = 0\\n L(i) 1 .. n\\n I n % i == 0 & isPrime(i)\\n I n % (i * i) == 0\\n R 0\\n E\\n p = p + 1\\n\\n I p % 2 != 0\\n R -1\\n E\\n R 1\\n\\nprint(‘Mobius numbers from 1..99:’)\\n\\nL(i) 1..99\\n print(f:‘{mobius(i):4}’, end' ‘’)\\n\\n I i % 20 == 0\\n print()\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"BEGIN\\n # show the first 199 values of the moebius function #\\n INT sq root = 1 000;\\n INT mu max = sq root * sq root;\\n [ 1 : mu max ]INT mu;\\n FOR i FROM LWB mu TO UPB mu DO mu[ i ] := 1 OD;\\n FOR i FROM 2 TO sq root DO\\n IF mu[ i ] = 1 THEN\\n # for each factor found, swap + and - #\\n FOR j FROM i BY i TO UPB mu DO mu[ j ] *:= -i OD;\\n FOR j FROM i * i BY i * i TO UPB mu DO mu[ j ] := 0 OD\\n FI\\n OD;\\n FOR i FROM 2 TO UPB mu DO\\n IF mu[ i ] = i THEN mu[ i ] := 1\\n ELIF mu[ i ] = -i THEN mu[ i ] := -1\\n ELIF mu[ i ] < 0 THEN mu[ i ] := 1\\n ELIF mu[ i ] > 0 THEN mu[ i ] := -1\\n # ELSE mu[ i ] = 0 so no change #\\n FI\\n OD;\\n print( ( \\\"First 199 terms of the möbius function are as follows:\\\", newline, \\\" \\\" ) );\\n FOR i TO 199 DO\\n print( ( whole( mu[ i ], -4 ) ) );\\n IF ( i + 1 ) MOD 20 = 0 THEN print( ( newline ) ) FI\\n OD\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <basico.h>\\n\\n#proto cálculodeMobius(_X_)\\n#synon _cálculodeMobius calcularMobius\\n\\nalgoritmo\\n\\n imprimir (\\\"Mobius numbers from 1..199\\\\n\\\")\\n i=0, s=1\\n iterar grupo( ++i, #(i<=199), calcular Mobius (i), \\\\\\n solo si (#( iszero(s%20) ), NL;s=0 ), imprimir, ++s )\\n saltar\\nterminar\\n\\nsubrutinas\\n\\ncálculo de Mobius (n)\\n si( #(n==0) ) ; tomar '\\\" \\\"'\\n sino si( #(n==1) ); tomar '\\\" 1\\\"'\\n sino; p=0\\n iterar para (i=1, #(i<=n+1), ++i)\\n si ( #( iszero(n%i) && isprime(i)) )\\n cuando ( #( iszero(n%(i*i)) ) ){\\n tomar '\\\" 0\\\"'; ir a (herejía) /* ¡! */\\n } ++p\\n fin si\\n siguiente\\n tomar si ( es impar(p), \\\" -1\\\", \\\" 1\\\" )\\n fin si\\n\\n/* ¡Dios! ¡Purifica esta mierda! ----+ */\\n /* | */\\nherejía: /* <----------------------+ */\\n retornar\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"10 HOME\\n20 FOR t = 0 TO 9\\n30 FOR u = 1 TO 10\\n40 n = 10*t+u\\n50 GOSUB 130\\n60 IF STR$(m) = \\\"0\\\" THEN PRINT \\\" 0\\\";\\n70 IF STR$(m) = \\\"1\\\" THEN PRINT \\\" 1\\\";\\n80 IF STR$(m) = \\\"-1\\\" THEN PRINT \\\" -1\\\";\\n90 NEXT u\\n100 PRINT\\n110 NEXT t\\n120 END\\n130 IF n = 1 THEN m = 1 : RETURN\\n140 m = 1 : f = 2\\n150 IF (n-INT(n/(f*f))*(f*f)) = 0 THEN m = 0 : RETURN\\n160 IF (n-INT(n/(f))*(f)) = 0 THEN GOSUB 200\\n170 f = f+1\\n180 IF f <= n THEN GOTO 150\\n190 RETURN\\n200 m = -m\\n210 n = n/f\\n220 RETURN\\n230 END\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"mobius: function [n][\\n if n=0 -> return \\\"\\\"\\n if n=1 -> return 1\\n f: factors.prime n\\n\\n if f <> unique f -> return 0\\n if? odd? size f -> return neg 1\\n else -> return 1\\n]\\n\\nloop split.every:20 map 0..199 => mobius 'a ->\\n print map a => [pad to :string & 3]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"loop 100\\n result .= SubStr(\\\" \\\" Möbius(A_Index), -1) . (Mod(A_Index, 10) ? \\\" \\\" : \\\"`n\\\")\\nMsgBox, 262144, , % result\\nreturn\\n\\nMöbius(n){\\n if n=1\\n return 1\\n x := prime_factors(n)\\n c := x.Count()\\n sq := []\\n for i, v in x\\n if sq[v]\\n return 0\\n else\\n sq[v] := 1\\n return (c/2 = floor(c/2)) ? 1 : -1\\n}\\n\\nprime_factors(n) {\\n if (n <= 3)\\n return [n]\\n ans := [], done := false\\n while !done {\\n if !Mod(n, 2)\\n ans.push(2), n /= 2\\n else if !Mod(n, 3)\\n ans.push(3), n /= 3\\n else if (n = 1)\\n return ans\\n else {\\n sr := sqrt(n), done := true, i := 6\\n while (i <= sr+6) {\\n if !Mod(n, i-1) { ; is n divisible by i-1?\\n ans.push(i-1), n /= i-1, done := false\\n break\\n }\\n if !Mod(n, i+1) { ; is n divisible by i+1?\\n ans.push(i+1), n /= i+1, done := false\\n break\\n }\\n i += 6\\n }}}\\n ans.push(Format(\\\"{:d}\\\", n))\\n return ans\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f MOBIUS_FUNCTION.AWK\\n# converted from Java\\nBEGIN {\\n printf(\\\"first 199 terms of the mobius sequence:\\\\n \\\")\\n for (n=1; n<200; n++) {\\n printf(\\\"%3d\\\",mobius(n))\\n if ((n+1) % 20 == 0) {\\n printf(\\\"\\\\n\\\")\\n }\\n }\\n exit(0)\\n}\\nfunction mobius(n, i,j,mu_max) {\\n if (n in MU) {\\n return(MU[n])\\n }\\n mu_max = 1000000\\n for (i=0; i<mu_max; i++) { # populate array\\n MU[i] = 1\\n }\\n for (i=2; i<=int(sqrt(mu_max)); i++ ) {\\n if (MU[i] == 1) {\\n for (j=i; j<=mu_max; j+=i) { # for each factor found, swap + and -\\n MU[j] *= -i\\n }\\n for (j=i*i; j<=mu_max; j+=i*i) { # square factor = 0\\n MU[j] = 0\\n }\\n }\\n }\\n for (i=2; i<=mu_max; i++) {\\n if (MU[i] == i) {\\n MU[i] = 1\\n }\\n else if (MU[i] == -i) {\\n MU[i] = -1\\n }\\n else if (MU[i] < 0) {\\n MU[i] = 1\\n }\\n else if (MU[i] > 0) {\\n MU[i] = -1\\n }\\n }\\n return(MU[n])\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"function mobius(n)\\n\\tif n = 1 then return 1\\n\\tfor d = 2 to int(sqr(n))\\n\\t\\tif n mod d = 0 then\\n\\t\\t\\tif n mod (d*d) = 0 then return 0\\n\\t\\t\\treturn -mobius(n/d)\\n\\t\\tend if\\n\\tnext d\\n\\treturn -1\\nend function\\n\\noutstr$ = \\\" . \\\"\\nfor i = 1 to 200\\n\\tif mobius(i) >= 0 then outstr$ += \\\" \\\"\\n\\toutstr$ += string(mobius(i)) + \\\" \\\"\\n\\tif i mod 10 = 9 then\\n\\t\\tprint outstr$\\n\\t\\toutstr$ = \\\"\\\"\\n\\tend if\\nnext i\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"#include <math.h>\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n\\nint main() {\\n const int MU_MAX = 1000000;\\n int i, j;\\n int *mu;\\n int sqroot;\\n\\n sqroot = (int)sqrt(MU_MAX);\\n\\n mu = malloc((MU_MAX + 1) * sizeof(int));\\n\\n for (i = 0; i < MU_MAX;i++) {\\n mu[i] = 1;\\n }\\n\\n for (i = 2; i <= sqroot; i++) {\\n if (mu[i] == 1) {\\n // for each factor found, swap + and -\\n for (j = i; j <= MU_MAX; j += i) {\\n mu[j] *= -i;\\n }\\n // square factor = 0\\n for (j = i * i; j <= MU_MAX; j += i * i) {\\n mu[j] = 0;\\n }\\n }\\n }\\n\\n for (i = 2; i <= MU_MAX; i++) {\\n if (mu[i] == i) {\\n mu[i] = 1;\\n } else if (mu[i] == -i) {\\n mu[i] = -1;\\n } else if (mu[i] < 0) {\\n mu[i] = 1;\\n } else if (mu[i] > 0) {\\n mu[i] = -1;\\n }\\n }\\n\\n printf(\\\"First 199 terms of the möbius function are as follows:\\\\n \\\");\\n for (i = 1; i < 200; i++) {\\n printf(\\\"%2d \\\", mu[i]);\\n if ((i + 1) % 20 == 0) {\\n printf(\\\"\\\\n\\\");\\n }\\n }\\n\\n free(mu);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iomanip>\\n#include <iostream>\\n#include <vector>\\n\\nconstexpr int MU_MAX = 1'000'000;\\nstd::vector<int> MU;\\n\\nint mobiusFunction(int n) {\\n if (!MU.empty()) {\\n return MU[n];\\n }\\n\\n // Populate array\\n MU.resize(MU_MAX + 1, 1);\\n int root = sqrt(MU_MAX);\\n\\n for (int i = 2; i <= root; i++) {\\n if (MU[i] == 1) {\\n // for each factor found, swap + and -\\n for (int j = i; j <= MU_MAX; j += i) {\\n MU[j] *= -i;\\n }\\n // square factor = 0\\n for (int j = i * i; j <= MU_MAX; j += i * i) {\\n MU[j] = 0;\\n }\\n }\\n }\\n\\n for (int i = 2; i <= MU_MAX; i++) {\\n if (MU[i] == i) {\\n MU[i] = 1;\\n } else if (MU[i] == -i) {\\n MU[i] = -1;\\n } else if (MU[i] < 0) {\\n MU[i] = 1;\\n } else if (MU[i] > 0) {\\n MU[i] = -1;\\n }\\n }\\n\\n return MU[n];\\n}\\n\\nint main() {\\n std::cout << \\\"First 199 terms of the möbius function are as follows:\\\\n \\\";\\n for (int n = 1; n < 200; n++) {\\n std::cout << std::setw(2) << mobiusFunction(n) << \\\" \\\";\\n if ((n + 1) % 20 == 0) {\\n std::cout << '\\\\n';\\n }\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"10 CLS\\n20 FOR t = 0 TO 9\\n30 FOR u = 1 TO 10\\n40 n = 10 * t + u\\n50 GOSUB 110\\n60 PRINT USING \\\"## \\\"; m;\\n70 NEXT u\\n80 PRINT\\n90 NEXT t\\n100 END\\n110 IF n = 1 THEN m = 1: RETURN\\n120 m = 1: f = 2\\n130 IF n MOD (f * f) = 0 THEN m = 0: RETURN\\n140 IF n MOD f = 0 THEN GOSUB 180\\n150 f = f + 1\\n160 IF f <= n THEN GOTO 130\\n170 RETURN\\n180 m = -m\\n190 n = n / f\\n200 RETURN\\n210 END\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"import std.math;\\nimport std.stdio;\\n\\nimmutable MU_MAX = 1_000_000;\\n\\nint mobiusFunction(int n) {\\n static initialized = false;\\n static int[MU_MAX + 1] MU;\\n\\n if (initialized) {\\n return MU[n];\\n }\\n\\n // populate array\\n MU[] = 1;\\n int root = cast(int) sqrt(cast(real) MU_MAX);\\n\\n for (int i = 2; i <= root; i++) {\\n if (MU[i] == 1) {\\n // for each factor found, swap + and -\\n for (int j = i; j <= MU_MAX; j += i) {\\n MU[j] *= -i;\\n }\\n // square factor = 0\\n for (int j = i * i; j <= MU_MAX; j += i * i) {\\n MU[j] = 0;\\n }\\n }\\n }\\n\\n for (int i = 2; i <= MU_MAX; i++) {\\n if (MU[i] == i) {\\n MU[i] = 1;\\n } else if (MU[i] == -i) {\\n MU[i] = -1;\\n } else if (MU[i] < 0) {\\n MU[i] = 1;\\n } else if (MU[i] > 0) {\\n MU[i] = -1;\\n }\\n }\\n\\n initialized = true;\\n return MU[n];\\n}\\n\\nvoid main() {\\n writeln(\\\"First 199 terms of the möbius function are as follows:\\\");\\n write(\\\" \\\");\\n for (int n = 1; n < 200; n++) {\\n writef(\\\"%2d \\\", mobiusFunction(n));\\n if ((n + 1) % 20 == 0) {\\n writeln;\\n }\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"function IsPrime(N: int64): boolean;\\n{Fast, optimised prime test}\\nvar I,Stop: int64;\\nbegin\\nif (N = 2) or (N=3) then Result:=true\\nelse if (n <= 1) or ((n mod 2) = 0) or ((n mod 3) = 0) then Result:= false\\nelse\\n begin\\n I:=5;\\n Stop:=Trunc(sqrt(N+0.0));\\n Result:=False;\\n while I<=Stop do\\n begin\\n if ((N mod I) = 0) or ((N mod (I + 2)) = 0) then exit;\\n Inc(I,6);\\n end;\\n Result:=True;\\n end;\\nend;\\n\\n\\n\\nfunction GetNextPrime(var Start: integer): integer;\\n{Get the next prime number after Start}\\n{Start is passed by \\\"reference,\\\" so the\\n{original variable is incremented}\\nbegin\\nrepeat Inc(Start)\\nuntil IsPrime(Start);\\nResult:=Start;\\nend;\\n\\n\\ntype TIntArray = array of integer;\\n\\n\\nprocedure StoreNumber(N: integer; var IA: TIntArray);\\n{Expand and store number in array}\\nbegin\\nSetLength(IA,Length(IA)+1);\\nIA[High(IA)]:=N;\\nend;\\n\\n\\nprocedure GetPrimeFactors(N: integer; var Facts: TIntArray);\\n{Get all the prime factors of a number}\\nvar I: integer;\\nbegin\\nI:=2;\\nrepeat\\n\\tbegin\\n\\tif (N mod I) = 0 then\\n\\t\\tbegin\\n\\t\\tStoreNumber(I,Facts);\\n\\t\\tN:=N div I;\\n\\t\\tend\\n\\telse GetNextPrime(I);\\n\\tend\\nuntil N=1;\\nend;\\n\\n\\n\\nfunction HasDuplicates(IA: TIntArray): boolean;\\n{Look for duplicates factors in array}\\nvar I: integer;\\nbegin\\nResult:=True;\\nfor I:=0 to Length(IA)-1 do\\n if IA[I]=IA[I+1] then exit;\\nResult:=False;\\nend;\\n\\n\\nfunction Moebius(N: integer): integer;\\n{Get moebius function of number}\\nvar I: integer;\\nvar Factors: TIntArray;\\nvar Even,Square: boolean;\\nbegin\\n{Collect all prime factors}\\nSetLength(Factors,0);\\nGetPrimeFactors(N,Factors);\\n{Are there an even number of factors?}\\nEven:=(Length(Factors) and 1)=0;\\n{If there are duplicates, there are perfect squares}\\nSquare:=HasDuplicates(Factors);\\n{Return the Moebius function value}\\nif Square then Result:=0\\nelse if Even then Result:=1\\nelse Result:=-1;\\nend;\\n\\nprocedure TestMoebiusFactors(Memo: TMemo);\\n{Test Moebius function for 1..200-1}\\nvar N,M: integer;\\nvar S: string;\\nbegin\\nS:='';\\nfor N:=1 to 199 do\\n\\tbegin\\n\\tM:=Moebius(N);\\n\\tS:=S+Format('%3d',[M]);\\n\\tif (N mod 20)=19 then S:=S+#$0D#$0A\\n\\tend;\\nMemo.Text:=S;\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"mu_max = 100000\\nsqroot = floor sqrt mu_max\\n#\\nfor i to mu_max\\n mu[] &= 1\\n.\\nfor i = 2 to sqroot\\n if mu[i] = 1\\n for j = i step i to mu_max\\n mu[j] *= -i\\n .\\n for j = i * i step i * i to mu_max\\n mu[j] = 0\\n .\\n .\\n.\\nfor i = 2 to mu_max\\n if mu[i] = i\\n mu[i] = 1\\n elif mu[i] = -i\\n mu[i] = -1\\n elif mu[i] < 0\\n mu[i] = 1\\n elif mu[i] > 0\\n mu[i] = -1\\n .\\n.\\nnumfmt 0 3\\nfor i = 1 to 100\\n write mu[i]\\n if i mod 10 = 0\\n print \\\"\\\"\\n .\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"// Möbius function. Nigel Galloway: January 31st., 2021\\nlet fN g=let n=primes32()\\n let rec fN i g e l=match (l/g,l%g,e) with (1,0,false)->i\\n |(n,0,false)->fN (0-i) g true n\\n |(_,0,true) ->0\\n |_ ->fN i (Seq.head n) false l\\n fN -1 (Seq.head n) false g\\nlet mobius=seq{yield 1; yield! Seq.initInfinite((+)2>>fN)}\\nmobius|>Seq.take 500|>Seq.chunkBySize 25|>Seq.iter(fun n->Array.iter(printf \\\"%3d\\\") n;printfn \\\"\\\")\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: formatting grouping io math.extras math.ranges sequences ;\\n\\n\\\"First 199 terms of the Möbius sequence:\\\" print\\n199 [1,b] [ mobius ] map \\\" \\\" prefix 20 group\\n[ [ \\\"%3s\\\" printf ] each nl ] each\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"program moebius\\n use iso_fortran_env, only: output_unit\\n\\n integer, parameter :: mu_max=1000000, line_break=20\\n integer, parameter :: sqroot=int(sqrt(real(mu_max)))\\n integer :: i, j\\n integer, dimension(mu_max) :: mu\\n\\n mu = 1\\n\\n do i = 2, sqroot\\n if (mu(i) == 1) then\\n do j = i, mu_max, i\\n mu(j) = mu(j) * (-i)\\n end do\\n\\n do j = i**2, mu_max, i**2\\n mu(j) = 0\\n end do\\n end if\\n end do\\n\\n do i = 2, mu_max\\n if (mu(i) == i) then\\n mu(i) = 1\\n else if (mu(i) == -i) then\\n mu(i) = -1\\n else if (mu(i) < 0) then\\n mu(i) = 1\\n else if (mu(i) > 0) then\\n mu(i) = -1\\n end if\\n end do\\n\\n write(output_unit,*) \\\"The first 199 terms of the Möbius sequence are:\\\"\\n write(output_unit,'(3x)', advance=\\\"no\\\") ! Alignment of first number\\n do i = 1, 199\\n write(output_unit,'(I2,x)', advance=\\\"no\\\") mu(i)\\n if (modulo(i+1, line_break) == 0) write(output_unit,*)\\n end do\\nend program moebius\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"function mobius( n as uinteger ) as integer\\n if n = 1 then return 1\\n for d as uinteger = 2 to int(sqr(n))\\n if n mod d = 0 then\\n if n mod (d*d) = 0 then return 0\\n return -mobius(n/d)\\n end if\\n next d\\n return -1\\nend function\\n\\ndim as string outstr = \\\" . \\\"\\nfor i as uinteger = 1 to 200\\n if mobius(i)>=0 then outstr += \\\" \\\"\\n outstr += str(mobius(i))+\\\" \\\"\\n if i mod 10 = 9 then\\n print outstr\\n outstr = \\\"\\\"\\n end if\\nnext i\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"local fn IsPrime( n as long ) as BOOL\\n BOOL result = YES\\n long i\\n\\n if ( n < 2 ) then result = NO : exit fn\\n for i = 2 to n + 1\\n if ( i * i <= n ) and ( n mod i == 0 )\\n result = NO : exit fn\\n end if\\n next\\nend fn = result\\n\\nlocal fn Mobius( n as long ) as long\\n long i, p = 0, result = 0\\n\\n if ( n == 1 ) then result = 1 : exit fn\\n for i = 1 to n + 1\\n if ( n mod i == 0 ) and ( fn IsPrime( i ) == YES )\\n if ( n mod ( i * i ) == 0 )\\n result = 0 : exit fn\\n else\\n p++\\n end if\\n end if\\n next\\n if( p mod 2 != 0 )\\n result = -1\\n else\\n result = 1\\n end if\\nend fn = result\\n\\nwindow 1, @\\\"Möbius function\\\", (0,0,600,300)\\n\\nprintf @\\\"First 100 terms of Mobius sequence:\\\"\\n\\nlong i\\nfor i = 1 to 100\\n printf @\\\"%2ld\\\\t\\\", fn Mobius(i)\\n if ( i mod 20 == 0 ) then print\\nnext\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc möbius(to int) []int {\\n if to < 1 {\\n to = 1\\n }\\n mobs := make([]int, to+1) // all zero by default\\n primes := []int{2}\\n for i := 1; i <= to; i++ {\\n j := i\\n cp := 0 // counts prime factors\\n spf := false // true if there is a square prime factor\\n for _, p := range primes {\\n if p > j {\\n break\\n }\\n if j%p == 0 {\\n j /= p\\n cp++\\n }\\n if j%p == 0 {\\n spf = true\\n break\\n }\\n }\\n if cp == 0 && i > 2 {\\n cp = 1\\n primes = append(primes, i)\\n }\\n if !spf {\\n if cp%2 == 0 {\\n mobs[i] = 1\\n } else {\\n mobs[i] = -1\\n }\\n }\\n }\\n return mobs\\n}\\n\\nfunc main() {\\n mobs := möbius(199)\\n fmt.Println(\\\"Möbius sequence - First 199 terms:\\\")\\n for i := 0; i < 200; i++ {\\n if i == 0 {\\n fmt.Print(\\\" \\\")\\n continue\\n }\\n if i%20 == 0 {\\n fmt.Println()\\n }\\n fmt.Printf(\\\" % d\\\", mobs[i])\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"10 FOR T = 0 TO 9\\n20 FOR U = 1 TO 10\\n30 N = 10*T + U\\n40 GOSUB 100\\n50 PRINT USING \\\"## \\\";M;\\n60 NEXT U\\n70 PRINT\\n80 NEXT T\\n90 END\\n100 IF N = 1 THEN M = 1 : RETURN\\n110 M = 1 : F = 2\\n120 IF N MOD (F*F) = 0 THEN M = 0 : RETURN\\n130 IF N MOD F = 0 THEN GOSUB 170\\n140 F = F + 1\\n150 IF F <= N THEN GOTO 120\\n160 RETURN\\n170 M = -M\\n180 N = N/F\\n190 RETURN\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \"import Data.List (intercalate)\\nimport Data.List.Split (chunksOf)\\nimport Data.Vector.Unboxed (toList)\\nimport Math.NumberTheory.ArithmeticFunctions.Moebius (Moebius(..),\\n sieveBlockMoebius)\\nimport System.Environment (getArgs, getProgName)\\nimport System.IO (hPutStrLn, stderr)\\nimport Text.Read (readMaybe)\\n\\n-- Calculate the Möbius function, μ(n), for a sequence of values starting at 1.\\nmoebiusBlock :: Word -> [Moebius]\\nmoebiusBlock = toList . sieveBlockMoebius 1\\n\\nshowMoebiusBlock :: Word -> [Moebius] -> String\\nshowMoebiusBlock cols = intercalate \\\"\\\\n\\\" . map (concatMap showMoebius) .\\n chunksOf (fromIntegral cols)\\n where showMoebius MoebiusN = \\\" -1\\\"\\n showMoebius MoebiusZ = \\\" 0\\\"\\n showMoebius MoebiusP = \\\" 1\\\"\\n\\nmain :: IO ()\\nmain = do\\n prog <- getProgName\\n args <- map readMaybe <$> getArgs\\n case args of\\n [Just cols, Just n] ->\\n putStrLn (\\\"μ(n) for 1 ≤ n ≤ \\\" ++ show n ++ \\\":\\\\n\\\") >>\\n putStrLn (showMoebiusBlock cols $ moebiusBlock n)\\n _ -> hPutStrLn stderr $ \\\"Usage: \\\" ++ prog ++ \\\" num-columns maximum-number\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"mu=: */@:-@~:@q:\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" mu >: i. 10 20\\n 1 _1 _1 0 _1 1 _1 0 0 1 _1 0 _1 1 1 0 _1 0 _1 0\\n 1 1 _1 0 0 1 0 0 _1 _1 _1 0 1 1 1 0 _1 1 1 0\\n_1 _1 _1 0 0 1 _1 0 0 0 1 0 _1 0 1 0 1 1 _1 0\\n_1 1 0 0 1 _1 _1 0 1 _1 _1 0 _1 1 0 0 1 _1 _1 0\\n 0 1 _1 0 1 1 1 0 _1 0 1 0 1 1 1 0 _1 0 0 0\\n_1 _1 _1 0 _1 1 _1 0 _1 _1 1 0 _1 _1 1 0 0 1 1 0\\n 0 1 1 0 0 0 _1 0 1 _1 _1 0 1 1 0 0 _1 _1 _1 0\\n 1 1 1 0 1 1 0 0 _1 0 _1 0 0 _1 1 0 _1 1 1 0\\n 1 0 _1 0 _1 1 _1 0 0 _1 0 0 _1 _1 0 0 1 1 _1 0\\n_1 _1 1 0 1 _1 1 0 0 _1 _1 0 _1 1 _1 0 _1 0 _1 0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class MöbiusFunction {\\n\\n public static void main(String[] args) {\\n System.out.printf(\\\"First 199 terms of the möbius function are as follows:%n \\\");\\n for ( int n = 1 ; n < 200 ; n++ ) {\\n System.out.printf(\\\"%2d \\\", möbiusFunction(n));\\n if ( (n+1) % 20 == 0 ) {\\n System.out.printf(\\\"%n\\\");\\n }\\n }\\n }\\n\\n private static int MU_MAX = 1_000_000;\\n private static int[] MU = null;\\n\\n // Compute mobius function via sieve\\n private static int möbiusFunction(int n) {\\n if ( MU != null ) {\\n return MU[n];\\n }\\n\\n // Populate array\\n MU = new int[MU_MAX+1];\\n int sqrt = (int) Math.sqrt(MU_MAX);\\n for ( int i = 0 ; i < MU_MAX ; i++ ) {\\n MU[i] = 1;\\n }\\n\\n for ( int i = 2 ; i <= sqrt ; i++ ) {\\n if ( MU[i] == 1 ) {\\n // for each factor found, swap + and -\\n for ( int j = i ; j <= MU_MAX ; j += i ) {\\n MU[j] *= -i;\\n }\\n // square factor = 0\\n for ( int j = i*i ; j <= MU_MAX ; j += i*i ) {\\n MU[j] = 0;\\n }\\n }\\n }\\n\\n for ( int i = 2 ; i <= MU_MAX ; i++ ) {\\n if ( MU[i] == i ) {\\n MU[i] = 1;\\n }\\n else if ( MU[i] == -i ) {\\n MU[i] = -1;\\n }\\n else if ( MU[i] < 0 ) {\\n MU[i] = 1;\\n }\\n else if ( MU[i] > 0 ) {\\n MU[i] = -1;\\n }\\n }\\n return MU[n];\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# Input: a non-negative integer, $n\\n# Output: an array of size $n + 1 such that the nth-mobius number is .[$n]\\n# i.e. $n|mobius_array[-1]\\n# For example, the first mobius number could be evaluated by 1|mobius_array[-1].\\ndef mobius_array:\\n . as $n\\n | ($n|sqrt) as $sqrt\\n | reduce range(2; 1 + $sqrt) as $i ([range(0; $n + 1) | 1];\\n if .[$i] == 1\\n then # for each factor found, swap + and -\\n reduce range($i; $n + 1; $i) as $j (.; .[$j] *= -$i)\\n | ($i*$i) as $isq # square factor = 0\\n | reduce range($isq; $n + 1; $isq) as $j (.; .[$j] = 0 )\\n else .\\n end )\\n | reduce range(2; 1 + $n) as $i (.;\\n if .[$i] == $i then .[$i] = 1\\n elif .[$i] == -$i then .[$i] = -1\\n elif .[$i] < 0 then .[$i] = 1\\n elif .[$i] > 0 then .[$i] = -1\\n else .[$i] = 0 # avoid \\\"-0\\\"\\n end);\\n\\n# For one-off computations:\\ndef mu($n): $n | mobius_array[-1];\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def nwise($n):\\n def n: if length <= $n then . else .[0:$n] , (.[$n:] | n) end;\\n n;\\n\\ndef task:\\n def pp: if . >=0 then \\\" \\\\(.)\\\" else tostring end;\\n (199 | mobius_array) as $mu\\n | \\\"The first 199 Möbius numbers are:\\\",\\n ([\\\" \\\", (range(1; 200) | $mu[.] | pp )]\\n | nwise(20)\\n | join(\\\" \\\") ) ;\\n\\ntask\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# relatively_prime(previous) tests whether the input integer is prime\\n# relative to the primes in the array \\\"previous\\\":\\ndef relatively_prime(previous):\\n . as $in\\n | (previous|length) as $plen\\n # state: [found, ix]\\n | [false, 0]\\n | until( .[0] or .[1] >= $plen;\\n [ ($in % previous[.[1]]) == 0, .[1] + 1] )\\n | .[0] | not ;\\n\\n# Emit a stream in increasing order of all primes (from 2 onwards)\\n# that are less than or equal to mx:\\ndef primes(mx):\\n # The helper function, next, has arity 0 for tail recursion optimization;\\n # it expects its input to be the array of previously found primes:\\n def next:\\n . as $previous\\n | ($previous | .[length-1]) as $last\\n | if ($last >= mx) then empty\\n else ((2 + $last)\\n | until( relatively_prime($previous) ; . + 2)) as $nextp\\n | if $nextp <= mx\\n then $nextp, (( $previous + [$nextp] ) | next)\\n\\t else empty\\n end\\n end;\\n if mx <= 1 then empty\\n elif mx == 2 then 2\\n else (2, 3, ([2,3] | next))\\n end ;\\n\\n# Return an array of the distinct prime factors of . in increasing order\\ndef prime_factors:\\n\\n # Return an array of prime factors of . given that \\\"primes\\\"\\n # is an array of relevant primes:\\n def pf($primes):\\n if . <= 1 then []\\n else . as $in\\n | if ($in | relatively_prime($primes)) then [$in]\\n else reduce $primes[] as $p\\n ([];\\n if ($in % $p) != 0 then .\\n \\t else . + [$p] + (($in / $p) | pf($primes))\\n\\t end)\\n end\\n | unique\\n end;\\n\\n if . <= 1 then []\\n else . as $in\\n | pf( [ primes( (1+$in) | sqrt | floor) ] )\\n end;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def isSquareFree:\\n . as $n\\n | 2\\n | until ( (. * . > $n) or . == 0;\\n if ($n % (.*.) == 0) then 0 # i.e. stop\\n elif . > 2 then . + 2\\n else . + 1\\n end )\\n | . != 0;\\n\\ndef mu:\\n . as $n\\n | if . < 1 then \\\"Argument to mu must be a positive integer\\\" | error\\n elif . == 1 then 1\\n else if isSquareFree\\n then if ((prime_factors|length) % 2 == 0) then 1\\n else -1\\n end\\n else 0\\n end\\n end;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def nwise($n):\\n def n: if length <= $n then . else .[0:$n] , (.[$n:] | n) end;\\n n;\\n\\ndef task:\\n def pp: if . >=0 then \\\" \\\\(.)\\\" else tostring end;\\n \\\"The first 199 Möbius numbers are:\\\",\\n ([\\\" \\\", (range(1; 200) | mu | pp )]\\n | nwise(20)\\n | join(\\\" \\\") ) ;\\n\\ntask\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Primes\\n\\n# modified from reinermartin's PR at https://github.com/JuliaMath/Primes.jl/pull/70/files\\nfunction moebius(n::Integer)\\n @assert n > 0\\n m(p, e) = p == 0 ? 0 : e == 1 ? -1 : 0\\n reduce(*, m(p, e) for (p, e) in factor(n) if p ≥ 0; init=1)\\nend\\nμ(n) = moebius(n)\\n\\nprint(\\\"First 199 terms of the Möbius sequence:\\\\n \\\")\\nfor n in 1:199\\n print(lpad(μ(n), 3), n % 20 == 19 ? \\\"\\\\n\\\" : \\\"\\\")\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import kotlin.math.sqrt\\n\\nfun main() {\\n println(\\\"First 199 terms of the möbius function are as follows:\\\")\\n print(\\\" \\\")\\n for (n in 1..199) {\\n print(\\\"%2d \\\".format(mobiusFunction(n)))\\n if ((n + 1) % 20 == 0) {\\n println()\\n }\\n }\\n}\\n\\nprivate const val MU_MAX = 1000000\\nprivate var MU: IntArray? = null\\n\\n// Compute mobius function via sieve\\nprivate fun mobiusFunction(n: Int): Int {\\n if (MU != null) {\\n return MU!![n]\\n }\\n\\n // Populate array\\n MU = IntArray(MU_MAX + 1)\\n val sqrt = sqrt(MU_MAX.toDouble()).toInt()\\n for (i in 0 until MU_MAX) {\\n MU!![i] = 1\\n }\\n for (i in 2..sqrt) {\\n if (MU!![i] == 1) {\\n // for each factor found, swap + and -\\n for (j in i..MU_MAX step i) {\\n MU!![j] *= -i\\n }\\n // square factor = 0\\n for (j in i * i..MU_MAX step i * i) {\\n MU!![j] = 0\\n }\\n }\\n }\\n for (i in 2..MU_MAX) {\\n when {\\n MU!![i] == i -> {\\n MU!![i] = 1\\n }\\n MU!![i] == -i -> {\\n MU!![i] = -1\\n }\\n MU!![i] < 0 -> {\\n MU!![i] = 1\\n }\\n MU!![i] > 0 -> {\\n MU!![i] = -1\\n }\\n }\\n }\\n return MU!![n]\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"function buildArray(size, value)\\n local tbl = {}\\n for i=1, size do\\n table.insert(tbl, value)\\n end\\n return tbl\\nend\\n\\nMU_MAX = 1000000\\nsqroot = math.sqrt(MU_MAX)\\nmu = buildArray(MU_MAX, 1)\\n\\nfor i=2, sqroot do\\n if mu[i] == 1 then\\n -- for each factor found, swap + and -\\n for j=i, MU_MAX, i do\\n mu[j] = mu[j] * -i\\n end\\n -- square factor = 0\\n for j=i*i, MU_MAX, i*i do\\n mu[j] = 0\\n end\\n end\\nend\\n\\nfor i=2, MU_MAX do\\n if mu[i] == i then\\n mu[i] = 1\\n elseif mu[i] == -i then\\n mu[i] = -1\\n elseif mu[i] < 0 then\\n mu[i] = 1\\n elseif mu[i] > 0 then\\n mu[i] = -1\\n end\\nend\\n\\nprint(\\\"First 199 terms of the mobius function are as follows:\\\")\\nio.write(\\\" \\\")\\nfor i=1, 199 do\\n io.write(string.format(\\\"%2d \\\", mu[i]))\\n if (i + 1) % 20 == 0 then\\n print()\\n end\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Grid[Partition[MoebiusMu[Range[99]], UpTo[10]]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"10 REM Moebius function\\n20 FOR T = 0 TO 9\\n30 FOR U = 1 TO 10\\n40 LET N = 10*T+U\\n50 GOSUB 110\\n60 PRINT M;\\\" \\\";\\n70 NEXT U\\n80 PRINT\\n90 NEXT T\\n100 END\\n\\n110 LET M = 1\\n120 IF N = 1 THEN 230\\n130 LET F = 2\\n140 LET F2 = F*F\\n150 IF INT(N/F2)*F2 <> N THEN 180\\n160 LET M = 0\\n170 GOTO 230\\n180 IF INT(N/F)*F <> N THEN 210\\n190 LET M = -M\\n200 LET N = N/F\\n210 LET F = F+1\\n220 IF F <= N THEN 140\\n230 RETURN\\n\",\n \"language\": \"Minimal-BASIC\"\n },\n {\n \"code\": \"import std/[math, sequtils, strformat]\\n\\nfunc getStep(n: int): int {.inline.} =\\n result = 1 + n shl 2 - n shr 1 shl 1\\n\\nfunc primeFac(n: int): seq[int] =\\n var\\n maxq = int(sqrt(float(n)))\\n d = 1\\n q: int = 2 + (n and 1) # Start with 2 or 3 according to oddity.\\n\\n while q <= maxq and n %% q != 0:\\n q = getStep(d)\\n inc d\\n if q <= maxq:\\n let q1 = primeFac(n /% q)\\n let q2 = primeFac(q)\\n result = concat(q2, q1, result)\\n else:\\n result.add(n)\\n\\nfunc squareFree(num: int): bool =\\n let fact = primeFac num\\n\\n for i in fact:\\n if fact.count(i) > 1:\\n return false\\n\\n return true\\n\\nfunc mobius(num: int): int =\\n if num == 1: return num\\n\\n let fact = primeFac num\\n\\n for i in fact:\\n ## check if it has a squared prime factor\\n if fact.count(i) == 2:\\n return 0\\n\\n if num.squareFree:\\n if fact.len mod 2 == 0:\\n return 1\\n else:\\n return -1\\n\\nwhen isMainModule:\\n echo \\\"The first 199 möbius numbers are:\\\"\\n\\n for i in 1..199:\\n stdout.write fmt\\\"{mobius(i):4}\\\"\\n if i mod 20 == 0:\\n echo \\\"\\\" # print newline\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"{\\n for(i = 1, 99,\\n print1(moebius(i) \\\" \\\");\\n if(i % 10 == 0, print(\\\"\\\\n\\\"););\\n );\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use utf8;\\nuse strict;\\nuse warnings;\\nuse feature 'say';\\nuse List::Util 'uniq';\\n\\nsub prime_factors {\\n my ($n, $d, @factors) = (shift, 1);\\n while ($n > 1 and $d++) {\\n $n /= $d, push @factors, $d until $n % $d;\\n }\\n @factors\\n}\\n\\nsub μ {\\n my @p = prime_factors(shift);\\n @p == uniq(@p) ? 0 == @p%2 ? 1 : -1 : 0;\\n}\\n\\nmy @möebius;\\npush @möebius, μ($_) for 1 .. (my $upto = 199);\\n\\nsay \\\"Möbius sequence - First $upto terms:\\\\n\\\" .\\n (' 'x4 . sprintf \\\"@{['%4d' x $upto]}\\\", @möebius) =~ s/((.){80})/$1\\\\n/gr;\\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;\\\">Moebius</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;\\\">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> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">f</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">prime_factors</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</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: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">f</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;\\\">i</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: #008080;\\\">return</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;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">odd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">length</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><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;\\\">s</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: #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;\\\">199</span> <span style=\\\"color: #008080;\\\">do</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</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;\\\">\\\"%3d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">Moebius</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: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join_by</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;\\\">20</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"# Python Program to evaluate\\n# Mobius def M(N) = 1 if N = 1\\n# M(N) = 0 if any prime factor\\n# of N is contained twice\\n# M(N) = (-1)^(no of distinct\\n# prime factors)\\n# Python Program to\\n# evaluate Mobius def\\n# M(N) = 1 if N = 1\\n# M(N) = 0 if any\\n# prime factor of\\n# N is contained twice\\n# M(N) = (-1)^(no of\\n# distinct prime factors)\\n\\n# def to check if\\n# n is prime or not\\ndef isPrime(n) :\\n\\n if (n < 2) :\\n return False\\n for i in range(2, n + 1) :\\n if (i * i <= n and n % i == 0) :\\n return False\\n return True\\n\\ndef mobius(N) :\\n\\n # Base Case\\n if (N == 1) :\\n return 1\\n\\n # For a prime factor i\\n # check if i^2 is also\\n # a factor.\\n p = 0\\n for i in range(1, N + 1) :\\n if (N % i == 0 and\\n isPrime(i)) :\\n\\n # Check if N is\\n # divisible by i^2\\n if (N % (i * i) == 0) :\\n return 0\\n else :\\n\\n # i occurs only once,\\n # increase f\\n p = p + 1\\n\\n # All prime factors are\\n # contained only once\\n # Return 1 if p is even\\n # else -1\\n if(p % 2 != 0) :\\n return -1\\n else :\\n return 1\\n\\n# Driver Code\\nprint(\\\"Mobius numbers from 1..99:\\\")\\n\\nfor i in range(1, 100):\\n print(f\\\"{mobius(i):>4}\\\", end = '')\\n\\n if i % 20 == 0: print()\\n# This code is contributed by\\n# Manish Shaw(manishshaw1)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"# Python Program to evaluate\\n# Mobius def M(N) = 1 if N = 1\\n# M(N) = 0 if any prime factor\\n# of N is contained twice\\n# M(N) = (-1)^(no of distinct\\n# prime factors)\\nimport math\\n\\n# def to check if n\\n# is prime or not\\ndef isPrime(n) :\\n\\n if (n < 2) :\\n return False\\n for i in range(2, n + 1) :\\n if (n % i == 0) :\\n return False\\n i = i * i\\n return True\\n\\ndef mobius(n) :\\n\\n p = 0\\n\\n # Handling 2 separately\\n if (n % 2 == 0) :\\n\\n n = int(n / 2)\\n p = p + 1\\n\\n # If 2^2 also\\n # divides N\\n if (n % 2 == 0) :\\n return 0\\n\\n\\n # Check for all\\n # other prime factors\\n for i in range(3, int(math.sqrt(n)) + 1) :\\n\\n # If i divides n\\n if (n % i == 0) :\\n\\n n = int(n / i)\\n p = p + 1\\n\\n # If i^2 also\\n # divides N\\n if (n % i == 0) :\\n return 0\\n i = i + 2\\n\\n if(p % 2 == 0) :\\n return -1\\n else :\\n return 1\\n\\n# Driver Code\\nprint(\\\"Mobius numbers from 1..99:\\\")\\n\\nfor i in range(1, 100):\\n print(f\\\"{mobius(i):>4}\\\", end = '')\\n# This code is contributed by\\n# Manish Shaw(manishshaw1)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ false swap\\n behead swap\\n [ witheach\\n [ tuck != if\\n done\\n dip not\\n conclude ] ]\\n drop ] is square ( [ --> b )\\n\\n [ 1 & ] is odd ( n --> b )\\n\\n [ dup 1 = if done\\n primefactors\\n dup square iff\\n [ drop 0 ] done\\n size odd iff\\n -1 else 1 ] is mobius ( n --> n )\\n\\n say \\\"First 199 terms:\\\" cr\\n say \\\" \\\"\\n 199 times\\n [ i^ 1+ mobius\\n dup -1 > if sp\\n echo\\n i^ 1+ 20 mod\\n 19 = iff cr\\n else [ sp sp ] ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"use Prime::Factor;\\n\\nsub μ (Int \\\\n) {\\n return 0 if n %% (4|9|25|49|121);\\n my @p = prime-factors(n);\\n +@p == +@p.unique ?? +@p %% 2 ?? 1 !! -1 !! 0\\n}\\n\\nmy @möbius = lazy flat '', 1, (2..*).hyper.map: &μ;\\n\\n# The Task\\nput \\\"Möbius sequence - First 199 terms:\\\\n\\\",\\n @möbius[^200]».fmt('%3s').batch(20).join: \\\"\\\\n\\\";\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm computes & shows a value grid of the Möbius function for a range of integers.*/\\nparse arg LO HI grp . /*obtain optional arguments from the CL*/\\nif LO=='' | LO==\\\",\\\" then LO= 0 /*Not specified? Then use the default.*/\\nif HI=='' | HI==\\\",\\\" then HI= 199 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif grp=='' | grp==\\\",\\\" then grp= 20 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n /* ______ */\\ncall genP HI /*generate primes up to the √ HI */\\nsay center(' The Möbius sequence from ' LO \\\" ──► \\\" HI\\\" \\\", max(50, grp*3), '═') /*title*/\\n$= /*variable holds output grid of GRP #s.*/\\n do j=LO to HI; $= $ right( mobius(j), 2) /*process some numbers from LO ──► HI.*/\\n if words($)==grp then do; say substr($, 2); $= /*show grid if fully populated,*/\\n end /* and nullify it for more #s.*/\\n end /*j*/ /*for small grids, using wordCnt is OK.*/\\n\\nif $\\\\=='' then say substr($, 2) /*handle any residual numbers not shown*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nmobius: procedure expose @.; parse arg x /*obtain a integer to be tested for mu.*/\\n if x<1 then return '∙' /*special? Then return symbol for null.*/\\n #= 0 /*start with a value of zero. */\\n do k=1; p= @.k /*get the Kth (pre─generated) prime.*/\\n if p>x then leave /*prime (P) > X? Then we're done. */\\n if p*p>x then do; #= #+1; leave /*prime (P**2 > X? Bump # and leave.*/\\n end\\n if x//p==0 then do; #= #+1 /*X divisible by P? Bump mu number. */\\n x= x % p /* Divide by prime. */\\n if x//p==0 then return 0 /*X÷by P? Then return zero*/\\n end\\n end /*k*/ /*# (below) is almost always small, <9*/\\n if #//2==0 then return 1 /*Is # even? Then return postive 1 */\\n return -1 /* \\\" \\\" odd? \\\" \\\" negative 1. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngenP: @.1=2; @.2=3; @.3=5; @.4=7; @.5=11; @.6= 13; nP=6 /*assign low primes; # primes.*/\\n do lim=nP until lim*lim>=HI /*only keep primes up to the sqrt(HI).*/\\n end /*lim*/\\n do j=@.nP+4 by 2 to HI /*only find odd primes from here on. */\\n parse var j '' -1 _;if _==5 then iterate /*Is last digit a \\\"5\\\"? Then not prime*/\\n if j// 3==0 then iterate /*is J divisible by 3? \\\" \\\" \\\" */\\n if j// 7==0 then iterate /* \\\" \\\" \\\" \\\" 7? \\\" \\\" \\\" */\\n if j//11==0 then iterate /* \\\" \\\" \\\" \\\" 11? \\\" \\\" \\\" */\\n if j//13==0 then iterate /* \\\" \\\" \\\" \\\" 13? \\\" \\\" \\\" */\\n do k=7 while k*k<=j /*divide by some generated odd primes. */\\n if j // @.k==0 then iterate j /*Is J divisible by P? Then not prime*/\\n end /*k*/ /* [↓] a prime (J) has been found. */\\n nP= nP+1; if nP<=HI then @.nP= j /*bump prime count; assign prime to @.*/\\n end /*j*/; return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"mobStr = \\\" . \\\"\\n\\nfor i = 1 to 200\\n if mobius(i) >= 0\\n mobStr + = \\\" \\\"\\n ok\\n temp = string(mobius(i))\\n if left(temp,2) = \\\"-0\\\"\\n temp = right(temp,len(temp)-1)\\n ok\\n mobStr += temp + \\\" \\\"\\n if i % 10 = 9\\n see mobStr + nl\\n mobStr = \\\" \\\"\\n ok\\nnext\\n\\nfunc mobius(n)\\n if n = 1\\n return 1\\n ok\\n for d = 2 to ceil(sqrt(n))\\n if n % d = 0\\n if n % (d*d) = 0\\n return 0\\n ok\\n return -mobius(n/d)\\n ok\\n next\\n return -1\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'prime'\\n\\ndef μ(n)\\n pd = n.prime_division\\n return 0 unless pd.map(&:last).all?(1)\\n pd.size.even? ? 1 : -1\\nend\\n\\n([\\\" \\\"] + (1..199).map{|n|\\\"%2s\\\" % μ(n)}).each_slice(20){|line| puts line.join(\\\" \\\") }\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"fn moebius(mut x: u64) -> i8 {\\n let mut prime_count = 0;\\n\\n // If x is divisible by the given factor this macro counts the factor and divides it out.\\n // It then returns zero if x is still divisible by the factor.\\n macro_rules! divide_x_by {\\n ($factor:expr) => {\\n if x % $factor == 0 {\\n x /= $factor;\\n prime_count += 1;\\n if x % $factor == 0 {\\n return 0;\\n }\\n }\\n };\\n }\\n\\n // Handle 2 and 3 separately,\\n divide_x_by!(2);\\n divide_x_by!(3);\\n\\n // then use a wheel sieve to check the remaining factors <= √x.\\n for i in (5..=isqrt(x)).step_by(6) {\\n divide_x_by!(i);\\n divide_x_by!(i + 2);\\n }\\n\\n // There can exist one prime factor larger than √x,\\n // in that case we can check if x is still larger than one, and then count it.\\n if x > 1 {\\n prime_count += 1;\\n }\\n\\n if prime_count % 2 == 0 {\\n 1\\n } else {\\n -1\\n }\\n}\\n\\n/// Returns the largest integer smaller than or equal to `√n`\\nconst fn isqrt(n: u64) -> u64 {\\n if n <= 1 {\\n n\\n } else {\\n let mut x0 = u64::pow(2, n.ilog2() / 2 + 1);\\n let mut x1 = (x0 + n / x0) / 2;\\n while x1 < x0 {\\n x0 = x1;\\n x1 = (x0 + n / x0) / 2;\\n }\\n x0\\n }\\n}\\n\\nfn main() {\\n const ROWS: u64 = 10;\\n const COLS: u64 = 20;\\n println!(\\n \\\"Values of the Möbius function, μ(x), for x between 0 and {}:\\\",\\n COLS * ROWS\\n );\\n for i in 0..ROWS {\\n for j in 0..=COLS {\\n let x = COLS * i + j;\\n let μ = moebius(x);\\n if μ >= 0 {\\n // Print an extra space if there's no minus sign in front of the output\\n // in order to align the numbers in a nice grid.\\n print!(\\\" \\\");\\n }\\n print!(\\\"{μ} \\\");\\n }\\n println!();\\n }\\n let x = u64::MAX;\\n println!(\\\"\\\\nμ({x}) = {}\\\", moebius(x));\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"say moebius(53) #=> -1\\nsay moebius(54) #=> 0\\nsay moebius(55) #=> 1\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"func μ(n) {\\n var f = n.factor_exp.map { .tail }\\n f.any { _ > 1 } ? 0 : ((-1)**f.sum)\\n}\\n\\nwith (199) { |n|\\n say \\\"Values of the Möbius function for numbers in the range 1..#{n}:\\\"\\n [' '] + (1..n->map(μ)) -> each_slice(20, {|*line|\\n say line.map { '%2s' % _ }.join(' ')\\n })\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \" PRINT \\\"Enter an integer\\\"\\n INPUT N\\n IF N < 0 THEN LET N = -N\\n IF N < 2 THEN GOTO 100 + N\\n LET C = 1\\n LET F = 2\\n 10 IF ((N/F)/F)*F*F = N THEN GOTO 100\\n IF (N/F)*F = N THEN GOTO 30\\n 20 LET F = F + 1\\n IF F<=N THEN GOTO 10\\n GOTO 100 + C\\n 30 LET N = N / F\\n LET C = -C\\n GOTO 20\\n 99 PRINT \\\"-1\\\"\\n END\\n100 PRINT \\\"0\\\"\\n END\\n101 PRINT \\\"1\\\"\\n END\\n\",\n \"language\": \"Tiny-BASIC\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\nimport \\\"./math\\\" for Int\\n\\nvar isSquareFree = Fn.new { |n|\\n var i = 2\\n while (i * i <= n) {\\n if (n%(i*i) == 0) return false\\n i = (i > 2) ? i + 2 : i + 1\\n }\\n return true\\n}\\n\\nvar mu = Fn.new { |n|\\n if (n < 1) Fiber.abort(\\\"Argument must be a positive integer\\\")\\n if (n == 1) return 1\\n var sqFree = isSquareFree.call(n)\\n var factors = Int.primeFactors(n)\\n if (sqFree && factors.count % 2 == 0) return 1\\n if (sqFree) return -1\\n return 0\\n}\\n\\nSystem.print(\\\"The first 199 Möbius numbers are:\\\")\\nfor (i in 0..9) {\\n for (j in 0..19) {\\n if (i == 0 && j == 0) {\\n System.write(\\\" \\\")\\n } else {\\n Fmt.write(\\\"$ 3d \\\", mu.call(i*20 + j))\\n }\\n }\\n System.print()\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func Mobius(N);\\nint N, Cnt, F, K;\\n[Cnt:= 0;\\nF:= 2; K:= 0;\\nrepeat if rem(N/F) = 0 then\\n [Cnt:= Cnt+1;\\n N:= N/F;\\n K:= K+1;\\n if K >= 2 then return 0;\\n ]\\n else [F:= F+1; K:= 0];\\nuntil F > N;\\nreturn if Cnt&1 then -1 else 1;\\n];\\n\\nint N;\\n[Format(3, 0);\\nText(0, \\\" \\\");\\nfor N:= 1 to 199 do\\n [RlOut(0, float(Mobius(N)));\\n if rem(N/20) = 19 then CrLf(0);\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"outstr$ = \\\" . \\\"\\nfor i = 1 to 200\\n if mobius(i) >= 0 then outstr$ = outstr$ + \\\" \\\" : fi\\n outstr$ = outstr$ + str$(mobius(i)) + \\\" \\\"\\n if mod(i, 10) = 9 then\\n print outstr$\\n outstr$ = \\\"\\\"\\n end if\\nnext i\\nend\\n\\nsub mobius(n)\\n if n = 1 then return 1 : fi\\n for d = 2 to int(sqr(n))\\n if mod(n, d) = 0 then\\n if mod(n, (d*d)) = 0 then return 0 : fi\\n return -mobius(n/d)\\n end if\\n next d\\n return -1\\nend sub\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"fcn mobius(n){\\n pf:=primeFactors(n);\\n sq:=pf.filter1('wrap(f){ (n % (f*f))==0 }); // False if square free\\n if(sq==False){ if(pf.len().isEven) 1 else -1 }\\n else 0\\n}\\nfcn primeFactors(n){ // Return a list of prime 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)) # both are tail recursion\\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 {\n \"code\": \"[1..199].apply(mobius)\\n.pump(Console.println, T(Void.Read,19,False),\\n\\tfcn{ vm.arglist.pump(String,\\\"%3d\\\".fmt) });\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"M-bius-function"}}},{"rowIdx":458,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Network Tools\nfrom: http://rosettacode.org/wiki/MAC_vendor_lookup\n","language":"00-META"},{"code":"Every connected device around the world comes with a unique Media Access Control address, or a [https://en.wikipedia.org/wiki/MAC_address MAC address]. \n\nA common task a network administrator may come across is being able to identify a network device's manufacturer when given only a MAC address.\n\n\n;Task:\nInterface with one (or numerous) APIs that exist on the internet and retrieve the device manufacturer based on a supplied MAC address.\n\nA MAC address that does not return a valid result should return the String \"N/A\". An error related to the network connectivity or the API should return a null result.\n\nMany implementations on this page use http://api.macvendors.com/ which, as of 19th September 2021, is throttling requests. After only 2 calls, the following response is returned for all subsequent requests. If you are planning to use the same provider or going to run the examples on this page, consider building in a delay between two calls.\n\n'''{\"errors\":{\"detail\":\"Too Many Requests\",\"message\":\"Please slow down your requests or upgrade your plan at https://macvendors.com\"}}'''\n<br><br>\n\n","language":"00-TASK"},{"code":"with Ada.Text_IO;\n\nwith AWS.Client;\nwith AWS.Response;\nwith AWS.Messages;\n\nprocedure MAC_Vendor is\n\n procedure Lookup (MAC : in String) is\n use AWS.Response;\n use AWS.Messages;\n URL : constant String := \"http://api.macvendors.com/\" & MAC;\n Page : constant Data := AWS.Client.Get (URL);\n use Ada.Text_IO;\n begin\n Put (MAC);\n Set_Col (20);\n case AWS.Response.Status_Code (Page) is\n when S200 => Put_Line (Message_Body (Page));\n when S404 => Put_Line (\"N/A\");\n when others => Put_Line (\"Error\");\n end case;\n end Lookup;\n\nbegin\n -- Have to throttle traffic to site\n Lookup (\"88:53:2E:67:07:BE\"); delay 1.500;\n Lookup (\"D4:F4:6F:C9:EF:8D\"); delay 1.500;\n Lookup (\"FC:FB:FB:01:FA:21\"); delay 1.500;\n Lookup (\"4c:72:b9:56:fe:bc\"); delay 1.500;\n Lookup (\"00-14-22-01-23-45\"); delay 1.500;\n Lookup (\"23-45-67\"); delay 1.500;\n Lookup (\"foobar\");\nend MAC_Vendor;\n","language":"Ada"},{"code":"⍝load the library module\n]load HttpCommand\n\n⍝ define a direct function (dfn) to look up a single MAC address\nvendorLookup1 ← { (HttpCommand.Get 'http://api.macvendors.com/',⍕⍵).Data }\n\n⍝ define a traditional function to look up all the MAC addresses in a list with\n⍝ a delay between calls\n\n⍝ The header says that the function is named vendorLookup, it takes a single\n⍝ parameter which we call macList, and the value of the local variable\n⍝ vendors will become the function's return value\n∇ vendors ← vendorLookup macList\n ⍝ look up the first vendor and put it into an array in our return var\n vendors ← ⊆vendorLookup1 1↑macList\n\n ⍝ Loop over the rest of the array\n :For burger :In 1↓macList\n ⎕DL 2 ⍝ wait 2 seconds\n vendors ⍪← ⊆vendorLookup1 burger ⍝ then look up the next vendor and append\n :EndFor\n∇\n\n⍝ demo data\nmacList ← '88:53:2E:67:07:BE' 'D4:F4:6F:C9:EF:8D' 'FC:FB:FB:01:FA:21'\nmacList ⍪← '4c:72:b9:56:fe:bc' '00-14-22-01-23-45'\n\n⍝ look up the vendors (takes a while with the 2-second delay between lookups)\nvendorList ← vendorLookup macList\n\n⍝ the result is an array (a 1-row by N-column matrix). to print out one vendor\n⍝ per line, we reshape it to be N rows by 1 column instead.\n{(1⌷⍴⍵) 1 ⍴ ⍵} vendorList\n","language":"APL"},{"code":"set apiRoot to \"https://api.macvendors.com\"\nset macList to {\"88:53:2E:67:07:BE\", \"D4:F4:6F:C9:EF:8D\", ¬\n \"FC:FB:FB:01:FA:21\", \"4c:72:b9:56:fe:bc\", \"00-14-22-01-23-45\"}\n\non lookupVendor(macAddr)\n global apiRoot\n return do shell script \"curl \" & apiRoot & \"/\" & macAddr\nend lookupVendor\n\nset table to { lookupVendor(first item of macList) }\nrepeat with burger in macList's items 2 thru -1\n delay 1.5\n set end of table to lookupVendor(burger)\nend repeat\n\nset text item delimiters to linefeed\nreturn table as string\n","language":"AppleScript"},{"code":"set savedTID to text item delimiters\nset text item delimiters to linefeed\nset tableText to table as string\nset text item delimiters to savedTID\nreturn tableText\n","language":"AppleScript"},{"code":"loop [\"FC-A1-3E\" \"FC:FB:FB:01:FA:21\" \"BC:5F:F4\"] 'mac [\n print [mac \"=>\" read ~\"http://api.macvendors.com/|mac|\"]\n pause 1500\n]\n","language":"Arturo"},{"code":"macLookup(MAC){\n\tWebRequest := ComObjCreate(\"WinHttp.WinHttpRequest.5.1\")\n\tWebRequest.Open(\"GET\", \"http://api.macvendors.com/\" MAC)\n\tWebRequest.Send()\n\treturn WebRequest.ResponseText\n}\n","language":"AutoHotkey"},{"code":"MsgBox % macLookup(\"00-14-22-01-23-45\")\n","language":"AutoHotkey"},{"code":"OPTION TLS TRUE\n\nwebsite$ = \"api.macvendors.com\"\nmac$ = \"b0:52:16:d0:3c:fb\"\n\nOPEN website$ & \":443\" FOR NETWORK AS mynet\n SEND \"GET /\" & mac$ & \" HTTP/1.1\\r\\nHost: \" & website$ & \"\\r\\n\\r\\n\" TO mynet\n RECEIVE info$ FROM mynet\nCLOSE NETWORK mynet\n\nPRINT TOKEN$(info$, 2, \"\\r\\n\\r\\n\")\n","language":"BaCon"},{"code":" DIM Block% 599 : REM Memory buffer to receive GET info\n INSTALL @lib$ + \"SOCKLIB\" : PROC_initsockets\n\n READ Mac$\n WHILE Mac$ > \"\"\n WAIT 100 : REM 1 sec pause to avoid 'Too Many Requests' errors\n Socket=FN_tcpconnect(\"api.macvendors.com\", \"80\")\n I%=FN_writelinesocket(Socket, \"GET /\" + Mac$ + \" HTTP/1.0\")\n I%=FN_writelinesocket(Socket, \"\")\n REPEAT N%=FN_readsocket(Socket, Block%, 600) UNTIL N% > 0\n PROC_closesocket(Socket)\n PRINT Mac$ TAB(24);\n CASE LEFT$($(Block% + 9), 3) OF\n WHEN \"200\"\n Block%?N%=0 : REM Add terminating 0x00\n REPEAT N%-=1 UNTIL Block%?N% < 32 : REM Leave only last line\n PRINT $$(Block% + N% + 1) : REM Print string from memory\n WHEN \"404\"\n PRINT \"N/A\"\n OTHERWISE\n PRINT \"ERROR\"\n ENDCASE\n READ Mac$\n ENDWHILE\n\n PROC_exitsockets\n END\n\n DATA 88:53:2E:67:07:BE, FC:FB:FB:01:FA:21, D4:F4:6F:C9:EF:8D, 10-11-22-33-44-55,\n","language":"BBC-BASIC"},{"code":"#include <curl/curl.h>\n#include <string.h>\n#include <stdlib.h>\n#include <stdio.h>\n\n/* Length of http://api.macvendors.com/ */\n#define FIXED_LENGTH 16\n\nstruct MemoryStruct {\n char *memory;\n size_t size;\n};\n\nstatic size_t WriteMemoryCallback(void *contents, size_t size, size_t nmemb, void *userp)\n{\n size_t realsize = size * nmemb;\n struct MemoryStruct *mem = (struct MemoryStruct *)userp;\n\n mem->memory = realloc(mem->memory, mem->size + realsize + 1);\n\n memcpy(&(mem->memory[mem->size]), contents, realsize);\n mem->size += realsize;\n mem->memory[mem->size] = 0;\n\n return realsize;\n}\n\nvoid checkResponse(char* str){\n\tchar ref[] = \"Vendor not found\";\n\tint len = strlen(str),flag = 1,i;\n\t\n\tif(len<16)\n\t\tfputs(str,stdout);\n\telse{\n\t\tfor(i=0;i<len && i<16;i++)\n\t\t\tflag = flag && (ref[i]==str[i]);\n\t\t\n\t\tflag==1?fputs(\"N/A\",stdout):fputs(str,stdout);\n\t}\n}\n\nint main(int argC,char* argV[])\n{\n\t\tif(argC!=2)\n\t\t\tprintf(\"Usage : %s <MAC address>\",argV[0]);\n\t\telse{\n\t\t\tCURL *curl;\n\t\t\tint len = strlen(argV[1]);\n\t\t\tchar* str = (char*)malloc((FIXED_LENGTH + len)*sizeof(char));\n\t\t\tstruct MemoryStruct chunk;\n\t\t\tCURLcode res;\n\n\t\t\tchunk.memory = malloc(1);\n\t\t\tchunk.size = 0;\n\n if ((curl = curl_easy_init()) != NULL) {\n\t\t\t\tsprintf(str,\"http://api.macvendors.com/%s\",argV[1]);\n\n curl_easy_setopt(curl, CURLOPT_URL, str);\n\t\t\t\tcurl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, WriteMemoryCallback);\n\t\t\t\tcurl_easy_setopt(curl, CURLOPT_WRITEDATA, (void *)&chunk);\n\t\t\t\t\n\t\t\t\tfree(str);\n\t\t\t\t\n\t\t\t\tres = curl_easy_perform(curl);\n\t\t\t\t\n if (res == CURLE_OK) {\n\t\t\t\tcheckResponse(chunk.memory);\n return EXIT_SUCCESS;\n }\n\t\t\t\t\n curl_easy_cleanup(curl);\n\t\t\t}\n\t\t}\n\n return EXIT_FAILURE;\n}\n","language":"C"},{"code":"// This code is based on the example 'Simple HTTP Client' included with\n// the Boost documentation.\n\n#include <boost/beast/core.hpp>\n#include <boost/beast/http.hpp>\n#include <boost/beast/version.hpp>\n#include <boost/asio/connect.hpp>\n#include <boost/asio/ip/tcp.hpp>\n#include <iostream>\n#include <string>\n\nbool get_mac_vendor(const std::string& mac, std::string& vendor) {\n namespace beast = boost::beast;\n namespace http = beast::http;\n namespace net = boost::asio;\n using tcp = net::ip::tcp;\n\n net::io_context ioc;\n tcp::resolver resolver(ioc);\n const char* host = \"api.macvendors.com\";\n\n beast::tcp_stream stream(ioc);\n stream.connect(resolver.resolve(host, \"http\"));\n\n http::request<http::string_body> req{http::verb::get, \"/\" + mac, 10};\n req.set(http::field::host, host);\n req.set(http::field::user_agent, BOOST_BEAST_VERSION_STRING);\n http::write(stream, req);\n\n beast::flat_buffer buffer;\n http::response<http::string_body> res;\n http::read(stream, buffer, res);\n\n bool success = res.result() == http::status::ok;\n if (success)\n vendor = res.body();\n\n beast::error_code ec;\n stream.socket().shutdown(tcp::socket::shutdown_both, ec);\n if (ec && ec != beast::errc::not_connected)\n throw beast::system_error{ec};\n\n return success;\n}\n\nint main(int argc, char** argv) {\n if (argc != 2 || strlen(argv[1]) == 0) {\n std::cerr << \"usage: \" << argv[0] << \" MAC-address\\n\";\n return EXIT_FAILURE;\n }\n try {\n std::string vendor;\n if (get_mac_vendor(argv[1], vendor)) {\n std::cout << vendor << '\\n';\n return EXIT_SUCCESS;\n } else {\n std::cout << \"N/A\\n\";\n }\n } catch(std::exception const& e) {\n std::cerr << \"Error: \" << e.what() << std::endl;\n }\n return EXIT_FAILURE;\n}\n","language":"C++"},{"code":"using System;\nusing System.Net;\nusing System.Net.Http;\nusing System.Threading.Tasks;\n\nclass Program\n{\n static async Task<string> LookupMac(string MacAddress)\n {\n var uri = new Uri(\"http://api.macvendors.com/\" + WebUtility.UrlEncode(MacAddress));\n using (var wc = new HttpClient())\n return await wc.GetStringAsync(uri);\n }\n static void Main(string[] args)\n {\n foreach (var mac in new string[] { \"88:53:2E:67:07:BE\", \"FC:FB:FB:01:FA:21\", \"D4:F4:6F:C9:EF:8D\" })\n Console.WriteLine(mac + \"\\t\" + LookupMac(mac).Result);\n Console.ReadLine();\n }\n}\n","language":"C-sharp"},{"code":"(quicklisp:quickload :Drakma) ; or load it in another way\n\n(defun mac-vendor (mac)\n (check-type mac string \"A MAC address as a string\")\n (multiple-value-bind (vendor status)\n (drakma:http-request (format nil \"http://api.macvendors.com/~a\" mac))\n (if (= 200 status)\n (format t \"~%Vendor is ~a\" vendor)\n (error \"~%Not a MAC address: ~a\" mac))))\n","language":"Common-Lisp"},{"code":"program MAC_Vendor_Lookup;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils,\n IdHttp;\n\nfunction macLookUp(mac: string): string;\nbegin\n Result := '';\n with TIdHTTP.Create(nil) do\n begin\n try\n Result := Get('http://api.macvendors.com/' + mac);\n\n except\n on E: Exception do\n Writeln(e.Message);\n end;\n Free;\n end;\nend;\n\nbegin\n Writeln(macLookUp('FC-A1-3E'));\n sleep(1000);\n Writeln(macLookUp('FC:FB:FB:01:FA:21'));\n sleep(1000);\n Writeln(macLookUp('BC:5F:F4'));\n readln;\nend.\n","language":"Delphi"},{"code":"USING: accessors calendar continuations http.client io kernel\nsequences threads ;\n\n: mac-vendor ( str -- str )\n \"http://api.macvendors.com/\" prepend\n [ http-get nip ] [ nip response>> message>> ] recover ;\n\n\"FC-A1-3E\"\n\"FC:FB:FB:01:FA:21\"\n\"10-11-22-33-44-55-66\"\n[ mac-vendor print 1 seconds sleep ] tri@\n","language":"Factor"},{"code":"program MACVendorLookup;\n\nuses\n fphttpclient;\n\nvar\n res: String;\nbegin\n if paramCount > 0 then begin\n\n With TFPHttpClient.Create(Nil) do\n try\n allowRedirect := true;\n try\n res := Get('http://api.macvendors.com/' + ParamStr(1));\n writeLn(res);\n except\n writeLn('N/A');\n end;\n finally\n Free;\n end;\n end;\nend.\n","language":"Free-Pascal-Lazarus"},{"code":"Function pipeout(Byval s As String = \"\") Byref As String\n Var f = Freefile\n Dim As String tmp\n Open Pipe s For Input As #f\n s = \"\"\n Do Until Eof(f)\n Line Input #f, tmp\n s &= tmp\n Loop\n Close #f\n Return s\nEnd Function\n\nFunction lookupvendor(webpage As String, mac As String) As String\n Return pipeout(\"powershell \" + \"(Invoke-WebRequest \" + webpage + mac + \")\")\nEnd Function\n\nDim As String macs(1 To 4) = {\"FC-A1-3E\",\"FC:FB:FB:01:FA:21\",\"88:53:2E:67:07:BE\",\"D4:F4:6F:C9:EF:8D\"}\n\nFor i As Integer = 1 To Ubound(macs)\n Var d = lookupvendor(\"api.macvendors.com/\", macs(i))\n Var e = Instr(d, \"RawContent\")\n Print Mid(d, 66, e-66)\nNext i\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n\t\"net/http\"\n\t\"fmt\"\n\t\"io/ioutil\"\n)\n\nfunc macLookUp(mac string) (res string){\n\tresp, _ := http.Get(\"http://api.macvendors.com/\" + mac)\n\tbody, _ := ioutil.ReadAll(resp.Body)\n\tres = string(body)\n\treturn\n}\n\nfunc main() {\n\tfmt.Println(macLookUp(\"FC-A1-3E\"))\n\tfmt.Println(macLookUp(\"FC:FB:FB:01:FA:21\"))\n\tfmt.Println(macLookUp(\"BC:5F:F4\"))\n}\n","language":"Go"},{"code":"#!/usr/bin/env stack\n{- stack\n script\n --resolver lts-9.0\n --package bytestring\n --package http-client\n --package http-types\n-}\n\n{-# LANGUAGE MultiWayIf #-}\n\nimport Control.Exception (try)\nimport Control.Monad (forM_)\nimport qualified Data.ByteString.Lazy.Char8 as L8 (ByteString, unpack)\nimport Network.HTTP.Client\n (Manager, parseRequest, httpLbs, responseStatus, responseBody,\n newManager, defaultManagerSettings, Response, HttpException)\nimport Network.HTTP.Types.Status (statusIsSuccessful, notFound404)\nimport System.Environment (getArgs)\nimport Text.Printf (printf)\n\nfetchURL :: Manager\n -> String\n -> IO (Either HttpException (Response L8.ByteString))\nfetchURL mgr url = try $ do\n req <- parseRequest url\n httpLbs req mgr\n\nlookupMac :: Manager -> String -> IO String\nlookupMac mgr mac = do\n eth <- fetchURL mgr $ \"http://api.macvendors.com/\" ++ mac\n return $ case eth of\n Left _ -> \"null\"\n Right resp -> let body = responseBody resp\n status = responseStatus resp\n in if | status == notFound404 -> \"N/A\"\n | not (statusIsSuccessful status) -> \"null\"\n | otherwise -> L8.unpack body\n\nmain :: IO ()\nmain = do\n args <- getArgs\n mgr <- newManager defaultManagerSettings\n forM_ args $ \\mac -> do\n putStr $ printf \"%-17s\" mac ++ \" = \"\n vendor <- lookupMac mgr mac\n putStrLn vendor\n","language":"Haskell"},{"code":"require 'web/gethttp'\nlookupMACvendor=: [: gethttp 'http://api.macvendors.com/'&,\n","language":"J"},{"code":" addr=: '88:53:2E:67:07:BE';'FC:FB:FB:01:FA:21';'D4:F4:6F:C9:EF:8D';'23:45:67'\n (,&' ' , lookupMACvendor)&> addr\n88:53:2E:67:07:BE Intel Corporate\nFC:FB:FB:01:FA:21 Cisco Systems, Inc\nD4:F4:6F:C9:EF:8D Apple, Inc.\n23:45:67 Vendor not found\n","language":"J"},{"code":"package com.jamesdonnell.MACVendor;\n\nimport java.io.BufferedReader;\nimport java.io.FileNotFoundException;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.net.HttpURLConnection;\nimport java.net.URL;\n\n/** MAC Vendor Lookup class.\n * www.JamesDonnell.com\n * @author James A. Donnell Jr. */\npublic class Lookup {\n\t/** Base URL for API. The API from www.macvendors.com was chosen. */\n\tprivate static final String baseURL = \"http://api.macvendors.com/\";\n\n\t/** Performs lookup on MAC address(es) supplied in arguments.\n\t * @param args MAC address(es) to lookup. */\n\tpublic static void main(String[] args) {\n\t\tfor (String arguments : args)\n\t\t\tSystem.out.println(arguments + \": \" + get(arguments));\n\t}\n\n\t/** Performs lookup on supplied MAC address.\n\t * @param macAddress MAC address to lookup.\n\t * @return Manufacturer of MAC address. */\n\tprivate static String get(String macAddress) {\n\t\ttry {\n\t\t\tStringBuilder result = new StringBuilder();\n\t\t\tURL url = new URL(baseURL + macAddress);\n\t\t\tHttpURLConnection conn = (HttpURLConnection) url.openConnection();\n\t\t\tconn.setRequestMethod(\"GET\");\n\t\t\tBufferedReader rd = new BufferedReader(new InputStreamReader(conn.getInputStream()));\n\t\t\tString line;\n\t\t\twhile ((line = rd.readLine()) != null) {\n\t\t\t\tresult.append(line);\n\t\t\t}\n\t\t\trd.close();\n\t\t\treturn result.toString();\n\t\t} catch (FileNotFoundException e) {\n\t\t\t// MAC not found\n\t\t\treturn \"N/A\";\n\t\t} catch (IOException e) {\n\t\t\t// Error during lookup, either network or API.\n\t\t\treturn null;\n\t\t}\n\t}\n}\n","language":"Java"},{"code":"import java.io.IOException;\nimport java.net.URI;\nimport java.net.http.HttpClient;\nimport java.net.http.HttpRequest;\nimport java.net.http.HttpResponse;\nimport java.util.List;\nimport java.util.concurrent.TimeUnit;\n\npublic final class MacVendorLookup {\n\n\tpublic static void main(String[] aArgs) throws InterruptedException, IOException {\t\t\n\t\tfor ( String macAddress : macAddresses ) {\n\t\t\tHttpResponse<String> response = getMacVendor(macAddress);\n\t\t\tSystem.out.println(macAddress + \" \" + response.statusCode() + \" \" + response.body());\n\t\t\t\n\t\t\tTimeUnit.SECONDS.sleep(2);\n\t\t}\t\t\n\t}\n\n\tprivate static HttpResponse<String> getMacVendor(String aMacAddress) throws IOException, InterruptedException {\t\t\t\t\n\t\tURI uri = URI.create(BASE_URL + aMacAddress);\n\t\tHttpClient client = HttpClient.newHttpClient();\n\t\tHttpRequest request = HttpRequest\n\t\t\t.newBuilder()\n\t\t .uri(uri)\n\t\t .header(\"accept\", \"application/json\")\n\t\t .GET()\n\t\t .build();\n\t\t\n\t\tHttpResponse<String> response = client.send(request, HttpResponse.BodyHandlers.ofString());\n\t\t\n\t\treturn response;\n\t}\n\t\n\tprivate static final String BASE_URL = \"http://api.macvendors.com/\";\n\t\n\tprivate static final List<String> macAddresses = List.of(\"88:53:2E:67:07:BE\",\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t \"D4:F4:6F:C9:EF:8D\",\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t \"FC:FB:FB:01:FA:21\",\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t \"4c:72:b9:56:fe:bc\",\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t \"00-14-22-01-23-45\"\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t );\t\n\t\n}\n","language":"Java"},{"code":"var mac = \"88:53:2E:67:07:BE\";\nfunction findmac(){\n\twindow.open(\"http://api.macvendors.com/\" + mac);\n}\n\nfindmac();\n","language":"JavaScript"},{"code":"# v0.6.0\n\nusing Requests\n\nfunction getvendor(addr::String)\n try\n get(\"http://api.macvendors.com/$addr\") |> readstring\n catch e\n nothing\n end\nend\n\nfor addr in [\"88:53:2E:67:07:BE\", \"FC:FB:FB:01:FA:21\", \"D4:F4:6F:C9:EF:8D\", \"23:45:67\"]\n println(\"$addr -> \", getvendor(addr))\nend\n","language":"Julia"},{"code":"// version 1.1.2\n\nimport java.net.URL\n\nfun lookupVendor(mac: String) = URL(\"http://api.macvendors.com/\" + mac).readText()\n\nfun main(args: Array<String>) {\n val macs = arrayOf(\"FC-A1-3E\", \"FC:FB:FB:01:FA:21\", \"88:53:2E:67:07:BE\", \"D4:F4:6F:C9:EF:8D\")\n for (mac in macs) println(lookupVendor(mac))\n}\n","language":"Kotlin"},{"code":"make \"api_root \"http://api.macvendors.com/\nmake \"mac_list [88:53:2E:67:07:BE D4:F4:6F:C9:EF:8D FC:FB:FB:01:FA:21\n 4c:72:b9:56:fe:bc 00-14-22-01-23-45]\n\nto lookup_vendor :mac\n output first shell (sentence [curl -s] (word :api_root :mac) [&& echo])\nend\n\nprint lookup_vendor first :mac_list\nforeach butfirst :mac_list [\n wait 90\n print lookup_vendor ?\n]\nbye\nbye\n","language":"Logo"},{"code":"-- Requires LuaSocket extension by Lua\n-- Created by James A. Donnell Jr.\n-- www.JamesDonnell.com\n\nlocal baseURL = \"http://api.macvendors.com/\"\n\nlocal function lookup(macAddress)\n\thttp = require \"socket.http\"\n\tresult, statuscode, content = http.request(baseURL .. macAddress)\n\treturn result\nend\n\nlocal macAddress = \"FC-A1-3E-2A-1C-33\"\nprint(lookup(macAddress))\n","language":"Lua"},{"code":"Module Checkit {\n httpGet$=lambda$ (url$, timeout=500)->{\n declare htmldoc \"WinHttp.WinHttpRequest.5.1\"\n Method htmldoc \"SetTimeouts\", timeout, timeout, timeout, timeout\n Method htmldoc \"open\",\"GET\", url$, false\n Method htmldoc \"setRequestHeader\",\"Content-Type\", \"application/x-www-form-urlencoded\"\n Method htmldoc \"send\"\n With htmldoc, \"responseText\" as ready$\n res$=trim$(ready$)\n if left$(res$,1)=\"{\" then\n =\"N/A\"\n else\n =res$\n end if\n declare htmldoc nothing\n }\n Urls=(\"88:53:2E:67:07:BE\", \"FC:FB:FB:01:FA:21\", \"D4:F4:6F:C9:EF:8D\", \"BC:5F:F4\")\n url=each(URLs)\n While Url {\n Print Array$(URL),@(20), httpGet$(\"https://api.macvendors.com/\"+Array$(URL))\n Wait 1500\n }\n}\nCheckit\n","language":"M2000-Interpreter"},{"code":"macLookup[mac_String] := Quiet[Check[Import[\"http://api.macvendors.com/\" <> mac], \"N/A\"]]\n","language":"Mathematica"},{"code":"macLookup[\"00-14-22-01-23-45\"]\n","language":"Mathematica"},{"code":"macList = [\"88:53:2E:67:07:BE\", \"FC:FB:FB:01:FA:21\", \"00:02:55:00:00:00\",\n \"D4:F4:6F:C9:EF:8D\", \"23:45:67\", \"18:93:D7\", \"1C:A6:81\"]\n\nfor mac in macList\n\tret = http.get(\"http://api.macvendors.com/\"+mac)\n\tif ret == \"HTTP/1.1 404 Not Found\" then ret = \"N/A\"\n\tprint ret\n\twait 1\nend for\n","language":"MiniScript"},{"code":"import httpclient\n\nfor mac in [\"FC-A1-3E\", \"FC:FB:FB:01:FA:21\", \"BC:5F:F4\"]:\n echo newHttpClient().getContent(\"http://api.macvendors.com/\"&mac)\n","language":"Nim"},{"code":"let mactable = http get \"http://standards-oui.ieee.org/oui/oui.csv\" | from csv --no-infer\n\ndef get-mac-org [] {\n\tlet assignment = $in | str upcase | str replace --all --regex \"[^A-Z0-9]\" \"\" | str substring 0..6\n\t$mactable | where Assignment == $assignment | try {first | get \"Organization Name\"} catch {\"N/A\"}\n}\n\n# Test cases from the Ada entry\nlet macs = [\n\t# Should succeed\n\t\"88:53:2E:67:07:BE\"\n\t\"D4:F4:6F:C9:EF:8D\"\n\t\"FC:FB:FB:01:FA:21\"\n\t\"4c:72:b9:56:fe:bc\"\n\t\"00-14-22-01-23-45\"\n\t# Should fail\n\t\"23-45-67\"\n\t\"foobar\"\n]\n\n$macs | each {{MAC: $in, Vendor: ($in | get-mac-org)}}\n","language":"Nu"},{"code":"(* build with ocamlfind ocamlopt -package netclient -linkpkg macaddr.ml -o macaddr *)\n\nopen Printf\nopen Nethttp_client.Convenience\nopen Unix\n\n(* example vendors, including a nonsense one *)\n\nlet vendors = [\"FF:FF:FF:67:07:BE\"; \"D4:F4:6F:C9:EF:8D\"; \"FC:FB:FB:01:FA:21\"; \"88:53:2E:67:07:BE\"]\n\nlet get_vendor addr =\n sleep 3; (* built-in delay to handle rate-limiting at macvendors.com *)\n\n let client = http_get_message (\"http://api.macvendors.com/\" ^ addr) in\n match client # response_status_code with\n | 200 -> client # response_body # value\n | 404 -> \"N/A\"\n | _ -> \"NULL\"\n\nlet rec parse_vendors vendors =\n match vendors with\n | [] -> []\n | hd::tl -> get_vendor hd :: parse_vendors tl\n\nlet rec print_vendors vendor_list =\n match vendor_list with\n | [] -> \"\"\n | hd::tl -> printf \"%s\\n\" hd; print_vendors tl\n\nlet main =\n let vendor_list = parse_vendors vendors in\n print_vendors vendor_list\n","language":"OCaml"},{"code":"#!/usr/bin/env perl -T\nuse v5.18.2;\nuse warnings;\nuse LWP;\nuse Time::HiRes qw(sleep);\n\nour $VERSION = 1.000_000;\n\nmy $ua = LWP::UserAgent->new;\n\nno warnings 'qw';\nmy @macs = qw(\n FC-A1-3EFC:FB:FB:01:FA:21 00,0d,4b\n Rhubarb 00-14-22-01-23-45\n 10:dd:b1 D4:F4:6F:C9:EF:8D\n FC-A1-3E 88:53:2E:67:07:BE\n 23:45:67 FC:FB:FB:01:FA:21\n BC:5F:F4\n);\n\nwhile (my $mac = shift @macs) {\n my $vendor = get_mac_vendor($mac);\n if ($vendor) {\n say \"$mac = $vendor\";\n }\n sleep 1.5 if @macs;\n}\n\nsub get_mac_vendor {\n my $s = shift;\n\n my $req = HTTP::Request->new( GET => \"http://api.macvendors.com/$s\" );\n my $res = $ua->request($req);\n\n # A error related to the network connectivity or the API should\n # return a null result.\n if ( $res->is_error ) {\n return;\n }\n\n # A MAC address that does not return a valid result should\n # return the String \"N/A\".\n if ( !$res->content\n or $res->content eq 'Vendor not found' )\n {\n return 'N/A';\n }\n\n return $res->content;\n}\n\n# IEEE 802:\n# Six groups of two hexadecimal digits separated by hyphens or colons,\n# like 01-23-45-67-89-ab or 01:23:45:67:89:ab\n# Three groups of four hexadecimal digits separated by dots (.),\n# like 0123.4567.89ab\n#sub validmac {\n# my $s = shift;\n#\n# my $hex = qr{ [A-Fa-f[:digit:]] }xms;\n# my $hex2ws = qr{ [-:] $hex{2} }xms;\n#\n# if ( $s =~ m{\\A $hex{2} $hex2ws{5} \\z}xms\n# or $s =~ m{\\A $hex{4} [.] $hex{4} [.] $hex{4} \\z}xms )\n# {\n# return 'true';\n# }\n# return;\n#}\n","language":"Perl"},{"code":"(notonline)-->\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- libcurl</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">test</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"00-11-22-33-44-55-66\"</span> <span style=\"color: #000080;font-style:italic;\">-- CIMSYS Inc\n --string test = \"10-11-22-33-44-55-66\" -- N/A</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">builtins</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">libcurl</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #7060A8;\">curl_global_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">curl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">curl_easy_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">url</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"http://api.macvendors.com/%s\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #7060A8;\">curl_easy_setopt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">CURLOPT_URL</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">url</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: #7060A8;\">curl_easy_perform_ex</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #004080;\">string</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: #008080;\">if</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">\"Vendor not found\"</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">`{\"errors\":{\"detail\":\"Not Found\"}}`</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"N/A\"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #0000FF;\">?{</span><span style=\"color: #008000;\">\"error\"</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: #7060A8;\">curl_easy_cleanup</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">curl_global_cleanup</span><span style=\"color: #0000FF;\">()</span>\n<!--\n","language":"Phix"},{"code":"<?php\n$apiRoot = \"https://api.macvendors.com\";\n$macList = array(\"88:53:2E:67:07:BE\", \"D4:F4:6F:C9:EF:8D\",\n\t\t \"FC:FB:FB:01:FA:21\", \"4c:72:b9:56:fe:bc\", \"00-14-22-01-23-45\");\n\n$curl = curl_init();\ncurl_setopt($curl, CURLOPT_RETURNTRANSFER, true);\nforeach ($macList as $burger) {\n curl_setopt($curl, CURLOPT_URL, \"$apiRoot/$burger\");\n echo(curl_exec($curl));\n echo(\"\\n\");\n sleep(2);\n}\ncurl_close($curl);\n?>\n","language":"PHP"},{"code":"$apiRoot = \"http://api.macvendors.com\"\n$macAddresses = @(\"88:53:2E:67:07:BE\", \"D4:F4:6F:C9:EF:8D\",\n \"FC:FB:FB:01:FA:21\", \"4c:72:b9:56:fe:bc\",\n \"00-14-22-01-23-45\")\n\n$macAddresses | % {\n (Invoke-WebRequest \"$apiRoot/$_\").Content\n Start-Sleep 1.5\n}\n","language":"PowerShell"},{"code":"import requests\n\nfor addr in ['88:53:2E:67:07:BE', 'FC:FB:FB:01:FA:21',\n 'D4:F4:6F:C9:EF:8D', '23:45:67']:\n vendor = requests.get('http://api.macvendors.com/' + addr).text\n print(addr, vendor)\n","language":"Python"},{"code":"#lang racket\n\n(require net/url)\n\n(define (lookup-MAC-address addr)\n (port->string\n (get-pure-port\n (url \"http\" #f \"api.macvendors.com\" #f #t (list (path/param addr null)) null #f))))\n\n(module+ test\n(for ((i (in-list '(\"88:53:2E:67:07:BE\"\n \"FC:FB:FB:01:FA:21\"\n \"D4:F4:6F:C9:EF:8D\"))))\n (printf \"~a\\t~a~%\" i (lookup-MAC-address i))))\n","language":"Racket"},{"code":"use HTTP::UserAgent;\n\nmy $ua = HTTP::UserAgent.new;\n\n$ua.timeout = 10; # seconds\n\nmy $server = 'http://api.macvendors.com/';\n\nsub lookup ($mac) {\n my $response = $ua.get: \"$server+$mac\";\n sleep 1;\n return $response.is-success ?? $response.content !! 'N/A';\n\n CATCH { # Normally you would report some information about what\n default { Nil } # went wrong, but the task specifies to ignore errors.\n }\n}\n\nfor <\nBC:5F:F4\nFC-A1-3E\n10:dd:b1\n00:0d:4b\n23:45:67\n> -> $mac { say lookup $mac }\n","language":"Raku"},{"code":"print read rejoin [http://api.macvendors.com/ ask \"MAC address: \"]\n","language":"Red"},{"code":"/*REXX pgm shows a network device's manufacturer based on the Media Access Control addr.*/\nwin_command = 'getmac' /*name of the Microsoft Windows command*/\nwin_command_options = '/v /fo list' /*options of \" \" \" */\n?3= 'Network Adapter:' /*search keywords for Network Adapter. */\n?4= 'Physical Address:' /* \" \" \" Physical Address.*/\nupper ?3 ?4 /*uppercase in case for capitol letters*/\n@.=; @.0= 0 /*just─in─case values for the keywords.*/\nrc= 0 /* \" \" \" value for the returnCode*/\naddress system win_command win_command_options with output stem @. /*issue command.*/\nif rc\\==0 then do /*display an error if not successful. */\n say\n say '***error*** from command: ' win_command win_command_options\n say 'Return code was: ' rc\n say\n exit rc\n end\nMACaddr=. /*just─in─case value for the keyword. */\nmaker=. /* \" \" \" \" \" \" \" */\n do j=1 for @.0; $= @.j; upper $ /*parse each of the possible responses.*/\n if left($, length(?3))=?3 then maker= subword(@.j, 3) /*is this the one?*/\n if left($, length(?4))=?4 then MACaddr= word(@.j, 3) /* \" \" \" \" */\n end /*k*/\n /* [↑] Now, display good or bad stuff.*/\nif maker=. | MACaddr==. then say 'MAC address manufacturer not found.'\n else say 'manufacturer for MAC address ' MACaddr \" is \" maker\nexit 0 /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"# Project: MAC Vendor Lookup\n\nload \"stdlib.ring\"\nmacs = [\"FC-A1-3E\",\"FC:FB:FB:01:FA:21\",\"88:53:2E:67:07:BE\",\"D4:F4:6F:C9:EF:8D\"]\nfor mac = 1 to len(macs)\n lookupvendor(macs[mac])\nnext\n\nfunc lookupvendor(mac)\n url = download(\"api.macvendors.com/\" + mac)\n see url + nl\n","language":"Ring"},{"code":"require 'net/http'\n\narr = ['88:53:2E:67:07:BE', 'FC:FB:FB:01:FA:21', 'D4:F4:6F:C9:EF:8D', '23:45:67']\n\narr.each do |addr|\n vendor = Net::HTTP.get('api.macvendors.com', \"/#{addr}/\") rescue nil\n puts \"#{addr} #{vendor}\"\nend\n","language":"Ruby"},{"code":"extern crate reqwest;\n\nuse std::{thread, time};\n\nfn get_vendor(mac: &str) -> Option<String> {\n let mut url = String::from(\"http://api.macvendors.com/\");\n url.push_str(mac);\n let url_ref = &url;\n match reqwest::get(url_ref) {\n Ok(mut res) => match res.text() {\n Ok(text) => {\n if text.contains(\"Not Found\") {\n Some(\"N/A\".to_string())\n } else {\n Some(text)\n }\n }\n Err(e) => {\n println!(\"{:?}\", e);\n None\n }\n },\n Err(e) => {\n println!(\"{:?}\", e);\n None\n }\n }\n}\n\nfn main() {\n let duration = time::Duration::from_millis(1000);\n match get_vendor(\"88:53:2E:67:07:BE\") {\n None => println!(\"Error!\"),\n Some(text) => println!(\"{}\", text),\n }\n thread::sleep(duration);\n match get_vendor(\"FC:FB:FB:01:FA:21\") {\n None => println!(\"Error!\"),\n Some(text) => println!(\"{}\", text),\n }\n thread::sleep(duration);\n match get_vendor(\"FC-A1-3E\") {\n None => println!(\"Error!\"),\n Some(text) => println!(\"{}\", text),\n }\n thread::sleep(duration);\n match get_vendor(\"abcdefg\") {\n None => println!(\"Error!\"),\n Some(text) => println!(\"{}\", text),\n }\n}\n","language":"Rust"},{"code":"object LookUp extends App {\n val macs = Seq(\"FC-A1-3E\", \"FC:FB:FB:01:FA:21\", \"88:53:2E:67:07:BE\", \"D4:F4:6F:C9:EF:8D\")\n\n def lookupVendor(mac: String) =\n scala.io.Source.fromURL(\"\"\"http://api.macvendors.com/\"\"\" + mac, \"UTF-8\").mkString\n\n macs.foreach(mac => println(lookupVendor(mac)))\n}\n","language":"Scala"},{"code":"(import http-client (chicken io))\n(define api-root \"http://api.macvendors.com\")\n(define mac-addresses '(\"88:53:2E:67:07:BE\" \"D4:F4:6F:C9:EF:8D\"\n \"FC:FB:FB:01:FA:21\" \"4c:72:b9:56:fe:bc\"\n \"00-14-22-01-23-45\"))\n\n(define get-vendor (lambda (mac-address)\n (with-input-from-request (string-append api-root \"/\" mac-address)\n #f read-string)))\n\n(display (get-vendor (car mac-addresses)))\n(newline)\n(map (lambda (burger) (sleep 2) (display (get-vendor burger)) (newline))\n (cdr mac-addresses))\n","language":"Scheme"},{"code":"package require http\n\n# finally is a bit like go's defer\nproc finally args {\n tailcall trace add variable :#finally#: unset [list apply [list args $args]]\n}\n\n# basic wrapper for http::geturl\nproc geturl {url} {\n set tok [::http::geturl $url]\n finally ::http::cleanup $tok\n ::http::data $tok\n}\nproc maclookup {mac} {\n geturl http://api.macvendors.com/$mac\n}\n\nforeach mac {00-14-22-01-23-45 88:53:2E:67:07:BE} {\n puts \"$mac\\t[maclookup $mac]\"\n}\n","language":"Tcl"},{"code":"macList=(88:53:2E:67:07:BE D4:F4:6F:C9:EF:8D FC:FB:FB:01:FA:21\n 4c:72:b9:56:fe:bc 00-14-22-01-23-45)\n\nlookup() {\n curl -s \"http://api.macvendors.com/$1\" && echo\n}\n\nlookup \"${macList[0${ZSH_VERSION:++1}]}\"\nfor burger in \"${macList[@]:1}\"; do\n sleep 2\n lookup \"$burger\"\ndone\n","language":"UNIX-Shell"},{"code":"set -- 88:53:2E:67:07:BE D4:F4:6F:C9:EF:8D FC:FB:FB:01:FA:21 \\\n 4c:72:b9:56:fe:bc 00-14-22-01-23-45\n\nlookup() {\n curl -s \"http://api.macvendors.com/$1\" && echo\n}\n\nlookup \"$1\"\nshift\nfor burger; do\n sleep 2\n curl -s \"http://api.macvendors.com/$burger\" && echo\ndone\n","language":"UNIX-Shell"},{"code":"set macList=(88:53:2E:67:07:BE D4:F4:6F:C9:EF:8D FC:FB:FB:01:FA:21 \\\n 4c:72:b9:56:fe:bc 00-14-22-01-23-45)\n\nalias lookup curl -s \"http://api.macvendors.com/!\":1 \"&&\" echo\n\nlookup \"$macList[1]\"\nforeach burger ($macList[2-]:q)\n sleep 2\n lookup \"$burger\"\nend\n","language":"UNIX-Shell"},{"code":"import net.http\nimport time\n\nconst macs =\n('\nFC-A1-3E\nFC:FB:FB:01:FA:21\nD4:F4:6F:C9:EF:8D\n')\n\nfn main() {\n for line in macs.split('\\n') {\n if line !='' {\n println(mac_lookup(line))\n time.sleep(2 * time.second) // considerate delay between attempts\n }\n }\n}\n\nfn mac_lookup(mac string) string {\n resp := http.get(\"http://api.macvendors.com/\" + mac) or {return 'No data from server'}\n return resp.body.str()\n}\n","language":"V-(Vlang)"},{"code":"a=array(\"00-20-6b-ba-d0-cb\",\"00-40-ae-04-87-86\")\nset WebRequest = CreateObject(\"WinHttp.WinHttpRequest.5.1\")\n\nfor each MAC in a\n if b<>0 then wscript.echo \"Spacing next request...\": wscript.sleep 2000\n WebRequest.Open \"GET\", \"http://api.macvendors.com/\"& mac,1\n WebRequest.Send()\n WebRequest.WaitForResponse\n b=b+1\n wscript.echo mac & \" -> \" & WebRequest.ResponseText\nnext\n","language":"VBScript"},{"code":"' MAC Vendor lookup - based on the C# sample.\n\nImports System\nImports System.Net\n\nModule LookupMac\n\n Public Sub Main(args() As String)\n\n Dim macAddress As String = If(args.Length < 1, \"88:53:2E:67:07:BE\", args(0))\n Dim uri As New Uri(\"http://api.macvendors.com/\" & WebUtility.UrlEncode(macAddress))\n Dim wc As New WebClient()\n Console.Out.WriteLine(macAddress & \" \" & wc.DownloadString(uri))\n\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"/* MAC_vendor_lookup.wren */\nclass MAC {\n foreign static lookup(address)\n}\n\nSystem.print(MAC.lookup(\"FC:FB:FB:01:FA:21\"))\nfor (i in 1..1e8) {} // slow down request\nSystem.print(MAC.lookup(\"23:45:67\"))\n","language":"Wren"},{"code":"/* MAC_vendor_lookup.go */\npackage main\n\nimport (\n wren \"github.com/crazyinfin8/WrenGo\"\n \"io/ioutil\"\n \"net/http\"\n)\n\ntype any = interface{}\n\nfunc macLookup(vm *wren.VM, parameters []any) (any, error) {\n mac := parameters[1].(string)\n resp, err := http.Get(\"http://api.macvendors.com/\" + mac)\n if err != nil {\n return nil, nil\n }\n body, err := ioutil.ReadAll(resp.Body)\n if err != nil {\n return nil, nil\n }\n var vendor = string(body)\n if vendor == `{\"errors\":{\"detail\":\"Not Found\"}}` {\n return \"N/A\", nil\n }\n return vendor, nil\n}\n\nfunc main() {\n vm := wren.NewVM()\n fileName := \"MAC_vendor_lookup.wren\"\n methodMap := wren.MethodMap{\"static lookup(_)\": macLookup}\n classMap := wren.ClassMap{\"MAC\": wren.NewClass(nil, nil, methodMap)}\n module := wren.NewModule(classMap)\n vm.SetModule(fileName, module)\n vm.InterpretFile(fileName)\n vm.Free()\n}\n","language":"Wren"},{"code":"var [const] CURL=Import(\"zklCurl\"); // libcurl\nconst MAC_VENDORS=\"http://api.macvendors.com/\";\n\nfcn lookUp(macAddress){\n httpAddr:=MAC_VENDORS + macAddress;\n vender:=CURL().get(httpAddr); //-->(Data,bytes of header,bytes of trailer)\n vender=vender[0].del(0,vender[1]); // remove HTTP header\n vender.text;\t\t// Data --> String (Data is a byte bucket)\n}\n","language":"Zkl"},{"code":"lookUp(\"FC-A1-3E-2A-1C-33\").println();\nlookUp(\"4c:72:b9:56:fe:bc\").println();\nlookUp(\"foobar\").println();\n","language":"Zkl"},{"code":"program: mac_vendor_lookup\n\ndata: 'http://api.macvendors.com/'\n\ninput: 'D4:F4:6F:C9:EF:8D'\nderive: 'http://api.macvendors.com/D4:F4:6F:C9:EF:8D'\noutput: 'Apple, Inc.'\n","language":"Zoea"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Network Tools\\nfrom: http://rosettacode.org/wiki/MAC_vendor_lookup\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Every connected device around the world comes with a unique Media Access Control address, or a [https://en.wikipedia.org/wiki/MAC_address MAC address]. \\n\\nA common task a network administrator may come across is being able to identify a network device's manufacturer when given only a MAC address.\\n\\n\\n;Task:\\nInterface with one (or numerous) APIs that exist on the internet and retrieve the device manufacturer based on a supplied MAC address.\\n\\nA MAC address that does not return a valid result should return the String \\\"N/A\\\". An error related to the network connectivity or the API should return a null result.\\n\\nMany implementations on this page use http://api.macvendors.com/ which, as of 19th September 2021, is throttling requests. After only 2 calls, the following response is returned for all subsequent requests. If you are planning to use the same provider or going to run the examples on this page, consider building in a delay between two calls.\\n\\n'''{\\\"errors\\\":{\\\"detail\\\":\\\"Too Many Requests\\\",\\\"message\\\":\\\"Please slow down your requests or upgrade your plan at https://macvendors.com\\\"}}'''\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\n\\nwith AWS.Client;\\nwith AWS.Response;\\nwith AWS.Messages;\\n\\nprocedure MAC_Vendor is\\n\\n procedure Lookup (MAC : in String) is\\n use AWS.Response;\\n use AWS.Messages;\\n URL : constant String := \\\"http://api.macvendors.com/\\\" & MAC;\\n Page : constant Data := AWS.Client.Get (URL);\\n use Ada.Text_IO;\\n begin\\n Put (MAC);\\n Set_Col (20);\\n case AWS.Response.Status_Code (Page) is\\n when S200 => Put_Line (Message_Body (Page));\\n when S404 => Put_Line (\\\"N/A\\\");\\n when others => Put_Line (\\\"Error\\\");\\n end case;\\n end Lookup;\\n\\nbegin\\n -- Have to throttle traffic to site\\n Lookup (\\\"88:53:2E:67:07:BE\\\"); delay 1.500;\\n Lookup (\\\"D4:F4:6F:C9:EF:8D\\\"); delay 1.500;\\n Lookup (\\\"FC:FB:FB:01:FA:21\\\"); delay 1.500;\\n Lookup (\\\"4c:72:b9:56:fe:bc\\\"); delay 1.500;\\n Lookup (\\\"00-14-22-01-23-45\\\"); delay 1.500;\\n Lookup (\\\"23-45-67\\\"); delay 1.500;\\n Lookup (\\\"foobar\\\");\\nend MAC_Vendor;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"⍝load the library module\\n]load HttpCommand\\n\\n⍝ define a direct function (dfn) to look up a single MAC address\\nvendorLookup1 ← { (HttpCommand.Get 'http://api.macvendors.com/',⍕⍵).Data }\\n\\n⍝ define a traditional function to look up all the MAC addresses in a list with\\n⍝ a delay between calls\\n\\n⍝ The header says that the function is named vendorLookup, it takes a single\\n⍝ parameter which we call macList, and the value of the local variable\\n⍝ vendors will become the function's return value\\n∇ vendors ← vendorLookup macList\\n ⍝ look up the first vendor and put it into an array in our return var\\n vendors ← ⊆vendorLookup1 1↑macList\\n\\n ⍝ Loop over the rest of the array\\n :For burger :In 1↓macList\\n ⎕DL 2 ⍝ wait 2 seconds\\n vendors ⍪← ⊆vendorLookup1 burger ⍝ then look up the next vendor and append\\n :EndFor\\n∇\\n\\n⍝ demo data\\nmacList ← '88:53:2E:67:07:BE' 'D4:F4:6F:C9:EF:8D' 'FC:FB:FB:01:FA:21'\\nmacList ⍪← '4c:72:b9:56:fe:bc' '00-14-22-01-23-45'\\n\\n⍝ look up the vendors (takes a while with the 2-second delay between lookups)\\nvendorList ← vendorLookup macList\\n\\n⍝ the result is an array (a 1-row by N-column matrix). to print out one vendor\\n⍝ per line, we reshape it to be N rows by 1 column instead.\\n{(1⌷⍴⍵) 1 ⍴ ⍵} vendorList\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"set apiRoot to \\\"https://api.macvendors.com\\\"\\nset macList to {\\\"88:53:2E:67:07:BE\\\", \\\"D4:F4:6F:C9:EF:8D\\\", ¬\\n \\\"FC:FB:FB:01:FA:21\\\", \\\"4c:72:b9:56:fe:bc\\\", \\\"00-14-22-01-23-45\\\"}\\n\\non lookupVendor(macAddr)\\n global apiRoot\\n return do shell script \\\"curl \\\" & apiRoot & \\\"/\\\" & macAddr\\nend lookupVendor\\n\\nset table to { lookupVendor(first item of macList) }\\nrepeat with burger in macList's items 2 thru -1\\n delay 1.5\\n set end of table to lookupVendor(burger)\\nend repeat\\n\\nset text item delimiters to linefeed\\nreturn table as string\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"set savedTID to text item delimiters\\nset text item delimiters to linefeed\\nset tableText to table as string\\nset text item delimiters to savedTID\\nreturn tableText\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"loop [\\\"FC-A1-3E\\\" \\\"FC:FB:FB:01:FA:21\\\" \\\"BC:5F:F4\\\"] 'mac [\\n print [mac \\\"=>\\\" read ~\\\"http://api.macvendors.com/|mac|\\\"]\\n pause 1500\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"macLookup(MAC){\\n\\tWebRequest := ComObjCreate(\\\"WinHttp.WinHttpRequest.5.1\\\")\\n\\tWebRequest.Open(\\\"GET\\\", \\\"http://api.macvendors.com/\\\" MAC)\\n\\tWebRequest.Send()\\n\\treturn WebRequest.ResponseText\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"MsgBox % macLookup(\\\"00-14-22-01-23-45\\\")\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"OPTION TLS TRUE\\n\\nwebsite$ = \\\"api.macvendors.com\\\"\\nmac$ = \\\"b0:52:16:d0:3c:fb\\\"\\n\\nOPEN website$ & \\\":443\\\" FOR NETWORK AS mynet\\n SEND \\\"GET /\\\" & mac$ & \\\" HTTP/1.1\\\\r\\\\nHost: \\\" & website$ & \\\"\\\\r\\\\n\\\\r\\\\n\\\" TO mynet\\n RECEIVE info$ FROM mynet\\nCLOSE NETWORK mynet\\n\\nPRINT TOKEN$(info$, 2, \\\"\\\\r\\\\n\\\\r\\\\n\\\")\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \" DIM Block% 599 : REM Memory buffer to receive GET info\\n INSTALL @lib$ + \\\"SOCKLIB\\\" : PROC_initsockets\\n\\n READ Mac$\\n WHILE Mac$ > \\\"\\\"\\n WAIT 100 : REM 1 sec pause to avoid 'Too Many Requests' errors\\n Socket=FN_tcpconnect(\\\"api.macvendors.com\\\", \\\"80\\\")\\n I%=FN_writelinesocket(Socket, \\\"GET /\\\" + Mac$ + \\\" HTTP/1.0\\\")\\n I%=FN_writelinesocket(Socket, \\\"\\\")\\n REPEAT N%=FN_readsocket(Socket, Block%, 600) UNTIL N% > 0\\n PROC_closesocket(Socket)\\n PRINT Mac$ TAB(24);\\n CASE LEFT$($(Block% + 9), 3) OF\\n WHEN \\\"200\\\"\\n Block%?N%=0 : REM Add terminating 0x00\\n REPEAT N%-=1 UNTIL Block%?N% < 32 : REM Leave only last line\\n PRINT $$(Block% + N% + 1) : REM Print string from memory\\n WHEN \\\"404\\\"\\n PRINT \\\"N/A\\\"\\n OTHERWISE\\n PRINT \\\"ERROR\\\"\\n ENDCASE\\n READ Mac$\\n ENDWHILE\\n\\n PROC_exitsockets\\n END\\n\\n DATA 88:53:2E:67:07:BE, FC:FB:FB:01:FA:21, D4:F4:6F:C9:EF:8D, 10-11-22-33-44-55,\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <curl/curl.h>\\n#include <string.h>\\n#include <stdlib.h>\\n#include <stdio.h>\\n\\n/* Length of http://api.macvendors.com/ */\\n#define FIXED_LENGTH 16\\n\\nstruct MemoryStruct {\\n char *memory;\\n size_t size;\\n};\\n\\nstatic size_t WriteMemoryCallback(void *contents, size_t size, size_t nmemb, void *userp)\\n{\\n size_t realsize = size * nmemb;\\n struct MemoryStruct *mem = (struct MemoryStruct *)userp;\\n\\n mem->memory = realloc(mem->memory, mem->size + realsize + 1);\\n\\n memcpy(&(mem->memory[mem->size]), contents, realsize);\\n mem->size += realsize;\\n mem->memory[mem->size] = 0;\\n\\n return realsize;\\n}\\n\\nvoid checkResponse(char* str){\\n\\tchar ref[] = \\\"Vendor not found\\\";\\n\\tint len = strlen(str),flag = 1,i;\\n\\t\\n\\tif(len<16)\\n\\t\\tfputs(str,stdout);\\n\\telse{\\n\\t\\tfor(i=0;i<len && i<16;i++)\\n\\t\\t\\tflag = flag && (ref[i]==str[i]);\\n\\t\\t\\n\\t\\tflag==1?fputs(\\\"N/A\\\",stdout):fputs(str,stdout);\\n\\t}\\n}\\n\\nint main(int argC,char* argV[])\\n{\\n\\t\\tif(argC!=2)\\n\\t\\t\\tprintf(\\\"Usage : %s <MAC address>\\\",argV[0]);\\n\\t\\telse{\\n\\t\\t\\tCURL *curl;\\n\\t\\t\\tint len = strlen(argV[1]);\\n\\t\\t\\tchar* str = (char*)malloc((FIXED_LENGTH + len)*sizeof(char));\\n\\t\\t\\tstruct MemoryStruct chunk;\\n\\t\\t\\tCURLcode res;\\n\\n\\t\\t\\tchunk.memory = malloc(1);\\n\\t\\t\\tchunk.size = 0;\\n\\n if ((curl = curl_easy_init()) != NULL) {\\n\\t\\t\\t\\tsprintf(str,\\\"http://api.macvendors.com/%s\\\",argV[1]);\\n\\n curl_easy_setopt(curl, CURLOPT_URL, str);\\n\\t\\t\\t\\tcurl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, WriteMemoryCallback);\\n\\t\\t\\t\\tcurl_easy_setopt(curl, CURLOPT_WRITEDATA, (void *)&chunk);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tfree(str);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tres = curl_easy_perform(curl);\\n\\t\\t\\t\\t\\n if (res == CURLE_OK) {\\n\\t\\t\\t\\tcheckResponse(chunk.memory);\\n return EXIT_SUCCESS;\\n }\\n\\t\\t\\t\\t\\n curl_easy_cleanup(curl);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n return EXIT_FAILURE;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"// This code is based on the example 'Simple HTTP Client' included with\\n// the Boost documentation.\\n\\n#include <boost/beast/core.hpp>\\n#include <boost/beast/http.hpp>\\n#include <boost/beast/version.hpp>\\n#include <boost/asio/connect.hpp>\\n#include <boost/asio/ip/tcp.hpp>\\n#include <iostream>\\n#include <string>\\n\\nbool get_mac_vendor(const std::string& mac, std::string& vendor) {\\n namespace beast = boost::beast;\\n namespace http = beast::http;\\n namespace net = boost::asio;\\n using tcp = net::ip::tcp;\\n\\n net::io_context ioc;\\n tcp::resolver resolver(ioc);\\n const char* host = \\\"api.macvendors.com\\\";\\n\\n beast::tcp_stream stream(ioc);\\n stream.connect(resolver.resolve(host, \\\"http\\\"));\\n\\n http::request<http::string_body> req{http::verb::get, \\\"/\\\" + mac, 10};\\n req.set(http::field::host, host);\\n req.set(http::field::user_agent, BOOST_BEAST_VERSION_STRING);\\n http::write(stream, req);\\n\\n beast::flat_buffer buffer;\\n http::response<http::string_body> res;\\n http::read(stream, buffer, res);\\n\\n bool success = res.result() == http::status::ok;\\n if (success)\\n vendor = res.body();\\n\\n beast::error_code ec;\\n stream.socket().shutdown(tcp::socket::shutdown_both, ec);\\n if (ec && ec != beast::errc::not_connected)\\n throw beast::system_error{ec};\\n\\n return success;\\n}\\n\\nint main(int argc, char** argv) {\\n if (argc != 2 || strlen(argv[1]) == 0) {\\n std::cerr << \\\"usage: \\\" << argv[0] << \\\" MAC-address\\\\n\\\";\\n return EXIT_FAILURE;\\n }\\n try {\\n std::string vendor;\\n if (get_mac_vendor(argv[1], vendor)) {\\n std::cout << vendor << '\\\\n';\\n return EXIT_SUCCESS;\\n } else {\\n std::cout << \\\"N/A\\\\n\\\";\\n }\\n } catch(std::exception const& e) {\\n std::cerr << \\\"Error: \\\" << e.what() << std::endl;\\n }\\n return EXIT_FAILURE;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Net;\\nusing System.Net.Http;\\nusing System.Threading.Tasks;\\n\\nclass Program\\n{\\n static async Task<string> LookupMac(string MacAddress)\\n {\\n var uri = new Uri(\\\"http://api.macvendors.com/\\\" + WebUtility.UrlEncode(MacAddress));\\n using (var wc = new HttpClient())\\n return await wc.GetStringAsync(uri);\\n }\\n static void Main(string[] args)\\n {\\n foreach (var mac in new string[] { \\\"88:53:2E:67:07:BE\\\", \\\"FC:FB:FB:01:FA:21\\\", \\\"D4:F4:6F:C9:EF:8D\\\" })\\n Console.WriteLine(mac + \\\"\\\\t\\\" + LookupMac(mac).Result);\\n Console.ReadLine();\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(quicklisp:quickload :Drakma) ; or load it in another way\\n\\n(defun mac-vendor (mac)\\n (check-type mac string \\\"A MAC address as a string\\\")\\n (multiple-value-bind (vendor status)\\n (drakma:http-request (format nil \\\"http://api.macvendors.com/~a\\\" mac))\\n (if (= 200 status)\\n (format t \\\"~%Vendor is ~a\\\" vendor)\\n (error \\\"~%Not a MAC address: ~a\\\" mac))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"program MAC_Vendor_Lookup;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils,\\n IdHttp;\\n\\nfunction macLookUp(mac: string): string;\\nbegin\\n Result := '';\\n with TIdHTTP.Create(nil) do\\n begin\\n try\\n Result := Get('http://api.macvendors.com/' + mac);\\n\\n except\\n on E: Exception do\\n Writeln(e.Message);\\n end;\\n Free;\\n end;\\nend;\\n\\nbegin\\n Writeln(macLookUp('FC-A1-3E'));\\n sleep(1000);\\n Writeln(macLookUp('FC:FB:FB:01:FA:21'));\\n sleep(1000);\\n Writeln(macLookUp('BC:5F:F4'));\\n readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"USING: accessors calendar continuations http.client io kernel\\nsequences threads ;\\n\\n: mac-vendor ( str -- str )\\n \\\"http://api.macvendors.com/\\\" prepend\\n [ http-get nip ] [ nip response>> message>> ] recover ;\\n\\n\\\"FC-A1-3E\\\"\\n\\\"FC:FB:FB:01:FA:21\\\"\\n\\\"10-11-22-33-44-55-66\\\"\\n[ mac-vendor print 1 seconds sleep ] tri@\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"program MACVendorLookup;\\n\\nuses\\n fphttpclient;\\n\\nvar\\n res: String;\\nbegin\\n if paramCount > 0 then begin\\n\\n With TFPHttpClient.Create(Nil) do\\n try\\n allowRedirect := true;\\n try\\n res := Get('http://api.macvendors.com/' + ParamStr(1));\\n writeLn(res);\\n except\\n writeLn('N/A');\\n end;\\n finally\\n Free;\\n end;\\n end;\\nend.\\n\",\n \"language\": \"Free-Pascal-Lazarus\"\n },\n {\n \"code\": \"Function pipeout(Byval s As String = \\\"\\\") Byref As String\\n Var f = Freefile\\n Dim As String tmp\\n Open Pipe s For Input As #f\\n s = \\\"\\\"\\n Do Until Eof(f)\\n Line Input #f, tmp\\n s &= tmp\\n Loop\\n Close #f\\n Return s\\nEnd Function\\n\\nFunction lookupvendor(webpage As String, mac As String) As String\\n Return pipeout(\\\"powershell \\\" + \\\"(Invoke-WebRequest \\\" + webpage + mac + \\\")\\\")\\nEnd Function\\n\\nDim As String macs(1 To 4) = {\\\"FC-A1-3E\\\",\\\"FC:FB:FB:01:FA:21\\\",\\\"88:53:2E:67:07:BE\\\",\\\"D4:F4:6F:C9:EF:8D\\\"}\\n\\nFor i As Integer = 1 To Ubound(macs)\\n Var d = lookupvendor(\\\"api.macvendors.com/\\\", macs(i))\\n Var e = Instr(d, \\\"RawContent\\\")\\n Print Mid(d, 66, e-66)\\nNext i\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"net/http\\\"\\n\\t\\\"fmt\\\"\\n\\t\\\"io/ioutil\\\"\\n)\\n\\nfunc macLookUp(mac string) (res string){\\n\\tresp, _ := http.Get(\\\"http://api.macvendors.com/\\\" + mac)\\n\\tbody, _ := ioutil.ReadAll(resp.Body)\\n\\tres = string(body)\\n\\treturn\\n}\\n\\nfunc main() {\\n\\tfmt.Println(macLookUp(\\\"FC-A1-3E\\\"))\\n\\tfmt.Println(macLookUp(\\\"FC:FB:FB:01:FA:21\\\"))\\n\\tfmt.Println(macLookUp(\\\"BC:5F:F4\\\"))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"#!/usr/bin/env stack\\n{- stack\\n script\\n --resolver lts-9.0\\n --package bytestring\\n --package http-client\\n --package http-types\\n-}\\n\\n{-# LANGUAGE MultiWayIf #-}\\n\\nimport Control.Exception (try)\\nimport Control.Monad (forM_)\\nimport qualified Data.ByteString.Lazy.Char8 as L8 (ByteString, unpack)\\nimport Network.HTTP.Client\\n (Manager, parseRequest, httpLbs, responseStatus, responseBody,\\n newManager, defaultManagerSettings, Response, HttpException)\\nimport Network.HTTP.Types.Status (statusIsSuccessful, notFound404)\\nimport System.Environment (getArgs)\\nimport Text.Printf (printf)\\n\\nfetchURL :: Manager\\n -> String\\n -> IO (Either HttpException (Response L8.ByteString))\\nfetchURL mgr url = try $ do\\n req <- parseRequest url\\n httpLbs req mgr\\n\\nlookupMac :: Manager -> String -> IO String\\nlookupMac mgr mac = do\\n eth <- fetchURL mgr $ \\\"http://api.macvendors.com/\\\" ++ mac\\n return $ case eth of\\n Left _ -> \\\"null\\\"\\n Right resp -> let body = responseBody resp\\n status = responseStatus resp\\n in if | status == notFound404 -> \\\"N/A\\\"\\n | not (statusIsSuccessful status) -> \\\"null\\\"\\n | otherwise -> L8.unpack body\\n\\nmain :: IO ()\\nmain = do\\n args <- getArgs\\n mgr <- newManager defaultManagerSettings\\n forM_ args $ \\\\mac -> do\\n putStr $ printf \\\"%-17s\\\" mac ++ \\\" = \\\"\\n vendor <- lookupMac mgr mac\\n putStrLn vendor\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"require 'web/gethttp'\\nlookupMACvendor=: [: gethttp 'http://api.macvendors.com/'&,\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" addr=: '88:53:2E:67:07:BE';'FC:FB:FB:01:FA:21';'D4:F4:6F:C9:EF:8D';'23:45:67'\\n (,&' ' , lookupMACvendor)&> addr\\n88:53:2E:67:07:BE Intel Corporate\\nFC:FB:FB:01:FA:21 Cisco Systems, Inc\\nD4:F4:6F:C9:EF:8D Apple, Inc.\\n23:45:67 Vendor not found\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"package com.jamesdonnell.MACVendor;\\n\\nimport java.io.BufferedReader;\\nimport java.io.FileNotFoundException;\\nimport java.io.IOException;\\nimport java.io.InputStreamReader;\\nimport java.net.HttpURLConnection;\\nimport java.net.URL;\\n\\n/** MAC Vendor Lookup class.\\n * www.JamesDonnell.com\\n * @author James A. Donnell Jr. */\\npublic class Lookup {\\n\\t/** Base URL for API. The API from www.macvendors.com was chosen. */\\n\\tprivate static final String baseURL = \\\"http://api.macvendors.com/\\\";\\n\\n\\t/** Performs lookup on MAC address(es) supplied in arguments.\\n\\t * @param args MAC address(es) to lookup. */\\n\\tpublic static void main(String[] args) {\\n\\t\\tfor (String arguments : args)\\n\\t\\t\\tSystem.out.println(arguments + \\\": \\\" + get(arguments));\\n\\t}\\n\\n\\t/** Performs lookup on supplied MAC address.\\n\\t * @param macAddress MAC address to lookup.\\n\\t * @return Manufacturer of MAC address. */\\n\\tprivate static String get(String macAddress) {\\n\\t\\ttry {\\n\\t\\t\\tStringBuilder result = new StringBuilder();\\n\\t\\t\\tURL url = new URL(baseURL + macAddress);\\n\\t\\t\\tHttpURLConnection conn = (HttpURLConnection) url.openConnection();\\n\\t\\t\\tconn.setRequestMethod(\\\"GET\\\");\\n\\t\\t\\tBufferedReader rd = new BufferedReader(new InputStreamReader(conn.getInputStream()));\\n\\t\\t\\tString line;\\n\\t\\t\\twhile ((line = rd.readLine()) != null) {\\n\\t\\t\\t\\tresult.append(line);\\n\\t\\t\\t}\\n\\t\\t\\trd.close();\\n\\t\\t\\treturn result.toString();\\n\\t\\t} catch (FileNotFoundException e) {\\n\\t\\t\\t// MAC not found\\n\\t\\t\\treturn \\\"N/A\\\";\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\t// Error during lookup, either network or API.\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.io.IOException;\\nimport java.net.URI;\\nimport java.net.http.HttpClient;\\nimport java.net.http.HttpRequest;\\nimport java.net.http.HttpResponse;\\nimport java.util.List;\\nimport java.util.concurrent.TimeUnit;\\n\\npublic final class MacVendorLookup {\\n\\n\\tpublic static void main(String[] aArgs) throws InterruptedException, IOException {\\t\\t\\n\\t\\tfor ( String macAddress : macAddresses ) {\\n\\t\\t\\tHttpResponse<String> response = getMacVendor(macAddress);\\n\\t\\t\\tSystem.out.println(macAddress + \\\" \\\" + response.statusCode() + \\\" \\\" + response.body());\\n\\t\\t\\t\\n\\t\\t\\tTimeUnit.SECONDS.sleep(2);\\n\\t\\t}\\t\\t\\n\\t}\\n\\n\\tprivate static HttpResponse<String> getMacVendor(String aMacAddress) throws IOException, InterruptedException {\\t\\t\\t\\t\\n\\t\\tURI uri = URI.create(BASE_URL + aMacAddress);\\n\\t\\tHttpClient client = HttpClient.newHttpClient();\\n\\t\\tHttpRequest request = HttpRequest\\n\\t\\t\\t.newBuilder()\\n\\t\\t .uri(uri)\\n\\t\\t .header(\\\"accept\\\", \\\"application/json\\\")\\n\\t\\t .GET()\\n\\t\\t .build();\\n\\t\\t\\n\\t\\tHttpResponse<String> response = client.send(request, HttpResponse.BodyHandlers.ofString());\\n\\t\\t\\n\\t\\treturn response;\\n\\t}\\n\\t\\n\\tprivate static final String BASE_URL = \\\"http://api.macvendors.com/\\\";\\n\\t\\n\\tprivate static final List<String> macAddresses = List.of(\\\"88:53:2E:67:07:BE\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\\"D4:F4:6F:C9:EF:8D\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\\"FC:FB:FB:01:FA:21\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\\"4c:72:b9:56:fe:bc\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\\"00-14-22-01-23-45\\\"\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t );\\t\\n\\t\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var mac = \\\"88:53:2E:67:07:BE\\\";\\nfunction findmac(){\\n\\twindow.open(\\\"http://api.macvendors.com/\\\" + mac);\\n}\\n\\nfindmac();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# v0.6.0\\n\\nusing Requests\\n\\nfunction getvendor(addr::String)\\n try\\n get(\\\"http://api.macvendors.com/$addr\\\") |> readstring\\n catch e\\n nothing\\n end\\nend\\n\\nfor addr in [\\\"88:53:2E:67:07:BE\\\", \\\"FC:FB:FB:01:FA:21\\\", \\\"D4:F4:6F:C9:EF:8D\\\", \\\"23:45:67\\\"]\\n println(\\\"$addr -> \\\", getvendor(addr))\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nimport java.net.URL\\n\\nfun lookupVendor(mac: String) = URL(\\\"http://api.macvendors.com/\\\" + mac).readText()\\n\\nfun main(args: Array<String>) {\\n val macs = arrayOf(\\\"FC-A1-3E\\\", \\\"FC:FB:FB:01:FA:21\\\", \\\"88:53:2E:67:07:BE\\\", \\\"D4:F4:6F:C9:EF:8D\\\")\\n for (mac in macs) println(lookupVendor(mac))\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"make \\\"api_root \\\"http://api.macvendors.com/\\nmake \\\"mac_list [88:53:2E:67:07:BE D4:F4:6F:C9:EF:8D FC:FB:FB:01:FA:21\\n 4c:72:b9:56:fe:bc 00-14-22-01-23-45]\\n\\nto lookup_vendor :mac\\n output first shell (sentence [curl -s] (word :api_root :mac) [&& echo])\\nend\\n\\nprint lookup_vendor first :mac_list\\nforeach butfirst :mac_list [\\n wait 90\\n print lookup_vendor ?\\n]\\nbye\\nbye\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"-- Requires LuaSocket extension by Lua\\n-- Created by James A. Donnell Jr.\\n-- www.JamesDonnell.com\\n\\nlocal baseURL = \\\"http://api.macvendors.com/\\\"\\n\\nlocal function lookup(macAddress)\\n\\thttp = require \\\"socket.http\\\"\\n\\tresult, statuscode, content = http.request(baseURL .. macAddress)\\n\\treturn result\\nend\\n\\nlocal macAddress = \\\"FC-A1-3E-2A-1C-33\\\"\\nprint(lookup(macAddress))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Checkit {\\n httpGet$=lambda$ (url$, timeout=500)->{\\n declare htmldoc \\\"WinHttp.WinHttpRequest.5.1\\\"\\n Method htmldoc \\\"SetTimeouts\\\", timeout, timeout, timeout, timeout\\n Method htmldoc \\\"open\\\",\\\"GET\\\", url$, false\\n Method htmldoc \\\"setRequestHeader\\\",\\\"Content-Type\\\", \\\"application/x-www-form-urlencoded\\\"\\n Method htmldoc \\\"send\\\"\\n With htmldoc, \\\"responseText\\\" as ready$\\n res$=trim$(ready$)\\n if left$(res$,1)=\\\"{\\\" then\\n =\\\"N/A\\\"\\n else\\n =res$\\n end if\\n declare htmldoc nothing\\n }\\n Urls=(\\\"88:53:2E:67:07:BE\\\", \\\"FC:FB:FB:01:FA:21\\\", \\\"D4:F4:6F:C9:EF:8D\\\", \\\"BC:5F:F4\\\")\\n url=each(URLs)\\n While Url {\\n Print Array$(URL),@(20), httpGet$(\\\"https://api.macvendors.com/\\\"+Array$(URL))\\n Wait 1500\\n }\\n}\\nCheckit\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"macLookup[mac_String] := Quiet[Check[Import[\\\"http://api.macvendors.com/\\\" <> mac], \\\"N/A\\\"]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"macLookup[\\\"00-14-22-01-23-45\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"macList = [\\\"88:53:2E:67:07:BE\\\", \\\"FC:FB:FB:01:FA:21\\\", \\\"00:02:55:00:00:00\\\",\\n \\\"D4:F4:6F:C9:EF:8D\\\", \\\"23:45:67\\\", \\\"18:93:D7\\\", \\\"1C:A6:81\\\"]\\n\\nfor mac in macList\\n\\tret = http.get(\\\"http://api.macvendors.com/\\\"+mac)\\n\\tif ret == \\\"HTTP/1.1 404 Not Found\\\" then ret = \\\"N/A\\\"\\n\\tprint ret\\n\\twait 1\\nend for\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"import httpclient\\n\\nfor mac in [\\\"FC-A1-3E\\\", \\\"FC:FB:FB:01:FA:21\\\", \\\"BC:5F:F4\\\"]:\\n echo newHttpClient().getContent(\\\"http://api.macvendors.com/\\\"&mac)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let mactable = http get \\\"http://standards-oui.ieee.org/oui/oui.csv\\\" | from csv --no-infer\\n\\ndef get-mac-org [] {\\n\\tlet assignment = $in | str upcase | str replace --all --regex \\\"[^A-Z0-9]\\\" \\\"\\\" | str substring 0..6\\n\\t$mactable | where Assignment == $assignment | try {first | get \\\"Organization Name\\\"} catch {\\\"N/A\\\"}\\n}\\n\\n# Test cases from the Ada entry\\nlet macs = [\\n\\t# Should succeed\\n\\t\\\"88:53:2E:67:07:BE\\\"\\n\\t\\\"D4:F4:6F:C9:EF:8D\\\"\\n\\t\\\"FC:FB:FB:01:FA:21\\\"\\n\\t\\\"4c:72:b9:56:fe:bc\\\"\\n\\t\\\"00-14-22-01-23-45\\\"\\n\\t# Should fail\\n\\t\\\"23-45-67\\\"\\n\\t\\\"foobar\\\"\\n]\\n\\n$macs | each {{MAC: $in, Vendor: ($in | get-mac-org)}}\\n\",\n \"language\": \"Nu\"\n },\n {\n \"code\": \"(* build with ocamlfind ocamlopt -package netclient -linkpkg macaddr.ml -o macaddr *)\\n\\nopen Printf\\nopen Nethttp_client.Convenience\\nopen Unix\\n\\n(* example vendors, including a nonsense one *)\\n\\nlet vendors = [\\\"FF:FF:FF:67:07:BE\\\"; \\\"D4:F4:6F:C9:EF:8D\\\"; \\\"FC:FB:FB:01:FA:21\\\"; \\\"88:53:2E:67:07:BE\\\"]\\n\\nlet get_vendor addr =\\n sleep 3; (* built-in delay to handle rate-limiting at macvendors.com *)\\n\\n let client = http_get_message (\\\"http://api.macvendors.com/\\\" ^ addr) in\\n match client # response_status_code with\\n | 200 -> client # response_body # value\\n | 404 -> \\\"N/A\\\"\\n | _ -> \\\"NULL\\\"\\n\\nlet rec parse_vendors vendors =\\n match vendors with\\n | [] -> []\\n | hd::tl -> get_vendor hd :: parse_vendors tl\\n\\nlet rec print_vendors vendor_list =\\n match vendor_list with\\n | [] -> \\\"\\\"\\n | hd::tl -> printf \\\"%s\\\\n\\\" hd; print_vendors tl\\n\\nlet main =\\n let vendor_list = parse_vendors vendors in\\n print_vendors vendor_list\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"#!/usr/bin/env perl -T\\nuse v5.18.2;\\nuse warnings;\\nuse LWP;\\nuse Time::HiRes qw(sleep);\\n\\nour $VERSION = 1.000_000;\\n\\nmy $ua = LWP::UserAgent->new;\\n\\nno warnings 'qw';\\nmy @macs = qw(\\n FC-A1-3EFC:FB:FB:01:FA:21 00,0d,4b\\n Rhubarb 00-14-22-01-23-45\\n 10:dd:b1 D4:F4:6F:C9:EF:8D\\n FC-A1-3E 88:53:2E:67:07:BE\\n 23:45:67 FC:FB:FB:01:FA:21\\n BC:5F:F4\\n);\\n\\nwhile (my $mac = shift @macs) {\\n my $vendor = get_mac_vendor($mac);\\n if ($vendor) {\\n say \\\"$mac = $vendor\\\";\\n }\\n sleep 1.5 if @macs;\\n}\\n\\nsub get_mac_vendor {\\n my $s = shift;\\n\\n my $req = HTTP::Request->new( GET => \\\"http://api.macvendors.com/$s\\\" );\\n my $res = $ua->request($req);\\n\\n # A error related to the network connectivity or the API should\\n # return a null result.\\n if ( $res->is_error ) {\\n return;\\n }\\n\\n # A MAC address that does not return a valid result should\\n # return the String \\\"N/A\\\".\\n if ( !$res->content\\n or $res->content eq 'Vendor not found' )\\n {\\n return 'N/A';\\n }\\n\\n return $res->content;\\n}\\n\\n# IEEE 802:\\n# Six groups of two hexadecimal digits separated by hyphens or colons,\\n# like 01-23-45-67-89-ab or 01:23:45:67:89:ab\\n# Three groups of four hexadecimal digits separated by dots (.),\\n# like 0123.4567.89ab\\n#sub validmac {\\n# my $s = shift;\\n#\\n# my $hex = qr{ [A-Fa-f[:digit:]] }xms;\\n# my $hex2ws = qr{ [-:] $hex{2} }xms;\\n#\\n# if ( $s =~ m{\\\\A $hex{2} $hex2ws{5} \\\\z}xms\\n# or $s =~ m{\\\\A $hex{4} [.] $hex{4} [.] $hex{4} \\\\z}xms )\\n# {\\n# return 'true';\\n# }\\n# return;\\n#}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- libcurl</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">test</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"00-11-22-33-44-55-66\\\"</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- CIMSYS Inc\\n --string test = \\\"10-11-22-33-44-55-66\\\" -- N/A</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">builtins</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">libcurl</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #7060A8;\\\">curl_global_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">curl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">curl_easy_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">url</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"http://api.macvendors.com/%s\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #7060A8;\\\">curl_easy_setopt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">CURLOPT_URL</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">url</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: #7060A8;\\\">curl_easy_perform_ex</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #004080;\\\">string</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: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">\\\"Vendor not found\\\"</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">`{\\\"errors\\\":{\\\"detail\\\":\\\"Not Found\\\"}}`</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"N/A\\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #0000FF;\\\">?{</span><span style=\\\"color: #008000;\\\">\\\"error\\\"</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: #7060A8;\\\">curl_easy_cleanup</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">curl_global_cleanup</span><span style=\\\"color: #0000FF;\\\">()</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\n$apiRoot = \\\"https://api.macvendors.com\\\";\\n$macList = array(\\\"88:53:2E:67:07:BE\\\", \\\"D4:F4:6F:C9:EF:8D\\\",\\n\\t\\t \\\"FC:FB:FB:01:FA:21\\\", \\\"4c:72:b9:56:fe:bc\\\", \\\"00-14-22-01-23-45\\\");\\n\\n$curl = curl_init();\\ncurl_setopt($curl, CURLOPT_RETURNTRANSFER, true);\\nforeach ($macList as $burger) {\\n curl_setopt($curl, CURLOPT_URL, \\\"$apiRoot/$burger\\\");\\n echo(curl_exec($curl));\\n echo(\\\"\\\\n\\\");\\n sleep(2);\\n}\\ncurl_close($curl);\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"$apiRoot = \\\"http://api.macvendors.com\\\"\\n$macAddresses = @(\\\"88:53:2E:67:07:BE\\\", \\\"D4:F4:6F:C9:EF:8D\\\",\\n \\\"FC:FB:FB:01:FA:21\\\", \\\"4c:72:b9:56:fe:bc\\\",\\n \\\"00-14-22-01-23-45\\\")\\n\\n$macAddresses | % {\\n (Invoke-WebRequest \\\"$apiRoot/$_\\\").Content\\n Start-Sleep 1.5\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"import requests\\n\\nfor addr in ['88:53:2E:67:07:BE', 'FC:FB:FB:01:FA:21',\\n 'D4:F4:6F:C9:EF:8D', '23:45:67']:\\n vendor = requests.get('http://api.macvendors.com/' + addr).text\\n print(addr, vendor)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require net/url)\\n\\n(define (lookup-MAC-address addr)\\n (port->string\\n (get-pure-port\\n (url \\\"http\\\" #f \\\"api.macvendors.com\\\" #f #t (list (path/param addr null)) null #f))))\\n\\n(module+ test\\n(for ((i (in-list '(\\\"88:53:2E:67:07:BE\\\"\\n \\\"FC:FB:FB:01:FA:21\\\"\\n \\\"D4:F4:6F:C9:EF:8D\\\"))))\\n (printf \\\"~a\\\\t~a~%\\\" i (lookup-MAC-address i))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use HTTP::UserAgent;\\n\\nmy $ua = HTTP::UserAgent.new;\\n\\n$ua.timeout = 10; # seconds\\n\\nmy $server = 'http://api.macvendors.com/';\\n\\nsub lookup ($mac) {\\n my $response = $ua.get: \\\"$server+$mac\\\";\\n sleep 1;\\n return $response.is-success ?? $response.content !! 'N/A';\\n\\n CATCH { # Normally you would report some information about what\\n default { Nil } # went wrong, but the task specifies to ignore errors.\\n }\\n}\\n\\nfor <\\nBC:5F:F4\\nFC-A1-3E\\n10:dd:b1\\n00:0d:4b\\n23:45:67\\n> -> $mac { say lookup $mac }\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"print read rejoin [http://api.macvendors.com/ ask \\\"MAC address: \\\"]\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"/*REXX pgm shows a network device's manufacturer based on the Media Access Control addr.*/\\nwin_command = 'getmac' /*name of the Microsoft Windows command*/\\nwin_command_options = '/v /fo list' /*options of \\\" \\\" \\\" */\\n?3= 'Network Adapter:' /*search keywords for Network Adapter. */\\n?4= 'Physical Address:' /* \\\" \\\" \\\" Physical Address.*/\\nupper ?3 ?4 /*uppercase in case for capitol letters*/\\n@.=; @.0= 0 /*just─in─case values for the keywords.*/\\nrc= 0 /* \\\" \\\" \\\" value for the returnCode*/\\naddress system win_command win_command_options with output stem @. /*issue command.*/\\nif rc\\\\==0 then do /*display an error if not successful. */\\n say\\n say '***error*** from command: ' win_command win_command_options\\n say 'Return code was: ' rc\\n say\\n exit rc\\n end\\nMACaddr=. /*just─in─case value for the keyword. */\\nmaker=. /* \\\" \\\" \\\" \\\" \\\" \\\" \\\" */\\n do j=1 for @.0; $= @.j; upper $ /*parse each of the possible responses.*/\\n if left($, length(?3))=?3 then maker= subword(@.j, 3) /*is this the one?*/\\n if left($, length(?4))=?4 then MACaddr= word(@.j, 3) /* \\\" \\\" \\\" \\\" */\\n end /*k*/\\n /* [↑] Now, display good or bad stuff.*/\\nif maker=. | MACaddr==. then say 'MAC address manufacturer not found.'\\n else say 'manufacturer for MAC address ' MACaddr \\\" is \\\" maker\\nexit 0 /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project: MAC Vendor Lookup\\n\\nload \\\"stdlib.ring\\\"\\nmacs = [\\\"FC-A1-3E\\\",\\\"FC:FB:FB:01:FA:21\\\",\\\"88:53:2E:67:07:BE\\\",\\\"D4:F4:6F:C9:EF:8D\\\"]\\nfor mac = 1 to len(macs)\\n lookupvendor(macs[mac])\\nnext\\n\\nfunc lookupvendor(mac)\\n url = download(\\\"api.macvendors.com/\\\" + mac)\\n see url + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'net/http'\\n\\narr = ['88:53:2E:67:07:BE', 'FC:FB:FB:01:FA:21', 'D4:F4:6F:C9:EF:8D', '23:45:67']\\n\\narr.each do |addr|\\n vendor = Net::HTTP.get('api.macvendors.com', \\\"/#{addr}/\\\") rescue nil\\n puts \\\"#{addr} #{vendor}\\\"\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"extern crate reqwest;\\n\\nuse std::{thread, time};\\n\\nfn get_vendor(mac: &str) -> Option<String> {\\n let mut url = String::from(\\\"http://api.macvendors.com/\\\");\\n url.push_str(mac);\\n let url_ref = &url;\\n match reqwest::get(url_ref) {\\n Ok(mut res) => match res.text() {\\n Ok(text) => {\\n if text.contains(\\\"Not Found\\\") {\\n Some(\\\"N/A\\\".to_string())\\n } else {\\n Some(text)\\n }\\n }\\n Err(e) => {\\n println!(\\\"{:?}\\\", e);\\n None\\n }\\n },\\n Err(e) => {\\n println!(\\\"{:?}\\\", e);\\n None\\n }\\n }\\n}\\n\\nfn main() {\\n let duration = time::Duration::from_millis(1000);\\n match get_vendor(\\\"88:53:2E:67:07:BE\\\") {\\n None => println!(\\\"Error!\\\"),\\n Some(text) => println!(\\\"{}\\\", text),\\n }\\n thread::sleep(duration);\\n match get_vendor(\\\"FC:FB:FB:01:FA:21\\\") {\\n None => println!(\\\"Error!\\\"),\\n Some(text) => println!(\\\"{}\\\", text),\\n }\\n thread::sleep(duration);\\n match get_vendor(\\\"FC-A1-3E\\\") {\\n None => println!(\\\"Error!\\\"),\\n Some(text) => println!(\\\"{}\\\", text),\\n }\\n thread::sleep(duration);\\n match get_vendor(\\\"abcdefg\\\") {\\n None => println!(\\\"Error!\\\"),\\n Some(text) => println!(\\\"{}\\\", text),\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object LookUp extends App {\\n val macs = Seq(\\\"FC-A1-3E\\\", \\\"FC:FB:FB:01:FA:21\\\", \\\"88:53:2E:67:07:BE\\\", \\\"D4:F4:6F:C9:EF:8D\\\")\\n\\n def lookupVendor(mac: String) =\\n scala.io.Source.fromURL(\\\"\\\"\\\"http://api.macvendors.com/\\\"\\\"\\\" + mac, \\\"UTF-8\\\").mkString\\n\\n macs.foreach(mac => println(lookupVendor(mac)))\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(import http-client (chicken io))\\n(define api-root \\\"http://api.macvendors.com\\\")\\n(define mac-addresses '(\\\"88:53:2E:67:07:BE\\\" \\\"D4:F4:6F:C9:EF:8D\\\"\\n \\\"FC:FB:FB:01:FA:21\\\" \\\"4c:72:b9:56:fe:bc\\\"\\n \\\"00-14-22-01-23-45\\\"))\\n\\n(define get-vendor (lambda (mac-address)\\n (with-input-from-request (string-append api-root \\\"/\\\" mac-address)\\n #f read-string)))\\n\\n(display (get-vendor (car mac-addresses)))\\n(newline)\\n(map (lambda (burger) (sleep 2) (display (get-vendor burger)) (newline))\\n (cdr mac-addresses))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"package require http\\n\\n# finally is a bit like go's defer\\nproc finally args {\\n tailcall trace add variable :#finally#: unset [list apply [list args $args]]\\n}\\n\\n# basic wrapper for http::geturl\\nproc geturl {url} {\\n set tok [::http::geturl $url]\\n finally ::http::cleanup $tok\\n ::http::data $tok\\n}\\nproc maclookup {mac} {\\n geturl http://api.macvendors.com/$mac\\n}\\n\\nforeach mac {00-14-22-01-23-45 88:53:2E:67:07:BE} {\\n puts \\\"$mac\\\\t[maclookup $mac]\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"macList=(88:53:2E:67:07:BE D4:F4:6F:C9:EF:8D FC:FB:FB:01:FA:21\\n 4c:72:b9:56:fe:bc 00-14-22-01-23-45)\\n\\nlookup() {\\n curl -s \\\"http://api.macvendors.com/$1\\\" && echo\\n}\\n\\nlookup \\\"${macList[0${ZSH_VERSION:++1}]}\\\"\\nfor burger in \\\"${macList[@]:1}\\\"; do\\n sleep 2\\n lookup \\\"$burger\\\"\\ndone\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"set -- 88:53:2E:67:07:BE D4:F4:6F:C9:EF:8D FC:FB:FB:01:FA:21 \\\\\\n 4c:72:b9:56:fe:bc 00-14-22-01-23-45\\n\\nlookup() {\\n curl -s \\\"http://api.macvendors.com/$1\\\" && echo\\n}\\n\\nlookup \\\"$1\\\"\\nshift\\nfor burger; do\\n sleep 2\\n curl -s \\\"http://api.macvendors.com/$burger\\\" && echo\\ndone\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"set macList=(88:53:2E:67:07:BE D4:F4:6F:C9:EF:8D FC:FB:FB:01:FA:21 \\\\\\n 4c:72:b9:56:fe:bc 00-14-22-01-23-45)\\n\\nalias lookup curl -s \\\"http://api.macvendors.com/!\\\":1 \\\"&&\\\" echo\\n\\nlookup \\\"$macList[1]\\\"\\nforeach burger ($macList[2-]:q)\\n sleep 2\\n lookup \\\"$burger\\\"\\nend\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"import net.http\\nimport time\\n\\nconst macs =\\n('\\nFC-A1-3E\\nFC:FB:FB:01:FA:21\\nD4:F4:6F:C9:EF:8D\\n')\\n\\nfn main() {\\n for line in macs.split('\\\\n') {\\n if line !='' {\\n println(mac_lookup(line))\\n time.sleep(2 * time.second) // considerate delay between attempts\\n }\\n }\\n}\\n\\nfn mac_lookup(mac string) string {\\n resp := http.get(\\\"http://api.macvendors.com/\\\" + mac) or {return 'No data from server'}\\n return resp.body.str()\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"a=array(\\\"00-20-6b-ba-d0-cb\\\",\\\"00-40-ae-04-87-86\\\")\\nset WebRequest = CreateObject(\\\"WinHttp.WinHttpRequest.5.1\\\")\\n\\nfor each MAC in a\\n if b<>0 then wscript.echo \\\"Spacing next request...\\\": wscript.sleep 2000\\n WebRequest.Open \\\"GET\\\", \\\"http://api.macvendors.com/\\\"& mac,1\\n WebRequest.Send()\\n WebRequest.WaitForResponse\\n b=b+1\\n wscript.echo mac & \\\" -> \\\" & WebRequest.ResponseText\\nnext\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"' MAC Vendor lookup - based on the C# sample.\\n\\nImports System\\nImports System.Net\\n\\nModule LookupMac\\n\\n Public Sub Main(args() As String)\\n\\n Dim macAddress As String = If(args.Length < 1, \\\"88:53:2E:67:07:BE\\\", args(0))\\n Dim uri As New Uri(\\\"http://api.macvendors.com/\\\" & WebUtility.UrlEncode(macAddress))\\n Dim wc As New WebClient()\\n Console.Out.WriteLine(macAddress & \\\" \\\" & wc.DownloadString(uri))\\n\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"/* MAC_vendor_lookup.wren */\\nclass MAC {\\n foreign static lookup(address)\\n}\\n\\nSystem.print(MAC.lookup(\\\"FC:FB:FB:01:FA:21\\\"))\\nfor (i in 1..1e8) {} // slow down request\\nSystem.print(MAC.lookup(\\\"23:45:67\\\"))\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"/* MAC_vendor_lookup.go */\\npackage main\\n\\nimport (\\n wren \\\"github.com/crazyinfin8/WrenGo\\\"\\n \\\"io/ioutil\\\"\\n \\\"net/http\\\"\\n)\\n\\ntype any = interface{}\\n\\nfunc macLookup(vm *wren.VM, parameters []any) (any, error) {\\n mac := parameters[1].(string)\\n resp, err := http.Get(\\\"http://api.macvendors.com/\\\" + mac)\\n if err != nil {\\n return nil, nil\\n }\\n body, err := ioutil.ReadAll(resp.Body)\\n if err != nil {\\n return nil, nil\\n }\\n var vendor = string(body)\\n if vendor == `{\\\"errors\\\":{\\\"detail\\\":\\\"Not Found\\\"}}` {\\n return \\\"N/A\\\", nil\\n }\\n return vendor, nil\\n}\\n\\nfunc main() {\\n vm := wren.NewVM()\\n fileName := \\\"MAC_vendor_lookup.wren\\\"\\n methodMap := wren.MethodMap{\\\"static lookup(_)\\\": macLookup}\\n classMap := wren.ClassMap{\\\"MAC\\\": wren.NewClass(nil, nil, methodMap)}\\n module := wren.NewModule(classMap)\\n vm.SetModule(fileName, module)\\n vm.InterpretFile(fileName)\\n vm.Free()\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"var [const] CURL=Import(\\\"zklCurl\\\"); // libcurl\\nconst MAC_VENDORS=\\\"http://api.macvendors.com/\\\";\\n\\nfcn lookUp(macAddress){\\n httpAddr:=MAC_VENDORS + macAddress;\\n vender:=CURL().get(httpAddr); //-->(Data,bytes of header,bytes of trailer)\\n vender=vender[0].del(0,vender[1]); // remove HTTP header\\n vender.text;\\t\\t// Data --> String (Data is a byte bucket)\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"lookUp(\\\"FC-A1-3E-2A-1C-33\\\").println();\\nlookUp(\\\"4c:72:b9:56:fe:bc\\\").println();\\nlookUp(\\\"foobar\\\").println();\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"program: mac_vendor_lookup\\n\\ndata: 'http://api.macvendors.com/'\\n\\ninput: 'D4:F4:6F:C9:EF:8D'\\nderive: 'http://api.macvendors.com/D4:F4:6F:C9:EF:8D'\\noutput: 'Apple, Inc.'\\n\",\n \"language\": \"Zoea\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"MAC-vendor-lookup"}}},{"rowIdx":459,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Mad_Libs\n","language":"00-META"},{"code":"<br>\n[[wp:Mad Libs|Mad Libs]] is a phrasal template word game where one player prompts another for a list of words to substitute for blanks in a story, usually with funny results. \n\n\n;Task;\nWrite a program to create a Mad Libs like story. \n\nThe program should read an arbitrary multiline story from input.\n\nThe story will be terminated with a blank line. \n\nThen, find each replacement to be made within the story, ask the user for a word to replace it with, and make all the replacements.\n\nStop when there are none left and print the final story.\n\n\nThe input should be an arbitrary story in the form:\n<pre>\n<name> went for a walk in the park. <he or she>\nfound a <noun>. <name> decided to take it home.\n</pre>\nGiven this example, it should then ask for a <tt>name</tt>, a <tt>he or she</tt> and a <tt>noun</tt> (<tt><nowiki><name></nowiki></tt> gets replaced both times with the same value).\n\n\n{{Template:Strings}}\n<br><br>\n\n","language":"00-TASK"},{"code":"V template = ‘<name> went for a walk in the park. <he or she>\nfound a <noun>. <name> decided to take it home.’\n\nF madlibs(template)\n print(\"The story template is:\\n\"template)\n V fields = sorted(Array(Set(re:‘<[^>]+>’.find_strings(template))))\n V values = input(\"\\nInput a comma-separated list of words to replace the following items\\n #.: \".format(fields.join(‘,’))).split(‘,’)\n V story = template\n L(f, v) zip(fields, values)\n story = story.replace(f, v)\n print(\"\\nThe story becomes:\\n\\n\"story)\n\nmadlibs(template)\n","language":"11l"},{"code":"with Ada.Text_IO, Ada.Command_Line, String_Helper;\n\nprocedure Madlib is\n\n use String_Helper;\n\n Text: Vector := Get_Vector(Ada.Command_Line.Argument(1));\n M, N: Natural;\n\nbegin\n -- search for templates and modify the text accordingly\n for I in Text.First_Index .. Text.Last_Index loop\n loop\n Search_Brackets(Text.Element(I), \"<\", \">\", M, N);\n exit when M=0; -- \"M=0\" means \"not found\"\n Ada.Text_IO.Put_Line(\"Replacement for \" & Text.Element(I)(M .. N) & \"?\");\n declare\n Old: String := Text.Element(I)(M .. N);\n New_Word: String := Ada.Text_IO.Get_Line;\n begin\n for J in I .. Text.Last_Index loop\n Text.Replace_Element(J, Replace(Text.Element(J), Old, New_Word));\n end loop;\n end;\n end loop;\n end loop;\n\n -- write the text\n for I in Text.First_Index .. Text.Last_Index loop\n Ada.Text_IO.Put_Line(Text.Element(I));\n end loop;\nend Madlib;\n","language":"Ada"},{"code":"with Ada.Containers.Indefinite_Vectors;\n\npackage String_Helper is\n\n function Index(Source: String; Pattern: String) return Natural;\n\n procedure Search_Brackets(Source: String;\n Left_Bracket: String;\n Right_Bracket: String;\n First, Last: out Natural);\n -- returns indices of first pair of brackets in source\n -- indices are zero if no such brackets are found\n\n function Replace(Source: String; Old_Word: String; New_Word: String)\n return String;\n\n package String_Vec is new Ada.Containers.Indefinite_Vectors\n (Index_Type => Positive,\n Element_Type => String);\n\n type Vector is new String_Vec.Vector with null record;\n\n function Get_Vector(Filename: String) return Vector;\n\nend String_Helper;\n","language":"Ada"},{"code":"with Ada.Strings.Fixed, Ada.Text_IO;\n\npackage body String_Helper is\n\n function Index(Source: String; Pattern: String) return Natural is\n begin\n return Ada.Strings.Fixed.Index(Source => Source, Pattern => Pattern);\n end Index;\n\n procedure Search_Brackets(Source: String;\n Left_Bracket: String;\n Right_Bracket: String;\n First, Last: out Natural) is\n begin\n First := Index(Source, Left_Bracket);\n if First = 0 then\n Last := 0; -- not found\n else\n Last := Index(Source(First+1 .. Source'Last), Right_Bracket);\n if Last = 0 then\n First := 0; -- not found;\n end if;\n end if;\n end Search_Brackets;\n\n function Replace(Source: String; Old_Word: String; New_Word: String)\n return String is\n L: Positive := Old_Word'Length;\n I: Natural := Index(Source, Old_Word);\n begin\n if I = 0 then\n return Source;\n else\n return Source(Source'First .. I-1) & New_Word\n & Replace(Source(I+L .. Source'Last), Old_Word, New_Word);\n end if;\n end Replace;\n\n function Get_Vector(Filename: String) return Vector is\n F: Ada.Text_IO.File_Type;\n T: Vector;\n begin\n Ada.Text_IO.Open(F, Ada.Text_IO.In_File, Filename);\n while not Ada.Text_IO.End_Of_File(F) loop\n T.Append(Ada.Text_IO.Get_Line(F));\n end loop;\n Ada.Text_IO.Close(F);\n return T;\n end Get_Vector;\n\nend String_Helper;\n","language":"Ada"},{"code":"file f;\ndata b;\nlist l;\nrecord r;\n\nf.stdin;\n\no_text(\"Enter the blank line terminated story:\\n\");\n\nwhile (0 < f.b_line(b)) {\n l.append(b);\n}\n\nfor (, b in l) {\n integer p, q;\n text s, t;\n\n while ((p = b.place('<')) ^ -1) {\n q = b.probe(p, '>');\n if (q ^ -1) {\n s = bq_string(b, p + 1, q - 1);\n b.erase(p, q);\n if (!r.key(s)) {\n o_(\"Replacement for `\", s, \"':\\n\");\n f.line(t);\n r.put(s, t);\n }\n b.paste(p, r[s]);\n }\n }\n}\n\nl.ucall(o_, 0, \"\\n\");\n","language":"Aime"},{"code":"# Mad Libs style story generation #\n\n# gets the story template from the file f. The template terminates with #\n# a blank line #\n# The user is then promoted for the replacements for the <word> markers #\n# and the story is printed with the substitutions made #\nPROC story = ( REF FILE f )VOID:\nBEGIN\n\n # a linked list of strings, used to hold the story template #\n MODE STRINGLIST = STRUCT( STRING text, REF STRINGLIST next );\n\n # a linked list of pairs of strings, used to hold the replacements #\n MODE REPLACEMENTLIST = STRUCT( STRING word\n , STRING replacement\n , REF REPLACEMENTLIST next\n );\n\n # NIL reference for marking the end of a STRINGLIST #\n REF STRINGLIST nil stringlist = NIL;\n\n # NIL reference for marking the end of a REPLACEMENTLIST #\n REF REPLACEMENTLIST nil replacementlist = NIL;\n\n\n # returns \"text\" with trailing spaces removed #\n OP RTRIM = ( STRING text )STRING:\n BEGIN\n INT trim pos := UPB text;\n FOR text pos FROM UPB text BY -1 TO LWB text WHILE text[ text pos ] = \" \"\n DO\n trim pos := text pos - 1\n OD;\n\n text[ LWB text : trim pos ]\n END; # RTRIM #\n\n # looks for word in the dictionary. If it is found, replacement is #\n # set to its replacement and TRUE is returned. If word not present, #\n # FALSE is returned - uses recursion #\n PROC find replacement = ( STRING word\n , REF STRING replacement\n , REF REPLACEMENTLIST dictionary\n )BOOL:\n IF dictionary IS nil replacementlist\n THEN\n FALSE\n ELIF word OF dictionary = word\n THEN\n replacement := replacement OF dictionary;\n TRUE\n ELSE\n find replacement( word, replacement, next OF dictionary )\n FI; # find replacement #\n\n\n # read the story template #\n\n # the result has a dummy element so \"next OF next\" is always valid #\n REF STRINGLIST story := HEAP STRINGLIST := ( \"dummy\", nil stringlist );\n REF REF STRINGLIST next := story;\n\n # read the story template, terminates with a blank line #\n\n WHILE\n STRING text;\n get( f, ( text, newline ) );\n text := RTRIM text;\n text /= \"\"\n DO\n # add the line to the end of the list #\n next := ( next OF next ) := HEAP STRINGLIST := ( text, nil stringlist )\n OD;\n\n # find the <word> markers in the story and replace them with the #\n # user's chosen text - we ignore the dummy element at the start #\n\n REF REPLACEMENTLIST dictionary := nil replacementlist;\n REF STRINGLIST line := story;\n\n WHILE line := next OF line;\n line ISNT nil stringlist\n DO\n # have a line of text - replace all the <word> markers in it #\n STRING word, replacement;\n INT start pos, end pos;\n WHILE char in string( \"<\", start pos, text OF line )\n AND char in string( \">\", end pos, text OF line )\n DO\n # have a marker, get it from the line #\n word := ( text OF line )[ start pos : end pos ];\n # get its replacement #\n IF NOT find replacement( word, replacement, dictionary )\n THEN\n # we don't already have a replacement for word #\n # get one from the user and add it to the dictionary #\n print( ( \"What should replace \", word, \"? \" ) );\n read( ( replacement, newline ) );\n dictionary := HEAP REPLACEMENTLIST := ( word, replacement, dictionary )\n FI;\n # replace <word> with the replacement #\n text OF line := ( text OF line )[ : start pos - 1 ]\n + replacement\n + ( text OF line )[ end pos + 1 : ]\n OD\n OD;\n\n # print the story, ignoring the dummy element at the start #\n\n line := story;\n\n WHILE line := next OF line;\n line ISNT nil stringlist\n DO\n print( ( text OF line, newline ) )\n OD\n\nEND; # story #\n\nmain:(\n\n # we read the template from stand in (the keyboard unless it's been #\n # redirected) we could prompt the user for a template file name, #\n # open it and read that instead... #\n print( ( \"Please Enter the story template terminated by a blank line\", newline ) );\n story( stand in )\n\n)\n","language":"ALGOL-68"},{"code":"set theNoun to the text returned of (display dialog \"What is your noun?\" default answer \"\")\n\nset thePerson to the text returned of (display dialog \"What is the person's name?\" default answer \"\")\n\nset theGender to the text returned of (display dialog \"He or she? Please capitalize.\" default answer \"\")\n\ndisplay dialog thePerson & \" went for a walk in the park. \" & theGender & \" found a \" & theNoun & \". \" & thePerson & \" decided to take it home.\"\n","language":"AppleScript"},{"code":" 100 DIM L$(100),W$(50),T$(50)\n 110 LET M$ = CHR$ (13)\n 120 FOR L = 1 TO 1E9\n 130 READ L$(L)\n 140 IF LEN (L$(L)) THEN NEXT L\n 150 FOR I = 1 TO L\n 160 LET M = 0\n 170 LET N$(0) = \"\"\n 180 FOR J = 1 TO LEN (L$(I))\n 190 LET C$ = MID$ (L$(I),J,1)\n 200 IF C$ = \"<\" AND NOT M THEN M = 1:C$ = \"\":N$(M) = \"\"\n 210 IF C$ = \">\" AND M THEN GOSUB 300:M = 0:C$ = W$(Z)\n 220 LET N$(M) = N$(M) + C$\n 230 NEXT J\n 240 LET L$(I) = N$(0)\n 250 NEXT I\n 260 FOR I = 1 TO L\n 270 PRINT M$L$(I);\n 280 NEXT\n 290 END\n 300 FOR Z = 0 TO T\n 310 IF T$(Z) = N$(M) THEN RETURN\n 320 NEXT Z\n 330 LET T = Z\n 340 LET T$(Z) = N$(M)\n 350 PRINT M$\"ENTER A \"T$(Z);\n 360 INPUT \"? \";W$(Z)\n 370 RETURN\n 380 DATA \"<NAME> WENT FOR A WALK IN THE PARK. <HE OR SHE>\"\n 390 DATA \"FOUND A <NOUN>. <NAME> DECIDED TO TAKE IT HOME.\"\n 990 DATA\n","language":"Applesoft-BASIC"},{"code":"story: strip input \"Enter a story: \"\nvars: unique map match story {/\\|([^\\|]+)\\|/} 'v -> replace v \"|\" \"\"\n\ni: 0\nwhile [i < size vars].import [\n let vars\\[i] input ~\"Enter value for <|vars\\[i]|>: \"\n i: i + 1\n]\n\nprint ~story\n","language":"Arturo"},{"code":"FileSelectFile, filename, , %A_ScriptDir%, Select a Mad Libs template, *.txt\nIf ErrorLevel\n\tExitApp ; the user canceled the file selection\nFileRead, contents, %filename%\npos := match := 0\nWhile pos := RegExMatch(contents, \"<[^>]+>\", match, pos+strLen(match))\n{\n\tInputBox, repl, Mad Libs, Enter a replacement for %match%:\n\tIf ErrorLevel ; cancelled inputbox\n\t\tExitApp\n\tStringReplace, contents, contents, %match%, %repl%, All\n}\nMsgBox % contents\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f MAD_LIBS.AWK\nBEGIN {\n print(\"enter story:\")\n}\n{ story_arr[++nr] = $0\n if ($0 ~ /^ *$/) {\n exit\n }\n while ($0 ~ /[<>]/) {\n L = index($0,\"<\")\n R = index($0,\">\")\n changes_arr[substr($0,L,R-L+1)] = \"\"\n sub(/</,\"\",$0)\n sub(/>/,\"\",$0)\n }\n}\nEND {\n PROCINFO[\"sorted_in\"] = \"@ind_str_asc\"\n print(\"enter values for:\")\n for (i in changes_arr) { # prompt for replacement values\n printf(\"%s \",i)\n getline rec\n sub(/ +$/,\"\",rec)\n changes_arr[i] = rec\n }\n printf(\"\\nrevised story:\\n\")\n for (i=1; i<=nr; i++) { # print the story\n for (j in changes_arr) {\n gsub(j,changes_arr[j],story_arr[i])\n }\n printf(\"%s\\n\",story_arr[i])\n }\n exit(0)\n}\n","language":"AWK"},{"code":"cadena = \"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\"\nk = instr(cadena, \"<\")\n\nprint \"La historia: \" : print cadena : print\nwhile k\n\treemplaza = mid(cadena, k, instr(cadena, \">\") - k + 1)\n\tprint \"What should replace \"; reemplaza; : input \" \", con\n\twhile k\n\t\tcadena = left(cadena, k-1) + con + mid(cadena, k + length(reemplaza), length(cadena))\n\t\tk = instr(cadena, reemplaza, k)\n\tend while\n\tk = instr(cadena, \"<\", length(reemplaza))\nend while\nprint : print \"La historia final: \" : print cadena\nend\n","language":"BASIC256"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#define err(...) fprintf(stderr, ## __VA_ARGS__), exit(1)\n\n/* We create a dynamic string with a few functions which make modifying\n * the string and growing a bit easier */\ntypedef struct {\n char *data;\n size_t alloc;\n size_t length;\n} dstr;\n\ninline int dstr_space(dstr *s, size_t grow_amount)\n{\n return s->length + grow_amount < s->alloc;\n}\n\nint dstr_grow(dstr *s)\n{\n s->alloc *= 2;\n char *attempt = realloc(s->data, s->alloc);\n\n if (!attempt) return 0;\n else s->data = attempt;\n\n return 1;\n}\n\ndstr* dstr_init(const size_t to_allocate)\n{\n dstr *s = malloc(sizeof(dstr));\n if (!s) goto failure;\n\n s->length = 0;\n s->alloc = to_allocate;\n s->data = malloc(s->alloc);\n\n if (!s->data) goto failure;\n\n return s;\n\nfailure:\n if (s->data) free(s->data);\n if (s) free(s);\n return NULL;\n}\n\nvoid dstr_delete(dstr *s)\n{\n if (s->data) free(s->data);\n if (s) free(s);\n}\n\ndstr* readinput(FILE *fd)\n{\n static const size_t buffer_size = 4096;\n char buffer[buffer_size];\n\n dstr *s = dstr_init(buffer_size);\n if (!s) goto failure;\n\n while (fgets(buffer, buffer_size, fd)) {\n while (!dstr_space(s, buffer_size))\n if (!dstr_grow(s)) goto failure;\n\n strncpy(s->data + s->length, buffer, buffer_size);\n s->length += strlen(buffer);\n }\n\n return s;\n\nfailure:\n dstr_delete(s);\n return NULL;\n}\n\nvoid dstr_replace_all(dstr *story, const char *replace, const char *insert)\n{\n const size_t replace_l = strlen(replace);\n const size_t insert_l = strlen(insert);\n char *start = story->data;\n\n while ((start = strstr(start, replace))) {\n if (!dstr_space(story, insert_l - replace_l))\n if (!dstr_grow(story)) err(\"Failed to allocate memory\");\n\n if (insert_l != replace_l) {\n memmove(start + insert_l, start + replace_l, story->length -\n (start + replace_l - story->data));\n\n /* Remember to null terminate the data so we can utilize it\n * as we normally would */\n story->length += insert_l - replace_l;\n story->data[story->length] = 0;\n }\n\n memmove(start, insert, insert_l);\n }\n}\n\nvoid madlibs(dstr *story)\n{\n static const size_t buffer_size = 128;\n char insert[buffer_size];\n char replace[buffer_size];\n\n char *start,\n *end = story->data;\n\n while (start = strchr(end, '<')) {\n if (!(end = strchr(start, '>'))) err(\"Malformed brackets in input\");\n\n /* One extra for current char and another for nul byte */\n strncpy(replace, start, end - start + 1);\n replace[end - start + 1] = '\\0';\n\n printf(\"Enter value for field %s: \", replace);\n\n fgets(insert, buffer_size, stdin);\n const size_t il = strlen(insert) - 1;\n if (insert[il] == '\\n')\n insert[il] = '\\0';\n\n dstr_replace_all(story, replace, insert);\n }\n printf(\"\\n\");\n}\n\nint main(int argc, char *argv[])\n{\n if (argc < 2) return 0;\n\n FILE *fd = fopen(argv[1], \"r\");\n if (!fd) err(\"Could not open file: '%s\\n\", argv[1]);\n\n dstr *story = readinput(fd); fclose(fd);\n if (!story) err(\"Failed to allocate memory\");\n\n madlibs(story);\n printf(\"%s\\n\", story->data);\n dstr_delete(story);\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <string>\nusing namespace std;\n\nint main()\n{\n string story, input;\n\n //Loop\n while(true)\n {\n //Get a line from the user\n getline(cin, input);\n\n //If it's blank, break this loop\n if(input == \"\\r\")\n break;\n\n //Add the line to the story\n story += input;\n }\n\n //While there is a '<' in the story\n int begin;\n while((begin = story.find(\"<\")) != string::npos)\n {\n //Get the category from between '<' and '>'\n int end = story.find(\">\");\n string cat = story.substr(begin + 1, end - begin - 1);\n\n //Ask the user for a replacement\n cout << \"Give me a \" << cat << \": \";\n cin >> input;\n\n //While there's a matching category\n //in the story\n while((begin = story.find(\"<\" + cat + \">\")) != string::npos)\n {\n //Replace it with the user's replacement\n story.replace(begin, cat.length()+2, input);\n }\n }\n\n //Output the final story\n cout << endl << story;\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Linq;\nusing System.Text;\nusing System.Text.RegularExpressions;\n\nnamespace MadLibs_RosettaCode\n{\n\tclass Program\n\t{\n\t\tstatic void Main(string[] args)\n\t\t{\n\t\t\tstring madLibs =\n@\"Write a program to create a Mad Libs like story.\nThe program should read an arbitrary multiline story from input.\nThe story will be terminated with a blank line.\nThen, find each replacement to be made within the story,\nask the user for a word to replace it with, and make all the replacements.\nStop when there are none left and print the final story.\nThe input should be an arbitrary story in the form:\n<name> went for a walk in the park. <he or she>\nfound a <noun>. <name> decided to take it home.\nGiven this example, it should then ask for a name,\na he or she and a noun (<name> gets replaced both times with the same value).\";\n\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tRegex pattern = new Regex(@\"\\<(.*?)\\>\");\n\t\t\tstring storyLine;\n\t\t\tstring replacement;\n\n\t\t\tConsole.WriteLine(madLibs + Environment.NewLine + Environment.NewLine);\n\t\t\tConsole.WriteLine(\"Enter a story: \");\n\n\t\t\t// Continue to get input while empty line hasn't been entered.\n\t\t\tdo\n\t\t\t{\n\t\t\t\tstoryLine = Console.ReadLine();\n\t\t\t\tsb.Append(storyLine + Environment.NewLine);\n\t\t\t} while (!string.IsNullOrEmpty(storyLine) && !string.IsNullOrWhiteSpace(storyLine));\n\n\t\t\t// Retrieve only the unique regex matches from the user entered story.\n\t\t\tMatch nameMatch = pattern.Matches(sb.ToString()).OfType<Match>().Where(x => x.Value.Equals(\"<name>\")).Select(x => x.Value).Distinct() as Match;\n\t\t\tif(nameMatch != null)\n\t\t\t{\n\t\t\t\tdo\n\t\t\t\t{\n\t\t\t\t\tConsole.WriteLine(\"Enter value for: \" + nameMatch.Value);\n\t\t\t\t\treplacement = Console.ReadLine();\n\t\t\t\t} while (string.IsNullOrEmpty(replacement) || string.IsNullOrWhiteSpace(replacement));\n\t\t\t\tsb.Replace(nameMatch.Value, replacement);\n\t\t\t}\n\n\t\t\tforeach (Match match in pattern.Matches(sb.ToString()))\n\t\t\t{\n\t\t\t\treplacement = string.Empty;\n\t\t\t\t// Guarantee we get a non-whitespace value for the replacement\n\t\t\t\tdo\n\t\t\t\t{\n\t\t\t\t\tConsole.WriteLine(\"Enter value for: \" + match.Value);\n\t\t\t\t\treplacement = Console.ReadLine();\n\t\t\t\t} while (string.IsNullOrEmpty(replacement) || string.IsNullOrWhiteSpace(replacement));\n\n\t\t\t\tint location = sb.ToString().IndexOf(match.Value);\n\t\t\t\tsb.Remove(location, match.Value.Length).Insert(location, replacement);\n\t\t\t}\n\n\t\t\tConsole.WriteLine(Environment.NewLine + Environment.NewLine + \"--[ Here's your story! ]--\");\n\t\t\tConsole.WriteLine(sb.ToString());\n\t\t}\n\t}\n}\n","language":"C-sharp"},{"code":"(ns magic.rosetta\n (:require [clojure.string :as str]))\n\n(defn mad-libs\n \"Write a program to create a Mad Libs like story.\n The program should read an arbitrary multiline story from input.\n The story will be terminated with a blank line.\n Then, find each replacement to be made within the story,\n ask the user for a word to replace it with, and make all the replacements.\n Stop when there are none left and print the final story.\n The input should be an arbitrary story in the form:\n <name> went for a walk in the park. <he or she>\n found a <noun>. <name> decided to take it home.\n Given this example, it should then ask for a name,\n a he or she and a noun (<name> gets replaced both times with the same value). \"\n []\n (let\n [story (do\n (println \"Please enter story:\")\n (loop [story []]\n (let [line (read-line)]\n (if (empty? line)\n (str/join \"\\n\" story)\n (recur (conj story line))))))\n tokens (set (re-seq #\"<[^<>]+>\" story))\n story-completed (reduce\n (fn [s t]\n (str/replace s t (do\n (println (str \"Substitute \" t \":\"))\n (read-line))))\n story\n tokens)]\n (println (str\n \"Here is your story:\\n\"\n \"------------------------------------\\n\"\n story-completed))))\n; Sample run at REPL:\n;\n; user=> (magic.rosetta/mad-libs)\n; Please enter story:\n; One day <who> wake up at <where>.\n; <who> decided to <do something>.\n; While <who> <do something>, strange man\n; appears and gave <who> a <thing>.\n\n; Substitute <where>:\n; Sweden\n; Substitute <thing>:\n; Nobel prize\n; Substitute <who>:\n; Bob Dylan\n; Substitute <do something>:\n; walk\n; Here is your story:\n; ------------------------------------\n; One day Bob Dylan wake up at Sweden.\n; Bob Dylan decided to walk.\n; While Bob Dylan walk, strange man\n; appears and gave Bob Dylan a Nobel prize.\n","language":"Clojure"},{"code":"10 rem mad lib for rosetta code\n15 dim bf$(100),wd$(50),tg$(50):tb=49152\n20 print chr$(147);chr$(14);\"Mad Lib Processor\":print\n25 gosub 1000\n30 gosub 100:gosub 250:gosub 300:gosub 400\n40 print:print:print \"Again? \";:gosub 500:print k$\n45 if k$<>\"y\" then end\n50 goto 20\n100 tg=1:for i=1 to bp:n$=\"\":mo=0\n105 t$=bf$(i)\n110 for j=1 to len(t$)\n115 ch$=mid$(t$,j,1)\n120 if ch$=\"<\" then mo=1:goto 140\n125 if ch$=\">\" then mo=0:gosub 200:n$=n$+wd$:tg$=\"\":goto 140\n130 if mo=0 then n$=n$+ch$\n135 if mo=1 then tg$=tg$+ch$\n140 next j\n145 bf$(i)=n$\n150 next i\n155 return\n200 for z=1 to tg\n205 if tg$(z)=tg$ then wd$=wd$(z):return\n210 next z\n215 tg=tg+1:tg$(tg)=tg$\n220 print \"Enter a \";tg$(tg);:input wd$\n225 wd$(tg)=wd$\n230 return\n250 print chr$(147):print \"Processing...\":print\n255 m=tb:os=0:ns=0:for i=1 to bp-1\n260 t$=bf$(i)\n265 for c=1 to len(t$):ch$=mid$(t$,c,1)\n270 poke m,asc(ch$+chr$(0)):m=m+1:next c\n275 next i:rem poke m,32:m=m+1\n280 m=m-1:return\n300 rem insert cr for word wrap\n310 pt=tb:sz=0:ll=0\n320 if peek(pt)=32 then gosub 350:if(ll+sz>39) then poke pt,13:ll=-1:sz=0\n325 if peek(pt)=13 then ll=-1\n330 if pt<>m then pt=pt+1:ll=ll+1:goto 320\n340 return\n350 rem look ahead to next space\n355 nx=pt+1:sz=1\n360 if peek(nx)=32 or peek(nx)=13 then return\n365 nx=nx+1:sz=sz+1\n370 if nx=m then return\n375 goto 360\n400 rem output memory buffer\n401 ln=0:print chr$(147);\n410 for i=tb to m:c=peek(i)\n420 if c=13 then ln=ln+1\n425 print chr$(c);\n430 if ln=23 then ln=0:print:gosub 550\n440 next i\n450 return\n500 rem clear buffer, wait for a key\n501 get k$:if k$<>\"\" then 501\n505 get k$:if k$=\"\" then 505\n510 return\n550 rem pause prompt\n560 print\"[Pause]{CRSR-LEFT 7}\";\n565 gosub 500\n570 print\"{SPACE 7}{CRSR-LEFT 7}{CRSR-UP}\";\n575 return\n1000 rem load file\n1005 bp=1\n1010 print:input \"Enter name of file: \";fi$\n1020 open 7,8,7,\"0:\"+fi$+\",s,r\"\n1025 rem gosub 2000\n1030 rem if er<>0 then print:gosub 2100:return\n1035 get#7,a$\n1036 ifa$=chr$(13)thenbf$(bp)=t$+a$:print\" \";:t$=\"\":bp=bp+1:goto 1040\n1038 t$=t$+a$\n1040 if (st and 64)=0 then goto 1035\n1049 close 7:gosub 2000\n1050 if er=0 then printchr$(147):return\n1055 gosub 2100\n1060 if er<>0 then goto 1000\n1080 return\n2000 rem check disk error\n2001 open 15,8,15:input#15,er,en$,et$,es$:close15\n2010 return\n2100 rem print pretty error\n2101 ca$=left$(en$,1):ca$=chr$(asc(ca$)+128):en$=ca$+right$(en$,len(en$)-1)\n2105 print:print er;\"- \";en$;\" at .:\";et$;\" .:\";es$\n2110 print:print \"Press a key.\":gosub 500\n2115 return\n","language":"Commodore-BASIC"},{"code":"import std.stdio, std.regex, std.algorithm, std.string, std.array;\n\nvoid main() {\n writeln(\"Enter a story template, terminated by an empty line:\");\n string story;\n while (true) {\n auto line = stdin.readln().strip();\n if (line.empty) break;\n story ~= line ~ \"\\n\";\n }\n\n auto re = regex(\"<.+?>\", \"g\");\n auto fields = story.match(re).map!q{a.hit}().array().sort().uniq();\n foreach (field; fields) {\n writef(\"Enter a value for '%s': \", field[1 .. $ - 1]);\n story = story.replace(field, stdin.readln().strip());\n }\n\n writeln(\"\\nThe story becomes:\\n\", story);\n}\n","language":"D"},{"code":"-module(madlib).\n-compile(export_all).\n\nmain() ->\n main([]).\n\nmain([]) ->\n madlib(standard_io);\nmain([File]) ->\n {ok, F} = file:open(File,read),\n madlib(F).\n\nmadlib(Device) ->\n {Dict, Lines} = parse(Device),\n Substitutions = prompt(Dict),\n print(Substitutions, Lines).\n\nprompt(Dict) ->\n Keys = dict:fetch_keys(Dict),\n lists:foldl(fun (K,D) ->\n S = io:get_line(io_lib:format(\"Please name a ~s: \",[K])),\n dict:store(K, lists:reverse(tl(lists:reverse(S))), D)\n end, Dict, Keys).\n\nprint(Dict,Lines) ->\n lists:foreach(fun (Line) ->\n io:format(\"~s\",[substitute(Dict,Line)])\n end, Lines).\n\nsubstitute(Dict,Line) ->\n Keys = dict:fetch_keys(Dict),\n lists:foldl(fun (K,L) ->\n re:replace(L,K,dict:fetch(K,Dict),[global,{return,list}])\n end, Line, Keys).\n\nparse(Device) ->\n parse(Device, dict:new(),[]).\n\nparse(Device, Dict,Lines) ->\n case io:get_line(Device,\"\") of\n eof ->\n {Dict, lists:reverse(Lines)};\n \"\\n\" ->\n {Dict, lists:reverse(Lines)};\n Line ->\n parse(Device, parse_line(Dict, Line), [Line|Lines])\n end.\n\nparse_line(Dict, Line) ->\n {match,Matches} = re:run(Line,\"<.*?>\",[global,{capture,[0],list}]),\n lists:foldl(fun ([M],D) ->\n dict:store(M,\"\",D)\n end, Dict, Matches).\n","language":"Erlang"},{"code":"68> madlib:main(\"test.mad\").\nPlease name a <noun>: banana\nPlease name a <name>: Jack\nPlease name a <he or she>: She\nJack went for a walk in the park. She\nfound a banana. Jack decided to take it home.ok\n69>\n","language":"Erlang"},{"code":"USING: formatting io kernel make regexp sequences sets splitting ;\nIN: rosetta-code.mad-libs\n\n: get-mad-lib ( -- str )\n \"Enter a mad lib. A blank line signals end of input.\" print\n [\n [ \"> \" write flush readln dup , empty? f t ? ] loop\n ] { } make harvest \"\\n\" join ;\n\n: find-replacements ( str -- seq )\n R/ <[\\w\\s]+>/ all-matching-subseqs members ;\n\n: query ( str -- str )\n rest but-last \"Enter a(n) %s: \" printf flush readln ;\n\n: replacements ( str seq -- str )\n dup [ query ] map [ replace ] 2each ;\n\n: mad-libs ( -- )\n get-mad-lib dup find-replacements replacements nl print ;\n\nMAIN: mad-libs\n","language":"Factor"},{"code":" MODULE MADLIB\t!Messing with COMMON is less convenient.\n INTEGER MSG,KBD,INF\t\t!I/O unit numbers.\n DATA MSG,KBD,INF/6,5,10/\t\t!Output, input, some disc file.\n INTEGER LSTASH,NSTASH,MSTASH\t!Prepare a common text stash.\n PARAMETER (LSTASH = 246810, MSTASH = 6666)\t!LSTASH characters for MSTASH texts.\n CHARACTER*(LSTASH) STASH\t\t!The pool.\n INTEGER ISTASH(MSTASH + 1)\t!Fingers start positions, and thus end positions by extension.\n DATA NSTASH,ISTASH(1)/0,1/\t!Empty pool: no entries, first available character is at 1.\n INTEGER MANYLINES,MANYTESTS\t!I also want some lists of texts.\n PARAMETER (MANYLINES = 1234)\t!This is to hold the story.\n INTEGER NSTORY,STORY(MANYLINES)\t!Fingering texts in the stash.\n PARAMETER (MANYTESTS = 1234)\t!Likewise, some target/replacement texts.\n INTEGER NTESTS,TARGET(MANYTESTS),REPLACEMENT(MANYTESTS)\t!Thus.\n DATA NSTORY,NTESTS/0,0/\t\t!No story lines, and no tests.\n INTEGER STACKLIMIT\t\t!A recursion limit.\n PARAMETER (STACKLIMIT = 28)\t!This should suffice.\n\n CONTAINS\n SUBROUTINE CROAK(GASP)\t!A dying remark.\n CHARACTER*(*) GASP\t!The last words.\n WRITE (MSG,*) \"Oh dear.\"\t!Shock.\n WRITE (MSG,*) GASP\t\t!Aargh!\n STOP \"How sad.\"\t\t!Farewell, cruel world.\n END SUBROUTINE CROAK\t!Farewell...\n\n SUBROUTINE SHOWSTASH(BLAH,I)\t!One might be wondering.\n CHARACTER*(*) BLAH\t\t!An annotation.\n INTEGER I\t\t\t!The desired stashed text.\n WRITE (MSG,1) BLAH,I,STASH(ISTASH(I):ISTASH(I + 1) - 1)\t!Whee!\n 1 FORMAT (A,': Text(',I0,')=\"',A,'\"')\t!Hopefully, helpful.\n END SUBROUTINE SHOWSTASH\t!Ah, debugging.\n\n INTEGER FUNCTION EATTEXT(IN)\t!Add a text to STASH and finger it.\nCo-opts the as-yet unused space in STASH as its scratchpad.\n INTEGER IN\t!Input from this I/O unit number.\n INTEGER I,N,L\t!Fingers.\n I = ISTASH(NSTASH + 1)!First available position in STASH.\n N = LSTASH - I + 1\t!Number of characters yet unused.\n IF (N.LT.666) CALL CROAK(\"Insufficient STASH space remains!\")\n READ (IN,1,END = 66) L,STASH(I:I + MIN(L,N) - 1)\t!Calculated during the read.\n 1 FORMAT (Q,A)\t\t!Obviously, Q = character count incoming, A = accept all of them.\n L = I + MIN(L,N) - 1\t!The last character read.\n 10 IF (L.LT.I) GO TO 66\t!A blank line! Deemed end-of-file.\n IF (ICHAR(STASH(L:L)).LE.ICHAR(\" \")) THEN\t!A trailing space?\n L = L - 1\t\t!Yes. Pull back.\n GO TO 10\t\t!And try again.\n END IF\t\t!So much for trailing spaces.\n IF (NSTASH.GE.MSTASH) CALL CROAK(\"Too many texts!\")\n NSTASH = NSTASH + 1\t!Admit another text.\n ISTASH(NSTASH + 1) = L + 1\t!The start point of the following text.\n EATTEXT = NSTASH\t!STASH(ISTASH(n):ISTASH(n + 1) - 1) has text n.\n RETURN\t\t\t!All well.\n 66 EATTEXT = 0\t\t!Sez: \"No text\".\n END FUNCTION EATTEXT\t!Rather odd side effects.\n\n INTEGER FUNCTION ADDSTASH(TEXT)\t!Appends an arbitrary text to the pool of stashed texts.\n CHARACTER*(*) TEXT\t!The stuff.\n INTEGER I\t\t!A finger.\n IF (NSTASH.GE.MSTASH) CALL CROAK(\"The text pool is crowded!\")\t!Alas.\n I = ISTASH(NSTASH + 1)\t!First unused character.\n IF (I + LEN(TEXT).GT.LSTASH) CALL CROAK(\"Overtexted!\")\t!Alack.\n STASH(I:I + LEN(TEXT) - 1) = TEXT\t!Place.\n NSTASH = NSTASH + 1\t\t\t!Count in another entry.\n ISTASH(NSTASH + 1) = I + LEN(TEXT)\t!The new \"first available\" position.\n ADDSTASH = NSTASH\t!Pass a finger back to the caller.\n END FUNCTION ADDSTASH\t!Just an integer.\n\n INTEGER FUNCTION ANOTHER(TEXT)\t!Possibly add TEXT to the table of target texts.\nCollects TARGET REPLACEMENT pairs (increasing NTESTS) as directed by INSPECT.\n CHARACTER*(*) TEXT\t!The text of the target.\n INTEGER I,IT\t\t!Steppers.\n ANOTHER = 0\t\t!Possibly, the text is already in the table.\n DO I = 1,NTESTS\t!So, step through the known target texts.\n IT = TARGET(I)\t\t!Finger a target text.\n IF (TEXT.EQ.STASH(ISTASH(IT):ISTASH(IT + 1) - 1)) RETURN\t!Already have this one.\n END DO\t\t!Otherwise, try the next.\n IF (NTESTS.GE.MANYTESTS) CALL CROAK(\"Too many tests!\")\t!Oh dear.\n NTESTS = NTESTS + 1\t\t!Count in another.\n TARGET(NTESTS) = ADDSTASH(TEXT)!Stash its text and get a finger to it.\n ANOTHER = NTESTS\t\t!My caller will want to know which test.\n WRITE (MSG,1) TEXT\t\t!Now request the replacement text.\n 1 FORMAT (\"Enter your text for \",A,\": \",$)\t!Obviously, the $ indicates \"no new line\".\n REPLACEMENT(NTESTS) = EATTEXT(KBD)\t!Zero for \"no text\".\n END FUNCTION ANOTHER\t!Produces entries for TARGET and REPLACEMENT.\n\n SUBROUTINE INSPECT(X)\t!Examine text number X for the special <...> sequence.\nCalls for inspection of REPLACEMENT texts as well, should ANOTHER report a new entry.\n INTEGER X\t!Fingers the text in STASH via ISTASH(X).\n INTEGER MARK\t!Recalls where the < was found.\n INTEGER IT,NEW\t!Fingers to entries in STASH.\n INTEGER I\t!A stepper.\n INTEGER SP,STACK(STACKLIMIT)\t!Prepare for some recursion.\n SP = 1\t\t!Start with the starter.\n STACK(1) = X\t\t!Stack up.\n DO WHILE(SP.GT.0)\t!While texts are yet uninspected,\n IT = STACK(SP)\t\t!Finger one.\n SP = SP - 1\t\t\t!Working down the stack.\n MARK = 0\t\t\t!Uninitialised variables are bad.\n DO I = ISTASH(IT),ISTASH(IT + 1) - 1!Step through the stashed text.\n IF (STASH(I:I).EQ.\"<\") THEN\t!Is it the starter?\n MARK = I\t\t\t!Yes. Remember where it is.\n ELSE IF (STASH(I:I).EQ.\">\") THEN\t!The ender?\n IF (MARK.LE.0) CALL CROAK(\"A > with no preceeding <!\")\t!Bah.\n NEW = ANOTHER(STASH(MARK:I))\t!Consider the spanned text.\n IF (NEW.GT.0) THEN\t\t!If that became a new table entry,\n IF (SP.GE.STACKLIMIT) CALL CROAK(\"Stack overflow!\")\t!Its replacement is to be inspected.\n SP = SP + 1\t\t\t!But I'm still busy with the current text.\n STACK(SP) = REPLACEMENT(NEW)\t!So, stack it for later.\n END IF\t\t\t!So much for that <...> apparition.\n MARK = 0\t\t!Be ready to check afresh for the next.\n END IF\t\t!So much for that character.\n END DO\t\t!On to the next.\n END DO\t!So much for that stacked entry.\n END SUBROUTINE INSPECT\t!WRITESTORY will rescan the story lines.\n\n SUBROUTINE READSTORY(IN)!Read and stash the lines.\n INTEGER IN\t\t!Input from here.\n INTEGER LINE\t\t!A finger to the story line.\n 10 LINE = EATTEXT(IN)\t!So, grab a line.\n IF (LINE.GT.0) THEN\t!A live line?\n NSTORY = NSTORY + 1\t!Yes.Count it in.\n STORY(NSTORY) = LINE\t!Save it in the story list.\n CALL INSPECT(LINE)\t!Look for trouble as well.\n GO TO 10\t\t!And go for the next line.\n END IF\t\t\t!Oh for while (Line:=EatText(in)) > 0 do SaveAndInspect(Line);\n END SUBROUTINE READSTORY!Simple enough, anyway.\n\n SUBROUTINE WRITESTORY(WIDTH)\t!Applying the replacements, with replacement replacement too.\nCo-opts the as-yet unused space in STASH as its output scratchpad.\nCan't rely on changing the index and bounds of a DO-loop on the fly.\n INTEGER WIDTH\n INTEGER LINE,IT,I,J\t!Steppers.\n INTEGER L,L0,N\t\t!Fingers.\n INTEGER TAIL,MARK,LAST\t!Scan choppers.\n INTEGER SP,STACKI(STACKLIMIT),STACKL(STACKLIMIT)\t!Ah, recursion.\n L0 = ISTASH(NSTASH + 1)\t!The first available place in the stash.\n L = L0 - 1\t\t\t!Syncopation for my output finger.\n LL:DO LINE = 1,NSTORY\t\t!Step through the lines of the story.\n SP = 0\t\t\t!Start with the task in hand.\n IT = STORY(LINE)\t\t!Finger the stashed line.\n LAST = ISTASH(IT + 1) - 1\t!Find its last character in STASH.\n I = ISTASH(IT)\t\t!Find its first character in STASH.\n TAIL = I - 1\t\t!Syncopation. No text from this line yet.\n IF (STASH(I:I).LE.\" \") THEN\t!The line starts with a space?\n CALL BURP\t\t\t!Yes. Flush, so as to start a new paragraph.\n ELSE IF (LINE.GT.1) THEN\t!Otherwise, the line is a continuation.\n L = L + 1\t\t\t!So, squeeze in a space as a separator.\n STASH(L:L) = \" \"\t\t!Since its text follows on.\n END IF\t\t\t!Now for the content of the line.\n 666 II:DO WHILE(I.LE.LAST)\t\t!Step along its text.\n IF (STASH(I:I).EQ.\"<\") THEN\t!Trouble starter?\n MARK = I\t\t\t!Yes. Remember where.\n ELSE IF (STASH(I:I).EQ.\">\") THEN\t!The corresponding ender?\n CALL APPEND(TAIL + 1,MARK - 1)\t!Waiting text up to the mark.\n JJ:DO J = 1,NTESTS\t\t!Step through the target texts.\n IT = TARGET(J)\t\t!Finger one.\n IF (STASH(ISTASH(IT):ISTASH(IT + 1) - 1)\t!Its stashed text.\n 1 .EQ.STASH(MARK:I)) THEN\t\t!Matches the suspect text?\n IT = REPLACEMENT(J)\t\t!Yes! Finger the replacement text.\n IF (IT.GT.0) THEN\t!Null replacements can be ignored.\n IF (SP.GE.STACKLIMIT) CALL CROAK(\"StackOverflow!\")\t!Always diff. messages.\n SP = SP + 1\t\t!Interrupt the current scan.\n STACKI(SP) = I\t\t!Remember where we're up to,\n STACKL(SP) = LAST\t\t!And the end of the text.\n I = ISTASH(IT) - 1\t!One will be added shortly, at JJ+1.\n LAST = ISTASH(IT + 1) - 1\t!Preempt the scan-in-progress.\n END IF\t\t\t!To work along the replacement text.\n EXIT JJ\t\t!Found the target, so the search is finished.\n END IF\t\t!Otherwise,\n END DO JJ\t\t!Try the next target text.\n TAIL = I\t\t!Normal text resumes at TAIL + 1.\n END IF\t\t\t!Enough analysis of that character from the story line.\n I = I + 1\t\t\t!The next to consider.\n END DO II\t\t!Perhaps we've finished this text.\n IF (SP.GT.0) THEN\t!Yes! But, were we interrupted in a previous scan?\n CALL APPEND(TAIL + 1,LAST)!Yes! Roll the tail of the just-finished scan.\n TAIL = STACKI(SP)\t\t!The stacked value of I was fingering a >.\n LAST = STACKL(SP)\t\t!And this was the end of the text.\n SP = SP - 1\t\t!So we've recovered where the scan was.\n I = TAIL + 1\t\t!And this is the next to look at.\n GO TO 666\t\t\t!Proceed to do so.\n END IF\t\t!But if all is unstacked,\n CALL APPEND(TAIL + 1,LAST)\t!Don't forget the tail end.\n END DO LL\t\t\t!On to the next story line.\n CALL BURP\t\t!Any waiting text must be less than WIDTH.\n CONTAINS\t\t!Some assistants, defined after usage...\n SUBROUTINE APPEND(IST,LST)\t!Has access to L.\n INTEGER IST,LST\t\t!To copy STASH(IST:LST) to the scratchpad.\n INTEGER N\t\t\t!The number of characters to copy.\n N = LST - IST + 1\t\t!So find out.\n IF (N.LE.0) RETURN\t\t!Avoid relying on zero-length action.\n IF (L + N.GT.LSTASH) CALL CROAK(\"Out of stash!\")\t!Oh dear.\n STASH(L + 1:L + N) = STASH(IST:LST)\t!There they go.\n L = L + N\t\t\t!Advance my oputput finger.\n IF (L - L0 + 1.GE.WIDTH) CALL BURP\t!Enough to be going on with?\n END SUBROUTINE APPEND\t\t!Few invocations, if with tricky parameters.\n SUBROUTINE BURP\t\t!Flushes forth up to WIDTH characters.\n INTEGER N,W,L1\t\t!And slides any remnant back.\n N = L - L0 + 1\t\t!So, how many characters are waiting?\n IF (N.LE.WIDTH) THEN\t!Too many for one line of output?\n L1 = L\t\t\t!Nope. Roll the lot.\n ELSE\t\t\t!Otherwise, a partial flush.\n W = L0 + WIDTH - 1\t!Last character that can be fitted into WIDTH.\n DO L1 = W,L0,-1\t\t!Look for a good split.\n IF (STASH(L1:L1).LE.\" \") EXIT\t!Like, at a space.\n END DO\t\t\t!Keep winding back.\n IF (L1.LE.L0) L1 = W\t!No pleasing split found. Just roll a full width.\n END IF\t\t\t!Ready to roll.\n WRITE (MSG,\"(A)\") STASH(L0:L1)\t!Thus!\n IF (N.LE.WIDTH) THEN\t!If the whole text was written,\n L = L0 - 1\t\t!Then there is no text in the scratchpad.\n ELSE\t\t\t!If only L0:L1 were written of L0:L,\n W = L0 + L - L1 - 1\t!How far will the remaining text extend?\n STASH(L0:W) = STASH(L1 + 1:L)\t!Shift it.\n L = W\t\t\t!Finger the last used character position.\n END IF\t\t\t!One trim is enough, even if the scracchpad contains multiple widths' worth..\n END SUBROUTINE BURP\t\t!Since I don't want to flush the lot.\n END SUBROUTINE WRITESTORY\t!Just a sequence of lines.\n END MODULE MADLIB\t\t!Enough of that.\n\n PROGRAM MADLIBBER\t!See, for example, https://en.wikipedia.org/wiki/Mad_Libs\n USE MADLIB\n WRITE (MSG,1)\t!It's polite to explain.\n 10FORMAT (\"Reads a story in template form, containing special \",\n 1 \"entries such as <dog's name> amongst the text.\",/,\n 2 \"You will be invited to supply a replacement text for each \"\n 3 \"such entry, as encountered,\",/,\n 4 \"after which the story will be presented with your \",\n 5 \"substitutions made.\",//,\n 6 \"Here goes... Reading file Madlib.txt\",/)\n OPEN(INF,STATUS=\"OLD\",ACTION=\"READ\",FORM=\"FORMATTED\",\n 1 FILE = \"Madlib.txt\")\n CALL READSTORY(INF)\n CLOSE(INF)\n WRITE (MSG,*)\n WRITE (MSG,*) \" Righto!\"\n WRITE (MSG,*)\n CALL WRITESTORY(66)\n END\n","language":"Fortran"},{"code":"Dim As String con, cadena\ncadena = \"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\"\nDim As Integer k = Instr(cadena, \"<\")\n\nPrint \"La historia: \"\nPrint cadena & Chr(10)\nWhile k\n Dim As String reemplaza = Mid(cadena, k, Instr(cadena, \">\") - k + 1)\n Print \"What should replace \"; reemplaza; : Input con\n While k\n cadena = Left(cadena, k-1) & con & Mid(cadena, k + Len(reemplaza))\n k = Instr(k, cadena, reemplaza)\n Wend\n k = Instr(cadena, \"<\")\nWend\nPrint Chr(10) & \"La historia final: \"\nPrint cadena & Chr(10)\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"bufio\"\n \"fmt\"\n \"io/ioutil\"\n \"log\"\n \"os\"\n \"regexp\"\n \"strings\"\n)\n\nfunc main() {\n pat := regexp.MustCompile(\"<.+?>\")\n if len(os.Args) != 2 {\n fmt.Println(\"usage: madlib <story template file>\")\n return\n }\n b, err := ioutil.ReadFile(os.Args[1])\n if err != nil {\n log.Fatal(err)\n }\n tmpl := string(b)\n s := []string{} // patterns in order of appearance\n m := map[string]string{} // mapping from patterns to replacements\n for _, p := range pat.FindAllString(tmpl, -1) {\n if _, ok := m[p]; !ok {\n m[p] = \"\"\n s = append(s, p)\n }\n }\n fmt.Println(\"Enter replacements:\")\n br := bufio.NewReader(os.Stdin)\n for _, p := range s {\n for {\n fmt.Printf(\"%s: \", p[1:len(p)-1])\n r, isPre, err := br.ReadLine()\n if err != nil {\n log.Fatal(err)\n }\n if isPre {\n log.Fatal(\"you're not playing right. :P\")\n }\n s := strings.TrimSpace(string(r))\n if s == \"\" {\n fmt.Println(\" hmm?\")\n continue\n }\n m[p] = s\n break\n }\n }\n fmt.Println(\"\\nYour story:\\n\")\n fmt.Println(pat.ReplaceAllStringFunc(tmpl, func(p string) string {\n return m[p]\n }))\n}\n","language":"Go"},{"code":"import System.IO (stdout, hFlush)\n\nimport System.Environment (getArgs)\n\nimport qualified Data.Map as M (Map, lookup, insert, empty)\n\ngetLines :: IO [String]\ngetLines = reverse <$> getLines_ []\n where\n getLines_ xs = do\n line <- getLine\n case line of\n [] -> return xs\n _ -> getLines_ $ line : xs\n\nprompt :: String -> IO String\nprompt p = putStr p >> hFlush stdout >> getLine\n\ngetKeyword :: String -> Maybe String\ngetKeyword ('<':xs) = getKeyword_ xs []\n where\n getKeyword_ [] _ = Nothing\n getKeyword_ (x:'>':_) acc = Just $ '<' : reverse ('>' : x : acc)\n getKeyword_ (x:xs) acc = getKeyword_ xs $ x : acc\ngetKeyword _ = Nothing\n\nparseText :: String -> M.Map String String -> IO String\nparseText [] _ = return []\nparseText line@(l:lx) keywords =\n case getKeyword line of\n Nothing -> (l :) <$> parseText lx keywords\n Just keyword -> do\n let rest = drop (length keyword) line\n case M.lookup keyword keywords of\n Nothing -> do\n newword <- prompt $ \"Enter a word for \" ++ keyword ++ \": \"\n rest_ <- parseText rest $ M.insert keyword newword keywords\n return $ newword ++ rest_\n Just knownword -> do\n rest_ <- parseText rest keywords\n return $ knownword ++ rest_\n\nmain :: IO ()\nmain = do\n args <- getArgs\n nlines <-\n case args of\n [] -> unlines <$> getLines\n arg:_ -> readFile arg\n nlines_ <- parseText nlines M.empty\n putStrLn \"\"\n putStrLn nlines_\n","language":"Haskell"},{"code":"procedure main()\n ml := \"<name> went for a walk in the park. There <he or she> _\n found a <noun>. <name> decided to take it home.\" # sample\n MadLib(ml) # run it\nend\n\nlink strings\n\nprocedure MadLib(story)\n write(\"Please provide words for the following:\")\n V := []\n story ? while ( tab(upto('<')), put(V,tab(upto('>')+1)) )\n every writes(v := !set(V),\" : \") do\n story := replace(story,v,read())\n write(\"\\nYour MadLib follows:\\n\",story)\nend\n","language":"Icon"},{"code":"require 'general/misc/prompt regex'\n\nmadlib=:3 :0\n smoutput 'Please enter the story template'\n smoutput 'See http://rosettacode.org/wiki/Mad_Libs for details'\n t=.''\n while.#l=.prompt '' do. t=.t,l,LF end.\n repl=. ~.'<[^<>]*>' rxall t\n for_bef. repl do.\n aft=. prompt (}.}:;bef),': '\n t=.t rplc bef,<aft\n end.\n t\n)\n","language":"J"},{"code":" madlib''\nPlease enter the story template\nSee http://rosettacode.org/wiki/Mad_Libs for details\n<name> went for a walk in the park. <he or she>\nfound a <noun>. <name> decided to take it home.\n\nname: Jill\nhe or she: she\nnoun: rock\nJill went for a walk in the park. she\nfound a rock. Jill decided to take it home.\n","language":"J"},{"code":"import java.util.*;\n\npublic class MadLibs {\n\n public static void main(String[] args){\n Scanner input = new Scanner(System.in);\n\n String name, gender, noun;\n\n System.out.print(\"Enter a name: \");\n name = input.next();\n\n System.out.print(\"He or she: \");\n gender = input.next();\n\n System.out.print(\"Enter a noun: \");\n noun = input.next();\n\n System.out.println(\"\\f\" + name + \" went for a walk in the park. \" + gender + \"\\nfound a \" + noun + \". \" + name + \" decided to take it home.\");\n\n\n }\n}\n","language":"Java"},{"code":"function madlibs(template)\n println(\"The story template is:\\n\", template)\n fields = Set(getfield.(collect(eachmatch(r\"<[^>]+>\", template)), :match))\n print(\"\\nInput a comma-separated list of words to replace the following items:\",\n join(fields, \", \"), \"\\n -> \")\n values = split(readline(STDIN), \",\")\n for (m, v) in zip(fields, values)\n template = replace(template, m, v)\n end\n println(\"\\nThe story becomes:\\n\", template)\nend\n\nconst template = \"\"\"\n<name> went for a walk in the park. <he or she>\nfound a <noun>. <name> decided to take it home.\n\"\"\"\n\nmadlibs(template)\n","language":"Julia"},{"code":"// version 1.1.2\n\nfun main(args: Array<String>) {\n println(\"Please enter a multi-line story template terminated by a blank line\\n\")\n val sb = StringBuilder()\n while (true) {\n val line = readLine()!!\n if (line.isEmpty()) break\n sb.append(\"$line\\n\") // preserve line breaks\n }\n var story = sb.toString()\n // identify blanks\n val r = Regex(\"<.*?>\")\n val blanks = r.findAll(story).map { it.value }.distinct()\n println(\"Please enter your replacements for the following 'blanks' in the story:\")\n for (blank in blanks) {\n print(\"${blank.drop(1).dropLast(1)} : \")\n val repl = readLine()!!\n story = story.replace(blank, repl)\n }\n println(\"\\n$story\")\n}\n","language":"Kotlin"},{"code":"temp$=\"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\"\nk = instr(temp$,\"<\")\nwhile k\n replace$ = mid$(temp$,k,instr(temp$,\">\")-k + 1)\n print \"Replace:\";replace$;\" with:\"; :input with$\n while k\n temp$ = left$(temp$,k-1) + with$ + mid$(temp$,k + len(replace$))\n k = instr(temp$,replace$,k)\n wend\nk = instr(temp$,\"<\")\nwend\nprint temp$\nwait\n","language":"Liberty-BASIC"},{"code":"print(\"Enter a multi-line story (finish with blank line):\")\ndict, story, line = {}, \"\", io.read()\nwhile #line>0 do story=story..line..\"\\n\" line=io.read() end\nstory = story:gsub(\"(%<.-%>)\", function(what)\n if dict[what] then return dict[what] end\n io.write(\"Please enter a \" .. what .. \": \")\n dict[what] = io.read()\n return dict[what]\n end)\nprint(\"\\n\"..story)\n","language":"Lua"},{"code":"text = Import[\n InputString[\"Enter the filename of the story template:\"]];\nanswers =\n AssociationMap[\n InputString[\n \"Enter a\" <>\n If[StringMatchQ[#,\n \"<\" ~~ Alternatives @@ Characters[\"aeiou\"] ~~ ___], \"n\", \"\"] <>\n \" \" <> StringTrim[#, \"<\" | \">\"] <> \":\"] &,\n Union[StringCases[text, RegularExpression[\"<[^>]+>\"]]]];\nPrint[StringReplace[text, Normal[answers]]];\n","language":"Mathematica"},{"code":"def madlib(template)\n // loop through and find/remove all of the replacements\n replacements = {}\n ind = 0\n while ind < len(template)\n // check if we have found a replacement to perform\n if template[ind] = \"<\"\n // get the name of the replacement and add it to the list\n // if we haven't already encountered it\n ind += 1\n replace_name = \"\"\n while template[ind] != \">\"\n replace_name += template[ind]\n ind += 1\n end while\n\n if not replace_name in replacements\n replacements.append(replace_name)\n end if\n ind += 1\n else\n ind += 1\n end if\n end while\n\n // prompt the user for replacement values\n replacement_values = {}\n for phrase in replacements\n replacement_values.append(input(\"enter \" + phrase + \": \"))\n end for\n println\n\n // make replacements and output the story\n ind = 0\n while ind < len(template)\n // check if we have found a replacement to perform\n if template[ind] = \"<\"\n // get the name of the replacement\n ind += 1\n replace_name = \"\"\n while template[ind] != \">\"\n replace_name += template[ind]\n ind += 1\n end while\n\n // output the replacement\n print replacement_values[replacements[replace_name]]\n ind += 1\n else\n print template[ind]\n ind += 1\n end if\n end while\nend madlib\n\nmadlib(\"<name> went for a walk in the park. <he or she> \" + \\\n \"found a <noun>. <name> decided to take it home.\")\n","language":"Nanoquery"},{"code":"import rdstdin, re, algorithm, sequtils, strutils\n\n#let templ = readLineFromStdin \"Enter your story: \"\nconst templ = \"\"\"<name> went for a walk in the park. <he or she>\nfound a <noun>. <name> decided to take it home.\"\"\"\n\necho \"The story template is:\\n\", templ\nvar fields = templ.findAll re\"<[^>]+>\"\nfields.sort(cmp)\nfields = deduplicate fields\nlet values = readLineFromStdin(\"\\nInput a comma-separated list of words to replace the following items\\n \" & fields.join(\",\") & \": \").split(\",\")\n\nvar story = templ\nfor f,v in zip(fields, values).items:\n story = story.replace(f, v)\necho \"\\nThe story becomes:\\n\\n\", story\n","language":"Nim"},{"code":": madlibs\n| story i word |\n\n \"\" while(System.Console askln dup notEmpty) [ + ] drop ->story\n\n while(story indexOf('<') dup ->i notNull) [\n story extract(i, story indexOfFrom('>', i)) ->word\n story replaceAll(word, \"Word for\" . word . System.Console askln) ->story\n ]\t\n\n \"Your story :\" . story println ;\n","language":"Oforth"},{"code":"Program Madlib; Uses DOS, crt; {See, for example, https://en.wikipedia.org/wiki/Mad_Libs}\n{Reads the lines of a story but which also contain <xxx> sequences. For each value of xxx,\n found as the lines of the story are read, a request is made for a replacement text.\n The story is then written out with the corresponding replacements made.}\n{Concocted by R.N.McLean (whom God preserve), Victoria university, NZ.}\n Procedure Croak(gasp: string); {A dying message.}\n Begin\n Writeln(' Eurghfff...');\n Writeln(Gasp);\n HALT;\n End;\n var inf: text; {Drivelstuff.}\n const StoryLimit = 66;TableLimit = 65;\t\t{Big enough.}\n var Story: array[1..StoryLimit] of string;\t{Otherwise, use a temporary disc file.}\n var Target,Replacement: array[1..TableLimit] of string;\n var StoryLines,TableCount: integer;\t\t{Usage.}\n\n Function Reading(var inf: text;var Aline: string): boolean;\n Begin\n Aline:='';\n Reading:=true;\n if eoln(inf) then Reading:=false\t{Agh! Why can't the read statement return true/false?}\n else ReadLn(inf,Aline);\n if Aline = '' then Reading:=false;\t{Specified that a blank line ends the story.}\n End;\n\n Procedure Inspect(text: string); Forward;{I'd rather have multi-pass compilation than deal with this.}\n\n Procedure Table(it: string);\t{Check it as a target, and obtain its replacement.}\n var i: integer;\t{A stepper.}\n Begin\n for i:=1 to TableCount do if it = Target[i] then exit;\t{Already in the table?}\n if TableCount >= TableLimit then Croak('Too many table entries!');\t{No. Room for another?}\n inc(TableCount);\t\t\t\t{Yes.}\n Target[TableCount]:=it;\t\t\t{Include the < and > to preclude partial matches.}\n write('Enter your text for ',it,': ');\t{Pretty please?}\n readln(Replacement[TableCount]);\t\t{Thus.}\n Inspect(Replacement[TableCount]);\t\t{Enable full utilisation.}\n End; {of Table.}\n\n var InDeep: integer;\t{Counts inspection recursion.}\n Procedure Inspect(text: string);\t\t{Look for <...> in text.}\n var i: integer;\t{A stepper.}\n var mark: integer;\t{Fingers the latest < in Aline.}\n Begin\n inc(InDeep);\t\t{Supply an opportunity, and fear the possibilities.}\n if InDeep > 28 then Croak('Excessive recursion! Inspecting ' + text);\n for i:=1 to Length(text) do\t{Now scan the line for trouble.}\n if text[i] = '<' then mark:=i\t{Trouble starts here? Just mark its place.}\n else if text[i] = '>' then\t{Trouble ends here?}\n Table(copy(text,mark,i - mark + 1));\t{Deal with it.}\n dec(InDeep);\t\t{I'm done.}\n End; {of Inspect.}\n\n Procedure Swallow(Aline: string);\t{Add a line to the story, and inspect it for <...>.}\n Begin\n if StoryLines >= StoryLimit then Croak('Too many lines in the story!');\t{Suspicion forever.}\n inc(StoryLines);\t\t{Otherwise, this is safe.}\n Story[StoryLines]:=Aline;\t{So save another line.}\n Inspect(Aline);\t\t{Look for any <...> inclusions.}\n End; {of Swallow.}\n\n var Rolling: integer;\t\t{Counts rolling rolls.}\n Procedure Roll(bumf: string);\t{Write a line, with amendments.}\n var last,mark: integer;\t{Fingers for the scan.}\n var hit: string;\t\t{Copied once.}\n var i,it: integer;\t\t{Steppers.}\n label hic;\t{Oh dear.}\n Begin\n inc(Rolling);\t{Here I go.}\n if Rolling > 28 then Croak('Excessive recursion! Rolling ' + bumf);\t{Self-expansion is out.}\n last:=0;\t\t\t{Where the previous text ended.}\n for i:=1 to Length(bumf) do\t{Scan the text.}\n if bumf[i] = '<' then mark:=i\t{Remember where a <...> starts.}\n else if bumf[i] = '>' then\t\t{So that when the stopper is found,}\n begin\t\t\t\t{It can be recognised.}\n Write(copy(bumf,last + 1,mark - last - 1));\t{Text up to the <.}\n hit:=copy(bumf,mark,i - mark + 1);\t{Grab this once.}\n for it:=1 to TableCount do\t{Search my table.}\n if Target[it] = hit then\t{A match?}\n begin\t\t\t\t{Yes!}\n Roll(Replacement[it]);\t{Write this instead.}\n goto hic;\t\t\t{There is no \"exit loop\" style statement.}\n end;\t\t\t\t{\"Exit\" exits the procedure or function.}\n hic:last:=i;\t\t{Advance the trailing finger.}\n end;\t{On to the next character.}\n Write(copy(bumf,last + 1,Length(bumf) - last));\t{Text after the last >, possibly null.}\n dec(Rolling);\t\t\t{I'm done.}\n if Rolling <= 0 then WriteLn;\t{And if this is the first level, add a end-of-line.}\n End;\t{of Roll.}\n\n var inname: string;\t{For a file name.}\n var Aline: string;\t{A scratchpad.}\n var i: integer;\t{A stepper.}\n BEGIN\n InDeep:=0;\t\t{No inspections yet.}\n Rolling:=0;\t\t{No output.}\n inname:=ParamStr(1);\t{Perhaps the file name is specified as a run-time parameter.}\n if inname = '' then inname:='Madlib.txt';\t{If not, this will do.}\n Assign(inf,inname); Reset(inf);\t\t{Open the input file.}\n StoryLines:=0; TableCount:=0;\t\t\t{Prepare the counters.}\n while reading(inf,Aline) do Swallow(Aline);\t{Read and inspect the story.}\n close(inf);\t\t\t\t\t{Finished with input.}\n for i:=1 to StoryLines do Roll(Story[i]);\t{Write the amended story.}\n END.\n","language":"Pascal"},{"code":"#!/usr/bin/perl\nuse warnings;\nuse strict;\n\nmy $template = shift;\nopen my $IN, '<', $template or die $!;\nmy $story = do { local $/ ; <$IN> };\n\nmy %blanks;\nundef $blanks{$_} for $story =~ m/<(.*?)>/g;\n\nfor my $blank (sort keys %blanks) {\n print \"$blank: \";\n chomp (my $replacement = <>);\n $blanks{$blank} = $replacement;\n}\n\n$story =~ s/<(.*?)>/$blanks{$1}/g;\nprint $story;\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- file i/o, prompt_string</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">mlfile</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- eg story.txt</span>\n <span style=\"color: #000000;\">mltxt</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;\">mlfile</span><span style=\"color: #0000FF;\">)?</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">read_lines</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">mlfile</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">):</span><span style=\"color: #008000;\">\"\"\"\n <name> went for a walk in the park. <he or she>\n found a <noun>. <name> decided to take it home.\n \"\"\"</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">strings</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span> <span style=\"color: #000000;\">replacements</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">startpos</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">endpos</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</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;\">startpos</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;\">mltxt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">endpos</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">startpos</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: #000000;\">endpos</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;\">mltxt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">startpos</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">endpos</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;\">\"missing >\"</span> <span style=\"color: #7060A8;\">abort</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: #004080;\">string</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">mltxt</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">startpos</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">endpos</span><span style=\"color: #0000FF;\">]</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;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">strings</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">strings</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">strings</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">replacements</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">replacements</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">prompt_string</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Enter replacement for %s:\"</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;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</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;\">substitute_all</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">mltxt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">strings</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">replacements</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: #004080;\">string</span> <span style=\"color: #000000;\">mltxt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n <name> went for a walk in the park. <he or she>\n found a <noun>. <name> decided to take it home.\n \"\"\"</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">strings</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"<name>\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"<he or she>\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"<noun>\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000000;\">replacements</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"Pete\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"He\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Rosetta Code Task\"</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">startpos</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">endpos</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</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;\">startpos</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;\">mltxt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">endpos</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">startpos</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: #000000;\">endpos</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;\">mltxt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">startpos</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">endpos</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"missing >\"</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: #000000;\">mltxt</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">startpos</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">endpos</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">strings</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</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;\">substitute_all</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">mltxt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">strings</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">replacements</span><span style=\"color: #0000FF;\">))</span>\n<!--\n","language":"Phix"},{"code":"\"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\"\ntrue\nwhile\n \"<\" find dup var ini\n if\n \">\" find ini - 1 + ini swap slice var replace\n \"Replace: \" replace \" with: \" chain chain input var with nl\n true\n while\n replace with subst\n replace find\n endwhile\n true\n else\n false\n endif\nendwhile\nprint\n","language":"Phixmonti"},{"code":"import util.\n\ngo =>\n Story = read_story(),\n println(\"Fill in the proper values:\"),\n nl,\n Map = get_info(get_tags(Story)) ,\n println(\"\\nHere is the story:\\n\"),\n println(replace_tags(Story,Map)),\n nl.\n\nread_story() = Story =>\n println(\"Write the story template with <tag> for the tags and finish with an empty line.\"),\n nl,\n Story1 = read_line(),\n while (Line = read_line(), Line != \"\")\n Story1 := Story1 ++ \" \" ++ Line\n end,\n Story = Story1.\n\n%\n% Get the tags between <...>.\n%\nget_tags(S) = Tags =>\n Len = S.length,\n StartPos = [P: {C,P} in zip(S,1..Len), C = '<'],\n EndPos = [P: {C,P} in zip(S,1..Len), C = '>'],\n Tags = [slice(S,Start,End) : {Start,End} in zip(StartPos,EndPos)].remove_dups().\n\n%\n% Get the tag info from user and return a map\n%\nget_info(Tags) = Map =>\n Map = new_map(),\n foreach(Tag in Tags)\n printf(\"%w: \", Tag),\n Map.put(Tag,readln())\n end.\n\n% Replace all the <tags> with user values.\nreplace_tags(S,Map) = S =>\n foreach(Tag=Value in Map)\n S := replace_string(T,Tag,Value)\n end.\n\n% Picat's replace/3 does not handle substrings well,\n% so we roll our own...\nreplace_string(List,Old,New) = Res =>\n Res = copy_term(List),\n while (find(Res,Old,_,_))\n once(append(Before,Old,After,Res)),\n Res := Before ++ New ++ After\n end.\n","language":"Picat"},{"code":"(de madlib (Template)\n (setq Template (split (chop Template) \"<\" \">\"))\n (let (Reps () Text ())\n (while Template\n (push 'Text (pop 'Template))\n (let? Rep (mapcar pack (split (pop 'Template) \":\"))\n (if (assoc (car Rep) Reps)\n (push 'Text (cdr @))\n (until (and\n (prin \"Gimme a(n) \" (or (cadr Rep) (car Rep)) \": \")\n (clip (in NIL (line)))\n (push 'Text @)\n (push 'Reps (cons (car Rep) @)) )\n (prinl \"Huh? I got nothing.\") ) ) ) )\n (prinl (need 30 '-))\n (prinl (flip Text)) ) )\n","language":"PicoLisp"},{"code":"#!/usr/bin/pike\n\nStdio.Readline readln = Stdio.Readline();\n\nvoid print_help()\n{\n write(#\"Write a Story.\n\nNames or objects in the story can be made variable by\nreferencing them as <person> <object>, etc.\nEnd the story with an empty line.\n\nType show to read the story. You will be asked to fill the variables,\nand the the story will be shown.\n\nType help to see this message again.\nType exit to quit.\n\n\");\n}\n\nvoid add_line(string input)\n{\n array variables = parse_for_variables(input);\n write(\"Found variables: %{\\\"%s\\\" %}\\n\", variables);\n story += input+\"\\n\";\n}\n\narray parse_for_variables(string input)\n{\n array vars = Array.flatten(array_sscanf(input, \"%*[^<>]%{<%[^<>]>%*[^<>]%}%*[^<>]\"));\n return Array.uniq(vars);\n}\n\nmapping fill_variables(string story)\n{\n array vars = parse_for_variables(story);\n mapping variables = ([]);\n foreach(vars;; string name)\n {\n string value = readln->read(sprintf(\"Please name a%s %s: \", (<'a','e','i','o','u'>)[name[1]]?\"\":\"n\", name));\n if (value != \"\")\n variables[\"<\"+name+\">\"] = value;\n }\n return variables;\n}\n\nvoid show_story(string story)\n{\n mapping variables = fill_variables(story);\n write(\"\\n\"+replace(story, variables));\n}\n\nvoid do_exit()\n{\n exit(0);\n}\n\nmapping functions = ([ \"help\":print_help,\n \"show\":show_story,\n \"exit\":do_exit,\n ]);\nstring story = \"\";\n\nvoid main()\n{\n Stdio.Readline.History readline_history = Stdio.Readline.History(512);\n readln->enable_history(readline_history);\n\n string prompt=\"> \";\n\n print_help();\n while(1)\n {\n string input=readln->read(prompt);\n if(!input)\n exit(0);\n if(input == \"\")\n show_story(story);\n else if (functions[input])\n functions[input]();\n else add_line(input);\n }\n}\n","language":"Pike"},{"code":"(stringrange, stringsize): /* 2 Nov. 2013 */\nMad_Libs: procedure options (main);\n declare (line, left, right) character (100) varying;\n declare true bit(1) value ('1'b), false bit (1) value ('0'b);\n declare name character (20) varying, seen_name bit (1) initial (false);\n declare pronoun character (20) varying, seen_pronoun bit (1) initial (false);\n declare noun character (20) varying, seen_noun bit (1) initial (false);\n declare replaced_all bit (1);\n declare in file input;\n\n open file (in) title ('/MADLIBS.DAT,type(text),recsize(100)');\n\n do forever;\n get file (in) edit (line) (L);\n if line = '' then leave;\n\n do until (replaced_all);\n replaced_all = true;\n if index(line, '<name>') > 0 then\n if seen_name then\n do until (index(line, '<name>') = 0);\n call split(line, '<name>', left, right);\n line = left || name || right;\n replaced_all = false;\n end;\n else\n do;\n put skip list ('Please type a name:');\n get edit (name) (L);\n seen_name = true; replaced_all = false;\n end;\n if index(line, '<he or she>') > 0 then\n if seen_pronoun then\n do until (index(line, '<he or she>') = 0);\n call split(line, '<he or she>', left, right);\n line = left || pronoun || right;\n replaced_all = false;\n end;\n else\n do;\n put skip list ('Please type a pronoun (he or she):');\n get edit (pronoun) (L);\n seen_pronoun = true; replaced_all = false;\n end;\n if index(line, '<noun>') > 0 then\n if seen_noun then\n do until (index(line, '<noun>') = 0);\n call split(line, '<noun>', left, right);\n line = left || noun || right;\n replaced_all = false;\n end;\n else\n do;\n put skip list ('Please type a noun:');\n get edit (noun) (L);\n seen_noun = true; replaced_all = false;\n end;\n end;\n put skip list (line);\n end;\n\nsplit: procedure (line, text, Left, Right);\n declare (line, text, left, right) character (*) varying;\n declare i fixed binary;\n\n i = index(line, text);\n left = substr(line, 1, i-1);\n right = substr(line, i+length(text), length(line) - (i + length(text)) + 1 );\nend split;\n\nend Mad_Libs;\n","language":"PL-I"},{"code":"function New-MadLibs\n{\n [CmdletBinding(DefaultParameterSetName='None')]\n [OutputType([string])]\n Param\n (\n [Parameter(Mandatory=$false)]\n [AllowEmptyString()]\n [string]\n $Name = \"\",\n\n [Parameter(Mandatory=$false, ParameterSetName='Male')]\n [switch]\n $Male,\n\n [Parameter(Mandatory=$false, ParameterSetName='Female')]\n [switch]\n $Female,\n\n [Parameter(Mandatory=$false)]\n [AllowEmptyString()]\n [string]\n $Item = \"\"\n )\n\n if (-not $Name)\n {\n $Name = (Get-Culture).TextInfo.ToTitleCase((Read-Host -Prompt \"`nEnter a name\").ToLower())\n }\n else\n {\n $Name = (Get-Culture).TextInfo.ToTitleCase(($Name).ToLower())\n }\n\n if ($Male)\n {\n $pronoun = \"He\"\n }\n elseif ($Female)\n {\n $pronoun = \"She\"\n }\n else\n {\n $title = \"Gender\"\n $message = \"Select $Name's Gender\"\n $_male = New-Object System.Management.Automation.Host.ChoiceDescription \"&Male\", \"Selects male gender.\"\n $_female = New-Object System.Management.Automation.Host.ChoiceDescription \"&Female\", \"Selects female gender.\"\n $options = [System.Management.Automation.Host.ChoiceDescription[]]($_male, $_female)\n $result = $host.UI.PromptForChoice($title, $message, $options, 0)\n\n switch ($result)\n {\n 0 {$pronoun = \"He\"}\n 1 {$pronoun = \"She\"}\n }\n }\n\n if (-not $Item)\n {\n $Item = Read-Host -Prompt \"`nEnter an item\"\n }\n\n \"`n{0} went for a walk in the park. {1} found a {2}. {0} decided to take it home.`n\" -f $Name, $pronoun, $Item\n}\n","language":"PowerShell"},{"code":"New-MadLibs -Name hank -Male -Item shank\n","language":"PowerShell"},{"code":"New-MadLibs\n","language":"PowerShell"},{"code":"$paramLists = @(@{Name='mary'; Female=$true; Item=\"little lamb\"},\n @{Name='hank'; Male=$true; Item=\"shank\"},\n @{Name='foo'; Male=$true; Item=\"bar\"})\n\nforeach ($paramList in $paramLists)\n{\n New-MadLibs @paramList\n}\n","language":"PowerShell"},{"code":"If OpenConsole()\n\n cadena$ = \"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\"\n k = FindString(cadena$, \"<\")\n\n PrintN(\"La historia: \")\n Print(cadena$ + Chr(10))\n While k\n reemplaza$ = Mid(cadena$, k, FindString(cadena$, \">\") - k + 1)\n Print(Chr(10) + \"What should replace \" + reemplaza$ + \" \")\n con$ = Input ()\n While k\n cadena$ = Left(cadena$, k-1) + con$ + Mid(cadena$, k + Len(reemplaza$))\n k = FindString(cadena$, reemplaza$, k)\n Wend\n k = FindString(cadena$, \"<\")\n Wend\n PrintN(Chr(10) + \"La historia final: \")\n PrintN(cadena$)\n Input()\n CloseConsole()\nEndIf\nEnd\n","language":"PureBasic"},{"code":"import re\n\n# Optional Python 2.x compatibility\n#try: input = raw_input\n#except: pass\n\ntemplate = '''<name> went for a walk in the park. <he or she>\nfound a <noun>. <name> decided to take it home.'''\n\ndef madlibs(template):\n print('The story template is:\\n' + template)\n fields = sorted(set( re.findall('<[^>]+>', template) ))\n values = input('\\nInput a comma-separated list of words to replace the following items'\n '\\n %s: ' % ','.join(fields)).split(',')\n story = template\n for f,v in zip(fields, values):\n story = story.replace(f, v)\n print('\\nThe story becomes:\\n\\n' + story)\n\nmadlibs(template)\n","language":"Python"},{"code":"(define (get-mad-libs file)\n (with-input-from-file file\n (lambda ()\n (for/fold ((text \"\"))\n ((line (in-lines)))\n (string-append text line \"\\n\")))))\n\n\n(define (replace-context mad-libs)\n (define matches\n (regexp-match* #rx\"<[a-zA-Z0-9 ]*>\" mad-libs))\n (map\n (lambda (context)\n (display (format \"~a?\" context))\n (cons context (read-line)))\n (remove-duplicates matches)))\n\n(define (play-mad-libs)\n (display \"Tell me a file to play Mad Libs: \")\n (define text (get-mad-libs (read-line)))\n (define matches (replace-context text))\n\n (display\n (for/fold ((mad-story text))\n ((change (in-list matches)))\n (string-replace mad-story (car change) (cdr change)))))\n\n(play-mad-libs)\n","language":"Racket"},{"code":"print S:g[ '<' (.*?) '>' ] = %.{$0} //= prompt \"$0? \" given slurp;\n","language":"Raku"},{"code":"t: {<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.}\nview layout [a: area wrap t btn \"Done\" [x: a/text unview]]\nparse x [any [to \"<\" copy b thru \">\" (append w: [] b)] to end]\nforeach i unique w [replace/all x i ask join i \": \"] alert x\n","language":"REBOL"},{"code":"phrase: ask \"Enter phrase, leave line empty to terminate:^/\"\nwhile [not empty? line: input] [append phrase rejoin [\"^/\" line]]\nwords: parse phrase [collect [any [to \"<\" copy b thru \">\" keep (b)]]]\nforeach w unique words [replace/all phrase w ask rejoin [w \": \"]]\nprint phrase\n","language":"Red"},{"code":"/*REXX program prompts the user for a template substitutions within a story (MAD LIBS).*/\nparse arg iFID . /*allow user to specify the input file.*/\nif iFID=='' | iFID==\",\" then iFID=\"MAD_LIBS.TXT\" /*Not specified? Then use the default.*/\n@.= /*assign defaults to some variables. */\n$=; do recs=1 while lines(iFID)\\==0 /*read the input file until it's done. */\n @.recs=linein(iFID); $=$ @.recs /*read a record; and append it to @ */\n if @.recs='' then leave /*Read a blank line? Then we're done.*/\n end /*recs*/\nrecs=recs-1 /*adjust for a E─O─F or a blank line.*/\npm= 'please enter a word or phrase to replace: ' /*this is part of the Prompt Message. */\n!.=0 /*placeholder for phrases in MAD LIBS.*/\n#=0; do forever /*look for templates within the text. */\n parse var $ '<' ? \">\" $ /*scan for <ααα> stuff in the text.*/\n if ?='' then leave /*No ααα ? Then we're all finished.*/\n if !.? then iterate /*Already asked? Then keep scanning. */\n !.?=1 /*mark this ααα as being \"found\". */\n do until ans\\='' /*prompt user for a replacement. */\n say '───────────' pm ? /*prompt the user with a prompt message*/\n parse pull ans /*PULL obtains the text from console. */\n end /*forever*/\n #=#+1 /*bump the template counter. */\n old.# = '<'?\">\"; new.# = ans /*assign the \"old\" name and \"new\" name.*/\n end /*forever*/\nsay /*display a blank line for a separator.*/\nsay; say copies('═', 79) /*display a blank line and a fence. */\n\n do m=1 for recs /*display the text, line for line. */\n do n=1 for # /*perform substitutions in the text. */\n @.m=changestr(old.n, @.m, new.n) /*maybe replace text in @.m haystack.*/\n end /*n*/\n say @.m /*display the (new) substituted text. */\n end /*m*/\n\nsay copies('═', 79) /*display a final (output) fence. */\nsay /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"temp=\"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\"\nk = substr(temp,\"<\")\nwhile k\n replace = substr(temp,k,substr(temp,\">\")-k + 1)\n see \"replace:\" + replace + \" with: \"\n give with\n while k\n temp = left(temp,k-1) + with + substr(temp,k + len(replace))\n k = substr(temp,replace)\n end\n k = substr(temp,\"<\")\nend\nsee temp + nl\n","language":"Ring"},{"code":"puts \"Enter a story, terminated by an empty line:\"\nstory = \"\"\nuntil (line = gets).chomp.empty?\n story << line\nend\n\nstory.scan(/(?<=[<]).+?(?=[>])/).uniq.each do |var|\n print \"Enter a value for '#{var}': \"\n story.gsub!(/<#{var}>/, gets.chomp)\nend\n\nputs\nputs story\n","language":"Ruby"},{"code":"temp$=\"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\"\nk = instr(temp$,\"<\")\nwhile k\n replace$ = mid$(temp$,k,instr(temp$,\">\")-k + 1)\n print \"Replace:\";replace$;\" with:\"; :input with$\n while k\n temp$ = left$(temp$,k-1) + with$ + mid$(temp$,k + len(replace$))\n k = instr(temp$,replace$,k)\n wend\nk = instr(temp$,\"<\")\nwend\nprint temp$\nwait\n","language":"Run-BASIC"},{"code":"extern crate regex;\n\nuse regex::Regex;\nuse std::collections::HashMap;\nuse std::io;\n\nfn main() {\n let mut input_line = String::new();\n let mut template = String::new();\n\n println!(\"Please enter a multi-line story template with <parts> to replace, terminated by a blank line.\\n\");\n loop {\n io::stdin()\n .read_line(&mut input_line)\n .expect(\"The read line failed.\");\n if input_line.trim().is_empty() {\n break;\n }\n template.push_str(&input_line);\n input_line.clear();\n }\n\n let re = Regex::new(r\"<[^>]+>\").unwrap();\n let mut parts: HashMap<_, _> = re\n .captures_iter(&template)\n .map(|x| (x.get(0).unwrap().as_str().to_string(), \"\".to_string()))\n .collect();\n if parts.is_empty() {\n println!(\"No <parts> to replace.\\n\");\n } else {\n for (k, v) in parts.iter_mut() {\n println!(\"Please provide a replacement for {}: \", k);\n io::stdin()\n .read_line(&mut input_line)\n .expect(\"The read line failed.\");\n *v = input_line.trim().to_string();\n println!();\n template = template.replace(k, v);\n input_line.clear();\n }\n }\n println!(\"Resulting story:\\n\\n{}\", template);\n}\n","language":"Rust"},{"code":"object MadLibs extends App{\n val input = \"<name> went for a walk in the park. <he or she>\\nfound a <noun>. <name> decided to take it home.\"\n println(input)\n println\n\n val todo = \"(<[^>]+>)\".r\n val replacements = todo.findAllIn(input).toSet.map{found: String =>\n found -> readLine(s\"Enter a $found \")\n }.toMap\n\n val output = todo.replaceAllIn(input, found => replacements(found.matched))\n println\n println(output)\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n\nconst proc: main is func\n local\n var string: story is \"\";\n var string: line is \"\";\n var integer: pos1 is 0;\n var integer: pos2 is 1;\n var string: field is \"\";\n begin\n writeln(\"Enter a story template, terminated by an empty line:\");\n repeat\n readln(line);\n if line <> \"\" then\n story &:= line & \"\\n\";\n end if;\n until line = \"\";\n pos1 := pos(story, '<');\n while pos1 <> 0 and pos2 <> 0 do\n pos2 := pos(story, '>', pos1);\n if pos2 <> 0 then\n field := story[pos1 .. pos2];\n write(\"Enter a value for \" <& field <& \": \");\n story := replace(story, field, getln(IN));\n pos1 := pos(story, '<', pos1);\n end if;\n end while;\n writeln;\n writeln(\"The story becomes:\");\n write(story);\n end func;\n","language":"Seed7"},{"code":"var story = ARGF.slurp;\n\nvar blanks = Hash.new;\nwhile (var m = /<(.*?)>/.gmatch(story)) {\n blanks.append(m[0]);\n}\n\nblanks.keys.sort.each { |blank|\n var replacement = Sys.scanln(\"#{blank}: \");\n blanks{blank} = replacement;\n}\n\nprint story.gsub(/<(.*?)>/, {|s1| blanks{s1} });\n","language":"Sidef"},{"code":"SUB BETWEEN$(TXT$, LHS$, RHS$, AFTER)\n\tLET LHS = POS(TXT$, LHS$, AFTER)\n\tIF LHS = 0 THEN\n\t\t'LHS$ NOT FOUND IN TXT$. RETURN EMPTY STRING\n\t\tRETURN \"\"\n\t\tEXIT SUB\n\tEND IF\n\tLET RHS = POS(TXT$, RHS$, LHS + LEN(LHS$))\n\tIF RHS = 0 THEN\n\t\t'NO RHS$ FOUND IMMEDIATELY AFTER LHS$ IN TXT$. RETURN EMPTY STRING.\n\t\tRETURN \"\"\n\t\tEXIT SUB\n\tEND IF\n\tRETURN SEG$(TXT$, LHS + LEN(LHS$), RHS-1)\nEND SUB\n\nDECLARE SUB REPLACE$(INTHIS$, FINDTHIS$, WITHTHIS$)\n\tLET T = POS(INTHIS$, FINDTHIS$)\n\tRETURN INTHIS$\n\tIF T <> 0 THEN\n\t\tMID$(INTHIS$, T, LEN(FINDTHIS$)) = WITHTHIS$\n\t\tRETURN INTHIS$\n\tEND IF\nEND SUB\n\nLET STORY$ = \"\"\nLET STORYLINE$ = \"\"\nWHILE TRUE\n\tLINE INPUT \"Enter line of story (empty line to stop)\"; STORYLINE$\n\tIF STORYLINE$ = \"\" THEN\n\t\tEXIT WHILE\n\tEND IF\n\tSTORY$ = STORY$ + \" \" + STORYLINE$\nEND WHILE\n\nWHILE TRUE\n\tLET TXT$ = \"\"\n\tLET KEY$ = BETWEEN$(STORY$, \"<\", \">\", 0)\n\tIF KEY$ <> \"\" THEN\n\t\tPRINT \"PLEASE ENTER A \" + KEY$;\n\t\tLINE INPUT TXT$\n\t\tLET SRCH$ = \"<\" + KEY$ + \">\"\n\t\tSTORY$ = REPLACE$(STORY$, SRCH$, TXT$)\n\tELSE\n\t\tEXIT WHILE\n\tEND IF\nEND WHILE\n\nPRINT STORY$\n","language":"Tbas"},{"code":"package require Tcl 8.5\n\n# Read the template...\nputs [string repeat \"-\" 70]\nputs \"Enter the story template, ending with a blank line\"\nwhile {[gets stdin line] > 0} {\n append content $line \"\\n\"\n}\n\n# Read the mapping...\nputs [string repeat \"-\" 70]\nset mapping {}\nforeach piece [regexp -all -inline {<[^>]+>} $content] {\n if {[dict exists $mapping $piece]} continue\n puts -nonewline \"Give me a $piece: \"\n flush stdout\n dict set mapping $piece [gets stdin]\n}\n\n# Apply the mapping and print...\nputs [string repeat \"-\" 70]\nputs -nonewline [string map $mapping $content]\nputs [string repeat \"-\" 70]\n","language":"Tcl"},{"code":"Function mad_libs(s)\n Do\n If InStr(1,s,\"<\") <> 0 Then\n start_position = InStr(1,s,\"<\") + 1\n end_position = InStr(1,s,\">\")\n parse_string = Mid(s,start_position,end_position-start_position)\n WScript.StdOut.Write parse_string & \"? \"\n input_string = WScript.StdIn.ReadLine\n s = Replace(s,\"<\" & parse_string & \">\",input_string)\n Else\n Exit Do\n End If\n Loop\n mad_libs = s\nEnd Function\n\nWScript.StdOut.Write mad_libs(\"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\")\nWScript.StdOut.WriteLine\n","language":"VBScript"},{"code":"Imports System.Text\n\nModule Program\n Private Function GetStory() As String\n Dim input As New StringBuilder()\n Do\n Dim nextLine = Console.ReadLine()\n If String.IsNullOrEmpty(nextLine) Then Exit Do\n input.AppendLine(nextLine)\n Loop\n\n Dim story = input.ToString()\n Return story\n End Function\n\n Sub Main()\n Dim input As String = GetStory()\n\n Dim result As New StringBuilder()\n Dim replacements As New Dictionary(Of String, String)\n\n For i = 0 To input.Length - 1\n Dim curChar = input(i)\n\n ' For all characters but '<', append it and move on.\n If curChar <> \"<\"c Then\n result.Append(curChar)\n Else\n ' If the character before was a backslash, then replace the backslash in the result with a '<' and move on.\n If i > 0 AndAlso input(i - 1) = \"\\\"c Then\n result(result.Length - 1) = \"<\"c\n Continue For\n End If\n\n ' Search for the first '>' that isn't preceded by a backslash.\n Dim closeBracketPos = -1\n For ind = i To input.Length - 1\n If input(ind) = \">\"c AndAlso input(ind - 1) <> \"\\\"c Then\n closeBracketPos = ind\n Exit For\n End If\n Next\n\n ' The search failed to find a '>'.\n If closeBracketPos < 0 Then\n Console.WriteLine($\"ERROR: Template starting at position {i} is not closed.\")\n Environment.Exit(-1)\n End If\n\n ' The text between the current character and the found '>' character, with escape sequences simplified.\n Dim key As String = input.Substring(i + 1, closeBracketPos - i - 1).Replace(\"\\>\", \">\", StringComparison.Ordinal)\n\n Dim subst As String = Nothing\n ' Ask for and store a replacement value if there isn't already one for the key.\n If Not replacements.TryGetValue(key, subst) Then\n Console.Write($\"Enter a {key}: \")\n subst = Console.ReadLine()\n replacements.Add(key, subst)\n End If\n\n result.Append(subst)\n i = closeBracketPos\n End If\n Next\n\n Console.WriteLine()\n Console.Write(result)\n End Sub\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"io\" for Stdin, Stdout\nimport \"./pattern\" for Pattern\nimport \"./seq\" for Lst\n\nSystem.print(\"Please enter a multi-line story template terminated by a blank line:\\n\")\nStdout.flush()\nvar story = \"\"\nwhile (true) {\n var line = Stdin.readLine()\n if (line.isEmpty) break\n story = story + line + \"\\n\" // preserve line breaks\n}\n// identify blanks\nvar p = Pattern.new(\"<+0^>>\")\nvar blanks = Lst.distinct(p.findAll(story).map { |m| m.text }.toList)\nSystem.print(\"Please enter your replacements for the following 'blanks' in the story:\")\nfor (blank in blanks) {\n System.write(\" %(blank[1..-2]) : \")\n Stdout.flush()\n var repl = Stdin.readLine()\n story = story.replace(blank, repl)\n}\nSystem.print(\"\\n%(story)\")\n","language":"Wren"},{"code":"story,line,re:=Data(),\"\",RegExp(\"(<[^>]+>)\");\ndo{ line=ask(\"Story: \"); story.write(line,\"\\n\") }while(line);\nwhile(re.search(story,True)){\n z,ml,N:=re.matched,z[1],z[0][1]; // z=( (0,6),\"<name>\" )\n s:=ask(\"Text to replace \",ml,\" with: \");\n while(Void!=(n:=story.find(ml))){ story[n,N]=s } // replace all <names>s\n}\nprintln(\"-----------------\");\nstory.text.print();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Mad_Libs\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"<br>\\n[[wp:Mad Libs|Mad Libs]] is a phrasal template word game where one player prompts another for a list of words to substitute for blanks in a story, usually with funny results. \\n\\n\\n;Task;\\nWrite a program to create a Mad Libs like story. \\n\\nThe program should read an arbitrary multiline story from input.\\n\\nThe story will be terminated with a blank line. \\n\\nThen, find each replacement to be made within the story, ask the user for a word to replace it with, and make all the replacements.\\n\\nStop when there are none left and print the final story.\\n\\n\\nThe input should be an arbitrary story in the form:\\n<pre>\\n<name> went for a walk in the park. <he or she>\\nfound a <noun>. <name> decided to take it home.\\n</pre>\\nGiven this example, it should then ask for a <tt>name</tt>, a <tt>he or she</tt> and a <tt>noun</tt> (<tt><nowiki><name></nowiki></tt> gets replaced both times with the same value).\\n\\n\\n{{Template:Strings}}\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V template = ‘<name> went for a walk in the park. <he or she>\\nfound a <noun>. <name> decided to take it home.’\\n\\nF madlibs(template)\\n print(\\\"The story template is:\\\\n\\\"template)\\n V fields = sorted(Array(Set(re:‘<[^>]+>’.find_strings(template))))\\n V values = input(\\\"\\\\nInput a comma-separated list of words to replace the following items\\\\n #.: \\\".format(fields.join(‘,’))).split(‘,’)\\n V story = template\\n L(f, v) zip(fields, values)\\n story = story.replace(f, v)\\n print(\\\"\\\\nThe story becomes:\\\\n\\\\n\\\"story)\\n\\nmadlibs(template)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Text_IO, Ada.Command_Line, String_Helper;\\n\\nprocedure Madlib is\\n\\n use String_Helper;\\n\\n Text: Vector := Get_Vector(Ada.Command_Line.Argument(1));\\n M, N: Natural;\\n\\nbegin\\n -- search for templates and modify the text accordingly\\n for I in Text.First_Index .. Text.Last_Index loop\\n loop\\n Search_Brackets(Text.Element(I), \\\"<\\\", \\\">\\\", M, N);\\n exit when M=0; -- \\\"M=0\\\" means \\\"not found\\\"\\n Ada.Text_IO.Put_Line(\\\"Replacement for \\\" & Text.Element(I)(M .. N) & \\\"?\\\");\\n declare\\n Old: String := Text.Element(I)(M .. N);\\n New_Word: String := Ada.Text_IO.Get_Line;\\n begin\\n for J in I .. Text.Last_Index loop\\n Text.Replace_Element(J, Replace(Text.Element(J), Old, New_Word));\\n end loop;\\n end;\\n end loop;\\n end loop;\\n\\n -- write the text\\n for I in Text.First_Index .. Text.Last_Index loop\\n Ada.Text_IO.Put_Line(Text.Element(I));\\n end loop;\\nend Madlib;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Containers.Indefinite_Vectors;\\n\\npackage String_Helper is\\n\\n function Index(Source: String; Pattern: String) return Natural;\\n\\n procedure Search_Brackets(Source: String;\\n Left_Bracket: String;\\n Right_Bracket: String;\\n First, Last: out Natural);\\n -- returns indices of first pair of brackets in source\\n -- indices are zero if no such brackets are found\\n\\n function Replace(Source: String; Old_Word: String; New_Word: String)\\n return String;\\n\\n package String_Vec is new Ada.Containers.Indefinite_Vectors\\n (Index_Type => Positive,\\n Element_Type => String);\\n\\n type Vector is new String_Vec.Vector with null record;\\n\\n function Get_Vector(Filename: String) return Vector;\\n\\nend String_Helper;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Strings.Fixed, Ada.Text_IO;\\n\\npackage body String_Helper is\\n\\n function Index(Source: String; Pattern: String) return Natural is\\n begin\\n return Ada.Strings.Fixed.Index(Source => Source, Pattern => Pattern);\\n end Index;\\n\\n procedure Search_Brackets(Source: String;\\n Left_Bracket: String;\\n Right_Bracket: String;\\n First, Last: out Natural) is\\n begin\\n First := Index(Source, Left_Bracket);\\n if First = 0 then\\n Last := 0; -- not found\\n else\\n Last := Index(Source(First+1 .. Source'Last), Right_Bracket);\\n if Last = 0 then\\n First := 0; -- not found;\\n end if;\\n end if;\\n end Search_Brackets;\\n\\n function Replace(Source: String; Old_Word: String; New_Word: String)\\n return String is\\n L: Positive := Old_Word'Length;\\n I: Natural := Index(Source, Old_Word);\\n begin\\n if I = 0 then\\n return Source;\\n else\\n return Source(Source'First .. I-1) & New_Word\\n & Replace(Source(I+L .. Source'Last), Old_Word, New_Word);\\n end if;\\n end Replace;\\n\\n function Get_Vector(Filename: String) return Vector is\\n F: Ada.Text_IO.File_Type;\\n T: Vector;\\n begin\\n Ada.Text_IO.Open(F, Ada.Text_IO.In_File, Filename);\\n while not Ada.Text_IO.End_Of_File(F) loop\\n T.Append(Ada.Text_IO.Get_Line(F));\\n end loop;\\n Ada.Text_IO.Close(F);\\n return T;\\n end Get_Vector;\\n\\nend String_Helper;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"file f;\\ndata b;\\nlist l;\\nrecord r;\\n\\nf.stdin;\\n\\no_text(\\\"Enter the blank line terminated story:\\\\n\\\");\\n\\nwhile (0 < f.b_line(b)) {\\n l.append(b);\\n}\\n\\nfor (, b in l) {\\n integer p, q;\\n text s, t;\\n\\n while ((p = b.place('<')) ^ -1) {\\n q = b.probe(p, '>');\\n if (q ^ -1) {\\n s = bq_string(b, p + 1, q - 1);\\n b.erase(p, q);\\n if (!r.key(s)) {\\n o_(\\\"Replacement for `\\\", s, \\\"':\\\\n\\\");\\n f.line(t);\\n r.put(s, t);\\n }\\n b.paste(p, r[s]);\\n }\\n }\\n}\\n\\nl.ucall(o_, 0, \\\"\\\\n\\\");\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"# Mad Libs style story generation #\\n\\n# gets the story template from the file f. The template terminates with #\\n# a blank line #\\n# The user is then promoted for the replacements for the <word> markers #\\n# and the story is printed with the substitutions made #\\nPROC story = ( REF FILE f )VOID:\\nBEGIN\\n\\n # a linked list of strings, used to hold the story template #\\n MODE STRINGLIST = STRUCT( STRING text, REF STRINGLIST next );\\n\\n # a linked list of pairs of strings, used to hold the replacements #\\n MODE REPLACEMENTLIST = STRUCT( STRING word\\n , STRING replacement\\n , REF REPLACEMENTLIST next\\n );\\n\\n # NIL reference for marking the end of a STRINGLIST #\\n REF STRINGLIST nil stringlist = NIL;\\n\\n # NIL reference for marking the end of a REPLACEMENTLIST #\\n REF REPLACEMENTLIST nil replacementlist = NIL;\\n\\n\\n # returns \\\"text\\\" with trailing spaces removed #\\n OP RTRIM = ( STRING text )STRING:\\n BEGIN\\n INT trim pos := UPB text;\\n FOR text pos FROM UPB text BY -1 TO LWB text WHILE text[ text pos ] = \\\" \\\"\\n DO\\n trim pos := text pos - 1\\n OD;\\n\\n text[ LWB text : trim pos ]\\n END; # RTRIM #\\n\\n # looks for word in the dictionary. If it is found, replacement is #\\n # set to its replacement and TRUE is returned. If word not present, #\\n # FALSE is returned - uses recursion #\\n PROC find replacement = ( STRING word\\n , REF STRING replacement\\n , REF REPLACEMENTLIST dictionary\\n )BOOL:\\n IF dictionary IS nil replacementlist\\n THEN\\n FALSE\\n ELIF word OF dictionary = word\\n THEN\\n replacement := replacement OF dictionary;\\n TRUE\\n ELSE\\n find replacement( word, replacement, next OF dictionary )\\n FI; # find replacement #\\n\\n\\n # read the story template #\\n\\n # the result has a dummy element so \\\"next OF next\\\" is always valid #\\n REF STRINGLIST story := HEAP STRINGLIST := ( \\\"dummy\\\", nil stringlist );\\n REF REF STRINGLIST next := story;\\n\\n # read the story template, terminates with a blank line #\\n\\n WHILE\\n STRING text;\\n get( f, ( text, newline ) );\\n text := RTRIM text;\\n text /= \\\"\\\"\\n DO\\n # add the line to the end of the list #\\n next := ( next OF next ) := HEAP STRINGLIST := ( text, nil stringlist )\\n OD;\\n\\n # find the <word> markers in the story and replace them with the #\\n # user's chosen text - we ignore the dummy element at the start #\\n\\n REF REPLACEMENTLIST dictionary := nil replacementlist;\\n REF STRINGLIST line := story;\\n\\n WHILE line := next OF line;\\n line ISNT nil stringlist\\n DO\\n # have a line of text - replace all the <word> markers in it #\\n STRING word, replacement;\\n INT start pos, end pos;\\n WHILE char in string( \\\"<\\\", start pos, text OF line )\\n AND char in string( \\\">\\\", end pos, text OF line )\\n DO\\n # have a marker, get it from the line #\\n word := ( text OF line )[ start pos : end pos ];\\n # get its replacement #\\n IF NOT find replacement( word, replacement, dictionary )\\n THEN\\n # we don't already have a replacement for word #\\n # get one from the user and add it to the dictionary #\\n print( ( \\\"What should replace \\\", word, \\\"? \\\" ) );\\n read( ( replacement, newline ) );\\n dictionary := HEAP REPLACEMENTLIST := ( word, replacement, dictionary )\\n FI;\\n # replace <word> with the replacement #\\n text OF line := ( text OF line )[ : start pos - 1 ]\\n + replacement\\n + ( text OF line )[ end pos + 1 : ]\\n OD\\n OD;\\n\\n # print the story, ignoring the dummy element at the start #\\n\\n line := story;\\n\\n WHILE line := next OF line;\\n line ISNT nil stringlist\\n DO\\n print( ( text OF line, newline ) )\\n OD\\n\\nEND; # story #\\n\\nmain:(\\n\\n # we read the template from stand in (the keyboard unless it's been #\\n # redirected) we could prompt the user for a template file name, #\\n # open it and read that instead... #\\n print( ( \\\"Please Enter the story template terminated by a blank line\\\", newline ) );\\n story( stand in )\\n\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"set theNoun to the text returned of (display dialog \\\"What is your noun?\\\" default answer \\\"\\\")\\n\\nset thePerson to the text returned of (display dialog \\\"What is the person's name?\\\" default answer \\\"\\\")\\n\\nset theGender to the text returned of (display dialog \\\"He or she? Please capitalize.\\\" default answer \\\"\\\")\\n\\ndisplay dialog thePerson & \\\" went for a walk in the park. \\\" & theGender & \\\" found a \\\" & theNoun & \\\". \\\" & thePerson & \\\" decided to take it home.\\\"\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \" 100 DIM L$(100),W$(50),T$(50)\\n 110 LET M$ = CHR$ (13)\\n 120 FOR L = 1 TO 1E9\\n 130 READ L$(L)\\n 140 IF LEN (L$(L)) THEN NEXT L\\n 150 FOR I = 1 TO L\\n 160 LET M = 0\\n 170 LET N$(0) = \\\"\\\"\\n 180 FOR J = 1 TO LEN (L$(I))\\n 190 LET C$ = MID$ (L$(I),J,1)\\n 200 IF C$ = \\\"<\\\" AND NOT M THEN M = 1:C$ = \\\"\\\":N$(M) = \\\"\\\"\\n 210 IF C$ = \\\">\\\" AND M THEN GOSUB 300:M = 0:C$ = W$(Z)\\n 220 LET N$(M) = N$(M) + C$\\n 230 NEXT J\\n 240 LET L$(I) = N$(0)\\n 250 NEXT I\\n 260 FOR I = 1 TO L\\n 270 PRINT M$L$(I);\\n 280 NEXT\\n 290 END\\n 300 FOR Z = 0 TO T\\n 310 IF T$(Z) = N$(M) THEN RETURN\\n 320 NEXT Z\\n 330 LET T = Z\\n 340 LET T$(Z) = N$(M)\\n 350 PRINT M$\\\"ENTER A \\\"T$(Z);\\n 360 INPUT \\\"? \\\";W$(Z)\\n 370 RETURN\\n 380 DATA \\\"<NAME> WENT FOR A WALK IN THE PARK. <HE OR SHE>\\\"\\n 390 DATA \\\"FOUND A <NOUN>. <NAME> DECIDED TO TAKE IT HOME.\\\"\\n 990 DATA\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"story: strip input \\\"Enter a story: \\\"\\nvars: unique map match story {/\\\\|([^\\\\|]+)\\\\|/} 'v -> replace v \\\"|\\\" \\\"\\\"\\n\\ni: 0\\nwhile [i < size vars].import [\\n let vars\\\\[i] input ~\\\"Enter value for <|vars\\\\[i]|>: \\\"\\n i: i + 1\\n]\\n\\nprint ~story\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"FileSelectFile, filename, , %A_ScriptDir%, Select a Mad Libs template, *.txt\\nIf ErrorLevel\\n\\tExitApp ; the user canceled the file selection\\nFileRead, contents, %filename%\\npos := match := 0\\nWhile pos := RegExMatch(contents, \\\"<[^>]+>\\\", match, pos+strLen(match))\\n{\\n\\tInputBox, repl, Mad Libs, Enter a replacement for %match%:\\n\\tIf ErrorLevel ; cancelled inputbox\\n\\t\\tExitApp\\n\\tStringReplace, contents, contents, %match%, %repl%, All\\n}\\nMsgBox % contents\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f MAD_LIBS.AWK\\nBEGIN {\\n print(\\\"enter story:\\\")\\n}\\n{ story_arr[++nr] = $0\\n if ($0 ~ /^ *$/) {\\n exit\\n }\\n while ($0 ~ /[<>]/) {\\n L = index($0,\\\"<\\\")\\n R = index($0,\\\">\\\")\\n changes_arr[substr($0,L,R-L+1)] = \\\"\\\"\\n sub(/</,\\\"\\\",$0)\\n sub(/>/,\\\"\\\",$0)\\n }\\n}\\nEND {\\n PROCINFO[\\\"sorted_in\\\"] = \\\"@ind_str_asc\\\"\\n print(\\\"enter values for:\\\")\\n for (i in changes_arr) { # prompt for replacement values\\n printf(\\\"%s \\\",i)\\n getline rec\\n sub(/ +$/,\\\"\\\",rec)\\n changes_arr[i] = rec\\n }\\n printf(\\\"\\\\nrevised story:\\\\n\\\")\\n for (i=1; i<=nr; i++) { # print the story\\n for (j in changes_arr) {\\n gsub(j,changes_arr[j],story_arr[i])\\n }\\n printf(\\\"%s\\\\n\\\",story_arr[i])\\n }\\n exit(0)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"cadena = \\\"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\\\"\\nk = instr(cadena, \\\"<\\\")\\n\\nprint \\\"La historia: \\\" : print cadena : print\\nwhile k\\n\\treemplaza = mid(cadena, k, instr(cadena, \\\">\\\") - k + 1)\\n\\tprint \\\"What should replace \\\"; reemplaza; : input \\\" \\\", con\\n\\twhile k\\n\\t\\tcadena = left(cadena, k-1) + con + mid(cadena, k + length(reemplaza), length(cadena))\\n\\t\\tk = instr(cadena, reemplaza, k)\\n\\tend while\\n\\tk = instr(cadena, \\\"<\\\", length(reemplaza))\\nend while\\nprint : print \\\"La historia final: \\\" : print cadena\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n\\n#define err(...) fprintf(stderr, ## __VA_ARGS__), exit(1)\\n\\n/* We create a dynamic string with a few functions which make modifying\\n * the string and growing a bit easier */\\ntypedef struct {\\n char *data;\\n size_t alloc;\\n size_t length;\\n} dstr;\\n\\ninline int dstr_space(dstr *s, size_t grow_amount)\\n{\\n return s->length + grow_amount < s->alloc;\\n}\\n\\nint dstr_grow(dstr *s)\\n{\\n s->alloc *= 2;\\n char *attempt = realloc(s->data, s->alloc);\\n\\n if (!attempt) return 0;\\n else s->data = attempt;\\n\\n return 1;\\n}\\n\\ndstr* dstr_init(const size_t to_allocate)\\n{\\n dstr *s = malloc(sizeof(dstr));\\n if (!s) goto failure;\\n\\n s->length = 0;\\n s->alloc = to_allocate;\\n s->data = malloc(s->alloc);\\n\\n if (!s->data) goto failure;\\n\\n return s;\\n\\nfailure:\\n if (s->data) free(s->data);\\n if (s) free(s);\\n return NULL;\\n}\\n\\nvoid dstr_delete(dstr *s)\\n{\\n if (s->data) free(s->data);\\n if (s) free(s);\\n}\\n\\ndstr* readinput(FILE *fd)\\n{\\n static const size_t buffer_size = 4096;\\n char buffer[buffer_size];\\n\\n dstr *s = dstr_init(buffer_size);\\n if (!s) goto failure;\\n\\n while (fgets(buffer, buffer_size, fd)) {\\n while (!dstr_space(s, buffer_size))\\n if (!dstr_grow(s)) goto failure;\\n\\n strncpy(s->data + s->length, buffer, buffer_size);\\n s->length += strlen(buffer);\\n }\\n\\n return s;\\n\\nfailure:\\n dstr_delete(s);\\n return NULL;\\n}\\n\\nvoid dstr_replace_all(dstr *story, const char *replace, const char *insert)\\n{\\n const size_t replace_l = strlen(replace);\\n const size_t insert_l = strlen(insert);\\n char *start = story->data;\\n\\n while ((start = strstr(start, replace))) {\\n if (!dstr_space(story, insert_l - replace_l))\\n if (!dstr_grow(story)) err(\\\"Failed to allocate memory\\\");\\n\\n if (insert_l != replace_l) {\\n memmove(start + insert_l, start + replace_l, story->length -\\n (start + replace_l - story->data));\\n\\n /* Remember to null terminate the data so we can utilize it\\n * as we normally would */\\n story->length += insert_l - replace_l;\\n story->data[story->length] = 0;\\n }\\n\\n memmove(start, insert, insert_l);\\n }\\n}\\n\\nvoid madlibs(dstr *story)\\n{\\n static const size_t buffer_size = 128;\\n char insert[buffer_size];\\n char replace[buffer_size];\\n\\n char *start,\\n *end = story->data;\\n\\n while (start = strchr(end, '<')) {\\n if (!(end = strchr(start, '>'))) err(\\\"Malformed brackets in input\\\");\\n\\n /* One extra for current char and another for nul byte */\\n strncpy(replace, start, end - start + 1);\\n replace[end - start + 1] = '\\\\0';\\n\\n printf(\\\"Enter value for field %s: \\\", replace);\\n\\n fgets(insert, buffer_size, stdin);\\n const size_t il = strlen(insert) - 1;\\n if (insert[il] == '\\\\n')\\n insert[il] = '\\\\0';\\n\\n dstr_replace_all(story, replace, insert);\\n }\\n printf(\\\"\\\\n\\\");\\n}\\n\\nint main(int argc, char *argv[])\\n{\\n if (argc < 2) return 0;\\n\\n FILE *fd = fopen(argv[1], \\\"r\\\");\\n if (!fd) err(\\\"Could not open file: '%s\\\\n\\\", argv[1]);\\n\\n dstr *story = readinput(fd); fclose(fd);\\n if (!story) err(\\\"Failed to allocate memory\\\");\\n\\n madlibs(story);\\n printf(\\\"%s\\\\n\\\", story->data);\\n dstr_delete(story);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <string>\\nusing namespace std;\\n\\nint main()\\n{\\n string story, input;\\n\\n //Loop\\n while(true)\\n {\\n //Get a line from the user\\n getline(cin, input);\\n\\n //If it's blank, break this loop\\n if(input == \\\"\\\\r\\\")\\n break;\\n\\n //Add the line to the story\\n story += input;\\n }\\n\\n //While there is a '<' in the story\\n int begin;\\n while((begin = story.find(\\\"<\\\")) != string::npos)\\n {\\n //Get the category from between '<' and '>'\\n int end = story.find(\\\">\\\");\\n string cat = story.substr(begin + 1, end - begin - 1);\\n\\n //Ask the user for a replacement\\n cout << \\\"Give me a \\\" << cat << \\\": \\\";\\n cin >> input;\\n\\n //While there's a matching category\\n //in the story\\n while((begin = story.find(\\\"<\\\" + cat + \\\">\\\")) != string::npos)\\n {\\n //Replace it with the user's replacement\\n story.replace(begin, cat.length()+2, input);\\n }\\n }\\n\\n //Output the final story\\n cout << endl << story;\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Linq;\\nusing System.Text;\\nusing System.Text.RegularExpressions;\\n\\nnamespace MadLibs_RosettaCode\\n{\\n\\tclass Program\\n\\t{\\n\\t\\tstatic void Main(string[] args)\\n\\t\\t{\\n\\t\\t\\tstring madLibs =\\n@\\\"Write a program to create a Mad Libs like story.\\nThe program should read an arbitrary multiline story from input.\\nThe story will be terminated with a blank line.\\nThen, find each replacement to be made within the story,\\nask the user for a word to replace it with, and make all the replacements.\\nStop when there are none left and print the final story.\\nThe input should be an arbitrary story in the form:\\n<name> went for a walk in the park. <he or she>\\nfound a <noun>. <name> decided to take it home.\\nGiven this example, it should then ask for a name,\\na he or she and a noun (<name> gets replaced both times with the same value).\\\";\\n\\n\\t\\t\\tStringBuilder sb = new StringBuilder();\\n\\t\\t\\tRegex pattern = new Regex(@\\\"\\\\<(.*?)\\\\>\\\");\\n\\t\\t\\tstring storyLine;\\n\\t\\t\\tstring replacement;\\n\\n\\t\\t\\tConsole.WriteLine(madLibs + Environment.NewLine + Environment.NewLine);\\n\\t\\t\\tConsole.WriteLine(\\\"Enter a story: \\\");\\n\\n\\t\\t\\t// Continue to get input while empty line hasn't been entered.\\n\\t\\t\\tdo\\n\\t\\t\\t{\\n\\t\\t\\t\\tstoryLine = Console.ReadLine();\\n\\t\\t\\t\\tsb.Append(storyLine + Environment.NewLine);\\n\\t\\t\\t} while (!string.IsNullOrEmpty(storyLine) && !string.IsNullOrWhiteSpace(storyLine));\\n\\n\\t\\t\\t// Retrieve only the unique regex matches from the user entered story.\\n\\t\\t\\tMatch nameMatch = pattern.Matches(sb.ToString()).OfType<Match>().Where(x => x.Value.Equals(\\\"<name>\\\")).Select(x => x.Value).Distinct() as Match;\\n\\t\\t\\tif(nameMatch != null)\\n\\t\\t\\t{\\n\\t\\t\\t\\tdo\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tConsole.WriteLine(\\\"Enter value for: \\\" + nameMatch.Value);\\n\\t\\t\\t\\t\\treplacement = Console.ReadLine();\\n\\t\\t\\t\\t} while (string.IsNullOrEmpty(replacement) || string.IsNullOrWhiteSpace(replacement));\\n\\t\\t\\t\\tsb.Replace(nameMatch.Value, replacement);\\n\\t\\t\\t}\\n\\n\\t\\t\\tforeach (Match match in pattern.Matches(sb.ToString()))\\n\\t\\t\\t{\\n\\t\\t\\t\\treplacement = string.Empty;\\n\\t\\t\\t\\t// Guarantee we get a non-whitespace value for the replacement\\n\\t\\t\\t\\tdo\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tConsole.WriteLine(\\\"Enter value for: \\\" + match.Value);\\n\\t\\t\\t\\t\\treplacement = Console.ReadLine();\\n\\t\\t\\t\\t} while (string.IsNullOrEmpty(replacement) || string.IsNullOrWhiteSpace(replacement));\\n\\n\\t\\t\\t\\tint location = sb.ToString().IndexOf(match.Value);\\n\\t\\t\\t\\tsb.Remove(location, match.Value.Length).Insert(location, replacement);\\n\\t\\t\\t}\\n\\n\\t\\t\\tConsole.WriteLine(Environment.NewLine + Environment.NewLine + \\\"--[ Here's your story! ]--\\\");\\n\\t\\t\\tConsole.WriteLine(sb.ToString());\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(ns magic.rosetta\\n (:require [clojure.string :as str]))\\n\\n(defn mad-libs\\n \\\"Write a program to create a Mad Libs like story.\\n The program should read an arbitrary multiline story from input.\\n The story will be terminated with a blank line.\\n Then, find each replacement to be made within the story,\\n ask the user for a word to replace it with, and make all the replacements.\\n Stop when there are none left and print the final story.\\n The input should be an arbitrary story in the form:\\n <name> went for a walk in the park. <he or she>\\n found a <noun>. <name> decided to take it home.\\n Given this example, it should then ask for a name,\\n a he or she and a noun (<name> gets replaced both times with the same value). \\\"\\n []\\n (let\\n [story (do\\n (println \\\"Please enter story:\\\")\\n (loop [story []]\\n (let [line (read-line)]\\n (if (empty? line)\\n (str/join \\\"\\\\n\\\" story)\\n (recur (conj story line))))))\\n tokens (set (re-seq #\\\"<[^<>]+>\\\" story))\\n story-completed (reduce\\n (fn [s t]\\n (str/replace s t (do\\n (println (str \\\"Substitute \\\" t \\\":\\\"))\\n (read-line))))\\n story\\n tokens)]\\n (println (str\\n \\\"Here is your story:\\\\n\\\"\\n \\\"------------------------------------\\\\n\\\"\\n story-completed))))\\n; Sample run at REPL:\\n;\\n; user=> (magic.rosetta/mad-libs)\\n; Please enter story:\\n; One day <who> wake up at <where>.\\n; <who> decided to <do something>.\\n; While <who> <do something>, strange man\\n; appears and gave <who> a <thing>.\\n\\n; Substitute <where>:\\n; Sweden\\n; Substitute <thing>:\\n; Nobel prize\\n; Substitute <who>:\\n; Bob Dylan\\n; Substitute <do something>:\\n; walk\\n; Here is your story:\\n; ------------------------------------\\n; One day Bob Dylan wake up at Sweden.\\n; Bob Dylan decided to walk.\\n; While Bob Dylan walk, strange man\\n; appears and gave Bob Dylan a Nobel prize.\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"10 rem mad lib for rosetta code\\n15 dim bf$(100),wd$(50),tg$(50):tb=49152\\n20 print chr$(147);chr$(14);\\\"Mad Lib Processor\\\":print\\n25 gosub 1000\\n30 gosub 100:gosub 250:gosub 300:gosub 400\\n40 print:print:print \\\"Again? \\\";:gosub 500:print k$\\n45 if k$<>\\\"y\\\" then end\\n50 goto 20\\n100 tg=1:for i=1 to bp:n$=\\\"\\\":mo=0\\n105 t$=bf$(i)\\n110 for j=1 to len(t$)\\n115 ch$=mid$(t$,j,1)\\n120 if ch$=\\\"<\\\" then mo=1:goto 140\\n125 if ch$=\\\">\\\" then mo=0:gosub 200:n$=n$+wd$:tg$=\\\"\\\":goto 140\\n130 if mo=0 then n$=n$+ch$\\n135 if mo=1 then tg$=tg$+ch$\\n140 next j\\n145 bf$(i)=n$\\n150 next i\\n155 return\\n200 for z=1 to tg\\n205 if tg$(z)=tg$ then wd$=wd$(z):return\\n210 next z\\n215 tg=tg+1:tg$(tg)=tg$\\n220 print \\\"Enter a \\\";tg$(tg);:input wd$\\n225 wd$(tg)=wd$\\n230 return\\n250 print chr$(147):print \\\"Processing...\\\":print\\n255 m=tb:os=0:ns=0:for i=1 to bp-1\\n260 t$=bf$(i)\\n265 for c=1 to len(t$):ch$=mid$(t$,c,1)\\n270 poke m,asc(ch$+chr$(0)):m=m+1:next c\\n275 next i:rem poke m,32:m=m+1\\n280 m=m-1:return\\n300 rem insert cr for word wrap\\n310 pt=tb:sz=0:ll=0\\n320 if peek(pt)=32 then gosub 350:if(ll+sz>39) then poke pt,13:ll=-1:sz=0\\n325 if peek(pt)=13 then ll=-1\\n330 if pt<>m then pt=pt+1:ll=ll+1:goto 320\\n340 return\\n350 rem look ahead to next space\\n355 nx=pt+1:sz=1\\n360 if peek(nx)=32 or peek(nx)=13 then return\\n365 nx=nx+1:sz=sz+1\\n370 if nx=m then return\\n375 goto 360\\n400 rem output memory buffer\\n401 ln=0:print chr$(147);\\n410 for i=tb to m:c=peek(i)\\n420 if c=13 then ln=ln+1\\n425 print chr$(c);\\n430 if ln=23 then ln=0:print:gosub 550\\n440 next i\\n450 return\\n500 rem clear buffer, wait for a key\\n501 get k$:if k$<>\\\"\\\" then 501\\n505 get k$:if k$=\\\"\\\" then 505\\n510 return\\n550 rem pause prompt\\n560 print\\\"[Pause]{CRSR-LEFT 7}\\\";\\n565 gosub 500\\n570 print\\\"{SPACE 7}{CRSR-LEFT 7}{CRSR-UP}\\\";\\n575 return\\n1000 rem load file\\n1005 bp=1\\n1010 print:input \\\"Enter name of file: \\\";fi$\\n1020 open 7,8,7,\\\"0:\\\"+fi$+\\\",s,r\\\"\\n1025 rem gosub 2000\\n1030 rem if er<>0 then print:gosub 2100:return\\n1035 get#7,a$\\n1036 ifa$=chr$(13)thenbf$(bp)=t$+a$:print\\\" \\\";:t$=\\\"\\\":bp=bp+1:goto 1040\\n1038 t$=t$+a$\\n1040 if (st and 64)=0 then goto 1035\\n1049 close 7:gosub 2000\\n1050 if er=0 then printchr$(147):return\\n1055 gosub 2100\\n1060 if er<>0 then goto 1000\\n1080 return\\n2000 rem check disk error\\n2001 open 15,8,15:input#15,er,en$,et$,es$:close15\\n2010 return\\n2100 rem print pretty error\\n2101 ca$=left$(en$,1):ca$=chr$(asc(ca$)+128):en$=ca$+right$(en$,len(en$)-1)\\n2105 print:print er;\\\"- \\\";en$;\\\" at .:\\\";et$;\\\" .:\\\";es$\\n2110 print:print \\\"Press a key.\\\":gosub 500\\n2115 return\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"import std.stdio, std.regex, std.algorithm, std.string, std.array;\\n\\nvoid main() {\\n writeln(\\\"Enter a story template, terminated by an empty line:\\\");\\n string story;\\n while (true) {\\n auto line = stdin.readln().strip();\\n if (line.empty) break;\\n story ~= line ~ \\\"\\\\n\\\";\\n }\\n\\n auto re = regex(\\\"<.+?>\\\", \\\"g\\\");\\n auto fields = story.match(re).map!q{a.hit}().array().sort().uniq();\\n foreach (field; fields) {\\n writef(\\\"Enter a value for '%s': \\\", field[1 .. $ - 1]);\\n story = story.replace(field, stdin.readln().strip());\\n }\\n\\n writeln(\\\"\\\\nThe story becomes:\\\\n\\\", story);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"-module(madlib).\\n-compile(export_all).\\n\\nmain() ->\\n main([]).\\n\\nmain([]) ->\\n madlib(standard_io);\\nmain([File]) ->\\n {ok, F} = file:open(File,read),\\n madlib(F).\\n\\nmadlib(Device) ->\\n {Dict, Lines} = parse(Device),\\n Substitutions = prompt(Dict),\\n print(Substitutions, Lines).\\n\\nprompt(Dict) ->\\n Keys = dict:fetch_keys(Dict),\\n lists:foldl(fun (K,D) ->\\n S = io:get_line(io_lib:format(\\\"Please name a ~s: \\\",[K])),\\n dict:store(K, lists:reverse(tl(lists:reverse(S))), D)\\n end, Dict, Keys).\\n\\nprint(Dict,Lines) ->\\n lists:foreach(fun (Line) ->\\n io:format(\\\"~s\\\",[substitute(Dict,Line)])\\n end, Lines).\\n\\nsubstitute(Dict,Line) ->\\n Keys = dict:fetch_keys(Dict),\\n lists:foldl(fun (K,L) ->\\n re:replace(L,K,dict:fetch(K,Dict),[global,{return,list}])\\n end, Line, Keys).\\n\\nparse(Device) ->\\n parse(Device, dict:new(),[]).\\n\\nparse(Device, Dict,Lines) ->\\n case io:get_line(Device,\\\"\\\") of\\n eof ->\\n {Dict, lists:reverse(Lines)};\\n \\\"\\\\n\\\" ->\\n {Dict, lists:reverse(Lines)};\\n Line ->\\n parse(Device, parse_line(Dict, Line), [Line|Lines])\\n end.\\n\\nparse_line(Dict, Line) ->\\n {match,Matches} = re:run(Line,\\\"<.*?>\\\",[global,{capture,[0],list}]),\\n lists:foldl(fun ([M],D) ->\\n dict:store(M,\\\"\\\",D)\\n end, Dict, Matches).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"68> madlib:main(\\\"test.mad\\\").\\nPlease name a <noun>: banana\\nPlease name a <name>: Jack\\nPlease name a <he or she>: She\\nJack went for a walk in the park. She\\nfound a banana. Jack decided to take it home.ok\\n69>\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"USING: formatting io kernel make regexp sequences sets splitting ;\\nIN: rosetta-code.mad-libs\\n\\n: get-mad-lib ( -- str )\\n \\\"Enter a mad lib. A blank line signals end of input.\\\" print\\n [\\n [ \\\"> \\\" write flush readln dup , empty? f t ? ] loop\\n ] { } make harvest \\\"\\\\n\\\" join ;\\n\\n: find-replacements ( str -- seq )\\n R/ <[\\\\w\\\\s]+>/ all-matching-subseqs members ;\\n\\n: query ( str -- str )\\n rest but-last \\\"Enter a(n) %s: \\\" printf flush readln ;\\n\\n: replacements ( str seq -- str )\\n dup [ query ] map [ replace ] 2each ;\\n\\n: mad-libs ( -- )\\n get-mad-lib dup find-replacements replacements nl print ;\\n\\nMAIN: mad-libs\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \" MODULE MADLIB\\t!Messing with COMMON is less convenient.\\n INTEGER MSG,KBD,INF\\t\\t!I/O unit numbers.\\n DATA MSG,KBD,INF/6,5,10/\\t\\t!Output, input, some disc file.\\n INTEGER LSTASH,NSTASH,MSTASH\\t!Prepare a common text stash.\\n PARAMETER (LSTASH = 246810, MSTASH = 6666)\\t!LSTASH characters for MSTASH texts.\\n CHARACTER*(LSTASH) STASH\\t\\t!The pool.\\n INTEGER ISTASH(MSTASH + 1)\\t!Fingers start positions, and thus end positions by extension.\\n DATA NSTASH,ISTASH(1)/0,1/\\t!Empty pool: no entries, first available character is at 1.\\n INTEGER MANYLINES,MANYTESTS\\t!I also want some lists of texts.\\n PARAMETER (MANYLINES = 1234)\\t!This is to hold the story.\\n INTEGER NSTORY,STORY(MANYLINES)\\t!Fingering texts in the stash.\\n PARAMETER (MANYTESTS = 1234)\\t!Likewise, some target/replacement texts.\\n INTEGER NTESTS,TARGET(MANYTESTS),REPLACEMENT(MANYTESTS)\\t!Thus.\\n DATA NSTORY,NTESTS/0,0/\\t\\t!No story lines, and no tests.\\n INTEGER STACKLIMIT\\t\\t!A recursion limit.\\n PARAMETER (STACKLIMIT = 28)\\t!This should suffice.\\n\\n CONTAINS\\n SUBROUTINE CROAK(GASP)\\t!A dying remark.\\n CHARACTER*(*) GASP\\t!The last words.\\n WRITE (MSG,*) \\\"Oh dear.\\\"\\t!Shock.\\n WRITE (MSG,*) GASP\\t\\t!Aargh!\\n STOP \\\"How sad.\\\"\\t\\t!Farewell, cruel world.\\n END SUBROUTINE CROAK\\t!Farewell...\\n\\n SUBROUTINE SHOWSTASH(BLAH,I)\\t!One might be wondering.\\n CHARACTER*(*) BLAH\\t\\t!An annotation.\\n INTEGER I\\t\\t\\t!The desired stashed text.\\n WRITE (MSG,1) BLAH,I,STASH(ISTASH(I):ISTASH(I + 1) - 1)\\t!Whee!\\n 1 FORMAT (A,': Text(',I0,')=\\\"',A,'\\\"')\\t!Hopefully, helpful.\\n END SUBROUTINE SHOWSTASH\\t!Ah, debugging.\\n\\n INTEGER FUNCTION EATTEXT(IN)\\t!Add a text to STASH and finger it.\\nCo-opts the as-yet unused space in STASH as its scratchpad.\\n INTEGER IN\\t!Input from this I/O unit number.\\n INTEGER I,N,L\\t!Fingers.\\n I = ISTASH(NSTASH + 1)!First available position in STASH.\\n N = LSTASH - I + 1\\t!Number of characters yet unused.\\n IF (N.LT.666) CALL CROAK(\\\"Insufficient STASH space remains!\\\")\\n READ (IN,1,END = 66) L,STASH(I:I + MIN(L,N) - 1)\\t!Calculated during the read.\\n 1 FORMAT (Q,A)\\t\\t!Obviously, Q = character count incoming, A = accept all of them.\\n L = I + MIN(L,N) - 1\\t!The last character read.\\n 10 IF (L.LT.I) GO TO 66\\t!A blank line! Deemed end-of-file.\\n IF (ICHAR(STASH(L:L)).LE.ICHAR(\\\" \\\")) THEN\\t!A trailing space?\\n L = L - 1\\t\\t!Yes. Pull back.\\n GO TO 10\\t\\t!And try again.\\n END IF\\t\\t!So much for trailing spaces.\\n IF (NSTASH.GE.MSTASH) CALL CROAK(\\\"Too many texts!\\\")\\n NSTASH = NSTASH + 1\\t!Admit another text.\\n ISTASH(NSTASH + 1) = L + 1\\t!The start point of the following text.\\n EATTEXT = NSTASH\\t!STASH(ISTASH(n):ISTASH(n + 1) - 1) has text n.\\n RETURN\\t\\t\\t!All well.\\n 66 EATTEXT = 0\\t\\t!Sez: \\\"No text\\\".\\n END FUNCTION EATTEXT\\t!Rather odd side effects.\\n\\n INTEGER FUNCTION ADDSTASH(TEXT)\\t!Appends an arbitrary text to the pool of stashed texts.\\n CHARACTER*(*) TEXT\\t!The stuff.\\n INTEGER I\\t\\t!A finger.\\n IF (NSTASH.GE.MSTASH) CALL CROAK(\\\"The text pool is crowded!\\\")\\t!Alas.\\n I = ISTASH(NSTASH + 1)\\t!First unused character.\\n IF (I + LEN(TEXT).GT.LSTASH) CALL CROAK(\\\"Overtexted!\\\")\\t!Alack.\\n STASH(I:I + LEN(TEXT) - 1) = TEXT\\t!Place.\\n NSTASH = NSTASH + 1\\t\\t\\t!Count in another entry.\\n ISTASH(NSTASH + 1) = I + LEN(TEXT)\\t!The new \\\"first available\\\" position.\\n ADDSTASH = NSTASH\\t!Pass a finger back to the caller.\\n END FUNCTION ADDSTASH\\t!Just an integer.\\n\\n INTEGER FUNCTION ANOTHER(TEXT)\\t!Possibly add TEXT to the table of target texts.\\nCollects TARGET REPLACEMENT pairs (increasing NTESTS) as directed by INSPECT.\\n CHARACTER*(*) TEXT\\t!The text of the target.\\n INTEGER I,IT\\t\\t!Steppers.\\n ANOTHER = 0\\t\\t!Possibly, the text is already in the table.\\n DO I = 1,NTESTS\\t!So, step through the known target texts.\\n IT = TARGET(I)\\t\\t!Finger a target text.\\n IF (TEXT.EQ.STASH(ISTASH(IT):ISTASH(IT + 1) - 1)) RETURN\\t!Already have this one.\\n END DO\\t\\t!Otherwise, try the next.\\n IF (NTESTS.GE.MANYTESTS) CALL CROAK(\\\"Too many tests!\\\")\\t!Oh dear.\\n NTESTS = NTESTS + 1\\t\\t!Count in another.\\n TARGET(NTESTS) = ADDSTASH(TEXT)!Stash its text and get a finger to it.\\n ANOTHER = NTESTS\\t\\t!My caller will want to know which test.\\n WRITE (MSG,1) TEXT\\t\\t!Now request the replacement text.\\n 1 FORMAT (\\\"Enter your text for \\\",A,\\\": \\\",$)\\t!Obviously, the $ indicates \\\"no new line\\\".\\n REPLACEMENT(NTESTS) = EATTEXT(KBD)\\t!Zero for \\\"no text\\\".\\n END FUNCTION ANOTHER\\t!Produces entries for TARGET and REPLACEMENT.\\n\\n SUBROUTINE INSPECT(X)\\t!Examine text number X for the special <...> sequence.\\nCalls for inspection of REPLACEMENT texts as well, should ANOTHER report a new entry.\\n INTEGER X\\t!Fingers the text in STASH via ISTASH(X).\\n INTEGER MARK\\t!Recalls where the < was found.\\n INTEGER IT,NEW\\t!Fingers to entries in STASH.\\n INTEGER I\\t!A stepper.\\n INTEGER SP,STACK(STACKLIMIT)\\t!Prepare for some recursion.\\n SP = 1\\t\\t!Start with the starter.\\n STACK(1) = X\\t\\t!Stack up.\\n DO WHILE(SP.GT.0)\\t!While texts are yet uninspected,\\n IT = STACK(SP)\\t\\t!Finger one.\\n SP = SP - 1\\t\\t\\t!Working down the stack.\\n MARK = 0\\t\\t\\t!Uninitialised variables are bad.\\n DO I = ISTASH(IT),ISTASH(IT + 1) - 1!Step through the stashed text.\\n IF (STASH(I:I).EQ.\\\"<\\\") THEN\\t!Is it the starter?\\n MARK = I\\t\\t\\t!Yes. Remember where it is.\\n ELSE IF (STASH(I:I).EQ.\\\">\\\") THEN\\t!The ender?\\n IF (MARK.LE.0) CALL CROAK(\\\"A > with no preceeding <!\\\")\\t!Bah.\\n NEW = ANOTHER(STASH(MARK:I))\\t!Consider the spanned text.\\n IF (NEW.GT.0) THEN\\t\\t!If that became a new table entry,\\n IF (SP.GE.STACKLIMIT) CALL CROAK(\\\"Stack overflow!\\\")\\t!Its replacement is to be inspected.\\n SP = SP + 1\\t\\t\\t!But I'm still busy with the current text.\\n STACK(SP) = REPLACEMENT(NEW)\\t!So, stack it for later.\\n END IF\\t\\t\\t!So much for that <...> apparition.\\n MARK = 0\\t\\t!Be ready to check afresh for the next.\\n END IF\\t\\t!So much for that character.\\n END DO\\t\\t!On to the next.\\n END DO\\t!So much for that stacked entry.\\n END SUBROUTINE INSPECT\\t!WRITESTORY will rescan the story lines.\\n\\n SUBROUTINE READSTORY(IN)!Read and stash the lines.\\n INTEGER IN\\t\\t!Input from here.\\n INTEGER LINE\\t\\t!A finger to the story line.\\n 10 LINE = EATTEXT(IN)\\t!So, grab a line.\\n IF (LINE.GT.0) THEN\\t!A live line?\\n NSTORY = NSTORY + 1\\t!Yes.Count it in.\\n STORY(NSTORY) = LINE\\t!Save it in the story list.\\n CALL INSPECT(LINE)\\t!Look for trouble as well.\\n GO TO 10\\t\\t!And go for the next line.\\n END IF\\t\\t\\t!Oh for while (Line:=EatText(in)) > 0 do SaveAndInspect(Line);\\n END SUBROUTINE READSTORY!Simple enough, anyway.\\n\\n SUBROUTINE WRITESTORY(WIDTH)\\t!Applying the replacements, with replacement replacement too.\\nCo-opts the as-yet unused space in STASH as its output scratchpad.\\nCan't rely on changing the index and bounds of a DO-loop on the fly.\\n INTEGER WIDTH\\n INTEGER LINE,IT,I,J\\t!Steppers.\\n INTEGER L,L0,N\\t\\t!Fingers.\\n INTEGER TAIL,MARK,LAST\\t!Scan choppers.\\n INTEGER SP,STACKI(STACKLIMIT),STACKL(STACKLIMIT)\\t!Ah, recursion.\\n L0 = ISTASH(NSTASH + 1)\\t!The first available place in the stash.\\n L = L0 - 1\\t\\t\\t!Syncopation for my output finger.\\n LL:DO LINE = 1,NSTORY\\t\\t!Step through the lines of the story.\\n SP = 0\\t\\t\\t!Start with the task in hand.\\n IT = STORY(LINE)\\t\\t!Finger the stashed line.\\n LAST = ISTASH(IT + 1) - 1\\t!Find its last character in STASH.\\n I = ISTASH(IT)\\t\\t!Find its first character in STASH.\\n TAIL = I - 1\\t\\t!Syncopation. No text from this line yet.\\n IF (STASH(I:I).LE.\\\" \\\") THEN\\t!The line starts with a space?\\n CALL BURP\\t\\t\\t!Yes. Flush, so as to start a new paragraph.\\n ELSE IF (LINE.GT.1) THEN\\t!Otherwise, the line is a continuation.\\n L = L + 1\\t\\t\\t!So, squeeze in a space as a separator.\\n STASH(L:L) = \\\" \\\"\\t\\t!Since its text follows on.\\n END IF\\t\\t\\t!Now for the content of the line.\\n 666 II:DO WHILE(I.LE.LAST)\\t\\t!Step along its text.\\n IF (STASH(I:I).EQ.\\\"<\\\") THEN\\t!Trouble starter?\\n MARK = I\\t\\t\\t!Yes. Remember where.\\n ELSE IF (STASH(I:I).EQ.\\\">\\\") THEN\\t!The corresponding ender?\\n CALL APPEND(TAIL + 1,MARK - 1)\\t!Waiting text up to the mark.\\n JJ:DO J = 1,NTESTS\\t\\t!Step through the target texts.\\n IT = TARGET(J)\\t\\t!Finger one.\\n IF (STASH(ISTASH(IT):ISTASH(IT + 1) - 1)\\t!Its stashed text.\\n 1 .EQ.STASH(MARK:I)) THEN\\t\\t!Matches the suspect text?\\n IT = REPLACEMENT(J)\\t\\t!Yes! Finger the replacement text.\\n IF (IT.GT.0) THEN\\t!Null replacements can be ignored.\\n IF (SP.GE.STACKLIMIT) CALL CROAK(\\\"StackOverflow!\\\")\\t!Always diff. messages.\\n SP = SP + 1\\t\\t!Interrupt the current scan.\\n STACKI(SP) = I\\t\\t!Remember where we're up to,\\n STACKL(SP) = LAST\\t\\t!And the end of the text.\\n I = ISTASH(IT) - 1\\t!One will be added shortly, at JJ+1.\\n LAST = ISTASH(IT + 1) - 1\\t!Preempt the scan-in-progress.\\n END IF\\t\\t\\t!To work along the replacement text.\\n EXIT JJ\\t\\t!Found the target, so the search is finished.\\n END IF\\t\\t!Otherwise,\\n END DO JJ\\t\\t!Try the next target text.\\n TAIL = I\\t\\t!Normal text resumes at TAIL + 1.\\n END IF\\t\\t\\t!Enough analysis of that character from the story line.\\n I = I + 1\\t\\t\\t!The next to consider.\\n END DO II\\t\\t!Perhaps we've finished this text.\\n IF (SP.GT.0) THEN\\t!Yes! But, were we interrupted in a previous scan?\\n CALL APPEND(TAIL + 1,LAST)!Yes! Roll the tail of the just-finished scan.\\n TAIL = STACKI(SP)\\t\\t!The stacked value of I was fingering a >.\\n LAST = STACKL(SP)\\t\\t!And this was the end of the text.\\n SP = SP - 1\\t\\t!So we've recovered where the scan was.\\n I = TAIL + 1\\t\\t!And this is the next to look at.\\n GO TO 666\\t\\t\\t!Proceed to do so.\\n END IF\\t\\t!But if all is unstacked,\\n CALL APPEND(TAIL + 1,LAST)\\t!Don't forget the tail end.\\n END DO LL\\t\\t\\t!On to the next story line.\\n CALL BURP\\t\\t!Any waiting text must be less than WIDTH.\\n CONTAINS\\t\\t!Some assistants, defined after usage...\\n SUBROUTINE APPEND(IST,LST)\\t!Has access to L.\\n INTEGER IST,LST\\t\\t!To copy STASH(IST:LST) to the scratchpad.\\n INTEGER N\\t\\t\\t!The number of characters to copy.\\n N = LST - IST + 1\\t\\t!So find out.\\n IF (N.LE.0) RETURN\\t\\t!Avoid relying on zero-length action.\\n IF (L + N.GT.LSTASH) CALL CROAK(\\\"Out of stash!\\\")\\t!Oh dear.\\n STASH(L + 1:L + N) = STASH(IST:LST)\\t!There they go.\\n L = L + N\\t\\t\\t!Advance my oputput finger.\\n IF (L - L0 + 1.GE.WIDTH) CALL BURP\\t!Enough to be going on with?\\n END SUBROUTINE APPEND\\t\\t!Few invocations, if with tricky parameters.\\n SUBROUTINE BURP\\t\\t!Flushes forth up to WIDTH characters.\\n INTEGER N,W,L1\\t\\t!And slides any remnant back.\\n N = L - L0 + 1\\t\\t!So, how many characters are waiting?\\n IF (N.LE.WIDTH) THEN\\t!Too many for one line of output?\\n L1 = L\\t\\t\\t!Nope. Roll the lot.\\n ELSE\\t\\t\\t!Otherwise, a partial flush.\\n W = L0 + WIDTH - 1\\t!Last character that can be fitted into WIDTH.\\n DO L1 = W,L0,-1\\t\\t!Look for a good split.\\n IF (STASH(L1:L1).LE.\\\" \\\") EXIT\\t!Like, at a space.\\n END DO\\t\\t\\t!Keep winding back.\\n IF (L1.LE.L0) L1 = W\\t!No pleasing split found. Just roll a full width.\\n END IF\\t\\t\\t!Ready to roll.\\n WRITE (MSG,\\\"(A)\\\") STASH(L0:L1)\\t!Thus!\\n IF (N.LE.WIDTH) THEN\\t!If the whole text was written,\\n L = L0 - 1\\t\\t!Then there is no text in the scratchpad.\\n ELSE\\t\\t\\t!If only L0:L1 were written of L0:L,\\n W = L0 + L - L1 - 1\\t!How far will the remaining text extend?\\n STASH(L0:W) = STASH(L1 + 1:L)\\t!Shift it.\\n L = W\\t\\t\\t!Finger the last used character position.\\n END IF\\t\\t\\t!One trim is enough, even if the scracchpad contains multiple widths' worth..\\n END SUBROUTINE BURP\\t\\t!Since I don't want to flush the lot.\\n END SUBROUTINE WRITESTORY\\t!Just a sequence of lines.\\n END MODULE MADLIB\\t\\t!Enough of that.\\n\\n PROGRAM MADLIBBER\\t!See, for example, https://en.wikipedia.org/wiki/Mad_Libs\\n USE MADLIB\\n WRITE (MSG,1)\\t!It's polite to explain.\\n 10FORMAT (\\\"Reads a story in template form, containing special \\\",\\n 1 \\\"entries such as <dog's name> amongst the text.\\\",/,\\n 2 \\\"You will be invited to supply a replacement text for each \\\"\\n 3 \\\"such entry, as encountered,\\\",/,\\n 4 \\\"after which the story will be presented with your \\\",\\n 5 \\\"substitutions made.\\\",//,\\n 6 \\\"Here goes... Reading file Madlib.txt\\\",/)\\n OPEN(INF,STATUS=\\\"OLD\\\",ACTION=\\\"READ\\\",FORM=\\\"FORMATTED\\\",\\n 1 FILE = \\\"Madlib.txt\\\")\\n CALL READSTORY(INF)\\n CLOSE(INF)\\n WRITE (MSG,*)\\n WRITE (MSG,*) \\\" Righto!\\\"\\n WRITE (MSG,*)\\n CALL WRITESTORY(66)\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Dim As String con, cadena\\ncadena = \\\"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\\\"\\nDim As Integer k = Instr(cadena, \\\"<\\\")\\n\\nPrint \\\"La historia: \\\"\\nPrint cadena & Chr(10)\\nWhile k\\n Dim As String reemplaza = Mid(cadena, k, Instr(cadena, \\\">\\\") - k + 1)\\n Print \\\"What should replace \\\"; reemplaza; : Input con\\n While k\\n cadena = Left(cadena, k-1) & con & Mid(cadena, k + Len(reemplaza))\\n k = Instr(k, cadena, reemplaza)\\n Wend\\n k = Instr(cadena, \\\"<\\\")\\nWend\\nPrint Chr(10) & \\\"La historia final: \\\"\\nPrint cadena & Chr(10)\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bufio\\\"\\n \\\"fmt\\\"\\n \\\"io/ioutil\\\"\\n \\\"log\\\"\\n \\\"os\\\"\\n \\\"regexp\\\"\\n \\\"strings\\\"\\n)\\n\\nfunc main() {\\n pat := regexp.MustCompile(\\\"<.+?>\\\")\\n if len(os.Args) != 2 {\\n fmt.Println(\\\"usage: madlib <story template file>\\\")\\n return\\n }\\n b, err := ioutil.ReadFile(os.Args[1])\\n if err != nil {\\n log.Fatal(err)\\n }\\n tmpl := string(b)\\n s := []string{} // patterns in order of appearance\\n m := map[string]string{} // mapping from patterns to replacements\\n for _, p := range pat.FindAllString(tmpl, -1) {\\n if _, ok := m[p]; !ok {\\n m[p] = \\\"\\\"\\n s = append(s, p)\\n }\\n }\\n fmt.Println(\\\"Enter replacements:\\\")\\n br := bufio.NewReader(os.Stdin)\\n for _, p := range s {\\n for {\\n fmt.Printf(\\\"%s: \\\", p[1:len(p)-1])\\n r, isPre, err := br.ReadLine()\\n if err != nil {\\n log.Fatal(err)\\n }\\n if isPre {\\n log.Fatal(\\\"you're not playing right. :P\\\")\\n }\\n s := strings.TrimSpace(string(r))\\n if s == \\\"\\\" {\\n fmt.Println(\\\" hmm?\\\")\\n continue\\n }\\n m[p] = s\\n break\\n }\\n }\\n fmt.Println(\\\"\\\\nYour story:\\\\n\\\")\\n fmt.Println(pat.ReplaceAllStringFunc(tmpl, func(p string) string {\\n return m[p]\\n }))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import System.IO (stdout, hFlush)\\n\\nimport System.Environment (getArgs)\\n\\nimport qualified Data.Map as M (Map, lookup, insert, empty)\\n\\ngetLines :: IO [String]\\ngetLines = reverse <$> getLines_ []\\n where\\n getLines_ xs = do\\n line <- getLine\\n case line of\\n [] -> return xs\\n _ -> getLines_ $ line : xs\\n\\nprompt :: String -> IO String\\nprompt p = putStr p >> hFlush stdout >> getLine\\n\\ngetKeyword :: String -> Maybe String\\ngetKeyword ('<':xs) = getKeyword_ xs []\\n where\\n getKeyword_ [] _ = Nothing\\n getKeyword_ (x:'>':_) acc = Just $ '<' : reverse ('>' : x : acc)\\n getKeyword_ (x:xs) acc = getKeyword_ xs $ x : acc\\ngetKeyword _ = Nothing\\n\\nparseText :: String -> M.Map String String -> IO String\\nparseText [] _ = return []\\nparseText line@(l:lx) keywords =\\n case getKeyword line of\\n Nothing -> (l :) <$> parseText lx keywords\\n Just keyword -> do\\n let rest = drop (length keyword) line\\n case M.lookup keyword keywords of\\n Nothing -> do\\n newword <- prompt $ \\\"Enter a word for \\\" ++ keyword ++ \\\": \\\"\\n rest_ <- parseText rest $ M.insert keyword newword keywords\\n return $ newword ++ rest_\\n Just knownword -> do\\n rest_ <- parseText rest keywords\\n return $ knownword ++ rest_\\n\\nmain :: IO ()\\nmain = do\\n args <- getArgs\\n nlines <-\\n case args of\\n [] -> unlines <$> getLines\\n arg:_ -> readFile arg\\n nlines_ <- parseText nlines M.empty\\n putStrLn \\\"\\\"\\n putStrLn nlines_\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\n ml := \\\"<name> went for a walk in the park. There <he or she> _\\n found a <noun>. <name> decided to take it home.\\\" # sample\\n MadLib(ml) # run it\\nend\\n\\nlink strings\\n\\nprocedure MadLib(story)\\n write(\\\"Please provide words for the following:\\\")\\n V := []\\n story ? while ( tab(upto('<')), put(V,tab(upto('>')+1)) )\\n every writes(v := !set(V),\\\" : \\\") do\\n story := replace(story,v,read())\\n write(\\\"\\\\nYour MadLib follows:\\\\n\\\",story)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"require 'general/misc/prompt regex'\\n\\nmadlib=:3 :0\\n smoutput 'Please enter the story template'\\n smoutput 'See http://rosettacode.org/wiki/Mad_Libs for details'\\n t=.''\\n while.#l=.prompt '' do. t=.t,l,LF end.\\n repl=. ~.'<[^<>]*>' rxall t\\n for_bef. repl do.\\n aft=. prompt (}.}:;bef),': '\\n t=.t rplc bef,<aft\\n end.\\n t\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" madlib''\\nPlease enter the story template\\nSee http://rosettacode.org/wiki/Mad_Libs for details\\n<name> went for a walk in the park. <he or she>\\nfound a <noun>. <name> decided to take it home.\\n\\nname: Jill\\nhe or she: she\\nnoun: rock\\nJill went for a walk in the park. she\\nfound a rock. Jill decided to take it home.\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.*;\\n\\npublic class MadLibs {\\n\\n public static void main(String[] args){\\n Scanner input = new Scanner(System.in);\\n\\n String name, gender, noun;\\n\\n System.out.print(\\\"Enter a name: \\\");\\n name = input.next();\\n\\n System.out.print(\\\"He or she: \\\");\\n gender = input.next();\\n\\n System.out.print(\\\"Enter a noun: \\\");\\n noun = input.next();\\n\\n System.out.println(\\\"\\\\f\\\" + name + \\\" went for a walk in the park. \\\" + gender + \\\"\\\\nfound a \\\" + noun + \\\". \\\" + name + \\\" decided to take it home.\\\");\\n\\n\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function madlibs(template)\\n println(\\\"The story template is:\\\\n\\\", template)\\n fields = Set(getfield.(collect(eachmatch(r\\\"<[^>]+>\\\", template)), :match))\\n print(\\\"\\\\nInput a comma-separated list of words to replace the following items:\\\",\\n join(fields, \\\", \\\"), \\\"\\\\n -> \\\")\\n values = split(readline(STDIN), \\\",\\\")\\n for (m, v) in zip(fields, values)\\n template = replace(template, m, v)\\n end\\n println(\\\"\\\\nThe story becomes:\\\\n\\\", template)\\nend\\n\\nconst template = \\\"\\\"\\\"\\n<name> went for a walk in the park. <he or she>\\nfound a <noun>. <name> decided to take it home.\\n\\\"\\\"\\\"\\n\\nmadlibs(template)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nfun main(args: Array<String>) {\\n println(\\\"Please enter a multi-line story template terminated by a blank line\\\\n\\\")\\n val sb = StringBuilder()\\n while (true) {\\n val line = readLine()!!\\n if (line.isEmpty()) break\\n sb.append(\\\"$line\\\\n\\\") // preserve line breaks\\n }\\n var story = sb.toString()\\n // identify blanks\\n val r = Regex(\\\"<.*?>\\\")\\n val blanks = r.findAll(story).map { it.value }.distinct()\\n println(\\\"Please enter your replacements for the following 'blanks' in the story:\\\")\\n for (blank in blanks) {\\n print(\\\"${blank.drop(1).dropLast(1)} : \\\")\\n val repl = readLine()!!\\n story = story.replace(blank, repl)\\n }\\n println(\\\"\\\\n$story\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"temp$=\\\"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\\\"\\nk = instr(temp$,\\\"<\\\")\\nwhile k\\n replace$ = mid$(temp$,k,instr(temp$,\\\">\\\")-k + 1)\\n print \\\"Replace:\\\";replace$;\\\" with:\\\"; :input with$\\n while k\\n temp$ = left$(temp$,k-1) + with$ + mid$(temp$,k + len(replace$))\\n k = instr(temp$,replace$,k)\\n wend\\nk = instr(temp$,\\\"<\\\")\\nwend\\nprint temp$\\nwait\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"print(\\\"Enter a multi-line story (finish with blank line):\\\")\\ndict, story, line = {}, \\\"\\\", io.read()\\nwhile #line>0 do story=story..line..\\\"\\\\n\\\" line=io.read() end\\nstory = story:gsub(\\\"(%<.-%>)\\\", function(what)\\n if dict[what] then return dict[what] end\\n io.write(\\\"Please enter a \\\" .. what .. \\\": \\\")\\n dict[what] = io.read()\\n return dict[what]\\n end)\\nprint(\\\"\\\\n\\\"..story)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"text = Import[\\n InputString[\\\"Enter the filename of the story template:\\\"]];\\nanswers =\\n AssociationMap[\\n InputString[\\n \\\"Enter a\\\" <>\\n If[StringMatchQ[#,\\n \\\"<\\\" ~~ Alternatives @@ Characters[\\\"aeiou\\\"] ~~ ___], \\\"n\\\", \\\"\\\"] <>\\n \\\" \\\" <> StringTrim[#, \\\"<\\\" | \\\">\\\"] <> \\\":\\\"] &,\\n Union[StringCases[text, RegularExpression[\\\"<[^>]+>\\\"]]]];\\nPrint[StringReplace[text, Normal[answers]]];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"def madlib(template)\\n // loop through and find/remove all of the replacements\\n replacements = {}\\n ind = 0\\n while ind < len(template)\\n // check if we have found a replacement to perform\\n if template[ind] = \\\"<\\\"\\n // get the name of the replacement and add it to the list\\n // if we haven't already encountered it\\n ind += 1\\n replace_name = \\\"\\\"\\n while template[ind] != \\\">\\\"\\n replace_name += template[ind]\\n ind += 1\\n end while\\n\\n if not replace_name in replacements\\n replacements.append(replace_name)\\n end if\\n ind += 1\\n else\\n ind += 1\\n end if\\n end while\\n\\n // prompt the user for replacement values\\n replacement_values = {}\\n for phrase in replacements\\n replacement_values.append(input(\\\"enter \\\" + phrase + \\\": \\\"))\\n end for\\n println\\n\\n // make replacements and output the story\\n ind = 0\\n while ind < len(template)\\n // check if we have found a replacement to perform\\n if template[ind] = \\\"<\\\"\\n // get the name of the replacement\\n ind += 1\\n replace_name = \\\"\\\"\\n while template[ind] != \\\">\\\"\\n replace_name += template[ind]\\n ind += 1\\n end while\\n\\n // output the replacement\\n print replacement_values[replacements[replace_name]]\\n ind += 1\\n else\\n print template[ind]\\n ind += 1\\n end if\\n end while\\nend madlib\\n\\nmadlib(\\\"<name> went for a walk in the park. <he or she> \\\" + \\\\\\n \\\"found a <noun>. <name> decided to take it home.\\\")\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"import rdstdin, re, algorithm, sequtils, strutils\\n\\n#let templ = readLineFromStdin \\\"Enter your story: \\\"\\nconst templ = \\\"\\\"\\\"<name> went for a walk in the park. <he or she>\\nfound a <noun>. <name> decided to take it home.\\\"\\\"\\\"\\n\\necho \\\"The story template is:\\\\n\\\", templ\\nvar fields = templ.findAll re\\\"<[^>]+>\\\"\\nfields.sort(cmp)\\nfields = deduplicate fields\\nlet values = readLineFromStdin(\\\"\\\\nInput a comma-separated list of words to replace the following items\\\\n \\\" & fields.join(\\\",\\\") & \\\": \\\").split(\\\",\\\")\\n\\nvar story = templ\\nfor f,v in zip(fields, values).items:\\n story = story.replace(f, v)\\necho \\\"\\\\nThe story becomes:\\\\n\\\\n\\\", story\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \": madlibs\\n| story i word |\\n\\n \\\"\\\" while(System.Console askln dup notEmpty) [ + ] drop ->story\\n\\n while(story indexOf('<') dup ->i notNull) [\\n story extract(i, story indexOfFrom('>', i)) ->word\\n story replaceAll(word, \\\"Word for\\\" . word . System.Console askln) ->story\\n ]\\t\\n\\n \\\"Your story :\\\" . story println ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"Program Madlib; Uses DOS, crt; {See, for example, https://en.wikipedia.org/wiki/Mad_Libs}\\n{Reads the lines of a story but which also contain <xxx> sequences. For each value of xxx,\\n found as the lines of the story are read, a request is made for a replacement text.\\n The story is then written out with the corresponding replacements made.}\\n{Concocted by R.N.McLean (whom God preserve), Victoria university, NZ.}\\n Procedure Croak(gasp: string); {A dying message.}\\n Begin\\n Writeln(' Eurghfff...');\\n Writeln(Gasp);\\n HALT;\\n End;\\n var inf: text; {Drivelstuff.}\\n const StoryLimit = 66;TableLimit = 65;\\t\\t{Big enough.}\\n var Story: array[1..StoryLimit] of string;\\t{Otherwise, use a temporary disc file.}\\n var Target,Replacement: array[1..TableLimit] of string;\\n var StoryLines,TableCount: integer;\\t\\t{Usage.}\\n\\n Function Reading(var inf: text;var Aline: string): boolean;\\n Begin\\n Aline:='';\\n Reading:=true;\\n if eoln(inf) then Reading:=false\\t{Agh! Why can't the read statement return true/false?}\\n else ReadLn(inf,Aline);\\n if Aline = '' then Reading:=false;\\t{Specified that a blank line ends the story.}\\n End;\\n\\n Procedure Inspect(text: string); Forward;{I'd rather have multi-pass compilation than deal with this.}\\n\\n Procedure Table(it: string);\\t{Check it as a target, and obtain its replacement.}\\n var i: integer;\\t{A stepper.}\\n Begin\\n for i:=1 to TableCount do if it = Target[i] then exit;\\t{Already in the table?}\\n if TableCount >= TableLimit then Croak('Too many table entries!');\\t{No. Room for another?}\\n inc(TableCount);\\t\\t\\t\\t{Yes.}\\n Target[TableCount]:=it;\\t\\t\\t{Include the < and > to preclude partial matches.}\\n write('Enter your text for ',it,': ');\\t{Pretty please?}\\n readln(Replacement[TableCount]);\\t\\t{Thus.}\\n Inspect(Replacement[TableCount]);\\t\\t{Enable full utilisation.}\\n End; {of Table.}\\n\\n var InDeep: integer;\\t{Counts inspection recursion.}\\n Procedure Inspect(text: string);\\t\\t{Look for <...> in text.}\\n var i: integer;\\t{A stepper.}\\n var mark: integer;\\t{Fingers the latest < in Aline.}\\n Begin\\n inc(InDeep);\\t\\t{Supply an opportunity, and fear the possibilities.}\\n if InDeep > 28 then Croak('Excessive recursion! Inspecting ' + text);\\n for i:=1 to Length(text) do\\t{Now scan the line for trouble.}\\n if text[i] = '<' then mark:=i\\t{Trouble starts here? Just mark its place.}\\n else if text[i] = '>' then\\t{Trouble ends here?}\\n Table(copy(text,mark,i - mark + 1));\\t{Deal with it.}\\n dec(InDeep);\\t\\t{I'm done.}\\n End; {of Inspect.}\\n\\n Procedure Swallow(Aline: string);\\t{Add a line to the story, and inspect it for <...>.}\\n Begin\\n if StoryLines >= StoryLimit then Croak('Too many lines in the story!');\\t{Suspicion forever.}\\n inc(StoryLines);\\t\\t{Otherwise, this is safe.}\\n Story[StoryLines]:=Aline;\\t{So save another line.}\\n Inspect(Aline);\\t\\t{Look for any <...> inclusions.}\\n End; {of Swallow.}\\n\\n var Rolling: integer;\\t\\t{Counts rolling rolls.}\\n Procedure Roll(bumf: string);\\t{Write a line, with amendments.}\\n var last,mark: integer;\\t{Fingers for the scan.}\\n var hit: string;\\t\\t{Copied once.}\\n var i,it: integer;\\t\\t{Steppers.}\\n label hic;\\t{Oh dear.}\\n Begin\\n inc(Rolling);\\t{Here I go.}\\n if Rolling > 28 then Croak('Excessive recursion! Rolling ' + bumf);\\t{Self-expansion is out.}\\n last:=0;\\t\\t\\t{Where the previous text ended.}\\n for i:=1 to Length(bumf) do\\t{Scan the text.}\\n if bumf[i] = '<' then mark:=i\\t{Remember where a <...> starts.}\\n else if bumf[i] = '>' then\\t\\t{So that when the stopper is found,}\\n begin\\t\\t\\t\\t{It can be recognised.}\\n Write(copy(bumf,last + 1,mark - last - 1));\\t{Text up to the <.}\\n hit:=copy(bumf,mark,i - mark + 1);\\t{Grab this once.}\\n for it:=1 to TableCount do\\t{Search my table.}\\n if Target[it] = hit then\\t{A match?}\\n begin\\t\\t\\t\\t{Yes!}\\n Roll(Replacement[it]);\\t{Write this instead.}\\n goto hic;\\t\\t\\t{There is no \\\"exit loop\\\" style statement.}\\n end;\\t\\t\\t\\t{\\\"Exit\\\" exits the procedure or function.}\\n hic:last:=i;\\t\\t{Advance the trailing finger.}\\n end;\\t{On to the next character.}\\n Write(copy(bumf,last + 1,Length(bumf) - last));\\t{Text after the last >, possibly null.}\\n dec(Rolling);\\t\\t\\t{I'm done.}\\n if Rolling <= 0 then WriteLn;\\t{And if this is the first level, add a end-of-line.}\\n End;\\t{of Roll.}\\n\\n var inname: string;\\t{For a file name.}\\n var Aline: string;\\t{A scratchpad.}\\n var i: integer;\\t{A stepper.}\\n BEGIN\\n InDeep:=0;\\t\\t{No inspections yet.}\\n Rolling:=0;\\t\\t{No output.}\\n inname:=ParamStr(1);\\t{Perhaps the file name is specified as a run-time parameter.}\\n if inname = '' then inname:='Madlib.txt';\\t{If not, this will do.}\\n Assign(inf,inname); Reset(inf);\\t\\t{Open the input file.}\\n StoryLines:=0; TableCount:=0;\\t\\t\\t{Prepare the counters.}\\n while reading(inf,Aline) do Swallow(Aline);\\t{Read and inspect the story.}\\n close(inf);\\t\\t\\t\\t\\t{Finished with input.}\\n for i:=1 to StoryLines do Roll(Story[i]);\\t{Write the amended story.}\\n END.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\nuse warnings;\\nuse strict;\\n\\nmy $template = shift;\\nopen my $IN, '<', $template or die $!;\\nmy $story = do { local $/ ; <$IN> };\\n\\nmy %blanks;\\nundef $blanks{$_} for $story =~ m/<(.*?)>/g;\\n\\nfor my $blank (sort keys %blanks) {\\n print \\\"$blank: \\\";\\n chomp (my $replacement = <>);\\n $blanks{$blank} = $replacement;\\n}\\n\\n$story =~ s/<(.*?)>/$blanks{$1}/g;\\nprint $story;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- file i/o, prompt_string</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">mlfile</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- eg story.txt</span>\\n <span style=\\\"color: #000000;\\\">mltxt</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;\\\">mlfile</span><span style=\\\"color: #0000FF;\\\">)?</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">read_lines</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">mlfile</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">):</span><span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n <name> went for a walk in the park. <he or she>\\n found a <noun>. <name> decided to take it home.\\n \\\"\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">strings</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span> <span style=\\\"color: #000000;\\\">replacements</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">startpos</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">endpos</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</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;\\\">startpos</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;\\\">mltxt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">endpos</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">startpos</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: #000000;\\\">endpos</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;\\\">mltxt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">startpos</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">endpos</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;\\\">\\\"missing >\\\"</span> <span style=\\\"color: #7060A8;\\\">abort</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: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">mltxt</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">startpos</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">endpos</span><span style=\\\"color: #0000FF;\\\">]</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;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">strings</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">strings</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">strings</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">replacements</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">replacements</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">prompt_string</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Enter replacement for %s:\\\"</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;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</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;\\\">substitute_all</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">mltxt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">strings</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">replacements</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: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">mltxt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n <name> went for a walk in the park. <he or she>\\n found a <noun>. <name> decided to take it home.\\n \\\"\\\"\\\"</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">strings</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"<name>\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"<he or she>\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"<noun>\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000000;\\\">replacements</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"Pete\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"He\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Rosetta Code Task\\\"</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">startpos</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">endpos</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</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;\\\">startpos</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;\\\">mltxt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">endpos</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">startpos</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: #000000;\\\">endpos</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;\\\">mltxt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">startpos</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">endpos</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"missing >\\\"</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: #000000;\\\">mltxt</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">startpos</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">endpos</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">strings</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</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;\\\">substitute_all</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">mltxt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">strings</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">replacements</span><span style=\\\"color: #0000FF;\\\">))</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"\\\"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\\\"\\ntrue\\nwhile\\n \\\"<\\\" find dup var ini\\n if\\n \\\">\\\" find ini - 1 + ini swap slice var replace\\n \\\"Replace: \\\" replace \\\" with: \\\" chain chain input var with nl\\n true\\n while\\n replace with subst\\n replace find\\n endwhile\\n true\\n else\\n false\\n endif\\nendwhile\\nprint\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"import util.\\n\\ngo =>\\n Story = read_story(),\\n println(\\\"Fill in the proper values:\\\"),\\n nl,\\n Map = get_info(get_tags(Story)) ,\\n println(\\\"\\\\nHere is the story:\\\\n\\\"),\\n println(replace_tags(Story,Map)),\\n nl.\\n\\nread_story() = Story =>\\n println(\\\"Write the story template with <tag> for the tags and finish with an empty line.\\\"),\\n nl,\\n Story1 = read_line(),\\n while (Line = read_line(), Line != \\\"\\\")\\n Story1 := Story1 ++ \\\" \\\" ++ Line\\n end,\\n Story = Story1.\\n\\n%\\n% Get the tags between <...>.\\n%\\nget_tags(S) = Tags =>\\n Len = S.length,\\n StartPos = [P: {C,P} in zip(S,1..Len), C = '<'],\\n EndPos = [P: {C,P} in zip(S,1..Len), C = '>'],\\n Tags = [slice(S,Start,End) : {Start,End} in zip(StartPos,EndPos)].remove_dups().\\n\\n%\\n% Get the tag info from user and return a map\\n%\\nget_info(Tags) = Map =>\\n Map = new_map(),\\n foreach(Tag in Tags)\\n printf(\\\"%w: \\\", Tag),\\n Map.put(Tag,readln())\\n end.\\n\\n% Replace all the <tags> with user values.\\nreplace_tags(S,Map) = S =>\\n foreach(Tag=Value in Map)\\n S := replace_string(T,Tag,Value)\\n end.\\n\\n% Picat's replace/3 does not handle substrings well,\\n% so we roll our own...\\nreplace_string(List,Old,New) = Res =>\\n Res = copy_term(List),\\n while (find(Res,Old,_,_))\\n once(append(Before,Old,After,Res)),\\n Res := Before ++ New ++ After\\n end.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de madlib (Template)\\n (setq Template (split (chop Template) \\\"<\\\" \\\">\\\"))\\n (let (Reps () Text ())\\n (while Template\\n (push 'Text (pop 'Template))\\n (let? Rep (mapcar pack (split (pop 'Template) \\\":\\\"))\\n (if (assoc (car Rep) Reps)\\n (push 'Text (cdr @))\\n (until (and\\n (prin \\\"Gimme a(n) \\\" (or (cadr Rep) (car Rep)) \\\": \\\")\\n (clip (in NIL (line)))\\n (push 'Text @)\\n (push 'Reps (cons (car Rep) @)) )\\n (prinl \\\"Huh? I got nothing.\\\") ) ) ) )\\n (prinl (need 30 '-))\\n (prinl (flip Text)) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"#!/usr/bin/pike\\n\\nStdio.Readline readln = Stdio.Readline();\\n\\nvoid print_help()\\n{\\n write(#\\\"Write a Story.\\n\\nNames or objects in the story can be made variable by\\nreferencing them as <person> <object>, etc.\\nEnd the story with an empty line.\\n\\nType show to read the story. You will be asked to fill the variables,\\nand the the story will be shown.\\n\\nType help to see this message again.\\nType exit to quit.\\n\\n\\\");\\n}\\n\\nvoid add_line(string input)\\n{\\n array variables = parse_for_variables(input);\\n write(\\\"Found variables: %{\\\\\\\"%s\\\\\\\" %}\\\\n\\\", variables);\\n story += input+\\\"\\\\n\\\";\\n}\\n\\narray parse_for_variables(string input)\\n{\\n array vars = Array.flatten(array_sscanf(input, \\\"%*[^<>]%{<%[^<>]>%*[^<>]%}%*[^<>]\\\"));\\n return Array.uniq(vars);\\n}\\n\\nmapping fill_variables(string story)\\n{\\n array vars = parse_for_variables(story);\\n mapping variables = ([]);\\n foreach(vars;; string name)\\n {\\n string value = readln->read(sprintf(\\\"Please name a%s %s: \\\", (<'a','e','i','o','u'>)[name[1]]?\\\"\\\":\\\"n\\\", name));\\n if (value != \\\"\\\")\\n variables[\\\"<\\\"+name+\\\">\\\"] = value;\\n }\\n return variables;\\n}\\n\\nvoid show_story(string story)\\n{\\n mapping variables = fill_variables(story);\\n write(\\\"\\\\n\\\"+replace(story, variables));\\n}\\n\\nvoid do_exit()\\n{\\n exit(0);\\n}\\n\\nmapping functions = ([ \\\"help\\\":print_help,\\n \\\"show\\\":show_story,\\n \\\"exit\\\":do_exit,\\n ]);\\nstring story = \\\"\\\";\\n\\nvoid main()\\n{\\n Stdio.Readline.History readline_history = Stdio.Readline.History(512);\\n readln->enable_history(readline_history);\\n\\n string prompt=\\\"> \\\";\\n\\n print_help();\\n while(1)\\n {\\n string input=readln->read(prompt);\\n if(!input)\\n exit(0);\\n if(input == \\\"\\\")\\n show_story(story);\\n else if (functions[input])\\n functions[input]();\\n else add_line(input);\\n }\\n}\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"(stringrange, stringsize): /* 2 Nov. 2013 */\\nMad_Libs: procedure options (main);\\n declare (line, left, right) character (100) varying;\\n declare true bit(1) value ('1'b), false bit (1) value ('0'b);\\n declare name character (20) varying, seen_name bit (1) initial (false);\\n declare pronoun character (20) varying, seen_pronoun bit (1) initial (false);\\n declare noun character (20) varying, seen_noun bit (1) initial (false);\\n declare replaced_all bit (1);\\n declare in file input;\\n\\n open file (in) title ('/MADLIBS.DAT,type(text),recsize(100)');\\n\\n do forever;\\n get file (in) edit (line) (L);\\n if line = '' then leave;\\n\\n do until (replaced_all);\\n replaced_all = true;\\n if index(line, '<name>') > 0 then\\n if seen_name then\\n do until (index(line, '<name>') = 0);\\n call split(line, '<name>', left, right);\\n line = left || name || right;\\n replaced_all = false;\\n end;\\n else\\n do;\\n put skip list ('Please type a name:');\\n get edit (name) (L);\\n seen_name = true; replaced_all = false;\\n end;\\n if index(line, '<he or she>') > 0 then\\n if seen_pronoun then\\n do until (index(line, '<he or she>') = 0);\\n call split(line, '<he or she>', left, right);\\n line = left || pronoun || right;\\n replaced_all = false;\\n end;\\n else\\n do;\\n put skip list ('Please type a pronoun (he or she):');\\n get edit (pronoun) (L);\\n seen_pronoun = true; replaced_all = false;\\n end;\\n if index(line, '<noun>') > 0 then\\n if seen_noun then\\n do until (index(line, '<noun>') = 0);\\n call split(line, '<noun>', left, right);\\n line = left || noun || right;\\n replaced_all = false;\\n end;\\n else\\n do;\\n put skip list ('Please type a noun:');\\n get edit (noun) (L);\\n seen_noun = true; replaced_all = false;\\n end;\\n end;\\n put skip list (line);\\n end;\\n\\nsplit: procedure (line, text, Left, Right);\\n declare (line, text, left, right) character (*) varying;\\n declare i fixed binary;\\n\\n i = index(line, text);\\n left = substr(line, 1, i-1);\\n right = substr(line, i+length(text), length(line) - (i + length(text)) + 1 );\\nend split;\\n\\nend Mad_Libs;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"function New-MadLibs\\n{\\n [CmdletBinding(DefaultParameterSetName='None')]\\n [OutputType([string])]\\n Param\\n (\\n [Parameter(Mandatory=$false)]\\n [AllowEmptyString()]\\n [string]\\n $Name = \\\"\\\",\\n\\n [Parameter(Mandatory=$false, ParameterSetName='Male')]\\n [switch]\\n $Male,\\n\\n [Parameter(Mandatory=$false, ParameterSetName='Female')]\\n [switch]\\n $Female,\\n\\n [Parameter(Mandatory=$false)]\\n [AllowEmptyString()]\\n [string]\\n $Item = \\\"\\\"\\n )\\n\\n if (-not $Name)\\n {\\n $Name = (Get-Culture).TextInfo.ToTitleCase((Read-Host -Prompt \\\"`nEnter a name\\\").ToLower())\\n }\\n else\\n {\\n $Name = (Get-Culture).TextInfo.ToTitleCase(($Name).ToLower())\\n }\\n\\n if ($Male)\\n {\\n $pronoun = \\\"He\\\"\\n }\\n elseif ($Female)\\n {\\n $pronoun = \\\"She\\\"\\n }\\n else\\n {\\n $title = \\\"Gender\\\"\\n $message = \\\"Select $Name's Gender\\\"\\n $_male = New-Object System.Management.Automation.Host.ChoiceDescription \\\"&Male\\\", \\\"Selects male gender.\\\"\\n $_female = New-Object System.Management.Automation.Host.ChoiceDescription \\\"&Female\\\", \\\"Selects female gender.\\\"\\n $options = [System.Management.Automation.Host.ChoiceDescription[]]($_male, $_female)\\n $result = $host.UI.PromptForChoice($title, $message, $options, 0)\\n\\n switch ($result)\\n {\\n 0 {$pronoun = \\\"He\\\"}\\n 1 {$pronoun = \\\"She\\\"}\\n }\\n }\\n\\n if (-not $Item)\\n {\\n $Item = Read-Host -Prompt \\\"`nEnter an item\\\"\\n }\\n\\n \\\"`n{0} went for a walk in the park. {1} found a {2}. {0} decided to take it home.`n\\\" -f $Name, $pronoun, $Item\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"New-MadLibs -Name hank -Male -Item shank\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"New-MadLibs\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$paramLists = @(@{Name='mary'; Female=$true; Item=\\\"little lamb\\\"},\\n @{Name='hank'; Male=$true; Item=\\\"shank\\\"},\\n @{Name='foo'; Male=$true; Item=\\\"bar\\\"})\\n\\nforeach ($paramList in $paramLists)\\n{\\n New-MadLibs @paramList\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"If OpenConsole()\\n\\n cadena$ = \\\"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\\\"\\n k = FindString(cadena$, \\\"<\\\")\\n\\n PrintN(\\\"La historia: \\\")\\n Print(cadena$ + Chr(10))\\n While k\\n reemplaza$ = Mid(cadena$, k, FindString(cadena$, \\\">\\\") - k + 1)\\n Print(Chr(10) + \\\"What should replace \\\" + reemplaza$ + \\\" \\\")\\n con$ = Input ()\\n While k\\n cadena$ = Left(cadena$, k-1) + con$ + Mid(cadena$, k + Len(reemplaza$))\\n k = FindString(cadena$, reemplaza$, k)\\n Wend\\n k = FindString(cadena$, \\\"<\\\")\\n Wend\\n PrintN(Chr(10) + \\\"La historia final: \\\")\\n PrintN(cadena$)\\n Input()\\n CloseConsole()\\nEndIf\\nEnd\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import re\\n\\n# Optional Python 2.x compatibility\\n#try: input = raw_input\\n#except: pass\\n\\ntemplate = '''<name> went for a walk in the park. <he or she>\\nfound a <noun>. <name> decided to take it home.'''\\n\\ndef madlibs(template):\\n print('The story template is:\\\\n' + template)\\n fields = sorted(set( re.findall('<[^>]+>', template) ))\\n values = input('\\\\nInput a comma-separated list of words to replace the following items'\\n '\\\\n %s: ' % ','.join(fields)).split(',')\\n story = template\\n for f,v in zip(fields, values):\\n story = story.replace(f, v)\\n print('\\\\nThe story becomes:\\\\n\\\\n' + story)\\n\\nmadlibs(template)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"(define (get-mad-libs file)\\n (with-input-from-file file\\n (lambda ()\\n (for/fold ((text \\\"\\\"))\\n ((line (in-lines)))\\n (string-append text line \\\"\\\\n\\\")))))\\n\\n\\n(define (replace-context mad-libs)\\n (define matches\\n (regexp-match* #rx\\\"<[a-zA-Z0-9 ]*>\\\" mad-libs))\\n (map\\n (lambda (context)\\n (display (format \\\"~a?\\\" context))\\n (cons context (read-line)))\\n (remove-duplicates matches)))\\n\\n(define (play-mad-libs)\\n (display \\\"Tell me a file to play Mad Libs: \\\")\\n (define text (get-mad-libs (read-line)))\\n (define matches (replace-context text))\\n\\n (display\\n (for/fold ((mad-story text))\\n ((change (in-list matches)))\\n (string-replace mad-story (car change) (cdr change)))))\\n\\n(play-mad-libs)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"print S:g[ '<' (.*?) '>' ] = %.{$0} //= prompt \\\"$0? \\\" given slurp;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"t: {<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.}\\nview layout [a: area wrap t btn \\\"Done\\\" [x: a/text unview]]\\nparse x [any [to \\\"<\\\" copy b thru \\\">\\\" (append w: [] b)] to end]\\nforeach i unique w [replace/all x i ask join i \\\": \\\"] alert x\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \"phrase: ask \\\"Enter phrase, leave line empty to terminate:^/\\\"\\nwhile [not empty? line: input] [append phrase rejoin [\\\"^/\\\" line]]\\nwords: parse phrase [collect [any [to \\\"<\\\" copy b thru \\\">\\\" keep (b)]]]\\nforeach w unique words [replace/all phrase w ask rejoin [w \\\": \\\"]]\\nprint phrase\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"/*REXX program prompts the user for a template substitutions within a story (MAD LIBS).*/\\nparse arg iFID . /*allow user to specify the input file.*/\\nif iFID=='' | iFID==\\\",\\\" then iFID=\\\"MAD_LIBS.TXT\\\" /*Not specified? Then use the default.*/\\n@.= /*assign defaults to some variables. */\\n$=; do recs=1 while lines(iFID)\\\\==0 /*read the input file until it's done. */\\n @.recs=linein(iFID); $=$ @.recs /*read a record; and append it to @ */\\n if @.recs='' then leave /*Read a blank line? Then we're done.*/\\n end /*recs*/\\nrecs=recs-1 /*adjust for a E─O─F or a blank line.*/\\npm= 'please enter a word or phrase to replace: ' /*this is part of the Prompt Message. */\\n!.=0 /*placeholder for phrases in MAD LIBS.*/\\n#=0; do forever /*look for templates within the text. */\\n parse var $ '<' ? \\\">\\\" $ /*scan for <ααα> stuff in the text.*/\\n if ?='' then leave /*No ααα ? Then we're all finished.*/\\n if !.? then iterate /*Already asked? Then keep scanning. */\\n !.?=1 /*mark this ααα as being \\\"found\\\". */\\n do until ans\\\\='' /*prompt user for a replacement. */\\n say '───────────' pm ? /*prompt the user with a prompt message*/\\n parse pull ans /*PULL obtains the text from console. */\\n end /*forever*/\\n #=#+1 /*bump the template counter. */\\n old.# = '<'?\\\">\\\"; new.# = ans /*assign the \\\"old\\\" name and \\\"new\\\" name.*/\\n end /*forever*/\\nsay /*display a blank line for a separator.*/\\nsay; say copies('═', 79) /*display a blank line and a fence. */\\n\\n do m=1 for recs /*display the text, line for line. */\\n do n=1 for # /*perform substitutions in the text. */\\n @.m=changestr(old.n, @.m, new.n) /*maybe replace text in @.m haystack.*/\\n end /*n*/\\n say @.m /*display the (new) substituted text. */\\n end /*m*/\\n\\nsay copies('═', 79) /*display a final (output) fence. */\\nsay /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"temp=\\\"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\\\"\\nk = substr(temp,\\\"<\\\")\\nwhile k\\n replace = substr(temp,k,substr(temp,\\\">\\\")-k + 1)\\n see \\\"replace:\\\" + replace + \\\" with: \\\"\\n give with\\n while k\\n temp = left(temp,k-1) + with + substr(temp,k + len(replace))\\n k = substr(temp,replace)\\n end\\n k = substr(temp,\\\"<\\\")\\nend\\nsee temp + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"puts \\\"Enter a story, terminated by an empty line:\\\"\\nstory = \\\"\\\"\\nuntil (line = gets).chomp.empty?\\n story << line\\nend\\n\\nstory.scan(/(?<=[<]).+?(?=[>])/).uniq.each do |var|\\n print \\\"Enter a value for '#{var}': \\\"\\n story.gsub!(/<#{var}>/, gets.chomp)\\nend\\n\\nputs\\nputs story\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"temp$=\\\"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\\\"\\nk = instr(temp$,\\\"<\\\")\\nwhile k\\n replace$ = mid$(temp$,k,instr(temp$,\\\">\\\")-k + 1)\\n print \\\"Replace:\\\";replace$;\\\" with:\\\"; :input with$\\n while k\\n temp$ = left$(temp$,k-1) + with$ + mid$(temp$,k + len(replace$))\\n k = instr(temp$,replace$,k)\\n wend\\nk = instr(temp$,\\\"<\\\")\\nwend\\nprint temp$\\nwait\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"extern crate regex;\\n\\nuse regex::Regex;\\nuse std::collections::HashMap;\\nuse std::io;\\n\\nfn main() {\\n let mut input_line = String::new();\\n let mut template = String::new();\\n\\n println!(\\\"Please enter a multi-line story template with <parts> to replace, terminated by a blank line.\\\\n\\\");\\n loop {\\n io::stdin()\\n .read_line(&mut input_line)\\n .expect(\\\"The read line failed.\\\");\\n if input_line.trim().is_empty() {\\n break;\\n }\\n template.push_str(&input_line);\\n input_line.clear();\\n }\\n\\n let re = Regex::new(r\\\"<[^>]+>\\\").unwrap();\\n let mut parts: HashMap<_, _> = re\\n .captures_iter(&template)\\n .map(|x| (x.get(0).unwrap().as_str().to_string(), \\\"\\\".to_string()))\\n .collect();\\n if parts.is_empty() {\\n println!(\\\"No <parts> to replace.\\\\n\\\");\\n } else {\\n for (k, v) in parts.iter_mut() {\\n println!(\\\"Please provide a replacement for {}: \\\", k);\\n io::stdin()\\n .read_line(&mut input_line)\\n .expect(\\\"The read line failed.\\\");\\n *v = input_line.trim().to_string();\\n println!();\\n template = template.replace(k, v);\\n input_line.clear();\\n }\\n }\\n println!(\\\"Resulting story:\\\\n\\\\n{}\\\", template);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object MadLibs extends App{\\n val input = \\\"<name> went for a walk in the park. <he or she>\\\\nfound a <noun>. <name> decided to take it home.\\\"\\n println(input)\\n println\\n\\n val todo = \\\"(<[^>]+>)\\\".r\\n val replacements = todo.findAllIn(input).toSet.map{found: String =>\\n found -> readLine(s\\\"Enter a $found \\\")\\n }.toMap\\n\\n val output = todo.replaceAllIn(input, found => replacements(found.matched))\\n println\\n println(output)\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst proc: main is func\\n local\\n var string: story is \\\"\\\";\\n var string: line is \\\"\\\";\\n var integer: pos1 is 0;\\n var integer: pos2 is 1;\\n var string: field is \\\"\\\";\\n begin\\n writeln(\\\"Enter a story template, terminated by an empty line:\\\");\\n repeat\\n readln(line);\\n if line <> \\\"\\\" then\\n story &:= line & \\\"\\\\n\\\";\\n end if;\\n until line = \\\"\\\";\\n pos1 := pos(story, '<');\\n while pos1 <> 0 and pos2 <> 0 do\\n pos2 := pos(story, '>', pos1);\\n if pos2 <> 0 then\\n field := story[pos1 .. pos2];\\n write(\\\"Enter a value for \\\" <& field <& \\\": \\\");\\n story := replace(story, field, getln(IN));\\n pos1 := pos(story, '<', pos1);\\n end if;\\n end while;\\n writeln;\\n writeln(\\\"The story becomes:\\\");\\n write(story);\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"var story = ARGF.slurp;\\n\\nvar blanks = Hash.new;\\nwhile (var m = /<(.*?)>/.gmatch(story)) {\\n blanks.append(m[0]);\\n}\\n\\nblanks.keys.sort.each { |blank|\\n var replacement = Sys.scanln(\\\"#{blank}: \\\");\\n blanks{blank} = replacement;\\n}\\n\\nprint story.gsub(/<(.*?)>/, {|s1| blanks{s1} });\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"SUB BETWEEN$(TXT$, LHS$, RHS$, AFTER)\\n\\tLET LHS = POS(TXT$, LHS$, AFTER)\\n\\tIF LHS = 0 THEN\\n\\t\\t'LHS$ NOT FOUND IN TXT$. RETURN EMPTY STRING\\n\\t\\tRETURN \\\"\\\"\\n\\t\\tEXIT SUB\\n\\tEND IF\\n\\tLET RHS = POS(TXT$, RHS$, LHS + LEN(LHS$))\\n\\tIF RHS = 0 THEN\\n\\t\\t'NO RHS$ FOUND IMMEDIATELY AFTER LHS$ IN TXT$. RETURN EMPTY STRING.\\n\\t\\tRETURN \\\"\\\"\\n\\t\\tEXIT SUB\\n\\tEND IF\\n\\tRETURN SEG$(TXT$, LHS + LEN(LHS$), RHS-1)\\nEND SUB\\n\\nDECLARE SUB REPLACE$(INTHIS$, FINDTHIS$, WITHTHIS$)\\n\\tLET T = POS(INTHIS$, FINDTHIS$)\\n\\tRETURN INTHIS$\\n\\tIF T <> 0 THEN\\n\\t\\tMID$(INTHIS$, T, LEN(FINDTHIS$)) = WITHTHIS$\\n\\t\\tRETURN INTHIS$\\n\\tEND IF\\nEND SUB\\n\\nLET STORY$ = \\\"\\\"\\nLET STORYLINE$ = \\\"\\\"\\nWHILE TRUE\\n\\tLINE INPUT \\\"Enter line of story (empty line to stop)\\\"; STORYLINE$\\n\\tIF STORYLINE$ = \\\"\\\" THEN\\n\\t\\tEXIT WHILE\\n\\tEND IF\\n\\tSTORY$ = STORY$ + \\\" \\\" + STORYLINE$\\nEND WHILE\\n\\nWHILE TRUE\\n\\tLET TXT$ = \\\"\\\"\\n\\tLET KEY$ = BETWEEN$(STORY$, \\\"<\\\", \\\">\\\", 0)\\n\\tIF KEY$ <> \\\"\\\" THEN\\n\\t\\tPRINT \\\"PLEASE ENTER A \\\" + KEY$;\\n\\t\\tLINE INPUT TXT$\\n\\t\\tLET SRCH$ = \\\"<\\\" + KEY$ + \\\">\\\"\\n\\t\\tSTORY$ = REPLACE$(STORY$, SRCH$, TXT$)\\n\\tELSE\\n\\t\\tEXIT WHILE\\n\\tEND IF\\nEND WHILE\\n\\nPRINT STORY$\\n\",\n \"language\": \"Tbas\"\n },\n {\n \"code\": \"package require Tcl 8.5\\n\\n# Read the template...\\nputs [string repeat \\\"-\\\" 70]\\nputs \\\"Enter the story template, ending with a blank line\\\"\\nwhile {[gets stdin line] > 0} {\\n append content $line \\\"\\\\n\\\"\\n}\\n\\n# Read the mapping...\\nputs [string repeat \\\"-\\\" 70]\\nset mapping {}\\nforeach piece [regexp -all -inline {<[^>]+>} $content] {\\n if {[dict exists $mapping $piece]} continue\\n puts -nonewline \\\"Give me a $piece: \\\"\\n flush stdout\\n dict set mapping $piece [gets stdin]\\n}\\n\\n# Apply the mapping and print...\\nputs [string repeat \\\"-\\\" 70]\\nputs -nonewline [string map $mapping $content]\\nputs [string repeat \\\"-\\\" 70]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"Function mad_libs(s)\\n Do\\n If InStr(1,s,\\\"<\\\") <> 0 Then\\n start_position = InStr(1,s,\\\"<\\\") + 1\\n end_position = InStr(1,s,\\\">\\\")\\n parse_string = Mid(s,start_position,end_position-start_position)\\n WScript.StdOut.Write parse_string & \\\"? \\\"\\n input_string = WScript.StdIn.ReadLine\\n s = Replace(s,\\\"<\\\" & parse_string & \\\">\\\",input_string)\\n Else\\n Exit Do\\n End If\\n Loop\\n mad_libs = s\\nEnd Function\\n\\nWScript.StdOut.Write mad_libs(\\\"<name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home.\\\")\\nWScript.StdOut.WriteLine\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"Imports System.Text\\n\\nModule Program\\n Private Function GetStory() As String\\n Dim input As New StringBuilder()\\n Do\\n Dim nextLine = Console.ReadLine()\\n If String.IsNullOrEmpty(nextLine) Then Exit Do\\n input.AppendLine(nextLine)\\n Loop\\n\\n Dim story = input.ToString()\\n Return story\\n End Function\\n\\n Sub Main()\\n Dim input As String = GetStory()\\n\\n Dim result As New StringBuilder()\\n Dim replacements As New Dictionary(Of String, String)\\n\\n For i = 0 To input.Length - 1\\n Dim curChar = input(i)\\n\\n ' For all characters but '<', append it and move on.\\n If curChar <> \\\"<\\\"c Then\\n result.Append(curChar)\\n Else\\n ' If the character before was a backslash, then replace the backslash in the result with a '<' and move on.\\n If i > 0 AndAlso input(i - 1) = \\\"\\\\\\\"c Then\\n result(result.Length - 1) = \\\"<\\\"c\\n Continue For\\n End If\\n\\n ' Search for the first '>' that isn't preceded by a backslash.\\n Dim closeBracketPos = -1\\n For ind = i To input.Length - 1\\n If input(ind) = \\\">\\\"c AndAlso input(ind - 1) <> \\\"\\\\\\\"c Then\\n closeBracketPos = ind\\n Exit For\\n End If\\n Next\\n\\n ' The search failed to find a '>'.\\n If closeBracketPos < 0 Then\\n Console.WriteLine($\\\"ERROR: Template starting at position {i} is not closed.\\\")\\n Environment.Exit(-1)\\n End If\\n\\n ' The text between the current character and the found '>' character, with escape sequences simplified.\\n Dim key As String = input.Substring(i + 1, closeBracketPos - i - 1).Replace(\\\"\\\\>\\\", \\\">\\\", StringComparison.Ordinal)\\n\\n Dim subst As String = Nothing\\n ' Ask for and store a replacement value if there isn't already one for the key.\\n If Not replacements.TryGetValue(key, subst) Then\\n Console.Write($\\\"Enter a {key}: \\\")\\n subst = Console.ReadLine()\\n replacements.Add(key, subst)\\n End If\\n\\n result.Append(subst)\\n i = closeBracketPos\\n End If\\n Next\\n\\n Console.WriteLine()\\n Console.Write(result)\\n End Sub\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"io\\\" for Stdin, Stdout\\nimport \\\"./pattern\\\" for Pattern\\nimport \\\"./seq\\\" for Lst\\n\\nSystem.print(\\\"Please enter a multi-line story template terminated by a blank line:\\\\n\\\")\\nStdout.flush()\\nvar story = \\\"\\\"\\nwhile (true) {\\n var line = Stdin.readLine()\\n if (line.isEmpty) break\\n story = story + line + \\\"\\\\n\\\" // preserve line breaks\\n}\\n// identify blanks\\nvar p = Pattern.new(\\\"<+0^>>\\\")\\nvar blanks = Lst.distinct(p.findAll(story).map { |m| m.text }.toList)\\nSystem.print(\\\"Please enter your replacements for the following 'blanks' in the story:\\\")\\nfor (blank in blanks) {\\n System.write(\\\" %(blank[1..-2]) : \\\")\\n Stdout.flush()\\n var repl = Stdin.readLine()\\n story = story.replace(blank, repl)\\n}\\nSystem.print(\\\"\\\\n%(story)\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"story,line,re:=Data(),\\\"\\\",RegExp(\\\"(<[^>]+>)\\\");\\ndo{ line=ask(\\\"Story: \\\"); story.write(line,\\\"\\\\n\\\") }while(line);\\nwhile(re.search(story,True)){\\n z,ml,N:=re.matched,z[1],z[0][1]; // z=( (0,6),\\\"<name>\\\" )\\n s:=ask(\\\"Text to replace \\\",ml,\\\" with: \\\");\\n while(Void!=(n:=story.find(ml))){ story[n,N]=s } // replace all <names>s\\n}\\nprintln(\\\"-----------------\\\");\\nstory.text.print();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Mad-Libs"}}},{"rowIdx":460,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Magic_8-ball\n","language":"00-META"},{"code":";Task:\nCreate Magic 8-Ball. \n\n\nSee details at: [https://en.wikipedia.org/wiki/Magic_8-Ball Magic 8-Ball].\n\n\n{{Template:strings}}\n<br><br>\n\n","language":"00-TASK"},{"code":"V s = [‘It is certain’, ‘It is decidedly so’, ‘Without a doubt’, ‘Yes, definitely’,\n ‘You may rely on it’, ‘As I see it, yes’, ‘Most likely’, ‘Outlook good’,\n ‘Signs point to yes’, ‘Yes’, ‘Reply hazy, try again’, ‘Ask again later’,\n ‘Better not tell you now’, ‘Cannot predict now’, ‘Concentrate and ask again’,\n ‘Don't bet on it’, ‘My reply is no’, ‘My sources say no’, ‘Outlook not so good’,\n ‘Very doubtful’]\n\nSet[String] qs\n\nL\n V question = input(‘Ask your question:’)\n I question.empty\n L.break\n\n V answer = random:choice(s)\n\n I question C qs\n print(‘Your question has already been answered’)\n E\n qs.add(question)\n print(answer)\n","language":"11l"},{"code":"bdos:\t\tequ\t5\t; CP/M calls\nputs:\t\tequ\t9\ngets: \t\tequ\t10\n\t\torg\t100h\n\t\tlxi\td,message\t; Print message\n\t\tmvi\tc,puts\n\t\tcall\tbdos\nquestion:\tlxi\td,prompt\t; Ask for question\n\t\tmvi\tc,puts\n\t\tcall\tbdos\n\t\tlxi\td,bufdef\t; Read answer\n\t\tmvi\tc,gets\n\t\tcall\tbdos\n\t\tlxi\td,newline\t; Print newline\n\t\tmvi\tc,puts\n\t\tcall\tbdos\n\t\tlxi\th,buf\t\t; XOR the question w/ the RNG state\n\t\tmvi\tb,20\t\t\nxorouter:\tlxi\td,xabcdat + 1\n\t\tmvi\tc,3\nxorinner:\tldax\td\n\t\txra\tm\n\t\tstax\td\n\t\tinx\td\n\t\tinx\th\n\t\tdcr\tc\n\t\tjnz\txorinner\n\t\tdcr\tb\n\t\tjnz\txorouter\ngetrnd:\t\tcall\txabcrand\t; Generate random number <20\n\t\tani\t1fh\n\t\tcpi\t20\n\t\tjnc\tgetrnd\n\t\tinr\ta\n\t\tmov\tb,a\t\t; That is the number of the message\n\t\tlxi\th,responses\t; Skip that many strings\n\t\tmvi\ta,'$'\nskipstring:\tcmp\tm\n\t\tinx\th\n\t\tjnz\tskipstring\n\t\tdcr\tb\n\t\tjnz\tskipstring\n\t\txchg\t\t\t; Print the chosen string\n\t\tmvi\tc,puts\n\t\tcall\tbdos\n\t\tjmp\tquestion\t; Get another question\n\t\t;; RNG to make it a little less predictable\nxabcrand: lxi h,xabcdat\n inr m ; X++\n mov a,m ; X,\n inx h ;\n xra m ; ^ C,\n inx h ;\n xra m ; ^ A,\n mov m,a ; -> A\n inx h\n add m ; + B,\n mov m,a ; -> B\n rar ; >>1\n dcx h\n xra m ; ^ A,\n dcx h\n add m ; + C\n mov m,a ; -> C\n ret\t\t\n\t\t;; Strings\nmessage:\tdb\t'Magic 8 Ball$'\nnewline:\tdb\t13,10,'$'\nprompt:\t\tdb\t13,10,13,10,'What is your question? '\n\t\t;; The possible responses\nresponses:\tdb\t'$It is certain$It is decidedly so$Without a doubt$'\n\t\tdb\t'Yes, definitely$You may rely on it$As I see it, yes$'\n\t\tdb\t'Most likely$Outlook good$Signs point to yes$Yes$'\n\t\tdb\t'Reply hazy, try again$Ask again later$'\n\t\tdb\t'Better not tell you now$Cannot predict now$'\n\t\tdb\t'Concentrate and ask again$Don',39,'t bet on it$'\n\t\tdb\t'My reply is no$My sources say no$Outlook not so good$'\n\t\tdb\t'Very doubtful$'\n\t\t;; Variables\nbufdef:\t\tdb\t60,0\t\t; 60 = 20*3\nbuf:\t\tequ \t$\t\t; question will be XOR'ed with the RNG state\nxabcdat:\tequ\tbuf + 60 \t; Point RNG data into uninitialized memory,\n\t\t\t\t\t; to make it more exciting.\n","language":"8080-Assembly"},{"code":".model small\n.stack 1024\n\n.data\nUserRam BYTE 256 DUP(0)\nxorshift32_state_lo equ UserRam\nxorshift32_state_hi equ UserRam+2\n\nAns0 byte \"It is certain.\",0\nAns1 byte \"It is decidedly so.\",0\nAns2 byte \"Signs point to yes.\",0\nAns3 byte \"You can rely on it.\",0\nAns4 byte \"Most likely.\",0\nAns5 byte \"Cannot predict now.\",0\nAns6 byte \"Reply hazy, try again.\",0\nAns7 byte \"Outlook not so good.\",0\nAns8 byte \"My sources say no.\",0\nAns9 byte \"Very doubtful.\",0\nAnsA byte \"Without a doubt.\",0\nAnsB byte \"Outlook good.\",0\nAnsC byte \"Ask again later.\",0\nAnsD byte \"Better not tell you now.\",0\nAnsE byte \"Don't count on it.\",0\nAnsF byte \"Yes.\",0\n\nAnswerLookup word Ans0,Ans1,Ans2,Ans3,Ans4,Ans5,Ans6,Ans7\n\t word Ans8,Ans9,AnsA,AnsB,AnsC,AnsD,AnsE,AnsF\n.code\n\nstart:\n\n\tmov ax,@data\n\tmov ds,ax\n\t\n\tmov ax,@code\n\tmov es,ax\n\n\t\n\tCLD\t;have LODSB,MOVSB,STOSB,etc. auto-increment\n\t\n\tmov ax,03h\n\tint 10h ;sets video mode to MS-DOS text mode. Which the program is already in, so this just clears the screen.\n\t\n\tmov ah,2Ch\n\tint 21h ;returns hour:minute in cx, second:100ths of second in dx\n mov word ptr [ds:xorshift32_state_lo],dx\n mov word ptr [ds:xorshift32_state_hi],cx\n\t\n\tcall doXorshift32 ;uses the above memory locations as input. Do it three times just to mix it up some more\n\tcall doXorshift32\n\tcall doXorshift32\n\t\n\tmov ax,word ptr[ds:xorshift32_state_lo] ;get the random output from the RNG\n\tand al,0Fh\t\t\n\t;keep only the bottom nibble of al, there are only 16 possible messages.\n\tmov bx,offset AnswerLookup\n\tcall XLATW\n\t;translates AX using a table of words as a lookup table.\n\tmov si,ax ;use this looked-up value as the source index for our text.\n\tcall PrintString ;print to the screen\n\t\n\tmov ax,4C00h\n\tint 21h ;return to DOS\n\nXLATW:\n;input: ds:bx = the table you wish to look up\n;AL= the raw index into this table as if it were byte data.\n;So don't left shift prior to calling this.\n;AH is destroyed.\n\t\tSHL AL,1\n\t\tmov ah,al\t;copy AL to AH\n\t\tXLAT\t\t;returns low byte in al\n\t\tinc ah\n\t\txchg al,ah\t;XLAT only works with AL\n\t\tXLAT\t\t;returns high byte in al (old ah)\n\t\txchg al,ah\n\t\t;now the word is loaded into ax, big-endian.\n\t\tret\n","language":"8086-Assembly"},{"code":"PROC Main()\n DEFINE PTR=\"CARD\"\n DEFINE COUNT=\"20\"\n CHAR ARRAY s(256)\n PTR ARRAY a(COUNT)\n BYTE i\n\n a(0)=\"It is certain.\"\n a(1)=\"It is decidedly so.\"\n a(2)=\"Without a doubt.\"\n a(3)=\"Yes - definitely.\"\n a(4)=\"You may rely on it.\"\n a(5)=\"As I see it, yes.\"\n a(6)=\"Most likely.\"\n a(7)=\"Outlook good.\"\n a(8)=\"Yes.\"\n a(9)=\"Signs point to yes.\"\n a(10)=\"Reply hazy, try again.\"\n a(11)=\"Ask again later.\"\n a(12)=\"Better not tell you now.\"\n a(13)=\"Cannot predict now.\"\n a(14)=\"Concentrate and ask again.\"\n a(15)=\"Don't count on it.\"\n a(16)=\"My reply is no.\"\n a(17)=\"My sources say no.\"\n a(18)=\"Outlook not so good.\"\n a(19)=\"Very doubtful.\"\n\n DO\n PrintE(\"Enter your question or blank to exit:\")\n InputS(s)\n IF s(0)=0 THEN\n EXIT\n FI\n i=Rand(COUNT)\n PrintE(a(i))\n PutE()\n OD\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\nwith Ada.Strings; use Ada.Strings;\nwith Ada.Numerics.Discrete_Random;\n\n\nprocedure Main is\n\n\n --Creation of type with all the possible answers\n --\n type Possible_Answers_Type is (It_Is_Certain, It_Is_Decidedly_So, Without_A_Doubt,\n\t\t\t\t Yes_Definitely, You_May_Rely_On_It, As_I_See_It, Yes_Most_Likely,\n\t\t\t\t Outlook_Good, Signs_Point_To_Yes, Yes_Reply_Hazy,\n\t\t\t\t Try_Again, Ask_Again_Later, Better_Not_Tell_You_Now,\n\t\t\t\t Cannot_Predict_Now, Concentrate_And_Ask_Again,\n\t\t\t\t Dont_Bet_On_It, My_Reply_Is_No, My_Sources_Say_No,\n\t\t\t\t Outlook_Not_So_Good, Very_Doubtful);\n ---------------------------------------------------------------------\n\n\n -- Variable declaration\n Answer : Possible_Answers_Type := Possible_Answers_Type'First;\n User_Question : String := \" \";\n\n -----------------------------------------------------------------------------\n\n\n --Randomizer\n --\n package Random_Answer is new Ada.Numerics.Discrete_Random (Possible_Answers_Type);\n use Random_Answer;\n G : Generator;\n\nbegin\n\n Reset (G); -- Starts the generator in a unique state in each run\n\n --User get provides question\n Put_Line (\"Welcome.\"); New_Line;\n\n Put_Line (\"WARNING!!! Please remember that there's no need to shake your device for this program to work, and shaking your device could damage it\");\n New_Line;\n\n Put_Line (\"What's your question? \");\n Get (Item => User_Question); New_Line;\n\n\n --Output Answer\n Answer := (Random (G)); --Assigns random answer to variable Answer\n\n Put (Answer'Image); --Prints Answer\n\nend Main;\n","language":"Ada"},{"code":"BEGIN\n []STRING answers = (\"It is certain.\", \"It is decidedly so.\",\n \"Without a doubt.\", \"Yes - definitely.\", \"You may rely on it.\",\n \"As I see it, yes.\", \"Most likely.\", \"Outlook good.\",\n \"Yes.\", \"Signs point to yes.\", \"Reply hazy, try again.\",\n \"Ask again later.\", \"Better not tell you now.\", \"Cannot predict now.\",\n \"Concentrate and ask again.\", \"Don't count on it.\", \"My reply is no.\",\n \"My sources say no.\", \"Outlook not so good.\", \"Very doubtful.\");\n DO\n REF STRING question := LOC STRING;\n print(\"Your question: \");\n read((question, new line));\n print((answers[ENTIER (random * UPB answers) + 1], new line))\n OD\nEND\n","language":"ALGOL-68"},{"code":" set the answers to {\"It is certain\", \"It is decidedly so\", \"Without a doubt\", \"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\", \"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\", \"Reply hazy, try again\", \"Ask again later\", \"Better not tell you now\", \"Cannot predict now\", \"Concentrate and ask again\", \"Don't bet on it\", \"My reply is no\", \"My sources say no\", \"Outlook not so good\", \"Very doubtful\"}\n\ndisplay dialog some item of the answers\n","language":"AppleScript"},{"code":" 0 DIM F$(19): FOR I = 0 TO 19: READ F$(I): NEXT :M$ = CHR$ (13): DEF FN U(K) = K - 32 * (K > 95): FOR Q = 0 TO 1: HOME : PRINT M$\" PRESS ANY KEY TO REVEAL YOUR FORTUNE.\"M$M$\" PRESS Q TO QUIT.\"M$M$\" \";:FO = INT ( RND (1) * 20): GET K$\n 1 K$ = CHR$ ( FN U( ASC (K$))):Q = K$ = \"Q\": IF NOT Q THEN HOME : PRINT M$\" YOUR FORTUNE READS:\"M$M$ SPC( 5);F$(FO)M$M$\" AGAIN? (Y/N) \";: GET K$:K$ = CHR$ ( FN U( ASC (K$))):Q = K$ < > \"Y\"\n 2 NEXT Q: DATA \"IT IS CERTAIN.\",\"IT IS DECIDEDLY SO.\",\"WITHOUT A DOUBT.\",\"YES DEFINITELY.\",\"YOU MAY RELY ON IT.\",\"AS I SEE IT, YES.\",\"MOST LIKELY.\",\"OUTLOOK GOOD.\",\"YES.\",\"SIGNS POINT TO YES.\"\n 3 DATA \"REPLY HAZY, TRY AGAIN.\",\"ASK AGAIN LATER.\",\"BETTER NOT TELL YOU NOW.\",\"CANNOT PREDICT NOW.\",\"CONCENTRATE AND ASK AGAIN.\",\"DON'T COUNT ON IT.\",\"MY REPLY IS NO.\",\"MY SOURCES SAY NO.\",\"OUTLOOK NOT SO GOOD.\",\"VERY DOUBTFUL.\"\n","language":"Applesoft-BASIC"},{"code":"answers: [\n \"It is certain\" \"It is decidedly so\" \"Without a doubt\"\n \"Yes, definitely\" \"You may rely on it\" \"As I see it, yes\"\n \"Most likely\" \"Outlook good\" \"Signs point to yes\" \"Yes\"\n \"Reply hazy, try again\" \"Ask again later\"\n \"Better not tell you now\" \"Cannot predict now\"\n \"Concentrate and ask again\" \"Don't bet on it\"\n \"My reply is no\" \"My sources say no\" \"Outlook not so good\"\n \"Very doubtful\"\n]\n\nwhile ø [\n input \"Ask a question: \"\n print sample answers\n]\n","language":"Arturo"},{"code":"answers := [\n(join\n\"It is certain\", \"It is decidedly so\", \"Without a doubt\",\"Yes, definitely\",\n\"You may rely on it\", \"As I see it, yes\",\"Most likely\", \"Outlook good\",\n\"Signs point to yes\", \"Yes\",\"Reply hazy, try again\", \"Ask again later\",\n\"Better not tell you now\", \"Cannot predict now\",\"Concentrate and ask again\",\n\"Don't bet on it\",\"My reply is no\", \"My sources say no\", \"Outlook not so good\",\n\"Very doubtful\"\n)]\nAsk:\nInputBox, Question, Magic 8-Ball, Please ask your question or a blank line to quit.,,, 130\nRandom, rnd, 1, 20\nif !question\n\tExitApp\nMsgBox % answers[rnd]\ngosub, Ask\nreturn\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f MAGIC_8-BALL.AWK\nBEGIN {\n# Ten answers are affirmative, five are non-committal, and five are negative.\n arr[++i] = \"It is certain\"\n arr[++i] = \"It is decidedly so\"\n arr[++i] = \"Without a doubt\"\n arr[++i] = \"Yes, definitely\"\n arr[++i] = \"You may rely on it\"\n arr[++i] = \"As I see it, yes\"\n arr[++i] = \"Most likely\"\n arr[++i] = \"Outlook good\"\n arr[++i] = \"Signs point to yes\"\n arr[++i] = \"Yes\"\n arr[++i] = \"Reply hazy, try again\"\n arr[++i] = \"Ask again later\"\n arr[++i] = \"Better not tell you now\"\n arr[++i] = \"Cannot predict now\"\n arr[++i] = \"Concentrate and ask again\"\n arr[++i] = \"Don't bet on it\"\n arr[++i] = \"My reply is no\"\n arr[++i] = \"My sources say no\"\n arr[++i] = \"Outlook not so good\"\n arr[++i] = \"Very doubtful\"\n srand()\n printf(\"Please enter your question or a blank line to quit.\\n\")\n while (1) {\n printf(\"\\n? \")\n getline ans\n if (ans ~ /^ *$/) {\n break\n }\n printf(\"%s\\n\",arr[int(rand()*i)+1])\n }\n exit(0)\n}\n","language":"AWK"},{"code":"dim answer$(20)\nanswer$[0] = \"It is certain.\"\nanswer$[1] = \"It is decidedly so.\"\nanswer$[2] = \"Without a doubt.\"\nanswer$[3] = \"Yes - definitely.\"\nanswer$[4] = \"You may rely on it.\"\nanswer$[5] = \"As I see it, yes.\"\nanswer$[6] = \"Most likely.\"\nanswer$[7] = \"Outlook good.\"\nanswer$[8] = \"Yes.\"\nanswer$[9] = \"Signs point to yes.\"\nanswer$[10] = \"Reply hazy, try again.\"\nanswer$[11] = \"Ask again later.\"\nanswer$[12] = \"Better not tell you now.\"\nanswer$[13] = \"Cannot predict now.\"\nanswer$[14] = \"Concentrate and ask again.\"\nanswer$[15] = \"Don't count on it.\"\nanswer$[16] = \"My reply is no.\"\nanswer$[17] = \"My sources say no.\"\nanswer$[18] = \"Outlook not so good.\"\nanswer$[19] = \"Very doubtful.\"\n\nprint \"Q to quit.\"\nwhile True\n\tinput string \"What would you like to know? \", question$\n\tif upper(question$) = \"Q\" then exit while\n\tprint answer$[int(rand * answer$[?])]\n\tprint\nend while\nend\n","language":"BASIC256"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n\nint main() {\n char *question = NULL;\n size_t len = 0;\n ssize_t read;\n const char* answers[20] = {\n \"It is certain\", \"It is decidedly so\", \"Without a doubt\",\n \"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\",\n \"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\",\n \"Reply hazy, try again\", \"Ask again later\",\n \"Better not tell you now\", \"Cannot predict now\",\n \"Concentrate and ask again\", \"Don't bet on it\",\n \"My reply is no\", \"My sources say no\", \"Outlook not so good\",\n \"Very doubtful\"\n };\n srand(time(NULL));\n printf(\"Please enter your question or a blank line to quit.\\n\");\n while (1) {\n printf(\"\\n? : \");\n read = getline(&question, &len, stdin);\n if (read < 2) break;\n printf(\"\\n%s\\n\", answers[rand() % 20]);\n }\n if (question) free(question);\n return 0;\n}\n","language":"C"},{"code":"#include <array>\n#include <cstdlib>\n#include <ctime>\n#include <iostream>\n#include <string>\n\nint main()\n{\n constexpr std::array<const char*, 20> answers = {\n \"It is certain.\",\n \"It is decidedly so.\",\n \"Without a doubt.\",\n \"Yes - definitely.\",\n \"You may rely on it.\",\n \"As I see it, yes.\",\n \"Most likely.\",\n \"Outlook good.\",\n \"Yes.\",\n \"Signs point to yes.\",\n \"Reply hazy, try again.\",\n \"Ask again later.\",\n \"Better not tell you now.\",\n \"Cannot predict now.\",\n \"Concentrate and ask again.\",\n \"Don't count on it.\",\n \"My reply is no.\",\n \"My sources say no.\",\n \"Outlook not so good.\",\n \"Very doubtful.\"\n };\n\n std::string input;\n std::srand(std::time(nullptr));\n while (true) {\n std::cout << \"\\n? : \";\n std::getline(std::cin, input);\n\n if (input.empty()) {\n break;\n }\n\n std::cout << answers[std::rand() % answers.size()] << '\\n';\n }\n}\n","language":"C++"},{"code":"using System;\n\nnamespace newProg\n{\n\n class Program\n {\n static void Main(string[] args)\n {\n string[] answers =\n {\n \"It is certain.\",\n \"It is decidedly so.\",\n \"Without a doubt.\",\n \"Yes – definitely.\",\n \"You may rely on it.\",\n \"As I see it, yes.\",\n \"Most likely.\",\n \"Outlook good.\",\n \"Yes.\",\n \"Signs point to yes.\",\n \"Reply hazy, try again.\",\n \"Ask again later\",\n \"Better not tell you now.\",\n \"Cannot predict now.\",\n \"Concentrate and ask again.\",\n \"Don't count on it.\",\n \"My reply is no.\",\n \"My sources say no.\",\n \"Outlook not so good.\",\n \"Very doubtful.\"\n };\n\n while (true)\n {\n Random rnd = new Random();\n int result = rnd.Next(0, 19);\n\n Console.WriteLine(\"Magic 8 Ball! Ask question and hit a key for the answer!\");\n\n string inp = Console.ReadLine();\n\n Console.WriteLine(answers[result]);\n\n }\n }\n }\n}\n","language":"C-sharp"},{"code":"#!/var/cfengine/bin/cf-agent --no-lock\nbundle agent __main__\n{\n methods: \"rosettacode_org:magic_8_ball\";\n}\nbody file control\n{\n namespace => \"rosettacode_org\";\n}\nbundle agent magic_8_ball\n{\n vars:\n \"_responses\"\n slist => {\n \"It is certain\", \"It is decidedly so\", \"Without a doubt\",\n \"Yes definitely\", \"You may rely on it\", \"As I see it yes\",\n \"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\",\n \"Reply hazy try again\", \"Ask again later\",\n \"Better not tell you now\", \"Cannot predict now\",\n \"Concentrate and ask again\", \"Don't bet on it\",\n \"My reply is no\", \"My sources say no\", \"Outlook not so good\",\n \"Very doubtful\",\n };\n \"_selected_response\"\n int => randomint( 0, length( _responses) ),\n unless => isvariable( \"$(this.namespace):$(this.promiser)\" );\n\n \"_consideration_time\"\n int => randomint( 3, 5),\n unless => isvariable( \"$(this.namespace):$(this.promiser)\" );\n\n commands:\n \"/bin/sleep $(_consideration_time)\"\n inform => \"false\",\n handle => \"consider\",\n depends_on => { \"think\" },\n comment => \"This magic 8 ball takes a few seconds to consider the answer\n after you bring your question to mind.\";\n\n reports:\n \"Think about your question ...\"\n handle => \"think\";\n\n \"Response: $(with)\"\n with => nth( _responses, $(_selected_response) ),\n depends_on => { \"consider\" };\n}\n","language":"CFEngine"},{"code":"100 cls\n110 data \"It is certain.\",\"It is decidedly so.\"\n120 data \"Without a doubt.\",\"Yes - definitely.\"\n130 data \"You may rely on it.\",\"As I see it, yes.\"\n140 data \"Most likely.\",\"Outlook good.\"\n150 data \"Yes.\",\"Signs point to yes.\"\n160 data \"Reply hazy, try again.\",\"Ask again later.\"\n170 data \"Better not tell you now.\",\"Cannot predict now.\"\n180 data \"Concentrate and ask again.\",\"Don't count on it.\"\n190 data \"My reply is no.\",\"My sources say no.\"\n200 data \"Outlook not so good.\",\"Very doubtful.\"\n210 dim m8ball$(20)\n220 for i = 0 to 19\n230 read m8ball$(i)\n240 next i\n250 randomize timer\n260 input \"What would you like to know? \",q$\n270 print m8ball$(int(rnd(20)))\n280 end\n","language":"Chipmunk-Basic"},{"code":"(def responses\n [\"It is certain\" \"It is decidedly so\" \"Without a doubt\"\n \"Yes, definitely\" \"You may rely on it\" \"As I see it, yes\"\n \"Most likely\" \"Outlook good\" \"Signs point to yes\" \"Yes\"\n \"Reply hazy, try again\" \"Ask again later\"\n \"Better not tell you now\" \"Cannot predict now\"\n \"Concentrate and ask again\" \"Don't bet on it\"\n \"My reply is no\" \"My sources say no\" \"Outlook not so good\"\n \"Very doubtful\"])\n\n(do\n (println \"Ask a question. \")\n (read-line)\n (println (rand-nth responses)))\n","language":"Clojure"},{"code":"CMAKE_MINIMUM_REQUIRED(VERSION 3.6)\n\nPROJECT(EightBall)\n\nSET(CMAKE_DISABLE_SOURCE_CHANGES ON)\nSET(CMAKE_DISABLE_IN_SOURCE_BUILD ON)\n\nLIST(APPEND RESPONSES \"It is certain.\" \"It is decidedly so.\" \"Without a doubt.\")\nLIST(APPEND RESPONSES \"Yes - definitely.\" \"You may rely on it.\")\nLIST(APPEND RESPONSES \"As I see it yes.\" \"Most likely.\" \"Outlook good.\")\nLIST(APPEND RESPONSES \"Yes.\" \"Signs point to yes.\" \"Reply hazy try again.\")\nLIST(APPEND RESPONSES \"Ask again later.\" \"Better not tell you now.\")\nLIST(APPEND RESPONSES \"Cannot predict now.\" \"Concentrate and ask again.\")\nLIST(APPEND RESPONSES \"Don't count on it.\" \"My reply is no.\")\nLIST(APPEND RESPONSES \"My sources say no.\" \"Outlook not so good.\" \"Very doubtful.\")\n\nFUNCTION(RANDOM_RESPONSE)\n STRING(RANDOM LENGTH 1 ALPHABET 01 TENS)\n STRING(RANDOM LENGTH 1 ALPHABET 0123456789 UNITS)\n MATH(EXPR INDEX \"${TENS}${UNITS}\")\n LIST(GET RESPONSES ${INDEX} RESPONSE)\n MESSAGE(STATUS \"Question: ${QUESTION}\")\n MESSAGE(STATUS \"Response: ${RESPONSE}\")\nENDFUNCTION(RANDOM_RESPONSE)\n\nOPTION(QUESTION \"User's input question\" \"\")\n\nMESSAGE(\"===================== 8 Ball =====================\")\nIF(NOT QUESTION)\n MESSAGE(STATUS \"Welcome to 8 ball! Please provide a question \")\n MESSAGE(STATUS \"using the flag -DQUESTION=\\\"my question\\\"\")\nELSE()\n RANDOM_RESPONSE()\nENDIF()\nMESSAGE(\"==================================================\")\n\n\nADD_CUSTOM_TARGET(${PROJECT_NAME} ALL)\n","language":"CMake"},{"code":" IDENTIFICATION DIVISION.\n PROGRAM-ID. 8BALL.\n AUTHOR. Bill Gunshannon\n INSTALLATION.\n DATE-WRITTEN. 12 March 2024\n ************************************************************\n ** Program Abstract:\n ** Just ask the Magic 8 Ball and all will be revealed.\n ************************************************************\n\n ENVIRONMENT DIVISION.\n\n DATA DIVISION.\n\n WORKING-STORAGE SECTION.\n\n 01 ANSWER-TABLE.\n 10 ANSWER01 PIC X(40)\n\t VALUE \"As I see it, yes \".\n 10 ANSWER02 PIC X(40)\n\t VALUE \"Ask again later \".\n 10 ANSWER03 PIC X(40)\n\t VALUE \"Better not tell you now \".\n 10 ANSWER04 PIC X(40)\n\t VALUE \"Cannot predict now \".\n 10 ANSWER05 PIC X(40)\n\t VALUE \"Concentrate and ask again \".\n 10 ANSWER06 PIC X(40)\n\t VALUE \"Don't bet on it \".\n 10 ANSWER07 PIC X(40)\n\t VALUE \"It is certain \".\n 10 ANSWER08 PIC X(40)\n\t VALUE \"It is decidedly so \".\n 10 ANSWER09 PIC X(40)\n\t VALUE \"Most likely \".\n 10 ANSWER10 PIC X(40)\n\t VALUE \"My reply is no \".\n 10 ANSWER11 PIC X(40)\n\t VALUE \"My sources say maybe \".\n 10 ANSWER12 PIC X(40)\n\t VALUE \"My sources say no \".\n 10 ANSWER13 PIC X(40)\n\t VALUE \"Outlook good \".\n 10 ANSWER14 PIC X(40)\n\t VALUE \"Outlook not so good \".\n 10 ANSWER15 PIC X(40)\n\t VALUE \"Reply hazy, try again \".\n 10 ANSWER16 PIC X(40)\n\t VALUE \"Signs point to yes \".\n 10 ANSWER17 PIC X(40)\n\t VALUE \"Very doubtful \".\n 10 ANSWER18 PIC X(40)\n\t VALUE \"Without a doubt \".\n 10 ANSWER19 PIC X(40)\n\t VALUE \"Yes \".\n 10 ANSWER20 PIC X(40)\n\t VALUE \"Yes, definitely \".\n 10 ANSWER21 PIC X(40)\n\t VALUE \"Yes, probably not \".\n 10 ANSWER22 PIC X(40)\n\t VALUE \"You may rely on it \".\n 10 ANSWER23 PIC X(40)\n\t VALUE \"Your question has already been answered \".\n 01 PRINT-ANSWER REDEFINES ANSWER-TABLE OCCURS 23 TIMES.\n 10 THE-BALL-SPEAKS PIC X(40).\n\n 01 RND PIC 99999.\n 01 QUESTION PIC X(72).\n 01 GREETING PIC X(30)\n VALUE \"Ask and all will be revealed!!\".\n\n\n PROCEDURE DIVISION.\n\n Main-Program.\n DISPLAY GREETING.\n ACCEPT QUESTION.\n MOVE FUNCTION CURRENT-DATE(1:16) TO RND.\n PERFORM 8-BALL.\n\n STOP RUN.\n\n 8-BALL.\n COMPUTE RND =\n FUNCTION RANDOM(RND) * 11111.\n DISPLAY PRINT-ANSWER(FUNCTION MOD(RND, 23)).\n\n\n END-PROGRAM.\n","language":"COBOL"},{"code":"10 dim f$(19):for i=0 to 19:read f$(i):next\n20 print chr$(147);chr$(14)\n30 print \"Press any key to reveal your fortune.\"\n40 print:print \"Press Q to quit.\":print\n50 fo=int(rnd(1)*20):get k$:if k$=\"\" then 50\n60 if k$=\"q\" then print \"Good luck!\":end\n70 print \"Your fortune reads:\"\n80 print spc(5);f$(fo):print\n90 print \"Again? (Y/N)\"\n100 get k$:if k$=\"\" then 100\n110 if k$=\"y\" then goto 20\n120 end\n1000 data \"It is certain.\",\"It is decidedly so.\"\n1010 data \"Without a doubt.\",\"Yes – definitely.\"\n1020 data \"You may rely on it.\",\"As I see it, yes.\"\n1030 data \"Most likely.\",\"Outlook good.\",\"Yes.\"\n1040 data \"Signs point to yes.\",\"Reply hazy, try again.\"\n1050 data \"Ask again later.\",\"Better not tell you now.\"\n1060 data \"Cannot predict now.\",\"Concentrate and ask again.\"\n1070 data \"Don't count on it.\",\"My reply is no.\"\n1080 data \"My sources say no.\",\"Outlook not so good.\"\n1090 data \"Very doubtful.\"\n","language":"Commodore-BASIC"},{"code":"title \"Magic 8 Ball\"\n\nresize 0, 0, 340, 150\ncenter\n\nbgcolor 0, 0, 255\ncls graphics\n\nformid 1\nformtext \"Think of a question and select the magic button.\"\nstaticform 10, 10, 310, 20\nbgcolor 0, 0, 0\nfgcolor 255, 0, 255\ncolorform\n\nformid 2\nformtext \"Magic Button\"\nbuttonform 115, 50, 100, 20\nbgcolor 255, 0, 0\nfgcolor 0, 0, 255\ncolorform\n\ndo\n\n\n\tif forms = 2 then\n\n\t\tgosub magicbutton\n\n\tendif\n\n\tbutton k, 27\n\n\twait\n\nloop k = 0\n\nend\n\nsub magicbutton\n\n\tlet r = int(rnd * 20) + 1\n\n\tif r = 1 then\n\n\t\talert \"It is certain.\"\n\n\tendif\n\n\tif r = 2 then\n\n\t\talert \"It is decidedly so.\"\n\n\tendif\n\n\tif r = 3 then\n\n\t\talert \"Without a doubt.\"\n\n\tendif\n\n\tif r = 4 then\n\n\t\talert \"Yes – definitely.\"\n\n\tendif\n\n\tif r = 5 then\n\n\t\talert \"You may rely on it.\"\n\n\tendif\n\n\tif r = 6 then\n\n\t\talert \"As I see it\", comma, \" yes.\"\n\n\tendif\n\n\tif r = 7 then\n\n\t\talert \"Most likely.\"\n\n\tendif\n\n\tif r = 8 then\n\n\t\talert \"Outlook good.\"\n\n\tendif\n\n\tif r = 9 then\n\n\t\talert \"Yes.\"\n\n\tendif\n\n\tif r = 10 then\n\n\t\talert \"Signs point to yes.\"\n\n\tendif\n\n\tif r = 11 then\n\n\t\talert \"Reply hazy\", comma, \" try again.\"\n\n\tendif\n\n\tif r = 12 then\n\n\t\talert \"Ask again later.\"\n\n\tendif\n\n\tif r = 13 then\n\n\t\talert \"Better not tell you now.\"\n\n\tendif\n\n\tif r = 14 then\n\n\t\talert \"Cannot predict now.\"\n\n\tendif\n\n\tif r = 15 then\n\n\t\talert \"Concentrate and ask again.\"\n\n\tendif\n\n\tif r = 16 then\n\n\t\talert \"Don't count on it.\"\n\n\tendif\n\n\tif r = 17 then\n\n\t\talert \"My reply is no.\"\n\n\tendif\n\n\tif r = 18 then\n\n\t\talert \"My sources say no.\"\n\n\tendif\n\n\tif r = 19 then\n\n\t\talert \"Outlook not so good.\"\n\n\tendif\n\n\tif r = 20 then\n\n\t\talert \"Very doubtful.\"\n\n\tendif\n\nreturn\n","language":"Craft-Basic"},{"code":"import std.random, std.stdio, std.string;\n\nconst string[] responses = [\"It is certain\", \"It is decidedly so\",\n \"Without a doubt\", \"Yes, definitely\",\n \"You may rely on it\", \"As I see it, yes\",\n \"Most likely\", \"Outlook good\", \"Signs point to yes\",\n \"Yes\", \"Reply hazy, try again\", \"Ask again later\",\n \"Better not tell you now\", \"Cannot predict now\",\n \"Concentrate and ask again\", \"Don't bet on it\",\n \"My reply is no\", \"My sources say no\",\n \"Outlook not so good\", \"Very doubtful\"];\n\nvoid main()\n{\n string question = \"\";\n auto rnd = Random(unpredictableSeed);\n int index = -1;\n\n writeln(\"Welcome to 8 ball! Please enter your question to \");\n write(\"find the answers you seek.\");\n write(\"Type 'quit' to exit.\", \"\\n\\n\");\n\n while(true)\n {\n write(\"Question: \");\n question = stdin.readln();\n if(strip(question) == \"quit\")\n {\n break;\n }\n write(\"Response: \");\n index = uniform(0, 20, rnd);\n write(responses[index], \"\\n\\n\");\n }\n}\n","language":"D"},{"code":"program Magic_8_ball;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils,\n windows;\n\n// https://stackoverflow.com/questions/29794559/delphi-console-xe7-clearscreen\nprocedure ClearScreen;\nvar\n stdout: THandle;\n csbi: TConsoleScreenBufferInfo;\n ConsoleSize: DWORD;\n NumWritten: DWORD;\n Origin: TCoord;\nbegin\n stdout := GetStdHandle(STD_OUTPUT_HANDLE);\n Win32Check(stdout <> INVALID_HANDLE_VALUE);\n Win32Check(GetConsoleScreenBufferInfo(stdout, csbi));\n ConsoleSize := csbi.dwSize.X * csbi.dwSize.Y;\n Origin.X := 0;\n Origin.Y := 0;\n Win32Check(FillConsoleOutputCharacter(stdout, ' ', ConsoleSize, Origin, NumWritten));\n Win32Check(FillConsoleOutputAttribute(stdout, csbi.wAttributes, ConsoleSize,\n Origin, NumWritten));\n Win32Check(SetConsoleCursorPosition(stdout, Origin));\nend;\n\nconst\n answers: array[0..19] of string = ('It is certain.', 'It is decidedly so.',\n 'Without a doubt.', 'Yes – definitely.', 'You may rely on it.',\n 'As I see it, yes.', 'Most likely.', 'Outlook good.', 'Yes.',\n 'Signs point to yes.', 'Reply hazy, try again.', 'Ask again later',\n 'Better not tell you now.', 'Cannot predict now.',\n 'Concentrate and ask again.', 'Don''t count on it.', 'My reply is no.',\n 'My sources say no.', 'Outlook not so good.', 'Very doubtful.');\n\nbegin\n Randomize;\n while True do\n begin\n writeln('Magic 8 Ball! Ask question and hit ENTER key for the answer!');\n readln;\n ClearScreen;\n writeln(answers[Random(length(answers))], #10#10#10);\n writeln('(Hit ENTER key to ask again)');\n readln;\n ClearScreen;\n end;\nend.\n","language":"Delphi"},{"code":"answers$[] = [ \"It is certain\" \"It is decidedly so\" \"Without a doubt\" \"Yes, definitely\" \"You may rely on it\" \"As I see it, yes\" \"Most likely\" \"Outlook good\" \"Signs point to yes\" \"Yes\" \"Reply hazy, try again\" \"Ask again later\" \"Better not tell you now\" \"Cannot predict now\" \"Concentrate and ask again\" \"Don't bet on it\" \"My reply is no\" \"My sources say no\" \"Outlook not so good\" \"Very doubtful\" ]\nprint \"q to quit.\"\nrepeat\n print \"What would you like to know? \"\n q$ = input\n until q$ = \"q\"\n print answers$[randint len answers$[]]\n.\n","language":"EasyLang"},{"code":"USING: io kernel random sequences ;\nIN: rosetta-code.magic-8-ball\n\nCONSTANT: phrases {\n \"It is certain\" \"It is decidedly so\" \"Without a doubt\"\n \"Yes, definitely\" \"You may rely on it\" \"As I see it, yes\"\n \"Most likely\" \"Outlook good\" \"Signs point to yes\" \"Yes\"\n \"Reply hazy, try again\" \"Ask again later\"\n \"Better not tell you now\" \"Cannot predict now\"\n \"Concentrate and ask again\" \"Don't bet on it\"\n \"My reply is no\" \"My sources say no\" \"Outlook not so good\"\n \"Very doubtful\"\n}\n\n\"Please enter your question or a blank line to quit.\" print\n\n[ \"? : \" write flush readln empty? [ f ]\n[ phrases random print t ] if ] loop\n","language":"Factor"},{"code":"1.09 S FRAN(-1);C randomize\n1.10 S FISL(80,A$);C set length to 80 char.\n1.20 T !\"Magic 8-Ball (Q to quit)\"!!\n1.30 T \"What would you like to know?\"!\n1.40 S FSTI(80,A$(0),13);C input from console to A$, CR delimited\n1.42 S Z=A$(0);I (Z-81) , 50.1;C Capital Q, if first char = then branch\n1.44 S Z=A$(0);I (Z-113) , 50.1;C lowercase q, if first char = then branch\n\n1.50 T !\n1.60 S R=FINT(FRAN(0)*20+1);C get a random integer 1-20\n1.70 D R*2;C 'do' calculated response subroutine\n1.80 T !!\"What else would you like to know?\"!;G 1.4;C loop up to A$ input\n\n2.10 T \"It is certain.\";R;C print a response and return from subroutine\n4.10 T \"It is decidedly so.\";R;C etc.....\n6.10 T \"Without a doubt.\";R\n8.10 T \"Yes - definitely.\";R\n10.10 T \"You may rely on it.\";R\n12.10 T \"As I see it, yes.\";R\n14.10 T \"Most likely.\";R\n16.10 T \"Outlook good.\";R\n18.10 T \"Yes.\";R\n20.10 T \"Signs point to yes.\";R\n22.10 T \"Reply hazy, try again.\";R\n24.10 T \"Ask again later.\";R\n26.10 T \"Better not tell you now.\";R\n28.10 T \"Cannot predict now.\";R\n30.10 T \"Concentrate and ask again.\";R\n32.10 T \"Don't count on it.\";R\n34.10 T \"My reply is no.\";R\n36.10 T \"My sources say no.\";R\n38.10 T \"Outlook not so good.\";R\n40.10 T \"Very doubtful.\";R\n50.10 T !\"Thanks for consulting Magic 8-Ball for your life choices.\"!\n50.20 Q\n","language":"FOCAL"},{"code":"\\ magic eight ball Rosetta Code\nINCLUDE RANDOM.FS\nDECIMAL\n: CASE: ( -- -7) CREATE ;\n: ;CASE ( n -- ) DOES> SWAP CELLS + @ EXECUTE ;\n\n: VECTORS 0 DO , LOOP ;\n\n:NONAME .\" It is certain\" ;\n:NONAME .\" It is decidedly so\" ;\n:NONAME .\" Without a doubt\" ;\n:NONAME .\" Yes, definitely\" ;\n:NONAME .\" You may rely on it\" ;\n:NONAME .\" As I see it, yes.\" ;\n:NONAME .\" Most likely\" ;\n:NONAME .\" Outlook good\" ;\n:NONAME .\" Signs point to yes.\" ;\n:NONAME .\" Yes.\" ;\n:NONAME .\" Reply hazy, try again\" ;\n:NONAME .\" Ask again later\" ;\n:NONAME .\" Better not tell you now\" ;\n:NONAME .\" Cannot predict now\" ;\n:NONAME .\" Concentrate and ask again\" ;\n:NONAME .\" Don't bet on it\" ;\n:NONAME .\" My reply is no\" ;\n:NONAME .\" My sources say no\" ;\n:NONAME .\" Outlook not so good\" ;\n:NONAME .\" Very doubtful\" ;\n\nCASE: MAGIC8BALL 20 VECTORS ;CASE\n\n: GO\n CR .\" Please enter your question or a blank line to quit.\"\n BEGIN CR .\" ? :\" PAD 80 ACCEPT 0>\n WHILE CR 19 RANDOM MAGIC8BALL CR\n REPEAT ;\n","language":"Forth"},{"code":"PROGRAM EIGHT_BALL\n CHARACTER(LEN=100) :: RESPONSE\n CHARACTER(LEN=100) :: QUESTION\n CHARACTER(LEN=100), DIMENSION(20) :: RESPONSES\n REAL :: R\n\n CALL RANDOM_SEED()\n\n RESPONSES(1) = \"It is certain\"\n RESPONSES(2) = \"It is decidedly so\"\n RESPONSES(3) = \"Without a doubt\"\n RESPONSES(4) = \"Yes, definitely\"\n RESPONSES(5) = \"You may rely on it\"\n RESPONSES(6) = \"As I see it, yes\"\n RESPONSES(7) = \"Most likely\"\n RESPONSES(8) = \"Outlook good\"\n RESPONSES(9) = \"Signs point to yes\"\n RESPONSES(10) = \"Yes\"\n RESPONSES(11) = \"Reply hazy, try again\"\n RESPONSES(12) = \"Ask again later\"\n RESPONSES(13) = \"Better not tell you now\"\n RESPONSES(14) = \"Cannot predict now\"\n RESPONSES(15) = \"Concentrate and ask again\"\n RESPONSES(16) = \"Don't bet on it\"\n RESPONSES(17) = \"My reply is no\"\n RESPONSES(18) = \"My sources say no\"\n RESPONSES(19) = \"Outlook not so good\"\n RESPONSES(20) = \"Very doubtful\"\n\n WRITE(*,*) \"Welcome to 8 Ball! Ask a question to find the answers\"\n WRITE(*,*) \"you seek, type either 'quit' or 'q' to exit\", NEW_LINE('A')\n\n DO WHILE(.TRUE.)\n PRINT*, \"Ask your question: \"\n READ(*,*) QUESTION\n IF(QUESTION == \"q\" .OR. QUESTION == \"quit\") THEN\n CALL EXIT(0)\n ENDIF\n CALL RANDOM_NUMBER(R)\n PRINT*, \"Response: \", TRIM(RESPONSES(FLOOR(R*20))), NEW_LINE('A')\n ENDDO\nEND PROGRAM EIGHT_BALL\n","language":"Fortran"},{"code":"program Magic_8_ball;\n{$IFDEF WINDOWS}{$APPTYPE CONSOLE}{$ENDIF}\nuses\n SysUtils,crt;\nconst\n answers: array[0..19] of string = ('It is certain.', 'It is decidedly so.',\n 'Without a doubt.', 'Yes - definitely.', 'You may rely on it.',\n 'As I see it, yes.', 'Most likely.', 'Outlook good.', 'Yes.',\n 'Signs point to yes.', 'Reply hazy, try again.', 'Ask again later',\n 'Better not tell you now.', 'Cannot predict now.',\n 'Concentrate and ask again.', 'Don''t count on it.', 'My reply is no.',\n 'My sources say no.', 'Outlook not so good.', 'Very doubtful.');\nbegin\n Randomize;\n repeat\n writeln('Magic 8 Ball! Ask question and hit ENTER key for the answer!');\n readln;\n ClrScr;\n writeln(answers[Random(length(answers))],#13#10);\n writeln('Hit ESCape to leave');\n repeat until keypressed;\n ClrScr;\n until readkey=#27;\nend.\n","language":"Free-Pascal-Lazarus"},{"code":"dim as string answer(0 to 19) = { \"It is certain.\", \"It is decidedly so.\", \"Without a doubt.\", \"Yes – definitely.\",_\n \"You may rely on it.\", \"As I see it, yes.\", \"Most likely.\", \"Outlook good.\",_\n \"Yes.\", \"Signs point to yes.\", \"Reply hazy, try again.\", \"Ask again later.\",_\n \"Better not tell you now.\", \"Cannot predict now.\", \"Concentrate and ask again.\", \"Don't count on it.\",_\n \"My reply is no.\", \"My sources say no.\", \"Outlook not so good.\", \"Very doubtful.\" }\n\ndim as string question\nrandomize timer\n\nprint \"Q to quit.\"\ndo\n input \"What would you like to know? \", question\n if ucase(question)=\"Q\" then exit do\n print answer(int(rnd*20))\n print\nloop\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n\t\"bufio\"\n\t\"bytes\"\n\t\"fmt\"\n\t\"log\"\n\t\"math/rand\"\n\t\"os\"\n\t\"time\"\n)\n\nfunc main() {\n\trand.Seed(time.Now().UnixNano())\n\tanswers := [...]string{\n\t\t\"It is certain\", \"It is decidedly so\", \"Without a doubt\",\n\t\t\"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\",\n\t\t\"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\",\n\t\t\"Reply hazy, try again\", \"Ask again later\",\n\t\t\"Better not tell you now\", \"Cannot predict now\",\n\t\t\"Concentrate and ask again\", \"Don't bet on it\",\n\t\t\"My reply is no\", \"My sources say no\", \"Outlook not so good\",\n\t\t\"Very doubtful\",\n\t}\n\tconst prompt = \"\\n? : \"\n\tfmt.Print(\"Please enter your question or a blank line to quit.\\n\" + prompt)\n\tsc := bufio.NewScanner(os.Stdin)\n\tfor sc.Scan() {\n\t\tquestion := sc.Bytes()\n\t\tquestion = bytes.TrimSpace(question)\n\t\tif len(question) == 0 {\n\t\t\tbreak\n\t\t}\n\t\tanswer := answers[rand.Intn(len(answers))]\n\t\tfmt.Printf(\"\\n%s\\n\"+prompt, answer)\n\t}\n\tif err := sc.Err(); err != nil {\n\t\tlog.Fatal(err)\n\t}\n}\n","language":"Go"},{"code":"0 DATA \"It is certain.\", \"It is decidedly so.\"\n20 DATA \"Without a doubt.\", \"Yes - definitely.\"\n30 DATA \"You may rely on it.\", \"As I see it, yes.\"\n40 DATA \"Most likely.\", \"Outlook good.\"\n50 DATA \"Yes.\", \"Signs point to yes.\"\n60 DATA \"Reply hazy, try again.\", \"Ask again later.\"\n70 DATA \"Better not tell you now.\", \"Cannot predict now.\"\n80 DATA \"Concentrate and ask again.\", \"Don't count on it.\"\n90 DATA \"My reply is no.\", \"My sources say no.\"\n100 DATA \"Outlook not so good.\", \"Very doubtful.\"\n110 DIM M8BALL$(20)\n120 FOR I=0 TO 19\n130 READ M8BALL$(I)\n140 NEXT I\n150 RANDOMIZE TIMER\n160 INPUT \"What would you like to know? \", Q$\n170 PRINT M8BALL$(INT(RND*20))\n180 END\n","language":"GW-BASIC"},{"code":"import System.Random (getStdRandom, randomR)\nimport Control.Monad (forever)\n\nanswers :: [String]\nanswers =\n [ \"It is certain\"\n , \"It is decidedly so\"\n , \"Without a doubt\"\n , \"Yes, definitely\"\n , \"You may rely on it\"\n , \"As I see it, yes\"\n , \"Most likely\"\n , \"Outlook good\"\n , \"Signs point to yes\"\n , \"Yes\"\n , \"Reply hazy, try again\"\n , \"Ask again later\"\n , \"Better not tell you now\"\n , \"Cannot predict now\"\n , \"Concentrate and ask again\"\n , \"Don't bet on it\"\n , \"My reply is no\"\n , \"My sources say no\"\n , \"Outlook not so good\"\n , \"Very doubtful\"]\n\nmain :: IO ()\nmain = do\n putStrLn \"Hello. The Magic 8 Ball knows all. Type your question.\"\n forever $ do\n getLine\n n <- getStdRandom (randomR (0, pred $ length answers))\n putStrLn $ answers !! n\n","language":"Haskell"},{"code":"100 PROGRAM \"Magic8.bas\"\n110 RANDOMIZE\n120 STRING ANSWER$(1 TO 20)*26\n130 FOR I=1 TO 20\n140 READ ANSWER$(I)\n150 NEXT\n160 CLEAR SCREEN\n170 PRINT \"Magic 8-ball\":PRINT \"Q to quit.\":PRINT\n180 DO\n190 INPUT PROMPT \"What would you like to know? \":QUESTION$\n200 IF LCASE$(QUESTION$)=\"q\" THEN EXIT DO\n210 PRINT ANSWER$(RND(20)+1):PRINT\n220 LOOP\n230 DATA It is certain.,It is decidedly so.,Without a doubt.\n240 DATA Yes - definitely.,You may rely on it.,\"As I see it, yes.\"\n250 DATA Most likely.,Outlook good.,Yes.\n260 DATA Signs point to yes.,\"Reply hazy, try again.\",Ask again later.\n270 DATA Better not tell you now.,Cannot predict now.,Concentrate and ask again.\n280 DATA Don't count on it.,My reply is no.,My sources say no.\n290 DATA Outlook not so good.,Very doubtful.\n","language":"IS-BASIC"},{"code":"NB. translated from awk\n\nprompt=: [: 1!:1 [: 1: echo\n\nANSWERS=: [;._2'It is certain\"It is decidedly so\"Without a doubt\"Yes, definitely\"You may rely on it\"As I see it, yes\"Most likely\"Outlook good\"Signs point to yes\"Yes\"Reply hazy, try again\"Ask again later\"Better not tell you now\"Cannot predict now\"Concentrate and ask again\"Don''t bet on it\"My reply is no\"My sources say no\"Outlook not so good\"Very doubtful\"'\n\neight_ball=: ANSWERS&$: :(dyad define)\n while. 0 < # prompt 'Please enter your question or a blank line to quit.' do.\n echo ({~ ?@:#) x\n end.\n)\n","language":"J"},{"code":"import java.util.Random;\nimport java.util.Scanner;\n\npublic class MagicEightBall {\n\n public static void main(String[] args) {\n new MagicEightBall().run();\n }\n\n private static String[] ANSWERS = new String[] {\"It is certain.\", \"It is decidedly so.\", \"Without a doubt.\", \"Yes - definitely.\",\n \"You may rely on it.\", \"As I see it, yes.\", \"Most likely.\", \"Outlook good.\", \"Yes.\", \"Signs point to yes.\",\n \"Reply hazy, try again.\", \"Ask again later.\", \"Better not tell you now.\", \"Cannot predict now.\", \"Concentrate and ask again.\",\n \"Don't count on it.\", \"My reply is no.\", \"My sources say no.\", \"Outlook not so good.\", \"Very doubtful. \"};\n\n public void run() {\n Random random = new Random();\n System.out.printf(\"Hello. The Magic 8 Ball knows all. Type your question.%n%n\");\n try ( Scanner in = new Scanner(System.in); ) {\n System.out.printf(\"? \");\n while ( (in.nextLine()).length() > 0 ) {\n System.out.printf(\"8 Ball Response: %s%n\", ANSWERS[random.nextInt(ANSWERS.length)]);\n System.out.printf(\"? \");\n }\n }\n System.out.printf(\"%n8 Ball Done. Bye.\");\n }\n}\n","language":"Java"},{"code":"//console\nvar answers = [ \"It is certain\", \"It is decidedly so\", \"Without a doubt\",\n \"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\",\n \"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\",\n \"Reply hazy, try again\", \"Ask again later\",\n \"Better not tell you now\", \"Cannot predict now\",\n \"Concentrate and ask again\", \"Don't bet on it\",\n \"My reply is no\", \"My sources say no\", \"Outlook not so good\",\n \"Very doubtful\"])\n\nconsole.log(\"ASK ANY QUESTION TO THE MAGIC 8-BALL AND YOU SHALL RECEIVE AN ANSWER!\")\n\nfor(;;){\n var answer = prompt(\"question:\")\n console.log(answer)\nconsole.log(answers[Math.floor(Math.random()*answers.length)]);\n}\n","language":"JavaScript"},{"code":"const responses = [\"It is certain\", \"It is decidedly so\", \"Without a doubt\",\n \"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\", \"Most likely\",\n \"Outlook good\", \"Signs point to yes\", \"Yes\", \"Reply hazy, try again\",\n \"Ask again later\", \"Better not tell you now\", \"Cannot predict now\",\n \"Concentrate and ask again\", \"Don't bet on it\", \"My reply is no\",\n \"My sources say no\", \"Outlook not so good\", \"Very doubtful\"]\n\nwhile true\n println(\"Ask a question (blank to exit):\")\n if !occursin(r\"[a-zA-Z]\", readline(stdin))\n break\n end\n println(rand(responses))\nend\n","language":"Julia"},{"code":"ask:{` 0:*1?\"/\"\\\"It is certain/It is decidedly so/Without a doubt/Yes, definitely/You may rely on it/As I see it, yes/Most likely/Outlook good/Signs point to yes/Yes/Reply hazy, try again/Ask again later/Better not tell you now/Cannot predict now/Concentrate and ask again/Don't bet on it/My reply is no/My sources say no/Outlook not so good/Very doubtful\"}\n","language":"K"},{"code":"ask \"Will this work?\"\nSigns point to yes\nask \"Was this worth doing?\"\nWithout a doubt\nask \"Can I have a cookie?\"\nYes, definitely\n","language":"K"},{"code":"// Version 1.2.40\n\nimport java.util.Random\n\nfun main(args: Array<String>) {\n val answers = listOf(\n \"It is certain\", \"It is decidedly so\", \"Without a doubt\",\n \"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\",\n \"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\",\n \"Reply hazy, try again\", \"Ask again later\",\n \"Better not tell you now\", \"Cannot predict now\",\n \"Concentrate and ask again\", \"Don't bet on it\",\n \"My reply is no\", \"My sources say no\", \"Outlook not so good\",\n \"Very doubtful\"\n )\n val rand = Random()\n println(\"Please enter your question or a blank line to quit.\")\n while (true) {\n print(\"\\n? : \")\n val question = readLine()!!\n if (question.trim() == \"\") return\n val answer = answers[rand.nextInt(20)]\n println(\"\\n$answer\")\n }\n}\n","language":"Kotlin"},{"code":"data \"It is certain\",\"It is decidedly so\",\"Without a doubt\",\"Yes - definitely\",_\n\"You may rely on it\",\"As I see it, yes\",\"Most likely\",\"Outlook good\",\"Yes\",_\n\"Signs point to yes\",\"Reply hazy, try again\",\"Ask again later\",\"Better not tell you now\",_\n\"Cannot predict now\",\"Concentrate and ask again\",\"Don't count on it\",\"My reply is no\",_\n\"My sources say no\",\"Outlook not so good\",\"Very doubtful\"\n\ndim c$(20)\nfor a = 1 to 20\n read b$\n c$(a) = b$\nnext a\n\n[loop]\n input \"Type your question: \";a$\n if a$=\"\" then end\n d=int(rnd(1)*20)+1\n print \"Answer: \";c$(d)\ngoto [loop]\n","language":"Liberty-BASIC"},{"code":"10 mode 2:defint a-z:randomize time\n20 input \"Your question (hit Return to quit)\";i$\n30 if i$=\"\" then print \"Goodbye!\":end\n40 q=1+19*rnd\n50 on q gosub 100, 110, 120, 130, 140, 150, 160, 170, 180, 190, 200, 210, 220, 230, 240, 250, 260, 270, 280, 290\n60 goto 20\n100 print \"It is certain\":return\n110 print \"It is decidedly so\":return\n120 print \"Without a doubt\":return\n130 print \"Yes, definitely\":return\n140 print \"You may rely on it\":return\n150 print \"As I see it, yes\":return\n160 print \"Most likely\":return\n170 print \"Outlook good\":return\n180 print \"Signs point to yes\":return\n190 print \"Yes\":return\n200 print \"Reply hazy, try again\":return\n210 print \"Ask again later\":return\n220 print \"Better not tell you now\":return\n230 print \"Cannot predict now\":return\n240 print \"Concentrate and ask again\":return\n250 print \"Don't bet on it\":return\n260 print \"My reply is no\":return\n270 print \"My sources say no\":return\n280 print \"Outlook not so good\":return\n290 print \"Very doubtful\":return\n","language":"Locomotive-Basic"},{"code":"math.randomseed(os.time())\nanswers = {\n \"It is certain.\", \"It is decidedly so.\", \"Without a doubt.\", \"Yes, definitely.\", \"You may rely on it.\",\n \"As I see it, yes.\", \"Most likely.\", \"Outlook good.\", \"Signs point to yes.\", \"Yes.\",\n \"Reply hazy, try again.\", \"Ask again later.\", \"Better not tell you now.\", \"Cannot predict now.\", \"Concentrate and ask again.\",\n \"Don't bet on it.\", \"My reply is no.\", \"My sources say no.\", \"Outlook not so good.\", \"Very doubtful.\"\n}\nwhile true do\n io.write(\"Q: \")\n question = io.read()\n print(\"A: \"..answers[math.random(#answers)])\nend\n","language":"Lua"},{"code":"Module Magic.8.Ball {\n answers=(\"It is certain\", \"It is decidedly so\", \"Without a doubt\", \"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\", \"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\", \"Reply hazy, try again\", \"Ask again later\", \"Better not tell you now\", \"Cannot predict now\", \"Concentrate and ask again\", \"Don't bet on it\", \"My reply is no\", \"My sources say no\", \"Outlook not so good\", \"Very doubtful\")\n Print \"Please enter your question or a blank line to quit.\"\n {\n Line Input A$\n Print\n A$=trim$(A$)\n If A$=\"\" Then Exit\n Print Array$(answers, Random(0, 19))\n Loop\n }\n}\nMagic.8.Ball\n","language":"M2000-Interpreter"},{"code":"answers = {\"It is certain.\", \"It is decidedly so.\",\n \"Without a doubt.\", \"Yes - definitely.\", \"You may rely on it.\",\n \"As I see it, yes.\", \"Most likely.\", \"Outlook good.\", \"Yes.\",\n \"Signs point to yes.\", \"Reply hazy, try again.\",\n \"Ask again later.\", \"Better not tell you now.\",\n \"Cannot predict now.\", \"Concentrate and ask again.\",\n \"Don't count on it.\", \"My reply is no.\", \"My sources say no.\",\n \"Outlook not so good.\", \"Very doubtful.\"};\nq = Input[\"Please enter your question\"];\nSeedRandom[Hash[q]];\nPrint[RandomChoice[answers]]\n","language":"Mathematica"},{"code":"set_random_state(make_random_state(true))$\n\nblock(\n responses:[\"It is certain\",\"It is decidedly so\",\"Without a doubt\",\"Yes definitely\",\"You may rely on it\",\"As I see it, yes\",\"Most likely\",\"Outlook good\",\"Yes\",\"Signs point to yes\",\n \"Reply hazy, try again\",\"Ask again later\",\"Better not tell you now\",\"Cannot predict now\",\"Concentrate and ask again\",\n \"Don't count on it\",\"My reply is no\",\"My sources say no\",\"Outlook not so good\",\"Very doubtful\"],\n read(\"Ask a question\"),\n print(responses[random(20)])\n);\n","language":"Maxima"},{"code":"randomize ; Seed the RNG with current timestamp.\n\n(\n \"It is certain\" \"It is decidedly so\" \"Without a doubt\"\n \"Yes, definitely\" \"You may rely on it\" \"As I see it, yes\"\n \"Most likely\" \"Outlook good\" \"Signs point to yes\" \"Yes\"\n \"Reply hazy, try again\" \"Ask again later\"\n \"Better not tell you now\" \"Cannot predict now\"\n \"Concentrate and ask again\" \"Don't bet on it\"\n \"My reply is no\" \"My sources say no\" \"Outlook not so good\"\n \"Very doubtful\"\n) =phrases\n\n(phrases dup size pred random get puts!) :answer\n\n(true) (\"Ask a question\" ask answer) while\n","language":"Min"},{"code":"answers = [\"It is certain\", \"It is decidedly so\", \"Without a doubt\",\n \"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\",\n \"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\",\n \"Reply hazy, try again\", \"Ask again later\",\n \"Better not tell you now\", \"Cannot predict now\",\n \"Concentrate and ask again\", \"Don't bet on it\",\n \"My reply is no\", \"My sources say no\", \"Outlook not so good\",\n \"Very doubtful\"]\nprint \"Ask your question and the Magic 8 Ball will give you the answer!\"\ninput \"What is your question?\"\nprint answers[rnd * answers.len]\n","language":"MiniScript"},{"code":"100 CLS\n110 DATA \"It is certain.\",\"It is decidedly so.\"\n120 DATA \"Without a doubt.\",\"Yes - definitely.\"\n130 DATA \"You may rely on it.\",\"As I see it, yes.\"\n140 DATA \"Most likely.\",\"Outlook good.\"\n150 DATA \"Yes.\",\"Signs point to yes.\"\n160 DATA \"Reply hazy, try again.\",\"Ask again later.\"\n170 DATA \"Better not tell you now.\",\"Cannot predict now.\"\n180 DATA \"Concentrate and ask again.\",\"Don't count on it.\"\n190 DATA \"My reply is no.\",\"My sources say no.\"\n200 DATA \"Outlook not so good.\",\"Very doubtful.\"\n210 DIM m$(20)\n220 FOR i = 0 TO 19\n230 READ m$(i)\n240 NEXT i\n260 INPUT \"What would you like to know? \"; q$\n270 PRINT m$(INT(RND(20)))\n280 END\n","language":"MSX-Basic"},{"code":"import random, strutils\n\nconst Answers = [\"It is certain\", \"It is decidedly so\", \"Without a doubt\",\n \"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\",\n \"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\",\n \"Reply hazy, try again\", \"Ask again later\",\n \"Better not tell you now\", \"Cannot predict now\",\n \"Concentrate and ask again\", \"Don't bet on it\",\n \"My reply is no\", \"My sources say no\", \"Outlook not so good\",\n \"Very doubtful\"]\n\nproc exit() =\n echo \"Bye.\"\n quit QuitSuccess\n\nrandomize()\n\ntry:\n while true:\n echo \"Type your question or an empty line to quit.\"\n stdout.write \"? \"\n let question = stdin.readLine()\n if question.strip().len == 0: exit()\n echo Answers[rand(19)], \".\\n\"\nexcept EOFError:\n exit()\n","language":"Nim"},{"code":"/* REXX */\na=.array~of(\"It is certain\", \"It is decidedly so\", \"Without a doubt\",,\n \"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\",,\n \"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\",,\n \"Reply hazy, try again\", \"Ask again later\",,\n \"Better not tell you now\", \"Cannot predict now\",,\n \"Concentrate and ask again\", \"Don't bet on it\",,\n \"My reply is no\", \"My sources say no\", \"Outlook not so good\",,\n \"Very doubtful\")\nDo Forever\n Say 'your question:'\n Parse Pull q\n If q='' Then Leave\n Say a[random(1,20)]\n Say ''\n End\n","language":"OoRexx"},{"code":"@a = ('It is certain', 'It is decidedly so', 'Without a doubt', 'Yes, definitely',\n 'You may rely on it', 'As I see it, yes', 'Most likely', 'Outlook good',\n 'Signs point to yes', 'Yes', 'Reply hazy, try again', 'Ask again later',\n 'Better not tell you now', 'Cannot predict now', 'Concentrate and ask again',\n \"Don't bet on it\", 'My reply is no', 'My sources say no', 'Outlook not so good',\n 'Very doubtful');\n\nwhile () {\n print 'Enter your question:';\n last unless <> =~ /\\w/;\n print @a[int rand @a], \"\\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;\">answers</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"As I see it, yes\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Ask again later\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"You may rely on it\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"Without a doubt\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Don't bet on it\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Outlook not so good\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"Signs point to yes\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"It is decidedly so\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"It is certain\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"Better not tell you now\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"My reply is no\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Outlook good\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"Concentrate and ask again\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Reply hazy, try again\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Yes\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"Most likely\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Cannot predict now\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"My sources say maybe\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"My sources say no\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Yes, definitely\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Yes, probably not\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"Very doubtful\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Your question has already been answered\"</span><span style=\"color: #0000FF;\">}</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 <span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">vbox</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">question</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">answer</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">answered</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">clearkey</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</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;\">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> <span style=\"color: #000080;font-style:italic;\">-- (standard practice for me)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">K_F5</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_DEFAULT</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span> <span style=\"color: #000080;font-style:italic;\">-- (let browser reload work)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">K_CR</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">q</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupGetAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">question</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"VALUE\"</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000000;\">reply</span>\n <span style=\"color: #008080;\">if</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: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">answered</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">reply</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"Your question has already been answered\"</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">answered</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">answered</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">reply</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">answers</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;\">answers</span><span style=\"color: #0000FF;\">))]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">IupSetStrAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">answer</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"TITLE\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">reply</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">clearkey</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;\">elsif</span> <span style=\"color: #000000;\">clearkey</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">IupSetAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">question</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"VALUE\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">clearkey</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;\">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: #7060A8;\">IupOpen</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">question</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupText</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"EXPAND=HORIZONTAL\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">answer</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;\">\"EXPAND=HORIZONTAL\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">vbox</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupVbox</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">question</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">answer</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #008000;\">`MARGIN=40x40`</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;\">vbox</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`TITLE=\"Magic 8-ball\",SIZE=250x100`</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: #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;\">IupHide</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n<!--\n","language":"Phix"},{"code":"<?php\n\n$fortunes = array(\n\t\"It is certain\",\n\t\"It is decidedly so\",\n\t\"Without a doubt\",\n\t\"Yes, definitely\",\n\t\"You may rely on it\",\n\t\"As I see it, yes\",\n\t\"Most likely\",\n\t\"Outlook good\",\n\t\"Signs point to yes\",\n\t\"Yes\",\n\t\"Reply hazy, try again\",\n\t\"Ask again later\",\n\t\"Better not tell you now\",\n\t\"Cannot predict now\",\n\t\"Concentrate and ask again\",\n\t\"Don't bet on it\",\n\t\"My reply is no\",\n\t\"My sources say no\",\n\t\"Outlook not so good\",\n\t\"Very doubtful\"\n);\n\n/*\n * Prompt the user at the CLI for the command\n */\nfunction cli_prompt( $prompt='> ', $default=false ) {\n\n\t// keep asking until a non-empty response is given\n\tdo {\n\t\t// display the prompt\n\t\techo $prompt;\n\n\t\t// read input and remove CRLF\n\t\t$cmd = chop( fgets( STDIN ) );\n\n\t} while ( empty( $default ) and empty( $cmd ) );\n\n\treturn $cmd ?: $default;\n\n}\n\n$question = cli_prompt( 'What is your question? ' );\n\necho 'Q: ', $question, PHP_EOL;\n\necho 'A: ', $fortunes[ array_rand( $fortunes ) ], PHP_EOL;\n","language":"PHP"},{"code":"100H:\n/*\nTHE PROCEDURES CLOCK AND RND USE A FEATURE OF PICKLES AND TROUT CP/M2\nAND ARE NOT LIKELY TO WORK ON OTHER VERSIONS OF CP/M\n*/\n\nBDOS: PROCEDURE (FN, ARG) BYTE; DECLARE FN BYTE, ARG ADDRESS; GO TO 5; END BDOS;\nEXIT: PROCEDURE; MEMORY(0)=BDOS(0,0); END EXIT;\n\nTTYIN: PROCEDURE BYTE; DECLARE C BYTE; RETURN BDOS(1,0); END TTYIN;\n\nPRINT: PROCEDURE (S); DECLARE S ADDRESS; S=BDOS(9,S); END PRINT;\n\nCLOCK: PROCEDURE;\nDECLARE B$ADR ADDRESS; DECLARE B BASED B$ADR BYTE;\n B$ADR=047H;\n B = 0EH; GO TO 043H; END CLOCK;\n\nRND: PROCEDURE ADDRESS;\nDECLARE E$ADR ADDRESS; DECLARE E BASED E$ADR BYTE;\nDECLARE D$ADR ADDRESS; DECLARE D BASED D$ADR BYTE;\nDECLARE L$ADR ADDRESS; DECLARE L BASED L$ADR BYTE;\nDECLARE H$ADR ADDRESS; DECLARE H BASED H$ADR BYTE;\nDECLARE (NUM, DE, HL) ADDRESS;\n E$ADR=048H; D$ADR=049H; L$ADR=04AH; H$ADR=04BH;\n CALL CLOCK;\n DE = D * 255 + E; HL = H * 255 + L; NUM = DE * HL; RETURN NUM;\nEND RND;\n\nEIGHTBALL: DO;\n\n\n DECLARE CR LITERALLY '13';\n DECLARE CRLF(3) BYTE INITIAL (13,10,'$');\n DECLARE CHR BYTE;\n DECLARE NUM ADDRESS;\n DECLARE GREETING(30) BYTE INITIAL\n ('ASK AND ALL WILL BE REVEALED $');\n DECLARE MSG01(41) BYTE INITIAL\n ( 'AS I SEE IT, YES $' );\n DECLARE MSG02(41) BYTE INITIAL\n ( 'ASK AGAIN LATER $' );\n DECLARE MSG03(41) BYTE INITIAL\n ( 'BETTER NOT TELL YOU NOW $' );\n DECLARE MSG04(41) BYTE INITIAL\n ( 'CANNOT PREDICT NOW $' );\n DECLARE MSG05(41) BYTE INITIAL\n ( 'CONCENTRATE AND ASK AGAIN $' );\n DECLARE MSG06(41) BYTE INITIAL\n ( 'DON''T BET ON IT $' );\n DECLARE MSG07(41) BYTE INITIAL\n ( 'IT IS CERTAIN $' );\n DECLARE MSG08(41) BYTE INITIAL\n ( 'IT IS DECIDEDLY SO $' );\n DECLARE MSG09(41) BYTE INITIAL\n ( 'MOST LIKELY $' );\n DECLARE MSG10(41) BYTE INITIAL\n ( 'MY REPLY IS NO $' );\n DECLARE MSG11(41) BYTE INITIAL\n ( 'MY SOURCES SAY MAYBE $' );\n DECLARE MSG12(41) BYTE INITIAL\n ( 'MY SOURCES SAY NO $' );\n DECLARE MSG13(41) BYTE INITIAL\n ( 'OUTLOOK GOOD $' );\n DECLARE MSG14(41) BYTE INITIAL\n ( 'OUTLOOK NOT SO GOOD $' );\n DECLARE MSG15(41) BYTE INITIAL\n ( 'REPLY HAZY, TRY AGAIN $' );\n DECLARE MSG16(41) BYTE INITIAL\n ( 'SIGNS POINT TO YES $' );\n DECLARE MSG17(41) BYTE INITIAL\n ( 'VERY DOUBTFUL $' );\n DECLARE MSG18(41) BYTE INITIAL\n ( 'WITHOUT A DOUBT $' );\n DECLARE MSG19(41) BYTE INITIAL\n ( 'YES $' );\n DECLARE MSG20(41) BYTE INITIAL\n ( 'YES, DEFINITELY $' );\n DECLARE MSG21(41) BYTE INITIAL\n ( 'YES, PROBABLY NOT $' );\n DECLARE MSG22(41) BYTE INITIAL\n ( 'YOU MAY RELY ON IT $' );\n DECLARE MSG23(41) BYTE INITIAL\n ( 'YOUR QUESTION HAS ALREADY BEEN ANSWERED $' );\n\n NUM = RND MOD 24;\n\n CALL PRINT(.GREETING);\n CALL PRINT(.CRLF);\n\n DO WHILE CHR <> CR;\n CHR = TTYIN;\n END;\n\n CALL PRINT(.CRLF);\n\n DO CASE NUM;\n CALL PRINT(.MSG01);\n CALL PRINT(.MSG02);\n CALL PRINT(.MSG03);\n CALL PRINT(.MSG04);\n CALL PRINT(.MSG05);\n CALL PRINT(.MSG06);\n CALL PRINT(.MSG07);\n CALL PRINT(.MSG08);\n CALL PRINT(.MSG09);\n CALL PRINT(.MSG10);\n CALL PRINT(.MSG11);\n CALL PRINT(.MSG12);\n CALL PRINT(.MSG13);\n CALL PRINT(.MSG14);\n CALL PRINT(.MSG15);\n CALL PRINT(.MSG16);\n CALL PRINT(.MSG17);\n CALL PRINT(.MSG18);\n CALL PRINT(.MSG19);\n CALL PRINT(.MSG20);\n CALL PRINT(.MSG21);\n CALL PRINT(.MSG22);\n CALL PRINT(.MSG23);\n END;\n CALL PRINT(.CRLF);\n\n CALL EXIT;\n\nEND;\nEOF\n","language":"PL-M"},{"code":"Define.s Magic8=\"● It is certain.\"+#LF$+\n \"● It is decidedly so.\"+#LF$+\n \"● Without a doubt.\"+#LF$+\n \"● Yes – definitely.\"+#LF$+\n \"● You may rely on it.\"+#LF$+\n \"● As I see it, yes.\"+#LF$+\n \"● Most likely.\"+#LF$+\n \"● Outlook good.\"+#LF$+\n \"● Yes.\"+#LF$+\n \"● Signs point To yes.\"+#LF$+\t\n \"● Reply hazy, try again.\"+#LF$+\n \"● Ask again later.\"+#LF$+\n \"● Better Not tell you now.\"+#LF$+\n \"● Cannot predict now.\"+#LF$+\n \"● Concentrate And ask again.\"+#LF$+\t\n \"● Don't count on it.\"+#LF$+\n \"● My reply is no.\"+#LF$+\n \"● My sources say no.\"+#LF$+\n \"● Outlook Not so good.\"+#LF$+\n \"● Very doubtful.\"+#LF$\n\n OpenConsole()\n\n Repeat\n Print(\"MAGIC8: What would you like To know? \"): q$=Input()\n If Len(q$)=0 : End : EndIf\n PrintN(StringField(Magic8,Random(CountString(Magic8,#LF$),1),#LF$))\n ForEver\n","language":"PureBasic"},{"code":"import random\n\ns = ('It is certain', 'It is decidedly so', 'Without a doubt', 'Yes, definitely',\n 'You may rely on it', 'As I see it, yes', 'Most likely', 'Outlook good',\n 'Signs point to yes', 'Yes', 'Reply hazy, try again', 'Ask again later',\n 'Better not tell you now', 'Cannot predict now', 'Concentrate and ask again',\n \"Don't bet on it\", 'My reply is no', 'My sources say no', 'Outlook not so good',\n 'Very doubtful')\n\nq_and_a = {}\n\nwhile True:\n question = input('Ask your question:')\n if len(question) == 0: break\n\n if question in q_and_a:\n print('Your question has already been answered')\n else:\n answer = random.choice(s)\n q_and_a[question] = answer\n print(answer)\n","language":"Python"},{"code":"DIM answer$(19)\nFOR i = 0 TO UBOUND(answer$): READ answer$(i): NEXT i\nRANDOMIZE TIMER\n\nPRINT \"Q to quit.\"\nDO\n INPUT \"What would you like to know? \", question$\n IF UCASE$(question$) = \"Q\" THEN EXIT DO\n PRINT answer$(INT(RND * UBOUND(answer$)))\n PRINT\nLOOP\nEND\n\nDATA \"It is certain.\",\"It is decidedly so.\"\nDATA \"Without a doubt.\",\"Yes – definitely.\"\nDATA \"You may rely on it.\",\"As I see it, yes.\"\nDATA \"Most likely.\",\"Outlook good.\",\"Yes.\"\nDATA \"Signs point to yes.\",\"Reply hazy, try again.\"\nDATA \"Ask again later.\",\"Better not tell you now.\"\nDATA \"Cannot predict now.\",\"Concentrate and ask again.\"\nDATA \"Don't count on it.\",\"My reply is no.\"\nDATA \"My sources say no.\",\"Outlook not so good.\"\nDATA \"Very doubtful.\"\n","language":"QBasic"},{"code":"[ 20 random\n [ table\n $ \"Concentrate and ask again.\" $ \"Yes.\"\n $ \"Better not tell you now.\" $ \"Most likely.\"\n $ \"Reply hazy, try again.\" $ \"Outlook good.\"\n $ \"Outlook not so good.\" $ \"It is certain.\"\n $ \"Cannot predict now.\" $ \"Very doubtful.\"\n $ \"Signs point to yes.\" $ \"My reply is no.\"\n $ \"It is decidedly so.\" $ \"Ask again later.\"\n $ \"You may rely on it.\" $ \"Without a doubt.\"\n $ \"Don't count on it.\" $ \"Yes - definitely.\"\n $ \"My sources say no.\" $ \"As I see it, yes.\" ]\n do echo$ cr ] is 8-ball ( --> )\n","language":"Quackery"},{"code":"eight_ball <- function()\n{\n responses <- c(\"It is certain\", \"It is decidedly so\", \"Without a doubt\",\n \"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\",\n \"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\",\n \"Reply hazy, try again\", \"Ask again later\",\n \"Better not tell you now\", \"Cannot predict now\",\n \"Concentrate and ask again\", \"Don't bet on it\",\n \"My reply is no\", \"My sources say no\", \"Outlook not so good\",\n \"Very doubtful\")\n\n question <- \"\"\n\n cat(\"Welcome to 8 ball!\\n\\n\", \"Please ask yes/no questions to get answers.\",\n \" Type 'quit' to exit the program\\n\\n\")\n\n while(TRUE)\n {\n question <- readline(prompt=\"Enter Question: \")\n if(question == 'quit')\n {\n break\n }\n randint <- runif(1, 1, 20)\n cat(\"Response: \", responses[randint], \"\\n\")\n }\n}\n\nif(!interactive())\n{\n eight_ball()\n}\n","language":"R"},{"code":"(define eight-ball-responses\n (list \"It is certain\" \"It is decidedly so\" \"Without a doubt\" \"Yes definitely\" \"You may rely on it\"\n \"As I see it, yes\" \"Most likely\" \"Outlook good\" \"Yes\" \"Signs point to yes\"\n \"Reply hazy try again\" \"Ask again later\" \"Better not tell you now\" \"Cannot predict now\"\n \"Concentrate and ask again\"\n \"Don't count on it\" \"My reply is no\" \"My sources say no\" \"Outlook not so good\"\n \"Very doubtful\"))\n\n(define ((answer-picker answers)) (sequence-ref answers (random (sequence-length answers))))\n\n(define magic-eightball (answer-picker eight-ball-responses))\n\n(module+ main\n (let loop ()\n (display \"What do you want to know\\n?\")\n (read-line)\n (displayln (magic-eightball))\n (loop)))\n","language":"Racket"},{"code":"put 'Please enter your question or a blank line to quit.';\n\n[\"It is certain\", \"It is decidedly so\", \"Without a doubt\", \"Yes, definitely\",\n \"You may rely on it\", \"As I see it, yes\", \"Most likely\", \"Outlook good\",\n \"Signs point to yes\", \"Yes\", \"Reply hazy, try again\", \"Ask again later\",\n \"Better not tell you now\", \"Cannot predict now\", \"Concentrate and ask again\",\n \"Don't bet on it\", \"My reply is no\", \"My sources say no\", \"Outlook not so good\",\n \"Very doubtful\"].roll.put while prompt('? : ').chars;\n","language":"Raku"},{"code":"/* REXX */\nCall mk_a \"It is certain\", \"It is decidedly so\", \"Without a doubt\",,\n \"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\",,\n \"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\",,\n \"Reply hazy, try again\", \"Ask again later\",,\n \"Better not tell you now\", \"Cannot predict now\",,\n \"Concentrate and ask again\", \"Don't bet on it\",,\n \"My reply is no\", \"My sources say no\", \"Outlook not so good\",,\n \"Very doubtful\"\nDo Forever\n Say 'your question:'\n Parse Pull q\n If q='' Then Leave\n z=random(1,a.0)\n Say a.z\n Say ''\n End\nExit\nmk_a:\na.0=arg()\nDo i=1 To a.0\n a.i=arg(i)\n End\nReturn\n","language":"REXX"},{"code":"/*REXX program simulates the \"shaking\" of a \"Magic 8-ball\" and displaying an answer.*/\n$=\"It is certain ÷It is decidedly so ÷Without a doubt÷Yes, definitely÷Signs point to yes\",\n \"÷You may rely on it÷ As I see it, yes÷My reply is no÷Outlook good÷Outlook not so good\",\n \"÷Yes÷Ask again later÷Better not tell you now÷Cannot predict now÷Reply hazy, try again\",\n \"÷Concentrate and ask again÷Don't bet on it÷Most likely÷My sources say no÷Very doubtful\"\n\nsay space(translate(word(translate(translate($, '┼', \" \"), , '÷'), random(1, 20)), ,\"┼\")).\n","language":"REXX"},{"code":"# Project : Magic 8-Ball\n\nanswers = [\"It is certain\", \"It is decidedly so\", \"Without a doubt\",\n \"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\",\n \"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\",\n \"Reply hazy, try again\", \"Ask again later\",\n \"Better not tell you now\", \"Cannot predict now\",\n \"Concentrate and ask again\", \"Don't bet on it\",\n \"My reply is no\", \"My sources say no\", \"Outlook not so good\",\n \"Very doubtful\"]\nindex = random(len(answers)-1)+1\nsee answers[index] + nl\n","language":"Ring"},{"code":"#!/usr/bin/ruby\n\nclass EightBall\n def initialize\n print \"Welcome to 8 ball! Ask your question below. \"\n puts \"Type 'quit' to exit the program.\\n\\n\"\n @responses = [\"It is certain\", \"It is decidedly so\",\n \"Without a doubt\", \"Yes, definitely\",\n \"You may rely on it\", \"As I see it, yes\",\n \"Most likely\", \"Outlook good\",\n \"Signs point to yes\", \"Yes\",\n \"Reply hazy, try again\", \"Ask again later\",\n \"Better not tell you now\",\n \"Cannot predict now\",\n \"Concentrate and ask again\", \"Don't bet on it\",\n \"My reply is no\", \"My sources say no\",\n \"Outlook not so good\", \"Very doubtful\"]\n end\n\n def ask_question\n print \"Question: \"\n question = gets\n\n if question.chomp.eql? \"quit\"\n exit(0)\n end\n\n puts \"Response: #{@responses.sample} \\n\\n\"\n end\n\n def run\n loop do\n ask_question\n end\n end\nend\n\neight_ball = EightBall.new\neight_ball.run\n","language":"Ruby"},{"code":"extern crate rand;\n\nuse rand::prelude::*;\nuse std::io;\n\nfn main() {\n let answers = [\n \"It is certain\",\n \"It is decidedly so\",\n \"Without a doubt\",\n \"Yes, definitely\",\n \"You may rely on it\",\n \"As I see it, yes\",\n \"Most likely\",\n \"Outlook good\",\n \"Signs point to yes\",\n \"Yes\",\n \"Reply hazy, try again\",\n \"Ask again later\",\n \"Better not tell you now\",\n \"Cannot predict now\",\n \"Concentrate and ask again\",\n \"Don't bet on it\",\n \"My reply is no\",\n \"My sources say no\",\n \"Outlook not so good\",\n \"Very doubtful\",\n ];\n let mut rng = rand::thread_rng();\n let mut input_line = String::new();\n\n println!(\"Please enter your question or a blank line to quit.\\n\");\n loop {\n io::stdin()\n .read_line(&mut input_line)\n .expect(\"The read line failed.\");\n if input_line.trim() == \"\" {\n break;\n }\n println!(\"{}\\n\", answers.choose(&mut rng).unwrap());\n input_line.clear();\n }\n}\n","language":"Rust"},{"code":"class MAIN is\n const answers: ARRAY{STR} :=\n |\n \"It is certain.\", \"It is decidedly so.\",\n \"Without a doubt.\", \"Yes - definitely.\", \"You may rely on it.\",\n \"As I see it, yes.\", \"Most likely.\", \"Outlook good.\",\n \"Yes.\", \"Signs point to yes.\", \"Reply hazy, try again.\",\n \"Ask again later.\", \"Better not tell you now.\", \"Cannot predict now.\",\n \"Concentrate and ask again.\", \"Don't count on it.\", \"My reply is no.\",\n \"My sources say no.\", \"Outlook not so good.\", \"Very doubtful.\"\n |;\n main is\n RND::seed := #TIMES.wall_time;\n loop\n #OUT+\"Your question: \"; #OUT.flush;\n question ::= #IN.get_str;\n #OUT+answers[RND::int(0, answers.size-1)] + \"\\n\";\n end;\n end;\nend;\n","language":"Sather"},{"code":"import scala.util.Random\n\nobject Magic8Ball extends App {\n val shake: () => String = {\n val answers = List(\n \"It is certain.\", \"It is decidedly so.\", \"Without a doubt.\",\n \"Yes – definitely.\", \"You may rely on it.\", \"As I see it, yes.\",\n \"Most likely.\", \"Outlook good.\", \"Yes.\", \"Signs point to yes.\",\n \"Reply hazy, try again.\", \"Ask again later\", \"Better not tell you now.\",\n \"Cannot predict now.\", \"Concentrate and ask again.\", \"Don't count on it.\",\n \"My reply is no.\", \"My sources say no.\", \"Outlook not so good.\",\n \"Very doubtful.\"\n )\n val r = new Random\n () => answers(r.nextInt(answers.length))\n }\n\n println(\"Ask the Magic 8-Ball your questions. ('q' or 'quit' to quit)\\n\")\n\n while (true) {\n io.StdIn.readLine(\"Question: \").toLowerCase match {\n case \"q\" | \"quit\" =>\n println(\"Goodbye.\")\n sys.exit()\n case _ =>\n println(s\"Response: ${shake()}\\n\")\n }\n }\n}\n","language":"Sather"},{"code":"namespace path {::tcl::mathop ::tcl::mathfunc}\n\nset answers {\n\t\"As I see it, yes\"\n\t\"Ask again later\"\n\t\"Better not tell you now\"\n\t\"Cannot predict now\"\n\t\"Concentrate and ask again\"\n\t\"Don't bet on it\"\n\t\"It is certain\"\n\t\"It is decidedly so\"\n\t\"Most likely\"\n\t\"My reply is no\"\n\t\"My sources say maybe\"\n\t\"My sources say no\"\n\t\"Outlook good\"\n\t\"Outlook not so good\"\n\t\"Reply hazy, try again\"\n\t\"Signs point to yes\"\n\t\"Very doubtful\"\n\t\"Without a doubt\"\n\t\"Yes\"\n\t\"Yes, definitely\"\n\t\"Yes, probably not\"\n\t\"You may rely on it\"\n\t\"Your question has already been answered\"\n}\n\nputs -nonewline \"Question: \"; flush stdout\nwhile {[gets stdin line] > 0} {\n\tset answer [lindex $answers [int [* [rand] [llength $answers]]]]\n\tputs \"⑧ says “$answer”\"\n\tputs -nonewline \"Question: \"; flush stdout\n}\n","language":"Sather"},{"code":"10 PRINT \"Concentrate hard on your question, then tell me your favorite number.\"\n20 INPUT N\n30 REM in lieu of a random number generator\n40 IF N<0 THEN LET N=-N\n50 IF N<20 THEN GOTO 1000+N*10\n60 LET N=N-20\n70 GOTO 50\n1000 PRINT \"It is certain.\"\n1005 END\n1010 PRINT \"It is decidedly so.\"\n1015 END\n1020 PRINT \"Without a doubt.\"\n1025 END\n1030 PRINT \"Yes - definitely.\"\n1035 END\n1040 PRINT \"You may rely on it.\"\n1045 END\n1050 PRINT \"As I see it, yes.\"\n1055 END\n1060 PRINT \"Most likely.\"\n1065 END\n1070 PRINT \"Outlook good.\"\n1075 END\n1080 PRINT \"Yes.\"\n1085 END\n1090 PRINT \"Signs point to yes.\"\n1095 END\n1100 PRINT \"Reply hazy, try again.\"\n1105 END\n1110 PRINT \"Ask again later.\"\n1115 END\n1120 PRINT \"Better not tell you now.\"\n1125 END\n1130 PRINT \"Cannot predict now.\"\n1135 END\n1140 PRINT \"Concentrate and ask again.\"\n1145 END\n1150 PRINT \"Don't count on it.\"\n1155 END\n1160 PRINT \"My reply is no.\"\n1165 END\n1170 PRINT \"My sources say no.\"\n1175 END\n1180 PRINT \"Outlook not so good.\"\n1185 END\n1190 PRINT \"Very doubtful.\"\n","language":"Sather"},{"code":"#lang transd\n\nMainModule : {\n ans: [\"It is certain.\", \"It is decidedly so.\", \"Without a doubt.\",\n \"Yes - definitely.\", \"You may rely on it.\", \"As I see it, yes.\",\n \"Most likely.\", \"Outlook good.\", \"Yes.\", \"Signs point to yes.\",\n \"Reply hazy, try again.\", \"Ask again later.\",\n \"Better not tell you now.\", \"Cannot predict now.\",\n \"Concentrate and ask again.\", \"Don't count on it.\",\n \"My reply is no.\", \"My sources say no.\", \"Outlook not so good.\",\n \"Very doubtful.\"],\n\t_start: (lambda locals: sense 0 quest \"\"\n (while true\n (lout \"Please, ask your question:\")\n (getline quest)\n (if (not (size quest)) break)\n (if (neq (back quest) \"?\") (lout \"\\nEh?\") continue)\n (= sense 0)\n (tql quest reduce: [\"col1\"] using: (λ c Char() (+= sense c)))\n (lout (get ans (mod sense 20)))\n )\n )\n}\n","language":"Transd"},{"code":"DIM answer$(20)\nFOR i = 1 to ubound(answer$)\n READ answer$(i)\nNEXT i\nDATA \"It is certain.\", \"It is decidedly so.\"\nDATA \"Without a doubt.\", \"Yes – definitely.\"\nDATA \"You may rely on it.\", \"As I see it, yes.\"\nDATA \"Most likely.\", \"Outlook good.\", \"Yes.\"\nDATA \"Signs point to yes.\", \"Reply hazy, try again.\"\nDATA \"Ask again later.\", \"Better not tell you now.\"\nDATA \"Cannot predict now.\", \"Concentrate and ask again.\"\nDATA \"Don't count on it.\", \"My reply is no.\"\nDATA \"My sources say no.\", \"Outlook not so good.\"\nDATA \"Very doubtful.\"\n\nRANDOMIZE\nPRINT \"Q to quit.\"\nDO\n INPUT prompt \"What would you like to know? \": question$\n IF ucase$(question$) = \"Q\" then EXIT DO\n PRINT answer$(int(rnd*ubound(answer$)))\n PRINT\nLOOP\nEND\n","language":"True-BASIC"},{"code":"#!/bin/bash\n\ndeclare -ra RESPONSES=(\"It is certain\" \"It is decidedly so\" \"Without a doubt\"\n \"Yes definitely\" \"You may rely on it\" \"As I see it yes\"\n \"Most likely\" \"Outlook good\" \"Signs point to yes\" \"Yes\"\n \"Reply hazy try again\" \"Ask again later\"\n \"Better not tell you now\" \"Cannot predict now\"\n \"Concentrate and ask again\" \"Don't bet on it\"\n \"My reply is no\" \"My sources say no\" \"Outlook not so good\"\n \"Very doubtful\")\n\nprintf \"Welcome to 8 ball! Enter your questions using the prompt below to\nfind the answers you seek. Type 'quit' to exit.\\n\\n\"\n\nuntil\n read -p 'Enter Question: '\n [[ \"$REPLY\" == quit ]]\ndo printf \"Response: %s\\n\\n\" \"${RESPONSES[RANDOM % ${#RESPONSES[@]}]}\"\ndone\n","language":"UNIX-Shell"},{"code":"import \"random\" for Random\nimport \"io\" for Stdin, Stdout\n\nvar answers = [\n \"It is certain\", \"It is decidedly so\", \"Without a doubt\",\n \"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\",\n \"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\",\n \"Reply hazy, try again\", \"Ask again later\",\n \"Better not tell you now\", \"Cannot predict now\",\n \"Concentrate and ask again\", \"Don't bet on it\",\n \"My reply is no\", \"My sources say no\", \"Outlook not so good\",\n \"Very doubtful\"\n]\nvar rand = Random.new()\nSystem.print(\"Please enter your question or a blank line to quit.\")\nwhile (true) {\n System.write(\"\\n? : \")\n Stdout.flush()\n var question = Stdin.readLine()\n if (question.trim() == \"\") return\n var answer = answers[rand.int(20)]\n System.print(\"\\n%(answer)\")\n}\n","language":"Wren"},{"code":"set Responses = [\"It is Certain.\",\"It is decidedly so.\",\"Without a doubt.\",\"Yes definitely.\",\"You may rely on it\",\"As I see it, yes.\",\"Most likely.\",\"Outlook good.\",\"Yes.\",\"Sign points to yes.\",\"Reply hazy, try again.\",\"Ask again later.\",\"Better not tell you now.\",\"Cannot predict now.\",\"Concentrate and ask again.\",\"Don't count on it.\",\"My reply is no.\",\"My sources say no.\",\"Outlook not so good.\",\"Very doubtful.\"];\n\nwhile(true){\n\twindow->prompt(\"Ask 8-Ball a question\");\n\tlog(Responses[rnd(0,?Responses-1)]);\n}\n","language":"XBS"},{"code":"set Responses = [\"It is Certain.\",\"It is decidedly so.\",\"Without a doubt.\",\"Yes definitely.\",\"You may rely on it\",\"As I see it, yes.\",\"Most likely.\",\"Outlook good.\",\"Yes.\",\"Sign points to yes.\",\"Reply hazy, try again.\",\"Ask again later.\",\"Better not tell you now.\",\"Cannot predict now.\",\"Concentrate and ask again.\",\"Don't count on it.\",\"My reply is no.\",\"My sources say no.\",\"Outlook not so good.\",\"Very doubtful.\"];\n\nfunc Compile(String){\n\tset n = 0;\n\tforeach(k,v as String){\n\t\tn+=string.char(v);\n\t}\n\tsend n;\n}\n\nwhile(true){\n\tlet Response = window->prompt(\"Ask 8-Ball a question\");\n\tlet N = Compile(Response);\n\tlog(Responses[N%(?Responses)]);\n}\n","language":"XBS"},{"code":"int Answers, Answer, Question;\n[Answers:= [\n \"It is certain\", \"It is decidedly so\", \"Without a doubt\",\n \"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\",\n \"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\",\n \"Reply hazy, try again\", \"Ask again later\",\n \"Better not tell you now\", \"Cannot predict now\",\n \"Concentrate and ask again\", \"Don't bet on it\",\n \"My reply is no\", \"My sources say no\", \"Outlook not so good\",\n \"Very doubtful\"];\nText(0, \"Please enter your question or a blank line to quit.\n\");\nwhile true do\n [CrLf(0); Text(0, \"? : \");\n Question:= ChIn(0);\n if Question = \\CR\\$0D then return;\n OpenI(0); \\discard any remaining chars in keyboard buffer\n Answer:= Answers(Ran(20));\n Text(0, Answer); CrLf(0);\n ]\n]\n","language":"XPL0"},{"code":"dim answer$(19)\nfor i = 0 to arraysize(answer$(),1): read answer$(i): next i\n\nprint \"Q to quit.\"\ndo\n input \"What would you like to know? \" question$\n if upper$(question$) = \"Q\" then end : fi\n print answer$(int(ran(arraysize(answer$(),1))))\n print\nloop\n\ndata \"It is certain.\",\"It is decidedly so.\"\ndata \"Without a doubt.\",\"Yes – definitely.\"\ndata \"You may rely on it.\",\"As I see it, yes.\"\ndata \"Most likely.\",\"Outlook good.\",\"Yes.\"\ndata \"Signs point to yes.\",\"Reply hazy, try again.\"\ndata \"Ask again later.\",\"Better not tell you now.\"\ndata \"Cannot predict now.\",\"Concentrate and ask again.\"\ndata \"Don//t count on it.\",\"My reply is no.\"\ndata \"My sources say no.\",\"Outlook not so good.\"\ndata \"Very doubtful.\"\n","language":"Yabasic"},{"code":"answers:=T(\n \"It is certain\", \"It is decidedly so\", \"Without a doubt\",\n \"Yes, definitely\", \"You may rely on it\", \"As I see it, yes\",\n \"Most likely\", \"Outlook good\", \"Signs point to yes\", \"Yes\",\n \"Reply hazy, try again\", \"Ask again later\",\n \"Better not tell you now\", \"Cannot predict now\",\n \"Concentrate and ask again\", \"Don't bet on it\",\n \"My reply is no\", \"My sources say no\", \"Outlook not so good\",\n \"Very doubtful\"\n);\nprintln(\"Please enter your question or a blank line to quit.\");\nwhile(ask(\"? : \")){ println(answers[(0).random(answers.len())]) }\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Magic_8-ball\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nCreate Magic 8-Ball. \\n\\n\\nSee details at: [https://en.wikipedia.org/wiki/Magic_8-Ball Magic 8-Ball].\\n\\n\\n{{Template:strings}}\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V s = [‘It is certain’, ‘It is decidedly so’, ‘Without a doubt’, ‘Yes, definitely’,\\n ‘You may rely on it’, ‘As I see it, yes’, ‘Most likely’, ‘Outlook good’,\\n ‘Signs point to yes’, ‘Yes’, ‘Reply hazy, try again’, ‘Ask again later’,\\n ‘Better not tell you now’, ‘Cannot predict now’, ‘Concentrate and ask again’,\\n ‘Don't bet on it’, ‘My reply is no’, ‘My sources say no’, ‘Outlook not so good’,\\n ‘Very doubtful’]\\n\\nSet[String] qs\\n\\nL\\n V question = input(‘Ask your question:’)\\n I question.empty\\n L.break\\n\\n V answer = random:choice(s)\\n\\n I question C qs\\n print(‘Your question has already been answered’)\\n E\\n qs.add(question)\\n print(answer)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"bdos:\\t\\tequ\\t5\\t; CP/M calls\\nputs:\\t\\tequ\\t9\\ngets: \\t\\tequ\\t10\\n\\t\\torg\\t100h\\n\\t\\tlxi\\td,message\\t; Print message\\n\\t\\tmvi\\tc,puts\\n\\t\\tcall\\tbdos\\nquestion:\\tlxi\\td,prompt\\t; Ask for question\\n\\t\\tmvi\\tc,puts\\n\\t\\tcall\\tbdos\\n\\t\\tlxi\\td,bufdef\\t; Read answer\\n\\t\\tmvi\\tc,gets\\n\\t\\tcall\\tbdos\\n\\t\\tlxi\\td,newline\\t; Print newline\\n\\t\\tmvi\\tc,puts\\n\\t\\tcall\\tbdos\\n\\t\\tlxi\\th,buf\\t\\t; XOR the question w/ the RNG state\\n\\t\\tmvi\\tb,20\\t\\t\\nxorouter:\\tlxi\\td,xabcdat + 1\\n\\t\\tmvi\\tc,3\\nxorinner:\\tldax\\td\\n\\t\\txra\\tm\\n\\t\\tstax\\td\\n\\t\\tinx\\td\\n\\t\\tinx\\th\\n\\t\\tdcr\\tc\\n\\t\\tjnz\\txorinner\\n\\t\\tdcr\\tb\\n\\t\\tjnz\\txorouter\\ngetrnd:\\t\\tcall\\txabcrand\\t; Generate random number <20\\n\\t\\tani\\t1fh\\n\\t\\tcpi\\t20\\n\\t\\tjnc\\tgetrnd\\n\\t\\tinr\\ta\\n\\t\\tmov\\tb,a\\t\\t; That is the number of the message\\n\\t\\tlxi\\th,responses\\t; Skip that many strings\\n\\t\\tmvi\\ta,'$'\\nskipstring:\\tcmp\\tm\\n\\t\\tinx\\th\\n\\t\\tjnz\\tskipstring\\n\\t\\tdcr\\tb\\n\\t\\tjnz\\tskipstring\\n\\t\\txchg\\t\\t\\t; Print the chosen string\\n\\t\\tmvi\\tc,puts\\n\\t\\tcall\\tbdos\\n\\t\\tjmp\\tquestion\\t; Get another question\\n\\t\\t;; RNG to make it a little less predictable\\nxabcrand: lxi h,xabcdat\\n inr m ; X++\\n mov a,m ; X,\\n inx h ;\\n xra m ; ^ C,\\n inx h ;\\n xra m ; ^ A,\\n mov m,a ; -> A\\n inx h\\n add m ; + B,\\n mov m,a ; -> B\\n rar ; >>1\\n dcx h\\n xra m ; ^ A,\\n dcx h\\n add m ; + C\\n mov m,a ; -> C\\n ret\\t\\t\\n\\t\\t;; Strings\\nmessage:\\tdb\\t'Magic 8 Ball$'\\nnewline:\\tdb\\t13,10,'$'\\nprompt:\\t\\tdb\\t13,10,13,10,'What is your question? '\\n\\t\\t;; The possible responses\\nresponses:\\tdb\\t'$It is certain$It is decidedly so$Without a doubt$'\\n\\t\\tdb\\t'Yes, definitely$You may rely on it$As I see it, yes$'\\n\\t\\tdb\\t'Most likely$Outlook good$Signs point to yes$Yes$'\\n\\t\\tdb\\t'Reply hazy, try again$Ask again later$'\\n\\t\\tdb\\t'Better not tell you now$Cannot predict now$'\\n\\t\\tdb\\t'Concentrate and ask again$Don',39,'t bet on it$'\\n\\t\\tdb\\t'My reply is no$My sources say no$Outlook not so good$'\\n\\t\\tdb\\t'Very doubtful$'\\n\\t\\t;; Variables\\nbufdef:\\t\\tdb\\t60,0\\t\\t; 60 = 20*3\\nbuf:\\t\\tequ \\t$\\t\\t; question will be XOR'ed with the RNG state\\nxabcdat:\\tequ\\tbuf + 60 \\t; Point RNG data into uninitialized memory,\\n\\t\\t\\t\\t\\t; to make it more exciting.\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \".model small\\n.stack 1024\\n\\n.data\\nUserRam BYTE 256 DUP(0)\\nxorshift32_state_lo equ UserRam\\nxorshift32_state_hi equ UserRam+2\\n\\nAns0 byte \\\"It is certain.\\\",0\\nAns1 byte \\\"It is decidedly so.\\\",0\\nAns2 byte \\\"Signs point to yes.\\\",0\\nAns3 byte \\\"You can rely on it.\\\",0\\nAns4 byte \\\"Most likely.\\\",0\\nAns5 byte \\\"Cannot predict now.\\\",0\\nAns6 byte \\\"Reply hazy, try again.\\\",0\\nAns7 byte \\\"Outlook not so good.\\\",0\\nAns8 byte \\\"My sources say no.\\\",0\\nAns9 byte \\\"Very doubtful.\\\",0\\nAnsA byte \\\"Without a doubt.\\\",0\\nAnsB byte \\\"Outlook good.\\\",0\\nAnsC byte \\\"Ask again later.\\\",0\\nAnsD byte \\\"Better not tell you now.\\\",0\\nAnsE byte \\\"Don't count on it.\\\",0\\nAnsF byte \\\"Yes.\\\",0\\n\\nAnswerLookup word Ans0,Ans1,Ans2,Ans3,Ans4,Ans5,Ans6,Ans7\\n\\t word Ans8,Ans9,AnsA,AnsB,AnsC,AnsD,AnsE,AnsF\\n.code\\n\\nstart:\\n\\n\\tmov ax,@data\\n\\tmov ds,ax\\n\\t\\n\\tmov ax,@code\\n\\tmov es,ax\\n\\n\\t\\n\\tCLD\\t;have LODSB,MOVSB,STOSB,etc. auto-increment\\n\\t\\n\\tmov ax,03h\\n\\tint 10h ;sets video mode to MS-DOS text mode. Which the program is already in, so this just clears the screen.\\n\\t\\n\\tmov ah,2Ch\\n\\tint 21h ;returns hour:minute in cx, second:100ths of second in dx\\n mov word ptr [ds:xorshift32_state_lo],dx\\n mov word ptr [ds:xorshift32_state_hi],cx\\n\\t\\n\\tcall doXorshift32 ;uses the above memory locations as input. Do it three times just to mix it up some more\\n\\tcall doXorshift32\\n\\tcall doXorshift32\\n\\t\\n\\tmov ax,word ptr[ds:xorshift32_state_lo] ;get the random output from the RNG\\n\\tand al,0Fh\\t\\t\\n\\t;keep only the bottom nibble of al, there are only 16 possible messages.\\n\\tmov bx,offset AnswerLookup\\n\\tcall XLATW\\n\\t;translates AX using a table of words as a lookup table.\\n\\tmov si,ax ;use this looked-up value as the source index for our text.\\n\\tcall PrintString ;print to the screen\\n\\t\\n\\tmov ax,4C00h\\n\\tint 21h ;return to DOS\\n\\nXLATW:\\n;input: ds:bx = the table you wish to look up\\n;AL= the raw index into this table as if it were byte data.\\n;So don't left shift prior to calling this.\\n;AH is destroyed.\\n\\t\\tSHL AL,1\\n\\t\\tmov ah,al\\t;copy AL to AH\\n\\t\\tXLAT\\t\\t;returns low byte in al\\n\\t\\tinc ah\\n\\t\\txchg al,ah\\t;XLAT only works with AL\\n\\t\\tXLAT\\t\\t;returns high byte in al (old ah)\\n\\t\\txchg al,ah\\n\\t\\t;now the word is loaded into ax, big-endian.\\n\\t\\tret\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \"PROC Main()\\n DEFINE PTR=\\\"CARD\\\"\\n DEFINE COUNT=\\\"20\\\"\\n CHAR ARRAY s(256)\\n PTR ARRAY a(COUNT)\\n BYTE i\\n\\n a(0)=\\\"It is certain.\\\"\\n a(1)=\\\"It is decidedly so.\\\"\\n a(2)=\\\"Without a doubt.\\\"\\n a(3)=\\\"Yes - definitely.\\\"\\n a(4)=\\\"You may rely on it.\\\"\\n a(5)=\\\"As I see it, yes.\\\"\\n a(6)=\\\"Most likely.\\\"\\n a(7)=\\\"Outlook good.\\\"\\n a(8)=\\\"Yes.\\\"\\n a(9)=\\\"Signs point to yes.\\\"\\n a(10)=\\\"Reply hazy, try again.\\\"\\n a(11)=\\\"Ask again later.\\\"\\n a(12)=\\\"Better not tell you now.\\\"\\n a(13)=\\\"Cannot predict now.\\\"\\n a(14)=\\\"Concentrate and ask again.\\\"\\n a(15)=\\\"Don't count on it.\\\"\\n a(16)=\\\"My reply is no.\\\"\\n a(17)=\\\"My sources say no.\\\"\\n a(18)=\\\"Outlook not so good.\\\"\\n a(19)=\\\"Very doubtful.\\\"\\n\\n DO\\n PrintE(\\\"Enter your question or blank to exit:\\\")\\n InputS(s)\\n IF s(0)=0 THEN\\n EXIT\\n FI\\n i=Rand(COUNT)\\n PrintE(a(i))\\n PutE()\\n OD\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\nwith Ada.Strings; use Ada.Strings;\\nwith Ada.Numerics.Discrete_Random;\\n\\n\\nprocedure Main is\\n\\n\\n --Creation of type with all the possible answers\\n --\\n type Possible_Answers_Type is (It_Is_Certain, It_Is_Decidedly_So, Without_A_Doubt,\\n\\t\\t\\t\\t Yes_Definitely, You_May_Rely_On_It, As_I_See_It, Yes_Most_Likely,\\n\\t\\t\\t\\t Outlook_Good, Signs_Point_To_Yes, Yes_Reply_Hazy,\\n\\t\\t\\t\\t Try_Again, Ask_Again_Later, Better_Not_Tell_You_Now,\\n\\t\\t\\t\\t Cannot_Predict_Now, Concentrate_And_Ask_Again,\\n\\t\\t\\t\\t Dont_Bet_On_It, My_Reply_Is_No, My_Sources_Say_No,\\n\\t\\t\\t\\t Outlook_Not_So_Good, Very_Doubtful);\\n ---------------------------------------------------------------------\\n\\n\\n -- Variable declaration\\n Answer : Possible_Answers_Type := Possible_Answers_Type'First;\\n User_Question : String := \\\" \\\";\\n\\n -----------------------------------------------------------------------------\\n\\n\\n --Randomizer\\n --\\n package Random_Answer is new Ada.Numerics.Discrete_Random (Possible_Answers_Type);\\n use Random_Answer;\\n G : Generator;\\n\\nbegin\\n\\n Reset (G); -- Starts the generator in a unique state in each run\\n\\n --User get provides question\\n Put_Line (\\\"Welcome.\\\"); New_Line;\\n\\n Put_Line (\\\"WARNING!!! Please remember that there's no need to shake your device for this program to work, and shaking your device could damage it\\\");\\n New_Line;\\n\\n Put_Line (\\\"What's your question? \\\");\\n Get (Item => User_Question); New_Line;\\n\\n\\n --Output Answer\\n Answer := (Random (G)); --Assigns random answer to variable Answer\\n\\n Put (Answer'Image); --Prints Answer\\n\\nend Main;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"BEGIN\\n []STRING answers = (\\\"It is certain.\\\", \\\"It is decidedly so.\\\",\\n \\\"Without a doubt.\\\", \\\"Yes - definitely.\\\", \\\"You may rely on it.\\\",\\n \\\"As I see it, yes.\\\", \\\"Most likely.\\\", \\\"Outlook good.\\\",\\n \\\"Yes.\\\", \\\"Signs point to yes.\\\", \\\"Reply hazy, try again.\\\",\\n \\\"Ask again later.\\\", \\\"Better not tell you now.\\\", \\\"Cannot predict now.\\\",\\n \\\"Concentrate and ask again.\\\", \\\"Don't count on it.\\\", \\\"My reply is no.\\\",\\n \\\"My sources say no.\\\", \\\"Outlook not so good.\\\", \\\"Very doubtful.\\\");\\n DO\\n REF STRING question := LOC STRING;\\n print(\\\"Your question: \\\");\\n read((question, new line));\\n print((answers[ENTIER (random * UPB answers) + 1], new line))\\n OD\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \" set the answers to {\\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\", \\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\", \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\", \\\"Reply hazy, try again\\\", \\\"Ask again later\\\", \\\"Better not tell you now\\\", \\\"Cannot predict now\\\", \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\", \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\", \\\"Very doubtful\\\"}\\n\\ndisplay dialog some item of the answers\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \" 0 DIM F$(19): FOR I = 0 TO 19: READ F$(I): NEXT :M$ = CHR$ (13): DEF FN U(K) = K - 32 * (K > 95): FOR Q = 0 TO 1: HOME : PRINT M$\\\" PRESS ANY KEY TO REVEAL YOUR FORTUNE.\\\"M$M$\\\" PRESS Q TO QUIT.\\\"M$M$\\\" \\\";:FO = INT ( RND (1) * 20): GET K$\\n 1 K$ = CHR$ ( FN U( ASC (K$))):Q = K$ = \\\"Q\\\": IF NOT Q THEN HOME : PRINT M$\\\" YOUR FORTUNE READS:\\\"M$M$ SPC( 5);F$(FO)M$M$\\\" AGAIN? (Y/N) \\\";: GET K$:K$ = CHR$ ( FN U( ASC (K$))):Q = K$ < > \\\"Y\\\"\\n 2 NEXT Q: DATA \\\"IT IS CERTAIN.\\\",\\\"IT IS DECIDEDLY SO.\\\",\\\"WITHOUT A DOUBT.\\\",\\\"YES DEFINITELY.\\\",\\\"YOU MAY RELY ON IT.\\\",\\\"AS I SEE IT, YES.\\\",\\\"MOST LIKELY.\\\",\\\"OUTLOOK GOOD.\\\",\\\"YES.\\\",\\\"SIGNS POINT TO YES.\\\"\\n 3 DATA \\\"REPLY HAZY, TRY AGAIN.\\\",\\\"ASK AGAIN LATER.\\\",\\\"BETTER NOT TELL YOU NOW.\\\",\\\"CANNOT PREDICT NOW.\\\",\\\"CONCENTRATE AND ASK AGAIN.\\\",\\\"DON'T COUNT ON IT.\\\",\\\"MY REPLY IS NO.\\\",\\\"MY SOURCES SAY NO.\\\",\\\"OUTLOOK NOT SO GOOD.\\\",\\\"VERY DOUBTFUL.\\\"\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"answers: [\\n \\\"It is certain\\\" \\\"It is decidedly so\\\" \\\"Without a doubt\\\"\\n \\\"Yes, definitely\\\" \\\"You may rely on it\\\" \\\"As I see it, yes\\\"\\n \\\"Most likely\\\" \\\"Outlook good\\\" \\\"Signs point to yes\\\" \\\"Yes\\\"\\n \\\"Reply hazy, try again\\\" \\\"Ask again later\\\"\\n \\\"Better not tell you now\\\" \\\"Cannot predict now\\\"\\n \\\"Concentrate and ask again\\\" \\\"Don't bet on it\\\"\\n \\\"My reply is no\\\" \\\"My sources say no\\\" \\\"Outlook not so good\\\"\\n \\\"Very doubtful\\\"\\n]\\n\\nwhile ø [\\n input \\\"Ask a question: \\\"\\n print sample answers\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"answers := [\\n(join\\n\\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",\\\"Yes, definitely\\\",\\n\\\"You may rely on it\\\", \\\"As I see it, yes\\\",\\\"Most likely\\\", \\\"Outlook good\\\",\\n\\\"Signs point to yes\\\", \\\"Yes\\\",\\\"Reply hazy, try again\\\", \\\"Ask again later\\\",\\n\\\"Better not tell you now\\\", \\\"Cannot predict now\\\",\\\"Concentrate and ask again\\\",\\n\\\"Don't bet on it\\\",\\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",\\n\\\"Very doubtful\\\"\\n)]\\nAsk:\\nInputBox, Question, Magic 8-Ball, Please ask your question or a blank line to quit.,,, 130\\nRandom, rnd, 1, 20\\nif !question\\n\\tExitApp\\nMsgBox % answers[rnd]\\ngosub, Ask\\nreturn\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f MAGIC_8-BALL.AWK\\nBEGIN {\\n# Ten answers are affirmative, five are non-committal, and five are negative.\\n arr[++i] = \\\"It is certain\\\"\\n arr[++i] = \\\"It is decidedly so\\\"\\n arr[++i] = \\\"Without a doubt\\\"\\n arr[++i] = \\\"Yes, definitely\\\"\\n arr[++i] = \\\"You may rely on it\\\"\\n arr[++i] = \\\"As I see it, yes\\\"\\n arr[++i] = \\\"Most likely\\\"\\n arr[++i] = \\\"Outlook good\\\"\\n arr[++i] = \\\"Signs point to yes\\\"\\n arr[++i] = \\\"Yes\\\"\\n arr[++i] = \\\"Reply hazy, try again\\\"\\n arr[++i] = \\\"Ask again later\\\"\\n arr[++i] = \\\"Better not tell you now\\\"\\n arr[++i] = \\\"Cannot predict now\\\"\\n arr[++i] = \\\"Concentrate and ask again\\\"\\n arr[++i] = \\\"Don't bet on it\\\"\\n arr[++i] = \\\"My reply is no\\\"\\n arr[++i] = \\\"My sources say no\\\"\\n arr[++i] = \\\"Outlook not so good\\\"\\n arr[++i] = \\\"Very doubtful\\\"\\n srand()\\n printf(\\\"Please enter your question or a blank line to quit.\\\\n\\\")\\n while (1) {\\n printf(\\\"\\\\n? \\\")\\n getline ans\\n if (ans ~ /^ *$/) {\\n break\\n }\\n printf(\\\"%s\\\\n\\\",arr[int(rand()*i)+1])\\n }\\n exit(0)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"dim answer$(20)\\nanswer$[0] = \\\"It is certain.\\\"\\nanswer$[1] = \\\"It is decidedly so.\\\"\\nanswer$[2] = \\\"Without a doubt.\\\"\\nanswer$[3] = \\\"Yes - definitely.\\\"\\nanswer$[4] = \\\"You may rely on it.\\\"\\nanswer$[5] = \\\"As I see it, yes.\\\"\\nanswer$[6] = \\\"Most likely.\\\"\\nanswer$[7] = \\\"Outlook good.\\\"\\nanswer$[8] = \\\"Yes.\\\"\\nanswer$[9] = \\\"Signs point to yes.\\\"\\nanswer$[10] = \\\"Reply hazy, try again.\\\"\\nanswer$[11] = \\\"Ask again later.\\\"\\nanswer$[12] = \\\"Better not tell you now.\\\"\\nanswer$[13] = \\\"Cannot predict now.\\\"\\nanswer$[14] = \\\"Concentrate and ask again.\\\"\\nanswer$[15] = \\\"Don't count on it.\\\"\\nanswer$[16] = \\\"My reply is no.\\\"\\nanswer$[17] = \\\"My sources say no.\\\"\\nanswer$[18] = \\\"Outlook not so good.\\\"\\nanswer$[19] = \\\"Very doubtful.\\\"\\n\\nprint \\\"Q to quit.\\\"\\nwhile True\\n\\tinput string \\\"What would you like to know? \\\", question$\\n\\tif upper(question$) = \\\"Q\\\" then exit while\\n\\tprint answer$[int(rand * answer$[?])]\\n\\tprint\\nend while\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <time.h>\\n\\nint main() {\\n char *question = NULL;\\n size_t len = 0;\\n ssize_t read;\\n const char* answers[20] = {\\n \\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",\\n \\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\",\\n \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\",\\n \\\"Reply hazy, try again\\\", \\\"Ask again later\\\",\\n \\\"Better not tell you now\\\", \\\"Cannot predict now\\\",\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",\\n \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",\\n \\\"Very doubtful\\\"\\n };\\n srand(time(NULL));\\n printf(\\\"Please enter your question or a blank line to quit.\\\\n\\\");\\n while (1) {\\n printf(\\\"\\\\n? : \\\");\\n read = getline(&question, &len, stdin);\\n if (read < 2) break;\\n printf(\\\"\\\\n%s\\\\n\\\", answers[rand() % 20]);\\n }\\n if (question) free(question);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <array>\\n#include <cstdlib>\\n#include <ctime>\\n#include <iostream>\\n#include <string>\\n\\nint main()\\n{\\n constexpr std::array<const char*, 20> answers = {\\n \\\"It is certain.\\\",\\n \\\"It is decidedly so.\\\",\\n \\\"Without a doubt.\\\",\\n \\\"Yes - definitely.\\\",\\n \\\"You may rely on it.\\\",\\n \\\"As I see it, yes.\\\",\\n \\\"Most likely.\\\",\\n \\\"Outlook good.\\\",\\n \\\"Yes.\\\",\\n \\\"Signs point to yes.\\\",\\n \\\"Reply hazy, try again.\\\",\\n \\\"Ask again later.\\\",\\n \\\"Better not tell you now.\\\",\\n \\\"Cannot predict now.\\\",\\n \\\"Concentrate and ask again.\\\",\\n \\\"Don't count on it.\\\",\\n \\\"My reply is no.\\\",\\n \\\"My sources say no.\\\",\\n \\\"Outlook not so good.\\\",\\n \\\"Very doubtful.\\\"\\n };\\n\\n std::string input;\\n std::srand(std::time(nullptr));\\n while (true) {\\n std::cout << \\\"\\\\n? : \\\";\\n std::getline(std::cin, input);\\n\\n if (input.empty()) {\\n break;\\n }\\n\\n std::cout << answers[std::rand() % answers.size()] << '\\\\n';\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nnamespace newProg\\n{\\n\\n class Program\\n {\\n static void Main(string[] args)\\n {\\n string[] answers =\\n {\\n \\\"It is certain.\\\",\\n \\\"It is decidedly so.\\\",\\n \\\"Without a doubt.\\\",\\n \\\"Yes – definitely.\\\",\\n \\\"You may rely on it.\\\",\\n \\\"As I see it, yes.\\\",\\n \\\"Most likely.\\\",\\n \\\"Outlook good.\\\",\\n \\\"Yes.\\\",\\n \\\"Signs point to yes.\\\",\\n \\\"Reply hazy, try again.\\\",\\n \\\"Ask again later\\\",\\n \\\"Better not tell you now.\\\",\\n \\\"Cannot predict now.\\\",\\n \\\"Concentrate and ask again.\\\",\\n \\\"Don't count on it.\\\",\\n \\\"My reply is no.\\\",\\n \\\"My sources say no.\\\",\\n \\\"Outlook not so good.\\\",\\n \\\"Very doubtful.\\\"\\n };\\n\\n while (true)\\n {\\n Random rnd = new Random();\\n int result = rnd.Next(0, 19);\\n\\n Console.WriteLine(\\\"Magic 8 Ball! Ask question and hit a key for the answer!\\\");\\n\\n string inp = Console.ReadLine();\\n\\n Console.WriteLine(answers[result]);\\n\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"#!/var/cfengine/bin/cf-agent --no-lock\\nbundle agent __main__\\n{\\n methods: \\\"rosettacode_org:magic_8_ball\\\";\\n}\\nbody file control\\n{\\n namespace => \\\"rosettacode_org\\\";\\n}\\nbundle agent magic_8_ball\\n{\\n vars:\\n \\\"_responses\\\"\\n slist => {\\n \\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",\\n \\\"Yes definitely\\\", \\\"You may rely on it\\\", \\\"As I see it yes\\\",\\n \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\",\\n \\\"Reply hazy try again\\\", \\\"Ask again later\\\",\\n \\\"Better not tell you now\\\", \\\"Cannot predict now\\\",\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",\\n \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",\\n \\\"Very doubtful\\\",\\n };\\n \\\"_selected_response\\\"\\n int => randomint( 0, length( _responses) ),\\n unless => isvariable( \\\"$(this.namespace):$(this.promiser)\\\" );\\n\\n \\\"_consideration_time\\\"\\n int => randomint( 3, 5),\\n unless => isvariable( \\\"$(this.namespace):$(this.promiser)\\\" );\\n\\n commands:\\n \\\"/bin/sleep $(_consideration_time)\\\"\\n inform => \\\"false\\\",\\n handle => \\\"consider\\\",\\n depends_on => { \\\"think\\\" },\\n comment => \\\"This magic 8 ball takes a few seconds to consider the answer\\n after you bring your question to mind.\\\";\\n\\n reports:\\n \\\"Think about your question ...\\\"\\n handle => \\\"think\\\";\\n\\n \\\"Response: $(with)\\\"\\n with => nth( _responses, $(_selected_response) ),\\n depends_on => { \\\"consider\\\" };\\n}\\n\",\n \"language\": \"CFEngine\"\n },\n {\n \"code\": \"100 cls\\n110 data \\\"It is certain.\\\",\\\"It is decidedly so.\\\"\\n120 data \\\"Without a doubt.\\\",\\\"Yes - definitely.\\\"\\n130 data \\\"You may rely on it.\\\",\\\"As I see it, yes.\\\"\\n140 data \\\"Most likely.\\\",\\\"Outlook good.\\\"\\n150 data \\\"Yes.\\\",\\\"Signs point to yes.\\\"\\n160 data \\\"Reply hazy, try again.\\\",\\\"Ask again later.\\\"\\n170 data \\\"Better not tell you now.\\\",\\\"Cannot predict now.\\\"\\n180 data \\\"Concentrate and ask again.\\\",\\\"Don't count on it.\\\"\\n190 data \\\"My reply is no.\\\",\\\"My sources say no.\\\"\\n200 data \\\"Outlook not so good.\\\",\\\"Very doubtful.\\\"\\n210 dim m8ball$(20)\\n220 for i = 0 to 19\\n230 read m8ball$(i)\\n240 next i\\n250 randomize timer\\n260 input \\\"What would you like to know? \\\",q$\\n270 print m8ball$(int(rnd(20)))\\n280 end\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"(def responses\\n [\\\"It is certain\\\" \\\"It is decidedly so\\\" \\\"Without a doubt\\\"\\n \\\"Yes, definitely\\\" \\\"You may rely on it\\\" \\\"As I see it, yes\\\"\\n \\\"Most likely\\\" \\\"Outlook good\\\" \\\"Signs point to yes\\\" \\\"Yes\\\"\\n \\\"Reply hazy, try again\\\" \\\"Ask again later\\\"\\n \\\"Better not tell you now\\\" \\\"Cannot predict now\\\"\\n \\\"Concentrate and ask again\\\" \\\"Don't bet on it\\\"\\n \\\"My reply is no\\\" \\\"My sources say no\\\" \\\"Outlook not so good\\\"\\n \\\"Very doubtful\\\"])\\n\\n(do\\n (println \\\"Ask a question. \\\")\\n (read-line)\\n (println (rand-nth responses)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"CMAKE_MINIMUM_REQUIRED(VERSION 3.6)\\n\\nPROJECT(EightBall)\\n\\nSET(CMAKE_DISABLE_SOURCE_CHANGES ON)\\nSET(CMAKE_DISABLE_IN_SOURCE_BUILD ON)\\n\\nLIST(APPEND RESPONSES \\\"It is certain.\\\" \\\"It is decidedly so.\\\" \\\"Without a doubt.\\\")\\nLIST(APPEND RESPONSES \\\"Yes - definitely.\\\" \\\"You may rely on it.\\\")\\nLIST(APPEND RESPONSES \\\"As I see it yes.\\\" \\\"Most likely.\\\" \\\"Outlook good.\\\")\\nLIST(APPEND RESPONSES \\\"Yes.\\\" \\\"Signs point to yes.\\\" \\\"Reply hazy try again.\\\")\\nLIST(APPEND RESPONSES \\\"Ask again later.\\\" \\\"Better not tell you now.\\\")\\nLIST(APPEND RESPONSES \\\"Cannot predict now.\\\" \\\"Concentrate and ask again.\\\")\\nLIST(APPEND RESPONSES \\\"Don't count on it.\\\" \\\"My reply is no.\\\")\\nLIST(APPEND RESPONSES \\\"My sources say no.\\\" \\\"Outlook not so good.\\\" \\\"Very doubtful.\\\")\\n\\nFUNCTION(RANDOM_RESPONSE)\\n STRING(RANDOM LENGTH 1 ALPHABET 01 TENS)\\n STRING(RANDOM LENGTH 1 ALPHABET 0123456789 UNITS)\\n MATH(EXPR INDEX \\\"${TENS}${UNITS}\\\")\\n LIST(GET RESPONSES ${INDEX} RESPONSE)\\n MESSAGE(STATUS \\\"Question: ${QUESTION}\\\")\\n MESSAGE(STATUS \\\"Response: ${RESPONSE}\\\")\\nENDFUNCTION(RANDOM_RESPONSE)\\n\\nOPTION(QUESTION \\\"User's input question\\\" \\\"\\\")\\n\\nMESSAGE(\\\"===================== 8 Ball =====================\\\")\\nIF(NOT QUESTION)\\n MESSAGE(STATUS \\\"Welcome to 8 ball! Please provide a question \\\")\\n MESSAGE(STATUS \\\"using the flag -DQUESTION=\\\\\\\"my question\\\\\\\"\\\")\\nELSE()\\n RANDOM_RESPONSE()\\nENDIF()\\nMESSAGE(\\\"==================================================\\\")\\n\\n\\nADD_CUSTOM_TARGET(${PROJECT_NAME} ALL)\\n\",\n \"language\": \"CMake\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. 8BALL.\\n AUTHOR. Bill Gunshannon\\n INSTALLATION.\\n DATE-WRITTEN. 12 March 2024\\n ************************************************************\\n ** Program Abstract:\\n ** Just ask the Magic 8 Ball and all will be revealed.\\n ************************************************************\\n\\n ENVIRONMENT DIVISION.\\n\\n DATA DIVISION.\\n\\n WORKING-STORAGE SECTION.\\n\\n 01 ANSWER-TABLE.\\n 10 ANSWER01 PIC X(40)\\n\\t VALUE \\\"As I see it, yes \\\".\\n 10 ANSWER02 PIC X(40)\\n\\t VALUE \\\"Ask again later \\\".\\n 10 ANSWER03 PIC X(40)\\n\\t VALUE \\\"Better not tell you now \\\".\\n 10 ANSWER04 PIC X(40)\\n\\t VALUE \\\"Cannot predict now \\\".\\n 10 ANSWER05 PIC X(40)\\n\\t VALUE \\\"Concentrate and ask again \\\".\\n 10 ANSWER06 PIC X(40)\\n\\t VALUE \\\"Don't bet on it \\\".\\n 10 ANSWER07 PIC X(40)\\n\\t VALUE \\\"It is certain \\\".\\n 10 ANSWER08 PIC X(40)\\n\\t VALUE \\\"It is decidedly so \\\".\\n 10 ANSWER09 PIC X(40)\\n\\t VALUE \\\"Most likely \\\".\\n 10 ANSWER10 PIC X(40)\\n\\t VALUE \\\"My reply is no \\\".\\n 10 ANSWER11 PIC X(40)\\n\\t VALUE \\\"My sources say maybe \\\".\\n 10 ANSWER12 PIC X(40)\\n\\t VALUE \\\"My sources say no \\\".\\n 10 ANSWER13 PIC X(40)\\n\\t VALUE \\\"Outlook good \\\".\\n 10 ANSWER14 PIC X(40)\\n\\t VALUE \\\"Outlook not so good \\\".\\n 10 ANSWER15 PIC X(40)\\n\\t VALUE \\\"Reply hazy, try again \\\".\\n 10 ANSWER16 PIC X(40)\\n\\t VALUE \\\"Signs point to yes \\\".\\n 10 ANSWER17 PIC X(40)\\n\\t VALUE \\\"Very doubtful \\\".\\n 10 ANSWER18 PIC X(40)\\n\\t VALUE \\\"Without a doubt \\\".\\n 10 ANSWER19 PIC X(40)\\n\\t VALUE \\\"Yes \\\".\\n 10 ANSWER20 PIC X(40)\\n\\t VALUE \\\"Yes, definitely \\\".\\n 10 ANSWER21 PIC X(40)\\n\\t VALUE \\\"Yes, probably not \\\".\\n 10 ANSWER22 PIC X(40)\\n\\t VALUE \\\"You may rely on it \\\".\\n 10 ANSWER23 PIC X(40)\\n\\t VALUE \\\"Your question has already been answered \\\".\\n 01 PRINT-ANSWER REDEFINES ANSWER-TABLE OCCURS 23 TIMES.\\n 10 THE-BALL-SPEAKS PIC X(40).\\n\\n 01 RND PIC 99999.\\n 01 QUESTION PIC X(72).\\n 01 GREETING PIC X(30)\\n VALUE \\\"Ask and all will be revealed!!\\\".\\n\\n\\n PROCEDURE DIVISION.\\n\\n Main-Program.\\n DISPLAY GREETING.\\n ACCEPT QUESTION.\\n MOVE FUNCTION CURRENT-DATE(1:16) TO RND.\\n PERFORM 8-BALL.\\n\\n STOP RUN.\\n\\n 8-BALL.\\n COMPUTE RND =\\n FUNCTION RANDOM(RND) * 11111.\\n DISPLAY PRINT-ANSWER(FUNCTION MOD(RND, 23)).\\n\\n\\n END-PROGRAM.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"10 dim f$(19):for i=0 to 19:read f$(i):next\\n20 print chr$(147);chr$(14)\\n30 print \\\"Press any key to reveal your fortune.\\\"\\n40 print:print \\\"Press Q to quit.\\\":print\\n50 fo=int(rnd(1)*20):get k$:if k$=\\\"\\\" then 50\\n60 if k$=\\\"q\\\" then print \\\"Good luck!\\\":end\\n70 print \\\"Your fortune reads:\\\"\\n80 print spc(5);f$(fo):print\\n90 print \\\"Again? (Y/N)\\\"\\n100 get k$:if k$=\\\"\\\" then 100\\n110 if k$=\\\"y\\\" then goto 20\\n120 end\\n1000 data \\\"It is certain.\\\",\\\"It is decidedly so.\\\"\\n1010 data \\\"Without a doubt.\\\",\\\"Yes – definitely.\\\"\\n1020 data \\\"You may rely on it.\\\",\\\"As I see it, yes.\\\"\\n1030 data \\\"Most likely.\\\",\\\"Outlook good.\\\",\\\"Yes.\\\"\\n1040 data \\\"Signs point to yes.\\\",\\\"Reply hazy, try again.\\\"\\n1050 data \\\"Ask again later.\\\",\\\"Better not tell you now.\\\"\\n1060 data \\\"Cannot predict now.\\\",\\\"Concentrate and ask again.\\\"\\n1070 data \\\"Don't count on it.\\\",\\\"My reply is no.\\\"\\n1080 data \\\"My sources say no.\\\",\\\"Outlook not so good.\\\"\\n1090 data \\\"Very doubtful.\\\"\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"title \\\"Magic 8 Ball\\\"\\n\\nresize 0, 0, 340, 150\\ncenter\\n\\nbgcolor 0, 0, 255\\ncls graphics\\n\\nformid 1\\nformtext \\\"Think of a question and select the magic button.\\\"\\nstaticform 10, 10, 310, 20\\nbgcolor 0, 0, 0\\nfgcolor 255, 0, 255\\ncolorform\\n\\nformid 2\\nformtext \\\"Magic Button\\\"\\nbuttonform 115, 50, 100, 20\\nbgcolor 255, 0, 0\\nfgcolor 0, 0, 255\\ncolorform\\n\\ndo\\n\\n\\n\\tif forms = 2 then\\n\\n\\t\\tgosub magicbutton\\n\\n\\tendif\\n\\n\\tbutton k, 27\\n\\n\\twait\\n\\nloop k = 0\\n\\nend\\n\\nsub magicbutton\\n\\n\\tlet r = int(rnd * 20) + 1\\n\\n\\tif r = 1 then\\n\\n\\t\\talert \\\"It is certain.\\\"\\n\\n\\tendif\\n\\n\\tif r = 2 then\\n\\n\\t\\talert \\\"It is decidedly so.\\\"\\n\\n\\tendif\\n\\n\\tif r = 3 then\\n\\n\\t\\talert \\\"Without a doubt.\\\"\\n\\n\\tendif\\n\\n\\tif r = 4 then\\n\\n\\t\\talert \\\"Yes – definitely.\\\"\\n\\n\\tendif\\n\\n\\tif r = 5 then\\n\\n\\t\\talert \\\"You may rely on it.\\\"\\n\\n\\tendif\\n\\n\\tif r = 6 then\\n\\n\\t\\talert \\\"As I see it\\\", comma, \\\" yes.\\\"\\n\\n\\tendif\\n\\n\\tif r = 7 then\\n\\n\\t\\talert \\\"Most likely.\\\"\\n\\n\\tendif\\n\\n\\tif r = 8 then\\n\\n\\t\\talert \\\"Outlook good.\\\"\\n\\n\\tendif\\n\\n\\tif r = 9 then\\n\\n\\t\\talert \\\"Yes.\\\"\\n\\n\\tendif\\n\\n\\tif r = 10 then\\n\\n\\t\\talert \\\"Signs point to yes.\\\"\\n\\n\\tendif\\n\\n\\tif r = 11 then\\n\\n\\t\\talert \\\"Reply hazy\\\", comma, \\\" try again.\\\"\\n\\n\\tendif\\n\\n\\tif r = 12 then\\n\\n\\t\\talert \\\"Ask again later.\\\"\\n\\n\\tendif\\n\\n\\tif r = 13 then\\n\\n\\t\\talert \\\"Better not tell you now.\\\"\\n\\n\\tendif\\n\\n\\tif r = 14 then\\n\\n\\t\\talert \\\"Cannot predict now.\\\"\\n\\n\\tendif\\n\\n\\tif r = 15 then\\n\\n\\t\\talert \\\"Concentrate and ask again.\\\"\\n\\n\\tendif\\n\\n\\tif r = 16 then\\n\\n\\t\\talert \\\"Don't count on it.\\\"\\n\\n\\tendif\\n\\n\\tif r = 17 then\\n\\n\\t\\talert \\\"My reply is no.\\\"\\n\\n\\tendif\\n\\n\\tif r = 18 then\\n\\n\\t\\talert \\\"My sources say no.\\\"\\n\\n\\tendif\\n\\n\\tif r = 19 then\\n\\n\\t\\talert \\\"Outlook not so good.\\\"\\n\\n\\tendif\\n\\n\\tif r = 20 then\\n\\n\\t\\talert \\\"Very doubtful.\\\"\\n\\n\\tendif\\n\\nreturn\\n\",\n \"language\": \"Craft-Basic\"\n },\n {\n \"code\": \"import std.random, std.stdio, std.string;\\n\\nconst string[] responses = [\\\"It is certain\\\", \\\"It is decidedly so\\\",\\n \\\"Without a doubt\\\", \\\"Yes, definitely\\\",\\n \\\"You may rely on it\\\", \\\"As I see it, yes\\\",\\n \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\",\\n \\\"Yes\\\", \\\"Reply hazy, try again\\\", \\\"Ask again later\\\",\\n \\\"Better not tell you now\\\", \\\"Cannot predict now\\\",\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",\\n \\\"My reply is no\\\", \\\"My sources say no\\\",\\n \\\"Outlook not so good\\\", \\\"Very doubtful\\\"];\\n\\nvoid main()\\n{\\n string question = \\\"\\\";\\n auto rnd = Random(unpredictableSeed);\\n int index = -1;\\n\\n writeln(\\\"Welcome to 8 ball! Please enter your question to \\\");\\n write(\\\"find the answers you seek.\\\");\\n write(\\\"Type 'quit' to exit.\\\", \\\"\\\\n\\\\n\\\");\\n\\n while(true)\\n {\\n write(\\\"Question: \\\");\\n question = stdin.readln();\\n if(strip(question) == \\\"quit\\\")\\n {\\n break;\\n }\\n write(\\\"Response: \\\");\\n index = uniform(0, 20, rnd);\\n write(responses[index], \\\"\\\\n\\\\n\\\");\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Magic_8_ball;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils,\\n windows;\\n\\n// https://stackoverflow.com/questions/29794559/delphi-console-xe7-clearscreen\\nprocedure ClearScreen;\\nvar\\n stdout: THandle;\\n csbi: TConsoleScreenBufferInfo;\\n ConsoleSize: DWORD;\\n NumWritten: DWORD;\\n Origin: TCoord;\\nbegin\\n stdout := GetStdHandle(STD_OUTPUT_HANDLE);\\n Win32Check(stdout <> INVALID_HANDLE_VALUE);\\n Win32Check(GetConsoleScreenBufferInfo(stdout, csbi));\\n ConsoleSize := csbi.dwSize.X * csbi.dwSize.Y;\\n Origin.X := 0;\\n Origin.Y := 0;\\n Win32Check(FillConsoleOutputCharacter(stdout, ' ', ConsoleSize, Origin, NumWritten));\\n Win32Check(FillConsoleOutputAttribute(stdout, csbi.wAttributes, ConsoleSize,\\n Origin, NumWritten));\\n Win32Check(SetConsoleCursorPosition(stdout, Origin));\\nend;\\n\\nconst\\n answers: array[0..19] of string = ('It is certain.', 'It is decidedly so.',\\n 'Without a doubt.', 'Yes – definitely.', 'You may rely on it.',\\n 'As I see it, yes.', 'Most likely.', 'Outlook good.', 'Yes.',\\n 'Signs point to yes.', 'Reply hazy, try again.', 'Ask again later',\\n 'Better not tell you now.', 'Cannot predict now.',\\n 'Concentrate and ask again.', 'Don''t count on it.', 'My reply is no.',\\n 'My sources say no.', 'Outlook not so good.', 'Very doubtful.');\\n\\nbegin\\n Randomize;\\n while True do\\n begin\\n writeln('Magic 8 Ball! Ask question and hit ENTER key for the answer!');\\n readln;\\n ClearScreen;\\n writeln(answers[Random(length(answers))], #10#10#10);\\n writeln('(Hit ENTER key to ask again)');\\n readln;\\n ClearScreen;\\n end;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"answers$[] = [ \\\"It is certain\\\" \\\"It is decidedly so\\\" \\\"Without a doubt\\\" \\\"Yes, definitely\\\" \\\"You may rely on it\\\" \\\"As I see it, yes\\\" \\\"Most likely\\\" \\\"Outlook good\\\" \\\"Signs point to yes\\\" \\\"Yes\\\" \\\"Reply hazy, try again\\\" \\\"Ask again later\\\" \\\"Better not tell you now\\\" \\\"Cannot predict now\\\" \\\"Concentrate and ask again\\\" \\\"Don't bet on it\\\" \\\"My reply is no\\\" \\\"My sources say no\\\" \\\"Outlook not so good\\\" \\\"Very doubtful\\\" ]\\nprint \\\"q to quit.\\\"\\nrepeat\\n print \\\"What would you like to know? \\\"\\n q$ = input\\n until q$ = \\\"q\\\"\\n print answers$[randint len answers$[]]\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"USING: io kernel random sequences ;\\nIN: rosetta-code.magic-8-ball\\n\\nCONSTANT: phrases {\\n \\\"It is certain\\\" \\\"It is decidedly so\\\" \\\"Without a doubt\\\"\\n \\\"Yes, definitely\\\" \\\"You may rely on it\\\" \\\"As I see it, yes\\\"\\n \\\"Most likely\\\" \\\"Outlook good\\\" \\\"Signs point to yes\\\" \\\"Yes\\\"\\n \\\"Reply hazy, try again\\\" \\\"Ask again later\\\"\\n \\\"Better not tell you now\\\" \\\"Cannot predict now\\\"\\n \\\"Concentrate and ask again\\\" \\\"Don't bet on it\\\"\\n \\\"My reply is no\\\" \\\"My sources say no\\\" \\\"Outlook not so good\\\"\\n \\\"Very doubtful\\\"\\n}\\n\\n\\\"Please enter your question or a blank line to quit.\\\" print\\n\\n[ \\\"? : \\\" write flush readln empty? [ f ]\\n[ phrases random print t ] if ] loop\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"1.09 S FRAN(-1);C randomize\\n1.10 S FISL(80,A$);C set length to 80 char.\\n1.20 T !\\\"Magic 8-Ball (Q to quit)\\\"!!\\n1.30 T \\\"What would you like to know?\\\"!\\n1.40 S FSTI(80,A$(0),13);C input from console to A$, CR delimited\\n1.42 S Z=A$(0);I (Z-81) , 50.1;C Capital Q, if first char = then branch\\n1.44 S Z=A$(0);I (Z-113) , 50.1;C lowercase q, if first char = then branch\\n\\n1.50 T !\\n1.60 S R=FINT(FRAN(0)*20+1);C get a random integer 1-20\\n1.70 D R*2;C 'do' calculated response subroutine\\n1.80 T !!\\\"What else would you like to know?\\\"!;G 1.4;C loop up to A$ input\\n\\n2.10 T \\\"It is certain.\\\";R;C print a response and return from subroutine\\n4.10 T \\\"It is decidedly so.\\\";R;C etc.....\\n6.10 T \\\"Without a doubt.\\\";R\\n8.10 T \\\"Yes - definitely.\\\";R\\n10.10 T \\\"You may rely on it.\\\";R\\n12.10 T \\\"As I see it, yes.\\\";R\\n14.10 T \\\"Most likely.\\\";R\\n16.10 T \\\"Outlook good.\\\";R\\n18.10 T \\\"Yes.\\\";R\\n20.10 T \\\"Signs point to yes.\\\";R\\n22.10 T \\\"Reply hazy, try again.\\\";R\\n24.10 T \\\"Ask again later.\\\";R\\n26.10 T \\\"Better not tell you now.\\\";R\\n28.10 T \\\"Cannot predict now.\\\";R\\n30.10 T \\\"Concentrate and ask again.\\\";R\\n32.10 T \\\"Don't count on it.\\\";R\\n34.10 T \\\"My reply is no.\\\";R\\n36.10 T \\\"My sources say no.\\\";R\\n38.10 T \\\"Outlook not so good.\\\";R\\n40.10 T \\\"Very doubtful.\\\";R\\n50.10 T !\\\"Thanks for consulting Magic 8-Ball for your life choices.\\\"!\\n50.20 Q\\n\",\n \"language\": \"FOCAL\"\n },\n {\n \"code\": \"\\\\ magic eight ball Rosetta Code\\nINCLUDE RANDOM.FS\\nDECIMAL\\n: CASE: ( -- -7) CREATE ;\\n: ;CASE ( n -- ) DOES> SWAP CELLS + @ EXECUTE ;\\n\\n: VECTORS 0 DO , LOOP ;\\n\\n:NONAME .\\\" It is certain\\\" ;\\n:NONAME .\\\" It is decidedly so\\\" ;\\n:NONAME .\\\" Without a doubt\\\" ;\\n:NONAME .\\\" Yes, definitely\\\" ;\\n:NONAME .\\\" You may rely on it\\\" ;\\n:NONAME .\\\" As I see it, yes.\\\" ;\\n:NONAME .\\\" Most likely\\\" ;\\n:NONAME .\\\" Outlook good\\\" ;\\n:NONAME .\\\" Signs point to yes.\\\" ;\\n:NONAME .\\\" Yes.\\\" ;\\n:NONAME .\\\" Reply hazy, try again\\\" ;\\n:NONAME .\\\" Ask again later\\\" ;\\n:NONAME .\\\" Better not tell you now\\\" ;\\n:NONAME .\\\" Cannot predict now\\\" ;\\n:NONAME .\\\" Concentrate and ask again\\\" ;\\n:NONAME .\\\" Don't bet on it\\\" ;\\n:NONAME .\\\" My reply is no\\\" ;\\n:NONAME .\\\" My sources say no\\\" ;\\n:NONAME .\\\" Outlook not so good\\\" ;\\n:NONAME .\\\" Very doubtful\\\" ;\\n\\nCASE: MAGIC8BALL 20 VECTORS ;CASE\\n\\n: GO\\n CR .\\\" Please enter your question or a blank line to quit.\\\"\\n BEGIN CR .\\\" ? :\\\" PAD 80 ACCEPT 0>\\n WHILE CR 19 RANDOM MAGIC8BALL CR\\n REPEAT ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"PROGRAM EIGHT_BALL\\n CHARACTER(LEN=100) :: RESPONSE\\n CHARACTER(LEN=100) :: QUESTION\\n CHARACTER(LEN=100), DIMENSION(20) :: RESPONSES\\n REAL :: R\\n\\n CALL RANDOM_SEED()\\n\\n RESPONSES(1) = \\\"It is certain\\\"\\n RESPONSES(2) = \\\"It is decidedly so\\\"\\n RESPONSES(3) = \\\"Without a doubt\\\"\\n RESPONSES(4) = \\\"Yes, definitely\\\"\\n RESPONSES(5) = \\\"You may rely on it\\\"\\n RESPONSES(6) = \\\"As I see it, yes\\\"\\n RESPONSES(7) = \\\"Most likely\\\"\\n RESPONSES(8) = \\\"Outlook good\\\"\\n RESPONSES(9) = \\\"Signs point to yes\\\"\\n RESPONSES(10) = \\\"Yes\\\"\\n RESPONSES(11) = \\\"Reply hazy, try again\\\"\\n RESPONSES(12) = \\\"Ask again later\\\"\\n RESPONSES(13) = \\\"Better not tell you now\\\"\\n RESPONSES(14) = \\\"Cannot predict now\\\"\\n RESPONSES(15) = \\\"Concentrate and ask again\\\"\\n RESPONSES(16) = \\\"Don't bet on it\\\"\\n RESPONSES(17) = \\\"My reply is no\\\"\\n RESPONSES(18) = \\\"My sources say no\\\"\\n RESPONSES(19) = \\\"Outlook not so good\\\"\\n RESPONSES(20) = \\\"Very doubtful\\\"\\n\\n WRITE(*,*) \\\"Welcome to 8 Ball! Ask a question to find the answers\\\"\\n WRITE(*,*) \\\"you seek, type either 'quit' or 'q' to exit\\\", NEW_LINE('A')\\n\\n DO WHILE(.TRUE.)\\n PRINT*, \\\"Ask your question: \\\"\\n READ(*,*) QUESTION\\n IF(QUESTION == \\\"q\\\" .OR. QUESTION == \\\"quit\\\") THEN\\n CALL EXIT(0)\\n ENDIF\\n CALL RANDOM_NUMBER(R)\\n PRINT*, \\\"Response: \\\", TRIM(RESPONSES(FLOOR(R*20))), NEW_LINE('A')\\n ENDDO\\nEND PROGRAM EIGHT_BALL\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"program Magic_8_ball;\\n{$IFDEF WINDOWS}{$APPTYPE CONSOLE}{$ENDIF}\\nuses\\n SysUtils,crt;\\nconst\\n answers: array[0..19] of string = ('It is certain.', 'It is decidedly so.',\\n 'Without a doubt.', 'Yes - definitely.', 'You may rely on it.',\\n 'As I see it, yes.', 'Most likely.', 'Outlook good.', 'Yes.',\\n 'Signs point to yes.', 'Reply hazy, try again.', 'Ask again later',\\n 'Better not tell you now.', 'Cannot predict now.',\\n 'Concentrate and ask again.', 'Don''t count on it.', 'My reply is no.',\\n 'My sources say no.', 'Outlook not so good.', 'Very doubtful.');\\nbegin\\n Randomize;\\n repeat\\n writeln('Magic 8 Ball! Ask question and hit ENTER key for the answer!');\\n readln;\\n ClrScr;\\n writeln(answers[Random(length(answers))],#13#10);\\n writeln('Hit ESCape to leave');\\n repeat until keypressed;\\n ClrScr;\\n until readkey=#27;\\nend.\\n\",\n \"language\": \"Free-Pascal-Lazarus\"\n },\n {\n \"code\": \"dim as string answer(0 to 19) = { \\\"It is certain.\\\", \\\"It is decidedly so.\\\", \\\"Without a doubt.\\\", \\\"Yes – definitely.\\\",_\\n \\\"You may rely on it.\\\", \\\"As I see it, yes.\\\", \\\"Most likely.\\\", \\\"Outlook good.\\\",_\\n \\\"Yes.\\\", \\\"Signs point to yes.\\\", \\\"Reply hazy, try again.\\\", \\\"Ask again later.\\\",_\\n \\\"Better not tell you now.\\\", \\\"Cannot predict now.\\\", \\\"Concentrate and ask again.\\\", \\\"Don't count on it.\\\",_\\n \\\"My reply is no.\\\", \\\"My sources say no.\\\", \\\"Outlook not so good.\\\", \\\"Very doubtful.\\\" }\\n\\ndim as string question\\nrandomize timer\\n\\nprint \\\"Q to quit.\\\"\\ndo\\n input \\\"What would you like to know? \\\", question\\n if ucase(question)=\\\"Q\\\" then exit do\\n print answer(int(rnd*20))\\n print\\nloop\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"bufio\\\"\\n\\t\\\"bytes\\\"\\n\\t\\\"fmt\\\"\\n\\t\\\"log\\\"\\n\\t\\\"math/rand\\\"\\n\\t\\\"os\\\"\\n\\t\\\"time\\\"\\n)\\n\\nfunc main() {\\n\\trand.Seed(time.Now().UnixNano())\\n\\tanswers := [...]string{\\n\\t\\t\\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",\\n\\t\\t\\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\",\\n\\t\\t\\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\",\\n\\t\\t\\\"Reply hazy, try again\\\", \\\"Ask again later\\\",\\n\\t\\t\\\"Better not tell you now\\\", \\\"Cannot predict now\\\",\\n\\t\\t\\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",\\n\\t\\t\\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",\\n\\t\\t\\\"Very doubtful\\\",\\n\\t}\\n\\tconst prompt = \\\"\\\\n? : \\\"\\n\\tfmt.Print(\\\"Please enter your question or a blank line to quit.\\\\n\\\" + prompt)\\n\\tsc := bufio.NewScanner(os.Stdin)\\n\\tfor sc.Scan() {\\n\\t\\tquestion := sc.Bytes()\\n\\t\\tquestion = bytes.TrimSpace(question)\\n\\t\\tif len(question) == 0 {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tanswer := answers[rand.Intn(len(answers))]\\n\\t\\tfmt.Printf(\\\"\\\\n%s\\\\n\\\"+prompt, answer)\\n\\t}\\n\\tif err := sc.Err(); err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"0 DATA \\\"It is certain.\\\", \\\"It is decidedly so.\\\"\\n20 DATA \\\"Without a doubt.\\\", \\\"Yes - definitely.\\\"\\n30 DATA \\\"You may rely on it.\\\", \\\"As I see it, yes.\\\"\\n40 DATA \\\"Most likely.\\\", \\\"Outlook good.\\\"\\n50 DATA \\\"Yes.\\\", \\\"Signs point to yes.\\\"\\n60 DATA \\\"Reply hazy, try again.\\\", \\\"Ask again later.\\\"\\n70 DATA \\\"Better not tell you now.\\\", \\\"Cannot predict now.\\\"\\n80 DATA \\\"Concentrate and ask again.\\\", \\\"Don't count on it.\\\"\\n90 DATA \\\"My reply is no.\\\", \\\"My sources say no.\\\"\\n100 DATA \\\"Outlook not so good.\\\", \\\"Very doubtful.\\\"\\n110 DIM M8BALL$(20)\\n120 FOR I=0 TO 19\\n130 READ M8BALL$(I)\\n140 NEXT I\\n150 RANDOMIZE TIMER\\n160 INPUT \\\"What would you like to know? \\\", Q$\\n170 PRINT M8BALL$(INT(RND*20))\\n180 END\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \"import System.Random (getStdRandom, randomR)\\nimport Control.Monad (forever)\\n\\nanswers :: [String]\\nanswers =\\n [ \\\"It is certain\\\"\\n , \\\"It is decidedly so\\\"\\n , \\\"Without a doubt\\\"\\n , \\\"Yes, definitely\\\"\\n , \\\"You may rely on it\\\"\\n , \\\"As I see it, yes\\\"\\n , \\\"Most likely\\\"\\n , \\\"Outlook good\\\"\\n , \\\"Signs point to yes\\\"\\n , \\\"Yes\\\"\\n , \\\"Reply hazy, try again\\\"\\n , \\\"Ask again later\\\"\\n , \\\"Better not tell you now\\\"\\n , \\\"Cannot predict now\\\"\\n , \\\"Concentrate and ask again\\\"\\n , \\\"Don't bet on it\\\"\\n , \\\"My reply is no\\\"\\n , \\\"My sources say no\\\"\\n , \\\"Outlook not so good\\\"\\n , \\\"Very doubtful\\\"]\\n\\nmain :: IO ()\\nmain = do\\n putStrLn \\\"Hello. The Magic 8 Ball knows all. Type your question.\\\"\\n forever $ do\\n getLine\\n n <- getStdRandom (randomR (0, pred $ length answers))\\n putStrLn $ answers !! n\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"100 PROGRAM \\\"Magic8.bas\\\"\\n110 RANDOMIZE\\n120 STRING ANSWER$(1 TO 20)*26\\n130 FOR I=1 TO 20\\n140 READ ANSWER$(I)\\n150 NEXT\\n160 CLEAR SCREEN\\n170 PRINT \\\"Magic 8-ball\\\":PRINT \\\"Q to quit.\\\":PRINT\\n180 DO\\n190 INPUT PROMPT \\\"What would you like to know? \\\":QUESTION$\\n200 IF LCASE$(QUESTION$)=\\\"q\\\" THEN EXIT DO\\n210 PRINT ANSWER$(RND(20)+1):PRINT\\n220 LOOP\\n230 DATA It is certain.,It is decidedly so.,Without a doubt.\\n240 DATA Yes - definitely.,You may rely on it.,\\\"As I see it, yes.\\\"\\n250 DATA Most likely.,Outlook good.,Yes.\\n260 DATA Signs point to yes.,\\\"Reply hazy, try again.\\\",Ask again later.\\n270 DATA Better not tell you now.,Cannot predict now.,Concentrate and ask again.\\n280 DATA Don't count on it.,My reply is no.,My sources say no.\\n290 DATA Outlook not so good.,Very doubtful.\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \"NB. translated from awk\\n\\nprompt=: [: 1!:1 [: 1: echo\\n\\nANSWERS=: [;._2'It is certain\\\"It is decidedly so\\\"Without a doubt\\\"Yes, definitely\\\"You may rely on it\\\"As I see it, yes\\\"Most likely\\\"Outlook good\\\"Signs point to yes\\\"Yes\\\"Reply hazy, try again\\\"Ask again later\\\"Better not tell you now\\\"Cannot predict now\\\"Concentrate and ask again\\\"Don''t bet on it\\\"My reply is no\\\"My sources say no\\\"Outlook not so good\\\"Very doubtful\\\"'\\n\\neight_ball=: ANSWERS&$: :(dyad define)\\n while. 0 < # prompt 'Please enter your question or a blank line to quit.' do.\\n echo ({~ ?@:#) x\\n end.\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.Random;\\nimport java.util.Scanner;\\n\\npublic class MagicEightBall {\\n\\n public static void main(String[] args) {\\n new MagicEightBall().run();\\n }\\n\\n private static String[] ANSWERS = new String[] {\\\"It is certain.\\\", \\\"It is decidedly so.\\\", \\\"Without a doubt.\\\", \\\"Yes - definitely.\\\",\\n \\\"You may rely on it.\\\", \\\"As I see it, yes.\\\", \\\"Most likely.\\\", \\\"Outlook good.\\\", \\\"Yes.\\\", \\\"Signs point to yes.\\\",\\n \\\"Reply hazy, try again.\\\", \\\"Ask again later.\\\", \\\"Better not tell you now.\\\", \\\"Cannot predict now.\\\", \\\"Concentrate and ask again.\\\",\\n \\\"Don't count on it.\\\", \\\"My reply is no.\\\", \\\"My sources say no.\\\", \\\"Outlook not so good.\\\", \\\"Very doubtful. \\\"};\\n\\n public void run() {\\n Random random = new Random();\\n System.out.printf(\\\"Hello. The Magic 8 Ball knows all. Type your question.%n%n\\\");\\n try ( Scanner in = new Scanner(System.in); ) {\\n System.out.printf(\\\"? \\\");\\n while ( (in.nextLine()).length() > 0 ) {\\n System.out.printf(\\\"8 Ball Response: %s%n\\\", ANSWERS[random.nextInt(ANSWERS.length)]);\\n System.out.printf(\\\"? \\\");\\n }\\n }\\n System.out.printf(\\\"%n8 Ball Done. Bye.\\\");\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"//console\\nvar answers = [ \\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",\\n \\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\",\\n \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\",\\n \\\"Reply hazy, try again\\\", \\\"Ask again later\\\",\\n \\\"Better not tell you now\\\", \\\"Cannot predict now\\\",\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",\\n \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",\\n \\\"Very doubtful\\\"])\\n\\nconsole.log(\\\"ASK ANY QUESTION TO THE MAGIC 8-BALL AND YOU SHALL RECEIVE AN ANSWER!\\\")\\n\\nfor(;;){\\n var answer = prompt(\\\"question:\\\")\\n console.log(answer)\\nconsole.log(answers[Math.floor(Math.random()*answers.length)]);\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"const responses = [\\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",\\n \\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\", \\\"Most likely\\\",\\n \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\", \\\"Reply hazy, try again\\\",\\n \\\"Ask again later\\\", \\\"Better not tell you now\\\", \\\"Cannot predict now\\\",\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\", \\\"My reply is no\\\",\\n \\\"My sources say no\\\", \\\"Outlook not so good\\\", \\\"Very doubtful\\\"]\\n\\nwhile true\\n println(\\\"Ask a question (blank to exit):\\\")\\n if !occursin(r\\\"[a-zA-Z]\\\", readline(stdin))\\n break\\n end\\n println(rand(responses))\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"ask:{` 0:*1?\\\"/\\\"\\\\\\\"It is certain/It is decidedly so/Without a doubt/Yes, definitely/You may rely on it/As I see it, yes/Most likely/Outlook good/Signs point to yes/Yes/Reply hazy, try again/Ask again later/Better not tell you now/Cannot predict now/Concentrate and ask again/Don't bet on it/My reply is no/My sources say no/Outlook not so good/Very doubtful\\\"}\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"ask \\\"Will this work?\\\"\\nSigns point to yes\\nask \\\"Was this worth doing?\\\"\\nWithout a doubt\\nask \\\"Can I have a cookie?\\\"\\nYes, definitely\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"// Version 1.2.40\\n\\nimport java.util.Random\\n\\nfun main(args: Array<String>) {\\n val answers = listOf(\\n \\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",\\n \\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\",\\n \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\",\\n \\\"Reply hazy, try again\\\", \\\"Ask again later\\\",\\n \\\"Better not tell you now\\\", \\\"Cannot predict now\\\",\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",\\n \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",\\n \\\"Very doubtful\\\"\\n )\\n val rand = Random()\\n println(\\\"Please enter your question or a blank line to quit.\\\")\\n while (true) {\\n print(\\\"\\\\n? : \\\")\\n val question = readLine()!!\\n if (question.trim() == \\\"\\\") return\\n val answer = answers[rand.nextInt(20)]\\n println(\\\"\\\\n$answer\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"data \\\"It is certain\\\",\\\"It is decidedly so\\\",\\\"Without a doubt\\\",\\\"Yes - definitely\\\",_\\n\\\"You may rely on it\\\",\\\"As I see it, yes\\\",\\\"Most likely\\\",\\\"Outlook good\\\",\\\"Yes\\\",_\\n\\\"Signs point to yes\\\",\\\"Reply hazy, try again\\\",\\\"Ask again later\\\",\\\"Better not tell you now\\\",_\\n\\\"Cannot predict now\\\",\\\"Concentrate and ask again\\\",\\\"Don't count on it\\\",\\\"My reply is no\\\",_\\n\\\"My sources say no\\\",\\\"Outlook not so good\\\",\\\"Very doubtful\\\"\\n\\ndim c$(20)\\nfor a = 1 to 20\\n read b$\\n c$(a) = b$\\nnext a\\n\\n[loop]\\n input \\\"Type your question: \\\";a$\\n if a$=\\\"\\\" then end\\n d=int(rnd(1)*20)+1\\n print \\\"Answer: \\\";c$(d)\\ngoto [loop]\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"10 mode 2:defint a-z:randomize time\\n20 input \\\"Your question (hit Return to quit)\\\";i$\\n30 if i$=\\\"\\\" then print \\\"Goodbye!\\\":end\\n40 q=1+19*rnd\\n50 on q gosub 100, 110, 120, 130, 140, 150, 160, 170, 180, 190, 200, 210, 220, 230, 240, 250, 260, 270, 280, 290\\n60 goto 20\\n100 print \\\"It is certain\\\":return\\n110 print \\\"It is decidedly so\\\":return\\n120 print \\\"Without a doubt\\\":return\\n130 print \\\"Yes, definitely\\\":return\\n140 print \\\"You may rely on it\\\":return\\n150 print \\\"As I see it, yes\\\":return\\n160 print \\\"Most likely\\\":return\\n170 print \\\"Outlook good\\\":return\\n180 print \\\"Signs point to yes\\\":return\\n190 print \\\"Yes\\\":return\\n200 print \\\"Reply hazy, try again\\\":return\\n210 print \\\"Ask again later\\\":return\\n220 print \\\"Better not tell you now\\\":return\\n230 print \\\"Cannot predict now\\\":return\\n240 print \\\"Concentrate and ask again\\\":return\\n250 print \\\"Don't bet on it\\\":return\\n260 print \\\"My reply is no\\\":return\\n270 print \\\"My sources say no\\\":return\\n280 print \\\"Outlook not so good\\\":return\\n290 print \\\"Very doubtful\\\":return\\n\",\n \"language\": \"Locomotive-Basic\"\n },\n {\n \"code\": \"math.randomseed(os.time())\\nanswers = {\\n \\\"It is certain.\\\", \\\"It is decidedly so.\\\", \\\"Without a doubt.\\\", \\\"Yes, definitely.\\\", \\\"You may rely on it.\\\",\\n \\\"As I see it, yes.\\\", \\\"Most likely.\\\", \\\"Outlook good.\\\", \\\"Signs point to yes.\\\", \\\"Yes.\\\",\\n \\\"Reply hazy, try again.\\\", \\\"Ask again later.\\\", \\\"Better not tell you now.\\\", \\\"Cannot predict now.\\\", \\\"Concentrate and ask again.\\\",\\n \\\"Don't bet on it.\\\", \\\"My reply is no.\\\", \\\"My sources say no.\\\", \\\"Outlook not so good.\\\", \\\"Very doubtful.\\\"\\n}\\nwhile true do\\n io.write(\\\"Q: \\\")\\n question = io.read()\\n print(\\\"A: \\\"..answers[math.random(#answers)])\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Magic.8.Ball {\\n answers=(\\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\", \\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\", \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\", \\\"Reply hazy, try again\\\", \\\"Ask again later\\\", \\\"Better not tell you now\\\", \\\"Cannot predict now\\\", \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\", \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\", \\\"Very doubtful\\\")\\n Print \\\"Please enter your question or a blank line to quit.\\\"\\n {\\n Line Input A$\\n Print\\n A$=trim$(A$)\\n If A$=\\\"\\\" Then Exit\\n Print Array$(answers, Random(0, 19))\\n Loop\\n }\\n}\\nMagic.8.Ball\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"answers = {\\\"It is certain.\\\", \\\"It is decidedly so.\\\",\\n \\\"Without a doubt.\\\", \\\"Yes - definitely.\\\", \\\"You may rely on it.\\\",\\n \\\"As I see it, yes.\\\", \\\"Most likely.\\\", \\\"Outlook good.\\\", \\\"Yes.\\\",\\n \\\"Signs point to yes.\\\", \\\"Reply hazy, try again.\\\",\\n \\\"Ask again later.\\\", \\\"Better not tell you now.\\\",\\n \\\"Cannot predict now.\\\", \\\"Concentrate and ask again.\\\",\\n \\\"Don't count on it.\\\", \\\"My reply is no.\\\", \\\"My sources say no.\\\",\\n \\\"Outlook not so good.\\\", \\\"Very doubtful.\\\"};\\nq = Input[\\\"Please enter your question\\\"];\\nSeedRandom[Hash[q]];\\nPrint[RandomChoice[answers]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"set_random_state(make_random_state(true))$\\n\\nblock(\\n responses:[\\\"It is certain\\\",\\\"It is decidedly so\\\",\\\"Without a doubt\\\",\\\"Yes definitely\\\",\\\"You may rely on it\\\",\\\"As I see it, yes\\\",\\\"Most likely\\\",\\\"Outlook good\\\",\\\"Yes\\\",\\\"Signs point to yes\\\",\\n \\\"Reply hazy, try again\\\",\\\"Ask again later\\\",\\\"Better not tell you now\\\",\\\"Cannot predict now\\\",\\\"Concentrate and ask again\\\",\\n \\\"Don't count on it\\\",\\\"My reply is no\\\",\\\"My sources say no\\\",\\\"Outlook not so good\\\",\\\"Very doubtful\\\"],\\n read(\\\"Ask a question\\\"),\\n print(responses[random(20)])\\n);\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"randomize ; Seed the RNG with current timestamp.\\n\\n(\\n \\\"It is certain\\\" \\\"It is decidedly so\\\" \\\"Without a doubt\\\"\\n \\\"Yes, definitely\\\" \\\"You may rely on it\\\" \\\"As I see it, yes\\\"\\n \\\"Most likely\\\" \\\"Outlook good\\\" \\\"Signs point to yes\\\" \\\"Yes\\\"\\n \\\"Reply hazy, try again\\\" \\\"Ask again later\\\"\\n \\\"Better not tell you now\\\" \\\"Cannot predict now\\\"\\n \\\"Concentrate and ask again\\\" \\\"Don't bet on it\\\"\\n \\\"My reply is no\\\" \\\"My sources say no\\\" \\\"Outlook not so good\\\"\\n \\\"Very doubtful\\\"\\n) =phrases\\n\\n(phrases dup size pred random get puts!) :answer\\n\\n(true) (\\\"Ask a question\\\" ask answer) while\\n\",\n \"language\": \"Min\"\n },\n {\n \"code\": \"answers = [\\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",\\n \\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\",\\n \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\",\\n \\\"Reply hazy, try again\\\", \\\"Ask again later\\\",\\n \\\"Better not tell you now\\\", \\\"Cannot predict now\\\",\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",\\n \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",\\n \\\"Very doubtful\\\"]\\nprint \\\"Ask your question and the Magic 8 Ball will give you the answer!\\\"\\ninput \\\"What is your question?\\\"\\nprint answers[rnd * answers.len]\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"100 CLS\\n110 DATA \\\"It is certain.\\\",\\\"It is decidedly so.\\\"\\n120 DATA \\\"Without a doubt.\\\",\\\"Yes - definitely.\\\"\\n130 DATA \\\"You may rely on it.\\\",\\\"As I see it, yes.\\\"\\n140 DATA \\\"Most likely.\\\",\\\"Outlook good.\\\"\\n150 DATA \\\"Yes.\\\",\\\"Signs point to yes.\\\"\\n160 DATA \\\"Reply hazy, try again.\\\",\\\"Ask again later.\\\"\\n170 DATA \\\"Better not tell you now.\\\",\\\"Cannot predict now.\\\"\\n180 DATA \\\"Concentrate and ask again.\\\",\\\"Don't count on it.\\\"\\n190 DATA \\\"My reply is no.\\\",\\\"My sources say no.\\\"\\n200 DATA \\\"Outlook not so good.\\\",\\\"Very doubtful.\\\"\\n210 DIM m$(20)\\n220 FOR i = 0 TO 19\\n230 READ m$(i)\\n240 NEXT i\\n260 INPUT \\\"What would you like to know? \\\"; q$\\n270 PRINT m$(INT(RND(20)))\\n280 END\\n\",\n \"language\": \"MSX-Basic\"\n },\n {\n \"code\": \"import random, strutils\\n\\nconst Answers = [\\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",\\n \\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\",\\n \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\",\\n \\\"Reply hazy, try again\\\", \\\"Ask again later\\\",\\n \\\"Better not tell you now\\\", \\\"Cannot predict now\\\",\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",\\n \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",\\n \\\"Very doubtful\\\"]\\n\\nproc exit() =\\n echo \\\"Bye.\\\"\\n quit QuitSuccess\\n\\nrandomize()\\n\\ntry:\\n while true:\\n echo \\\"Type your question or an empty line to quit.\\\"\\n stdout.write \\\"? \\\"\\n let question = stdin.readLine()\\n if question.strip().len == 0: exit()\\n echo Answers[rand(19)], \\\".\\\\n\\\"\\nexcept EOFError:\\n exit()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"/* REXX */\\na=.array~of(\\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",,\\n \\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\",,\\n \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\",,\\n \\\"Reply hazy, try again\\\", \\\"Ask again later\\\",,\\n \\\"Better not tell you now\\\", \\\"Cannot predict now\\\",,\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",,\\n \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",,\\n \\\"Very doubtful\\\")\\nDo Forever\\n Say 'your question:'\\n Parse Pull q\\n If q='' Then Leave\\n Say a[random(1,20)]\\n Say ''\\n End\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"@a = ('It is certain', 'It is decidedly so', 'Without a doubt', 'Yes, definitely',\\n 'You may rely on it', 'As I see it, yes', 'Most likely', 'Outlook good',\\n 'Signs point to yes', 'Yes', 'Reply hazy, try again', 'Ask again later',\\n 'Better not tell you now', 'Cannot predict now', 'Concentrate and ask again',\\n \\\"Don't bet on it\\\", 'My reply is no', 'My sources say no', 'Outlook not so good',\\n 'Very doubtful');\\n\\nwhile () {\\n print 'Enter your question:';\\n last unless <> =~ /\\\\w/;\\n print @a[int rand @a], \\\"\\\\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;\\\">answers</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"As I see it, yes\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Ask again later\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"You may rely on it\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"Without a doubt\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Don't bet on it\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Outlook not so good\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"Signs point to yes\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"It is decidedly so\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"It is certain\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"Better not tell you now\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"My reply is no\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Outlook good\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"Concentrate and ask again\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Reply hazy, try again\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Yes\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"Most likely\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Cannot predict now\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"My sources say maybe\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"My sources say no\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Yes, definitely\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Yes, probably not\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"Very doubtful\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Your question has already been answered\\\"</span><span style=\\\"color: #0000FF;\\\">}</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 <span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">vbox</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">question</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">answer</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">answered</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">clearkey</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</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;\\\">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> <span style=\\\"color: #000080;font-style:italic;\\\">-- (standard practice for me)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">K_F5</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_DEFAULT</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (let browser reload work)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">K_CR</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">q</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">question</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"VALUE\\\"</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000000;\\\">reply</span>\\n <span style=\\\"color: #008080;\\\">if</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: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">answered</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">reply</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"Your question has already been answered\\\"</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">answered</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">answered</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">reply</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">answers</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;\\\">answers</span><span style=\\\"color: #0000FF;\\\">))]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetStrAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">answer</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"TITLE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">reply</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">clearkey</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;\\\">elsif</span> <span style=\\\"color: #000000;\\\">clearkey</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">question</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"VALUE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">clearkey</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;\\\">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: #7060A8;\\\">IupOpen</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">question</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupText</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"EXPAND=HORIZONTAL\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">answer</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;\\\">\\\"EXPAND=HORIZONTAL\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">vbox</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupVbox</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">question</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">answer</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #008000;\\\">`MARGIN=40x40`</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;\\\">vbox</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`TITLE=\\\"Magic 8-ball\\\",SIZE=250x100`</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: #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;\\\">IupHide</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\n\\n$fortunes = array(\\n\\t\\\"It is certain\\\",\\n\\t\\\"It is decidedly so\\\",\\n\\t\\\"Without a doubt\\\",\\n\\t\\\"Yes, definitely\\\",\\n\\t\\\"You may rely on it\\\",\\n\\t\\\"As I see it, yes\\\",\\n\\t\\\"Most likely\\\",\\n\\t\\\"Outlook good\\\",\\n\\t\\\"Signs point to yes\\\",\\n\\t\\\"Yes\\\",\\n\\t\\\"Reply hazy, try again\\\",\\n\\t\\\"Ask again later\\\",\\n\\t\\\"Better not tell you now\\\",\\n\\t\\\"Cannot predict now\\\",\\n\\t\\\"Concentrate and ask again\\\",\\n\\t\\\"Don't bet on it\\\",\\n\\t\\\"My reply is no\\\",\\n\\t\\\"My sources say no\\\",\\n\\t\\\"Outlook not so good\\\",\\n\\t\\\"Very doubtful\\\"\\n);\\n\\n/*\\n * Prompt the user at the CLI for the command\\n */\\nfunction cli_prompt( $prompt='> ', $default=false ) {\\n\\n\\t// keep asking until a non-empty response is given\\n\\tdo {\\n\\t\\t// display the prompt\\n\\t\\techo $prompt;\\n\\n\\t\\t// read input and remove CRLF\\n\\t\\t$cmd = chop( fgets( STDIN ) );\\n\\n\\t} while ( empty( $default ) and empty( $cmd ) );\\n\\n\\treturn $cmd ?: $default;\\n\\n}\\n\\n$question = cli_prompt( 'What is your question? ' );\\n\\necho 'Q: ', $question, PHP_EOL;\\n\\necho 'A: ', $fortunes[ array_rand( $fortunes ) ], PHP_EOL;\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"100H:\\n/*\\nTHE PROCEDURES CLOCK AND RND USE A FEATURE OF PICKLES AND TROUT CP/M2\\nAND ARE NOT LIKELY TO WORK ON OTHER VERSIONS OF CP/M\\n*/\\n\\nBDOS: PROCEDURE (FN, ARG) BYTE; DECLARE FN BYTE, ARG ADDRESS; GO TO 5; END BDOS;\\nEXIT: PROCEDURE; MEMORY(0)=BDOS(0,0); END EXIT;\\n\\nTTYIN: PROCEDURE BYTE; DECLARE C BYTE; RETURN BDOS(1,0); END TTYIN;\\n\\nPRINT: PROCEDURE (S); DECLARE S ADDRESS; S=BDOS(9,S); END PRINT;\\n\\nCLOCK: PROCEDURE;\\nDECLARE B$ADR ADDRESS; DECLARE B BASED B$ADR BYTE;\\n B$ADR=047H;\\n B = 0EH; GO TO 043H; END CLOCK;\\n\\nRND: PROCEDURE ADDRESS;\\nDECLARE E$ADR ADDRESS; DECLARE E BASED E$ADR BYTE;\\nDECLARE D$ADR ADDRESS; DECLARE D BASED D$ADR BYTE;\\nDECLARE L$ADR ADDRESS; DECLARE L BASED L$ADR BYTE;\\nDECLARE H$ADR ADDRESS; DECLARE H BASED H$ADR BYTE;\\nDECLARE (NUM, DE, HL) ADDRESS;\\n E$ADR=048H; D$ADR=049H; L$ADR=04AH; H$ADR=04BH;\\n CALL CLOCK;\\n DE = D * 255 + E; HL = H * 255 + L; NUM = DE * HL; RETURN NUM;\\nEND RND;\\n\\nEIGHTBALL: DO;\\n\\n\\n DECLARE CR LITERALLY '13';\\n DECLARE CRLF(3) BYTE INITIAL (13,10,'$');\\n DECLARE CHR BYTE;\\n DECLARE NUM ADDRESS;\\n DECLARE GREETING(30) BYTE INITIAL\\n ('ASK AND ALL WILL BE REVEALED $');\\n DECLARE MSG01(41) BYTE INITIAL\\n ( 'AS I SEE IT, YES $' );\\n DECLARE MSG02(41) BYTE INITIAL\\n ( 'ASK AGAIN LATER $' );\\n DECLARE MSG03(41) BYTE INITIAL\\n ( 'BETTER NOT TELL YOU NOW $' );\\n DECLARE MSG04(41) BYTE INITIAL\\n ( 'CANNOT PREDICT NOW $' );\\n DECLARE MSG05(41) BYTE INITIAL\\n ( 'CONCENTRATE AND ASK AGAIN $' );\\n DECLARE MSG06(41) BYTE INITIAL\\n ( 'DON''T BET ON IT $' );\\n DECLARE MSG07(41) BYTE INITIAL\\n ( 'IT IS CERTAIN $' );\\n DECLARE MSG08(41) BYTE INITIAL\\n ( 'IT IS DECIDEDLY SO $' );\\n DECLARE MSG09(41) BYTE INITIAL\\n ( 'MOST LIKELY $' );\\n DECLARE MSG10(41) BYTE INITIAL\\n ( 'MY REPLY IS NO $' );\\n DECLARE MSG11(41) BYTE INITIAL\\n ( 'MY SOURCES SAY MAYBE $' );\\n DECLARE MSG12(41) BYTE INITIAL\\n ( 'MY SOURCES SAY NO $' );\\n DECLARE MSG13(41) BYTE INITIAL\\n ( 'OUTLOOK GOOD $' );\\n DECLARE MSG14(41) BYTE INITIAL\\n ( 'OUTLOOK NOT SO GOOD $' );\\n DECLARE MSG15(41) BYTE INITIAL\\n ( 'REPLY HAZY, TRY AGAIN $' );\\n DECLARE MSG16(41) BYTE INITIAL\\n ( 'SIGNS POINT TO YES $' );\\n DECLARE MSG17(41) BYTE INITIAL\\n ( 'VERY DOUBTFUL $' );\\n DECLARE MSG18(41) BYTE INITIAL\\n ( 'WITHOUT A DOUBT $' );\\n DECLARE MSG19(41) BYTE INITIAL\\n ( 'YES $' );\\n DECLARE MSG20(41) BYTE INITIAL\\n ( 'YES, DEFINITELY $' );\\n DECLARE MSG21(41) BYTE INITIAL\\n ( 'YES, PROBABLY NOT $' );\\n DECLARE MSG22(41) BYTE INITIAL\\n ( 'YOU MAY RELY ON IT $' );\\n DECLARE MSG23(41) BYTE INITIAL\\n ( 'YOUR QUESTION HAS ALREADY BEEN ANSWERED $' );\\n\\n NUM = RND MOD 24;\\n\\n CALL PRINT(.GREETING);\\n CALL PRINT(.CRLF);\\n\\n DO WHILE CHR <> CR;\\n CHR = TTYIN;\\n END;\\n\\n CALL PRINT(.CRLF);\\n\\n DO CASE NUM;\\n CALL PRINT(.MSG01);\\n CALL PRINT(.MSG02);\\n CALL PRINT(.MSG03);\\n CALL PRINT(.MSG04);\\n CALL PRINT(.MSG05);\\n CALL PRINT(.MSG06);\\n CALL PRINT(.MSG07);\\n CALL PRINT(.MSG08);\\n CALL PRINT(.MSG09);\\n CALL PRINT(.MSG10);\\n CALL PRINT(.MSG11);\\n CALL PRINT(.MSG12);\\n CALL PRINT(.MSG13);\\n CALL PRINT(.MSG14);\\n CALL PRINT(.MSG15);\\n CALL PRINT(.MSG16);\\n CALL PRINT(.MSG17);\\n CALL PRINT(.MSG18);\\n CALL PRINT(.MSG19);\\n CALL PRINT(.MSG20);\\n CALL PRINT(.MSG21);\\n CALL PRINT(.MSG22);\\n CALL PRINT(.MSG23);\\n END;\\n CALL PRINT(.CRLF);\\n\\n CALL EXIT;\\n\\nEND;\\nEOF\\n\",\n \"language\": \"PL-M\"\n },\n {\n \"code\": \"Define.s Magic8=\\\"● It is certain.\\\"+#LF$+\\n \\\"● It is decidedly so.\\\"+#LF$+\\n \\\"● Without a doubt.\\\"+#LF$+\\n \\\"● Yes – definitely.\\\"+#LF$+\\n \\\"● You may rely on it.\\\"+#LF$+\\n \\\"● As I see it, yes.\\\"+#LF$+\\n \\\"● Most likely.\\\"+#LF$+\\n \\\"● Outlook good.\\\"+#LF$+\\n \\\"● Yes.\\\"+#LF$+\\n \\\"● Signs point To yes.\\\"+#LF$+\\t\\n \\\"● Reply hazy, try again.\\\"+#LF$+\\n \\\"● Ask again later.\\\"+#LF$+\\n \\\"● Better Not tell you now.\\\"+#LF$+\\n \\\"● Cannot predict now.\\\"+#LF$+\\n \\\"● Concentrate And ask again.\\\"+#LF$+\\t\\n \\\"● Don't count on it.\\\"+#LF$+\\n \\\"● My reply is no.\\\"+#LF$+\\n \\\"● My sources say no.\\\"+#LF$+\\n \\\"● Outlook Not so good.\\\"+#LF$+\\n \\\"● Very doubtful.\\\"+#LF$\\n\\n OpenConsole()\\n\\n Repeat\\n Print(\\\"MAGIC8: What would you like To know? \\\"): q$=Input()\\n If Len(q$)=0 : End : EndIf\\n PrintN(StringField(Magic8,Random(CountString(Magic8,#LF$),1),#LF$))\\n ForEver\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import random\\n\\ns = ('It is certain', 'It is decidedly so', 'Without a doubt', 'Yes, definitely',\\n 'You may rely on it', 'As I see it, yes', 'Most likely', 'Outlook good',\\n 'Signs point to yes', 'Yes', 'Reply hazy, try again', 'Ask again later',\\n 'Better not tell you now', 'Cannot predict now', 'Concentrate and ask again',\\n \\\"Don't bet on it\\\", 'My reply is no', 'My sources say no', 'Outlook not so good',\\n 'Very doubtful')\\n\\nq_and_a = {}\\n\\nwhile True:\\n question = input('Ask your question:')\\n if len(question) == 0: break\\n\\n if question in q_and_a:\\n print('Your question has already been answered')\\n else:\\n answer = random.choice(s)\\n q_and_a[question] = answer\\n print(answer)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"DIM answer$(19)\\nFOR i = 0 TO UBOUND(answer$): READ answer$(i): NEXT i\\nRANDOMIZE TIMER\\n\\nPRINT \\\"Q to quit.\\\"\\nDO\\n INPUT \\\"What would you like to know? \\\", question$\\n IF UCASE$(question$) = \\\"Q\\\" THEN EXIT DO\\n PRINT answer$(INT(RND * UBOUND(answer$)))\\n PRINT\\nLOOP\\nEND\\n\\nDATA \\\"It is certain.\\\",\\\"It is decidedly so.\\\"\\nDATA \\\"Without a doubt.\\\",\\\"Yes – definitely.\\\"\\nDATA \\\"You may rely on it.\\\",\\\"As I see it, yes.\\\"\\nDATA \\\"Most likely.\\\",\\\"Outlook good.\\\",\\\"Yes.\\\"\\nDATA \\\"Signs point to yes.\\\",\\\"Reply hazy, try again.\\\"\\nDATA \\\"Ask again later.\\\",\\\"Better not tell you now.\\\"\\nDATA \\\"Cannot predict now.\\\",\\\"Concentrate and ask again.\\\"\\nDATA \\\"Don't count on it.\\\",\\\"My reply is no.\\\"\\nDATA \\\"My sources say no.\\\",\\\"Outlook not so good.\\\"\\nDATA \\\"Very doubtful.\\\"\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \"[ 20 random\\n [ table\\n $ \\\"Concentrate and ask again.\\\" $ \\\"Yes.\\\"\\n $ \\\"Better not tell you now.\\\" $ \\\"Most likely.\\\"\\n $ \\\"Reply hazy, try again.\\\" $ \\\"Outlook good.\\\"\\n $ \\\"Outlook not so good.\\\" $ \\\"It is certain.\\\"\\n $ \\\"Cannot predict now.\\\" $ \\\"Very doubtful.\\\"\\n $ \\\"Signs point to yes.\\\" $ \\\"My reply is no.\\\"\\n $ \\\"It is decidedly so.\\\" $ \\\"Ask again later.\\\"\\n $ \\\"You may rely on it.\\\" $ \\\"Without a doubt.\\\"\\n $ \\\"Don't count on it.\\\" $ \\\"Yes - definitely.\\\"\\n $ \\\"My sources say no.\\\" $ \\\"As I see it, yes.\\\" ]\\n do echo$ cr ] is 8-ball ( --> )\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"eight_ball <- function()\\n{\\n responses <- c(\\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",\\n \\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\",\\n \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\",\\n \\\"Reply hazy, try again\\\", \\\"Ask again later\\\",\\n \\\"Better not tell you now\\\", \\\"Cannot predict now\\\",\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",\\n \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",\\n \\\"Very doubtful\\\")\\n\\n question <- \\\"\\\"\\n\\n cat(\\\"Welcome to 8 ball!\\\\n\\\\n\\\", \\\"Please ask yes/no questions to get answers.\\\",\\n \\\" Type 'quit' to exit the program\\\\n\\\\n\\\")\\n\\n while(TRUE)\\n {\\n question <- readline(prompt=\\\"Enter Question: \\\")\\n if(question == 'quit')\\n {\\n break\\n }\\n randint <- runif(1, 1, 20)\\n cat(\\\"Response: \\\", responses[randint], \\\"\\\\n\\\")\\n }\\n}\\n\\nif(!interactive())\\n{\\n eight_ball()\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"(define eight-ball-responses\\n (list \\\"It is certain\\\" \\\"It is decidedly so\\\" \\\"Without a doubt\\\" \\\"Yes definitely\\\" \\\"You may rely on it\\\"\\n \\\"As I see it, yes\\\" \\\"Most likely\\\" \\\"Outlook good\\\" \\\"Yes\\\" \\\"Signs point to yes\\\"\\n \\\"Reply hazy try again\\\" \\\"Ask again later\\\" \\\"Better not tell you now\\\" \\\"Cannot predict now\\\"\\n \\\"Concentrate and ask again\\\"\\n \\\"Don't count on it\\\" \\\"My reply is no\\\" \\\"My sources say no\\\" \\\"Outlook not so good\\\"\\n \\\"Very doubtful\\\"))\\n\\n(define ((answer-picker answers)) (sequence-ref answers (random (sequence-length answers))))\\n\\n(define magic-eightball (answer-picker eight-ball-responses))\\n\\n(module+ main\\n (let loop ()\\n (display \\\"What do you want to know\\\\n?\\\")\\n (read-line)\\n (displayln (magic-eightball))\\n (loop)))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"put 'Please enter your question or a blank line to quit.';\\n\\n[\\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\", \\\"Yes, definitely\\\",\\n \\\"You may rely on it\\\", \\\"As I see it, yes\\\", \\\"Most likely\\\", \\\"Outlook good\\\",\\n \\\"Signs point to yes\\\", \\\"Yes\\\", \\\"Reply hazy, try again\\\", \\\"Ask again later\\\",\\n \\\"Better not tell you now\\\", \\\"Cannot predict now\\\", \\\"Concentrate and ask again\\\",\\n \\\"Don't bet on it\\\", \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",\\n \\\"Very doubtful\\\"].roll.put while prompt('? : ').chars;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/* REXX */\\nCall mk_a \\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",,\\n \\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\",,\\n \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\",,\\n \\\"Reply hazy, try again\\\", \\\"Ask again later\\\",,\\n \\\"Better not tell you now\\\", \\\"Cannot predict now\\\",,\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",,\\n \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",,\\n \\\"Very doubtful\\\"\\nDo Forever\\n Say 'your question:'\\n Parse Pull q\\n If q='' Then Leave\\n z=random(1,a.0)\\n Say a.z\\n Say ''\\n End\\nExit\\nmk_a:\\na.0=arg()\\nDo i=1 To a.0\\n a.i=arg(i)\\n End\\nReturn\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program simulates the \\\"shaking\\\" of a \\\"Magic 8-ball\\\" and displaying an answer.*/\\n$=\\\"It is certain ÷It is decidedly so ÷Without a doubt÷Yes, definitely÷Signs point to yes\\\",\\n \\\"÷You may rely on it÷ As I see it, yes÷My reply is no÷Outlook good÷Outlook not so good\\\",\\n \\\"÷Yes÷Ask again later÷Better not tell you now÷Cannot predict now÷Reply hazy, try again\\\",\\n \\\"÷Concentrate and ask again÷Don't bet on it÷Most likely÷My sources say no÷Very doubtful\\\"\\n\\nsay space(translate(word(translate(translate($, '┼', \\\" \\\"), , '÷'), random(1, 20)), ,\\\"┼\\\")).\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Magic 8-Ball\\n\\nanswers = [\\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",\\n \\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\",\\n \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\",\\n \\\"Reply hazy, try again\\\", \\\"Ask again later\\\",\\n \\\"Better not tell you now\\\", \\\"Cannot predict now\\\",\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",\\n \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",\\n \\\"Very doubtful\\\"]\\nindex = random(len(answers)-1)+1\\nsee answers[index] + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"#!/usr/bin/ruby\\n\\nclass EightBall\\n def initialize\\n print \\\"Welcome to 8 ball! Ask your question below. \\\"\\n puts \\\"Type 'quit' to exit the program.\\\\n\\\\n\\\"\\n @responses = [\\\"It is certain\\\", \\\"It is decidedly so\\\",\\n \\\"Without a doubt\\\", \\\"Yes, definitely\\\",\\n \\\"You may rely on it\\\", \\\"As I see it, yes\\\",\\n \\\"Most likely\\\", \\\"Outlook good\\\",\\n \\\"Signs point to yes\\\", \\\"Yes\\\",\\n \\\"Reply hazy, try again\\\", \\\"Ask again later\\\",\\n \\\"Better not tell you now\\\",\\n \\\"Cannot predict now\\\",\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",\\n \\\"My reply is no\\\", \\\"My sources say no\\\",\\n \\\"Outlook not so good\\\", \\\"Very doubtful\\\"]\\n end\\n\\n def ask_question\\n print \\\"Question: \\\"\\n question = gets\\n\\n if question.chomp.eql? \\\"quit\\\"\\n exit(0)\\n end\\n\\n puts \\\"Response: #{@responses.sample} \\\\n\\\\n\\\"\\n end\\n\\n def run\\n loop do\\n ask_question\\n end\\n end\\nend\\n\\neight_ball = EightBall.new\\neight_ball.run\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"extern crate rand;\\n\\nuse rand::prelude::*;\\nuse std::io;\\n\\nfn main() {\\n let answers = [\\n \\\"It is certain\\\",\\n \\\"It is decidedly so\\\",\\n \\\"Without a doubt\\\",\\n \\\"Yes, definitely\\\",\\n \\\"You may rely on it\\\",\\n \\\"As I see it, yes\\\",\\n \\\"Most likely\\\",\\n \\\"Outlook good\\\",\\n \\\"Signs point to yes\\\",\\n \\\"Yes\\\",\\n \\\"Reply hazy, try again\\\",\\n \\\"Ask again later\\\",\\n \\\"Better not tell you now\\\",\\n \\\"Cannot predict now\\\",\\n \\\"Concentrate and ask again\\\",\\n \\\"Don't bet on it\\\",\\n \\\"My reply is no\\\",\\n \\\"My sources say no\\\",\\n \\\"Outlook not so good\\\",\\n \\\"Very doubtful\\\",\\n ];\\n let mut rng = rand::thread_rng();\\n let mut input_line = String::new();\\n\\n println!(\\\"Please enter your question or a blank line to quit.\\\\n\\\");\\n loop {\\n io::stdin()\\n .read_line(&mut input_line)\\n .expect(\\\"The read line failed.\\\");\\n if input_line.trim() == \\\"\\\" {\\n break;\\n }\\n println!(\\\"{}\\\\n\\\", answers.choose(&mut rng).unwrap());\\n input_line.clear();\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"class MAIN is\\n const answers: ARRAY{STR} :=\\n |\\n \\\"It is certain.\\\", \\\"It is decidedly so.\\\",\\n \\\"Without a doubt.\\\", \\\"Yes - definitely.\\\", \\\"You may rely on it.\\\",\\n \\\"As I see it, yes.\\\", \\\"Most likely.\\\", \\\"Outlook good.\\\",\\n \\\"Yes.\\\", \\\"Signs point to yes.\\\", \\\"Reply hazy, try again.\\\",\\n \\\"Ask again later.\\\", \\\"Better not tell you now.\\\", \\\"Cannot predict now.\\\",\\n \\\"Concentrate and ask again.\\\", \\\"Don't count on it.\\\", \\\"My reply is no.\\\",\\n \\\"My sources say no.\\\", \\\"Outlook not so good.\\\", \\\"Very doubtful.\\\"\\n |;\\n main is\\n RND::seed := #TIMES.wall_time;\\n loop\\n #OUT+\\\"Your question: \\\"; #OUT.flush;\\n question ::= #IN.get_str;\\n #OUT+answers[RND::int(0, answers.size-1)] + \\\"\\\\n\\\";\\n end;\\n end;\\nend;\\n\",\n \"language\": \"Sather\"\n },\n {\n \"code\": \"import scala.util.Random\\n\\nobject Magic8Ball extends App {\\n val shake: () => String = {\\n val answers = List(\\n \\\"It is certain.\\\", \\\"It is decidedly so.\\\", \\\"Without a doubt.\\\",\\n \\\"Yes – definitely.\\\", \\\"You may rely on it.\\\", \\\"As I see it, yes.\\\",\\n \\\"Most likely.\\\", \\\"Outlook good.\\\", \\\"Yes.\\\", \\\"Signs point to yes.\\\",\\n \\\"Reply hazy, try again.\\\", \\\"Ask again later\\\", \\\"Better not tell you now.\\\",\\n \\\"Cannot predict now.\\\", \\\"Concentrate and ask again.\\\", \\\"Don't count on it.\\\",\\n \\\"My reply is no.\\\", \\\"My sources say no.\\\", \\\"Outlook not so good.\\\",\\n \\\"Very doubtful.\\\"\\n )\\n val r = new Random\\n () => answers(r.nextInt(answers.length))\\n }\\n\\n println(\\\"Ask the Magic 8-Ball your questions. ('q' or 'quit' to quit)\\\\n\\\")\\n\\n while (true) {\\n io.StdIn.readLine(\\\"Question: \\\").toLowerCase match {\\n case \\\"q\\\" | \\\"quit\\\" =>\\n println(\\\"Goodbye.\\\")\\n sys.exit()\\n case _ =>\\n println(s\\\"Response: ${shake()}\\\\n\\\")\\n }\\n }\\n}\\n\",\n \"language\": \"Sather\"\n },\n {\n \"code\": \"namespace path {::tcl::mathop ::tcl::mathfunc}\\n\\nset answers {\\n\\t\\\"As I see it, yes\\\"\\n\\t\\\"Ask again later\\\"\\n\\t\\\"Better not tell you now\\\"\\n\\t\\\"Cannot predict now\\\"\\n\\t\\\"Concentrate and ask again\\\"\\n\\t\\\"Don't bet on it\\\"\\n\\t\\\"It is certain\\\"\\n\\t\\\"It is decidedly so\\\"\\n\\t\\\"Most likely\\\"\\n\\t\\\"My reply is no\\\"\\n\\t\\\"My sources say maybe\\\"\\n\\t\\\"My sources say no\\\"\\n\\t\\\"Outlook good\\\"\\n\\t\\\"Outlook not so good\\\"\\n\\t\\\"Reply hazy, try again\\\"\\n\\t\\\"Signs point to yes\\\"\\n\\t\\\"Very doubtful\\\"\\n\\t\\\"Without a doubt\\\"\\n\\t\\\"Yes\\\"\\n\\t\\\"Yes, definitely\\\"\\n\\t\\\"Yes, probably not\\\"\\n\\t\\\"You may rely on it\\\"\\n\\t\\\"Your question has already been answered\\\"\\n}\\n\\nputs -nonewline \\\"Question: \\\"; flush stdout\\nwhile {[gets stdin line] > 0} {\\n\\tset answer [lindex $answers [int [* [rand] [llength $answers]]]]\\n\\tputs \\\"⑧ says “$answer”\\\"\\n\\tputs -nonewline \\\"Question: \\\"; flush stdout\\n}\\n\",\n \"language\": \"Sather\"\n },\n {\n \"code\": \"10 PRINT \\\"Concentrate hard on your question, then tell me your favorite number.\\\"\\n20 INPUT N\\n30 REM in lieu of a random number generator\\n40 IF N<0 THEN LET N=-N\\n50 IF N<20 THEN GOTO 1000+N*10\\n60 LET N=N-20\\n70 GOTO 50\\n1000 PRINT \\\"It is certain.\\\"\\n1005 END\\n1010 PRINT \\\"It is decidedly so.\\\"\\n1015 END\\n1020 PRINT \\\"Without a doubt.\\\"\\n1025 END\\n1030 PRINT \\\"Yes - definitely.\\\"\\n1035 END\\n1040 PRINT \\\"You may rely on it.\\\"\\n1045 END\\n1050 PRINT \\\"As I see it, yes.\\\"\\n1055 END\\n1060 PRINT \\\"Most likely.\\\"\\n1065 END\\n1070 PRINT \\\"Outlook good.\\\"\\n1075 END\\n1080 PRINT \\\"Yes.\\\"\\n1085 END\\n1090 PRINT \\\"Signs point to yes.\\\"\\n1095 END\\n1100 PRINT \\\"Reply hazy, try again.\\\"\\n1105 END\\n1110 PRINT \\\"Ask again later.\\\"\\n1115 END\\n1120 PRINT \\\"Better not tell you now.\\\"\\n1125 END\\n1130 PRINT \\\"Cannot predict now.\\\"\\n1135 END\\n1140 PRINT \\\"Concentrate and ask again.\\\"\\n1145 END\\n1150 PRINT \\\"Don't count on it.\\\"\\n1155 END\\n1160 PRINT \\\"My reply is no.\\\"\\n1165 END\\n1170 PRINT \\\"My sources say no.\\\"\\n1175 END\\n1180 PRINT \\\"Outlook not so good.\\\"\\n1185 END\\n1190 PRINT \\\"Very doubtful.\\\"\\n\",\n \"language\": \"Sather\"\n },\n {\n \"code\": \"#lang transd\\n\\nMainModule : {\\n ans: [\\\"It is certain.\\\", \\\"It is decidedly so.\\\", \\\"Without a doubt.\\\",\\n \\\"Yes - definitely.\\\", \\\"You may rely on it.\\\", \\\"As I see it, yes.\\\",\\n \\\"Most likely.\\\", \\\"Outlook good.\\\", \\\"Yes.\\\", \\\"Signs point to yes.\\\",\\n \\\"Reply hazy, try again.\\\", \\\"Ask again later.\\\",\\n \\\"Better not tell you now.\\\", \\\"Cannot predict now.\\\",\\n \\\"Concentrate and ask again.\\\", \\\"Don't count on it.\\\",\\n \\\"My reply is no.\\\", \\\"My sources say no.\\\", \\\"Outlook not so good.\\\",\\n \\\"Very doubtful.\\\"],\\n\\t_start: (lambda locals: sense 0 quest \\\"\\\"\\n (while true\\n (lout \\\"Please, ask your question:\\\")\\n (getline quest)\\n (if (not (size quest)) break)\\n (if (neq (back quest) \\\"?\\\") (lout \\\"\\\\nEh?\\\") continue)\\n (= sense 0)\\n (tql quest reduce: [\\\"col1\\\"] using: (λ c Char() (+= sense c)))\\n (lout (get ans (mod sense 20)))\\n )\\n )\\n}\\n\",\n \"language\": \"Transd\"\n },\n {\n \"code\": \"DIM answer$(20)\\nFOR i = 1 to ubound(answer$)\\n READ answer$(i)\\nNEXT i\\nDATA \\\"It is certain.\\\", \\\"It is decidedly so.\\\"\\nDATA \\\"Without a doubt.\\\", \\\"Yes – definitely.\\\"\\nDATA \\\"You may rely on it.\\\", \\\"As I see it, yes.\\\"\\nDATA \\\"Most likely.\\\", \\\"Outlook good.\\\", \\\"Yes.\\\"\\nDATA \\\"Signs point to yes.\\\", \\\"Reply hazy, try again.\\\"\\nDATA \\\"Ask again later.\\\", \\\"Better not tell you now.\\\"\\nDATA \\\"Cannot predict now.\\\", \\\"Concentrate and ask again.\\\"\\nDATA \\\"Don't count on it.\\\", \\\"My reply is no.\\\"\\nDATA \\\"My sources say no.\\\", \\\"Outlook not so good.\\\"\\nDATA \\\"Very doubtful.\\\"\\n\\nRANDOMIZE\\nPRINT \\\"Q to quit.\\\"\\nDO\\n INPUT prompt \\\"What would you like to know? \\\": question$\\n IF ucase$(question$) = \\\"Q\\\" then EXIT DO\\n PRINT answer$(int(rnd*ubound(answer$)))\\n PRINT\\nLOOP\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"#!/bin/bash\\n\\ndeclare -ra RESPONSES=(\\\"It is certain\\\" \\\"It is decidedly so\\\" \\\"Without a doubt\\\"\\n \\\"Yes definitely\\\" \\\"You may rely on it\\\" \\\"As I see it yes\\\"\\n \\\"Most likely\\\" \\\"Outlook good\\\" \\\"Signs point to yes\\\" \\\"Yes\\\"\\n \\\"Reply hazy try again\\\" \\\"Ask again later\\\"\\n \\\"Better not tell you now\\\" \\\"Cannot predict now\\\"\\n \\\"Concentrate and ask again\\\" \\\"Don't bet on it\\\"\\n \\\"My reply is no\\\" \\\"My sources say no\\\" \\\"Outlook not so good\\\"\\n \\\"Very doubtful\\\")\\n\\nprintf \\\"Welcome to 8 ball! Enter your questions using the prompt below to\\nfind the answers you seek. Type 'quit' to exit.\\\\n\\\\n\\\"\\n\\nuntil\\n read -p 'Enter Question: '\\n [[ \\\"$REPLY\\\" == quit ]]\\ndo printf \\\"Response: %s\\\\n\\\\n\\\" \\\"${RESPONSES[RANDOM % ${#RESPONSES[@]}]}\\\"\\ndone\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"import \\\"random\\\" for Random\\nimport \\\"io\\\" for Stdin, Stdout\\n\\nvar answers = [\\n \\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",\\n \\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\",\\n \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\",\\n \\\"Reply hazy, try again\\\", \\\"Ask again later\\\",\\n \\\"Better not tell you now\\\", \\\"Cannot predict now\\\",\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",\\n \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",\\n \\\"Very doubtful\\\"\\n]\\nvar rand = Random.new()\\nSystem.print(\\\"Please enter your question or a blank line to quit.\\\")\\nwhile (true) {\\n System.write(\\\"\\\\n? : \\\")\\n Stdout.flush()\\n var question = Stdin.readLine()\\n if (question.trim() == \\\"\\\") return\\n var answer = answers[rand.int(20)]\\n System.print(\\\"\\\\n%(answer)\\\")\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"set Responses = [\\\"It is Certain.\\\",\\\"It is decidedly so.\\\",\\\"Without a doubt.\\\",\\\"Yes definitely.\\\",\\\"You may rely on it\\\",\\\"As I see it, yes.\\\",\\\"Most likely.\\\",\\\"Outlook good.\\\",\\\"Yes.\\\",\\\"Sign points to yes.\\\",\\\"Reply hazy, try again.\\\",\\\"Ask again later.\\\",\\\"Better not tell you now.\\\",\\\"Cannot predict now.\\\",\\\"Concentrate and ask again.\\\",\\\"Don't count on it.\\\",\\\"My reply is no.\\\",\\\"My sources say no.\\\",\\\"Outlook not so good.\\\",\\\"Very doubtful.\\\"];\\n\\nwhile(true){\\n\\twindow->prompt(\\\"Ask 8-Ball a question\\\");\\n\\tlog(Responses[rnd(0,?Responses-1)]);\\n}\\n\",\n \"language\": \"XBS\"\n },\n {\n \"code\": \"set Responses = [\\\"It is Certain.\\\",\\\"It is decidedly so.\\\",\\\"Without a doubt.\\\",\\\"Yes definitely.\\\",\\\"You may rely on it\\\",\\\"As I see it, yes.\\\",\\\"Most likely.\\\",\\\"Outlook good.\\\",\\\"Yes.\\\",\\\"Sign points to yes.\\\",\\\"Reply hazy, try again.\\\",\\\"Ask again later.\\\",\\\"Better not tell you now.\\\",\\\"Cannot predict now.\\\",\\\"Concentrate and ask again.\\\",\\\"Don't count on it.\\\",\\\"My reply is no.\\\",\\\"My sources say no.\\\",\\\"Outlook not so good.\\\",\\\"Very doubtful.\\\"];\\n\\nfunc Compile(String){\\n\\tset n = 0;\\n\\tforeach(k,v as String){\\n\\t\\tn+=string.char(v);\\n\\t}\\n\\tsend n;\\n}\\n\\nwhile(true){\\n\\tlet Response = window->prompt(\\\"Ask 8-Ball a question\\\");\\n\\tlet N = Compile(Response);\\n\\tlog(Responses[N%(?Responses)]);\\n}\\n\",\n \"language\": \"XBS\"\n },\n {\n \"code\": \"int Answers, Answer, Question;\\n[Answers:= [\\n \\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",\\n \\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\",\\n \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\",\\n \\\"Reply hazy, try again\\\", \\\"Ask again later\\\",\\n \\\"Better not tell you now\\\", \\\"Cannot predict now\\\",\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",\\n \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",\\n \\\"Very doubtful\\\"];\\nText(0, \\\"Please enter your question or a blank line to quit.\\n\\\");\\nwhile true do\\n [CrLf(0); Text(0, \\\"? : \\\");\\n Question:= ChIn(0);\\n if Question = \\\\CR\\\\$0D then return;\\n OpenI(0); \\\\discard any remaining chars in keyboard buffer\\n Answer:= Answers(Ran(20));\\n Text(0, Answer); CrLf(0);\\n ]\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"dim answer$(19)\\nfor i = 0 to arraysize(answer$(),1): read answer$(i): next i\\n\\nprint \\\"Q to quit.\\\"\\ndo\\n input \\\"What would you like to know? \\\" question$\\n if upper$(question$) = \\\"Q\\\" then end : fi\\n print answer$(int(ran(arraysize(answer$(),1))))\\n print\\nloop\\n\\ndata \\\"It is certain.\\\",\\\"It is decidedly so.\\\"\\ndata \\\"Without a doubt.\\\",\\\"Yes – definitely.\\\"\\ndata \\\"You may rely on it.\\\",\\\"As I see it, yes.\\\"\\ndata \\\"Most likely.\\\",\\\"Outlook good.\\\",\\\"Yes.\\\"\\ndata \\\"Signs point to yes.\\\",\\\"Reply hazy, try again.\\\"\\ndata \\\"Ask again later.\\\",\\\"Better not tell you now.\\\"\\ndata \\\"Cannot predict now.\\\",\\\"Concentrate and ask again.\\\"\\ndata \\\"Don//t count on it.\\\",\\\"My reply is no.\\\"\\ndata \\\"My sources say no.\\\",\\\"Outlook not so good.\\\"\\ndata \\\"Very doubtful.\\\"\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"answers:=T(\\n \\\"It is certain\\\", \\\"It is decidedly so\\\", \\\"Without a doubt\\\",\\n \\\"Yes, definitely\\\", \\\"You may rely on it\\\", \\\"As I see it, yes\\\",\\n \\\"Most likely\\\", \\\"Outlook good\\\", \\\"Signs point to yes\\\", \\\"Yes\\\",\\n \\\"Reply hazy, try again\\\", \\\"Ask again later\\\",\\n \\\"Better not tell you now\\\", \\\"Cannot predict now\\\",\\n \\\"Concentrate and ask again\\\", \\\"Don't bet on it\\\",\\n \\\"My reply is no\\\", \\\"My sources say no\\\", \\\"Outlook not so good\\\",\\n \\\"Very doubtful\\\"\\n);\\nprintln(\\\"Please enter your question or a blank line to quit.\\\");\\nwhile(ask(\\\"? : \\\")){ println(answers[(0).random(answers.len())]) }\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Magic-8-ball"}}},{"rowIdx":461,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Magic_constant\n","language":"00-META"},{"code":"A magic square is a square grid containing consecutive integers from 1 to N², arranged so that every row, column and diagonal adds up to the same number. That number is a constant. There is no way to create a valid N x N magic square that does not sum to the associated constant. \n\n;EG\n\nA 3 x 3 magic square ''always'' sums to 15. \n\n<pre style=\"font-family: consolas, inconsolata, monospace; line-height: normal;\"> ┌───┬───┬───┐\n │ 2 │ 7 │ 6 │\n ├───┼───┼───┤\n │ 9 │ 5 │ 1 │\n ├───┼───┼───┤\n │ 4 │ 3 │ 8 │\n └───┴───┴───┘</pre>\n\nA 4 x 4 magic square ''always'' sums to 34.\n\nTraditionally, the sequence leaves off terms for n = 0 and n = 1 as the magic squares of order 0 and 1 are trivial; and a term for n = 2 because it is impossible to form a magic square of order 2.\n\n\n;Task\n\n* Starting at order 3, show the first 20 magic constants.\n* Show the 1000th magic constant. (Order 1003)\n* Find and show the order of the smallest N x N magic square whose constant is greater than 10¹ through 10¹⁰.\n\n\n;Stretch\n\n* Find and show the order of the smallest N x N magic square whose constant is greater than 10¹¹ through 10²⁰.\n\n\n;See also\n\n* [[wp:Magic_constant|Wikipedia: Magic constant]]\n* [[oeis:A006003|OEIS: A006003]] (Similar sequence, though it includes terms for 0, 1 & 2.)\n* [[Magic squares of odd order]]\n* [[Magic squares of singly even order]]\n* [[Magic squares of doubly even order]]\n\n\n\n","language":"00-TASK"},{"code":"F a(=n)\n n += 2\n R n * (n ^ 2 + 1) / 2\n\nF inv_a(x)\n V k = 0\n L k * (k ^ 2.0 + 1) / 2 + 2 < x\n k++\n R k\n\nprint(‘The first 20 magic constants are:’)\nL(n) 1..19\n print(Int(a(n)), end' ‘ ’)\nprint(\"\\nThe 1,000th magic constant is: \"Int(a(1000)))\n\nL(e) 1..19\n print(‘10^’e‘: ’inv_a(10.0 ^ e))\n","language":"11l"},{"code":"BEGIN # find some magic constants - the row, column and diagonal sums of a magin square #\n # translation of the Free Basic sample with the Julia/Wren inverse function #\n # returns the magic constant of a magic square of order n + 2 #\n PROC a = ( INT n )LONG LONG INT:\n BEGIN\n LONG LONG INT n2 = n + 2;\n ( n2 * ( ( n2 * n2 ) + 1 ) ) OVER 2\n END # a # ;\n # returns the order of the magic square whose magic constant is at least x #\n PROC inv a = ( LONG LONG INT x )LONG LONG INT:\n ENTIER long long exp( long long ln( x * 2 ) / 3 ) + 1;\n\n print( ( \"The first 20 magic constants are \" ) );\n FOR n TO 20 DO\n print( ( whole( a( n ), 0 ), \" \" ) )\n OD;\n print( ( newline ) );\n print( ( \"The 1,000th magic constant is \", whole( a( 1000 ), 0 ), newline ) );\n LONG LONG INT e := 1;\n FOR n TO 20 DO\n e *:= 10;\n print( ( \"10^\", whole( n, -2 ), \": \", whole( inv a( e ), -9 ), newline ) )\n OD\nEND\n","language":"ALGOL-68"},{"code":"a: function [n][\n n: n+2\n return (n*(1 + n^2))/2\n]\n\naInv: function [x][\n k: new 0\n while [x > 2 + k*(1+k^2)/2]\n -> inc 'k\n return k\n]\nprint \"The first 20 magic constants are:\"\nprint map 1..19 => a\n\nprint \"\"\nprint \"The 1,000th magic constant is:\"\nprint a 1000\n\nprint \"\"\nloop 1..19 'z ->\n print [\"10 ^\" z \"=>\" aInv 10^z]\n","language":"Arturo"},{"code":"# syntax: GAWK -f MAGIC_CONSTANT.AWK\n# converted from FreeBASIC\nBEGIN {\n printf(\"The first 20 magic constants are:\")\n for (i=1; i<=20; i++) {\n printf(\" %d\",a(i))\n }\n printf(\"\\n\")\n printf(\"The 1,000th magic constant is: %d\\n\",a(1000))\n for (i=1; i<=20; i++) {\n printf(\"10^%02d: %8d\\n\",i,inv_a(10^i))\n }\n exit(0)\n}\nfunction a(n) {\n n += 2\n return(n*(n^2+1)/2)\n}\nfunction inv_a(x, k) {\n while (k*(k^2+1)/2+2 < x) {\n k++\n }\n return(k)\n}\n","language":"AWK"},{"code":"function a(n)\n\tn = n + 2\n\treturn n*(n^2 + 1)/2\nend function\n\nfunction inv_a(x)\n\tk = 0\n\twhile k*(k^2+1)/2+2 < x\n\t\tk += 1\n\tend while\n\treturn k\nend function\n\nprint \"The first 20 magic constants are:\"\nfor n = 1 to 20\n\tprint int(a(n));\" \";\nnext n\nprint : print\nprint \"The 1,000th magic constant is \"; int(a(1000)); chr(10)\n\nfor e = 1 to 20\n\tprint \"10^\"; e; \": \"; chr(9); inv_a(10^e)\nnext e\nend\n","language":"BASIC256"},{"code":"#include <cmath>\n#include <cstdint>\n#include <iomanip>\n#include <iostream>\n#include <string>\n\nconstexpr int32_t ORDER_FIRST_MAGIC_SQUARE = 3;\nconstexpr double LN2 = log(2.0);\nconstexpr double LN10 = log(10.0);\n\n// Return the magic constant for a magic square of the given order\nint32_t magicConstant(int32_t n) {\n\treturn n * ( n * n + 1 ) / 2;\n}\n\n// Return the smallest order of a magic square such that its magic constant is greater than 10 to the given power\nint32_t minimumOrder(int32_t n) {\n\treturn (int) exp( ( LN2 + n * LN10 ) / 3 ) + 1;\n}\n\n// Return the order of the magic square at the given index\nint32_t order(int32_t index) {\n\treturn ORDER_FIRST_MAGIC_SQUARE + index - 1;\n}\n\nint main() {\n\tstd::cout << \"The first 20 magic constants:\" << std::endl;\n\tfor ( int32_t i = 1; i <= 20; ++i ) {\n\t\tstd::cout << \" \" << magicConstant(order(i));\n\t}\n\tstd::cout << std::endl << std::endl;\n\n\tstd::cout << \"The 1,000th magic constant: \" << magicConstant(order(1'000)) << std::endl << std::endl;\n\n\tstd::cout << \"Order of the smallest magic square whose constant is greater than:\" << std::endl;\n\tfor ( int32_t i = 1; i <= 20; ++i ) {\n\t\tstd::string power_of_10 = \"10^\" + std::to_string(i) + \":\";\n\t\tstd::cout << std::setw(6) << power_of_10 << std::setw(8) << minimumOrder(i) << std::endl;\n\t}\n}\n","language":"C++"},{"code":"using System;\n\npublic class MagicConstant {\n\n private const int OrderFirstMagicSquare = 3;\n\n public static void Main(string[] args) {\n Console.WriteLine(\"The first 20 magic constants:\");\n for (int i = 1; i <= 20; i++) {\n Console.Write(\" \" + MagicConstantValue(Order(i)));\n }\n Console.WriteLine(\"\\n\");\n\n Console.WriteLine(\"The 1,000th magic constant: \" + MagicConstantValue(Order(1_000)) + \"\\n\");\n\n Console.WriteLine(\"Order of the smallest magic square whose constant is greater than:\");\n for (int i = 1; i <= 20; i++) {\n string powerOf10 = \"10^\" + i + \":\";\n Console.WriteLine($\"{powerOf10,6}{MinimumOrder(i),8}\");\n }\n }\n\n // Return the magic constant for a magic square of the given order\n private static int MagicConstantValue(int n) {\n return n * (n * n + 1) / 2;\n }\n\n // Return the smallest order of a magic square such that its magic constant is greater than 10 to the given power\n private static int MinimumOrder(int n) {\n return (int)Math.Exp((Math.Log(2.0)+ n * Math.Log(10.0)) / 3) + 1;\n }\n\n // Return the order of the magic square at the given index\n private static int Order(int index) {\n return OrderFirstMagicSquare + index - 1;\n }\n}\n","language":"C-sharp"},{"code":"function GetMagicNumber(N: double): double;\nbegin\nResult:=N * (((N * N) + 1) / 2);\nend;\n\nfunction GetNumberLess(N: double): integer;\nvar M: double;\nbegin\nfor Result:=1 to High(Integer) do\n\tbegin\n\tM:=GetMagicNumber(Result);\n\tif M>N then break;\n\tend;\nend;\n\nprocedure ShowMagicNumber(Memo: TMemo);\nvar I,J: integer;\nvar N,M: double;\nvar S: string;\nbegin\nS:='';\nfor I:=3 to 23 do\n\tbegin\n\tS:=S+Format('%8.0n',[GetMagicNumber(I)]);\n\tif (I mod 5)=2 then S:=S+#$0D#$0A;\n\tend;\nMemo.Lines.Add(S);\nMemo.Lines.Add('');\nMemo.Lines.Add('1000th: '+Format('%8.0n',[GetMagicNumber(1002)]));\nMemo.Lines.Add('');\nN:=10;\nfor I:=1 to 20 do\n\tbegin\n\tJ:=GetNumberLess(N);\n\tMemo.Lines.Add('M^'+Format('%d%8d',[I,J]));\n\tN:=N * 10;\n\tend;\nend;\n","language":"Delphi"},{"code":"func a n .\n n += 2\n return n * (n * n + 1) / 2\n.\nfunc inva x .\n while k * (k * k + 1) / 2 + 2 < x\n k += 1\n .\n return k\n.\nwrite \"The first 20 magic constants: \"\nfor n to 20\n write a n & \" \"\n.\nprint \"\"\nprint \"\"\nprint \"The 1,000th magic constant: \" & a 1000\nprint \"\"\nprint \"Smallest magic square with constant greater than:\"\nfor e to 10\n print \"10^\" & e & \": \" & inva pow 10 e\n.\n","language":"EasyLang"},{"code":"USING: formatting io kernel math math.functions.integer-logs\nmath.ranges prettyprint sequences ;\n\n: magic ( m -- n ) dup sq 1 + 2 / * ;\n\n\"First 20 magic constants:\" print\n3 22 [a,b] [ bl ] [ magic pprint ] interleave nl\nnl\n\"1000th magic constant: \" write 1002 magic .\nnl\n\"Smallest order magic square with a constant greater than:\" print\n1 0 20 [\n [ 10 * ] dip\n [ dup magic pick < ] [ 1 + ] while\n over integer-log10 over \"10^%02d: %d\\n\" printf\n dup + 1 -\n] times 2drop\n","language":"Factor"},{"code":"program MagicConst;\n{$IFDEF FPC}{$MODE DELPHI}{$OPTIMIZATION ON,ALL}{$ENDIF}\n{$IFDEF WINDOWS}{$APPTYPE CONSOLE}{$ENDIF}\n\nfunction MagicSum(n :Uint32):Uint64; inline;\nvar\n k : Uint64;\nbegin\n k := n*Uint64(n);\n result := (k*k+k) DIV 2;\nend;\n\nfunction MagSumPerRow(n:Uint32):Uint32;\nbegin\n//result := MagicSum(n) DIV n;\n //(n^3 + n) /2\n result := ((Uint64(n)*n+1)*n) DIV 2;\nend;\nvar\n s : String[31];\n i : Uint32;\n lmt,rowcnt : extended;\nBegin\n writeln('First Magic constants 3..20');\n For i := 3 to 20 do\n write(MagSumPerRow(i),' ');\n writeln;\n writeln('1000.th ',MagSumPerRow(1002));\n\n writeln('First Magic constants > 10^xx');\n //lmt = (rowcnt^3 + rowcnt) /2 -> rowcnt > (lmt*2 )^(1/3)\n lmt := 2.0 * 10.0;\n For i := 1 to 50 do\n begin\n rowcnt := Int(exp(ln(lmt)/3))+1.0;//+1 suffices\n str(trunc(rowcnt),s);\n writeln('10^',i:2,#9,s:18);\n f := 10.0*lmt;\n end;\nend.\n","language":"Free-Pascal-Lazarus"},{"code":"function a(byval n as uinteger) as ulongint\n n+=2\n return n*(n^2 + 1)/2\nend function\n\nfunction inv_a(x as double) as ulongint\n dim as ulongint k = 0\n while k*(k^2+1)/2+2 < x\n k+=1\n wend\n return k\nend function\n\ndim as ulongint n\nprint \"The first 20 magic constants are \":\nfor n = 1 to 20\n print a(n);\" \";\nnext n\nprint\nprint \"The 1,000th magic constant is \";a(1000)\n\nfor e as uinteger = 1 to 20\n print using \"10^##: #########\";e;inv_a(10^cast(double,e))\nnext e\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n \"rcu\"\n)\n\nfunc magicConstant(n int) int {\n return (n*n + 1) * n / 2\n}\n\nvar ss = []string{\n \"\\u2070\", \"\\u00b9\", \"\\u00b2\", \"\\u00b3\", \"\\u2074\",\n \"\\u2075\", \"\\u2076\", \"\\u2077\", \"\\u2078\", \"\\u2079\",\n}\n\nfunc superscript(n int) string {\n if n < 10 {\n return ss[n]\n }\n if n < 20 {\n return ss[1] + ss[n-10]\n }\n return ss[2] + ss[0]\n}\n\nfunc main() {\n fmt.Println(\"First 20 magic constants:\")\n for n := 3; n <= 22; n++ {\n fmt.Printf(\"%5d \", magicConstant(n))\n if (n-2)%10 == 0 {\n fmt.Println()\n }\n }\n\n fmt.Println(\"\\n1,000th magic constant:\", rcu.Commatize(magicConstant(1002)))\n\n fmt.Println(\"\\nSmallest order magic square with a constant greater than:\")\n for i := 1; i <= 20; i++ {\n goal := math.Pow(10, float64(i))\n order := int(math.Cbrt(goal*2)) + 1\n fmt.Printf(\"10%-2s : %9s\\n\", superscript(i), rcu.Commatize(order))\n }\n}\n","language":"Go"},{"code":"mgc=: 0 0.5 0 0.5&p.\n","language":"J"},{"code":" mgc 3+i.20\n15 34 65 111 175 260 369 505 671 870 1105 1379 1695 2056 2465 2925 3439 4010 4641 5335\n mgc 1003x\n504514015\n (#\\,.],.mgc) x:(mgc i.3000) I.10^1+i.10\n 1 3 15\n 2 6 111\n 3 13 1105\n 4 28 10990\n 5 59 102719\n 6 126 1000251\n 7 272 10061960\n 8 585 100101105\n 9 1260 1000188630\n10 2715 10006439295\n","language":"J"},{"code":" ((10+#\\),.],.mgc) x:(mgc i.6e6) I.10^11+i.10\n11 5849 100049490449\n12 12600 1000188006300\n13 27145 10000910550385\n14 58481 100003310078561\n15 125993 1000021311323825\n16 271442 10000026341777165\n17 584804 100000232056567634\n18 1259922 1000002262299152685\n19 2714418 10000004237431278525\n20 5848036 100000026858987459346\n","language":"J"},{"code":"public final class MagicConstant {\n\n\tpublic static void main(String[] aArgs) {\n\t\tSystem.out.println(\"The first 20 magic constants:\");\n\t\tfor ( int i = 1; i <= 20; i++ ) {\n\t\t\tSystem.out.print(\" \" + magicConstant(order(i)));\n\t\t}\n\t\tSystem.out.println(System.lineSeparator());\n\t\t\n\t\tSystem.out.println(\"The 1,000th magic constant: \" + magicConstant(order(1_000)) + System.lineSeparator());\n\t\t\n\t\tSystem.out.println(\"Order of the smallest magic square whose constant is greater than:\");\n\t\tfor ( int i = 1; i <= 20; i++ ) {\n\t\t\tString powerOf10 = \"10^\" + i + \":\";\n\t\t\tSystem.out.println(String.format(\"%6s%8s\", powerOf10, minimumOrder(i)));\n\t\t}\n\t}\n\t\n\t// Return the magic constant for a magic square of the given order\n\tprivate static int magicConstant(int aN) {\t\n\t\treturn aN * ( aN * aN + 1 ) / 2;\n\t}\n\n\t// Return the smallest order of a magic square such that its magic constant is greater than 10 to the given power\n\tprivate static int minimumOrder(int aN) {\t\t\n\t\treturn (int) Math.exp( ( LN2 + aN * LN10 ) / 3 ) + 1;\n\t}\n\t\n\t// Return the order of the magic square at the given index\n\tprivate static int order(int aIndex) {\n\t\treturn ORDER_FIRST_MAGIC_SQUARE + aIndex - 1;\n\t}\n\t\n private static final int ORDER_FIRST_MAGIC_SQUARE = 3;\n\tprivate static final double LN2 = Math.log(2.0);\n\tprivate static final double LN10 = Math.log(10.0);\n\n}\n","language":"Java"},{"code":"# To take advantage of gojq's arbitrary-precision integer arithmetic:\ndef power($b): . as $in | reduce range(0;$b) as $i (1; . * $in);\n\n# nth-root\ndef iroot($n):\n . as $in\n | if $n == 1 then .\n else (. < 0) as $neg\n | if $neg and (n % 2) == 0\n then \"Cannot take the \\($n)th root of a negative number.\" | error\n else ($n-1) as $n\n | {t: (if $neg then -. else . end)}\n | .s = .t + 1\n | .u = .t\n | until (.u >= .s;\n .s = .u\n | .u = ((.u * $n) + (.t / (.u|power($n)))) / ($n + 1) )\n | if $neg then - .s else .s end\n end\n end;\n\n# input: an array\n# output: a stream of arrays of size size except possibly for the last array\ndef group(size):\n recurse( .[size:]; length>0) | .[0:size];\n\ndef lpad($len): tostring | ($len - length) as $l | (\" \" * $l)[:$l] + .;\n\ndef ss : [\"\\u2070\", \"\\u00b9\", \"\\u00b2\", \"\\u00b3\", \"\\u2074\",\n \"\\u2075\", \"\\u2076\", \"\\u2077\", \"\\u2078\", \"\\u2079\"];\n\ndef superscript:\n if . < 10 then ss[.]\n elif . < 20 then ss[1] + ss[. - 10]\n else ss[2] + ss[0]\n end;\n","language":"Jq"},{"code":"def magicConstant: (.*. + 1) * . / 2;\n\n\"First 20 magic constants:\",\n ([range(3;23)\n | magicConstant]\n | group(10) | map(lpad(5)) | join(\" \")),\n \"\",\n \"1,000th magic constant: \\( 1002| magicConstant)\",\n \"\",\n \"Smallest order magic square with a constant greater than:\",\n (range(1; 21) as $i\n | (10 | power($i)) as $goal\n | ((($goal * 2)|iroot(3) + 1) | floor) as $order\n | (\"10\\($i|superscript)\" | lpad(5)) + \": \\($order|lpad(9))\" )\n","language":"Jq"},{"code":"using Lazy\n\nmagic(x) = (1 + x^2) * x ÷ 2\nmagics = @>> Lazy.range() map(magic) filter(x -> x > 10) # first 2 values are filtered out\nprintln(\"First 20 magic constants: \", Int.(take(20, magics)))\nprintln(\"Thousandth magic constant is: \", collect(take(1000, magics))[end])\n\nprintln(\"Smallest magic square with constant greater than:\")\nfor expo in 1:20\n goal = big\"10\"^expo\n ordr = Int(floor((2 * goal)^(1/3))) + 1\n println(\"10^\", string(expo, pad=2), \" \", ordr)\nend\n","language":"Julia"},{"code":"function magic (x)\n return x * (1 + x^2) / 2\nend\n\nprint(\"Magic constants of orders 3 to 22:\")\nfor i = 3, 22 do\n io.write(magic(i) .. \" \")\nend\n\nprint(\"\\n\\nMagic constant 1003: \" .. magic(1003) .. \"\\n\")\n\nprint(\"Orders of smallest magic constant greater than...\")\nprint(\"-----\\t-----\\nValue\\tOrder\\n-----\\t-----\")\nlocal order = 1\nfor i = 1, 20 do\n repeat\n order = order + 1\n until magic(order) > 10 ^ i\n print(\"10^\" .. i, order)\nend\n","language":"Lua"},{"code":"ClearAll[i, n, MagicSumHelper, MagicSum, InverseMagicSum]\nMagicSumHelper[n_] = Sum[i, {i, n^2}]/n;\nMagicSum[n_] := MagicSumHelper[n + 2]\nInverseMagicSum[lim_] := Ceiling[-(1/(3^(1/3) (9 lim + Sqrt[3] Sqrt[1 + 27 lim^2])^(1/3))) + (9 lim + Sqrt[3] Sqrt[1 + 27 lim^2])^(1/3)/3^(2/3)]\n\nMagicSum /@ Range[20]\nMagicSum[1000]\n\nexps = Range[1, 50];\nnums = 10^exps;\nTranspose[{Superscript[10, #] & /@ exps, InverseMagicSum[nums]}] // Grid\n","language":"Mathematica"},{"code":"import std/[math, unicode]\n\nfunc magicConstant(n: int): int =\n ## Return the magic constant for a magic square of order \"n\".\n n * (n * n + 1) div 2\n\nfunc minOrder(n: int): int =\n ## Return the smallest order such as the magic constant is greater than \"10^n\".\n const Ln2 = ln(2.0)\n const Ln10 = ln(10.0)\n result = int(exp((Ln2 + n.toFloat * Ln10) / 3)) + 1\n\nconst First = 3\nconst Superscripts: array['0'..'9', string] = [\"⁰\", \"¹\", \"²\", \"³\", \"⁴\", \"⁵\", \"⁶\", \"⁷\", \"⁸\", \"⁹\"]\n\ntemplate order(idx: Positive): int =\n ## Compute the order of the magic square at index \"idx\".\n idx + (First - 1)\n\nfunc superscript(n: Natural): string =\n ## Return the Unicode string to use to represent an exponent.\n for d in $n:\n result.add(Superscripts[d])\n\necho \"First 20 magic constants:\"\nfor idx in 1..20:\n stdout.write ' ', order(idx).magicConstant\necho()\n\necho \"\\n1000th magic constant: \", order(1000).magicConstant\n\necho \"\\nOrder of the smallest magic square whose constant is greater than:\"\nfor n in 1..20:\n let left = \"10\" & n.superscript & ':'\n echo left.alignLeft(6), ($minOrder(n)).align(7)\n","language":"Nim"},{"code":"#!/usr/bin/perl\n\nuse strict; # https://rosettacode.org/wiki/Magic_constant\nuse warnings;\n\nmy @twenty = map $_ * ( $_ ** 2 + 1 ) / 2, 3 .. 22;\nprint \"first twenty: @twenty\\n\\n\" =~ s/.{50}\\K /\\n/gr;\n\nmy $thousandth = 1002 * ( 1002 ** 2 + 1 ) / 2;\nprint \"thousandth: $thousandth\\n\\n\";\n\nprint \"10**N order\\n\";\nfor my $i ( 1 .. 20 )\n {\n printf \"%3d %9d\\n\", $i, (10 ** $i * 2) ** ( 1 / 3 ) + 1;\n }\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">magic</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">nth</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">order</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">nth</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">order</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;\">order</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</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 magic constants: %V\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">apply</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><span style=\"color: #000000;\">magic</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;\">\"1000th magic constant: %,d\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">magic</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1000</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\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">goal</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">order</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;\">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: #000000;\">20</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">mpz_ui_pow_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">goal</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_mul_si</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">goal</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_nthroot</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_add_si</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</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;\">\"1e%d: %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">mpz_get_str</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</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;\">for</span>\n<!--\n","language":"Phix"},{"code":"m(X,Y):- Y is X*(X*X+1)/2.\n\nl(L,R,T,X):- L > R -> X is L; M is div(L+R,2), m(M,F),\n (T < F -> R_ is M-1, l(L,R_,T,X); L_ is M+1, l(L_,R,T,X)).\nl(B,X):- l(1,B,B,X).\n\ntask:-\n write(\"First 20 magic constants are:\"), forall(between(3,22,N), (m(N,X), format(\" ~d\",X))), nl,\n write(\"The 1000th magic constant is:\"), forall(m(1002,X), format(\" ~d\",X)), nl,\n forall(between(1,20,N), (l(10**N,X), format(\"10^~d:\\t~d\\n\",[N,X]))).\n","language":"Prolog"},{"code":"Procedure.i a(n.i)\n n + 2\n ProcedureReturn n*(Pow(n,2) + 1)/2\nEndProcedure\n\nProcedure.i inv_a(x.i)\n k.i = 0\n While k*(Pow(k,2)+1)/2+2 < x\n k + 1\n Wend\n ProcedureReturn k\nEndProcedure\n\nOpenConsole()\nPrintN(\"The first 20 magic constants are:\")\nFor n.i = 1 To 20\n Print(Str(a(n)) + \" \")\nNext n\nPrintN(\"\") : PrintN(\"\")\nPrintN(\"The 1,000th magic constant is \" + Str(a(1000)))\n\nFor e.i = 1 To 20\n PrintN(\"10^\" + Str(e) + \": \" + #TAB$ + Str(inv_a(Pow(10,e))))\nNext e\nCloseConsole()\n","language":"PureBasic"},{"code":"#!/usr/bin/python\n\ndef a(n):\n n += 2\n return n*(n**2 + 1)/2\n\ndef inv_a(x):\n k = 0\n while k*(k**2+1)/2+2 < x:\n k+=1\n return k\n\n\nif __name__ == '__main__':\n print(\"The first 20 magic constants are:\");\n for n in range(1, 20):\n print(int(a(n)), end = \" \");\n print(\"\\nThe 1,000th magic constant is:\",int(a(1000)));\n\n for e in range(1, 20):\n print(f'10^{e}: {inv_a(10**e)}');\n","language":"Python"},{"code":"$NOPREFIX\n\nDIM order AS INTEGER\nDIM target AS INTEGER64\n\nPRINT \"First 20 magic constants:\"\nFOR i = 3 TO 22\n PRINT USING \"####, \"; MagicSum(i);\n IF i MOD 5 = 2 THEN PRINT\nNEXT i\nPRINT\nPRINT USING \"1000th magic constant: ##########,\"; MagicSum(1002)\nPRINT\nPRINT \"Smallest order magic square with a constant greater than:\"\nFOR i = 1 TO 13 ' 64-bit integers can take us no further, unsigned or not\n target = 10 ^ i\n DO\n order = order + 1\n LOOP UNTIL MagicSum(order) > target\n PRINT USING \"10^**: #####,\"; i; order\n order = order * 2 - 1\nNEXT i\n\nFUNCTION MagicSum&& (n AS INTEGER)\n MagicSum&& = (n * n + 1) / 2 * n\nEND FUNCTION\n","language":"QB64"},{"code":"FUNCTION a (n)\n n = n + 2\n a = n * (n ^ 2 + 1) / 2\nEND FUNCTION\n\nFUNCTION inva (x)\n k = 0\n WHILE k * (k ^ 2 + 1) / 2 + 2 < x\n k = k + 1\n WEND\n inva = k\nEND FUNCTION\n\nPRINT \"The first 20 magic constants are: \";\nFOR n = 1 TO 20\n PRINT a(n); \" \";\nNEXT n\nPRINT\nPRINT \"The 1,000th magic constant is \"; a(1000)\nPRINT\nFOR e = 1 TO 20\n PRINT USING \"10^##: #########\"; e; inva(10 ^ e)\nNEXT e\nEND\n","language":"QBasic"},{"code":" [ 3 + dup 3 ** + 2 / ] is magicconstant ( n --> n )\n\n 20 times [ i^ magicconstant echo sp ] cr cr\n\n 1000 magicconstant echo cr cr\n\n 0 1\n [ over magicconstant over > if\n [ over 3 + echo cr\n 10 * ]\n dip 1+\n [ 10 21 ** ] constant\n over = until ]\n 2drop\n","language":"Quackery"},{"code":"use Lingua::EN::Numbers:ver<2.8+>;\n\nmy @magic-constants = lazy (3..∞).hyper.map: { (1 + .²) * $_ / 2 };\n\nput \"First 20 magic constants: \", @magic-constants[^20]».,\nsay \"1000th magic constant: \", @magic-constants[999].,\nsay \"\\nSmallest order magic square with a constant greater than:\";\n\n(1..20).map: -> $p {printf \"10%-2s: %s\\n\", $p.&super, comma 3 + @magic-constants.first( * > exp($p, 10), :k ) }\n","language":"Raku"},{"code":"func f(n) {\n (n+2) * ((n+2)**2 + 1) / 2\n}\n\nfunc order(n) {\n iroot(2*n, 3) + 1\n}\n\nsay (\"First 20 terms: \", f.map(1..20).join(' '))\nsay (\"1000th term: \", f(1000), \" with order \", order(f(1000)))\n\nfor n in (1 .. 20) {\n printf(\"order(10^%-2s) = %s\\n\", n, order(10**n))\n}\n","language":"Sidef"},{"code":"FUNCTION a(n)\n LET n = n + 2\n LET a = n*(n^2 + 1)/2\nEND FUNCTION\n\nFUNCTION inv_a(x)\n LET k = 0\n DO WHILE k*(k^2+1)/2+2 < x\n LET k = k + 1\n LOOP\n LET inv_a = k\nEND FUNCTION\n\nPRINT \"The first 20 magic constants are: \";\nFOR n = 1 TO 20\n PRINT a(n);\" \";\nNEXT n\nPRINT\nPRINT \"The 1,000th magic constant is \"; a(1000)\n\nFOR e = 1 TO 20\n PRINT USING \"10^##\": e;\n PRINT USING\": #########\": inv_a(10^e)\nNEXT e\nEND\n","language":"True-BASIC"},{"code":"import \"./seq\" for Lst\nimport \"./fmt\" for Fmt\n\nvar magicConstant = Fn.new { |n| (n*n + 1) * n / 2 }\n\nvar ss = [\"\\u2070\", \"\\u00b9\", \"\\u00b2\", \"\\u00b3\", \"\\u2074\",\n \"\\u2075\", \"\\u2076\", \"\\u2077\", \"\\u2078\", \"\\u2079\"]\n\nvar superscript = Fn.new { |n| (n < 10) ? ss[n] : (n < 20) ? ss[1] + ss[n - 10] : ss[2] + ss[0] }\n\nSystem.print(\"First 20 magic constants:\")\nvar mc20 = (3..22).map { |n| magicConstant.call(n) }.toList\nfor (chunk in Lst.chunks(mc20, 10)) Fmt.print(\"$5d\", chunk)\n\nFmt.print(\"\\n1,000th magic constant: $,d\", magicConstant.call(1002))\n\nSystem.print(\"\\nSmallest order magic square with a constant greater than:\")\nfor (i in 1..20) {\n var goal = 10.pow(i)\n var order = (goal * 2).cbrt.floor + 1\n Fmt.print(\"10$-2s : $,9d\", superscript.call(i), order)\n}\n","language":"Wren"},{"code":"int N, X;\nreal M, Thresh, MC;\n[Text(0, \"First 20 magic constants:^M^J\");\nfor N:= 3 to 20+3-1 do\n [IntOut(0, (N*N*N+N)/2); ChOut(0, ^ )];\nCrLf(0);\nText(0, \"1000th magic constant: \");\nN:= 1000+3-1;\nIntOut(0, (N*N*N+N)/2);\nCrLf(0);\nText(0, \"Smallest order magic square with a constant greater than:^M^J\");\nThresh:= 10.;\nM:= 3.;\nFormat(1, 0);\nfor X:= 1 to 10 do\n [repeat MC:= (M*M*M+M)/2.;\n M:= M+1.;\n until MC > Thresh;\n Text(0, \"10^^\");\n if X < 10 then ChOut(0, ^0);\n IntOut(0, X);\n Text(0, \": \");\n RlOut(0, M-1.);\n CrLf(0);\n Thresh:= Thresh*10.;\n ];\n]\n","language":"XPL0"},{"code":"sub a(n)\n n = n + 2\n return n*(n^2 + 1)/2\nend sub\n\nsub inv_a(x)\n k = 0\n while k*(k^2+1)/2+2 < x\n k = k + 1\n wend\n return k\nend sub\n\nprint \"The first 20 magic constants are: \"\nfor n = 1 to 20\n print a(n), \" \";\nnext n\nprint \"\\nThe 1,000th magic constant is \", a(1000), \"\\n\"\n\nfor e = 1 to 20\n print \"10^\", e using\"##\", \": \", inv_a(10^e) using \"#########\"\nnext e\nend\n","language":"Yabasic"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Magic_constant\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"A magic square is a square grid containing consecutive integers from 1 to N², arranged so that every row, column and diagonal adds up to the same number. That number is a constant. There is no way to create a valid N x N magic square that does not sum to the associated constant. \\n\\n;EG\\n\\nA 3 x 3 magic square ''always'' sums to 15. \\n\\n<pre style=\\\"font-family: consolas, inconsolata, monospace; line-height: normal;\\\"> ┌───┬───┬───┐\\n │ 2 │ 7 │ 6 │\\n ├───┼───┼───┤\\n │ 9 │ 5 │ 1 │\\n ├───┼───┼───┤\\n │ 4 │ 3 │ 8 │\\n └───┴───┴───┘</pre>\\n\\nA 4 x 4 magic square ''always'' sums to 34.\\n\\nTraditionally, the sequence leaves off terms for n = 0 and n = 1 as the magic squares of order 0 and 1 are trivial; and a term for n = 2 because it is impossible to form a magic square of order 2.\\n\\n\\n;Task\\n\\n* Starting at order 3, show the first 20 magic constants.\\n* Show the 1000th magic constant. (Order 1003)\\n* Find and show the order of the smallest N x N magic square whose constant is greater than 10¹ through 10¹⁰.\\n\\n\\n;Stretch\\n\\n* Find and show the order of the smallest N x N magic square whose constant is greater than 10¹¹ through 10²⁰.\\n\\n\\n;See also\\n\\n* [[wp:Magic_constant|Wikipedia: Magic constant]]\\n* [[oeis:A006003|OEIS: A006003]] (Similar sequence, though it includes terms for 0, 1 & 2.)\\n* [[Magic squares of odd order]]\\n* [[Magic squares of singly even order]]\\n* [[Magic squares of doubly even order]]\\n\\n\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F a(=n)\\n n += 2\\n R n * (n ^ 2 + 1) / 2\\n\\nF inv_a(x)\\n V k = 0\\n L k * (k ^ 2.0 + 1) / 2 + 2 < x\\n k++\\n R k\\n\\nprint(‘The first 20 magic constants are:’)\\nL(n) 1..19\\n print(Int(a(n)), end' ‘ ’)\\nprint(\\\"\\\\nThe 1,000th magic constant is: \\\"Int(a(1000)))\\n\\nL(e) 1..19\\n print(‘10^’e‘: ’inv_a(10.0 ^ e))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"BEGIN # find some magic constants - the row, column and diagonal sums of a magin square #\\n # translation of the Free Basic sample with the Julia/Wren inverse function #\\n # returns the magic constant of a magic square of order n + 2 #\\n PROC a = ( INT n )LONG LONG INT:\\n BEGIN\\n LONG LONG INT n2 = n + 2;\\n ( n2 * ( ( n2 * n2 ) + 1 ) ) OVER 2\\n END # a # ;\\n # returns the order of the magic square whose magic constant is at least x #\\n PROC inv a = ( LONG LONG INT x )LONG LONG INT:\\n ENTIER long long exp( long long ln( x * 2 ) / 3 ) + 1;\\n\\n print( ( \\\"The first 20 magic constants are \\\" ) );\\n FOR n TO 20 DO\\n print( ( whole( a( n ), 0 ), \\\" \\\" ) )\\n OD;\\n print( ( newline ) );\\n print( ( \\\"The 1,000th magic constant is \\\", whole( a( 1000 ), 0 ), newline ) );\\n LONG LONG INT e := 1;\\n FOR n TO 20 DO\\n e *:= 10;\\n print( ( \\\"10^\\\", whole( n, -2 ), \\\": \\\", whole( inv a( e ), -9 ), newline ) )\\n OD\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"a: function [n][\\n n: n+2\\n return (n*(1 + n^2))/2\\n]\\n\\naInv: function [x][\\n k: new 0\\n while [x > 2 + k*(1+k^2)/2]\\n -> inc 'k\\n return k\\n]\\nprint \\\"The first 20 magic constants are:\\\"\\nprint map 1..19 => a\\n\\nprint \\\"\\\"\\nprint \\\"The 1,000th magic constant is:\\\"\\nprint a 1000\\n\\nprint \\\"\\\"\\nloop 1..19 'z ->\\n print [\\\"10 ^\\\" z \\\"=>\\\" aInv 10^z]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"# syntax: GAWK -f MAGIC_CONSTANT.AWK\\n# converted from FreeBASIC\\nBEGIN {\\n printf(\\\"The first 20 magic constants are:\\\")\\n for (i=1; i<=20; i++) {\\n printf(\\\" %d\\\",a(i))\\n }\\n printf(\\\"\\\\n\\\")\\n printf(\\\"The 1,000th magic constant is: %d\\\\n\\\",a(1000))\\n for (i=1; i<=20; i++) {\\n printf(\\\"10^%02d: %8d\\\\n\\\",i,inv_a(10^i))\\n }\\n exit(0)\\n}\\nfunction a(n) {\\n n += 2\\n return(n*(n^2+1)/2)\\n}\\nfunction inv_a(x, k) {\\n while (k*(k^2+1)/2+2 < x) {\\n k++\\n }\\n return(k)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"function a(n)\\n\\tn = n + 2\\n\\treturn n*(n^2 + 1)/2\\nend function\\n\\nfunction inv_a(x)\\n\\tk = 0\\n\\twhile k*(k^2+1)/2+2 < x\\n\\t\\tk += 1\\n\\tend while\\n\\treturn k\\nend function\\n\\nprint \\\"The first 20 magic constants are:\\\"\\nfor n = 1 to 20\\n\\tprint int(a(n));\\\" \\\";\\nnext n\\nprint : print\\nprint \\\"The 1,000th magic constant is \\\"; int(a(1000)); chr(10)\\n\\nfor e = 1 to 20\\n\\tprint \\\"10^\\\"; e; \\\": \\\"; chr(9); inv_a(10^e)\\nnext e\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"#include <cmath>\\n#include <cstdint>\\n#include <iomanip>\\n#include <iostream>\\n#include <string>\\n\\nconstexpr int32_t ORDER_FIRST_MAGIC_SQUARE = 3;\\nconstexpr double LN2 = log(2.0);\\nconstexpr double LN10 = log(10.0);\\n\\n// Return the magic constant for a magic square of the given order\\nint32_t magicConstant(int32_t n) {\\n\\treturn n * ( n * n + 1 ) / 2;\\n}\\n\\n// Return the smallest order of a magic square such that its magic constant is greater than 10 to the given power\\nint32_t minimumOrder(int32_t n) {\\n\\treturn (int) exp( ( LN2 + n * LN10 ) / 3 ) + 1;\\n}\\n\\n// Return the order of the magic square at the given index\\nint32_t order(int32_t index) {\\n\\treturn ORDER_FIRST_MAGIC_SQUARE + index - 1;\\n}\\n\\nint main() {\\n\\tstd::cout << \\\"The first 20 magic constants:\\\" << std::endl;\\n\\tfor ( int32_t i = 1; i <= 20; ++i ) {\\n\\t\\tstd::cout << \\\" \\\" << magicConstant(order(i));\\n\\t}\\n\\tstd::cout << std::endl << std::endl;\\n\\n\\tstd::cout << \\\"The 1,000th magic constant: \\\" << magicConstant(order(1'000)) << std::endl << std::endl;\\n\\n\\tstd::cout << \\\"Order of the smallest magic square whose constant is greater than:\\\" << std::endl;\\n\\tfor ( int32_t i = 1; i <= 20; ++i ) {\\n\\t\\tstd::string power_of_10 = \\\"10^\\\" + std::to_string(i) + \\\":\\\";\\n\\t\\tstd::cout << std::setw(6) << power_of_10 << std::setw(8) << minimumOrder(i) << std::endl;\\n\\t}\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\npublic class MagicConstant {\\n\\n private const int OrderFirstMagicSquare = 3;\\n\\n public static void Main(string[] args) {\\n Console.WriteLine(\\\"The first 20 magic constants:\\\");\\n for (int i = 1; i <= 20; i++) {\\n Console.Write(\\\" \\\" + MagicConstantValue(Order(i)));\\n }\\n Console.WriteLine(\\\"\\\\n\\\");\\n\\n Console.WriteLine(\\\"The 1,000th magic constant: \\\" + MagicConstantValue(Order(1_000)) + \\\"\\\\n\\\");\\n\\n Console.WriteLine(\\\"Order of the smallest magic square whose constant is greater than:\\\");\\n for (int i = 1; i <= 20; i++) {\\n string powerOf10 = \\\"10^\\\" + i + \\\":\\\";\\n Console.WriteLine($\\\"{powerOf10,6}{MinimumOrder(i),8}\\\");\\n }\\n }\\n\\n // Return the magic constant for a magic square of the given order\\n private static int MagicConstantValue(int n) {\\n return n * (n * n + 1) / 2;\\n }\\n\\n // Return the smallest order of a magic square such that its magic constant is greater than 10 to the given power\\n private static int MinimumOrder(int n) {\\n return (int)Math.Exp((Math.Log(2.0)+ n * Math.Log(10.0)) / 3) + 1;\\n }\\n\\n // Return the order of the magic square at the given index\\n private static int Order(int index) {\\n return OrderFirstMagicSquare + index - 1;\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"function GetMagicNumber(N: double): double;\\nbegin\\nResult:=N * (((N * N) + 1) / 2);\\nend;\\n\\nfunction GetNumberLess(N: double): integer;\\nvar M: double;\\nbegin\\nfor Result:=1 to High(Integer) do\\n\\tbegin\\n\\tM:=GetMagicNumber(Result);\\n\\tif M>N then break;\\n\\tend;\\nend;\\n\\nprocedure ShowMagicNumber(Memo: TMemo);\\nvar I,J: integer;\\nvar N,M: double;\\nvar S: string;\\nbegin\\nS:='';\\nfor I:=3 to 23 do\\n\\tbegin\\n\\tS:=S+Format('%8.0n',[GetMagicNumber(I)]);\\n\\tif (I mod 5)=2 then S:=S+#$0D#$0A;\\n\\tend;\\nMemo.Lines.Add(S);\\nMemo.Lines.Add('');\\nMemo.Lines.Add('1000th: '+Format('%8.0n',[GetMagicNumber(1002)]));\\nMemo.Lines.Add('');\\nN:=10;\\nfor I:=1 to 20 do\\n\\tbegin\\n\\tJ:=GetNumberLess(N);\\n\\tMemo.Lines.Add('M^'+Format('%d%8d',[I,J]));\\n\\tN:=N * 10;\\n\\tend;\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"func a n .\\n n += 2\\n return n * (n * n + 1) / 2\\n.\\nfunc inva x .\\n while k * (k * k + 1) / 2 + 2 < x\\n k += 1\\n .\\n return k\\n.\\nwrite \\\"The first 20 magic constants: \\\"\\nfor n to 20\\n write a n & \\\" \\\"\\n.\\nprint \\\"\\\"\\nprint \\\"\\\"\\nprint \\\"The 1,000th magic constant: \\\" & a 1000\\nprint \\\"\\\"\\nprint \\\"Smallest magic square with constant greater than:\\\"\\nfor e to 10\\n print \\\"10^\\\" & e & \\\": \\\" & inva pow 10 e\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"USING: formatting io kernel math math.functions.integer-logs\\nmath.ranges prettyprint sequences ;\\n\\n: magic ( m -- n ) dup sq 1 + 2 / * ;\\n\\n\\\"First 20 magic constants:\\\" print\\n3 22 [a,b] [ bl ] [ magic pprint ] interleave nl\\nnl\\n\\\"1000th magic constant: \\\" write 1002 magic .\\nnl\\n\\\"Smallest order magic square with a constant greater than:\\\" print\\n1 0 20 [\\n [ 10 * ] dip\\n [ dup magic pick < ] [ 1 + ] while\\n over integer-log10 over \\\"10^%02d: %d\\\\n\\\" printf\\n dup + 1 -\\n] times 2drop\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"program MagicConst;\\n{$IFDEF FPC}{$MODE DELPHI}{$OPTIMIZATION ON,ALL}{$ENDIF}\\n{$IFDEF WINDOWS}{$APPTYPE CONSOLE}{$ENDIF}\\n\\nfunction MagicSum(n :Uint32):Uint64; inline;\\nvar\\n k : Uint64;\\nbegin\\n k := n*Uint64(n);\\n result := (k*k+k) DIV 2;\\nend;\\n\\nfunction MagSumPerRow(n:Uint32):Uint32;\\nbegin\\n//result := MagicSum(n) DIV n;\\n //(n^3 + n) /2\\n result := ((Uint64(n)*n+1)*n) DIV 2;\\nend;\\nvar\\n s : String[31];\\n i : Uint32;\\n lmt,rowcnt : extended;\\nBegin\\n writeln('First Magic constants 3..20');\\n For i := 3 to 20 do\\n write(MagSumPerRow(i),' ');\\n writeln;\\n writeln('1000.th ',MagSumPerRow(1002));\\n\\n writeln('First Magic constants > 10^xx');\\n //lmt = (rowcnt^3 + rowcnt) /2 -> rowcnt > (lmt*2 )^(1/3)\\n lmt := 2.0 * 10.0;\\n For i := 1 to 50 do\\n begin\\n rowcnt := Int(exp(ln(lmt)/3))+1.0;//+1 suffices\\n str(trunc(rowcnt),s);\\n writeln('10^',i:2,#9,s:18);\\n f := 10.0*lmt;\\n end;\\nend.\\n\",\n \"language\": \"Free-Pascal-Lazarus\"\n },\n {\n \"code\": \"function a(byval n as uinteger) as ulongint\\n n+=2\\n return n*(n^2 + 1)/2\\nend function\\n\\nfunction inv_a(x as double) as ulongint\\n dim as ulongint k = 0\\n while k*(k^2+1)/2+2 < x\\n k+=1\\n wend\\n return k\\nend function\\n\\ndim as ulongint n\\nprint \\\"The first 20 magic constants are \\\":\\nfor n = 1 to 20\\n print a(n);\\\" \\\";\\nnext n\\nprint\\nprint \\\"The 1,000th magic constant is \\\";a(1000)\\n\\nfor e as uinteger = 1 to 20\\n print using \\\"10^##: #########\\\";e;inv_a(10^cast(double,e))\\nnext e\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n \\\"rcu\\\"\\n)\\n\\nfunc magicConstant(n int) int {\\n return (n*n + 1) * n / 2\\n}\\n\\nvar ss = []string{\\n \\\"\\\\u2070\\\", \\\"\\\\u00b9\\\", \\\"\\\\u00b2\\\", \\\"\\\\u00b3\\\", \\\"\\\\u2074\\\",\\n \\\"\\\\u2075\\\", \\\"\\\\u2076\\\", \\\"\\\\u2077\\\", \\\"\\\\u2078\\\", \\\"\\\\u2079\\\",\\n}\\n\\nfunc superscript(n int) string {\\n if n < 10 {\\n return ss[n]\\n }\\n if n < 20 {\\n return ss[1] + ss[n-10]\\n }\\n return ss[2] + ss[0]\\n}\\n\\nfunc main() {\\n fmt.Println(\\\"First 20 magic constants:\\\")\\n for n := 3; n <= 22; n++ {\\n fmt.Printf(\\\"%5d \\\", magicConstant(n))\\n if (n-2)%10 == 0 {\\n fmt.Println()\\n }\\n }\\n\\n fmt.Println(\\\"\\\\n1,000th magic constant:\\\", rcu.Commatize(magicConstant(1002)))\\n\\n fmt.Println(\\\"\\\\nSmallest order magic square with a constant greater than:\\\")\\n for i := 1; i <= 20; i++ {\\n goal := math.Pow(10, float64(i))\\n order := int(math.Cbrt(goal*2)) + 1\\n fmt.Printf(\\\"10%-2s : %9s\\\\n\\\", superscript(i), rcu.Commatize(order))\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"mgc=: 0 0.5 0 0.5&p.\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" mgc 3+i.20\\n15 34 65 111 175 260 369 505 671 870 1105 1379 1695 2056 2465 2925 3439 4010 4641 5335\\n mgc 1003x\\n504514015\\n (#\\\\,.],.mgc) x:(mgc i.3000) I.10^1+i.10\\n 1 3 15\\n 2 6 111\\n 3 13 1105\\n 4 28 10990\\n 5 59 102719\\n 6 126 1000251\\n 7 272 10061960\\n 8 585 100101105\\n 9 1260 1000188630\\n10 2715 10006439295\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" ((10+#\\\\),.],.mgc) x:(mgc i.6e6) I.10^11+i.10\\n11 5849 100049490449\\n12 12600 1000188006300\\n13 27145 10000910550385\\n14 58481 100003310078561\\n15 125993 1000021311323825\\n16 271442 10000026341777165\\n17 584804 100000232056567634\\n18 1259922 1000002262299152685\\n19 2714418 10000004237431278525\\n20 5848036 100000026858987459346\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public final class MagicConstant {\\n\\n\\tpublic static void main(String[] aArgs) {\\n\\t\\tSystem.out.println(\\\"The first 20 magic constants:\\\");\\n\\t\\tfor ( int i = 1; i <= 20; i++ ) {\\n\\t\\t\\tSystem.out.print(\\\" \\\" + magicConstant(order(i)));\\n\\t\\t}\\n\\t\\tSystem.out.println(System.lineSeparator());\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"The 1,000th magic constant: \\\" + magicConstant(order(1_000)) + System.lineSeparator());\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"Order of the smallest magic square whose constant is greater than:\\\");\\n\\t\\tfor ( int i = 1; i <= 20; i++ ) {\\n\\t\\t\\tString powerOf10 = \\\"10^\\\" + i + \\\":\\\";\\n\\t\\t\\tSystem.out.println(String.format(\\\"%6s%8s\\\", powerOf10, minimumOrder(i)));\\n\\t\\t}\\n\\t}\\n\\t\\n\\t// Return the magic constant for a magic square of the given order\\n\\tprivate static int magicConstant(int aN) {\\t\\n\\t\\treturn aN * ( aN * aN + 1 ) / 2;\\n\\t}\\n\\n\\t// Return the smallest order of a magic square such that its magic constant is greater than 10 to the given power\\n\\tprivate static int minimumOrder(int aN) {\\t\\t\\n\\t\\treturn (int) Math.exp( ( LN2 + aN * LN10 ) / 3 ) + 1;\\n\\t}\\n\\t\\n\\t// Return the order of the magic square at the given index\\n\\tprivate static int order(int aIndex) {\\n\\t\\treturn ORDER_FIRST_MAGIC_SQUARE + aIndex - 1;\\n\\t}\\n\\t\\n private static final int ORDER_FIRST_MAGIC_SQUARE = 3;\\n\\tprivate static final double LN2 = Math.log(2.0);\\n\\tprivate static final double LN10 = Math.log(10.0);\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# To take advantage of gojq's arbitrary-precision integer arithmetic:\\ndef power($b): . as $in | reduce range(0;$b) as $i (1; . * $in);\\n\\n# nth-root\\ndef iroot($n):\\n . as $in\\n | if $n == 1 then .\\n else (. < 0) as $neg\\n | if $neg and (n % 2) == 0\\n then \\\"Cannot take the \\\\($n)th root of a negative number.\\\" | error\\n else ($n-1) as $n\\n | {t: (if $neg then -. else . end)}\\n | .s = .t + 1\\n | .u = .t\\n | until (.u >= .s;\\n .s = .u\\n | .u = ((.u * $n) + (.t / (.u|power($n)))) / ($n + 1) )\\n | if $neg then - .s else .s end\\n end\\n end;\\n\\n# input: an array\\n# output: a stream of arrays of size size except possibly for the last array\\ndef group(size):\\n recurse( .[size:]; length>0) | .[0:size];\\n\\ndef lpad($len): tostring | ($len - length) as $l | (\\\" \\\" * $l)[:$l] + .;\\n\\ndef ss : [\\\"\\\\u2070\\\", \\\"\\\\u00b9\\\", \\\"\\\\u00b2\\\", \\\"\\\\u00b3\\\", \\\"\\\\u2074\\\",\\n \\\"\\\\u2075\\\", \\\"\\\\u2076\\\", \\\"\\\\u2077\\\", \\\"\\\\u2078\\\", \\\"\\\\u2079\\\"];\\n\\ndef superscript:\\n if . < 10 then ss[.]\\n elif . < 20 then ss[1] + ss[. - 10]\\n else ss[2] + ss[0]\\n end;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def magicConstant: (.*. + 1) * . / 2;\\n\\n\\\"First 20 magic constants:\\\",\\n ([range(3;23)\\n | magicConstant]\\n | group(10) | map(lpad(5)) | join(\\\" \\\")),\\n \\\"\\\",\\n \\\"1,000th magic constant: \\\\( 1002| magicConstant)\\\",\\n \\\"\\\",\\n \\\"Smallest order magic square with a constant greater than:\\\",\\n (range(1; 21) as $i\\n | (10 | power($i)) as $goal\\n | ((($goal * 2)|iroot(3) + 1) | floor) as $order\\n | (\\\"10\\\\($i|superscript)\\\" | lpad(5)) + \\\": \\\\($order|lpad(9))\\\" )\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Lazy\\n\\nmagic(x) = (1 + x^2) * x ÷ 2\\nmagics = @>> Lazy.range() map(magic) filter(x -> x > 10) # first 2 values are filtered out\\nprintln(\\\"First 20 magic constants: \\\", Int.(take(20, magics)))\\nprintln(\\\"Thousandth magic constant is: \\\", collect(take(1000, magics))[end])\\n\\nprintln(\\\"Smallest magic square with constant greater than:\\\")\\nfor expo in 1:20\\n goal = big\\\"10\\\"^expo\\n ordr = Int(floor((2 * goal)^(1/3))) + 1\\n println(\\\"10^\\\", string(expo, pad=2), \\\" \\\", ordr)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"function magic (x)\\n return x * (1 + x^2) / 2\\nend\\n\\nprint(\\\"Magic constants of orders 3 to 22:\\\")\\nfor i = 3, 22 do\\n io.write(magic(i) .. \\\" \\\")\\nend\\n\\nprint(\\\"\\\\n\\\\nMagic constant 1003: \\\" .. magic(1003) .. \\\"\\\\n\\\")\\n\\nprint(\\\"Orders of smallest magic constant greater than...\\\")\\nprint(\\\"-----\\\\t-----\\\\nValue\\\\tOrder\\\\n-----\\\\t-----\\\")\\nlocal order = 1\\nfor i = 1, 20 do\\n repeat\\n order = order + 1\\n until magic(order) > 10 ^ i\\n print(\\\"10^\\\" .. i, order)\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"ClearAll[i, n, MagicSumHelper, MagicSum, InverseMagicSum]\\nMagicSumHelper[n_] = Sum[i, {i, n^2}]/n;\\nMagicSum[n_] := MagicSumHelper[n + 2]\\nInverseMagicSum[lim_] := Ceiling[-(1/(3^(1/3) (9 lim + Sqrt[3] Sqrt[1 + 27 lim^2])^(1/3))) + (9 lim + Sqrt[3] Sqrt[1 + 27 lim^2])^(1/3)/3^(2/3)]\\n\\nMagicSum /@ Range[20]\\nMagicSum[1000]\\n\\nexps = Range[1, 50];\\nnums = 10^exps;\\nTranspose[{Superscript[10, #] & /@ exps, InverseMagicSum[nums]}] // Grid\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import std/[math, unicode]\\n\\nfunc magicConstant(n: int): int =\\n ## Return the magic constant for a magic square of order \\\"n\\\".\\n n * (n * n + 1) div 2\\n\\nfunc minOrder(n: int): int =\\n ## Return the smallest order such as the magic constant is greater than \\\"10^n\\\".\\n const Ln2 = ln(2.0)\\n const Ln10 = ln(10.0)\\n result = int(exp((Ln2 + n.toFloat * Ln10) / 3)) + 1\\n\\nconst First = 3\\nconst Superscripts: array['0'..'9', string] = [\\\"⁰\\\", \\\"¹\\\", \\\"²\\\", \\\"³\\\", \\\"⁴\\\", \\\"⁵\\\", \\\"⁶\\\", \\\"⁷\\\", \\\"⁸\\\", \\\"⁹\\\"]\\n\\ntemplate order(idx: Positive): int =\\n ## Compute the order of the magic square at index \\\"idx\\\".\\n idx + (First - 1)\\n\\nfunc superscript(n: Natural): string =\\n ## Return the Unicode string to use to represent an exponent.\\n for d in $n:\\n result.add(Superscripts[d])\\n\\necho \\\"First 20 magic constants:\\\"\\nfor idx in 1..20:\\n stdout.write ' ', order(idx).magicConstant\\necho()\\n\\necho \\\"\\\\n1000th magic constant: \\\", order(1000).magicConstant\\n\\necho \\\"\\\\nOrder of the smallest magic square whose constant is greater than:\\\"\\nfor n in 1..20:\\n let left = \\\"10\\\" & n.superscript & ':'\\n echo left.alignLeft(6), ($minOrder(n)).align(7)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\n\\nuse strict; # https://rosettacode.org/wiki/Magic_constant\\nuse warnings;\\n\\nmy @twenty = map $_ * ( $_ ** 2 + 1 ) / 2, 3 .. 22;\\nprint \\\"first twenty: @twenty\\\\n\\\\n\\\" =~ s/.{50}\\\\K /\\\\n/gr;\\n\\nmy $thousandth = 1002 * ( 1002 ** 2 + 1 ) / 2;\\nprint \\\"thousandth: $thousandth\\\\n\\\\n\\\";\\n\\nprint \\\"10**N order\\\\n\\\";\\nfor my $i ( 1 .. 20 )\\n {\\n printf \\\"%3d %9d\\\\n\\\", $i, (10 ** $i * 2) ** ( 1 / 3 ) + 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\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">magic</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">nth</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">order</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">nth</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">order</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;\\\">order</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</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 magic constants: %V\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">apply</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><span style=\\\"color: #000000;\\\">magic</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;\\\">\\\"1000th magic constant: %,d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">magic</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1000</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\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">goal</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">order</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;\\\">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: #000000;\\\">20</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_ui_pow_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">goal</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_mul_si</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">goal</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_nthroot</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add_si</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</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;\\\">\\\"1e%d: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">mpz_get_str</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</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;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"m(X,Y):- Y is X*(X*X+1)/2.\\n\\nl(L,R,T,X):- L > R -> X is L; M is div(L+R,2), m(M,F),\\n (T < F -> R_ is M-1, l(L,R_,T,X); L_ is M+1, l(L_,R,T,X)).\\nl(B,X):- l(1,B,B,X).\\n\\ntask:-\\n write(\\\"First 20 magic constants are:\\\"), forall(between(3,22,N), (m(N,X), format(\\\" ~d\\\",X))), nl,\\n write(\\\"The 1000th magic constant is:\\\"), forall(m(1002,X), format(\\\" ~d\\\",X)), nl,\\n forall(between(1,20,N), (l(10**N,X), format(\\\"10^~d:\\\\t~d\\\\n\\\",[N,X]))).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Procedure.i a(n.i)\\n n + 2\\n ProcedureReturn n*(Pow(n,2) + 1)/2\\nEndProcedure\\n\\nProcedure.i inv_a(x.i)\\n k.i = 0\\n While k*(Pow(k,2)+1)/2+2 < x\\n k + 1\\n Wend\\n ProcedureReturn k\\nEndProcedure\\n\\nOpenConsole()\\nPrintN(\\\"The first 20 magic constants are:\\\")\\nFor n.i = 1 To 20\\n Print(Str(a(n)) + \\\" \\\")\\nNext n\\nPrintN(\\\"\\\") : PrintN(\\\"\\\")\\nPrintN(\\\"The 1,000th magic constant is \\\" + Str(a(1000)))\\n\\nFor e.i = 1 To 20\\n PrintN(\\\"10^\\\" + Str(e) + \\\": \\\" + #TAB$ + Str(inv_a(Pow(10,e))))\\nNext e\\nCloseConsole()\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"#!/usr/bin/python\\n\\ndef a(n):\\n n += 2\\n return n*(n**2 + 1)/2\\n\\ndef inv_a(x):\\n k = 0\\n while k*(k**2+1)/2+2 < x:\\n k+=1\\n return k\\n\\n\\nif __name__ == '__main__':\\n print(\\\"The first 20 magic constants are:\\\");\\n for n in range(1, 20):\\n print(int(a(n)), end = \\\" \\\");\\n print(\\\"\\\\nThe 1,000th magic constant is:\\\",int(a(1000)));\\n\\n for e in range(1, 20):\\n print(f'10^{e}: {inv_a(10**e)}');\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"$NOPREFIX\\n\\nDIM order AS INTEGER\\nDIM target AS INTEGER64\\n\\nPRINT \\\"First 20 magic constants:\\\"\\nFOR i = 3 TO 22\\n PRINT USING \\\"####, \\\"; MagicSum(i);\\n IF i MOD 5 = 2 THEN PRINT\\nNEXT i\\nPRINT\\nPRINT USING \\\"1000th magic constant: ##########,\\\"; MagicSum(1002)\\nPRINT\\nPRINT \\\"Smallest order magic square with a constant greater than:\\\"\\nFOR i = 1 TO 13 ' 64-bit integers can take us no further, unsigned or not\\n target = 10 ^ i\\n DO\\n order = order + 1\\n LOOP UNTIL MagicSum(order) > target\\n PRINT USING \\\"10^**: #####,\\\"; i; order\\n order = order * 2 - 1\\nNEXT i\\n\\nFUNCTION MagicSum&& (n AS INTEGER)\\n MagicSum&& = (n * n + 1) / 2 * n\\nEND FUNCTION\\n\",\n \"language\": \"QB64\"\n },\n {\n \"code\": \"FUNCTION a (n)\\n n = n + 2\\n a = n * (n ^ 2 + 1) / 2\\nEND FUNCTION\\n\\nFUNCTION inva (x)\\n k = 0\\n WHILE k * (k ^ 2 + 1) / 2 + 2 < x\\n k = k + 1\\n WEND\\n inva = k\\nEND FUNCTION\\n\\nPRINT \\\"The first 20 magic constants are: \\\";\\nFOR n = 1 TO 20\\n PRINT a(n); \\\" \\\";\\nNEXT n\\nPRINT\\nPRINT \\\"The 1,000th magic constant is \\\"; a(1000)\\nPRINT\\nFOR e = 1 TO 20\\n PRINT USING \\\"10^##: #########\\\"; e; inva(10 ^ e)\\nNEXT e\\nEND\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \" [ 3 + dup 3 ** + 2 / ] is magicconstant ( n --> n )\\n\\n 20 times [ i^ magicconstant echo sp ] cr cr\\n\\n 1000 magicconstant echo cr cr\\n\\n 0 1\\n [ over magicconstant over > if\\n [ over 3 + echo cr\\n 10 * ]\\n dip 1+\\n [ 10 21 ** ] constant\\n over = until ]\\n 2drop\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"use Lingua::EN::Numbers:ver<2.8+>;\\n\\nmy @magic-constants = lazy (3..∞).hyper.map: { (1 + .²) * $_ / 2 };\\n\\nput \\\"First 20 magic constants: \\\", @magic-constants[^20]».,\\nsay \\\"1000th magic constant: \\\", @magic-constants[999].,\\nsay \\\"\\\\nSmallest order magic square with a constant greater than:\\\";\\n\\n(1..20).map: -> $p {printf \\\"10%-2s: %s\\\\n\\\", $p.&super, comma 3 + @magic-constants.first( * > exp($p, 10), :k ) }\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"func f(n) {\\n (n+2) * ((n+2)**2 + 1) / 2\\n}\\n\\nfunc order(n) {\\n iroot(2*n, 3) + 1\\n}\\n\\nsay (\\\"First 20 terms: \\\", f.map(1..20).join(' '))\\nsay (\\\"1000th term: \\\", f(1000), \\\" with order \\\", order(f(1000)))\\n\\nfor n in (1 .. 20) {\\n printf(\\\"order(10^%-2s) = %s\\\\n\\\", n, order(10**n))\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"FUNCTION a(n)\\n LET n = n + 2\\n LET a = n*(n^2 + 1)/2\\nEND FUNCTION\\n\\nFUNCTION inv_a(x)\\n LET k = 0\\n DO WHILE k*(k^2+1)/2+2 < x\\n LET k = k + 1\\n LOOP\\n LET inv_a = k\\nEND FUNCTION\\n\\nPRINT \\\"The first 20 magic constants are: \\\";\\nFOR n = 1 TO 20\\n PRINT a(n);\\\" \\\";\\nNEXT n\\nPRINT\\nPRINT \\\"The 1,000th magic constant is \\\"; a(1000)\\n\\nFOR e = 1 TO 20\\n PRINT USING \\\"10^##\\\": e;\\n PRINT USING\\\": #########\\\": inv_a(10^e)\\nNEXT e\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"import \\\"./seq\\\" for Lst\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar magicConstant = Fn.new { |n| (n*n + 1) * n / 2 }\\n\\nvar ss = [\\\"\\\\u2070\\\", \\\"\\\\u00b9\\\", \\\"\\\\u00b2\\\", \\\"\\\\u00b3\\\", \\\"\\\\u2074\\\",\\n \\\"\\\\u2075\\\", \\\"\\\\u2076\\\", \\\"\\\\u2077\\\", \\\"\\\\u2078\\\", \\\"\\\\u2079\\\"]\\n\\nvar superscript = Fn.new { |n| (n < 10) ? ss[n] : (n < 20) ? ss[1] + ss[n - 10] : ss[2] + ss[0] }\\n\\nSystem.print(\\\"First 20 magic constants:\\\")\\nvar mc20 = (3..22).map { |n| magicConstant.call(n) }.toList\\nfor (chunk in Lst.chunks(mc20, 10)) Fmt.print(\\\"$5d\\\", chunk)\\n\\nFmt.print(\\\"\\\\n1,000th magic constant: $,d\\\", magicConstant.call(1002))\\n\\nSystem.print(\\\"\\\\nSmallest order magic square with a constant greater than:\\\")\\nfor (i in 1..20) {\\n var goal = 10.pow(i)\\n var order = (goal * 2).cbrt.floor + 1\\n Fmt.print(\\\"10$-2s : $,9d\\\", superscript.call(i), order)\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"int N, X;\\nreal M, Thresh, MC;\\n[Text(0, \\\"First 20 magic constants:^M^J\\\");\\nfor N:= 3 to 20+3-1 do\\n [IntOut(0, (N*N*N+N)/2); ChOut(0, ^ )];\\nCrLf(0);\\nText(0, \\\"1000th magic constant: \\\");\\nN:= 1000+3-1;\\nIntOut(0, (N*N*N+N)/2);\\nCrLf(0);\\nText(0, \\\"Smallest order magic square with a constant greater than:^M^J\\\");\\nThresh:= 10.;\\nM:= 3.;\\nFormat(1, 0);\\nfor X:= 1 to 10 do\\n [repeat MC:= (M*M*M+M)/2.;\\n M:= M+1.;\\n until MC > Thresh;\\n Text(0, \\\"10^^\\\");\\n if X < 10 then ChOut(0, ^0);\\n IntOut(0, X);\\n Text(0, \\\": \\\");\\n RlOut(0, M-1.);\\n CrLf(0);\\n Thresh:= Thresh*10.;\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"sub a(n)\\n n = n + 2\\n return n*(n^2 + 1)/2\\nend sub\\n\\nsub inv_a(x)\\n k = 0\\n while k*(k^2+1)/2+2 < x\\n k = k + 1\\n wend\\n return k\\nend sub\\n\\nprint \\\"The first 20 magic constants are: \\\"\\nfor n = 1 to 20\\n print a(n), \\\" \\\";\\nnext n\\nprint \\\"\\\\nThe 1,000th magic constant is \\\", a(1000), \\\"\\\\n\\\"\\n\\nfor e = 1 to 20\\n print \\\"10^\\\", e using\\\"##\\\", \\\": \\\", inv_a(10^e) using \\\"#########\\\"\\nnext e\\nend\\n\",\n \"language\": \"Yabasic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Magic-constant"}}},{"rowIdx":462,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Magic_squares_of_odd_order\n","language":"00-META"},{"code":"A magic square is an <big>'''NxN'''</big> square matrix whose numbers (usually integers) consist of consecutive numbers arranged so that the sum of each row and column, ''and'' both long (main) diagonals are equal to the same sum (which is called the ''magic number'' or ''magic constant''). \n\nThe numbers are usually (but not always) the first '''N'''<sup>2</sup> positive integers.\n\nA magic square whose rows and columns add up to a magic number but whose main diagonals do not, is known as a ''semimagic square''.\n\n{| class=\"wikitable\" style=\"float:right;border: 4px solid blue; background:lightgreen; color:black; margin-left:auto;margin-right:auto;text-align:center;width:15em;height:15em;table-layout:fixed;font-size:150%\"\n|-\n| <big><big>'''8'''</big></big> || <big><big>'''1'''</big></big> || <big><big>'''6'''</big></big>\n|-\n| <big><big>'''3'''</big></big> || <big><big>'''5'''</big></big> || <big><big>'''7'''</big></big>\n|-\n| <big><big>'''4'''</big></big> || <big><big>'''9'''</big></big> || <big><big>'''2'''</big></big>\n|}\n\n\n;Task\nFor any odd '''N''', [[wp:Magic square#Method_for_constructing_a_magic_square_of_odd_order|generate a magic square]] with the integers ''' 1''' ──► '''N''', and show the results here. \n\nOptionally, show the ''magic number''. \n\nYou should demonstrate the generator by showing at least a magic square for '''N''' = '''5'''.\n\n\n; Related tasks\n* [[Magic squares of singly even order]]\n* [[Magic squares of doubly even order]]<br><br>\n\n\n; See also:\n* MathWorld™ entry: [http://mathworld.wolfram.com/MagicSquare.html Magic_square] \n* [http://www.1728.org/magicsq1.htm Odd Magic Squares (1728.org)]\n<br><br>\n\n","language":"00-TASK"},{"code":"F magic(n)\n L(row) 1..n\n print(((1..n).map(col -> @n * ((@row + col - 1 + @n I/ 2) % @n)\n + ((@row + 2 * col - 2) % @n) + 1)).map(cell -> String(cell).rjust(String(@n ^ 2).len)).join(‘ ’))\n print(\"\\nAll sum to magic number #.\".format((n * n + 1) * n I/ 2))\n\nL(n) (5, 3, 7)\n print(\"\\nOrder #.\\n=======\".format(n))\n magic(n)\n","language":"11l"},{"code":"* Magic squares of odd order - 20/10/2015\nMAGICS CSECT\n USING MAGICS,R15 set base register\n LA R6,1 i=1\nLOOPI C R6,N do i=1 to n\n BH ELOOPI\n LR R8,R6 i\n SLA R8,1 i*2\n LA R9,PG pgi=@pg\n LA R7,1 j=1\nLOOPJ C R7,N do j=1 to n\n BH ELOOPJ\n LR R5,R8 i*2\n SR R5,R7 -j\n A R5,N +n\n BCTR R5,0 -1\n XR R4,R4 clear high reg\n D R4,N /n\n LR R5,R4 //n\n M R4,N *n\n LR R2,R5 (i*2-j+n-1)//n*n\n LR R5,R8 i*2\n AR R5,R7 -j\n S R5,=F'2' -2\n XR R4,R4 clear high reg\n D R4,N /n\n AR R2,R4 +(i*2+j-2)//n\n LA R2,1(R2) +1\n XDECO R2,PG+80 (i*2-j+n-1)//n*n+(i*2+j-2)//n+1\n MVC 0(5,R9),PG+87 put in buffer\n LA R9,5(R9) pgi=pgi+5\n LA R7,1(R7) j=j+1\n B LOOPJ\nELOOPJ XPRNT PG,80\n LA R6,1(R6) i=i+1\n B LOOPI\nELOOPI XR R15,R15 set return code\n BR R14 return to caller\nN DC F'9' <== input\nPG DC CL92' ' buffer\n YREGS\n END MAGICS\n","language":"360-Assembly"},{"code":"with Ada.Text_IO, Ada.Command_Line;\n\nprocedure Magic_Square is\n N: constant Positive := Positive'Value(Ada.Command_Line.Argument(1));\n\n subtype Constants is Natural range 1 .. N*N;\n package CIO is new Ada.Text_IO.Integer_IO(Constants);\n Undef: constant Natural := 0;\n\n subtype Index is Natural range 0 .. N-1;\n function Inc(I: Index) return Index is (if I = N-1 then 0 else I+1);\n function Dec(I: Index) return Index is (if I = 0 then N-1 else I-1);\n\n A: array(Index, Index) of Natural := (others => (others => Undef));\n -- initially undefined; at the end holding the magic square\n\n X: Index := 0; Y: Index := N/2; -- start position for the algorithm\nbegin\n for I in Constants loop -- write 1, 2, ..., N*N into the magic array\n A(X, Y) := I; -- write I into the magic array\n if A(Dec(X), Inc(Y)) = Undef then\n\t X := Dec(X); Y := Inc(Y); -- go right-up\n else\n\t X := Inc(X); -- go down\n end if;\n end loop;\n\n for Row in Index loop -- output the magic array\n for Collumn in Index loop\n\t CIO.Put(A(Row, Collumn),\n\t\t Width => (if N*N < 10 then 2 elsif N*N < 100 then 3 else 4));\n end loop;\n Ada.Text_IO.New_Line;\n end loop;\nend Magic_Square;\n","language":"Ada"},{"code":"# construct a magic square of odd order #\nPROC magic square = ( INT order ) [,]INT:\n IF NOT ODD order OR order < 1\n THEN\n # can't make a magic square of the specified order #\n LOC [ 1 : 0, 1 : 0 ]INT\n ELSE\n # order is OK - construct the square using de la Loubère's #\n # algorithm as in the wikipedia page #\n\n [ 1 : order, 1 : order ]INT square;\n FOR i TO order DO FOR j TO order DO square[ i, j ] := 0 OD OD;\n\n # as square [ 1, 1 ] if the top-left, moving \"up\" reduces the row #\n # operator to advance \"up\" the square #\n OP PREV = ( INT pos )INT: IF pos = 1 THEN order ELSE pos - 1 FI;\n # operator to advance \"across right\" or \"down\" the square #\n OP NEXT = ( INT pos )INT: ( pos MOD order ) + 1;\n\n # fill in the square, starting from the middle of the top row #\n INT col := ( order + 1 ) OVER 2;\n INT row := 1;\n FOR i TO order * order DO\n square[ row, col ] := i;\n IF square[ PREV row, NEXT col ] /= 0\n THEN\n # the up/right position is already taken, move down #\n row := NEXT row\n ELSE\n # can move up and right #\n row := PREV row;\n col := NEXT col\n FI\n OD;\n\n square\n FI # magic square # ;\n\n# prints the magic square #\nPROC print square = ( [,]INT square )VOID:\n BEGIN\n INT order = 1 UPB square;\n # calculate print width: negative so a leading \"+\" is not printed #\n INT width := -1;\n INT mag := order * order;\n WHILE mag >= 10 DO mag OVERAB 10; width MINUSAB 1 OD;\n # calculate the \"magic sum\" #\n INT sum := 0;\n FOR i TO order DO sum +:= square[ 1, i ] OD;\n # print the square #\n print( ( \"maqic square of order \", whole( order, 0 ), \": sum: \", whole( sum, 0 ), newline ) );\n FOR i TO order DO\n FOR j TO order DO write( ( \" \", whole( square[ i, j ], width ) ) ) OD;\n write( ( newline ) )\n OD\n END # print square # ;\n\n# test the magic square generation #\nFOR order BY 2 TO 7 DO print square( magic square( order ) ) OD\n","language":"ALGOL-68"},{"code":"begin\n % construct a magic square of odd order - as a procedure can't return an %\n % array, the caller must supply one that is big enough %\n logical procedure magicSquare( integer array square ( *, * )\n ; integer value order\n ) ;\n if not odd( order ) or order < 1 then begin\n % can't make a magic square of the specified order %\n false\n end\n else begin\n % order is OK - construct the square using de la Loubère's %\n % algorithm as in the wikipedia page %\n\n % ensure a row/col position is on the square %\n integer procedure inSquare( integer value pos ) ;\n if pos < 1 then order else if pos > order then 1 else pos;\n % move \"up\" a row in the square %\n integer procedure up ( integer value row ) ; inSquare( row - 1 );\n % move \"accross right\" in the square %\n integer procedure right( integer value col ) ; inSquare( col + 1 );\n\n integer row, col;\n % initialise square %\n for i := 1 until order do for j := 1 until order do square( i, j ) := 0;\n\n % initial position is the middle of the top row %\n col := ( order + 1 ) div 2;\n row := 1;\n % construct square %\n for i := 1 until ( order * order ) do begin\n square( row, col ) := i;\n if square( up( row ), right( col ) ) not = 0 then begin\n % the up/right position is already taken, move down %\n row := row + 1;\n end\n else begin\n % can move up/right %\n row := up( row );\n col := right( col );\n end\n end for_i;\n % sucessful result %\n true\n end magicSquare ;\n\n % prints the magic square %\n procedure printSquare( integer array square ( *, * )\n ; integer value order\n ) ;\n begin\n integer sum, w;\n\n % set integer width to accomodate the largest number in the square %\n w := ( order * order ) div 10;\n i_w := s_w := 1;\n while w > 0 do begin i_w := i_w + 1; w := w div 10 end;\n\n for i := 1 until order do sum := sum + square( 1, i );\n write( \"maqic square of order \", order, \": sum: \", sum );\n for i := 1 until order do begin\n write( square( i, 1 ) );\n for j := 2 until order do writeon( square( i, j ) )\n end for_i\n\n end printSquare ;\n\n % test the magic square generation %\n\n integer array sq ( 1 :: 11, 1 :: 11 );\n\n for i := 1, 3, 5, 7 do begin\n if magicSquare( sq, i ) then printSquare( sq, i )\n else write( \"can't generate square\" );\n end for_i\n\nend.\n","language":"ALGOL-W"},{"code":"magic←{⍵{+/1,(1 ⍺⍺)×⍺(⍺⍺|1+⊢+2×⊣)⍵,⍺⍺-⍵+1}/¨⎕IO-⍨⍳⍵ ⍵}\n","language":"APL"},{"code":"---------------- MAGIC SQUARE OF ODD ORDER ---------------\n\n-- oddMagicSquare :: Int -> [[Int]]\non oddMagicSquare(n)\n if 0 < (n mod 2) then\n cycleRows(transpose(cycleRows(table(n))))\n else\n missing value\n end if\nend oddMagicSquare\n\n\n--------------------------- TEST -------------------------\non run\n -- Orders 3, 5, 11\n\n -- wikiTableMagic :: Int -> String\n script wikiTableMagic\n on |λ|(n)\n formattedTable(oddMagicSquare(n))\n end |λ|\n end script\n\n intercalate(linefeed & linefeed, map(wikiTableMagic, {3, 5, 11}))\nend run\n\n-- table :: Int -> [[Int]]\non table(n)\n set lstTop to enumFromTo(1, n)\n\n script cols\n on |λ|(row)\n script rows\n on |λ|(x)\n (row * n) + x\n end |λ|\n end script\n\n map(rows, lstTop)\n end |λ|\n end script\n\n map(cols, enumFromTo(0, n - 1))\nend table\n\n-- cycleRows :: [[a]] -> [[a]]\non cycleRows(lst)\n script rotationRow\n -- rotatedList :: [a] -> Int -> [a]\n on rotatedList(lst, n)\n if n = 0 then return lst\n\n set lng to length of lst\n set m to (n + lng) mod lng\n items -m thru -1 of lst & items 1 thru (lng - m) of lst\n end rotatedList\n\n on |λ|(row, i)\n rotatedList(row, (((length of row) + 1) div 2) - (i))\n end |λ|\n end script\n\n map(rotationRow, lst)\nend cycleRows\n\n\n-------------------- GENERIC FUNCTIONS -------------------\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-- 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-- 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-- enumFromTo :: Int -> Int -> [Int]\non enumFromTo(m, n)\n if m > n then\n set d to -1\n else\n set d to 1\n end if\n set lst to {}\n repeat with i from m to n by d\n set end of lst to i\n end repeat\n return lst\nend enumFromTo\n\n-- splitOn :: Text -> Text -> [Text]\non splitOn(strDelim, strMain)\n set {dlm, my text item delimiters} to {my text item delimiters, strDelim}\n set xs to text items of strMain\n set my text item delimiters to dlm\n return xs\nend splitOn\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\n----------------------- WIKI DISPLAY ---------------------\n\n-- formattedTable :: [[Int]] -> String\non formattedTable(lstTable)\n set n to length of lstTable\n set w to 2.5 * n\n \"magic(\" & n & \")\" & linefeed & linefeed & wikiTable(lstTable, ¬\n false, \"text-align:center;width:\" & ¬\n w & \"em;height:\" & w & \"em;table-layout:fixed;\")\nend formattedTable\n\n-- wikiTable :: [Text] -> Bool -> Text -> Text\non wikiTable(xs, blnHdr, strStyle)\n script wikiRows\n on |λ|(lstRow, iRow)\n set strDelim to cond(blnHdr and (iRow = 0), \"!\", \"|\")\n set strDbl to strDelim & strDelim\n linefeed & \"|-\" & linefeed & strDelim & space & ¬\n intercalate(space & strDbl & space, lstRow)\n end |λ|\n end script\n\n linefeed & \"{| class=\\\"wikitable\\\" \" & ¬\n cond(strStyle ≠ \"\", \"style=\\\"\" & strStyle & \"\\\"\", \"\") & ¬\n intercalate(\"\", ¬\n map(wikiRows, xs)) & linefeed & \"|}\" & linefeed\nend wikiTable\n\n-- cond :: Bool -> a -> a -> a\non cond(bool, f, g)\n if bool then\n f\n else\n g\n end if\nend cond\n","language":"AppleScript"},{"code":" 100 :\n 110 REM MAGIC SQUARE OF ODD ORDER\n 120 :\n 130 DEF FN MOD(A) = A - INT (A / N) * N\n 140 DEF FN NR(J) = FN MOD((J + 2 * I + 1))\n 200 INPUT \"ENTER N: \";N\n 210 IF N < 3 OR (N - INT (N / 2) * 2) = 0 GOTO 200\n 220 FOR I = 0 TO (N - 1)\n 230 FOR J = 0 TO (N - 1): HTAB 4 * (J + 1)\n 240 PRINT N * FN NR(N - J - 1) + FN NR(J) + 1;\n 250 NEXT J: PRINT\n 260 NEXT I\n 270 PRINT \"MAGIC CONSTANT: \";N * (N * N + 1) / 2\n","language":"Applesoft-BASIC"},{"code":"oddMagicSquare: function [n][\n ensure -> and? odd? n\n n >= 0\n\n map 1..n 'i [\n map 1..n 'j [\n (n * ((i + (j - 1) + n / 2) % n)) +\n (((i - 2) + 2 * j) % n) + 1\n ]\n ]\n]\n\nloop [3 5 7] 'n [\n print [\"Size:\" n \", Magic sum:\" n*(1+n*n)/2 \"\\n\"]\n loop oddMagicSquare n 'row [\n loop row 'item [\n prints pad to :string item 3\n ]\n print \"\"\n ]\n print \"\"\n]\n","language":"Arturo"},{"code":"msgbox % OddMagicSquare(5)\nmsgbox % OddMagicSquare(7)\nreturn\n\nOddMagicSquare(oddN){\n\tsq := oddN**2\n\tobj := {}\n\tloop % oddN\n\t\tobj[A_Index] := {} \t; dis is row\n\tmid := Round((oddN+1)/2)\n\tsum := Round(sq*(sq+1)/2/oddN)\n\tobj[1][mid] := 1\n\tcR := 1 , cC := mid\n\tloop % sq-1\n\t{\n\t\tdone := 0 , a := A_index+1\n\t\twhile !done {\n\t\t\tnR := cR-1 , nC := cC+1\n\t\t\tif !nR\n\t\t\t\tnR := oddN\n\t\t\tif (nC>oddN)\n\t\t\t\tnC := 1\n\t\t\tif obj[nR][nC] \t;filled\n\t\t\t\tcR += 1\n\t\t\telse cR := nR , cC := nC\n\t\t\tif !obj[cR][cC]\n\t\t\t\tobj[cR][cC] := a , done := 1\n\t\t}\n\t}\n\n\tstr := \"Magic Constant for \" oddN \"x\" oddN \" is \" sum \"`n\"\n\tfor k,v in obj\n\t{\n\t\tfor k2,v2 in v\n\t\t\tstr .= \" \" v2\n\t\tstr .= \"`n\"\n\t}\n\treturn str\n}\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f MAGIC_SQUARES_OF_ODD_ORDER.AWK\nBEGIN {\n build(5)\n build(3,1) # verify sum\n build(7)\n exit(0)\n}\nfunction build(n,check, arr,i,width,x,y) {\n if (n !~ /^[0-9]*[13579]$/ || n < 3) {\n printf(\"error: %s is invalid\\n\",n)\n return\n }\n printf(\"\\nmagic constant for %dx%d is %d\\n\",n,n,(n*n+1)*n/2)\n x = 0\n y = int(n/2)\n for (i=1; i<=(n*n); i++) {\n arr[x,y] = i\n if (arr[(x+n-1)%n,(y+n+1)%n]) {\n x = (x+n+1) % n\n }\n else {\n x = (x+n-1) % n\n y = (y+n+1) % n\n }\n }\n width = length(n*n)\n for (x=0; x<n; x++) {\n for (y=0; y<n; y++) {\n printf(\"%*s \",width,arr[x,y])\n }\n printf(\"\\n\")\n }\n if (check) { verify(arr,n) }\n}\nfunction verify(arr,n, total,x,y) { # verify sum of each row, column and diagonal\n print(\"\\nverify\")\n# horizontal\n for (x=0; x<n; x++) {\n total = 0\n for (y=0; y<n; y++) {\n printf(\"%d \",arr[x,y])\n total += arr[x,y]\n }\n printf(\"\\t: %d row %d\\n\",total,x+1)\n }\n# vertical\n for (y=0; y<n; y++) {\n total = 0\n for (x=0; x<n; x++) {\n printf(\"%d \",arr[x,y])\n total += arr[x,y]\n }\n printf(\"\\t: %d column %d\\n\",total,y+1)\n }\n# left diagonal\n total = 0\n for (x=y=0; x<n; x++ y++) {\n printf(\"%d \",arr[x,y])\n total += arr[x,y]\n }\n printf(\"\\t: %d diagonal top left to bottom right\\n\",total)\n# right diagonal\n x = n - 1\n total = 0\n for (y=0; y<n; y++ x--) {\n printf(\"%d \",arr[x,y])\n total += arr[x,y]\n }\n printf(\"\\t: %d diagonal bottom left to top right\\n\",total)\n}\n","language":"AWK"},{"code":"arraybase 1\nglobal m\n\ncall magicSquare(5)\ncall magicSquare(17)\nend\n\nsubroutine magicSquare(n)\n\tredim m(n,n)\n\tinc = 1\n\tcont = 1\n\trow = 1\n\tcol = (n+1) / 2\n\twhile cont <= n*n\n\t\tm[row,col] = cont\n\t\tcont += 1\n\t\tif inc < n then\n\t\t\tinc += 1\n\t\t\trow -= 1\n\t\t\tcol += 1\n\t\t\tif row <> 0 then\n\t\t\t\tif col > n then col = 1\n\t\t\telse\n\t\t\t\trow = n\n\t\t\tend if\n\t\telse\n\t\t\tinc = 1\n\t\t\trow += 1\n\t\tend if\n\tend while\n\tcall printSquare(n)\nend subroutine\n\nsubroutine printSquare(n)\n\t#Arbitrary limit to fit width of A4 paper\n\tif n < 23 then\n\t\tprint\n\t\tprint n; \" x \"; n; \" Magic Square --- \";\n\t\tprint \"Magic constant is \"; int((n*n+1)/2*n)\n\t\tfor row = 1 to n\n\t\t\tfor col = 1 to n\n\t\t\t\tprint rjust(string(m[row,col]),4);\n\t\t\tnext col\n\t\t\tprint\n\t\tnext row\n\telse\n\t\tprint \"Magic Square will not fit on one sheet of paper.\"\n\tend if\nend subroutine\n","language":"BASIC256"},{"code":"@echo off\nrem Magic squares of odd order\nsetlocal EnableDelayedExpansion\nset n=9\necho The square order is: %n%\nfor /l %%i in (1,1,%n%) do (\n set w=\n for /l %%j in (1,1,%n%) do (\n set /a v1=%%i*2-%%j+n-1\n set /a v1=v1%%n*n\n set /a v2=%%i*2+%%j+n-2\n set /a v2=v2%%n\n set /a v=v1+v2+1\n\t\tset v= !v!\n\t set w=!w!!v:~-5!)\n\techo !w!)\nset /a w=n*(n*n+1)/2\necho The magic number is: %w%\npause\n","language":"Batch-File"},{"code":"define magic_constant(n) {\n return(((n * n + 1) / 2) * n)\n}\n\ndefine print_magic_square(n) {\n auto i, x, col, row, len, old_scale\n\n old_scale = scale\n scale = 0\n len = length(n * n)\n\n print \"Magic constant for n=\", n, \": \", magic_constant(n), \"\\n\"\n for (row = 1; row <= n; row++) {\n for (col = 1; col <= n; col++) {\n x = n * ((row + col - 1 + (n / 2)) % n) + \\\n ((row + 2 * col - 2) % n) + 1\n for (i = 0; i < len - length(x); i++) {\n print \" \"\n }\n print x\n if (col != n) print \" \"\n }\n print \"\\n\"\n }\n\n scale = old_scale\n}\n\ntemp = print_magic_square(5)\n","language":"Bc"},{"code":"get \"libhdr\"\n\nlet cell(n, x, y) = f(n, n-x-1, y)*n + f(n, x, y) + 1\nand f(n, x, y) = (x + y*2 + 1) rem n\n\nlet magic(n) be\n$( writef(\"Magic square of order %N with constant %N:*N\", n, (n*n+1)/2*n)\n for y = 0 to n-1\n $( for x = 0 to n-1 do writed(cell(n, x, y), 4)\n wrch('*N')\n $)\n wrch('*N')\n$)\n\nlet start() be for n = 1 to 7 by 2 do magic(n)\n","language":"BCPL"},{"code":"500p0>:::00g%00g\\-1-\\00g/2*+1+00g%00g*\\:00g%v\n@<$<_^#!-*:g00:,+9!%g00:+1.+1+%g00+1+*2/g00\\<\n","language":"Befunge"},{"code":"Magic ← {𝕏{+´1∾1‿𝕗×𝕨(𝕗|1+⊢+2×⊣)𝕩∾𝕗-𝕩+1}´¨↕2⥊𝕩}\nMagic¨ ⟨1,3,5,7⟩\n","language":"BQN"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n\nint f(int n, int x, int y)\n{\n\treturn (x + y*2 + 1)%n;\n}\n\nint main(int argc, char **argv)\n{\n\tint i, j, n;\n\n\t//Edit: Add argument checking\n\tif(argc!=2) return 1;\n\n\t//Edit: Input must be odd and not less than 3.\n\tn = atoi(argv[1]);\n\tif (n < 3 || (n%2) == 0) return 2;\n\n\tfor (i = 0; i < n; i++) {\n\t\tfor (j = 0; j < n; j++)\n\t\t\tprintf(\"% 4d\", f(n, n - j - 1, i)*n + f(n, j, i) + 1);\n\t\tputchar('\\n');\n\t}\n\tprintf(\"\\n Magic Constant: %d.\\n\", (n*n+1)/2*n);\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <cassert>\n#include <vector>\nusing namespace std;\n\nclass MagicSquare\n{\npublic:\n MagicSquare(int d) : sqr(d*d,0), sz(d)\n {\n assert(d&1);\n fillSqr();\n }\n\n void display()\n {\n cout << \"Odd Magic Square: \" << sz << \" x \" << sz << \"\\n\";\n cout << \"It's Magic Sum is: \" << magicNumber() << \"\\n\\n\";\n ostringstream cvr;\n cvr << sz * sz;\n int l = cvr.str().size();\n\n\tfor( int y = 0; y < sz; y++ )\n\t{\n\t int yy = y * sz;\n\t for( int x = 0; x < sz; x++ )\n\t\tcout << setw( l + 2 ) << sqr[yy + x];\n\t cout << \"\\n\";\n\t}\n cout << \"\\n\\n\";\n }\n\nprivate:\n void fillSqr()\n {\n\tint sx = sz / 2, sy = 0, c = 0;\n\twhile( c < sz * sz )\n\t{\n\t if( !sqr[sx + sy * sz] )\n\t {\n\t\tsqr[sx + sy * sz]= c + 1;\n\t\tinc( sx ); dec( sy );\n\t\tc++;\n\t }\n\t else\n\t {\n\t\tdec( sx ); inc( sy ); inc( sy );\n\t }\n\t}\n }\n\n int magicNumber()\n { return sz * ( ( sz * sz ) + 1 ) / 2; }\n\n void inc( int& a )\n { if( ++a == sz ) a = 0; }\n\n void dec( int& a )\n { if( --a < 0 ) a = sz - 1; }\n\n bool checkPos( int x, int y )\n { return( isInside( x ) && isInside( y ) && !sqr[sz * y + x] ); }\n\n bool isInside( int s )\n { return ( s < sz && s > -1 ); }\n\n vector<int> sqr;\n int sz;\n};\n\nint main()\n{\n MagicSquare s(7);\n s.display();\n return 0;\n}\n","language":"C++"},{"code":"100 cls\n110 sub magicsq(size,filename$ = \"\")\n120 if (size and 1) = 0 or size < 3 then\n130 print\n140 print \"error: size is not odd or size is smaller then 3\"\n160 exit sub\n170 endif\n180 ' filename$ <> \"\" then save magic square in a file\n190 ' filename$ can contain directory name\n200 ' if filename$ exist it will be overwriten, no error checking\n210 dim sq(size,size)' array to hold square\n220 ' start in the middle of the first row\n230 nr = 1\n240 x = size-int(size/2)\n250 y = 1\n260 max = size*size\n270 ' create format string for using\n280 for c = 1 to len(str$(max))+1 : frmt$ = frmt$+\"#\" : next c\n290 'main loop for creating magic square\n300 do\n310 if sq(x,y) = 0 then\n320 sq(x,y) = nr\n330 if nr mod size = 0 then\n340 y = y+1\n350 else\n360 x = x+1\n370 y = y-1\n380 endif\n390 nr = nr+1\n400 endif\n410 if x > size then\n420 x = 1\n430 do while sq(x,y) <> 0\n440 x = x+1\n450 loop\n460 endif\n470 if y < 1 then\n480 y = size\n490 do while sq(x,y) <> 0\n500 y = y-1\n510 loop\n520 endif\n530 loop until nr > max\n540 ' printing square's bigger than 19 result in a wrapping of the line\n550 print \"Odd magic square size: \";size;\"*\";size\n560 print \"The magic sum = \";int((max+1)/2)*size\n570 print\n580 for y = 1 to size\n590 for x = 1 to size\n600 print using \"####\";val(sq(x,y));\n610 next x\n620 print\n630 next y\n640 print\n650 ' output magic square to a file with the name provided\n660 if filename$ <> \"\" then\n670 nr = freefile\n680 open filename$ for output as #1\n690 print #1,\"Odd magic square size: \";size;\"*\";size\n700 print #1,\"The magic sum = \";int((max+1)/2)*size\n710 print #1,\n720 for y = 1 to size\n730 for x = 1 to size\n740 print #1,using frmt$;sq(x,y);\n750 next x\n760 print #1,\n770 next y\n780 endif\n790 close #1\n800 end sub\n810 input \"Enter N: \",number\n820 magicsq(number)\n830 end\n","language":"Chipmunk-Basic"},{"code":"magic_square = cluster is create, unparse, magic_number\n rep = array[array[int]]\n\n create = proc (order: int) returns (cvt) signals (invalid)\n if order<1 cor order//2 = 0 then signal invalid end\n sq: rep := rep$fill_copy(1, order, array[int]$fill(1, order, 0))\n x: int := (order+1)/2\n y: int := 1\n\n for i: int in int$from_to(1, order**2) do\n sq[y][x] := i\n next_x: int := inc(sq,x)\n next_y: int := dec(sq,y)\n if sq[next_y][next_x]=0\n then x, y := next_x, next_y\n else y := inc(sq,y)\n end\n end\n return(sq)\n end create\n\n inc = proc (sq: rep, co: int) returns (int)\n order: int := rep$size(sq)\n if co=order then return(1) else return(co+1) end\n end inc\n\n dec = proc (sq: rep, co: int) returns (int)\n order: int := rep$size(sq)\n if co=1 then return(order) else return(co-1) end\n end dec\n\n unparse = proc (sq: cvt) returns (string)\n order: int := rep$size(sq)\n col_size: int := string$size(int$unparse(order ** 2)) + 1\n ss: stream := stream$create_output()\n for y: int in int$from_to(1, order) do\n for x: int in int$from_to(1, order) do\n stream$putright(ss, int$unparse(sq[y][x]), col_size)\n end\n stream$putl(ss, \"\")\n end\n return(stream$get_contents(ss))\n end unparse\n\n magic_number = proc (sq: cvt) returns (int)\n order: int := rep$size(sq)\n n: int := 0\n for x: int in int$from_to(1, order) do n := n + sq[1][x] end\n return(n)\n end magic_number\nend magic_square\n\n\nprint_magic_square = proc (order: int)\n po: stream := stream$primary_output()\n ms: magic_square := magic_square$create(order)\n stream$putl(po, \"Magic square of order \"\n || int$unparse(order)\n || \" with magic number \"\n || int$unparse(magic_square$magic_number(ms))\n || \": \")\n stream$putl(po, magic_square$unparse(ms))\nend print_magic_square\n\nstart_up = proc ()\n for n: int in int$from_to_by(1, 7, 2) do\n print_magic_square(n)\n end\nend start_up\n","language":"CLU"},{"code":"(defun magic-square (n)\n (loop for i from 1 to n\n collect\n (loop for j from 1 to n\n collect\n (+ (* n (mod (+ i j (floor n 2) -1)\n n))\n (mod (+ i (* 2 j) -2)\n n)\n 1))))\n\n(defun magic-constant (n)\n (* n\n (/ (1+ (* n n))\n 2)))\n\n(defun output (n)\n (format T \"Magic constant for n=~a: ~a~%\" n (magic-constant n))\n (let* ((size (length (write-to-string (* n n))))\n (format-str (format NIL \"~~{~~{~~~ad~~^ ~~}~~%~~}~~%\" size)))\n (format T format-str (magic-square n))))\n","language":"Common-Lisp"},{"code":"include \"cowgol.coh\";\n\nsub magic(n: uint16) is\n sub f(x: uint16, y: uint16): (r: uint16) is\n r := (x + y*2 + 1) % n;\n end sub;\n\n sub cell(x: uint16, y: uint16): (c: uint16) is\n c := f(n-x-1, y)*n + f(x, y) + 1;\n end sub;\n\n var y: uint16 := 0;\n while y < n loop\n var x: uint16 := 0;\n loop\n print_i16(cell(x, y));\n x := x + 1;\n if x == n then\n print_nl();\n break;\n else\n print_char('\\t');\n end if;\n end loop;\n y := y + 1;\n end loop;\n print_nl();\nend sub;\n\nvar n: uint16 := 1;\nwhile n <= 7 loop\n print(\"Magic square of order \");\n print_i16(n);\n print(\" with constant \");\n print_i16((n*n+1)/2*n);\n print(\":\\n\");\n magic(n);\n n := n + 2;\nend loop;\n","language":"Cowgol"},{"code":"void main(in string[] args)\n{\n import std.stdio, std.conv, std.range, std.algorithm, std.exception;\n\n immutable n = args.length == 2 ? args[1].to!uint : 5;\n enforce(n > 0 && n % 2 == 1, \"Only odd n > 1\");\n immutable len = text(n ^^ 2).length.text;\n // writeln(len);\n\n foreach (immutable r; 1 .. n + 1)\n {\n foreach (immutable c; 1 .. n + 1)\n {\n auto a = (n * ((r + c - 1 + (n / 2)) % n)) + ((r + (2 * c) - 2) % n) + 1;\n // n(( I + J - 1 + ( n / 2 ) ) mod n ) + (( I + 2J - 2 ) mod n ) + 1\n// writeln(\"n = \",n, \" r = \",r,\" c = \",c, \" a = \",a );\n writef(\"%\" ~ len ~ \"d%s\",a, \" \");\n }\n writeln(\"\");\n }\n ;\n\n writeln(\"\\nMagic constant: \", ((n * n + 1) * n) / 2);\n}}\n","language":"D"},{"code":"import std.stdio, std.conv, std.string, std.range, std.algorithm;\n\nuint[][] magicSquare(immutable uint n) pure nothrow @safe\nin {\n assert(n > 0 && n % 2 == 1);\n} out(mat) {\n // mat is square of the right size.\n assert(mat.length == n);\n assert(mat.all!(row => row.length == n));\n\n immutable magic = mat[0].sum;\n\n // The sum of all rows is the same magic number.\n assert(mat.all!(row => row.sum == magic));\n\n // The sum of all columns is the same magic number.\n //assert(mat.transposed.all!(col => col.sum == magic));\n assert(mat.dup.transposed.all!(col => col.sum == magic));\n\n // The sum of the main diagonals is the same magic number.\n assert(mat.enumerate.map!(ir => ir[1][ir[0]]).sum == magic);\n //assert(mat.enumerate.map!({i, r} => r[i]).sum == magic);\n assert(mat.enumerate.map!(ir => ir[1][ir[0]]).sum == magic);\n} body {\n enum M = (in uint x) pure nothrow @safe @nogc => (x + n - 1) % n;\n auto m = new uint[][](n, n);\n\n uint i = 0;\n uint j = n / 2;\n foreach (immutable uint k; 1 .. n ^^ 2 + 1) {\n m[i][j] = k;\n if (m[M(i)][M(j)]) {\n i = (i + 1) % n;\n } else {\n i = M(i);\n j = M(j);\n }\n }\n\n return m;\n}\n\nvoid showSquare(in uint[][] m)\nin {\n assert(m.all!(row => row.length == m[0].length));\n} body {\n immutable maxLen = text(m.length ^^ 2).length.text;\n writefln(\"%(%(%\" ~ maxLen ~ \"d %)\\n%)\", m);\n writeln(\"\\nMagic constant: \", m[0].sum);\n}\n\nint main(in string[] args) {\n if (args.length == 1) {\n 5.magicSquare.showSquare;\n return 0;\n } else if (args.length == 2) {\n immutable n = args[1].to!uint;\n if (n > 0 && n % 2 == 1) {\n n.magicSquare.showSquare;\n return 0;\n }\n }\n\n stderr.writefln(\"Requires n odd and larger than 0.\");\n return 1;\n}\n","language":"D"},{"code":"proc inc(word n, order) word: if n=order-1 then 0 else n+1 fi corp\nproc dec(word n, order) word: if n=0 then order-1 else n-1 fi corp\n\nproc odd_magic_square([*,*]word square) void:\n word order, x, nx, y, ny, i;\n order := dim(square,1);\n\n for x from 0 upto order-1 do\n for y from 0 upto order-1 do\n square[x,y] := 0\n od\n od;\n\n x := order/2;\n y := 0;\n for i from 1 upto order*order do\n square[x,y] := i;\n nx := inc(x,order);\n ny := dec(y,order);\n if square[nx,ny] = 0 then\n x := nx;\n y := ny\n else\n y := inc(y,order)\n fi\n od\ncorp\n\nproc digit_count(word n) word:\n word count;\n count := 0;\n while n > 0 do\n count := count + 1;\n n := n / 10\n od;\n count\ncorp\n\nproc print_magic_square([*,*]word square) void:\n word order, max, col_size, magic, x, y;\n order := dim(square,1);\n max := order*order;\n col_size := digit_count(max) + 1;\n\n magic := 0;\n for x from 0 upto order-1 do magic := magic + square[x,0] od;\n\n writeln(\"Magic square of order \",order,\" with magic number \",magic,\":\");\n for y from 0 upto order-1 do\n for x from 0 upto order-1 do write(square[x,y]:col_size) od;\n writeln()\n od;\n writeln()\ncorp\n\nproc main() void:\n [1,1]word sq1;\n [3,3]word sq3;\n [5,5]word sq5;\n [7,7]word sq7;\n\n odd_magic_square(sq1);\n odd_magic_square(sq3);\n odd_magic_square(sq5);\n odd_magic_square(sq7);\n\n print_magic_square(sq1);\n print_magic_square(sq3);\n print_magic_square(sq5);\n print_magic_square(sq7)\ncorp\n","language":"Draco"},{"code":"func f n x y .\n return (x + y * 2 + 1) mod n\n.\nnumfmt 0 3\nproc msqr n . .\n for i = 0 to n - 1\n for j = 0 to n - 1\n write f n (n - j - 1) i * n + f n j i + 1\n .\n print \"\"\n .\n.\nmsqr 5\n","language":"EasyLang"},{"code":"(lib 'matrix)\n\n;; compute next i,j = f(move,i,j)\n(define-syntax-rule (path imove jmove)\n(begin (set! i (imove i n)) (set! j (jmove j n))))\n\n;; We define the ordinary and break moves\n;; (1 , -1), (0, 1) King's move\n(define (inext i n) (modulo (1+ i) n))\n(define (jnext j n) (modulo (1- j) n))\n(define (ibreak i n) i)\n(define (jbreak j n) (modulo (1+ j) n))\n\n(define (make-ms n)\n (define n2+1 (1+ (* n n)))\n (define ms (make-array n n))\n (define i (quotient n 2))\n (define j 0)\n (array-set! ms i j 1)\n\n (for ((ns (in-range 2 n2+1)))\n (if (zero? (array-ref ms (inext i n ) (jnext j n )))\n (path inext jnext) ;; ordinary move if empty target\n (path ibreak jbreak)) ;; else break move\n\n (if (zero? (array-ref ms i j))\n (array-set! ms i j ns)\n (error ns \"illegal path\"))\n )\n (writeln 'order n 'magic-number (/ ( * n n2+1) 2))\n (array-print ms))\n","language":"EchoLisp"},{"code":"[Magic squares of odd order, for Rosetta Code.\n EDSAC program, Initial Orders 2.]\n\n[The entries in a magic square of side n can be written as n*u + v + 1,\n where u and v range independently over 0, ..., n - 1.\n Let the cells be labelled by (x, y) coordinates, where\n x = column (left = 0), y = row (bottom = 0).\n If n is odd then magic squares can be constructed by setting\n u = c*x + d*y + h (mod n)\n v = e*x + f*y + k (mod n)\n where c, d, e, f, h, k are suitable constants.\n Define m = (n - 1)/2. The values of c, ..., k for various methods\n of construction are as follows:\n c, d, e, f, h, k\n Bachet: m + 1, m, m + 1, m + 1, m, 0\n De la Loubere: 1, 2m, 2, 2m, m, 0\n Conway (lozenge): 1, 2m, 1, 1, m, m + 1\n Rosetta Code C: 2m, 2m - 1, 1, 2m - 1, 2m - 1, 2m\n------------------------------------------------------------------------------]\n [Arrange the storage]\n T45K P56F [H parameter: subroutine to print string]\n T46K P100F [N parameter: subroutine to print number]\n T47K P200F [M parameter: main routine + high-level subroutine]\n\n[Main routine + non-library subroutine]\n E25K TM GK\n[Rows are printed in the order y = n - 1 (top) to y = 0 (bottom).\n Row y = n is a fictitious row used during initialization.]\n [Locations set up by main routine; some are changed by subroutine]\n [0] PF [m]\n [1] PF [n]\n [2] PF [n^2]\n [3] PF [n * 2^11]\n [4] PF [c, changed to n*(n - c) = dec to n*u on inc(x)]\n [5] PF [d, changed to n*d = dec to n*u on dec(y)]\n [6] PF [e, changed to n - e = dec to v on inc(x)]\n [7] PF [f = dec to v when dec(y)]\n [8] PF [h, changed to n*u for start of current row]\n [9] PF [k, changed to v for start of current row]\n [Locations used only by subroutine]\n [10] PF [n*u]\n [11] PF [v]\n [12] PF [x count]\n [13] PF [y count]\n\n[Subroutine to print magic square, using parameters set up by main routine.]\n [14] A3F T77@ [plant return link as usual]\n A80@ T1F [set to print leading zeros as spaces]\n A1@ S6@ T6@ [replace e by n - e]\n A1@ S4@ T4@ [replace c by n - c]\n [Multiply certain values by n. To maintain the integer scaling,\n products have to be shifted 16 left before storing.]\n H3@ V8@ [acc := (n << 11)*h]\n L8F T8@ [shift 5 more left and store n*h]\n V5@ L8F T5@ [similarly n*d]\n V4@ L8F T4@ [similarly n*(n - c)]\n[Loop round rows y := n - 1 down to 0. At the moment y = n.]\n S1@ T13@ [initialize negative count of rows (y values)]\n [Start of a row. Here acc = 0]\n [36] S1@ T12@ [inititialize negative count of columns (x values)]\n A8@ S5@ [decrement n*u by n*d]\n E42@ [skip if n*u >= 0]\n A2@ [else inc n*u by n^2]\n [42] U8@ [store updated n*u for next time]\n T10@ [also copy to initialize this row]\n A9@ S7@ [decrement v by f]\n E48@ [skip if v >= 0]\n A1@ [else inc v by n]\n [48] U9@ [store updated v at for next time]\n U11@ [also copy to initialize this row]\n [Next column. Here acc = v]\n [50] A10@ A78@ TF [cell value v + n*u + 1 to 0F for printing]\n [53] A53@ GN [call subroutine to print cell value]\n A12@ A78@ [increment negative column count]\n E70@ [jump if row is complete]\n T12@ [else update count]\n A10@ S4@ [dec n*u by n*n - c)]\n E63@ [skip if n*U >= 0]\n A2@ [else inc n*u by n^2]\n [63] T10@ [store updated n*u for next time]\n A11@ S6@ [dec v by n - e]\n E68@ [skip if v >= 0]\n A1@ [else inc v by n]\n [68] U11@ [store updated v, keep v in acc]\n E50@ [loop back for next cell in row]\n[Row finished]\n [70] O81@ O82@ [print CR LF]\n A13@ A78@ [inc negative row count]\n E77@ [exit if done all rows]\n T13@ E36@ [else update count and loop back]\n [77] ZF [(planted) jump back to caller]\n[Constants]\n [78] PD [17-bit 1]\n [79] K4096F [null]\n [80] !F [space]\n [81] @F [carriage return]\n [82] &F [line feed]\n [83] P10F [for testing number of phone pulses]\n[Strings for printing. K2048F sets letters mode; K4096F is EDSAC null.]\n [84] K2048FMFAFGFIFCF!FSFQFUFAFRFEF!FOFFF!FOFRFDFEFRF!F#FWF*FMF#FZFQF@F&FK4096F\n [117] K2048FDFIFAFLF!FMF!F#FKFPF!F*FTFOF!FCFAFNFCFEFLF#FLF@F&FK4096F\n [144] K2048FBFAFCFHFEFTF#FCF@F&FK4096F\n [156] K2048FDFEF!FLFAF!FLFOFUFBFEFRFEF#FCF@F&FK4096F\n [175] K2048FCFOFNFWFAFYF#FCF@F&FK4096F\n [187] K2048FRFOFSFEFTFTFAF!FCFOFDFEF!FCF#FCF@F&FK4096F\n\n[Enter with acc = 0]\n [207] A207@ GH A84@ [print heading]\n [210] A210@ GH A117@ [prompt user to dial m, where n = 2m + 1]\n ZF [halt program; restarts when user dials]\n[Here acc holds number of pulses in address field.\n Number of pulses = 10 if user dialled '0', else = number that user dialled.]\n S83@ E292@ [test for '0', jump to exit if so]\n A83@ [restore acc after test]\n L512F [shift m to top 5 bits for printing]\n UF [temp to 0F]\n OF O81@ O82@ [print digit m, plus CR LF]\n R512F [restore m in address field, same as 2m right-justified]\n A78@ U1@ [make and store n = 2m + 1, right justified]\n RD T@ [make and store m right-justified]\n A1@ L512F T3@ [make and store n << 11]\n H3@ V1@ [acc := (n << 11)*n]\n L8F [shift 5 left for integer scaling]\n T2@ [store n^2]\n[Bachet's method]\n [234] A234@ GH A144@ [print name of method]\n A@ U5@ U8@ [d, h := m]\n A78@ U4@ U6@ T7@ [c, e, f := m + 1]\n T9@ [k := 0]\n [245] A245@ G14@ [call s/r to print square]\n[De la Loubere's (miscalled Siamese) method]\n [247] A247@ GH A156@ [print name of method]\n A78@ U4@ [c := 1]\n LD T6@ [e := 2]\n A@ U8@ [h := m]\n LD U5@ T7@ [d, f := 2m]\n T9@ [k := 0 ]\n [260] A260@ G14@ [call s/r to print square]\n[Conway's lozenge method turns out to be of this type]\n [262] A262@ GH A175@ [print name of method]\n A78@ U4@ U6@ U7@ [c, e, f := 1]\n A@ T9@ [k := m + 1]\n A@ U8@ [h := m]\n LD T5@ [d := 2m]\n [275] A275@ G14@ [call s/r to print square]\n[C solution on Rosetta Code website]\n [277] A277@ GH A187@ [print name of method]\n A78@ T6@ [e := 1]\n A@ LD U4@ U9@ [c, k := 2m]\n S78@ U5@ U7@ T8@ [d, f, h := 2m - 1]\n [290] A290@\n G14@ [call s/r to print square]\n [292] O79@ [done; print null to flush teleprinter buffer]\n ZF [halt the machine]\n E25K TH\n[Subroutine to print a string.\n Input: A order for first character must follow subroutine call (G order).\n String is terminated with EDSAC null, which is sent to the teleprinter.]\n GKA18@U17@S19@T4@AFT6@AFUFOFE12@A20@G16@TFA6@A2FG5@TFZFU3FU1FK2048F\n\n E25K TN\n[Subroutine to print non-negative 17-bit integer.\n Parameters: 0F = integer to be printed (not preserved)\n 1F = character for leading zero (preserved)\n Workspace: 4F..7F, 38 locations]\n GKA3FT34@A1FT7FS35@T6FT4#FAFT4FH36@V4FRDA4#FR1024FH37@E23@O7FA2F\n T6FT5FV4#FYFL8FT4#FA5FL1024FUFA6FG16@OFTFT7FA6FG17@ZFP4FZ219DTF\n\n[================ M parameter again ================]\n E25K TM GK\n E207Z [define entry point]\n PF [acc = 0 on entry]\n","language":"EDSAC-order-code"},{"code":"defmodule RC do\n def odd_magic_square(n) when rem(n,2)==1 do\n for i <- 0..n-1 do\n for j <- 0..n-1, do: n * rem(i+j+1+div(n,2),n) + rem(i+2*j+2*n-5,n) + 1\n end\n end\n\n def print_square(sq) do\n width = List.flatten(sq) |> Enum.max |> to_char_list |> length\n fmt = String.duplicate(\" ~#{width}w\", length(sq)) <> \"~n\"\n Enum.each(sq, fn row -> :io.format fmt, row end)\n end\nend\n\nEnum.each([3,5,11], fn n ->\n IO.puts \"\\nSize #{n}, magic sum #{div(n*n+1,2)*n}\"\n RC.odd_magic_square(n) |> RC.print_square\nend)\n","language":"Elixir"},{"code":"PROGRAM MAGIC_SQUARE\n\n!$INTEGER\n\nPROCEDURE Magicsq(size,filename$)\n\nLOCAL DIM sq[25,25] ! array to hold square\n\nIF (size AND 1)=0 OR size<3 THEN\n PRINT PRINT(CHR$(7)) ! beep\n PRINT(\"error: size is not odd or size is smaller then 3\")\n PAUSE(3)\n EXIT PROCEDURE\nEND IF\n\n! filename$ <> \"\" then save magic square in a file\n! filename$ can contain directory name\n! if filename$ exist it will be overwriten, no error checking\n\n! start in the middle of the first row\n nr=1 x=size-(size DIV 2) y=1\n max=size*size\n\n! create format string for using\n frmt$=STRING$(LEN(STR$(max)),\"#\")\n\n! main loop for creating magic square\n REPEAT\n IF sq[x,y]=0 THEN\n sq[x,y]=nr\n IF nr MOD size=0 THEN\n y=y+1\n ELSE\n x=x+1\n y=y-1\n END IF\n nr=nr+1\n END IF\n IF x>size THEN\n x=1\n WHILE sq[x,y]<>0 DO\n x=x+1\n END WHILE\n END IF\n IF y<1 THEN\n y=size\n WHILE sq[x,y]<>0 DO\n y=y-1\n END WHILE\n END IF\n UNTIL nr>max\n\n! printing square's bigger than 19 result in a wrapping of the line\n PRINT(\"Odd magic square size:\";size;\"*\";size)\n PRINT(\"The magic sum =\";((max+1) DIV 2)*size)\n PRINT\n\n FOR y=1 TO size DO\n FOR x=1 TO size DO\n WRITE(frmt$;sq[x,y];)\n END FOR\n PRINT\n END FOR\n\n ! output magic square to a file with the name provided\n IF filename$<>\"\" THEN\n OPEN(\"O\",1,filename$)\n PRINT(#1,\"Odd magic square size:\";size;\" *\";size)\n PRINT(#1,\"The magic sum =\";((max+1) DIV 2)*size)\n PRINT(#1,)\n\n FOR y=1 TO size DO\n FOR x=1 TO size DO\n WRITE(#1,frmt$;sq[x,y];)\n END FOR\n PRINT(#1,)\n END FOR\n END IF\n CLOSE(1)\n\nEND PROCEDURE\n\nBEGIN\nPRINT(CHR$(12);) ! CLS\nMagicsq(5,\"\")\nMagicsq(11,\"\")\n!----------------------------------------------------\n! the next line will also print the square to a file\n! called 'magic_square_19txt'\n!----------------------------------------------------\nMagicsq(19,\"msq_19.txt\")\n\nEND PROGRAM\n","language":"ERRE"},{"code":"USING: formatting io kernel math math.matrices math.ranges\nsequences sequences.extras ;\nIN: rosetta-code.magic-squares-odd\n\n: inc-matrix ( n -- matrix )\n [ 0 ] dip dup [ 1 + dup ] make-matrix nip ;\n\n: rotator ( n -- seq ) 2/ dup [ neg ] dip [a,b] ;\n\n: odd-magic-square ( n -- matrix )\n [ inc-matrix ] [ rotator [ rotate ] 2map flip ] dup tri ;\n\n: show-square ( n -- )\n dup \"Order: %d\\n\" printf odd-magic-square dup\n [ [ \"%4d\" printf ] each nl ] each first sum\n \"Magic number: %d\\n\\n\" printf ;\n\n3 5 11 [ show-square ] tri@\n","language":"Factor"},{"code":"program Magic_Square\n implicit none\n\n integer, parameter :: order = 15\n integer :: i, j\n\n write(*, \"(a, i0)\") \"Magic Square Order: \", order\n write(*, \"(a)\") \"----------------------\"\n do i = 1, order\n do j = 1, order\n write(*, \"(i4)\", advance = \"no\") f1(order, i, j)\n end do\n write(*,*)\n end do\n write(*, \"(a, i0)\") \"Magic number = \", f2(order)\n\ncontains\n\ninteger function f1(n, x, y)\n integer, intent(in) :: n, x, y\n\n f1 = n * mod(x + y - 1 + n/2, n) + mod(x + 2*y - 2, n) + 1\nend function\n\ninteger function f2(n)\n integer, intent(in) :: n\n\n f2 = n * (1 + n * n) / 2\nend function\nend program\n","language":"Fortran"},{"code":"' version 23-06-2015\n' compile with: fbc -s console\n\nSub magicsq(size As Integer, filename As String =\"\")\n\n If (size And 1) = 0 Or size < 3 Then\n Print : Beep ' alert\n Print \"error: size is not odd or size is smaller then 3\"\n Sleep 3000,1 'wait 3 seconds, ignore key press\n Exit Sub\n End If\n\n ' filename <> \"\" then save magic square in a file\n ' filename can contain directory name\n ' if filename exist it will be overwriten, no error checking\n\n Dim As Integer sq(size,size) ' array to hold square\n ' start in the middle of the first row\n Dim As Integer nr = 1, x = size - (size \\ 2), y = 1\n Dim As Integer max = size * size\n ' create format string for using\n Dim As String frmt = String(Len(Str(max)) +1, \"#\")\n\n ' main loop for creating magic square\n Do\n If sq(x, y) = 0 Then\n sq(x, y) = nr\n If nr Mod size = 0 Then\n y += 1\n Else\n x += 1\n y -= 1\n End If\n nr += 1\n End If\n If x > size Then\n x = 1\n Do While sq(x,y) <> 0\n x += 1\n Loop\n End If\n If y < 1 Then\n y = size\n Do While sq(x,y) <> 0\n y -= 1\n Loop\n EndIf\n Loop Until nr > max\n\n ' printing square's bigger than 19 result in a wrapping of the line\n Print \"Odd magic square size:\"; size; \" *\"; size\n Print \"The magic sum =\"; ((max +1) \\ 2) * size\n Print\n\n For y = 1 To size\n For x = 1 To size\n Print Using frmt; sq(x,y);\n Next\n Print\n Next\n print\n\n ' output magic square to a file with the name provided\n If filename <> \"\" Then\n nr = FreeFile\n Open filename For Output As #nr\n Print #nr, \"Odd magic square size:\"; size; \" *\"; size\n Print #nr, \"The magic sum =\"; ((max +1) \\ 2) * size\n Print #nr,\n\n For y = 1 To size\n For x = 1 To size\n Print #nr, Using frmt; sq(x,y);\n Next\n Print #nr,\n Next\n End If\n Close\n\nEnd Sub\n\n' ------=< MAIN >=------\n\nmagicsq(5)\nmagicsq(11)\n' the next line will also print the square to a file called: magic_square_19.txt\nmagicsq(19, \"magic_square_19.txt\")\n\n\n' empty keyboard buffer\nWhile Inkey <> \"\" : Wend\nPrint : Print \"hit any key to end program\"\nSleep\nEnd\n","language":"FreeBASIC"},{"code":"order = length[ARGS] > 0 ? eval[ARGS@0] : undef\nuntil isInteger[order] and order mod 2 == 1\n order = eval[input[\"Enter order (must be odd): \", 3]]\n\na = new array[[order, order], undef]\nx = order div 2\ny = 0\n\nfor i = 1 to order^2\n{\n ny = (y - 1) mod order\n nx = (x + 1) mod order\n if a@ny@nx != undef\n {\n nx = x\n ny = (y + 1) mod order\n }\n a@y@x = i\n y = ny\n x = nx\n}\n\nprintln[formatTable[a]]\nprintln[\"Magic number is \" + sum[a@0]]\n","language":"Frink"},{"code":"package main\n\nimport (\n \"fmt\"\n \"log\"\n)\n\nfunc ms(n int) (int, []int) {\n M := func(x int) int { return (x + n - 1) % n }\n if n <= 0 || n&1 == 0 {\n n = 5\n log.Println(\"forcing size\", n)\n }\n m := make([]int, n*n)\n i, j := 0, n/2\n for k := 1; k <= n*n; k++ {\n m[i*n+j] = k\n if m[M(i)*n+M(j)] != 0 {\n i = (i + 1) % n\n } else {\n i, j = M(i), M(j)\n }\n }\n return n, m\n}\n\nfunc main() {\n n, m := ms(5)\n i := 2\n for j := 1; j <= n*n; j *= 10 {\n i++\n }\n f := fmt.Sprintf(\"%%%dd\", i)\n for i := 0; i < n; i++ {\n for j := 0; j < n; j++ {\n fmt.Printf(f, m[i*n+j])\n }\n fmt.Println()\n }\n}\n","language":"Go"},{"code":"100 REM Magic squares of odd order\n110 INPUT \"The square order: \", N\n115 'INPUT \"The square order:\"; N ' for MSX Basic\n120 IF (N AND 1) = 0 OR N < 3 THEN PRINT \"error: size is not odd or size is smaller then 3\" : GOTO 100\n130 FOR I = 1 TO N\n140 FOR J = 1 TO N\n150 PRINT USING \" ###\"; ((I*2-J+N-1) MOD N) * N + ((I*2+J-2) MOD N) + 1;\n160 NEXT J\n170 PRINT\n180 NEXT I\n190 PRINT \"The magic number is: \"; N * (N^2+1) / 2\n","language":"GW-BASIC"},{"code":"-- as a translation from imperative code, this is probably not a \"good\" implementation\nimport Data.List\n\ntype Var = (Int, Int, Int, Int) -- sx sy sz c\n\nmagicSum :: Int -> Int\nmagicSum x = ((x * x + 1) `div` 2) * x\n\nwrapInc :: Int -> Int -> Int\nwrapInc max x\n | x + 1 == max = 0\n | otherwise = x + 1\n\nwrapDec :: Int -> Int -> Int\nwrapDec max x\n | x == 0 = max - 1\n | otherwise = x - 1\n\nisZero :: [[Int]] -> Int -> Int -> Bool\nisZero m x y = m !! x !! y == 0\n\nsetAt :: (Int,Int) -> Int -> [[Int]] -> [[Int]]\nsetAt (x, y) val table\n | (upper, current : lower) <- splitAt x table,\n (left, this : right) <- splitAt y current\n = upper ++ (left ++ val : right) : lower\n | otherwise = error \"Outside\"\n\ncreate :: Int -> [[Int]]\ncreate x = replicate x $ replicate x 0\n\ncells :: [[Int]] -> Int\ncells m = x*x where x = length m\n\nfill :: Var -> [[Int]] -> [[Int]]\nfill (sx, sy, sz, c) m\n | c < cells m =\n if isZero m sx sy\n then fill ((wrapInc sz sx), (wrapDec sz sy), sz, c + 1) (setAt (sx, sy) (c + 1) m)\n else fill ((wrapDec sz sx), (wrapInc sz(wrapInc sz sy)), sz, c) m\n | otherwise = m\n\nmagicNumber :: Int -> [[Int]]\nmagicNumber d = transpose $ fill (d `div` 2, 0, d, 0) (create d)\n\ndisplay :: [[Int]] -> String\ndisplay (x:xs)\n | null xs = vdisplay x\n | otherwise = vdisplay x ++ ('\\n' : display xs)\n\nvdisplay :: [Int] -> String\nvdisplay (x:xs)\n | null xs = show x\n | otherwise = show x ++ \" \" ++ vdisplay xs\n\n\nmagicSquare x = do\n putStr \"Magic Square of \"\n putStr $ show x\n putStr \" = \"\n putStrLn $ show $ magicSum x\n putStrLn $ display $ magicNumber x\n","language":"Haskell"},{"code":"import Control.Monad (join)\nimport Data.List (maximumBy, transpose)\nimport Data.List.Split (chunksOf)\nimport Data.Ord (comparing)\n\n\nmagicSquare :: Int -> [[Int]]\nmagicSquare n\n | 1 == mod n 2 =\n applyN 2 (transpose . cycled) $\n plainSquare n\n | otherwise = []\n\n\nplainSquare :: Int -> [[Int]]\nplainSquare = chunksOf <*> enumFromTo 1 . (^ 2)\n\n\n-------------------------- TEST ---------------------------\nmain :: IO ()\nmain =\n mapM_ putStrLn $\n showSquare . magicSquare <$> [3, 5, 7]\n\n\n------------------------- GENERIC -------------------------\napplyN :: Int -> (a -> a) -> a -> a\napplyN n f = foldr (.) id (replicate n f)\n\ncycled :: [[Int]] -> [[Int]]\ncycled rows =\n let n = length rows\n d = quot n 2\n in zipWith\n (\\d xs -> take n $ drop (n - d) (cycle xs))\n [d, subtract 1 d .. - d]\n rows\n\n------------------------ FORMATTING ----------------------\njustifyRight :: Int -> a -> [a] -> [a]\njustifyRight n c = (drop . length) <*> (replicate n c <>)\n\nshowSquare :: Show a => [[a]] -> String\nshowSquare rows =\n ( (\\xs w -> unlines ((justifyRight w ' ' =<<) <$> xs))\n <*> succ . maximum . fmap length . join\n )\n $ fmap show <$> rows\n","language":"Haskell"},{"code":"{-# LANGUAGE TupleSections #-}\n\nimport Control.Monad (forM_)\nimport Data.List (intercalate, transpose)\nimport qualified Data.Map.Strict as M\nimport Data.Maybe (fromJust, isJust)\n\nmagic :: Int -> [[Int]]\nmagic = mapAsTable <*> siamMap\n\n----------------- SIAMESE METHOD FUNCTIONS ---------------\n\n-- Highest zero-based index of grid ->\n-- 'Siamese' indices keyed by coordinates\nsiamMap :: Int -> M.Map (Int, Int) Int\nsiamMap n\n | odd n = go n\n | otherwise = M.fromList []\n where\n go n = sPath uBound (M.fromList []) (quot uBound 2, 0) 1\n where\n h = quot n 2\n uBound = n - 1\n sPath uBound sMap (x, y) h =\n let newMap = M.insert (x, y) h sMap\n in if y == uBound && x == quot uBound 2\n then newMap\n else\n sPath\n uBound\n newMap\n (nextSiam uBound sMap (x, y))\n (succ h)\n\n-- Highest index of square -> Siam xys so far -> xy ->\n-- next xy coordinate\nnextSiam :: Int -> M.Map (Int, Int) Int -> (Int, Int) -> (Int, Int)\nnextSiam uBound sMap (x, y) =\n let alt (a, b)\n -- Top right corner ?\n | a > uBound && b < 0 = (uBound, 1)\n -- beyond right edge ?\n | a > uBound = (0, b)\n -- above top edge ?\n | b < 0 = (a, uBound)\n -- already filled ?\n | isJust (M.lookup (a, b) sMap) = (a - 1, b + 2)\n | otherwise = (a, b) -- Up one, right one.\n in alt (x + 1, y - 1)\n\n---------------- DISPLAY AND TEST FUNCTIONS --------------\n\n-- Size of square -> integers keyed by coordinates\n-- -> rows of integers\nmapAsTable :: Int -> M.Map (Int, Int) Int -> [[Int]]\nmapAsTable nCols xyMap =\n let axis = [0 .. nCols - 1]\n in fmap (fromJust . flip M.lookup xyMap)\n <$> (axis >>= \\y -> [(,y) <$> axis])\n\nchecked :: [[Int]] -> (Int, Bool)\nchecked square =\n let diagonals =\n fmap (flip (zipWith (!!)) [0 ..])\n . ( (:)\n <*> (return . reverse)\n )\n h : t =\n sum <$> square\n <> transpose square\n <> diagonals square\n in (h, all (h ==) t)\n\ntable :: String -> [[String]] -> [String]\ntable delim rows =\n let justifyRight c n s =\n drop\n (length s)\n (replicate n c <> s)\n in intercalate delim\n <$> transpose\n ( (fmap =<< justifyRight ' ' . maximum . fmap length)\n <$> transpose rows\n )\n\nmain :: IO ()\nmain =\n forM_ [3, 5, 7] $\n \\n -> do\n let test = magic n\n putStrLn $ unlines (table \" \" (fmap show <$> test))\n print $ checked test\n putStrLn \"\"\n","language":"Haskell"},{"code":"procedure main(A)\n n := integer(!A) | 3\n write(\"Magic number: \",n*(n*n+1)/2)\n sq := buildSquare(n)\n showSquare(sq)\nend\n\nprocedure buildSquare(n)\n sq := [: |list(n)\\n :]\n r := 0\n c := n/2\n every i := !(n*n) do {\n /sq[r+1,c+1] := i\n nr := (n+r-1)%n\n nc := (c+1)%n\n if /sq[nr+1,nc+1] then (r := nr,c := nc) else r := (r+1)%n\n }\n return sq\nend\n\nprocedure showSquare(sq)\n n := *sq\n s := *(n*n)+2\n every r := !sq do every writes(right(!r,s)|\"\\n\")\nend\n","language":"Haskell"},{"code":"100 PROGRAM \"MagicN.bas\"\n110 DO\n120 INPUT PROMPT \"The square order: \":N\n130 LOOP UNTIL MOD(N,2)>0 AND INT(N)=N AND N>0\n140 FOR I=1 TO N\n150 FOR J=1 TO N\n160 PRINT USING \" ###\":MOD((I*2-J+N-1),N)*N+MOD(I*2+J-2,N)+1;\n170 NEXT\n180 PRINT\n190 NEXT\n200 PRINT \"The magic number is:\";N*(N^2+1)/2\n","language":"IS-BASIC"},{"code":"ms=: i:@<.@-: |.\"_1&|:^:2 >:@i.@,~\n","language":"J"},{"code":" >:@i.@,~ 3\n1 2 3\n4 5 6\n7 8 9\n","language":"J"},{"code":" i:@<.@-: 3\n_1 0 1\n","language":"J"},{"code":" ms 5\n 9 15 16 22 3\n20 21 2 8 14\n 1 7 13 19 25\n12 18 24 5 6\n23 4 10 11 17\n ~.+/ms 5\n65\n ~.+/ms 101\n515201\n","language":"J"},{"code":"public class MagicSquare {\n\n public static void main(String[] args) {\n int n = 5;\n for (int[] row : magicSquareOdd(n)) {\n for (int x : row)\n System.out.format(\"%2s \", x);\n System.out.println();\n }\n System.out.printf(\"\\nMagic constant: %d \", (n * n + 1) * n / 2);\n }\n\n public static int[][] magicSquareOdd(final int base) {\n if (base % 2 == 0 || base < 3)\n throw new IllegalArgumentException(\"base must be odd and > 2\");\n\n int[][] grid = new int[base][base];\n int r = 0, number = 0;\n int size = base * base;\n\n int c = base / 2;\n while (number++ < size) {\n grid[r][c] = number;\n if (r == 0) {\n if (c == base - 1) {\n r++;\n } else {\n r = base - 1;\n c++;\n }\n } else {\n if (c == base - 1) {\n r--;\n c = 0;\n } else {\n if (grid[r - 1][c + 1] == 0) {\n r--;\n c++;\n } else {\n r++;\n }\n }\n }\n }\n return grid;\n }\n}\n","language":"Java"},{"code":"(function () {\n\n // n -> [[n]]\n function magic(n) {\n return n % 2 ? rotation(\n transposed(\n rotation(\n table(n)\n )\n )\n ) : null;\n }\n\n // [[a]] -> [[a]]\n function rotation(lst) {\n return lst.map(function (row, i) {\n return rotated(\n row, ((row.length + 1) / 2) - (i + 1)\n );\n })\n }\n\n // [[a]] -> [[a]]\n function transposed(lst) {\n return lst[0].map(function (col, i) {\n return lst.map(function (row) {\n return row[i];\n })\n });\n }\n\n // [a] -> n -> [a]\n function rotated(lst, n) {\n var lng = lst.length,\n m = (typeof n === 'undefined') ? 1 : (\n n < 0 ? lng + n : (n > lng ? n % lng : n)\n );\n\n return m ? (\n lst.slice(-m).concat(lst.slice(0, lng - m))\n ) : lst;\n }\n\n // n -> [[n]]\n function table(n) {\n var rngTop = rng(1, n);\n\n return rng(0, n - 1).map(function (row) {\n return rngTop.map(function (x) {\n return row * n + x;\n });\n });\n }\n\n // [m..n]\n function rng(m, n) {\n return Array.apply(null, Array(n - m + 1)).map(\n function (x, i) {\n return m + i;\n });\n }\n\n /******************** TEST WITH 3, 5, 11 ***************************/\n\n // Results as right-aligned wiki tables\n function wikiTable(lstRows, blnHeaderRow, strStyle) {\n var css = strStyle ? 'style=\"' + strStyle + '\"' : '';\n\n return '{| class=\"wikitable\" ' + css + lstRows.map(\n function (lstRow, iRow) {\n var strDelim = ((blnHeaderRow && !iRow) ? '!' : '|'),\n strDbl = strDelim + strDelim;\n\n return '\\n|-\\n' + strDelim + ' ' + lstRow.join(' ' + strDbl + ' ');\n }).join('') + '\\n|}';\n }\n\n return [3, 5, 11].map(\n function (n) {\n var w = 2.5 * n;\n return 'magic(' + n + ')\\n\\n' + wikiTable(\n magic(n), false, 'text-align:center;width:' + w + 'em;height:' + w + 'em;table-layout:fixed;'\n )\n }\n ).join('\\n\\n')\n})();\n","language":"JavaScript"},{"code":"(() => {\n\n // magicSquare :: Int -> [[Int]]\n const magicSquare = n =>\n n % 2 !== 0 ? (\n compose([transpose, cycled, transpose, cycled, enumSquare])(n)\n ) : [];\n\n // Size of square -> rows containing integers [1..]\n // enumSquare :: Int -> [[Int]]\n const enumSquare = n =>\n chunksOf(n, enumFromTo(1, n * n));\n\n // Table of integers -> Table with rows rotated by descending deltas\n // cycled :: [[Int]] -> [[Int]]\n const cycled = rows => {\n const d = Math.floor(rows.length / 2);\n return zipWith(listCycle, enumFromTo(d, -d), rows)\n };\n\n // Number of positions to shift to right -> List -> Wrap-cycled list\n // listCycle :: Int -> [a] -> [a]\n const listCycle = (n, xs) => {\n const d = -(n % xs.length);\n return (d !== 0 ? xs.slice(d)\n .concat(xs.slice(0, d)) : xs);\n };\n\n // GENERIC FUNCTIONS ------------------------------------------------------\n\n // chunksOf :: Int -> [a] -> [[a]]\n const chunksOf = (n, xs) =>\n xs.reduce((a, _, i, xs) =>\n i % n ? a : a.concat([xs.slice(i, i + n)]), []);\n\n // compose :: [(a -> a)] -> (a -> a)\n const compose = fs => x => fs.reduceRight((a, f) => f(a), x);\n\n // enumFromTo :: Int -> Int -> Maybe Int -> [Int]\n const enumFromTo = (m, n, step) => {\n const d = (step || 1) * (n >= m ? 1 : -1);\n return Array.from({\n length: Math.floor((n - m) / d) + 1\n }, (_, i) => m + (i * d));\n };\n\n // intercalate :: String -> [a] -> String\n const intercalate = (s, xs) => xs.join(s);\n\n // min :: Ord a => a -> a -> a\n const min = (a, b) => b < a ? b : a;\n\n // show :: a -> String\n const show = JSON.stringify;\n\n // transpose :: [[a]] -> [[a]]\n const transpose = xs =>\n xs[0].map((_, iCol) => xs.map(row => row[iCol]));\n\n // unlines :: [String] -> String\n const unlines = xs => xs.join('\\n');\n\n // zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\n const zipWith = (f, xs, ys) =>\n Array.from({\n length: min(xs.length, ys.length)\n }, (_, i) => f(xs[i], ys[i]));\n\n // TEST -------------------------------------------------------------------\n return intercalate('\\n\\n', [3, 5, 7]\n .map(magicSquare)\n .map(xs => unlines(xs.map(show))));\n})();\n","language":"JavaScript"},{"code":"(() => {\n\n // Number of rows -> n rows of integers\n // oddMagicTable :: Int -> [[Int]]\n const oddMagicTable = n =>\n mapAsTable(n, siamMap(quot(n, 2)));\n\n // Highest index of square -> Siam xys so far -> xy -> next xy coordinate\n // nextSiam :: Int -> M.Map (Int, Int) Int -> (Int, Int) -> (Int, Int)\n const nextSiam = (uBound, sMap, [x, y]) => {\n const [a, b] = [x + 1, y - 1];\n return (a > uBound && b < 0) ? (\n [uBound, 1] // Move down if obstructed by corner\n ) : a > uBound ? (\n [0, b] // Wrap at right edge\n ) : b < 0 ? (\n [a, uBound] // Wrap at upper edge\n ) : mapLookup(sMap, [a, b])\n .nothing ? ( // Unimpeded default: one up one right\n [a, b]\n ) : [a - 1, b + 2]; // Position occupied: move down\n };\n\n // Order of table -> Siamese indices keyed by coordinates\n // siamMap :: Int -> M.Map (Int, Int) Int\n const siamMap = n => {\n const\n uBound = 2 * n,\n sPath = (uBound, sMap, xy, n) => {\n const [x, y] = xy,\n newMap = mapInsert(sMap, xy, n);\n return (y == uBound && x == quot(uBound, 2) ? (\n newMap\n ) : sPath(\n uBound, newMap, nextSiam(uBound, newMap, [x, y]), n + 1));\n };\n return sPath(uBound, {}, [n, 0], 1);\n };\n\n // Size of square -> integers keyed by coordinates -> rows of integers\n // mapAsTable :: Int -> M.Map (Int, Int) Int -> [[Int]]\n const mapAsTable = (nCols, dct) => {\n const axis = enumFromTo(0, nCols - 1);\n return map(row => map(k => fromJust(mapLookup(dct, k)), row),\n bind(axis, y => [bind(axis, x => [\n [x, y]\n ])]));\n };\n\n // GENERIC FUNCTIONS ------------------------------------------------------\n\n // bind :: [a] -> (a -> [b]) -> [b]\n const bind = (xs, f) => [].concat.apply([], xs.map(f));\n\n // curry :: Function -> Function\n const curry = (f, ...args) => {\n const go = xs => xs.length >= f.length ? (f.apply(null, xs)) :\n function () {\n return go(xs.concat(Array.from(arguments)));\n };\n return go([].slice.call(args, 1));\n };\n\n // enumFromTo :: Int -> Int -> [Int]\n const enumFromTo = (m, n) =>\n Array.from({\n length: Math.floor(n - m) + 1\n }, (_, i) => m + i);\n\n // fromJust :: M a -> a\n const fromJust = m => m.nothing ? {} : m.just;\n\n // fst :: [a, b] -> a\n const fst = pair => pair.length === 2 ? pair[0] : undefined;\n\n // intercalate :: String -> [a] -> String\n const intercalate = (s, xs) => xs.join(s);\n\n // justifyRight :: Int -> Char -> Text -> Text\n const justifyRight = (n, cFiller, strText) =>\n n > strText.length ? (\n (cFiller.repeat(n) + strText)\n .slice(-n)\n ) : strText;\n\n // length :: [a] -> Int\n const length = xs => xs.length;\n\n // log :: a -> IO ()\n const log = (...args) =>\n console.log(\n args\n .map(show)\n .join(' -> ')\n );\n\n // map :: (a -> b) -> [a] -> [b]\n const map = (f, xs) => xs.map(f);\n\n // mapInsert :: Dictionary -> k -> v -> Dictionary\n const mapInsert = (dct, k, v) =>\n (dct[(typeof k === 'string' && k) || show(k)] = v, dct);\n\n // mapKeys :: Map k a -> [k]\n const mapKeys = dct =>\n sortBy(mappendComparing([snd, fst]),\n map(JSON.parse, Object.keys(dct)));\n\n // mapLookup :: Dictionary -> k -> Maybe v\n const mapLookup = (dct, k) => {\n const\n v = dct[(typeof k === 'string' && k) || show(k)],\n blnJust = (typeof v !== 'undefined');\n return {\n nothing: !blnJust,\n just: v\n };\n };\n\n // mappendComparing :: [(a -> b)] -> (a -> a -> Ordering)\n const mappendComparing = fs => (x, y) =>\n fs.reduce((ord, f) => {\n if (ord !== 0) return ord;\n const\n a = f(x),\n b = f(y);\n return a < b ? -1 : a > b ? 1 : 0\n }, 0);\n\n // maximum :: [a] -> a\n const maximum = xs =>\n xs.reduce((a, x) => (x > a || a === undefined ? x : a), undefined);\n\n // Integral a => a -> a -> a\n const quot = (n, m) => Math.floor(n / m);\n\n // show :: a -> String\n const show = x => JSON.stringify(x);\n //\n // snd :: (a, b) -> b\n const snd = tpl => Array.isArray(tpl) ? tpl[1] : undefined;\n //\n // sortBy :: (a -> a -> Ordering) -> [a] -> [a]\n const sortBy = (f, xs) => xs.slice()\n .sort(f);\n\n // table :: String -> [[String]] -> [String]\n const table = (delim, rows) =>\n map(curry(intercalate)(delim),\n transpose(map(col =>\n map(curry(justifyRight)(maximum(map(length, col)))(' '), col),\n transpose(rows))));\n\n // transpose :: [[a]] -> [[a]]\n const transpose = xs =>\n xs[0].map((_, col) => xs.map(row => row[col]));\n\n // unlines :: [String] -> String\n const unlines = xs => xs.join('\\n');\n\n // TEST -------------------------------------------------------------------\n\n return intercalate('\\n\\n',\n bind([3, 5, 7],\n n => unlines(table(\" \",\n map(xs => map(show, xs), oddMagicTable(n))))));\n})();\n","language":"JavaScript"},{"code":"def odd_magic_square:\n if type != \"number\" or . % 2 == 0 or . <= 0\n then error(\"odd_magic_square requires an odd positive integer\")\n else\n . as $n\n | reduce range(1; 1 + ($n*$n)) as $i\n ( [0, (($n-1)/2), []];\n \t .[0] as $x | .[1] as $y\n | .[2]\n\t | setpath([$x, $y]; $i )\n | if getpath([(($x+$n-1) % $n), (($y+$n+1) % $n)])\n then [(($x+$n+1) % $n), $y, .]\n else [ (($x+$n-1) % $n), (($y+$n+1) % $n), .]\n \t end ) | .[2]\n end ;\n","language":"Jq"},{"code":"def task:\n def pp: if length == 0 then empty\n else \"\\(.[0])\", (.[1:] | pp )\n end;\n \"The magic sum for a square of size \\(.) is \\( (.*. + 1)*./2 ):\",\n (odd_magic_square | pp)\n;\n\n(3, 5, 9) | task\n","language":"Jq"},{"code":"$ jq -n -r -M -c -f odd_magic_square.jq\nThe magic sum for a square of size 3 is 15:\n[8,1,6]\n[3,5,7]\n[4,9,2]\nThe magic sum for a square of size 5 is 65:\n[17,24,1,8,15]\n[23,5,7,14,16]\n[4,6,13,20,22]\n[10,12,19,21,3]\n[11,18,25,2,9]\nThe magic sum for a square of size 9 is 369:\n[47,58,69,80,1,12,23,34,45]\n[57,68,79,9,11,22,33,44,46]\n[67,78,8,10,21,32,43,54,56]\n[77,7,18,20,31,42,53,55,66]\n[6,17,19,30,41,52,63,65,76]\n[16,27,29,40,51,62,64,75,5]\n[26,28,39,50,61,72,74,4,15]\n[36,38,49,60,71,73,3,14,25]\n[37,48,59,70,81,2,13,24,35]\n","language":"Jq"},{"code":"# v0.6.0\n\nfunction magicsquareodd(base::Int)\n if base & 1 == 0 || base < 3; error(\"base must be odd and >3\") end\n\n square = fill(0, base, base)\n r, number = 1, 1\n size = base * base\n\n c = div(base, 2) + 1\n while number ≤ size\n square[r, c] = number\n fr = r == 1 ? base : r - 1\n fc = c == base ? 1 : c + 1\n if square[fr, fc] != 0\n fr = r == base ? 1 : r + 1\n fc = c\n end\n r, c = fr, fc\n number += 1\n end\n\n return square\nend\n\nfor n in 3:2:7\n println(\"Magic square with size $n - magic constant = \", div(n ^ 3 + n, 2))\n println(\"----------------------------------------------------\")\n square = magicsquareodd(n)\n for i in 1:n\n println(square[i, :])\n end\n println()\nend\n","language":"Julia"},{"code":"// version 1.0.6\n\nfun f(n: Int, x: Int, y: Int) = (x + y * 2 + 1) % n\n\nfun main(args: Array<String>) {\n var n: Int\n while (true) {\n print(\"Enter the order of the magic square : \")\n n = readLine()!!.toInt()\n if (n < 1 || n % 2 == 0) println(\"Must be odd and >= 1, try again\")\n else break\n }\n println()\n for (i in 0 until n) {\n for (j in 0 until n) print(\"%4d\".format(f(n, n - j - 1, i) * n + f(n, j, i) + 1))\n println()\n }\n println(\"\\nThe magic constant is ${(n * n + 1) / 2 * n}\")\n}\n","language":"Kotlin"},{"code":"Dim m(1,1)\n\nCall magicSquare 5\nCall magicSquare 17\n\nEnd\n\nSub magicSquare n\n ReDim m(n,n)\n inc = 1\n count = 1\n row = 1\n col=(n+1)/2\n While count <= n*n\n m(row,col) = count\n count = count + 1\n If inc < n Then\n inc = inc + 1\n row = row - 1\n col = col + 1\n If row <> 0 Then\n If col > n Then col = 1\n Else\n row = n\n End If\n Else\n inc = 1\n row = row + 1\n End If\n Wend\n Call printSquare n\nEnd Sub\n\nSub printSquare n\n 'Arbitrary limit to fit width of A4 paper\n If n < 23 Then\n Print n;\" x \";n;\" Magic Square --- \";\n Print \"Magic constant is \";Int((n*n+1)/2*n)\n For row = 1 To n\n For col = 1 To n\n Print Using(\"####\",m(row,col));\n Next col\n Print\n Print\n Next row\n Else\n Notice \"Magic Square will not fit on one sheet of paper.\"\n End If\nEnd Sub\n","language":"Liberty-BASIC"},{"code":"rp[v_, pos_] := RotateRight[v, (Length[v] + 1)/2 - pos];\nrho[m_] := MapIndexed[rp, m];\nmagic[n_] :=\n rho[Transpose[rho[Table[i*n + j, {i, 0, n - 1}, {j, 1, n}]]]];\n\nsquare = magic[11] // Grid\nPrint[\"Magic number is \", Total[square[[1, 1]]]]\n","language":"Mathematica"},{"code":"wrap1(i):= if i>%n% then 1 else if i<1 then %n% else i;\nwrap(P):=maplist('wrap1, P);\n\nuprigth(P):= wrap(P + [-1, 1]);\ndown(P):= wrap(P + [1, 0]);\n\nmagic(n):=block([%n%: n,\n M: zeromatrix (n, n),\n P: [1, (n + 1)/2],\n m: 1, Pc],\n do (\n M[P[1],P[2]]: m,\n m: m + 1,\n if m>n^2 then return(M),\n Pc: uprigth(P),\n if M[Pc[1],Pc[2]]=0 then P: Pc\n else while(M[P[1],P[2]]#0) do P: down(P)));\n","language":"Maxima"},{"code":"(%i6) magic(3);\n [ 8 1 6 ]\n [ ]\n(%o6) [ 3 5 7 ]\n [ ]\n [ 4 9 2 ]\n(%i7) magic(5);\n [ 17 24 1 8 15 ]\n [ ]\n [ 23 5 7 14 16 ]\n [ ]\n(%o7) [ 4 6 13 20 22 ]\n [ ]\n [ 10 12 19 21 3 ]\n [ ]\n [ 11 18 25 2 9 ]\n(%i8) magic(7);\n [ 30 39 48 1 10 19 28 ]\n [ ]\n [ 38 47 7 9 18 27 29 ]\n [ ]\n [ 46 6 8 17 26 35 37 ]\n [ ]\n(%o8) [ 5 14 16 25 34 36 45 ]\n [ ]\n [ 13 15 24 33 42 44 4 ]\n [ ]\n [ 21 23 32 41 43 3 12 ]\n [ ]\n [ 22 31 40 49 2 11 20 ]\n/* magic number for n=7 */\n(%i9) lsum(q, q, first(magic(7)));\n(%o9) 175\n","language":"Maxima"},{"code":"100 REM Magic squares of odd order\n110 INPUT \"The square order:\"; N\n120 IF (N AND 1) = 0 OR N < 3 THEN PRINT \"error: size is not odd or size is smaller then 3\" : GOTO 100\n130 FOR I = 1 TO N\n140 FOR J = 1 TO N\n150 PRINT USING \" ###\"; ((I*2-J+N-1) MOD N) * N + ((I*2+J-2) MOD N) + 1;\n160 NEXT J\n170 PRINT\n180 NEXT I\n190 PRINT \"The magic number is:\"; N * (N^2+1) / 2\n","language":"MSX-Basic"},{"code":"import strutils\n\nproc magic(n: int) =\n let length = len($(n * n))\n for row in 1 .. n:\n for col in 1 .. n:\n let cell = (n * ((row + col - 1 + n div 2) mod n) +\n ((row + 2 * col - 2) mod n) + 1)\n stdout.write ($cell).align(length), ' '\n echo \"\"\n echo \"\\nAll sum to magic number \", (n * n + 1) * n div 2\n\nfor n in [3, 5, 7]:\n echo \"\\nOrder \", n, \"\\n=======\"\n magic(n)\n","language":"Nim"},{"code":": magicSquare(n)\n| i j wd |\n n sq log asInteger 1+ ->wd\n n loop: i [\n n loop: j [\n i j + 1- n 2 / + n mod n *\n i j + j + 2 - n mod 1 + +\n System.Out swap <<w(wd) \" \" << drop\n ]\n printcr\n ]\n System.Out \"Magic constant is : \" << n sq 1 + 2 / n * << cr ;\n","language":"Oforth"},{"code":"magicSquare(n)={\n my(M=matrix(n,n),j=n\\2+1,i=1);\n for(l=1,n^2,\n M[i,j]=l;\n if(M[(i-2)%n+1,j%n+1],\n i=i%n+1\n ,\n i=(i-2)%n+1;\n j=j%n+1\n )\n );\n M;\n}\nmagicSquare(7)\n","language":"PARI-GP"},{"code":"PROGRAM magic;\n(* Magic squares of odd order *)\nCONST\n n=9;\nVAR\n i,j :INTEGER;\nBEGIN (*magic*)\n WRITELN('The square order is: ',n);\n FOR i:=1 TO n DO\n BEGIN\n FOR j:=1 TO n DO\n WRITE((i*2-j+n-1) MOD n*n + (i*2+j-2) MOD n+1:5);\n WRITELN\n END;\n WRITELN('The magic number is: ',n*(n*n+1) DIV 2)\nEND (*magic*).\n","language":"Pascal"},{"code":"PROGRAM magic;\n{$IFDEF FPC }{$MODE DELPHI}{$ELSE}{$APPTYPE CONSOLE}{$ENDIF}\nuses\n sysutils;\n(* Magic squares of odd order *)\ntype\n tsquare = array of array of LongInt;\n trowcol = array of NativeInt;\n\nfunction GenShuffleRowCol(n: nativeInt):trowcol;\nvar\n i,j,tmp: NativeInt;\nbegin\n setlength(result,0);\n IF n > 0 then\n Begin\n setlength(result,n);\n For i := 0 to n-1 do\n result[i] := i;\n //shuffle\n For i := n-1 downto 1 do\n Begin\n j := random(i+1);//j == [0..i]\n tmp := result[i];result[i]:= result[j];result[j]:= tmp;\n end;\n end;\nend;\n\nfunction MagicSqrOdd(n:nativeInt;SwapColRoW:boolean):tsquare;\nVAR\n rowIdx,colIdx,row,col,num :NativeInt;\n cols,rows :trowcol;\nBEGIN\n rows:= GenShuffleRowCol(n);\n cols:= GenShuffleRowCol(n);\n setlength(result,n,n);\n FOR rowIdx:= 0 TO n-1 DO\n BEGIN\n row := rows[rowIdx];\n FOR colIdx:=0 TO n-1 DO\n Begin\n col := cols[colIdx];\n //corrected formula cause row :0..n*1-> corrected to 1..n\n num := (row*2-col+n+2) MOD n*n + (row*2+col+1) MOD n+1;\n IF SwapColRoW then\n result[colIdx,rowIdx] := num\n else\n result[rowIdx,colIdx] := num;\n end;\n END;\nEND;\n\nfunction MagicSqrCheck(const Mq:tsquare):boolean;\nvar\n row,col,rowsum,mn,n,itm: NativeInt;\n colSum:trowcol;\nbegin\n n := length(Mq[0]);\n mn := n*(n*n+1) DIV 2;\n setlength(colsum,n);//automatic initialised to zero\n For row := n-1 downto 0 do\n Begin\n //check one row\n rowsum := 0;\n For col := n-1 downto 0 do\n Begin\n itm := Mq[row,col];\n write(itm:4);\n inc(rowsum,itm);\n //sum up the columns too, for I'm just here\n inc(colSum[col],itm);\n end;\n writeln;\n result := (rowsum=mn);\n IF Not(result) then begin writeln(row:4,col:4,rowsum:10);EXIT;end;\n end;\n //check columns\n For col := n-1 downto 0 do\n Begin\n result := (colSum[col]=mn);\n IF Not(result) then begin writeln(col:4,colSum[col]:10);EXIT;end;\n end;\n writeln;\nend;\n\n\nvar\n n,mn : nativeInt;\n Mq : tsquare;\nBegin\n randomize;\n n := 9;\n mn := n*(n*n+1) DIV 2;\n WRITELN('The square order is: ',n);\n WRITELN('The magic number is: ',mn);\n Mq := MagicSqrOdd(n,random(2)=0);\n writeln(MagicSqrCheck(Mq));\nend.\n","language":"Pascal"},{"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;\">magic_square</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;\">if</span> <span style=\"color: #7060A8;\">mod</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;\">1</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">false</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">square</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: #000000;\">0</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: #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: #000000;\">square</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: #0000FF;\">=</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #7060A8;\">mod</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;\">j</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: #0000FF;\">+</span> <span style=\"color: #7060A8;\">mod</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;\">j</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: #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: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">square</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;\">check</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">sq</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: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">magic</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;\">n</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: #004080;\">integer</span> <span style=\"color: #000000;\">bd</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">fd</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;\">sq</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])!=</span><span style=\"color: #000000;\">magic</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;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">columnize</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">))!=</span><span style=\"color: #000000;\">magic</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: #000000;\">bd</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">sq</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>\n <span style=\"color: #000000;\">fd</span> <span style=\"color: #0000FF;\">+=</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;\">i</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;\">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: #008080;\">if</span> <span style=\"color: #000000;\">bd</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">magic</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">fd</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">magic</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;\">procedure</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;\">7</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">square</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">magic_square</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;\">\"maqic square of order %d, sum: %d\\n\"</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: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">square</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])})</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">fmt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%%%dd\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</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;\">i</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">)))</span>\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">square</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_IntFmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">fmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">pp_StrFmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</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><span style=\"color: #004600;\">pp_Pause</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">check</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">square</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"import util.\n\ngo =>\n foreach(N in [3,5,17])\n M=magic_square(N),\n print_matrix(M),\n check(M),\n nl\n end,\n nl.\n\n%\n% Not as nice as the J solution.\n% But I like the chaining of the functions.\n%\nmagic_square(N) = MS =>\n if N mod 2 = 0 then\n printf(\"N (%d) is not odd!\\n\", N),\n halt\n end,\n R = make_rotate_list(N), % the rotate indices\n MS = make_square(N).transpose().rotate_matrix(R).transpose().rotate_matrix(R).\n\n%\n% make a square matrix of size N (containing the numbers 1..N*N)\n%\nmake_square(N) = [[I*N+J : J in 1..N]: I in 0..N-1].\n\n%\n% rotate list:\n% rotate_list(11) = [-5,-4,-3,-2,-1,0,1,2,3,4,5]\n%\nmake_rotate_list(N) = [I - ceiling(N / 2) : I in 1..N].\n\n%\n% rotate the matrix M according to rotate list R\n%\nrotate_matrix(M, R) = [rotate_n(Row,N) : {Row,N} in zip(M,R)].\n\n%\n% Rotate the list L N steps (either positive or negative N)\n% rotate(1..10,3) -> [4,5,6,7,8,9,10,1,2,3]\n% rotate(1..10,-3) -> [8,9,10,1,2,3,4,5,6,7]\n%\nrotate_n(L,N) = Rot =>\n Len = L.length,\n R = cond(N < 0, Len + N, N),\n Rot = [L[I] : I in (R+1..Len) ++ 1..R].\n\n%\n% Check if M is a magic square\n%\ncheck(M) =>\n N = M.length,\n Sum = N*(N*N+1) // 2, % The correct sum.\n println(sum=Sum),\n Rows = [sum(Row) : Row in M],\n Cols = [sum(Col) : Col in M.transpose()],\n Diag1 = sum([M[I,I] : I in 1..N]),\n Diag2 = sum([M[I,N-I+1] : I in 1..N]),\n All = Rows ++ Cols ++ [Diag1, Diag2],\n OK = true,\n foreach(X in All)\n if X != Sum then\n printf(\"%d != %d\\n\", X, Sum),\n OK := false\n end\n end,\n if OK then\n println(ok)\n else\n println(not_ok)\n end,\n nl.\n\n% Print the matrix\nprint_matrix(M) =>\n N = M.len,\n printf(\"N=%d\\n\",N),\n Format = to_fstring(\"%%%dd\",max(flatten(M)).to_string().length+1),\n foreach(Row in M)\n foreach(X in Row)\n printf(Format, X)\n end,\n nl\n end,\n nl.\n","language":"Picat"},{"code":"go2 =>\n N = 313,\n M = magic_square(N),\n check(M),\n nl.\n","language":"Picat"},{"code":"(load \"@lib/simul.l\")\n(de magic (A)\n (let\n (Grid (grid A A T T)\n Sum (/ (* A (inc (** A 2))) 2))\n (println 'N A 'Sum Sum)\n # cut one important edge\n (with (last (last Grid)) (con (: 0 1)))\n (with (get Grid (inc (/ A 2)) A)\n (for N (* A A)\n (=: V N)\n (setq This\n (if\n (with (setq @@ (north (east This)))\n (not (: V)) )\n @@\n (south This) ) ) ) )\n # display\n (mapc\n '((L)\n (for This L\n (prin (align 4 (: V))) )\n (prinl) )\n Grid )\n # clean\n (mapc '((L) (mapc zap L)) Grid) ) )\n(magic 5)\n(prinl)\n(magic 7)\n","language":"PicoLisp"},{"code":"magic: procedure options (main); /* 18 April 2014 */\n declare n fixed binary;\n\n put skip list ('What is the order of the magic square?');\n get list (n);\n if n < 3 | iand(n, 1) = 0 then\n do; put skip list ('The value is out of range'); stop; end;\n put skip list ('The order is ' || trim(n));\n\n begin;\n declare m(n, n) fixed, (i, j, k) fixed binary;\n\n on subrg snap put data (i, j, k);\n m = 0;\n i = 1; j = (n+1)/2;\n\n do k = 1 to n*n;\n if m(i,j) = 0 then\n m(i,j) = k;\n else\n do;\n i = i + 2; j = j + 1;\n if i > n then i = mod(i,n);\n if j > n then j = 1;\n m(i,j) = k;\n end;\n i = i - 1; j = j - 1;\n if i < 1 then i = n;\n if j < 1 then j = n;\n end;\n\n do i = 1 to n;\n put skip edit (m(i, *)) (f(4));\n end;\n\n put skip list ('The magic number is' || sum(m(1,*)));\n end;\nend magic;\n","language":"PL-I"},{"code":"#N=9\nDefine.i i,j\n\nIf OpenConsole(\"Magic squares\")\n PrintN(\"The square order is: \"+Str(#N))\n For i=1 To #N\n For j=1 To #N\n Print(RSet(Str((i*2-j+#N-1) % #N*#N + (i*2+j-2) % #N+1),5))\n Next\n PrintN(\"\")\n Next\n PrintN(\"The magic number is: \"+Str(#N*(#N*#N+1)/2))\nEndIf\nInput()\n","language":"PureBasic"},{"code":">>> def magic(n):\n for row in range(1, n + 1):\n print(' '.join('%*i' % (len(str(n**2)), cell) for cell in\n (n * ((row + col - 1 + n // 2) % n) +\n ((row + 2 * col - 2) % n) + 1\n for col in range(1, n + 1))))\n print('\\nAll sum to magic number %i' % ((n * n + 1) * n // 2))\n\n\n>>> for n in (5, 3, 7):\n\tprint('\\nOrder %i\\n=======' % n)\n\tmagic(n)\n\n\t\n\nOrder 5\n=======\n17 24 1 8 15\n23 5 7 14 16\n 4 6 13 20 22\n10 12 19 21 3\n11 18 25 2 9\n\nAll sum to magic number 65\n\nOrder 3\n=======\n8 1 6\n3 5 7\n4 9 2\n\nAll sum to magic number 15\n\nOrder 7\n=======\n30 39 48 1 10 19 28\n38 47 7 9 18 27 29\n46 6 8 17 26 35 37\n 5 14 16 25 34 36 45\n13 15 24 33 42 44 4\n21 23 32 41 43 3 12\n22 31 40 49 2 11 20\n\nAll sum to magic number 175\n>>>\n","language":"Python"},{"code":"'''Magic squares of odd order N'''\n\nfrom itertools import cycle, islice, repeat\nfrom functools import reduce\n\n\n# magicSquare :: Int -> [[Int]]\ndef magicSquare(n):\n '''Magic square of odd order n.'''\n return applyN(2)(\n compose(transposed)(cycled)\n )(plainSquare(n)) if 1 == n % 2 else []\n\n\n# plainSquare :: Int -> [[Int]]\ndef plainSquare(n):\n '''The sequence of integers from 1 to N^2,\n subdivided into N sub-lists of equal length,\n forming N rows, each of N integers.\n '''\n return chunksOf(n)(\n enumFromTo(1)(n ** 2)\n )\n\n\n# cycled :: [[Int]] -> [[Int]]\ndef cycled(rows):\n '''A table in which the rows are\n rotated by descending deltas.\n '''\n n = len(rows)\n d = n // 2\n return list(map(\n lambda d, xs: take(n)(\n drop(n - d)(cycle(xs))\n ),\n enumFromThenTo(d)(d - 1)(-d),\n rows\n ))\n\n\n# TEST ----------------------------------------------------\n# main :: IO ()\ndef main():\n '''Magic squares of order 3, 5, 7'''\n print(\n fTable(__doc__ + ':')(lambda x: '\\n' + repr(x))(\n showSquare\n )(magicSquare)([3, 5, 7])\n )\n\n\n# GENERIC -------------------------------------------------\n\n# applyN :: Int -> (a -> a) -> a -> a\ndef applyN(n):\n '''n applications of f.\n (Church numeral n).\n '''\n def go(f):\n return lambda x: reduce(\n lambda a, g: g(a), repeat(f, n), x\n )\n return lambda f: go(f)\n\n\n# chunksOf :: Int -> [a] -> [[a]]\ndef chunksOf(n):\n '''A series of lists of length n,\n subdividing the contents of xs.\n Where the length of xs is not evenly divible,\n the final list will be shorter than 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# compose (<<<) :: (b -> c) -> (a -> b) -> a -> c\ndef compose(g):\n '''Right to left function composition.'''\n return lambda f: lambda x: g(f(x))\n\n\n# drop :: Int -> [a] -> [a]\n# drop :: Int -> String -> String\ndef drop(n):\n '''The sublist of xs beginning at\n (zero-based) index n.'''\n def go(xs):\n if isinstance(xs, (list, tuple, str)):\n return xs[n:]\n else:\n take(n)(xs)\n return xs\n return lambda xs: go(xs)\n\n\n# enumFromThenTo :: Int -> Int -> Int -> [Int]\ndef enumFromThenTo(m):\n '''Integer values enumerated from m to n\n with a step defined by nxt-m.\n '''\n def go(nxt, n):\n d = nxt - m\n return range(m, n - 1 if d < 0 else 1 + n, d)\n return lambda nxt: lambda n: list(go(nxt, n))\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# 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 return lambda xs: (\n xs[0:n]\n if isinstance(xs, (list, tuple))\n else list(islice(xs, n))\n )\n\n\n# transposed :: Matrix a -> Matrix a\ndef transposed(m):\n '''The rows and columns of the argument transposed.\n (The matrix containers and rows can be lists or tuples).\n '''\n if m:\n inner = type(m[0])\n z = zip(*m)\n return (type(m))(\n map(inner, z) if tuple != inner else z\n )\n else:\n return m\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# indented :: Int -> String -> String\ndef indented(n):\n '''String indented by n multiples\n of four spaces\n '''\n return lambda s: (n * 4 * ' ') + s\n\n\n# showSquare :: [[Int]] -> String\ndef showSquare(rows):\n '''Lines representing rows of lists.'''\n w = 1 + len(str(reduce(max, map(max, rows), 0)))\n return '\\n' + '\\n'.join(\n map(\n lambda row: indented(1)(''.join(\n map(lambda x: str(x).rjust(w, ' '), row)\n )),\n rows\n )\n )\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"_Title \"Magic Squares of Odd Order\"\n'$Dynamic\nDefLng A-Z\nDim Shared As Long m(1, 1)\n\nCall magicSquare(5)\nCall magicSquare(15)\n\nSleep\nSystem\n\nSub magicSquare (n As Integer)\n Dim As Integer inc, count, row, col\n\n If (n < 3) Or (n And 1) <> 1 Then n = 3\n ReDim m(n, n)\n inc = 1\n count = 1\n row = 1\n col = (n + 1) / 2\n While count <= n * n\n m(row, col) = count\n count = count + 1\n If inc < n Then\n inc = inc + 1\n row = row - 1\n col = col + 1\n If row <> 0 Then\n If col > n Then col = 1\n Else\n row = n\n End If\n Else\n inc = 1\n row = row + 1\n End If\n Wend\n Call printSquare(n)\nEnd Sub\n\nSub printSquare (n As Integer)\n Dim As Integer row, col\n 'Arbitrary limit ensures a fit within console window\n 'Can be any size that fits within your computers memory limits\n If n < 21 Then\n Print \"Order \"; n; \" Magic Square constant is \"; Str$(Int((n * n + 1) / 2 * n))\n For row = 1 To n\n For col = 1 To n\n Print Using \"####\"; m(row, col);\n Next col\n Print\n ' Print\n Next row\n End If\nEnd Sub\n","language":"QB64"},{"code":"#lang racket\n;; Using \"helpful formulae\" in:\n;; http://en.wikipedia.org/wiki/Magic_square#Method_for_constructing_a_magic_square_of_odd_order\n(define (squares n) n)\n\n(define (last-no n) (sqr n))\n\n(define (middle-no n) (/ (add1 (sqr n)) 2))\n\n(define (M n) (* n (middle-no n)))\n\n(define ((Ith-row-Jth-col n) I J)\n (+ (* (modulo (+ I J -1 (exact-floor (/ n 2))) n) n)\n (modulo (+ I (* 2 J) -2) n)\n 1))\n\n(define (magic-square n)\n (define IrJc (Ith-row-Jth-col n))\n (for/list ((I (in-range 1 (add1 n)))) (for/list ((J (in-range 1 (add1 n)))) (IrJc I J))))\n\n(define (fmt-list-of-lists l-o-l width)\n (string-join\n (for/list ((row l-o-l))\n (string-join (map (λ (x) (~a #:align 'right #:width width x)) row) \" \"))\n \"\\n\"))\n\n(define (show-magic-square n)\n (format \"MAGIC SQUARE ORDER:~a~%~a~%MAGIC NUMBER:~a~%\"\n n (fmt-list-of-lists (magic-square n) (+ (order-of-magnitude (last-no n)) 1)) (M n)))\n\n(displayln (show-magic-square 3))\n(displayln (show-magic-square 5))\n(displayln (show-magic-square 9))\n","language":"Racket"},{"code":"/*REXX program generates and displays magic squares (odd N will be a true magic square).*/\nparse arg N . /*obtain the optional argument from CL.*/\nif N=='' | N==\",\" then N=5 /*Not specified? Then use the default.*/\nNN=N*N; w=length(NN) /*W: width of largest number (output).*/\nr=1; c=(n+1) % 2 /*define the initial row and column.*/\n@.=. /*assign a default value for entire @.*/\n do j=1 for NN /* [↓] filling uses the Siamese method*/\n if r<1 & c>N then do; r=r+2; c=c-1; end /*the row is under, column is over.*/\n if r<1 then r=N /* \" \" \" \" make row=last. */\n if r>N then r=1 /* \" \" \" over, \" \" first.*/\n if c>N then c=1 /* \" column \" over, \" col=first.*/\n if @.r.c\\==. then do; r=min(N,r+2); c=max(1,c-1); end /*at the previous cell? */\n @.r.c=j; r=r-1; c=c+1 /*assign # ───► cell; next row & column*/\n end /*j*/\n /* [↓] display square with aligned #'s*/\n do r=1 for N; _= /*display one matrix row at a time. */\n do c=1 for N; _=_ right(@.r.c, w) /*construct a row of the magic square. */\n end /*c*/\n say substr(_, 2) /*display a row of the magic square. */\n end /*r*/\nsay /* [↓] If an odd square, show magic #.*/\nif N//2 then say 'The magic number (or magic constant is): ' N * (NN+1) % 2\n /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"n=9\nsee \"the square order is : \" + n + nl\nfor i=1 to n\n for j = 1 to n\n x = (i*2-j+n-1) % n*n + (i*2+j-2) % n + 1\n see \"\" + x + \" \"\n next\n see nl\nnext\nsee \"the magic number is : \" + n*(n*n+1) / 2 + nl\n","language":"Ring"},{"code":"def odd_magic_square(n)\n raise ArgumentError \"Need odd positive number\" if n.even? || n <= 0\n n.times.map{|i| n.times.map{|j| n*((i+j+1+n/2)%n) + ((i+2*j-5)%n) + 1} }\nend\n\n[3, 5, 9].each do |n|\n puts \"\\nSize #{n}, magic sum #{(n*n+1)/2*n}\"\n fmt = \"%#{(n*n).to_s.size + 1}d\" * n\n odd_magic_square(n).each{|row| puts fmt % row}\nend\n","language":"Ruby"},{"code":"fn main() {\n let n = 9;\n let mut square = vec![vec![0; n]; n];\n for (i, row) in square.iter_mut().enumerate() {\n for (j, e) in row.iter_mut().enumerate() {\n *e = n * (((i + 1) + (j + 1) - 1 + (n >> 1)) % n) + (((i + 1) + (2 * (j + 1)) - 2) % n) + 1;\n print!(\"{:3} \", e);\n }\n println!(\"\");\n }\n let sum = n * (((n * n) + 1) / 2);\n println!(\"The sum of the square is {}.\", sum);\n}\n","language":"Rust"},{"code":" def magicSquare( n:Int ) : Option[Array[Array[Int]]] = {\n require(n % 2 != 0, \"n must be an odd number\")\n\n val a = Array.ofDim[Int](n,n)\n\n // Make the horizontal by starting in the middle of the row and then taking a step back every n steps\n val ii = Iterator.continually(0 to n-1).flatten.drop(n/2).sliding(n,n-1).take(n*n*2).toList.flatten\n\n // Make the vertical component by moving up (subtracting 1) but every n-th step, step down (add 1)\n val jj = Iterator.continually(n-1 to 0 by -1).flatten.drop(n-1).sliding(n,n-2).take(n*n*2).toList.flatten\n\n // Combine the horizontal and vertical components to create the path\n val path = (ii zip jj) take (n*n)\n\n // Fill the array by following the path\n for( i<-1 to (n*n); p=path(i-1) ) { a(p._1)(p._2) = i }\n\n Some(a)\n }\n\n def output() : Unit = {\n def printMagicSquare(n: Int): Unit = {\n\n val ms = magicSquare(n)\n val magicsum = (n * n + 1) / 2\n\n assert(\n if( ms.isDefined ) {\n val a = ms.get\n a.forall(_.sum == magicsum) &&\n a.transpose.forall(_.sum == magicsum) &&\n (for(i<-0 until n) yield { a(i)(i) }).sum == magicsum\n }\n else { false }\n )\n\n if( ms.isDefined ) {\n val a = ms.get\n for (y <- 0 to n * 2; x <- 0 until n) (x, y) match {\n case (0, 0) => print(\"╔════╤\")\n case (i, 0) if i == n - 1 => print(\"════╗\\n\")\n case (i, 0) => print(\"════╤\")\n\n case (0, j) if j % 2 != 0 => print(\"║ \" + f\"${ a(0)((j - 1) / 2) }%2d\" + \" │\")\n case (i, j) if j % 2 != 0 && i == n - 1 => print(\" \" + f\"${ a(i)((j - 1) / 2) }%2d\" + \" ║\\n\")\n case (i, j) if j % 2 != 0 => print(\" \" + f\"${ a(i)((j - 1) / 2) }%2d\" + \" │\")\n\n case (0, j) if j == (n * 2) => print(\"╚════╧\")\n case (i, j) if j == (n * 2) && i == n - 1 => print(\"════╝\\n\")\n case (i, j) if j == (n * 2) => print(\"════╧\")\n\n case (0, _) => print(\"╟────┼\")\n case (i, _) if i == n - 1 => print(\"────╢\\n\")\n case (i, _) => print(\"────┼\")\n }\n }\n }\n\n printMagicSquare(7)\n }\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n\nconst func integer: succ (in integer: num, in integer: max) is\n return succ(num mod max);\n\nconst func integer: pred (in integer: num, in integer: max) is\n return succ((num - 2) mod max);\n\nconst proc: main is func\n local\n var integer: size is 3;\n var array array integer: magic is 0 times 0 times 0;\n var integer: row is 1;\n var integer: column is 1;\n var integer: number is 0;\n begin\n if length(argv(PROGRAM)) >= 1 then\n size := integer parse (argv(PROGRAM)[1]);\n end if;\n magic := size times size times 0;\n column := succ(size div 2);\n for number range 1 to size ** 2 do\n magic[row][column] := number;\n if magic[pred(row, size)][succ(column, size)] = 0 then\n row := pred(row, size);\n column := succ(column, size);\n else\n row := succ(row, size);\n end if;\n end for;\n for key row range magic do\n for key column range magic[row] do\n write(magic[row][column] lpad 4);\n end for;\n writeln;\n end for;\n end func;\n","language":"Seed7"},{"code":"func magic_square(n {.is_pos && .is_odd}) {\n var i = 0\n var j = idiv(n, 2)\n\n var magic_square = []\n for l in (1 .. n**2) {\n magic_square[i][j] = l\n\n if (magic_square[i.dec % n][j.inc % n]) {\n i = (i.inc % n)\n }\n else {\n i = (i.dec % n)\n j = (j.inc % n)\n }\n }\n\n return magic_square\n}\n\nfunc print_square(sq) {\n var f = \"%#{(sq.len**2).len}d\";\n for row in sq {\n say row.map{ f % _ }.join(' ')\n }\n}\n\nvar(n=5) = ARGV»to_i()»...\nvar sq = magic_square(n)\nprint_square(sq)\n\nsay \"\\nThe magic number is: #{sq[0].sum}\"\n","language":"Sidef"},{"code":"extension String: Error {}\n\nstruct Point: CustomStringConvertible {\n var x: Int\n var y: Int\n\n init(_ _x: Int,\n _ _y: Int) {\n self.x = _x\n self.y = _y\n }\n\n var description: String {\n return \"(\\(x), \\(y))\\n\"\n }\n}\n\nextension Point: Equatable,Comparable {\n static func == (lhs: Point, rhs: Point) -> Bool {\n return lhs.x == rhs.x && lhs.y == rhs.y\n }\n static func < (lhs: Point, rhs: Point) -> Bool {\n return lhs.y != rhs.y ? lhs.y < rhs.y : lhs.x < rhs.x\n }\n}\n\nclass MagicSquare: CustomStringConvertible {\n var grid:[Int:Point] = [:]\n var number: Int = 1\n init(base n:Int) {\n grid = [:]\n number = n\n }\n\n func createOdd() throws -> MagicSquare {\n guard number < 1 || number % 2 != 0 else {\n throw \"Must be odd and >= 1, try again\"\n return self\n }\n var x = 0\n var y = 0\n let middle = Int(number/2)\n x = middle\n grid[1] = Point(x,y)\n for i in 2 ... number*number {\n let oldXY = Point(x,y)\n x += 1\n y -= 1\n\n if x >= number {x -= number}\n if y < 0 {y += number}\n\n var tempCoord = Point(x,y)\n if let _ = grid.firstIndex(where: { (k,v) -> Bool in\n v == tempCoord\n })\n {\n x = oldXY.x\n y = oldXY.y + 1\n if y >= number {y -= number}\n tempCoord = Point(x,y)\n }\n grid[i] = tempCoord\n }\n print(self)\n return self\n }\n\n fileprivate func gridToText(_ result: inout String) {\n let sorted = sortedGrid()\n let sc = sorted.count\n var i = 0\n for c in sorted {\n result += \" \\(c.key)\"\n if c.key < 10 && sc > 10 { result += \" \"}\n if c.key < 100 && sc > 100 { result += \" \"}\n if c.key < 1000 && sc > 1000 { result += \" \"}\n if i%number==(number-1) { result += \"\\n\"}\n i += 1\n }\n result += \"\\nThe magic number is \\(number * (number * number + 1) / 2)\"\n result += \"\\nRows and Columns are \"\n\n result += checkRows() == checkColumns() ? \"Equal\" : \" Not Equal!\"\n result += \"\\nRows and Columns and Diagonals are \"\n let allEqual = (checkDiagonals() == checkColumns() && checkDiagonals() == checkRows())\n result += allEqual ? \"Equal\" : \" Not Equal!\"\n result += \"\\n\"\n }\n\n var description: String {\n var result = \"base \\(number)\\n\"\n gridToText(&result)\n return result\n }\n}\n\nextension MagicSquare {\n private func sortedGrid()->[(key:Int,value:Point)] {\n return grid.sorted(by: {$0.1 < $1.1})\n }\n\n private func checkRows() -> (Bool, Int?)\n {\n var result = Set<Int>()\n var index = 0\n var rowtotal = 0\n for (cell, _) in sortedGrid()\n {\n rowtotal += cell\n if index%number==(number-1)\n {\n result.insert(rowtotal)\n rowtotal = 0\n }\n index += 1\n }\n return (result.count == 1, result.first ?? nil)\n }\n\n private func checkColumns() -> (Bool, Int?)\n {\n var result = Set<Int>()\n var sorted = sortedGrid()\n for i in 0 ..< number {\n var rowtotal = 0\n for cell in stride(from: i, to: sorted.count, by: number) {\n rowtotal += sorted[cell].key\n }\n result.insert(rowtotal)\n }\n return (result.count == 1, result.first)\n }\n\n private func checkDiagonals() -> (Bool, Int?)\n {\n var result = Set<Int>()\n var sorted = sortedGrid()\n\n var rowtotal = 0\n for cell in stride(from: 0, to: sorted.count, by: number+1) {\n rowtotal += sorted[cell].key\n }\n result.insert(rowtotal)\n rowtotal = 0\n for cell in stride(from: number-1, to: sorted.count-(number-1), by: number-1) {\n rowtotal += sorted[cell].key\n }\n result.insert(rowtotal)\n\n return (result.count == 1, result.first)\n }\n}\n\ntry MagicSquare(base: 3).createOdd()\ntry MagicSquare(base: 5).createOdd()\ntry MagicSquare(base: 7).createOdd()\n","language":"Swift"},{"code":"proc magicSquare {order} {\n if {!($order & 1) || $order < 0} {\n\terror \"order must be odd and positive\"\n }\n set s [lrepeat $order [lrepeat $order 0]]\n set x [expr {$order / 2}]\n set y 0\n for {set i 1} {$i <= $order**2} {incr i} {\n\tlset s $y $x $i\n\tset x [expr {($x + 1) % $order}]\n\tset y [expr {($y - 1) % $order}]\n\tif {[lindex $s $y $x]} {\n\t set x [expr {($x - 1) % $order}]\n\t set y [expr {($y + 2) % $order}]\n\t}\n }\n return $s\n}\n","language":"Tcl"},{"code":"package require Tcl 8.6\n\nset square [magicSquare 5]\nputs [join [lmap row $square {join [lmap n $row {format \"%2s\" $n}]}] \"\\n\"]\nputs \"magic number = [tcl::mathop::+ {*}[lindex $square 0]]\"\n","language":"Tcl"},{"code":"9→N\nDelVar [A]:{N,N}→dim([A])\nFor(I,1,N)\nFor(J,1,N)\nRemainder(I*2-J+N-1,N)*N+Remainder(I*2+J-2,N)+1→[A](I,J)\nEnd\nEnd\n[A]\n","language":"TI-83-BASIC"},{"code":"Sub magicsquare()\n 'Magic squares of odd order\n Const n = 9\n Dim i As Integer, j As Integer, v As Integer\n Debug.Print \"The square order is: \" & n\n For i = 1 To n\n For j = 1 To n\n Cells(i, j) = ((i * 2 - j + n - 1) Mod n) * n + ((i * 2 + j - 2) Mod n) + 1\n Next j\n Next i\n Debug.Print \"The magic number of\"; n; \"x\"; n; \"square is:\"; n * (n * n + 1) \\ 2\nEnd Sub 'magicsquare\n","language":"VBA"},{"code":"Sub magic_square(n)\n\tDim ms()\n\tReDim ms(n-1,n-1)\n\tinc = 0\n\tcount = 1\n\trow = 0\n\tcol = Int(n/2)\n\tDo While count <= n*n\n\t\tms(row,col) = count\n\t\tcount = count + 1\n\t\tIf inc < n-1 Then\n\t\t\tinc = inc + 1\n\t\t\trow = row - 1\n\t\t\tcol = col + 1\n\t\t\tIf row >= 0 Then\n\t\t\t\tIf col > n-1 Then\n\t\t\t\t\tcol = 0\n\t\t\t\tEnd If\n\t\t\tElse\n\t\t\t\trow = n-1\n\t\t\tEnd If\n\t\tElse\n\t\t\tinc = 0\n\t\t\trow = row + 1\n\t\tEnd If\n\tLoop\n\tFor i = 0 To n-1\n\t\tFor j = 0 To n-1\n\t\t\tIf j = n-1 Then\n\t\t\t\tWScript.StdOut.Write ms(i,j)\n\t\t\tElse\n\t\t\t\tWScript.StdOut.Write ms(i,j) & vbTab\n\t\t\tEnd If\n\t\tNext\n\t\tWScript.StdOut.WriteLine\n\tNext\nEnd Sub\n\nmagic_square(5)\n","language":"VBScript"},{"code":"Sub magicsquare()\n 'Magic squares of odd order\n Const n = 9\n Dim i As Integer, j As Integer, v As Integer\n Debug.Print \"The square order is: \" & n\n For i = 1 To n\n For j = 1 To n\n v = ((i * 2 - j + n - 1) Mod n) * n + ((i * 2 + j - 2) Mod n) + 1\n Debug.Print Right(Space(5) & v, 5);\n Next j\n Debug.Print\n Next i\n Debug.Print \"The magic number is: \" & n * (n * n + 1) \\ 2\nEnd Sub 'magicsquare\n","language":"Visual-Basic"},{"code":"Sub magicsquare()\n 'Magic squares of odd order\n Const n = 9\n Dim i, j, v As Integer\n Console.WriteLine(\"The square order is: \" & n)\n For i = 1 To n\n For j = 1 To n\n v = ((i * 2 - j + n - 1) Mod n) * n + ((i * 2 + j - 2) Mod n) + 1\n Console.Write(\" \" & Right(Space(5) & v, 5))\n Next j\n Console.WriteLine(\"\")\n Next i\n Console.WriteLine(\"The magic number is: \" & n * (n * n + 1) \\ 2)\nEnd Sub 'magicsquare\n","language":"Visual-Basic-.NET"},{"code":"10 N=1\n20 ?=\"Magic square of order \";\n30 ?=N\n40 ?=\" with constant \";\n50 ?=N*N+1/2*N\n60 ?=\":\"\n70 Y=0\n80 X=0\n90 ?=Y*2+N-X/N*0+%*N+(Y*2+X+1/N*0+%+1\n100 $=9\n110 X=X+1\n120 #=X<N*90\n130 ?=\"\"\n140 Y=Y+1\n150 #=Y<N*80\n160 ?=\"\"\n170 N=N+2\n180 #=7>N*20\n","language":"VTL-2"},{"code":"import \"./fmt\" for Fmt\n\nvar ms = Fn.new { |n|\n var M = Fn.new { |x| (x + n - 1) % n }\n if (n <= 0 || n&1 == 0) {\n n = 5\n System.print(\"forcing size %(n)\")\n }\n var m = List.filled(n * n, 0)\n var i = 0\n var j = (n/2).floor\n for (k in 1..n*n) {\n m[i*n + j] = k\n if (m[M.call(i)*n + M.call(j)] != 0) {\n i = (i + 1) % n\n } else {\n i = M.call(i)\n j = M.call(j)\n }\n }\n return [n, m]\n}\n\nvar res = ms.call(5)\nvar n = res[0]\nvar m = res[1]\nfor (i in 0...n) {\n for (j in 0...n) Fmt.write(\"$4d\", m[i*n+j])\n System.print()\n}\nSystem.print(\"\\nMagic number : %(((n*n + 1)/2).floor * n)\")\n","language":"Wren"},{"code":" \\Construct a magic square of odd order - as a procedure can't return an\n \\ array, the caller must supply one that is big enough.\n function MagicSquare( Square, Order );\n integer Square, Order;\n integer Row, Col, I, J;\n\n \\Ensure a row/col position is on the square\n function InSquare; int Pos ;\n return if Pos < 1 then Order else if Pos > Order then 1 else Pos;\n\n \\move \"up\" a row in the square\n function Up; int Row; return InSquare( Row - 1 );\n\n \\move \"across right\" in the square\n function Right; int Col ; return InSquare( Col + 1 );\n\n if (Order&1) = 0 or Order < 1 then begin\n \\can't make a magic square of the specified order\n return false\n end\n else begin\n \\Order is OK - construct the square using de la Loubere's\n \\ algorithm as in the Wikipedia page\n\n \\initialise square\n for I := 1 to Order do for J := 1 to Order do Square( I, J ) := 0;\n\n \\initial position is the middle of the top row\n Col := ( Order + 1 ) / 2;\n Row := 1;\n \\construct square\n for I := 1 to ( Order * Order ) do begin\n Square( Row, Col ) := I;\n if Square( Up( Row ), Right( Col ) ) # 0 then begin\n \\the up/right position is already taken, move down\n Row := Row + 1;\n end\n else begin\n \\can move up/right\n Row := Up( Row );\n Col := Right( Col );\n end\n end; \\for_i\n \\sucessful result\n return true\n end; \\magicSquare\n\n \\prints the magic square\n procedure PrintSquare( Square, Order );\n integer Square, Order;\n integer Sum, W, I_W, I, J;\n begin\n \\set integer width to accomodate the largest number in the square\n W := ( Order * Order ) / 10;\n I_W := 1;\n while W > 0 do begin I_W := I_W + 1; W := W / 10 end;\n Format(I_W+1, 0);\n Sum:= 0;\n for I := 1 to Order do Sum := Sum + Square( 1, I );\n Text(0, \"maqic square of order \"); IntOut(0, Order);\n Text(0, \" : Sum: \"); IntOut(0, Sum );\n for I := 1 to Order do begin\n CrLf(0);\n RlOut(0, float(Square( I, 1 )) );\n for J := 2 to Order do RlOut(0, float(Square( I, J )) )\n end; \\for_I\n CrLf(0);\n end; \\printSquare\n\n \\test the magic square generation\n integer Sq ( 1+11, 1+11 ), L, I;\nbegin\n L:= [1, 3, 5, 7];\n for I := 0 to 3 do begin\n if MagicSquare( Sq, L(I) ) then PrintSquare( Sq, L(I) )\n else Text(0, \"can't generate square^m^j\" );\n end \\for_I\nend]\n","language":"XPL0"},{"code":"magicSquare(5)\nmagicSquare(17)\nend\n\nsub magicSquare(n)\n redim m(n,n)\n inc = 1\n cont = 1\n row = 1\n col = (n+1) / 2\n while cont <= n*n\n m(row,col) = cont\n cont = cont + 1\n if inc < n then\n inc = inc + 1\n row = row - 1\n col = col + 1\n if row <> 0 then\n if col > n col = 1\n else\n row = n\n end if\n else\n inc = 1\n row = row + 1\n end if\n end while\n printSquare(n)\nend sub\n\nsub printSquare(n)\n //Arbitrary limit to fit width of A4 paper\n if n < 23 then\n print \"\\n\", n, \" x \", n, \" Magic Square --- \";\n print \"Magic constant is \", int((n*n+1)/2*n)\n for row = 1 to n\n for col = 1 to n\n print m(row,col) using(\"####\");\n next col\n print\n next row\n else\n print \"Magic Square will not fit on one sheet of paper.\"\n end if\nend sub\n","language":"Yabasic"},{"code":"fcn rmod(n,m){ n=n%m; if (n<0) n+=m; n } // Ruby: -5%3-->1\nfcn odd_magic_square(n){ //-->list of n*n numbers, row order\n if (n.isEven or n <= 0) throw(Exception.ValueError(\"Need odd positive number\"));\n [[(i,j); n; n; '{ n*((i+j+1+n/2):rmod(_,n)) + ((i+2*j-5):rmod(_,n)) + 1 }]]\n}\n\nT(3, 5, 9).pump(Void,fcn(n){\n \"\\nSize %d, magic sum %d\".fmt(n,(n*n+1)/2*n).println();\n fmt := \"%%%dd\".fmt((n*n).toString().len() + 1) * n;\n odd_magic_square(n).pump(Console.println,T(Void.Read,n-1),fmt.fmt);\n});\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Magic_squares_of_odd_order\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"A magic square is an <big>'''NxN'''</big> square matrix whose numbers (usually integers) consist of consecutive numbers arranged so that the sum of each row and column, ''and'' both long (main) diagonals are equal to the same sum (which is called the ''magic number'' or ''magic constant''). \\n\\nThe numbers are usually (but not always) the first '''N'''<sup>2</sup> positive integers.\\n\\nA magic square whose rows and columns add up to a magic number but whose main diagonals do not, is known as a ''semimagic square''.\\n\\n{| class=\\\"wikitable\\\" style=\\\"float:right;border: 4px solid blue; background:lightgreen; color:black; margin-left:auto;margin-right:auto;text-align:center;width:15em;height:15em;table-layout:fixed;font-size:150%\\\"\\n|-\\n| <big><big>'''8'''</big></big> || <big><big>'''1'''</big></big> || <big><big>'''6'''</big></big>\\n|-\\n| <big><big>'''3'''</big></big> || <big><big>'''5'''</big></big> || <big><big>'''7'''</big></big>\\n|-\\n| <big><big>'''4'''</big></big> || <big><big>'''9'''</big></big> || <big><big>'''2'''</big></big>\\n|}\\n\\n\\n;Task\\nFor any odd '''N''', [[wp:Magic square#Method_for_constructing_a_magic_square_of_odd_order|generate a magic square]] with the integers ''' 1''' ──► '''N''', and show the results here. \\n\\nOptionally, show the ''magic number''. \\n\\nYou should demonstrate the generator by showing at least a magic square for '''N''' = '''5'''.\\n\\n\\n; Related tasks\\n* [[Magic squares of singly even order]]\\n* [[Magic squares of doubly even order]]<br><br>\\n\\n\\n; See also:\\n* MathWorld™ entry: [http://mathworld.wolfram.com/MagicSquare.html Magic_square] \\n* [http://www.1728.org/magicsq1.htm Odd Magic Squares (1728.org)]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F magic(n)\\n L(row) 1..n\\n print(((1..n).map(col -> @n * ((@row + col - 1 + @n I/ 2) % @n)\\n + ((@row + 2 * col - 2) % @n) + 1)).map(cell -> String(cell).rjust(String(@n ^ 2).len)).join(‘ ’))\\n print(\\\"\\\\nAll sum to magic number #.\\\".format((n * n + 1) * n I/ 2))\\n\\nL(n) (5, 3, 7)\\n print(\\\"\\\\nOrder #.\\\\n=======\\\".format(n))\\n magic(n)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Magic squares of odd order - 20/10/2015\\nMAGICS CSECT\\n USING MAGICS,R15 set base register\\n LA R6,1 i=1\\nLOOPI C R6,N do i=1 to n\\n BH ELOOPI\\n LR R8,R6 i\\n SLA R8,1 i*2\\n LA R9,PG pgi=@pg\\n LA R7,1 j=1\\nLOOPJ C R7,N do j=1 to n\\n BH ELOOPJ\\n LR R5,R8 i*2\\n SR R5,R7 -j\\n A R5,N +n\\n BCTR R5,0 -1\\n XR R4,R4 clear high reg\\n D R4,N /n\\n LR R5,R4 //n\\n M R4,N *n\\n LR R2,R5 (i*2-j+n-1)//n*n\\n LR R5,R8 i*2\\n AR R5,R7 -j\\n S R5,=F'2' -2\\n XR R4,R4 clear high reg\\n D R4,N /n\\n AR R2,R4 +(i*2+j-2)//n\\n LA R2,1(R2) +1\\n XDECO R2,PG+80 (i*2-j+n-1)//n*n+(i*2+j-2)//n+1\\n MVC 0(5,R9),PG+87 put in buffer\\n LA R9,5(R9) pgi=pgi+5\\n LA R7,1(R7) j=j+1\\n B LOOPJ\\nELOOPJ XPRNT PG,80\\n LA R6,1(R6) i=i+1\\n B LOOPI\\nELOOPI XR R15,R15 set return code\\n BR R14 return to caller\\nN DC F'9' <== input\\nPG DC CL92' ' buffer\\n YREGS\\n END MAGICS\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"with Ada.Text_IO, Ada.Command_Line;\\n\\nprocedure Magic_Square is\\n N: constant Positive := Positive'Value(Ada.Command_Line.Argument(1));\\n\\n subtype Constants is Natural range 1 .. N*N;\\n package CIO is new Ada.Text_IO.Integer_IO(Constants);\\n Undef: constant Natural := 0;\\n\\n subtype Index is Natural range 0 .. N-1;\\n function Inc(I: Index) return Index is (if I = N-1 then 0 else I+1);\\n function Dec(I: Index) return Index is (if I = 0 then N-1 else I-1);\\n\\n A: array(Index, Index) of Natural := (others => (others => Undef));\\n -- initially undefined; at the end holding the magic square\\n\\n X: Index := 0; Y: Index := N/2; -- start position for the algorithm\\nbegin\\n for I in Constants loop -- write 1, 2, ..., N*N into the magic array\\n A(X, Y) := I; -- write I into the magic array\\n if A(Dec(X), Inc(Y)) = Undef then\\n\\t X := Dec(X); Y := Inc(Y); -- go right-up\\n else\\n\\t X := Inc(X); -- go down\\n end if;\\n end loop;\\n\\n for Row in Index loop -- output the magic array\\n for Collumn in Index loop\\n\\t CIO.Put(A(Row, Collumn),\\n\\t\\t Width => (if N*N < 10 then 2 elsif N*N < 100 then 3 else 4));\\n end loop;\\n Ada.Text_IO.New_Line;\\n end loop;\\nend Magic_Square;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# construct a magic square of odd order #\\nPROC magic square = ( INT order ) [,]INT:\\n IF NOT ODD order OR order < 1\\n THEN\\n # can't make a magic square of the specified order #\\n LOC [ 1 : 0, 1 : 0 ]INT\\n ELSE\\n # order is OK - construct the square using de la Loubère's #\\n # algorithm as in the wikipedia page #\\n\\n [ 1 : order, 1 : order ]INT square;\\n FOR i TO order DO FOR j TO order DO square[ i, j ] := 0 OD OD;\\n\\n # as square [ 1, 1 ] if the top-left, moving \\\"up\\\" reduces the row #\\n # operator to advance \\\"up\\\" the square #\\n OP PREV = ( INT pos )INT: IF pos = 1 THEN order ELSE pos - 1 FI;\\n # operator to advance \\\"across right\\\" or \\\"down\\\" the square #\\n OP NEXT = ( INT pos )INT: ( pos MOD order ) + 1;\\n\\n # fill in the square, starting from the middle of the top row #\\n INT col := ( order + 1 ) OVER 2;\\n INT row := 1;\\n FOR i TO order * order DO\\n square[ row, col ] := i;\\n IF square[ PREV row, NEXT col ] /= 0\\n THEN\\n # the up/right position is already taken, move down #\\n row := NEXT row\\n ELSE\\n # can move up and right #\\n row := PREV row;\\n col := NEXT col\\n FI\\n OD;\\n\\n square\\n FI # magic square # ;\\n\\n# prints the magic square #\\nPROC print square = ( [,]INT square )VOID:\\n BEGIN\\n INT order = 1 UPB square;\\n # calculate print width: negative so a leading \\\"+\\\" is not printed #\\n INT width := -1;\\n INT mag := order * order;\\n WHILE mag >= 10 DO mag OVERAB 10; width MINUSAB 1 OD;\\n # calculate the \\\"magic sum\\\" #\\n INT sum := 0;\\n FOR i TO order DO sum +:= square[ 1, i ] OD;\\n # print the square #\\n print( ( \\\"maqic square of order \\\", whole( order, 0 ), \\\": sum: \\\", whole( sum, 0 ), newline ) );\\n FOR i TO order DO\\n FOR j TO order DO write( ( \\\" \\\", whole( square[ i, j ], width ) ) ) OD;\\n write( ( newline ) )\\n OD\\n END # print square # ;\\n\\n# test the magic square generation #\\nFOR order BY 2 TO 7 DO print square( magic square( order ) ) OD\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin\\n % construct a magic square of odd order - as a procedure can't return an %\\n % array, the caller must supply one that is big enough %\\n logical procedure magicSquare( integer array square ( *, * )\\n ; integer value order\\n ) ;\\n if not odd( order ) or order < 1 then begin\\n % can't make a magic square of the specified order %\\n false\\n end\\n else begin\\n % order is OK - construct the square using de la Loubère's %\\n % algorithm as in the wikipedia page %\\n\\n % ensure a row/col position is on the square %\\n integer procedure inSquare( integer value pos ) ;\\n if pos < 1 then order else if pos > order then 1 else pos;\\n % move \\\"up\\\" a row in the square %\\n integer procedure up ( integer value row ) ; inSquare( row - 1 );\\n % move \\\"accross right\\\" in the square %\\n integer procedure right( integer value col ) ; inSquare( col + 1 );\\n\\n integer row, col;\\n % initialise square %\\n for i := 1 until order do for j := 1 until order do square( i, j ) := 0;\\n\\n % initial position is the middle of the top row %\\n col := ( order + 1 ) div 2;\\n row := 1;\\n % construct square %\\n for i := 1 until ( order * order ) do begin\\n square( row, col ) := i;\\n if square( up( row ), right( col ) ) not = 0 then begin\\n % the up/right position is already taken, move down %\\n row := row + 1;\\n end\\n else begin\\n % can move up/right %\\n row := up( row );\\n col := right( col );\\n end\\n end for_i;\\n % sucessful result %\\n true\\n end magicSquare ;\\n\\n % prints the magic square %\\n procedure printSquare( integer array square ( *, * )\\n ; integer value order\\n ) ;\\n begin\\n integer sum, w;\\n\\n % set integer width to accomodate the largest number in the square %\\n w := ( order * order ) div 10;\\n i_w := s_w := 1;\\n while w > 0 do begin i_w := i_w + 1; w := w div 10 end;\\n\\n for i := 1 until order do sum := sum + square( 1, i );\\n write( \\\"maqic square of order \\\", order, \\\": sum: \\\", sum );\\n for i := 1 until order do begin\\n write( square( i, 1 ) );\\n for j := 2 until order do writeon( square( i, j ) )\\n end for_i\\n\\n end printSquare ;\\n\\n % test the magic square generation %\\n\\n integer array sq ( 1 :: 11, 1 :: 11 );\\n\\n for i := 1, 3, 5, 7 do begin\\n if magicSquare( sq, i ) then printSquare( sq, i )\\n else write( \\\"can't generate square\\\" );\\n end for_i\\n\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"magic←{⍵{+/1,(1 ⍺⍺)×⍺(⍺⍺|1+⊢+2×⊣)⍵,⍺⍺-⍵+1}/¨⎕IO-⍨⍳⍵ ⍵}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"---------------- MAGIC SQUARE OF ODD ORDER ---------------\\n\\n-- oddMagicSquare :: Int -> [[Int]]\\non oddMagicSquare(n)\\n if 0 < (n mod 2) then\\n cycleRows(transpose(cycleRows(table(n))))\\n else\\n missing value\\n end if\\nend oddMagicSquare\\n\\n\\n--------------------------- TEST -------------------------\\non run\\n -- Orders 3, 5, 11\\n\\n -- wikiTableMagic :: Int -> String\\n script wikiTableMagic\\n on |λ|(n)\\n formattedTable(oddMagicSquare(n))\\n end |λ|\\n end script\\n\\n intercalate(linefeed & linefeed, map(wikiTableMagic, {3, 5, 11}))\\nend run\\n\\n-- table :: Int -> [[Int]]\\non table(n)\\n set lstTop to enumFromTo(1, n)\\n\\n script cols\\n on |λ|(row)\\n script rows\\n on |λ|(x)\\n (row * n) + x\\n end |λ|\\n end script\\n\\n map(rows, lstTop)\\n end |λ|\\n end script\\n\\n map(cols, enumFromTo(0, n - 1))\\nend table\\n\\n-- cycleRows :: [[a]] -> [[a]]\\non cycleRows(lst)\\n script rotationRow\\n -- rotatedList :: [a] -> Int -> [a]\\n on rotatedList(lst, n)\\n if n = 0 then return lst\\n\\n set lng to length of lst\\n set m to (n + lng) mod lng\\n items -m thru -1 of lst & items 1 thru (lng - m) of lst\\n end rotatedList\\n\\n on |λ|(row, i)\\n rotatedList(row, (((length of row) + 1) div 2) - (i))\\n end |λ|\\n end script\\n\\n map(rotationRow, lst)\\nend cycleRows\\n\\n\\n-------------------- GENERIC FUNCTIONS -------------------\\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-- 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-- 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-- enumFromTo :: Int -> Int -> [Int]\\non enumFromTo(m, n)\\n if m > n then\\n set d to -1\\n else\\n set d to 1\\n end if\\n set lst to {}\\n repeat with i from m to n by d\\n set end of lst to i\\n end repeat\\n return lst\\nend enumFromTo\\n\\n-- splitOn :: Text -> Text -> [Text]\\non splitOn(strDelim, strMain)\\n set {dlm, my text item delimiters} to {my text item delimiters, strDelim}\\n set xs to text items of strMain\\n set my text item delimiters to dlm\\n return xs\\nend splitOn\\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\\n----------------------- WIKI DISPLAY ---------------------\\n\\n-- formattedTable :: [[Int]] -> String\\non formattedTable(lstTable)\\n set n to length of lstTable\\n set w to 2.5 * n\\n \\\"magic(\\\" & n & \\\")\\\" & linefeed & linefeed & wikiTable(lstTable, ¬\\n false, \\\"text-align:center;width:\\\" & ¬\\n w & \\\"em;height:\\\" & w & \\\"em;table-layout:fixed;\\\")\\nend formattedTable\\n\\n-- wikiTable :: [Text] -> Bool -> Text -> Text\\non wikiTable(xs, blnHdr, strStyle)\\n script wikiRows\\n on |λ|(lstRow, iRow)\\n set strDelim to cond(blnHdr and (iRow = 0), \\\"!\\\", \\\"|\\\")\\n set strDbl to strDelim & strDelim\\n linefeed & \\\"|-\\\" & linefeed & strDelim & space & ¬\\n intercalate(space & strDbl & space, lstRow)\\n end |λ|\\n end script\\n\\n linefeed & \\\"{| class=\\\\\\\"wikitable\\\\\\\" \\\" & ¬\\n cond(strStyle ≠ \\\"\\\", \\\"style=\\\\\\\"\\\" & strStyle & \\\"\\\\\\\"\\\", \\\"\\\") & ¬\\n intercalate(\\\"\\\", ¬\\n map(wikiRows, xs)) & linefeed & \\\"|}\\\" & linefeed\\nend wikiTable\\n\\n-- cond :: Bool -> a -> a -> a\\non cond(bool, f, g)\\n if bool then\\n f\\n else\\n g\\n end if\\nend cond\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \" 100 :\\n 110 REM MAGIC SQUARE OF ODD ORDER\\n 120 :\\n 130 DEF FN MOD(A) = A - INT (A / N) * N\\n 140 DEF FN NR(J) = FN MOD((J + 2 * I + 1))\\n 200 INPUT \\\"ENTER N: \\\";N\\n 210 IF N < 3 OR (N - INT (N / 2) * 2) = 0 GOTO 200\\n 220 FOR I = 0 TO (N - 1)\\n 230 FOR J = 0 TO (N - 1): HTAB 4 * (J + 1)\\n 240 PRINT N * FN NR(N - J - 1) + FN NR(J) + 1;\\n 250 NEXT J: PRINT\\n 260 NEXT I\\n 270 PRINT \\\"MAGIC CONSTANT: \\\";N * (N * N + 1) / 2\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"oddMagicSquare: function [n][\\n ensure -> and? odd? n\\n n >= 0\\n\\n map 1..n 'i [\\n map 1..n 'j [\\n (n * ((i + (j - 1) + n / 2) % n)) +\\n (((i - 2) + 2 * j) % n) + 1\\n ]\\n ]\\n]\\n\\nloop [3 5 7] 'n [\\n print [\\\"Size:\\\" n \\\", Magic sum:\\\" n*(1+n*n)/2 \\\"\\\\n\\\"]\\n loop oddMagicSquare n 'row [\\n loop row 'item [\\n prints pad to :string item 3\\n ]\\n print \\\"\\\"\\n ]\\n print \\\"\\\"\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"msgbox % OddMagicSquare(5)\\nmsgbox % OddMagicSquare(7)\\nreturn\\n\\nOddMagicSquare(oddN){\\n\\tsq := oddN**2\\n\\tobj := {}\\n\\tloop % oddN\\n\\t\\tobj[A_Index] := {} \\t; dis is row\\n\\tmid := Round((oddN+1)/2)\\n\\tsum := Round(sq*(sq+1)/2/oddN)\\n\\tobj[1][mid] := 1\\n\\tcR := 1 , cC := mid\\n\\tloop % sq-1\\n\\t{\\n\\t\\tdone := 0 , a := A_index+1\\n\\t\\twhile !done {\\n\\t\\t\\tnR := cR-1 , nC := cC+1\\n\\t\\t\\tif !nR\\n\\t\\t\\t\\tnR := oddN\\n\\t\\t\\tif (nC>oddN)\\n\\t\\t\\t\\tnC := 1\\n\\t\\t\\tif obj[nR][nC] \\t;filled\\n\\t\\t\\t\\tcR += 1\\n\\t\\t\\telse cR := nR , cC := nC\\n\\t\\t\\tif !obj[cR][cC]\\n\\t\\t\\t\\tobj[cR][cC] := a , done := 1\\n\\t\\t}\\n\\t}\\n\\n\\tstr := \\\"Magic Constant for \\\" oddN \\\"x\\\" oddN \\\" is \\\" sum \\\"`n\\\"\\n\\tfor k,v in obj\\n\\t{\\n\\t\\tfor k2,v2 in v\\n\\t\\t\\tstr .= \\\" \\\" v2\\n\\t\\tstr .= \\\"`n\\\"\\n\\t}\\n\\treturn str\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f MAGIC_SQUARES_OF_ODD_ORDER.AWK\\nBEGIN {\\n build(5)\\n build(3,1) # verify sum\\n build(7)\\n exit(0)\\n}\\nfunction build(n,check, arr,i,width,x,y) {\\n if (n !~ /^[0-9]*[13579]$/ || n < 3) {\\n printf(\\\"error: %s is invalid\\\\n\\\",n)\\n return\\n }\\n printf(\\\"\\\\nmagic constant for %dx%d is %d\\\\n\\\",n,n,(n*n+1)*n/2)\\n x = 0\\n y = int(n/2)\\n for (i=1; i<=(n*n); i++) {\\n arr[x,y] = i\\n if (arr[(x+n-1)%n,(y+n+1)%n]) {\\n x = (x+n+1) % n\\n }\\n else {\\n x = (x+n-1) % n\\n y = (y+n+1) % n\\n }\\n }\\n width = length(n*n)\\n for (x=0; x<n; x++) {\\n for (y=0; y<n; y++) {\\n printf(\\\"%*s \\\",width,arr[x,y])\\n }\\n printf(\\\"\\\\n\\\")\\n }\\n if (check) { verify(arr,n) }\\n}\\nfunction verify(arr,n, total,x,y) { # verify sum of each row, column and diagonal\\n print(\\\"\\\\nverify\\\")\\n# horizontal\\n for (x=0; x<n; x++) {\\n total = 0\\n for (y=0; y<n; y++) {\\n printf(\\\"%d \\\",arr[x,y])\\n total += arr[x,y]\\n }\\n printf(\\\"\\\\t: %d row %d\\\\n\\\",total,x+1)\\n }\\n# vertical\\n for (y=0; y<n; y++) {\\n total = 0\\n for (x=0; x<n; x++) {\\n printf(\\\"%d \\\",arr[x,y])\\n total += arr[x,y]\\n }\\n printf(\\\"\\\\t: %d column %d\\\\n\\\",total,y+1)\\n }\\n# left diagonal\\n total = 0\\n for (x=y=0; x<n; x++ y++) {\\n printf(\\\"%d \\\",arr[x,y])\\n total += arr[x,y]\\n }\\n printf(\\\"\\\\t: %d diagonal top left to bottom right\\\\n\\\",total)\\n# right diagonal\\n x = n - 1\\n total = 0\\n for (y=0; y<n; y++ x--) {\\n printf(\\\"%d \\\",arr[x,y])\\n total += arr[x,y]\\n }\\n printf(\\\"\\\\t: %d diagonal bottom left to top right\\\\n\\\",total)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"arraybase 1\\nglobal m\\n\\ncall magicSquare(5)\\ncall magicSquare(17)\\nend\\n\\nsubroutine magicSquare(n)\\n\\tredim m(n,n)\\n\\tinc = 1\\n\\tcont = 1\\n\\trow = 1\\n\\tcol = (n+1) / 2\\n\\twhile cont <= n*n\\n\\t\\tm[row,col] = cont\\n\\t\\tcont += 1\\n\\t\\tif inc < n then\\n\\t\\t\\tinc += 1\\n\\t\\t\\trow -= 1\\n\\t\\t\\tcol += 1\\n\\t\\t\\tif row <> 0 then\\n\\t\\t\\t\\tif col > n then col = 1\\n\\t\\t\\telse\\n\\t\\t\\t\\trow = n\\n\\t\\t\\tend if\\n\\t\\telse\\n\\t\\t\\tinc = 1\\n\\t\\t\\trow += 1\\n\\t\\tend if\\n\\tend while\\n\\tcall printSquare(n)\\nend subroutine\\n\\nsubroutine printSquare(n)\\n\\t#Arbitrary limit to fit width of A4 paper\\n\\tif n < 23 then\\n\\t\\tprint\\n\\t\\tprint n; \\\" x \\\"; n; \\\" Magic Square --- \\\";\\n\\t\\tprint \\\"Magic constant is \\\"; int((n*n+1)/2*n)\\n\\t\\tfor row = 1 to n\\n\\t\\t\\tfor col = 1 to n\\n\\t\\t\\t\\tprint rjust(string(m[row,col]),4);\\n\\t\\t\\tnext col\\n\\t\\t\\tprint\\n\\t\\tnext row\\n\\telse\\n\\t\\tprint \\\"Magic Square will not fit on one sheet of paper.\\\"\\n\\tend if\\nend subroutine\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off\\nrem Magic squares of odd order\\nsetlocal EnableDelayedExpansion\\nset n=9\\necho The square order is: %n%\\nfor /l %%i in (1,1,%n%) do (\\n set w=\\n for /l %%j in (1,1,%n%) do (\\n set /a v1=%%i*2-%%j+n-1\\n set /a v1=v1%%n*n\\n set /a v2=%%i*2+%%j+n-2\\n set /a v2=v2%%n\\n set /a v=v1+v2+1\\n\\t\\tset v= !v!\\n\\t set w=!w!!v:~-5!)\\n\\techo !w!)\\nset /a w=n*(n*n+1)/2\\necho The magic number is: %w%\\npause\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \"define magic_constant(n) {\\n return(((n * n + 1) / 2) * n)\\n}\\n\\ndefine print_magic_square(n) {\\n auto i, x, col, row, len, old_scale\\n\\n old_scale = scale\\n scale = 0\\n len = length(n * n)\\n\\n print \\\"Magic constant for n=\\\", n, \\\": \\\", magic_constant(n), \\\"\\\\n\\\"\\n for (row = 1; row <= n; row++) {\\n for (col = 1; col <= n; col++) {\\n x = n * ((row + col - 1 + (n / 2)) % n) + \\\\\\n ((row + 2 * col - 2) % n) + 1\\n for (i = 0; i < len - length(x); i++) {\\n print \\\" \\\"\\n }\\n print x\\n if (col != n) print \\\" \\\"\\n }\\n print \\\"\\\\n\\\"\\n }\\n\\n scale = old_scale\\n}\\n\\ntemp = print_magic_square(5)\\n\",\n \"language\": \"Bc\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\nlet cell(n, x, y) = f(n, n-x-1, y)*n + f(n, x, y) + 1\\nand f(n, x, y) = (x + y*2 + 1) rem n\\n\\nlet magic(n) be\\n$( writef(\\\"Magic square of order %N with constant %N:*N\\\", n, (n*n+1)/2*n)\\n for y = 0 to n-1\\n $( for x = 0 to n-1 do writed(cell(n, x, y), 4)\\n wrch('*N')\\n $)\\n wrch('*N')\\n$)\\n\\nlet start() be for n = 1 to 7 by 2 do magic(n)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"500p0>:::00g%00g\\\\-1-\\\\00g/2*+1+00g%00g*\\\\:00g%v\\n@<$<_^#!-*:g00:,+9!%g00:+1.+1+%g00+1+*2/g00\\\\<\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \"Magic ← {𝕏{+´1∾1‿𝕗×𝕨(𝕗|1+⊢+2×⊣)𝕩∾𝕗-𝕩+1}´¨↕2⥊𝕩}\\nMagic¨ ⟨1,3,5,7⟩\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n\\nint f(int n, int x, int y)\\n{\\n\\treturn (x + y*2 + 1)%n;\\n}\\n\\nint main(int argc, char **argv)\\n{\\n\\tint i, j, n;\\n\\n\\t//Edit: Add argument checking\\n\\tif(argc!=2) return 1;\\n\\n\\t//Edit: Input must be odd and not less than 3.\\n\\tn = atoi(argv[1]);\\n\\tif (n < 3 || (n%2) == 0) return 2;\\n\\n\\tfor (i = 0; i < n; i++) {\\n\\t\\tfor (j = 0; j < n; j++)\\n\\t\\t\\tprintf(\\\"% 4d\\\", f(n, n - j - 1, i)*n + f(n, j, i) + 1);\\n\\t\\tputchar('\\\\n');\\n\\t}\\n\\tprintf(\\\"\\\\n Magic Constant: %d.\\\\n\\\", (n*n+1)/2*n);\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <sstream>\\n#include <iomanip>\\n#include <cassert>\\n#include <vector>\\nusing namespace std;\\n\\nclass MagicSquare\\n{\\npublic:\\n MagicSquare(int d) : sqr(d*d,0), sz(d)\\n {\\n assert(d&1);\\n fillSqr();\\n }\\n\\n void display()\\n {\\n cout << \\\"Odd Magic Square: \\\" << sz << \\\" x \\\" << sz << \\\"\\\\n\\\";\\n cout << \\\"It's Magic Sum is: \\\" << magicNumber() << \\\"\\\\n\\\\n\\\";\\n ostringstream cvr;\\n cvr << sz * sz;\\n int l = cvr.str().size();\\n\\n\\tfor( int y = 0; y < sz; y++ )\\n\\t{\\n\\t int yy = y * sz;\\n\\t for( int x = 0; x < sz; x++ )\\n\\t\\tcout << setw( l + 2 ) << sqr[yy + x];\\n\\t cout << \\\"\\\\n\\\";\\n\\t}\\n cout << \\\"\\\\n\\\\n\\\";\\n }\\n\\nprivate:\\n void fillSqr()\\n {\\n\\tint sx = sz / 2, sy = 0, c = 0;\\n\\twhile( c < sz * sz )\\n\\t{\\n\\t if( !sqr[sx + sy * sz] )\\n\\t {\\n\\t\\tsqr[sx + sy * sz]= c + 1;\\n\\t\\tinc( sx ); dec( sy );\\n\\t\\tc++;\\n\\t }\\n\\t else\\n\\t {\\n\\t\\tdec( sx ); inc( sy ); inc( sy );\\n\\t }\\n\\t}\\n }\\n\\n int magicNumber()\\n { return sz * ( ( sz * sz ) + 1 ) / 2; }\\n\\n void inc( int& a )\\n { if( ++a == sz ) a = 0; }\\n\\n void dec( int& a )\\n { if( --a < 0 ) a = sz - 1; }\\n\\n bool checkPos( int x, int y )\\n { return( isInside( x ) && isInside( y ) && !sqr[sz * y + x] ); }\\n\\n bool isInside( int s )\\n { return ( s < sz && s > -1 ); }\\n\\n vector<int> sqr;\\n int sz;\\n};\\n\\nint main()\\n{\\n MagicSquare s(7);\\n s.display();\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"100 cls\\n110 sub magicsq(size,filename$ = \\\"\\\")\\n120 if (size and 1) = 0 or size < 3 then\\n130 print\\n140 print \\\"error: size is not odd or size is smaller then 3\\\"\\n160 exit sub\\n170 endif\\n180 ' filename$ <> \\\"\\\" then save magic square in a file\\n190 ' filename$ can contain directory name\\n200 ' if filename$ exist it will be overwriten, no error checking\\n210 dim sq(size,size)' array to hold square\\n220 ' start in the middle of the first row\\n230 nr = 1\\n240 x = size-int(size/2)\\n250 y = 1\\n260 max = size*size\\n270 ' create format string for using\\n280 for c = 1 to len(str$(max))+1 : frmt$ = frmt$+\\\"#\\\" : next c\\n290 'main loop for creating magic square\\n300 do\\n310 if sq(x,y) = 0 then\\n320 sq(x,y) = nr\\n330 if nr mod size = 0 then\\n340 y = y+1\\n350 else\\n360 x = x+1\\n370 y = y-1\\n380 endif\\n390 nr = nr+1\\n400 endif\\n410 if x > size then\\n420 x = 1\\n430 do while sq(x,y) <> 0\\n440 x = x+1\\n450 loop\\n460 endif\\n470 if y < 1 then\\n480 y = size\\n490 do while sq(x,y) <> 0\\n500 y = y-1\\n510 loop\\n520 endif\\n530 loop until nr > max\\n540 ' printing square's bigger than 19 result in a wrapping of the line\\n550 print \\\"Odd magic square size: \\\";size;\\\"*\\\";size\\n560 print \\\"The magic sum = \\\";int((max+1)/2)*size\\n570 print\\n580 for y = 1 to size\\n590 for x = 1 to size\\n600 print using \\\"####\\\";val(sq(x,y));\\n610 next x\\n620 print\\n630 next y\\n640 print\\n650 ' output magic square to a file with the name provided\\n660 if filename$ <> \\\"\\\" then\\n670 nr = freefile\\n680 open filename$ for output as #1\\n690 print #1,\\\"Odd magic square size: \\\";size;\\\"*\\\";size\\n700 print #1,\\\"The magic sum = \\\";int((max+1)/2)*size\\n710 print #1,\\n720 for y = 1 to size\\n730 for x = 1 to size\\n740 print #1,using frmt$;sq(x,y);\\n750 next x\\n760 print #1,\\n770 next y\\n780 endif\\n790 close #1\\n800 end sub\\n810 input \\\"Enter N: \\\",number\\n820 magicsq(number)\\n830 end\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"magic_square = cluster is create, unparse, magic_number\\n rep = array[array[int]]\\n\\n create = proc (order: int) returns (cvt) signals (invalid)\\n if order<1 cor order//2 = 0 then signal invalid end\\n sq: rep := rep$fill_copy(1, order, array[int]$fill(1, order, 0))\\n x: int := (order+1)/2\\n y: int := 1\\n\\n for i: int in int$from_to(1, order**2) do\\n sq[y][x] := i\\n next_x: int := inc(sq,x)\\n next_y: int := dec(sq,y)\\n if sq[next_y][next_x]=0\\n then x, y := next_x, next_y\\n else y := inc(sq,y)\\n end\\n end\\n return(sq)\\n end create\\n\\n inc = proc (sq: rep, co: int) returns (int)\\n order: int := rep$size(sq)\\n if co=order then return(1) else return(co+1) end\\n end inc\\n\\n dec = proc (sq: rep, co: int) returns (int)\\n order: int := rep$size(sq)\\n if co=1 then return(order) else return(co-1) end\\n end dec\\n\\n unparse = proc (sq: cvt) returns (string)\\n order: int := rep$size(sq)\\n col_size: int := string$size(int$unparse(order ** 2)) + 1\\n ss: stream := stream$create_output()\\n for y: int in int$from_to(1, order) do\\n for x: int in int$from_to(1, order) do\\n stream$putright(ss, int$unparse(sq[y][x]), col_size)\\n end\\n stream$putl(ss, \\\"\\\")\\n end\\n return(stream$get_contents(ss))\\n end unparse\\n\\n magic_number = proc (sq: cvt) returns (int)\\n order: int := rep$size(sq)\\n n: int := 0\\n for x: int in int$from_to(1, order) do n := n + sq[1][x] end\\n return(n)\\n end magic_number\\nend magic_square\\n\\n\\nprint_magic_square = proc (order: int)\\n po: stream := stream$primary_output()\\n ms: magic_square := magic_square$create(order)\\n stream$putl(po, \\\"Magic square of order \\\"\\n || int$unparse(order)\\n || \\\" with magic number \\\"\\n || int$unparse(magic_square$magic_number(ms))\\n || \\\": \\\")\\n stream$putl(po, magic_square$unparse(ms))\\nend print_magic_square\\n\\nstart_up = proc ()\\n for n: int in int$from_to_by(1, 7, 2) do\\n print_magic_square(n)\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \"(defun magic-square (n)\\n (loop for i from 1 to n\\n collect\\n (loop for j from 1 to n\\n collect\\n (+ (* n (mod (+ i j (floor n 2) -1)\\n n))\\n (mod (+ i (* 2 j) -2)\\n n)\\n 1))))\\n\\n(defun magic-constant (n)\\n (* n\\n (/ (1+ (* n n))\\n 2)))\\n\\n(defun output (n)\\n (format T \\\"Magic constant for n=~a: ~a~%\\\" n (magic-constant n))\\n (let* ((size (length (write-to-string (* n n))))\\n (format-str (format NIL \\\"~~{~~{~~~ad~~^ ~~}~~%~~}~~%\\\" size)))\\n (format T format-str (magic-square n))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\nsub magic(n: uint16) is\\n sub f(x: uint16, y: uint16): (r: uint16) is\\n r := (x + y*2 + 1) % n;\\n end sub;\\n\\n sub cell(x: uint16, y: uint16): (c: uint16) is\\n c := f(n-x-1, y)*n + f(x, y) + 1;\\n end sub;\\n\\n var y: uint16 := 0;\\n while y < n loop\\n var x: uint16 := 0;\\n loop\\n print_i16(cell(x, y));\\n x := x + 1;\\n if x == n then\\n print_nl();\\n break;\\n else\\n print_char('\\\\t');\\n end if;\\n end loop;\\n y := y + 1;\\n end loop;\\n print_nl();\\nend sub;\\n\\nvar n: uint16 := 1;\\nwhile n <= 7 loop\\n print(\\\"Magic square of order \\\");\\n print_i16(n);\\n print(\\\" with constant \\\");\\n print_i16((n*n+1)/2*n);\\n print(\\\":\\\\n\\\");\\n magic(n);\\n n := n + 2;\\nend loop;\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"void main(in string[] args)\\n{\\n import std.stdio, std.conv, std.range, std.algorithm, std.exception;\\n\\n immutable n = args.length == 2 ? args[1].to!uint : 5;\\n enforce(n > 0 && n % 2 == 1, \\\"Only odd n > 1\\\");\\n immutable len = text(n ^^ 2).length.text;\\n // writeln(len);\\n\\n foreach (immutable r; 1 .. n + 1)\\n {\\n foreach (immutable c; 1 .. n + 1)\\n {\\n auto a = (n * ((r + c - 1 + (n / 2)) % n)) + ((r + (2 * c) - 2) % n) + 1;\\n // n(( I + J - 1 + ( n / 2 ) ) mod n ) + (( I + 2J - 2 ) mod n ) + 1\\n// writeln(\\\"n = \\\",n, \\\" r = \\\",r,\\\" c = \\\",c, \\\" a = \\\",a );\\n writef(\\\"%\\\" ~ len ~ \\\"d%s\\\",a, \\\" \\\");\\n }\\n writeln(\\\"\\\");\\n }\\n ;\\n\\n writeln(\\\"\\\\nMagic constant: \\\", ((n * n + 1) * n) / 2);\\n}}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, std.conv, std.string, std.range, std.algorithm;\\n\\nuint[][] magicSquare(immutable uint n) pure nothrow @safe\\nin {\\n assert(n > 0 && n % 2 == 1);\\n} out(mat) {\\n // mat is square of the right size.\\n assert(mat.length == n);\\n assert(mat.all!(row => row.length == n));\\n\\n immutable magic = mat[0].sum;\\n\\n // The sum of all rows is the same magic number.\\n assert(mat.all!(row => row.sum == magic));\\n\\n // The sum of all columns is the same magic number.\\n //assert(mat.transposed.all!(col => col.sum == magic));\\n assert(mat.dup.transposed.all!(col => col.sum == magic));\\n\\n // The sum of the main diagonals is the same magic number.\\n assert(mat.enumerate.map!(ir => ir[1][ir[0]]).sum == magic);\\n //assert(mat.enumerate.map!({i, r} => r[i]).sum == magic);\\n assert(mat.enumerate.map!(ir => ir[1][ir[0]]).sum == magic);\\n} body {\\n enum M = (in uint x) pure nothrow @safe @nogc => (x + n - 1) % n;\\n auto m = new uint[][](n, n);\\n\\n uint i = 0;\\n uint j = n / 2;\\n foreach (immutable uint k; 1 .. n ^^ 2 + 1) {\\n m[i][j] = k;\\n if (m[M(i)][M(j)]) {\\n i = (i + 1) % n;\\n } else {\\n i = M(i);\\n j = M(j);\\n }\\n }\\n\\n return m;\\n}\\n\\nvoid showSquare(in uint[][] m)\\nin {\\n assert(m.all!(row => row.length == m[0].length));\\n} body {\\n immutable maxLen = text(m.length ^^ 2).length.text;\\n writefln(\\\"%(%(%\\\" ~ maxLen ~ \\\"d %)\\\\n%)\\\", m);\\n writeln(\\\"\\\\nMagic constant: \\\", m[0].sum);\\n}\\n\\nint main(in string[] args) {\\n if (args.length == 1) {\\n 5.magicSquare.showSquare;\\n return 0;\\n } else if (args.length == 2) {\\n immutable n = args[1].to!uint;\\n if (n > 0 && n % 2 == 1) {\\n n.magicSquare.showSquare;\\n return 0;\\n }\\n }\\n\\n stderr.writefln(\\\"Requires n odd and larger than 0.\\\");\\n return 1;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"proc inc(word n, order) word: if n=order-1 then 0 else n+1 fi corp\\nproc dec(word n, order) word: if n=0 then order-1 else n-1 fi corp\\n\\nproc odd_magic_square([*,*]word square) void:\\n word order, x, nx, y, ny, i;\\n order := dim(square,1);\\n\\n for x from 0 upto order-1 do\\n for y from 0 upto order-1 do\\n square[x,y] := 0\\n od\\n od;\\n\\n x := order/2;\\n y := 0;\\n for i from 1 upto order*order do\\n square[x,y] := i;\\n nx := inc(x,order);\\n ny := dec(y,order);\\n if square[nx,ny] = 0 then\\n x := nx;\\n y := ny\\n else\\n y := inc(y,order)\\n fi\\n od\\ncorp\\n\\nproc digit_count(word n) word:\\n word count;\\n count := 0;\\n while n > 0 do\\n count := count + 1;\\n n := n / 10\\n od;\\n count\\ncorp\\n\\nproc print_magic_square([*,*]word square) void:\\n word order, max, col_size, magic, x, y;\\n order := dim(square,1);\\n max := order*order;\\n col_size := digit_count(max) + 1;\\n\\n magic := 0;\\n for x from 0 upto order-1 do magic := magic + square[x,0] od;\\n\\n writeln(\\\"Magic square of order \\\",order,\\\" with magic number \\\",magic,\\\":\\\");\\n for y from 0 upto order-1 do\\n for x from 0 upto order-1 do write(square[x,y]:col_size) od;\\n writeln()\\n od;\\n writeln()\\ncorp\\n\\nproc main() void:\\n [1,1]word sq1;\\n [3,3]word sq3;\\n [5,5]word sq5;\\n [7,7]word sq7;\\n\\n odd_magic_square(sq1);\\n odd_magic_square(sq3);\\n odd_magic_square(sq5);\\n odd_magic_square(sq7);\\n\\n print_magic_square(sq1);\\n print_magic_square(sq3);\\n print_magic_square(sq5);\\n print_magic_square(sq7)\\ncorp\\n\",\n \"language\": \"Draco\"\n },\n {\n \"code\": \"func f n x y .\\n return (x + y * 2 + 1) mod n\\n.\\nnumfmt 0 3\\nproc msqr n . .\\n for i = 0 to n - 1\\n for j = 0 to n - 1\\n write f n (n - j - 1) i * n + f n j i + 1\\n .\\n print \\\"\\\"\\n .\\n.\\nmsqr 5\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"(lib 'matrix)\\n\\n;; compute next i,j = f(move,i,j)\\n(define-syntax-rule (path imove jmove)\\n(begin (set! i (imove i n)) (set! j (jmove j n))))\\n\\n;; We define the ordinary and break moves\\n;; (1 , -1), (0, 1) King's move\\n(define (inext i n) (modulo (1+ i) n))\\n(define (jnext j n) (modulo (1- j) n))\\n(define (ibreak i n) i)\\n(define (jbreak j n) (modulo (1+ j) n))\\n\\n(define (make-ms n)\\n (define n2+1 (1+ (* n n)))\\n (define ms (make-array n n))\\n (define i (quotient n 2))\\n (define j 0)\\n (array-set! ms i j 1)\\n\\n (for ((ns (in-range 2 n2+1)))\\n (if (zero? (array-ref ms (inext i n ) (jnext j n )))\\n (path inext jnext) ;; ordinary move if empty target\\n (path ibreak jbreak)) ;; else break move\\n\\n (if (zero? (array-ref ms i j))\\n (array-set! ms i j ns)\\n (error ns \\\"illegal path\\\"))\\n )\\n (writeln 'order n 'magic-number (/ ( * n n2+1) 2))\\n (array-print ms))\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"[Magic squares of odd order, for Rosetta Code.\\n EDSAC program, Initial Orders 2.]\\n\\n[The entries in a magic square of side n can be written as n*u + v + 1,\\n where u and v range independently over 0, ..., n - 1.\\n Let the cells be labelled by (x, y) coordinates, where\\n x = column (left = 0), y = row (bottom = 0).\\n If n is odd then magic squares can be constructed by setting\\n u = c*x + d*y + h (mod n)\\n v = e*x + f*y + k (mod n)\\n where c, d, e, f, h, k are suitable constants.\\n Define m = (n - 1)/2. The values of c, ..., k for various methods\\n of construction are as follows:\\n c, d, e, f, h, k\\n Bachet: m + 1, m, m + 1, m + 1, m, 0\\n De la Loubere: 1, 2m, 2, 2m, m, 0\\n Conway (lozenge): 1, 2m, 1, 1, m, m + 1\\n Rosetta Code C: 2m, 2m - 1, 1, 2m - 1, 2m - 1, 2m\\n------------------------------------------------------------------------------]\\n [Arrange the storage]\\n T45K P56F [H parameter: subroutine to print string]\\n T46K P100F [N parameter: subroutine to print number]\\n T47K P200F [M parameter: main routine + high-level subroutine]\\n\\n[Main routine + non-library subroutine]\\n E25K TM GK\\n[Rows are printed in the order y = n - 1 (top) to y = 0 (bottom).\\n Row y = n is a fictitious row used during initialization.]\\n [Locations set up by main routine; some are changed by subroutine]\\n [0] PF [m]\\n [1] PF [n]\\n [2] PF [n^2]\\n [3] PF [n * 2^11]\\n [4] PF [c, changed to n*(n - c) = dec to n*u on inc(x)]\\n [5] PF [d, changed to n*d = dec to n*u on dec(y)]\\n [6] PF [e, changed to n - e = dec to v on inc(x)]\\n [7] PF [f = dec to v when dec(y)]\\n [8] PF [h, changed to n*u for start of current row]\\n [9] PF [k, changed to v for start of current row]\\n [Locations used only by subroutine]\\n [10] PF [n*u]\\n [11] PF [v]\\n [12] PF [x count]\\n [13] PF [y count]\\n\\n[Subroutine to print magic square, using parameters set up by main routine.]\\n [14] A3F T77@ [plant return link as usual]\\n A80@ T1F [set to print leading zeros as spaces]\\n A1@ S6@ T6@ [replace e by n - e]\\n A1@ S4@ T4@ [replace c by n - c]\\n [Multiply certain values by n. To maintain the integer scaling,\\n products have to be shifted 16 left before storing.]\\n H3@ V8@ [acc := (n << 11)*h]\\n L8F T8@ [shift 5 more left and store n*h]\\n V5@ L8F T5@ [similarly n*d]\\n V4@ L8F T4@ [similarly n*(n - c)]\\n[Loop round rows y := n - 1 down to 0. At the moment y = n.]\\n S1@ T13@ [initialize negative count of rows (y values)]\\n [Start of a row. Here acc = 0]\\n [36] S1@ T12@ [inititialize negative count of columns (x values)]\\n A8@ S5@ [decrement n*u by n*d]\\n E42@ [skip if n*u >= 0]\\n A2@ [else inc n*u by n^2]\\n [42] U8@ [store updated n*u for next time]\\n T10@ [also copy to initialize this row]\\n A9@ S7@ [decrement v by f]\\n E48@ [skip if v >= 0]\\n A1@ [else inc v by n]\\n [48] U9@ [store updated v at for next time]\\n U11@ [also copy to initialize this row]\\n [Next column. Here acc = v]\\n [50] A10@ A78@ TF [cell value v + n*u + 1 to 0F for printing]\\n [53] A53@ GN [call subroutine to print cell value]\\n A12@ A78@ [increment negative column count]\\n E70@ [jump if row is complete]\\n T12@ [else update count]\\n A10@ S4@ [dec n*u by n*n - c)]\\n E63@ [skip if n*U >= 0]\\n A2@ [else inc n*u by n^2]\\n [63] T10@ [store updated n*u for next time]\\n A11@ S6@ [dec v by n - e]\\n E68@ [skip if v >= 0]\\n A1@ [else inc v by n]\\n [68] U11@ [store updated v, keep v in acc]\\n E50@ [loop back for next cell in row]\\n[Row finished]\\n [70] O81@ O82@ [print CR LF]\\n A13@ A78@ [inc negative row count]\\n E77@ [exit if done all rows]\\n T13@ E36@ [else update count and loop back]\\n [77] ZF [(planted) jump back to caller]\\n[Constants]\\n [78] PD [17-bit 1]\\n [79] K4096F [null]\\n [80] !F [space]\\n [81] @F [carriage return]\\n [82] &F [line feed]\\n [83] P10F [for testing number of phone pulses]\\n[Strings for printing. K2048F sets letters mode; K4096F is EDSAC null.]\\n [84] K2048FMFAFGFIFCF!FSFQFUFAFRFEF!FOFFF!FOFRFDFEFRF!F#FWF*FMF#FZFQF@F&FK4096F\\n [117] K2048FDFIFAFLF!FMF!F#FKFPF!F*FTFOF!FCFAFNFCFEFLF#FLF@F&FK4096F\\n [144] K2048FBFAFCFHFEFTF#FCF@F&FK4096F\\n [156] K2048FDFEF!FLFAF!FLFOFUFBFEFRFEF#FCF@F&FK4096F\\n [175] K2048FCFOFNFWFAFYF#FCF@F&FK4096F\\n [187] K2048FRFOFSFEFTFTFAF!FCFOFDFEF!FCF#FCF@F&FK4096F\\n\\n[Enter with acc = 0]\\n [207] A207@ GH A84@ [print heading]\\n [210] A210@ GH A117@ [prompt user to dial m, where n = 2m + 1]\\n ZF [halt program; restarts when user dials]\\n[Here acc holds number of pulses in address field.\\n Number of pulses = 10 if user dialled '0', else = number that user dialled.]\\n S83@ E292@ [test for '0', jump to exit if so]\\n A83@ [restore acc after test]\\n L512F [shift m to top 5 bits for printing]\\n UF [temp to 0F]\\n OF O81@ O82@ [print digit m, plus CR LF]\\n R512F [restore m in address field, same as 2m right-justified]\\n A78@ U1@ [make and store n = 2m + 1, right justified]\\n RD T@ [make and store m right-justified]\\n A1@ L512F T3@ [make and store n << 11]\\n H3@ V1@ [acc := (n << 11)*n]\\n L8F [shift 5 left for integer scaling]\\n T2@ [store n^2]\\n[Bachet's method]\\n [234] A234@ GH A144@ [print name of method]\\n A@ U5@ U8@ [d, h := m]\\n A78@ U4@ U6@ T7@ [c, e, f := m + 1]\\n T9@ [k := 0]\\n [245] A245@ G14@ [call s/r to print square]\\n[De la Loubere's (miscalled Siamese) method]\\n [247] A247@ GH A156@ [print name of method]\\n A78@ U4@ [c := 1]\\n LD T6@ [e := 2]\\n A@ U8@ [h := m]\\n LD U5@ T7@ [d, f := 2m]\\n T9@ [k := 0 ]\\n [260] A260@ G14@ [call s/r to print square]\\n[Conway's lozenge method turns out to be of this type]\\n [262] A262@ GH A175@ [print name of method]\\n A78@ U4@ U6@ U7@ [c, e, f := 1]\\n A@ T9@ [k := m + 1]\\n A@ U8@ [h := m]\\n LD T5@ [d := 2m]\\n [275] A275@ G14@ [call s/r to print square]\\n[C solution on Rosetta Code website]\\n [277] A277@ GH A187@ [print name of method]\\n A78@ T6@ [e := 1]\\n A@ LD U4@ U9@ [c, k := 2m]\\n S78@ U5@ U7@ T8@ [d, f, h := 2m - 1]\\n [290] A290@\\n G14@ [call s/r to print square]\\n [292] O79@ [done; print null to flush teleprinter buffer]\\n ZF [halt the machine]\\n E25K TH\\n[Subroutine to print a string.\\n Input: A order for first character must follow subroutine call (G order).\\n String is terminated with EDSAC null, which is sent to the teleprinter.]\\n GKA18@U17@S19@T4@AFT6@AFUFOFE12@A20@G16@TFA6@A2FG5@TFZFU3FU1FK2048F\\n\\n E25K TN\\n[Subroutine to print non-negative 17-bit integer.\\n Parameters: 0F = integer to be printed (not preserved)\\n 1F = character for leading zero (preserved)\\n Workspace: 4F..7F, 38 locations]\\n GKA3FT34@A1FT7FS35@T6FT4#FAFT4FH36@V4FRDA4#FR1024FH37@E23@O7FA2F\\n T6FT5FV4#FYFL8FT4#FA5FL1024FUFA6FG16@OFTFT7FA6FG17@ZFP4FZ219DTF\\n\\n[================ M parameter again ================]\\n E25K TM GK\\n E207Z [define entry point]\\n PF [acc = 0 on entry]\\n\",\n \"language\": \"EDSAC-order-code\"\n },\n {\n \"code\": \"defmodule RC do\\n def odd_magic_square(n) when rem(n,2)==1 do\\n for i <- 0..n-1 do\\n for j <- 0..n-1, do: n * rem(i+j+1+div(n,2),n) + rem(i+2*j+2*n-5,n) + 1\\n end\\n end\\n\\n def print_square(sq) do\\n width = List.flatten(sq) |> Enum.max |> to_char_list |> length\\n fmt = String.duplicate(\\\" ~#{width}w\\\", length(sq)) <> \\\"~n\\\"\\n Enum.each(sq, fn row -> :io.format fmt, row end)\\n end\\nend\\n\\nEnum.each([3,5,11], fn n ->\\n IO.puts \\\"\\\\nSize #{n}, magic sum #{div(n*n+1,2)*n}\\\"\\n RC.odd_magic_square(n) |> RC.print_square\\nend)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"PROGRAM MAGIC_SQUARE\\n\\n!$INTEGER\\n\\nPROCEDURE Magicsq(size,filename$)\\n\\nLOCAL DIM sq[25,25] ! array to hold square\\n\\nIF (size AND 1)=0 OR size<3 THEN\\n PRINT PRINT(CHR$(7)) ! beep\\n PRINT(\\\"error: size is not odd or size is smaller then 3\\\")\\n PAUSE(3)\\n EXIT PROCEDURE\\nEND IF\\n\\n! filename$ <> \\\"\\\" then save magic square in a file\\n! filename$ can contain directory name\\n! if filename$ exist it will be overwriten, no error checking\\n\\n! start in the middle of the first row\\n nr=1 x=size-(size DIV 2) y=1\\n max=size*size\\n\\n! create format string for using\\n frmt$=STRING$(LEN(STR$(max)),\\\"#\\\")\\n\\n! main loop for creating magic square\\n REPEAT\\n IF sq[x,y]=0 THEN\\n sq[x,y]=nr\\n IF nr MOD size=0 THEN\\n y=y+1\\n ELSE\\n x=x+1\\n y=y-1\\n END IF\\n nr=nr+1\\n END IF\\n IF x>size THEN\\n x=1\\n WHILE sq[x,y]<>0 DO\\n x=x+1\\n END WHILE\\n END IF\\n IF y<1 THEN\\n y=size\\n WHILE sq[x,y]<>0 DO\\n y=y-1\\n END WHILE\\n END IF\\n UNTIL nr>max\\n\\n! printing square's bigger than 19 result in a wrapping of the line\\n PRINT(\\\"Odd magic square size:\\\";size;\\\"*\\\";size)\\n PRINT(\\\"The magic sum =\\\";((max+1) DIV 2)*size)\\n PRINT\\n\\n FOR y=1 TO size DO\\n FOR x=1 TO size DO\\n WRITE(frmt$;sq[x,y];)\\n END FOR\\n PRINT\\n END FOR\\n\\n ! output magic square to a file with the name provided\\n IF filename$<>\\\"\\\" THEN\\n OPEN(\\\"O\\\",1,filename$)\\n PRINT(#1,\\\"Odd magic square size:\\\";size;\\\" *\\\";size)\\n PRINT(#1,\\\"The magic sum =\\\";((max+1) DIV 2)*size)\\n PRINT(#1,)\\n\\n FOR y=1 TO size DO\\n FOR x=1 TO size DO\\n WRITE(#1,frmt$;sq[x,y];)\\n END FOR\\n PRINT(#1,)\\n END FOR\\n END IF\\n CLOSE(1)\\n\\nEND PROCEDURE\\n\\nBEGIN\\nPRINT(CHR$(12);) ! CLS\\nMagicsq(5,\\\"\\\")\\nMagicsq(11,\\\"\\\")\\n!----------------------------------------------------\\n! the next line will also print the square to a file\\n! called 'magic_square_19txt'\\n!----------------------------------------------------\\nMagicsq(19,\\\"msq_19.txt\\\")\\n\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"USING: formatting io kernel math math.matrices math.ranges\\nsequences sequences.extras ;\\nIN: rosetta-code.magic-squares-odd\\n\\n: inc-matrix ( n -- matrix )\\n [ 0 ] dip dup [ 1 + dup ] make-matrix nip ;\\n\\n: rotator ( n -- seq ) 2/ dup [ neg ] dip [a,b] ;\\n\\n: odd-magic-square ( n -- matrix )\\n [ inc-matrix ] [ rotator [ rotate ] 2map flip ] dup tri ;\\n\\n: show-square ( n -- )\\n dup \\\"Order: %d\\\\n\\\" printf odd-magic-square dup\\n [ [ \\\"%4d\\\" printf ] each nl ] each first sum\\n \\\"Magic number: %d\\\\n\\\\n\\\" printf ;\\n\\n3 5 11 [ show-square ] tri@\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"program Magic_Square\\n implicit none\\n\\n integer, parameter :: order = 15\\n integer :: i, j\\n\\n write(*, \\\"(a, i0)\\\") \\\"Magic Square Order: \\\", order\\n write(*, \\\"(a)\\\") \\\"----------------------\\\"\\n do i = 1, order\\n do j = 1, order\\n write(*, \\\"(i4)\\\", advance = \\\"no\\\") f1(order, i, j)\\n end do\\n write(*,*)\\n end do\\n write(*, \\\"(a, i0)\\\") \\\"Magic number = \\\", f2(order)\\n\\ncontains\\n\\ninteger function f1(n, x, y)\\n integer, intent(in) :: n, x, y\\n\\n f1 = n * mod(x + y - 1 + n/2, n) + mod(x + 2*y - 2, n) + 1\\nend function\\n\\ninteger function f2(n)\\n integer, intent(in) :: n\\n\\n f2 = n * (1 + n * n) / 2\\nend function\\nend program\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' version 23-06-2015\\n' compile with: fbc -s console\\n\\nSub magicsq(size As Integer, filename As String =\\\"\\\")\\n\\n If (size And 1) = 0 Or size < 3 Then\\n Print : Beep ' alert\\n Print \\\"error: size is not odd or size is smaller then 3\\\"\\n Sleep 3000,1 'wait 3 seconds, ignore key press\\n Exit Sub\\n End If\\n\\n ' filename <> \\\"\\\" then save magic square in a file\\n ' filename can contain directory name\\n ' if filename exist it will be overwriten, no error checking\\n\\n Dim As Integer sq(size,size) ' array to hold square\\n ' start in the middle of the first row\\n Dim As Integer nr = 1, x = size - (size \\\\ 2), y = 1\\n Dim As Integer max = size * size\\n ' create format string for using\\n Dim As String frmt = String(Len(Str(max)) +1, \\\"#\\\")\\n\\n ' main loop for creating magic square\\n Do\\n If sq(x, y) = 0 Then\\n sq(x, y) = nr\\n If nr Mod size = 0 Then\\n y += 1\\n Else\\n x += 1\\n y -= 1\\n End If\\n nr += 1\\n End If\\n If x > size Then\\n x = 1\\n Do While sq(x,y) <> 0\\n x += 1\\n Loop\\n End If\\n If y < 1 Then\\n y = size\\n Do While sq(x,y) <> 0\\n y -= 1\\n Loop\\n EndIf\\n Loop Until nr > max\\n\\n ' printing square's bigger than 19 result in a wrapping of the line\\n Print \\\"Odd magic square size:\\\"; size; \\\" *\\\"; size\\n Print \\\"The magic sum =\\\"; ((max +1) \\\\ 2) * size\\n Print\\n\\n For y = 1 To size\\n For x = 1 To size\\n Print Using frmt; sq(x,y);\\n Next\\n Print\\n Next\\n print\\n\\n ' output magic square to a file with the name provided\\n If filename <> \\\"\\\" Then\\n nr = FreeFile\\n Open filename For Output As #nr\\n Print #nr, \\\"Odd magic square size:\\\"; size; \\\" *\\\"; size\\n Print #nr, \\\"The magic sum =\\\"; ((max +1) \\\\ 2) * size\\n Print #nr,\\n\\n For y = 1 To size\\n For x = 1 To size\\n Print #nr, Using frmt; sq(x,y);\\n Next\\n Print #nr,\\n Next\\n End If\\n Close\\n\\nEnd Sub\\n\\n' ------=< MAIN >=------\\n\\nmagicsq(5)\\nmagicsq(11)\\n' the next line will also print the square to a file called: magic_square_19.txt\\nmagicsq(19, \\\"magic_square_19.txt\\\")\\n\\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\": \"order = length[ARGS] > 0 ? eval[ARGS@0] : undef\\nuntil isInteger[order] and order mod 2 == 1\\n order = eval[input[\\\"Enter order (must be odd): \\\", 3]]\\n\\na = new array[[order, order], undef]\\nx = order div 2\\ny = 0\\n\\nfor i = 1 to order^2\\n{\\n ny = (y - 1) mod order\\n nx = (x + 1) mod order\\n if a@ny@nx != undef\\n {\\n nx = x\\n ny = (y + 1) mod order\\n }\\n a@y@x = i\\n y = ny\\n x = nx\\n}\\n\\nprintln[formatTable[a]]\\nprintln[\\\"Magic number is \\\" + sum[a@0]]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"log\\\"\\n)\\n\\nfunc ms(n int) (int, []int) {\\n M := func(x int) int { return (x + n - 1) % n }\\n if n <= 0 || n&1 == 0 {\\n n = 5\\n log.Println(\\\"forcing size\\\", n)\\n }\\n m := make([]int, n*n)\\n i, j := 0, n/2\\n for k := 1; k <= n*n; k++ {\\n m[i*n+j] = k\\n if m[M(i)*n+M(j)] != 0 {\\n i = (i + 1) % n\\n } else {\\n i, j = M(i), M(j)\\n }\\n }\\n return n, m\\n}\\n\\nfunc main() {\\n n, m := ms(5)\\n i := 2\\n for j := 1; j <= n*n; j *= 10 {\\n i++\\n }\\n f := fmt.Sprintf(\\\"%%%dd\\\", i)\\n for i := 0; i < n; i++ {\\n for j := 0; j < n; j++ {\\n fmt.Printf(f, m[i*n+j])\\n }\\n fmt.Println()\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"100 REM Magic squares of odd order\\n110 INPUT \\\"The square order: \\\", N\\n115 'INPUT \\\"The square order:\\\"; N ' for MSX Basic\\n120 IF (N AND 1) = 0 OR N < 3 THEN PRINT \\\"error: size is not odd or size is smaller then 3\\\" : GOTO 100\\n130 FOR I = 1 TO N\\n140 FOR J = 1 TO N\\n150 PRINT USING \\\" ###\\\"; ((I*2-J+N-1) MOD N) * N + ((I*2+J-2) MOD N) + 1;\\n160 NEXT J\\n170 PRINT\\n180 NEXT I\\n190 PRINT \\\"The magic number is: \\\"; N * (N^2+1) / 2\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \"-- as a translation from imperative code, this is probably not a \\\"good\\\" implementation\\nimport Data.List\\n\\ntype Var = (Int, Int, Int, Int) -- sx sy sz c\\n\\nmagicSum :: Int -> Int\\nmagicSum x = ((x * x + 1) `div` 2) * x\\n\\nwrapInc :: Int -> Int -> Int\\nwrapInc max x\\n | x + 1 == max = 0\\n | otherwise = x + 1\\n\\nwrapDec :: Int -> Int -> Int\\nwrapDec max x\\n | x == 0 = max - 1\\n | otherwise = x - 1\\n\\nisZero :: [[Int]] -> Int -> Int -> Bool\\nisZero m x y = m !! x !! y == 0\\n\\nsetAt :: (Int,Int) -> Int -> [[Int]] -> [[Int]]\\nsetAt (x, y) val table\\n | (upper, current : lower) <- splitAt x table,\\n (left, this : right) <- splitAt y current\\n = upper ++ (left ++ val : right) : lower\\n | otherwise = error \\\"Outside\\\"\\n\\ncreate :: Int -> [[Int]]\\ncreate x = replicate x $ replicate x 0\\n\\ncells :: [[Int]] -> Int\\ncells m = x*x where x = length m\\n\\nfill :: Var -> [[Int]] -> [[Int]]\\nfill (sx, sy, sz, c) m\\n | c < cells m =\\n if isZero m sx sy\\n then fill ((wrapInc sz sx), (wrapDec sz sy), sz, c + 1) (setAt (sx, sy) (c + 1) m)\\n else fill ((wrapDec sz sx), (wrapInc sz(wrapInc sz sy)), sz, c) m\\n | otherwise = m\\n\\nmagicNumber :: Int -> [[Int]]\\nmagicNumber d = transpose $ fill (d `div` 2, 0, d, 0) (create d)\\n\\ndisplay :: [[Int]] -> String\\ndisplay (x:xs)\\n | null xs = vdisplay x\\n | otherwise = vdisplay x ++ ('\\\\n' : display xs)\\n\\nvdisplay :: [Int] -> String\\nvdisplay (x:xs)\\n | null xs = show x\\n | otherwise = show x ++ \\\" \\\" ++ vdisplay xs\\n\\n\\nmagicSquare x = do\\n putStr \\\"Magic Square of \\\"\\n putStr $ show x\\n putStr \\\" = \\\"\\n putStrLn $ show $ magicSum x\\n putStrLn $ display $ magicNumber x\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Control.Monad (join)\\nimport Data.List (maximumBy, transpose)\\nimport Data.List.Split (chunksOf)\\nimport Data.Ord (comparing)\\n\\n\\nmagicSquare :: Int -> [[Int]]\\nmagicSquare n\\n | 1 == mod n 2 =\\n applyN 2 (transpose . cycled) $\\n plainSquare n\\n | otherwise = []\\n\\n\\nplainSquare :: Int -> [[Int]]\\nplainSquare = chunksOf <*> enumFromTo 1 . (^ 2)\\n\\n\\n-------------------------- TEST ---------------------------\\nmain :: IO ()\\nmain =\\n mapM_ putStrLn $\\n showSquare . magicSquare <$> [3, 5, 7]\\n\\n\\n------------------------- GENERIC -------------------------\\napplyN :: Int -> (a -> a) -> a -> a\\napplyN n f = foldr (.) id (replicate n f)\\n\\ncycled :: [[Int]] -> [[Int]]\\ncycled rows =\\n let n = length rows\\n d = quot n 2\\n in zipWith\\n (\\\\d xs -> take n $ drop (n - d) (cycle xs))\\n [d, subtract 1 d .. - d]\\n rows\\n\\n------------------------ FORMATTING ----------------------\\njustifyRight :: Int -> a -> [a] -> [a]\\njustifyRight n c = (drop . length) <*> (replicate n c <>)\\n\\nshowSquare :: Show a => [[a]] -> String\\nshowSquare rows =\\n ( (\\\\xs w -> unlines ((justifyRight w ' ' =<<) <$> xs))\\n <*> succ . maximum . fmap length . join\\n )\\n $ fmap show <$> rows\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"{-# LANGUAGE TupleSections #-}\\n\\nimport Control.Monad (forM_)\\nimport Data.List (intercalate, transpose)\\nimport qualified Data.Map.Strict as M\\nimport Data.Maybe (fromJust, isJust)\\n\\nmagic :: Int -> [[Int]]\\nmagic = mapAsTable <*> siamMap\\n\\n----------------- SIAMESE METHOD FUNCTIONS ---------------\\n\\n-- Highest zero-based index of grid ->\\n-- 'Siamese' indices keyed by coordinates\\nsiamMap :: Int -> M.Map (Int, Int) Int\\nsiamMap n\\n | odd n = go n\\n | otherwise = M.fromList []\\n where\\n go n = sPath uBound (M.fromList []) (quot uBound 2, 0) 1\\n where\\n h = quot n 2\\n uBound = n - 1\\n sPath uBound sMap (x, y) h =\\n let newMap = M.insert (x, y) h sMap\\n in if y == uBound && x == quot uBound 2\\n then newMap\\n else\\n sPath\\n uBound\\n newMap\\n (nextSiam uBound sMap (x, y))\\n (succ h)\\n\\n-- Highest index of square -> Siam xys so far -> xy ->\\n-- next xy coordinate\\nnextSiam :: Int -> M.Map (Int, Int) Int -> (Int, Int) -> (Int, Int)\\nnextSiam uBound sMap (x, y) =\\n let alt (a, b)\\n -- Top right corner ?\\n | a > uBound && b < 0 = (uBound, 1)\\n -- beyond right edge ?\\n | a > uBound = (0, b)\\n -- above top edge ?\\n | b < 0 = (a, uBound)\\n -- already filled ?\\n | isJust (M.lookup (a, b) sMap) = (a - 1, b + 2)\\n | otherwise = (a, b) -- Up one, right one.\\n in alt (x + 1, y - 1)\\n\\n---------------- DISPLAY AND TEST FUNCTIONS --------------\\n\\n-- Size of square -> integers keyed by coordinates\\n-- -> rows of integers\\nmapAsTable :: Int -> M.Map (Int, Int) Int -> [[Int]]\\nmapAsTable nCols xyMap =\\n let axis = [0 .. nCols - 1]\\n in fmap (fromJust . flip M.lookup xyMap)\\n <$> (axis >>= \\\\y -> [(,y) <$> axis])\\n\\nchecked :: [[Int]] -> (Int, Bool)\\nchecked square =\\n let diagonals =\\n fmap (flip (zipWith (!!)) [0 ..])\\n . ( (:)\\n <*> (return . reverse)\\n )\\n h : t =\\n sum <$> square\\n <> transpose square\\n <> diagonals square\\n in (h, all (h ==) t)\\n\\ntable :: String -> [[String]] -> [String]\\ntable delim rows =\\n let justifyRight c n s =\\n drop\\n (length s)\\n (replicate n c <> s)\\n in intercalate delim\\n <$> transpose\\n ( (fmap =<< justifyRight ' ' . maximum . fmap length)\\n <$> transpose rows\\n )\\n\\nmain :: IO ()\\nmain =\\n forM_ [3, 5, 7] $\\n \\\\n -> do\\n let test = magic n\\n putStrLn $ unlines (table \\\" \\\" (fmap show <$> test))\\n print $ checked test\\n putStrLn \\\"\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main(A)\\n n := integer(!A) | 3\\n write(\\\"Magic number: \\\",n*(n*n+1)/2)\\n sq := buildSquare(n)\\n showSquare(sq)\\nend\\n\\nprocedure buildSquare(n)\\n sq := [: |list(n)\\\\n :]\\n r := 0\\n c := n/2\\n every i := !(n*n) do {\\n /sq[r+1,c+1] := i\\n nr := (n+r-1)%n\\n nc := (c+1)%n\\n if /sq[nr+1,nc+1] then (r := nr,c := nc) else r := (r+1)%n\\n }\\n return sq\\nend\\n\\nprocedure showSquare(sq)\\n n := *sq\\n s := *(n*n)+2\\n every r := !sq do every writes(right(!r,s)|\\\"\\\\n\\\")\\nend\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"100 PROGRAM \\\"MagicN.bas\\\"\\n110 DO\\n120 INPUT PROMPT \\\"The square order: \\\":N\\n130 LOOP UNTIL MOD(N,2)>0 AND INT(N)=N AND N>0\\n140 FOR I=1 TO N\\n150 FOR J=1 TO N\\n160 PRINT USING \\\" ###\\\":MOD((I*2-J+N-1),N)*N+MOD(I*2+J-2,N)+1;\\n170 NEXT\\n180 PRINT\\n190 NEXT\\n200 PRINT \\\"The magic number is:\\\";N*(N^2+1)/2\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \"ms=: i:@<.@-: |.\\\"_1&|:^:2 >:@i.@,~\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" >:@i.@,~ 3\\n1 2 3\\n4 5 6\\n7 8 9\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" i:@<.@-: 3\\n_1 0 1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" ms 5\\n 9 15 16 22 3\\n20 21 2 8 14\\n 1 7 13 19 25\\n12 18 24 5 6\\n23 4 10 11 17\\n ~.+/ms 5\\n65\\n ~.+/ms 101\\n515201\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class MagicSquare {\\n\\n public static void main(String[] args) {\\n int n = 5;\\n for (int[] row : magicSquareOdd(n)) {\\n for (int x : row)\\n System.out.format(\\\"%2s \\\", x);\\n System.out.println();\\n }\\n System.out.printf(\\\"\\\\nMagic constant: %d \\\", (n * n + 1) * n / 2);\\n }\\n\\n public static int[][] magicSquareOdd(final int base) {\\n if (base % 2 == 0 || base < 3)\\n throw new IllegalArgumentException(\\\"base must be odd and > 2\\\");\\n\\n int[][] grid = new int[base][base];\\n int r = 0, number = 0;\\n int size = base * base;\\n\\n int c = base / 2;\\n while (number++ < size) {\\n grid[r][c] = number;\\n if (r == 0) {\\n if (c == base - 1) {\\n r++;\\n } else {\\n r = base - 1;\\n c++;\\n }\\n } else {\\n if (c == base - 1) {\\n r--;\\n c = 0;\\n } else {\\n if (grid[r - 1][c + 1] == 0) {\\n r--;\\n c++;\\n } else {\\n r++;\\n }\\n }\\n }\\n }\\n return grid;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"(function () {\\n\\n // n -> [[n]]\\n function magic(n) {\\n return n % 2 ? rotation(\\n transposed(\\n rotation(\\n table(n)\\n )\\n )\\n ) : null;\\n }\\n\\n // [[a]] -> [[a]]\\n function rotation(lst) {\\n return lst.map(function (row, i) {\\n return rotated(\\n row, ((row.length + 1) / 2) - (i + 1)\\n );\\n })\\n }\\n\\n // [[a]] -> [[a]]\\n function transposed(lst) {\\n return lst[0].map(function (col, i) {\\n return lst.map(function (row) {\\n return row[i];\\n })\\n });\\n }\\n\\n // [a] -> n -> [a]\\n function rotated(lst, n) {\\n var lng = lst.length,\\n m = (typeof n === 'undefined') ? 1 : (\\n n < 0 ? lng + n : (n > lng ? n % lng : n)\\n );\\n\\n return m ? (\\n lst.slice(-m).concat(lst.slice(0, lng - m))\\n ) : lst;\\n }\\n\\n // n -> [[n]]\\n function table(n) {\\n var rngTop = rng(1, n);\\n\\n return rng(0, n - 1).map(function (row) {\\n return rngTop.map(function (x) {\\n return row * n + x;\\n });\\n });\\n }\\n\\n // [m..n]\\n function rng(m, n) {\\n return Array.apply(null, Array(n - m + 1)).map(\\n function (x, i) {\\n return m + i;\\n });\\n }\\n\\n /******************** TEST WITH 3, 5, 11 ***************************/\\n\\n // Results as right-aligned wiki tables\\n function wikiTable(lstRows, blnHeaderRow, strStyle) {\\n var css = strStyle ? 'style=\\\"' + strStyle + '\\\"' : '';\\n\\n return '{| class=\\\"wikitable\\\" ' + css + lstRows.map(\\n function (lstRow, iRow) {\\n var strDelim = ((blnHeaderRow && !iRow) ? '!' : '|'),\\n strDbl = strDelim + strDelim;\\n\\n return '\\\\n|-\\\\n' + strDelim + ' ' + lstRow.join(' ' + strDbl + ' ');\\n }).join('') + '\\\\n|}';\\n }\\n\\n return [3, 5, 11].map(\\n function (n) {\\n var w = 2.5 * n;\\n return 'magic(' + n + ')\\\\n\\\\n' + wikiTable(\\n magic(n), false, 'text-align:center;width:' + w + 'em;height:' + w + 'em;table-layout:fixed;'\\n )\\n }\\n ).join('\\\\n\\\\n')\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n\\n // magicSquare :: Int -> [[Int]]\\n const magicSquare = n =>\\n n % 2 !== 0 ? (\\n compose([transpose, cycled, transpose, cycled, enumSquare])(n)\\n ) : [];\\n\\n // Size of square -> rows containing integers [1..]\\n // enumSquare :: Int -> [[Int]]\\n const enumSquare = n =>\\n chunksOf(n, enumFromTo(1, n * n));\\n\\n // Table of integers -> Table with rows rotated by descending deltas\\n // cycled :: [[Int]] -> [[Int]]\\n const cycled = rows => {\\n const d = Math.floor(rows.length / 2);\\n return zipWith(listCycle, enumFromTo(d, -d), rows)\\n };\\n\\n // Number of positions to shift to right -> List -> Wrap-cycled list\\n // listCycle :: Int -> [a] -> [a]\\n const listCycle = (n, xs) => {\\n const d = -(n % xs.length);\\n return (d !== 0 ? xs.slice(d)\\n .concat(xs.slice(0, d)) : xs);\\n };\\n\\n // GENERIC FUNCTIONS ------------------------------------------------------\\n\\n // chunksOf :: Int -> [a] -> [[a]]\\n const chunksOf = (n, xs) =>\\n xs.reduce((a, _, i, xs) =>\\n i % n ? a : a.concat([xs.slice(i, i + n)]), []);\\n\\n // compose :: [(a -> a)] -> (a -> a)\\n const compose = fs => x => fs.reduceRight((a, f) => f(a), x);\\n\\n // enumFromTo :: Int -> Int -> Maybe Int -> [Int]\\n const enumFromTo = (m, n, step) => {\\n const d = (step || 1) * (n >= m ? 1 : -1);\\n return Array.from({\\n length: Math.floor((n - m) / d) + 1\\n }, (_, i) => m + (i * d));\\n };\\n\\n // intercalate :: String -> [a] -> String\\n const intercalate = (s, xs) => xs.join(s);\\n\\n // min :: Ord a => a -> a -> a\\n const min = (a, b) => b < a ? b : a;\\n\\n // show :: a -> String\\n const show = JSON.stringify;\\n\\n // transpose :: [[a]] -> [[a]]\\n const transpose = xs =>\\n xs[0].map((_, iCol) => xs.map(row => row[iCol]));\\n\\n // unlines :: [String] -> String\\n const unlines = xs => xs.join('\\\\n');\\n\\n // zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\\n const zipWith = (f, xs, ys) =>\\n Array.from({\\n length: min(xs.length, ys.length)\\n }, (_, i) => f(xs[i], ys[i]));\\n\\n // TEST -------------------------------------------------------------------\\n return intercalate('\\\\n\\\\n', [3, 5, 7]\\n .map(magicSquare)\\n .map(xs => unlines(xs.map(show))));\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n\\n // Number of rows -> n rows of integers\\n // oddMagicTable :: Int -> [[Int]]\\n const oddMagicTable = n =>\\n mapAsTable(n, siamMap(quot(n, 2)));\\n\\n // Highest index of square -> Siam xys so far -> xy -> next xy coordinate\\n // nextSiam :: Int -> M.Map (Int, Int) Int -> (Int, Int) -> (Int, Int)\\n const nextSiam = (uBound, sMap, [x, y]) => {\\n const [a, b] = [x + 1, y - 1];\\n return (a > uBound && b < 0) ? (\\n [uBound, 1] // Move down if obstructed by corner\\n ) : a > uBound ? (\\n [0, b] // Wrap at right edge\\n ) : b < 0 ? (\\n [a, uBound] // Wrap at upper edge\\n ) : mapLookup(sMap, [a, b])\\n .nothing ? ( // Unimpeded default: one up one right\\n [a, b]\\n ) : [a - 1, b + 2]; // Position occupied: move down\\n };\\n\\n // Order of table -> Siamese indices keyed by coordinates\\n // siamMap :: Int -> M.Map (Int, Int) Int\\n const siamMap = n => {\\n const\\n uBound = 2 * n,\\n sPath = (uBound, sMap, xy, n) => {\\n const [x, y] = xy,\\n newMap = mapInsert(sMap, xy, n);\\n return (y == uBound && x == quot(uBound, 2) ? (\\n newMap\\n ) : sPath(\\n uBound, newMap, nextSiam(uBound, newMap, [x, y]), n + 1));\\n };\\n return sPath(uBound, {}, [n, 0], 1);\\n };\\n\\n // Size of square -> integers keyed by coordinates -> rows of integers\\n // mapAsTable :: Int -> M.Map (Int, Int) Int -> [[Int]]\\n const mapAsTable = (nCols, dct) => {\\n const axis = enumFromTo(0, nCols - 1);\\n return map(row => map(k => fromJust(mapLookup(dct, k)), row),\\n bind(axis, y => [bind(axis, x => [\\n [x, y]\\n ])]));\\n };\\n\\n // GENERIC FUNCTIONS ------------------------------------------------------\\n\\n // bind :: [a] -> (a -> [b]) -> [b]\\n const bind = (xs, f) => [].concat.apply([], xs.map(f));\\n\\n // curry :: Function -> Function\\n const curry = (f, ...args) => {\\n const go = xs => xs.length >= f.length ? (f.apply(null, xs)) :\\n function () {\\n return go(xs.concat(Array.from(arguments)));\\n };\\n return go([].slice.call(args, 1));\\n };\\n\\n // enumFromTo :: Int -> Int -> [Int]\\n const enumFromTo = (m, n) =>\\n Array.from({\\n length: Math.floor(n - m) + 1\\n }, (_, i) => m + i);\\n\\n // fromJust :: M a -> a\\n const fromJust = m => m.nothing ? {} : m.just;\\n\\n // fst :: [a, b] -> a\\n const fst = pair => pair.length === 2 ? pair[0] : undefined;\\n\\n // intercalate :: String -> [a] -> String\\n const intercalate = (s, xs) => xs.join(s);\\n\\n // justifyRight :: Int -> Char -> Text -> Text\\n const justifyRight = (n, cFiller, strText) =>\\n n > strText.length ? (\\n (cFiller.repeat(n) + strText)\\n .slice(-n)\\n ) : strText;\\n\\n // length :: [a] -> Int\\n const length = xs => xs.length;\\n\\n // log :: a -> IO ()\\n const log = (...args) =>\\n console.log(\\n args\\n .map(show)\\n .join(' -> ')\\n );\\n\\n // map :: (a -> b) -> [a] -> [b]\\n const map = (f, xs) => xs.map(f);\\n\\n // mapInsert :: Dictionary -> k -> v -> Dictionary\\n const mapInsert = (dct, k, v) =>\\n (dct[(typeof k === 'string' && k) || show(k)] = v, dct);\\n\\n // mapKeys :: Map k a -> [k]\\n const mapKeys = dct =>\\n sortBy(mappendComparing([snd, fst]),\\n map(JSON.parse, Object.keys(dct)));\\n\\n // mapLookup :: Dictionary -> k -> Maybe v\\n const mapLookup = (dct, k) => {\\n const\\n v = dct[(typeof k === 'string' && k) || show(k)],\\n blnJust = (typeof v !== 'undefined');\\n return {\\n nothing: !blnJust,\\n just: v\\n };\\n };\\n\\n // mappendComparing :: [(a -> b)] -> (a -> a -> Ordering)\\n const mappendComparing = fs => (x, y) =>\\n fs.reduce((ord, f) => {\\n if (ord !== 0) return ord;\\n const\\n a = f(x),\\n b = f(y);\\n return a < b ? -1 : a > b ? 1 : 0\\n }, 0);\\n\\n // maximum :: [a] -> a\\n const maximum = xs =>\\n xs.reduce((a, x) => (x > a || a === undefined ? x : a), undefined);\\n\\n // Integral a => a -> a -> a\\n const quot = (n, m) => Math.floor(n / m);\\n\\n // show :: a -> String\\n const show = x => JSON.stringify(x);\\n //\\n // snd :: (a, b) -> b\\n const snd = tpl => Array.isArray(tpl) ? tpl[1] : undefined;\\n //\\n // sortBy :: (a -> a -> Ordering) -> [a] -> [a]\\n const sortBy = (f, xs) => xs.slice()\\n .sort(f);\\n\\n // table :: String -> [[String]] -> [String]\\n const table = (delim, rows) =>\\n map(curry(intercalate)(delim),\\n transpose(map(col =>\\n map(curry(justifyRight)(maximum(map(length, col)))(' '), col),\\n transpose(rows))));\\n\\n // transpose :: [[a]] -> [[a]]\\n const transpose = xs =>\\n xs[0].map((_, col) => xs.map(row => row[col]));\\n\\n // unlines :: [String] -> String\\n const unlines = xs => xs.join('\\\\n');\\n\\n // TEST -------------------------------------------------------------------\\n\\n return intercalate('\\\\n\\\\n',\\n bind([3, 5, 7],\\n n => unlines(table(\\\" \\\",\\n map(xs => map(show, xs), oddMagicTable(n))))));\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def odd_magic_square:\\n if type != \\\"number\\\" or . % 2 == 0 or . <= 0\\n then error(\\\"odd_magic_square requires an odd positive integer\\\")\\n else\\n . as $n\\n | reduce range(1; 1 + ($n*$n)) as $i\\n ( [0, (($n-1)/2), []];\\n \\t .[0] as $x | .[1] as $y\\n | .[2]\\n\\t | setpath([$x, $y]; $i )\\n | if getpath([(($x+$n-1) % $n), (($y+$n+1) % $n)])\\n then [(($x+$n+1) % $n), $y, .]\\n else [ (($x+$n-1) % $n), (($y+$n+1) % $n), .]\\n \\t end ) | .[2]\\n end ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def task:\\n def pp: if length == 0 then empty\\n else \\\"\\\\(.[0])\\\", (.[1:] | pp )\\n end;\\n \\\"The magic sum for a square of size \\\\(.) is \\\\( (.*. + 1)*./2 ):\\\",\\n (odd_magic_square | pp)\\n;\\n\\n(3, 5, 9) | task\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ jq -n -r -M -c -f odd_magic_square.jq\\nThe magic sum for a square of size 3 is 15:\\n[8,1,6]\\n[3,5,7]\\n[4,9,2]\\nThe magic sum for a square of size 5 is 65:\\n[17,24,1,8,15]\\n[23,5,7,14,16]\\n[4,6,13,20,22]\\n[10,12,19,21,3]\\n[11,18,25,2,9]\\nThe magic sum for a square of size 9 is 369:\\n[47,58,69,80,1,12,23,34,45]\\n[57,68,79,9,11,22,33,44,46]\\n[67,78,8,10,21,32,43,54,56]\\n[77,7,18,20,31,42,53,55,66]\\n[6,17,19,30,41,52,63,65,76]\\n[16,27,29,40,51,62,64,75,5]\\n[26,28,39,50,61,72,74,4,15]\\n[36,38,49,60,71,73,3,14,25]\\n[37,48,59,70,81,2,13,24,35]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# v0.6.0\\n\\nfunction magicsquareodd(base::Int)\\n if base & 1 == 0 || base < 3; error(\\\"base must be odd and >3\\\") end\\n\\n square = fill(0, base, base)\\n r, number = 1, 1\\n size = base * base\\n\\n c = div(base, 2) + 1\\n while number ≤ size\\n square[r, c] = number\\n fr = r == 1 ? base : r - 1\\n fc = c == base ? 1 : c + 1\\n if square[fr, fc] != 0\\n fr = r == base ? 1 : r + 1\\n fc = c\\n end\\n r, c = fr, fc\\n number += 1\\n end\\n\\n return square\\nend\\n\\nfor n in 3:2:7\\n println(\\\"Magic square with size $n - magic constant = \\\", div(n ^ 3 + n, 2))\\n println(\\\"----------------------------------------------------\\\")\\n square = magicsquareodd(n)\\n for i in 1:n\\n println(square[i, :])\\n end\\n println()\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nfun f(n: Int, x: Int, y: Int) = (x + y * 2 + 1) % n\\n\\nfun main(args: Array<String>) {\\n var n: Int\\n while (true) {\\n print(\\\"Enter the order of the magic square : \\\")\\n n = readLine()!!.toInt()\\n if (n < 1 || n % 2 == 0) println(\\\"Must be odd and >= 1, try again\\\")\\n else break\\n }\\n println()\\n for (i in 0 until n) {\\n for (j in 0 until n) print(\\\"%4d\\\".format(f(n, n - j - 1, i) * n + f(n, j, i) + 1))\\n println()\\n }\\n println(\\\"\\\\nThe magic constant is ${(n * n + 1) / 2 * n}\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"Dim m(1,1)\\n\\nCall magicSquare 5\\nCall magicSquare 17\\n\\nEnd\\n\\nSub magicSquare n\\n ReDim m(n,n)\\n inc = 1\\n count = 1\\n row = 1\\n col=(n+1)/2\\n While count <= n*n\\n m(row,col) = count\\n count = count + 1\\n If inc < n Then\\n inc = inc + 1\\n row = row - 1\\n col = col + 1\\n If row <> 0 Then\\n If col > n Then col = 1\\n Else\\n row = n\\n End If\\n Else\\n inc = 1\\n row = row + 1\\n End If\\n Wend\\n Call printSquare n\\nEnd Sub\\n\\nSub printSquare n\\n 'Arbitrary limit to fit width of A4 paper\\n If n < 23 Then\\n Print n;\\\" x \\\";n;\\\" Magic Square --- \\\";\\n Print \\\"Magic constant is \\\";Int((n*n+1)/2*n)\\n For row = 1 To n\\n For col = 1 To n\\n Print Using(\\\"####\\\",m(row,col));\\n Next col\\n Print\\n Print\\n Next row\\n Else\\n Notice \\\"Magic Square will not fit on one sheet of paper.\\\"\\n End If\\nEnd Sub\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"rp[v_, pos_] := RotateRight[v, (Length[v] + 1)/2 - pos];\\nrho[m_] := MapIndexed[rp, m];\\nmagic[n_] :=\\n rho[Transpose[rho[Table[i*n + j, {i, 0, n - 1}, {j, 1, n}]]]];\\n\\nsquare = magic[11] // Grid\\nPrint[\\\"Magic number is \\\", Total[square[[1, 1]]]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"wrap1(i):= if i>%n% then 1 else if i<1 then %n% else i;\\nwrap(P):=maplist('wrap1, P);\\n\\nuprigth(P):= wrap(P + [-1, 1]);\\ndown(P):= wrap(P + [1, 0]);\\n\\nmagic(n):=block([%n%: n,\\n M: zeromatrix (n, n),\\n P: [1, (n + 1)/2],\\n m: 1, Pc],\\n do (\\n M[P[1],P[2]]: m,\\n m: m + 1,\\n if m>n^2 then return(M),\\n Pc: uprigth(P),\\n if M[Pc[1],Pc[2]]=0 then P: Pc\\n else while(M[P[1],P[2]]#0) do P: down(P)));\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"(%i6) magic(3);\\n [ 8 1 6 ]\\n [ ]\\n(%o6) [ 3 5 7 ]\\n [ ]\\n [ 4 9 2 ]\\n(%i7) magic(5);\\n [ 17 24 1 8 15 ]\\n [ ]\\n [ 23 5 7 14 16 ]\\n [ ]\\n(%o7) [ 4 6 13 20 22 ]\\n [ ]\\n [ 10 12 19 21 3 ]\\n [ ]\\n [ 11 18 25 2 9 ]\\n(%i8) magic(7);\\n [ 30 39 48 1 10 19 28 ]\\n [ ]\\n [ 38 47 7 9 18 27 29 ]\\n [ ]\\n [ 46 6 8 17 26 35 37 ]\\n [ ]\\n(%o8) [ 5 14 16 25 34 36 45 ]\\n [ ]\\n [ 13 15 24 33 42 44 4 ]\\n [ ]\\n [ 21 23 32 41 43 3 12 ]\\n [ ]\\n [ 22 31 40 49 2 11 20 ]\\n/* magic number for n=7 */\\n(%i9) lsum(q, q, first(magic(7)));\\n(%o9) 175\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"100 REM Magic squares of odd order\\n110 INPUT \\\"The square order:\\\"; N\\n120 IF (N AND 1) = 0 OR N < 3 THEN PRINT \\\"error: size is not odd or size is smaller then 3\\\" : GOTO 100\\n130 FOR I = 1 TO N\\n140 FOR J = 1 TO N\\n150 PRINT USING \\\" ###\\\"; ((I*2-J+N-1) MOD N) * N + ((I*2+J-2) MOD N) + 1;\\n160 NEXT J\\n170 PRINT\\n180 NEXT I\\n190 PRINT \\\"The magic number is:\\\"; N * (N^2+1) / 2\\n\",\n \"language\": \"MSX-Basic\"\n },\n {\n \"code\": \"import strutils\\n\\nproc magic(n: int) =\\n let length = len($(n * n))\\n for row in 1 .. n:\\n for col in 1 .. n:\\n let cell = (n * ((row + col - 1 + n div 2) mod n) +\\n ((row + 2 * col - 2) mod n) + 1)\\n stdout.write ($cell).align(length), ' '\\n echo \\\"\\\"\\n echo \\\"\\\\nAll sum to magic number \\\", (n * n + 1) * n div 2\\n\\nfor n in [3, 5, 7]:\\n echo \\\"\\\\nOrder \\\", n, \\\"\\\\n=======\\\"\\n magic(n)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \": magicSquare(n)\\n| i j wd |\\n n sq log asInteger 1+ ->wd\\n n loop: i [\\n n loop: j [\\n i j + 1- n 2 / + n mod n *\\n i j + j + 2 - n mod 1 + +\\n System.Out swap <<w(wd) \\\" \\\" << drop\\n ]\\n printcr\\n ]\\n System.Out \\\"Magic constant is : \\\" << n sq 1 + 2 / n * << cr ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"magicSquare(n)={\\n my(M=matrix(n,n),j=n\\\\2+1,i=1);\\n for(l=1,n^2,\\n M[i,j]=l;\\n if(M[(i-2)%n+1,j%n+1],\\n i=i%n+1\\n ,\\n i=(i-2)%n+1;\\n j=j%n+1\\n )\\n );\\n M;\\n}\\nmagicSquare(7)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"PROGRAM magic;\\n(* Magic squares of odd order *)\\nCONST\\n n=9;\\nVAR\\n i,j :INTEGER;\\nBEGIN (*magic*)\\n WRITELN('The square order is: ',n);\\n FOR i:=1 TO n DO\\n BEGIN\\n FOR j:=1 TO n DO\\n WRITE((i*2-j+n-1) MOD n*n + (i*2+j-2) MOD n+1:5);\\n WRITELN\\n END;\\n WRITELN('The magic number is: ',n*(n*n+1) DIV 2)\\nEND (*magic*).\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"PROGRAM magic;\\n{$IFDEF FPC }{$MODE DELPHI}{$ELSE}{$APPTYPE CONSOLE}{$ENDIF}\\nuses\\n sysutils;\\n(* Magic squares of odd order *)\\ntype\\n tsquare = array of array of LongInt;\\n trowcol = array of NativeInt;\\n\\nfunction GenShuffleRowCol(n: nativeInt):trowcol;\\nvar\\n i,j,tmp: NativeInt;\\nbegin\\n setlength(result,0);\\n IF n > 0 then\\n Begin\\n setlength(result,n);\\n For i := 0 to n-1 do\\n result[i] := i;\\n //shuffle\\n For i := n-1 downto 1 do\\n Begin\\n j := random(i+1);//j == [0..i]\\n tmp := result[i];result[i]:= result[j];result[j]:= tmp;\\n end;\\n end;\\nend;\\n\\nfunction MagicSqrOdd(n:nativeInt;SwapColRoW:boolean):tsquare;\\nVAR\\n rowIdx,colIdx,row,col,num :NativeInt;\\n cols,rows :trowcol;\\nBEGIN\\n rows:= GenShuffleRowCol(n);\\n cols:= GenShuffleRowCol(n);\\n setlength(result,n,n);\\n FOR rowIdx:= 0 TO n-1 DO\\n BEGIN\\n row := rows[rowIdx];\\n FOR colIdx:=0 TO n-1 DO\\n Begin\\n col := cols[colIdx];\\n //corrected formula cause row :0..n*1-> corrected to 1..n\\n num := (row*2-col+n+2) MOD n*n + (row*2+col+1) MOD n+1;\\n IF SwapColRoW then\\n result[colIdx,rowIdx] := num\\n else\\n result[rowIdx,colIdx] := num;\\n end;\\n END;\\nEND;\\n\\nfunction MagicSqrCheck(const Mq:tsquare):boolean;\\nvar\\n row,col,rowsum,mn,n,itm: NativeInt;\\n colSum:trowcol;\\nbegin\\n n := length(Mq[0]);\\n mn := n*(n*n+1) DIV 2;\\n setlength(colsum,n);//automatic initialised to zero\\n For row := n-1 downto 0 do\\n Begin\\n //check one row\\n rowsum := 0;\\n For col := n-1 downto 0 do\\n Begin\\n itm := Mq[row,col];\\n write(itm:4);\\n inc(rowsum,itm);\\n //sum up the columns too, for I'm just here\\n inc(colSum[col],itm);\\n end;\\n writeln;\\n result := (rowsum=mn);\\n IF Not(result) then begin writeln(row:4,col:4,rowsum:10);EXIT;end;\\n end;\\n //check columns\\n For col := n-1 downto 0 do\\n Begin\\n result := (colSum[col]=mn);\\n IF Not(result) then begin writeln(col:4,colSum[col]:10);EXIT;end;\\n end;\\n writeln;\\nend;\\n\\n\\nvar\\n n,mn : nativeInt;\\n Mq : tsquare;\\nBegin\\n randomize;\\n n := 9;\\n mn := n*(n*n+1) DIV 2;\\n WRITELN('The square order is: ',n);\\n WRITELN('The magic number is: ',mn);\\n Mq := MagicSqrOdd(n,random(2)=0);\\n writeln(MagicSqrCheck(Mq));\\nend.\\n\",\n \"language\": \"Pascal\"\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;\\\">magic_square</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;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mod</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;\\\">1</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">false</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">square</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: #000000;\\\">0</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: #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: #000000;\\\">square</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: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #7060A8;\\\">mod</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;\\\">j</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: #0000FF;\\\">+</span> <span style=\\\"color: #7060A8;\\\">mod</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;\\\">j</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: #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: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">square</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;\\\">check</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">sq</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: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">magic</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;\\\">n</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: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">bd</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">fd</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;\\\">sq</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])!=</span><span style=\\\"color: #000000;\\\">magic</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;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">columnize</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">))!=</span><span style=\\\"color: #000000;\\\">magic</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: #000000;\\\">bd</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">sq</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>\\n <span style=\\\"color: #000000;\\\">fd</span> <span style=\\\"color: #0000FF;\\\">+=</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;\\\">i</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;\\\">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: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">bd</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">magic</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">fd</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">magic</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;\\\">procedure</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;\\\">7</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">square</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">magic_square</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;\\\">\\\"maqic square of order %d, sum: %d\\\\n\\\"</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: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">square</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])})</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">fmt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%%%dd\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</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;\\\">i</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">)))</span>\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">square</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_IntFmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">pp_StrFmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</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><span style=\\\"color: #004600;\\\">pp_Pause</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">check</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">square</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\": \"import util.\\n\\ngo =>\\n foreach(N in [3,5,17])\\n M=magic_square(N),\\n print_matrix(M),\\n check(M),\\n nl\\n end,\\n nl.\\n\\n%\\n% Not as nice as the J solution.\\n% But I like the chaining of the functions.\\n%\\nmagic_square(N) = MS =>\\n if N mod 2 = 0 then\\n printf(\\\"N (%d) is not odd!\\\\n\\\", N),\\n halt\\n end,\\n R = make_rotate_list(N), % the rotate indices\\n MS = make_square(N).transpose().rotate_matrix(R).transpose().rotate_matrix(R).\\n\\n%\\n% make a square matrix of size N (containing the numbers 1..N*N)\\n%\\nmake_square(N) = [[I*N+J : J in 1..N]: I in 0..N-1].\\n\\n%\\n% rotate list:\\n% rotate_list(11) = [-5,-4,-3,-2,-1,0,1,2,3,4,5]\\n%\\nmake_rotate_list(N) = [I - ceiling(N / 2) : I in 1..N].\\n\\n%\\n% rotate the matrix M according to rotate list R\\n%\\nrotate_matrix(M, R) = [rotate_n(Row,N) : {Row,N} in zip(M,R)].\\n\\n%\\n% Rotate the list L N steps (either positive or negative N)\\n% rotate(1..10,3) -> [4,5,6,7,8,9,10,1,2,3]\\n% rotate(1..10,-3) -> [8,9,10,1,2,3,4,5,6,7]\\n%\\nrotate_n(L,N) = Rot =>\\n Len = L.length,\\n R = cond(N < 0, Len + N, N),\\n Rot = [L[I] : I in (R+1..Len) ++ 1..R].\\n\\n%\\n% Check if M is a magic square\\n%\\ncheck(M) =>\\n N = M.length,\\n Sum = N*(N*N+1) // 2, % The correct sum.\\n println(sum=Sum),\\n Rows = [sum(Row) : Row in M],\\n Cols = [sum(Col) : Col in M.transpose()],\\n Diag1 = sum([M[I,I] : I in 1..N]),\\n Diag2 = sum([M[I,N-I+1] : I in 1..N]),\\n All = Rows ++ Cols ++ [Diag1, Diag2],\\n OK = true,\\n foreach(X in All)\\n if X != Sum then\\n printf(\\\"%d != %d\\\\n\\\", X, Sum),\\n OK := false\\n end\\n end,\\n if OK then\\n println(ok)\\n else\\n println(not_ok)\\n end,\\n nl.\\n\\n% Print the matrix\\nprint_matrix(M) =>\\n N = M.len,\\n printf(\\\"N=%d\\\\n\\\",N),\\n Format = to_fstring(\\\"%%%dd\\\",max(flatten(M)).to_string().length+1),\\n foreach(Row in M)\\n foreach(X in Row)\\n printf(Format, X)\\n end,\\n nl\\n end,\\n nl.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"go2 =>\\n N = 313,\\n M = magic_square(N),\\n check(M),\\n nl.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(load \\\"@lib/simul.l\\\")\\n(de magic (A)\\n (let\\n (Grid (grid A A T T)\\n Sum (/ (* A (inc (** A 2))) 2))\\n (println 'N A 'Sum Sum)\\n # cut one important edge\\n (with (last (last Grid)) (con (: 0 1)))\\n (with (get Grid (inc (/ A 2)) A)\\n (for N (* A A)\\n (=: V N)\\n (setq This\\n (if\\n (with (setq @@ (north (east This)))\\n (not (: V)) )\\n @@\\n (south This) ) ) ) )\\n # display\\n (mapc\\n '((L)\\n (for This L\\n (prin (align 4 (: V))) )\\n (prinl) )\\n Grid )\\n # clean\\n (mapc '((L) (mapc zap L)) Grid) ) )\\n(magic 5)\\n(prinl)\\n(magic 7)\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"magic: procedure options (main); /* 18 April 2014 */\\n declare n fixed binary;\\n\\n put skip list ('What is the order of the magic square?');\\n get list (n);\\n if n < 3 | iand(n, 1) = 0 then\\n do; put skip list ('The value is out of range'); stop; end;\\n put skip list ('The order is ' || trim(n));\\n\\n begin;\\n declare m(n, n) fixed, (i, j, k) fixed binary;\\n\\n on subrg snap put data (i, j, k);\\n m = 0;\\n i = 1; j = (n+1)/2;\\n\\n do k = 1 to n*n;\\n if m(i,j) = 0 then\\n m(i,j) = k;\\n else\\n do;\\n i = i + 2; j = j + 1;\\n if i > n then i = mod(i,n);\\n if j > n then j = 1;\\n m(i,j) = k;\\n end;\\n i = i - 1; j = j - 1;\\n if i < 1 then i = n;\\n if j < 1 then j = n;\\n end;\\n\\n do i = 1 to n;\\n put skip edit (m(i, *)) (f(4));\\n end;\\n\\n put skip list ('The magic number is' || sum(m(1,*)));\\n end;\\nend magic;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"#N=9\\nDefine.i i,j\\n\\nIf OpenConsole(\\\"Magic squares\\\")\\n PrintN(\\\"The square order is: \\\"+Str(#N))\\n For i=1 To #N\\n For j=1 To #N\\n Print(RSet(Str((i*2-j+#N-1) % #N*#N + (i*2+j-2) % #N+1),5))\\n Next\\n PrintN(\\\"\\\")\\n Next\\n PrintN(\\\"The magic number is: \\\"+Str(#N*(#N*#N+1)/2))\\nEndIf\\nInput()\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \">>> def magic(n):\\n for row in range(1, n + 1):\\n print(' '.join('%*i' % (len(str(n**2)), cell) for cell in\\n (n * ((row + col - 1 + n // 2) % n) +\\n ((row + 2 * col - 2) % n) + 1\\n for col in range(1, n + 1))))\\n print('\\\\nAll sum to magic number %i' % ((n * n + 1) * n // 2))\\n\\n\\n>>> for n in (5, 3, 7):\\n\\tprint('\\\\nOrder %i\\\\n=======' % n)\\n\\tmagic(n)\\n\\n\\t\\n\\nOrder 5\\n=======\\n17 24 1 8 15\\n23 5 7 14 16\\n 4 6 13 20 22\\n10 12 19 21 3\\n11 18 25 2 9\\n\\nAll sum to magic number 65\\n\\nOrder 3\\n=======\\n8 1 6\\n3 5 7\\n4 9 2\\n\\nAll sum to magic number 15\\n\\nOrder 7\\n=======\\n30 39 48 1 10 19 28\\n38 47 7 9 18 27 29\\n46 6 8 17 26 35 37\\n 5 14 16 25 34 36 45\\n13 15 24 33 42 44 4\\n21 23 32 41 43 3 12\\n22 31 40 49 2 11 20\\n\\nAll sum to magic number 175\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Magic squares of odd order N'''\\n\\nfrom itertools import cycle, islice, repeat\\nfrom functools import reduce\\n\\n\\n# magicSquare :: Int -> [[Int]]\\ndef magicSquare(n):\\n '''Magic square of odd order n.'''\\n return applyN(2)(\\n compose(transposed)(cycled)\\n )(plainSquare(n)) if 1 == n % 2 else []\\n\\n\\n# plainSquare :: Int -> [[Int]]\\ndef plainSquare(n):\\n '''The sequence of integers from 1 to N^2,\\n subdivided into N sub-lists of equal length,\\n forming N rows, each of N integers.\\n '''\\n return chunksOf(n)(\\n enumFromTo(1)(n ** 2)\\n )\\n\\n\\n# cycled :: [[Int]] -> [[Int]]\\ndef cycled(rows):\\n '''A table in which the rows are\\n rotated by descending deltas.\\n '''\\n n = len(rows)\\n d = n // 2\\n return list(map(\\n lambda d, xs: take(n)(\\n drop(n - d)(cycle(xs))\\n ),\\n enumFromThenTo(d)(d - 1)(-d),\\n rows\\n ))\\n\\n\\n# TEST ----------------------------------------------------\\n# main :: IO ()\\ndef main():\\n '''Magic squares of order 3, 5, 7'''\\n print(\\n fTable(__doc__ + ':')(lambda x: '\\\\n' + repr(x))(\\n showSquare\\n )(magicSquare)([3, 5, 7])\\n )\\n\\n\\n# GENERIC -------------------------------------------------\\n\\n# applyN :: Int -> (a -> a) -> a -> a\\ndef applyN(n):\\n '''n applications of f.\\n (Church numeral n).\\n '''\\n def go(f):\\n return lambda x: reduce(\\n lambda a, g: g(a), repeat(f, n), x\\n )\\n return lambda f: go(f)\\n\\n\\n# chunksOf :: Int -> [a] -> [[a]]\\ndef chunksOf(n):\\n '''A series of lists of length n,\\n subdividing the contents of xs.\\n Where the length of xs is not evenly divible,\\n the final list will be shorter than 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# compose (<<<) :: (b -> c) -> (a -> b) -> a -> c\\ndef compose(g):\\n '''Right to left function composition.'''\\n return lambda f: lambda x: g(f(x))\\n\\n\\n# drop :: Int -> [a] -> [a]\\n# drop :: Int -> String -> String\\ndef drop(n):\\n '''The sublist of xs beginning at\\n (zero-based) index n.'''\\n def go(xs):\\n if isinstance(xs, (list, tuple, str)):\\n return xs[n:]\\n else:\\n take(n)(xs)\\n return xs\\n return lambda xs: go(xs)\\n\\n\\n# enumFromThenTo :: Int -> Int -> Int -> [Int]\\ndef enumFromThenTo(m):\\n '''Integer values enumerated from m to n\\n with a step defined by nxt-m.\\n '''\\n def go(nxt, n):\\n d = nxt - m\\n return range(m, n - 1 if d < 0 else 1 + n, d)\\n return lambda nxt: lambda n: list(go(nxt, n))\\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# 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 return lambda xs: (\\n xs[0:n]\\n if isinstance(xs, (list, tuple))\\n else list(islice(xs, n))\\n )\\n\\n\\n# transposed :: Matrix a -> Matrix a\\ndef transposed(m):\\n '''The rows and columns of the argument transposed.\\n (The matrix containers and rows can be lists or tuples).\\n '''\\n if m:\\n inner = type(m[0])\\n z = zip(*m)\\n return (type(m))(\\n map(inner, z) if tuple != inner else z\\n )\\n else:\\n return m\\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# indented :: Int -> String -> String\\ndef indented(n):\\n '''String indented by n multiples\\n of four spaces\\n '''\\n return lambda s: (n * 4 * ' ') + s\\n\\n\\n# showSquare :: [[Int]] -> String\\ndef showSquare(rows):\\n '''Lines representing rows of lists.'''\\n w = 1 + len(str(reduce(max, map(max, rows), 0)))\\n return '\\\\n' + '\\\\n'.join(\\n map(\\n lambda row: indented(1)(''.join(\\n map(lambda x: str(x).rjust(w, ' '), row)\\n )),\\n rows\\n )\\n )\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"_Title \\\"Magic Squares of Odd Order\\\"\\n'$Dynamic\\nDefLng A-Z\\nDim Shared As Long m(1, 1)\\n\\nCall magicSquare(5)\\nCall magicSquare(15)\\n\\nSleep\\nSystem\\n\\nSub magicSquare (n As Integer)\\n Dim As Integer inc, count, row, col\\n\\n If (n < 3) Or (n And 1) <> 1 Then n = 3\\n ReDim m(n, n)\\n inc = 1\\n count = 1\\n row = 1\\n col = (n + 1) / 2\\n While count <= n * n\\n m(row, col) = count\\n count = count + 1\\n If inc < n Then\\n inc = inc + 1\\n row = row - 1\\n col = col + 1\\n If row <> 0 Then\\n If col > n Then col = 1\\n Else\\n row = n\\n End If\\n Else\\n inc = 1\\n row = row + 1\\n End If\\n Wend\\n Call printSquare(n)\\nEnd Sub\\n\\nSub printSquare (n As Integer)\\n Dim As Integer row, col\\n 'Arbitrary limit ensures a fit within console window\\n 'Can be any size that fits within your computers memory limits\\n If n < 21 Then\\n Print \\\"Order \\\"; n; \\\" Magic Square constant is \\\"; Str$(Int((n * n + 1) / 2 * n))\\n For row = 1 To n\\n For col = 1 To n\\n Print Using \\\"####\\\"; m(row, col);\\n Next col\\n Print\\n ' Print\\n Next row\\n End If\\nEnd Sub\\n\",\n \"language\": \"QB64\"\n },\n {\n \"code\": \"#lang racket\\n;; Using \\\"helpful formulae\\\" in:\\n;; http://en.wikipedia.org/wiki/Magic_square#Method_for_constructing_a_magic_square_of_odd_order\\n(define (squares n) n)\\n\\n(define (last-no n) (sqr n))\\n\\n(define (middle-no n) (/ (add1 (sqr n)) 2))\\n\\n(define (M n) (* n (middle-no n)))\\n\\n(define ((Ith-row-Jth-col n) I J)\\n (+ (* (modulo (+ I J -1 (exact-floor (/ n 2))) n) n)\\n (modulo (+ I (* 2 J) -2) n)\\n 1))\\n\\n(define (magic-square n)\\n (define IrJc (Ith-row-Jth-col n))\\n (for/list ((I (in-range 1 (add1 n)))) (for/list ((J (in-range 1 (add1 n)))) (IrJc I J))))\\n\\n(define (fmt-list-of-lists l-o-l width)\\n (string-join\\n (for/list ((row l-o-l))\\n (string-join (map (λ (x) (~a #:align 'right #:width width x)) row) \\\" \\\"))\\n \\\"\\\\n\\\"))\\n\\n(define (show-magic-square n)\\n (format \\\"MAGIC SQUARE ORDER:~a~%~a~%MAGIC NUMBER:~a~%\\\"\\n n (fmt-list-of-lists (magic-square n) (+ (order-of-magnitude (last-no n)) 1)) (M n)))\\n\\n(displayln (show-magic-square 3))\\n(displayln (show-magic-square 5))\\n(displayln (show-magic-square 9))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"/*REXX program generates and displays magic squares (odd N will be a true magic square).*/\\nparse arg N . /*obtain the optional argument from CL.*/\\nif N=='' | N==\\\",\\\" then N=5 /*Not specified? Then use the default.*/\\nNN=N*N; w=length(NN) /*W: width of largest number (output).*/\\nr=1; c=(n+1) % 2 /*define the initial row and column.*/\\n@.=. /*assign a default value for entire @.*/\\n do j=1 for NN /* [↓] filling uses the Siamese method*/\\n if r<1 & c>N then do; r=r+2; c=c-1; end /*the row is under, column is over.*/\\n if r<1 then r=N /* \\\" \\\" \\\" \\\" make row=last. */\\n if r>N then r=1 /* \\\" \\\" \\\" over, \\\" \\\" first.*/\\n if c>N then c=1 /* \\\" column \\\" over, \\\" col=first.*/\\n if @.r.c\\\\==. then do; r=min(N,r+2); c=max(1,c-1); end /*at the previous cell? */\\n @.r.c=j; r=r-1; c=c+1 /*assign # ───► cell; next row & column*/\\n end /*j*/\\n /* [↓] display square with aligned #'s*/\\n do r=1 for N; _= /*display one matrix row at a time. */\\n do c=1 for N; _=_ right(@.r.c, w) /*construct a row of the magic square. */\\n end /*c*/\\n say substr(_, 2) /*display a row of the magic square. */\\n end /*r*/\\nsay /* [↓] If an odd square, show magic #.*/\\nif N//2 then say 'The magic number (or magic constant is): ' N * (NN+1) % 2\\n /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"n=9\\nsee \\\"the square order is : \\\" + n + nl\\nfor i=1 to n\\n for j = 1 to n\\n x = (i*2-j+n-1) % n*n + (i*2+j-2) % n + 1\\n see \\\"\\\" + x + \\\" \\\"\\n next\\n see nl\\nnext\\nsee \\\"the magic number is : \\\" + n*(n*n+1) / 2 + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def odd_magic_square(n)\\n raise ArgumentError \\\"Need odd positive number\\\" if n.even? || n <= 0\\n n.times.map{|i| n.times.map{|j| n*((i+j+1+n/2)%n) + ((i+2*j-5)%n) + 1} }\\nend\\n\\n[3, 5, 9].each do |n|\\n puts \\\"\\\\nSize #{n}, magic sum #{(n*n+1)/2*n}\\\"\\n fmt = \\\"%#{(n*n).to_s.size + 1}d\\\" * n\\n odd_magic_square(n).each{|row| puts fmt % row}\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"fn main() {\\n let n = 9;\\n let mut square = vec![vec![0; n]; n];\\n for (i, row) in square.iter_mut().enumerate() {\\n for (j, e) in row.iter_mut().enumerate() {\\n *e = n * (((i + 1) + (j + 1) - 1 + (n >> 1)) % n) + (((i + 1) + (2 * (j + 1)) - 2) % n) + 1;\\n print!(\\\"{:3} \\\", e);\\n }\\n println!(\\\"\\\");\\n }\\n let sum = n * (((n * n) + 1) / 2);\\n println!(\\\"The sum of the square is {}.\\\", sum);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \" def magicSquare( n:Int ) : Option[Array[Array[Int]]] = {\\n require(n % 2 != 0, \\\"n must be an odd number\\\")\\n\\n val a = Array.ofDim[Int](n,n)\\n\\n // Make the horizontal by starting in the middle of the row and then taking a step back every n steps\\n val ii = Iterator.continually(0 to n-1).flatten.drop(n/2).sliding(n,n-1).take(n*n*2).toList.flatten\\n\\n // Make the vertical component by moving up (subtracting 1) but every n-th step, step down (add 1)\\n val jj = Iterator.continually(n-1 to 0 by -1).flatten.drop(n-1).sliding(n,n-2).take(n*n*2).toList.flatten\\n\\n // Combine the horizontal and vertical components to create the path\\n val path = (ii zip jj) take (n*n)\\n\\n // Fill the array by following the path\\n for( i<-1 to (n*n); p=path(i-1) ) { a(p._1)(p._2) = i }\\n\\n Some(a)\\n }\\n\\n def output() : Unit = {\\n def printMagicSquare(n: Int): Unit = {\\n\\n val ms = magicSquare(n)\\n val magicsum = (n * n + 1) / 2\\n\\n assert(\\n if( ms.isDefined ) {\\n val a = ms.get\\n a.forall(_.sum == magicsum) &&\\n a.transpose.forall(_.sum == magicsum) &&\\n (for(i<-0 until n) yield { a(i)(i) }).sum == magicsum\\n }\\n else { false }\\n )\\n\\n if( ms.isDefined ) {\\n val a = ms.get\\n for (y <- 0 to n * 2; x <- 0 until n) (x, y) match {\\n case (0, 0) => print(\\\"╔════╤\\\")\\n case (i, 0) if i == n - 1 => print(\\\"════╗\\\\n\\\")\\n case (i, 0) => print(\\\"════╤\\\")\\n\\n case (0, j) if j % 2 != 0 => print(\\\"║ \\\" + f\\\"${ a(0)((j - 1) / 2) }%2d\\\" + \\\" │\\\")\\n case (i, j) if j % 2 != 0 && i == n - 1 => print(\\\" \\\" + f\\\"${ a(i)((j - 1) / 2) }%2d\\\" + \\\" ║\\\\n\\\")\\n case (i, j) if j % 2 != 0 => print(\\\" \\\" + f\\\"${ a(i)((j - 1) / 2) }%2d\\\" + \\\" │\\\")\\n\\n case (0, j) if j == (n * 2) => print(\\\"╚════╧\\\")\\n case (i, j) if j == (n * 2) && i == n - 1 => print(\\\"════╝\\\\n\\\")\\n case (i, j) if j == (n * 2) => print(\\\"════╧\\\")\\n\\n case (0, _) => print(\\\"╟────┼\\\")\\n case (i, _) if i == n - 1 => print(\\\"────╢\\\\n\\\")\\n case (i, _) => print(\\\"────┼\\\")\\n }\\n }\\n }\\n\\n printMagicSquare(7)\\n }\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst func integer: succ (in integer: num, in integer: max) is\\n return succ(num mod max);\\n\\nconst func integer: pred (in integer: num, in integer: max) is\\n return succ((num - 2) mod max);\\n\\nconst proc: main is func\\n local\\n var integer: size is 3;\\n var array array integer: magic is 0 times 0 times 0;\\n var integer: row is 1;\\n var integer: column is 1;\\n var integer: number is 0;\\n begin\\n if length(argv(PROGRAM)) >= 1 then\\n size := integer parse (argv(PROGRAM)[1]);\\n end if;\\n magic := size times size times 0;\\n column := succ(size div 2);\\n for number range 1 to size ** 2 do\\n magic[row][column] := number;\\n if magic[pred(row, size)][succ(column, size)] = 0 then\\n row := pred(row, size);\\n column := succ(column, size);\\n else\\n row := succ(row, size);\\n end if;\\n end for;\\n for key row range magic do\\n for key column range magic[row] do\\n write(magic[row][column] lpad 4);\\n end for;\\n writeln;\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"func magic_square(n {.is_pos && .is_odd}) {\\n var i = 0\\n var j = idiv(n, 2)\\n\\n var magic_square = []\\n for l in (1 .. n**2) {\\n magic_square[i][j] = l\\n\\n if (magic_square[i.dec % n][j.inc % n]) {\\n i = (i.inc % n)\\n }\\n else {\\n i = (i.dec % n)\\n j = (j.inc % n)\\n }\\n }\\n\\n return magic_square\\n}\\n\\nfunc print_square(sq) {\\n var f = \\\"%#{(sq.len**2).len}d\\\";\\n for row in sq {\\n say row.map{ f % _ }.join(' ')\\n }\\n}\\n\\nvar(n=5) = ARGV»to_i()»...\\nvar sq = magic_square(n)\\nprint_square(sq)\\n\\nsay \\\"\\\\nThe magic number is: #{sq[0].sum}\\\"\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"extension String: Error {}\\n\\nstruct Point: CustomStringConvertible {\\n var x: Int\\n var y: Int\\n\\n init(_ _x: Int,\\n _ _y: Int) {\\n self.x = _x\\n self.y = _y\\n }\\n\\n var description: String {\\n return \\\"(\\\\(x), \\\\(y))\\\\n\\\"\\n }\\n}\\n\\nextension Point: Equatable,Comparable {\\n static func == (lhs: Point, rhs: Point) -> Bool {\\n return lhs.x == rhs.x && lhs.y == rhs.y\\n }\\n static func < (lhs: Point, rhs: Point) -> Bool {\\n return lhs.y != rhs.y ? lhs.y < rhs.y : lhs.x < rhs.x\\n }\\n}\\n\\nclass MagicSquare: CustomStringConvertible {\\n var grid:[Int:Point] = [:]\\n var number: Int = 1\\n init(base n:Int) {\\n grid = [:]\\n number = n\\n }\\n\\n func createOdd() throws -> MagicSquare {\\n guard number < 1 || number % 2 != 0 else {\\n throw \\\"Must be odd and >= 1, try again\\\"\\n return self\\n }\\n var x = 0\\n var y = 0\\n let middle = Int(number/2)\\n x = middle\\n grid[1] = Point(x,y)\\n for i in 2 ... number*number {\\n let oldXY = Point(x,y)\\n x += 1\\n y -= 1\\n\\n if x >= number {x -= number}\\n if y < 0 {y += number}\\n\\n var tempCoord = Point(x,y)\\n if let _ = grid.firstIndex(where: { (k,v) -> Bool in\\n v == tempCoord\\n })\\n {\\n x = oldXY.x\\n y = oldXY.y + 1\\n if y >= number {y -= number}\\n tempCoord = Point(x,y)\\n }\\n grid[i] = tempCoord\\n }\\n print(self)\\n return self\\n }\\n\\n fileprivate func gridToText(_ result: inout String) {\\n let sorted = sortedGrid()\\n let sc = sorted.count\\n var i = 0\\n for c in sorted {\\n result += \\\" \\\\(c.key)\\\"\\n if c.key < 10 && sc > 10 { result += \\\" \\\"}\\n if c.key < 100 && sc > 100 { result += \\\" \\\"}\\n if c.key < 1000 && sc > 1000 { result += \\\" \\\"}\\n if i%number==(number-1) { result += \\\"\\\\n\\\"}\\n i += 1\\n }\\n result += \\\"\\\\nThe magic number is \\\\(number * (number * number + 1) / 2)\\\"\\n result += \\\"\\\\nRows and Columns are \\\"\\n\\n result += checkRows() == checkColumns() ? \\\"Equal\\\" : \\\" Not Equal!\\\"\\n result += \\\"\\\\nRows and Columns and Diagonals are \\\"\\n let allEqual = (checkDiagonals() == checkColumns() && checkDiagonals() == checkRows())\\n result += allEqual ? \\\"Equal\\\" : \\\" Not Equal!\\\"\\n result += \\\"\\\\n\\\"\\n }\\n\\n var description: String {\\n var result = \\\"base \\\\(number)\\\\n\\\"\\n gridToText(&result)\\n return result\\n }\\n}\\n\\nextension MagicSquare {\\n private func sortedGrid()->[(key:Int,value:Point)] {\\n return grid.sorted(by: {$0.1 < $1.1})\\n }\\n\\n private func checkRows() -> (Bool, Int?)\\n {\\n var result = Set<Int>()\\n var index = 0\\n var rowtotal = 0\\n for (cell, _) in sortedGrid()\\n {\\n rowtotal += cell\\n if index%number==(number-1)\\n {\\n result.insert(rowtotal)\\n rowtotal = 0\\n }\\n index += 1\\n }\\n return (result.count == 1, result.first ?? nil)\\n }\\n\\n private func checkColumns() -> (Bool, Int?)\\n {\\n var result = Set<Int>()\\n var sorted = sortedGrid()\\n for i in 0 ..< number {\\n var rowtotal = 0\\n for cell in stride(from: i, to: sorted.count, by: number) {\\n rowtotal += sorted[cell].key\\n }\\n result.insert(rowtotal)\\n }\\n return (result.count == 1, result.first)\\n }\\n\\n private func checkDiagonals() -> (Bool, Int?)\\n {\\n var result = Set<Int>()\\n var sorted = sortedGrid()\\n\\n var rowtotal = 0\\n for cell in stride(from: 0, to: sorted.count, by: number+1) {\\n rowtotal += sorted[cell].key\\n }\\n result.insert(rowtotal)\\n rowtotal = 0\\n for cell in stride(from: number-1, to: sorted.count-(number-1), by: number-1) {\\n rowtotal += sorted[cell].key\\n }\\n result.insert(rowtotal)\\n\\n return (result.count == 1, result.first)\\n }\\n}\\n\\ntry MagicSquare(base: 3).createOdd()\\ntry MagicSquare(base: 5).createOdd()\\ntry MagicSquare(base: 7).createOdd()\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"proc magicSquare {order} {\\n if {!($order & 1) || $order < 0} {\\n\\terror \\\"order must be odd and positive\\\"\\n }\\n set s [lrepeat $order [lrepeat $order 0]]\\n set x [expr {$order / 2}]\\n set y 0\\n for {set i 1} {$i <= $order**2} {incr i} {\\n\\tlset s $y $x $i\\n\\tset x [expr {($x + 1) % $order}]\\n\\tset y [expr {($y - 1) % $order}]\\n\\tif {[lindex $s $y $x]} {\\n\\t set x [expr {($x - 1) % $order}]\\n\\t set y [expr {($y + 2) % $order}]\\n\\t}\\n }\\n return $s\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"package require Tcl 8.6\\n\\nset square [magicSquare 5]\\nputs [join [lmap row $square {join [lmap n $row {format \\\"%2s\\\" $n}]}] \\\"\\\\n\\\"]\\nputs \\\"magic number = [tcl::mathop::+ {*}[lindex $square 0]]\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"9→N\\nDelVar [A]:{N,N}→dim([A])\\nFor(I,1,N)\\nFor(J,1,N)\\nRemainder(I*2-J+N-1,N)*N+Remainder(I*2+J-2,N)+1→[A](I,J)\\nEnd\\nEnd\\n[A]\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"Sub magicsquare()\\n 'Magic squares of odd order\\n Const n = 9\\n Dim i As Integer, j As Integer, v As Integer\\n Debug.Print \\\"The square order is: \\\" & n\\n For i = 1 To n\\n For j = 1 To n\\n Cells(i, j) = ((i * 2 - j + n - 1) Mod n) * n + ((i * 2 + j - 2) Mod n) + 1\\n Next j\\n Next i\\n Debug.Print \\\"The magic number of\\\"; n; \\\"x\\\"; n; \\\"square is:\\\"; n * (n * n + 1) \\\\ 2\\nEnd Sub 'magicsquare\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Sub magic_square(n)\\n\\tDim ms()\\n\\tReDim ms(n-1,n-1)\\n\\tinc = 0\\n\\tcount = 1\\n\\trow = 0\\n\\tcol = Int(n/2)\\n\\tDo While count <= n*n\\n\\t\\tms(row,col) = count\\n\\t\\tcount = count + 1\\n\\t\\tIf inc < n-1 Then\\n\\t\\t\\tinc = inc + 1\\n\\t\\t\\trow = row - 1\\n\\t\\t\\tcol = col + 1\\n\\t\\t\\tIf row >= 0 Then\\n\\t\\t\\t\\tIf col > n-1 Then\\n\\t\\t\\t\\t\\tcol = 0\\n\\t\\t\\t\\tEnd If\\n\\t\\t\\tElse\\n\\t\\t\\t\\trow = n-1\\n\\t\\t\\tEnd If\\n\\t\\tElse\\n\\t\\t\\tinc = 0\\n\\t\\t\\trow = row + 1\\n\\t\\tEnd If\\n\\tLoop\\n\\tFor i = 0 To n-1\\n\\t\\tFor j = 0 To n-1\\n\\t\\t\\tIf j = n-1 Then\\n\\t\\t\\t\\tWScript.StdOut.Write ms(i,j)\\n\\t\\t\\tElse\\n\\t\\t\\t\\tWScript.StdOut.Write ms(i,j) & vbTab\\n\\t\\t\\tEnd If\\n\\t\\tNext\\n\\t\\tWScript.StdOut.WriteLine\\n\\tNext\\nEnd Sub\\n\\nmagic_square(5)\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"Sub magicsquare()\\n 'Magic squares of odd order\\n Const n = 9\\n Dim i As Integer, j As Integer, v As Integer\\n Debug.Print \\\"The square order is: \\\" & n\\n For i = 1 To n\\n For j = 1 To n\\n v = ((i * 2 - j + n - 1) Mod n) * n + ((i * 2 + j - 2) Mod n) + 1\\n Debug.Print Right(Space(5) & v, 5);\\n Next j\\n Debug.Print\\n Next i\\n Debug.Print \\\"The magic number is: \\\" & n * (n * n + 1) \\\\ 2\\nEnd Sub 'magicsquare\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"Sub magicsquare()\\n 'Magic squares of odd order\\n Const n = 9\\n Dim i, j, v As Integer\\n Console.WriteLine(\\\"The square order is: \\\" & n)\\n For i = 1 To n\\n For j = 1 To n\\n v = ((i * 2 - j + n - 1) Mod n) * n + ((i * 2 + j - 2) Mod n) + 1\\n Console.Write(\\\" \\\" & Right(Space(5) & v, 5))\\n Next j\\n Console.WriteLine(\\\"\\\")\\n Next i\\n Console.WriteLine(\\\"The magic number is: \\\" & n * (n * n + 1) \\\\ 2)\\nEnd Sub 'magicsquare\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"10 N=1\\n20 ?=\\\"Magic square of order \\\";\\n30 ?=N\\n40 ?=\\\" with constant \\\";\\n50 ?=N*N+1/2*N\\n60 ?=\\\":\\\"\\n70 Y=0\\n80 X=0\\n90 ?=Y*2+N-X/N*0+%*N+(Y*2+X+1/N*0+%+1\\n100 $=9\\n110 X=X+1\\n120 #=X<N*90\\n130 ?=\\\"\\\"\\n140 Y=Y+1\\n150 #=Y<N*80\\n160 ?=\\\"\\\"\\n170 N=N+2\\n180 #=7>N*20\\n\",\n \"language\": \"VTL-2\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar ms = Fn.new { |n|\\n var M = Fn.new { |x| (x + n - 1) % n }\\n if (n <= 0 || n&1 == 0) {\\n n = 5\\n System.print(\\\"forcing size %(n)\\\")\\n }\\n var m = List.filled(n * n, 0)\\n var i = 0\\n var j = (n/2).floor\\n for (k in 1..n*n) {\\n m[i*n + j] = k\\n if (m[M.call(i)*n + M.call(j)] != 0) {\\n i = (i + 1) % n\\n } else {\\n i = M.call(i)\\n j = M.call(j)\\n }\\n }\\n return [n, m]\\n}\\n\\nvar res = ms.call(5)\\nvar n = res[0]\\nvar m = res[1]\\nfor (i in 0...n) {\\n for (j in 0...n) Fmt.write(\\\"$4d\\\", m[i*n+j])\\n System.print()\\n}\\nSystem.print(\\\"\\\\nMagic number : %(((n*n + 1)/2).floor * n)\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \" \\\\Construct a magic square of odd order - as a procedure can't return an\\n \\\\ array, the caller must supply one that is big enough.\\n function MagicSquare( Square, Order );\\n integer Square, Order;\\n integer Row, Col, I, J;\\n\\n \\\\Ensure a row/col position is on the square\\n function InSquare; int Pos ;\\n return if Pos < 1 then Order else if Pos > Order then 1 else Pos;\\n\\n \\\\move \\\"up\\\" a row in the square\\n function Up; int Row; return InSquare( Row - 1 );\\n\\n \\\\move \\\"across right\\\" in the square\\n function Right; int Col ; return InSquare( Col + 1 );\\n\\n if (Order&1) = 0 or Order < 1 then begin\\n \\\\can't make a magic square of the specified order\\n return false\\n end\\n else begin\\n \\\\Order is OK - construct the square using de la Loubere's\\n \\\\ algorithm as in the Wikipedia page\\n\\n \\\\initialise square\\n for I := 1 to Order do for J := 1 to Order do Square( I, J ) := 0;\\n\\n \\\\initial position is the middle of the top row\\n Col := ( Order + 1 ) / 2;\\n Row := 1;\\n \\\\construct square\\n for I := 1 to ( Order * Order ) do begin\\n Square( Row, Col ) := I;\\n if Square( Up( Row ), Right( Col ) ) # 0 then begin\\n \\\\the up/right position is already taken, move down\\n Row := Row + 1;\\n end\\n else begin\\n \\\\can move up/right\\n Row := Up( Row );\\n Col := Right( Col );\\n end\\n end; \\\\for_i\\n \\\\sucessful result\\n return true\\n end; \\\\magicSquare\\n\\n \\\\prints the magic square\\n procedure PrintSquare( Square, Order );\\n integer Square, Order;\\n integer Sum, W, I_W, I, J;\\n begin\\n \\\\set integer width to accomodate the largest number in the square\\n W := ( Order * Order ) / 10;\\n I_W := 1;\\n while W > 0 do begin I_W := I_W + 1; W := W / 10 end;\\n Format(I_W+1, 0);\\n Sum:= 0;\\n for I := 1 to Order do Sum := Sum + Square( 1, I );\\n Text(0, \\\"maqic square of order \\\"); IntOut(0, Order);\\n Text(0, \\\" : Sum: \\\"); IntOut(0, Sum );\\n for I := 1 to Order do begin\\n CrLf(0);\\n RlOut(0, float(Square( I, 1 )) );\\n for J := 2 to Order do RlOut(0, float(Square( I, J )) )\\n end; \\\\for_I\\n CrLf(0);\\n end; \\\\printSquare\\n\\n \\\\test the magic square generation\\n integer Sq ( 1+11, 1+11 ), L, I;\\nbegin\\n L:= [1, 3, 5, 7];\\n for I := 0 to 3 do begin\\n if MagicSquare( Sq, L(I) ) then PrintSquare( Sq, L(I) )\\n else Text(0, \\\"can't generate square^m^j\\\" );\\n end \\\\for_I\\nend]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"magicSquare(5)\\nmagicSquare(17)\\nend\\n\\nsub magicSquare(n)\\n redim m(n,n)\\n inc = 1\\n cont = 1\\n row = 1\\n col = (n+1) / 2\\n while cont <= n*n\\n m(row,col) = cont\\n cont = cont + 1\\n if inc < n then\\n inc = inc + 1\\n row = row - 1\\n col = col + 1\\n if row <> 0 then\\n if col > n col = 1\\n else\\n row = n\\n end if\\n else\\n inc = 1\\n row = row + 1\\n end if\\n end while\\n printSquare(n)\\nend sub\\n\\nsub printSquare(n)\\n //Arbitrary limit to fit width of A4 paper\\n if n < 23 then\\n print \\\"\\\\n\\\", n, \\\" x \\\", n, \\\" Magic Square --- \\\";\\n print \\\"Magic constant is \\\", int((n*n+1)/2*n)\\n for row = 1 to n\\n for col = 1 to n\\n print m(row,col) using(\\\"####\\\");\\n next col\\n print\\n next row\\n else\\n print \\\"Magic Square will not fit on one sheet of paper.\\\"\\n end if\\nend sub\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"fcn rmod(n,m){ n=n%m; if (n<0) n+=m; n } // Ruby: -5%3-->1\\nfcn odd_magic_square(n){ //-->list of n*n numbers, row order\\n if (n.isEven or n <= 0) throw(Exception.ValueError(\\\"Need odd positive number\\\"));\\n [[(i,j); n; n; '{ n*((i+j+1+n/2):rmod(_,n)) + ((i+2*j-5):rmod(_,n)) + 1 }]]\\n}\\n\\nT(3, 5, 9).pump(Void,fcn(n){\\n \\\"\\\\nSize %d, magic sum %d\\\".fmt(n,(n*n+1)/2*n).println();\\n fmt := \\\"%%%dd\\\".fmt((n*n).toString().len() + 1) * n;\\n odd_magic_square(n).pump(Console.println,T(Void.Read,n-1),fmt.fmt);\\n});\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Magic-squares-of-odd-order"}}},{"rowIdx":463,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Magic_squares_of_singly_even_order\n","language":"00-META"},{"code":"A [[wp:Magic_square|magic square]] is an '''NxN''' square matrix whose numbers consist of consecutive numbers arranged so that the sum of each row and column, ''and'' both diagonals are equal to the same sum (which is called the ''magic number'' or ''magic constant''). \n\nA magic square of singly even order has a size that is a multiple of 4, plus 2 (e.g. 6, 10, 14). This means that the subsquares have an odd size, which plays a role in the construction.\n<br><br>\n;Task\nCreate a magic square of 6 x 6.\n<br><br>\n\n; Related tasks\n* [[Magic squares of odd order]]\n* [[Magic squares of doubly even order]]<br><br>\n\n; See also\n* [http://www.1728.org/magicsq3.htm Singly Even Magic Squares (1728.org)]<br><br>\n<br><br>\n\n","language":"00-TASK"},{"code":"-V LOG_10 = 2.302585092994\n\nF build_oms(=s)\n I s % 2 == 0\n s++\n V q = [[0] * s] * s\n V p = 1\n V i = s I/ 2\n V j = 0\n\n L p <= (s * s)\n q[i][j] = p\n V ti = i + 1\n I ti >= s\n ti = 0\n V tj = j - 1\n I tj < 0\n tj = s - 1\n I q[ti][tj] != 0\n ti = i\n tj = j + 1\n i = ti\n j = tj\n p++\n\n R (q, s)\n\nF build_sems(=s)\n I s % 2 == 1\n s++\n L s % 4 == 0\n s += 2\n V q = [[0] * s] * s\n V z = s I/ 2\n V b = z * z\n V c = 2 * b\n V d = 3 * b\n V o = build_oms(z)\n\n L(j) 0 .< z\n L(i) 0 .< z\n V a = o[0][i][j]\n q[i][j] = a\n q[i + z][j + z] = a + b\n q[i + z][j] = a + c\n q[i][j + z] = a + d\n\n V lc = z I/ 2\n V rc = lc\n L(j) 0 .< z\n L(i) 0 .< s\n I i < lc\n | i > s - rc\n | (i == lc & j == lc)\n I !(i == 0 & j == lc)\n swap(&q[i][j], &q[i][j + z])\n R (q, s)\n\nF display(q)\n V s = q[1]\n print(\" - #. x #.\\n\".format(s, s))\n V k = 1 + Int(floor(log(s * s) / :LOG_10))\n L(j) 0 .< s\n L(i) 0 .< s\n print(String(q[0][i][j]).zfill(k), end' ‘ ’)\n print()\n print(‘Magic sum: #.’.format(s * ((s * s) + 1) I/ 2))\n\nprint(‘Singly Even Magic Square’, end' ‘’)\ndisplay(build_sems(6))\n","language":"11l"},{"code":"* Magic squares of singly even order - 21/04/2021\nMAGSQSE CSECT\n USING MAGSQSE,R13 base register\n B 72(R15) skip savearea\n DC 17F'0' savearea\n SAVE (14,12) save previous context\n ST R13,4(R15) link backward\n ST R15,8(R13) link forward\n LR R13,R15 set addressability\n LH R2,N n\n MH R2,N *n\n LA R2,1(R2) +1\n MH R2,N *n\n SRA R2,1 /2\n STH R2,MAGSUM magsum=n*(n^2+1)/2\n LH R2,N n\n SRA R2,1 /2\n STH R2,ND nd=n/2\n LH R2,ND n\n MH R2,ND *n\n STH R2,ND2 nd2=nd^2\n LH R2,N n\n SH R2,=H'2' -2\n SRA R2,2 /4\n STH R2,LL ll=(n-2)/4\n LH R6,ND nd\n SRA R6,1 /2\n LA R6,1(R6) i=nd/2+1\n LA R7,1 j=1\n LR R5,R7 nr=1\n LH R4,N n\n IF CH,R4,LT,=H'6' THEN if n<6 then\n XPRNT =C'Error: too small',16\n B FIN stop\n ENDIF , endif\n LH R2,N n\n SH R2,=H'2' -2\n SRDA R2,32 ~\n D R2,=F'4' /4\n IF LTR,R2,NZ,R2 THEN if mod(n-2,4)<>0 then\n XPRNT =C'Error: not possible',19\n B FIN stop\n ENDIF , endif\nLOOP EQU * do loop --------------v\n LR R1,R6 i\n LR R2,R7 j\n BAL R14,SQXY r1=@sq(i,j)\n LH R2,SQ(R1) sq(i,j)\n IF LTR,R2,Z,R2 THEN if sq(i,j)=0 then\n STH R5,SQ(R1) sq(i,j)=nr _A\n LR R1,R6 i\n AH R1,ND +nd\n LR R2,R7 j\n AH R2,ND +nd\n BAL R14,SQXY r1=@sq(i+nd,j+nd)\n LR R3,R5 nr\n AH R3,ND2 +nd2\n STH R3,SQ(R1) sq(i+nd,j+nd)=nr+nd2 _B\n LR R1,R6 i\n AH R1,ND +nd\n LR R2,R7 j\n BAL R14,SQXY r1=@sq(i+nd,j)\n LH R3,ND2 nd2\n SLA R3,1 *2\n AR R3,R5 +nr\n STH R3,SQ(R1) sq(i+nd,j)=nr+nd2*2; _C\n LR R1,R6 i\n LR R2,R7 j\n AH R2,ND +nd\n BAL R14,SQXY r1=@sq(i,j+nd)\n LH R3,ND2 nd2\n MH R3,=H'3' *3\n AR R3,R5 +nr\n STH R3,SQ(R1) sq(i,j+nd)=nr+nd2*3; _D\n LR R2,R5 nr\n LH R0,ND nd\n SRDA R2,32 ~\n DR R2,R0 nr/nd\n IF LTR,R2,Z,R2 THEN if mod(nr,nd)=0 then\n LA R7,1(R7) j=j+1\n ELSE , else\n LA R6,1(R6) i=i+1\n BCTR R7,0 j=j-1\n ENDIF , endif\n LA R5,1(R5) nr=nr+1\n ENDIF , endif\n IF CH,R6,GT,ND THEN if i>nd then\n LA R6,1 i=1\n BAL R12,SQIJ r2=sq(i,j)\n DO WHILE=(LTR,R2,NZ,R2) do while sq(i,j)<>0\n LA R6,1(R6) i=i+1\n BAL R12,SQIJ r2=sq(i,j)\n ENDDO , enddo\n ENDIF , endif\n IF CH,R7,LT,=H'1' THEN if j<1 then\n LH R7,ND j=nd\n BAL R12,SQIJ r2=sq(i,j)\n DO WHILE=(LTR,R2,NZ,R2) do while sq(i,j)<>0\n BCTR R7,0 j=j-1\n BAL R12,SQIJ r2=sq(i,j)\n ENDDO , enddo\n ENDIF , endif\n CH R5,ND2 nr>nd2\n BNH LOOP until nr>nd2 ---------^\n LA R7,1 j=1 -- swap left side\n DO WHILE=(CH,R7,LE,ND) do j=1 to nd\n LA R6,1 i=1\n DO WHILE=(CH,R6,LE,LL) do i=1 to ll\n BAL R12,SWAPIJ swap sq(i,j),sq(i,j+nd)\n LA R6,1(R6) i++\n ENDDO , enddo i\n LA R7,1(R7) j++\n ENDDO , enddo j\n LH R7,ND nd\n SRA R7,1 /2\n LA R7,1(R7) j=nd/2+1\n LA R1,1 1\n LR R2,R7 j\n BAL R14,SQXY r1=@sq(1,j)\n LR R3,R1 r3=@sq(1,j)\n LA R1,1 1\n LR R2,R7 j\n AH R2,ND j+nd\n BAL R14,SQXY r1=@sq(1,j+nd)\n BAL R14,SWAPXY swap sq(1,j),sq(1,j+nd)\n LH R1,LL ll\n LA R1,1(R1) ll+1\n LR R2,R7 j\n BAL R14,SQXY r1=@sq(ll+1,j)\n LR R3,R1 r3=@sq(ll+1,j)\n LH R1,LL ll\n LA R1,1(R1) +1\n LR R2,R7 j\n AH R2,ND +nd\n BAL R14,SQXY r1=@sq(ll+1,j+nd)\n BAL R14,SWAPXY swap sq(ll+1,j),sq(ll+1,j+nd)\n LH R5,N n\n SH R5,LL -ll\n LA R5,2(R5) r5=n-ll+2\n LA R7,1 j=1 -- swap right side\n DO WHILE=(CH,R7,LE,ND) do j=1 to nd\n LR R6,R5 i=n-ll+2\n DO WHILE=(CH,R6,LE,N) do i=n-ll+2 to n\n BAL R12,SWAPIJ swap sq(i,j),sq(i,j+nd)\n LA R6,1(R6) i++\n ENDDO , enddo i\n LA R7,1(R7) j++\n ENDDO , enddo j\n LA R7,1 j=1 check columms and rows\n DO WHILE=(CH,R7,LE,N) do j=1 to n\n SR R4,R4 nr=0\n SR R5,R5 nc=0\n LA R6,1 i=1\n DO WHILE=(CH,R6,LE,N) do i=1 to n\n LR R1,R6 i\n LR R2,R7 j\n BAL R14,SQXY r1=@sq(i,j)\n AH R4,SQ(R1) nr=nr+sq(i,j)\n LR R1,R7 j\n LR R2,R6 i\n BAL R14,SQXY r1=@sq(j,i)\n AH R5,SQ(R1) nc=nc+sq(j,i)\n LA R6,1(R6) i++\n ENDDO , enddo i\n IF CH,R4,NE,MAGSUM,OR,CH,R5,NE,MAGSUM THEN\n XPRNT =C'Error: row/col value<>magsum',28\n B FIN stop\n ENDIF , endif\n LA R7,1(R7) j++\n ENDDO , enddo j\n SR R4,R4 nr=0\n SR R5,R5 nc=0\n LA R6,1 i=1\n DO WHILE=(CH,R6,LE,N) do i=1 to n\n LR R1,R6 i\n LR R2,R6 i\n BAL R14,SQXY r1=@sq(i,i)\n AH R4,SQ(R1) nr=nr+sq(i,i)\n LH R1,N n\n SR R1,R6 n-i\n LA R1,1(R1) n-i+1\n LR R2,R1 n-i+1\n BAL R14,SQXY r1=@sq(i,i)\n AH R5,SQ(R1) nc=nc+sq(n-i+1,n-i+1)\n LA R6,1(R6) i++\n ENDDO , enddo i\n IF CH,R4,NE,MAGSUM,OR,CH,R5,NE,MAGSUM THEN\n XPRNT =C'Error: diag value<>magsum',25\n B FIN stop\n ENDIF , endif\n MVC PG(31),=C'Single even magic square size: '\n LH R1,N n\n XDECO R1,XDEC edit n\n MVC PG+31(3),XDEC+9 output n\n XPRNT PG,34 print buffer\n MVC PG(15),=C'The magic sum= '\n LH R1,MAGSUM magsum\n XDECO R1,XDEC edit magsum\n MVC PG+15(4),XDEC+8 output magsum\n XPRNT PG,19 print buffer\n LA R7,1 j=1\n DO WHILE=(CH,R7,LE,N) do j=1 to n\n MVC PG,=CL120' ' clear buffer\n LA R9,PG @buffer\n LA R6,1 i=1\n DO WHILE=(CH,R6,LE,N) do i=1 to n\n LR R1,R6 i\n LR R2,R7 j\n BAL R14,SQXY r1=@sq(i,i)\n LH R2,SQ(R1) sq(i,j)\n XDECO R2,XDEC edit sq(i,j)\n MVC 0(4,R9),XDEC+8 output sq(i,j)\n LA R9,4(R9) @buffer+=4\n LA R6,1(R6) i++\n ENDDO , enddo i\n XPRNT PG,L'PG print buffer\n LA R7,1(R7) j++\n ENDDO , enddo j\nFIN L R13,4(0,R13) restore previous savearea pointer\n RETURN (14,12),RC=0 restore registers from calling save\nSQIJ CNOP 0,4 routine sq(i,j)\n LR R1,R6 i\n LR R2,R7 j\n BAL R14,SQXY r1=@sq(i,j)\n LH R2,SQ(R1) sq(i,j)\n BR R12 return\nSQXY CNOP 0,4 routine sq(r1,r2)\n BCTR R1,0 -1\n MH R1,N *n\n BCTR R2,0 -1\n AR R1,R2 (r1-1)*n+(r2-1)\n SLA R1,1 *2 (H)\n BR R14 return\nSWAPIJ CNOP 0,4 routine swap sq(i,j),sq(i,j+nd)\n LR R1,R6 i\n LR R2,R7 j\n BAL R14,SQXY r1=@sq(i,j)\n LR R3,R1 r3=@sq(i,j)\n LR R1,R6 i\n LR R2,R7 j\n AH R2,ND +nd\n BAL R14,SQXY r1=@sq(i,j+nd)\n BAL R14,SWAPXY swap\n BR R12 return\nSWAPXY CNOP 0,4 routine swap sq(r1),sq(r3)\n LH R0,SQ(R3) r0=sq(r3)\n LH R2,SQ(R1) r2=sq(r1)\n STH R2,SQ(R3) sq(r3)=r2\n STH R0,SQ(R1) sq(r1)=r0\n BR R14 return\nNN EQU 6 <== parameter (6,10,14,18,22,26,...)\nN DC AL2(NN) n\nSQ DC (NN*NN)H'0' array sq(n,n)\nMAGSUM DS H magsum\nND DS H nd\nND2 DS H nd2\nLL DS H ll\nPG DC CL120' ' buffer\nXDEC DS CL12 temp for xdeco\n REGEQU\n END MAGSQSE\n","language":"360-Assembly"},{"code":"BEGIN # construct a magic square of singly even order #\n # the singly even magic square procedure is translated from the Java #\n # sample #\n\n CO begin code from the magic squares of odd order task CO\n\n # construct a magic square of odd order #\n PROC odd magic square = ( INT order ) [,]INT:\n IF NOT ODD order OR order < 1 THEN\n # can't make a magic square of the specified order #\n LOC[ 1 : 0, 1 : 0 ]INT\n ELSE\n # order is OK - construct the square using de la Loubère's #\n # algorithm as in the wikipedia page #\n\n [ 1 : order, 1 : order ]INT square;\n FOR i TO order DO FOR j TO order DO square[ i, j ] := 0 OD OD;\n\n # operator to advance \"up\" the square #\n OP PREV = ( INT pos )INT: IF pos = 1 THEN order ELSE pos - 1 FI;\n # operator to advance \"across right\" or \"down\" the square #\n OP NEXT = ( INT pos )INT: ( pos MOD order ) + 1;\n\n # fill in the square, starting from the middle of the top row #\n INT col := ( order + 1 ) OVER 2;\n INT row := 1;\n FOR i TO order * order DO\n square[ row, col ] := i;\n IF square[ PREV row, NEXT col ] /= 0 THEN\n # the up/right position is already taken, move down #\n row := NEXT row\n ELSE\n # can move up and right #\n row := PREV row;\n col := NEXT col\n FI\n OD;\n\n square\n FI # odd magic square # ;\n\n PROC print square = ( [,]INT square )VOID: # prints the magic square #\n BEGIN\n\n INT order = 1 UPB square;\n\n # calculate print width: negative so leading \"+\"s aren't printed #\n INT width := -1;\n INT mag := order * order;\n WHILE mag >= 10 DO mag OVERAB 10; width -:= 1 OD;\n\n # calculate the \"magic sum\" #\n INT sum := 0;\n FOR i TO order DO sum +:= square[ 1, i ] OD;\n\n # print the square #\n print( ( \"maqic square of order \", whole( order, 0 ) ) );\n print( ( \": sum: \", whole( sum, 0 ), newline ) );\n FOR i TO order DO\n FOR j TO order DO write( ( \" \", whole( square[ i, j ], width ) ) ) OD;\n print( ( newline ) )\n OD\n\n END # print square # ;\n\n CO end code from the magic squares of odd order task CO\n\n # returns a magic square of singly even order n #\n PROC singly even magic square = ( INT n )[,]INT:\n IF n < 6 OR ( n - 2 ) MOD 4 /= 0 THEN\n LOC[ 1 : 0, 1 : 0 ]INT # n is not 2 + a multiple of 4 >= 6 #\n ELSE\n # order is OK #\n INT size = n * n;\n INT half n = n OVER 2;\n INT sub square size = size OVER 4;\n\n [,]INT sub square = odd magic square( half n )[ AT 0, AT 0 ];\n []INT quadrant factors = []INT( 0, 2, 3, 1 )[ AT 0 ];\n [ 0 : n - 1, 0 : n - 1 ]INT result;\n\n FOR r FROM 1 LWB result TO 1 UPB result DO\n FOR c FROM 2 LWB result TO 2 UPB result DO\n INT quadrant = ( r OVER half n ) * 2 + ( c OVER half n );\n result[ r, c ] := sub square[ r MOD half n, c MOD half n ]\n + quadrant factors[ quadrant ] * sub square size\n OD\n OD;\n\n INT n cols left = half n OVER 2;\n INT n cols right = n cols left - 1;\n\n FOR r FROM 1 LWB result TO half n - 1 DO\n FOR c FROM 1 LWB result TO 1 UPB result DO\n IF c < n cols left OR c >= n - n cols right\n OR ( c = n cols left AND r = n cols left )\n THEN\n IF c /= 0 OR r /= n cols left THEN\n INT tmp = result[ r, c ];\n result[ r, c ] := result[ r + half n, c ];\n result[ r + half n, c ] := tmp\n FI\n FI\n OD\n OD;\n\n result[ AT 1, AT 1 ]\n FI # singly even magic square # ;\n\n print square( singly even magic square( 6 ) )\n\nEND\n","language":"ALGOL-68"},{"code":"6>>>>>:00p:2/vv1:%g01p04:%g00::p03*2%g01/g00::-1_@\n\\00g/10g/3*4vv>0g\\-1-30g+1+10g%10g*\\30g+1+10g%1+ +\n:%4+*2/g01g0<vv4*`\\g02\\!`\\0:-!-g02/2g03g04-3*2\\-\\3\n*:p02/4-2:p01<>0g00g20g-`+!!*+10g:**+.:00g%!9+,:^:\n","language":"Befunge"},{"code":" #include<stdlib.h>\n #include<ctype.h>\n #include<stdio.h>\n\n int** oddMagicSquare(int n) {\n if (n < 3 || n % 2 == 0)\n return NULL;\n\n int value = 0;\n int squareSize = n * n;\n int c = n / 2, r = 0,i;\n\n int** result = (int**)malloc(n*sizeof(int*));\n\t\t\n\t\tfor(i=0;i<n;i++)\n\t\t\tresult[i] = (int*)malloc(n*sizeof(int));\n\n while (++value <= squareSize) {\n result[r][c] = value;\n if (r == 0) {\n if (c == n - 1) {\n r++;\n } else {\n r = n - 1;\n c++;\n }\n } else if (c == n - 1) {\n r--;\n c = 0;\n } else if (result[r - 1][c + 1] == 0) {\n r--;\n c++;\n } else {\n r++;\n }\n }\n return result;\n }\n\n int** singlyEvenMagicSquare(int n) {\n if (n < 6 || (n - 2) % 4 != 0)\n return NULL;\n\n int size = n * n;\n int halfN = n / 2;\n int subGridSize = size / 4, i;\n\n int** subGrid = oddMagicSquare(halfN);\n int gridFactors[] = {0, 2, 3, 1};\n int** result = (int**)malloc(n*sizeof(int*));\n\t\t\n\t\tfor(i=0;i<n;i++)\n\t\t\tresult[i] = (int*)malloc(n*sizeof(int));\n\n for (int r = 0; r < n; r++) {\n for (int c = 0; c < n; c++) {\n int grid = (r / halfN) * 2 + (c / halfN);\n result[r][c] = subGrid[r % halfN][c % halfN];\n result[r][c] += gridFactors[grid] * subGridSize;\n }\n }\n\n int nColsLeft = halfN / 2;\n int nColsRight = nColsLeft - 1;\n\n for (int r = 0; r < halfN; r++)\n for (int c = 0; c < n; c++) {\n if (c < nColsLeft || c >= n - nColsRight\n || (c == nColsLeft && r == nColsLeft)) {\n\n if (c == 0 && r == nColsLeft)\n continue;\n\n int tmp = result[r][c];\n result[r][c] = result[r + halfN][c];\n result[r + halfN][c] = tmp;\n }\n }\n\n return result;\n }\n\t\n\tint numDigits(int n){\n\t\tint count = 1;\n\t\t\n\t\twhile(n>=10){\n\t\t\tn /= 10;\n\t\t\tcount++;\n\t\t}\n\t\t\n\t\treturn count;\n\t}\n\t\n\tvoid printMagicSquare(int** square,int rows){\n\t\tint i,j;\n\t\t\n\t\tfor(i=0;i<rows;i++){\n\t\t\tfor(j=0;j<rows;j++){\n\t\t\t\tprintf(\"%*s%d\",rows - numDigits(square[i][j]),\"\",square[i][j]);\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t}\n\t\tprintf(\"\\nMagic constant: %d \", (rows * rows + 1) * rows / 2);\n\t}\n\t\n\tint main(int argC,char* argV[])\n\t{\n\t\tint n;\n\t\t\n\t\tif(argC!=2||isdigit(argV[1][0])==0)\n\t\t\tprintf(\"Usage : %s <integer specifying rows in magic square>\",argV[0]);\n\t\telse{\n\t\t\tn = atoi(argV[1]);\n\t\t\tprintMagicSquare(singlyEvenMagicSquare(n),n);\n\t\t}\n\t\treturn 0;\n\t}\n","language":"C"},{"code":"#include <iostream>\n#include <sstream>\n#include <iomanip>\nusing namespace std;\n\nclass magicSqr\n{\npublic:\n magicSqr() { sqr = 0; }\n ~magicSqr() { if( sqr ) delete [] sqr; }\n\n void create( int d ) {\n if( sqr ) delete [] sqr;\n if( d & 1 ) d++;\n while( d % 4 == 0 ) { d += 2; }\n sz = d;\n sqr = new int[sz * sz];\n memset( sqr, 0, sz * sz * sizeof( int ) );\n fillSqr();\n }\n void display() {\n cout << \"Singly Even Magic Square: \" << sz << \" x \" << sz << \"\\n\";\n cout << \"It's Magic Sum is: \" << magicNumber() << \"\\n\\n\";\n ostringstream cvr; cvr << sz * sz;\n int l = cvr.str().size();\n\n for( int y = 0; y < sz; y++ ) {\n int yy = y * sz;\n for( int x = 0; x < sz; x++ ) {\n cout << setw( l + 2 ) << sqr[yy + x];\n }\n cout << \"\\n\";\n }\n cout << \"\\n\\n\";\n }\nprivate:\n void siamese( int from, int to ) {\n int oneSide = to - from, curCol = oneSide / 2, curRow = 0, count = oneSide * oneSide, s = 1;\n\n while( count > 0 ) {\n bool done = false;\n while ( false == done ) {\n if( curCol >= oneSide ) curCol = 0;\n if( curRow < 0 ) curRow = oneSide - 1;\n done = true;\n if( sqr[curCol + sz * curRow] != 0 ) {\n curCol -= 1; curRow += 2;\n if( curCol < 0 ) curCol = oneSide - 1;\n if( curRow >= oneSide ) curRow -= oneSide;\n\n done = false;\n }\n }\n sqr[curCol + sz * curRow] = s;\n s++; count--; curCol++; curRow--;\n }\n }\n void fillSqr() {\n int n = sz / 2, ns = n * sz, size = sz * sz, add1 = size / 2, add3 = size / 4, add2 = 3 * add3;\n\n siamese( 0, n );\n\n for( int r = 0; r < n; r++ ) {\n int row = r * sz;\n for( int c = n; c < sz; c++ ) {\n int m = sqr[c - n + row];\n\n sqr[c + row] = m + add1;\n sqr[c + row + ns] = m + add3;\n sqr[c - n + row + ns] = m + add2;\n }\n }\n\n int lc = ( sz - 2 ) / 4, co = sz - ( lc - 1 );\n for( int r = 0; r < n; r++ ) {\n int row = r * sz;\n for( int c = co; c < sz; c++ ) {\n sqr[c + row] -= add3;\n sqr[c + row + ns] += add3;\n }\n }\n for( int r = 0; r < n; r++ ) {\n int row = r * sz;\n for( int c = 0; c < lc; c++ ) {\n int cc = c;\n if( r == lc ) cc++;\n sqr[cc + row] += add2;\n sqr[cc + row + ns] -= add2;\n }\n }\n }\n int magicNumber() { return sz * ( ( sz * sz ) + 1 ) / 2; }\n\n void inc( int& a ) { if( ++a == sz ) a = 0; }\n\n void dec( int& a ) { if( --a < 0 ) a = sz - 1; }\n\n bool checkPos( int x, int y ) { return( isInside( x ) && isInside( y ) && !sqr[sz * y + x] ); }\n\n bool isInside( int s ) { return ( s < sz && s > -1 ); }\n\n int* sqr;\n int sz;\n};\nint main( int argc, char* argv[] ) {\n magicSqr s; s.create( 6 );\n s.display();\n return 0;\n}\n","language":"C++"},{"code":"using System;\n\nclass MagicSquare {\n public static int[,] MagicSquareOdd(int n) {\n if (n < 3 || n % 2 == 0) {\n throw new ArgumentException(\"Base must be odd and > 2\");\n }\n int value = 1;\n int gridSize = n * n;\n int c = n / 2, r = 0;\n int[,] result = new int[n, n];\n\n while (value <= gridSize) {\n result[r, c] = value;\n int newR = r == 0 ? n - 1 : r - 1;\n int newC = c == n - 1 ? 0 : c + 1;\n if (result[newR, newC] != 0) {\n r++;\n } else {\n r = newR;\n c = newC;\n }\n value++;\n }\n\n return result;\n }\n\n public static int[,] MagicSquareSinglyEven(int n) {\n if (n < 6 || (n - 2) % 4 != 0) {\n throw new ArgumentException(\"Base must be a positive multiple of 4 plus 2\");\n }\n\n int size = n * n;\n int halfN = n / 2;\n int subSquareSize = size / 4;\n int[,] subSquare = MagicSquareOdd(halfN);\n int[] quadrantFactors = new int[] {0, 2, 3, 1};\n int[,] result = new int[n, n];\n\n for (int r = 0; r < n; r++) {\n for (int c = 0; c < n; c++) {\n int quadrant = (r / halfN) * 2 + (c / halfN);\n result[r, c] = subSquare[r % halfN, c % halfN] + quadrantFactors[quadrant] * subSquareSize;\n }\n }\n\n int nColsLeft = halfN / 2;\n int nColsRight = nColsLeft - 1;\n\n for (int r = 0; r < halfN; r++) {\n for (int c = 0; c < n; c++) {\n if (c < nColsLeft || c >= n - nColsRight || (c == nColsLeft && r == nColsLeft)) {\n if (!(c == 0 && r == nColsLeft)) {\n int tmp = result[r, c];\n result[r, c] = result[r + halfN, c];\n result[r + halfN, c] = tmp;\n }\n }\n }\n }\n\n return result;\n }\n\n static void Main(string[] args) {\n const int n = 6;\n try {\n var msse = MagicSquareSinglyEven(n);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n Console.Write($\"{msse[i, j],2} \");\n }\n Console.WriteLine();\n }\n Console.WriteLine($\"\\nMagic constant: {(n * n + 1) * n / 2}\");\n } catch (Exception ex) {\n Console.WriteLine(ex.Message);\n }\n }\n}\n","language":"C-sharp"},{"code":"import std.exception;\nimport std.stdio;\n\nvoid main() {\n int n = 6;\n foreach (row; magicSquareSinglyEven(n)) {\n foreach (x; row) {\n writef(\"%2s \", x);\n }\n writeln();\n }\n writeln(\"\\nMagic constant: \", (n * n + 1) * n / 2);\n}\n\nint[][] magicSquareOdd(const int n) {\n enforce(n >= 3 && n % 2 != 0, \"Base must be odd and >2\");\n\n int value = 0;\n int gridSize = n * n;\n int c = n / 2;\n int r = 0;\n\n int[][] result = new int[][](n, n);\n\n while(++value <= gridSize) {\n result[r][c] = value;\n if (r == 0) {\n if (c == n - 1) {\n r++;\n } else {\n r = n - 1;\n c++;\n }\n } else if (c == n - 1) {\n r--;\n c = 0;\n } else if (result[r - 1][c + 1] == 0) {\n r--;\n c++;\n } else {\n r++;\n }\n }\n\n return result;\n}\n\nint[][] magicSquareSinglyEven(const int n) {\n enforce(n >= 6 && (n - 2) % 4 == 0, \"Base must be a positive multiple of four plus 2\");\n\n int size = n * n;\n int halfN = n / 2;\n int subSquareSize = size / 4;\n\n int[][] subSquare = magicSquareOdd(halfN);\n int[] quadrantFactors = [0, 2, 3, 1];\n int[][] result = new int[][](n, n);\n\n for (int r = 0; r < n; r++) {\n for (int c = 0; c < n; c++) {\n int quadrant = (r / halfN) * 2 + (c / halfN);\n result[r][c] = subSquare[r % halfN][c % halfN];\n result[r][c] += quadrantFactors[quadrant] * subSquareSize;\n }\n }\n\n int nColsLeft = halfN / 2;\n int nColsRight = nColsLeft - 1;\n\n for (int r = 0; r < halfN; r++) {\n for (int c = 0; c < n; c++) {\n if (c < nColsLeft || c >= n - nColsRight\n || (c == nColsLeft && r == nColsLeft)) {\n if (c == 0 && r == nColsLeft) {\n continue;\n }\n\n int tmp = result[r][c];\n result[r][c] = result[r + halfN][c];\n result[r + halfN][c] = tmp;\n }\n }\n }\n\n return result;\n}\n","language":"D"},{"code":"[Magic squares of singly even order, for Rosetta Code.\n EDSAC program, Initial Orders 2.]\n[=============================================================================]\n[Uses Strachey's method, but with the square rotated 90 degrees clockwise.\n Let the side be 2q. The square is divided into 4 quadrants each of side q.\n In each quadrant, a 0-based magic square is created by De la Loubere's rule.\n The final square is got by adding k*q^2 + 1 to each entry, where 0 <= k <= 3.]\n[=============================================================================]\n [Arrange the storage]\n T45K P56F [H parameter: subroutine to print string]\n T46K P100F [N parameter: subroutine to print number]\n T47K P200F [M parameter: main routine]\n[Main routine]\n E25K TM GK\n[Variables]\n [0] PF [m, where side of square = 4*m + 2]\n [1] PF [q = side of a quadrant = 2*m + 1]\n [2] PF [q^2]\n [3] PF [negative counter for columns]\n [4] PF [negative counter for rows]\n [5] PF [q*u for De la Loubere's method]\n [6] PF [v for De la Loubere's method]\n [7] PF [value of q*u at start of row]\n [8] PF [ditto v]\n [9] PF [add-on k*q^2 + 1 for left half of row]\n [10] PF [add-on k*q^2 + 1 for right half of row]\n [In the top two quadrants, the left and right add-ons are swapped for\n \"special\" cells: (1) centre cell of top row (2) centre cell of quadrant.]\n [11] PF [EDSAC null if left & right add-ons are to be swapped; else 0]\n [12] PF [value of current special cell]\n[Constants]\n [13] K4096F [EDSAC null, i.e. 10000000000000000 binary]\n [14] !F [space]\n [15] @F [carriage return]\n [16] &F [line feed]\n [17] PD [17-bit constant 1]\n [18] P10F [10 in address field (test for '0' on phone dial)]\n[Strings, terminated by EDSAC null]\n [19] K2048FMFAFGFIFCF!FSFQFUFAFRFEF!FOFFF!FOFRFDFEFRF!F#FRF*FMF#FZFWF@F&FK4096F\n [52] K2048FDFIFAFLF!FMF!F#FKFPF!F*FTFOF!FCFAFNFCFEFLF#FLF!FK4096F\n [78] K2048FSFTFRFAFCFHFEFYF!F#FKF*FRFOFTFAFTFEFDF#FLFCF@F&FK4096F\n[Enter with acc = 0]\n [104] A104@ GH A19@ [print header: says side of square = 4*m + 2]\n [107] A107@ GH A52@ [prompt user to enter m on phone dial]\n ZF [halt machine, restarts when user dials]\n [Here acc holds number of pulses in address field]\n S18@ [test wheter user dialled '0' (10 pulses)]\n E183@ [jump to exit if so]\n A18@ [restore acc after test]\n L512F UF [shift 11 left, to 0F for printing]\n OF O15@ O16@ [print m followed by CR, LF]\n R512F [shift back 11 right; acc = 2m right-justified]\n A17@ U1@ [store q = 2m + 1 = n/2, right justified]\n RD T@ [shift 1 right, store m right-justified]\n H1@ V1@ [acc := q^2]\n L64F L64F [16 left to adjust scaling after mult.]\n T2@ [store q^2]\n [129] A129@ GH A78@ [print 'STRACHEY (ROTATED):']\n A14@ T1F [use space for leading zeros when printing]\n[In each quadrant, use De la Loubere's method. 0-based entry is q*u + v\n where u, v are digits in base q. Example for m = 2, q = 2*m + 1 = 5:\n u = 2 1 0 4 3 v = 0 4 3 2 1 At top left, u = m, v = 0\n 3 2 1 0 4 2 1 0 4 3 Moving right, u and v decrease by 1 mod q\n 4 3 2 1 0 4 5 2 1 0 Moving down, u increases by 1 mod q\n 0 4 3 2 1 1 0 4 3 2 v increases by 2 mod q\n 1 0 4 3 2 3 2 1 0 4]\n H1@ V@ [acc := q*m]\n L64F L64F [16 left to adjust integer scaling scaling after mult.]\n T7@ [store q*u at start of top row]\n T8@ [v at start of top row := 0]\n[At the start of each stage, set counter to m - (number of rows in that stage)]\n[Stage 1, m rows]\n T4@ [counter := 0]\n A17@ T9@ [add-on for left half of row = 1]\n A2@ LD A2@ [acc := 3*q^2]\n A17@ T10@ [add-on for right half of row = 3q^2 + 1]\n [Special cell is centre of top row; value is m + 1]\n A@ A17@ T12@ [special pass m + 1 to subroutine]\n [151] A151@ G185@ [call subroutine to do stage 1]\n[Stage 2, m + 1 rows]\n S17@ T4@ [counter := -1]\n A10@ T9@ [add-on for left half of row = 3q^2 + 1]\n A17@ T10@ [add-on for right half of row = 1]\n [Special cell is at centre of quadrant; value id (q^2 - 1)/2]\n A2@ RD T12@ [shift q^2 1 right to get value (since q is pdd)]\n [162] A162@ G185@ [call subroutine to do stage 2]\n[Stage 3, m + 2 rows. Here acc = 0.]\n S2F T4@ [counter := -2]\n A9@ S2@ U10@ [add-on for right half of row = 2q^2 + 1]\n S2@ T9@ [add-on for left half of row = q^2 + 1]\n S17@ T12@ [no special cell (value < 0) in stages 3 & 4]\n [173] A173@ G185@ [call subroutine to do stage 3]\n[Stage 4, m - 1 rows]\n A17@ T4@ [counter := 1]\n A10@ U9@ [add-on for left half of row = 2q^2 + 1]\n S2@ T10@ [add-on for right half of row = q^2 + 1]\n [181] A181@ G185@ [call subroutine to do stage 4]\n [183] O13@ [done; print null]\n ZF [halt the machine]\n[Subroutine to write the rows in one of the 4 stages.\n Shares storage with the main routine.]\n [185] A3F T256@ [plant return link as usual]\n S@ [negative row counter := -m]\n A4@ [plus adjustment set by caller]\n E256@ [exit if nothing to do (happens for 6x6, stage 4)]\n [190] T4@ [outer loop: update row counter]\n [Start of a row. Goes across 2 quadrants.\n Recall that 0-based entry is q*u + v where u, v are digits in base q]\n S1@ LD T3@ [negative column counter := -2*q]\n A7@ T5@ [reset q*u for start of row]\n A8@ U6@ [same for v]\n [Next column. Here acc contains v (the second digit)]\n [198] A5@ [inner loop: add q*u where u = first digit]\n T4F [park 0-based entry in 4F]\n [Add on an amount depending on whether it's left or right quadrant.\n In stages 1 and 2, the left and right add-ons are swapped for certain cells.]\n T11@ [say not swapped]\n A12@ [load special cell if any]\n G210@ [jump if none (value < 0)]\n S4F [compare with cell entry]\n G210@ S17@ E210@ [jump if different]\n TF A13@ T11@ [set flag in sign bit to reverse comparison]\n [210] TF [clear acc]\n A3@ A1@ [test for left or right quadrant]\n A11@ [reverse test if flag was set above]\n E218@ [jump if right quadrant]\n TF [clear acc]\n A9@ [load add-on for left quadrant]\n E220@ [join common code]\n [218] TF [clear acc]\n A10@ [load add-on for right quadrant]\n [220] A4F TF [common: final value of entry to 0F for printing]\n [222] A222@ GN [print]\n A3@ A17@ [inc negative column count]\n E239@ [jump if row is complete]\n T3@ [update column count]\n [Next cell in row]\n A5@ S1@ E232@ [dec q*u by q, skip if result >= 0]\n A2@ [else wrap round by adding q^2]\n [232] T5@ [update q*u]\n A6@ S17@ E237@ [dec v by 1, skip if result >= 0]\n A1@ [else wrap round by adding q]\n [237] U6@ [update v, keep new v in acc]\n E198@ [loop back]\n [Here when row finished]\n [239] O15@ O16@ [print CR, LF]\n A7@ A1@ [update value of u at start of row]\n S2@ E246@ [if >= q^2 then subtract q^2]\n A2@ [else restore acc after test]\n [246] T7@ [update value mod q^2]\n A8@ A2F [similarly inc v mod q]\n S1@ E252@ A1@\n [252] T8@\n A4@ A17@ G190@ [inc negative row count, loop till done]\n [256] ZF [(planted) jump back to caller]\n\n[Subroutine to print a string.\n Input: A order for first character must follow subroutine call.\n String is terminated with EDSAC null, which is sent to the teleprinter.]\n E25K TH\n GKA18@U17@S19@T4@AFT6@AFUFOFE12@A20@G16@TFA6@A2FG5@TFZFU3FU1FK2048F\n\n[Subroutine to print non-negative 17-bit integer.\n Parameters: 0F = integer to be printed (not preserved)\n 1F = character for leading zero (preserved)\n Workspace: 4F..7F, 38 locations]\n E25K TN\n GKA3FT34@A1FT7FS35@T6FT4#FAFT4FH36@V4FRDA4#FR1024FH37@E23@O7FA2F\n T6FT5FV4#FYFL8FT4#FA5FL1024FUFA6FG16@OFTFT7FA6FG17@ZFP4FZ219DTF\n\n[================ M parameter again ================]\n E25K TM GK\n E104Z [define entry point]\n PF [acc = 0 on entry]\n","language":"EDSAC-order-code"},{"code":"defmodule Magic_square do\n @lux %{ L: [4, 1, 2, 3], U: [1, 4, 2, 3], X: [1, 4, 3, 2] }\n\n def singly_even(n) when rem(n-2,4)!=0, do: raise ArgumentError, \"must be even, but not divisible by 4.\"\n def singly_even(2), do: raise ArgumentError, \"2x2 magic square not possible.\"\n def singly_even(n) do\n n2 = div(n, 2)\n oms = odd_magic_square(n2)\n mat = make_lux_matrix(n2)\n square = synthesis(n2, oms, mat)\n IO.puts to_string(n, square)\n square\n end\n\n defp odd_magic_square(m) do # zero beginning, it is 4 multiples.\n for i <- 0..m-1, j <- 0..m-1, into: %{},\n do: {{i,j}, (m*(rem(i+j+1+div(m,2),m)) + rem(i+2*j-5+2*m, m)) * 4}\n end\n\n defp make_lux_matrix(m) do\n center = div(m, 2)\n lux = List.duplicate(:L, center+1) ++ [:U] ++ List.duplicate(:X, m-center-2)\n (for {x,i} <- Enum.with_index(lux), j <- 0..m-1, into: %{}, do: {{i,j}, x})\n |> Map.put({center, center}, :U)\n |> Map.put({center+1, center}, :L)\n end\n\n defp synthesis(m, oms, mat) do\n range = 0..m-1\n Enum.reduce(range, [], fn i,acc ->\n {row0, row1} = Enum.reduce(range, {[],[]}, fn j,{r0,r1} ->\n x = oms[{i,j}]\n [lux0, lux1, lux2, lux3] = @lux[mat[{i,j}]]\n {[x+lux0, x+lux1 | r0], [x+lux2, x+lux3 | r1]}\n end)\n [row0, row1 | acc]\n end)\n end\n\n defp to_string(n, square) do\n format = String.duplicate(\"~#{length(to_char_list(n*n))}w \", n) <> \"\\n\"\n Enum.map_join(square, fn row ->\n :io_lib.format(format, row)\n end)\n end\nend\n\nMagic_square.singly_even(6)\n","language":"Elixir"},{"code":"' version 18-03-2016\n' compile with: fbc -s console\n' singly even magic square 6, 10, 14, 18...\n\nSub Err_msg(msg As String)\n Print msg\n Beep : Sleep 5000, 1 : Exit Sub\nEnd Sub\n\nSub se_magicsq(n As UInteger, filename As String = \"\")\n\n ' filename <> \"\" then save square in a file\n ' filename can contain directory name\n ' if filename exist it will be overwriten, no error checking\n\n If n < 6 Then\n Err_msg( \"Error: n is to small\")\n Exit Sub\n End If\n\n If ((n -2) Mod 4) <> 0 Then\n Err_msg \"Error: not possible to make singly\" + _\n \" even magic square size \" + Str(n)\n Exit Sub\n End If\n\n Dim As UInteger sq(1 To n, 1 To n)\n Dim As UInteger magic_sum = n * (n ^ 2 +1) \\ 2\n Dim As UInteger sq_d_2 = n \\ 2, q2 = sq_d_2 ^ 2\n Dim As UInteger l = (n -2) \\ 4\n Dim As UInteger x = sq_d_2 \\ 2 + 1, y = 1, nr = 1\n Dim As String frmt = String(Len(Str(n * n)) +1, \"#\")\n\n ' fill pattern A C\n ' D B\n ' main loop for creating magic square in section A\n ' the value for B,C and D is derived from A\n ' uses the FreeBASIC odd order magic square routine\n Do\n If sq(x, y) = 0 Then\n sq(x , y ) = nr ' A\n sq(x + sq_d_2, y + sq_d_2) = nr + q2 ' B\n sq(x + sq_d_2, y ) = nr + q2 * 2 ' C\n sq(x , y + sq_d_2) = nr + q2 * 3 ' D\n If nr Mod sq_d_2 = 0 Then\n y += 1\n Else\n x += 1 : y -= 1\n End If\n nr += 1\n End If\n If x > sq_d_2 Then\n x = 1\n Do While sq(x,y) <> 0\n x += 1\n Loop\n End If\n If y < 1 Then\n y = sq_d_2\n Do While sq(x,y) <> 0\n y -= 1\n Loop\n End If\n Loop Until nr > q2\n\n\n ' swap left side\n For y = 1 To sq_d_2\n For x = 1 To l\n Swap sq(x, y), sq(x,y + sq_d_2)\n Next\n Next\n ' make indent\n y = (sq_d_2 \\ 2) +1\n Swap sq(1, y), sq(1, y + sq_d_2) ' was swapped, restore to orignal value\n Swap sq(l +1, y), sq(l +1, y + sq_d_2)\n\n ' swap right side\n For y = 1 To sq_d_2\n For x = n - l +2 To n\n Swap sq(x, y), sq(x,y + sq_d_2)\n Next\n Next\n\n ' check columms and rows\n For y = 1 To n\n nr = 0 : l = 0\n For x = 1 To n\n nr += sq(x,y)\n l += sq(y,x)\n Next\n If nr <> magic_sum Or l <> magic_sum Then\n Err_msg \"Error: value <> magic_sum\"\n Exit Sub\n End If\n Next\n\n ' check diagonals\n nr = 0 : l = 0\n For x = 1 To n\n nr += sq(x, x)\n l += sq(n - x +1, n - x +1)\n Next\n If nr <> magic_sum Or l <> magic_sum Then\n Err_msg \"Error: value <> magic_sum\"\n Exit Sub\n End If\n\n ' printing square's on screen bigger when\n ' n > 19 results in a wrapping of the line\n Print \"Single even magic square size: \"; n; \"*\"; n\n Print \"The magic sum = \"; magic_sum\n Print\n For y = 1 To n\n For x = 1 To n\n Print Using frmt; sq(x, y);\n Next\n Print\n Next\n\n ' output magic square to a file with the name provided\n If filename <> \"\" Then\n nr = FreeFile\n Open filename For Output As #nr\n Print #nr, \"Single even magic square size: \"; n; \"*\"; n\n Print #nr, \"The magic sum = \"; magic_sum\n Print #nr,\n For y = 1 To n\n For x = 1 To n\n Print #nr, Using frmt; sq(x,y);\n Next\n Print #nr,\n Next\n Close #nr\n End If\n\nEnd Sub\n\n' ------=< MAIN >=------\n\nse_magicsq(6, \"magicse6.txt\") : Print\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 \"log\"\n)\n\nfunc magicSquareOdd(n int) ([][]int, error) {\n if n < 3 || n%2 == 0 {\n return nil, fmt.Errorf(\"base must be odd and > 2\")\n }\n value := 1\n gridSize := n * n\n c, r := n/2, 0\n result := make([][]int, n)\n\n for i := 0; i < n; i++ {\n result[i] = make([]int, n)\n }\n\n for value <= gridSize {\n result[r][c] = value\n if r == 0 {\n if c == n-1 {\n r++\n } else {\n r = n - 1\n c++\n }\n } else if c == n-1 {\n r--\n c = 0\n } else if result[r-1][c+1] == 0 {\n r--\n c++\n } else {\n r++\n }\n value++\n }\n return result, nil\n}\n\nfunc magicSquareSinglyEven(n int) ([][]int, error) {\n if n < 6 || (n-2)%4 != 0 {\n return nil, fmt.Errorf(\"base must be a positive multiple of 4 plus 2\")\n }\n size := n * n\n halfN := n / 2\n subSquareSize := size / 4\n subSquare, err := magicSquareOdd(halfN)\n if err != nil {\n return nil, err\n }\n quadrantFactors := [4]int{0, 2, 3, 1}\n result := make([][]int, n)\n\n for i := 0; i < n; i++ {\n result[i] = make([]int, n)\n }\n\n for r := 0; r < n; r++ {\n for c := 0; c < n; c++ {\n quadrant := r/halfN*2 + c/halfN\n result[r][c] = subSquare[r%halfN][c%halfN]\n result[r][c] += quadrantFactors[quadrant] * subSquareSize\n }\n }\n\n nColsLeft := halfN / 2\n nColsRight := nColsLeft - 1\n\n for r := 0; r < halfN; r++ {\n for c := 0; c < n; c++ {\n if c < nColsLeft || c >= n-nColsRight ||\n (c == nColsLeft && r == nColsLeft) {\n if c == 0 && r == nColsLeft {\n continue\n }\n tmp := result[r][c]\n result[r][c] = result[r+halfN][c]\n result[r+halfN][c] = tmp\n }\n }\n }\n return result, nil\n}\n\nfunc main() {\n const n = 6\n msse, err := magicSquareSinglyEven(n)\n if err != nil {\n log.Fatal(err)\n }\n for _, row := range msse {\n for _, x := range row {\n fmt.Printf(\"%2d \", x)\n }\n fmt.Println()\n }\n fmt.Printf(\"\\nMagic constant: %d\\n\", (n*n+1)*n/2)\n}\n","language":"Go"},{"code":"import qualified Data.Map.Strict as M\nimport Data.List (transpose, intercalate)\nimport Data.Maybe (fromJust, isJust)\nimport Control.Monad (forM_)\nimport Data.Monoid ((<>))\n\nmagic :: Int -> [[Int]]\nmagic n = mapAsTable ((4 * n) + 2) (hiResMap n)\n\n-- Order of square -> sequence numbers keyed by cartesian coordinates\nhiResMap :: Int -> M.Map (Int, Int) Int\nhiResMap n =\n let mapLux = luxMap n\n mapSiam = siamMap n\n in M.fromList $\n foldMap\n (\\(xy, n) ->\n luxNums xy (fromJust (M.lookup xy mapLux)) ((4 * (n - 1)) + 1))\n (M.toList mapSiam)\n\n-- LUX table coordinate -> L|U|X -> initial number -> 4 numbered coordinates\nluxNums :: (Int, Int) -> Char -> Int -> [((Int, Int), Int)]\nluxNums xy lux n =\n zipWith (\\x d -> (x, n + d)) (hiRes xy) $\n case lux of\n 'L' -> [3, 0, 1, 2]\n 'U' -> [0, 3, 1, 2]\n 'X' -> [0, 3, 2, 1]\n _ -> [0, 0, 0, 0]\n\n-- Size of square -> integers keyed by coordinates -> rows of integers\nmapAsTable :: Int -> M.Map (Int, Int) Int -> [[Int]]\nmapAsTable nCols xyMap =\n let axis = [0 .. nCols - 1]\n in fmap (fromJust . flip M.lookup xyMap) <$>\n (axis >>= \\y -> [axis >>= \\x -> [(x, y)]])\n\n-- Dimension of LUX table -> LUX symbols keyed by coordinates\nluxMap :: Int -> M.Map (Int, Int) Char\nluxMap n =\n (M.fromList . concat) $\n zipWith\n (\\y xs -> (zipWith (\\x c -> ((x, y), c)) [0 ..] xs))\n [0 ..]\n (luxPattern n)\n\n-- LUX dimension -> square of L|U|X cells with two mixed rows\nluxPattern :: Int -> [String]\nluxPattern n =\n let d = (2 * n) + 1\n [ls, us] = replicate n <$> \"LU\"\n [lRow, xRow] = replicate d <$> \"LX\"\n in replicate n lRow <> [ls <> ('U' : ls)] <> [us <> ('L' : us)] <>\n replicate (n - 1) xRow\n\n-- Highest zero-based index of grid -> Siamese indices keyed by coordinates\nsiamMap :: Int -> M.Map (Int, Int) Int\nsiamMap n =\n let uBound = (2 * n)\n sPath uBound sMap (x, y) n =\n let newMap = M.insert (x, y) n sMap\n in if y == uBound && x == quot uBound 2\n then newMap\n else sPath uBound newMap (nextSiam uBound sMap (x, y)) (n + 1)\n in sPath uBound (M.fromList []) (n, 0) 1\n\n-- Highest index of square -> Siam xys so far -> xy -> next xy coordinate\nnextSiam :: Int -> M.Map (Int, Int) Int -> (Int, Int) -> (Int, Int)\nnextSiam uBound sMap (x, y) =\n let alt (a, b)\n | a > uBound && b < 0 = (uBound, 1) -- Top right corner ?\n | a > uBound = (0, b) -- beyond right edge ?\n | b < 0 = (a, uBound) -- above top edge ?\n | isJust (M.lookup (a, b) sMap) = (a - 1, b + 2) -- already filled ?\n | otherwise = (a, b) -- Up one, right one.\n in alt (x + 1, y - 1)\n\n-- LUX cell coordinate -> four coordinates at higher resolution\nhiRes :: (Int, Int) -> [(Int, Int)]\nhiRes (x, y) =\n let [col, row] = (* 2) <$> [x, y]\n [col1, row1] = succ <$> [col, row]\n in [(col, row), (col1, row), (col, row1), (col1, row1)]\n\n-- TESTS ----------------------------------------------------------------------\nchecked :: [[Int]] -> (Int, Bool)\nchecked square = (h, all (h ==) t)\n where\n diagonals = fmap (flip (zipWith (!!)) [0 ..]) . ((:) <*> (return . reverse))\n h:t = sum <$> square <> transpose square <> diagonals square\n\ntable :: String -> [[String]] -> [String]\ntable delim rows =\n let justifyRight c n s = drop (length s) (replicate n c <> s)\n in intercalate delim <$>\n transpose\n ((fmap =<< justifyRight ' ' . maximum . fmap length) <$> transpose rows)\n\nmain :: IO ()\nmain =\n forM_ [1, 2, 3] $\n \\n -> do\n let test = magic n\n putStrLn $ unlines (table \" \" (fmap show <$> test))\n print $ checked test\n putStrLn \"\"\n","language":"Haskell"},{"code":"odd =: i:@<.@-: |.\"0 1&|:^:2 >:@i.@,~\nt =: ((*: * i.@4:) +\"0 2 odd)@-:\nl =: (f=:$~ # , #)@((<. , >.)@%&4 # (1: , 0:))\nsh =: <:@-: * (bn=:-: # 2:) #: (2: ^ <.@%&4)\nlm =: sh |.\"0 1 l\nrm =: f@bn #: <:@(2: ^ <:@<.@%&4)\na =: ((-.@lm * {.@t) + lm * {:@t)\nb =: ((-.@rm * 1&{@t) + rm * 2&{@t)\nc =: ((rm * 1&{@t) + -.@rm * 2&{@t)\nd =: ((lm * {.@t) + -.@lm * {:@t)\nm =: (a ,\"1 c) , d ,\"1 b\n","language":"J"},{"code":"odd=: i. |.\"_1&|:^:2 >:@i.@,~\nstrachey2=: (odd +/~ (0 2,:3 1) * *:)@-:\nexchange=: (* -.) + (* |.)~\ncolumns=: {: | i.\nstrachey3=: exchange (,:~1 0) * ((2%~1-~{:) > columns)@$\nstrachey4=: exchange (,:~0 1) * ((2%~1+{:)< columns)@$\nstrachey5=: exchange (,:~1 0) */ (i.@,~@{: e. ((]*0 1+[)-:@<:)@{:)@$\n\nstrachey=: [: ,/ [: ,./\"3 strachey5 @ strachey4 @ strachey3 @ strachey2\n","language":"J"},{"code":"public class MagicSquareSinglyEven {\n\n public static void main(String[] args) {\n int n = 6;\n for (int[] row : magicSquareSinglyEven(n)) {\n for (int x : row)\n System.out.printf(\"%2s \", x);\n System.out.println();\n }\n System.out.printf(\"\\nMagic constant: %d \", (n * n + 1) * n / 2);\n }\n\n public static int[][] magicSquareOdd(final int n) {\n if (n < 3 || n % 2 == 0)\n throw new IllegalArgumentException(\"base must be odd and > 2\");\n\n int value = 0;\n int gridSize = n * n;\n int c = n / 2, r = 0;\n\n int[][] result = new int[n][n];\n\n while (++value <= gridSize) {\n result[r][c] = value;\n if (r == 0) {\n if (c == n - 1) {\n r++;\n } else {\n r = n - 1;\n c++;\n }\n } else if (c == n - 1) {\n r--;\n c = 0;\n } else if (result[r - 1][c + 1] == 0) {\n r--;\n c++;\n } else {\n r++;\n }\n }\n return result;\n }\n\n static int[][] magicSquareSinglyEven(final int n) {\n if (n < 6 || (n - 2) % 4 != 0)\n throw new IllegalArgumentException(\"base must be a positive \"\n + \"multiple of 4 plus 2\");\n\n int size = n * n;\n int halfN = n / 2;\n int subSquareSize = size / 4;\n\n int[][] subSquare = magicSquareOdd(halfN);\n int[] quadrantFactors = {0, 2, 3, 1};\n int[][] result = new int[n][n];\n\n for (int r = 0; r < n; r++) {\n for (int c = 0; c < n; c++) {\n int quadrant = (r / halfN) * 2 + (c / halfN);\n result[r][c] = subSquare[r % halfN][c % halfN];\n result[r][c] += quadrantFactors[quadrant] * subSquareSize;\n }\n }\n\n int nColsLeft = halfN / 2;\n int nColsRight = nColsLeft - 1;\n\n for (int r = 0; r < halfN; r++)\n for (int c = 0; c < n; c++) {\n if (c < nColsLeft || c >= n - nColsRight\n || (c == nColsLeft && r == nColsLeft)) {\n\n if (c == 0 && r == nColsLeft)\n continue;\n\n int tmp = result[r][c];\n result[r][c] = result[r + halfN][c];\n result[r + halfN][c] = tmp;\n }\n }\n\n return result;\n }\n}\n","language":"Java"},{"code":"def magicSquareOdd:\n . as $n\n | if ($n < 3 or $n%2 == 0) then \"Base must be odd and > 2\" | error\n else ($n * $n) as $gridSize\n | { value: 1,\n c: (($n/2) | floor),\n r: 0,\n result: []}\n | until (.value > $gridSize;\n .result[.r][.c] = .value\n | if .r == 0\n then if (.c == $n - 1)\n then .r += 1\n else .r = ($n - 1) | .c += 1\n end\n elif (.c == $n - 1)\n then .r += -1\n | .c = 0\n\t elif (.result[.r - 1][.c + 1] == null)\n then .r += -1 | .c += 1\n else .r += 1\n\t end\n | .value += 1 )\n | .result\n end ;\n\ndef magicSquareSinglyEven:\n . as $n\n | if ($n < 6 or ($n - 2) % 4 != 0)\n then \"Base must be a positive multiple of 4 plus 2\" | error\n else ($n * $n) as $size\n | ($n / 2) as $halfN\n | ($size / 4) as $subSquareSize\n | ($halfN|magicSquareOdd) as $subSquare\n | [0, 2, 3, 1] as $quadrantFactors\n | reduce range(0; $n) as $r ({};\n reduce range(0; $n) as $c (.;\n ((($r/$halfN)|floor) * 2 + (($c/$halfN)|floor)) as $quadrant\n | .result[$r][$c] = $subSquare[$r % $halfN][$c % $halfN]\n | .result[$r][$c] += $quadrantFactors[$quadrant] * $subSquareSize ) )\n | (($halfN/2)|floor) as $nColsLeft\n | ($nColsLeft - 1) as $nColsRight\n | reduce range(0; $halfN) as $r (.;\n reduce range(0; $n) as $c (.;\n if ($c < $nColsLeft or $c >= $n - $nColsRight or ($c == $nColsLeft and $r == $nColsLeft))\n\t then if ($c != 0 or $r != $nColsLeft)\n then .result[$r][$c] as $tmp\n | .result[$r][$c] = .result[$r + $halfN][$c]\n | .result[$r + $halfN][$c] = $tmp\n else .\n\t\t end\n else .\n\t end ) )\n | .result\n end ;\n\ndef lpad($len): tostring | ($len - length) as $l | (\" \" * $l)[:$l] + .;\n\ndef task(n):\n \"Magic constant: \\((n * n + 1) * n / 2)\\n\",\n (n|magicSquareSinglyEven[] | map(lpad(3))|join(\" \") );\n\ntask(6)\n","language":"Jq"},{"code":"function oddmagicsquare(order)\n if iseven(order)\n order += 1\n end\n q = zeros(Int, (order, order))\n p = 1\n i = div(order, 2) + 1\n j = 1\n while p <= order * order\n q[i, j] = p\n ti = (i + 1 > order) ? 1 : i + 1\n tj = (j - 1 < 1) ? order : j - 1\n if q[ti, tj] != 0\n ti = i\n tj = j + 1\n end\n i = ti\n j = tj\n p = p + 1\n end\n q, order\nend\n\nfunction singlyevenmagicsquare(order)\n if isodd(order)\n order += 1\n end\n if order % 4 == 0\n order += 2\n end\n q = zeros(Int, (order, order))\n z = div(order, 2)\n b = z * z\n c = 2 * b\n d = 3 * b\n sq, ord = oddmagicsquare(z)\n\n for j in 1:z, i in 1:z\n a = sq[i, j]\n q[i, j] = a\n q[i + z, j + z] = a + b\n q[i + z, j] = a + c\n q[i, j + z] = a + d\n end\n lc = div(z, 2)\n rc = lc - 1\n for j in 1:z, i in 1:order\n if i <= lc || i > order - rc || (i == lc && j == lc)\n if i != 0 || j != lc + 1\n t = q[i, j]\n q[i, j] = q[i, j + z]\n q[i, j + z] = t\n end\n end\n end\n q, order\nend\n\nfunction check(q)\n side = size(q)[1]\n sums = Vector{Int}()\n for n in 1:side\n push!(sums, sum(q[n, :]))\n push!(sums, sum(q[:, n]))\n end\n println(all(x->x==sums[1], sums) ?\n \"Checks ok: all sides add to $(sums[1]).\" : \"Bad sum.\")\nend\n\nfunction display(q)\n r, c = size(q)\n for i in 1:r, j in 1:c\n nstr = lpad(string(q[i, j]), 4)\n print(j % c > 0 ? nstr : \"$nstr\\n\")\n end\nend\n\nfor o in (6, 10)\n println(\"\\nWith order $o:\")\n msq = singlyevenmagicsquare(o)[1]\n display(msq)\n check(msq)\nend\n","language":"Julia"},{"code":"// version 1.0.6\n\nfun magicSquareOdd(n: Int): Array<IntArray> {\n if (n < 3 || n % 2 == 0)\n throw IllegalArgumentException(\"Base must be odd and > 2\")\n\n var value = 0\n val gridSize = n * n\n var c = n / 2\n var r = 0\n val result = Array(n) { IntArray(n) }\n while (++value <= gridSize) {\n result[r][c] = value\n if (r == 0) {\n if (c == n - 1) r++\n else {\n r = n - 1\n c++\n }\n }\n else if (c == n - 1) {\n r--\n c = 0\n }\n else if (result[r - 1][c + 1] == 0) {\n r--\n c++\n }\n else r++\n }\n return result\n}\n\nfun magicSquareSinglyEven(n: Int): Array<IntArray> {\n if (n < 6 || (n - 2) % 4 != 0)\n throw IllegalArgumentException(\"Base must be a positive multiple of 4 plus 2\")\n\n val size = n * n\n val halfN = n / 2\n val subSquareSize = size / 4\n val subSquare = magicSquareOdd(halfN)\n val quadrantFactors = intArrayOf(0, 2, 3, 1)\n val result = Array(n) { IntArray(n) }\n for (r in 0 until n)\n for (c in 0 until n) {\n val quadrant = r / halfN * 2 + c / halfN\n result[r][c] = subSquare[r % halfN][c % halfN]\n result[r][c] += quadrantFactors[quadrant] * subSquareSize\n }\n val nColsLeft = halfN / 2\n val nColsRight = nColsLeft - 1\n for (r in 0 until halfN)\n for (c in 0 until n)\n if (c < nColsLeft || c >= n - nColsRight || (c == nColsLeft && r == nColsLeft)) {\n if (c == 0 && r == nColsLeft) continue\n val tmp = result[r][c]\n result[r][c] = result[r + halfN][c]\n result[r + halfN][c] = tmp\n }\n return result\n}\n\nfun main(args: Array<String>) {\n val n = 6\n for (ia in magicSquareSinglyEven(n)) {\n for (i in ia) print(\"%2d \".format(i))\n println()\n }\n println(\"\\nMagic constant ${(n * n + 1) * n / 2}\")\n}\n","language":"Kotlin"},{"code":"import sequtils, strutils\n\ntype Square = seq[seq[int]]\n\nfunc magicSquareOdd(n: Positive): Square =\n ## Build a magic square of odd order.\n\n assert n >= 3 and (n and 1) != 0, \"base must be odd and greater than 2.\"\n result = newSeqWith(n, newSeq[int](n))\n\n var\n r = 0\n c = n div 2\n value = 0\n\n while value < n * n:\n inc value\n result[r][c] = value\n if r == 0:\n if c == n - 1:\n inc r\n else:\n r = n - 1\n inc c\n elif c == n - 1:\n dec r\n c = 0\n elif result[r - 1][c + 1] == 0:\n dec r\n inc c\n else:\n inc r\n\n\nfunc magicSquareSinglyEven(n: int): Square =\n ## Build a magic square of singly even order.\n\n assert n >= 6 and ((n - 2) and 3) == 0, \"base must be a positive multiple of 4 plus 2.\"\n result = newSeqWith(n, newSeq[int](n))\n\n let\n halfN = n div 2\n subSquareSize = n * n div 4\n subSquare = magicSquareOdd(halfN)\n\n const QuadrantFactors = [0, 2, 3, 1]\n\n for r in 0..<n:\n for c in 0..<n:\n let quadrant = r div halfN * 2 + c div halfN\n result[r][c] = subSquare[r mod halfN][c mod halfN] + QuadrantFactors[quadrant] * subSquareSize\n\n let\n nColsLeft = halfN div 2\n nColsRight = nColsLeft - 1\n\n for r in 0..<halfN:\n for c in 0..<n:\n if c < nColsLeft or c >= n - nColsRight or (c == nColsLeft and r == nColsLeft):\n if c != 0 or r != nColsLeft:\n swap result[r][c], result[r + halfN][c]\n\n\nfunc `$`(square: Square): string =\n ## Return the string representation of a magic square.\n let length = len($(square.len * square.len))\n for row in square:\n result.add row.mapIt(($it).align(length)).join(\" \") & '\\n'\n\n\nwhen isMainModule:\n let n = 6\n echo magicSquareSinglyEven(n)\n echo \"Magic constant = \", n * (n * n + 1) div 2\n","language":"Nim"},{"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;\">swap</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y1</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y2</span><span style=\"color: #0000FF;\">]}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y2</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y1</span><span style=\"color: #0000FF;\">]}</span>\n <span style=\"color: #008080;\">return</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: #008080;\">function</span> <span style=\"color: #000000;\">se_magicsq</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">6</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">mod</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;\">4</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"illegal size (%d)\"</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;\">if</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">sq</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: #000000;\">0</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: #004080;\">integer</span> <span style=\"color: #000000;\">magic_sum</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;\">n</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: #000000;\">sq_d_2</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>\n <span style=\"color: #000000;\">q2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sq_d_2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">l</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;\">2</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">x1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sq_d_2</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;\">x2</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">y1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y2</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- fill pattern a c\n -- d b\n -- main loop for creating magic square in section a\n -- the value for b,c and d is derived from a</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y1</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">x2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">sq_d_2</span>\n <span style=\"color: #000000;\">y2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">y1</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">sq_d_2</span>\n <span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r</span> <span style=\"color: #000080;font-style:italic;\">-- a</span>\n <span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y2</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;\">q2</span> <span style=\"color: #000080;font-style:italic;\">-- b</span>\n <span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y1</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;\">q2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">2</span> <span style=\"color: #000080;font-style:italic;\">-- c</span>\n <span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y2</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;\">q2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">3</span> <span style=\"color: #000080;font-style:italic;\">-- d</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">mod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">sq_d_2</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">y1</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">x1</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">y1</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;\">r</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;\">if</span> <span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">sq_d_2</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">x1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\"><></span> <span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">x1</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;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">y1</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">y1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">sq_d_2</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\"><></span> <span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">y1</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;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">q2</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\n <span style=\"color: #000080;font-style:italic;\">-- swap left side</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;\">sq_d_2</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">y2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">sq_d_2</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;\">l</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">sq</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">swap</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sq</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;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y2</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\n <span style=\"color: #000080;font-style:italic;\">-- make indent</span>\n <span style=\"color: #000000;\">y1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sq_d_2</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;\">y2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">y1</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">sq_d_2</span>\n <span style=\"color: #000000;\">x1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">sq</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">swap</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">x1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">sq</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">swap</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y2</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- swap right side</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;\">sq_d_2</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">y2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">sq_d_2</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">x</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;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">sq</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">swap</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sq</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;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y2</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\n <span style=\"color: #000080;font-style:italic;\">-- check columms and rows</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: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</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: #000000;\">r</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">sq</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: #000000;\">l</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">sq</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>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\"><></span><span style=\"color: #000000;\">magic_sum</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\"><></span><span style=\"color: #000000;\">magic_sum</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"error: value <> magic_sum\"</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 <span style=\"color: #000080;font-style:italic;\">-- check diagonals</span>\n <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</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: #000000;\">r</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">x2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">x2</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;\">r</span><span style=\"color: #0000FF;\"><></span><span style=\"color: #000000;\">magic_sum</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\"><></span><span style=\"color: #000000;\">magic_sum</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"error: value <> magic_sum\"</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;\">return</span> <span style=\"color: #000000;\">sq</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">se_magicsq</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">6</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_IntFmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%3d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">pp_StrFmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</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><span style=\"color: #004600;\">pp_Pause</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">})</span>\n<!--\n","language":"Phix"},{"code":"import math\nfrom sys import stdout\n\nLOG_10 = 2.302585092994\n\n\n# build odd magic square\ndef build_oms(s):\n if s % 2 == 0:\n s += 1\n q = [[0 for j in range(s)] for i in range(s)]\n p = 1\n i = s // 2\n j = 0\n while p <= (s * s):\n q[i][j] = p\n ti = i + 1\n if ti >= s: ti = 0\n tj = j - 1\n if tj < 0: tj = s - 1\n if q[ti][tj] != 0:\n ti = i\n tj = j + 1\n i = ti\n j = tj\n p = p + 1\n\n return q, s\n\n\n# build singly even magic square\ndef build_sems(s):\n if s % 2 == 1:\n s += 1\n while s % 4 == 0:\n s += 2\n\n q = [[0 for j in range(s)] for i in range(s)]\n z = s // 2\n b = z * z\n c = 2 * b\n d = 3 * b\n o = build_oms(z)\n\n for j in range(0, z):\n for i in range(0, z):\n a = o[0][i][j]\n q[i][j] = a\n q[i + z][j + z] = a + b\n q[i + z][j] = a + c\n q[i][j + z] = a + d\n\n lc = z // 2\n rc = lc\n for j in range(0, z):\n for i in range(0, s):\n if i < lc or i > s - rc or (i == lc and j == lc):\n if not (i == 0 and j == lc):\n t = q[i][j]\n q[i][j] = q[i][j + z]\n q[i][j + z] = t\n\n return q, s\n\n\ndef format_sqr(s, l):\n for i in range(0, l - len(s)):\n s = \"0\" + s\n return s + \" \"\n\n\ndef display(q):\n s = q[1]\n print(\" - {0} x {1}\\n\".format(s, s))\n k = 1 + math.floor(math.log(s * s) / LOG_10)\n for j in range(0, s):\n for i in range(0, s):\n stdout.write(format_sqr(\"{0}\".format(q[0][i][j]), k))\n print()\n print(\"Magic sum: {0}\\n\".format(s * ((s * s) + 1) // 2))\n\n\nstdout.write(\"Singly Even Magic Square\")\ndisplay(build_sems(6))\n","language":"Python"},{"code":"def odd_magic_square(n)\n n.times.map{|i| n.times.map{|j| n*((i+j+1+n/2)%n) + ((i+2*j-5)%n) + 1} }\nend\n\ndef single_even_magic_square(n)\n raise ArgumentError, \"must be even, but not divisible by 4.\" unless (n-2) % 4 == 0\n raise ArgumentError, \"2x2 magic square not possible.\" if n == 2\n\n order = (n-2)/4\n odd_square = odd_magic_square(n/2)\n to_add = (0..3).map{|f| f*n*n/4}\n quarts = to_add.map{|f| odd_square.dup.map{|row|row.map{|el| el+f}} }\n\n sq = []\n quarts[0].zip(quarts[2]){|d1,d2| sq << [d1,d2].flatten}\n quarts[3].zip(quarts[1]){|d1,d2| sq << [d1,d2].flatten}\n\n sq = sq.transpose\n order.times{|i| sq[i].rotate!(n/2)}\n swap(sq[0][order], sq[0][-order-1])\n swap(sq[order][order], sq[order][-order-1])\n (order-1).times{|i| sq[-(i+1)].rotate!(n/2)}\n randomize(sq)\nend\n\ndef swap(a,b)\n a,b = b,a\nend\n\ndef randomize(square)\n square.shuffle.transpose.shuffle\nend\n\ndef to_string(square)\n n = square.size\n fmt = \"%#{(n*n).to_s.size + 1}d\" * n\n square.inject(\"\"){|str,row| str << fmt % row << \"\\n\"}\nend\n\nputs to_string(single_even_magic_square(6))\n","language":"Ruby"},{"code":"class Magic_square\n attr_reader :square\n LUX = { L: [[4, 1], [2, 3]], U: [[1, 4], [2, 3]], X: [[1, 4], [3, 2]] }\n\n def initialize(n)\n raise ArgumentError, \"must be even, but not divisible by 4.\" unless (n-2) % 4 == 0\n raise ArgumentError, \"2x2 magic square not possible.\" if n == 2\n @n = n\n oms = odd_magic_square(n/2)\n mat = make_lux_matrix(n/2)\n @square = synthesize(oms, mat)\n puts to_s\n end\n\n def odd_magic_square(n) # zero beginning, it is 4 multiples.\n n.times.map{|i| n.times.map{|j| (n*((i+j+1+n/2)%n) + ((i+2*j-5)%n)) * 4} }\n end\n\n def make_lux_matrix(n)\n center = n / 2\n lux = [*[:L]*(center+1), :U, *[:X]*(n-center-2)]\n matrix = lux.map{|x| Array.new(n, x)}\n matrix[center][center] = :U\n matrix[center+1][center] = :L\n matrix\n end\n\n def synthesize(oms, mat)\n range = 0...@n/2\n range.inject([]) do |matrix,i|\n row = [[], []]\n range.each do |j|\n x = oms[i][j]\n LUX[mat[i][j]].each_with_index{|lux,k| row[k] << lux.map{|y| x+y}}\n end\n matrix << row[0].flatten << row[1].flatten\n end\n end\n\n def to_s\n format = \"%#{(@n*@n).to_s.size}d \" * @n + \"\\n\"\n @square.map{|row| format % row}.join\n end\nend\n\nsq = Magic_square.new(6).square\n","language":"Ruby"},{"code":"use std::env;\n\nfn main() {\n let n: usize =\n match env::args().nth(1).and_then(|arg| arg.parse().ok()).ok_or(\n \"Please specify the size of the magic square, as a positive multiple of 4 plus 2.\",\n ) {\n Ok(arg) if arg % 2 == 1 || arg >= 6 && (arg - 2) % 4 == 0 => arg,\n Err(e) => panic!(e),\n _ => panic!(\"Argument must be a positive multiple of 4 plus 2.\"),\n };\n\n let (ms, mc) = magic_square_singly_even(n);\n println!(\"n: {}\", n);\n println!(\"Magic constant: {}\\n\", mc);\n let width = (n * n).to_string().len() + 1;\n for row in ms {\n for elem in row {\n print!(\"{e:>w$}\", e = elem, w = width);\n }\n println!();\n }\n}\n\nfn magic_square_singly_even(n: usize) -> (Vec<Vec<usize>>, usize) {\n let size = n * n;\n let half = n / 2;\n let sub_square_size = size / 4;\n let sub_square = magic_square_odd(half);\n let quadrant_factors = [0, 2, 3, 1];\n let cols_left = half / 2;\n let cols_right = cols_left - 1;\n\n let ms = (0..n)\n .map(|r| {\n (0..n)\n .map(|c| {\n let localr = if (c < cols_left\n || c >= n - cols_right\n || c == cols_left && r % half == cols_left)\n && !(c == 0 && r % half == cols_left)\n {\n if r >= half {\n r - half\n } else {\n r + half\n }\n } else {\n r\n };\n let quadrant = localr / half * 2 + c / half;\n let v = sub_square[localr % half][c % half];\n v + quadrant_factors[quadrant] * sub_square_size\n })\n .collect()\n })\n .collect::<Vec<Vec<_>>>();\n (ms, (n * n + 1) * n / 2)\n}\n\nfn magic_square_odd(n: usize) -> Vec<Vec<usize>> {\n (0..n)\n .map(|r| {\n (0..n)\n .map(|c| {\n n * (((c + 1) + (r + 1) - 1 + (n >> 1)) % n)\n + (((c + 1) + (2 * (r + 1)) - 2) % n)\n + 1\n })\n .collect::<Vec<_>>()\n })\n .collect::<Vec<Vec<_>>>()\n}\n","language":"Rust"},{"code":"import \"./fmt\" for Fmt\n\nvar magicSquareOdd = Fn.new { |n|\n if (n < 3 || n%2 == 0) Fiber.abort(\"Base must be odd and > 2\")\n var value = 1\n var gridSize = n * n\n var c = (n/2).floor\n var r = 0\n var result = List.filled(n, null)\n for (i in 0...n) result[i] = List.filled(n, 0)\n while (value <= gridSize) {\n result[r][c] = value\n if (r == 0) {\n if (c == n - 1) {\n r = r + 1\n } else {\n r = n - 1\n c = c + 1\n }\n } else if (c == n - 1) {\n r = r - 1\n c = 0\n } else if (result[r - 1][c + 1] == 0) {\n r = r - 1\n c = c + 1\n } else {\n r = r + 1\n }\n value = value + 1\n }\n return result\n}\n\nvar magicSquareSinglyEven = Fn.new { |n|\n if (n < 6 || (n - 2) % 4 != 0) {\n Fiber.abort(\"Base must be a positive multiple of 4 plus 2\")\n }\n var size = n * n\n var halfN = n / 2\n var subSquareSize = size / 4\n var subSquare = magicSquareOdd.call(halfN)\n var quadrantFactors = [0, 2, 3, 1]\n var result = List.filled(n, null)\n for (i in 0...n) result[i] = List.filled(n, 0)\n for (r in 0...n) {\n for (c in 0...n) {\n var quadrant = (r/halfN).floor * 2 + (c/halfN).floor\n result[r][c] = subSquare[r % halfN][c % halfN]\n result[r][c] = result[r][c] + quadrantFactors[quadrant] * subSquareSize\n }\n }\n var nColsLeft = (halfN/2).floor\n var nColsRight = nColsLeft - 1\n for (r in 0...halfN) {\n for (c in 0...n) {\n if (c < nColsLeft || c >= n - nColsRight || (c == nColsLeft && r == nColsLeft)) {\n if (c != 0 || r != nColsLeft) {\n var tmp = result[r][c]\n result[r][c] = result[r + halfN][c]\n result[r + halfN][c] = tmp\n }\n }\n }\n }\n return result\n}\n\nvar n = 6\nfor (ia in magicSquareSinglyEven.call(n)) {\n for (i in ia) Fmt.write(\"$2d \", i)\n System.print()\n}\nSystem.print(\"\\nMagic constant %((n * n + 1) * n / 2)\")\n","language":"Wren"},{"code":"class MagicSquareSinglyEven{\n fcn init(n){ var result=magicSquareSinglyEven(n) }\n fcn toString{\n sink,n:=Sink(String),result.len(); // num collumns\n fmt:=\"%2s \";\n foreach row in (result)\n { sink.write(row.apply('wrap(n){ fmt.fmt(n) }).concat(),\"\\n\") }\n sink.write(\"\\nMagic constant: %d\".fmt((n*n + 1)*n/2));\n sink.close();\n }\n fcn magicSquareOdd(n){\n if (n<3 or n%2==0) throw(Exception.ValueError(\"base must be odd and > 2\"));\n value,gridSize,c,r:=0, n*n, n/2, 0;\n result:=n.pump(List(),n.pump(List(),0).copy); // array[n,n] of zero\n\n while((value+=1)<=gridSize){\n\t result[r][c]=value;\n\t if(r==0){\n\t if(c==n-1) r+=1;\n else{ r=n-1; c+=1; }\n\t }\n\t else if(c==n-1){ r-=1; c=0; }\n\t else if(result[r-1][c+1]==0){ r-=1; c+=1; }\n\t else r+=1;\n }\n result;\n }\n fcn magicSquareSinglyEven(n){\n if (n<6 or (n-2)%4!=0)\n\t throw(Exception.ValueError(\"base must be a positive multiple of 4 +2\"));\n size,halfN,subSquareSize:=n*n, n/2, size/4;\n\n subSquare:=magicSquareOdd(halfN);\n quadrantFactors:=T(0, 2, 3, 1);\n result:=n.pump(List(),n.pump(List(),0).copy); // array[n,n] of zero\n\n foreach r,c in (n,n){\n quadrant:=(r/halfN)*2 + (c/halfN);\n\t result[r][c]=subSquare[r%halfN][c%halfN];\n\t result[r][c]+=quadrantFactors[quadrant]*subSquareSize;\n }\n nColsLeft,nColsRight:=halfN/2, nColsLeft-1;\n foreach r,c in (halfN,n){\n if ( c<nColsLeft or c>=(n-nColsRight) or\n (c==nColsLeft and r==nColsLeft) ){\n\t if(c==0 and r==nColsLeft) continue;\n\t tmp:=result[r][c];\n\t result[r][c]=result[r+halfN][c];\n\t result[r+halfN][c]=tmp;\n\t }\n }\n result\n }\n}\n","language":"Zkl"},{"code":"MagicSquareSinglyEven(6).println();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Magic_squares_of_singly_even_order\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"A [[wp:Magic_square|magic square]] is an '''NxN''' square matrix whose numbers consist of consecutive numbers arranged so that the sum of each row and column, ''and'' both diagonals are equal to the same sum (which is called the ''magic number'' or ''magic constant''). \\n\\nA magic square of singly even order has a size that is a multiple of 4, plus 2 (e.g. 6, 10, 14). This means that the subsquares have an odd size, which plays a role in the construction.\\n<br><br>\\n;Task\\nCreate a magic square of 6 x 6.\\n<br><br>\\n\\n; Related tasks\\n* [[Magic squares of odd order]]\\n* [[Magic squares of doubly even order]]<br><br>\\n\\n; See also\\n* [http://www.1728.org/magicsq3.htm Singly Even Magic Squares (1728.org)]<br><br>\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"-V LOG_10 = 2.302585092994\\n\\nF build_oms(=s)\\n I s % 2 == 0\\n s++\\n V q = [[0] * s] * s\\n V p = 1\\n V i = s I/ 2\\n V j = 0\\n\\n L p <= (s * s)\\n q[i][j] = p\\n V ti = i + 1\\n I ti >= s\\n ti = 0\\n V tj = j - 1\\n I tj < 0\\n tj = s - 1\\n I q[ti][tj] != 0\\n ti = i\\n tj = j + 1\\n i = ti\\n j = tj\\n p++\\n\\n R (q, s)\\n\\nF build_sems(=s)\\n I s % 2 == 1\\n s++\\n L s % 4 == 0\\n s += 2\\n V q = [[0] * s] * s\\n V z = s I/ 2\\n V b = z * z\\n V c = 2 * b\\n V d = 3 * b\\n V o = build_oms(z)\\n\\n L(j) 0 .< z\\n L(i) 0 .< z\\n V a = o[0][i][j]\\n q[i][j] = a\\n q[i + z][j + z] = a + b\\n q[i + z][j] = a + c\\n q[i][j + z] = a + d\\n\\n V lc = z I/ 2\\n V rc = lc\\n L(j) 0 .< z\\n L(i) 0 .< s\\n I i < lc\\n | i > s - rc\\n | (i == lc & j == lc)\\n I !(i == 0 & j == lc)\\n swap(&q[i][j], &q[i][j + z])\\n R (q, s)\\n\\nF display(q)\\n V s = q[1]\\n print(\\\" - #. x #.\\\\n\\\".format(s, s))\\n V k = 1 + Int(floor(log(s * s) / :LOG_10))\\n L(j) 0 .< s\\n L(i) 0 .< s\\n print(String(q[0][i][j]).zfill(k), end' ‘ ’)\\n print()\\n print(‘Magic sum: #.’.format(s * ((s * s) + 1) I/ 2))\\n\\nprint(‘Singly Even Magic Square’, end' ‘’)\\ndisplay(build_sems(6))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Magic squares of singly even order - 21/04/2021\\nMAGSQSE CSECT\\n USING MAGSQSE,R13 base register\\n B 72(R15) skip savearea\\n DC 17F'0' savearea\\n SAVE (14,12) save previous context\\n ST R13,4(R15) link backward\\n ST R15,8(R13) link forward\\n LR R13,R15 set addressability\\n LH R2,N n\\n MH R2,N *n\\n LA R2,1(R2) +1\\n MH R2,N *n\\n SRA R2,1 /2\\n STH R2,MAGSUM magsum=n*(n^2+1)/2\\n LH R2,N n\\n SRA R2,1 /2\\n STH R2,ND nd=n/2\\n LH R2,ND n\\n MH R2,ND *n\\n STH R2,ND2 nd2=nd^2\\n LH R2,N n\\n SH R2,=H'2' -2\\n SRA R2,2 /4\\n STH R2,LL ll=(n-2)/4\\n LH R6,ND nd\\n SRA R6,1 /2\\n LA R6,1(R6) i=nd/2+1\\n LA R7,1 j=1\\n LR R5,R7 nr=1\\n LH R4,N n\\n IF CH,R4,LT,=H'6' THEN if n<6 then\\n XPRNT =C'Error: too small',16\\n B FIN stop\\n ENDIF , endif\\n LH R2,N n\\n SH R2,=H'2' -2\\n SRDA R2,32 ~\\n D R2,=F'4' /4\\n IF LTR,R2,NZ,R2 THEN if mod(n-2,4)<>0 then\\n XPRNT =C'Error: not possible',19\\n B FIN stop\\n ENDIF , endif\\nLOOP EQU * do loop --------------v\\n LR R1,R6 i\\n LR R2,R7 j\\n BAL R14,SQXY r1=@sq(i,j)\\n LH R2,SQ(R1) sq(i,j)\\n IF LTR,R2,Z,R2 THEN if sq(i,j)=0 then\\n STH R5,SQ(R1) sq(i,j)=nr _A\\n LR R1,R6 i\\n AH R1,ND +nd\\n LR R2,R7 j\\n AH R2,ND +nd\\n BAL R14,SQXY r1=@sq(i+nd,j+nd)\\n LR R3,R5 nr\\n AH R3,ND2 +nd2\\n STH R3,SQ(R1) sq(i+nd,j+nd)=nr+nd2 _B\\n LR R1,R6 i\\n AH R1,ND +nd\\n LR R2,R7 j\\n BAL R14,SQXY r1=@sq(i+nd,j)\\n LH R3,ND2 nd2\\n SLA R3,1 *2\\n AR R3,R5 +nr\\n STH R3,SQ(R1) sq(i+nd,j)=nr+nd2*2; _C\\n LR R1,R6 i\\n LR R2,R7 j\\n AH R2,ND +nd\\n BAL R14,SQXY r1=@sq(i,j+nd)\\n LH R3,ND2 nd2\\n MH R3,=H'3' *3\\n AR R3,R5 +nr\\n STH R3,SQ(R1) sq(i,j+nd)=nr+nd2*3; _D\\n LR R2,R5 nr\\n LH R0,ND nd\\n SRDA R2,32 ~\\n DR R2,R0 nr/nd\\n IF LTR,R2,Z,R2 THEN if mod(nr,nd)=0 then\\n LA R7,1(R7) j=j+1\\n ELSE , else\\n LA R6,1(R6) i=i+1\\n BCTR R7,0 j=j-1\\n ENDIF , endif\\n LA R5,1(R5) nr=nr+1\\n ENDIF , endif\\n IF CH,R6,GT,ND THEN if i>nd then\\n LA R6,1 i=1\\n BAL R12,SQIJ r2=sq(i,j)\\n DO WHILE=(LTR,R2,NZ,R2) do while sq(i,j)<>0\\n LA R6,1(R6) i=i+1\\n BAL R12,SQIJ r2=sq(i,j)\\n ENDDO , enddo\\n ENDIF , endif\\n IF CH,R7,LT,=H'1' THEN if j<1 then\\n LH R7,ND j=nd\\n BAL R12,SQIJ r2=sq(i,j)\\n DO WHILE=(LTR,R2,NZ,R2) do while sq(i,j)<>0\\n BCTR R7,0 j=j-1\\n BAL R12,SQIJ r2=sq(i,j)\\n ENDDO , enddo\\n ENDIF , endif\\n CH R5,ND2 nr>nd2\\n BNH LOOP until nr>nd2 ---------^\\n LA R7,1 j=1 -- swap left side\\n DO WHILE=(CH,R7,LE,ND) do j=1 to nd\\n LA R6,1 i=1\\n DO WHILE=(CH,R6,LE,LL) do i=1 to ll\\n BAL R12,SWAPIJ swap sq(i,j),sq(i,j+nd)\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n LA R7,1(R7) j++\\n ENDDO , enddo j\\n LH R7,ND nd\\n SRA R7,1 /2\\n LA R7,1(R7) j=nd/2+1\\n LA R1,1 1\\n LR R2,R7 j\\n BAL R14,SQXY r1=@sq(1,j)\\n LR R3,R1 r3=@sq(1,j)\\n LA R1,1 1\\n LR R2,R7 j\\n AH R2,ND j+nd\\n BAL R14,SQXY r1=@sq(1,j+nd)\\n BAL R14,SWAPXY swap sq(1,j),sq(1,j+nd)\\n LH R1,LL ll\\n LA R1,1(R1) ll+1\\n LR R2,R7 j\\n BAL R14,SQXY r1=@sq(ll+1,j)\\n LR R3,R1 r3=@sq(ll+1,j)\\n LH R1,LL ll\\n LA R1,1(R1) +1\\n LR R2,R7 j\\n AH R2,ND +nd\\n BAL R14,SQXY r1=@sq(ll+1,j+nd)\\n BAL R14,SWAPXY swap sq(ll+1,j),sq(ll+1,j+nd)\\n LH R5,N n\\n SH R5,LL -ll\\n LA R5,2(R5) r5=n-ll+2\\n LA R7,1 j=1 -- swap right side\\n DO WHILE=(CH,R7,LE,ND) do j=1 to nd\\n LR R6,R5 i=n-ll+2\\n DO WHILE=(CH,R6,LE,N) do i=n-ll+2 to n\\n BAL R12,SWAPIJ swap sq(i,j),sq(i,j+nd)\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n LA R7,1(R7) j++\\n ENDDO , enddo j\\n LA R7,1 j=1 check columms and rows\\n DO WHILE=(CH,R7,LE,N) do j=1 to n\\n SR R4,R4 nr=0\\n SR R5,R5 nc=0\\n LA R6,1 i=1\\n DO WHILE=(CH,R6,LE,N) do i=1 to n\\n LR R1,R6 i\\n LR R2,R7 j\\n BAL R14,SQXY r1=@sq(i,j)\\n AH R4,SQ(R1) nr=nr+sq(i,j)\\n LR R1,R7 j\\n LR R2,R6 i\\n BAL R14,SQXY r1=@sq(j,i)\\n AH R5,SQ(R1) nc=nc+sq(j,i)\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n IF CH,R4,NE,MAGSUM,OR,CH,R5,NE,MAGSUM THEN\\n XPRNT =C'Error: row/col value<>magsum',28\\n B FIN stop\\n ENDIF , endif\\n LA R7,1(R7) j++\\n ENDDO , enddo j\\n SR R4,R4 nr=0\\n SR R5,R5 nc=0\\n LA R6,1 i=1\\n DO WHILE=(CH,R6,LE,N) do i=1 to n\\n LR R1,R6 i\\n LR R2,R6 i\\n BAL R14,SQXY r1=@sq(i,i)\\n AH R4,SQ(R1) nr=nr+sq(i,i)\\n LH R1,N n\\n SR R1,R6 n-i\\n LA R1,1(R1) n-i+1\\n LR R2,R1 n-i+1\\n BAL R14,SQXY r1=@sq(i,i)\\n AH R5,SQ(R1) nc=nc+sq(n-i+1,n-i+1)\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n IF CH,R4,NE,MAGSUM,OR,CH,R5,NE,MAGSUM THEN\\n XPRNT =C'Error: diag value<>magsum',25\\n B FIN stop\\n ENDIF , endif\\n MVC PG(31),=C'Single even magic square size: '\\n LH R1,N n\\n XDECO R1,XDEC edit n\\n MVC PG+31(3),XDEC+9 output n\\n XPRNT PG,34 print buffer\\n MVC PG(15),=C'The magic sum= '\\n LH R1,MAGSUM magsum\\n XDECO R1,XDEC edit magsum\\n MVC PG+15(4),XDEC+8 output magsum\\n XPRNT PG,19 print buffer\\n LA R7,1 j=1\\n DO WHILE=(CH,R7,LE,N) do j=1 to n\\n MVC PG,=CL120' ' clear buffer\\n LA R9,PG @buffer\\n LA R6,1 i=1\\n DO WHILE=(CH,R6,LE,N) do i=1 to n\\n LR R1,R6 i\\n LR R2,R7 j\\n BAL R14,SQXY r1=@sq(i,i)\\n LH R2,SQ(R1) sq(i,j)\\n XDECO R2,XDEC edit sq(i,j)\\n MVC 0(4,R9),XDEC+8 output sq(i,j)\\n LA R9,4(R9) @buffer+=4\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n XPRNT PG,L'PG print buffer\\n LA R7,1(R7) j++\\n ENDDO , enddo j\\nFIN L R13,4(0,R13) restore previous savearea pointer\\n RETURN (14,12),RC=0 restore registers from calling save\\nSQIJ CNOP 0,4 routine sq(i,j)\\n LR R1,R6 i\\n LR R2,R7 j\\n BAL R14,SQXY r1=@sq(i,j)\\n LH R2,SQ(R1) sq(i,j)\\n BR R12 return\\nSQXY CNOP 0,4 routine sq(r1,r2)\\n BCTR R1,0 -1\\n MH R1,N *n\\n BCTR R2,0 -1\\n AR R1,R2 (r1-1)*n+(r2-1)\\n SLA R1,1 *2 (H)\\n BR R14 return\\nSWAPIJ CNOP 0,4 routine swap sq(i,j),sq(i,j+nd)\\n LR R1,R6 i\\n LR R2,R7 j\\n BAL R14,SQXY r1=@sq(i,j)\\n LR R3,R1 r3=@sq(i,j)\\n LR R1,R6 i\\n LR R2,R7 j\\n AH R2,ND +nd\\n BAL R14,SQXY r1=@sq(i,j+nd)\\n BAL R14,SWAPXY swap\\n BR R12 return\\nSWAPXY CNOP 0,4 routine swap sq(r1),sq(r3)\\n LH R0,SQ(R3) r0=sq(r3)\\n LH R2,SQ(R1) r2=sq(r1)\\n STH R2,SQ(R3) sq(r3)=r2\\n STH R0,SQ(R1) sq(r1)=r0\\n BR R14 return\\nNN EQU 6 <== parameter (6,10,14,18,22,26,...)\\nN DC AL2(NN) n\\nSQ DC (NN*NN)H'0' array sq(n,n)\\nMAGSUM DS H magsum\\nND DS H nd\\nND2 DS H nd2\\nLL DS H ll\\nPG DC CL120' ' buffer\\nXDEC DS CL12 temp for xdeco\\n REGEQU\\n END MAGSQSE\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"BEGIN # construct a magic square of singly even order #\\n # the singly even magic square procedure is translated from the Java #\\n # sample #\\n\\n CO begin code from the magic squares of odd order task CO\\n\\n # construct a magic square of odd order #\\n PROC odd magic square = ( INT order ) [,]INT:\\n IF NOT ODD order OR order < 1 THEN\\n # can't make a magic square of the specified order #\\n LOC[ 1 : 0, 1 : 0 ]INT\\n ELSE\\n # order is OK - construct the square using de la Loubère's #\\n # algorithm as in the wikipedia page #\\n\\n [ 1 : order, 1 : order ]INT square;\\n FOR i TO order DO FOR j TO order DO square[ i, j ] := 0 OD OD;\\n\\n # operator to advance \\\"up\\\" the square #\\n OP PREV = ( INT pos )INT: IF pos = 1 THEN order ELSE pos - 1 FI;\\n # operator to advance \\\"across right\\\" or \\\"down\\\" the square #\\n OP NEXT = ( INT pos )INT: ( pos MOD order ) + 1;\\n\\n # fill in the square, starting from the middle of the top row #\\n INT col := ( order + 1 ) OVER 2;\\n INT row := 1;\\n FOR i TO order * order DO\\n square[ row, col ] := i;\\n IF square[ PREV row, NEXT col ] /= 0 THEN\\n # the up/right position is already taken, move down #\\n row := NEXT row\\n ELSE\\n # can move up and right #\\n row := PREV row;\\n col := NEXT col\\n FI\\n OD;\\n\\n square\\n FI # odd magic square # ;\\n\\n PROC print square = ( [,]INT square )VOID: # prints the magic square #\\n BEGIN\\n\\n INT order = 1 UPB square;\\n\\n # calculate print width: negative so leading \\\"+\\\"s aren't printed #\\n INT width := -1;\\n INT mag := order * order;\\n WHILE mag >= 10 DO mag OVERAB 10; width -:= 1 OD;\\n\\n # calculate the \\\"magic sum\\\" #\\n INT sum := 0;\\n FOR i TO order DO sum +:= square[ 1, i ] OD;\\n\\n # print the square #\\n print( ( \\\"maqic square of order \\\", whole( order, 0 ) ) );\\n print( ( \\\": sum: \\\", whole( sum, 0 ), newline ) );\\n FOR i TO order DO\\n FOR j TO order DO write( ( \\\" \\\", whole( square[ i, j ], width ) ) ) OD;\\n print( ( newline ) )\\n OD\\n\\n END # print square # ;\\n\\n CO end code from the magic squares of odd order task CO\\n\\n # returns a magic square of singly even order n #\\n PROC singly even magic square = ( INT n )[,]INT:\\n IF n < 6 OR ( n - 2 ) MOD 4 /= 0 THEN\\n LOC[ 1 : 0, 1 : 0 ]INT # n is not 2 + a multiple of 4 >= 6 #\\n ELSE\\n # order is OK #\\n INT size = n * n;\\n INT half n = n OVER 2;\\n INT sub square size = size OVER 4;\\n\\n [,]INT sub square = odd magic square( half n )[ AT 0, AT 0 ];\\n []INT quadrant factors = []INT( 0, 2, 3, 1 )[ AT 0 ];\\n [ 0 : n - 1, 0 : n - 1 ]INT result;\\n\\n FOR r FROM 1 LWB result TO 1 UPB result DO\\n FOR c FROM 2 LWB result TO 2 UPB result DO\\n INT quadrant = ( r OVER half n ) * 2 + ( c OVER half n );\\n result[ r, c ] := sub square[ r MOD half n, c MOD half n ]\\n + quadrant factors[ quadrant ] * sub square size\\n OD\\n OD;\\n\\n INT n cols left = half n OVER 2;\\n INT n cols right = n cols left - 1;\\n\\n FOR r FROM 1 LWB result TO half n - 1 DO\\n FOR c FROM 1 LWB result TO 1 UPB result DO\\n IF c < n cols left OR c >= n - n cols right\\n OR ( c = n cols left AND r = n cols left )\\n THEN\\n IF c /= 0 OR r /= n cols left THEN\\n INT tmp = result[ r, c ];\\n result[ r, c ] := result[ r + half n, c ];\\n result[ r + half n, c ] := tmp\\n FI\\n FI\\n OD\\n OD;\\n\\n result[ AT 1, AT 1 ]\\n FI # singly even magic square # ;\\n\\n print square( singly even magic square( 6 ) )\\n\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"6>>>>>:00p:2/vv1:%g01p04:%g00::p03*2%g01/g00::-1_@\\n\\\\00g/10g/3*4vv>0g\\\\-1-30g+1+10g%10g*\\\\30g+1+10g%1+ +\\n:%4+*2/g01g0<vv4*`\\\\g02\\\\!`\\\\0:-!-g02/2g03g04-3*2\\\\-\\\\3\\n*:p02/4-2:p01<>0g00g20g-`+!!*+10g:**+.:00g%!9+,:^:\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \" #include<stdlib.h>\\n #include<ctype.h>\\n #include<stdio.h>\\n\\n int** oddMagicSquare(int n) {\\n if (n < 3 || n % 2 == 0)\\n return NULL;\\n\\n int value = 0;\\n int squareSize = n * n;\\n int c = n / 2, r = 0,i;\\n\\n int** result = (int**)malloc(n*sizeof(int*));\\n\\t\\t\\n\\t\\tfor(i=0;i<n;i++)\\n\\t\\t\\tresult[i] = (int*)malloc(n*sizeof(int));\\n\\n while (++value <= squareSize) {\\n result[r][c] = value;\\n if (r == 0) {\\n if (c == n - 1) {\\n r++;\\n } else {\\n r = n - 1;\\n c++;\\n }\\n } else if (c == n - 1) {\\n r--;\\n c = 0;\\n } else if (result[r - 1][c + 1] == 0) {\\n r--;\\n c++;\\n } else {\\n r++;\\n }\\n }\\n return result;\\n }\\n\\n int** singlyEvenMagicSquare(int n) {\\n if (n < 6 || (n - 2) % 4 != 0)\\n return NULL;\\n\\n int size = n * n;\\n int halfN = n / 2;\\n int subGridSize = size / 4, i;\\n\\n int** subGrid = oddMagicSquare(halfN);\\n int gridFactors[] = {0, 2, 3, 1};\\n int** result = (int**)malloc(n*sizeof(int*));\\n\\t\\t\\n\\t\\tfor(i=0;i<n;i++)\\n\\t\\t\\tresult[i] = (int*)malloc(n*sizeof(int));\\n\\n for (int r = 0; r < n; r++) {\\n for (int c = 0; c < n; c++) {\\n int grid = (r / halfN) * 2 + (c / halfN);\\n result[r][c] = subGrid[r % halfN][c % halfN];\\n result[r][c] += gridFactors[grid] * subGridSize;\\n }\\n }\\n\\n int nColsLeft = halfN / 2;\\n int nColsRight = nColsLeft - 1;\\n\\n for (int r = 0; r < halfN; r++)\\n for (int c = 0; c < n; c++) {\\n if (c < nColsLeft || c >= n - nColsRight\\n || (c == nColsLeft && r == nColsLeft)) {\\n\\n if (c == 0 && r == nColsLeft)\\n continue;\\n\\n int tmp = result[r][c];\\n result[r][c] = result[r + halfN][c];\\n result[r + halfN][c] = tmp;\\n }\\n }\\n\\n return result;\\n }\\n\\t\\n\\tint numDigits(int n){\\n\\t\\tint count = 1;\\n\\t\\t\\n\\t\\twhile(n>=10){\\n\\t\\t\\tn /= 10;\\n\\t\\t\\tcount++;\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn count;\\n\\t}\\n\\t\\n\\tvoid printMagicSquare(int** square,int rows){\\n\\t\\tint i,j;\\n\\t\\t\\n\\t\\tfor(i=0;i<rows;i++){\\n\\t\\t\\tfor(j=0;j<rows;j++){\\n\\t\\t\\t\\tprintf(\\\"%*s%d\\\",rows - numDigits(square[i][j]),\\\"\\\",square[i][j]);\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t}\\n\\t\\tprintf(\\\"\\\\nMagic constant: %d \\\", (rows * rows + 1) * rows / 2);\\n\\t}\\n\\t\\n\\tint main(int argC,char* argV[])\\n\\t{\\n\\t\\tint n;\\n\\t\\t\\n\\t\\tif(argC!=2||isdigit(argV[1][0])==0)\\n\\t\\t\\tprintf(\\\"Usage : %s <integer specifying rows in magic square>\\\",argV[0]);\\n\\t\\telse{\\n\\t\\t\\tn = atoi(argV[1]);\\n\\t\\t\\tprintMagicSquare(singlyEvenMagicSquare(n),n);\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <sstream>\\n#include <iomanip>\\nusing namespace std;\\n\\nclass magicSqr\\n{\\npublic:\\n magicSqr() { sqr = 0; }\\n ~magicSqr() { if( sqr ) delete [] sqr; }\\n\\n void create( int d ) {\\n if( sqr ) delete [] sqr;\\n if( d & 1 ) d++;\\n while( d % 4 == 0 ) { d += 2; }\\n sz = d;\\n sqr = new int[sz * sz];\\n memset( sqr, 0, sz * sz * sizeof( int ) );\\n fillSqr();\\n }\\n void display() {\\n cout << \\\"Singly Even Magic Square: \\\" << sz << \\\" x \\\" << sz << \\\"\\\\n\\\";\\n cout << \\\"It's Magic Sum is: \\\" << magicNumber() << \\\"\\\\n\\\\n\\\";\\n ostringstream cvr; cvr << sz * sz;\\n int l = cvr.str().size();\\n\\n for( int y = 0; y < sz; y++ ) {\\n int yy = y * sz;\\n for( int x = 0; x < sz; x++ ) {\\n cout << setw( l + 2 ) << sqr[yy + x];\\n }\\n cout << \\\"\\\\n\\\";\\n }\\n cout << \\\"\\\\n\\\\n\\\";\\n }\\nprivate:\\n void siamese( int from, int to ) {\\n int oneSide = to - from, curCol = oneSide / 2, curRow = 0, count = oneSide * oneSide, s = 1;\\n\\n while( count > 0 ) {\\n bool done = false;\\n while ( false == done ) {\\n if( curCol >= oneSide ) curCol = 0;\\n if( curRow < 0 ) curRow = oneSide - 1;\\n done = true;\\n if( sqr[curCol + sz * curRow] != 0 ) {\\n curCol -= 1; curRow += 2;\\n if( curCol < 0 ) curCol = oneSide - 1;\\n if( curRow >= oneSide ) curRow -= oneSide;\\n\\n done = false;\\n }\\n }\\n sqr[curCol + sz * curRow] = s;\\n s++; count--; curCol++; curRow--;\\n }\\n }\\n void fillSqr() {\\n int n = sz / 2, ns = n * sz, size = sz * sz, add1 = size / 2, add3 = size / 4, add2 = 3 * add3;\\n\\n siamese( 0, n );\\n\\n for( int r = 0; r < n; r++ ) {\\n int row = r * sz;\\n for( int c = n; c < sz; c++ ) {\\n int m = sqr[c - n + row];\\n\\n sqr[c + row] = m + add1;\\n sqr[c + row + ns] = m + add3;\\n sqr[c - n + row + ns] = m + add2;\\n }\\n }\\n\\n int lc = ( sz - 2 ) / 4, co = sz - ( lc - 1 );\\n for( int r = 0; r < n; r++ ) {\\n int row = r * sz;\\n for( int c = co; c < sz; c++ ) {\\n sqr[c + row] -= add3;\\n sqr[c + row + ns] += add3;\\n }\\n }\\n for( int r = 0; r < n; r++ ) {\\n int row = r * sz;\\n for( int c = 0; c < lc; c++ ) {\\n int cc = c;\\n if( r == lc ) cc++;\\n sqr[cc + row] += add2;\\n sqr[cc + row + ns] -= add2;\\n }\\n }\\n }\\n int magicNumber() { return sz * ( ( sz * sz ) + 1 ) / 2; }\\n\\n void inc( int& a ) { if( ++a == sz ) a = 0; }\\n\\n void dec( int& a ) { if( --a < 0 ) a = sz - 1; }\\n\\n bool checkPos( int x, int y ) { return( isInside( x ) && isInside( y ) && !sqr[sz * y + x] ); }\\n\\n bool isInside( int s ) { return ( s < sz && s > -1 ); }\\n\\n int* sqr;\\n int sz;\\n};\\nint main( int argc, char* argv[] ) {\\n magicSqr s; s.create( 6 );\\n s.display();\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nclass MagicSquare {\\n public static int[,] MagicSquareOdd(int n) {\\n if (n < 3 || n % 2 == 0) {\\n throw new ArgumentException(\\\"Base must be odd and > 2\\\");\\n }\\n int value = 1;\\n int gridSize = n * n;\\n int c = n / 2, r = 0;\\n int[,] result = new int[n, n];\\n\\n while (value <= gridSize) {\\n result[r, c] = value;\\n int newR = r == 0 ? n - 1 : r - 1;\\n int newC = c == n - 1 ? 0 : c + 1;\\n if (result[newR, newC] != 0) {\\n r++;\\n } else {\\n r = newR;\\n c = newC;\\n }\\n value++;\\n }\\n\\n return result;\\n }\\n\\n public static int[,] MagicSquareSinglyEven(int n) {\\n if (n < 6 || (n - 2) % 4 != 0) {\\n throw new ArgumentException(\\\"Base must be a positive multiple of 4 plus 2\\\");\\n }\\n\\n int size = n * n;\\n int halfN = n / 2;\\n int subSquareSize = size / 4;\\n int[,] subSquare = MagicSquareOdd(halfN);\\n int[] quadrantFactors = new int[] {0, 2, 3, 1};\\n int[,] result = new int[n, n];\\n\\n for (int r = 0; r < n; r++) {\\n for (int c = 0; c < n; c++) {\\n int quadrant = (r / halfN) * 2 + (c / halfN);\\n result[r, c] = subSquare[r % halfN, c % halfN] + quadrantFactors[quadrant] * subSquareSize;\\n }\\n }\\n\\n int nColsLeft = halfN / 2;\\n int nColsRight = nColsLeft - 1;\\n\\n for (int r = 0; r < halfN; r++) {\\n for (int c = 0; c < n; c++) {\\n if (c < nColsLeft || c >= n - nColsRight || (c == nColsLeft && r == nColsLeft)) {\\n if (!(c == 0 && r == nColsLeft)) {\\n int tmp = result[r, c];\\n result[r, c] = result[r + halfN, c];\\n result[r + halfN, c] = tmp;\\n }\\n }\\n }\\n }\\n\\n return result;\\n }\\n\\n static void Main(string[] args) {\\n const int n = 6;\\n try {\\n var msse = MagicSquareSinglyEven(n);\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n Console.Write($\\\"{msse[i, j],2} \\\");\\n }\\n Console.WriteLine();\\n }\\n Console.WriteLine($\\\"\\\\nMagic constant: {(n * n + 1) * n / 2}\\\");\\n } catch (Exception ex) {\\n Console.WriteLine(ex.Message);\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"import std.exception;\\nimport std.stdio;\\n\\nvoid main() {\\n int n = 6;\\n foreach (row; magicSquareSinglyEven(n)) {\\n foreach (x; row) {\\n writef(\\\"%2s \\\", x);\\n }\\n writeln();\\n }\\n writeln(\\\"\\\\nMagic constant: \\\", (n * n + 1) * n / 2);\\n}\\n\\nint[][] magicSquareOdd(const int n) {\\n enforce(n >= 3 && n % 2 != 0, \\\"Base must be odd and >2\\\");\\n\\n int value = 0;\\n int gridSize = n * n;\\n int c = n / 2;\\n int r = 0;\\n\\n int[][] result = new int[][](n, n);\\n\\n while(++value <= gridSize) {\\n result[r][c] = value;\\n if (r == 0) {\\n if (c == n - 1) {\\n r++;\\n } else {\\n r = n - 1;\\n c++;\\n }\\n } else if (c == n - 1) {\\n r--;\\n c = 0;\\n } else if (result[r - 1][c + 1] == 0) {\\n r--;\\n c++;\\n } else {\\n r++;\\n }\\n }\\n\\n return result;\\n}\\n\\nint[][] magicSquareSinglyEven(const int n) {\\n enforce(n >= 6 && (n - 2) % 4 == 0, \\\"Base must be a positive multiple of four plus 2\\\");\\n\\n int size = n * n;\\n int halfN = n / 2;\\n int subSquareSize = size / 4;\\n\\n int[][] subSquare = magicSquareOdd(halfN);\\n int[] quadrantFactors = [0, 2, 3, 1];\\n int[][] result = new int[][](n, n);\\n\\n for (int r = 0; r < n; r++) {\\n for (int c = 0; c < n; c++) {\\n int quadrant = (r / halfN) * 2 + (c / halfN);\\n result[r][c] = subSquare[r % halfN][c % halfN];\\n result[r][c] += quadrantFactors[quadrant] * subSquareSize;\\n }\\n }\\n\\n int nColsLeft = halfN / 2;\\n int nColsRight = nColsLeft - 1;\\n\\n for (int r = 0; r < halfN; r++) {\\n for (int c = 0; c < n; c++) {\\n if (c < nColsLeft || c >= n - nColsRight\\n || (c == nColsLeft && r == nColsLeft)) {\\n if (c == 0 && r == nColsLeft) {\\n continue;\\n }\\n\\n int tmp = result[r][c];\\n result[r][c] = result[r + halfN][c];\\n result[r + halfN][c] = tmp;\\n }\\n }\\n }\\n\\n return result;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"[Magic squares of singly even order, for Rosetta Code.\\n EDSAC program, Initial Orders 2.]\\n[=============================================================================]\\n[Uses Strachey's method, but with the square rotated 90 degrees clockwise.\\n Let the side be 2q. The square is divided into 4 quadrants each of side q.\\n In each quadrant, a 0-based magic square is created by De la Loubere's rule.\\n The final square is got by adding k*q^2 + 1 to each entry, where 0 <= k <= 3.]\\n[=============================================================================]\\n [Arrange the storage]\\n T45K P56F [H parameter: subroutine to print string]\\n T46K P100F [N parameter: subroutine to print number]\\n T47K P200F [M parameter: main routine]\\n[Main routine]\\n E25K TM GK\\n[Variables]\\n [0] PF [m, where side of square = 4*m + 2]\\n [1] PF [q = side of a quadrant = 2*m + 1]\\n [2] PF [q^2]\\n [3] PF [negative counter for columns]\\n [4] PF [negative counter for rows]\\n [5] PF [q*u for De la Loubere's method]\\n [6] PF [v for De la Loubere's method]\\n [7] PF [value of q*u at start of row]\\n [8] PF [ditto v]\\n [9] PF [add-on k*q^2 + 1 for left half of row]\\n [10] PF [add-on k*q^2 + 1 for right half of row]\\n [In the top two quadrants, the left and right add-ons are swapped for\\n \\\"special\\\" cells: (1) centre cell of top row (2) centre cell of quadrant.]\\n [11] PF [EDSAC null if left & right add-ons are to be swapped; else 0]\\n [12] PF [value of current special cell]\\n[Constants]\\n [13] K4096F [EDSAC null, i.e. 10000000000000000 binary]\\n [14] !F [space]\\n [15] @F [carriage return]\\n [16] &F [line feed]\\n [17] PD [17-bit constant 1]\\n [18] P10F [10 in address field (test for '0' on phone dial)]\\n[Strings, terminated by EDSAC null]\\n [19] K2048FMFAFGFIFCF!FSFQFUFAFRFEF!FOFFF!FOFRFDFEFRF!F#FRF*FMF#FZFWF@F&FK4096F\\n [52] K2048FDFIFAFLF!FMF!F#FKFPF!F*FTFOF!FCFAFNFCFEFLF#FLF!FK4096F\\n [78] K2048FSFTFRFAFCFHFEFYF!F#FKF*FRFOFTFAFTFEFDF#FLFCF@F&FK4096F\\n[Enter with acc = 0]\\n [104] A104@ GH A19@ [print header: says side of square = 4*m + 2]\\n [107] A107@ GH A52@ [prompt user to enter m on phone dial]\\n ZF [halt machine, restarts when user dials]\\n [Here acc holds number of pulses in address field]\\n S18@ [test wheter user dialled '0' (10 pulses)]\\n E183@ [jump to exit if so]\\n A18@ [restore acc after test]\\n L512F UF [shift 11 left, to 0F for printing]\\n OF O15@ O16@ [print m followed by CR, LF]\\n R512F [shift back 11 right; acc = 2m right-justified]\\n A17@ U1@ [store q = 2m + 1 = n/2, right justified]\\n RD T@ [shift 1 right, store m right-justified]\\n H1@ V1@ [acc := q^2]\\n L64F L64F [16 left to adjust scaling after mult.]\\n T2@ [store q^2]\\n [129] A129@ GH A78@ [print 'STRACHEY (ROTATED):']\\n A14@ T1F [use space for leading zeros when printing]\\n[In each quadrant, use De la Loubere's method. 0-based entry is q*u + v\\n where u, v are digits in base q. Example for m = 2, q = 2*m + 1 = 5:\\n u = 2 1 0 4 3 v = 0 4 3 2 1 At top left, u = m, v = 0\\n 3 2 1 0 4 2 1 0 4 3 Moving right, u and v decrease by 1 mod q\\n 4 3 2 1 0 4 5 2 1 0 Moving down, u increases by 1 mod q\\n 0 4 3 2 1 1 0 4 3 2 v increases by 2 mod q\\n 1 0 4 3 2 3 2 1 0 4]\\n H1@ V@ [acc := q*m]\\n L64F L64F [16 left to adjust integer scaling scaling after mult.]\\n T7@ [store q*u at start of top row]\\n T8@ [v at start of top row := 0]\\n[At the start of each stage, set counter to m - (number of rows in that stage)]\\n[Stage 1, m rows]\\n T4@ [counter := 0]\\n A17@ T9@ [add-on for left half of row = 1]\\n A2@ LD A2@ [acc := 3*q^2]\\n A17@ T10@ [add-on for right half of row = 3q^2 + 1]\\n [Special cell is centre of top row; value is m + 1]\\n A@ A17@ T12@ [special pass m + 1 to subroutine]\\n [151] A151@ G185@ [call subroutine to do stage 1]\\n[Stage 2, m + 1 rows]\\n S17@ T4@ [counter := -1]\\n A10@ T9@ [add-on for left half of row = 3q^2 + 1]\\n A17@ T10@ [add-on for right half of row = 1]\\n [Special cell is at centre of quadrant; value id (q^2 - 1)/2]\\n A2@ RD T12@ [shift q^2 1 right to get value (since q is pdd)]\\n [162] A162@ G185@ [call subroutine to do stage 2]\\n[Stage 3, m + 2 rows. Here acc = 0.]\\n S2F T4@ [counter := -2]\\n A9@ S2@ U10@ [add-on for right half of row = 2q^2 + 1]\\n S2@ T9@ [add-on for left half of row = q^2 + 1]\\n S17@ T12@ [no special cell (value < 0) in stages 3 & 4]\\n [173] A173@ G185@ [call subroutine to do stage 3]\\n[Stage 4, m - 1 rows]\\n A17@ T4@ [counter := 1]\\n A10@ U9@ [add-on for left half of row = 2q^2 + 1]\\n S2@ T10@ [add-on for right half of row = q^2 + 1]\\n [181] A181@ G185@ [call subroutine to do stage 4]\\n [183] O13@ [done; print null]\\n ZF [halt the machine]\\n[Subroutine to write the rows in one of the 4 stages.\\n Shares storage with the main routine.]\\n [185] A3F T256@ [plant return link as usual]\\n S@ [negative row counter := -m]\\n A4@ [plus adjustment set by caller]\\n E256@ [exit if nothing to do (happens for 6x6, stage 4)]\\n [190] T4@ [outer loop: update row counter]\\n [Start of a row. Goes across 2 quadrants.\\n Recall that 0-based entry is q*u + v where u, v are digits in base q]\\n S1@ LD T3@ [negative column counter := -2*q]\\n A7@ T5@ [reset q*u for start of row]\\n A8@ U6@ [same for v]\\n [Next column. Here acc contains v (the second digit)]\\n [198] A5@ [inner loop: add q*u where u = first digit]\\n T4F [park 0-based entry in 4F]\\n [Add on an amount depending on whether it's left or right quadrant.\\n In stages 1 and 2, the left and right add-ons are swapped for certain cells.]\\n T11@ [say not swapped]\\n A12@ [load special cell if any]\\n G210@ [jump if none (value < 0)]\\n S4F [compare with cell entry]\\n G210@ S17@ E210@ [jump if different]\\n TF A13@ T11@ [set flag in sign bit to reverse comparison]\\n [210] TF [clear acc]\\n A3@ A1@ [test for left or right quadrant]\\n A11@ [reverse test if flag was set above]\\n E218@ [jump if right quadrant]\\n TF [clear acc]\\n A9@ [load add-on for left quadrant]\\n E220@ [join common code]\\n [218] TF [clear acc]\\n A10@ [load add-on for right quadrant]\\n [220] A4F TF [common: final value of entry to 0F for printing]\\n [222] A222@ GN [print]\\n A3@ A17@ [inc negative column count]\\n E239@ [jump if row is complete]\\n T3@ [update column count]\\n [Next cell in row]\\n A5@ S1@ E232@ [dec q*u by q, skip if result >= 0]\\n A2@ [else wrap round by adding q^2]\\n [232] T5@ [update q*u]\\n A6@ S17@ E237@ [dec v by 1, skip if result >= 0]\\n A1@ [else wrap round by adding q]\\n [237] U6@ [update v, keep new v in acc]\\n E198@ [loop back]\\n [Here when row finished]\\n [239] O15@ O16@ [print CR, LF]\\n A7@ A1@ [update value of u at start of row]\\n S2@ E246@ [if >= q^2 then subtract q^2]\\n A2@ [else restore acc after test]\\n [246] T7@ [update value mod q^2]\\n A8@ A2F [similarly inc v mod q]\\n S1@ E252@ A1@\\n [252] T8@\\n A4@ A17@ G190@ [inc negative row count, loop till done]\\n [256] ZF [(planted) jump back to caller]\\n\\n[Subroutine to print a string.\\n Input: A order for first character must follow subroutine call.\\n String is terminated with EDSAC null, which is sent to the teleprinter.]\\n E25K TH\\n GKA18@U17@S19@T4@AFT6@AFUFOFE12@A20@G16@TFA6@A2FG5@TFZFU3FU1FK2048F\\n\\n[Subroutine to print non-negative 17-bit integer.\\n Parameters: 0F = integer to be printed (not preserved)\\n 1F = character for leading zero (preserved)\\n Workspace: 4F..7F, 38 locations]\\n E25K TN\\n GKA3FT34@A1FT7FS35@T6FT4#FAFT4FH36@V4FRDA4#FR1024FH37@E23@O7FA2F\\n T6FT5FV4#FYFL8FT4#FA5FL1024FUFA6FG16@OFTFT7FA6FG17@ZFP4FZ219DTF\\n\\n[================ M parameter again ================]\\n E25K TM GK\\n E104Z [define entry point]\\n PF [acc = 0 on entry]\\n\",\n \"language\": \"EDSAC-order-code\"\n },\n {\n \"code\": \"defmodule Magic_square do\\n @lux %{ L: [4, 1, 2, 3], U: [1, 4, 2, 3], X: [1, 4, 3, 2] }\\n\\n def singly_even(n) when rem(n-2,4)!=0, do: raise ArgumentError, \\\"must be even, but not divisible by 4.\\\"\\n def singly_even(2), do: raise ArgumentError, \\\"2x2 magic square not possible.\\\"\\n def singly_even(n) do\\n n2 = div(n, 2)\\n oms = odd_magic_square(n2)\\n mat = make_lux_matrix(n2)\\n square = synthesis(n2, oms, mat)\\n IO.puts to_string(n, square)\\n square\\n end\\n\\n defp odd_magic_square(m) do # zero beginning, it is 4 multiples.\\n for i <- 0..m-1, j <- 0..m-1, into: %{},\\n do: {{i,j}, (m*(rem(i+j+1+div(m,2),m)) + rem(i+2*j-5+2*m, m)) * 4}\\n end\\n\\n defp make_lux_matrix(m) do\\n center = div(m, 2)\\n lux = List.duplicate(:L, center+1) ++ [:U] ++ List.duplicate(:X, m-center-2)\\n (for {x,i} <- Enum.with_index(lux), j <- 0..m-1, into: %{}, do: {{i,j}, x})\\n |> Map.put({center, center}, :U)\\n |> Map.put({center+1, center}, :L)\\n end\\n\\n defp synthesis(m, oms, mat) do\\n range = 0..m-1\\n Enum.reduce(range, [], fn i,acc ->\\n {row0, row1} = Enum.reduce(range, {[],[]}, fn j,{r0,r1} ->\\n x = oms[{i,j}]\\n [lux0, lux1, lux2, lux3] = @lux[mat[{i,j}]]\\n {[x+lux0, x+lux1 | r0], [x+lux2, x+lux3 | r1]}\\n end)\\n [row0, row1 | acc]\\n end)\\n end\\n\\n defp to_string(n, square) do\\n format = String.duplicate(\\\"~#{length(to_char_list(n*n))}w \\\", n) <> \\\"\\\\n\\\"\\n Enum.map_join(square, fn row ->\\n :io_lib.format(format, row)\\n end)\\n end\\nend\\n\\nMagic_square.singly_even(6)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"' version 18-03-2016\\n' compile with: fbc -s console\\n' singly even magic square 6, 10, 14, 18...\\n\\nSub Err_msg(msg As String)\\n Print msg\\n Beep : Sleep 5000, 1 : Exit Sub\\nEnd Sub\\n\\nSub se_magicsq(n As UInteger, filename As String = \\\"\\\")\\n\\n ' filename <> \\\"\\\" then save square in a file\\n ' filename can contain directory name\\n ' if filename exist it will be overwriten, no error checking\\n\\n If n < 6 Then\\n Err_msg( \\\"Error: n is to small\\\")\\n Exit Sub\\n End If\\n\\n If ((n -2) Mod 4) <> 0 Then\\n Err_msg \\\"Error: not possible to make singly\\\" + _\\n \\\" even magic square size \\\" + Str(n)\\n Exit Sub\\n End If\\n\\n Dim As UInteger sq(1 To n, 1 To n)\\n Dim As UInteger magic_sum = n * (n ^ 2 +1) \\\\ 2\\n Dim As UInteger sq_d_2 = n \\\\ 2, q2 = sq_d_2 ^ 2\\n Dim As UInteger l = (n -2) \\\\ 4\\n Dim As UInteger x = sq_d_2 \\\\ 2 + 1, y = 1, nr = 1\\n Dim As String frmt = String(Len(Str(n * n)) +1, \\\"#\\\")\\n\\n ' fill pattern A C\\n ' D B\\n ' main loop for creating magic square in section A\\n ' the value for B,C and D is derived from A\\n ' uses the FreeBASIC odd order magic square routine\\n Do\\n If sq(x, y) = 0 Then\\n sq(x , y ) = nr ' A\\n sq(x + sq_d_2, y + sq_d_2) = nr + q2 ' B\\n sq(x + sq_d_2, y ) = nr + q2 * 2 ' C\\n sq(x , y + sq_d_2) = nr + q2 * 3 ' D\\n If nr Mod sq_d_2 = 0 Then\\n y += 1\\n Else\\n x += 1 : y -= 1\\n End If\\n nr += 1\\n End If\\n If x > sq_d_2 Then\\n x = 1\\n Do While sq(x,y) <> 0\\n x += 1\\n Loop\\n End If\\n If y < 1 Then\\n y = sq_d_2\\n Do While sq(x,y) <> 0\\n y -= 1\\n Loop\\n End If\\n Loop Until nr > q2\\n\\n\\n ' swap left side\\n For y = 1 To sq_d_2\\n For x = 1 To l\\n Swap sq(x, y), sq(x,y + sq_d_2)\\n Next\\n Next\\n ' make indent\\n y = (sq_d_2 \\\\ 2) +1\\n Swap sq(1, y), sq(1, y + sq_d_2) ' was swapped, restore to orignal value\\n Swap sq(l +1, y), sq(l +1, y + sq_d_2)\\n\\n ' swap right side\\n For y = 1 To sq_d_2\\n For x = n - l +2 To n\\n Swap sq(x, y), sq(x,y + sq_d_2)\\n Next\\n Next\\n\\n ' check columms and rows\\n For y = 1 To n\\n nr = 0 : l = 0\\n For x = 1 To n\\n nr += sq(x,y)\\n l += sq(y,x)\\n Next\\n If nr <> magic_sum Or l <> magic_sum Then\\n Err_msg \\\"Error: value <> magic_sum\\\"\\n Exit Sub\\n End If\\n Next\\n\\n ' check diagonals\\n nr = 0 : l = 0\\n For x = 1 To n\\n nr += sq(x, x)\\n l += sq(n - x +1, n - x +1)\\n Next\\n If nr <> magic_sum Or l <> magic_sum Then\\n Err_msg \\\"Error: value <> magic_sum\\\"\\n Exit Sub\\n End If\\n\\n ' printing square's on screen bigger when\\n ' n > 19 results in a wrapping of the line\\n Print \\\"Single even magic square size: \\\"; n; \\\"*\\\"; n\\n Print \\\"The magic sum = \\\"; magic_sum\\n Print\\n For y = 1 To n\\n For x = 1 To n\\n Print Using frmt; sq(x, y);\\n Next\\n Print\\n Next\\n\\n ' output magic square to a file with the name provided\\n If filename <> \\\"\\\" Then\\n nr = FreeFile\\n Open filename For Output As #nr\\n Print #nr, \\\"Single even magic square size: \\\"; n; \\\"*\\\"; n\\n Print #nr, \\\"The magic sum = \\\"; magic_sum\\n Print #nr,\\n For y = 1 To n\\n For x = 1 To n\\n Print #nr, Using frmt; sq(x,y);\\n Next\\n Print #nr,\\n Next\\n Close #nr\\n End If\\n\\nEnd Sub\\n\\n' ------=< MAIN >=------\\n\\nse_magicsq(6, \\\"magicse6.txt\\\") : Print\\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 \\\"log\\\"\\n)\\n\\nfunc magicSquareOdd(n int) ([][]int, error) {\\n if n < 3 || n%2 == 0 {\\n return nil, fmt.Errorf(\\\"base must be odd and > 2\\\")\\n }\\n value := 1\\n gridSize := n * n\\n c, r := n/2, 0\\n result := make([][]int, n)\\n\\n for i := 0; i < n; i++ {\\n result[i] = make([]int, n)\\n }\\n\\n for value <= gridSize {\\n result[r][c] = value\\n if r == 0 {\\n if c == n-1 {\\n r++\\n } else {\\n r = n - 1\\n c++\\n }\\n } else if c == n-1 {\\n r--\\n c = 0\\n } else if result[r-1][c+1] == 0 {\\n r--\\n c++\\n } else {\\n r++\\n }\\n value++\\n }\\n return result, nil\\n}\\n\\nfunc magicSquareSinglyEven(n int) ([][]int, error) {\\n if n < 6 || (n-2)%4 != 0 {\\n return nil, fmt.Errorf(\\\"base must be a positive multiple of 4 plus 2\\\")\\n }\\n size := n * n\\n halfN := n / 2\\n subSquareSize := size / 4\\n subSquare, err := magicSquareOdd(halfN)\\n if err != nil {\\n return nil, err\\n }\\n quadrantFactors := [4]int{0, 2, 3, 1}\\n result := make([][]int, n)\\n\\n for i := 0; i < n; i++ {\\n result[i] = make([]int, n)\\n }\\n\\n for r := 0; r < n; r++ {\\n for c := 0; c < n; c++ {\\n quadrant := r/halfN*2 + c/halfN\\n result[r][c] = subSquare[r%halfN][c%halfN]\\n result[r][c] += quadrantFactors[quadrant] * subSquareSize\\n }\\n }\\n\\n nColsLeft := halfN / 2\\n nColsRight := nColsLeft - 1\\n\\n for r := 0; r < halfN; r++ {\\n for c := 0; c < n; c++ {\\n if c < nColsLeft || c >= n-nColsRight ||\\n (c == nColsLeft && r == nColsLeft) {\\n if c == 0 && r == nColsLeft {\\n continue\\n }\\n tmp := result[r][c]\\n result[r][c] = result[r+halfN][c]\\n result[r+halfN][c] = tmp\\n }\\n }\\n }\\n return result, nil\\n}\\n\\nfunc main() {\\n const n = 6\\n msse, err := magicSquareSinglyEven(n)\\n if err != nil {\\n log.Fatal(err)\\n }\\n for _, row := range msse {\\n for _, x := range row {\\n fmt.Printf(\\\"%2d \\\", x)\\n }\\n fmt.Println()\\n }\\n fmt.Printf(\\\"\\\\nMagic constant: %d\\\\n\\\", (n*n+1)*n/2)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import qualified Data.Map.Strict as M\\nimport Data.List (transpose, intercalate)\\nimport Data.Maybe (fromJust, isJust)\\nimport Control.Monad (forM_)\\nimport Data.Monoid ((<>))\\n\\nmagic :: Int -> [[Int]]\\nmagic n = mapAsTable ((4 * n) + 2) (hiResMap n)\\n\\n-- Order of square -> sequence numbers keyed by cartesian coordinates\\nhiResMap :: Int -> M.Map (Int, Int) Int\\nhiResMap n =\\n let mapLux = luxMap n\\n mapSiam = siamMap n\\n in M.fromList $\\n foldMap\\n (\\\\(xy, n) ->\\n luxNums xy (fromJust (M.lookup xy mapLux)) ((4 * (n - 1)) + 1))\\n (M.toList mapSiam)\\n\\n-- LUX table coordinate -> L|U|X -> initial number -> 4 numbered coordinates\\nluxNums :: (Int, Int) -> Char -> Int -> [((Int, Int), Int)]\\nluxNums xy lux n =\\n zipWith (\\\\x d -> (x, n + d)) (hiRes xy) $\\n case lux of\\n 'L' -> [3, 0, 1, 2]\\n 'U' -> [0, 3, 1, 2]\\n 'X' -> [0, 3, 2, 1]\\n _ -> [0, 0, 0, 0]\\n\\n-- Size of square -> integers keyed by coordinates -> rows of integers\\nmapAsTable :: Int -> M.Map (Int, Int) Int -> [[Int]]\\nmapAsTable nCols xyMap =\\n let axis = [0 .. nCols - 1]\\n in fmap (fromJust . flip M.lookup xyMap) <$>\\n (axis >>= \\\\y -> [axis >>= \\\\x -> [(x, y)]])\\n\\n-- Dimension of LUX table -> LUX symbols keyed by coordinates\\nluxMap :: Int -> M.Map (Int, Int) Char\\nluxMap n =\\n (M.fromList . concat) $\\n zipWith\\n (\\\\y xs -> (zipWith (\\\\x c -> ((x, y), c)) [0 ..] xs))\\n [0 ..]\\n (luxPattern n)\\n\\n-- LUX dimension -> square of L|U|X cells with two mixed rows\\nluxPattern :: Int -> [String]\\nluxPattern n =\\n let d = (2 * n) + 1\\n [ls, us] = replicate n <$> \\\"LU\\\"\\n [lRow, xRow] = replicate d <$> \\\"LX\\\"\\n in replicate n lRow <> [ls <> ('U' : ls)] <> [us <> ('L' : us)] <>\\n replicate (n - 1) xRow\\n\\n-- Highest zero-based index of grid -> Siamese indices keyed by coordinates\\nsiamMap :: Int -> M.Map (Int, Int) Int\\nsiamMap n =\\n let uBound = (2 * n)\\n sPath uBound sMap (x, y) n =\\n let newMap = M.insert (x, y) n sMap\\n in if y == uBound && x == quot uBound 2\\n then newMap\\n else sPath uBound newMap (nextSiam uBound sMap (x, y)) (n + 1)\\n in sPath uBound (M.fromList []) (n, 0) 1\\n\\n-- Highest index of square -> Siam xys so far -> xy -> next xy coordinate\\nnextSiam :: Int -> M.Map (Int, Int) Int -> (Int, Int) -> (Int, Int)\\nnextSiam uBound sMap (x, y) =\\n let alt (a, b)\\n | a > uBound && b < 0 = (uBound, 1) -- Top right corner ?\\n | a > uBound = (0, b) -- beyond right edge ?\\n | b < 0 = (a, uBound) -- above top edge ?\\n | isJust (M.lookup (a, b) sMap) = (a - 1, b + 2) -- already filled ?\\n | otherwise = (a, b) -- Up one, right one.\\n in alt (x + 1, y - 1)\\n\\n-- LUX cell coordinate -> four coordinates at higher resolution\\nhiRes :: (Int, Int) -> [(Int, Int)]\\nhiRes (x, y) =\\n let [col, row] = (* 2) <$> [x, y]\\n [col1, row1] = succ <$> [col, row]\\n in [(col, row), (col1, row), (col, row1), (col1, row1)]\\n\\n-- TESTS ----------------------------------------------------------------------\\nchecked :: [[Int]] -> (Int, Bool)\\nchecked square = (h, all (h ==) t)\\n where\\n diagonals = fmap (flip (zipWith (!!)) [0 ..]) . ((:) <*> (return . reverse))\\n h:t = sum <$> square <> transpose square <> diagonals square\\n\\ntable :: String -> [[String]] -> [String]\\ntable delim rows =\\n let justifyRight c n s = drop (length s) (replicate n c <> s)\\n in intercalate delim <$>\\n transpose\\n ((fmap =<< justifyRight ' ' . maximum . fmap length) <$> transpose rows)\\n\\nmain :: IO ()\\nmain =\\n forM_ [1, 2, 3] $\\n \\\\n -> do\\n let test = magic n\\n putStrLn $ unlines (table \\\" \\\" (fmap show <$> test))\\n print $ checked test\\n putStrLn \\\"\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"odd =: i:@<.@-: |.\\\"0 1&|:^:2 >:@i.@,~\\nt =: ((*: * i.@4:) +\\\"0 2 odd)@-:\\nl =: (f=:$~ # , #)@((<. , >.)@%&4 # (1: , 0:))\\nsh =: <:@-: * (bn=:-: # 2:) #: (2: ^ <.@%&4)\\nlm =: sh |.\\\"0 1 l\\nrm =: f@bn #: <:@(2: ^ <:@<.@%&4)\\na =: ((-.@lm * {.@t) + lm * {:@t)\\nb =: ((-.@rm * 1&{@t) + rm * 2&{@t)\\nc =: ((rm * 1&{@t) + -.@rm * 2&{@t)\\nd =: ((lm * {.@t) + -.@lm * {:@t)\\nm =: (a ,\\\"1 c) , d ,\\\"1 b\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"odd=: i. |.\\\"_1&|:^:2 >:@i.@,~\\nstrachey2=: (odd +/~ (0 2,:3 1) * *:)@-:\\nexchange=: (* -.) + (* |.)~\\ncolumns=: {: | i.\\nstrachey3=: exchange (,:~1 0) * ((2%~1-~{:) > columns)@$\\nstrachey4=: exchange (,:~0 1) * ((2%~1+{:)< columns)@$\\nstrachey5=: exchange (,:~1 0) */ (i.@,~@{: e. ((]*0 1+[)-:@<:)@{:)@$\\n\\nstrachey=: [: ,/ [: ,./\\\"3 strachey5 @ strachey4 @ strachey3 @ strachey2\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class MagicSquareSinglyEven {\\n\\n public static void main(String[] args) {\\n int n = 6;\\n for (int[] row : magicSquareSinglyEven(n)) {\\n for (int x : row)\\n System.out.printf(\\\"%2s \\\", x);\\n System.out.println();\\n }\\n System.out.printf(\\\"\\\\nMagic constant: %d \\\", (n * n + 1) * n / 2);\\n }\\n\\n public static int[][] magicSquareOdd(final int n) {\\n if (n < 3 || n % 2 == 0)\\n throw new IllegalArgumentException(\\\"base must be odd and > 2\\\");\\n\\n int value = 0;\\n int gridSize = n * n;\\n int c = n / 2, r = 0;\\n\\n int[][] result = new int[n][n];\\n\\n while (++value <= gridSize) {\\n result[r][c] = value;\\n if (r == 0) {\\n if (c == n - 1) {\\n r++;\\n } else {\\n r = n - 1;\\n c++;\\n }\\n } else if (c == n - 1) {\\n r--;\\n c = 0;\\n } else if (result[r - 1][c + 1] == 0) {\\n r--;\\n c++;\\n } else {\\n r++;\\n }\\n }\\n return result;\\n }\\n\\n static int[][] magicSquareSinglyEven(final int n) {\\n if (n < 6 || (n - 2) % 4 != 0)\\n throw new IllegalArgumentException(\\\"base must be a positive \\\"\\n + \\\"multiple of 4 plus 2\\\");\\n\\n int size = n * n;\\n int halfN = n / 2;\\n int subSquareSize = size / 4;\\n\\n int[][] subSquare = magicSquareOdd(halfN);\\n int[] quadrantFactors = {0, 2, 3, 1};\\n int[][] result = new int[n][n];\\n\\n for (int r = 0; r < n; r++) {\\n for (int c = 0; c < n; c++) {\\n int quadrant = (r / halfN) * 2 + (c / halfN);\\n result[r][c] = subSquare[r % halfN][c % halfN];\\n result[r][c] += quadrantFactors[quadrant] * subSquareSize;\\n }\\n }\\n\\n int nColsLeft = halfN / 2;\\n int nColsRight = nColsLeft - 1;\\n\\n for (int r = 0; r < halfN; r++)\\n for (int c = 0; c < n; c++) {\\n if (c < nColsLeft || c >= n - nColsRight\\n || (c == nColsLeft && r == nColsLeft)) {\\n\\n if (c == 0 && r == nColsLeft)\\n continue;\\n\\n int tmp = result[r][c];\\n result[r][c] = result[r + halfN][c];\\n result[r + halfN][c] = tmp;\\n }\\n }\\n\\n return result;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"def magicSquareOdd:\\n . as $n\\n | if ($n < 3 or $n%2 == 0) then \\\"Base must be odd and > 2\\\" | error\\n else ($n * $n) as $gridSize\\n | { value: 1,\\n c: (($n/2) | floor),\\n r: 0,\\n result: []}\\n | until (.value > $gridSize;\\n .result[.r][.c] = .value\\n | if .r == 0\\n then if (.c == $n - 1)\\n then .r += 1\\n else .r = ($n - 1) | .c += 1\\n end\\n elif (.c == $n - 1)\\n then .r += -1\\n | .c = 0\\n\\t elif (.result[.r - 1][.c + 1] == null)\\n then .r += -1 | .c += 1\\n else .r += 1\\n\\t end\\n | .value += 1 )\\n | .result\\n end ;\\n\\ndef magicSquareSinglyEven:\\n . as $n\\n | if ($n < 6 or ($n - 2) % 4 != 0)\\n then \\\"Base must be a positive multiple of 4 plus 2\\\" | error\\n else ($n * $n) as $size\\n | ($n / 2) as $halfN\\n | ($size / 4) as $subSquareSize\\n | ($halfN|magicSquareOdd) as $subSquare\\n | [0, 2, 3, 1] as $quadrantFactors\\n | reduce range(0; $n) as $r ({};\\n reduce range(0; $n) as $c (.;\\n ((($r/$halfN)|floor) * 2 + (($c/$halfN)|floor)) as $quadrant\\n | .result[$r][$c] = $subSquare[$r % $halfN][$c % $halfN]\\n | .result[$r][$c] += $quadrantFactors[$quadrant] * $subSquareSize ) )\\n | (($halfN/2)|floor) as $nColsLeft\\n | ($nColsLeft - 1) as $nColsRight\\n | reduce range(0; $halfN) as $r (.;\\n reduce range(0; $n) as $c (.;\\n if ($c < $nColsLeft or $c >= $n - $nColsRight or ($c == $nColsLeft and $r == $nColsLeft))\\n\\t then if ($c != 0 or $r != $nColsLeft)\\n then .result[$r][$c] as $tmp\\n | .result[$r][$c] = .result[$r + $halfN][$c]\\n | .result[$r + $halfN][$c] = $tmp\\n else .\\n\\t\\t end\\n else .\\n\\t end ) )\\n | .result\\n end ;\\n\\ndef lpad($len): tostring | ($len - length) as $l | (\\\" \\\" * $l)[:$l] + .;\\n\\ndef task(n):\\n \\\"Magic constant: \\\\((n * n + 1) * n / 2)\\\\n\\\",\\n (n|magicSquareSinglyEven[] | map(lpad(3))|join(\\\" \\\") );\\n\\ntask(6)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function oddmagicsquare(order)\\n if iseven(order)\\n order += 1\\n end\\n q = zeros(Int, (order, order))\\n p = 1\\n i = div(order, 2) + 1\\n j = 1\\n while p <= order * order\\n q[i, j] = p\\n ti = (i + 1 > order) ? 1 : i + 1\\n tj = (j - 1 < 1) ? order : j - 1\\n if q[ti, tj] != 0\\n ti = i\\n tj = j + 1\\n end\\n i = ti\\n j = tj\\n p = p + 1\\n end\\n q, order\\nend\\n\\nfunction singlyevenmagicsquare(order)\\n if isodd(order)\\n order += 1\\n end\\n if order % 4 == 0\\n order += 2\\n end\\n q = zeros(Int, (order, order))\\n z = div(order, 2)\\n b = z * z\\n c = 2 * b\\n d = 3 * b\\n sq, ord = oddmagicsquare(z)\\n\\n for j in 1:z, i in 1:z\\n a = sq[i, j]\\n q[i, j] = a\\n q[i + z, j + z] = a + b\\n q[i + z, j] = a + c\\n q[i, j + z] = a + d\\n end\\n lc = div(z, 2)\\n rc = lc - 1\\n for j in 1:z, i in 1:order\\n if i <= lc || i > order - rc || (i == lc && j == lc)\\n if i != 0 || j != lc + 1\\n t = q[i, j]\\n q[i, j] = q[i, j + z]\\n q[i, j + z] = t\\n end\\n end\\n end\\n q, order\\nend\\n\\nfunction check(q)\\n side = size(q)[1]\\n sums = Vector{Int}()\\n for n in 1:side\\n push!(sums, sum(q[n, :]))\\n push!(sums, sum(q[:, n]))\\n end\\n println(all(x->x==sums[1], sums) ?\\n \\\"Checks ok: all sides add to $(sums[1]).\\\" : \\\"Bad sum.\\\")\\nend\\n\\nfunction display(q)\\n r, c = size(q)\\n for i in 1:r, j in 1:c\\n nstr = lpad(string(q[i, j]), 4)\\n print(j % c > 0 ? nstr : \\\"$nstr\\\\n\\\")\\n end\\nend\\n\\nfor o in (6, 10)\\n println(\\\"\\\\nWith order $o:\\\")\\n msq = singlyevenmagicsquare(o)[1]\\n display(msq)\\n check(msq)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nfun magicSquareOdd(n: Int): Array<IntArray> {\\n if (n < 3 || n % 2 == 0)\\n throw IllegalArgumentException(\\\"Base must be odd and > 2\\\")\\n\\n var value = 0\\n val gridSize = n * n\\n var c = n / 2\\n var r = 0\\n val result = Array(n) { IntArray(n) }\\n while (++value <= gridSize) {\\n result[r][c] = value\\n if (r == 0) {\\n if (c == n - 1) r++\\n else {\\n r = n - 1\\n c++\\n }\\n }\\n else if (c == n - 1) {\\n r--\\n c = 0\\n }\\n else if (result[r - 1][c + 1] == 0) {\\n r--\\n c++\\n }\\n else r++\\n }\\n return result\\n}\\n\\nfun magicSquareSinglyEven(n: Int): Array<IntArray> {\\n if (n < 6 || (n - 2) % 4 != 0)\\n throw IllegalArgumentException(\\\"Base must be a positive multiple of 4 plus 2\\\")\\n\\n val size = n * n\\n val halfN = n / 2\\n val subSquareSize = size / 4\\n val subSquare = magicSquareOdd(halfN)\\n val quadrantFactors = intArrayOf(0, 2, 3, 1)\\n val result = Array(n) { IntArray(n) }\\n for (r in 0 until n)\\n for (c in 0 until n) {\\n val quadrant = r / halfN * 2 + c / halfN\\n result[r][c] = subSquare[r % halfN][c % halfN]\\n result[r][c] += quadrantFactors[quadrant] * subSquareSize\\n }\\n val nColsLeft = halfN / 2\\n val nColsRight = nColsLeft - 1\\n for (r in 0 until halfN)\\n for (c in 0 until n)\\n if (c < nColsLeft || c >= n - nColsRight || (c == nColsLeft && r == nColsLeft)) {\\n if (c == 0 && r == nColsLeft) continue\\n val tmp = result[r][c]\\n result[r][c] = result[r + halfN][c]\\n result[r + halfN][c] = tmp\\n }\\n return result\\n}\\n\\nfun main(args: Array<String>) {\\n val n = 6\\n for (ia in magicSquareSinglyEven(n)) {\\n for (i in ia) print(\\\"%2d \\\".format(i))\\n println()\\n }\\n println(\\\"\\\\nMagic constant ${(n * n + 1) * n / 2}\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"import sequtils, strutils\\n\\ntype Square = seq[seq[int]]\\n\\nfunc magicSquareOdd(n: Positive): Square =\\n ## Build a magic square of odd order.\\n\\n assert n >= 3 and (n and 1) != 0, \\\"base must be odd and greater than 2.\\\"\\n result = newSeqWith(n, newSeq[int](n))\\n\\n var\\n r = 0\\n c = n div 2\\n value = 0\\n\\n while value < n * n:\\n inc value\\n result[r][c] = value\\n if r == 0:\\n if c == n - 1:\\n inc r\\n else:\\n r = n - 1\\n inc c\\n elif c == n - 1:\\n dec r\\n c = 0\\n elif result[r - 1][c + 1] == 0:\\n dec r\\n inc c\\n else:\\n inc r\\n\\n\\nfunc magicSquareSinglyEven(n: int): Square =\\n ## Build a magic square of singly even order.\\n\\n assert n >= 6 and ((n - 2) and 3) == 0, \\\"base must be a positive multiple of 4 plus 2.\\\"\\n result = newSeqWith(n, newSeq[int](n))\\n\\n let\\n halfN = n div 2\\n subSquareSize = n * n div 4\\n subSquare = magicSquareOdd(halfN)\\n\\n const QuadrantFactors = [0, 2, 3, 1]\\n\\n for r in 0..<n:\\n for c in 0..<n:\\n let quadrant = r div halfN * 2 + c div halfN\\n result[r][c] = subSquare[r mod halfN][c mod halfN] + QuadrantFactors[quadrant] * subSquareSize\\n\\n let\\n nColsLeft = halfN div 2\\n nColsRight = nColsLeft - 1\\n\\n for r in 0..<halfN:\\n for c in 0..<n:\\n if c < nColsLeft or c >= n - nColsRight or (c == nColsLeft and r == nColsLeft):\\n if c != 0 or r != nColsLeft:\\n swap result[r][c], result[r + halfN][c]\\n\\n\\nfunc `$`(square: Square): string =\\n ## Return the string representation of a magic square.\\n let length = len($(square.len * square.len))\\n for row in square:\\n result.add row.mapIt(($it).align(length)).join(\\\" \\\") & '\\\\n'\\n\\n\\nwhen isMainModule:\\n let n = 6\\n echo magicSquareSinglyEven(n)\\n echo \\\"Magic constant = \\\", n * (n * n + 1) div 2\\n\",\n \"language\": \"Nim\"\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;\\\">swap</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y1</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y2</span><span style=\\\"color: #0000FF;\\\">]}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y2</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y1</span><span style=\\\"color: #0000FF;\\\">]}</span>\\n <span style=\\\"color: #008080;\\\">return</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: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">se_magicsq</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">6</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">mod</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;\\\">4</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"illegal size (%d)\\\"</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;\\\">if</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">sq</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: #000000;\\\">0</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: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">magic_sum</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;\\\">n</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: #000000;\\\">sq_d_2</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>\\n <span style=\\\"color: #000000;\\\">q2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sq_d_2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">l</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;\\\">2</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">x1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sq_d_2</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;\\\">x2</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">y1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y2</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- fill pattern a c\\n -- d b\\n -- main loop for creating magic square in section a\\n -- the value for b,c and d is derived from a</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y1</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">x2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">sq_d_2</span>\\n <span style=\\\"color: #000000;\\\">y2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">y1</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">sq_d_2</span>\\n <span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- a</span>\\n <span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y2</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;\\\">q2</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- b</span>\\n <span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y1</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;\\\">q2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- c</span>\\n <span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y2</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;\\\">q2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">3</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- d</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">sq_d_2</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">y1</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">x1</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">y1</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;\\\">r</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;\\\">if</span> <span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">sq_d_2</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">x1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\"><></span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">x1</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;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">y1</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">y1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">sq_d_2</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\"><></span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">y1</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;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">q2</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\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- swap left side</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;\\\">sq_d_2</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">y2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">sq_d_2</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;\\\">l</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">sq</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">swap</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sq</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;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y2</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\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- make indent</span>\\n <span style=\\\"color: #000000;\\\">y1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sq_d_2</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;\\\">y2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">y1</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">sq_d_2</span>\\n <span style=\\\"color: #000000;\\\">x1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">sq</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">swap</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">x1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">sq</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">swap</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- swap right side</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;\\\">sq_d_2</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">y2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">sq_d_2</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">x</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;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">sq</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">swap</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sq</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;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y2</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\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- check columms and rows</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: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</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: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">sq</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: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">sq</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>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\"><></span><span style=\\\"color: #000000;\\\">magic_sum</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\"><></span><span style=\\\"color: #000000;\\\">magic_sum</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"error: value <> magic_sum\\\"</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 <span style=\\\"color: #000080;font-style:italic;\\\">-- check diagonals</span>\\n <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</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: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">x2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">x2</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;\\\">r</span><span style=\\\"color: #0000FF;\\\"><></span><span style=\\\"color: #000000;\\\">magic_sum</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\"><></span><span style=\\\"color: #000000;\\\">magic_sum</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"error: value <> magic_sum\\\"</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;\\\">return</span> <span style=\\\"color: #000000;\\\">sq</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">se_magicsq</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">6</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_IntFmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%3d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">pp_StrFmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</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><span style=\\\"color: #004600;\\\">pp_Pause</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"import math\\nfrom sys import stdout\\n\\nLOG_10 = 2.302585092994\\n\\n\\n# build odd magic square\\ndef build_oms(s):\\n if s % 2 == 0:\\n s += 1\\n q = [[0 for j in range(s)] for i in range(s)]\\n p = 1\\n i = s // 2\\n j = 0\\n while p <= (s * s):\\n q[i][j] = p\\n ti = i + 1\\n if ti >= s: ti = 0\\n tj = j - 1\\n if tj < 0: tj = s - 1\\n if q[ti][tj] != 0:\\n ti = i\\n tj = j + 1\\n i = ti\\n j = tj\\n p = p + 1\\n\\n return q, s\\n\\n\\n# build singly even magic square\\ndef build_sems(s):\\n if s % 2 == 1:\\n s += 1\\n while s % 4 == 0:\\n s += 2\\n\\n q = [[0 for j in range(s)] for i in range(s)]\\n z = s // 2\\n b = z * z\\n c = 2 * b\\n d = 3 * b\\n o = build_oms(z)\\n\\n for j in range(0, z):\\n for i in range(0, z):\\n a = o[0][i][j]\\n q[i][j] = a\\n q[i + z][j + z] = a + b\\n q[i + z][j] = a + c\\n q[i][j + z] = a + d\\n\\n lc = z // 2\\n rc = lc\\n for j in range(0, z):\\n for i in range(0, s):\\n if i < lc or i > s - rc or (i == lc and j == lc):\\n if not (i == 0 and j == lc):\\n t = q[i][j]\\n q[i][j] = q[i][j + z]\\n q[i][j + z] = t\\n\\n return q, s\\n\\n\\ndef format_sqr(s, l):\\n for i in range(0, l - len(s)):\\n s = \\\"0\\\" + s\\n return s + \\\" \\\"\\n\\n\\ndef display(q):\\n s = q[1]\\n print(\\\" - {0} x {1}\\\\n\\\".format(s, s))\\n k = 1 + math.floor(math.log(s * s) / LOG_10)\\n for j in range(0, s):\\n for i in range(0, s):\\n stdout.write(format_sqr(\\\"{0}\\\".format(q[0][i][j]), k))\\n print()\\n print(\\\"Magic sum: {0}\\\\n\\\".format(s * ((s * s) + 1) // 2))\\n\\n\\nstdout.write(\\\"Singly Even Magic Square\\\")\\ndisplay(build_sems(6))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def odd_magic_square(n)\\n n.times.map{|i| n.times.map{|j| n*((i+j+1+n/2)%n) + ((i+2*j-5)%n) + 1} }\\nend\\n\\ndef single_even_magic_square(n)\\n raise ArgumentError, \\\"must be even, but not divisible by 4.\\\" unless (n-2) % 4 == 0\\n raise ArgumentError, \\\"2x2 magic square not possible.\\\" if n == 2\\n\\n order = (n-2)/4\\n odd_square = odd_magic_square(n/2)\\n to_add = (0..3).map{|f| f*n*n/4}\\n quarts = to_add.map{|f| odd_square.dup.map{|row|row.map{|el| el+f}} }\\n\\n sq = []\\n quarts[0].zip(quarts[2]){|d1,d2| sq << [d1,d2].flatten}\\n quarts[3].zip(quarts[1]){|d1,d2| sq << [d1,d2].flatten}\\n\\n sq = sq.transpose\\n order.times{|i| sq[i].rotate!(n/2)}\\n swap(sq[0][order], sq[0][-order-1])\\n swap(sq[order][order], sq[order][-order-1])\\n (order-1).times{|i| sq[-(i+1)].rotate!(n/2)}\\n randomize(sq)\\nend\\n\\ndef swap(a,b)\\n a,b = b,a\\nend\\n\\ndef randomize(square)\\n square.shuffle.transpose.shuffle\\nend\\n\\ndef to_string(square)\\n n = square.size\\n fmt = \\\"%#{(n*n).to_s.size + 1}d\\\" * n\\n square.inject(\\\"\\\"){|str,row| str << fmt % row << \\\"\\\\n\\\"}\\nend\\n\\nputs to_string(single_even_magic_square(6))\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"class Magic_square\\n attr_reader :square\\n LUX = { L: [[4, 1], [2, 3]], U: [[1, 4], [2, 3]], X: [[1, 4], [3, 2]] }\\n\\n def initialize(n)\\n raise ArgumentError, \\\"must be even, but not divisible by 4.\\\" unless (n-2) % 4 == 0\\n raise ArgumentError, \\\"2x2 magic square not possible.\\\" if n == 2\\n @n = n\\n oms = odd_magic_square(n/2)\\n mat = make_lux_matrix(n/2)\\n @square = synthesize(oms, mat)\\n puts to_s\\n end\\n\\n def odd_magic_square(n) # zero beginning, it is 4 multiples.\\n n.times.map{|i| n.times.map{|j| (n*((i+j+1+n/2)%n) + ((i+2*j-5)%n)) * 4} }\\n end\\n\\n def make_lux_matrix(n)\\n center = n / 2\\n lux = [*[:L]*(center+1), :U, *[:X]*(n-center-2)]\\n matrix = lux.map{|x| Array.new(n, x)}\\n matrix[center][center] = :U\\n matrix[center+1][center] = :L\\n matrix\\n end\\n\\n def synthesize(oms, mat)\\n range = 0...@n/2\\n range.inject([]) do |matrix,i|\\n row = [[], []]\\n range.each do |j|\\n x = oms[i][j]\\n LUX[mat[i][j]].each_with_index{|lux,k| row[k] << lux.map{|y| x+y}}\\n end\\n matrix << row[0].flatten << row[1].flatten\\n end\\n end\\n\\n def to_s\\n format = \\\"%#{(@n*@n).to_s.size}d \\\" * @n + \\\"\\\\n\\\"\\n @square.map{|row| format % row}.join\\n end\\nend\\n\\nsq = Magic_square.new(6).square\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use std::env;\\n\\nfn main() {\\n let n: usize =\\n match env::args().nth(1).and_then(|arg| arg.parse().ok()).ok_or(\\n \\\"Please specify the size of the magic square, as a positive multiple of 4 plus 2.\\\",\\n ) {\\n Ok(arg) if arg % 2 == 1 || arg >= 6 && (arg - 2) % 4 == 0 => arg,\\n Err(e) => panic!(e),\\n _ => panic!(\\\"Argument must be a positive multiple of 4 plus 2.\\\"),\\n };\\n\\n let (ms, mc) = magic_square_singly_even(n);\\n println!(\\\"n: {}\\\", n);\\n println!(\\\"Magic constant: {}\\\\n\\\", mc);\\n let width = (n * n).to_string().len() + 1;\\n for row in ms {\\n for elem in row {\\n print!(\\\"{e:>w$}\\\", e = elem, w = width);\\n }\\n println!();\\n }\\n}\\n\\nfn magic_square_singly_even(n: usize) -> (Vec<Vec<usize>>, usize) {\\n let size = n * n;\\n let half = n / 2;\\n let sub_square_size = size / 4;\\n let sub_square = magic_square_odd(half);\\n let quadrant_factors = [0, 2, 3, 1];\\n let cols_left = half / 2;\\n let cols_right = cols_left - 1;\\n\\n let ms = (0..n)\\n .map(|r| {\\n (0..n)\\n .map(|c| {\\n let localr = if (c < cols_left\\n || c >= n - cols_right\\n || c == cols_left && r % half == cols_left)\\n && !(c == 0 && r % half == cols_left)\\n {\\n if r >= half {\\n r - half\\n } else {\\n r + half\\n }\\n } else {\\n r\\n };\\n let quadrant = localr / half * 2 + c / half;\\n let v = sub_square[localr % half][c % half];\\n v + quadrant_factors[quadrant] * sub_square_size\\n })\\n .collect()\\n })\\n .collect::<Vec<Vec<_>>>();\\n (ms, (n * n + 1) * n / 2)\\n}\\n\\nfn magic_square_odd(n: usize) -> Vec<Vec<usize>> {\\n (0..n)\\n .map(|r| {\\n (0..n)\\n .map(|c| {\\n n * (((c + 1) + (r + 1) - 1 + (n >> 1)) % n)\\n + (((c + 1) + (2 * (r + 1)) - 2) % n)\\n + 1\\n })\\n .collect::<Vec<_>>()\\n })\\n .collect::<Vec<Vec<_>>>()\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar magicSquareOdd = Fn.new { |n|\\n if (n < 3 || n%2 == 0) Fiber.abort(\\\"Base must be odd and > 2\\\")\\n var value = 1\\n var gridSize = n * n\\n var c = (n/2).floor\\n var r = 0\\n var result = List.filled(n, null)\\n for (i in 0...n) result[i] = List.filled(n, 0)\\n while (value <= gridSize) {\\n result[r][c] = value\\n if (r == 0) {\\n if (c == n - 1) {\\n r = r + 1\\n } else {\\n r = n - 1\\n c = c + 1\\n }\\n } else if (c == n - 1) {\\n r = r - 1\\n c = 0\\n } else if (result[r - 1][c + 1] == 0) {\\n r = r - 1\\n c = c + 1\\n } else {\\n r = r + 1\\n }\\n value = value + 1\\n }\\n return result\\n}\\n\\nvar magicSquareSinglyEven = Fn.new { |n|\\n if (n < 6 || (n - 2) % 4 != 0) {\\n Fiber.abort(\\\"Base must be a positive multiple of 4 plus 2\\\")\\n }\\n var size = n * n\\n var halfN = n / 2\\n var subSquareSize = size / 4\\n var subSquare = magicSquareOdd.call(halfN)\\n var quadrantFactors = [0, 2, 3, 1]\\n var result = List.filled(n, null)\\n for (i in 0...n) result[i] = List.filled(n, 0)\\n for (r in 0...n) {\\n for (c in 0...n) {\\n var quadrant = (r/halfN).floor * 2 + (c/halfN).floor\\n result[r][c] = subSquare[r % halfN][c % halfN]\\n result[r][c] = result[r][c] + quadrantFactors[quadrant] * subSquareSize\\n }\\n }\\n var nColsLeft = (halfN/2).floor\\n var nColsRight = nColsLeft - 1\\n for (r in 0...halfN) {\\n for (c in 0...n) {\\n if (c < nColsLeft || c >= n - nColsRight || (c == nColsLeft && r == nColsLeft)) {\\n if (c != 0 || r != nColsLeft) {\\n var tmp = result[r][c]\\n result[r][c] = result[r + halfN][c]\\n result[r + halfN][c] = tmp\\n }\\n }\\n }\\n }\\n return result\\n}\\n\\nvar n = 6\\nfor (ia in magicSquareSinglyEven.call(n)) {\\n for (i in ia) Fmt.write(\\\"$2d \\\", i)\\n System.print()\\n}\\nSystem.print(\\\"\\\\nMagic constant %((n * n + 1) * n / 2)\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"class MagicSquareSinglyEven{\\n fcn init(n){ var result=magicSquareSinglyEven(n) }\\n fcn toString{\\n sink,n:=Sink(String),result.len(); // num collumns\\n fmt:=\\\"%2s \\\";\\n foreach row in (result)\\n { sink.write(row.apply('wrap(n){ fmt.fmt(n) }).concat(),\\\"\\\\n\\\") }\\n sink.write(\\\"\\\\nMagic constant: %d\\\".fmt((n*n + 1)*n/2));\\n sink.close();\\n }\\n fcn magicSquareOdd(n){\\n if (n<3 or n%2==0) throw(Exception.ValueError(\\\"base must be odd and > 2\\\"));\\n value,gridSize,c,r:=0, n*n, n/2, 0;\\n result:=n.pump(List(),n.pump(List(),0).copy); // array[n,n] of zero\\n\\n while((value+=1)<=gridSize){\\n\\t result[r][c]=value;\\n\\t if(r==0){\\n\\t if(c==n-1) r+=1;\\n else{ r=n-1; c+=1; }\\n\\t }\\n\\t else if(c==n-1){ r-=1; c=0; }\\n\\t else if(result[r-1][c+1]==0){ r-=1; c+=1; }\\n\\t else r+=1;\\n }\\n result;\\n }\\n fcn magicSquareSinglyEven(n){\\n if (n<6 or (n-2)%4!=0)\\n\\t throw(Exception.ValueError(\\\"base must be a positive multiple of 4 +2\\\"));\\n size,halfN,subSquareSize:=n*n, n/2, size/4;\\n\\n subSquare:=magicSquareOdd(halfN);\\n quadrantFactors:=T(0, 2, 3, 1);\\n result:=n.pump(List(),n.pump(List(),0).copy); // array[n,n] of zero\\n\\n foreach r,c in (n,n){\\n quadrant:=(r/halfN)*2 + (c/halfN);\\n\\t result[r][c]=subSquare[r%halfN][c%halfN];\\n\\t result[r][c]+=quadrantFactors[quadrant]*subSquareSize;\\n }\\n nColsLeft,nColsRight:=halfN/2, nColsLeft-1;\\n foreach r,c in (halfN,n){\\n if ( c<nColsLeft or c>=(n-nColsRight) or\\n (c==nColsLeft and r==nColsLeft) ){\\n\\t if(c==0 and r==nColsLeft) continue;\\n\\t tmp:=result[r][c];\\n\\t result[r][c]=result[r+halfN][c];\\n\\t result[r+halfN][c]=tmp;\\n\\t }\\n }\\n result\\n }\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"MagicSquareSinglyEven(6).println();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Magic-squares-of-singly-even-order"}}},{"rowIdx":464,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Magnanimous_numbers\nnote: Prime Numbers\n","language":"00-META"},{"code":"A magnanimous number is an integer where there is no place in the number where a + (plus sign) could be added between any two digits to give a non-prime sum. \n\n\n;E.G.\n\n:* '''6425''' is a magnanimous number. '''6 + 425 == 431''' which is prime; '''64 + 25 == 89''' which is prime; '''642 + 5 == 647''' which is prime.\n\n:* '''3538''' is '''not''' a magnanimous number. '''3 + 538 == 541''' which is prime; '''35 + 38 == 73''' which is prime; but '''353 + 8 == 361''' which is '''not''' prime.\n\n\nTraditionally the single digit numbers 0 through 9 '''are''' included as magnanimous numbers as there is no place in the number where you can add a plus between two digits at all. (Kind of weaselly but there you are...) Except for the actual value 0, leading zeros are not permitted. Internal zeros are fine though, '''1001''' -> '''1 + 001''' (prime), '''10 + 01''' (prime) '''100 + 1''' (prime).\n\nThere are only 571 known magnanimous numbers. It is strongly suspected, though not rigorously proved, that there are no magnanimous numbers above '''97393713331910''', the largest one known.\n\n\n;Task\n\n:* Write a routine (procedure, function, whatever) to find '''magnanimous numbers'''. \n\n:* Use that function to find and display, here on this page the first '''45''' magnanimous numbers.\n\n:* Use that function to find and display, here on this page the '''241st''' through '''250th''' magnanimous numbers.\n\n:* Stretch: Use that function to find and display, here on this page the '''391st''' through '''400th''' magnanimous numbers\n\n\n;See also\n\n;* [[oeis:A252996|OEIS:A252996 - Magnanimous numbers: numbers such that the sum obtained by inserting a \"+\" anywhere between two digits gives a prime.]]\n\n\n\n","language":"00-TASK"},{"code":"BEGIN # find some magnanimous numbers - numbers where inserting a + between any #\n # digits ab=nd evaluatinf the sum results in a prime in all cases #\n # returns the first n magnanimous numbers #\n # uses global sieve prime which must include 0 and be large enough #\n # for all possible sub-sequences of digits #\n OP MAGNANIMOUS = ( INT n )[]INT:\n BEGIN\n [ 1 : n ]INT result;\n INT m count := 0;\n FOR i FROM 0 WHILE m count < n DO\n # split the number into pairs of digit seuences and check the sums of the pairs are all prime #\n INT divisor := 1;\n BOOL all prime := TRUE;\n WHILE divisor *:= 10;\n IF INT front = i OVER divisor;\n front = 0\n THEN FALSE\n ELSE all prime := prime[ front + ( i MOD divisor ) ]\n FI\n DO SKIP OD;\n IF all prime THEN result[ m count +:= 1 ] := i FI\n OD;\n result\n END; # MAGNANIMPUS #\n # prints part of a seuence of magnanimous numbers #\n PROC print magnanimous = ( []INT m, INT first, INT last, STRING legend )VOID:\n BEGIN\n print( ( legend, \":\", newline ) );\n FOR i FROM first TO last DO print( ( \" \", whole( m[ i ], 0 ) ) ) OD;\n print( ( newline ) )\n END ; # print magnanimous #\n # we assume the first 400 magnanimous numbers will be in 0 .. 1 000 000 #\n # so we will need a sieve of 0 up to 99 999 + 9 #\n [ 0 : 99 999 + 9 ]BOOL prime;\n prime[ 0 ] := prime[ 1 ] := FALSE; prime[ 2 ] := TRUE;\n FOR i FROM 3 BY 2 TO UPB prime DO prime[ i ] := TRUE OD;\n FOR i FROM 4 BY 2 TO UPB prime DO prime[ i ] := FALSE OD;\n FOR i FROM 3 BY 2 TO ENTIER sqrt( UPB prime ) DO\n IF prime[ i ] THEN FOR s FROM i * i BY i + i TO UPB prime DO prime[ s ] := FALSE OD FI\n OD;\n # construct the sequence of magnanimous numbers #\n []INT m = MAGNANIMOUS 400;\n print magnanimous( m, 1, 45, \"First 45 magnanimous numbers\" );\n print magnanimous( m, 241, 250, \"Magnanimous numbers 241-250\" );\n print magnanimous( m, 391, 400, \"Magnanimous numbers 391-400\" )\nEND\n","language":"ALGOL-68"},{"code":"begin\n % find some Magnanimous numbers - numbers where inserting a \"+\" between %\n % any two of the digits and evaluating the sum results in a prime number %\n % implements the sieve of Eratosthenes %\n procedure sieve( logical array s ( * ); integer value n ) ;\n begin\n % start with everything flagged as prime %\n for i := 1 until n do s( i ) := true;\n % sieve out the non-primes %\n s( 1 ) := false;\n for i := 2 until truncate( sqrt( n ) ) do begin\n if s( i ) then for p := i * i step i until n do s( p ) := false\n end for_i ;\n end sieve ;\n % construct an array of magnanimous numbers using the isPrime sieve %\n procedure findMagnanimous ( logical array magnanimous, isPrime ( * ) ) ;\n begin\n % 1 digit magnanimous numbers %\n for i := 0 until 9 do magnanimous( i ) := true;\n % initially, the other magnanimous numbers are unknown %\n for i := 10 until MAGNANIMOUS_MAX do magnanimous( i ) := false;\n % 2 & 3 digit magnanimous numbers %\n for d1 := 1 until 9 do begin\n for d2 := 0 until 9 do begin\n if isPrime( d1 + d2 ) then magnanimous( ( d1 * 10 ) + d2 ) := true\n end for_d2 ;\n for d23 := 0 until 99 do begin\n if isPrime( d1 + d23 ) then begin\n integer d12, d3;\n d3 := d23 rem 10;\n d12 := ( d1 * 10 ) + ( d23 div 10 );\n if isPrime( d12 + d3 ) then magnanimous( ( d12 * 10 ) + d3 ) := true\n end if_isPrime_d1_plus_d23\n end for_d23\n end for_d1 ;\n % 4 & 5 digit magnanimous numbers %\n for d12 := 10 until 99 do begin\n for d34 := 0 until 99 do begin\n if isPrime( d12 + d34 ) then begin\n integer d123, d4;\n d123 := ( d12 * 10 ) + ( d34 div 10 );\n d4 := d34 rem 10;\n if isPrime( d123 + d4 ) then begin\n integer d1, d234;\n d1 := d12 div 10;\n d234 := ( ( d12 rem 10 ) * 100 ) + d34;\n if isPrime( d1 + d234 ) then magnanimous( ( d12 * 100 ) + d34 ) := true\n end if_isPrime_d123_plus_d4\n end if_isPrime_d12_plus_d34\n end for_d34 ;\n for d345 := 0 until 999 do begin\n if isPrime( d12 + d345 ) then begin\n integer d123, d45;\n d123 := ( d12 * 10 ) + ( d345 div 100 );\n d45 := d345 rem 100;\n if isPrime( d123 + d45 ) then begin\n integer d1234, d5;\n d1234 := ( d123 * 10 ) + ( d45 div 10 );\n d5 := d45 rem 10;\n if isPrime( d1234 + d5 ) then begin\n integer d1, d2345;\n d1 := d12 div 10;\n d2345 := ( ( d12 rem 10 ) * 1000 ) + d345;\n if isPrime( d1 + d2345 ) then magnanimous( ( d12 * 1000 ) + d345 ) := true\n end if_isPrime_d1234_plus_d5\n end if_isPrime_d123_plus_d45\n end if_isPrime_d12_plus_d345\n end for_d234\n end for_d12 ;\n % find 6 digit magnanimous numbers %\n for d123 := 100 until 999 do begin\n for d456 := 0 until 999 do begin\n if isPrime( d123 + d456 ) then begin\n integer d1234, d56;\n d1234 := ( d123 * 10 ) + ( d456 div 100 );\n d56 := d456 rem 100;\n if isPrime( d1234 + d56 ) then begin\n integer d12345, d6;\n d12345 := ( d1234 * 10 ) + ( d56 div 10 );\n d6 := d56 rem 10;\n if isPrime( d12345 + d6 ) then begin\n integer d12, d3456;\n d12 := d123 div 10;\n d3456 := ( ( d123 rem 10 ) * 1000 ) + d456;\n if isPrime( d12 + d3456 ) then begin\n integer d1, d23456;\n d1 := d12 div 10;\n d23456 := ( ( d12 rem 10 ) * 10000 ) + d3456;\n if isPrime( d1 + d23456 ) then magnanimous( ( d123 * 1000 ) + d456 ) := true\n end if_isPrime_d12_plus_d3456\n end if_isPrime_d12345_plus_d6\n end if_isPrime_d1234_plus_d56\n end if_isPrime_d123_plus_d456\n end for_d456\n end for_d123\n end findMagnanimous ;\n % we look for magnanimous numbers with up to 6 digits, so we need to %\n % check for primes up to 99999 + 9 = 100008 %\n integer PRIME_MAX, MAGNANIMOUS_MAX;\n PRIME_MAX := 100008;\n MAGNANIMOUS_MAX := 1000000;\n begin\n logical array magnanimous ( 0 :: MAGNANIMOUS_MAX );\n logical array isPrime ( 1 :: PRIME_MAX );\n integer mPos;\n integer lastM;\n sieve( isPrime, PRIME_MAX );\n findMagnanimous( magnanimous, isPrime );\n % show some of the magnanimous numbers %\n lastM := mPos := 0;\n i_w := 3; s_w := 1; % output formatting %\n for i := 0 until MAGNANIMOUS_MAX do begin\n if magnanimous( i ) then begin\n mPos := mPos + 1;\n lastM := i;\n if mPos = 1 then begin\n write( \"Magnanimous numbers 1-45:\" );\n write( i )\n end\n else if mPos < 46 then begin\n if mPos rem 15 = 1 then write( i )\n else writeon( i )\n end\n else if mPos = 241 then begin\n write( \"Magnanimous numbers 241-250:\" );\n write( i )\n end\n else if mPos > 241 and mPos <= 250 then writeon( i )\n else if mPos = 391 then begin\n write( \"Magnanimous numbers 391-400:\" );\n write( i )\n end\n else if mPos > 391 and mPos <= 400 then writeon( i )\n end if_magnanimous_i\n end for_i ;\n i_w := 1; s_w := 0;\n write( \"Last magnanimous number found: \", mPos, \" = \", lastM )\n end\nend.\n","language":"ALGOL-W"},{"code":"#include <basico.h>\n\n#proto encontrarunMagnanimouspara(_X_)\n#synon _encontrarunMagnanimouspara siencontréunMagnanimousen\n\nalgoritmo\n\n decimales '0'\n\n res={}, i=0\n iterar grupo( ++i, #(length(res)<400), \\\n i, meter según ( si encontré un Magnanimous en 'i', res ))\n\n #(utf8(\"Primeros 45 números magnánimos:\\n\")), #(res[1:45])\n #(utf8(\"\\n\\nNúmeros magnánimos 241 - 250:\\n\")), #(res[241:250])\n #(utf8(\"\\n\\nNúmeros magnánimos 391 - 400:\\n\")), #(res[391:400]), NL\n luego imprime esto\n\nterminar\n\nsubrutinas\n\nencontrar un Magnanimous para(n)\n tn=n, d=0, i=0, pd=0\n iterar\n último dígito de 'tn', mover a 'd,tn'\n cuando ' tn ' { #( pd += ( d * 10^i ) ) }\n mientras ' #( tn && is prime(tn+pd) ); ++i '\n\nretornar ' #(not(tn)) '\n","language":"Amazing-Hopper"},{"code":"# syntax: GAWK -f MAGNANIMOUS_NUMBERS.AWK\n# converted from C\nBEGIN {\n magnanimous(1,45)\n magnanimous(241,250)\n magnanimous(391,400)\n exit(0)\n}\nfunction is_magnanimous(n, p,q,r) {\n if (n < 10) { return(1) }\n for (p=10; ; p*=10) {\n q = int(n/p)\n r = n % p\n if (!is_prime(q+r)) { return(0) }\n if (q < 10) { break }\n }\n return(1)\n}\nfunction is_prime(n, d) {\n d = 5\n if (n < 2) { return(0) }\n if (!(n % 2)) { return(n == 2) }\n if (!(n % 3)) { return(n == 3) }\n while (d*d <= n) {\n if (!(n % d)) { return(0) }\n d += 2\n if (!(n % d)) { return(0) }\n d += 4\n }\n return(1)\n}\nfunction magnanimous(start,stop, count,i) {\n printf(\"%d-%d:\",start,stop)\n for (i=0; count<stop; ++i) {\n if (is_magnanimous(i)) {\n if (++count >= start) {\n printf(\" %d\",i)\n }\n }\n }\n printf(\"\\n\")\n}\n","language":"AWK"},{"code":"10 DEFINT A-Z\n20 L = N : R = 0 : S = 1\n30 IF L < 10 GOTO 140\n40 R = R + (L MOD 10) * S\n50 L = L \\ 10\n60 S = S * 10\n70 P = R + L\n80 IF P = 1 GOTO 120 ELSE FOR D = 2 TO SQR(P)\n90 IF P MOD D = 0 GOTO 120\n100 NEXT D\n110 GOTO 30\n120 N = N + 1\n130 GOTO 20\n140 I = I + 1\n150 IF I = 1 THEN PRINT \"1 - 45:\" ELSE IF I = 241 THEN PRINT \"241 - 250:\"\n160 IF I <= 45 OR I > 240 THEN PRINT N,\n170 N = N + 1\n180 IF I < 250 GOTO 20\n190 END\n","language":"BASIC"},{"code":"#include \"isprime.kbs\"\n\ndim magn(400)\nn = 10\nfor i = 0 to 9\n\tmagn[i] = i #all single digit ints are magnanimous by definition\nnext i\n\nwhile i < 400\n\tn += 1\n\tns = string(n)\n\tfor j = 1 to length(ns)-1\n\t\tlefty = left(ns, j)\n\t\trighty = right(ns, length(ns)-j)\n\t\tif not isPrime(int(lefty) + int(righty)) then continue while\n\tnext j\n\tmagn[i] = n\n\ti += 1\nend while\n\nfor i = 0 to 44\n\tprint i+1, magn[i]\nnext i\n\nfor i =240 to 249\n\tprint i+1, magn[i]\nnext i\n\nfor i = 390 to 399\n\tprint i+1, magn[i]\nnext i\nend\n","language":"BASIC256"},{"code":" DIM Sieve% 1E5\n Prime%=2\n WHILE Prime%^2 < 1E5\n FOR S%=Prime%*2 TO 1E5 STEP Prime% Sieve%?S%=1 NEXT\n REPEAT Prime%+=1 UNTIL Sieve%?Prime%=0\n ENDWHILE\n Sieve%?1=1\n\n PRINT \"First 45 magnanimous numbers\"\n REPEAT\n IF M% > 9 THEN\n FOR I%=LOGM% TO 1 STEP -1\n IF Sieve%?((M% DIV 10^I%) + (M% MOD 10^I%)) EXIT FOR\n NEXT\n ENDIF\n IF I% == 0 THEN\n N%+=1\n IF N% == 240 OR N% == 390 PRINT '\"Magnanimous numbers \";N% + 1 \"-\";N% + 10\n IF N% < 46 OR (N% > 240 AND N% < 251) OR (N% > 390 AND N% < 401) PRINT;M% \" \";\n ENDIF\n M%+=1\n UNTIL N% > 400\n","language":"BBC-BASIC"},{"code":"get \"libhdr\"\n\nlet prime(n) = valof\n$( let d = 5\n if n<2 resultis false\n if n rem 2=0 resultis n=2\n if n rem 3=0 resultis n=3\n while d*d <= n\n $( if n rem d=0 resultis false\n d := d+2\n if n rem d=0 resultis false\n d := d+4\n $)\n resultis true\n$)\n\nlet magnanimous(n) = valof\n$( let left = n and right = 0 and shift = 1\n while left >= 10\n $( right := right + (left rem 10) * shift\n shift := shift * 10\n left := left / 10\n unless prime(left + right) resultis false\n $)\n resultis true\n$)\n\nlet start() be\n$( let n = -1\n for i = 1 to 250\n $( n := n+1 repeatuntil magnanimous(n)\n if i=1 then writes(\"1 - 45:*N\")\n if i=241 then writes(\"241 - 250:*N\")\n if 0<i<=45 | 240<i<=250\n $( writed(n, 7)\n if i rem 5=0 then wrch('*N')\n $)\n $)\n$)\n","language":"BCPL"},{"code":"#include <stdio.h>\n#include <string.h>\n\ntypedef int bool;\ntypedef unsigned long long ull;\n\n#define TRUE 1\n#define FALSE 0\n\n/* OK for 'small' numbers. */\nbool is_prime(ull n) {\n ull d;\n if (n < 2) return FALSE;\n if (!(n % 2)) return n == 2;\n if (!(n % 3)) return n == 3;\n d = 5;\n while (d * d <= n) {\n if (!(n % d)) return FALSE;\n d += 2;\n if (!(n % d)) return FALSE;\n d += 4;\n }\n return TRUE;\n}\n\nvoid ord(char *res, int n) {\n char suffix[3];\n int m = n % 100;\n if (m >= 4 && m <= 20) {\n sprintf(res,\"%dth\", n);\n return;\n }\n switch(m % 10) {\n case 1:\n strcpy(suffix, \"st\");\n break;\n case 2:\n strcpy(suffix, \"nd\");\n break;\n case 3:\n strcpy(suffix, \"rd\");\n break;\n default:\n strcpy(suffix, \"th\");\n break;\n }\n sprintf(res, \"%d%s\", n, suffix);\n}\n\nbool is_magnanimous(ull n) {\n ull p, q, r;\n if (n < 10) return TRUE;\n for (p = 10; ; p *= 10) {\n q = n / p;\n r = n % p;\n if (!is_prime(q + r)) return FALSE;\n if (q < 10) break;\n }\n return TRUE;\n}\n\nvoid list_mags(int from, int thru, int digs, int per_line) {\n ull i = 0;\n int c = 0;\n char res1[13], res2[13];\n if (from < 2) {\n printf(\"\\nFirst %d magnanimous numbers:\\n\", thru);\n } else {\n ord(res1, from);\n ord(res2, thru);\n printf(\"\\n%s through %s magnanimous numbers:\\n\", res1, res2);\n }\n for ( ; c < thru; ++i) {\n if (is_magnanimous(i)) {\n if (++c >= from) {\n printf(\"%*llu \", digs, i);\n if (!(c % per_line)) printf(\"\\n\");\n }\n }\n }\n}\n\nint main() {\n list_mags(1, 45, 3, 15);\n list_mags(241, 250, 1, 10);\n list_mags(391, 400, 1, 10);\n return 0;\n}\n","language":"C"},{"code":"#include <iomanip>\n#include <iostream>\n\nbool is_prime(unsigned int n) {\n if (n < 2)\n return false;\n if (n % 2 == 0)\n return n == 2;\n if (n % 3 == 0)\n return n == 3;\n for (unsigned int p = 5; p * p <= n; p += 4) {\n if (n % p == 0)\n return false;\n p += 2;\n if (n % p == 0)\n return false;\n }\n return true;\n}\n\nbool is_magnanimous(unsigned int n) {\n for (unsigned int p = 10; n >= p; p *= 10) {\n if (!is_prime(n % p + n / p))\n return false;\n }\n return true;\n}\n\nint main() {\n unsigned int count = 0, n = 0;\n std::cout << \"First 45 magnanimous numbers:\\n\";\n for (; count < 45; ++n) {\n if (is_magnanimous(n)) {\n if (count > 0)\n std::cout << (count % 15 == 0 ? \"\\n\" : \", \");\n std::cout << std::setw(3) << n;\n ++count;\n }\n }\n std::cout << \"\\n\\n241st through 250th magnanimous numbers:\\n\";\n for (unsigned int i = 0; count < 250; ++n) {\n if (is_magnanimous(n)) {\n if (count++ >= 240) {\n if (i++ > 0)\n std::cout << \", \";\n std::cout << n;\n }\n }\n }\n std::cout << \"\\n\\n391st through 400th magnanimous numbers:\\n\";\n for (unsigned int i = 0; count < 400; ++n) {\n if (is_magnanimous(n)) {\n if (count++ >= 390) {\n if (i++ > 0)\n std::cout << \", \";\n std::cout << n;\n }\n }\n }\n std::cout << '\\n';\n return 0;\n}\n","language":"C++"},{"code":"using System; using static System.Console;\n\nclass Program {\n\n static bool[] np; // not-prime array\n\n static void ms(long lmt) { // populates array, a not-prime is true\n np = new bool[lmt]; np[0] = np[1] = true;\n for (long n = 2, j = 1; n < lmt; n += j, j = 2) if (!np[n])\n for (long k = n * n; k < lmt; k += n) np[k] = true; }\n\n static bool is_Mag(long n) { long res, rem;\n for (long p = 10; n >= p; p *= 10) {\n res = Math.DivRem (n, p, out rem);\n if (np[res + rem]) return false; } return true; }\n\n static void Main(string[] args) { ms(100_009); string mn;\n WriteLine(\"First 45{0}\", mn = \" magnanimous numbers:\");\n for (long l = 0, c = 0; c < 400; l++) if (is_Mag(l)) {\n if (c++ < 45 || (c > 240 && c <= 250) || c > 390)\n Write(c <= 45 ? \"{0,4} \" : \"{0,8:n0} \", l);\n if (c < 45 && c % 15 == 0) WriteLine();\n if (c == 240) WriteLine (\"\\n\\n241st through 250th{0}\", mn);\n if (c == 390) WriteLine (\"\\n\\n391st through 400th{0}\", mn); } }\n}\n","language":"C-sharp"},{"code":"prime = proc (n: int) returns (bool)\n if n < 2 then return(false) end\n if n//2 = 0 then return(n=2) end\n if n//3 = 0 then return(n=3) end\n d: int := 5\n while d*d <= n do\n if n//d = 0 then return(false) end\n d := d+2\n if n//d = 0 then return(false) end\n d := d+4\n end\n return(true)\nend prime\n\nsum_parts = iter (l: int) yields (int)\n r: int := 0\n s: int := 0\n while l >= 10 do\n r := r + (l // 10) * 10 ** s\n s := s + 1\n l := l / 10\n yield(l + r)\n end\nend sum_parts\n\nmagnanimous = proc (n: int) returns (bool)\n for s: int in sum_parts(n) do\n if ~prime(s) then return(false) end\n end\n return(true)\nend magnanimous\n\nstart_up = proc ()\n po: stream := stream$primary_output()\n n: int := 0\n i: int := 0\n c: int := 0\n\n while i <= 400 do\n while ~magnanimous(n) do n := n+1 end\n i := i+1\n\n if i=1 then stream$putl(po, \"1-45:\") c := 0\n elseif i=241 then stream$putl(po, \"\\n241-250:\") c := 0\n elseif i=391 then stream$putl(po, \"391-400:\") c := 0\n end\n\n if i <= 45 cor (i > 240 cand i <= 250) cor (i > 390 cand i <= 400) then\n stream$putright(po, int$unparse(n), 7)\n c := c+1\n if c = 10 then stream$putl(po, \"\") c := 0 end\n end\n n := n+1\n end\nend start_up\n","language":"CLU"},{"code":"include \"cowgol.coh\";\n\nsub prime(n: uint32): (r: uint32) is\n r := 0;\n if n <= 4 or n & 1 == 0 or n % 3 == 0 then\n if n == 2 or n == 3 then\n r := 1;\n end if;\n return;\n end if;\n\n var d: uint32 := 5;\n while d*d <= n loop\n if n % d == 0 then return; end if;\n d := d+2;\n if n % d == 0 then return; end if;\n d := d+4;\n end loop;\n r := 1;\nend sub;\n\nsub magnanimous(n: uint32): (r: uint32) is\n r := 1;\n var left: uint32 := n;\n var right: uint32 := 0;\n var shift: uint32 := 1;\n\n while left >= 10 loop\n right := right + (left % 10) * shift;\n shift := shift * 10;\n left := left / 10;\n if prime(left + right) == 0 then\n r := 0;\n break;\n end if;\n end loop;\nend sub;\n\nvar i: uint16 := 0;\nvar n: uint32 := 0;\n\nwhile i <= 400 loop\n while magnanimous(n) == 0 loop n := n+1; end loop;\n i := i + 1;\n\n if i == 1 then print(\"1 - 45:\\n\");\n elseif i == 241 then print(\"241 - 250:\\n\");\n elseif i == 391 then print(\"390 - 400:\\n\");\n end if;\n\n if i<=45 or (i>240 and i<=250) or (i>390 and i<=400) then\n print_i32(n);\n if i % 5 == 0 then print_nl();\n else print_char('\\t');\n end if;\n end if;\n n := n + 1;\nend loop;\n","language":"Cowgol"},{"code":"function IsPrime(N: int64): boolean;\n{Fast, optimised prime test}\nvar I,Stop: int64;\nbegin\nif (N = 2) or (N=3) then Result:=true\nelse if (n <= 1) or ((n mod 2) = 0) or ((n mod 3) = 0) then Result:= false\nelse\n begin\n I:=5;\n Stop:=Trunc(sqrt(N+0.0));\n Result:=False;\n while I<=Stop do\n begin\n if ((N mod I) = 0) or ((N mod (I + 2)) = 0) then exit;\n Inc(I,6);\n end;\n Result:=True;\n end;\nend;\n\nfunction IsMagnanimous(N: Integer): boolean;\nvar S,S1,S2: string;\nvar I,I1,I2: integer;\nbegin\nResult:=True;\nif N<10 then exit;\nResult:=False;\nS:=IntToStr(N);\nfor I:=2 to Length(S) do\n\tbegin\n\tS1:=Copy(S,1,I-1);\n\tS2:=Copy(S,I,(Length(S)-I)+1);\n\tI1:=StrToInt(S1);\n\tI2:=StrToInt(S2);\n\tif not IsPrime(I1+I2) then exit;\n\tend;\nResult:=True;\nend;\n\nprocedure MagnanimousRange(Memo: TMemo; Start,Stop: integer);\nvar I,MagCnt,ItemCnt: integer;\nvar S: string;\nbegin\nS:='';\nMagCnt:=0;\nItemCnt:=0;\nfor I:=0 to High(Integer) do\n if IsMagnanimous(I) then\n \tbegin\n \tInc(MagCnt);\n \tif MagCnt>=Start then\n \t\tbegin\n \t\tif MagCnt>Stop then break;\n \t\tS:=S+Format('%12d',[I]);\n \t\tInc(ItemCnt);\n \t\tif (ItemCnt mod 5)=0 then S:=S+#$0D#$0A;\n \t\tend;\n \tend;\nMemo.Lines.Add(S);\nend;\n\nprocedure MagnanimousNumbers(Memo: TMemo);\nbegin\nMemo.Lines.Add('First 45 Magnanimous Numbers');\nMagnanimousRange(Memo,0,45);\nMemo.Lines.Add('Magnanimous Numbers 241 through 250');\nMagnanimousRange(Memo,241,250);\nMemo.Lines.Add('Magnanimous Numbers 391 through 400');\nMagnanimousRange(Memo,391,400);\nend;\n","language":"Delphi"},{"code":"proc isprime(word n) bool:\n word d;\n bool prime;\n if n<2 then false\n elif n%2=0 then n=2\n elif n%3=0 then n=3\n else\n prime := true;\n d := 5;\n while prime and d*d <= n do\n if n%d=0 then prime := false fi;\n d := d+2;\n if n%d=0 then prime := false fi;\n d := d+4\n od;\n prime\n fi\ncorp\n\nproc magnanimous(word n) bool:\n word left, right, shift;\n bool magn;\n left := n;\n right := 0;\n shift := 1;\n magn := true;\n while magn and left >= 10 do\n right := right + (left % 10) * shift;\n shift := shift * 10;\n left := left / 10;\n magn := magn and isprime(left + right)\n od;\n magn\ncorp\n\nproc main() void:\n word n, i;\n n := 0;\n for i from 1 upto 250 do\n while not magnanimous(n) do n := n+1 od;\n if i=1 then writeln(\"1 - 45:\") fi;\n if i=241 then writeln(\"241 - 250:\") fi;\n if i<=45 or i>=241 then\n write(n:7);\n if i%5 = 0 then writeln() fi\n fi;\n n := n+1\n od\ncorp\n","language":"Draco"},{"code":"fastfunc isprim num .\n if num < 2\n return 0\n .\n i = 2\n while i <= sqrt num\n if num mod i = 0\n return 0\n .\n i += 1\n .\n return 1\n.\nfunc ismagnan n .\n if n < 10\n return 1\n .\n p = 10\n repeat\n q = n div p\n r = n mod p\n if isprim (q + r) = 0\n return 0\n .\n until q < 10\n p *= 10\n .\n return 1\n.\nproc magnan start stop . .\n write start & \"-\" & stop & \":\"\n while count < stop\n if ismagnan i = 1\n count += 1\n if count >= start\n write \" \" & i\n .\n .\n i += 1\n .\n print \"\"\n.\nmagnan 1 45\nmagnan 241 250\nmagnan 391 400\n","language":"EasyLang"},{"code":"// Generate Magnanimous numbers. Nigel Galloway: March 20th., 2020\nlet rec fN n g = match (g/n,g%n) with\n (0,_) -> true\n |(α,β) when isPrime (α+β) -> fN (n*10) g\n |_ -> false\nlet Magnanimous = let Magnanimous = fN 10 in seq{yield! {0..9}; yield! Seq.initInfinite id |> Seq.skip 10 |> Seq.filter Magnanimous}\n","language":"F-Sharp"},{"code":"Magnanimous |> Seq.take 45 |> Seq.iter (printf \"%d \"); printfn \"\"\n","language":"F-Sharp"},{"code":"Magnanimous |> Seq.skip 240 |> Seq.take 10 |> Seq.iter (printf \"%d \"); printfn \"\";;\n","language":"F-Sharp"},{"code":"Magnanimous |> Seq.skip 390 |> Seq.take 10 |> Seq.iter (printf \"%d \"); printfn \"\";;\n","language":"F-Sharp"},{"code":"USING: grouping io kernel lists lists.lazy math math.functions\nmath.primes math.ranges prettyprint sequences ;\n\n: magnanimous? ( n -- ? )\n dup 10 < [ drop t ] [\n dup log10 >integer [1,b] [ 10^ /mod + prime? not ] with\n find nip >boolean not\n ] if ;\n\n: magnanimous ( n -- seq )\n 0 lfrom [ magnanimous? ] lfilter ltake list>array ;\n\n: show ( seq from to -- ) rot subseq 15 group simple-table. nl ;\n\n400 magnanimous\n[ \"First 45 magnanimous numbers\" print 0 45 show ]\n[ \"241st through 250th magnanimous numbers\" print 240 250 show ]\n[ \"391st through 400th magnanimous numbers\" print 390 400 show ]\ntri\n","language":"Factor"},{"code":"#include \"isprime.bas\"\n\ndim as uinteger magn(0 to 399), i, n=10, j\ndim as string ns, lefty, righty\nfor i = 0 to 9\n magn(i) = i 'all single digit ints are magnanimous by definition\nnext i\n\nwhile i<400\n n += 1\n ns = str(n)\n for j = 1 to len(ns)-1\n lefty = left(ns, j)\n righty = right(ns, len(ns)-j)\n if not isprime( val(lefty) + val(righty) ) then continue while\n next j\n magn(i) = n\n i+=1\nwend\n\nfor i=0 to 44\n print i+1,magn(i)\nnext i\n\nfor i=240 to 249\n print i+1,magn(i)\nnext i\n\nfor i=390 to 399\n print i+1,magn(i)\nnext i\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\n// OK for 'small' numbers.\nfunc isPrime(n uint64) bool {\n switch {\n case n < 2:\n return false\n case n%2 == 0:\n return n == 2\n case n%3 == 0:\n return n == 3\n default:\n d := uint64(5)\n for d*d <= n {\n if n%d == 0 {\n return false\n }\n d += 2\n if n%d == 0 {\n return false\n }\n d += 4\n }\n return true\n }\n}\n\nfunc ord(n int) string {\n m := n % 100\n if m >= 4 && m <= 20 {\n return fmt.Sprintf(\"%dth\", n)\n }\n m %= 10\n suffix := \"th\"\n if m < 4 {\n switch m {\n case 1:\n suffix = \"st\"\n case 2:\n suffix = \"nd\"\n case 3:\n suffix = \"rd\"\n }\n }\n return fmt.Sprintf(\"%d%s\", n, suffix)\n}\n\nfunc isMagnanimous(n uint64) bool {\n if n < 10 {\n return true\n }\n for p := uint64(10); ; p *= 10 {\n q := n / p\n r := n % p\n if !isPrime(q + r) {\n return false\n }\n if q < 10 {\n break\n }\n }\n return true\n}\n\nfunc listMags(from, thru, digs, perLine int) {\n if from < 2 {\n fmt.Println(\"\\nFirst\", thru, \"magnanimous numbers:\")\n } else {\n fmt.Printf(\"\\n%s through %s magnanimous numbers:\\n\", ord(from), ord(thru))\n }\n for i, c := uint64(0), 0; c < thru; i++ {\n if isMagnanimous(i) {\n c++\n if c >= from {\n fmt.Printf(\"%*d \", digs, i)\n if c%perLine == 0 {\n fmt.Println()\n }\n }\n }\n }\n}\n\nfunc main() {\n listMags(1, 45, 3, 15)\n listMags(241, 250, 1, 10)\n listMags(391, 400, 1, 10)\n}\n","language":"Go"},{"code":"100 DEFINT A-Z\n110 CLS\n120 LET L = N\n130 LET R = 0\n140 LET S = 1\n150 IF L < 10 THEN GOTO 300\n160 LET R = R+(L MOD 10)*S\n170 LET L = L\\10\n180 LET S = S*10\n190 LET P = R+L\n200 IF P = 1 THEN GOTO 280 ELSE FOR D = 2 TO SQR(P)\n210 IF P MOD D = 0 THEN GOTO 280\n250 NEXT D\n270 GOTO 150\n280 LET N = N+1\n290 GOTO 120\n300 LET I = I+1\n310 IF I = 1 THEN PRINT \"1 - 45:\" ELSE IF I = 241 THEN PRINT : PRINT \"241 - 250:\"\n320 IF I <= 45 OR I > 240 THEN PRINT N,\n330 LET N = N+1\n340 IF I < 250 THEN GOTO 120\n350 PRINT\n360 END\n","language":"GW-BASIC"},{"code":"import Data.List.Split ( chunksOf )\nimport Data.List ( (!!) )\n\nisPrime :: Int -> Bool\nisPrime n\n |n == 2 = True\n |n == 1 = False\n |otherwise = null $ filter (\\i -> mod n i == 0 ) [2 .. root]\n where\n root :: Int\n root = floor $ sqrt $ fromIntegral n\n\nisMagnanimous :: Int -> Bool\nisMagnanimous n = all isPrime $ map (\\p -> fst p + snd p ) numberPairs\n where\n str:: String\n str = show n\n splitStrings :: [(String , String)]\n splitStrings = map (\\i -> splitAt i str) [1 .. length str - 1]\n numberPairs :: [(Int , Int)]\n numberPairs = map (\\p -> ( read $ fst p , read $ snd p )) splitStrings\n\nprintInWidth :: Int -> Int -> String\nprintInWidth number width = replicate ( width - l ) ' ' ++ str\n where\n str :: String\n str = show number\n l :: Int\n l = length str\n\nsolution :: [Int]\nsolution = take 400 $ filter isMagnanimous [0 , 1 ..]\n\nmain :: IO ( )\nmain = do\n let numbers = solution\n numberlines = chunksOf 10 $ take 45 numbers\n putStrLn \"First 45 magnanimous numbers:\"\n mapM_ (\\li -> putStrLn (foldl1 ( ++ ) $ map (\\n -> printInWidth n 6 )\n li )) numberlines\n putStrLn \"241'st to 250th magnanimous numbers:\"\n putStr $ show ( numbers !! 240 )\n putStrLn ( foldl1 ( ++ ) $ map(\\n -> printInWidth n 8 ) $ take 9 $\n drop 241 numbers )\n putStrLn \"391'st to 400th magnanimous numbers:\"\n putStr $ show ( numbers !! 390 )\n putStrLn ( foldl1 ( ++ ) $ map(\\n -> printInWidth n 8 ) $ drop 391 numbers)\n","language":"Haskell"},{"code":"import java.util.ArrayList;\nimport java.util.List;\n\npublic class MagnanimousNumbers {\n\n public static void main(String[] args) {\n runTask(\"Find and display the first 45 magnanimous numbers.\", 1, 45);\n runTask(\"241st through 250th magnanimous numbers.\", 241, 250);\n runTask(\"391st through 400th magnanimous numbers.\", 391, 400);\n }\n\n private static void runTask(String message, int startN, int endN) {\n int count = 0;\n List<Integer> nums = new ArrayList<>();\n for ( int n = 0 ; count < endN ; n++ ) {\n if ( isMagnanimous(n) ) {\n nums.add(n);\n count++;\n }\n }\n System.out.printf(\"%s%n\", message);\n System.out.printf(\"%s%n%n\", nums.subList(startN-1, endN));\n }\n\n private static boolean isMagnanimous(long n) {\n if ( n >= 0 && n <= 9 ) {\n return true;\n }\n long q = 11;\n for ( long div = 10 ; q >= 10 ; div *= 10 ) {\n q = n / div;\n long r = n % div;\n if ( ! isPrime(q+r) ) {\n return false;\n }\n }\n return true;\n }\n\n private static final int MAX = 100_000;\n private static final boolean[] primes = new boolean[MAX];\n private static boolean SIEVE_COMPLETE = false;\n\n private static final boolean isPrimeTrivial(long test) {\n if ( ! SIEVE_COMPLETE ) {\n sieve();\n SIEVE_COMPLETE = true;\n }\n return primes[(int) test];\n }\n\n private static final void sieve() {\n // primes\n for ( int i = 2 ; i < MAX ; i++ ) {\n primes[i] = true;\n }\n for ( int i = 2 ; i < MAX ; i++ ) {\n if ( primes[i] ) {\n for ( int j = 2*i ; j < MAX ; j += i ) {\n primes[j] = false;\n }\n }\n }\n }\n\n // See http://primes.utm.edu/glossary/page.php?sort=StrongPRP\n public static final boolean isPrime(long testValue) {\n if ( testValue == 2 ) return true;\n if ( testValue % 2 == 0 ) return false;\n if ( testValue <= MAX ) return isPrimeTrivial(testValue);\n long d = testValue-1;\n int s = 0;\n while ( d % 2 == 0 ) {\n s += 1;\n d /= 2;\n }\n if ( testValue < 1373565L ) {\n if ( ! aSrp(2, s, d, testValue) ) {\n return false;\n }\n if ( ! aSrp(3, s, d, testValue) ) {\n return false;\n }\n return true;\n }\n if ( testValue < 4759123141L ) {\n if ( ! aSrp(2, s, d, testValue) ) {\n return false;\n }\n if ( ! aSrp(7, s, d, testValue) ) {\n return false;\n }\n if ( ! aSrp(61, s, d, testValue) ) {\n return false;\n }\n return true;\n }\n if ( testValue < 10000000000000000L ) {\n if ( ! aSrp(3, s, d, testValue) ) {\n return false;\n }\n if ( ! aSrp(24251, s, d, testValue) ) {\n return false;\n }\n return true;\n }\n // Try 5 \"random\" primes\n if ( ! aSrp(37, s, d, testValue) ) {\n return false;\n }\n if ( ! aSrp(47, s, d, testValue) ) {\n return false;\n }\n if ( ! aSrp(61, s, d, testValue) ) {\n return false;\n }\n if ( ! aSrp(73, s, d, testValue) ) {\n return false;\n }\n if ( ! aSrp(83, s, d, testValue) ) {\n return false;\n }\n //throw new RuntimeException(\"ERROR isPrime: Value too large = \"+testValue);\n return true;\n }\n\n private static final boolean aSrp(int a, int s, long d, long n) {\n long modPow = modPow(a, d, n);\n //System.out.println(\"a = \"+a+\", s = \"+s+\", d = \"+d+\", n = \"+n+\", modpow = \"+modPow);\n if ( modPow == 1 ) {\n return true;\n }\n int twoExpR = 1;\n for ( int r = 0 ; r < s ; r++ ) {\n if ( modPow(modPow, twoExpR, n) == n-1 ) {\n return true;\n }\n twoExpR *= 2;\n }\n return false;\n }\n\n private static final long SQRT = (long) Math.sqrt(Long.MAX_VALUE);\n\n public static final long modPow(long base, long exponent, long modulus) {\n long result = 1;\n while ( exponent > 0 ) {\n if ( exponent % 2 == 1 ) {\n if ( result > SQRT || base > SQRT ) {\n result = multiply(result, base, modulus);\n }\n else {\n result = (result * base) % modulus;\n }\n }\n exponent >>= 1;\n if ( base > SQRT ) {\n base = multiply(base, base, modulus);\n }\n else {\n base = (base * base) % modulus;\n }\n }\n return result;\n }\n\n\n // Result is a*b % mod, without overflow.\n public static final long multiply(long a, long b, long modulus) {\n long x = 0;\n long y = a % modulus;\n long t;\n while ( b > 0 ) {\n if ( b % 2 == 1 ) {\n t = x + y;\n x = (t > modulus ? t-modulus : t);\n }\n t = y << 1;\n y = (t > modulus ? t-modulus : t);\n b >>= 1;\n }\n return x % modulus;\n }\n\n}\n","language":"Java"},{"code":"# To take advantage of gojq's arbitrary-precision integer arithmetic:\ndef power($b): . as $in | reduce range(0;$b) as $i (1; . * $in);\n\ndef divrem($x; $y):\n [$x/$y|floor, $x % $y];\n","language":"Jq"},{"code":"def ismagnanimous:\n . as $n\n | if $n < 10 then true\n else first(range( 1; tostring|length) as $i\n\t | divrem($n; (10|power($i))) as [$q, $r]\n | if ($q + $r) | is_prime == false then 0 else empty end)\n // true\n | . == true\n end;\n\n# An unbounded stream ...\ndef magnanimous:\n range(0; infinite)\n | select(ismagnanimous);\n\n[limit(400; magnanimous)]\n| \"First 45 magnanimous numbers:\", .[:45],\n \"\\n241st through 250th magnanimous numbers:\", .[241:251],\n \"\\n391st through 400th magnanimous numbers:\", .[391:]\n","language":"Jq"},{"code":"using Primes\n\nfunction ismagnanimous(n)\n n < 10 && return true\n for i in 1:ndigits(n)-1\n q, r = divrem(n, 10^i)\n !isprime(q + r) && return false\n end\n return true\nend\n\nfunction magnanimous(N)\n mvec, i = Int[], 0\n while length(mvec) < N\n if ismagnanimous(i)\n push!(mvec, i)\n end\n i += 1\n end\n return mvec\nend\n\nconst mag400 = magnanimous(400)\nprintln(\"First 45 magnanimous numbers:\\n\", mag400[1:24], \"\\n\", mag400[25:45])\nprintln(\"\\n241st through 250th magnanimous numbers:\\n\", mag400[241:250])\nprintln(\"\\n391st through 400th magnanimous numbers:\\n\", mag400[391:400])\n","language":"Julia"},{"code":"{def isprime\n {def isprime.loop\n {lambda {:n :m :i}\n {if {> :i :m}\n then true\n else {if {= {% :n :i} 0}\n then false\n else {isprime.loop :n :m {+ :i 2}}\n }}}}\n {lambda {:n}\n {if {= :n 1}\n then false\n else {if {or {= :n 2} {= :n 3} {= :n 5} {= :n 7}}\n then true\n else {if {or {< : n 2} {= {% :n 2} 0}}\n then false\n else {isprime.loop :n {sqrt :n} 3}\n}}}}}\n-> isprime\n\n{def magnanimous\n {def magnanimous.loop\n {lambda {:n :p :r}\n {if {>= :n 10}\n then {let { {:n {floor {/ :n 10}}}\n {:p :p}\n {:r {+ :r {* {% :n 10} :p}}}\n } {if {not {isprime {+ :n :r}}}\n then false\n else {magnanimous.loop :n {* :p 10} :r} }\n }\n else true }}}\n {lambda {:n}\n {magnanimous.loop :n 1 0} }}\n-> magnanimous\n\n{def mags\n {lambda {:n}\n {S.last\n {S.map {{lambda {:a :i}\n {if {magnanimous :i} then {A.addlast! :i :a} else}}\n {A.new}}\n {S.serie 0 :n}}}}}\n-> mags\n\n{A.slice 0 45 {mags 110}}\n-> [0,1,2,3,4,5,6,7,8,9,11,12,14,16,20,21,23,25,29,30,32,34,38,41,43,47,49,50,52,56,58,61,65,67,70,74,76,83,85,89,92,94,98,101,110]\n\n{A.slice 240 250 {mags 30000}}\n->\n[17992,19972,20209,20261,20861,22061,22201,22801,22885,24407]\n\n{A.slice 390 400 {mags 700000}}\n->\n[486685,488489,515116,533176,551558,559952,595592,595598,600881,602081]\n\ntime of CPU in milliseconds\n iPadPro MacBookAir MacBookPro\n[0,45] \t 30 \t 15 \t 12\n[240,250] \t2430 \t 5770 \t 3650\n[390,400] 117390 \t 284230 \t 213210\n","language":"Lambdatalk"},{"code":"Clear[MagnanimousNumberQ]\nMagnanimousNumberQ[Alternatives @@ Range[0, 9]] = True;\nMagnanimousNumberQ[n_Integer] := AllTrue[Range[IntegerLength[n] - 1], PrimeQ[Total[FromDigits /@ TakeDrop[IntegerDigits[n], #]]] &]\nsel = Select[Range[0, 1000000], MagnanimousNumberQ];\nsel[[;; 45]]\nsel[[241 ;; 250]]\nsel[[391 ;; 400]]\n","language":"Mathematica"},{"code":"MODULE MagnanimousNumbers;\nFROM InOut IMPORT WriteString, WriteCard, WriteLn;\n\nVAR n, i: CARDINAL;\n\nPROCEDURE prime(n: CARDINAL): BOOLEAN;\n VAR d: CARDINAL;\nBEGIN\n IF n<2 THEN RETURN FALSE END;\n IF n MOD 2 = 0 THEN RETURN n = 2 END;\n IF n MOD 3 = 0 THEN RETURN n = 3 END;\n d := 5;\n WHILE d*d <= n DO\n IF n MOD d = 0 THEN RETURN FALSE END;\n INC(d, 2);\n IF n MOD d = 0 THEN RETURN FALSE END;\n INC(d, 4)\n END;\n RETURN TRUE\nEND prime;\n\nPROCEDURE magnanimous(n: CARDINAL): BOOLEAN;\n VAR left, right, shift: CARDINAL;\nBEGIN\n left := n;\n right := 0;\n shift := 1;\n WHILE left >= 10 DO\n INC(right, (left MOD 10) * shift);\n shift := shift * 10;\n left := left DIV 10;\n IF NOT prime(left + right) THEN RETURN FALSE END\n END;\n RETURN TRUE\nEND magnanimous;\n\nBEGIN\n n := 0;\n FOR i := 1 TO 250 DO\n WHILE NOT magnanimous(n) DO INC(n) END;\n\n IF i=1 THEN WriteString(\"1 - 45:\"); WriteLn\n ELSIF i=240 THEN WriteString(\"241 - 250:\"); WriteLn\n END;\n\n IF (i <= 45) OR (i > 240) THEN\n WriteCard(n, 7);\n IF i MOD 5 = 0 THEN WriteLn END\n END;\n INC(n)\n END\nEND MagnanimousNumbers.\n","language":"Modula-2"},{"code":"func isPrime(n: Natural): bool =\n if n < 2: return\n if n mod 2 == 0: return n == 2\n if n mod 3 == 0: return n == 3\n var d = 5\n while d * d <= n:\n if n mod d == 0: return false\n inc d, 2\n if n mod d == 0: return false\n inc d, 4\n return true\n\n\nfunc isMagnanimous(n: Natural): bool =\n var p = 10\n while true:\n let a = n div p\n let b = n mod p\n if a == 0: break\n if not isPrime(a + b): return false\n p *= 10\n return true\n\n\niterator magnanimous(): (int, int) =\n var n, count = 0\n while true:\n if n.isMagnanimous:\n inc count\n yield (count, n)\n inc n\n\n\nfor (i, n) in magnanimous():\n if i in 1..45:\n if i == 1: stdout.write \"First 45 magnanimous numbers:\\n \"\n stdout.write n, if i == 45: '\\n' else: ' '\n\n elif i in 241..250:\n if i == 241: stdout.write \"\\n241st through 250th magnanimous numbers:\\n \"\n stdout.write n, if i == 250: \"\\n\" else: \" \"\n\n elif i in 391..400:\n if i == 391: stdout.write \"\\n391st through 400th magnanimous numbers:\\n \"\n stdout.write n, if i == 400: \"\\n\" else: \" \"\n\n elif i > 400:\n break\n","language":"Nim"},{"code":"program Magnanimous;\n//Magnanimous Numbers\n//algorithm find only numbers where all digits are even except the last\n//or where all digits are odd except the last\n//so 1,11,20,101,1001 will not be found\n//starting at 100001 \"1>\"+x\"0\"+\"1\" is not prime because of 1001 not prime\n{$IFDEF FPC}\n {$MODE DELPHI}\n {$Optimization ON}\n {$CODEALIGN proc=16}\n{$ELSE}\n {$APPTYPE CONSOLE}\n{$ENDIF}\n{$DEFINE USE_GMP}\nuses\n //strUtils, // commatize Numb2USA\n {$IFDEF USE_GMP}gmp,{$ENDIF}\n SysUtils;\nconst\n MaxLimit = 10*1000*1000 +10;\n MAXHIGHIDX = 10;\ntype\n tprimes = array of byte;\n tBaseType = Byte;\n tpBaseType = pByte;\n tBase =array[0..15] of tBaseType;\n tNumType = NativeUint;\n tSplitNum = array[0..15] of tNumType;\n tMagList = array[0..1023] of Uint64;\nvar\n {$ALIGN 32}\n MagList : tMagList;\n\n dgtBase5, // count in Base 5\n dgtORMask, //Mark of used digit (or (1 shl Digit ))\n dgtEvenBase10,\n dgtOddBase10: tbase;\n\n primes : tprimes;\n {$IFDEF USE_GMP} z : mpz_t;gmp_count :NativeUint;{$ENDIF}\n pPrimes0 : pByte;\n T0: int64;\n HighIdx,num,MagIdx,count,cnt: NativeUint;\n\n procedure InitPrimes;\n const\n smallprimes :array[0..5] of byte = (2,3,5,7,11,13);\n var\n pPrimes : pByte;\n p,i,j,l : NativeUint;\n begin\n l := 1;\n for j := 0 to High(smallprimes) do\n l*= smallprimes[j];\n //scale primelimit to be multiple of l\n i :=((MaxLimit-1) DIV l+1)*l+1;//+1 should suffice\n setlength(primes,i);\n pPrimes := @primes[0];\n\n for j := 0 to High(smallprimes) do\n begin\n p := smallprimes[j];\n i := p;\n if j <> 0 then\n p +=p;\n while i <= l do\n begin\n pPrimes[i] := 1;\n inc(i,p)\n end;\n end;\n //turn the prime wheel\n for p := length(primes) div l -1 downto 1 do\n move(pPrimes[1],pPrimes[p*l+1],l);\n\n l := High(primes);\n //reinsert smallprimes\n for j := 0 to High(smallprimes) do\n pPrimes[smallprimes[j]] := 0;\n pPrimes[1]:=1;\n pPrimes[0]:=1;\n\n p := smallprimes[High(smallprimes)];\n repeat\n repeat\n inc(p)\n until pPrimes[p] = 0;\n j := l div p;\n while (pPrimes[j]<> 0) AND (j>=p) do\n dec(j);\n if j<p then\n BREAK;\n //delta going downwards no factor 2,3 :-2 -4 -2 -4\n i := (j+1) mod 6;\n if i = 0 then\n i :=4;\n repeat\n while (pPrimes[j]<> 0) AND (j>=p) do\n begin\n dec(j,i);\n i := 6-i;\n end;\n if j<p then\n BREAK;\n pPrimes[j*p] := 1;\n dec(j,i);\n i := 6-i;\n until j<p;\n until false;\n\n pPrimes0 := pPrimes;\n end;\n\n procedure InsertSort(pMag:pUint64; Left, Right : NativeInt );\n var\n I, J: NativeInt;\n Pivot : Uint64;\n begin\n for i:= 1 + Left to Right do\n begin\n Pivot:= pMag[i];\n j:= i - 1;\n while (j >= Left) and (pMag[j] > Pivot) do\n begin\n pMag[j+1]:=pMag[j];\n Dec(j);\n end;\n pMag[j+1]:= pivot;\n end;\n end;\n\n procedure OutBase5;\n var\n pb: tpBaseType;\n i : NativeUint;\n begin\n write(count :10);\n pb:= @dgtBase5[0];\n for i := HighIdx downto 0 do\n write(pb[i]:3);\n write(' : ' );\n pb:= @dgtORMask[0];\n for i := HighIdx downto 0 do\n write(pb[i]:3);\n end;\n\n function Base10toNum(var dgtBase10: tBase):NativeUint;\n var\n i : NativeInt;\n begin\n Result := 0;\n for i := HighIdx downto 0 do\n Result := Result * 10 + dgtBase10[i];\n end;\n\n procedure OutSol(cnt:Uint64);\n begin\n writeln(MagIdx:4,cnt:13,Base10toNum(dgtOddBase10):20,\n (Gettickcount64-T0) / 1000: 10: 3, ' s');\n end;\n\n procedure CnvEvenBase10(lastIdx:NativeInt);\n var\n pdgt : tpBaseType;\n idx: nativeint;\n begin\n pDgt := @dgtEvenBase10[0];\n for idx := lastIdx downto 1 do\n pDgt[idx] := 2 * dgtBase5[idx];\n pDgt[0] := 2 * dgtBase5[0]+1;\n end;\n\n procedure CnvOddBase10(lastIdx:NativeInt);\n var\n pdgt : tpBaseType;\n idx: nativeint;\n begin\n pDgt := @dgtOddBase10[0];\n //make all odd\n for idx := lastIdx downto 1 do\n pDgt[idx] := 2 * dgtBase5[idx] + 1;\n //but the lowest even\n pDgt[0] := 2 * dgtBase5[0];\n end;\n\n function IncDgtBase5:NativeUint;\n // increment n base 5 until resulting sum of split number\n // can't end in 5\n var\n pb: tpBaseType;\n n,i: nativeint;\n begin\n result := 0;\n repeat\n repeat\n //increment Base5\n pb:= @dgtBase5[0];\n i := 0;\n repeat\n n := pb[i] + 1;\n if n < 5 then\n begin\n pb[i] := n;\n break;\n end;\n pb[i] := 0;\n Inc(i);\n until False;\n\n if HighIdx < i then\n begin\n HighIdx := i;\n pb[i] := 0;\n end;\n\n if result < i then\n result := i;\n\n n := dgtORMask[i+1];\n while i >= 0 do\n begin\n n := n OR (1 shl pb[i]);\n dgtORMask[i]:= n;\n if n = 31 then\n break;\n dec(i);\n end;\n\n if HighIdx<4 then\n break;\n\n if (n <> 31) OR (i=0) then\n break;\n //Now there are all digits are used at digit i ( not in last pos)\n //this will always lead to a number ending in 5-> not prime\n //so going on with a number that will change the used below i to highest digit\n //to create an overflow of the next number, to change the digits\n dec(i);\n repeat\n pb[i] := 4;\n dgtORMask[i]:= 31;\n dec(i);\n until i < 0;\n\n until false;\n if HighIdx<4 then\n break;\n\n n := dgtORMask[1];\n //ending in 5. base10(base5) for odd 1+4(0,2),3+2(1,1),5+0(2,0)\n i := pb[0];\n if i <= 2 then\n begin\n i := 1 shl (2-i);\n end\n else\n Begin\n //ending in 5 7+8(3,4),9+6(4,3)\n i := 1 shl (4-i);\n n := n shr 3;\n end;\n if (i AND n) = 0 then\n BREAK;\n until false;\n end;\n\n procedure CheckMagn(var dgtBase10: tBase);\n //split number into sum of all \"partitions\" of digits\n //check if sum is always prime\n //1234 -> 1+234,12+34 ;123+4\n var\n LowSplitNum : tSplitNum;\n i,fac,n: NativeInt;\n isMagn : boolean;\n Begin\n n := 0;\n fac := 1;\n For i := 0 to HighIdx-1 do\n begin\n n := fac*dgtBase10[i]+n;\n fac *=10;\n LowSplitNum[HighIdx-1-i] := n;\n end;\n\n n := 0;\n fac := HighIdx;\n isMagn := true;\n\n For i := 0 to fac-1 do\n begin\n //n = HighSplitNum[i]\n n := n*10+dgtBase10[fac-i];\n LowSplitNum[i] += n;\n if LowSplitNum[i]<=MAXLIMIT then\n begin\n isMagn := isMagn AND (pPrimes0[LowSplitNum[i]] = 0);\n if NOT(isMagn) then\n EXIT;\n end;\n end;\n {$IFDEF USE_GMP}\n For i := 0 to fac-1 do\n begin\n n := LowSplitNum[i];\n if n >MAXLIMIT then\n Begin\n// IF NOT((n mod 30) in [1,7,11,13,17,19,23,29]) then EXIT;\n mpz_set_ui(z,n);\n gmp_count +=1;\n isMagn := isMagn AND (mpz_probab_prime_p(z,1) >0);\n if NOT(isMagn) then\n EXIT;\n end;\n end;\n\n {$ENDIF}\n //insert magnanimous numbers\n num := Base10toNum(dgtBase10);\n MagList[MagIdx] := num;\n inc(MagIdx);\n end;\n\nfunction Run(StartDgtCount:byte):Uint64;\nvar\n lastIdx: NativeInt;\nbegin\n result := 0;\n HighIdx := StartDgtCount;// 7 start with 7 digits\n LastIdx := HighIdx;\n repeat\n if dgtBase5[HighIdx] <> 0 then\n Begin\n CnvEvenBase10(LastIdx);\n CheckMagn(dgtEvenBase10);\n end;\n CnvOddBase10(LastIdx);\n CheckMagn(dgtOddBase10);\n inc(result);\n //output for still running every 16.22 Mio\n IF result AND (1 shl 22-1) = 0 then\n OutSol(result);\n\n lastIdx := IncDgtBase5;\n until HighIdx > MAXHIGHIDX;\n\nend;\n\nBEGIN\n {$IFDEF USE_GMP}mpz_init_set_ui(z,0);{$ENDIF}\n T0 := Gettickcount64;\n InitPrimes;\n T0 -= Gettickcount64;\n writeln('getting primes ',-T0 / 1000: 0: 3, ' s');\n T0 := Gettickcount64;\n fillchar(dgtBase5,SizeOf(dgtBase5),#0);\n fillchar(dgtEvenBase10,SizeOf(dgtEvenBase10),#0);\n fillchar(dgtOddBase10,SizeOf(dgtOddBase10),#0);\n//Magnanimous Numbers that can not be found by this algorithm\n MagIdx := 0;\n MagList[MagIdx] := 1;inc(MagIdx);\n MagList[MagIdx] := 11;inc(MagIdx);\n MagList[MagIdx] := 20;inc(MagIdx);\n MagList[MagIdx] := 101;inc(MagIdx);\n MagList[MagIdx] := 1001;inc(MagIdx);\n //cant be checked easy for ending in 5\n MagList[MagIdx] := 40001;inc(MagIdx);\n {$IFDEF USE_GMP} mpz_init_set_ui(z,0);{$ENDIF}\n\n count := Run(0);\n\n writeln;\n CnvOddBase10(highIdx);\n writeln(MagIdx:5,count:12,Base10toNum(dgtOddBase10):18,\n (Gettickcount64-T0) / 1000: 10: 3, ' s');\n InsertSort(@MagList[0],0,MagIdx-1);\n\n {$IFDEF USE_GMP} mpz_clear(z);writeln('Count of gmp tests ',gmp_count);{$ENDIF}\n For cnt := 0 to MagIdx-1 do\n writeln(cnt+1:3,' ',MagList[cnt]);\n {$IFDEF WINDOWS}\n readln;\n {$ENDIF}\nend.\n","language":"Pascal"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\nuse ntheory 'is_prime';\n\nsub magnanimous {\n my($n) = @_;\n my $last;\n for my $c (1 .. length($n) - 1) {\n ++$last and last unless is_prime substr($n,0,$c) + substr($n,$c)\n }\n not $last;\n}\n\nmy @M;\nfor ( my $i = 0, my $count = 0; $count < 400; $i++ ) {\n ++$count and push @M, $i if magnanimous($i);\n}\n\nsay \"First 45 magnanimous numbers\\n\".\n (sprintf \"@{['%4d' x 45]}\", @M[0..45-1]) =~ s/(.{60})/$1\\n/gr;\n\nsay \"241st through 250th magnanimous numbers\\n\" .\n join ' ', @M[240..249];\n\nsay \"\\n391st through 400th magnanimous numbers\\n\".\n join ' ', @M[390..399];\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;\">magnanimous</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;\">p</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;\">0</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">10</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">r</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><span style=\"color: #000000;\">p</span>\n <span style=\"color: #000000;\">n</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;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">is_prime</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">false</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">*=</span> <span style=\"color: #000000;\">10</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</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: #004080;\">sequence</span> <span style=\"color: #000000;\">mag</span> <span style=\"color: #0000FF;\">=</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;\">0</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">mag</span><span style=\"color: #0000FF;\">)<</span><span style=\"color: #000000;\">400</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">magnanimous</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">mag</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">n</span> <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: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"First 45 magnanimous numbers: \"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">mag</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">45</span><span style=\"color: #0000FF;\">],{</span><span style=\"color: #004600;\">pp_Indent</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">30</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><span style=\"color: #004600;\">pp_Maxlen</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">100</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;\">\"magnanimous numbers[241..250]: %v\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">mag</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">241</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">250</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;\">\"magnanimous numbers[391..400]: %v\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">mag</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">391</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">400</span><span style=\"color: #0000FF;\">]})</span>\n<!--\n","language":"Phix"},{"code":"(de **Mod (X Y N)\n (let M 1\n (loop\n (when (bit? 1 Y)\n (setq M (% (* M X) N)) )\n (T (=0 (setq Y (>> 1 Y)))\n M )\n (setq X (% (* X X) N)) ) ) )\n(de isprime (N)\n (cache '(NIL) N\n (if (== N 2)\n T\n (and\n (> N 1)\n (bit? 1 N)\n (let (Q (dec N) N1 (dec N) K 0 X)\n (until (bit? 1 Q)\n (setq\n Q (>> 1 Q)\n K (inc K) ) )\n (catch 'composite\n (do 16\n (loop\n (setq X\n (**Mod\n (rand 2 (min (dec N) 1000000000000))\n Q\n N ) )\n (T (or (=1 X) (= X N1)))\n (T\n (do K\n (setq X (**Mod X 2 N))\n (when (=1 X) (throw 'composite))\n (T (= X N1) T) ) )\n (throw 'composite) ) )\n (throw 'composite T) ) ) ) ) ) )\n(de numbers (N)\n (let (P 10 Q N)\n (make\n (until (> 10 Q)\n (link\n (+\n (setq Q (/ N P))\n (% N P) ) )\n (setq P (* P 10)) ) ) ) )\n(de ismagna (N)\n (or\n (> 10 N)\n (fully isprime (numbers N)) ) )\n(let (C 0 N 0 Lst)\n (setq Lst\n (make\n (until (== C 401)\n (when (ismagna N)\n (link N)\n (inc 'C) )\n (inc 'N) ) ) )\n (println (head 45 Lst))\n (println (head 10 (nth Lst 241)))\n (println (head 10 (nth Lst 391))) )\n","language":"PicoLisp"},{"code":"100H: /* FIND SOME MAGNANIMOUS NUMBERS - THOSE WHERE INSERTING '+' BETWEEN */\n /* ANY TWO OF THE DIGITS AND EVALUATING THE SUM RESULTS IN A PRIME */\n BDOS: PROCEDURE( FN, ARG ); /* CP/M BDOS SYSTEM CALL */\n DECLARE FN BYTE, ARG ADDRESS;\n GOTO 5;\n END BDOS;\n PRINT$CHAR: PROCEDURE( C ); DECLARE C BYTE; CALL BDOS( 2, C ); END;\n PRINT$STRING: PROCEDURE( S ); DECLARE S ADDRESS; CALL BDOS( 9, S ); END;\n PRINT$NL: PROCEDURE; CALL PRINT$STRING( .( 0DH, 0AH, '$' ) ); END;\n PRINT$NUMBER: PROCEDURE( N );\n DECLARE N ADDRESS;\n DECLARE V ADDRESS, N$STR( 6 ) BYTE, W BYTE;\n V = N;\n W = LAST( N$STR );\n N$STR( W ) = '$';\n N$STR( W := W - 1 ) = '0' + ( V MOD 10 );\n DO WHILE( ( V := V / 10 ) > 0 );\n N$STR( W := W - 1 ) = '0' + ( V MOD 10 );\n END;\n IF N < 100 THEN DO;\n IF N < 10 THEN CALL PRINT$CHAR( ' ' );\n CALL PRINT$CHAR( ' ' );\n END;\n CALL PRINT$STRING( .N$STR( W ) );\n END PRINT$NUMBER;\n /* INTEGER SQUARE ROOT: BASED ON THE ONE IN THE PL/M FROBENIUS NUMBERS */\n SQRT: PROCEDURE( N )ADDRESS;\n DECLARE ( N, X0, X1 ) ADDRESS;\n IF N <= 3 THEN DO;\n IF N = 0 THEN X0 = 0; ELSE X0 = 1;\n END;\n ELSE DO;\n X0 = SHR( N, 1 );\n DO WHILE( ( X1 := SHR( X0 + ( N / X0 ), 1 ) ) < X0 );\n X0 = X1;\n END;\n END;\n RETURN X0;\n END SQRT;\n\n DECLARE MAGNANIMOUS (251)ADDRESS; /* MAGNANIMOUS NUMBERS */\n DECLARE FALSE LITERALLY '0';\n DECLARE TRUE LITERALLY '0FFH';\n /* TO FIND MAGNANIMOUS NUMBERS UP TO 30$000, WE NEED TO FIND PRIMES */\n /* UP TO 9$999 + 9 = 10$008 */\n DECLARE MAX$PRIME LITERALLY '10$008';\n DECLARE DCL$PRIME LITERALLY '10$009';\n /* SIEVE THE PRIMES TO MAX$PRIME */\n DECLARE ( I, S ) ADDRESS;\n DECLARE PRIME ( DCL$PRIME )BYTE;\n PRIME( 1 ) = FALSE; PRIME( 2 ) = TRUE;\n DO I = 3 TO LAST( PRIME ) BY 2; PRIME( I ) = TRUE; END;\n DO I = 4 TO LAST( PRIME ) BY 2; PRIME( I ) = FALSE; END;\n DO I = 3 TO SQRT( MAX$PRIME );\n IF PRIME( I ) THEN DO;\n DO S = I * I TO LAST( PRIME ) BY I + I;PRIME( S ) = FALSE; END;\n END;\n END;\n\n /* FIND THE MAGNANIMOUS NUMBERS */\n FIND$MAGNANIMOUS: PROCEDURE;\n DECLARE ( D1, D2, D3, D4, D5\n , D12, D123, D1234\n , D23, D234, D2345\n , D34, D345, D45\n ) ADDRESS;\n DECLARE M$COUNT ADDRESS; /* COUNT OF MAGNANIMOUS NUMBERS FOUND */\n STORE$MAGNANIMOUS: PROCEDURE( N )BYTE;\n DECLARE N ADDRESS;\n M$COUNT = M$COUNT + 1;\n IF M$COUNT <= LAST( MAGNANIMOUS ) THEN MAGNANIMOUS( M$COUNT ) = N;\n RETURN M$COUNT <= LAST( MAGNANIMOUS );\n END STORE$MAGNANIMOUS;\n\n M$COUNT = 0;\n /* 1 DIGIT MAGNANIMOUS NUMBERS */\n DO D1 = 0 TO 9; IF NOT STORE$MAGNANIMOUS( D1 ) THEN RETURN; END;\n /* 2 DIGIT MAGNANIMOUS NUMBERS */\n DO D1 = 1 TO 9;\n DO D2 = 0 TO 9;\n IF PRIME( D1 + D2 ) THEN DO;\n IF NOT STORE$MAGNANIMOUS( ( D1 * 10 ) + D2 ) THEN RETURN;\n END;\n END;\n END;\n /* 3 DIGIT MAGNANIMOUS NUMBERS */\n DO D1 = 1 TO 9;\n DO D23 = 0 TO 99;\n IF PRIME( D1 + D23 ) THEN DO;\n D3 = D23 MOD 10;\n D12 = ( D1 * 10 ) + ( D23 / 10 );\n IF PRIME( D12 + D3 ) THEN DO;\n IF NOT STORE$MAGNANIMOUS( ( D12 * 10 ) + D3 ) THEN RETURN;\n END;\n END;\n END;\n END;\n /* 4 DIGIT MAGNANIMOUS NUMBERS */\n DO D12 = 10 TO 99;\n DO D34 = 0 TO 99;\n IF PRIME( D12 + D34 ) THEN DO;\n D123 = ( D12 * 10 ) + ( D34 / 10 );\n D4 = D34 MOD 10;\n IF PRIME( D123 + D4 ) THEN DO;\n D1 = D12 / 10;\n D234 = ( ( D12 MOD 10 ) * 100 ) + D34;\n IF PRIME( D1 + D234 ) THEN DO;\n IF NOT STORE$MAGNANIMOUS( ( D12 * 100 ) + D34 )\n THEN RETURN;\n END;\n END;\n END;\n END;\n END;\n /* 5 DIGIT MAGNANIMOUS NUMBERS UP TO 30$000 */\n DO D12 = 10 TO 30;\n DO D345 = 0 TO 999;\n IF PRIME( D12 + D345 ) THEN DO;\n D123 = ( D12 * 10 ) + ( D345 / 100 );\n D45 = D345 MOD 100;\n IF PRIME( D123 + D45 ) THEN DO;\n D1234 = ( D123 * 10 ) + ( D45 / 10 );\n D5 = D45 MOD 10;\n IF PRIME( D1234 + D5 ) THEN DO;\n D1 = D12 / 10;\n D2345 = ( ( D12 MOD 10 ) * 1000 ) + D345;\n IF PRIME( D1 + D2345 ) THEN DO;\n IF NOT STORE$MAGNANIMOUS( ( D12 * 1000 ) + D345 )\n THEN RETURN;\n END;\n END;\n END;\n END;\n END;\n END;\n END FIND$MAGNANIMOUS ;\n\n CALL FIND$MAGNANIMOUS;\n DO I = 1 TO LAST( MAGNANIMOUS );\n IF I = 1 THEN DO;\n CALL PRINT$STRING( .'MAGNANIMOUS NUMBERS 1-45:$' ); CALL PRINT$NL;\n CALL PRINT$NUMBER( MAGNANIMOUS( I ) );\n END;\n ELSE IF I < 46 THEN DO;\n IF I MOD 15 = 1 THEN CALL PRINT$NL; ELSE CALL PRINT$CHAR( ' ' );\n CALL PRINT$NUMBER( MAGNANIMOUS( I ) );\n END;\n ELSE IF I = 241 THEN DO;\n CALL PRINT$NL;\n CALL PRINT$STRING( .'MAGANIMOUS NUMBERS 241-250:$' ); CALL PRINT$NL;\n CALL PRINT$NUMBER( MAGNANIMOUS( I ) );\n END;\n ELSE IF I > 241 AND I <= 250 THEN DO;\n CALL PRINT$CHAR( ' ' );\n CALL PRINT$NUMBER( MAGNANIMOUS( I ) );\n END;\n END;\n CALL PRINT$NL;\nEOF\n","language":"PL-M"},{"code":"\"\"\" rosettacode.orgwiki/Magnanimous_numbers \"\"\"\n\nfrom sympy import isprime\n\n\ndef is_magnanimous(num):\n \"\"\" True is num is a magnanimous number \"\"\"\n if num < 10:\n return True\n for i in range(1, len(str(num))):\n quo, rem = divmod(num, 10**i)\n if not isprime(quo + rem):\n return False\n return True\n\n\nif __name__ == '__main__':\n\n K, MCOUNT = 0, 0\n print('First 45 magnanimous numbers:')\n while MCOUNT < 400:\n if is_magnanimous(K):\n if MCOUNT < 45:\n print(f'{K:4d}', end='\\n' if (MCOUNT + 1) % 15 == 0 else '')\n elif MCOUNT == 239:\n print('\\n241st through 250th magnanimous numbers:')\n elif 239 < MCOUNT < 250:\n print(f'{K:6d}', end='')\n elif MCOUNT == 389:\n print('\\n\\n391st through 400th magnanimous numbers:')\n elif 389 < MCOUNT < 400:\n print(f'{K:7d}', end='')\n MCOUNT += 1\n K += 1\n","language":"Python"},{"code":" [ 10\n [ 2dup /mod\n over 0 = iff\n [ 2drop true ]\n done\n + isprime not iff\n false done\n 10 * again ]\n unrot 2drop ] is magnanimous ( n --> b )\n\n [] 0\n [ dup magnanimous\n if [ tuck join swap ]\n 1+\n over size 250 =\n until ]\n drop\n say \"First 45 magnanimous numbers:\" cr\n 45 split swap echo cr cr\n say \"Magnanimous numbers 241-250:\" cr\n -10 split echo cr cr\n drop\n","language":"Quackery"},{"code":"my @magnanimous = lazy flat ^10, (10 .. 1001).map( {\n my int $last;\n (1 ..^ .chars).map: -> \\c { $last = 1 and last unless (.substr(0,c) + .substr(c)).is-prime }\n next if $last;\n $_\n} ),\n\n(1002 .. ∞).map: {\n # optimization for numbers > 1001; First and last digit can not both be even or both be odd\n next if (.substr(0,1) + .substr(*-1)) %% 2;\n my int $last;\n (1 ..^ .chars).map: -> \\c { $last = 1 and last unless (.substr(0,c) + .substr(c)).is-prime }\n next if $last;\n $_\n}\n\nput 'First 45 magnanimous numbers';\nput @magnanimous[^45]».fmt('%3d').batch(15).join: \"\\n\";\n\nput \"\\n241st through 250th magnanimous numbers\";\nput @magnanimous[240..249];\n\nput \"\\n391st through 400th magnanimous numbers\";\nput @magnanimous[390..399];\n","language":"Raku"},{"code":"/*REXX pgm finds/displays magnanimous #s (#s with a inserted + sign to sum to a prime).*/\nparse arg bet.1 bet.2 bet.3 highP . /*obtain optional arguments from the CL*/\nif bet.1=='' | bet.1==\",\" then bet.1= 1..45 /* \" \" \" \" \" \" */\nif bet.2=='' | bet.2==\",\" then bet.2= 241..250 /* \" \" \" \" \" \" */\nif bet.3=='' | bet.3==\",\" then bet.3= 391..400 /* \" \" \" \" \" \" */\nif highP=='' | highP==\",\" then highP= 1000000 /* \" \" \" \" \" \" */\ncall genP /*gen primes up to highP (1 million).*/\n\n do j=1 for 3 /*process three magnanimous \"ranges\". */\n parse var bet.j LO '..' HI /*obtain the first range (if any). */\n if HI=='' then HI= LO /*Just a single number? Then use LO. */\n if HI==0 then iterate /*Is HI a zero? Then skip this range.*/\n finds= 0; $= /*#: magnanimous # cnt; $: is a list*/\n do k=0 until finds==HI /* [↓] traipse through the number(s). */\n if \\magna(k) then iterate /*Not magnanimous? Then skip this num.*/\n finds= finds + 1 /*bump the magnanimous number count. */\n if finds>=LO then $= $ k /*In range► Then add number ──► $ list*/\n end /*k*/\n say\n say center(' 'LO \"──►\" HI 'magnanimous numbers ', 126, \"─\")\n say strip($)\n end /*j*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nmagna: procedure expose @. !.; parse arg x 1 L 2 '' -1 R /*obtain #, 1st & last digit.*/\n len= length(x); if len==1 then return 1 /*one digit #s are magnanimous*/\n if x>1001 then if L//2 == R//2 then return 0 /*Has parity? Not magnanimous*/\n do s= 1 for len-1 /*traipse thru #, inserting + */\n parse var x y +(s) z; sum= y + z /*parse 2 parts of #, sum 'em.*/\n if !.sum then iterate /*Is sum prime? So far so good*/\n else return 0 /*Nope? Then not magnanimous.*/\n end /*s*/\n return 1 /*Pass all the tests, it's magnanimous.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngenP: @.1=2; @.2=3; @.3=5; @.4=7; @.5=11; @.6=13 /*assign low primes; # primes.*/\n !.= 0; !.2=1; !.3=1; !.5=1; !.7=1; !.11=1; !.13=1 /* \" semaphores to \" */\n #= 6; sq.#= @.# ** 2 /*# primes so far; P squared.*/\n do j=@.#+4 by 2 to highP; parse var j '' -1 _; if _==5 then iterate /*÷ by 5?*/\n if j// 3==0 then iterate; if j// 7==0 then iterate /*÷ by 3?; ÷ by 7?*/\n if j//11==0 then iterate /*\" \" 11? \" \" 13?*/\n do k=6 while sq.k<=j /*divide by some generated odd primes. */\n if j//@.k==0 then iterate j /*Is J divisible by P? Then not prime*/\n end /*k*/ /* [↓] a prime (J) has been found. */\n #= #+1; @.#= j; sq.#= j*j; !.j= 1 /*bump #Ps; P──►@.assign P; P^2; P flag*/\n end /*j*/; return\n","language":"REXX"},{"code":"load \"stdlib.ring\"\nn = -1\nsum = 0\nmagn = []\n\nwhile sum < 45\n n = n + 1\n if n < 10\n add(magn,n)\n sum = sum + 1\n else\n nStr = string(n)\n check = 0\n for m = 1 to len(nStr)-1\n nr1 = number(left(nStr,m))\n nr2 = number(right(nStr,len(nStr)-m))\n nr3 = nr1 + nr2\n if not isprime(nr3)\n check = 1\n ok\n next\n if check = 0\n add(magn,n)\n sum = sum + 1\n ok\n ok\nend\n\nsee \"Magnanimous numbers 1-45:\" + nl\nshowArray(magn)\n\nn = -1\nsum = 0\nmagn = []\n\nwhile sum < 250\n n = n + 1\n if n < 10\n sum = sum + 1\n else\n nStr = string(n)\n check = 0\n for m = 1 to len(nStr)-1\n nr1 = number(left(nStr,m))\n nr2 = number(right(nStr,len(nStr)-m))\n nr3 = nr1 + nr2\n if not isprime(nr3)\n check = 1\n ok\n next\n if check = 0\n sum = sum + 1\n ok\n if check = 0 and sum > 240 and sum < 251\n add(magn,n)\n ok\n ok\nend\n\nsee nl\nsee \"Magnanimous numbers 241-250:\" + nl\nshowArray(magn)\n\nfunc showArray array\n txt = \"\"\n see \"[\"\n for n = 1 to len(array)\n txt = txt + array[n] + \",\"\n next\n txt = left(txt,len(txt)-1)\n txt = txt + \"]\"\n see txt\n","language":"Ring"},{"code":"require \"prime\"\n\nmagnanimouses = Enumerator.new do |y|\n (0..).each {|n| y << n if (1..n.digits.size-1).all? {|k| n.divmod(10**k).sum.prime?} }\nend\n\nputs \"First 45 magnanimous numbers:\"\nputs magnanimouses.first(45).join(' ')\n\nputs \"\\n241st through 250th magnanimous numbers:\"\nputs magnanimouses.first(250).last(10).join(' ')\n\nputs \"\\n391st through 400th magnanimous numbers:\"\nputs magnanimouses.first(400).last(10).join(' ')\n","language":"Ruby"},{"code":"fn is_prime(n: u32) -> bool {\n if n < 2 {\n return false;\n }\n if n % 2 == 0 {\n return n == 2;\n }\n if n % 3 == 0 {\n return n == 3;\n }\n let mut p = 5;\n while p * p <= n {\n if n % p == 0 {\n return false;\n }\n p += 2;\n if n % p == 0 {\n return false;\n }\n p += 4;\n }\n true\n}\n\nfn is_magnanimous(n: u32) -> bool {\n let mut p: u32 = 10;\n while n >= p {\n if !is_prime(n % p + n / p) {\n return false;\n }\n p *= 10;\n }\n true\n}\n\nfn main() {\n let mut m = (0..).filter(|x| is_magnanimous(*x)).take(400);\n println!(\"First 45 magnanimous numbers:\");\n for (i, n) in m.by_ref().take(45).enumerate() {\n if i > 0 && i % 15 == 0 {\n println!();\n }\n print!(\"{:3} \", n);\n }\n println!(\"\\n\\n241st through 250th magnanimous numbers:\");\n for n in m.by_ref().skip(195).take(10) {\n print!(\"{} \", n);\n }\n println!(\"\\n\\n391st through 400th magnanimous numbers:\");\n for n in m.by_ref().skip(140) {\n print!(\"{} \", n);\n }\n println!();\n}\n","language":"Rust"},{"code":"program magnanimous;\n n := -1;\n loop for i in [1..400] do\n loop until magnanimous(n) do n +:= 1; end loop;\n\n case i of\n (1): print(\"1 - 45:\");\n (241): print; print(\"241 - 250:\");\n (391): print; print(\"391 - 400:\");\n end case;\n\n if i in [1..45] or i in [241..250] or i in [391..400] then\n putchar(lpad(str n, 7));\n if i mod 5 = 0 then print; end if;\n end if;\n end loop;\n\n proc magnanimous(n);\n return forall k in splitsums(n) | prime(k);\n end proc;\n\n proc splitsums(n);\n s := str n;\n return [val s(..i) + val s(i+1..) : i in [1..#s-1]];\n end proc;\n\n proc prime(n);\n if n<2 then return false;\n elseif even n then return(n = 2);\n elseif n mod 3=0 then return(n = 3);\n else\n d := 5;\n loop while d*d <= n do\n if n mod d=0 then return false; end if;\n d +:= 2;\n if n mod d=0 then return false; end if;\n d +:= 4;\n end loop;\n return true;\n end if;\n end proc;\nend program;\n","language":"SETL"},{"code":"func is_magnanimous(n) {\n 1..n.ilog10 -> all {|k|\n sum(divmod(n, k.ipow10)).is_prime\n }\n}\n\nsay \"First 45 magnanimous numbers:\"\nsay is_magnanimous.first(45).join(' ')\n\nsay \"\\n241st through 250th magnanimous numbers:\"\nsay is_magnanimous.first(250).last(10).join(' ')\n\nsay \"\\n391st through 400th magnanimous numbers:\"\nsay is_magnanimous.first(400).last(10).join(' ')\n","language":"Sidef"},{"code":"import Foundation\n\nfunc isPrime(_ n: Int) -> Bool {\n if n < 2 {\n return false\n }\n if n % 2 == 0 {\n return n == 2\n }\n if n % 3 == 0 {\n return n == 3\n }\n var p = 5\n while p * p <= n {\n if n % p == 0 {\n return false\n }\n p += 2\n if n % p == 0 {\n return false\n }\n p += 4\n }\n return true\n}\n\nfunc isMagnanimous(_ n: Int) -> Bool {\n var p = 10;\n while n >= p {\n if !isPrime(n % p + n / p) {\n return false\n }\n p *= 10\n }\n return true\n}\n\nlet m = (0...).lazy.filter{isMagnanimous($0)}.prefix(400);\nprint(\"First 45 magnanimous numbers:\");\nfor (i, n) in m.prefix(45).enumerated() {\n if i > 0 && i % 15 == 0 {\n print()\n }\n print(String(format: \"%3d\", n), terminator: \" \")\n}\nprint(\"\\n\\n241st through 250th magnanimous numbers:\");\nfor n in m.dropFirst(240).prefix(10) {\n print(n, terminator: \" \")\n}\nprint(\"\\n\\n391st through 400th magnanimous numbers:\");\nfor n in m.dropFirst(390) {\n print(n, terminator: \" \")\n}\nprint()\n","language":"Swift"},{"code":"Imports System, System.Console\n\nModule Module1\n\n Dim np As Boolean()\n\n Sub ms(ByVal lmt As Long)\n np = New Boolean(CInt(lmt)) {} : np(0) = True : np(1) = True\n Dim n As Integer = 2, j As Integer = 1 : While n < lmt\n If Not np(n) Then\n Dim k As Long = CLng(n) * n\n While k < lmt : np(CInt(k)) = True : k += n : End While\n End If : n += j : j = 2 : End While\n End Sub\n\n Function is_Mag(ByVal n As Integer) As Boolean\n Dim res, rm As Integer, p As Integer = 10\n While n >= p\n res = Math.DivRem(n, p, rm)\n If np(res + rm) Then Return False\n p = p * 10 : End While : Return True\n End Function\n\n Sub Main(ByVal args As String())\n ms(100_009) : Dim mn As String = \" magnanimous numbers:\"\n WriteLine(\"First 45{0}\", mn) : Dim l As Integer = 0, c As Integer = 0\n While c < 400 : If is_Mag(l) Then\n c += 1 : If c <= 45 OrElse (c > 240 AndAlso c <= 250) OrElse c > 390 Then Write(If(c <= 45, \"{0,4} \", \"{0,8:n0} \"), l)\n If c < 45 AndAlso c Mod 15 = 0 Then WriteLine()\n If c = 240 Then WriteLine(vbLf & vbLf & \"241st through 250th{0}\", mn)\n If c = 390 Then WriteLine(vbLf & vbLf & \"391st through 400th{0}\", mn)\n End If : l += 1 : End While\n End Sub\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"./fmt\" for Conv, Fmt\nimport \"./math\" for Int\n\nvar isMagnanimous = Fn.new { |n|\n if (n < 10) return true\n var p = 10\n while (true) {\n var q = (n/p).floor\n var r = n % p\n if (!Int.isPrime(q + r)) return false\n if (q < 10) break\n p = p * 10\n }\n return true\n}\n\nvar listMags = Fn.new { |from, thru, digs, perLine|\n if (from < 2) {\n System.print(\"\\nFirst %(thru) magnanimous numbers:\")\n } else {\n System.print(\"\\n%(Conv.ord(from)) through %(Conv.ord(thru)) magnanimous numbers:\")\n }\n var i = 0\n var c = 0\n while (c < thru) {\n if (isMagnanimous.call(i)) {\n c = c + 1\n if (c >= from) {\n System.write(Fmt.d(digs, i) + \" \")\n if (c % perLine == 0) System.print()\n }\n }\n i = i + 1\n }\n}\n\nlistMags.call(1, 45, 3, 15)\nlistMags.call(241, 250, 1, 10)\nlistMags.call(391, 400, 1, 10)\n","language":"Wren"},{"code":"func IsPrime(N); \\Return 'true' if N is prime\nint N, I;\n[if N <= 2 then return N = 2;\nif (N&1) = 0 then \\even >2\\ return false;\nfor I:= 3 to sqrt(N) do\n [if rem(N/I) = 0 then return false;\n I:= I+1;\n ];\nreturn true;\n];\n\nfunc Magnan(N); \\Return 'true' if N is a magnanimous number\nint N, M, P;\n[M:= 0; P:= 1;\nloop [N:= N/10;\n if N = 0 then return true;\n M:= P*rem(0) + M;\n P:= P*10;\n if not IsPrime(N+M) then return false;\n ];\n];\n\nint Cnt, N;\n[Cnt:= 0; N:= 0;\nText(0, \"First 45 magnanimous numbers:^m^j\");\nloop [if N < 10 or Magnan(N) then\n [Cnt:= Cnt+1;\n if Cnt <= 45 then\n [Format(4, 0);\n RlOut(0, float(N));\n if rem(Cnt/15) = 0 then CrLf(0);\n ];\n if Cnt = 241 then\n Text(0, \"^m^j241st through 250th magnanimous numbers:^m^j\");\n if Cnt >= 241 and Cnt <= 250 then\n [IntOut(0, N); ChOut(0, ^ )];\n if Cnt = 391 then\n Text(0, \"^m^j^j391st through 400th magnanimous numbers:^m^j\");\n if Cnt >= 391 and Cnt <= 400 then\n [IntOut(0, N); ChOut(0, ^ )];\n if Cnt >= 400 then quit;\n ];\n N:= N+1;\n ];\n]\n","language":"XPL0"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Magnanimous_numbers\\nnote: Prime Numbers\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"A magnanimous number is an integer where there is no place in the number where a + (plus sign) could be added between any two digits to give a non-prime sum. \\n\\n\\n;E.G.\\n\\n:* '''6425''' is a magnanimous number. '''6 + 425 == 431''' which is prime; '''64 + 25 == 89''' which is prime; '''642 + 5 == 647''' which is prime.\\n\\n:* '''3538''' is '''not''' a magnanimous number. '''3 + 538 == 541''' which is prime; '''35 + 38 == 73''' which is prime; but '''353 + 8 == 361''' which is '''not''' prime.\\n\\n\\nTraditionally the single digit numbers 0 through 9 '''are''' included as magnanimous numbers as there is no place in the number where you can add a plus between two digits at all. (Kind of weaselly but there you are...) Except for the actual value 0, leading zeros are not permitted. Internal zeros are fine though, '''1001''' -> '''1 + 001''' (prime), '''10 + 01''' (prime) '''100 + 1''' (prime).\\n\\nThere are only 571 known magnanimous numbers. It is strongly suspected, though not rigorously proved, that there are no magnanimous numbers above '''97393713331910''', the largest one known.\\n\\n\\n;Task\\n\\n:* Write a routine (procedure, function, whatever) to find '''magnanimous numbers'''. \\n\\n:* Use that function to find and display, here on this page the first '''45''' magnanimous numbers.\\n\\n:* Use that function to find and display, here on this page the '''241st''' through '''250th''' magnanimous numbers.\\n\\n:* Stretch: Use that function to find and display, here on this page the '''391st''' through '''400th''' magnanimous numbers\\n\\n\\n;See also\\n\\n;* [[oeis:A252996|OEIS:A252996 - Magnanimous numbers: numbers such that the sum obtained by inserting a \\\"+\\\" anywhere between two digits gives a prime.]]\\n\\n\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"BEGIN # find some magnanimous numbers - numbers where inserting a + between any #\\n # digits ab=nd evaluatinf the sum results in a prime in all cases #\\n # returns the first n magnanimous numbers #\\n # uses global sieve prime which must include 0 and be large enough #\\n # for all possible sub-sequences of digits #\\n OP MAGNANIMOUS = ( INT n )[]INT:\\n BEGIN\\n [ 1 : n ]INT result;\\n INT m count := 0;\\n FOR i FROM 0 WHILE m count < n DO\\n # split the number into pairs of digit seuences and check the sums of the pairs are all prime #\\n INT divisor := 1;\\n BOOL all prime := TRUE;\\n WHILE divisor *:= 10;\\n IF INT front = i OVER divisor;\\n front = 0\\n THEN FALSE\\n ELSE all prime := prime[ front + ( i MOD divisor ) ]\\n FI\\n DO SKIP OD;\\n IF all prime THEN result[ m count +:= 1 ] := i FI\\n OD;\\n result\\n END; # MAGNANIMPUS #\\n # prints part of a seuence of magnanimous numbers #\\n PROC print magnanimous = ( []INT m, INT first, INT last, STRING legend )VOID:\\n BEGIN\\n print( ( legend, \\\":\\\", newline ) );\\n FOR i FROM first TO last DO print( ( \\\" \\\", whole( m[ i ], 0 ) ) ) OD;\\n print( ( newline ) )\\n END ; # print magnanimous #\\n # we assume the first 400 magnanimous numbers will be in 0 .. 1 000 000 #\\n # so we will need a sieve of 0 up to 99 999 + 9 #\\n [ 0 : 99 999 + 9 ]BOOL prime;\\n prime[ 0 ] := prime[ 1 ] := FALSE; prime[ 2 ] := TRUE;\\n FOR i FROM 3 BY 2 TO UPB prime DO prime[ i ] := TRUE OD;\\n FOR i FROM 4 BY 2 TO UPB prime DO prime[ i ] := FALSE OD;\\n FOR i FROM 3 BY 2 TO ENTIER sqrt( UPB prime ) DO\\n IF prime[ i ] THEN FOR s FROM i * i BY i + i TO UPB prime DO prime[ s ] := FALSE OD FI\\n OD;\\n # construct the sequence of magnanimous numbers #\\n []INT m = MAGNANIMOUS 400;\\n print magnanimous( m, 1, 45, \\\"First 45 magnanimous numbers\\\" );\\n print magnanimous( m, 241, 250, \\\"Magnanimous numbers 241-250\\\" );\\n print magnanimous( m, 391, 400, \\\"Magnanimous numbers 391-400\\\" )\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin\\n % find some Magnanimous numbers - numbers where inserting a \\\"+\\\" between %\\n % any two of the digits and evaluating the sum results in a prime number %\\n % implements the sieve of Eratosthenes %\\n procedure sieve( logical array s ( * ); integer value n ) ;\\n begin\\n % start with everything flagged as prime %\\n for i := 1 until n do s( i ) := true;\\n % sieve out the non-primes %\\n s( 1 ) := false;\\n for i := 2 until truncate( sqrt( n ) ) do begin\\n if s( i ) then for p := i * i step i until n do s( p ) := false\\n end for_i ;\\n end sieve ;\\n % construct an array of magnanimous numbers using the isPrime sieve %\\n procedure findMagnanimous ( logical array magnanimous, isPrime ( * ) ) ;\\n begin\\n % 1 digit magnanimous numbers %\\n for i := 0 until 9 do magnanimous( i ) := true;\\n % initially, the other magnanimous numbers are unknown %\\n for i := 10 until MAGNANIMOUS_MAX do magnanimous( i ) := false;\\n % 2 & 3 digit magnanimous numbers %\\n for d1 := 1 until 9 do begin\\n for d2 := 0 until 9 do begin\\n if isPrime( d1 + d2 ) then magnanimous( ( d1 * 10 ) + d2 ) := true\\n end for_d2 ;\\n for d23 := 0 until 99 do begin\\n if isPrime( d1 + d23 ) then begin\\n integer d12, d3;\\n d3 := d23 rem 10;\\n d12 := ( d1 * 10 ) + ( d23 div 10 );\\n if isPrime( d12 + d3 ) then magnanimous( ( d12 * 10 ) + d3 ) := true\\n end if_isPrime_d1_plus_d23\\n end for_d23\\n end for_d1 ;\\n % 4 & 5 digit magnanimous numbers %\\n for d12 := 10 until 99 do begin\\n for d34 := 0 until 99 do begin\\n if isPrime( d12 + d34 ) then begin\\n integer d123, d4;\\n d123 := ( d12 * 10 ) + ( d34 div 10 );\\n d4 := d34 rem 10;\\n if isPrime( d123 + d4 ) then begin\\n integer d1, d234;\\n d1 := d12 div 10;\\n d234 := ( ( d12 rem 10 ) * 100 ) + d34;\\n if isPrime( d1 + d234 ) then magnanimous( ( d12 * 100 ) + d34 ) := true\\n end if_isPrime_d123_plus_d4\\n end if_isPrime_d12_plus_d34\\n end for_d34 ;\\n for d345 := 0 until 999 do begin\\n if isPrime( d12 + d345 ) then begin\\n integer d123, d45;\\n d123 := ( d12 * 10 ) + ( d345 div 100 );\\n d45 := d345 rem 100;\\n if isPrime( d123 + d45 ) then begin\\n integer d1234, d5;\\n d1234 := ( d123 * 10 ) + ( d45 div 10 );\\n d5 := d45 rem 10;\\n if isPrime( d1234 + d5 ) then begin\\n integer d1, d2345;\\n d1 := d12 div 10;\\n d2345 := ( ( d12 rem 10 ) * 1000 ) + d345;\\n if isPrime( d1 + d2345 ) then magnanimous( ( d12 * 1000 ) + d345 ) := true\\n end if_isPrime_d1234_plus_d5\\n end if_isPrime_d123_plus_d45\\n end if_isPrime_d12_plus_d345\\n end for_d234\\n end for_d12 ;\\n % find 6 digit magnanimous numbers %\\n for d123 := 100 until 999 do begin\\n for d456 := 0 until 999 do begin\\n if isPrime( d123 + d456 ) then begin\\n integer d1234, d56;\\n d1234 := ( d123 * 10 ) + ( d456 div 100 );\\n d56 := d456 rem 100;\\n if isPrime( d1234 + d56 ) then begin\\n integer d12345, d6;\\n d12345 := ( d1234 * 10 ) + ( d56 div 10 );\\n d6 := d56 rem 10;\\n if isPrime( d12345 + d6 ) then begin\\n integer d12, d3456;\\n d12 := d123 div 10;\\n d3456 := ( ( d123 rem 10 ) * 1000 ) + d456;\\n if isPrime( d12 + d3456 ) then begin\\n integer d1, d23456;\\n d1 := d12 div 10;\\n d23456 := ( ( d12 rem 10 ) * 10000 ) + d3456;\\n if isPrime( d1 + d23456 ) then magnanimous( ( d123 * 1000 ) + d456 ) := true\\n end if_isPrime_d12_plus_d3456\\n end if_isPrime_d12345_plus_d6\\n end if_isPrime_d1234_plus_d56\\n end if_isPrime_d123_plus_d456\\n end for_d456\\n end for_d123\\n end findMagnanimous ;\\n % we look for magnanimous numbers with up to 6 digits, so we need to %\\n % check for primes up to 99999 + 9 = 100008 %\\n integer PRIME_MAX, MAGNANIMOUS_MAX;\\n PRIME_MAX := 100008;\\n MAGNANIMOUS_MAX := 1000000;\\n begin\\n logical array magnanimous ( 0 :: MAGNANIMOUS_MAX );\\n logical array isPrime ( 1 :: PRIME_MAX );\\n integer mPos;\\n integer lastM;\\n sieve( isPrime, PRIME_MAX );\\n findMagnanimous( magnanimous, isPrime );\\n % show some of the magnanimous numbers %\\n lastM := mPos := 0;\\n i_w := 3; s_w := 1; % output formatting %\\n for i := 0 until MAGNANIMOUS_MAX do begin\\n if magnanimous( i ) then begin\\n mPos := mPos + 1;\\n lastM := i;\\n if mPos = 1 then begin\\n write( \\\"Magnanimous numbers 1-45:\\\" );\\n write( i )\\n end\\n else if mPos < 46 then begin\\n if mPos rem 15 = 1 then write( i )\\n else writeon( i )\\n end\\n else if mPos = 241 then begin\\n write( \\\"Magnanimous numbers 241-250:\\\" );\\n write( i )\\n end\\n else if mPos > 241 and mPos <= 250 then writeon( i )\\n else if mPos = 391 then begin\\n write( \\\"Magnanimous numbers 391-400:\\\" );\\n write( i )\\n end\\n else if mPos > 391 and mPos <= 400 then writeon( i )\\n end if_magnanimous_i\\n end for_i ;\\n i_w := 1; s_w := 0;\\n write( \\\"Last magnanimous number found: \\\", mPos, \\\" = \\\", lastM )\\n end\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"#include <basico.h>\\n\\n#proto encontrarunMagnanimouspara(_X_)\\n#synon _encontrarunMagnanimouspara siencontréunMagnanimousen\\n\\nalgoritmo\\n\\n decimales '0'\\n\\n res={}, i=0\\n iterar grupo( ++i, #(length(res)<400), \\\\\\n i, meter según ( si encontré un Magnanimous en 'i', res ))\\n\\n #(utf8(\\\"Primeros 45 números magnánimos:\\\\n\\\")), #(res[1:45])\\n #(utf8(\\\"\\\\n\\\\nNúmeros magnánimos 241 - 250:\\\\n\\\")), #(res[241:250])\\n #(utf8(\\\"\\\\n\\\\nNúmeros magnánimos 391 - 400:\\\\n\\\")), #(res[391:400]), NL\\n luego imprime esto\\n\\nterminar\\n\\nsubrutinas\\n\\nencontrar un Magnanimous para(n)\\n tn=n, d=0, i=0, pd=0\\n iterar\\n último dígito de 'tn', mover a 'd,tn'\\n cuando ' tn ' { #( pd += ( d * 10^i ) ) }\\n mientras ' #( tn && is prime(tn+pd) ); ++i '\\n\\nretornar ' #(not(tn)) '\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"# syntax: GAWK -f MAGNANIMOUS_NUMBERS.AWK\\n# converted from C\\nBEGIN {\\n magnanimous(1,45)\\n magnanimous(241,250)\\n magnanimous(391,400)\\n exit(0)\\n}\\nfunction is_magnanimous(n, p,q,r) {\\n if (n < 10) { return(1) }\\n for (p=10; ; p*=10) {\\n q = int(n/p)\\n r = n % p\\n if (!is_prime(q+r)) { return(0) }\\n if (q < 10) { break }\\n }\\n return(1)\\n}\\nfunction is_prime(n, d) {\\n d = 5\\n if (n < 2) { return(0) }\\n if (!(n % 2)) { return(n == 2) }\\n if (!(n % 3)) { return(n == 3) }\\n while (d*d <= n) {\\n if (!(n % d)) { return(0) }\\n d += 2\\n if (!(n % d)) { return(0) }\\n d += 4\\n }\\n return(1)\\n}\\nfunction magnanimous(start,stop, count,i) {\\n printf(\\\"%d-%d:\\\",start,stop)\\n for (i=0; count<stop; ++i) {\\n if (is_magnanimous(i)) {\\n if (++count >= start) {\\n printf(\\\" %d\\\",i)\\n }\\n }\\n }\\n printf(\\\"\\\\n\\\")\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"10 DEFINT A-Z\\n20 L = N : R = 0 : S = 1\\n30 IF L < 10 GOTO 140\\n40 R = R + (L MOD 10) * S\\n50 L = L \\\\ 10\\n60 S = S * 10\\n70 P = R + L\\n80 IF P = 1 GOTO 120 ELSE FOR D = 2 TO SQR(P)\\n90 IF P MOD D = 0 GOTO 120\\n100 NEXT D\\n110 GOTO 30\\n120 N = N + 1\\n130 GOTO 20\\n140 I = I + 1\\n150 IF I = 1 THEN PRINT \\\"1 - 45:\\\" ELSE IF I = 241 THEN PRINT \\\"241 - 250:\\\"\\n160 IF I <= 45 OR I > 240 THEN PRINT N,\\n170 N = N + 1\\n180 IF I < 250 GOTO 20\\n190 END\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"#include \\\"isprime.kbs\\\"\\n\\ndim magn(400)\\nn = 10\\nfor i = 0 to 9\\n\\tmagn[i] = i #all single digit ints are magnanimous by definition\\nnext i\\n\\nwhile i < 400\\n\\tn += 1\\n\\tns = string(n)\\n\\tfor j = 1 to length(ns)-1\\n\\t\\tlefty = left(ns, j)\\n\\t\\trighty = right(ns, length(ns)-j)\\n\\t\\tif not isPrime(int(lefty) + int(righty)) then continue while\\n\\tnext j\\n\\tmagn[i] = n\\n\\ti += 1\\nend while\\n\\nfor i = 0 to 44\\n\\tprint i+1, magn[i]\\nnext i\\n\\nfor i =240 to 249\\n\\tprint i+1, magn[i]\\nnext i\\n\\nfor i = 390 to 399\\n\\tprint i+1, magn[i]\\nnext i\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \" DIM Sieve% 1E5\\n Prime%=2\\n WHILE Prime%^2 < 1E5\\n FOR S%=Prime%*2 TO 1E5 STEP Prime% Sieve%?S%=1 NEXT\\n REPEAT Prime%+=1 UNTIL Sieve%?Prime%=0\\n ENDWHILE\\n Sieve%?1=1\\n\\n PRINT \\\"First 45 magnanimous numbers\\\"\\n REPEAT\\n IF M% > 9 THEN\\n FOR I%=LOGM% TO 1 STEP -1\\n IF Sieve%?((M% DIV 10^I%) + (M% MOD 10^I%)) EXIT FOR\\n NEXT\\n ENDIF\\n IF I% == 0 THEN\\n N%+=1\\n IF N% == 240 OR N% == 390 PRINT '\\\"Magnanimous numbers \\\";N% + 1 \\\"-\\\";N% + 10\\n IF N% < 46 OR (N% > 240 AND N% < 251) OR (N% > 390 AND N% < 401) PRINT;M% \\\" \\\";\\n ENDIF\\n M%+=1\\n UNTIL N% > 400\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\nlet prime(n) = valof\\n$( let d = 5\\n if n<2 resultis false\\n if n rem 2=0 resultis n=2\\n if n rem 3=0 resultis n=3\\n while d*d <= n\\n $( if n rem d=0 resultis false\\n d := d+2\\n if n rem d=0 resultis false\\n d := d+4\\n $)\\n resultis true\\n$)\\n\\nlet magnanimous(n) = valof\\n$( let left = n and right = 0 and shift = 1\\n while left >= 10\\n $( right := right + (left rem 10) * shift\\n shift := shift * 10\\n left := left / 10\\n unless prime(left + right) resultis false\\n $)\\n resultis true\\n$)\\n\\nlet start() be\\n$( let n = -1\\n for i = 1 to 250\\n $( n := n+1 repeatuntil magnanimous(n)\\n if i=1 then writes(\\\"1 - 45:*N\\\")\\n if i=241 then writes(\\\"241 - 250:*N\\\")\\n if 0<i<=45 | 240<i<=250\\n $( writed(n, 7)\\n if i rem 5=0 then wrch('*N')\\n $)\\n $)\\n$)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <string.h>\\n\\ntypedef int bool;\\ntypedef unsigned long long ull;\\n\\n#define TRUE 1\\n#define FALSE 0\\n\\n/* OK for 'small' numbers. */\\nbool is_prime(ull n) {\\n ull d;\\n if (n < 2) return FALSE;\\n if (!(n % 2)) return n == 2;\\n if (!(n % 3)) return n == 3;\\n d = 5;\\n while (d * d <= n) {\\n if (!(n % d)) return FALSE;\\n d += 2;\\n if (!(n % d)) return FALSE;\\n d += 4;\\n }\\n return TRUE;\\n}\\n\\nvoid ord(char *res, int n) {\\n char suffix[3];\\n int m = n % 100;\\n if (m >= 4 && m <= 20) {\\n sprintf(res,\\\"%dth\\\", n);\\n return;\\n }\\n switch(m % 10) {\\n case 1:\\n strcpy(suffix, \\\"st\\\");\\n break;\\n case 2:\\n strcpy(suffix, \\\"nd\\\");\\n break;\\n case 3:\\n strcpy(suffix, \\\"rd\\\");\\n break;\\n default:\\n strcpy(suffix, \\\"th\\\");\\n break;\\n }\\n sprintf(res, \\\"%d%s\\\", n, suffix);\\n}\\n\\nbool is_magnanimous(ull n) {\\n ull p, q, r;\\n if (n < 10) return TRUE;\\n for (p = 10; ; p *= 10) {\\n q = n / p;\\n r = n % p;\\n if (!is_prime(q + r)) return FALSE;\\n if (q < 10) break;\\n }\\n return TRUE;\\n}\\n\\nvoid list_mags(int from, int thru, int digs, int per_line) {\\n ull i = 0;\\n int c = 0;\\n char res1[13], res2[13];\\n if (from < 2) {\\n printf(\\\"\\\\nFirst %d magnanimous numbers:\\\\n\\\", thru);\\n } else {\\n ord(res1, from);\\n ord(res2, thru);\\n printf(\\\"\\\\n%s through %s magnanimous numbers:\\\\n\\\", res1, res2);\\n }\\n for ( ; c < thru; ++i) {\\n if (is_magnanimous(i)) {\\n if (++c >= from) {\\n printf(\\\"%*llu \\\", digs, i);\\n if (!(c % per_line)) printf(\\\"\\\\n\\\");\\n }\\n }\\n }\\n}\\n\\nint main() {\\n list_mags(1, 45, 3, 15);\\n list_mags(241, 250, 1, 10);\\n list_mags(391, 400, 1, 10);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iomanip>\\n#include <iostream>\\n\\nbool is_prime(unsigned int n) {\\n if (n < 2)\\n return false;\\n if (n % 2 == 0)\\n return n == 2;\\n if (n % 3 == 0)\\n return n == 3;\\n for (unsigned int p = 5; p * p <= n; p += 4) {\\n if (n % p == 0)\\n return false;\\n p += 2;\\n if (n % p == 0)\\n return false;\\n }\\n return true;\\n}\\n\\nbool is_magnanimous(unsigned int n) {\\n for (unsigned int p = 10; n >= p; p *= 10) {\\n if (!is_prime(n % p + n / p))\\n return false;\\n }\\n return true;\\n}\\n\\nint main() {\\n unsigned int count = 0, n = 0;\\n std::cout << \\\"First 45 magnanimous numbers:\\\\n\\\";\\n for (; count < 45; ++n) {\\n if (is_magnanimous(n)) {\\n if (count > 0)\\n std::cout << (count % 15 == 0 ? \\\"\\\\n\\\" : \\\", \\\");\\n std::cout << std::setw(3) << n;\\n ++count;\\n }\\n }\\n std::cout << \\\"\\\\n\\\\n241st through 250th magnanimous numbers:\\\\n\\\";\\n for (unsigned int i = 0; count < 250; ++n) {\\n if (is_magnanimous(n)) {\\n if (count++ >= 240) {\\n if (i++ > 0)\\n std::cout << \\\", \\\";\\n std::cout << n;\\n }\\n }\\n }\\n std::cout << \\\"\\\\n\\\\n391st through 400th magnanimous numbers:\\\\n\\\";\\n for (unsigned int i = 0; count < 400; ++n) {\\n if (is_magnanimous(n)) {\\n if (count++ >= 390) {\\n if (i++ > 0)\\n std::cout << \\\", \\\";\\n std::cout << n;\\n }\\n }\\n }\\n std::cout << '\\\\n';\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System; using static System.Console;\\n\\nclass Program {\\n\\n static bool[] np; // not-prime array\\n\\n static void ms(long lmt) { // populates array, a not-prime is true\\n np = new bool[lmt]; np[0] = np[1] = true;\\n for (long n = 2, j = 1; n < lmt; n += j, j = 2) if (!np[n])\\n for (long k = n * n; k < lmt; k += n) np[k] = true; }\\n\\n static bool is_Mag(long n) { long res, rem;\\n for (long p = 10; n >= p; p *= 10) {\\n res = Math.DivRem (n, p, out rem);\\n if (np[res + rem]) return false; } return true; }\\n\\n static void Main(string[] args) { ms(100_009); string mn;\\n WriteLine(\\\"First 45{0}\\\", mn = \\\" magnanimous numbers:\\\");\\n for (long l = 0, c = 0; c < 400; l++) if (is_Mag(l)) {\\n if (c++ < 45 || (c > 240 && c <= 250) || c > 390)\\n Write(c <= 45 ? \\\"{0,4} \\\" : \\\"{0,8:n0} \\\", l);\\n if (c < 45 && c % 15 == 0) WriteLine();\\n if (c == 240) WriteLine (\\\"\\\\n\\\\n241st through 250th{0}\\\", mn);\\n if (c == 390) WriteLine (\\\"\\\\n\\\\n391st through 400th{0}\\\", mn); } }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"prime = proc (n: int) returns (bool)\\n if n < 2 then return(false) end\\n if n//2 = 0 then return(n=2) end\\n if n//3 = 0 then return(n=3) end\\n d: int := 5\\n while d*d <= n do\\n if n//d = 0 then return(false) end\\n d := d+2\\n if n//d = 0 then return(false) end\\n d := d+4\\n end\\n return(true)\\nend prime\\n\\nsum_parts = iter (l: int) yields (int)\\n r: int := 0\\n s: int := 0\\n while l >= 10 do\\n r := r + (l // 10) * 10 ** s\\n s := s + 1\\n l := l / 10\\n yield(l + r)\\n end\\nend sum_parts\\n\\nmagnanimous = proc (n: int) returns (bool)\\n for s: int in sum_parts(n) do\\n if ~prime(s) then return(false) end\\n end\\n return(true)\\nend magnanimous\\n\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n n: int := 0\\n i: int := 0\\n c: int := 0\\n\\n while i <= 400 do\\n while ~magnanimous(n) do n := n+1 end\\n i := i+1\\n\\n if i=1 then stream$putl(po, \\\"1-45:\\\") c := 0\\n elseif i=241 then stream$putl(po, \\\"\\\\n241-250:\\\") c := 0\\n elseif i=391 then stream$putl(po, \\\"391-400:\\\") c := 0\\n end\\n\\n if i <= 45 cor (i > 240 cand i <= 250) cor (i > 390 cand i <= 400) then\\n stream$putright(po, int$unparse(n), 7)\\n c := c+1\\n if c = 10 then stream$putl(po, \\\"\\\") c := 0 end\\n end\\n n := n+1\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\nsub prime(n: uint32): (r: uint32) is\\n r := 0;\\n if n <= 4 or n & 1 == 0 or n % 3 == 0 then\\n if n == 2 or n == 3 then\\n r := 1;\\n end if;\\n return;\\n end if;\\n\\n var d: uint32 := 5;\\n while d*d <= n loop\\n if n % d == 0 then return; end if;\\n d := d+2;\\n if n % d == 0 then return; end if;\\n d := d+4;\\n end loop;\\n r := 1;\\nend sub;\\n\\nsub magnanimous(n: uint32): (r: uint32) is\\n r := 1;\\n var left: uint32 := n;\\n var right: uint32 := 0;\\n var shift: uint32 := 1;\\n\\n while left >= 10 loop\\n right := right + (left % 10) * shift;\\n shift := shift * 10;\\n left := left / 10;\\n if prime(left + right) == 0 then\\n r := 0;\\n break;\\n end if;\\n end loop;\\nend sub;\\n\\nvar i: uint16 := 0;\\nvar n: uint32 := 0;\\n\\nwhile i <= 400 loop\\n while magnanimous(n) == 0 loop n := n+1; end loop;\\n i := i + 1;\\n\\n if i == 1 then print(\\\"1 - 45:\\\\n\\\");\\n elseif i == 241 then print(\\\"241 - 250:\\\\n\\\");\\n elseif i == 391 then print(\\\"390 - 400:\\\\n\\\");\\n end if;\\n\\n if i<=45 or (i>240 and i<=250) or (i>390 and i<=400) then\\n print_i32(n);\\n if i % 5 == 0 then print_nl();\\n else print_char('\\\\t');\\n end if;\\n end if;\\n n := n + 1;\\nend loop;\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"function IsPrime(N: int64): boolean;\\n{Fast, optimised prime test}\\nvar I,Stop: int64;\\nbegin\\nif (N = 2) or (N=3) then Result:=true\\nelse if (n <= 1) or ((n mod 2) = 0) or ((n mod 3) = 0) then Result:= false\\nelse\\n begin\\n I:=5;\\n Stop:=Trunc(sqrt(N+0.0));\\n Result:=False;\\n while I<=Stop do\\n begin\\n if ((N mod I) = 0) or ((N mod (I + 2)) = 0) then exit;\\n Inc(I,6);\\n end;\\n Result:=True;\\n end;\\nend;\\n\\nfunction IsMagnanimous(N: Integer): boolean;\\nvar S,S1,S2: string;\\nvar I,I1,I2: integer;\\nbegin\\nResult:=True;\\nif N<10 then exit;\\nResult:=False;\\nS:=IntToStr(N);\\nfor I:=2 to Length(S) do\\n\\tbegin\\n\\tS1:=Copy(S,1,I-1);\\n\\tS2:=Copy(S,I,(Length(S)-I)+1);\\n\\tI1:=StrToInt(S1);\\n\\tI2:=StrToInt(S2);\\n\\tif not IsPrime(I1+I2) then exit;\\n\\tend;\\nResult:=True;\\nend;\\n\\nprocedure MagnanimousRange(Memo: TMemo; Start,Stop: integer);\\nvar I,MagCnt,ItemCnt: integer;\\nvar S: string;\\nbegin\\nS:='';\\nMagCnt:=0;\\nItemCnt:=0;\\nfor I:=0 to High(Integer) do\\n if IsMagnanimous(I) then\\n \\tbegin\\n \\tInc(MagCnt);\\n \\tif MagCnt>=Start then\\n \\t\\tbegin\\n \\t\\tif MagCnt>Stop then break;\\n \\t\\tS:=S+Format('%12d',[I]);\\n \\t\\tInc(ItemCnt);\\n \\t\\tif (ItemCnt mod 5)=0 then S:=S+#$0D#$0A;\\n \\t\\tend;\\n \\tend;\\nMemo.Lines.Add(S);\\nend;\\n\\nprocedure MagnanimousNumbers(Memo: TMemo);\\nbegin\\nMemo.Lines.Add('First 45 Magnanimous Numbers');\\nMagnanimousRange(Memo,0,45);\\nMemo.Lines.Add('Magnanimous Numbers 241 through 250');\\nMagnanimousRange(Memo,241,250);\\nMemo.Lines.Add('Magnanimous Numbers 391 through 400');\\nMagnanimousRange(Memo,391,400);\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"proc isprime(word n) bool:\\n word d;\\n bool prime;\\n if n<2 then false\\n elif n%2=0 then n=2\\n elif n%3=0 then n=3\\n else\\n prime := true;\\n d := 5;\\n while prime and d*d <= n do\\n if n%d=0 then prime := false fi;\\n d := d+2;\\n if n%d=0 then prime := false fi;\\n d := d+4\\n od;\\n prime\\n fi\\ncorp\\n\\nproc magnanimous(word n) bool:\\n word left, right, shift;\\n bool magn;\\n left := n;\\n right := 0;\\n shift := 1;\\n magn := true;\\n while magn and left >= 10 do\\n right := right + (left % 10) * shift;\\n shift := shift * 10;\\n left := left / 10;\\n magn := magn and isprime(left + right)\\n od;\\n magn\\ncorp\\n\\nproc main() void:\\n word n, i;\\n n := 0;\\n for i from 1 upto 250 do\\n while not magnanimous(n) do n := n+1 od;\\n if i=1 then writeln(\\\"1 - 45:\\\") fi;\\n if i=241 then writeln(\\\"241 - 250:\\\") fi;\\n if i<=45 or i>=241 then\\n write(n:7);\\n if i%5 = 0 then writeln() fi\\n fi;\\n n := n+1\\n od\\ncorp\\n\",\n \"language\": \"Draco\"\n },\n {\n \"code\": \"fastfunc isprim num .\\n if num < 2\\n return 0\\n .\\n i = 2\\n while i <= sqrt num\\n if num mod i = 0\\n return 0\\n .\\n i += 1\\n .\\n return 1\\n.\\nfunc ismagnan n .\\n if n < 10\\n return 1\\n .\\n p = 10\\n repeat\\n q = n div p\\n r = n mod p\\n if isprim (q + r) = 0\\n return 0\\n .\\n until q < 10\\n p *= 10\\n .\\n return 1\\n.\\nproc magnan start stop . .\\n write start & \\\"-\\\" & stop & \\\":\\\"\\n while count < stop\\n if ismagnan i = 1\\n count += 1\\n if count >= start\\n write \\\" \\\" & i\\n .\\n .\\n i += 1\\n .\\n print \\\"\\\"\\n.\\nmagnan 1 45\\nmagnan 241 250\\nmagnan 391 400\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"// Generate Magnanimous numbers. Nigel Galloway: March 20th., 2020\\nlet rec fN n g = match (g/n,g%n) with\\n (0,_) -> true\\n |(α,β) when isPrime (α+β) -> fN (n*10) g\\n |_ -> false\\nlet Magnanimous = let Magnanimous = fN 10 in seq{yield! {0..9}; yield! Seq.initInfinite id |> Seq.skip 10 |> Seq.filter Magnanimous}\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"Magnanimous |> Seq.take 45 |> Seq.iter (printf \\\"%d \\\"); printfn \\\"\\\"\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"Magnanimous |> Seq.skip 240 |> Seq.take 10 |> Seq.iter (printf \\\"%d \\\"); printfn \\\"\\\";;\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"Magnanimous |> Seq.skip 390 |> Seq.take 10 |> Seq.iter (printf \\\"%d \\\"); printfn \\\"\\\";;\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: grouping io kernel lists lists.lazy math math.functions\\nmath.primes math.ranges prettyprint sequences ;\\n\\n: magnanimous? ( n -- ? )\\n dup 10 < [ drop t ] [\\n dup log10 >integer [1,b] [ 10^ /mod + prime? not ] with\\n find nip >boolean not\\n ] if ;\\n\\n: magnanimous ( n -- seq )\\n 0 lfrom [ magnanimous? ] lfilter ltake list>array ;\\n\\n: show ( seq from to -- ) rot subseq 15 group simple-table. nl ;\\n\\n400 magnanimous\\n[ \\\"First 45 magnanimous numbers\\\" print 0 45 show ]\\n[ \\\"241st through 250th magnanimous numbers\\\" print 240 250 show ]\\n[ \\\"391st through 400th magnanimous numbers\\\" print 390 400 show ]\\ntri\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"#include \\\"isprime.bas\\\"\\n\\ndim as uinteger magn(0 to 399), i, n=10, j\\ndim as string ns, lefty, righty\\nfor i = 0 to 9\\n magn(i) = i 'all single digit ints are magnanimous by definition\\nnext i\\n\\nwhile i<400\\n n += 1\\n ns = str(n)\\n for j = 1 to len(ns)-1\\n lefty = left(ns, j)\\n righty = right(ns, len(ns)-j)\\n if not isprime( val(lefty) + val(righty) ) then continue while\\n next j\\n magn(i) = n\\n i+=1\\nwend\\n\\nfor i=0 to 44\\n print i+1,magn(i)\\nnext i\\n\\nfor i=240 to 249\\n print i+1,magn(i)\\nnext i\\n\\nfor i=390 to 399\\n print i+1,magn(i)\\nnext i\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\n// OK for 'small' numbers.\\nfunc isPrime(n uint64) bool {\\n switch {\\n case n < 2:\\n return false\\n case n%2 == 0:\\n return n == 2\\n case n%3 == 0:\\n return n == 3\\n default:\\n d := uint64(5)\\n for d*d <= n {\\n if n%d == 0 {\\n return false\\n }\\n d += 2\\n if n%d == 0 {\\n return false\\n }\\n d += 4\\n }\\n return true\\n }\\n}\\n\\nfunc ord(n int) string {\\n m := n % 100\\n if m >= 4 && m <= 20 {\\n return fmt.Sprintf(\\\"%dth\\\", n)\\n }\\n m %= 10\\n suffix := \\\"th\\\"\\n if m < 4 {\\n switch m {\\n case 1:\\n suffix = \\\"st\\\"\\n case 2:\\n suffix = \\\"nd\\\"\\n case 3:\\n suffix = \\\"rd\\\"\\n }\\n }\\n return fmt.Sprintf(\\\"%d%s\\\", n, suffix)\\n}\\n\\nfunc isMagnanimous(n uint64) bool {\\n if n < 10 {\\n return true\\n }\\n for p := uint64(10); ; p *= 10 {\\n q := n / p\\n r := n % p\\n if !isPrime(q + r) {\\n return false\\n }\\n if q < 10 {\\n break\\n }\\n }\\n return true\\n}\\n\\nfunc listMags(from, thru, digs, perLine int) {\\n if from < 2 {\\n fmt.Println(\\\"\\\\nFirst\\\", thru, \\\"magnanimous numbers:\\\")\\n } else {\\n fmt.Printf(\\\"\\\\n%s through %s magnanimous numbers:\\\\n\\\", ord(from), ord(thru))\\n }\\n for i, c := uint64(0), 0; c < thru; i++ {\\n if isMagnanimous(i) {\\n c++\\n if c >= from {\\n fmt.Printf(\\\"%*d \\\", digs, i)\\n if c%perLine == 0 {\\n fmt.Println()\\n }\\n }\\n }\\n }\\n}\\n\\nfunc main() {\\n listMags(1, 45, 3, 15)\\n listMags(241, 250, 1, 10)\\n listMags(391, 400, 1, 10)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"100 DEFINT A-Z\\n110 CLS\\n120 LET L = N\\n130 LET R = 0\\n140 LET S = 1\\n150 IF L < 10 THEN GOTO 300\\n160 LET R = R+(L MOD 10)*S\\n170 LET L = L\\\\10\\n180 LET S = S*10\\n190 LET P = R+L\\n200 IF P = 1 THEN GOTO 280 ELSE FOR D = 2 TO SQR(P)\\n210 IF P MOD D = 0 THEN GOTO 280\\n250 NEXT D\\n270 GOTO 150\\n280 LET N = N+1\\n290 GOTO 120\\n300 LET I = I+1\\n310 IF I = 1 THEN PRINT \\\"1 - 45:\\\" ELSE IF I = 241 THEN PRINT : PRINT \\\"241 - 250:\\\"\\n320 IF I <= 45 OR I > 240 THEN PRINT N,\\n330 LET N = N+1\\n340 IF I < 250 THEN GOTO 120\\n350 PRINT\\n360 END\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \"import Data.List.Split ( chunksOf )\\nimport Data.List ( (!!) )\\n\\nisPrime :: Int -> Bool\\nisPrime n\\n |n == 2 = True\\n |n == 1 = False\\n |otherwise = null $ filter (\\\\i -> mod n i == 0 ) [2 .. root]\\n where\\n root :: Int\\n root = floor $ sqrt $ fromIntegral n\\n\\nisMagnanimous :: Int -> Bool\\nisMagnanimous n = all isPrime $ map (\\\\p -> fst p + snd p ) numberPairs\\n where\\n str:: String\\n str = show n\\n splitStrings :: [(String , String)]\\n splitStrings = map (\\\\i -> splitAt i str) [1 .. length str - 1]\\n numberPairs :: [(Int , Int)]\\n numberPairs = map (\\\\p -> ( read $ fst p , read $ snd p )) splitStrings\\n\\nprintInWidth :: Int -> Int -> String\\nprintInWidth number width = replicate ( width - l ) ' ' ++ str\\n where\\n str :: String\\n str = show number\\n l :: Int\\n l = length str\\n\\nsolution :: [Int]\\nsolution = take 400 $ filter isMagnanimous [0 , 1 ..]\\n\\nmain :: IO ( )\\nmain = do\\n let numbers = solution\\n numberlines = chunksOf 10 $ take 45 numbers\\n putStrLn \\\"First 45 magnanimous numbers:\\\"\\n mapM_ (\\\\li -> putStrLn (foldl1 ( ++ ) $ map (\\\\n -> printInWidth n 6 )\\n li )) numberlines\\n putStrLn \\\"241'st to 250th magnanimous numbers:\\\"\\n putStr $ show ( numbers !! 240 )\\n putStrLn ( foldl1 ( ++ ) $ map(\\\\n -> printInWidth n 8 ) $ take 9 $\\n drop 241 numbers )\\n putStrLn \\\"391'st to 400th magnanimous numbers:\\\"\\n putStr $ show ( numbers !! 390 )\\n putStrLn ( foldl1 ( ++ ) $ map(\\\\n -> printInWidth n 8 ) $ drop 391 numbers)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.List;\\n\\npublic class MagnanimousNumbers {\\n\\n public static void main(String[] args) {\\n runTask(\\\"Find and display the first 45 magnanimous numbers.\\\", 1, 45);\\n runTask(\\\"241st through 250th magnanimous numbers.\\\", 241, 250);\\n runTask(\\\"391st through 400th magnanimous numbers.\\\", 391, 400);\\n }\\n\\n private static void runTask(String message, int startN, int endN) {\\n int count = 0;\\n List<Integer> nums = new ArrayList<>();\\n for ( int n = 0 ; count < endN ; n++ ) {\\n if ( isMagnanimous(n) ) {\\n nums.add(n);\\n count++;\\n }\\n }\\n System.out.printf(\\\"%s%n\\\", message);\\n System.out.printf(\\\"%s%n%n\\\", nums.subList(startN-1, endN));\\n }\\n\\n private static boolean isMagnanimous(long n) {\\n if ( n >= 0 && n <= 9 ) {\\n return true;\\n }\\n long q = 11;\\n for ( long div = 10 ; q >= 10 ; div *= 10 ) {\\n q = n / div;\\n long r = n % div;\\n if ( ! isPrime(q+r) ) {\\n return false;\\n }\\n }\\n return true;\\n }\\n\\n private static final int MAX = 100_000;\\n private static final boolean[] primes = new boolean[MAX];\\n private static boolean SIEVE_COMPLETE = false;\\n\\n private static final boolean isPrimeTrivial(long test) {\\n if ( ! SIEVE_COMPLETE ) {\\n sieve();\\n SIEVE_COMPLETE = true;\\n }\\n return primes[(int) test];\\n }\\n\\n private static final void sieve() {\\n // primes\\n for ( int i = 2 ; i < MAX ; i++ ) {\\n primes[i] = true;\\n }\\n for ( int i = 2 ; i < MAX ; i++ ) {\\n if ( primes[i] ) {\\n for ( int j = 2*i ; j < MAX ; j += i ) {\\n primes[j] = false;\\n }\\n }\\n }\\n }\\n\\n // See http://primes.utm.edu/glossary/page.php?sort=StrongPRP\\n public static final boolean isPrime(long testValue) {\\n if ( testValue == 2 ) return true;\\n if ( testValue % 2 == 0 ) return false;\\n if ( testValue <= MAX ) return isPrimeTrivial(testValue);\\n long d = testValue-1;\\n int s = 0;\\n while ( d % 2 == 0 ) {\\n s += 1;\\n d /= 2;\\n }\\n if ( testValue < 1373565L ) {\\n if ( ! aSrp(2, s, d, testValue) ) {\\n return false;\\n }\\n if ( ! aSrp(3, s, d, testValue) ) {\\n return false;\\n }\\n return true;\\n }\\n if ( testValue < 4759123141L ) {\\n if ( ! aSrp(2, s, d, testValue) ) {\\n return false;\\n }\\n if ( ! aSrp(7, s, d, testValue) ) {\\n return false;\\n }\\n if ( ! aSrp(61, s, d, testValue) ) {\\n return false;\\n }\\n return true;\\n }\\n if ( testValue < 10000000000000000L ) {\\n if ( ! aSrp(3, s, d, testValue) ) {\\n return false;\\n }\\n if ( ! aSrp(24251, s, d, testValue) ) {\\n return false;\\n }\\n return true;\\n }\\n // Try 5 \\\"random\\\" primes\\n if ( ! aSrp(37, s, d, testValue) ) {\\n return false;\\n }\\n if ( ! aSrp(47, s, d, testValue) ) {\\n return false;\\n }\\n if ( ! aSrp(61, s, d, testValue) ) {\\n return false;\\n }\\n if ( ! aSrp(73, s, d, testValue) ) {\\n return false;\\n }\\n if ( ! aSrp(83, s, d, testValue) ) {\\n return false;\\n }\\n //throw new RuntimeException(\\\"ERROR isPrime: Value too large = \\\"+testValue);\\n return true;\\n }\\n\\n private static final boolean aSrp(int a, int s, long d, long n) {\\n long modPow = modPow(a, d, n);\\n //System.out.println(\\\"a = \\\"+a+\\\", s = \\\"+s+\\\", d = \\\"+d+\\\", n = \\\"+n+\\\", modpow = \\\"+modPow);\\n if ( modPow == 1 ) {\\n return true;\\n }\\n int twoExpR = 1;\\n for ( int r = 0 ; r < s ; r++ ) {\\n if ( modPow(modPow, twoExpR, n) == n-1 ) {\\n return true;\\n }\\n twoExpR *= 2;\\n }\\n return false;\\n }\\n\\n private static final long SQRT = (long) Math.sqrt(Long.MAX_VALUE);\\n\\n public static final long modPow(long base, long exponent, long modulus) {\\n long result = 1;\\n while ( exponent > 0 ) {\\n if ( exponent % 2 == 1 ) {\\n if ( result > SQRT || base > SQRT ) {\\n result = multiply(result, base, modulus);\\n }\\n else {\\n result = (result * base) % modulus;\\n }\\n }\\n exponent >>= 1;\\n if ( base > SQRT ) {\\n base = multiply(base, base, modulus);\\n }\\n else {\\n base = (base * base) % modulus;\\n }\\n }\\n return result;\\n }\\n\\n\\n // Result is a*b % mod, without overflow.\\n public static final long multiply(long a, long b, long modulus) {\\n long x = 0;\\n long y = a % modulus;\\n long t;\\n while ( b > 0 ) {\\n if ( b % 2 == 1 ) {\\n t = x + y;\\n x = (t > modulus ? t-modulus : t);\\n }\\n t = y << 1;\\n y = (t > modulus ? t-modulus : t);\\n b >>= 1;\\n }\\n return x % modulus;\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# To take advantage of gojq's arbitrary-precision integer arithmetic:\\ndef power($b): . as $in | reduce range(0;$b) as $i (1; . * $in);\\n\\ndef divrem($x; $y):\\n [$x/$y|floor, $x % $y];\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def ismagnanimous:\\n . as $n\\n | if $n < 10 then true\\n else first(range( 1; tostring|length) as $i\\n\\t | divrem($n; (10|power($i))) as [$q, $r]\\n | if ($q + $r) | is_prime == false then 0 else empty end)\\n // true\\n | . == true\\n end;\\n\\n# An unbounded stream ...\\ndef magnanimous:\\n range(0; infinite)\\n | select(ismagnanimous);\\n\\n[limit(400; magnanimous)]\\n| \\\"First 45 magnanimous numbers:\\\", .[:45],\\n \\\"\\\\n241st through 250th magnanimous numbers:\\\", .[241:251],\\n \\\"\\\\n391st through 400th magnanimous numbers:\\\", .[391:]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Primes\\n\\nfunction ismagnanimous(n)\\n n < 10 && return true\\n for i in 1:ndigits(n)-1\\n q, r = divrem(n, 10^i)\\n !isprime(q + r) && return false\\n end\\n return true\\nend\\n\\nfunction magnanimous(N)\\n mvec, i = Int[], 0\\n while length(mvec) < N\\n if ismagnanimous(i)\\n push!(mvec, i)\\n end\\n i += 1\\n end\\n return mvec\\nend\\n\\nconst mag400 = magnanimous(400)\\nprintln(\\\"First 45 magnanimous numbers:\\\\n\\\", mag400[1:24], \\\"\\\\n\\\", mag400[25:45])\\nprintln(\\\"\\\\n241st through 250th magnanimous numbers:\\\\n\\\", mag400[241:250])\\nprintln(\\\"\\\\n391st through 400th magnanimous numbers:\\\\n\\\", mag400[391:400])\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"{def isprime\\n {def isprime.loop\\n {lambda {:n :m :i}\\n {if {> :i :m}\\n then true\\n else {if {= {% :n :i} 0}\\n then false\\n else {isprime.loop :n :m {+ :i 2}}\\n }}}}\\n {lambda {:n}\\n {if {= :n 1}\\n then false\\n else {if {or {= :n 2} {= :n 3} {= :n 5} {= :n 7}}\\n then true\\n else {if {or {< : n 2} {= {% :n 2} 0}}\\n then false\\n else {isprime.loop :n {sqrt :n} 3}\\n}}}}}\\n-> isprime\\n\\n{def magnanimous\\n {def magnanimous.loop\\n {lambda {:n :p :r}\\n {if {>= :n 10}\\n then {let { {:n {floor {/ :n 10}}}\\n {:p :p}\\n {:r {+ :r {* {% :n 10} :p}}}\\n } {if {not {isprime {+ :n :r}}}\\n then false\\n else {magnanimous.loop :n {* :p 10} :r} }\\n }\\n else true }}}\\n {lambda {:n}\\n {magnanimous.loop :n 1 0} }}\\n-> magnanimous\\n\\n{def mags\\n {lambda {:n}\\n {S.last\\n {S.map {{lambda {:a :i}\\n {if {magnanimous :i} then {A.addlast! :i :a} else}}\\n {A.new}}\\n {S.serie 0 :n}}}}}\\n-> mags\\n\\n{A.slice 0 45 {mags 110}}\\n-> [0,1,2,3,4,5,6,7,8,9,11,12,14,16,20,21,23,25,29,30,32,34,38,41,43,47,49,50,52,56,58,61,65,67,70,74,76,83,85,89,92,94,98,101,110]\\n\\n{A.slice 240 250 {mags 30000}}\\n->\\n[17992,19972,20209,20261,20861,22061,22201,22801,22885,24407]\\n\\n{A.slice 390 400 {mags 700000}}\\n->\\n[486685,488489,515116,533176,551558,559952,595592,595598,600881,602081]\\n\\ntime of CPU in milliseconds\\n iPadPro MacBookAir MacBookPro\\n[0,45] \\t 30 \\t 15 \\t 12\\n[240,250] \\t2430 \\t 5770 \\t 3650\\n[390,400] 117390 \\t 284230 \\t 213210\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"Clear[MagnanimousNumberQ]\\nMagnanimousNumberQ[Alternatives @@ Range[0, 9]] = True;\\nMagnanimousNumberQ[n_Integer] := AllTrue[Range[IntegerLength[n] - 1], PrimeQ[Total[FromDigits /@ TakeDrop[IntegerDigits[n], #]]] &]\\nsel = Select[Range[0, 1000000], MagnanimousNumberQ];\\nsel[[;; 45]]\\nsel[[241 ;; 250]]\\nsel[[391 ;; 400]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"MODULE MagnanimousNumbers;\\nFROM InOut IMPORT WriteString, WriteCard, WriteLn;\\n\\nVAR n, i: CARDINAL;\\n\\nPROCEDURE prime(n: CARDINAL): BOOLEAN;\\n VAR d: CARDINAL;\\nBEGIN\\n IF n<2 THEN RETURN FALSE END;\\n IF n MOD 2 = 0 THEN RETURN n = 2 END;\\n IF n MOD 3 = 0 THEN RETURN n = 3 END;\\n d := 5;\\n WHILE d*d <= n DO\\n IF n MOD d = 0 THEN RETURN FALSE END;\\n INC(d, 2);\\n IF n MOD d = 0 THEN RETURN FALSE END;\\n INC(d, 4)\\n END;\\n RETURN TRUE\\nEND prime;\\n\\nPROCEDURE magnanimous(n: CARDINAL): BOOLEAN;\\n VAR left, right, shift: CARDINAL;\\nBEGIN\\n left := n;\\n right := 0;\\n shift := 1;\\n WHILE left >= 10 DO\\n INC(right, (left MOD 10) * shift);\\n shift := shift * 10;\\n left := left DIV 10;\\n IF NOT prime(left + right) THEN RETURN FALSE END\\n END;\\n RETURN TRUE\\nEND magnanimous;\\n\\nBEGIN\\n n := 0;\\n FOR i := 1 TO 250 DO\\n WHILE NOT magnanimous(n) DO INC(n) END;\\n\\n IF i=1 THEN WriteString(\\\"1 - 45:\\\"); WriteLn\\n ELSIF i=240 THEN WriteString(\\\"241 - 250:\\\"); WriteLn\\n END;\\n\\n IF (i <= 45) OR (i > 240) THEN\\n WriteCard(n, 7);\\n IF i MOD 5 = 0 THEN WriteLn END\\n END;\\n INC(n)\\n END\\nEND MagnanimousNumbers.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"func isPrime(n: Natural): bool =\\n if n < 2: return\\n if n mod 2 == 0: return n == 2\\n if n mod 3 == 0: return n == 3\\n var d = 5\\n while d * d <= n:\\n if n mod d == 0: return false\\n inc d, 2\\n if n mod d == 0: return false\\n inc d, 4\\n return true\\n\\n\\nfunc isMagnanimous(n: Natural): bool =\\n var p = 10\\n while true:\\n let a = n div p\\n let b = n mod p\\n if a == 0: break\\n if not isPrime(a + b): return false\\n p *= 10\\n return true\\n\\n\\niterator magnanimous(): (int, int) =\\n var n, count = 0\\n while true:\\n if n.isMagnanimous:\\n inc count\\n yield (count, n)\\n inc n\\n\\n\\nfor (i, n) in magnanimous():\\n if i in 1..45:\\n if i == 1: stdout.write \\\"First 45 magnanimous numbers:\\\\n \\\"\\n stdout.write n, if i == 45: '\\\\n' else: ' '\\n\\n elif i in 241..250:\\n if i == 241: stdout.write \\\"\\\\n241st through 250th magnanimous numbers:\\\\n \\\"\\n stdout.write n, if i == 250: \\\"\\\\n\\\" else: \\\" \\\"\\n\\n elif i in 391..400:\\n if i == 391: stdout.write \\\"\\\\n391st through 400th magnanimous numbers:\\\\n \\\"\\n stdout.write n, if i == 400: \\\"\\\\n\\\" else: \\\" \\\"\\n\\n elif i > 400:\\n break\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"program Magnanimous;\\n//Magnanimous Numbers\\n//algorithm find only numbers where all digits are even except the last\\n//or where all digits are odd except the last\\n//so 1,11,20,101,1001 will not be found\\n//starting at 100001 \\\"1>\\\"+x\\\"0\\\"+\\\"1\\\" is not prime because of 1001 not prime\\n{$IFDEF FPC}\\n {$MODE DELPHI}\\n {$Optimization ON}\\n {$CODEALIGN proc=16}\\n{$ELSE}\\n {$APPTYPE CONSOLE}\\n{$ENDIF}\\n{$DEFINE USE_GMP}\\nuses\\n //strUtils, // commatize Numb2USA\\n {$IFDEF USE_GMP}gmp,{$ENDIF}\\n SysUtils;\\nconst\\n MaxLimit = 10*1000*1000 +10;\\n MAXHIGHIDX = 10;\\ntype\\n tprimes = array of byte;\\n tBaseType = Byte;\\n tpBaseType = pByte;\\n tBase =array[0..15] of tBaseType;\\n tNumType = NativeUint;\\n tSplitNum = array[0..15] of tNumType;\\n tMagList = array[0..1023] of Uint64;\\nvar\\n {$ALIGN 32}\\n MagList : tMagList;\\n\\n dgtBase5, // count in Base 5\\n dgtORMask, //Mark of used digit (or (1 shl Digit ))\\n dgtEvenBase10,\\n dgtOddBase10: tbase;\\n\\n primes : tprimes;\\n {$IFDEF USE_GMP} z : mpz_t;gmp_count :NativeUint;{$ENDIF}\\n pPrimes0 : pByte;\\n T0: int64;\\n HighIdx,num,MagIdx,count,cnt: NativeUint;\\n\\n procedure InitPrimes;\\n const\\n smallprimes :array[0..5] of byte = (2,3,5,7,11,13);\\n var\\n pPrimes : pByte;\\n p,i,j,l : NativeUint;\\n begin\\n l := 1;\\n for j := 0 to High(smallprimes) do\\n l*= smallprimes[j];\\n //scale primelimit to be multiple of l\\n i :=((MaxLimit-1) DIV l+1)*l+1;//+1 should suffice\\n setlength(primes,i);\\n pPrimes := @primes[0];\\n\\n for j := 0 to High(smallprimes) do\\n begin\\n p := smallprimes[j];\\n i := p;\\n if j <> 0 then\\n p +=p;\\n while i <= l do\\n begin\\n pPrimes[i] := 1;\\n inc(i,p)\\n end;\\n end;\\n //turn the prime wheel\\n for p := length(primes) div l -1 downto 1 do\\n move(pPrimes[1],pPrimes[p*l+1],l);\\n\\n l := High(primes);\\n //reinsert smallprimes\\n for j := 0 to High(smallprimes) do\\n pPrimes[smallprimes[j]] := 0;\\n pPrimes[1]:=1;\\n pPrimes[0]:=1;\\n\\n p := smallprimes[High(smallprimes)];\\n repeat\\n repeat\\n inc(p)\\n until pPrimes[p] = 0;\\n j := l div p;\\n while (pPrimes[j]<> 0) AND (j>=p) do\\n dec(j);\\n if j<p then\\n BREAK;\\n //delta going downwards no factor 2,3 :-2 -4 -2 -4\\n i := (j+1) mod 6;\\n if i = 0 then\\n i :=4;\\n repeat\\n while (pPrimes[j]<> 0) AND (j>=p) do\\n begin\\n dec(j,i);\\n i := 6-i;\\n end;\\n if j<p then\\n BREAK;\\n pPrimes[j*p] := 1;\\n dec(j,i);\\n i := 6-i;\\n until j<p;\\n until false;\\n\\n pPrimes0 := pPrimes;\\n end;\\n\\n procedure InsertSort(pMag:pUint64; Left, Right : NativeInt );\\n var\\n I, J: NativeInt;\\n Pivot : Uint64;\\n begin\\n for i:= 1 + Left to Right do\\n begin\\n Pivot:= pMag[i];\\n j:= i - 1;\\n while (j >= Left) and (pMag[j] > Pivot) do\\n begin\\n pMag[j+1]:=pMag[j];\\n Dec(j);\\n end;\\n pMag[j+1]:= pivot;\\n end;\\n end;\\n\\n procedure OutBase5;\\n var\\n pb: tpBaseType;\\n i : NativeUint;\\n begin\\n write(count :10);\\n pb:= @dgtBase5[0];\\n for i := HighIdx downto 0 do\\n write(pb[i]:3);\\n write(' : ' );\\n pb:= @dgtORMask[0];\\n for i := HighIdx downto 0 do\\n write(pb[i]:3);\\n end;\\n\\n function Base10toNum(var dgtBase10: tBase):NativeUint;\\n var\\n i : NativeInt;\\n begin\\n Result := 0;\\n for i := HighIdx downto 0 do\\n Result := Result * 10 + dgtBase10[i];\\n end;\\n\\n procedure OutSol(cnt:Uint64);\\n begin\\n writeln(MagIdx:4,cnt:13,Base10toNum(dgtOddBase10):20,\\n (Gettickcount64-T0) / 1000: 10: 3, ' s');\\n end;\\n\\n procedure CnvEvenBase10(lastIdx:NativeInt);\\n var\\n pdgt : tpBaseType;\\n idx: nativeint;\\n begin\\n pDgt := @dgtEvenBase10[0];\\n for idx := lastIdx downto 1 do\\n pDgt[idx] := 2 * dgtBase5[idx];\\n pDgt[0] := 2 * dgtBase5[0]+1;\\n end;\\n\\n procedure CnvOddBase10(lastIdx:NativeInt);\\n var\\n pdgt : tpBaseType;\\n idx: nativeint;\\n begin\\n pDgt := @dgtOddBase10[0];\\n //make all odd\\n for idx := lastIdx downto 1 do\\n pDgt[idx] := 2 * dgtBase5[idx] + 1;\\n //but the lowest even\\n pDgt[0] := 2 * dgtBase5[0];\\n end;\\n\\n function IncDgtBase5:NativeUint;\\n // increment n base 5 until resulting sum of split number\\n // can't end in 5\\n var\\n pb: tpBaseType;\\n n,i: nativeint;\\n begin\\n result := 0;\\n repeat\\n repeat\\n //increment Base5\\n pb:= @dgtBase5[0];\\n i := 0;\\n repeat\\n n := pb[i] + 1;\\n if n < 5 then\\n begin\\n pb[i] := n;\\n break;\\n end;\\n pb[i] := 0;\\n Inc(i);\\n until False;\\n\\n if HighIdx < i then\\n begin\\n HighIdx := i;\\n pb[i] := 0;\\n end;\\n\\n if result < i then\\n result := i;\\n\\n n := dgtORMask[i+1];\\n while i >= 0 do\\n begin\\n n := n OR (1 shl pb[i]);\\n dgtORMask[i]:= n;\\n if n = 31 then\\n break;\\n dec(i);\\n end;\\n\\n if HighIdx<4 then\\n break;\\n\\n if (n <> 31) OR (i=0) then\\n break;\\n //Now there are all digits are used at digit i ( not in last pos)\\n //this will always lead to a number ending in 5-> not prime\\n //so going on with a number that will change the used below i to highest digit\\n //to create an overflow of the next number, to change the digits\\n dec(i);\\n repeat\\n pb[i] := 4;\\n dgtORMask[i]:= 31;\\n dec(i);\\n until i < 0;\\n\\n until false;\\n if HighIdx<4 then\\n break;\\n\\n n := dgtORMask[1];\\n //ending in 5. base10(base5) for odd 1+4(0,2),3+2(1,1),5+0(2,0)\\n i := pb[0];\\n if i <= 2 then\\n begin\\n i := 1 shl (2-i);\\n end\\n else\\n Begin\\n //ending in 5 7+8(3,4),9+6(4,3)\\n i := 1 shl (4-i);\\n n := n shr 3;\\n end;\\n if (i AND n) = 0 then\\n BREAK;\\n until false;\\n end;\\n\\n procedure CheckMagn(var dgtBase10: tBase);\\n //split number into sum of all \\\"partitions\\\" of digits\\n //check if sum is always prime\\n //1234 -> 1+234,12+34 ;123+4\\n var\\n LowSplitNum : tSplitNum;\\n i,fac,n: NativeInt;\\n isMagn : boolean;\\n Begin\\n n := 0;\\n fac := 1;\\n For i := 0 to HighIdx-1 do\\n begin\\n n := fac*dgtBase10[i]+n;\\n fac *=10;\\n LowSplitNum[HighIdx-1-i] := n;\\n end;\\n\\n n := 0;\\n fac := HighIdx;\\n isMagn := true;\\n\\n For i := 0 to fac-1 do\\n begin\\n //n = HighSplitNum[i]\\n n := n*10+dgtBase10[fac-i];\\n LowSplitNum[i] += n;\\n if LowSplitNum[i]<=MAXLIMIT then\\n begin\\n isMagn := isMagn AND (pPrimes0[LowSplitNum[i]] = 0);\\n if NOT(isMagn) then\\n EXIT;\\n end;\\n end;\\n {$IFDEF USE_GMP}\\n For i := 0 to fac-1 do\\n begin\\n n := LowSplitNum[i];\\n if n >MAXLIMIT then\\n Begin\\n// IF NOT((n mod 30) in [1,7,11,13,17,19,23,29]) then EXIT;\\n mpz_set_ui(z,n);\\n gmp_count +=1;\\n isMagn := isMagn AND (mpz_probab_prime_p(z,1) >0);\\n if NOT(isMagn) then\\n EXIT;\\n end;\\n end;\\n\\n {$ENDIF}\\n //insert magnanimous numbers\\n num := Base10toNum(dgtBase10);\\n MagList[MagIdx] := num;\\n inc(MagIdx);\\n end;\\n\\nfunction Run(StartDgtCount:byte):Uint64;\\nvar\\n lastIdx: NativeInt;\\nbegin\\n result := 0;\\n HighIdx := StartDgtCount;// 7 start with 7 digits\\n LastIdx := HighIdx;\\n repeat\\n if dgtBase5[HighIdx] <> 0 then\\n Begin\\n CnvEvenBase10(LastIdx);\\n CheckMagn(dgtEvenBase10);\\n end;\\n CnvOddBase10(LastIdx);\\n CheckMagn(dgtOddBase10);\\n inc(result);\\n //output for still running every 16.22 Mio\\n IF result AND (1 shl 22-1) = 0 then\\n OutSol(result);\\n\\n lastIdx := IncDgtBase5;\\n until HighIdx > MAXHIGHIDX;\\n\\nend;\\n\\nBEGIN\\n {$IFDEF USE_GMP}mpz_init_set_ui(z,0);{$ENDIF}\\n T0 := Gettickcount64;\\n InitPrimes;\\n T0 -= Gettickcount64;\\n writeln('getting primes ',-T0 / 1000: 0: 3, ' s');\\n T0 := Gettickcount64;\\n fillchar(dgtBase5,SizeOf(dgtBase5),#0);\\n fillchar(dgtEvenBase10,SizeOf(dgtEvenBase10),#0);\\n fillchar(dgtOddBase10,SizeOf(dgtOddBase10),#0);\\n//Magnanimous Numbers that can not be found by this algorithm\\n MagIdx := 0;\\n MagList[MagIdx] := 1;inc(MagIdx);\\n MagList[MagIdx] := 11;inc(MagIdx);\\n MagList[MagIdx] := 20;inc(MagIdx);\\n MagList[MagIdx] := 101;inc(MagIdx);\\n MagList[MagIdx] := 1001;inc(MagIdx);\\n //cant be checked easy for ending in 5\\n MagList[MagIdx] := 40001;inc(MagIdx);\\n {$IFDEF USE_GMP} mpz_init_set_ui(z,0);{$ENDIF}\\n\\n count := Run(0);\\n\\n writeln;\\n CnvOddBase10(highIdx);\\n writeln(MagIdx:5,count:12,Base10toNum(dgtOddBase10):18,\\n (Gettickcount64-T0) / 1000: 10: 3, ' s');\\n InsertSort(@MagList[0],0,MagIdx-1);\\n\\n {$IFDEF USE_GMP} mpz_clear(z);writeln('Count of gmp tests ',gmp_count);{$ENDIF}\\n For cnt := 0 to MagIdx-1 do\\n writeln(cnt+1:3,' ',MagList[cnt]);\\n {$IFDEF WINDOWS}\\n readln;\\n {$ENDIF}\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\nuse ntheory 'is_prime';\\n\\nsub magnanimous {\\n my($n) = @_;\\n my $last;\\n for my $c (1 .. length($n) - 1) {\\n ++$last and last unless is_prime substr($n,0,$c) + substr($n,$c)\\n }\\n not $last;\\n}\\n\\nmy @M;\\nfor ( my $i = 0, my $count = 0; $count < 400; $i++ ) {\\n ++$count and push @M, $i if magnanimous($i);\\n}\\n\\nsay \\\"First 45 magnanimous numbers\\\\n\\\".\\n (sprintf \\\"@{['%4d' x 45]}\\\", @M[0..45-1]) =~ s/(.{60})/$1\\\\n/gr;\\n\\nsay \\\"241st through 250th magnanimous numbers\\\\n\\\" .\\n join ' ', @M[240..249];\\n\\nsay \\\"\\\\n391st through 400th magnanimous numbers\\\\n\\\".\\n join ' ', @M[390..399];\\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;\\\">magnanimous</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;\\\">p</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;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">10</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">r</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><span style=\\\"color: #000000;\\\">p</span>\\n <span style=\\\"color: #000000;\\\">n</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;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">is_prime</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">false</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">*=</span> <span style=\\\"color: #000000;\\\">10</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</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: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">mag</span> <span style=\\\"color: #0000FF;\\\">=</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;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">mag</span><span style=\\\"color: #0000FF;\\\">)<</span><span style=\\\"color: #000000;\\\">400</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">magnanimous</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">mag</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">n</span> <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: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"First 45 magnanimous numbers: \\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">mag</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">45</span><span style=\\\"color: #0000FF;\\\">],{</span><span style=\\\"color: #004600;\\\">pp_Indent</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">30</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><span style=\\\"color: #004600;\\\">pp_Maxlen</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">100</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;\\\">\\\"magnanimous numbers[241..250]: %v\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">mag</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">241</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">250</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;\\\">\\\"magnanimous numbers[391..400]: %v\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">mag</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">391</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">400</span><span style=\\\"color: #0000FF;\\\">]})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(de **Mod (X Y N)\\n (let M 1\\n (loop\\n (when (bit? 1 Y)\\n (setq M (% (* M X) N)) )\\n (T (=0 (setq Y (>> 1 Y)))\\n M )\\n (setq X (% (* X X) N)) ) ) )\\n(de isprime (N)\\n (cache '(NIL) N\\n (if (== N 2)\\n T\\n (and\\n (> N 1)\\n (bit? 1 N)\\n (let (Q (dec N) N1 (dec N) K 0 X)\\n (until (bit? 1 Q)\\n (setq\\n Q (>> 1 Q)\\n K (inc K) ) )\\n (catch 'composite\\n (do 16\\n (loop\\n (setq X\\n (**Mod\\n (rand 2 (min (dec N) 1000000000000))\\n Q\\n N ) )\\n (T (or (=1 X) (= X N1)))\\n (T\\n (do K\\n (setq X (**Mod X 2 N))\\n (when (=1 X) (throw 'composite))\\n (T (= X N1) T) ) )\\n (throw 'composite) ) )\\n (throw 'composite T) ) ) ) ) ) )\\n(de numbers (N)\\n (let (P 10 Q N)\\n (make\\n (until (> 10 Q)\\n (link\\n (+\\n (setq Q (/ N P))\\n (% N P) ) )\\n (setq P (* P 10)) ) ) ) )\\n(de ismagna (N)\\n (or\\n (> 10 N)\\n (fully isprime (numbers N)) ) )\\n(let (C 0 N 0 Lst)\\n (setq Lst\\n (make\\n (until (== C 401)\\n (when (ismagna N)\\n (link N)\\n (inc 'C) )\\n (inc 'N) ) ) )\\n (println (head 45 Lst))\\n (println (head 10 (nth Lst 241)))\\n (println (head 10 (nth Lst 391))) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"100H: /* FIND SOME MAGNANIMOUS NUMBERS - THOSE WHERE INSERTING '+' BETWEEN */\\n /* ANY TWO OF THE DIGITS AND EVALUATING THE SUM RESULTS IN A PRIME */\\n BDOS: PROCEDURE( FN, ARG ); /* CP/M BDOS SYSTEM CALL */\\n DECLARE FN BYTE, ARG ADDRESS;\\n GOTO 5;\\n END BDOS;\\n PRINT$CHAR: PROCEDURE( C ); DECLARE C BYTE; CALL BDOS( 2, C ); END;\\n PRINT$STRING: PROCEDURE( S ); DECLARE S ADDRESS; CALL BDOS( 9, S ); END;\\n PRINT$NL: PROCEDURE; CALL PRINT$STRING( .( 0DH, 0AH, '$' ) ); END;\\n PRINT$NUMBER: PROCEDURE( N );\\n DECLARE N ADDRESS;\\n DECLARE V ADDRESS, N$STR( 6 ) BYTE, W BYTE;\\n V = N;\\n W = LAST( N$STR );\\n N$STR( W ) = '$';\\n N$STR( W := W - 1 ) = '0' + ( V MOD 10 );\\n DO WHILE( ( V := V / 10 ) > 0 );\\n N$STR( W := W - 1 ) = '0' + ( V MOD 10 );\\n END;\\n IF N < 100 THEN DO;\\n IF N < 10 THEN CALL PRINT$CHAR( ' ' );\\n CALL PRINT$CHAR( ' ' );\\n END;\\n CALL PRINT$STRING( .N$STR( W ) );\\n END PRINT$NUMBER;\\n /* INTEGER SQUARE ROOT: BASED ON THE ONE IN THE PL/M FROBENIUS NUMBERS */\\n SQRT: PROCEDURE( N )ADDRESS;\\n DECLARE ( N, X0, X1 ) ADDRESS;\\n IF N <= 3 THEN DO;\\n IF N = 0 THEN X0 = 0; ELSE X0 = 1;\\n END;\\n ELSE DO;\\n X0 = SHR( N, 1 );\\n DO WHILE( ( X1 := SHR( X0 + ( N / X0 ), 1 ) ) < X0 );\\n X0 = X1;\\n END;\\n END;\\n RETURN X0;\\n END SQRT;\\n\\n DECLARE MAGNANIMOUS (251)ADDRESS; /* MAGNANIMOUS NUMBERS */\\n DECLARE FALSE LITERALLY '0';\\n DECLARE TRUE LITERALLY '0FFH';\\n /* TO FIND MAGNANIMOUS NUMBERS UP TO 30$000, WE NEED TO FIND PRIMES */\\n /* UP TO 9$999 + 9 = 10$008 */\\n DECLARE MAX$PRIME LITERALLY '10$008';\\n DECLARE DCL$PRIME LITERALLY '10$009';\\n /* SIEVE THE PRIMES TO MAX$PRIME */\\n DECLARE ( I, S ) ADDRESS;\\n DECLARE PRIME ( DCL$PRIME )BYTE;\\n PRIME( 1 ) = FALSE; PRIME( 2 ) = TRUE;\\n DO I = 3 TO LAST( PRIME ) BY 2; PRIME( I ) = TRUE; END;\\n DO I = 4 TO LAST( PRIME ) BY 2; PRIME( I ) = FALSE; END;\\n DO I = 3 TO SQRT( MAX$PRIME );\\n IF PRIME( I ) THEN DO;\\n DO S = I * I TO LAST( PRIME ) BY I + I;PRIME( S ) = FALSE; END;\\n END;\\n END;\\n\\n /* FIND THE MAGNANIMOUS NUMBERS */\\n FIND$MAGNANIMOUS: PROCEDURE;\\n DECLARE ( D1, D2, D3, D4, D5\\n , D12, D123, D1234\\n , D23, D234, D2345\\n , D34, D345, D45\\n ) ADDRESS;\\n DECLARE M$COUNT ADDRESS; /* COUNT OF MAGNANIMOUS NUMBERS FOUND */\\n STORE$MAGNANIMOUS: PROCEDURE( N )BYTE;\\n DECLARE N ADDRESS;\\n M$COUNT = M$COUNT + 1;\\n IF M$COUNT <= LAST( MAGNANIMOUS ) THEN MAGNANIMOUS( M$COUNT ) = N;\\n RETURN M$COUNT <= LAST( MAGNANIMOUS );\\n END STORE$MAGNANIMOUS;\\n\\n M$COUNT = 0;\\n /* 1 DIGIT MAGNANIMOUS NUMBERS */\\n DO D1 = 0 TO 9; IF NOT STORE$MAGNANIMOUS( D1 ) THEN RETURN; END;\\n /* 2 DIGIT MAGNANIMOUS NUMBERS */\\n DO D1 = 1 TO 9;\\n DO D2 = 0 TO 9;\\n IF PRIME( D1 + D2 ) THEN DO;\\n IF NOT STORE$MAGNANIMOUS( ( D1 * 10 ) + D2 ) THEN RETURN;\\n END;\\n END;\\n END;\\n /* 3 DIGIT MAGNANIMOUS NUMBERS */\\n DO D1 = 1 TO 9;\\n DO D23 = 0 TO 99;\\n IF PRIME( D1 + D23 ) THEN DO;\\n D3 = D23 MOD 10;\\n D12 = ( D1 * 10 ) + ( D23 / 10 );\\n IF PRIME( D12 + D3 ) THEN DO;\\n IF NOT STORE$MAGNANIMOUS( ( D12 * 10 ) + D3 ) THEN RETURN;\\n END;\\n END;\\n END;\\n END;\\n /* 4 DIGIT MAGNANIMOUS NUMBERS */\\n DO D12 = 10 TO 99;\\n DO D34 = 0 TO 99;\\n IF PRIME( D12 + D34 ) THEN DO;\\n D123 = ( D12 * 10 ) + ( D34 / 10 );\\n D4 = D34 MOD 10;\\n IF PRIME( D123 + D4 ) THEN DO;\\n D1 = D12 / 10;\\n D234 = ( ( D12 MOD 10 ) * 100 ) + D34;\\n IF PRIME( D1 + D234 ) THEN DO;\\n IF NOT STORE$MAGNANIMOUS( ( D12 * 100 ) + D34 )\\n THEN RETURN;\\n END;\\n END;\\n END;\\n END;\\n END;\\n /* 5 DIGIT MAGNANIMOUS NUMBERS UP TO 30$000 */\\n DO D12 = 10 TO 30;\\n DO D345 = 0 TO 999;\\n IF PRIME( D12 + D345 ) THEN DO;\\n D123 = ( D12 * 10 ) + ( D345 / 100 );\\n D45 = D345 MOD 100;\\n IF PRIME( D123 + D45 ) THEN DO;\\n D1234 = ( D123 * 10 ) + ( D45 / 10 );\\n D5 = D45 MOD 10;\\n IF PRIME( D1234 + D5 ) THEN DO;\\n D1 = D12 / 10;\\n D2345 = ( ( D12 MOD 10 ) * 1000 ) + D345;\\n IF PRIME( D1 + D2345 ) THEN DO;\\n IF NOT STORE$MAGNANIMOUS( ( D12 * 1000 ) + D345 )\\n THEN RETURN;\\n END;\\n END;\\n END;\\n END;\\n END;\\n END;\\n END FIND$MAGNANIMOUS ;\\n\\n CALL FIND$MAGNANIMOUS;\\n DO I = 1 TO LAST( MAGNANIMOUS );\\n IF I = 1 THEN DO;\\n CALL PRINT$STRING( .'MAGNANIMOUS NUMBERS 1-45:$' ); CALL PRINT$NL;\\n CALL PRINT$NUMBER( MAGNANIMOUS( I ) );\\n END;\\n ELSE IF I < 46 THEN DO;\\n IF I MOD 15 = 1 THEN CALL PRINT$NL; ELSE CALL PRINT$CHAR( ' ' );\\n CALL PRINT$NUMBER( MAGNANIMOUS( I ) );\\n END;\\n ELSE IF I = 241 THEN DO;\\n CALL PRINT$NL;\\n CALL PRINT$STRING( .'MAGANIMOUS NUMBERS 241-250:$' ); CALL PRINT$NL;\\n CALL PRINT$NUMBER( MAGNANIMOUS( I ) );\\n END;\\n ELSE IF I > 241 AND I <= 250 THEN DO;\\n CALL PRINT$CHAR( ' ' );\\n CALL PRINT$NUMBER( MAGNANIMOUS( I ) );\\n END;\\n END;\\n CALL PRINT$NL;\\nEOF\\n\",\n \"language\": \"PL-M\"\n },\n {\n \"code\": \"\\\"\\\"\\\" rosettacode.orgwiki/Magnanimous_numbers \\\"\\\"\\\"\\n\\nfrom sympy import isprime\\n\\n\\ndef is_magnanimous(num):\\n \\\"\\\"\\\" True is num is a magnanimous number \\\"\\\"\\\"\\n if num < 10:\\n return True\\n for i in range(1, len(str(num))):\\n quo, rem = divmod(num, 10**i)\\n if not isprime(quo + rem):\\n return False\\n return True\\n\\n\\nif __name__ == '__main__':\\n\\n K, MCOUNT = 0, 0\\n print('First 45 magnanimous numbers:')\\n while MCOUNT < 400:\\n if is_magnanimous(K):\\n if MCOUNT < 45:\\n print(f'{K:4d}', end='\\\\n' if (MCOUNT + 1) % 15 == 0 else '')\\n elif MCOUNT == 239:\\n print('\\\\n241st through 250th magnanimous numbers:')\\n elif 239 < MCOUNT < 250:\\n print(f'{K:6d}', end='')\\n elif MCOUNT == 389:\\n print('\\\\n\\\\n391st through 400th magnanimous numbers:')\\n elif 389 < MCOUNT < 400:\\n print(f'{K:7d}', end='')\\n MCOUNT += 1\\n K += 1\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ 10\\n [ 2dup /mod\\n over 0 = iff\\n [ 2drop true ]\\n done\\n + isprime not iff\\n false done\\n 10 * again ]\\n unrot 2drop ] is magnanimous ( n --> b )\\n\\n [] 0\\n [ dup magnanimous\\n if [ tuck join swap ]\\n 1+\\n over size 250 =\\n until ]\\n drop\\n say \\\"First 45 magnanimous numbers:\\\" cr\\n 45 split swap echo cr cr\\n say \\\"Magnanimous numbers 241-250:\\\" cr\\n -10 split echo cr cr\\n drop\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"my @magnanimous = lazy flat ^10, (10 .. 1001).map( {\\n my int $last;\\n (1 ..^ .chars).map: -> \\\\c { $last = 1 and last unless (.substr(0,c) + .substr(c)).is-prime }\\n next if $last;\\n $_\\n} ),\\n\\n(1002 .. ∞).map: {\\n # optimization for numbers > 1001; First and last digit can not both be even or both be odd\\n next if (.substr(0,1) + .substr(*-1)) %% 2;\\n my int $last;\\n (1 ..^ .chars).map: -> \\\\c { $last = 1 and last unless (.substr(0,c) + .substr(c)).is-prime }\\n next if $last;\\n $_\\n}\\n\\nput 'First 45 magnanimous numbers';\\nput @magnanimous[^45]».fmt('%3d').batch(15).join: \\\"\\\\n\\\";\\n\\nput \\\"\\\\n241st through 250th magnanimous numbers\\\";\\nput @magnanimous[240..249];\\n\\nput \\\"\\\\n391st through 400th magnanimous numbers\\\";\\nput @magnanimous[390..399];\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm finds/displays magnanimous #s (#s with a inserted + sign to sum to a prime).*/\\nparse arg bet.1 bet.2 bet.3 highP . /*obtain optional arguments from the CL*/\\nif bet.1=='' | bet.1==\\\",\\\" then bet.1= 1..45 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif bet.2=='' | bet.2==\\\",\\\" then bet.2= 241..250 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif bet.3=='' | bet.3==\\\",\\\" then bet.3= 391..400 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif highP=='' | highP==\\\",\\\" then highP= 1000000 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\ncall genP /*gen primes up to highP (1 million).*/\\n\\n do j=1 for 3 /*process three magnanimous \\\"ranges\\\". */\\n parse var bet.j LO '..' HI /*obtain the first range (if any). */\\n if HI=='' then HI= LO /*Just a single number? Then use LO. */\\n if HI==0 then iterate /*Is HI a zero? Then skip this range.*/\\n finds= 0; $= /*#: magnanimous # cnt; $: is a list*/\\n do k=0 until finds==HI /* [↓] traipse through the number(s). */\\n if \\\\magna(k) then iterate /*Not magnanimous? Then skip this num.*/\\n finds= finds + 1 /*bump the magnanimous number count. */\\n if finds>=LO then $= $ k /*In range► Then add number ──► $ list*/\\n end /*k*/\\n say\\n say center(' 'LO \\\"──►\\\" HI 'magnanimous numbers ', 126, \\\"─\\\")\\n say strip($)\\n end /*j*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nmagna: procedure expose @. !.; parse arg x 1 L 2 '' -1 R /*obtain #, 1st & last digit.*/\\n len= length(x); if len==1 then return 1 /*one digit #s are magnanimous*/\\n if x>1001 then if L//2 == R//2 then return 0 /*Has parity? Not magnanimous*/\\n do s= 1 for len-1 /*traipse thru #, inserting + */\\n parse var x y +(s) z; sum= y + z /*parse 2 parts of #, sum 'em.*/\\n if !.sum then iterate /*Is sum prime? So far so good*/\\n else return 0 /*Nope? Then not magnanimous.*/\\n end /*s*/\\n return 1 /*Pass all the tests, it's magnanimous.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngenP: @.1=2; @.2=3; @.3=5; @.4=7; @.5=11; @.6=13 /*assign low primes; # primes.*/\\n !.= 0; !.2=1; !.3=1; !.5=1; !.7=1; !.11=1; !.13=1 /* \\\" semaphores to \\\" */\\n #= 6; sq.#= @.# ** 2 /*# primes so far; P squared.*/\\n do j=@.#+4 by 2 to highP; parse var j '' -1 _; if _==5 then iterate /*÷ by 5?*/\\n if j// 3==0 then iterate; if j// 7==0 then iterate /*÷ by 3?; ÷ by 7?*/\\n if j//11==0 then iterate /*\\\" \\\" 11? \\\" \\\" 13?*/\\n do k=6 while sq.k<=j /*divide by some generated odd primes. */\\n if j//@.k==0 then iterate j /*Is J divisible by P? Then not prime*/\\n end /*k*/ /* [↓] a prime (J) has been found. */\\n #= #+1; @.#= j; sq.#= j*j; !.j= 1 /*bump #Ps; P──►@.assign P; P^2; P flag*/\\n end /*j*/; return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"load \\\"stdlib.ring\\\"\\nn = -1\\nsum = 0\\nmagn = []\\n\\nwhile sum < 45\\n n = n + 1\\n if n < 10\\n add(magn,n)\\n sum = sum + 1\\n else\\n nStr = string(n)\\n check = 0\\n for m = 1 to len(nStr)-1\\n nr1 = number(left(nStr,m))\\n nr2 = number(right(nStr,len(nStr)-m))\\n nr3 = nr1 + nr2\\n if not isprime(nr3)\\n check = 1\\n ok\\n next\\n if check = 0\\n add(magn,n)\\n sum = sum + 1\\n ok\\n ok\\nend\\n\\nsee \\\"Magnanimous numbers 1-45:\\\" + nl\\nshowArray(magn)\\n\\nn = -1\\nsum = 0\\nmagn = []\\n\\nwhile sum < 250\\n n = n + 1\\n if n < 10\\n sum = sum + 1\\n else\\n nStr = string(n)\\n check = 0\\n for m = 1 to len(nStr)-1\\n nr1 = number(left(nStr,m))\\n nr2 = number(right(nStr,len(nStr)-m))\\n nr3 = nr1 + nr2\\n if not isprime(nr3)\\n check = 1\\n ok\\n next\\n if check = 0\\n sum = sum + 1\\n ok\\n if check = 0 and sum > 240 and sum < 251\\n add(magn,n)\\n ok\\n ok\\nend\\n\\nsee nl\\nsee \\\"Magnanimous numbers 241-250:\\\" + nl\\nshowArray(magn)\\n\\nfunc showArray array\\n txt = \\\"\\\"\\n see \\\"[\\\"\\n for n = 1 to len(array)\\n txt = txt + array[n] + \\\",\\\"\\n next\\n txt = left(txt,len(txt)-1)\\n txt = txt + \\\"]\\\"\\n see txt\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require \\\"prime\\\"\\n\\nmagnanimouses = Enumerator.new do |y|\\n (0..).each {|n| y << n if (1..n.digits.size-1).all? {|k| n.divmod(10**k).sum.prime?} }\\nend\\n\\nputs \\\"First 45 magnanimous numbers:\\\"\\nputs magnanimouses.first(45).join(' ')\\n\\nputs \\\"\\\\n241st through 250th magnanimous numbers:\\\"\\nputs magnanimouses.first(250).last(10).join(' ')\\n\\nputs \\\"\\\\n391st through 400th magnanimous numbers:\\\"\\nputs magnanimouses.first(400).last(10).join(' ')\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"fn is_prime(n: u32) -> bool {\\n if n < 2 {\\n return false;\\n }\\n if n % 2 == 0 {\\n return n == 2;\\n }\\n if n % 3 == 0 {\\n return n == 3;\\n }\\n let mut p = 5;\\n while p * p <= n {\\n if n % p == 0 {\\n return false;\\n }\\n p += 2;\\n if n % p == 0 {\\n return false;\\n }\\n p += 4;\\n }\\n true\\n}\\n\\nfn is_magnanimous(n: u32) -> bool {\\n let mut p: u32 = 10;\\n while n >= p {\\n if !is_prime(n % p + n / p) {\\n return false;\\n }\\n p *= 10;\\n }\\n true\\n}\\n\\nfn main() {\\n let mut m = (0..).filter(|x| is_magnanimous(*x)).take(400);\\n println!(\\\"First 45 magnanimous numbers:\\\");\\n for (i, n) in m.by_ref().take(45).enumerate() {\\n if i > 0 && i % 15 == 0 {\\n println!();\\n }\\n print!(\\\"{:3} \\\", n);\\n }\\n println!(\\\"\\\\n\\\\n241st through 250th magnanimous numbers:\\\");\\n for n in m.by_ref().skip(195).take(10) {\\n print!(\\\"{} \\\", n);\\n }\\n println!(\\\"\\\\n\\\\n391st through 400th magnanimous numbers:\\\");\\n for n in m.by_ref().skip(140) {\\n print!(\\\"{} \\\", n);\\n }\\n println!();\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"program magnanimous;\\n n := -1;\\n loop for i in [1..400] do\\n loop until magnanimous(n) do n +:= 1; end loop;\\n\\n case i of\\n (1): print(\\\"1 - 45:\\\");\\n (241): print; print(\\\"241 - 250:\\\");\\n (391): print; print(\\\"391 - 400:\\\");\\n end case;\\n\\n if i in [1..45] or i in [241..250] or i in [391..400] then\\n putchar(lpad(str n, 7));\\n if i mod 5 = 0 then print; end if;\\n end if;\\n end loop;\\n\\n proc magnanimous(n);\\n return forall k in splitsums(n) | prime(k);\\n end proc;\\n\\n proc splitsums(n);\\n s := str n;\\n return [val s(..i) + val s(i+1..) : i in [1..#s-1]];\\n end proc;\\n\\n proc prime(n);\\n if n<2 then return false;\\n elseif even n then return(n = 2);\\n elseif n mod 3=0 then return(n = 3);\\n else\\n d := 5;\\n loop while d*d <= n do\\n if n mod d=0 then return false; end if;\\n d +:= 2;\\n if n mod d=0 then return false; end if;\\n d +:= 4;\\n end loop;\\n return true;\\n end if;\\n end proc;\\nend program;\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"func is_magnanimous(n) {\\n 1..n.ilog10 -> all {|k|\\n sum(divmod(n, k.ipow10)).is_prime\\n }\\n}\\n\\nsay \\\"First 45 magnanimous numbers:\\\"\\nsay is_magnanimous.first(45).join(' ')\\n\\nsay \\\"\\\\n241st through 250th magnanimous numbers:\\\"\\nsay is_magnanimous.first(250).last(10).join(' ')\\n\\nsay \\\"\\\\n391st through 400th magnanimous numbers:\\\"\\nsay is_magnanimous.first(400).last(10).join(' ')\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"import Foundation\\n\\nfunc isPrime(_ n: Int) -> Bool {\\n if n < 2 {\\n return false\\n }\\n if n % 2 == 0 {\\n return n == 2\\n }\\n if n % 3 == 0 {\\n return n == 3\\n }\\n var p = 5\\n while p * p <= n {\\n if n % p == 0 {\\n return false\\n }\\n p += 2\\n if n % p == 0 {\\n return false\\n }\\n p += 4\\n }\\n return true\\n}\\n\\nfunc isMagnanimous(_ n: Int) -> Bool {\\n var p = 10;\\n while n >= p {\\n if !isPrime(n % p + n / p) {\\n return false\\n }\\n p *= 10\\n }\\n return true\\n}\\n\\nlet m = (0...).lazy.filter{isMagnanimous($0)}.prefix(400);\\nprint(\\\"First 45 magnanimous numbers:\\\");\\nfor (i, n) in m.prefix(45).enumerated() {\\n if i > 0 && i % 15 == 0 {\\n print()\\n }\\n print(String(format: \\\"%3d\\\", n), terminator: \\\" \\\")\\n}\\nprint(\\\"\\\\n\\\\n241st through 250th magnanimous numbers:\\\");\\nfor n in m.dropFirst(240).prefix(10) {\\n print(n, terminator: \\\" \\\")\\n}\\nprint(\\\"\\\\n\\\\n391st through 400th magnanimous numbers:\\\");\\nfor n in m.dropFirst(390) {\\n print(n, terminator: \\\" \\\")\\n}\\nprint()\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"Imports System, System.Console\\n\\nModule Module1\\n\\n Dim np As Boolean()\\n\\n Sub ms(ByVal lmt As Long)\\n np = New Boolean(CInt(lmt)) {} : np(0) = True : np(1) = True\\n Dim n As Integer = 2, j As Integer = 1 : While n < lmt\\n If Not np(n) Then\\n Dim k As Long = CLng(n) * n\\n While k < lmt : np(CInt(k)) = True : k += n : End While\\n End If : n += j : j = 2 : End While\\n End Sub\\n\\n Function is_Mag(ByVal n As Integer) As Boolean\\n Dim res, rm As Integer, p As Integer = 10\\n While n >= p\\n res = Math.DivRem(n, p, rm)\\n If np(res + rm) Then Return False\\n p = p * 10 : End While : Return True\\n End Function\\n\\n Sub Main(ByVal args As String())\\n ms(100_009) : Dim mn As String = \\\" magnanimous numbers:\\\"\\n WriteLine(\\\"First 45{0}\\\", mn) : Dim l As Integer = 0, c As Integer = 0\\n While c < 400 : If is_Mag(l) Then\\n c += 1 : If c <= 45 OrElse (c > 240 AndAlso c <= 250) OrElse c > 390 Then Write(If(c <= 45, \\\"{0,4} \\\", \\\"{0,8:n0} \\\"), l)\\n If c < 45 AndAlso c Mod 15 = 0 Then WriteLine()\\n If c = 240 Then WriteLine(vbLf & vbLf & \\\"241st through 250th{0}\\\", mn)\\n If c = 390 Then WriteLine(vbLf & vbLf & \\\"391st through 400th{0}\\\", mn)\\n End If : l += 1 : End While\\n End Sub\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Conv, Fmt\\nimport \\\"./math\\\" for Int\\n\\nvar isMagnanimous = Fn.new { |n|\\n if (n < 10) return true\\n var p = 10\\n while (true) {\\n var q = (n/p).floor\\n var r = n % p\\n if (!Int.isPrime(q + r)) return false\\n if (q < 10) break\\n p = p * 10\\n }\\n return true\\n}\\n\\nvar listMags = Fn.new { |from, thru, digs, perLine|\\n if (from < 2) {\\n System.print(\\\"\\\\nFirst %(thru) magnanimous numbers:\\\")\\n } else {\\n System.print(\\\"\\\\n%(Conv.ord(from)) through %(Conv.ord(thru)) magnanimous numbers:\\\")\\n }\\n var i = 0\\n var c = 0\\n while (c < thru) {\\n if (isMagnanimous.call(i)) {\\n c = c + 1\\n if (c >= from) {\\n System.write(Fmt.d(digs, i) + \\\" \\\")\\n if (c % perLine == 0) System.print()\\n }\\n }\\n i = i + 1\\n }\\n}\\n\\nlistMags.call(1, 45, 3, 15)\\nlistMags.call(241, 250, 1, 10)\\nlistMags.call(391, 400, 1, 10)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func IsPrime(N); \\\\Return 'true' if N is prime\\nint N, I;\\n[if N <= 2 then return N = 2;\\nif (N&1) = 0 then \\\\even >2\\\\ return false;\\nfor I:= 3 to sqrt(N) do\\n [if rem(N/I) = 0 then return false;\\n I:= I+1;\\n ];\\nreturn true;\\n];\\n\\nfunc Magnan(N); \\\\Return 'true' if N is a magnanimous number\\nint N, M, P;\\n[M:= 0; P:= 1;\\nloop [N:= N/10;\\n if N = 0 then return true;\\n M:= P*rem(0) + M;\\n P:= P*10;\\n if not IsPrime(N+M) then return false;\\n ];\\n];\\n\\nint Cnt, N;\\n[Cnt:= 0; N:= 0;\\nText(0, \\\"First 45 magnanimous numbers:^m^j\\\");\\nloop [if N < 10 or Magnan(N) then\\n [Cnt:= Cnt+1;\\n if Cnt <= 45 then\\n [Format(4, 0);\\n RlOut(0, float(N));\\n if rem(Cnt/15) = 0 then CrLf(0);\\n ];\\n if Cnt = 241 then\\n Text(0, \\\"^m^j241st through 250th magnanimous numbers:^m^j\\\");\\n if Cnt >= 241 and Cnt <= 250 then\\n [IntOut(0, N); ChOut(0, ^ )];\\n if Cnt = 391 then\\n Text(0, \\\"^m^j^j391st through 400th magnanimous numbers:^m^j\\\");\\n if Cnt >= 391 and Cnt <= 400 then\\n [IntOut(0, N); ChOut(0, ^ )];\\n if Cnt >= 400 then quit;\\n ];\\n N:= N+1;\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Magnanimous-numbers"}}},{"rowIdx":465,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Make_directory_path\nnote: File System Operations\n","language":"00-META"},{"code":";Task:\nCreate a directory and any missing parents.\n\nThis task is named after the posix <code>[http://www.unix.com/man-page/POSIX/0/mkdir/ mkdir -p]</code> command, and several libraries which implement the same behavior.\n\nPlease implement a function of a single path string (for example <code>./path/to/dir</code>) which has the above side-effect.\nIf the directory already exists, return successfully.\nIdeally implementations will work equally well cross-platform (on windows, linux, and OS X).\n\nIt's likely that your language implements such a function as part of its standard library. If so, please also show how such a function would be implemented.\n<br><br>\n\n","language":"00-TASK"},{"code":"fs:create_dirs(path)\n","language":"11l"},{"code":"with Ada.Command_Line;\nwith Ada.Directories;\nwith Ada.Text_IO;\n\nprocedure Make_Directory_Path is\nbegin\n if Ada.Command_Line.Argument_Count /= 1 then\n Ada.Text_IO.Put_Line (\"Usage: make_directory_path <path/to/dir>\");\n return;\n end if;\n\n declare\n Path : String renames Ada.Command_Line.Argument (1);\n begin\n Ada.Directories.Create_Path (Path);\n end;\nend Make_Directory_Path;\n","language":"Ada"},{"code":"void\nmkdirp(text path)\n{\n list l;\n text p, s;\n\n file().b_affix(path).news(l, 0, 0, \"/\");\n\n for (, s in l) {\n p = p + s + \"/\";\n trap_q(mkdir, p, 00755);\n }\n}\n\ninteger\nmain(void)\n{\n mkdirp(\"./path/to/dir\");\n\n 0;\n}\n","language":"Aime"},{"code":"use framework \"Foundation\"\nuse scripting additions\n\n\n-- createOrFindDirectoryMay :: Bool -> FilePath -> Maybe IO ()\non createOrFindDirectoryMay(fp)\n createDirectoryIfMissingMay(true, fp)\nend createOrFindDirectoryMay\n\n\n-- createDirectoryIfMissingMay :: Bool -> FilePath -> Maybe IO ()\non createDirectoryIfMissingMay(blnParents, fp)\n if doesPathExist(fp) then\n nothing(\"Directory already exists: \" & fp)\n else\n set e to reference\n set ca to current application\n set oPath to (ca's NSString's stringWithString:(fp))'s ¬\n stringByStandardizingPath\n set {bool, nse} to ca's NSFileManager's ¬\n defaultManager's createDirectoryAtPath:(oPath) ¬\n withIntermediateDirectories:(blnParents) ¬\n attributes:(missing value) |error|:(e)\n if bool then\n just(fp)\n else\n nothing((localizedDescription of nse) as string)\n end if\n end if\nend createDirectoryIfMissingMay\n\n-- TEST ----------------------------------------------------------------------\non run\n\n createOrFindDirectoryMay(\"~/Desktop/Notes/today\")\n\nend run\n\n-- GENERIC FUNCTIONS ---------------------------------------------------------\n\n-- doesPathExist :: FilePath -> IO Bool\non doesPathExist(strPath)\n set ca to current application\n ca's NSFileManager's defaultManager's ¬\n fileExistsAtPath:((ca's NSString's ¬\n stringWithString:strPath)'s ¬\n stringByStandardizingPath)\nend doesPathExist\n\n-- just :: a -> Just a\non just(x)\n {nothing:false, just:x}\nend just\n\n-- nothing :: () -> Nothing\non nothing(msg)\n {nothing:true, msg:msg}\nend nothing\n","language":"AppleScript"},{"code":"write.directory \"path/to/some/directory\" ø\n","language":"Arturo"},{"code":"# syntax: GAWK -f MAKE_DIRECTORY_PATH.AWK path ...\nBEGIN {\n for (i=1; i<=ARGC-1; i++) {\n path = ARGV[i]\n msg = (make_dir_path(path) == 0) ? \"created\" : \"exists\"\n printf(\"'%s' %s\\n\",path,msg)\n }\n exit(0)\n}\nfunction make_dir_path(path, cmd) {\n# cmd = sprintf(\"mkdir -p '%s'\",path) # Unix\n cmd = sprintf(\"MKDIR \\\"%s\\\" 2>NUL\",path) # MS-Windows\n return system(cmd)\n}\n","language":"AWK"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <libgen.h>\n#include <string.h>\n#include <sys/stat.h>\n#include <sys/types.h>\n\nint main (int argc, char **argv) {\n char *str, *s;\n struct stat statBuf;\n\n if (argc != 2) {\n fprintf (stderr, \"usage: %s <path>\\n\", basename (argv[0]));\n exit (1);\n }\n s = argv[1];\n while ((str = strtok (s, \"/\")) != NULL) {\n if (str != s) {\n str[-1] = '/';\n }\n if (stat (argv[1], &statBuf) == -1) {\n mkdir (argv[1], 0);\n } else {\n if (! S_ISDIR (statBuf.st_mode)) {\n fprintf (stderr, \"couldn't create directory %s\\n\", argv[1]);\n exit (1);\n }\n }\n s = NULL;\n }\n return 0;\n}\n","language":"C"},{"code":"#include <filesystem>\n#include <iostream>\n\nnamespace fs = std::filesystem;\n\nint main(int argc, char* argv[])\n{\n\tif(argc != 2)\n\t{\n\t\tstd::cout << \"usage: mkdir <path>\\n\";\n\t\treturn -1;\n\t}\n\n\tfs::path pathToCreate(argv[1]);\n\n\tif (fs::exists(pathToCreate))\n\t\treturn 0;\n\n\tif (fs::create_directories(pathToCreate))\n\t\treturn 0;\n\telse\n\t{\n\t\tstd::cout << \"couldn't create directory: \" << pathToCreate.string() << std::endl;\n\t\treturn -1;\n\t}\n}\n","language":"C++"},{"code":"System.IO.Directory.CreateDirectory(path)\n","language":"C-sharp"},{"code":"(defn mkdirp [path]\n (let [dir (java.io.File. path)]\n (if (.exists dir)\n true\n (.mkdirs dir))))\n","language":"Clojure"},{"code":"(ensure-directories-exist \"your/path/name\")\n","language":"Common-Lisp"},{"code":"import std.stdio;\n\nvoid main() {\n makeDir(\"parent/test\");\n}\n\n/// Manual implementation of what mkdirRecurse in std.file does.\nvoid makeDir(string path) out {\n import std.exception : enforce;\n import std.file : exists;\n enforce(path.exists, \"Failed to create the requested directory.\");\n} body {\n import std.array : array;\n import std.file;\n import std.path : pathSplitter, chainPath;\n\n auto workdir = \"\";\n foreach (dir; path.pathSplitter) {\n workdir = chainPath(workdir, dir).array;\n if (workdir.exists) {\n if (!workdir.isDir) {\n import std.conv : text;\n throw new FileException(text(\"The file \", workdir, \" in the path \", path, \" is not a directory.\"));\n }\n } else {\n workdir.mkdir();\n }\n }\n}\n","language":"D"},{"code":"program Make_directory_path;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils,\n System.IOUtils;\n\nconst\n Path1 = '.\\folder1\\folder2\\folder3'; // windows relative path (others OS formats are acepted)\n Path2 = 'folder4\\folder5\\folder6';\n\nbegin\n // \"ForceDirectories\" work with relative path if start with \"./\"\n if ForceDirectories(Path1) then\n Writeln('Created \"', path1, '\" sucessfull.');\n\n // \"TDirectory.CreateDirectory\" work with any path format\n // but don't return sucess, requere \"TDirectory.Exists\" to check\n TDirectory.CreateDirectory(Path2);\n if TDirectory.Exists(Path2) then\n Writeln('Created \"', path2, '\" sucessfull.');\n Readln;\nend.\n","language":"Delphi"},{"code":"File.mkdir_p(\"./path/to/dir\")\n","language":"Elixir"},{"code":"OS_MKDIR(\"C:\\EXAMPLES\\03192015\")\n","language":"ERRE"},{"code":"USE: io.directories\n\"path/to/dir\" make-directories\n","language":"Factor"},{"code":"USING: combinators.short-circuit io.backend io.files\nio.pathnames kernel sequences ;\nIN: io.directories\n: make-directories ( path -- )\n normalize-path trim-tail-separators dup\n { [ \".\" = ] [ root-directory? ] [ empty? ] [ exists? ] } 1||\n [ make-parent-directories dup make-directory ] unless drop ;\n","language":"Factor"},{"code":"#ifdef __FB_WIN32__\n Dim pathname As String = \"Ring\\docs\"\n#else\n Dim pathname As String = \"Ring/docs\"\n#endif\n\nDim As String mkpathname = \"mkdir \" & pathname\nDim result As Long = Shell (mkpathname)\n\nIf result = 0 Then\n Print \"Created the directory...\"\n Chdir(pathname)\n Print Curdir\nElse\n Print \"error: unable to create folder \" & pathname & \" in the current path.\"\nEnd If\nSleep\n","language":"FreeBASIC"},{"code":"Public Sub Form_Open()\n\nIf Not Exist(User.home &/ \"TestFolder\") Then Mkdir User.Home &/ \"TestFolder\"\n\nEnd\n","language":"Gambas"},{"code":"\tos.MkdirAll(\"/tmp/some/path/to/dir\", 0770)\n","language":"Go"},{"code":"import System.Directory (createDirectory, setCurrentDirectory)\nimport Data.List.Split (splitOn)\n\nmain :: IO ()\nmain = do\n let path = splitOn \"/\" \"path/to/dir\"\n mapM_ (\\x -> createDirectory x >> setCurrentDirectory x) path\n","language":"Haskell"},{"code":"require 'general/dirutils'\npathcreate '/tmp/some/path/to/dir'\n","language":"J"},{"code":"pathcreate=: monad define\n todir=. termsep_j_ jpathsep y\n todirs=. }. ,each /\\ <;.2 todir NB. base dirs\n msk=. -.direxist todirs NB. 1 for each non-existing dir\n msk=. 0 (i. msk i: 0)}msk\n dircreate msk#todirs NB. create non-existing base dirs\n)\n\ndircreate=: monad define\n y=. boxxopen y\n msk=. -.direxist y\n if. ''-:$msk do. msk=. (#y)#msk end.\n res=. 1!:5 msk#y\n msk #inv ,res\n)\n\ndirexist=: 2 = ftype&>@:boxopen\n","language":"J"},{"code":"import java.io.File;\n\npublic interface Test {\n\n public static void main(String[] args) {\n try {\n File f = new File(\"C:/parent/test\");\n if (f.mkdirs())\n System.out.println(\"path successfully created\");\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n}\n","language":"Java"},{"code":"var path = require('path');\nvar fs = require('fs');\n\nfunction mkdirp (p, cb) {\n cb = cb || function () {};\n p = path.resolve(p);\n\n fs.mkdir(p, function (er) {\n if (!er) {\n return cb(null);\n }\n switch (er.code) {\n case 'ENOENT':\n // The directory doesn't exist. Make its parent and try again.\n mkdirp(path.dirname(p), function (er) {\n if (er) cb(er);\n else mkdirp(p, cb);\n });\n break;\n\n // In the case of any other error, something is borked.\n default:\n cb(er);\n break;\n }\n });\n}\n","language":"JavaScript"},{"code":"mkpath(\"/tmp/unusefuldir/helloworld.d/test123\")\n","language":"Julia"},{"code":"// version 1.0.6\n\nimport java.io.File\n\nfun main(args: Array<String>) {\n // using built-in mkdirs() method\n val success = File(\"./path/to/dir\").mkdirs()\n if (success) println(\"Directory path was created successfully\")\n else println(\"Failed to create directory path\")\n}\n","language":"Kotlin"},{"code":"require(\"lfs\")\n\nfunction mkdir (path)\n local sep, pStr = package.config:sub(1, 1), \"\"\n for dir in path:gmatch(\"[^\" .. sep .. \"]+\") do\n pStr = pStr .. dir .. sep\n lfs.mkdir(pStr)\n end\nend\n\nmkdir(\"C:\\\\path\\\\to\\\\dir\") -- Quoting backslashes requires escape sequence\n","language":"Lua"},{"code":"mkdirp[path_] := Quiet[CreateDirectory[path,{CreateIntermediateDirectories->True}],{CreateDirectory::filex}]\n","language":"Mathematica"},{"code":"(define (mkdir-p mypath)\n (if (= \"/\" (mypath 0)) ;; Abs or relative path?\n (setf /? \"/\")\n (setf /? \"\")\n )\n (setf path-components (clean empty? (parse mypath \"/\"))) ;; Split path and remove empty elements\n (for (x 0 (length path-components))\n (setf walking-path (string /? (join (slice path-components 0 (+ 1 x)) \"/\")))\n (make-dir walking-path)\n )\n)\n\n;; Using user-made function...\n(mkdir-p \"/tmp/rosetta/test1\")\n\n;; ... or calling OS command directly.\n(! \"mkdir -p /tmp/rosetta/test2\")\n(exit)\n","language":"NewLISP"},{"code":"import os\n\ntry:\n createDir(\"./path/to/dir\")\n echo \"Directory now exists.\"\nexcept OSError:\n echo \"Failed to create the directory.\"\n","language":"Nim"},{"code":"class Program {\n function : Main(args : String[]) ~ Nil {\n System.IO.File.Directory->CreatePath(\"your/path/name\")->PrintLine();\n }\n}\n","language":"Objeck"},{"code":"let rec mkdir_p path perm =\n if path <> \"\" then\n try Unix.mkdir path perm with\n | Unix.Unix_error (EEXIST, _, _) when Sys.is_directory path -> ()\n | Unix.Unix_error (ENOENT, _, _) ->\n mkdir_p (Filename.dirname path) perm;\n Unix.mkdir path perm\n","language":"OCaml"},{"code":"use File::Path qw(make_path);\n\nmake_path('path/to/dir')\n","language":"Perl"},{"code":"(notonline)-->\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- (file i/o)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">create_directory</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"myapp/interface/letters\"</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: #008000;\">\"Filesystem problem - could not create the new folder\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n<!--\n","language":"Phix"},{"code":"-->\n <span style=\"color: #008080;\">global</span> <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">create_directory</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: #004080;\">integer</span> <span style=\"color: #000000;\">mode</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0o700</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">make_parent</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">finit</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">initf</span><span style=\"color: #0000FF;\">()</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</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;\">name</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">name</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">get_proper_path</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- Remove any trailing slash.</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">[$]=</span><span style=\"color: #004600;\">SLASH</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">name</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">name</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;\">if</span>\n\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">make_parent</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">pos</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">rfind</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">SLASH</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">pos</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;\">parent</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">name</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;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">file_exists</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">parent</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">file_type</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">parent</span><span style=\"color: #0000FF;\">)==</span><span style=\"color: #004600;\">FILETYPE_DIRECTORY</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;\">create_directory</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">parent</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">mode</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">make_parent</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</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;\">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;\">if</span>\n\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">ret</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()=</span><span style=\"color: #004600;\">LINUX</span> <span style=\"color: #008080;\">then</span>\n\n <span style=\"color: #000000;\">ret</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">c_func</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">xCreateDirectory</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">mode</span><span style=\"color: #0000FF;\">})</span>\n\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()=</span><span style=\"color: #004600;\">WINDOWS</span> <span style=\"color: #008080;\">then</span>\n\n <span style=\"color: #000000;\">ret</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">c_func</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">xCreateDirectory</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">})</span>\n\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n\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","language":"Phix"},{"code":"(call \"mkdir\" \"-p\" \"path/to/dir\")\n","language":"PicoLisp"},{"code":"New-Item -Path \".\\path\\to\\dir\" -ItemType Directory -ErrorAction SilentlyContinue\n","language":"PowerShell"},{"code":"from errno import EEXIST\nfrom os import mkdir, curdir\nfrom os.path import split, exists\n\ndef mkdirp(path, mode=0777):\n head, tail = split(path)\n if not tail:\n head, tail = split(head)\n if head and tail and not exists(head):\n try:\n mkdirp(head, mode)\n except OSError as e:\n # be happy if someone already created the path\n if e.errno != EEXIST:\n raise\n if tail == curdir: # xxx/newdir/. exists if xxx/newdir exists\n return\n try:\n mkdir(path, mode)\n except OSError as e:\n # be happy if someone already created the path\n if e.errno != EEXIST:\n raise\n","language":"Python"},{"code":"def mkdirp(path):\n try:\n os.makedirs(path)\n except OSError as exc: # Python >2.5\n if exc.errno == errno.EEXIST and os.path.isdir(path):\n pass\n else: raise\n","language":"Python"},{"code":"def mkdirp(path):\n os.makedirs(path, exist_ok=True)\n","language":"Python"},{"code":"#lang racket\n(define path-str \"/tmp/woo/yay\")\n(define path/..-str \"/tmp/woo\")\n\n;; clean up from a previous run\n(when (directory-exists? path-str)\n (delete-directory path-str)\n (delete-directory path/..-str))\n;; delete-directory/files could also be used -- but that requires goggles and rubber\n;; gloves to handle safely!\n\n(define (report-path-exists)\n (printf \"~s exists (as a directory?):~a~%~s exists (as a directory?):~a~%~%\"\n path/..-str (directory-exists? path/..-str)\n path-str (directory-exists? path-str)))\n\n(report-path-exists)\n\n;; Really ... this is the only bit that matters!\n(make-directory* path-str)\n\n(report-path-exists)\n","language":"Racket"},{"code":"mkdir 'path/to/dir'\n","language":"Raku"},{"code":"for [\\,] $*SPEC.splitdir(\"../path/to/dir\") -> @path {\n mkdir $_ unless .e given $*SPEC.catdir(@path).IO;\n}\n","language":"Raku"},{"code":"/*REXX program creates a directory (folder) and all its parent paths as necessary. */\ntrace off /*suppress possible warning msgs.*/\n\ndPath = 'path\\to\\dir' /*define directory (folder) path.*/\n\n'MKDIR' dPath \"2>nul\" /*alias could be used: MD dPath */\n /*stick a fork in it, we're done.*/\n","language":"REXX"},{"code":"System(\"mkdir C:\\Ring\\docs\")\nisdir(\"C:\\Ring\\docs\")\n\nsee isdir(\"C:\\Ring\\docs\") + nl\nfunc isdir cDir\n try\n dir(cDir)\n return true\n catch\n return false\n done\n","language":"Ring"},{"code":"require 'fileutils'\nFileUtils.mkdir_p(\"path/to/dir\")\n","language":"Ruby"},{"code":"files #f, \"c:\\myDocs\"\t\t' check for directory\nif #f hasanswer() then\n if #f isDir() then\t\t' is it a file or a directory\n print \"A directory exist\"\n else\n print \"A file exist\"\n end if\n else\n shell$(\"mkdir c:\\myDocs\" ' if not exist make a directory\nend if\n","language":"Run-BASIC"},{"code":"use std::fs;\n\nfn main() {\n fs::create_dir_all(\"./path/to/dir\").expect(\"An Error Occured!\")\n}\n","language":"Rust"},{"code":"new java.io.File(\"/path/to/dir\").mkdirs\n","language":"Scala"},{"code":"import java.io.File\n\ndef mkdirs(path: List[String]) = // return true if path was created\n path.tail.foldLeft(new File(path.head)){(a,b) => a.mkdir; new File(a,b)}.mkdir\n\nmkdirs(List(\"/path\", \"to\", \"dir\"))\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n include \"cli_cmds.s7i\";\n\nconst proc: main is func\n begin\n doMkdirCmd(argv(PROGRAM), TRUE);\n end func;\n","language":"Seed7"},{"code":"$ include \"seed7_05.s7i\";\n include \"cli_cmds.s7i\";\n\nconst proc: main is func\n local\n var string: parameters is \"\";\n begin\n parameters := join(argv(PROGRAM), \" \");\n doMkdir(parameters);\n end func;\n","language":"Seed7"},{"code":"Dir.new(Dir.cwd, \"path\", \"to\", \"dir\").make_path; # works cross-platform\n","language":"Sidef"},{"code":"file mkdir ./path/to/dir\n","language":"Tcl"},{"code":"function mkdirp() { mkdir -p \"$1\"; }\n","language":"UNIX-Shell"},{"code":"Module Module1\n\n Sub Main()\n System.IO.Directory.CreateDirectory(\"some/where\")\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"io\" for FileSystem\n\nclass Main {\n construct new() {}\n\n init() {\n FileSystem.createDirectory(\"path/to/dir\")\n }\n\n update() {}\n\n draw(alpha) {}\n}\n\nvar Game = Main.new()\n","language":"Wren"},{"code":"import \"io\" for Directory\n\nDirectory.create(\"path/to/dir\")\n","language":"Wren"},{"code":"System.cmd(\"mkdir -p ../foo/bar\")\n","language":"Zkl"},{"code":"fcn mkdir(path) { System.cmd(\"mkdir -p \"+path) }\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Make_directory_path\\nnote: File System Operations\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nCreate a directory and any missing parents.\\n\\nThis task is named after the posix <code>[http://www.unix.com/man-page/POSIX/0/mkdir/ mkdir -p]</code> command, and several libraries which implement the same behavior.\\n\\nPlease implement a function of a single path string (for example <code>./path/to/dir</code>) which has the above side-effect.\\nIf the directory already exists, return successfully.\\nIdeally implementations will work equally well cross-platform (on windows, linux, and OS X).\\n\\nIt's likely that your language implements such a function as part of its standard library. If so, please also show how such a function would be implemented.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"fs:create_dirs(path)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Command_Line;\\nwith Ada.Directories;\\nwith Ada.Text_IO;\\n\\nprocedure Make_Directory_Path is\\nbegin\\n if Ada.Command_Line.Argument_Count /= 1 then\\n Ada.Text_IO.Put_Line (\\\"Usage: make_directory_path <path/to/dir>\\\");\\n return;\\n end if;\\n\\n declare\\n Path : String renames Ada.Command_Line.Argument (1);\\n begin\\n Ada.Directories.Create_Path (Path);\\n end;\\nend Make_Directory_Path;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"void\\nmkdirp(text path)\\n{\\n list l;\\n text p, s;\\n\\n file().b_affix(path).news(l, 0, 0, \\\"/\\\");\\n\\n for (, s in l) {\\n p = p + s + \\\"/\\\";\\n trap_q(mkdir, p, 00755);\\n }\\n}\\n\\ninteger\\nmain(void)\\n{\\n mkdirp(\\\"./path/to/dir\\\");\\n\\n 0;\\n}\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"use framework \\\"Foundation\\\"\\nuse scripting additions\\n\\n\\n-- createOrFindDirectoryMay :: Bool -> FilePath -> Maybe IO ()\\non createOrFindDirectoryMay(fp)\\n createDirectoryIfMissingMay(true, fp)\\nend createOrFindDirectoryMay\\n\\n\\n-- createDirectoryIfMissingMay :: Bool -> FilePath -> Maybe IO ()\\non createDirectoryIfMissingMay(blnParents, fp)\\n if doesPathExist(fp) then\\n nothing(\\\"Directory already exists: \\\" & fp)\\n else\\n set e to reference\\n set ca to current application\\n set oPath to (ca's NSString's stringWithString:(fp))'s ¬\\n stringByStandardizingPath\\n set {bool, nse} to ca's NSFileManager's ¬\\n defaultManager's createDirectoryAtPath:(oPath) ¬\\n withIntermediateDirectories:(blnParents) ¬\\n attributes:(missing value) |error|:(e)\\n if bool then\\n just(fp)\\n else\\n nothing((localizedDescription of nse) as string)\\n end if\\n end if\\nend createDirectoryIfMissingMay\\n\\n-- TEST ----------------------------------------------------------------------\\non run\\n\\n createOrFindDirectoryMay(\\\"~/Desktop/Notes/today\\\")\\n\\nend run\\n\\n-- GENERIC FUNCTIONS ---------------------------------------------------------\\n\\n-- doesPathExist :: FilePath -> IO Bool\\non doesPathExist(strPath)\\n set ca to current application\\n ca's NSFileManager's defaultManager's ¬\\n fileExistsAtPath:((ca's NSString's ¬\\n stringWithString:strPath)'s ¬\\n stringByStandardizingPath)\\nend doesPathExist\\n\\n-- just :: a -> Just a\\non just(x)\\n {nothing:false, just:x}\\nend just\\n\\n-- nothing :: () -> Nothing\\non nothing(msg)\\n {nothing:true, msg:msg}\\nend nothing\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"write.directory \\\"path/to/some/directory\\\" ø\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"# syntax: GAWK -f MAKE_DIRECTORY_PATH.AWK path ...\\nBEGIN {\\n for (i=1; i<=ARGC-1; i++) {\\n path = ARGV[i]\\n msg = (make_dir_path(path) == 0) ? \\\"created\\\" : \\\"exists\\\"\\n printf(\\\"'%s' %s\\\\n\\\",path,msg)\\n }\\n exit(0)\\n}\\nfunction make_dir_path(path, cmd) {\\n# cmd = sprintf(\\\"mkdir -p '%s'\\\",path) # Unix\\n cmd = sprintf(\\\"MKDIR \\\\\\\"%s\\\\\\\" 2>NUL\\\",path) # MS-Windows\\n return system(cmd)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <libgen.h>\\n#include <string.h>\\n#include <sys/stat.h>\\n#include <sys/types.h>\\n\\nint main (int argc, char **argv) {\\n char *str, *s;\\n struct stat statBuf;\\n\\n if (argc != 2) {\\n fprintf (stderr, \\\"usage: %s <path>\\\\n\\\", basename (argv[0]));\\n exit (1);\\n }\\n s = argv[1];\\n while ((str = strtok (s, \\\"/\\\")) != NULL) {\\n if (str != s) {\\n str[-1] = '/';\\n }\\n if (stat (argv[1], &statBuf) == -1) {\\n mkdir (argv[1], 0);\\n } else {\\n if (! S_ISDIR (statBuf.st_mode)) {\\n fprintf (stderr, \\\"couldn't create directory %s\\\\n\\\", argv[1]);\\n exit (1);\\n }\\n }\\n s = NULL;\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <filesystem>\\n#include <iostream>\\n\\nnamespace fs = std::filesystem;\\n\\nint main(int argc, char* argv[])\\n{\\n\\tif(argc != 2)\\n\\t{\\n\\t\\tstd::cout << \\\"usage: mkdir <path>\\\\n\\\";\\n\\t\\treturn -1;\\n\\t}\\n\\n\\tfs::path pathToCreate(argv[1]);\\n\\n\\tif (fs::exists(pathToCreate))\\n\\t\\treturn 0;\\n\\n\\tif (fs::create_directories(pathToCreate))\\n\\t\\treturn 0;\\n\\telse\\n\\t{\\n\\t\\tstd::cout << \\\"couldn't create directory: \\\" << pathToCreate.string() << std::endl;\\n\\t\\treturn -1;\\n\\t}\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"System.IO.Directory.CreateDirectory(path)\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn mkdirp [path]\\n (let [dir (java.io.File. path)]\\n (if (.exists dir)\\n true\\n (.mkdirs dir))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(ensure-directories-exist \\\"your/path/name\\\")\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio;\\n\\nvoid main() {\\n makeDir(\\\"parent/test\\\");\\n}\\n\\n/// Manual implementation of what mkdirRecurse in std.file does.\\nvoid makeDir(string path) out {\\n import std.exception : enforce;\\n import std.file : exists;\\n enforce(path.exists, \\\"Failed to create the requested directory.\\\");\\n} body {\\n import std.array : array;\\n import std.file;\\n import std.path : pathSplitter, chainPath;\\n\\n auto workdir = \\\"\\\";\\n foreach (dir; path.pathSplitter) {\\n workdir = chainPath(workdir, dir).array;\\n if (workdir.exists) {\\n if (!workdir.isDir) {\\n import std.conv : text;\\n throw new FileException(text(\\\"The file \\\", workdir, \\\" in the path \\\", path, \\\" is not a directory.\\\"));\\n }\\n } else {\\n workdir.mkdir();\\n }\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Make_directory_path;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils,\\n System.IOUtils;\\n\\nconst\\n Path1 = '.\\\\folder1\\\\folder2\\\\folder3'; // windows relative path (others OS formats are acepted)\\n Path2 = 'folder4\\\\folder5\\\\folder6';\\n\\nbegin\\n // \\\"ForceDirectories\\\" work with relative path if start with \\\"./\\\"\\n if ForceDirectories(Path1) then\\n Writeln('Created \\\"', path1, '\\\" sucessfull.');\\n\\n // \\\"TDirectory.CreateDirectory\\\" work with any path format\\n // but don't return sucess, requere \\\"TDirectory.Exists\\\" to check\\n TDirectory.CreateDirectory(Path2);\\n if TDirectory.Exists(Path2) then\\n Writeln('Created \\\"', path2, '\\\" sucessfull.');\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"File.mkdir_p(\\\"./path/to/dir\\\")\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"OS_MKDIR(\\\"C:\\\\EXAMPLES\\\\03192015\\\")\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"USE: io.directories\\n\\\"path/to/dir\\\" make-directories\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"USING: combinators.short-circuit io.backend io.files\\nio.pathnames kernel sequences ;\\nIN: io.directories\\n: make-directories ( path -- )\\n normalize-path trim-tail-separators dup\\n { [ \\\".\\\" = ] [ root-directory? ] [ empty? ] [ exists? ] } 1||\\n [ make-parent-directories dup make-directory ] unless drop ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"#ifdef __FB_WIN32__\\n Dim pathname As String = \\\"Ring\\\\docs\\\"\\n#else\\n Dim pathname As String = \\\"Ring/docs\\\"\\n#endif\\n\\nDim As String mkpathname = \\\"mkdir \\\" & pathname\\nDim result As Long = Shell (mkpathname)\\n\\nIf result = 0 Then\\n Print \\\"Created the directory...\\\"\\n Chdir(pathname)\\n Print Curdir\\nElse\\n Print \\\"error: unable to create folder \\\" & pathname & \\\" in the current path.\\\"\\nEnd If\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"Public Sub Form_Open()\\n\\nIf Not Exist(User.home &/ \\\"TestFolder\\\") Then Mkdir User.Home &/ \\\"TestFolder\\\"\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"\\tos.MkdirAll(\\\"/tmp/some/path/to/dir\\\", 0770)\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import System.Directory (createDirectory, setCurrentDirectory)\\nimport Data.List.Split (splitOn)\\n\\nmain :: IO ()\\nmain = do\\n let path = splitOn \\\"/\\\" \\\"path/to/dir\\\"\\n mapM_ (\\\\x -> createDirectory x >> setCurrentDirectory x) path\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"require 'general/dirutils'\\npathcreate '/tmp/some/path/to/dir'\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"pathcreate=: monad define\\n todir=. termsep_j_ jpathsep y\\n todirs=. }. ,each /\\\\ <;.2 todir NB. base dirs\\n msk=. -.direxist todirs NB. 1 for each non-existing dir\\n msk=. 0 (i. msk i: 0)}msk\\n dircreate msk#todirs NB. create non-existing base dirs\\n)\\n\\ndircreate=: monad define\\n y=. boxxopen y\\n msk=. -.direxist y\\n if. ''-:$msk do. msk=. (#y)#msk end.\\n res=. 1!:5 msk#y\\n msk #inv ,res\\n)\\n\\ndirexist=: 2 = ftype&>@:boxopen\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.io.File;\\n\\npublic interface Test {\\n\\n public static void main(String[] args) {\\n try {\\n File f = new File(\\\"C:/parent/test\\\");\\n if (f.mkdirs())\\n System.out.println(\\\"path successfully created\\\");\\n } catch (Exception e) {\\n e.printStackTrace();\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var path = require('path');\\nvar fs = require('fs');\\n\\nfunction mkdirp (p, cb) {\\n cb = cb || function () {};\\n p = path.resolve(p);\\n\\n fs.mkdir(p, function (er) {\\n if (!er) {\\n return cb(null);\\n }\\n switch (er.code) {\\n case 'ENOENT':\\n // The directory doesn't exist. Make its parent and try again.\\n mkdirp(path.dirname(p), function (er) {\\n if (er) cb(er);\\n else mkdirp(p, cb);\\n });\\n break;\\n\\n // In the case of any other error, something is borked.\\n default:\\n cb(er);\\n break;\\n }\\n });\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"mkpath(\\\"/tmp/unusefuldir/helloworld.d/test123\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nimport java.io.File\\n\\nfun main(args: Array<String>) {\\n // using built-in mkdirs() method\\n val success = File(\\\"./path/to/dir\\\").mkdirs()\\n if (success) println(\\\"Directory path was created successfully\\\")\\n else println(\\\"Failed to create directory path\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"require(\\\"lfs\\\")\\n\\nfunction mkdir (path)\\n local sep, pStr = package.config:sub(1, 1), \\\"\\\"\\n for dir in path:gmatch(\\\"[^\\\" .. sep .. \\\"]+\\\") do\\n pStr = pStr .. dir .. sep\\n lfs.mkdir(pStr)\\n end\\nend\\n\\nmkdir(\\\"C:\\\\\\\\path\\\\\\\\to\\\\\\\\dir\\\") -- Quoting backslashes requires escape sequence\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"mkdirp[path_] := Quiet[CreateDirectory[path,{CreateIntermediateDirectories->True}],{CreateDirectory::filex}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"(define (mkdir-p mypath)\\n (if (= \\\"/\\\" (mypath 0)) ;; Abs or relative path?\\n (setf /? \\\"/\\\")\\n (setf /? \\\"\\\")\\n )\\n (setf path-components (clean empty? (parse mypath \\\"/\\\"))) ;; Split path and remove empty elements\\n (for (x 0 (length path-components))\\n (setf walking-path (string /? (join (slice path-components 0 (+ 1 x)) \\\"/\\\")))\\n (make-dir walking-path)\\n )\\n)\\n\\n;; Using user-made function...\\n(mkdir-p \\\"/tmp/rosetta/test1\\\")\\n\\n;; ... or calling OS command directly.\\n(! \\\"mkdir -p /tmp/rosetta/test2\\\")\\n(exit)\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"import os\\n\\ntry:\\n createDir(\\\"./path/to/dir\\\")\\n echo \\\"Directory now exists.\\\"\\nexcept OSError:\\n echo \\\"Failed to create the directory.\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"class Program {\\n function : Main(args : String[]) ~ Nil {\\n System.IO.File.Directory->CreatePath(\\\"your/path/name\\\")->PrintLine();\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"let rec mkdir_p path perm =\\n if path <> \\\"\\\" then\\n try Unix.mkdir path perm with\\n | Unix.Unix_error (EEXIST, _, _) when Sys.is_directory path -> ()\\n | Unix.Unix_error (ENOENT, _, _) ->\\n mkdir_p (Filename.dirname path) perm;\\n Unix.mkdir path perm\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"use File::Path qw(make_path);\\n\\nmake_path('path/to/dir')\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (file i/o)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">create_directory</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"myapp/interface/letters\\\"</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: #008000;\\\">\\\"Filesystem problem - could not create the new folder\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">global</span> <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">create_directory</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: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">mode</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0o700</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">make_parent</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">finit</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">initf</span><span style=\\\"color: #0000FF;\\\">()</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</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;\\\">name</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">name</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">get_proper_path</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Remove any trailing slash.</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">[$]=</span><span style=\\\"color: #004600;\\\">SLASH</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">name</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">name</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;\\\">if</span>\\n\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">make_parent</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">pos</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">rfind</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">SLASH</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">pos</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;\\\">parent</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">name</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;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">file_exists</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">parent</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">file_type</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">parent</span><span style=\\\"color: #0000FF;\\\">)==</span><span style=\\\"color: #004600;\\\">FILETYPE_DIRECTORY</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;\\\">create_directory</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">parent</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">mode</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">make_parent</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</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;\\\">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;\\\">if</span>\\n\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">ret</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()=</span><span style=\\\"color: #004600;\\\">LINUX</span> <span style=\\\"color: #008080;\\\">then</span>\\n\\n <span style=\\\"color: #000000;\\\">ret</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">c_func</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">xCreateDirectory</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">mode</span><span style=\\\"color: #0000FF;\\\">})</span>\\n\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()=</span><span style=\\\"color: #004600;\\\">WINDOWS</span> <span style=\\\"color: #008080;\\\">then</span>\\n\\n <span style=\\\"color: #000000;\\\">ret</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">c_func</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">xCreateDirectory</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">})</span>\\n\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n\\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\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(call \\\"mkdir\\\" \\\"-p\\\" \\\"path/to/dir\\\")\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"New-Item -Path \\\".\\\\path\\\\to\\\\dir\\\" -ItemType Directory -ErrorAction SilentlyContinue\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"from errno import EEXIST\\nfrom os import mkdir, curdir\\nfrom os.path import split, exists\\n\\ndef mkdirp(path, mode=0777):\\n head, tail = split(path)\\n if not tail:\\n head, tail = split(head)\\n if head and tail and not exists(head):\\n try:\\n mkdirp(head, mode)\\n except OSError as e:\\n # be happy if someone already created the path\\n if e.errno != EEXIST:\\n raise\\n if tail == curdir: # xxx/newdir/. exists if xxx/newdir exists\\n return\\n try:\\n mkdir(path, mode)\\n except OSError as e:\\n # be happy if someone already created the path\\n if e.errno != EEXIST:\\n raise\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def mkdirp(path):\\n try:\\n os.makedirs(path)\\n except OSError as exc: # Python >2.5\\n if exc.errno == errno.EEXIST and os.path.isdir(path):\\n pass\\n else: raise\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def mkdirp(path):\\n os.makedirs(path, exist_ok=True)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n(define path-str \\\"/tmp/woo/yay\\\")\\n(define path/..-str \\\"/tmp/woo\\\")\\n\\n;; clean up from a previous run\\n(when (directory-exists? path-str)\\n (delete-directory path-str)\\n (delete-directory path/..-str))\\n;; delete-directory/files could also be used -- but that requires goggles and rubber\\n;; gloves to handle safely!\\n\\n(define (report-path-exists)\\n (printf \\\"~s exists (as a directory?):~a~%~s exists (as a directory?):~a~%~%\\\"\\n path/..-str (directory-exists? path/..-str)\\n path-str (directory-exists? path-str)))\\n\\n(report-path-exists)\\n\\n;; Really ... this is the only bit that matters!\\n(make-directory* path-str)\\n\\n(report-path-exists)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"mkdir 'path/to/dir'\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"for [\\\\,] $*SPEC.splitdir(\\\"../path/to/dir\\\") -> @path {\\n mkdir $_ unless .e given $*SPEC.catdir(@path).IO;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program creates a directory (folder) and all its parent paths as necessary. */\\ntrace off /*suppress possible warning msgs.*/\\n\\ndPath = 'path\\\\to\\\\dir' /*define directory (folder) path.*/\\n\\n'MKDIR' dPath \\\"2>nul\\\" /*alias could be used: MD dPath */\\n /*stick a fork in it, we're done.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"System(\\\"mkdir C:\\\\Ring\\\\docs\\\")\\nisdir(\\\"C:\\\\Ring\\\\docs\\\")\\n\\nsee isdir(\\\"C:\\\\Ring\\\\docs\\\") + nl\\nfunc isdir cDir\\n try\\n dir(cDir)\\n return true\\n catch\\n return false\\n done\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'fileutils'\\nFileUtils.mkdir_p(\\\"path/to/dir\\\")\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"files #f, \\\"c:\\\\myDocs\\\"\\t\\t' check for directory\\nif #f hasanswer() then\\n if #f isDir() then\\t\\t' is it a file or a directory\\n print \\\"A directory exist\\\"\\n else\\n print \\\"A file exist\\\"\\n end if\\n else\\n shell$(\\\"mkdir c:\\\\myDocs\\\" ' if not exist make a directory\\nend if\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use std::fs;\\n\\nfn main() {\\n fs::create_dir_all(\\\"./path/to/dir\\\").expect(\\\"An Error Occured!\\\")\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"new java.io.File(\\\"/path/to/dir\\\").mkdirs\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"import java.io.File\\n\\ndef mkdirs(path: List[String]) = // return true if path was created\\n path.tail.foldLeft(new File(path.head)){(a,b) => a.mkdir; new File(a,b)}.mkdir\\n\\nmkdirs(List(\\\"/path\\\", \\\"to\\\", \\\"dir\\\"))\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"cli_cmds.s7i\\\";\\n\\nconst proc: main is func\\n begin\\n doMkdirCmd(argv(PROGRAM), TRUE);\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"cli_cmds.s7i\\\";\\n\\nconst proc: main is func\\n local\\n var string: parameters is \\\"\\\";\\n begin\\n parameters := join(argv(PROGRAM), \\\" \\\");\\n doMkdir(parameters);\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"Dir.new(Dir.cwd, \\\"path\\\", \\\"to\\\", \\\"dir\\\").make_path; # works cross-platform\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"file mkdir ./path/to/dir\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"function mkdirp() { mkdir -p \\\"$1\\\"; }\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"Module Module1\\n\\n Sub Main()\\n System.IO.Directory.CreateDirectory(\\\"some/where\\\")\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"io\\\" for FileSystem\\n\\nclass Main {\\n construct new() {}\\n\\n init() {\\n FileSystem.createDirectory(\\\"path/to/dir\\\")\\n }\\n\\n update() {}\\n\\n draw(alpha) {}\\n}\\n\\nvar Game = Main.new()\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"import \\\"io\\\" for Directory\\n\\nDirectory.create(\\\"path/to/dir\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"System.cmd(\\\"mkdir -p ../foo/bar\\\")\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn mkdir(path) { System.cmd(\\\"mkdir -p \\\"+path) }\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Make-directory-path"}}},{"rowIdx":466,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Recursion\nfrom: http://rosettacode.org/wiki/Man_or_boy_test\nnote: Classic CS problems and programs\n","language":"00-META"},{"code":"<br>\n'''Background''': The '''man or boy test''' was proposed by computer scientist [[wp:Donald_Knuth|Donald Knuth]] as a means of evaluating implementations of the [[:Category:ALGOL 60|ALGOL 60]] programming language. The aim of the test was to distinguish compilers that correctly implemented \"recursion and non-local references\" from those that did not.\n\n<blockquote style=\"font-style:italic\">\n I have written the following simple routine, which may separate the 'man-compilers' from the 'boy-compilers'<br> — <span style=\"font-style:normal\">Donald Knuth</span></blockquote>\n\n'''Task''': Imitate [[#ALGOL 60 - Knuth's example|Knuth's example in Algol 60]] in another language, as far as possible. \n\n'''Details''': Local variables of routines are often kept in [http://c2.com/cgi/wiki?ActivationRecord ''activation records''] (also ''call frames''). In many languages, these records are kept on a [[System stack|call stack]]. In Algol (and e.g. in [[Smalltalk]]), they are allocated on a [[heap]] instead. Hence it is possible to pass references to routines that still can use and update variables from their call environment, even if the routine where those variables are declared already returned. This difference in implementations is sometimes called the [[wp:Funarg_problem|Funarg Problem]].\n\nIn Knuth's example, each call to ''A'' allocates an activation record for the variable ''A''. When ''B'' is called from ''A'', any access to ''k'' now refers to this activation record. Now ''B'' in turn calls ''A'', but passes itself as an argument. This argument remains bound to the activation record. This call to ''A'' also \"shifts\" the variables ''x<sub>i</sub>'' by one place, so eventually the argument ''B'' (still bound to its particular\nactivation record) will appear as ''x4'' or ''x5'' in a call to ''A''. If this happens when the expression ''x4 + x5'' is evaluated, then this will again call ''B'', which in turn will update ''k'' in the activation record it was originally bound to. As this activation record is shared with other instances of calls to ''A'' and ''B'', it will influence the whole computation.\n\nSo all the example does is to set up a convoluted calling structure, where updates to ''k'' can influence the behavior\nin completely different parts of the call tree.\n\nKnuth used this to test the correctness of the compiler, but one can of course also use it to test that other languages can emulate the Algol behavior correctly. If the handling of activation records is correct, the computed value will be −67.\n\n'''Performance and Memory''': Man or Boy is intense and can be pushed to challenge any machine. Memory (both stack and heap) not CPU time is the constraining resource as the recursion creates a proliferation activation records which will quickly exhaust memory and present itself through a stack error. Each language may have ways of adjusting the amount of memory or increasing the recursion depth. Optionally, show how you would make such adjustments.\n\nThe table below shows the result, call depths, and total calls for a range of ''k'':\n{| class=\"wikitable\" style=\"font-size: 85%\"\n! ''k''\n! 0\n! 1\n! 2\n! 3\n! 4\n! 5\n! 6\n! 7\n! 8\n! 9\n! 10\n! 11\n! 12\n! 13\n! 14\n! 15\n! 16\n! 17\n! 18\n! 19\n! 20\n! 21\n! 22\n! 23\n! 24\n! 25\n! 26\n! 27\n! 28\n! 29\n! 30\n|-\n! ''A''\n|align=\"right\"| 1\n|align=\"right\"| 0\n|align=\"right\"| -2\n|align=\"right\"| 0\n|align=\"right\"| 1\n|align=\"right\"| 0\n|align=\"right\"| 1\n|align=\"right\"| -1\n|align=\"right\"| -10\n|align=\"right\"| -30\n|align=\"right\"| -67\n|align=\"right\"| -138\n|align=\"right\"| -291\n|align=\"right\"| -642\n|align=\"right\"| -1,446\n|align=\"right\"| -3,250\n|align=\"right\"| -7,244\n|align=\"right\"| -16,065\n|align=\"right\"| -35,601\n|align=\"right\"| -78,985\n|align=\"right\"| -175,416\n|align=\"right\"| -389,695\n|align=\"right\"| -865,609\n|align=\"right\"| -1,922,362\n|align=\"right\"| -4,268,854\n|align=\"right\"| -9,479,595\n|align=\"right\"| -21,051,458\n|align=\"right\"| -46,750,171\n|align=\"right\"| -103,821,058\n|align=\"right\"| -230,560,902\n|align=\"right\"| -512,016,658\n|-\n! ''A'' called\n|align=\"right\"| 1\n|align=\"right\"| 2\n|align=\"right\"| 3\n|align=\"right\"| 4\n|align=\"right\"| 8\n|align=\"right\"| 18\n|align=\"right\"| 38\n|align=\"right\"| 80\n|align=\"right\"| 167\n|align=\"right\"| 347\n|align=\"right\"| 722\n|align=\"right\"| 1,509\n|align=\"right\"| 3,168\n|align=\"right\"| 6,673\n|align=\"right\"| 14,091\n|align=\"right\"| 29,825\n|align=\"right\"| 63,287\n|align=\"right\"| 134,652\n|align=\"right\"| 287,264\n|align=\"right\"| 614,442\n|align=\"right\"| 1,317,533\n|align=\"right\"| 2,831,900\n|align=\"right\"| 6,100,852\n|align=\"right\"| 13,172,239\n|align=\"right\"| 28,499,827\n|align=\"right\"| 61,786,266\n|align=\"right\"| 134,202,509\n|align=\"right\"| 292,011,464\n| \n| \n| \n|-\n! ''A'' depth\n|align=\"right\"| 1\n|align=\"right\"| 2\n|align=\"right\"| 3\n|align=\"right\"| 4\n|align=\"right\"| 8\n|align=\"right\"| 16\n|align=\"right\"| 32\n|align=\"right\"| 64\n|align=\"right\"| 128\n|align=\"right\"| 256\n|align=\"right\"| 512\n|align=\"right\"| 1,024\n|align=\"right\"| 2,048\n|align=\"right\"| 4,096\n|align=\"right\"| 8,192\n|align=\"right\"| 16,384\n|align=\"right\"| 32,768\n|align=\"right\"| 65,536\n|align=\"right\"| 131,072\n|align=\"right\"| 262,144\n|align=\"right\"| 524,288\n|align=\"right\"| 1,048,576\n|align=\"right\"| 2,097,152\n|align=\"right\"| 4,194,304\n|align=\"right\"| 8,388,608\n| \n| \n| \n| \n| \n| \n|-\n! ''B'' called\n|align=\"right\"| 0\n|align=\"right\"| 1\n|align=\"right\"| 2\n|align=\"right\"| 3\n|align=\"right\"| 7\n|align=\"right\"| 17\n|align=\"right\"| 37\n|align=\"right\"| 79\n|align=\"right\"| 166\n|align=\"right\"| 346\n|align=\"right\"| 721\n|align=\"right\"| 1,508\n|align=\"right\"| 3,167\n|align=\"right\"| 6,672\n|align=\"right\"| 14,090\n|align=\"right\"| 29,824\n|align=\"right\"| 63,286\n|align=\"right\"| 134,651\n|align=\"right\"| 287,263\n|align=\"right\"| 614,441\n|align=\"right\"| 1,317,532\n|align=\"right\"| 2,831,899\n|align=\"right\"| 6,100,851\n|align=\"right\"| 13,172,238\n|align=\"right\"| 28,499,826\n| \n| \n| \n| \n| \n| \n|-\n! ''B'' depth\n|align=\"right\"| 0\n|align=\"right\"| 1\n|align=\"right\"| 2\n|align=\"right\"| 3\n|align=\"right\"| 7\n|align=\"right\"| 15\n|align=\"right\"| 31\n|align=\"right\"| 63\n|align=\"right\"| 127\n|align=\"right\"| 255\n|align=\"right\"| 511\n|align=\"right\"| 1,023\n|align=\"right\"| 2,047\n|align=\"right\"| 4,095\n|align=\"right\"| 8,191\n|align=\"right\"| 16,383\n|align=\"right\"| 32,767\n|align=\"right\"| 65,535\n|align=\"right\"| 131,071\n|align=\"right\"| 262,143\n|align=\"right\"| 524,287\n|align=\"right\"| 1,048,575\n|align=\"right\"| 2,097,151\n|align=\"right\"| 4,194,303\n|align=\"right\"| 8,388,607\n| \n| \n| \n| \n| \n| \n|}\n<br>\n;Related tasks:\n* [[Jensen's Device]]\n<br>\n\n","language":"00-TASK"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\n\nprocedure Man_Or_Boy is\n function Zero return Integer is begin return 0; end Zero;\n function One return Integer is begin return 1; end One;\n function Neg return Integer is begin return -1; end Neg;\n\n function A\n ( K : Integer;\n X1, X2, X3, X4, X5 : access function return Integer\n ) return Integer is\n M : Integer := K; -- K is read-only in Ada. Here is a mutable copy of\n function B return Integer is\n begin\n M := M - 1;\n return A (M, B'Access, X1, X2, X3, X4);\n end B;\n begin\n if M <= 0 then\n return X4.all + X5.all;\n else\n return B;\n end if;\n end A;\nbegin\n Put_Line\n ( Integer'Image\n ( A\n ( 10,\n One'Access, -- Returns 1\n Neg'Access, -- Returns -1\n Neg'Access, -- Returns -1\n One'Access, -- Returns 1\n Zero'Access -- Returns 0\n ) ) );\nend Man_Or_Boy;\n","language":"Ada"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\n\nprocedure Man_Or_Boy is\n function Zero return Integer is (0);\n function One return Integer is (1);\n function Neg return Integer is (-1);\n\n function A\n (K : Integer;\n X1, X2, X3, X4, X5 : access function return Integer)\n return Integer is\n M : Integer := K; -- K is read-only in Ada. Here is a mutable copy of\n function B return Integer is\n begin\n M := M - 1;\n return A (M, B'Access, X1, X2, X3, X4);\n end B;\n begin\n return (if M <= 0 then X4.all + X5.all else B);\n end A;\nbegin\n Put_Line\n (Integer'Image\n (A (K => 10,\n X1 => One'Access,\n X2 => Neg'Access,\n X3 => Neg'Access,\n X4 => One'Access,\n X5 => Zero'Access)));\nend Man_Or_Boy;\n","language":"Ada"},{"code":"with Ada.Text_IO;\nuse Ada.Text_IO;\n\nprocedure Man_Or_Boy is\n\n function Zero return Integer is ( 0);\n function One return Integer is ( 1);\n function Neg return Integer is (-1);\n\n function A (K: Integer;\n X1, X2, X3, X4, X5: access function return Integer) return Integer is\n M : Integer := K; -- K is read-only in Ada. Here is a mutable copy of K\n Res_A: Integer;\n function B return Integer is\n begin\n M := M - 1;\n Res_A := A (M, B'Access, X1, X2, X3, X4); -- set result of A\n return Res_A;\n end B;\n begin\n if M <= 0 then\n return X4.all + X5.all;\n else\n declare\n Dummy: constant Integer := B; -- throw away\n begin\n return Res_A;\n end;\n end if;\n end A;\n\nbegin\n\n Put_Line (Integer'Image (A (K => 10,\n X1 => One 'Access,\n X2 => Neg 'Access,\n X3 => Neg 'Access,\n X4 => One 'Access,\n X5 => Zero'Access)));\n\nend Man_Or_Boy;\n","language":"Ada"},{"code":"integer\nF(list l)\n{\n l[1];\n}\n\ninteger\neval(list l)\n{\n l[0](l);\n}\n\ninteger A(list);\n\ninteger\nB(list l)\n{\n A(list(B, l[1] = l[1] - 1, l, l[-5], l[-4], l[-3], l[-2]));\n}\n\ninteger\nA(list l)\n{\n integer x;\n\n if (l[1] < 1) {\n x = eval(l[-2]) + eval(l[-1]);\n } else {\n x = B(l);\n }\n\n x;\n}\n\ninteger\nmain(void)\n{\n list f1, f0, fn1;\n\n l_append(f1, F);\n l_append(f1, 1);\n\n l_append(f0, F);\n l_append(f0, 0);\n\n l_append(fn1, F);\n l_append(fn1, -1);\n\n o_(A(list(B, 10, f1, fn1, fn1, f1, f0)), \"\\n\");\n\n 0;\n}\n","language":"Aime"},{"code":"PROC a = (INT in k, PROC INT xl, x2, x3, x4, x5) INT:(\n INT k := in k;\n PROC b = INT: a(k-:=1, b, xl, x2, x3, x4);\n ( k<=0 | x4 + x5 | b )\n);\n\ntest:(\n printf(($gl$,a(10, INT:1, INT:-1, INT:-1, INT:1, INT:0)))\n)\n","language":"ALGOL-68"},{"code":"begin\n real procedure A (integer value k; real procedure x1, x2, x3, x4, x5);\n begin\n real procedure B;\n begin k:= k - 1;\n A (k, B, x1, x2, x3, x4)\n end;\n if k <= 0 then x4 + x5 else B\n end;\n write (r_format := \"A\", r_w := 8, r_d := 2, A (10, 1, -1, -1, 1, 0))\nend.\n","language":"ALGOL-W"},{"code":"on a(k, x1, x2, x3, x4, x5)\n\tscript b\n\t\tset k to k - 1\n\t\treturn a(k, b, x1, x2, x3, x4)\n\tend script\n\tif k ≤ 0 then\n\t\treturn (run x4) + (run x5)\n\telse\n\t\treturn (run b)\n\tend if\nend a\n\non int(x)\n\tscript s\n\t\treturn x\n\tend script\n\treturn s\nend int\n\na(10, int(1), int(-1), int(-1), int(1), int(0))\n","language":"AppleScript"},{"code":" HIMEM = PAGE + 200000000 : REM Increase recursion depth\n\n FOR k% = 0 TO 20\n PRINT FNA(k%, ^FN1(), ^FN_1(), ^FN_1(), ^FN1(), ^FN0())\n NEXT\n END\n\n DEF FNA(k%, x1%, x2%, x3%, x4%, x5%)\n IF k% <= 0 THEN = FN(x4%)(x4%) + FN(x5%)(x5%)\n LOCAL b{}\n DIM b{fn%, k%, x1%, x2%, x3%, x4%, x5%}\n b.fn% = !^FNB()\n b.k% = k%\n b.x1% = x1%\n b.x2% = x2%\n b.x3% = x3%\n b.x4% = x4%\n b.x5% = x5%\n DEF FNB(!(^b{}+4))\n b.k% -= 1\n = FNA(b.k%, b{}, b.x1%, b.x2%, b.x3%, b.x4%)\n\n DEF FN0(d%) = 0\n DEF FN1(d%) = 1\n DEF FN_1(d%) = -1\n","language":"BBC-BASIC"},{"code":"/* man-or-boy.c */\n#include <stdio.h>\n#include <stdlib.h>\n\n// --- thunks\ntypedef struct arg\n{\n int (*fn)(struct arg*);\n int *k;\n struct arg *x1, *x2, *x3, *x4, *x5;\n} ARG;\n\n// --- lambdas\nint f_1 (ARG* _) { return -1; }\nint f0 (ARG* _) { return 0; }\nint f1 (ARG* _) { return 1; }\n\n// --- helper\nint eval(ARG* a) { return a->fn(a); }\n#define MAKE_ARG(...) (&(ARG){__VA_ARGS__})\n#define FUN(...) MAKE_ARG(B, &k, __VA_ARGS__)\n\nint A(ARG*);\n\n// --- functions\nint B(ARG* a)\n{\n int k = *a->k -= 1;\n return A(FUN(a, a->x1, a->x2, a->x3, a->x4));\n}\n\nint A(ARG* a)\n{\n return *a->k <= 0 ? eval(a->x4) + eval(a->x5) : B(a);\n}\n\nint main(int argc, char **argv)\n{\n int k = argc == 2 ? strtol(argv[1], 0, 0) : 10;\n printf(\"%d\\n\", A(FUN(MAKE_ARG(f1), MAKE_ARG(f_1), MAKE_ARG(f_1),\n MAKE_ARG(f1), MAKE_ARG(f0))));\n return 0;\n}\n","language":"C"},{"code":"#include <stdio.h>\n#define INT(body) ({ int lambda(){ body; }; lambda; })\nmain(){\n int a(int k, int xl(), int x2(), int x3(), int x4(), int x5()){\n int b(){\n return a(--k, b, xl, x2, x3, x4);\n }\n return k<=0 ? x4() + x5() : b();\n }\n printf(\" %d\\n\",a(10, INT(return 1), INT(return -1), INT(return -1), INT(return 1), INT(return 0)));\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n\ntypedef struct frame\n{\n int (*fn)(struct frame*);\n union { int constant; int* k; } u;\n struct frame *x1, *x2, *x3, *x4, *x5;\n} FRAME;\n\nFRAME* Frame(FRAME* f, int* k, FRAME* x1, FRAME* x2, FRAME *x3, FRAME *x4, FRAME *x5)\n{\n f->u.k = k;\n f->x1 = x1;\n f->x2 = x2;\n f->x3 = x3;\n f->x4 = x4;\n f->x5 = x5;\n return f;\n}\n\nint F(FRAME* a) { return a->u.constant; }\n\nint eval(FRAME* a) { return a->fn(a); }\n\nint A(FRAME*);\n\nint B(FRAME* a)\n{\n int k = (*a->u.k -= 1);\n FRAME b = { B };\n return A(Frame(&b, &k, a, a->x1, a->x2, a->x3, a->x4));\n}\n\nint A(FRAME* a)\n{\n return *a->u.k <= 0 ? eval(a->x4) + eval(a->x5) : B(a);\n}\n\nint main(int argc, char** argv)\n{\n int k = argc == 2 ? strtol(argv[1], 0, 0) : 10;\n FRAME a = { B }, f1 = { F, { 1 } }, f0 = { F, { 0 } }, fn1 = { F, { -1 } };\n\n printf(\"%d\\n\", A(Frame(&a, &k, &f1, &fn1, &fn1, &f1, &f0)));\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <tr1/memory>\nusing std::tr1::shared_ptr;\nusing std::tr1::enable_shared_from_this;\n\nstruct Arg {\n virtual int run() = 0;\n virtual ~Arg() { };\n};\n\nint A(int, shared_ptr<Arg>, shared_ptr<Arg>, shared_ptr<Arg>,\n shared_ptr<Arg>, shared_ptr<Arg>);\n\nclass B : public Arg, public enable_shared_from_this<B> {\nprivate:\n int k;\n const shared_ptr<Arg> x1, x2, x3, x4;\n\npublic:\n B(int _k, shared_ptr<Arg> _x1, shared_ptr<Arg> _x2, shared_ptr<Arg> _x3,\n shared_ptr<Arg> _x4)\n : k(_k), x1(_x1), x2(_x2), x3(_x3), x4(_x4) { }\n int run() {\n return A(--k, shared_from_this(), x1, x2, x3, x4);\n }\n};\n\nclass Const : public Arg {\nprivate:\n const int x;\npublic:\n Const(int _x) : x(_x) { }\n int run () { return x; }\n};\n\nint A(int k, shared_ptr<Arg> x1, shared_ptr<Arg> x2, shared_ptr<Arg> x3,\n shared_ptr<Arg> x4, shared_ptr<Arg> x5) {\n if (k <= 0)\n return x4->run() + x5->run();\n else {\n shared_ptr<Arg> b(new B(k, x1, x2, x3, x4));\n return b->run();\n }\n}\n\nint main() {\n std::cout << A(10, shared_ptr<Arg>(new Const(1)),\n shared_ptr<Arg>(new Const(-1)),\n shared_ptr<Arg>(new Const(-1)),\n shared_ptr<Arg>(new Const(1)),\n shared_ptr<Arg>(new Const(0))) << std::endl;\n return 0;\n}\n","language":"C++"},{"code":"#include <functional>\n#include <iostream>\n\ntypedef std::function<int()> F;\n\nstatic int A(int k, const F &x1, const F &x2, const F &x3, const F &x4, const F &x5)\n{\n\tF B = [=, &k, &B]\n\t{\n\t\treturn A(--k, B, x1, x2, x3, x4);\n\t};\n\n\treturn k <= 0 ? x4() + x5() : B();\n}\n\nstatic F L(int n)\n{\n\treturn [n] { return n; };\n}\n\nint main()\n{\n\tstd::cout << A(10, L(1), L(-1), L(-1), L(1), L(0)) << std::endl;\n\treturn 0;\n}\n","language":"C++"},{"code":"#include <tr1/functional>\n#include <iostream>\n\ntypedef std::tr1::function<int()> F;\n\nstatic int A(int k, const F &x1, const F &x2, const F &x3, const F &x4, const F &x5);\n\nstruct B_class {\n int &k;\n const F x1, x2, x3, x4;\n B_class(int &_k, const F &_x1, const F &_x2, const F &_x3, const F &_x4) :\n k(_k), x1(_x1), x2(_x2), x3(_x3), x4(_x4) { }\n int operator()() const { return A(--k, *this, x1, x2, x3, x4); }\n};\n\nstatic int A(int k, const F &x1, const F &x2, const F &x3, const F &x4, const F &x5)\n{\n F B = B_class(k, x1, x2, x3, x4);\n return k <= 0 ? x4() + x5() : B();\n}\n\nstruct L {\n const int n;\n L(int _n) : n(_n) { }\n int operator()() const { return n; }\n};\n\nint main()\n{\n std::cout << A(10, L(1), L(-1), L(-1), L(1), L(0)) << std::endl;\n return 0;\n}\n","language":"C++"},{"code":"using System;\n\ndelegate T Func<T>();\n\nclass ManOrBoy\n{\n static void Main()\n {\n Console.WriteLine(A(10, C(1), C(-1), C(-1), C(1), C(0)));\n }\n\n static Func<int> C(int i)\n {\n return delegate { return i; };\n }\n\n static int A(int k, Func<int> x1, Func<int> x2, Func<int> x3, Func<int> x4, Func<int> x5)\n {\n Func<int> b = null;\n b = delegate { k--; return A(k, b, x1, x2, x3, x4); };\n return k <= 0 ? x4() + x5() : b();\n }\n}\n","language":"C-sharp"},{"code":"using System;\n\nclass ManOrBoy\n{\n static void Main()\n {\n Console.WriteLine(A(10, () => 1, () => -1, () => -1, () => 1, () => 0));\n }\n\n static int A(int k, Func<int> x1, Func<int> x2, Func<int> x3, Func<int> x4, Func<int> x5)\n {\n Func<int> b = null;\n b = () => { k--; return A(k, b, x1, x2, x3, x4); };\n return k <= 0 ? x4() + x5() : b();\n }\n}\n","language":"C-sharp"},{"code":"Procedure Main()\n Local k\n For k := 0 to 20\n ? \"A(\", k, \", 1, -1, -1, 1, 0) =\", A(k, 1, -1, -1, 1, 0)\n Next\nReturn\n\nStatic Function A(k, x1, x2, x3, x4, x5)\n Local ARetVal\n Local B := {|| --k, ARetVal := A(k, B, x1, x2, x3, x4) }\n If k <= 0\n ARetVal := Evaluate(x4) + Evaluate(x5)\n Else\n B:Eval()\n Endif\nReturn ARetVal\n\nStatic Function Evaluate(x)\n Local xVal\n If ValType(x) == \"B\"\n xVal := x:Eval()\n Else\n xVal := x\n Endif\nReturn xVal\n","language":"Clipper"},{"code":"(declare a)\n\n(defn man-or-boy\n \"Man or boy test for Clojure\"\n [k]\n (let [k (atom k)]\n (a k\n (fn [] 1)\n (fn [] -1)\n (fn [] -1)\n (fn [] 1)\n (fn [] 0))))\n\n(defn a\n [k x1 x2 x3 x4 x5]\n (let [k (atom @k)]\n (letfn [(b []\n (swap! k dec)\n (a k b x1 x2 x3 x4))]\n (if (<= @k 0)\n (+ (x4) (x5))\n (b)))))\n\n(man-or-boy 10)\n","language":"Clojure"},{"code":"(defun man-or-boy (x)\n (a x (lambda () 1)\n (lambda () -1)\n (lambda () -1)\n (lambda () 1)\n (lambda () 0)))\n\n(defun a (k x1 x2 x3 x4 x5)\n (labels ((b ()\n (decf k)\n (a k #'b x1 x2 x3 x4)))\n (if (<= k 0)\n (+ (funcall x4) (funcall x5))\n (b))))\n\n(man-or-boy 10)\n","language":"Common-Lisp"},{"code":"def a(k, x1, x2, x3, x4, x5)\n b = uninitialized -> typeof(k)\n b = ->() { k -= 1; a(k, b, x1, x2, x3, x4) }\n k <= 0 ? x4.call + x5.call : b.call\nend\n\nputs a(10, -> {1}, -> {-1}, -> {-1}, -> {1}, -> {0})\n","language":"Crystal"},{"code":"import core.stdc.stdio: printf;\n\nint a(int k, const lazy int x1, const lazy int x2, const lazy int x3,\n const lazy int x4, const lazy int x5) pure {\n int b() {\n k--;\n return a(k, b(), x1, x2, x3, x4);\n }\n return k <= 0 ? x4 + x5 : b();\n}\n\nvoid main() {\n printf(\"%d\\n\", a(10, 1, -1, -1, 1, 0));\n}\n","language":"D"},{"code":"int A(int k, int delegate() nothrow @safe[] x...) nothrow @safe {\n int b() nothrow @safe {\n k--;\n return A(k, &b, x[0], x[1], x[2], x[3]);\n }\n\n return (k > 0) ? b() : x[3]() + x[4]();\n}\n\nvoid main() {\n import std.stdio;\n\n A(10, 1, -1, -1, 1, 0).writeln;\n}\n","language":"D"},{"code":"auto mb(T)(T mob) nothrow @safe { // Embeding function.\n int b() nothrow @safe @nogc {\n static if (is(T == int))\n return mob;\n else\n return mob();\n }\n\n return &b;\n}\n\nint A(T)(int k, T x1, T x2, T x3, T x4, T x5) nothrow @safe {\n static if (is(T == int)) {\n return A(k, mb(x1), mb(x2), mb(x3), mb(x4), mb(x5));\n } else {\n int b() nothrow @safe {\n k--;\n return A(k, &b, x1, x2, x3, x4);\n }\n return (k <= 0) ? x4() + x5() : b();\n }\n}\n\nvoid main() {\n import std.stdio;\n\n A(10, 1, -1, -1, 1, 0).writeln;\n}\n","language":"D"},{"code":"import std.stdio;\n\ninterface B {\n int run();\n}\n\nint A(int k, int x1, int x2, int x3, int x4, int x5) {\n B mb(int a) {\n return new class() B {\n int run() {\n return a;\n }\n };\n }\n\n return A(k, mb(x1), mb(x2), mb(x3), mb(x4), mb(x5));\n}\n\nint A(int k, B x1, B x2, B x3, B x4, B x5) {\n if (k <= 0) {\n return x4.run() + x5.run();\n } else {\n return (new class() B {\n int m;\n\n this() {\n this.m = k;\n }\n\n int run() {\n m--;\n return A(m, this, x1, x2, x3, x4);\n }\n }).run();\n }\n}\n\nvoid main() {\n writeln(A(10, 1, -1, -1, 1, 0));\n}\n","language":"D"},{"code":"import std.bigint, std.functional;\n\n// Adapted from C code by Goran Weinholt, adapted from Knuth code.\nBigInt A(in int k, in int x1, in int x2, in int x3,\n in int x4, in int x5) {\n static struct Inner {\n static BigInt c1_(in int k) {\n if (k > 5)\n return c1(k - 1) + c2(k - 1);\n static immutable t = [0, 0, 0, 1, 2, 3];\n return t[k].BigInt;\n }\n alias c1 = memoize!c1_;\n\n static BigInt c2_(in int k) {\n if (k > 5)\n return c2(k - 1) + c3(k - 1);\n static immutable t = [0, 0, 1, 1, 1, 2];\n return t[k].BigInt;\n }\n alias c2 = memoize!c2_;\n\n static BigInt c3_(in int k) {\n if (k > 5)\n return c3(k - 1) + c4(k);\n static immutable t = [0, 1, 1, 0, 0, 1];\n return t[k].BigInt;\n }\n alias c3 = memoize!c3_;\n\n static BigInt c4_(in int k) {\n if (k > 5)\n return c1(k - 1) + c4(k - 1) - 1;\n static immutable t = [1, 1, 0, 0, 0, 0];\n return t[k].BigInt;\n }\n alias c4 = memoize!c4_;\n\n static int c5(in int k) pure nothrow {\n return !!k;\n }\n }\n\n with (Inner)\n return c1(k) * x1 + c2(k) * x2 + c3(k) * x3 +\n c4(k) * x4 + c5(k) * x5;\n}\n\nvoid main() {\n import std.stdio, std.conv, std.range;\n\n foreach (immutable i; 0 .. 40)\n writeln(i, \" \", A(i, 1, -1, -1, 1, 0));\n\n writefln(\"...\\n500 %-(%s\\\\\\n %)\",\n A(500, 1, -1, -1, 1, 0).text.chunks(60));\n}\n","language":"D"},{"code":"type\n TFunc<T> = reference to function: T;\n\nfunction C(x: Integer): TFunc<Integer>;\nbegin\n Result := function: Integer\n begin\n Result := x;\n end;\nend;\n\nfunction A(k: Integer; x1, x2, x3, x4, x5: TFunc<Integer>): Integer;\nvar\n b: TFunc<Integer>;\nbegin\n b := function: Integer\n begin\n Dec(k);\n Result := A(k, b, x1, x2, x3, x4);\n end;\n if k <= 0 then\n Result := x4 + x5\n else\n Result := b;\nend;\n\nbegin\n Writeln(A(10, C(1), C(-1), C(-1), C(1), C(0))); // -67 output\nend.\n","language":"Delphi"},{"code":"func _C(i) {\n () => i\n}\n\nfunc _A(k, x1, x2, x3, x4, x5) {\n var b\n b = () => {\n k -= 1\n _A(k, b, x1, x2, x3, x4)\n }\n if k <= 0 {\n x4() + x5()\n } else {\n b()\n }\n}\n\nfor i in 1..20 {\n let res = _A(i, _C(1), _C(-1), _C(-1), _C(1), _C(0))\n print(\"\\(i)\\t= \\(res)\")\n}\n","language":"Dyalect"},{"code":"define method a\n (k :: <integer>, x1 :: <function>, x2 :: <function>, x3 :: <function>,\n x4 :: <function>, x5 :: <function>)\n => (i :: <integer>)\n\n local b() => (i :: <integer>)\n k := k - 1;\n a(k, b, x1, x2, x3, x4)\n end;\n\n if (k <= 0) x4() + x5() else b() end if\n\nend method a;\n\ndefine method man-or-boy\n (x :: <integer>)\n => (i :: <integer>)\n\n a(x, method() 1 end,\n method() -1 end,\n method() -1 end,\n method() 1 end,\n method() 0 end)\n\nend method man-or-boy;\n\nformat-out(\"%d\\n\", man-or-boy(10))\n","language":"Dylan"},{"code":"def a(var k, &x1, &x2, &x3, &x4, &x5) {\n def bS; def &b := bS\n bind bS {\n to get() {\n k -= 1\n return a(k, &b, &x1, &x2, &x3, &x4)\n }\n }\n return if (k <= 0) { x4 + x5 } else { b }\n}\n\ndef p := 1\ndef n := -1\ndef z := 0\nprintln(a(10, &p, &n, &n, &p, &z))\n","language":"E"},{"code":";; copied from Scheme\n(define (A k x1 x2 x3 x4 x5)\n (define (B)\n (set! k (- k 1))\n (A k B x1 x2 x3 x4))\n (if (<= k 0)\n (+ (x4) (x5))\n (B)))\n\n(A 10 (lambda () 1) (lambda () -1) (lambda () -1) (lambda () 1) (lambda () 0))\n → -67\n(A 13 (lambda () 1) (lambda () -1) (lambda () -1) (lambda () 1) (lambda () 0))\n → -642\n(A 14 ..)\n❗ InternalError : too much recursion - JS internal error (please, report it)-\n → stack overflow using FireFox\n","language":"EchoLisp"},{"code":"open monad io unsafe.cell unsafe.console\n\nliftM2 f m1 m2 = do\n x1 <- m1\n x2 <- m2\n return (f x1 x2)\n\na k x1 x2 x3 x4 x5 = do\n r <- return $ ref k\n let b = & do k <- return $ pred (valueof r)\n a k b x1 x2 x3 x4\n if k <= 0 then liftM2 (+) x4 x5 else b\n\n_ = a 10 (!!1) (!! -1) (!! -1) (!!1) (!!0) >>= (putStr << show) ::: IO\n where (!!) f = & return f ::: IO\n","language":"Ela"},{"code":"import extensions;\n\nA(k,x1,x2,x3,x4,x5)\n{\n var m := new ref<int>(k);\n\n var b := { m -= 1; ^ A(m,this self,x1,x2,x3,x4) };\n\n if (m <= 0)\n {\n ^ x4() + x5()\n }\n else\n {\n ^ b()\n }\n}\n\npublic program()\n{\n for(int n := 0; n <= 14; n += 1)\n {\n console.printLine(A(n,{^1},{^-1},{^-1},{^1},{^0}))\n }\n}\n","language":"Elena"},{"code":"fun A = int by int k, fun x1, fun x2, fun x3, fun x4, fun x5\n fun B = int by block do return A(--k, B, x1, x2, x3, x4) end\n return when(k <= 0, x4() + x5(), B())\nend\nfun C = fun by int i\n return int by block do return i end\nend\nfor int i = 0; i <= 11; i++\n writeLine(\"A(\" + i + \") = \" + A(i, C(1), C(-1), C(-1), C(1), C(0) ))\nend\n","language":"EMal"},{"code":"[<EntryPoint>]\nlet main (args : string[]) =\n let k = int(args.[0])\n\n let l x = fun() -> x\n\n let rec a k x1 x2 x3 x4 x5 =\n if k <= 0 then\n x4() + x5()\n else\n let k = ref k\n let rec b() =\n k := !k - 1\n a !k b x1 x2 x3 x4\n b()\n\n a k (l 1) (l -1) (l -1) (l 1) (l 0)\n |> printfn \"%A\"\n\n 0\n","language":"F-Sharp"},{"code":"type Tramp<'t> =\n | Delay of (unit -> Tramp<'t>)\n | Bind of Tramp<'t> * ('t -> Tramp<'t>)\n | Return of 't\n | ReturnFrom of Tramp<'t>\n\ntype Tramp() =\n member this.Delay(f) = Delay f\n member this.Bind(x, f) = Bind(x, f)\n member this.Return(x) = Return x\n member this.ReturnFrom(x) = ReturnFrom x\n\nlet tramp = Tramp()\n\nlet run (tr : Tramp<'t>) =\n let rec loop tr stack =\n match tr with\n | Delay f -> loop (f()) stack\n | Bind(x, f) -> loop x (f :: stack)\n | Return x ->\n match stack with\n | [] -> x\n | f :: stack' -> loop (f x) stack'\n | ReturnFrom tr -> loop tr stack\n loop tr []\n\n[<EntryPoint>]\nlet main (args : string[]) =\n let k = int(args.[0])\n\n let l x = fun() -> Return x\n\n tramp {\n let rec a k x1 x2 x3 x4 x5 =\n tramp {\n if k <= 0 then\n let! x4' = x4()\n let! x5' = x5()\n return x4' + x5'\n else\n let k = ref k\n let rec b() =\n tramp {\n k := !k - 1\n return! a !k b x1 x2 x3 x4\n }\n return! b()\n }\n\n return! a k (l 1) (l -1) (l -1) (l 1) (l 0)\n }\n |> run\n |> printfn \"%A\"\n\n 0\n","language":"F-Sharp"},{"code":"[<EntryPoint>]\nlet main (args : string[]) =\n let k = int(args.[0])\n\n let l x cont = cont x\n\n let rec a k x1 x2 x3 x4 x5 cont =\n if k <= 0 then\n x4 (fun n4 -> x5 (fun n5 -> cont (n4+n5)))\n else\n let mutable k = k\n let rec b cont =\n k <- k - 1\n a k b x1 x2 x3 x4 cont\n b cont\n\n a k (l 1) (l -1) (l -1) (l 1) (l 0) (printfn \"%d\")\n\n 0\n","language":"F-Sharp"},{"code":"class ManOrBoy\n{\n Void main()\n {\n echo(A(10, |->Int|{1}, |->Int|{-1}, |->Int|{-1}, |->Int|{1}, |->Int|{0}));\n }\n\n static Int A(Int k, |->Int| x1, |->Int| x2, |->Int| x3, |->Int| x4, |->Int| x5)\n {\n |->Int|? b\n b = |->Int| { k--; return A(k, b, x1, x2, x3, x4) }\n return k <= 0 ? x4() + x5() : b()\n }\n}\n","language":"Fantom"},{"code":": A {: w^ k x1 x2 x3 xt: x4 xt: x5 | w^ B :} recursive\n k @ 0<= IF x4 x5 f+ ELSE\n B k x1 x2 x3 action-of x4 [{: B k x1 x2 x3 x4 :}L\n -1 k +!\n k @ B @ x1 x2 x3 x4 A ;] dup B !\n execute THEN ;\n10 [: 1e ;] [: -1e ;] 2dup swap [: 0e ;] A f.\n","language":"Forth"},{"code":"module man_or_boy\n\nimplicit none\n\ncontains\n\n recursive integer function A(k,x1,x2,x3,x4,x5) result(res)\n integer, intent(in) :: k\n interface\n recursive integer function x1()\n end function\n recursive integer function x2()\n end function\n recursive integer function x3()\n end function\n recursive integer function x4()\n end function\n recursive integer function x5()\n end function\n end interface\n integer :: m\n if ( k <= 0 ) then\n res = x4()+x5()\n else\n m = k\n res = B()\n end if\n\n contains\n\n recursive integer function B() result(res)\n m = m-1\n res = A(m,B,x1,x2,x3,x4)\n end function B\n\n end function A\n\n\n recursive integer function one() result(res)\n res = 1\n end function\n\n recursive integer function minus_one() result(res)\n res = -1\n end function\n\n recursive integer function zero() result(res)\n res = 0\n end function\n\nend module man_or_boy\n\nprogram test\n use man_or_boy\n write (*,*) A(10,one,minus_one,minus_one,one,zero)\nend program test\n","language":"Fortran"},{"code":"package main\nimport \"fmt\"\n\nfunc a(k int, x1, x2, x3, x4, x5 func() int) int {\n\tvar b func() int\n\tb = func() int {\n\t\tk--\n\t\treturn a(k, b, x1, x2, x3, x4)\n\t}\n\tif k <= 0 {\n\t\treturn x4() + x5()\n\t}\n\treturn b()\n}\n\nfunc main() {\n\tx := func(i int) func() int { return func() int { return i } }\n\tfmt.Println(a(10, x(1), x(-1), x(-1), x(1), x(0)))\n}\n","language":"Go"},{"code":"package main\n\nimport \"fmt\"\n\nfunc A(k int, x1, x2, x3, x4, x5 func() int) (a int) {\n\tvar B func() int\n\tB = func() (b int) {\n\t\tk--\n\t\ta = A(k, B, x1, x2, x3, x4)\n\t\tb = a\n\t\treturn\n\t}\n\tif k <= 0 {\n\t\ta = x4() + x5()\n\t} else {\n\t\t_ = B()\n\t}\n\treturn\n}\n\nfunc main() {\n\tK := func(x int) func() int { return func() int { return x } }\n\tfmt.Println(A(10, K(1), K(-1), K(-1), K(1), K(0)))\n}\n","language":"Go"},{"code":"package main\n\nimport \"fmt\"\n\nfunc eval(v interface{}) int {\n\tswitch v := v.(type) {\n\tcase int:\n\t\treturn v\n\tcase func() int:\n\t\treturn v()\n\t}\n\tpanic(\"bad type\")\n\treturn 0\n}\n\nfunc A(k int, x1, x2, x3, x4, x5 interface{}) (a int) {\n\tvar B func() int\n\tB = func() (b int) {\n\t\tk--\n\t\ta = A(k, B, x1, x2, x3, x4)\n\t\tb = a\n\t\treturn\n\t}\n\tif k <= 0 {\n\t\ta = eval(x4) + eval(x5)\n\t} else {\n\t\t_ = B()\n\t}\n\treturn\n}\n\nfunc main() {\n\tfmt.Println(A(10, 1, -1, -1, 1, 0))\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/big\"\n)\n\nfunc A(k int) *big.Int {\n if k < 6 {\n var x1, x2, x3, x4 int64 = 1, -1, -1, 1\n c1 := []int64{0, 0, 0, 1, 2, 3}[k]\n c2 := []int64{0, 0, 1, 1, 1, 2}[k]\n c3 := []int64{0, 1, 1, 0, 0, 1}[k]\n c4 := []int64{1, 1, 0, 0, 0, 0}[k]\n t := c1*x1 + c2*x2 + c3*x3 + c4*x4\n return big.NewInt(t)\n }\n one := big.NewInt(1)\n c0 := big.NewInt(3)\n c1 := big.NewInt(2)\n c2 := big.NewInt(1)\n c3 := big.NewInt(0)\n for j := 5; j < k; j++ {\n c3.Sub(c3.Add(c3, c0), one)\n c0.Add(c0, c1)\n c1.Add(c1, c2)\n c2.Add(c2, c3)\n }\n return c0.Add(c0.Sub(c0.Sub(c0, c1), c2), c3)\n}\n\nfunc p(k int) {\n fmt.Printf(\"A(%d) = \", k)\n if s := A(k).String(); len(s) < 60 {\n fmt.Println(s)\n } else {\n fmt.Printf(\"%s...%s (%d digits)\\n\",\n s[:6], s[len(s)-5:], len(s)-1)\n }\n}\n\nfunc main() {\n for i := 0; i < 40; i++ {\n p(i)\n }\n p(500)\n p(10000)\n p(1e6)\n}\n","language":"Go"},{"code":"function A(in_k: int, x1(): int, x2(): int, x3(): int, x4(): int, x5(): int): int {\n var k = in_k\n var B(): int // B is a function variable\n B = \\ -> {\n k = k-1;\n return A(k, B, x1, x2, x3, x4)\n }\n return k<=0 ? x4()+x5() : B()\n}\nprint(A(10, \\ -> 1, \\ -> -1, \\ -> -1, \\ -> 1, \\ -> 0))\n","language":"Gosu"},{"code":"def a; a = { k, x1, x2, x3, x4, x5 ->\n def b; b = {\n a (--k, b, x1, x2, x3, x4)\n }\n k <= 0 ? x4() + x5() : b()\n}\n\ndef x = { n -> { it -> n } }\n","language":"Groovy"},{"code":"println (a(10, x(1), x(-1), x(-1), x(1), x(0)))\n","language":"Groovy"},{"code":"(0..20).each { k ->\n printf (\"%3d: %7d\\n\", k, a(k, x(1), x(-1), x(-1), x(1), x(0)))\n}\n","language":"Groovy"},{"code":"import Data.IORef (modifyIORef, newIORef, readIORef)\n\na\n :: (Enum a, Num b, Num a, Ord a)\n => a -> IO b -> IO b -> IO b -> IO b -> IO b -> IO b\na k x1 x2 x3 x4 x5 = do\n r <- newIORef k\n let b = do\n k <- pred ! r\n a k b x1 x2 x3 x4\n if k <= 0\n then (+) <$> x4 <*> x5\n else b\n where\n f !r = modifyIORef r f >> readIORef r\n\nmain :: IO ()\nmain = a 10 # 1 # (-1) # (-1) # 1 # 0 >>= print\n where\n ( # ) f = f . return\n","language":"Haskell"},{"code":"record mutable(value) # we need mutable integers\n # ... be obvious when we break normal scope rules\nprocedure main(arglist) # supply the initial k value\nk := integer(arglist[1])|10 # .. or default to 10=default\nwrite(\"Man or Boy = \", A( k, 1, -1, -1, 1, 0 ) )\nend\n\nprocedure eval(ref) # evaluator to distinguish between a simple value and a code reference\nreturn if type(ref) == \"co-expression\" then @ref else ref\nend\n\nprocedure A(k,x1,x2,x3,x4,x5) # Knuth's A\nk := mutable(k) # make k mutable for B\nreturn if k.value <= 0 then # -> boy compilers may recurse and die here\n eval(x4) + eval(x5) # the crux of separating man .v. boy compilers\nelse # -> boy compilers can run into trouble at k=5+\n B(k,x1,x2,x3,x4,x5)\nend\n\nprocedure B(k,x1,x2,x3,x4,x5) # Knuth's B\nk.value -:= 1 # diddle A's copy of k\nreturn A(k.value, create |B(k,x1,x2,x3,x4,x5),x1,x2,x3,x4) # call A with a new k and 5 x's\nend\n","language":"Icon"},{"code":"record defercall(proc,arglist) # light weight alternative to co-expr for MoB\n\nprocedure eval(ref) # evaluator to distinguish between a simple value and a code reference\nreturn if type(ref) == \"defercall\" then ref.proc!ref.arglist else ref\nend\n\nprocedure B(k,x1,x2,x3,x4,x5) # Knuth's B\nk.value -:= 1 # diddle A's copy of k\nreturn A(k.value, defercall(B,[k,x1,x2,x3,x4,x5]),x1,x2,x3,x4)# call A with a new k and 5 x's\nend\n","language":"Icon"},{"code":"Range\n\na := method(k, xs,\n b := block(\n k = k -1\n a(k, list(b, xs slice(0,4)) flatten))\n if(k <= 0,\n (xs at(3) call) + (xs at(4) call),\n b call))\n\nf := method(x, block(x))\n1 to(500) foreach(k,\n (k .. \" \") print\n a(k, list(1, -1, -1, 1, 0) map (x, f(x))) println)\n","language":"Io"},{"code":"A=:4 :0\n L=.cocreate'' NB. L is context where names are defined.\n k__L=:x\n '`x1__L x2__L x3__L x4__L x5__L'=:y\n if.k__L<:0 do.a__L=:(x4__L + x5__L)f.'' else. L B '' end.\n (coerase L)]]]a__L\n)\n\nB=:4 :0\n L=.x\n k__L=:k__L-1\n a__L=:k__L A L&B`(x1__L f.)`(x2__L f.)`(x3__L f.)`(x4__L f.)\n)\n","language":"J"},{"code":" 10 A 1:`_1:`_1:`1:`0:\n_67\n","language":"J"},{"code":"import java.util.function.DoubleSupplier;\n\npublic class ManOrBoy {\n\n static double A(int k, DoubleSupplier x1, DoubleSupplier x2,\n DoubleSupplier x3, DoubleSupplier x4, DoubleSupplier x5) {\n\n DoubleSupplier B = new DoubleSupplier() {\n int m = k;\n public double getAsDouble() {\n return A(--m, this, x1, x2, x3, x4);\n }\n };\n\n return k <= 0 ? x4.getAsDouble() + x5.getAsDouble() : B.getAsDouble();\n }\n\n public static void main(String[] args) {\n System.out.println(A(10, () -> 1.0, () -> -1.0, () -> -1.0, () -> 1.0, () -> 0.0));\n }\n}\n","language":"Java"},{"code":"public class ManOrBoy {\n interface Arg {\n public int run();\n }\n\n public static int A(final int k, final Arg x1, final Arg x2,\n final Arg x3, final Arg x4, final Arg x5) {\n if (k <= 0)\n return x4.run() + x5.run();\n return new Arg() {\n int m = k;\n public int run() {\n m--;\n return A(m, this, x1, x2, x3, x4);\n }\n }.run();\n }\n public static Arg C(final int i) {\n return new Arg() {\n public int run() { return i; }\n };\n }\n\n public static void main(String[] args) {\n System.out.println(A(10, C(1), C(-1), C(-1), C(1), C(0)));\n }\n}\n","language":"Java"},{"code":"function a(k, x1, x2, x3, x4, x5) {\n function b() {\n k -= 1;\n return a(k, b, x1, x2, x3, x4);\n }\n return (k > 0) ? b() : x4() + x5();\n}\n\n// this uses lambda wrappers around the numeric arguments\nfunction x(n) {\n return function () {\n return n;\n };\n}\nalert(a(10, x(1), x(-1), x(-1), x(1), x(0)));\n","language":"JavaScript"},{"code":"var x = n => () => n;\n\nvar a = (k, x1, x2, x3, x4, x5) => {\n var b = () => a(--k, b, x1, x2, x3, x4); //decrement k before use\n return (k > 0) ? b() : x4() + x5();\n};\n","language":"JavaScript"},{"code":"/* Knuth's Man or boy test (local references in recursion), in Jsish */\n/* As noted, needs a fair sized stack depth, default is 200 in jsish v2.8.24 */\nInterp.conf({maxDepth:2048});\n\nfunction a(k, x1, x2, x3, x4, x5) {\n function b() {\n k -= 1;\n return a(k, b, x1, x2, x3, x4);\n }\n return (k > 0) ? b() : x4() + x5();\n}\n\n// this uses lambda wrappers around the numeric arguments\nfunction x(n) {\n return function () {\n return n;\n };\n}\n\nputs(a(10, x(1), x(-1), x(-1), x(1), x(0)));\n\n/*\n=!EXPECTSTART!=\n-67\n=!EXPECTEND!=\n*/\n","language":"Jsish"},{"code":"function a(k, x1, x2, x3, x4, x5)\n b = ()-> a(k-=1, b, x1, x2, x3, x4);\n k <= 0 ? (x4() + x5()) : b();\nend\n\nprintln(a(10, ()->1, ()->-1, ()->-1, ()->1, ()->0));\n","language":"Julia"},{"code":"// version 1.1.3\n\ntypealias Func = () -> Int\n\nfun a(k: Int, x1: Func, x2: Func, x3: Func, x4: Func, x5: Func): Int {\n var kk = k\n fun b(): Int = a(--kk, ::b, x1, x2, x3, x4)\n return if (kk <= 0) x4() + x5() else b()\n}\n\nfun main(args: Array<String>) {\n println(\" k a\")\n for (k in 0..12) {\n println(\"${\"%2d\".format(k)}: ${a(k, { 1 }, { -1 }, { -1 }, { 1 }, { 0 })}\")\n }\n}\n","language":"Kotlin"},{"code":"function a(k,x1,x2,x3,x4,x5)\n local function b()\n k = k - 1\n return a(k,b,x1,x2,x3,x4)\n end\n if k <= 0 then return x4() + x5() else return b() end\nend\n\nfunction K(n)\n return function()\n return n\n end\nend\n\nprint(a(10, K(1), K(-1), K(-1), K(1), K(0)))\n","language":"Lua"},{"code":"$RecursionLimit = 1665; (* anything less fails for k0 = 10 *)\n a[k0_, x1_, x2_, x3_, x4_, x5_] := Module[{k, b },\n k = k0;\n b = (k--; a[k, b, x1, x2, x3, x4]) &;\n If[k <= 0, x4[] + x5[], b[]]]\n a[10, 1 &, -1 &, -1 &, 1 &, 0 &]\n","language":"Mathematica"},{"code":"MODULE Main;\nIMPORT IO;\n\nTYPE Function = PROCEDURE ():INTEGER;\n\nPROCEDURE A(k: INTEGER; x1, x2, x3, x4, x5: Function): INTEGER =\n\n PROCEDURE B(): INTEGER =\n BEGIN\n DEC(k);\n RETURN A(k, B, x1, x2, x3, x4);\n END B;\n\nBEGIN\n IF k <= 0 THEN\n RETURN x4() + x5();\n ELSE\n RETURN B();\n END;\nEND A;\n\nPROCEDURE F0(): INTEGER = BEGIN RETURN 0; END F0;\nPROCEDURE F1(): INTEGER = BEGIN RETURN 1; END F1;\nPROCEDURE Fn1(): INTEGER = BEGIN RETURN -1; END Fn1;\n\nBEGIN\n IO.PutInt(A(10, F1, Fn1, Fn1, F1, F0));\n IO.Put(\"\\n\");\nEND Main.\n","language":"Modula-3"},{"code":"import sugar\n\nproc a(k: int; x1, x2, x3, x4, x5: proc(): int): int =\n var k = k\n proc b(): int =\n dec k\n a(k, b, x1, x2, x3, x4)\n if k <= 0: x4() + x5()\n else: b()\n\necho a(10, () => 1, () => -1, () => -1, () => 1, () => 0)\n","language":"Nim"},{"code":"interface Arg {\n method : virtual : public : Run() ~ Int;\n}\n\nclass ManOrBoy {\n New() {}\n\n function : A(mb : ManOrBoy, k : Int, x1 : Arg, x2 : Arg, x3 : Arg, x4 : Arg, x5 : Arg) ~ Int {\n if(k <= 0) {\n return x4->Run() + x5->Run();\n };\n\n return Base->New(mb, k, x1, x2, x3, x4) implements Arg {\n @mb : ManOrBoy; @k : Int; @x1 : Arg; @x2 : Arg; @x3 : Arg; @x4 : Arg; @m : Int;\n\n New(mb : ManOrBoy, k : Int, x1 : Arg, x2 : Arg, x3 : Arg, x4 : Arg) {\n @mb := mb; @k := k; @x1 := x1; @x2 := x2; @x3 := x3; @x4 := x4; @m := @k;\n }\n\n method : public : Run() ~ Int {\n @m -= 1;\n return @mb->A(@mb, @m, @self, @x1, @x2, @x3, @x4);\n }\n }->Run();\n }\n\n function : C(i : Int) ~ Arg {\n return Base->New(i) implements Arg {\n @i : Int;\n New(i : Int) {\n @i := i;\n }\n\n method : public : Run() ~ Int {\n return @i;\n }\n };\n }\n\n function : Main(args : String[]) ~ Nil {\n mb := ManOrBoy->New();\n mb->A(mb, 10, C(1), C(-1), C(-1), C(1), C(0))->PrintLine();\n }\n}\n","language":"Objeck"},{"code":"#import <Foundation/Foundation.h>\n\ntypedef NSInteger (^IntegerBlock)(void);\n\nNSInteger A (NSInteger kParam, IntegerBlock x1, IntegerBlock x2, IntegerBlock x3, IntegerBlock x4, IntegerBlock x5) {\n __block NSInteger k = kParam;\n __block __weak IntegerBlock weak_B;\n IntegerBlock B;\n weak_B = B = ^ {\n return A(--k, weak_B, x1, x2, x3, x4);\n };\n return k <= 0 ? x4() + x5() : B();\n}\n\nIntegerBlock K (NSInteger n) {\n return ^{return n;};\n}\n\nint main (int argc, const char * argv[]) {\n @autoreleasepool {\n NSInteger result = A(10, K(1), K(-1), K(-1), K(1), K(0));\n NSLog(@\"%d\\n\", result);\n }\n return 0;\n}\n","language":"Objective-C"},{"code":"#import <Foundation/Foundation.h>\n\ntypedef NSInteger (^IntegerBlock)(void);\n\nNSInteger A (NSInteger kParam, IntegerBlock x1, IntegerBlock x2, IntegerBlock x3, IntegerBlock x4, IntegerBlock x5) {\n __block NSInteger k = kParam;\n __block IntegerBlock B;\n B = ^ {\n return A(--k, B, x1, x2, x3, x4);\n };\n return k <= 0 ? x4() + x5() : B();\n}\n\nIntegerBlock K (NSInteger n) {\n return [[^{return n;} copy] autorelease];\n}\n\nint main (int argc, const char * argv[]) {\n NSAutoreleasePool *pool = [[NSAutoreleasePool alloc] init];\n NSInteger result = A(10, K(1), K(-1), K(-1), K(1), K(0));\n NSLog(@\"%d\\n\", result);\n [pool drain];\n return 0;\n}\n","language":"Objective-C"},{"code":"@protocol IntegerFun <NSObject>\n-(NSInteger)call;\n@end\n\nNSInteger A (NSInteger kParam, id<IntegerFun> x1, id<IntegerFun> x2, id<IntegerFun> x3, id<IntegerFun> x4, id<IntegerFun> x5);\n\n@interface B_Class : NSObject <IntegerFun> {\n NSInteger *k;\n id<IntegerFun> x1, x2, x3, x4;\n}\n-(id)initWithK:(NSInteger *)k x1:(id<IntegerFun>)x1 x2:(id<IntegerFun>)x2 x3:(id<IntegerFun>)x3 x4:(id<IntegerFun>)x4;\n@end\n\n@implementation B_Class\n-(id)initWithK:(NSInteger *)_k x1:(id<IntegerFun>)_x1 x2:(id<IntegerFun>)_x2 x3:(id<IntegerFun>)_x3 x4:(id<IntegerFun>)_x4 {\n if ((self = [super init])) {\n k = _k;\n x1 = [_x1 retain];\n x2 = [_x2 retain];\n x3 = [_x3 retain];\n x4 = [_x4 retain];\n }\n return self;\n}\n-(void)dealloc {\n [x1 release];\n [x2 release];\n [x3 release];\n [x4 release];\n [super dealloc];\n}\n-(NSInteger)call {\n return A(--*k, self, x1, x2, x3, x4);\n}\n@end\n\nNSInteger A (NSInteger k, id<IntegerFun> x1, id<IntegerFun> x2, id<IntegerFun> x3, id<IntegerFun> x4, id<IntegerFun> x5) {\n id<IntegerFun> B = [[[B_Class alloc] initWithK:&k x1:x1 x2:x2 x3:x3 x4:x4] autorelease];\n return k <= 0 ? [x4 call] + [x5 call] : [B call];\n}\n\n@interface K : NSObject <IntegerFun> {\n NSInteger n;\n}\n-(id)initWithN:(NSInteger)n;\n@end\n\n@implementation K\n-(id)initWithN:(NSInteger)_n {\n if ((self = [super init])) {\n n = _n;\n }\n return self;\n}\n-(NSInteger)call {\n return n;\n}\n@end\n\nint main(int argc, const char *argv[]) {\n NSAutoreleasePool *pool = [[NSAutoreleasePool alloc] init];\n\n NSInteger result = A(10,\n [[[K alloc] initWithN:1] autorelease],\n [[[K alloc] initWithN:-1] autorelease],\n [[[K alloc] initWithN:-1] autorelease],\n [[[K alloc] initWithN:1] autorelease],\n [[[K alloc] initWithN:0] autorelease]);\n NSLog(@\"%ld\\n\", result);\n\n [pool release];\n return 0;\n}\n","language":"Objective-C"},{"code":"let rec a k x1 x2 x3 x4 x5 =\n if k <= 0 then\n x4 () + x5 ()\n else\n let m = ref k in\n let rec b () =\n decr m;\n a !m b x1 x2 x3 x4\n in\n b ()\n\nlet () =\n Printf.printf \"%d\\n\" (a 10 (fun () -> 1) (fun () -> -1) (fun () -> -1) (fun () -> 1) (fun () -> 0))\n","language":"OCaml"},{"code":"package main\n\nimport \"core:fmt\"\nimport \"core:os\"\nimport \"core:strconv\"\n\nArg :: struct {\n fn : proc (^Arg) -> int,\n k : ^int,\n x1, x2, x3, x4, x5 : ^Arg,\n}\n\nB :: proc (a : ^Arg) -> int {\n a.k^ -= 1\n k := a.k^\n return A(&Arg { fn = B, k = &k, x1 = a, x2 = a.x1, x3 = a.x2, x4 = a.x3, x5 = a.x4 } )\n}\n\nA :: proc (a : ^Arg) -> int {\n return a.x4->fn() + a.x5->fn() if a.k^ <= 0 else B(a)\n}\n\nmain :: proc () {\n f_1 :: proc (^Arg) -> int { return -1 }\n f0 :: proc (^Arg) -> int { return 0 }\n f1 :: proc (^Arg) -> int { return 1 }\n\n k := strconv.atoi(os.args[1]) if len(os.args) == 2 else 10\n fmt.println(A(&Arg { fn = B, k = &k, x1 = &Arg { fn = f1 }, x2 = &Arg { fn = f_1 }, x3 = &Arg { fn = f_1 }, x4 = &Arg { fn = f1 }, x5 = &Arg { fn = f0 } }))\n}\n","language":"Odin"},{"code":"; Because argument \"k\" is a small number, it's a value, not an object.\n; So we must 'pack' it in object - 'box' it; And 'unbox' when we try to get value.\n\n(define (box x) (list x))\n(define (unbox x) (car x))\n(define (copy x) (box (unbox x)))\n\n(define (A k x1 x2 x3 x4 x5)\n (define (B)\n (set-car! k (- (unbox k) 1))\n (A (copy k) B x1 x2 x3 x4))\n\n (if (<= (unbox k) 0)\n (+ (x4) (x5))\n (B)))\n\n(define (man-or-boy N)\n (A (box N)\n (lambda () 1)\n (lambda () -1)\n (lambda () -1)\n (lambda () 1)\n (lambda () 0)))\n\n(print (man-or-boy 10))\n(print (man-or-boy 15))\n(print (man-or-boy 20))\n","language":"Ol"},{"code":"declare\n fun {A K X1 X2 X3 X4 X5}\n ReturnA = {NewCell undefined}\n fun {B}\n ReturnB = {NewCell undefined}\n in\n K := @K - 1\n ReturnA := {A {NewCell @K} B X1 X2 X3 X4}\n ReturnB := @ReturnA\n @ReturnB\n end\n in\n if @K =< 0 then ReturnA := {X4} + {X5} else _ = {B} end\n @ReturnA\n end\n\n fun {C V}\n fun {$} V end\n end\nin\n {Show {A {NewCell 10} {C 1} {C ~1} {C ~1} {C 1} {C 0}}}\n","language":"Oz"},{"code":"program manorboy(output);\n\nfunction zero: integer; begin zero := 0 end;\nfunction one: integer; begin one := 1 end;\nfunction negone: integer; begin negone := -1 end;\n\nfunction A(\n k: integer;\n function x1: integer;\n function x2: integer;\n function x3: integer;\n function x4: integer;\n function x5: integer\n): integer;\n\n function B: integer;\n begin k := k - 1;\n B := A(k, B, x1, x2, x3, x4)\n end;\n\nbegin if k <= 0 then A := x4 + x5 else A := B\nend;\n\nbegin writeln(A(10, one, negone, negone, one, zero))\nend.\n","language":"Pascal"},{"code":"sub A {\n my ($k, $x1, $x2, $x3, $x4, $x5) = @_;\n my($B);\n $B = sub { A(--$k, $B, $x1, $x2, $x3, $x4) };\n $k <= 0 ? &$x4 + &$x5 : &$B;\n}\n\nprint A(10, sub{1}, sub {-1}, sub{-1}, sub{1}, sub{0} ), \"\\n\";\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- allocate()</span>\n <span style=\"color: #008080;\">forward</span> <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">A</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x5</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">B</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;\">object</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">kptr</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><span style=\"color: #000000;\">x3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">x4</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">s</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">peek4s</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">kptr</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #7060A8;\">poke4</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">kptr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k</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;\">k</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">kptr</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><span style=\"color: #000000;\">x3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">x4</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><span style=\"color: #000000;\">x3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">x4</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;\">A</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x5</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: #008080;\">return</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x4</span><span style=\"color: #0000FF;\">)?</span><span style=\"color: #000000;\">B</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x4</span><span style=\"color: #0000FF;\">):</span><span style=\"color: #000000;\">x4</span><span style=\"color: #0000FF;\">)+</span>\n <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x5</span><span style=\"color: #0000FF;\">)?</span><span style=\"color: #000000;\">B</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x5</span><span style=\"color: #0000FF;\">):</span><span style=\"color: #000000;\">x5</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">kptr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">allocate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">poke4</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">kptr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">B</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">kptr</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><span style=\"color: #000000;\">x3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">x4</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;\">for</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">23</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;\">\"A(%d) = %d\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">A</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;\">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>\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;\">first5</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;\">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>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">A</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">k</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;\">5</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">first5</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: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">c0</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">c1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">c2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">c3</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;\">5</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">c3</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">c0</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">c0</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">c1</span>\n <span style=\"color: #000000;\">c1</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">c2</span>\n <span style=\"color: #000000;\">c2</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">c3</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;\">c0</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">c1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">c2</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">c3</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;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">40</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;\">\"%d %d\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">A</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">)})</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;\">include</span> <span style=\"color: #004080;\">mpfr</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">A</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">k</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;\">5</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">mpz_init</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;\">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;\">k</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;\">if</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">c0</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">c1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">c2</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: #000000;\">c3</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;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">5</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">mpz_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_sub_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c3</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;\">c0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c3</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">mpz_sub</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_sub</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c3</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">c0</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: #7060A8;\">tagset</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: #0000FF;\">)&{</span><span style=\"color: #000000;\">30</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">39</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">500</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10000</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1e6</span><span style=\"color: #0000FF;\">}</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;\">tests</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: #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;\">\"A(%,d) = %s\\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;\">k</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #7060A8;\">mpz_get_short_str</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">A</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tests</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</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\nfunction A($k,$x1,$x2,$x3,$x4,$x5) {\n $b = function () use (&$b,&$k,$x1,$x2,$x3,$x4) {\n return A(--$k,$b,$x1,$x2,$x3,$x4);\n };\n return $k <= 0 ? $x4() + $x5() : $b();\n}\n\necho A(10, function () { return 1; },\n function () { return -1; },\n function () { return -1; },\n function () { return 1; },\n function () { return 0; }) . \"\\n\";\n?>\n","language":"PHP"},{"code":"<?php\nfunction A($k,$x1,$x2,$x3,$x4,$x5) {\n static $i = 0;\n $b = \"myfunction_$i\";\n $i++;\n eval('function '.$b.'() {\n static $k = '.$k.';\n return A(--$k, '.var_export($b,true).',\n '.var_export($x1,true).',\n '.var_export($x2,true).',\n '.var_export($x3,true).',\n '.var_export($x4,true).');\n }');\n return $k <= 0 ? $x4() + $x5() : $b();\n}\n\necho A(10, create_function('', 'return 1;'),\n create_function('', 'return -1;'),\n create_function('', 'return -1;'),\n create_function('', 'return 1;'),\n create_function('', 'return 0;')) . \"\\n\";\n?>\n","language":"PHP"},{"code":"(de a (K X1 X2 X3 X4 X5)\n (let (@K (cons K) B (cons)) # Explicit frame\n (set B\n (curry (@K B X1 X2 X3 X4) ()\n (a (dec @K) (car B) X1 X2 X3 X4) ) )\n (if (gt0 (car @K)) ((car B)) (+ (X4) (X5))) ) )\n\n(a 10 '(() 1) '(() -1) '(() -1) '(() 1) '(() 0))\n","language":"PicoLisp"},{"code":"#!/usr/bin/env python\nimport sys\nsys.setrecursionlimit(1025)\n\ndef a(in_k, x1, x2, x3, x4, x5):\n k = [in_k]\n def b():\n k[0] -= 1\n return a(k[0], b, x1, x2, x3, x4)\n return x4() + x5() if k[0] <= 0 else b()\n\nx = lambda i: lambda: i\nprint(a(10, x(1), x(-1), x(-1), x(1), x(0)))\n","language":"Python"},{"code":"#!/usr/bin/env python\nimport sys\nsys.setrecursionlimit(1025)\n\ndef a(k, x1, x2, x3, x4, x5):\n def b():\n b.k -= 1\n return a(b.k, b, x1, x2, x3, x4)\n b.k = k\n return x4() + x5() if b.k <= 0 else b()\n\nx = lambda i: lambda: i\nprint(a(10, x(1), x(-1), x(-1), x(1), x(0)))\n","language":"Python"},{"code":"#!/usr/bin/env python\nimport sys\nsys.setrecursionlimit(1025)\n\ndef A(k, x1, x2, x3, x4, x5):\n def B():\n nonlocal k\n k -= 1\n return A(k, B, x1, x2, x3, x4)\n return x4() + x5() if k <= 0 else B()\n\nprint(A(10, lambda: 1, lambda: -1, lambda: -1, lambda: 1, lambda: 0))\n","language":"Python"},{"code":"n <- function(x) function()x\n\nA <- function(k, x1, x2, x3, x4, x5) {\n B <- function() A(k <<- k-1, B, x1, x2, x3, x4)\n if (k <= 0) x4() + x5() else B()\n}\n\nA(10, n(1), n(-1), n(-1), n(1), n(0))\n","language":"R"},{"code":"call.by.name <- function(...) {\n cl <- as.list(match.call())\n sublist <- lapply(cl[2:(length(cl)-1)],\n function(name) substitute(substitute(evalq(.,.caller),\n list(.=substitute(name))),\n list(name=name)))\n names(sublist) <- enquote(cl[2:(length(cl)-1)])\n subcall <- do.call(\"call\", c(\"list\", lapply(sublist, enquote)))\n fndef <- cl[[length(cl)]]\n fndef[[3]] <- substitute({\n .caller <- parent.frame()\n eval(substitute(body, subcall))\n }, list(body=fndef[[3]], subcall=subcall))\n eval.parent(fndef)\n}\n","language":"R"},{"code":"A <- call.by.name(x1, x2, x3, x4, x5,\n function(k, x1, x2, x3, x4, x5) {\n Aout <- NULL\n B <- function() {\n k <<- k - 1\n Bout <- Aout <<- A(k, B(), x1, x2, x3, x4)\n }\n if (k <= 0) Aout <- x4 + x5 else B()\n Aout\n }\n)\n","language":"R"},{"code":"> options(expressions=10000)\n> mapply(A, 0:10, 1, -1, -1, 1, 0)\n [1] 1 0 -2 0 1 0 1 -1 -10 -30 -67\n","language":"R"},{"code":"> print(A, useSource=FALSE)\nfunction (k, x1, x2, x3, x4, x5)\n{\n .caller <- parent.frame()\n eval(substitute({\n Aout <- NULL\n B <- function() {\n k <<- k - 1\n Bout <- Aout <<- A(k, B(), x1, x2, x3, x4)\n }\n if (k <= 0) Aout <- x4 + x5 else B()\n Aout\n }, list(x1 = substitute(evalq(., .caller), list(. = substitute(x1))),\n x2 = substitute(evalq(., .caller), list(. = substitute(x2))),\n x3 = substitute(evalq(., .caller), list(. = substitute(x3))),\n x4 = substitute(evalq(., .caller), list(. = substitute(x4))),\n x5 = substitute(evalq(., .caller), list(. = substitute(x5))))))\n}\n","language":"R"},{"code":"#lang racket\n\n(define (A k x1 x2 x3 x4 x5)\n (define (B)\n (set! k (- k 1))\n (A k B x1 x2 x3 x4))\n (if (<= k 0)\n (+ (x4) (x5))\n (B)))\n\n(A 10 (lambda () 1) (lambda () -1) (lambda () -1) (lambda () 1) (lambda () 0))\n","language":"Racket"},{"code":"#lang racket\n\n(define (A k x1 x2 x3 x4 x5)\n (if (<= k 0)\n (+ (x4) (x5))\n (let B ()\n (set! k (- k 1))\n (A k B x1 x2 x3 x4))))\n\n(A 10 (lambda () 1) (lambda () -1) (lambda () -1) (lambda () 1) (lambda () 0))\n","language":"Racket"},{"code":"sub A($k is copy, &x1, &x2, &x3, &x4, &x5) {\n $k <= 0\n ?? x4() + x5()\n !! (my &B = { A(--$k, &B, &x1, &x2, &x3, &x4) })();\n};\n\nsay A(10, {1}, {-1}, {-1}, {1}, {0});\n","language":"Raku"},{"code":"/*REXX program performs the \"man or boy\" test as far as possible for N. */\n do n=0 /*increment N from zero forever. */\n say 'n='n a(N,x1,x2,x3,x4,x5) /*display the result to the terminal. */\n end /*n*/ /* [↑] do until something breaks. */\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\na: procedure; parse arg k, x1, x2, x3, x4, x5\n if k<=0 then return f(x4) + f(x5)\n else return f(b)\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nb: k=k-1; return a(k, b, x1, x2, x3, x4)\nf: interpret 'v=' arg(1)\"()\"; return v\nx1: procedure; return 1\nx2: procedure; return -1\nx3: procedure; return -1\nx4: procedure; return 1\nx5: procedure; return 0\n","language":"REXX"},{"code":"def a(k, x1, x2, x3, x4, x5)\n b = lambda { k -= 1; a(k, b, x1, x2, x3, x4) }\n k <= 0 ? x4[] + x5[] : b[]\nend\n\nputs a(10, lambda {1}, lambda {-1}, lambda {-1}, lambda {1}, lambda {0})\n","language":"Ruby"},{"code":"use std::cell::Cell;\n\ntrait Arg {\n fn run(&self) -> i32;\n}\n\nimpl Arg for i32 {\n fn run(&self) -> i32 { *self }\n}\n\nstruct B<'a> {\n k: &'a Cell<i32>,\n x1: &'a Arg,\n x2: &'a Arg,\n x3: &'a Arg,\n x4: &'a Arg,\n}\n\nimpl<'a> Arg for B<'a> {\n fn run(&self) -> i32 {\n self.k.set(self.k.get() - 1);\n a(self.k.get(), self, self.x1, self.x2, self.x3, self.x4)\n }\n}\n\nfn a(k: i32, x1: &Arg, x2: &Arg, x3: &Arg, x4: &Arg, x5: &Arg) -> i32 {\n if k <= 0 {\n x4.run() + x5.run()\n } else {\n B{\n k: &Cell::new(k),\n x1, x2, x3, x4\n }.run()\n }\n}\n\npub fn main() {\n println!(\"{}\", a(10, &1, &-1, &-1, &1, &0));\n}\n","language":"Rust"},{"code":"use std::cell::Cell;\n\nfn a(k: i32, x1: &Fn() -> i32, x2: &Fn() -> i32, x3: &Fn() -> i32, x4: &Fn() -> i32, x5: &Fn() -> i32) -> i32 {\n let k1 = Cell::new(k);\n struct B<'a> { f: &'a Fn(&B) -> i32 }\n let b = B {\n f: &|b| {\n k1.set(k1.get() - 1);\n return a(k1.get(), &||(b.f)(b), x1, x2, x3, x4)\n }\n };\n let b = ||(b.f)(&b);\n return if k <= 0 {x4() + x5()} else {b()}\n}\n\npub fn main() {\n println!(\"{}\", a(10, &||1, &||-1, &||-1, &||1, &||0));\n}\n","language":"Rust"},{"code":"use std::cell::Cell;\nuse std::cell::RefCell;\nuse std::rc::Rc;\nuse std::rc::Weak;\n\nfn a(k: i32, x1: &Fn() -> i32, x2: &Fn() -> i32, x3: &Fn() -> i32, x4: &Fn() -> i32, x5: &Fn() -> i32) -> i32 {\n let weak_holder: Rc<RefCell<Weak<Fn() -> i32>>> = Rc::new(RefCell::new(Weak::<fn() -> i32>::new()));\n let weak_holder2 = weak_holder.clone();\n let k_holder = Cell::new(k);\n let b: Rc<Fn() -> i32> = Rc::new(move || {\n let b = weak_holder2.borrow().upgrade().unwrap();\n k_holder.set(k_holder.get() - 1);\n return a(k_holder.get(), &*b, x1, x2, x3, x4);\n });\n weak_holder.replace(Rc::downgrade(&b));\n\n return if k <= 0 {x4() + x5()} else {b()}\n}\n\npub fn main() {\n println!(\"{}\", a(10, &||1, &||-1, &||-1, &||1, &||0));\n}\n","language":"Rust"},{"code":"def A(in_k: Int, x1: =>Int, x2: =>Int, x3: =>Int, x4: =>Int, x5: =>Int): Int = {\n var k = in_k\n def B: Int = {\n k = k-1\n A(k, B, x1, x2, x3, x4)\n }\n if (k<=0) x4+x5 else B\n}\nprintln(A(10, 1, -1, -1, 1, 0))\n","language":"Scala"},{"code":"(define (A k x1 x2 x3 x4 x5)\n (define (B)\n (set! k (- k 1))\n (A k B x1 x2 x3 x4))\n (if (<= k 0)\n (+ (x4) (x5))\n (B)))\n\n(A 10 (lambda () 1) (lambda () -1) (lambda () -1) (lambda () 1) (lambda () 0))\n","language":"Scheme"},{"code":"func a(k, x1, x2, x3, x4, x5) {\n func b { a(--k, b, x1, x2, x3, x4) };\n k <= 0 ? (x4() + x5()) : b();\n}\nsay a(10, ->{1}, ->{-1}, ->{-1}, ->{1}, ->{0}); #=> -67\n","language":"Sidef"},{"code":"func a(k, x1, x2, x3, x4, x5) {\n k <= 0 ? (x4() + x5())\n : func b { a(--k, b, x1, x2, x3, x4) }();\n}\nsay a(10, ->{1}, ->{-1}, ->{-1}, ->{1}, ->{0}); #=> -67\n","language":"Sidef"},{"code":"class MOB {\n method a(k, x1, x2, x3, x4, x5) {\n func b { self.a(--k, b, x1, x2, x3, x4) };\n k <= 0 ? (x4() + x5()) : b();\n }\n}\n\nvar obj = MOB();\nsay obj.a(10, ->{1}, ->{-1}, ->{-1}, ->{1}, ->{0});\n","language":"Sidef"},{"code":"function a(k, x1, x2, x3, x4, x5) {\n\tlet kk = { \"k\": k.k };\n\tlet b = function b() {\n\t\tkk.k--;\n\t\treturn a(kk, b, x1, x2, x3, x4);\n\t};\n\treturn kk.k <= 0 ? x4() + x5() : b();\n}\n\nfunction x(n) {\n\treturn function () {\n\t\treturn n;\n\t};\n}\n\nprint(a({ \"k\": 10 }, x(1), x(-1), x(-1), x(1), x(0)));\n","language":"Sparkling"},{"code":"fun a (k, x1, x2, x3, x4, x5) =\n if k <= 0 then\n x4 () + x5 ()\n else let\n val m = ref k\n fun b () = (\n m := !m - 1;\n a (!m, b, x1, x2, x3, x4)\n )\n in\n b ()\n end\n\nval () =\n print (Int.toString (a (10, fn () => 1, fn () => ~1, fn () => ~1, fn () => 1, fn () => 0)) ^ \"\\n\")\n","language":"Standard-ML"},{"code":"func A(_ k: Int,\n _ x1: @escaping () -> Int,\n _ x2: @escaping () -> Int,\n _ x3: @escaping () -> Int,\n _ x4: @escaping () -> Int,\n _ x5: @escaping () -> Int) -> Int {\n var k1 = k\n\n func B() -> Int {\n k1 -= 1\n return A(k1, B, x1, x2, x3, x4)\n }\n\n if k1 <= 0 {\n return x4() + x5()\n } else {\n return B()\n }\n}\n\nprint(A(10, {1}, {-1}, {-1}, {1}, {0}))\n","language":"Swift"},{"code":"func A(k: Int, _ x1: () -> Int, _ x2: () -> Int, _ x3: () -> Int, _ x4: () -> Int, _ x5: () -> Int) -> Int {\n var k1 = k\n func B() -> Int {\n k1-=1\n return A(k1, B, x1, x2, x3, x4)\n }\n if k1 <= 0 {\n return x4() + x5()\n } else {\n return B()\n }\n}\n\nprint(A(10, {1}, {-1}, {-1}, {1}, {0}))\n","language":"Swift"},{"code":"func A(var k: Int, x1: () -> Int, x2: () -> Int, x3: () -> Int, x4: () -> Int, x5: () -> Int) -> Int {\n var B: (() -> Int)!\n B = {\n k--\n return A(k, B, x1, x2, x3, x4)\n }\n if k <= 0 {\n return x4() + x5()\n } else {\n return B()\n }\n}\n\nprintln(A(10, {1}, {-1}, {-1}, {1}, {0}))\n","language":"Swift"},{"code":"proc A {k x1 x2 x3 x4 x5} {\n expr {$k<=0 ? [eval $x4]+[eval $x5] : [B \\#[info level]]}\n}\nproc B {level} {\n upvar $level k k x1 x1 x2 x2 x3 x3 x4 x4\n incr k -1\n A $k [info level 0] $x1 $x2 $x3 $x4\n}\nproc C {val} {return $val}\ninterp recursionlimit {} 1157\nA 10 {C 1} {C -1} {C -1} {C 1} {C 0}\n","language":"Tcl"},{"code":"proc AP {k x1 x2 x3 x4 x5} {expr {$k<=0 ? [eval $x4]+[eval $x5] : [BP \\#[info level] $x1 $x2 $x3 $x4]}}\nproc BP {level x1 x2 x3 x4} {AP [uplevel $level {incr k -1}] [info level 0] $x1 $x2 $x3 $x4}\nproc C {val} {return $val}\ninterp recursionlimit {} 1157\nAP 10 {C 1} {C -1} {C -1} {C 1} {C 0}\n","language":"Tcl"},{"code":"(defun A (k x1 x2 x3 x4 x5)\n (labels ((B ()\n (dec k)\n [A k B x1 x2 x3 x4]))\n (if (<= k 0) (+ [x4] [x5]) (B))))\n\n(prinl (A 10 (ret 1) (ret -1) (ret -1) (ret 1) (ret 0)))\n","language":"TXR"},{"code":"(defun-cbn A (k x1 x2 x3 x4 x5)\n (let ((k k))\n (labels-cbn (B ()\n (dec k)\n (set B (set A (A k (B) x1 x2 x3 x4))))\n (if (<= k 0)\n (set A (+ x4 x5))\n (B))))) ;; value of (B) correctly discarded here!\n\n(prinl (A 10 1 -1 -1 1 0))\n","language":"TXR"},{"code":"(defstruct (cbn-thunk get set) nil get set)\n\n(defmacro make-cbn-val (place)\n (with-gensyms (nv tmp)\n (cond\n ((constantp place)\n ^(let ((,tmp ,place))\n (new cbn-thunk\n get (lambda () ,tmp)\n set (lambda (,nv) (set ,tmp ,nv)))))\n ((bindable place)\n ^(new cbn-thunk\n get (lambda () ,place)\n set (lambda (,nv) (set ,place ,nv))))\n (t\n ^(new cbn-thunk\n get (lambda () ,place)\n set (lambda (ign) (error \"cannot set ~s\" ',place)))))))\n\n(defun cbn-val (cbs)\n (call cbs.get))\n\n(defun set-cbn-val (cbs nv)\n (call cbs.set nv))\n\n(defplace (cbn-val thunk) body\n (getter setter\n (with-gensyms (thunk-tmp)\n ^(rlet ((,thunk-tmp ,thunk))\n (macrolet ((,getter () ^(cbn-val ,',thunk-tmp))\n (,setter (val) ^(set-cbn-val ,',thunk-tmp ,val)))\n ,body)))))\n\n(defun make-cbn-fun (sym args . body)\n (let ((gens (mapcar (ret (gensym)) args)))\n ^(,sym ,gens\n (symacrolet ,[mapcar (ret ^(,@1 (cbn-val ,@2))) args gens]\n ,*body))))\n\n(defmacro cbn (fun . args)\n ^(call (fun ,fun) ,*[mapcar (ret ^(make-cbn-val ,@1)) args]))\n\n(defmacro defun-cbn (name (. args) . body)\n (with-gensyms (hidden-fun)\n ^(progn\n (defun ,hidden-fun ())\n (defmacro ,name (. args) ^(cbn ,',hidden-fun ,*args))\n (set (symbol-function ',hidden-fun)\n ,(make-cbn-fun 'lambda args\n ^(block ,name (let ((,name)) ,*body ,name)))))))\n\n(defmacro labels-cbn ((name (. args) . lbody) . body)\n (with-gensyms (hidden-fun)\n ^(macrolet ((,name (. args) ^(cbn ,',hidden-fun ,*args)))\n (labels (,(make-cbn-fun hidden-fun args\n ^(block ,name (let ((,name)) ,*lbody ,name))))\n ,*body))))\n\n(defun-cbn A (k x1 x2 x3 x4 x5)\n (let ((k k))\n (labels-cbn (B ()\n (dec k)\n (set B (set A (A k (B) x1 x2 x3 x4))))\n (if (<= k 0)\n (set A (+ x4 x5))\n (B))))) ;; value of (B) correctly discarded here!\n\n(prinl (A 10 1 -1 -1 1 0))\n","language":"TXR"},{"code":"implement main\n open core\n\nclauses\n run():-\n console::init(),\n stdio::write(a(10, {() = 1}, {() = -1}, {() = -1}, {() = 1}, {() = 0})).\n\nclass predicates\n a : (integer K, function{integer} X1, function{integer} X2, function{integer} X3, function{integer} X4, function{integer} X5) -> integer Result.\nclauses\n a(K, X1, X2, X3, X4, X5) = R :-\n KM = varM::new(K),\n BM = varM{function{integer}}::new({() = 0}),\n BM:value :=\n { () = BR :-\n KM:value := KM:value-1,\n BR = a(KM:value, BM:value, X1, X2, X3, X4)\n },\n R = if KM:value <= 0 then X4() + X5() else BM:value() end if.\n\nend implement main\n","language":"Visual-Prolog"},{"code":"self.a = method(k, x1, x2, x3, x4, x5){\n b = method(){\n code.k = code.k - 1\n return( self.a(code.k, code, code.x1, code.x2, code.x3, code.x4) )\n }\n b.k = k\n b.x1 = x1\n b.x2 = x2\n b.x3 = x3\n b.x4 = x4\n b.x5 = x5\n\n if(k <= 0){\n return(self.apply(x4) + self.apply(x5))\n }\n else{\n return(self.apply(b))\n }\n}\n\nself.K = method(n){\n f = method(){\n return(code.n)\n }\n f.n = n\n return(f)\n}\n\nself.a(10, self.K(1), self.K(-1), self.K(-1), self.K(1), self.K(0)).print()\n","language":"Vorpal"},{"code":"import \"./fmt\" for Fmt\n\nvar a\na = Fn.new { |k, x1, x2, x3, x4, x5|\n var b\n b = Fn.new {\n k = k - 1\n return a.call(k, b, x1, x2, x3, x4)\n }\n return (k <= 0) ? x4.call() + x5.call() : b.call()\n}\n\nSystem.print(\" k a\")\nfor (k in 0..20) {\n Fmt.print(\"$2d : $ d\", k, a.call(k, Fn.new { 1 }, Fn.new { -1 }, Fn.new { -1 }, Fn.new { 1 }, Fn.new { 0 }))\n}\n","language":"Wren"},{"code":"/* Man_or_boy_test_2.wren */\n\nimport \"./gmp\" for Mpz\nimport \"./fmt\" for Fmt\n\nvar A = Fn.new { |k|\n if (k < 6) {\n var x1 = 1\n var x2 = -1\n var x3 = -1\n var x4 = 1\n var c1 = [0, 0, 0, 1, 2, 3][k]\n var c2 = [0, 0, 1, 1, 1, 2][k]\n var c3 = [0, 1, 1, 0, 0, 1][k]\n var c4 = [1, 1, 0, 0, 0, 0][k]\n return c1*x1 + c2*x2 + c3*x3 + c4*x4\n }\n var one = Mpz.one\n var c0 = Mpz.three\n var c1 = Mpz.two\n var c2 = Mpz.one\n var c3 = Mpz.zero\n for (j in 5...k) {\n c3.add(c0).sub(one)\n c0.add(c1)\n c1.add(c2)\n c2.add(c3)\n }\n return c0.add(c0.sub(c0.sub(c1), c2), c3)\n}\n\nvar p = Fn.new { |k|\n Fmt.write(\"A($d) = \", k)\n var s = A.call(k).toString\n if (s.count < 60) {\n System.print(s)\n } else {\n Fmt.print(\"$s...$s ($d digits)\", s[0..5], s[-5..-1], s.count - 1)\n }\n}\n\nfor (i in 0..39) p.call(i)\np.call(500)\np.call(10000)\np.call(1e6)\n","language":"Wren"},{"code":"const Record = struct {\n yieldFn: *const fn (record: *Record) i32,\n\n k: *i32 = undefined,\n x1: *Record = undefined,\n x2: *Record = undefined,\n x3: *Record = undefined,\n x4: *Record = undefined,\n x5: *Record = undefined,\n\n inline fn run(record: *Record) i32 {\n return record.yieldFn(record);\n }\n\n pub fn A(record: *Record) i32 {\n return if (record.k.* <= 0)\n record.x4.run() + record.x5.run()\n else\n record.B();\n }\n\n fn B(record: *Record) i32 {\n record.k.* -= 1;\n\n var k_copy_on_stack: i32 = record.k.*;\n\n var b: Record = .{\n .yieldFn = &Record.B,\n\n .k = &k_copy_on_stack,\n .x1 = record,\n .x2 = record.x1,\n .x3 = record.x2,\n .x4 = record.x3,\n .x5 = record.x4,\n };\n return b.A();\n }\n};\n\nconst numbers = struct {\n fn positiveOne(unused_record: *Record) i32 {\n _ = unused_record;\n return 1;\n }\n\n fn zero(unused_record: *Record) i32 {\n _ = unused_record;\n return 0;\n }\n\n fn negativeOne(unused_record: *Record) i32 {\n _ = unused_record;\n return -1;\n }\n};\n\nconst std = @import(\"std\");\n\npub fn main() void {\n var i: u31 = 0;\n while (i <= 31) : (i += 1) {\n var k: i32 = i;\n var @\"+1_record\": Record = .{ .yieldFn = &numbers.positiveOne };\n var @\"0_record\": Record = .{ .yieldFn = &numbers.zero };\n var @\"-1_record\": Record = .{ .yieldFn = &numbers.negativeOne };\n\n var record: Record = .{\n .yieldFn = &Record.B,\n\n .k = &k,\n .x1 = &@\"+1_record\",\n .x2 = &@\"-1_record\",\n .x3 = &@\"-1_record\",\n .x4 = &@\"+1_record\",\n .x5 = &@\"0_record\",\n };\n\n std.debug.print(\"[{d:>3}] = {d}\\n\", .{ i, record.A() });\n }\n}\n","language":"Zig"},{"code":"fcn A(k, x1, x2, x3, x4, x5){ // -->1,0,-2,0,1,0,1,-1,-10,-30,-67,-138\t\n B:=CB(k, x1, x2, x3, x4, x5);\n if(k <= 0) x4()+x5() else B.B();\n}\n\nforeach k in (12){\n println(\"k=%2d A=%d\".fmt(k, A(k, 1, -1, -1, 1, 0)))\n}\n\nclass CB{ var k, x1, x2, x3, x4, x5;\n fcn init{ k, x1, x2, x3, x4, x5 = vm.arglist; }\n fcn B{\n k= k - 1;\n A(k, B, x1, x2, x3, x4);\n }\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Recursion\\nfrom: http://rosettacode.org/wiki/Man_or_boy_test\\nnote: Classic CS problems and programs\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"<br>\\n'''Background''': The '''man or boy test''' was proposed by computer scientist [[wp:Donald_Knuth|Donald Knuth]] as a means of evaluating implementations of the [[:Category:ALGOL 60|ALGOL 60]] programming language. The aim of the test was to distinguish compilers that correctly implemented \\\"recursion and non-local references\\\" from those that did not.\\n\\n<blockquote style=\\\"font-style:italic\\\">\\n I have written the following simple routine, which may separate the 'man-compilers' from the 'boy-compilers'<br> — <span style=\\\"font-style:normal\\\">Donald Knuth</span></blockquote>\\n\\n'''Task''': Imitate [[#ALGOL 60 - Knuth's example|Knuth's example in Algol 60]] in another language, as far as possible. \\n\\n'''Details''': Local variables of routines are often kept in [http://c2.com/cgi/wiki?ActivationRecord ''activation records''] (also ''call frames''). In many languages, these records are kept on a [[System stack|call stack]]. In Algol (and e.g. in [[Smalltalk]]), they are allocated on a [[heap]] instead. Hence it is possible to pass references to routines that still can use and update variables from their call environment, even if the routine where those variables are declared already returned. This difference in implementations is sometimes called the [[wp:Funarg_problem|Funarg Problem]].\\n\\nIn Knuth's example, each call to ''A'' allocates an activation record for the variable ''A''. When ''B'' is called from ''A'', any access to ''k'' now refers to this activation record. Now ''B'' in turn calls ''A'', but passes itself as an argument. This argument remains bound to the activation record. This call to ''A'' also \\\"shifts\\\" the variables ''x<sub>i</sub>'' by one place, so eventually the argument ''B'' (still bound to its particular\\nactivation record) will appear as ''x4'' or ''x5'' in a call to ''A''. If this happens when the expression ''x4 + x5'' is evaluated, then this will again call ''B'', which in turn will update ''k'' in the activation record it was originally bound to. As this activation record is shared with other instances of calls to ''A'' and ''B'', it will influence the whole computation.\\n\\nSo all the example does is to set up a convoluted calling structure, where updates to ''k'' can influence the behavior\\nin completely different parts of the call tree.\\n\\nKnuth used this to test the correctness of the compiler, but one can of course also use it to test that other languages can emulate the Algol behavior correctly. If the handling of activation records is correct, the computed value will be −67.\\n\\n'''Performance and Memory''': Man or Boy is intense and can be pushed to challenge any machine. Memory (both stack and heap) not CPU time is the constraining resource as the recursion creates a proliferation activation records which will quickly exhaust memory and present itself through a stack error. Each language may have ways of adjusting the amount of memory or increasing the recursion depth. Optionally, show how you would make such adjustments.\\n\\nThe table below shows the result, call depths, and total calls for a range of ''k'':\\n{| class=\\\"wikitable\\\" style=\\\"font-size: 85%\\\"\\n! ''k''\\n! 0\\n! 1\\n! 2\\n! 3\\n! 4\\n! 5\\n! 6\\n! 7\\n! 8\\n! 9\\n! 10\\n! 11\\n! 12\\n! 13\\n! 14\\n! 15\\n! 16\\n! 17\\n! 18\\n! 19\\n! 20\\n! 21\\n! 22\\n! 23\\n! 24\\n! 25\\n! 26\\n! 27\\n! 28\\n! 29\\n! 30\\n|-\\n! ''A''\\n|align=\\\"right\\\"| 1\\n|align=\\\"right\\\"| 0\\n|align=\\\"right\\\"| -2\\n|align=\\\"right\\\"| 0\\n|align=\\\"right\\\"| 1\\n|align=\\\"right\\\"| 0\\n|align=\\\"right\\\"| 1\\n|align=\\\"right\\\"| -1\\n|align=\\\"right\\\"| -10\\n|align=\\\"right\\\"| -30\\n|align=\\\"right\\\"| -67\\n|align=\\\"right\\\"| -138\\n|align=\\\"right\\\"| -291\\n|align=\\\"right\\\"| -642\\n|align=\\\"right\\\"| -1,446\\n|align=\\\"right\\\"| -3,250\\n|align=\\\"right\\\"| -7,244\\n|align=\\\"right\\\"| -16,065\\n|align=\\\"right\\\"| -35,601\\n|align=\\\"right\\\"| -78,985\\n|align=\\\"right\\\"| -175,416\\n|align=\\\"right\\\"| -389,695\\n|align=\\\"right\\\"| -865,609\\n|align=\\\"right\\\"| -1,922,362\\n|align=\\\"right\\\"| -4,268,854\\n|align=\\\"right\\\"| -9,479,595\\n|align=\\\"right\\\"| -21,051,458\\n|align=\\\"right\\\"| -46,750,171\\n|align=\\\"right\\\"| -103,821,058\\n|align=\\\"right\\\"| -230,560,902\\n|align=\\\"right\\\"| -512,016,658\\n|-\\n! ''A'' called\\n|align=\\\"right\\\"| 1\\n|align=\\\"right\\\"| 2\\n|align=\\\"right\\\"| 3\\n|align=\\\"right\\\"| 4\\n|align=\\\"right\\\"| 8\\n|align=\\\"right\\\"| 18\\n|align=\\\"right\\\"| 38\\n|align=\\\"right\\\"| 80\\n|align=\\\"right\\\"| 167\\n|align=\\\"right\\\"| 347\\n|align=\\\"right\\\"| 722\\n|align=\\\"right\\\"| 1,509\\n|align=\\\"right\\\"| 3,168\\n|align=\\\"right\\\"| 6,673\\n|align=\\\"right\\\"| 14,091\\n|align=\\\"right\\\"| 29,825\\n|align=\\\"right\\\"| 63,287\\n|align=\\\"right\\\"| 134,652\\n|align=\\\"right\\\"| 287,264\\n|align=\\\"right\\\"| 614,442\\n|align=\\\"right\\\"| 1,317,533\\n|align=\\\"right\\\"| 2,831,900\\n|align=\\\"right\\\"| 6,100,852\\n|align=\\\"right\\\"| 13,172,239\\n|align=\\\"right\\\"| 28,499,827\\n|align=\\\"right\\\"| 61,786,266\\n|align=\\\"right\\\"| 134,202,509\\n|align=\\\"right\\\"| 292,011,464\\n| \\n| \\n| \\n|-\\n! ''A'' depth\\n|align=\\\"right\\\"| 1\\n|align=\\\"right\\\"| 2\\n|align=\\\"right\\\"| 3\\n|align=\\\"right\\\"| 4\\n|align=\\\"right\\\"| 8\\n|align=\\\"right\\\"| 16\\n|align=\\\"right\\\"| 32\\n|align=\\\"right\\\"| 64\\n|align=\\\"right\\\"| 128\\n|align=\\\"right\\\"| 256\\n|align=\\\"right\\\"| 512\\n|align=\\\"right\\\"| 1,024\\n|align=\\\"right\\\"| 2,048\\n|align=\\\"right\\\"| 4,096\\n|align=\\\"right\\\"| 8,192\\n|align=\\\"right\\\"| 16,384\\n|align=\\\"right\\\"| 32,768\\n|align=\\\"right\\\"| 65,536\\n|align=\\\"right\\\"| 131,072\\n|align=\\\"right\\\"| 262,144\\n|align=\\\"right\\\"| 524,288\\n|align=\\\"right\\\"| 1,048,576\\n|align=\\\"right\\\"| 2,097,152\\n|align=\\\"right\\\"| 4,194,304\\n|align=\\\"right\\\"| 8,388,608\\n| \\n| \\n| \\n| \\n| \\n| \\n|-\\n! ''B'' called\\n|align=\\\"right\\\"| 0\\n|align=\\\"right\\\"| 1\\n|align=\\\"right\\\"| 2\\n|align=\\\"right\\\"| 3\\n|align=\\\"right\\\"| 7\\n|align=\\\"right\\\"| 17\\n|align=\\\"right\\\"| 37\\n|align=\\\"right\\\"| 79\\n|align=\\\"right\\\"| 166\\n|align=\\\"right\\\"| 346\\n|align=\\\"right\\\"| 721\\n|align=\\\"right\\\"| 1,508\\n|align=\\\"right\\\"| 3,167\\n|align=\\\"right\\\"| 6,672\\n|align=\\\"right\\\"| 14,090\\n|align=\\\"right\\\"| 29,824\\n|align=\\\"right\\\"| 63,286\\n|align=\\\"right\\\"| 134,651\\n|align=\\\"right\\\"| 287,263\\n|align=\\\"right\\\"| 614,441\\n|align=\\\"right\\\"| 1,317,532\\n|align=\\\"right\\\"| 2,831,899\\n|align=\\\"right\\\"| 6,100,851\\n|align=\\\"right\\\"| 13,172,238\\n|align=\\\"right\\\"| 28,499,826\\n| \\n| \\n| \\n| \\n| \\n| \\n|-\\n! ''B'' depth\\n|align=\\\"right\\\"| 0\\n|align=\\\"right\\\"| 1\\n|align=\\\"right\\\"| 2\\n|align=\\\"right\\\"| 3\\n|align=\\\"right\\\"| 7\\n|align=\\\"right\\\"| 15\\n|align=\\\"right\\\"| 31\\n|align=\\\"right\\\"| 63\\n|align=\\\"right\\\"| 127\\n|align=\\\"right\\\"| 255\\n|align=\\\"right\\\"| 511\\n|align=\\\"right\\\"| 1,023\\n|align=\\\"right\\\"| 2,047\\n|align=\\\"right\\\"| 4,095\\n|align=\\\"right\\\"| 8,191\\n|align=\\\"right\\\"| 16,383\\n|align=\\\"right\\\"| 32,767\\n|align=\\\"right\\\"| 65,535\\n|align=\\\"right\\\"| 131,071\\n|align=\\\"right\\\"| 262,143\\n|align=\\\"right\\\"| 524,287\\n|align=\\\"right\\\"| 1,048,575\\n|align=\\\"right\\\"| 2,097,151\\n|align=\\\"right\\\"| 4,194,303\\n|align=\\\"right\\\"| 8,388,607\\n| \\n| \\n| \\n| \\n| \\n| \\n|}\\n<br>\\n;Related tasks:\\n* [[Jensen's Device]]\\n<br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\n\\nprocedure Man_Or_Boy is\\n function Zero return Integer is begin return 0; end Zero;\\n function One return Integer is begin return 1; end One;\\n function Neg return Integer is begin return -1; end Neg;\\n\\n function A\\n ( K : Integer;\\n X1, X2, X3, X4, X5 : access function return Integer\\n ) return Integer is\\n M : Integer := K; -- K is read-only in Ada. Here is a mutable copy of\\n function B return Integer is\\n begin\\n M := M - 1;\\n return A (M, B'Access, X1, X2, X3, X4);\\n end B;\\n begin\\n if M <= 0 then\\n return X4.all + X5.all;\\n else\\n return B;\\n end if;\\n end A;\\nbegin\\n Put_Line\\n ( Integer'Image\\n ( A\\n ( 10,\\n One'Access, -- Returns 1\\n Neg'Access, -- Returns -1\\n Neg'Access, -- Returns -1\\n One'Access, -- Returns 1\\n Zero'Access -- Returns 0\\n ) ) );\\nend Man_Or_Boy;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\n\\nprocedure Man_Or_Boy is\\n function Zero return Integer is (0);\\n function One return Integer is (1);\\n function Neg return Integer is (-1);\\n\\n function A\\n (K : Integer;\\n X1, X2, X3, X4, X5 : access function return Integer)\\n return Integer is\\n M : Integer := K; -- K is read-only in Ada. Here is a mutable copy of\\n function B return Integer is\\n begin\\n M := M - 1;\\n return A (M, B'Access, X1, X2, X3, X4);\\n end B;\\n begin\\n return (if M <= 0 then X4.all + X5.all else B);\\n end A;\\nbegin\\n Put_Line\\n (Integer'Image\\n (A (K => 10,\\n X1 => One'Access,\\n X2 => Neg'Access,\\n X3 => Neg'Access,\\n X4 => One'Access,\\n X5 => Zero'Access)));\\nend Man_Or_Boy;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\nuse Ada.Text_IO;\\n\\nprocedure Man_Or_Boy is\\n\\n function Zero return Integer is ( 0);\\n function One return Integer is ( 1);\\n function Neg return Integer is (-1);\\n\\n function A (K: Integer;\\n X1, X2, X3, X4, X5: access function return Integer) return Integer is\\n M : Integer := K; -- K is read-only in Ada. Here is a mutable copy of K\\n Res_A: Integer;\\n function B return Integer is\\n begin\\n M := M - 1;\\n Res_A := A (M, B'Access, X1, X2, X3, X4); -- set result of A\\n return Res_A;\\n end B;\\n begin\\n if M <= 0 then\\n return X4.all + X5.all;\\n else\\n declare\\n Dummy: constant Integer := B; -- throw away\\n begin\\n return Res_A;\\n end;\\n end if;\\n end A;\\n\\nbegin\\n\\n Put_Line (Integer'Image (A (K => 10,\\n X1 => One 'Access,\\n X2 => Neg 'Access,\\n X3 => Neg 'Access,\\n X4 => One 'Access,\\n X5 => Zero'Access)));\\n\\nend Man_Or_Boy;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"integer\\nF(list l)\\n{\\n l[1];\\n}\\n\\ninteger\\neval(list l)\\n{\\n l[0](l);\\n}\\n\\ninteger A(list);\\n\\ninteger\\nB(list l)\\n{\\n A(list(B, l[1] = l[1] - 1, l, l[-5], l[-4], l[-3], l[-2]));\\n}\\n\\ninteger\\nA(list l)\\n{\\n integer x;\\n\\n if (l[1] < 1) {\\n x = eval(l[-2]) + eval(l[-1]);\\n } else {\\n x = B(l);\\n }\\n\\n x;\\n}\\n\\ninteger\\nmain(void)\\n{\\n list f1, f0, fn1;\\n\\n l_append(f1, F);\\n l_append(f1, 1);\\n\\n l_append(f0, F);\\n l_append(f0, 0);\\n\\n l_append(fn1, F);\\n l_append(fn1, -1);\\n\\n o_(A(list(B, 10, f1, fn1, fn1, f1, f0)), \\\"\\\\n\\\");\\n\\n 0;\\n}\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"PROC a = (INT in k, PROC INT xl, x2, x3, x4, x5) INT:(\\n INT k := in k;\\n PROC b = INT: a(k-:=1, b, xl, x2, x3, x4);\\n ( k<=0 | x4 + x5 | b )\\n);\\n\\ntest:(\\n printf(($gl$,a(10, INT:1, INT:-1, INT:-1, INT:1, INT:0)))\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin\\n real procedure A (integer value k; real procedure x1, x2, x3, x4, x5);\\n begin\\n real procedure B;\\n begin k:= k - 1;\\n A (k, B, x1, x2, x3, x4)\\n end;\\n if k <= 0 then x4 + x5 else B\\n end;\\n write (r_format := \\\"A\\\", r_w := 8, r_d := 2, A (10, 1, -1, -1, 1, 0))\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"on a(k, x1, x2, x3, x4, x5)\\n\\tscript b\\n\\t\\tset k to k - 1\\n\\t\\treturn a(k, b, x1, x2, x3, x4)\\n\\tend script\\n\\tif k ≤ 0 then\\n\\t\\treturn (run x4) + (run x5)\\n\\telse\\n\\t\\treturn (run b)\\n\\tend if\\nend a\\n\\non int(x)\\n\\tscript s\\n\\t\\treturn x\\n\\tend script\\n\\treturn s\\nend int\\n\\na(10, int(1), int(-1), int(-1), int(1), int(0))\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \" HIMEM = PAGE + 200000000 : REM Increase recursion depth\\n\\n FOR k% = 0 TO 20\\n PRINT FNA(k%, ^FN1(), ^FN_1(), ^FN_1(), ^FN1(), ^FN0())\\n NEXT\\n END\\n\\n DEF FNA(k%, x1%, x2%, x3%, x4%, x5%)\\n IF k% <= 0 THEN = FN(x4%)(x4%) + FN(x5%)(x5%)\\n LOCAL b{}\\n DIM b{fn%, k%, x1%, x2%, x3%, x4%, x5%}\\n b.fn% = !^FNB()\\n b.k% = k%\\n b.x1% = x1%\\n b.x2% = x2%\\n b.x3% = x3%\\n b.x4% = x4%\\n b.x5% = x5%\\n DEF FNB(!(^b{}+4))\\n b.k% -= 1\\n = FNA(b.k%, b{}, b.x1%, b.x2%, b.x3%, b.x4%)\\n\\n DEF FN0(d%) = 0\\n DEF FN1(d%) = 1\\n DEF FN_1(d%) = -1\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"/* man-or-boy.c */\\n#include <stdio.h>\\n#include <stdlib.h>\\n\\n// --- thunks\\ntypedef struct arg\\n{\\n int (*fn)(struct arg*);\\n int *k;\\n struct arg *x1, *x2, *x3, *x4, *x5;\\n} ARG;\\n\\n// --- lambdas\\nint f_1 (ARG* _) { return -1; }\\nint f0 (ARG* _) { return 0; }\\nint f1 (ARG* _) { return 1; }\\n\\n// --- helper\\nint eval(ARG* a) { return a->fn(a); }\\n#define MAKE_ARG(...) (&(ARG){__VA_ARGS__})\\n#define FUN(...) MAKE_ARG(B, &k, __VA_ARGS__)\\n\\nint A(ARG*);\\n\\n// --- functions\\nint B(ARG* a)\\n{\\n int k = *a->k -= 1;\\n return A(FUN(a, a->x1, a->x2, a->x3, a->x4));\\n}\\n\\nint A(ARG* a)\\n{\\n return *a->k <= 0 ? eval(a->x4) + eval(a->x5) : B(a);\\n}\\n\\nint main(int argc, char **argv)\\n{\\n int k = argc == 2 ? strtol(argv[1], 0, 0) : 10;\\n printf(\\\"%d\\\\n\\\", A(FUN(MAKE_ARG(f1), MAKE_ARG(f_1), MAKE_ARG(f_1),\\n MAKE_ARG(f1), MAKE_ARG(f0))));\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#define INT(body) ({ int lambda(){ body; }; lambda; })\\nmain(){\\n int a(int k, int xl(), int x2(), int x3(), int x4(), int x5()){\\n int b(){\\n return a(--k, b, xl, x2, x3, x4);\\n }\\n return k<=0 ? x4() + x5() : b();\\n }\\n printf(\\\" %d\\\\n\\\",a(10, INT(return 1), INT(return -1), INT(return -1), INT(return 1), INT(return 0)));\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n\\ntypedef struct frame\\n{\\n int (*fn)(struct frame*);\\n union { int constant; int* k; } u;\\n struct frame *x1, *x2, *x3, *x4, *x5;\\n} FRAME;\\n\\nFRAME* Frame(FRAME* f, int* k, FRAME* x1, FRAME* x2, FRAME *x3, FRAME *x4, FRAME *x5)\\n{\\n f->u.k = k;\\n f->x1 = x1;\\n f->x2 = x2;\\n f->x3 = x3;\\n f->x4 = x4;\\n f->x5 = x5;\\n return f;\\n}\\n\\nint F(FRAME* a) { return a->u.constant; }\\n\\nint eval(FRAME* a) { return a->fn(a); }\\n\\nint A(FRAME*);\\n\\nint B(FRAME* a)\\n{\\n int k = (*a->u.k -= 1);\\n FRAME b = { B };\\n return A(Frame(&b, &k, a, a->x1, a->x2, a->x3, a->x4));\\n}\\n\\nint A(FRAME* a)\\n{\\n return *a->u.k <= 0 ? eval(a->x4) + eval(a->x5) : B(a);\\n}\\n\\nint main(int argc, char** argv)\\n{\\n int k = argc == 2 ? strtol(argv[1], 0, 0) : 10;\\n FRAME a = { B }, f1 = { F, { 1 } }, f0 = { F, { 0 } }, fn1 = { F, { -1 } };\\n\\n printf(\\\"%d\\\\n\\\", A(Frame(&a, &k, &f1, &fn1, &fn1, &f1, &f0)));\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <tr1/memory>\\nusing std::tr1::shared_ptr;\\nusing std::tr1::enable_shared_from_this;\\n\\nstruct Arg {\\n virtual int run() = 0;\\n virtual ~Arg() { };\\n};\\n\\nint A(int, shared_ptr<Arg>, shared_ptr<Arg>, shared_ptr<Arg>,\\n shared_ptr<Arg>, shared_ptr<Arg>);\\n\\nclass B : public Arg, public enable_shared_from_this<B> {\\nprivate:\\n int k;\\n const shared_ptr<Arg> x1, x2, x3, x4;\\n\\npublic:\\n B(int _k, shared_ptr<Arg> _x1, shared_ptr<Arg> _x2, shared_ptr<Arg> _x3,\\n shared_ptr<Arg> _x4)\\n : k(_k), x1(_x1), x2(_x2), x3(_x3), x4(_x4) { }\\n int run() {\\n return A(--k, shared_from_this(), x1, x2, x3, x4);\\n }\\n};\\n\\nclass Const : public Arg {\\nprivate:\\n const int x;\\npublic:\\n Const(int _x) : x(_x) { }\\n int run () { return x; }\\n};\\n\\nint A(int k, shared_ptr<Arg> x1, shared_ptr<Arg> x2, shared_ptr<Arg> x3,\\n shared_ptr<Arg> x4, shared_ptr<Arg> x5) {\\n if (k <= 0)\\n return x4->run() + x5->run();\\n else {\\n shared_ptr<Arg> b(new B(k, x1, x2, x3, x4));\\n return b->run();\\n }\\n}\\n\\nint main() {\\n std::cout << A(10, shared_ptr<Arg>(new Const(1)),\\n shared_ptr<Arg>(new Const(-1)),\\n shared_ptr<Arg>(new Const(-1)),\\n shared_ptr<Arg>(new Const(1)),\\n shared_ptr<Arg>(new Const(0))) << std::endl;\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <functional>\\n#include <iostream>\\n\\ntypedef std::function<int()> F;\\n\\nstatic int A(int k, const F &x1, const F &x2, const F &x3, const F &x4, const F &x5)\\n{\\n\\tF B = [=, &k, &B]\\n\\t{\\n\\t\\treturn A(--k, B, x1, x2, x3, x4);\\n\\t};\\n\\n\\treturn k <= 0 ? x4() + x5() : B();\\n}\\n\\nstatic F L(int n)\\n{\\n\\treturn [n] { return n; };\\n}\\n\\nint main()\\n{\\n\\tstd::cout << A(10, L(1), L(-1), L(-1), L(1), L(0)) << std::endl;\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <tr1/functional>\\n#include <iostream>\\n\\ntypedef std::tr1::function<int()> F;\\n\\nstatic int A(int k, const F &x1, const F &x2, const F &x3, const F &x4, const F &x5);\\n\\nstruct B_class {\\n int &k;\\n const F x1, x2, x3, x4;\\n B_class(int &_k, const F &_x1, const F &_x2, const F &_x3, const F &_x4) :\\n k(_k), x1(_x1), x2(_x2), x3(_x3), x4(_x4) { }\\n int operator()() const { return A(--k, *this, x1, x2, x3, x4); }\\n};\\n\\nstatic int A(int k, const F &x1, const F &x2, const F &x3, const F &x4, const F &x5)\\n{\\n F B = B_class(k, x1, x2, x3, x4);\\n return k <= 0 ? x4() + x5() : B();\\n}\\n\\nstruct L {\\n const int n;\\n L(int _n) : n(_n) { }\\n int operator()() const { return n; }\\n};\\n\\nint main()\\n{\\n std::cout << A(10, L(1), L(-1), L(-1), L(1), L(0)) << std::endl;\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\ndelegate T Func<T>();\\n\\nclass ManOrBoy\\n{\\n static void Main()\\n {\\n Console.WriteLine(A(10, C(1), C(-1), C(-1), C(1), C(0)));\\n }\\n\\n static Func<int> C(int i)\\n {\\n return delegate { return i; };\\n }\\n\\n static int A(int k, Func<int> x1, Func<int> x2, Func<int> x3, Func<int> x4, Func<int> x5)\\n {\\n Func<int> b = null;\\n b = delegate { k--; return A(k, b, x1, x2, x3, x4); };\\n return k <= 0 ? x4() + x5() : b();\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\n\\nclass ManOrBoy\\n{\\n static void Main()\\n {\\n Console.WriteLine(A(10, () => 1, () => -1, () => -1, () => 1, () => 0));\\n }\\n\\n static int A(int k, Func<int> x1, Func<int> x2, Func<int> x3, Func<int> x4, Func<int> x5)\\n {\\n Func<int> b = null;\\n b = () => { k--; return A(k, b, x1, x2, x3, x4); };\\n return k <= 0 ? x4() + x5() : b();\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"Procedure Main()\\n Local k\\n For k := 0 to 20\\n ? \\\"A(\\\", k, \\\", 1, -1, -1, 1, 0) =\\\", A(k, 1, -1, -1, 1, 0)\\n Next\\nReturn\\n\\nStatic Function A(k, x1, x2, x3, x4, x5)\\n Local ARetVal\\n Local B := {|| --k, ARetVal := A(k, B, x1, x2, x3, x4) }\\n If k <= 0\\n ARetVal := Evaluate(x4) + Evaluate(x5)\\n Else\\n B:Eval()\\n Endif\\nReturn ARetVal\\n\\nStatic Function Evaluate(x)\\n Local xVal\\n If ValType(x) == \\\"B\\\"\\n xVal := x:Eval()\\n Else\\n xVal := x\\n Endif\\nReturn xVal\\n\",\n \"language\": \"Clipper\"\n },\n {\n \"code\": \"(declare a)\\n\\n(defn man-or-boy\\n \\\"Man or boy test for Clojure\\\"\\n [k]\\n (let [k (atom k)]\\n (a k\\n (fn [] 1)\\n (fn [] -1)\\n (fn [] -1)\\n (fn [] 1)\\n (fn [] 0))))\\n\\n(defn a\\n [k x1 x2 x3 x4 x5]\\n (let [k (atom @k)]\\n (letfn [(b []\\n (swap! k dec)\\n (a k b x1 x2 x3 x4))]\\n (if (<= @k 0)\\n (+ (x4) (x5))\\n (b)))))\\n\\n(man-or-boy 10)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defun man-or-boy (x)\\n (a x (lambda () 1)\\n (lambda () -1)\\n (lambda () -1)\\n (lambda () 1)\\n (lambda () 0)))\\n\\n(defun a (k x1 x2 x3 x4 x5)\\n (labels ((b ()\\n (decf k)\\n (a k #'b x1 x2 x3 x4)))\\n (if (<= k 0)\\n (+ (funcall x4) (funcall x5))\\n (b))))\\n\\n(man-or-boy 10)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"def a(k, x1, x2, x3, x4, x5)\\n b = uninitialized -> typeof(k)\\n b = ->() { k -= 1; a(k, b, x1, x2, x3, x4) }\\n k <= 0 ? x4.call + x5.call : b.call\\nend\\n\\nputs a(10, -> {1}, -> {-1}, -> {-1}, -> {1}, -> {0})\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import core.stdc.stdio: printf;\\n\\nint a(int k, const lazy int x1, const lazy int x2, const lazy int x3,\\n const lazy int x4, const lazy int x5) pure {\\n int b() {\\n k--;\\n return a(k, b(), x1, x2, x3, x4);\\n }\\n return k <= 0 ? x4 + x5 : b();\\n}\\n\\nvoid main() {\\n printf(\\\"%d\\\\n\\\", a(10, 1, -1, -1, 1, 0));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"int A(int k, int delegate() nothrow @safe[] x...) nothrow @safe {\\n int b() nothrow @safe {\\n k--;\\n return A(k, &b, x[0], x[1], x[2], x[3]);\\n }\\n\\n return (k > 0) ? b() : x[3]() + x[4]();\\n}\\n\\nvoid main() {\\n import std.stdio;\\n\\n A(10, 1, -1, -1, 1, 0).writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"auto mb(T)(T mob) nothrow @safe { // Embeding function.\\n int b() nothrow @safe @nogc {\\n static if (is(T == int))\\n return mob;\\n else\\n return mob();\\n }\\n\\n return &b;\\n}\\n\\nint A(T)(int k, T x1, T x2, T x3, T x4, T x5) nothrow @safe {\\n static if (is(T == int)) {\\n return A(k, mb(x1), mb(x2), mb(x3), mb(x4), mb(x5));\\n } else {\\n int b() nothrow @safe {\\n k--;\\n return A(k, &b, x1, x2, x3, x4);\\n }\\n return (k <= 0) ? x4() + x5() : b();\\n }\\n}\\n\\nvoid main() {\\n import std.stdio;\\n\\n A(10, 1, -1, -1, 1, 0).writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio;\\n\\ninterface B {\\n int run();\\n}\\n\\nint A(int k, int x1, int x2, int x3, int x4, int x5) {\\n B mb(int a) {\\n return new class() B {\\n int run() {\\n return a;\\n }\\n };\\n }\\n\\n return A(k, mb(x1), mb(x2), mb(x3), mb(x4), mb(x5));\\n}\\n\\nint A(int k, B x1, B x2, B x3, B x4, B x5) {\\n if (k <= 0) {\\n return x4.run() + x5.run();\\n } else {\\n return (new class() B {\\n int m;\\n\\n this() {\\n this.m = k;\\n }\\n\\n int run() {\\n m--;\\n return A(m, this, x1, x2, x3, x4);\\n }\\n }).run();\\n }\\n}\\n\\nvoid main() {\\n writeln(A(10, 1, -1, -1, 1, 0));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.bigint, std.functional;\\n\\n// Adapted from C code by Goran Weinholt, adapted from Knuth code.\\nBigInt A(in int k, in int x1, in int x2, in int x3,\\n in int x4, in int x5) {\\n static struct Inner {\\n static BigInt c1_(in int k) {\\n if (k > 5)\\n return c1(k - 1) + c2(k - 1);\\n static immutable t = [0, 0, 0, 1, 2, 3];\\n return t[k].BigInt;\\n }\\n alias c1 = memoize!c1_;\\n\\n static BigInt c2_(in int k) {\\n if (k > 5)\\n return c2(k - 1) + c3(k - 1);\\n static immutable t = [0, 0, 1, 1, 1, 2];\\n return t[k].BigInt;\\n }\\n alias c2 = memoize!c2_;\\n\\n static BigInt c3_(in int k) {\\n if (k > 5)\\n return c3(k - 1) + c4(k);\\n static immutable t = [0, 1, 1, 0, 0, 1];\\n return t[k].BigInt;\\n }\\n alias c3 = memoize!c3_;\\n\\n static BigInt c4_(in int k) {\\n if (k > 5)\\n return c1(k - 1) + c4(k - 1) - 1;\\n static immutable t = [1, 1, 0, 0, 0, 0];\\n return t[k].BigInt;\\n }\\n alias c4 = memoize!c4_;\\n\\n static int c5(in int k) pure nothrow {\\n return !!k;\\n }\\n }\\n\\n with (Inner)\\n return c1(k) * x1 + c2(k) * x2 + c3(k) * x3 +\\n c4(k) * x4 + c5(k) * x5;\\n}\\n\\nvoid main() {\\n import std.stdio, std.conv, std.range;\\n\\n foreach (immutable i; 0 .. 40)\\n writeln(i, \\\" \\\", A(i, 1, -1, -1, 1, 0));\\n\\n writefln(\\\"...\\\\n500 %-(%s\\\\\\\\\\\\n %)\\\",\\n A(500, 1, -1, -1, 1, 0).text.chunks(60));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"type\\n TFunc<T> = reference to function: T;\\n\\nfunction C(x: Integer): TFunc<Integer>;\\nbegin\\n Result := function: Integer\\n begin\\n Result := x;\\n end;\\nend;\\n\\nfunction A(k: Integer; x1, x2, x3, x4, x5: TFunc<Integer>): Integer;\\nvar\\n b: TFunc<Integer>;\\nbegin\\n b := function: Integer\\n begin\\n Dec(k);\\n Result := A(k, b, x1, x2, x3, x4);\\n end;\\n if k <= 0 then\\n Result := x4 + x5\\n else\\n Result := b;\\nend;\\n\\nbegin\\n Writeln(A(10, C(1), C(-1), C(-1), C(1), C(0))); // -67 output\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"func _C(i) {\\n () => i\\n}\\n\\nfunc _A(k, x1, x2, x3, x4, x5) {\\n var b\\n b = () => {\\n k -= 1\\n _A(k, b, x1, x2, x3, x4)\\n }\\n if k <= 0 {\\n x4() + x5()\\n } else {\\n b()\\n }\\n}\\n\\nfor i in 1..20 {\\n let res = _A(i, _C(1), _C(-1), _C(-1), _C(1), _C(0))\\n print(\\\"\\\\(i)\\\\t= \\\\(res)\\\")\\n}\\n\",\n \"language\": \"Dyalect\"\n },\n {\n \"code\": \"define method a\\n (k :: <integer>, x1 :: <function>, x2 :: <function>, x3 :: <function>,\\n x4 :: <function>, x5 :: <function>)\\n => (i :: <integer>)\\n\\n local b() => (i :: <integer>)\\n k := k - 1;\\n a(k, b, x1, x2, x3, x4)\\n end;\\n\\n if (k <= 0) x4() + x5() else b() end if\\n\\nend method a;\\n\\ndefine method man-or-boy\\n (x :: <integer>)\\n => (i :: <integer>)\\n\\n a(x, method() 1 end,\\n method() -1 end,\\n method() -1 end,\\n method() 1 end,\\n method() 0 end)\\n\\nend method man-or-boy;\\n\\nformat-out(\\\"%d\\\\n\\\", man-or-boy(10))\\n\",\n \"language\": \"Dylan\"\n },\n {\n \"code\": \"def a(var k, &x1, &x2, &x3, &x4, &x5) {\\n def bS; def &b := bS\\n bind bS {\\n to get() {\\n k -= 1\\n return a(k, &b, &x1, &x2, &x3, &x4)\\n }\\n }\\n return if (k <= 0) { x4 + x5 } else { b }\\n}\\n\\ndef p := 1\\ndef n := -1\\ndef z := 0\\nprintln(a(10, &p, &n, &n, &p, &z))\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \";; copied from Scheme\\n(define (A k x1 x2 x3 x4 x5)\\n (define (B)\\n (set! k (- k 1))\\n (A k B x1 x2 x3 x4))\\n (if (<= k 0)\\n (+ (x4) (x5))\\n (B)))\\n\\n(A 10 (lambda () 1) (lambda () -1) (lambda () -1) (lambda () 1) (lambda () 0))\\n → -67\\n(A 13 (lambda () 1) (lambda () -1) (lambda () -1) (lambda () 1) (lambda () 0))\\n → -642\\n(A 14 ..)\\n❗ InternalError : too much recursion - JS internal error (please, report it)-\\n → stack overflow using FireFox\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"open monad io unsafe.cell unsafe.console\\n\\nliftM2 f m1 m2 = do\\n x1 <- m1\\n x2 <- m2\\n return (f x1 x2)\\n\\na k x1 x2 x3 x4 x5 = do\\n r <- return $ ref k\\n let b = & do k <- return $ pred (valueof r)\\n a k b x1 x2 x3 x4\\n if k <= 0 then liftM2 (+) x4 x5 else b\\n\\n_ = a 10 (!!1) (!! -1) (!! -1) (!!1) (!!0) >>= (putStr << show) ::: IO\\n where (!!) f = & return f ::: IO\\n\",\n \"language\": \"Ela\"\n },\n {\n \"code\": \"import extensions;\\n\\nA(k,x1,x2,x3,x4,x5)\\n{\\n var m := new ref<int>(k);\\n\\n var b := { m -= 1; ^ A(m,this self,x1,x2,x3,x4) };\\n\\n if (m <= 0)\\n {\\n ^ x4() + x5()\\n }\\n else\\n {\\n ^ b()\\n }\\n}\\n\\npublic program()\\n{\\n for(int n := 0; n <= 14; n += 1)\\n {\\n console.printLine(A(n,{^1},{^-1},{^-1},{^1},{^0}))\\n }\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"fun A = int by int k, fun x1, fun x2, fun x3, fun x4, fun x5\\n fun B = int by block do return A(--k, B, x1, x2, x3, x4) end\\n return when(k <= 0, x4() + x5(), B())\\nend\\nfun C = fun by int i\\n return int by block do return i end\\nend\\nfor int i = 0; i <= 11; i++\\n writeLine(\\\"A(\\\" + i + \\\") = \\\" + A(i, C(1), C(-1), C(-1), C(1), C(0) ))\\nend\\n\",\n \"language\": \"EMal\"\n },\n {\n \"code\": \"[<EntryPoint>]\\nlet main (args : string[]) =\\n let k = int(args.[0])\\n\\n let l x = fun() -> x\\n\\n let rec a k x1 x2 x3 x4 x5 =\\n if k <= 0 then\\n x4() + x5()\\n else\\n let k = ref k\\n let rec b() =\\n k := !k - 1\\n a !k b x1 x2 x3 x4\\n b()\\n\\n a k (l 1) (l -1) (l -1) (l 1) (l 0)\\n |> printfn \\\"%A\\\"\\n\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"type Tramp<'t> =\\n | Delay of (unit -> Tramp<'t>)\\n | Bind of Tramp<'t> * ('t -> Tramp<'t>)\\n | Return of 't\\n | ReturnFrom of Tramp<'t>\\n\\ntype Tramp() =\\n member this.Delay(f) = Delay f\\n member this.Bind(x, f) = Bind(x, f)\\n member this.Return(x) = Return x\\n member this.ReturnFrom(x) = ReturnFrom x\\n\\nlet tramp = Tramp()\\n\\nlet run (tr : Tramp<'t>) =\\n let rec loop tr stack =\\n match tr with\\n | Delay f -> loop (f()) stack\\n | Bind(x, f) -> loop x (f :: stack)\\n | Return x ->\\n match stack with\\n | [] -> x\\n | f :: stack' -> loop (f x) stack'\\n | ReturnFrom tr -> loop tr stack\\n loop tr []\\n\\n[<EntryPoint>]\\nlet main (args : string[]) =\\n let k = int(args.[0])\\n\\n let l x = fun() -> Return x\\n\\n tramp {\\n let rec a k x1 x2 x3 x4 x5 =\\n tramp {\\n if k <= 0 then\\n let! x4' = x4()\\n let! x5' = x5()\\n return x4' + x5'\\n else\\n let k = ref k\\n let rec b() =\\n tramp {\\n k := !k - 1\\n return! a !k b x1 x2 x3 x4\\n }\\n return! b()\\n }\\n\\n return! a k (l 1) (l -1) (l -1) (l 1) (l 0)\\n }\\n |> run\\n |> printfn \\\"%A\\\"\\n\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"[<EntryPoint>]\\nlet main (args : string[]) =\\n let k = int(args.[0])\\n\\n let l x cont = cont x\\n\\n let rec a k x1 x2 x3 x4 x5 cont =\\n if k <= 0 then\\n x4 (fun n4 -> x5 (fun n5 -> cont (n4+n5)))\\n else\\n let mutable k = k\\n let rec b cont =\\n k <- k - 1\\n a k b x1 x2 x3 x4 cont\\n b cont\\n\\n a k (l 1) (l -1) (l -1) (l 1) (l 0) (printfn \\\"%d\\\")\\n\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"class ManOrBoy\\n{\\n Void main()\\n {\\n echo(A(10, |->Int|{1}, |->Int|{-1}, |->Int|{-1}, |->Int|{1}, |->Int|{0}));\\n }\\n\\n static Int A(Int k, |->Int| x1, |->Int| x2, |->Int| x3, |->Int| x4, |->Int| x5)\\n {\\n |->Int|? b\\n b = |->Int| { k--; return A(k, b, x1, x2, x3, x4) }\\n return k <= 0 ? x4() + x5() : b()\\n }\\n}\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \": A {: w^ k x1 x2 x3 xt: x4 xt: x5 | w^ B :} recursive\\n k @ 0<= IF x4 x5 f+ ELSE\\n B k x1 x2 x3 action-of x4 [{: B k x1 x2 x3 x4 :}L\\n -1 k +!\\n k @ B @ x1 x2 x3 x4 A ;] dup B !\\n execute THEN ;\\n10 [: 1e ;] [: -1e ;] 2dup swap [: 0e ;] A f.\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"module man_or_boy\\n\\nimplicit none\\n\\ncontains\\n\\n recursive integer function A(k,x1,x2,x3,x4,x5) result(res)\\n integer, intent(in) :: k\\n interface\\n recursive integer function x1()\\n end function\\n recursive integer function x2()\\n end function\\n recursive integer function x3()\\n end function\\n recursive integer function x4()\\n end function\\n recursive integer function x5()\\n end function\\n end interface\\n integer :: m\\n if ( k <= 0 ) then\\n res = x4()+x5()\\n else\\n m = k\\n res = B()\\n end if\\n\\n contains\\n\\n recursive integer function B() result(res)\\n m = m-1\\n res = A(m,B,x1,x2,x3,x4)\\n end function B\\n\\n end function A\\n\\n\\n recursive integer function one() result(res)\\n res = 1\\n end function\\n\\n recursive integer function minus_one() result(res)\\n res = -1\\n end function\\n\\n recursive integer function zero() result(res)\\n res = 0\\n end function\\n\\nend module man_or_boy\\n\\nprogram test\\n use man_or_boy\\n write (*,*) A(10,one,minus_one,minus_one,one,zero)\\nend program test\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"package main\\nimport \\\"fmt\\\"\\n\\nfunc a(k int, x1, x2, x3, x4, x5 func() int) int {\\n\\tvar b func() int\\n\\tb = func() int {\\n\\t\\tk--\\n\\t\\treturn a(k, b, x1, x2, x3, x4)\\n\\t}\\n\\tif k <= 0 {\\n\\t\\treturn x4() + x5()\\n\\t}\\n\\treturn b()\\n}\\n\\nfunc main() {\\n\\tx := func(i int) func() int { return func() int { return i } }\\n\\tfmt.Println(a(10, x(1), x(-1), x(-1), x(1), x(0)))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc A(k int, x1, x2, x3, x4, x5 func() int) (a int) {\\n\\tvar B func() int\\n\\tB = func() (b int) {\\n\\t\\tk--\\n\\t\\ta = A(k, B, x1, x2, x3, x4)\\n\\t\\tb = a\\n\\t\\treturn\\n\\t}\\n\\tif k <= 0 {\\n\\t\\ta = x4() + x5()\\n\\t} else {\\n\\t\\t_ = B()\\n\\t}\\n\\treturn\\n}\\n\\nfunc main() {\\n\\tK := func(x int) func() int { return func() int { return x } }\\n\\tfmt.Println(A(10, K(1), K(-1), K(-1), K(1), K(0)))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc eval(v interface{}) int {\\n\\tswitch v := v.(type) {\\n\\tcase int:\\n\\t\\treturn v\\n\\tcase func() int:\\n\\t\\treturn v()\\n\\t}\\n\\tpanic(\\\"bad type\\\")\\n\\treturn 0\\n}\\n\\nfunc A(k int, x1, x2, x3, x4, x5 interface{}) (a int) {\\n\\tvar B func() int\\n\\tB = func() (b int) {\\n\\t\\tk--\\n\\t\\ta = A(k, B, x1, x2, x3, x4)\\n\\t\\tb = a\\n\\t\\treturn\\n\\t}\\n\\tif k <= 0 {\\n\\t\\ta = eval(x4) + eval(x5)\\n\\t} else {\\n\\t\\t_ = B()\\n\\t}\\n\\treturn\\n}\\n\\nfunc main() {\\n\\tfmt.Println(A(10, 1, -1, -1, 1, 0))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/big\\\"\\n)\\n\\nfunc A(k int) *big.Int {\\n if k < 6 {\\n var x1, x2, x3, x4 int64 = 1, -1, -1, 1\\n c1 := []int64{0, 0, 0, 1, 2, 3}[k]\\n c2 := []int64{0, 0, 1, 1, 1, 2}[k]\\n c3 := []int64{0, 1, 1, 0, 0, 1}[k]\\n c4 := []int64{1, 1, 0, 0, 0, 0}[k]\\n t := c1*x1 + c2*x2 + c3*x3 + c4*x4\\n return big.NewInt(t)\\n }\\n one := big.NewInt(1)\\n c0 := big.NewInt(3)\\n c1 := big.NewInt(2)\\n c2 := big.NewInt(1)\\n c3 := big.NewInt(0)\\n for j := 5; j < k; j++ {\\n c3.Sub(c3.Add(c3, c0), one)\\n c0.Add(c0, c1)\\n c1.Add(c1, c2)\\n c2.Add(c2, c3)\\n }\\n return c0.Add(c0.Sub(c0.Sub(c0, c1), c2), c3)\\n}\\n\\nfunc p(k int) {\\n fmt.Printf(\\\"A(%d) = \\\", k)\\n if s := A(k).String(); len(s) < 60 {\\n fmt.Println(s)\\n } else {\\n fmt.Printf(\\\"%s...%s (%d digits)\\\\n\\\",\\n s[:6], s[len(s)-5:], len(s)-1)\\n }\\n}\\n\\nfunc main() {\\n for i := 0; i < 40; i++ {\\n p(i)\\n }\\n p(500)\\n p(10000)\\n p(1e6)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"function A(in_k: int, x1(): int, x2(): int, x3(): int, x4(): int, x5(): int): int {\\n var k = in_k\\n var B(): int // B is a function variable\\n B = \\\\ -> {\\n k = k-1;\\n return A(k, B, x1, x2, x3, x4)\\n }\\n return k<=0 ? x4()+x5() : B()\\n}\\nprint(A(10, \\\\ -> 1, \\\\ -> -1, \\\\ -> -1, \\\\ -> 1, \\\\ -> 0))\\n\",\n \"language\": \"Gosu\"\n },\n {\n \"code\": \"def a; a = { k, x1, x2, x3, x4, x5 ->\\n def b; b = {\\n a (--k, b, x1, x2, x3, x4)\\n }\\n k <= 0 ? x4() + x5() : b()\\n}\\n\\ndef x = { n -> { it -> n } }\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"println (a(10, x(1), x(-1), x(-1), x(1), x(0)))\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"(0..20).each { k ->\\n printf (\\\"%3d: %7d\\\\n\\\", k, a(k, x(1), x(-1), x(-1), x(1), x(0)))\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Data.IORef (modifyIORef, newIORef, readIORef)\\n\\na\\n :: (Enum a, Num b, Num a, Ord a)\\n => a -> IO b -> IO b -> IO b -> IO b -> IO b -> IO b\\na k x1 x2 x3 x4 x5 = do\\n r <- newIORef k\\n let b = do\\n k <- pred ! r\\n a k b x1 x2 x3 x4\\n if k <= 0\\n then (+) <$> x4 <*> x5\\n else b\\n where\\n f !r = modifyIORef r f >> readIORef r\\n\\nmain :: IO ()\\nmain = a 10 # 1 # (-1) # (-1) # 1 # 0 >>= print\\n where\\n ( # ) f = f . return\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"record mutable(value) # we need mutable integers\\n # ... be obvious when we break normal scope rules\\nprocedure main(arglist) # supply the initial k value\\nk := integer(arglist[1])|10 # .. or default to 10=default\\nwrite(\\\"Man or Boy = \\\", A( k, 1, -1, -1, 1, 0 ) )\\nend\\n\\nprocedure eval(ref) # evaluator to distinguish between a simple value and a code reference\\nreturn if type(ref) == \\\"co-expression\\\" then @ref else ref\\nend\\n\\nprocedure A(k,x1,x2,x3,x4,x5) # Knuth's A\\nk := mutable(k) # make k mutable for B\\nreturn if k.value <= 0 then # -> boy compilers may recurse and die here\\n eval(x4) + eval(x5) # the crux of separating man .v. boy compilers\\nelse # -> boy compilers can run into trouble at k=5+\\n B(k,x1,x2,x3,x4,x5)\\nend\\n\\nprocedure B(k,x1,x2,x3,x4,x5) # Knuth's B\\nk.value -:= 1 # diddle A's copy of k\\nreturn A(k.value, create |B(k,x1,x2,x3,x4,x5),x1,x2,x3,x4) # call A with a new k and 5 x's\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"record defercall(proc,arglist) # light weight alternative to co-expr for MoB\\n\\nprocedure eval(ref) # evaluator to distinguish between a simple value and a code reference\\nreturn if type(ref) == \\\"defercall\\\" then ref.proc!ref.arglist else ref\\nend\\n\\nprocedure B(k,x1,x2,x3,x4,x5) # Knuth's B\\nk.value -:= 1 # diddle A's copy of k\\nreturn A(k.value, defercall(B,[k,x1,x2,x3,x4,x5]),x1,x2,x3,x4)# call A with a new k and 5 x's\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"Range\\n\\na := method(k, xs,\\n b := block(\\n k = k -1\\n a(k, list(b, xs slice(0,4)) flatten))\\n if(k <= 0,\\n (xs at(3) call) + (xs at(4) call),\\n b call))\\n\\nf := method(x, block(x))\\n1 to(500) foreach(k,\\n (k .. \\\" \\\") print\\n a(k, list(1, -1, -1, 1, 0) map (x, f(x))) println)\\n\",\n \"language\": \"Io\"\n },\n {\n \"code\": \"A=:4 :0\\n L=.cocreate'' NB. L is context where names are defined.\\n k__L=:x\\n '`x1__L x2__L x3__L x4__L x5__L'=:y\\n if.k__L<:0 do.a__L=:(x4__L + x5__L)f.'' else. L B '' end.\\n (coerase L)]]]a__L\\n)\\n\\nB=:4 :0\\n L=.x\\n k__L=:k__L-1\\n a__L=:k__L A L&B`(x1__L f.)`(x2__L f.)`(x3__L f.)`(x4__L f.)\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 10 A 1:`_1:`_1:`1:`0:\\n_67\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.function.DoubleSupplier;\\n\\npublic class ManOrBoy {\\n\\n static double A(int k, DoubleSupplier x1, DoubleSupplier x2,\\n DoubleSupplier x3, DoubleSupplier x4, DoubleSupplier x5) {\\n\\n DoubleSupplier B = new DoubleSupplier() {\\n int m = k;\\n public double getAsDouble() {\\n return A(--m, this, x1, x2, x3, x4);\\n }\\n };\\n\\n return k <= 0 ? x4.getAsDouble() + x5.getAsDouble() : B.getAsDouble();\\n }\\n\\n public static void main(String[] args) {\\n System.out.println(A(10, () -> 1.0, () -> -1.0, () -> -1.0, () -> 1.0, () -> 0.0));\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"public class ManOrBoy {\\n interface Arg {\\n public int run();\\n }\\n\\n public static int A(final int k, final Arg x1, final Arg x2,\\n final Arg x3, final Arg x4, final Arg x5) {\\n if (k <= 0)\\n return x4.run() + x5.run();\\n return new Arg() {\\n int m = k;\\n public int run() {\\n m--;\\n return A(m, this, x1, x2, x3, x4);\\n }\\n }.run();\\n }\\n public static Arg C(final int i) {\\n return new Arg() {\\n public int run() { return i; }\\n };\\n }\\n\\n public static void main(String[] args) {\\n System.out.println(A(10, C(1), C(-1), C(-1), C(1), C(0)));\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function a(k, x1, x2, x3, x4, x5) {\\n function b() {\\n k -= 1;\\n return a(k, b, x1, x2, x3, x4);\\n }\\n return (k > 0) ? b() : x4() + x5();\\n}\\n\\n// this uses lambda wrappers around the numeric arguments\\nfunction x(n) {\\n return function () {\\n return n;\\n };\\n}\\nalert(a(10, x(1), x(-1), x(-1), x(1), x(0)));\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"var x = n => () => n;\\n\\nvar a = (k, x1, x2, x3, x4, x5) => {\\n var b = () => a(--k, b, x1, x2, x3, x4); //decrement k before use\\n return (k > 0) ? b() : x4() + x5();\\n};\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"/* Knuth's Man or boy test (local references in recursion), in Jsish */\\n/* As noted, needs a fair sized stack depth, default is 200 in jsish v2.8.24 */\\nInterp.conf({maxDepth:2048});\\n\\nfunction a(k, x1, x2, x3, x4, x5) {\\n function b() {\\n k -= 1;\\n return a(k, b, x1, x2, x3, x4);\\n }\\n return (k > 0) ? b() : x4() + x5();\\n}\\n\\n// this uses lambda wrappers around the numeric arguments\\nfunction x(n) {\\n return function () {\\n return n;\\n };\\n}\\n\\nputs(a(10, x(1), x(-1), x(-1), x(1), x(0)));\\n\\n/*\\n=!EXPECTSTART!=\\n-67\\n=!EXPECTEND!=\\n*/\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"function a(k, x1, x2, x3, x4, x5)\\n b = ()-> a(k-=1, b, x1, x2, x3, x4);\\n k <= 0 ? (x4() + x5()) : b();\\nend\\n\\nprintln(a(10, ()->1, ()->-1, ()->-1, ()->1, ()->0));\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.3\\n\\ntypealias Func = () -> Int\\n\\nfun a(k: Int, x1: Func, x2: Func, x3: Func, x4: Func, x5: Func): Int {\\n var kk = k\\n fun b(): Int = a(--kk, ::b, x1, x2, x3, x4)\\n return if (kk <= 0) x4() + x5() else b()\\n}\\n\\nfun main(args: Array<String>) {\\n println(\\\" k a\\\")\\n for (k in 0..12) {\\n println(\\\"${\\\"%2d\\\".format(k)}: ${a(k, { 1 }, { -1 }, { -1 }, { 1 }, { 0 })}\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"function a(k,x1,x2,x3,x4,x5)\\n local function b()\\n k = k - 1\\n return a(k,b,x1,x2,x3,x4)\\n end\\n if k <= 0 then return x4() + x5() else return b() end\\nend\\n\\nfunction K(n)\\n return function()\\n return n\\n end\\nend\\n\\nprint(a(10, K(1), K(-1), K(-1), K(1), K(0)))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"$RecursionLimit = 1665; (* anything less fails for k0 = 10 *)\\n a[k0_, x1_, x2_, x3_, x4_, x5_] := Module[{k, b },\\n k = k0;\\n b = (k--; a[k, b, x1, x2, x3, x4]) &;\\n If[k <= 0, x4[] + x5[], b[]]]\\n a[10, 1 &, -1 &, -1 &, 1 &, 0 &]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"MODULE Main;\\nIMPORT IO;\\n\\nTYPE Function = PROCEDURE ():INTEGER;\\n\\nPROCEDURE A(k: INTEGER; x1, x2, x3, x4, x5: Function): INTEGER =\\n\\n PROCEDURE B(): INTEGER =\\n BEGIN\\n DEC(k);\\n RETURN A(k, B, x1, x2, x3, x4);\\n END B;\\n\\nBEGIN\\n IF k <= 0 THEN\\n RETURN x4() + x5();\\n ELSE\\n RETURN B();\\n END;\\nEND A;\\n\\nPROCEDURE F0(): INTEGER = BEGIN RETURN 0; END F0;\\nPROCEDURE F1(): INTEGER = BEGIN RETURN 1; END F1;\\nPROCEDURE Fn1(): INTEGER = BEGIN RETURN -1; END Fn1;\\n\\nBEGIN\\n IO.PutInt(A(10, F1, Fn1, Fn1, F1, F0));\\n IO.Put(\\\"\\\\n\\\");\\nEND Main.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"import sugar\\n\\nproc a(k: int; x1, x2, x3, x4, x5: proc(): int): int =\\n var k = k\\n proc b(): int =\\n dec k\\n a(k, b, x1, x2, x3, x4)\\n if k <= 0: x4() + x5()\\n else: b()\\n\\necho a(10, () => 1, () => -1, () => -1, () => 1, () => 0)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"interface Arg {\\n method : virtual : public : Run() ~ Int;\\n}\\n\\nclass ManOrBoy {\\n New() {}\\n\\n function : A(mb : ManOrBoy, k : Int, x1 : Arg, x2 : Arg, x3 : Arg, x4 : Arg, x5 : Arg) ~ Int {\\n if(k <= 0) {\\n return x4->Run() + x5->Run();\\n };\\n\\n return Base->New(mb, k, x1, x2, x3, x4) implements Arg {\\n @mb : ManOrBoy; @k : Int; @x1 : Arg; @x2 : Arg; @x3 : Arg; @x4 : Arg; @m : Int;\\n\\n New(mb : ManOrBoy, k : Int, x1 : Arg, x2 : Arg, x3 : Arg, x4 : Arg) {\\n @mb := mb; @k := k; @x1 := x1; @x2 := x2; @x3 := x3; @x4 := x4; @m := @k;\\n }\\n\\n method : public : Run() ~ Int {\\n @m -= 1;\\n return @mb->A(@mb, @m, @self, @x1, @x2, @x3, @x4);\\n }\\n }->Run();\\n }\\n\\n function : C(i : Int) ~ Arg {\\n return Base->New(i) implements Arg {\\n @i : Int;\\n New(i : Int) {\\n @i := i;\\n }\\n\\n method : public : Run() ~ Int {\\n return @i;\\n }\\n };\\n }\\n\\n function : Main(args : String[]) ~ Nil {\\n mb := ManOrBoy->New();\\n mb->A(mb, 10, C(1), C(-1), C(-1), C(1), C(0))->PrintLine();\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"#import <Foundation/Foundation.h>\\n\\ntypedef NSInteger (^IntegerBlock)(void);\\n\\nNSInteger A (NSInteger kParam, IntegerBlock x1, IntegerBlock x2, IntegerBlock x3, IntegerBlock x4, IntegerBlock x5) {\\n __block NSInteger k = kParam;\\n __block __weak IntegerBlock weak_B;\\n IntegerBlock B;\\n weak_B = B = ^ {\\n return A(--k, weak_B, x1, x2, x3, x4);\\n };\\n return k <= 0 ? x4() + x5() : B();\\n}\\n\\nIntegerBlock K (NSInteger n) {\\n return ^{return n;};\\n}\\n\\nint main (int argc, const char * argv[]) {\\n @autoreleasepool {\\n NSInteger result = A(10, K(1), K(-1), K(-1), K(1), K(0));\\n NSLog(@\\\"%d\\\\n\\\", result);\\n }\\n return 0;\\n}\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"#import <Foundation/Foundation.h>\\n\\ntypedef NSInteger (^IntegerBlock)(void);\\n\\nNSInteger A (NSInteger kParam, IntegerBlock x1, IntegerBlock x2, IntegerBlock x3, IntegerBlock x4, IntegerBlock x5) {\\n __block NSInteger k = kParam;\\n __block IntegerBlock B;\\n B = ^ {\\n return A(--k, B, x1, x2, x3, x4);\\n };\\n return k <= 0 ? x4() + x5() : B();\\n}\\n\\nIntegerBlock K (NSInteger n) {\\n return [[^{return n;} copy] autorelease];\\n}\\n\\nint main (int argc, const char * argv[]) {\\n NSAutoreleasePool *pool = [[NSAutoreleasePool alloc] init];\\n NSInteger result = A(10, K(1), K(-1), K(-1), K(1), K(0));\\n NSLog(@\\\"%d\\\\n\\\", result);\\n [pool drain];\\n return 0;\\n}\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"@protocol IntegerFun <NSObject>\\n-(NSInteger)call;\\n@end\\n\\nNSInteger A (NSInteger kParam, id<IntegerFun> x1, id<IntegerFun> x2, id<IntegerFun> x3, id<IntegerFun> x4, id<IntegerFun> x5);\\n\\n@interface B_Class : NSObject <IntegerFun> {\\n NSInteger *k;\\n id<IntegerFun> x1, x2, x3, x4;\\n}\\n-(id)initWithK:(NSInteger *)k x1:(id<IntegerFun>)x1 x2:(id<IntegerFun>)x2 x3:(id<IntegerFun>)x3 x4:(id<IntegerFun>)x4;\\n@end\\n\\n@implementation B_Class\\n-(id)initWithK:(NSInteger *)_k x1:(id<IntegerFun>)_x1 x2:(id<IntegerFun>)_x2 x3:(id<IntegerFun>)_x3 x4:(id<IntegerFun>)_x4 {\\n if ((self = [super init])) {\\n k = _k;\\n x1 = [_x1 retain];\\n x2 = [_x2 retain];\\n x3 = [_x3 retain];\\n x4 = [_x4 retain];\\n }\\n return self;\\n}\\n-(void)dealloc {\\n [x1 release];\\n [x2 release];\\n [x3 release];\\n [x4 release];\\n [super dealloc];\\n}\\n-(NSInteger)call {\\n return A(--*k, self, x1, x2, x3, x4);\\n}\\n@end\\n\\nNSInteger A (NSInteger k, id<IntegerFun> x1, id<IntegerFun> x2, id<IntegerFun> x3, id<IntegerFun> x4, id<IntegerFun> x5) {\\n id<IntegerFun> B = [[[B_Class alloc] initWithK:&k x1:x1 x2:x2 x3:x3 x4:x4] autorelease];\\n return k <= 0 ? [x4 call] + [x5 call] : [B call];\\n}\\n\\n@interface K : NSObject <IntegerFun> {\\n NSInteger n;\\n}\\n-(id)initWithN:(NSInteger)n;\\n@end\\n\\n@implementation K\\n-(id)initWithN:(NSInteger)_n {\\n if ((self = [super init])) {\\n n = _n;\\n }\\n return self;\\n}\\n-(NSInteger)call {\\n return n;\\n}\\n@end\\n\\nint main(int argc, const char *argv[]) {\\n NSAutoreleasePool *pool = [[NSAutoreleasePool alloc] init];\\n\\n NSInteger result = A(10,\\n [[[K alloc] initWithN:1] autorelease],\\n [[[K alloc] initWithN:-1] autorelease],\\n [[[K alloc] initWithN:-1] autorelease],\\n [[[K alloc] initWithN:1] autorelease],\\n [[[K alloc] initWithN:0] autorelease]);\\n NSLog(@\\\"%ld\\\\n\\\", result);\\n\\n [pool release];\\n return 0;\\n}\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"let rec a k x1 x2 x3 x4 x5 =\\n if k <= 0 then\\n x4 () + x5 ()\\n else\\n let m = ref k in\\n let rec b () =\\n decr m;\\n a !m b x1 x2 x3 x4\\n in\\n b ()\\n\\nlet () =\\n Printf.printf \\\"%d\\\\n\\\" (a 10 (fun () -> 1) (fun () -> -1) (fun () -> -1) (fun () -> 1) (fun () -> 0))\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"core:fmt\\\"\\nimport \\\"core:os\\\"\\nimport \\\"core:strconv\\\"\\n\\nArg :: struct {\\n fn : proc (^Arg) -> int,\\n k : ^int,\\n x1, x2, x3, x4, x5 : ^Arg,\\n}\\n\\nB :: proc (a : ^Arg) -> int {\\n a.k^ -= 1\\n k := a.k^\\n return A(&Arg { fn = B, k = &k, x1 = a, x2 = a.x1, x3 = a.x2, x4 = a.x3, x5 = a.x4 } )\\n}\\n\\nA :: proc (a : ^Arg) -> int {\\n return a.x4->fn() + a.x5->fn() if a.k^ <= 0 else B(a)\\n}\\n\\nmain :: proc () {\\n f_1 :: proc (^Arg) -> int { return -1 }\\n f0 :: proc (^Arg) -> int { return 0 }\\n f1 :: proc (^Arg) -> int { return 1 }\\n\\n k := strconv.atoi(os.args[1]) if len(os.args) == 2 else 10\\n fmt.println(A(&Arg { fn = B, k = &k, x1 = &Arg { fn = f1 }, x2 = &Arg { fn = f_1 }, x3 = &Arg { fn = f_1 }, x4 = &Arg { fn = f1 }, x5 = &Arg { fn = f0 } }))\\n}\\n\",\n \"language\": \"Odin\"\n },\n {\n \"code\": \"; Because argument \\\"k\\\" is a small number, it's a value, not an object.\\n; So we must 'pack' it in object - 'box' it; And 'unbox' when we try to get value.\\n\\n(define (box x) (list x))\\n(define (unbox x) (car x))\\n(define (copy x) (box (unbox x)))\\n\\n(define (A k x1 x2 x3 x4 x5)\\n (define (B)\\n (set-car! k (- (unbox k) 1))\\n (A (copy k) B x1 x2 x3 x4))\\n\\n (if (<= (unbox k) 0)\\n (+ (x4) (x5))\\n (B)))\\n\\n(define (man-or-boy N)\\n (A (box N)\\n (lambda () 1)\\n (lambda () -1)\\n (lambda () -1)\\n (lambda () 1)\\n (lambda () 0)))\\n\\n(print (man-or-boy 10))\\n(print (man-or-boy 15))\\n(print (man-or-boy 20))\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"declare\\n fun {A K X1 X2 X3 X4 X5}\\n ReturnA = {NewCell undefined}\\n fun {B}\\n ReturnB = {NewCell undefined}\\n in\\n K := @K - 1\\n ReturnA := {A {NewCell @K} B X1 X2 X3 X4}\\n ReturnB := @ReturnA\\n @ReturnB\\n end\\n in\\n if @K =< 0 then ReturnA := {X4} + {X5} else _ = {B} end\\n @ReturnA\\n end\\n\\n fun {C V}\\n fun {$} V end\\n end\\nin\\n {Show {A {NewCell 10} {C 1} {C ~1} {C ~1} {C 1} {C 0}}}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"program manorboy(output);\\n\\nfunction zero: integer; begin zero := 0 end;\\nfunction one: integer; begin one := 1 end;\\nfunction negone: integer; begin negone := -1 end;\\n\\nfunction A(\\n k: integer;\\n function x1: integer;\\n function x2: integer;\\n function x3: integer;\\n function x4: integer;\\n function x5: integer\\n): integer;\\n\\n function B: integer;\\n begin k := k - 1;\\n B := A(k, B, x1, x2, x3, x4)\\n end;\\n\\nbegin if k <= 0 then A := x4 + x5 else A := B\\nend;\\n\\nbegin writeln(A(10, one, negone, negone, one, zero))\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"sub A {\\n my ($k, $x1, $x2, $x3, $x4, $x5) = @_;\\n my($B);\\n $B = sub { A(--$k, $B, $x1, $x2, $x3, $x4) };\\n $k <= 0 ? &$x4 + &$x5 : &$B;\\n}\\n\\nprint A(10, sub{1}, sub {-1}, sub{-1}, sub{1}, sub{0} ), \\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- allocate()</span>\\n <span style=\\\"color: #008080;\\\">forward</span> <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">A</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x5</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">B</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;\\\">object</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">kptr</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><span style=\\\"color: #000000;\\\">x3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">x4</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">s</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">peek4s</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">kptr</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #7060A8;\\\">poke4</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">kptr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k</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;\\\">k</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">kptr</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><span style=\\\"color: #000000;\\\">x3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">x4</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><span style=\\\"color: #000000;\\\">x3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">x4</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;\\\">A</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x5</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: #008080;\\\">return</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x4</span><span style=\\\"color: #0000FF;\\\">)?</span><span style=\\\"color: #000000;\\\">B</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x4</span><span style=\\\"color: #0000FF;\\\">):</span><span style=\\\"color: #000000;\\\">x4</span><span style=\\\"color: #0000FF;\\\">)+</span>\\n <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x5</span><span style=\\\"color: #0000FF;\\\">)?</span><span style=\\\"color: #000000;\\\">B</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x5</span><span style=\\\"color: #0000FF;\\\">):</span><span style=\\\"color: #000000;\\\">x5</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">kptr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">allocate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">poke4</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">kptr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">B</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">kptr</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><span style=\\\"color: #000000;\\\">x3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">x4</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;\\\">for</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">23</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;\\\">\\\"A(%d) = %d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">A</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;\\\">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>\\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;\\\">first5</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;\\\">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>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">A</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">k</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;\\\">5</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">first5</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: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">c0</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">c1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">c2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">c3</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;\\\">5</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">c3</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">c0</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">c0</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">c1</span>\\n <span style=\\\"color: #000000;\\\">c1</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">c2</span>\\n <span style=\\\"color: #000000;\\\">c2</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">c3</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;\\\">c0</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">c1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">c2</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">c3</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;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">40</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;\\\">\\\"%d %d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">A</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">k</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\": \"(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: #004080;\\\">mpfr</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">A</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">k</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;\\\">5</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">mpz_init</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;\\\">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;\\\">k</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;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">c0</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">c1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">c2</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: #000000;\\\">c3</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;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">5</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_sub_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c3</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;\\\">c0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_sub</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_sub</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">c0</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: #7060A8;\\\">tagset</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: #0000FF;\\\">)&{</span><span style=\\\"color: #000000;\\\">30</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">39</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">500</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10000</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1e6</span><span style=\\\"color: #0000FF;\\\">}</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;\\\">tests</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: #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;\\\">\\\"A(%,d) = %s\\\\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;\\\">k</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #7060A8;\\\">mpz_get_short_str</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">A</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tests</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</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\\nfunction A($k,$x1,$x2,$x3,$x4,$x5) {\\n $b = function () use (&$b,&$k,$x1,$x2,$x3,$x4) {\\n return A(--$k,$b,$x1,$x2,$x3,$x4);\\n };\\n return $k <= 0 ? $x4() + $x5() : $b();\\n}\\n\\necho A(10, function () { return 1; },\\n function () { return -1; },\\n function () { return -1; },\\n function () { return 1; },\\n function () { return 0; }) . \\\"\\\\n\\\";\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"<?php\\nfunction A($k,$x1,$x2,$x3,$x4,$x5) {\\n static $i = 0;\\n $b = \\\"myfunction_$i\\\";\\n $i++;\\n eval('function '.$b.'() {\\n static $k = '.$k.';\\n return A(--$k, '.var_export($b,true).',\\n '.var_export($x1,true).',\\n '.var_export($x2,true).',\\n '.var_export($x3,true).',\\n '.var_export($x4,true).');\\n }');\\n return $k <= 0 ? $x4() + $x5() : $b();\\n}\\n\\necho A(10, create_function('', 'return 1;'),\\n create_function('', 'return -1;'),\\n create_function('', 'return -1;'),\\n create_function('', 'return 1;'),\\n create_function('', 'return 0;')) . \\\"\\\\n\\\";\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(de a (K X1 X2 X3 X4 X5)\\n (let (@K (cons K) B (cons)) # Explicit frame\\n (set B\\n (curry (@K B X1 X2 X3 X4) ()\\n (a (dec @K) (car B) X1 X2 X3 X4) ) )\\n (if (gt0 (car @K)) ((car B)) (+ (X4) (X5))) ) )\\n\\n(a 10 '(() 1) '(() -1) '(() -1) '(() 1) '(() 0))\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"#!/usr/bin/env python\\nimport sys\\nsys.setrecursionlimit(1025)\\n\\ndef a(in_k, x1, x2, x3, x4, x5):\\n k = [in_k]\\n def b():\\n k[0] -= 1\\n return a(k[0], b, x1, x2, x3, x4)\\n return x4() + x5() if k[0] <= 0 else b()\\n\\nx = lambda i: lambda: i\\nprint(a(10, x(1), x(-1), x(-1), x(1), x(0)))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#!/usr/bin/env python\\nimport sys\\nsys.setrecursionlimit(1025)\\n\\ndef a(k, x1, x2, x3, x4, x5):\\n def b():\\n b.k -= 1\\n return a(b.k, b, x1, x2, x3, x4)\\n b.k = k\\n return x4() + x5() if b.k <= 0 else b()\\n\\nx = lambda i: lambda: i\\nprint(a(10, x(1), x(-1), x(-1), x(1), x(0)))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#!/usr/bin/env python\\nimport sys\\nsys.setrecursionlimit(1025)\\n\\ndef A(k, x1, x2, x3, x4, x5):\\n def B():\\n nonlocal k\\n k -= 1\\n return A(k, B, x1, x2, x3, x4)\\n return x4() + x5() if k <= 0 else B()\\n\\nprint(A(10, lambda: 1, lambda: -1, lambda: -1, lambda: 1, lambda: 0))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"n <- function(x) function()x\\n\\nA <- function(k, x1, x2, x3, x4, x5) {\\n B <- function() A(k <<- k-1, B, x1, x2, x3, x4)\\n if (k <= 0) x4() + x5() else B()\\n}\\n\\nA(10, n(1), n(-1), n(-1), n(1), n(0))\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"call.by.name <- function(...) {\\n cl <- as.list(match.call())\\n sublist <- lapply(cl[2:(length(cl)-1)],\\n function(name) substitute(substitute(evalq(.,.caller),\\n list(.=substitute(name))),\\n list(name=name)))\\n names(sublist) <- enquote(cl[2:(length(cl)-1)])\\n subcall <- do.call(\\\"call\\\", c(\\\"list\\\", lapply(sublist, enquote)))\\n fndef <- cl[[length(cl)]]\\n fndef[[3]] <- substitute({\\n .caller <- parent.frame()\\n eval(substitute(body, subcall))\\n }, list(body=fndef[[3]], subcall=subcall))\\n eval.parent(fndef)\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"A <- call.by.name(x1, x2, x3, x4, x5,\\n function(k, x1, x2, x3, x4, x5) {\\n Aout <- NULL\\n B <- function() {\\n k <<- k - 1\\n Bout <- Aout <<- A(k, B(), x1, x2, x3, x4)\\n }\\n if (k <= 0) Aout <- x4 + x5 else B()\\n Aout\\n }\\n)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"> options(expressions=10000)\\n> mapply(A, 0:10, 1, -1, -1, 1, 0)\\n [1] 1 0 -2 0 1 0 1 -1 -10 -30 -67\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"> print(A, useSource=FALSE)\\nfunction (k, x1, x2, x3, x4, x5)\\n{\\n .caller <- parent.frame()\\n eval(substitute({\\n Aout <- NULL\\n B <- function() {\\n k <<- k - 1\\n Bout <- Aout <<- A(k, B(), x1, x2, x3, x4)\\n }\\n if (k <= 0) Aout <- x4 + x5 else B()\\n Aout\\n }, list(x1 = substitute(evalq(., .caller), list(. = substitute(x1))),\\n x2 = substitute(evalq(., .caller), list(. = substitute(x2))),\\n x3 = substitute(evalq(., .caller), list(. = substitute(x3))),\\n x4 = substitute(evalq(., .caller), list(. = substitute(x4))),\\n x5 = substitute(evalq(., .caller), list(. = substitute(x5))))))\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (A k x1 x2 x3 x4 x5)\\n (define (B)\\n (set! k (- k 1))\\n (A k B x1 x2 x3 x4))\\n (if (<= k 0)\\n (+ (x4) (x5))\\n (B)))\\n\\n(A 10 (lambda () 1) (lambda () -1) (lambda () -1) (lambda () 1) (lambda () 0))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (A k x1 x2 x3 x4 x5)\\n (if (<= k 0)\\n (+ (x4) (x5))\\n (let B ()\\n (set! k (- k 1))\\n (A k B x1 x2 x3 x4))))\\n\\n(A 10 (lambda () 1) (lambda () -1) (lambda () -1) (lambda () 1) (lambda () 0))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub A($k is copy, &x1, &x2, &x3, &x4, &x5) {\\n $k <= 0\\n ?? x4() + x5()\\n !! (my &B = { A(--$k, &B, &x1, &x2, &x3, &x4) })();\\n};\\n\\nsay A(10, {1}, {-1}, {-1}, {1}, {0});\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program performs the \\\"man or boy\\\" test as far as possible for N. */\\n do n=0 /*increment N from zero forever. */\\n say 'n='n a(N,x1,x2,x3,x4,x5) /*display the result to the terminal. */\\n end /*n*/ /* [↑] do until something breaks. */\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\na: procedure; parse arg k, x1, x2, x3, x4, x5\\n if k<=0 then return f(x4) + f(x5)\\n else return f(b)\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nb: k=k-1; return a(k, b, x1, x2, x3, x4)\\nf: interpret 'v=' arg(1)\\\"()\\\"; return v\\nx1: procedure; return 1\\nx2: procedure; return -1\\nx3: procedure; return -1\\nx4: procedure; return 1\\nx5: procedure; return 0\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"def a(k, x1, x2, x3, x4, x5)\\n b = lambda { k -= 1; a(k, b, x1, x2, x3, x4) }\\n k <= 0 ? x4[] + x5[] : b[]\\nend\\n\\nputs a(10, lambda {1}, lambda {-1}, lambda {-1}, lambda {1}, lambda {0})\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use std::cell::Cell;\\n\\ntrait Arg {\\n fn run(&self) -> i32;\\n}\\n\\nimpl Arg for i32 {\\n fn run(&self) -> i32 { *self }\\n}\\n\\nstruct B<'a> {\\n k: &'a Cell<i32>,\\n x1: &'a Arg,\\n x2: &'a Arg,\\n x3: &'a Arg,\\n x4: &'a Arg,\\n}\\n\\nimpl<'a> Arg for B<'a> {\\n fn run(&self) -> i32 {\\n self.k.set(self.k.get() - 1);\\n a(self.k.get(), self, self.x1, self.x2, self.x3, self.x4)\\n }\\n}\\n\\nfn a(k: i32, x1: &Arg, x2: &Arg, x3: &Arg, x4: &Arg, x5: &Arg) -> i32 {\\n if k <= 0 {\\n x4.run() + x5.run()\\n } else {\\n B{\\n k: &Cell::new(k),\\n x1, x2, x3, x4\\n }.run()\\n }\\n}\\n\\npub fn main() {\\n println!(\\\"{}\\\", a(10, &1, &-1, &-1, &1, &0));\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"use std::cell::Cell;\\n\\nfn a(k: i32, x1: &Fn() -> i32, x2: &Fn() -> i32, x3: &Fn() -> i32, x4: &Fn() -> i32, x5: &Fn() -> i32) -> i32 {\\n let k1 = Cell::new(k);\\n struct B<'a> { f: &'a Fn(&B) -> i32 }\\n let b = B {\\n f: &|b| {\\n k1.set(k1.get() - 1);\\n return a(k1.get(), &||(b.f)(b), x1, x2, x3, x4)\\n }\\n };\\n let b = ||(b.f)(&b);\\n return if k <= 0 {x4() + x5()} else {b()}\\n}\\n\\npub fn main() {\\n println!(\\\"{}\\\", a(10, &||1, &||-1, &||-1, &||1, &||0));\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"use std::cell::Cell;\\nuse std::cell::RefCell;\\nuse std::rc::Rc;\\nuse std::rc::Weak;\\n\\nfn a(k: i32, x1: &Fn() -> i32, x2: &Fn() -> i32, x3: &Fn() -> i32, x4: &Fn() -> i32, x5: &Fn() -> i32) -> i32 {\\n let weak_holder: Rc<RefCell<Weak<Fn() -> i32>>> = Rc::new(RefCell::new(Weak::<fn() -> i32>::new()));\\n let weak_holder2 = weak_holder.clone();\\n let k_holder = Cell::new(k);\\n let b: Rc<Fn() -> i32> = Rc::new(move || {\\n let b = weak_holder2.borrow().upgrade().unwrap();\\n k_holder.set(k_holder.get() - 1);\\n return a(k_holder.get(), &*b, x1, x2, x3, x4);\\n });\\n weak_holder.replace(Rc::downgrade(&b));\\n\\n return if k <= 0 {x4() + x5()} else {b()}\\n}\\n\\npub fn main() {\\n println!(\\\"{}\\\", a(10, &||1, &||-1, &||-1, &||1, &||0));\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"def A(in_k: Int, x1: =>Int, x2: =>Int, x3: =>Int, x4: =>Int, x5: =>Int): Int = {\\n var k = in_k\\n def B: Int = {\\n k = k-1\\n A(k, B, x1, x2, x3, x4)\\n }\\n if (k<=0) x4+x5 else B\\n}\\nprintln(A(10, 1, -1, -1, 1, 0))\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (A k x1 x2 x3 x4 x5)\\n (define (B)\\n (set! k (- k 1))\\n (A k B x1 x2 x3 x4))\\n (if (<= k 0)\\n (+ (x4) (x5))\\n (B)))\\n\\n(A 10 (lambda () 1) (lambda () -1) (lambda () -1) (lambda () 1) (lambda () 0))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"func a(k, x1, x2, x3, x4, x5) {\\n func b { a(--k, b, x1, x2, x3, x4) };\\n k <= 0 ? (x4() + x5()) : b();\\n}\\nsay a(10, ->{1}, ->{-1}, ->{-1}, ->{1}, ->{0}); #=> -67\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"func a(k, x1, x2, x3, x4, x5) {\\n k <= 0 ? (x4() + x5())\\n : func b { a(--k, b, x1, x2, x3, x4) }();\\n}\\nsay a(10, ->{1}, ->{-1}, ->{-1}, ->{1}, ->{0}); #=> -67\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"class MOB {\\n method a(k, x1, x2, x3, x4, x5) {\\n func b { self.a(--k, b, x1, x2, x3, x4) };\\n k <= 0 ? (x4() + x5()) : b();\\n }\\n}\\n\\nvar obj = MOB();\\nsay obj.a(10, ->{1}, ->{-1}, ->{-1}, ->{1}, ->{0});\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"function a(k, x1, x2, x3, x4, x5) {\\n\\tlet kk = { \\\"k\\\": k.k };\\n\\tlet b = function b() {\\n\\t\\tkk.k--;\\n\\t\\treturn a(kk, b, x1, x2, x3, x4);\\n\\t};\\n\\treturn kk.k <= 0 ? x4() + x5() : b();\\n}\\n\\nfunction x(n) {\\n\\treturn function () {\\n\\t\\treturn n;\\n\\t};\\n}\\n\\nprint(a({ \\\"k\\\": 10 }, x(1), x(-1), x(-1), x(1), x(0)));\\n\",\n \"language\": \"Sparkling\"\n },\n {\n \"code\": \"fun a (k, x1, x2, x3, x4, x5) =\\n if k <= 0 then\\n x4 () + x5 ()\\n else let\\n val m = ref k\\n fun b () = (\\n m := !m - 1;\\n a (!m, b, x1, x2, x3, x4)\\n )\\n in\\n b ()\\n end\\n\\nval () =\\n print (Int.toString (a (10, fn () => 1, fn () => ~1, fn () => ~1, fn () => 1, fn () => 0)) ^ \\\"\\\\n\\\")\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"func A(_ k: Int,\\n _ x1: @escaping () -> Int,\\n _ x2: @escaping () -> Int,\\n _ x3: @escaping () -> Int,\\n _ x4: @escaping () -> Int,\\n _ x5: @escaping () -> Int) -> Int {\\n var k1 = k\\n\\n func B() -> Int {\\n k1 -= 1\\n return A(k1, B, x1, x2, x3, x4)\\n }\\n\\n if k1 <= 0 {\\n return x4() + x5()\\n } else {\\n return B()\\n }\\n}\\n\\nprint(A(10, {1}, {-1}, {-1}, {1}, {0}))\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"func A(k: Int, _ x1: () -> Int, _ x2: () -> Int, _ x3: () -> Int, _ x4: () -> Int, _ x5: () -> Int) -> Int {\\n var k1 = k\\n func B() -> Int {\\n k1-=1\\n return A(k1, B, x1, x2, x3, x4)\\n }\\n if k1 <= 0 {\\n return x4() + x5()\\n } else {\\n return B()\\n }\\n}\\n\\nprint(A(10, {1}, {-1}, {-1}, {1}, {0}))\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"func A(var k: Int, x1: () -> Int, x2: () -> Int, x3: () -> Int, x4: () -> Int, x5: () -> Int) -> Int {\\n var B: (() -> Int)!\\n B = {\\n k--\\n return A(k, B, x1, x2, x3, x4)\\n }\\n if k <= 0 {\\n return x4() + x5()\\n } else {\\n return B()\\n }\\n}\\n\\nprintln(A(10, {1}, {-1}, {-1}, {1}, {0}))\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"proc A {k x1 x2 x3 x4 x5} {\\n expr {$k<=0 ? [eval $x4]+[eval $x5] : [B \\\\#[info level]]}\\n}\\nproc B {level} {\\n upvar $level k k x1 x1 x2 x2 x3 x3 x4 x4\\n incr k -1\\n A $k [info level 0] $x1 $x2 $x3 $x4\\n}\\nproc C {val} {return $val}\\ninterp recursionlimit {} 1157\\nA 10 {C 1} {C -1} {C -1} {C 1} {C 0}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"proc AP {k x1 x2 x3 x4 x5} {expr {$k<=0 ? [eval $x4]+[eval $x5] : [BP \\\\#[info level] $x1 $x2 $x3 $x4]}}\\nproc BP {level x1 x2 x3 x4} {AP [uplevel $level {incr k -1}] [info level 0] $x1 $x2 $x3 $x4}\\nproc C {val} {return $val}\\ninterp recursionlimit {} 1157\\nAP 10 {C 1} {C -1} {C -1} {C 1} {C 0}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"(defun A (k x1 x2 x3 x4 x5)\\n (labels ((B ()\\n (dec k)\\n [A k B x1 x2 x3 x4]))\\n (if (<= k 0) (+ [x4] [x5]) (B))))\\n\\n(prinl (A 10 (ret 1) (ret -1) (ret -1) (ret 1) (ret 0)))\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"(defun-cbn A (k x1 x2 x3 x4 x5)\\n (let ((k k))\\n (labels-cbn (B ()\\n (dec k)\\n (set B (set A (A k (B) x1 x2 x3 x4))))\\n (if (<= k 0)\\n (set A (+ x4 x5))\\n (B))))) ;; value of (B) correctly discarded here!\\n\\n(prinl (A 10 1 -1 -1 1 0))\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"(defstruct (cbn-thunk get set) nil get set)\\n\\n(defmacro make-cbn-val (place)\\n (with-gensyms (nv tmp)\\n (cond\\n ((constantp place)\\n ^(let ((,tmp ,place))\\n (new cbn-thunk\\n get (lambda () ,tmp)\\n set (lambda (,nv) (set ,tmp ,nv)))))\\n ((bindable place)\\n ^(new cbn-thunk\\n get (lambda () ,place)\\n set (lambda (,nv) (set ,place ,nv))))\\n (t\\n ^(new cbn-thunk\\n get (lambda () ,place)\\n set (lambda (ign) (error \\\"cannot set ~s\\\" ',place)))))))\\n\\n(defun cbn-val (cbs)\\n (call cbs.get))\\n\\n(defun set-cbn-val (cbs nv)\\n (call cbs.set nv))\\n\\n(defplace (cbn-val thunk) body\\n (getter setter\\n (with-gensyms (thunk-tmp)\\n ^(rlet ((,thunk-tmp ,thunk))\\n (macrolet ((,getter () ^(cbn-val ,',thunk-tmp))\\n (,setter (val) ^(set-cbn-val ,',thunk-tmp ,val)))\\n ,body)))))\\n\\n(defun make-cbn-fun (sym args . body)\\n (let ((gens (mapcar (ret (gensym)) args)))\\n ^(,sym ,gens\\n (symacrolet ,[mapcar (ret ^(,@1 (cbn-val ,@2))) args gens]\\n ,*body))))\\n\\n(defmacro cbn (fun . args)\\n ^(call (fun ,fun) ,*[mapcar (ret ^(make-cbn-val ,@1)) args]))\\n\\n(defmacro defun-cbn (name (. args) . body)\\n (with-gensyms (hidden-fun)\\n ^(progn\\n (defun ,hidden-fun ())\\n (defmacro ,name (. args) ^(cbn ,',hidden-fun ,*args))\\n (set (symbol-function ',hidden-fun)\\n ,(make-cbn-fun 'lambda args\\n ^(block ,name (let ((,name)) ,*body ,name)))))))\\n\\n(defmacro labels-cbn ((name (. args) . lbody) . body)\\n (with-gensyms (hidden-fun)\\n ^(macrolet ((,name (. args) ^(cbn ,',hidden-fun ,*args)))\\n (labels (,(make-cbn-fun hidden-fun args\\n ^(block ,name (let ((,name)) ,*lbody ,name))))\\n ,*body))))\\n\\n(defun-cbn A (k x1 x2 x3 x4 x5)\\n (let ((k k))\\n (labels-cbn (B ()\\n (dec k)\\n (set B (set A (A k (B) x1 x2 x3 x4))))\\n (if (<= k 0)\\n (set A (+ x4 x5))\\n (B))))) ;; value of (B) correctly discarded here!\\n\\n(prinl (A 10 1 -1 -1 1 0))\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"implement main\\n open core\\n\\nclauses\\n run():-\\n console::init(),\\n stdio::write(a(10, {() = 1}, {() = -1}, {() = -1}, {() = 1}, {() = 0})).\\n\\nclass predicates\\n a : (integer K, function{integer} X1, function{integer} X2, function{integer} X3, function{integer} X4, function{integer} X5) -> integer Result.\\nclauses\\n a(K, X1, X2, X3, X4, X5) = R :-\\n KM = varM::new(K),\\n BM = varM{function{integer}}::new({() = 0}),\\n BM:value :=\\n { () = BR :-\\n KM:value := KM:value-1,\\n BR = a(KM:value, BM:value, X1, X2, X3, X4)\\n },\\n R = if KM:value <= 0 then X4() + X5() else BM:value() end if.\\n\\nend implement main\\n\",\n \"language\": \"Visual-Prolog\"\n },\n {\n \"code\": \"self.a = method(k, x1, x2, x3, x4, x5){\\n b = method(){\\n code.k = code.k - 1\\n return( self.a(code.k, code, code.x1, code.x2, code.x3, code.x4) )\\n }\\n b.k = k\\n b.x1 = x1\\n b.x2 = x2\\n b.x3 = x3\\n b.x4 = x4\\n b.x5 = x5\\n\\n if(k <= 0){\\n return(self.apply(x4) + self.apply(x5))\\n }\\n else{\\n return(self.apply(b))\\n }\\n}\\n\\nself.K = method(n){\\n f = method(){\\n return(code.n)\\n }\\n f.n = n\\n return(f)\\n}\\n\\nself.a(10, self.K(1), self.K(-1), self.K(-1), self.K(1), self.K(0)).print()\\n\",\n \"language\": \"Vorpal\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar a\\na = Fn.new { |k, x1, x2, x3, x4, x5|\\n var b\\n b = Fn.new {\\n k = k - 1\\n return a.call(k, b, x1, x2, x3, x4)\\n }\\n return (k <= 0) ? x4.call() + x5.call() : b.call()\\n}\\n\\nSystem.print(\\\" k a\\\")\\nfor (k in 0..20) {\\n Fmt.print(\\\"$2d : $ d\\\", k, a.call(k, Fn.new { 1 }, Fn.new { -1 }, Fn.new { -1 }, Fn.new { 1 }, Fn.new { 0 }))\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"/* Man_or_boy_test_2.wren */\\n\\nimport \\\"./gmp\\\" for Mpz\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar A = Fn.new { |k|\\n if (k < 6) {\\n var x1 = 1\\n var x2 = -1\\n var x3 = -1\\n var x4 = 1\\n var c1 = [0, 0, 0, 1, 2, 3][k]\\n var c2 = [0, 0, 1, 1, 1, 2][k]\\n var c3 = [0, 1, 1, 0, 0, 1][k]\\n var c4 = [1, 1, 0, 0, 0, 0][k]\\n return c1*x1 + c2*x2 + c3*x3 + c4*x4\\n }\\n var one = Mpz.one\\n var c0 = Mpz.three\\n var c1 = Mpz.two\\n var c2 = Mpz.one\\n var c3 = Mpz.zero\\n for (j in 5...k) {\\n c3.add(c0).sub(one)\\n c0.add(c1)\\n c1.add(c2)\\n c2.add(c3)\\n }\\n return c0.add(c0.sub(c0.sub(c1), c2), c3)\\n}\\n\\nvar p = Fn.new { |k|\\n Fmt.write(\\\"A($d) = \\\", k)\\n var s = A.call(k).toString\\n if (s.count < 60) {\\n System.print(s)\\n } else {\\n Fmt.print(\\\"$s...$s ($d digits)\\\", s[0..5], s[-5..-1], s.count - 1)\\n }\\n}\\n\\nfor (i in 0..39) p.call(i)\\np.call(500)\\np.call(10000)\\np.call(1e6)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"const Record = struct {\\n yieldFn: *const fn (record: *Record) i32,\\n\\n k: *i32 = undefined,\\n x1: *Record = undefined,\\n x2: *Record = undefined,\\n x3: *Record = undefined,\\n x4: *Record = undefined,\\n x5: *Record = undefined,\\n\\n inline fn run(record: *Record) i32 {\\n return record.yieldFn(record);\\n }\\n\\n pub fn A(record: *Record) i32 {\\n return if (record.k.* <= 0)\\n record.x4.run() + record.x5.run()\\n else\\n record.B();\\n }\\n\\n fn B(record: *Record) i32 {\\n record.k.* -= 1;\\n\\n var k_copy_on_stack: i32 = record.k.*;\\n\\n var b: Record = .{\\n .yieldFn = &Record.B,\\n\\n .k = &k_copy_on_stack,\\n .x1 = record,\\n .x2 = record.x1,\\n .x3 = record.x2,\\n .x4 = record.x3,\\n .x5 = record.x4,\\n };\\n return b.A();\\n }\\n};\\n\\nconst numbers = struct {\\n fn positiveOne(unused_record: *Record) i32 {\\n _ = unused_record;\\n return 1;\\n }\\n\\n fn zero(unused_record: *Record) i32 {\\n _ = unused_record;\\n return 0;\\n }\\n\\n fn negativeOne(unused_record: *Record) i32 {\\n _ = unused_record;\\n return -1;\\n }\\n};\\n\\nconst std = @import(\\\"std\\\");\\n\\npub fn main() void {\\n var i: u31 = 0;\\n while (i <= 31) : (i += 1) {\\n var k: i32 = i;\\n var @\\\"+1_record\\\": Record = .{ .yieldFn = &numbers.positiveOne };\\n var @\\\"0_record\\\": Record = .{ .yieldFn = &numbers.zero };\\n var @\\\"-1_record\\\": Record = .{ .yieldFn = &numbers.negativeOne };\\n\\n var record: Record = .{\\n .yieldFn = &Record.B,\\n\\n .k = &k,\\n .x1 = &@\\\"+1_record\\\",\\n .x2 = &@\\\"-1_record\\\",\\n .x3 = &@\\\"-1_record\\\",\\n .x4 = &@\\\"+1_record\\\",\\n .x5 = &@\\\"0_record\\\",\\n };\\n\\n std.debug.print(\\\"[{d:>3}] = {d}\\\\n\\\", .{ i, record.A() });\\n }\\n}\\n\",\n \"language\": \"Zig\"\n },\n {\n \"code\": \"fcn A(k, x1, x2, x3, x4, x5){ // -->1,0,-2,0,1,0,1,-1,-10,-30,-67,-138\\t\\n B:=CB(k, x1, x2, x3, x4, x5);\\n if(k <= 0) x4()+x5() else B.B();\\n}\\n\\nforeach k in (12){\\n println(\\\"k=%2d A=%d\\\".fmt(k, A(k, 1, -1, -1, 1, 0)))\\n}\\n\\nclass CB{ var k, x1, x2, x3, x4, x5;\\n fcn init{ k, x1, x2, x3, x4, x5 = vm.arglist; }\\n fcn B{\\n k= k - 1;\\n A(k, B, x1, x2, x3, x4);\\n }\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Man-or-boy-test"}}},{"rowIdx":467,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Graphics\n- Raster graphics operations\nfrom: http://rosettacode.org/wiki/Mandelbrot_set\nnote: Fractals\n","language":"00-META"},{"code":";Task:\nGenerate and draw the [[wp:Mandelbrot set|Mandelbrot set]]. \n\n\nNote that there are [http://en.wikibooks.org/wiki/Fractals/Iterations_in_the_complex_plane/Mandelbrot_set many algorithms] to draw Mandelbrot set and there are [http://en.wikibooks.org/wiki/Pictures_of_Julia_and_Mandelbrot_sets many functions] which generate it .\n<br><br>\n\n","language":"00-TASK"},{"code":"F mandelbrot(a)\n R (0.<50).reduce(0i, (z, _) -> z * z + @a)\n\nF step(start, step, iterations)\n R (0 .< iterations).map(i -> @start + (i * @step))\n\nV rows = (step(1, -0.05, 41).map(y -> (step(-2.0, 0.0315, 80).map(x -> (I abs(mandelbrot(x + 1i * @y)) < 2 {‘*’} E ‘ ’)))))\nprint(rows.map(row -> row.join(‘’)).join(\"\\n\"))\n","language":"11l"},{"code":"(defun abs-sq (z)\n (+ (expt (realpart z) 2)\n (expt (imagpart z) 2)))\n\n(defun round-decimal (x places)\n (/ (floor (* x (expt 10 places)) 1)\n (expt 10 places)))\n\n(defun round-complex (z places)\n (complex (round-decimal (realpart z) places)\n (round-decimal (imagpart z) places)))\n\n(defun mandel-point-r (z c limit)\n (declare (xargs :measure (nfix limit)))\n (cond ((zp limit) 0)\n ((> (abs-sq z) 4) limit)\n (t (mandel-point-r (+ (round-complex (* z z) 15) c)\n c\n (1- limit)))))\n\n(defun mandel-point (z iters)\n (- 5 (floor (mandel-point-r z z iters) (/ iters 5))))\n\n(defun draw-mandel-row (im re cols width iters)\n (declare (xargs :measure (nfix cols)))\n (if (zp cols)\n nil\n (prog2$ (cw (coerce\n (list\n (case (mandel-point (complex re im)\n iters)\n (5 #\\#)\n (4 #\\*)\n (3 #\\.)\n (2 #\\.)\n (otherwise #\\Space))) 'string))\n (draw-mandel-row im\n (+ re (/ (/ width 3)))\n (1- cols)\n width iters))))\n\n(defun draw-mandel (im rows width height iters)\n (if (zp rows)\n nil\n (progn$ (draw-mandel-row im -2 width width iters)\n (cw \"~%\")\n (draw-mandel (- im (/ (/ height 2)))\n (1- rows)\n width\n height\n iters))))\n\n(defun draw-mandelbrot (width iters)\n (let ((height (floor (* 1000 width) 3333)))\n (draw-mandel 1 height width height iters)))\n","language":"ACL2"},{"code":"with Lumen.Binary;\npackage body Mandelbrot is\n function Create_Image (Width, Height : Natural) return Lumen.Image.Descriptor is\n use type Lumen.Binary.Byte;\n Result : Lumen.Image.Descriptor;\n X0, Y0 : Float;\n X, Y, Xtemp : Float;\n Iteration : Float;\n Max_Iteration : constant Float := 1000.0;\n Color : Lumen.Binary.Byte;\n begin\n Result.Width := Width;\n Result.Height := Height;\n Result.Complete := True;\n Result.Values := new Lumen.Image.Pixel_Matrix (1 .. Width, 1 .. Height);\n for Screen_X in 1 .. Width loop\n for Screen_Y in 1 .. Height loop\n X0 := -2.5 + (3.5 / Float (Width) * Float (Screen_X));\n Y0 := -1.0 + (2.0 / Float (Height) * Float (Screen_Y));\n X := 0.0;\n Y := 0.0;\n Iteration := 0.0;\n while X * X + Y * Y <= 4.0 and then Iteration < Max_Iteration loop\n Xtemp := X * X - Y * Y + X0;\n Y := 2.0 * X * Y + Y0;\n X := Xtemp;\n Iteration := Iteration + 1.0;\n end loop;\n if Iteration = Max_Iteration then\n Color := 255;\n else\n Color := 0;\n end if;\n Result.Values (Screen_X, Screen_Y) := (R => Color, G => Color, B => Color, A => 0);\n end loop;\n end loop;\n return Result;\n end Create_Image;\n\nend Mandelbrot;\n","language":"Ada"},{"code":"with Lumen.Image;\n\npackage Mandelbrot is\n\n function Create_Image (Width, Height : Natural) return Lumen.Image.Descriptor;\n\nend Mandelbrot;\n","language":"Ada"},{"code":"with System.Address_To_Access_Conversions;\nwith Lumen.Window;\nwith Lumen.Image;\nwith Lumen.Events;\nwith GL;\nwith Mandelbrot;\n\nprocedure Test_Mandelbrot is\n\n Program_End : exception;\n\n Win : Lumen.Window.Handle;\n Image : Lumen.Image.Descriptor;\n Tx_Name : aliased GL.GLuint;\n Wide, High : Natural := 400;\n\n -- Create a texture and bind a 2D image to it\n procedure Create_Texture is\n use GL;\n\n package GLB is new System.Address_To_Access_Conversions (GLubyte);\n\n IP : GLpointer;\n begin -- Create_Texture\n -- Allocate a texture name\n glGenTextures (1, Tx_Name'Unchecked_Access);\n\n -- Bind texture operations to the newly-created texture name\n glBindTexture (GL_TEXTURE_2D, Tx_Name);\n\n -- Select modulate to mix texture with color for shading\n glTexEnvi (GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_MODULATE);\n\n -- Wrap textures at both edges\n glTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);\n glTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);\n\n -- How the texture behaves when minified and magnified\n glTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n glTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\n -- Create a pointer to the image. This sort of horror show is going to\n -- be disappearing once Lumen includes its own OpenGL bindings.\n IP := GLB.To_Pointer (Image.Values.all'Address).all'Unchecked_Access;\n\n -- Build our texture from the image we loaded earlier\n glTexImage2D (GL_TEXTURE_2D, 0, GL_RGBA, GLsizei (Image.Width), GLsizei (Image.Height), 0,\n GL_RGBA, GL_UNSIGNED_BYTE, IP);\n end Create_Texture;\n\n -- Set or reset the window view parameters\n procedure Set_View (W, H : in Natural) is\n use GL;\n begin -- Set_View\n GL.glEnable (GL.GL_TEXTURE_2D);\n glClearColor (0.8, 0.8, 0.8, 1.0);\n\n glMatrixMode (GL_PROJECTION);\n glLoadIdentity;\n glViewport (0, 0, GLsizei (W), GLsizei (H));\n glOrtho (0.0, GLdouble (W), GLdouble (H), 0.0, -1.0, 1.0);\n\n glMatrixMode (GL_MODELVIEW);\n glLoadIdentity;\n end Set_View;\n\n -- Draw our scene\n procedure Draw is\n use GL;\n begin -- Draw\n -- clear the screen\n glClear (GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT);\n GL.glBindTexture (GL.GL_TEXTURE_2D, Tx_Name);\n\n -- fill with a single textured quad\n glBegin (GL_QUADS);\n begin\n glTexCoord2f (1.0, 0.0);\n glVertex2i (GLint (Wide), 0);\n\n glTexCoord2f (0.0, 0.0);\n glVertex2i (0, 0);\n\n glTexCoord2f (0.0, 1.0);\n glVertex2i (0, GLint (High));\n\n glTexCoord2f (1.0, 1.0);\n glVertex2i (GLint (Wide), GLint (High));\n end;\n glEnd;\n\n -- flush rendering pipeline\n glFlush;\n\n -- Now show it\n Lumen.Window.Swap (Win);\n end Draw;\n\n -- Simple event handler routine for keypresses and close-window events\n procedure Quit_Handler (Event : in Lumen.Events.Event_Data) is\n begin -- Quit_Handler\n raise Program_End;\n end Quit_Handler;\n\n -- Simple event handler routine for Exposed events\n procedure Expose_Handler (Event : in Lumen.Events.Event_Data) is\n pragma Unreferenced (Event);\n begin -- Expose_Handler\n Draw;\n end Expose_Handler;\n\n -- Simple event handler routine for Resized events\n procedure Resize_Handler (Event : in Lumen.Events.Event_Data) is\n begin -- Resize_Handler\n Wide := Event.Resize_Data.Width;\n High := Event.Resize_Data.Height;\n Set_View (Wide, High);\n-- Image := Mandelbrot.Create_Image (Width => Wide, Height => High);\n-- Create_Texture;\n Draw;\n end Resize_Handler;\n\nbegin\n -- Create Lumen window, accepting most defaults; turn double buffering off\n -- for simplicity\n Lumen.Window.Create (Win => Win,\n Name => \"Mandelbrot fractal\",\n Width => Wide,\n Height => High,\n Events => (Lumen.Window.Want_Exposure => True,\n Lumen.Window.Want_Key_Press => True,\n others => False));\n\n -- Set up the viewport and scene parameters\n Set_View (Wide, High);\n\n -- Now create the texture and set up to use it\n Image := Mandelbrot.Create_Image (Width => Wide, Height => High);\n Create_Texture;\n\n -- Enter the event loop\n declare\n use Lumen.Events;\n begin\n Select_Events (Win => Win,\n Calls => (Key_Press => Quit_Handler'Unrestricted_Access,\n Exposed => Expose_Handler'Unrestricted_Access,\n Resized => Resize_Handler'Unrestricted_Access,\n Close_Window => Quit_Handler'Unrestricted_Access,\n others => No_Callback));\n end;\nexception\n when Program_End =>\n null;\nend Test_Mandelbrot;\n","language":"Ada"},{"code":"INT pix = 300, max iter = 256, REAL zoom = 0.33 / pix;\n[-pix : pix, -pix : pix] INT plane;\nCOMPL ctr = 0.05 I 0.75 # center of set #;\n\n# Compute the length of an orbit. #\nPROC iterate = (COMPL z0) INT:\n BEGIN COMPL z := 0, INT iter := 1;\n WHILE (iter +:= 1) < max iter # not converged # AND ABS z < 2 # not diverged #\n DO z := z * z + z0\n OD;\n iter\n END;\n\n# Compute set and find maximum orbit length. #\nINT max col := 0;\nFOR x FROM -pix TO pix\nDO FOR y FROM -pix TO pix\n DO COMPL z0 = ctr + (x * zoom) I (y * zoom);\n IF (plane [x, y] := iterate (z0)) < max iter\n THEN (plane [x, y] > max col | max col := plane [x, y])\n FI\n OD\nOD;\n\n# Make a plot. #\nFILE plot;\nINT num pix = 2 * pix + 1;\nmake device (plot, \"gif\", whole (num pix, 0) + \"x\" + whole (num pix, 0));\nopen (plot, \"mandelbrot.gif\", stand draw channel);\nFOR x FROM -pix TO pix\nDO FOR y FROM -pix TO pix\n DO INT col = (plane [x, y] > max col | max col | plane [x, y]);\n REAL c = sqrt (1- col / max col); # sqrt to enhance contrast #\n draw colour (plot, c, c, c);\n draw point (plot, (x + pix) / (num pix - 1), (y + pix) / (num pix - 1))\n OD\nOD;\nclose (plot)\n","language":"ALGOL-68"},{"code":"begin\n % -- This is an integer ascii Mandelbrot generator, translated from the %\n % -- Compiler/AST Interpreter Task's ASCII Mandelbrot Set example program %\n integer leftEdge, rightEdge, topEdge, bottomEdge, xStep, yStep, maxIter;\n leftEdge := -420;\n rightEdge := 300;\n topEdge := 300;\n bottomEdge := -300;\n xStep := 7;\n yStep := 15;\n\n maxIter := 200;\n\n for y0 := topEdge step - yStep until bottomEdge do begin\n for x0 := leftEdge step xStep until rightEdge do begin\n integer x, y, i;\n string(1) theChar;\n y := 0;\n x := 0;\n theChar := \" \";\n i := 0;\n while i < maxIter do begin\n integer x_x, y_y;\n x_x := (x * x) div 200;\n y_y := (y * y) div 200;\n if x_x + y_y > 800 then begin\n theChar := code( decode( \"0\" ) + i );\n if i > 9 then theChar := \"@\";\n i := maxIter\n end;\n y := x * y div 100 + y0;\n x := x_x - y_y + x0;\n i := i + 1\n end while_i_lt_maxIter ;\n writeon( theChar );\n end for_x0 ;\n write();\n end for_y0\nend.\n","language":"ALGOL-W"},{"code":"#!/usr/bin/hopper\n#include <jambo.h>\n\nMain\n\nInitialize '300, ancho, alto'\n\nSet '-2,0.47,-1.12,1.12' Init 'min real, max real, min complex, max complex'\n\nInit zero 'submaxRminR, submaxCminC'\n\nLet ( submaxRminR := 'max real' Minus 'min real')\nLet ( submaxCminC := 'maxcomplex' Minus 'mincomplex' )\n\nInit zero 'a2,b2,a,b,ta'\n\nLoop for (i=1, Less equal(i, ancho),++i)\n\n Let ( ta := Add(min real, Div ( Mul( submaxRminR, Minus one(i)), Minus one(ancho) )) )\n\n Loop for (j=1, Less equal (j, alto),++j)\n\n Let ( b := Add( min complex, Div ( Mul (submaxCminC, Minus one(j)), Minus one(alto))) )\n\n a=ta, a2=a, b2=b\n\n k=1000, color=256\n Loop if (Sqradd (a,b) Is less than (4), And (k) )\n Add(Sqrdiff(a,b), a2),\n Add(b2, Mul(2, Mul(a, b)))\n\n Move to (b), Move to (a)\n\n --color\n --k\n Back\n Color back (color), Print(\"O\")\n Back\n Prnl\nBack\nPause\n\nEnd\n","language":"Amazing-Hopper"},{"code":"SCREEN 1,320,200,5,1\nWINDOW 2,\"Mandelbrot\",,0,1\n\nmaxIteration = 100\nxmin = -2\nxmax = 1\nymin = -1.5\nymax = 1.5\nxs = 300\nys = 180\nst = .01 ' use e.g. st = .05 for a coarser but faster picture\n ' and perhaps also lower maxIteration = 10 or so\nxp = xs / (xmax - xmin) * st\nyp = ys / (ymax - ymin) * st\n\nFOR x0 = xmin TO xmax STEP st\n FOR y0 = ymin TO ymax STEP st\n x = 0\n y = 0\n iteration = 0\n\n WHILE (x * x + y * y <= (2 * 2) AND iteration < maxIteration)\n xtemp = x * x - y * y + x0\n y = 2 * x * y + y0\n\n x = xtemp\n\n iteration = iteration + 1\n WEND\n\n IF iteration <> maxIteration THEN\n c = iteration\n ELSE\n c = 0\n END IF\n COLOR c MOD 32\n AREA ((x0 - xmin) * xp / st, (y0 - ymin) * yp / st)\n AREA STEP (xp, 0)\n AREA STEP (0, yp)\n AREA STEP (-xp, 0)\n AREA STEP (0, -yp)\n AREAFILL\n NEXT\nNEXT\n\n' endless loop, use Run -> Stop from the menu to stop program\nWHILE (1)\nWEND\n","language":"AmigaBASIC"},{"code":"10 HGR2\n20 XC = -0.5 : REM CENTER COORD X\n30 YC = 0 : REM \" \" Y\n40 S = 2 : REM SCALE\n45 IT = 20 : REM ITERATIONS\n50 XR = S * (280 / 192): REM TOTAL RANGE OF X\n60 YR = S : REM \" \" \" Y\n70 X0 = XC - (XR/2) : REM MIN VALUE OF X\n80 X1 = XC + (XR/2) : REM MAX \" \" X\n90 Y0 = YC - (YR/2) : REM MIN \" \" Y\n100 Y1 = YC + (YR/2) : REM MAX \" \" Y\n110 XM = XR / 279 : REM SCALING FACTOR FOR X\n120 YM = YR / 191 : REM \" \" \" Y\n130 FOR YI = 0 TO 3 : REM INTERLEAVE\n140 FOR YS = 0+YI TO 188+YI STEP 4 : REM Y SCREEN COORDINATE\n145 HCOLOR=3 : HPLOT 0,YS TO 279,YS\n150 FOR XS = 0 TO 278 STEP 2 : REM X SCREEN COORDINATE\n170 X = XS * XM + X0 : REM TRANSL SCREEN TO TRUE X\n180 Y = YS * YM + Y0 : REM TRANSL SCREEN TO TRUE Y\n190 ZX = 0\n200 ZY = 0\n210 XX = 0\n220 YY = 0\n230 FOR I = 0 TO IT\n240 ZY = 2 * ZX * ZY + Y\n250 ZX = XX - YY + X\n260 XX = ZX * ZX\n270 YY = ZY * ZY\n280 C = IT-I\n290 IF XX+YY >= 4 GOTO 301\n300 NEXT I\n301 IF C >= 8 THEN C = C - 8 : GOTO 301\n310 HCOLOR = C : HPLOT XS, YS TO XS+1, YS\n320 NEXT XS\n330 NEXT YS\n340 NEXT YI\n","language":"Applesoft-BASIC"},{"code":"150 FOR XS = 0 TO 279\n301 C = (C - INT(C/2)*2)*3\n310 HCOLOR = C: HPLOT XS, YS\n","language":"Applesoft-BASIC"},{"code":"inMandelbrot?: function [c][\n z: to :complex [0 0]\n do.times: 50 [\n z: c + z*z\n if 4 < abs z -> return false\n ]\n return true\n]\n\nmandelbrot: function [settings][\n y: 0\n while [y < settings\\height][\n Y: settings\\yStart + y * settings\\yStep\n x: 0\n while [x < settings\\width][\n X: settings\\xStart + x * settings\\xStep\n if? inMandelbrot? to :complex @[X Y] -> prints \"*\"\n else -> prints \" \"\n x: x + 1\n ]\n print \"\"\n y: y + 1\n ]\n]\n\nmandelbrot #[ yStart: 1.0 yStep: neg 0.05\n xStart: neg 2.0 xStep: 0.0315\n height: 40 width: 80 ]\n","language":"Arturo"},{"code":"(* The algorithm is borrowed from Wikipedia. The graphics is a\n modification of the display made by the JavaScript entry. Output\n from the program is a Portable Pixmap file. *)\n\n#include \"share/atspre_staload.hats\"\nstaload \"libats/libc/SATS/math.sats\"\nstaload _ = \"libats/libc/DATS/math.dats\"\n\nfn\nmandel_iter {max_iter : nat}\n (cx : double,\n cy : double,\n max_iter : int max_iter)\n :<> intBtwe (0, max_iter) =\n let\n fun\n loop {iter : nat | iter <= max_iter}\n .<max_iter - iter>.\n (x : double,\n y : double,\n iter : int iter) :<> intBtwe (0, max_iter) =\n if iter = max_iter then\n iter\n else if 2.0 * 2.0 < (x * x) + (y * y) then\n iter\n else\n let\n val x = (x * x) - (y * y) + cx\n and y = (2.0 * x * y) + cy\n in\n loop (x, y, succ iter)\n end\n in\n loop (0.0, 0.0, 0)\n end\n\nfn (* Write a Portable Pixmap of the Mandelbrot set. *)\nwrite_mandelbrot_ppm (outf : FILEref,\n width : intGte 0,\n height : intGte 0,\n xmin : double,\n xmax : double,\n ymin : double,\n ymax : double,\n max_iter : intGte 0) : void =\n let\n prval [width : int] EQINT () = eqint_make_gint width\n prval [height : int] EQINT () = eqint_make_gint height\n\n macdef output (r, g, b) =\n let\n val r = min ($UNSAFE.cast{int} ,(r), 255)\n and g = min ($UNSAFE.cast{int} ,(g), 255)\n and b = min ($UNSAFE.cast{int} ,(b), 255)\n in\n fprint_val<uchar> (outf, $UNSAFE.cast r);\n fprint_val<uchar> (outf, $UNSAFE.cast g);\n fprint_val<uchar> (outf, $UNSAFE.cast b);\n end\n\n val xscale = (xmax - xmin) / g0i2f width\n and yscale = (ymax - ymin) / g0i2f height\n\n fun\n loop_y {iy : nat | iy <= height}\n .<height - iy>.\n (iy : int iy) : void =\n if iy <> height then\n let\n fun\n loop_x {ix : nat | ix <= width}\n .<width - ix>.\n (ix : int ix) : void =\n if ix <> width then\n let\n (* We want to go from top to bottom, left to right. *)\n val x = xmin + (xscale * g0i2f ix)\n and y = ymin + (yscale * g0i2f (height - iy))\n val i = mandel_iter (x, y, max_iter)\n\n (* We can PROVE that \"i\" is no greater than\n \"max_iter\". *)\n prval [i : int] EQINT () = eqint_make_gint i\n prval [max_iter : int] EQINT () = eqint_make_gint max_iter\n prval () = prop_verify {i <= max_iter} ()\n\n val c = (4.0 * log (g0i2f i)) / log (g0i2f max_iter)\n in\n if i = max_iter then\n output (0, 0, 0)\n else if c < 1.0 then\n output (0, 0, 255.0 * (c - 1.0))\n else if c < 2.0 then\n output (0, 255.0 * (c - 1.0), 255)\n else\n output (255.0 * (c - 2.0), 255, 255);\n loop_x (succ ix)\n end\n in\n loop_x 0;\n loop_y (succ iy)\n end\n in\n fprintln! (outf, \"P6\");\n fprintln! (outf, width, \" \", height);\n fprintln! (outf, 255);\n loop_y 0\n end\n\nimplement\nmain0 () =\n let\n val outf = stdout_ref\n val width = 1024\n val height = 1024\n val xmin = ~2.25\n val xmax = 0.75\n val ymin = ~1.5\n val ymax = 1.5\n val max_iter = 1000\n in\n write_mandelbrot_ppm (outf, width, height, xmin, xmax,\n ymin, ymax, max_iter)\n end\n","language":"ATS"},{"code":"(*-*- ATS -*-*)\n\n(* This program requires ats2-xprelude:\n https://sourceforge.net/p/chemoelectric/ats2-xprelude\n\n Also required is the SDL2 library for C. Not everything in the SDL\n interface below is used. The interface is meant to be relatively\n safe. For instance, you cannot create a window or renderer without\n later destroying it, and you cannot use one at all that was not\n properly created. Also you cannot accidentally use an\n SDL_WindowEvent as an SDL_TextInputEvent, etc.\n\n The program uses 32+32-bit fixed point to calculate escape times.\n One does not need so many bits left of the decimal point, but this\n is the fixed point format available from ats2-xprelude.\n\n There are some \"FIXME\" notes below that refer to a few of the ways\n the program could be improved. This is a demo version of something\n I am likely to expand into a better program.\n\n Compile the program with (for example)\n \"myatscc mandelbrot_task_interactive.dats\"\n\n##myatsccdef=\\\npatscc -std=gnu2x -O3 \\\n -DATS_MEMALLOC_GCBDW \\\n `pkg-config --define-variable=PATSHOME=\"${PATSHOME}\" \\\n --cflags sdl2 ats2-xprelude bdw-gc` \\\n `pkg-config --define-variable=PATSHOME=\"${PATSHOME}\" \\\n --variable=PATSCCFLAGS ats2-xprelude` \\\n -o $fname($1) $1 \\\n `pkg-config --define-variable=PATSHOME=\"${PATSHOME}\" \\\n --libs sdl2 ats2-xprelude bdw-gc`\n\n*)\n\n(* How to use the program:\n\n Left click : re-center the image\n Double left-click : zoom in\n Double right-click : zoom out\n p or P : save an image as a Portable Arbitrary Map\n q or Q : quit the program\n\n The window is resizable.\n Closing the window quits the program, just as the Q key does. *)\n\n(*------------------------------------------------------------------*)\n\n#include \"share/atspre_staload.hats\"\nstaload UN = \"prelude/SATS/unsafe.sats\"\n\n#include \"xprelude/HATS/xprelude.hats\"\n\n(* To use 32+32-bit fixed point: *)\nstaload \"xprelude/SATS/fixed32p32.sats\"\nstaload _ = \"xprelude/DATS/fixed32p32.dats\"\nstadef realknd = fix32p32knd\ntypedef real = fixed32p32\n(* Actually, one could use different kinds of real number for\n different algorithms: fixed point, floating point,\n multiple-precision rational, interval arithmetic, ... even\n continued fractions. *)\n\n(*------------------------------------------------------------------*)\n\n(* This is a weak choice of ATS_EXTERN_PREFIX, but will spare us from\n having to do a lot of writing. *)\n#define ATS_EXTERN_PREFIX \"\"\n\nextern fn atexit : (() -> void) -> int = \"mac#%\"\n\n%{^\n\n#define SDL_MAIN_HANDLED 1\n#include <SDL.h>\n\nATSinline() atstype_bool\nSDL_bool2ATS (SDL_bool b)\n{\n return (b == SDL_FALSE) ? atsbool_false : atsbool_true;\n}\n\n%}\n\ntypedef SDL_bool = $extype\"SDL_bool\"\nextern fn SDL_bool2ATS (b : SDL_bool) :<> bool = \"mac#%\"\n\n(* - - - - - - - - - - - - - - - - - - - - - - *)\n(* Housekeeping. *)\n\nextern fn SDL_SetMainReady () : void = \"mac#%\"\nextern fn SDL_Init (flags : uint32) : void = \"mac#%\"\nextern fn SDL_Quit () : void = \"mac#%\"\n\n(* - - - - - - - - - - - - - - - - - - - - - - *)\n(* Timers. *)\n\nextern fn SDL_Delay (ms : uint32) : void = \"mac#%\"\n\n(* - - - - - - - - - - - - - - - - - - - - - - *)\n(* Video handling. *)\n\n(* Screensavers are disabled by default, except in very early versions\n of SDL2. *)\nextern fn SDL_DisableScreenSaver () : void = \"mac#%\"\nextern fn SDL_EnableScreenSaver () : void = \"mac#%\"\nextern fn SDL_IsScreenSaverEnabled () : SDL_bool = \"mac#%\"\n\nabsvtype SDL_Window_ptr (p : addr) = ptr p\nvtypedef SDL_Window_ptr0 = [p : addr] SDL_Window_ptr p\nvtypedef SDL_Window_ptr1 = [p : agz] SDL_Window_ptr p\n\nabsvtype SDL_Renderer_ptr (p : addr) = ptr p\nvtypedef SDL_Renderer_ptr0 = [p : addr] SDL_Renderer_ptr p\nvtypedef SDL_Renderer_ptr1 = [p : agz] SDL_Renderer_ptr p\n\nextern castfn SDL_Window_ptr2ptr :\n {p : addr} (!SDL_Window_ptr p) -<> ptr p\nextern castfn SDL_Renderer_ptr2ptr :\n {p : addr} (!SDL_Renderer_ptr p) -<> ptr p\n\nmacdef SDL_INIT_EVENTS = $extval (uint32, \"SDL_INIT_EVENTS\")\nmacdef SDL_INIT_TIMER = $extval (uint32, \"SDL_INIT_TIMER\")\nmacdef SDL_INIT_VIDEO = $extval (uint32, \"SDL_INIT_VIDEO\")\n\nmacdef SDL_WINDOWPOS_CENTERED = $extval (int, \"SDL_WINDOWPOS_CENTERED\")\nmacdef SDL_WINDOWPOS_UNDEFINED = $extval (int, \"SDL_WINDOWPOS_UNDEFINED\")\n\nmacdef SDL_WINDOW_OPENGL = $extval (uint32, \"SDL_WINDOW_OPENGL\")\nmacdef SDL_WINDOW_RESIZABLE = $extval (uint32, \"SDL_WINDOW_RESIZABLE\")\n\nextern fn\nSDL_CreateWindow (title : string,\n x : int, y : int,\n w : int, h : int,\n flags : uint32) : SDL_Window_ptr0 = \"mac#%\"\n\nextern fn\nSDL_DestroyWindow : SDL_Window_ptr1 -> void = \"mac#%\"\nfn {}\nSDL_DestroyWindow_null\n (window : SDL_Window_ptr null) : void =\n $UN.castvwtp0{void} window\n\nextern fn\nSDL_CreateRenderer (window : !SDL_Window_ptr1,\n index : int,\n flags : uint32) : SDL_Renderer_ptr0 = \"mac#%\"\n\nextern fn\nSDL_DestroyRenderer : SDL_Renderer_ptr1 -> void = \"mac#%\"\nfn {}\nSDL_DestroyRenderer_null\n (renderer : SDL_Renderer_ptr null) : void =\n $UN.castvwtp0{void} renderer\n\nextern fn\nSDL_GetRendererOutputSize (renderer : !SDL_Renderer_ptr1,\n w : &int? >> int,\n h : &int? >> int) : int = \"mac#%\"\n\nextern fn\nSDL_SetRenderDrawColor (renderer : !SDL_Renderer_ptr1,\n r : uint8,\n g : uint8,\n b : uint8,\n a : uint8) : int = \"mac#%\"\n\nextern fn\nSDL_RenderClear (renderer : !SDL_Renderer_ptr1) : int = \"mac#%\"\n\nextern fn\nSDL_RenderDrawPoint (renderer : !SDL_Renderer_ptr1,\n x : int,\n y : int) : int = \"mac#%\"\nextern fn\nSDL_RenderPresent (renderer : !SDL_Renderer_ptr1) : void = \"mac#%\"\n\n(* - - - - - - - - - - - - - - - - - - - - - - *)\n(* Event handling. *)\n\ntypedef SDL_Event (t : int) =\n $extype_struct\"SDL_Event\" of\n {\n type = uint32 t,\n timestamp = uint32\n }\ntypedef SDL_Event = [t : int] SDL_Event t\n\nextern fn\nSDL_PollEvent (event : &SDL_Event? >> SDL_Event)\n : intBtwe (0, 1) = \"mac#%\"\n\nextern fn\nSDL_GetMouseState (x : &int? >> int,\n y : &int? >> int) : uint32 = \"mac#%\"\n\nmacdef SDL_BUTTON_LMASK = $extval (uint32, \"SDL_BUTTON_LMASK\")\nmacdef SDL_BUTTON_MMASK = $extval (uint32, \"SDL_BUTTON_MMASK\")\nmacdef SDL_BUTTON_RMASK = $extval (uint32, \"SDL_BUTTON_RMASK\")\nmacdef SDL_BUTTON_X1MASK = $extval (uint32, \"SDL_BUTTON_X1MASK\")\nmacdef SDL_BUTTON_X2MASK = $extval (uint32, \"SDL_BUTTON_X2MASK\")\n\n(* - - - - - - - - - - - - - *)\n\nstacst SDL_QUIT : int\nmacdef SDL_QUIT = $extval (uint32 SDL_QUIT, \"SDL_QUIT\")\n\ntypedef SDL_QuitEvent =\n $extype_struct\"SDL_QuitEvent\" of\n {\n type = uint32 SDL_QUIT,\n timestamp = uint32\n }\n\nextern praxi\nSDL_Event2QuitEvent_v :\n {p : addr}\n SDL_Event SDL_QUIT @ p -<prf>\n @(SDL_QuitEvent @ p,\n SDL_QuitEvent @ p -<lin,prf> SDL_Event SDL_QUIT @ p)\n\n(* - - - - - - - - - - - - - *)\n\nstacst SDL_WINDOWEVENT : int\nmacdef SDL_WINDOWEVENT = $extval (uint32 SDL_WINDOWEVENT, \"SDL_WINDOWEVENT\")\n\ntypedef SDL_WindowEvent =\n $extype_struct\"SDL_WindowEvent\" of\n {\n type = uint32 SDL_WINDOWEVENT,\n timestamp = uint32,\n windowID = uint32,\n event = uint8,\n padding1 = uint8,\n padding2 = uint8,\n padding3 = uint8,\n data1 = int32,\n data2 = int32\n }\n\nextern praxi\nSDL_Event2WindowEvent_v :\n {p : addr}\n SDL_Event SDL_WINDOWEVENT @ p -<prf>\n @(SDL_WindowEvent @ p,\n SDL_WindowEvent @ p -<lin,prf> SDL_Event SDL_WINDOWEVENT @ p)\n\nmacdef SDL_WINDOWEVENT_NONE = $extval (uint8, \"SDL_WINDOWEVENT_NONE\")\nmacdef SDL_WINDOWEVENT_SHOWN = $extval (uint8, \"SDL_WINDOWEVENT_SHOWN\")\nmacdef SDL_WINDOWEVENT_HIDDEN = $extval (uint8, \"SDL_WINDOWEVENT_HIDDEN\")\nmacdef SDL_WINDOWEVENT_EXPOSED = $extval (uint8, \"SDL_WINDOWEVENT_EXPOSED\")\nmacdef SDL_WINDOWEVENT_MOVED = $extval (uint8, \"SDL_WINDOWEVENT_MOVED\")\nmacdef SDL_WINDOWEVENT_RESIZED = $extval (uint8, \"SDL_WINDOWEVENT_RESIZED\")\nmacdef SDL_WINDOWEVENT_SIZE_CHANGED = $extval (uint8, \"SDL_WINDOWEVENT_SIZE_CHANGED\")\nmacdef SDL_WINDOWEVENT_MINIMIZED = $extval (uint8, \"SDL_WINDOWEVENT_MINIMIZED\")\nmacdef SDL_WINDOWEVENT_MAXIMIZED = $extval (uint8, \"SDL_WINDOWEVENT_MAXIMIZED\")\nmacdef SDL_WINDOWEVENT_RESTORED = $extval (uint8, \"SDL_WINDOWEVENT_RESTORED\")\nmacdef SDL_WINDOWEVENT_ENTER = $extval (uint8, \"SDL_WINDOWEVENT_ENTER\")\nmacdef SDL_WINDOWEVENT_LEAVE = $extval (uint8, \"SDL_WINDOWEVENT_LEAVE\")\nmacdef SDL_WINDOWEVENT_FOCUS_GAINED = $extval (uint8, \"SDL_WINDOWEVENT_FOCUS_GAINED\")\nmacdef SDL_WINDOWEVENT_FOCUS_LOST = $extval (uint8, \"SDL_WINDOWEVENT_FOCUS_LOST\")\nmacdef SDL_WINDOWEVENT_CLOSE = $extval (uint8, \"SDL_WINDOWEVENT_CLOSE\")\nmacdef SDL_WINDOWEVENT_TAKE_FOCUS = $extval (uint8, \"SDL_WINDOWEVENT_TAKE_FOCUS\")\nmacdef SDL_WINDOWEVENT_HIT_TEST = $extval (uint8, \"SDL_WINDOWEVENT_HIT_TEST\")\nmacdef SDL_WINDOWEVENT_ICCPROF_CHANGED = $extval (uint8, \"SDL_WINDOWEVENT_ICCPROF_CHANGED\")\nmacdef SDL_WINDOWEVENT_DISPLAY_CHANGED = $extval (uint8, \"SDL_WINDOWEVENT_DISPLAY_CHANGED\")\n\n(* - - - - - - - - - - - - - *)\n\nstacst SDL_MOUSEMOTION : int\nmacdef SDL_MOUSEMOTION = $extval (uint32 SDL_MOUSEMOTION, \"SDL_MOUSEMOTION\")\n\ntypedef SDL_MouseMotionEvent =\n $extype_struct\"SDL_MouseMotionEvent\" of\n {\n type = uint32 SDL_MOUSEMOTION,\n timestamp = uint32,\n windowID = uint32,\n which = uint32,\n state = uint32,\n x = int32,\n y = int32,\n xrel = int32,\n yrel = int32\n }\n\nextern praxi\nSDL_Event2MouseMotionEvent_v :\n {p : addr}\n SDL_Event SDL_MOUSEMOTION @ p -<prf>\n @(SDL_MouseMotionEvent @ p,\n SDL_MouseMotionEvent @ p -<lin,prf> SDL_Event SDL_MOUSEMOTION @ p)\n\n(* - - - - - - - - - - - - - *)\n\nstacst SDL_MOUSEBUTTONDOWN : int\nmacdef SDL_MOUSEBUTTONDOWN = $extval (uint32 SDL_MOUSEBUTTONDOWN, \"SDL_MOUSEBUTTONDOWN\")\n\nstacst SDL_MOUSEBUTTONUP : int\nmacdef SDL_MOUSEBUTTONUP = $extval (uint32 SDL_MOUSEBUTTONUP, \"SDL_MOUSEBUTTONUP\")\n\ntypedef SDL_MouseButtonEvent (t : int) =\n [t == SDL_MOUSEBUTTONDOWN || t == SDL_MOUSEBUTTONUP]\n $extype_struct\"SDL_MouseButtonEvent\" of\n {\n type = uint32 t,\n timestamp = uint32,\n windowID = uint32,\n which = uint32,\n button = uint8,\n state = uint8,\n clicks = uint8,\n padding1 = uint8,\n x = int32,\n y = int32\n }\ntypedef SDL_MouseButtonEvent = [t : int] SDL_MouseButtonEvent t\n\nextern praxi\nSDL_Event2MouseButtonEvent_v :\n {p : addr}\n {t : int | t == SDL_MOUSEBUTTONDOWN || t == SDL_MOUSEBUTTONUP}\n SDL_Event t @ p -<prf>\n @(SDL_MouseButtonEvent t @ p,\n SDL_MouseButtonEvent t @ p -<lin,prf> SDL_Event t @ p)\n\nmacdef SDL_BUTTON_LEFT = $extval (uint8, \"SDL_BUTTON_LEFT\")\nmacdef SDL_BUTTON_MIDDLE = $extval (uint8, \"SDL_BUTTON_MIDDLE\")\nmacdef SDL_BUTTON_RIGHT = $extval (uint8, \"SDL_BUTTON_RIGHT\")\nmacdef SDL_BUTTON_X1 = $extval (uint8, \"SDL_BUTTON_X1\")\nmacdef SDL_BUTTON_X2 = $extval (uint8, \"SDL_BUTTON_X2\")\n\nmacdef SDL_PRESSED = $extval (uint8, \"SDL_PRESSED\")\nmacdef SDL_RELEASED = $extval (uint8, \"SDL_RELEASED\")\n\n(* - - - - - - - - - - - - - *)\n\nstacst SDL_TEXTINPUT : int\nmacdef SDL_TEXTINPUT = $extval (uint32 SDL_TEXTINPUT, \"SDL_TEXTINPUT\")\n\n#define SDL_TEXTINPUTEVENT_TEXT_SIZE 32\n\ntypedef SDL_TextInputEvent =\n $extype_struct\"SDL_TextInputEvent\" of\n {\n type = uint32 SDL_TEXTINPUT,\n timestamp = uint32,\n windowID = uint32,\n text = @[char][SDL_TEXTINPUTEVENT_TEXT_SIZE]\n }\n\nextern praxi\nSDL_Event2TextInputEvent_v :\n {p : addr}\n SDL_Event SDL_TEXTINPUT @ p -<prf>\n @(SDL_TextInputEvent @ p,\n SDL_TextInputEvent @ p -<lin,prf> SDL_Event SDL_TEXTINPUT @ p)\n\n(*------------------------------------------------------------------*)\n\nexception bailout of string\n\ntypedef rgba = @(uint8, uint8, uint8, uint8)\n\nval empty_scene_color =\n @(g0i2u 200, g0i2u 200, g0i2u 200, g0i2u 255) : rgba\n\ntypedef rgba_array (w : int, h : int) =\n matrixref (rgba, w, h)\n\ntypedef scene_computer =\n {w, h : nat}\n (int w, int h, real, real, real) -<cloref1>\n rgba_array (w, h)\n\nvtypedef situation (p : addr, q : addr,\n w : int, h : int) =\n [null < p; null < q; 0 <= w; 0 <= h]\n @{window = SDL_Window_ptr p,\n renderer = SDL_Renderer_ptr q,\n width = int w,\n height = int h,\n xcenter = real,\n ycenter = real,\n pixels_per_unit = real,\n compute_scene = scene_computer}\nvtypedef situation (w : int, h : int) =\n [p, q : agz]\n situation (p, q, w, h)\nvtypedef situation =\n [w, h : nat]\n situation (w, h)\n\nfn\ndestroy_situation (situation : situation) : void =\n begin\n SDL_DestroyRenderer (situation.renderer);\n SDL_DestroyWindow (situation.window)\n end\n\nfn\nget_renderer_size (situation : &situation)\n : [renderer_width, renderer_height : nat]\n @(int renderer_width, int renderer_height) =\n let\n var w : int\n var h : int\n val status = SDL_GetRendererOutputSize (situation.renderer, w, h)\n val w = g1ofg0 w and h = g1ofg0 h\n in\n if (status < 0) + (w < 0) + (h < 0) then\n begin\n destroy_situation situation;\n $raise bailout \"rendering error\"\n end\n else\n @(w, h)\n end\n\nfn\nresize_needed (situation : &situation) : bool =\n let\n val @(w, h) = get_renderer_size situation\n in\n (w <> situation.width) + (h <> situation.height)\n end\n\n(*------------------------------------------------------------------*)\n\nfn\ncompute_escape_times\n {w, h : nat}\n {mxtm : nat}\n (width : int w,\n height : int h,\n xcenter : real,\n ycenter : real,\n pixels_per_unit : real,\n max_time : uint16 mxtm)\n : matrixref ([tm : nat | tm <= mxtm] uint16 tm, w, h) =\n let\n typedef tm = [tm : nat | tm <= mxtm] uint16 tm\n\n val times = matrixref_make_elt<tm> (i2sz width, i2sz height,\n max_time)\n and ppu2 = pixels_per_unit + pixels_per_unit\n\n fun\n ij_loop {i, j : nat | i <= w; j <= h}\n .<w - i, h - j>.\n (i : int i,\n j : int j) :<!refwrt> void =\n if i = width then\n ()\n else if j = height then\n ij_loop (succ i, 0)\n else\n let\n val cx = xcenter + (g0i2f ((i + i) - width) / ppu2)\n and cy = ycenter + (g0i2f (height - (j + j)) / ppu2)\n\n fun\n tm_loop {tm : nat | tm <= mxtm}\n .<mxtm - tm>.\n (x : real,\n y : real,\n xx : real,\n yy : real,\n tm : uint16 tm)\n :<> [tm1 : nat | tm1 <= mxtm] uint16 tm1 =\n if tm = max_time then\n tm\n else if g0i2f 4 < xx + yy then\n tm\n else\n let\n val x = xx - yy + cx and y = ((x + x) * y) + cy\n val xx = x * x and yy = y * y\n in\n tm_loop (x, y, xx, yy, succ tm)\n end\n\n val tm = tm_loop (g0i2f 0, g0i2f 0,\n g0i2f 0, g0i2f 0,\n g1i2u 0)\n in\n times[i, height, j] := tm;\n ij_loop (i, succ j)\n end\n in\n ij_loop (0, 0);\n times\n end\n\nfn\nthe_durn_simplest_scene_computer\n {w, h : nat}\n (width : int w,\n height : int h,\n xcenter : real,\n ycenter : real,\n pixels_per_unit : real)\n :<cloref1> rgba_array (w, h) =\n let\n val escape_times =\n compute_escape_times (width, height, xcenter, ycenter,\n pixels_per_unit, g1i2u 255)\n and points = matrixref_make_elt<rgba> (i2sz width, i2sz height,\n empty_scene_color)\n\n fn {}\n time2rgba {tm : nat | tm <= 255}\n (tm : uint16 tm) : rgba =\n let\n val v = (g0u2u (g1i2u 255 - tm)) : uint8\n in\n @(v, v, v, g0i2u 255)\n end\n\n fun\n loop {i, j : nat | i <= w; j <= h}\n .<w - i, h - j>.\n (i : int i,\n j : int j) : void =\n if i = width then\n ()\n else if j = height then\n loop (succ i, 0)\n else\n begin\n points[i, height, j] :=\n time2rgba escape_times[i, height, j];\n loop (i, succ j)\n end\n in\n loop (0, 0);\n points\n end\n\n(*------------------------------------------------------------------*)\n(* Writing an image to a Portable Arbitrary Map. *)\n\nfn\nwrite_rgba_points_as_pam\n {w, h : nat}\n (outf : FILEref,\n width : int w,\n height : int h,\n points : rgba_array (w, h)) : void =\n let\n fun\n loop {i, j : nat | i <= w; j <= h}\n .<h - j, w - i>.\n (i : int i,\n j : int j) : void =\n if j = height then\n ()\n else if i = width then\n loop (0, succ j)\n else\n let\n val @(r, g, b, a) = points[i, height, j]\n in\n fprint! (outf, int2uchar0 (g0u2i r));\n fprint! (outf, int2uchar0 (g0u2i g));\n fprint! (outf, int2uchar0 (g0u2i b));\n fprint! (outf, int2uchar0 (g0u2i a));\n loop (succ i, j)\n end\n in\n (* Portable Arbitrary Map:\n https://netpbm.sourceforge.net/doc/pam.html *)\n fprintln! (outf, \"P7\");\n fprintln! (outf, \"WIDTH \", width);\n fprintln! (outf, \"HEIGHT \", height);\n fprintln! (outf, \"DEPTH 4\");\n fprintln! (outf, \"MAXVAL 255\");\n fprintln! (outf, \"TUPLTYPE RGB_ALPHA\");\n fprintln! (outf, \"ENDHDR\");\n loop (0, 0)\n end\n\n(* For this demo, simply number the images, starting at 1 on each run\n of the program. *)\nval image_number : ref uint = ref 1U\nfn\nwrite_image {w, h : nat}\n (width : int w,\n height : int h,\n points : rgba_array (w, h)) : void =\n let\n val filename =\n strptr2string (string_append (\"mandelbrot-image-\",\n tostring_val<uint> !image_number,\n \".pam\"))\n in\n case+ fileref_open_opt (filename, file_mode_w) of\n | ~ None_vt () =>\n println! (\"ERROR: could not open \", filename, \" for writing.\")\n | ~ Some_vt outf =>\n begin\n write_rgba_points_as_pam (outf, width, height, points);\n fileref_close (outf);\n println! (\"SUCCESS: wrote \", filename);\n !image_number := succ !image_number\n end\n end\n\n(*------------------------------------------------------------------*)\n\nval initial_width : intGte 0 = 400\nval initial_height : intGte 0 = 400\nval initial_xcenter : real = g0f2f ~0.75\nval initial_ycenter : real = g0f2f 0.0\nval initial_pixels_per_unit : real = g0f2f 150.0\nval initial_scene_computer : scene_computer =\n the_durn_simplest_scene_computer\n\n(* Zoom factor could be adjustable, but is not in this simple demo. *)\nval zoom_factor : real = g0f2f 2.0\nval min_pixels_per_unit : real = g0f2f 10.0\n\nfn\nset_render_rgba (renderer : !SDL_Renderer_ptr1,\n rgba : rgba) : int =\n let\n val @(r, g, b, a) = rgba\n in\n SDL_SetRenderDrawColor (renderer, r, g, b, a)\n end\n\nfn\ndraw_scene {w, h : nat}\n (renderer : !SDL_Renderer_ptr1,\n width : int w,\n height : int h,\n points : rgba_array (w, h)) : void =\n let\n prval () = mul_gte_gte_gte {w, h} ()\n\n fun\n loop {i, j : nat | i <= w; j <= h}\n .<w - i, h - j>.\n (renderer : !SDL_Renderer_ptr1,\n i : int i,\n j : int j) : void =\n if i = width then\n ()\n else if j = height then\n loop (renderer, succ i, 0)\n else\n let\n val rgba = points[i, height, j]\n val _ = set_render_rgba (renderer, rgba)\n val _ = SDL_RenderDrawPoint (renderer, i, j)\n in\n loop (renderer, i, succ j)\n end\n in\n ignoret (set_render_rgba (renderer, empty_scene_color));\n ignoret (SDL_RenderClear (renderer));\n loop (renderer, 0, 0);\n end\n\nfnx\nsituation_changed\n {w, h : nat}\n (situation : &situation (w, h) >> situation,\n event : &SDL_Event? >> SDL_Event) : void =\n let\n val compute_scene = situation.compute_scene\n val points =\n compute_scene (situation.width, situation.height,\n situation.xcenter, situation.ycenter,\n situation.pixels_per_unit)\n in\n SDL_Delay (g0i2u 16);\n event_loop (situation, points, event)\n end\nand\nevent_loop {w, h : nat}\n (situation : &situation (w, h) >> situation,\n points : rgba_array (w, h),\n event : &SDL_Event? >> SDL_Event) : void =\n let\n macdef quit_the_event_loop =\n ()\n macdef present_the_scene =\n present_scene (situation, points, event)\n macdef deal_with_changed_situation =\n situation_changed (situation, event)\n macdef write_an_image =\n write_image (situation.width, situation.height, points);\n in\n if resize_needed situation then\n let\n val @(w, h) = get_renderer_size situation\n in\n situation.width := w;\n situation.height := h;\n deal_with_changed_situation\n end\n else\n let\n in\n draw_scene (situation.renderer,\n situation.width, situation.height,\n points);\n case+ SDL_PollEvent (event) of\n | 0 => present_the_scene\n | 1 =>\n if event.type = SDL_QUIT then\n quit_the_event_loop\n else if event.type = SDL_WINDOWEVENT then\n let\n prval @(pf, fpf) = SDL_Event2WindowEvent_v (view@ event)\n prval () = view@ event := pf\n val window_event = event\n prval () = view@ event := fpf (view@ event)\n in\n if window_event.event = SDL_WINDOWEVENT_SIZE_CHANGED then\n deal_with_changed_situation\n else if window_event.event = SDL_WINDOWEVENT_CLOSE then\n quit_the_event_loop\n else\n present_the_scene\n end\n else if event.type = SDL_MOUSEBUTTONDOWN then\n let\n prval @(pf, fpf) = SDL_Event2MouseButtonEvent_v (view@ event)\n prval () = view@ event := pf\n val button_event = event\n prval () = view@ event := fpf (view@ event)\n in\n if button_event.button = SDL_BUTTON_LEFT then\n begin\n if button_event.clicks = g0i2u 1 then\n let (* Re-center. *)\n val x = g0i2i button_event.x\n and y = g0i2i button_event.y\n and w = situation.width\n and h = situation.height\n and ppu = situation.pixels_per_unit\n val ppu2 = ppu + ppu\n in\n situation.xcenter :=\n situation.xcenter + (g0i2f (x + x - w) / ppu2);\n situation.ycenter :=\n situation.ycenter + (g0i2f (h - y - y) / ppu2);\n deal_with_changed_situation\n end\n else\n let (* Zoom in. *)\n val new_ppu = situation.pixels_per_unit * zoom_factor\n in\n situation.pixels_per_unit := new_ppu;\n deal_with_changed_situation\n end\n end\n else if button_event.button = SDL_BUTTON_RIGHT then\n begin\n if button_event.clicks = g0i2u 1 then\n present_the_scene\n else\n let (* Zoom out *)\n val new_ppu = situation.pixels_per_unit / zoom_factor\n in\n if min_pixels_per_unit <= new_ppu then\n situation.pixels_per_unit := new_ppu;\n deal_with_changed_situation\n end\n end\n else\n present_the_scene\n end\n else if event.type = SDL_TEXTINPUT then\n let\n prval @(pf, fpf) = SDL_Event2TextInputEvent_v (view@ event)\n prval () = view@ event := pf\n var text_event = event\n prval () = view@ event := fpf (view@ event)\n macdef text = text_event.text\n in\n case+ @(text[0], text[1]) of\n | @('q', '\\0') => quit_the_event_loop\n | @('Q', '\\0') => quit_the_event_loop\n | @('p', '\\0') =>\n begin\n write_an_image;\n present_the_scene\n end\n | @('P', '\\0') =>\n begin\n write_an_image;\n present_the_scene\n end\n | _ => present_the_scene\n end\n else\n present_the_scene\n end\n end\nand\npresent_scene {w, h : nat}\n (situation : &situation (w, h) >> situation,\n points : rgba_array (w, h),\n event : &SDL_Event? >> SDL_Event) : void =\n begin\n SDL_RenderPresent (situation.renderer);\n SDL_Delay (g0i2u 16);\n event_loop (situation, points, event)\n end\n\nfn\nrun_program () : void =\n let\n (* FIXME: For best form, we should also set up a signal handler\n that runs SDL_Quit, so the display does not get stuck in an\n undesired state even if the program crashes. For instance,\n there could be a signaled divide by zero or overflow event. And\n we are at least changing whether the screensaver is enabled. *)\n val _ = atexit SDL_Quit\n\n val () = SDL_Init (SDL_INIT_EVENTS\n lor SDL_INIT_TIMER\n lor SDL_INIT_VIDEO)\n\n (* FIXME: Find out whether the screensaver was enabled BEFORE we\n started SDL2, and set SDL2 to whichever setting it was. *)\n val () = SDL_EnableScreenSaver ()\n\n val window = SDL_CreateWindow (\"mandelbrot_task_interactive\",\n SDL_WINDOWPOS_CENTERED,\n SDL_WINDOWPOS_CENTERED,\n initial_width, initial_height,\n SDL_WINDOW_RESIZABLE)\n val p_window = SDL_Window_ptr2ptr window\n prval () = lemma_ptr_param p_window\n in\n if iseqz p_window then\n begin\n SDL_DestroyWindow_null window;\n $raise bailout \"failed to initialize a window\"\n end\n else\n let\n val renderer = SDL_CreateRenderer (window, ~1, g0i2u 0)\n val p_renderer = SDL_Renderer_ptr2ptr renderer\n prval () = lemma_ptr_param p_renderer\n in\n if iseqz p_renderer then\n begin\n SDL_DestroyRenderer_null renderer;\n SDL_DestroyWindow window;\n $raise bailout \"failed to initialize a renderer\"\n end\n else\n let\n var situation : situation =\n @{window = window,\n renderer = renderer,\n width = initial_width,\n height = initial_height,\n xcenter = initial_xcenter,\n ycenter = initial_ycenter,\n pixels_per_unit = initial_pixels_per_unit,\n compute_scene = initial_scene_computer}\n var event : SDL_Event?\n in\n situation_changed (situation, event);\n destroy_situation situation\n end\n end\n end\n\nimplement\nmain () =\n try\n begin\n SDL_SetMainReady ();\n run_program ();\n 0\n end\n with\n | ~ bailout msg =>\n begin\n println! (\"Error: \", msg);\n 1\n end\n\n(*------------------------------------------------------------------*)\n","language":"ATS"},{"code":"Max_Iteration := 256\nWidth := Height := 400\n\nFile := \"MandelBrot.\" Width \".bmp\"\nProgress, b2 w400 fs9, Creating Colours ...\nGosub, CreateColours\nGosub, CreateBitmap\nProgress, Off\nGui, -Caption\nGui, Margin, 0, 0\nGui, Add, Picture,, %File%\nGui, Show,, MandelBrot\nReturn\n\nGuiClose:\nGuiEscape:\nExitApp\n\n\n\n;---------------------------------------------------------------------------\nCreateBitmap: ; create and save a 32bit bitmap file\n;---------------------------------------------------------------------------\n ; define header details\n HeaderBMP := 14\n HeaderDIB := 40\n DataOffset := HeaderBMP + HeaderDIB\n ImageSize := Width * Height * 4 ; 32bit\n FileSize := DataOffset + ImageSize\n Resolution := 3780 ; from mspaint\n\n ; create bitmap header\n VarSetCapacity(IMAGE, FileSize, 0)\n NumPut(Asc(\"B\") , IMAGE, 0x00, \"Char\")\n NumPut(Asc(\"M\") , IMAGE, 0x01, \"Char\")\n NumPut(FileSize , IMAGE, 0x02, \"UInt\")\n NumPut(DataOffset , IMAGE, 0x0A, \"UInt\")\n NumPut(HeaderDIB , IMAGE, 0x0E, \"UInt\")\n NumPut(Width , IMAGE, 0x12, \"UInt\")\n NumPut(Height , IMAGE, 0x16, \"UInt\")\n NumPut(1 , IMAGE, 0x1A, \"Short\") ; Planes\n NumPut(32 , IMAGE, 0x1C, \"Short\") ; Bits per Pixel\n NumPut(ImageSize , IMAGE, 0x22, \"UInt\")\n NumPut(Resolution , IMAGE, 0x26, \"UInt\")\n NumPut(Resolution , IMAGE, 0x2A, \"UInt\")\n\n ; fill in Data\n Gosub, CreatePixels\n\n ; save Bitmap to file\n FileDelete, %File%\n Handle := DllCall(\"CreateFile\", \"Str\", File, \"UInt\", 0x40000000\n , \"UInt\", 0, \"UInt\", 0, \"UInt\", 2, \"UInt\", 0, \"UInt\", 0)\n DllCall(\"WriteFile\", \"UInt\", Handle, \"UInt\", &IMAGE, \"UInt\"\n , FileSize, \"UInt *\", Bytes, \"UInt\", 0)\n DllCall(\"CloseHandle\", \"UInt\", Handle)\n\nReturn\n\n\n\n;---------------------------------------------------------------------------\nCreatePixels: ; create pixels for [-2 < x < 1] [-1.5 < y < 1.5]\n;---------------------------------------------------------------------------\n Loop, % Height // 2 + 1 {\n yi := A_Index - 1\n y0 := -1.5 + yi / Height * 3 ; range -1.5 .. +1.5\n Progress, % 200*yi // Height, % \"Current line: \" 2*yi \" / \" Height\n Loop, %Width% {\n xi := A_Index - 1\n x0 := -2 + xi / Width * 3 ; range -2 .. +1\n Gosub, Mandelbrot\n p1 := DataOffset + 4 * (Width * yi + xi)\n NumPut(Colour, IMAGE, p1, \"UInt\")\n p2 := DataOffset + 4 * (Width * (Height-yi) + xi)\n NumPut(Colour, IMAGE, p2, \"UInt\")\n }\n }\nReturn\n\n\n\n;---------------------------------------------------------------------------\nMandelbrot: ; calculate a colour for each pixel\n;---------------------------------------------------------------------------\n x := y := Iteration := 0\n While, (x*x + y*y <= 4) And (Iteration < Max_Iteration) {\n xtemp := x*x - y*y + x0\n y := 2*x*y + y0\n x := xtemp\n Iteration++\n }\n Colour := Iteration = Max_Iteration ? 0 : Colour_%Iteration%\n\nReturn\n\n\n\n;---------------------------------------------------------------------------\nCreateColours: ; borrowed from PureBasic example\n;---------------------------------------------------------------------------\n Loop, 64 {\n i4 := (i3 := (i2 := (i1 := A_Index - 1) + 64) + 64) + 64\n Colour_%i1% := RGB(4*i1 + 128, 4*i1, 0)\n Colour_%i2% := RGB(64, 255, 4*i1)\n Colour_%i3% := RGB(64, 255 - 4*i1, 255)\n Colour_%i4% := RGB(64, 0, 255 - 4*i1)\n }\nReturn\n\n\n\n;---------------------------------------------------------------------------\nRGB(r, g, b) { ; return 24bit color value\n;---------------------------------------------------------------------------\n Return, (r&0xFF)<<16 | g<<8 | b\n}\n","language":"AutoHotkey"},{"code":"BEGIN {\n XSize=59; YSize=21;\n MinIm=-1.0; MaxIm=1.0;MinRe=-2.0; MaxRe=1.0;\n StepX=(MaxRe-MinRe)/XSize; StepY=(MaxIm-MinIm)/YSize;\n for(y=0;y<YSize;y++)\n {\n Im=MinIm+StepY*y;\n for(x=0;x<XSize;x++)\n {\n Re=MinRe+StepX*x; Zr=Re; Zi=Im;\n for(n=0;n<30;n++)\n {\n a=Zr*Zr; b=Zi*Zi;\n if(a+b>4.0) break;\n Zi=2*Zr*Zi+Im; Zr=a-b+Re;\n }\n printf \"%c\",62-n;\n }\n print \"\";\n }\n exit;\n}\n","language":"AWK"},{"code":"main() {\n auto cx,cy,x,y,x2,y2;\n auto iter;\n\n auto xmin,xmax,ymin,ymax,maxiter,dx,dy;\n\n xmin = -8601;\n xmax = 2867;\n ymin = -4915;\n ymax = 4915;\n\n maxiter = 32;\n\n dx = (xmax-xmin)/79;\n dy = (ymax-ymin)/24;\n\n cy=ymin;\n while( cy<=ymax ) {\n cx=xmin;\n while( cx<=xmax ) {\n x = 0;\n y = 0;\n x2 = 0;\n y2 = 0;\n iter=0;\n while( iter<maxiter ) {\n if( x2+y2>16384 ) break;\n y = ((x*y)>>11)+cy;\n x = x2-y2+cx;\n x2 = (x*x)>>12;\n y2 = (y*y)>>12;\n iter++;\n }\n putchar(' '+iter);\n cx =+ dx;\n }\n putchar(13);\n putchar(10);\n cy =+ dy;\n }\n\n return(0);\n}\n","language":"B"},{"code":"fastgraphics\n\ngraphsize 384,384\nrefresh\nkt = 319 : m = 4.0\nxmin = -2.1 : xmax = 0.6 : ymin = -1.35 : ymax = 1.35\ndx = (xmax - xmin) / graphwidth : dy = (ymax - ymin) / graphheight\n\nfor x = 0 to graphwidth\n\tjx = xmin + x * dx\n\tfor y = 0 to graphheight\n\t\tjy = ymin + y * dy\n\t\tk = 0 : wx = 0.0 : wy = 0.0\n\t\tdo\n\t\t\ttx = wx * wx - wy * wy + jx\n\t\t\tty = 2.0 * wx * wy + jy\n\t\t\twx = tx\n\t\t\twy = ty\n\t\t\tr = wx * wx + wy * wy\n\t\t\tk = k + 1\n\t\tuntil r > m or k > kt\n\t\t\n\t\tif k > kt then\n\t\t\tcolor black\n\t\telse\n\t\t\tif k < 16 then color k * 8, k * 8, 128 + k * 4\n\t\t\tif k >= 16 and k < 64 then color 128 + k - 16, 128 + k - 16, 192 + k - 16\n\t\t\tif k >= 64 then color kt - k, 128 + (kt - k) / 2, kt - k\n\t\tend if\n\t\tplot x, y\n\tnext y\n\trefresh\nnext x\nimgsave \"Mandelbrot_BASIC-256.png\", \"PNG\"\n","language":"BASIC256"},{"code":" sizex% = 300 : sizey% = 300\n maxiter% = 128\n VDU 23,22,sizex%;sizey%;8,8,16,128\n ORIGIN 0,sizey%\n GCOL 1\n FOR X% = 0 TO 2*sizex%-2 STEP 2\n xi = X%/200 - 2\n FOR Y% = 0 TO sizey%-2 STEP 2\n yi = Y% / 200\n x = 0\n y = 0\n FOR I% = 1 TO maxiter%\n IF x*x+y*y > 4 EXIT FOR\n xt = xi + x*x-y*y\n y = yi + 2*x*y\n x = xt\n NEXT\n IF I%>maxiter% I%=0\n COLOUR 1,I%*15,I%*8,0\n PLOT X%,Y% : PLOT X%,-Y%\n NEXT\n NEXT X%\n","language":"BBC-BASIC"},{"code":"max_iter = 50\nwidth = 400; height = 401\nscale = 10\nxmin = -2; xmax = 1/2\nymin = -5/4; ymax = 5/4\n\ndefine mandelbrot(c_re, c_im) {\n auto i\n\n # z = 0\n z_re = 0; z_im = 0\n z2_re = 0; z2_im = 0\n\n for (i=0; i<max_iter; i++) {\n # z *= z\n z_im = 2*z_re*z_im\n z_re = z2_re - z2_im\n # z += c\n z_re += c_re\n z_im += c_im\n # z2 = z.*z\n z2_re = z_re*z_re\n z2_im = z_im*z_im\n if (z2_re + z2_im > 4) return i\n }\n return 0\n}\n\nprint \"P2\\n\", width, \" \", height, \"\\n255\\n\"\n\nfor (i = 0; i < height; i++) {\n y = ymin + (ymax - ymin) / height * i\n for (j = 0; j < width; j++) {\n x = xmin + (xmax - xmin) / width * j\n tmp_scale = scale\n scale = 0\n m = (255 * mandelbrot(x, y) + max_iter + 1) / max_iter\n print m\n if ( j < width - 1 ) print \" \"\n scale = tmp_scale\n\n }\n print \"\\n\"\n}\n\nquit\n","language":"Bc"},{"code":"0>:00p58*`#@_0>:01p78vv$$<\n@^+1g00,+55_v# !`\\+*9<>4v$\n@v30p20\"?~^\"< ^+1g10,+*8<$\n@>p0\\>\\::*::882**02g*0v >^\n`*:*\" d\":+*:-*\"[Z\"+g3 < |<\nv-*\"[Z\"+g30*g20**288\\--\\<#\n>2**5#>8*:*/00g\"P\"*58*:*v^\nv*288 p20/**288:+*\"[Z\"+-<:\n>*%03 p58*:*/01g\"3\"* v>::^\n \\_^#!:-1\\+-*2*:*85<^\n","language":"Befunge"},{"code":"#!/usr/bin/env bx\nuse b\n\nMain():\n\tnum outside = 16, ox = -0.5, oy = 0, r = 1.5\n\tlong i, max_i = 100, rb_i = 30\n\tspace()\n\tuint32_t *px = pixel()\n\tnum d = 2*r/h, x0 = ox-d*w_2, y0 = oy+d*h_2\n\tfor(y, 0, h):\n\t\tcmplx c = x0 + (y0-d*y)*I\n\t\trepeat(w):\n\t\t\tcmplx w = 0\n\t\t\tfor i=0; i < max_i && cabs(w) < outside; ++i\n\t\t\t\tw = w*w + c\n\t\t\t*px++ = i < max_i ? rainbow(i*359 / rb_i % 360) : black\n\t\t\tc += d\n","language":"Brace"},{"code":" A mandelbrot set fractal viewer in brainf*ck written by Erik Bosman\n+++++++++++++[->++>>>+++++>++>+<<<<<<]>>>>>++++++>--->>>>>>>>>>+++++++++++++++[[\n>>>>>>>>>]+[<<<<<<<<<]>>>>>>>>>-]+[>>>>>>>>[-]>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>[-]+\n<<<<<<<+++++[-[->>>>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>>>>+>>>>>>>>>>>>>>>>>>>>>>>>>>\n>+<<<<<<<<<<<<<<<<<[<<<<<<<<<]>>>[-]+[>>>>>>[>>>>>>>[-]>>]<<<<<<<<<[<<<<<<<<<]>>\n>>>>>[-]+<<<<<<++++[-[->>>>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>>>+<<<<<<+++++++[-[->>>\n>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>>>+<<<<<<<<<<<<<<<<[<<<<<<<<<]>>>[[-]>>>>>>[>>>>>\n>>[-<<<<<<+>>>>>>]<<<<<<[->>>>>>+<<+<<<+<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>\n[>>>>>>>>[-<<<<<<<+>>>>>>>]<<<<<<<[->>>>>>>+<<+<<<+<<]>>>>>>>>]<<<<<<<<<[<<<<<<<\n<<]>>>>>>>[-<<<<<<<+>>>>>>>]<<<<<<<[->>>>>>>+<<+<<<<<]>>>>>>>>>+++++++++++++++[[\n>>>>>>>>>]+>[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>-]+[\n>+>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>->>>>[-<<<<+>>>>]<<<<[->>>>+<<<<<[->>[\n-<<+>>]<<[->>+>>+<<<<]+>>>>>>>>>]<<<<<<<<[<<<<<<<<<]]>>>>>>>>>[>>>>>>>>>]<<<<<<<\n<<[>[->>>>>>>>>+<<<<<<<<<]<<<<<<<<<<]>[->>>>>>>>>+<<<<<<<<<]<+>>>>>>>>]<<<<<<<<<\n[>[-]<->>>>[-<<<<+>[<->-<<<<<<+>>>>>>]<[->+<]>>>>]<<<[->>>+<<<]<+<<<<<<<<<]>>>>>\n>>>>[>+>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>->>>>>[-<<<<<+>>>>>]<<<<<[->>>>>+\n<<<<<<[->>>[-<<<+>>>]<<<[->>>+>+<<<<]+>>>>>>>>>]<<<<<<<<[<<<<<<<<<]]>>>>>>>>>[>>\n>>>>>>>]<<<<<<<<<[>>[->>>>>>>>>+<<<<<<<<<]<<<<<<<<<<<]>>[->>>>>>>>>+<<<<<<<<<]<<\n+>>>>>>>>]<<<<<<<<<[>[-]<->>>>[-<<<<+>[<->-<<<<<<+>>>>>>]<[->+<]>>>>]<<<[->>>+<<\n<]<+<<<<<<<<<]>>>>>>>>>[>>>>[-<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<+>>>>>>>>>>>>>\n>>>>>>>>>>>>>>>>>>>>>>>]>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>+++++++++++++++[[>>>>\n>>>>>]<<<<<<<<<-<<<<<<<<<[<<<<<<<<<]>>>>>>>>>-]+>>>>>>>>>>>>>>>>>>>>>+<<<[<<<<<<\n<<<]>>>>>>>>>[>>>[-<<<->>>]+<<<[->>>->[-<<<<+>>>>]<<<<[->>>>+<<<<<<<<<<<<<[<<<<<\n<<<<]>>>>[-]+>>>>>[>>>>>>>>>]>+<]]+>>>>[-<<<<->>>>]+<<<<[->>>>-<[-<<<+>>>]<<<[->\n>>+<<<<<<<<<<<<[<<<<<<<<<]>>>[-]+>>>>>>[>>>>>>>>>]>[-]+<]]+>[-<[>>>>>>>>>]<<<<<<\n<<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]<<<<<<<[->+>>>-<<<<]>>>>>>>>>+++++++++++++++++++\n+++++++>>[-<<<<+>>>>]<<<<[->>>>+<<[-]<<]>>[<<<<<<<+<[-<+>>>>+<<[-]]>[-<<[->+>>>-\n<<<<]>>>]>>>>>>>>>>>>>[>>[-]>[-]>[-]>>>>>]<<<<<<<<<[<<<<<<<<<]>>>[-]>>>>>>[>>>>>\n[-<<<<+>>>>]<<<<[->>>>+<<<+<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>>[-<<<<<<<<\n<+>>>>>>>>>]>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>+++++++++++++++[[>>>>>>>>>]+>[-\n]>[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>-]+[>+>>>>>>>>]<<<\n<<<<<<[<<<<<<<<<]>>>>>>>>>[>->>>>>[-<<<<<+>>>>>]<<<<<[->>>>>+<<<<<<[->>[-<<+>>]<\n<[->>+>+<<<]+>>>>>>>>>]<<<<<<<<[<<<<<<<<<]]>>>>>>>>>[>>>>>>>>>]<<<<<<<<<[>[->>>>\n>>>>>+<<<<<<<<<]<<<<<<<<<<]>[->>>>>>>>>+<<<<<<<<<]<+>>>>>>>>]<<<<<<<<<[>[-]<->>>\n[-<<<+>[<->-<<<<<<<+>>>>>>>]<[->+<]>>>]<<[->>+<<]<+<<<<<<<<<]>>>>>>>>>[>>>>>>[-<\n<<<<+>>>>>]<<<<<[->>>>>+<<<<+<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>+>>>>>>>>\n]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>->>>>>[-<<<<<+>>>>>]<<<<<[->>>>>+<<<<<<[->>[-<<+\n>>]<<[->>+>>+<<<<]+>>>>>>>>>]<<<<<<<<[<<<<<<<<<]]>>>>>>>>>[>>>>>>>>>]<<<<<<<<<[>\n[->>>>>>>>>+<<<<<<<<<]<<<<<<<<<<]>[->>>>>>>>>+<<<<<<<<<]<+>>>>>>>>]<<<<<<<<<[>[-\n]<->>>>[-<<<<+>[<->-<<<<<<+>>>>>>]<[->+<]>>>>]<<<[->>>+<<<]<+<<<<<<<<<]>>>>>>>>>\n[>>>>[-<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<+>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n]>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>>>[-<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<+>\n>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>]>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>++++++++\n+++++++[[>>>>>>>>>]<<<<<<<<<-<<<<<<<<<[<<<<<<<<<]>>>>>>>>>-]+[>>>>>>>>[-<<<<<<<+\n>>>>>>>]<<<<<<<[->>>>>>>+<<<<<<+<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>>>>>>[\n-]>>>]<<<<<<<<<[<<<<<<<<<]>>>>+>[-<-<<<<+>>>>>]>[-<<<<<<[->>>>>+<++<<<<]>>>>>[-<\n<<<<+>>>>>]<->+>]<[->+<]<<<<<[->>>>>+<<<<<]>>>>>>[-]<<<<<<+>>>>[-<<<<->>>>]+<<<<\n[->>>>->>>>>[>>[-<<->>]+<<[->>->[-<<<+>>>]<<<[->>>+<<<<<<<<<<<<[<<<<<<<<<]>>>[-]\n+>>>>>>[>>>>>>>>>]>+<]]+>>>[-<<<->>>]+<<<[->>>-<[-<<+>>]<<[->>+<<<<<<<<<<<[<<<<<\n<<<<]>>>>[-]+>>>>>[>>>>>>>>>]>[-]+<]]+>[-<[>>>>>>>>>]<<<<<<<<]>>>>>>>>]<<<<<<<<<\n[<<<<<<<<<]>>>>[-<<<<+>>>>]<<<<[->>>>+>>>>>[>+>>[-<<->>]<<[->>+<<]>>>>>>>>]<<<<<\n<<<+<[>[->>>>>+<<<<[->>>>-<<<<<<<<<<<<<<+>>>>>>>>>>>[->>>+<<<]<]>[->>>-<<<<<<<<<\n<<<<<+>>>>>>>>>>>]<<]>[->>>>+<<<[->>>-<<<<<<<<<<<<<<+>>>>>>>>>>>]<]>[->>>+<<<]<<\n<<<<<<<<<<]>>>>[-]<<<<]>>>[-<<<+>>>]<<<[->>>+>>>>>>[>+>[-<->]<[->+<]>>>>>>>>]<<<\n<<<<<+<[>[->>>>>+<<<[->>>-<<<<<<<<<<<<<<+>>>>>>>>>>[->>>>+<<<<]>]<[->>>>-<<<<<<<\n<<<<<<<+>>>>>>>>>>]<]>>[->>>+<<<<[->>>>-<<<<<<<<<<<<<<+>>>>>>>>>>]>]<[->>>>+<<<<\n]<<<<<<<<<<<]>>>>>>+<<<<<<]]>>>>[-<<<<+>>>>]<<<<[->>>>+>>>>>[>>>>>>>>>]<<<<<<<<<\n[>[->>>>>+<<<<[->>>>-<<<<<<<<<<<<<<+>>>>>>>>>>>[->>>+<<<]<]>[->>>-<<<<<<<<<<<<<<\n+>>>>>>>>>>>]<<]>[->>>>+<<<[->>>-<<<<<<<<<<<<<<+>>>>>>>>>>>]<]>[->>>+<<<]<<<<<<<\n<<<<<]]>[-]>>[-]>[-]>>>>>[>>[-]>[-]>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>>>>>[-<\n<<<+>>>>]<<<<[->>>>+<<<+<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>+++++++++++++++[\n[>>>>>>>>>]+>[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>-]+\n[>+>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>->>>>[-<<<<+>>>>]<<<<[->>>>+<<<<<[->>\n[-<<+>>]<<[->>+>+<<<]+>>>>>>>>>]<<<<<<<<[<<<<<<<<<]]>>>>>>>>>[>>>>>>>>>]<<<<<<<<\n<[>[->>>>>>>>>+<<<<<<<<<]<<<<<<<<<<]>[->>>>>>>>>+<<<<<<<<<]<+>>>>>>>>]<<<<<<<<<[\n>[-]<->>>[-<<<+>[<->-<<<<<<<+>>>>>>>]<[->+<]>>>]<<[->>+<<]<+<<<<<<<<<]>>>>>>>>>[\n>>>[-<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<+>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>]>\n>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>[-]>>>>+++++++++++++++[[>>>>>>>>>]<<<<<<<<<-<<<<<\n<<<<[<<<<<<<<<]>>>>>>>>>-]+[>>>[-<<<->>>]+<<<[->>>->[-<<<<+>>>>]<<<<[->>>>+<<<<<\n<<<<<<<<[<<<<<<<<<]>>>>[-]+>>>>>[>>>>>>>>>]>+<]]+>>>>[-<<<<->>>>]+<<<<[->>>>-<[-\n<<<+>>>]<<<[->>>+<<<<<<<<<<<<[<<<<<<<<<]>>>[-]+>>>>>>[>>>>>>>>>]>[-]+<]]+>[-<[>>\n>>>>>>>]<<<<<<<<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>[-<<<+>>>]<<<[->>>+>>>>>>[>+>>>\n[-<<<->>>]<<<[->>>+<<<]>>>>>>>>]<<<<<<<<+<[>[->+>[-<-<<<<<<<<<<+>>>>>>>>>>>>[-<<\n+>>]<]>[-<<-<<<<<<<<<<+>>>>>>>>>>>>]<<<]>>[-<+>>[-<<-<<<<<<<<<<+>>>>>>>>>>>>]<]>\n[-<<+>>]<<<<<<<<<<<<<]]>>>>[-<<<<+>>>>]<<<<[->>>>+>>>>>[>+>>[-<<->>]<<[->>+<<]>>\n>>>>>>]<<<<<<<<+<[>[->+>>[-<<-<<<<<<<<<<+>>>>>>>>>>>[-<+>]>]<[-<-<<<<<<<<<<+>>>>\n>>>>>>>]<<]>>>[-<<+>[-<-<<<<<<<<<<+>>>>>>>>>>>]>]<[-<+>]<<<<<<<<<<<<]>>>>>+<<<<<\n]>>>>>>>>>[>>>[-]>[-]>[-]>>>>]<<<<<<<<<[<<<<<<<<<]>>>[-]>[-]>>>>>[>>>>>>>[-<<<<<\n<+>>>>>>]<<<<<<[->>>>>>+<<<<+<<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>+>[-<-<<<<+>>>>\n>]>>[-<<<<<<<[->>>>>+<++<<<<]>>>>>[-<<<<<+>>>>>]<->+>>]<<[->>+<<]<<<<<[->>>>>+<<\n<<<]+>>>>[-<<<<->>>>]+<<<<[->>>>->>>>>[>>>[-<<<->>>]+<<<[->>>-<[-<<+>>]<<[->>+<<\n<<<<<<<<<[<<<<<<<<<]>>>>[-]+>>>>>[>>>>>>>>>]>+<]]+>>[-<<->>]+<<[->>->[-<<<+>>>]<\n<<[->>>+<<<<<<<<<<<<[<<<<<<<<<]>>>[-]+>>>>>>[>>>>>>>>>]>[-]+<]]+>[-<[>>>>>>>>>]<\n<<<<<<<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>[-<<<+>>>]<<<[->>>+>>>>>>[>+>[-<->]<[->+\n<]>>>>>>>>]<<<<<<<<+<[>[->>>>+<<[->>-<<<<<<<<<<<<<+>>>>>>>>>>[->>>+<<<]>]<[->>>-\n<<<<<<<<<<<<<+>>>>>>>>>>]<]>>[->>+<<<[->>>-<<<<<<<<<<<<<+>>>>>>>>>>]>]<[->>>+<<<\n]<<<<<<<<<<<]>>>>>[-]>>[-<<<<<<<+>>>>>>>]<<<<<<<[->>>>>>>+<<+<<<<<]]>>>>[-<<<<+>\n>>>]<<<<[->>>>+>>>>>[>+>>[-<<->>]<<[->>+<<]>>>>>>>>]<<<<<<<<+<[>[->>>>+<<<[->>>-\n<<<<<<<<<<<<<+>>>>>>>>>>>[->>+<<]<]>[->>-<<<<<<<<<<<<<+>>>>>>>>>>>]<<]>[->>>+<<[\n->>-<<<<<<<<<<<<<+>>>>>>>>>>>]<]>[->>+<<]<<<<<<<<<<<<]]>>>>[-]<<<<]>>>>[-<<<<+>>\n>>]<<<<[->>>>+>[-]>>[-<<<<<<<+>>>>>>>]<<<<<<<[->>>>>>>+<<+<<<<<]>>>>>>>>>[>>>>>>\n>>>]<<<<<<<<<[>[->>>>+<<<[->>>-<<<<<<<<<<<<<+>>>>>>>>>>>[->>+<<]<]>[->>-<<<<<<<<\n<<<<<+>>>>>>>>>>>]<<]>[->>>+<<[->>-<<<<<<<<<<<<<+>>>>>>>>>>>]<]>[->>+<<]<<<<<<<<\n<<<<]]>>>>>>>>>[>>[-]>[-]>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>[-]>[-]>>>>>[>>>>>[-<<<<+\n>>>>]<<<<[->>>>+<<<+<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>>>>>>[-<<<<<+>>>>>\n]<<<<<[->>>>>+<<<+<<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>+++++++++++++++[[>>>>\n>>>>>]+>[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>-]+[>+>>\n>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>->>>>[-<<<<+>>>>]<<<<[->>>>+<<<<<[->>[-<<+\n>>]<<[->>+>>+<<<<]+>>>>>>>>>]<<<<<<<<[<<<<<<<<<]]>>>>>>>>>[>>>>>>>>>]<<<<<<<<<[>\n[->>>>>>>>>+<<<<<<<<<]<<<<<<<<<<]>[->>>>>>>>>+<<<<<<<<<]<+>>>>>>>>]<<<<<<<<<[>[-\n]<->>>>[-<<<<+>[<->-<<<<<<+>>>>>>]<[->+<]>>>>]<<<[->>>+<<<]<+<<<<<<<<<]>>>>>>>>>\n[>+>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>->>>>>[-<<<<<+>>>>>]<<<<<[->>>>>+<<<<\n<<[->>>[-<<<+>>>]<<<[->>>+>+<<<<]+>>>>>>>>>]<<<<<<<<[<<<<<<<<<]]>>>>>>>>>[>>>>>>\n>>>]<<<<<<<<<[>>[->>>>>>>>>+<<<<<<<<<]<<<<<<<<<<<]>>[->>>>>>>>>+<<<<<<<<<]<<+>>>\n>>>>>]<<<<<<<<<[>[-]<->>>>[-<<<<+>[<->-<<<<<<+>>>>>>]<[->+<]>>>>]<<<[->>>+<<<]<+\n<<<<<<<<<]>>>>>>>>>[>>>>[-<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<+>>>>>>>>>>>>>>>>>\n>>>>>>>>>>>>>>>>>>>]>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>+++++++++++++++[[>>>>>>>>\n>]<<<<<<<<<-<<<<<<<<<[<<<<<<<<<]>>>>>>>>>-]+>>>>>>>>>>>>>>>>>>>>>+<<<[<<<<<<<<<]\n>>>>>>>>>[>>>[-<<<->>>]+<<<[->>>->[-<<<<+>>>>]<<<<[->>>>+<<<<<<<<<<<<<[<<<<<<<<<\n]>>>>[-]+>>>>>[>>>>>>>>>]>+<]]+>>>>[-<<<<->>>>]+<<<<[->>>>-<[-<<<+>>>]<<<[->>>+<\n<<<<<<<<<<<[<<<<<<<<<]>>>[-]+>>>>>>[>>>>>>>>>]>[-]+<]]+>[-<[>>>>>>>>>]<<<<<<<<]>\n>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>->>[-<<<<+>>>>]<<<<[->>>>+<<[-]<<]>>]<<+>>>>[-<<<<\n->>>>]+<<<<[->>>>-<<<<<<.>>]>>>>[-<<<<<<<.>>>>>>>]<<<[-]>[-]>[-]>[-]>[-]>[-]>>>[\n>[-]>[-]>[-]>[-]>[-]>[-]>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>>>>>[-]>>>>]<<<<<<<<<\n[<<<<<<<<<]>+++++++++++[-[->>>>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>+>>>>>>>>>+<<<<<<<<\n<<<<<<[<<<<<<<<<]>>>>>>>[-<<<<<<<+>>>>>>>]<<<<<<<[->>>>>>>+[-]>>[>>>>>>>>>]<<<<<\n<<<<[>>>>>>>[-<<<<<<+>>>>>>]<<<<<<[->>>>>>+<<<<<<<[<<<<<<<<<]>>>>>>>[-]+>>>]<<<<\n<<<<<<]]>>>>>>>[-<<<<<<<+>>>>>>>]<<<<<<<[->>>>>>>+>>[>+>>>>[-<<<<->>>>]<<<<[->>>\n>+<<<<]>>>>>>>>]<<+<<<<<<<[>>>>>[->>+<<]<<<<<<<<<<<<<<]>>>>>>>>>[>>>>>>>>>]<<<<<\n<<<<[>[-]<->>>>>>>[-<<<<<<<+>[<->-<<<+>>>]<[->+<]>>>>>>>]<<<<<<[->>>>>>+<<<<<<]<\n+<<<<<<<<<]>>>>>>>-<<<<[-]+<<<]+>>>>>>>[-<<<<<<<->>>>>>>]+<<<<<<<[->>>>>>>->>[>>\n>>>[->>+<<]>>>>]<<<<<<<<<[>[-]<->>>>>>>[-<<<<<<<+>[<->-<<<+>>>]<[->+<]>>>>>>>]<<\n<<<<[->>>>>>+<<<<<<]<+<<<<<<<<<]>+++++[-[->>>>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>+<<<\n<<[<<<<<<<<<]>>>>>>>>>[>>>>>[-<<<<<->>>>>]+<<<<<[->>>>>->>[-<<<<<<<+>>>>>>>]<<<<\n<<<[->>>>>>>+<<<<<<<<<<<<<<<<[<<<<<<<<<]>>>>[-]+>>>>>[>>>>>>>>>]>+<]]+>>>>>>>[-<\n<<<<<<->>>>>>>]+<<<<<<<[->>>>>>>-<<[-<<<<<+>>>>>]<<<<<[->>>>>+<<<<<<<<<<<<<<[<<<\n<<<<<<]>>>[-]+>>>>>>[>>>>>>>>>]>[-]+<]]+>[-<[>>>>>>>>>]<<<<<<<<]>>>>>>>>]<<<<<<<\n<<[<<<<<<<<<]>>>>[-]<<<+++++[-[->>>>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>-<<<<<[<<<<<<<\n<<]]>>>]<<<<.>>>>>>>>>>[>>>>>>[-]>>>]<<<<<<<<<[<<<<<<<<<]>++++++++++[-[->>>>>>>>\n>+<<<<<<<<<]>>>>>>>>>]>>>>>+>>>>>>>>>+<<<<<<<<<<<<<<<[<<<<<<<<<]>>>>>>>>[-<<<<<<\n<<+>>>>>>>>]<<<<<<<<[->>>>>>>>+[-]>[>>>>>>>>>]<<<<<<<<<[>>>>>>>>[-<<<<<<<+>>>>>>\n>]<<<<<<<[->>>>>>>+<<<<<<<<[<<<<<<<<<]>>>>>>>>[-]+>>]<<<<<<<<<<]]>>>>>>>>[-<<<<<\n<<<+>>>>>>>>]<<<<<<<<[->>>>>>>>+>[>+>>>>>[-<<<<<->>>>>]<<<<<[->>>>>+<<<<<]>>>>>>\n>>]<+<<<<<<<<[>>>>>>[->>+<<]<<<<<<<<<<<<<<<]>>>>>>>>>[>>>>>>>>>]<<<<<<<<<[>[-]<-\n>>>>>>>>[-<<<<<<<<+>[<->-<<+>>]<[->+<]>>>>>>>>]<<<<<<<[->>>>>>>+<<<<<<<]<+<<<<<<\n<<<]>>>>>>>>-<<<<<[-]+<<<]+>>>>>>>>[-<<<<<<<<->>>>>>>>]+<<<<<<<<[->>>>>>>>->[>>>\n>>>[->>+<<]>>>]<<<<<<<<<[>[-]<->>>>>>>>[-<<<<<<<<+>[<->-<<+>>]<[->+<]>>>>>>>>]<<\n<<<<<[->>>>>>>+<<<<<<<]<+<<<<<<<<<]>+++++[-[->>>>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>>\n+>>>>>>>>>>>>>>>>>>>>>>>>>>>+<<<<<<[<<<<<<<<<]>>>>>>>>>[>>>>>>[-<<<<<<->>>>>>]+<\n<<<<<[->>>>>>->>[-<<<<<<<<+>>>>>>>>]<<<<<<<<[->>>>>>>>+<<<<<<<<<<<<<<<<<[<<<<<<<\n<<]>>>>[-]+>>>>>[>>>>>>>>>]>+<]]+>>>>>>>>[-<<<<<<<<->>>>>>>>]+<<<<<<<<[->>>>>>>>\n-<<[-<<<<<<+>>>>>>]<<<<<<[->>>>>>+<<<<<<<<<<<<<<<[<<<<<<<<<]>>>[-]+>>>>>>[>>>>>>\n>>>]>[-]+<]]+>[-<[>>>>>>>>>]<<<<<<<<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>[-]<<<++++\n+[-[->>>>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>>->>>>>>>>>>>>>>>>>>>>>>>>>>>-<<<<<<[<<<<\n<<<<<]]>>>]\n","language":"Brainf---"},{"code":" /*\n c program:\n --------------------------------\n 1. draws Mandelbrot set for Fc(z)=z*z +c\n using Mandelbrot algorithm ( boolean escape time )\n -------------------------------\n 2. technique of creating ppm file is based on the code of Claudio Rocchini\n http://en.wikipedia.org/wiki/Image:Color_complex_plot.jpg\n create 24 bit color graphic file , portable pixmap file = PPM\n see http://en.wikipedia.org/wiki/Portable_pixmap\n to see the file use external application ( graphic viewer)\n */\n #include <stdio.h>\n #include <math.h>\n int main()\n {\n /* screen ( integer) coordinate */\n int iX,iY;\n const int iXmax = 800;\n const int iYmax = 800;\n /* world ( double) coordinate = parameter plane*/\n double Cx,Cy;\n const double CxMin=-2.5;\n const double CxMax=1.5;\n const double CyMin=-2.0;\n const double CyMax=2.0;\n /* */\n double PixelWidth=(CxMax-CxMin)/iXmax;\n double PixelHeight=(CyMax-CyMin)/iYmax;\n /* color component ( R or G or B) is coded from 0 to 255 */\n /* it is 24 bit color RGB file */\n const int MaxColorComponentValue=255;\n FILE * fp;\n char *filename=\"new1.ppm\";\n char *comment=\"# \";/* comment should start with # */\n static unsigned char color[3];\n /* Z=Zx+Zy*i ; Z0 = 0 */\n double Zx, Zy;\n double Zx2, Zy2; /* Zx2=Zx*Zx; Zy2=Zy*Zy */\n /* */\n int Iteration;\n const int IterationMax=200;\n /* bail-out value , radius of circle ; */\n const double EscapeRadius=2;\n double ER2=EscapeRadius*EscapeRadius;\n /*create new file,give it a name and open it in binary mode */\n fp= fopen(filename,\"wb\"); /* b - binary mode */\n /*write ASCII header to the file*/\n fprintf(fp,\"P6\\n %s\\n %d\\n %d\\n %d\\n\",comment,iXmax,iYmax,MaxColorComponentValue);\n /* compute and write image data bytes to the file*/\n for(iY=0;iY<iYmax;iY++)\n {\n Cy=CyMin + iY*PixelHeight;\n if (fabs(Cy)< PixelHeight/2) Cy=0.0; /* Main antenna */\n for(iX=0;iX<iXmax;iX++)\n {\n Cx=CxMin + iX*PixelWidth;\n /* initial value of orbit = critical point Z= 0 */\n Zx=0.0;\n Zy=0.0;\n Zx2=Zx*Zx;\n Zy2=Zy*Zy;\n /* */\n for (Iteration=0;Iteration<IterationMax && ((Zx2+Zy2)<ER2);Iteration++)\n {\n Zy=2*Zx*Zy + Cy;\n Zx=Zx2-Zy2 +Cx;\n Zx2=Zx*Zx;\n Zy2=Zy*Zy;\n };\n /* compute pixel color (24 bit = 3 bytes) */\n if (Iteration==IterationMax)\n { /* interior of Mandelbrot set = black */\n color[0]=0;\n color[1]=0;\n color[2]=0;\n }\n else\n { /* exterior of Mandelbrot set = white */\n color[0]=255; /* Red*/\n color[1]=255; /* Green */\n color[2]=255;/* Blue */\n };\n /*write color to the file*/\n fwrite(color,1,3,fp);\n }\n }\n fclose(fp);\n return 0;\n }\n","language":"C"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <GL/glut.h>\n#include <GL/gl.h>\n#include <GL/glu.h>\n\nvoid set_texture();\n\ntypedef struct {unsigned char r, g, b;} rgb_t;\nrgb_t **tex = 0;\nint gwin;\nGLuint texture;\nint width, height;\nint tex_w, tex_h;\ndouble scale = 1./256;\ndouble cx = -.6, cy = 0;\nint color_rotate = 0;\nint saturation = 1;\nint invert = 0;\nint max_iter = 256;\n\nvoid render()\n{\n\tdouble\tx = (double)width /tex_w,\n\t\ty = (double)height/tex_h;\n\n\tglClear(GL_COLOR_BUFFER_BIT);\n\tglTexEnvi(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_REPLACE);\n\n\tglBindTexture(GL_TEXTURE_2D, texture);\n\n\tglBegin(GL_QUADS);\n\n\tglTexCoord2f(0, 0); glVertex2i(0, 0);\n\tglTexCoord2f(x, 0); glVertex2i(width, 0);\n\tglTexCoord2f(x, y); glVertex2i(width, height);\n\tglTexCoord2f(0, y); glVertex2i(0, height);\n\n\tglEnd();\n\n\tglFlush();\n\tglFinish();\n}\n\nint dump = 1;\nvoid screen_dump()\n{\n\tchar fn[100];\n\tint i;\n\tsprintf(fn, \"screen%03d.ppm\", dump++);\n\tFILE *fp = fopen(fn, \"w\");\n\tfprintf(fp, \"P6\\n%d %d\\n255\\n\", width, height);\n\tfor (i = height - 1; i >= 0; i--)\n\t\tfwrite(tex[i], 1, width * 3, fp);\n\tfclose(fp);\n\tprintf(\"%s written\\n\", fn);\n}\n\nvoid keypress(unsigned char key, int x, int y)\n{\n\tswitch(key) {\n\tcase 'q':\tglFinish();\n\t\t\tglutDestroyWindow(gwin);\n\t\t\treturn;\n\tcase 27:\tscale = 1./256; cx = -.6; cy = 0; break;\n\n\tcase 'r':\tcolor_rotate = (color_rotate + 1) % 6;\n\t\t\tbreak;\n\n\tcase '>': case '.':\n\t\t\tmax_iter += 128;\n\t\t\tif (max_iter > 1 << 15) max_iter = 1 << 15;\n\t\t\tprintf(\"max iter: %d\\n\", max_iter);\n\t\t\tbreak;\n\n\tcase '<': case ',':\n\t\t\tmax_iter -= 128;\n\t\t\tif (max_iter < 128) max_iter = 128;\n\t\t\tprintf(\"max iter: %d\\n\", max_iter);\n\t\t\tbreak;\n\n\tcase 'c':\tsaturation = 1 - saturation;\n\t\t\tbreak;\n\n\tcase 's':\tscreen_dump(); return;\n\tcase 'z':\tmax_iter = 4096; break;\n\tcase 'x':\tmax_iter = 128; break;\n\tcase ' ':\tinvert = !invert;\n\t}\n\tset_texture();\n}\n\nvoid hsv_to_rgb(int hue, int min, int max, rgb_t *p)\n{\n\tif (min == max) max = min + 1;\n\tif (invert) hue = max - (hue - min);\n\tif (!saturation) {\n\t\tp->r = p->g = p->b = 255 * (max - hue) / (max - min);\n\t\treturn;\n\t}\n\tdouble h = fmod(color_rotate + 1e-4 + 4.0 * (hue - min) / (max - min), 6);\n#\tdefine VAL 255\n\tdouble c = VAL * saturation;\n\tdouble X = c * (1 - fabs(fmod(h, 2) - 1));\n\n\tp->r = p->g = p->b = 0;\n\n\tswitch((int)h) {\n\tcase 0: p->r = c; p->g = X; return;\n\tcase 1:\tp->r = X; p->g = c; return;\n\tcase 2: p->g = c; p->b = X; return;\n\tcase 3: p->g = X; p->b = c; return;\n\tcase 4: p->r = X; p->b = c; return;\n\tdefault:p->r = c; p->b = X;\n\t}\n}\n\nvoid calc_mandel()\n{\n\tint i, j, iter, min, max;\n\trgb_t *px;\n\tdouble x, y, zx, zy, zx2, zy2;\n\tmin = max_iter; max = 0;\n\tfor (i = 0; i < height; i++) {\n\t\tpx = tex[i];\n\t\ty = (i - height/2) * scale + cy;\n\t\tfor (j = 0; j < width; j++, px++) {\n\t\t\tx = (j - width/2) * scale + cx;\n\t\t\titer = 0;\n\n\t\t\tzx = hypot(x - .25, y);\n\t\t\tif (x < zx - 2 * zx * zx + .25) iter = max_iter;\n\t\t\tif ((x + 1)*(x + 1) + y * y < 1/16) iter = max_iter;\n\n\t\t\tzx = zy = zx2 = zy2 = 0;\n\t\t\tfor (; iter < max_iter && zx2 + zy2 < 4; iter++) {\n\t\t\t\tzy = 2 * zx * zy + y;\n\t\t\t\tzx = zx2 - zy2 + x;\n\t\t\t\tzx2 = zx * zx;\n\t\t\t\tzy2 = zy * zy;\n\t\t\t}\n\t\t\tif (iter < min) min = iter;\n\t\t\tif (iter > max) max = iter;\n\t\t\t*(unsigned short *)px = iter;\n\t\t}\n\t}\n\n\tfor (i = 0; i < height; i++)\n\t\tfor (j = 0, px = tex[i]; j < width; j++, px++)\n\t\t\thsv_to_rgb(*(unsigned short*)px, min, max, px);\n}\n\nvoid alloc_tex()\n{\n\tint i, ow = tex_w, oh = tex_h;\n\n\tfor (tex_w = 1; tex_w < width; tex_w <<= 1);\n\tfor (tex_h = 1; tex_h < height; tex_h <<= 1);\n\n\tif (tex_h != oh || tex_w != ow)\n\t\ttex = realloc(tex, tex_h * tex_w * 3 + tex_h * sizeof(rgb_t*));\n\n\tfor (tex[0] = (rgb_t *)(tex + tex_h), i = 1; i < tex_h; i++)\n\t\ttex[i] = tex[i - 1] + tex_w;\n}\n\nvoid set_texture()\n{\n\talloc_tex();\n\tcalc_mandel();\n\n\tglEnable(GL_TEXTURE_2D);\n\tglBindTexture(GL_TEXTURE_2D, texture);\n\tglTexImage2D(GL_TEXTURE_2D, 0, 3, tex_w, tex_h,\n\t\t0, GL_RGB, GL_UNSIGNED_BYTE, tex[0]);\n\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\trender();\n}\n\nvoid mouseclick(int button, int state, int x, int y)\n{\n\tif (state != GLUT_UP) return;\n\n\tcx += (x - width / 2) * scale;\n\tcy -= (y - height/ 2) * scale;\n\n\tswitch(button) {\n\tcase GLUT_LEFT_BUTTON: /* zoom in */\n\t\tif (scale > fabs(x) * 1e-16 && scale > fabs(y) * 1e-16)\n\t\t\tscale /= 2;\n\t\tbreak;\n\tcase GLUT_RIGHT_BUTTON: /* zoom out */\n\t\tscale *= 2;\n\t\tbreak;\n\t/* any other button recenters */\n\t}\n\tset_texture();\n}\n\n\nvoid resize(int w, int h)\n{\n\tprintf(\"resize %d %d\\n\", w, h);\n\twidth = w;\n\theight = h;\n\n\tglViewport(0, 0, w, h);\n\tglOrtho(0, w, 0, h, -1, 1);\n\n\tset_texture();\n}\n\nvoid init_gfx(int *c, char **v)\n{\n\tglutInit(c, v);\n\tglutInitDisplayMode(GLUT_RGB);\n\tglutInitWindowSize(640, 480);\n\t\n\tgwin = glutCreateWindow(\"Mandelbrot\");\n\tglutDisplayFunc(render);\n\n\tglutKeyboardFunc(keypress);\n\tglutMouseFunc(mouseclick);\n\tglutReshapeFunc(resize);\n\tglGenTextures(1, &texture);\n\tset_texture();\n}\n\nint main(int c, char **v)\n{\n\tinit_gfx(&c, v);\n\tprintf(\"keys:\\n\\tr: color rotation\\n\\tc: monochrome\\n\\ts: screen dump\\n\\t\"\n\t\t\"<, >: decrease/increase max iteration\\n\\tq: quit\\n\\tmouse buttons to zoom\\n\");\n\n\tglutMainLoop();\n\treturn 0;\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <GL/glut.h>\n#include <GL/gl.h>\n#include <GL/glu.h>\n\nvoid set_texture();\n\nunsigned char *tex;\nint gwin;\nGLuint texture;\nint width, height;\nint old_width, old_height;\ndouble scale = 1. / 256;\ndouble cx = -.6, cy = 0;\nint color_rotate = 0;\nint saturation = 1;\nint invert = 0;\nint max_iter = 256;\n\nvoid render()\n{\n glTexEnvi(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_REPLACE);\n\n glBindTexture(GL_TEXTURE_2D, texture);\n\n glBegin(GL_QUADS);\n\n glTexCoord2d(0, 0);\n glVertex2i(0, 0);\n glTexCoord2d(1, 0);\n glVertex2i(width, 0);\n glTexCoord2d(1, 1);\n glVertex2i(width, height);\n glTexCoord2d(0, 1);\n glVertex2i(0, height);\n\n glEnd();\n\n glFlush();\n glFinish();\n}\n\nint dump = 1;\nvoid screen_dump()\n{\n char fn[100];\n sprintf(fn, \"screen%03d.ppm\", dump++);\n FILE *fp = fopen(fn, \"w\");\n fprintf(fp, \"P6\\n%d %d\\n255\\n\", width, height);\n for (int i = height - 1; i >= 0; i -= 1) {\n for (int j = 0; j < width; j += 1) {\n fwrite(&tex[((i * width) + j) * 4], 1, 3, fp);\n }\n }\n fclose(fp);\n printf(\"%s written\\n\", fn);\n}\n\nvoid keypress(unsigned char key,[[maybe_unused]]\n int x,[[maybe_unused]]\n int y)\n{\n switch (key) {\n case 'q':\n glFinish();\n glutDestroyWindow(gwin);\n break;\n\n case 27:\n scale = 1. / 256;\n cx = -.6;\n cy = 0;\n set_texture();\n break;\n\n case 'r':\n color_rotate = (color_rotate + 1) % 6;\n set_texture();\n break;\n\n case '>':\n case '.':\n max_iter += 128;\n if (max_iter > 1 << 15)\n max_iter = 1 << 15;\n printf(\"max iter: %d\\n\", max_iter);\n set_texture();\n break;\n\n case '<':\n case ',':\n max_iter -= 128;\n if (max_iter < 128)\n max_iter = 128;\n printf(\"max iter: %d\\n\", max_iter);\n set_texture();\n break;\n\n case 'c':\n saturation = 1 - saturation;\n set_texture();\n break;\n\n case 's':\n screen_dump();\n break;\n\n case 'z':\n max_iter = 4096;\n set_texture();\n break;\n\n case 'x':\n max_iter = 128;\n set_texture();\n break;\n\n case ' ':\n invert = !invert;\n set_texture();\n break;\n\n default:\n set_texture();\n break;\n }\n}\n\n#define VAL 255\n\nvoid hsv_to_rgba(int hue, int min, int max, unsigned char *px)\n{\n unsigned char r;\n unsigned char g;\n unsigned char b;\n\n if (min == max)\n max = min + 1;\n if (invert)\n hue = max - (hue - min);\n if (!saturation) {\n r = 255 * (max - hue) / (max - min);\n g = r;\n b = r;\n } else {\n double h =\n fmod(color_rotate + 1e-4 + 4.0 * (hue - min) / (max - min), 6);\n double c = VAL * saturation;\n double X = c * (1 - fabs(fmod(h, 2) - 1));\n\n r = 0;\n g = 0;\n b = 0;\n\n switch ((int) h) {\n case 0:\n r = c;\n g = X;\n break;\n case 1:\n r = X;\n g = c;\n break;\n case 2:\n g = c;\n b = X;\n break;\n case 3:\n g = X;\n b = c;\n break;\n case 4:\n r = X;\n b = c;\n break;\n default:\n r = c;\n b = X;\n break;\n }\n }\n\n /* Using an alpha channel neatly solves the problem of aligning\n * rows on 4-byte boundaries (at the expense of memory, of\n * course). */\n px[0] = r;\n px[1] = g;\n px[2] = b;\n px[3] = 255; /* Alpha channel. */\n}\n\nvoid calc_mandel()\n{\n int i, j, iter, min, max;\n double x, y, zx, zy, zx2, zy2;\n unsigned short *hsv = malloc(width * height * sizeof(unsigned short));\n\n min = max_iter;\n max = 0;\n for (i = 0; i < height; i++) {\n y = (i - height / 2) * scale + cy;\n for (j = 0; j < width; j++) {\n x = (j - width / 2) * scale + cx;\n iter = 0;\n\n zx = hypot(x - .25, y);\n if (x < zx - 2 * zx * zx + .25)\n iter = max_iter;\n if ((x + 1) * (x + 1) + y * y < 1 / 16)\n iter = max_iter;\n\n zx = 0;\n zy = 0;\n zx2 = 0;\n zy2 = 0;\n while (iter < max_iter && zx2 + zy2 < 4) {\n zy = 2 * zx * zy + y;\n zx = zx2 - zy2 + x;\n zx2 = zx * zx;\n zy2 = zy * zy;\n iter += 1;\n }\n if (iter < min)\n min = iter;\n if (iter > max)\n max = iter;\n hsv[(i * width) + j] = iter;\n }\n }\n\n for (i = 0; i < height; i += 1) {\n for (j = 0; j < width; j += 1) {\n unsigned char *px = tex + (((i * width) + j) * 4);\n hsv_to_rgba(hsv[(i * width) + j], min, max, px);\n }\n }\n\n free(hsv);\n}\n\nvoid alloc_tex()\n{\n if (tex == NULL || width != old_width || height != old_height) {\n free(tex);\n tex = malloc(height * width * 4 * sizeof(unsigned char));\n memset(tex, 0, height * width * 4 * sizeof(unsigned char));\n old_width = width;\n old_height = height;\n }\n}\n\nvoid set_texture()\n{\n alloc_tex();\n calc_mandel();\n\n glEnable(GL_TEXTURE_2D);\n glBindTexture(GL_TEXTURE_2D, texture);\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, width, height,\n 0, GL_RGBA, GL_UNSIGNED_BYTE, tex);\n\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\n render();\n}\n\nvoid mouseclick(int button, int state, int x, int y)\n{\n if (state != GLUT_UP)\n return;\n\n cx += (x - width / 2) * scale;\n cy -= (y - height / 2) * scale;\n\n switch (button) {\n case GLUT_LEFT_BUTTON: /* zoom in */\n if (scale > fabs((double) x) * 1e-16\n && scale > fabs((double) y) * 1e-16)\n scale /= 2;\n break;\n case GLUT_RIGHT_BUTTON: /* zoom out */\n scale *= 2;\n break;\n /* any other button recenters */\n }\n set_texture();\n}\n\n\nvoid resize(int w, int h)\n{\n printf(\"resize %d %d\\n\", w, h);\n\n width = w;\n height = h;\n\n glViewport(0, 0, w, h);\n glOrtho(0, w, 0, h, -1, 1);\n\n set_texture();\n}\n\nvoid init_gfx(int *c, char **v)\n{\n glutInit(c, v);\n glutInitDisplayMode(GLUT_RGBA);\n glutInitWindowSize(640, 480);\n\n gwin = glutCreateWindow(\"Mandelbrot\");\n glutDisplayFunc(render);\n\n glutKeyboardFunc(keypress);\n glutMouseFunc(mouseclick);\n glutReshapeFunc(resize);\n glGenTextures(1, &texture);\n set_texture();\n}\n\nint main(int c, char **v)\n{\n tex = NULL;\n\n init_gfx(&c, v);\n printf\n (\"keys:\\n\\tr: color rotation\\n\\tc: monochrome\\n\\ts: screen dump\\n\\t\"\n \"<, >: decrease/increase max iteration\\n\\tq: quit\\n\\tmouse buttons to zoom\\n\");\n\n glutMainLoop();\n return 0;\n}\n\n// local variables:\n// mode: C\n// c-file-style: \"k&r\"\n// c-basic-offset: 4\n// end:\n","language":"C"},{"code":"main(k){float i,j,r,x,y=-16;while(puts(\"\"),y++<15)for(x\n=0;x++<84;putchar(\" .:-;!/>)|&IH%*#\"[k&15]))for(i=k=r=0;\nj=r*r-i*i-2+x/25,i=2*r*i+y/10,j*j+i*i<11&&k++<111;r=j);}\n","language":"C"},{"code":"/**\n ascii Mandelbrot using 16 bits of fixed point integer maths with a selectable fractional precision in bits.\n\n This is still only 16 bits mathc and allocating more than 6 bits of fractional precision leads to an overflow that adds noise to the plot..\n\n This code frequently casts to short to ensure we're not accidentally benefitting from GCC promotion from short 16 bits to int.\n\n gcc fixedPoint.c -lm\n\n */\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <stdint.h>\n#include <string.h>\n\nshort s(short i);\nshort toPrec(double f, int bitsPrecision);\n\nint main(int argc, char* argv[])\n{\n // chosen to match https://www.youtube.com/watch?v=DC5wi6iv9io\n int width = 32; // basic width of a zx81\n int height = 22; // basic width of a zx81\n int zoom=3; // bigger with finer detail ie a smaller step size - leave at 1 for 32x22\n\n // params\n short bitsPrecision = 6;\n printf(\"PRECISION=%d\\n\", bitsPrecision);\n\n short X1 = toPrec(3.5,bitsPrecision) / zoom;\n short X2 = toPrec(2.25,bitsPrecision) ;\n short Y1 = toPrec(3,bitsPrecision)/zoom ; // horiz pos\n short Y2 = toPrec(1.5,bitsPrecision) ; // vert pos\n short LIMIT = toPrec(4,bitsPrecision);\n\n\n // fractal\n //char * chr = \".:-=X$#@.\";\n char * chr = \"abcdefghijklmnopqr \";\n //char * chr = \".,'~=+:;[/<&?oxOX#.\";\n short maxIters = strlen(chr);\n\n short py=0;\n while (py < height*zoom) {\n short px=0;\n while (px < width*zoom) {\n\n short x0 = s(s(px*X1) / width) - X2;\n short y0 = s(s(py*Y1) / height) - Y2;\n\n short x=0;\n short y=0;\n\n short i=0;\n\n short xSqr;\n short ySqr;\n while (i < maxIters) {\n xSqr = s(x * x) >> bitsPrecision;\n ySqr = s(y * y) >> bitsPrecision;\n\n // Breakout if sum is > the limit OR breakout also if sum is negative which indicates overflow of the addition has occurred\n // The overflow check is only needed for precisions of over 6 bits because for 7 and above the sums come out overflowed and negative therefore we always run to maxIters and we see nothing.\n // By including the overflow break out we can see the fractal again though with noise.\n if ((xSqr + ySqr) >= LIMIT || (xSqr+ySqr) < 0) {\n break;\n }\n\n short xt = xSqr - ySqr + x0;\n y = s(s(s(x * y) >> bitsPrecision) * 2) + y0;\n x=xt;\n\n i = i + 1;\n }\n i = i - 1;\n\n printf(\"%c\", chr[i]);\n\n px = px + 1;\n }\n\n printf(\"\\n\");\n py = py + 1;\n }\n}\n\n// convert decimal value to a fixed point value in the given precision\nshort toPrec(double f, int bitsPrecision) {\n short whole = ((short)floor(f) << (bitsPrecision));\n short part = (f-floor(f))*(pow(2,bitsPrecision));\n short ret = whole + part;\n return ret;\n}\n\n// convenient casting\nshort s(short i) {\n return i;\n}\n","language":"C"},{"code":"#include <cstdlib>\n#include <complex>\n\n// get dimensions for arrays\ntemplate<typename ElementType, std::size_t dim1, std::size_t dim2>\n std::size_t get_first_dimension(ElementType (&a)[dim1][dim2])\n{\n return dim1;\n}\n\ntemplate<typename ElementType, std::size_t dim1, std::size_t dim2>\n std::size_t get_second_dimension(ElementType (&a)[dim1][dim2])\n{\n return dim2;\n}\n\n\ntemplate<typename ColorType, typename ImageType>\n void draw_Mandelbrot(ImageType& image, //where to draw the image\n ColorType set_color, ColorType non_set_color, //which colors to use for set/non-set points\n double cxmin, double cxmax, double cymin, double cymax,//the rect to draw in the complex plane\n unsigned int max_iterations) //the maximum number of iterations\n{\n std::size_t const ixsize = get_first_dimension(image);\n std::size_t const iysize = get_first_dimension(image);\n for (std::size_t ix = 0; ix < ixsize; ++ix)\n for (std::size_t iy = 0; iy < iysize; ++iy)\n {\n std::complex<double> c(cxmin + ix/(ixsize-1.0)*(cxmax-cxmin), cymin + iy/(iysize-1.0)*(cymax-cymin));\n std::complex<double> z = 0;\n unsigned int iterations;\n\n for (iterations = 0; iterations < max_iterations && std::abs(z) < 2.0; ++iterations)\n z = z*z + c;\n\n image[ix][iy] = (iterations == max_iterations) ? set_color : non_set_color;\n\n }\n}\n","language":"C++"},{"code":"#include <stdio.h>\n\nint f(float X, float Y, float x, float y, int n){\nreturn (x*x+y*y<4 && n<100)?1+f(X, Y, x*x-y*y+X, 2*x*y+Y, n+1):0;\n}\n\nmain(){\nfor(float j=1; j>=-1; j-=.015)\nfor(float i=-2, x; i<=.5; i+=.015, x=f(i, j, 0, 0, 0))\nprintf(\"%c%s\", x<10?' ':x<20?'.':x<50?':':x<80?'*':'#', i>-2?\" \":\"\\n\");\n}\n","language":"C++"},{"code":"using System;\nusing System.Drawing;\nusing System.Drawing.Imaging;\nusing System.Threading;\nusing System.Windows.Forms;\n\n/// <summary>\n/// Generates bitmap of Mandelbrot Set and display it on the form.\n/// </summary>\npublic class MandelbrotSetForm : Form\n{\n const double MaxValueExtent = 2.0;\n Thread thread;\n\n static double CalcMandelbrotSetColor(ComplexNumber c)\n {\n // from http://en.wikipedia.org/w/index.php?title=Mandelbrot_set\n const int MaxIterations = 1000;\n const double MaxNorm = MaxValueExtent * MaxValueExtent;\n\n int iteration = 0;\n ComplexNumber z = new ComplexNumber();\n do\n {\n z = z * z + c;\n iteration++;\n } while (z.Norm() < MaxNorm && iteration < MaxIterations);\n if (iteration < MaxIterations)\n return (double)iteration / MaxIterations;\n else\n return 0; // black\n }\n\n static void GenerateBitmap(Bitmap bitmap)\n {\n double scale = 2 * MaxValueExtent / Math.Min(bitmap.Width, bitmap.Height);\n for (int i = 0; i < bitmap.Height; i++)\n {\n double y = (bitmap.Height / 2 - i) * scale;\n for (int j = 0; j < bitmap.Width; j++)\n {\n double x = (j - bitmap.Width / 2) * scale;\n double color = CalcMandelbrotSetColor(new ComplexNumber(x, y));\n bitmap.SetPixel(j, i, GetColor(color));\n }\n }\n }\n\n static Color GetColor(double value)\n {\n const double MaxColor = 256;\n const double ContrastValue = 0.2;\n return Color.FromArgb(0, 0,\n (int)(MaxColor * Math.Pow(value, ContrastValue)));\n }\n\n public MandelbrotSetForm()\n {\n // form creation\n this.Text = \"Mandelbrot Set Drawing\";\n this.BackColor = System.Drawing.Color.Black;\n this.BackgroundImageLayout = System.Windows.Forms.ImageLayout.Stretch;\n this.MaximizeBox = false;\n this.StartPosition = FormStartPosition.CenterScreen;\n this.FormBorderStyle = FormBorderStyle.FixedDialog;\n this.ClientSize = new Size(640, 640);\n this.Load += new System.EventHandler(this.MainForm_Load);\n }\n\n void MainForm_Load(object sender, EventArgs e)\n {\n thread = new Thread(thread_Proc);\n thread.IsBackground = true;\n thread.Start(this.ClientSize);\n }\n\n void thread_Proc(object args)\n {\n // start from small image to provide instant display for user\n Size size = (Size)args;\n int width = 16;\n while (width * 2 < size.Width)\n {\n int height = width * size.Height / size.Width;\n Bitmap bitmap = new Bitmap(width, height, PixelFormat.Format24bppRgb);\n GenerateBitmap(bitmap);\n this.BeginInvoke(new SetNewBitmapDelegate(SetNewBitmap), bitmap);\n width *= 2;\n Thread.Sleep(200);\n }\n // then generate final image\n Bitmap finalBitmap = new Bitmap(size.Width, size.Height, PixelFormat.Format24bppRgb);\n GenerateBitmap(finalBitmap);\n this.BeginInvoke(new SetNewBitmapDelegate(SetNewBitmap), finalBitmap);\n }\n\n void SetNewBitmap(Bitmap image)\n {\n if (this.BackgroundImage != null)\n this.BackgroundImage.Dispose();\n this.BackgroundImage = image;\n }\n\n delegate void SetNewBitmapDelegate(Bitmap image);\n\n static void Main()\n {\n Application.Run(new MandelbrotSetForm());\n }\n}\n\nstruct ComplexNumber\n{\n public double Re;\n public double Im;\n\n public ComplexNumber(double re, double im)\n {\n this.Re = re;\n this.Im = im;\n }\n\n public static ComplexNumber operator +(ComplexNumber x, ComplexNumber y)\n {\n return new ComplexNumber(x.Re + y.Re, x.Im + y.Im);\n }\n\n public static ComplexNumber operator *(ComplexNumber x, ComplexNumber y)\n {\n return new ComplexNumber(x.Re * y.Re - x.Im * y.Im,\n x.Re * y.Im + x.Im * y.Re);\n }\n\n public double Norm()\n {\n return Re * Re + Im * Im;\n }\n}\n","language":"C-sharp"},{"code":"module mandelbrot;\n\nextern fn int atoi(char *s);\nextern fn int printf(char *s, ...);\nextern fn void putchar(int c);\n\nfn void main(int argc, char **argv)\n{\n int w = atoi(argv[1]);\n int h = w;\n\n const LIMIT = 2.0;\n const SQUARE_LIMIT = LIMIT * LIMIT;\n\n printf(\"P4\\n%d %d\\n\", w, h);\n\n int iter = 50;\n int bit_num = 0;\n char byte_acc = 0;\n for (double y = 0; y < h; y++)\n {\n for (double x = 0; x < w; x++)\n {\n double zr;\n double zi;\n double ti;\n double tr;\n double cr = (2.0 * x / w - 1.5);\n double ci = (2.0 * y / h - 1.0);\n for (int i = 0; i < iter && (tr + ti <= SQUARE_LIMIT); i++)\n {\n zi = 2.0 * zr * zi + ci;\n zr = tr - ti + cr;\n tr = zr * zr;\n ti = zi * zi;\n }\n\n byte_acc <<= 1;\n if (tr + ti <= SQUARE_LIMIT) byte_acc |= 0x01;\n\n ++bit_num;\n\n if (bit_num == 8)\n {\n putchar(byte_acc);\n byte_acc = 0;\n bit_num = 0;\n }\n else if (x == w - 1)\n {\n byte_acc <<= (8 - w % 8);\n putchar(byte_acc);\n byte_acc = 0;\n bit_num = 0;\n }\n }\n }\n}\n","language":"C3"},{"code":"(defn complex-add\n [[a0 b0] [a1 b1]]\n [(+ a0 a1) (+ b0 b1)])\n\n(defn complex-square\n [[a b]]\n [(- (* a a) (* b b)) (* 2 a b)])\n\n(defn complex-abs\n [[a b]]\n (Math/sqrt (+ (* a a) (* b b))))\n\n(defn f\n [z c]\n (complex-add z (complex-square c)))\n\n(defn mandelbrot?\n [z]\n (> 2 (complex-abs (nth (iterate (partial f z) [0 0]) 20))))\n\n(doseq [y (range 1 -1 -0.05)]\n (doseq [x (range -2 0.5 0.0315)]\n (print (if (mandelbrot? [(double x) (double y)]) \"*\" \" \")))\n (println \"\"))\n","language":"Clojure"},{"code":"IDENTIFICATION DIVISION.\nPROGRAM-ID. MANDELBROT-SET-PROGRAM.\nDATA DIVISION.\nWORKING-STORAGE SECTION.\n01 COMPLEX-ARITHMETIC.\n 05 X PIC S9V9(9).\n 05 Y PIC S9V9(9).\n 05 X-A PIC S9V9(6).\n 05 X-B PIC S9V9(6).\n 05 Y-A PIC S9V9(6).\n 05 X-A-SQUARED PIC S9V9(6).\n 05 Y-A-SQUARED PIC S9V9(6).\n 05 SUM-OF-SQUARES PIC S9V9(6).\n 05 ROOT PIC S9V9(6).\n01 LOOP-COUNTERS.\n 05 I PIC 99.\n 05 J PIC 99.\n 05 K PIC 999.\n77 PLOT-CHARACTER PIC X.\nPROCEDURE DIVISION.\nCONTROL-PARAGRAPH.\n PERFORM OUTER-LOOP-PARAGRAPH\n VARYING I FROM 1 BY 1 UNTIL I IS GREATER THAN 24.\n STOP RUN.\nOUTER-LOOP-PARAGRAPH.\n PERFORM INNER-LOOP-PARAGRAPH\n VARYING J FROM 1 BY 1 UNTIL J IS GREATER THAN 64.\n DISPLAY ''.\nINNER-LOOP-PARAGRAPH.\n MOVE SPACE TO PLOT-CHARACTER.\n MOVE ZERO TO X-A.\n MOVE ZERO TO Y-A.\n MULTIPLY J BY 0.0390625 GIVING X.\n SUBTRACT 1.5 FROM X.\n MULTIPLY I BY 0.083333333 GIVING Y.\n SUBTRACT 1 FROM Y.\n PERFORM ITERATION-PARAGRAPH VARYING K FROM 1 BY 1\n UNTIL K IS GREATER THAN 100 OR PLOT-CHARACTER IS EQUAL TO '#'.\n DISPLAY PLOT-CHARACTER WITH NO ADVANCING.\nITERATION-PARAGRAPH.\n MULTIPLY X-A BY X-A GIVING X-A-SQUARED.\n MULTIPLY Y-A BY Y-A GIVING Y-A-SQUARED.\n SUBTRACT Y-A-SQUARED FROM X-A-SQUARED GIVING X-B.\n ADD X TO X-B.\n MULTIPLY X-A BY Y-A GIVING Y-A.\n MULTIPLY Y-A BY 2 GIVING Y-A.\n SUBTRACT Y FROM Y-A.\n MOVE X-B TO X-A.\n ADD X-A-SQUARED TO Y-A-SQUARED GIVING SUM-OF-SQUARES.\n MOVE FUNCTION SQRT (SUM-OF-SQUARES) TO ROOT.\n IF ROOT IS GREATER THAN 2 THEN MOVE '#' TO PLOT-CHARACTER.\n","language":"COBOL"},{"code":"(defpackage #:mandelbrot\n (:use #:cl))\n\n(in-package #:mandelbrot)\n\n(deftype pixel () '(unsigned-byte 8))\n(deftype image () '(array pixel))\n\n(defun write-pgm (image filespec)\n (declare (image image))\n (with-open-file (s filespec :direction :output :element-type 'pixel :if-exists :supersede)\n (let* ((width (array-dimension image 1))\n (height (array-dimension image 0))\n (header (format nil \"P5~A~D ~D~A255~A\" #\\Newline width height #\\Newline #\\Newline)))\n (loop for c across header\n do (write-byte (char-code c) s))\n (dotimes (row height)\n (dotimes (col width)\n (write-byte (aref image row col) s))))))\n\n(defparameter *x-max* 800)\n(defparameter *y-max* 800)\n(defparameter *cx-min* -2.5)\n(defparameter *cx-max* 1.5)\n(defparameter *cy-min* -2.0)\n(defparameter *cy-max* 2.0)\n(defparameter *escape-radius* 2)\n(defparameter *iteration-max* 40)\n\n(defun mandelbrot (filespec)\n (let ((pixel-width (/ (- *cx-max* *cx-min*) *x-max*))\n (pixel-height (/ (- *cy-max* *cy-min*) *y-max*))\n (image (make-array (list *y-max* *x-max*) :element-type 'pixel :initial-element 0)))\n (loop for y from 0 below *y-max*\n for cy from *cy-min* by pixel-height\n do (loop for x from 0 below *x-max*\n for cx from *cx-min* by pixel-width\n for iteration = (loop with c = (complex cx cy)\n for iteration from 0 below *iteration-max*\n for z = c then (+ (* z z) c)\n while (< (abs z) *escape-radius*)\n finally (return iteration))\n for pixel = (round (* 255 (/ (- *iteration-max* iteration) *iteration-max*)))\n do (setf (aref image y x) pixel)))\n (write-pgm image filespec)))\n","language":"Common-Lisp"},{"code":"include \"cowgol.coh\";\n\nconst xmin := -8601;\nconst xmax := 2867;\nconst ymin := -4915;\nconst ymax := 4915;\nconst maxiter := 32;\n\nconst dx := (xmax-xmin)/79;\nconst dy := (ymax-ymin)/24;\n\nvar cy: int16 := ymin;\nwhile cy <= ymax loop\n var cx: int16 := xmin;\n while cx <= xmax loop\n var x: int32 := 0;\n var y: int32 := 0;\n var x2: int32 := 0;\n var y2: int32 := 0;\n var iter: uint8 := 0;\n\n while iter < maxiter and x2 + y2 <= 16384 loop\n y := ((x*y)>>11)+cy as int32;\n x := x2-y2+cx as int32;\n x2 := (x*x)>>12;\n y2 := (y*y)>>12;\n iter := iter + 1;\n end loop;\n\n print_char(' ' + iter);\n cx := cx + dx;\n end loop;\n print_nl();\n cy := cy + dy;\nend loop;\n","language":"Cowgol"},{"code":"define max = 15, w = 640, h = 480\ndefine py = 0, px = 0, sx = 0, sy = 0\ndefine xx = 0, xy = 0\n\nbgcolor 0, 0, 0\ncls graphics\nfill on\n\ndo\n\n\tlet px = 0\n\n\tdo\n\n\t\tlet sy = (py - h / 2) / 150\n\t\tlet sx = (px - w / 2) / 150\n\n\t\tlet i = 0\n\t\tlet x = 0\n\t\tlet y = 0\n\n\t\tlet xy = x * x + y * y\n\n\t\tdo\n\n\t\t\tlet xx = x * x - y * y + sx + .1\n\t\t\tlet y = 2 * x * y + sy\n\t\t\tlet x = xx\n\n\t\t\tlet i = i + 1\n\n\t\tloop i < max and xy < 4\n\n\t\twait\n\n\t\tfgcolor 220 + i * x, 220 + i * y, 230 + i * xy\n\t\trect px, py, 4, 4\n\n\t\tlet px = px + 4\n\n\tloop px < w\n\n\tlet py = py + 4\n\nloop py < h\n","language":"Craft-Basic"},{"code":"void main() {\n import std.stdio, std.complex;\n\n for (real y = -1.2; y < 1.2; y += 0.05) {\n for (real x = -2.05; x < 0.55; x += 0.03) {\n auto z = 0.complex;\n foreach (_; 0 .. 100)\n z = z ^^ 2 + complex(x, y);\n write(z.abs < 2 ? '#' : '.');\n }\n writeln;\n }\n}\n","language":"D"},{"code":"void main() {\n import std.stdio, std.complex, std.range, std.algorithm;\n\n foreach (immutable y; iota(-1.2, 1.2, 0.05))\n iota(-2.05, 0.55, 0.03).map!(x => 0.complex\n .recurrence!((a, n) => a[n - 1] ^^ 2 + complex(x, y))\n .drop(100).front.abs < 2 ? '#' : '.').writeln;\n}\n","language":"D"},{"code":"import qd;\n\ndouble lensqr(cdouble c) { return c.re * c.re + c.im * c.im; }\n\nconst Limit = 150;\n\nvoid main() {\n screen(640, 480);\n for (int y = 0; y < screen.h; ++y) {\n flip; events;\n for (int x = 0; x < screen.w; ++x) {\n auto\n c_x = x * 1.0 / screen.w - 0.5,\n c_y = y * 1.0 / screen.h - 0.5,\n c = c_y * 2.0i + c_x * 3.0 - 1.0,\n z = 0.0i + 0.0,\n i = 0;\n for (; i < Limit; ++i) {\n z = z * z + c;\n if (lensqr(z) > 4) break;\n }\n auto value = cast(ubyte) (i * 255.0 / Limit);\n pset(x, y, rgb(value, value, value));\n }\n }\n while (true) { flip; events; }\n}\n","language":"D"},{"code":"class Complex {\n double _r,_i;\n\n Complex(this._r,this._i);\n double get r => _r;\n double get i => _i;\n String toString() => \"($r,$i)\";\n\n Complex operator +(Complex other) => new Complex(r+other.r,i+other.i);\n Complex operator *(Complex other) =>\n new Complex(r*other.r-i*other.i,r*other.i+other.r*i);\n double abs() => r*r+i*i;\n}\n\nvoid main() {\n double start_x=-1.5;\n double start_y=-1.0;\n double step_x=0.03;\n double step_y=0.1;\n\n for(int y=0;y<20;y++) {\n String line=\"\";\n for(int x=0;x<70;x++) {\n Complex c=new Complex(start_x+step_x*x,start_y+step_y*y);\n Complex z=new Complex(0.0, 0.0);\n for(int i=0;i<100;i++) {\n z=z*(z)+c;\n if(z.abs()>2) {\n break;\n }\n }\n line+=z.abs()>2 ? \" \" : \"*\";\n }\n print(line);\n }\n}\n","language":"Dart"},{"code":" _2.1 sx # xmin = -2.1\n 0.7 sX # xmax = 0.7\n\n _1.2 sy # ymin = -1.2\n 1.2 sY # ymax = 1.2\n\n 32 sM # maxiter = 32\n\n 80 sW # image width\n 25 sH # image height\n\n 8 k # precision\n\n[ q ] sq # quitter helper macro\n\n# for h from 0 to H-1\n0 sh\n[\n lh lH =q # quit if H reached\n\n # for w from 0 to W-1\n 0 sw\n [\n lw lW =q # quit if W reached\n\n # (w,h) -> (R,I)\n # | |\n # | ymin + h*(ymax-ymin)/(height-1)\n # xmin + w*(xmax-xmin)/(width-1)\n\n lX lx - lW 1 - / lw * lx + sR\n lY ly - lH 1 - / lh * ly + sI\n\n # iterate for (R,I)\n\n 0 sr # r:=0\n 0 si # i:=0\n 0 sa # a:=0 (r squared)\n 0 sb # b:=0 (i squared)\n 0 sm # m:=0\n\n # do while m!=M and a+b=<4\n [\n lm lM =q # exit if m==M\n la lb + 4<q # exit if >4\n\n 2 lr * li * lI + si # i:=2*r*i+I\n la lb - lR + sr # r:=a-b+R\n lm 1 + sm # m+=1\n lr 2 ^ sa # a:=r*r\n li 2 ^ sb # b:=i*i\n\n l0 x # loop\n ] s0\n l0 x\n\n lm 32 + P # print \"pixel\"\n\n lw 1 + sw # w+=1\n l1 x # loop\n ] s1\n l1 x\n\n A P # linefeed\n\n lh 1 + sh # h+=1\n l2 x # loop\n] s2\nl2 x\n","language":"Dc"},{"code":"_2.1 sx 0.7 sX _1.2 sy 1.2 sY\n32 sM\n640 sW 480 sH\n8 k\n[P5] P A P\nlW n 32 P lH n A P\nlM 1 - n A P\n[ q ] sq\n0 sh\n[\n lh lH =q\n 0 sw\n [\n lw lW =q\n lX lx - lW 1 - / lw * lx + sR\n lY ly - lH 1 - / lh * ly + sI\n 0 sr 0 si 0 sa 0 sb 0 sm\n [\n lm lM =q\n la lb + 4<q\n 2 lr * li * lI + si\n la lb - lR + sr\n lm 1 + sm\n lr 2 ^ sa\n li 2 ^ sb\n l0 x\n ] s0\n l0 x\n lm 1 - P\n lw 1 + sw\n l1 x\n ] s1\n l1 x\n lh 1 + sh\n l2 x\n] s2\nl2 x\n","language":"Dc"},{"code":"const maxIter = 256;\n\nvar x, y, i : Integer;\nfor y:=-39 to 39 do begin\n for x:=-39 to 39 do begin\n var c := Complex(y/40-0.5, x/40);\n var z := Complex(0, 0);\n for i:=1 to maxIter do begin\n z := z*z + c;\n if Abs(z)>=4 then Break;\n end;\n if i>=maxIter then\n Print('#')\n else Print('.');\n end;\n PrintLn('');\nend;\n","language":"DWScript"},{"code":"# Mandelbrot\n#\nres = 4\nmaxiter = 200\n#\n# better but slower:\n# res = 8\n# maxiter = 300\n#\n#\nmid = res * 50\ncenter_x = 3 * mid / 2\ncenter_y = mid\nscale = mid\n#\nbackground 000\ntextsize 2\n#\nfastfunc iter cx cy maxiter .\n while xx + yy < 4 and it < maxiter\n y = 2 * x * y + cy\n x = xx - yy + cx\n xx = x * x\n yy = y * y\n it += 1\n .\n return it\n.\nproc draw . .\n clear\n for scr_y = 0 to 2 * mid - 1\n cy = (scr_y - center_y) / scale\n for scr_x = 0 to 2 * mid - 1\n cx = (scr_x - center_x) / scale\n it = iter cx cy maxiter\n if it < maxiter\n color3 it / 20 it / 100 it / 150\n move scr_x / res scr_y / res\n rect 1 / res 1 / res\n .\n .\n .\n color 990\n move 1 1\n text \"Short press to zoom in, long to zoom out\"\n.\non mouse_down\n time0 = systime\n.\non mouse_up\n center_x += mid - mouse_x * res\n center_y += mid - mouse_y * res\n if systime - time0 < 0.3\n center_x -= mid - center_x\n center_y -= mid - center_y\n scale *= 2\n else\n center_x += (mid - center_x) * 3 / 4\n center_y += (mid - center_y) * 3 / 4\n scale /= 4\n .\n draw\n.\ndraw\n","language":"EasyLang"},{"code":"void drawMandelbrot(Bitmap bmp, float range, Complex center, ColorAlpha * palette, int nPalEntries, int nIterations, float scale)\n{\n int x, y;\n int w = bmp.width, h = bmp.height;\n ColorAlpha * picture = (ColorAlpha *)bmp.picture;\n double logOf2 = log(2);\n Complex d\n {\n w > h ? range : range * w / h,\n h > w ? range : range * h / w\n };\n Complex C0 { center.a - d.a/2, center.b - d.b/2 };\n Complex C = C0;\n double delta = d.a / w;\n\n for(y = 0; y < h; y++, C.a = C0.a, C.b += delta)\n {\n for(x = 0; x < w; x++, picture++, C.a += delta)\n {\n Complex Z { };\n int i;\n double ii = 0;\n bool out = false;\n double Za2 = Z.a * Z.a, Zb2 = Z.b * Z.b;\n for(i = 0; i < nIterations; i++)\n {\n double z2;\n Z = { Za2 - Zb2, 2*Z.a*Z.b };\n Z.a += C.a;\n Z.b += C.b;\n Za2 = Z.a * Z.a, Zb2 = Z.b * Z.b;\n z2 = Za2 + Zb2;\n\n if(z2 >= 2*2)\n {\n ii = (double)(i + 1 - log(0.5 * log(z2)) / logOf2);\n out = true;\n break;\n }\n }\n if(out)\n {\n float si = (float)(ii * scale);\n int i0 = ((int)si) % nPalEntries;\n *picture = palette[i0];\n }\n else\n *picture = black;\n }\n }\n}\n","language":"EC"},{"code":"class Mandelbrot : Window\n{\n caption = $\"Mandelbrot\";\n borderStyle = sizable;\n hasMaximize = true;\n hasMinimize = true;\n hasClose = true;\n clientSize = { 600, 600 };\n\n Point mouseStart, mouseEnd;\n bool dragging;\n bool needUpdate;\n\n float scale;\n int nIterations; nIterations = 256;\n ColorAlpha * palette;\n int nPalEntries;\n Complex center { -0.75, 0 };\n\n float range; range = 4;\n Bitmap bmp { };\n\n Mandelbrot()\n {\n static ColorKey keys[] =\n {\n { navy, 0.0f },\n { Color { 146, 213, 237 }, 0.198606268f },\n { white, 0.3f },\n { Color { 255, 255, 124 }, 0.444250882f },\n { Color { 255, 100, 0 }, 0.634146333f },\n { navy, 1 }\n };\n\n nPalEntries = 30000;\n palette = new ColorAlpha[nPalEntries];\n scale = nPalEntries / 175.0f;\n PaletteGradient(palette, nPalEntries, keys, sizeof(keys)/sizeof(keys[0]), 1.0);\n needUpdate = true;\n }\n\n ~Mandelbrot() { delete palette; }\n\n void OnRedraw(Surface surface)\n {\n if(needUpdate)\n {\n drawMandelbrot(bmp, range, center, palette, nPalEntries, nIterations, scale);\n needUpdate = false;\n }\n surface.Blit(bmp, 0,0, 0,0, bmp.width, bmp.height);\n\n if(dragging)\n {\n surface.foreground = lime;\n surface.Rectangle(mouseStart.x, mouseStart.y, mouseEnd.x, mouseEnd.y);\n }\n }\n\n bool OnLeftButtonDown(int x, int y, Modifiers mods)\n {\n mouseEnd = mouseStart = { x, y };\n Capture();\n dragging = true;\n Update(null);\n return true;\n }\n\n bool OnLeftButtonUp(int x, int y, Modifiers mods)\n {\n if(dragging)\n {\n int dx = Abs(mouseEnd.x - mouseStart.x), dy = Abs(mouseEnd.y - mouseStart.y);\n if(dx > 4 && dy > 4)\n {\n int w = clientSize.w, h = clientSize.h;\n float rangeX = w > h ? range : range * w / h;\n float rangeY = h > w ? range : range * h / w;\n\n center.a += ((mouseStart.x + mouseEnd.x) - w) / 2.0f * rangeX / w;\n center.b += ((mouseStart.y + mouseEnd.y) - h) / 2.0f * rangeY / h;\n\n range = dy > dx ? dy * range / h : dx * range / w;\n\n needUpdate = true;\n Update(null);\n }\n ReleaseCapture();\n dragging = false;\n }\n return true;\n }\n\n bool OnMouseMove(int x, int y, Modifiers mods)\n {\n if(dragging)\n {\n mouseEnd = { x, y };\n Update(null);\n }\n return true;\n }\n\n bool OnRightButtonDown(int x, int y, Modifiers mods)\n {\n range = 4;\n nIterations = 256;\n center = { -0.75, 0 };\n needUpdate = true;\n Update(null);\n return true;\n }\n\n void OnResize(int width, int height)\n {\n bmp.Allocate(null, width, height, 0, pixelFormat888, false);\n needUpdate = true;\n Update(null);\n }\n\n bool OnKeyHit(Key key, unichar ch)\n {\n switch(key)\n {\n case space: case keyPadPlus: case plus:\n nIterations += 256;\n needUpdate = true;\n Update(null);\n break;\n }\n return true;\n }\n}\n\nMandelbrot mandelbrotForm {};\n","language":"EC"},{"code":"(lib 'math) ;; fractal function\n(lib 'plot)\n\n;; (fractal z zc n) iterates z := z^2 + c, n times\n;; 100 iterations\n(define (mset z) (if (= Infinity (fractal 0 z 100)) Infinity z))\n\n;; plot function argument inside square (-2 -2), (2,2)\n(plot-z-arg mset -2 -2)\n\n;; result here [http://www.echolalie.org/echolisp/help.html#fractal]\n","language":"EchoLisp"},{"code":"defmodule Mandelbrot do\n def set do\n xsize = 59\n ysize = 21\n minIm = -1.0\n maxIm = 1.0\n minRe = -2.0\n maxRe = 1.0\n stepX = (maxRe - minRe) / xsize\n stepY = (maxIm - minIm) / ysize\n Enum.each(0..ysize, fn y ->\n im = minIm + stepY * y\n Enum.map(0..xsize, fn x ->\n re = minRe + stepX * x\n 62 - loop(0, re, im, re, im, re*re+im*im)\n end) |> IO.puts\n end)\n end\n\n defp loop(n, _, _, _, _, _) when n>=30, do: n\n defp loop(n, _, _, _, _, v) when v>4.0, do: n-1\n defp loop(n, re, im, zr, zi, _) do\n a = zr * zr\n b = zi * zi\n loop(n+1, re, im, a-b+re, 2*zr*zi+im, a+b)\n end\nend\n\nMandelbrot.set\n","language":"Elixir"},{"code":"; === Mandelbrot ============================================\n\n(setq mandel-size (cons 76 34))\n(setq xmin -2)\n(setq xmax .5)\n(setq ymin -1.2)\n(setq ymax 1.2)\n(setq max-iter 20)\n\n(defun mandel-iter-point (x y)\n \"Run the actual iteration for each point.\"\n (let ((xp 0)\n (yp 0)\n (it 0)\n (xt 0))\n (while (and (< (+ (* xp xp) (* yp yp)) 4) (< it max-iter))\n (setq xt (+ (* xp xp) (* -1 yp yp) x))\n (setq yp (+ (* 2 xp yp) y))\n (setq xp xt)\n (setq it (1+ it)))\n it))\n\n(defun mandel-iter (p)\n \"Return string for point based on whether inside/outside the set.\"\n (let ((it (mandel-iter-point (car p) (cdr p))))\n (if (= it max-iter) \"*\" \"-\")))\n\n(defun mandel-pos (x y)\n \"Convert screen coordinates to input coordinates.\"\n (let ((xp (+ xmin (* (- xmax xmin) (/ (float x) (car mandel-size)))))\n (yp (+ ymin (* (- ymax ymin) (/ (float y) (cdr mandel-size))))))\n (cons xp yp)))\n\n(defun mandel ()\n \"Plot the Mandelbrot set.\"\n (dotimes (y (cdr mandel-size))\n (dotimes (x (car mandel-size))\n (if (= x 0)\n (insert(format \"\\n%s\" (mandel-iter (mandel-pos x y))))\n (insert(format \"%s\" (mandel-iter (mandel-pos x y))))))))\n\n(mandel)\n","language":"Emacs-Lisp"},{"code":"; === Graphical Mandelbrot ============================================\n\n(setq mandel-size (cons 320 300))\n(setq xmin -2)\n(setq xmax .5)\n(setq ymin -1.2)\n(setq ymax 1.2)\n(setq max-iter 20)\n\n(defun mandel-iter-point (x y)\n \"Run the actual iteration for each point.\"\n (let ((xp 0)\n (yp 0)\n (it 0)\n (xt 0))\n (while (and (< (+ (* xp xp) (* yp yp)) 4) (< it max-iter))\n (setq xt (+ (* xp xp) (* -1 yp yp) x))\n (setq yp (+ (* 2 xp yp) y))\n (setq xp xt)\n (setq it (1+ it)))\n it))\n\n(defun mandel-iter (p)\n \"Return string for point based on whether inside/outside the set.\"\n (let ((it (mandel-iter-point (car p) (cdr p))))\n (if (= it max-iter) \"*\" (if (cl-oddp it) \"+\" \"-\"))))\n\n(defun mandel-pos (x y)\n \"Convert screen coordinates to input coordinates.\"\n (let ((xp (+ xmin (* (- xmax xmin) (/ (float x) (car mandel-size)))))\n (yp (+ ymin (* (- ymax ymin) (/ (float y) (cdr mandel-size))))))\n (cons xp yp)))\n\n(defun string-to-image (str)\n \"Convert image data string to XPM image.\"\n (create-image (concat (format \"/* XPM */\nstatic char * mandel[] = {\n\\\"%i %i 3 1\\\",\n\\\"+ c #ff0000\\\",\n\\\"- c #0000ff\\\",\n\\\"* c #000000\\\",\" (car mandel-size) (cdr mandel-size))\n str \"};\") 'xpm t))\n\n(defun mandel-pic ()\n \"Plot the Mandelbrot set.\"\n (setq all \"\")\n (dotimes (y (cdr mandel-size))\n (setq line \"\")\n (dotimes (x (car mandel-size))\n (setq line (concat line (mandel-iter (mandel-pos x y)))))\n (setq all (concat all \"\\\"\" line \"\\\",\\n\")))\n (insert-image (string-to-image all)))\n\n(mandel-pic)\n","language":"Emacs-Lisp"},{"code":"-module(mandelbrot).\n\n-export([test/0]).\n\nmagnitude(Z) ->\n R = complex:real(Z),\n I = complex:imaginary(Z),\n R * R + I * I.\n\nmandelbrot(A, MaxI, Z, I) ->\n case (I < MaxI) and (magnitude(Z) < 2.0) of\n true ->\n NZ = complex:add(complex:mult(Z, Z), A),\n mandelbrot(A, MaxI, NZ, I + 1);\n false ->\n case I of\n MaxI ->\n $*;\n _ ->\n $\n end\n end.\n\ntest() ->\n lists:map(\n fun(S) -> io:format(\"~s\",[S]) end,\n [\n [\n begin\n Z = complex:make(X, Y),\n mandelbrot(Z, 50, Z, 1)\n end\n || X <- seq_float(-2, 0.5, 0.0315)\n ] ++ \"\\n\"\n || Y <- seq_float(-1,1, 0.05)\n ] ),\n ok.\n\n% **************************************************\n% Copied from https://gist.github.com/andruby/241489\n% **************************************************\n\nseq_float(Min, Max, Inc, Counter, Acc) when (Counter*Inc + Min) >= Max ->\n lists:reverse([Max|Acc]);\nseq_float(Min, Max, Inc, Counter, Acc) ->\n seq_float(Min, Max, Inc, Counter+1, [Inc * Counter + Min|Acc]).\nseq_float(Min, Max, Inc) ->\n seq_float(Min, Max, Inc, 0, []).\n\n% **************************************************\n","language":"Erlang"},{"code":"PROGRAM MANDELBROT\n\n!$KEY\n!$INCLUDE=\"PC.LIB\"\n\nBEGIN\n\nSCREEN(7)\nGR_WINDOW(-2,1.5,2,-1.5)\nFOR X0=-2 TO 2 STEP 0.01 DO\n FOR Y0=-1.5 TO 1.5 STEP 0.01 DO\n X=0\n Y=0\n\n ITERATION=0\n MAX_ITERATION=223\n\n WHILE (X*X+Y*Y<=(2*2) AND ITERATION<MAX_ITERATION) DO\n X_TEMP=X*X-Y*Y+X0\n Y=2*X*Y+Y0\n\n X=X_TEMP\n\n ITERATION=ITERATION+1\n END WHILE\n\n IF ITERATION<>MAX_ITERATION THEN\n C=ITERATION\n ELSE\n C=0\n END IF\n\n PSET(X0,Y0,C)\n END FOR\nEND FOR\nEND PROGRAM\n","language":"ERRE"},{"code":"open System.Drawing\nopen System.Windows.Forms\ntype Complex =\n {\n re : float;\n im : float\n }\nlet cplus (x:Complex) (y:Complex) : Complex =\n {\n re = x.re + y.re;\n im = x.im + y.im\n }\nlet cmult (x:Complex) (y:Complex) : Complex =\n {\n re = x.re * y.re - x.im * y.im;\n im = x.re * y.im + x.im * y.re;\n }\n\nlet norm (x:Complex) : float =\n x.re*x.re + x.im*x.im\n\ntype Mandel = class\n inherit Form\n static member xPixels = 500\n static member yPixels = 500\n val mutable bmp : Bitmap\n member x.mandelbrot xMin xMax yMin yMax maxIter =\n let rec mandelbrotIterator z c n =\n if (norm z) > 2.0 then false else\n match n with\n | 0 -> true\n | n -> let z' = cplus ( cmult z z ) c in\n mandelbrotIterator z' c (n-1)\n let dx = (xMax - xMin) / (float (Mandel.xPixels))\n let dy = (yMax - yMin) / (float (Mandel.yPixels))\n in\n for xi = 0 to Mandel.xPixels-1 do\n for yi = 0 to Mandel.yPixels-1 do\n let c = {re = xMin + (dx * float(xi) ) ;\n im = yMin + (dy * float(yi) )} in\n if (mandelbrotIterator {re=0.;im=0.;} c maxIter) then\n x.bmp.SetPixel(xi,yi,Color.Azure)\n else\n x.bmp.SetPixel(xi,yi,Color.Black)\n done\n done\n\n member public x.generate () = x.mandelbrot (-1.5) 0.5 (-1.0) 1.0 200 ; x.Refresh()\n\n new() as x = {bmp = new Bitmap(Mandel.xPixels , Mandel.yPixels)} then\n x.Text <- \"Mandelbrot set\" ;\n x.Width <- Mandel.xPixels ;\n x.Height <- Mandel.yPixels ;\n x.BackgroundImage <- x.bmp;\n x.generate();\n x.Show();\nend\n\nlet f = new Mandel()\ndo Application.Run(f)\n","language":"F-Sharp"},{"code":"let getMandelbrotValues width height maxIter ((xMin,xMax),(yMin,yMax)) =\n let mandIter (cr:float,ci:float) =\n let next (zr,zi) = (cr + (zr * zr - zi * zi)), (ci + (zr * zi + zi * zr))\n let rec loop = function\n | step,_ when step=maxIter->0\n | step,(zr,zi) when ((zr * zr + zi * zi) > 2.0) -> step\n | step,z -> loop ((step + 1), (next z))\n loop (0,(0.0, 0.0))\n let forPos =\n let dx, dy = (xMax - xMin) / (float width), (yMax - yMin) / (float height)\n fun y x -> mandIter ((xMin + dx * float(x)), (yMin + dy * float(y)))\n [0..height-1] |> List.map(fun y->[0..width-1] |> List.map (forPos y))\n","language":"F-Sharp"},{"code":"getMandelbrotValues 80 25 50 ((-2.0,1.0),(-1.0,1.0))\n|> List.map(fun row-> row |> List.map (function | 0 ->\" \" |_->\".\") |> String.concat \"\")\n|> List.iter (printfn \"%s\")\n","language":"F-Sharp"},{"code":"open System.Drawing\nopen System.Windows.Forms\n\nlet showGraphic (colorForIter: int -> Color) (width: int) (height:int) maxIter view =\n new Form()\n |> fun frm ->\n frm.Width <- width\n frm.Height <- height\n frm.BackgroundImage <-\n new Bitmap(width,height)\n |> fun bmp ->\n getMandelbrotValues width height maxIter view\n |> List.mapi (fun y row->row |> List.mapi (fun x v->((x,y),v))) |> List.collect id\n |> List.iter (fun ((x,y),v) -> bmp.SetPixel(x,y,(colorForIter v)))\n bmp\n frm.Show()\n\nlet toColor = (function | 0 -> (0,0,0) | n -> ((31 &&& n) |> fun x->(0, 18 + x * 5, 36 + x * 7))) >> Color.FromArgb\n\nshowGraphic toColor 640 480 5000 ((-2.0,1.0),(-1.0,1.0))\n","language":"F-Sharp"},{"code":"! with (\"::\") or without (\":\") generalizations:\n! : [a..b] ( steps a b -- a..b ) 2dup swap - 4 nrot 1 - / <range> ;\n:: [a..b] ( steps a b -- a..b ) a b b a - steps 1 - / <range> ;\n\n: >char ( n -- c )\n dup -1 = [ drop 32 ] [ 26 mod CHAR: a + ] if ;\n\n! iterates z' = z^2 + c, Factor does complex numbers!\n: iter ( c z -- z' ) dup * + ;\n\n: unbound ( c -- ? ) absq 4 > ;\n\n:: mz ( c max i z -- n )\n {\n { [ i max >= ] [ -1 ] }\n { [ z unbound ] [ i ] }\n [ c max i 1 + c z iter mz ]\n } cond ;\n\n: mandelzahl ( c max -- n ) 0 0 mz ;\n\n:: mandel ( w h max -- )\n h -1. 1. [a..b] ! range over y\n [ w -2. 1. [a..b] ! range over x\n [ dupd swap rect> max mandelzahl >char ] map\n >string print\n drop ! old y\n ] each\n ;\n\n70 25 1000 mandel\n","language":"Factor"},{"code":"#!/usr/bin/env fennel\n\n(fn mandelzahl [cr ci max i tr ti tr2 ti2]\n \"Calculates the Mandelbrot escape number of a complex point c\"\n (if (>= i max) -1\n (>= (+ tr2 ti2) 4) i\n (let [(tr ti) (values (+ (- tr2 ti2) cr)\n (+ (* tr ti 2) ci))]\n (mandelzahl cr ci max (+ i 1)\n tr ti (* tr tr) (* ti ti)))))\n\n(fn mandel [w h max]\n \"Entry point, generate a 'graphical' representation of the Mandelbrot set\"\n (for [y -1.0 1.0 (/ 2.0 h)]\n (var line {})\n (for [x -2.0 1.0 (/ 3.0 w)]\n (let [mz (mandelzahl x y max 0 0 0 0 0)]\n (tset line (+ (length line) 1)\n (or (and (< mz 0) \" \")\n (string.char (+ (string.byte :a) (% mz 26)))))))\n (print (table.concat line))))\n\n(fn arg-def [pos default]\n \"A helper fn to extract command line parameter with defaults\"\n (or (tonumber (and arg (. arg pos))) default))\n\n(let [width (arg-def 1 140)\n height (arg-def 2 50)\n max (arg-def 3 1e5)]\n (mandel width height max))\n","language":"Fennel"},{"code":"1.1 S I1=-1.2; S I2=1.2; S R1=-2; S R2=.5\n1.2 S MIT=30\n1.3 F Y=1,24; D 2\n1.4 Q\n\n2.1 T !\n2.2 F X=1,70; D 3\n\n3.1 S R=X*(R2-R1)/70+R1\n3.2 S I=Y*(I2-I1)/24+I1\n3.3 S C1=R; S C2=I\n3.4 F T=1,MIT; D 4\n\n4.1 S C3=C1\n4.2 S C1=C1*C1 - C2*C2\n4.3 S C2=C3*C2 + C2*C3\n4.4 S C1=C1+R\n4.5 S C2=C2+I\n4.6 I (-FABS(C1)+2)5.1\n4.7 I (-FABS(C2)+2)5.1\n4.8 I (MIT-T-1)6.1\n\n5.1 S T=MIT; T \"*\"; R\n\n6.1 T \" \"; R\n","language":"FOCAL"},{"code":"500 value max-iter\n\n: mandel ( gmp F: imin imax rmin rmax -- )\n 0e 0e { F: imin F: imax F: rmin F: rmax F: Zr F: Zi }\n dup bheight 0 do\n i s>f dup bheight s>f f/ imax imin f- f* imin f+ TO Zi\n dup bwidth 0 do\n i s>f dup bwidth s>f f/ rmax rmin f- f* rmin f+ TO Zr\n Zr Zi max-iter\n begin 1- dup\n while fover fdup f* fover fdup f*\n fover fover f+ 4e f<\n while f- Zr f+\n frot frot f* 2e f* Zi f+\n repeat fdrop fdrop\n drop 0 \\ for a pretty grayscale image, replace with: 255 max-iter */\n else drop 255\n then fdrop fdrop\n over i j rot g!\n loop\n loop drop ;\n\n80 24 graymap\ndup -1e 1e -2e 1e mandel\n","language":"Forth"},{"code":"include lib/graphics.4th \\ graphics support is needed\n\n640 pic_width ! \\ width of the image\n480 pic_height ! \\ height of the image\n\ncreate shade \\ map the shades of the image\n ' black , \\ this is the colorscheme\n ' blue ,\n ' cyan ,\n ' green ,\n ' yellow ,\n ' red ,\n ' magenta ,\n ' blue ,\n ' cyan ,\n ' green ,\n ' yellow ,\n ' white ,\ndoes> swap cells + @c execute ; \\ loop through the shades available\n\ncolor_image \\ we're making a color image\n\n15121 -15120 do \\ do y-coordinate\n 15481 -21000 do \\ do x-coordinate\n j 0 0 0 ( l u v i)\n 200 0 do \\ get color\n >r\n over dup 10 / * 1000 / \\ calculate X and Y\n over dup 10 / * 1000 / \\ if X+Y > 40000\n over over + r> swap 40000 > \\ use the color in the loop\n if\n drop drop drop i 11 min leave\n else \\ otherwise try the next one\n j swap >r - - >r * 5000 / over + r> swap r>\n then\n loop \\ drop all parameters and set the shade\n shade drop drop drop \\ now set the proper pixel\n j 15120 + 63 / i 21000 + 57 / set_pixel\n 57 +loop \\ we're scaling the x-coordinate\n63 +loop \\ we're scaling the y-coordinate\n\ns\" mandelbt.ppm\" save_image \\ done, save the image\ndup gshow\nfree bye\n","language":"Forth"},{"code":"program mandelbrot\n\n implicit none\n integer , parameter :: rk = selected_real_kind (9, 99)\n integer , parameter :: i_max = 800\n integer , parameter :: j_max = 600\n integer , parameter :: n_max = 100\n real (rk), parameter :: x_centre = -0.5_rk\n real (rk), parameter :: y_centre = 0.0_rk\n real (rk), parameter :: width = 4.0_rk\n real (rk), parameter :: height = 3.0_rk\n real (rk), parameter :: dx_di = width / i_max\n real (rk), parameter :: dy_dj = -height / j_max\n real (rk), parameter :: x_offset = x_centre - 0.5_rk * (i_max + 1) * dx_di\n real (rk), parameter :: y_offset = y_centre - 0.5_rk * (j_max + 1) * dy_dj\n integer, dimension (i_max, j_max) :: image\n integer :: i\n integer :: j\n integer :: n\n real (rk) :: x\n real (rk) :: y\n real (rk) :: x_0\n real (rk) :: y_0\n real (rk) :: x_sqr\n real (rk) :: y_sqr\n\n do j = 1, j_max\n y_0 = y_offset + dy_dj * j\n do i = 1, i_max\n x_0 = x_offset + dx_di * i\n x = 0.0_rk\n y = 0.0_rk\n n = 0\n do\n x_sqr = x ** 2\n y_sqr = y ** 2\n if (x_sqr + y_sqr > 4.0_rk) then\n image (i, j) = 255\n exit\n end if\n if (n == n_max) then\n image (i, j) = 0\n exit\n end if\n y = y_0 + 2.0_rk * x * y\n x = x_0 + x_sqr - y_sqr\n n = n + 1\n end do\n end do\n end do\n open (10, file = 'out.pgm')\n write (10, '(a/ i0, 1x, i0/ i0)') 'P2', i_max, j_max, 255\n write (10, '(i0)') image\n close (10)\n\nend program mandelbrot\n","language":"Fortran"},{"code":"#define pix 1./120\n#define zero_x 320\n#define zero_y 240\n#define maxiter 250\n\nscreen 12\n\ntype complex\n r as double\n i as double\nend type\n\noperator + (x as complex, y as complex) as complex\n dim as complex ret\n ret.r = x.r + y.r\n ret.i = x.i + y.i\n return ret\nend operator\n\noperator * (x as complex, y as complex) as complex\n dim as complex ret\n ret.r = x.r*y.r - x.i*y.i\n ret.i = x.r*y.i + x.i*y.r\n return ret\nend operator\n\noperator abs ( x as complex ) as double\n return sqr(x.r*x.r + x.i*x.i)\nend operator\n\ndim as complex c, z\ndim as integer x, y, iter\n\nfor x=0 to 639\n for y=0 to 240\n c.r = (x-zero_x)*pix\n c.i = (y-zero_y)*pix\n z.r = 0.0\n z.i = 0.0\n for iter=0 to maxiter\n z = z*z + c\n if abs(z)>2 then\n pset(x,y),iter mod 16\n pset(x,480-y),iter mod 16\n goto cont\n end if\n next iter\n pset(x,y),1\n pset(x,480-y),1\n cont:\n next y\nnext x\n\nwhile inkey=\"\"\nwend\nend\n","language":"FreeBASIC"},{"code":"// Maximum levels for each pixel.\nlevels = 60\n\n// Create a random color for each level.\ncolors = new array[[levels]]\nfor a = 0 to levels-1\n colors@a = new color[randomFloat[0,1], randomFloat[0,1], randomFloat[0,1]]\n\n// Make this number smaller for higher resolution.\nstepsize = .005\n\ng = new graphics\ng.antialiased[false]\n\nfor im = -1.2 to 1.2 step stepsize\n{\n imag = i * im\n for real = -2 to 1 step stepsize\n {\n C = real + imag\n z = 0\n count = -1\n\n do\n {\n z = z^2 + C\n count=count+1;\n } while abs[z] < 4 and count < levels\n\n g.color[colors@((count-1) mod levels)]\n g.fillRectSize[real, im, stepsize, stepsize]\n }\n}\n\ng.show[]\n","language":"Frink"},{"code":"###sysinclude X.uh\n$ff0000 sto szin\n300 sto maxiter\nmaxypixel sto YRES\nmaxxpixel sto XRES\nmyscreen \"Mandelbrot\" @YRES @XRES graphic\n@YRES 2 / (#d) sto y2\n@YRES 2 / (#d) sto x2\n#g 0. @XRES (#d) 1. i: {#d\n#g 0. @YRES (#d) 1. {#d\n#d\n{#d}§i 400. - @x2 - @x2 /\nsto x\n{#d} @y2 - @y2 /\nsto y\nzero#d xa zero#d ya zero iter\n(( #d\n@x @xa dup* @ya dup* -+\n@y @xa *2 @ya *+ sto ya\nsto xa #g inc iter\n@iter @maxiter >= then((>))\n#d ( @xa dup* @ya dup* + 4. > )))\n#g @iter @maxiter == { #d\nmyscreen {d} {d}§i @szin [][]\n}{ #d\nmyscreen {d} {d}§i #g @iter 64 * [][]\n}\n#d}\n#d}\n(( ( myscreen key? 10000 usleep )))\nmyscreen !graphic\nend\n{ „x” }\n{ „x2” }\n{ „y” }\n{ „y2” }\n{ „xa” }\n{ „ya” }\n{ „iter” }\n{ „maxiter” }\n{ „szin” }\n{ „YRES” }\n{ „XRES” }\n{ „myscreen” }\n","language":"Furor"},{"code":"default(f32)\n\ntype complex = (f32, f32)\n\nfun dot(c: complex): f32 =\n let (r, i) = c\n in r * r + i * i\n\nfun multComplex(x: complex, y: complex): complex =\n let (a, b) = x\n let (c, d) = y\n in (a*c - b * d,\n a*d + b * c)\n\nfun addComplex(x: complex, y: complex): complex =\n let (a, b) = x\n let (c, d) = y\n in (a + c,\n b + d)\n\nfun divergence(depth: int, c0: complex): int =\n loop ((c, i) = (c0, 0)) = while i < depth && dot(c) < 4.0 do\n (addComplex(c0, multComplex(c, c)),\n i + 1)\n in i\n\nfun mandelbrot(screenX: int, screenY: int, depth: int, view: (f32,f32,f32,f32)): [screenX][screenY]int =\n let (xmin, ymin, xmax, ymax) = view\n let sizex = xmax - xmin\n let sizey = ymax - ymin\n in map (fn (x: int): [screenY]int =>\n map (fn (y: int): int =>\n let c0 = (xmin + (f32(x) * sizex) / f32(screenX),\n ymin + (f32(y) * sizey) / f32(screenY))\n in divergence(depth, c0))\n (iota screenY))\n (iota screenX)\n\nfun main(screenX: int, screenY: int, depth: int, xmin: f32, ymin: f32, xmax: f32, ymax: f32): [screenX][screenY]int =\n mandelbrot(screenX, screenY, depth, (xmin, ymin, xmax, ymax))\n","language":"Futhark"},{"code":"_xmin = -8601\n_xmax = 2867\n_ymin = -4915\n_ymax = 4915\n_maxiter = 32\n_dx = ( _xmax - _xmin ) / 79\n_dy = ( _ymax - _ymin ) / 24\n\nvoid local fn MandelbrotSet\n printf @\"\\n\"\n SInt32 cy = _ymin\n while ( cy <= _ymax )\n SInt32 cx = _xmin\n while ( cx <= _xmax )\n SInt32 x = 0\n SInt32 y = 0\n SInt32 x2 = 0\n SInt32 y2 = 0\n SInt32 iter = 0\n while ( iter < _maxiter )\n if ( x2 + y2 > 16384 ) then break\n y = ( ( x * y ) >> 11 ) + (SInt32)cy\n x = x2 - y2 + (SInt32)cx\n x2 = ( x * x ) >> 12\n y2 = ( y * y ) >> 12\n iter++\n wend\n print fn StringWithFormat( @\"%3c\", iter + 32 );\n cx += _dx\n wend\n printf @\"\\n\"\n cy += _dy\n wend\nend fn\n\nwindow 1, @\"Mandelbrot Set\", ( 0, 0, 820, 650 )\nWindowSetBackgroundColor( 1, fn ColorBlack )\ntext @\"Impact\", 10.0, fn ColorWithRGB( 1.000, 0.800, 0.000, 1.0 )\n\nfn MandelbrotSet\n\nHandleEvents\n","language":"FutureBasic"},{"code":"const int MaxIterations = 1000;\nconst vec2 Focus = vec2(-0.51, 0.54);\nconst float Zoom = 1.0;\n\nvec3\ncolor(int iteration, float sqLengthZ) {\n // If the point is within the mandlebrot set\n // just color it black\n if(iteration == MaxIterations)\n return vec3(0.0);\n\n // Else we give it a smoothed color\n \tfloat ratio = (float(iteration) - log2(log2(sqLengthZ))) / float(MaxIterations);\n\n // Procedurally generated colors\n return mix(vec3(1.0, 0.0, 0.0), vec3(1.0, 1.0, 0.0), sqrt(ratio));\n}\n\nvoid\nmainImage(out vec4 fragColor, in vec2 fragCoord) {\n // C is the aspect-ratio corrected UV coordinate.\n vec2 c = (-1.0 + 2.0 * fragCoord / iResolution.xy) * vec2(iResolution.x / iResolution.y, 1.0);\n\n // Apply scaling, then offset to get a zoom effect\n c = (c * exp(-Zoom)) + Focus;\n\tvec2 z = c;\n\n int iteration = 0;\n\n while(iteration < MaxIterations) {\n // Precompute for efficiency\n \tfloat zr2 = z.x * z.x;\n float zi2 = z.y * z.y;\n\n // The larger the square length of Z,\n // the smoother the shading\n if(zr2 + zi2 > 32.0) break;\n\n // Complex multiplication, then addition\n \tz = vec2(zr2 - zi2, 2.0 * z.x * z.y) + c;\n ++iteration;\n }\n\n // Generate the colors\n fragColor = vec4(color(iteration, dot(z,z)), 1.0);\n\n // Apply gamma correction\n fragColor.rgb = pow(fragColor.rgb, vec3(0.5));\n}\n","language":"GLSL"},{"code":"set terminal png\nset output 'mandelbrot.png'\n","language":"Gnuplot"},{"code":"rmax = 2\nnmax = 100\ncomplex (x, y) = x * {1, 0} + y * {0, 1}\nmandelbrot (z, z0, n) = n == nmax || abs (z) > rmax ? n : mandelbrot (z ** 2 + z0, z0, n + 1)\nset samples 200\nset isosamples 200\nset pm3d map\nset size square\nsplot [-2 : .8] [-1.4 : 1.4] mandelbrot (complex (0, 0), complex (x, y), 0) notitle\n","language":"Gnuplot"},{"code":"package main\n\nimport \"fmt\"\nimport \"math/cmplx\"\n\nfunc mandelbrot(a complex128) (z complex128) {\n for i := 0; i < 50; i++ {\n z = z*z + a\n }\n return\n}\n\nfunc main() {\n for y := 1.0; y >= -1.0; y -= 0.05 {\n for x := -2.0; x <= 0.5; x += 0.0315 {\n if cmplx.Abs(mandelbrot(complex(x, y))) < 2 {\n fmt.Print(\"*\")\n } else {\n fmt.Print(\" \")\n }\n }\n fmt.Println(\"\")\n }\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n \"image\"\n \"image/color\"\n \"image/draw\"\n \"image/png\"\n \"math/cmplx\"\n \"os\"\n)\n\nconst (\n maxEsc = 100\n rMin = -2.\n rMax = .5\n iMin = -1.\n iMax = 1.\n width = 750\n red = 230\n green = 235\n blue = 255\n)\n\nfunc mandelbrot(a complex128) float64 {\n i := 0\n for z := a; cmplx.Abs(z) < 2 && i < maxEsc; i++ {\n z = z*z + a\n }\n return float64(maxEsc-i) / maxEsc\n}\n\nfunc main() {\n scale := width / (rMax - rMin)\n height := int(scale * (iMax - iMin))\n bounds := image.Rect(0, 0, width, height)\n b := image.NewNRGBA(bounds)\n draw.Draw(b, bounds, image.NewUniform(color.Black), image.ZP, draw.Src)\n for x := 0; x < width; x++ {\n for y := 0; y < height; y++ {\n fEsc := mandelbrot(complex(\n float64(x)/scale+rMin,\n float64(y)/scale+iMin))\n b.Set(x, y, color.NRGBA{uint8(red * fEsc),\n uint8(green * fEsc), uint8(blue * fEsc), 255})\n\n }\n }\n f, err := os.Create(\"mandelbrot.png\")\n if err != nil {\n fmt.Println(err)\n return\n }\n if err = png.Encode(f, b); err != nil {\n fmt.Println(err)\n }\n if err = f.Close(); err != nil {\n fmt.Println(err)\n }\n}\n","language":"Go"},{"code":"20{40{0.1{.{;..*2$.*\\-\n20/3$-@@*10/3$-..*2$.*+1600<}*}32*'\n*'=\\;\\;@@(}60*;(n\\}40*;]''+\n","language":"Golfscript"},{"code":"10 SCALE# = 1/60 : ZEROX = 160\n20 ZEROY = 100 : MAXIT = 32\n30 SCREEN 1\n40 FOR X = 0 TO 2*ZEROX - 1\n50 CR# = (X-ZEROX)*SCALE#\n60 FOR Y = 0 TO ZEROY\n70 CI# = (ZEROY-Y)*SCALE#\n80 ZR# = 0\n90 ZI# = 0\n100 FOR I = 1 TO MAXIT\n110 BR# = CR# + ZR#*ZR# - ZI#*ZI#\n120 ZI# = CI# + 2*ZR#*ZI#\n130 ZR# = BR#\n140 IF ZR#*ZR# + ZI#*ZI# > 4 THEN GOTO 170\n150 NEXT I\n160 GOTO 190\n170 PSET (X, Y), 1 + (I MOD 3)\n180 PSET (X, 2*ZEROY-Y), 1+(I MOD 3)\n190 NEXT Y\n200 NEXT X\n","language":"GW-BASIC"},{"code":"use fmt;\nuse math;\n\ntype complex = struct {\n\tre: f64,\n\tim: f64\n};\n\nexport fn main() void = {\n\tfor (let y = -1.2; y < 1.2; y += 0.05) {\n\t\tfor (let x = -2.05; x < 0.55; x += 0.03) {\n\t\t\tlet z = complex {re = 0.0, im = 0.0};\n\n\t\t\tfor (let m = 0z; m < 100; m += 1) {\n\t\t\t\tlet tz = z;\n\n\t\t\t\tz.re = tz.re*tz.re - tz.im*tz.im;\n\t\t\t\tz.im = tz.re*tz.im + tz.im*tz.re;\n\t\t\t\tz.re += x;\n\t\t\t\tz.im += y;\n\t\t\t};\n\t\t\tfmt::print(if (abs(z) < 2f64) '#' else '.')!;\n\t\t};\n\t\tfmt::println()!;\n\t};\n};\n\nfn abs(z: complex) f64 = {\n\treturn math::sqrtf64(z.re*z.re + z.im*z.im);\n};\n","language":"Hare"},{"code":"import Data.Bool ( bool )\nimport Data.Complex (Complex ((:+)), magnitude)\n\nmandelbrot :: RealFloat a => Complex a -> Complex a\nmandelbrot a = iterate ((a +) . (^ 2)) 0 !! 50\n\nmain :: IO ()\nmain =\n mapM_\n putStrLn\n [ [ bool ' ' '*' (2 > magnitude (mandelbrot (x :+ y)))\n | x <- [-2, -1.9685 .. 0.5]\n ]\n | y <- [1, 0.95 .. -1]\n ]\n","language":"Haskell"},{"code":"-- first attempt\n-- putStrLn $ foldr (++) \"\" [ if x==(-2) then \"\\n\" else let (a, b) = iterate (\\(x', y') -> (x'^2-y'^2+x, 2*x'*y'+y)) (0, 0) !! 500 in (snd.head.filter (\\(v, c)->v) $ zip ([(<0.01), (<0.025), (<0.05), (<0.1), (<0.5), (<1), (<4), (\\_ -> True)] <*> [a^2 + b^2]) [\".\", \"\\'\", \":\", \"!\", \"|\", \"}\", \"#\", \" \"]) | y <- [1, 0.98 .. -1], x <- [-2, -1.98 .. 0.5]]\n\n-- replaced iterate with foldr, modified the snd.head part and a introduced a check to stop the magnitude from exploding\n-- foldr(>>)(return())[putStrLn[let(a,b)=foldr(\\_(u,w)->if(u^2+w^2<4)then(u^2-w^2+x,2*u*w+y)else(u,w))(0,0)[1..500]in snd.last$(filter(\\(f,v)->f)$zip(map(a^2+b^2>)[0,0.01,0.025,0.05,0.1,0.5,1,4])['.','\\'',':','!','|','}','#',' '])|x<-[-2,-1.98..0.5]]|y<-[1,0.98.. -1]]\n\n-- without different characters in the output\n-- foldr(>>)(return())[putStrLn[let(a,b)=foldr(\\_(u,w)->(u^2-w^2+x,2*u*w+y))(0,0)[1..500]in if a^2+b^2<4 then '*' else ' '|x<-[-2,-1.98..0.5]]|y<-[1,0.98.. -1]]\n\n-- using mapM_ instead of foldr, bind operator instead of list comprehension and replacing 'let' with a lambda function\n -- mapM_ putStrLn $[1,0.98.. -1]>>= \\y->return $[-2,-1.98..0.5]>>= \\x->return (if(\\(a,b)->a^2+b^2<4)(foldr(\\_(u,w)->(u^2-w^2+x,2*u*w+y))(0,0)[1..500]) then '*' else ' ')\n\n-- open GHCI > Copy and paste any of above one-liners > Hit enter\n","language":"Haskell"},{"code":"main :: IO ()\nmain =\n putStrLn $\n concat\n [ go x y\n | y <- [1, 0.98 .. -1],\n x <- [-2, -1.98 .. 0.5]\n ]\n where\n go x y\n | x == (-2) = \"\\n\"\n | otherwise =\n let (a, b) =\n iterate\n (\\(x', y') -> (x' ^ 2 - y' ^ 2 + x, 2 * x' * y' + y))\n (0, 0)\n !! 500\n in ( snd . head . filter fst $\n zip\n ( [ (< 0.01),\n (< 0.025),\n (< 0.05),\n (< 0.1),\n (< 0.5),\n (< 1),\n (< 4),\n const True\n ]\n <*> [a ^ 2 + b ^ 2]\n )\n [\".\", \"\\'\", \":\", \"!\", \"|\", \"}\", \"#\", \" \"]\n )\n","language":"Haskell"},{"code":"main :: IO ()\nmain =\n mapM_\n putStrLn\n $ [1, 0.98 .. -1]\n >>= \\y ->\n [ [-2, -1.98 .. 0.5]\n >>= \\x ->\n [ if (\\(a, b) -> a ^ 2 + b ^ 2 < 4)\n ( foldr\n ( \\_ (u, w) ->\n (u ^ 2 - w ^ 2 + x, 2 * u * w + y)\n )\n (0, 0)\n [1 .. 500]\n )\n then '*'\n else ' '\n ]\n ]\n","language":"Haskell"},{"code":"haxe -swf mandelbrot.swf -main Mandelbrot\n","language":"Haxe"},{"code":"class Mandelbrot extends flash.display.Sprite\n{\n inline static var MAX_ITER = 255;\n\n public static function main() {\n var w = flash.Lib.current.stage.stageWidth;\n var h = flash.Lib.current.stage.stageHeight;\n var mandelbrot = new Mandelbrot(w, h);\n flash.Lib.current.stage.addChild(mandelbrot);\n mandelbrot.drawMandelbrot();\n }\n\n var image:flash.display.BitmapData;\n public function new(width, height) {\n super();\n var bitmap:flash.display.Bitmap;\n image = new flash.display.BitmapData(width, height, false);\n bitmap = new flash.display.Bitmap(image);\n this.addChild(bitmap);\n }\n\n public function drawMandelbrot() {\n image.lock();\n var step_x = 3.0 / (image.width-1);\n var step_y = 2.0 / (image.height-1);\n for (i in 0...image.height) {\n var ci = i * step_y - 1.0;\n for (j in 0...image.width) {\n var k = 0;\n var zr = 0.0;\n var zi = 0.0;\n var cr = j * step_x - 2.0;\n while (k <= MAX_ITER && (zr*zr + zi*zi) <= 4) {\n var temp = zr*zr - zi*zi + cr;\n zi = 2*zr*zi + ci;\n zr = temp;\n k ++;\n }\n paint(j, i, k);\n }\n }\n image.unlock();\n }\n\n inline function paint(x, y, iter) {\n var color = iter > MAX_ITER? 0 : iter * 0x100;\n image.setPixel(x, y, color);\n }\n}\n","language":"Haxe"},{"code":"#! /bin/sh\nexec huginn -E \"${0}\" \"${@}\"\n#! huginn\n\nimport Algorithms as algo;\nimport Mathematics as math;\nimport Terminal as term;\n\nmandelbrot( x, y ) {\n c = math.Complex( x, y );\n z = math.Complex( 0., 0. );\n s = -1;\n for ( i : algo.range( 50 ) ) {\n z = z * z + c;\n if ( | z | > 2. ) {\n s = i;\n break;\n }\n }\n return ( s );\n}\n\nmain( argv_ ) {\n imgSize = term_size( argv_ );\n yRad = 1.2;\n yScale = 2. * yRad / real( imgSize[0] );\n xScale = 3.3 / real( imgSize[1] );\n glyphTab = [ \".\", \":\", \"-\", \"+\", \"+\" ].resize( 12, \"*\" ).resize( 26, \"%\" ).resize( 50, \"@\" ).push( \" \" );\n for ( y : algo.range( imgSize[0] ) ) {\n line = \"\";\n for ( x : algo.range( imgSize[1] ) ) {\n line += glyphTab[ mandelbrot( xScale * real( x ) - 2.3, yScale * real( y ) - yRad ) ];\n }\n print( line + \"\\n\" );\n }\n return ( 0 );\n}\n\nterm_size( argv_ ) {\n lines = 25;\n columns = 80;\n if ( size( argv_ ) == 3 ) {\n lines = integer( argv_[1] );\n columns = integer( argv_[2] );\n } else {\n lines = term.lines();\n columns = term.columns();\n if ( ( lines % 2 ) == 0 ) {\n lines -= 1;\n }\n }\n lines -= 1;\n columns -= 1;\n return ( ( lines, columns ) );\n}\n","language":"Huginn"},{"code":"link graphics\n\nprocedure main()\n width := 750\n height := 600\n limit := 100\n WOpen(\"size=\"||width||\",\"||height)\n every x:=1 to width & y:=1 to height do\n {\n z:=complex(0,0)\n c:=complex(2.5*x/width-2.0,(2.0*y/height-1.0))\n j:=0\n while j<limit & cAbs(z)<2.0 do\n {\n z := cAdd(cMul(z,z),c)\n j+:= 1\n }\n Fg(mColor(j,limit))\n DrawPoint(x,y)\n }\n WriteImage(\"./mandelbrot.gif\")\n WDone()\nend\n\nprocedure mColor(x,limit)\n max_color := 2^16-1\n color := integer(max_color*(real(x)/limit))\n\n return(if x=limit\n then \"black\"\n else color||\",\"||color||\",0\")\nend\n\nrecord complex(r,i)\n\nprocedure cAdd(x,y)\n return complex(x.r+y.r,x.i+y.i)\nend\n\nprocedure cMul(x,y)\n return complex(x.r*y.r-x.i*y.i,x.r*y.i+x.i*y.r)\nend\n\nprocedure cAbs(x)\n return sqrt(x.r*x.r+x.i*x.i)\nend\n","language":"Icon"},{"code":"PRO Mandelbrot,xRange,yRange,xPixels,yPixels,iterations\n\nxPixelstartVec = Lindgen( xPixels) * Float(xRange[1]-xRange[0]) / $\n xPixels + xRange[0]\nyPixelstartVec = Lindgen( yPixels) * Float(YRANGE[1]-yrange[0])$\n / yPixels + yRange[0]\n\nconstArr = Complex( Rebin( xPixelstartVec, xPixels, yPixels),$\n Rebin( Transpose(yPixelstartVec), xPixels, yPixels))\n\nvalArr = ComplexArr( xPixels, yPixels)\n\nres = IntArr( xPixels, yPixels)\n\noriIndex = Lindgen( Long(xPixels) * yPixels)\n\nFOR i = 0, iterations-1 DO BEGIN ; only one loop needed\n\n ; calculation for whole array at once\n valArr = valArr^2 - constArr\n\n whereIn = Where( Abs( valArr) LE 4.0d, COMPLEMENT=whereOut)\n\n IF whereIn[0] EQ -1 THEN BREAK\n\n valArr = valArr[ whereIn]\n\n constArr = constArr[ whereIn]\n\n IF whereOut[0] NE -1 THEN BEGIN\n\n res[ oriIndex[ whereOut]] = i+1\n\n oriIndex = oriIndex[ whereIn]\n ENDIF\nENDFOR\n\ntv,res ; open a window and show the result\n\nEND\n\n\nMandelbrot,[-1.,2.3],[-1.3,1.3],640,512,200\n\nEND\n","language":"IDL"},{"code":"GDL>.run mandelbrot\n","language":"IDL"},{"code":"GDL> Mandelbrot,[-1.,2.3],[-1.3,1.3],640,512,200\n","language":"IDL"},{"code":"\"Mandelbrot\"\n\nThe story headline is \"A Non-Interactive Set\".\n\nInclude Glimmr Drawing Commands by Erik Temple.\n\n[Q20 fixed-point or floating-point: see definitions below]\nUse floating-point math.\n\nFinished is a room.\n\nThe graphics-window is a graphics g-window spawned by the main-window.\nThe position is g-placeabove.\n\nWhen play begins:\n\tlet f10 be 10 as float;\n\tnow min re is ( -20 as float ) fdiv f10;\n\tnow max re is ( 6 as float ) fdiv f10;\n\tnow min im is ( -12 as float ) fdiv f10;\n\tnow max im is ( 12 as float ) fdiv f10;\n\tnow max iterations is 100;\n\tadd color g-Black to the palette;\n\tadd color g-Red to the palette;\n\tadd hex \"#FFA500\" to the palette;\n\tadd color g-Yellow to the palette;\n\tadd color g-Green to the palette;\n\tadd color g-Blue to the palette;\n\tadd hex \"#4B0082\" to the palette;\n\tadd hex \"#EE82EE\" to the palette;\n\topen up the graphics-window.\n\nMin Re is a number that varies.\nMax Re is a number that varies.\nMin Im is a number that varies.\nMax Im is a number that varies.\n\nMax Iterations is a number that varies.\n\nMin X is a number that varies.\nMax X is a number that varies.\nMin Y is a number that varies.\nMax Y is a number that varies.\n\nThe palette is a list of numbers that varies.\n\n[vertically mirrored version]\nWindow-drawing rule for the graphics-window when max im is fneg min im:\n\tclear the graphics-window;\n\tlet point be { 0, 0 };\n\tnow min X is 0 as float;\n\tnow min Y is 0 as float;\n\tlet mX be the width of the graphics-window minus 1;\n\tlet mY be the height of the graphics-window minus 1;\n\tnow max X is mX as float;\n\tnow max Y is mY as float;\n\tlet L be the column order with max mX;\n\trepeat with X running through L:\n\t\tnow entry 1 in point is X;\n\t\trepeat with Y running from 0 to mY / 2:\n\t\t\tnow entry 2 in point is Y;\n\t\t\tlet the scaled point be the complex number corresponding to the point;\n\t\t\tlet V be the Mandelbrot result for the scaled point;\n\t\t\tlet C be the color corresponding to V;\n\t\t\tif C is 0, next;\n\t\t\tdraw a rectangle (C) in the graphics-window at the point with size 1 by 1;\n\t\t\tnow entry 2 in point is mY - Y;\n\t\t\tdraw a rectangle (C) in the graphics-window at the point with size 1 by 1;\n\t\tyield to VM;\n\trule succeeds.\n\n[slower non-mirrored version]\nWindow-drawing rule for the graphics-window:\n\tclear the graphics-window;\n\tlet point be { 0, 0 };\n\tnow min X is 0 as float;\n\tnow min Y is 0 as float;\n\tlet mX be the width of the graphics-window minus 1;\n\tlet mY be the height of the graphics-window minus 1;\n\tnow max X is mX as float;\n\tnow max Y is mY as float;\n\tlet L be the column order with max mX;\n\trepeat with X running through L:\n\t\tnow entry 1 in point is X;\n\t\trepeat with Y running from 0 to mY:\n\t\t\tnow entry 2 in point is Y;\n\t\t\tlet the scaled point be the complex number corresponding to the point;\n\t\t\tlet V be the Mandelbrot result for the scaled point;\n\t\t\tlet C be the color corresponding to V;\n\t\t\tif C is 0, next;\n\t\t\tdraw a rectangle (C) in the graphics-window at the point with size 1 by 1;\n\t\tyield to VM;\n\trule succeeds.\n\nTo decide which list of numbers is column order with max (N - number):\n\tlet L be a list of numbers;\n\tlet L2 be a list of numbers;\n\tlet D be 64;\n\tlet rev be false;\n\twhile D > 0:\n\t\tlet X be 0;\n\t\ttruncate L2 to 0 entries;\n\t\twhile X <= N:\n\t\t\tif D is 64 or X / D is odd, add X to L2;\n\t\t\tincrease X by D;\n\t\tif rev is true:\n\t\t\treverse L2;\n\t\t\tlet rev be false;\n\t\totherwise:\n\t\t\tlet rev be true;\n\t\tadd L2 to L;\n\t\tlet D be D / 2;\n\tdecide on L.\n\nTo decide which list of numbers is complex number corresponding to (P - list of numbers):\n\tlet R be a list of numbers;\n\textend R to 2 entries;\n\tlet X be entry 1 in P as float;\n\tlet X be (max re fsub min re) fmul (X fdiv max X);\n\tlet X be X fadd min re;\n\tlet Y be entry 2 in P as float;\n\tlet Y be (max im fsub min im) fmul (Y fdiv max Y);\n\tlet Y be Y fadd min im;\n\tnow entry 1 in R is X;\n\tnow entry 2 in R is Y;\n\tdecide on R.\n\nTo decide which number is Mandelbrot result for (P - list of numbers):\n\tlet c_re be entry 1 in P;\n\tlet c_im be entry 2 in P;\n\tlet z_re be 0 as float;\n\tlet z_im be z_re;\n\tlet threshold be 4 as float;\n\tlet runs be 0;\n\twhile 1 is 1:\n\t\t[ z = z * z ]\n\t\tlet r2 be z_re fmul z_re;\n\t\tlet i2 be z_im fmul z_im;\n\t\tlet ri be z_re fmul z_im;\n\t\tlet z_re be r2 fsub i2;\n\t\tlet z_im be ri fadd ri;\n\t\t[ z = z + c ]\n\t\tlet z_re be z_re fadd c_re;\n\t\tlet z_im be z_im fadd c_im;\n\t\tlet norm be (z_re fmul z_re) fadd (z_im fmul z_im);\n\t\tincrease runs by 1;\n\t\tif norm is greater than threshold, decide on runs;\n\t\tif runs is max iterations, decide on 0.\n\nTo decide which number is color corresponding to (V - number):\n\tlet L be the number of entries in the palette;\n\tlet N be the remainder after dividing V by L;\n\tdecide on entry (N + 1) in the palette.\n\nSection - Fractional numbers (for Glulx only)\n\nTo decide which number is (N - number) as float: (- (numtof({N})) -).\nTo decide which number is (N - number) fadd (M - number): (- (fadd({N}, {M})) -).\nTo decide which number is (N - number) fsub (M - number): (- (fsub({N}, {M})) -).\nTo decide which number is (N - number) fmul (M - number): (- (fmul({N}, {M})) -).\nTo decide which number is (N - number) fdiv (M - number): (- (fdiv({N}, {M})) -).\nTo decide which number is fneg (N - number): (- (fneg({N})) -).\nTo yield to VM: (- glk_select_poll(gg_event); -).\n\nUse Q20 fixed-point math translates as (- Constant Q20_MATH; -).\nUse floating-point math translates as (- Constant FLOAT_MATH; -).\n\nInclude (-\n#ifdef Q20_MATH;\n! Q11.20 format: 1 sign bit, 11 integer bits, 20 fraction bits\n[ numtof n r; @shiftl n 20 r; return r; ];\n[ fadd n m; return n+m; ];\n[ fsub n m; return n-m; ];\n[ fmul n m; n = n + $$1000000000; @sshiftr n 10 n; m = m + $$1000000000; @sshiftr m 10 m; return n * m; ];\n[ fdiv n m; @sshiftr m 20 m; return n / m; ];\n[ fneg n; return -n; ];\n#endif;\n\n#ifdef FLOAT_MATH;\n[ numtof f; @\"S2:400\" f f; return f; ];\n[ fadd n m; @\"S3:416\" n m n; return n; ];\n[ fsub n m; @\"S3:417\" n m n; return n; ];\n[ fmul n m; @\"S3:418\" n m n; return n; ];\n[ fdiv n m; @\"S3:419\" n m n; return n; ];\n[ fneg n; @bitxor n $80000000 n; return n; ];\n#endif;\n-).\n","language":"Inform-7"},{"code":"(function mandelbrot width height depth\n (.. str\n (for yy (range height)\n xx (range width)\n (let c_re (/ (* (- xx (/ width 2)) 4) width)\n c_im (/ (* (- yy (/ height 2)) 4) width)\n x 0 y 0 i 0)\n (while (and (<= (+ (** x) (** y)) 4)\n (< i depth))\n (let x2 (+ c_re (- (** x) (** y)))\n y (+ c_im (* 2 x y))\n x x2\n i (inc i)))\n (strn ((zero? xx) \"\\n\") (i \"ABCDEFGHIJ \")))))\n\n(mandelbrot 48 24 10)\n","language":"Inform-7"},{"code":"mcf=. (<: 2:)@|@(] ((*:@] + [)^:((<: 2:)@|@])^:1000) 0:) NB. 1000 iterations test\n","language":"J"},{"code":"domain=. |.@|:@({.@[ + ] *~ j./&i.&>/@+.@(1j1 + ] %~ -~/@[))&>/\n\nload 'viewmat'\nviewmat mcf \"0 @ domain (_2j_1 1j1) ; 0.01 NB. Complex interval and resolution\n","language":"J"},{"code":" viewmat mcf \"0 @ domain (_2j_1 1j1) ; 0.1 NB. Complex interval and resolution\n","language":"J"},{"code":"import java.awt.Graphics;\nimport java.awt.image.BufferedImage;\nimport javax.swing.JFrame;\n\npublic class Mandelbrot extends JFrame {\n\n private final int MAX_ITER = 570;\n private final double ZOOM = 150;\n private BufferedImage I;\n private double zx, zy, cX, cY, tmp;\n\n public Mandelbrot() {\n super(\"Mandelbrot Set\");\n setBounds(100, 100, 800, 600);\n setResizable(false);\n setDefaultCloseOperation(EXIT_ON_CLOSE);\n I = new BufferedImage(getWidth(), getHeight(), BufferedImage.TYPE_INT_RGB);\n for (int y = 0; y < getHeight(); y++) {\n for (int x = 0; x < getWidth(); x++) {\n zx = zy = 0;\n cX = (x - 400) / ZOOM;\n cY = (y - 300) / ZOOM;\n int iter = MAX_ITER;\n while (zx * zx + zy * zy < 4 && iter > 0) {\n tmp = zx * zx - zy * zy + cX;\n zy = 2.0 * zx * zy + cY;\n zx = tmp;\n iter--;\n }\n I.setRGB(x, y, iter | (iter << 8));\n }\n }\n }\n\n @Override\n public void paint(Graphics g) {\n g.drawImage(I, 0, 0, this);\n }\n\n public static void main(String[] args) {\n new Mandelbrot().setVisible(true);\n }\n}\n","language":"Java"},{"code":"import static java.awt.Color.HSBtoRGB;\nimport static java.awt.Color.black;\nimport static java.awt.event.KeyEvent.VK_BACK_SLASH;\nimport static java.awt.event.KeyEvent.VK_ESCAPE;\nimport static java.awt.image.BufferedImage.TYPE_INT_RGB;\nimport static java.lang.Integer.signum;\nimport static java.lang.Math.abs;\nimport static java.lang.Math.max;\nimport static java.lang.Math.min;\nimport static java.lang.System.currentTimeMillis;\nimport static java.util.Locale.ROOT;\n\nimport java.awt.Dimension;\nimport java.awt.Graphics;\nimport java.awt.Insets;\nimport java.awt.event.KeyAdapter;\nimport java.awt.event.KeyEvent;\nimport java.awt.event.MouseAdapter;\nimport java.awt.event.MouseEvent;\nimport java.awt.image.BufferedImage;\nimport java.util.function.Consumer;\nimport java.util.function.Predicate;\n\nimport javax.swing.JFrame;\n\n/*\n * click: point to center\n * ctrl-click: point to origin\n * drag: point to mouse release point\n * ctrl-drag: point to origin + zoom\n * back-slash: back to previous point\n * esc: back to previous zoom point - zoom\n */\n\npublic class Mandelbrot extends JFrame {\n\tprivate static final long serialVersionUID = 1L;\n\t\n\tprivate Insets insets;\n\tprivate int width, height;\n\tprivate double widthHeightRatio;\n\tprivate int minX, minY;\n\tprivate double Zoom;\n\t\t\n\tprivate int mpX, mpY, mdX, mdY;\n\tprivate boolean isCtrlDown, ctrl;\n\tprivate Stack stack = new Stack();\n\t\n\tprivate BufferedImage image;\n\tprivate boolean newImage = true;\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Mandelbrot(800, 600); // (800, 600), (1024, 768), (1600, 900), (1920, 1080)\n\t\t//new Mandelbrot(800, 600, 4.5876514379235943e-09, -0.6092161175392330, -0.4525577210859453);\n\t\t//new Mandelbrot(800, 600, 5.9512354925205320e-10, -0.6092146769531246, -0.4525564820098262);\n\t\t//new Mandelbrot(800, 600, 6.7178527589983420e-08, -0.7819036465400592, -0.1298363433443265);\n\t\t//new Mandelbrot(800, 600, 4.9716091454775210e-09, -0.7818800036717134, -0.1298044093748981);\n\t\t//new Mandelbrot(800, 600, 7.9333341281639390e-06, -0.7238770725243187, -0.2321214232559487);\n\t\t/*\n\t\tnew Mandelbrot(800, 600, new double[][] {\n\t\t\t{5.0000000000000000e-03, -2.6100000000000000, -1.4350000000000000}, // done!\n\t\t\t{3.5894206549118390e-04, -0.7397795969773300, -0.4996473551637279}, // done!\n\t\t\t{3.3905106941862460e-05, -0.6270410477828043, -0.4587021918164572}, // done!\n\t\t\t{6.0636337351945460e-06, -0.6101531446039512, -0.4522561221394852}, // done!\n\t\t\t{1.5502741161769430e-06, -0.6077214060084073, -0.4503995886987711}, // done!\n\t\t});\n\t\t//*/\n\t}\n\t\n\tpublic Mandelbrot(int width, int height) {\n\t\tthis(width, height, .005, -2.61, -1.435);\n\t}\n\t\n\tpublic Mandelbrot(int width, int height, double Zoom, double r, double i) {\n\t\tthis(width, height, new double[] {Zoom, r, i});\n\t}\n\t\n\tpublic Mandelbrot(int width, int height, double[] ... points) {\n\t\tsuper(\"Mandelbrot Set\");\n\t\tsetResizable(false);\n\t\tsetDefaultCloseOperation(EXIT_ON_CLOSE);\n\t\tDimension screen = getToolkit().getScreenSize();\n\t\tsetBounds(\n\t\t\trint((screen.getWidth() - width) / 2),\n\t\t\trint((screen.getHeight() - height) / 2),\n\t\t\twidth,\n\t\t\theight\n\t\t);\n\t\taddMouseListener(mouseAdapter);\n\t\taddMouseMotionListener(mouseAdapter);\n\t\taddKeyListener(keyAdapter);\n\t\tPoint point = stack.push(points);\n\t\tthis.Zoom = point.Zoom;\n\t\tthis.minX = point.minX;\n\t\tthis.minY = point.minY;\n\t\tsetVisible(true);\n\t\tinsets = getInsets();\n\t\tthis.width = width -= insets.left + insets.right;\n\t\tthis.height = height -= insets.top + insets.bottom;\n\t\twidthHeightRatio = (double) width / height;\n\t}\n\t\n\tprivate int rint(double d) {\n\t\treturn (int) Math.rint(d); // half even\n\t}\n\n\tprivate void repaint(boolean newImage) {\n\t\tthis.newImage = newImage;\n\t\trepaint();\n\t}\n\n\tprivate MouseAdapter mouseAdapter = new MouseAdapter() {\n\t\tpublic void mouseClicked(MouseEvent e) {\n\t\t\tstack.push(false);\n\t\t\tif (!ctrl) {\n\t\t\t\tminX -= width / 2 ;\n\t\t\t\tminY -= height / 2;\n\t\t\t}\n\t\t\tminX += e.getX() - insets.left;\n\t\t\tminY += e.getY() - insets.top;\n\t\t\tctrl = false;\n\t\t\trepaint(true);\n\t \t}\n\t\tpublic void mousePressed(MouseEvent e) {\n\t\t\tmpX = e.getX();\n\t\t\tmpY = e.getY();\n\t\t\tctrl = isCtrlDown;\n\t\t}\n\t\tpublic void mouseDragged(MouseEvent e) {\n\t\t\tif (!ctrl) return;\n\t\t\tsetMdCoord(e);\n\t\t\trepaint();\n\t\t}\n\t\tprivate void setMdCoord(MouseEvent e) {\n\t\t\tint dx = e.getX() - mpX;\n\t\t\tint dy = e.getY() - mpY;\n\t\t\tmdX = mpX + max(abs(dx), rint(abs(dy) * widthHeightRatio) * signum(dx));\n\t\t\tmdY = mpY + max(abs(dy), rint(abs(dx) / widthHeightRatio) * signum(dy));\n\t\t\tacceptIf(insets.left, ge(mdX), setMdXY);\n\t\t\tacceptIf(insets.top, ge(mdY), setMdYX);\n\t\t\tacceptIf(insets.left+width-1, le(mdX), setMdXY);\n\t\t\tacceptIf(insets.top+height-1, le(mdY), setMdYX);\n\t\t}\n\t\tprivate void acceptIf(int value, Predicate<Integer> p, Consumer<Integer> c) { if (p.test(value)) c.accept(value); }\n\t\tprivate Predicate<Integer> ge(int md) { return v-> v >= md; }\n\t\tprivate Predicate<Integer> le(int md) { return v-> v <= md; }\n\t\tprivate Consumer<Integer> setMdXY = v-> mdY = mpY + rint(abs((mdX=v)-mpX) / widthHeightRatio) * signum(mdY-mpY);\n\t\tprivate Consumer<Integer> setMdYX = v-> mdX = mpX + rint(abs((mdY=v)-mpY) * widthHeightRatio) * signum(mdX-mpX);\n\t\tpublic void mouseReleased(MouseEvent e) {\n\t\t\tif (e.getX() == mpX && e.getY() == mpY) return;\n\t\t\tstack.push(ctrl);\n\t\t\tif (!ctrl) {\n\t\t\t\tminX += mpX - (mdX = e.getX());\n\t\t\t\tminY += mpY - (mdY = e.getY());\n\t\t\t}\n\t\t\telse {\n\t\t\t\tsetMdCoord(e);\n\t\t\t\tif (mdX < mpX) { int t=mpX; mpX=mdX; mdX=t; }\n\t\t\t\tif (mdY < mpY) { int t=mpY; mpY=mdY; mdY=t; }\n\t\t\t\tminX += mpX - insets.left;\n\t\t\t\tminY += mpY - insets.top;\n\t\t\t\tdouble rZoom = (double) width / abs(mdX - mpX);\n\t\t\t\tminX *= rZoom;\n\t\t\t\tminY *= rZoom;\n\t\t\t\tZoom /= rZoom;\n\t\t\t}\n\t\t\tctrl = false;\n\t\t\trepaint(true);\t\t\n\t\t}\n\t};\n\t\n\tprivate KeyAdapter keyAdapter = new KeyAdapter() {\n\t\tpublic void keyPressed(KeyEvent e) {\n\t\t\tisCtrlDown = e.isControlDown();\n\t\t}\n\t\tpublic void keyReleased(KeyEvent e) {\n\t\t\tisCtrlDown = e.isControlDown();\n\t\t}\n\t\tpublic void keyTyped(KeyEvent e) {\n\t\t\tchar c = e.getKeyChar();\n\t\t\tboolean isEsc = c == VK_ESCAPE;\n\t\t\tif (!isEsc && c != VK_BACK_SLASH) return;\n\t\t\trepaint(stack.pop(isEsc));\n\t\t}\n\t};\n\t\n\tprivate class Point {\n\t\tpublic boolean type;\n\t\tpublic double Zoom;\n\t\tpublic int minX;\n\t\tpublic int minY;\n\t\tPoint(boolean type, double Zoom, int minX, int minY) {\n\t\t\tthis.type = type;\n\t\t\tthis.Zoom = Zoom;\n\t\t\tthis.minX = minX;\n\t\t\tthis.minY = minY;\n\t\t}\n\t}\n\tprivate class Stack extends java.util.Stack<Point> {\n\t\tprivate static final long serialVersionUID = 1L;\n\t\tpublic Point push(boolean type) {\n\t\t\treturn push(type, Zoom, minX, minY);\n\t\t}\n\t\tpublic Point push(boolean type, double ... point) {\n\t\t\tdouble Zoom = point[0];\n\t\t\treturn push(type, Zoom, rint(point[1]/Zoom), rint(point[2]/Zoom));\n\t\t}\n\t\tpublic Point push(boolean type, double Zoom, int minX, int minY) {\n\t\t\treturn push(new Point(type, Zoom, minX, minY));\n\t\t}\n\t\tpublic Point push(double[] ... points) {\n\t\t\tPoint lastPoint = push(false, points[0]);\n\t\t\tfor (int i=0, e=points.length-1; i<e; i+=1) {\n\t\t\t\tdouble[] point = points[i];\n\t\t\t\tlastPoint = push(point[0] != points[i+1][0], point);\n\t\t\t\tdone(printPoint(lastPoint));\n\t\t\t}\n\t\t\treturn lastPoint;\n\t\t}\n\t\tpublic boolean pop(boolean type) {\n\t\t\tfor (;;) {\n\t\t\t\tif (empty()) return false;\n\t\t\t\tPoint d = super.pop();\n\t\t\t\tZoom = d.Zoom;\n\t\t\t\tminX = d.minX;\n\t\t\t\tminY = d.minY;\n\t\t\t\tif (!type || d.type) return true;\n\t\t\t}\n\t\t}\n\t}\n\t\n\t@Override\n\tpublic void paint(Graphics g) {\n\t\tif (newImage) newImage();\n\t\tg.drawImage(image, insets.left, insets.top, this);\n\t\t//g.drawLine(insets.left+width/2, insets.top+0, insets.left+width/2, insets.top+height);\n\t\t//g.drawLine(insets.left+0, insets.top+height/2, insets.left+width, insets.top+height/2);\n\t\tif (!ctrl) return;\n\t\tg.drawRect(min(mpX, mdX), min(mpY, mdY), abs(mpX - mdX), abs(mpY - mdY));\n\t}\n\n\tprivate void newImage() {\n\t\tlong milli = printPoint();\n\t\timage = new BufferedImage(width, height, TYPE_INT_RGB);\n\t\tint maxX = minX + width;\n\t\tint maxY = minY + height;\n\t\tfor (int x = minX; x < maxX; x+=1) {\n\t\t\tdouble r = x * Zoom;\n\t\t\tfor (int y = minY; y < maxY; y+=1) {\n\t\t\t\tdouble i = y * Zoom;\n\t\t\t\t//System.out.printf(\"%+f%+fi\\n\", r, i);\n\t\t\t\t// 0f 1/6f 1/3f 1/2f 2/3f 5/6f\n\t\t\t\t//straight -> red yellow green cian blue magenta <- reverse\n\t\t\t\timage.setRGB(x-minX, y-minY, color(r, i, 360, false, 2/3f));\n\t\t\t}\n\t\t}\n\t\tnewImage = false;\n\t\tdone(milli);\n\t}\n\n\tprivate long printPoint() {\n\t\treturn printPoint(Zoom, minX, minY);\n\t}\n\tprivate long printPoint(Point point) {\n\t\treturn printPoint(point.Zoom, point.minX, point.minY);\n\t}\n\tprivate long printPoint(double Zoom, int minX, int minY) {\n\t\treturn printPoint(Zoom, minX*Zoom, minY*Zoom);\n\t}\n\tprivate long printPoint(Object ... point) {\n\t\tSystem.out.printf(ROOT,\t\"{%.16e, %.16g, %.16g},\", point);\n\t\treturn currentTimeMillis();\n\t}\n\t\n\tprivate void done(long milli) {\n\t\tmilli = currentTimeMillis() - milli;\n\t\tSystem.out.println(\" // \" + milli + \"ms done!\");\n\t}\n\n\tprivate int color(double r0, double i0, int max, boolean straight, float shift) {\n\t\tint n = -1;\n\t\tdouble r=0, i=0, r2=0, i2=0;\n\t\tdo {\n\t\t\ti = r*(i+i) + i0;\n\t\t\tr = r2-i2 + r0;\n\t\t\tr2 = r*r;\n\t\t\ti2 = i*i;\n\t\t}\n\t\twhile (++n < max && r2 + i2 < 4);\n\t\treturn n == max\n\t\t\t? black.getRGB()\n\t\t\t: HSBtoRGB(shift + (float) (straight ? n : max-n) / max * 11/12f + (straight ? 0f : 1/12f), 1, 1)\n\t\t;\t\t\n\t}\n}\n","language":"Java"},{"code":"function mandelIter(cx, cy, maxIter) {\n var x = 0.0;\n var y = 0.0;\n var xx = 0;\n var yy = 0;\n var xy = 0;\n\n var i = maxIter;\n while (i-- && xx + yy <= 4) {\n xy = x * y;\n xx = x * x;\n yy = y * y;\n x = xx - yy + cx;\n y = xy + xy + cy;\n }\n return maxIter - i;\n}\n\nfunction mandelbrot(canvas, xmin, xmax, ymin, ymax, iterations) {\n var width = canvas.width;\n var height = canvas.height;\n\n var ctx = canvas.getContext('2d');\n var img = ctx.getImageData(0, 0, width, height);\n var pix = img.data;\n\n for (var ix = 0; ix < width; ++ix) {\n for (var iy = 0; iy < height; ++iy) {\n var x = xmin + (xmax - xmin) * ix / (width - 1);\n var y = ymin + (ymax - ymin) * iy / (height - 1);\n var i = mandelIter(x, y, iterations);\n var ppos = 4 * (width * iy + ix);\n\n if (i > iterations) {\n pix[ppos] = 0;\n pix[ppos + 1] = 0;\n pix[ppos + 2] = 0;\n } else {\n var c = 3 * Math.log(i) / Math.log(iterations - 1.0);\n\n if (c < 1) {\n pix[ppos] = 255 * c;\n pix[ppos + 1] = 0;\n pix[ppos + 2] = 0;\n }\n else if ( c < 2 ) {\n pix[ppos] = 255;\n pix[ppos + 1] = 255 * (c - 1);\n pix[ppos + 2] = 0;\n } else {\n pix[ppos] = 255;\n pix[ppos + 1] = 255;\n pix[ppos + 2] = 255 * (c - 2);\n }\n }\n pix[ppos + 3] = 255;\n }\n }\n\n ctx.putImageData(img, 0, 0);\n}\n\nvar canvas = document.createElement('canvas');\ncanvas.width = 900;\ncanvas.height = 600;\n\ndocument.body.insertBefore(canvas, document.body.childNodes[0]);\n\nmandelbrot(canvas, -2, 1, -1, 1, 1000);\n","language":"JavaScript"},{"code":"var mandelIter;\nfetch(\"./mandelIter.wasm\")\n .then(res => {\n if (res.ok) return res.arrayBuffer();\n throw new Error('Unable to fetch WASM.');\n })\n .then(bytes => { return WebAssembly.compile(bytes); })\n .then(module => { return WebAssembly.instantiate(module); })\n .then(instance => { WebAssembly.instance = instance; draw(); })\n\nfunction mandelbrot(canvas, xmin, xmax, ymin, ymax, iterations) {\n // ...\n var i = WebAssembly.instance.exports.mandelIter(x, y, iterations);\n // ...\n}\n\nfunction draw() {\n // canvas initialization if necessary\n // ...\n mandelbrot(canvas, -2, 1, -1, 1, 1000);\n // ...\n}\n","language":"JavaScript"},{"code":"# SVG STUFF\n def svg(id; width; height):\n \"<svg width='\\(width // \"100%\")' height='\\(height // \"100%\") '\n id='\\(id)'\n xmlns='http://www.w3.org/2000/svg'>\";\n\n def pixel(x;y;r;g;b;a):\n \"<circle cx='\\(x)' cy='\\(y)' r='1' fill='rgb(\\(r|floor),\\(g|floor),\\(b|floor))' />\";\n\n# \"UNTIL\"\n # As soon as \"condition\" is true, then emit . and stop:\n def do_until(condition; next):\n def u: if condition then . else (next|u) end;\n u;\n","language":"Jq"},{"code":"def Mandeliter( cx; cy; maxiter ):\n # [i, x, y, x^2+y^2]\n [ maxiter, 0.0, 0.0, 0.0 ]\n | do_until( .[0] == 0 or .[3] > 4;\n .[1] as $x | .[2] as $y\n | ($x * $y) as $xy\n | ($x * $x) as $xx\n | ($y * $y) as $yy\n | [ (.[0] - 1), # i\n ($xx - $yy + cx), # x\n ($xy + $xy + cy), # y\n ($xx+$yy) # xx+yy\n ] )\n | maxiter - .[0];\n\n# width and height should be specified as the number of pixels.\n# obj == { xmin: _, xmax: _, ymin: _, ymax: _ }\ndef Mandelbrot( obj; width; height; iterations ):\n def pixies:\n range(0; width) as $ix\n | (obj.xmin + ((obj.xmax - obj.xmin) * $ix / (width - 1))) as $x\n | range(0; height) as $iy\n | (obj.ymin + ((obj.ymax - obj.ymin) * $iy / (height - 1))) as $y\n | Mandeliter( $x; $y; iterations ) as $i\n | if $i == iterations then\n pixel($ix; $iy; 0; 0; 0; 255)\n else\n (3 * ($i|log)/((iterations - 1.0)|log)) as $c # redness\n | if $c < 1 then\n pixel($ix;$iy; 255*$c; 0; 0; 255)\n elif $c < 2 then\n pixel($ix;$iy; 255; 255*($c-1); 0; 255)\n else\n pixel($ix;$iy; 255; 255; 255*($c-2); 255)\n end\n end;\n\n svg(\"mandelbrot\"; \"100%\"; \"100%\"),\n pixies,\n \"</svg>\";\n","language":"Jq"},{"code":" Mandelbrot( {\"xmin\": -2, \"xmax\": 1, \"ymin\": -1, \"ymax\":1}; 900; 600; 1000 )\n","language":"Jq"},{"code":"function mandelbrot(a)\n z = 0\n for i=1:50\n z = z^2 + a\n end\n return z\nend\n\nfor y=1.0:-0.05:-1.0\n for x=-2.0:0.0315:0.5\n abs(mandelbrot(complex(x, y))) < 2 ? print(\"*\") : print(\" \")\n end\n println()\nend\n","language":"Julia"},{"code":"using Images\n\n@inline function hsv2rgb(h, s, v)\n c = v * s\n x = c * (1 - abs(((h/60) % 2) - 1))\n m = v - c\n r,g,b = if h < 60 (c, x, 0)\n elseif h < 120 (x, c, 0)\n elseif h < 180 (0, c, x)\n elseif h < 240 (0, x, c)\n elseif h < 300 (x, 0, c)\n else (c, 0, x) end\n (r + m), (b + m), (g + m)\nend\n\nfunction mandelbrot()\n w = 1600\n h = 1200\n zoom = 0.5\n moveX = -0.5\n moveY = 0\n maxIter = 30\n img = Array{RGB{Float64},2}(undef,h,w)\n for x in 1:w\n for y in 1:h\n i = maxIter\n z = c = Complex( (2*x - w) / (w * zoom) + moveX,\n (2*y - h) / (h * zoom) + moveY )\n while abs(z) < 2 && (i -= 1) > 0\n z = z^2 + c\n end\n r,g,b = hsv2rgb(i / maxIter * 360, 1, i / maxIter)\n img[y,x] = RGB{Float64}(r, g, b)\n end\n end\n return img\nend\n\nimg = mandelbrot()\nsave(\"mandelbrot.png\", img)\n","language":"Julia"},{"code":"using Plots\ngr(aspect_ratio=:equal, legend=false, axis=false, ticks=false, dpi=100)\n\nd, h = 400, 300 # pixel density (= image width) and image height\nn, r = 40, 1000 # number of iterations and escape radius (r > 2)\n\nx = range(-1.0, 1.0, length=d+1)\ny = range(-h/d, h/d, length=h+1)\n\nC = 2.0 .* (x' .+ y .* im) .- 0.5\nZ, S = zero(C), zeros(size(C))\n\nanimation = Animation()\nsmoothing = Animation()\n\nfor k in 1:n\n M = abs.(Z) .< r\n S[M] = S[M] .+ exp.(.-abs.(Z[M]))\n Z[M] = Z[M] .^ 2 .+ C[M]\n heatmap(exp.(.-abs.(Z)), c=:jet)\n frame(animation)\n heatmap(S .+ exp.(.-abs.(Z)), c=:jet)\n frame(smoothing)\nend\n\ngif(animation, \"Mandelbrot_animation.gif\", fps=2)\ngif(smoothing, \"Mandelbrot_smoothing.gif\", fps=2)\n","language":"Julia"},{"code":"using Plots\ngr(aspect_ratio=:equal, axis=true, ticks=true, legend=false, dpi=200)\n\nd, h = 800, 500 # pixel density (= image width) and image height\nn, r = 200, 500 # number of iterations and escape radius (r > 2)\n\nx = range(0, 2, length=d+1)\ny = range(0, 2 * h / d, length=h+1)\n\nA, B = collect(x) .- 1, collect(y) .- h / d\nC = 2.0 .* (A' .+ B .* im) .- 0.5\n\nZ, dZ = zero(C), zero(C)\nD, S, T = zeros(size(C)), zeros(size(C)), zeros(size(C))\n\nfor k in 1:n\n M = abs.(Z) .< r\n S[M], T[M] = S[M] .+ exp.(.- abs.(Z[M])), T[M] .+ 1\n Z[M], dZ[M] = Z[M] .^ 2 .+ C[M], 2 .* Z[M] .* dZ[M] .+ 1\nend\n\nheatmap(S .^ 0.1, c=:balance)\nsavefig(\"Mandelbrot_set_1.png\")\n\nN = abs.(Z) .>= r # normalized iteration count\nT[N] = T[N] .- log2.(log.(abs.(Z[N])) ./ log(r))\n\nheatmap(T .^ 0.1, c=:balance)\nsavefig(\"Mandelbrot_set_2.png\")\n\nN = abs.(Z) .> 2 # exterior distance estimation\nD[N] = log.(abs.(Z[N])) .* abs.(Z[N]) ./ abs.(dZ[N])\n\nheatmap(D .^ 0.1, c=:balance)\nsavefig(\"Mandelbrot_set_3.png\")\n\nN, thickness = D .> 0, 0.01 # boundary detection\nD[N] = max.(1 .- D[N] ./ thickness, 0)\n\nheatmap(D .^ 2.0, c=:binary)\nsavefig(\"Mandelbrot_set_4.png\")\n","language":"Julia"},{"code":"using Plots\ngr(aspect_ratio=:equal, axis=true, ticks=true, legend=false, dpi=200)\n\nd, h = 800, 500 # pixel density (= image width) and image height\nn, r = 200, 500 # number of iterations and escape radius (r > 2)\n\ndirection, height = 45.0, 1.5 # direction and height of the light\ndensity, intensity = 4.0, 0.5 # density and intensity of the stripes\n\nx = range(0, 2, length=d+1)\ny = range(0, 2 * h / d, length=h+1)\n\nA, B = collect(x) .- 1, collect(y) .- h / d\nC = (2.0 + 1.0im) .* (A' .+ B .* im) .- 0.5\n\nZ, dZ, ddZ = zero(C), zero(C), zero(C)\nD, S, T = zeros(size(C)), zeros(size(C)), zeros(size(C))\n\nfor k in 1:n\n M = abs.(Z) .< r\n S[M], T[M] = S[M] .+ sin.(density .* angle.(Z[M])), T[M] .+ 1\n Z[M], dZ[M], ddZ[M] = Z[M] .^ 2 .+ C[M], 2 .* Z[M] .* dZ[M] .+ 1, 2 .* (dZ[M] .^ 2 .+ Z[M] .* ddZ[M])\nend\n\nN = abs.(Z) .>= r # basic normal map effect and stripe average coloring (potential function)\nP, Q = S[N] ./ T[N], (S[N] .+ sin.(density .* angle.(Z[N]))) ./ (T[N] .+ 1)\nU, V = Z[N] ./ dZ[N], 1 .+ (log2.(log.(abs.(Z[N])) ./ log(r)) .* (P .- Q) .+ Q) .* intensity\nU, v = U ./ abs.(U), exp(direction / 180 * pi * im) # unit normal vectors and light vector\nD[N] = max.((real.(U) .* real(v) .+ imag.(U) .* imag(v) .+ V .* height) ./ (1 + height), 0)\n\nheatmap(D .^ 1.0, c=:bone_1)\nsavefig(\"Mandelbrot_normal_map_1.png\")\n\nN = abs.(Z) .> 2 # advanced normal map effect using higher derivatives (distance estimation)\nU = Z[N] .* dZ[N] .* ((1 .+ log.(abs.(Z[N]))) .* conj.(dZ[N] .^ 2) .- log.(abs.(Z[N])) .* conj.(Z[N] .* ddZ[N]))\nU, v = U ./ abs.(U), exp(direction / 180 * pi * im) # unit normal vectors and light vector\nD[N] = max.((real.(U) .* real(v) .+ imag.(U) .* imag(v) .+ height) ./ (1 + height), 0)\n\nheatmap(D .^ 1.0, c=:afmhot)\nsavefig(\"Mandelbrot_normal_map_2.png\")\n","language":"Julia"},{"code":"using Plots\ngr(aspect_ratio=:equal, axis=true, ticks=true, legend=false, dpi=200)\n\nd, h = 200, 1200 # pixel density (= image width) and image height\nn, r = 8000, 10000 # number of iterations and escape radius (r > 2)\n\na = -.743643887037158704752191506114774 # https://mathr.co.uk/web/m-location-analysis.html\nb = 0.131825904205311970493132056385139 # try: a, b, n = -1.748764520194788535, 3e-13, 800\n\nx = range(0, 2, length=d+1)\ny = range(0, 2 * h / d, length=h+1)\n\nA, B = collect(x) .* pi, collect(y) .* pi\nC = 8.0 .* exp.((A' .+ B .* im) .* im) .+ (a + b * im)\n\nZ, dZ = zero(C), zero(C)\nD = zeros(size(C))\n\nfor k in 1:n\n M = abs2.(Z) .< abs2(r)\n Z[M], dZ[M] = Z[M] .^ 2 .+ C[M], 2 .* Z[M] .* dZ[M] .+ 1\nend\n\nN = abs.(Z) .> 2 # exterior distance estimation\nD[N] = log.(abs.(Z[N])) .* abs.(Z[N]) ./ abs.(dZ[N])\n\nheatmap(D' .^ 0.05, c=:nipy_spectral)\nsavefig(\"Mercator_Mandelbrot_map.png\")\n\nX, Y = real(C), imag(C) # zoom images (adjust circle size 50 and zoom level 20 as needed)\nR, c, z = 50 * (2 / d) * pi .* exp.(.- B), min(d, h) + 1, max(0, h - d) ÷ 20\n\ngr(c=:nipy_spectral, axis=true, ticks=true, legend=false, markerstrokewidth=0)\np1 = scatter(X[1z+1:1z+c,1:d], Y[1z+1:1z+c,1:d], markersize=R[1:c].^.5, marker_z=D[1z+1:1z+c,1:d].^.5)\np2 = scatter(X[2z+1:2z+c,1:d], Y[2z+1:2z+c,1:d], markersize=R[1:c].^.5, marker_z=D[2z+1:2z+c,1:d].^.4)\np3 = scatter(X[3z+1:3z+c,1:d], Y[3z+1:3z+c,1:d], markersize=R[1:c].^.5, marker_z=D[3z+1:3z+c,1:d].^.3)\np4 = scatter(X[4z+1:4z+c,1:d], Y[4z+1:4z+c,1:d], markersize=R[1:c].^.5, marker_z=D[4z+1:4z+c,1:d].^.2)\nplot(p1, p2, p3, p4, layout=(2, 2))\nsavefig(\"Mercator_Mandelbrot_zoom.png\")\n","language":"Julia"},{"code":"using Plots\ngr(aspect_ratio=:equal, axis=true, ticks=true, legend=false, dpi=200)\n\nsetprecision(BigFloat, 256) # set precision to 256 bits (default)\nsetrounding(BigFloat, RoundNearest) # set rounding mode (default)\n\nd, h = 50, 1000 # pixel density (= image width) and image height\nn, r = 80000, 100000 # number of iterations and escape radius (r > 2)\n\na = BigFloat(\"-1.256827152259138864846434197797294538253477389787308085590211144291\")\nb = BigFloat(\".37933802890364143684096784819544060002129071484943239316486643285025\")\n\nS = zeros(Complex{Float64}, n+1)\nlet c = a + b * im, z = zero(c)\n for k in 1:n+1\n S[k] = z\n if abs2(z) < abs2(r)\n z = z ^ 2 + c\n else\n println(\"The reference sequence diverges within $(k-1) iterations.\")\n break\n end\n end\nend\n\nx = range(0, 2, length=d+1)\ny = range(0, 2 * h / d, length=h+1)\n\nA, B = collect(x) .* pi, collect(y) .* pi\nC = 8.0 .* exp.((A' .+ B .* im) .* im)\n\nE, Z, dZ = zero(C), zero(C), zero(C)\nD, I, J = zeros(size(C)), ones(Int64, size(C)), ones(Int64, size(C))\n\nfor k in 1:n\n M, R = abs2.(Z) .< abs2(r), abs2.(Z) .< abs2.(E)\n E[R], I[R] = Z[R], J[R] # rebase when z is closer to zero\n E[M], I[M] = (2 .* S[I[M]] .+ E[M]) .* E[M] .+ C[M], I[M] .+ 1\n Z[M], dZ[M] = S[I[M]] .+ E[M], 2 .* Z[M] .* dZ[M] .+ 1\nend\n\nN = abs.(Z) .> 2 # exterior distance estimation\nD[N] = log.(abs.(Z[N])) .* abs.(Z[N]) ./ abs.(dZ[N])\n\nheatmap(D' .^ 0.015, c=:nipy_spectral)\nsavefig(\"Mercator_Mandelbrot_deep_map.png\")\n","language":"Julia"},{"code":"// version 1.1.2\n\nimport java.awt.Graphics\nimport java.awt.image.BufferedImage\nimport javax.swing.JFrame\n\nclass Mandelbrot: JFrame(\"Mandelbrot Set\") {\n companion object {\n private const val MAX_ITER = 570\n private const val ZOOM = 150.0\n }\n\n private val img: BufferedImage\n\n init {\n setBounds(100, 100, 800, 600)\n isResizable = false\n defaultCloseOperation = EXIT_ON_CLOSE\n img = BufferedImage(width, height, BufferedImage.TYPE_INT_RGB)\n for (y in 0 until height) {\n for (x in 0 until width) {\n var zx = 0.0\n var zy = 0.0\n val cX = (x - 400) / ZOOM\n val cY = (y - 300) / ZOOM\n var iter = MAX_ITER\n while (zx * zx + zy * zy < 4.0 && iter > 0) {\n val tmp = zx * zx - zy * zy + cX\n zy = 2.0 * zx * zy + cY\n zx = tmp\n iter--\n }\n img.setRGB(x, y, iter or (iter shl 7))\n }\n }\n }\n\n override fun paint(g: Graphics) {\n g.drawImage(img, 0, 0, this)\n }\n}\n\nfun main(args: Array<String>) {\n Mandelbrot().isVisible = true\n}\n","language":"Kotlin"},{"code":"{def mandel\n\n {def mandel.r\n {lambda {:iter :cx :cy :norm :x :y :count}\n {if {> :count :iter} // then norm < 4\n then o // inside the set\n else {if {> :norm 4} // then iter > max\n then . // outside the set\n else {let { {:cx :cx} {:cy :cy} {:iter :iter}\n {:X {+ {* :x :x} -{* :y :y} :cx}} // compute\n {:Y {+ {* 2 :x :y} :cy}} // z = z^2+c\n {:count {+ :count 1}}\n } {mandel.r :iter :cx :cy\n {+ {* :X :X} {* :Y :Y}} // the norm\n :X :Y :count} }}}}}\n\n {lambda {:iter :cx :cy}\n {mandel.r :iter\n {+ {* :cx 0.05} -1.50} // centering the set\n {+ {* :cy 0.05} -0.75} // inside the frame\n 0 0 0 0} }}\n-> mandel\n\nWe call mandel directly in the wiki page\n\n{S.map {lambda {:i} {br} // loop on y\n {S.map {{lambda {:i :j} // loop on x\n {mandel 20 :i :j}} :i} // compute\n {S.serie 0 30}}} // x resolution\n{S.serie 0 40}} // y resolution\n","language":"Lambdatalk"},{"code":": d2c(*,*) 2 compress 'c dress ; # Make a complex number.\n\n: iterate(c) [0 0](c) \"dup * over +\" steps reshape execute ;\n\n: print_line(*) \"#*+-. \" \"\" split swap subscript \"\" join . \"\\n\" . ;\n\n75 iota 45 - 20 / # x coordinates\n29 iota 14 - 10 / # y cordinates\n'd2c outer # Make complex matrix.\n\n10 'steps set # How many iterations?\n\niterate abs int 5 min 'print_line apply # Compute & print\n","language":"Lang5"},{"code":"define mandelbrotBailout => 16\ndefine mandelbrotMaxIterations => 1000\n\ndefine mandelbrotIterate(x, y) => {\n\tlocal(cr = #y - 0.5,\n\t\tci = #x,\n\t\tzi = 0.0,\n\t\tzr = 0.0,\n\t\ti = 0,\n\t\ttemp, zr2, zi2)\n\n\t{\n\t\t++#i;\n\t\t#temp = #zr * #zi\n\t\t#zr2 = #zr * #zr\n\t\t#zi2 = #zi * #zi\n\t\t\t\t\n\t\t#zi2 + #zr2 > mandelbrotBailout?\n\t\t\treturn #i\n\t\t#i > mandelbrotMaxIterations?\n\t\t\treturn 0\n\n\t\t#zr = #zr2 - #zi2 + #cr\n\t\t#zi = #temp + #temp + #ci\n\t\t\n\t\tcurrentCapture->restart\n\t}()\n}\n\ndefine mandelbrotTest() => {\n\tlocal(x, y = -39.0)\n\t{\n\t\tstdout('\\n')\n\t\t#x = -39.0\n\t\t{\n\t\t\tmandelbrotIterate(#x / 40.0, #y / 40.0) == 0?\n\t\t\t\tstdout('*')\n\t\t\t\t| stdout(' ');\n\t\t\t++#x\n\t\t\t#x <= 39.0?\n\t\t\t\tcurrentCapture->restart\n\t\t}();\n\t\t++#y\n\t\t\n\t\t#y <= 39.0?\n\t\t\tcurrentCapture->restart\n\t}()\n\tstdout('\\n')\n}\n\nmandelbrotTest\n","language":"Lasso"},{"code":"\\documentclass{minimal}\n\\usepackage{tikz}\n\\usetikzlibrary{shadings}\n\\begin{document}\n\\begin{tikzpicture}\n \\shade[shading=Mandelbrot set] (0,0) rectangle (4,4);\n\\end{tikzpicture}\n\\end{document}\n","language":"LaTeX"},{"code":"nomainwin\n\nWindowWidth =440\nWindowHeight =460\n\nopen \"Mandelbrot Set\" for graphics_nsb_nf as #w\n\n#w \"trapclose [quit]\"\n#w \"down\"\n\nfor x0 = -2 to 1 step .0033\n for y0 = -1.5 to 1.5 step .0075\n x = 0\n y = 0\n\n iteration = 0\n maxIteration = 255\n\n while ( ( x *x +y *y) <=4) and ( iteration <maxIteration)\n xtemp =x *x -y *y +x0\n y =2 *x *y +y0\n x = xtemp\n iteration = iteration + 1\n wend\n\n if iteration <>maxIteration then\n c =iteration\n else\n c =0\n end if\n\n call pSet x0, y0, c\n scan\n next\nnext\n\n#w \"flush\"\n\nwait\n\nsub pSet x, y, c\n xScreen = 10 +( x +2) /3 *400\n yScreen = 10 +( y +1.5) /3 *400\n if c =0 then\n col$ =\"red\"\n else\n if c mod 2 =1 then col$ =\"lightgray\" else col$ =\"white\"\n end if\n #w \"color \"; col$\n #w \"set \"; xScreen; \" \"; yScreen\nend sub\n\n[quit]\nclose #w\nend\n","language":"Liberty-BASIC"},{"code":"#\n# A mandelbrot generator that outputs a PBM file. This can be used to measure\n# performance differences between LIL versions and measure performance\n# bottlenecks (although keep in mind that LIL is not supposed to be a fast\n# language, but a small one which depends on C for the slow parts - in a real\n# program where for some reason mandelbrots are required, the code below would\n# be written in C). The code is based on the mandelbrot test for the Computer\n# Language Benchmarks Game at http://shootout.alioth.debian.org/\n#\n# In my current computer (Intel Core2Quad Q9550 @ 2.83GHz) running x86 Linux\n# the results are (using the default 256x256 size):\n#\n# 2m3.634s - commit 1c41cdf89f4c1e039c9b3520c5229817bc6274d0 (Jan 10 2011)\n#\n# To test call\n#\n# time ./lil mandelbrot.lil > mandelbrot.pbm\n#\n# with an optimized version of lil (compiled with CFLAGS=-O3 make).\n#\n\nset width [expr $argv]\nif not $width { set width 256 }\nset height $width\nset bit_num 0\nset byte_acc 0\nset iter 50\nset limit 2.0\n\nwrite \"P4\\n${width} ${height}\\n\"\n\nfor {set y 0} {$y < $height} {inc y} {\n for {set x 0} {$x < $width} {inc x} {\n set Zr 0.0 Zi 0.0 Tr 0.0 Ti 0.0\n set Cr [expr 2.0 * $x / $width - 1.5]\n set Ci [expr 2.0 * $y / $height - 1.0]\n for {set i 0} {$i < $iter && $Tr + $Ti <= $limit * $limit} {inc i} {\n set Zi [expr 2.0 * $Zr * $Zi + $Ci]\n set Zr [expr $Tr - $Ti + $Cr]\n set Tr [expr $Zr * $Zr]\n set Ti [expr $Zi * $Zi]\n }\n\n set byte_acc [expr $byte_acc << 1]\n if [expr $Tr + $Ti <= $limit * $limit] {\n set byte_acc [expr $byte_acc | 1]\n }\n\n inc bit_num\n\n if [expr $bit_num == 8] {\n writechar $byte_acc\n set byte_acc 0\n set bit_num 0\n } {if [expr $x == $width - 1] {\n set byte_acc [expr 8 - $width % 8]\n writechar $byte_acc\n set byte_acc 0\n set bit_num 0\n }}\n }\n}\n","language":"LIL"},{"code":"1 MODE 3 ' Note the CPCBasic-only screen mode!\n2 FOR xp = 0 TO 639\n3 FOR yp = 0 TO 399\n4 x = 0 : y = 0\n5 x0 = xp / 213 - 2 : y0 = yp / 200 - 1\n6 iteration = 0\n7 maxIteration = 100\n8 WHILE (x * x + y * y <= (2 * 2) AND iteration < maxIteration)\n9 xtemp = x * x - y * y + x0\n10 y = 2 * x * y + y0\n11 x = xtemp\n12 iteration = iteration + 1\n13 WEND\n14 IF iteration <> maxIteration THEN c = iteration ELSE c = 0\n15 PLOT xp, yp, c MOD 16\n16 NEXT\n17 NEXT\n","language":"Locomotive-Basic"},{"code":"to mandelbrot :left :bottom :side :size\n cs setpensize [1 1]\n make \"inc :side/:size\n make \"zr :left\n repeat :size [\n make \"zr :zr + :inc\n make \"zi :bottom\n pu\n setxy repcount - :size/2 minus :size/2\n pd\n repeat :size [\n make \"zi :zi + :inc\n setpencolor count.color calc :zr :zi\n fd 1 ] ]\nend\n\nto count.color :count\n ;op (list :count :count :count)\n if :count > 256 [op 0]\t; black\n if :count > 128 [op 7]\t; white\n if :count > 64 [op 5]\t; magenta\n if :count > 32 [op 6]\t; yellow\n if :count > 16 [op 4]\t; red\n if :count > 8 [op 2]\t; green\n if :count > 4 [op 1]\t; blue\n op 3\t\t\t\t; cyan\nend\n\nto calc :zr :zi [:count 0] [:az 0] [:bz 0]\n if :az*:az + :bz*:bz > 4 [op :count]\n if :count > 256 [op :count]\n op (calc :zr :zi (:count + 1) (:zr + :az*:az - :bz*:bz) (:zi + 2*:az*:bz))\nend\n\nmandelbrot -2 -1.25 2.5 400\n","language":"Logo"},{"code":"local maxIterations = 250\nlocal minX, maxX, minY, maxY = -2.5, 2.5, -2.5, 2.5\nlocal miX, mxX, miY, mxY\nfunction remap( x, t1, t2, s1, s2 )\n local f = ( x - t1 ) / ( t2 - t1 )\n local g = f * ( s2 - s1 ) + s1\n return g;\nend\nfunction drawMandelbrot()\n local pts, a, as, za, b, bs, zb, cnt, clr = {}\n for j = 0, hei - 1 do\n for i = 0, wid - 1 do\n a = remap( i, 0, wid, minX, maxX )\n b = remap( j, 0, hei, minY, maxY )\n cnt = 0; za = a; zb = b\n while( cnt < maxIterations ) do\n as = a * a - b * b; bs = 2 * a * b\n a = za + as; b = zb + bs\n if math.abs( a ) + math.abs( b ) > 16 then break end\n cnt = cnt + 1\n end\n if cnt == maxIterations then clr = 0\n else clr = remap( cnt, 0, maxIterations, 0, 255 )\n end\n pts[1] = { i, j, clr, clr, 0, 255 }\n love.graphics.points( pts )\n end\n end\nend\nfunction startFractal()\n love.graphics.setCanvas( canvas ); love.graphics.clear()\n love.graphics.setColor( 255, 255, 255 )\n drawMandelbrot(); love.graphics.setCanvas()\nend\nfunction love.load()\n wid, hei = love.graphics.getWidth(), love.graphics.getHeight()\n canvas = love.graphics.newCanvas( wid, hei )\n startFractal()\nend\nfunction love.mousepressed( x, y, button, istouch )\n if button == 1 then\n startDrag = true; miX = x; miY = y\n else\n minX = -2.5; maxX = 2.5; minY = minX; maxY = maxX\n startFractal()\n startDrag = false\n end\nend\nfunction love.mousereleased( x, y, button, istouch )\n if startDrag then\n local l\n if x > miX then mxX = x\n else l = x; mxX = miX; miX = l\n end\n if y > miY then mxY = y\n else l = y; mxY = miY; miY = l\n end\n miX = remap( miX, 0, wid, minX, maxX )\n mxX = remap( mxX, 0, wid, minX, maxX )\n miY = remap( miY, 0, hei, minY, maxY )\n mxY = remap( mxY, 0, hei, minY, maxY )\n minX = miX; maxX = mxX; minY = miY; maxY = mxY\n startFractal()\n end\nend\nfunction love.draw()\n love.graphics.draw( canvas )\nend\n","language":"Lua"},{"code":"-- Mandelbrot set in Lua 6/15/2020 db\nlocal charmap = { [0]=\" \", \".\", \":\", \"-\", \"=\", \"+\", \"*\", \"#\", \"%\", \"@\" }\nfor y = -1.3, 1.3, 0.1 do\n for x = -2.1, 1.1, 0.04 do\n local zi, zr, i = 0, 0, 0\n while i < 100 do\n if (zi*zi+zr*zr >= 4) then break end\n zr, zi, i = zr*zr-zi*zi+x, 2*zr*zi+y, i+1\n end\n io.write(charmap[i%10])\n end\n print()\nend\n","language":"Lua"},{"code":"for y=-12,12 do l=\"\"for x=-2,1,3/80 do a,b,n=0,0,-15 while n<9 and a*a+b*b<1e12\ndo a,b,n=a*a-b*b+x,2*a*b+y/8,n+1 end l=l..(\".,:;=$%# \"):sub(n,n)end print(l)end\n","language":"Lua"},{"code":"Module Mandelbrot(x=0&,y=0&,z=1&) {\n If z<1 then z=1\n If z>16 then z=16\n Const iXmax=32*z\n Const iYmax=26*z\n Def single Cx, Cy, CxMin=-2.05, CxMax=0.85, CyMin=-1.2, CyMax=1.2\n Const PixelWidth=(CxMax-CxMin)/iXmax, iXm=(iXmax-1)*PixelWidth\n Const PixelHeight=(CyMax-CyMin)/iYmax,Ph2=PixelHeight/2\n Const Iteration=25\n Const EscRadious=2.5, ER2=EscRadious**2\n Def single preview\n preview=iXmax*twipsX*(z/16)\n Def long yp, xp, dx, dy, dx1, dy1\n Let dx=twipsx*(16/z), dx1=dx-1\n Let dy=twipsy*(16/z), dy1=dy-1\n yp=y\n For iY=0 to (iYmax-1)*PixelHeight step PixelHeight {\n Cy=CyMin+iY\n xp=x\n if abs(Cy)<Ph2 Then Cy=0\n For iX=0 to iXm Step PixelWidth {\n Let Cx=CxMin+iX,Zx=0,Zy=0,Zx2=0,Zy2=0\n For It=Iteration to 1 {Let Zy=2*Zx*Zy+Cy,Zx=Zx2-Zy2+Cx,Zx2=Zx**2,Zy2=Zy**2 :if Zx2+Zy2>ER2 Then exit\n }\n if it>13 then {it-=13} else.if it=0 then SetPixel(xp,yp,0): xp+=dx : continue\n it*=10:SetPixel(xp,yp,color(it, it,255)) :xp+=dx\n } : yp+=dy\n }\n Sub SetPixel()\n move number, number: fill dx1, dy1, number\n End Sub\n}\nCls 1,0\nsz=(1,2,4,8,16)\ni=each(sz)\nWhile i {\n Mandelbrot 250*twipsx,100*twipsy, array(i)\n}\n","language":"M2000-Interpreter"},{"code":"Module Mandelbrot(x=0&,y=0&,z=1&) {\n If z<1 then z=1\n If z>16 then z=16\n Const iXmax=32*z\n Const iYmax=26*z\n Def single Cx, Cy, CxMin=-2.05, CxMax=0.85, CyMin=-1.2, CyMax=1.2\n Const PixelWidth=(CxMax-CxMin)/iXmax, iXm=(iXmax-1)*PixelWidth\n Const PixelHeight=(CyMax-CyMin)/iYmax,Ph2=PixelHeight/2\n Const Iteration=25\n Const EscRadious=2.5, ER2=EscRadious**2\n Def single preview\n preview=iXmax*twipsX*(z/16)\n Def long yp, xp, dx, dy, dx1, dy1\n Let dx=twipsx*(16/z), dx1=dx-1\n Let dy=twipsy*(16/z), dy1=dy-1\n yp=y\n Refresh 2000\n For iY=0 to (iYmax-1)*PixelHeight step PixelHeight {\n Cy=CyMin+iY\n xp=x\n if abs(Cy)<Ph2 Then Cy=0\n move xp, yp\n For iX=0 to iXm Step PixelWidth {\n Let Cx=CxMin+iX,Zx=0,Zy=0,Zx2=0,Zy2=0\n For It=Iteration to 1 {Let Zy=2*Zx*Zy+Cy,Zx=Zx2-Zy2+Cx,Zx2=Zx**2,Zy2=Zy**2 :if Zx2+Zy2>ER2 Then exit\n }\n if it>13 then {it-=13} else.if it=0 then fill dx1, dy1, 0: Step 0,-dy1: continue\n it*=10:fill dx1, dy1, color(it, it,255): Step 0,-dy1\n } : yp+=dy\n }\n\n}\nCls 1,0\nsz=(1,2,4,8,16)\ni=each(sz)\nWhile i {\n Mandelbrot 250*twipsx,100*twipsy, array(i)\n}\n","language":"M2000-Interpreter"},{"code":"divert(-1)\nchangecom\ndefine(`newline',`\n')\ndefine(`leftquote',`[')\ndefine(`rightquote',`]')\nchangequote(`[',`]')\ndefine([print_char],\n[ifelse(\n$1,0,[*],\n$1,1,[*],\n$1,2,[*],\n$1,3,[*],\n$1,4,[*],\n$1,5,[*],\n$1,6,[*],\n$1,7,[*],\n$1,8,[*],\n$1,9,[*],\n$1,10,[newline],\n$1,11,[*],\n$1,12,[*],\n$1,13,[*],\n$1,14,[*],\n$1,15,[*],\n$1,16,[*],\n$1,17,[*],\n$1,18,[*],\n$1,19,[*],\n$1,20,[*],\n$1,21,[*],\n$1,22,[*],\n$1,23,[*],\n$1,24,[*],\n$1,25,[*],\n$1,26,[*],\n$1,27,[*],\n$1,28,[*],\n$1,29,[*],\n$1,30,[*],\n$1,31,[*],\n$1,32,[ ],\n$1,33,[!],\n$1,34,[\"],\n$1,35,[#],\n$1,36,[$],\n$1,37,[%],\n$1,38,[&],\n$1,39,['],\n$1,40,[(],\n$1,41,[)],\n$1,42,[*],\n$1,43,[+],\n$1,44,[,],\n$1,45,[-],\n$1,46,[.],\n$1,47,[/],\n$1,48,[0],\n$1,49,[1],\n$1,50,[2],\n$1,51,[3],\n$1,52,[4],\n$1,53,[5],\n$1,54,[6],\n$1,55,[7],\n$1,56,[8],\n$1,57,[9],\n$1,58,[:],\n$1,59,[;],\n$1,60,[<],\n$1,61,[=],\n$1,62,[>],\n$1,63,[?],\n$1,64,[@],\n$1,65,[A],\n$1,66,[B],\n$1,67,[C],\n$1,68,[D],\n$1,69,[E],\n$1,70,[F],\n$1,71,[G],\n$1,72,[H],\n$1,73,[I],\n$1,74,[J],\n$1,75,[K],\n$1,76,[L],\n$1,77,[M],\n$1,78,[N],\n$1,79,[O],\n$1,80,[P],\n$1,81,[Q],\n$1,82,[R],\n$1,83,[S],\n$1,84,[T],\n$1,85,[U],\n$1,86,[V],\n$1,87,[W],\n$1,88,[X],\n$1,89,[Y],\n$1,90,[Z],\n$1,91,[changequote([`],['])leftquote`'changequote(`[',`]')],\n$1,92,[\\],\n$1,93,[rightquote],\n$1,94,[^],\n$1,95,[_],\n$1,96,[`],\n$1,97,[a],\n$1,98,[b],\n$1,99,[c],\n$1,100,[d],\n$1,101,[e],\n$1,102,[f],\n$1,103,[g],\n$1,104,[h],\n$1,105,[i],\n$1,106,[j],\n$1,107,[k],\n$1,108,[l],\n$1,109,[m],\n$1,110,[n],\n$1,111,[o],\n$1,112,[p],\n$1,113,[q],\n$1,114,[r],\n$1,115,[s],\n$1,116,[t],\n$1,117,[u],\n$1,118,[v],\n$1,119,[w],\n$1,120,[x],\n$1,121,[y],\n$1,122,[z],\n$1,123,[{],\n$1,124,[|],\n$1,125,[}],\n$1,126,[~],\n[*])])\ndefine([stack_1st],[substr([$1],0,index([$1],[:]))])\ndefine([stack_2nd],[stack_1st(stack_drop([$1]))])\ndefine([stack_drop],[substr([$1],eval(index([$1],[:]) [+ 1]))])\ndefine([stack_drop2],[stack_drop(stack_drop([$1]))])\ndefine([stack_not],[eval(stack_1st([$1]) [== 0]):stack_drop([$1])])\ndefine([stack_neg],[eval([-] stack_1st([$1])):stack_drop([$1])])\ndefine([stack_and],[eval(stack_2nd([$1] [!= 0]) [&&] stack_1st([$1] [!= 0])):stack_drop2([$1])])\ndefine([stack_or],[eval(stack_2nd([$1] [!= 0]) [||] stack_1st([$1] [!= 0])):stack_drop2([$1])])\ndefine([stack_lt],[eval(stack_2nd([$1]) [<] stack_1st([$1])):stack_drop2([$1])])\ndefine([stack_le],[eval(stack_2nd([$1]) [<=] stack_1st([$1])):stack_drop2([$1])])\ndefine([stack_gt],[eval(stack_2nd([$1]) [>] stack_1st([$1])):stack_drop2([$1])])\ndefine([stack_ge],[eval(stack_2nd([$1]) [>=] stack_1st([$1])):stack_drop2([$1])])\ndefine([stack_eq],[eval(stack_2nd([$1]) [==] stack_1st([$1])):stack_drop2([$1])])\ndefine([stack_ne],[eval(stack_2nd([$1]) [!=] stack_1st([$1])):stack_drop2([$1])])\ndefine([stack_add],[eval(stack_2nd([$1]) [+] stack_1st([$1])):stack_drop2([$1])])\ndefine([stack_sub],[eval(stack_2nd([$1]) [-] stack_1st([$1])):stack_drop2([$1])])\ndefine([stack_mul],[eval(stack_2nd([$1]) [*] stack_1st([$1])):stack_drop2([$1])])\ndefine([stack_div],[eval(stack_2nd([$1]) [/] stack_1st([$1])):stack_drop2([$1])])\ndefine([stack_mod],[eval(stack_2nd([$1]) [%] stack_1st([$1])):stack_drop2([$1])])\ndefine([prtc_1st],[print_char(stack_1st([$1]))])\ndefine([prti_1st],[stack_1st([$1])])\ndefine([prts_1st],[print_string(stack_1st([$1]))])\ndefine([store],[define([_tmp1],index([$2],[$1:]))[]substr([$2],0,_tmp1)[$1:$3]define([_tmp2],substr([$2],eval(_tmp1 + len([$1]) [+ 1])))substr(_tmp2,index(_tmp2,[:]))])\ndefine([fetch],[define([_tmp],substr([$2],eval(index([$2],[$1:]) [+] len([$1]) [+ 1])))[]substr(_tmp,0,index(_tmp,[:]))])\ndefine([initial_vars],[var0:0:var1:0:var2:0:var3:0:var4:0:var5:0:var6:0:var7:0:var8:0:var9:0:var10:0:var11:0:var12:0:var13:0:var14:0:])\ndefine([kont0],[kont5([420:$1],[$2])])\ndefine([kont5],[kont6(stack_neg([$1]),[$2])])\ndefine([kont6],[kont11(stack_drop([$1]),store([var0],[$2],stack_1st([$1])))])\ndefine([kont11],[kont16([300:$1],[$2])])\ndefine([kont16],[kont21(stack_drop([$1]),store([var1],[$2],stack_1st([$1])))])\ndefine([kont21],[kont26([300:$1],[$2])])\ndefine([kont26],[kont31(stack_drop([$1]),store([var2],[$2],stack_1st([$1])))])\ndefine([kont31],[kont36([300:$1],[$2])])\ndefine([kont36],[kont37(stack_neg([$1]),[$2])])\ndefine([kont37],[kont42(stack_drop([$1]),store([var3],[$2],stack_1st([$1])))])\ndefine([kont42],[kont47([7:$1],[$2])])\ndefine([kont47],[kont52(stack_drop([$1]),store([var4],[$2],stack_1st([$1])))])\ndefine([kont52],[kont57([15:$1],[$2])])\ndefine([kont57],[kont62(stack_drop([$1]),store([var5],[$2],stack_1st([$1])))])\ndefine([kont62],[kont67([200:$1],[$2])])\ndefine([kont67],[kont72(stack_drop([$1]),store([var6],[$2],stack_1st([$1])))])\ndefine([kont72],[kont77(fetch([var2],[$2])[:$1],[$2])])\ndefine([kont77],[kont82(stack_drop([$1]),store([var7],[$2],stack_1st([$1])))])\ndefine([kont82],[kont87(fetch([var7],[$2])[:$1],[$2])])\ndefine([kont87],[kont92(fetch([var3],[$2])[:$1],[$2])])\ndefine([kont92],[kont93(stack_gt([$1]),[$2])])\ndefine([kont93],[ifelse(eval(stack_1st([$1]) [== 0]),1,[kont423(stack_drop([$1]),[$2])],[kont98(stack_drop([$1]),[$2])])])\ndefine([kont98],[kont103(fetch([var0],[$2])[:$1],[$2])])\ndefine([kont103],[kont108(stack_drop([$1]),store([var8],[$2],stack_1st([$1])))])\ndefine([kont108],[kont113(fetch([var8],[$2])[:$1],[$2])])\ndefine([kont113],[kont118(fetch([var1],[$2])[:$1],[$2])])\ndefine([kont118],[kont119(stack_lt([$1]),[$2])])\ndefine([kont119],[ifelse(eval(stack_1st([$1]) [== 0]),1,[kont396(stack_drop([$1]),[$2])],[kont124(stack_drop([$1]),[$2])])])\ndefine([kont124],[kont129([0:$1],[$2])])\ndefine([kont129],[kont134(stack_drop([$1]),store([var9],[$2],stack_1st([$1])))])\ndefine([kont134],[kont139([0:$1],[$2])])\ndefine([kont139],[kont144(stack_drop([$1]),store([var10],[$2],stack_1st([$1])))])\ndefine([kont144],[kont149([32:$1],[$2])])\ndefine([kont149],[kont154(stack_drop([$1]),store([var11],[$2],stack_1st([$1])))])\ndefine([kont154],[kont159([0:$1],[$2])])\ndefine([kont159],[kont164(stack_drop([$1]),store([var12],[$2],stack_1st([$1])))])\ndefine([kont164],[kont169(fetch([var12],[$2])[:$1],[$2])])\ndefine([kont169],[kont174(fetch([var6],[$2])[:$1],[$2])])\ndefine([kont174],[kont175(stack_lt([$1]),[$2])])\ndefine([kont175],[ifelse(eval(stack_1st([$1]) [== 0]),1,[kont369(stack_drop([$1]),[$2])],[kont180(stack_drop([$1]),[$2])])])\ndefine([kont180],[kont185(fetch([var10],[$2])[:$1],[$2])])\ndefine([kont185],[kont190(fetch([var10],[$2])[:$1],[$2])])\ndefine([kont190],[kont191(stack_mul([$1]),[$2])])\ndefine([kont191],[kont196([200:$1],[$2])])\ndefine([kont196],[kont197(stack_div([$1]),[$2])])\ndefine([kont197],[kont202(stack_drop([$1]),store([var13],[$2],stack_1st([$1])))])\ndefine([kont202],[kont207(fetch([var9],[$2])[:$1],[$2])])\ndefine([kont207],[kont212(fetch([var9],[$2])[:$1],[$2])])\ndefine([kont212],[kont213(stack_mul([$1]),[$2])])\ndefine([kont213],[kont218([200:$1],[$2])])\ndefine([kont218],[kont219(stack_div([$1]),[$2])])\ndefine([kont219],[kont224(stack_drop([$1]),store([var14],[$2],stack_1st([$1])))])\ndefine([kont224],[kont229(fetch([var13],[$2])[:$1],[$2])])\ndefine([kont229],[kont234(fetch([var14],[$2])[:$1],[$2])])\ndefine([kont234],[kont235(stack_add([$1]),[$2])])\ndefine([kont235],[kont240([800:$1],[$2])])\ndefine([kont240],[kont241(stack_gt([$1]),[$2])])\ndefine([kont241],[ifelse(eval(stack_1st([$1]) [== 0]),1,[kont298(stack_drop([$1]),[$2])],[kont246(stack_drop([$1]),[$2])])])\ndefine([kont246],[kont251([48:$1],[$2])])\ndefine([kont251],[kont256(fetch([var12],[$2])[:$1],[$2])])\ndefine([kont256],[kont257(stack_add([$1]),[$2])])\ndefine([kont257],[kont262(stack_drop([$1]),store([var11],[$2],stack_1st([$1])))])\ndefine([kont262],[kont267(fetch([var12],[$2])[:$1],[$2])])\ndefine([kont267],[kont272([9:$1],[$2])])\ndefine([kont272],[kont273(stack_gt([$1]),[$2])])\ndefine([kont273],[ifelse(eval(stack_1st([$1]) [== 0]),1,[kont288(stack_drop([$1]),[$2])],[kont278(stack_drop([$1]),[$2])])])\ndefine([kont278],[kont283([64:$1],[$2])])\ndefine([kont283],[kont288(stack_drop([$1]),store([var11],[$2],stack_1st([$1])))])\ndefine([kont288],[kont293(fetch([var6],[$2])[:$1],[$2])])\ndefine([kont293],[kont298(stack_drop([$1]),store([var12],[$2],stack_1st([$1])))])\ndefine([kont298],[kont303(fetch([var10],[$2])[:$1],[$2])])\ndefine([kont303],[kont308(fetch([var9],[$2])[:$1],[$2])])\ndefine([kont308],[kont309(stack_mul([$1]),[$2])])\ndefine([kont309],[kont314([100:$1],[$2])])\ndefine([kont314],[kont315(stack_div([$1]),[$2])])\ndefine([kont315],[kont320(fetch([var7],[$2])[:$1],[$2])])\ndefine([kont320],[kont321(stack_add([$1]),[$2])])\ndefine([kont321],[kont326(stack_drop([$1]),store([var9],[$2],stack_1st([$1])))])\ndefine([kont326],[kont331(fetch([var13],[$2])[:$1],[$2])])\ndefine([kont331],[kont336(fetch([var14],[$2])[:$1],[$2])])\ndefine([kont336],[kont337(stack_sub([$1]),[$2])])\ndefine([kont337],[kont342(fetch([var8],[$2])[:$1],[$2])])\ndefine([kont342],[kont343(stack_add([$1]),[$2])])\ndefine([kont343],[kont348(stack_drop([$1]),store([var10],[$2],stack_1st([$1])))])\ndefine([kont348],[kont353(fetch([var12],[$2])[:$1],[$2])])\ndefine([kont353],[kont358([1:$1],[$2])])\ndefine([kont358],[kont359(stack_add([$1]),[$2])])\ndefine([kont359],[kont364(stack_drop([$1]),store([var12],[$2],stack_1st([$1])))])\ndefine([kont364],[kont164([$1],[$2])])\ndefine([kont369],[kont374(fetch([var11],[$2])[:$1],[$2])])\ndefine([kont374],[prtc_1st([$1])[]kont375(stack_drop([$1]),[$2])])\ndefine([kont375],[kont380(fetch([var8],[$2])[:$1],[$2])])\ndefine([kont380],[kont385(fetch([var4],[$2])[:$1],[$2])])\ndefine([kont385],[kont386(stack_add([$1]),[$2])])\ndefine([kont386],[kont391(stack_drop([$1]),store([var8],[$2],stack_1st([$1])))])\ndefine([kont391],[kont108([$1],[$2])])\ndefine([kont396],[kont401([10:$1],[$2])])\ndefine([kont401],[prtc_1st([$1])[]kont402(stack_drop([$1]),[$2])])\ndefine([kont402],[kont407(fetch([var7],[$2])[:$1],[$2])])\ndefine([kont407],[kont412(fetch([var5],[$2])[:$1],[$2])])\ndefine([kont412],[kont413(stack_sub([$1]),[$2])])\ndefine([kont413],[kont418(stack_drop([$1]),store([var7],[$2],stack_1st([$1])))])\ndefine([kont418],[kont82([$1],[$2])])\ndefine([kont423],[])\ndivert[]dnl\nkont0([stack-bottom],initial_vars)[]dnl\n","language":"M4"},{"code":"ImageTools:-Embed(Fractals[EscapeTime]:-Mandelbrot(500, -2.0-1.35*I, .7+1.35*I, output = layer1));\n","language":"Maple"},{"code":"eTime[c_, maxIter_Integer: 100] := Length@NestWhileList[#^2 + c &, 0, Abs@# <= 2 &, 1, maxIter] - 1\n\nDistributeDefinitions[eTime];\nmesh = ParallelTable[eTime[x + I*y, 1000], {y, 1.2, -1.2, -0.01}, {x, -1.72, 1, 0.01}];\nReliefPlot[mesh, Frame -> False]\n","language":"Mathematica"},{"code":"cf = With[{\n mandel = Block[{z = #, c = #},\n Catch@Do[If[Abs[z] > 2, Throw@i]; z = z^2 + c, {i, 100}]] &\n },\n Compile[{},Table[mandel[y + x I], {x, -1, 1, 0.005}, {y, -2, 0.5, 0.005}]]\n ];\nArrayPlot[cf[]]\n","language":"Mathematica"},{"code":"MandelbrotSetPlot[]\n","language":"Mathematica"},{"code":"function [theSet,realAxis,imaginaryAxis] = mandelbrotSet(start,gridSpacing,last,maxIteration)\n\n %Define the escape time algorithm\n function escapeTime = escapeTimeAlgorithm(z0)\n\n escapeTime = 0;\n z = 0;\n\n while( (abs(z)<=2) && (escapeTime < maxIteration) )\n z = (z + z0)^2;\n escapeTime = escapeTime + 1;\n end\n\n end\n\n %Define the imaginary axis\n imaginaryAxis = (imag(start):imag(gridSpacing):imag(last));\n\n %Define the real axis\n realAxis = (real(start):real(gridSpacing):real(last));\n\n %Construct the complex plane from the real and imaginary axes\n complexPlane = meshgrid(realAxis,imaginaryAxis) + meshgrid(imaginaryAxis(end:-1:1),realAxis)'.*i;\n\n %Apply the escape time algorithm to each point in the complex plane\n theSet = arrayfun(@escapeTimeAlgorithm, complexPlane);\n\n\n %Draw the set\n pcolor(realAxis,imaginaryAxis,theSet);\n shading flat;\n\nend\n","language":"MATLAB"},{"code":"mandelbrotSet(-2.05-1.2i,0.004+0.0004i,0.45+1.2i,500);\n","language":"MATLAB"},{"code":"mandelbrot ([iterations, 30], [x, -2.4, 0.75], [y, -1.2, 1.2],\n [grid,320,320])$\n","language":"Maxima"},{"code":"prologues:=3;\noutputtemplate:=\"%j-%c.svg\";\noutputformat:=\"svg\";\n\n\ndef mandelbrot(expr maxX, maxY) =\n max_iteration := 500;\n\n color col[];\n for i := 0 upto max_iteration:\n t := i / max_iteration;\n col[i] = (t,t,t);\n endfor;\n\n\n for px := 0 upto maxX:\n for py := 0 upto maxY:\n xz := px * 3.5 / maxX - 2.5; % (-2.5,1)\n yz := py * 2 / maxY - 1; % (-1,1)\n\n x := 0;\n y := 0;\n\n iteration := 0;\n\n forever: exitunless ((x*x + y*y < 4) and (iteration < max_iteration));\n xtemp := x*x - y*y + xz;\n y := 2*x*y + yz;\n x := xtemp;\n iteration := iteration + 1;\n endfor;\n\n draw (px,py) withpen pencircle withcolor col[iteration];\n\n endfor;\n endfor;\nenddef;\n\n\nbeginfig(1);\n mandelbrot(200, 150);\nendfig;\n\nend\n","language":"Metapost"},{"code":"mpost -numbersystem=\"double\" mandelbrot.mp\n","language":"Metapost"},{"code":"GraphicsWindow.Show()\nsize = 500\nhalf = 250\nGraphicsWindow.Width = size * 1.5\nGraphicsWindow.Height = size\nGraphicsWindow.Title = \"Mandelbrot\"\nFor px = 1 To size * 1.5\n x_0 = px/half - 2\n For py = 1 To size\n y_0 = py/half - 1\n x = x_0\n y = y_0\n i = 0\n While(c <= 2 AND i<100)\n x_1 = Math.Power(x, 2) - Math.Power(y, 2) + x_0\n y_1 = 2 * x * y + y_0\n c = Math.Power(Math.Power(x_1, 2) + Math.Power(y_1, 2), 0.5)\n x = x_1\n y = y_1\n i = i + 1\n EndWhile\n If i < 99 Then\n GraphicsWindow.SetPixel(px, py, GraphicsWindow.GetColorFromRGB((255/25)*i, (255/25)*i, (255/5)*i))\n Else\n GraphicsWindow.SetPixel(px, py, \"black\")\n EndIf\n c=0\n EndFor\nEndFor\n","language":"Microsoft-Small-Basic"},{"code":"ZOOM = 100\nMAX_ITER = 40\ngfx.clear color.black\nfor y in range(0,200)\n\tfor x in range(0,300)\n\t\tzx = 0\n\t\tzy = 0\n\t\tcx = (x - 200) / ZOOM\n\t\tcy = (y - 100) / ZOOM\n\t\tfor iter in range(MAX_ITER)\n\t\t\tif zx*zx + zy*zy > 4 then break\n\t\t\ttmp = zx * zx - zy * zy + cx\n\t\t\tzy = 2 * zx * zy + cy\n\t\t\tzx = tmp\n\t\tend for\n\t\tif iter then\n\t\t\tgfx.setPixel x, y, rgb(255-iter*6, 0, iter*6)\n\t\tend if\n\tend for\nend for\n","language":"MiniScript"},{"code":"MODULE Mandelbrot EXPORTS Main;\n\nIMPORT Wr, Stdio, Fmt, Word;\n\nCONST m = 50;\n limit2 = 4.0;\n\nTYPE UByte = BITS 8 FOR [0..16_FF];\n\nVAR width := 200;\n height := 200;\n bitnum: CARDINAL := 0;\n byteacc: UByte := 0;\n isOverLimit: BOOLEAN;\n Zr, Zi, Cr, Ci, Tr, Ti: REAL;\n\nBEGIN\n\n Wr.PutText(Stdio.stdout, \"P4\\n\" & Fmt.Int(width) & \" \" & Fmt.Int(height) & \"\\n\");\n\n FOR y := 0 TO height - 1 DO\n FOR x := 0 TO width - 1 DO\n Zr := 0.0; Zi := 0.0;\n Cr := 2.0 * FLOAT(x) / FLOAT(width) - 1.5;\n Ci := 2.0 * FLOAT(y) / FLOAT(height) - 1.0;\n\n FOR i := 1 TO m + 1 DO\n Tr := Zr*Zr - Zi*Zi + Cr;\n Ti := 2.0*Zr*Zi + Ci;\n Zr := Tr; Zi := Ti;\n isOverLimit := Zr*Zr + Zi*Zi > limit2;\n IF isOverLimit THEN EXIT; END;\n END;\n\n IF isOverLimit THEN\n byteacc := Word.Xor(Word.LeftShift(byteacc, 1), 16_00);\n ELSE\n byteacc := Word.Xor(Word.LeftShift(byteacc, 1), 16_01);\n END;\n\n INC(bitnum);\n\n IF bitnum = 8 THEN\n Wr.PutChar(Stdio.stdout, VAL(byteacc, CHAR));\n byteacc := 0;\n bitnum := 0;\n ELSIF x = width - 1 THEN\n byteacc := Word.LeftShift(byteacc, 8 - (width MOD 8));\n Wr.PutChar(Stdio.stdout, VAL(byteacc, CHAR));\n byteacc := 0;\n bitnum := 0\n END;\n Wr.Flush(Stdio.stdout);\n END;\n END;\nEND Mandelbrot.\n","language":"Modula-3"},{"code":"100 SCREEN 2\n110 CLS\n120 x1 = 256 : y1 = 192\n130 i1 = -1 : i2 = 1\n140 r1 = -2 : r2 = 1\n150 s1 = (r2-r1)/x1 : s2 = (i2-i1)/y1\n160 FOR y = 0 TO y1\n170 i3 = i1+s2*y\n180 FOR x = 0 TO x1\n190 r3 = r1+s1*x\n200 z1 = r3 : z2 = i3\n210 FOR n = 0 TO 30\n220 a = z1*z1 : b = z2*z2\n230 IF a+b > 4 GOTO 270\n240 z2 = 2*z1*z2+i3\n250 z1 = a-b+r3\n260 NEXT n\n270 PSET (x,y),n-16*INT(n/16)\n280 NEXT x\n290 NEXT y\n300 GOTO 300\n","language":"MSX-Basic"},{"code":"-- Table to contain all the data points\nCREATE TABLE points (\n c_re DOUBLE,\n c_im DOUBLE,\n z_re DOUBLE DEFAULT 0,\n z_im DOUBLE DEFAULT 0,\n znew_re DOUBLE DEFAULT 0,\n znew_im DOUBLE DEFAULT 0,\n steps INT DEFAULT 0,\n active CHAR DEFAULT 1\n);\n\nDELIMITER |\n\n-- Iterate over all the points in the table 'points'\nCREATE PROCEDURE itrt (IN n INT)\nBEGIN\n label: LOOP\n UPDATE points\n SET\n znew_re=POWER(z_re,2)-POWER(z_im,2)+c_re,\n znew_im=2*z_re*z_im+c_im,\n steps=steps+1\n WHERE active=1;\n UPDATE points SET\n z_re=znew_re,\n z_im=znew_im,\n active=IF(POWER(z_re,2)+POWER(z_im,2)>4,0,1)\n WHERE active=1;\n SET n = n - 1;\n IF n > 0 THEN\n ITERATE label;\n END IF;\n LEAVE label;\n END LOOP label;\nEND|\n\n-- Populate the table 'points'\nCREATE PROCEDURE populate (\n r_min DOUBLE,\n r_max DOUBLE,\n r_step DOUBLE,\n i_min DOUBLE,\n i_max DOUBLE,\n i_step DOUBLE)\nBEGIN\n DELETE FROM points;\n SET @rl = r_min;\n SET @a = 0;\n rloop: LOOP\n SET @im = i_min;\n SET @b = 0;\n iloop: LOOP\n INSERT INTO points (c_re, c_im)\n VALUES (@rl, @im);\n SET @b=@b+1;\n SET @im=i_min + @b * i_step;\n IF @im < i_max THEN\n ITERATE iloop;\n END IF;\n LEAVE iloop;\n END LOOP iloop;\n SET @a=@a+1;\n SET @rl=r_min + @a * r_step;\n IF @rl < r_max THEN\n ITERATE rloop;\n END IF;\n LEAVE rloop;\n END LOOP rloop;\nEND|\n\nDELIMITER ;\n\n-- Choose size and resolution of graph\n-- R_min, R_max, R_step, I_min, I_max, I_step\nCALL populate( -2.5, 1.5, 0.005, -2, 2, 0.005 );\n\n-- Calculate 50 iterations\nCALL itrt( 50 );\n\n-- Create the image (/tmp/image.ppm)\n-- Note, MySQL will not over-write an existing file and you may need\n-- administrator access to delete or move it\nSELECT @xmax:=COUNT(c_re) INTO @xmax FROM points GROUP BY c_im LIMIT 1;\nSELECT @ymax:=COUNT(c_im) INTO @ymax FROM points GROUP BY c_re LIMIT 1;\nSET group_concat_max_len=11*@xmax*@ymax;\nSELECT\n 'P3', @xmax, @ymax, 200,\n GROUP_CONCAT(\n CONCAT(\n IF( active=1, 0, 55+MOD(steps, 200) ), ' ',\n IF( active=1, 0, 55+MOD(POWER(steps,3), 200) ), ' ',\n IF( active=1, 0, 55+MOD(POWER(steps,2), 200) ) )\n ORDER BY c_im ASC, c_re ASC SEPARATOR ' ' )\n INTO OUTFILE '/tmp/image.ppm'\n FROM points;\n","language":"MySQL"},{"code":"10 REM Mandelbrot set\n20 CLS\n30 FOR I=0 TO 95\n40 LET X=(I-78)/48\n50 REM ** When X<>0\n60 FOR J=1 TO 22\n70 LET Y=(22-J)/30\n80 LET XA=0:X2=0\n90 LET YA=0:Y2=0\n100 LET ITER=0\n110 LET XTEMP=X2-Y2+X\n120 LET YA=2*XA*YA+Y:Y2=YA*YA\n130 LET XA=XTEMP:X2=XA*XA\n140 LET ITER=ITER+1\n150 IF X2+Y2<=4 AND ITER<200 THEN 110\n160 IF ITER=200 THEN SET(I,J):SET(I,44-J)\n170 NEXT J\n180 REM ** When X=0\n190 LET XA=0:X2=0\n200 LET ITER=0\n210 LET XA=X2+X:X2=XA*XA\n220 LET ITER=ITER+1\n230 IF X2<=4 AND ITER<200 THEN 210\n240 IF ITER=200 THEN SET(I,22)\n250 NEXT I\n290 REM ** Set up machine code INKEY$ command\n300 IF PEEK(1)<>0 THEN RESTORE 510\n310 DOKE 4100,3328:FOR A=3328 TO 3342 STEP 2\n320 READ B:DOKE A,B:NEXT A\n400 SCREEN 1,15\n410 PRINT \"Hit any key to exit.\";\n420 A=USR(0):IF A<0 THEN 420\n430 CLS\n440 END\n490 REM ** Data for machine code INKEY$\n500 DATA 25055,1080,-53,536,-20665,3370,-5664,0\n510 DATA 27085,14336,-13564,6399,18178,10927\n520 DATA -8179,233\n","language":"Nascom-BASIC"},{"code":"import complex\n\nproc inMandelbrotSet(c: Complex, maxEscapeIterations = 50): bool =\n result = true; var z: Complex\n for i in 0..maxEscapeIterations:\n z = z * z + c\n if abs2(z) > 4: return false\n\niterator steps(start, step: float, numPixels: int): float =\n for i in 0..numPixels:\n yield start + i.float * step\n\nproc mandelbrotImage(yStart, yStep, xStart, xStep: float, height, width: int): string =\n for y in steps(yStart, yStep, height):\n for x in steps(xStart, xStep, width):\n result.add(if complex(x, y).inMandelbrotSet: '*'\n else: ' ')\n result.add('\\n')\n\necho mandelbrotImage(1.0, -0.05, -2.0, 0.0315, 40, 80)\n","language":"Nim"},{"code":"import math, complex, lenientops\nimport imageman\n\nconst\n W = 800\n H = 600\n Zoom = 0.5\n MoveX = -0.5\n MoveY = 0.0\n MaxIter = 30\n\nfunc hsvToRgb(h, s, v: float): array[3, float] =\n let c = v * s\n let x = c * (1 - abs(((h / 60) mod 2) - 1))\n let m = v - c\n let (r, g, b) = if h < 60: (c, x, 0.0)\n elif h < 120: (x, c, 0.0)\n elif h < 180: (0.0, c, x)\n elif h < 240: (0.0, x, c)\n elif x < 300: (x, 0.0, c)\n else: (c, 0.0, x)\n result = [r + m, g + m, b + m]\n\n\nvar img = initImage[ColorRGBF64](W, H)\nfor x in 1..W:\n for y in 1..H:\n var i = MaxIter - 1\n let c = complex((2 * x - W) / (W * Zoom) + MoveX, (2 * y - H) / (H * Zoom) + MoveY)\n var z = c\n while abs(z) < 2 and i > 0:\n z = z * z + c\n dec i\n let color = hsvToRgb(i / MaxIter * 360, 1, i / MaxIter)\n img[x - 1, y - 1] = ColorRGBF64(color)\n\nimg.savePNG(\"mandelbrot.png\", compression = 9)\n","language":"Nim"},{"code":"# -*- ObjectIcon -*-\n\nimport graphics\nimport ipl.graphics\nimport io\nimport util(Math)\n\nprocedure main ()\n local w\n local width, height\n local xcenter, ycenter, pixels_per_unit, max_iter\n local zoom_ratio\n\n write (\"q or Q : quit\")\n write (\"left press : recenter\")\n write (\"+ : zoom in\")\n write (\"- : zoom in\")\n write (\"2 .. 9 : set zoom ratio\")\n write (\"o or O : restore original\")\n write (\"p or P : dump to a PNG\")\n\n width := 400\n height := 400\n\n pixels_per_unit := 150\n max_iter := 200\n zoom_ratio := 2\n xcenter := -0.75\n ycenter := 0.0\n\n w := Window().\n set_size(width, height).\n set_resize(&yes).\n set_bg(\"white\").\n set_canvas(\"normal\") | stop(&why)\n\n event_loop (w, xcenter, ycenter, pixels_per_unit, max_iter,\n zoom_ratio)\nend\n\nprocedure event_loop (w, xcenter, ycenter, pixels_per_unit,\n max_iter, zoom_ratio)\n local event\n local xy\n local png_number, png_name\n local redraw\n local width, height\n local xleft, ytop\n local i, j\n local cx, cy, step\n local iter, color\n\n png_number := 1\n\n redraw := &yes\n repeat\n {\n if \\redraw then\n {\n w.erase_area()\n\n step := 1.0 / pixels_per_unit\n\n width := w.get_width()\n height := w.get_height()\n\n xleft := xcenter - (width / (2.0 * pixels_per_unit))\n ytop := ycenter + (height / (2.0 * pixels_per_unit))\n\n cx := xleft\n cy := ytop\n\n j := 0\n i := 0\n\n redraw := &no\n }\n\n if j ~= height then\n {\n iter := count_mandelbrot_iterations (cx, cy, max_iter)\n color := map_iterations_to_color (max_iter, iter)\n w.set_fg (color)\n w.draw_point (i, j)\n i +:= 1; cx +:= step\n if i = width then\n {\n i := 0; cx := xleft\n j +:= 1; cy -:= step\n }\n }\n\n if *w.pending() ~= 0 then\n {\n event := w.event()\n case event[1] of\n {\n QuitEvents():\n exit()\n\n Mouse.LEFT_PRESS:\n {\n xy := window_coords_to_point (w, event[2], event[3],\n xcenter, ycenter,\n pixels_per_unit)\n xcenter := xy[1]\n ycenter := xy[2]\n redraw := &yes\n }\n\n \"+\":\n {\n pixels_per_unit := zoom_ratio * pixels_per_unit\n redraw := &yes\n }\n\n \"-\":\n {\n pixels_per_unit :=\n max (1, (1.0 / zoom_ratio) * pixels_per_unit)\n redraw := &yes\n }\n\n !\"23456789\":\n zoom_ratio := integer(event[1])\n\n !\"oO\":\n {\n pixels_per_unit := 150\n max_iter := 200\n zoom_ratio := 2\n xcenter := -0.75\n ycenter := 0.0\n redraw := &yes\n }\n\n !\"pP\":\n {\n png_name := \"mandelbrot-image-\" || png_number || \".png\"\n png_number +:= 1\n w.get_pixels().to_file(png_name)\n write (\"Wrote \", png_name)\n }\n\n Window.RESIZE:\n redraw := &yes\n }\n\n WDelay(w, 100)\n }\n }\nend\n\nprocedure count_mandelbrot_iterations (cx, cy, max_iter)\n local x, y, xsquared, ysquared, iter, tmp\n\n x := 0\n y := 0\n iter := 0\n until (iter = max_iter |\n 4 < (xsquared := x * x) + (ysquared := y * y)) do\n {\n tmp := xsquared - ysquared + cx\n y := (2 * x * y) + cy\n x := tmp\n iter +:= 1\n }\n return iter\nend\n\nprocedure map_iterations_to_color (max_iter, iter)\n return \"black \" ||\n integer((Math.log (iter) * 100.0) / Math.log (max_iter)) ||\n \"%\"\nend\n\nprocedure window_coords_to_point (w, xcoord, ycoord,\n xcenter, ycenter,\n pixels_per_unit)\n local x, y\n\n x := xcenter +\n (((2.0 * xcoord) - w.get_width()) / (2.0 * pixels_per_unit))\n y := ycenter +\n ((w.get_height() - (2.0 * ycoord)) / (2.0 * pixels_per_unit))\n\n return [x, y]\nend\n","language":"ObjectIcon"},{"code":"#load \"graphics.cma\";;\n\nlet mandelbrot xMin xMax yMin yMax xPixels yPixels maxIter =\n let rec mandelbrotIterator z c n =\n if (Complex.norm z) > 2.0 then false else\n match n with\n | 0 -> true\n | n -> let z' = Complex.add (Complex.mul z z) c in\n mandelbrotIterator z' c (n-1) in\n Graphics.open_graph\n (\" \"^(string_of_int xPixels)^\"x\"^(string_of_int yPixels));\n let dx = (xMax -. xMin) /. (float_of_int xPixels)\n and dy = (yMax -. yMin) /. (float_of_int yPixels) in\n for xi = 0 to xPixels - 1 do\n for yi = 0 to yPixels - 1 do\n let c = {Complex.re = xMin +. (dx *. float_of_int xi);\n Complex.im = yMin +. (dy *. float_of_int yi)} in\n if (mandelbrotIterator Complex.zero c maxIter) then\n (Graphics.set_color Graphics.white;\n Graphics.plot xi yi )\n else\n (Graphics.set_color Graphics.black;\n Graphics.plot xi yi )\n done\n done;;\n\nmandelbrot (-1.5) 0.5 (-1.0) 1.0 500 500 200;;\n","language":"OCaml"},{"code":"#! /usr/bin/octave -qf\nglobal width = 200;\nglobal height = 200;\nmaxiter = 100;\n\nz0 = 0;\nglobal cmax = 1 + i;\nglobal cmin = -2 - i;\n\nfunction cs = pscale(c)\n global cmax;\n global cmin;\n global width;\n global height;\n persistent px = (real(cmax-cmin))/width;\n persistent py = (imag(cmax-cmin))/height;\n cs = real(cmin) + px*real(c) + i*(imag(cmin) + py*imag(c));\nendfunction\n\nms = zeros(width, height);\nfor x = 0:width-1\n for y = 0:height-1\n z0 = 0;\n c = pscale(x+y*i);\n for ic = 1:maxiter\n z1 = z0^2 + c;\n if ( abs(z1) > 2 ) break; endif\n z0 = z1;\n endfor\n ms(x+1, y+1) = ic/maxiter;\n endfor\nendfor\n\nsaveimage(\"mandel.ppm\", round(ms .* 255).', \"ppm\");\n","language":"Octave"},{"code":"function z = mandelbrot()\n % to view the image call \"image(mandelbrot())\"\n width = 500; height = 500;\n z = zeros(width, height);\n c = zeros(width, height);\n\n xi = 1;\n for x = linspace(-2, 2, width)\n yi = 1;\n for y = linspace(-2, 2, height)\n c(yi, xi) = x+y*i; yi += 1;\n end\n xi += 1;\n end\n\n for iter = 1:50\n z = z.*z + c;\n end\n\n z = abs(z);\nend\n","language":"Octave"},{"code":"(define x-size 59)\n(define y-size 21)\n(define min-im -1)\n(define max-im 1)\n(define min-re -2)\n(define max-re 1)\n\n(define step-x (/ (- max-re min-re) x-size))\n(define step-y (/ (- max-im min-im) y-size))\n\n(for-each (lambda (y)\n (let ((im (+ min-im (* step-y y))))\n (for-each (lambda (x)\n (let*((re (+ min-re (* step-x x)))\n (zr (inexact re))\n (zi (inexact im)))\n (let loop ((n 0) (zi zi) (zr zr))\n (let ((a (* zr zr))\n (b (* zi zi)))\n (cond\n ((> (+ a b) 4)\n (display (string (- 62 n))))\n ((= n 30)\n (display (string (- 62 n))))\n (else\n (loop (+ n 1) (+ (* 2 zr zi) im) (- (+ a re) b))))))))\n (iota x-size))\n (print)))\n (iota y-size))\n","language":"Ol"},{"code":"DEFINE VARIABLE print_str AS CHAR NO-UNDO INIT ''.\nDEFINE VARIABLE X1 AS DECIMAL NO-UNDO INIT 50.\nDEFINE VARIABLE Y1 AS DECIMAL NO-UNDO INIT 21.\nDEFINE VARIABLE X AS DECIMAL NO-UNDO.\nDEFINE VARIABLE Y AS DECIMAL NO-UNDO.\nDEFINE VARIABLE N AS DECIMAL NO-UNDO.\nDEFINE VARIABLE I3 AS DECIMAL NO-UNDO.\nDEFINE VARIABLE R3 AS DECIMAL NO-UNDO.\nDEFINE VARIABLE Z1 AS DECIMAL NO-UNDO.\nDEFINE VARIABLE Z2 AS DECIMAL NO-UNDO.\nDEFINE VARIABLE A AS DECIMAL NO-UNDO.\nDEFINE VARIABLE B AS DECIMAL NO-UNDO.\nDEFINE VARIABLE I1 AS DECIMAL NO-UNDO INIT -1.0.\nDEFINE VARIABLE I2 AS DECIMAL NO-UNDO INIT 1.0.\nDEFINE VARIABLE R1 AS DECIMAL NO-UNDO INIT -2.0.\nDEFINE VARIABLE R2 AS DECIMAL NO-UNDO INIT 1.0.\nDEFINE VARIABLE S1 AS DECIMAL NO-UNDO.\nDEFINE VARIABLE S2 AS DECIMAL NO-UNDO.\n\n\nS1 = (R2 - R1) / X1.\nS2 = (I2 - I1) / Y1.\nDO Y = 0 TO Y1 - 1:\n I3 = I1 + S2 * Y.\n DO X = 0 TO X1 - 1:\n R3 = R1 + S1 * X.\n Z1 = R3.\n Z2 = I3.\n DO N = 0 TO 29:\n A = Z1 * Z1.\n B = Z2 * Z2.\n IF A + B > 4.0 THEN\n LEAVE.\n Z2 = 2 * Z1 * Z2 + I3.\n Z1 = A - B + R3.\n END.\n print_str = print_str + CHR(62 - N).\n END.\n print_str = print_str + '~n'.\nEND.\n\nOUTPUT TO \"C:\\Temp\\out.txt\".\nMESSAGE print_str.\nOUTPUT CLOSE.\n","language":"OpenEdge-Progress"},{"code":"mandelbrot() =\n{\n forstep(y=-1, 1, 0.05,\n forstep(x=-2, 0.5, 0.0315,\n print1(((c)->my(z=c);for(i=1,20,z=z*z+c;if(abs(z)>2,return(\" \")));\"#\")(x+y*I)));\n print());\n}\n","language":"PARI-GP"},{"code":"program mandelbrot;\n\n {$IFDEF FPC}\n {$MODE DELPHI}\n {$ENDIF}\n\nconst\n ixmax = 800;\n iymax = 800;\n cxmin = -2.5;\n cxmax = 1.5;\n cymin = -2.0;\n cymax = 2.0;\n maxcolorcomponentvalue = 255;\n maxiteration = 200;\n escaperadius = 2;\n\ntype\n colortype = record\n red : byte;\n green : byte;\n blue : byte;\n end;\n\nvar\n ix, iy : integer;\n cx, cy : real;\n pixelwidth : real = (cxmax - cxmin) / ixmax;\n pixelheight : real = (cymax - cymin) / iymax;\n filename : string = 'new1.ppm';\n comment : string = '# ';\n outfile : textfile;\n color : colortype;\n zx, zy : real;\n zx2, zy2 : real;\n iteration : integer;\n er2 : real = (escaperadius * escaperadius);\n\nbegin\n {$I-}\n assign(outfile, filename);\n rewrite(outfile);\n if ioresult <> 0 then\n begin\n {$IFDEF FPC}\n writeln(stderr, 'Unable to open output file: ', filename);\n {$ELSE}\n writeln('ERROR: Unable to open output file: ', filename);\n {$ENDIF}\n exit;\n end;\n\n writeln(outfile, 'P6');\n writeln(outfile, ' ', comment);\n writeln(outfile, ' ', ixmax);\n writeln(outfile, ' ', iymax);\n writeln(outfile, ' ', maxcolorcomponentvalue);\n\n for iy := 1 to iymax do\n begin\n cy := cymin + (iy - 1)*pixelheight;\n if abs(cy) < pixelheight / 2 then cy := 0.0;\n for ix := 1 to ixmax do\n begin\n cx := cxmin + (ix - 1)*pixelwidth;\n zx := 0.0;\n zy := 0.0;\n zx2 := zx*zx;\n zy2 := zy*zy;\n iteration := 0;\n while (iteration < maxiteration) and (zx2 + zy2 < er2) do\n begin\n zy := 2*zx*zy + cy;\n zx := zx2 - zy2 + cx;\n zx2 := zx*zx;\n zy2 := zy*zy;\n iteration := iteration + 1;\n end;\n if iteration = maxiteration then\n begin\n color.red := 0;\n color.green := 0;\n color.blue := 0;\n end\n else\n begin\n color.red := 255;\n color.green := 255;\n color.blue := 255;\n end;\n write(outfile, chr(color.red), chr(color.green), chr(color.blue));\n end;\n end;\n\n close(outfile);\nend.\n","language":"Pascal"},{"code":"###sysinclude standard.uh\n###sysinclude str.uh\n###sysinclude system.uh\n###sysinclude X.uh\n$ff0000 sto szin\n300 sto maxiter\nmaxypixel sto YRES\nmaxxpixel sto XRES\nmyscreen \"Mandelbrot\" @YRES @XRES graphic\n#g\n@YRES 2 / (#d) sto y2\n@YRES 2 / (#d) sto x2\n@XRES i: {{\n@YRES {{\n{{}}§i #g !(#d) 480. - @x2 - @x2 /\nsto xx\n{{}} #g !(#d) @y2 - @y2 /\nsto yy\nzero#d xa zero#d ya zero iter\n\n#d\nciklus:\n@xa dup* @ya dup* - @xx +\n@xa 2. * @ya * @yy + sto ya\nsto xa ++()#g iter\n@xa dup* @ya dup* + 4. > @iter @maxiter >=#g |#g then §ciklusvége\ngoto §ciklus\nciklusvége:\n@iter @maxiter ==#g {\nmyscreen {{}} {{}}§i @szin setpixel\n}{\nmyscreen {{}} {{}}§i @iter 64 *#g setpixel\n}\n}}\n}}\nmyscreen 10000 key?\nvége: myscreen inv graphic\n//.\"A lenyomott billentyű: \" kprintnl\nend\n{ „xx” }\n{ „x2” }\n{ „yy” }\n{ „y2” }\n{ „xa” }\n{ „ya” }\n{ „iter” }\n{ „maxiter” }\n{ „szin” }\n{ „YRES” }\n{ „XRES” }\n{ „myscreen” }\n","language":"Peri"},{"code":"use Math::Complex;\n\nsub mandelbrot {\n my ($z, $c) = @_[0,0];\n for (1 .. 20) {\n $z = $z * $z + $c;\n return $_ if abs $z > 2;\n }\n}\n\nfor (my $y = 1; $y >= -1; $y -= 0.05) {\n for (my $x = -2; $x <= 0.5; $x += 0.0315)\n {print mandelbrot($x + $y * i) ? ' ' : '#'}\n print \"\\n\"\n}\n","language":"Perl"},{"code":"--\n-- Mandlebrot set in ascii art demo.\n--\nconstant b=\" .:,;!/>)|&IH%*#\"\natom r, i, c, C, z, Z, t, k\n for y=30 to 0 by -1 do\n C = y*0.1-1.5\n puts(1,'\\n')\n for x=0 to 74 do\n c = x*0.04-2\n z = 0\n Z = 0\n r = c\n i = C\n k = 0\n while k<112 do\n t = z*z-Z*Z+r\n Z = 2*z*Z+i\n z = t\n if z*z+Z*Z>10 then exit end if\n k += 1\n end while\n puts(1,b[remainder(k,16)+1])\n end for\n end for\n","language":"Phix"},{"code":"include arwen.ew\ninclude ..\\arwen\\dib256.ew\n\nconstant HelpText = \"Left-click drag with the mouse to move the image.\\n\"&\n \" (the image is currently only redrawn on mouseup).\\n\"&\n \"Right-click-drag with the mouse to select a region to zoom in to.\\n\"&\n \"Use the mousewheel to zoom in and out (nb: can be slow).\\n\"&\n \"Press F2 to select iterations, higher==more detail but slower.\\n\"&\n \"Resize the window as you please, but note that going fullscreen, \\n\"&\n \"especially at high iteration, may mean a quite long draw time.\\n\"&\n \"Press Escape to close the window.\"\n\nprocedure Help()\n void = messageBox(\"Mandelbrot Set\",HelpText,MB_OK)\nend procedure\n\ninteger cWidth = 520 -- client area width\ninteger cHeight = 480 -- client area height\n\nconstant Main = create(Window, \"Mandelbrot Set\", 0, 0, 50, 50, cWidth+16, cHeight+38, 0),\n mainHwnd = getHwnd(Main),\n mainDC = getPrivateDC(Main),\n\n mIter = create(Menu, \"\", 0, 0, 0,0,0,0,0),\n iterHwnd = getHwnd(mIter),\n mIter50 = create(MenuItem,\"50 (fast, low detail)\", 0, mIter, 0,0,0,0,0),\n mIter100 = create(MenuItem,\"100 (default)\", 0, mIter, 0,0,0,0,0),\n mIter500 = create(MenuItem,\"500\", 0, mIter, 0,0,0,0,0),\n mIter1000 = create(MenuItem,\"1000 (slow, high detail)\",0, mIter, 0,0,0,0,0),\n m50to1000 = {mIter50,mIter100,mIter500,mIter1000},\n i50to1000 = { 50, 100, 500, 1000}\n\ninteger mainDib = 0\n\nconstant whitePen = c_func(xCreatePen, {0,1,BrightWhite})\nconstant NULL_BRUSH = 5,\n NullBrushID = c_func(xGetStockObject,{NULL_BRUSH})\n\natom t0\ninteger iter\natom x0, y0 -- top-left coords to draw\natom scale -- controls width/zoom\n\nprocedure init()\n x0 = -2\n y0 = -1.25\n scale = 2.5/cHeight\n iter = 100\n void = c_func(xSelectObject,{mainDC,whitePen})\n void = c_func(xSelectObject,{mainDC,NullBrushID})\nend procedure\ninit()\n\nfunction in_set(atom x, atom y)\natom u,t\n if x>-0.75 then\n u = x-0.25\n t = u*u+y*y\n return ((2*t+u)*(2*t+u)>t)\n else\n return ((x+1)*(x+1)+y*y)>0.0625\n end if\nend function\n\nfunction pixel_colour(atom x0, atom y0, integer iter)\ninteger count = 1\natom x = 0, y = 0\n while (count<=iter) and (x*x+y*y<4) do\n count += 1\n {x,y} = {x*x-y*y+x0,2*x*y+y0}\n end while\n if count<=iter then return count end if\n return 0\nend function\n\nprocedure mandel(atom x0, atom y0, atom scale)\natom x,y\ninteger c\n t0 = time()\n y = y0\n for yi=1 to cHeight do\n x = x0\n for xi=1 to cWidth do\n c = 0 -- default to black\n if in_set(x,y) then\n c = pixel_colour(x,y,iter)\n end if\n setDibPixel(mainDib, xi, yi, c)\n x += scale\n end for\n y += scale\n end for\nend procedure\n\ninteger firsttime = 1\ninteger drawBox = 0\ninteger drawTime = 0\n\nprocedure newDib()\nsequence pal\n\n if mainDib!=0 then\n {} = deleteDib(mainDib)\n end if\n mainDib = createDib(cWidth, cHeight)\n pal = repeat({0,0,0},256)\n for i=2 to 256 do\n pal[i][1] = i*5\n pal[i][2] = 0\n pal[i][3] = i*10\n end for\n setDibPalette(mainDib, 1, pal)\n mandel(x0,y0,scale)\n drawTime = 2\nend procedure\n\nprocedure reDraw()\n setText(Main,\"Please Wait...\")\n mandel(x0,y0,scale)\n drawTime = 2\n repaintWindow(Main,False)\nend procedure\n\nprocedure zoom(integer z)\n while z do\n if z>0 then\n scale /= 1.1\n z -= 1\n else\n scale *= 1.1\n z += 1\n end if\n end while\n reDraw()\nend procedure\n\ninteger dx=0,dy=0 -- mouse down coords\ninteger mx=0,my=0 -- mouse move/up coords\n\nfunction mainHandler(integer id, integer msg, atom wParam, object lParam)\ninteger x, y -- scratch vars\natom scale10\n\n if msg=WM_SIZE then -- (also activate/firsttime)\n {{},{},x,y} = getClientRect(Main)\n if firsttime or cWidth!=x or cHeight!=y then\n scale *= cWidth/x\n {cWidth, cHeight} = {x,y}\n newDib()\n firsttime = 0\n end if\n elsif msg=WM_PAINT then\n copyDib(mainDC, 0, 0, mainDib)\n if drawBox then\n void = c_func(xRectangle, {mainDC, dx, dy, mx, my})\n end if\n if drawTime then\n if drawTime=2 then\n setText(Main,sprintf(\"Mandelbrot Set [generated in %gs]\",time()-t0))\n else\n setText(Main,\"Mandelbrot Set\")\n end if\n drawTime -= 1\n end if\n elsif msg=WM_CHAR then\n if wParam=VK_ESCAPE then\n closeWindow(Main)\n elsif wParam='+' then zoom(+1)\n elsif wParam='-' then zoom(-1)\n end if\n elsif msg=WM_LBUTTONDOWN\n or msg=WM_RBUTTONDOWN then\n {dx,dy} = lParam\n elsif msg=WM_MOUSEMOVE then\n if and_bits(wParam,MK_LBUTTON) then\n {mx,my} = lParam\n -- minus dx,dy (see WM_LBUTTONUP)\n -- DEV maybe a timer to redraw, but probably too slow...\n -- (this is where we need a background worker thread,\n -- ideally one we can direct to abandon what it is\n -- currently doing and start work on new x,y instead)\n elsif and_bits(wParam,MK_RBUTTON) then\n {mx,my} = lParam\n drawBox = 1\n repaintWindow(Main,False)\n end if\n elsif msg=WM_MOUSEWHEEL then\n wParam = floor(wParam/#10000)\n if wParam>=#8000 then -- sign bit set\n wParam-=#10000\n end if\n wParam = floor(wParam/120) -- (gives +/-1, usually)\n zoom(wParam)\n elsif msg=WM_LBUTTONUP then\n {mx,my} = lParam\n drawBox = 0\n x0 += (dx-mx)*scale\n y0 += (dy-my)*scale\n reDraw()\n elsif msg=WM_RBUTTONUP then\n {mx,my} = lParam\n drawBox = 0\n if mx!=dx and my!=dy then\n x0 += min(mx,dx)*scale\n y0 += min(my,dy)*scale\n scale *= (abs(mx-dx))/cHeight\n reDraw()\n end if\n elsif msg=WM_KEYDOWN then\n if wParam=VK_F1 then\n Help()\n elsif wParam=VK_F2 then\n {x,y} = getWindowRect(Main)\n void = c_func(xTrackPopupMenu, {iterHwnd,TPM_LEFTALIGN,x+20,y+40,0,mainHwnd,NULL})\n elsif find(wParam,{VK_UP,VK_DOWN,VK_LEFT,VK_RIGHT}) then\n drawBox = 0\n scale10 = scale*10\n if wParam=VK_UP then\n y0 += scale10\n elsif wParam=VK_DOWN then\n y0 -= scale10\n elsif wParam=VK_LEFT then\n x0 += scale10\n elsif wParam=VK_RIGHT then\n x0 -= scale10\n end if\n reDraw()\n end if\n elsif msg=WM_COMMAND then\n id = find(id,m50to1000)\n if id!=0 then\n iter = i50to1000[id]\n reDraw()\n end if\n end if\n return 0\nend function\nsetHandler({Main,mIter50,mIter100,mIter500,mIter1000}, routine_id(\"mainHandler\"))\n\nWinMain(Main,SW_NORMAL)\nvoid = deleteDib(0)\n","language":"Phix"},{"code":"$min_x=-2;\n$max_x=1;\n$min_y=-1;\n$max_y=1;\n\n$dim_x=400;\n$dim_y=300;\n\n$im = @imagecreate($dim_x, $dim_y)\n or die(\"Cannot Initialize new GD image stream\");\nheader(\"Content-Type: image/png\");\n$black_color = imagecolorallocate($im, 0, 0, 0);\n$white_color = imagecolorallocate($im, 255, 255, 255);\n\nfor($y=0;$y<=$dim_y;$y++) {\n for($x=0;$x<=$dim_x;$x++) {\n $c1=$min_x+($max_x-$min_x)/$dim_x*$x;\n $c2=$min_y+($max_y-$min_y)/$dim_y*$y;\n\n $z1=0;\n $z2=0;\n\n for($i=0;$i<100;$i++) {\n $new1=$z1*$z1-$z2*$z2+$c1;\n $new2=2*$z1*$z2+$c2;\n $z1=$new1;\n $z2=$new2;\n if($z1*$z1+$z2*$z2>=4) {\n break;\n }\n }\n if($i<100) {\n imagesetpixel ($im, $x, $y, $white_color);\n }\n }\n}\n\nimagepng($im);\nimagedestroy($im);\n","language":"PHP"},{"code":"go =>\n\n Width = 90,\n Height = 50,\n Limit = 50,\n foreach(Y in 1..Height)\n P=\"\",\n foreach (X in 1..Width)\n Z=complex(0,0),\n C=complex(2.5*X/Width-2.0,2.0*Y/Height-1.0),\n J = 0,\n while (J < Limit, c_abs(Z)<2.0)\n Z := c_add(c_mul(Z,Z),C),\n J := J + 1\n end,\n if J == Limit then\n P := P ++ \"#\"\n else\n P := P ++ \".\"\n end\n end,\n printf(\"%s\\n\", P)\n end,\n nl.\n\n% Operations on complex numbers\ncomplex(R,I) = [R,I].\nc_add(X,Y) = complex(X[1]+Y[1],X[2]+Y[2]).\nc_mul(X,Y) = complex(X[1]*Y[1]-X[2]*Y[2],X[1]*Y[2]+X[2]*Y[1]).\nc_abs(X) = sqrt(X[1]*X[1]+X[2]*X[2]).\n","language":"Picat"},{"code":"(scl 6)\n\n(let Ppm (make (do 300 (link (need 400))))\n (for (Y . Row) Ppm\n (for (X . @) Row\n (let (ZX 0 ZY 0 CX (*/ (- X 250) 1.0 150) CY (*/ (- Y 150) 1.0 150) C 570)\n (while (and (> 4.0 (+ (*/ ZX ZX 1.0) (*/ ZY ZY 1.0))) (gt0 C))\n (let Tmp (- (*/ ZX ZX 1.0) (*/ ZY ZY 1.0) (- CX))\n (setq\n ZY (+ (*/ 2 ZX ZY 1.0) CY)\n ZX Tmp ) )\n (dec 'C) )\n (set (nth Ppm Y X) (list 0 C C)) ) ) )\n (out \"img.ppm\"\n (prinl \"P6\")\n (prinl 400 \" \" 300)\n (prinl 255)\n (for Y Ppm (for X Y (apply wr X))) ) )\n","language":"PicoLisp"},{"code":"%!PS-Adobe-2.0\n%%BoundingBox: 0 0 300 200\n%%EndComments\n/origstate save def\n/ld {load def} bind def\n/m /moveto ld /g /setgray ld\n/dot { currentpoint 1 0 360 arc fill } bind def\n%%EndProlog\n% param\n/maxiter 200 def\n% complex manipulation\n/complex { 2 array astore } def\n/real { 0 get } def\n/imag { 1 get } def\n/cmul { /a exch def /b exch def\n a real b real mul\n a imag b imag mul sub\n a real b imag mul\n a imag b real mul add\n 2 array astore\n} def\n/cadd { aload pop 3 -1 roll aload pop\n 3 -1 roll add\n 3 1 roll add exch 2 array astore\n} def\n/cconj { aload pop neg 2 array astore } def\n/cabs2 { dup cconj cmul 0 get} def\n% mandel\n200 100 translate\n-200 1 100 { /x exch def\n -100 1 100 { /y exch def\n /z0 0.0 0.0 complex def\n 0 1 maxiter { /iter exch def\n\tx 100 div y 100 div complex\n\tz0 z0 cmul\n\tcadd dup /z0 exch def\n\tcabs2 4 gt {exit} if\n } for\n iter maxiter div g\n x y m dot\n } for\n} for\n%\nshowpage\norigstate restore\n%%EOF\n","language":"PostScript"},{"code":"$x = $y = $i = $j = $r = -16\n$colors = [Enum]::GetValues([System.ConsoleColor])\n\nwhile(($y++) -lt 15)\n{\n for($x=0; ($x++) -lt 84; Write-Host \" \" -BackgroundColor ($colors[$k -band 15]) -NoNewline)\n {\n $i = $k = $r = 0\n\n do\n {\n $j = $r * $r - $i * $i -2 + $x / 25\n $i = 2 * $r * $i + $y / 10\n $r = $j\n }\n while (($j * $j + $i * $i) -lt 11 -band ($k++) -lt 111)\n }\n\n Write-Host\n}\n","language":"PowerShell"},{"code":"double x, y, zr, zi, zr2, zi2, cr, ci, n;\ndouble zmx1, zmx2, zmy1, zmy2, f, di, dj;\ndouble fn1, fn2, fn3, re, gr, bl, xt, yt, i, j;\n\nvoid setup() {\n size(500, 500);\n di = 0;\n dj = 0;\n f = 10;\n fn1 = random(20);\n fn2 = random(20);\n fn3 = random(20);\n zmx1 = int(width / 4);\n zmx2 = 2;\n zmy1 = int(height / 4);\n zmy2 = 2;\n}\n\nvoid draw() {\n if (i <= width) i++;\n x = (i + di)/ zmx1 - zmx2;\n for ( j = 0; j <= height; j++) {\n y = zmy2 - (j + dj) / zmy1;\n zr = 0;\n zi = 0;\n zr2 = 0;\n zi2 = 0;\n cr = x;\n ci = y;\n n = 1;\n while (n < 200 && (zr2 + zi2) < 4) {\n zi2 = zi * zi;\n zr2 = zr * zr;\n zi = 2 * zi * zr + ci;\n zr = zr2 - zi2 + cr;\n n++;\n }\n re = (n * fn1) % 255;\n gr = (n * fn2) % 255;\n bl = (n * fn3) % 255;\n stroke((float)re, (float)gr, (float)bl);\n point((float)i, (float)j);\n }\n}\n\nvoid mousePressed() {\n background(200);\n xt = mouseX;\n yt = mouseY;\n di = di + xt - float(width / 2);\n dj = dj + yt - float(height / 2);\n zmx1 = zmx1 * f;\n zmx2 = zmx2 * (1 / f);\n zmy1 = zmy1 * f;\n zmy2 = zmy2 * (1 / f);\n di = di * f;\n dj = dj * f;\n i = 0;\n j = 0;\n}\n","language":"Processing"},{"code":"i = di = dj = 0\nfn1, fn2, fn3 = random(20), random(20), random(20)\nf = 10\n\ndef setup():\n global zmx1, zmx2, zmy1, zmy2\n size(500, 500)\n zmx1 = int(width / 4)\n zmx2 = 2\n zmy1 = int(height / 4)\n zmy2 = 2\n\n\ndef draw():\n global i\n\n if i <= width:\n i += 1\n x = float(i + di) / zmx1 - zmx2\n for j in range(height + 1):\n y = zmy2 - float(j + dj) / zmy1\n zr = zi = zr2 = zi2 = 0\n cr, ci = x, y\n n = 1\n while n < 200 and (zr2 + zi2) < 4:\n zi2 = zi * zi\n zr2 = zr * zr\n zi = 2 * zi * zr + ci\n zr = zr2 - zi2 + cr\n n += 1\n\n re = (n * fn1) % 255\n gr = (n * fn2) % 255\n bl = (n * fn3) % 255\n stroke(re, gr, bl)\n point(i, j)\n\n\ndef mousePressed():\n global zmx1, zmx2, zmy1, zmy2, di, dj\n global i, j\n background(200)\n xt, yt = mouseX, mouseY\n di = di + xt - width / 2.\n dj = dj + yt - height / 2.\n zmx1 = zmx1 * f\n zmx2 = zmx2 * (1. / f)\n zmy1 = zmy1 * f\n zmy2 = zmy2 * (1. / f)\n di, dj = di * f, dj * f\n i = j = 0\n","language":"Processing-Python-mode"},{"code":":- use_module(library(pce)).\n\nmandelbrot :-\n new(D, window('Mandelbrot Set')),\n send(D, size, size(700, 650)),\n new(Img, image(@nil, width := 700, height := 650, kind := pixmap)),\n\n forall(between(0,699, I),\n ( forall(between(0,649, J),\n ( get_RGB(I, J, R, G, B),\n R1 is (R * 256) mod 65536,\n G1 is (G * 256) mod 65536,\n B1 is (B * 256) mod 65536,\n send(Img, pixel(I, J, colour(@default, R1, G1, B1))))))),\n new(Bmp, bitmap(Img)),\n send(D, display, Bmp, point(0,0)),\n send(D, open).\n\nget_RGB(X, Y, R, G, B) :-\n CX is (X - 350) / 150,\n CY is (Y - 325) / 150,\n Iter = 570,\n compute_RGB(CX, CY, 0, 0, Iter, It),\n IterF is It \\/ It << 15,\n R is IterF >> 16,\n Iter1 is IterF - R << 16,\n G is Iter1 >> 8,\n B is Iter1 - G << 8.\n\ncompute_RGB(CX, CY, ZX, ZY, Iter, IterF) :-\n ZX * ZX + ZY * ZY < 4,\n Iter > 0,\n !,\n Tmp is ZX * ZX - ZY * ZY + CX,\n ZY1 is 2 * ZX * ZY + CY,\n Iter1 is Iter - 1,\n compute_RGB(CX, CY, Tmp, ZY1, Iter1, IterF).\n\ncompute_RGB(_CX, _CY, _ZX, _ZY, Iter, Iter).\n","language":"Prolog"},{"code":"EnableExplicit\n\n#Window1 = 0\n#Image1 = 0\n#ImgGadget = 0\n\n#max_iteration = 64\n#width = 800\n#height = 600\nDefine.d x0 ,y0 ,xtemp ,cr, ci\nDefine.i i, n, x, y ,Event ,color\n\nDim Color.l (255)\nFor n = 0 To 63\n Color( 0 + n ) = RGB( n*4+128, 4 * n, 0 )\n Color( 64 + n ) = RGB( 64, 255, 4 * n )\n Color( 128 + n ) = RGB( 64, 255 - 4 * n , 255 )\n Color( 192 + n ) = RGB( 64, 0, 255 - 4 * n )\nNext\n\nIf OpenWindow(#Window1, 0, 0, #width, #height, \"'Mandelbrot set' PureBasic Example\", #PB_Window_SystemMenu )\n If CreateImage(#Image1, #width, #height)\n ImageGadget(#ImgGadget, 0, 0, #width, #height, ImageID(#Image1))\n For y.i = 1 To #height -1\n StartDrawing(ImageOutput(#Image1))\n For x.i = 1 To #width -1\n x0 = 0\n y0 = 0;\n cr = (x / #width)*2.5 -2\n ci = (y / #height)*2.5 -1.25\n i = 0\n While (x0*x0 + y0*y0 <= 4.0) And i < #max_iteration\n i +1\n xtemp = x0*x0 - y0*y0 + cr\n y0 = 2*x0*y0 + ci\n x0 = xtemp\n Wend\n If i >= #max_iteration\n Plot(x, y, 0 )\n Else\n Plot(x, y, Color(i & 255))\n EndIf\n\n Next\n StopDrawing()\n SetGadgetState(#ImgGadget, ImageID(#Image1))\n Repeat\n Event = WindowEvent()\n If Event = #PB_Event_CloseWindow\n End\n EndIf\n Until Event = 0\n Next\n EndIf\n Repeat\n Event = WaitWindowEvent()\n Until Event = #PB_Event_CloseWindow\n EndIf\n","language":"PureBasic"},{"code":"# Python 3.0+ and 2.5+\ntry:\n from functools import reduce\nexcept:\n pass\n\n\ndef mandelbrot(a):\n return reduce(lambda z, _: z * z + a, range(50), 0)\n\ndef step(start, step, iterations):\n return (start + (i * step) for i in range(iterations))\n\nrows = ((\"*\" if abs(mandelbrot(complex(x, y))) < 2 else \" \"\n for x in step(-2.0, .0315, 80))\n for y in step(1, -.05, 41))\n\nprint(\"\\n\".join(\"\".join(row) for row in rows))\n","language":"Python"},{"code":"from functools import reduce\n\ndef mandelbrot(x, y, c): return ' *'[abs(reduce(lambda z, _: z*z + c, range(99), 0)) < 2]\n\nprint('\\n'.join(''.join(mandelbrot(x, y, x/50 + y/50j) for x in range(-100, 25)) for y in range(-50, 50)))\n","language":"Python"},{"code":"import math\n\ndef mandelbrot(z , c , n=40):\n if abs(z) > 1000:\n return float(\"nan\")\n elif n > 0:\n return mandelbrot(z ** 2 + c, c, n - 1)\n else:\n return z ** 2 + c\n\nprint(\"\\n\".join([\"\".join([\"#\" if not math.isnan(mandelbrot(0, x + 1j * y).real) else \" \"\n for x in [a * 0.02 for a in range(-80, 30)]])\n for y in [a * 0.05 for a in range(-20, 20)]])\n )\n","language":"Python"},{"code":"from pylab import *\nfrom numpy import NaN\n\ndef m(a):\n\tz = 0\n\tfor n in range(1, 100):\n\t\tz = z**2 + a\n\t\tif abs(z) > 2:\n\t\t\treturn n\n\treturn NaN\n\nX = arange(-2, .5, .002)\nY = arange(-1, 1, .002)\nZ = zeros((len(Y), len(X)))\n\nfor iy, y in enumerate(Y):\n\tprint (iy, \"of\", len(Y))\n\tfor ix, x in enumerate(X):\n\t\tZ[iy,ix] = m(x + 1j * y)\n\nimshow(Z, cmap = plt.cm.prism, interpolation = 'none', extent = (X.min(), X.max(), Y.min(), Y.max()))\nxlabel(\"Re(c)\")\nylabel(\"Im(c)\")\nsavefig(\"mandelbrot_python.svg\")\nshow()\n","language":"Python"},{"code":"import matplotlib.pyplot as plt\nimport numpy as np\n\nnpts = 300\nmax_iter = 100\n\nX = np.linspace(-2, 1, 2 * npts)\nY = np.linspace(-1, 1, npts)\n\n#broadcast X to a square array\nC = X[:, None] + 1J * Y\n#initial value is always zero\nZ = np.zeros_like(C)\n\nexit_times = max_iter * np.ones(C.shape, np.int32)\nmask = exit_times > 0\n\nfor k in range(max_iter):\n Z[mask] = Z[mask] * Z[mask] + C[mask]\n mask, old_mask = abs(Z) < 2, mask\n #use XOR to detect the area which has changed\n exit_times[mask ^ old_mask] = k\n\nplt.imshow(exit_times.T,\n cmap=plt.cm.prism,\n extent=(X.min(), X.max(), Y.min(), Y.max()))\nplt.show()\n","language":"Python"},{"code":"import numpy as np\nimport matplotlib.pyplot as plt\n\nd, h = 800, 500 # pixel density (= image width) and image height\nn, r = 200, 500 # number of iterations and escape radius (r > 2)\n\nx = np.linspace(0, 2, num=d+1)\ny = np.linspace(0, 2 * h / d, num=h+1)\n\nA, B = np.meshgrid(x - 1, y - h / d)\nC = 2.0 * (A + B * 1j) - 0.5\n\nZ, dZ = np.zeros_like(C), np.zeros_like(C)\nD, S, T = np.zeros(C.shape), np.zeros(C.shape), np.zeros(C.shape)\n\nfor k in range(n):\n M = abs(Z) < r\n S[M], T[M] = S[M] + np.exp(- abs(Z[M])), T[M] + 1\n Z[M], dZ[M] = Z[M] ** 2 + C[M], 2 * Z[M] * dZ[M] + 1\n\nplt.imshow(S ** 0.1, cmap=plt.cm.twilight_shifted, origin=\"lower\")\nplt.savefig(\"Mandelbrot_set_1.png\", dpi=200)\n\nN = abs(Z) >= r # normalized iteration count\nT[N] = T[N] - np.log2(np.log(np.abs(Z[N])) / np.log(r))\n\nplt.imshow(T ** 0.1, cmap=plt.cm.twilight_shifted, origin=\"lower\")\nplt.savefig(\"Mandelbrot_set_2.png\", dpi=200)\n\nN = abs(Z) > 2 # exterior distance estimation\nD[N] = np.log(abs(Z[N])) * abs(Z[N]) / abs(dZ[N])\n\nplt.imshow(D ** 0.1, cmap=plt.cm.twilight_shifted, origin=\"lower\")\nplt.savefig(\"Mandelbrot_set_3.png\", dpi=200)\n\nN, thickness = D > 0, 0.01 # boundary detection\nD[N] = np.maximum(1 - D[N] / thickness, 0)\n\nplt.imshow(D ** 2.0, cmap=plt.cm.binary, origin=\"lower\")\nplt.savefig(\"Mandelbrot_set_4.png\", dpi=200)\n","language":"Python"},{"code":"import numpy as np\nimport matplotlib.pyplot as plt\n\nd, h = 800, 500 # pixel density (= image width) and image height\nn, r = 200, 500 # number of iterations and escape radius (r > 2)\n\ndirection, height = 45.0, 1.5 # direction and height of the light\ndensity, intensity = 4.0, 0.5 # density and intensity of the stripes\n\nx = np.linspace(0, 2, num=d+1)\ny = np.linspace(0, 2 * h / d, num=h+1)\n\nA, B = np.meshgrid(x - 1, y - h / d)\nC = (2.0 + 1.0j) * (A + B * 1j) - 0.5\n\nZ, dZ, ddZ = np.zeros_like(C), np.zeros_like(C), np.zeros_like(C)\nD, S, T = np.zeros(C.shape), np.zeros(C.shape), np.zeros(C.shape)\n\nfor k in range(n):\n M = abs(Z) < r\n S[M], T[M] = S[M] + np.sin(density * np.angle(Z[M])), T[M] + 1\n Z[M], dZ[M], ddZ[M] = Z[M] ** 2 + C[M], 2 * Z[M] * dZ[M] + 1, 2 * (dZ[M] ** 2 + Z[M] * ddZ[M])\n\nN = abs(Z) >= r # basic normal map effect and stripe average coloring (potential function)\nP, Q = S[N] / T[N], (S[N] + np.sin(density * np.angle(Z[N]))) / (T[N] + 1)\nU, V = Z[N] / dZ[N], 1 + (np.log2(np.log(np.abs(Z[N])) / np.log(r)) * (P - Q) + Q) * intensity\nU, v = U / abs(U), np.exp(direction / 180 * np.pi * 1j) # unit normal vectors and light vector\nD[N] = np.maximum((U.real * v.real + U.imag * v.imag + V * height) / (1 + height), 0)\n\nplt.imshow(D ** 1.0, cmap=plt.cm.bone, origin=\"lower\")\nplt.savefig(\"Mandelbrot_normal_map_1.png\", dpi=200)\n\nN = abs(Z) > 2 # advanced normal map effect using higher derivatives (distance estimation)\nU = Z[N] * dZ[N] * ((1 + np.log(abs(Z[N]))) * np.conj(dZ[N] ** 2) - np.log(abs(Z[N])) * np.conj(Z[N] * ddZ[N]))\nU, v = U / abs(U), np.exp(direction / 180 * np.pi * 1j) # unit normal vectors and light vector\nD[N] = np.maximum((U.real * v.real + U.imag * v.imag + height) / (1 + height), 0)\n\nplt.imshow(D ** 1.0, cmap=plt.cm.afmhot, origin=\"lower\")\nplt.savefig(\"Mandelbrot_normal_map_2.png\", dpi=200)\n","language":"Python"},{"code":"import numpy as np\nimport matplotlib.pyplot as plt\n\nd, h = 200, 1200 # pixel density (= image width) and image height\nn, r = 8000, 10000 # number of iterations and escape radius (r > 2)\n\na = -.743643887037158704752191506114774 # https://mathr.co.uk/web/m-location-analysis.html\nb = 0.131825904205311970493132056385139 # try: a, b, n = -1.748764520194788535, 3e-13, 800\n\nx = np.linspace(0, 2, num=d+1)\ny = np.linspace(0, 2 * h / d, num=h+1)\n\nA, B = np.meshgrid(x * np.pi, y * np.pi)\nC = 8.0 * np.exp((A + B * 1j) * 1j) + (a + b * 1j)\n\nZ, dZ = np.zeros_like(C), np.zeros_like(C)\nD = np.zeros(C.shape)\n\nfor k in range(n):\n M = Z.real ** 2 + Z.imag ** 2 < r ** 2\n Z[M], dZ[M] = Z[M] ** 2 + C[M], 2 * Z[M] * dZ[M] + 1\n\nN = abs(Z) > 2 # exterior distance estimation\nD[N] = np.log(abs(Z[N])) * abs(Z[N]) / abs(dZ[N])\n\nplt.imshow(D.T ** 0.05, cmap=plt.cm.nipy_spectral, origin=\"lower\")\nplt.savefig(\"Mercator_Mandelbrot_map.png\", dpi=200)\n\nX, Y = C.real, C.imag # zoom images (adjust circle size 100 and zoom level 20 as needed)\nR, c, z = 100 * (2 / d) * np.pi * np.exp(- B), min(d, h) + 1, max(0, h - d) // 20\n\nfig, ax = plt.subplots(2, 2, figsize=(12, 12))\nax[0,0].scatter(X[1*z:1*z+c,0:d], Y[1*z:1*z+c,0:d], s=R[0:c,0:d]**2, c=D[1*z:1*z+c,0:d]**.5, cmap=plt.cm.nipy_spectral)\nax[0,1].scatter(X[2*z:2*z+c,0:d], Y[2*z:2*z+c,0:d], s=R[0:c,0:d]**2, c=D[2*z:2*z+c,0:d]**.4, cmap=plt.cm.nipy_spectral)\nax[1,0].scatter(X[3*z:3*z+c,0:d], Y[3*z:3*z+c,0:d], s=R[0:c,0:d]**2, c=D[3*z:3*z+c,0:d]**.3, cmap=plt.cm.nipy_spectral)\nax[1,1].scatter(X[4*z:4*z+c,0:d], Y[4*z:4*z+c,0:d], s=R[0:c,0:d]**2, c=D[4*z:4*z+c,0:d]**.2, cmap=plt.cm.nipy_spectral)\nplt.savefig(\"Mercator_Mandelbrot_zoom.png\", dpi=100)\n","language":"Python"},{"code":"import numpy as np\nimport matplotlib.pyplot as plt\n\nimport decimal as dc # decimal floating point arithmetic with arbitrary precision\ndc.getcontext().prec = 80 # set precision to 80 digits (about 256 bits)\n\nd, h = 50, 1000 # pixel density (= image width) and image height\nn, r = 80000, 100000 # number of iterations and escape radius (r > 2)\n\na = dc.Decimal(\"-1.256827152259138864846434197797294538253477389787308085590211144291\")\nb = dc.Decimal(\".37933802890364143684096784819544060002129071484943239316486643285025\")\n\nS = np.zeros(n+1, dtype=np.complex128)\nu, v = dc.Decimal(0), dc.Decimal(0)\n\nfor k in range(n+1):\n S[k] = float(u) + float(v) * 1j\n if u ** 2 + v ** 2 < r ** 2:\n u, v = u ** 2 - v ** 2 + a, 2 * u * v + b\n else:\n print(\"The reference sequence diverges within %s iterations.\" % k)\n break\n\nx = np.linspace(0, 2, num=d+1, dtype=np.float64)\ny = np.linspace(0, 2 * h / d, num=h+1, dtype=np.float64)\n\nA, B = np.meshgrid(x * np.pi, y * np.pi)\nC = 8.0 * np.exp((A + B * 1j) * 1j)\n\nE, Z, dZ = np.zeros_like(C), np.zeros_like(C), np.zeros_like(C)\nD, I, J = np.zeros(C.shape), np.zeros(C.shape, dtype=np.int64), np.zeros(C.shape, dtype=np.int64)\n\nfor k in range(n):\n Z2 = Z.real ** 2 + Z.imag ** 2\n M, R = Z2 < r ** 2, Z2 < E.real ** 2 + E.imag ** 2\n E[R], I[R] = Z[R], J[R] # rebase when z is closer to zero\n E[M], I[M] = (2 * S[I[M]] + E[M]) * E[M] + C[M], I[M] + 1\n Z[M], dZ[M] = S[I[M]] + E[M], 2 * Z[M] * dZ[M] + 1\n\nN = abs(Z) > 2 # exterior distance estimation\nD[N] = np.log(abs(Z[N])) * abs(Z[N]) / abs(dZ[N])\n\nplt.imshow(D.T ** 0.015, cmap=plt.cm.nipy_spectral, origin=\"lower\")\nplt.savefig(\"Mercator_Mandelbrot_deep_map.png\", dpi=200)\n","language":"Python"},{"code":"print(\n'\\n'.join(\n ''.join(\n ' *'[(z:=0, c:=x/50+y/50j, [z:=z*z+c for _ in range(99)], abs(z))[-1]<2]\n for x in range(-100,25)\n )\n for y in range(-50,50)\n))\n","language":"Python"},{"code":"/adapted from https://www.linkedin.com/pulse/want-work-k-1010data-michal-wallace\nq)s:{(.[-]x*x),2*prd x} / complex square (x is R,Im pair)\nq)m:{floor sqrt sum x*x} / magnitude (distance from origin)\nq)d: 120 60 / dimensions of the picture\nq)t: -88 -30 / camera translation\nq)f: reciprocal 40 20 / scale factor\n\nq)c: (,/:\\:) . f * t + til each d / complex plane near mandelbrot set\nq)z: d # enlist 0 0 / 3d array of zeroes in same shape\nq)mb: c+ (s'')@\t\t\t\t\t / mandelbrot: s(z) + c\nq)r: 1 _ 8 mb\\z / collect 8 times\n\nq)o: \" 12345678\"@ sum 2<m'''[r] / \"color\" by how soon point \"escapes\"\n\nq)-1 \"\\n\"sv flip o; / transpose and print the output\n","language":"Q"},{"code":"SCREEN 13\nWINDOW (-2, 1.5)-(2, -1.5)\nFOR x0 = -2 TO 2 STEP .01\n FOR y0 = -1.5 TO 1.5 STEP .01\n x = 0\n y = 0\n\n iteration = 0\n maxIteration = 223\n\n WHILE (x * x + y * y <= (2 * 2) AND iteration < maxIteration)\n xtemp = x * x - y * y + x0\n y = 2 * x * y + y0\n\n x = xtemp\n\n iteration = iteration + 1\n WEND\n\n IF iteration <> maxIteration THEN\n c = iteration\n ELSE\n c = 0\n END IF\n\n PSET (x0, y0), c + 32\n NEXT\nNEXT\n","language":"QBasic"},{"code":"1000 REM Mandelbrot Set Project\n1010 REM Quite BASIC Math Project\n1015 REM 'http://www.quitebasic.com/prj/math/mandelbrot/\n1020 REM ------------------------\n1030 CLS\n1040 PRINT \"This program plots a graphical representation of the famous Mandelbrot set. It takes a while to finish so have patience and don't have too high expectations; the graphics resolution is not very high on our canvas.\"\n2000 REM Initialize the color palette\n2010 GOSUB 3000\n2020 REM L is the maximum iterations to try\n2030 LET L = 100\n2040 FOR I = 0 TO 100\n2050 FOR J = 0 TO 100\n2060 REM Map from pixel coordinates (I,J) to math (U,V)\n2060 LET U = I / 50 - 1.5\n2070 LET V = J / 50 - 1\n2080 LET X = U\n2090 LET Y = V\n2100 LET N = 0\n2110 REM Inner iteration loop starts here\n2120 LET R = X * X\n2130 LET Q = Y * Y\n2140 IF R + Q > 4 OR N >= L THEN GOTO 2190\n2150 LET Y = 2 * X * Y + V\n2160 LET X = R - Q + U\n2170 LET N = N + 1\n2180 GOTO 2120\n2190 REM Compute the color to plot\n2200 IF N < 10 THEN LET C = \"black\" ELSE LET C = P[ROUND(8 * (N-10) / (L-10))]\n2210 PLOT I, J, C\n2220 NEXT J\n2230 NEXT I\n2240 END\n3000 REM Subroutine -- Set up Palette\n3010 ARRAY P\n3020 LET P[0] = \"black\"\n3030 LET P[1] = \"magenta\"\n3040 LET P[2] = \"blue\"\n3050 LET P[3] = \"green\"\n3060 LET P[4] = \"cyan\"\n3070 LET P[5] = \"red\"\n3080 LET P[6] = \"orange\"\n3090 LET P[7] = \"yellow\"\n3090 LET P[8] = \"white\"\n3100 RETURN\n","language":"Quite-BASIC"},{"code":"iterate.until.escape <- function(z, c, trans, cond, max=50, response=dwell) {\n #we iterate all active points in the same array operation,\n #and keeping track of which points are still iterating.\n active <- seq_along(z)\n dwell <- z\n dwell[] <- 0\n for (i in 1:max) {\n z[active] <- trans(z[active], c[active]);\n survived <- cond(z[active])\n dwell[active[!survived]] <- i\n active <- active[survived]\n if (length(active) == 0) break\n }\n eval(substitute(response))\n}\n\nre = seq(-2, 1, len=500)\nim = seq(-1.5, 1.5, len=500)\nc <- outer(re, im, function(x,y) complex(real=x, imaginary=y))\nx <- iterate.until.escape(array(0, dim(c)), c,\n function(z,c)z^2+c, function(z)abs(z) <= 2,\n max=100)\nimage(x)\n","language":"R"},{"code":"#install.packages(\"caTools\") # install external package (if missing)\nlibrary(caTools) # external package providing write.gif function\njet.colors <- colorRampPalette(c(\"red\", \"blue\", \"#007FFF\", \"cyan\", \"#7FFF7F\",\n \"yellow\", \"#FF7F00\", \"red\", \"#7F0000\"))\ndx <- 800 # define width\ndy <- 600 # define height\nC <- complex(real = rep(seq(-2.5, 1.5, length.out = dx), each = dy),\n imag = rep(seq(-1.5, 1.5, length.out = dy), dx))\nC <- matrix(C, dy, dx) # reshape as square matrix of complex numbers\nZ <- 0 # initialize Z to zero\nX <- array(0, c(dy, dx, 20)) # initialize output 3D array\nfor (k in 1:20) { # loop with 20 iterations\n Z <- Z^2 + C # the central difference equation\n X[, , k] <- exp(-abs(Z)) # capture results\n}\nwrite.gif(X, \"Mandelbrot.gif\", col = jet.colors, delay = 100)\n","language":"R"},{"code":"#lang racket\n\n(require racket/draw)\n\n(define (iterations a z i)\n (define z′ (+ (* z z) a))\n (if (or (= i 255) (> (magnitude z′) 2))\n i\n (iterations a z′ (add1 i))))\n\n(define (iter->color i)\n (if (= i 255)\n (make-object color% \"black\")\n (make-object color% (* 5 (modulo i 15)) (* 32 (modulo i 7)) (* 8 (modulo i 31)))))\n\n(define (mandelbrot width height)\n (define target (make-bitmap width height))\n (define dc (new bitmap-dc% [bitmap target]))\n (for* ([x width] [y height])\n (define real-x (- (* 3.0 (/ x width)) 2.25))\n (define real-y (- (* 2.5 (/ y height)) 1.25))\n (send dc set-pen (iter->color (iterations (make-rectangular real-x real-y) 0 0)) 1 'solid)\n (send dc draw-point x y))\n (send target save-file \"mandelbrot.png\" 'png))\n\n(mandelbrot 300 200)\n","language":"Racket"},{"code":"constant MAX-ITERATIONS = 64;\nmy $width = +(@*ARGS[0] // 800);\nmy $height = $width + $width %% 2;\nsay \"P2\";\nsay \"$width $height\";\nsay MAX-ITERATIONS;\n\nsub cut(Range $r, UInt $n where $n > 1 --> Seq) {\n $r.min, * + ($r.max - $r.min) / ($n - 1) ... $r.max\n}\n\nmy @re = cut(-2 .. 1/2, $width);\nmy @im = cut( 0 .. 5/4, 1 + ($height div 2)) X* 1i;\n\nsub mandelbrot(Complex $z is copy, Complex $c --> Int) {\n for 1 .. MAX-ITERATIONS {\n $z = $z*$z + $c;\n return $_ if $z.abs > 2;\n }\n return 0;\n}\n\nmy @lines = hyper for @im X+ @re {\n mandelbrot(0i, $_);\n}.rotor($width);\n\n.put for @lines[1..*].reverse;\n.put for @lines;\n","language":"Raku"},{"code":"use Image::PNG::Portable;\n\nmy ($w, $h) = 800, 800;\nmy $out = Image::PNG::Portable.new: :width($w), :height($h);\n\nmy $maxIter = 150;\n\nmy @re = scale(-2.05 .. 1.05, $h);\nmy @im = scale( -11/8 .. 11/8, $w) X* 1i;\n\nfor ^($w div 2) -> $x {\n ^$h .map: -> $y {\n my $i = (mandelbrot( @re[$y] + @im[$x] ) / $maxIter) ** .25;\n my @hsv = hsv2rgb($i, 1, ?$i).rotate;\n $out.set: $x, $y, |@hsv;\n $out.set: $w - 1 - $x, $y, |@hsv;\n }\n}\n\n$out.write: 'Mandelbrot-set-perl6.png';\n\nsub scale (Range $r,Int $n) { $r.min, * + ($r.max - $r.min) / ($n - 1) ... $r.max }\n\nsub mandelbrot(Complex $c) {\n my $z = $c;\n for ^$maxIter {\n\t $z = $z * $z + $c;\n\t .return if $z.abs > 2;\n }\n 0\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":"/*REXX program generates and displays a Mandelbrot set as an ASCII art character image.*/\n@ = '>=<;:9876543210/.-,+*)(''&%$#\"!' /*the characters used in the display. */\nXsize = 59; minRE = -2; maxRE = +1; stepX = (maxRE-minRE) / Xsize\nYsize = 21; minIM = -1; maxIM = +1; stepY = (maxIM-minIM) / Ysize\n\n do y=0 for ysize; im=minIM + stepY*y\n $=\n do x=0 for Xsize; re=minRE + stepX*x; zr=re; zi=im\n\n do n=0 for 30; a=zr**2; b=zi**2; if a+b>4 then leave\n zi=zr*zi*2 + im; zr=a-b+re\n end /*n*/\n\n $=$ || substr(@, n+1, 1) /*append number (as a char) to $ string*/\n end /*x*/\n say $ /*display a line of character output.*/\n end /*y*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"/*REXX program generates and displays a Mandelbrot set as an ASCII art character image.*/\n@ = '█▓▒░@9876543210=.-,+*)(·&%$#\"!' /*the characters used in the display. */\nXsize = 59; minRE = -2; maxRE = +1; stepX = (maxRE-minRE) / Xsize\nYsize = 21; minIM = -1; maxIM = +1; stepY = (maxIM-minIM) / Ysize\n\n do y=0 for ysize; im=minIM + stepY*y\n $=\n do x=0 for Xsize; re=minRE + stepX*x; zr=re; zi=im\n\n do n=0 for 30; a=zr**2; b=zi**2; if a+b>4 then leave\n zi=zr*zi*2 + im; zr=a-b+re\n end /*n*/\n\n $=$ || substr(@, n+1, 1) /*append number (as a char) to $ string*/\n end /*x*/\n say $ /*display a line of character output.*/\n end /*y*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"/*REXX program generates and displays a Mandelbrot set as an ASCII art character image.*/\n@ = '█▓▒░@9876543210=.-,+*)(·&%$#\"!' /*the characters used in the display. */\nparse arg Xsize Ysize . /*obtain optional arguments from the CL*/\nif Xsize=='' then Xsize=linesize() - 1 /*X: the (usable) linesize (minus 1).*/\nif Ysize=='' then Ysize=Xsize%2 + (Xsize//2==1) /*Y: half the linesize (make it even).*/\nminRE = -2; maxRE = +1; stepX = (maxRE-minRE) / Xsize\nminIM = -1; maxIM = +1; stepY = (maxIM-minIM) / Ysize\n\n do y=0 for ysize; im=minIM + stepY*y\n $=\n do x=0 for Xsize; re=minRE + stepX*x; zr=re; zi=im\n\n do n=0 for 30; a=zr**2; b=zi**2; if a+b>4 then leave\n zi=zr*zi*2 + im; zr=a-b+re\n end /*n*/\n\n $=$ || substr(@, n+1, 1) /*append number (as a char) to $ string*/\n end /*x*/\n say $ /*display a line of character output.*/\n end /*y*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"load \"guilib.ring\"\n\nnew qapp\n {\n win1 = new qwidget() {\n setwindowtitle(\"Mandelbrot set\")\n setgeometry(100,100,500,500)\n label1 = new qlabel(win1) {\n setgeometry(10,10,400,400)\n settext(\"\")\n }\n new qpushbutton(win1) {\n setgeometry(200,400,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(1)\n }\n new qpainter() {\n begin(p1)\n setpen(pen)\n\n x1=300 y1=250\n i1=-1 i2=1 r1=-2 r2=1\n s1=(r2-r1)/x1 s2=(i2-i1)/y1\n for y=0 to y1\n i3=i1+s2*y\n for x=0 to x1\n r3=r1+s1*x z1=r3 z2=i3\n for n=0 to 30\n a=z1*z1 b=z2*z2\n if a+b>4 exit ok\n z2=2*z1*z2+i3 z1=a-b+r3\n next\n if n != 31 drawpoint(x,y) ok\n next\n next\n\n endpaint()\n }\n label1 { setpicture(p1) show() }\n","language":"Ring"},{"code":"require 'complex'\n\ndef mandelbrot(a)\n Array.new(50).inject(0) { |z,c| z*z + a }\nend\n\n(1.0).step(-1,-0.05) do |y|\n (-2.0).step(0.5,0.0315) do |x|\n print mandelbrot(Complex(x,y)).abs < 2 ? '*' : ' '\n end\n puts\nend\n","language":"Ruby"},{"code":"# frozen_string_literal: true\n\nrequire_relative 'raster_graphics'\n\nclass RGBColour\n def self.mandel_colour(i)\n self.new( 16*(i % 15), 32*(i % 7), 8*(i % 31) )\n end\nend\n\nclass Pixmap\n def self.mandelbrot(width, height)\n mandel = Pixmap.new(width,height)\n pb = ProgressBar.new(width) if $DEBUG\n width.times do |x|\n height.times do |y|\n x_ish = Float(x - width*11/15) / (width/3)\n y_ish = Float(y - height/2) / (height*3/10)\n mandel[x,y] = RGBColour.mandel_colour(mandel_iters(x_ish, y_ish))\n end\n pb.update(x) if $DEBUG\n end\n pb.close if $DEBUG\n mandel\n end\n\n def self.mandel_iters(cx,cy)\n x = y = 0.0\n count = 0\n while Math.hypot(x,y) < 2 and count < 255\n x, y = (x**2 - y**2 + cx), (2*x*y + cy)\n count += 1\n end\n count\n end\nend\n\nPixmap.mandelbrot(300,300).save('mandel.ppm')\n","language":"Ruby"},{"code":"# frozen_string_literal: true\n\ndef setup\n sketch_title 'Mandelbrot'\n load_pixels\n no_loop\nend\n\ndef draw\n grid(900, 600) do |x, y|\n const = Complex(\n map1d(x, (0...900), (-3..1.5)), map1d(y, (0...600), (-1.5..1.5))\n )\n pixels[x + y * 900] = color(\n constrained_map(mandel(const, 20), (5..20), (255..0))\n )\n end\n update_pixels\nend\n\ndef mandel(z, max)\n score = 0\n const = z\n while score < max\n # z = z^2 + c\n z *= z\n z += const\n break if z.abs > 2\n\n score += 1\n end\n score\nend\n\ndef settings\n size(900, 600)\nend\n","language":"Ruby"},{"code":"'Mandelbrot V4 for RunBasic\n'Based on LibertyBasic solution\n'copy the code and go to runbasic.com\n'http://rosettacode.org/wiki/Mandelbrot_set#Liberty_BASIC\n'May 2015 (updated 29 Apr 2018)\n'\n'Note - we only get so much processing time on the server, so the\n'graph is computed in three or four pieces\n'\nWindowWidth = 320 'RunBasic max size 800 x 600\nWindowHeight = 320\n'print zone -2 to 1 (X)\n'print zone -1.5 to 1.5 (Y)\na = -1.5 'graph -1.5 to -0.75, first \"loop\"\nb = -0.75 'adjust for max processor time (y0 for loop below)\n\n'open \"Mandelbrot Set\" for graphics_nsb_nf as #w not used in RunBasic\n\ngraphic #w, WindowWidth, WindowHeight\n'#w \"trapclose [quit]\" not used in RunBasic\n'#w \"down\" not used in RunBasic\n\ncls\n'#w flush()\n#w cls(\"black\")\nrender #w\n '#w flush()\ninput \"OK, hit enter to continue\"; guess\ncls\n\n[man_calc]\n'3/screen size 3/800 = 0.00375 ** 3/790 = 0.0037974\n'3/screen size (y) 3/600 = .005 ** 3/590 = 0.0050847\n'3/215 = .0139 .0068 = 3/440\ncc = 3/299\n'\n for x0 = -2 to 1 step cc\n for y0 = a to b step cc\n x = 0\n y = 0\n\n iteration = 0\n maxIteration = 255\n\n while ( ( x *x +y *y) <=4) and ( iteration <maxIteration)\n xtemp =x *x -y *y +x0\n y =2 *x *y +y0\n x = xtemp\n iteration = iteration + 1\n wend\n\n if iteration <>maxIteration then\n c =iteration\n else\n c =0\n end if\n\n call pSet x0, y0, c\n 'scan why scan? (wait for user input) with RunBasic ?\n next\nnext\n\n'#w flush() 'what is flush? RunBasic uses the render command.\nrender #w\n\ninput \"OK, hit enter to continue\"; guess\ncls\na = a + 0.75\nb = b + 0.75\nif b > 1.6 then goto[quit] else goto[man_calc]\n\nsub pSet x, y, c\n xScreen = 5+(x +2) /3 * 300 'need positive screen number\n yScreen = 5+(y +1.5) /3 * 300 'and 5x5 boarder\n if c =0 then\n col$ =\"red\"\n else\n if c mod 2 =1 then col$ =\"lightgray\" else col$ =\"white\"\n end if\n #w \"color \"; col$\n #w \"set \"; xScreen; \" \"; yScreen\nend sub\n\n[quit]\n'cls\nprint\nprint \"This is a Mandelbrot Graph output from www.runbasic.com\"\nrender #w\nprint \"All done, good bye.\"\nend\n","language":"Run-BASIC"},{"code":"extern crate image;\nextern crate num_complex;\n\nuse num_complex::Complex;\n\nfn main() {\n let max_iterations = 256u16;\n let img_side = 800u32;\n let cxmin = -2f32;\n let cxmax = 1f32;\n let cymin = -1.5f32;\n let cymax = 1.5f32;\n let scalex = (cxmax - cxmin) / img_side as f32;\n let scaley = (cymax - cymin) / img_side as f32;\n\n // Create a new ImgBuf\n let mut imgbuf = image::ImageBuffer::new(img_side, img_side);\n\n // Calculate for each pixel\n for (x, y, pixel) in imgbuf.enumerate_pixels_mut() {\n let cx = cxmin + x as f32 * scalex;\n let cy = cymin + y as f32 * scaley;\n\n let c = Complex::new(cx, cy);\n let mut z = Complex::new(0f32, 0f32);\n\n let mut i = 0;\n for t in 0..max_iterations {\n if z.norm() > 2.0 {\n break;\n }\n z = z * z + c;\n i = t;\n }\n\n *pixel = image::Luma([i as u8]);\n }\n\n // Save image\n imgbuf.save(\"fractal.png\").unwrap();\n}\n","language":"Rust"},{"code":"$canvasWidth: 200;\n$canvasHeight: 200;\n$iterations: 20;\n$xCorner: -2;\n$yCorner: -1.5;\n$zoom: 3;\n$data: ()!global;\n@mixin plot ($x,$y,$count){\n $index: ($y * $canvasWidth + $x) * 4;\n $r: $count * -12 + 255;\n $g: $count * -12 + 255;\n $b: $count * -12 + 255;\n $data: append($data, $x + px $y + px 0 rgb($r,$g,$b), comma)!global;\n}\n\n@for $x from 1 to $canvasWidth {\n @for $y from 1 to $canvasHeight {\n $count: 0;\n $size: 0;\n $cx: $xCorner + (($x * $zoom) / $canvasWidth);\n $cy: $yCorner + (($y * $zoom) / $canvasHeight);\n\n $zx: 0;\n $zy: 0;\n\n @while $count < $iterations and $size <= 4 {\n $count: $count + 1;\n $temp: ($zx * $zx) - ($zy * $zy);\n $zy: (2 * $zx * $zy) + $cy;\n $zx: $temp + $cx;\n $size: ($zx * $zx) + ($zy * $zy);\n }\n\n @include plot($x, $y, $count);\n }\n}\n.set {\n height: 1px;\n width: 1px;\n position: absolute;\n top: 50%;\n left: 50%;\n transform: translate($canvasWidth*0.5px, $canvasWidth*0.5px);\n box-shadow: $data;\n}\n","language":"Sass-SCSS"},{"code":"import org.rosettacode.ArithmeticComplex._\nimport java.awt.Color\n\nobject Mandelbrot\n{\n def generate(width:Int =600, height:Int =400)={\n val bm=new RgbBitmap(width, height)\n\n val maxIter=1000\n val xMin = -2.0\n val xMax = 1.0\n val yMin = -1.0\n val yMax = 1.0\n\n val cx=(xMax-xMin)/width\n val cy=(yMax-yMin)/height\n\n for(y <- 0 until bm.height; x <- 0 until bm.width){\n val c=Complex(xMin+x*cx, yMin+y*cy)\n val iter=itMandel(c, maxIter, 4)\n bm.setPixel(x, y, getColor(iter, maxIter))\n }\n bm\n }\n\n def itMandel(c:Complex, imax:Int, bailout:Int):Int={\n var z=Complex()\n for(i <- 0 until imax){\n z=z*z+c;\n if(z.abs > bailout) return i\n }\n imax;\n }\n\n def getColor(iter:Int, max:Int):Color={\n if (iter==max) return Color.BLACK\n\n var c=3*math.log(iter)/math.log(max-1.0)\n if(c<1) new Color((255*c).toInt, 0, 0)\n else if(c<2) new Color(255, (255*(c-1)).toInt, 0)\n else new Color(255, 255, (255*(c-2)).toInt)\n }\n}\n","language":"Scala"},{"code":"import scala.swing._\nimport javax.swing.ImageIcon\nval imgMandel=Mandelbrot.generate()\nval mainframe=new MainFrame(){title=\"Test\"; visible=true\n contents=new Label(){icon=new ImageIcon(imgMandel.image)}\n}\n","language":"Scala"},{"code":"(define x-centre -0.5)\n(define y-centre 0.0)\n(define width 4.0)\n(define i-max 800)\n(define j-max 600)\n(define n 100)\n(define r-max 2.0)\n(define file \"out.pgm\")\n(define colour-max 255)\n(define pixel-size (/ width i-max))\n(define x-offset (- x-centre (* 0.5 pixel-size (+ i-max 1))))\n(define y-offset (+ y-centre (* 0.5 pixel-size (+ j-max 1))))\n\n(define (inside? z)\n (define (*inside? z-0 z n)\n (and (< (magnitude z) r-max)\n (or (= n 0)\n (*inside? z-0 (+ (* z z) z-0) (- n 1)))))\n (*inside? z 0 n))\n\n(define (boolean->integer b)\n (if b colour-max 0))\n\n(define (pixel i j)\n (boolean->integer\n (inside?\n (make-rectangular (+ x-offset (* pixel-size i))\n (- y-offset (* pixel-size j))))))\n\n(define (plot)\n (with-output-to-file file\n (lambda ()\n (begin (display \"P2\") (newline)\n (display i-max) (newline)\n (display j-max) (newline)\n (display colour-max) (newline)\n (do ((j 1 (+ j 1))) ((> j j-max))\n (do ((i 1 (+ i 1))) ((> i i-max))\n (begin (display (pixel i j)) (newline))))))))\n\n(plot)\n","language":"Scheme"},{"code":";; A program written for CHICKEN Scheme version 5.3.0 and various\n;; eggs.\n\n(import (r7rs))\n(import (scheme base))\n(import (scheme case-lambda))\n(import (scheme inexact))\n\n(import (prefix sdl2 \"sdl2:\"))\n(import (prefix imlib2 \"imlib2:\"))\n\n(import (format))\n(import (matchable))\n(import (simple-exceptions))\n\n(define sdl2-subsystems-used '(events video))\n\n;; ------------------------------\n;; Basics for using the sdl2 egg:\n(sdl2:set-main-ready!)\n(sdl2:init! sdl2-subsystems-used)\n(on-exit sdl2:quit!)\n(current-exception-handler\n (let ((original-handler (current-exception-handler)))\n (lambda (exception)\n (sdl2:quit!)\n (original-handler exception))))\n;; ------------------------------\n\n(define-record-type <mandel-params>\n (%%make-mandel-params)\n mandel-params?\n (window ref-window set-window!)\n (xcenter ref-xcenter set-xcenter!)\n (ycenter ref-ycenter set-ycenter!)\n (pixels-per-unit ref-pixels-per-unit set-pixels-per-unit!)\n (pixels-per-event-check ref-pixels-per-event-check\n set-pixels-per-event-check!)\n (max-escape-time ref-max-escape-time set-max-escape-time!))\n\n(define initial-width 400)\n(define initial-height 400)\n(define initial-xcenter -3/4)\n(define initial-ycenter 0)\n(define initial-pixels-per-unit 150)\n(define initial-pixels-per-event-check 1000)\n(define initial-max-escape-time 1000)\n\n(define (make-mandel-params window)\n (let ((params (%%make-mandel-params)))\n (set-window! params window)\n (set-xcenter! params initial-xcenter)\n (set-ycenter! params initial-ycenter)\n (set-pixels-per-unit! params initial-pixels-per-unit)\n (set-pixels-per-event-check! params\n initial-pixels-per-event-check)\n (set-max-escape-time! params initial-max-escape-time)\n params))\n\n(define window (sdl2:create-window! \"mandelbrot set task\"\n 'centered 'centered\n initial-width initial-height\n '()))\n(define params (make-mandel-params window))\n\n(define empty-color (sdl2:make-color 200 200 200))\n\n(define (clear-mandel!)\n (sdl2:fill-rect! (sdl2:window-surface (ref-window params))\n #f empty-color)\n (sdl2:update-window-surface! window))\n\n(define drawing? #t)\n(define redraw? #f)\n\n(define (draw-mandel! event-checker)\n (clear-mandel!)\n (let repeat ()\n (let*-values\n (((window) (ref-window params))\n ((width height) (sdl2:window-size window)))\n (let* ((xcenter (ref-xcenter params))\n (ycenter (ref-ycenter params))\n (pixels-per-unit (ref-pixels-per-unit params))\n (pixels-per-event-check\n (ref-pixels-per-event-check params))\n (max-escape-time (ref-max-escape-time params))\n (step (/ 1.0 pixels-per-unit))\n (xleft (- xcenter (/ width (* 2.0 pixels-per-unit))))\n (ytop (+ ycenter (/ height (* 2.0 pixels-per-unit))))\n (pixel-count 0))\n (do ((j 0 (+ j 1))\n (cy ytop (- cy step)))\n ((= j height))\n (do ((i 0 (+ i 1))\n (cx xleft (+ cx step)))\n ((= i width))\n (let* ((color (compute-color-by-escape-time-algorithm\n cx cy max-escape-time)))\n (sdl2:surface-set! (sdl2:window-surface window)\n i j color)\n (if (= pixel-count pixels-per-event-check)\n (let ((event-checker (call/cc event-checker)))\n (cond (redraw?\n (set! redraw? #f)\n (clear-mandel!)\n (repeat)))\n (set! pixel-count 0))\n (set! pixel-count (+ pixel-count 1)))))\n ;; Display a row.\n (sdl2:update-window-surface! window))))\n (set! drawing? #f)\n (repeat)))\n\n(define (compute-color-by-escape-time-algorithm\n cx cy max-escape-time)\n (escape-time->color (compute-escape-time cx cy max-escape-time)\n max-escape-time))\n\n(define (compute-escape-time cx cy max-escape-time)\n (let loop ((x 0.0)\n (y 0.0)\n (iter 0))\n (if (= iter max-escape-time)\n iter\n (let ((xsquared (* x x))\n (ysquared (* y y)))\n (if (< 4 (+ xsquared ysquared))\n iter\n (let ((x (+ cx (- xsquared ysquared)))\n (y (+ cy (* (+ x x) y))))\n (loop x y (+ iter 1))))))))\n\n(define (escape-time->color escape-time max-escape-time)\n ;; This is a very naive and ad hoc algorithm for choosing colors,\n ;; but hopefully will suffice for the task. With this algorithm, at\n ;; least one can zoom in and see some of the fractal-like structures\n ;; out on the filaments.\n (let* ((initial-ppu initial-pixels-per-unit)\n (ppu (ref-pixels-per-unit params))\n (fraction (* (/ (log escape-time) (log max-escape-time))))\n (fraction (if (= fraction 1.0)\n fraction\n (* fraction\n (/ (log initial-ppu)\n (log (max initial-ppu (* 0.05 ppu)))))))\n (value (- 255 (min 255 (exact-rounded (* fraction 255))))))\n (sdl2:make-color value value value)))\n\n(define (exact-rounded x)\n (exact (round x)))\n\n(define (event-loop)\n (define event (sdl2:make-event))\n (define painter draw-mandel!)\n (define zoom-ratio 2)\n\n (define (recenter! xcoord ycoord)\n (let*-values\n (((window) (ref-window params))\n ((width height) (sdl2:window-size window))\n ((ppu) (ref-pixels-per-unit params)))\n (set-xcenter! params\n (+ (ref-xcenter params)\n (/ (- (* 2.0 xcoord) width) (* 2.0 ppu))))\n (set-ycenter! params\n (+ (ref-ycenter params)\n (/ (- height (* 2.0 ycoord)) (* 2.0 ppu))))))\n\n (define (zoom-in!)\n (let* ((ppu (ref-pixels-per-unit params))\n (ppu (* ppu zoom-ratio)))\n (set-pixels-per-unit! params ppu)))\n\n (define (zoom-out!)\n (let* ((ppu (ref-pixels-per-unit params))\n (ppu (* (/ 1.0 zoom-ratio) ppu)))\n (set-pixels-per-unit! params (max 1 ppu))))\n\n (define (restore-original-settings!)\n (set-xcenter! params initial-xcenter)\n (set-ycenter! params initial-ycenter)\n (set-pixels-per-unit! params initial-pixels-per-unit)\n (set-pixels-per-event-check!\n params initial-pixels-per-event-check)\n (set-max-escape-time! params initial-max-escape-time)\n (set! zoom-ratio 2))\n\n (define dump-image! ; Really this should put up a dialog.\n (let ((dump-number 1))\n (lambda ()\n (let*-values\n (((window) (ref-window params))\n ((width height) (sdl2:window-size window))\n ((surface) (sdl2:window-surface window)))\n (let ((filename (string-append \"mandelbrot-image-\"\n (number->string dump-number)\n \".png\"))\n (img (imlib2:image-create width height)))\n (do ((j 0 (+ j 1)))\n ((= j height))\n (do ((i 0 (+ i 1)))\n ((= i width))\n (let-values\n (((r g b a) (sdl2:color->values\n (sdl2:surface-ref surface i j))))\n (imlib2:image-draw-pixel\n img (imlib2:color/rgba r g b a) i j))))\n (imlib2:image-alpha-set! img #f)\n (imlib2:image-save img filename)\n (format #t \"~a written~%\" filename)\n (set! dump-number (+ dump-number 1)))))))\n\n (let loop ()\n (when redraw?\n (set! drawing? #t))\n (when drawing?\n (set! painter (call/cc painter)))\n (set! redraw? #f)\n (if (not (sdl2:poll-event! event))\n (loop)\n (begin\n (match (sdl2:event-type event)\n ('quit) ; Quit by leaving the loop.\n ('window\n (match (sdl2:window-event-event event)\n ;; It should be possible to resize the window, but I\n ;; have not yet figured out how to do this with SDL2\n ;; and not crash sometimes.\n ((or 'exposed 'restored)\n (sdl2:update-window-surface! (ref-window params))\n (loop))\n (_ (loop))))\n ('mouse-button-down\n (recenter! (sdl2:mouse-button-event-x event)\n (sdl2:mouse-button-event-y event))\n (set! redraw? #t)\n (loop))\n ('key-down\n (match (sdl2:keyboard-event-sym event)\n ('q 'quit-by-leaving-the-loop)\n ((or 'plus 'kp-plus)\n (zoom-in!)\n (set! redraw? #t)\n (loop))\n ((or 'minus 'kp-minus)\n (zoom-out!)\n (set! redraw? #t)\n (loop))\n ((or 'n-2 'kp-2)\n (set! zoom-ratio 2)\n (loop))\n ((or 'n-3 'kp-3)\n (set! zoom-ratio 3)\n (loop))\n ((or 'n-4 'kp-4)\n (set! zoom-ratio 4)\n (loop))\n ((or 'n-5 'kp-5)\n (set! zoom-ratio 5)\n (loop))\n ((or 'n-6 'kp-6)\n (set! zoom-ratio 6)\n (loop))\n ((or 'n-7 'kp-7)\n (set! zoom-ratio 7)\n (loop))\n ((or 'n-8 'kp-8)\n (set! zoom-ratio 8)\n (loop))\n ((or 'n-9 'kp-9)\n (set! zoom-ratio 9)\n (loop))\n ('o\n (restore-original-settings!)\n (set! redraw? #t)\n (loop))\n ('p\n (dump-image!)\n (loop))\n (some-key-in-which-we-are-not-interested\n (loop))))\n (some-event-in-which-we-are-not-interested\n (loop)))))))\n\n;; At the least this legend should go in a window, but printing it to\n;; the terminal will, hopefully, suffice for the task.\n(format #t \"~%~8tACTIONS~%\")\n(format #t \"~8t-------~%\")\n(define fmt \"~2t~a~15t: ~a~%\")\n(format #t fmt \"Q key\" \"quit\")\n(format #t fmt \"mouse button\" \"recenter\")\n(format #t fmt \"+ key\" \"zoom in\")\n(format #t fmt \"- key\" \"zoom in\")\n(format #t fmt \"2 .. 9 key\" \"set zoom ratio\")\n(format #t fmt \"O key\" \"restore original\")\n(format #t fmt \"P key\" \"dump to a PNG\")\n(format #t \"~%\")\n\n(event-loop)\n","language":"Scheme"},{"code":"put 0 into oReal # Real origin\nput 0 into oImag # Imaginary origin\nput 0.5 into mag # Magnification\n\nput oReal - .8 / mag into leftReal\nput oImag + .5 / mag into topImag\nput 1 / 200 / mag into inc\n\nput [\n\t(0,255,255),\t# aqua\t\n\t(0,0,255), # blue\n\t(255,0,255), # fuchsia\n\t(128,128,128), # gray\t\n\t(0,128,0), # green\n\t(0,255,0), # lime\t\n\t(128,0,0), # maroon\n\t(0,0,128), # navy\t\n\t(128,128,0), # olive\n\t(128,0,128), # purple\n\t(255,0,0), # red\n\t(192,192,192), # silver\n\t(0,128,128), # teal\n\t(255,255,255), # white\n\t(255,255,0) #\tyellow\n] into colors\n\nput \"mandelbrot.ppm\" into myFile\n\nopen file myFile for writing\nwrite \"P3\" & return to file myFile # PPM file magic number\nwrite \"320 200\" & return to file myFile # Width and height\nwrite \"255\" & return to file myFile # Max value in color channels\n\nput topImag into cImag\nrepeat with each item in 1 .. 200\n\tput leftReal into cReal\n\trepeat with each item in 1 .. 320\n\t\tput 0 into zReal\n\t\tput 0 into zImag\n\t\tput 0 into count\n\t\tput 0 into size\n\t\trepeat at least once until size > 2 or count = 100\n\t\t\tput zReal squared + zImag squared * -1 into newZreal\n\t\t\tput zReal * zImag + zReal * zImag into newZimag\n\t\t\tput newZreal + cReal into zReal\n\t\t\tput newZimag + cImag into zImag\n\t\t\tput sqrt(zReal squared + zImag squared) into size\n\t\t\tadd 1 to count\n\t\tend repeat\n\t\tif size > 2 then # Outside the set - colorize\n\t\t\tput item count mod 15 + 1 of colors into color\n\t\t\twrite color joined by \" \" to file myFile\n\t\t\twrite return to file myFile\n\t\telse # Inside the set - black\n\t\t\twrite \"0 0 0\" & return to file myFile\n\t\tend if\n\t\tadd inc to cReal\n\tend repeat\n\tsubtract inc from cImag\nend repeat\n\nclose file myFile\n","language":"SenseTalk"},{"code":"import <Utilities/Complex.sl>;\nimport <Utilities/Sequence.sl>;\nimport <Utilities/Math.sl>;\n\nCOLOR_STRUCT ::= (R: int(0), G: int(0), B: int(0));\nrgb(r(0), g(0), b(0)) := (R: r, G: g, B: b);\n\nRESULT_STRUCT ::= (FinalValue: Complex(0), Iterations: int(0));\nmakeResult(val(0), iters(0)) := (FinalValue: val, Iterations: iters);\n\nzSquaredOperation(startingNum(0), currentNum(0)) :=\n complexAdd(startingNum, complexMultiply(currentNum, currentNum));\n\nzSquared(minX(0), maxX(0), resolutionX(0), minY(0), maxY(0), resolutionY(0), maxMagnitude(0), maxIters(0))[Y,X] :=\n let\n stepX := (maxX - minX) / resolutionX;\n stepY := (maxY - minY) / resolutionY;\n\n currentX := X * stepX + minX;\n currentY := Y * stepY + minY;\n\n in\n operateUntil(zSquaredOperation, makeComplex(currentX, currentY), makeComplex(currentX, currentY), maxMagnitude, 0, maxIters)\n foreach Y within 0 ... (resolutionY - 1),\n X within 0 ... (resolutionX - 1);\n\noperateUntil(operation(0), startingNum(0), currentNum(0), maxMagnitude(0), currentIters(0), maxIters(0)) :=\n let\n operated := operation(startingNum, currentNum);\n in\n makeResult(currentNum, maxIters) when currentIters >= maxIters\n else\n makeResult(currentNum, currentIters) when complexMagnitude(currentNum) >= maxMagnitude\n else\n operateUntil(operation, startingNum, operated, maxMagnitude, currentIters + 1, maxIters);\n\n//region Smooth Coloring\n\nCOLOR_COUNT := size(colorSelections);\n\ncolorRange := range(0, 255, 1);\n\ncolors :=\n let\n first[i] := rgb(0, 0, i) foreach i within colorRange;\n second[i] := rgb(i, i, 255) foreach i within colorRange;\n third[i] := rgb(255, 255, i) foreach i within reverse(colorRange);\n fourth[i] := rgb(255, i, 0) foreach i within reverse(colorRange);\n fifth[i] := rgb(i, 0, 0) foreach i within reverse(colorRange);\n\n red[i] := rgb(i, 0, 0) foreach i within colorRange;\n redR[i] := rgb(i, 0, 0) foreach i within reverse(colorRange);\n green[i] := rgb(0, i, 0) foreach i within colorRange;\n greenR[i] :=rgb(0, i, 0) foreach i within reverse(colorRange);\n blue[i] := rgb(0, 0, i) foreach i within colorRange;\n blueR[i] := rgb(0, 0, i) foreach i within reverse(colorRange);\n\n in\n //red ++ redR ++ green ++ greenR ++ blue ++ blueR;\n first ++ second ++ third ++ fourth ++ fifth;\n //first ++ fourth;\n\ncolorSelections := range(1, size(colors), 30);\n\ngetSmoothColorings(zSquaredResult(2), maxIters(0))[Y,X] :=\n let\n current := zSquaredResult[Y,X];\n\n zn := complexMagnitude(current.FinalValue);\n nu := ln(ln(zn) / ln(2)) / ln(2);\n\n result := abs(current.Iterations + 1 - nu);\n\n index := floor(result);\n rem := result - index;\n\n color1 := colorSelections[(index mod COLOR_COUNT) + 1];\n color2 := colorSelections[((index + 1) mod COLOR_COUNT) + 1];\n in\n rgb(0, 0, 0) when current.Iterations = maxIters\n else\n colors[color1] when color2 < color1\n else\n colors[floor(linearInterpolate(color1, color2, rem))];\n\nlinearInterpolate(v0(0), v1(0), t(0)) := (1 - t) * v0 + t * v1;\n\n//endregion\n","language":"SequenceL"},{"code":"#include \"SL_Generated.h\"\n#include \"../../../ThirdParty/CImg/CImg.h\"\n\nusing namespace std;\nusing namespace cimg_library;\n\nint main(int argc, char ** argv)\n{\n int cores = 0;\n\n Sequence<Sequence<_sl_RESULT_STRUCT> > computeResult;\n Sequence<Sequence<_sl_COLOR_STRUCT> > colorResult;\n\n sl_init(cores);\n\n int maxIters = 1000;\n int imageWidth = 1920;\n int imageHeight = 1200;\n double maxMag = 256;\n\n double xmin = -2.5;\n double xmax = 1.0;\n double ymin = -1.0;\n double ymax = 1.0;\n\n CImg<unsigned char> visu(imageWidth, imageHeight, 1, 3);\n CImgDisplay draw_disp(visu, \"Mandelbrot Fractal in SequenceL\");\n\n bool redraw = true;\n\n SLTimer t;\n\n double computeTime;\n double colorTime;\n double renderTime;\n\n while(!draw_disp.is_closed())\n {\n if(redraw)\n {\n redraw = false;\n\n t.start();\n sl_zSquared(xmin, xmax, imageWidth, ymin, ymax, imageHeight, maxMag, maxIters, cores, computeResult);\n t.stop();\n computeTime = t.getTime();\n\n t.start();\n sl_getSmoothColorings(computeResult, maxIters, cores, colorResult);\n t.stop();\n colorTime = t.getTime();\n\n t.start();\n\n visu.fill(0);\n for(int i = 1; i <= colorResult.size(); i++)\n {\n for(int j = 1; j <= colorResult[i].size(); j++)\n {\n visu(j-1,i-1,0,0) = colorResult[i][j].R;\n visu(j-1,i-1,0,1) = colorResult[i][j].G;\n visu(j-1,i-1,0,2) = colorResult[i][j].B;\n }\n }\n visu.display(draw_disp);\n\n t.stop();\n\n renderTime = t.getTime();\n\n draw_disp.set_title(\"X:[%f, %f] Y:[%f, %f] | Mandelbrot Fractal in SequenceL | Compute Time: %f | Color Time: %f | Render Time: %f | Total FPS: %f\", xmin, xmax, ymin, ymax, cores, computeTime, colorTime, renderTime, 1 / (computeTime + colorTime + renderTime));\n }\n\n draw_disp.wait();\n\n double xdiff = (xmax - xmin);\n double ydiff = (ymax - ymin);\n\n double xcenter = ((1.0 * draw_disp.mouse_x()) / imageWidth) * xdiff + xmin;\n double ycenter = ((1.0 * draw_disp.mouse_y()) / imageHeight) * ydiff + ymin;\n\n if(draw_disp.button()&1)\n {\n redraw = true;\n xmin = xcenter - (xdiff / 4);\n xmax = xcenter + (xdiff / 4);\n ymin = ycenter - (ydiff / 4);\n ymax = ycenter + (ydiff / 4);\n }\n else if(draw_disp.button()&2)\n {\n redraw = true;\n xmin = xcenter - xdiff;\n xmax = xcenter + xdiff;\n ymin = ycenter - ydiff;\n ymax = ycenter + ydiff;\n }\n }\n\n sl_done();\n\n return 0;\n}\n","language":"SequenceL"},{"code":"func mandelbrot(z) {\n var c = z\n { z = (z*z + c)\n z.abs > 2 && return true\n } * 20\n return false\n}\n \nfor y range(1, -1, -0.05) {\n for x in range(-2, 0.5, 0.0315) {\n print(mandelbrot(x + y.i) ? ' ' : '#')\n }\n print \"\\n\"\n}\n","language":"Sidef"},{"code":"BEGIN\n REAL XCENTRE, YCENTRE, WIDTH, RMAX, XOFFSET, YOFFSET, PIXELSIZE;\n INTEGER N, IMAX, JMAX, COLOURMAX;\n TEXT FILENAME;\n\n CLASS COMPLEX(RE,IM); REAL RE,IM;;\n\n REF(COMPLEX) PROCEDURE ADD(A,B); REF(COMPLEX) A,B;\n ADD :- NEW COMPLEX(A.RE + B.RE, A.IM + B.IM);\n\n REF(COMPLEX) PROCEDURE SUB(A,B); REF(COMPLEX) A,B;\n SUB :- NEW COMPLEX(A.RE - B.RE, A.IM - B.IM);\n\n REF(COMPLEX) PROCEDURE MUL(A,B); REF(COMPLEX) A,B;\n MUL :- NEW COMPLEX(A.RE * B.RE - A.IM * B.IM,\n A.RE * B.IM + A.IM * B.RE);\n\n REF(COMPLEX) PROCEDURE DIV(A,B); REF(COMPLEX) A,B;\n BEGIN\n REAL TMP;\n TMP := B.RE * B.RE + B.IM * B.IM;\n DIV :- NEW COMPLEX((A.RE * B.RE + A.IM * B.IM) / TMP,\n (A.IM * B.RE - A.RE * B.IM) / TMP);\n END DIV;\n\n REF(COMPLEX) PROCEDURE RECTANGULAR(RE,IM); REAL RE,IM;\n RECTANGULAR :- NEW COMPLEX(RE,IM);\n\n REAL PROCEDURE MAGNITUDE(CX); REF(COMPLEX) CX;\n MAGNITUDE := SQRT(CX.RE**2 + CX.IM**2);\n\n BOOLEAN PROCEDURE INSIDEP(Z); REF(COMPLEX) Z;\n BEGIN\n BOOLEAN PROCEDURE INSIDE(Z0,Z,N); REAL N; REF(COMPLEX) Z,Z0;\n INSIDE := MAGNITUDE(Z) < RMAX\n AND THEN N = 0 OR ELSE INSIDE(Z0, ADD(Z0,MUL(Z,Z)), N-1);\n INSIDEP := INSIDE(Z, NEW COMPLEX(0,0), N);\n END INSIDEP;\n\n INTEGER PROCEDURE BOOL2INT(B); BOOLEAN B;\n BOOL2INT := IF B THEN COLOURMAX ELSE 0;\n\n INTEGER PROCEDURE PIXEL(I,J); INTEGER I,J;\n PIXEL := BOOL2INT(INSIDEP(RECTANGULAR(XOFFSET + PIXELSIZE * I,\n YOFFSET - PIXELSIZE * J)));\n PROCEDURE PLOT;\n BEGIN\n REF (OUTFILE) OUTF;\n INTEGER J,I;\n OUTF :- NEW OUTFILE(FILENAME);\n OUTF.OPEN(BLANKS(132));\n OUTF.OUTTEXT(\"P2\"); OUTF.OUTIMAGE;\n OUTF.OUTINT(IMAX,0); OUTF.OUTIMAGE;\n OUTF.OUTINT(JMAX,0); OUTF.OUTIMAGE;\n OUTF.OUTINT(COLOURMAX,0); OUTF.OUTIMAGE;\n FOR J := 1 STEP 1 UNTIL JMAX DO\n BEGIN\n FOR I := 1 STEP 1 UNTIL IMAX DO\n BEGIN\n OUTF.OUTINT(PIXEL(I,J),0);\n OUTF.OUTIMAGE;\n END;\n END;\n OUTF.CLOSE;\n END PLOT;\n\n XCENTRE := -0.5;\n YCENTRE := 0.0;\n WIDTH := 4.0;\n IMAX := 800;\n JMAX := 600;\n N := 100;\n RMAX := 2.0;\n FILENAME :- \"out.pgm\";\n COLOURMAX := 255;\n PIXELSIZE := WIDTH / IMAX;\n XOFFSET := XCENTRE - (0.5 * PIXELSIZE * (IMAX + 1));\n YOFFSET := YCENTRE + (0.5 * PIXELSIZE * (JMAX + 1));\n\n OUTTEXT(\"OUTPUT WILL BE WRITTEN TO \");\n OUTTEXT(FILENAME);\n OUTIMAGE;\n\n PLOT;\nEND;\n","language":"Simula"},{"code":" 10 FOR I=0 TO 63\n 20 FOR J=43 TO 0 STEP -1\n 30 LET X=(I-52)/31\n 40 LET Y=(J-22)/31\n 50 LET XA=0\n 60 LET YA=0\n 70 LET ITER=0\n 80 LET XTEMP=XA*XA-YA*YA+X\n 90 LET YA=2*XA*YA+Y\n100 LET XA=XTEMP\n110 LET ITER=ITER+1\n120 IF XA*XA+YA*YA<=4 AND ITER<200 THEN GOTO 80\n130 IF ITER=200 THEN PLOT I, J\n140 NEXT J\n150 NEXT I\n","language":"Sinclair-ZX81-BASIC"},{"code":"X = RNDF()*4-2\nY = RNDF()*4-2@N\nN = N+16\nI = X+S*S-T*T\nT = Y+S*T*2\nS = I\nIF N < #L&&S*S+T*T < 4 GOTO @N\nGPSET X*50+99, Y*50+99, RGB(99 XOR N,N,N)\nEXEC.\n","language":"Sinclair-ZX81-BASIC"},{"code":"OPTION STRICT\nVAR XP, YP, X, Y, X0, Y0, X2, Y2\nVAR NEXT_X, IT, C\nFOR XP = -200 TO 199\n FOR YP = -120 TO 119\n X = 0: Y = 0\n X0 = XP / 100: Y0 = YP / 100\n IT = 0\n X2 = X * X: Y2 = Y * Y\n WHILE X2 + Y2 <= 4 AND IT < 100\n NEXT_X = X2 - Y2 + X0\n Y = 2 * X * Y + Y0\n X = NEXT_X\n X2 = X * X: Y2 = Y * Y\n INC IT\n WEND\n IF IT == 100 THEN C = 0 ELSE C = IT\n GPSET XP + 200, YP + 120, RGB((C * 3) MOD 200 + 50, FLOOR(C * 1.2) + 20, C)\n NEXT\nNEXT\n","language":"Sinclair-ZX81-BASIC"},{"code":"#!/usr/local/bin/spar\npragma annotate( summary, \"mandel\" )\n @( description, \"Create a color image of the Mandelbrot set\" )\n @( author, \"Ken O. Burtch\" );\npragma license( unrestricted );\n\npragma restriction( no_external_commands );\n\nprocedure mandel is\n\n mandel_limit : constant long_float := 4.0; -- reach this? it's the set\n max_iterations : constant integer := 128; -- quit if looped this amt\n\n center_r : constant long_float := -0.75; -- center of set (x=real)\n center_i : constant long_float := 0.0; -- center of set (i=imag.)\n\n c_r : long_float; -- current point (x=real)\n c_i : long_float; -- current point (i=imag.)\n\n loop_count : integer; -- number of iterations\n\n z_r : long_float; -- mandelbot set formula\n z_i : long_float; -- variables\n z_r2 : long_float;\n z_i2 : long_float;\n\n c : pen.canvas_id; -- bush drawing canvas\n plot : limited pen.rect; -- rectangle to draw with\n s : string;\n\n bits : integer; -- for determining color\n red : pen.rgbcomponent;\n green: pen.rgbcomponent;\n blue : pen.rgbcomponent;\nbegin\n\n -- create the drawing canvas\n\n pen.new_window_canvas( 200, 200, 32, c );\n pen.set_title( c, \"Mandelbrot\" );\n\n -- loop for the size of the canvas (-50% to +50%)\n\n for i in -50..50 loop\n c_i := center_i - long_float(i)*0.025;\n pen.wait_to_reveal( c );\n for r in -50..50 loop\n c_r := center_r - long_float(r)*0.025;\n\n -- Evaluatuate how close point (c_z, c_i ) in complex number space\n -- is to the Mandelbrot set. Return a number between 0 and\n -- max_iterations. A value of max_iterations implies that the point\n -- is probably a member of the Mandelbrot set.\n\n z_r := c_r;\n z_i := c_i;\n loop_count := 1;\n loop\n z_i2 := z_i*z_i;\n z_r2 := z_r*z_r;\n z_i := 2.0 * z_r * z_i + c_i;\n z_r := z_r2 - z_i2 + c_r;\n loop_count := @+1;\n exit when not ( (z_r2 + z_i2 < mandel_limit) and (loop_count /= max_iterations) );\n end loop;\n\n -- pick a color based on loop_count (mandelbrot set is black)\n\n if loop_count = max_iterations then\n red := 0.0;\n green := 0.0;\n blue := 0.0;\n else\n bits := (loop_count and 3 );\n red := 100.0-pen.rgbcomponent((100*bits/3));\n bits := (loop_count / 3 ) and 3;\n green := 100.0-pen.rgbcomponent((100*bits/3));\n bits := (loop_count / 27 ) and 2;\n blue := 100.0-pen.rgbcomponent((100*bits)/2);\n end if;\n pen.set_pen_ink( c, red, green, blue );\n\n -- Draw the point, reversing the X axis\n\n pen.set_rect( plot, 100-(r+50),i+50, 100-(r+49), i+51 );\n pen.paint_rect( c, plot );\n end loop;\n pen.reveal( c );\n end loop;\n\n ? \"Press return\";\n s := get_line;\n\nend mandel;\n","language":"SparForte"},{"code":"con\n _clkmode = xtal1+pll16x\n _clkfreq = 80_000_000\n\n xmin=-8601 ' int(-2.1*4096)\n xmax=2867 ' int( 0.7*4096)\n\n ymin=-4915 ' int(-1.2*4096)\n ymax=4915 ' int( 1.2*4096)\n\n maxiter=25\n\nobj\n ser : \"FullDuplexSerial\"\n\npub main | c,cx,cy,dx,dy,x,y,x2,y2,iter\n\n ser.start(31, 30, 0, 115200)\n\n dx:=(xmax-xmin)/79\n dy:=(ymax-ymin)/24\n\n cy:=ymin\n repeat while cy=<ymax\n cx:=xmin\n repeat while cx=<xmax\n x:=0\n y:=0\n x2:=0\n y2:=0\n iter:=0\n repeat while iter=<maxiter and x2+y2=<16384\n y:=((x*y)~>11)+cy\n x:=x2-y2+cx\n iter+=1\n x2:=(x*x)~>12\n y2:=(y*y)~>12\n cx+=dx\n ser.tx(iter+32)\n cy+=dy\n ser.str(string(13,10))\n\n waitcnt(_clkfreq+cnt)\n ser.stop\n","language":"Spin"},{"code":"w,h = #.scrsize()\nsfx = -2.5; sfy = -2*h/w; fs = 4/w\n#.aaoff()\n> y, 1...h\n > x, 1...w\n fx = sfx + x*fs; fy = sfy + y*fs\n #.drawpoint(x,y,color(fx,fy):3)\n <\n<\ncolor(x,y)=\n zr = x; zi = y; n = 0; maxn = 150\n > zr*zr+zi*zi<4 & n<maxn\n zrn = zr*zr-zi*zi+x; zin = 2*zr*zi+y\n zr = zrn; zi = zin; n += 1\n <\n ? n=maxn, <= 0,0,0\n <= #.hsv2rgb(n/maxn*360,1,1):3\n.\n","language":"SPL"},{"code":"import Foundation\nimport Numerics\nimport QDBMP\n\npublic typealias Color = (red: UInt8, green: UInt8, blue: UInt8)\n\npublic class BitmapDrawer {\n public let imageHeight: Int\n public let imageWidth: Int\n\n var grid: [[Color?]]\n\n private let bmp: OpaquePointer\n\n public init(height: Int, width: Int) {\n self.imageHeight = height\n self.imageWidth = width\n self.grid = [[Color?]](repeating: [Color?](repeating: nil, count: height), count: width)\n self.bmp = BMP_Create(UInt(width), UInt(height), 24)\n\n checkError()\n }\n\n deinit {\n BMP_Free(bmp)\n }\n\n private func checkError() {\n let err = BMP_GetError()\n\n guard err == BMP_STATUS(0) else {\n fatalError(\"\\(err)\")\n }\n }\n\n public func save(to path: String = \"~/Desktop/out.bmp\") {\n for x in 0..<imageWidth {\n for y in 0..<imageHeight {\n guard let color = grid[x][y] else { continue }\n\n BMP_SetPixelRGB(bmp, UInt(x), UInt(y), color.red, color.green, color.blue)\n checkError()\n }\n }\n\n (path as NSString).expandingTildeInPath.withCString {s in\n BMP_WriteFile(bmp, s)\n }\n }\n\n public func setPixel(x: Int, y: Int, to color: Color?) {\n grid[x][y] = color\n }\n}\n\nlet imageSize = 10_000\nlet canvas = BitmapDrawer(height: imageSize, width: imageSize)\nlet maxIterations = 256\nlet cxMin = -2.0\nlet cxMax = 1.0\nlet cyMin = -1.5\nlet cyMax = 1.5\nlet scaleX = (cxMax - cxMin) / Double(imageSize)\nlet scaleY = (cyMax - cyMin) / Double(imageSize)\n\nfor x in 0..<imageSize {\n for y in 0..<imageSize {\n let cx = cxMin + Double(x) * scaleX\n let cy = cyMin + Double(y) * scaleY\n\n let c = Complex(cx, cy)\n var z = Complex(0.0, 0.0)\n var i = 0\n\n for t in 0..<maxIterations {\n if z.magnitude > 2 {\n break\n }\n\n z = z * z + c\n i = t\n }\n\n canvas.setPixel(x: x, y: y, to: Color(red: UInt8(i), green: UInt8(i), blue: UInt8(i)))\n }\n}\n\ncanvas.save()\n","language":"Swift"},{"code":"package require Tk\n\nproc mandelIters {cx cy} {\n set x [set y 0.0]\n for {set count 0} {hypot($x,$y) < 2 && $count < 255} {incr count} {\n set x1 [expr {$x*$x - $y*$y + $cx}]\n set y1 [expr {2*$x*$y + $cy}]\n set x $x1; set y $y1\n }\n return $count\n}\nproc mandelColor {iter} {\n set r [expr {16*($iter % 15)}]\n set g [expr {32*($iter % 7)}]\n set b [expr {8*($iter % 31)}]\n format \"#%02x%02x%02x\" $r $g $b\n}\nimage create photo mandel -width 300 -height 300\n# Build picture in strips, updating as we go so we have \"progress\" monitoring\n# Also set the cursor to tell the user to wait while we work.\npack [label .mandel -image mandel -cursor watch]\nupdate\nfor {set x 0} {$x < 300} {incr x} {\n for {set y 0} {$y < 300} {incr y} {\n set i [mandelIters [expr {($x-220)/100.}] [expr {($y-150)/90.}]]\n mandel put [mandelColor $i] -to $x $y\n }\n update\n}\n.mandel configure -cursor {}\n","language":"Tcl"},{"code":"PROGRAM:MANDELBR\n:Input \"ITER. \",D\n:For(A,Xmin,Xmax,ΔX)\n:For(B,Ymin,Ymax,ΔY)\n:0→X\n:0→Y\n:0→I\n:D→M\n:While X^2+Y^2≤4 and I<M\n:X^2-Y^2+A→R\n:2XY+B→Y\n:R→X\n:I+1→I\n:End\n:If I≠M\n:Then\n:I→C\n:Else\n:0→C\n:End\n:If C<1\n:Pt-On(A,B)\n:End\n:End\n:End\n","language":"TI-83-BASIC"},{"code":"SET WINDOW 0, 256, 0, 192\n\nLET x1 = 256/2\nLET y1 = 192/2\nLET i1 = -1\nLET i2 = 1\nLET r1 = -2\nLET r2 = 1\nLET s1 = (r2-r1) / x1\nLET s2 = (i2-i1) / y1\n\nFOR y = 0 TO y1 STEP .05\n LET i3 = i1 + s2 * y\n FOR x = 0 TO x1 STEP .05\n LET r3 = r1 + s1 * x\n LET z1 = r3\n LET z2 = i3\n FOR n = 0 TO 30\n LET a = z1 * z1\n LET b = z2 * z2\n IF a+b > 4 THEN EXIT FOR\n LET z2 = 2 * z1 * z2 + i3\n LET z1 = a - b + r3\n NEXT n\n SET COLOR n - 16*INT(n/16)\n PLOT POINTS: x,y\n NEXT x\nNEXT y\nEND\n","language":"True-BASIC"},{"code":"(defvar x-centre -0.5)\n(defvar y-centre 0.0)\n(defvar width 4.0)\n(defvar i-max 800)\n(defvar j-max 600)\n(defvar n 100)\n(defvar r-max 2.0)\n(defvar file \"mandelbrot.pgm\")\n(defvar colour-max 255)\n(defvar pixel-size (/ width i-max))\n(defvar x-offset (- x-centre (* 0.5 pixel-size (+ i-max 1))))\n(defvar y-offset (+ y-centre (* 0.5 pixel-size (+ j-max 1))))\n\n;; with-output-to-file macro\n(defmacro with-output-to-file (name . body)\n ^(let ((*stdout* (open-file ,name \"w\")))\n (unwind-protect (progn ,*body) (close-stream *stdout*))))\n\n;; complex number library\n(defmacro cplx (x y) ^(cons ,x ,y))\n(defmacro re (c) ^(car ,c))\n(defmacro im (c) ^(cdr ,c))\n\n(defsymacro c0 '(0 . 0))\n\n(macro-time\n (defun with-cplx-expand (specs body)\n (tree-case specs\n (((re im expr) . rest)\n ^(tree-bind (,re . ,im) ,expr ,(with-cplx-expand rest body)))\n (() (tree-case body\n ((a b . rest) ^(progn ,a ,b ,*rest))\n ((a) a)\n (x (error \"with-cplx: invalid body ~s\" body))))\n (x (error \"with-cplx: bad args ~s\" x)))))\n\n(defmacro with-cplx (specs . body)\n (with-cplx-expand specs body))\n\n(defun c+ (x y)\n (with-cplx ((a b x) (c d y))\n (cplx (+ a c) (+ b d))))\n\n(defun c* (x y)\n (with-cplx ((a b x) (c d y))\n (cplx (- (* a c) (* b d)) (+ (* b c) (* a d)))))\n\n(defun modulus (z)\n (with-cplx ((a b z))\n (sqrt (+ (* a a) (* b b)))))\n\n;; Mandelbrot routines\n(defun inside-p (z0 : (z c0) (n n))\n (and (< (modulus z) r-max)\n (or (zerop n)\n (inside-p z0 (c+ (c* z z) z0) (- n 1)))))\n\n(defmacro int-bool (b)\n ^(if ,b colour-max 0))\n\n(defun pixel (i j)\n (int-bool\n (inside-p\n (cplx (+ x-offset (* pixel-size i))\n (- y-offset (* pixel-size j))))))\n\n;; Mandelbrot loop and output\n(defun plot ()\n (with-output-to-file file\n (format t \"P2\\n~s\\n~s\\n~s\\n\" i-max j-max colour-max)\n (each ((j (range 1 j-max)))\n (each ((i (range 1 i-max)))\n (format *stdout* \"~s \" (pixel i j)))\n (put-line \"\" *stdout*))))\n\n(plot)\n","language":"TXR"},{"code":"function mandelbrot() {\n local -ir maxiter=100\n local -i i j {x,y}m{in,ax} d{x,y}\n local -ra C=( {0..9} )\n local -i lC=${#C[*]}\n local -i columns=${COLUMNS:-72} lines=${LINES:-24}\n\n ((\n xmin=-21*4096/10,\n xmax= 7*4096/10,\n\n ymin=-12*4096/10,\n ymax= 12*4096/10,\n\n dx=(xmax-xmin)/columns,\n dy=(ymax-ymin)/lines\n ))\n\n for ((cy=ymax, i=0; i<lines; cy-=dy, i++))\n do for ((cx=xmin, j=0; j<columns; cx+=dx, j++))\n do (( x=0, y=0, x2=0, y2=0 ))\n for (( iter=0; iter<maxiter && x2+y2<=16384; iter++ ))\n do\n ((\n y=((x*y)>>11)+cy,\n x=x2-y2+cx,\n x2=(x*x)>>12,\n y2=(y*y)>>12\n ))\n done\n ((c=iter%lC))\n echo -n \"${C[c]}\"\n done\n echo\n done\n}\n","language":"UNIX-Shell"},{"code":"// updates and contributors at: github.com/vlang/v/blob/master/examples/gg/mandelbrot.v\n// graphics are moveable by keyboard or mouse and resizable with window\nimport gg\nimport gx\nimport runtime\nimport time\n\nconst (\n\tpwidth = 800\n\tpheight = 600\n\tchunk_height = 2 // image recalculated in chunks, each chunk processed in separate thread\n\tzoom_factor = 1.1\n\tmax_iterations = 255\n)\n\nstruct ViewRect {\n\tmut:\n\tx_min f64\n\tx_max f64\n\ty_min f64\n\ty_max f64\n}\n\nfn (v &ViewRect) width() f64 {\n\treturn v.x_max - v.x_min\n}\n\nfn (v &ViewRect) height() f64 {\n\treturn v.y_max - v.y_min\n}\n\nstruct AppState {\n\tmut:\n\tgg &gg.Context = unsafe { nil }\n\tiidx int\n\tpixels &u32 = unsafe { vcalloc(pwidth * pheight * sizeof(u32)) }\n\tnpixels &u32 = unsafe { vcalloc(pwidth * pheight * sizeof(u32)) } // drawings here, results swapped at the end\n\tview ViewRect = ViewRect{-3.0773593290970673, 1.4952456603855397, -2.019938598189011, 2.3106642054225945}\n\tscale int = 1\n\tntasks int = runtime.nr_jobs()\n}\n\nconst colors = [gx.black, gx.blue, gx.red, gx.green, gx.yellow, gx.orange, gx.purple, gx.white,\n\tgx.indigo, gx.violet, gx.black, gx.blue, gx.orange, gx.yellow, gx.green].map(u32(it.abgr8()))\n\nstruct MandelChunk {\n\tcview ViewRect\n\tymin f64\n\tymax f64\n}\n\nfn (mut state AppState) update() {\n\tmut chunk_channel := chan MandelChunk{cap: state.ntasks}\n\tmut chunk_ready_channel := chan bool{cap: 1000}\n\tmut threads := []thread{cap: state.ntasks}\n\tdefer {\n\t\tchunk_channel.close()\n\t\tthreads.wait()\n\t}\n\tfor t in 0 .. state.ntasks {\n\t\tthreads << spawn state.worker(t, chunk_channel, chunk_ready_channel)\n\t}\n\t//\n\tmut oview := ViewRect{}\n\tmut sw := time.new_stopwatch()\n\tfor {\n\t\tsw.restart()\n\t\tcview := state.view\n\t\tif oview == cview {\n\t\t\ttime.sleep(5 * time.millisecond)\n\t\t\tcontinue\n\t\t}\n\t\t// schedule chunks, describing the work:\n\t\tmut nchunks := 0\n\t\tfor start := 0; start < pheight; start += chunk_height {\n\t\t\tchunk_channel <- MandelChunk{\n\t\t\t\tcview: cview\n\t\t\t\tymin: start\n\t\t\t\tymax: start + chunk_height\n\t\t\t}\n\t\t\tnchunks++\n\t\t}\n\t\t// wait for all chunks to be processed:\n\t\tfor _ in 0 .. nchunks {\n\t\t\t_ := <-chunk_ready_channel\n\t\t}\n\t\t// everything is done, swap the buffer pointers\n\t\tstate.pixels, state.npixels = state.npixels, state.pixels\n\t\tprintln('${state.ntasks:2} threads; ${sw.elapsed().milliseconds():3} ms / frame; scale: ${state.scale:4}')\n\t\toview = cview\n\t}\n}\n\n[direct_array_access]\nfn (mut state AppState) worker(id int, input chan MandelChunk, ready chan bool) {\n\tfor {\n\t\tchunk := <-input or { break }\n\t\tyscale := chunk.cview.height() / pheight\n\t\txscale := chunk.cview.width() / pwidth\n\t\tmut x, mut y, mut iter := 0.0, 0.0, 0\n\t\tmut y0 := chunk.ymin * yscale + chunk.cview.y_min\n\t\tmut x0 := chunk.cview.x_min\n\t\tfor y_pixel := chunk.ymin; y_pixel < chunk.ymax && y_pixel < pheight; y_pixel++ {\n\t\t\tyrow := unsafe { &state.npixels[int(y_pixel * pwidth)] }\n\t\t\ty0 += yscale\n\t\t\tx0 = chunk.cview.x_min\n\t\t\tfor x_pixel := 0; x_pixel < pwidth; x_pixel++ {\n\t\t\t\tx0 += xscale\n\t\t\t\tx, y = x0, y0\n\t\t\t\tfor iter = 0; iter < max_iterations; iter++ {\n\t\t\t\t\tx, y = x * x - y * y + x0, 2 * x * y + y0\n\t\t\t\t\tif x * x + y * y > 4 {\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tunsafe {\n\t\t\t\t\tyrow[x_pixel] = colors[iter & 15]\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tready <- true\n\t}\n}\n\nfn (mut state AppState) draw() {\n\tmut istream_image := state.gg.get_cached_image_by_idx(state.iidx)\n\tistream_image.update_pixel_data(unsafe { &u8(state.pixels) })\n\tsize := gg.window_size()\n\tstate.gg.draw_image(0, 0, size.width, size.height, istream_image)\n}\n\nfn (mut state AppState) zoom(zoom_factor f64) {\n\tc_x, c_y := (state.view.x_max + state.view.x_min) / 2, (state.view.y_max + state.view.y_min) / 2\n\td_x, d_y := c_x - state.view.x_min, c_y - state.view.y_min\n\tstate.view.x_min = c_x - zoom_factor * d_x\n\tstate.view.x_max = c_x + zoom_factor * d_x\n\tstate.view.y_min = c_y - zoom_factor * d_y\n\tstate.view.y_max = c_y + zoom_factor * d_y\n\tstate.scale += if zoom_factor < 1 { 1 } else { -1 }\n}\n\nfn (mut state AppState) center(s_x f64, s_y f64) {\n\tc_x, c_y := (state.view.x_max + state.view.x_min) / 2, (state.view.y_max + state.view.y_min) / 2\n\td_x, d_y := c_x - state.view.x_min, c_y - state.view.y_min\n\tstate.view.x_min = s_x - d_x\n\tstate.view.x_max = s_x + d_x\n\tstate.view.y_min = s_y - d_y\n\tstate.view.y_max = s_y + d_y\n}\n\n// gg callbacks:\n\nfn graphics_init(mut state AppState) {\n\tstate.iidx = state.gg.new_streaming_image(pwidth, pheight, 4, pixel_format: .rgba8)\n}\n\nfn graphics_frame(mut state AppState) {\n\tstate.gg.begin()\n\tstate.draw()\n\tstate.gg.end()\n}\n\nfn graphics_click(x f32, y f32, btn gg.MouseButton, mut state AppState) {\n\tif btn == .right {\n\t\tsize := gg.window_size()\n\t\tm_x := (x / size.width) * state.view.width() + state.view.x_min\n\t\tm_y := (y / size.height) * state.view.height() + state.view.y_min\n\t\tstate.center(m_x, m_y)\n\t}\n}\n\nfn graphics_move(x f32, y f32, mut state AppState) {\n\tif state.gg.mouse_buttons.has(.left) {\n\t\tsize := gg.window_size()\n\t\td_x := (f64(state.gg.mouse_dx) / size.width) * state.view.width()\n\t\td_y := (f64(state.gg.mouse_dy) / size.height) * state.view.height()\n\t\tstate.view.x_min -= d_x\n\t\tstate.view.x_max -= d_x\n\t\tstate.view.y_min -= d_y\n\t\tstate.view.y_max -= d_y\n\t}\n}\n\nfn graphics_scroll(e &gg.Event, mut state AppState) {\n\tstate.zoom(if e.scroll_y < 0 { zoom_factor } else { 1 / zoom_factor })\n}\n\nfn graphics_keydown(code gg.KeyCode, mod gg.Modifier, mut state AppState) {\n\ts_x := state.view.width() / 5\n\ts_y := state.view.height() / 5\n\t// movement\n\tmut d_x, mut d_y := 0.0, 0.0\n\tif code == .enter {\n\t\tprintln('> ViewRect{${state.view.x_min}, ${state.view.x_max}, ${state.view.y_min}, ${state.view.y_max}}')\n\t}\n\tif state.gg.pressed_keys[int(gg.KeyCode.left)] {\n\t\td_x -= s_x\n\t}\n\tif state.gg.pressed_keys[int(gg.KeyCode.right)] {\n\t\td_x += s_x\n\t}\n\tif state.gg.pressed_keys[int(gg.KeyCode.up)] {\n\t\td_y -= s_y\n\t}\n\tif state.gg.pressed_keys[int(gg.KeyCode.down)] {\n\t\td_y += s_y\n\t}\n\tstate.view.x_min += d_x\n\tstate.view.x_max += d_x\n\tstate.view.y_min += d_y\n\tstate.view.y_max += d_y\n\t// zoom in/out\n\tif state.gg.pressed_keys[int(gg.KeyCode.left_bracket)]\n\t\t|| state.gg.pressed_keys[int(gg.KeyCode.z)] {\n\t\tstate.zoom(1 / zoom_factor)\n\t\treturn\n\t}\n\tif state.gg.pressed_keys[int(gg.KeyCode.right_bracket)]\n\t\t|| state.gg.pressed_keys[int(gg.KeyCode.x)] {\n\t\tstate.zoom(zoom_factor)\n\t\treturn\n\t}\n}\n\nfn main() {\n\tmut state := &AppState{}\n\tstate.gg = gg.new_context(\n\t\twidth: 800\n\t\theight: 600\n\t\tcreate_window: true\n\t\twindow_title: 'The Mandelbrot Set'\n\t\tinit_fn: graphics_init\n\t\tframe_fn: graphics_frame\n\t\tclick_fn: graphics_click\n\t\tmove_fn: graphics_move\n\t\tkeydown_fn: graphics_keydown\n\t\tscroll_fn: graphics_scroll\n\t\tuser_data: state\n\t)\n\tspawn state.update()\n\tstate.gg.run()\n}\n","language":"V-(Vlang)"},{"code":"public class Example: Gtk.Application {\n private Gtk.ApplicationWindow window;\n private Gtk.DrawingArea drawing_area;\n public Example() {\n Object(application_id: \"my.application\", flags: ApplicationFlags.FLAGS_NONE);\n this.activate.connect(() => {\n window = new Gtk.ApplicationWindow(this);\n drawing_area = new Gtk.DrawingArea();\n drawing_area.set_draw_func(draw_mandelbrot);\n window.set_child(drawing_area);\n window.present();\n });\n }\n\n private void draw_mandelbrot(Gtk.DrawingArea area, Cairo.Context cr, int width, int height) {\n cr.set_source_rgb(0, 0, 0);\n cr.paint();\n int x0 = -1;\n double x_increment = 2.47 / (float) width;\n double y_increment = 2.24 / (float) height;\n for (double x = -2.0; x < 0.47; x += x_increment, x0++) {\n int y0 = -1;\n for (double y = -1.12; y < 1.12; y += y_increment, y0++) {\n double c_re = x;\n double c_im = y;\n double x_ = 0,\n y_ = 0;\n int iterations = 0;\n int max_iterations = 50;\n while (iterations < max_iterations && x_ * x_ + y_ * y_ <= 4.0) {\n double x_new = x_ * x_ - y_ * y_ + c_re;\n y_ = 2.0 * x_ * y_ + c_im;\n x_ = x_new;\n iterations++;\n }\n if (iterations < max_iterations) {\n cr.set_source_rgb((float) iterations / (float) max_iterations, 0, 0);\n cr.rectangle(x0, y0, 1, 1);\n cr.fill();\n }\n }\n }\n }\n\n public static int main(string[] argv) {\n var app = new Example();\n return app.run(argv);\n }\n}\n","language":"Vala"},{"code":"option explicit\n\n' Raster graphics class in VBSCRIPT by Antoni Gual\n'--------------------------------------------\n' An array keeps the image allowing to set pixels, draw lines and boxes in it.\n' at class destroy a bmp file is saved to disk and the default viewer is called\n' The class can work with 8 and 24 bit bmp. With 8 bit uses a built-in palette or can import a custom one\n\n\n'Declaration :\n' Set MyObj = (New ImgClass)(name,width,height, orient,bits_per_pixel,palette_array)\n' name:path and name of the file created\n' width, height of the canvas\n' orient is the way the coord increases, 1 to 4 think of the 4 cuadrants of the caterian plane\n' 1 X:l>r Y:b>t 2 X:r>l Y:b>t 3 X:r>l Y:t>b 4 X:l>r Y:t>b\n' bits_per_pixel can bs only 8 and 24\n' palette array only to substitute the default palette for 8 bits, else put a 0\n' it sets the origin at the corner of the image (bottom left if orient=1)\n\nClass ImgClass\n Private ImgL,ImgH,ImgDepth,bkclr,loc,tt\n private xmini,xmaxi,ymini,ymaxi,dirx,diry\n public ImgArray() 'rgb in 24 bit mode, indexes to palette in 8 bits\n private filename\n private Palette,szpal\n\n Public Property Let depth (x)\n if depth=8 or depth =24 then\n Imgdepth=depth\n else\n Imgdepth=8\n end if\n bytepix=imgdepth/8\n end property\n\n Public Property Let Pixel (x,y,color)\n If (x>=ImgL) or x<0 then exit property\n if y>=ImgH or y<0 then exit property\n ImgArray(x,y)=Color\n End Property\n\n Public Property Get Pixel (x,y)\n If (x<ImgL) And (x>=0) And (y<ImgH) And (y>=0) Then\n Pixel=ImgArray(x,y)\n End If\n End Property\n\n Public Property Get ImgWidth ()\n ImgWidth=ImgL-1\n End Property\n\n Public Property Get ImgHeight ()\n ImgHeight=ImgH-1\n End Property\n\n 'constructor (fn,w*2,h*2,32,0,0)\n Public Default Function Init(name,w,h,orient,dep,bkg,mipal)\n 'offx, offy posicion de 0,0. si ofx+ , x se incrementa de izq a der, si offy+ y se incrementa de abajo arriba\n dim i,j\n ImgL=w\n ImgH=h\n tt=timer\n set0 0,0 'origin blc positive up and right\n redim imgArray(ImgL-1,ImgH-1)\n bkclr=bkg\n if bkg<>0 then\n for i=0 to ImgL-1\n for j=0 to ImgH-1\n imgarray(i,j)=bkg\n next\n next\n end if\n Select Case orient\n Case 1: dirx=1 : diry=1\n Case 2: dirx=-1 : diry=1\n Case 3: dirx=-1 : diry=-1\n Case 4: dirx=1 : diry=-1\n End select\n filename=name\n ImgDepth =dep\n 'load user palette if provided\n if imgdepth=8 then\n loadpal(mipal)\n end if\n set init=me\n end function\n\n private sub loadpal(mipale)\n if isarray(mipale) Then\n palette=mipale\n szpal=UBound(mipale)+1\n Else\n szpal=256\n 'Default palette recycled from ATARI\n\n End if\n End Sub\n public sub set0 (x0,y0) 'origin can be changed during drawing\n if x0<0 or x0>=imgl or y0<0 or y0>imgh then err.raise 9\n xmini=-x0\n ymini=-y0\n xmaxi=xmini+imgl-1\n ymaxi=ymini+imgh-1\n\n end sub\n\n\n Private Sub Class_Terminate\n if err <>0 then wscript.echo \"Error \" & err.number\n wscript.echo \"writing bmp to file\"\n savebmp\n wscript.echo \"opening \" & filename\n CreateObject(\"Shell.Application\").ShellExecute filename\n wscript.echo timer-tt & \" seconds\"\n End Sub\n\n\n 'writes a 32bit integr value as binary to an utf16 string\n function long2wstr( x) 'falta muy poco!!!\n dim k1,k2,x1\n k1= (x and &hffff&)' or (&H8000& And ((X And &h8000&)<>0)))\n k2=((X And &h7fffffff&) \\ &h10000&) Or (&H8000& And (x<0))\n long2wstr=chrw(k1) & chrw(k2)\n end function\n\n function int2wstr(x)\n int2wstr=ChrW((x and &h7fff) or (&H8000 And (X<0)))\n End Function\n\n\n Public Sub SaveBMP\n 'Save the picture to a bmp file\n Dim s,ostream, x,y,loc\n\n const hdrs=54 '14+40\n dim bms:bms=ImgH* 4*(((ImgL*imgdepth\\8)+3)\\4) 'bitmap size including padding\n dim palsize:if (imgdepth=8) then palsize=szpal*4 else palsize=0\n\n with CreateObject(\"ADODB.Stream\") 'auxiliary ostream, it creates an UNICODE with bom stream in memory\n .Charset = \"UTF-16LE\" 'o \"UTF16-BE\"\n .Type = 2' adTypeText\n .open\n\n 'build a header\n 'bmp header: VBSCript does'nt have records nor writes binary values to files, so we use strings of unicode chars!!\n 'BMP header\n .writetext ChrW(&h4d42) ' 0 \"BM\" 4d42\n .writetext long2wstr(hdrs+palsize+bms) ' 2 fiesize\n .writetext long2wstr(0) ' 6 reserved\n .writetext long2wstr (hdrs+palsize) '10 image offset\n 'InfoHeader\n .writetext long2wstr(40) '14 infoheader size\n .writetext long2wstr(Imgl) '18 image length\n .writetext long2wstr(imgh) '22 image width\n .writetext int2wstr(1) '26 planes\n .writetext int2wstr(imgdepth) '28 clr depth (bpp)\n .writetext long2wstr(&H0) '30 compression used 0= NOCOMPR\n\n .writetext long2wstr(bms) '34 imgsize\n .writetext long2wstr(&Hc4e) '38 bpp hor\n .writetext long2wstr(&hc43) '42 bpp vert\n .writetext long2wstr(szpal) '46 colors in palette\n .writetext long2wstr(&H0) '50 important clrs 0=all\n\n 'write bitmap\n 'precalc data for orientation\n Dim x1,x2,y1,y2\n If dirx=-1 Then x1=ImgL-1 :x2=0 Else x1=0:x2=ImgL-1\n If diry=-1 Then y1=ImgH-1 :y2=0 Else y1=0:y2=ImgH-1\n\n Select Case imgdepth\n\n Case 32\n For y=y1 To y2 step diry\n For x=x1 To x2 Step dirx\n 'writelong fic, Pixel(x,y)\n .writetext long2wstr(Imgarray(x,y))\n Next\n Next\n\n Case 8\n 'palette\n For x=0 to szpal-1\n .writetext long2wstr(palette(x)) '52\n Next\n 'image\n dim pad:pad=ImgL mod 4\n For y=y1 to y2 step diry\n For x=x1 To x2 step dirx*2\n .writetext chrw((ImgArray(x,y) and 255)+ &h100& *(ImgArray(x+dirx,y) and 255))\n Next\n 'line padding\n if pad and 1 then .writetext chrw(ImgArray(x2,y))\n if pad >1 then .writetext chrw(0)\n Next\n\n Case Else\n WScript.Echo \"ColorDepth not supported : \" & ImgDepth & \" bits\"\n End Select\n\n 'use a second stream to save to file starting past the BOM the first ADODB.Stream has added\n Dim outf:Set outf= CreateObject(\"ADODB.Stream\")\n outf.Type = 1 ' adTypeBinary\n outf.Open\n .position=2 'remove bom (1 wchar)\n .CopyTo outf\n .close\n outf.savetofile filename,2 'adSaveCreateOverWrite\n outf.close\n end with\n End Sub\nEnd Class\n\nfunction mandelpx(x0,y0,maxit)\n dim x,y,xt,i,x2,y2\n i=0:x2=0:y2=0\n Do While i< maxit\n i=i+1\n xt=x2-y2+x0\n y=2*x*y+y0\n x=xt\n x2=x*x:y2=y*y\n If (x2+y2)>=4 Then Exit do\n loop\n if i=maxit then\n mandelpx=0\n else\n mandelpx = i\n end if\nend function\n\nSub domandel(x1,x2,y1,y2)\n Dim i,ii,j,jj,pix,xi,yi,ym\n ym=X.ImgHeight\\2\n 'get increments in the mandel plane\n xi=Abs((x1-x2)/X.ImgWidth)\n yi=Abs((y2-0)/(X.ImgHeight\\2))\n j=0\n For jj=0. To y2 Step yi\n i=0\n For ii=x1 To x2 Step xi\n pix=mandelpx(ii,jj,256)\n 'use simmetry\n X.imgarray(i,ym-j)=pix\n X.imgarray(i,ym+j)=pix\n i=i+1\n Next\n j=j+1\n next\nEnd Sub\n\n'main------------------------------------\nDim i,x\n'custom palette\ndim pp(255)\nfor i=1 to 255\n pp(i)=rgb(0,0,255*(i/255)^.25) 'VBS' RGB function is for the web, it's bgr for Windows BMP !!\nnext\n\ndim fn:fn=CreateObject(\"Scripting.FileSystemObject\").GetSpecialFolder(2)& \"\\mandel.bmp\"\nSet X = (New ImgClass)(fn,580,480,1,8,0,pp)\ndomandel -2.,1.,-1.2,1.2\nSet X = Nothing\n","language":"VBScript"},{"code":"#1 =-21000 // left edge = -2.1\n#2 = 15000 // right edge = 1.5\n#3 = 15000 // top edge = 1.5\n#4 =-15000 // bottom edge = -1.5\n#5 = 200 // max iteration depth\n#6 = 350 // x step size\n#7 = 750 // y step size\n\nBuf_Switch(Buf_Free)\nfor (#12 = #3; #12 > #4; #12 -= #7) { // y0\n for (#11 = #1; #11 < #2; #11 += #6) { // x0\n #22 = 0 // y\n #21 = 0 // x\n #9 = ' ' // char to be displayed\n for (#15 = 0; #15 < #5; #15++) { // iteration\n #31 = (#21/10 * #21) / 1000 // x*x\n #32 = (#22/10 * #22) / 1000 // y*y\n if (#31 + #32 > 40000) {\n #9 = '0' + #15 // print digit 0...9\n if (#15 > 9) { // if iteration count > 9,\n #9 = '@' // print '@'\n }\n break\n }\n #33 = #31 - #32 + #11 // temp = x*x - y*y + x0\n #22 = (#21/10 * #22) / 500 + #12 // y = 2*x*y + y0\n #21 = #33 // x = temp\n }\n Ins_Char(#9)\n }\n Ins_Newline\n}\nBOF\n","language":"Vedit-macro-language"},{"code":"import \"graphics\" for Canvas, Color\nimport \"dome\" for Window\n\nvar MaxIters = 570\nvar Zoom = 150\n\nclass MandelbrotSet {\n construct new(width, height) {\n Window.title = \"Mandelbrot Set\"\n Window.resize(width, height)\n Canvas.resize(width, height)\n _w = width\n _h = height\n }\n\n init() {\n createMandelbrot()\n }\n\n createMandelbrot() {\n for (x in 0..._w) {\n for (y in 0..._h) {\n var zx = 0\n var zy = 0\n var cX = (x - 400) / Zoom\n var cY = (y - 300) / Zoom\n var i = MaxIters\n while (zx * zx + zy * zy < 4 && i > 0) {\n var tmp = zx * zx - zy * zy + cX\n zy = 2 * zx * zy + cY\n zx = tmp\n i = i - 1\n }\n var r = i * 255 / MaxIters\n Canvas.pset(x, y, Color.rgb(r, r, r))\n }\n }\n }\n\n update() {}\n\n draw(alpha) {}\n}\n\nvar Game = MandelbrotSet.new(800, 600)\n","language":"Wren"},{"code":"include c:\\cxpl\\codes; \\intrinsic 'code' declarations\nint X, Y, \\screen coordinates of current point\n Cnt; \\iteration counter\nreal Cx, Cy, \\coordinates scaled to +/-2 range\n Zx, Zy, \\complex accumulator\n Temp; \\temporary scratch\n[SetVid($112); \\set 640x480x24 graphics mode\nfor Y:= 0 to 480-1 do \\for all points on the screen...\n for X:= 0 to 640-1 do\n [Cx:= (float(X)/640.0 - 0.5) * 4.0; \\range: -2.0 to +2.0\n Cy:= (float(Y-240)/240.0) * 1.5; \\range: -1.5 to +1.5\n Cnt:= 0; Zx:= 0.0; Zy:= 0.0; \\initialize\n loop [if Zx*Zx + Zy*Zy > 2.0 then \\Z heads toward infinity\n [Point(X, Y, Cnt<<21+Cnt<<10+Cnt<<3); \\set color of pixel to\n quit; \\ rate it approached infinity\n ]; \\move on to next point\n Temp:= Zx*Zy;\n Zx:= Zx*Zx - Zy*Zy + Cx; \\calculate next iteration of Z\n Zy:= 2.0*Temp + Cy;\n Cnt:= Cnt+1; \\count number of iterations\n if Cnt >= 1000 then quit; \\assume point is in Mandelbrot\n ]; \\ set and leave it colored black\n ];\nX:= ChIn(1); \\wait for keystroke\nSetVid($03); \\restore normal text display\n]\n","language":"XPL0"},{"code":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<xsl:stylesheet version=\"1.0\" xmlns:xsl=\"http://www.w3.org/1999/XSL/Transform\">\n\n<!-- XSLT Mandelbrot - written by Joel Yliluoma 2007, http://iki.fi/bisqwit/ -->\n\n<xsl:output method=\"html\" indent=\"no\"\n doctype-public=\"-//W3C//DTD HTML 4.01//EN\"\n doctype-system=\"http://www.w3.org/TR/REC-html40/strict.dtd\"\n />\n\n<xsl:template match=\"/fractal\">\n <html>\n <head>\n <title>XSLT fractal</title>\n <style type=\"text/css\">\nbody { color:#55F; background:#000 }\npre { font-family:monospace; font-size:7px }\npre span { background:<xsl:value-of select=\"background\" /> }\n </style>\n </head>\n <body>\n <div style=\"position:absolute;top:20px;left:20em\">\n Copyright © 1992,2007 Joel Yliluoma\n (<a href=\"http://iki.fi/bisqwit/\">http://iki.fi/bisqwit/</a>)\n </div>\n <h1 style=\"margin:0px\">XSLT fractal</h1>\n <pre><xsl:call-template name=\"bisqwit-mandelbrot\" /></pre>\n </body>\n </html>\n</xsl:template>\n\n<xsl:template name=\"bisqwit-mandelbrot\"\n ><xsl:call-template name=\"bisqwit-mandelbrot-line\">\n <xsl:with-param name=\"y\" select=\"y/min\"/>\n </xsl:call-template\n></xsl:template>\n\n<xsl:template name=\"bisqwit-mandelbrot-line\"\n ><xsl:param name=\"y\"\n /><xsl:call-template name=\"bisqwit-mandelbrot-column\">\n <xsl:with-param name=\"x\" select=\"x/min\"/>\n <xsl:with-param name=\"y\" select=\"$y\"/>\n </xsl:call-template\n ><xsl:if test=\"$y < y/max\"\n ><br\n /><xsl:call-template name=\"bisqwit-mandelbrot-line\">\n <xsl:with-param name=\"y\" select=\"$y + y/step\"/>\n </xsl:call-template\n ></xsl:if\n></xsl:template>\n\n<xsl:template name=\"bisqwit-mandelbrot-column\"\n ><xsl:param name=\"x\"\n /><xsl:param name=\"y\"\n /><xsl:call-template name=\"bisqwit-mandelbrot-slot\">\n <xsl:with-param name=\"x\" select=\"$x\" />\n <xsl:with-param name=\"y\" select=\"$y\" />\n <xsl:with-param name=\"zr\" select=\"$x\" />\n <xsl:with-param name=\"zi\" select=\"$y\" />\n </xsl:call-template\n ><xsl:if test=\"$x < x/max\"\n ><xsl:call-template name=\"bisqwit-mandelbrot-column\">\n <xsl:with-param name=\"x\" select=\"$x + x/step\"/>\n <xsl:with-param name=\"y\" select=\"$y\" />\n </xsl:call-template\n ></xsl:if\n></xsl:template>\n\n<xsl:template name=\"bisqwit-mandelbrot-slot\"\n><xsl:param name=\"x\"\n /><xsl:param name=\"y\"\n /><xsl:param name=\"zr\"\n /><xsl:param name=\"zi\"\n /><xsl:param name=\"iter\" select=\"0\"\n /><xsl:variable name=\"zrsqr\" select=\"($zr * $zr)\"\n /><xsl:variable name=\"zisqr\" select=\"($zi * $zi)\"\n /><xsl:choose>\n <xsl:when test=\"(4*scale*scale >= $zrsqr + $zisqr) and (maxiter > $iter+1)\"\n ><xsl:call-template name=\"bisqwit-mandelbrot-slot\">\n <xsl:with-param name=\"x\" select=\"$x\" />\n <xsl:with-param name=\"y\" select=\"$y\" />\n <xsl:with-param name=\"zi\" select=\"(2 * $zr * $zi) div scale + $y\" />\n <xsl:with-param name=\"zr\" select=\"($zrsqr - $zisqr) div scale + $x\" />\n <xsl:with-param name=\"iter\" select=\"$iter + 1\" />\n </xsl:call-template\n ></xsl:when>\n <xsl:otherwise\n ><xsl:variable name=\"magnitude\" select=\"magnitude[@value=$iter]\"\n /><span style=\"color:{$magnitude/color}\"\n ><xsl:value-of select=\"$magnitude/symbol\"\n /></span></xsl:otherwise>\n </xsl:choose\n></xsl:template>\n\n</xsl:stylesheet>\n","language":"XSLT"},{"code":"open window 640, 320\nwid = 4\nxcenter = -1: ycenter = 0\nms = 0\nfor xcoord = 0 to 639\n for ycoord = 0 to 160\n ms = 0\n ca =(xcoord-320)/640*wid+xcenter\n cb =(ycoord-160)/640*wid+ycenter\n x = 0: y=0\n\n for t = 1 to 20\n xnew = x*x-y*y+ca\n ynew = 2*x*y+cb\n x=xnew:y=ynew\n magnitudesquared=x*x+y*y\n ms = magnitudesquared\n if (magnitudesquared > 100) break\n //if(magnitudesquared < 100) then : color 0,0,0 : dot xcoord, ycoord : end if\n next t\n ms = ms+1\n if(ms > 250) then\n \t color 32,64,mod(ms,255)\n dot xcoord, ycoord\n dot xcoord, 320- ycoord\n elseif (ms > 150) then\n color mod(ms,255),64,32\n dot xcoord, ycoord\n dot xcoord, 320-ycoord\n else\n color 0,0,0\n dot xcoord, ycoord\n dot xcoord, 320-ycoord\n end if\n next ycoord\nnext xcoord\n","language":"Yabasic"},{"code":";\n; Compute a Mandelbrot set on a simple Z80 computer.\n;\n; Porting this program to another Z80 platform should be easy and straight-\n; forward: The only dependencies on my homebrew machine are the system-calls\n; used to print strings and characters. These calls are performed by loading\n; IX with the number of the system-call and performing an RST 08. To port this\n; program to another operating system just replace these system-calls with\n; the appropriate versions. Only three system-calls are used in the following:\n; _crlf: Prints a CR/LF, _puts: Prints a 0-terminated string (the adress of\n; which is expected in HL), and _putc: Print a single character which is\n; expected in A. RST 0 give control back to the monitor.\n;\n#include \"mondef.asm\"\n\n org ram_start\n\nscale equ 256 ; Do NOT change this - the\n ; arithmetic routines rely on\n ; this scaling factor! :-)\ndivergent equ scale * 4\n\n ld hl, welcome ; Print a welcome message\n ld ix, _puts\n rst 08\n\n; for (y = <initial_value> ; y <= y_end; y += y_step)\n; {\nouter_loop ld hl, (y_end) ; Is y <= y_end?\n ld de, (y)\n and a ; Clear carry\n sbc hl, de ; Perform the comparison\n jp m, mandel_end ; End of outer loop reached\n\n; for (x = x_start; x <= x_end; x += x_step)\n; {\n ld hl, (x_start) ; x = x_start\n ld (x), hl\ninner_loop ld hl, (x_end) ; Is x <= x_end?\n ld de, (x)\n and a\n sbc hl, de\n jp m, inner_loop_end ; End of inner loop reached\n\n; z_0 = z_1 = 0;\n ld hl, 0\n ld (z_0), hl\n ld (z_1), hl\n\n; for (iteration = iteration_max; iteration; iteration--)\n; {\n ld a, (iteration_max)\n ld b, a\niteration_loop push bc ; iteration -> stack\n; z2 = (z_0 * z_0 - z_1 * z_1) / SCALE;\n ld de, (z_1) ; Compute DE HL = z_1 * z_1\n ld bc, de\n call mul_16\n ld (z_0_square_low), hl ; z_0 ** 2 is needed later again\n ld (z_0_square_high), de\n\n ld de, (z_0) ; Compute DE HL = z_0 * z_0\n ld bc, de\n call mul_16\n ld (z_1_square_low), hl ; z_1 ** 2 will be also needed\n ld (z_1_square_high), de\n\n and a ; Compute subtraction\n ld bc, (z_0_square_low)\n sbc hl, bc\n ld (scratch_0), hl ; Save lower 16 bit of result\n ld hl, de\n ld bc, (z_0_square_high)\n sbc hl, bc\n ld bc, (scratch_0) ; HL BC = z_0 ** 2 - z_1 ** 2\n\n ld c, b ; Divide by scale = 256\n ld b, l ; Discard the rest\n push bc ; We need BC later\n\n; z3 = 2 * z0 * z1 / SCALE;\n ld hl, (z_0) ; Compute DE HL = 2 * z_0 * z_1\n add hl, hl\n ld de, hl\n ld bc, (z_1)\n call mul_16\n\n ld b, e ; Divide by scale (= 256)\n ld c, h ; BC contains now z_3\n\n; z1 = z3 + y;\n ld hl, (y)\n add hl, bc\n ld (z_1), hl\n\n; z_0 = z_2 + x;\n pop bc ; Here BC is needed again :-)\n ld hl, (x)\n add hl, bc\n ld (z_0), hl\n\n; if (z0 * z0 / SCALE + z1 * z1 / SCALE > 4 * SCALE)\n ld hl, (z_0_square_low) ; Use the squares computed\n ld de, (z_1_square_low) ; above\n add hl, de\n ld bc, hl ; BC contains lower word of sum\n\n ld hl, (z_0_square_high)\n ld de, (z_1_square_high)\n adc hl, de\n\n ld h, l ; HL now contains (z_0 ** 2 +\n ld l, b ; z_1 ** 2) / scale\n\n ld bc, divergent\n and a\n sbc hl, bc\n\n; break;\n jp c, iteration_dec ; No break\n pop bc ; Get latest iteration counter\n jr iteration_end ; Exit loop\n\n; iteration++;\niteration_dec pop bc ; Get iteration counter\n djnz iteration_loop ; We might fall through!\n; }\niteration_end\n; printf(\"%c\", display[iteration % 7]);\n ld a, b\n and $7 ; lower three bits only (c = 0)\n sbc hl, hl\n ld l, a\n ld de, display ; Get start of character array\n add hl, de ; address and load the\n ld a, (hl) ; character to be printed\n ld ix, _putc ; Print the character\n rst 08\n\n ld de, (x_step) ; x += x_step\n ld hl, (x)\n add hl, de\n ld (x), hl\n\n jp inner_loop\n; }\n; printf(\"\\n\");\ninner_loop_end ld ix, _crlf ; Print a CR/LF pair\n rst 08\n\n ld de, (y_step) ; y += y_step\n ld hl, (y)\n add hl, de\n ld (y), hl ; Store new y-value\n\n jp outer_loop\n; }\n\nmandel_end ld hl, finished ; Print finished-message\n ld ix, _puts\n rst 08\n\n rst 0 ; Return to the monitor\n\nwelcome defb \"Generating a Mandelbrot set\"\n defb cr, lf, eos\nfinished defb \"Computation finished.\", cr, lf, eos\n\niteration_max defb 10 ; How many iterations\nx defw 0 ; x-coordinate\nx_start defw -2 * scale ; Minimum x-coordinate\nx_end defw 5 * scale / 10 ; Maximum x-coordinate\nx_step defw 4 * scale / 100 ; x-coordinate step-width\ny defw -1 * scale ; Minimum y-coordinate\ny_end defw 1 * scale ; Maximum y-coordinate\ny_step defw 1 * scale / 10 ; y-coordinate step-width\nz_0 defw 0\nz_1 defw 0\nscratch_0 defw 0\nz_0_square_high defw 0\nz_0_square_low defw 0\nz_1_square_high defw 0\nz_1_square_low defw 0\ndisplay defb \" .-+*=#@\" ; 8 characters for the display\n\n;\n; Compute DEHL = BC * DE (signed): This routine is not too clever but it\n; works. It is based on a standard 16-by-16 multiplication routine for unsigned\n; integers. At the beginning the sign of the result is determined based on the\n; signs of the operands which are negated if necessary. Then the unsigned\n; multiplication takes place, followed by negating the result if necessary.\n;\nmul_16 xor a ; Clear carry and A (-> +)\n bit 7, b ; Is BC negative?\n jr z, bc_positive ; No\n sub c ; A is still zero, complement\n ld c, a\n ld a, 0\n sbc a, b\n ld b, a\n scf ; Set carry (-> -)\nbc_positive bit 7, D ; Is DE negative?\n jr z, de_positive ; No\n push af ; Remember carry for later!\n xor a\n sub e\n ld e, a\n ld a, 0\n sbc a, d\n ld d, a\n pop af ; Restore carry for complement\n ccf ; Complement Carry (-> +/-?)\nde_positive push af ; Remember state of carry\n and a ; Start multiplication\n sbc hl, hl\n ld a, 16 ; 16 rounds\nmul_16_loop add hl, hl\n rl e\n rl d\n jr nc, mul_16_exit\n add hl, bc\n jr nc, mul_16_exit\n inc de\nmul_16_exit dec a\n jr nz, mul_16_loop\n pop af ; Restore carry from beginning\n ret nc ; No sign inversion necessary\n xor a ; Complement DE HL\n sub l\n ld l, a\n ld a, 0\n sbc a, h\n ld h, a\n ld a, 0\n sbc a, e\n ld e, a\n ld a, 0\n sbc a, d\n ld d, a\n ret\n","language":"Z80-Assembly"},{"code":"fcn mandelbrot{ // lord this is slooooow\n bitmap:=PPM(640,480);\n foreach y,x in ([0..479],[0..639]){\n cx:=(x.toFloat()/640 - 0.5)*4.0; //range: -2.0 to +2.0\n cy:=((y-240).toFloat()/240.0)*1.5; //range: -1.5 to +1.5\n cnt:=0; zx:=0.0; zy:=0.0;\n do(1000){\n \t if(zx*zx + zy*zy > 2.0){\t//z heads toward infinity\n\t //set color of pixel to rate it approaches infinity\n\t bitmap[x,y]=cnt.shiftLeft(21) + cnt.shiftLeft(10) + cnt*8;\n\t break;\n\t }\n\t temp:=zx*zy;\n\t zx=zx*zx - zy*zy + cx;\t\t//calculate next iteration of z\n\t zy=2.0*temp + cy;\n\t cnt+=1;\n }\n }\n bitmap.write(File(\"foo.ppm\",\"wb\"));\n}();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Graphics\\n- Raster graphics operations\\nfrom: http://rosettacode.org/wiki/Mandelbrot_set\\nnote: Fractals\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nGenerate and draw the [[wp:Mandelbrot set|Mandelbrot set]]. \\n\\n\\nNote that there are [http://en.wikibooks.org/wiki/Fractals/Iterations_in_the_complex_plane/Mandelbrot_set many algorithms] to draw Mandelbrot set and there are [http://en.wikibooks.org/wiki/Pictures_of_Julia_and_Mandelbrot_sets many functions] which generate it .\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F mandelbrot(a)\\n R (0.<50).reduce(0i, (z, _) -> z * z + @a)\\n\\nF step(start, step, iterations)\\n R (0 .< iterations).map(i -> @start + (i * @step))\\n\\nV rows = (step(1, -0.05, 41).map(y -> (step(-2.0, 0.0315, 80).map(x -> (I abs(mandelbrot(x + 1i * @y)) < 2 {‘*’} E ‘ ’)))))\\nprint(rows.map(row -> row.join(‘’)).join(\\\"\\\\n\\\"))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"(defun abs-sq (z)\\n (+ (expt (realpart z) 2)\\n (expt (imagpart z) 2)))\\n\\n(defun round-decimal (x places)\\n (/ (floor (* x (expt 10 places)) 1)\\n (expt 10 places)))\\n\\n(defun round-complex (z places)\\n (complex (round-decimal (realpart z) places)\\n (round-decimal (imagpart z) places)))\\n\\n(defun mandel-point-r (z c limit)\\n (declare (xargs :measure (nfix limit)))\\n (cond ((zp limit) 0)\\n ((> (abs-sq z) 4) limit)\\n (t (mandel-point-r (+ (round-complex (* z z) 15) c)\\n c\\n (1- limit)))))\\n\\n(defun mandel-point (z iters)\\n (- 5 (floor (mandel-point-r z z iters) (/ iters 5))))\\n\\n(defun draw-mandel-row (im re cols width iters)\\n (declare (xargs :measure (nfix cols)))\\n (if (zp cols)\\n nil\\n (prog2$ (cw (coerce\\n (list\\n (case (mandel-point (complex re im)\\n iters)\\n (5 #\\\\#)\\n (4 #\\\\*)\\n (3 #\\\\.)\\n (2 #\\\\.)\\n (otherwise #\\\\Space))) 'string))\\n (draw-mandel-row im\\n (+ re (/ (/ width 3)))\\n (1- cols)\\n width iters))))\\n\\n(defun draw-mandel (im rows width height iters)\\n (if (zp rows)\\n nil\\n (progn$ (draw-mandel-row im -2 width width iters)\\n (cw \\\"~%\\\")\\n (draw-mandel (- im (/ (/ height 2)))\\n (1- rows)\\n width\\n height\\n iters))))\\n\\n(defun draw-mandelbrot (width iters)\\n (let ((height (floor (* 1000 width) 3333)))\\n (draw-mandel 1 height width height iters)))\\n\",\n \"language\": \"ACL2\"\n },\n {\n \"code\": \"with Lumen.Binary;\\npackage body Mandelbrot is\\n function Create_Image (Width, Height : Natural) return Lumen.Image.Descriptor is\\n use type Lumen.Binary.Byte;\\n Result : Lumen.Image.Descriptor;\\n X0, Y0 : Float;\\n X, Y, Xtemp : Float;\\n Iteration : Float;\\n Max_Iteration : constant Float := 1000.0;\\n Color : Lumen.Binary.Byte;\\n begin\\n Result.Width := Width;\\n Result.Height := Height;\\n Result.Complete := True;\\n Result.Values := new Lumen.Image.Pixel_Matrix (1 .. Width, 1 .. Height);\\n for Screen_X in 1 .. Width loop\\n for Screen_Y in 1 .. Height loop\\n X0 := -2.5 + (3.5 / Float (Width) * Float (Screen_X));\\n Y0 := -1.0 + (2.0 / Float (Height) * Float (Screen_Y));\\n X := 0.0;\\n Y := 0.0;\\n Iteration := 0.0;\\n while X * X + Y * Y <= 4.0 and then Iteration < Max_Iteration loop\\n Xtemp := X * X - Y * Y + X0;\\n Y := 2.0 * X * Y + Y0;\\n X := Xtemp;\\n Iteration := Iteration + 1.0;\\n end loop;\\n if Iteration = Max_Iteration then\\n Color := 255;\\n else\\n Color := 0;\\n end if;\\n Result.Values (Screen_X, Screen_Y) := (R => Color, G => Color, B => Color, A => 0);\\n end loop;\\n end loop;\\n return Result;\\n end Create_Image;\\n\\nend Mandelbrot;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Lumen.Image;\\n\\npackage Mandelbrot is\\n\\n function Create_Image (Width, Height : Natural) return Lumen.Image.Descriptor;\\n\\nend Mandelbrot;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with System.Address_To_Access_Conversions;\\nwith Lumen.Window;\\nwith Lumen.Image;\\nwith Lumen.Events;\\nwith GL;\\nwith Mandelbrot;\\n\\nprocedure Test_Mandelbrot is\\n\\n Program_End : exception;\\n\\n Win : Lumen.Window.Handle;\\n Image : Lumen.Image.Descriptor;\\n Tx_Name : aliased GL.GLuint;\\n Wide, High : Natural := 400;\\n\\n -- Create a texture and bind a 2D image to it\\n procedure Create_Texture is\\n use GL;\\n\\n package GLB is new System.Address_To_Access_Conversions (GLubyte);\\n\\n IP : GLpointer;\\n begin -- Create_Texture\\n -- Allocate a texture name\\n glGenTextures (1, Tx_Name'Unchecked_Access);\\n\\n -- Bind texture operations to the newly-created texture name\\n glBindTexture (GL_TEXTURE_2D, Tx_Name);\\n\\n -- Select modulate to mix texture with color for shading\\n glTexEnvi (GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_MODULATE);\\n\\n -- Wrap textures at both edges\\n glTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);\\n glTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);\\n\\n -- How the texture behaves when minified and magnified\\n glTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\\n glTexParameteri (GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\\n\\n -- Create a pointer to the image. This sort of horror show is going to\\n -- be disappearing once Lumen includes its own OpenGL bindings.\\n IP := GLB.To_Pointer (Image.Values.all'Address).all'Unchecked_Access;\\n\\n -- Build our texture from the image we loaded earlier\\n glTexImage2D (GL_TEXTURE_2D, 0, GL_RGBA, GLsizei (Image.Width), GLsizei (Image.Height), 0,\\n GL_RGBA, GL_UNSIGNED_BYTE, IP);\\n end Create_Texture;\\n\\n -- Set or reset the window view parameters\\n procedure Set_View (W, H : in Natural) is\\n use GL;\\n begin -- Set_View\\n GL.glEnable (GL.GL_TEXTURE_2D);\\n glClearColor (0.8, 0.8, 0.8, 1.0);\\n\\n glMatrixMode (GL_PROJECTION);\\n glLoadIdentity;\\n glViewport (0, 0, GLsizei (W), GLsizei (H));\\n glOrtho (0.0, GLdouble (W), GLdouble (H), 0.0, -1.0, 1.0);\\n\\n glMatrixMode (GL_MODELVIEW);\\n glLoadIdentity;\\n end Set_View;\\n\\n -- Draw our scene\\n procedure Draw is\\n use GL;\\n begin -- Draw\\n -- clear the screen\\n glClear (GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT);\\n GL.glBindTexture (GL.GL_TEXTURE_2D, Tx_Name);\\n\\n -- fill with a single textured quad\\n glBegin (GL_QUADS);\\n begin\\n glTexCoord2f (1.0, 0.0);\\n glVertex2i (GLint (Wide), 0);\\n\\n glTexCoord2f (0.0, 0.0);\\n glVertex2i (0, 0);\\n\\n glTexCoord2f (0.0, 1.0);\\n glVertex2i (0, GLint (High));\\n\\n glTexCoord2f (1.0, 1.0);\\n glVertex2i (GLint (Wide), GLint (High));\\n end;\\n glEnd;\\n\\n -- flush rendering pipeline\\n glFlush;\\n\\n -- Now show it\\n Lumen.Window.Swap (Win);\\n end Draw;\\n\\n -- Simple event handler routine for keypresses and close-window events\\n procedure Quit_Handler (Event : in Lumen.Events.Event_Data) is\\n begin -- Quit_Handler\\n raise Program_End;\\n end Quit_Handler;\\n\\n -- Simple event handler routine for Exposed events\\n procedure Expose_Handler (Event : in Lumen.Events.Event_Data) is\\n pragma Unreferenced (Event);\\n begin -- Expose_Handler\\n Draw;\\n end Expose_Handler;\\n\\n -- Simple event handler routine for Resized events\\n procedure Resize_Handler (Event : in Lumen.Events.Event_Data) is\\n begin -- Resize_Handler\\n Wide := Event.Resize_Data.Width;\\n High := Event.Resize_Data.Height;\\n Set_View (Wide, High);\\n-- Image := Mandelbrot.Create_Image (Width => Wide, Height => High);\\n-- Create_Texture;\\n Draw;\\n end Resize_Handler;\\n\\nbegin\\n -- Create Lumen window, accepting most defaults; turn double buffering off\\n -- for simplicity\\n Lumen.Window.Create (Win => Win,\\n Name => \\\"Mandelbrot fractal\\\",\\n Width => Wide,\\n Height => High,\\n Events => (Lumen.Window.Want_Exposure => True,\\n Lumen.Window.Want_Key_Press => True,\\n others => False));\\n\\n -- Set up the viewport and scene parameters\\n Set_View (Wide, High);\\n\\n -- Now create the texture and set up to use it\\n Image := Mandelbrot.Create_Image (Width => Wide, Height => High);\\n Create_Texture;\\n\\n -- Enter the event loop\\n declare\\n use Lumen.Events;\\n begin\\n Select_Events (Win => Win,\\n Calls => (Key_Press => Quit_Handler'Unrestricted_Access,\\n Exposed => Expose_Handler'Unrestricted_Access,\\n Resized => Resize_Handler'Unrestricted_Access,\\n Close_Window => Quit_Handler'Unrestricted_Access,\\n others => No_Callback));\\n end;\\nexception\\n when Program_End =>\\n null;\\nend Test_Mandelbrot;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"INT pix = 300, max iter = 256, REAL zoom = 0.33 / pix;\\n[-pix : pix, -pix : pix] INT plane;\\nCOMPL ctr = 0.05 I 0.75 # center of set #;\\n\\n# Compute the length of an orbit. #\\nPROC iterate = (COMPL z0) INT:\\n BEGIN COMPL z := 0, INT iter := 1;\\n WHILE (iter +:= 1) < max iter # not converged # AND ABS z < 2 # not diverged #\\n DO z := z * z + z0\\n OD;\\n iter\\n END;\\n\\n# Compute set and find maximum orbit length. #\\nINT max col := 0;\\nFOR x FROM -pix TO pix\\nDO FOR y FROM -pix TO pix\\n DO COMPL z0 = ctr + (x * zoom) I (y * zoom);\\n IF (plane [x, y] := iterate (z0)) < max iter\\n THEN (plane [x, y] > max col | max col := plane [x, y])\\n FI\\n OD\\nOD;\\n\\n# Make a plot. #\\nFILE plot;\\nINT num pix = 2 * pix + 1;\\nmake device (plot, \\\"gif\\\", whole (num pix, 0) + \\\"x\\\" + whole (num pix, 0));\\nopen (plot, \\\"mandelbrot.gif\\\", stand draw channel);\\nFOR x FROM -pix TO pix\\nDO FOR y FROM -pix TO pix\\n DO INT col = (plane [x, y] > max col | max col | plane [x, y]);\\n REAL c = sqrt (1- col / max col); # sqrt to enhance contrast #\\n draw colour (plot, c, c, c);\\n draw point (plot, (x + pix) / (num pix - 1), (y + pix) / (num pix - 1))\\n OD\\nOD;\\nclose (plot)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin\\n % -- This is an integer ascii Mandelbrot generator, translated from the %\\n % -- Compiler/AST Interpreter Task's ASCII Mandelbrot Set example program %\\n integer leftEdge, rightEdge, topEdge, bottomEdge, xStep, yStep, maxIter;\\n leftEdge := -420;\\n rightEdge := 300;\\n topEdge := 300;\\n bottomEdge := -300;\\n xStep := 7;\\n yStep := 15;\\n\\n maxIter := 200;\\n\\n for y0 := topEdge step - yStep until bottomEdge do begin\\n for x0 := leftEdge step xStep until rightEdge do begin\\n integer x, y, i;\\n string(1) theChar;\\n y := 0;\\n x := 0;\\n theChar := \\\" \\\";\\n i := 0;\\n while i < maxIter do begin\\n integer x_x, y_y;\\n x_x := (x * x) div 200;\\n y_y := (y * y) div 200;\\n if x_x + y_y > 800 then begin\\n theChar := code( decode( \\\"0\\\" ) + i );\\n if i > 9 then theChar := \\\"@\\\";\\n i := maxIter\\n end;\\n y := x * y div 100 + y0;\\n x := x_x - y_y + x0;\\n i := i + 1\\n end while_i_lt_maxIter ;\\n writeon( theChar );\\n end for_x0 ;\\n write();\\n end for_y0\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"#!/usr/bin/hopper\\n#include <jambo.h>\\n\\nMain\\n\\nInitialize '300, ancho, alto'\\n\\nSet '-2,0.47,-1.12,1.12' Init 'min real, max real, min complex, max complex'\\n\\nInit zero 'submaxRminR, submaxCminC'\\n\\nLet ( submaxRminR := 'max real' Minus 'min real')\\nLet ( submaxCminC := 'maxcomplex' Minus 'mincomplex' )\\n\\nInit zero 'a2,b2,a,b,ta'\\n\\nLoop for (i=1, Less equal(i, ancho),++i)\\n\\n Let ( ta := Add(min real, Div ( Mul( submaxRminR, Minus one(i)), Minus one(ancho) )) )\\n\\n Loop for (j=1, Less equal (j, alto),++j)\\n\\n Let ( b := Add( min complex, Div ( Mul (submaxCminC, Minus one(j)), Minus one(alto))) )\\n\\n a=ta, a2=a, b2=b\\n\\n k=1000, color=256\\n Loop if (Sqradd (a,b) Is less than (4), And (k) )\\n Add(Sqrdiff(a,b), a2),\\n Add(b2, Mul(2, Mul(a, b)))\\n\\n Move to (b), Move to (a)\\n\\n --color\\n --k\\n Back\\n Color back (color), Print(\\\"O\\\")\\n Back\\n Prnl\\nBack\\nPause\\n\\nEnd\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"SCREEN 1,320,200,5,1\\nWINDOW 2,\\\"Mandelbrot\\\",,0,1\\n\\nmaxIteration = 100\\nxmin = -2\\nxmax = 1\\nymin = -1.5\\nymax = 1.5\\nxs = 300\\nys = 180\\nst = .01 ' use e.g. st = .05 for a coarser but faster picture\\n ' and perhaps also lower maxIteration = 10 or so\\nxp = xs / (xmax - xmin) * st\\nyp = ys / (ymax - ymin) * st\\n\\nFOR x0 = xmin TO xmax STEP st\\n FOR y0 = ymin TO ymax STEP st\\n x = 0\\n y = 0\\n iteration = 0\\n\\n WHILE (x * x + y * y <= (2 * 2) AND iteration < maxIteration)\\n xtemp = x * x - y * y + x0\\n y = 2 * x * y + y0\\n\\n x = xtemp\\n\\n iteration = iteration + 1\\n WEND\\n\\n IF iteration <> maxIteration THEN\\n c = iteration\\n ELSE\\n c = 0\\n END IF\\n COLOR c MOD 32\\n AREA ((x0 - xmin) * xp / st, (y0 - ymin) * yp / st)\\n AREA STEP (xp, 0)\\n AREA STEP (0, yp)\\n AREA STEP (-xp, 0)\\n AREA STEP (0, -yp)\\n AREAFILL\\n NEXT\\nNEXT\\n\\n' endless loop, use Run -> Stop from the menu to stop program\\nWHILE (1)\\nWEND\\n\",\n \"language\": \"AmigaBASIC\"\n },\n {\n \"code\": \"10 HGR2\\n20 XC = -0.5 : REM CENTER COORD X\\n30 YC = 0 : REM \\\" \\\" Y\\n40 S = 2 : REM SCALE\\n45 IT = 20 : REM ITERATIONS\\n50 XR = S * (280 / 192): REM TOTAL RANGE OF X\\n60 YR = S : REM \\\" \\\" \\\" Y\\n70 X0 = XC - (XR/2) : REM MIN VALUE OF X\\n80 X1 = XC + (XR/2) : REM MAX \\\" \\\" X\\n90 Y0 = YC - (YR/2) : REM MIN \\\" \\\" Y\\n100 Y1 = YC + (YR/2) : REM MAX \\\" \\\" Y\\n110 XM = XR / 279 : REM SCALING FACTOR FOR X\\n120 YM = YR / 191 : REM \\\" \\\" \\\" Y\\n130 FOR YI = 0 TO 3 : REM INTERLEAVE\\n140 FOR YS = 0+YI TO 188+YI STEP 4 : REM Y SCREEN COORDINATE\\n145 HCOLOR=3 : HPLOT 0,YS TO 279,YS\\n150 FOR XS = 0 TO 278 STEP 2 : REM X SCREEN COORDINATE\\n170 X = XS * XM + X0 : REM TRANSL SCREEN TO TRUE X\\n180 Y = YS * YM + Y0 : REM TRANSL SCREEN TO TRUE Y\\n190 ZX = 0\\n200 ZY = 0\\n210 XX = 0\\n220 YY = 0\\n230 FOR I = 0 TO IT\\n240 ZY = 2 * ZX * ZY + Y\\n250 ZX = XX - YY + X\\n260 XX = ZX * ZX\\n270 YY = ZY * ZY\\n280 C = IT-I\\n290 IF XX+YY >= 4 GOTO 301\\n300 NEXT I\\n301 IF C >= 8 THEN C = C - 8 : GOTO 301\\n310 HCOLOR = C : HPLOT XS, YS TO XS+1, YS\\n320 NEXT XS\\n330 NEXT YS\\n340 NEXT YI\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"150 FOR XS = 0 TO 279\\n301 C = (C - INT(C/2)*2)*3\\n310 HCOLOR = C: HPLOT XS, YS\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"inMandelbrot?: function [c][\\n z: to :complex [0 0]\\n do.times: 50 [\\n z: c + z*z\\n if 4 < abs z -> return false\\n ]\\n return true\\n]\\n\\nmandelbrot: function [settings][\\n y: 0\\n while [y < settings\\\\height][\\n Y: settings\\\\yStart + y * settings\\\\yStep\\n x: 0\\n while [x < settings\\\\width][\\n X: settings\\\\xStart + x * settings\\\\xStep\\n if? inMandelbrot? to :complex @[X Y] -> prints \\\"*\\\"\\n else -> prints \\\" \\\"\\n x: x + 1\\n ]\\n print \\\"\\\"\\n y: y + 1\\n ]\\n]\\n\\nmandelbrot #[ yStart: 1.0 yStep: neg 0.05\\n xStart: neg 2.0 xStep: 0.0315\\n height: 40 width: 80 ]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"(* The algorithm is borrowed from Wikipedia. The graphics is a\\n modification of the display made by the JavaScript entry. Output\\n from the program is a Portable Pixmap file. *)\\n\\n#include \\\"share/atspre_staload.hats\\\"\\nstaload \\\"libats/libc/SATS/math.sats\\\"\\nstaload _ = \\\"libats/libc/DATS/math.dats\\\"\\n\\nfn\\nmandel_iter {max_iter : nat}\\n (cx : double,\\n cy : double,\\n max_iter : int max_iter)\\n :<> intBtwe (0, max_iter) =\\n let\\n fun\\n loop {iter : nat | iter <= max_iter}\\n .<max_iter - iter>.\\n (x : double,\\n y : double,\\n iter : int iter) :<> intBtwe (0, max_iter) =\\n if iter = max_iter then\\n iter\\n else if 2.0 * 2.0 < (x * x) + (y * y) then\\n iter\\n else\\n let\\n val x = (x * x) - (y * y) + cx\\n and y = (2.0 * x * y) + cy\\n in\\n loop (x, y, succ iter)\\n end\\n in\\n loop (0.0, 0.0, 0)\\n end\\n\\nfn (* Write a Portable Pixmap of the Mandelbrot set. *)\\nwrite_mandelbrot_ppm (outf : FILEref,\\n width : intGte 0,\\n height : intGte 0,\\n xmin : double,\\n xmax : double,\\n ymin : double,\\n ymax : double,\\n max_iter : intGte 0) : void =\\n let\\n prval [width : int] EQINT () = eqint_make_gint width\\n prval [height : int] EQINT () = eqint_make_gint height\\n\\n macdef output (r, g, b) =\\n let\\n val r = min ($UNSAFE.cast{int} ,(r), 255)\\n and g = min ($UNSAFE.cast{int} ,(g), 255)\\n and b = min ($UNSAFE.cast{int} ,(b), 255)\\n in\\n fprint_val<uchar> (outf, $UNSAFE.cast r);\\n fprint_val<uchar> (outf, $UNSAFE.cast g);\\n fprint_val<uchar> (outf, $UNSAFE.cast b);\\n end\\n\\n val xscale = (xmax - xmin) / g0i2f width\\n and yscale = (ymax - ymin) / g0i2f height\\n\\n fun\\n loop_y {iy : nat | iy <= height}\\n .<height - iy>.\\n (iy : int iy) : void =\\n if iy <> height then\\n let\\n fun\\n loop_x {ix : nat | ix <= width}\\n .<width - ix>.\\n (ix : int ix) : void =\\n if ix <> width then\\n let\\n (* We want to go from top to bottom, left to right. *)\\n val x = xmin + (xscale * g0i2f ix)\\n and y = ymin + (yscale * g0i2f (height - iy))\\n val i = mandel_iter (x, y, max_iter)\\n\\n (* We can PROVE that \\\"i\\\" is no greater than\\n \\\"max_iter\\\". *)\\n prval [i : int] EQINT () = eqint_make_gint i\\n prval [max_iter : int] EQINT () = eqint_make_gint max_iter\\n prval () = prop_verify {i <= max_iter} ()\\n\\n val c = (4.0 * log (g0i2f i)) / log (g0i2f max_iter)\\n in\\n if i = max_iter then\\n output (0, 0, 0)\\n else if c < 1.0 then\\n output (0, 0, 255.0 * (c - 1.0))\\n else if c < 2.0 then\\n output (0, 255.0 * (c - 1.0), 255)\\n else\\n output (255.0 * (c - 2.0), 255, 255);\\n loop_x (succ ix)\\n end\\n in\\n loop_x 0;\\n loop_y (succ iy)\\n end\\n in\\n fprintln! (outf, \\\"P6\\\");\\n fprintln! (outf, width, \\\" \\\", height);\\n fprintln! (outf, 255);\\n loop_y 0\\n end\\n\\nimplement\\nmain0 () =\\n let\\n val outf = stdout_ref\\n val width = 1024\\n val height = 1024\\n val xmin = ~2.25\\n val xmax = 0.75\\n val ymin = ~1.5\\n val ymax = 1.5\\n val max_iter = 1000\\n in\\n write_mandelbrot_ppm (outf, width, height, xmin, xmax,\\n ymin, ymax, max_iter)\\n end\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \"(*-*- ATS -*-*)\\n\\n(* This program requires ats2-xprelude:\\n https://sourceforge.net/p/chemoelectric/ats2-xprelude\\n\\n Also required is the SDL2 library for C. Not everything in the SDL\\n interface below is used. The interface is meant to be relatively\\n safe. For instance, you cannot create a window or renderer without\\n later destroying it, and you cannot use one at all that was not\\n properly created. Also you cannot accidentally use an\\n SDL_WindowEvent as an SDL_TextInputEvent, etc.\\n\\n The program uses 32+32-bit fixed point to calculate escape times.\\n One does not need so many bits left of the decimal point, but this\\n is the fixed point format available from ats2-xprelude.\\n\\n There are some \\\"FIXME\\\" notes below that refer to a few of the ways\\n the program could be improved. This is a demo version of something\\n I am likely to expand into a better program.\\n\\n Compile the program with (for example)\\n \\\"myatscc mandelbrot_task_interactive.dats\\\"\\n\\n##myatsccdef=\\\\\\npatscc -std=gnu2x -O3 \\\\\\n -DATS_MEMALLOC_GCBDW \\\\\\n `pkg-config --define-variable=PATSHOME=\\\"${PATSHOME}\\\" \\\\\\n --cflags sdl2 ats2-xprelude bdw-gc` \\\\\\n `pkg-config --define-variable=PATSHOME=\\\"${PATSHOME}\\\" \\\\\\n --variable=PATSCCFLAGS ats2-xprelude` \\\\\\n -o $fname($1) $1 \\\\\\n `pkg-config --define-variable=PATSHOME=\\\"${PATSHOME}\\\" \\\\\\n --libs sdl2 ats2-xprelude bdw-gc`\\n\\n*)\\n\\n(* How to use the program:\\n\\n Left click : re-center the image\\n Double left-click : zoom in\\n Double right-click : zoom out\\n p or P : save an image as a Portable Arbitrary Map\\n q or Q : quit the program\\n\\n The window is resizable.\\n Closing the window quits the program, just as the Q key does. *)\\n\\n(*------------------------------------------------------------------*)\\n\\n#include \\\"share/atspre_staload.hats\\\"\\nstaload UN = \\\"prelude/SATS/unsafe.sats\\\"\\n\\n#include \\\"xprelude/HATS/xprelude.hats\\\"\\n\\n(* To use 32+32-bit fixed point: *)\\nstaload \\\"xprelude/SATS/fixed32p32.sats\\\"\\nstaload _ = \\\"xprelude/DATS/fixed32p32.dats\\\"\\nstadef realknd = fix32p32knd\\ntypedef real = fixed32p32\\n(* Actually, one could use different kinds of real number for\\n different algorithms: fixed point, floating point,\\n multiple-precision rational, interval arithmetic, ... even\\n continued fractions. *)\\n\\n(*------------------------------------------------------------------*)\\n\\n(* This is a weak choice of ATS_EXTERN_PREFIX, but will spare us from\\n having to do a lot of writing. *)\\n#define ATS_EXTERN_PREFIX \\\"\\\"\\n\\nextern fn atexit : (() -> void) -> int = \\\"mac#%\\\"\\n\\n%{^\\n\\n#define SDL_MAIN_HANDLED 1\\n#include <SDL.h>\\n\\nATSinline() atstype_bool\\nSDL_bool2ATS (SDL_bool b)\\n{\\n return (b == SDL_FALSE) ? atsbool_false : atsbool_true;\\n}\\n\\n%}\\n\\ntypedef SDL_bool = $extype\\\"SDL_bool\\\"\\nextern fn SDL_bool2ATS (b : SDL_bool) :<> bool = \\\"mac#%\\\"\\n\\n(* - - - - - - - - - - - - - - - - - - - - - - *)\\n(* Housekeeping. *)\\n\\nextern fn SDL_SetMainReady () : void = \\\"mac#%\\\"\\nextern fn SDL_Init (flags : uint32) : void = \\\"mac#%\\\"\\nextern fn SDL_Quit () : void = \\\"mac#%\\\"\\n\\n(* - - - - - - - - - - - - - - - - - - - - - - *)\\n(* Timers. *)\\n\\nextern fn SDL_Delay (ms : uint32) : void = \\\"mac#%\\\"\\n\\n(* - - - - - - - - - - - - - - - - - - - - - - *)\\n(* Video handling. *)\\n\\n(* Screensavers are disabled by default, except in very early versions\\n of SDL2. *)\\nextern fn SDL_DisableScreenSaver () : void = \\\"mac#%\\\"\\nextern fn SDL_EnableScreenSaver () : void = \\\"mac#%\\\"\\nextern fn SDL_IsScreenSaverEnabled () : SDL_bool = \\\"mac#%\\\"\\n\\nabsvtype SDL_Window_ptr (p : addr) = ptr p\\nvtypedef SDL_Window_ptr0 = [p : addr] SDL_Window_ptr p\\nvtypedef SDL_Window_ptr1 = [p : agz] SDL_Window_ptr p\\n\\nabsvtype SDL_Renderer_ptr (p : addr) = ptr p\\nvtypedef SDL_Renderer_ptr0 = [p : addr] SDL_Renderer_ptr p\\nvtypedef SDL_Renderer_ptr1 = [p : agz] SDL_Renderer_ptr p\\n\\nextern castfn SDL_Window_ptr2ptr :\\n {p : addr} (!SDL_Window_ptr p) -<> ptr p\\nextern castfn SDL_Renderer_ptr2ptr :\\n {p : addr} (!SDL_Renderer_ptr p) -<> ptr p\\n\\nmacdef SDL_INIT_EVENTS = $extval (uint32, \\\"SDL_INIT_EVENTS\\\")\\nmacdef SDL_INIT_TIMER = $extval (uint32, \\\"SDL_INIT_TIMER\\\")\\nmacdef SDL_INIT_VIDEO = $extval (uint32, \\\"SDL_INIT_VIDEO\\\")\\n\\nmacdef SDL_WINDOWPOS_CENTERED = $extval (int, \\\"SDL_WINDOWPOS_CENTERED\\\")\\nmacdef SDL_WINDOWPOS_UNDEFINED = $extval (int, \\\"SDL_WINDOWPOS_UNDEFINED\\\")\\n\\nmacdef SDL_WINDOW_OPENGL = $extval (uint32, \\\"SDL_WINDOW_OPENGL\\\")\\nmacdef SDL_WINDOW_RESIZABLE = $extval (uint32, \\\"SDL_WINDOW_RESIZABLE\\\")\\n\\nextern fn\\nSDL_CreateWindow (title : string,\\n x : int, y : int,\\n w : int, h : int,\\n flags : uint32) : SDL_Window_ptr0 = \\\"mac#%\\\"\\n\\nextern fn\\nSDL_DestroyWindow : SDL_Window_ptr1 -> void = \\\"mac#%\\\"\\nfn {}\\nSDL_DestroyWindow_null\\n (window : SDL_Window_ptr null) : void =\\n $UN.castvwtp0{void} window\\n\\nextern fn\\nSDL_CreateRenderer (window : !SDL_Window_ptr1,\\n index : int,\\n flags : uint32) : SDL_Renderer_ptr0 = \\\"mac#%\\\"\\n\\nextern fn\\nSDL_DestroyRenderer : SDL_Renderer_ptr1 -> void = \\\"mac#%\\\"\\nfn {}\\nSDL_DestroyRenderer_null\\n (renderer : SDL_Renderer_ptr null) : void =\\n $UN.castvwtp0{void} renderer\\n\\nextern fn\\nSDL_GetRendererOutputSize (renderer : !SDL_Renderer_ptr1,\\n w : &int? >> int,\\n h : &int? >> int) : int = \\\"mac#%\\\"\\n\\nextern fn\\nSDL_SetRenderDrawColor (renderer : !SDL_Renderer_ptr1,\\n r : uint8,\\n g : uint8,\\n b : uint8,\\n a : uint8) : int = \\\"mac#%\\\"\\n\\nextern fn\\nSDL_RenderClear (renderer : !SDL_Renderer_ptr1) : int = \\\"mac#%\\\"\\n\\nextern fn\\nSDL_RenderDrawPoint (renderer : !SDL_Renderer_ptr1,\\n x : int,\\n y : int) : int = \\\"mac#%\\\"\\nextern fn\\nSDL_RenderPresent (renderer : !SDL_Renderer_ptr1) : void = \\\"mac#%\\\"\\n\\n(* - - - - - - - - - - - - - - - - - - - - - - *)\\n(* Event handling. *)\\n\\ntypedef SDL_Event (t : int) =\\n $extype_struct\\\"SDL_Event\\\" of\\n {\\n type = uint32 t,\\n timestamp = uint32\\n }\\ntypedef SDL_Event = [t : int] SDL_Event t\\n\\nextern fn\\nSDL_PollEvent (event : &SDL_Event? >> SDL_Event)\\n : intBtwe (0, 1) = \\\"mac#%\\\"\\n\\nextern fn\\nSDL_GetMouseState (x : &int? >> int,\\n y : &int? >> int) : uint32 = \\\"mac#%\\\"\\n\\nmacdef SDL_BUTTON_LMASK = $extval (uint32, \\\"SDL_BUTTON_LMASK\\\")\\nmacdef SDL_BUTTON_MMASK = $extval (uint32, \\\"SDL_BUTTON_MMASK\\\")\\nmacdef SDL_BUTTON_RMASK = $extval (uint32, \\\"SDL_BUTTON_RMASK\\\")\\nmacdef SDL_BUTTON_X1MASK = $extval (uint32, \\\"SDL_BUTTON_X1MASK\\\")\\nmacdef SDL_BUTTON_X2MASK = $extval (uint32, \\\"SDL_BUTTON_X2MASK\\\")\\n\\n(* - - - - - - - - - - - - - *)\\n\\nstacst SDL_QUIT : int\\nmacdef SDL_QUIT = $extval (uint32 SDL_QUIT, \\\"SDL_QUIT\\\")\\n\\ntypedef SDL_QuitEvent =\\n $extype_struct\\\"SDL_QuitEvent\\\" of\\n {\\n type = uint32 SDL_QUIT,\\n timestamp = uint32\\n }\\n\\nextern praxi\\nSDL_Event2QuitEvent_v :\\n {p : addr}\\n SDL_Event SDL_QUIT @ p -<prf>\\n @(SDL_QuitEvent @ p,\\n SDL_QuitEvent @ p -<lin,prf> SDL_Event SDL_QUIT @ p)\\n\\n(* - - - - - - - - - - - - - *)\\n\\nstacst SDL_WINDOWEVENT : int\\nmacdef SDL_WINDOWEVENT = $extval (uint32 SDL_WINDOWEVENT, \\\"SDL_WINDOWEVENT\\\")\\n\\ntypedef SDL_WindowEvent =\\n $extype_struct\\\"SDL_WindowEvent\\\" of\\n {\\n type = uint32 SDL_WINDOWEVENT,\\n timestamp = uint32,\\n windowID = uint32,\\n event = uint8,\\n padding1 = uint8,\\n padding2 = uint8,\\n padding3 = uint8,\\n data1 = int32,\\n data2 = int32\\n }\\n\\nextern praxi\\nSDL_Event2WindowEvent_v :\\n {p : addr}\\n SDL_Event SDL_WINDOWEVENT @ p -<prf>\\n @(SDL_WindowEvent @ p,\\n SDL_WindowEvent @ p -<lin,prf> SDL_Event SDL_WINDOWEVENT @ p)\\n\\nmacdef SDL_WINDOWEVENT_NONE = $extval (uint8, \\\"SDL_WINDOWEVENT_NONE\\\")\\nmacdef SDL_WINDOWEVENT_SHOWN = $extval (uint8, \\\"SDL_WINDOWEVENT_SHOWN\\\")\\nmacdef SDL_WINDOWEVENT_HIDDEN = $extval (uint8, \\\"SDL_WINDOWEVENT_HIDDEN\\\")\\nmacdef SDL_WINDOWEVENT_EXPOSED = $extval (uint8, \\\"SDL_WINDOWEVENT_EXPOSED\\\")\\nmacdef SDL_WINDOWEVENT_MOVED = $extval (uint8, \\\"SDL_WINDOWEVENT_MOVED\\\")\\nmacdef SDL_WINDOWEVENT_RESIZED = $extval (uint8, \\\"SDL_WINDOWEVENT_RESIZED\\\")\\nmacdef SDL_WINDOWEVENT_SIZE_CHANGED = $extval (uint8, \\\"SDL_WINDOWEVENT_SIZE_CHANGED\\\")\\nmacdef SDL_WINDOWEVENT_MINIMIZED = $extval (uint8, \\\"SDL_WINDOWEVENT_MINIMIZED\\\")\\nmacdef SDL_WINDOWEVENT_MAXIMIZED = $extval (uint8, \\\"SDL_WINDOWEVENT_MAXIMIZED\\\")\\nmacdef SDL_WINDOWEVENT_RESTORED = $extval (uint8, \\\"SDL_WINDOWEVENT_RESTORED\\\")\\nmacdef SDL_WINDOWEVENT_ENTER = $extval (uint8, \\\"SDL_WINDOWEVENT_ENTER\\\")\\nmacdef SDL_WINDOWEVENT_LEAVE = $extval (uint8, \\\"SDL_WINDOWEVENT_LEAVE\\\")\\nmacdef SDL_WINDOWEVENT_FOCUS_GAINED = $extval (uint8, \\\"SDL_WINDOWEVENT_FOCUS_GAINED\\\")\\nmacdef SDL_WINDOWEVENT_FOCUS_LOST = $extval (uint8, \\\"SDL_WINDOWEVENT_FOCUS_LOST\\\")\\nmacdef SDL_WINDOWEVENT_CLOSE = $extval (uint8, \\\"SDL_WINDOWEVENT_CLOSE\\\")\\nmacdef SDL_WINDOWEVENT_TAKE_FOCUS = $extval (uint8, \\\"SDL_WINDOWEVENT_TAKE_FOCUS\\\")\\nmacdef SDL_WINDOWEVENT_HIT_TEST = $extval (uint8, \\\"SDL_WINDOWEVENT_HIT_TEST\\\")\\nmacdef SDL_WINDOWEVENT_ICCPROF_CHANGED = $extval (uint8, \\\"SDL_WINDOWEVENT_ICCPROF_CHANGED\\\")\\nmacdef SDL_WINDOWEVENT_DISPLAY_CHANGED = $extval (uint8, \\\"SDL_WINDOWEVENT_DISPLAY_CHANGED\\\")\\n\\n(* - - - - - - - - - - - - - *)\\n\\nstacst SDL_MOUSEMOTION : int\\nmacdef SDL_MOUSEMOTION = $extval (uint32 SDL_MOUSEMOTION, \\\"SDL_MOUSEMOTION\\\")\\n\\ntypedef SDL_MouseMotionEvent =\\n $extype_struct\\\"SDL_MouseMotionEvent\\\" of\\n {\\n type = uint32 SDL_MOUSEMOTION,\\n timestamp = uint32,\\n windowID = uint32,\\n which = uint32,\\n state = uint32,\\n x = int32,\\n y = int32,\\n xrel = int32,\\n yrel = int32\\n }\\n\\nextern praxi\\nSDL_Event2MouseMotionEvent_v :\\n {p : addr}\\n SDL_Event SDL_MOUSEMOTION @ p -<prf>\\n @(SDL_MouseMotionEvent @ p,\\n SDL_MouseMotionEvent @ p -<lin,prf> SDL_Event SDL_MOUSEMOTION @ p)\\n\\n(* - - - - - - - - - - - - - *)\\n\\nstacst SDL_MOUSEBUTTONDOWN : int\\nmacdef SDL_MOUSEBUTTONDOWN = $extval (uint32 SDL_MOUSEBUTTONDOWN, \\\"SDL_MOUSEBUTTONDOWN\\\")\\n\\nstacst SDL_MOUSEBUTTONUP : int\\nmacdef SDL_MOUSEBUTTONUP = $extval (uint32 SDL_MOUSEBUTTONUP, \\\"SDL_MOUSEBUTTONUP\\\")\\n\\ntypedef SDL_MouseButtonEvent (t : int) =\\n [t == SDL_MOUSEBUTTONDOWN || t == SDL_MOUSEBUTTONUP]\\n $extype_struct\\\"SDL_MouseButtonEvent\\\" of\\n {\\n type = uint32 t,\\n timestamp = uint32,\\n windowID = uint32,\\n which = uint32,\\n button = uint8,\\n state = uint8,\\n clicks = uint8,\\n padding1 = uint8,\\n x = int32,\\n y = int32\\n }\\ntypedef SDL_MouseButtonEvent = [t : int] SDL_MouseButtonEvent t\\n\\nextern praxi\\nSDL_Event2MouseButtonEvent_v :\\n {p : addr}\\n {t : int | t == SDL_MOUSEBUTTONDOWN || t == SDL_MOUSEBUTTONUP}\\n SDL_Event t @ p -<prf>\\n @(SDL_MouseButtonEvent t @ p,\\n SDL_MouseButtonEvent t @ p -<lin,prf> SDL_Event t @ p)\\n\\nmacdef SDL_BUTTON_LEFT = $extval (uint8, \\\"SDL_BUTTON_LEFT\\\")\\nmacdef SDL_BUTTON_MIDDLE = $extval (uint8, \\\"SDL_BUTTON_MIDDLE\\\")\\nmacdef SDL_BUTTON_RIGHT = $extval (uint8, \\\"SDL_BUTTON_RIGHT\\\")\\nmacdef SDL_BUTTON_X1 = $extval (uint8, \\\"SDL_BUTTON_X1\\\")\\nmacdef SDL_BUTTON_X2 = $extval (uint8, \\\"SDL_BUTTON_X2\\\")\\n\\nmacdef SDL_PRESSED = $extval (uint8, \\\"SDL_PRESSED\\\")\\nmacdef SDL_RELEASED = $extval (uint8, \\\"SDL_RELEASED\\\")\\n\\n(* - - - - - - - - - - - - - *)\\n\\nstacst SDL_TEXTINPUT : int\\nmacdef SDL_TEXTINPUT = $extval (uint32 SDL_TEXTINPUT, \\\"SDL_TEXTINPUT\\\")\\n\\n#define SDL_TEXTINPUTEVENT_TEXT_SIZE 32\\n\\ntypedef SDL_TextInputEvent =\\n $extype_struct\\\"SDL_TextInputEvent\\\" of\\n {\\n type = uint32 SDL_TEXTINPUT,\\n timestamp = uint32,\\n windowID = uint32,\\n text = @[char][SDL_TEXTINPUTEVENT_TEXT_SIZE]\\n }\\n\\nextern praxi\\nSDL_Event2TextInputEvent_v :\\n {p : addr}\\n SDL_Event SDL_TEXTINPUT @ p -<prf>\\n @(SDL_TextInputEvent @ p,\\n SDL_TextInputEvent @ p -<lin,prf> SDL_Event SDL_TEXTINPUT @ p)\\n\\n(*------------------------------------------------------------------*)\\n\\nexception bailout of string\\n\\ntypedef rgba = @(uint8, uint8, uint8, uint8)\\n\\nval empty_scene_color =\\n @(g0i2u 200, g0i2u 200, g0i2u 200, g0i2u 255) : rgba\\n\\ntypedef rgba_array (w : int, h : int) =\\n matrixref (rgba, w, h)\\n\\ntypedef scene_computer =\\n {w, h : nat}\\n (int w, int h, real, real, real) -<cloref1>\\n rgba_array (w, h)\\n\\nvtypedef situation (p : addr, q : addr,\\n w : int, h : int) =\\n [null < p; null < q; 0 <= w; 0 <= h]\\n @{window = SDL_Window_ptr p,\\n renderer = SDL_Renderer_ptr q,\\n width = int w,\\n height = int h,\\n xcenter = real,\\n ycenter = real,\\n pixels_per_unit = real,\\n compute_scene = scene_computer}\\nvtypedef situation (w : int, h : int) =\\n [p, q : agz]\\n situation (p, q, w, h)\\nvtypedef situation =\\n [w, h : nat]\\n situation (w, h)\\n\\nfn\\ndestroy_situation (situation : situation) : void =\\n begin\\n SDL_DestroyRenderer (situation.renderer);\\n SDL_DestroyWindow (situation.window)\\n end\\n\\nfn\\nget_renderer_size (situation : &situation)\\n : [renderer_width, renderer_height : nat]\\n @(int renderer_width, int renderer_height) =\\n let\\n var w : int\\n var h : int\\n val status = SDL_GetRendererOutputSize (situation.renderer, w, h)\\n val w = g1ofg0 w and h = g1ofg0 h\\n in\\n if (status < 0) + (w < 0) + (h < 0) then\\n begin\\n destroy_situation situation;\\n $raise bailout \\\"rendering error\\\"\\n end\\n else\\n @(w, h)\\n end\\n\\nfn\\nresize_needed (situation : &situation) : bool =\\n let\\n val @(w, h) = get_renderer_size situation\\n in\\n (w <> situation.width) + (h <> situation.height)\\n end\\n\\n(*------------------------------------------------------------------*)\\n\\nfn\\ncompute_escape_times\\n {w, h : nat}\\n {mxtm : nat}\\n (width : int w,\\n height : int h,\\n xcenter : real,\\n ycenter : real,\\n pixels_per_unit : real,\\n max_time : uint16 mxtm)\\n : matrixref ([tm : nat | tm <= mxtm] uint16 tm, w, h) =\\n let\\n typedef tm = [tm : nat | tm <= mxtm] uint16 tm\\n\\n val times = matrixref_make_elt<tm> (i2sz width, i2sz height,\\n max_time)\\n and ppu2 = pixels_per_unit + pixels_per_unit\\n\\n fun\\n ij_loop {i, j : nat | i <= w; j <= h}\\n .<w - i, h - j>.\\n (i : int i,\\n j : int j) :<!refwrt> void =\\n if i = width then\\n ()\\n else if j = height then\\n ij_loop (succ i, 0)\\n else\\n let\\n val cx = xcenter + (g0i2f ((i + i) - width) / ppu2)\\n and cy = ycenter + (g0i2f (height - (j + j)) / ppu2)\\n\\n fun\\n tm_loop {tm : nat | tm <= mxtm}\\n .<mxtm - tm>.\\n (x : real,\\n y : real,\\n xx : real,\\n yy : real,\\n tm : uint16 tm)\\n :<> [tm1 : nat | tm1 <= mxtm] uint16 tm1 =\\n if tm = max_time then\\n tm\\n else if g0i2f 4 < xx + yy then\\n tm\\n else\\n let\\n val x = xx - yy + cx and y = ((x + x) * y) + cy\\n val xx = x * x and yy = y * y\\n in\\n tm_loop (x, y, xx, yy, succ tm)\\n end\\n\\n val tm = tm_loop (g0i2f 0, g0i2f 0,\\n g0i2f 0, g0i2f 0,\\n g1i2u 0)\\n in\\n times[i, height, j] := tm;\\n ij_loop (i, succ j)\\n end\\n in\\n ij_loop (0, 0);\\n times\\n end\\n\\nfn\\nthe_durn_simplest_scene_computer\\n {w, h : nat}\\n (width : int w,\\n height : int h,\\n xcenter : real,\\n ycenter : real,\\n pixels_per_unit : real)\\n :<cloref1> rgba_array (w, h) =\\n let\\n val escape_times =\\n compute_escape_times (width, height, xcenter, ycenter,\\n pixels_per_unit, g1i2u 255)\\n and points = matrixref_make_elt<rgba> (i2sz width, i2sz height,\\n empty_scene_color)\\n\\n fn {}\\n time2rgba {tm : nat | tm <= 255}\\n (tm : uint16 tm) : rgba =\\n let\\n val v = (g0u2u (g1i2u 255 - tm)) : uint8\\n in\\n @(v, v, v, g0i2u 255)\\n end\\n\\n fun\\n loop {i, j : nat | i <= w; j <= h}\\n .<w - i, h - j>.\\n (i : int i,\\n j : int j) : void =\\n if i = width then\\n ()\\n else if j = height then\\n loop (succ i, 0)\\n else\\n begin\\n points[i, height, j] :=\\n time2rgba escape_times[i, height, j];\\n loop (i, succ j)\\n end\\n in\\n loop (0, 0);\\n points\\n end\\n\\n(*------------------------------------------------------------------*)\\n(* Writing an image to a Portable Arbitrary Map. *)\\n\\nfn\\nwrite_rgba_points_as_pam\\n {w, h : nat}\\n (outf : FILEref,\\n width : int w,\\n height : int h,\\n points : rgba_array (w, h)) : void =\\n let\\n fun\\n loop {i, j : nat | i <= w; j <= h}\\n .<h - j, w - i>.\\n (i : int i,\\n j : int j) : void =\\n if j = height then\\n ()\\n else if i = width then\\n loop (0, succ j)\\n else\\n let\\n val @(r, g, b, a) = points[i, height, j]\\n in\\n fprint! (outf, int2uchar0 (g0u2i r));\\n fprint! (outf, int2uchar0 (g0u2i g));\\n fprint! (outf, int2uchar0 (g0u2i b));\\n fprint! (outf, int2uchar0 (g0u2i a));\\n loop (succ i, j)\\n end\\n in\\n (* Portable Arbitrary Map:\\n https://netpbm.sourceforge.net/doc/pam.html *)\\n fprintln! (outf, \\\"P7\\\");\\n fprintln! (outf, \\\"WIDTH \\\", width);\\n fprintln! (outf, \\\"HEIGHT \\\", height);\\n fprintln! (outf, \\\"DEPTH 4\\\");\\n fprintln! (outf, \\\"MAXVAL 255\\\");\\n fprintln! (outf, \\\"TUPLTYPE RGB_ALPHA\\\");\\n fprintln! (outf, \\\"ENDHDR\\\");\\n loop (0, 0)\\n end\\n\\n(* For this demo, simply number the images, starting at 1 on each run\\n of the program. *)\\nval image_number : ref uint = ref 1U\\nfn\\nwrite_image {w, h : nat}\\n (width : int w,\\n height : int h,\\n points : rgba_array (w, h)) : void =\\n let\\n val filename =\\n strptr2string (string_append (\\\"mandelbrot-image-\\\",\\n tostring_val<uint> !image_number,\\n \\\".pam\\\"))\\n in\\n case+ fileref_open_opt (filename, file_mode_w) of\\n | ~ None_vt () =>\\n println! (\\\"ERROR: could not open \\\", filename, \\\" for writing.\\\")\\n | ~ Some_vt outf =>\\n begin\\n write_rgba_points_as_pam (outf, width, height, points);\\n fileref_close (outf);\\n println! (\\\"SUCCESS: wrote \\\", filename);\\n !image_number := succ !image_number\\n end\\n end\\n\\n(*------------------------------------------------------------------*)\\n\\nval initial_width : intGte 0 = 400\\nval initial_height : intGte 0 = 400\\nval initial_xcenter : real = g0f2f ~0.75\\nval initial_ycenter : real = g0f2f 0.0\\nval initial_pixels_per_unit : real = g0f2f 150.0\\nval initial_scene_computer : scene_computer =\\n the_durn_simplest_scene_computer\\n\\n(* Zoom factor could be adjustable, but is not in this simple demo. *)\\nval zoom_factor : real = g0f2f 2.0\\nval min_pixels_per_unit : real = g0f2f 10.0\\n\\nfn\\nset_render_rgba (renderer : !SDL_Renderer_ptr1,\\n rgba : rgba) : int =\\n let\\n val @(r, g, b, a) = rgba\\n in\\n SDL_SetRenderDrawColor (renderer, r, g, b, a)\\n end\\n\\nfn\\ndraw_scene {w, h : nat}\\n (renderer : !SDL_Renderer_ptr1,\\n width : int w,\\n height : int h,\\n points : rgba_array (w, h)) : void =\\n let\\n prval () = mul_gte_gte_gte {w, h} ()\\n\\n fun\\n loop {i, j : nat | i <= w; j <= h}\\n .<w - i, h - j>.\\n (renderer : !SDL_Renderer_ptr1,\\n i : int i,\\n j : int j) : void =\\n if i = width then\\n ()\\n else if j = height then\\n loop (renderer, succ i, 0)\\n else\\n let\\n val rgba = points[i, height, j]\\n val _ = set_render_rgba (renderer, rgba)\\n val _ = SDL_RenderDrawPoint (renderer, i, j)\\n in\\n loop (renderer, i, succ j)\\n end\\n in\\n ignoret (set_render_rgba (renderer, empty_scene_color));\\n ignoret (SDL_RenderClear (renderer));\\n loop (renderer, 0, 0);\\n end\\n\\nfnx\\nsituation_changed\\n {w, h : nat}\\n (situation : &situation (w, h) >> situation,\\n event : &SDL_Event? >> SDL_Event) : void =\\n let\\n val compute_scene = situation.compute_scene\\n val points =\\n compute_scene (situation.width, situation.height,\\n situation.xcenter, situation.ycenter,\\n situation.pixels_per_unit)\\n in\\n SDL_Delay (g0i2u 16);\\n event_loop (situation, points, event)\\n end\\nand\\nevent_loop {w, h : nat}\\n (situation : &situation (w, h) >> situation,\\n points : rgba_array (w, h),\\n event : &SDL_Event? >> SDL_Event) : void =\\n let\\n macdef quit_the_event_loop =\\n ()\\n macdef present_the_scene =\\n present_scene (situation, points, event)\\n macdef deal_with_changed_situation =\\n situation_changed (situation, event)\\n macdef write_an_image =\\n write_image (situation.width, situation.height, points);\\n in\\n if resize_needed situation then\\n let\\n val @(w, h) = get_renderer_size situation\\n in\\n situation.width := w;\\n situation.height := h;\\n deal_with_changed_situation\\n end\\n else\\n let\\n in\\n draw_scene (situation.renderer,\\n situation.width, situation.height,\\n points);\\n case+ SDL_PollEvent (event) of\\n | 0 => present_the_scene\\n | 1 =>\\n if event.type = SDL_QUIT then\\n quit_the_event_loop\\n else if event.type = SDL_WINDOWEVENT then\\n let\\n prval @(pf, fpf) = SDL_Event2WindowEvent_v (view@ event)\\n prval () = view@ event := pf\\n val window_event = event\\n prval () = view@ event := fpf (view@ event)\\n in\\n if window_event.event = SDL_WINDOWEVENT_SIZE_CHANGED then\\n deal_with_changed_situation\\n else if window_event.event = SDL_WINDOWEVENT_CLOSE then\\n quit_the_event_loop\\n else\\n present_the_scene\\n end\\n else if event.type = SDL_MOUSEBUTTONDOWN then\\n let\\n prval @(pf, fpf) = SDL_Event2MouseButtonEvent_v (view@ event)\\n prval () = view@ event := pf\\n val button_event = event\\n prval () = view@ event := fpf (view@ event)\\n in\\n if button_event.button = SDL_BUTTON_LEFT then\\n begin\\n if button_event.clicks = g0i2u 1 then\\n let (* Re-center. *)\\n val x = g0i2i button_event.x\\n and y = g0i2i button_event.y\\n and w = situation.width\\n and h = situation.height\\n and ppu = situation.pixels_per_unit\\n val ppu2 = ppu + ppu\\n in\\n situation.xcenter :=\\n situation.xcenter + (g0i2f (x + x - w) / ppu2);\\n situation.ycenter :=\\n situation.ycenter + (g0i2f (h - y - y) / ppu2);\\n deal_with_changed_situation\\n end\\n else\\n let (* Zoom in. *)\\n val new_ppu = situation.pixels_per_unit * zoom_factor\\n in\\n situation.pixels_per_unit := new_ppu;\\n deal_with_changed_situation\\n end\\n end\\n else if button_event.button = SDL_BUTTON_RIGHT then\\n begin\\n if button_event.clicks = g0i2u 1 then\\n present_the_scene\\n else\\n let (* Zoom out *)\\n val new_ppu = situation.pixels_per_unit / zoom_factor\\n in\\n if min_pixels_per_unit <= new_ppu then\\n situation.pixels_per_unit := new_ppu;\\n deal_with_changed_situation\\n end\\n end\\n else\\n present_the_scene\\n end\\n else if event.type = SDL_TEXTINPUT then\\n let\\n prval @(pf, fpf) = SDL_Event2TextInputEvent_v (view@ event)\\n prval () = view@ event := pf\\n var text_event = event\\n prval () = view@ event := fpf (view@ event)\\n macdef text = text_event.text\\n in\\n case+ @(text[0], text[1]) of\\n | @('q', '\\\\0') => quit_the_event_loop\\n | @('Q', '\\\\0') => quit_the_event_loop\\n | @('p', '\\\\0') =>\\n begin\\n write_an_image;\\n present_the_scene\\n end\\n | @('P', '\\\\0') =>\\n begin\\n write_an_image;\\n present_the_scene\\n end\\n | _ => present_the_scene\\n end\\n else\\n present_the_scene\\n end\\n end\\nand\\npresent_scene {w, h : nat}\\n (situation : &situation (w, h) >> situation,\\n points : rgba_array (w, h),\\n event : &SDL_Event? >> SDL_Event) : void =\\n begin\\n SDL_RenderPresent (situation.renderer);\\n SDL_Delay (g0i2u 16);\\n event_loop (situation, points, event)\\n end\\n\\nfn\\nrun_program () : void =\\n let\\n (* FIXME: For best form, we should also set up a signal handler\\n that runs SDL_Quit, so the display does not get stuck in an\\n undesired state even if the program crashes. For instance,\\n there could be a signaled divide by zero or overflow event. And\\n we are at least changing whether the screensaver is enabled. *)\\n val _ = atexit SDL_Quit\\n\\n val () = SDL_Init (SDL_INIT_EVENTS\\n lor SDL_INIT_TIMER\\n lor SDL_INIT_VIDEO)\\n\\n (* FIXME: Find out whether the screensaver was enabled BEFORE we\\n started SDL2, and set SDL2 to whichever setting it was. *)\\n val () = SDL_EnableScreenSaver ()\\n\\n val window = SDL_CreateWindow (\\\"mandelbrot_task_interactive\\\",\\n SDL_WINDOWPOS_CENTERED,\\n SDL_WINDOWPOS_CENTERED,\\n initial_width, initial_height,\\n SDL_WINDOW_RESIZABLE)\\n val p_window = SDL_Window_ptr2ptr window\\n prval () = lemma_ptr_param p_window\\n in\\n if iseqz p_window then\\n begin\\n SDL_DestroyWindow_null window;\\n $raise bailout \\\"failed to initialize a window\\\"\\n end\\n else\\n let\\n val renderer = SDL_CreateRenderer (window, ~1, g0i2u 0)\\n val p_renderer = SDL_Renderer_ptr2ptr renderer\\n prval () = lemma_ptr_param p_renderer\\n in\\n if iseqz p_renderer then\\n begin\\n SDL_DestroyRenderer_null renderer;\\n SDL_DestroyWindow window;\\n $raise bailout \\\"failed to initialize a renderer\\\"\\n end\\n else\\n let\\n var situation : situation =\\n @{window = window,\\n renderer = renderer,\\n width = initial_width,\\n height = initial_height,\\n xcenter = initial_xcenter,\\n ycenter = initial_ycenter,\\n pixels_per_unit = initial_pixels_per_unit,\\n compute_scene = initial_scene_computer}\\n var event : SDL_Event?\\n in\\n situation_changed (situation, event);\\n destroy_situation situation\\n end\\n end\\n end\\n\\nimplement\\nmain () =\\n try\\n begin\\n SDL_SetMainReady ();\\n run_program ();\\n 0\\n end\\n with\\n | ~ bailout msg =>\\n begin\\n println! (\\\"Error: \\\", msg);\\n 1\\n end\\n\\n(*------------------------------------------------------------------*)\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \"Max_Iteration := 256\\nWidth := Height := 400\\n\\nFile := \\\"MandelBrot.\\\" Width \\\".bmp\\\"\\nProgress, b2 w400 fs9, Creating Colours ...\\nGosub, CreateColours\\nGosub, CreateBitmap\\nProgress, Off\\nGui, -Caption\\nGui, Margin, 0, 0\\nGui, Add, Picture,, %File%\\nGui, Show,, MandelBrot\\nReturn\\n\\nGuiClose:\\nGuiEscape:\\nExitApp\\n\\n\\n\\n;---------------------------------------------------------------------------\\nCreateBitmap: ; create and save a 32bit bitmap file\\n;---------------------------------------------------------------------------\\n ; define header details\\n HeaderBMP := 14\\n HeaderDIB := 40\\n DataOffset := HeaderBMP + HeaderDIB\\n ImageSize := Width * Height * 4 ; 32bit\\n FileSize := DataOffset + ImageSize\\n Resolution := 3780 ; from mspaint\\n\\n ; create bitmap header\\n VarSetCapacity(IMAGE, FileSize, 0)\\n NumPut(Asc(\\\"B\\\") , IMAGE, 0x00, \\\"Char\\\")\\n NumPut(Asc(\\\"M\\\") , IMAGE, 0x01, \\\"Char\\\")\\n NumPut(FileSize , IMAGE, 0x02, \\\"UInt\\\")\\n NumPut(DataOffset , IMAGE, 0x0A, \\\"UInt\\\")\\n NumPut(HeaderDIB , IMAGE, 0x0E, \\\"UInt\\\")\\n NumPut(Width , IMAGE, 0x12, \\\"UInt\\\")\\n NumPut(Height , IMAGE, 0x16, \\\"UInt\\\")\\n NumPut(1 , IMAGE, 0x1A, \\\"Short\\\") ; Planes\\n NumPut(32 , IMAGE, 0x1C, \\\"Short\\\") ; Bits per Pixel\\n NumPut(ImageSize , IMAGE, 0x22, \\\"UInt\\\")\\n NumPut(Resolution , IMAGE, 0x26, \\\"UInt\\\")\\n NumPut(Resolution , IMAGE, 0x2A, \\\"UInt\\\")\\n\\n ; fill in Data\\n Gosub, CreatePixels\\n\\n ; save Bitmap to file\\n FileDelete, %File%\\n Handle := DllCall(\\\"CreateFile\\\", \\\"Str\\\", File, \\\"UInt\\\", 0x40000000\\n , \\\"UInt\\\", 0, \\\"UInt\\\", 0, \\\"UInt\\\", 2, \\\"UInt\\\", 0, \\\"UInt\\\", 0)\\n DllCall(\\\"WriteFile\\\", \\\"UInt\\\", Handle, \\\"UInt\\\", &IMAGE, \\\"UInt\\\"\\n , FileSize, \\\"UInt *\\\", Bytes, \\\"UInt\\\", 0)\\n DllCall(\\\"CloseHandle\\\", \\\"UInt\\\", Handle)\\n\\nReturn\\n\\n\\n\\n;---------------------------------------------------------------------------\\nCreatePixels: ; create pixels for [-2 < x < 1] [-1.5 < y < 1.5]\\n;---------------------------------------------------------------------------\\n Loop, % Height // 2 + 1 {\\n yi := A_Index - 1\\n y0 := -1.5 + yi / Height * 3 ; range -1.5 .. +1.5\\n Progress, % 200*yi // Height, % \\\"Current line: \\\" 2*yi \\\" / \\\" Height\\n Loop, %Width% {\\n xi := A_Index - 1\\n x0 := -2 + xi / Width * 3 ; range -2 .. +1\\n Gosub, Mandelbrot\\n p1 := DataOffset + 4 * (Width * yi + xi)\\n NumPut(Colour, IMAGE, p1, \\\"UInt\\\")\\n p2 := DataOffset + 4 * (Width * (Height-yi) + xi)\\n NumPut(Colour, IMAGE, p2, \\\"UInt\\\")\\n }\\n }\\nReturn\\n\\n\\n\\n;---------------------------------------------------------------------------\\nMandelbrot: ; calculate a colour for each pixel\\n;---------------------------------------------------------------------------\\n x := y := Iteration := 0\\n While, (x*x + y*y <= 4) And (Iteration < Max_Iteration) {\\n xtemp := x*x - y*y + x0\\n y := 2*x*y + y0\\n x := xtemp\\n Iteration++\\n }\\n Colour := Iteration = Max_Iteration ? 0 : Colour_%Iteration%\\n\\nReturn\\n\\n\\n\\n;---------------------------------------------------------------------------\\nCreateColours: ; borrowed from PureBasic example\\n;---------------------------------------------------------------------------\\n Loop, 64 {\\n i4 := (i3 := (i2 := (i1 := A_Index - 1) + 64) + 64) + 64\\n Colour_%i1% := RGB(4*i1 + 128, 4*i1, 0)\\n Colour_%i2% := RGB(64, 255, 4*i1)\\n Colour_%i3% := RGB(64, 255 - 4*i1, 255)\\n Colour_%i4% := RGB(64, 0, 255 - 4*i1)\\n }\\nReturn\\n\\n\\n\\n;---------------------------------------------------------------------------\\nRGB(r, g, b) { ; return 24bit color value\\n;---------------------------------------------------------------------------\\n Return, (r&0xFF)<<16 | g<<8 | b\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"BEGIN {\\n XSize=59; YSize=21;\\n MinIm=-1.0; MaxIm=1.0;MinRe=-2.0; MaxRe=1.0;\\n StepX=(MaxRe-MinRe)/XSize; StepY=(MaxIm-MinIm)/YSize;\\n for(y=0;y<YSize;y++)\\n {\\n Im=MinIm+StepY*y;\\n for(x=0;x<XSize;x++)\\n {\\n Re=MinRe+StepX*x; Zr=Re; Zi=Im;\\n for(n=0;n<30;n++)\\n {\\n a=Zr*Zr; b=Zi*Zi;\\n if(a+b>4.0) break;\\n Zi=2*Zr*Zi+Im; Zr=a-b+Re;\\n }\\n printf \\\"%c\\\",62-n;\\n }\\n print \\\"\\\";\\n }\\n exit;\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"main() {\\n auto cx,cy,x,y,x2,y2;\\n auto iter;\\n\\n auto xmin,xmax,ymin,ymax,maxiter,dx,dy;\\n\\n xmin = -8601;\\n xmax = 2867;\\n ymin = -4915;\\n ymax = 4915;\\n\\n maxiter = 32;\\n\\n dx = (xmax-xmin)/79;\\n dy = (ymax-ymin)/24;\\n\\n cy=ymin;\\n while( cy<=ymax ) {\\n cx=xmin;\\n while( cx<=xmax ) {\\n x = 0;\\n y = 0;\\n x2 = 0;\\n y2 = 0;\\n iter=0;\\n while( iter<maxiter ) {\\n if( x2+y2>16384 ) break;\\n y = ((x*y)>>11)+cy;\\n x = x2-y2+cx;\\n x2 = (x*x)>>12;\\n y2 = (y*y)>>12;\\n iter++;\\n }\\n putchar(' '+iter);\\n cx =+ dx;\\n }\\n putchar(13);\\n putchar(10);\\n cy =+ dy;\\n }\\n\\n return(0);\\n}\\n\",\n \"language\": \"B\"\n },\n {\n \"code\": \"fastgraphics\\n\\ngraphsize 384,384\\nrefresh\\nkt = 319 : m = 4.0\\nxmin = -2.1 : xmax = 0.6 : ymin = -1.35 : ymax = 1.35\\ndx = (xmax - xmin) / graphwidth : dy = (ymax - ymin) / graphheight\\n\\nfor x = 0 to graphwidth\\n\\tjx = xmin + x * dx\\n\\tfor y = 0 to graphheight\\n\\t\\tjy = ymin + y * dy\\n\\t\\tk = 0 : wx = 0.0 : wy = 0.0\\n\\t\\tdo\\n\\t\\t\\ttx = wx * wx - wy * wy + jx\\n\\t\\t\\tty = 2.0 * wx * wy + jy\\n\\t\\t\\twx = tx\\n\\t\\t\\twy = ty\\n\\t\\t\\tr = wx * wx + wy * wy\\n\\t\\t\\tk = k + 1\\n\\t\\tuntil r > m or k > kt\\n\\t\\t\\n\\t\\tif k > kt then\\n\\t\\t\\tcolor black\\n\\t\\telse\\n\\t\\t\\tif k < 16 then color k * 8, k * 8, 128 + k * 4\\n\\t\\t\\tif k >= 16 and k < 64 then color 128 + k - 16, 128 + k - 16, 192 + k - 16\\n\\t\\t\\tif k >= 64 then color kt - k, 128 + (kt - k) / 2, kt - k\\n\\t\\tend if\\n\\t\\tplot x, y\\n\\tnext y\\n\\trefresh\\nnext x\\nimgsave \\\"Mandelbrot_BASIC-256.png\\\", \\\"PNG\\\"\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \" sizex% = 300 : sizey% = 300\\n maxiter% = 128\\n VDU 23,22,sizex%;sizey%;8,8,16,128\\n ORIGIN 0,sizey%\\n GCOL 1\\n FOR X% = 0 TO 2*sizex%-2 STEP 2\\n xi = X%/200 - 2\\n FOR Y% = 0 TO sizey%-2 STEP 2\\n yi = Y% / 200\\n x = 0\\n y = 0\\n FOR I% = 1 TO maxiter%\\n IF x*x+y*y > 4 EXIT FOR\\n xt = xi + x*x-y*y\\n y = yi + 2*x*y\\n x = xt\\n NEXT\\n IF I%>maxiter% I%=0\\n COLOUR 1,I%*15,I%*8,0\\n PLOT X%,Y% : PLOT X%,-Y%\\n NEXT\\n NEXT X%\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"max_iter = 50\\nwidth = 400; height = 401\\nscale = 10\\nxmin = -2; xmax = 1/2\\nymin = -5/4; ymax = 5/4\\n\\ndefine mandelbrot(c_re, c_im) {\\n auto i\\n\\n # z = 0\\n z_re = 0; z_im = 0\\n z2_re = 0; z2_im = 0\\n\\n for (i=0; i<max_iter; i++) {\\n # z *= z\\n z_im = 2*z_re*z_im\\n z_re = z2_re - z2_im\\n # z += c\\n z_re += c_re\\n z_im += c_im\\n # z2 = z.*z\\n z2_re = z_re*z_re\\n z2_im = z_im*z_im\\n if (z2_re + z2_im > 4) return i\\n }\\n return 0\\n}\\n\\nprint \\\"P2\\\\n\\\", width, \\\" \\\", height, \\\"\\\\n255\\\\n\\\"\\n\\nfor (i = 0; i < height; i++) {\\n y = ymin + (ymax - ymin) / height * i\\n for (j = 0; j < width; j++) {\\n x = xmin + (xmax - xmin) / width * j\\n tmp_scale = scale\\n scale = 0\\n m = (255 * mandelbrot(x, y) + max_iter + 1) / max_iter\\n print m\\n if ( j < width - 1 ) print \\\" \\\"\\n scale = tmp_scale\\n\\n }\\n print \\\"\\\\n\\\"\\n}\\n\\nquit\\n\",\n \"language\": \"Bc\"\n },\n {\n \"code\": \"0>:00p58*`#@_0>:01p78vv$$<\\n@^+1g00,+55_v# !`\\\\+*9<>4v$\\n@v30p20\\\"?~^\\\"< ^+1g10,+*8<$\\n@>p0\\\\>\\\\::*::882**02g*0v >^\\n`*:*\\\" d\\\":+*:-*\\\"[Z\\\"+g3 < |<\\nv-*\\\"[Z\\\"+g30*g20**288\\\\--\\\\<#\\n>2**5#>8*:*/00g\\\"P\\\"*58*:*v^\\nv*288 p20/**288:+*\\\"[Z\\\"+-<:\\n>*%03 p58*:*/01g\\\"3\\\"* v>::^\\n \\\\_^#!:-1\\\\+-*2*:*85<^\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \"#!/usr/bin/env bx\\nuse b\\n\\nMain():\\n\\tnum outside = 16, ox = -0.5, oy = 0, r = 1.5\\n\\tlong i, max_i = 100, rb_i = 30\\n\\tspace()\\n\\tuint32_t *px = pixel()\\n\\tnum d = 2*r/h, x0 = ox-d*w_2, y0 = oy+d*h_2\\n\\tfor(y, 0, h):\\n\\t\\tcmplx c = x0 + (y0-d*y)*I\\n\\t\\trepeat(w):\\n\\t\\t\\tcmplx w = 0\\n\\t\\t\\tfor i=0; i < max_i && cabs(w) < outside; ++i\\n\\t\\t\\t\\tw = w*w + c\\n\\t\\t\\t*px++ = i < max_i ? rainbow(i*359 / rb_i % 360) : black\\n\\t\\t\\tc += d\\n\",\n \"language\": \"Brace\"\n },\n {\n \"code\": \" A mandelbrot set fractal viewer in brainf*ck written by Erik Bosman\\n+++++++++++++[->++>>>+++++>++>+<<<<<<]>>>>>++++++>--->>>>>>>>>>+++++++++++++++[[\\n>>>>>>>>>]+[<<<<<<<<<]>>>>>>>>>-]+[>>>>>>>>[-]>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>[-]+\\n<<<<<<<+++++[-[->>>>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>>>>+>>>>>>>>>>>>>>>>>>>>>>>>>>\\n>+<<<<<<<<<<<<<<<<<[<<<<<<<<<]>>>[-]+[>>>>>>[>>>>>>>[-]>>]<<<<<<<<<[<<<<<<<<<]>>\\n>>>>>[-]+<<<<<<++++[-[->>>>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>>>+<<<<<<+++++++[-[->>>\\n>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>>>+<<<<<<<<<<<<<<<<[<<<<<<<<<]>>>[[-]>>>>>>[>>>>>\\n>>[-<<<<<<+>>>>>>]<<<<<<[->>>>>>+<<+<<<+<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>\\n[>>>>>>>>[-<<<<<<<+>>>>>>>]<<<<<<<[->>>>>>>+<<+<<<+<<]>>>>>>>>]<<<<<<<<<[<<<<<<<\\n<<]>>>>>>>[-<<<<<<<+>>>>>>>]<<<<<<<[->>>>>>>+<<+<<<<<]>>>>>>>>>+++++++++++++++[[\\n>>>>>>>>>]+>[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>-]+[\\n>+>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>->>>>[-<<<<+>>>>]<<<<[->>>>+<<<<<[->>[\\n-<<+>>]<<[->>+>>+<<<<]+>>>>>>>>>]<<<<<<<<[<<<<<<<<<]]>>>>>>>>>[>>>>>>>>>]<<<<<<<\\n<<[>[->>>>>>>>>+<<<<<<<<<]<<<<<<<<<<]>[->>>>>>>>>+<<<<<<<<<]<+>>>>>>>>]<<<<<<<<<\\n[>[-]<->>>>[-<<<<+>[<->-<<<<<<+>>>>>>]<[->+<]>>>>]<<<[->>>+<<<]<+<<<<<<<<<]>>>>>\\n>>>>[>+>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>->>>>>[-<<<<<+>>>>>]<<<<<[->>>>>+\\n<<<<<<[->>>[-<<<+>>>]<<<[->>>+>+<<<<]+>>>>>>>>>]<<<<<<<<[<<<<<<<<<]]>>>>>>>>>[>>\\n>>>>>>>]<<<<<<<<<[>>[->>>>>>>>>+<<<<<<<<<]<<<<<<<<<<<]>>[->>>>>>>>>+<<<<<<<<<]<<\\n+>>>>>>>>]<<<<<<<<<[>[-]<->>>>[-<<<<+>[<->-<<<<<<+>>>>>>]<[->+<]>>>>]<<<[->>>+<<\\n<]<+<<<<<<<<<]>>>>>>>>>[>>>>[-<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<+>>>>>>>>>>>>>\\n>>>>>>>>>>>>>>>>>>>>>>>]>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>+++++++++++++++[[>>>>\\n>>>>>]<<<<<<<<<-<<<<<<<<<[<<<<<<<<<]>>>>>>>>>-]+>>>>>>>>>>>>>>>>>>>>>+<<<[<<<<<<\\n<<<]>>>>>>>>>[>>>[-<<<->>>]+<<<[->>>->[-<<<<+>>>>]<<<<[->>>>+<<<<<<<<<<<<<[<<<<<\\n<<<<]>>>>[-]+>>>>>[>>>>>>>>>]>+<]]+>>>>[-<<<<->>>>]+<<<<[->>>>-<[-<<<+>>>]<<<[->\\n>>+<<<<<<<<<<<<[<<<<<<<<<]>>>[-]+>>>>>>[>>>>>>>>>]>[-]+<]]+>[-<[>>>>>>>>>]<<<<<<\\n<<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]<<<<<<<[->+>>>-<<<<]>>>>>>>>>+++++++++++++++++++\\n+++++++>>[-<<<<+>>>>]<<<<[->>>>+<<[-]<<]>>[<<<<<<<+<[-<+>>>>+<<[-]]>[-<<[->+>>>-\\n<<<<]>>>]>>>>>>>>>>>>>[>>[-]>[-]>[-]>>>>>]<<<<<<<<<[<<<<<<<<<]>>>[-]>>>>>>[>>>>>\\n[-<<<<+>>>>]<<<<[->>>>+<<<+<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>>[-<<<<<<<<\\n<+>>>>>>>>>]>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>+++++++++++++++[[>>>>>>>>>]+>[-\\n]>[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>-]+[>+>>>>>>>>]<<<\\n<<<<<<[<<<<<<<<<]>>>>>>>>>[>->>>>>[-<<<<<+>>>>>]<<<<<[->>>>>+<<<<<<[->>[-<<+>>]<\\n<[->>+>+<<<]+>>>>>>>>>]<<<<<<<<[<<<<<<<<<]]>>>>>>>>>[>>>>>>>>>]<<<<<<<<<[>[->>>>\\n>>>>>+<<<<<<<<<]<<<<<<<<<<]>[->>>>>>>>>+<<<<<<<<<]<+>>>>>>>>]<<<<<<<<<[>[-]<->>>\\n[-<<<+>[<->-<<<<<<<+>>>>>>>]<[->+<]>>>]<<[->>+<<]<+<<<<<<<<<]>>>>>>>>>[>>>>>>[-<\\n<<<<+>>>>>]<<<<<[->>>>>+<<<<+<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>+>>>>>>>>\\n]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>->>>>>[-<<<<<+>>>>>]<<<<<[->>>>>+<<<<<<[->>[-<<+\\n>>]<<[->>+>>+<<<<]+>>>>>>>>>]<<<<<<<<[<<<<<<<<<]]>>>>>>>>>[>>>>>>>>>]<<<<<<<<<[>\\n[->>>>>>>>>+<<<<<<<<<]<<<<<<<<<<]>[->>>>>>>>>+<<<<<<<<<]<+>>>>>>>>]<<<<<<<<<[>[-\\n]<->>>>[-<<<<+>[<->-<<<<<<+>>>>>>]<[->+<]>>>>]<<<[->>>+<<<]<+<<<<<<<<<]>>>>>>>>>\\n[>>>>[-<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<+>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\\n]>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>>>[-<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<+>\\n>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>]>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>++++++++\\n+++++++[[>>>>>>>>>]<<<<<<<<<-<<<<<<<<<[<<<<<<<<<]>>>>>>>>>-]+[>>>>>>>>[-<<<<<<<+\\n>>>>>>>]<<<<<<<[->>>>>>>+<<<<<<+<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>>>>>>[\\n-]>>>]<<<<<<<<<[<<<<<<<<<]>>>>+>[-<-<<<<+>>>>>]>[-<<<<<<[->>>>>+<++<<<<]>>>>>[-<\\n<<<<+>>>>>]<->+>]<[->+<]<<<<<[->>>>>+<<<<<]>>>>>>[-]<<<<<<+>>>>[-<<<<->>>>]+<<<<\\n[->>>>->>>>>[>>[-<<->>]+<<[->>->[-<<<+>>>]<<<[->>>+<<<<<<<<<<<<[<<<<<<<<<]>>>[-]\\n+>>>>>>[>>>>>>>>>]>+<]]+>>>[-<<<->>>]+<<<[->>>-<[-<<+>>]<<[->>+<<<<<<<<<<<[<<<<<\\n<<<<]>>>>[-]+>>>>>[>>>>>>>>>]>[-]+<]]+>[-<[>>>>>>>>>]<<<<<<<<]>>>>>>>>]<<<<<<<<<\\n[<<<<<<<<<]>>>>[-<<<<+>>>>]<<<<[->>>>+>>>>>[>+>>[-<<->>]<<[->>+<<]>>>>>>>>]<<<<<\\n<<<+<[>[->>>>>+<<<<[->>>>-<<<<<<<<<<<<<<+>>>>>>>>>>>[->>>+<<<]<]>[->>>-<<<<<<<<<\\n<<<<<+>>>>>>>>>>>]<<]>[->>>>+<<<[->>>-<<<<<<<<<<<<<<+>>>>>>>>>>>]<]>[->>>+<<<]<<\\n<<<<<<<<<<]>>>>[-]<<<<]>>>[-<<<+>>>]<<<[->>>+>>>>>>[>+>[-<->]<[->+<]>>>>>>>>]<<<\\n<<<<<+<[>[->>>>>+<<<[->>>-<<<<<<<<<<<<<<+>>>>>>>>>>[->>>>+<<<<]>]<[->>>>-<<<<<<<\\n<<<<<<<+>>>>>>>>>>]<]>>[->>>+<<<<[->>>>-<<<<<<<<<<<<<<+>>>>>>>>>>]>]<[->>>>+<<<<\\n]<<<<<<<<<<<]>>>>>>+<<<<<<]]>>>>[-<<<<+>>>>]<<<<[->>>>+>>>>>[>>>>>>>>>]<<<<<<<<<\\n[>[->>>>>+<<<<[->>>>-<<<<<<<<<<<<<<+>>>>>>>>>>>[->>>+<<<]<]>[->>>-<<<<<<<<<<<<<<\\n+>>>>>>>>>>>]<<]>[->>>>+<<<[->>>-<<<<<<<<<<<<<<+>>>>>>>>>>>]<]>[->>>+<<<]<<<<<<<\\n<<<<<]]>[-]>>[-]>[-]>>>>>[>>[-]>[-]>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>>>>>[-<\\n<<<+>>>>]<<<<[->>>>+<<<+<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>+++++++++++++++[\\n[>>>>>>>>>]+>[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>-]+\\n[>+>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>->>>>[-<<<<+>>>>]<<<<[->>>>+<<<<<[->>\\n[-<<+>>]<<[->>+>+<<<]+>>>>>>>>>]<<<<<<<<[<<<<<<<<<]]>>>>>>>>>[>>>>>>>>>]<<<<<<<<\\n<[>[->>>>>>>>>+<<<<<<<<<]<<<<<<<<<<]>[->>>>>>>>>+<<<<<<<<<]<+>>>>>>>>]<<<<<<<<<[\\n>[-]<->>>[-<<<+>[<->-<<<<<<<+>>>>>>>]<[->+<]>>>]<<[->>+<<]<+<<<<<<<<<]>>>>>>>>>[\\n>>>[-<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<+>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>]>\\n>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>[-]>>>>+++++++++++++++[[>>>>>>>>>]<<<<<<<<<-<<<<<\\n<<<<[<<<<<<<<<]>>>>>>>>>-]+[>>>[-<<<->>>]+<<<[->>>->[-<<<<+>>>>]<<<<[->>>>+<<<<<\\n<<<<<<<<[<<<<<<<<<]>>>>[-]+>>>>>[>>>>>>>>>]>+<]]+>>>>[-<<<<->>>>]+<<<<[->>>>-<[-\\n<<<+>>>]<<<[->>>+<<<<<<<<<<<<[<<<<<<<<<]>>>[-]+>>>>>>[>>>>>>>>>]>[-]+<]]+>[-<[>>\\n>>>>>>>]<<<<<<<<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>[-<<<+>>>]<<<[->>>+>>>>>>[>+>>>\\n[-<<<->>>]<<<[->>>+<<<]>>>>>>>>]<<<<<<<<+<[>[->+>[-<-<<<<<<<<<<+>>>>>>>>>>>>[-<<\\n+>>]<]>[-<<-<<<<<<<<<<+>>>>>>>>>>>>]<<<]>>[-<+>>[-<<-<<<<<<<<<<+>>>>>>>>>>>>]<]>\\n[-<<+>>]<<<<<<<<<<<<<]]>>>>[-<<<<+>>>>]<<<<[->>>>+>>>>>[>+>>[-<<->>]<<[->>+<<]>>\\n>>>>>>]<<<<<<<<+<[>[->+>>[-<<-<<<<<<<<<<+>>>>>>>>>>>[-<+>]>]<[-<-<<<<<<<<<<+>>>>\\n>>>>>>>]<<]>>>[-<<+>[-<-<<<<<<<<<<+>>>>>>>>>>>]>]<[-<+>]<<<<<<<<<<<<]>>>>>+<<<<<\\n]>>>>>>>>>[>>>[-]>[-]>[-]>>>>]<<<<<<<<<[<<<<<<<<<]>>>[-]>[-]>>>>>[>>>>>>>[-<<<<<\\n<+>>>>>>]<<<<<<[->>>>>>+<<<<+<<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>+>[-<-<<<<+>>>>\\n>]>>[-<<<<<<<[->>>>>+<++<<<<]>>>>>[-<<<<<+>>>>>]<->+>>]<<[->>+<<]<<<<<[->>>>>+<<\\n<<<]+>>>>[-<<<<->>>>]+<<<<[->>>>->>>>>[>>>[-<<<->>>]+<<<[->>>-<[-<<+>>]<<[->>+<<\\n<<<<<<<<<[<<<<<<<<<]>>>>[-]+>>>>>[>>>>>>>>>]>+<]]+>>[-<<->>]+<<[->>->[-<<<+>>>]<\\n<<[->>>+<<<<<<<<<<<<[<<<<<<<<<]>>>[-]+>>>>>>[>>>>>>>>>]>[-]+<]]+>[-<[>>>>>>>>>]<\\n<<<<<<<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>[-<<<+>>>]<<<[->>>+>>>>>>[>+>[-<->]<[->+\\n<]>>>>>>>>]<<<<<<<<+<[>[->>>>+<<[->>-<<<<<<<<<<<<<+>>>>>>>>>>[->>>+<<<]>]<[->>>-\\n<<<<<<<<<<<<<+>>>>>>>>>>]<]>>[->>+<<<[->>>-<<<<<<<<<<<<<+>>>>>>>>>>]>]<[->>>+<<<\\n]<<<<<<<<<<<]>>>>>[-]>>[-<<<<<<<+>>>>>>>]<<<<<<<[->>>>>>>+<<+<<<<<]]>>>>[-<<<<+>\\n>>>]<<<<[->>>>+>>>>>[>+>>[-<<->>]<<[->>+<<]>>>>>>>>]<<<<<<<<+<[>[->>>>+<<<[->>>-\\n<<<<<<<<<<<<<+>>>>>>>>>>>[->>+<<]<]>[->>-<<<<<<<<<<<<<+>>>>>>>>>>>]<<]>[->>>+<<[\\n->>-<<<<<<<<<<<<<+>>>>>>>>>>>]<]>[->>+<<]<<<<<<<<<<<<]]>>>>[-]<<<<]>>>>[-<<<<+>>\\n>>]<<<<[->>>>+>[-]>>[-<<<<<<<+>>>>>>>]<<<<<<<[->>>>>>>+<<+<<<<<]>>>>>>>>>[>>>>>>\\n>>>]<<<<<<<<<[>[->>>>+<<<[->>>-<<<<<<<<<<<<<+>>>>>>>>>>>[->>+<<]<]>[->>-<<<<<<<<\\n<<<<<+>>>>>>>>>>>]<<]>[->>>+<<[->>-<<<<<<<<<<<<<+>>>>>>>>>>>]<]>[->>+<<]<<<<<<<<\\n<<<<]]>>>>>>>>>[>>[-]>[-]>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>[-]>[-]>>>>>[>>>>>[-<<<<+\\n>>>>]<<<<[->>>>+<<<+<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>>>>>>[-<<<<<+>>>>>\\n]<<<<<[->>>>>+<<<+<<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>+++++++++++++++[[>>>>\\n>>>>>]+>[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]>[-]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>-]+[>+>>\\n>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>->>>>[-<<<<+>>>>]<<<<[->>>>+<<<<<[->>[-<<+\\n>>]<<[->>+>>+<<<<]+>>>>>>>>>]<<<<<<<<[<<<<<<<<<]]>>>>>>>>>[>>>>>>>>>]<<<<<<<<<[>\\n[->>>>>>>>>+<<<<<<<<<]<<<<<<<<<<]>[->>>>>>>>>+<<<<<<<<<]<+>>>>>>>>]<<<<<<<<<[>[-\\n]<->>>>[-<<<<+>[<->-<<<<<<+>>>>>>]<[->+<]>>>>]<<<[->>>+<<<]<+<<<<<<<<<]>>>>>>>>>\\n[>+>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>->>>>>[-<<<<<+>>>>>]<<<<<[->>>>>+<<<<\\n<<[->>>[-<<<+>>>]<<<[->>>+>+<<<<]+>>>>>>>>>]<<<<<<<<[<<<<<<<<<]]>>>>>>>>>[>>>>>>\\n>>>]<<<<<<<<<[>>[->>>>>>>>>+<<<<<<<<<]<<<<<<<<<<<]>>[->>>>>>>>>+<<<<<<<<<]<<+>>>\\n>>>>>]<<<<<<<<<[>[-]<->>>>[-<<<<+>[<->-<<<<<<+>>>>>>]<[->+<]>>>>]<<<[->>>+<<<]<+\\n<<<<<<<<<]>>>>>>>>>[>>>>[-<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<+>>>>>>>>>>>>>>>>>\\n>>>>>>>>>>>>>>>>>>>]>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>+++++++++++++++[[>>>>>>>>\\n>]<<<<<<<<<-<<<<<<<<<[<<<<<<<<<]>>>>>>>>>-]+>>>>>>>>>>>>>>>>>>>>>+<<<[<<<<<<<<<]\\n>>>>>>>>>[>>>[-<<<->>>]+<<<[->>>->[-<<<<+>>>>]<<<<[->>>>+<<<<<<<<<<<<<[<<<<<<<<<\\n]>>>>[-]+>>>>>[>>>>>>>>>]>+<]]+>>>>[-<<<<->>>>]+<<<<[->>>>-<[-<<<+>>>]<<<[->>>+<\\n<<<<<<<<<<<[<<<<<<<<<]>>>[-]+>>>>>>[>>>>>>>>>]>[-]+<]]+>[-<[>>>>>>>>>]<<<<<<<<]>\\n>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>->>[-<<<<+>>>>]<<<<[->>>>+<<[-]<<]>>]<<+>>>>[-<<<<\\n->>>>]+<<<<[->>>>-<<<<<<.>>]>>>>[-<<<<<<<.>>>>>>>]<<<[-]>[-]>[-]>[-]>[-]>[-]>>>[\\n>[-]>[-]>[-]>[-]>[-]>[-]>>>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>>[>>>>>[-]>>>>]<<<<<<<<<\\n[<<<<<<<<<]>+++++++++++[-[->>>>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>+>>>>>>>>>+<<<<<<<<\\n<<<<<<[<<<<<<<<<]>>>>>>>[-<<<<<<<+>>>>>>>]<<<<<<<[->>>>>>>+[-]>>[>>>>>>>>>]<<<<<\\n<<<<[>>>>>>>[-<<<<<<+>>>>>>]<<<<<<[->>>>>>+<<<<<<<[<<<<<<<<<]>>>>>>>[-]+>>>]<<<<\\n<<<<<<]]>>>>>>>[-<<<<<<<+>>>>>>>]<<<<<<<[->>>>>>>+>>[>+>>>>[-<<<<->>>>]<<<<[->>>\\n>+<<<<]>>>>>>>>]<<+<<<<<<<[>>>>>[->>+<<]<<<<<<<<<<<<<<]>>>>>>>>>[>>>>>>>>>]<<<<<\\n<<<<[>[-]<->>>>>>>[-<<<<<<<+>[<->-<<<+>>>]<[->+<]>>>>>>>]<<<<<<[->>>>>>+<<<<<<]<\\n+<<<<<<<<<]>>>>>>>-<<<<[-]+<<<]+>>>>>>>[-<<<<<<<->>>>>>>]+<<<<<<<[->>>>>>>->>[>>\\n>>>[->>+<<]>>>>]<<<<<<<<<[>[-]<->>>>>>>[-<<<<<<<+>[<->-<<<+>>>]<[->+<]>>>>>>>]<<\\n<<<<[->>>>>>+<<<<<<]<+<<<<<<<<<]>+++++[-[->>>>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>+<<<\\n<<[<<<<<<<<<]>>>>>>>>>[>>>>>[-<<<<<->>>>>]+<<<<<[->>>>>->>[-<<<<<<<+>>>>>>>]<<<<\\n<<<[->>>>>>>+<<<<<<<<<<<<<<<<[<<<<<<<<<]>>>>[-]+>>>>>[>>>>>>>>>]>+<]]+>>>>>>>[-<\\n<<<<<<->>>>>>>]+<<<<<<<[->>>>>>>-<<[-<<<<<+>>>>>]<<<<<[->>>>>+<<<<<<<<<<<<<<[<<<\\n<<<<<<]>>>[-]+>>>>>>[>>>>>>>>>]>[-]+<]]+>[-<[>>>>>>>>>]<<<<<<<<]>>>>>>>>]<<<<<<<\\n<<[<<<<<<<<<]>>>>[-]<<<+++++[-[->>>>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>-<<<<<[<<<<<<<\\n<<]]>>>]<<<<.>>>>>>>>>>[>>>>>>[-]>>>]<<<<<<<<<[<<<<<<<<<]>++++++++++[-[->>>>>>>>\\n>+<<<<<<<<<]>>>>>>>>>]>>>>>+>>>>>>>>>+<<<<<<<<<<<<<<<[<<<<<<<<<]>>>>>>>>[-<<<<<<\\n<<+>>>>>>>>]<<<<<<<<[->>>>>>>>+[-]>[>>>>>>>>>]<<<<<<<<<[>>>>>>>>[-<<<<<<<+>>>>>>\\n>]<<<<<<<[->>>>>>>+<<<<<<<<[<<<<<<<<<]>>>>>>>>[-]+>>]<<<<<<<<<<]]>>>>>>>>[-<<<<<\\n<<<+>>>>>>>>]<<<<<<<<[->>>>>>>>+>[>+>>>>>[-<<<<<->>>>>]<<<<<[->>>>>+<<<<<]>>>>>>\\n>>]<+<<<<<<<<[>>>>>>[->>+<<]<<<<<<<<<<<<<<<]>>>>>>>>>[>>>>>>>>>]<<<<<<<<<[>[-]<-\\n>>>>>>>>[-<<<<<<<<+>[<->-<<+>>]<[->+<]>>>>>>>>]<<<<<<<[->>>>>>>+<<<<<<<]<+<<<<<<\\n<<<]>>>>>>>>-<<<<<[-]+<<<]+>>>>>>>>[-<<<<<<<<->>>>>>>>]+<<<<<<<<[->>>>>>>>->[>>>\\n>>>[->>+<<]>>>]<<<<<<<<<[>[-]<->>>>>>>>[-<<<<<<<<+>[<->-<<+>>]<[->+<]>>>>>>>>]<<\\n<<<<<[->>>>>>>+<<<<<<<]<+<<<<<<<<<]>+++++[-[->>>>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>>\\n+>>>>>>>>>>>>>>>>>>>>>>>>>>>+<<<<<<[<<<<<<<<<]>>>>>>>>>[>>>>>>[-<<<<<<->>>>>>]+<\\n<<<<<[->>>>>>->>[-<<<<<<<<+>>>>>>>>]<<<<<<<<[->>>>>>>>+<<<<<<<<<<<<<<<<<[<<<<<<<\\n<<]>>>>[-]+>>>>>[>>>>>>>>>]>+<]]+>>>>>>>>[-<<<<<<<<->>>>>>>>]+<<<<<<<<[->>>>>>>>\\n-<<[-<<<<<<+>>>>>>]<<<<<<[->>>>>>+<<<<<<<<<<<<<<<[<<<<<<<<<]>>>[-]+>>>>>>[>>>>>>\\n>>>]>[-]+<]]+>[-<[>>>>>>>>>]<<<<<<<<]>>>>>>>>]<<<<<<<<<[<<<<<<<<<]>>>>[-]<<<++++\\n+[-[->>>>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>>->>>>>>>>>>>>>>>>>>>>>>>>>>>-<<<<<<[<<<<\\n<<<<<]]>>>]\\n\",\n \"language\": \"Brainf---\"\n },\n {\n \"code\": \" /*\\n c program:\\n --------------------------------\\n 1. draws Mandelbrot set for Fc(z)=z*z +c\\n using Mandelbrot algorithm ( boolean escape time )\\n -------------------------------\\n 2. technique of creating ppm file is based on the code of Claudio Rocchini\\n http://en.wikipedia.org/wiki/Image:Color_complex_plot.jpg\\n create 24 bit color graphic file , portable pixmap file = PPM\\n see http://en.wikipedia.org/wiki/Portable_pixmap\\n to see the file use external application ( graphic viewer)\\n */\\n #include <stdio.h>\\n #include <math.h>\\n int main()\\n {\\n /* screen ( integer) coordinate */\\n int iX,iY;\\n const int iXmax = 800;\\n const int iYmax = 800;\\n /* world ( double) coordinate = parameter plane*/\\n double Cx,Cy;\\n const double CxMin=-2.5;\\n const double CxMax=1.5;\\n const double CyMin=-2.0;\\n const double CyMax=2.0;\\n /* */\\n double PixelWidth=(CxMax-CxMin)/iXmax;\\n double PixelHeight=(CyMax-CyMin)/iYmax;\\n /* color component ( R or G or B) is coded from 0 to 255 */\\n /* it is 24 bit color RGB file */\\n const int MaxColorComponentValue=255;\\n FILE * fp;\\n char *filename=\\\"new1.ppm\\\";\\n char *comment=\\\"# \\\";/* comment should start with # */\\n static unsigned char color[3];\\n /* Z=Zx+Zy*i ; Z0 = 0 */\\n double Zx, Zy;\\n double Zx2, Zy2; /* Zx2=Zx*Zx; Zy2=Zy*Zy */\\n /* */\\n int Iteration;\\n const int IterationMax=200;\\n /* bail-out value , radius of circle ; */\\n const double EscapeRadius=2;\\n double ER2=EscapeRadius*EscapeRadius;\\n /*create new file,give it a name and open it in binary mode */\\n fp= fopen(filename,\\\"wb\\\"); /* b - binary mode */\\n /*write ASCII header to the file*/\\n fprintf(fp,\\\"P6\\\\n %s\\\\n %d\\\\n %d\\\\n %d\\\\n\\\",comment,iXmax,iYmax,MaxColorComponentValue);\\n /* compute and write image data bytes to the file*/\\n for(iY=0;iY<iYmax;iY++)\\n {\\n Cy=CyMin + iY*PixelHeight;\\n if (fabs(Cy)< PixelHeight/2) Cy=0.0; /* Main antenna */\\n for(iX=0;iX<iXmax;iX++)\\n {\\n Cx=CxMin + iX*PixelWidth;\\n /* initial value of orbit = critical point Z= 0 */\\n Zx=0.0;\\n Zy=0.0;\\n Zx2=Zx*Zx;\\n Zy2=Zy*Zy;\\n /* */\\n for (Iteration=0;Iteration<IterationMax && ((Zx2+Zy2)<ER2);Iteration++)\\n {\\n Zy=2*Zx*Zy + Cy;\\n Zx=Zx2-Zy2 +Cx;\\n Zx2=Zx*Zx;\\n Zy2=Zy*Zy;\\n };\\n /* compute pixel color (24 bit = 3 bytes) */\\n if (Iteration==IterationMax)\\n { /* interior of Mandelbrot set = black */\\n color[0]=0;\\n color[1]=0;\\n color[2]=0;\\n }\\n else\\n { /* exterior of Mandelbrot set = white */\\n color[0]=255; /* Red*/\\n color[1]=255; /* Green */\\n color[2]=255;/* Blue */\\n };\\n /*write color to the file*/\\n fwrite(color,1,3,fp);\\n }\\n }\\n fclose(fp);\\n return 0;\\n }\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <math.h>\\n#include <GL/glut.h>\\n#include <GL/gl.h>\\n#include <GL/glu.h>\\n\\nvoid set_texture();\\n\\ntypedef struct {unsigned char r, g, b;} rgb_t;\\nrgb_t **tex = 0;\\nint gwin;\\nGLuint texture;\\nint width, height;\\nint tex_w, tex_h;\\ndouble scale = 1./256;\\ndouble cx = -.6, cy = 0;\\nint color_rotate = 0;\\nint saturation = 1;\\nint invert = 0;\\nint max_iter = 256;\\n\\nvoid render()\\n{\\n\\tdouble\\tx = (double)width /tex_w,\\n\\t\\ty = (double)height/tex_h;\\n\\n\\tglClear(GL_COLOR_BUFFER_BIT);\\n\\tglTexEnvi(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_REPLACE);\\n\\n\\tglBindTexture(GL_TEXTURE_2D, texture);\\n\\n\\tglBegin(GL_QUADS);\\n\\n\\tglTexCoord2f(0, 0); glVertex2i(0, 0);\\n\\tglTexCoord2f(x, 0); glVertex2i(width, 0);\\n\\tglTexCoord2f(x, y); glVertex2i(width, height);\\n\\tglTexCoord2f(0, y); glVertex2i(0, height);\\n\\n\\tglEnd();\\n\\n\\tglFlush();\\n\\tglFinish();\\n}\\n\\nint dump = 1;\\nvoid screen_dump()\\n{\\n\\tchar fn[100];\\n\\tint i;\\n\\tsprintf(fn, \\\"screen%03d.ppm\\\", dump++);\\n\\tFILE *fp = fopen(fn, \\\"w\\\");\\n\\tfprintf(fp, \\\"P6\\\\n%d %d\\\\n255\\\\n\\\", width, height);\\n\\tfor (i = height - 1; i >= 0; i--)\\n\\t\\tfwrite(tex[i], 1, width * 3, fp);\\n\\tfclose(fp);\\n\\tprintf(\\\"%s written\\\\n\\\", fn);\\n}\\n\\nvoid keypress(unsigned char key, int x, int y)\\n{\\n\\tswitch(key) {\\n\\tcase 'q':\\tglFinish();\\n\\t\\t\\tglutDestroyWindow(gwin);\\n\\t\\t\\treturn;\\n\\tcase 27:\\tscale = 1./256; cx = -.6; cy = 0; break;\\n\\n\\tcase 'r':\\tcolor_rotate = (color_rotate + 1) % 6;\\n\\t\\t\\tbreak;\\n\\n\\tcase '>': case '.':\\n\\t\\t\\tmax_iter += 128;\\n\\t\\t\\tif (max_iter > 1 << 15) max_iter = 1 << 15;\\n\\t\\t\\tprintf(\\\"max iter: %d\\\\n\\\", max_iter);\\n\\t\\t\\tbreak;\\n\\n\\tcase '<': case ',':\\n\\t\\t\\tmax_iter -= 128;\\n\\t\\t\\tif (max_iter < 128) max_iter = 128;\\n\\t\\t\\tprintf(\\\"max iter: %d\\\\n\\\", max_iter);\\n\\t\\t\\tbreak;\\n\\n\\tcase 'c':\\tsaturation = 1 - saturation;\\n\\t\\t\\tbreak;\\n\\n\\tcase 's':\\tscreen_dump(); return;\\n\\tcase 'z':\\tmax_iter = 4096; break;\\n\\tcase 'x':\\tmax_iter = 128; break;\\n\\tcase ' ':\\tinvert = !invert;\\n\\t}\\n\\tset_texture();\\n}\\n\\nvoid hsv_to_rgb(int hue, int min, int max, rgb_t *p)\\n{\\n\\tif (min == max) max = min + 1;\\n\\tif (invert) hue = max - (hue - min);\\n\\tif (!saturation) {\\n\\t\\tp->r = p->g = p->b = 255 * (max - hue) / (max - min);\\n\\t\\treturn;\\n\\t}\\n\\tdouble h = fmod(color_rotate + 1e-4 + 4.0 * (hue - min) / (max - min), 6);\\n#\\tdefine VAL 255\\n\\tdouble c = VAL * saturation;\\n\\tdouble X = c * (1 - fabs(fmod(h, 2) - 1));\\n\\n\\tp->r = p->g = p->b = 0;\\n\\n\\tswitch((int)h) {\\n\\tcase 0: p->r = c; p->g = X; return;\\n\\tcase 1:\\tp->r = X; p->g = c; return;\\n\\tcase 2: p->g = c; p->b = X; return;\\n\\tcase 3: p->g = X; p->b = c; return;\\n\\tcase 4: p->r = X; p->b = c; return;\\n\\tdefault:p->r = c; p->b = X;\\n\\t}\\n}\\n\\nvoid calc_mandel()\\n{\\n\\tint i, j, iter, min, max;\\n\\trgb_t *px;\\n\\tdouble x, y, zx, zy, zx2, zy2;\\n\\tmin = max_iter; max = 0;\\n\\tfor (i = 0; i < height; i++) {\\n\\t\\tpx = tex[i];\\n\\t\\ty = (i - height/2) * scale + cy;\\n\\t\\tfor (j = 0; j < width; j++, px++) {\\n\\t\\t\\tx = (j - width/2) * scale + cx;\\n\\t\\t\\titer = 0;\\n\\n\\t\\t\\tzx = hypot(x - .25, y);\\n\\t\\t\\tif (x < zx - 2 * zx * zx + .25) iter = max_iter;\\n\\t\\t\\tif ((x + 1)*(x + 1) + y * y < 1/16) iter = max_iter;\\n\\n\\t\\t\\tzx = zy = zx2 = zy2 = 0;\\n\\t\\t\\tfor (; iter < max_iter && zx2 + zy2 < 4; iter++) {\\n\\t\\t\\t\\tzy = 2 * zx * zy + y;\\n\\t\\t\\t\\tzx = zx2 - zy2 + x;\\n\\t\\t\\t\\tzx2 = zx * zx;\\n\\t\\t\\t\\tzy2 = zy * zy;\\n\\t\\t\\t}\\n\\t\\t\\tif (iter < min) min = iter;\\n\\t\\t\\tif (iter > max) max = iter;\\n\\t\\t\\t*(unsigned short *)px = iter;\\n\\t\\t}\\n\\t}\\n\\n\\tfor (i = 0; i < height; i++)\\n\\t\\tfor (j = 0, px = tex[i]; j < width; j++, px++)\\n\\t\\t\\thsv_to_rgb(*(unsigned short*)px, min, max, px);\\n}\\n\\nvoid alloc_tex()\\n{\\n\\tint i, ow = tex_w, oh = tex_h;\\n\\n\\tfor (tex_w = 1; tex_w < width; tex_w <<= 1);\\n\\tfor (tex_h = 1; tex_h < height; tex_h <<= 1);\\n\\n\\tif (tex_h != oh || tex_w != ow)\\n\\t\\ttex = realloc(tex, tex_h * tex_w * 3 + tex_h * sizeof(rgb_t*));\\n\\n\\tfor (tex[0] = (rgb_t *)(tex + tex_h), i = 1; i < tex_h; i++)\\n\\t\\ttex[i] = tex[i - 1] + tex_w;\\n}\\n\\nvoid set_texture()\\n{\\n\\talloc_tex();\\n\\tcalc_mandel();\\n\\n\\tglEnable(GL_TEXTURE_2D);\\n\\tglBindTexture(GL_TEXTURE_2D, texture);\\n\\tglTexImage2D(GL_TEXTURE_2D, 0, 3, tex_w, tex_h,\\n\\t\\t0, GL_RGB, GL_UNSIGNED_BYTE, tex[0]);\\n\\n\\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\\n\\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\\n\\trender();\\n}\\n\\nvoid mouseclick(int button, int state, int x, int y)\\n{\\n\\tif (state != GLUT_UP) return;\\n\\n\\tcx += (x - width / 2) * scale;\\n\\tcy -= (y - height/ 2) * scale;\\n\\n\\tswitch(button) {\\n\\tcase GLUT_LEFT_BUTTON: /* zoom in */\\n\\t\\tif (scale > fabs(x) * 1e-16 && scale > fabs(y) * 1e-16)\\n\\t\\t\\tscale /= 2;\\n\\t\\tbreak;\\n\\tcase GLUT_RIGHT_BUTTON: /* zoom out */\\n\\t\\tscale *= 2;\\n\\t\\tbreak;\\n\\t/* any other button recenters */\\n\\t}\\n\\tset_texture();\\n}\\n\\n\\nvoid resize(int w, int h)\\n{\\n\\tprintf(\\\"resize %d %d\\\\n\\\", w, h);\\n\\twidth = w;\\n\\theight = h;\\n\\n\\tglViewport(0, 0, w, h);\\n\\tglOrtho(0, w, 0, h, -1, 1);\\n\\n\\tset_texture();\\n}\\n\\nvoid init_gfx(int *c, char **v)\\n{\\n\\tglutInit(c, v);\\n\\tglutInitDisplayMode(GLUT_RGB);\\n\\tglutInitWindowSize(640, 480);\\n\\t\\n\\tgwin = glutCreateWindow(\\\"Mandelbrot\\\");\\n\\tglutDisplayFunc(render);\\n\\n\\tglutKeyboardFunc(keypress);\\n\\tglutMouseFunc(mouseclick);\\n\\tglutReshapeFunc(resize);\\n\\tglGenTextures(1, &texture);\\n\\tset_texture();\\n}\\n\\nint main(int c, char **v)\\n{\\n\\tinit_gfx(&c, v);\\n\\tprintf(\\\"keys:\\\\n\\\\tr: color rotation\\\\n\\\\tc: monochrome\\\\n\\\\ts: screen dump\\\\n\\\\t\\\"\\n\\t\\t\\\"<, >: decrease/increase max iteration\\\\n\\\\tq: quit\\\\n\\\\tmouse buttons to zoom\\\\n\\\");\\n\\n\\tglutMainLoop();\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <math.h>\\n#include <GL/glut.h>\\n#include <GL/gl.h>\\n#include <GL/glu.h>\\n\\nvoid set_texture();\\n\\nunsigned char *tex;\\nint gwin;\\nGLuint texture;\\nint width, height;\\nint old_width, old_height;\\ndouble scale = 1. / 256;\\ndouble cx = -.6, cy = 0;\\nint color_rotate = 0;\\nint saturation = 1;\\nint invert = 0;\\nint max_iter = 256;\\n\\nvoid render()\\n{\\n glTexEnvi(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_REPLACE);\\n\\n glBindTexture(GL_TEXTURE_2D, texture);\\n\\n glBegin(GL_QUADS);\\n\\n glTexCoord2d(0, 0);\\n glVertex2i(0, 0);\\n glTexCoord2d(1, 0);\\n glVertex2i(width, 0);\\n glTexCoord2d(1, 1);\\n glVertex2i(width, height);\\n glTexCoord2d(0, 1);\\n glVertex2i(0, height);\\n\\n glEnd();\\n\\n glFlush();\\n glFinish();\\n}\\n\\nint dump = 1;\\nvoid screen_dump()\\n{\\n char fn[100];\\n sprintf(fn, \\\"screen%03d.ppm\\\", dump++);\\n FILE *fp = fopen(fn, \\\"w\\\");\\n fprintf(fp, \\\"P6\\\\n%d %d\\\\n255\\\\n\\\", width, height);\\n for (int i = height - 1; i >= 0; i -= 1) {\\n for (int j = 0; j < width; j += 1) {\\n fwrite(&tex[((i * width) + j) * 4], 1, 3, fp);\\n }\\n }\\n fclose(fp);\\n printf(\\\"%s written\\\\n\\\", fn);\\n}\\n\\nvoid keypress(unsigned char key,[[maybe_unused]]\\n int x,[[maybe_unused]]\\n int y)\\n{\\n switch (key) {\\n case 'q':\\n glFinish();\\n glutDestroyWindow(gwin);\\n break;\\n\\n case 27:\\n scale = 1. / 256;\\n cx = -.6;\\n cy = 0;\\n set_texture();\\n break;\\n\\n case 'r':\\n color_rotate = (color_rotate + 1) % 6;\\n set_texture();\\n break;\\n\\n case '>':\\n case '.':\\n max_iter += 128;\\n if (max_iter > 1 << 15)\\n max_iter = 1 << 15;\\n printf(\\\"max iter: %d\\\\n\\\", max_iter);\\n set_texture();\\n break;\\n\\n case '<':\\n case ',':\\n max_iter -= 128;\\n if (max_iter < 128)\\n max_iter = 128;\\n printf(\\\"max iter: %d\\\\n\\\", max_iter);\\n set_texture();\\n break;\\n\\n case 'c':\\n saturation = 1 - saturation;\\n set_texture();\\n break;\\n\\n case 's':\\n screen_dump();\\n break;\\n\\n case 'z':\\n max_iter = 4096;\\n set_texture();\\n break;\\n\\n case 'x':\\n max_iter = 128;\\n set_texture();\\n break;\\n\\n case ' ':\\n invert = !invert;\\n set_texture();\\n break;\\n\\n default:\\n set_texture();\\n break;\\n }\\n}\\n\\n#define VAL 255\\n\\nvoid hsv_to_rgba(int hue, int min, int max, unsigned char *px)\\n{\\n unsigned char r;\\n unsigned char g;\\n unsigned char b;\\n\\n if (min == max)\\n max = min + 1;\\n if (invert)\\n hue = max - (hue - min);\\n if (!saturation) {\\n r = 255 * (max - hue) / (max - min);\\n g = r;\\n b = r;\\n } else {\\n double h =\\n fmod(color_rotate + 1e-4 + 4.0 * (hue - min) / (max - min), 6);\\n double c = VAL * saturation;\\n double X = c * (1 - fabs(fmod(h, 2) - 1));\\n\\n r = 0;\\n g = 0;\\n b = 0;\\n\\n switch ((int) h) {\\n case 0:\\n r = c;\\n g = X;\\n break;\\n case 1:\\n r = X;\\n g = c;\\n break;\\n case 2:\\n g = c;\\n b = X;\\n break;\\n case 3:\\n g = X;\\n b = c;\\n break;\\n case 4:\\n r = X;\\n b = c;\\n break;\\n default:\\n r = c;\\n b = X;\\n break;\\n }\\n }\\n\\n /* Using an alpha channel neatly solves the problem of aligning\\n * rows on 4-byte boundaries (at the expense of memory, of\\n * course). */\\n px[0] = r;\\n px[1] = g;\\n px[2] = b;\\n px[3] = 255; /* Alpha channel. */\\n}\\n\\nvoid calc_mandel()\\n{\\n int i, j, iter, min, max;\\n double x, y, zx, zy, zx2, zy2;\\n unsigned short *hsv = malloc(width * height * sizeof(unsigned short));\\n\\n min = max_iter;\\n max = 0;\\n for (i = 0; i < height; i++) {\\n y = (i - height / 2) * scale + cy;\\n for (j = 0; j < width; j++) {\\n x = (j - width / 2) * scale + cx;\\n iter = 0;\\n\\n zx = hypot(x - .25, y);\\n if (x < zx - 2 * zx * zx + .25)\\n iter = max_iter;\\n if ((x + 1) * (x + 1) + y * y < 1 / 16)\\n iter = max_iter;\\n\\n zx = 0;\\n zy = 0;\\n zx2 = 0;\\n zy2 = 0;\\n while (iter < max_iter && zx2 + zy2 < 4) {\\n zy = 2 * zx * zy + y;\\n zx = zx2 - zy2 + x;\\n zx2 = zx * zx;\\n zy2 = zy * zy;\\n iter += 1;\\n }\\n if (iter < min)\\n min = iter;\\n if (iter > max)\\n max = iter;\\n hsv[(i * width) + j] = iter;\\n }\\n }\\n\\n for (i = 0; i < height; i += 1) {\\n for (j = 0; j < width; j += 1) {\\n unsigned char *px = tex + (((i * width) + j) * 4);\\n hsv_to_rgba(hsv[(i * width) + j], min, max, px);\\n }\\n }\\n\\n free(hsv);\\n}\\n\\nvoid alloc_tex()\\n{\\n if (tex == NULL || width != old_width || height != old_height) {\\n free(tex);\\n tex = malloc(height * width * 4 * sizeof(unsigned char));\\n memset(tex, 0, height * width * 4 * sizeof(unsigned char));\\n old_width = width;\\n old_height = height;\\n }\\n}\\n\\nvoid set_texture()\\n{\\n alloc_tex();\\n calc_mandel();\\n\\n glEnable(GL_TEXTURE_2D);\\n glBindTexture(GL_TEXTURE_2D, texture);\\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, width, height,\\n 0, GL_RGBA, GL_UNSIGNED_BYTE, tex);\\n\\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\\n\\n render();\\n}\\n\\nvoid mouseclick(int button, int state, int x, int y)\\n{\\n if (state != GLUT_UP)\\n return;\\n\\n cx += (x - width / 2) * scale;\\n cy -= (y - height / 2) * scale;\\n\\n switch (button) {\\n case GLUT_LEFT_BUTTON: /* zoom in */\\n if (scale > fabs((double) x) * 1e-16\\n && scale > fabs((double) y) * 1e-16)\\n scale /= 2;\\n break;\\n case GLUT_RIGHT_BUTTON: /* zoom out */\\n scale *= 2;\\n break;\\n /* any other button recenters */\\n }\\n set_texture();\\n}\\n\\n\\nvoid resize(int w, int h)\\n{\\n printf(\\\"resize %d %d\\\\n\\\", w, h);\\n\\n width = w;\\n height = h;\\n\\n glViewport(0, 0, w, h);\\n glOrtho(0, w, 0, h, -1, 1);\\n\\n set_texture();\\n}\\n\\nvoid init_gfx(int *c, char **v)\\n{\\n glutInit(c, v);\\n glutInitDisplayMode(GLUT_RGBA);\\n glutInitWindowSize(640, 480);\\n\\n gwin = glutCreateWindow(\\\"Mandelbrot\\\");\\n glutDisplayFunc(render);\\n\\n glutKeyboardFunc(keypress);\\n glutMouseFunc(mouseclick);\\n glutReshapeFunc(resize);\\n glGenTextures(1, &texture);\\n set_texture();\\n}\\n\\nint main(int c, char **v)\\n{\\n tex = NULL;\\n\\n init_gfx(&c, v);\\n printf\\n (\\\"keys:\\\\n\\\\tr: color rotation\\\\n\\\\tc: monochrome\\\\n\\\\ts: screen dump\\\\n\\\\t\\\"\\n \\\"<, >: decrease/increase max iteration\\\\n\\\\tq: quit\\\\n\\\\tmouse buttons to zoom\\\\n\\\");\\n\\n glutMainLoop();\\n return 0;\\n}\\n\\n// local variables:\\n// mode: C\\n// c-file-style: \\\"k&r\\\"\\n// c-basic-offset: 4\\n// end:\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"main(k){float i,j,r,x,y=-16;while(puts(\\\"\\\"),y++<15)for(x\\n=0;x++<84;putchar(\\\" .:-;!/>)|&IH%*#\\\"[k&15]))for(i=k=r=0;\\nj=r*r-i*i-2+x/25,i=2*r*i+y/10,j*j+i*i<11&&k++<111;r=j);}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"/**\\n ascii Mandelbrot using 16 bits of fixed point integer maths with a selectable fractional precision in bits.\\n\\n This is still only 16 bits mathc and allocating more than 6 bits of fractional precision leads to an overflow that adds noise to the plot..\\n\\n This code frequently casts to short to ensure we're not accidentally benefitting from GCC promotion from short 16 bits to int.\\n\\n gcc fixedPoint.c -lm\\n\\n */\\n\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <math.h>\\n#include <stdint.h>\\n#include <string.h>\\n\\nshort s(short i);\\nshort toPrec(double f, int bitsPrecision);\\n\\nint main(int argc, char* argv[])\\n{\\n // chosen to match https://www.youtube.com/watch?v=DC5wi6iv9io\\n int width = 32; // basic width of a zx81\\n int height = 22; // basic width of a zx81\\n int zoom=3; // bigger with finer detail ie a smaller step size - leave at 1 for 32x22\\n\\n // params\\n short bitsPrecision = 6;\\n printf(\\\"PRECISION=%d\\\\n\\\", bitsPrecision);\\n\\n short X1 = toPrec(3.5,bitsPrecision) / zoom;\\n short X2 = toPrec(2.25,bitsPrecision) ;\\n short Y1 = toPrec(3,bitsPrecision)/zoom ; // horiz pos\\n short Y2 = toPrec(1.5,bitsPrecision) ; // vert pos\\n short LIMIT = toPrec(4,bitsPrecision);\\n\\n\\n // fractal\\n //char * chr = \\\".:-=X$#@.\\\";\\n char * chr = \\\"abcdefghijklmnopqr \\\";\\n //char * chr = \\\".,'~=+:;[/<&?oxOX#.\\\";\\n short maxIters = strlen(chr);\\n\\n short py=0;\\n while (py < height*zoom) {\\n short px=0;\\n while (px < width*zoom) {\\n\\n short x0 = s(s(px*X1) / width) - X2;\\n short y0 = s(s(py*Y1) / height) - Y2;\\n\\n short x=0;\\n short y=0;\\n\\n short i=0;\\n\\n short xSqr;\\n short ySqr;\\n while (i < maxIters) {\\n xSqr = s(x * x) >> bitsPrecision;\\n ySqr = s(y * y) >> bitsPrecision;\\n\\n // Breakout if sum is > the limit OR breakout also if sum is negative which indicates overflow of the addition has occurred\\n // The overflow check is only needed for precisions of over 6 bits because for 7 and above the sums come out overflowed and negative therefore we always run to maxIters and we see nothing.\\n // By including the overflow break out we can see the fractal again though with noise.\\n if ((xSqr + ySqr) >= LIMIT || (xSqr+ySqr) < 0) {\\n break;\\n }\\n\\n short xt = xSqr - ySqr + x0;\\n y = s(s(s(x * y) >> bitsPrecision) * 2) + y0;\\n x=xt;\\n\\n i = i + 1;\\n }\\n i = i - 1;\\n\\n printf(\\\"%c\\\", chr[i]);\\n\\n px = px + 1;\\n }\\n\\n printf(\\\"\\\\n\\\");\\n py = py + 1;\\n }\\n}\\n\\n// convert decimal value to a fixed point value in the given precision\\nshort toPrec(double f, int bitsPrecision) {\\n short whole = ((short)floor(f) << (bitsPrecision));\\n short part = (f-floor(f))*(pow(2,bitsPrecision));\\n short ret = whole + part;\\n return ret;\\n}\\n\\n// convenient casting\\nshort s(short i) {\\n return i;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <cstdlib>\\n#include <complex>\\n\\n// get dimensions for arrays\\ntemplate<typename ElementType, std::size_t dim1, std::size_t dim2>\\n std::size_t get_first_dimension(ElementType (&a)[dim1][dim2])\\n{\\n return dim1;\\n}\\n\\ntemplate<typename ElementType, std::size_t dim1, std::size_t dim2>\\n std::size_t get_second_dimension(ElementType (&a)[dim1][dim2])\\n{\\n return dim2;\\n}\\n\\n\\ntemplate<typename ColorType, typename ImageType>\\n void draw_Mandelbrot(ImageType& image, //where to draw the image\\n ColorType set_color, ColorType non_set_color, //which colors to use for set/non-set points\\n double cxmin, double cxmax, double cymin, double cymax,//the rect to draw in the complex plane\\n unsigned int max_iterations) //the maximum number of iterations\\n{\\n std::size_t const ixsize = get_first_dimension(image);\\n std::size_t const iysize = get_first_dimension(image);\\n for (std::size_t ix = 0; ix < ixsize; ++ix)\\n for (std::size_t iy = 0; iy < iysize; ++iy)\\n {\\n std::complex<double> c(cxmin + ix/(ixsize-1.0)*(cxmax-cxmin), cymin + iy/(iysize-1.0)*(cymax-cymin));\\n std::complex<double> z = 0;\\n unsigned int iterations;\\n\\n for (iterations = 0; iterations < max_iterations && std::abs(z) < 2.0; ++iterations)\\n z = z*z + c;\\n\\n image[ix][iy] = (iterations == max_iterations) ? set_color : non_set_color;\\n\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nint f(float X, float Y, float x, float y, int n){\\nreturn (x*x+y*y<4 && n<100)?1+f(X, Y, x*x-y*y+X, 2*x*y+Y, n+1):0;\\n}\\n\\nmain(){\\nfor(float j=1; j>=-1; j-=.015)\\nfor(float i=-2, x; i<=.5; i+=.015, x=f(i, j, 0, 0, 0))\\nprintf(\\\"%c%s\\\", x<10?' ':x<20?'.':x<50?':':x<80?'*':'#', i>-2?\\\" \\\":\\\"\\\\n\\\");\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Drawing;\\nusing System.Drawing.Imaging;\\nusing System.Threading;\\nusing System.Windows.Forms;\\n\\n/// <summary>\\n/// Generates bitmap of Mandelbrot Set and display it on the form.\\n/// </summary>\\npublic class MandelbrotSetForm : Form\\n{\\n const double MaxValueExtent = 2.0;\\n Thread thread;\\n\\n static double CalcMandelbrotSetColor(ComplexNumber c)\\n {\\n // from http://en.wikipedia.org/w/index.php?title=Mandelbrot_set\\n const int MaxIterations = 1000;\\n const double MaxNorm = MaxValueExtent * MaxValueExtent;\\n\\n int iteration = 0;\\n ComplexNumber z = new ComplexNumber();\\n do\\n {\\n z = z * z + c;\\n iteration++;\\n } while (z.Norm() < MaxNorm && iteration < MaxIterations);\\n if (iteration < MaxIterations)\\n return (double)iteration / MaxIterations;\\n else\\n return 0; // black\\n }\\n\\n static void GenerateBitmap(Bitmap bitmap)\\n {\\n double scale = 2 * MaxValueExtent / Math.Min(bitmap.Width, bitmap.Height);\\n for (int i = 0; i < bitmap.Height; i++)\\n {\\n double y = (bitmap.Height / 2 - i) * scale;\\n for (int j = 0; j < bitmap.Width; j++)\\n {\\n double x = (j - bitmap.Width / 2) * scale;\\n double color = CalcMandelbrotSetColor(new ComplexNumber(x, y));\\n bitmap.SetPixel(j, i, GetColor(color));\\n }\\n }\\n }\\n\\n static Color GetColor(double value)\\n {\\n const double MaxColor = 256;\\n const double ContrastValue = 0.2;\\n return Color.FromArgb(0, 0,\\n (int)(MaxColor * Math.Pow(value, ContrastValue)));\\n }\\n\\n public MandelbrotSetForm()\\n {\\n // form creation\\n this.Text = \\\"Mandelbrot Set Drawing\\\";\\n this.BackColor = System.Drawing.Color.Black;\\n this.BackgroundImageLayout = System.Windows.Forms.ImageLayout.Stretch;\\n this.MaximizeBox = false;\\n this.StartPosition = FormStartPosition.CenterScreen;\\n this.FormBorderStyle = FormBorderStyle.FixedDialog;\\n this.ClientSize = new Size(640, 640);\\n this.Load += new System.EventHandler(this.MainForm_Load);\\n }\\n\\n void MainForm_Load(object sender, EventArgs e)\\n {\\n thread = new Thread(thread_Proc);\\n thread.IsBackground = true;\\n thread.Start(this.ClientSize);\\n }\\n\\n void thread_Proc(object args)\\n {\\n // start from small image to provide instant display for user\\n Size size = (Size)args;\\n int width = 16;\\n while (width * 2 < size.Width)\\n {\\n int height = width * size.Height / size.Width;\\n Bitmap bitmap = new Bitmap(width, height, PixelFormat.Format24bppRgb);\\n GenerateBitmap(bitmap);\\n this.BeginInvoke(new SetNewBitmapDelegate(SetNewBitmap), bitmap);\\n width *= 2;\\n Thread.Sleep(200);\\n }\\n // then generate final image\\n Bitmap finalBitmap = new Bitmap(size.Width, size.Height, PixelFormat.Format24bppRgb);\\n GenerateBitmap(finalBitmap);\\n this.BeginInvoke(new SetNewBitmapDelegate(SetNewBitmap), finalBitmap);\\n }\\n\\n void SetNewBitmap(Bitmap image)\\n {\\n if (this.BackgroundImage != null)\\n this.BackgroundImage.Dispose();\\n this.BackgroundImage = image;\\n }\\n\\n delegate void SetNewBitmapDelegate(Bitmap image);\\n\\n static void Main()\\n {\\n Application.Run(new MandelbrotSetForm());\\n }\\n}\\n\\nstruct ComplexNumber\\n{\\n public double Re;\\n public double Im;\\n\\n public ComplexNumber(double re, double im)\\n {\\n this.Re = re;\\n this.Im = im;\\n }\\n\\n public static ComplexNumber operator +(ComplexNumber x, ComplexNumber y)\\n {\\n return new ComplexNumber(x.Re + y.Re, x.Im + y.Im);\\n }\\n\\n public static ComplexNumber operator *(ComplexNumber x, ComplexNumber y)\\n {\\n return new ComplexNumber(x.Re * y.Re - x.Im * y.Im,\\n x.Re * y.Im + x.Im * y.Re);\\n }\\n\\n public double Norm()\\n {\\n return Re * Re + Im * Im;\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"module mandelbrot;\\n\\nextern fn int atoi(char *s);\\nextern fn int printf(char *s, ...);\\nextern fn void putchar(int c);\\n\\nfn void main(int argc, char **argv)\\n{\\n int w = atoi(argv[1]);\\n int h = w;\\n\\n const LIMIT = 2.0;\\n const SQUARE_LIMIT = LIMIT * LIMIT;\\n\\n printf(\\\"P4\\\\n%d %d\\\\n\\\", w, h);\\n\\n int iter = 50;\\n int bit_num = 0;\\n char byte_acc = 0;\\n for (double y = 0; y < h; y++)\\n {\\n for (double x = 0; x < w; x++)\\n {\\n double zr;\\n double zi;\\n double ti;\\n double tr;\\n double cr = (2.0 * x / w - 1.5);\\n double ci = (2.0 * y / h - 1.0);\\n for (int i = 0; i < iter && (tr + ti <= SQUARE_LIMIT); i++)\\n {\\n zi = 2.0 * zr * zi + ci;\\n zr = tr - ti + cr;\\n tr = zr * zr;\\n ti = zi * zi;\\n }\\n\\n byte_acc <<= 1;\\n if (tr + ti <= SQUARE_LIMIT) byte_acc |= 0x01;\\n\\n ++bit_num;\\n\\n if (bit_num == 8)\\n {\\n putchar(byte_acc);\\n byte_acc = 0;\\n bit_num = 0;\\n }\\n else if (x == w - 1)\\n {\\n byte_acc <<= (8 - w % 8);\\n putchar(byte_acc);\\n byte_acc = 0;\\n bit_num = 0;\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"C3\"\n },\n {\n \"code\": \"(defn complex-add\\n [[a0 b0] [a1 b1]]\\n [(+ a0 a1) (+ b0 b1)])\\n\\n(defn complex-square\\n [[a b]]\\n [(- (* a a) (* b b)) (* 2 a b)])\\n\\n(defn complex-abs\\n [[a b]]\\n (Math/sqrt (+ (* a a) (* b b))))\\n\\n(defn f\\n [z c]\\n (complex-add z (complex-square c)))\\n\\n(defn mandelbrot?\\n [z]\\n (> 2 (complex-abs (nth (iterate (partial f z) [0 0]) 20))))\\n\\n(doseq [y (range 1 -1 -0.05)]\\n (doseq [x (range -2 0.5 0.0315)]\\n (print (if (mandelbrot? [(double x) (double y)]) \\\"*\\\" \\\" \\\")))\\n (println \\\"\\\"))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"IDENTIFICATION DIVISION.\\nPROGRAM-ID. MANDELBROT-SET-PROGRAM.\\nDATA DIVISION.\\nWORKING-STORAGE SECTION.\\n01 COMPLEX-ARITHMETIC.\\n 05 X PIC S9V9(9).\\n 05 Y PIC S9V9(9).\\n 05 X-A PIC S9V9(6).\\n 05 X-B PIC S9V9(6).\\n 05 Y-A PIC S9V9(6).\\n 05 X-A-SQUARED PIC S9V9(6).\\n 05 Y-A-SQUARED PIC S9V9(6).\\n 05 SUM-OF-SQUARES PIC S9V9(6).\\n 05 ROOT PIC S9V9(6).\\n01 LOOP-COUNTERS.\\n 05 I PIC 99.\\n 05 J PIC 99.\\n 05 K PIC 999.\\n77 PLOT-CHARACTER PIC X.\\nPROCEDURE DIVISION.\\nCONTROL-PARAGRAPH.\\n PERFORM OUTER-LOOP-PARAGRAPH\\n VARYING I FROM 1 BY 1 UNTIL I IS GREATER THAN 24.\\n STOP RUN.\\nOUTER-LOOP-PARAGRAPH.\\n PERFORM INNER-LOOP-PARAGRAPH\\n VARYING J FROM 1 BY 1 UNTIL J IS GREATER THAN 64.\\n DISPLAY ''.\\nINNER-LOOP-PARAGRAPH.\\n MOVE SPACE TO PLOT-CHARACTER.\\n MOVE ZERO TO X-A.\\n MOVE ZERO TO Y-A.\\n MULTIPLY J BY 0.0390625 GIVING X.\\n SUBTRACT 1.5 FROM X.\\n MULTIPLY I BY 0.083333333 GIVING Y.\\n SUBTRACT 1 FROM Y.\\n PERFORM ITERATION-PARAGRAPH VARYING K FROM 1 BY 1\\n UNTIL K IS GREATER THAN 100 OR PLOT-CHARACTER IS EQUAL TO '#'.\\n DISPLAY PLOT-CHARACTER WITH NO ADVANCING.\\nITERATION-PARAGRAPH.\\n MULTIPLY X-A BY X-A GIVING X-A-SQUARED.\\n MULTIPLY Y-A BY Y-A GIVING Y-A-SQUARED.\\n SUBTRACT Y-A-SQUARED FROM X-A-SQUARED GIVING X-B.\\n ADD X TO X-B.\\n MULTIPLY X-A BY Y-A GIVING Y-A.\\n MULTIPLY Y-A BY 2 GIVING Y-A.\\n SUBTRACT Y FROM Y-A.\\n MOVE X-B TO X-A.\\n ADD X-A-SQUARED TO Y-A-SQUARED GIVING SUM-OF-SQUARES.\\n MOVE FUNCTION SQRT (SUM-OF-SQUARES) TO ROOT.\\n IF ROOT IS GREATER THAN 2 THEN MOVE '#' TO PLOT-CHARACTER.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"(defpackage #:mandelbrot\\n (:use #:cl))\\n\\n(in-package #:mandelbrot)\\n\\n(deftype pixel () '(unsigned-byte 8))\\n(deftype image () '(array pixel))\\n\\n(defun write-pgm (image filespec)\\n (declare (image image))\\n (with-open-file (s filespec :direction :output :element-type 'pixel :if-exists :supersede)\\n (let* ((width (array-dimension image 1))\\n (height (array-dimension image 0))\\n (header (format nil \\\"P5~A~D ~D~A255~A\\\" #\\\\Newline width height #\\\\Newline #\\\\Newline)))\\n (loop for c across header\\n do (write-byte (char-code c) s))\\n (dotimes (row height)\\n (dotimes (col width)\\n (write-byte (aref image row col) s))))))\\n\\n(defparameter *x-max* 800)\\n(defparameter *y-max* 800)\\n(defparameter *cx-min* -2.5)\\n(defparameter *cx-max* 1.5)\\n(defparameter *cy-min* -2.0)\\n(defparameter *cy-max* 2.0)\\n(defparameter *escape-radius* 2)\\n(defparameter *iteration-max* 40)\\n\\n(defun mandelbrot (filespec)\\n (let ((pixel-width (/ (- *cx-max* *cx-min*) *x-max*))\\n (pixel-height (/ (- *cy-max* *cy-min*) *y-max*))\\n (image (make-array (list *y-max* *x-max*) :element-type 'pixel :initial-element 0)))\\n (loop for y from 0 below *y-max*\\n for cy from *cy-min* by pixel-height\\n do (loop for x from 0 below *x-max*\\n for cx from *cx-min* by pixel-width\\n for iteration = (loop with c = (complex cx cy)\\n for iteration from 0 below *iteration-max*\\n for z = c then (+ (* z z) c)\\n while (< (abs z) *escape-radius*)\\n finally (return iteration))\\n for pixel = (round (* 255 (/ (- *iteration-max* iteration) *iteration-max*)))\\n do (setf (aref image y x) pixel)))\\n (write-pgm image filespec)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\nconst xmin := -8601;\\nconst xmax := 2867;\\nconst ymin := -4915;\\nconst ymax := 4915;\\nconst maxiter := 32;\\n\\nconst dx := (xmax-xmin)/79;\\nconst dy := (ymax-ymin)/24;\\n\\nvar cy: int16 := ymin;\\nwhile cy <= ymax loop\\n var cx: int16 := xmin;\\n while cx <= xmax loop\\n var x: int32 := 0;\\n var y: int32 := 0;\\n var x2: int32 := 0;\\n var y2: int32 := 0;\\n var iter: uint8 := 0;\\n\\n while iter < maxiter and x2 + y2 <= 16384 loop\\n y := ((x*y)>>11)+cy as int32;\\n x := x2-y2+cx as int32;\\n x2 := (x*x)>>12;\\n y2 := (y*y)>>12;\\n iter := iter + 1;\\n end loop;\\n\\n print_char(' ' + iter);\\n cx := cx + dx;\\n end loop;\\n print_nl();\\n cy := cy + dy;\\nend loop;\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"define max = 15, w = 640, h = 480\\ndefine py = 0, px = 0, sx = 0, sy = 0\\ndefine xx = 0, xy = 0\\n\\nbgcolor 0, 0, 0\\ncls graphics\\nfill on\\n\\ndo\\n\\n\\tlet px = 0\\n\\n\\tdo\\n\\n\\t\\tlet sy = (py - h / 2) / 150\\n\\t\\tlet sx = (px - w / 2) / 150\\n\\n\\t\\tlet i = 0\\n\\t\\tlet x = 0\\n\\t\\tlet y = 0\\n\\n\\t\\tlet xy = x * x + y * y\\n\\n\\t\\tdo\\n\\n\\t\\t\\tlet xx = x * x - y * y + sx + .1\\n\\t\\t\\tlet y = 2 * x * y + sy\\n\\t\\t\\tlet x = xx\\n\\n\\t\\t\\tlet i = i + 1\\n\\n\\t\\tloop i < max and xy < 4\\n\\n\\t\\twait\\n\\n\\t\\tfgcolor 220 + i * x, 220 + i * y, 230 + i * xy\\n\\t\\trect px, py, 4, 4\\n\\n\\t\\tlet px = px + 4\\n\\n\\tloop px < w\\n\\n\\tlet py = py + 4\\n\\nloop py < h\\n\",\n \"language\": \"Craft-Basic\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.complex;\\n\\n for (real y = -1.2; y < 1.2; y += 0.05) {\\n for (real x = -2.05; x < 0.55; x += 0.03) {\\n auto z = 0.complex;\\n foreach (_; 0 .. 100)\\n z = z ^^ 2 + complex(x, y);\\n write(z.abs < 2 ? '#' : '.');\\n }\\n writeln;\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.complex, std.range, std.algorithm;\\n\\n foreach (immutable y; iota(-1.2, 1.2, 0.05))\\n iota(-2.05, 0.55, 0.03).map!(x => 0.complex\\n .recurrence!((a, n) => a[n - 1] ^^ 2 + complex(x, y))\\n .drop(100).front.abs < 2 ? '#' : '.').writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import qd;\\n\\ndouble lensqr(cdouble c) { return c.re * c.re + c.im * c.im; }\\n\\nconst Limit = 150;\\n\\nvoid main() {\\n screen(640, 480);\\n for (int y = 0; y < screen.h; ++y) {\\n flip; events;\\n for (int x = 0; x < screen.w; ++x) {\\n auto\\n c_x = x * 1.0 / screen.w - 0.5,\\n c_y = y * 1.0 / screen.h - 0.5,\\n c = c_y * 2.0i + c_x * 3.0 - 1.0,\\n z = 0.0i + 0.0,\\n i = 0;\\n for (; i < Limit; ++i) {\\n z = z * z + c;\\n if (lensqr(z) > 4) break;\\n }\\n auto value = cast(ubyte) (i * 255.0 / Limit);\\n pset(x, y, rgb(value, value, value));\\n }\\n }\\n while (true) { flip; events; }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"class Complex {\\n double _r,_i;\\n\\n Complex(this._r,this._i);\\n double get r => _r;\\n double get i => _i;\\n String toString() => \\\"($r,$i)\\\";\\n\\n Complex operator +(Complex other) => new Complex(r+other.r,i+other.i);\\n Complex operator *(Complex other) =>\\n new Complex(r*other.r-i*other.i,r*other.i+other.r*i);\\n double abs() => r*r+i*i;\\n}\\n\\nvoid main() {\\n double start_x=-1.5;\\n double start_y=-1.0;\\n double step_x=0.03;\\n double step_y=0.1;\\n\\n for(int y=0;y<20;y++) {\\n String line=\\\"\\\";\\n for(int x=0;x<70;x++) {\\n Complex c=new Complex(start_x+step_x*x,start_y+step_y*y);\\n Complex z=new Complex(0.0, 0.0);\\n for(int i=0;i<100;i++) {\\n z=z*(z)+c;\\n if(z.abs()>2) {\\n break;\\n }\\n }\\n line+=z.abs()>2 ? \\\" \\\" : \\\"*\\\";\\n }\\n print(line);\\n }\\n}\\n\",\n \"language\": \"Dart\"\n },\n {\n \"code\": \" _2.1 sx # xmin = -2.1\\n 0.7 sX # xmax = 0.7\\n\\n _1.2 sy # ymin = -1.2\\n 1.2 sY # ymax = 1.2\\n\\n 32 sM # maxiter = 32\\n\\n 80 sW # image width\\n 25 sH # image height\\n\\n 8 k # precision\\n\\n[ q ] sq # quitter helper macro\\n\\n# for h from 0 to H-1\\n0 sh\\n[\\n lh lH =q # quit if H reached\\n\\n # for w from 0 to W-1\\n 0 sw\\n [\\n lw lW =q # quit if W reached\\n\\n # (w,h) -> (R,I)\\n # | |\\n # | ymin + h*(ymax-ymin)/(height-1)\\n # xmin + w*(xmax-xmin)/(width-1)\\n\\n lX lx - lW 1 - / lw * lx + sR\\n lY ly - lH 1 - / lh * ly + sI\\n\\n # iterate for (R,I)\\n\\n 0 sr # r:=0\\n 0 si # i:=0\\n 0 sa # a:=0 (r squared)\\n 0 sb # b:=0 (i squared)\\n 0 sm # m:=0\\n\\n # do while m!=M and a+b=<4\\n [\\n lm lM =q # exit if m==M\\n la lb + 4<q # exit if >4\\n\\n 2 lr * li * lI + si # i:=2*r*i+I\\n la lb - lR + sr # r:=a-b+R\\n lm 1 + sm # m+=1\\n lr 2 ^ sa # a:=r*r\\n li 2 ^ sb # b:=i*i\\n\\n l0 x # loop\\n ] s0\\n l0 x\\n\\n lm 32 + P # print \\\"pixel\\\"\\n\\n lw 1 + sw # w+=1\\n l1 x # loop\\n ] s1\\n l1 x\\n\\n A P # linefeed\\n\\n lh 1 + sh # h+=1\\n l2 x # loop\\n] s2\\nl2 x\\n\",\n \"language\": \"Dc\"\n },\n {\n \"code\": \"_2.1 sx 0.7 sX _1.2 sy 1.2 sY\\n32 sM\\n640 sW 480 sH\\n8 k\\n[P5] P A P\\nlW n 32 P lH n A P\\nlM 1 - n A P\\n[ q ] sq\\n0 sh\\n[\\n lh lH =q\\n 0 sw\\n [\\n lw lW =q\\n lX lx - lW 1 - / lw * lx + sR\\n lY ly - lH 1 - / lh * ly + sI\\n 0 sr 0 si 0 sa 0 sb 0 sm\\n [\\n lm lM =q\\n la lb + 4<q\\n 2 lr * li * lI + si\\n la lb - lR + sr\\n lm 1 + sm\\n lr 2 ^ sa\\n li 2 ^ sb\\n l0 x\\n ] s0\\n l0 x\\n lm 1 - P\\n lw 1 + sw\\n l1 x\\n ] s1\\n l1 x\\n lh 1 + sh\\n l2 x\\n] s2\\nl2 x\\n\",\n \"language\": \"Dc\"\n },\n {\n \"code\": \"const maxIter = 256;\\n\\nvar x, y, i : Integer;\\nfor y:=-39 to 39 do begin\\n for x:=-39 to 39 do begin\\n var c := Complex(y/40-0.5, x/40);\\n var z := Complex(0, 0);\\n for i:=1 to maxIter do begin\\n z := z*z + c;\\n if Abs(z)>=4 then Break;\\n end;\\n if i>=maxIter then\\n Print('#')\\n else Print('.');\\n end;\\n PrintLn('');\\nend;\\n\",\n \"language\": \"DWScript\"\n },\n {\n \"code\": \"# Mandelbrot\\n#\\nres = 4\\nmaxiter = 200\\n#\\n# better but slower:\\n# res = 8\\n# maxiter = 300\\n#\\n#\\nmid = res * 50\\ncenter_x = 3 * mid / 2\\ncenter_y = mid\\nscale = mid\\n#\\nbackground 000\\ntextsize 2\\n#\\nfastfunc iter cx cy maxiter .\\n while xx + yy < 4 and it < maxiter\\n y = 2 * x * y + cy\\n x = xx - yy + cx\\n xx = x * x\\n yy = y * y\\n it += 1\\n .\\n return it\\n.\\nproc draw . .\\n clear\\n for scr_y = 0 to 2 * mid - 1\\n cy = (scr_y - center_y) / scale\\n for scr_x = 0 to 2 * mid - 1\\n cx = (scr_x - center_x) / scale\\n it = iter cx cy maxiter\\n if it < maxiter\\n color3 it / 20 it / 100 it / 150\\n move scr_x / res scr_y / res\\n rect 1 / res 1 / res\\n .\\n .\\n .\\n color 990\\n move 1 1\\n text \\\"Short press to zoom in, long to zoom out\\\"\\n.\\non mouse_down\\n time0 = systime\\n.\\non mouse_up\\n center_x += mid - mouse_x * res\\n center_y += mid - mouse_y * res\\n if systime - time0 < 0.3\\n center_x -= mid - center_x\\n center_y -= mid - center_y\\n scale *= 2\\n else\\n center_x += (mid - center_x) * 3 / 4\\n center_y += (mid - center_y) * 3 / 4\\n scale /= 4\\n .\\n draw\\n.\\ndraw\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"void drawMandelbrot(Bitmap bmp, float range, Complex center, ColorAlpha * palette, int nPalEntries, int nIterations, float scale)\\n{\\n int x, y;\\n int w = bmp.width, h = bmp.height;\\n ColorAlpha * picture = (ColorAlpha *)bmp.picture;\\n double logOf2 = log(2);\\n Complex d\\n {\\n w > h ? range : range * w / h,\\n h > w ? range : range * h / w\\n };\\n Complex C0 { center.a - d.a/2, center.b - d.b/2 };\\n Complex C = C0;\\n double delta = d.a / w;\\n\\n for(y = 0; y < h; y++, C.a = C0.a, C.b += delta)\\n {\\n for(x = 0; x < w; x++, picture++, C.a += delta)\\n {\\n Complex Z { };\\n int i;\\n double ii = 0;\\n bool out = false;\\n double Za2 = Z.a * Z.a, Zb2 = Z.b * Z.b;\\n for(i = 0; i < nIterations; i++)\\n {\\n double z2;\\n Z = { Za2 - Zb2, 2*Z.a*Z.b };\\n Z.a += C.a;\\n Z.b += C.b;\\n Za2 = Z.a * Z.a, Zb2 = Z.b * Z.b;\\n z2 = Za2 + Zb2;\\n\\n if(z2 >= 2*2)\\n {\\n ii = (double)(i + 1 - log(0.5 * log(z2)) / logOf2);\\n out = true;\\n break;\\n }\\n }\\n if(out)\\n {\\n float si = (float)(ii * scale);\\n int i0 = ((int)si) % nPalEntries;\\n *picture = palette[i0];\\n }\\n else\\n *picture = black;\\n }\\n }\\n}\\n\",\n \"language\": \"EC\"\n },\n {\n \"code\": \"class Mandelbrot : Window\\n{\\n caption = $\\\"Mandelbrot\\\";\\n borderStyle = sizable;\\n hasMaximize = true;\\n hasMinimize = true;\\n hasClose = true;\\n clientSize = { 600, 600 };\\n\\n Point mouseStart, mouseEnd;\\n bool dragging;\\n bool needUpdate;\\n\\n float scale;\\n int nIterations; nIterations = 256;\\n ColorAlpha * palette;\\n int nPalEntries;\\n Complex center { -0.75, 0 };\\n\\n float range; range = 4;\\n Bitmap bmp { };\\n\\n Mandelbrot()\\n {\\n static ColorKey keys[] =\\n {\\n { navy, 0.0f },\\n { Color { 146, 213, 237 }, 0.198606268f },\\n { white, 0.3f },\\n { Color { 255, 255, 124 }, 0.444250882f },\\n { Color { 255, 100, 0 }, 0.634146333f },\\n { navy, 1 }\\n };\\n\\n nPalEntries = 30000;\\n palette = new ColorAlpha[nPalEntries];\\n scale = nPalEntries / 175.0f;\\n PaletteGradient(palette, nPalEntries, keys, sizeof(keys)/sizeof(keys[0]), 1.0);\\n needUpdate = true;\\n }\\n\\n ~Mandelbrot() { delete palette; }\\n\\n void OnRedraw(Surface surface)\\n {\\n if(needUpdate)\\n {\\n drawMandelbrot(bmp, range, center, palette, nPalEntries, nIterations, scale);\\n needUpdate = false;\\n }\\n surface.Blit(bmp, 0,0, 0,0, bmp.width, bmp.height);\\n\\n if(dragging)\\n {\\n surface.foreground = lime;\\n surface.Rectangle(mouseStart.x, mouseStart.y, mouseEnd.x, mouseEnd.y);\\n }\\n }\\n\\n bool OnLeftButtonDown(int x, int y, Modifiers mods)\\n {\\n mouseEnd = mouseStart = { x, y };\\n Capture();\\n dragging = true;\\n Update(null);\\n return true;\\n }\\n\\n bool OnLeftButtonUp(int x, int y, Modifiers mods)\\n {\\n if(dragging)\\n {\\n int dx = Abs(mouseEnd.x - mouseStart.x), dy = Abs(mouseEnd.y - mouseStart.y);\\n if(dx > 4 && dy > 4)\\n {\\n int w = clientSize.w, h = clientSize.h;\\n float rangeX = w > h ? range : range * w / h;\\n float rangeY = h > w ? range : range * h / w;\\n\\n center.a += ((mouseStart.x + mouseEnd.x) - w) / 2.0f * rangeX / w;\\n center.b += ((mouseStart.y + mouseEnd.y) - h) / 2.0f * rangeY / h;\\n\\n range = dy > dx ? dy * range / h : dx * range / w;\\n\\n needUpdate = true;\\n Update(null);\\n }\\n ReleaseCapture();\\n dragging = false;\\n }\\n return true;\\n }\\n\\n bool OnMouseMove(int x, int y, Modifiers mods)\\n {\\n if(dragging)\\n {\\n mouseEnd = { x, y };\\n Update(null);\\n }\\n return true;\\n }\\n\\n bool OnRightButtonDown(int x, int y, Modifiers mods)\\n {\\n range = 4;\\n nIterations = 256;\\n center = { -0.75, 0 };\\n needUpdate = true;\\n Update(null);\\n return true;\\n }\\n\\n void OnResize(int width, int height)\\n {\\n bmp.Allocate(null, width, height, 0, pixelFormat888, false);\\n needUpdate = true;\\n Update(null);\\n }\\n\\n bool OnKeyHit(Key key, unichar ch)\\n {\\n switch(key)\\n {\\n case space: case keyPadPlus: case plus:\\n nIterations += 256;\\n needUpdate = true;\\n Update(null);\\n break;\\n }\\n return true;\\n }\\n}\\n\\nMandelbrot mandelbrotForm {};\\n\",\n \"language\": \"EC\"\n },\n {\n \"code\": \"(lib 'math) ;; fractal function\\n(lib 'plot)\\n\\n;; (fractal z zc n) iterates z := z^2 + c, n times\\n;; 100 iterations\\n(define (mset z) (if (= Infinity (fractal 0 z 100)) Infinity z))\\n\\n;; plot function argument inside square (-2 -2), (2,2)\\n(plot-z-arg mset -2 -2)\\n\\n;; result here [http://www.echolalie.org/echolisp/help.html#fractal]\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"defmodule Mandelbrot do\\n def set do\\n xsize = 59\\n ysize = 21\\n minIm = -1.0\\n maxIm = 1.0\\n minRe = -2.0\\n maxRe = 1.0\\n stepX = (maxRe - minRe) / xsize\\n stepY = (maxIm - minIm) / ysize\\n Enum.each(0..ysize, fn y ->\\n im = minIm + stepY * y\\n Enum.map(0..xsize, fn x ->\\n re = minRe + stepX * x\\n 62 - loop(0, re, im, re, im, re*re+im*im)\\n end) |> IO.puts\\n end)\\n end\\n\\n defp loop(n, _, _, _, _, _) when n>=30, do: n\\n defp loop(n, _, _, _, _, v) when v>4.0, do: n-1\\n defp loop(n, re, im, zr, zi, _) do\\n a = zr * zr\\n b = zi * zi\\n loop(n+1, re, im, a-b+re, 2*zr*zi+im, a+b)\\n end\\nend\\n\\nMandelbrot.set\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"; === Mandelbrot ============================================\\n\\n(setq mandel-size (cons 76 34))\\n(setq xmin -2)\\n(setq xmax .5)\\n(setq ymin -1.2)\\n(setq ymax 1.2)\\n(setq max-iter 20)\\n\\n(defun mandel-iter-point (x y)\\n \\\"Run the actual iteration for each point.\\\"\\n (let ((xp 0)\\n (yp 0)\\n (it 0)\\n (xt 0))\\n (while (and (< (+ (* xp xp) (* yp yp)) 4) (< it max-iter))\\n (setq xt (+ (* xp xp) (* -1 yp yp) x))\\n (setq yp (+ (* 2 xp yp) y))\\n (setq xp xt)\\n (setq it (1+ it)))\\n it))\\n\\n(defun mandel-iter (p)\\n \\\"Return string for point based on whether inside/outside the set.\\\"\\n (let ((it (mandel-iter-point (car p) (cdr p))))\\n (if (= it max-iter) \\\"*\\\" \\\"-\\\")))\\n\\n(defun mandel-pos (x y)\\n \\\"Convert screen coordinates to input coordinates.\\\"\\n (let ((xp (+ xmin (* (- xmax xmin) (/ (float x) (car mandel-size)))))\\n (yp (+ ymin (* (- ymax ymin) (/ (float y) (cdr mandel-size))))))\\n (cons xp yp)))\\n\\n(defun mandel ()\\n \\\"Plot the Mandelbrot set.\\\"\\n (dotimes (y (cdr mandel-size))\\n (dotimes (x (car mandel-size))\\n (if (= x 0)\\n (insert(format \\\"\\\\n%s\\\" (mandel-iter (mandel-pos x y))))\\n (insert(format \\\"%s\\\" (mandel-iter (mandel-pos x y))))))))\\n\\n(mandel)\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"; === Graphical Mandelbrot ============================================\\n\\n(setq mandel-size (cons 320 300))\\n(setq xmin -2)\\n(setq xmax .5)\\n(setq ymin -1.2)\\n(setq ymax 1.2)\\n(setq max-iter 20)\\n\\n(defun mandel-iter-point (x y)\\n \\\"Run the actual iteration for each point.\\\"\\n (let ((xp 0)\\n (yp 0)\\n (it 0)\\n (xt 0))\\n (while (and (< (+ (* xp xp) (* yp yp)) 4) (< it max-iter))\\n (setq xt (+ (* xp xp) (* -1 yp yp) x))\\n (setq yp (+ (* 2 xp yp) y))\\n (setq xp xt)\\n (setq it (1+ it)))\\n it))\\n\\n(defun mandel-iter (p)\\n \\\"Return string for point based on whether inside/outside the set.\\\"\\n (let ((it (mandel-iter-point (car p) (cdr p))))\\n (if (= it max-iter) \\\"*\\\" (if (cl-oddp it) \\\"+\\\" \\\"-\\\"))))\\n\\n(defun mandel-pos (x y)\\n \\\"Convert screen coordinates to input coordinates.\\\"\\n (let ((xp (+ xmin (* (- xmax xmin) (/ (float x) (car mandel-size)))))\\n (yp (+ ymin (* (- ymax ymin) (/ (float y) (cdr mandel-size))))))\\n (cons xp yp)))\\n\\n(defun string-to-image (str)\\n \\\"Convert image data string to XPM image.\\\"\\n (create-image (concat (format \\\"/* XPM */\\nstatic char * mandel[] = {\\n\\\\\\\"%i %i 3 1\\\\\\\",\\n\\\\\\\"+ c #ff0000\\\\\\\",\\n\\\\\\\"- c #0000ff\\\\\\\",\\n\\\\\\\"* c #000000\\\\\\\",\\\" (car mandel-size) (cdr mandel-size))\\n str \\\"};\\\") 'xpm t))\\n\\n(defun mandel-pic ()\\n \\\"Plot the Mandelbrot set.\\\"\\n (setq all \\\"\\\")\\n (dotimes (y (cdr mandel-size))\\n (setq line \\\"\\\")\\n (dotimes (x (car mandel-size))\\n (setq line (concat line (mandel-iter (mandel-pos x y)))))\\n (setq all (concat all \\\"\\\\\\\"\\\" line \\\"\\\\\\\",\\\\n\\\")))\\n (insert-image (string-to-image all)))\\n\\n(mandel-pic)\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"-module(mandelbrot).\\n\\n-export([test/0]).\\n\\nmagnitude(Z) ->\\n R = complex:real(Z),\\n I = complex:imaginary(Z),\\n R * R + I * I.\\n\\nmandelbrot(A, MaxI, Z, I) ->\\n case (I < MaxI) and (magnitude(Z) < 2.0) of\\n true ->\\n NZ = complex:add(complex:mult(Z, Z), A),\\n mandelbrot(A, MaxI, NZ, I + 1);\\n false ->\\n case I of\\n MaxI ->\\n $*;\\n _ ->\\n $\\n end\\n end.\\n\\ntest() ->\\n lists:map(\\n fun(S) -> io:format(\\\"~s\\\",[S]) end,\\n [\\n [\\n begin\\n Z = complex:make(X, Y),\\n mandelbrot(Z, 50, Z, 1)\\n end\\n || X <- seq_float(-2, 0.5, 0.0315)\\n ] ++ \\\"\\\\n\\\"\\n || Y <- seq_float(-1,1, 0.05)\\n ] ),\\n ok.\\n\\n% **************************************************\\n% Copied from https://gist.github.com/andruby/241489\\n% **************************************************\\n\\nseq_float(Min, Max, Inc, Counter, Acc) when (Counter*Inc + Min) >= Max ->\\n lists:reverse([Max|Acc]);\\nseq_float(Min, Max, Inc, Counter, Acc) ->\\n seq_float(Min, Max, Inc, Counter+1, [Inc * Counter + Min|Acc]).\\nseq_float(Min, Max, Inc) ->\\n seq_float(Min, Max, Inc, 0, []).\\n\\n% **************************************************\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"PROGRAM MANDELBROT\\n\\n!$KEY\\n!$INCLUDE=\\\"PC.LIB\\\"\\n\\nBEGIN\\n\\nSCREEN(7)\\nGR_WINDOW(-2,1.5,2,-1.5)\\nFOR X0=-2 TO 2 STEP 0.01 DO\\n FOR Y0=-1.5 TO 1.5 STEP 0.01 DO\\n X=0\\n Y=0\\n\\n ITERATION=0\\n MAX_ITERATION=223\\n\\n WHILE (X*X+Y*Y<=(2*2) AND ITERATION<MAX_ITERATION) DO\\n X_TEMP=X*X-Y*Y+X0\\n Y=2*X*Y+Y0\\n\\n X=X_TEMP\\n\\n ITERATION=ITERATION+1\\n END WHILE\\n\\n IF ITERATION<>MAX_ITERATION THEN\\n C=ITERATION\\n ELSE\\n C=0\\n END IF\\n\\n PSET(X0,Y0,C)\\n END FOR\\nEND FOR\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"open System.Drawing\\nopen System.Windows.Forms\\ntype Complex =\\n {\\n re : float;\\n im : float\\n }\\nlet cplus (x:Complex) (y:Complex) : Complex =\\n {\\n re = x.re + y.re;\\n im = x.im + y.im\\n }\\nlet cmult (x:Complex) (y:Complex) : Complex =\\n {\\n re = x.re * y.re - x.im * y.im;\\n im = x.re * y.im + x.im * y.re;\\n }\\n\\nlet norm (x:Complex) : float =\\n x.re*x.re + x.im*x.im\\n\\ntype Mandel = class\\n inherit Form\\n static member xPixels = 500\\n static member yPixels = 500\\n val mutable bmp : Bitmap\\n member x.mandelbrot xMin xMax yMin yMax maxIter =\\n let rec mandelbrotIterator z c n =\\n if (norm z) > 2.0 then false else\\n match n with\\n | 0 -> true\\n | n -> let z' = cplus ( cmult z z ) c in\\n mandelbrotIterator z' c (n-1)\\n let dx = (xMax - xMin) / (float (Mandel.xPixels))\\n let dy = (yMax - yMin) / (float (Mandel.yPixels))\\n in\\n for xi = 0 to Mandel.xPixels-1 do\\n for yi = 0 to Mandel.yPixels-1 do\\n let c = {re = xMin + (dx * float(xi) ) ;\\n im = yMin + (dy * float(yi) )} in\\n if (mandelbrotIterator {re=0.;im=0.;} c maxIter) then\\n x.bmp.SetPixel(xi,yi,Color.Azure)\\n else\\n x.bmp.SetPixel(xi,yi,Color.Black)\\n done\\n done\\n\\n member public x.generate () = x.mandelbrot (-1.5) 0.5 (-1.0) 1.0 200 ; x.Refresh()\\n\\n new() as x = {bmp = new Bitmap(Mandel.xPixels , Mandel.yPixels)} then\\n x.Text <- \\\"Mandelbrot set\\\" ;\\n x.Width <- Mandel.xPixels ;\\n x.Height <- Mandel.yPixels ;\\n x.BackgroundImage <- x.bmp;\\n x.generate();\\n x.Show();\\nend\\n\\nlet f = new Mandel()\\ndo Application.Run(f)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"let getMandelbrotValues width height maxIter ((xMin,xMax),(yMin,yMax)) =\\n let mandIter (cr:float,ci:float) =\\n let next (zr,zi) = (cr + (zr * zr - zi * zi)), (ci + (zr * zi + zi * zr))\\n let rec loop = function\\n | step,_ when step=maxIter->0\\n | step,(zr,zi) when ((zr * zr + zi * zi) > 2.0) -> step\\n | step,z -> loop ((step + 1), (next z))\\n loop (0,(0.0, 0.0))\\n let forPos =\\n let dx, dy = (xMax - xMin) / (float width), (yMax - yMin) / (float height)\\n fun y x -> mandIter ((xMin + dx * float(x)), (yMin + dy * float(y)))\\n [0..height-1] |> List.map(fun y->[0..width-1] |> List.map (forPos y))\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"getMandelbrotValues 80 25 50 ((-2.0,1.0),(-1.0,1.0))\\n|> List.map(fun row-> row |> List.map (function | 0 ->\\\" \\\" |_->\\\".\\\") |> String.concat \\\"\\\")\\n|> List.iter (printfn \\\"%s\\\")\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"open System.Drawing\\nopen System.Windows.Forms\\n\\nlet showGraphic (colorForIter: int -> Color) (width: int) (height:int) maxIter view =\\n new Form()\\n |> fun frm ->\\n frm.Width <- width\\n frm.Height <- height\\n frm.BackgroundImage <-\\n new Bitmap(width,height)\\n |> fun bmp ->\\n getMandelbrotValues width height maxIter view\\n |> List.mapi (fun y row->row |> List.mapi (fun x v->((x,y),v))) |> List.collect id\\n |> List.iter (fun ((x,y),v) -> bmp.SetPixel(x,y,(colorForIter v)))\\n bmp\\n frm.Show()\\n\\nlet toColor = (function | 0 -> (0,0,0) | n -> ((31 &&& n) |> fun x->(0, 18 + x * 5, 36 + x * 7))) >> Color.FromArgb\\n\\nshowGraphic toColor 640 480 5000 ((-2.0,1.0),(-1.0,1.0))\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"! with (\\\"::\\\") or without (\\\":\\\") generalizations:\\n! : [a..b] ( steps a b -- a..b ) 2dup swap - 4 nrot 1 - / <range> ;\\n:: [a..b] ( steps a b -- a..b ) a b b a - steps 1 - / <range> ;\\n\\n: >char ( n -- c )\\n dup -1 = [ drop 32 ] [ 26 mod CHAR: a + ] if ;\\n\\n! iterates z' = z^2 + c, Factor does complex numbers!\\n: iter ( c z -- z' ) dup * + ;\\n\\n: unbound ( c -- ? ) absq 4 > ;\\n\\n:: mz ( c max i z -- n )\\n {\\n { [ i max >= ] [ -1 ] }\\n { [ z unbound ] [ i ] }\\n [ c max i 1 + c z iter mz ]\\n } cond ;\\n\\n: mandelzahl ( c max -- n ) 0 0 mz ;\\n\\n:: mandel ( w h max -- )\\n h -1. 1. [a..b] ! range over y\\n [ w -2. 1. [a..b] ! range over x\\n [ dupd swap rect> max mandelzahl >char ] map\\n >string print\\n drop ! old y\\n ] each\\n ;\\n\\n70 25 1000 mandel\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"#!/usr/bin/env fennel\\n\\n(fn mandelzahl [cr ci max i tr ti tr2 ti2]\\n \\\"Calculates the Mandelbrot escape number of a complex point c\\\"\\n (if (>= i max) -1\\n (>= (+ tr2 ti2) 4) i\\n (let [(tr ti) (values (+ (- tr2 ti2) cr)\\n (+ (* tr ti 2) ci))]\\n (mandelzahl cr ci max (+ i 1)\\n tr ti (* tr tr) (* ti ti)))))\\n\\n(fn mandel [w h max]\\n \\\"Entry point, generate a 'graphical' representation of the Mandelbrot set\\\"\\n (for [y -1.0 1.0 (/ 2.0 h)]\\n (var line {})\\n (for [x -2.0 1.0 (/ 3.0 w)]\\n (let [mz (mandelzahl x y max 0 0 0 0 0)]\\n (tset line (+ (length line) 1)\\n (or (and (< mz 0) \\\" \\\")\\n (string.char (+ (string.byte :a) (% mz 26)))))))\\n (print (table.concat line))))\\n\\n(fn arg-def [pos default]\\n \\\"A helper fn to extract command line parameter with defaults\\\"\\n (or (tonumber (and arg (. arg pos))) default))\\n\\n(let [width (arg-def 1 140)\\n height (arg-def 2 50)\\n max (arg-def 3 1e5)]\\n (mandel width height max))\\n\",\n \"language\": \"Fennel\"\n },\n {\n \"code\": \"1.1 S I1=-1.2; S I2=1.2; S R1=-2; S R2=.5\\n1.2 S MIT=30\\n1.3 F Y=1,24; D 2\\n1.4 Q\\n\\n2.1 T !\\n2.2 F X=1,70; D 3\\n\\n3.1 S R=X*(R2-R1)/70+R1\\n3.2 S I=Y*(I2-I1)/24+I1\\n3.3 S C1=R; S C2=I\\n3.4 F T=1,MIT; D 4\\n\\n4.1 S C3=C1\\n4.2 S C1=C1*C1 - C2*C2\\n4.3 S C2=C3*C2 + C2*C3\\n4.4 S C1=C1+R\\n4.5 S C2=C2+I\\n4.6 I (-FABS(C1)+2)5.1\\n4.7 I (-FABS(C2)+2)5.1\\n4.8 I (MIT-T-1)6.1\\n\\n5.1 S T=MIT; T \\\"*\\\"; R\\n\\n6.1 T \\\" \\\"; R\\n\",\n \"language\": \"FOCAL\"\n },\n {\n \"code\": \"500 value max-iter\\n\\n: mandel ( gmp F: imin imax rmin rmax -- )\\n 0e 0e { F: imin F: imax F: rmin F: rmax F: Zr F: Zi }\\n dup bheight 0 do\\n i s>f dup bheight s>f f/ imax imin f- f* imin f+ TO Zi\\n dup bwidth 0 do\\n i s>f dup bwidth s>f f/ rmax rmin f- f* rmin f+ TO Zr\\n Zr Zi max-iter\\n begin 1- dup\\n while fover fdup f* fover fdup f*\\n fover fover f+ 4e f<\\n while f- Zr f+\\n frot frot f* 2e f* Zi f+\\n repeat fdrop fdrop\\n drop 0 \\\\ for a pretty grayscale image, replace with: 255 max-iter */\\n else drop 255\\n then fdrop fdrop\\n over i j rot g!\\n loop\\n loop drop ;\\n\\n80 24 graymap\\ndup -1e 1e -2e 1e mandel\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"include lib/graphics.4th \\\\ graphics support is needed\\n\\n640 pic_width ! \\\\ width of the image\\n480 pic_height ! \\\\ height of the image\\n\\ncreate shade \\\\ map the shades of the image\\n ' black , \\\\ this is the colorscheme\\n ' blue ,\\n ' cyan ,\\n ' green ,\\n ' yellow ,\\n ' red ,\\n ' magenta ,\\n ' blue ,\\n ' cyan ,\\n ' green ,\\n ' yellow ,\\n ' white ,\\ndoes> swap cells + @c execute ; \\\\ loop through the shades available\\n\\ncolor_image \\\\ we're making a color image\\n\\n15121 -15120 do \\\\ do y-coordinate\\n 15481 -21000 do \\\\ do x-coordinate\\n j 0 0 0 ( l u v i)\\n 200 0 do \\\\ get color\\n >r\\n over dup 10 / * 1000 / \\\\ calculate X and Y\\n over dup 10 / * 1000 / \\\\ if X+Y > 40000\\n over over + r> swap 40000 > \\\\ use the color in the loop\\n if\\n drop drop drop i 11 min leave\\n else \\\\ otherwise try the next one\\n j swap >r - - >r * 5000 / over + r> swap r>\\n then\\n loop \\\\ drop all parameters and set the shade\\n shade drop drop drop \\\\ now set the proper pixel\\n j 15120 + 63 / i 21000 + 57 / set_pixel\\n 57 +loop \\\\ we're scaling the x-coordinate\\n63 +loop \\\\ we're scaling the y-coordinate\\n\\ns\\\" mandelbt.ppm\\\" save_image \\\\ done, save the image\\ndup gshow\\nfree bye\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"program mandelbrot\\n\\n implicit none\\n integer , parameter :: rk = selected_real_kind (9, 99)\\n integer , parameter :: i_max = 800\\n integer , parameter :: j_max = 600\\n integer , parameter :: n_max = 100\\n real (rk), parameter :: x_centre = -0.5_rk\\n real (rk), parameter :: y_centre = 0.0_rk\\n real (rk), parameter :: width = 4.0_rk\\n real (rk), parameter :: height = 3.0_rk\\n real (rk), parameter :: dx_di = width / i_max\\n real (rk), parameter :: dy_dj = -height / j_max\\n real (rk), parameter :: x_offset = x_centre - 0.5_rk * (i_max + 1) * dx_di\\n real (rk), parameter :: y_offset = y_centre - 0.5_rk * (j_max + 1) * dy_dj\\n integer, dimension (i_max, j_max) :: image\\n integer :: i\\n integer :: j\\n integer :: n\\n real (rk) :: x\\n real (rk) :: y\\n real (rk) :: x_0\\n real (rk) :: y_0\\n real (rk) :: x_sqr\\n real (rk) :: y_sqr\\n\\n do j = 1, j_max\\n y_0 = y_offset + dy_dj * j\\n do i = 1, i_max\\n x_0 = x_offset + dx_di * i\\n x = 0.0_rk\\n y = 0.0_rk\\n n = 0\\n do\\n x_sqr = x ** 2\\n y_sqr = y ** 2\\n if (x_sqr + y_sqr > 4.0_rk) then\\n image (i, j) = 255\\n exit\\n end if\\n if (n == n_max) then\\n image (i, j) = 0\\n exit\\n end if\\n y = y_0 + 2.0_rk * x * y\\n x = x_0 + x_sqr - y_sqr\\n n = n + 1\\n end do\\n end do\\n end do\\n open (10, file = 'out.pgm')\\n write (10, '(a/ i0, 1x, i0/ i0)') 'P2', i_max, j_max, 255\\n write (10, '(i0)') image\\n close (10)\\n\\nend program mandelbrot\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"#define pix 1./120\\n#define zero_x 320\\n#define zero_y 240\\n#define maxiter 250\\n\\nscreen 12\\n\\ntype complex\\n r as double\\n i as double\\nend type\\n\\noperator + (x as complex, y as complex) as complex\\n dim as complex ret\\n ret.r = x.r + y.r\\n ret.i = x.i + y.i\\n return ret\\nend operator\\n\\noperator * (x as complex, y as complex) as complex\\n dim as complex ret\\n ret.r = x.r*y.r - x.i*y.i\\n ret.i = x.r*y.i + x.i*y.r\\n return ret\\nend operator\\n\\noperator abs ( x as complex ) as double\\n return sqr(x.r*x.r + x.i*x.i)\\nend operator\\n\\ndim as complex c, z\\ndim as integer x, y, iter\\n\\nfor x=0 to 639\\n for y=0 to 240\\n c.r = (x-zero_x)*pix\\n c.i = (y-zero_y)*pix\\n z.r = 0.0\\n z.i = 0.0\\n for iter=0 to maxiter\\n z = z*z + c\\n if abs(z)>2 then\\n pset(x,y),iter mod 16\\n pset(x,480-y),iter mod 16\\n goto cont\\n end if\\n next iter\\n pset(x,y),1\\n pset(x,480-y),1\\n cont:\\n next y\\nnext x\\n\\nwhile inkey=\\\"\\\"\\nwend\\nend\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"// Maximum levels for each pixel.\\nlevels = 60\\n\\n// Create a random color for each level.\\ncolors = new array[[levels]]\\nfor a = 0 to levels-1\\n colors@a = new color[randomFloat[0,1], randomFloat[0,1], randomFloat[0,1]]\\n\\n// Make this number smaller for higher resolution.\\nstepsize = .005\\n\\ng = new graphics\\ng.antialiased[false]\\n\\nfor im = -1.2 to 1.2 step stepsize\\n{\\n imag = i * im\\n for real = -2 to 1 step stepsize\\n {\\n C = real + imag\\n z = 0\\n count = -1\\n\\n do\\n {\\n z = z^2 + C\\n count=count+1;\\n } while abs[z] < 4 and count < levels\\n\\n g.color[colors@((count-1) mod levels)]\\n g.fillRectSize[real, im, stepsize, stepsize]\\n }\\n}\\n\\ng.show[]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"###sysinclude X.uh\\n$ff0000 sto szin\\n300 sto maxiter\\nmaxypixel sto YRES\\nmaxxpixel sto XRES\\nmyscreen \\\"Mandelbrot\\\" @YRES @XRES graphic\\n@YRES 2 / (#d) sto y2\\n@YRES 2 / (#d) sto x2\\n#g 0. @XRES (#d) 1. i: {#d\\n#g 0. @YRES (#d) 1. {#d\\n#d\\n{#d}§i 400. - @x2 - @x2 /\\nsto x\\n{#d} @y2 - @y2 /\\nsto y\\nzero#d xa zero#d ya zero iter\\n(( #d\\n@x @xa dup* @ya dup* -+\\n@y @xa *2 @ya *+ sto ya\\nsto xa #g inc iter\\n@iter @maxiter >= then((>))\\n#d ( @xa dup* @ya dup* + 4. > )))\\n#g @iter @maxiter == { #d\\nmyscreen {d} {d}§i @szin [][]\\n}{ #d\\nmyscreen {d} {d}§i #g @iter 64 * [][]\\n}\\n#d}\\n#d}\\n(( ( myscreen key? 10000 usleep )))\\nmyscreen !graphic\\nend\\n{ „x” }\\n{ „x2” }\\n{ „y” }\\n{ „y2” }\\n{ „xa” }\\n{ „ya” }\\n{ „iter” }\\n{ „maxiter” }\\n{ „szin” }\\n{ „YRES” }\\n{ „XRES” }\\n{ „myscreen” }\\n\",\n \"language\": \"Furor\"\n },\n {\n \"code\": \"default(f32)\\n\\ntype complex = (f32, f32)\\n\\nfun dot(c: complex): f32 =\\n let (r, i) = c\\n in r * r + i * i\\n\\nfun multComplex(x: complex, y: complex): complex =\\n let (a, b) = x\\n let (c, d) = y\\n in (a*c - b * d,\\n a*d + b * c)\\n\\nfun addComplex(x: complex, y: complex): complex =\\n let (a, b) = x\\n let (c, d) = y\\n in (a + c,\\n b + d)\\n\\nfun divergence(depth: int, c0: complex): int =\\n loop ((c, i) = (c0, 0)) = while i < depth && dot(c) < 4.0 do\\n (addComplex(c0, multComplex(c, c)),\\n i + 1)\\n in i\\n\\nfun mandelbrot(screenX: int, screenY: int, depth: int, view: (f32,f32,f32,f32)): [screenX][screenY]int =\\n let (xmin, ymin, xmax, ymax) = view\\n let sizex = xmax - xmin\\n let sizey = ymax - ymin\\n in map (fn (x: int): [screenY]int =>\\n map (fn (y: int): int =>\\n let c0 = (xmin + (f32(x) * sizex) / f32(screenX),\\n ymin + (f32(y) * sizey) / f32(screenY))\\n in divergence(depth, c0))\\n (iota screenY))\\n (iota screenX)\\n\\nfun main(screenX: int, screenY: int, depth: int, xmin: f32, ymin: f32, xmax: f32, ymax: f32): [screenX][screenY]int =\\n mandelbrot(screenX, screenY, depth, (xmin, ymin, xmax, ymax))\\n\",\n \"language\": \"Futhark\"\n },\n {\n \"code\": \"_xmin = -8601\\n_xmax = 2867\\n_ymin = -4915\\n_ymax = 4915\\n_maxiter = 32\\n_dx = ( _xmax - _xmin ) / 79\\n_dy = ( _ymax - _ymin ) / 24\\n\\nvoid local fn MandelbrotSet\\n printf @\\\"\\\\n\\\"\\n SInt32 cy = _ymin\\n while ( cy <= _ymax )\\n SInt32 cx = _xmin\\n while ( cx <= _xmax )\\n SInt32 x = 0\\n SInt32 y = 0\\n SInt32 x2 = 0\\n SInt32 y2 = 0\\n SInt32 iter = 0\\n while ( iter < _maxiter )\\n if ( x2 + y2 > 16384 ) then break\\n y = ( ( x * y ) >> 11 ) + (SInt32)cy\\n x = x2 - y2 + (SInt32)cx\\n x2 = ( x * x ) >> 12\\n y2 = ( y * y ) >> 12\\n iter++\\n wend\\n print fn StringWithFormat( @\\\"%3c\\\", iter + 32 );\\n cx += _dx\\n wend\\n printf @\\\"\\\\n\\\"\\n cy += _dy\\n wend\\nend fn\\n\\nwindow 1, @\\\"Mandelbrot Set\\\", ( 0, 0, 820, 650 )\\nWindowSetBackgroundColor( 1, fn ColorBlack )\\ntext @\\\"Impact\\\", 10.0, fn ColorWithRGB( 1.000, 0.800, 0.000, 1.0 )\\n\\nfn MandelbrotSet\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"const int MaxIterations = 1000;\\nconst vec2 Focus = vec2(-0.51, 0.54);\\nconst float Zoom = 1.0;\\n\\nvec3\\ncolor(int iteration, float sqLengthZ) {\\n // If the point is within the mandlebrot set\\n // just color it black\\n if(iteration == MaxIterations)\\n return vec3(0.0);\\n\\n // Else we give it a smoothed color\\n \\tfloat ratio = (float(iteration) - log2(log2(sqLengthZ))) / float(MaxIterations);\\n\\n // Procedurally generated colors\\n return mix(vec3(1.0, 0.0, 0.0), vec3(1.0, 1.0, 0.0), sqrt(ratio));\\n}\\n\\nvoid\\nmainImage(out vec4 fragColor, in vec2 fragCoord) {\\n // C is the aspect-ratio corrected UV coordinate.\\n vec2 c = (-1.0 + 2.0 * fragCoord / iResolution.xy) * vec2(iResolution.x / iResolution.y, 1.0);\\n\\n // Apply scaling, then offset to get a zoom effect\\n c = (c * exp(-Zoom)) + Focus;\\n\\tvec2 z = c;\\n\\n int iteration = 0;\\n\\n while(iteration < MaxIterations) {\\n // Precompute for efficiency\\n \\tfloat zr2 = z.x * z.x;\\n float zi2 = z.y * z.y;\\n\\n // The larger the square length of Z,\\n // the smoother the shading\\n if(zr2 + zi2 > 32.0) break;\\n\\n // Complex multiplication, then addition\\n \\tz = vec2(zr2 - zi2, 2.0 * z.x * z.y) + c;\\n ++iteration;\\n }\\n\\n // Generate the colors\\n fragColor = vec4(color(iteration, dot(z,z)), 1.0);\\n\\n // Apply gamma correction\\n fragColor.rgb = pow(fragColor.rgb, vec3(0.5));\\n}\\n\",\n \"language\": \"GLSL\"\n },\n {\n \"code\": \"set terminal png\\nset output 'mandelbrot.png'\\n\",\n \"language\": \"Gnuplot\"\n },\n {\n \"code\": \"rmax = 2\\nnmax = 100\\ncomplex (x, y) = x * {1, 0} + y * {0, 1}\\nmandelbrot (z, z0, n) = n == nmax || abs (z) > rmax ? n : mandelbrot (z ** 2 + z0, z0, n + 1)\\nset samples 200\\nset isosamples 200\\nset pm3d map\\nset size square\\nsplot [-2 : .8] [-1.4 : 1.4] mandelbrot (complex (0, 0), complex (x, y), 0) notitle\\n\",\n \"language\": \"Gnuplot\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\nimport \\\"math/cmplx\\\"\\n\\nfunc mandelbrot(a complex128) (z complex128) {\\n for i := 0; i < 50; i++ {\\n z = z*z + a\\n }\\n return\\n}\\n\\nfunc main() {\\n for y := 1.0; y >= -1.0; y -= 0.05 {\\n for x := -2.0; x <= 0.5; x += 0.0315 {\\n if cmplx.Abs(mandelbrot(complex(x, y))) < 2 {\\n fmt.Print(\\\"*\\\")\\n } else {\\n fmt.Print(\\\" \\\")\\n }\\n }\\n fmt.Println(\\\"\\\")\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"image\\\"\\n \\\"image/color\\\"\\n \\\"image/draw\\\"\\n \\\"image/png\\\"\\n \\\"math/cmplx\\\"\\n \\\"os\\\"\\n)\\n\\nconst (\\n maxEsc = 100\\n rMin = -2.\\n rMax = .5\\n iMin = -1.\\n iMax = 1.\\n width = 750\\n red = 230\\n green = 235\\n blue = 255\\n)\\n\\nfunc mandelbrot(a complex128) float64 {\\n i := 0\\n for z := a; cmplx.Abs(z) < 2 && i < maxEsc; i++ {\\n z = z*z + a\\n }\\n return float64(maxEsc-i) / maxEsc\\n}\\n\\nfunc main() {\\n scale := width / (rMax - rMin)\\n height := int(scale * (iMax - iMin))\\n bounds := image.Rect(0, 0, width, height)\\n b := image.NewNRGBA(bounds)\\n draw.Draw(b, bounds, image.NewUniform(color.Black), image.ZP, draw.Src)\\n for x := 0; x < width; x++ {\\n for y := 0; y < height; y++ {\\n fEsc := mandelbrot(complex(\\n float64(x)/scale+rMin,\\n float64(y)/scale+iMin))\\n b.Set(x, y, color.NRGBA{uint8(red * fEsc),\\n uint8(green * fEsc), uint8(blue * fEsc), 255})\\n\\n }\\n }\\n f, err := os.Create(\\\"mandelbrot.png\\\")\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n if err = png.Encode(f, b); err != nil {\\n fmt.Println(err)\\n }\\n if err = f.Close(); err != nil {\\n fmt.Println(err)\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"20{40{0.1{.{;..*2$.*\\\\-\\n20/3$-@@*10/3$-..*2$.*+1600<}*}32*'\\n*'=\\\\;\\\\;@@(}60*;(n\\\\}40*;]''+\\n\",\n \"language\": \"Golfscript\"\n },\n {\n \"code\": \"10 SCALE# = 1/60 : ZEROX = 160\\n20 ZEROY = 100 : MAXIT = 32\\n30 SCREEN 1\\n40 FOR X = 0 TO 2*ZEROX - 1\\n50 CR# = (X-ZEROX)*SCALE#\\n60 FOR Y = 0 TO ZEROY\\n70 CI# = (ZEROY-Y)*SCALE#\\n80 ZR# = 0\\n90 ZI# = 0\\n100 FOR I = 1 TO MAXIT\\n110 BR# = CR# + ZR#*ZR# - ZI#*ZI#\\n120 ZI# = CI# + 2*ZR#*ZI#\\n130 ZR# = BR#\\n140 IF ZR#*ZR# + ZI#*ZI# > 4 THEN GOTO 170\\n150 NEXT I\\n160 GOTO 190\\n170 PSET (X, Y), 1 + (I MOD 3)\\n180 PSET (X, 2*ZEROY-Y), 1+(I MOD 3)\\n190 NEXT Y\\n200 NEXT X\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \"use fmt;\\nuse math;\\n\\ntype complex = struct {\\n\\tre: f64,\\n\\tim: f64\\n};\\n\\nexport fn main() void = {\\n\\tfor (let y = -1.2; y < 1.2; y += 0.05) {\\n\\t\\tfor (let x = -2.05; x < 0.55; x += 0.03) {\\n\\t\\t\\tlet z = complex {re = 0.0, im = 0.0};\\n\\n\\t\\t\\tfor (let m = 0z; m < 100; m += 1) {\\n\\t\\t\\t\\tlet tz = z;\\n\\n\\t\\t\\t\\tz.re = tz.re*tz.re - tz.im*tz.im;\\n\\t\\t\\t\\tz.im = tz.re*tz.im + tz.im*tz.re;\\n\\t\\t\\t\\tz.re += x;\\n\\t\\t\\t\\tz.im += y;\\n\\t\\t\\t};\\n\\t\\t\\tfmt::print(if (abs(z) < 2f64) '#' else '.')!;\\n\\t\\t};\\n\\t\\tfmt::println()!;\\n\\t};\\n};\\n\\nfn abs(z: complex) f64 = {\\n\\treturn math::sqrtf64(z.re*z.re + z.im*z.im);\\n};\\n\",\n \"language\": \"Hare\"\n },\n {\n \"code\": \"import Data.Bool ( bool )\\nimport Data.Complex (Complex ((:+)), magnitude)\\n\\nmandelbrot :: RealFloat a => Complex a -> Complex a\\nmandelbrot a = iterate ((a +) . (^ 2)) 0 !! 50\\n\\nmain :: IO ()\\nmain =\\n mapM_\\n putStrLn\\n [ [ bool ' ' '*' (2 > magnitude (mandelbrot (x :+ y)))\\n | x <- [-2, -1.9685 .. 0.5]\\n ]\\n | y <- [1, 0.95 .. -1]\\n ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"-- first attempt\\n-- putStrLn $ foldr (++) \\\"\\\" [ if x==(-2) then \\\"\\\\n\\\" else let (a, b) = iterate (\\\\(x', y') -> (x'^2-y'^2+x, 2*x'*y'+y)) (0, 0) !! 500 in (snd.head.filter (\\\\(v, c)->v) $ zip ([(<0.01), (<0.025), (<0.05), (<0.1), (<0.5), (<1), (<4), (\\\\_ -> True)] <*> [a^2 + b^2]) [\\\".\\\", \\\"\\\\'\\\", \\\":\\\", \\\"!\\\", \\\"|\\\", \\\"}\\\", \\\"#\\\", \\\" \\\"]) | y <- [1, 0.98 .. -1], x <- [-2, -1.98 .. 0.5]]\\n\\n-- replaced iterate with foldr, modified the snd.head part and a introduced a check to stop the magnitude from exploding\\n-- foldr(>>)(return())[putStrLn[let(a,b)=foldr(\\\\_(u,w)->if(u^2+w^2<4)then(u^2-w^2+x,2*u*w+y)else(u,w))(0,0)[1..500]in snd.last$(filter(\\\\(f,v)->f)$zip(map(a^2+b^2>)[0,0.01,0.025,0.05,0.1,0.5,1,4])['.','\\\\'',':','!','|','}','#',' '])|x<-[-2,-1.98..0.5]]|y<-[1,0.98.. -1]]\\n\\n-- without different characters in the output\\n-- foldr(>>)(return())[putStrLn[let(a,b)=foldr(\\\\_(u,w)->(u^2-w^2+x,2*u*w+y))(0,0)[1..500]in if a^2+b^2<4 then '*' else ' '|x<-[-2,-1.98..0.5]]|y<-[1,0.98.. -1]]\\n\\n-- using mapM_ instead of foldr, bind operator instead of list comprehension and replacing 'let' with a lambda function\\n -- mapM_ putStrLn $[1,0.98.. -1]>>= \\\\y->return $[-2,-1.98..0.5]>>= \\\\x->return (if(\\\\(a,b)->a^2+b^2<4)(foldr(\\\\_(u,w)->(u^2-w^2+x,2*u*w+y))(0,0)[1..500]) then '*' else ' ')\\n\\n-- open GHCI > Copy and paste any of above one-liners > Hit enter\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"main :: IO ()\\nmain =\\n putStrLn $\\n concat\\n [ go x y\\n | y <- [1, 0.98 .. -1],\\n x <- [-2, -1.98 .. 0.5]\\n ]\\n where\\n go x y\\n | x == (-2) = \\\"\\\\n\\\"\\n | otherwise =\\n let (a, b) =\\n iterate\\n (\\\\(x', y') -> (x' ^ 2 - y' ^ 2 + x, 2 * x' * y' + y))\\n (0, 0)\\n !! 500\\n in ( snd . head . filter fst $\\n zip\\n ( [ (< 0.01),\\n (< 0.025),\\n (< 0.05),\\n (< 0.1),\\n (< 0.5),\\n (< 1),\\n (< 4),\\n const True\\n ]\\n <*> [a ^ 2 + b ^ 2]\\n )\\n [\\\".\\\", \\\"\\\\'\\\", \\\":\\\", \\\"!\\\", \\\"|\\\", \\\"}\\\", \\\"#\\\", \\\" \\\"]\\n )\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"main :: IO ()\\nmain =\\n mapM_\\n putStrLn\\n $ [1, 0.98 .. -1]\\n >>= \\\\y ->\\n [ [-2, -1.98 .. 0.5]\\n >>= \\\\x ->\\n [ if (\\\\(a, b) -> a ^ 2 + b ^ 2 < 4)\\n ( foldr\\n ( \\\\_ (u, w) ->\\n (u ^ 2 - w ^ 2 + x, 2 * u * w + y)\\n )\\n (0, 0)\\n [1 .. 500]\\n )\\n then '*'\\n else ' '\\n ]\\n ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"haxe -swf mandelbrot.swf -main Mandelbrot\\n\",\n \"language\": \"Haxe\"\n },\n {\n \"code\": \"class Mandelbrot extends flash.display.Sprite\\n{\\n inline static var MAX_ITER = 255;\\n\\n public static function main() {\\n var w = flash.Lib.current.stage.stageWidth;\\n var h = flash.Lib.current.stage.stageHeight;\\n var mandelbrot = new Mandelbrot(w, h);\\n flash.Lib.current.stage.addChild(mandelbrot);\\n mandelbrot.drawMandelbrot();\\n }\\n\\n var image:flash.display.BitmapData;\\n public function new(width, height) {\\n super();\\n var bitmap:flash.display.Bitmap;\\n image = new flash.display.BitmapData(width, height, false);\\n bitmap = new flash.display.Bitmap(image);\\n this.addChild(bitmap);\\n }\\n\\n public function drawMandelbrot() {\\n image.lock();\\n var step_x = 3.0 / (image.width-1);\\n var step_y = 2.0 / (image.height-1);\\n for (i in 0...image.height) {\\n var ci = i * step_y - 1.0;\\n for (j in 0...image.width) {\\n var k = 0;\\n var zr = 0.0;\\n var zi = 0.0;\\n var cr = j * step_x - 2.0;\\n while (k <= MAX_ITER && (zr*zr + zi*zi) <= 4) {\\n var temp = zr*zr - zi*zi + cr;\\n zi = 2*zr*zi + ci;\\n zr = temp;\\n k ++;\\n }\\n paint(j, i, k);\\n }\\n }\\n image.unlock();\\n }\\n\\n inline function paint(x, y, iter) {\\n var color = iter > MAX_ITER? 0 : iter * 0x100;\\n image.setPixel(x, y, color);\\n }\\n}\\n\",\n \"language\": \"Haxe\"\n },\n {\n \"code\": \"#! /bin/sh\\nexec huginn -E \\\"${0}\\\" \\\"${@}\\\"\\n#! huginn\\n\\nimport Algorithms as algo;\\nimport Mathematics as math;\\nimport Terminal as term;\\n\\nmandelbrot( x, y ) {\\n c = math.Complex( x, y );\\n z = math.Complex( 0., 0. );\\n s = -1;\\n for ( i : algo.range( 50 ) ) {\\n z = z * z + c;\\n if ( | z | > 2. ) {\\n s = i;\\n break;\\n }\\n }\\n return ( s );\\n}\\n\\nmain( argv_ ) {\\n imgSize = term_size( argv_ );\\n yRad = 1.2;\\n yScale = 2. * yRad / real( imgSize[0] );\\n xScale = 3.3 / real( imgSize[1] );\\n glyphTab = [ \\\".\\\", \\\":\\\", \\\"-\\\", \\\"+\\\", \\\"+\\\" ].resize( 12, \\\"*\\\" ).resize( 26, \\\"%\\\" ).resize( 50, \\\"@\\\" ).push( \\\" \\\" );\\n for ( y : algo.range( imgSize[0] ) ) {\\n line = \\\"\\\";\\n for ( x : algo.range( imgSize[1] ) ) {\\n line += glyphTab[ mandelbrot( xScale * real( x ) - 2.3, yScale * real( y ) - yRad ) ];\\n }\\n print( line + \\\"\\\\n\\\" );\\n }\\n return ( 0 );\\n}\\n\\nterm_size( argv_ ) {\\n lines = 25;\\n columns = 80;\\n if ( size( argv_ ) == 3 ) {\\n lines = integer( argv_[1] );\\n columns = integer( argv_[2] );\\n } else {\\n lines = term.lines();\\n columns = term.columns();\\n if ( ( lines % 2 ) == 0 ) {\\n lines -= 1;\\n }\\n }\\n lines -= 1;\\n columns -= 1;\\n return ( ( lines, columns ) );\\n}\\n\",\n \"language\": \"Huginn\"\n },\n {\n \"code\": \"link graphics\\n\\nprocedure main()\\n width := 750\\n height := 600\\n limit := 100\\n WOpen(\\\"size=\\\"||width||\\\",\\\"||height)\\n every x:=1 to width & y:=1 to height do\\n {\\n z:=complex(0,0)\\n c:=complex(2.5*x/width-2.0,(2.0*y/height-1.0))\\n j:=0\\n while j<limit & cAbs(z)<2.0 do\\n {\\n z := cAdd(cMul(z,z),c)\\n j+:= 1\\n }\\n Fg(mColor(j,limit))\\n DrawPoint(x,y)\\n }\\n WriteImage(\\\"./mandelbrot.gif\\\")\\n WDone()\\nend\\n\\nprocedure mColor(x,limit)\\n max_color := 2^16-1\\n color := integer(max_color*(real(x)/limit))\\n\\n return(if x=limit\\n then \\\"black\\\"\\n else color||\\\",\\\"||color||\\\",0\\\")\\nend\\n\\nrecord complex(r,i)\\n\\nprocedure cAdd(x,y)\\n return complex(x.r+y.r,x.i+y.i)\\nend\\n\\nprocedure cMul(x,y)\\n return complex(x.r*y.r-x.i*y.i,x.r*y.i+x.i*y.r)\\nend\\n\\nprocedure cAbs(x)\\n return sqrt(x.r*x.r+x.i*x.i)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"PRO Mandelbrot,xRange,yRange,xPixels,yPixels,iterations\\n\\nxPixelstartVec = Lindgen( xPixels) * Float(xRange[1]-xRange[0]) / $\\n xPixels + xRange[0]\\nyPixelstartVec = Lindgen( yPixels) * Float(YRANGE[1]-yrange[0])$\\n / yPixels + yRange[0]\\n\\nconstArr = Complex( Rebin( xPixelstartVec, xPixels, yPixels),$\\n Rebin( Transpose(yPixelstartVec), xPixels, yPixels))\\n\\nvalArr = ComplexArr( xPixels, yPixels)\\n\\nres = IntArr( xPixels, yPixels)\\n\\noriIndex = Lindgen( Long(xPixels) * yPixels)\\n\\nFOR i = 0, iterations-1 DO BEGIN ; only one loop needed\\n\\n ; calculation for whole array at once\\n valArr = valArr^2 - constArr\\n\\n whereIn = Where( Abs( valArr) LE 4.0d, COMPLEMENT=whereOut)\\n\\n IF whereIn[0] EQ -1 THEN BREAK\\n\\n valArr = valArr[ whereIn]\\n\\n constArr = constArr[ whereIn]\\n\\n IF whereOut[0] NE -1 THEN BEGIN\\n\\n res[ oriIndex[ whereOut]] = i+1\\n\\n oriIndex = oriIndex[ whereIn]\\n ENDIF\\nENDFOR\\n\\ntv,res ; open a window and show the result\\n\\nEND\\n\\n\\nMandelbrot,[-1.,2.3],[-1.3,1.3],640,512,200\\n\\nEND\\n\",\n \"language\": \"IDL\"\n },\n {\n \"code\": \"GDL>.run mandelbrot\\n\",\n \"language\": \"IDL\"\n },\n {\n \"code\": \"GDL> Mandelbrot,[-1.,2.3],[-1.3,1.3],640,512,200\\n\",\n \"language\": \"IDL\"\n },\n {\n \"code\": \"\\\"Mandelbrot\\\"\\n\\nThe story headline is \\\"A Non-Interactive Set\\\".\\n\\nInclude Glimmr Drawing Commands by Erik Temple.\\n\\n[Q20 fixed-point or floating-point: see definitions below]\\nUse floating-point math.\\n\\nFinished is a room.\\n\\nThe graphics-window is a graphics g-window spawned by the main-window.\\nThe position is g-placeabove.\\n\\nWhen play begins:\\n\\tlet f10 be 10 as float;\\n\\tnow min re is ( -20 as float ) fdiv f10;\\n\\tnow max re is ( 6 as float ) fdiv f10;\\n\\tnow min im is ( -12 as float ) fdiv f10;\\n\\tnow max im is ( 12 as float ) fdiv f10;\\n\\tnow max iterations is 100;\\n\\tadd color g-Black to the palette;\\n\\tadd color g-Red to the palette;\\n\\tadd hex \\\"#FFA500\\\" to the palette;\\n\\tadd color g-Yellow to the palette;\\n\\tadd color g-Green to the palette;\\n\\tadd color g-Blue to the palette;\\n\\tadd hex \\\"#4B0082\\\" to the palette;\\n\\tadd hex \\\"#EE82EE\\\" to the palette;\\n\\topen up the graphics-window.\\n\\nMin Re is a number that varies.\\nMax Re is a number that varies.\\nMin Im is a number that varies.\\nMax Im is a number that varies.\\n\\nMax Iterations is a number that varies.\\n\\nMin X is a number that varies.\\nMax X is a number that varies.\\nMin Y is a number that varies.\\nMax Y is a number that varies.\\n\\nThe palette is a list of numbers that varies.\\n\\n[vertically mirrored version]\\nWindow-drawing rule for the graphics-window when max im is fneg min im:\\n\\tclear the graphics-window;\\n\\tlet point be { 0, 0 };\\n\\tnow min X is 0 as float;\\n\\tnow min Y is 0 as float;\\n\\tlet mX be the width of the graphics-window minus 1;\\n\\tlet mY be the height of the graphics-window minus 1;\\n\\tnow max X is mX as float;\\n\\tnow max Y is mY as float;\\n\\tlet L be the column order with max mX;\\n\\trepeat with X running through L:\\n\\t\\tnow entry 1 in point is X;\\n\\t\\trepeat with Y running from 0 to mY / 2:\\n\\t\\t\\tnow entry 2 in point is Y;\\n\\t\\t\\tlet the scaled point be the complex number corresponding to the point;\\n\\t\\t\\tlet V be the Mandelbrot result for the scaled point;\\n\\t\\t\\tlet C be the color corresponding to V;\\n\\t\\t\\tif C is 0, next;\\n\\t\\t\\tdraw a rectangle (C) in the graphics-window at the point with size 1 by 1;\\n\\t\\t\\tnow entry 2 in point is mY - Y;\\n\\t\\t\\tdraw a rectangle (C) in the graphics-window at the point with size 1 by 1;\\n\\t\\tyield to VM;\\n\\trule succeeds.\\n\\n[slower non-mirrored version]\\nWindow-drawing rule for the graphics-window:\\n\\tclear the graphics-window;\\n\\tlet point be { 0, 0 };\\n\\tnow min X is 0 as float;\\n\\tnow min Y is 0 as float;\\n\\tlet mX be the width of the graphics-window minus 1;\\n\\tlet mY be the height of the graphics-window minus 1;\\n\\tnow max X is mX as float;\\n\\tnow max Y is mY as float;\\n\\tlet L be the column order with max mX;\\n\\trepeat with X running through L:\\n\\t\\tnow entry 1 in point is X;\\n\\t\\trepeat with Y running from 0 to mY:\\n\\t\\t\\tnow entry 2 in point is Y;\\n\\t\\t\\tlet the scaled point be the complex number corresponding to the point;\\n\\t\\t\\tlet V be the Mandelbrot result for the scaled point;\\n\\t\\t\\tlet C be the color corresponding to V;\\n\\t\\t\\tif C is 0, next;\\n\\t\\t\\tdraw a rectangle (C) in the graphics-window at the point with size 1 by 1;\\n\\t\\tyield to VM;\\n\\trule succeeds.\\n\\nTo decide which list of numbers is column order with max (N - number):\\n\\tlet L be a list of numbers;\\n\\tlet L2 be a list of numbers;\\n\\tlet D be 64;\\n\\tlet rev be false;\\n\\twhile D > 0:\\n\\t\\tlet X be 0;\\n\\t\\ttruncate L2 to 0 entries;\\n\\t\\twhile X <= N:\\n\\t\\t\\tif D is 64 or X / D is odd, add X to L2;\\n\\t\\t\\tincrease X by D;\\n\\t\\tif rev is true:\\n\\t\\t\\treverse L2;\\n\\t\\t\\tlet rev be false;\\n\\t\\totherwise:\\n\\t\\t\\tlet rev be true;\\n\\t\\tadd L2 to L;\\n\\t\\tlet D be D / 2;\\n\\tdecide on L.\\n\\nTo decide which list of numbers is complex number corresponding to (P - list of numbers):\\n\\tlet R be a list of numbers;\\n\\textend R to 2 entries;\\n\\tlet X be entry 1 in P as float;\\n\\tlet X be (max re fsub min re) fmul (X fdiv max X);\\n\\tlet X be X fadd min re;\\n\\tlet Y be entry 2 in P as float;\\n\\tlet Y be (max im fsub min im) fmul (Y fdiv max Y);\\n\\tlet Y be Y fadd min im;\\n\\tnow entry 1 in R is X;\\n\\tnow entry 2 in R is Y;\\n\\tdecide on R.\\n\\nTo decide which number is Mandelbrot result for (P - list of numbers):\\n\\tlet c_re be entry 1 in P;\\n\\tlet c_im be entry 2 in P;\\n\\tlet z_re be 0 as float;\\n\\tlet z_im be z_re;\\n\\tlet threshold be 4 as float;\\n\\tlet runs be 0;\\n\\twhile 1 is 1:\\n\\t\\t[ z = z * z ]\\n\\t\\tlet r2 be z_re fmul z_re;\\n\\t\\tlet i2 be z_im fmul z_im;\\n\\t\\tlet ri be z_re fmul z_im;\\n\\t\\tlet z_re be r2 fsub i2;\\n\\t\\tlet z_im be ri fadd ri;\\n\\t\\t[ z = z + c ]\\n\\t\\tlet z_re be z_re fadd c_re;\\n\\t\\tlet z_im be z_im fadd c_im;\\n\\t\\tlet norm be (z_re fmul z_re) fadd (z_im fmul z_im);\\n\\t\\tincrease runs by 1;\\n\\t\\tif norm is greater than threshold, decide on runs;\\n\\t\\tif runs is max iterations, decide on 0.\\n\\nTo decide which number is color corresponding to (V - number):\\n\\tlet L be the number of entries in the palette;\\n\\tlet N be the remainder after dividing V by L;\\n\\tdecide on entry (N + 1) in the palette.\\n\\nSection - Fractional numbers (for Glulx only)\\n\\nTo decide which number is (N - number) as float: (- (numtof({N})) -).\\nTo decide which number is (N - number) fadd (M - number): (- (fadd({N}, {M})) -).\\nTo decide which number is (N - number) fsub (M - number): (- (fsub({N}, {M})) -).\\nTo decide which number is (N - number) fmul (M - number): (- (fmul({N}, {M})) -).\\nTo decide which number is (N - number) fdiv (M - number): (- (fdiv({N}, {M})) -).\\nTo decide which number is fneg (N - number): (- (fneg({N})) -).\\nTo yield to VM: (- glk_select_poll(gg_event); -).\\n\\nUse Q20 fixed-point math translates as (- Constant Q20_MATH; -).\\nUse floating-point math translates as (- Constant FLOAT_MATH; -).\\n\\nInclude (-\\n#ifdef Q20_MATH;\\n! Q11.20 format: 1 sign bit, 11 integer bits, 20 fraction bits\\n[ numtof n r; @shiftl n 20 r; return r; ];\\n[ fadd n m; return n+m; ];\\n[ fsub n m; return n-m; ];\\n[ fmul n m; n = n + $$1000000000; @sshiftr n 10 n; m = m + $$1000000000; @sshiftr m 10 m; return n * m; ];\\n[ fdiv n m; @sshiftr m 20 m; return n / m; ];\\n[ fneg n; return -n; ];\\n#endif;\\n\\n#ifdef FLOAT_MATH;\\n[ numtof f; @\\\"S2:400\\\" f f; return f; ];\\n[ fadd n m; @\\\"S3:416\\\" n m n; return n; ];\\n[ fsub n m; @\\\"S3:417\\\" n m n; return n; ];\\n[ fmul n m; @\\\"S3:418\\\" n m n; return n; ];\\n[ fdiv n m; @\\\"S3:419\\\" n m n; return n; ];\\n[ fneg n; @bitxor n $80000000 n; return n; ];\\n#endif;\\n-).\\n\",\n \"language\": \"Inform-7\"\n },\n {\n \"code\": \"(function mandelbrot width height depth\\n (.. str\\n (for yy (range height)\\n xx (range width)\\n (let c_re (/ (* (- xx (/ width 2)) 4) width)\\n c_im (/ (* (- yy (/ height 2)) 4) width)\\n x 0 y 0 i 0)\\n (while (and (<= (+ (** x) (** y)) 4)\\n (< i depth))\\n (let x2 (+ c_re (- (** x) (** y)))\\n y (+ c_im (* 2 x y))\\n x x2\\n i (inc i)))\\n (strn ((zero? xx) \\\"\\\\n\\\") (i \\\"ABCDEFGHIJ \\\")))))\\n\\n(mandelbrot 48 24 10)\\n\",\n \"language\": \"Inform-7\"\n },\n {\n \"code\": \"mcf=. (<: 2:)@|@(] ((*:@] + [)^:((<: 2:)@|@])^:1000) 0:) NB. 1000 iterations test\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"domain=. |.@|:@({.@[ + ] *~ j./&i.&>/@+.@(1j1 + ] %~ -~/@[))&>/\\n\\nload 'viewmat'\\nviewmat mcf \\\"0 @ domain (_2j_1 1j1) ; 0.01 NB. Complex interval and resolution\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" viewmat mcf \\\"0 @ domain (_2j_1 1j1) ; 0.1 NB. Complex interval and resolution\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.awt.Graphics;\\nimport java.awt.image.BufferedImage;\\nimport javax.swing.JFrame;\\n\\npublic class Mandelbrot extends JFrame {\\n\\n private final int MAX_ITER = 570;\\n private final double ZOOM = 150;\\n private BufferedImage I;\\n private double zx, zy, cX, cY, tmp;\\n\\n public Mandelbrot() {\\n super(\\\"Mandelbrot Set\\\");\\n setBounds(100, 100, 800, 600);\\n setResizable(false);\\n setDefaultCloseOperation(EXIT_ON_CLOSE);\\n I = new BufferedImage(getWidth(), getHeight(), BufferedImage.TYPE_INT_RGB);\\n for (int y = 0; y < getHeight(); y++) {\\n for (int x = 0; x < getWidth(); x++) {\\n zx = zy = 0;\\n cX = (x - 400) / ZOOM;\\n cY = (y - 300) / ZOOM;\\n int iter = MAX_ITER;\\n while (zx * zx + zy * zy < 4 && iter > 0) {\\n tmp = zx * zx - zy * zy + cX;\\n zy = 2.0 * zx * zy + cY;\\n zx = tmp;\\n iter--;\\n }\\n I.setRGB(x, y, iter | (iter << 8));\\n }\\n }\\n }\\n\\n @Override\\n public void paint(Graphics g) {\\n g.drawImage(I, 0, 0, this);\\n }\\n\\n public static void main(String[] args) {\\n new Mandelbrot().setVisible(true);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import static java.awt.Color.HSBtoRGB;\\nimport static java.awt.Color.black;\\nimport static java.awt.event.KeyEvent.VK_BACK_SLASH;\\nimport static java.awt.event.KeyEvent.VK_ESCAPE;\\nimport static java.awt.image.BufferedImage.TYPE_INT_RGB;\\nimport static java.lang.Integer.signum;\\nimport static java.lang.Math.abs;\\nimport static java.lang.Math.max;\\nimport static java.lang.Math.min;\\nimport static java.lang.System.currentTimeMillis;\\nimport static java.util.Locale.ROOT;\\n\\nimport java.awt.Dimension;\\nimport java.awt.Graphics;\\nimport java.awt.Insets;\\nimport java.awt.event.KeyAdapter;\\nimport java.awt.event.KeyEvent;\\nimport java.awt.event.MouseAdapter;\\nimport java.awt.event.MouseEvent;\\nimport java.awt.image.BufferedImage;\\nimport java.util.function.Consumer;\\nimport java.util.function.Predicate;\\n\\nimport javax.swing.JFrame;\\n\\n/*\\n * click: point to center\\n * ctrl-click: point to origin\\n * drag: point to mouse release point\\n * ctrl-drag: point to origin + zoom\\n * back-slash: back to previous point\\n * esc: back to previous zoom point - zoom\\n */\\n\\npublic class Mandelbrot extends JFrame {\\n\\tprivate static final long serialVersionUID = 1L;\\n\\t\\n\\tprivate Insets insets;\\n\\tprivate int width, height;\\n\\tprivate double widthHeightRatio;\\n\\tprivate int minX, minY;\\n\\tprivate double Zoom;\\n\\t\\t\\n\\tprivate int mpX, mpY, mdX, mdY;\\n\\tprivate boolean isCtrlDown, ctrl;\\n\\tprivate Stack stack = new Stack();\\n\\t\\n\\tprivate BufferedImage image;\\n\\tprivate boolean newImage = true;\\n\\t\\n\\tpublic static void main(String[] args) {\\n\\t\\tnew Mandelbrot(800, 600); // (800, 600), (1024, 768), (1600, 900), (1920, 1080)\\n\\t\\t//new Mandelbrot(800, 600, 4.5876514379235943e-09, -0.6092161175392330, -0.4525577210859453);\\n\\t\\t//new Mandelbrot(800, 600, 5.9512354925205320e-10, -0.6092146769531246, -0.4525564820098262);\\n\\t\\t//new Mandelbrot(800, 600, 6.7178527589983420e-08, -0.7819036465400592, -0.1298363433443265);\\n\\t\\t//new Mandelbrot(800, 600, 4.9716091454775210e-09, -0.7818800036717134, -0.1298044093748981);\\n\\t\\t//new Mandelbrot(800, 600, 7.9333341281639390e-06, -0.7238770725243187, -0.2321214232559487);\\n\\t\\t/*\\n\\t\\tnew Mandelbrot(800, 600, new double[][] {\\n\\t\\t\\t{5.0000000000000000e-03, -2.6100000000000000, -1.4350000000000000}, // done!\\n\\t\\t\\t{3.5894206549118390e-04, -0.7397795969773300, -0.4996473551637279}, // done!\\n\\t\\t\\t{3.3905106941862460e-05, -0.6270410477828043, -0.4587021918164572}, // done!\\n\\t\\t\\t{6.0636337351945460e-06, -0.6101531446039512, -0.4522561221394852}, // done!\\n\\t\\t\\t{1.5502741161769430e-06, -0.6077214060084073, -0.4503995886987711}, // done!\\n\\t\\t});\\n\\t\\t//*/\\n\\t}\\n\\t\\n\\tpublic Mandelbrot(int width, int height) {\\n\\t\\tthis(width, height, .005, -2.61, -1.435);\\n\\t}\\n\\t\\n\\tpublic Mandelbrot(int width, int height, double Zoom, double r, double i) {\\n\\t\\tthis(width, height, new double[] {Zoom, r, i});\\n\\t}\\n\\t\\n\\tpublic Mandelbrot(int width, int height, double[] ... points) {\\n\\t\\tsuper(\\\"Mandelbrot Set\\\");\\n\\t\\tsetResizable(false);\\n\\t\\tsetDefaultCloseOperation(EXIT_ON_CLOSE);\\n\\t\\tDimension screen = getToolkit().getScreenSize();\\n\\t\\tsetBounds(\\n\\t\\t\\trint((screen.getWidth() - width) / 2),\\n\\t\\t\\trint((screen.getHeight() - height) / 2),\\n\\t\\t\\twidth,\\n\\t\\t\\theight\\n\\t\\t);\\n\\t\\taddMouseListener(mouseAdapter);\\n\\t\\taddMouseMotionListener(mouseAdapter);\\n\\t\\taddKeyListener(keyAdapter);\\n\\t\\tPoint point = stack.push(points);\\n\\t\\tthis.Zoom = point.Zoom;\\n\\t\\tthis.minX = point.minX;\\n\\t\\tthis.minY = point.minY;\\n\\t\\tsetVisible(true);\\n\\t\\tinsets = getInsets();\\n\\t\\tthis.width = width -= insets.left + insets.right;\\n\\t\\tthis.height = height -= insets.top + insets.bottom;\\n\\t\\twidthHeightRatio = (double) width / height;\\n\\t}\\n\\t\\n\\tprivate int rint(double d) {\\n\\t\\treturn (int) Math.rint(d); // half even\\n\\t}\\n\\n\\tprivate void repaint(boolean newImage) {\\n\\t\\tthis.newImage = newImage;\\n\\t\\trepaint();\\n\\t}\\n\\n\\tprivate MouseAdapter mouseAdapter = new MouseAdapter() {\\n\\t\\tpublic void mouseClicked(MouseEvent e) {\\n\\t\\t\\tstack.push(false);\\n\\t\\t\\tif (!ctrl) {\\n\\t\\t\\t\\tminX -= width / 2 ;\\n\\t\\t\\t\\tminY -= height / 2;\\n\\t\\t\\t}\\n\\t\\t\\tminX += e.getX() - insets.left;\\n\\t\\t\\tminY += e.getY() - insets.top;\\n\\t\\t\\tctrl = false;\\n\\t\\t\\trepaint(true);\\n\\t \\t}\\n\\t\\tpublic void mousePressed(MouseEvent e) {\\n\\t\\t\\tmpX = e.getX();\\n\\t\\t\\tmpY = e.getY();\\n\\t\\t\\tctrl = isCtrlDown;\\n\\t\\t}\\n\\t\\tpublic void mouseDragged(MouseEvent e) {\\n\\t\\t\\tif (!ctrl) return;\\n\\t\\t\\tsetMdCoord(e);\\n\\t\\t\\trepaint();\\n\\t\\t}\\n\\t\\tprivate void setMdCoord(MouseEvent e) {\\n\\t\\t\\tint dx = e.getX() - mpX;\\n\\t\\t\\tint dy = e.getY() - mpY;\\n\\t\\t\\tmdX = mpX + max(abs(dx), rint(abs(dy) * widthHeightRatio) * signum(dx));\\n\\t\\t\\tmdY = mpY + max(abs(dy), rint(abs(dx) / widthHeightRatio) * signum(dy));\\n\\t\\t\\tacceptIf(insets.left, ge(mdX), setMdXY);\\n\\t\\t\\tacceptIf(insets.top, ge(mdY), setMdYX);\\n\\t\\t\\tacceptIf(insets.left+width-1, le(mdX), setMdXY);\\n\\t\\t\\tacceptIf(insets.top+height-1, le(mdY), setMdYX);\\n\\t\\t}\\n\\t\\tprivate void acceptIf(int value, Predicate<Integer> p, Consumer<Integer> c) { if (p.test(value)) c.accept(value); }\\n\\t\\tprivate Predicate<Integer> ge(int md) { return v-> v >= md; }\\n\\t\\tprivate Predicate<Integer> le(int md) { return v-> v <= md; }\\n\\t\\tprivate Consumer<Integer> setMdXY = v-> mdY = mpY + rint(abs((mdX=v)-mpX) / widthHeightRatio) * signum(mdY-mpY);\\n\\t\\tprivate Consumer<Integer> setMdYX = v-> mdX = mpX + rint(abs((mdY=v)-mpY) * widthHeightRatio) * signum(mdX-mpX);\\n\\t\\tpublic void mouseReleased(MouseEvent e) {\\n\\t\\t\\tif (e.getX() == mpX && e.getY() == mpY) return;\\n\\t\\t\\tstack.push(ctrl);\\n\\t\\t\\tif (!ctrl) {\\n\\t\\t\\t\\tminX += mpX - (mdX = e.getX());\\n\\t\\t\\t\\tminY += mpY - (mdY = e.getY());\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tsetMdCoord(e);\\n\\t\\t\\t\\tif (mdX < mpX) { int t=mpX; mpX=mdX; mdX=t; }\\n\\t\\t\\t\\tif (mdY < mpY) { int t=mpY; mpY=mdY; mdY=t; }\\n\\t\\t\\t\\tminX += mpX - insets.left;\\n\\t\\t\\t\\tminY += mpY - insets.top;\\n\\t\\t\\t\\tdouble rZoom = (double) width / abs(mdX - mpX);\\n\\t\\t\\t\\tminX *= rZoom;\\n\\t\\t\\t\\tminY *= rZoom;\\n\\t\\t\\t\\tZoom /= rZoom;\\n\\t\\t\\t}\\n\\t\\t\\tctrl = false;\\n\\t\\t\\trepaint(true);\\t\\t\\n\\t\\t}\\n\\t};\\n\\t\\n\\tprivate KeyAdapter keyAdapter = new KeyAdapter() {\\n\\t\\tpublic void keyPressed(KeyEvent e) {\\n\\t\\t\\tisCtrlDown = e.isControlDown();\\n\\t\\t}\\n\\t\\tpublic void keyReleased(KeyEvent e) {\\n\\t\\t\\tisCtrlDown = e.isControlDown();\\n\\t\\t}\\n\\t\\tpublic void keyTyped(KeyEvent e) {\\n\\t\\t\\tchar c = e.getKeyChar();\\n\\t\\t\\tboolean isEsc = c == VK_ESCAPE;\\n\\t\\t\\tif (!isEsc && c != VK_BACK_SLASH) return;\\n\\t\\t\\trepaint(stack.pop(isEsc));\\n\\t\\t}\\n\\t};\\n\\t\\n\\tprivate class Point {\\n\\t\\tpublic boolean type;\\n\\t\\tpublic double Zoom;\\n\\t\\tpublic int minX;\\n\\t\\tpublic int minY;\\n\\t\\tPoint(boolean type, double Zoom, int minX, int minY) {\\n\\t\\t\\tthis.type = type;\\n\\t\\t\\tthis.Zoom = Zoom;\\n\\t\\t\\tthis.minX = minX;\\n\\t\\t\\tthis.minY = minY;\\n\\t\\t}\\n\\t}\\n\\tprivate class Stack extends java.util.Stack<Point> {\\n\\t\\tprivate static final long serialVersionUID = 1L;\\n\\t\\tpublic Point push(boolean type) {\\n\\t\\t\\treturn push(type, Zoom, minX, minY);\\n\\t\\t}\\n\\t\\tpublic Point push(boolean type, double ... point) {\\n\\t\\t\\tdouble Zoom = point[0];\\n\\t\\t\\treturn push(type, Zoom, rint(point[1]/Zoom), rint(point[2]/Zoom));\\n\\t\\t}\\n\\t\\tpublic Point push(boolean type, double Zoom, int minX, int minY) {\\n\\t\\t\\treturn push(new Point(type, Zoom, minX, minY));\\n\\t\\t}\\n\\t\\tpublic Point push(double[] ... points) {\\n\\t\\t\\tPoint lastPoint = push(false, points[0]);\\n\\t\\t\\tfor (int i=0, e=points.length-1; i<e; i+=1) {\\n\\t\\t\\t\\tdouble[] point = points[i];\\n\\t\\t\\t\\tlastPoint = push(point[0] != points[i+1][0], point);\\n\\t\\t\\t\\tdone(printPoint(lastPoint));\\n\\t\\t\\t}\\n\\t\\t\\treturn lastPoint;\\n\\t\\t}\\n\\t\\tpublic boolean pop(boolean type) {\\n\\t\\t\\tfor (;;) {\\n\\t\\t\\t\\tif (empty()) return false;\\n\\t\\t\\t\\tPoint d = super.pop();\\n\\t\\t\\t\\tZoom = d.Zoom;\\n\\t\\t\\t\\tminX = d.minX;\\n\\t\\t\\t\\tminY = d.minY;\\n\\t\\t\\t\\tif (!type || d.type) return true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\t@Override\\n\\tpublic void paint(Graphics g) {\\n\\t\\tif (newImage) newImage();\\n\\t\\tg.drawImage(image, insets.left, insets.top, this);\\n\\t\\t//g.drawLine(insets.left+width/2, insets.top+0, insets.left+width/2, insets.top+height);\\n\\t\\t//g.drawLine(insets.left+0, insets.top+height/2, insets.left+width, insets.top+height/2);\\n\\t\\tif (!ctrl) return;\\n\\t\\tg.drawRect(min(mpX, mdX), min(mpY, mdY), abs(mpX - mdX), abs(mpY - mdY));\\n\\t}\\n\\n\\tprivate void newImage() {\\n\\t\\tlong milli = printPoint();\\n\\t\\timage = new BufferedImage(width, height, TYPE_INT_RGB);\\n\\t\\tint maxX = minX + width;\\n\\t\\tint maxY = minY + height;\\n\\t\\tfor (int x = minX; x < maxX; x+=1) {\\n\\t\\t\\tdouble r = x * Zoom;\\n\\t\\t\\tfor (int y = minY; y < maxY; y+=1) {\\n\\t\\t\\t\\tdouble i = y * Zoom;\\n\\t\\t\\t\\t//System.out.printf(\\\"%+f%+fi\\\\n\\\", r, i);\\n\\t\\t\\t\\t// 0f 1/6f 1/3f 1/2f 2/3f 5/6f\\n\\t\\t\\t\\t//straight -> red yellow green cian blue magenta <- reverse\\n\\t\\t\\t\\timage.setRGB(x-minX, y-minY, color(r, i, 360, false, 2/3f));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tnewImage = false;\\n\\t\\tdone(milli);\\n\\t}\\n\\n\\tprivate long printPoint() {\\n\\t\\treturn printPoint(Zoom, minX, minY);\\n\\t}\\n\\tprivate long printPoint(Point point) {\\n\\t\\treturn printPoint(point.Zoom, point.minX, point.minY);\\n\\t}\\n\\tprivate long printPoint(double Zoom, int minX, int minY) {\\n\\t\\treturn printPoint(Zoom, minX*Zoom, minY*Zoom);\\n\\t}\\n\\tprivate long printPoint(Object ... point) {\\n\\t\\tSystem.out.printf(ROOT,\\t\\\"{%.16e, %.16g, %.16g},\\\", point);\\n\\t\\treturn currentTimeMillis();\\n\\t}\\n\\t\\n\\tprivate void done(long milli) {\\n\\t\\tmilli = currentTimeMillis() - milli;\\n\\t\\tSystem.out.println(\\\" // \\\" + milli + \\\"ms done!\\\");\\n\\t}\\n\\n\\tprivate int color(double r0, double i0, int max, boolean straight, float shift) {\\n\\t\\tint n = -1;\\n\\t\\tdouble r=0, i=0, r2=0, i2=0;\\n\\t\\tdo {\\n\\t\\t\\ti = r*(i+i) + i0;\\n\\t\\t\\tr = r2-i2 + r0;\\n\\t\\t\\tr2 = r*r;\\n\\t\\t\\ti2 = i*i;\\n\\t\\t}\\n\\t\\twhile (++n < max && r2 + i2 < 4);\\n\\t\\treturn n == max\\n\\t\\t\\t? black.getRGB()\\n\\t\\t\\t: HSBtoRGB(shift + (float) (straight ? n : max-n) / max * 11/12f + (straight ? 0f : 1/12f), 1, 1)\\n\\t\\t;\\t\\t\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function mandelIter(cx, cy, maxIter) {\\n var x = 0.0;\\n var y = 0.0;\\n var xx = 0;\\n var yy = 0;\\n var xy = 0;\\n\\n var i = maxIter;\\n while (i-- && xx + yy <= 4) {\\n xy = x * y;\\n xx = x * x;\\n yy = y * y;\\n x = xx - yy + cx;\\n y = xy + xy + cy;\\n }\\n return maxIter - i;\\n}\\n\\nfunction mandelbrot(canvas, xmin, xmax, ymin, ymax, iterations) {\\n var width = canvas.width;\\n var height = canvas.height;\\n\\n var ctx = canvas.getContext('2d');\\n var img = ctx.getImageData(0, 0, width, height);\\n var pix = img.data;\\n\\n for (var ix = 0; ix < width; ++ix) {\\n for (var iy = 0; iy < height; ++iy) {\\n var x = xmin + (xmax - xmin) * ix / (width - 1);\\n var y = ymin + (ymax - ymin) * iy / (height - 1);\\n var i = mandelIter(x, y, iterations);\\n var ppos = 4 * (width * iy + ix);\\n\\n if (i > iterations) {\\n pix[ppos] = 0;\\n pix[ppos + 1] = 0;\\n pix[ppos + 2] = 0;\\n } else {\\n var c = 3 * Math.log(i) / Math.log(iterations - 1.0);\\n\\n if (c < 1) {\\n pix[ppos] = 255 * c;\\n pix[ppos + 1] = 0;\\n pix[ppos + 2] = 0;\\n }\\n else if ( c < 2 ) {\\n pix[ppos] = 255;\\n pix[ppos + 1] = 255 * (c - 1);\\n pix[ppos + 2] = 0;\\n } else {\\n pix[ppos] = 255;\\n pix[ppos + 1] = 255;\\n pix[ppos + 2] = 255 * (c - 2);\\n }\\n }\\n pix[ppos + 3] = 255;\\n }\\n }\\n\\n ctx.putImageData(img, 0, 0);\\n}\\n\\nvar canvas = document.createElement('canvas');\\ncanvas.width = 900;\\ncanvas.height = 600;\\n\\ndocument.body.insertBefore(canvas, document.body.childNodes[0]);\\n\\nmandelbrot(canvas, -2, 1, -1, 1, 1000);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"var mandelIter;\\nfetch(\\\"./mandelIter.wasm\\\")\\n .then(res => {\\n if (res.ok) return res.arrayBuffer();\\n throw new Error('Unable to fetch WASM.');\\n })\\n .then(bytes => { return WebAssembly.compile(bytes); })\\n .then(module => { return WebAssembly.instantiate(module); })\\n .then(instance => { WebAssembly.instance = instance; draw(); })\\n\\nfunction mandelbrot(canvas, xmin, xmax, ymin, ymax, iterations) {\\n // ...\\n var i = WebAssembly.instance.exports.mandelIter(x, y, iterations);\\n // ...\\n}\\n\\nfunction draw() {\\n // canvas initialization if necessary\\n // ...\\n mandelbrot(canvas, -2, 1, -1, 1, 1000);\\n // ...\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# SVG STUFF\\n def svg(id; width; height):\\n \\\"<svg width='\\\\(width // \\\"100%\\\")' height='\\\\(height // \\\"100%\\\") '\\n id='\\\\(id)'\\n xmlns='http://www.w3.org/2000/svg'>\\\";\\n\\n def pixel(x;y;r;g;b;a):\\n \\\"<circle cx='\\\\(x)' cy='\\\\(y)' r='1' fill='rgb(\\\\(r|floor),\\\\(g|floor),\\\\(b|floor))' />\\\";\\n\\n# \\\"UNTIL\\\"\\n # As soon as \\\"condition\\\" is true, then emit . and stop:\\n def do_until(condition; next):\\n def u: if condition then . else (next|u) end;\\n u;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def Mandeliter( cx; cy; maxiter ):\\n # [i, x, y, x^2+y^2]\\n [ maxiter, 0.0, 0.0, 0.0 ]\\n | do_until( .[0] == 0 or .[3] > 4;\\n .[1] as $x | .[2] as $y\\n | ($x * $y) as $xy\\n | ($x * $x) as $xx\\n | ($y * $y) as $yy\\n | [ (.[0] - 1), # i\\n ($xx - $yy + cx), # x\\n ($xy + $xy + cy), # y\\n ($xx+$yy) # xx+yy\\n ] )\\n | maxiter - .[0];\\n\\n# width and height should be specified as the number of pixels.\\n# obj == { xmin: _, xmax: _, ymin: _, ymax: _ }\\ndef Mandelbrot( obj; width; height; iterations ):\\n def pixies:\\n range(0; width) as $ix\\n | (obj.xmin + ((obj.xmax - obj.xmin) * $ix / (width - 1))) as $x\\n | range(0; height) as $iy\\n | (obj.ymin + ((obj.ymax - obj.ymin) * $iy / (height - 1))) as $y\\n | Mandeliter( $x; $y; iterations ) as $i\\n | if $i == iterations then\\n pixel($ix; $iy; 0; 0; 0; 255)\\n else\\n (3 * ($i|log)/((iterations - 1.0)|log)) as $c # redness\\n | if $c < 1 then\\n pixel($ix;$iy; 255*$c; 0; 0; 255)\\n elif $c < 2 then\\n pixel($ix;$iy; 255; 255*($c-1); 0; 255)\\n else\\n pixel($ix;$iy; 255; 255; 255*($c-2); 255)\\n end\\n end;\\n\\n svg(\\\"mandelbrot\\\"; \\\"100%\\\"; \\\"100%\\\"),\\n pixies,\\n \\\"</svg>\\\";\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \" Mandelbrot( {\\\"xmin\\\": -2, \\\"xmax\\\": 1, \\\"ymin\\\": -1, \\\"ymax\\\":1}; 900; 600; 1000 )\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function mandelbrot(a)\\n z = 0\\n for i=1:50\\n z = z^2 + a\\n end\\n return z\\nend\\n\\nfor y=1.0:-0.05:-1.0\\n for x=-2.0:0.0315:0.5\\n abs(mandelbrot(complex(x, y))) < 2 ? print(\\\"*\\\") : print(\\\" \\\")\\n end\\n println()\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"using Images\\n\\n@inline function hsv2rgb(h, s, v)\\n c = v * s\\n x = c * (1 - abs(((h/60) % 2) - 1))\\n m = v - c\\n r,g,b = if h < 60 (c, x, 0)\\n elseif h < 120 (x, c, 0)\\n elseif h < 180 (0, c, x)\\n elseif h < 240 (0, x, c)\\n elseif h < 300 (x, 0, c)\\n else (c, 0, x) end\\n (r + m), (b + m), (g + m)\\nend\\n\\nfunction mandelbrot()\\n w = 1600\\n h = 1200\\n zoom = 0.5\\n moveX = -0.5\\n moveY = 0\\n maxIter = 30\\n img = Array{RGB{Float64},2}(undef,h,w)\\n for x in 1:w\\n for y in 1:h\\n i = maxIter\\n z = c = Complex( (2*x - w) / (w * zoom) + moveX,\\n (2*y - h) / (h * zoom) + moveY )\\n while abs(z) < 2 && (i -= 1) > 0\\n z = z^2 + c\\n end\\n r,g,b = hsv2rgb(i / maxIter * 360, 1, i / maxIter)\\n img[y,x] = RGB{Float64}(r, g, b)\\n end\\n end\\n return img\\nend\\n\\nimg = mandelbrot()\\nsave(\\\"mandelbrot.png\\\", img)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"using Plots\\ngr(aspect_ratio=:equal, legend=false, axis=false, ticks=false, dpi=100)\\n\\nd, h = 400, 300 # pixel density (= image width) and image height\\nn, r = 40, 1000 # number of iterations and escape radius (r > 2)\\n\\nx = range(-1.0, 1.0, length=d+1)\\ny = range(-h/d, h/d, length=h+1)\\n\\nC = 2.0 .* (x' .+ y .* im) .- 0.5\\nZ, S = zero(C), zeros(size(C))\\n\\nanimation = Animation()\\nsmoothing = Animation()\\n\\nfor k in 1:n\\n M = abs.(Z) .< r\\n S[M] = S[M] .+ exp.(.-abs.(Z[M]))\\n Z[M] = Z[M] .^ 2 .+ C[M]\\n heatmap(exp.(.-abs.(Z)), c=:jet)\\n frame(animation)\\n heatmap(S .+ exp.(.-abs.(Z)), c=:jet)\\n frame(smoothing)\\nend\\n\\ngif(animation, \\\"Mandelbrot_animation.gif\\\", fps=2)\\ngif(smoothing, \\\"Mandelbrot_smoothing.gif\\\", fps=2)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"using Plots\\ngr(aspect_ratio=:equal, axis=true, ticks=true, legend=false, dpi=200)\\n\\nd, h = 800, 500 # pixel density (= image width) and image height\\nn, r = 200, 500 # number of iterations and escape radius (r > 2)\\n\\nx = range(0, 2, length=d+1)\\ny = range(0, 2 * h / d, length=h+1)\\n\\nA, B = collect(x) .- 1, collect(y) .- h / d\\nC = 2.0 .* (A' .+ B .* im) .- 0.5\\n\\nZ, dZ = zero(C), zero(C)\\nD, S, T = zeros(size(C)), zeros(size(C)), zeros(size(C))\\n\\nfor k in 1:n\\n M = abs.(Z) .< r\\n S[M], T[M] = S[M] .+ exp.(.- abs.(Z[M])), T[M] .+ 1\\n Z[M], dZ[M] = Z[M] .^ 2 .+ C[M], 2 .* Z[M] .* dZ[M] .+ 1\\nend\\n\\nheatmap(S .^ 0.1, c=:balance)\\nsavefig(\\\"Mandelbrot_set_1.png\\\")\\n\\nN = abs.(Z) .>= r # normalized iteration count\\nT[N] = T[N] .- log2.(log.(abs.(Z[N])) ./ log(r))\\n\\nheatmap(T .^ 0.1, c=:balance)\\nsavefig(\\\"Mandelbrot_set_2.png\\\")\\n\\nN = abs.(Z) .> 2 # exterior distance estimation\\nD[N] = log.(abs.(Z[N])) .* abs.(Z[N]) ./ abs.(dZ[N])\\n\\nheatmap(D .^ 0.1, c=:balance)\\nsavefig(\\\"Mandelbrot_set_3.png\\\")\\n\\nN, thickness = D .> 0, 0.01 # boundary detection\\nD[N] = max.(1 .- D[N] ./ thickness, 0)\\n\\nheatmap(D .^ 2.0, c=:binary)\\nsavefig(\\\"Mandelbrot_set_4.png\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"using Plots\\ngr(aspect_ratio=:equal, axis=true, ticks=true, legend=false, dpi=200)\\n\\nd, h = 800, 500 # pixel density (= image width) and image height\\nn, r = 200, 500 # number of iterations and escape radius (r > 2)\\n\\ndirection, height = 45.0, 1.5 # direction and height of the light\\ndensity, intensity = 4.0, 0.5 # density and intensity of the stripes\\n\\nx = range(0, 2, length=d+1)\\ny = range(0, 2 * h / d, length=h+1)\\n\\nA, B = collect(x) .- 1, collect(y) .- h / d\\nC = (2.0 + 1.0im) .* (A' .+ B .* im) .- 0.5\\n\\nZ, dZ, ddZ = zero(C), zero(C), zero(C)\\nD, S, T = zeros(size(C)), zeros(size(C)), zeros(size(C))\\n\\nfor k in 1:n\\n M = abs.(Z) .< r\\n S[M], T[M] = S[M] .+ sin.(density .* angle.(Z[M])), T[M] .+ 1\\n Z[M], dZ[M], ddZ[M] = Z[M] .^ 2 .+ C[M], 2 .* Z[M] .* dZ[M] .+ 1, 2 .* (dZ[M] .^ 2 .+ Z[M] .* ddZ[M])\\nend\\n\\nN = abs.(Z) .>= r # basic normal map effect and stripe average coloring (potential function)\\nP, Q = S[N] ./ T[N], (S[N] .+ sin.(density .* angle.(Z[N]))) ./ (T[N] .+ 1)\\nU, V = Z[N] ./ dZ[N], 1 .+ (log2.(log.(abs.(Z[N])) ./ log(r)) .* (P .- Q) .+ Q) .* intensity\\nU, v = U ./ abs.(U), exp(direction / 180 * pi * im) # unit normal vectors and light vector\\nD[N] = max.((real.(U) .* real(v) .+ imag.(U) .* imag(v) .+ V .* height) ./ (1 + height), 0)\\n\\nheatmap(D .^ 1.0, c=:bone_1)\\nsavefig(\\\"Mandelbrot_normal_map_1.png\\\")\\n\\nN = abs.(Z) .> 2 # advanced normal map effect using higher derivatives (distance estimation)\\nU = Z[N] .* dZ[N] .* ((1 .+ log.(abs.(Z[N]))) .* conj.(dZ[N] .^ 2) .- log.(abs.(Z[N])) .* conj.(Z[N] .* ddZ[N]))\\nU, v = U ./ abs.(U), exp(direction / 180 * pi * im) # unit normal vectors and light vector\\nD[N] = max.((real.(U) .* real(v) .+ imag.(U) .* imag(v) .+ height) ./ (1 + height), 0)\\n\\nheatmap(D .^ 1.0, c=:afmhot)\\nsavefig(\\\"Mandelbrot_normal_map_2.png\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"using Plots\\ngr(aspect_ratio=:equal, axis=true, ticks=true, legend=false, dpi=200)\\n\\nd, h = 200, 1200 # pixel density (= image width) and image height\\nn, r = 8000, 10000 # number of iterations and escape radius (r > 2)\\n\\na = -.743643887037158704752191506114774 # https://mathr.co.uk/web/m-location-analysis.html\\nb = 0.131825904205311970493132056385139 # try: a, b, n = -1.748764520194788535, 3e-13, 800\\n\\nx = range(0, 2, length=d+1)\\ny = range(0, 2 * h / d, length=h+1)\\n\\nA, B = collect(x) .* pi, collect(y) .* pi\\nC = 8.0 .* exp.((A' .+ B .* im) .* im) .+ (a + b * im)\\n\\nZ, dZ = zero(C), zero(C)\\nD = zeros(size(C))\\n\\nfor k in 1:n\\n M = abs2.(Z) .< abs2(r)\\n Z[M], dZ[M] = Z[M] .^ 2 .+ C[M], 2 .* Z[M] .* dZ[M] .+ 1\\nend\\n\\nN = abs.(Z) .> 2 # exterior distance estimation\\nD[N] = log.(abs.(Z[N])) .* abs.(Z[N]) ./ abs.(dZ[N])\\n\\nheatmap(D' .^ 0.05, c=:nipy_spectral)\\nsavefig(\\\"Mercator_Mandelbrot_map.png\\\")\\n\\nX, Y = real(C), imag(C) # zoom images (adjust circle size 50 and zoom level 20 as needed)\\nR, c, z = 50 * (2 / d) * pi .* exp.(.- B), min(d, h) + 1, max(0, h - d) ÷ 20\\n\\ngr(c=:nipy_spectral, axis=true, ticks=true, legend=false, markerstrokewidth=0)\\np1 = scatter(X[1z+1:1z+c,1:d], Y[1z+1:1z+c,1:d], markersize=R[1:c].^.5, marker_z=D[1z+1:1z+c,1:d].^.5)\\np2 = scatter(X[2z+1:2z+c,1:d], Y[2z+1:2z+c,1:d], markersize=R[1:c].^.5, marker_z=D[2z+1:2z+c,1:d].^.4)\\np3 = scatter(X[3z+1:3z+c,1:d], Y[3z+1:3z+c,1:d], markersize=R[1:c].^.5, marker_z=D[3z+1:3z+c,1:d].^.3)\\np4 = scatter(X[4z+1:4z+c,1:d], Y[4z+1:4z+c,1:d], markersize=R[1:c].^.5, marker_z=D[4z+1:4z+c,1:d].^.2)\\nplot(p1, p2, p3, p4, layout=(2, 2))\\nsavefig(\\\"Mercator_Mandelbrot_zoom.png\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"using Plots\\ngr(aspect_ratio=:equal, axis=true, ticks=true, legend=false, dpi=200)\\n\\nsetprecision(BigFloat, 256) # set precision to 256 bits (default)\\nsetrounding(BigFloat, RoundNearest) # set rounding mode (default)\\n\\nd, h = 50, 1000 # pixel density (= image width) and image height\\nn, r = 80000, 100000 # number of iterations and escape radius (r > 2)\\n\\na = BigFloat(\\\"-1.256827152259138864846434197797294538253477389787308085590211144291\\\")\\nb = BigFloat(\\\".37933802890364143684096784819544060002129071484943239316486643285025\\\")\\n\\nS = zeros(Complex{Float64}, n+1)\\nlet c = a + b * im, z = zero(c)\\n for k in 1:n+1\\n S[k] = z\\n if abs2(z) < abs2(r)\\n z = z ^ 2 + c\\n else\\n println(\\\"The reference sequence diverges within $(k-1) iterations.\\\")\\n break\\n end\\n end\\nend\\n\\nx = range(0, 2, length=d+1)\\ny = range(0, 2 * h / d, length=h+1)\\n\\nA, B = collect(x) .* pi, collect(y) .* pi\\nC = 8.0 .* exp.((A' .+ B .* im) .* im)\\n\\nE, Z, dZ = zero(C), zero(C), zero(C)\\nD, I, J = zeros(size(C)), ones(Int64, size(C)), ones(Int64, size(C))\\n\\nfor k in 1:n\\n M, R = abs2.(Z) .< abs2(r), abs2.(Z) .< abs2.(E)\\n E[R], I[R] = Z[R], J[R] # rebase when z is closer to zero\\n E[M], I[M] = (2 .* S[I[M]] .+ E[M]) .* E[M] .+ C[M], I[M] .+ 1\\n Z[M], dZ[M] = S[I[M]] .+ E[M], 2 .* Z[M] .* dZ[M] .+ 1\\nend\\n\\nN = abs.(Z) .> 2 # exterior distance estimation\\nD[N] = log.(abs.(Z[N])) .* abs.(Z[N]) ./ abs.(dZ[N])\\n\\nheatmap(D' .^ 0.015, c=:nipy_spectral)\\nsavefig(\\\"Mercator_Mandelbrot_deep_map.png\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nimport java.awt.Graphics\\nimport java.awt.image.BufferedImage\\nimport javax.swing.JFrame\\n\\nclass Mandelbrot: JFrame(\\\"Mandelbrot Set\\\") {\\n companion object {\\n private const val MAX_ITER = 570\\n private const val ZOOM = 150.0\\n }\\n\\n private val img: BufferedImage\\n\\n init {\\n setBounds(100, 100, 800, 600)\\n isResizable = false\\n defaultCloseOperation = EXIT_ON_CLOSE\\n img = BufferedImage(width, height, BufferedImage.TYPE_INT_RGB)\\n for (y in 0 until height) {\\n for (x in 0 until width) {\\n var zx = 0.0\\n var zy = 0.0\\n val cX = (x - 400) / ZOOM\\n val cY = (y - 300) / ZOOM\\n var iter = MAX_ITER\\n while (zx * zx + zy * zy < 4.0 && iter > 0) {\\n val tmp = zx * zx - zy * zy + cX\\n zy = 2.0 * zx * zy + cY\\n zx = tmp\\n iter--\\n }\\n img.setRGB(x, y, iter or (iter shl 7))\\n }\\n }\\n }\\n\\n override fun paint(g: Graphics) {\\n g.drawImage(img, 0, 0, this)\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n Mandelbrot().isVisible = true\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"{def mandel\\n\\n {def mandel.r\\n {lambda {:iter :cx :cy :norm :x :y :count}\\n {if {> :count :iter} // then norm < 4\\n then o // inside the set\\n else {if {> :norm 4} // then iter > max\\n then . // outside the set\\n else {let { {:cx :cx} {:cy :cy} {:iter :iter}\\n {:X {+ {* :x :x} -{* :y :y} :cx}} // compute\\n {:Y {+ {* 2 :x :y} :cy}} // z = z^2+c\\n {:count {+ :count 1}}\\n } {mandel.r :iter :cx :cy\\n {+ {* :X :X} {* :Y :Y}} // the norm\\n :X :Y :count} }}}}}\\n\\n {lambda {:iter :cx :cy}\\n {mandel.r :iter\\n {+ {* :cx 0.05} -1.50} // centering the set\\n {+ {* :cy 0.05} -0.75} // inside the frame\\n 0 0 0 0} }}\\n-> mandel\\n\\nWe call mandel directly in the wiki page\\n\\n{S.map {lambda {:i} {br} // loop on y\\n {S.map {{lambda {:i :j} // loop on x\\n {mandel 20 :i :j}} :i} // compute\\n {S.serie 0 30}}} // x resolution\\n{S.serie 0 40}} // y resolution\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \": d2c(*,*) 2 compress 'c dress ; # Make a complex number.\\n\\n: iterate(c) [0 0](c) \\\"dup * over +\\\" steps reshape execute ;\\n\\n: print_line(*) \\\"#*+-. \\\" \\\"\\\" split swap subscript \\\"\\\" join . \\\"\\\\n\\\" . ;\\n\\n75 iota 45 - 20 / # x coordinates\\n29 iota 14 - 10 / # y cordinates\\n'd2c outer # Make complex matrix.\\n\\n10 'steps set # How many iterations?\\n\\niterate abs int 5 min 'print_line apply # Compute & print\\n\",\n \"language\": \"Lang5\"\n },\n {\n \"code\": \"define mandelbrotBailout => 16\\ndefine mandelbrotMaxIterations => 1000\\n\\ndefine mandelbrotIterate(x, y) => {\\n\\tlocal(cr = #y - 0.5,\\n\\t\\tci = #x,\\n\\t\\tzi = 0.0,\\n\\t\\tzr = 0.0,\\n\\t\\ti = 0,\\n\\t\\ttemp, zr2, zi2)\\n\\n\\t{\\n\\t\\t++#i;\\n\\t\\t#temp = #zr * #zi\\n\\t\\t#zr2 = #zr * #zr\\n\\t\\t#zi2 = #zi * #zi\\n\\t\\t\\t\\t\\n\\t\\t#zi2 + #zr2 > mandelbrotBailout?\\n\\t\\t\\treturn #i\\n\\t\\t#i > mandelbrotMaxIterations?\\n\\t\\t\\treturn 0\\n\\n\\t\\t#zr = #zr2 - #zi2 + #cr\\n\\t\\t#zi = #temp + #temp + #ci\\n\\t\\t\\n\\t\\tcurrentCapture->restart\\n\\t}()\\n}\\n\\ndefine mandelbrotTest() => {\\n\\tlocal(x, y = -39.0)\\n\\t{\\n\\t\\tstdout('\\\\n')\\n\\t\\t#x = -39.0\\n\\t\\t{\\n\\t\\t\\tmandelbrotIterate(#x / 40.0, #y / 40.0) == 0?\\n\\t\\t\\t\\tstdout('*')\\n\\t\\t\\t\\t| stdout(' ');\\n\\t\\t\\t++#x\\n\\t\\t\\t#x <= 39.0?\\n\\t\\t\\t\\tcurrentCapture->restart\\n\\t\\t}();\\n\\t\\t++#y\\n\\t\\t\\n\\t\\t#y <= 39.0?\\n\\t\\t\\tcurrentCapture->restart\\n\\t}()\\n\\tstdout('\\\\n')\\n}\\n\\nmandelbrotTest\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"\\\\documentclass{minimal}\\n\\\\usepackage{tikz}\\n\\\\usetikzlibrary{shadings}\\n\\\\begin{document}\\n\\\\begin{tikzpicture}\\n \\\\shade[shading=Mandelbrot set] (0,0) rectangle (4,4);\\n\\\\end{tikzpicture}\\n\\\\end{document}\\n\",\n \"language\": \"LaTeX\"\n },\n {\n \"code\": \"nomainwin\\n\\nWindowWidth =440\\nWindowHeight =460\\n\\nopen \\\"Mandelbrot Set\\\" for graphics_nsb_nf as #w\\n\\n#w \\\"trapclose [quit]\\\"\\n#w \\\"down\\\"\\n\\nfor x0 = -2 to 1 step .0033\\n for y0 = -1.5 to 1.5 step .0075\\n x = 0\\n y = 0\\n\\n iteration = 0\\n maxIteration = 255\\n\\n while ( ( x *x +y *y) <=4) and ( iteration <maxIteration)\\n xtemp =x *x -y *y +x0\\n y =2 *x *y +y0\\n x = xtemp\\n iteration = iteration + 1\\n wend\\n\\n if iteration <>maxIteration then\\n c =iteration\\n else\\n c =0\\n end if\\n\\n call pSet x0, y0, c\\n scan\\n next\\nnext\\n\\n#w \\\"flush\\\"\\n\\nwait\\n\\nsub pSet x, y, c\\n xScreen = 10 +( x +2) /3 *400\\n yScreen = 10 +( y +1.5) /3 *400\\n if c =0 then\\n col$ =\\\"red\\\"\\n else\\n if c mod 2 =1 then col$ =\\\"lightgray\\\" else col$ =\\\"white\\\"\\n end if\\n #w \\\"color \\\"; col$\\n #w \\\"set \\\"; xScreen; \\\" \\\"; yScreen\\nend sub\\n\\n[quit]\\nclose #w\\nend\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"#\\n# A mandelbrot generator that outputs a PBM file. This can be used to measure\\n# performance differences between LIL versions and measure performance\\n# bottlenecks (although keep in mind that LIL is not supposed to be a fast\\n# language, but a small one which depends on C for the slow parts - in a real\\n# program where for some reason mandelbrots are required, the code below would\\n# be written in C). The code is based on the mandelbrot test for the Computer\\n# Language Benchmarks Game at http://shootout.alioth.debian.org/\\n#\\n# In my current computer (Intel Core2Quad Q9550 @ 2.83GHz) running x86 Linux\\n# the results are (using the default 256x256 size):\\n#\\n# 2m3.634s - commit 1c41cdf89f4c1e039c9b3520c5229817bc6274d0 (Jan 10 2011)\\n#\\n# To test call\\n#\\n# time ./lil mandelbrot.lil > mandelbrot.pbm\\n#\\n# with an optimized version of lil (compiled with CFLAGS=-O3 make).\\n#\\n\\nset width [expr $argv]\\nif not $width { set width 256 }\\nset height $width\\nset bit_num 0\\nset byte_acc 0\\nset iter 50\\nset limit 2.0\\n\\nwrite \\\"P4\\\\n${width} ${height}\\\\n\\\"\\n\\nfor {set y 0} {$y < $height} {inc y} {\\n for {set x 0} {$x < $width} {inc x} {\\n set Zr 0.0 Zi 0.0 Tr 0.0 Ti 0.0\\n set Cr [expr 2.0 * $x / $width - 1.5]\\n set Ci [expr 2.0 * $y / $height - 1.0]\\n for {set i 0} {$i < $iter && $Tr + $Ti <= $limit * $limit} {inc i} {\\n set Zi [expr 2.0 * $Zr * $Zi + $Ci]\\n set Zr [expr $Tr - $Ti + $Cr]\\n set Tr [expr $Zr * $Zr]\\n set Ti [expr $Zi * $Zi]\\n }\\n\\n set byte_acc [expr $byte_acc << 1]\\n if [expr $Tr + $Ti <= $limit * $limit] {\\n set byte_acc [expr $byte_acc | 1]\\n }\\n\\n inc bit_num\\n\\n if [expr $bit_num == 8] {\\n writechar $byte_acc\\n set byte_acc 0\\n set bit_num 0\\n } {if [expr $x == $width - 1] {\\n set byte_acc [expr 8 - $width % 8]\\n writechar $byte_acc\\n set byte_acc 0\\n set bit_num 0\\n }}\\n }\\n}\\n\",\n \"language\": \"LIL\"\n },\n {\n \"code\": \"1 MODE 3 ' Note the CPCBasic-only screen mode!\\n2 FOR xp = 0 TO 639\\n3 FOR yp = 0 TO 399\\n4 x = 0 : y = 0\\n5 x0 = xp / 213 - 2 : y0 = yp / 200 - 1\\n6 iteration = 0\\n7 maxIteration = 100\\n8 WHILE (x * x + y * y <= (2 * 2) AND iteration < maxIteration)\\n9 xtemp = x * x - y * y + x0\\n10 y = 2 * x * y + y0\\n11 x = xtemp\\n12 iteration = iteration + 1\\n13 WEND\\n14 IF iteration <> maxIteration THEN c = iteration ELSE c = 0\\n15 PLOT xp, yp, c MOD 16\\n16 NEXT\\n17 NEXT\\n\",\n \"language\": \"Locomotive-Basic\"\n },\n {\n \"code\": \"to mandelbrot :left :bottom :side :size\\n cs setpensize [1 1]\\n make \\\"inc :side/:size\\n make \\\"zr :left\\n repeat :size [\\n make \\\"zr :zr + :inc\\n make \\\"zi :bottom\\n pu\\n setxy repcount - :size/2 minus :size/2\\n pd\\n repeat :size [\\n make \\\"zi :zi + :inc\\n setpencolor count.color calc :zr :zi\\n fd 1 ] ]\\nend\\n\\nto count.color :count\\n ;op (list :count :count :count)\\n if :count > 256 [op 0]\\t; black\\n if :count > 128 [op 7]\\t; white\\n if :count > 64 [op 5]\\t; magenta\\n if :count > 32 [op 6]\\t; yellow\\n if :count > 16 [op 4]\\t; red\\n if :count > 8 [op 2]\\t; green\\n if :count > 4 [op 1]\\t; blue\\n op 3\\t\\t\\t\\t; cyan\\nend\\n\\nto calc :zr :zi [:count 0] [:az 0] [:bz 0]\\n if :az*:az + :bz*:bz > 4 [op :count]\\n if :count > 256 [op :count]\\n op (calc :zr :zi (:count + 1) (:zr + :az*:az - :bz*:bz) (:zi + 2*:az*:bz))\\nend\\n\\nmandelbrot -2 -1.25 2.5 400\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"local maxIterations = 250\\nlocal minX, maxX, minY, maxY = -2.5, 2.5, -2.5, 2.5\\nlocal miX, mxX, miY, mxY\\nfunction remap( x, t1, t2, s1, s2 )\\n local f = ( x - t1 ) / ( t2 - t1 )\\n local g = f * ( s2 - s1 ) + s1\\n return g;\\nend\\nfunction drawMandelbrot()\\n local pts, a, as, za, b, bs, zb, cnt, clr = {}\\n for j = 0, hei - 1 do\\n for i = 0, wid - 1 do\\n a = remap( i, 0, wid, minX, maxX )\\n b = remap( j, 0, hei, minY, maxY )\\n cnt = 0; za = a; zb = b\\n while( cnt < maxIterations ) do\\n as = a * a - b * b; bs = 2 * a * b\\n a = za + as; b = zb + bs\\n if math.abs( a ) + math.abs( b ) > 16 then break end\\n cnt = cnt + 1\\n end\\n if cnt == maxIterations then clr = 0\\n else clr = remap( cnt, 0, maxIterations, 0, 255 )\\n end\\n pts[1] = { i, j, clr, clr, 0, 255 }\\n love.graphics.points( pts )\\n end\\n end\\nend\\nfunction startFractal()\\n love.graphics.setCanvas( canvas ); love.graphics.clear()\\n love.graphics.setColor( 255, 255, 255 )\\n drawMandelbrot(); love.graphics.setCanvas()\\nend\\nfunction love.load()\\n wid, hei = love.graphics.getWidth(), love.graphics.getHeight()\\n canvas = love.graphics.newCanvas( wid, hei )\\n startFractal()\\nend\\nfunction love.mousepressed( x, y, button, istouch )\\n if button == 1 then\\n startDrag = true; miX = x; miY = y\\n else\\n minX = -2.5; maxX = 2.5; minY = minX; maxY = maxX\\n startFractal()\\n startDrag = false\\n end\\nend\\nfunction love.mousereleased( x, y, button, istouch )\\n if startDrag then\\n local l\\n if x > miX then mxX = x\\n else l = x; mxX = miX; miX = l\\n end\\n if y > miY then mxY = y\\n else l = y; mxY = miY; miY = l\\n end\\n miX = remap( miX, 0, wid, minX, maxX )\\n mxX = remap( mxX, 0, wid, minX, maxX )\\n miY = remap( miY, 0, hei, minY, maxY )\\n mxY = remap( mxY, 0, hei, minY, maxY )\\n minX = miX; maxX = mxX; minY = miY; maxY = mxY\\n startFractal()\\n end\\nend\\nfunction love.draw()\\n love.graphics.draw( canvas )\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"-- Mandelbrot set in Lua 6/15/2020 db\\nlocal charmap = { [0]=\\\" \\\", \\\".\\\", \\\":\\\", \\\"-\\\", \\\"=\\\", \\\"+\\\", \\\"*\\\", \\\"#\\\", \\\"%\\\", \\\"@\\\" }\\nfor y = -1.3, 1.3, 0.1 do\\n for x = -2.1, 1.1, 0.04 do\\n local zi, zr, i = 0, 0, 0\\n while i < 100 do\\n if (zi*zi+zr*zr >= 4) then break end\\n zr, zi, i = zr*zr-zi*zi+x, 2*zr*zi+y, i+1\\n end\\n io.write(charmap[i%10])\\n end\\n print()\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"for y=-12,12 do l=\\\"\\\"for x=-2,1,3/80 do a,b,n=0,0,-15 while n<9 and a*a+b*b<1e12\\ndo a,b,n=a*a-b*b+x,2*a*b+y/8,n+1 end l=l..(\\\".,:;=$%# \\\"):sub(n,n)end print(l)end\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Mandelbrot(x=0&,y=0&,z=1&) {\\n If z<1 then z=1\\n If z>16 then z=16\\n Const iXmax=32*z\\n Const iYmax=26*z\\n Def single Cx, Cy, CxMin=-2.05, CxMax=0.85, CyMin=-1.2, CyMax=1.2\\n Const PixelWidth=(CxMax-CxMin)/iXmax, iXm=(iXmax-1)*PixelWidth\\n Const PixelHeight=(CyMax-CyMin)/iYmax,Ph2=PixelHeight/2\\n Const Iteration=25\\n Const EscRadious=2.5, ER2=EscRadious**2\\n Def single preview\\n preview=iXmax*twipsX*(z/16)\\n Def long yp, xp, dx, dy, dx1, dy1\\n Let dx=twipsx*(16/z), dx1=dx-1\\n Let dy=twipsy*(16/z), dy1=dy-1\\n yp=y\\n For iY=0 to (iYmax-1)*PixelHeight step PixelHeight {\\n Cy=CyMin+iY\\n xp=x\\n if abs(Cy)<Ph2 Then Cy=0\\n For iX=0 to iXm Step PixelWidth {\\n Let Cx=CxMin+iX,Zx=0,Zy=0,Zx2=0,Zy2=0\\n For It=Iteration to 1 {Let Zy=2*Zx*Zy+Cy,Zx=Zx2-Zy2+Cx,Zx2=Zx**2,Zy2=Zy**2 :if Zx2+Zy2>ER2 Then exit\\n }\\n if it>13 then {it-=13} else.if it=0 then SetPixel(xp,yp,0): xp+=dx : continue\\n it*=10:SetPixel(xp,yp,color(it, it,255)) :xp+=dx\\n } : yp+=dy\\n }\\n Sub SetPixel()\\n move number, number: fill dx1, dy1, number\\n End Sub\\n}\\nCls 1,0\\nsz=(1,2,4,8,16)\\ni=each(sz)\\nWhile i {\\n Mandelbrot 250*twipsx,100*twipsy, array(i)\\n}\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Module Mandelbrot(x=0&,y=0&,z=1&) {\\n If z<1 then z=1\\n If z>16 then z=16\\n Const iXmax=32*z\\n Const iYmax=26*z\\n Def single Cx, Cy, CxMin=-2.05, CxMax=0.85, CyMin=-1.2, CyMax=1.2\\n Const PixelWidth=(CxMax-CxMin)/iXmax, iXm=(iXmax-1)*PixelWidth\\n Const PixelHeight=(CyMax-CyMin)/iYmax,Ph2=PixelHeight/2\\n Const Iteration=25\\n Const EscRadious=2.5, ER2=EscRadious**2\\n Def single preview\\n preview=iXmax*twipsX*(z/16)\\n Def long yp, xp, dx, dy, dx1, dy1\\n Let dx=twipsx*(16/z), dx1=dx-1\\n Let dy=twipsy*(16/z), dy1=dy-1\\n yp=y\\n Refresh 2000\\n For iY=0 to (iYmax-1)*PixelHeight step PixelHeight {\\n Cy=CyMin+iY\\n xp=x\\n if abs(Cy)<Ph2 Then Cy=0\\n move xp, yp\\n For iX=0 to iXm Step PixelWidth {\\n Let Cx=CxMin+iX,Zx=0,Zy=0,Zx2=0,Zy2=0\\n For It=Iteration to 1 {Let Zy=2*Zx*Zy+Cy,Zx=Zx2-Zy2+Cx,Zx2=Zx**2,Zy2=Zy**2 :if Zx2+Zy2>ER2 Then exit\\n }\\n if it>13 then {it-=13} else.if it=0 then fill dx1, dy1, 0: Step 0,-dy1: continue\\n it*=10:fill dx1, dy1, color(it, it,255): Step 0,-dy1\\n } : yp+=dy\\n }\\n\\n}\\nCls 1,0\\nsz=(1,2,4,8,16)\\ni=each(sz)\\nWhile i {\\n Mandelbrot 250*twipsx,100*twipsy, array(i)\\n}\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"divert(-1)\\nchangecom\\ndefine(`newline',`\\n')\\ndefine(`leftquote',`[')\\ndefine(`rightquote',`]')\\nchangequote(`[',`]')\\ndefine([print_char],\\n[ifelse(\\n$1,0,[*],\\n$1,1,[*],\\n$1,2,[*],\\n$1,3,[*],\\n$1,4,[*],\\n$1,5,[*],\\n$1,6,[*],\\n$1,7,[*],\\n$1,8,[*],\\n$1,9,[*],\\n$1,10,[newline],\\n$1,11,[*],\\n$1,12,[*],\\n$1,13,[*],\\n$1,14,[*],\\n$1,15,[*],\\n$1,16,[*],\\n$1,17,[*],\\n$1,18,[*],\\n$1,19,[*],\\n$1,20,[*],\\n$1,21,[*],\\n$1,22,[*],\\n$1,23,[*],\\n$1,24,[*],\\n$1,25,[*],\\n$1,26,[*],\\n$1,27,[*],\\n$1,28,[*],\\n$1,29,[*],\\n$1,30,[*],\\n$1,31,[*],\\n$1,32,[ ],\\n$1,33,[!],\\n$1,34,[\\\"],\\n$1,35,[#],\\n$1,36,[$],\\n$1,37,[%],\\n$1,38,[&],\\n$1,39,['],\\n$1,40,[(],\\n$1,41,[)],\\n$1,42,[*],\\n$1,43,[+],\\n$1,44,[,],\\n$1,45,[-],\\n$1,46,[.],\\n$1,47,[/],\\n$1,48,[0],\\n$1,49,[1],\\n$1,50,[2],\\n$1,51,[3],\\n$1,52,[4],\\n$1,53,[5],\\n$1,54,[6],\\n$1,55,[7],\\n$1,56,[8],\\n$1,57,[9],\\n$1,58,[:],\\n$1,59,[;],\\n$1,60,[<],\\n$1,61,[=],\\n$1,62,[>],\\n$1,63,[?],\\n$1,64,[@],\\n$1,65,[A],\\n$1,66,[B],\\n$1,67,[C],\\n$1,68,[D],\\n$1,69,[E],\\n$1,70,[F],\\n$1,71,[G],\\n$1,72,[H],\\n$1,73,[I],\\n$1,74,[J],\\n$1,75,[K],\\n$1,76,[L],\\n$1,77,[M],\\n$1,78,[N],\\n$1,79,[O],\\n$1,80,[P],\\n$1,81,[Q],\\n$1,82,[R],\\n$1,83,[S],\\n$1,84,[T],\\n$1,85,[U],\\n$1,86,[V],\\n$1,87,[W],\\n$1,88,[X],\\n$1,89,[Y],\\n$1,90,[Z],\\n$1,91,[changequote([`],['])leftquote`'changequote(`[',`]')],\\n$1,92,[\\\\],\\n$1,93,[rightquote],\\n$1,94,[^],\\n$1,95,[_],\\n$1,96,[`],\\n$1,97,[a],\\n$1,98,[b],\\n$1,99,[c],\\n$1,100,[d],\\n$1,101,[e],\\n$1,102,[f],\\n$1,103,[g],\\n$1,104,[h],\\n$1,105,[i],\\n$1,106,[j],\\n$1,107,[k],\\n$1,108,[l],\\n$1,109,[m],\\n$1,110,[n],\\n$1,111,[o],\\n$1,112,[p],\\n$1,113,[q],\\n$1,114,[r],\\n$1,115,[s],\\n$1,116,[t],\\n$1,117,[u],\\n$1,118,[v],\\n$1,119,[w],\\n$1,120,[x],\\n$1,121,[y],\\n$1,122,[z],\\n$1,123,[{],\\n$1,124,[|],\\n$1,125,[}],\\n$1,126,[~],\\n[*])])\\ndefine([stack_1st],[substr([$1],0,index([$1],[:]))])\\ndefine([stack_2nd],[stack_1st(stack_drop([$1]))])\\ndefine([stack_drop],[substr([$1],eval(index([$1],[:]) [+ 1]))])\\ndefine([stack_drop2],[stack_drop(stack_drop([$1]))])\\ndefine([stack_not],[eval(stack_1st([$1]) [== 0]):stack_drop([$1])])\\ndefine([stack_neg],[eval([-] stack_1st([$1])):stack_drop([$1])])\\ndefine([stack_and],[eval(stack_2nd([$1] [!= 0]) [&&] stack_1st([$1] [!= 0])):stack_drop2([$1])])\\ndefine([stack_or],[eval(stack_2nd([$1] [!= 0]) [||] stack_1st([$1] [!= 0])):stack_drop2([$1])])\\ndefine([stack_lt],[eval(stack_2nd([$1]) [<] stack_1st([$1])):stack_drop2([$1])])\\ndefine([stack_le],[eval(stack_2nd([$1]) [<=] stack_1st([$1])):stack_drop2([$1])])\\ndefine([stack_gt],[eval(stack_2nd([$1]) [>] stack_1st([$1])):stack_drop2([$1])])\\ndefine([stack_ge],[eval(stack_2nd([$1]) [>=] stack_1st([$1])):stack_drop2([$1])])\\ndefine([stack_eq],[eval(stack_2nd([$1]) [==] stack_1st([$1])):stack_drop2([$1])])\\ndefine([stack_ne],[eval(stack_2nd([$1]) [!=] stack_1st([$1])):stack_drop2([$1])])\\ndefine([stack_add],[eval(stack_2nd([$1]) [+] stack_1st([$1])):stack_drop2([$1])])\\ndefine([stack_sub],[eval(stack_2nd([$1]) [-] stack_1st([$1])):stack_drop2([$1])])\\ndefine([stack_mul],[eval(stack_2nd([$1]) [*] stack_1st([$1])):stack_drop2([$1])])\\ndefine([stack_div],[eval(stack_2nd([$1]) [/] stack_1st([$1])):stack_drop2([$1])])\\ndefine([stack_mod],[eval(stack_2nd([$1]) [%] stack_1st([$1])):stack_drop2([$1])])\\ndefine([prtc_1st],[print_char(stack_1st([$1]))])\\ndefine([prti_1st],[stack_1st([$1])])\\ndefine([prts_1st],[print_string(stack_1st([$1]))])\\ndefine([store],[define([_tmp1],index([$2],[$1:]))[]substr([$2],0,_tmp1)[$1:$3]define([_tmp2],substr([$2],eval(_tmp1 + len([$1]) [+ 1])))substr(_tmp2,index(_tmp2,[:]))])\\ndefine([fetch],[define([_tmp],substr([$2],eval(index([$2],[$1:]) [+] len([$1]) [+ 1])))[]substr(_tmp,0,index(_tmp,[:]))])\\ndefine([initial_vars],[var0:0:var1:0:var2:0:var3:0:var4:0:var5:0:var6:0:var7:0:var8:0:var9:0:var10:0:var11:0:var12:0:var13:0:var14:0:])\\ndefine([kont0],[kont5([420:$1],[$2])])\\ndefine([kont5],[kont6(stack_neg([$1]),[$2])])\\ndefine([kont6],[kont11(stack_drop([$1]),store([var0],[$2],stack_1st([$1])))])\\ndefine([kont11],[kont16([300:$1],[$2])])\\ndefine([kont16],[kont21(stack_drop([$1]),store([var1],[$2],stack_1st([$1])))])\\ndefine([kont21],[kont26([300:$1],[$2])])\\ndefine([kont26],[kont31(stack_drop([$1]),store([var2],[$2],stack_1st([$1])))])\\ndefine([kont31],[kont36([300:$1],[$2])])\\ndefine([kont36],[kont37(stack_neg([$1]),[$2])])\\ndefine([kont37],[kont42(stack_drop([$1]),store([var3],[$2],stack_1st([$1])))])\\ndefine([kont42],[kont47([7:$1],[$2])])\\ndefine([kont47],[kont52(stack_drop([$1]),store([var4],[$2],stack_1st([$1])))])\\ndefine([kont52],[kont57([15:$1],[$2])])\\ndefine([kont57],[kont62(stack_drop([$1]),store([var5],[$2],stack_1st([$1])))])\\ndefine([kont62],[kont67([200:$1],[$2])])\\ndefine([kont67],[kont72(stack_drop([$1]),store([var6],[$2],stack_1st([$1])))])\\ndefine([kont72],[kont77(fetch([var2],[$2])[:$1],[$2])])\\ndefine([kont77],[kont82(stack_drop([$1]),store([var7],[$2],stack_1st([$1])))])\\ndefine([kont82],[kont87(fetch([var7],[$2])[:$1],[$2])])\\ndefine([kont87],[kont92(fetch([var3],[$2])[:$1],[$2])])\\ndefine([kont92],[kont93(stack_gt([$1]),[$2])])\\ndefine([kont93],[ifelse(eval(stack_1st([$1]) [== 0]),1,[kont423(stack_drop([$1]),[$2])],[kont98(stack_drop([$1]),[$2])])])\\ndefine([kont98],[kont103(fetch([var0],[$2])[:$1],[$2])])\\ndefine([kont103],[kont108(stack_drop([$1]),store([var8],[$2],stack_1st([$1])))])\\ndefine([kont108],[kont113(fetch([var8],[$2])[:$1],[$2])])\\ndefine([kont113],[kont118(fetch([var1],[$2])[:$1],[$2])])\\ndefine([kont118],[kont119(stack_lt([$1]),[$2])])\\ndefine([kont119],[ifelse(eval(stack_1st([$1]) [== 0]),1,[kont396(stack_drop([$1]),[$2])],[kont124(stack_drop([$1]),[$2])])])\\ndefine([kont124],[kont129([0:$1],[$2])])\\ndefine([kont129],[kont134(stack_drop([$1]),store([var9],[$2],stack_1st([$1])))])\\ndefine([kont134],[kont139([0:$1],[$2])])\\ndefine([kont139],[kont144(stack_drop([$1]),store([var10],[$2],stack_1st([$1])))])\\ndefine([kont144],[kont149([32:$1],[$2])])\\ndefine([kont149],[kont154(stack_drop([$1]),store([var11],[$2],stack_1st([$1])))])\\ndefine([kont154],[kont159([0:$1],[$2])])\\ndefine([kont159],[kont164(stack_drop([$1]),store([var12],[$2],stack_1st([$1])))])\\ndefine([kont164],[kont169(fetch([var12],[$2])[:$1],[$2])])\\ndefine([kont169],[kont174(fetch([var6],[$2])[:$1],[$2])])\\ndefine([kont174],[kont175(stack_lt([$1]),[$2])])\\ndefine([kont175],[ifelse(eval(stack_1st([$1]) [== 0]),1,[kont369(stack_drop([$1]),[$2])],[kont180(stack_drop([$1]),[$2])])])\\ndefine([kont180],[kont185(fetch([var10],[$2])[:$1],[$2])])\\ndefine([kont185],[kont190(fetch([var10],[$2])[:$1],[$2])])\\ndefine([kont190],[kont191(stack_mul([$1]),[$2])])\\ndefine([kont191],[kont196([200:$1],[$2])])\\ndefine([kont196],[kont197(stack_div([$1]),[$2])])\\ndefine([kont197],[kont202(stack_drop([$1]),store([var13],[$2],stack_1st([$1])))])\\ndefine([kont202],[kont207(fetch([var9],[$2])[:$1],[$2])])\\ndefine([kont207],[kont212(fetch([var9],[$2])[:$1],[$2])])\\ndefine([kont212],[kont213(stack_mul([$1]),[$2])])\\ndefine([kont213],[kont218([200:$1],[$2])])\\ndefine([kont218],[kont219(stack_div([$1]),[$2])])\\ndefine([kont219],[kont224(stack_drop([$1]),store([var14],[$2],stack_1st([$1])))])\\ndefine([kont224],[kont229(fetch([var13],[$2])[:$1],[$2])])\\ndefine([kont229],[kont234(fetch([var14],[$2])[:$1],[$2])])\\ndefine([kont234],[kont235(stack_add([$1]),[$2])])\\ndefine([kont235],[kont240([800:$1],[$2])])\\ndefine([kont240],[kont241(stack_gt([$1]),[$2])])\\ndefine([kont241],[ifelse(eval(stack_1st([$1]) [== 0]),1,[kont298(stack_drop([$1]),[$2])],[kont246(stack_drop([$1]),[$2])])])\\ndefine([kont246],[kont251([48:$1],[$2])])\\ndefine([kont251],[kont256(fetch([var12],[$2])[:$1],[$2])])\\ndefine([kont256],[kont257(stack_add([$1]),[$2])])\\ndefine([kont257],[kont262(stack_drop([$1]),store([var11],[$2],stack_1st([$1])))])\\ndefine([kont262],[kont267(fetch([var12],[$2])[:$1],[$2])])\\ndefine([kont267],[kont272([9:$1],[$2])])\\ndefine([kont272],[kont273(stack_gt([$1]),[$2])])\\ndefine([kont273],[ifelse(eval(stack_1st([$1]) [== 0]),1,[kont288(stack_drop([$1]),[$2])],[kont278(stack_drop([$1]),[$2])])])\\ndefine([kont278],[kont283([64:$1],[$2])])\\ndefine([kont283],[kont288(stack_drop([$1]),store([var11],[$2],stack_1st([$1])))])\\ndefine([kont288],[kont293(fetch([var6],[$2])[:$1],[$2])])\\ndefine([kont293],[kont298(stack_drop([$1]),store([var12],[$2],stack_1st([$1])))])\\ndefine([kont298],[kont303(fetch([var10],[$2])[:$1],[$2])])\\ndefine([kont303],[kont308(fetch([var9],[$2])[:$1],[$2])])\\ndefine([kont308],[kont309(stack_mul([$1]),[$2])])\\ndefine([kont309],[kont314([100:$1],[$2])])\\ndefine([kont314],[kont315(stack_div([$1]),[$2])])\\ndefine([kont315],[kont320(fetch([var7],[$2])[:$1],[$2])])\\ndefine([kont320],[kont321(stack_add([$1]),[$2])])\\ndefine([kont321],[kont326(stack_drop([$1]),store([var9],[$2],stack_1st([$1])))])\\ndefine([kont326],[kont331(fetch([var13],[$2])[:$1],[$2])])\\ndefine([kont331],[kont336(fetch([var14],[$2])[:$1],[$2])])\\ndefine([kont336],[kont337(stack_sub([$1]),[$2])])\\ndefine([kont337],[kont342(fetch([var8],[$2])[:$1],[$2])])\\ndefine([kont342],[kont343(stack_add([$1]),[$2])])\\ndefine([kont343],[kont348(stack_drop([$1]),store([var10],[$2],stack_1st([$1])))])\\ndefine([kont348],[kont353(fetch([var12],[$2])[:$1],[$2])])\\ndefine([kont353],[kont358([1:$1],[$2])])\\ndefine([kont358],[kont359(stack_add([$1]),[$2])])\\ndefine([kont359],[kont364(stack_drop([$1]),store([var12],[$2],stack_1st([$1])))])\\ndefine([kont364],[kont164([$1],[$2])])\\ndefine([kont369],[kont374(fetch([var11],[$2])[:$1],[$2])])\\ndefine([kont374],[prtc_1st([$1])[]kont375(stack_drop([$1]),[$2])])\\ndefine([kont375],[kont380(fetch([var8],[$2])[:$1],[$2])])\\ndefine([kont380],[kont385(fetch([var4],[$2])[:$1],[$2])])\\ndefine([kont385],[kont386(stack_add([$1]),[$2])])\\ndefine([kont386],[kont391(stack_drop([$1]),store([var8],[$2],stack_1st([$1])))])\\ndefine([kont391],[kont108([$1],[$2])])\\ndefine([kont396],[kont401([10:$1],[$2])])\\ndefine([kont401],[prtc_1st([$1])[]kont402(stack_drop([$1]),[$2])])\\ndefine([kont402],[kont407(fetch([var7],[$2])[:$1],[$2])])\\ndefine([kont407],[kont412(fetch([var5],[$2])[:$1],[$2])])\\ndefine([kont412],[kont413(stack_sub([$1]),[$2])])\\ndefine([kont413],[kont418(stack_drop([$1]),store([var7],[$2],stack_1st([$1])))])\\ndefine([kont418],[kont82([$1],[$2])])\\ndefine([kont423],[])\\ndivert[]dnl\\nkont0([stack-bottom],initial_vars)[]dnl\\n\",\n \"language\": \"M4\"\n },\n {\n \"code\": \"ImageTools:-Embed(Fractals[EscapeTime]:-Mandelbrot(500, -2.0-1.35*I, .7+1.35*I, output = layer1));\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"eTime[c_, maxIter_Integer: 100] := Length@NestWhileList[#^2 + c &, 0, Abs@# <= 2 &, 1, maxIter] - 1\\n\\nDistributeDefinitions[eTime];\\nmesh = ParallelTable[eTime[x + I*y, 1000], {y, 1.2, -1.2, -0.01}, {x, -1.72, 1, 0.01}];\\nReliefPlot[mesh, Frame -> False]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"cf = With[{\\n mandel = Block[{z = #, c = #},\\n Catch@Do[If[Abs[z] > 2, Throw@i]; z = z^2 + c, {i, 100}]] &\\n },\\n Compile[{},Table[mandel[y + x I], {x, -1, 1, 0.005}, {y, -2, 0.5, 0.005}]]\\n ];\\nArrayPlot[cf[]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"MandelbrotSetPlot[]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function [theSet,realAxis,imaginaryAxis] = mandelbrotSet(start,gridSpacing,last,maxIteration)\\n\\n %Define the escape time algorithm\\n function escapeTime = escapeTimeAlgorithm(z0)\\n\\n escapeTime = 0;\\n z = 0;\\n\\n while( (abs(z)<=2) && (escapeTime < maxIteration) )\\n z = (z + z0)^2;\\n escapeTime = escapeTime + 1;\\n end\\n\\n end\\n\\n %Define the imaginary axis\\n imaginaryAxis = (imag(start):imag(gridSpacing):imag(last));\\n\\n %Define the real axis\\n realAxis = (real(start):real(gridSpacing):real(last));\\n\\n %Construct the complex plane from the real and imaginary axes\\n complexPlane = meshgrid(realAxis,imaginaryAxis) + meshgrid(imaginaryAxis(end:-1:1),realAxis)'.*i;\\n\\n %Apply the escape time algorithm to each point in the complex plane\\n theSet = arrayfun(@escapeTimeAlgorithm, complexPlane);\\n\\n\\n %Draw the set\\n pcolor(realAxis,imaginaryAxis,theSet);\\n shading flat;\\n\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"mandelbrotSet(-2.05-1.2i,0.004+0.0004i,0.45+1.2i,500);\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"mandelbrot ([iterations, 30], [x, -2.4, 0.75], [y, -1.2, 1.2],\\n [grid,320,320])$\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"prologues:=3;\\noutputtemplate:=\\\"%j-%c.svg\\\";\\noutputformat:=\\\"svg\\\";\\n\\n\\ndef mandelbrot(expr maxX, maxY) =\\n max_iteration := 500;\\n\\n color col[];\\n for i := 0 upto max_iteration:\\n t := i / max_iteration;\\n col[i] = (t,t,t);\\n endfor;\\n\\n\\n for px := 0 upto maxX:\\n for py := 0 upto maxY:\\n xz := px * 3.5 / maxX - 2.5; % (-2.5,1)\\n yz := py * 2 / maxY - 1; % (-1,1)\\n\\n x := 0;\\n y := 0;\\n\\n iteration := 0;\\n\\n forever: exitunless ((x*x + y*y < 4) and (iteration < max_iteration));\\n xtemp := x*x - y*y + xz;\\n y := 2*x*y + yz;\\n x := xtemp;\\n iteration := iteration + 1;\\n endfor;\\n\\n draw (px,py) withpen pencircle withcolor col[iteration];\\n\\n endfor;\\n endfor;\\nenddef;\\n\\n\\nbeginfig(1);\\n mandelbrot(200, 150);\\nendfig;\\n\\nend\\n\",\n \"language\": \"Metapost\"\n },\n {\n \"code\": \"mpost -numbersystem=\\\"double\\\" mandelbrot.mp\\n\",\n \"language\": \"Metapost\"\n },\n {\n \"code\": \"GraphicsWindow.Show()\\nsize = 500\\nhalf = 250\\nGraphicsWindow.Width = size * 1.5\\nGraphicsWindow.Height = size\\nGraphicsWindow.Title = \\\"Mandelbrot\\\"\\nFor px = 1 To size * 1.5\\n x_0 = px/half - 2\\n For py = 1 To size\\n y_0 = py/half - 1\\n x = x_0\\n y = y_0\\n i = 0\\n While(c <= 2 AND i<100)\\n x_1 = Math.Power(x, 2) - Math.Power(y, 2) + x_0\\n y_1 = 2 * x * y + y_0\\n c = Math.Power(Math.Power(x_1, 2) + Math.Power(y_1, 2), 0.5)\\n x = x_1\\n y = y_1\\n i = i + 1\\n EndWhile\\n If i < 99 Then\\n GraphicsWindow.SetPixel(px, py, GraphicsWindow.GetColorFromRGB((255/25)*i, (255/25)*i, (255/5)*i))\\n Else\\n GraphicsWindow.SetPixel(px, py, \\\"black\\\")\\n EndIf\\n c=0\\n EndFor\\nEndFor\\n\",\n \"language\": \"Microsoft-Small-Basic\"\n },\n {\n \"code\": \"ZOOM = 100\\nMAX_ITER = 40\\ngfx.clear color.black\\nfor y in range(0,200)\\n\\tfor x in range(0,300)\\n\\t\\tzx = 0\\n\\t\\tzy = 0\\n\\t\\tcx = (x - 200) / ZOOM\\n\\t\\tcy = (y - 100) / ZOOM\\n\\t\\tfor iter in range(MAX_ITER)\\n\\t\\t\\tif zx*zx + zy*zy > 4 then break\\n\\t\\t\\ttmp = zx * zx - zy * zy + cx\\n\\t\\t\\tzy = 2 * zx * zy + cy\\n\\t\\t\\tzx = tmp\\n\\t\\tend for\\n\\t\\tif iter then\\n\\t\\t\\tgfx.setPixel x, y, rgb(255-iter*6, 0, iter*6)\\n\\t\\tend if\\n\\tend for\\nend for\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"MODULE Mandelbrot EXPORTS Main;\\n\\nIMPORT Wr, Stdio, Fmt, Word;\\n\\nCONST m = 50;\\n limit2 = 4.0;\\n\\nTYPE UByte = BITS 8 FOR [0..16_FF];\\n\\nVAR width := 200;\\n height := 200;\\n bitnum: CARDINAL := 0;\\n byteacc: UByte := 0;\\n isOverLimit: BOOLEAN;\\n Zr, Zi, Cr, Ci, Tr, Ti: REAL;\\n\\nBEGIN\\n\\n Wr.PutText(Stdio.stdout, \\\"P4\\\\n\\\" & Fmt.Int(width) & \\\" \\\" & Fmt.Int(height) & \\\"\\\\n\\\");\\n\\n FOR y := 0 TO height - 1 DO\\n FOR x := 0 TO width - 1 DO\\n Zr := 0.0; Zi := 0.0;\\n Cr := 2.0 * FLOAT(x) / FLOAT(width) - 1.5;\\n Ci := 2.0 * FLOAT(y) / FLOAT(height) - 1.0;\\n\\n FOR i := 1 TO m + 1 DO\\n Tr := Zr*Zr - Zi*Zi + Cr;\\n Ti := 2.0*Zr*Zi + Ci;\\n Zr := Tr; Zi := Ti;\\n isOverLimit := Zr*Zr + Zi*Zi > limit2;\\n IF isOverLimit THEN EXIT; END;\\n END;\\n\\n IF isOverLimit THEN\\n byteacc := Word.Xor(Word.LeftShift(byteacc, 1), 16_00);\\n ELSE\\n byteacc := Word.Xor(Word.LeftShift(byteacc, 1), 16_01);\\n END;\\n\\n INC(bitnum);\\n\\n IF bitnum = 8 THEN\\n Wr.PutChar(Stdio.stdout, VAL(byteacc, CHAR));\\n byteacc := 0;\\n bitnum := 0;\\n ELSIF x = width - 1 THEN\\n byteacc := Word.LeftShift(byteacc, 8 - (width MOD 8));\\n Wr.PutChar(Stdio.stdout, VAL(byteacc, CHAR));\\n byteacc := 0;\\n bitnum := 0\\n END;\\n Wr.Flush(Stdio.stdout);\\n END;\\n END;\\nEND Mandelbrot.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"100 SCREEN 2\\n110 CLS\\n120 x1 = 256 : y1 = 192\\n130 i1 = -1 : i2 = 1\\n140 r1 = -2 : r2 = 1\\n150 s1 = (r2-r1)/x1 : s2 = (i2-i1)/y1\\n160 FOR y = 0 TO y1\\n170 i3 = i1+s2*y\\n180 FOR x = 0 TO x1\\n190 r3 = r1+s1*x\\n200 z1 = r3 : z2 = i3\\n210 FOR n = 0 TO 30\\n220 a = z1*z1 : b = z2*z2\\n230 IF a+b > 4 GOTO 270\\n240 z2 = 2*z1*z2+i3\\n250 z1 = a-b+r3\\n260 NEXT n\\n270 PSET (x,y),n-16*INT(n/16)\\n280 NEXT x\\n290 NEXT y\\n300 GOTO 300\\n\",\n \"language\": \"MSX-Basic\"\n },\n {\n \"code\": \"-- Table to contain all the data points\\nCREATE TABLE points (\\n c_re DOUBLE,\\n c_im DOUBLE,\\n z_re DOUBLE DEFAULT 0,\\n z_im DOUBLE DEFAULT 0,\\n znew_re DOUBLE DEFAULT 0,\\n znew_im DOUBLE DEFAULT 0,\\n steps INT DEFAULT 0,\\n active CHAR DEFAULT 1\\n);\\n\\nDELIMITER |\\n\\n-- Iterate over all the points in the table 'points'\\nCREATE PROCEDURE itrt (IN n INT)\\nBEGIN\\n label: LOOP\\n UPDATE points\\n SET\\n znew_re=POWER(z_re,2)-POWER(z_im,2)+c_re,\\n znew_im=2*z_re*z_im+c_im,\\n steps=steps+1\\n WHERE active=1;\\n UPDATE points SET\\n z_re=znew_re,\\n z_im=znew_im,\\n active=IF(POWER(z_re,2)+POWER(z_im,2)>4,0,1)\\n WHERE active=1;\\n SET n = n - 1;\\n IF n > 0 THEN\\n ITERATE label;\\n END IF;\\n LEAVE label;\\n END LOOP label;\\nEND|\\n\\n-- Populate the table 'points'\\nCREATE PROCEDURE populate (\\n r_min DOUBLE,\\n r_max DOUBLE,\\n r_step DOUBLE,\\n i_min DOUBLE,\\n i_max DOUBLE,\\n i_step DOUBLE)\\nBEGIN\\n DELETE FROM points;\\n SET @rl = r_min;\\n SET @a = 0;\\n rloop: LOOP\\n SET @im = i_min;\\n SET @b = 0;\\n iloop: LOOP\\n INSERT INTO points (c_re, c_im)\\n VALUES (@rl, @im);\\n SET @b=@b+1;\\n SET @im=i_min + @b * i_step;\\n IF @im < i_max THEN\\n ITERATE iloop;\\n END IF;\\n LEAVE iloop;\\n END LOOP iloop;\\n SET @a=@a+1;\\n SET @rl=r_min + @a * r_step;\\n IF @rl < r_max THEN\\n ITERATE rloop;\\n END IF;\\n LEAVE rloop;\\n END LOOP rloop;\\nEND|\\n\\nDELIMITER ;\\n\\n-- Choose size and resolution of graph\\n-- R_min, R_max, R_step, I_min, I_max, I_step\\nCALL populate( -2.5, 1.5, 0.005, -2, 2, 0.005 );\\n\\n-- Calculate 50 iterations\\nCALL itrt( 50 );\\n\\n-- Create the image (/tmp/image.ppm)\\n-- Note, MySQL will not over-write an existing file and you may need\\n-- administrator access to delete or move it\\nSELECT @xmax:=COUNT(c_re) INTO @xmax FROM points GROUP BY c_im LIMIT 1;\\nSELECT @ymax:=COUNT(c_im) INTO @ymax FROM points GROUP BY c_re LIMIT 1;\\nSET group_concat_max_len=11*@xmax*@ymax;\\nSELECT\\n 'P3', @xmax, @ymax, 200,\\n GROUP_CONCAT(\\n CONCAT(\\n IF( active=1, 0, 55+MOD(steps, 200) ), ' ',\\n IF( active=1, 0, 55+MOD(POWER(steps,3), 200) ), ' ',\\n IF( active=1, 0, 55+MOD(POWER(steps,2), 200) ) )\\n ORDER BY c_im ASC, c_re ASC SEPARATOR ' ' )\\n INTO OUTFILE '/tmp/image.ppm'\\n FROM points;\\n\",\n \"language\": \"MySQL\"\n },\n {\n \"code\": \"10 REM Mandelbrot set\\n20 CLS\\n30 FOR I=0 TO 95\\n40 LET X=(I-78)/48\\n50 REM ** When X<>0\\n60 FOR J=1 TO 22\\n70 LET Y=(22-J)/30\\n80 LET XA=0:X2=0\\n90 LET YA=0:Y2=0\\n100 LET ITER=0\\n110 LET XTEMP=X2-Y2+X\\n120 LET YA=2*XA*YA+Y:Y2=YA*YA\\n130 LET XA=XTEMP:X2=XA*XA\\n140 LET ITER=ITER+1\\n150 IF X2+Y2<=4 AND ITER<200 THEN 110\\n160 IF ITER=200 THEN SET(I,J):SET(I,44-J)\\n170 NEXT J\\n180 REM ** When X=0\\n190 LET XA=0:X2=0\\n200 LET ITER=0\\n210 LET XA=X2+X:X2=XA*XA\\n220 LET ITER=ITER+1\\n230 IF X2<=4 AND ITER<200 THEN 210\\n240 IF ITER=200 THEN SET(I,22)\\n250 NEXT I\\n290 REM ** Set up machine code INKEY$ command\\n300 IF PEEK(1)<>0 THEN RESTORE 510\\n310 DOKE 4100,3328:FOR A=3328 TO 3342 STEP 2\\n320 READ B:DOKE A,B:NEXT A\\n400 SCREEN 1,15\\n410 PRINT \\\"Hit any key to exit.\\\";\\n420 A=USR(0):IF A<0 THEN 420\\n430 CLS\\n440 END\\n490 REM ** Data for machine code INKEY$\\n500 DATA 25055,1080,-53,536,-20665,3370,-5664,0\\n510 DATA 27085,14336,-13564,6399,18178,10927\\n520 DATA -8179,233\\n\",\n \"language\": \"Nascom-BASIC\"\n },\n {\n \"code\": \"import complex\\n\\nproc inMandelbrotSet(c: Complex, maxEscapeIterations = 50): bool =\\n result = true; var z: Complex\\n for i in 0..maxEscapeIterations:\\n z = z * z + c\\n if abs2(z) > 4: return false\\n\\niterator steps(start, step: float, numPixels: int): float =\\n for i in 0..numPixels:\\n yield start + i.float * step\\n\\nproc mandelbrotImage(yStart, yStep, xStart, xStep: float, height, width: int): string =\\n for y in steps(yStart, yStep, height):\\n for x in steps(xStart, xStep, width):\\n result.add(if complex(x, y).inMandelbrotSet: '*'\\n else: ' ')\\n result.add('\\\\n')\\n\\necho mandelbrotImage(1.0, -0.05, -2.0, 0.0315, 40, 80)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"import math, complex, lenientops\\nimport imageman\\n\\nconst\\n W = 800\\n H = 600\\n Zoom = 0.5\\n MoveX = -0.5\\n MoveY = 0.0\\n MaxIter = 30\\n\\nfunc hsvToRgb(h, s, v: float): array[3, float] =\\n let c = v * s\\n let x = c * (1 - abs(((h / 60) mod 2) - 1))\\n let m = v - c\\n let (r, g, b) = if h < 60: (c, x, 0.0)\\n elif h < 120: (x, c, 0.0)\\n elif h < 180: (0.0, c, x)\\n elif h < 240: (0.0, x, c)\\n elif x < 300: (x, 0.0, c)\\n else: (c, 0.0, x)\\n result = [r + m, g + m, b + m]\\n\\n\\nvar img = initImage[ColorRGBF64](W, H)\\nfor x in 1..W:\\n for y in 1..H:\\n var i = MaxIter - 1\\n let c = complex((2 * x - W) / (W * Zoom) + MoveX, (2 * y - H) / (H * Zoom) + MoveY)\\n var z = c\\n while abs(z) < 2 and i > 0:\\n z = z * z + c\\n dec i\\n let color = hsvToRgb(i / MaxIter * 360, 1, i / MaxIter)\\n img[x - 1, y - 1] = ColorRGBF64(color)\\n\\nimg.savePNG(\\\"mandelbrot.png\\\", compression = 9)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"# -*- ObjectIcon -*-\\n\\nimport graphics\\nimport ipl.graphics\\nimport io\\nimport util(Math)\\n\\nprocedure main ()\\n local w\\n local width, height\\n local xcenter, ycenter, pixels_per_unit, max_iter\\n local zoom_ratio\\n\\n write (\\\"q or Q : quit\\\")\\n write (\\\"left press : recenter\\\")\\n write (\\\"+ : zoom in\\\")\\n write (\\\"- : zoom in\\\")\\n write (\\\"2 .. 9 : set zoom ratio\\\")\\n write (\\\"o or O : restore original\\\")\\n write (\\\"p or P : dump to a PNG\\\")\\n\\n width := 400\\n height := 400\\n\\n pixels_per_unit := 150\\n max_iter := 200\\n zoom_ratio := 2\\n xcenter := -0.75\\n ycenter := 0.0\\n\\n w := Window().\\n set_size(width, height).\\n set_resize(&yes).\\n set_bg(\\\"white\\\").\\n set_canvas(\\\"normal\\\") | stop(&why)\\n\\n event_loop (w, xcenter, ycenter, pixels_per_unit, max_iter,\\n zoom_ratio)\\nend\\n\\nprocedure event_loop (w, xcenter, ycenter, pixels_per_unit,\\n max_iter, zoom_ratio)\\n local event\\n local xy\\n local png_number, png_name\\n local redraw\\n local width, height\\n local xleft, ytop\\n local i, j\\n local cx, cy, step\\n local iter, color\\n\\n png_number := 1\\n\\n redraw := &yes\\n repeat\\n {\\n if \\\\redraw then\\n {\\n w.erase_area()\\n\\n step := 1.0 / pixels_per_unit\\n\\n width := w.get_width()\\n height := w.get_height()\\n\\n xleft := xcenter - (width / (2.0 * pixels_per_unit))\\n ytop := ycenter + (height / (2.0 * pixels_per_unit))\\n\\n cx := xleft\\n cy := ytop\\n\\n j := 0\\n i := 0\\n\\n redraw := &no\\n }\\n\\n if j ~= height then\\n {\\n iter := count_mandelbrot_iterations (cx, cy, max_iter)\\n color := map_iterations_to_color (max_iter, iter)\\n w.set_fg (color)\\n w.draw_point (i, j)\\n i +:= 1; cx +:= step\\n if i = width then\\n {\\n i := 0; cx := xleft\\n j +:= 1; cy -:= step\\n }\\n }\\n\\n if *w.pending() ~= 0 then\\n {\\n event := w.event()\\n case event[1] of\\n {\\n QuitEvents():\\n exit()\\n\\n Mouse.LEFT_PRESS:\\n {\\n xy := window_coords_to_point (w, event[2], event[3],\\n xcenter, ycenter,\\n pixels_per_unit)\\n xcenter := xy[1]\\n ycenter := xy[2]\\n redraw := &yes\\n }\\n\\n \\\"+\\\":\\n {\\n pixels_per_unit := zoom_ratio * pixels_per_unit\\n redraw := &yes\\n }\\n\\n \\\"-\\\":\\n {\\n pixels_per_unit :=\\n max (1, (1.0 / zoom_ratio) * pixels_per_unit)\\n redraw := &yes\\n }\\n\\n !\\\"23456789\\\":\\n zoom_ratio := integer(event[1])\\n\\n !\\\"oO\\\":\\n {\\n pixels_per_unit := 150\\n max_iter := 200\\n zoom_ratio := 2\\n xcenter := -0.75\\n ycenter := 0.0\\n redraw := &yes\\n }\\n\\n !\\\"pP\\\":\\n {\\n png_name := \\\"mandelbrot-image-\\\" || png_number || \\\".png\\\"\\n png_number +:= 1\\n w.get_pixels().to_file(png_name)\\n write (\\\"Wrote \\\", png_name)\\n }\\n\\n Window.RESIZE:\\n redraw := &yes\\n }\\n\\n WDelay(w, 100)\\n }\\n }\\nend\\n\\nprocedure count_mandelbrot_iterations (cx, cy, max_iter)\\n local x, y, xsquared, ysquared, iter, tmp\\n\\n x := 0\\n y := 0\\n iter := 0\\n until (iter = max_iter |\\n 4 < (xsquared := x * x) + (ysquared := y * y)) do\\n {\\n tmp := xsquared - ysquared + cx\\n y := (2 * x * y) + cy\\n x := tmp\\n iter +:= 1\\n }\\n return iter\\nend\\n\\nprocedure map_iterations_to_color (max_iter, iter)\\n return \\\"black \\\" ||\\n integer((Math.log (iter) * 100.0) / Math.log (max_iter)) ||\\n \\\"%\\\"\\nend\\n\\nprocedure window_coords_to_point (w, xcoord, ycoord,\\n xcenter, ycenter,\\n pixels_per_unit)\\n local x, y\\n\\n x := xcenter +\\n (((2.0 * xcoord) - w.get_width()) / (2.0 * pixels_per_unit))\\n y := ycenter +\\n ((w.get_height() - (2.0 * ycoord)) / (2.0 * pixels_per_unit))\\n\\n return [x, y]\\nend\\n\",\n \"language\": \"ObjectIcon\"\n },\n {\n \"code\": \"#load \\\"graphics.cma\\\";;\\n\\nlet mandelbrot xMin xMax yMin yMax xPixels yPixels maxIter =\\n let rec mandelbrotIterator z c n =\\n if (Complex.norm z) > 2.0 then false else\\n match n with\\n | 0 -> true\\n | n -> let z' = Complex.add (Complex.mul z z) c in\\n mandelbrotIterator z' c (n-1) in\\n Graphics.open_graph\\n (\\\" \\\"^(string_of_int xPixels)^\\\"x\\\"^(string_of_int yPixels));\\n let dx = (xMax -. xMin) /. (float_of_int xPixels)\\n and dy = (yMax -. yMin) /. (float_of_int yPixels) in\\n for xi = 0 to xPixels - 1 do\\n for yi = 0 to yPixels - 1 do\\n let c = {Complex.re = xMin +. (dx *. float_of_int xi);\\n Complex.im = yMin +. (dy *. float_of_int yi)} in\\n if (mandelbrotIterator Complex.zero c maxIter) then\\n (Graphics.set_color Graphics.white;\\n Graphics.plot xi yi )\\n else\\n (Graphics.set_color Graphics.black;\\n Graphics.plot xi yi )\\n done\\n done;;\\n\\nmandelbrot (-1.5) 0.5 (-1.0) 1.0 500 500 200;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"#! /usr/bin/octave -qf\\nglobal width = 200;\\nglobal height = 200;\\nmaxiter = 100;\\n\\nz0 = 0;\\nglobal cmax = 1 + i;\\nglobal cmin = -2 - i;\\n\\nfunction cs = pscale(c)\\n global cmax;\\n global cmin;\\n global width;\\n global height;\\n persistent px = (real(cmax-cmin))/width;\\n persistent py = (imag(cmax-cmin))/height;\\n cs = real(cmin) + px*real(c) + i*(imag(cmin) + py*imag(c));\\nendfunction\\n\\nms = zeros(width, height);\\nfor x = 0:width-1\\n for y = 0:height-1\\n z0 = 0;\\n c = pscale(x+y*i);\\n for ic = 1:maxiter\\n z1 = z0^2 + c;\\n if ( abs(z1) > 2 ) break; endif\\n z0 = z1;\\n endfor\\n ms(x+1, y+1) = ic/maxiter;\\n endfor\\nendfor\\n\\nsaveimage(\\\"mandel.ppm\\\", round(ms .* 255).', \\\"ppm\\\");\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"function z = mandelbrot()\\n % to view the image call \\\"image(mandelbrot())\\\"\\n width = 500; height = 500;\\n z = zeros(width, height);\\n c = zeros(width, height);\\n\\n xi = 1;\\n for x = linspace(-2, 2, width)\\n yi = 1;\\n for y = linspace(-2, 2, height)\\n c(yi, xi) = x+y*i; yi += 1;\\n end\\n xi += 1;\\n end\\n\\n for iter = 1:50\\n z = z.*z + c;\\n end\\n\\n z = abs(z);\\nend\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"(define x-size 59)\\n(define y-size 21)\\n(define min-im -1)\\n(define max-im 1)\\n(define min-re -2)\\n(define max-re 1)\\n\\n(define step-x (/ (- max-re min-re) x-size))\\n(define step-y (/ (- max-im min-im) y-size))\\n\\n(for-each (lambda (y)\\n (let ((im (+ min-im (* step-y y))))\\n (for-each (lambda (x)\\n (let*((re (+ min-re (* step-x x)))\\n (zr (inexact re))\\n (zi (inexact im)))\\n (let loop ((n 0) (zi zi) (zr zr))\\n (let ((a (* zr zr))\\n (b (* zi zi)))\\n (cond\\n ((> (+ a b) 4)\\n (display (string (- 62 n))))\\n ((= n 30)\\n (display (string (- 62 n))))\\n (else\\n (loop (+ n 1) (+ (* 2 zr zi) im) (- (+ a re) b))))))))\\n (iota x-size))\\n (print)))\\n (iota y-size))\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"DEFINE VARIABLE print_str AS CHAR NO-UNDO INIT ''.\\nDEFINE VARIABLE X1 AS DECIMAL NO-UNDO INIT 50.\\nDEFINE VARIABLE Y1 AS DECIMAL NO-UNDO INIT 21.\\nDEFINE VARIABLE X AS DECIMAL NO-UNDO.\\nDEFINE VARIABLE Y AS DECIMAL NO-UNDO.\\nDEFINE VARIABLE N AS DECIMAL NO-UNDO.\\nDEFINE VARIABLE I3 AS DECIMAL NO-UNDO.\\nDEFINE VARIABLE R3 AS DECIMAL NO-UNDO.\\nDEFINE VARIABLE Z1 AS DECIMAL NO-UNDO.\\nDEFINE VARIABLE Z2 AS DECIMAL NO-UNDO.\\nDEFINE VARIABLE A AS DECIMAL NO-UNDO.\\nDEFINE VARIABLE B AS DECIMAL NO-UNDO.\\nDEFINE VARIABLE I1 AS DECIMAL NO-UNDO INIT -1.0.\\nDEFINE VARIABLE I2 AS DECIMAL NO-UNDO INIT 1.0.\\nDEFINE VARIABLE R1 AS DECIMAL NO-UNDO INIT -2.0.\\nDEFINE VARIABLE R2 AS DECIMAL NO-UNDO INIT 1.0.\\nDEFINE VARIABLE S1 AS DECIMAL NO-UNDO.\\nDEFINE VARIABLE S2 AS DECIMAL NO-UNDO.\\n\\n\\nS1 = (R2 - R1) / X1.\\nS2 = (I2 - I1) / Y1.\\nDO Y = 0 TO Y1 - 1:\\n I3 = I1 + S2 * Y.\\n DO X = 0 TO X1 - 1:\\n R3 = R1 + S1 * X.\\n Z1 = R3.\\n Z2 = I3.\\n DO N = 0 TO 29:\\n A = Z1 * Z1.\\n B = Z2 * Z2.\\n IF A + B > 4.0 THEN\\n LEAVE.\\n Z2 = 2 * Z1 * Z2 + I3.\\n Z1 = A - B + R3.\\n END.\\n print_str = print_str + CHR(62 - N).\\n END.\\n print_str = print_str + '~n'.\\nEND.\\n\\nOUTPUT TO \\\"C:\\\\Temp\\\\out.txt\\\".\\nMESSAGE print_str.\\nOUTPUT CLOSE.\\n\",\n \"language\": \"OpenEdge-Progress\"\n },\n {\n \"code\": \"mandelbrot() =\\n{\\n forstep(y=-1, 1, 0.05,\\n forstep(x=-2, 0.5, 0.0315,\\n print1(((c)->my(z=c);for(i=1,20,z=z*z+c;if(abs(z)>2,return(\\\" \\\")));\\\"#\\\")(x+y*I)));\\n print());\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"program mandelbrot;\\n\\n {$IFDEF FPC}\\n {$MODE DELPHI}\\n {$ENDIF}\\n\\nconst\\n ixmax = 800;\\n iymax = 800;\\n cxmin = -2.5;\\n cxmax = 1.5;\\n cymin = -2.0;\\n cymax = 2.0;\\n maxcolorcomponentvalue = 255;\\n maxiteration = 200;\\n escaperadius = 2;\\n\\ntype\\n colortype = record\\n red : byte;\\n green : byte;\\n blue : byte;\\n end;\\n\\nvar\\n ix, iy : integer;\\n cx, cy : real;\\n pixelwidth : real = (cxmax - cxmin) / ixmax;\\n pixelheight : real = (cymax - cymin) / iymax;\\n filename : string = 'new1.ppm';\\n comment : string = '# ';\\n outfile : textfile;\\n color : colortype;\\n zx, zy : real;\\n zx2, zy2 : real;\\n iteration : integer;\\n er2 : real = (escaperadius * escaperadius);\\n\\nbegin\\n {$I-}\\n assign(outfile, filename);\\n rewrite(outfile);\\n if ioresult <> 0 then\\n begin\\n {$IFDEF FPC}\\n writeln(stderr, 'Unable to open output file: ', filename);\\n {$ELSE}\\n writeln('ERROR: Unable to open output file: ', filename);\\n {$ENDIF}\\n exit;\\n end;\\n\\n writeln(outfile, 'P6');\\n writeln(outfile, ' ', comment);\\n writeln(outfile, ' ', ixmax);\\n writeln(outfile, ' ', iymax);\\n writeln(outfile, ' ', maxcolorcomponentvalue);\\n\\n for iy := 1 to iymax do\\n begin\\n cy := cymin + (iy - 1)*pixelheight;\\n if abs(cy) < pixelheight / 2 then cy := 0.0;\\n for ix := 1 to ixmax do\\n begin\\n cx := cxmin + (ix - 1)*pixelwidth;\\n zx := 0.0;\\n zy := 0.0;\\n zx2 := zx*zx;\\n zy2 := zy*zy;\\n iteration := 0;\\n while (iteration < maxiteration) and (zx2 + zy2 < er2) do\\n begin\\n zy := 2*zx*zy + cy;\\n zx := zx2 - zy2 + cx;\\n zx2 := zx*zx;\\n zy2 := zy*zy;\\n iteration := iteration + 1;\\n end;\\n if iteration = maxiteration then\\n begin\\n color.red := 0;\\n color.green := 0;\\n color.blue := 0;\\n end\\n else\\n begin\\n color.red := 255;\\n color.green := 255;\\n color.blue := 255;\\n end;\\n write(outfile, chr(color.red), chr(color.green), chr(color.blue));\\n end;\\n end;\\n\\n close(outfile);\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"###sysinclude standard.uh\\n###sysinclude str.uh\\n###sysinclude system.uh\\n###sysinclude X.uh\\n$ff0000 sto szin\\n300 sto maxiter\\nmaxypixel sto YRES\\nmaxxpixel sto XRES\\nmyscreen \\\"Mandelbrot\\\" @YRES @XRES graphic\\n#g\\n@YRES 2 / (#d) sto y2\\n@YRES 2 / (#d) sto x2\\n@XRES i: {{\\n@YRES {{\\n{{}}§i #g !(#d) 480. - @x2 - @x2 /\\nsto xx\\n{{}} #g !(#d) @y2 - @y2 /\\nsto yy\\nzero#d xa zero#d ya zero iter\\n\\n#d\\nciklus:\\n@xa dup* @ya dup* - @xx +\\n@xa 2. * @ya * @yy + sto ya\\nsto xa ++()#g iter\\n@xa dup* @ya dup* + 4. > @iter @maxiter >=#g |#g then §ciklusvége\\ngoto §ciklus\\nciklusvége:\\n@iter @maxiter ==#g {\\nmyscreen {{}} {{}}§i @szin setpixel\\n}{\\nmyscreen {{}} {{}}§i @iter 64 *#g setpixel\\n}\\n}}\\n}}\\nmyscreen 10000 key?\\nvége: myscreen inv graphic\\n//.\\\"A lenyomott billentyű: \\\" kprintnl\\nend\\n{ „xx” }\\n{ „x2” }\\n{ „yy” }\\n{ „y2” }\\n{ „xa” }\\n{ „ya” }\\n{ „iter” }\\n{ „maxiter” }\\n{ „szin” }\\n{ „YRES” }\\n{ „XRES” }\\n{ „myscreen” }\\n\",\n \"language\": \"Peri\"\n },\n {\n \"code\": \"use Math::Complex;\\n\\nsub mandelbrot {\\n my ($z, $c) = @_[0,0];\\n for (1 .. 20) {\\n $z = $z * $z + $c;\\n return $_ if abs $z > 2;\\n }\\n}\\n\\nfor (my $y = 1; $y >= -1; $y -= 0.05) {\\n for (my $x = -2; $x <= 0.5; $x += 0.0315)\\n {print mandelbrot($x + $y * i) ? ' ' : '#'}\\n print \\\"\\\\n\\\"\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"--\\n-- Mandlebrot set in ascii art demo.\\n--\\nconstant b=\\\" .:,;!/>)|&IH%*#\\\"\\natom r, i, c, C, z, Z, t, k\\n for y=30 to 0 by -1 do\\n C = y*0.1-1.5\\n puts(1,'\\\\n')\\n for x=0 to 74 do\\n c = x*0.04-2\\n z = 0\\n Z = 0\\n r = c\\n i = C\\n k = 0\\n while k<112 do\\n t = z*z-Z*Z+r\\n Z = 2*z*Z+i\\n z = t\\n if z*z+Z*Z>10 then exit end if\\n k += 1\\n end while\\n puts(1,b[remainder(k,16)+1])\\n end for\\n end for\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"include arwen.ew\\ninclude ..\\\\arwen\\\\dib256.ew\\n\\nconstant HelpText = \\\"Left-click drag with the mouse to move the image.\\\\n\\\"&\\n \\\" (the image is currently only redrawn on mouseup).\\\\n\\\"&\\n \\\"Right-click-drag with the mouse to select a region to zoom in to.\\\\n\\\"&\\n \\\"Use the mousewheel to zoom in and out (nb: can be slow).\\\\n\\\"&\\n \\\"Press F2 to select iterations, higher==more detail but slower.\\\\n\\\"&\\n \\\"Resize the window as you please, but note that going fullscreen, \\\\n\\\"&\\n \\\"especially at high iteration, may mean a quite long draw time.\\\\n\\\"&\\n \\\"Press Escape to close the window.\\\"\\n\\nprocedure Help()\\n void = messageBox(\\\"Mandelbrot Set\\\",HelpText,MB_OK)\\nend procedure\\n\\ninteger cWidth = 520 -- client area width\\ninteger cHeight = 480 -- client area height\\n\\nconstant Main = create(Window, \\\"Mandelbrot Set\\\", 0, 0, 50, 50, cWidth+16, cHeight+38, 0),\\n mainHwnd = getHwnd(Main),\\n mainDC = getPrivateDC(Main),\\n\\n mIter = create(Menu, \\\"\\\", 0, 0, 0,0,0,0,0),\\n iterHwnd = getHwnd(mIter),\\n mIter50 = create(MenuItem,\\\"50 (fast, low detail)\\\", 0, mIter, 0,0,0,0,0),\\n mIter100 = create(MenuItem,\\\"100 (default)\\\", 0, mIter, 0,0,0,0,0),\\n mIter500 = create(MenuItem,\\\"500\\\", 0, mIter, 0,0,0,0,0),\\n mIter1000 = create(MenuItem,\\\"1000 (slow, high detail)\\\",0, mIter, 0,0,0,0,0),\\n m50to1000 = {mIter50,mIter100,mIter500,mIter1000},\\n i50to1000 = { 50, 100, 500, 1000}\\n\\ninteger mainDib = 0\\n\\nconstant whitePen = c_func(xCreatePen, {0,1,BrightWhite})\\nconstant NULL_BRUSH = 5,\\n NullBrushID = c_func(xGetStockObject,{NULL_BRUSH})\\n\\natom t0\\ninteger iter\\natom x0, y0 -- top-left coords to draw\\natom scale -- controls width/zoom\\n\\nprocedure init()\\n x0 = -2\\n y0 = -1.25\\n scale = 2.5/cHeight\\n iter = 100\\n void = c_func(xSelectObject,{mainDC,whitePen})\\n void = c_func(xSelectObject,{mainDC,NullBrushID})\\nend procedure\\ninit()\\n\\nfunction in_set(atom x, atom y)\\natom u,t\\n if x>-0.75 then\\n u = x-0.25\\n t = u*u+y*y\\n return ((2*t+u)*(2*t+u)>t)\\n else\\n return ((x+1)*(x+1)+y*y)>0.0625\\n end if\\nend function\\n\\nfunction pixel_colour(atom x0, atom y0, integer iter)\\ninteger count = 1\\natom x = 0, y = 0\\n while (count<=iter) and (x*x+y*y<4) do\\n count += 1\\n {x,y} = {x*x-y*y+x0,2*x*y+y0}\\n end while\\n if count<=iter then return count end if\\n return 0\\nend function\\n\\nprocedure mandel(atom x0, atom y0, atom scale)\\natom x,y\\ninteger c\\n t0 = time()\\n y = y0\\n for yi=1 to cHeight do\\n x = x0\\n for xi=1 to cWidth do\\n c = 0 -- default to black\\n if in_set(x,y) then\\n c = pixel_colour(x,y,iter)\\n end if\\n setDibPixel(mainDib, xi, yi, c)\\n x += scale\\n end for\\n y += scale\\n end for\\nend procedure\\n\\ninteger firsttime = 1\\ninteger drawBox = 0\\ninteger drawTime = 0\\n\\nprocedure newDib()\\nsequence pal\\n\\n if mainDib!=0 then\\n {} = deleteDib(mainDib)\\n end if\\n mainDib = createDib(cWidth, cHeight)\\n pal = repeat({0,0,0},256)\\n for i=2 to 256 do\\n pal[i][1] = i*5\\n pal[i][2] = 0\\n pal[i][3] = i*10\\n end for\\n setDibPalette(mainDib, 1, pal)\\n mandel(x0,y0,scale)\\n drawTime = 2\\nend procedure\\n\\nprocedure reDraw()\\n setText(Main,\\\"Please Wait...\\\")\\n mandel(x0,y0,scale)\\n drawTime = 2\\n repaintWindow(Main,False)\\nend procedure\\n\\nprocedure zoom(integer z)\\n while z do\\n if z>0 then\\n scale /= 1.1\\n z -= 1\\n else\\n scale *= 1.1\\n z += 1\\n end if\\n end while\\n reDraw()\\nend procedure\\n\\ninteger dx=0,dy=0 -- mouse down coords\\ninteger mx=0,my=0 -- mouse move/up coords\\n\\nfunction mainHandler(integer id, integer msg, atom wParam, object lParam)\\ninteger x, y -- scratch vars\\natom scale10\\n\\n if msg=WM_SIZE then -- (also activate/firsttime)\\n {{},{},x,y} = getClientRect(Main)\\n if firsttime or cWidth!=x or cHeight!=y then\\n scale *= cWidth/x\\n {cWidth, cHeight} = {x,y}\\n newDib()\\n firsttime = 0\\n end if\\n elsif msg=WM_PAINT then\\n copyDib(mainDC, 0, 0, mainDib)\\n if drawBox then\\n void = c_func(xRectangle, {mainDC, dx, dy, mx, my})\\n end if\\n if drawTime then\\n if drawTime=2 then\\n setText(Main,sprintf(\\\"Mandelbrot Set [generated in %gs]\\\",time()-t0))\\n else\\n setText(Main,\\\"Mandelbrot Set\\\")\\n end if\\n drawTime -= 1\\n end if\\n elsif msg=WM_CHAR then\\n if wParam=VK_ESCAPE then\\n closeWindow(Main)\\n elsif wParam='+' then zoom(+1)\\n elsif wParam='-' then zoom(-1)\\n end if\\n elsif msg=WM_LBUTTONDOWN\\n or msg=WM_RBUTTONDOWN then\\n {dx,dy} = lParam\\n elsif msg=WM_MOUSEMOVE then\\n if and_bits(wParam,MK_LBUTTON) then\\n {mx,my} = lParam\\n -- minus dx,dy (see WM_LBUTTONUP)\\n -- DEV maybe a timer to redraw, but probably too slow...\\n -- (this is where we need a background worker thread,\\n -- ideally one we can direct to abandon what it is\\n -- currently doing and start work on new x,y instead)\\n elsif and_bits(wParam,MK_RBUTTON) then\\n {mx,my} = lParam\\n drawBox = 1\\n repaintWindow(Main,False)\\n end if\\n elsif msg=WM_MOUSEWHEEL then\\n wParam = floor(wParam/#10000)\\n if wParam>=#8000 then -- sign bit set\\n wParam-=#10000\\n end if\\n wParam = floor(wParam/120) -- (gives +/-1, usually)\\n zoom(wParam)\\n elsif msg=WM_LBUTTONUP then\\n {mx,my} = lParam\\n drawBox = 0\\n x0 += (dx-mx)*scale\\n y0 += (dy-my)*scale\\n reDraw()\\n elsif msg=WM_RBUTTONUP then\\n {mx,my} = lParam\\n drawBox = 0\\n if mx!=dx and my!=dy then\\n x0 += min(mx,dx)*scale\\n y0 += min(my,dy)*scale\\n scale *= (abs(mx-dx))/cHeight\\n reDraw()\\n end if\\n elsif msg=WM_KEYDOWN then\\n if wParam=VK_F1 then\\n Help()\\n elsif wParam=VK_F2 then\\n {x,y} = getWindowRect(Main)\\n void = c_func(xTrackPopupMenu, {iterHwnd,TPM_LEFTALIGN,x+20,y+40,0,mainHwnd,NULL})\\n elsif find(wParam,{VK_UP,VK_DOWN,VK_LEFT,VK_RIGHT}) then\\n drawBox = 0\\n scale10 = scale*10\\n if wParam=VK_UP then\\n y0 += scale10\\n elsif wParam=VK_DOWN then\\n y0 -= scale10\\n elsif wParam=VK_LEFT then\\n x0 += scale10\\n elsif wParam=VK_RIGHT then\\n x0 -= scale10\\n end if\\n reDraw()\\n end if\\n elsif msg=WM_COMMAND then\\n id = find(id,m50to1000)\\n if id!=0 then\\n iter = i50to1000[id]\\n reDraw()\\n end if\\n end if\\n return 0\\nend function\\nsetHandler({Main,mIter50,mIter100,mIter500,mIter1000}, routine_id(\\\"mainHandler\\\"))\\n\\nWinMain(Main,SW_NORMAL)\\nvoid = deleteDib(0)\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"$min_x=-2;\\n$max_x=1;\\n$min_y=-1;\\n$max_y=1;\\n\\n$dim_x=400;\\n$dim_y=300;\\n\\n$im = @imagecreate($dim_x, $dim_y)\\n or die(\\\"Cannot Initialize new GD image stream\\\");\\nheader(\\\"Content-Type: image/png\\\");\\n$black_color = imagecolorallocate($im, 0, 0, 0);\\n$white_color = imagecolorallocate($im, 255, 255, 255);\\n\\nfor($y=0;$y<=$dim_y;$y++) {\\n for($x=0;$x<=$dim_x;$x++) {\\n $c1=$min_x+($max_x-$min_x)/$dim_x*$x;\\n $c2=$min_y+($max_y-$min_y)/$dim_y*$y;\\n\\n $z1=0;\\n $z2=0;\\n\\n for($i=0;$i<100;$i++) {\\n $new1=$z1*$z1-$z2*$z2+$c1;\\n $new2=2*$z1*$z2+$c2;\\n $z1=$new1;\\n $z2=$new2;\\n if($z1*$z1+$z2*$z2>=4) {\\n break;\\n }\\n }\\n if($i<100) {\\n imagesetpixel ($im, $x, $y, $white_color);\\n }\\n }\\n}\\n\\nimagepng($im);\\nimagedestroy($im);\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"go =>\\n\\n Width = 90,\\n Height = 50,\\n Limit = 50,\\n foreach(Y in 1..Height)\\n P=\\\"\\\",\\n foreach (X in 1..Width)\\n Z=complex(0,0),\\n C=complex(2.5*X/Width-2.0,2.0*Y/Height-1.0),\\n J = 0,\\n while (J < Limit, c_abs(Z)<2.0)\\n Z := c_add(c_mul(Z,Z),C),\\n J := J + 1\\n end,\\n if J == Limit then\\n P := P ++ \\\"#\\\"\\n else\\n P := P ++ \\\".\\\"\\n end\\n end,\\n printf(\\\"%s\\\\n\\\", P)\\n end,\\n nl.\\n\\n% Operations on complex numbers\\ncomplex(R,I) = [R,I].\\nc_add(X,Y) = complex(X[1]+Y[1],X[2]+Y[2]).\\nc_mul(X,Y) = complex(X[1]*Y[1]-X[2]*Y[2],X[1]*Y[2]+X[2]*Y[1]).\\nc_abs(X) = sqrt(X[1]*X[1]+X[2]*X[2]).\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(scl 6)\\n\\n(let Ppm (make (do 300 (link (need 400))))\\n (for (Y . Row) Ppm\\n (for (X . @) Row\\n (let (ZX 0 ZY 0 CX (*/ (- X 250) 1.0 150) CY (*/ (- Y 150) 1.0 150) C 570)\\n (while (and (> 4.0 (+ (*/ ZX ZX 1.0) (*/ ZY ZY 1.0))) (gt0 C))\\n (let Tmp (- (*/ ZX ZX 1.0) (*/ ZY ZY 1.0) (- CX))\\n (setq\\n ZY (+ (*/ 2 ZX ZY 1.0) CY)\\n ZX Tmp ) )\\n (dec 'C) )\\n (set (nth Ppm Y X) (list 0 C C)) ) ) )\\n (out \\\"img.ppm\\\"\\n (prinl \\\"P6\\\")\\n (prinl 400 \\\" \\\" 300)\\n (prinl 255)\\n (for Y Ppm (for X Y (apply wr X))) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"%!PS-Adobe-2.0\\n%%BoundingBox: 0 0 300 200\\n%%EndComments\\n/origstate save def\\n/ld {load def} bind def\\n/m /moveto ld /g /setgray ld\\n/dot { currentpoint 1 0 360 arc fill } bind def\\n%%EndProlog\\n% param\\n/maxiter 200 def\\n% complex manipulation\\n/complex { 2 array astore } def\\n/real { 0 get } def\\n/imag { 1 get } def\\n/cmul { /a exch def /b exch def\\n a real b real mul\\n a imag b imag mul sub\\n a real b imag mul\\n a imag b real mul add\\n 2 array astore\\n} def\\n/cadd { aload pop 3 -1 roll aload pop\\n 3 -1 roll add\\n 3 1 roll add exch 2 array astore\\n} def\\n/cconj { aload pop neg 2 array astore } def\\n/cabs2 { dup cconj cmul 0 get} def\\n% mandel\\n200 100 translate\\n-200 1 100 { /x exch def\\n -100 1 100 { /y exch def\\n /z0 0.0 0.0 complex def\\n 0 1 maxiter { /iter exch def\\n\\tx 100 div y 100 div complex\\n\\tz0 z0 cmul\\n\\tcadd dup /z0 exch def\\n\\tcabs2 4 gt {exit} if\\n } for\\n iter maxiter div g\\n x y m dot\\n } for\\n} for\\n%\\nshowpage\\norigstate restore\\n%%EOF\\n\",\n \"language\": \"PostScript\"\n },\n {\n \"code\": \"$x = $y = $i = $j = $r = -16\\n$colors = [Enum]::GetValues([System.ConsoleColor])\\n\\nwhile(($y++) -lt 15)\\n{\\n for($x=0; ($x++) -lt 84; Write-Host \\\" \\\" -BackgroundColor ($colors[$k -band 15]) -NoNewline)\\n {\\n $i = $k = $r = 0\\n\\n do\\n {\\n $j = $r * $r - $i * $i -2 + $x / 25\\n $i = 2 * $r * $i + $y / 10\\n $r = $j\\n }\\n while (($j * $j + $i * $i) -lt 11 -band ($k++) -lt 111)\\n }\\n\\n Write-Host\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"double x, y, zr, zi, zr2, zi2, cr, ci, n;\\ndouble zmx1, zmx2, zmy1, zmy2, f, di, dj;\\ndouble fn1, fn2, fn3, re, gr, bl, xt, yt, i, j;\\n\\nvoid setup() {\\n size(500, 500);\\n di = 0;\\n dj = 0;\\n f = 10;\\n fn1 = random(20);\\n fn2 = random(20);\\n fn3 = random(20);\\n zmx1 = int(width / 4);\\n zmx2 = 2;\\n zmy1 = int(height / 4);\\n zmy2 = 2;\\n}\\n\\nvoid draw() {\\n if (i <= width) i++;\\n x = (i + di)/ zmx1 - zmx2;\\n for ( j = 0; j <= height; j++) {\\n y = zmy2 - (j + dj) / zmy1;\\n zr = 0;\\n zi = 0;\\n zr2 = 0;\\n zi2 = 0;\\n cr = x;\\n ci = y;\\n n = 1;\\n while (n < 200 && (zr2 + zi2) < 4) {\\n zi2 = zi * zi;\\n zr2 = zr * zr;\\n zi = 2 * zi * zr + ci;\\n zr = zr2 - zi2 + cr;\\n n++;\\n }\\n re = (n * fn1) % 255;\\n gr = (n * fn2) % 255;\\n bl = (n * fn3) % 255;\\n stroke((float)re, (float)gr, (float)bl);\\n point((float)i, (float)j);\\n }\\n}\\n\\nvoid mousePressed() {\\n background(200);\\n xt = mouseX;\\n yt = mouseY;\\n di = di + xt - float(width / 2);\\n dj = dj + yt - float(height / 2);\\n zmx1 = zmx1 * f;\\n zmx2 = zmx2 * (1 / f);\\n zmy1 = zmy1 * f;\\n zmy2 = zmy2 * (1 / f);\\n di = di * f;\\n dj = dj * f;\\n i = 0;\\n j = 0;\\n}\\n\",\n \"language\": \"Processing\"\n },\n {\n \"code\": \"i = di = dj = 0\\nfn1, fn2, fn3 = random(20), random(20), random(20)\\nf = 10\\n\\ndef setup():\\n global zmx1, zmx2, zmy1, zmy2\\n size(500, 500)\\n zmx1 = int(width / 4)\\n zmx2 = 2\\n zmy1 = int(height / 4)\\n zmy2 = 2\\n\\n\\ndef draw():\\n global i\\n\\n if i <= width:\\n i += 1\\n x = float(i + di) / zmx1 - zmx2\\n for j in range(height + 1):\\n y = zmy2 - float(j + dj) / zmy1\\n zr = zi = zr2 = zi2 = 0\\n cr, ci = x, y\\n n = 1\\n while n < 200 and (zr2 + zi2) < 4:\\n zi2 = zi * zi\\n zr2 = zr * zr\\n zi = 2 * zi * zr + ci\\n zr = zr2 - zi2 + cr\\n n += 1\\n\\n re = (n * fn1) % 255\\n gr = (n * fn2) % 255\\n bl = (n * fn3) % 255\\n stroke(re, gr, bl)\\n point(i, j)\\n\\n\\ndef mousePressed():\\n global zmx1, zmx2, zmy1, zmy2, di, dj\\n global i, j\\n background(200)\\n xt, yt = mouseX, mouseY\\n di = di + xt - width / 2.\\n dj = dj + yt - height / 2.\\n zmx1 = zmx1 * f\\n zmx2 = zmx2 * (1. / f)\\n zmy1 = zmy1 * f\\n zmy2 = zmy2 * (1. / f)\\n di, dj = di * f, dj * f\\n i = j = 0\\n\",\n \"language\": \"Processing-Python-mode\"\n },\n {\n \"code\": \":- use_module(library(pce)).\\n\\nmandelbrot :-\\n new(D, window('Mandelbrot Set')),\\n send(D, size, size(700, 650)),\\n new(Img, image(@nil, width := 700, height := 650, kind := pixmap)),\\n\\n forall(between(0,699, I),\\n ( forall(between(0,649, J),\\n ( get_RGB(I, J, R, G, B),\\n R1 is (R * 256) mod 65536,\\n G1 is (G * 256) mod 65536,\\n B1 is (B * 256) mod 65536,\\n send(Img, pixel(I, J, colour(@default, R1, G1, B1))))))),\\n new(Bmp, bitmap(Img)),\\n send(D, display, Bmp, point(0,0)),\\n send(D, open).\\n\\nget_RGB(X, Y, R, G, B) :-\\n CX is (X - 350) / 150,\\n CY is (Y - 325) / 150,\\n Iter = 570,\\n compute_RGB(CX, CY, 0, 0, Iter, It),\\n IterF is It \\\\/ It << 15,\\n R is IterF >> 16,\\n Iter1 is IterF - R << 16,\\n G is Iter1 >> 8,\\n B is Iter1 - G << 8.\\n\\ncompute_RGB(CX, CY, ZX, ZY, Iter, IterF) :-\\n ZX * ZX + ZY * ZY < 4,\\n Iter > 0,\\n !,\\n Tmp is ZX * ZX - ZY * ZY + CX,\\n ZY1 is 2 * ZX * ZY + CY,\\n Iter1 is Iter - 1,\\n compute_RGB(CX, CY, Tmp, ZY1, Iter1, IterF).\\n\\ncompute_RGB(_CX, _CY, _ZX, _ZY, Iter, Iter).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"EnableExplicit\\n\\n#Window1 = 0\\n#Image1 = 0\\n#ImgGadget = 0\\n\\n#max_iteration = 64\\n#width = 800\\n#height = 600\\nDefine.d x0 ,y0 ,xtemp ,cr, ci\\nDefine.i i, n, x, y ,Event ,color\\n\\nDim Color.l (255)\\nFor n = 0 To 63\\n Color( 0 + n ) = RGB( n*4+128, 4 * n, 0 )\\n Color( 64 + n ) = RGB( 64, 255, 4 * n )\\n Color( 128 + n ) = RGB( 64, 255 - 4 * n , 255 )\\n Color( 192 + n ) = RGB( 64, 0, 255 - 4 * n )\\nNext\\n\\nIf OpenWindow(#Window1, 0, 0, #width, #height, \\\"'Mandelbrot set' PureBasic Example\\\", #PB_Window_SystemMenu )\\n If CreateImage(#Image1, #width, #height)\\n ImageGadget(#ImgGadget, 0, 0, #width, #height, ImageID(#Image1))\\n For y.i = 1 To #height -1\\n StartDrawing(ImageOutput(#Image1))\\n For x.i = 1 To #width -1\\n x0 = 0\\n y0 = 0;\\n cr = (x / #width)*2.5 -2\\n ci = (y / #height)*2.5 -1.25\\n i = 0\\n While (x0*x0 + y0*y0 <= 4.0) And i < #max_iteration\\n i +1\\n xtemp = x0*x0 - y0*y0 + cr\\n y0 = 2*x0*y0 + ci\\n x0 = xtemp\\n Wend\\n If i >= #max_iteration\\n Plot(x, y, 0 )\\n Else\\n Plot(x, y, Color(i & 255))\\n EndIf\\n\\n Next\\n StopDrawing()\\n SetGadgetState(#ImgGadget, ImageID(#Image1))\\n Repeat\\n Event = WindowEvent()\\n If Event = #PB_Event_CloseWindow\\n End\\n EndIf\\n Until Event = 0\\n Next\\n EndIf\\n Repeat\\n Event = WaitWindowEvent()\\n Until Event = #PB_Event_CloseWindow\\n EndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"# Python 3.0+ and 2.5+\\ntry:\\n from functools import reduce\\nexcept:\\n pass\\n\\n\\ndef mandelbrot(a):\\n return reduce(lambda z, _: z * z + a, range(50), 0)\\n\\ndef step(start, step, iterations):\\n return (start + (i * step) for i in range(iterations))\\n\\nrows = ((\\\"*\\\" if abs(mandelbrot(complex(x, y))) < 2 else \\\" \\\"\\n for x in step(-2.0, .0315, 80))\\n for y in step(1, -.05, 41))\\n\\nprint(\\\"\\\\n\\\".join(\\\"\\\".join(row) for row in rows))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from functools import reduce\\n\\ndef mandelbrot(x, y, c): return ' *'[abs(reduce(lambda z, _: z*z + c, range(99), 0)) < 2]\\n\\nprint('\\\\n'.join(''.join(mandelbrot(x, y, x/50 + y/50j) for x in range(-100, 25)) for y in range(-50, 50)))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import math\\n\\ndef mandelbrot(z , c , n=40):\\n if abs(z) > 1000:\\n return float(\\\"nan\\\")\\n elif n > 0:\\n return mandelbrot(z ** 2 + c, c, n - 1)\\n else:\\n return z ** 2 + c\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join([\\\"#\\\" if not math.isnan(mandelbrot(0, x + 1j * y).real) else \\\" \\\"\\n for x in [a * 0.02 for a in range(-80, 30)]])\\n for y in [a * 0.05 for a in range(-20, 20)]])\\n )\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from pylab import *\\nfrom numpy import NaN\\n\\ndef m(a):\\n\\tz = 0\\n\\tfor n in range(1, 100):\\n\\t\\tz = z**2 + a\\n\\t\\tif abs(z) > 2:\\n\\t\\t\\treturn n\\n\\treturn NaN\\n\\nX = arange(-2, .5, .002)\\nY = arange(-1, 1, .002)\\nZ = zeros((len(Y), len(X)))\\n\\nfor iy, y in enumerate(Y):\\n\\tprint (iy, \\\"of\\\", len(Y))\\n\\tfor ix, x in enumerate(X):\\n\\t\\tZ[iy,ix] = m(x + 1j * y)\\n\\nimshow(Z, cmap = plt.cm.prism, interpolation = 'none', extent = (X.min(), X.max(), Y.min(), Y.max()))\\nxlabel(\\\"Re(c)\\\")\\nylabel(\\\"Im(c)\\\")\\nsavefig(\\\"mandelbrot_python.svg\\\")\\nshow()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import matplotlib.pyplot as plt\\nimport numpy as np\\n\\nnpts = 300\\nmax_iter = 100\\n\\nX = np.linspace(-2, 1, 2 * npts)\\nY = np.linspace(-1, 1, npts)\\n\\n#broadcast X to a square array\\nC = X[:, None] + 1J * Y\\n#initial value is always zero\\nZ = np.zeros_like(C)\\n\\nexit_times = max_iter * np.ones(C.shape, np.int32)\\nmask = exit_times > 0\\n\\nfor k in range(max_iter):\\n Z[mask] = Z[mask] * Z[mask] + C[mask]\\n mask, old_mask = abs(Z) < 2, mask\\n #use XOR to detect the area which has changed\\n exit_times[mask ^ old_mask] = k\\n\\nplt.imshow(exit_times.T,\\n cmap=plt.cm.prism,\\n extent=(X.min(), X.max(), Y.min(), Y.max()))\\nplt.show()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import numpy as np\\nimport matplotlib.pyplot as plt\\n\\nd, h = 800, 500 # pixel density (= image width) and image height\\nn, r = 200, 500 # number of iterations and escape radius (r > 2)\\n\\nx = np.linspace(0, 2, num=d+1)\\ny = np.linspace(0, 2 * h / d, num=h+1)\\n\\nA, B = np.meshgrid(x - 1, y - h / d)\\nC = 2.0 * (A + B * 1j) - 0.5\\n\\nZ, dZ = np.zeros_like(C), np.zeros_like(C)\\nD, S, T = np.zeros(C.shape), np.zeros(C.shape), np.zeros(C.shape)\\n\\nfor k in range(n):\\n M = abs(Z) < r\\n S[M], T[M] = S[M] + np.exp(- abs(Z[M])), T[M] + 1\\n Z[M], dZ[M] = Z[M] ** 2 + C[M], 2 * Z[M] * dZ[M] + 1\\n\\nplt.imshow(S ** 0.1, cmap=plt.cm.twilight_shifted, origin=\\\"lower\\\")\\nplt.savefig(\\\"Mandelbrot_set_1.png\\\", dpi=200)\\n\\nN = abs(Z) >= r # normalized iteration count\\nT[N] = T[N] - np.log2(np.log(np.abs(Z[N])) / np.log(r))\\n\\nplt.imshow(T ** 0.1, cmap=plt.cm.twilight_shifted, origin=\\\"lower\\\")\\nplt.savefig(\\\"Mandelbrot_set_2.png\\\", dpi=200)\\n\\nN = abs(Z) > 2 # exterior distance estimation\\nD[N] = np.log(abs(Z[N])) * abs(Z[N]) / abs(dZ[N])\\n\\nplt.imshow(D ** 0.1, cmap=plt.cm.twilight_shifted, origin=\\\"lower\\\")\\nplt.savefig(\\\"Mandelbrot_set_3.png\\\", dpi=200)\\n\\nN, thickness = D > 0, 0.01 # boundary detection\\nD[N] = np.maximum(1 - D[N] / thickness, 0)\\n\\nplt.imshow(D ** 2.0, cmap=plt.cm.binary, origin=\\\"lower\\\")\\nplt.savefig(\\\"Mandelbrot_set_4.png\\\", dpi=200)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import numpy as np\\nimport matplotlib.pyplot as plt\\n\\nd, h = 800, 500 # pixel density (= image width) and image height\\nn, r = 200, 500 # number of iterations and escape radius (r > 2)\\n\\ndirection, height = 45.0, 1.5 # direction and height of the light\\ndensity, intensity = 4.0, 0.5 # density and intensity of the stripes\\n\\nx = np.linspace(0, 2, num=d+1)\\ny = np.linspace(0, 2 * h / d, num=h+1)\\n\\nA, B = np.meshgrid(x - 1, y - h / d)\\nC = (2.0 + 1.0j) * (A + B * 1j) - 0.5\\n\\nZ, dZ, ddZ = np.zeros_like(C), np.zeros_like(C), np.zeros_like(C)\\nD, S, T = np.zeros(C.shape), np.zeros(C.shape), np.zeros(C.shape)\\n\\nfor k in range(n):\\n M = abs(Z) < r\\n S[M], T[M] = S[M] + np.sin(density * np.angle(Z[M])), T[M] + 1\\n Z[M], dZ[M], ddZ[M] = Z[M] ** 2 + C[M], 2 * Z[M] * dZ[M] + 1, 2 * (dZ[M] ** 2 + Z[M] * ddZ[M])\\n\\nN = abs(Z) >= r # basic normal map effect and stripe average coloring (potential function)\\nP, Q = S[N] / T[N], (S[N] + np.sin(density * np.angle(Z[N]))) / (T[N] + 1)\\nU, V = Z[N] / dZ[N], 1 + (np.log2(np.log(np.abs(Z[N])) / np.log(r)) * (P - Q) + Q) * intensity\\nU, v = U / abs(U), np.exp(direction / 180 * np.pi * 1j) # unit normal vectors and light vector\\nD[N] = np.maximum((U.real * v.real + U.imag * v.imag + V * height) / (1 + height), 0)\\n\\nplt.imshow(D ** 1.0, cmap=plt.cm.bone, origin=\\\"lower\\\")\\nplt.savefig(\\\"Mandelbrot_normal_map_1.png\\\", dpi=200)\\n\\nN = abs(Z) > 2 # advanced normal map effect using higher derivatives (distance estimation)\\nU = Z[N] * dZ[N] * ((1 + np.log(abs(Z[N]))) * np.conj(dZ[N] ** 2) - np.log(abs(Z[N])) * np.conj(Z[N] * ddZ[N]))\\nU, v = U / abs(U), np.exp(direction / 180 * np.pi * 1j) # unit normal vectors and light vector\\nD[N] = np.maximum((U.real * v.real + U.imag * v.imag + height) / (1 + height), 0)\\n\\nplt.imshow(D ** 1.0, cmap=plt.cm.afmhot, origin=\\\"lower\\\")\\nplt.savefig(\\\"Mandelbrot_normal_map_2.png\\\", dpi=200)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import numpy as np\\nimport matplotlib.pyplot as plt\\n\\nd, h = 200, 1200 # pixel density (= image width) and image height\\nn, r = 8000, 10000 # number of iterations and escape radius (r > 2)\\n\\na = -.743643887037158704752191506114774 # https://mathr.co.uk/web/m-location-analysis.html\\nb = 0.131825904205311970493132056385139 # try: a, b, n = -1.748764520194788535, 3e-13, 800\\n\\nx = np.linspace(0, 2, num=d+1)\\ny = np.linspace(0, 2 * h / d, num=h+1)\\n\\nA, B = np.meshgrid(x * np.pi, y * np.pi)\\nC = 8.0 * np.exp((A + B * 1j) * 1j) + (a + b * 1j)\\n\\nZ, dZ = np.zeros_like(C), np.zeros_like(C)\\nD = np.zeros(C.shape)\\n\\nfor k in range(n):\\n M = Z.real ** 2 + Z.imag ** 2 < r ** 2\\n Z[M], dZ[M] = Z[M] ** 2 + C[M], 2 * Z[M] * dZ[M] + 1\\n\\nN = abs(Z) > 2 # exterior distance estimation\\nD[N] = np.log(abs(Z[N])) * abs(Z[N]) / abs(dZ[N])\\n\\nplt.imshow(D.T ** 0.05, cmap=plt.cm.nipy_spectral, origin=\\\"lower\\\")\\nplt.savefig(\\\"Mercator_Mandelbrot_map.png\\\", dpi=200)\\n\\nX, Y = C.real, C.imag # zoom images (adjust circle size 100 and zoom level 20 as needed)\\nR, c, z = 100 * (2 / d) * np.pi * np.exp(- B), min(d, h) + 1, max(0, h - d) // 20\\n\\nfig, ax = plt.subplots(2, 2, figsize=(12, 12))\\nax[0,0].scatter(X[1*z:1*z+c,0:d], Y[1*z:1*z+c,0:d], s=R[0:c,0:d]**2, c=D[1*z:1*z+c,0:d]**.5, cmap=plt.cm.nipy_spectral)\\nax[0,1].scatter(X[2*z:2*z+c,0:d], Y[2*z:2*z+c,0:d], s=R[0:c,0:d]**2, c=D[2*z:2*z+c,0:d]**.4, cmap=plt.cm.nipy_spectral)\\nax[1,0].scatter(X[3*z:3*z+c,0:d], Y[3*z:3*z+c,0:d], s=R[0:c,0:d]**2, c=D[3*z:3*z+c,0:d]**.3, cmap=plt.cm.nipy_spectral)\\nax[1,1].scatter(X[4*z:4*z+c,0:d], Y[4*z:4*z+c,0:d], s=R[0:c,0:d]**2, c=D[4*z:4*z+c,0:d]**.2, cmap=plt.cm.nipy_spectral)\\nplt.savefig(\\\"Mercator_Mandelbrot_zoom.png\\\", dpi=100)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import numpy as np\\nimport matplotlib.pyplot as plt\\n\\nimport decimal as dc # decimal floating point arithmetic with arbitrary precision\\ndc.getcontext().prec = 80 # set precision to 80 digits (about 256 bits)\\n\\nd, h = 50, 1000 # pixel density (= image width) and image height\\nn, r = 80000, 100000 # number of iterations and escape radius (r > 2)\\n\\na = dc.Decimal(\\\"-1.256827152259138864846434197797294538253477389787308085590211144291\\\")\\nb = dc.Decimal(\\\".37933802890364143684096784819544060002129071484943239316486643285025\\\")\\n\\nS = np.zeros(n+1, dtype=np.complex128)\\nu, v = dc.Decimal(0), dc.Decimal(0)\\n\\nfor k in range(n+1):\\n S[k] = float(u) + float(v) * 1j\\n if u ** 2 + v ** 2 < r ** 2:\\n u, v = u ** 2 - v ** 2 + a, 2 * u * v + b\\n else:\\n print(\\\"The reference sequence diverges within %s iterations.\\\" % k)\\n break\\n\\nx = np.linspace(0, 2, num=d+1, dtype=np.float64)\\ny = np.linspace(0, 2 * h / d, num=h+1, dtype=np.float64)\\n\\nA, B = np.meshgrid(x * np.pi, y * np.pi)\\nC = 8.0 * np.exp((A + B * 1j) * 1j)\\n\\nE, Z, dZ = np.zeros_like(C), np.zeros_like(C), np.zeros_like(C)\\nD, I, J = np.zeros(C.shape), np.zeros(C.shape, dtype=np.int64), np.zeros(C.shape, dtype=np.int64)\\n\\nfor k in range(n):\\n Z2 = Z.real ** 2 + Z.imag ** 2\\n M, R = Z2 < r ** 2, Z2 < E.real ** 2 + E.imag ** 2\\n E[R], I[R] = Z[R], J[R] # rebase when z is closer to zero\\n E[M], I[M] = (2 * S[I[M]] + E[M]) * E[M] + C[M], I[M] + 1\\n Z[M], dZ[M] = S[I[M]] + E[M], 2 * Z[M] * dZ[M] + 1\\n\\nN = abs(Z) > 2 # exterior distance estimation\\nD[N] = np.log(abs(Z[N])) * abs(Z[N]) / abs(dZ[N])\\n\\nplt.imshow(D.T ** 0.015, cmap=plt.cm.nipy_spectral, origin=\\\"lower\\\")\\nplt.savefig(\\\"Mercator_Mandelbrot_deep_map.png\\\", dpi=200)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"print(\\n'\\\\n'.join(\\n ''.join(\\n ' *'[(z:=0, c:=x/50+y/50j, [z:=z*z+c for _ in range(99)], abs(z))[-1]<2]\\n for x in range(-100,25)\\n )\\n for y in range(-50,50)\\n))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"/adapted from https://www.linkedin.com/pulse/want-work-k-1010data-michal-wallace\\nq)s:{(.[-]x*x),2*prd x} / complex square (x is R,Im pair)\\nq)m:{floor sqrt sum x*x} / magnitude (distance from origin)\\nq)d: 120 60 / dimensions of the picture\\nq)t: -88 -30 / camera translation\\nq)f: reciprocal 40 20 / scale factor\\n\\nq)c: (,/:\\\\:) . f * t + til each d / complex plane near mandelbrot set\\nq)z: d # enlist 0 0 / 3d array of zeroes in same shape\\nq)mb: c+ (s'')@\\t\\t\\t\\t\\t / mandelbrot: s(z) + c\\nq)r: 1 _ 8 mb\\\\z / collect 8 times\\n\\nq)o: \\\" 12345678\\\"@ sum 2<m'''[r] / \\\"color\\\" by how soon point \\\"escapes\\\"\\n\\nq)-1 \\\"\\\\n\\\"sv flip o; / transpose and print the output\\n\",\n \"language\": \"Q\"\n },\n {\n \"code\": \"SCREEN 13\\nWINDOW (-2, 1.5)-(2, -1.5)\\nFOR x0 = -2 TO 2 STEP .01\\n FOR y0 = -1.5 TO 1.5 STEP .01\\n x = 0\\n y = 0\\n\\n iteration = 0\\n maxIteration = 223\\n\\n WHILE (x * x + y * y <= (2 * 2) AND iteration < maxIteration)\\n xtemp = x * x - y * y + x0\\n y = 2 * x * y + y0\\n\\n x = xtemp\\n\\n iteration = iteration + 1\\n WEND\\n\\n IF iteration <> maxIteration THEN\\n c = iteration\\n ELSE\\n c = 0\\n END IF\\n\\n PSET (x0, y0), c + 32\\n NEXT\\nNEXT\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \"1000 REM Mandelbrot Set Project\\n1010 REM Quite BASIC Math Project\\n1015 REM 'http://www.quitebasic.com/prj/math/mandelbrot/\\n1020 REM ------------------------\\n1030 CLS\\n1040 PRINT \\\"This program plots a graphical representation of the famous Mandelbrot set. It takes a while to finish so have patience and don't have too high expectations; the graphics resolution is not very high on our canvas.\\\"\\n2000 REM Initialize the color palette\\n2010 GOSUB 3000\\n2020 REM L is the maximum iterations to try\\n2030 LET L = 100\\n2040 FOR I = 0 TO 100\\n2050 FOR J = 0 TO 100\\n2060 REM Map from pixel coordinates (I,J) to math (U,V)\\n2060 LET U = I / 50 - 1.5\\n2070 LET V = J / 50 - 1\\n2080 LET X = U\\n2090 LET Y = V\\n2100 LET N = 0\\n2110 REM Inner iteration loop starts here\\n2120 LET R = X * X\\n2130 LET Q = Y * Y\\n2140 IF R + Q > 4 OR N >= L THEN GOTO 2190\\n2150 LET Y = 2 * X * Y + V\\n2160 LET X = R - Q + U\\n2170 LET N = N + 1\\n2180 GOTO 2120\\n2190 REM Compute the color to plot\\n2200 IF N < 10 THEN LET C = \\\"black\\\" ELSE LET C = P[ROUND(8 * (N-10) / (L-10))]\\n2210 PLOT I, J, C\\n2220 NEXT J\\n2230 NEXT I\\n2240 END\\n3000 REM Subroutine -- Set up Palette\\n3010 ARRAY P\\n3020 LET P[0] = \\\"black\\\"\\n3030 LET P[1] = \\\"magenta\\\"\\n3040 LET P[2] = \\\"blue\\\"\\n3050 LET P[3] = \\\"green\\\"\\n3060 LET P[4] = \\\"cyan\\\"\\n3070 LET P[5] = \\\"red\\\"\\n3080 LET P[6] = \\\"orange\\\"\\n3090 LET P[7] = \\\"yellow\\\"\\n3090 LET P[8] = \\\"white\\\"\\n3100 RETURN\\n\",\n \"language\": \"Quite-BASIC\"\n },\n {\n \"code\": \"iterate.until.escape <- function(z, c, trans, cond, max=50, response=dwell) {\\n #we iterate all active points in the same array operation,\\n #and keeping track of which points are still iterating.\\n active <- seq_along(z)\\n dwell <- z\\n dwell[] <- 0\\n for (i in 1:max) {\\n z[active] <- trans(z[active], c[active]);\\n survived <- cond(z[active])\\n dwell[active[!survived]] <- i\\n active <- active[survived]\\n if (length(active) == 0) break\\n }\\n eval(substitute(response))\\n}\\n\\nre = seq(-2, 1, len=500)\\nim = seq(-1.5, 1.5, len=500)\\nc <- outer(re, im, function(x,y) complex(real=x, imaginary=y))\\nx <- iterate.until.escape(array(0, dim(c)), c,\\n function(z,c)z^2+c, function(z)abs(z) <= 2,\\n max=100)\\nimage(x)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#install.packages(\\\"caTools\\\") # install external package (if missing)\\nlibrary(caTools) # external package providing write.gif function\\njet.colors <- colorRampPalette(c(\\\"red\\\", \\\"blue\\\", \\\"#007FFF\\\", \\\"cyan\\\", \\\"#7FFF7F\\\",\\n \\\"yellow\\\", \\\"#FF7F00\\\", \\\"red\\\", \\\"#7F0000\\\"))\\ndx <- 800 # define width\\ndy <- 600 # define height\\nC <- complex(real = rep(seq(-2.5, 1.5, length.out = dx), each = dy),\\n imag = rep(seq(-1.5, 1.5, length.out = dy), dx))\\nC <- matrix(C, dy, dx) # reshape as square matrix of complex numbers\\nZ <- 0 # initialize Z to zero\\nX <- array(0, c(dy, dx, 20)) # initialize output 3D array\\nfor (k in 1:20) { # loop with 20 iterations\\n Z <- Z^2 + C # the central difference equation\\n X[, , k] <- exp(-abs(Z)) # capture results\\n}\\nwrite.gif(X, \\\"Mandelbrot.gif\\\", col = jet.colors, delay = 100)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require racket/draw)\\n\\n(define (iterations a z i)\\n (define z′ (+ (* z z) a))\\n (if (or (= i 255) (> (magnitude z′) 2))\\n i\\n (iterations a z′ (add1 i))))\\n\\n(define (iter->color i)\\n (if (= i 255)\\n (make-object color% \\\"black\\\")\\n (make-object color% (* 5 (modulo i 15)) (* 32 (modulo i 7)) (* 8 (modulo i 31)))))\\n\\n(define (mandelbrot width height)\\n (define target (make-bitmap width height))\\n (define dc (new bitmap-dc% [bitmap target]))\\n (for* ([x width] [y height])\\n (define real-x (- (* 3.0 (/ x width)) 2.25))\\n (define real-y (- (* 2.5 (/ y height)) 1.25))\\n (send dc set-pen (iter->color (iterations (make-rectangular real-x real-y) 0 0)) 1 'solid)\\n (send dc draw-point x y))\\n (send target save-file \\\"mandelbrot.png\\\" 'png))\\n\\n(mandelbrot 300 200)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"constant MAX-ITERATIONS = 64;\\nmy $width = +(@*ARGS[0] // 800);\\nmy $height = $width + $width %% 2;\\nsay \\\"P2\\\";\\nsay \\\"$width $height\\\";\\nsay MAX-ITERATIONS;\\n\\nsub cut(Range $r, UInt $n where $n > 1 --> Seq) {\\n $r.min, * + ($r.max - $r.min) / ($n - 1) ... $r.max\\n}\\n\\nmy @re = cut(-2 .. 1/2, $width);\\nmy @im = cut( 0 .. 5/4, 1 + ($height div 2)) X* 1i;\\n\\nsub mandelbrot(Complex $z is copy, Complex $c --> Int) {\\n for 1 .. MAX-ITERATIONS {\\n $z = $z*$z + $c;\\n return $_ if $z.abs > 2;\\n }\\n return 0;\\n}\\n\\nmy @lines = hyper for @im X+ @re {\\n mandelbrot(0i, $_);\\n}.rotor($width);\\n\\n.put for @lines[1..*].reverse;\\n.put for @lines;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"use Image::PNG::Portable;\\n\\nmy ($w, $h) = 800, 800;\\nmy $out = Image::PNG::Portable.new: :width($w), :height($h);\\n\\nmy $maxIter = 150;\\n\\nmy @re = scale(-2.05 .. 1.05, $h);\\nmy @im = scale( -11/8 .. 11/8, $w) X* 1i;\\n\\nfor ^($w div 2) -> $x {\\n ^$h .map: -> $y {\\n my $i = (mandelbrot( @re[$y] + @im[$x] ) / $maxIter) ** .25;\\n my @hsv = hsv2rgb($i, 1, ?$i).rotate;\\n $out.set: $x, $y, |@hsv;\\n $out.set: $w - 1 - $x, $y, |@hsv;\\n }\\n}\\n\\n$out.write: 'Mandelbrot-set-perl6.png';\\n\\nsub scale (Range $r,Int $n) { $r.min, * + ($r.max - $r.min) / ($n - 1) ... $r.max }\\n\\nsub mandelbrot(Complex $c) {\\n my $z = $c;\\n for ^$maxIter {\\n\\t $z = $z * $z + $c;\\n\\t .return if $z.abs > 2;\\n }\\n 0\\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\": \"/*REXX program generates and displays a Mandelbrot set as an ASCII art character image.*/\\n@ = '>=<;:9876543210/.-,+*)(''&%$#\\\"!' /*the characters used in the display. */\\nXsize = 59; minRE = -2; maxRE = +1; stepX = (maxRE-minRE) / Xsize\\nYsize = 21; minIM = -1; maxIM = +1; stepY = (maxIM-minIM) / Ysize\\n\\n do y=0 for ysize; im=minIM + stepY*y\\n $=\\n do x=0 for Xsize; re=minRE + stepX*x; zr=re; zi=im\\n\\n do n=0 for 30; a=zr**2; b=zi**2; if a+b>4 then leave\\n zi=zr*zi*2 + im; zr=a-b+re\\n end /*n*/\\n\\n $=$ || substr(@, n+1, 1) /*append number (as a char) to $ string*/\\n end /*x*/\\n say $ /*display a line of character output.*/\\n end /*y*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program generates and displays a Mandelbrot set as an ASCII art character image.*/\\n@ = '█▓▒░@9876543210=.-,+*)(·&%$#\\\"!' /*the characters used in the display. */\\nXsize = 59; minRE = -2; maxRE = +1; stepX = (maxRE-minRE) / Xsize\\nYsize = 21; minIM = -1; maxIM = +1; stepY = (maxIM-minIM) / Ysize\\n\\n do y=0 for ysize; im=minIM + stepY*y\\n $=\\n do x=0 for Xsize; re=minRE + stepX*x; zr=re; zi=im\\n\\n do n=0 for 30; a=zr**2; b=zi**2; if a+b>4 then leave\\n zi=zr*zi*2 + im; zr=a-b+re\\n end /*n*/\\n\\n $=$ || substr(@, n+1, 1) /*append number (as a char) to $ string*/\\n end /*x*/\\n say $ /*display a line of character output.*/\\n end /*y*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program generates and displays a Mandelbrot set as an ASCII art character image.*/\\n@ = '█▓▒░@9876543210=.-,+*)(·&%$#\\\"!' /*the characters used in the display. */\\nparse arg Xsize Ysize . /*obtain optional arguments from the CL*/\\nif Xsize=='' then Xsize=linesize() - 1 /*X: the (usable) linesize (minus 1).*/\\nif Ysize=='' then Ysize=Xsize%2 + (Xsize//2==1) /*Y: half the linesize (make it even).*/\\nminRE = -2; maxRE = +1; stepX = (maxRE-minRE) / Xsize\\nminIM = -1; maxIM = +1; stepY = (maxIM-minIM) / Ysize\\n\\n do y=0 for ysize; im=minIM + stepY*y\\n $=\\n do x=0 for Xsize; re=minRE + stepX*x; zr=re; zi=im\\n\\n do n=0 for 30; a=zr**2; b=zi**2; if a+b>4 then leave\\n zi=zr*zi*2 + im; zr=a-b+re\\n end /*n*/\\n\\n $=$ || substr(@, n+1, 1) /*append number (as a char) to $ string*/\\n end /*x*/\\n say $ /*display a line of character output.*/\\n end /*y*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"load \\\"guilib.ring\\\"\\n\\nnew qapp\\n {\\n win1 = new qwidget() {\\n setwindowtitle(\\\"Mandelbrot set\\\")\\n setgeometry(100,100,500,500)\\n label1 = new qlabel(win1) {\\n setgeometry(10,10,400,400)\\n settext(\\\"\\\")\\n }\\n new qpushbutton(win1) {\\n setgeometry(200,400,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(1)\\n }\\n new qpainter() {\\n begin(p1)\\n setpen(pen)\\n\\n x1=300 y1=250\\n i1=-1 i2=1 r1=-2 r2=1\\n s1=(r2-r1)/x1 s2=(i2-i1)/y1\\n for y=0 to y1\\n i3=i1+s2*y\\n for x=0 to x1\\n r3=r1+s1*x z1=r3 z2=i3\\n for n=0 to 30\\n a=z1*z1 b=z2*z2\\n if a+b>4 exit ok\\n z2=2*z1*z2+i3 z1=a-b+r3\\n next\\n if n != 31 drawpoint(x,y) ok\\n next\\n next\\n\\n endpaint()\\n }\\n label1 { setpicture(p1) show() }\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'complex'\\n\\ndef mandelbrot(a)\\n Array.new(50).inject(0) { |z,c| z*z + a }\\nend\\n\\n(1.0).step(-1,-0.05) do |y|\\n (-2.0).step(0.5,0.0315) do |x|\\n print mandelbrot(Complex(x,y)).abs < 2 ? '*' : ' '\\n end\\n puts\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"# frozen_string_literal: true\\n\\nrequire_relative 'raster_graphics'\\n\\nclass RGBColour\\n def self.mandel_colour(i)\\n self.new( 16*(i % 15), 32*(i % 7), 8*(i % 31) )\\n end\\nend\\n\\nclass Pixmap\\n def self.mandelbrot(width, height)\\n mandel = Pixmap.new(width,height)\\n pb = ProgressBar.new(width) if $DEBUG\\n width.times do |x|\\n height.times do |y|\\n x_ish = Float(x - width*11/15) / (width/3)\\n y_ish = Float(y - height/2) / (height*3/10)\\n mandel[x,y] = RGBColour.mandel_colour(mandel_iters(x_ish, y_ish))\\n end\\n pb.update(x) if $DEBUG\\n end\\n pb.close if $DEBUG\\n mandel\\n end\\n\\n def self.mandel_iters(cx,cy)\\n x = y = 0.0\\n count = 0\\n while Math.hypot(x,y) < 2 and count < 255\\n x, y = (x**2 - y**2 + cx), (2*x*y + cy)\\n count += 1\\n end\\n count\\n end\\nend\\n\\nPixmap.mandelbrot(300,300).save('mandel.ppm')\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"# frozen_string_literal: true\\n\\ndef setup\\n sketch_title 'Mandelbrot'\\n load_pixels\\n no_loop\\nend\\n\\ndef draw\\n grid(900, 600) do |x, y|\\n const = Complex(\\n map1d(x, (0...900), (-3..1.5)), map1d(y, (0...600), (-1.5..1.5))\\n )\\n pixels[x + y * 900] = color(\\n constrained_map(mandel(const, 20), (5..20), (255..0))\\n )\\n end\\n update_pixels\\nend\\n\\ndef mandel(z, max)\\n score = 0\\n const = z\\n while score < max\\n # z = z^2 + c\\n z *= z\\n z += const\\n break if z.abs > 2\\n\\n score += 1\\n end\\n score\\nend\\n\\ndef settings\\n size(900, 600)\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"'Mandelbrot V4 for RunBasic\\n'Based on LibertyBasic solution\\n'copy the code and go to runbasic.com\\n'http://rosettacode.org/wiki/Mandelbrot_set#Liberty_BASIC\\n'May 2015 (updated 29 Apr 2018)\\n'\\n'Note - we only get so much processing time on the server, so the\\n'graph is computed in three or four pieces\\n'\\nWindowWidth = 320 'RunBasic max size 800 x 600\\nWindowHeight = 320\\n'print zone -2 to 1 (X)\\n'print zone -1.5 to 1.5 (Y)\\na = -1.5 'graph -1.5 to -0.75, first \\\"loop\\\"\\nb = -0.75 'adjust for max processor time (y0 for loop below)\\n\\n'open \\\"Mandelbrot Set\\\" for graphics_nsb_nf as #w not used in RunBasic\\n\\ngraphic #w, WindowWidth, WindowHeight\\n'#w \\\"trapclose [quit]\\\" not used in RunBasic\\n'#w \\\"down\\\" not used in RunBasic\\n\\ncls\\n'#w flush()\\n#w cls(\\\"black\\\")\\nrender #w\\n '#w flush()\\ninput \\\"OK, hit enter to continue\\\"; guess\\ncls\\n\\n[man_calc]\\n'3/screen size 3/800 = 0.00375 ** 3/790 = 0.0037974\\n'3/screen size (y) 3/600 = .005 ** 3/590 = 0.0050847\\n'3/215 = .0139 .0068 = 3/440\\ncc = 3/299\\n'\\n for x0 = -2 to 1 step cc\\n for y0 = a to b step cc\\n x = 0\\n y = 0\\n\\n iteration = 0\\n maxIteration = 255\\n\\n while ( ( x *x +y *y) <=4) and ( iteration <maxIteration)\\n xtemp =x *x -y *y +x0\\n y =2 *x *y +y0\\n x = xtemp\\n iteration = iteration + 1\\n wend\\n\\n if iteration <>maxIteration then\\n c =iteration\\n else\\n c =0\\n end if\\n\\n call pSet x0, y0, c\\n 'scan why scan? (wait for user input) with RunBasic ?\\n next\\nnext\\n\\n'#w flush() 'what is flush? RunBasic uses the render command.\\nrender #w\\n\\ninput \\\"OK, hit enter to continue\\\"; guess\\ncls\\na = a + 0.75\\nb = b + 0.75\\nif b > 1.6 then goto[quit] else goto[man_calc]\\n\\nsub pSet x, y, c\\n xScreen = 5+(x +2) /3 * 300 'need positive screen number\\n yScreen = 5+(y +1.5) /3 * 300 'and 5x5 boarder\\n if c =0 then\\n col$ =\\\"red\\\"\\n else\\n if c mod 2 =1 then col$ =\\\"lightgray\\\" else col$ =\\\"white\\\"\\n end if\\n #w \\\"color \\\"; col$\\n #w \\\"set \\\"; xScreen; \\\" \\\"; yScreen\\nend sub\\n\\n[quit]\\n'cls\\nprint\\nprint \\\"This is a Mandelbrot Graph output from www.runbasic.com\\\"\\nrender #w\\nprint \\\"All done, good bye.\\\"\\nend\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"extern crate image;\\nextern crate num_complex;\\n\\nuse num_complex::Complex;\\n\\nfn main() {\\n let max_iterations = 256u16;\\n let img_side = 800u32;\\n let cxmin = -2f32;\\n let cxmax = 1f32;\\n let cymin = -1.5f32;\\n let cymax = 1.5f32;\\n let scalex = (cxmax - cxmin) / img_side as f32;\\n let scaley = (cymax - cymin) / img_side as f32;\\n\\n // Create a new ImgBuf\\n let mut imgbuf = image::ImageBuffer::new(img_side, img_side);\\n\\n // Calculate for each pixel\\n for (x, y, pixel) in imgbuf.enumerate_pixels_mut() {\\n let cx = cxmin + x as f32 * scalex;\\n let cy = cymin + y as f32 * scaley;\\n\\n let c = Complex::new(cx, cy);\\n let mut z = Complex::new(0f32, 0f32);\\n\\n let mut i = 0;\\n for t in 0..max_iterations {\\n if z.norm() > 2.0 {\\n break;\\n }\\n z = z * z + c;\\n i = t;\\n }\\n\\n *pixel = image::Luma([i as u8]);\\n }\\n\\n // Save image\\n imgbuf.save(\\\"fractal.png\\\").unwrap();\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"$canvasWidth: 200;\\n$canvasHeight: 200;\\n$iterations: 20;\\n$xCorner: -2;\\n$yCorner: -1.5;\\n$zoom: 3;\\n$data: ()!global;\\n@mixin plot ($x,$y,$count){\\n $index: ($y * $canvasWidth + $x) * 4;\\n $r: $count * -12 + 255;\\n $g: $count * -12 + 255;\\n $b: $count * -12 + 255;\\n $data: append($data, $x + px $y + px 0 rgb($r,$g,$b), comma)!global;\\n}\\n\\n@for $x from 1 to $canvasWidth {\\n @for $y from 1 to $canvasHeight {\\n $count: 0;\\n $size: 0;\\n $cx: $xCorner + (($x * $zoom) / $canvasWidth);\\n $cy: $yCorner + (($y * $zoom) / $canvasHeight);\\n\\n $zx: 0;\\n $zy: 0;\\n\\n @while $count < $iterations and $size <= 4 {\\n $count: $count + 1;\\n $temp: ($zx * $zx) - ($zy * $zy);\\n $zy: (2 * $zx * $zy) + $cy;\\n $zx: $temp + $cx;\\n $size: ($zx * $zx) + ($zy * $zy);\\n }\\n\\n @include plot($x, $y, $count);\\n }\\n}\\n.set {\\n height: 1px;\\n width: 1px;\\n position: absolute;\\n top: 50%;\\n left: 50%;\\n transform: translate($canvasWidth*0.5px, $canvasWidth*0.5px);\\n box-shadow: $data;\\n}\\n\",\n \"language\": \"Sass-SCSS\"\n },\n {\n \"code\": \"import org.rosettacode.ArithmeticComplex._\\nimport java.awt.Color\\n\\nobject Mandelbrot\\n{\\n def generate(width:Int =600, height:Int =400)={\\n val bm=new RgbBitmap(width, height)\\n\\n val maxIter=1000\\n val xMin = -2.0\\n val xMax = 1.0\\n val yMin = -1.0\\n val yMax = 1.0\\n\\n val cx=(xMax-xMin)/width\\n val cy=(yMax-yMin)/height\\n\\n for(y <- 0 until bm.height; x <- 0 until bm.width){\\n val c=Complex(xMin+x*cx, yMin+y*cy)\\n val iter=itMandel(c, maxIter, 4)\\n bm.setPixel(x, y, getColor(iter, maxIter))\\n }\\n bm\\n }\\n\\n def itMandel(c:Complex, imax:Int, bailout:Int):Int={\\n var z=Complex()\\n for(i <- 0 until imax){\\n z=z*z+c;\\n if(z.abs > bailout) return i\\n }\\n imax;\\n }\\n\\n def getColor(iter:Int, max:Int):Color={\\n if (iter==max) return Color.BLACK\\n\\n var c=3*math.log(iter)/math.log(max-1.0)\\n if(c<1) new Color((255*c).toInt, 0, 0)\\n else if(c<2) new Color(255, (255*(c-1)).toInt, 0)\\n else new Color(255, 255, (255*(c-2)).toInt)\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"import scala.swing._\\nimport javax.swing.ImageIcon\\nval imgMandel=Mandelbrot.generate()\\nval mainframe=new MainFrame(){title=\\\"Test\\\"; visible=true\\n contents=new Label(){icon=new ImageIcon(imgMandel.image)}\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define x-centre -0.5)\\n(define y-centre 0.0)\\n(define width 4.0)\\n(define i-max 800)\\n(define j-max 600)\\n(define n 100)\\n(define r-max 2.0)\\n(define file \\\"out.pgm\\\")\\n(define colour-max 255)\\n(define pixel-size (/ width i-max))\\n(define x-offset (- x-centre (* 0.5 pixel-size (+ i-max 1))))\\n(define y-offset (+ y-centre (* 0.5 pixel-size (+ j-max 1))))\\n\\n(define (inside? z)\\n (define (*inside? z-0 z n)\\n (and (< (magnitude z) r-max)\\n (or (= n 0)\\n (*inside? z-0 (+ (* z z) z-0) (- n 1)))))\\n (*inside? z 0 n))\\n\\n(define (boolean->integer b)\\n (if b colour-max 0))\\n\\n(define (pixel i j)\\n (boolean->integer\\n (inside?\\n (make-rectangular (+ x-offset (* pixel-size i))\\n (- y-offset (* pixel-size j))))))\\n\\n(define (plot)\\n (with-output-to-file file\\n (lambda ()\\n (begin (display \\\"P2\\\") (newline)\\n (display i-max) (newline)\\n (display j-max) (newline)\\n (display colour-max) (newline)\\n (do ((j 1 (+ j 1))) ((> j j-max))\\n (do ((i 1 (+ i 1))) ((> i i-max))\\n (begin (display (pixel i j)) (newline))))))))\\n\\n(plot)\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \";; A program written for CHICKEN Scheme version 5.3.0 and various\\n;; eggs.\\n\\n(import (r7rs))\\n(import (scheme base))\\n(import (scheme case-lambda))\\n(import (scheme inexact))\\n\\n(import (prefix sdl2 \\\"sdl2:\\\"))\\n(import (prefix imlib2 \\\"imlib2:\\\"))\\n\\n(import (format))\\n(import (matchable))\\n(import (simple-exceptions))\\n\\n(define sdl2-subsystems-used '(events video))\\n\\n;; ------------------------------\\n;; Basics for using the sdl2 egg:\\n(sdl2:set-main-ready!)\\n(sdl2:init! sdl2-subsystems-used)\\n(on-exit sdl2:quit!)\\n(current-exception-handler\\n (let ((original-handler (current-exception-handler)))\\n (lambda (exception)\\n (sdl2:quit!)\\n (original-handler exception))))\\n;; ------------------------------\\n\\n(define-record-type <mandel-params>\\n (%%make-mandel-params)\\n mandel-params?\\n (window ref-window set-window!)\\n (xcenter ref-xcenter set-xcenter!)\\n (ycenter ref-ycenter set-ycenter!)\\n (pixels-per-unit ref-pixels-per-unit set-pixels-per-unit!)\\n (pixels-per-event-check ref-pixels-per-event-check\\n set-pixels-per-event-check!)\\n (max-escape-time ref-max-escape-time set-max-escape-time!))\\n\\n(define initial-width 400)\\n(define initial-height 400)\\n(define initial-xcenter -3/4)\\n(define initial-ycenter 0)\\n(define initial-pixels-per-unit 150)\\n(define initial-pixels-per-event-check 1000)\\n(define initial-max-escape-time 1000)\\n\\n(define (make-mandel-params window)\\n (let ((params (%%make-mandel-params)))\\n (set-window! params window)\\n (set-xcenter! params initial-xcenter)\\n (set-ycenter! params initial-ycenter)\\n (set-pixels-per-unit! params initial-pixels-per-unit)\\n (set-pixels-per-event-check! params\\n initial-pixels-per-event-check)\\n (set-max-escape-time! params initial-max-escape-time)\\n params))\\n\\n(define window (sdl2:create-window! \\\"mandelbrot set task\\\"\\n 'centered 'centered\\n initial-width initial-height\\n '()))\\n(define params (make-mandel-params window))\\n\\n(define empty-color (sdl2:make-color 200 200 200))\\n\\n(define (clear-mandel!)\\n (sdl2:fill-rect! (sdl2:window-surface (ref-window params))\\n #f empty-color)\\n (sdl2:update-window-surface! window))\\n\\n(define drawing? #t)\\n(define redraw? #f)\\n\\n(define (draw-mandel! event-checker)\\n (clear-mandel!)\\n (let repeat ()\\n (let*-values\\n (((window) (ref-window params))\\n ((width height) (sdl2:window-size window)))\\n (let* ((xcenter (ref-xcenter params))\\n (ycenter (ref-ycenter params))\\n (pixels-per-unit (ref-pixels-per-unit params))\\n (pixels-per-event-check\\n (ref-pixels-per-event-check params))\\n (max-escape-time (ref-max-escape-time params))\\n (step (/ 1.0 pixels-per-unit))\\n (xleft (- xcenter (/ width (* 2.0 pixels-per-unit))))\\n (ytop (+ ycenter (/ height (* 2.0 pixels-per-unit))))\\n (pixel-count 0))\\n (do ((j 0 (+ j 1))\\n (cy ytop (- cy step)))\\n ((= j height))\\n (do ((i 0 (+ i 1))\\n (cx xleft (+ cx step)))\\n ((= i width))\\n (let* ((color (compute-color-by-escape-time-algorithm\\n cx cy max-escape-time)))\\n (sdl2:surface-set! (sdl2:window-surface window)\\n i j color)\\n (if (= pixel-count pixels-per-event-check)\\n (let ((event-checker (call/cc event-checker)))\\n (cond (redraw?\\n (set! redraw? #f)\\n (clear-mandel!)\\n (repeat)))\\n (set! pixel-count 0))\\n (set! pixel-count (+ pixel-count 1)))))\\n ;; Display a row.\\n (sdl2:update-window-surface! window))))\\n (set! drawing? #f)\\n (repeat)))\\n\\n(define (compute-color-by-escape-time-algorithm\\n cx cy max-escape-time)\\n (escape-time->color (compute-escape-time cx cy max-escape-time)\\n max-escape-time))\\n\\n(define (compute-escape-time cx cy max-escape-time)\\n (let loop ((x 0.0)\\n (y 0.0)\\n (iter 0))\\n (if (= iter max-escape-time)\\n iter\\n (let ((xsquared (* x x))\\n (ysquared (* y y)))\\n (if (< 4 (+ xsquared ysquared))\\n iter\\n (let ((x (+ cx (- xsquared ysquared)))\\n (y (+ cy (* (+ x x) y))))\\n (loop x y (+ iter 1))))))))\\n\\n(define (escape-time->color escape-time max-escape-time)\\n ;; This is a very naive and ad hoc algorithm for choosing colors,\\n ;; but hopefully will suffice for the task. With this algorithm, at\\n ;; least one can zoom in and see some of the fractal-like structures\\n ;; out on the filaments.\\n (let* ((initial-ppu initial-pixels-per-unit)\\n (ppu (ref-pixels-per-unit params))\\n (fraction (* (/ (log escape-time) (log max-escape-time))))\\n (fraction (if (= fraction 1.0)\\n fraction\\n (* fraction\\n (/ (log initial-ppu)\\n (log (max initial-ppu (* 0.05 ppu)))))))\\n (value (- 255 (min 255 (exact-rounded (* fraction 255))))))\\n (sdl2:make-color value value value)))\\n\\n(define (exact-rounded x)\\n (exact (round x)))\\n\\n(define (event-loop)\\n (define event (sdl2:make-event))\\n (define painter draw-mandel!)\\n (define zoom-ratio 2)\\n\\n (define (recenter! xcoord ycoord)\\n (let*-values\\n (((window) (ref-window params))\\n ((width height) (sdl2:window-size window))\\n ((ppu) (ref-pixels-per-unit params)))\\n (set-xcenter! params\\n (+ (ref-xcenter params)\\n (/ (- (* 2.0 xcoord) width) (* 2.0 ppu))))\\n (set-ycenter! params\\n (+ (ref-ycenter params)\\n (/ (- height (* 2.0 ycoord)) (* 2.0 ppu))))))\\n\\n (define (zoom-in!)\\n (let* ((ppu (ref-pixels-per-unit params))\\n (ppu (* ppu zoom-ratio)))\\n (set-pixels-per-unit! params ppu)))\\n\\n (define (zoom-out!)\\n (let* ((ppu (ref-pixels-per-unit params))\\n (ppu (* (/ 1.0 zoom-ratio) ppu)))\\n (set-pixels-per-unit! params (max 1 ppu))))\\n\\n (define (restore-original-settings!)\\n (set-xcenter! params initial-xcenter)\\n (set-ycenter! params initial-ycenter)\\n (set-pixels-per-unit! params initial-pixels-per-unit)\\n (set-pixels-per-event-check!\\n params initial-pixels-per-event-check)\\n (set-max-escape-time! params initial-max-escape-time)\\n (set! zoom-ratio 2))\\n\\n (define dump-image! ; Really this should put up a dialog.\\n (let ((dump-number 1))\\n (lambda ()\\n (let*-values\\n (((window) (ref-window params))\\n ((width height) (sdl2:window-size window))\\n ((surface) (sdl2:window-surface window)))\\n (let ((filename (string-append \\\"mandelbrot-image-\\\"\\n (number->string dump-number)\\n \\\".png\\\"))\\n (img (imlib2:image-create width height)))\\n (do ((j 0 (+ j 1)))\\n ((= j height))\\n (do ((i 0 (+ i 1)))\\n ((= i width))\\n (let-values\\n (((r g b a) (sdl2:color->values\\n (sdl2:surface-ref surface i j))))\\n (imlib2:image-draw-pixel\\n img (imlib2:color/rgba r g b a) i j))))\\n (imlib2:image-alpha-set! img #f)\\n (imlib2:image-save img filename)\\n (format #t \\\"~a written~%\\\" filename)\\n (set! dump-number (+ dump-number 1)))))))\\n\\n (let loop ()\\n (when redraw?\\n (set! drawing? #t))\\n (when drawing?\\n (set! painter (call/cc painter)))\\n (set! redraw? #f)\\n (if (not (sdl2:poll-event! event))\\n (loop)\\n (begin\\n (match (sdl2:event-type event)\\n ('quit) ; Quit by leaving the loop.\\n ('window\\n (match (sdl2:window-event-event event)\\n ;; It should be possible to resize the window, but I\\n ;; have not yet figured out how to do this with SDL2\\n ;; and not crash sometimes.\\n ((or 'exposed 'restored)\\n (sdl2:update-window-surface! (ref-window params))\\n (loop))\\n (_ (loop))))\\n ('mouse-button-down\\n (recenter! (sdl2:mouse-button-event-x event)\\n (sdl2:mouse-button-event-y event))\\n (set! redraw? #t)\\n (loop))\\n ('key-down\\n (match (sdl2:keyboard-event-sym event)\\n ('q 'quit-by-leaving-the-loop)\\n ((or 'plus 'kp-plus)\\n (zoom-in!)\\n (set! redraw? #t)\\n (loop))\\n ((or 'minus 'kp-minus)\\n (zoom-out!)\\n (set! redraw? #t)\\n (loop))\\n ((or 'n-2 'kp-2)\\n (set! zoom-ratio 2)\\n (loop))\\n ((or 'n-3 'kp-3)\\n (set! zoom-ratio 3)\\n (loop))\\n ((or 'n-4 'kp-4)\\n (set! zoom-ratio 4)\\n (loop))\\n ((or 'n-5 'kp-5)\\n (set! zoom-ratio 5)\\n (loop))\\n ((or 'n-6 'kp-6)\\n (set! zoom-ratio 6)\\n (loop))\\n ((or 'n-7 'kp-7)\\n (set! zoom-ratio 7)\\n (loop))\\n ((or 'n-8 'kp-8)\\n (set! zoom-ratio 8)\\n (loop))\\n ((or 'n-9 'kp-9)\\n (set! zoom-ratio 9)\\n (loop))\\n ('o\\n (restore-original-settings!)\\n (set! redraw? #t)\\n (loop))\\n ('p\\n (dump-image!)\\n (loop))\\n (some-key-in-which-we-are-not-interested\\n (loop))))\\n (some-event-in-which-we-are-not-interested\\n (loop)))))))\\n\\n;; At the least this legend should go in a window, but printing it to\\n;; the terminal will, hopefully, suffice for the task.\\n(format #t \\\"~%~8tACTIONS~%\\\")\\n(format #t \\\"~8t-------~%\\\")\\n(define fmt \\\"~2t~a~15t: ~a~%\\\")\\n(format #t fmt \\\"Q key\\\" \\\"quit\\\")\\n(format #t fmt \\\"mouse button\\\" \\\"recenter\\\")\\n(format #t fmt \\\"+ key\\\" \\\"zoom in\\\")\\n(format #t fmt \\\"- key\\\" \\\"zoom in\\\")\\n(format #t fmt \\\"2 .. 9 key\\\" \\\"set zoom ratio\\\")\\n(format #t fmt \\\"O key\\\" \\\"restore original\\\")\\n(format #t fmt \\\"P key\\\" \\\"dump to a PNG\\\")\\n(format #t \\\"~%\\\")\\n\\n(event-loop)\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"put 0 into oReal # Real origin\\nput 0 into oImag # Imaginary origin\\nput 0.5 into mag # Magnification\\n\\nput oReal - .8 / mag into leftReal\\nput oImag + .5 / mag into topImag\\nput 1 / 200 / mag into inc\\n\\nput [\\n\\t(0,255,255),\\t# aqua\\t\\n\\t(0,0,255), # blue\\n\\t(255,0,255), # fuchsia\\n\\t(128,128,128), # gray\\t\\n\\t(0,128,0), # green\\n\\t(0,255,0), # lime\\t\\n\\t(128,0,0), # maroon\\n\\t(0,0,128), # navy\\t\\n\\t(128,128,0), # olive\\n\\t(128,0,128), # purple\\n\\t(255,0,0), # red\\n\\t(192,192,192), # silver\\n\\t(0,128,128), # teal\\n\\t(255,255,255), # white\\n\\t(255,255,0) #\\tyellow\\n] into colors\\n\\nput \\\"mandelbrot.ppm\\\" into myFile\\n\\nopen file myFile for writing\\nwrite \\\"P3\\\" & return to file myFile # PPM file magic number\\nwrite \\\"320 200\\\" & return to file myFile # Width and height\\nwrite \\\"255\\\" & return to file myFile # Max value in color channels\\n\\nput topImag into cImag\\nrepeat with each item in 1 .. 200\\n\\tput leftReal into cReal\\n\\trepeat with each item in 1 .. 320\\n\\t\\tput 0 into zReal\\n\\t\\tput 0 into zImag\\n\\t\\tput 0 into count\\n\\t\\tput 0 into size\\n\\t\\trepeat at least once until size > 2 or count = 100\\n\\t\\t\\tput zReal squared + zImag squared * -1 into newZreal\\n\\t\\t\\tput zReal * zImag + zReal * zImag into newZimag\\n\\t\\t\\tput newZreal + cReal into zReal\\n\\t\\t\\tput newZimag + cImag into zImag\\n\\t\\t\\tput sqrt(zReal squared + zImag squared) into size\\n\\t\\t\\tadd 1 to count\\n\\t\\tend repeat\\n\\t\\tif size > 2 then # Outside the set - colorize\\n\\t\\t\\tput item count mod 15 + 1 of colors into color\\n\\t\\t\\twrite color joined by \\\" \\\" to file myFile\\n\\t\\t\\twrite return to file myFile\\n\\t\\telse # Inside the set - black\\n\\t\\t\\twrite \\\"0 0 0\\\" & return to file myFile\\n\\t\\tend if\\n\\t\\tadd inc to cReal\\n\\tend repeat\\n\\tsubtract inc from cImag\\nend repeat\\n\\nclose file myFile\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"import <Utilities/Complex.sl>;\\nimport <Utilities/Sequence.sl>;\\nimport <Utilities/Math.sl>;\\n\\nCOLOR_STRUCT ::= (R: int(0), G: int(0), B: int(0));\\nrgb(r(0), g(0), b(0)) := (R: r, G: g, B: b);\\n\\nRESULT_STRUCT ::= (FinalValue: Complex(0), Iterations: int(0));\\nmakeResult(val(0), iters(0)) := (FinalValue: val, Iterations: iters);\\n\\nzSquaredOperation(startingNum(0), currentNum(0)) :=\\n complexAdd(startingNum, complexMultiply(currentNum, currentNum));\\n\\nzSquared(minX(0), maxX(0), resolutionX(0), minY(0), maxY(0), resolutionY(0), maxMagnitude(0), maxIters(0))[Y,X] :=\\n let\\n stepX := (maxX - minX) / resolutionX;\\n stepY := (maxY - minY) / resolutionY;\\n\\n currentX := X * stepX + minX;\\n currentY := Y * stepY + minY;\\n\\n in\\n operateUntil(zSquaredOperation, makeComplex(currentX, currentY), makeComplex(currentX, currentY), maxMagnitude, 0, maxIters)\\n foreach Y within 0 ... (resolutionY - 1),\\n X within 0 ... (resolutionX - 1);\\n\\noperateUntil(operation(0), startingNum(0), currentNum(0), maxMagnitude(0), currentIters(0), maxIters(0)) :=\\n let\\n operated := operation(startingNum, currentNum);\\n in\\n makeResult(currentNum, maxIters) when currentIters >= maxIters\\n else\\n makeResult(currentNum, currentIters) when complexMagnitude(currentNum) >= maxMagnitude\\n else\\n operateUntil(operation, startingNum, operated, maxMagnitude, currentIters + 1, maxIters);\\n\\n//region Smooth Coloring\\n\\nCOLOR_COUNT := size(colorSelections);\\n\\ncolorRange := range(0, 255, 1);\\n\\ncolors :=\\n let\\n first[i] := rgb(0, 0, i) foreach i within colorRange;\\n second[i] := rgb(i, i, 255) foreach i within colorRange;\\n third[i] := rgb(255, 255, i) foreach i within reverse(colorRange);\\n fourth[i] := rgb(255, i, 0) foreach i within reverse(colorRange);\\n fifth[i] := rgb(i, 0, 0) foreach i within reverse(colorRange);\\n\\n red[i] := rgb(i, 0, 0) foreach i within colorRange;\\n redR[i] := rgb(i, 0, 0) foreach i within reverse(colorRange);\\n green[i] := rgb(0, i, 0) foreach i within colorRange;\\n greenR[i] :=rgb(0, i, 0) foreach i within reverse(colorRange);\\n blue[i] := rgb(0, 0, i) foreach i within colorRange;\\n blueR[i] := rgb(0, 0, i) foreach i within reverse(colorRange);\\n\\n in\\n //red ++ redR ++ green ++ greenR ++ blue ++ blueR;\\n first ++ second ++ third ++ fourth ++ fifth;\\n //first ++ fourth;\\n\\ncolorSelections := range(1, size(colors), 30);\\n\\ngetSmoothColorings(zSquaredResult(2), maxIters(0))[Y,X] :=\\n let\\n current := zSquaredResult[Y,X];\\n\\n zn := complexMagnitude(current.FinalValue);\\n nu := ln(ln(zn) / ln(2)) / ln(2);\\n\\n result := abs(current.Iterations + 1 - nu);\\n\\n index := floor(result);\\n rem := result - index;\\n\\n color1 := colorSelections[(index mod COLOR_COUNT) + 1];\\n color2 := colorSelections[((index + 1) mod COLOR_COUNT) + 1];\\n in\\n rgb(0, 0, 0) when current.Iterations = maxIters\\n else\\n colors[color1] when color2 < color1\\n else\\n colors[floor(linearInterpolate(color1, color2, rem))];\\n\\nlinearInterpolate(v0(0), v1(0), t(0)) := (1 - t) * v0 + t * v1;\\n\\n//endregion\\n\",\n \"language\": \"SequenceL\"\n },\n {\n \"code\": \"#include \\\"SL_Generated.h\\\"\\n#include \\\"../../../ThirdParty/CImg/CImg.h\\\"\\n\\nusing namespace std;\\nusing namespace cimg_library;\\n\\nint main(int argc, char ** argv)\\n{\\n int cores = 0;\\n\\n Sequence<Sequence<_sl_RESULT_STRUCT> > computeResult;\\n Sequence<Sequence<_sl_COLOR_STRUCT> > colorResult;\\n\\n sl_init(cores);\\n\\n int maxIters = 1000;\\n int imageWidth = 1920;\\n int imageHeight = 1200;\\n double maxMag = 256;\\n\\n double xmin = -2.5;\\n double xmax = 1.0;\\n double ymin = -1.0;\\n double ymax = 1.0;\\n\\n CImg<unsigned char> visu(imageWidth, imageHeight, 1, 3);\\n CImgDisplay draw_disp(visu, \\\"Mandelbrot Fractal in SequenceL\\\");\\n\\n bool redraw = true;\\n\\n SLTimer t;\\n\\n double computeTime;\\n double colorTime;\\n double renderTime;\\n\\n while(!draw_disp.is_closed())\\n {\\n if(redraw)\\n {\\n redraw = false;\\n\\n t.start();\\n sl_zSquared(xmin, xmax, imageWidth, ymin, ymax, imageHeight, maxMag, maxIters, cores, computeResult);\\n t.stop();\\n computeTime = t.getTime();\\n\\n t.start();\\n sl_getSmoothColorings(computeResult, maxIters, cores, colorResult);\\n t.stop();\\n colorTime = t.getTime();\\n\\n t.start();\\n\\n visu.fill(0);\\n for(int i = 1; i <= colorResult.size(); i++)\\n {\\n for(int j = 1; j <= colorResult[i].size(); j++)\\n {\\n visu(j-1,i-1,0,0) = colorResult[i][j].R;\\n visu(j-1,i-1,0,1) = colorResult[i][j].G;\\n visu(j-1,i-1,0,2) = colorResult[i][j].B;\\n }\\n }\\n visu.display(draw_disp);\\n\\n t.stop();\\n\\n renderTime = t.getTime();\\n\\n draw_disp.set_title(\\\"X:[%f, %f] Y:[%f, %f] | Mandelbrot Fractal in SequenceL | Compute Time: %f | Color Time: %f | Render Time: %f | Total FPS: %f\\\", xmin, xmax, ymin, ymax, cores, computeTime, colorTime, renderTime, 1 / (computeTime + colorTime + renderTime));\\n }\\n\\n draw_disp.wait();\\n\\n double xdiff = (xmax - xmin);\\n double ydiff = (ymax - ymin);\\n\\n double xcenter = ((1.0 * draw_disp.mouse_x()) / imageWidth) * xdiff + xmin;\\n double ycenter = ((1.0 * draw_disp.mouse_y()) / imageHeight) * ydiff + ymin;\\n\\n if(draw_disp.button()&1)\\n {\\n redraw = true;\\n xmin = xcenter - (xdiff / 4);\\n xmax = xcenter + (xdiff / 4);\\n ymin = ycenter - (ydiff / 4);\\n ymax = ycenter + (ydiff / 4);\\n }\\n else if(draw_disp.button()&2)\\n {\\n redraw = true;\\n xmin = xcenter - xdiff;\\n xmax = xcenter + xdiff;\\n ymin = ycenter - ydiff;\\n ymax = ycenter + ydiff;\\n }\\n }\\n\\n sl_done();\\n\\n return 0;\\n}\\n\",\n \"language\": \"SequenceL\"\n },\n {\n \"code\": \"func mandelbrot(z) {\\n var c = z\\n { z = (z*z + c)\\n z.abs > 2 && return true\\n } * 20\\n return false\\n}\\n \\nfor y range(1, -1, -0.05) {\\n for x in range(-2, 0.5, 0.0315) {\\n print(mandelbrot(x + y.i) ? ' ' : '#')\\n }\\n print \\\"\\\\n\\\"\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"BEGIN\\n REAL XCENTRE, YCENTRE, WIDTH, RMAX, XOFFSET, YOFFSET, PIXELSIZE;\\n INTEGER N, IMAX, JMAX, COLOURMAX;\\n TEXT FILENAME;\\n\\n CLASS COMPLEX(RE,IM); REAL RE,IM;;\\n\\n REF(COMPLEX) PROCEDURE ADD(A,B); REF(COMPLEX) A,B;\\n ADD :- NEW COMPLEX(A.RE + B.RE, A.IM + B.IM);\\n\\n REF(COMPLEX) PROCEDURE SUB(A,B); REF(COMPLEX) A,B;\\n SUB :- NEW COMPLEX(A.RE - B.RE, A.IM - B.IM);\\n\\n REF(COMPLEX) PROCEDURE MUL(A,B); REF(COMPLEX) A,B;\\n MUL :- NEW COMPLEX(A.RE * B.RE - A.IM * B.IM,\\n A.RE * B.IM + A.IM * B.RE);\\n\\n REF(COMPLEX) PROCEDURE DIV(A,B); REF(COMPLEX) A,B;\\n BEGIN\\n REAL TMP;\\n TMP := B.RE * B.RE + B.IM * B.IM;\\n DIV :- NEW COMPLEX((A.RE * B.RE + A.IM * B.IM) / TMP,\\n (A.IM * B.RE - A.RE * B.IM) / TMP);\\n END DIV;\\n\\n REF(COMPLEX) PROCEDURE RECTANGULAR(RE,IM); REAL RE,IM;\\n RECTANGULAR :- NEW COMPLEX(RE,IM);\\n\\n REAL PROCEDURE MAGNITUDE(CX); REF(COMPLEX) CX;\\n MAGNITUDE := SQRT(CX.RE**2 + CX.IM**2);\\n\\n BOOLEAN PROCEDURE INSIDEP(Z); REF(COMPLEX) Z;\\n BEGIN\\n BOOLEAN PROCEDURE INSIDE(Z0,Z,N); REAL N; REF(COMPLEX) Z,Z0;\\n INSIDE := MAGNITUDE(Z) < RMAX\\n AND THEN N = 0 OR ELSE INSIDE(Z0, ADD(Z0,MUL(Z,Z)), N-1);\\n INSIDEP := INSIDE(Z, NEW COMPLEX(0,0), N);\\n END INSIDEP;\\n\\n INTEGER PROCEDURE BOOL2INT(B); BOOLEAN B;\\n BOOL2INT := IF B THEN COLOURMAX ELSE 0;\\n\\n INTEGER PROCEDURE PIXEL(I,J); INTEGER I,J;\\n PIXEL := BOOL2INT(INSIDEP(RECTANGULAR(XOFFSET + PIXELSIZE * I,\\n YOFFSET - PIXELSIZE * J)));\\n PROCEDURE PLOT;\\n BEGIN\\n REF (OUTFILE) OUTF;\\n INTEGER J,I;\\n OUTF :- NEW OUTFILE(FILENAME);\\n OUTF.OPEN(BLANKS(132));\\n OUTF.OUTTEXT(\\\"P2\\\"); OUTF.OUTIMAGE;\\n OUTF.OUTINT(IMAX,0); OUTF.OUTIMAGE;\\n OUTF.OUTINT(JMAX,0); OUTF.OUTIMAGE;\\n OUTF.OUTINT(COLOURMAX,0); OUTF.OUTIMAGE;\\n FOR J := 1 STEP 1 UNTIL JMAX DO\\n BEGIN\\n FOR I := 1 STEP 1 UNTIL IMAX DO\\n BEGIN\\n OUTF.OUTINT(PIXEL(I,J),0);\\n OUTF.OUTIMAGE;\\n END;\\n END;\\n OUTF.CLOSE;\\n END PLOT;\\n\\n XCENTRE := -0.5;\\n YCENTRE := 0.0;\\n WIDTH := 4.0;\\n IMAX := 800;\\n JMAX := 600;\\n N := 100;\\n RMAX := 2.0;\\n FILENAME :- \\\"out.pgm\\\";\\n COLOURMAX := 255;\\n PIXELSIZE := WIDTH / IMAX;\\n XOFFSET := XCENTRE - (0.5 * PIXELSIZE * (IMAX + 1));\\n YOFFSET := YCENTRE + (0.5 * PIXELSIZE * (JMAX + 1));\\n\\n OUTTEXT(\\\"OUTPUT WILL BE WRITTEN TO \\\");\\n OUTTEXT(FILENAME);\\n OUTIMAGE;\\n\\n PLOT;\\nEND;\\n\",\n \"language\": \"Simula\"\n },\n {\n \"code\": \" 10 FOR I=0 TO 63\\n 20 FOR J=43 TO 0 STEP -1\\n 30 LET X=(I-52)/31\\n 40 LET Y=(J-22)/31\\n 50 LET XA=0\\n 60 LET YA=0\\n 70 LET ITER=0\\n 80 LET XTEMP=XA*XA-YA*YA+X\\n 90 LET YA=2*XA*YA+Y\\n100 LET XA=XTEMP\\n110 LET ITER=ITER+1\\n120 IF XA*XA+YA*YA<=4 AND ITER<200 THEN GOTO 80\\n130 IF ITER=200 THEN PLOT I, J\\n140 NEXT J\\n150 NEXT I\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"X = RNDF()*4-2\\nY = RNDF()*4-2@N\\nN = N+16\\nI = X+S*S-T*T\\nT = Y+S*T*2\\nS = I\\nIF N < #L&&S*S+T*T < 4 GOTO @N\\nGPSET X*50+99, Y*50+99, RGB(99 XOR N,N,N)\\nEXEC.\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"OPTION STRICT\\nVAR XP, YP, X, Y, X0, Y0, X2, Y2\\nVAR NEXT_X, IT, C\\nFOR XP = -200 TO 199\\n FOR YP = -120 TO 119\\n X = 0: Y = 0\\n X0 = XP / 100: Y0 = YP / 100\\n IT = 0\\n X2 = X * X: Y2 = Y * Y\\n WHILE X2 + Y2 <= 4 AND IT < 100\\n NEXT_X = X2 - Y2 + X0\\n Y = 2 * X * Y + Y0\\n X = NEXT_X\\n X2 = X * X: Y2 = Y * Y\\n INC IT\\n WEND\\n IF IT == 100 THEN C = 0 ELSE C = IT\\n GPSET XP + 200, YP + 120, RGB((C * 3) MOD 200 + 50, FLOOR(C * 1.2) + 20, C)\\n NEXT\\nNEXT\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"#!/usr/local/bin/spar\\npragma annotate( summary, \\\"mandel\\\" )\\n @( description, \\\"Create a color image of the Mandelbrot set\\\" )\\n @( author, \\\"Ken O. Burtch\\\" );\\npragma license( unrestricted );\\n\\npragma restriction( no_external_commands );\\n\\nprocedure mandel is\\n\\n mandel_limit : constant long_float := 4.0; -- reach this? it's the set\\n max_iterations : constant integer := 128; -- quit if looped this amt\\n\\n center_r : constant long_float := -0.75; -- center of set (x=real)\\n center_i : constant long_float := 0.0; -- center of set (i=imag.)\\n\\n c_r : long_float; -- current point (x=real)\\n c_i : long_float; -- current point (i=imag.)\\n\\n loop_count : integer; -- number of iterations\\n\\n z_r : long_float; -- mandelbot set formula\\n z_i : long_float; -- variables\\n z_r2 : long_float;\\n z_i2 : long_float;\\n\\n c : pen.canvas_id; -- bush drawing canvas\\n plot : limited pen.rect; -- rectangle to draw with\\n s : string;\\n\\n bits : integer; -- for determining color\\n red : pen.rgbcomponent;\\n green: pen.rgbcomponent;\\n blue : pen.rgbcomponent;\\nbegin\\n\\n -- create the drawing canvas\\n\\n pen.new_window_canvas( 200, 200, 32, c );\\n pen.set_title( c, \\\"Mandelbrot\\\" );\\n\\n -- loop for the size of the canvas (-50% to +50%)\\n\\n for i in -50..50 loop\\n c_i := center_i - long_float(i)*0.025;\\n pen.wait_to_reveal( c );\\n for r in -50..50 loop\\n c_r := center_r - long_float(r)*0.025;\\n\\n -- Evaluatuate how close point (c_z, c_i ) in complex number space\\n -- is to the Mandelbrot set. Return a number between 0 and\\n -- max_iterations. A value of max_iterations implies that the point\\n -- is probably a member of the Mandelbrot set.\\n\\n z_r := c_r;\\n z_i := c_i;\\n loop_count := 1;\\n loop\\n z_i2 := z_i*z_i;\\n z_r2 := z_r*z_r;\\n z_i := 2.0 * z_r * z_i + c_i;\\n z_r := z_r2 - z_i2 + c_r;\\n loop_count := @+1;\\n exit when not ( (z_r2 + z_i2 < mandel_limit) and (loop_count /= max_iterations) );\\n end loop;\\n\\n -- pick a color based on loop_count (mandelbrot set is black)\\n\\n if loop_count = max_iterations then\\n red := 0.0;\\n green := 0.0;\\n blue := 0.0;\\n else\\n bits := (loop_count and 3 );\\n red := 100.0-pen.rgbcomponent((100*bits/3));\\n bits := (loop_count / 3 ) and 3;\\n green := 100.0-pen.rgbcomponent((100*bits/3));\\n bits := (loop_count / 27 ) and 2;\\n blue := 100.0-pen.rgbcomponent((100*bits)/2);\\n end if;\\n pen.set_pen_ink( c, red, green, blue );\\n\\n -- Draw the point, reversing the X axis\\n\\n pen.set_rect( plot, 100-(r+50),i+50, 100-(r+49), i+51 );\\n pen.paint_rect( c, plot );\\n end loop;\\n pen.reveal( c );\\n end loop;\\n\\n ? \\\"Press return\\\";\\n s := get_line;\\n\\nend mandel;\\n\",\n \"language\": \"SparForte\"\n },\n {\n \"code\": \"con\\n _clkmode = xtal1+pll16x\\n _clkfreq = 80_000_000\\n\\n xmin=-8601 ' int(-2.1*4096)\\n xmax=2867 ' int( 0.7*4096)\\n\\n ymin=-4915 ' int(-1.2*4096)\\n ymax=4915 ' int( 1.2*4096)\\n\\n maxiter=25\\n\\nobj\\n ser : \\\"FullDuplexSerial\\\"\\n\\npub main | c,cx,cy,dx,dy,x,y,x2,y2,iter\\n\\n ser.start(31, 30, 0, 115200)\\n\\n dx:=(xmax-xmin)/79\\n dy:=(ymax-ymin)/24\\n\\n cy:=ymin\\n repeat while cy=<ymax\\n cx:=xmin\\n repeat while cx=<xmax\\n x:=0\\n y:=0\\n x2:=0\\n y2:=0\\n iter:=0\\n repeat while iter=<maxiter and x2+y2=<16384\\n y:=((x*y)~>11)+cy\\n x:=x2-y2+cx\\n iter+=1\\n x2:=(x*x)~>12\\n y2:=(y*y)~>12\\n cx+=dx\\n ser.tx(iter+32)\\n cy+=dy\\n ser.str(string(13,10))\\n\\n waitcnt(_clkfreq+cnt)\\n ser.stop\\n\",\n \"language\": \"Spin\"\n },\n {\n \"code\": \"w,h = #.scrsize()\\nsfx = -2.5; sfy = -2*h/w; fs = 4/w\\n#.aaoff()\\n> y, 1...h\\n > x, 1...w\\n fx = sfx + x*fs; fy = sfy + y*fs\\n #.drawpoint(x,y,color(fx,fy):3)\\n <\\n<\\ncolor(x,y)=\\n zr = x; zi = y; n = 0; maxn = 150\\n > zr*zr+zi*zi<4 & n<maxn\\n zrn = zr*zr-zi*zi+x; zin = 2*zr*zi+y\\n zr = zrn; zi = zin; n += 1\\n <\\n ? n=maxn, <= 0,0,0\\n <= #.hsv2rgb(n/maxn*360,1,1):3\\n.\\n\",\n \"language\": \"SPL\"\n },\n {\n \"code\": \"import Foundation\\nimport Numerics\\nimport QDBMP\\n\\npublic typealias Color = (red: UInt8, green: UInt8, blue: UInt8)\\n\\npublic class BitmapDrawer {\\n public let imageHeight: Int\\n public let imageWidth: Int\\n\\n var grid: [[Color?]]\\n\\n private let bmp: OpaquePointer\\n\\n public init(height: Int, width: Int) {\\n self.imageHeight = height\\n self.imageWidth = width\\n self.grid = [[Color?]](repeating: [Color?](repeating: nil, count: height), count: width)\\n self.bmp = BMP_Create(UInt(width), UInt(height), 24)\\n\\n checkError()\\n }\\n\\n deinit {\\n BMP_Free(bmp)\\n }\\n\\n private func checkError() {\\n let err = BMP_GetError()\\n\\n guard err == BMP_STATUS(0) else {\\n fatalError(\\\"\\\\(err)\\\")\\n }\\n }\\n\\n public func save(to path: String = \\\"~/Desktop/out.bmp\\\") {\\n for x in 0..<imageWidth {\\n for y in 0..<imageHeight {\\n guard let color = grid[x][y] else { continue }\\n\\n BMP_SetPixelRGB(bmp, UInt(x), UInt(y), color.red, color.green, color.blue)\\n checkError()\\n }\\n }\\n\\n (path as NSString).expandingTildeInPath.withCString {s in\\n BMP_WriteFile(bmp, s)\\n }\\n }\\n\\n public func setPixel(x: Int, y: Int, to color: Color?) {\\n grid[x][y] = color\\n }\\n}\\n\\nlet imageSize = 10_000\\nlet canvas = BitmapDrawer(height: imageSize, width: imageSize)\\nlet maxIterations = 256\\nlet cxMin = -2.0\\nlet cxMax = 1.0\\nlet cyMin = -1.5\\nlet cyMax = 1.5\\nlet scaleX = (cxMax - cxMin) / Double(imageSize)\\nlet scaleY = (cyMax - cyMin) / Double(imageSize)\\n\\nfor x in 0..<imageSize {\\n for y in 0..<imageSize {\\n let cx = cxMin + Double(x) * scaleX\\n let cy = cyMin + Double(y) * scaleY\\n\\n let c = Complex(cx, cy)\\n var z = Complex(0.0, 0.0)\\n var i = 0\\n\\n for t in 0..<maxIterations {\\n if z.magnitude > 2 {\\n break\\n }\\n\\n z = z * z + c\\n i = t\\n }\\n\\n canvas.setPixel(x: x, y: y, to: Color(red: UInt8(i), green: UInt8(i), blue: UInt8(i)))\\n }\\n}\\n\\ncanvas.save()\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"package require Tk\\n\\nproc mandelIters {cx cy} {\\n set x [set y 0.0]\\n for {set count 0} {hypot($x,$y) < 2 && $count < 255} {incr count} {\\n set x1 [expr {$x*$x - $y*$y + $cx}]\\n set y1 [expr {2*$x*$y + $cy}]\\n set x $x1; set y $y1\\n }\\n return $count\\n}\\nproc mandelColor {iter} {\\n set r [expr {16*($iter % 15)}]\\n set g [expr {32*($iter % 7)}]\\n set b [expr {8*($iter % 31)}]\\n format \\\"#%02x%02x%02x\\\" $r $g $b\\n}\\nimage create photo mandel -width 300 -height 300\\n# Build picture in strips, updating as we go so we have \\\"progress\\\" monitoring\\n# Also set the cursor to tell the user to wait while we work.\\npack [label .mandel -image mandel -cursor watch]\\nupdate\\nfor {set x 0} {$x < 300} {incr x} {\\n for {set y 0} {$y < 300} {incr y} {\\n set i [mandelIters [expr {($x-220)/100.}] [expr {($y-150)/90.}]]\\n mandel put [mandelColor $i] -to $x $y\\n }\\n update\\n}\\n.mandel configure -cursor {}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"PROGRAM:MANDELBR\\n:Input \\\"ITER. \\\",D\\n:For(A,Xmin,Xmax,ΔX)\\n:For(B,Ymin,Ymax,ΔY)\\n:0→X\\n:0→Y\\n:0→I\\n:D→M\\n:While X^2+Y^2≤4 and I<M\\n:X^2-Y^2+A→R\\n:2XY+B→Y\\n:R→X\\n:I+1→I\\n:End\\n:If I≠M\\n:Then\\n:I→C\\n:Else\\n:0→C\\n:End\\n:If C<1\\n:Pt-On(A,B)\\n:End\\n:End\\n:End\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"SET WINDOW 0, 256, 0, 192\\n\\nLET x1 = 256/2\\nLET y1 = 192/2\\nLET i1 = -1\\nLET i2 = 1\\nLET r1 = -2\\nLET r2 = 1\\nLET s1 = (r2-r1) / x1\\nLET s2 = (i2-i1) / y1\\n\\nFOR y = 0 TO y1 STEP .05\\n LET i3 = i1 + s2 * y\\n FOR x = 0 TO x1 STEP .05\\n LET r3 = r1 + s1 * x\\n LET z1 = r3\\n LET z2 = i3\\n FOR n = 0 TO 30\\n LET a = z1 * z1\\n LET b = z2 * z2\\n IF a+b > 4 THEN EXIT FOR\\n LET z2 = 2 * z1 * z2 + i3\\n LET z1 = a - b + r3\\n NEXT n\\n SET COLOR n - 16*INT(n/16)\\n PLOT POINTS: x,y\\n NEXT x\\nNEXT y\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"(defvar x-centre -0.5)\\n(defvar y-centre 0.0)\\n(defvar width 4.0)\\n(defvar i-max 800)\\n(defvar j-max 600)\\n(defvar n 100)\\n(defvar r-max 2.0)\\n(defvar file \\\"mandelbrot.pgm\\\")\\n(defvar colour-max 255)\\n(defvar pixel-size (/ width i-max))\\n(defvar x-offset (- x-centre (* 0.5 pixel-size (+ i-max 1))))\\n(defvar y-offset (+ y-centre (* 0.5 pixel-size (+ j-max 1))))\\n\\n;; with-output-to-file macro\\n(defmacro with-output-to-file (name . body)\\n ^(let ((*stdout* (open-file ,name \\\"w\\\")))\\n (unwind-protect (progn ,*body) (close-stream *stdout*))))\\n\\n;; complex number library\\n(defmacro cplx (x y) ^(cons ,x ,y))\\n(defmacro re (c) ^(car ,c))\\n(defmacro im (c) ^(cdr ,c))\\n\\n(defsymacro c0 '(0 . 0))\\n\\n(macro-time\\n (defun with-cplx-expand (specs body)\\n (tree-case specs\\n (((re im expr) . rest)\\n ^(tree-bind (,re . ,im) ,expr ,(with-cplx-expand rest body)))\\n (() (tree-case body\\n ((a b . rest) ^(progn ,a ,b ,*rest))\\n ((a) a)\\n (x (error \\\"with-cplx: invalid body ~s\\\" body))))\\n (x (error \\\"with-cplx: bad args ~s\\\" x)))))\\n\\n(defmacro with-cplx (specs . body)\\n (with-cplx-expand specs body))\\n\\n(defun c+ (x y)\\n (with-cplx ((a b x) (c d y))\\n (cplx (+ a c) (+ b d))))\\n\\n(defun c* (x y)\\n (with-cplx ((a b x) (c d y))\\n (cplx (- (* a c) (* b d)) (+ (* b c) (* a d)))))\\n\\n(defun modulus (z)\\n (with-cplx ((a b z))\\n (sqrt (+ (* a a) (* b b)))))\\n\\n;; Mandelbrot routines\\n(defun inside-p (z0 : (z c0) (n n))\\n (and (< (modulus z) r-max)\\n (or (zerop n)\\n (inside-p z0 (c+ (c* z z) z0) (- n 1)))))\\n\\n(defmacro int-bool (b)\\n ^(if ,b colour-max 0))\\n\\n(defun pixel (i j)\\n (int-bool\\n (inside-p\\n (cplx (+ x-offset (* pixel-size i))\\n (- y-offset (* pixel-size j))))))\\n\\n;; Mandelbrot loop and output\\n(defun plot ()\\n (with-output-to-file file\\n (format t \\\"P2\\\\n~s\\\\n~s\\\\n~s\\\\n\\\" i-max j-max colour-max)\\n (each ((j (range 1 j-max)))\\n (each ((i (range 1 i-max)))\\n (format *stdout* \\\"~s \\\" (pixel i j)))\\n (put-line \\\"\\\" *stdout*))))\\n\\n(plot)\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"function mandelbrot() {\\n local -ir maxiter=100\\n local -i i j {x,y}m{in,ax} d{x,y}\\n local -ra C=( {0..9} )\\n local -i lC=${#C[*]}\\n local -i columns=${COLUMNS:-72} lines=${LINES:-24}\\n\\n ((\\n xmin=-21*4096/10,\\n xmax= 7*4096/10,\\n\\n ymin=-12*4096/10,\\n ymax= 12*4096/10,\\n\\n dx=(xmax-xmin)/columns,\\n dy=(ymax-ymin)/lines\\n ))\\n\\n for ((cy=ymax, i=0; i<lines; cy-=dy, i++))\\n do for ((cx=xmin, j=0; j<columns; cx+=dx, j++))\\n do (( x=0, y=0, x2=0, y2=0 ))\\n for (( iter=0; iter<maxiter && x2+y2<=16384; iter++ ))\\n do\\n ((\\n y=((x*y)>>11)+cy,\\n x=x2-y2+cx,\\n x2=(x*x)>>12,\\n y2=(y*y)>>12\\n ))\\n done\\n ((c=iter%lC))\\n echo -n \\\"${C[c]}\\\"\\n done\\n echo\\n done\\n}\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"// updates and contributors at: github.com/vlang/v/blob/master/examples/gg/mandelbrot.v\\n// graphics are moveable by keyboard or mouse and resizable with window\\nimport gg\\nimport gx\\nimport runtime\\nimport time\\n\\nconst (\\n\\tpwidth = 800\\n\\tpheight = 600\\n\\tchunk_height = 2 // image recalculated in chunks, each chunk processed in separate thread\\n\\tzoom_factor = 1.1\\n\\tmax_iterations = 255\\n)\\n\\nstruct ViewRect {\\n\\tmut:\\n\\tx_min f64\\n\\tx_max f64\\n\\ty_min f64\\n\\ty_max f64\\n}\\n\\nfn (v &ViewRect) width() f64 {\\n\\treturn v.x_max - v.x_min\\n}\\n\\nfn (v &ViewRect) height() f64 {\\n\\treturn v.y_max - v.y_min\\n}\\n\\nstruct AppState {\\n\\tmut:\\n\\tgg &gg.Context = unsafe { nil }\\n\\tiidx int\\n\\tpixels &u32 = unsafe { vcalloc(pwidth * pheight * sizeof(u32)) }\\n\\tnpixels &u32 = unsafe { vcalloc(pwidth * pheight * sizeof(u32)) } // drawings here, results swapped at the end\\n\\tview ViewRect = ViewRect{-3.0773593290970673, 1.4952456603855397, -2.019938598189011, 2.3106642054225945}\\n\\tscale int = 1\\n\\tntasks int = runtime.nr_jobs()\\n}\\n\\nconst colors = [gx.black, gx.blue, gx.red, gx.green, gx.yellow, gx.orange, gx.purple, gx.white,\\n\\tgx.indigo, gx.violet, gx.black, gx.blue, gx.orange, gx.yellow, gx.green].map(u32(it.abgr8()))\\n\\nstruct MandelChunk {\\n\\tcview ViewRect\\n\\tymin f64\\n\\tymax f64\\n}\\n\\nfn (mut state AppState) update() {\\n\\tmut chunk_channel := chan MandelChunk{cap: state.ntasks}\\n\\tmut chunk_ready_channel := chan bool{cap: 1000}\\n\\tmut threads := []thread{cap: state.ntasks}\\n\\tdefer {\\n\\t\\tchunk_channel.close()\\n\\t\\tthreads.wait()\\n\\t}\\n\\tfor t in 0 .. state.ntasks {\\n\\t\\tthreads << spawn state.worker(t, chunk_channel, chunk_ready_channel)\\n\\t}\\n\\t//\\n\\tmut oview := ViewRect{}\\n\\tmut sw := time.new_stopwatch()\\n\\tfor {\\n\\t\\tsw.restart()\\n\\t\\tcview := state.view\\n\\t\\tif oview == cview {\\n\\t\\t\\ttime.sleep(5 * time.millisecond)\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\t// schedule chunks, describing the work:\\n\\t\\tmut nchunks := 0\\n\\t\\tfor start := 0; start < pheight; start += chunk_height {\\n\\t\\t\\tchunk_channel <- MandelChunk{\\n\\t\\t\\t\\tcview: cview\\n\\t\\t\\t\\tymin: start\\n\\t\\t\\t\\tymax: start + chunk_height\\n\\t\\t\\t}\\n\\t\\t\\tnchunks++\\n\\t\\t}\\n\\t\\t// wait for all chunks to be processed:\\n\\t\\tfor _ in 0 .. nchunks {\\n\\t\\t\\t_ := <-chunk_ready_channel\\n\\t\\t}\\n\\t\\t// everything is done, swap the buffer pointers\\n\\t\\tstate.pixels, state.npixels = state.npixels, state.pixels\\n\\t\\tprintln('${state.ntasks:2} threads; ${sw.elapsed().milliseconds():3} ms / frame; scale: ${state.scale:4}')\\n\\t\\toview = cview\\n\\t}\\n}\\n\\n[direct_array_access]\\nfn (mut state AppState) worker(id int, input chan MandelChunk, ready chan bool) {\\n\\tfor {\\n\\t\\tchunk := <-input or { break }\\n\\t\\tyscale := chunk.cview.height() / pheight\\n\\t\\txscale := chunk.cview.width() / pwidth\\n\\t\\tmut x, mut y, mut iter := 0.0, 0.0, 0\\n\\t\\tmut y0 := chunk.ymin * yscale + chunk.cview.y_min\\n\\t\\tmut x0 := chunk.cview.x_min\\n\\t\\tfor y_pixel := chunk.ymin; y_pixel < chunk.ymax && y_pixel < pheight; y_pixel++ {\\n\\t\\t\\tyrow := unsafe { &state.npixels[int(y_pixel * pwidth)] }\\n\\t\\t\\ty0 += yscale\\n\\t\\t\\tx0 = chunk.cview.x_min\\n\\t\\t\\tfor x_pixel := 0; x_pixel < pwidth; x_pixel++ {\\n\\t\\t\\t\\tx0 += xscale\\n\\t\\t\\t\\tx, y = x0, y0\\n\\t\\t\\t\\tfor iter = 0; iter < max_iterations; iter++ {\\n\\t\\t\\t\\t\\tx, y = x * x - y * y + x0, 2 * x * y + y0\\n\\t\\t\\t\\t\\tif x * x + y * y > 4 {\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tunsafe {\\n\\t\\t\\t\\t\\tyrow[x_pixel] = colors[iter & 15]\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tready <- true\\n\\t}\\n}\\n\\nfn (mut state AppState) draw() {\\n\\tmut istream_image := state.gg.get_cached_image_by_idx(state.iidx)\\n\\tistream_image.update_pixel_data(unsafe { &u8(state.pixels) })\\n\\tsize := gg.window_size()\\n\\tstate.gg.draw_image(0, 0, size.width, size.height, istream_image)\\n}\\n\\nfn (mut state AppState) zoom(zoom_factor f64) {\\n\\tc_x, c_y := (state.view.x_max + state.view.x_min) / 2, (state.view.y_max + state.view.y_min) / 2\\n\\td_x, d_y := c_x - state.view.x_min, c_y - state.view.y_min\\n\\tstate.view.x_min = c_x - zoom_factor * d_x\\n\\tstate.view.x_max = c_x + zoom_factor * d_x\\n\\tstate.view.y_min = c_y - zoom_factor * d_y\\n\\tstate.view.y_max = c_y + zoom_factor * d_y\\n\\tstate.scale += if zoom_factor < 1 { 1 } else { -1 }\\n}\\n\\nfn (mut state AppState) center(s_x f64, s_y f64) {\\n\\tc_x, c_y := (state.view.x_max + state.view.x_min) / 2, (state.view.y_max + state.view.y_min) / 2\\n\\td_x, d_y := c_x - state.view.x_min, c_y - state.view.y_min\\n\\tstate.view.x_min = s_x - d_x\\n\\tstate.view.x_max = s_x + d_x\\n\\tstate.view.y_min = s_y - d_y\\n\\tstate.view.y_max = s_y + d_y\\n}\\n\\n// gg callbacks:\\n\\nfn graphics_init(mut state AppState) {\\n\\tstate.iidx = state.gg.new_streaming_image(pwidth, pheight, 4, pixel_format: .rgba8)\\n}\\n\\nfn graphics_frame(mut state AppState) {\\n\\tstate.gg.begin()\\n\\tstate.draw()\\n\\tstate.gg.end()\\n}\\n\\nfn graphics_click(x f32, y f32, btn gg.MouseButton, mut state AppState) {\\n\\tif btn == .right {\\n\\t\\tsize := gg.window_size()\\n\\t\\tm_x := (x / size.width) * state.view.width() + state.view.x_min\\n\\t\\tm_y := (y / size.height) * state.view.height() + state.view.y_min\\n\\t\\tstate.center(m_x, m_y)\\n\\t}\\n}\\n\\nfn graphics_move(x f32, y f32, mut state AppState) {\\n\\tif state.gg.mouse_buttons.has(.left) {\\n\\t\\tsize := gg.window_size()\\n\\t\\td_x := (f64(state.gg.mouse_dx) / size.width) * state.view.width()\\n\\t\\td_y := (f64(state.gg.mouse_dy) / size.height) * state.view.height()\\n\\t\\tstate.view.x_min -= d_x\\n\\t\\tstate.view.x_max -= d_x\\n\\t\\tstate.view.y_min -= d_y\\n\\t\\tstate.view.y_max -= d_y\\n\\t}\\n}\\n\\nfn graphics_scroll(e &gg.Event, mut state AppState) {\\n\\tstate.zoom(if e.scroll_y < 0 { zoom_factor } else { 1 / zoom_factor })\\n}\\n\\nfn graphics_keydown(code gg.KeyCode, mod gg.Modifier, mut state AppState) {\\n\\ts_x := state.view.width() / 5\\n\\ts_y := state.view.height() / 5\\n\\t// movement\\n\\tmut d_x, mut d_y := 0.0, 0.0\\n\\tif code == .enter {\\n\\t\\tprintln('> ViewRect{${state.view.x_min}, ${state.view.x_max}, ${state.view.y_min}, ${state.view.y_max}}')\\n\\t}\\n\\tif state.gg.pressed_keys[int(gg.KeyCode.left)] {\\n\\t\\td_x -= s_x\\n\\t}\\n\\tif state.gg.pressed_keys[int(gg.KeyCode.right)] {\\n\\t\\td_x += s_x\\n\\t}\\n\\tif state.gg.pressed_keys[int(gg.KeyCode.up)] {\\n\\t\\td_y -= s_y\\n\\t}\\n\\tif state.gg.pressed_keys[int(gg.KeyCode.down)] {\\n\\t\\td_y += s_y\\n\\t}\\n\\tstate.view.x_min += d_x\\n\\tstate.view.x_max += d_x\\n\\tstate.view.y_min += d_y\\n\\tstate.view.y_max += d_y\\n\\t// zoom in/out\\n\\tif state.gg.pressed_keys[int(gg.KeyCode.left_bracket)]\\n\\t\\t|| state.gg.pressed_keys[int(gg.KeyCode.z)] {\\n\\t\\tstate.zoom(1 / zoom_factor)\\n\\t\\treturn\\n\\t}\\n\\tif state.gg.pressed_keys[int(gg.KeyCode.right_bracket)]\\n\\t\\t|| state.gg.pressed_keys[int(gg.KeyCode.x)] {\\n\\t\\tstate.zoom(zoom_factor)\\n\\t\\treturn\\n\\t}\\n}\\n\\nfn main() {\\n\\tmut state := &AppState{}\\n\\tstate.gg = gg.new_context(\\n\\t\\twidth: 800\\n\\t\\theight: 600\\n\\t\\tcreate_window: true\\n\\t\\twindow_title: 'The Mandelbrot Set'\\n\\t\\tinit_fn: graphics_init\\n\\t\\tframe_fn: graphics_frame\\n\\t\\tclick_fn: graphics_click\\n\\t\\tmove_fn: graphics_move\\n\\t\\tkeydown_fn: graphics_keydown\\n\\t\\tscroll_fn: graphics_scroll\\n\\t\\tuser_data: state\\n\\t)\\n\\tspawn state.update()\\n\\tstate.gg.run()\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"public class Example: Gtk.Application {\\n private Gtk.ApplicationWindow window;\\n private Gtk.DrawingArea drawing_area;\\n public Example() {\\n Object(application_id: \\\"my.application\\\", flags: ApplicationFlags.FLAGS_NONE);\\n this.activate.connect(() => {\\n window = new Gtk.ApplicationWindow(this);\\n drawing_area = new Gtk.DrawingArea();\\n drawing_area.set_draw_func(draw_mandelbrot);\\n window.set_child(drawing_area);\\n window.present();\\n });\\n }\\n\\n private void draw_mandelbrot(Gtk.DrawingArea area, Cairo.Context cr, int width, int height) {\\n cr.set_source_rgb(0, 0, 0);\\n cr.paint();\\n int x0 = -1;\\n double x_increment = 2.47 / (float) width;\\n double y_increment = 2.24 / (float) height;\\n for (double x = -2.0; x < 0.47; x += x_increment, x0++) {\\n int y0 = -1;\\n for (double y = -1.12; y < 1.12; y += y_increment, y0++) {\\n double c_re = x;\\n double c_im = y;\\n double x_ = 0,\\n y_ = 0;\\n int iterations = 0;\\n int max_iterations = 50;\\n while (iterations < max_iterations && x_ * x_ + y_ * y_ <= 4.0) {\\n double x_new = x_ * x_ - y_ * y_ + c_re;\\n y_ = 2.0 * x_ * y_ + c_im;\\n x_ = x_new;\\n iterations++;\\n }\\n if (iterations < max_iterations) {\\n cr.set_source_rgb((float) iterations / (float) max_iterations, 0, 0);\\n cr.rectangle(x0, y0, 1, 1);\\n cr.fill();\\n }\\n }\\n }\\n }\\n\\n public static int main(string[] argv) {\\n var app = new Example();\\n return app.run(argv);\\n }\\n}\\n\",\n \"language\": \"Vala\"\n },\n {\n \"code\": \"option explicit\\n\\n' Raster graphics class in VBSCRIPT by Antoni Gual\\n'--------------------------------------------\\n' An array keeps the image allowing to set pixels, draw lines and boxes in it.\\n' at class destroy a bmp file is saved to disk and the default viewer is called\\n' The class can work with 8 and 24 bit bmp. With 8 bit uses a built-in palette or can import a custom one\\n\\n\\n'Declaration :\\n' Set MyObj = (New ImgClass)(name,width,height, orient,bits_per_pixel,palette_array)\\n' name:path and name of the file created\\n' width, height of the canvas\\n' orient is the way the coord increases, 1 to 4 think of the 4 cuadrants of the caterian plane\\n' 1 X:l>r Y:b>t 2 X:r>l Y:b>t 3 X:r>l Y:t>b 4 X:l>r Y:t>b\\n' bits_per_pixel can bs only 8 and 24\\n' palette array only to substitute the default palette for 8 bits, else put a 0\\n' it sets the origin at the corner of the image (bottom left if orient=1)\\n\\nClass ImgClass\\n Private ImgL,ImgH,ImgDepth,bkclr,loc,tt\\n private xmini,xmaxi,ymini,ymaxi,dirx,diry\\n public ImgArray() 'rgb in 24 bit mode, indexes to palette in 8 bits\\n private filename\\n private Palette,szpal\\n\\n Public Property Let depth (x)\\n if depth=8 or depth =24 then\\n Imgdepth=depth\\n else\\n Imgdepth=8\\n end if\\n bytepix=imgdepth/8\\n end property\\n\\n Public Property Let Pixel (x,y,color)\\n If (x>=ImgL) or x<0 then exit property\\n if y>=ImgH or y<0 then exit property\\n ImgArray(x,y)=Color\\n End Property\\n\\n Public Property Get Pixel (x,y)\\n If (x<ImgL) And (x>=0) And (y<ImgH) And (y>=0) Then\\n Pixel=ImgArray(x,y)\\n End If\\n End Property\\n\\n Public Property Get ImgWidth ()\\n ImgWidth=ImgL-1\\n End Property\\n\\n Public Property Get ImgHeight ()\\n ImgHeight=ImgH-1\\n End Property\\n\\n 'constructor (fn,w*2,h*2,32,0,0)\\n Public Default Function Init(name,w,h,orient,dep,bkg,mipal)\\n 'offx, offy posicion de 0,0. si ofx+ , x se incrementa de izq a der, si offy+ y se incrementa de abajo arriba\\n dim i,j\\n ImgL=w\\n ImgH=h\\n tt=timer\\n set0 0,0 'origin blc positive up and right\\n redim imgArray(ImgL-1,ImgH-1)\\n bkclr=bkg\\n if bkg<>0 then\\n for i=0 to ImgL-1\\n for j=0 to ImgH-1\\n imgarray(i,j)=bkg\\n next\\n next\\n end if\\n Select Case orient\\n Case 1: dirx=1 : diry=1\\n Case 2: dirx=-1 : diry=1\\n Case 3: dirx=-1 : diry=-1\\n Case 4: dirx=1 : diry=-1\\n End select\\n filename=name\\n ImgDepth =dep\\n 'load user palette if provided\\n if imgdepth=8 then\\n loadpal(mipal)\\n end if\\n set init=me\\n end function\\n\\n private sub loadpal(mipale)\\n if isarray(mipale) Then\\n palette=mipale\\n szpal=UBound(mipale)+1\\n Else\\n szpal=256\\n 'Default palette recycled from ATARI\\n\\n End if\\n End Sub\\n public sub set0 (x0,y0) 'origin can be changed during drawing\\n if x0<0 or x0>=imgl or y0<0 or y0>imgh then err.raise 9\\n xmini=-x0\\n ymini=-y0\\n xmaxi=xmini+imgl-1\\n ymaxi=ymini+imgh-1\\n\\n end sub\\n\\n\\n Private Sub Class_Terminate\\n if err <>0 then wscript.echo \\\"Error \\\" & err.number\\n wscript.echo \\\"writing bmp to file\\\"\\n savebmp\\n wscript.echo \\\"opening \\\" & filename\\n CreateObject(\\\"Shell.Application\\\").ShellExecute filename\\n wscript.echo timer-tt & \\\" seconds\\\"\\n End Sub\\n\\n\\n 'writes a 32bit integr value as binary to an utf16 string\\n function long2wstr( x) 'falta muy poco!!!\\n dim k1,k2,x1\\n k1= (x and &hffff&)' or (&H8000& And ((X And &h8000&)<>0)))\\n k2=((X And &h7fffffff&) \\\\ &h10000&) Or (&H8000& And (x<0))\\n long2wstr=chrw(k1) & chrw(k2)\\n end function\\n\\n function int2wstr(x)\\n int2wstr=ChrW((x and &h7fff) or (&H8000 And (X<0)))\\n End Function\\n\\n\\n Public Sub SaveBMP\\n 'Save the picture to a bmp file\\n Dim s,ostream, x,y,loc\\n\\n const hdrs=54 '14+40\\n dim bms:bms=ImgH* 4*(((ImgL*imgdepth\\\\8)+3)\\\\4) 'bitmap size including padding\\n dim palsize:if (imgdepth=8) then palsize=szpal*4 else palsize=0\\n\\n with CreateObject(\\\"ADODB.Stream\\\") 'auxiliary ostream, it creates an UNICODE with bom stream in memory\\n .Charset = \\\"UTF-16LE\\\" 'o \\\"UTF16-BE\\\"\\n .Type = 2' adTypeText\\n .open\\n\\n 'build a header\\n 'bmp header: VBSCript does'nt have records nor writes binary values to files, so we use strings of unicode chars!!\\n 'BMP header\\n .writetext ChrW(&h4d42) ' 0 \\\"BM\\\" 4d42\\n .writetext long2wstr(hdrs+palsize+bms) ' 2 fiesize\\n .writetext long2wstr(0) ' 6 reserved\\n .writetext long2wstr (hdrs+palsize) '10 image offset\\n 'InfoHeader\\n .writetext long2wstr(40) '14 infoheader size\\n .writetext long2wstr(Imgl) '18 image length\\n .writetext long2wstr(imgh) '22 image width\\n .writetext int2wstr(1) '26 planes\\n .writetext int2wstr(imgdepth) '28 clr depth (bpp)\\n .writetext long2wstr(&H0) '30 compression used 0= NOCOMPR\\n\\n .writetext long2wstr(bms) '34 imgsize\\n .writetext long2wstr(&Hc4e) '38 bpp hor\\n .writetext long2wstr(&hc43) '42 bpp vert\\n .writetext long2wstr(szpal) '46 colors in palette\\n .writetext long2wstr(&H0) '50 important clrs 0=all\\n\\n 'write bitmap\\n 'precalc data for orientation\\n Dim x1,x2,y1,y2\\n If dirx=-1 Then x1=ImgL-1 :x2=0 Else x1=0:x2=ImgL-1\\n If diry=-1 Then y1=ImgH-1 :y2=0 Else y1=0:y2=ImgH-1\\n\\n Select Case imgdepth\\n\\n Case 32\\n For y=y1 To y2 step diry\\n For x=x1 To x2 Step dirx\\n 'writelong fic, Pixel(x,y)\\n .writetext long2wstr(Imgarray(x,y))\\n Next\\n Next\\n\\n Case 8\\n 'palette\\n For x=0 to szpal-1\\n .writetext long2wstr(palette(x)) '52\\n Next\\n 'image\\n dim pad:pad=ImgL mod 4\\n For y=y1 to y2 step diry\\n For x=x1 To x2 step dirx*2\\n .writetext chrw((ImgArray(x,y) and 255)+ &h100& *(ImgArray(x+dirx,y) and 255))\\n Next\\n 'line padding\\n if pad and 1 then .writetext chrw(ImgArray(x2,y))\\n if pad >1 then .writetext chrw(0)\\n Next\\n\\n Case Else\\n WScript.Echo \\\"ColorDepth not supported : \\\" & ImgDepth & \\\" bits\\\"\\n End Select\\n\\n 'use a second stream to save to file starting past the BOM the first ADODB.Stream has added\\n Dim outf:Set outf= CreateObject(\\\"ADODB.Stream\\\")\\n outf.Type = 1 ' adTypeBinary\\n outf.Open\\n .position=2 'remove bom (1 wchar)\\n .CopyTo outf\\n .close\\n outf.savetofile filename,2 'adSaveCreateOverWrite\\n outf.close\\n end with\\n End Sub\\nEnd Class\\n\\nfunction mandelpx(x0,y0,maxit)\\n dim x,y,xt,i,x2,y2\\n i=0:x2=0:y2=0\\n Do While i< maxit\\n i=i+1\\n xt=x2-y2+x0\\n y=2*x*y+y0\\n x=xt\\n x2=x*x:y2=y*y\\n If (x2+y2)>=4 Then Exit do\\n loop\\n if i=maxit then\\n mandelpx=0\\n else\\n mandelpx = i\\n end if\\nend function\\n\\nSub domandel(x1,x2,y1,y2)\\n Dim i,ii,j,jj,pix,xi,yi,ym\\n ym=X.ImgHeight\\\\2\\n 'get increments in the mandel plane\\n xi=Abs((x1-x2)/X.ImgWidth)\\n yi=Abs((y2-0)/(X.ImgHeight\\\\2))\\n j=0\\n For jj=0. To y2 Step yi\\n i=0\\n For ii=x1 To x2 Step xi\\n pix=mandelpx(ii,jj,256)\\n 'use simmetry\\n X.imgarray(i,ym-j)=pix\\n X.imgarray(i,ym+j)=pix\\n i=i+1\\n Next\\n j=j+1\\n next\\nEnd Sub\\n\\n'main------------------------------------\\nDim i,x\\n'custom palette\\ndim pp(255)\\nfor i=1 to 255\\n pp(i)=rgb(0,0,255*(i/255)^.25) 'VBS' RGB function is for the web, it's bgr for Windows BMP !!\\nnext\\n\\ndim fn:fn=CreateObject(\\\"Scripting.FileSystemObject\\\").GetSpecialFolder(2)& \\\"\\\\mandel.bmp\\\"\\nSet X = (New ImgClass)(fn,580,480,1,8,0,pp)\\ndomandel -2.,1.,-1.2,1.2\\nSet X = Nothing\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"#1 =-21000 // left edge = -2.1\\n#2 = 15000 // right edge = 1.5\\n#3 = 15000 // top edge = 1.5\\n#4 =-15000 // bottom edge = -1.5\\n#5 = 200 // max iteration depth\\n#6 = 350 // x step size\\n#7 = 750 // y step size\\n\\nBuf_Switch(Buf_Free)\\nfor (#12 = #3; #12 > #4; #12 -= #7) { // y0\\n for (#11 = #1; #11 < #2; #11 += #6) { // x0\\n #22 = 0 // y\\n #21 = 0 // x\\n #9 = ' ' // char to be displayed\\n for (#15 = 0; #15 < #5; #15++) { // iteration\\n #31 = (#21/10 * #21) / 1000 // x*x\\n #32 = (#22/10 * #22) / 1000 // y*y\\n if (#31 + #32 > 40000) {\\n #9 = '0' + #15 // print digit 0...9\\n if (#15 > 9) { // if iteration count > 9,\\n #9 = '@' // print '@'\\n }\\n break\\n }\\n #33 = #31 - #32 + #11 // temp = x*x - y*y + x0\\n #22 = (#21/10 * #22) / 500 + #12 // y = 2*x*y + y0\\n #21 = #33 // x = temp\\n }\\n Ins_Char(#9)\\n }\\n Ins_Newline\\n}\\nBOF\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"import \\\"graphics\\\" for Canvas, Color\\nimport \\\"dome\\\" for Window\\n\\nvar MaxIters = 570\\nvar Zoom = 150\\n\\nclass MandelbrotSet {\\n construct new(width, height) {\\n Window.title = \\\"Mandelbrot Set\\\"\\n Window.resize(width, height)\\n Canvas.resize(width, height)\\n _w = width\\n _h = height\\n }\\n\\n init() {\\n createMandelbrot()\\n }\\n\\n createMandelbrot() {\\n for (x in 0..._w) {\\n for (y in 0..._h) {\\n var zx = 0\\n var zy = 0\\n var cX = (x - 400) / Zoom\\n var cY = (y - 300) / Zoom\\n var i = MaxIters\\n while (zx * zx + zy * zy < 4 && i > 0) {\\n var tmp = zx * zx - zy * zy + cX\\n zy = 2 * zx * zy + cY\\n zx = tmp\\n i = i - 1\\n }\\n var r = i * 255 / MaxIters\\n Canvas.pset(x, y, Color.rgb(r, r, r))\\n }\\n }\\n }\\n\\n update() {}\\n\\n draw(alpha) {}\\n}\\n\\nvar Game = MandelbrotSet.new(800, 600)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"include c:\\\\cxpl\\\\codes; \\\\intrinsic 'code' declarations\\nint X, Y, \\\\screen coordinates of current point\\n Cnt; \\\\iteration counter\\nreal Cx, Cy, \\\\coordinates scaled to +/-2 range\\n Zx, Zy, \\\\complex accumulator\\n Temp; \\\\temporary scratch\\n[SetVid($112); \\\\set 640x480x24 graphics mode\\nfor Y:= 0 to 480-1 do \\\\for all points on the screen...\\n for X:= 0 to 640-1 do\\n [Cx:= (float(X)/640.0 - 0.5) * 4.0; \\\\range: -2.0 to +2.0\\n Cy:= (float(Y-240)/240.0) * 1.5; \\\\range: -1.5 to +1.5\\n Cnt:= 0; Zx:= 0.0; Zy:= 0.0; \\\\initialize\\n loop [if Zx*Zx + Zy*Zy > 2.0 then \\\\Z heads toward infinity\\n [Point(X, Y, Cnt<<21+Cnt<<10+Cnt<<3); \\\\set color of pixel to\\n quit; \\\\ rate it approached infinity\\n ]; \\\\move on to next point\\n Temp:= Zx*Zy;\\n Zx:= Zx*Zx - Zy*Zy + Cx; \\\\calculate next iteration of Z\\n Zy:= 2.0*Temp + Cy;\\n Cnt:= Cnt+1; \\\\count number of iterations\\n if Cnt >= 1000 then quit; \\\\assume point is in Mandelbrot\\n ]; \\\\ set and leave it colored black\\n ];\\nX:= ChIn(1); \\\\wait for keystroke\\nSetVid($03); \\\\restore normal text display\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n<xsl:stylesheet version=\\\"1.0\\\" xmlns:xsl=\\\"http://www.w3.org/1999/XSL/Transform\\\">\\n\\n<!-- XSLT Mandelbrot - written by Joel Yliluoma 2007, http://iki.fi/bisqwit/ -->\\n\\n<xsl:output method=\\\"html\\\" indent=\\\"no\\\"\\n doctype-public=\\\"-//W3C//DTD HTML 4.01//EN\\\"\\n doctype-system=\\\"http://www.w3.org/TR/REC-html40/strict.dtd\\\"\\n />\\n\\n<xsl:template match=\\\"/fractal\\\">\\n <html>\\n <head>\\n <title>XSLT fractal</title>\\n <style type=\\\"text/css\\\">\\nbody { color:#55F; background:#000 }\\npre { font-family:monospace; font-size:7px }\\npre span { background:<xsl:value-of select=\\\"background\\\" /> }\\n </style>\\n </head>\\n <body>\\n <div style=\\\"position:absolute;top:20px;left:20em\\\">\\n Copyright © 1992,2007 Joel Yliluoma\\n (<a href=\\\"http://iki.fi/bisqwit/\\\">http://iki.fi/bisqwit/</a>)\\n </div>\\n <h1 style=\\\"margin:0px\\\">XSLT fractal</h1>\\n <pre><xsl:call-template name=\\\"bisqwit-mandelbrot\\\" /></pre>\\n </body>\\n </html>\\n</xsl:template>\\n\\n<xsl:template name=\\\"bisqwit-mandelbrot\\\"\\n ><xsl:call-template name=\\\"bisqwit-mandelbrot-line\\\">\\n <xsl:with-param name=\\\"y\\\" select=\\\"y/min\\\"/>\\n </xsl:call-template\\n></xsl:template>\\n\\n<xsl:template name=\\\"bisqwit-mandelbrot-line\\\"\\n ><xsl:param name=\\\"y\\\"\\n /><xsl:call-template name=\\\"bisqwit-mandelbrot-column\\\">\\n <xsl:with-param name=\\\"x\\\" select=\\\"x/min\\\"/>\\n <xsl:with-param name=\\\"y\\\" select=\\\"$y\\\"/>\\n </xsl:call-template\\n ><xsl:if test=\\\"$y < y/max\\\"\\n ><br\\n /><xsl:call-template name=\\\"bisqwit-mandelbrot-line\\\">\\n <xsl:with-param name=\\\"y\\\" select=\\\"$y + y/step\\\"/>\\n </xsl:call-template\\n ></xsl:if\\n></xsl:template>\\n\\n<xsl:template name=\\\"bisqwit-mandelbrot-column\\\"\\n ><xsl:param name=\\\"x\\\"\\n /><xsl:param name=\\\"y\\\"\\n /><xsl:call-template name=\\\"bisqwit-mandelbrot-slot\\\">\\n <xsl:with-param name=\\\"x\\\" select=\\\"$x\\\" />\\n <xsl:with-param name=\\\"y\\\" select=\\\"$y\\\" />\\n <xsl:with-param name=\\\"zr\\\" select=\\\"$x\\\" />\\n <xsl:with-param name=\\\"zi\\\" select=\\\"$y\\\" />\\n </xsl:call-template\\n ><xsl:if test=\\\"$x < x/max\\\"\\n ><xsl:call-template name=\\\"bisqwit-mandelbrot-column\\\">\\n <xsl:with-param name=\\\"x\\\" select=\\\"$x + x/step\\\"/>\\n <xsl:with-param name=\\\"y\\\" select=\\\"$y\\\" />\\n </xsl:call-template\\n ></xsl:if\\n></xsl:template>\\n\\n<xsl:template name=\\\"bisqwit-mandelbrot-slot\\\"\\n><xsl:param name=\\\"x\\\"\\n /><xsl:param name=\\\"y\\\"\\n /><xsl:param name=\\\"zr\\\"\\n /><xsl:param name=\\\"zi\\\"\\n /><xsl:param name=\\\"iter\\\" select=\\\"0\\\"\\n /><xsl:variable name=\\\"zrsqr\\\" select=\\\"($zr * $zr)\\\"\\n /><xsl:variable name=\\\"zisqr\\\" select=\\\"($zi * $zi)\\\"\\n /><xsl:choose>\\n <xsl:when test=\\\"(4*scale*scale >= $zrsqr + $zisqr) and (maxiter > $iter+1)\\\"\\n ><xsl:call-template name=\\\"bisqwit-mandelbrot-slot\\\">\\n <xsl:with-param name=\\\"x\\\" select=\\\"$x\\\" />\\n <xsl:with-param name=\\\"y\\\" select=\\\"$y\\\" />\\n <xsl:with-param name=\\\"zi\\\" select=\\\"(2 * $zr * $zi) div scale + $y\\\" />\\n <xsl:with-param name=\\\"zr\\\" select=\\\"($zrsqr - $zisqr) div scale + $x\\\" />\\n <xsl:with-param name=\\\"iter\\\" select=\\\"$iter + 1\\\" />\\n </xsl:call-template\\n ></xsl:when>\\n <xsl:otherwise\\n ><xsl:variable name=\\\"magnitude\\\" select=\\\"magnitude[@value=$iter]\\\"\\n /><span style=\\\"color:{$magnitude/color}\\\"\\n ><xsl:value-of select=\\\"$magnitude/symbol\\\"\\n /></span></xsl:otherwise>\\n </xsl:choose\\n></xsl:template>\\n\\n</xsl:stylesheet>\\n\",\n \"language\": \"XSLT\"\n },\n {\n \"code\": \"open window 640, 320\\nwid = 4\\nxcenter = -1: ycenter = 0\\nms = 0\\nfor xcoord = 0 to 639\\n for ycoord = 0 to 160\\n ms = 0\\n ca =(xcoord-320)/640*wid+xcenter\\n cb =(ycoord-160)/640*wid+ycenter\\n x = 0: y=0\\n\\n for t = 1 to 20\\n xnew = x*x-y*y+ca\\n ynew = 2*x*y+cb\\n x=xnew:y=ynew\\n magnitudesquared=x*x+y*y\\n ms = magnitudesquared\\n if (magnitudesquared > 100) break\\n //if(magnitudesquared < 100) then : color 0,0,0 : dot xcoord, ycoord : end if\\n next t\\n ms = ms+1\\n if(ms > 250) then\\n \\t color 32,64,mod(ms,255)\\n dot xcoord, ycoord\\n dot xcoord, 320- ycoord\\n elseif (ms > 150) then\\n color mod(ms,255),64,32\\n dot xcoord, ycoord\\n dot xcoord, 320-ycoord\\n else\\n color 0,0,0\\n dot xcoord, ycoord\\n dot xcoord, 320-ycoord\\n end if\\n next ycoord\\nnext xcoord\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \";\\n; Compute a Mandelbrot set on a simple Z80 computer.\\n;\\n; Porting this program to another Z80 platform should be easy and straight-\\n; forward: The only dependencies on my homebrew machine are the system-calls\\n; used to print strings and characters. These calls are performed by loading\\n; IX with the number of the system-call and performing an RST 08. To port this\\n; program to another operating system just replace these system-calls with\\n; the appropriate versions. Only three system-calls are used in the following:\\n; _crlf: Prints a CR/LF, _puts: Prints a 0-terminated string (the adress of\\n; which is expected in HL), and _putc: Print a single character which is\\n; expected in A. RST 0 give control back to the monitor.\\n;\\n#include \\\"mondef.asm\\\"\\n\\n org ram_start\\n\\nscale equ 256 ; Do NOT change this - the\\n ; arithmetic routines rely on\\n ; this scaling factor! :-)\\ndivergent equ scale * 4\\n\\n ld hl, welcome ; Print a welcome message\\n ld ix, _puts\\n rst 08\\n\\n; for (y = <initial_value> ; y <= y_end; y += y_step)\\n; {\\nouter_loop ld hl, (y_end) ; Is y <= y_end?\\n ld de, (y)\\n and a ; Clear carry\\n sbc hl, de ; Perform the comparison\\n jp m, mandel_end ; End of outer loop reached\\n\\n; for (x = x_start; x <= x_end; x += x_step)\\n; {\\n ld hl, (x_start) ; x = x_start\\n ld (x), hl\\ninner_loop ld hl, (x_end) ; Is x <= x_end?\\n ld de, (x)\\n and a\\n sbc hl, de\\n jp m, inner_loop_end ; End of inner loop reached\\n\\n; z_0 = z_1 = 0;\\n ld hl, 0\\n ld (z_0), hl\\n ld (z_1), hl\\n\\n; for (iteration = iteration_max; iteration; iteration--)\\n; {\\n ld a, (iteration_max)\\n ld b, a\\niteration_loop push bc ; iteration -> stack\\n; z2 = (z_0 * z_0 - z_1 * z_1) / SCALE;\\n ld de, (z_1) ; Compute DE HL = z_1 * z_1\\n ld bc, de\\n call mul_16\\n ld (z_0_square_low), hl ; z_0 ** 2 is needed later again\\n ld (z_0_square_high), de\\n\\n ld de, (z_0) ; Compute DE HL = z_0 * z_0\\n ld bc, de\\n call mul_16\\n ld (z_1_square_low), hl ; z_1 ** 2 will be also needed\\n ld (z_1_square_high), de\\n\\n and a ; Compute subtraction\\n ld bc, (z_0_square_low)\\n sbc hl, bc\\n ld (scratch_0), hl ; Save lower 16 bit of result\\n ld hl, de\\n ld bc, (z_0_square_high)\\n sbc hl, bc\\n ld bc, (scratch_0) ; HL BC = z_0 ** 2 - z_1 ** 2\\n\\n ld c, b ; Divide by scale = 256\\n ld b, l ; Discard the rest\\n push bc ; We need BC later\\n\\n; z3 = 2 * z0 * z1 / SCALE;\\n ld hl, (z_0) ; Compute DE HL = 2 * z_0 * z_1\\n add hl, hl\\n ld de, hl\\n ld bc, (z_1)\\n call mul_16\\n\\n ld b, e ; Divide by scale (= 256)\\n ld c, h ; BC contains now z_3\\n\\n; z1 = z3 + y;\\n ld hl, (y)\\n add hl, bc\\n ld (z_1), hl\\n\\n; z_0 = z_2 + x;\\n pop bc ; Here BC is needed again :-)\\n ld hl, (x)\\n add hl, bc\\n ld (z_0), hl\\n\\n; if (z0 * z0 / SCALE + z1 * z1 / SCALE > 4 * SCALE)\\n ld hl, (z_0_square_low) ; Use the squares computed\\n ld de, (z_1_square_low) ; above\\n add hl, de\\n ld bc, hl ; BC contains lower word of sum\\n\\n ld hl, (z_0_square_high)\\n ld de, (z_1_square_high)\\n adc hl, de\\n\\n ld h, l ; HL now contains (z_0 ** 2 +\\n ld l, b ; z_1 ** 2) / scale\\n\\n ld bc, divergent\\n and a\\n sbc hl, bc\\n\\n; break;\\n jp c, iteration_dec ; No break\\n pop bc ; Get latest iteration counter\\n jr iteration_end ; Exit loop\\n\\n; iteration++;\\niteration_dec pop bc ; Get iteration counter\\n djnz iteration_loop ; We might fall through!\\n; }\\niteration_end\\n; printf(\\\"%c\\\", display[iteration % 7]);\\n ld a, b\\n and $7 ; lower three bits only (c = 0)\\n sbc hl, hl\\n ld l, a\\n ld de, display ; Get start of character array\\n add hl, de ; address and load the\\n ld a, (hl) ; character to be printed\\n ld ix, _putc ; Print the character\\n rst 08\\n\\n ld de, (x_step) ; x += x_step\\n ld hl, (x)\\n add hl, de\\n ld (x), hl\\n\\n jp inner_loop\\n; }\\n; printf(\\\"\\\\n\\\");\\ninner_loop_end ld ix, _crlf ; Print a CR/LF pair\\n rst 08\\n\\n ld de, (y_step) ; y += y_step\\n ld hl, (y)\\n add hl, de\\n ld (y), hl ; Store new y-value\\n\\n jp outer_loop\\n; }\\n\\nmandel_end ld hl, finished ; Print finished-message\\n ld ix, _puts\\n rst 08\\n\\n rst 0 ; Return to the monitor\\n\\nwelcome defb \\\"Generating a Mandelbrot set\\\"\\n defb cr, lf, eos\\nfinished defb \\\"Computation finished.\\\", cr, lf, eos\\n\\niteration_max defb 10 ; How many iterations\\nx defw 0 ; x-coordinate\\nx_start defw -2 * scale ; Minimum x-coordinate\\nx_end defw 5 * scale / 10 ; Maximum x-coordinate\\nx_step defw 4 * scale / 100 ; x-coordinate step-width\\ny defw -1 * scale ; Minimum y-coordinate\\ny_end defw 1 * scale ; Maximum y-coordinate\\ny_step defw 1 * scale / 10 ; y-coordinate step-width\\nz_0 defw 0\\nz_1 defw 0\\nscratch_0 defw 0\\nz_0_square_high defw 0\\nz_0_square_low defw 0\\nz_1_square_high defw 0\\nz_1_square_low defw 0\\ndisplay defb \\\" .-+*=#@\\\" ; 8 characters for the display\\n\\n;\\n; Compute DEHL = BC * DE (signed): This routine is not too clever but it\\n; works. It is based on a standard 16-by-16 multiplication routine for unsigned\\n; integers. At the beginning the sign of the result is determined based on the\\n; signs of the operands which are negated if necessary. Then the unsigned\\n; multiplication takes place, followed by negating the result if necessary.\\n;\\nmul_16 xor a ; Clear carry and A (-> +)\\n bit 7, b ; Is BC negative?\\n jr z, bc_positive ; No\\n sub c ; A is still zero, complement\\n ld c, a\\n ld a, 0\\n sbc a, b\\n ld b, a\\n scf ; Set carry (-> -)\\nbc_positive bit 7, D ; Is DE negative?\\n jr z, de_positive ; No\\n push af ; Remember carry for later!\\n xor a\\n sub e\\n ld e, a\\n ld a, 0\\n sbc a, d\\n ld d, a\\n pop af ; Restore carry for complement\\n ccf ; Complement Carry (-> +/-?)\\nde_positive push af ; Remember state of carry\\n and a ; Start multiplication\\n sbc hl, hl\\n ld a, 16 ; 16 rounds\\nmul_16_loop add hl, hl\\n rl e\\n rl d\\n jr nc, mul_16_exit\\n add hl, bc\\n jr nc, mul_16_exit\\n inc de\\nmul_16_exit dec a\\n jr nz, mul_16_loop\\n pop af ; Restore carry from beginning\\n ret nc ; No sign inversion necessary\\n xor a ; Complement DE HL\\n sub l\\n ld l, a\\n ld a, 0\\n sbc a, h\\n ld h, a\\n ld a, 0\\n sbc a, e\\n ld e, a\\n ld a, 0\\n sbc a, d\\n ld d, a\\n ret\\n\",\n \"language\": \"Z80-Assembly\"\n },\n {\n \"code\": \"fcn mandelbrot{ // lord this is slooooow\\n bitmap:=PPM(640,480);\\n foreach y,x in ([0..479],[0..639]){\\n cx:=(x.toFloat()/640 - 0.5)*4.0; //range: -2.0 to +2.0\\n cy:=((y-240).toFloat()/240.0)*1.5; //range: -1.5 to +1.5\\n cnt:=0; zx:=0.0; zy:=0.0;\\n do(1000){\\n \\t if(zx*zx + zy*zy > 2.0){\\t//z heads toward infinity\\n\\t //set color of pixel to rate it approaches infinity\\n\\t bitmap[x,y]=cnt.shiftLeft(21) + cnt.shiftLeft(10) + cnt*8;\\n\\t break;\\n\\t }\\n\\t temp:=zx*zy;\\n\\t zx=zx*zx - zy*zy + cx;\\t\\t//calculate next iteration of z\\n\\t zy=2.0*temp + cy;\\n\\t cnt+=1;\\n }\\n }\\n bitmap.write(File(\\\"foo.ppm\\\",\\\"wb\\\"));\\n}();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Mandelbrot-set"}}},{"rowIdx":468,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Puzzles\nfrom: http://rosettacode.org/wiki/Mastermind\nnote: Games\n","language":"00-META"},{"code":"Create a simple version of the board game: [https://en.wikipedia.org/wiki/Mastermind_(board_game) Mastermind].\n\nIt must be possible to:\n:* choose the number of colors will be used in the game (2 - 20)\n:* choose the color code length (4 - 10)\n:* choose the maximum number of guesses the player has (7 - 20)\n:* choose whether or not colors may be repeated in the code\n\n<br>\nThe (computer program) game should display all the player guesses and the results of that guess.\n\nDisplay (just an idea):\n:::::: {| class=\"wikitable\" border=\"1\"\n|-\n! Feature !! Graphic Version !! Text Version \n|-\n| Player guess\n| Colored circles\n| Alphabet letters\n|-\n|Correct color & position\n|Black circle \n|X\n|-\n|Correct color\n|White circle \n|O\n|-\n|None\n|Gray circle \n| -\n|-\n|}\n\n\nA text version example: <big> 1. ADEF - XXO- </big>\n<br>Translates to:\n<br>the first guess;\n<br>the four colors (ADEF);\n<br>result: \n:::: two correct colors and spot, \n:::: one correct color/wrong spot, one color isn't in the code.\n\nHappy coding!\n\n\n;Related tasks:\n* [[Bulls and cows]]\n* [[Bulls and cows/Player]]\n* [[Guess the number]]\n* [[Guess the number/With Feedback]]\n<br><br>\n\n","language":"00-TASK"},{"code":"F encode(correct, guess)\n [String] output_arr\n\n L(i) 0 .< correct.len\n output_arr [+]= I guess[i] == correct[i] {‘X’} E I guess[i] C correct {‘O’} E ‘-’\n\n R output_arr\n\nF safe_int_input(prompt, min_val, max_val)\n L\n V user_input_str = input(prompt)\n\n X.try\n V user_input = Int(user_input_str)\n I user_input C min_val .. max_val\n R user_input\n X.catch ValueError\n L.continue\n\nF play_game()\n print(‘Welcome to Mastermind.’)\n print(‘You will need to guess a random code.’)\n print(‘For each guess, you will receive a hint.’)\n print(‘In this hint, X denotes a correct letter, and O a letter in the original string but in a different position.’)\n print()\n\n V number_of_letters = safe_int_input(‘Select a number of possible letters for the code (2-20): ’, 2, 20)\n V code_length = safe_int_input(‘Select a length for the code (4-10): ’, 4, 10)\n\n V letters = ‘ABCDEFGHIJKLMNOPQRST’[0 .< number_of_letters]\n V code = ‘’\n L 0 .< code_length\n code ‘’= random:choice(letters)\n [String] guesses\n\n L\n print()\n V guess = input(‘Enter a guess of length #. (#.): ’.format(code_length, letters)).uppercase()\n\n I guess.len != code_length | any(guess.map(char -> char !C @letters))\n L.continue\n E I guess == code\n print(\"\\nYour guess \"guess‘ was correct!’)\n L.break\n E\n guesses.append(‘#.: #. => #.’.format(guesses.len + 1, Array(guess).join(‘ ’), encode(code, guess).join(‘ ’)))\n\n L(i_guess) guesses\n print(‘------------------------------------’)\n print(i_guess)\n print(‘------------------------------------’)\n\nplay_game()\n","language":"11l"},{"code":"DEFINE MINCOLORS=\"2\"\nDEFINE MAXCOLORS=\"20\"\nDEFINE MINLENGTH=\"4\"\nDEFINE MAXLENGTH=\"10\"\nDEFINE MINGUESS=\"7\"\nDEFINE MAXGUESS=\"20\"\nTYPE Score=[BYTE spot,corr,err]\nTYPE Settings=[BYTE colors,length,guesses,repeat]\n\nPROC GetSettings(Settings POINTER s)\n CHAR ARRAY tmp(10)\n\n DO\n PrintF(\"Enter number of colors (%B-%B):\",MINCOLORS,MAXCOLORS)\n s.colors=InputB()\n UNTIL s.colors>=MINCOLORS AND s.colors<=MAXCOLORS\n OD\n DO\n PrintF(\"Enter length of code (%B-%B):\",MINLENGTH,MAXLENGTH)\n s.length=InputB()\n UNTIL s.length>=MINLENGTH AND s.length<=MAXLENGTH\n OD\n DO\n PrintF(\"Enter max number of guesses (%B-%B):\",MINGUESS,MAXGUESS)\n s.guesses=InputB()\n UNTIL s.guesses>=MINGUESS AND s.guesses<=MAXGUESS\n OD\n IF s.colors<s.length THEN\n s.repeat=1\n ELSE\n DO\n Print(\"Allow repeated colors (Y/N):\")\n InputS(tmp)\n IF tmp(0)=1 THEN\n IF tmp(1)='y OR tmp(1)='Y THEN\n s.repeat=1 EXIT\n ELSEIF tmp(1)='n OR tmp(1)='N THEN\n s.repeat=0 EXIT\n FI\n FI\n OD\n FI\nRETURN\n\nPROC Generate(CHAR ARRAY code Settings POINTER s)\n CHAR ARRAY col(MAXCOLORS)\n BYTE i,j,d,tmp,count\n\n FOR i=0 TO MAXCOLORS-1\n DO\n col(i)=i+'A\n OD\n code(0)=s.length\n count=s.colors\n FOR i=1 TO s.length\n DO\n d=Rand(count)\n code(i)=col(d)\n IF s.repeat=0 THEN\n count==-1\n col(d)=col(count)\n FI\n OD\nRETURN\n\nBYTE FUNC GetCount(CHAR ARRAY s CHAR c)\n BYTE i,count\n\n count=0\n FOR i=1 TO s(0)\n DO\n IF s(i)=c THEN\n count==+1\n FI\n OD\nRETURN (count)\n\nPROC CheckScore(CHAR ARRAY code,guess\n Settings POINTER s Score POINTER res)\n BYTE i,j,codeCount,guessCount\n\n res.spot=0\n res.corr=0\n IF guess(0)#s.length THEN\n res.err=1\n RETURN\n FI\n res.err=0\n\n FOR i=0 TO s.colors-1\n DO\n codeCount=GetCount(code,i+'A)\n guessCount=GetCount(guess,i+'A)\n IF codeCount<guessCount THEN\n res.corr==+codeCount\n ELSE\n res.corr==+guessCount\n FI\n OD\n FOR i=1 TO s.length\n DO\n IF guess(i)=code(i) THEN\n res.spot==+1\n res.corr==-1\n FI\n OD\nRETURN\n\nPROC ToUpper(CHAR ARRAY s)\n BYTE i,c\n\n IF s(0)=0 THEN RETURN FI\n FOR i=1 TO s(0)\n DO\n c=s(i)\n IF c>='a AND c<='z THEN\n s(i)=c-'a+'A\n FI\n OD\nRETURN\n\nPROC PrintScore(Score POINTER res Settings POINTER s)\n INT i\n\n FOR i=1 TO res.spot\n DO Put('X) OD\n FOR i=1 TO res.corr\n DO Put('O) OD\n FOR i=1 TO s.length-res.spot-res.corr\n DO Put('-) OD\nRETURN\n\nPROC Main()\n CHAR ARRAY code(MAXLENGTH+1),guess(255)\n Score res\n Settings s\n BYTE tries\n\n PrintE(\"Mastermind\") PutE()\n GetSettings(s) PutE()\n Generate(code,s)\n tries=s.guesses\n PrintF(\"Enter your guess (%B tries):%E\",tries)\n DO\n InputS(guess) ToUpper(guess)\n CheckScore(code,guess,s,res)\n Put(28) ;cursor up\n PrintF(\"%S -> \",guess)\n IF res.err THEN\n Print(\"Wrong input\")\n ELSE\n PrintScore(res,s)\n IF res.spot=s.length THEN\n PutE() PutE()\n PrintE(\"You won!\")\n EXIT\n FI\n tries==-1\n IF tries=0 THEN\n PutE() PutE()\n PrintE(\"You lost!\")\n EXIT\n FI\n FI\n PrintF(\", try again (%B tries):%E\",tries)\n OD\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_IO;\nwith Ada.Numerics.Discrete_Random;\nwith Ada.Strings.Fixed;\nwith Ada.Containers.Ordered_Sets;\n\nuse Ada.Strings.Fixed;\n\nprocedure MasterMind\nis\n subtype Color_Number is Positive range 2 .. 20;\n subtype Code_Size is Positive range 4 .. 10;\n subtype Guesses_Number is Positive range 7 .. 20;\n subtype Color is Character range 'A' .. 'T';\n\n function Hint(correct, guess : in String) return String\n is\n Xs : Natural := 0;\n Os : Natural := 0;\n to_display : String(1 .. correct'Length) := (others => '-');\n begin\n for I in guess'Range loop\n if guess(I) = correct(I) then\n Xs := Xs + 1;\n to_display(I) := 'X';\n end if;\n end loop;\n for I in guess'Range loop\n if to_display(I) = '-' then\n for J in correct'Range loop\n if J /= I and to_display(J) /= 'X' and correct(J) = guess(I) then\n Os := Os + 1;\n exit;\n end if;\n end loop;\n end if;\n end loop;\n return Xs * 'X' & Os * 'O' & (guess'Length - Xs - Os) * '-';\n end Hint;\n\n generic\n type Data is (<>);\n function Input(message : in String) return Data;\n -- Input will loop until a correct value is given by the user.\n -- For each wrong input, the program will prompt the range of expected values.\n\n function Input(message : in String) return Data is\n begin\n loop\n Ada.Text_IO.Put(message);\n declare\n S : constant String := Ada.Text_IO.Get_Line;\n begin\n return Data'Value(S);\n exception\n when Constraint_Error =>\n Ada.Text_IO.New_Line;\n Ada.Text_IO.Put_Line(\"Invalid input!\");\n Ada.Text_IO.Put_Line\n (\"Expected values in range:\"\n & Data'First'Img & \" ..\" & Data'Last'Img);\n Ada.Text_IO.New_Line;\n end;\n end loop;\n end;\n\n function Input_Color_Number is new Input(Color_Number);\n function Input_Code_Size is new Input(Code_Size);\n function Input_Guesses_Number is new Input(Guesses_Number);\n function Input_Boolean is new Input(Boolean);\n\n CN : constant Color_Number := Input_Color_Number(\"How many colors? \");\n GN : constant Guesses_Number := Input_Guesses_Number(\"How many guesses? \");\n CS : constant Code_Size := Input_Code_Size(\"Size of the code? \");\n repeats : Boolean := Input_Boolean(\"With repeats? \");\n -- Not constant: if Color < Code_Size, we will have repetitions anyway.\n\n subtype Actual_Colors is Color range Color'First .. Color'Val(Color'Pos(Color'First) + CN - 1);\n package Actual_Colors_Sets is new Ada.Containers.Ordered_Sets(Element_Type => Actual_Colors);\n\n package Color_Random is new Ada.Numerics.Discrete_Random(Result_Subtype => Actual_Colors);\n generator : Color_Random.Generator;\n\n function Random return String\n is\n C : String(1 .. CS);\n seen : Actual_Colors_Sets.Set;\n begin\n for I in C'Range loop\n C(I) := Color_Random.Random(generator);\n while (not repeats) and seen.Contains(C(I)) loop\n C(I) := Color_Random.Random(generator);\n end loop;\n seen.Include(C(I));\n end loop;\n return C;\n end Random;\n\n function Get_Code return String is\n begin\n loop\n Ada.Text_IO.Put(\"> \");\n declare\n input : constant String := Ada.Text_IO.Get_Line;\n begin\n if input'Length /= CS then\n raise Constraint_Error;\n end if;\n for C of input loop\n if C not in Actual_Colors then\n raise Constraint_Error;\n end if;\n end loop;\n return input;\n exception\n when Constraint_Error =>\n Ada.Text_IO.New_Line;\n Ada.Text_IO.Put_Line(\"Invalid input!\");\n Ada.Text_IO.New_Line;\n end;\n end loop;\n end Get_Code;\n\n found : Boolean := False;\nbegin\n if (not repeats) and (CN < CS) then\n Ada.Text_IO.Put_Line(\"Not enough colors! Using repeats anyway.\");\n repeats := True;\n end if;\n\n Color_Random.Reset(generator);\n\n declare\n answer : constant String := Random;\n previous : array(1 .. GN) of String(1 .. CS*2);\n begin\n for I in 1 .. GN loop\n declare\n guess : constant String := Get_Code;\n begin\n if guess = answer then\n Ada.Text_IO.Put_Line(\"You won, congratulations!\");\n found := True;\n else\n previous(I) := guess & Hint(answer, guess);\n Ada.Text_IO.Put_Line(44 * '-');\n for J in 1 .. I loop\n Ada.Text_IO.Put_Line\n (previous(J)(1 .. CS)\n & \" => \" & previous(J)(CS+1 .. previous(J)'Last));\n end loop;\n Ada.Text_IO.Put_Line(44 * '-');\n Ada.Text_IO.New_Line;\n end if;\n end;\n exit when found;\n end loop;\n if not found then\n Ada.Text_IO.Put_Line(\"You lost, sorry! The answer was: \" & answer);\n end if;\n end;\nend MasterMind;\n","language":"Ada"},{"code":"#!/usr/local/bin/apl -s -f --\n\n⍝ Define the alphabet\nA←'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\n\n⍝ Make ASCII values upper case\n∇n←AscUp c\n n←c-32×(c≥97)∧(c≤122)\n∇\n\n⍝ Does a list have repeated values?\n∇r←Rpts l\n r←(l⍳l)≢⍳⍴l\n∇\n\n⍝ Keyboard input using ⎕ and ⍞ doesn't work well using GNU APL in script mode,\n⍝ so you kind of have to write your own.\n⍝ Read a line of text from the keyboard\n∇l←ReadLine up;k;z;data\n data←'' ⋄ csr←0 ⍝ Start out with empty string and cursor at 0\n\n ⍝⍝⍝ Keyboard input\nin: k←1⎕fio[41]1 ⍝ Read byte from stdin\nhandle: →(k>127)/skip ⍝ Unicode is not supported (Wumpus doesn't need it)\n →(k∊8 127)/back ⍝ Handle backspace\n →(k=10)/done ⍝ Newline = Enter key pressed\n →(k<32)/in ⍝ For simplicity, disregard terminal control entirely\n\n k←(AscUp⍣up)k ⍝ Make key uppercase if necessary\n z←k⎕fio[42]0 ⍝ Echo key to stdout\n data←data,k ⍝ Insert key into data\n →in ⍝ Go get next key\n\n ⍝⍝⍝ Skip UTF-8 input (read until byte ≤ 127)\nskip: k←1⎕fio[41]1 ⋄ →(k>127)/skip ⋄ →handle\n\n ⍝⍝ Backspace\nback: →(0=⍴data)/in ⍝ If already at beginning, ignore\n z←k⎕fio[42]0 ⍝ Backspace to terminal\n data←¯1↓data ⍝ Remove character\n →in ⍝ Get next key\n\n ⍝⍝ We are done, return the line as text\ndone: l←⎕UCS data\n∇\n\n⍝ Read a positive number from the keyboard in the range [min...max]\n∇n←min ReadNum max;l;z\nin: l←ReadLine 0\n z←10⎕fio[42]0\n →(~l∧.∊'0123456789')/no\n →((min≤n)∧max≥n←⍎l)/0\nno: ⍞←'Please enter a number between ',(⍕min),' and ',(⍕max),': '\n →in\n∇\n\n⍝ Ask a numeric question\n∇n←q Question lim;min;max\n (min max)←lim\n ⍞←q,' [',(⍕min),'..',(⍕max),']? '\n n←min ReadNum max\n∇\n\n⍝ Read a choice from the keyboard\n∇c←Choice cs;ks;k;z\n ks←AscUp ⎕UCS ↑¨cs ⍝ User should press first letter of choice\nin: →(~(k←AscUp 1⎕fio[41]1)∊ks)/in ⍝ Wait for user to make choice\n z←(c←⊃cs[↑ks⍳k])⎕fio[42]0 ⍝ Select and output correspoinding choice\n∇\n\n⍝ Ask the user for game parameters\n∇parms←InitGame;clrs;len;gss;rpts\n ⎕←'∘∘∘ MASTERMIND ∘∘∘' ⋄ ⎕←''\n clrs←'How many colors' Question 2 20\n len←'Code length' Question 4 10\n gss←'Maximum amount of guesses' Question 7 20\n ⍞←'Allow repeated colors in code (Y/N)? '\n rpts←'Yes'≡Choice 'Yes' 'No'\n parms←clrs len gss rpts\n∇\n\n⍝ Generate a code.\n∇c←rpts MakeCode parms;clrs;len\n (clrs len)←parms\n c←A[(1+rpts)⊃(len?clrs)(?len/clrs)]\n∇\n\n⍝ Let user make a guess and handle errors\n∇g←parms Guess code;clrs;rpts;l;right;in\n (clrs rpts num)←parms\n\nguess: ⍞←'Guess ',(¯2↑⍕num),': ' ⋄ g←ReadLine 1 ⍝ Read a guess from the keyboard\n\n ⍝ Don't count obvously invalid input against the user\n →((⍴code)≢⍴g)/len ⍝ Length is wrong\n →(~g∧.∊A[⍳clrs])/inv ⍝ Invalid code in input\n →((~rpts)∧Rpts g)/rpt ⍝ No repeats allowed\n\n ⍝ Give feedback\n right←g=code ⍝ Colors in right position\n in←g∊code ⍝ Colors not in right position\n fb←(+/right)/'X' ⍝ X = amount of matching ones\n fb←fb,(+/in∧~right)/'O' ⍝ O = amount of non-matching ones\n fb←fb,(+/~in)/'-' ⍝ - = amount of colors not in code\n ⍞←' --→ ',fb,⎕UCS 10\n →0\nlen: ⎕←'Invalid length.' ⋄ →guess\ninv: ⎕←'Invalid color.' ⋄ →guess\nrpt: ⎕←'No repeats allowed.' ⋄ →guess\n∇\n\n⍝ Play the game\n∇ Mastermind;clrs;len;gsmax;rpts;code;gs\n ⎕rl←(2*32)|×/⎕ts ⍝ initialize random seed\n (clrs len gsmax rpts)←InitGame\n code←rpts MakeCode clrs len\n ⎕←2 0⍴''\n ⎕←'The code consists of: ',A[⍳clrs]\n gs←0\nloop: gs←gs+1\n →(gs>gsmax)/lose\n →(code≢(clrs rpts gs)Guess code)/loop\n ⎕←'○○○ Congratulations! ○○○'\n ⎕←'You won in ',(⍕gs),' guesses.'\n →0\nlose: ⎕←'Alas, you are out of guesses.'\n ⎕←'The code was: ',code\n∇\n\nMastermind\n)OFF\n","language":"APL"},{"code":"w := h := 32, maxRows := 10, numPegs := 8\nww := floor(w/2-2), hh := floor(h/2-2)\ngrid := [], dx := w*4.5\ngosub, Decode\n\nGui, Font, S18, Consolas\nloop, 4\n{\n\ti := A_Index-1\n\tGui, add, button, % \"x\" (Mod(i, 4)?\"+0\":\"30\") \" y\"\n\t\t\t\t\t.\t(Mod(i, 4)?\"10\" : \"10\") \" w\" w \" h\" h \" vGoal\" A_Index , ?\n}\n\nGui, Add, Text, % \"section x30 h1 0x1000 w\" w*6\nloop, % maxRows\n{\n\tGui, Font, S18, consolas\n\trow := maxRows - A_Index + 1\n\tloop 4\n\t{\n\t\tcol := A_Index, \ti:= col-1\n\t\tGui, add, button, % \"x\" (Mod(i, 4)?\"+0\":\"s\") \" y\" (Mod(i, 4)?\"p\":\"+2\")\n\t\t\t\t\t\t. \" w\" w \" h\" h \" vButton\" row \"_\" col \" gButton\"\n\t}\n\tGui, Font, S13, wingdings 2\n\tloop 2\n\t{\n\t\tcol := A_Index, \ti:= col-1\n\t\tGui, add, text, % \"x\" (Mod(i,2)?\"+1\":\"s+\" dx) \" y\" (Mod(i,2)?\"p\":\"p+1\")\n\t\t\t\t\t\t. \" w\" ww \" h\" hh \" vKeyPeg\" row \"_\" col, % Chr(167)\n\t}\n\tloop 2\n\t{\n\t\tcol := A_Index+2, \ti:= col-1\n\t\tGui, add, text, % \"x\" (Mod(i,2)?\"+1\":\"s+\" dx) \" y\" (Mod(i,2)?\"p\":\"+1\") \t\n\t\t\t\t\t\t. \" w\" ww \" h\" hh \" vKeyPeg\" row \"_\" col, % Chr(167)\n\t}\n\tGui, Add, Text, % \"section xs h1 0x1000 w\" w*6 \" y+4\"\n}\nGui, Font, S12, consolas\nGui, add, Button, % \"xs y+10 gSubmit w\" W*2 , Submit\nGui, add, Button, % \"x+0 gResetMM w\" W*2, Reset\nGui, add, Checkbox, % \"x+4 vNoDup\", No`nDuplicates\nGui, Font, S18\nfor i, v in pegs\n\tGui, add, Radio, % \"x\" (!Mod(i-1, 4)?\"10\":\"+10\") \" h\" h \" w\" w+20 \" vRadio\" A_Index, % v\nGui, show\nRow := 1\nreturn\n;-----------------------------------------------------------------------\nGuiClose:\nExitApp\nreturn\n;-----------------------------------------------------------------------\nDecode:\nGui, Submit, NoHide\npegs:=[], goal := [], usedPeg :=[]\npool := [\"😺\",\"🎃\",\"🧨\",\"⚽\",\"😀\",\"☠\",\"👽\",\"❄\",\"🙉\",\"💗\"\n\t,\"💥\",\"🖐\",\"🏈\",\"🎱\",\"👁\",\"🗨\",\"🤙\",\"👄\",\"🐶\",\"🐴\"\n\t,\"🦢\",\"🐍\",\"🐞\",\"💣\",\"🐪\",\"🐘\",\"🐰\",\"🐸\",\"🌴\",\"🏀\"]\n\nloop, % numPegs\n{\n\tRandom, rnd, 1, % pool.count()\n\tpegs[A_Index] := pool.RemoveAt(rnd)\n}\ni := 1\nwhile (goal.count()<4)\n{\n\tRandom, rnd, 1, % pegs.count()\n\tif (NoDup && usedPeg[pegs[rnd]])\n\t\tcontinue\n\tgoal[i++] := pegs[rnd]\n\tusedPeg[pegs[rnd]] := true\n}\nreturn\n;-----------------------------------------------------------------------\nButton:\nif GameEnd\n\treturn\n\nGui, Submit, NoHide\nRegExMatch(A_GuiControl, \"Button(\\d+)_(\\d+)\", m)\nif (m1 <> row)\n{\n\tthisPeg := Grid[m1, m2]\n\tfor i, v in pegs\n\t\tif (v=thisPeg)\n\t\t\tGuiControl,, Radio%i%, 1\n\tGuiControl,, % \"Button\" row \"_\" m2, % thisPeg\n\tGrid[row,m2] := thisPeg\n}\nelse\n{\n\tloop, % pegs.count()\n\t\tif Radio%A_Index%\n\t\t\tGuiControl,, % A_GuiControl , % grid[m1, m2] := pegs[A_Index]\n}\nreturn\n;-----------------------------------------------------------------------\nSubmit:\nif (grid[row].count()<4) || GameEnd\n\treturn\n\nGui, submit, NoHide\nAns := [], FIP := [], inGoal := []\nCIP := CNP := 0, KeyPeg := 1\n\nfor i, G in Goal\n\tinGoal[G] := (inGoal[G] ? inGoal[G] : 0) +1\t\t; save inGoal\nloop, 4\n\tAns[A_Index] := Grid[row, A_Index]\t\t\t; save Ans\nfor i, A in Ans\n\tif (goal[A_Index] = A)\n\t\tCIP++, FIP.push(i), inGoal[A]:=inGoal[A] -1\t; Correct In Place, inGoal--\nfor i, v in FIP\n\tAns.RemoveAt(v-i+1)\t\t\t\t\t; remove Correct In Place from Answers\nfor i, A in Ans\n\tif (inGoal[A] > 0)\n\t\tCNP++, inGoal[A] := inGoal[A] -1\t\t; Correct Not in Place\nloop % CIP\n\tGuiControl,, % \"KeyPeg\" row \"_\" KeyPeg++, % Chr(82)\t; \"✔\"\nloop % CNP\n\tGuiControl,, % \"KeyPeg\" row \"_\" KeyPeg++, % Chr(83)\t; \"X\"\n\nif (CIP=4 || row=maxRows)\n{\n\tloop 4\n\t\tGuiControl,, Goal%A_Index%, % Goal[A_Index]\n\tMsgBox % CIP = 4 ? \"You Win\" : \"You lose\"\n\tGameEnd := true\n}\nRow++\nreturn\n;-----------------------------------------------------------------------\nLAlt:: ; peak at solution (for troubleshooting purposes only!)\nloop 4\n\tGuiControl,, Goal%A_Index%, % Goal[A_Index]\nWhile GetKeyState(\"Lalt\", \"P\")\n\tcontinue\nloop 4\n\tGuiControl,, Goal%A_Index%, % \"?\"\nreturn\n;-----------------------------------------------------------------------\nResetMM:\nGrid :=[], GameEnd:= false\nloop, 4\n{\n\tRandom, rnd, 1, % pegs.count()\n\tgoal[A_Index] := pegs[rnd]\n\tGuiControl,, Goal%A_Index%, ?\n}\n\nloop, % maxRows\n{\n\trow := maxRows - A_Index + 1\n\tloop 4\n\t{\n\t\tcol := A_Index\n\t\tGuiControl,, % \"KeyPeg\" row \"_\" col, % Chr(167)\t; \"O\"\n\t\tGuiControl,, % \"Button\" row \"_\" col\n\t}\n}\ngosub Decode\nloop, 8\n\tGuiControl,, Radio%A_Index%, % pegs[A_Index]\nreturn\n;-----------------------------------------------------------------------\n","language":"AutoHotkey"},{"code":"#include <iostream>\n#include <algorithm>\n#include <ctime>\n#include <string>\n#include <vector>\n\ntypedef std::vector<char> vecChar;\n\nclass master {\npublic:\n master( size_t code_len, size_t clr_count, size_t guess_count, bool rpt ) {\n std::string color = \"ABCDEFGHIJKLMNOPQRST\";\n\n if( code_len < 4 ) code_len = 4; else if( code_len > 10 ) code_len = 10;\n if( !rpt && clr_count < code_len ) clr_count = code_len;\n if( clr_count < 2 ) clr_count = 2; else if( clr_count > 20 ) clr_count = 20;\n if( guess_count < 7 ) guess_count = 7; else if( guess_count > 20 ) guess_count = 20;\n\n codeLen = code_len; colorsCnt = clr_count; guessCnt = guess_count; repeatClr = rpt;\n\n for( size_t s = 0; s < colorsCnt; s++ ) {\n colors.append( 1, color.at( s ) );\n }\n }\n void play() {\n bool win = false;\n combo = getCombo();\n\n while( guessCnt ) {\n showBoard();\n if( checkInput( getInput() ) ) {\n win = true;\n break;\n }\n guessCnt--;\n }\n if( win ) {\n std::cout << \"\\n\\n--------------------------------\\n\" <<\n \"Very well done!\\nYou found the code: \" << combo <<\n \"\\n--------------------------------\\n\\n\";\n } else {\n std::cout << \"\\n\\n--------------------------------\\n\" <<\n \"I am sorry, you couldn't make it!\\nThe code was: \" << combo <<\n \"\\n--------------------------------\\n\\n\";\n }\n }\nprivate:\n void showBoard() {\n vecChar::iterator y;\n for( int x = 0; x < guesses.size(); x++ ) {\n std::cout << \"\\n--------------------------------\\n\";\n std::cout << x + 1 << \": \";\n for( y = guesses[x].begin(); y != guesses[x].end(); y++ ) {\n std::cout << *y << \" \";\n }\n\n std::cout << \" : \";\n for( y = results[x].begin(); y != results[x].end(); y++ ) {\n std::cout << *y << \" \";\n }\n\n int z = codeLen - results[x].size();\n if( z > 0 ) {\n for( int x = 0; x < z; x++ ) std::cout << \"- \";\n }\n }\n std::cout << \"\\n\\n\";\n }\n std::string getInput() {\n std::string a;\n while( true ) {\n std::cout << \"Enter your guess (\" << colors << \"): \";\n a = \"\"; std::cin >> a;\n std::transform( a.begin(), a.end(), a.begin(), ::toupper );\n if( a.length() > codeLen ) a.erase( codeLen );\n bool r = true;\n for( std::string::iterator x = a.begin(); x != a.end(); x++ ) {\n if( colors.find( *x ) == std::string::npos ) {\n r = false;\n break;\n }\n }\n if( r ) break;\n }\n return a;\n }\n bool checkInput( std::string a ) {\n vecChar g;\n for( std::string::iterator x = a.begin(); x != a.end(); x++ ) {\n g.push_back( *x );\n }\n guesses.push_back( g );\n\n int black = 0, white = 0;\n std::vector<bool> gmatch( codeLen, false );\n std::vector<bool> cmatch( codeLen, false );\n\n for( int i = 0; i < codeLen; i++ ) {\n if( a.at( i ) == combo.at( i ) ) {\n gmatch[i] = true;\n cmatch[i] = true;\n black++;\n }\n }\n\n for( int i = 0; i < codeLen; i++ ) {\n if (gmatch[i]) continue;\n for( int j = 0; j < codeLen; j++ ) {\n if (i == j || cmatch[j]) continue;\n if( a.at( i ) == combo.at( j ) ) {\n cmatch[j] = true;\n white++;\n break;\n }\n }\n }\n\n vecChar r;\n for( int b = 0; b < black; b++ ) r.push_back( 'X' );\n for( int w = 0; w < white; w++ ) r.push_back( 'O' );\n results.push_back( r );\n\n return ( black == codeLen );\n }\n std::string getCombo() {\n std::string c, clr = colors;\n int l, z;\n\n for( size_t s = 0; s < codeLen; s++ ) {\n z = rand() % ( int )clr.length();\n c.append( 1, clr[z] );\n if( !repeatClr ) clr.erase( z, 1 );\n }\n return c;\n }\n\n size_t codeLen, colorsCnt, guessCnt;\n bool repeatClr;\n std::vector<vecChar> guesses, results;\n std::string colors, combo;\n};\n\nint main( int argc, char* argv[] ) {\n srand( unsigned( time( 0 ) ) );\n master m( 4, 8, 12, false );\n m.play();\n return 0;\n}\n","language":"C++"},{"code":"col[] = [ 802 990 171 229 950 808 ]\nlen code[] 4\nlen guess[] 4\n#\nsubr init_vars\n row = 0\n.\nproc draw_rate r black white . .\n for j range0 2\n for c range0 2\n move c * 3.5 + 71.5 r * 11.5 + 9.4 - j * 3.5\n if black > 0\n color 000\n circle 1.4\n black -= 1\n elif white > 0\n color 999\n circle 1.4\n white -= 1\n else\n color 310\n circle 0.7\n .\n .\n .\n.\nproc show_code . .\n color 531\n move 22 92\n rect 46 8\n for i to 4\n move i * 8 + 20 97\n color col[code[i]]\n circle 2\n .\n.\nproc draw_guess . .\n for c to 4\n move c * 12 + 8 row * 11.5 + 7.5\n color col[guess[c]]\n circle 3.8\n .\n.\nproc next_row . .\n color 420\n linewidth 11\n move 17 row * 11.5 + 7.5\n line 60 row * 11.5 + 7.5\n draw_guess\n move 73.5 row * 11.5 + 7.5\n color 310\n circle 5.0\n color 753\n move 71.5 row * 11.5 + 5\n textsize 7\n text \"✓\"\n.\nproc rate . .\n move 73.5 row * 11.5 + 7.5\n color 531\n circle 5.2\n c[] = code[]\n g[] = guess[]\n for i to 4\n if c[i] = g[i]\n black += 1\n c[i] = -1\n g[i] = -2\n .\n .\n for i to 4\n for j to 4\n if c[i] = g[j]\n white += 1\n c[i] = -1\n g[j] = -2\n .\n .\n .\n draw_rate row black white\n color 531\n linewidth 12\n move 17 row * 11.5 + 7.5\n line 60 row * 11.5 + 7.5\n draw_guess\n row += 1\n if black = 4\n row = 8\n .\n if row = 8\n show_code\n timer 2\n else\n next_row\n .\n.\non timer\n row = -2\n.\nproc new . .\n init_vars\n for i to 4\n code[i] = randint 6\n .\n color 531\n move 10 10\n rect 70 80\n linewidth 10\n move 5 95\n line 5 5\n line 85 5\n line 85 95\n line 5 95\n color 310\n linewidth 7\n move 28 96.5\n line 58 96.5\n move 30 95\n color 864\n textsize 4\n text \"Mastermind\"\n color 310\n linewidth 0.5\n move 10 90\n line 10 4\n move 67 90\n line 67 4\n move 80 90\n line 80 4\n for r range0 8\n for c range0 4\n move c * 12 + 20 r * 11.5 + 7.5\n circle 2\n .\n draw_rate r 0 0\n .\n guess[1] = 1\n guess[2] = 1\n guess[3] = 2\n guess[4] = 2\n next_row\n.\nproc do_move . .\n c = (mouse_x - 15) div 12\n guess[c + 1] = guess[c + 1] mod 6 + 1\n draw_guess\n.\non mouse_down\n if row = -2\n new\n elif mouse_y > row * 11.5 + 0.5 and mouse_y < row * 11.5 + 10.5 and row < 8\n if mouse_x > 15 and mouse_x < 61\n do_move\n elif mouse_x > 67 and mouse_x < 80\n rate\n .\n .\n.\nnew\n","language":"EasyLang"},{"code":"'--- Declaration of global variables ---\nDim As String colors(1 To 4) => {\"A\", \"B\", \"C\", \"D\"}\nDim Shared As Integer nr, ub', numlet=4, lencod=4\nDim Shared As String*4 master, pz\nub = Ubound(colors)\nnr = 0\n\n'--- SUBroutines and FUNCtions ---\nSub Encabezado\n Dim As String dup\n Color 11: Print \"Welcome to Mastermind\"\n Print \"=====================\" + Chr(13) + Chr(10) : Color 15\n Print \"You will need to guess a random code.\"\n Print \"For each guess, you will receive a hint:\"\n Print \"X - denotes a correct letter,\"\n Print \"O - denotes a letter in the original\"\n Print \" string but a different position.\"\n Print \"You have 12 attempts.\"\n Print \"Duplicates are not allowed.\" + Chr(10)\n Print \"Good luck!\" + Chr(10) + Chr(10) : Color 7\nEnd Sub\n\nSub showresult(test() As String, place1 As Byte, place2 As Byte, place3 As Byte)\n Dim As Integer r, n1, n2, n3\n Print Using \"##: \"; nr;\n For r = 1 To Ubound(test)\n Print test(r);\n Next R\n Print \" : \";\n For n1 = 1 To place1\n Print \"X\"; \" \";\n Next N1\n For n2 = 1 To place2\n Print \"O\"; \" \";\n Next N2\n For n3 = 1 To place3\n Print \"-\"; \" \";\n Next N3\n Print : Print\nEnd Sub\n\nSub Inicio\n Dim As Integer mind(ub), rands(ub)\n Dim As Integer n, aleat\n Dim As Boolean repeat = false\n\n For n = 1 To ub\n While true\n aleat = (Rnd * (ub-1)) + 1\n If rands(aleat) <> 1 Then\n mind(n) = aleat\n rands(aleat) = 1\n Exit While\n End If\n Wend\n Next n\n\n For n = 1 To ub\n Mid(master,n,1) = Chr(64 + mind(n))\n pz &= Chr(64 + mind(n))\n Next n\nEnd Sub\n\n\n'--- Main Program ---\nRandomize Timer\nCls\nDim As Integer guesses = 12\nEncabezado\nInicio\nColor 15: Print pz : Color 7\nDo\n Dim As Integer n, p, d, x, posic\n Dim As Integer places(1 To 2), place1, place2, place3\n Dim As String*4 testbegin\n Dim As String test(ub), mastertemp, tmp\n Dim As Boolean flag = True\n\n For p = 1 To Ubound(places)\n places(p) = 0\n Next p\n nr += 1\n Input \"Your guess (ABCD)? \" , testbegin\n For d = 1 To Ubound(test)\n test(d) = Mid(testbegin,d,1)\n Next d\n\n For n = 1 To Ubound(test)\n If Ucase(test(n)) <> Mid(master,n,1) Then flag = False\n Next n\n If flag = True Then\n Color 10: Print !\"\\nWell done! You guess correctly.\" : Sleep : Exit Do\n Else\n For x = 1 To Len(master)\n If Ucase(test(x)) = Mid(master,x,1) Then places(1) += 1\n Next x\n mastertemp = master\n For p = 1 To Ubound(test)\n posic = Instr(mastertemp, Ucase(test(p)))\n If posic > 0 Then\n tmp = mastertemp\n mastertemp = Left(tmp,posic-1) + Mid(tmp, posic+1, Len(tmp)-1)\n places(2) += 1\n End If\n Next p\n End If\n place1 = places(1)\n place2 = places(2) - place1\n place3 = Len(master) - (place1 + place2)\n showresult(test(), place1, place2, place3)\nLoop Until nr = guesses\nColor 14: Print \"The correct combination was: \"; pz\nColor 7: Print !\"\\nEnd of game\"\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n\t\"errors\"\n\t\"flag\"\n\t\"fmt\"\n\t\"log\"\n\t\"math/rand\"\n\t\"strings\"\n\t\"time\"\n)\n\nfunc main() {\n\tlog.SetPrefix(\"mastermind: \")\n\tlog.SetFlags(0)\n\tcolours := flag.Int(\"colours\", 6, \"number of colours to use (2-20)\")\n\tflag.IntVar(colours, \"colors\", 6, \"alias for colours\")\n\tholes := flag.Int(\"holes\", 4, \"number of holes (the code length, 4-10)\")\n\tguesses := flag.Int(\"guesses\", 12, \"number of guesses allowed (7-20)\")\n\tunique := flag.Bool(\"unique\", false, \"disallow duplicate colours in the code\")\n\tflag.Parse()\n\n\trand.Seed(time.Now().UnixNano())\n\tm, err := NewMastermind(*colours, *holes, *guesses, *unique)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\terr = m.Play()\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n}\n\ntype mastermind struct {\n\tcolours int\n\tholes int\n\tguesses int\n\tunique bool\n\n\tcode string\n\tpast []string // history of guesses\n\tscores []string // history of scores\n}\n\nfunc NewMastermind(colours, holes, guesses int, unique bool) (*mastermind, error) {\n\tif colours < 2 || colours > 20 {\n\t\treturn nil, errors.New(\"colours must be between 2 and 20 inclusive\")\n\t}\n\tif holes < 4 || holes > 10 {\n\t\treturn nil, errors.New(\"holes must be between 4 and 10 inclusive\")\n\t}\n\tif guesses < 7 || guesses > 20 {\n\t\treturn nil, errors.New(\"guesses must be between 7 and 20 inclusive\")\n\t}\n\tif unique && holes > colours {\n\t\treturn nil, errors.New(\"holes must be > colours when using unique\")\n\t}\n\n\treturn &mastermind{\n\t\tcolours: colours,\n\t\tholes: holes,\n\t\tguesses: guesses,\n\t\tunique: unique,\n\t\tpast: make([]string, 0, guesses),\n\t\tscores: make([]string, 0, guesses),\n\t}, nil\n}\n\nfunc (m *mastermind) Play() error {\n\tm.generateCode()\n\tfmt.Printf(\"A set of %s has been selected as the code.\\n\", m.describeCode(m.unique))\n\tfmt.Printf(\"You have %d guesses.\\n\", m.guesses)\n\tfor len(m.past) < m.guesses {\n\t\tguess, err := m.inputGuess()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tfmt.Println()\n\t\tm.past = append(m.past, guess)\n\t\tstr, won := m.scoreString(m.score(guess))\n\t\tif won {\n\t\t\tplural := \"es\"\n\t\t\tif len(m.past) == 1 {\n\t\t\t\tplural = \"\"\n\t\t\t}\n\t\t\tfmt.Printf(\"You found the code in %d guess%s.\\n\", len(m.past), plural)\n\t\t\treturn nil\n\t\t}\n\t\tm.scores = append(m.scores, str)\n\t\tm.printHistory()\n\t\tfmt.Println()\n\t}\n\tfmt.Printf(\"You are out of guesses. The code was %s.\\n\", m.code)\n\treturn nil\n}\n\nconst charset = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nconst blacks = \"XXXXXXXXXX\"\nconst whites = \"OOOOOOOOOO\"\nconst nones = \"----------\"\n\nfunc (m *mastermind) describeCode(unique bool) string {\n\tustr := \"\"\n\tif unique {\n\t\tustr = \" unique\"\n\t}\n\treturn fmt.Sprintf(\"%d%s letters (from 'A' to %q)\",\n\t\tm.holes, ustr, charset[m.colours-1],\n\t)\n}\n\nfunc (m *mastermind) printHistory() {\n\tfor i, g := range m.past {\n\t\tfmt.Printf(\"-----%s---%[1]s--\\n\", nones[:m.holes])\n\t\tfmt.Printf(\"%2d: %s : %s\\n\", i+1, g, m.scores[i])\n\t}\n}\n\nfunc (m *mastermind) generateCode() {\n\tcode := make([]byte, m.holes)\n\tif m.unique {\n\t\tp := rand.Perm(m.colours)\n\t\tfor i := range code {\n\t\t\tcode[i] = charset[p[i]]\n\t\t}\n\t} else {\n\t\tfor i := range code {\n\t\t\tcode[i] = charset[rand.Intn(m.colours)]\n\t\t}\n\t}\n\tm.code = string(code)\n\t//log.Printf(\"code is %q\", m.code)\n}\n\nfunc (m *mastermind) inputGuess() (string, error) {\n\tvar input string\n\tfor {\n\t\tfmt.Printf(\"Enter guess #%d: \", len(m.past)+1)\n\t\tif _, err := fmt.Scanln(&input); err != nil {\n\t\t\treturn \"\", err\n\t\t}\n\t\tinput = strings.ToUpper(strings.TrimSpace(input))\n\t\tif m.validGuess(input) {\n\t\t\treturn input, nil\n\t\t}\n\t\tfmt.Printf(\"A guess must consist of %s.\\n\", m.describeCode(false))\n\t}\n}\n\nfunc (m *mastermind) validGuess(input string) bool {\n\tif len(input) != m.holes {\n\t\treturn false\n\t}\n\tfor i := 0; i < len(input); i++ {\n\t\tc := input[i]\n\t\tif c < 'A' || c > charset[m.colours-1] {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\nfunc (m *mastermind) score(guess string) (black, white int) {\n\tscored := make([]bool, m.holes)\n\tfor i := 0; i < len(guess); i++ {\n\t\tif guess[i] == m.code[i] {\n\t\t\tblack++\n\t\t\tscored[i] = true\n\t\t}\n\t}\n\tfor i := 0; i < len(guess); i++ {\n\t\tif guess[i] == m.code[i] {\n\t\t\tcontinue\n\t\t}\n\t\tfor j := 0; j < len(m.code); j++ {\n\t\t\tif i != j && !scored[j] && guess[i] == m.code[j] {\n\t\t\t\twhite++\n\t\t\t\tscored[j] = true\n\t\t\t}\n\t\t}\n\t}\n\treturn\n}\n\nfunc (m *mastermind) scoreString(black, white int) (string, bool) {\n\tnone := m.holes - black - white\n\treturn blacks[:black] + whites[:white] + nones[:none], black == m.holes\n}\n","language":"Go"},{"code":"import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\nimport java.util.Scanner;\nimport java.util.concurrent.ThreadLocalRandom;\n\npublic final class MastermindTask {\n\n\tpublic static void main(String[] aArgs) {\n\t Mastermind mastermind = new Mastermind(4, 8, 12, false);\n\t mastermind.play();\n\t}\n\t\n\tprivate static final class Mastermind {\n\t\t\n\t public Mastermind(int aCodeLength, int aLetterCount, int aGuessCount, boolean aRepeatLetters) {\n\t if ( aCodeLength < 4 ) {\n\t \taCodeLength = 4;\n\t } else if ( aCodeLength > 10 ) {\n\t \taCodeLength = 10;\n\t }\n\t\n\t if ( aLetterCount < 2 ) {\n\t \taLetterCount = 2;\n\t } else if ( aLetterCount > 20 ) {\n\t \taLetterCount = 20;\n\t }\n\t\n\t if ( aGuessCount < 7 ) {\n\t \taGuessCount = 7;\n\t } else if ( aGuessCount > 20 ) {\n\t \taGuessCount = 20;\n\t }\t\n\t\n\t if ( ! aRepeatLetters && aLetterCount < aCodeLength ) {\n\t \taLetterCount = aCodeLength;\n\t }\n\t\n\t codeLength = aCodeLength;\n\t letterCount = aLetterCount;\n\t guessCount = aGuessCount;\n\t repeatLetters = aRepeatLetters;\n\n\t String validLetters = \"ABCDEFGHIJKLMNOPQRST\";\n\t letters = \"\";\n\t for ( int i = 0; i < letterCount; i++ ) {\n\t letters += validLetters.charAt(i);\n\t }\n\t }\n\t\n\t public void play() {\n\t boolean playerWin = false;\n\t goal = createGoal();\n\n\t while ( guessCount > 0 && ! playerWin ) {\n\t showBoard();\n\t if ( checkUserInput(obtainUserGuess()) ) {\n\t playerWin = true;\n\t reader.close();\n\t }\n\t guessCount--;\n\t }\n\t\n\t if ( playerWin ) {\n\t System.out.println(newLine + newLine + \"--------------------------------\" + newLine +\n\t \"Very well done! \" + newLine + \"You found the code: \" + goal +\n\t newLine + \"--------------------------------\" + newLine + newLine);\n\t } else {\n\t System.out.println(newLine + newLine + \"--------------------------------\" + newLine +\n\t \"I'm sorry, you couldn't make it! \" + newLine + \"The code was: \" + goal +\n\t newLine + \"--------------------------------\" + newLine + newLine);\n\t }\n\t }\n\t\n\t private void showBoard() {\n\t for ( int i = 0; i < guesses.size(); i++ ) {\n\t System.out.print(newLine + \"--------------------------------\" + newLine);\n\t System.out.print(( i + 1 ) + \": \");\n\t for ( char ch : guesses.get(i) ) {\n\t System.out.print(ch + \" \");\n\t }\n\n\t System.out.print(\" : \");\n\t for ( char ch : results.get(i) ) {\n\t System.out.print(ch + \" \");\n\t }\n\n\t final int errorCount = codeLength - results.get(i).size();\n for ( int j = 0; j < errorCount; j++ ) {\n \tSystem.out.print(\"- \");\n }\n\t }\n\t System.out.print(newLine + newLine);\n\t }\t\n\t\n\t private String obtainUserGuess() {\n\t String result = \"\";\n\t do {\n\t \tSystem.out.print(\"Enter your guess (\" + letters + \"): \");\t\n\t \tresult = reader.nextLine().toUpperCase();\n\t \tif ( result.length() != codeLength ) {\n\t \t\tSystem.out.println(\"Please try again, your guess should have \" + codeLength + \" letters\");\n\t \t}\t \t\n\t } while ( result.length() != codeLength );\t\n\t return result;\n\t }\n\t\n\t private boolean checkUserInput(String aUserInput) {\n\t List<Character> userInputCharacters = new ArrayList<Character>();\n\t for ( char ch : aUserInput.toCharArray() ) {\n\t userInputCharacters.add(ch);\n\t }\n\t guesses.add(userInputCharacters);\n\t\n\t int xCount = 0;\n\t int oCount = 0;\n\t List<Boolean> fullMatches = new ArrayList<Boolean>(Collections.nCopies(codeLength, false));\n\t List<Boolean> partialMatches = new ArrayList<Boolean>(Collections.nCopies(codeLength, false));\n\t\n\t for ( int i = 0; i < codeLength; i++ ) {\n\t if ( aUserInput.charAt(i) == goal.charAt(i) ) {\n\t fullMatches.set(i, true);\n\t partialMatches.set(i, true);\n\t xCount++;\n\t }\n\t }\n\t\n\t for ( int i = 0; i < codeLength; i++ ) {\n\t if ( fullMatches.get(i) ) {\n\t \tcontinue;\n\t }\n\t for ( int j = 0; j < codeLength; j++ ) {\n\t if ( i == j || partialMatches.get(j) ) {\n\t \tcontinue;\n\t }\n\t if ( aUserInput.charAt(i) == goal.charAt(j) ) {\n\t partialMatches.set(j, true);\n\t oCount++;\n\t break;\n\t }\n\t }\n\t }\n\t\n\t List<Character> nextResult = new ArrayList<Character>();\n\t for ( int i = 0; i < xCount; i++ ) {\n\t \tnextResult.add('X');\n\t }\n\t for ( int i = 0; i < oCount; i++ ) {\n\t \tnextResult.add('O');\n\t }\n\t results.add(nextResult);\n\n\t return xCount == codeLength;\n\t }\n\t\n\t private String createGoal() {\n\t String result = \"\";\n\t String lettersCopy = letters;\n\n\t for ( int i = 0; i < codeLength; i++ ) {\n\t final int index = random.nextInt(lettersCopy.length());\n\t result += lettersCopy.charAt(index);\n\t if ( ! repeatLetters ) {\n\t \tlettersCopy = lettersCopy.substring(0, index) + lettersCopy.substring(index + 1);\n\t }\n\t }\n\t return result;\n\t }\n\t\n\t private int codeLength, letterCount, guessCount;\n\t private String letters, goal;\n\t private boolean repeatLetters;\n\t private Scanner reader = new Scanner(System.in);\n\t private List<List<Character>> guesses = new ArrayList<List<Character>>();\n\t private List<List<Character>> results = new ArrayList<List<Character>>(); \t\n\t\n\t private final ThreadLocalRandom random = ThreadLocalRandom.current();\n\t private final String newLine = System.lineSeparator();\n\t\n\t}\n\n}\n","language":"Java"},{"code":"class Mastermind {\n constructor() {\n this.colorsCnt;\n this.rptColors;\n this.codeLen;\n this.guessCnt;\n this.guesses;\n this.code;\n this.selected;\n this.game_over;\n this.clear = (el) => {\n while (el.hasChildNodes()) {\n el.removeChild(el.firstChild);\n }\n };\n this.colors = [\"🤡\", \"👹\", \"👺\", \"👻\", \"👽\", \"👾\", \"🤖\", \"🐵\", \"🐭\",\n \"🐸\", \"🎃\", \"🤠\", \"☠️\", \"🦄\", \"🦇\", \"🛸\", \"🎅\", \"👿\", \"🐲\", \"🦋\"\n ];\n }\n\n newGame() {\n this.selected = null;\n this.guessCnt = parseInt(document.getElementById(\"gssCnt\").value);\n this.colorsCnt = parseInt(document.getElementById(\"clrCnt\").value);\n this.codeLen = parseInt(document.getElementById(\"codeLen\").value);\n if (this.codeLen > this.colorsCnt) {\n document.getElementById(\"rptClr\").selectedIndex = 1;\n }\n this.rptColors = document.getElementById(\"rptClr\").value === \"yes\";\n this.guesses = 0;\n this.game_over = false;\n const go = document.getElementById(\"gameover\");\n go.innerText = \"\";\n go.style.visibility = \"hidden\";\n this.clear(document.getElementById(\"code\"));\n this.buildPalette();\n this.buildPlayField();\n }\n\n buildPalette() {\n const pal = document.getElementById(\"palette\"),\n z = this.colorsCnt / 5,\n h = Math.floor(z) != z ? Math.floor(z) + 1 : z;\n this.clear(pal);\n pal.style.height = `${44 * h + 3 * h}px`;\n const clrs = [];\n for (let c = 0; c < this.colorsCnt; c++) {\n clrs.push(c);\n const b = document.createElement(\"div\");\n b.className = \"bucket\";\n b.clr = c;\n b.innerText = this.colors[c];\n b.addEventListener(\"click\", () => {\n this.palClick(b);\n });\n pal.appendChild(b);\n }\n this.code = [];\n while (this.code.length < this.codeLen) {\n const r = Math.floor(Math.random() * clrs.length);\n this.code.push(clrs[r]);\n if (!this.rptColors) {\n clrs.splice(r, 1);\n }\n }\n }\n\n buildPlayField() {\n const brd = document.getElementById(\"board\");\n this.clear(brd);\n const w = 49 * this.codeLen + 7 * this.codeLen + 5;\n brd.active = 0;\n brd.style.width = `${w}px`;\n document.querySelector(\".column\").style.width = `${w + 20}px`;\n this.addGuessLine(brd);\n }\n\n addGuessLine(brd) {\n const z = document.createElement(\"div\");\n z.style.clear = \"both\";\n brd.appendChild(z);\n brd.active += 10;\n for (let c = 0; c < this.codeLen; c++) {\n const d = document.createElement(\"div\");\n d.className = \"bucket\";\n d.id = `brd${brd.active+ c}`;\n d.clr = -1;\n d.addEventListener(\"click\", () => {\n this.playClick(d);\n })\n brd.appendChild(d);\n }\n }\n\n palClick(bucket) {\n if (this.game_over) return;\n if (null === this.selected) {\n bucket.classList.add(\"selected\");\n this.selected = bucket;\n return;\n }\n if (this.selected !== bucket) {\n this.selected.classList.remove(\"selected\");\n bucket.classList.add(\"selected\");\n this.selected = bucket;\n return;\n }\n this.selected.classList.remove(\"selected\");\n this.selected = null;\n }\n\n vibrate() {\n const brd = document.getElementById(\"board\");\n let timerCnt = 0;\n const exp = setInterval(() => {\n if ((timerCnt++) > 60) {\n clearInterval(exp);\n brd.style.top = \"0px\";\n brd.style.left = \"0px\";\n }\n let x = Math.random() * 4,\n y = Math.random() * 4;\n if (Math.random() < .5) x = -x;\n if (Math.random() < .5) y = -y;\n brd.style.top = y + \"px\";\n brd.style.left = x + \"px\";\n }, 10);\n }\n\n playClick(bucket) {\n if (this.game_over) return;\n if (this.selected) {\n bucket.innerText = this.selected.innerText;\n bucket.clr = this.selected.clr;\n } else {\n this.vibrate();\n }\n }\n\n check() {\n if (this.game_over) return;\n let code = [];\n const brd = document.getElementById(\"board\");\n for (let b = 0; b < this.codeLen; b++) {\n const h = document.getElementById(`brd${brd.active + b}`).clr;\n if (h < 0) {\n this.vibrate();\n return;\n }\n code.push(h);\n }\n this.guesses++;\n if (this.compareCode(code)) {\n this.gameOver(true);\n return;\n }\n if (this.guesses >= this.guessCnt) {\n this.gameOver(false);\n return;\n }\n this.addGuessLine(brd);\n }\n\n compareCode(code) {\n let black = 0,\n white = 0,\n b_match = new Array(this.codeLen).fill(false),\n w_match = new Array(this.codeLen).fill(false);\n for (let i = 0; i < this.codeLen; i++) {\n if (code[i] === this.code[i]) {\n b_match[i] = true;\n w_match[i] = true;\n black++;\n }\n }\n for (let i = 0; i < this.codeLen; i++) {\n if (b_match[i]) continue;\n for (let j = 0; j < this.codeLen; j++) {\n if (i == j || w_match[j]) continue;\n if (code[i] === this.code[j]) {\n w_match[j] = true;\n white++;\n break;\n }\n }\n }\n const brd = document.getElementById(\"board\");\n let d;\n for (let i = 0; i < black; i++) {\n d = document.createElement(\"div\");\n d.className = \"pin\";\n d.style.backgroundColor = \"#a00\";\n brd.appendChild(d);\n }\n for (let i = 0; i < white; i++) {\n d = document.createElement(\"div\");\n d.className = \"pin\";\n d.style.backgroundColor = \"#eee\";\n brd.appendChild(d);\n }\n return (black == this.codeLen);\n }\n\n gameOver(win) {\n if (this.game_over) return;\n this.game_over = true;\n const cd = document.getElementById(\"code\");\n for (let c = 0; c < this.codeLen; c++) {\n const d = document.createElement(\"div\");\n d.className = \"bucket\";\n d.innerText = this.colors[this.code[c]];\n cd.appendChild(d);\n }\n const go = document.getElementById(\"gameover\");\n go.style.visibility = \"visible\";\n go.innerText = win ? \"GREAT!\" : \"YOU FAILED!\";\n const i = setInterval(() => {\n go.style.visibility = \"hidden\";\n clearInterval(i);\n }, 3000);\n }\n}\nconst mm = new Mastermind();\ndocument.getElementById(\"newGame\").addEventListener(\"click\", () => {\n mm.newGame()\n});\ndocument.getElementById(\"giveUp\").addEventListener(\"click\", () => {\n mm.gameOver();\n});\ndocument.getElementById(\"check\").addEventListener(\"click\", () => {\n mm.check()\n});\n","language":"JavaScript"},{"code":"using Gtk, Colors, Cairo, Graphics\n\nstruct Guess\n code::Vector{Color}\n guess::Vector{Color}\n hint::Vector{Color}\nend\n\nfunction Guess(code, guess)\n len = length(code)\n hints = fill(colorant\"gray\", len) # gray default\n for (i, g) in enumerate(guess), (j, c) in enumerate(code)\n if g == c\n if i == j\n hints[i] = colorant\"black\"\n elseif hints[i] != colorant\"black\"\n hints[i] = colorant\"white\"\n end\n end\n end\n g = Guess([c for c in code], [c for c in guess], [c for c in hints])\nend\n\ntovec(guess) = [x for x in [guess.code; guess.guess; guess.hint]]\n\nfunction mastermindapp()\n allu(s) = length(unique(s)) == length(s)\n ccode(c, n, rok) = while true a = rand(c, n); if rok || allu(a) return a end end\n\n numcolors, codelength, maxguesses, allowrep, gameover = 10, 4, 10, false, false\n colors = distinguishable_colors(numcolors)\n code = ccode(colors, numcolors, allowrep)\n guesshistory = Vector{Guess}()\n\n win = GtkWindow(\"Mastermind Game\", 900, 750) |> (GtkFrame() |> (box = GtkBox(:v)))\n settingsbox = GtkBox(:h)\n playtoolbar = GtkToolbar()\n\n setcolors = GtkScale(false, 4:20)\n set_gtk_property!(setcolors, :hexpand, true)\n adj = GtkAdjustment(setcolors)\n set_gtk_property!(adj, :value, 10)\n clabel = GtkLabel(\"Number of Colors\")\n\n setcodelength = GtkScale(false, 4:10)\n set_gtk_property!(setcodelength, :hexpand, true)\n adj = GtkAdjustment(setcodelength)\n set_gtk_property!(adj, :value, 4)\n slabel = GtkLabel(\"Code Length\")\n\n setnumguesses = GtkScale(false, 4:40)\n set_gtk_property!(setnumguesses, :hexpand, true)\n adj = GtkAdjustment(setnumguesses)\n set_gtk_property!(adj, :value, 10)\n nlabel = GtkLabel(\"Max Guesses\")\n\n allowrepeatcolor = GtkScale(false, 0:1)\n set_gtk_property!(allowrepeatcolor, :hexpand, true)\n rlabel = GtkLabel(\"Allow Repeated Colors (0 = No)\")\n\n newgame = GtkToolButton(\"New Game\")\n set_gtk_property!(newgame, :label, \"New Game\")\n set_gtk_property!(newgame, :is_important, true)\n\n tryguess = GtkToolButton(\"Submit Current Guess\")\n set_gtk_property!(tryguess, :label, \"Submit Current Guess\")\n set_gtk_property!(tryguess, :is_important, true)\n\n eraselast = GtkToolButton(\"Erase Last (Unsubmitted) Pick\")\n set_gtk_property!(eraselast, :label, \"Erase Last (Unsubmitted) Pick\")\n set_gtk_property!(eraselast, :is_important, true)\n\n map(w->push!(settingsbox, w),[clabel, setcolors, slabel, setcodelength,\n nlabel, setnumguesses, rlabel, allowrepeatcolor])\n map(w->push!(playtoolbar, w),[newgame, tryguess, eraselast])\n\n scrwin = GtkScrolledWindow()\n can = GtkCanvas()\n set_gtk_property!(can, :expand, true)\n map(w -> push!(box, w),[settingsbox, playtoolbar, scrwin])\n push!(scrwin, can)\n\n currentguess = RGB[]\n guessesused = 0\n colorpositions = Point[]\n\n function newgame!(w)\n empty!(guesshistory)\n\n numcolors = Int(GAccessor.value(setcolors))\n codelength = Int(GAccessor.value(setcodelength))\n maxguesses = Int(GAccessor.value(setnumguesses))\n allowrep = Int(GAccessor.value(allowrepeatcolor))\n\n colors = distinguishable_colors(numcolors)\n code = ccode(colors, codelength, allowrep == 1)\n empty!(currentguess)\n currentneeded = codelength\n guessesused = 0\n gameover = false\n draw(can)\n end\n signal_connect(newgame!, newgame, :clicked)\n\n function saywon!()\n warn_dialog(\"You have WON the game!\", win)\n gameover = true\n end\n\n function outofguesses!()\n warn_dialog(\"You have Run out of moves! Game over.\", win)\n gameover = true\n end\n\n can.mouse.button1press = @guarded (widget, event) -> begin\n if !gameover && (i = findfirst(p ->\n sqrt((p.x - event.x)^2 + (p.y - event.y)^2) < 20,\n colorpositions)) != nothing\n if length(currentguess) < codelength\n if allowrep == 0 && !allu(currentguess)\n warn_dialog(\"Please erase the duplicate color.\", win)\n else\n push!(currentguess, colors[i])\n draw(can)\n end\n else\n warn_dialog(\"You need to submit this guess if ready.\", win)\n end\n end\n end\n\n @guarded draw(can) do widget\n ctx = Gtk.getgc(can)\n select_font_face(ctx, \"Courier\", Cairo.FONT_SLANT_NORMAL, Cairo.FONT_WEIGHT_BOLD)\n fontpointsize = 12\n set_font_size(ctx, fontpointsize)\n workcolor = colorant\"black\"\n set_source(ctx, workcolor)\n move_to(ctx, 0, fontpointsize)\n show_text(ctx, \"Color options: \" * \"-\"^70)\n stroke(ctx)\n empty!(colorpositions)\n for i in 1:numcolors\n set_source(ctx, colors[i])\n circle(ctx, i * 40, 40, 20)\n push!(colorpositions, Point(i * 40, 40))\n fill(ctx)\n end\n set_gtk_property!(can, :expand, false) # kludge for good text overwriting\n move_to(ctx, 0, 80)\n set_source(ctx, workcolor)\n show_text(ctx, string(maxguesses - guessesused, pad = 2) * \" moves remaining.\")\n stroke(ctx)\n set_gtk_property!(can, :expand, true)\n for i in 1:codelength\n set_source(ctx, i > length(currentguess) ? colorant\"lightgray\" : currentguess[i])\n circle(ctx, i * 40, 110, 20)\n fill(ctx)\n end\n if length(guesshistory) > 0\n move_to(ctx, 0, 155)\n set_source(ctx, workcolor)\n show_text(ctx, \"Past Guesses: \" * \"-\"^70)\n for (i, g) in enumerate(guesshistory), (j, c) in enumerate(tovec(g)[codelength+1:end])\n x = j * 40 + (j > codelength ? 20 : 0)\n y = 150 + 40 * i\n set_source(ctx, c)\n circle(ctx, x, y, 20)\n fill(ctx)\n end\n end\n Gtk.showall(win)\n end\n\n function submitguess!(w)\n if length(currentguess) == length(code)\n g = Guess(code, currentguess)\n push!(guesshistory, g)\n empty!(currentguess)\n guessesused += 1\n draw(can)\n if all(i -> g.code[i] == g.guess[i], 1:length(code))\n saywon!()\n elseif guessesused > maxguesses\n outofguesses!()\n end\n end\n end\n signal_connect(submitguess!, tryguess, :clicked)\n\n function undolast!(w)\n if length(currentguess) > 0\n pop!(currentguess)\n draw(can)\n end\n end\n signal_connect(undolast!, eraselast, :clicked)\n\n newgame!(win)\n Gtk.showall(win)\n\n condition = Condition()\n endit(w) = notify(condition)\n signal_connect(endit, win, :destroy)\n showall(win)\n wait(condition)\nend\n\nmastermindapp()\n","language":"Julia"},{"code":"// version 1.2.51\n\nimport java.util.Random\n\nval rand = Random()\n\nclass Mastermind {\n private val codeLen: Int\n private val colorsCnt: Int\n private var guessCnt = 0\n private val repeatClr: Boolean\n\n private val colors: String\n private var combo = \"\"\n\n private val guesses = mutableListOf<CharArray>()\n private val results = mutableListOf<CharArray>()\n\n constructor(codeLen: Int, colorsCnt: Int, guessCnt: Int, repeatClr: Boolean) {\n val color = \"ABCDEFGHIJKLMNOPQRST\"\n this.codeLen = codeLen.coerceIn(4, 10)\n var cl = colorsCnt\n if (!repeatClr && cl < this.codeLen) cl = this.codeLen\n this.colorsCnt = cl.coerceIn(2, 20)\n this.guessCnt = guessCnt.coerceIn(7, 20)\n this.repeatClr = repeatClr\n this.colors = color.take(this.colorsCnt)\n }\n\n fun play() {\n var win = false\n combo = getCombo()\n while (guessCnt != 0) {\n showBoard()\n if (checkInput(getInput())) {\n win = true\n break\n }\n guessCnt--\n }\n println(\"\\n\\n--------------------------------\")\n if (win) {\n println(\"Very well done!\\nYou found the code: $combo\")\n }\n else {\n println(\"I am sorry, you couldn't make it!\\nThe code was: $combo\")\n }\n println(\"--------------------------------\\n\")\n }\n\n private fun showBoard() {\n for (x in 0 until guesses.size) {\n println(\"\\n--------------------------------\")\n print(\"${x + 1}: \")\n for (y in guesses[x]) print(\"$y \")\n print(\" : \")\n for (y in results[x]) print(\"$y \")\n val z = codeLen - results[x].size\n if (z > 0) print(\"- \".repeat(z))\n }\n println(\"\\n\")\n }\n\n private fun getInput(): String {\n while (true) {\n print(\"Enter your guess ($colors): \")\n val a = readLine()!!.toUpperCase().take(codeLen)\n if (a.all { it in colors } ) return a\n }\n }\n\n private fun checkInput(a: String): Boolean {\n guesses.add(a.toCharArray())\n var black = 0\n var white = 0\n val gmatch = BooleanArray(codeLen)\n val cmatch = BooleanArray(codeLen)\n for (i in 0 until codeLen) {\n if (a[i] == combo[i]) {\n gmatch[i] = true\n cmatch[i] = true\n black++\n }\n }\n for (i in 0 until codeLen) {\n if (gmatch[i]) continue\n for (j in 0 until codeLen) {\n if (i == j || cmatch[j]) continue\n if (a[i] == combo[j]) {\n cmatch[j] = true\n white++\n break\n }\n }\n }\n val r = mutableListOf<Char>()\n r.addAll(\"X\".repeat(black).toList())\n r.addAll(\"O\".repeat(white).toList())\n results.add(r.toCharArray())\n return black == codeLen\n }\n\n private fun getCombo(): String {\n val c = StringBuilder()\n val clr = StringBuilder(colors)\n for (s in 0 until codeLen) {\n val z = rand.nextInt(clr.length)\n c.append(clr[z])\n if (!repeatClr) clr.deleteCharAt(z)\n }\n return c.toString()\n }\n}\n\nfun main(args: Array<String>) {\n val m = Mastermind(4, 8, 12, false)\n m.play()\n}\n","language":"Kotlin"},{"code":"math.randomseed( os.time() )\nlocal black, white, none, code = \"X\", \"O\", \"-\"\nlocal colors, codeLen, maxGuess, rept, alpha, opt = 6, 4, 10, false, \"ABCDEFGHIJKLMNOPQRST\", \"\"\nlocal guesses, results\nfunction createCode()\n code = \"\"\n local dic, a = \"\"\n for i = 1, colors do\n dic = dic .. alpha:sub( i, i )\n end\n for i = 1, codeLen do\n a = math.floor( math.random( 1, #dic ) )\n code = code .. dic:sub( a, a )\n if not rept then\n dic = dic:sub(1, a - 1 ) .. dic:sub( a + 1, #dic )\n end\n end\nend\nfunction checkInput( inp )\n table.insert( guesses, inp )\n local b, w, fnd, str = 0, 0, {}, \"\"\n for bl = 1, codeLen do\n if inp:sub( bl, bl ) == code:sub( bl, bl ) then\n b = b + 1; fnd[bl] = true\n else\n for wh = 1, codeLen do\n if nil == fnd[bl] and wh ~= bl and inp:sub( wh, wh ) == code:sub( bl, bl ) then\n w = w + 1; fnd[bl] = true\n end\n end\n end\n end\n for i = 1, b do str = str .. string.format( \"%s \", black ) end\n for i = 1, w do str = str .. string.format( \"%s \", white ) end\n for i = 1, 2 * codeLen - #str, 2 do str = str .. string.format( \"%s \", none ) end\n table.insert( results, str )\n return b == codeLen\nend\nfunction play()\n local err, win, r = true, false;\n for j = 1, colors do opt = opt .. alpha:sub( j, j ) end\n while( true ) do\n createCode(); guesses, results = {}, {}\n for i = 1, maxGuess do\n err = true;\n while( err ) do\n io.write( string.format( \"\\n-------------------------------\\nYour guess (%s)?\", opt ) )\n inp = io.read():upper();\n if #inp == codeLen then\n err = false;\n for k = 1, #inp do\n if( nil == opt:find( inp:sub( k, k ) ) ) then\n err = true;\n break;\n end\n end\n end\n end\n if( checkInput( inp ) ) then win = true; break\n else\n for l = 1, #guesses do\n print( string.format( \"%.2d: %s : %s\", l, guesses[l], results[l] ) )\n end\n end\n end\n if win then print( \"\\nWell done!\" )\n else print( string.format( \"\\nSorry, you did not crack the code --> %s!\", code ) )\n end\n io.write( \"Play again( Y/N )? \" ); r = io.read()\n if r ~= \"Y\" and r ~= \"y\" then break end\n end\nend\n--[[ entry point ]]---\nif arg[1] ~= nil and tonumber( arg[1] ) > 1 and tonumber( arg[1] ) < 21 then colors = tonumber( arg[1] ) end\nif arg[2] ~= nil and tonumber( arg[2] ) > 3 and tonumber( arg[2] ) < 11 then codeLen = tonumber( arg[2] ) end\nif arg[3] ~= nil and tonumber( arg[3] ) > 6 and tonumber( arg[3] ) < 21 then maxGuess = tonumber( arg[3] ) end\nif arg[4] ~= nil and arg[4] == \"true\" or arg[4] == \"false\" then rept = ( arg[4] == \"true\" ) end\nplay()\n","language":"Lua"},{"code":"import random, sequtils, strformat, strutils\n\nproc encode(correct, guess: string): string =\n result.setlen(correct.len)\n for i in 0..correct.high:\n result[i] = if correct[i] == guess[i]: 'X' else: (if guess[i] in correct: 'O' else: '-')\n result.join(\" \")\n\nproc safeIntInput(prompt: string; minVal, maxVal: Positive): int =\n while true:\n stdout.write prompt\n let userInput = stdin.readLine()\n result = try: parseInt(userInput)\n except ValueError: continue\n if result in minVal..maxVal:\n return\n\n\nproc playGame() =\n\n echo \"You will need to guess a random code.\"\n echo \"For each guess, you will receive a hint.\"\n echo \"In this hint, X denotes a correct letter, \" &\n \"and O a letter in the original string but in a different position.\"\n echo \"\"\n\n let numLetters = safeIntInput(\"Select a number of possible letters for the code (2-20): \", 2, 20)\n let codeLength = safeIntInput(\"Select a length for the code (4-10): \", 4, 10)\n let letters = \"ABCDEFGHIJKLMNOPQRST\"[0..<numLetters]\n let code = newSeqWith(codeLength, letters.sample()).join()\n var guesses: seq[string]\n\n while true:\n echo \"\"\n stdout.write &\"Enter a guess of length {codeLength} ({letters}): \"\n let guess = stdin.readLine().toUpperAscii().strip()\n if guess.len != codeLength or guess.anyIt(it notin letters):\n continue\n elif guess == code:\n echo &\"\\nYour guess {guess} was correct!\"\n break\n else:\n guesses.add &\"{guesses.len + 1}: {guess.join(\\\" \\\")} => {encode(code, guess)}\"\n for guess in guesses:\n echo \"------------------------------------\"\n echo guess\n echo \"------------------------------------\"\n\n\nrandomize()\nplayGame()\n","language":"Nim"},{"code":"use List::Util qw(any);\n\nprint 'Enter pool size, puzzle size, attempts allowed: ';\n($pool,$length,$tries) = split /\\s+/, <>;\n$length = 4 if $length eq '' or $length < 3 or $length > 11;\n$pool = 6 if $pool eq '' or $pool < 2 or $pool > 21;\n$tries = 10 if $tries eq '' or $tries < 7 or $tries > 21;\n\n@valid = sort { -1 + 2*int(rand 2) } ('A' .. 'T')[0..$pool-1];\n@puzzle = @valid[0..$length-1];\n\n$black = '●';\n$white = '○';\n\nwhile () {\n header();\n print \"$_\\n\" for @guesses;\n lose() if @guesses == $tries;\n @guess = get_guess();\n next unless is_valid(@guess);\n $score = score(\\@puzzle, \\@guess);\n win() if $score eq join ' ', ($black) x $length;\n push @guesses, join(' ', @guess) . ' :: ' . $score;\n}\n\nsub score {\n local *puzzle = shift;\n local *guess = shift;\n my @score;\n for $i (0..$length-1) {\n if ( $puzzle[$i] eq $guess[$i]) { push @score, $black }\n elsif (any {$puzzle[$i] eq $_} @guess) { push @score, $white }\n else { push @score, '-' }\n }\n join ' ', reverse sort @score;\n}\n\nsub header {\n $num = $tries - @guesses;\n print \"Valid letter, but wrong position: ○ - Correct letter and position: ●\\n\";\n print \"Guess the $length element sequence containing the letters \" . join(', ', sort @valid) . \"\\n\";\n printf \"Repeats are not allowed. You have $num guess%s remaining\\n\", $num > 1 ? 'es' : '';\n}\n\nsub get_guess { print 'Your guess?: '; $g = <>; return split /\\s*/, uc $g }\n\nsub is_valid { $length == @_ }\n\nsub win { print 'You win! The correct answer is: ' . join(' ',@puzzle) . \"\\n\"; exit }\n\nsub lose { print 'Too bad, you ran out of guesses. The solution was: ' . join(' ',@puzzle) . \"\\n\"; exit }\n","language":"Perl"},{"code":"-- demo/rosetta/mastermind.exw\nconstant SET_LIMIT = 1_000_000 -- above this, it uses random sampling.\n\nconstant help_text = \"\"\"\nThe game of mastermind, with a Knuth solver.\n\nSpecify the number of colours (1..20), the code length (1..10), the\nnumber of guesses allowed (1-20), and whether colours can be repeated\n(auto-ticked & greyed-out inactive when length>colours).\n\nNote that at the highest settings there are 10,240,000,000,000 possible\nanswers: the (order n squared) analysis of that is simply not practical,\nas indeed is simply building the initial list of all possible answers,\nand therefore a fixed limit of 1,000,000 has been applied, which also\njust about manages to keep the program responsive. Obviously, should the\nactual answer not be among those samples, it cannot possibly find it,\nand it will tell you in plain english when that occurs. You can always\ntrim the search space back to something more reasonable at any time, and\nstill play the game when that limit is breached, with weaker hints.\n\nConversely the lowest settings do not make for an interesting game, but\nproved quite useful when ironing out some bugs, so were left in.\n\nThe Use button (disabled until something useful found) allows you to\ntake the best found (so far), displayed at the top of the colours frame.\nObviously \"1/1 (100%)\" means that it has deduced the correct answer.\nBelow that the colours frame shows all available colours, which can be\nindividually clicked in any order.\n\nPress Delete or click on the last peg (in the left-hand game frame)\nto remove it, before the last one is placed, however once full your\nturn is immediately scored and cannot be undone.\n\nNew Game, Help, and Exit buttons are assumed to be self-explanatory.\nChanging the option settings implicitly triggers a new game, except\nfor the number of permitted guesses, pre-game-over. Reducing the\nnumber of guesses can also be used as a means of conceding.\n\nWhen a correct guess is entered or all guesses have been used the hint\nand colours are replaced with \"GAME OVER - YOU WIN/LOSE\" under the\nactual answer.\n\"\"\"\ninclude pGUI.e\n\nIhandle dlg, colours, codelen, maxgoes, repeats, progress,\n usehint, game_canvas, colour_canvas\ninteger ncolours, ncodelen, nmaxgoes\nbool brepeats\n\nsequence secret = {},\n hint = {},\n guesses = {{}},\n scores = {}\n--\n-- note: while the game is ongoing, length(guesses) should always be\n-- length(scores)+1; equal lengths is equivalent to game over.\n--\n\nfunction get_score(sequence guess, goal)\ninteger blacks = 0, -- (right colour & place)\n whites = 0 -- (\"\" but wrong place)\n for i=1 to length(guess) do\n if guess[i]=goal[i] then\n blacks += 1\n guess[i] = ' '\n goal[i] = ' '\n end if\n end for\n for i=1 to length(guess) do\n if guess[i]!=' ' then\n integer k = find(guess[i],goal)\n if k then\n whites += 1\n goal[k] = ' '\n end if\n end if\n end for\n return {blacks, whites}\nend function\n\nfunction random_set()\n-- create the secret code, and/or (when rqd) a SET_LIMIT random sample\n sequence cset = tagset(ncolours),\n res = repeat(0,ncodelen)\n for i=1 to ncodelen do\n integer c = rand(length(cset))\n res[i] = cset[c]\n if not brepeats then\n cset[c..c] = {}\n end if\n end for\n return res\nend function\n\nsequence initial_set\natom is_len, -- logically length(initial_set), except when > SET_LIMIT.\n excluded -- initialset[1..excluded-1], are not, [excluded..$] are.\n\nprocedure create_initial_set()\n is_len = iff(brepeats?power(ncolours,ncodelen):k_perm(ncolours,ncodelen))\n if is_len<=SET_LIMIT then\n --\n -- generate the full set\n --\n initial_set = repeat(0,is_len)\n excluded = is_len+1 -- (ie none)\n sequence next = iff(brepeats?repeat(1,ncodelen):tagset(ncodelen))\n for i=1 to is_len do\n initial_set[i] = next\n for ndx=length(next) to 1 by -1 do\n integer n = next[ndx]\n while n<=ncolours do\n n += 1\n if brepeats\n-- or not find(n,next[1..ndx-1]) then\n or not find(n,next) then --(see below)\n exit\n end if\n end while\n next[ndx] = n\n if n<=ncolours then\n if not brepeats then\n --\n -- Fill in the rest lowest-first, eg\n -- in the 4 colours and 4 holes case:\n -- (start) (above) (this)\n -- {1,2,3,4} --> {1,2,4,_} --> {1,2,4,3}\n -- {1,2,4,3} --> {1,3,_,_} --> {1,3,2,4}\n -- ... (20 other cases omitted)\n -- {4,3,1,2} --> {4,3,2,_} --> {4,3,2,1}\n --\n -- (probably sub-optimal, but insignificant\n -- vs. the o(n^2) analysis which follows.)\n --\n for j=ndx+1 to length(next) do\n for k=1 to ncolours do\n-- if not find(k,next[1..j-1]) then\n if not find(k,next) then --(see below)\n next[j] = k\n exit\n end if\n end for\n end for\n end if\n exit\n end if\n --\n -- technical note: if not brepeats, we are going to\n -- replace all next[ndx..$] later/above anyway, but\n -- replacing with 0 means we can avoid those slices.\n -- The next three all work: 1 is perfect for the\n -- brepeats=true case, but brepeats=false needs the\n -- above slices, while the 2nd & 3rd are equivalent\n -- the latter is obviously somewhat faster, at the\n -- cost of a wtf?!, without a comment such as this.\n --\n-- next[ndx] = 1\n-- next[ndx] = iff(brepeats?1:0)\n next[ndx] = brepeats -- (equivalent)\n end for\n end for\n else\n --\n -- generate SET_LIMIT random codes\n -- note that if (as is quite likely) the actual answer is\n -- not present in initial_set, then obviously it cannot\n -- possibly find it!\n --\n initial_set = repeat(0,SET_LIMIT)\n excluded = SET_LIMIT+1 -- (ie none)\n for i=1 to SET_LIMIT do\n initial_set[i] = random_set()\n end for\n end if\nend procedure\n\natom done, is_done, best\n\nfunction idle_action()\n atom to_do = excluded-1,\n t1 = time()+1\n string samp = iff(is_len=length(initial_set)?\"\":sprintf(\" samples of %,d\",{is_len}))\n for i=1 to 100000 do -- reasonable slice of work\n done += 1\n is_done += (done<excluded)\n sequence guest = initial_set[done],\n scores = {}, counts = {}\n if not find(guest,guesses) then\n for j=1 to excluded-1 do\n sequence s = get_score(guest,initial_set[j])\n integer k = find(s,scores)\n if k=0 then\n scores = append(scores,s)\n counts = append(counts,1)\n else\n counts[k] += 1\n end if\n end for\n if length(counts)=0 then\n IupSetStrAttribute(progress,\"TITLE\",\"[answer not in %,d%s]\",{SET_LIMIT,samp})\n return IUP_IGNORE -- (stop idle)\n end if\n integer k = largest(counts,return_index:=true),\n ck = counts[k]\n if ck<best then\n best = ck\n hint = guest\n IupSetInt(usehint,\"ACTIVE\",true)\n IupUpdate(colour_canvas)\n end if\n end if\n\n if done=length(initial_set) then\n IupSetStrAttribute(progress,\"TITLE\",\"%,d/%,d%s (100%%)\",{is_done,to_do,samp})\n return IUP_IGNORE -- (stop idle)\n end if\n if time()>t1 then exit end if\n end for\n IupSetStrAttribute(progress,\"TITLE\",\"%,d/%,d%s (%d%%)\",{is_done,to_do,samp,100*(is_done/to_do)})\n return IUP_DEFAULT\nend function\nconstant idle_action_cb = Icallback(\"idle_action\")\n\nprocedure start_idle()\n done = 0\n is_done = 0\n best = length(initial_set)+1\n IupSetGlobalFunction(\"IDLE_ACTION\",idle_action_cb)\nend procedure\n\nprocedure new_game()\n ncolours = IupGetInt(colours,\"VALUE\")\n ncodelen = IupGetInt(codelen,\"VALUE\")\n nmaxgoes = IupGetInt(maxgoes,\"VALUE\")\n brepeats = IupGetInt(repeats,\"VALUE\")\n secret = random_set()\n guesses = {{}}\n scores = {}\n hint = {}\n create_initial_set()\n start_idle()\nend procedure\n\nconstant colour_table = {#e6194b, -- Red\n #3cb44b, -- Green\n #ffe119, -- Yellow\n #4363d8, -- Blue\n #f58231, -- Orange\n #911eb4, -- Purple\n #42d4f4, -- Cyan\n #f032e6, -- Magenta\n #bfef45, -- Lime\n #fabebe, -- Pink\n #469990, -- Teal\n #e6beff, -- Lavender\n #9A6324, -- Brown\n #fffac8, -- Beige\n #800000, -- Maroon\n #aaffc3, -- Mint\n #808000, -- Olive\n #ffd8b1, -- Apricot\n #000075, -- Navy\n #a9a9a9} -- Grey\n\n-- saved in redraw_cb(), for click testing in button_cb():\nsequence last_guess = {},\n colour_centres = {}\ninteger guess_r2 = 0,\n colour_r2 = 0\n\nfunction redraw_cb(Ihandle ih, integer /*posx*/, integer /*posy*/)\n Ihandle frame = IupGetParent(ih)\n string title = IupGetAttribute(ih,\"TITLE\")\n if not find(title,{\"Game\",\"Colours\"}) then ?9/0 end if\n integer {cw,ch} = IupGetIntInt(ih, \"DRAWSIZE\")\n\n cdCanvas cddbuffer = IupGetAttributePtr(ih,\"DBUFFER\")\n IupGLMakeCurrent(ih)\n cdCanvasActivate(cddbuffer)\n cdCanvasClear(cddbuffer)\n\n if title=\"Game\" then\n integer mx = min(floor(cw/(ncodelen*1.5+0.5)),floor(ch/(nmaxgoes+1))),\n diameter = floor(mx/2),\n px = floor((cw-(ncodelen*1.5+0.5)*mx)/2), -- (set margin)\n cy = ch, cx, c, r\n last_guess = {}\n for g=1 to length(guesses) do\n cy -= mx\n cx = px+floor(mx/2)\n for i=1 to 2*ncodelen+1 do\n if i!=ncodelen+1 then\n if i<=ncodelen then\n if i<=length(guesses[g]) then\n c = colour_table[guesses[g][i]]\n if g=length(guesses) then\n last_guess = {{cx,ch-cy}}\n end if\n else\n c = CD_GREY\n end if\n r = diameter\n else\n c = CD_GREY\n if g<=length(scores) then\n integer k = i-ncodelen-1,\n {b,w} = scores[g]\n c = iff(k<=b ? CD_BLACK : iff(k<=b+w ? CD_WHITE : CD_GREY))\n end if\n r = floor(diameter*0.5)\n end if\n cdCanvasSetForeground(cddbuffer,c)\n cdCanvasSector(cddbuffer, cx, cy, r, r, 0, 360)\n cdCanvasSetForeground(cddbuffer,CD_DARK_GREY)\n cdCanvasCircle(cddbuffer, cx, cy, r)\n end if\n cx += iff(i<ncodelen?mx:floor(mx/2))\n end for\n end for\n guess_r2 = floor(diameter*diameter/4)\n elsif title=\"Colours\" then\n integer mx = min(floor(cw/ncodelen),floor(ch/2)),\n r = floor(mx/2),\n px = floor((cw-ncodelen*mx)/2), -- (set margin)\n cy = ch-r, cx, c\n cx = px+floor(mx/2)\n bool active = length(hint)>0\n if length(scores)=nmaxgoes then\n hint = secret\n active = true\n end if\n for i=1 to ncodelen do\n c = iff(active?colour_table[hint[i]]:CD_GREY)\n cdCanvasSetForeground(cddbuffer,c)\n cdCanvasSector(cddbuffer, cx, cy, r, r, 0, 360)\n cdCanvasSetForeground(cddbuffer,CD_DARK_GREY)\n cdCanvasCircle(cddbuffer, cx, cy, r)\n cx += mx\n end for\n if length(scores)=nmaxgoes\n or guesses[$]=secret then\n ch -= floor(mx/2)\n {} = cdCanvasTextAlignment(cddbuffer, CD_CENTER)\n string wl = iff(guesses[$]=secret?\"WIN\":\"LOSE\"),\n msg = sprintf(\"GAME OVER - YOU %s\",{wl})\n cdCanvasText(cddbuffer, cw/2, ch/2, msg)\n else\n integer ch0 = ch\n ch -= mx\n --\n -- calculate the best nw*nh way to fit all the colours in:\n -- (if nw ends up = ncodelen there is no clear separation\n -- between the hint and the colour table; the start with\n -- ncodelen+1 solves that and looks pretty good to me.)\n --\n integer nw = ncodelen+1, -- (as above)\n nh = 1\n while nw*nh<ncolours do\n if (cw/(nw+1))>(ch/(nh+1)) then\n nw += 1\n else\n nh += 1\n end if\n end while\n --\n -- now draw all the colours\n --\n mx = min(floor(cw/nw),floor(ch/nh))\n r = floor(mx/2)\n px = floor((cw-nw*mx)/2)\n cx = px+floor(mx/2)\n cy = ch-r\n integer this_row = 0\n colour_centres = repeat(0,ncolours)\n colour_r2 = floor(r*r/4)\n for i=1 to ncolours do\n colour_centres[i] = {cx,ch0-cy}\n c = colour_table[i]\n cdCanvasSetForeground(cddbuffer,c)\n cdCanvasSector(cddbuffer, cx, cy, r, r, 0, 360)\n cdCanvasSetForeground(cddbuffer,CD_DARK_GREY)\n cdCanvasCircle(cddbuffer, cx, cy, r)\n cx += mx\n this_row += 1\n if this_row>=nw then\n this_row = 0\n cx = px + floor(mx/2)\n cy -= mx\n end if\n end for\n end if\n end if\n cdCanvasFlush(cddbuffer)\n return IUP_DEFAULT\nend function\n\nfunction map_cb(Ihandle ih)\n IupGLMakeCurrent(ih)\n atom res = IupGetDouble(NULL, \"SCREENDPI\")/25.4\n cdCanvas cddbuffer = cdCreateCanvas(CD_GL, \"10x10 %g\", {res})\n IupSetAttributePtr(ih,\"DBUFFER\",cddbuffer)\n cdCanvasSetBackground(cddbuffer, CD_PARCHMENT)\n return IUP_DEFAULT\nend function\n\nfunction canvas_resize_cb(Ihandle canvas)\n cdCanvas cddbuffer = IupGetAttributePtr(canvas,\"DBUFFER\")\n integer {canvas_width, canvas_height} = IupGetIntInt(canvas, \"DRAWSIZE\")\n atom res = IupGetDouble(NULL, \"SCREENDPI\")/25.4\n cdCanvasSetAttribute(cddbuffer, \"SIZE\", \"%dx%d %g\", {canvas_width, canvas_height, res})\n return IUP_DEFAULT\nend function\n\nprocedure redraw_all()\n IupUpdate({game_canvas,colour_canvas})\nend procedure\n\nprocedure undo_move()\n-- Called from button_cb and from K_DEL, but latter may be invalid.\n if length(guesses[$])!=0 then\n guesses[$] = guesses[$][1..$-1]\n redraw_all()\n end if\nend procedure\n\nprocedure add_move(integer i)\n if i!=0 then\n guesses[$] &= i\n end if\n if length(guesses[$])=ncodelen then\n sequence guest = guesses[$],\n score = get_score(guest,secret)\n scores = append(scores,score)\n if score!={ncodelen,0} -- (not all black==game over)\n and length(guesses)<nmaxgoes then\n for i=excluded-1 to 1 by -1 do\n sequence isi = initial_set[i]\n if get_score(guest,isi)!=score then\n excluded -= 1\n if excluded!=i then\n initial_set[i] = initial_set[excluded]\n initial_set[excluded] = isi -- (swap)\n end if\n end if\n end for\n guesses = append(guesses,{})\n hint = {}\n IupSetAttribute(progress,\"TITLE\",\"-\")\n IupSetInt(usehint,\"ACTIVE\",false)\n start_idle()\n end if\n end if\n redraw_all()\nend procedure\n\nfunction usehint_cb(Ihandle /*usehint*/)\n guesses[$] = hint\n add_move(0)\n return IUP_DEFAULT\nend function\n\nfunction button_cb(Ihandle canvas, integer button, pressed, x, y, atom /*pStatus*/)\n Ihandle frame = IupGetParent(canvas)\n string title = IupGetAttribute(frame,\"TITLE\")\n if not find(title,{\"Game\",\"Colours\"}) then ?9/0 end if\n if button=IUP_BUTTON1 and not pressed then -- (left button released)\n {sequence centres, integer r2} = iff(title=\"Game\"?{last_guess,guess_r2}\n :{colour_centres,colour_r2})\n for i=1 to length(centres) do\n integer {cx,cy} = sq_sub(centres[i],{x,y})\n if (cx*cx+cy*cy)<=r2 then\n if title=\"Game\" then\n undo_move()\n else\n add_move(i)\n end if\n exit\n end if\n end for\n end if\n return IUP_CONTINUE\nend function\n\nfunction new_game_cb(Ihandle /*ih*/)\n new_game()\n redraw_all()\n return IUP_DEFAULT\nend function\n\nfunction exit_cb(Ihandle /*ih*/)\n return IUP_CLOSE\nend function\nconstant cb_exit = Icallback(\"exit_cb\")\n\nfunction help_cb(Ihandln /*ih*/)\n IupMessage(\"Mastermind\",help_text)\n return IUP_DEFAULT\nend function\n\nfunction key_cb(Ihandle /*dlg*/, atom c)\n if c=K_ESC then return IUP_CLOSE end if\n if c=K_F1 then return help_cb(NULL) end if\n if find(c,{K_DEL,K_BS}) then undo_move() end if\n return IUP_CONTINUE\nend function\n\nfunction valuechanged_cb(Ihandle ih)\n ncolours = IupGetInt(colours,\"VALUE\")\n ncodelen = IupGetInt(codelen,\"VALUE\")\n nmaxgoes = IupGetInt(maxgoes,\"VALUE\")\n IupSetInt(repeats,\"ACTIVE\",ncodelen<=ncolours)\n if ncodelen>ncolours then\n IupSetInt(repeats,\"VALUE\",true)\n end if\n brepeats = IupGetInt(repeats,\"VALUE\")\n if ih!=maxgoes\n or length(scores)=length(guesses) then -- (game over)\n new_game()\n elsif nmaxgoes<=length(scores) then\n -- (signal/force game over state)\n guesses = guesses[1..length(scores)]\n end if\n redraw_all()\n return IUP_DEFAULT\nend function\nconstant cb_valuechanged = Icallback(\"valuechanged_cb\")\n\nprocedure main()\n IupOpen()\n\n colours = IupText(\"SPIN=Yes, SPINMIN=1, SPINMAX=20, VALUE=6, RASTERSIZE=34x\")\n codelen = IupText(\"SPIN=Yes, SPINMIN=1, SPINMAX=10, VALUE=4, RASTERSIZE=34x\")\n maxgoes = IupText(\"SPIN=Yes, SPINMIN=1, SPINMAX=20, VALUE=7, RASTERSIZE=34x\")\n repeats = IupToggle(\"Repeatable?\",\"VALUE=YES, RIGHTBUTTON=YES, PADDING=5x4\")\n progress = IupLabel(\"-\",\"EXPAND=HORIZONTAL, PADDING=5x4\")\n usehint = IupButton(\"Use\",Icallback(\"usehint_cb\"),\"PADDING=5x4, ACTIVE=NO\")\n game_canvas = IupGLCanvas(\"RASTERSIZE=200x\")\n colour_canvas = IupGLCanvas(\"RASTERSIZE=x200\")\n Ihandle newgame = IupButton(\"New Game\",Icallback(\"new_game_cb\"),\"PADDING=5x4\"),\n help = IupButton(\"Help (F1)\",Icallback(\"help_cb\"),\"PADDING=5x4\"),\n quit = IupButton(\"E&xit\",Icallback(\"exit_cb\"),\"PADDING=5x4\"),\n vbox = IupVbox({IupHbox({IupLabel(\"Colours (1-20)\",\"PADDING=5x4\"),colours}),\n IupHbox({IupLabel(\"Code Length (1-10)\",\"PADDING=5x4\"),codelen}),\n IupHbox({IupLabel(\"Guesses (1-20)\",\"PADDING=5x4\"),maxgoes}),\n IupHbox({repeats},\"MARGIN=10x5\"),\n IupHbox({progress}),\n IupHbox({usehint,newgame,help,quit})},\"MARGIN=5x5\"),\n game_frame = IupFrame(IupHbox({game_canvas},\"MARGIN=3x3\"),\"TITLE=Game\"),\n option_frame = IupFrame(vbox,\"TITLE=Options\"),\n colour_frame = IupFrame(colour_canvas,\"TITLE=Colours\"),\n full = IupHbox({game_frame,IupVbox({option_frame,colour_frame})})\n IupSetCallbacks({colours,codelen,maxgoes,repeats}, {\"VALUECHANGED_CB\", cb_valuechanged})\n IupSetCallbacks({game_canvas,colour_canvas}, {\"ACTION\", Icallback(\"redraw_cb\"),\n \"MAP_CB\", Icallback(\"map_cb\"),\n \"RESIZE_CB\", Icallback(\"canvas_resize_cb\"),\n \"BUTTON_CB\", Icallback(\"button_cb\")})\n dlg = IupDialog(IupHbox({full},\"MARGIN=3x3\"),\"TITLE=Mastermind\")\n IupSetCallback(dlg, \"K_ANY\", Icallback(\"key_cb\"))\n IupSetAttributeHandle(dlg,\"DEFAULTENTER\", usehint)\n\n new_game()\n\n IupShowXY(dlg,IUP_CENTER,IUP_CENTER)\n IupSetAttribute(dlg, \"RASTERSIZE\", NULL)\n IupSetStrAttribute(dlg, \"MINSIZE\", IupGetAttribute(dlg,\"RASTERSIZE\"))\n IupMainLoop()\n IupClose()\nend procedure\nmain()\n","language":"Phix"},{"code":"mastermind :- mastermind(7, 4, 8, no_duplicates).\n\nmastermind(Colours, Length, Guesses, Duplicates) :-\n\tbetween(2, 20, Colours),\n\tbetween(4, 10, Length),\n\tbetween(7, 20, Guesses),\n\tmember(Duplicates, [allow_duplicates, no_duplicates]),\n\n\tcreate_board(Colours, Length, Duplicates, Board),\n\tintro(Colours, Length, Duplicates),\n\tplay(board(Board, Length, Colours, Guesses), [], 0), !.\n\nintro(Colours, Length, Duplicates) :-\n\tformat('Guess the code!~n'),\n\tformat('There are ~p character types, and ~p letters to guess~n',\n\t [Colours, Length]),\n\tDuplicates = allow_duplicates\n\t-> format('Duplicates are allowed~n~n')\n\t; format('Duplicates are not allowed~n~n').\n\n/* Create the combination to be guessed */\ncreate_board(Colours, Length, Duplicates, Board) :-\n\tlength(Board, Length),\n\tvalid_char_list(Colours, CharSet),\n\trepeat,\n\tmaplist(random_alpha(CharSet), Board),\n\tcheck_for_duplicates(Board, Duplicates).\n\ncheck_for_duplicates(_, allow_dupicates).\ncheck_for_duplicates(Board, no_duplicates) :- is_set(Board).\n\n/* Main loop - get the player guess and print out status */\nplay(board(Board,_,_,MaxGuesses), _, MaxGuesses) :-\n\twrite('Sorry, You failed to guess in time...!\\nThe code was : '),\n\tmaplist(write, Board),\n\tnl.\nplay(BoardData, PrevGuesses, GuessNum) :-\n\tBoardData = board(_, Length, Colours, MaxGuesses),\n\tGuessNum < MaxGuesses,\n\tReportedGuess is GuessNum + 1,\n\tformat('Guess #~p of #~p: ', [ReportedGuess, MaxGuesses]),\n\tget_player_guess(Length, Colours, Guess),\n\tevaluate_and_print_result(BoardData, PrevGuesses, ReportedGuess, Guess).\n\nevaluate_and_print_result(board(Board,_,_,_), _, _,Board) :-\n\tformat('Well done! You Guessed Correctly.~n').\nevaluate_and_print_result(BoardData, PrevGuesses, NextGuessNum, Guess) :-\n\tBoardData = board(Board, _, _, _),\n\tdif(Board, Guess),\n\tmatch_guess_to_board(Board, Guess, Diffs),\n\tappend(PrevGuesses, [guess(NextGuessNum, Guess, Diffs)], Guesses),\n\tmaplist(print_guess, Guesses),\n\tplay(BoardData, Guesses, NextGuessNum).\n\n/* Get the player guess and validate that it matches the rules */\nget_player_guess(Length, Colours, Guess) :-\n\trepeat,\n\tread_line_to_string(user_input, Line),\n\tstring_chars(Line, Guess),\n\n\t% validate the correct number of items have been entered\n\tlength(Guess, Length),\n\n\t% validate that all the characters are valid for the number of colours\n\tvalid_char_list(Colours, ValidCharSet),\n\tsubset(Guess, ValidCharSet).\n\n/* Predicates to figure out how many places are correct */\nmatch_guess_to_board(Board, Guess, Matches) :-\n\tmaplist(guess_differences(Board), Board, Guess, Differences),\n\tsort(0, @>=, Differences, Matches).\n\n% Same position, same type\nguess_differences(_Board, B, B, 'X').\n% Same type, different position\nguess_differences(Board, B, G, 'O') :- dif(B, G), member(G, Board).\n% Type not on board\nguess_differences(Board, B, G, '-') :- dif(B, G), \\+ member(G, Board).\n\n/* Print out the current progress */\nprint_guess(guess(NextGuessNumber, Guess, Differences))\t:-\n\tformat('~w: ', NextGuessNumber),\n\tmaplist(format('~w '), Guess),\n\tformat(' : '),\n\tmaplist(format('~w '), Differences),\n\tnl.\n\n/* Utils */\nalpha_chars([a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t]).\n\nvalid_char_list(Colours, CharSet) :-\n\talpha_chars(AllChars),\n\ttruncate_list(AllChars, Colours, CharSet).\n\nrandom_alpha(AllChars, RandomMember) :- random_member(RandomMember, AllChars).\n\ntruncate_list(_, 0, []).\ntruncate_list([A|T], N, [A|R]) :-\n\tN > 0,\n\tN1 is N - 1,\n\ttruncate_list(T, N1, R).\n","language":"Prolog"},{"code":"import random\n\n\ndef encode(correct, guess):\n output_arr = [''] * len(correct)\n\n for i, (correct_char, guess_char) in enumerate(zip(correct, guess)):\n output_arr[i] = 'X' if guess_char == correct_char else 'O' if guess_char in correct else '-'\n\n return ''.join(output_arr)\n\n\ndef safe_int_input(prompt, min_val, max_val):\n while True:\n user_input = input(prompt)\n\n try:\n user_input = int(user_input)\n except ValueError:\n continue\n\n if min_val <= user_input <= max_val:\n return user_input\n\n\ndef play_game():\n print(\"Welcome to Mastermind.\")\n print(\"You will need to guess a random code.\")\n print(\"For each guess, you will receive a hint.\")\n print(\"In this hint, X denotes a correct letter, and O a letter in the original string but in a different position.\")\n print()\n\n number_of_letters = safe_int_input(\"Select a number of possible letters for the code (2-20): \", 2, 20)\n code_length = safe_int_input(\"Select a length for the code (4-10): \", 4, 10)\n\n letters = 'ABCDEFGHIJKLMNOPQRST'[:number_of_letters]\n code = ''.join(random.choices(letters, k=code_length))\n guesses = []\n\n while True:\n print()\n guess = input(f\"Enter a guess of length {code_length} ({letters}): \").upper().strip()\n\n if len(guess) != code_length or any([char not in letters for char in guess]):\n continue\n elif guess == code:\n print(f\"\\nYour guess {guess} was correct!\")\n break\n else:\n guesses.append(f\"{len(guesses)+1}: {' '.join(guess)} => {' '.join(encode(code, guess))}\")\n\n for i_guess in guesses:\n print(\"------------------------------------\")\n print(i_guess)\n print(\"------------------------------------\")\n\n\nif __name__ == '__main__':\n play_game()\n","language":"Python"},{"code":"sub MAIN (\n Int :$colors where 1 < * < 21 = 6, Int :$length where 3 < * < 11 = 4,\n Int :$guesses where 7 < * < 21 = 10, Bool :$repeat = False\n ) {\n my @valid = ('A' .. 'T')[^$colors];\n my $puzzle = $repeat ?? @valid.roll($length) !! @valid.pick($length);\n my @guesses;\n\n my $black = '●';\n my $white = '○';\n\n loop {\n clearscr();\n say header();\n printf \" %{$length * 2}s :: %s\\n\", @guesses[$_][0], @guesses[$_][1] for ^@guesses;\n say '';\n lose() if @guesses == $guesses;\n my $guess = get-guess();\n next unless $guess.&is-valid;\n my $score = score($puzzle, $guess);\n win() if $score eq ($black xx $length).join: ' ';\n @guesses.push: [$guess, $score];\n }\n\n sub header {\n my $num = $guesses - @guesses;\n qq:to/END/;\n Valid letter, but wrong position: ○ - Correct letter and position: ●\n Guess the {$length} element sequence containing the letters {@valid}\n Repeats are {$repeat ?? '' !! 'not '}allowed. You have $num guess{ $num == 1 ?? '' !! 'es'} remaining.\n END\n }\n\n sub score ($puzzle, $guess) {\n my @score;\n for ^$length {\n if $puzzle[$_] eq $guess[$_] {\n @score.push: $black;\n }\n elsif $puzzle[$_] eq any(@$guess) {\n @score.push: $white;\n }\n else {\n @score.push('-');\n }\n }\n @score.sort.reverse.join: ' ';\n }\n\n sub clearscr { $*KERNEL ~~ /'win32'/ ?? run('cls') !! run('clear') }\n\n sub get-guess { (uc prompt 'Your guess?: ').comb(/@valid/) }\n\n sub is-valid (@guess) { so $length == @guess }\n\n sub win { say 'You Win! The correct answer is: ', $puzzle; exit }\n\n sub lose { say 'Too bad, you ran out of guesses. The solution was: ', $puzzle; exit }\n}\n","language":"Raku"},{"code":"/*REXX pgm scores mastermind game with a human or CBLFs (Carbon Based Life Forms). */\nparse arg let wid mxG oRep seed _ /*obtain optional arguments from the CL*/\n arg . . . rep . /*get uppercase 4th argument \" \" \" */\nif let=='' | let==\",\" then let= 20 /*Not specified? Then use the default.*/\nif wid=='' | wid==\",\" then wid= 4 /* \" \" \" \" \" \" */\nif mxG=='' | mxG==\",\" then mxG= 20 /* \" \" \" \" \" \" */\nif rep=='' | rep==\",\" then rep= 0 /* \" \" \" \" \" \" */\nif datatype(seed,'W') then call random ,,seed /*use a seed for random repeatability. */\nif abbrev( 'REPEATSALLOWED',rep,3) then rep=1 /*allow an abbreviated option for REP. */\nif abbrev('NOREPEATSALLOWED',rep,3) then rep=0 /* \" \" \" \" \" \" */\ncall vet arg(), 'args' /*Vet the number of arguments entered. */ /*◄■■■■■■ optional vetting.*/\ncall vet let, 'letters', 2, 20 /* \" \" \" \" letters in the code*/ /*◄■■■■■■ optional vetting.*/\ncall vet wid, 'width', 4, 10 /* \" \" \" \" the width of code. */ /*◄■■■■■■ optional vetting.*/\ncall vet mxG, 'maxGuess', 7, 20 /* \" \" \" \" maximum guesses. */ /*◄■■■■■■ optional vetting.*/\ncall vet rep, 'REP', 0, 1e8 /* \" \" value if repeats are allowed*/ /*◄■■■■■■ optional vetting.*/\ncall gen; yourG= 'Your guess must be exactly '\n youve= \"You've already tried that guess \"\n do prompt=0 by 0 until xx==wid; say /*play until guessed or QUIT is entered*/\n say id 'Please enter a guess with ' wid ' letters [or Quit]:'\n pull g; g=space(g,0); L=length(g); if abbrev('QUIT',g,1) then exit 0\n if L\\==wid then do; say id '***error***' yourG wid \" letters.\"; iterate; end\n call dups /*look through the history log for dups*/\n q=?; XX=0; OO=0; try=try+1 /*initialize some REXX vars; bump TRY.*/\n\n do j=1 for L; if substr(g,j,1) \\== substr(q,j,1) then iterate /*hit? */\n xx=xx+1; q=overlay('▒', q, j) /*bump the XX correct count. */\n end /*j*/ /* [↑] XX correct count; scrub guess.*/\n\n do k=1 for L; _=substr(g, k, 1) /*process the count for \"spots\". */\n if pos(_, q)==0 then iterate /*is this (spot) letter in the code? */\n oo=oo+1; q=translate(q, , _) /*bump the OO spot count. */\n end /*k*/ /* [↑] OO spot count; & scrub guess.*/\n say\n @.try=id right('guess' try, 11) ' ('mxG \"is the max):\" g '──►' ,\n copies('X', xx)copies(\"O\", oo)copies('-', wid-xx-oo)\n call hist\n if try==mxG then do; say; say id \"you've used the maximum guesses:\" mxG\n say; say id \"The code was: \" ?; say; exit 1\n end\n end /*prompt*/\nsay; say \" ┌─────────────────────────────────────────┐\"\n say \" │ │\"\n say \" │ Congratulations, you've guessed it !! │\"\n say \" │ │\"\n say \" └─────────────────────────────────────────┘\"\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ndups: do h=1 for try; if g\\=word(@.h, 8) then iterate /*any duplicated guesses? */\n say; say id youve \" (guess number\" h').'; iterate prompt; end /*h*/; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngen: if rep==0 then reps= 'no' /*create a literal for the prompt msg. */\n else reps=\n @abc= 'QWERTYUIOPASDFGHJKLZXCVBNM' /*capital letters used for random code.*/\n id='────────'; try=0; L@abc=length(@abc) /*identifier in front of msg from here.*/\n ?=\n do until length(?)==wid /*gen random codes 'til there's enough.*/\n r=substr(@abc, random(1, L@abc), 1) /*generate a random letter, 1 at a time*/\n if \\rep & pos(r, ?)\\==0 then iterate /*maybe don't allow a repeated digit.*/\n ?=? || r; if ?=='QUIT'&let==4 then ?= /*append random letter; ··· except this*/\n end /*until*/ /* [↑] builds a unique N-letter code.*/\n say\n say id 'A random code of ' wid \"letters (out of a possible \" let ' letters) '\n say id 'has been generated (with' reps \"repeats).\"\n return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nhist: do hist=1 for try; say @.hist; end; return /*show \"guess\" history.*/\ns: if arg(1)==1 then return ''; return \"s\" /*a simpler pluraizer. */\nser: say; say; say '***error***' arg(1); say; say; exit 13\n/*──────────────────────────────────────────────────────────────────────────────────────*/ /*◄■■■■■■ optional vetting.*/\nvet: parse arg val,?,mn,mx /*vet (validate) a specified argument. */ /*◄■■■■■■ optional vetting.*/\n if ?==\"args\" & (val>1 | _\\='') then call ser \"Too many arguments specified. \" _ /*◄■■■■■■ optional vetting.*/\n if ?==\"args\" then return /*◄■■■■■■ optional vetting.*/\n if \\datatype(val, 'N') then call ser ? \"isn't numeric: \" val /*◄■■■■■■ optional vetting.*/\n if \\datatype(val, 'W') then call ser ? \"isn't an integer: \" val /*◄■■■■■■ optional vetting.*/\n if val < mn then call ser ? \"has a value less than \" mn /*◄■■■■■■ optional vetting.*/\n if val > mx then call ser ? \"has a value greater than \" mx /*◄■■■■■■ optional vetting.*/\n if ?=='REP' & \\datatype(val,W) then call ser \"Value for REPEATS isn't valid: \" oRep /*◄■■■■■■ optional vetting.*/\n return 1\n","language":"REXX"},{"code":"# Project : Mastermind\n\ncolors = [\"A\", \"B\", \"C\", \"D\"]\nplaces = list(2)\nmind = list(len(colors))\nrands = list(len(colors))\nmaster = list(len(colors))\ntest = list(len(colors))\nguesses = 7\nrepeat = false\nnr = 0\n\nif repeat\n for n = 1 to len(colors)\n while true\n rnd = random(len(colors)-1) + 1\n if rands[rnd] != 1\n mind[n] = rnd\n rands[rnd] = 1\n exit\n ok\n end\n next\nelse\n for n = 1 to len(colors)\n rnd = random(len(colors)-1) + 1\n mind[n] = rnd\n next\nok\n\nfor n = 1 to len(colors)\n master[n] = char(64+mind[n])\nnext\nwhile true\n for p = 1 to len(places)\n places[p] = 0\n next\n nr = nr + 1\n see \"Your guess (ABCD)? \"\n give testbegin\n for d = 1 to len(test)\n test[d] = testbegin[d]\n next\n flag = 1\n for n = 1 to len(test)\n if upper(test[n]) != master[n]\n flag = 0\n ok\n next\n if flag = 1\n exit\n else\n for x = 1 to len(master)\n if upper(test[x]) = master[x]\n places[1] = places[1] + 1\n ok\n next\n mastertemp = master\n for p = 1 to len(test)\n pos = find(mastertemp, upper(test[p]))\n if pos > 0\n del(mastertemp, pos)\n places[2] = places[2] + 1\n ok\n next\n ok\n place1 = places[1]\n place2 = places[2] - place1\n place3 = len(master) - (place1 + place2)\n showresult(test, place1, place2, place3)\n if nr = guesses\n exit\n ok\nend\nsee \"Well done!\" + nl\nsee \"End of game\" + nl\n\nfunc showresult(test, place1, place2, place3)\n see \"\" + nr + \" : \"\n for r = 1 to len(test)\n see test[r]\n next\n see \" : \"\n for n1 = 1 to place1\n see \"X\" + \" \"\n next\n for n2 = 1 to place2\n see \"O\" + \" \"\n next\n for n3 = 1 to place3\n see \"-\" + \" \"\n next\n see nl\n","language":"Ring"},{"code":"extern crate rand;\n\nuse rand::prelude::*;\nuse std::io;\n\nfn main() {\n let mut input_line = String::new();\n let colors_n;\n let code_len;\n let guesses_max;\n let colors_dup;\n\n loop {\n println!(\"Please enter the number of colors to be used in the game (2 - 20): \");\n input_line.clear();\n io::stdin()\n .read_line(&mut input_line)\n .expect(\"The read line failed.\");\n match (input_line.trim()).parse::<i32>() {\n Ok(n) => {\n if n >= 2 && n <= 20 {\n colors_n = n;\n break;\n } else {\n println!(\"Outside of range (2 - 20).\");\n }\n }\n Err(_) => println!(\"Invalid input.\"),\n }\n }\n let colors = &\"ABCDEFGHIJKLMNOPQRST\"[..colors_n as usize];\n\n println!(\"Playing with colors {}.\\n\", colors);\n\n loop {\n println!(\"Are duplicated colors allowed in the code? (Y/N): \");\n input_line.clear();\n io::stdin()\n .read_line(&mut input_line)\n .expect(\"The read line failed.\");\n if [\"Y\", \"N\"].contains(&&input_line.trim().to_uppercase()[..]) {\n colors_dup = input_line.trim().to_uppercase() == \"Y\";\n break;\n } else {\n println!(\"Invalid input.\");\n }\n }\n println!(\n \"Duplicated colors {}allowed.\\n\",\n if colors_dup { \"\" } else { \"not \" }\n );\n loop {\n let min_len = if colors_dup { 4 } else { 4.min(colors_n) };\n let max_len = if colors_dup { 10 } else { 10.min(colors_n) };\n println!(\n \"Please enter the length of the code ({} - {}): \",\n min_len, max_len\n );\n input_line.clear();\n io::stdin()\n .read_line(&mut input_line)\n .expect(\"The read line failed.\");\n match (input_line.trim()).parse::<i32>() {\n Ok(n) => {\n if n >= min_len && n <= max_len {\n code_len = n;\n break;\n } else {\n println!(\"Outside of range ({} - {}).\", min_len, max_len);\n }\n }\n Err(_) => println!(\"Invalid input.\"),\n }\n }\n println!(\"Code of length {}.\\n\", code_len);\n loop {\n println!(\"Please enter the number of guesses allowed (7 - 20): \");\n input_line.clear();\n io::stdin()\n .read_line(&mut input_line)\n .expect(\"The read line failed.\");\n match (input_line.trim()).parse::<i32>() {\n Ok(n) => {\n if n >= 7 && n <= 20 {\n guesses_max = n;\n break;\n } else {\n println!(\"Outside of range (7 - 20).\");\n }\n }\n Err(_) => println!(\"Invalid input.\"),\n }\n }\n println!(\"{} guesses allowed.\\n\", guesses_max);\n\n let mut rng = rand::thread_rng();\n let mut code;\n if colors_dup {\n code = (0..code_len)\n .map(|_| ((65 + rng.gen_range(0, colors_n) as u8) as char))\n .collect::<Vec<_>>();\n } else {\n code = colors.chars().collect::<Vec<_>>();\n code.shuffle(&mut rng);\n code = code[..code_len as usize].to_vec();\n }\n //code = vec!['J', 'A', 'R', 'D', 'A', 'N', 'I'];\n //println!(\"Secret code: {:?}\", code);\n let mut guesses: Vec<(String, String)> = vec![];\n let mut i = 1;\n loop {\n println!(\"Your guess ({}/{})?: \", i, guesses_max);\n input_line.clear();\n io::stdin()\n .read_line(&mut input_line)\n .expect(\"The read line failed.\");\n let mut guess = input_line.trim().to_uppercase();\n if guess.len() as i32 > code_len {\n guess = guess[..code_len as usize].to_string();\n }\n let guess_v = guess.chars().collect::<Vec<char>>();\n let res = evaluate(&code, &guess_v);\n guesses.push((guess, res.clone()));\n let width = 8 + guesses_max.to_string().len() + code_len as usize * 2;\n println!(\"{}\", \"-\".repeat(width));\n for (i, guess) in guesses.iter().enumerate() {\n let line = format!(\n \" {:w1$} : {:w2$} : {:w2$} \",\n i + 1,\n guess.0,\n guess.1,\n w1 = guesses_max.to_string().len(),\n w2 = code_len as usize\n );\n println!(\"{}\", line);\n }\n println!(\"{}\", \"-\".repeat(width));\n if res == \"X\".repeat(code_len as usize) {\n println!(\"You won! Code: {}\", code.into_iter().collect::<String>());\n break;\n }\n i += 1;\n if i > guesses_max {\n println!(\"You lost. Code: {}\", code.into_iter().collect::<String>());\n break;\n }\n }\n}\n\nfn evaluate(code: &[char], guess: &[char]) -> String {\n let mut res: Vec<char> = vec![];\n for i in 0..guess.len() {\n if guess[i] == code[i] {\n res.push('X');\n } else if code.contains(&guess[i]) {\n res.push('O');\n } else {\n res.push('-');\n }\n }\n res.sort_by(|a, b| b.cmp(a));\n res.into_iter().collect()\n}\n","language":"Rust"},{"code":" -- Create Table\n -- Distinct combination\n --- R :Red, B :Blue, G: Green, V: Violet, O: Orange, Y: Yellow\n DROP TYPE IF EXISTS color cascade;CREATE TYPE color AS ENUM ('R', 'B', 'G', 'V', 'O', 'Y');\n\n DROP TABLE IF EXISTS guesses cascade ; CREATE TABLE guesses (\n first color,\n second color,\n third color ,\n fourth color\n );\n CREATE TABLE mastermind () inherits (guesses);\n\n INSERT INTO mastermind values ('G', 'B', 'R', 'V');\n\n\n INSERT INTO guesses values ('Y', 'Y', 'B', 'B');\n INSERT INTO guesses values ('V', 'R', 'R', 'Y');\n INSERT INTO guesses values ('G', 'V', 'G', 'Y');\n INSERT INTO guesses values ('R', 'R', 'V', 'Y');\n INSERT INTO guesses values ('B', 'R', 'G', 'V');\n INSERT INTO guesses values ('G', 'B', 'R', 'V');\n\n\n --- Matches Black\n CREATE OR REPLACE FUNCTION check_black(guesses, mastermind) RETURNS integer AS $$\n SELECT (\n ($1.first = $2.first)::int +\n ($1.second = $2.second)::int +\n ($1.third = $2.third)::int +\n ($1.fourth = $2.fourth)::int\n );\n $$ LANGUAGE SQL;\n\n --- Matches White\n CREATE OR REPLACE FUNCTION check_white(guesses, mastermind) RETURNS integer AS $$\n SELECT (\n case when ($1.first = $2.first) then 0 else 0 end +\n case when ($1.second = $2.second) then 0 else 0 end +\n case when ($1.third = $2.third) then 0 else 0 end +\n case when ($1.fourth = $2.fourth) then 0 else 0 end +\n case when ($1.first != $2.first) then (\n $1.first = $2.second or\n $1.first = $2.third or\n $1.first = $2.fourth\n )::int else 0 end +\n case when ($1.second != $2.second) then (\n $1.second = $2.first or\n $1.second = $2.third or\n $1.second = $2.fourth\n )::int else 0 end +\n case when ($1.third != $2.third) then (\n $1.third = $2.first or\n $1.third = $2.second or\n $1.third = $2.fourth\n )::int else 0 end +\n case when ($1.fourth != $2.fourth) then (\n $1.fourth = $2.first or\n $1.fourth = $2.second or\n $1.fourth = $2.third\n )::int else 0 end\n ) from guesses\n $$ LANGUAGE SQL;\n\n\n\n SELECT guesses,\n check_black(guesses.*, mastermind.*),\n check_white(guesses.*, mastermind.*)\n FROM guesses, mastermind\n","language":"SQL"},{"code":"import \"random\" for Random\nimport \"./ioutil\" for Input\nimport \"./str\" for Str\n\nvar Rand = Random.new()\n\nclass Mastermind {\n construct new(codeLen, colorsCnt, guessCnt, repeatClr) {\n var color = \"ABCDEFGHIJKLMNOPQRST\"\n _codeLen = codeLen.clamp(4, 10)\n var cl = colorsCnt\n if (!repeatClr && cl < _codeLen) cl = _codeLen\n _colorsCnt = cl.clamp(2, 20)\n _guessCnt = guessCnt.clamp(7, 20)\n _repeatClr = repeatClr\n _colors = color.take(_colorsCnt).join()\n _combo = \"\"\n _guesses = []\n _results = []\n }\n\n play() {\n var win = false\n _combo = getCombo_()\n while (_guessCnt != 0) {\n showBoard_()\n if (checkInput_(getInput_())) {\n win = true\n break\n }\n _guessCnt = _guessCnt - 1\n }\n System.print(\"\\n\\n--------------------------------\")\n if (win) {\n System.print(\"Very well done!\\nYou found the code: %(_combo)\")\n } else {\n System.print(\"I am sorry, you couldn't make it!\\nThe code was: %(_combo)\")\n }\n System.print(\"--------------------------------\\n\")\n }\n\n showBoard_() {\n for (x in 0..._guesses.count) {\n System.print(\"\\n--------------------------------\")\n System.write(\"%(x + 1): \")\n for (y in _guesses[x]) System.write(\"%(y) \")\n System.write(\" : \")\n for (y in _results[x]) System.write(\"%(y) \")\n var z = _codeLen - _results[x].count\n if (z > 0) System.write(\"- \" * z)\n }\n System.print(\"\\n\")\n }\n\n getInput_() {\n while (true) {\n var a = Str.upper(Input.text(\"Enter your guess (%(_colors)): \", 1)).take(_codeLen)\n if (a.all { |c| _colors.contains(c) } ) return a.join()\n }\n }\n\n checkInput_(a) {\n _guesses.add(a.toList)\n var black = 0\n var white = 0\n var gmatch = List.filled(_codeLen, false)\n var cmatch = List.filled(_codeLen, false)\n for (i in 0..._codeLen) {\n if (a[i] == _combo[i]) {\n gmatch[i] = true\n cmatch[i] = true\n black = black + 1\n }\n }\n for (i in 0..._codeLen) {\n if (gmatch[i]) continue\n for (j in 0..._codeLen) {\n if (i == j || cmatch[j]) continue\n if (a[i] == _combo[j]) {\n cmatch[j] = true\n white = white + 1\n break\n }\n }\n }\n var r = []\n r.addAll((\"X\" * black).toList)\n r.addAll((\"O\" * white).toList)\n _results.add(r)\n return black == _codeLen\n }\n\n getCombo_() {\n var c = \"\"\n var clr = _colors\n for (s in 0..._codeLen) {\n var z = Rand.int(clr.count)\n c = c + clr[z]\n if (!_repeatClr) Str.delete(clr, z)\n }\n return c\n }\n}\n\nvar m = Mastermind.new(4, 8, 12, false)\nm.play()\n","language":"Wren"},{"code":"class MasterMind{\n fcn init(code_len,guess_count){\n var codeLen =code_len.max(4).min(10);\n var guessCnt=guess_count.max(7).min(20);\n var colors =\"ABCDEFGHIJKLMNOPQRST\"[0,codeLen];\n }\n fcn play{\n guesses,win,blackWhite:=List(),False,Void;\n code:=codeLen.pump(String,'wrap(_){ colors[(0).random(codeLen)] });\n do(guessCnt){\n\t str:=getInput();\n\t win,blackWhite = checkInput(str,code);\n\t guesses.append(T(str,blackWhite));\n\t showBoard(guesses);\n\t if(win) break;\n }\n if(win) println(\"--------------------------------\\n\",\n\t\t\"Very well done!\\nYou found the code: \",code);\n else println(\"--------------------------------\\n\",\n\t\t\"I am sorry, you didn't discover the code!\\nThe code was: \",code);\n }\n fcn [private] showBoard(guesses){\n foreach n,gbw in ([1..].zip(guesses)){\n guess,blackWhite := gbw;\n println(\"%2d: %s :% s %s\".fmt(n,\n\t guess.split(\"\").concat(\" \"), blackWhite.split(\"\").concat(\" \"),\n\t \"- \"*(codeLen - blackWhite.len())));\n }\n }\n fcn [private] getInput{\n while(True){\n\t a:=ask(\"Enter your guess (\" + colors + \"): \").toUpper()[0,codeLen];\n\t if(not (a-colors) and a.len()>=codeLen) return(a);\n }\n }\n fcn [private] checkInput(guess,code){\n\t// black: guess is correct in both color and position\n // white: correct color, wrong position\n\tmatched,black := guess.split(\"\").zipWith('==,code), matched.sum(0);\n\t// remove black from code, prepend null to make counting easy\n\tcode = L(\"-\").extend(matched.zipWith('wrap(m,peg){ m and \"-\" or peg },code));\n\twhite:=0; foreach m,p in (matched.zip(guess)){\n\t if(not m and (z:=code.find(p))){ white+=1; code[z]=\"-\"; }\n\t}\n\treturn(black==codeLen,\"X\"*black + \"O\"*white)\n }\n}(4,12).play();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Puzzles\\nfrom: http://rosettacode.org/wiki/Mastermind\\nnote: Games\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Create a simple version of the board game: [https://en.wikipedia.org/wiki/Mastermind_(board_game) Mastermind].\\n\\nIt must be possible to:\\n:* choose the number of colors will be used in the game (2 - 20)\\n:* choose the color code length (4 - 10)\\n:* choose the maximum number of guesses the player has (7 - 20)\\n:* choose whether or not colors may be repeated in the code\\n\\n<br>\\nThe (computer program) game should display all the player guesses and the results of that guess.\\n\\nDisplay (just an idea):\\n:::::: {| class=\\\"wikitable\\\" border=\\\"1\\\"\\n|-\\n! Feature !! Graphic Version !! Text Version \\n|-\\n| Player guess\\n| Colored circles\\n| Alphabet letters\\n|-\\n|Correct color & position\\n|Black circle \\n|X\\n|-\\n|Correct color\\n|White circle \\n|O\\n|-\\n|None\\n|Gray circle \\n| -\\n|-\\n|}\\n\\n\\nA text version example: <big> 1. ADEF - XXO- </big>\\n<br>Translates to:\\n<br>the first guess;\\n<br>the four colors (ADEF);\\n<br>result: \\n:::: two correct colors and spot, \\n:::: one correct color/wrong spot, one color isn't in the code.\\n\\nHappy coding!\\n\\n\\n;Related tasks:\\n* [[Bulls and cows]]\\n* [[Bulls and cows/Player]]\\n* [[Guess the number]]\\n* [[Guess the number/With Feedback]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F encode(correct, guess)\\n [String] output_arr\\n\\n L(i) 0 .< correct.len\\n output_arr [+]= I guess[i] == correct[i] {‘X’} E I guess[i] C correct {‘O’} E ‘-’\\n\\n R output_arr\\n\\nF safe_int_input(prompt, min_val, max_val)\\n L\\n V user_input_str = input(prompt)\\n\\n X.try\\n V user_input = Int(user_input_str)\\n I user_input C min_val .. max_val\\n R user_input\\n X.catch ValueError\\n L.continue\\n\\nF play_game()\\n print(‘Welcome to Mastermind.’)\\n print(‘You will need to guess a random code.’)\\n print(‘For each guess, you will receive a hint.’)\\n print(‘In this hint, X denotes a correct letter, and O a letter in the original string but in a different position.’)\\n print()\\n\\n V number_of_letters = safe_int_input(‘Select a number of possible letters for the code (2-20): ’, 2, 20)\\n V code_length = safe_int_input(‘Select a length for the code (4-10): ’, 4, 10)\\n\\n V letters = ‘ABCDEFGHIJKLMNOPQRST’[0 .< number_of_letters]\\n V code = ‘’\\n L 0 .< code_length\\n code ‘’= random:choice(letters)\\n [String] guesses\\n\\n L\\n print()\\n V guess = input(‘Enter a guess of length #. (#.): ’.format(code_length, letters)).uppercase()\\n\\n I guess.len != code_length | any(guess.map(char -> char !C @letters))\\n L.continue\\n E I guess == code\\n print(\\\"\\\\nYour guess \\\"guess‘ was correct!’)\\n L.break\\n E\\n guesses.append(‘#.: #. => #.’.format(guesses.len + 1, Array(guess).join(‘ ’), encode(code, guess).join(‘ ’)))\\n\\n L(i_guess) guesses\\n print(‘------------------------------------’)\\n print(i_guess)\\n print(‘------------------------------------’)\\n\\nplay_game()\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"DEFINE MINCOLORS=\\\"2\\\"\\nDEFINE MAXCOLORS=\\\"20\\\"\\nDEFINE MINLENGTH=\\\"4\\\"\\nDEFINE MAXLENGTH=\\\"10\\\"\\nDEFINE MINGUESS=\\\"7\\\"\\nDEFINE MAXGUESS=\\\"20\\\"\\nTYPE Score=[BYTE spot,corr,err]\\nTYPE Settings=[BYTE colors,length,guesses,repeat]\\n\\nPROC GetSettings(Settings POINTER s)\\n CHAR ARRAY tmp(10)\\n\\n DO\\n PrintF(\\\"Enter number of colors (%B-%B):\\\",MINCOLORS,MAXCOLORS)\\n s.colors=InputB()\\n UNTIL s.colors>=MINCOLORS AND s.colors<=MAXCOLORS\\n OD\\n DO\\n PrintF(\\\"Enter length of code (%B-%B):\\\",MINLENGTH,MAXLENGTH)\\n s.length=InputB()\\n UNTIL s.length>=MINLENGTH AND s.length<=MAXLENGTH\\n OD\\n DO\\n PrintF(\\\"Enter max number of guesses (%B-%B):\\\",MINGUESS,MAXGUESS)\\n s.guesses=InputB()\\n UNTIL s.guesses>=MINGUESS AND s.guesses<=MAXGUESS\\n OD\\n IF s.colors<s.length THEN\\n s.repeat=1\\n ELSE\\n DO\\n Print(\\\"Allow repeated colors (Y/N):\\\")\\n InputS(tmp)\\n IF tmp(0)=1 THEN\\n IF tmp(1)='y OR tmp(1)='Y THEN\\n s.repeat=1 EXIT\\n ELSEIF tmp(1)='n OR tmp(1)='N THEN\\n s.repeat=0 EXIT\\n FI\\n FI\\n OD\\n FI\\nRETURN\\n\\nPROC Generate(CHAR ARRAY code Settings POINTER s)\\n CHAR ARRAY col(MAXCOLORS)\\n BYTE i,j,d,tmp,count\\n\\n FOR i=0 TO MAXCOLORS-1\\n DO\\n col(i)=i+'A\\n OD\\n code(0)=s.length\\n count=s.colors\\n FOR i=1 TO s.length\\n DO\\n d=Rand(count)\\n code(i)=col(d)\\n IF s.repeat=0 THEN\\n count==-1\\n col(d)=col(count)\\n FI\\n OD\\nRETURN\\n\\nBYTE FUNC GetCount(CHAR ARRAY s CHAR c)\\n BYTE i,count\\n\\n count=0\\n FOR i=1 TO s(0)\\n DO\\n IF s(i)=c THEN\\n count==+1\\n FI\\n OD\\nRETURN (count)\\n\\nPROC CheckScore(CHAR ARRAY code,guess\\n Settings POINTER s Score POINTER res)\\n BYTE i,j,codeCount,guessCount\\n\\n res.spot=0\\n res.corr=0\\n IF guess(0)#s.length THEN\\n res.err=1\\n RETURN\\n FI\\n res.err=0\\n\\n FOR i=0 TO s.colors-1\\n DO\\n codeCount=GetCount(code,i+'A)\\n guessCount=GetCount(guess,i+'A)\\n IF codeCount<guessCount THEN\\n res.corr==+codeCount\\n ELSE\\n res.corr==+guessCount\\n FI\\n OD\\n FOR i=1 TO s.length\\n DO\\n IF guess(i)=code(i) THEN\\n res.spot==+1\\n res.corr==-1\\n FI\\n OD\\nRETURN\\n\\nPROC ToUpper(CHAR ARRAY s)\\n BYTE i,c\\n\\n IF s(0)=0 THEN RETURN FI\\n FOR i=1 TO s(0)\\n DO\\n c=s(i)\\n IF c>='a AND c<='z THEN\\n s(i)=c-'a+'A\\n FI\\n OD\\nRETURN\\n\\nPROC PrintScore(Score POINTER res Settings POINTER s)\\n INT i\\n\\n FOR i=1 TO res.spot\\n DO Put('X) OD\\n FOR i=1 TO res.corr\\n DO Put('O) OD\\n FOR i=1 TO s.length-res.spot-res.corr\\n DO Put('-) OD\\nRETURN\\n\\nPROC Main()\\n CHAR ARRAY code(MAXLENGTH+1),guess(255)\\n Score res\\n Settings s\\n BYTE tries\\n\\n PrintE(\\\"Mastermind\\\") PutE()\\n GetSettings(s) PutE()\\n Generate(code,s)\\n tries=s.guesses\\n PrintF(\\\"Enter your guess (%B tries):%E\\\",tries)\\n DO\\n InputS(guess) ToUpper(guess)\\n CheckScore(code,guess,s,res)\\n Put(28) ;cursor up\\n PrintF(\\\"%S -> \\\",guess)\\n IF res.err THEN\\n Print(\\\"Wrong input\\\")\\n ELSE\\n PrintScore(res,s)\\n IF res.spot=s.length THEN\\n PutE() PutE()\\n PrintE(\\\"You won!\\\")\\n EXIT\\n FI\\n tries==-1\\n IF tries=0 THEN\\n PutE() PutE()\\n PrintE(\\\"You lost!\\\")\\n EXIT\\n FI\\n FI\\n PrintF(\\\", try again (%B tries):%E\\\",tries)\\n OD\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\nwith Ada.Numerics.Discrete_Random;\\nwith Ada.Strings.Fixed;\\nwith Ada.Containers.Ordered_Sets;\\n\\nuse Ada.Strings.Fixed;\\n\\nprocedure MasterMind\\nis\\n subtype Color_Number is Positive range 2 .. 20;\\n subtype Code_Size is Positive range 4 .. 10;\\n subtype Guesses_Number is Positive range 7 .. 20;\\n subtype Color is Character range 'A' .. 'T';\\n\\n function Hint(correct, guess : in String) return String\\n is\\n Xs : Natural := 0;\\n Os : Natural := 0;\\n to_display : String(1 .. correct'Length) := (others => '-');\\n begin\\n for I in guess'Range loop\\n if guess(I) = correct(I) then\\n Xs := Xs + 1;\\n to_display(I) := 'X';\\n end if;\\n end loop;\\n for I in guess'Range loop\\n if to_display(I) = '-' then\\n for J in correct'Range loop\\n if J /= I and to_display(J) /= 'X' and correct(J) = guess(I) then\\n Os := Os + 1;\\n exit;\\n end if;\\n end loop;\\n end if;\\n end loop;\\n return Xs * 'X' & Os * 'O' & (guess'Length - Xs - Os) * '-';\\n end Hint;\\n\\n generic\\n type Data is (<>);\\n function Input(message : in String) return Data;\\n -- Input will loop until a correct value is given by the user.\\n -- For each wrong input, the program will prompt the range of expected values.\\n\\n function Input(message : in String) return Data is\\n begin\\n loop\\n Ada.Text_IO.Put(message);\\n declare\\n S : constant String := Ada.Text_IO.Get_Line;\\n begin\\n return Data'Value(S);\\n exception\\n when Constraint_Error =>\\n Ada.Text_IO.New_Line;\\n Ada.Text_IO.Put_Line(\\\"Invalid input!\\\");\\n Ada.Text_IO.Put_Line\\n (\\\"Expected values in range:\\\"\\n & Data'First'Img & \\\" ..\\\" & Data'Last'Img);\\n Ada.Text_IO.New_Line;\\n end;\\n end loop;\\n end;\\n\\n function Input_Color_Number is new Input(Color_Number);\\n function Input_Code_Size is new Input(Code_Size);\\n function Input_Guesses_Number is new Input(Guesses_Number);\\n function Input_Boolean is new Input(Boolean);\\n\\n CN : constant Color_Number := Input_Color_Number(\\\"How many colors? \\\");\\n GN : constant Guesses_Number := Input_Guesses_Number(\\\"How many guesses? \\\");\\n CS : constant Code_Size := Input_Code_Size(\\\"Size of the code? \\\");\\n repeats : Boolean := Input_Boolean(\\\"With repeats? \\\");\\n -- Not constant: if Color < Code_Size, we will have repetitions anyway.\\n\\n subtype Actual_Colors is Color range Color'First .. Color'Val(Color'Pos(Color'First) + CN - 1);\\n package Actual_Colors_Sets is new Ada.Containers.Ordered_Sets(Element_Type => Actual_Colors);\\n\\n package Color_Random is new Ada.Numerics.Discrete_Random(Result_Subtype => Actual_Colors);\\n generator : Color_Random.Generator;\\n\\n function Random return String\\n is\\n C : String(1 .. CS);\\n seen : Actual_Colors_Sets.Set;\\n begin\\n for I in C'Range loop\\n C(I) := Color_Random.Random(generator);\\n while (not repeats) and seen.Contains(C(I)) loop\\n C(I) := Color_Random.Random(generator);\\n end loop;\\n seen.Include(C(I));\\n end loop;\\n return C;\\n end Random;\\n\\n function Get_Code return String is\\n begin\\n loop\\n Ada.Text_IO.Put(\\\"> \\\");\\n declare\\n input : constant String := Ada.Text_IO.Get_Line;\\n begin\\n if input'Length /= CS then\\n raise Constraint_Error;\\n end if;\\n for C of input loop\\n if C not in Actual_Colors then\\n raise Constraint_Error;\\n end if;\\n end loop;\\n return input;\\n exception\\n when Constraint_Error =>\\n Ada.Text_IO.New_Line;\\n Ada.Text_IO.Put_Line(\\\"Invalid input!\\\");\\n Ada.Text_IO.New_Line;\\n end;\\n end loop;\\n end Get_Code;\\n\\n found : Boolean := False;\\nbegin\\n if (not repeats) and (CN < CS) then\\n Ada.Text_IO.Put_Line(\\\"Not enough colors! Using repeats anyway.\\\");\\n repeats := True;\\n end if;\\n\\n Color_Random.Reset(generator);\\n\\n declare\\n answer : constant String := Random;\\n previous : array(1 .. GN) of String(1 .. CS*2);\\n begin\\n for I in 1 .. GN loop\\n declare\\n guess : constant String := Get_Code;\\n begin\\n if guess = answer then\\n Ada.Text_IO.Put_Line(\\\"You won, congratulations!\\\");\\n found := True;\\n else\\n previous(I) := guess & Hint(answer, guess);\\n Ada.Text_IO.Put_Line(44 * '-');\\n for J in 1 .. I loop\\n Ada.Text_IO.Put_Line\\n (previous(J)(1 .. CS)\\n & \\\" => \\\" & previous(J)(CS+1 .. previous(J)'Last));\\n end loop;\\n Ada.Text_IO.Put_Line(44 * '-');\\n Ada.Text_IO.New_Line;\\n end if;\\n end;\\n exit when found;\\n end loop;\\n if not found then\\n Ada.Text_IO.Put_Line(\\\"You lost, sorry! The answer was: \\\" & answer);\\n end if;\\n end;\\nend MasterMind;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"#!/usr/local/bin/apl -s -f --\\n\\n⍝ Define the alphabet\\nA←'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\\n\\n⍝ Make ASCII values upper case\\n∇n←AscUp c\\n n←c-32×(c≥97)∧(c≤122)\\n∇\\n\\n⍝ Does a list have repeated values?\\n∇r←Rpts l\\n r←(l⍳l)≢⍳⍴l\\n∇\\n\\n⍝ Keyboard input using ⎕ and ⍞ doesn't work well using GNU APL in script mode,\\n⍝ so you kind of have to write your own.\\n⍝ Read a line of text from the keyboard\\n∇l←ReadLine up;k;z;data\\n data←'' ⋄ csr←0 ⍝ Start out with empty string and cursor at 0\\n\\n ⍝⍝⍝ Keyboard input\\nin: k←1⎕fio[41]1 ⍝ Read byte from stdin\\nhandle: →(k>127)/skip ⍝ Unicode is not supported (Wumpus doesn't need it)\\n →(k∊8 127)/back ⍝ Handle backspace\\n →(k=10)/done ⍝ Newline = Enter key pressed\\n →(k<32)/in ⍝ For simplicity, disregard terminal control entirely\\n\\n k←(AscUp⍣up)k ⍝ Make key uppercase if necessary\\n z←k⎕fio[42]0 ⍝ Echo key to stdout\\n data←data,k ⍝ Insert key into data\\n →in ⍝ Go get next key\\n\\n ⍝⍝⍝ Skip UTF-8 input (read until byte ≤ 127)\\nskip: k←1⎕fio[41]1 ⋄ →(k>127)/skip ⋄ →handle\\n\\n ⍝⍝ Backspace\\nback: →(0=⍴data)/in ⍝ If already at beginning, ignore\\n z←k⎕fio[42]0 ⍝ Backspace to terminal\\n data←¯1↓data ⍝ Remove character\\n →in ⍝ Get next key\\n\\n ⍝⍝ We are done, return the line as text\\ndone: l←⎕UCS data\\n∇\\n\\n⍝ Read a positive number from the keyboard in the range [min...max]\\n∇n←min ReadNum max;l;z\\nin: l←ReadLine 0\\n z←10⎕fio[42]0\\n →(~l∧.∊'0123456789')/no\\n →((min≤n)∧max≥n←⍎l)/0\\nno: ⍞←'Please enter a number between ',(⍕min),' and ',(⍕max),': '\\n →in\\n∇\\n\\n⍝ Ask a numeric question\\n∇n←q Question lim;min;max\\n (min max)←lim\\n ⍞←q,' [',(⍕min),'..',(⍕max),']? '\\n n←min ReadNum max\\n∇\\n\\n⍝ Read a choice from the keyboard\\n∇c←Choice cs;ks;k;z\\n ks←AscUp ⎕UCS ↑¨cs ⍝ User should press first letter of choice\\nin: →(~(k←AscUp 1⎕fio[41]1)∊ks)/in ⍝ Wait for user to make choice\\n z←(c←⊃cs[↑ks⍳k])⎕fio[42]0 ⍝ Select and output correspoinding choice\\n∇\\n\\n⍝ Ask the user for game parameters\\n∇parms←InitGame;clrs;len;gss;rpts\\n ⎕←'∘∘∘ MASTERMIND ∘∘∘' ⋄ ⎕←''\\n clrs←'How many colors' Question 2 20\\n len←'Code length' Question 4 10\\n gss←'Maximum amount of guesses' Question 7 20\\n ⍞←'Allow repeated colors in code (Y/N)? '\\n rpts←'Yes'≡Choice 'Yes' 'No'\\n parms←clrs len gss rpts\\n∇\\n\\n⍝ Generate a code.\\n∇c←rpts MakeCode parms;clrs;len\\n (clrs len)←parms\\n c←A[(1+rpts)⊃(len?clrs)(?len/clrs)]\\n∇\\n\\n⍝ Let user make a guess and handle errors\\n∇g←parms Guess code;clrs;rpts;l;right;in\\n (clrs rpts num)←parms\\n\\nguess: ⍞←'Guess ',(¯2↑⍕num),': ' ⋄ g←ReadLine 1 ⍝ Read a guess from the keyboard\\n\\n ⍝ Don't count obvously invalid input against the user\\n →((⍴code)≢⍴g)/len ⍝ Length is wrong\\n →(~g∧.∊A[⍳clrs])/inv ⍝ Invalid code in input\\n →((~rpts)∧Rpts g)/rpt ⍝ No repeats allowed\\n\\n ⍝ Give feedback\\n right←g=code ⍝ Colors in right position\\n in←g∊code ⍝ Colors not in right position\\n fb←(+/right)/'X' ⍝ X = amount of matching ones\\n fb←fb,(+/in∧~right)/'O' ⍝ O = amount of non-matching ones\\n fb←fb,(+/~in)/'-' ⍝ - = amount of colors not in code\\n ⍞←' --→ ',fb,⎕UCS 10\\n →0\\nlen: ⎕←'Invalid length.' ⋄ →guess\\ninv: ⎕←'Invalid color.' ⋄ →guess\\nrpt: ⎕←'No repeats allowed.' ⋄ →guess\\n∇\\n\\n⍝ Play the game\\n∇ Mastermind;clrs;len;gsmax;rpts;code;gs\\n ⎕rl←(2*32)|×/⎕ts ⍝ initialize random seed\\n (clrs len gsmax rpts)←InitGame\\n code←rpts MakeCode clrs len\\n ⎕←2 0⍴''\\n ⎕←'The code consists of: ',A[⍳clrs]\\n gs←0\\nloop: gs←gs+1\\n →(gs>gsmax)/lose\\n →(code≢(clrs rpts gs)Guess code)/loop\\n ⎕←'○○○ Congratulations! ○○○'\\n ⎕←'You won in ',(⍕gs),' guesses.'\\n →0\\nlose: ⎕←'Alas, you are out of guesses.'\\n ⎕←'The code was: ',code\\n∇\\n\\nMastermind\\n)OFF\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"w := h := 32, maxRows := 10, numPegs := 8\\nww := floor(w/2-2), hh := floor(h/2-2)\\ngrid := [], dx := w*4.5\\ngosub, Decode\\n\\nGui, Font, S18, Consolas\\nloop, 4\\n{\\n\\ti := A_Index-1\\n\\tGui, add, button, % \\\"x\\\" (Mod(i, 4)?\\\"+0\\\":\\\"30\\\") \\\" y\\\"\\n\\t\\t\\t\\t\\t.\\t(Mod(i, 4)?\\\"10\\\" : \\\"10\\\") \\\" w\\\" w \\\" h\\\" h \\\" vGoal\\\" A_Index , ?\\n}\\n\\nGui, Add, Text, % \\\"section x30 h1 0x1000 w\\\" w*6\\nloop, % maxRows\\n{\\n\\tGui, Font, S18, consolas\\n\\trow := maxRows - A_Index + 1\\n\\tloop 4\\n\\t{\\n\\t\\tcol := A_Index, \\ti:= col-1\\n\\t\\tGui, add, button, % \\\"x\\\" (Mod(i, 4)?\\\"+0\\\":\\\"s\\\") \\\" y\\\" (Mod(i, 4)?\\\"p\\\":\\\"+2\\\")\\n\\t\\t\\t\\t\\t\\t. \\\" w\\\" w \\\" h\\\" h \\\" vButton\\\" row \\\"_\\\" col \\\" gButton\\\"\\n\\t}\\n\\tGui, Font, S13, wingdings 2\\n\\tloop 2\\n\\t{\\n\\t\\tcol := A_Index, \\ti:= col-1\\n\\t\\tGui, add, text, % \\\"x\\\" (Mod(i,2)?\\\"+1\\\":\\\"s+\\\" dx) \\\" y\\\" (Mod(i,2)?\\\"p\\\":\\\"p+1\\\")\\n\\t\\t\\t\\t\\t\\t. \\\" w\\\" ww \\\" h\\\" hh \\\" vKeyPeg\\\" row \\\"_\\\" col, % Chr(167)\\n\\t}\\n\\tloop 2\\n\\t{\\n\\t\\tcol := A_Index+2, \\ti:= col-1\\n\\t\\tGui, add, text, % \\\"x\\\" (Mod(i,2)?\\\"+1\\\":\\\"s+\\\" dx) \\\" y\\\" (Mod(i,2)?\\\"p\\\":\\\"+1\\\") \\t\\n\\t\\t\\t\\t\\t\\t. \\\" w\\\" ww \\\" h\\\" hh \\\" vKeyPeg\\\" row \\\"_\\\" col, % Chr(167)\\n\\t}\\n\\tGui, Add, Text, % \\\"section xs h1 0x1000 w\\\" w*6 \\\" y+4\\\"\\n}\\nGui, Font, S12, consolas\\nGui, add, Button, % \\\"xs y+10 gSubmit w\\\" W*2 , Submit\\nGui, add, Button, % \\\"x+0 gResetMM w\\\" W*2, Reset\\nGui, add, Checkbox, % \\\"x+4 vNoDup\\\", No`nDuplicates\\nGui, Font, S18\\nfor i, v in pegs\\n\\tGui, add, Radio, % \\\"x\\\" (!Mod(i-1, 4)?\\\"10\\\":\\\"+10\\\") \\\" h\\\" h \\\" w\\\" w+20 \\\" vRadio\\\" A_Index, % v\\nGui, show\\nRow := 1\\nreturn\\n;-----------------------------------------------------------------------\\nGuiClose:\\nExitApp\\nreturn\\n;-----------------------------------------------------------------------\\nDecode:\\nGui, Submit, NoHide\\npegs:=[], goal := [], usedPeg :=[]\\npool := [\\\"😺\\\",\\\"🎃\\\",\\\"🧨\\\",\\\"⚽\\\",\\\"😀\\\",\\\"☠\\\",\\\"👽\\\",\\\"❄\\\",\\\"🙉\\\",\\\"💗\\\"\\n\\t,\\\"💥\\\",\\\"🖐\\\",\\\"🏈\\\",\\\"🎱\\\",\\\"👁\\\",\\\"🗨\\\",\\\"🤙\\\",\\\"👄\\\",\\\"🐶\\\",\\\"🐴\\\"\\n\\t,\\\"🦢\\\",\\\"🐍\\\",\\\"🐞\\\",\\\"💣\\\",\\\"🐪\\\",\\\"🐘\\\",\\\"🐰\\\",\\\"🐸\\\",\\\"🌴\\\",\\\"🏀\\\"]\\n\\nloop, % numPegs\\n{\\n\\tRandom, rnd, 1, % pool.count()\\n\\tpegs[A_Index] := pool.RemoveAt(rnd)\\n}\\ni := 1\\nwhile (goal.count()<4)\\n{\\n\\tRandom, rnd, 1, % pegs.count()\\n\\tif (NoDup && usedPeg[pegs[rnd]])\\n\\t\\tcontinue\\n\\tgoal[i++] := pegs[rnd]\\n\\tusedPeg[pegs[rnd]] := true\\n}\\nreturn\\n;-----------------------------------------------------------------------\\nButton:\\nif GameEnd\\n\\treturn\\n\\nGui, Submit, NoHide\\nRegExMatch(A_GuiControl, \\\"Button(\\\\d+)_(\\\\d+)\\\", m)\\nif (m1 <> row)\\n{\\n\\tthisPeg := Grid[m1, m2]\\n\\tfor i, v in pegs\\n\\t\\tif (v=thisPeg)\\n\\t\\t\\tGuiControl,, Radio%i%, 1\\n\\tGuiControl,, % \\\"Button\\\" row \\\"_\\\" m2, % thisPeg\\n\\tGrid[row,m2] := thisPeg\\n}\\nelse\\n{\\n\\tloop, % pegs.count()\\n\\t\\tif Radio%A_Index%\\n\\t\\t\\tGuiControl,, % A_GuiControl , % grid[m1, m2] := pegs[A_Index]\\n}\\nreturn\\n;-----------------------------------------------------------------------\\nSubmit:\\nif (grid[row].count()<4) || GameEnd\\n\\treturn\\n\\nGui, submit, NoHide\\nAns := [], FIP := [], inGoal := []\\nCIP := CNP := 0, KeyPeg := 1\\n\\nfor i, G in Goal\\n\\tinGoal[G] := (inGoal[G] ? inGoal[G] : 0) +1\\t\\t; save inGoal\\nloop, 4\\n\\tAns[A_Index] := Grid[row, A_Index]\\t\\t\\t; save Ans\\nfor i, A in Ans\\n\\tif (goal[A_Index] = A)\\n\\t\\tCIP++, FIP.push(i), inGoal[A]:=inGoal[A] -1\\t; Correct In Place, inGoal--\\nfor i, v in FIP\\n\\tAns.RemoveAt(v-i+1)\\t\\t\\t\\t\\t; remove Correct In Place from Answers\\nfor i, A in Ans\\n\\tif (inGoal[A] > 0)\\n\\t\\tCNP++, inGoal[A] := inGoal[A] -1\\t\\t; Correct Not in Place\\nloop % CIP\\n\\tGuiControl,, % \\\"KeyPeg\\\" row \\\"_\\\" KeyPeg++, % Chr(82)\\t; \\\"✔\\\"\\nloop % CNP\\n\\tGuiControl,, % \\\"KeyPeg\\\" row \\\"_\\\" KeyPeg++, % Chr(83)\\t; \\\"X\\\"\\n\\nif (CIP=4 || row=maxRows)\\n{\\n\\tloop 4\\n\\t\\tGuiControl,, Goal%A_Index%, % Goal[A_Index]\\n\\tMsgBox % CIP = 4 ? \\\"You Win\\\" : \\\"You lose\\\"\\n\\tGameEnd := true\\n}\\nRow++\\nreturn\\n;-----------------------------------------------------------------------\\nLAlt:: ; peak at solution (for troubleshooting purposes only!)\\nloop 4\\n\\tGuiControl,, Goal%A_Index%, % Goal[A_Index]\\nWhile GetKeyState(\\\"Lalt\\\", \\\"P\\\")\\n\\tcontinue\\nloop 4\\n\\tGuiControl,, Goal%A_Index%, % \\\"?\\\"\\nreturn\\n;-----------------------------------------------------------------------\\nResetMM:\\nGrid :=[], GameEnd:= false\\nloop, 4\\n{\\n\\tRandom, rnd, 1, % pegs.count()\\n\\tgoal[A_Index] := pegs[rnd]\\n\\tGuiControl,, Goal%A_Index%, ?\\n}\\n\\nloop, % maxRows\\n{\\n\\trow := maxRows - A_Index + 1\\n\\tloop 4\\n\\t{\\n\\t\\tcol := A_Index\\n\\t\\tGuiControl,, % \\\"KeyPeg\\\" row \\\"_\\\" col, % Chr(167)\\t; \\\"O\\\"\\n\\t\\tGuiControl,, % \\\"Button\\\" row \\\"_\\\" col\\n\\t}\\n}\\ngosub Decode\\nloop, 8\\n\\tGuiControl,, Radio%A_Index%, % pegs[A_Index]\\nreturn\\n;-----------------------------------------------------------------------\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <algorithm>\\n#include <ctime>\\n#include <string>\\n#include <vector>\\n\\ntypedef std::vector<char> vecChar;\\n\\nclass master {\\npublic:\\n master( size_t code_len, size_t clr_count, size_t guess_count, bool rpt ) {\\n std::string color = \\\"ABCDEFGHIJKLMNOPQRST\\\";\\n\\n if( code_len < 4 ) code_len = 4; else if( code_len > 10 ) code_len = 10;\\n if( !rpt && clr_count < code_len ) clr_count = code_len;\\n if( clr_count < 2 ) clr_count = 2; else if( clr_count > 20 ) clr_count = 20;\\n if( guess_count < 7 ) guess_count = 7; else if( guess_count > 20 ) guess_count = 20;\\n\\n codeLen = code_len; colorsCnt = clr_count; guessCnt = guess_count; repeatClr = rpt;\\n\\n for( size_t s = 0; s < colorsCnt; s++ ) {\\n colors.append( 1, color.at( s ) );\\n }\\n }\\n void play() {\\n bool win = false;\\n combo = getCombo();\\n\\n while( guessCnt ) {\\n showBoard();\\n if( checkInput( getInput() ) ) {\\n win = true;\\n break;\\n }\\n guessCnt--;\\n }\\n if( win ) {\\n std::cout << \\\"\\\\n\\\\n--------------------------------\\\\n\\\" <<\\n \\\"Very well done!\\\\nYou found the code: \\\" << combo <<\\n \\\"\\\\n--------------------------------\\\\n\\\\n\\\";\\n } else {\\n std::cout << \\\"\\\\n\\\\n--------------------------------\\\\n\\\" <<\\n \\\"I am sorry, you couldn't make it!\\\\nThe code was: \\\" << combo <<\\n \\\"\\\\n--------------------------------\\\\n\\\\n\\\";\\n }\\n }\\nprivate:\\n void showBoard() {\\n vecChar::iterator y;\\n for( int x = 0; x < guesses.size(); x++ ) {\\n std::cout << \\\"\\\\n--------------------------------\\\\n\\\";\\n std::cout << x + 1 << \\\": \\\";\\n for( y = guesses[x].begin(); y != guesses[x].end(); y++ ) {\\n std::cout << *y << \\\" \\\";\\n }\\n\\n std::cout << \\\" : \\\";\\n for( y = results[x].begin(); y != results[x].end(); y++ ) {\\n std::cout << *y << \\\" \\\";\\n }\\n\\n int z = codeLen - results[x].size();\\n if( z > 0 ) {\\n for( int x = 0; x < z; x++ ) std::cout << \\\"- \\\";\\n }\\n }\\n std::cout << \\\"\\\\n\\\\n\\\";\\n }\\n std::string getInput() {\\n std::string a;\\n while( true ) {\\n std::cout << \\\"Enter your guess (\\\" << colors << \\\"): \\\";\\n a = \\\"\\\"; std::cin >> a;\\n std::transform( a.begin(), a.end(), a.begin(), ::toupper );\\n if( a.length() > codeLen ) a.erase( codeLen );\\n bool r = true;\\n for( std::string::iterator x = a.begin(); x != a.end(); x++ ) {\\n if( colors.find( *x ) == std::string::npos ) {\\n r = false;\\n break;\\n }\\n }\\n if( r ) break;\\n }\\n return a;\\n }\\n bool checkInput( std::string a ) {\\n vecChar g;\\n for( std::string::iterator x = a.begin(); x != a.end(); x++ ) {\\n g.push_back( *x );\\n }\\n guesses.push_back( g );\\n\\n int black = 0, white = 0;\\n std::vector<bool> gmatch( codeLen, false );\\n std::vector<bool> cmatch( codeLen, false );\\n\\n for( int i = 0; i < codeLen; i++ ) {\\n if( a.at( i ) == combo.at( i ) ) {\\n gmatch[i] = true;\\n cmatch[i] = true;\\n black++;\\n }\\n }\\n\\n for( int i = 0; i < codeLen; i++ ) {\\n if (gmatch[i]) continue;\\n for( int j = 0; j < codeLen; j++ ) {\\n if (i == j || cmatch[j]) continue;\\n if( a.at( i ) == combo.at( j ) ) {\\n cmatch[j] = true;\\n white++;\\n break;\\n }\\n }\\n }\\n\\n vecChar r;\\n for( int b = 0; b < black; b++ ) r.push_back( 'X' );\\n for( int w = 0; w < white; w++ ) r.push_back( 'O' );\\n results.push_back( r );\\n\\n return ( black == codeLen );\\n }\\n std::string getCombo() {\\n std::string c, clr = colors;\\n int l, z;\\n\\n for( size_t s = 0; s < codeLen; s++ ) {\\n z = rand() % ( int )clr.length();\\n c.append( 1, clr[z] );\\n if( !repeatClr ) clr.erase( z, 1 );\\n }\\n return c;\\n }\\n\\n size_t codeLen, colorsCnt, guessCnt;\\n bool repeatClr;\\n std::vector<vecChar> guesses, results;\\n std::string colors, combo;\\n};\\n\\nint main( int argc, char* argv[] ) {\\n srand( unsigned( time( 0 ) ) );\\n master m( 4, 8, 12, false );\\n m.play();\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"col[] = [ 802 990 171 229 950 808 ]\\nlen code[] 4\\nlen guess[] 4\\n#\\nsubr init_vars\\n row = 0\\n.\\nproc draw_rate r black white . .\\n for j range0 2\\n for c range0 2\\n move c * 3.5 + 71.5 r * 11.5 + 9.4 - j * 3.5\\n if black > 0\\n color 000\\n circle 1.4\\n black -= 1\\n elif white > 0\\n color 999\\n circle 1.4\\n white -= 1\\n else\\n color 310\\n circle 0.7\\n .\\n .\\n .\\n.\\nproc show_code . .\\n color 531\\n move 22 92\\n rect 46 8\\n for i to 4\\n move i * 8 + 20 97\\n color col[code[i]]\\n circle 2\\n .\\n.\\nproc draw_guess . .\\n for c to 4\\n move c * 12 + 8 row * 11.5 + 7.5\\n color col[guess[c]]\\n circle 3.8\\n .\\n.\\nproc next_row . .\\n color 420\\n linewidth 11\\n move 17 row * 11.5 + 7.5\\n line 60 row * 11.5 + 7.5\\n draw_guess\\n move 73.5 row * 11.5 + 7.5\\n color 310\\n circle 5.0\\n color 753\\n move 71.5 row * 11.5 + 5\\n textsize 7\\n text \\\"✓\\\"\\n.\\nproc rate . .\\n move 73.5 row * 11.5 + 7.5\\n color 531\\n circle 5.2\\n c[] = code[]\\n g[] = guess[]\\n for i to 4\\n if c[i] = g[i]\\n black += 1\\n c[i] = -1\\n g[i] = -2\\n .\\n .\\n for i to 4\\n for j to 4\\n if c[i] = g[j]\\n white += 1\\n c[i] = -1\\n g[j] = -2\\n .\\n .\\n .\\n draw_rate row black white\\n color 531\\n linewidth 12\\n move 17 row * 11.5 + 7.5\\n line 60 row * 11.5 + 7.5\\n draw_guess\\n row += 1\\n if black = 4\\n row = 8\\n .\\n if row = 8\\n show_code\\n timer 2\\n else\\n next_row\\n .\\n.\\non timer\\n row = -2\\n.\\nproc new . .\\n init_vars\\n for i to 4\\n code[i] = randint 6\\n .\\n color 531\\n move 10 10\\n rect 70 80\\n linewidth 10\\n move 5 95\\n line 5 5\\n line 85 5\\n line 85 95\\n line 5 95\\n color 310\\n linewidth 7\\n move 28 96.5\\n line 58 96.5\\n move 30 95\\n color 864\\n textsize 4\\n text \\\"Mastermind\\\"\\n color 310\\n linewidth 0.5\\n move 10 90\\n line 10 4\\n move 67 90\\n line 67 4\\n move 80 90\\n line 80 4\\n for r range0 8\\n for c range0 4\\n move c * 12 + 20 r * 11.5 + 7.5\\n circle 2\\n .\\n draw_rate r 0 0\\n .\\n guess[1] = 1\\n guess[2] = 1\\n guess[3] = 2\\n guess[4] = 2\\n next_row\\n.\\nproc do_move . .\\n c = (mouse_x - 15) div 12\\n guess[c + 1] = guess[c + 1] mod 6 + 1\\n draw_guess\\n.\\non mouse_down\\n if row = -2\\n new\\n elif mouse_y > row * 11.5 + 0.5 and mouse_y < row * 11.5 + 10.5 and row < 8\\n if mouse_x > 15 and mouse_x < 61\\n do_move\\n elif mouse_x > 67 and mouse_x < 80\\n rate\\n .\\n .\\n.\\nnew\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"'--- Declaration of global variables ---\\nDim As String colors(1 To 4) => {\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"D\\\"}\\nDim Shared As Integer nr, ub', numlet=4, lencod=4\\nDim Shared As String*4 master, pz\\nub = Ubound(colors)\\nnr = 0\\n\\n'--- SUBroutines and FUNCtions ---\\nSub Encabezado\\n Dim As String dup\\n Color 11: Print \\\"Welcome to Mastermind\\\"\\n Print \\\"=====================\\\" + Chr(13) + Chr(10) : Color 15\\n Print \\\"You will need to guess a random code.\\\"\\n Print \\\"For each guess, you will receive a hint:\\\"\\n Print \\\"X - denotes a correct letter,\\\"\\n Print \\\"O - denotes a letter in the original\\\"\\n Print \\\" string but a different position.\\\"\\n Print \\\"You have 12 attempts.\\\"\\n Print \\\"Duplicates are not allowed.\\\" + Chr(10)\\n Print \\\"Good luck!\\\" + Chr(10) + Chr(10) : Color 7\\nEnd Sub\\n\\nSub showresult(test() As String, place1 As Byte, place2 As Byte, place3 As Byte)\\n Dim As Integer r, n1, n2, n3\\n Print Using \\\"##: \\\"; nr;\\n For r = 1 To Ubound(test)\\n Print test(r);\\n Next R\\n Print \\\" : \\\";\\n For n1 = 1 To place1\\n Print \\\"X\\\"; \\\" \\\";\\n Next N1\\n For n2 = 1 To place2\\n Print \\\"O\\\"; \\\" \\\";\\n Next N2\\n For n3 = 1 To place3\\n Print \\\"-\\\"; \\\" \\\";\\n Next N3\\n Print : Print\\nEnd Sub\\n\\nSub Inicio\\n Dim As Integer mind(ub), rands(ub)\\n Dim As Integer n, aleat\\n Dim As Boolean repeat = false\\n\\n For n = 1 To ub\\n While true\\n aleat = (Rnd * (ub-1)) + 1\\n If rands(aleat) <> 1 Then\\n mind(n) = aleat\\n rands(aleat) = 1\\n Exit While\\n End If\\n Wend\\n Next n\\n\\n For n = 1 To ub\\n Mid(master,n,1) = Chr(64 + mind(n))\\n pz &= Chr(64 + mind(n))\\n Next n\\nEnd Sub\\n\\n\\n'--- Main Program ---\\nRandomize Timer\\nCls\\nDim As Integer guesses = 12\\nEncabezado\\nInicio\\nColor 15: Print pz : Color 7\\nDo\\n Dim As Integer n, p, d, x, posic\\n Dim As Integer places(1 To 2), place1, place2, place3\\n Dim As String*4 testbegin\\n Dim As String test(ub), mastertemp, tmp\\n Dim As Boolean flag = True\\n\\n For p = 1 To Ubound(places)\\n places(p) = 0\\n Next p\\n nr += 1\\n Input \\\"Your guess (ABCD)? \\\" , testbegin\\n For d = 1 To Ubound(test)\\n test(d) = Mid(testbegin,d,1)\\n Next d\\n\\n For n = 1 To Ubound(test)\\n If Ucase(test(n)) <> Mid(master,n,1) Then flag = False\\n Next n\\n If flag = True Then\\n Color 10: Print !\\\"\\\\nWell done! You guess correctly.\\\" : Sleep : Exit Do\\n Else\\n For x = 1 To Len(master)\\n If Ucase(test(x)) = Mid(master,x,1) Then places(1) += 1\\n Next x\\n mastertemp = master\\n For p = 1 To Ubound(test)\\n posic = Instr(mastertemp, Ucase(test(p)))\\n If posic > 0 Then\\n tmp = mastertemp\\n mastertemp = Left(tmp,posic-1) + Mid(tmp, posic+1, Len(tmp)-1)\\n places(2) += 1\\n End If\\n Next p\\n End If\\n place1 = places(1)\\n place2 = places(2) - place1\\n place3 = Len(master) - (place1 + place2)\\n showresult(test(), place1, place2, place3)\\nLoop Until nr = guesses\\nColor 14: Print \\\"The correct combination was: \\\"; pz\\nColor 7: Print !\\\"\\\\nEnd of game\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"errors\\\"\\n\\t\\\"flag\\\"\\n\\t\\\"fmt\\\"\\n\\t\\\"log\\\"\\n\\t\\\"math/rand\\\"\\n\\t\\\"strings\\\"\\n\\t\\\"time\\\"\\n)\\n\\nfunc main() {\\n\\tlog.SetPrefix(\\\"mastermind: \\\")\\n\\tlog.SetFlags(0)\\n\\tcolours := flag.Int(\\\"colours\\\", 6, \\\"number of colours to use (2-20)\\\")\\n\\tflag.IntVar(colours, \\\"colors\\\", 6, \\\"alias for colours\\\")\\n\\tholes := flag.Int(\\\"holes\\\", 4, \\\"number of holes (the code length, 4-10)\\\")\\n\\tguesses := flag.Int(\\\"guesses\\\", 12, \\\"number of guesses allowed (7-20)\\\")\\n\\tunique := flag.Bool(\\\"unique\\\", false, \\\"disallow duplicate colours in the code\\\")\\n\\tflag.Parse()\\n\\n\\trand.Seed(time.Now().UnixNano())\\n\\tm, err := NewMastermind(*colours, *holes, *guesses, *unique)\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\terr = m.Play()\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n}\\n\\ntype mastermind struct {\\n\\tcolours int\\n\\tholes int\\n\\tguesses int\\n\\tunique bool\\n\\n\\tcode string\\n\\tpast []string // history of guesses\\n\\tscores []string // history of scores\\n}\\n\\nfunc NewMastermind(colours, holes, guesses int, unique bool) (*mastermind, error) {\\n\\tif colours < 2 || colours > 20 {\\n\\t\\treturn nil, errors.New(\\\"colours must be between 2 and 20 inclusive\\\")\\n\\t}\\n\\tif holes < 4 || holes > 10 {\\n\\t\\treturn nil, errors.New(\\\"holes must be between 4 and 10 inclusive\\\")\\n\\t}\\n\\tif guesses < 7 || guesses > 20 {\\n\\t\\treturn nil, errors.New(\\\"guesses must be between 7 and 20 inclusive\\\")\\n\\t}\\n\\tif unique && holes > colours {\\n\\t\\treturn nil, errors.New(\\\"holes must be > colours when using unique\\\")\\n\\t}\\n\\n\\treturn &mastermind{\\n\\t\\tcolours: colours,\\n\\t\\tholes: holes,\\n\\t\\tguesses: guesses,\\n\\t\\tunique: unique,\\n\\t\\tpast: make([]string, 0, guesses),\\n\\t\\tscores: make([]string, 0, guesses),\\n\\t}, nil\\n}\\n\\nfunc (m *mastermind) Play() error {\\n\\tm.generateCode()\\n\\tfmt.Printf(\\\"A set of %s has been selected as the code.\\\\n\\\", m.describeCode(m.unique))\\n\\tfmt.Printf(\\\"You have %d guesses.\\\\n\\\", m.guesses)\\n\\tfor len(m.past) < m.guesses {\\n\\t\\tguess, err := m.inputGuess()\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tfmt.Println()\\n\\t\\tm.past = append(m.past, guess)\\n\\t\\tstr, won := m.scoreString(m.score(guess))\\n\\t\\tif won {\\n\\t\\t\\tplural := \\\"es\\\"\\n\\t\\t\\tif len(m.past) == 1 {\\n\\t\\t\\t\\tplural = \\\"\\\"\\n\\t\\t\\t}\\n\\t\\t\\tfmt.Printf(\\\"You found the code in %d guess%s.\\\\n\\\", len(m.past), plural)\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\tm.scores = append(m.scores, str)\\n\\t\\tm.printHistory()\\n\\t\\tfmt.Println()\\n\\t}\\n\\tfmt.Printf(\\\"You are out of guesses. The code was %s.\\\\n\\\", m.code)\\n\\treturn nil\\n}\\n\\nconst charset = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\nconst blacks = \\\"XXXXXXXXXX\\\"\\nconst whites = \\\"OOOOOOOOOO\\\"\\nconst nones = \\\"----------\\\"\\n\\nfunc (m *mastermind) describeCode(unique bool) string {\\n\\tustr := \\\"\\\"\\n\\tif unique {\\n\\t\\tustr = \\\" unique\\\"\\n\\t}\\n\\treturn fmt.Sprintf(\\\"%d%s letters (from 'A' to %q)\\\",\\n\\t\\tm.holes, ustr, charset[m.colours-1],\\n\\t)\\n}\\n\\nfunc (m *mastermind) printHistory() {\\n\\tfor i, g := range m.past {\\n\\t\\tfmt.Printf(\\\"-----%s---%[1]s--\\\\n\\\", nones[:m.holes])\\n\\t\\tfmt.Printf(\\\"%2d: %s : %s\\\\n\\\", i+1, g, m.scores[i])\\n\\t}\\n}\\n\\nfunc (m *mastermind) generateCode() {\\n\\tcode := make([]byte, m.holes)\\n\\tif m.unique {\\n\\t\\tp := rand.Perm(m.colours)\\n\\t\\tfor i := range code {\\n\\t\\t\\tcode[i] = charset[p[i]]\\n\\t\\t}\\n\\t} else {\\n\\t\\tfor i := range code {\\n\\t\\t\\tcode[i] = charset[rand.Intn(m.colours)]\\n\\t\\t}\\n\\t}\\n\\tm.code = string(code)\\n\\t//log.Printf(\\\"code is %q\\\", m.code)\\n}\\n\\nfunc (m *mastermind) inputGuess() (string, error) {\\n\\tvar input string\\n\\tfor {\\n\\t\\tfmt.Printf(\\\"Enter guess #%d: \\\", len(m.past)+1)\\n\\t\\tif _, err := fmt.Scanln(&input); err != nil {\\n\\t\\t\\treturn \\\"\\\", err\\n\\t\\t}\\n\\t\\tinput = strings.ToUpper(strings.TrimSpace(input))\\n\\t\\tif m.validGuess(input) {\\n\\t\\t\\treturn input, nil\\n\\t\\t}\\n\\t\\tfmt.Printf(\\\"A guess must consist of %s.\\\\n\\\", m.describeCode(false))\\n\\t}\\n}\\n\\nfunc (m *mastermind) validGuess(input string) bool {\\n\\tif len(input) != m.holes {\\n\\t\\treturn false\\n\\t}\\n\\tfor i := 0; i < len(input); i++ {\\n\\t\\tc := input[i]\\n\\t\\tif c < 'A' || c > charset[m.colours-1] {\\n\\t\\t\\treturn false\\n\\t\\t}\\n\\t}\\n\\treturn true\\n}\\n\\nfunc (m *mastermind) score(guess string) (black, white int) {\\n\\tscored := make([]bool, m.holes)\\n\\tfor i := 0; i < len(guess); i++ {\\n\\t\\tif guess[i] == m.code[i] {\\n\\t\\t\\tblack++\\n\\t\\t\\tscored[i] = true\\n\\t\\t}\\n\\t}\\n\\tfor i := 0; i < len(guess); i++ {\\n\\t\\tif guess[i] == m.code[i] {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tfor j := 0; j < len(m.code); j++ {\\n\\t\\t\\tif i != j && !scored[j] && guess[i] == m.code[j] {\\n\\t\\t\\t\\twhite++\\n\\t\\t\\t\\tscored[j] = true\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn\\n}\\n\\nfunc (m *mastermind) scoreString(black, white int) (string, bool) {\\n\\tnone := m.holes - black - white\\n\\treturn blacks[:black] + whites[:white] + nones[:none], black == m.holes\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.Collections;\\nimport java.util.List;\\nimport java.util.Scanner;\\nimport java.util.concurrent.ThreadLocalRandom;\\n\\npublic final class MastermindTask {\\n\\n\\tpublic static void main(String[] aArgs) {\\n\\t Mastermind mastermind = new Mastermind(4, 8, 12, false);\\n\\t mastermind.play();\\n\\t}\\n\\t\\n\\tprivate static final class Mastermind {\\n\\t\\t\\n\\t public Mastermind(int aCodeLength, int aLetterCount, int aGuessCount, boolean aRepeatLetters) {\\n\\t if ( aCodeLength < 4 ) {\\n\\t \\taCodeLength = 4;\\n\\t } else if ( aCodeLength > 10 ) {\\n\\t \\taCodeLength = 10;\\n\\t }\\n\\t\\n\\t if ( aLetterCount < 2 ) {\\n\\t \\taLetterCount = 2;\\n\\t } else if ( aLetterCount > 20 ) {\\n\\t \\taLetterCount = 20;\\n\\t }\\n\\t\\n\\t if ( aGuessCount < 7 ) {\\n\\t \\taGuessCount = 7;\\n\\t } else if ( aGuessCount > 20 ) {\\n\\t \\taGuessCount = 20;\\n\\t }\\t\\n\\t\\n\\t if ( ! aRepeatLetters && aLetterCount < aCodeLength ) {\\n\\t \\taLetterCount = aCodeLength;\\n\\t }\\n\\t\\n\\t codeLength = aCodeLength;\\n\\t letterCount = aLetterCount;\\n\\t guessCount = aGuessCount;\\n\\t repeatLetters = aRepeatLetters;\\n\\n\\t String validLetters = \\\"ABCDEFGHIJKLMNOPQRST\\\";\\n\\t letters = \\\"\\\";\\n\\t for ( int i = 0; i < letterCount; i++ ) {\\n\\t letters += validLetters.charAt(i);\\n\\t }\\n\\t }\\n\\t\\n\\t public void play() {\\n\\t boolean playerWin = false;\\n\\t goal = createGoal();\\n\\n\\t while ( guessCount > 0 && ! playerWin ) {\\n\\t showBoard();\\n\\t if ( checkUserInput(obtainUserGuess()) ) {\\n\\t playerWin = true;\\n\\t reader.close();\\n\\t }\\n\\t guessCount--;\\n\\t }\\n\\t\\n\\t if ( playerWin ) {\\n\\t System.out.println(newLine + newLine + \\\"--------------------------------\\\" + newLine +\\n\\t \\\"Very well done! \\\" + newLine + \\\"You found the code: \\\" + goal +\\n\\t newLine + \\\"--------------------------------\\\" + newLine + newLine);\\n\\t } else {\\n\\t System.out.println(newLine + newLine + \\\"--------------------------------\\\" + newLine +\\n\\t \\\"I'm sorry, you couldn't make it! \\\" + newLine + \\\"The code was: \\\" + goal +\\n\\t newLine + \\\"--------------------------------\\\" + newLine + newLine);\\n\\t }\\n\\t }\\n\\t\\n\\t private void showBoard() {\\n\\t for ( int i = 0; i < guesses.size(); i++ ) {\\n\\t System.out.print(newLine + \\\"--------------------------------\\\" + newLine);\\n\\t System.out.print(( i + 1 ) + \\\": \\\");\\n\\t for ( char ch : guesses.get(i) ) {\\n\\t System.out.print(ch + \\\" \\\");\\n\\t }\\n\\n\\t System.out.print(\\\" : \\\");\\n\\t for ( char ch : results.get(i) ) {\\n\\t System.out.print(ch + \\\" \\\");\\n\\t }\\n\\n\\t final int errorCount = codeLength - results.get(i).size();\\n for ( int j = 0; j < errorCount; j++ ) {\\n \\tSystem.out.print(\\\"- \\\");\\n }\\n\\t }\\n\\t System.out.print(newLine + newLine);\\n\\t }\\t\\n\\t\\n\\t private String obtainUserGuess() {\\n\\t String result = \\\"\\\";\\n\\t do {\\n\\t \\tSystem.out.print(\\\"Enter your guess (\\\" + letters + \\\"): \\\");\\t\\n\\t \\tresult = reader.nextLine().toUpperCase();\\n\\t \\tif ( result.length() != codeLength ) {\\n\\t \\t\\tSystem.out.println(\\\"Please try again, your guess should have \\\" + codeLength + \\\" letters\\\");\\n\\t \\t}\\t \\t\\n\\t } while ( result.length() != codeLength );\\t\\n\\t return result;\\n\\t }\\n\\t\\n\\t private boolean checkUserInput(String aUserInput) {\\n\\t List<Character> userInputCharacters = new ArrayList<Character>();\\n\\t for ( char ch : aUserInput.toCharArray() ) {\\n\\t userInputCharacters.add(ch);\\n\\t }\\n\\t guesses.add(userInputCharacters);\\n\\t\\n\\t int xCount = 0;\\n\\t int oCount = 0;\\n\\t List<Boolean> fullMatches = new ArrayList<Boolean>(Collections.nCopies(codeLength, false));\\n\\t List<Boolean> partialMatches = new ArrayList<Boolean>(Collections.nCopies(codeLength, false));\\n\\t\\n\\t for ( int i = 0; i < codeLength; i++ ) {\\n\\t if ( aUserInput.charAt(i) == goal.charAt(i) ) {\\n\\t fullMatches.set(i, true);\\n\\t partialMatches.set(i, true);\\n\\t xCount++;\\n\\t }\\n\\t }\\n\\t\\n\\t for ( int i = 0; i < codeLength; i++ ) {\\n\\t if ( fullMatches.get(i) ) {\\n\\t \\tcontinue;\\n\\t }\\n\\t for ( int j = 0; j < codeLength; j++ ) {\\n\\t if ( i == j || partialMatches.get(j) ) {\\n\\t \\tcontinue;\\n\\t }\\n\\t if ( aUserInput.charAt(i) == goal.charAt(j) ) {\\n\\t partialMatches.set(j, true);\\n\\t oCount++;\\n\\t break;\\n\\t }\\n\\t }\\n\\t }\\n\\t\\n\\t List<Character> nextResult = new ArrayList<Character>();\\n\\t for ( int i = 0; i < xCount; i++ ) {\\n\\t \\tnextResult.add('X');\\n\\t }\\n\\t for ( int i = 0; i < oCount; i++ ) {\\n\\t \\tnextResult.add('O');\\n\\t }\\n\\t results.add(nextResult);\\n\\n\\t return xCount == codeLength;\\n\\t }\\n\\t\\n\\t private String createGoal() {\\n\\t String result = \\\"\\\";\\n\\t String lettersCopy = letters;\\n\\n\\t for ( int i = 0; i < codeLength; i++ ) {\\n\\t final int index = random.nextInt(lettersCopy.length());\\n\\t result += lettersCopy.charAt(index);\\n\\t if ( ! repeatLetters ) {\\n\\t \\tlettersCopy = lettersCopy.substring(0, index) + lettersCopy.substring(index + 1);\\n\\t }\\n\\t }\\n\\t return result;\\n\\t }\\n\\t\\n\\t private int codeLength, letterCount, guessCount;\\n\\t private String letters, goal;\\n\\t private boolean repeatLetters;\\n\\t private Scanner reader = new Scanner(System.in);\\n\\t private List<List<Character>> guesses = new ArrayList<List<Character>>();\\n\\t private List<List<Character>> results = new ArrayList<List<Character>>(); \\t\\n\\t\\n\\t private final ThreadLocalRandom random = ThreadLocalRandom.current();\\n\\t private final String newLine = System.lineSeparator();\\n\\t\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"class Mastermind {\\n constructor() {\\n this.colorsCnt;\\n this.rptColors;\\n this.codeLen;\\n this.guessCnt;\\n this.guesses;\\n this.code;\\n this.selected;\\n this.game_over;\\n this.clear = (el) => {\\n while (el.hasChildNodes()) {\\n el.removeChild(el.firstChild);\\n }\\n };\\n this.colors = [\\\"🤡\\\", \\\"👹\\\", \\\"👺\\\", \\\"👻\\\", \\\"👽\\\", \\\"👾\\\", \\\"🤖\\\", \\\"🐵\\\", \\\"🐭\\\",\\n \\\"🐸\\\", \\\"🎃\\\", \\\"🤠\\\", \\\"☠️\\\", \\\"🦄\\\", \\\"🦇\\\", \\\"🛸\\\", \\\"🎅\\\", \\\"👿\\\", \\\"🐲\\\", \\\"🦋\\\"\\n ];\\n }\\n\\n newGame() {\\n this.selected = null;\\n this.guessCnt = parseInt(document.getElementById(\\\"gssCnt\\\").value);\\n this.colorsCnt = parseInt(document.getElementById(\\\"clrCnt\\\").value);\\n this.codeLen = parseInt(document.getElementById(\\\"codeLen\\\").value);\\n if (this.codeLen > this.colorsCnt) {\\n document.getElementById(\\\"rptClr\\\").selectedIndex = 1;\\n }\\n this.rptColors = document.getElementById(\\\"rptClr\\\").value === \\\"yes\\\";\\n this.guesses = 0;\\n this.game_over = false;\\n const go = document.getElementById(\\\"gameover\\\");\\n go.innerText = \\\"\\\";\\n go.style.visibility = \\\"hidden\\\";\\n this.clear(document.getElementById(\\\"code\\\"));\\n this.buildPalette();\\n this.buildPlayField();\\n }\\n\\n buildPalette() {\\n const pal = document.getElementById(\\\"palette\\\"),\\n z = this.colorsCnt / 5,\\n h = Math.floor(z) != z ? Math.floor(z) + 1 : z;\\n this.clear(pal);\\n pal.style.height = `${44 * h + 3 * h}px`;\\n const clrs = [];\\n for (let c = 0; c < this.colorsCnt; c++) {\\n clrs.push(c);\\n const b = document.createElement(\\\"div\\\");\\n b.className = \\\"bucket\\\";\\n b.clr = c;\\n b.innerText = this.colors[c];\\n b.addEventListener(\\\"click\\\", () => {\\n this.palClick(b);\\n });\\n pal.appendChild(b);\\n }\\n this.code = [];\\n while (this.code.length < this.codeLen) {\\n const r = Math.floor(Math.random() * clrs.length);\\n this.code.push(clrs[r]);\\n if (!this.rptColors) {\\n clrs.splice(r, 1);\\n }\\n }\\n }\\n\\n buildPlayField() {\\n const brd = document.getElementById(\\\"board\\\");\\n this.clear(brd);\\n const w = 49 * this.codeLen + 7 * this.codeLen + 5;\\n brd.active = 0;\\n brd.style.width = `${w}px`;\\n document.querySelector(\\\".column\\\").style.width = `${w + 20}px`;\\n this.addGuessLine(brd);\\n }\\n\\n addGuessLine(brd) {\\n const z = document.createElement(\\\"div\\\");\\n z.style.clear = \\\"both\\\";\\n brd.appendChild(z);\\n brd.active += 10;\\n for (let c = 0; c < this.codeLen; c++) {\\n const d = document.createElement(\\\"div\\\");\\n d.className = \\\"bucket\\\";\\n d.id = `brd${brd.active+ c}`;\\n d.clr = -1;\\n d.addEventListener(\\\"click\\\", () => {\\n this.playClick(d);\\n })\\n brd.appendChild(d);\\n }\\n }\\n\\n palClick(bucket) {\\n if (this.game_over) return;\\n if (null === this.selected) {\\n bucket.classList.add(\\\"selected\\\");\\n this.selected = bucket;\\n return;\\n }\\n if (this.selected !== bucket) {\\n this.selected.classList.remove(\\\"selected\\\");\\n bucket.classList.add(\\\"selected\\\");\\n this.selected = bucket;\\n return;\\n }\\n this.selected.classList.remove(\\\"selected\\\");\\n this.selected = null;\\n }\\n\\n vibrate() {\\n const brd = document.getElementById(\\\"board\\\");\\n let timerCnt = 0;\\n const exp = setInterval(() => {\\n if ((timerCnt++) > 60) {\\n clearInterval(exp);\\n brd.style.top = \\\"0px\\\";\\n brd.style.left = \\\"0px\\\";\\n }\\n let x = Math.random() * 4,\\n y = Math.random() * 4;\\n if (Math.random() < .5) x = -x;\\n if (Math.random() < .5) y = -y;\\n brd.style.top = y + \\\"px\\\";\\n brd.style.left = x + \\\"px\\\";\\n }, 10);\\n }\\n\\n playClick(bucket) {\\n if (this.game_over) return;\\n if (this.selected) {\\n bucket.innerText = this.selected.innerText;\\n bucket.clr = this.selected.clr;\\n } else {\\n this.vibrate();\\n }\\n }\\n\\n check() {\\n if (this.game_over) return;\\n let code = [];\\n const brd = document.getElementById(\\\"board\\\");\\n for (let b = 0; b < this.codeLen; b++) {\\n const h = document.getElementById(`brd${brd.active + b}`).clr;\\n if (h < 0) {\\n this.vibrate();\\n return;\\n }\\n code.push(h);\\n }\\n this.guesses++;\\n if (this.compareCode(code)) {\\n this.gameOver(true);\\n return;\\n }\\n if (this.guesses >= this.guessCnt) {\\n this.gameOver(false);\\n return;\\n }\\n this.addGuessLine(brd);\\n }\\n\\n compareCode(code) {\\n let black = 0,\\n white = 0,\\n b_match = new Array(this.codeLen).fill(false),\\n w_match = new Array(this.codeLen).fill(false);\\n for (let i = 0; i < this.codeLen; i++) {\\n if (code[i] === this.code[i]) {\\n b_match[i] = true;\\n w_match[i] = true;\\n black++;\\n }\\n }\\n for (let i = 0; i < this.codeLen; i++) {\\n if (b_match[i]) continue;\\n for (let j = 0; j < this.codeLen; j++) {\\n if (i == j || w_match[j]) continue;\\n if (code[i] === this.code[j]) {\\n w_match[j] = true;\\n white++;\\n break;\\n }\\n }\\n }\\n const brd = document.getElementById(\\\"board\\\");\\n let d;\\n for (let i = 0; i < black; i++) {\\n d = document.createElement(\\\"div\\\");\\n d.className = \\\"pin\\\";\\n d.style.backgroundColor = \\\"#a00\\\";\\n brd.appendChild(d);\\n }\\n for (let i = 0; i < white; i++) {\\n d = document.createElement(\\\"div\\\");\\n d.className = \\\"pin\\\";\\n d.style.backgroundColor = \\\"#eee\\\";\\n brd.appendChild(d);\\n }\\n return (black == this.codeLen);\\n }\\n\\n gameOver(win) {\\n if (this.game_over) return;\\n this.game_over = true;\\n const cd = document.getElementById(\\\"code\\\");\\n for (let c = 0; c < this.codeLen; c++) {\\n const d = document.createElement(\\\"div\\\");\\n d.className = \\\"bucket\\\";\\n d.innerText = this.colors[this.code[c]];\\n cd.appendChild(d);\\n }\\n const go = document.getElementById(\\\"gameover\\\");\\n go.style.visibility = \\\"visible\\\";\\n go.innerText = win ? \\\"GREAT!\\\" : \\\"YOU FAILED!\\\";\\n const i = setInterval(() => {\\n go.style.visibility = \\\"hidden\\\";\\n clearInterval(i);\\n }, 3000);\\n }\\n}\\nconst mm = new Mastermind();\\ndocument.getElementById(\\\"newGame\\\").addEventListener(\\\"click\\\", () => {\\n mm.newGame()\\n});\\ndocument.getElementById(\\\"giveUp\\\").addEventListener(\\\"click\\\", () => {\\n mm.gameOver();\\n});\\ndocument.getElementById(\\\"check\\\").addEventListener(\\\"click\\\", () => {\\n mm.check()\\n});\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"using Gtk, Colors, Cairo, Graphics\\n\\nstruct Guess\\n code::Vector{Color}\\n guess::Vector{Color}\\n hint::Vector{Color}\\nend\\n\\nfunction Guess(code, guess)\\n len = length(code)\\n hints = fill(colorant\\\"gray\\\", len) # gray default\\n for (i, g) in enumerate(guess), (j, c) in enumerate(code)\\n if g == c\\n if i == j\\n hints[i] = colorant\\\"black\\\"\\n elseif hints[i] != colorant\\\"black\\\"\\n hints[i] = colorant\\\"white\\\"\\n end\\n end\\n end\\n g = Guess([c for c in code], [c for c in guess], [c for c in hints])\\nend\\n\\ntovec(guess) = [x for x in [guess.code; guess.guess; guess.hint]]\\n\\nfunction mastermindapp()\\n allu(s) = length(unique(s)) == length(s)\\n ccode(c, n, rok) = while true a = rand(c, n); if rok || allu(a) return a end end\\n\\n numcolors, codelength, maxguesses, allowrep, gameover = 10, 4, 10, false, false\\n colors = distinguishable_colors(numcolors)\\n code = ccode(colors, numcolors, allowrep)\\n guesshistory = Vector{Guess}()\\n\\n win = GtkWindow(\\\"Mastermind Game\\\", 900, 750) |> (GtkFrame() |> (box = GtkBox(:v)))\\n settingsbox = GtkBox(:h)\\n playtoolbar = GtkToolbar()\\n\\n setcolors = GtkScale(false, 4:20)\\n set_gtk_property!(setcolors, :hexpand, true)\\n adj = GtkAdjustment(setcolors)\\n set_gtk_property!(adj, :value, 10)\\n clabel = GtkLabel(\\\"Number of Colors\\\")\\n\\n setcodelength = GtkScale(false, 4:10)\\n set_gtk_property!(setcodelength, :hexpand, true)\\n adj = GtkAdjustment(setcodelength)\\n set_gtk_property!(adj, :value, 4)\\n slabel = GtkLabel(\\\"Code Length\\\")\\n\\n setnumguesses = GtkScale(false, 4:40)\\n set_gtk_property!(setnumguesses, :hexpand, true)\\n adj = GtkAdjustment(setnumguesses)\\n set_gtk_property!(adj, :value, 10)\\n nlabel = GtkLabel(\\\"Max Guesses\\\")\\n\\n allowrepeatcolor = GtkScale(false, 0:1)\\n set_gtk_property!(allowrepeatcolor, :hexpand, true)\\n rlabel = GtkLabel(\\\"Allow Repeated Colors (0 = No)\\\")\\n\\n newgame = GtkToolButton(\\\"New Game\\\")\\n set_gtk_property!(newgame, :label, \\\"New Game\\\")\\n set_gtk_property!(newgame, :is_important, true)\\n\\n tryguess = GtkToolButton(\\\"Submit Current Guess\\\")\\n set_gtk_property!(tryguess, :label, \\\"Submit Current Guess\\\")\\n set_gtk_property!(tryguess, :is_important, true)\\n\\n eraselast = GtkToolButton(\\\"Erase Last (Unsubmitted) Pick\\\")\\n set_gtk_property!(eraselast, :label, \\\"Erase Last (Unsubmitted) Pick\\\")\\n set_gtk_property!(eraselast, :is_important, true)\\n\\n map(w->push!(settingsbox, w),[clabel, setcolors, slabel, setcodelength,\\n nlabel, setnumguesses, rlabel, allowrepeatcolor])\\n map(w->push!(playtoolbar, w),[newgame, tryguess, eraselast])\\n\\n scrwin = GtkScrolledWindow()\\n can = GtkCanvas()\\n set_gtk_property!(can, :expand, true)\\n map(w -> push!(box, w),[settingsbox, playtoolbar, scrwin])\\n push!(scrwin, can)\\n\\n currentguess = RGB[]\\n guessesused = 0\\n colorpositions = Point[]\\n\\n function newgame!(w)\\n empty!(guesshistory)\\n\\n numcolors = Int(GAccessor.value(setcolors))\\n codelength = Int(GAccessor.value(setcodelength))\\n maxguesses = Int(GAccessor.value(setnumguesses))\\n allowrep = Int(GAccessor.value(allowrepeatcolor))\\n\\n colors = distinguishable_colors(numcolors)\\n code = ccode(colors, codelength, allowrep == 1)\\n empty!(currentguess)\\n currentneeded = codelength\\n guessesused = 0\\n gameover = false\\n draw(can)\\n end\\n signal_connect(newgame!, newgame, :clicked)\\n\\n function saywon!()\\n warn_dialog(\\\"You have WON the game!\\\", win)\\n gameover = true\\n end\\n\\n function outofguesses!()\\n warn_dialog(\\\"You have Run out of moves! Game over.\\\", win)\\n gameover = true\\n end\\n\\n can.mouse.button1press = @guarded (widget, event) -> begin\\n if !gameover && (i = findfirst(p ->\\n sqrt((p.x - event.x)^2 + (p.y - event.y)^2) < 20,\\n colorpositions)) != nothing\\n if length(currentguess) < codelength\\n if allowrep == 0 && !allu(currentguess)\\n warn_dialog(\\\"Please erase the duplicate color.\\\", win)\\n else\\n push!(currentguess, colors[i])\\n draw(can)\\n end\\n else\\n warn_dialog(\\\"You need to submit this guess if ready.\\\", win)\\n end\\n end\\n end\\n\\n @guarded draw(can) do widget\\n ctx = Gtk.getgc(can)\\n select_font_face(ctx, \\\"Courier\\\", Cairo.FONT_SLANT_NORMAL, Cairo.FONT_WEIGHT_BOLD)\\n fontpointsize = 12\\n set_font_size(ctx, fontpointsize)\\n workcolor = colorant\\\"black\\\"\\n set_source(ctx, workcolor)\\n move_to(ctx, 0, fontpointsize)\\n show_text(ctx, \\\"Color options: \\\" * \\\"-\\\"^70)\\n stroke(ctx)\\n empty!(colorpositions)\\n for i in 1:numcolors\\n set_source(ctx, colors[i])\\n circle(ctx, i * 40, 40, 20)\\n push!(colorpositions, Point(i * 40, 40))\\n fill(ctx)\\n end\\n set_gtk_property!(can, :expand, false) # kludge for good text overwriting\\n move_to(ctx, 0, 80)\\n set_source(ctx, workcolor)\\n show_text(ctx, string(maxguesses - guessesused, pad = 2) * \\\" moves remaining.\\\")\\n stroke(ctx)\\n set_gtk_property!(can, :expand, true)\\n for i in 1:codelength\\n set_source(ctx, i > length(currentguess) ? colorant\\\"lightgray\\\" : currentguess[i])\\n circle(ctx, i * 40, 110, 20)\\n fill(ctx)\\n end\\n if length(guesshistory) > 0\\n move_to(ctx, 0, 155)\\n set_source(ctx, workcolor)\\n show_text(ctx, \\\"Past Guesses: \\\" * \\\"-\\\"^70)\\n for (i, g) in enumerate(guesshistory), (j, c) in enumerate(tovec(g)[codelength+1:end])\\n x = j * 40 + (j > codelength ? 20 : 0)\\n y = 150 + 40 * i\\n set_source(ctx, c)\\n circle(ctx, x, y, 20)\\n fill(ctx)\\n end\\n end\\n Gtk.showall(win)\\n end\\n\\n function submitguess!(w)\\n if length(currentguess) == length(code)\\n g = Guess(code, currentguess)\\n push!(guesshistory, g)\\n empty!(currentguess)\\n guessesused += 1\\n draw(can)\\n if all(i -> g.code[i] == g.guess[i], 1:length(code))\\n saywon!()\\n elseif guessesused > maxguesses\\n outofguesses!()\\n end\\n end\\n end\\n signal_connect(submitguess!, tryguess, :clicked)\\n\\n function undolast!(w)\\n if length(currentguess) > 0\\n pop!(currentguess)\\n draw(can)\\n end\\n end\\n signal_connect(undolast!, eraselast, :clicked)\\n\\n newgame!(win)\\n Gtk.showall(win)\\n\\n condition = Condition()\\n endit(w) = notify(condition)\\n signal_connect(endit, win, :destroy)\\n showall(win)\\n wait(condition)\\nend\\n\\nmastermindapp()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.2.51\\n\\nimport java.util.Random\\n\\nval rand = Random()\\n\\nclass Mastermind {\\n private val codeLen: Int\\n private val colorsCnt: Int\\n private var guessCnt = 0\\n private val repeatClr: Boolean\\n\\n private val colors: String\\n private var combo = \\\"\\\"\\n\\n private val guesses = mutableListOf<CharArray>()\\n private val results = mutableListOf<CharArray>()\\n\\n constructor(codeLen: Int, colorsCnt: Int, guessCnt: Int, repeatClr: Boolean) {\\n val color = \\\"ABCDEFGHIJKLMNOPQRST\\\"\\n this.codeLen = codeLen.coerceIn(4, 10)\\n var cl = colorsCnt\\n if (!repeatClr && cl < this.codeLen) cl = this.codeLen\\n this.colorsCnt = cl.coerceIn(2, 20)\\n this.guessCnt = guessCnt.coerceIn(7, 20)\\n this.repeatClr = repeatClr\\n this.colors = color.take(this.colorsCnt)\\n }\\n\\n fun play() {\\n var win = false\\n combo = getCombo()\\n while (guessCnt != 0) {\\n showBoard()\\n if (checkInput(getInput())) {\\n win = true\\n break\\n }\\n guessCnt--\\n }\\n println(\\\"\\\\n\\\\n--------------------------------\\\")\\n if (win) {\\n println(\\\"Very well done!\\\\nYou found the code: $combo\\\")\\n }\\n else {\\n println(\\\"I am sorry, you couldn't make it!\\\\nThe code was: $combo\\\")\\n }\\n println(\\\"--------------------------------\\\\n\\\")\\n }\\n\\n private fun showBoard() {\\n for (x in 0 until guesses.size) {\\n println(\\\"\\\\n--------------------------------\\\")\\n print(\\\"${x + 1}: \\\")\\n for (y in guesses[x]) print(\\\"$y \\\")\\n print(\\\" : \\\")\\n for (y in results[x]) print(\\\"$y \\\")\\n val z = codeLen - results[x].size\\n if (z > 0) print(\\\"- \\\".repeat(z))\\n }\\n println(\\\"\\\\n\\\")\\n }\\n\\n private fun getInput(): String {\\n while (true) {\\n print(\\\"Enter your guess ($colors): \\\")\\n val a = readLine()!!.toUpperCase().take(codeLen)\\n if (a.all { it in colors } ) return a\\n }\\n }\\n\\n private fun checkInput(a: String): Boolean {\\n guesses.add(a.toCharArray())\\n var black = 0\\n var white = 0\\n val gmatch = BooleanArray(codeLen)\\n val cmatch = BooleanArray(codeLen)\\n for (i in 0 until codeLen) {\\n if (a[i] == combo[i]) {\\n gmatch[i] = true\\n cmatch[i] = true\\n black++\\n }\\n }\\n for (i in 0 until codeLen) {\\n if (gmatch[i]) continue\\n for (j in 0 until codeLen) {\\n if (i == j || cmatch[j]) continue\\n if (a[i] == combo[j]) {\\n cmatch[j] = true\\n white++\\n break\\n }\\n }\\n }\\n val r = mutableListOf<Char>()\\n r.addAll(\\\"X\\\".repeat(black).toList())\\n r.addAll(\\\"O\\\".repeat(white).toList())\\n results.add(r.toCharArray())\\n return black == codeLen\\n }\\n\\n private fun getCombo(): String {\\n val c = StringBuilder()\\n val clr = StringBuilder(colors)\\n for (s in 0 until codeLen) {\\n val z = rand.nextInt(clr.length)\\n c.append(clr[z])\\n if (!repeatClr) clr.deleteCharAt(z)\\n }\\n return c.toString()\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val m = Mastermind(4, 8, 12, false)\\n m.play()\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"math.randomseed( os.time() )\\nlocal black, white, none, code = \\\"X\\\", \\\"O\\\", \\\"-\\\"\\nlocal colors, codeLen, maxGuess, rept, alpha, opt = 6, 4, 10, false, \\\"ABCDEFGHIJKLMNOPQRST\\\", \\\"\\\"\\nlocal guesses, results\\nfunction createCode()\\n code = \\\"\\\"\\n local dic, a = \\\"\\\"\\n for i = 1, colors do\\n dic = dic .. alpha:sub( i, i )\\n end\\n for i = 1, codeLen do\\n a = math.floor( math.random( 1, #dic ) )\\n code = code .. dic:sub( a, a )\\n if not rept then\\n dic = dic:sub(1, a - 1 ) .. dic:sub( a + 1, #dic )\\n end\\n end\\nend\\nfunction checkInput( inp )\\n table.insert( guesses, inp )\\n local b, w, fnd, str = 0, 0, {}, \\\"\\\"\\n for bl = 1, codeLen do\\n if inp:sub( bl, bl ) == code:sub( bl, bl ) then\\n b = b + 1; fnd[bl] = true\\n else\\n for wh = 1, codeLen do\\n if nil == fnd[bl] and wh ~= bl and inp:sub( wh, wh ) == code:sub( bl, bl ) then\\n w = w + 1; fnd[bl] = true\\n end\\n end\\n end\\n end\\n for i = 1, b do str = str .. string.format( \\\"%s \\\", black ) end\\n for i = 1, w do str = str .. string.format( \\\"%s \\\", white ) end\\n for i = 1, 2 * codeLen - #str, 2 do str = str .. string.format( \\\"%s \\\", none ) end\\n table.insert( results, str )\\n return b == codeLen\\nend\\nfunction play()\\n local err, win, r = true, false;\\n for j = 1, colors do opt = opt .. alpha:sub( j, j ) end\\n while( true ) do\\n createCode(); guesses, results = {}, {}\\n for i = 1, maxGuess do\\n err = true;\\n while( err ) do\\n io.write( string.format( \\\"\\\\n-------------------------------\\\\nYour guess (%s)?\\\", opt ) )\\n inp = io.read():upper();\\n if #inp == codeLen then\\n err = false;\\n for k = 1, #inp do\\n if( nil == opt:find( inp:sub( k, k ) ) ) then\\n err = true;\\n break;\\n end\\n end\\n end\\n end\\n if( checkInput( inp ) ) then win = true; break\\n else\\n for l = 1, #guesses do\\n print( string.format( \\\"%.2d: %s : %s\\\", l, guesses[l], results[l] ) )\\n end\\n end\\n end\\n if win then print( \\\"\\\\nWell done!\\\" )\\n else print( string.format( \\\"\\\\nSorry, you did not crack the code --> %s!\\\", code ) )\\n end\\n io.write( \\\"Play again( Y/N )? \\\" ); r = io.read()\\n if r ~= \\\"Y\\\" and r ~= \\\"y\\\" then break end\\n end\\nend\\n--[[ entry point ]]---\\nif arg[1] ~= nil and tonumber( arg[1] ) > 1 and tonumber( arg[1] ) < 21 then colors = tonumber( arg[1] ) end\\nif arg[2] ~= nil and tonumber( arg[2] ) > 3 and tonumber( arg[2] ) < 11 then codeLen = tonumber( arg[2] ) end\\nif arg[3] ~= nil and tonumber( arg[3] ) > 6 and tonumber( arg[3] ) < 21 then maxGuess = tonumber( arg[3] ) end\\nif arg[4] ~= nil and arg[4] == \\\"true\\\" or arg[4] == \\\"false\\\" then rept = ( arg[4] == \\\"true\\\" ) end\\nplay()\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"import random, sequtils, strformat, strutils\\n\\nproc encode(correct, guess: string): string =\\n result.setlen(correct.len)\\n for i in 0..correct.high:\\n result[i] = if correct[i] == guess[i]: 'X' else: (if guess[i] in correct: 'O' else: '-')\\n result.join(\\\" \\\")\\n\\nproc safeIntInput(prompt: string; minVal, maxVal: Positive): int =\\n while true:\\n stdout.write prompt\\n let userInput = stdin.readLine()\\n result = try: parseInt(userInput)\\n except ValueError: continue\\n if result in minVal..maxVal:\\n return\\n\\n\\nproc playGame() =\\n\\n echo \\\"You will need to guess a random code.\\\"\\n echo \\\"For each guess, you will receive a hint.\\\"\\n echo \\\"In this hint, X denotes a correct letter, \\\" &\\n \\\"and O a letter in the original string but in a different position.\\\"\\n echo \\\"\\\"\\n\\n let numLetters = safeIntInput(\\\"Select a number of possible letters for the code (2-20): \\\", 2, 20)\\n let codeLength = safeIntInput(\\\"Select a length for the code (4-10): \\\", 4, 10)\\n let letters = \\\"ABCDEFGHIJKLMNOPQRST\\\"[0..<numLetters]\\n let code = newSeqWith(codeLength, letters.sample()).join()\\n var guesses: seq[string]\\n\\n while true:\\n echo \\\"\\\"\\n stdout.write &\\\"Enter a guess of length {codeLength} ({letters}): \\\"\\n let guess = stdin.readLine().toUpperAscii().strip()\\n if guess.len != codeLength or guess.anyIt(it notin letters):\\n continue\\n elif guess == code:\\n echo &\\\"\\\\nYour guess {guess} was correct!\\\"\\n break\\n else:\\n guesses.add &\\\"{guesses.len + 1}: {guess.join(\\\\\\\" \\\\\\\")} => {encode(code, guess)}\\\"\\n for guess in guesses:\\n echo \\\"------------------------------------\\\"\\n echo guess\\n echo \\\"------------------------------------\\\"\\n\\n\\nrandomize()\\nplayGame()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use List::Util qw(any);\\n\\nprint 'Enter pool size, puzzle size, attempts allowed: ';\\n($pool,$length,$tries) = split /\\\\s+/, <>;\\n$length = 4 if $length eq '' or $length < 3 or $length > 11;\\n$pool = 6 if $pool eq '' or $pool < 2 or $pool > 21;\\n$tries = 10 if $tries eq '' or $tries < 7 or $tries > 21;\\n\\n@valid = sort { -1 + 2*int(rand 2) } ('A' .. 'T')[0..$pool-1];\\n@puzzle = @valid[0..$length-1];\\n\\n$black = '●';\\n$white = '○';\\n\\nwhile () {\\n header();\\n print \\\"$_\\\\n\\\" for @guesses;\\n lose() if @guesses == $tries;\\n @guess = get_guess();\\n next unless is_valid(@guess);\\n $score = score(\\\\@puzzle, \\\\@guess);\\n win() if $score eq join ' ', ($black) x $length;\\n push @guesses, join(' ', @guess) . ' :: ' . $score;\\n}\\n\\nsub score {\\n local *puzzle = shift;\\n local *guess = shift;\\n my @score;\\n for $i (0..$length-1) {\\n if ( $puzzle[$i] eq $guess[$i]) { push @score, $black }\\n elsif (any {$puzzle[$i] eq $_} @guess) { push @score, $white }\\n else { push @score, '-' }\\n }\\n join ' ', reverse sort @score;\\n}\\n\\nsub header {\\n $num = $tries - @guesses;\\n print \\\"Valid letter, but wrong position: ○ - Correct letter and position: ●\\\\n\\\";\\n print \\\"Guess the $length element sequence containing the letters \\\" . join(', ', sort @valid) . \\\"\\\\n\\\";\\n printf \\\"Repeats are not allowed. You have $num guess%s remaining\\\\n\\\", $num > 1 ? 'es' : '';\\n}\\n\\nsub get_guess { print 'Your guess?: '; $g = <>; return split /\\\\s*/, uc $g }\\n\\nsub is_valid { $length == @_ }\\n\\nsub win { print 'You win! The correct answer is: ' . join(' ',@puzzle) . \\\"\\\\n\\\"; exit }\\n\\nsub lose { print 'Too bad, you ran out of guesses. The solution was: ' . join(' ',@puzzle) . \\\"\\\\n\\\"; exit }\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-- demo/rosetta/mastermind.exw\\nconstant SET_LIMIT = 1_000_000 -- above this, it uses random sampling.\\n\\nconstant help_text = \\\"\\\"\\\"\\nThe game of mastermind, with a Knuth solver.\\n\\nSpecify the number of colours (1..20), the code length (1..10), the\\nnumber of guesses allowed (1-20), and whether colours can be repeated\\n(auto-ticked & greyed-out inactive when length>colours).\\n\\nNote that at the highest settings there are 10,240,000,000,000 possible\\nanswers: the (order n squared) analysis of that is simply not practical,\\nas indeed is simply building the initial list of all possible answers,\\nand therefore a fixed limit of 1,000,000 has been applied, which also\\njust about manages to keep the program responsive. Obviously, should the\\nactual answer not be among those samples, it cannot possibly find it,\\nand it will tell you in plain english when that occurs. You can always\\ntrim the search space back to something more reasonable at any time, and\\nstill play the game when that limit is breached, with weaker hints.\\n\\nConversely the lowest settings do not make for an interesting game, but\\nproved quite useful when ironing out some bugs, so were left in.\\n\\nThe Use button (disabled until something useful found) allows you to\\ntake the best found (so far), displayed at the top of the colours frame.\\nObviously \\\"1/1 (100%)\\\" means that it has deduced the correct answer.\\nBelow that the colours frame shows all available colours, which can be\\nindividually clicked in any order.\\n\\nPress Delete or click on the last peg (in the left-hand game frame)\\nto remove it, before the last one is placed, however once full your\\nturn is immediately scored and cannot be undone.\\n\\nNew Game, Help, and Exit buttons are assumed to be self-explanatory.\\nChanging the option settings implicitly triggers a new game, except\\nfor the number of permitted guesses, pre-game-over. Reducing the\\nnumber of guesses can also be used as a means of conceding.\\n\\nWhen a correct guess is entered or all guesses have been used the hint\\nand colours are replaced with \\\"GAME OVER - YOU WIN/LOSE\\\" under the\\nactual answer.\\n\\\"\\\"\\\"\\ninclude pGUI.e\\n\\nIhandle dlg, colours, codelen, maxgoes, repeats, progress,\\n usehint, game_canvas, colour_canvas\\ninteger ncolours, ncodelen, nmaxgoes\\nbool brepeats\\n\\nsequence secret = {},\\n hint = {},\\n guesses = {{}},\\n scores = {}\\n--\\n-- note: while the game is ongoing, length(guesses) should always be\\n-- length(scores)+1; equal lengths is equivalent to game over.\\n--\\n\\nfunction get_score(sequence guess, goal)\\ninteger blacks = 0, -- (right colour & place)\\n whites = 0 -- (\\\"\\\" but wrong place)\\n for i=1 to length(guess) do\\n if guess[i]=goal[i] then\\n blacks += 1\\n guess[i] = ' '\\n goal[i] = ' '\\n end if\\n end for\\n for i=1 to length(guess) do\\n if guess[i]!=' ' then\\n integer k = find(guess[i],goal)\\n if k then\\n whites += 1\\n goal[k] = ' '\\n end if\\n end if\\n end for\\n return {blacks, whites}\\nend function\\n\\nfunction random_set()\\n-- create the secret code, and/or (when rqd) a SET_LIMIT random sample\\n sequence cset = tagset(ncolours),\\n res = repeat(0,ncodelen)\\n for i=1 to ncodelen do\\n integer c = rand(length(cset))\\n res[i] = cset[c]\\n if not brepeats then\\n cset[c..c] = {}\\n end if\\n end for\\n return res\\nend function\\n\\nsequence initial_set\\natom is_len, -- logically length(initial_set), except when > SET_LIMIT.\\n excluded -- initialset[1..excluded-1], are not, [excluded..$] are.\\n\\nprocedure create_initial_set()\\n is_len = iff(brepeats?power(ncolours,ncodelen):k_perm(ncolours,ncodelen))\\n if is_len<=SET_LIMIT then\\n --\\n -- generate the full set\\n --\\n initial_set = repeat(0,is_len)\\n excluded = is_len+1 -- (ie none)\\n sequence next = iff(brepeats?repeat(1,ncodelen):tagset(ncodelen))\\n for i=1 to is_len do\\n initial_set[i] = next\\n for ndx=length(next) to 1 by -1 do\\n integer n = next[ndx]\\n while n<=ncolours do\\n n += 1\\n if brepeats\\n-- or not find(n,next[1..ndx-1]) then\\n or not find(n,next) then --(see below)\\n exit\\n end if\\n end while\\n next[ndx] = n\\n if n<=ncolours then\\n if not brepeats then\\n --\\n -- Fill in the rest lowest-first, eg\\n -- in the 4 colours and 4 holes case:\\n -- (start) (above) (this)\\n -- {1,2,3,4} --> {1,2,4,_} --> {1,2,4,3}\\n -- {1,2,4,3} --> {1,3,_,_} --> {1,3,2,4}\\n -- ... (20 other cases omitted)\\n -- {4,3,1,2} --> {4,3,2,_} --> {4,3,2,1}\\n --\\n -- (probably sub-optimal, but insignificant\\n -- vs. the o(n^2) analysis which follows.)\\n --\\n for j=ndx+1 to length(next) do\\n for k=1 to ncolours do\\n-- if not find(k,next[1..j-1]) then\\n if not find(k,next) then --(see below)\\n next[j] = k\\n exit\\n end if\\n end for\\n end for\\n end if\\n exit\\n end if\\n --\\n -- technical note: if not brepeats, we are going to\\n -- replace all next[ndx..$] later/above anyway, but\\n -- replacing with 0 means we can avoid those slices.\\n -- The next three all work: 1 is perfect for the\\n -- brepeats=true case, but brepeats=false needs the\\n -- above slices, while the 2nd & 3rd are equivalent\\n -- the latter is obviously somewhat faster, at the\\n -- cost of a wtf?!, without a comment such as this.\\n --\\n-- next[ndx] = 1\\n-- next[ndx] = iff(brepeats?1:0)\\n next[ndx] = brepeats -- (equivalent)\\n end for\\n end for\\n else\\n --\\n -- generate SET_LIMIT random codes\\n -- note that if (as is quite likely) the actual answer is\\n -- not present in initial_set, then obviously it cannot\\n -- possibly find it!\\n --\\n initial_set = repeat(0,SET_LIMIT)\\n excluded = SET_LIMIT+1 -- (ie none)\\n for i=1 to SET_LIMIT do\\n initial_set[i] = random_set()\\n end for\\n end if\\nend procedure\\n\\natom done, is_done, best\\n\\nfunction idle_action()\\n atom to_do = excluded-1,\\n t1 = time()+1\\n string samp = iff(is_len=length(initial_set)?\\\"\\\":sprintf(\\\" samples of %,d\\\",{is_len}))\\n for i=1 to 100000 do -- reasonable slice of work\\n done += 1\\n is_done += (done<excluded)\\n sequence guest = initial_set[done],\\n scores = {}, counts = {}\\n if not find(guest,guesses) then\\n for j=1 to excluded-1 do\\n sequence s = get_score(guest,initial_set[j])\\n integer k = find(s,scores)\\n if k=0 then\\n scores = append(scores,s)\\n counts = append(counts,1)\\n else\\n counts[k] += 1\\n end if\\n end for\\n if length(counts)=0 then\\n IupSetStrAttribute(progress,\\\"TITLE\\\",\\\"[answer not in %,d%s]\\\",{SET_LIMIT,samp})\\n return IUP_IGNORE -- (stop idle)\\n end if\\n integer k = largest(counts,return_index:=true),\\n ck = counts[k]\\n if ck<best then\\n best = ck\\n hint = guest\\n IupSetInt(usehint,\\\"ACTIVE\\\",true)\\n IupUpdate(colour_canvas)\\n end if\\n end if\\n\\n if done=length(initial_set) then\\n IupSetStrAttribute(progress,\\\"TITLE\\\",\\\"%,d/%,d%s (100%%)\\\",{is_done,to_do,samp})\\n return IUP_IGNORE -- (stop idle)\\n end if\\n if time()>t1 then exit end if\\n end for\\n IupSetStrAttribute(progress,\\\"TITLE\\\",\\\"%,d/%,d%s (%d%%)\\\",{is_done,to_do,samp,100*(is_done/to_do)})\\n return IUP_DEFAULT\\nend function\\nconstant idle_action_cb = Icallback(\\\"idle_action\\\")\\n\\nprocedure start_idle()\\n done = 0\\n is_done = 0\\n best = length(initial_set)+1\\n IupSetGlobalFunction(\\\"IDLE_ACTION\\\",idle_action_cb)\\nend procedure\\n\\nprocedure new_game()\\n ncolours = IupGetInt(colours,\\\"VALUE\\\")\\n ncodelen = IupGetInt(codelen,\\\"VALUE\\\")\\n nmaxgoes = IupGetInt(maxgoes,\\\"VALUE\\\")\\n brepeats = IupGetInt(repeats,\\\"VALUE\\\")\\n secret = random_set()\\n guesses = {{}}\\n scores = {}\\n hint = {}\\n create_initial_set()\\n start_idle()\\nend procedure\\n\\nconstant colour_table = {#e6194b, -- Red\\n #3cb44b, -- Green\\n #ffe119, -- Yellow\\n #4363d8, -- Blue\\n #f58231, -- Orange\\n #911eb4, -- Purple\\n #42d4f4, -- Cyan\\n #f032e6, -- Magenta\\n #bfef45, -- Lime\\n #fabebe, -- Pink\\n #469990, -- Teal\\n #e6beff, -- Lavender\\n #9A6324, -- Brown\\n #fffac8, -- Beige\\n #800000, -- Maroon\\n #aaffc3, -- Mint\\n #808000, -- Olive\\n #ffd8b1, -- Apricot\\n #000075, -- Navy\\n #a9a9a9} -- Grey\\n\\n-- saved in redraw_cb(), for click testing in button_cb():\\nsequence last_guess = {},\\n colour_centres = {}\\ninteger guess_r2 = 0,\\n colour_r2 = 0\\n\\nfunction redraw_cb(Ihandle ih, integer /*posx*/, integer /*posy*/)\\n Ihandle frame = IupGetParent(ih)\\n string title = IupGetAttribute(ih,\\\"TITLE\\\")\\n if not find(title,{\\\"Game\\\",\\\"Colours\\\"}) then ?9/0 end if\\n integer {cw,ch} = IupGetIntInt(ih, \\\"DRAWSIZE\\\")\\n\\n cdCanvas cddbuffer = IupGetAttributePtr(ih,\\\"DBUFFER\\\")\\n IupGLMakeCurrent(ih)\\n cdCanvasActivate(cddbuffer)\\n cdCanvasClear(cddbuffer)\\n\\n if title=\\\"Game\\\" then\\n integer mx = min(floor(cw/(ncodelen*1.5+0.5)),floor(ch/(nmaxgoes+1))),\\n diameter = floor(mx/2),\\n px = floor((cw-(ncodelen*1.5+0.5)*mx)/2), -- (set margin)\\n cy = ch, cx, c, r\\n last_guess = {}\\n for g=1 to length(guesses) do\\n cy -= mx\\n cx = px+floor(mx/2)\\n for i=1 to 2*ncodelen+1 do\\n if i!=ncodelen+1 then\\n if i<=ncodelen then\\n if i<=length(guesses[g]) then\\n c = colour_table[guesses[g][i]]\\n if g=length(guesses) then\\n last_guess = {{cx,ch-cy}}\\n end if\\n else\\n c = CD_GREY\\n end if\\n r = diameter\\n else\\n c = CD_GREY\\n if g<=length(scores) then\\n integer k = i-ncodelen-1,\\n {b,w} = scores[g]\\n c = iff(k<=b ? CD_BLACK : iff(k<=b+w ? CD_WHITE : CD_GREY))\\n end if\\n r = floor(diameter*0.5)\\n end if\\n cdCanvasSetForeground(cddbuffer,c)\\n cdCanvasSector(cddbuffer, cx, cy, r, r, 0, 360)\\n cdCanvasSetForeground(cddbuffer,CD_DARK_GREY)\\n cdCanvasCircle(cddbuffer, cx, cy, r)\\n end if\\n cx += iff(i<ncodelen?mx:floor(mx/2))\\n end for\\n end for\\n guess_r2 = floor(diameter*diameter/4)\\n elsif title=\\\"Colours\\\" then\\n integer mx = min(floor(cw/ncodelen),floor(ch/2)),\\n r = floor(mx/2),\\n px = floor((cw-ncodelen*mx)/2), -- (set margin)\\n cy = ch-r, cx, c\\n cx = px+floor(mx/2)\\n bool active = length(hint)>0\\n if length(scores)=nmaxgoes then\\n hint = secret\\n active = true\\n end if\\n for i=1 to ncodelen do\\n c = iff(active?colour_table[hint[i]]:CD_GREY)\\n cdCanvasSetForeground(cddbuffer,c)\\n cdCanvasSector(cddbuffer, cx, cy, r, r, 0, 360)\\n cdCanvasSetForeground(cddbuffer,CD_DARK_GREY)\\n cdCanvasCircle(cddbuffer, cx, cy, r)\\n cx += mx\\n end for\\n if length(scores)=nmaxgoes\\n or guesses[$]=secret then\\n ch -= floor(mx/2)\\n {} = cdCanvasTextAlignment(cddbuffer, CD_CENTER)\\n string wl = iff(guesses[$]=secret?\\\"WIN\\\":\\\"LOSE\\\"),\\n msg = sprintf(\\\"GAME OVER - YOU %s\\\",{wl})\\n cdCanvasText(cddbuffer, cw/2, ch/2, msg)\\n else\\n integer ch0 = ch\\n ch -= mx\\n --\\n -- calculate the best nw*nh way to fit all the colours in:\\n -- (if nw ends up = ncodelen there is no clear separation\\n -- between the hint and the colour table; the start with\\n -- ncodelen+1 solves that and looks pretty good to me.)\\n --\\n integer nw = ncodelen+1, -- (as above)\\n nh = 1\\n while nw*nh<ncolours do\\n if (cw/(nw+1))>(ch/(nh+1)) then\\n nw += 1\\n else\\n nh += 1\\n end if\\n end while\\n --\\n -- now draw all the colours\\n --\\n mx = min(floor(cw/nw),floor(ch/nh))\\n r = floor(mx/2)\\n px = floor((cw-nw*mx)/2)\\n cx = px+floor(mx/2)\\n cy = ch-r\\n integer this_row = 0\\n colour_centres = repeat(0,ncolours)\\n colour_r2 = floor(r*r/4)\\n for i=1 to ncolours do\\n colour_centres[i] = {cx,ch0-cy}\\n c = colour_table[i]\\n cdCanvasSetForeground(cddbuffer,c)\\n cdCanvasSector(cddbuffer, cx, cy, r, r, 0, 360)\\n cdCanvasSetForeground(cddbuffer,CD_DARK_GREY)\\n cdCanvasCircle(cddbuffer, cx, cy, r)\\n cx += mx\\n this_row += 1\\n if this_row>=nw then\\n this_row = 0\\n cx = px + floor(mx/2)\\n cy -= mx\\n end if\\n end for\\n end if\\n end if\\n cdCanvasFlush(cddbuffer)\\n return IUP_DEFAULT\\nend function\\n\\nfunction map_cb(Ihandle ih)\\n IupGLMakeCurrent(ih)\\n atom res = IupGetDouble(NULL, \\\"SCREENDPI\\\")/25.4\\n cdCanvas cddbuffer = cdCreateCanvas(CD_GL, \\\"10x10 %g\\\", {res})\\n IupSetAttributePtr(ih,\\\"DBUFFER\\\",cddbuffer)\\n cdCanvasSetBackground(cddbuffer, CD_PARCHMENT)\\n return IUP_DEFAULT\\nend function\\n\\nfunction canvas_resize_cb(Ihandle canvas)\\n cdCanvas cddbuffer = IupGetAttributePtr(canvas,\\\"DBUFFER\\\")\\n integer {canvas_width, canvas_height} = IupGetIntInt(canvas, \\\"DRAWSIZE\\\")\\n atom res = IupGetDouble(NULL, \\\"SCREENDPI\\\")/25.4\\n cdCanvasSetAttribute(cddbuffer, \\\"SIZE\\\", \\\"%dx%d %g\\\", {canvas_width, canvas_height, res})\\n return IUP_DEFAULT\\nend function\\n\\nprocedure redraw_all()\\n IupUpdate({game_canvas,colour_canvas})\\nend procedure\\n\\nprocedure undo_move()\\n-- Called from button_cb and from K_DEL, but latter may be invalid.\\n if length(guesses[$])!=0 then\\n guesses[$] = guesses[$][1..$-1]\\n redraw_all()\\n end if\\nend procedure\\n\\nprocedure add_move(integer i)\\n if i!=0 then\\n guesses[$] &= i\\n end if\\n if length(guesses[$])=ncodelen then\\n sequence guest = guesses[$],\\n score = get_score(guest,secret)\\n scores = append(scores,score)\\n if score!={ncodelen,0} -- (not all black==game over)\\n and length(guesses)<nmaxgoes then\\n for i=excluded-1 to 1 by -1 do\\n sequence isi = initial_set[i]\\n if get_score(guest,isi)!=score then\\n excluded -= 1\\n if excluded!=i then\\n initial_set[i] = initial_set[excluded]\\n initial_set[excluded] = isi -- (swap)\\n end if\\n end if\\n end for\\n guesses = append(guesses,{})\\n hint = {}\\n IupSetAttribute(progress,\\\"TITLE\\\",\\\"-\\\")\\n IupSetInt(usehint,\\\"ACTIVE\\\",false)\\n start_idle()\\n end if\\n end if\\n redraw_all()\\nend procedure\\n\\nfunction usehint_cb(Ihandle /*usehint*/)\\n guesses[$] = hint\\n add_move(0)\\n return IUP_DEFAULT\\nend function\\n\\nfunction button_cb(Ihandle canvas, integer button, pressed, x, y, atom /*pStatus*/)\\n Ihandle frame = IupGetParent(canvas)\\n string title = IupGetAttribute(frame,\\\"TITLE\\\")\\n if not find(title,{\\\"Game\\\",\\\"Colours\\\"}) then ?9/0 end if\\n if button=IUP_BUTTON1 and not pressed then -- (left button released)\\n {sequence centres, integer r2} = iff(title=\\\"Game\\\"?{last_guess,guess_r2}\\n :{colour_centres,colour_r2})\\n for i=1 to length(centres) do\\n integer {cx,cy} = sq_sub(centres[i],{x,y})\\n if (cx*cx+cy*cy)<=r2 then\\n if title=\\\"Game\\\" then\\n undo_move()\\n else\\n add_move(i)\\n end if\\n exit\\n end if\\n end for\\n end if\\n return IUP_CONTINUE\\nend function\\n\\nfunction new_game_cb(Ihandle /*ih*/)\\n new_game()\\n redraw_all()\\n return IUP_DEFAULT\\nend function\\n\\nfunction exit_cb(Ihandle /*ih*/)\\n return IUP_CLOSE\\nend function\\nconstant cb_exit = Icallback(\\\"exit_cb\\\")\\n\\nfunction help_cb(Ihandln /*ih*/)\\n IupMessage(\\\"Mastermind\\\",help_text)\\n return IUP_DEFAULT\\nend function\\n\\nfunction key_cb(Ihandle /*dlg*/, atom c)\\n if c=K_ESC then return IUP_CLOSE end if\\n if c=K_F1 then return help_cb(NULL) end if\\n if find(c,{K_DEL,K_BS}) then undo_move() end if\\n return IUP_CONTINUE\\nend function\\n\\nfunction valuechanged_cb(Ihandle ih)\\n ncolours = IupGetInt(colours,\\\"VALUE\\\")\\n ncodelen = IupGetInt(codelen,\\\"VALUE\\\")\\n nmaxgoes = IupGetInt(maxgoes,\\\"VALUE\\\")\\n IupSetInt(repeats,\\\"ACTIVE\\\",ncodelen<=ncolours)\\n if ncodelen>ncolours then\\n IupSetInt(repeats,\\\"VALUE\\\",true)\\n end if\\n brepeats = IupGetInt(repeats,\\\"VALUE\\\")\\n if ih!=maxgoes\\n or length(scores)=length(guesses) then -- (game over)\\n new_game()\\n elsif nmaxgoes<=length(scores) then\\n -- (signal/force game over state)\\n guesses = guesses[1..length(scores)]\\n end if\\n redraw_all()\\n return IUP_DEFAULT\\nend function\\nconstant cb_valuechanged = Icallback(\\\"valuechanged_cb\\\")\\n\\nprocedure main()\\n IupOpen()\\n\\n colours = IupText(\\\"SPIN=Yes, SPINMIN=1, SPINMAX=20, VALUE=6, RASTERSIZE=34x\\\")\\n codelen = IupText(\\\"SPIN=Yes, SPINMIN=1, SPINMAX=10, VALUE=4, RASTERSIZE=34x\\\")\\n maxgoes = IupText(\\\"SPIN=Yes, SPINMIN=1, SPINMAX=20, VALUE=7, RASTERSIZE=34x\\\")\\n repeats = IupToggle(\\\"Repeatable?\\\",\\\"VALUE=YES, RIGHTBUTTON=YES, PADDING=5x4\\\")\\n progress = IupLabel(\\\"-\\\",\\\"EXPAND=HORIZONTAL, PADDING=5x4\\\")\\n usehint = IupButton(\\\"Use\\\",Icallback(\\\"usehint_cb\\\"),\\\"PADDING=5x4, ACTIVE=NO\\\")\\n game_canvas = IupGLCanvas(\\\"RASTERSIZE=200x\\\")\\n colour_canvas = IupGLCanvas(\\\"RASTERSIZE=x200\\\")\\n Ihandle newgame = IupButton(\\\"New Game\\\",Icallback(\\\"new_game_cb\\\"),\\\"PADDING=5x4\\\"),\\n help = IupButton(\\\"Help (F1)\\\",Icallback(\\\"help_cb\\\"),\\\"PADDING=5x4\\\"),\\n quit = IupButton(\\\"E&xit\\\",Icallback(\\\"exit_cb\\\"),\\\"PADDING=5x4\\\"),\\n vbox = IupVbox({IupHbox({IupLabel(\\\"Colours (1-20)\\\",\\\"PADDING=5x4\\\"),colours}),\\n IupHbox({IupLabel(\\\"Code Length (1-10)\\\",\\\"PADDING=5x4\\\"),codelen}),\\n IupHbox({IupLabel(\\\"Guesses (1-20)\\\",\\\"PADDING=5x4\\\"),maxgoes}),\\n IupHbox({repeats},\\\"MARGIN=10x5\\\"),\\n IupHbox({progress}),\\n IupHbox({usehint,newgame,help,quit})},\\\"MARGIN=5x5\\\"),\\n game_frame = IupFrame(IupHbox({game_canvas},\\\"MARGIN=3x3\\\"),\\\"TITLE=Game\\\"),\\n option_frame = IupFrame(vbox,\\\"TITLE=Options\\\"),\\n colour_frame = IupFrame(colour_canvas,\\\"TITLE=Colours\\\"),\\n full = IupHbox({game_frame,IupVbox({option_frame,colour_frame})})\\n IupSetCallbacks({colours,codelen,maxgoes,repeats}, {\\\"VALUECHANGED_CB\\\", cb_valuechanged})\\n IupSetCallbacks({game_canvas,colour_canvas}, {\\\"ACTION\\\", Icallback(\\\"redraw_cb\\\"),\\n \\\"MAP_CB\\\", Icallback(\\\"map_cb\\\"),\\n \\\"RESIZE_CB\\\", Icallback(\\\"canvas_resize_cb\\\"),\\n \\\"BUTTON_CB\\\", Icallback(\\\"button_cb\\\")})\\n dlg = IupDialog(IupHbox({full},\\\"MARGIN=3x3\\\"),\\\"TITLE=Mastermind\\\")\\n IupSetCallback(dlg, \\\"K_ANY\\\", Icallback(\\\"key_cb\\\"))\\n IupSetAttributeHandle(dlg,\\\"DEFAULTENTER\\\", usehint)\\n\\n new_game()\\n\\n IupShowXY(dlg,IUP_CENTER,IUP_CENTER)\\n IupSetAttribute(dlg, \\\"RASTERSIZE\\\", NULL)\\n IupSetStrAttribute(dlg, \\\"MINSIZE\\\", IupGetAttribute(dlg,\\\"RASTERSIZE\\\"))\\n IupMainLoop()\\n IupClose()\\nend procedure\\nmain()\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"mastermind :- mastermind(7, 4, 8, no_duplicates).\\n\\nmastermind(Colours, Length, Guesses, Duplicates) :-\\n\\tbetween(2, 20, Colours),\\n\\tbetween(4, 10, Length),\\n\\tbetween(7, 20, Guesses),\\n\\tmember(Duplicates, [allow_duplicates, no_duplicates]),\\n\\n\\tcreate_board(Colours, Length, Duplicates, Board),\\n\\tintro(Colours, Length, Duplicates),\\n\\tplay(board(Board, Length, Colours, Guesses), [], 0), !.\\n\\nintro(Colours, Length, Duplicates) :-\\n\\tformat('Guess the code!~n'),\\n\\tformat('There are ~p character types, and ~p letters to guess~n',\\n\\t [Colours, Length]),\\n\\tDuplicates = allow_duplicates\\n\\t-> format('Duplicates are allowed~n~n')\\n\\t; format('Duplicates are not allowed~n~n').\\n\\n/* Create the combination to be guessed */\\ncreate_board(Colours, Length, Duplicates, Board) :-\\n\\tlength(Board, Length),\\n\\tvalid_char_list(Colours, CharSet),\\n\\trepeat,\\n\\tmaplist(random_alpha(CharSet), Board),\\n\\tcheck_for_duplicates(Board, Duplicates).\\n\\ncheck_for_duplicates(_, allow_dupicates).\\ncheck_for_duplicates(Board, no_duplicates) :- is_set(Board).\\n\\n/* Main loop - get the player guess and print out status */\\nplay(board(Board,_,_,MaxGuesses), _, MaxGuesses) :-\\n\\twrite('Sorry, You failed to guess in time...!\\\\nThe code was : '),\\n\\tmaplist(write, Board),\\n\\tnl.\\nplay(BoardData, PrevGuesses, GuessNum) :-\\n\\tBoardData = board(_, Length, Colours, MaxGuesses),\\n\\tGuessNum < MaxGuesses,\\n\\tReportedGuess is GuessNum + 1,\\n\\tformat('Guess #~p of #~p: ', [ReportedGuess, MaxGuesses]),\\n\\tget_player_guess(Length, Colours, Guess),\\n\\tevaluate_and_print_result(BoardData, PrevGuesses, ReportedGuess, Guess).\\n\\nevaluate_and_print_result(board(Board,_,_,_), _, _,Board) :-\\n\\tformat('Well done! You Guessed Correctly.~n').\\nevaluate_and_print_result(BoardData, PrevGuesses, NextGuessNum, Guess) :-\\n\\tBoardData = board(Board, _, _, _),\\n\\tdif(Board, Guess),\\n\\tmatch_guess_to_board(Board, Guess, Diffs),\\n\\tappend(PrevGuesses, [guess(NextGuessNum, Guess, Diffs)], Guesses),\\n\\tmaplist(print_guess, Guesses),\\n\\tplay(BoardData, Guesses, NextGuessNum).\\n\\n/* Get the player guess and validate that it matches the rules */\\nget_player_guess(Length, Colours, Guess) :-\\n\\trepeat,\\n\\tread_line_to_string(user_input, Line),\\n\\tstring_chars(Line, Guess),\\n\\n\\t% validate the correct number of items have been entered\\n\\tlength(Guess, Length),\\n\\n\\t% validate that all the characters are valid for the number of colours\\n\\tvalid_char_list(Colours, ValidCharSet),\\n\\tsubset(Guess, ValidCharSet).\\n\\n/* Predicates to figure out how many places are correct */\\nmatch_guess_to_board(Board, Guess, Matches) :-\\n\\tmaplist(guess_differences(Board), Board, Guess, Differences),\\n\\tsort(0, @>=, Differences, Matches).\\n\\n% Same position, same type\\nguess_differences(_Board, B, B, 'X').\\n% Same type, different position\\nguess_differences(Board, B, G, 'O') :- dif(B, G), member(G, Board).\\n% Type not on board\\nguess_differences(Board, B, G, '-') :- dif(B, G), \\\\+ member(G, Board).\\n\\n/* Print out the current progress */\\nprint_guess(guess(NextGuessNumber, Guess, Differences))\\t:-\\n\\tformat('~w: ', NextGuessNumber),\\n\\tmaplist(format('~w '), Guess),\\n\\tformat(' : '),\\n\\tmaplist(format('~w '), Differences),\\n\\tnl.\\n\\n/* Utils */\\nalpha_chars([a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t]).\\n\\nvalid_char_list(Colours, CharSet) :-\\n\\talpha_chars(AllChars),\\n\\ttruncate_list(AllChars, Colours, CharSet).\\n\\nrandom_alpha(AllChars, RandomMember) :- random_member(RandomMember, AllChars).\\n\\ntruncate_list(_, 0, []).\\ntruncate_list([A|T], N, [A|R]) :-\\n\\tN > 0,\\n\\tN1 is N - 1,\\n\\ttruncate_list(T, N1, R).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"import random\\n\\n\\ndef encode(correct, guess):\\n output_arr = [''] * len(correct)\\n\\n for i, (correct_char, guess_char) in enumerate(zip(correct, guess)):\\n output_arr[i] = 'X' if guess_char == correct_char else 'O' if guess_char in correct else '-'\\n\\n return ''.join(output_arr)\\n\\n\\ndef safe_int_input(prompt, min_val, max_val):\\n while True:\\n user_input = input(prompt)\\n\\n try:\\n user_input = int(user_input)\\n except ValueError:\\n continue\\n\\n if min_val <= user_input <= max_val:\\n return user_input\\n\\n\\ndef play_game():\\n print(\\\"Welcome to Mastermind.\\\")\\n print(\\\"You will need to guess a random code.\\\")\\n print(\\\"For each guess, you will receive a hint.\\\")\\n print(\\\"In this hint, X denotes a correct letter, and O a letter in the original string but in a different position.\\\")\\n print()\\n\\n number_of_letters = safe_int_input(\\\"Select a number of possible letters for the code (2-20): \\\", 2, 20)\\n code_length = safe_int_input(\\\"Select a length for the code (4-10): \\\", 4, 10)\\n\\n letters = 'ABCDEFGHIJKLMNOPQRST'[:number_of_letters]\\n code = ''.join(random.choices(letters, k=code_length))\\n guesses = []\\n\\n while True:\\n print()\\n guess = input(f\\\"Enter a guess of length {code_length} ({letters}): \\\").upper().strip()\\n\\n if len(guess) != code_length or any([char not in letters for char in guess]):\\n continue\\n elif guess == code:\\n print(f\\\"\\\\nYour guess {guess} was correct!\\\")\\n break\\n else:\\n guesses.append(f\\\"{len(guesses)+1}: {' '.join(guess)} => {' '.join(encode(code, guess))}\\\")\\n\\n for i_guess in guesses:\\n print(\\\"------------------------------------\\\")\\n print(i_guess)\\n print(\\\"------------------------------------\\\")\\n\\n\\nif __name__ == '__main__':\\n play_game()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"sub MAIN (\\n Int :$colors where 1 < * < 21 = 6, Int :$length where 3 < * < 11 = 4,\\n Int :$guesses where 7 < * < 21 = 10, Bool :$repeat = False\\n ) {\\n my @valid = ('A' .. 'T')[^$colors];\\n my $puzzle = $repeat ?? @valid.roll($length) !! @valid.pick($length);\\n my @guesses;\\n\\n my $black = '●';\\n my $white = '○';\\n\\n loop {\\n clearscr();\\n say header();\\n printf \\\" %{$length * 2}s :: %s\\\\n\\\", @guesses[$_][0], @guesses[$_][1] for ^@guesses;\\n say '';\\n lose() if @guesses == $guesses;\\n my $guess = get-guess();\\n next unless $guess.&is-valid;\\n my $score = score($puzzle, $guess);\\n win() if $score eq ($black xx $length).join: ' ';\\n @guesses.push: [$guess, $score];\\n }\\n\\n sub header {\\n my $num = $guesses - @guesses;\\n qq:to/END/;\\n Valid letter, but wrong position: ○ - Correct letter and position: ●\\n Guess the {$length} element sequence containing the letters {@valid}\\n Repeats are {$repeat ?? '' !! 'not '}allowed. You have $num guess{ $num == 1 ?? '' !! 'es'} remaining.\\n END\\n }\\n\\n sub score ($puzzle, $guess) {\\n my @score;\\n for ^$length {\\n if $puzzle[$_] eq $guess[$_] {\\n @score.push: $black;\\n }\\n elsif $puzzle[$_] eq any(@$guess) {\\n @score.push: $white;\\n }\\n else {\\n @score.push('-');\\n }\\n }\\n @score.sort.reverse.join: ' ';\\n }\\n\\n sub clearscr { $*KERNEL ~~ /'win32'/ ?? run('cls') !! run('clear') }\\n\\n sub get-guess { (uc prompt 'Your guess?: ').comb(/@valid/) }\\n\\n sub is-valid (@guess) { so $length == @guess }\\n\\n sub win { say 'You Win! The correct answer is: ', $puzzle; exit }\\n\\n sub lose { say 'Too bad, you ran out of guesses. The solution was: ', $puzzle; exit }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm scores mastermind game with a human or CBLFs (Carbon Based Life Forms). */\\nparse arg let wid mxG oRep seed _ /*obtain optional arguments from the CL*/\\n arg . . . rep . /*get uppercase 4th argument \\\" \\\" \\\" */\\nif let=='' | let==\\\",\\\" then let= 20 /*Not specified? Then use the default.*/\\nif wid=='' | wid==\\\",\\\" then wid= 4 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif mxG=='' | mxG==\\\",\\\" then mxG= 20 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif rep=='' | rep==\\\",\\\" then rep= 0 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif datatype(seed,'W') then call random ,,seed /*use a seed for random repeatability. */\\nif abbrev( 'REPEATSALLOWED',rep,3) then rep=1 /*allow an abbreviated option for REP. */\\nif abbrev('NOREPEATSALLOWED',rep,3) then rep=0 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\ncall vet arg(), 'args' /*Vet the number of arguments entered. */ /*◄■■■■■■ optional vetting.*/\\ncall vet let, 'letters', 2, 20 /* \\\" \\\" \\\" \\\" letters in the code*/ /*◄■■■■■■ optional vetting.*/\\ncall vet wid, 'width', 4, 10 /* \\\" \\\" \\\" \\\" the width of code. */ /*◄■■■■■■ optional vetting.*/\\ncall vet mxG, 'maxGuess', 7, 20 /* \\\" \\\" \\\" \\\" maximum guesses. */ /*◄■■■■■■ optional vetting.*/\\ncall vet rep, 'REP', 0, 1e8 /* \\\" \\\" value if repeats are allowed*/ /*◄■■■■■■ optional vetting.*/\\ncall gen; yourG= 'Your guess must be exactly '\\n youve= \\\"You've already tried that guess \\\"\\n do prompt=0 by 0 until xx==wid; say /*play until guessed or QUIT is entered*/\\n say id 'Please enter a guess with ' wid ' letters [or Quit]:'\\n pull g; g=space(g,0); L=length(g); if abbrev('QUIT',g,1) then exit 0\\n if L\\\\==wid then do; say id '***error***' yourG wid \\\" letters.\\\"; iterate; end\\n call dups /*look through the history log for dups*/\\n q=?; XX=0; OO=0; try=try+1 /*initialize some REXX vars; bump TRY.*/\\n\\n do j=1 for L; if substr(g,j,1) \\\\== substr(q,j,1) then iterate /*hit? */\\n xx=xx+1; q=overlay('▒', q, j) /*bump the XX correct count. */\\n end /*j*/ /* [↑] XX correct count; scrub guess.*/\\n\\n do k=1 for L; _=substr(g, k, 1) /*process the count for \\\"spots\\\". */\\n if pos(_, q)==0 then iterate /*is this (spot) letter in the code? */\\n oo=oo+1; q=translate(q, , _) /*bump the OO spot count. */\\n end /*k*/ /* [↑] OO spot count; & scrub guess.*/\\n say\\n @.try=id right('guess' try, 11) ' ('mxG \\\"is the max):\\\" g '──►' ,\\n copies('X', xx)copies(\\\"O\\\", oo)copies('-', wid-xx-oo)\\n call hist\\n if try==mxG then do; say; say id \\\"you've used the maximum guesses:\\\" mxG\\n say; say id \\\"The code was: \\\" ?; say; exit 1\\n end\\n end /*prompt*/\\nsay; say \\\" ┌─────────────────────────────────────────┐\\\"\\n say \\\" │ │\\\"\\n say \\\" │ Congratulations, you've guessed it !! │\\\"\\n say \\\" │ │\\\"\\n say \\\" └─────────────────────────────────────────┘\\\"\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ndups: do h=1 for try; if g\\\\=word(@.h, 8) then iterate /*any duplicated guesses? */\\n say; say id youve \\\" (guess number\\\" h').'; iterate prompt; end /*h*/; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngen: if rep==0 then reps= 'no' /*create a literal for the prompt msg. */\\n else reps=\\n @abc= 'QWERTYUIOPASDFGHJKLZXCVBNM' /*capital letters used for random code.*/\\n id='────────'; try=0; L@abc=length(@abc) /*identifier in front of msg from here.*/\\n ?=\\n do until length(?)==wid /*gen random codes 'til there's enough.*/\\n r=substr(@abc, random(1, L@abc), 1) /*generate a random letter, 1 at a time*/\\n if \\\\rep & pos(r, ?)\\\\==0 then iterate /*maybe don't allow a repeated digit.*/\\n ?=? || r; if ?=='QUIT'&let==4 then ?= /*append random letter; ··· except this*/\\n end /*until*/ /* [↑] builds a unique N-letter code.*/\\n say\\n say id 'A random code of ' wid \\\"letters (out of a possible \\\" let ' letters) '\\n say id 'has been generated (with' reps \\\"repeats).\\\"\\n return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nhist: do hist=1 for try; say @.hist; end; return /*show \\\"guess\\\" history.*/\\ns: if arg(1)==1 then return ''; return \\\"s\\\" /*a simpler pluraizer. */\\nser: say; say; say '***error***' arg(1); say; say; exit 13\\n/*──────────────────────────────────────────────────────────────────────────────────────*/ /*◄■■■■■■ optional vetting.*/\\nvet: parse arg val,?,mn,mx /*vet (validate) a specified argument. */ /*◄■■■■■■ optional vetting.*/\\n if ?==\\\"args\\\" & (val>1 | _\\\\='') then call ser \\\"Too many arguments specified. \\\" _ /*◄■■■■■■ optional vetting.*/\\n if ?==\\\"args\\\" then return /*◄■■■■■■ optional vetting.*/\\n if \\\\datatype(val, 'N') then call ser ? \\\"isn't numeric: \\\" val /*◄■■■■■■ optional vetting.*/\\n if \\\\datatype(val, 'W') then call ser ? \\\"isn't an integer: \\\" val /*◄■■■■■■ optional vetting.*/\\n if val < mn then call ser ? \\\"has a value less than \\\" mn /*◄■■■■■■ optional vetting.*/\\n if val > mx then call ser ? \\\"has a value greater than \\\" mx /*◄■■■■■■ optional vetting.*/\\n if ?=='REP' & \\\\datatype(val,W) then call ser \\\"Value for REPEATS isn't valid: \\\" oRep /*◄■■■■■■ optional vetting.*/\\n return 1\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Mastermind\\n\\ncolors = [\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"D\\\"]\\nplaces = list(2)\\nmind = list(len(colors))\\nrands = list(len(colors))\\nmaster = list(len(colors))\\ntest = list(len(colors))\\nguesses = 7\\nrepeat = false\\nnr = 0\\n\\nif repeat\\n for n = 1 to len(colors)\\n while true\\n rnd = random(len(colors)-1) + 1\\n if rands[rnd] != 1\\n mind[n] = rnd\\n rands[rnd] = 1\\n exit\\n ok\\n end\\n next\\nelse\\n for n = 1 to len(colors)\\n rnd = random(len(colors)-1) + 1\\n mind[n] = rnd\\n next\\nok\\n\\nfor n = 1 to len(colors)\\n master[n] = char(64+mind[n])\\nnext\\nwhile true\\n for p = 1 to len(places)\\n places[p] = 0\\n next\\n nr = nr + 1\\n see \\\"Your guess (ABCD)? \\\"\\n give testbegin\\n for d = 1 to len(test)\\n test[d] = testbegin[d]\\n next\\n flag = 1\\n for n = 1 to len(test)\\n if upper(test[n]) != master[n]\\n flag = 0\\n ok\\n next\\n if flag = 1\\n exit\\n else\\n for x = 1 to len(master)\\n if upper(test[x]) = master[x]\\n places[1] = places[1] + 1\\n ok\\n next\\n mastertemp = master\\n for p = 1 to len(test)\\n pos = find(mastertemp, upper(test[p]))\\n if pos > 0\\n del(mastertemp, pos)\\n places[2] = places[2] + 1\\n ok\\n next\\n ok\\n place1 = places[1]\\n place2 = places[2] - place1\\n place3 = len(master) - (place1 + place2)\\n showresult(test, place1, place2, place3)\\n if nr = guesses\\n exit\\n ok\\nend\\nsee \\\"Well done!\\\" + nl\\nsee \\\"End of game\\\" + nl\\n\\nfunc showresult(test, place1, place2, place3)\\n see \\\"\\\" + nr + \\\" : \\\"\\n for r = 1 to len(test)\\n see test[r]\\n next\\n see \\\" : \\\"\\n for n1 = 1 to place1\\n see \\\"X\\\" + \\\" \\\"\\n next\\n for n2 = 1 to place2\\n see \\\"O\\\" + \\\" \\\"\\n next\\n for n3 = 1 to place3\\n see \\\"-\\\" + \\\" \\\"\\n next\\n see nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"extern crate rand;\\n\\nuse rand::prelude::*;\\nuse std::io;\\n\\nfn main() {\\n let mut input_line = String::new();\\n let colors_n;\\n let code_len;\\n let guesses_max;\\n let colors_dup;\\n\\n loop {\\n println!(\\\"Please enter the number of colors to be used in the game (2 - 20): \\\");\\n input_line.clear();\\n io::stdin()\\n .read_line(&mut input_line)\\n .expect(\\\"The read line failed.\\\");\\n match (input_line.trim()).parse::<i32>() {\\n Ok(n) => {\\n if n >= 2 && n <= 20 {\\n colors_n = n;\\n break;\\n } else {\\n println!(\\\"Outside of range (2 - 20).\\\");\\n }\\n }\\n Err(_) => println!(\\\"Invalid input.\\\"),\\n }\\n }\\n let colors = &\\\"ABCDEFGHIJKLMNOPQRST\\\"[..colors_n as usize];\\n\\n println!(\\\"Playing with colors {}.\\\\n\\\", colors);\\n\\n loop {\\n println!(\\\"Are duplicated colors allowed in the code? (Y/N): \\\");\\n input_line.clear();\\n io::stdin()\\n .read_line(&mut input_line)\\n .expect(\\\"The read line failed.\\\");\\n if [\\\"Y\\\", \\\"N\\\"].contains(&&input_line.trim().to_uppercase()[..]) {\\n colors_dup = input_line.trim().to_uppercase() == \\\"Y\\\";\\n break;\\n } else {\\n println!(\\\"Invalid input.\\\");\\n }\\n }\\n println!(\\n \\\"Duplicated colors {}allowed.\\\\n\\\",\\n if colors_dup { \\\"\\\" } else { \\\"not \\\" }\\n );\\n loop {\\n let min_len = if colors_dup { 4 } else { 4.min(colors_n) };\\n let max_len = if colors_dup { 10 } else { 10.min(colors_n) };\\n println!(\\n \\\"Please enter the length of the code ({} - {}): \\\",\\n min_len, max_len\\n );\\n input_line.clear();\\n io::stdin()\\n .read_line(&mut input_line)\\n .expect(\\\"The read line failed.\\\");\\n match (input_line.trim()).parse::<i32>() {\\n Ok(n) => {\\n if n >= min_len && n <= max_len {\\n code_len = n;\\n break;\\n } else {\\n println!(\\\"Outside of range ({} - {}).\\\", min_len, max_len);\\n }\\n }\\n Err(_) => println!(\\\"Invalid input.\\\"),\\n }\\n }\\n println!(\\\"Code of length {}.\\\\n\\\", code_len);\\n loop {\\n println!(\\\"Please enter the number of guesses allowed (7 - 20): \\\");\\n input_line.clear();\\n io::stdin()\\n .read_line(&mut input_line)\\n .expect(\\\"The read line failed.\\\");\\n match (input_line.trim()).parse::<i32>() {\\n Ok(n) => {\\n if n >= 7 && n <= 20 {\\n guesses_max = n;\\n break;\\n } else {\\n println!(\\\"Outside of range (7 - 20).\\\");\\n }\\n }\\n Err(_) => println!(\\\"Invalid input.\\\"),\\n }\\n }\\n println!(\\\"{} guesses allowed.\\\\n\\\", guesses_max);\\n\\n let mut rng = rand::thread_rng();\\n let mut code;\\n if colors_dup {\\n code = (0..code_len)\\n .map(|_| ((65 + rng.gen_range(0, colors_n) as u8) as char))\\n .collect::<Vec<_>>();\\n } else {\\n code = colors.chars().collect::<Vec<_>>();\\n code.shuffle(&mut rng);\\n code = code[..code_len as usize].to_vec();\\n }\\n //code = vec!['J', 'A', 'R', 'D', 'A', 'N', 'I'];\\n //println!(\\\"Secret code: {:?}\\\", code);\\n let mut guesses: Vec<(String, String)> = vec![];\\n let mut i = 1;\\n loop {\\n println!(\\\"Your guess ({}/{})?: \\\", i, guesses_max);\\n input_line.clear();\\n io::stdin()\\n .read_line(&mut input_line)\\n .expect(\\\"The read line failed.\\\");\\n let mut guess = input_line.trim().to_uppercase();\\n if guess.len() as i32 > code_len {\\n guess = guess[..code_len as usize].to_string();\\n }\\n let guess_v = guess.chars().collect::<Vec<char>>();\\n let res = evaluate(&code, &guess_v);\\n guesses.push((guess, res.clone()));\\n let width = 8 + guesses_max.to_string().len() + code_len as usize * 2;\\n println!(\\\"{}\\\", \\\"-\\\".repeat(width));\\n for (i, guess) in guesses.iter().enumerate() {\\n let line = format!(\\n \\\" {:w1$} : {:w2$} : {:w2$} \\\",\\n i + 1,\\n guess.0,\\n guess.1,\\n w1 = guesses_max.to_string().len(),\\n w2 = code_len as usize\\n );\\n println!(\\\"{}\\\", line);\\n }\\n println!(\\\"{}\\\", \\\"-\\\".repeat(width));\\n if res == \\\"X\\\".repeat(code_len as usize) {\\n println!(\\\"You won! Code: {}\\\", code.into_iter().collect::<String>());\\n break;\\n }\\n i += 1;\\n if i > guesses_max {\\n println!(\\\"You lost. Code: {}\\\", code.into_iter().collect::<String>());\\n break;\\n }\\n }\\n}\\n\\nfn evaluate(code: &[char], guess: &[char]) -> String {\\n let mut res: Vec<char> = vec![];\\n for i in 0..guess.len() {\\n if guess[i] == code[i] {\\n res.push('X');\\n } else if code.contains(&guess[i]) {\\n res.push('O');\\n } else {\\n res.push('-');\\n }\\n }\\n res.sort_by(|a, b| b.cmp(a));\\n res.into_iter().collect()\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \" -- Create Table\\n -- Distinct combination\\n --- R :Red, B :Blue, G: Green, V: Violet, O: Orange, Y: Yellow\\n DROP TYPE IF EXISTS color cascade;CREATE TYPE color AS ENUM ('R', 'B', 'G', 'V', 'O', 'Y');\\n\\n DROP TABLE IF EXISTS guesses cascade ; CREATE TABLE guesses (\\n first color,\\n second color,\\n third color ,\\n fourth color\\n );\\n CREATE TABLE mastermind () inherits (guesses);\\n\\n INSERT INTO mastermind values ('G', 'B', 'R', 'V');\\n\\n\\n INSERT INTO guesses values ('Y', 'Y', 'B', 'B');\\n INSERT INTO guesses values ('V', 'R', 'R', 'Y');\\n INSERT INTO guesses values ('G', 'V', 'G', 'Y');\\n INSERT INTO guesses values ('R', 'R', 'V', 'Y');\\n INSERT INTO guesses values ('B', 'R', 'G', 'V');\\n INSERT INTO guesses values ('G', 'B', 'R', 'V');\\n\\n\\n --- Matches Black\\n CREATE OR REPLACE FUNCTION check_black(guesses, mastermind) RETURNS integer AS $$\\n SELECT (\\n ($1.first = $2.first)::int +\\n ($1.second = $2.second)::int +\\n ($1.third = $2.third)::int +\\n ($1.fourth = $2.fourth)::int\\n );\\n $$ LANGUAGE SQL;\\n\\n --- Matches White\\n CREATE OR REPLACE FUNCTION check_white(guesses, mastermind) RETURNS integer AS $$\\n SELECT (\\n case when ($1.first = $2.first) then 0 else 0 end +\\n case when ($1.second = $2.second) then 0 else 0 end +\\n case when ($1.third = $2.third) then 0 else 0 end +\\n case when ($1.fourth = $2.fourth) then 0 else 0 end +\\n case when ($1.first != $2.first) then (\\n $1.first = $2.second or\\n $1.first = $2.third or\\n $1.first = $2.fourth\\n )::int else 0 end +\\n case when ($1.second != $2.second) then (\\n $1.second = $2.first or\\n $1.second = $2.third or\\n $1.second = $2.fourth\\n )::int else 0 end +\\n case when ($1.third != $2.third) then (\\n $1.third = $2.first or\\n $1.third = $2.second or\\n $1.third = $2.fourth\\n )::int else 0 end +\\n case when ($1.fourth != $2.fourth) then (\\n $1.fourth = $2.first or\\n $1.fourth = $2.second or\\n $1.fourth = $2.third\\n )::int else 0 end\\n ) from guesses\\n $$ LANGUAGE SQL;\\n\\n\\n\\n SELECT guesses,\\n check_black(guesses.*, mastermind.*),\\n check_white(guesses.*, mastermind.*)\\n FROM guesses, mastermind\\n\",\n \"language\": \"SQL\"\n },\n {\n \"code\": \"import \\\"random\\\" for Random\\nimport \\\"./ioutil\\\" for Input\\nimport \\\"./str\\\" for Str\\n\\nvar Rand = Random.new()\\n\\nclass Mastermind {\\n construct new(codeLen, colorsCnt, guessCnt, repeatClr) {\\n var color = \\\"ABCDEFGHIJKLMNOPQRST\\\"\\n _codeLen = codeLen.clamp(4, 10)\\n var cl = colorsCnt\\n if (!repeatClr && cl < _codeLen) cl = _codeLen\\n _colorsCnt = cl.clamp(2, 20)\\n _guessCnt = guessCnt.clamp(7, 20)\\n _repeatClr = repeatClr\\n _colors = color.take(_colorsCnt).join()\\n _combo = \\\"\\\"\\n _guesses = []\\n _results = []\\n }\\n\\n play() {\\n var win = false\\n _combo = getCombo_()\\n while (_guessCnt != 0) {\\n showBoard_()\\n if (checkInput_(getInput_())) {\\n win = true\\n break\\n }\\n _guessCnt = _guessCnt - 1\\n }\\n System.print(\\\"\\\\n\\\\n--------------------------------\\\")\\n if (win) {\\n System.print(\\\"Very well done!\\\\nYou found the code: %(_combo)\\\")\\n } else {\\n System.print(\\\"I am sorry, you couldn't make it!\\\\nThe code was: %(_combo)\\\")\\n }\\n System.print(\\\"--------------------------------\\\\n\\\")\\n }\\n\\n showBoard_() {\\n for (x in 0..._guesses.count) {\\n System.print(\\\"\\\\n--------------------------------\\\")\\n System.write(\\\"%(x + 1): \\\")\\n for (y in _guesses[x]) System.write(\\\"%(y) \\\")\\n System.write(\\\" : \\\")\\n for (y in _results[x]) System.write(\\\"%(y) \\\")\\n var z = _codeLen - _results[x].count\\n if (z > 0) System.write(\\\"- \\\" * z)\\n }\\n System.print(\\\"\\\\n\\\")\\n }\\n\\n getInput_() {\\n while (true) {\\n var a = Str.upper(Input.text(\\\"Enter your guess (%(_colors)): \\\", 1)).take(_codeLen)\\n if (a.all { |c| _colors.contains(c) } ) return a.join()\\n }\\n }\\n\\n checkInput_(a) {\\n _guesses.add(a.toList)\\n var black = 0\\n var white = 0\\n var gmatch = List.filled(_codeLen, false)\\n var cmatch = List.filled(_codeLen, false)\\n for (i in 0..._codeLen) {\\n if (a[i] == _combo[i]) {\\n gmatch[i] = true\\n cmatch[i] = true\\n black = black + 1\\n }\\n }\\n for (i in 0..._codeLen) {\\n if (gmatch[i]) continue\\n for (j in 0..._codeLen) {\\n if (i == j || cmatch[j]) continue\\n if (a[i] == _combo[j]) {\\n cmatch[j] = true\\n white = white + 1\\n break\\n }\\n }\\n }\\n var r = []\\n r.addAll((\\\"X\\\" * black).toList)\\n r.addAll((\\\"O\\\" * white).toList)\\n _results.add(r)\\n return black == _codeLen\\n }\\n\\n getCombo_() {\\n var c = \\\"\\\"\\n var clr = _colors\\n for (s in 0..._codeLen) {\\n var z = Rand.int(clr.count)\\n c = c + clr[z]\\n if (!_repeatClr) Str.delete(clr, z)\\n }\\n return c\\n }\\n}\\n\\nvar m = Mastermind.new(4, 8, 12, false)\\nm.play()\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"class MasterMind{\\n fcn init(code_len,guess_count){\\n var codeLen =code_len.max(4).min(10);\\n var guessCnt=guess_count.max(7).min(20);\\n var colors =\\\"ABCDEFGHIJKLMNOPQRST\\\"[0,codeLen];\\n }\\n fcn play{\\n guesses,win,blackWhite:=List(),False,Void;\\n code:=codeLen.pump(String,'wrap(_){ colors[(0).random(codeLen)] });\\n do(guessCnt){\\n\\t str:=getInput();\\n\\t win,blackWhite = checkInput(str,code);\\n\\t guesses.append(T(str,blackWhite));\\n\\t showBoard(guesses);\\n\\t if(win) break;\\n }\\n if(win) println(\\\"--------------------------------\\\\n\\\",\\n\\t\\t\\\"Very well done!\\\\nYou found the code: \\\",code);\\n else println(\\\"--------------------------------\\\\n\\\",\\n\\t\\t\\\"I am sorry, you didn't discover the code!\\\\nThe code was: \\\",code);\\n }\\n fcn [private] showBoard(guesses){\\n foreach n,gbw in ([1..].zip(guesses)){\\n guess,blackWhite := gbw;\\n println(\\\"%2d: %s :% s %s\\\".fmt(n,\\n\\t guess.split(\\\"\\\").concat(\\\" \\\"), blackWhite.split(\\\"\\\").concat(\\\" \\\"),\\n\\t \\\"- \\\"*(codeLen - blackWhite.len())));\\n }\\n }\\n fcn [private] getInput{\\n while(True){\\n\\t a:=ask(\\\"Enter your guess (\\\" + colors + \\\"): \\\").toUpper()[0,codeLen];\\n\\t if(not (a-colors) and a.len()>=codeLen) return(a);\\n }\\n }\\n fcn [private] checkInput(guess,code){\\n\\t// black: guess is correct in both color and position\\n // white: correct color, wrong position\\n\\tmatched,black := guess.split(\\\"\\\").zipWith('==,code), matched.sum(0);\\n\\t// remove black from code, prepend null to make counting easy\\n\\tcode = L(\\\"-\\\").extend(matched.zipWith('wrap(m,peg){ m and \\\"-\\\" or peg },code));\\n\\twhite:=0; foreach m,p in (matched.zip(guess)){\\n\\t if(not m and (z:=code.find(p))){ white+=1; code[z]=\\\"-\\\"; }\\n\\t}\\n\\treturn(black==codeLen,\\\"X\\\"*black + \\\"O\\\"*white)\\n }\\n}(4,12).play();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Mastermind"}}},{"rowIdx":469,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Matrices\nfrom: http://rosettacode.org/wiki/Matrix_chain_multiplication\nnote: Discrete math\n","language":"00-META"},{"code":";Problem\nUsing the most straightforward algorithm (which we assume here), computing the [[Matrix multiplication|product of two matrices]] of dimensions (n1,n2) and (n2,n3) requires n1*n2*n3 [[wp:Multiply–accumulate_operation|FMA]] operations. The number of operations required to compute the product of matrices A1, A2... An depends on the order of matrix multiplications, hence on where parens are put. Remember that the matrix product is associative, but not commutative, hence only the parens can be moved.\n\nFor instance, with four matrices, one can compute A(B(CD)), A((BC)D), (AB)(CD), (A(BC))D, (AB)C)D. The number of different ways to put the parens is a [[Catalan numbers|Catalan number]], and grows exponentially with the number of factors.\n\nHere is an example of computation of the total cost, for matrices A(5,6), B(6,3), C(3,1):\n\n* AB costs 5*6*3=90 and produces a matrix of dimensions (5,3), then (AB)C costs 5*3*1=15. The total cost is 105.\n* BC costs 6*3*1=18 and produces a matrix of dimensions (6,1), then A(BC) costs 5*6*1=30. The total cost is 48.\n\nIn this case, computing (AB)C requires more than twice as many operations as A(BC). The difference can be much more dramatic in real cases.\n\n;Task\n\nWrite a function which, given a list of the successive dimensions of matrices A1, A2... An, of arbitrary length, returns the optimal way to compute the matrix product, and the total cost. Any sensible way to describe the optimal solution is accepted. The input list does not duplicate shared dimensions: for the previous example of matrices A,B,C, one will only pass the list [5,6,3,1] (and ''not'' [5,6,6,3,3,1]) to mean the matrix dimensions are respectively (5,6), (6,3) and (3,1). Hence, a product of n matrices is represented by a list of n+1 dimensions.\n\nTry this function on the following two lists:\n\n* [1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2]\n* [1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]\n\nTo solve the task, it's possible, but not required, to write a function that enumerates all possible ways to parenthesize the product. This is not optimal because of the many duplicated computations, and this task is a classic application of [[:wp:Dynamic programming|dynamic programming]].\n\nSee also [[:wp:Matrix chain multiplication|Matrix chain multiplication]] on Wikipedia.\n\n__TOC__\n\n","language":"00-TASK"},{"code":"T Optimizer\n [Int] dims\n [[Int]] m, s\n\n F (dims)\n .dims = dims\n\n F findMatrixChainOrder()\n V n = .dims.len - 1\n .m = [[0] * n] * n\n .s = [[0] * n] * n\n\n L(lg) 1 .< n\n L(i) 0 .< n - lg\n V j = i + lg\n .m[i][j] = 7FFF'FFFF\n L(k) i .< j\n V cost = .m[i][k] + .m[k + 1][j] + .dims[i] * .dims[k + 1] * .dims[j + 1]\n I cost < .m[i][j]\n .m[i][j] = cost\n .s[i][j] = k\n\n F optimalChainOrder(i, j)\n I i == j\n R String(Char(code' i + ‘A’.code))\n E\n R ‘(’(.optimalChainOrder(i, .s[i][j]))‘’\n ‘’(.optimalChainOrder(.s[i][j] + 1, j))‘)’\n\nV Dims1 = [5, 6, 3, 1]\nV Dims2 = [1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2]\nV Dims3 = [1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]\n\nL(dims) [Dims1, Dims2, Dims3]\n V opt = Optimizer(dims)\n opt.findMatrixChainOrder()\n print(‘Dims: ’dims)\n print(‘Order: ’opt.optimalChainOrder(0, dims.len - 2))\n print(‘Cost: ’opt.m[0][dims.len - 2])\n print(‘’)\n","language":"11l"},{"code":"package mat_chain is\n type Vector is array (Natural range <>) of Integer;\n procedure Chain_Multiplication (Dims : Vector);\nend mat_chain;\n","language":"Ada"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\nwith Ada.Strings.Unbounded; use Ada.Strings.Unbounded;\n\npackage body mat_chain is\n type Result_Matrix is\n array (Positive range <>, Positive range <>) of Integer;\n\n --------------------------\n -- Chain_Multiplication --\n --------------------------\n\n procedure Chain_Multiplication (Dims : Vector) is\n n : Natural := Dims'Length - 1;\n S : Result_Matrix (1 .. n, 1 .. n);\n m : Result_Matrix (1 .. n, 1 .. n);\n procedure Print (Item : Vector) is\n begin\n Put (\"Array Dimension = (\");\n for I in Item'Range loop\n Put (Item (I)'Image);\n if I < Item'Last then\n Put (\",\");\n else\n Put (\")\");\n end if;\n end loop;\n New_Line;\n end Print;\n\n procedure Chain_Order (Item : Vector) is\n J : Natural;\n Cost : Natural;\n Temp : Natural;\n\n begin\n for idx in 1 .. n loop\n m (idx, idx) := 0;\n end loop;\n\n for Len in 2 .. n loop\n for I in 1 .. n - Len + 1 loop\n J := I + Len - 1;\n m (I, J) := Integer'Last;\n for K in I .. J - 1 loop\n Temp := Item (I - 1) * Item (K) * Item (J);\n Cost := m (I, K) + m (K + 1, J) + Temp;\n if Cost < m (I, J) then\n m (I, J) := Cost;\n S (I, J) := K;\n end if;\n end loop;\n end loop;\n end loop;\n end Chain_Order;\n\n function Optimal_Parens return String is\n function Construct\n (S : Result_Matrix; I : Natural; J : Natural)\n return Unbounded_String\n is\n Us : Unbounded_String := Null_Unbounded_String;\n Char_Order : Character;\n begin\n if I = J then\n Char_Order := Character'Val (I + 64);\n Append (Source => Us, New_Item => Char_Order);\n return Us;\n else\n Append (Source => Us, New_Item => '(');\n Append (Source => Us, New_Item => Construct (S, I, S (I, J)));\n Append (Source => Us, New_Item => '*');\n Append\n (Source => Us, New_Item => Construct (S, S (I, J) + 1, J));\n Append (Source => Us, New_Item => ')');\n return Us;\n end if;\n end Construct;\n\n begin\n return To_String (Construct (S, 1, n));\n\n end Optimal_Parens;\n\n begin\n Chain_Order (Dims);\n Print (Dims);\n Put_Line (\"Cost = \" & Integer'Image (m (1, n)));\n Put_Line (\"Optimal Multiply = \" & Optimal_Parens);\n end Chain_Multiplication;\n\nend mat_chain;\n","language":"Ada"},{"code":"with Mat_Chain; use Mat_Chain;\nwith Ada.Text_IO; use Ada.Text_IO;\n\nprocedure chain_main is\n V1 : Vector := (5, 6, 3, 1);\n V2 : Vector := (1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2);\n V3 : Vector := (1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10);\nbegin\n Chain_Multiplication(V1);\n New_Line;\n Chain_Multiplication(V2);\n New_Line;\n Chain_Multiplication(V3);\nend chain_main;\n","language":"Ada"},{"code":"#include <stdio.h>\n#include <limits.h>\n#include <stdlib.h>\n\nint **m;\nint **s;\n\nvoid optimal_matrix_chain_order(int *dims, int n) {\n int len, i, j, k, temp, cost;\n n--;\n m = (int **)malloc(n * sizeof(int *));\n for (i = 0; i < n; ++i) {\n m[i] = (int *)calloc(n, sizeof(int));\n }\n\n s = (int **)malloc(n * sizeof(int *));\n for (i = 0; i < n; ++i) {\n s[i] = (int *)calloc(n, sizeof(int));\n }\n\n for (len = 1; len < n; ++len) {\n for (i = 0; i < n - len; ++i) {\n j = i + len;\n m[i][j] = INT_MAX;\n for (k = i; k < j; ++k) {\n temp = dims[i] * dims[k + 1] * dims[j + 1];\n cost = m[i][k] + m[k + 1][j] + temp;\n if (cost < m[i][j]) {\n m[i][j] = cost;\n s[i][j] = k;\n }\n }\n }\n }\n}\n\nvoid print_optimal_chain_order(int i, int j) {\n if (i == j)\n printf(\"%c\", i + 65);\n else {\n printf(\"(\");\n print_optimal_chain_order(i, s[i][j]);\n print_optimal_chain_order(s[i][j] + 1, j);\n printf(\")\");\n }\n}\n\nint main() {\n int i, j, n;\n int a1[4] = {5, 6, 3, 1};\n int a2[13] = {1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2};\n int a3[12] = {1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10};\n int *dims_list[3] = {a1, a2, a3};\n int sizes[3] = {4, 13, 12};\n for (i = 0; i < 3; ++i) {\n printf(\"Dims : [\");\n n = sizes[i];\n for (j = 0; j < n; ++j) {\n printf(\"%d\", dims_list[i][j]);\n if (j < n - 1) printf(\", \"); else printf(\"]\\n\");\n }\n optimal_matrix_chain_order(dims_list[i], n);\n printf(\"Order : \");\n print_optimal_chain_order(0, n - 2);\n printf(\"\\nCost : %d\\n\\n\", m[0][n - 2]);\n for (j = 0; j <= n - 2; ++j) free(m[j]);\n free(m);\n for (j = 0; j <= n - 2; ++j) free(s[j]);\n free(s);\n }\n return 0;\n}\n","language":"C"},{"code":"#include <cstdint>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <vector>\n\nconstexpr int32_t MAXIMUM_VALUE = 2'147'483'647;\n\nstd::vector<std::vector<int32_t>> cost;\nstd::vector<std::vector<int32_t>> order;\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\nint32_t matrix_chain_order(const std::vector<int32_t>& dimensions) {\n\tconst uint64_t size = dimensions.size() - 1;\n\tcost = { size, std::vector<int32_t>(size, 0) };\n\torder = { size, std::vector<int32_t>(size, 0) };\n\n\tfor ( uint64_t m = 1; m < size; ++m ) {\n\t\tfor ( uint64_t i = 0; i < size - m; ++i ) {\n\t\t\tint32_t j = i + m;\n\t\t\tcost[i][j] = MAXIMUM_VALUE;\n\t\t\tfor ( int32_t k = i; k < j; ++k ) {\n\t\t\t\tint32_t current_cost = cost[i][k] + cost[k + 1][j]\n\t\t\t\t\t+ dimensions[i] * dimensions[k + 1] * dimensions[j + 1];\n\t\t\t\tif ( current_cost < cost[i][j] ) {\n\t\t\t\t\tcost[i][j] = current_cost;\n\t\t\t\t\torder[i][j] = k;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn cost[0][size - 1];\n}\n\nstd::string get_optimal_parenthesizations(const std::vector<std::vector<int32_t>>& order,\n\t\t\t\t\t\t\t\t\t\t const uint64_t& i, const uint64_t& j) {\n\tif ( i == j ) {\n\t\tstd::string result(1, char(i + 65));\n\t\treturn result;\n\t} else {\n\t\tstd::stringstream stream;\n\t\tstream << \"(\" << get_optimal_parenthesizations(order, i, order[i][j])\n\t\t\t << \" * \" << get_optimal_parenthesizations(order, order[i][j] + 1, j) << \")\";\n\t\treturn stream.str();\n\t}\n}\n\nvoid matrix_chain_multiplication(const std::vector<int32_t>& dimensions) {\n\tstd::cout << \"Array Dimension = \"; print_vector(dimensions);\n\tstd::cout << \"Cost = \" << matrix_chain_order(dimensions) << std::endl;\n\tstd::cout << \"Optimal Multiply = \"\n\t\t\t << get_optimal_parenthesizations(order, 0, order.size() - 1) << std::endl << std::endl;\n}\n\nint main() {\n\tmatrix_chain_multiplication({ 5, 6, 3, 1 });\n\tmatrix_chain_multiplication({ 1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2 });\n\tmatrix_chain_multiplication({ 1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10 });\n}\n","language":"C++"},{"code":"using System;\n\nclass MatrixChainOrderOptimizer {\n private int[,] m;\n private int[,] s;\n\n void OptimalMatrixChainOrder(int[] dims) {\n int n = dims.Length - 1;\n m = new int[n, n];\n s = new int[n, n];\n for (int len = 1; len < n; ++len) {\n for (int i = 0; i < n - len; ++i) {\n int j = i + len;\n m[i, j] = Int32.MaxValue;\n for (int k = i; k < j; ++k) {\n int temp = dims[i] * dims[k + 1] * dims[j + 1];\n int cost = m[i, k] + m[k + 1, j] + temp;\n if (cost < m[i, j]) {\n m[i, j] = cost;\n s[i, j] = k;\n }\n }\n }\n }\n }\n\n void PrintOptimalChainOrder(int i, int j) {\n if (i == j)\n Console.Write((char)(i + 65));\n else {\n Console.Write(\"(\");\n PrintOptimalChainOrder(i, s[i, j]);\n PrintOptimalChainOrder(s[i, j] + 1, j);\n Console.Write(\")\");\n }\n }\n\n static void Main() {\n var mcoo = new MatrixChainOrderOptimizer();\n var dimsList = new int[3][];\n dimsList[0] = new int[4] {5, 6, 3, 1};\n dimsList[1] = new int[13] {1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2};\n dimsList[2] = new int[12] {1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10};\n for (int i = 0; i < dimsList.Length; ++i) {\n Console.Write(\"Dims : [\");\n int n = dimsList[i].Length;\n for (int j = 0; j < n; ++j) {\n Console.Write(dimsList[i][j]);\n if (j < n - 1)\n Console.Write(\", \");\n else\n Console.WriteLine(\"]\");\n }\n mcoo.OptimalMatrixChainOrder(dimsList[i]);\n Console.Write(\"Order : \");\n mcoo.PrintOptimalChainOrder(0, n - 2);\n Console.WriteLine(\"\\nCost : {0}\\n\", mcoo.m[0, n - 2]);\n }\n }\n}\n","language":"C-sharp"},{"code":"module optim_mod\n implicit none\ncontains\n subroutine optim(a)\n implicit none\n integer :: a(:), n, i, j, k\n integer, allocatable :: u(:, :)\n integer(8) :: c\n integer(8), allocatable :: v(:, :)\n\n n = ubound(a, 1) - 1\n allocate (u(n, n), v(n, n))\n v = huge(v)\n u(:, 1) = -1\n v(:, 1) = 0\n do j = 2, n\n do i = 1, n - j + 1\n do k = 1, j - 1\n c = v(i, k) + v(i + k, j - k) + int(a(i), 8) * int(a(i + k), 8) * int(a(i + j), 8)\n if (c < v(i, j)) then\n u(i, j) = k\n v(i, j) = c\n end if\n end do\n end do\n end do\n write (*, \"(I0,' ')\", advance=\"no\") v(1, n)\n call aux(1, n)\n print *\n deallocate (u, v)\n contains\n recursive subroutine aux(i, j)\n integer :: i, j, k\n\n k = u(i, j)\n if (k < 0) then\n write (*, \"(I0)\", advance=\"no\") i\n else\n write (*, \"('(')\", advance=\"no\")\n call aux(i, k)\n write (*, \"('*')\", advance=\"no\")\n call aux(i + k, j - k)\n write (*, \"(')')\", advance=\"no\")\n end if\n end subroutine\n end subroutine\nend module\n\nprogram matmulchain\n use optim_mod\n implicit none\n\n call optim([5, 6, 3, 1])\n call optim([1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2])\n call optim([1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10])\nend program\n","language":"Fortran"},{"code":"Dim Shared As Integer U(), V()\n\nSub Aux(i As Integer, j As Integer)\n Dim As Integer k = U(i, j)\n If k < 0 Then\n Print Str(i);\n Else\n Print \"(\";\n Aux(i, k)\n Print \"*\";\n Aux(i + k, j - k)\n Print \")\";\n End If\nEnd Sub\n\nSub Optimize(a() As Integer)\n Dim As Integer i, j, k, c\n Dim As Integer n = Ubound(a) - 1\n Redim U(n, n), V(n, n)\n For i = 1 To n\n U(i, 1) = -1\n V(i, 1) = 0\n Next i\n\n For j = 2 To n\n For i = 1 To n - j + 1\n V(i, j) = &H7FFFFFFF\n For k = 1 To j - 1\n c = V(i, k) + V(i + k, j - k) + a(i) * a(i + k) * a(i + j)\n If c < V(i, j) Then\n U(i, j) = k\n V(i, j) = c\n End If\n Next k\n Next i\n Next j\n\n Print V(1, n); \" \";\n Aux(1, n)\n Print\n Erase U, V\nEnd Sub\n\nDim As Integer A1(1 To 4) = {5, 6, 3, 1}\nOptimize(A1())\nDim As Integer A2(1 To 13) = {1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2}\nOptimize(A2())\nDim As Integer A3(1 To 12) = {1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10}\nOptimize(A3())\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\n// PrintMatrixChainOrder prints the optimal order for chain\n// multiplying matrices.\n// Matrix A[i] has dimensions dims[i-1]×dims[i].\nfunc PrintMatrixChainOrder(dims []int) {\n\tn := len(dims) - 1\n\tm, s := newSquareMatrices(n)\n\n\t// m[i,j] will be minimum number of scalar multiplactions\n\t// needed to compute the matrix A[i]A[i+1]…A[j] = A[i…j].\n\t// Note, m[i,i] = zero (no cost).\n\t// s[i,j] will be the index of the subsequence split that\n\t// achieved minimal cost.\n\tfor lenMinusOne := 1; lenMinusOne < n; lenMinusOne++ {\n\t\tfor i := 0; i < n-lenMinusOne; i++ {\n\t\t\tj := i + lenMinusOne\n\t\t\tm[i][j] = -1\n\t\t\tfor k := i; k < j; k++ {\n\t\t\t\tcost := m[i][k] + m[k+1][j] + dims[i]*dims[k+1]*dims[j+1]\n\t\t\t\tif m[i][j] < 0 || cost < m[i][j] {\n\t\t\t\t\tm[i][j] = cost\n\t\t\t\t\ts[i][j] = k\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Format and print result.\n\tconst MatrixNames = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n\tvar subprint func(int, int)\n\tsubprint = func(i, j int) {\n\t\tif i == j {\n\t\t\treturn\n\t\t}\n\t\tk := s[i][j]\n\t\tsubprint(i, k)\n\t\tsubprint(k+1, j)\n\t\tfmt.Printf(\"%*s -> %s × %s%*scost=%d\\n\",\n\t\t\tn, MatrixNames[i:j+1],\n\t\t\tMatrixNames[i:k+1],\n\t\t\tMatrixNames[k+1:j+1],\n\t\t\tn+i-j, \"\", m[i][j],\n\t\t)\n\t}\n\tsubprint(0, n-1)\n}\n\nfunc newSquareMatrices(n int) (m, s [][]int) {\n\t// Allocates two n×n matrices as slices of slices but\n\t// using only one [2n][]int and one [2n²]int backing array.\n\tm = make([][]int, 2*n)\n\tm, s = m[:n:n], m[n:]\n\ttmp := make([]int, 2*n*n)\n\tfor i := range m {\n\t\tm[i], tmp = tmp[:n:n], tmp[n:]\n\t}\n\tfor i := range s {\n\t\ts[i], tmp = tmp[:n:n], tmp[n:]\n\t}\n\treturn m, s\n}\n\nfunc main() {\n\tcases := [...][]int{\n\t\t{1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2},\n\t\t{1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10},\n\t}\n\tfor _, tc := range cases {\n\t\tfmt.Println(\"Dimensions:\", tc)\n\t\tPrintMatrixChainOrder(tc)\n\t\tfmt.Println()\n\t}\n}\n","language":"Go"},{"code":"import Data.List (elemIndex)\nimport Data.Char (chr, ord)\nimport Data.Maybe (fromJust)\n\nmats :: [[Int]]\nmats =\n [ [5, 6, 3, 1]\n , [1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2]\n , [1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]\n ]\n\ncost :: [Int] -> Int -> Int -> (Int, Int)\ncost a i j\n | i < j =\n let m =\n [ fst (cost a i k) + fst (cost a (k + 1) j) +\n (a !! i) * (a !! (j + 1)) * (a !! (k + 1))\n | k <- [i .. j - 1] ]\n mm = minimum m\n in (mm, fromJust (elemIndex mm m) + i)\n | otherwise = (0, -1)\n\noptimalOrder :: [Int] -> Int -> Int -> String\noptimalOrder a i j\n | i < j =\n let c = cost a i j\n in \"(\" ++ optimalOrder a i (snd c) ++ optimalOrder a (snd c + 1) j ++ \")\"\n | otherwise = [chr ((+ i) $ ord 'a')]\n\nprintBlock :: [Int] -> IO ()\nprintBlock v =\n let c = cost v 0 (length v - 2)\n in putStrLn\n (\"for \" ++\n show v ++\n \" we have \" ++\n show (fst c) ++\n \" possibilities, z.B \" ++ optimalOrder v 0 (length v - 2))\n\nmain :: IO ()\nmain = mapM_ printBlock mats\n","language":"Haskell"},{"code":"moo =: verb define\n s =. m =. 0 $~ ,~ n=._1+#y\n for_lmo. 1+i.<:n do.\n for_i. i. n-lmo do.\n j =. i + lmo\n m =. _ (<i;j)} m\n for_k. i+i.j-i do.\n cost =. ((<i;k){m) + ((<(k+1);j){m) + */ y {~ i,(k+1),(j+1)\n if. cost < ((<i;j){m) do.\n m =. cost (<i;j)} m\n s =. k (<i;j)} s\n end.\n end.\n end.\n end.\n\n m;s\n)\n\npoco =: dyad define\n 'i j' =. y\n if. i=j do.\n a. {~ 65 + i NB. 65 = a.i.'A'\n else.\n k =. x {~ <y NB. y = i,j\n '(' , (x poco i,k) , (x poco j ,~ 1+k) , ')'\n end.\n)\n\noptMM =: verb define\n 'M S' =. moo y\n smoutput 'Cost: ' , \": x: M {~ <0;_1\n smoutput 'Order: ', S poco 0 , <:#M\n)\n","language":"J"},{"code":" optMM 5 6 3 1\nCost: 48\nOrder: (A(BC))\n\n optMM 1 5 25 30 100 70 2 1 100 250 1 1000 2\nCost: 38120\nOrder: ((((((((AB)C)D)E)F)G)(H(IJ)))(KL))\n\n optMM 1000 1 500 12 1 700 2500 3 2 5 14 10\nCost: 1773740\nOrder: (A((((((BC)D)(((EF)G)H))I)J)K))\n","language":"J"},{"code":"import java.util.Arrays;\n\npublic class MatrixChainMultiplication {\n\n public static void main(String[] args) {\n runMatrixChainMultiplication(new int[] {5, 6, 3, 1});\n runMatrixChainMultiplication(new int[] {1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2});\n runMatrixChainMultiplication(new int[] {1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10});\n }\n\n private static void runMatrixChainMultiplication(int[] dims) {\n System.out.printf(\"Array Dimension = %s%n\", Arrays.toString(dims));\n System.out.printf(\"Cost = %d%n\", matrixChainOrder(dims));\n System.out.printf(\"Optimal Multiply = %s%n%n\", getOptimalParenthesizations());\n }\n\n private static int[][]cost;\n private static int[][]order;\n\n public static int matrixChainOrder(int[] dims) {\n int n = dims.length - 1;\n cost = new int[n][n];\n order = new int[n][n];\n\n for (int lenMinusOne = 1 ; lenMinusOne < n ; lenMinusOne++) {\n for (int i = 0; i < n - lenMinusOne; i++) {\n int j = i + lenMinusOne;\n cost[i][j] = Integer.MAX_VALUE;\n for (int k = i; k < j; k++) {\n int currentCost = cost[i][k] + cost[k+1][j] + dims[i]*dims[k+1]*dims[j+1];\n if (currentCost < cost[i][j]) {\n cost[i][j] = currentCost;\n order[i][j] = k;\n }\n }\n }\n }\n return cost[0][n-1];\n }\n\n private static String getOptimalParenthesizations() {\n return getOptimalParenthesizations(order, 0, order.length - 1);\n }\n\n private static String getOptimalParenthesizations(int[][]s, int i, int j) {\n if (i == j) {\n return String.format(\"%c\", i+65);\n }\n else {\n StringBuilder sb = new StringBuilder();\n sb.append(\"(\");\n sb.append(getOptimalParenthesizations(s, i, s[i][j]));\n sb.append(\" * \");\n sb.append(getOptimalParenthesizations(s, s[i][j] + 1, j));\n sb.append(\")\");\n return sb.toString();\n }\n }\n\n}\n","language":"Java"},{"code":"# Input: array of dimensions\n# output: {m, s}\ndef optimalMatrixChainOrder:\n . as $dims\n | (($dims|length) - 1) as $n\n | reduce range(1; $n) as $len ({m: [], s: []};\n reduce range(0; $n-$len) as $i (.;\n ($i + $len) as $j\n | .m[$i][$j] = infinite\n | reduce range($i; $j) as $k (.;\n ($dims[$i] * $dims [$k + 1] * $dims[$j + 1]) as $temp\n | (.m[$i][$k] + .m[$k + 1][$j] + $temp) as $cost\n | if $cost < .m[$i][$j]\n then .m[$i][$j] = $cost\n | .s[$i][$j] = $k\n else .\n\t end ) )) ;\n\n# input: {s}\ndef printOptimalChainOrder($i; $j):\n if $i == $j\n then [$i + 65] | implode #=> \"A\", \"B\", ...\n else \"(\" +\n printOptimalChainOrder($i; .s[$i][$j]) +\n printOptimalChainOrder(.s[$i][$j] + 1; $j) + \")\"\n end;\n\ndef dimsList: [\n [5, 6, 3, 1],\n [1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2],\n [1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]\n];\n\ndimsList[]\n| \"Dims : \\(.)\",\n (optimalMatrixChainOrder\n | \"Order : \\(printOptimalChainOrder(0; .s|length - 1))\",\n \"Cost : \\(.m[0][.s|length - 1])\\n\" )\n","language":"Jq"},{"code":"module MatrixChainMultiplications\n\nusing OffsetArrays\n\nfunction optim(a)\n n = length(a) - 1\n u = fill!(OffsetArray{Int}(0:n, 0:n), 0)\n v = fill!(OffsetArray{Int}(0:n, 0:n), typemax(Int))\n u[:, 1] .= -1\n v[:, 1] .= 0\n for j in 2:n, i in 1:n-j+1, k in 1:j-1\n c = v[i, k] + v[i+k, j-k] + a[i] * a[i+k] * a[i+j]\n if c < v[i, j]\n u[i, j] = k\n v[i, j] = c\n end\n end\n return v[1, n], aux(u, 1, n)\nend\n\nfunction aux(u, i, j)\n k = u[i, j]\n if k < 0\n return sprint(print, i)\n else\n return sprint(print, '(', aux(u, i, k), '×', aux(u, i + k, j - k), \")\")\n end\nend\n\nend # module MatrixChainMultiplications\n","language":"Julia"},{"code":"println(MatrixChainMultiplications.optim([1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2]))\nprintln(MatrixChainMultiplications.optim([1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]))\n","language":"Julia"},{"code":"// Version 1.2.31\n\nlateinit var m: List<IntArray>\nlateinit var s: List<IntArray>\n\nfun optimalMatrixChainOrder(dims: IntArray) {\n val n = dims.size - 1\n m = List(n) { IntArray(n) }\n s = List(n) { IntArray(n) }\n for (len in 1 until n) {\n for (i in 0 until n - len) {\n val j = i + len\n m[i][j] = Int.MAX_VALUE\n for (k in i until j) {\n val temp = dims[i] * dims [k + 1] * dims[j + 1]\n val cost = m[i][k] + m[k + 1][j] + temp\n if (cost < m[i][j]) {\n m[i][j] = cost\n s[i][j] = k\n }\n }\n }\n }\n}\n\nfun printOptimalChainOrder(i: Int, j: Int) {\n if (i == j)\n print(\"${(i + 65).toChar()}\")\n else {\n print(\"(\")\n printOptimalChainOrder(i, s[i][j])\n printOptimalChainOrder(s[i][j] + 1, j)\n print(\")\")\n }\n}\n\nfun main(args: Array<String>) {\n val dimsList = listOf(\n intArrayOf(5, 6, 3, 1),\n intArrayOf(1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2),\n intArrayOf(1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10)\n )\n for (dims in dimsList) {\n println(\"Dims : ${dims.asList()}\")\n optimalMatrixChainOrder(dims)\n print(\"Order : \")\n printOptimalChainOrder(0, s.size - 1)\n println(\"\\nCost : ${m[0][s.size - 1]}\\n\")\n }\n}\n","language":"Kotlin"},{"code":"-- Matrix A[i] has dimension dims[i-1] x dims[i] for i = 1..n\nlocal function MatrixChainOrder(dims)\n local m = {}\n local s = {}\n local n = #dims - 1;\n -- m[i,j] = Minimum number of scalar multiplications (i.e., cost)\n -- needed to compute the matrix A[i]A[i+1]...A[j] = A[i..j]\n -- The cost is zero when multiplying one matrix\n for i = 1,n do\n m[i] = {}\n m[i][i] = 0\n s[i] = {}\n end\n\n for len = 2,n do -- Subsequence lengths\n for i = 1,(n - len + 1) do\n local j = i + len - 1\n m[i][j] = math.maxinteger\n for k = i,(j - 1) do\n local cost = m[i][k] + m[k+1][j] + dims[i]*dims[k+1]*dims[j+1];\n if (cost < m[i][j]) then\n m[i][j] = cost;\n s[i][j] = k; --Index of the subsequence split that achieved minimal cost\n end\n end\n end\n end\n return m,s\nend\n\nlocal function printOptimalChainOrder(s)\n local function find_path(start,finish)\n local chainOrder = \"\"\n if (start == finish) then\n chainOrder = chainOrder ..\"A\"..start\n else\n chainOrder = chainOrder ..\"(\" ..\n find_path(start,s[start][finish]) ..\n find_path(s[start][finish]+1,finish) .. \")\"\n end\n return chainOrder\n end\n print(\"Order : \"..find_path(1,#s))\nend\n\nlocal dimsList = {{5, 6, 3, 1},{1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2},{1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10}}\n\nfor k,dim in ipairs(dimsList) do\n io.write(\"Dims : [\")\n for v=1,(#dim-1) do\n io.write(dim[v]..\", \")\n end\n print(dim[#dim]..\"]\")\n local m,s = MatrixChainOrder(dim)\n printOptimalChainOrder(s)\n print(\"Cost : \"..tostring(m[1][#s])..\"\\n\")\nend\n","language":"Lua"},{"code":"ClearAll[optim, aux]\noptim[a_List] := Module[{u, v, n, c, r, s},\n n = Length[a] - 1;\n u = ConstantArray[0, {n, n}];\n v = ConstantArray[\\[Infinity], {n, n}];\n u[[All, 1]] = -1;\n v[[All, 1]] = 0;\n Do[\n Do[\n Do[\n c =\n v[[i, k]] + v[[i + k, j - k]] + a[[i]] a[[i + k]] a[[i + j]];\n If[c < v[[i, j]],\n u[[i, j]] = k;\n v[[i, j]] = c;\n ]\n ,\n {k, 1, j - 1}\n ]\n ,\n {i, 1, n - j + 1}\n ]\n ,\n {j, 2, n}\n ];\n r = v[[1, n]];\n s = aux[u, 1, n];\n {r, s}\n ]\naux[u_, i_, j_] := Module[{k},\n k = u[[i, j]];\n If[k < 0,\n i\n ,\n Inactive[Times][aux[u, i, k], aux[u, i + k, j - k]]\n ]\n ]\n{r, s} = optim[{1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2}];\nr\ns\n{r, s} = optim[{1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10}];\nr\ns\n","language":"Mathematica"},{"code":"function [r,s] = optim(a)\n n = length(a)-1;\n u = zeros(n,n);\n v = ones(n,n)*inf;\n u(:,1) = -1;\n v(:,1) = 0;\n for j = 2:n\n for i = 1:n-j+1\n for k = 1:j-1\n c = v(i,k)+v(i+k,j-k)+a(i)*a(i+k)*a(i+j);\n if c<v(i,j)\n u(i,j) = k;\n v(i,j) = c;\n end\n end\n end\n end\n r = v(1,n);\n s = aux(u,1,n);\nend\n\nfunction s = aux(u,i,j)\n k = u(i,j);\n if k<0\n s = sprintf(\"%d\",i);\n else\n s = sprintf(\"(%s*%s)\",aux(u,i,k),aux(u,i+k,j-k));\n end\nend\n","language":"MATLAB"},{"code":"[r,s] = optim([1,5,25,30,100,70,2,1,100,250,1,1000,2])\n\nr =\n\n 38120\n\n\ns =\n\n \"((((((((1*2)*3)*4)*5)*6)*7)*(8*(9*10)))*(11*12))\"\n\n\n[r,s] = optim([1000,1,500,12,1,700,2500,3,2,5,14,10])\n\nr =\n\n 1773740\n\n\ns =\n\n \"(1*((((((2*3)*4)*(((5*6)*7)*8))*9)*10)*11))\"\n","language":"MATLAB"},{"code":"import sequtils\n\ntype Optimizer = object\n dims: seq[int]\n m: seq[seq[Natural]]\n s: seq[seq[Natural]]\n\n\nproc initOptimizer(dims: openArray[int]): Optimizer =\n ## Create an optimizer for the given dimensions.\n Optimizer(dims: @dims)\n\nproc findMatrixChainOrder(opt: var Optimizer) =\n ## Find the best order for matrix chain multiplication.\n\n let n = opt.dims.high\n opt.m = newSeqWith(n, newSeq[Natural](n))\n opt.s = newSeqWith(n, newSeq[Natural](n))\n\n for lg in 1..<n:\n for i in 0..<(n - lg):\n let j = i + lg\n opt.m[i][j] = Natural.high\n for k in i..<j:\n let cost = opt.m[i][k] + opt.m[k+1][j] + opt.dims[i] * opt.dims[k+1] * opt.dims[j+1]\n if cost < opt.m[i][j]:\n opt.m[i][j] = cost\n opt.s[i][j] = k\n\n\nproc optimalChainOrder(opt: Optimizer; i, j: Natural): string =\n ## Return the optimal chain order as a string.\n if i == j:\n result.add chr(i + ord('A'))\n else:\n result.add '('\n result.add opt.optimalChainOrder(i, opt.s[i][j])\n result.add opt.optimalChainOrder(opt.s[i][j] + 1, j)\n result.add ')'\n\n\nwhen isMainModule:\n\n const\n Dims1 = @[5, 6, 3, 1]\n Dims2 = @[1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2]\n Dims3 = @[1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]\n\n for dims in [Dims1, Dims2, Dims3]:\n var opt = initOptimizer(dims)\n opt.findMatrixChainOrder()\n echo \"Dims: \", dims\n echo \"Order: \", opt.optimalChainOrder(0, dims.len - 2)\n echo \"Cost: \", opt.m[0][dims.len - 2]\n echo \"\"\n","language":"Nim"},{"code":"use strict;\nuse feature 'say';\n\nsub matrix_mult_chaining {\n my(@dimensions) = @_;\n my(@cp,@path);\n\n # a matrix never needs to be multiplied with itself, so it has cost 0\n $cp[$_][$_] = 0 for keys @dimensions;\n\n my $n = $#dimensions;\n for my $chain_length (1..$n) {\n for my $start (0 .. $n - $chain_length - 1) {\n my $end = $start + $chain_length;\n $cp[$end][$start] = 10e10;\n for my $step ($start .. $end - 1) {\n my $new_cost = $cp[$step][$start]\n + $cp[$end][$step + 1]\n + $dimensions[$start] * $dimensions[$step+1] * $dimensions[$end+1];\n if ($new_cost < $cp[$end][$start]) {\n $cp[$end][$start] = $new_cost; # cost\n $cp[$start][$end] = $step; # path\n }\n }\n }\n }\n\n $cp[$n-1][0] . ' ' . find_path(0, $n-1, @cp);\n}\n\nsub find_path {\n my($start,$end,@cp) = @_;\n my $result;\n\n if ($start == $end) {\n $result .= 'A' . ($start + 1);\n } else {\n $result .= '(' .\n find_path($start, $cp[$start][$end], @cp) .\n find_path($cp[$start][$end] + 1, $end, @cp) .\n ')';\n }\n return $result;\n}\n\nsay matrix_mult_chaining(<1 5 25 30 100 70 2 1 100 250 1 1000 2>);\nsay matrix_mult_chaining(<1000 1 500 12 1 700 2500 3 2 5 14 10>);\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;\">optimal_chain_order</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">int</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">int</span> <span style=\"color: #000000;\">j</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;\">if</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">==</span><span style=\"color: #000000;\">j</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #008000;\">'A'</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;\">return</span> <span style=\"color: #008000;\">\"(\"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">optimal_chain_order</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><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">optimal_chain_order</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;\">j</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: #000000;\">s</span><span style=\"color: #0000FF;\">)&</span><span style=\"color: #008000;\">\")\"</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;\">optimal_matrix_chain_order</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">dims</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: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dims</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">m</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: #000000;\">0</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;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">deep_copy</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">len</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</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;\">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: #0000FF;\">-</span><span style=\"color: #000000;\">len</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;\">j</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">len</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">m</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: #0000FF;\">=</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">i</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">cost</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">m</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;\">j</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">dims</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]*</span><span style=\"color: #000000;\">dims</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;\">dims</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;\">if</span> <span style=\"color: #000000;\">m</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;\">0</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">cost</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">m</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: #008080;\">then</span>\n <span style=\"color: #000000;\">m</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: #0000FF;\">=</span> <span style=\"color: #000000;\">cost</span><span style=\"color: #0000FF;\">;</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: #000000;\">j</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">k</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;\">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: #0000FF;\">{</span><span style=\"color: #000000;\">optimal_chain_order</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;\">s</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>\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;\">5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6</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>\n <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> <span style=\"color: #000000;\">25</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">30</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">100</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">70</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;\">100</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">250</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1000</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;\">1000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">500</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">700</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2500</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;\">5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">14</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">10</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;\">tests</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">ti</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;\">\"Dims : %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ti</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;\">\"Order : %s\\nCost : %d\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">optimal_matrix_chain_order</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ti</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"def parens(n):\n def aux(n, k):\n if n == 1:\n yield k\n elif n == 2:\n yield [k, k + 1]\n else:\n a = []\n for i in range(1, n):\n for u in aux(i, k):\n for v in aux(n - i, k + i):\n yield [u, v]\n yield from aux(n, 0)\n","language":"Python"},{"code":"for u in parens(4):\n print(u)\n\n[0, [1, [2, 3]]]\n[0, [[1, 2], 3]]\n[[0, 1], [2, 3]]\n[[0, [1, 2]], 3]\n[[[0, 1], 2], 3]\n","language":"Python"},{"code":"def optim1(a):\n def cost(k):\n if type(k) is int:\n return 0, a[k], a[k + 1]\n else:\n s1, p1, q1 = cost(k[0])\n s2, p2, q2 = cost(k[1])\n assert q1 == p2\n return s1 + s2 + p1 * q1 * q2, p1, q2\n cmin = None\n n = len(a) - 1\n for u in parens(n):\n c, p, q = cost(u)\n if cmin is None or c < cmin:\n cmin = c\n umin = u\n return cmin, umin\n","language":"Python"},{"code":"def optim2(a):\n def aux(n, k):\n if n == 1:\n p, q = a[k:k + 2]\n return 0, p, q, k\n elif n == 2:\n p, q, r = a[k:k + 3]\n return p * q * r, p, r, [k, k + 1]\n else:\n m = None\n p = a[k]\n q = a[k + n]\n for i in range(1, n):\n s1, p1, q1, u1 = aux(i, k)\n s2, p2, q2, u2 = aux(n - i, k + i)\n assert q1 == p2\n s = s1 + s2 + p1 * q1 * q2\n if m is None or s < m:\n m = s\n u = [u1, u2]\n return m, p, q, u\n s, p, q, u = aux(len(a) - 1, 0)\n return s, u\n","language":"Python"},{"code":"def memoize(f):\n h = {}\n def g(*u):\n if u in h:\n return h[u]\n else:\n r = f(*u)\n h[u] = r\n return r\n return g\n\ndef optim3(a):\n @memoize\n def aux(n, k):\n if n == 1:\n p, q = a[k:k + 2]\n return 0, p, q, k\n elif n == 2:\n p, q, r = a[k:k + 3]\n return p * q * r, p, r, [k, k + 1]\n else:\n m = None\n p = a[k]\n q = a[k + n]\n for i in range(1, n):\n s1, p1, q1, u1 = aux(i, k)\n s2, p2, q2, u2 = aux(n - i, k + i)\n assert q1 == p2\n s = s1 + s2 + p1 * q1 * q2\n if m is None or s < m:\n m = s\n u = [u1, u2]\n return m, p, q, u\n s, p, q, u = aux(len(a) - 1, 0)\n return s, u\n","language":"Python"},{"code":"import time\n\nu = [[1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2],\n [1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]]\n\nfor a in u:\n print(a)\n print()\n print(\"function time cost parens \")\n print(\"-\" * 90)\n for f in [optim1, optim2, optim3]:\n t1 = time.clock()\n s, u = f(a)\n t2 = time.clock()\n print(\"%s %10.3f %10d %s\" % (f.__name__, 1000 * (t2 - t1), s, u))\n print()\n","language":"Python"},{"code":"def optim4(a):\n global u\n n = len(a) - 1\n u = [None] * n\n u[0] = [[None, 0]] * n\n for j in range(1, n):\n v = [None] * (n - j)\n for i in range(n - j):\n m = None\n for k in range(j):\n s1, c1 = u[k][i]\n s2, c2 = u[j - k - 1][i + k + 1]\n c = c1 + c2 + a[i] * a[i + k + 1] * a[i + j + 1]\n if m is None or c < m:\n s = k\n m = c\n v[i] = [s, m]\n u[j] = v\n def aux(i, j):\n s, c = u[j][i]\n if s is None:\n return i\n else:\n return [aux(i, s), aux(i + s + 1, j - s - 1)]\n return u[n - 1][0][1], aux(0, n - 1)\n\n\nprint(optim4([1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2]))\nprint(optim4([1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]))\n","language":"Python"},{"code":"aux <- function(i, j, u) {\n k <- u[[i, j]]\n if (k < 0) {\n i\n } else {\n paste0(\"(\", Recall(i, k, u), \"*\", Recall(i + k, j - k, u), \")\")\n }\n}\n\nchain.mul <- function(a) {\n n <- length(a) - 1\n u <- matrix(0, n, n)\n v <- matrix(0, n, n)\n u[, 1] <- -1\n\n for (j in seq(2, n)) {\n for (i in seq(n - j + 1)) {\n v[[i, j]] <- Inf\n for (k in seq(j - 1)) {\n s <- v[[i, k]] + v[[i + k, j - k]] + a[[i]] * a[[i + k]] * a[[i + j]]\n if (s < v[[i, j]]) {\n u[[i, j]] <- k\n v[[i, j]] <- s\n }\n }\n }\n }\n\n list(cost = v[[1, n]], solution = aux(1, n, u))\n}\n\nchain.mul(c(5, 6, 3, 1))\n# $cost\n# [1] 48\n\n# $solution\n# [1] \"(1*(2*3))\"\n\nchain.mul(c(1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2))\n# $cost\n# [1] 38120\n\n# $solution\n# [1] \"((((((((1*2)*3)*4)*5)*6)*7)*(8*(9*10)))*(11*12))\"\n\nchain.mul(c(1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10))\n# $cost\n# [1] 1773740\n\n# $solution\n# [1] \"(1*((((((2*3)*4)*(((5*6)*7)*8))*9)*10)*11))\"\n","language":"R"},{"code":"#lang racket\n\n(define (memoize f)\n (define table (make-hash))\n (λ args (hash-ref! table args (thunk (apply f args)))))\n\n(struct $ (cost expl))\n(define @ vector-ref)\n\n(define (+: #:combine [combine (thunk* #f)] . xs)\n ($ (apply + (map $-cost xs)) (apply combine (map $-expl xs))))\n\n(define (min: . xs) (argmin $-cost xs))\n\n(define (compute dims)\n (define loop\n (memoize\n (λ (left right)\n (cond\n [(= 1 (- right left)) ($ 0 left)]\n [else (for/fold ([ans ($ +inf.0 #f)]) ([mid (in-range (add1 left) right)])\n (min: ans (+: (loop left mid) (loop mid right)\n ($ (* (@ dims left) (@ dims mid) (@ dims right)) #f)\n #:combine (λ (left-answer right-answer _)\n (list left-answer '× right-answer)))))]))))\n (loop 0 (sub1 (vector-length dims))))\n","language":"Racket"},{"code":"(define-syntax-rule (echo <x> ...)\n (begin (printf \"~a: ~a\\n\" (~a (quote <x>) #:min-width 12) <x>) ...))\n\n(define (solve input)\n (match-define-values ((list ($ cost explanation)) _ time _) (time-apply compute (list input)))\n (echo input time cost explanation)\n (newline))\n\n(solve #(1 5 25 30 100 70 2 1 100 250 1 1000 2))\n(solve #(1000 1 500 12 1 700 2500 3 2 5 14 10))\n","language":"Racket"},{"code":"sub matrix-mult-chaining(@dimensions) {\n my @cp;\n # @cp has a dual function:\n # * the upper triangle of the diagonal matrix stores the cost (c) for\n # multiplying matrices $i and $j in @cp[$j][$i], where $j > $i\n # * the lower triangle stores the path (p) that was used for the lowest cost\n # multiplication to get from $i to $j.\n\n # a matrix never needs to be multiplied with itself, so it has cost 0\n @cp[$_][$_] = 0 for @dimensions.keys;\n my @path;\n\n my $n = @dimensions.end;\n for 1 .. $n -> $chain-length {\n for 0 .. $n - $chain-length - 1 -> $start {\n my $end = $start + $chain-length;\n @cp[$end][$start] = Inf; # until we find a better connection\n for $start .. $end - 1 -> $step {\n my $new-cost = @cp[$step][$start]\n + @cp[$end][$step + 1]\n + [*] @dimensions[$start, $step+1, $end+1];\n if $new-cost < @cp[$end][$start] {\n @cp[$end][$start] = $new-cost; # cost\n @cp[$start][$end] = $step; # path\n }\n }\n }\n }\n\n sub find-path(Int $start, Int $end) {\n if $start == $end {\n take 'A' ~ ($start + 1);\n } else {\n take '(';\n find-path($start, @cp[$start][$end]);\n find-path(@cp[$start][$end] + 1, $end);\n take ')';\n }\n }\n\n return @cp[$n-1][0], gather { find-path(0, $n - 1) }.join;\n}\n\nsay matrix-mult-chaining(<1 5 25 30 100 70 2 1 100 250 1 1000 2>);\nsay matrix-mult-chaining(<1000 1 500 12 1 700 2500 3 2 5 14 10>);\n","language":"Raku"},{"code":"use std::collections::HashMap;\n\nfn main() {\n println!(\"{}\\n\", mcm_display(vec![5, 6, 3, 1]));\n println!(\n \"{}\\n\",\n mcm_display(vec![1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2])\n );\n println!(\n \"{}\\n\",\n mcm_display(vec![1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10])\n );\n}\n\nfn mcm_display(dims: Vec<i32>) -> String {\n let mut costs: HashMap<Vec<i32>, (i32, Vec<usize>)> = HashMap::new();\n let mut line = format!(\"Dims : {:?}\\n\", dims);\n let ans = mcm(dims, &mut costs);\n let mut mats = (1..=ans.1.len() + 1)\n .map(|x| x.to_string())\n .collect::<Vec<String>>();\n for i in 0..ans.1.len() {\n let mat_taken = mats[ans.1[i]].clone();\n mats.remove(ans.1[i]);\n mats[ans.1[i]] = \"(\".to_string() + &mat_taken + \"*\" + &mats[ans.1[i]] + \")\";\n }\n line += &format!(\"Order: {}\\n\", mats[0]);\n line += &format!(\"Cost : {}\", ans.0);\n line\n}\n\nfn mcm(dims: Vec<i32>, costs: &mut HashMap<Vec<i32>, (i32, Vec<usize>)>) -> (i32, Vec<usize>) {\n match costs.get(&dims) {\n Some(c) => c.clone(),\n None => {\n let ans = if dims.len() == 3 {\n (dims[0] * dims[1] * dims[2], vec![0])\n } else {\n let mut min_cost = std::i32::MAX;\n let mut min_path = Vec::new();\n for i in 1..dims.len() - 1 {\n let taken = dims[(i - 1)..(i + 2)].to_vec();\n let mut rest = dims[..i].to_vec();\n rest.extend_from_slice(&dims[(i + 1)..]);\n let a1 = mcm(taken, costs);\n let a2 = mcm(rest, costs);\n if a1.0 + a2.0 < min_cost {\n min_cost = a1.0 + a2.0;\n min_path = vec![i - 1];\n min_path.extend_from_slice(&a2.1);\n }\n }\n (min_cost, min_path)\n };\n costs.insert(dims, ans.clone());\n ans\n }\n }\n}\n","language":"Rust"},{"code":"mata\nstruct ans {\n\treal scalar p,q,s\n\tstring scalar u\n}\n\nstruct ans scalar function aux(n,k) {\n\texternal dim,opt\n\tstruct ans scalar r,r1,r2\n\treal scalar s,i\n\t\n\tif (n==1) {\n\t\tr.p = dim[k]\n\t\tr.q = dim[k+1]\n\t\tr.s = 0\n\t\tr.u = strofreal(k)\n\t\treturn(r)\n\t} else if (n==2) {\n\t\tr.p = dim[k]\n\t\tr.q = dim[k+2]\n\t\tr.s = r.p*r.q*dim[k+1]\n\t\tr.u = sprintf(\"(%f*%f)\",k,k+1)\n\t\treturn(r)\n\t} else if (asarray_contains(opt,(n,k))) {\n\t\treturn(asarray(opt,(n,k)))\n\t} else {\n\t\tr.p = dim[k]\n\t\tr.q = dim[k+n]\n\t\tr.s = .\n\t\tfor (i=1; i<n; i++) {\n\t\t\tr1 = aux(i,k)\n\t\t\tr2 = aux(n-i,k+i)\n\t\t\ts = r1.s+r2.s+r1.p*r1.q*r2.q\n\t\t\tif (s<r.s) {\n\t\t\t\tr.s = s\n\t\t\t\tr.u = sprintf(\"(%s*%s)\",r1.u,r2.u)\n\t\t\t}\n\t\t}\n\t\tasarray(opt,(n,k),r)\n\t\treturn(r)\n\t}\n}\n\nfunction optim(a) {\n\texternal dim,opt\n\tstruct ans scalar r\n\treal scalar t\n\t\n\ttimer_clear()\n\tdim = a\n\topt = asarray_create(\"real\",2)\n\ttimer_on(1)\n\tr = aux(length(a)-1,1)\n\ttimer_off(1)\n\tt = timer_value(1)[1]\n\tprintf(\"%10.0f %10.0f %s\\n\",t*1000,r.s,r.u)\n}\n\noptim((1,5,25,30,100,70,2,1,100,250,1,1000,2))\noptim((1000,1,500,12,1,700,2500,3,2,5,14,10))\nend\n","language":"Stata"},{"code":"mata\nfunction aux(u,i,j) {\n\tk = u[i,j]\n\tif (k<0) {\n\t\tprintf(\"%f\",i)\n\t} else {\n\t\tprintf(\"(\")\n\t\taux(u,i,k)\n\t\tprintf(\"*\")\n\t\taux(u,i+k,j-k)\n\t\tprintf(\")\")\n\t}\n}\n\nfunction optim(a) {\n\tn = length(a)-1\n\tu = J(n,n,.)\n\tv = J(n,n,.)\n\tu[.,1] = J(n,1,-1)\n\tv[.,1] = J(n,1,0)\n\tfor (j=2; j<=n; j++) {\n\t\tfor (i=1; i<=n-j+1; i++) {\n\t\t\tfor (k=1; k<j; k++) {\n\t\t\t\tc = v[i,k]+v[i+k,j-k]+a[i]*a[i+k]*a[i+j]\n\t\t\t\tif (c<v[i,j]) {\n\t\t\t\t\tu[i,j] = k\n\t\t\t\t\tv[i,j] = c\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%f \",v[1,n])\n\taux(u,1,n)\n\tprintf(\"\\n\")\n}\n\noptim((1,5,25,30,100,70,2,1,100,250,1,1000,2))\noptim((1000,1,500,12,1,700,2500,3,2,5,14,10))\nend\n","language":"Stata"},{"code":"Option Explicit\nOption Base 1\nDim N As Long, U() As Long, V() As Long\nSub Optimize(A As Variant)\n Dim I As Long, J As Long, K As Long, C As Long\n N = UBound(A) - 1\n ReDim U(N, N), V(N, N)\n For I = 1 To N\n U(I, 1) = -1\n V(I, 1) = 0\n Next I\n\n For J = 2 To N\n For I = 1 To N - J + 1\n V(I, J) = &H7FFFFFFF\n For K = 1 To J - 1\n C = V(I, K) + V(I + K, J - K) + A(I) * A(I + K) * A(I + J)\n If C < V(I, J) Then\n U(I, J) = K\n V(I, J) = C\n End If\n Next K\n Next I\n Next J\n\n Debug.Print V(1, N);\n Call Aux(1, N)\n Debug.Print\n Erase U, V\nEnd Sub\nSub Aux(I As Long, J As Long)\n Dim K As Long\n K = U(I, J)\n If K < 0 Then\n Debug.Print CStr(I);\n Else\n Debug.Print \"(\";\n Call Aux(I, K)\n Debug.Print \"*\";\n Call Aux(I + K, J - K)\n Debug.Print \")\";\n End If\nEnd Sub\nSub Test()\n Call Optimize(Array(5, 6, 3, 1))\n Call Optimize(Array(1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2))\n Call Optimize(Array(1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10))\nEnd Sub\n","language":"VBA"},{"code":"var m = []\nvar s = []\n\nvar optimalMatrixChainOrder = Fn.new { |dims|\n var n = dims.count - 1\n m = List.filled(n, null)\n s = List.filled(n, null)\n for (i in 0...n) {\n m[i] = List.filled(n, 0)\n s[i] = List.filled(n, 0)\n }\n for (len in 1...n) {\n for (i in 0...n-len) {\n var j = i + len\n m[i][j] = 1/0\n for (k in i...j) {\n var temp = dims[i] * dims [k + 1] * dims[j + 1]\n var cost = m[i][k] + m[k + 1][j] + temp\n if (cost < m[i][j]) {\n m[i][j] = cost\n s[i][j] = k\n }\n }\n }\n }\n}\n\nvar printOptimalChainOrder\nprintOptimalChainOrder = Fn.new { |i, j|\n if (i == j) {\n System.write(String.fromByte(i + 65))\n } else {\n System.write(\"(\")\n printOptimalChainOrder.call(i, s[i][j])\n printOptimalChainOrder.call(s[i][j] + 1, j)\n System.write(\")\")\n }\n}\n\nvar dimsList = [\n [5, 6, 3, 1],\n [1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2],\n [1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]\n]\nfor (dims in dimsList) {\n System.print(\"Dims : %(dims)\")\n optimalMatrixChainOrder.call(dims)\n System.write(\"Order : \")\n printOptimalChainOrder.call(0, s.count - 1)\n System.print(\"\\nCost : %(m[0][s.count - 1])\\n\")\n}\n","language":"Wren"},{"code":"fcn optim3(a){\t // list --> (int,list)\n aux:=fcn(n,k,a){ // (int,int,list) --> (int,int,int,list)\n if(n==1){\n\t p,q := a[k,2];\n\t return(0,p,q,k);\n }\n if(n==2){\n\t p,q,r := a[k,3];\n\t return(p*q*r, p, r, T(k,k+1));\n }\n m,p,q,u := Void, a[k], a[k + n], Void;\n foreach i in ([1..n-1]){\n #if 0\t// 0.70 sec for both tests\n\t s1,p1,q1,u1 := self.fcn(i,k,a);\n\t s2,p2,q2,u2 := self.fcn(n - i, k + i, a);\n #else\t// 0.33 sec for both tests\n\t s1,p1,q1,u1 := memoize(self.fcn, i,k,a);\n\t s2,p2,q2,u2 := memoize(self.fcn, n - i, k + i, a);\n #endif\n\t _assert_(q1==p2);\n\t s:=s1 + s2 + p1*q1*q2;\n\t if((Void==m) or (s<m)) m,u = s,T(u1,u2);\n }\n return(m,p,q,u);\n };\n\n h=Dictionary();\t\t// reset memoize\n s,_,_,u := aux(a.len() - 1, 0,a);\n return(s,u);\n}\n\nvar h;\t\t// a Dictionary, set/reset in optim3()\nfcn memoize(f,n,k,a){\n key:=\"%d,%d\".fmt(n,k);\t// Lists make crappy keys\n if(r:=h.find(key)) return(r);\n r:=f(n,k,a);\n h[key]=r;\n return(r);\n}\n","language":"Zkl"},{"code":"fcn pp(u){\t// pretty print a list of lists\n var letters=[\"A\"..\"Z\"].pump(String);\n u.pump(String,\n fcn(n){ if(List.isType(n)) String(\"(\",pp(n),\")\") else letters[n] })\n}\nfcn prnt(s,u){ \"%-9,d %s\\n\\t-->%s\\n\".fmt(s,u.toString(*,*),pp(u)).println() }\n","language":"Zkl"},{"code":"s,u := optim3(T(1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2));\nprnt(s,u);\n\ns,u := optim3(T(1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10));\nprnt(s,u);\n\noptim3(T(5,6,3,1)) : prnt(_.xplode());\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Matrices\\nfrom: http://rosettacode.org/wiki/Matrix_chain_multiplication\\nnote: Discrete math\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Problem\\nUsing the most straightforward algorithm (which we assume here), computing the [[Matrix multiplication|product of two matrices]] of dimensions (n1,n2) and (n2,n3) requires n1*n2*n3 [[wp:Multiply–accumulate_operation|FMA]] operations. The number of operations required to compute the product of matrices A1, A2... An depends on the order of matrix multiplications, hence on where parens are put. Remember that the matrix product is associative, but not commutative, hence only the parens can be moved.\\n\\nFor instance, with four matrices, one can compute A(B(CD)), A((BC)D), (AB)(CD), (A(BC))D, (AB)C)D. The number of different ways to put the parens is a [[Catalan numbers|Catalan number]], and grows exponentially with the number of factors.\\n\\nHere is an example of computation of the total cost, for matrices A(5,6), B(6,3), C(3,1):\\n\\n* AB costs 5*6*3=90 and produces a matrix of dimensions (5,3), then (AB)C costs 5*3*1=15. The total cost is 105.\\n* BC costs 6*3*1=18 and produces a matrix of dimensions (6,1), then A(BC) costs 5*6*1=30. The total cost is 48.\\n\\nIn this case, computing (AB)C requires more than twice as many operations as A(BC). The difference can be much more dramatic in real cases.\\n\\n;Task\\n\\nWrite a function which, given a list of the successive dimensions of matrices A1, A2... An, of arbitrary length, returns the optimal way to compute the matrix product, and the total cost. Any sensible way to describe the optimal solution is accepted. The input list does not duplicate shared dimensions: for the previous example of matrices A,B,C, one will only pass the list [5,6,3,1] (and ''not'' [5,6,6,3,3,1]) to mean the matrix dimensions are respectively (5,6), (6,3) and (3,1). Hence, a product of n matrices is represented by a list of n+1 dimensions.\\n\\nTry this function on the following two lists:\\n\\n* [1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2]\\n* [1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]\\n\\nTo solve the task, it's possible, but not required, to write a function that enumerates all possible ways to parenthesize the product. This is not optimal because of the many duplicated computations, and this task is a classic application of [[:wp:Dynamic programming|dynamic programming]].\\n\\nSee also [[:wp:Matrix chain multiplication|Matrix chain multiplication]] on Wikipedia.\\n\\n__TOC__\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"T Optimizer\\n [Int] dims\\n [[Int]] m, s\\n\\n F (dims)\\n .dims = dims\\n\\n F findMatrixChainOrder()\\n V n = .dims.len - 1\\n .m = [[0] * n] * n\\n .s = [[0] * n] * n\\n\\n L(lg) 1 .< n\\n L(i) 0 .< n - lg\\n V j = i + lg\\n .m[i][j] = 7FFF'FFFF\\n L(k) i .< j\\n V cost = .m[i][k] + .m[k + 1][j] + .dims[i] * .dims[k + 1] * .dims[j + 1]\\n I cost < .m[i][j]\\n .m[i][j] = cost\\n .s[i][j] = k\\n\\n F optimalChainOrder(i, j)\\n I i == j\\n R String(Char(code' i + ‘A’.code))\\n E\\n R ‘(’(.optimalChainOrder(i, .s[i][j]))‘’\\n ‘’(.optimalChainOrder(.s[i][j] + 1, j))‘)’\\n\\nV Dims1 = [5, 6, 3, 1]\\nV Dims2 = [1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2]\\nV Dims3 = [1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]\\n\\nL(dims) [Dims1, Dims2, Dims3]\\n V opt = Optimizer(dims)\\n opt.findMatrixChainOrder()\\n print(‘Dims: ’dims)\\n print(‘Order: ’opt.optimalChainOrder(0, dims.len - 2))\\n print(‘Cost: ’opt.m[0][dims.len - 2])\\n print(‘’)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"package mat_chain is\\n type Vector is array (Natural range <>) of Integer;\\n procedure Chain_Multiplication (Dims : Vector);\\nend mat_chain;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\nwith Ada.Strings.Unbounded; use Ada.Strings.Unbounded;\\n\\npackage body mat_chain is\\n type Result_Matrix is\\n array (Positive range <>, Positive range <>) of Integer;\\n\\n --------------------------\\n -- Chain_Multiplication --\\n --------------------------\\n\\n procedure Chain_Multiplication (Dims : Vector) is\\n n : Natural := Dims'Length - 1;\\n S : Result_Matrix (1 .. n, 1 .. n);\\n m : Result_Matrix (1 .. n, 1 .. n);\\n procedure Print (Item : Vector) is\\n begin\\n Put (\\\"Array Dimension = (\\\");\\n for I in Item'Range loop\\n Put (Item (I)'Image);\\n if I < Item'Last then\\n Put (\\\",\\\");\\n else\\n Put (\\\")\\\");\\n end if;\\n end loop;\\n New_Line;\\n end Print;\\n\\n procedure Chain_Order (Item : Vector) is\\n J : Natural;\\n Cost : Natural;\\n Temp : Natural;\\n\\n begin\\n for idx in 1 .. n loop\\n m (idx, idx) := 0;\\n end loop;\\n\\n for Len in 2 .. n loop\\n for I in 1 .. n - Len + 1 loop\\n J := I + Len - 1;\\n m (I, J) := Integer'Last;\\n for K in I .. J - 1 loop\\n Temp := Item (I - 1) * Item (K) * Item (J);\\n Cost := m (I, K) + m (K + 1, J) + Temp;\\n if Cost < m (I, J) then\\n m (I, J) := Cost;\\n S (I, J) := K;\\n end if;\\n end loop;\\n end loop;\\n end loop;\\n end Chain_Order;\\n\\n function Optimal_Parens return String is\\n function Construct\\n (S : Result_Matrix; I : Natural; J : Natural)\\n return Unbounded_String\\n is\\n Us : Unbounded_String := Null_Unbounded_String;\\n Char_Order : Character;\\n begin\\n if I = J then\\n Char_Order := Character'Val (I + 64);\\n Append (Source => Us, New_Item => Char_Order);\\n return Us;\\n else\\n Append (Source => Us, New_Item => '(');\\n Append (Source => Us, New_Item => Construct (S, I, S (I, J)));\\n Append (Source => Us, New_Item => '*');\\n Append\\n (Source => Us, New_Item => Construct (S, S (I, J) + 1, J));\\n Append (Source => Us, New_Item => ')');\\n return Us;\\n end if;\\n end Construct;\\n\\n begin\\n return To_String (Construct (S, 1, n));\\n\\n end Optimal_Parens;\\n\\n begin\\n Chain_Order (Dims);\\n Print (Dims);\\n Put_Line (\\\"Cost = \\\" & Integer'Image (m (1, n)));\\n Put_Line (\\\"Optimal Multiply = \\\" & Optimal_Parens);\\n end Chain_Multiplication;\\n\\nend mat_chain;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Mat_Chain; use Mat_Chain;\\nwith Ada.Text_IO; use Ada.Text_IO;\\n\\nprocedure chain_main is\\n V1 : Vector := (5, 6, 3, 1);\\n V2 : Vector := (1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2);\\n V3 : Vector := (1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10);\\nbegin\\n Chain_Multiplication(V1);\\n New_Line;\\n Chain_Multiplication(V2);\\n New_Line;\\n Chain_Multiplication(V3);\\nend chain_main;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <limits.h>\\n#include <stdlib.h>\\n\\nint **m;\\nint **s;\\n\\nvoid optimal_matrix_chain_order(int *dims, int n) {\\n int len, i, j, k, temp, cost;\\n n--;\\n m = (int **)malloc(n * sizeof(int *));\\n for (i = 0; i < n; ++i) {\\n m[i] = (int *)calloc(n, sizeof(int));\\n }\\n\\n s = (int **)malloc(n * sizeof(int *));\\n for (i = 0; i < n; ++i) {\\n s[i] = (int *)calloc(n, sizeof(int));\\n }\\n\\n for (len = 1; len < n; ++len) {\\n for (i = 0; i < n - len; ++i) {\\n j = i + len;\\n m[i][j] = INT_MAX;\\n for (k = i; k < j; ++k) {\\n temp = dims[i] * dims[k + 1] * dims[j + 1];\\n cost = m[i][k] + m[k + 1][j] + temp;\\n if (cost < m[i][j]) {\\n m[i][j] = cost;\\n s[i][j] = k;\\n }\\n }\\n }\\n }\\n}\\n\\nvoid print_optimal_chain_order(int i, int j) {\\n if (i == j)\\n printf(\\\"%c\\\", i + 65);\\n else {\\n printf(\\\"(\\\");\\n print_optimal_chain_order(i, s[i][j]);\\n print_optimal_chain_order(s[i][j] + 1, j);\\n printf(\\\")\\\");\\n }\\n}\\n\\nint main() {\\n int i, j, n;\\n int a1[4] = {5, 6, 3, 1};\\n int a2[13] = {1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2};\\n int a3[12] = {1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10};\\n int *dims_list[3] = {a1, a2, a3};\\n int sizes[3] = {4, 13, 12};\\n for (i = 0; i < 3; ++i) {\\n printf(\\\"Dims : [\\\");\\n n = sizes[i];\\n for (j = 0; j < n; ++j) {\\n printf(\\\"%d\\\", dims_list[i][j]);\\n if (j < n - 1) printf(\\\", \\\"); else printf(\\\"]\\\\n\\\");\\n }\\n optimal_matrix_chain_order(dims_list[i], n);\\n printf(\\\"Order : \\\");\\n print_optimal_chain_order(0, n - 2);\\n printf(\\\"\\\\nCost : %d\\\\n\\\\n\\\", m[0][n - 2]);\\n for (j = 0; j <= n - 2; ++j) free(m[j]);\\n free(m);\\n for (j = 0; j <= n - 2; ++j) free(s[j]);\\n free(s);\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <cstdint>\\n#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <vector>\\n\\nconstexpr int32_t MAXIMUM_VALUE = 2'147'483'647;\\n\\nstd::vector<std::vector<int32_t>> cost;\\nstd::vector<std::vector<int32_t>> order;\\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\\nint32_t matrix_chain_order(const std::vector<int32_t>& dimensions) {\\n\\tconst uint64_t size = dimensions.size() - 1;\\n\\tcost = { size, std::vector<int32_t>(size, 0) };\\n\\torder = { size, std::vector<int32_t>(size, 0) };\\n\\n\\tfor ( uint64_t m = 1; m < size; ++m ) {\\n\\t\\tfor ( uint64_t i = 0; i < size - m; ++i ) {\\n\\t\\t\\tint32_t j = i + m;\\n\\t\\t\\tcost[i][j] = MAXIMUM_VALUE;\\n\\t\\t\\tfor ( int32_t k = i; k < j; ++k ) {\\n\\t\\t\\t\\tint32_t current_cost = cost[i][k] + cost[k + 1][j]\\n\\t\\t\\t\\t\\t+ dimensions[i] * dimensions[k + 1] * dimensions[j + 1];\\n\\t\\t\\t\\tif ( current_cost < cost[i][j] ) {\\n\\t\\t\\t\\t\\tcost[i][j] = current_cost;\\n\\t\\t\\t\\t\\torder[i][j] = k;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn cost[0][size - 1];\\n}\\n\\nstd::string get_optimal_parenthesizations(const std::vector<std::vector<int32_t>>& order,\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t const uint64_t& i, const uint64_t& j) {\\n\\tif ( i == j ) {\\n\\t\\tstd::string result(1, char(i + 65));\\n\\t\\treturn result;\\n\\t} else {\\n\\t\\tstd::stringstream stream;\\n\\t\\tstream << \\\"(\\\" << get_optimal_parenthesizations(order, i, order[i][j])\\n\\t\\t\\t << \\\" * \\\" << get_optimal_parenthesizations(order, order[i][j] + 1, j) << \\\")\\\";\\n\\t\\treturn stream.str();\\n\\t}\\n}\\n\\nvoid matrix_chain_multiplication(const std::vector<int32_t>& dimensions) {\\n\\tstd::cout << \\\"Array Dimension = \\\"; print_vector(dimensions);\\n\\tstd::cout << \\\"Cost = \\\" << matrix_chain_order(dimensions) << std::endl;\\n\\tstd::cout << \\\"Optimal Multiply = \\\"\\n\\t\\t\\t << get_optimal_parenthesizations(order, 0, order.size() - 1) << std::endl << std::endl;\\n}\\n\\nint main() {\\n\\tmatrix_chain_multiplication({ 5, 6, 3, 1 });\\n\\tmatrix_chain_multiplication({ 1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2 });\\n\\tmatrix_chain_multiplication({ 1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10 });\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nclass MatrixChainOrderOptimizer {\\n private int[,] m;\\n private int[,] s;\\n\\n void OptimalMatrixChainOrder(int[] dims) {\\n int n = dims.Length - 1;\\n m = new int[n, n];\\n s = new int[n, n];\\n for (int len = 1; len < n; ++len) {\\n for (int i = 0; i < n - len; ++i) {\\n int j = i + len;\\n m[i, j] = Int32.MaxValue;\\n for (int k = i; k < j; ++k) {\\n int temp = dims[i] * dims[k + 1] * dims[j + 1];\\n int cost = m[i, k] + m[k + 1, j] + temp;\\n if (cost < m[i, j]) {\\n m[i, j] = cost;\\n s[i, j] = k;\\n }\\n }\\n }\\n }\\n }\\n\\n void PrintOptimalChainOrder(int i, int j) {\\n if (i == j)\\n Console.Write((char)(i + 65));\\n else {\\n Console.Write(\\\"(\\\");\\n PrintOptimalChainOrder(i, s[i, j]);\\n PrintOptimalChainOrder(s[i, j] + 1, j);\\n Console.Write(\\\")\\\");\\n }\\n }\\n\\n static void Main() {\\n var mcoo = new MatrixChainOrderOptimizer();\\n var dimsList = new int[3][];\\n dimsList[0] = new int[4] {5, 6, 3, 1};\\n dimsList[1] = new int[13] {1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2};\\n dimsList[2] = new int[12] {1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10};\\n for (int i = 0; i < dimsList.Length; ++i) {\\n Console.Write(\\\"Dims : [\\\");\\n int n = dimsList[i].Length;\\n for (int j = 0; j < n; ++j) {\\n Console.Write(dimsList[i][j]);\\n if (j < n - 1)\\n Console.Write(\\\", \\\");\\n else\\n Console.WriteLine(\\\"]\\\");\\n }\\n mcoo.OptimalMatrixChainOrder(dimsList[i]);\\n Console.Write(\\\"Order : \\\");\\n mcoo.PrintOptimalChainOrder(0, n - 2);\\n Console.WriteLine(\\\"\\\\nCost : {0}\\\\n\\\", mcoo.m[0, n - 2]);\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"module optim_mod\\n implicit none\\ncontains\\n subroutine optim(a)\\n implicit none\\n integer :: a(:), n, i, j, k\\n integer, allocatable :: u(:, :)\\n integer(8) :: c\\n integer(8), allocatable :: v(:, :)\\n\\n n = ubound(a, 1) - 1\\n allocate (u(n, n), v(n, n))\\n v = huge(v)\\n u(:, 1) = -1\\n v(:, 1) = 0\\n do j = 2, n\\n do i = 1, n - j + 1\\n do k = 1, j - 1\\n c = v(i, k) + v(i + k, j - k) + int(a(i), 8) * int(a(i + k), 8) * int(a(i + j), 8)\\n if (c < v(i, j)) then\\n u(i, j) = k\\n v(i, j) = c\\n end if\\n end do\\n end do\\n end do\\n write (*, \\\"(I0,' ')\\\", advance=\\\"no\\\") v(1, n)\\n call aux(1, n)\\n print *\\n deallocate (u, v)\\n contains\\n recursive subroutine aux(i, j)\\n integer :: i, j, k\\n\\n k = u(i, j)\\n if (k < 0) then\\n write (*, \\\"(I0)\\\", advance=\\\"no\\\") i\\n else\\n write (*, \\\"('(')\\\", advance=\\\"no\\\")\\n call aux(i, k)\\n write (*, \\\"('*')\\\", advance=\\\"no\\\")\\n call aux(i + k, j - k)\\n write (*, \\\"(')')\\\", advance=\\\"no\\\")\\n end if\\n end subroutine\\n end subroutine\\nend module\\n\\nprogram matmulchain\\n use optim_mod\\n implicit none\\n\\n call optim([5, 6, 3, 1])\\n call optim([1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2])\\n call optim([1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10])\\nend program\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Dim Shared As Integer U(), V()\\n\\nSub Aux(i As Integer, j As Integer)\\n Dim As Integer k = U(i, j)\\n If k < 0 Then\\n Print Str(i);\\n Else\\n Print \\\"(\\\";\\n Aux(i, k)\\n Print \\\"*\\\";\\n Aux(i + k, j - k)\\n Print \\\")\\\";\\n End If\\nEnd Sub\\n\\nSub Optimize(a() As Integer)\\n Dim As Integer i, j, k, c\\n Dim As Integer n = Ubound(a) - 1\\n Redim U(n, n), V(n, n)\\n For i = 1 To n\\n U(i, 1) = -1\\n V(i, 1) = 0\\n Next i\\n\\n For j = 2 To n\\n For i = 1 To n - j + 1\\n V(i, j) = &H7FFFFFFF\\n For k = 1 To j - 1\\n c = V(i, k) + V(i + k, j - k) + a(i) * a(i + k) * a(i + j)\\n If c < V(i, j) Then\\n U(i, j) = k\\n V(i, j) = c\\n End If\\n Next k\\n Next i\\n Next j\\n\\n Print V(1, n); \\\" \\\";\\n Aux(1, n)\\n Print\\n Erase U, V\\nEnd Sub\\n\\nDim As Integer A1(1 To 4) = {5, 6, 3, 1}\\nOptimize(A1())\\nDim As Integer A2(1 To 13) = {1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2}\\nOptimize(A2())\\nDim As Integer A3(1 To 12) = {1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10}\\nOptimize(A3())\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\n// PrintMatrixChainOrder prints the optimal order for chain\\n// multiplying matrices.\\n// Matrix A[i] has dimensions dims[i-1]×dims[i].\\nfunc PrintMatrixChainOrder(dims []int) {\\n\\tn := len(dims) - 1\\n\\tm, s := newSquareMatrices(n)\\n\\n\\t// m[i,j] will be minimum number of scalar multiplactions\\n\\t// needed to compute the matrix A[i]A[i+1]…A[j] = A[i…j].\\n\\t// Note, m[i,i] = zero (no cost).\\n\\t// s[i,j] will be the index of the subsequence split that\\n\\t// achieved minimal cost.\\n\\tfor lenMinusOne := 1; lenMinusOne < n; lenMinusOne++ {\\n\\t\\tfor i := 0; i < n-lenMinusOne; i++ {\\n\\t\\t\\tj := i + lenMinusOne\\n\\t\\t\\tm[i][j] = -1\\n\\t\\t\\tfor k := i; k < j; k++ {\\n\\t\\t\\t\\tcost := m[i][k] + m[k+1][j] + dims[i]*dims[k+1]*dims[j+1]\\n\\t\\t\\t\\tif m[i][j] < 0 || cost < m[i][j] {\\n\\t\\t\\t\\t\\tm[i][j] = cost\\n\\t\\t\\t\\t\\ts[i][j] = k\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Format and print result.\\n\\tconst MatrixNames = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n\\tvar subprint func(int, int)\\n\\tsubprint = func(i, j int) {\\n\\t\\tif i == j {\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tk := s[i][j]\\n\\t\\tsubprint(i, k)\\n\\t\\tsubprint(k+1, j)\\n\\t\\tfmt.Printf(\\\"%*s -> %s × %s%*scost=%d\\\\n\\\",\\n\\t\\t\\tn, MatrixNames[i:j+1],\\n\\t\\t\\tMatrixNames[i:k+1],\\n\\t\\t\\tMatrixNames[k+1:j+1],\\n\\t\\t\\tn+i-j, \\\"\\\", m[i][j],\\n\\t\\t)\\n\\t}\\n\\tsubprint(0, n-1)\\n}\\n\\nfunc newSquareMatrices(n int) (m, s [][]int) {\\n\\t// Allocates two n×n matrices as slices of slices but\\n\\t// using only one [2n][]int and one [2n²]int backing array.\\n\\tm = make([][]int, 2*n)\\n\\tm, s = m[:n:n], m[n:]\\n\\ttmp := make([]int, 2*n*n)\\n\\tfor i := range m {\\n\\t\\tm[i], tmp = tmp[:n:n], tmp[n:]\\n\\t}\\n\\tfor i := range s {\\n\\t\\ts[i], tmp = tmp[:n:n], tmp[n:]\\n\\t}\\n\\treturn m, s\\n}\\n\\nfunc main() {\\n\\tcases := [...][]int{\\n\\t\\t{1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2},\\n\\t\\t{1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10},\\n\\t}\\n\\tfor _, tc := range cases {\\n\\t\\tfmt.Println(\\\"Dimensions:\\\", tc)\\n\\t\\tPrintMatrixChainOrder(tc)\\n\\t\\tfmt.Println()\\n\\t}\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List (elemIndex)\\nimport Data.Char (chr, ord)\\nimport Data.Maybe (fromJust)\\n\\nmats :: [[Int]]\\nmats =\\n [ [5, 6, 3, 1]\\n , [1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2]\\n , [1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]\\n ]\\n\\ncost :: [Int] -> Int -> Int -> (Int, Int)\\ncost a i j\\n | i < j =\\n let m =\\n [ fst (cost a i k) + fst (cost a (k + 1) j) +\\n (a !! i) * (a !! (j + 1)) * (a !! (k + 1))\\n | k <- [i .. j - 1] ]\\n mm = minimum m\\n in (mm, fromJust (elemIndex mm m) + i)\\n | otherwise = (0, -1)\\n\\noptimalOrder :: [Int] -> Int -> Int -> String\\noptimalOrder a i j\\n | i < j =\\n let c = cost a i j\\n in \\\"(\\\" ++ optimalOrder a i (snd c) ++ optimalOrder a (snd c + 1) j ++ \\\")\\\"\\n | otherwise = [chr ((+ i) $ ord 'a')]\\n\\nprintBlock :: [Int] -> IO ()\\nprintBlock v =\\n let c = cost v 0 (length v - 2)\\n in putStrLn\\n (\\\"for \\\" ++\\n show v ++\\n \\\" we have \\\" ++\\n show (fst c) ++\\n \\\" possibilities, z.B \\\" ++ optimalOrder v 0 (length v - 2))\\n\\nmain :: IO ()\\nmain = mapM_ printBlock mats\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"moo =: verb define\\n s =. m =. 0 $~ ,~ n=._1+#y\\n for_lmo. 1+i.<:n do.\\n for_i. i. n-lmo do.\\n j =. i + lmo\\n m =. _ (<i;j)} m\\n for_k. i+i.j-i do.\\n cost =. ((<i;k){m) + ((<(k+1);j){m) + */ y {~ i,(k+1),(j+1)\\n if. cost < ((<i;j){m) do.\\n m =. cost (<i;j)} m\\n s =. k (<i;j)} s\\n end.\\n end.\\n end.\\n end.\\n\\n m;s\\n)\\n\\npoco =: dyad define\\n 'i j' =. y\\n if. i=j do.\\n a. {~ 65 + i NB. 65 = a.i.'A'\\n else.\\n k =. x {~ <y NB. y = i,j\\n '(' , (x poco i,k) , (x poco j ,~ 1+k) , ')'\\n end.\\n)\\n\\noptMM =: verb define\\n 'M S' =. moo y\\n smoutput 'Cost: ' , \\\": x: M {~ <0;_1\\n smoutput 'Order: ', S poco 0 , <:#M\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" optMM 5 6 3 1\\nCost: 48\\nOrder: (A(BC))\\n\\n optMM 1 5 25 30 100 70 2 1 100 250 1 1000 2\\nCost: 38120\\nOrder: ((((((((AB)C)D)E)F)G)(H(IJ)))(KL))\\n\\n optMM 1000 1 500 12 1 700 2500 3 2 5 14 10\\nCost: 1773740\\nOrder: (A((((((BC)D)(((EF)G)H))I)J)K))\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.Arrays;\\n\\npublic class MatrixChainMultiplication {\\n\\n public static void main(String[] args) {\\n runMatrixChainMultiplication(new int[] {5, 6, 3, 1});\\n runMatrixChainMultiplication(new int[] {1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2});\\n runMatrixChainMultiplication(new int[] {1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10});\\n }\\n\\n private static void runMatrixChainMultiplication(int[] dims) {\\n System.out.printf(\\\"Array Dimension = %s%n\\\", Arrays.toString(dims));\\n System.out.printf(\\\"Cost = %d%n\\\", matrixChainOrder(dims));\\n System.out.printf(\\\"Optimal Multiply = %s%n%n\\\", getOptimalParenthesizations());\\n }\\n\\n private static int[][]cost;\\n private static int[][]order;\\n\\n public static int matrixChainOrder(int[] dims) {\\n int n = dims.length - 1;\\n cost = new int[n][n];\\n order = new int[n][n];\\n\\n for (int lenMinusOne = 1 ; lenMinusOne < n ; lenMinusOne++) {\\n for (int i = 0; i < n - lenMinusOne; i++) {\\n int j = i + lenMinusOne;\\n cost[i][j] = Integer.MAX_VALUE;\\n for (int k = i; k < j; k++) {\\n int currentCost = cost[i][k] + cost[k+1][j] + dims[i]*dims[k+1]*dims[j+1];\\n if (currentCost < cost[i][j]) {\\n cost[i][j] = currentCost;\\n order[i][j] = k;\\n }\\n }\\n }\\n }\\n return cost[0][n-1];\\n }\\n\\n private static String getOptimalParenthesizations() {\\n return getOptimalParenthesizations(order, 0, order.length - 1);\\n }\\n\\n private static String getOptimalParenthesizations(int[][]s, int i, int j) {\\n if (i == j) {\\n return String.format(\\\"%c\\\", i+65);\\n }\\n else {\\n StringBuilder sb = new StringBuilder();\\n sb.append(\\\"(\\\");\\n sb.append(getOptimalParenthesizations(s, i, s[i][j]));\\n sb.append(\\\" * \\\");\\n sb.append(getOptimalParenthesizations(s, s[i][j] + 1, j));\\n sb.append(\\\")\\\");\\n return sb.toString();\\n }\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# Input: array of dimensions\\n# output: {m, s}\\ndef optimalMatrixChainOrder:\\n . as $dims\\n | (($dims|length) - 1) as $n\\n | reduce range(1; $n) as $len ({m: [], s: []};\\n reduce range(0; $n-$len) as $i (.;\\n ($i + $len) as $j\\n | .m[$i][$j] = infinite\\n | reduce range($i; $j) as $k (.;\\n ($dims[$i] * $dims [$k + 1] * $dims[$j + 1]) as $temp\\n | (.m[$i][$k] + .m[$k + 1][$j] + $temp) as $cost\\n | if $cost < .m[$i][$j]\\n then .m[$i][$j] = $cost\\n | .s[$i][$j] = $k\\n else .\\n\\t end ) )) ;\\n\\n# input: {s}\\ndef printOptimalChainOrder($i; $j):\\n if $i == $j\\n then [$i + 65] | implode #=> \\\"A\\\", \\\"B\\\", ...\\n else \\\"(\\\" +\\n printOptimalChainOrder($i; .s[$i][$j]) +\\n printOptimalChainOrder(.s[$i][$j] + 1; $j) + \\\")\\\"\\n end;\\n\\ndef dimsList: [\\n [5, 6, 3, 1],\\n [1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2],\\n [1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]\\n];\\n\\ndimsList[]\\n| \\\"Dims : \\\\(.)\\\",\\n (optimalMatrixChainOrder\\n | \\\"Order : \\\\(printOptimalChainOrder(0; .s|length - 1))\\\",\\n \\\"Cost : \\\\(.m[0][.s|length - 1])\\\\n\\\" )\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"module MatrixChainMultiplications\\n\\nusing OffsetArrays\\n\\nfunction optim(a)\\n n = length(a) - 1\\n u = fill!(OffsetArray{Int}(0:n, 0:n), 0)\\n v = fill!(OffsetArray{Int}(0:n, 0:n), typemax(Int))\\n u[:, 1] .= -1\\n v[:, 1] .= 0\\n for j in 2:n, i in 1:n-j+1, k in 1:j-1\\n c = v[i, k] + v[i+k, j-k] + a[i] * a[i+k] * a[i+j]\\n if c < v[i, j]\\n u[i, j] = k\\n v[i, j] = c\\n end\\n end\\n return v[1, n], aux(u, 1, n)\\nend\\n\\nfunction aux(u, i, j)\\n k = u[i, j]\\n if k < 0\\n return sprint(print, i)\\n else\\n return sprint(print, '(', aux(u, i, k), '×', aux(u, i + k, j - k), \\\")\\\")\\n end\\nend\\n\\nend # module MatrixChainMultiplications\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"println(MatrixChainMultiplications.optim([1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2]))\\nprintln(MatrixChainMultiplications.optim([1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// Version 1.2.31\\n\\nlateinit var m: List<IntArray>\\nlateinit var s: List<IntArray>\\n\\nfun optimalMatrixChainOrder(dims: IntArray) {\\n val n = dims.size - 1\\n m = List(n) { IntArray(n) }\\n s = List(n) { IntArray(n) }\\n for (len in 1 until n) {\\n for (i in 0 until n - len) {\\n val j = i + len\\n m[i][j] = Int.MAX_VALUE\\n for (k in i until j) {\\n val temp = dims[i] * dims [k + 1] * dims[j + 1]\\n val cost = m[i][k] + m[k + 1][j] + temp\\n if (cost < m[i][j]) {\\n m[i][j] = cost\\n s[i][j] = k\\n }\\n }\\n }\\n }\\n}\\n\\nfun printOptimalChainOrder(i: Int, j: Int) {\\n if (i == j)\\n print(\\\"${(i + 65).toChar()}\\\")\\n else {\\n print(\\\"(\\\")\\n printOptimalChainOrder(i, s[i][j])\\n printOptimalChainOrder(s[i][j] + 1, j)\\n print(\\\")\\\")\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val dimsList = listOf(\\n intArrayOf(5, 6, 3, 1),\\n intArrayOf(1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2),\\n intArrayOf(1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10)\\n )\\n for (dims in dimsList) {\\n println(\\\"Dims : ${dims.asList()}\\\")\\n optimalMatrixChainOrder(dims)\\n print(\\\"Order : \\\")\\n printOptimalChainOrder(0, s.size - 1)\\n println(\\\"\\\\nCost : ${m[0][s.size - 1]}\\\\n\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"-- Matrix A[i] has dimension dims[i-1] x dims[i] for i = 1..n\\nlocal function MatrixChainOrder(dims)\\n local m = {}\\n local s = {}\\n local n = #dims - 1;\\n -- m[i,j] = Minimum number of scalar multiplications (i.e., cost)\\n -- needed to compute the matrix A[i]A[i+1]...A[j] = A[i..j]\\n -- The cost is zero when multiplying one matrix\\n for i = 1,n do\\n m[i] = {}\\n m[i][i] = 0\\n s[i] = {}\\n end\\n\\n for len = 2,n do -- Subsequence lengths\\n for i = 1,(n - len + 1) do\\n local j = i + len - 1\\n m[i][j] = math.maxinteger\\n for k = i,(j - 1) do\\n local cost = m[i][k] + m[k+1][j] + dims[i]*dims[k+1]*dims[j+1];\\n if (cost < m[i][j]) then\\n m[i][j] = cost;\\n s[i][j] = k; --Index of the subsequence split that achieved minimal cost\\n end\\n end\\n end\\n end\\n return m,s\\nend\\n\\nlocal function printOptimalChainOrder(s)\\n local function find_path(start,finish)\\n local chainOrder = \\\"\\\"\\n if (start == finish) then\\n chainOrder = chainOrder ..\\\"A\\\"..start\\n else\\n chainOrder = chainOrder ..\\\"(\\\" ..\\n find_path(start,s[start][finish]) ..\\n find_path(s[start][finish]+1,finish) .. \\\")\\\"\\n end\\n return chainOrder\\n end\\n print(\\\"Order : \\\"..find_path(1,#s))\\nend\\n\\nlocal dimsList = {{5, 6, 3, 1},{1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2},{1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10}}\\n\\nfor k,dim in ipairs(dimsList) do\\n io.write(\\\"Dims : [\\\")\\n for v=1,(#dim-1) do\\n io.write(dim[v]..\\\", \\\")\\n end\\n print(dim[#dim]..\\\"]\\\")\\n local m,s = MatrixChainOrder(dim)\\n printOptimalChainOrder(s)\\n print(\\\"Cost : \\\"..tostring(m[1][#s])..\\\"\\\\n\\\")\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"ClearAll[optim, aux]\\noptim[a_List] := Module[{u, v, n, c, r, s},\\n n = Length[a] - 1;\\n u = ConstantArray[0, {n, n}];\\n v = ConstantArray[\\\\[Infinity], {n, n}];\\n u[[All, 1]] = -1;\\n v[[All, 1]] = 0;\\n Do[\\n Do[\\n Do[\\n c =\\n v[[i, k]] + v[[i + k, j - k]] + a[[i]] a[[i + k]] a[[i + j]];\\n If[c < v[[i, j]],\\n u[[i, j]] = k;\\n v[[i, j]] = c;\\n ]\\n ,\\n {k, 1, j - 1}\\n ]\\n ,\\n {i, 1, n - j + 1}\\n ]\\n ,\\n {j, 2, n}\\n ];\\n r = v[[1, n]];\\n s = aux[u, 1, n];\\n {r, s}\\n ]\\naux[u_, i_, j_] := Module[{k},\\n k = u[[i, j]];\\n If[k < 0,\\n i\\n ,\\n Inactive[Times][aux[u, i, k], aux[u, i + k, j - k]]\\n ]\\n ]\\n{r, s} = optim[{1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2}];\\nr\\ns\\n{r, s} = optim[{1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10}];\\nr\\ns\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function [r,s] = optim(a)\\n n = length(a)-1;\\n u = zeros(n,n);\\n v = ones(n,n)*inf;\\n u(:,1) = -1;\\n v(:,1) = 0;\\n for j = 2:n\\n for i = 1:n-j+1\\n for k = 1:j-1\\n c = v(i,k)+v(i+k,j-k)+a(i)*a(i+k)*a(i+j);\\n if c<v(i,j)\\n u(i,j) = k;\\n v(i,j) = c;\\n end\\n end\\n end\\n end\\n r = v(1,n);\\n s = aux(u,1,n);\\nend\\n\\nfunction s = aux(u,i,j)\\n k = u(i,j);\\n if k<0\\n s = sprintf(\\\"%d\\\",i);\\n else\\n s = sprintf(\\\"(%s*%s)\\\",aux(u,i,k),aux(u,i+k,j-k));\\n end\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"[r,s] = optim([1,5,25,30,100,70,2,1,100,250,1,1000,2])\\n\\nr =\\n\\n 38120\\n\\n\\ns =\\n\\n \\\"((((((((1*2)*3)*4)*5)*6)*7)*(8*(9*10)))*(11*12))\\\"\\n\\n\\n[r,s] = optim([1000,1,500,12,1,700,2500,3,2,5,14,10])\\n\\nr =\\n\\n 1773740\\n\\n\\ns =\\n\\n \\\"(1*((((((2*3)*4)*(((5*6)*7)*8))*9)*10)*11))\\\"\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"import sequtils\\n\\ntype Optimizer = object\\n dims: seq[int]\\n m: seq[seq[Natural]]\\n s: seq[seq[Natural]]\\n\\n\\nproc initOptimizer(dims: openArray[int]): Optimizer =\\n ## Create an optimizer for the given dimensions.\\n Optimizer(dims: @dims)\\n\\nproc findMatrixChainOrder(opt: var Optimizer) =\\n ## Find the best order for matrix chain multiplication.\\n\\n let n = opt.dims.high\\n opt.m = newSeqWith(n, newSeq[Natural](n))\\n opt.s = newSeqWith(n, newSeq[Natural](n))\\n\\n for lg in 1..<n:\\n for i in 0..<(n - lg):\\n let j = i + lg\\n opt.m[i][j] = Natural.high\\n for k in i..<j:\\n let cost = opt.m[i][k] + opt.m[k+1][j] + opt.dims[i] * opt.dims[k+1] * opt.dims[j+1]\\n if cost < opt.m[i][j]:\\n opt.m[i][j] = cost\\n opt.s[i][j] = k\\n\\n\\nproc optimalChainOrder(opt: Optimizer; i, j: Natural): string =\\n ## Return the optimal chain order as a string.\\n if i == j:\\n result.add chr(i + ord('A'))\\n else:\\n result.add '('\\n result.add opt.optimalChainOrder(i, opt.s[i][j])\\n result.add opt.optimalChainOrder(opt.s[i][j] + 1, j)\\n result.add ')'\\n\\n\\nwhen isMainModule:\\n\\n const\\n Dims1 = @[5, 6, 3, 1]\\n Dims2 = @[1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2]\\n Dims3 = @[1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]\\n\\n for dims in [Dims1, Dims2, Dims3]:\\n var opt = initOptimizer(dims)\\n opt.findMatrixChainOrder()\\n echo \\\"Dims: \\\", dims\\n echo \\\"Order: \\\", opt.optimalChainOrder(0, dims.len - 2)\\n echo \\\"Cost: \\\", opt.m[0][dims.len - 2]\\n echo \\\"\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse feature 'say';\\n\\nsub matrix_mult_chaining {\\n my(@dimensions) = @_;\\n my(@cp,@path);\\n\\n # a matrix never needs to be multiplied with itself, so it has cost 0\\n $cp[$_][$_] = 0 for keys @dimensions;\\n\\n my $n = $#dimensions;\\n for my $chain_length (1..$n) {\\n for my $start (0 .. $n - $chain_length - 1) {\\n my $end = $start + $chain_length;\\n $cp[$end][$start] = 10e10;\\n for my $step ($start .. $end - 1) {\\n my $new_cost = $cp[$step][$start]\\n + $cp[$end][$step + 1]\\n + $dimensions[$start] * $dimensions[$step+1] * $dimensions[$end+1];\\n if ($new_cost < $cp[$end][$start]) {\\n $cp[$end][$start] = $new_cost; # cost\\n $cp[$start][$end] = $step; # path\\n }\\n }\\n }\\n }\\n\\n $cp[$n-1][0] . ' ' . find_path(0, $n-1, @cp);\\n}\\n\\nsub find_path {\\n my($start,$end,@cp) = @_;\\n my $result;\\n\\n if ($start == $end) {\\n $result .= 'A' . ($start + 1);\\n } else {\\n $result .= '(' .\\n find_path($start, $cp[$start][$end], @cp) .\\n find_path($cp[$start][$end] + 1, $end, @cp) .\\n ')';\\n }\\n return $result;\\n}\\n\\nsay matrix_mult_chaining(<1 5 25 30 100 70 2 1 100 250 1 1000 2>);\\nsay matrix_mult_chaining(<1000 1 500 12 1 700 2500 3 2 5 14 10>);\\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;\\\">optimal_chain_order</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">int</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">int</span> <span style=\\\"color: #000000;\\\">j</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;\\\">if</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">==</span><span style=\\\"color: #000000;\\\">j</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #008000;\\\">'A'</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;\\\">return</span> <span style=\\\"color: #008000;\\\">\\\"(\\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">optimal_chain_order</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><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">optimal_chain_order</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;\\\">j</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: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)&</span><span style=\\\"color: #008000;\\\">\\\")\\\"</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;\\\">optimal_matrix_chain_order</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">dims</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: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dims</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">m</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: #000000;\\\">0</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;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">deep_copy</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">len</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</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;\\\">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: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">len</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;\\\">j</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">len</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">m</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: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">cost</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">m</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;\\\">j</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">dims</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]*</span><span style=\\\"color: #000000;\\\">dims</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;\\\">dims</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;\\\">if</span> <span style=\\\"color: #000000;\\\">m</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;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">cost</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">m</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: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">m</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: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">cost</span><span style=\\\"color: #0000FF;\\\">;</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: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">k</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;\\\">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: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">optimal_chain_order</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;\\\">s</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>\\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;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6</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>\\n <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> <span style=\\\"color: #000000;\\\">25</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">30</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">100</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">70</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;\\\">100</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">250</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1000</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;\\\">1000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">500</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">700</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2500</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;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">14</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">10</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;\\\">tests</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">ti</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;\\\">\\\"Dims : %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ti</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;\\\">\\\"Order : %s\\\\nCost : %d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">optimal_matrix_chain_order</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ti</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\": \"def parens(n):\\n def aux(n, k):\\n if n == 1:\\n yield k\\n elif n == 2:\\n yield [k, k + 1]\\n else:\\n a = []\\n for i in range(1, n):\\n for u in aux(i, k):\\n for v in aux(n - i, k + i):\\n yield [u, v]\\n yield from aux(n, 0)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"for u in parens(4):\\n print(u)\\n\\n[0, [1, [2, 3]]]\\n[0, [[1, 2], 3]]\\n[[0, 1], [2, 3]]\\n[[0, [1, 2]], 3]\\n[[[0, 1], 2], 3]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def optim1(a):\\n def cost(k):\\n if type(k) is int:\\n return 0, a[k], a[k + 1]\\n else:\\n s1, p1, q1 = cost(k[0])\\n s2, p2, q2 = cost(k[1])\\n assert q1 == p2\\n return s1 + s2 + p1 * q1 * q2, p1, q2\\n cmin = None\\n n = len(a) - 1\\n for u in parens(n):\\n c, p, q = cost(u)\\n if cmin is None or c < cmin:\\n cmin = c\\n umin = u\\n return cmin, umin\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def optim2(a):\\n def aux(n, k):\\n if n == 1:\\n p, q = a[k:k + 2]\\n return 0, p, q, k\\n elif n == 2:\\n p, q, r = a[k:k + 3]\\n return p * q * r, p, r, [k, k + 1]\\n else:\\n m = None\\n p = a[k]\\n q = a[k + n]\\n for i in range(1, n):\\n s1, p1, q1, u1 = aux(i, k)\\n s2, p2, q2, u2 = aux(n - i, k + i)\\n assert q1 == p2\\n s = s1 + s2 + p1 * q1 * q2\\n if m is None or s < m:\\n m = s\\n u = [u1, u2]\\n return m, p, q, u\\n s, p, q, u = aux(len(a) - 1, 0)\\n return s, u\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def memoize(f):\\n h = {}\\n def g(*u):\\n if u in h:\\n return h[u]\\n else:\\n r = f(*u)\\n h[u] = r\\n return r\\n return g\\n\\ndef optim3(a):\\n @memoize\\n def aux(n, k):\\n if n == 1:\\n p, q = a[k:k + 2]\\n return 0, p, q, k\\n elif n == 2:\\n p, q, r = a[k:k + 3]\\n return p * q * r, p, r, [k, k + 1]\\n else:\\n m = None\\n p = a[k]\\n q = a[k + n]\\n for i in range(1, n):\\n s1, p1, q1, u1 = aux(i, k)\\n s2, p2, q2, u2 = aux(n - i, k + i)\\n assert q1 == p2\\n s = s1 + s2 + p1 * q1 * q2\\n if m is None or s < m:\\n m = s\\n u = [u1, u2]\\n return m, p, q, u\\n s, p, q, u = aux(len(a) - 1, 0)\\n return s, u\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import time\\n\\nu = [[1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2],\\n [1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]]\\n\\nfor a in u:\\n print(a)\\n print()\\n print(\\\"function time cost parens \\\")\\n print(\\\"-\\\" * 90)\\n for f in [optim1, optim2, optim3]:\\n t1 = time.clock()\\n s, u = f(a)\\n t2 = time.clock()\\n print(\\\"%s %10.3f %10d %s\\\" % (f.__name__, 1000 * (t2 - t1), s, u))\\n print()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def optim4(a):\\n global u\\n n = len(a) - 1\\n u = [None] * n\\n u[0] = [[None, 0]] * n\\n for j in range(1, n):\\n v = [None] * (n - j)\\n for i in range(n - j):\\n m = None\\n for k in range(j):\\n s1, c1 = u[k][i]\\n s2, c2 = u[j - k - 1][i + k + 1]\\n c = c1 + c2 + a[i] * a[i + k + 1] * a[i + j + 1]\\n if m is None or c < m:\\n s = k\\n m = c\\n v[i] = [s, m]\\n u[j] = v\\n def aux(i, j):\\n s, c = u[j][i]\\n if s is None:\\n return i\\n else:\\n return [aux(i, s), aux(i + s + 1, j - s - 1)]\\n return u[n - 1][0][1], aux(0, n - 1)\\n\\n\\nprint(optim4([1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2]))\\nprint(optim4([1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"aux <- function(i, j, u) {\\n k <- u[[i, j]]\\n if (k < 0) {\\n i\\n } else {\\n paste0(\\\"(\\\", Recall(i, k, u), \\\"*\\\", Recall(i + k, j - k, u), \\\")\\\")\\n }\\n}\\n\\nchain.mul <- function(a) {\\n n <- length(a) - 1\\n u <- matrix(0, n, n)\\n v <- matrix(0, n, n)\\n u[, 1] <- -1\\n\\n for (j in seq(2, n)) {\\n for (i in seq(n - j + 1)) {\\n v[[i, j]] <- Inf\\n for (k in seq(j - 1)) {\\n s <- v[[i, k]] + v[[i + k, j - k]] + a[[i]] * a[[i + k]] * a[[i + j]]\\n if (s < v[[i, j]]) {\\n u[[i, j]] <- k\\n v[[i, j]] <- s\\n }\\n }\\n }\\n }\\n\\n list(cost = v[[1, n]], solution = aux(1, n, u))\\n}\\n\\nchain.mul(c(5, 6, 3, 1))\\n# $cost\\n# [1] 48\\n\\n# $solution\\n# [1] \\\"(1*(2*3))\\\"\\n\\nchain.mul(c(1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2))\\n# $cost\\n# [1] 38120\\n\\n# $solution\\n# [1] \\\"((((((((1*2)*3)*4)*5)*6)*7)*(8*(9*10)))*(11*12))\\\"\\n\\nchain.mul(c(1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10))\\n# $cost\\n# [1] 1773740\\n\\n# $solution\\n# [1] \\\"(1*((((((2*3)*4)*(((5*6)*7)*8))*9)*10)*11))\\\"\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (memoize f)\\n (define table (make-hash))\\n (λ args (hash-ref! table args (thunk (apply f args)))))\\n\\n(struct $ (cost expl))\\n(define @ vector-ref)\\n\\n(define (+: #:combine [combine (thunk* #f)] . xs)\\n ($ (apply + (map $-cost xs)) (apply combine (map $-expl xs))))\\n\\n(define (min: . xs) (argmin $-cost xs))\\n\\n(define (compute dims)\\n (define loop\\n (memoize\\n (λ (left right)\\n (cond\\n [(= 1 (- right left)) ($ 0 left)]\\n [else (for/fold ([ans ($ +inf.0 #f)]) ([mid (in-range (add1 left) right)])\\n (min: ans (+: (loop left mid) (loop mid right)\\n ($ (* (@ dims left) (@ dims mid) (@ dims right)) #f)\\n #:combine (λ (left-answer right-answer _)\\n (list left-answer '× right-answer)))))]))))\\n (loop 0 (sub1 (vector-length dims))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(define-syntax-rule (echo <x> ...)\\n (begin (printf \\\"~a: ~a\\\\n\\\" (~a (quote <x>) #:min-width 12) <x>) ...))\\n\\n(define (solve input)\\n (match-define-values ((list ($ cost explanation)) _ time _) (time-apply compute (list input)))\\n (echo input time cost explanation)\\n (newline))\\n\\n(solve #(1 5 25 30 100 70 2 1 100 250 1 1000 2))\\n(solve #(1000 1 500 12 1 700 2500 3 2 5 14 10))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub matrix-mult-chaining(@dimensions) {\\n my @cp;\\n # @cp has a dual function:\\n # * the upper triangle of the diagonal matrix stores the cost (c) for\\n # multiplying matrices $i and $j in @cp[$j][$i], where $j > $i\\n # * the lower triangle stores the path (p) that was used for the lowest cost\\n # multiplication to get from $i to $j.\\n\\n # a matrix never needs to be multiplied with itself, so it has cost 0\\n @cp[$_][$_] = 0 for @dimensions.keys;\\n my @path;\\n\\n my $n = @dimensions.end;\\n for 1 .. $n -> $chain-length {\\n for 0 .. $n - $chain-length - 1 -> $start {\\n my $end = $start + $chain-length;\\n @cp[$end][$start] = Inf; # until we find a better connection\\n for $start .. $end - 1 -> $step {\\n my $new-cost = @cp[$step][$start]\\n + @cp[$end][$step + 1]\\n + [*] @dimensions[$start, $step+1, $end+1];\\n if $new-cost < @cp[$end][$start] {\\n @cp[$end][$start] = $new-cost; # cost\\n @cp[$start][$end] = $step; # path\\n }\\n }\\n }\\n }\\n\\n sub find-path(Int $start, Int $end) {\\n if $start == $end {\\n take 'A' ~ ($start + 1);\\n } else {\\n take '(';\\n find-path($start, @cp[$start][$end]);\\n find-path(@cp[$start][$end] + 1, $end);\\n take ')';\\n }\\n }\\n\\n return @cp[$n-1][0], gather { find-path(0, $n - 1) }.join;\\n}\\n\\nsay matrix-mult-chaining(<1 5 25 30 100 70 2 1 100 250 1 1000 2>);\\nsay matrix-mult-chaining(<1000 1 500 12 1 700 2500 3 2 5 14 10>);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"use std::collections::HashMap;\\n\\nfn main() {\\n println!(\\\"{}\\\\n\\\", mcm_display(vec![5, 6, 3, 1]));\\n println!(\\n \\\"{}\\\\n\\\",\\n mcm_display(vec![1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2])\\n );\\n println!(\\n \\\"{}\\\\n\\\",\\n mcm_display(vec![1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10])\\n );\\n}\\n\\nfn mcm_display(dims: Vec<i32>) -> String {\\n let mut costs: HashMap<Vec<i32>, (i32, Vec<usize>)> = HashMap::new();\\n let mut line = format!(\\\"Dims : {:?}\\\\n\\\", dims);\\n let ans = mcm(dims, &mut costs);\\n let mut mats = (1..=ans.1.len() + 1)\\n .map(|x| x.to_string())\\n .collect::<Vec<String>>();\\n for i in 0..ans.1.len() {\\n let mat_taken = mats[ans.1[i]].clone();\\n mats.remove(ans.1[i]);\\n mats[ans.1[i]] = \\\"(\\\".to_string() + &mat_taken + \\\"*\\\" + &mats[ans.1[i]] + \\\")\\\";\\n }\\n line += &format!(\\\"Order: {}\\\\n\\\", mats[0]);\\n line += &format!(\\\"Cost : {}\\\", ans.0);\\n line\\n}\\n\\nfn mcm(dims: Vec<i32>, costs: &mut HashMap<Vec<i32>, (i32, Vec<usize>)>) -> (i32, Vec<usize>) {\\n match costs.get(&dims) {\\n Some(c) => c.clone(),\\n None => {\\n let ans = if dims.len() == 3 {\\n (dims[0] * dims[1] * dims[2], vec![0])\\n } else {\\n let mut min_cost = std::i32::MAX;\\n let mut min_path = Vec::new();\\n for i in 1..dims.len() - 1 {\\n let taken = dims[(i - 1)..(i + 2)].to_vec();\\n let mut rest = dims[..i].to_vec();\\n rest.extend_from_slice(&dims[(i + 1)..]);\\n let a1 = mcm(taken, costs);\\n let a2 = mcm(rest, costs);\\n if a1.0 + a2.0 < min_cost {\\n min_cost = a1.0 + a2.0;\\n min_path = vec![i - 1];\\n min_path.extend_from_slice(&a2.1);\\n }\\n }\\n (min_cost, min_path)\\n };\\n costs.insert(dims, ans.clone());\\n ans\\n }\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"mata\\nstruct ans {\\n\\treal scalar p,q,s\\n\\tstring scalar u\\n}\\n\\nstruct ans scalar function aux(n,k) {\\n\\texternal dim,opt\\n\\tstruct ans scalar r,r1,r2\\n\\treal scalar s,i\\n\\t\\n\\tif (n==1) {\\n\\t\\tr.p = dim[k]\\n\\t\\tr.q = dim[k+1]\\n\\t\\tr.s = 0\\n\\t\\tr.u = strofreal(k)\\n\\t\\treturn(r)\\n\\t} else if (n==2) {\\n\\t\\tr.p = dim[k]\\n\\t\\tr.q = dim[k+2]\\n\\t\\tr.s = r.p*r.q*dim[k+1]\\n\\t\\tr.u = sprintf(\\\"(%f*%f)\\\",k,k+1)\\n\\t\\treturn(r)\\n\\t} else if (asarray_contains(opt,(n,k))) {\\n\\t\\treturn(asarray(opt,(n,k)))\\n\\t} else {\\n\\t\\tr.p = dim[k]\\n\\t\\tr.q = dim[k+n]\\n\\t\\tr.s = .\\n\\t\\tfor (i=1; i<n; i++) {\\n\\t\\t\\tr1 = aux(i,k)\\n\\t\\t\\tr2 = aux(n-i,k+i)\\n\\t\\t\\ts = r1.s+r2.s+r1.p*r1.q*r2.q\\n\\t\\t\\tif (s<r.s) {\\n\\t\\t\\t\\tr.s = s\\n\\t\\t\\t\\tr.u = sprintf(\\\"(%s*%s)\\\",r1.u,r2.u)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tasarray(opt,(n,k),r)\\n\\t\\treturn(r)\\n\\t}\\n}\\n\\nfunction optim(a) {\\n\\texternal dim,opt\\n\\tstruct ans scalar r\\n\\treal scalar t\\n\\t\\n\\ttimer_clear()\\n\\tdim = a\\n\\topt = asarray_create(\\\"real\\\",2)\\n\\ttimer_on(1)\\n\\tr = aux(length(a)-1,1)\\n\\ttimer_off(1)\\n\\tt = timer_value(1)[1]\\n\\tprintf(\\\"%10.0f %10.0f %s\\\\n\\\",t*1000,r.s,r.u)\\n}\\n\\noptim((1,5,25,30,100,70,2,1,100,250,1,1000,2))\\noptim((1000,1,500,12,1,700,2500,3,2,5,14,10))\\nend\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"mata\\nfunction aux(u,i,j) {\\n\\tk = u[i,j]\\n\\tif (k<0) {\\n\\t\\tprintf(\\\"%f\\\",i)\\n\\t} else {\\n\\t\\tprintf(\\\"(\\\")\\n\\t\\taux(u,i,k)\\n\\t\\tprintf(\\\"*\\\")\\n\\t\\taux(u,i+k,j-k)\\n\\t\\tprintf(\\\")\\\")\\n\\t}\\n}\\n\\nfunction optim(a) {\\n\\tn = length(a)-1\\n\\tu = J(n,n,.)\\n\\tv = J(n,n,.)\\n\\tu[.,1] = J(n,1,-1)\\n\\tv[.,1] = J(n,1,0)\\n\\tfor (j=2; j<=n; j++) {\\n\\t\\tfor (i=1; i<=n-j+1; i++) {\\n\\t\\t\\tfor (k=1; k<j; k++) {\\n\\t\\t\\t\\tc = v[i,k]+v[i+k,j-k]+a[i]*a[i+k]*a[i+j]\\n\\t\\t\\t\\tif (c<v[i,j]) {\\n\\t\\t\\t\\t\\tu[i,j] = k\\n\\t\\t\\t\\t\\tv[i,j] = c\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%f \\\",v[1,n])\\n\\taux(u,1,n)\\n\\tprintf(\\\"\\\\n\\\")\\n}\\n\\noptim((1,5,25,30,100,70,2,1,100,250,1,1000,2))\\noptim((1000,1,500,12,1,700,2500,3,2,5,14,10))\\nend\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"Option Explicit\\nOption Base 1\\nDim N As Long, U() As Long, V() As Long\\nSub Optimize(A As Variant)\\n Dim I As Long, J As Long, K As Long, C As Long\\n N = UBound(A) - 1\\n ReDim U(N, N), V(N, N)\\n For I = 1 To N\\n U(I, 1) = -1\\n V(I, 1) = 0\\n Next I\\n\\n For J = 2 To N\\n For I = 1 To N - J + 1\\n V(I, J) = &H7FFFFFFF\\n For K = 1 To J - 1\\n C = V(I, K) + V(I + K, J - K) + A(I) * A(I + K) * A(I + J)\\n If C < V(I, J) Then\\n U(I, J) = K\\n V(I, J) = C\\n End If\\n Next K\\n Next I\\n Next J\\n\\n Debug.Print V(1, N);\\n Call Aux(1, N)\\n Debug.Print\\n Erase U, V\\nEnd Sub\\nSub Aux(I As Long, J As Long)\\n Dim K As Long\\n K = U(I, J)\\n If K < 0 Then\\n Debug.Print CStr(I);\\n Else\\n Debug.Print \\\"(\\\";\\n Call Aux(I, K)\\n Debug.Print \\\"*\\\";\\n Call Aux(I + K, J - K)\\n Debug.Print \\\")\\\";\\n End If\\nEnd Sub\\nSub Test()\\n Call Optimize(Array(5, 6, 3, 1))\\n Call Optimize(Array(1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2))\\n Call Optimize(Array(1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10))\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"var m = []\\nvar s = []\\n\\nvar optimalMatrixChainOrder = Fn.new { |dims|\\n var n = dims.count - 1\\n m = List.filled(n, null)\\n s = List.filled(n, null)\\n for (i in 0...n) {\\n m[i] = List.filled(n, 0)\\n s[i] = List.filled(n, 0)\\n }\\n for (len in 1...n) {\\n for (i in 0...n-len) {\\n var j = i + len\\n m[i][j] = 1/0\\n for (k in i...j) {\\n var temp = dims[i] * dims [k + 1] * dims[j + 1]\\n var cost = m[i][k] + m[k + 1][j] + temp\\n if (cost < m[i][j]) {\\n m[i][j] = cost\\n s[i][j] = k\\n }\\n }\\n }\\n }\\n}\\n\\nvar printOptimalChainOrder\\nprintOptimalChainOrder = Fn.new { |i, j|\\n if (i == j) {\\n System.write(String.fromByte(i + 65))\\n } else {\\n System.write(\\\"(\\\")\\n printOptimalChainOrder.call(i, s[i][j])\\n printOptimalChainOrder.call(s[i][j] + 1, j)\\n System.write(\\\")\\\")\\n }\\n}\\n\\nvar dimsList = [\\n [5, 6, 3, 1],\\n [1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2],\\n [1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10]\\n]\\nfor (dims in dimsList) {\\n System.print(\\\"Dims : %(dims)\\\")\\n optimalMatrixChainOrder.call(dims)\\n System.write(\\\"Order : \\\")\\n printOptimalChainOrder.call(0, s.count - 1)\\n System.print(\\\"\\\\nCost : %(m[0][s.count - 1])\\\\n\\\")\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn optim3(a){\\t // list --> (int,list)\\n aux:=fcn(n,k,a){ // (int,int,list) --> (int,int,int,list)\\n if(n==1){\\n\\t p,q := a[k,2];\\n\\t return(0,p,q,k);\\n }\\n if(n==2){\\n\\t p,q,r := a[k,3];\\n\\t return(p*q*r, p, r, T(k,k+1));\\n }\\n m,p,q,u := Void, a[k], a[k + n], Void;\\n foreach i in ([1..n-1]){\\n #if 0\\t// 0.70 sec for both tests\\n\\t s1,p1,q1,u1 := self.fcn(i,k,a);\\n\\t s2,p2,q2,u2 := self.fcn(n - i, k + i, a);\\n #else\\t// 0.33 sec for both tests\\n\\t s1,p1,q1,u1 := memoize(self.fcn, i,k,a);\\n\\t s2,p2,q2,u2 := memoize(self.fcn, n - i, k + i, a);\\n #endif\\n\\t _assert_(q1==p2);\\n\\t s:=s1 + s2 + p1*q1*q2;\\n\\t if((Void==m) or (s<m)) m,u = s,T(u1,u2);\\n }\\n return(m,p,q,u);\\n };\\n\\n h=Dictionary();\\t\\t// reset memoize\\n s,_,_,u := aux(a.len() - 1, 0,a);\\n return(s,u);\\n}\\n\\nvar h;\\t\\t// a Dictionary, set/reset in optim3()\\nfcn memoize(f,n,k,a){\\n key:=\\\"%d,%d\\\".fmt(n,k);\\t// Lists make crappy keys\\n if(r:=h.find(key)) return(r);\\n r:=f(n,k,a);\\n h[key]=r;\\n return(r);\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn pp(u){\\t// pretty print a list of lists\\n var letters=[\\\"A\\\"..\\\"Z\\\"].pump(String);\\n u.pump(String,\\n fcn(n){ if(List.isType(n)) String(\\\"(\\\",pp(n),\\\")\\\") else letters[n] })\\n}\\nfcn prnt(s,u){ \\\"%-9,d %s\\\\n\\\\t-->%s\\\\n\\\".fmt(s,u.toString(*,*),pp(u)).println() }\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"s,u := optim3(T(1, 5, 25, 30, 100, 70, 2, 1, 100, 250, 1, 1000, 2));\\nprnt(s,u);\\n\\ns,u := optim3(T(1000, 1, 500, 12, 1, 700, 2500, 3, 2, 5, 14, 10));\\nprnt(s,u);\\n\\noptim3(T(5,6,3,1)) : prnt(_.xplode());\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Matrix-chain-multiplication"}}},{"rowIdx":470,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Matrix_digital_rain\n","language":"00-META"},{"code":"Implement the Matrix Digital Rain visual effect from the movie \"The Matrix\" as described in [[wp:Matrix_digital_rain|Wikipedia]].\n\nProvided is a reference implementation in Common Lisp to be run in a terminal.\n<br><br>\n\n","language":"00-TASK"},{"code":"with Ada.Text_IO;\nwith Ada.Numerics.Discrete_Random;\nwith Ada.Strings.Fixed;\n\nprocedure Digital_Rain is\n type Column_Type is range 0 .. 150;\n type Row_Type is range 0 .. 25;\n type Character_Range is new Character range 'A' .. 'Z';\n subtype Delay_Range is Integer range 2 .. 6;\n\n package Column_Random is new Ada.Numerics.Discrete_Random (Column_Type);\n package Row_Random is new Ada.Numerics.Discrete_Random (Row_Type);\n package Character_Random is new Ada.Numerics.Discrete_Random (Character_Range);\n package Delay_Random is new Ada.Numerics.Discrete_Random (Delay_Range);\n\n Column_Generator : Column_Random.Generator;\n Row_Generator : Row_Random.Generator;\n Character_Generator : Character_Random.Generator;\n Delay_Generator : Delay_Random.Generator;\n\n Esc : constant Character := Character'Val (8#33#);\n Running : Boolean := True;\n Char : Character;\n use Ada.Text_IO;\n\n protected Text_Out is\n procedure Put_At (Row : Row_Type; Col : Column_Type;\n Color : Integer; Item : Character);\n end Text_Out;\n\n protected body Text_Out is\n procedure Put_At (Row : Row_Type; Col : Column_Type;\n Color : Integer; Item : Character)\n is\n use Ada.Strings;\n begin\n Put (Esc & \"[\" &\n Fixed.Trim (Row'Image, Left) & \";\" &\n Fixed.Trim (Col'Image, Left) & \"H\"); -- Place Cursor\n Put (Esc & \"[\" & Fixed.Trim (Color'Image, Left) & \"m\"); -- Foreground color\n Put (Item);\n end Put_At;\n end Text_Out;\n\n task type Rainer;\n\n task body Rainer is\n Row : Row_Type;\n Col : Column_Type;\n Del : Delay_Range;\n begin\n Outer_Loop:\n loop\n Col := Column_Random.Random (Column_Generator);\n Row := Row_Random.Random (Row_Generator);\n for Rain in reverse Boolean loop\n Del := Delay_Random.Random (Delay_Generator);\n for R in 0 .. Row loop\n if Rain then\n if R in 1 .. Row then\n Text_Out.Put_At (R - 1, Col, Color => 32, Item => Char);\n end if;\n Char := Character (Character_Random.Random (Character_Generator));\n if R in 0 .. Row - 1 then\n Text_Out.Put_At (R, Col, Color => 97, Item => Char);\n end if;\n else\n Text_Out.Put_At (R, Col, Color => 30, Item => ' ');\n end if;\n delay 0.020 * Del;\n exit Outer_Loop when not Running;\n end loop;\n end loop;\n end loop Outer_Loop;\n end Rainer;\n\n Dummy : Character;\n Rainers : array (1 .. 50) of Rainer;\nbegin\n Put (ESC & \"[?25l\"); -- Hide the cursor\n Put (ESC & \"[40m\"); -- Black background\n Put (ESC & \"[2J\"); -- Clear Terminal\n\n Get_Immediate (Dummy);\n Running := False;\n delay 0.200;\n\n Put (ESC & \"[?25h\"); -- Restore the cursor\n Put (ESC & \"[0;0H\"); -- Place cursor\n Put (ESC & \"[39m\"); -- Default foreground\n Put (ESC & \"[49m\"); -- Default backgound\n Put (ESC & \"[2J\"); -- Clear Terminal\nend Digital_Rain;\n","language":"Ada"},{"code":"#include <basico.h>\n\n#proto desplegarmatrixrain(_X_,_Y_,_Z_,_W_)\n\nalgoritmo\n\n permitir interrupción\n\n dimensionar (80) matriz aleatoria entera ( -50, t )\n\n y=0\n\n color(232,232)\n borrar pantalla\n\n enfatizado\n\n iterar\n\n iterar para(i=1, #(i<=80), ++i )\n cuando ( #(t[i]>50) ){ #(t[i]=0) }\n #basic{\n t[i] += 1\n y = t[i]\n desplegar matrix rain(232,232,i,(y-10))\n desplegar matrix rain(22,232,i,(y-9))\n desplegar matrix rain(22,232,i,(y-8))\n desplegar matrix rain(22,232,i,(y-7))\n desplegar matrix rain(28,232,i,(y-6))\n desplegar matrix rain(28,232,i,(y-5))\n desplegar matrix rain(34,232,i,(y-4))\n desplegar matrix rain(34,232,i,(y-3))\n desplegar matrix rain(40,232,i,(y-2))\n desplegar matrix rain(46,232,i,(y-1))\n desplegar matrix rain(232,40,i,y)\n }\n siguiente\n\n microsegundos(5000)\n hasta que una tecla sea presionada\n\n color(7,0)\n borrar pantalla\nterminar\n\nsubrutinas\n\ndesplegar matrix rain(p,s,x,y)\n\n si ( y, está entre-excluyendo-(0,41) )\n color (p,s)\n imprimir en ( y,x, #(utf8(chr(33+((x*y) % 200)) )) )\n fin si\n\nretornar\n","language":"Amazing-Hopper"},{"code":"#include <basico.h>\n\n#proto desplegarmatrixrain(_X_,_Y_)\n\nalgoritmo\n\n dimensionar con (80) matriz aleatoria entera ( -50, t )\n matrices (ctexto, cfondo)\n '232,22,22,22,22,28,28,28,34,34,40,40,46,232' enlistar en 'ctexto'\n '232,232,232,232,232,232,232,232,232,232,232,232,232,40' enlistar en 'cfondo'\n\n color(232,232)\n borrar pantalla\n\n enfatizado\n\n iterar\n\n iterar para(i=1, #(i<=80), ++i )\n cuando ( #(t[i]>53) ){ #(t[i]=rand(-50)) }\n #basic{\n t[i] += 1\n desplegar matrix rain(i,t[i])\n }\n siguiente\n\n microsegundos(50000)\n\n hasta que una tecla sea presionada\n\n color(7,0)\n borrar pantalla\nterminar\n\nsubrutinas\n\ndesplegar matrix rain(x,y)\n i=13, j=1\n iterar\n si ( #(y-i), está entre-excluyendo-(0,41) )\n color ( #(ctexto[j]), #(cfondo[j]) )\n imprimir en ( #(y-i),x, #(utf8(chr(33+((x*(y-i)) % 200)) )) )\n fin si\n --i, ++j\n mientras ' no es negativo(i)'\nretornar\n","language":"Amazing-Hopper"},{"code":":: Matrix Digital Rain Task from RosettaCode\n:: Batch File Implementation\n\n@echo off\nsetlocal enabledelayedexpansion\n\nrem escape character (for Windows 10 VT100 escape sequences)\nrem info: https://docs.microsoft.com/en-us/windows/console/console-virtual-terminal-sequences\nfor /f %%e in ('echo prompt $e^| cmd') do @set \"esc=%%e\"\n\nrem set window size\nset \"col=120\" %== please don't make this too large ==%\nset \"row=30\" %== please don't make this too large ==%\nmode con cols=%col% lines=%row%\n\nrem set up the variables for display\nset \"rain_length=12\"\nfor /l %%y in (1,1,%col%) do set \"disp_col[%%y]= \" %== what to display ==%\nfor /l %%y in (1,1,%col%) do set \"ctr_col[%%y]=0\" %== counter for rain length ==%\n\nrem hide the cursor, and clear the screen\n<nul set /p \"=%esc%[?25l\"\ncls\n\n:matrix_loop\nfor /l %%y in (1,1,%col%) do (\n if !ctr_col[%%y]! equ 0 (\n set \"disp_col[%%y]= \"\n ) else (\n set /a \"rnd_digit=!random! %% 10\"\n if !ctr_col[%%y]! equ 1 (\n set \"disp_col[%%y]=%esc%[97m!rnd_digit!%esc%[32m\"\n ) else if !ctr_col[%%y]! equ 2 (\n set \"disp_col[%%y]=%esc%[92m!rnd_digit!%esc%[32m\"\n ) else (\n set \"disp_col[%%y]=!rnd_digit!\"\n )\n set /a \"ctr_col[%%y]=(!ctr_col[%%y]! + 1) %% (%rain_length% + 1)\"\n )\n rem drop rain randomly\n set /a \"rnd_drop=!random! %% 20\"\n if !rnd_drop! equ 0 set \"ctr_col[%%y]=1\"\n)\nset \"disp_line=%esc%[32m\"\nfor /l %%y in (1,1,%col%) do set \"disp_line=!disp_line!!disp_col[%%y]!\"\n<nul set /p \"=%esc%[1T%esc%[1;1H\" %== scroll down and set cursor position to home ==%\necho(%disp_line%\ngoto matrix_loop\n","language":"Batch-File"},{"code":"/**\n * Loosely emulates the \"digital rain\" effect from The Matrix.\n *\n * @author Dan Ruscoe <dan@ruscoe.org>\n */\n#include <unistd.h>\n#include <time.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <ncurses.h>\n\n/* Time between row updates in microseconds.\n Controls the speed of the digital rain effect.\n*/\n#define ROW_DELAY 40000\n\n/**\n * Gets a random integer within a given range.\n *\n * @param int min The low-end of the range.\n * @param int max The high-end of the range.\n *\n * @return int The random integer.\n */\nint get_rand_in_range(int min, int max)\n{\n return (rand() % ((max + 1) - min) + min);\n}\n\nint main(void)\n{\n /* Basic seed for random numbers. */\n srand(time(NULL));\n\n /* Characters to randomly appear in the rain sequence. */\n char chars[] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};\n\n int total_chars = sizeof(chars);\n\n /* Set up ncurses screen and colors. */\n initscr();\n noecho();\n curs_set(FALSE);\n\n start_color();\n init_pair(1, COLOR_GREEN, COLOR_BLACK);\n attron(COLOR_PAIR(1));\n\n int max_x = 0, max_y = 0;\n\n getmaxyx(stdscr, max_y, max_x);\n\n /* Create arrays of columns based on screen width. */\n\n /* Array containing the current row of each column. */\n int columns_row[max_x];\n\n /* Array containing the active status of each column.\n A column draws characters on a row when active.\n */\n int columns_active[max_x];\n\n int i;\n\n /* Set top row as current row for all columns. */\n for (i = 0; i < max_x; i++)\n {\n columns_row[i] = -1;\n columns_active[i] = 0;\n }\n\n while (1)\n {\n for (i = 0; i < max_x; i++)\n {\n if (columns_row[i] == -1)\n {\n /* If a column is at the top row, pick a\n random starting row and active status.\n */\n columns_row[i] = get_rand_in_range(0, max_y);\n columns_active[i] = get_rand_in_range(0, 1);\n }\n }\n\n /* Loop through columns and draw characters on rows. */\n for (i = 0; i < max_x; i++)\n {\n if (columns_active[i] == 1)\n {\n /* Draw a random character at this column's current row. */\n int char_index = get_rand_in_range(0, total_chars);\n mvprintw(columns_row[i], i, \"%c\", chars[char_index]);\n }\n else\n {\n /* Draw an empty character if the column is inactive. */\n mvprintw(columns_row[i], i, \" \");\n }\n\n columns_row[i]++;\n\n /* When a column reaches the bottom row, reset to top. */\n if (columns_row[i] >= max_y)\n {\n columns_row[i] = -1;\n }\n\n /* Randomly alternate the column's active status. */\n if (get_rand_in_range(0, 1000) == 0)\n {\n columns_active[i] = (columns_active[i] == 0) ? 1 : 0;\n }\n }\n\n usleep(ROW_DELAY);\n refresh();\n }\n\n endwin();\n return 0;\n}\n","language":"C"},{"code":"/*******************************************************************************\n*\n* Digital ASCII rain - the single thread variant.\n* 2012 (C) by Author, 2020 GPL licensed for RossetaCode\n*\n*******************************************************************************/\n\n#include <assert.h> /* assertions */\n#include <conio.h> /* console operations */\n#include <locale.h> /* l10n and i18n */\n#include <string.h> /* operations on strings and memory blocks */\n#include <process.h> /* Microsoft Windows API for threads etc. */\n#include <stdio.h> /* standard i/o library */\n#include <stdlib.h> /* standard library with rand() function */\n#include <time.h> /* time(NULL) used as srand(time(NULL)) */\n#include <windows.h> /* just the Microsoft Windows main header for C */\n\n\n/*\n * Global variables - you could use local variables instead...\n * but then e.g. the memory for the buffer variable would be unnecessarily\n * allocated and released manifold, which would lead to a worse performance.\n */\n\nHANDLE hStdOut; /* the handle to console \"out\" */\nCONSOLE_SCREEN_BUFFER_INFO csbi; /* numbers of rows, columns etc. */\n\nPCHAR_INFO buffer = NULL; /* an enough big buffer */\nCOORD bufferSize, bufferCoord; /* the size of buffer etc. */\n\n\n/*\n * A structure that holds data that is distinct for each column.\n */\nstruct Data\n{\n DWORD armed; /* time in ms to synchronize */\n int delay; /* armed = current_time + delay */\n BOOL show; /* TRUE - draw, FALSE - erase */\n COORD ncp; /* position for drawing new characters */\n SMALL_RECT s, d; /* source/destination regions for copy */\n};\n\n/*\n * A function to generate random numbers from the range (a, b).\n * NOTE: POSIX rand () is not thread safe,\n * but we use secure rand() from MS runtime libraries.\n */\n\nint rnd(int a, int b)\n{\n return a + rand() % (b + 1 - a);\n}\n\nBOOL randomShow(void)\n{\n return rnd(0, 99) < 65;\n}\n\nint randomDelay(void)\n{\n return rnd(0, 150) + rnd(0, 150) + rnd(0, 150);\n}\n\nBOOL randomRegenerate(void)\n{\n return rnd(0, 99) < 2;\n}\n\nvoid column_init(struct Data* data, int k)\n{\n data->armed = 0;\n data->show = randomShow();\n data->delay = randomDelay();\n\n data->s.Left = k;\n data->s.Top = 0;\n data->s.Bottom = bufferSize.Y - 2;\n data->s.Right = k;\n\n data->d.Left = data->s.Left;\n data->d.Top = data->s.Top + 1;\n data->d.Right = data->s.Right;\n data->d.Bottom = data->s.Bottom + 1;\n\n data->ncp.X = k;\n data->ncp.Y = 0;\n}\n\n\nvoid column_run(struct Data* data)\n{\n char c;\n WORD a;\n DWORD result;\n\n /*\n * Shift down a column.\n */\n ReadConsoleOutput (hStdOut, buffer, bufferSize, bufferCoord, &data->s);\n WriteConsoleOutput(hStdOut, buffer, bufferSize, bufferCoord, &data->d);\n\n /*\n * If show == TRUE then generate a new character.\n * If show == FALSE write the space to erase.\n */\n if(data->show)\n {\n c = (rnd(1,100) <= 15) ? ' ' : rnd( 'a', 'z' );\n a = FOREGROUND_GREEN | ((rnd(1,100) > 10) ? 0 : FOREGROUND_INTENSITY);\n }\n else\n {\n c = ' ';\n a = FOREGROUND_GREEN;\n }\n\n WriteConsoleOutputCharacter(hStdOut, &c, 1, data->ncp, &result);\n WriteConsoleOutputAttribute(hStdOut, &a, 1, data->ncp, &result);\n\n /*\n * Randomly regenerate the delay and the visibility state of the column.\n */\n if(randomRegenerate()) data->show = randomShow();\n if(randomRegenerate()) data->delay = randomDelay();\n\n data->armed = GetTickCount() + data->delay;\n}\n\n\nint main(int argc, char* argv[])\n{\n int j;\n struct Data* table;\n\n srand((unsigned int)time(NULL));\n\n hStdOut = GetStdHandle( STD_OUTPUT_HANDLE );\n SetConsoleTitle(\"Digital ASCII rain\");\n\n /*\n * An attempt to run in the full-screen mode.\n */\n if(argc == 1)\n {\n COORD coord;\n CONSOLE_CURSOR_INFO cci;\n cci.bVisible = FALSE;\n cci.dwSize = 0;\n SetConsoleDisplayMode(hStdOut, CONSOLE_FULLSCREEN_MODE, &coord);\n SetConsoleCursorInfo(hStdOut, &cci);\n }\n\n GetConsoleScreenBufferInfo(hStdOut, &csbi );\n //SetConsoleTextAttribute(hStdOut, FOREGROUND_GREEN);\n\n bufferSize.X = 1;\n bufferSize.Y = csbi.dwSize.Y - 1;\n bufferCoord.X = 0;\n bufferCoord.Y = 0;\n buffer = (PCHAR_INFO)calloc(bufferSize.Y, sizeof(CHAR_INFO));\n assert(buffer != NULL);\n\n table = (struct Data*)calloc(csbi.dwSize.X, sizeof(struct Data));\n assert(table != NULL);\n\n for(j = 0; j < csbi.dwSize.X; j++) column_init(&table[j], j);\n\n /*\n * Main loop. Sleep(1) significally decreases the CPU load.\n */\n\n while(!_kbhit())\n {\n DWORD t = GetTickCount();\n for(j = 0; j < csbi.dwSize.X; j++)\n if(table[j].armed < t) column_run(&table[j]);\n Sleep(1);\n }\n\n free(table);\n free(buffer);\n\n return 0;\n}\n","language":"C"},{"code":"/*******************************************************************************\n*\n* Digital ASCII rain - multithreaded.\n* 2012 (C) by Author, 2020 GPL licensed for RossetaCode\n*\n*******************************************************************************/\n\n#include <assert.h> /* assertions */\n#include <conio.h> /* console operations */\n#include <locale.h> /* l10n and i18n */\n#include <string.h> /* operations on strings and memory blocks */\n#include <process.h> /* Microsoft Windows API for threads etc. */\n#include <stdio.h> /* standard i/o library */\n#include <stdlib.h> /* standard library with rand() function */\n#include <time.h> /* time(NULL) used as srand(time(NULL)) */\n#include <windows.h> /* just the Microsoft Windows main header for C */\n\n\n//#define SYNCHRONIZED_INIT\n\n\n/*\n * Global variables, common for all threads.\n * The handle eventThreadInitialized is to synchronize threads initializations.\n */\n#ifdef SYNCHRONIZED_INIT\nHANDLE eventThreadInitialized;\n#endif\n\nBOOL loop = TRUE; /* FALSE - przerwać działanie */\nHANDLE hStdOut; /* uchwyt do konsoli \"out\" */\nCONSOLE_SCREEN_BUFFER_INFO csbi; /* liczby wierszy i kolumn itd.*/\n\n\nstruct InitThreadData\n{\n int column;\n unsigned seed;\n};\n\n\n/*\n * A function to generate random numbers from the range (a, b).\n * NOTE: POSIX rand () is not thread safe,\n * but we use secure rand() from MS runtime libraries.\n */\n\nint rnd(int a, int b)\n{\n return a + rand() % (b + 1 - a);\n}\n\nBOOL randomShow(void)\n{\n return rnd(0, 99) < 65;\n}\n\nint randomDelay(void)\n{\n return rnd(0,150) + rnd(0,150) + rnd(0,150);\n}\n\nBOOL randomRegenerate(void)\n{\n return rnd(0,99) < 2;\n}\n\n\n/*\n * Update a single column.\n */\nvoid one_column(void *arg)\n{\n BOOL show;\n int k;\n char c;\n WORD a;\n int delay;\n PCHAR_INFO buffer;\n COORD bufferSize, bufferCoord, newCharPosition;\n SMALL_RECT s, d;\n DWORD result;\n\n /*\n * Retrieve the column number, initialize the (pseudo)random numbers\n * generator with a \"private\" seed, check assertions.\n */\n k = ((struct InitThreadData*)arg)->column;\n srand(((struct InitThreadData*)arg)->seed);\n assert(csbi.dwSize.X != 0 && csbi.dwSize.Y != 0);\n assert(0 <= k && k <= csbi.dwSize.X);\n\n show = randomShow();\n delay = randomDelay();\n\n bufferSize.X = 1;\n bufferSize.Y = csbi.dwSize.Y - 1;\n bufferCoord.X = 0;\n bufferCoord.Y = 0;\n\n buffer = (PCHAR_INFO)malloc(bufferSize.Y * sizeof(CHAR_INFO));\n assert( buffer != NULL );\n\n s.Left = k;\n s.Top = 0;\n s.Bottom = bufferSize.Y - 2;\n s.Right = k;\n\n d.Left = s.Left;\n d.Top = s.Top + 1;\n d.Right = s.Right;\n d.Bottom = s.Bottom + 1;\n\n newCharPosition.X = k;\n newCharPosition.Y = 0;\n\n#ifdef SYNCHRONIZED_INIT\n SetEvent(eventThreadInitialized);\n#endif\n\n /*\n * Main loop inside this one thread.\n */\n while(loop)\n {\n ReadConsoleOutput ( hStdOut, buffer, bufferSize, bufferCoord, &s);\n WriteConsoleOutput( hStdOut, buffer, bufferSize, bufferCoord, &d);\n\n if(show)\n {\n c = (rnd(1,100) <= 15) ? ' ' : rnd( 'a', 'z' );\n a = FOREGROUND_GREEN | ((rnd(1,100) > 1) ? 0 : FOREGROUND_INTENSITY);\n }\n else\n {\n c = ' ';\n a = FOREGROUND_GREEN;\n }\n\n WriteConsoleOutputCharacter( hStdOut, &c, 1, newCharPosition, &result );\n WriteConsoleOutputAttribute( hStdOut, &a, 1, newCharPosition, &result );\n\n if(randomRegenerate()) show = randomShow();\n if(randomRegenerate()) delay = randomDelay();\n\n Sleep( delay );\n }\n\n free(buffer);\n}\n\n\nint main(int argc, char* argv[])\n{\n int j;\n struct InitThreadData *init = NULL;\n\n srand((time_t)time(NULL));\n\n hStdOut = GetStdHandle( STD_OUTPUT_HANDLE );\n SetConsoleTitle(\"MATRIX\");\n\n if(argc == 1)\n {\n COORD coord;\n CONSOLE_CURSOR_INFO cci;\n\n cci.bVisible = FALSE;\n cci.dwSize = 0;\n SetConsoleDisplayMode(hStdOut,CONSOLE_FULLSCREEN_MODE,&coord);\n SetConsoleCursorInfo(hStdOut,&cci);\n }\n\n GetConsoleScreenBufferInfo( hStdOut, &csbi );\n //SetConsoleTextAttribute(hStdOut,FOREGROUND_GREEN);\n\n#ifdef SYNCHRONIZED_INIT\n eventThreadInitialized = CreateEvent(NULL,FALSE,FALSE,NULL);\n assert( eventThreadInitialized != NULL );\n#endif\n\n init = (struct InitThreadData*)\n malloc(csbi.dwSize.X * sizeof(struct InitThreadData));\n assert( init != NULL );\n\n for(j = 0; j < csbi.dwSize.X; j++)\n {\n init[j].column = j;\n init[j].seed = rand();\n _beginthread(one_column, 0, (void*)&init[j]);\n#ifdef SYNCHRONIZED_INIT\n WaitForSingleObject(eventThreadInitialized,INFINITE);\n#endif\n }\n\n getchar();\n free(init);\n\n#ifdef SYNCHRONIZED_INIT\n CloseHandle(eventThreadInitialized);\n#endif SYNCHRONIZED_INIT\n\n return 0;\n}\n","language":"C"},{"code":"/*******************************************************************************\n*\n* Digital ASCII rain - multithreaded.\n* 2012 (C) by Author, 2020 GPL licensed for RossetaCode\n*\n*******************************************************************************/\n\n#include <assert.h> /* assertions */\n#include <conio.h> /* console operations */\n#include <locale.h> /* l10n and i18n */\n#include <string.h> /* operations on strings and memory blocks */\n#include <process.h> /* Microsoft Windows API for threads etc. */\n#include <stdio.h> /* standard i/o library */\n#include <stdlib.h> /* standard library with rand() function */\n#include <time.h> /* time(NULL) used as srand(time(NULL)) */\n#include <windows.h> /* just the Microsoft Windows main header for C */\n\n\n/*\n * Global variables, shared by fibers.\n */\n\nBOOL loop = TRUE;\nHANDLE hStdOut;\nCONSOLE_SCREEN_BUFFER_INFO csbi;\n\nLPVOID mainFiber = NULL;\n\nstruct WorkingFiber\n{\n int column;\n DWORD callAfter;\n unsigned seed;\n LPVOID fiber;\n} *workingFibersTable = NULL;\n\n/*\n * A function to generate random numbers from the range (a, b).\n * NOTE: POSIX rand () is not thread safe,\n * but we use secure rand() from MS runtime libraries.\n */\n\nint rnd(int a, int b)\n{\n return a + rand() % (b + 1 - a);\n}\n\nBOOL randomShow(void)\n{\n return rnd(0, 99) < 65;\n}\n\nint randomDelay(void)\n{\n return rnd(0,150) + rnd(0,150) + rnd(0,150);\n}\n\nBOOL randomRegenerate(void)\n{\n return rnd(0,99) < 2;\n}\n\n\nVOID CALLBACK one_column(void *arg)\n{\n struct WorkingFiber *ptr;\n BOOL show;\n int k;\n char c;\n WORD a;\n int delay;\n PCHAR_INFO buffer;\n COORD bufferSize, bufferCoord, newCharPosition;\n SMALL_RECT s, d;\n DWORD result;\n\n ptr = (struct WorkingFiber*)arg;\n k = ptr->column;\n ptr->callAfter = 0;\n srand(ptr->seed);\n assert(csbi.dwSize.X != 0 && csbi.dwSize.Y != 0);\n assert(0 <= k && k <= csbi.dwSize.X);\n\n show = randomShow();\n delay = randomDelay();\n\n bufferSize.X = 1;\n bufferSize.Y = csbi.dwSize.Y - 1;\n bufferCoord.X = 0;\n bufferCoord.Y = 0;\n\n buffer = (PCHAR_INFO)malloc(bufferSize.Y * sizeof(CHAR_INFO));\n assert( buffer != NULL );\n\n s.Left = k;\n s.Top = 0;\n s.Bottom = bufferSize.Y - 2;\n s.Right = k;\n\n d.Left = s.Left;\n d.Top = s.Top + 1;\n d.Right = s.Right;\n d.Bottom = s.Bottom + 1;\n\n newCharPosition.X = k;\n newCharPosition.Y = 0;\n\n while(loop)\n {\n ReadConsoleOutput ( hStdOut, buffer, bufferSize, bufferCoord, &s);\n WriteConsoleOutput( hStdOut, buffer, bufferSize, bufferCoord, &d);\n\n if(show)\n {\n c = (rnd(1,100) <= 15) ? ' ' : rnd( 'a', 'z' );\n a = FOREGROUND_GREEN | ((rnd(1,100) > 1) ? 0 : FOREGROUND_INTENSITY);\n }\n else\n {\n c = ' ';\n a = FOREGROUND_GREEN;\n }\n\n WriteConsoleOutputCharacter( hStdOut, &c, 1, newCharPosition, &result );\n WriteConsoleOutputAttribute( hStdOut, &a, 1, newCharPosition, &result );\n\n if(randomRegenerate()) show = randomShow();\n if(randomRegenerate()) delay = randomDelay();\n\n ptr->callAfter = GetTickCount() + delay;\n SwitchToFiber(mainFiber);\n }\n\n free(buffer);\n}\n\n\nint main(int argc, char* argv[])\n{\n int j;\n\n srand((unsigned int)time(NULL));\n\n hStdOut = GetStdHandle( STD_OUTPUT_HANDLE );\n SetConsoleTitle(\"MATRIX - FIBERS\");\n\n if(argc == 1)\n {\n COORD coord;\n CONSOLE_CURSOR_INFO cci;\n\n cci.bVisible = FALSE;\n cci.dwSize = 0;\n SetConsoleDisplayMode(hStdOut,CONSOLE_FULLSCREEN_MODE,&coord);\n SetConsoleCursorInfo(hStdOut,&cci);\n }\n\n GetConsoleScreenBufferInfo( hStdOut, &csbi );\n //SetConsoleTextAttribute(hStdOut,FOREGROUND_GREEN);\n\n mainFiber = ConvertThreadToFiber(NULL);\n assert( mainFiber != NULL );\n\n workingFibersTable = (struct WorkingFiber*)\n calloc(csbi.dwSize.X, sizeof(struct WorkingFiber));\n assert( workingFibersTable != NULL );\n\n for(j = 0; j < csbi.dwSize.X; j++)\n {\n workingFibersTable[j].column = j;\n workingFibersTable[j].callAfter = 0;\n workingFibersTable[j].seed = rand();\n workingFibersTable[j].fiber = CreateFiber( 0, one_column, &workingFibersTable[j] );\n }\n\n loop = TRUE;\n while(!_kbhit())\n {\n DWORD t = GetTickCount();\n for(j = 0; j < csbi.dwSize.X; j++)\n if(workingFibersTable[j].callAfter < t)\n SwitchToFiber( workingFibersTable[j].fiber );\n Sleep(1);\n }\n\n loop = FALSE;\n for(j = 0; j < csbi.dwSize.X; j++)\n {\n SwitchToFiber( workingFibersTable[j].fiber );\n DeleteFiber(workingFibersTable[j].fiber);\n }\n\n free(workingFibersTable);\n\n return 0;\n}\n","language":"C"},{"code":"(defun matrix-digital-rain ()\n (with-screen (scr :input-echoing nil :input-blocking nil :cursor-visible nil)\n (let* ((width (width scr))\n (height (height scr))\n ;; start at a random height in each column.\n (positions (loop repeat width collect (random height)))\n ;; run each column at a random speed.\n (speeds (loop repeat width collect (random 4))))\n ;; generate a random ascii char\n (flet ((randch () (+ 64 (random 58))))\n ;; hit the q key to exit the main loop.\n (bind scr #\\q 'exit-event-loop)\n (bind scr nil\n (lambda (win event)\n (loop for col from 0 to (1- width) do\n (loop repeat (nth col speeds) do\n ;; position of the first point in the current column\n (let ((pos (nth col positions)))\n (setf (attributes win) '(:bold))\n (setf (fgcolor win) :green)\n (add win (randch) :y (mod pos height) :x col :fgcolor :white)\n (add win (randch) :y (mod (- pos 1) height) :x col)\n (add win (randch) :y (mod (- pos 2) height) :x col)\n (setf (attributes win) '())\n (add win (randch) :y (mod (- pos 3) height) :x col)\n ;; overwrite the last char half the height from the first char.\n (add win #\\space :y (mod (- pos (floor height 2)) height) :x col)\n (refresh win)\n ;; advance the current column\n (setf (nth col positions) (mod (+ pos 1) height))))))))\n (setf (frame-rate scr) 20)\n (run-event-loop scr))))\n","language":"Common-Lisp"},{"code":"Sub d(p As Ulong, s As Ulong, x As Long, y As Long)\n Color p, s\n If y > 0 And y < 24 Then Locate y, x: Print Chr(33 + (x * y) Mod 200);\nEnd Sub\n\nDim As Long t(80)\nFor i As Integer = 1 To 80\n t(i) = Int(-50 * Rnd)\nNext\nDim As Double s = Timer\n\nCls\nDo\n For i As Integer = 1 To 80\n If t(i) > 28 Then t(i) = 0\n t(i) += 1\n Dim As Long y = t(i)\n d( 0, 0, i, y - 6)\n d( 2, 0, i, y - 5)\n d( 2, 0, i, y - 4)\n d(10, 0, i, y - 2)\n d(11, 0, i, y - 1)\n d( 0, 2, i, y)\n Next i\n\n Dim As Double l = Timer\n While l = Timer: Wend\nLoop\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n gc \"github.com/rthornton128/goncurses\"\n \"log\"\n \"math/rand\"\n \"time\"\n)\n\n// Time between row updates in microseconds.\n// Controls the speed of the digital rain effect.\nconst rowDelay = 40000\n\nfunc main() {\n start := time.Now()\n rand.Seed(time.Now().UnixNano())\n\n // Characters to randomly appear in the rain sequence.\n chars := []byte(\"0123456789\")\n totalChars := len(chars)\n\n // Set up ncurses screen and colors.\n stdscr, err := gc.Init()\n if err != nil {\n log.Fatal(\"init\", err)\n }\n defer gc.End()\n\n gc.Echo(false)\n gc.Cursor(0)\n\n if !gc.HasColors() {\n log.Fatal(\"Program requires a colour capable terminal\")\n }\n\n if err := gc.StartColor(); err != nil {\n log.Fatal(err)\n }\n\n if err := gc.InitPair(1, gc.C_GREEN, gc.C_BLACK); err != nil {\n log.Fatal(\"InitPair failed: \", err)\n }\n stdscr.ColorOn(1)\n maxY, maxX := stdscr.MaxYX()\n\n /* Create slices of columns based on screen width. */\n\n // Slice containing the current row of each column.\n columnsRow := make([]int, maxX)\n\n // Slice containing the active status of each column.\n // A column draws characters on a row when active.\n columnsActive := make([]int, maxX)\n\n // Set top row as current row for all columns.\n for i := 0; i < maxX; i++ {\n columnsRow[i] = -1\n columnsActive[i] = 0\n }\n\n for {\n for i := 0; i < maxX; i++ {\n if columnsRow[i] == -1 {\n // If a column is at the top row, pick a\n // random starting row and active status.\n columnsRow[i] = rand.Intn(maxY + 1)\n columnsActive[i] = rand.Intn(2)\n }\n }\n\n // Loop through columns and draw characters on rows.\n for i := 0; i < maxX; i++ {\n if columnsActive[i] == 1 {\n // Draw a random character at this column's current row.\n charIndex := rand.Intn(totalChars)\n stdscr.MovePrintf(columnsRow[i], i, \"%c\", chars[charIndex])\n } else {\n // Draw an empty character if the column is inactive.\n stdscr.MovePrintf(columnsRow[i], i, \"%c\", ' ')\n }\n\n columnsRow[i]++\n\n // When a column reaches the bottom row, reset to top.\n if columnsRow[i] >= maxY {\n columnsRow[i] = -1\n }\n\n // Randomly alternate the column's active status.\n if rand.Intn(1001) == 0 {\n if columnsActive[i] == 0 {\n columnsActive[i] = 1\n } else {\n columnsActive[i] = 0\n }\n }\n }\n time.Sleep(rowDelay * time.Microsecond)\n stdscr.Refresh()\n elapsed := time.Since(start)\n // Stop after 1 minute.\n if elapsed.Minutes() >= 1 {\n break\n }\n }\n}\n","language":"Go"},{"code":"require'gl2'\ncoinsert'jgl2'\n\njunk=: 7 u:;48 65 16b30a1(+i.)&.>10 26 90\nsz=:40 25\nlen=: <.1.4*{:sz\nheat=: (224 255 255),~(<.0.5+255*(%>./)(-<./)^>:(% >./)i.len)*/0 1 0\n\ncols=: i.0\nrows=: i.0\nscale=: 24\nlive=: (#heat)#<i.0 3\n\nrain_timer=: {{\n try.\n wd 'psel rain'\n glsel 'green'\n glfill 0 0 0 255\n glfont font=.'courier ',\":0.8*scale\n upd=. 0>._3++/?2 2 2 2 4\n cols=: cols,upd{.(?~{.sz)-.(-<.0.3*{:sz){.cols\n rows=: (#cols){.rows\n live=: }.live,<(scale*cols,.rows),.?(#cols)##junk\n for_p. live do.\n gltextcolor glrgb p_index{heat\n if.p_index=<:#live do.\n glfont font,' bold'\n end.\n for_xyj.;p do.\n gltextxy 2{.xyj\n gltext 8 u:junk{~{:xyj\n end.\n end.\n glpaintx''\n keep=: rows<{:sz-1\n cols=: keep#cols\n rows=: keep#rows+1\n EMPTY\n catch.\n wd'ptimer 0'\n end.\n}}\n\nwd rplc&('DIMS';\":scale*sz) {{)n\n pc rain closeok;\n setp wh DIMS;\n cc green isidraw flush;\n pshow;\n ptimer 100\n}}\n","language":"J"},{"code":"import java.awt.Canvas;\nimport java.awt.Color;\nimport java.awt.Dimension;\nimport java.awt.EventQueue;\nimport java.awt.Font;\nimport java.awt.Graphics2D;\nimport java.awt.Point;\nimport java.awt.image.BufferStrategy;\nimport java.awt.image.BufferedImage;\nimport java.util.List;\nimport java.util.concurrent.ExecutorService;\nimport java.util.concurrent.Executors;\nimport java.util.concurrent.ScheduledExecutorService;\nimport java.util.concurrent.ThreadLocalRandom;\nimport java.util.concurrent.TimeUnit;\nimport java.util.stream.Collectors;\nimport java.util.stream.Stream;\n\nimport javax.swing.JFrame;\n\npublic final class MatrixDigitalRain {\n\n public static void main(String[] args) {\n \tEventQueue.invokeLater( () -> {\n \t\t JFrame.setDefaultLookAndFeelDecorated(true);\n JFrame frame = new JFrame(\"Matrix Digital Rain\");\n frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\n frame.setResizable(false);\n DigitalRain digitalRain = new DigitalRain(800, 600);\n frame.add(digitalRain);\n frame.setLocationByPlatform(true);\n frame.pack();\n frame.setVisible(true);\n\n digitalRain.start();\n \t} );\n }\n\n private static final class DigitalRain extends Canvas {\n\n public DigitalRain(int aWidth, int aHeight) { \t\t \t\t\t\t\n \t\tsetPreferredSize( new Dimension(aWidth, aHeight) );\n \t\tsetBackground(Color.BLACK);\t\n \t\t\n \t\tcolumnCount = aWidth / ( 2 * halfColumnWidth ) - 1;\n \t\trowCount = aHeight / ( 2 * halfFontSize );\n \t\t\n \t\tsetCursor(getToolkit().createCustomCursor(\n new BufferedImage(1, 1, BufferedImage.TYPE_INT_ARGB), new Point(0, 0), \"transparent\")); \t\t\n \t\t\n \t\texecutiveService = Executors.newSingleThreadExecutor();\n \t\trandom = ThreadLocalRandom.current();\n }\n\n public void start() {\n \trequestFocus();\n createBufferStrategy(2);\n executiveService.execute( new DrawingCycle(rowCount) );\n }\n\n private final class DrawingCycle implements Runnable {\n \t\n \tpublic DrawingCycle(int rowCount) {\n \t\tcolumns = Stream.generate( () -> new Column(rowCount) )\n \t\t\t\t .limit(columnCount).collect(Collectors.toList()); \t\t\n \t\tbufferStrategy = getBufferStrategy();\n \t\tscheduler = Executors.newSingleThreadScheduledExecutor();\n \t}\n\n @Override\n public void run() {\n \tscheduler.scheduleAtFixedRate( () -> { draw(); update(); }, 0, 100, TimeUnit.MILLISECONDS);\n }\n\n private void draw() {\n Graphics2D graphics2D = (Graphics2D) bufferStrategy.getDrawGraphics(); \t\n \tgraphics2D.setColor(Color.BLACK);\n \tgraphics2D.fillRect(0, 0, getWidth(), getHeight()); \t\n \t\n \tfor ( int col = 0; col < columnCount; col++ ) {\n \t\tfor ( int row = 0; row < rowCount; row++ ) {\n \t\t\t\tSymbol symbol = columns.get(col).symbols.get(row);\n \t\t\t\tgraphics2D.setFont(symbol.font);\n \t\t\t\t\tgraphics2D.setColor(symbol.color());\n \t\t\t\t\tfinal int size = symbol.font.getSize();\n \t\t\t\t\tgraphics2D.drawString(\n \t\t\t\t\t\t\tsymbol.element,\n \t\t\t\t\t\t\t2 * halfColumnWidth * col + halfColumnWidth + ( 6 * halfFontSize - size ) / 2,\n \t\t\t\t\t\t\trow * 2 * halfFontSize);\n \t}\n \t}\n\n \t\tgraphics2D.dispose();\n bufferStrategy.show();\n }\n\n private void update() {\n \tfor ( Column column : columns ) { \t\t\n \t\tif ( column.index >= 0 ) {\n \t\t\tString element = elements.get(random.nextInt(elements.size()));\n \t\t\tcolumn.symbols.set(column.index, new Symbol(element, column.font, 255) );\n \t\t}\n \t\t\n \t\tcolumn.index = Math.min(column.index + 1, rowCount);\n \tcolumn.darken();\n\n \tif ( column.index == rowCount ) {\n \t\tcolumn.reset();\n \t}\n \t} \t\n }\n\n private final List<Column> columns;\n private final BufferStrategy bufferStrategy;\n private final ScheduledExecutorService scheduler;\n\n } // End DrawingCycle class\n\n private final class Column {\n \t\n \tpublic Column(int aRowCount) {\n \t\trowCount = aRowCount; \t\t\n \t\tindex = random.nextInt(-rowCount, rowCount);\n \t\tsetFont();\n \t\t\tsymbols = Stream.generate( () -> new Symbol(font) ).limit(rowCount).collect(Collectors.toList());\n \t\t\t\n \t\t}\n \t\n \t public void darken() {\n \t \tsymbols.stream().forEach(Symbol::darken);\n \t }\n \t\n \t public void reset() {\n \t\t\tindex = random.nextInt(-rowCount, rowCount / 2);\n \t\t\tsetFont();\n \t }\n \t\n \t private void setFont() {\n \t \tfinal int fontSize = ( random.nextInt(2) == 0 ) ?\n \t \t\t2 * halfFontSize : ( random.nextInt(2) == 0 ) ?\n \t \t\t\t(int) ( 1.5 * halfFontSize ) : 3 * halfFontSize;\n \t\tfinal int fontStyle = ( random.nextInt(3) == 0 ) ? Font.BOLD : Font.PLAIN;\n \t\tfont = new Font(\"Dialog\", fontStyle, fontSize);\n \t }\n \t\n \t private int index;\n \t private Font font;\n \t private List<Symbol> symbols;\n \t\n \t private final int rowCount;\t\n \t\n } // End Column class\n\n private final class Symbol {\n \t\n \tpublic Symbol(String aElement, Font aFont, int aBrightness) {\n \t\telement = aElement;\n \t\tfont = aFont;\n \t\tbrightness = aBrightness;\n \t}\n \t\n \tpublic Symbol(Font font) {\n \t\tthis(\" \", font, 0);\n \t}\n \t\n \tpublic Color color() {\n \t\t\treturn new Color(0, 255, 0, brightness);\n \t\t}\n \t\t\n \t public void darken() {\n \t \tbrightness = Math.max(0, brightness - 5);\n \t }\n \t\n \t public String toString() {\n \t \treturn element;\n \t }\n \t\n \t private int brightness;\n \t\n \t private final Font font;\n \tprivate final String element; \t\n \t\n } // End Symbol class\n\n \tprivate final int columnCount;\n \tprivate final int rowCount; \t\n \tprivate final ExecutorService executiveService; \t\n \tprivate final int halfFontSize = 6;\n \tprivate final int halfColumnWidth = 10;\n \tprivate final ThreadLocalRandom random;\n\t private final List<String> elements = List.of(\n\t\t\t\"M\", \"Ї\", \"Љ\", \"Њ\", \"Ћ\", \"Ќ\", \"Ѝ\", \"Ў\", \"Џ\", \"Б\", \"Г\", \"Д\", \"Ж\", \"И\", \"Й\", \"Л\", \"П\", \"Ф\", \"Ц\", \"Ч\", \"Ш\",\n\t\t\t\"Щ\", \"Ъ\", \"Ы\", \"Э\", \"Ю\", \"Я\", \"в\", \"д\", \"ж\", \"з\", \"и\", \"й\", \"к\", \"л\", \"м\", \"н\", \"п\", \"т\", \"ф\", \"ц\", \"ч\",\n\t\t\t\"ш\", \"щ\", \"ъ\", \"ы\", \"ь\", \"э\", \"ю\", \"я\", \"ѐ\", \"ё\", \"ђ\", \"ѓ\", \"є\", \"ї\", \"љ\", \"њ\", \"ћ\", \"ќ\", \"ѝ\", \"ў\", \"џ\",\n\t \"Ѣ\", \"ѣ\", \"ѧ\", \"Ѯ\", \"ѱ\", \"Ѳ\", \"ѳ\", \"ҋ\", \"Ҍ\", \"ҍ\", \"Ҏ\", \"ҏ\", \"Ґ\", \"ґ\", \"Ғ\", \"ғ\", \"Ҕ\", \"ҕ\", \"Җ\", \"җ\", \"Ҙ\",\n\t \"ҙ\", \"Қ\", \"қ\", \"ҝ\", \"ҟ\", \"ҡ\", \"Ң\", \"ң\", \"Ҥ\", \"ҥ\", \"ҩ\", \"Ҫ\", \"ҫ\", \"Ҭ\", \"ҭ\", \"Ұ\", \"ұ\", \"Ҳ\", \"ҳ\", \"ҵ\", \"ҷ\",\n\t \"ҹ\", \"Һ\", \"ҿ\", \"Ӂ\", \"ӂ\", \"Ӄ\", \"ӄ\", \"ӆ\", \"Ӈ\", \"ӈ\", \"ӊ\", \"Ӌ\", \"ӌ\", \"ӎ\", \"Ӑ\", \"ӑ\", \"Ӓ\", \"ӓ\", \"Ӕ\", \"ӕ\", \"Ӗ\",\n\t \"ӗ\", \"Ә\", \"ә\", \"Ӛ\", \"ӛ\", \"Ӝ\", \"ӝ\", \"Ӟ\", \"ӟ\", \"ӡ\", \"Ӣ\", \"ӣ\", \"Ӥ\", \"ӥ\", \"Ӧ\", \"ӧ\", \"Ө\", \"ө\", \"Ӫ\", \"ӫ\", \"Ӭ\",\n\t \"ӭ\", \"Ӯ\", \"ӯ\", \"Ӱ\", \"ӱ\", \"Ӳ\", \"ӳ\", \"Ӵ\", \"ӵ\", \"Ӷ\", \"ӷ\", \"Ӹ\", \"ӹ\", \"Ӻ\", \"ӽ\", \"ӿ\", \"Ԁ\", \"ԍ\", \"ԏ\", \"Ԑ\", \"ԑ\",\n\t \"ԓ\", \"Ԛ\", \"ԟ\", \"Ԧ\", \"ԧ\", \"Ϥ\", \"ϥ\", \"ϫ\", \"ϭ\", \"ｩ\", \"ｪ\", \"ｫ\", \"ｬ\", \"ｭ\", \"ｮ\", \"ｯ\", \"ｰ\", \"ｱ\", \"ｲ\", \"ｳ\", \"ｴ\",\n\t \"ｵ\", \"ｶ\", \"ｷ\", \"ｸ\", \"ｹ\", \"ｺ\", \"ｻ\", \"ｼ\", \"ｽ\", \"ｾ\", \"ｿ\", \"ﾀ\", \"ﾁ\", \"ﾂ\", \"ﾃ\", \"ﾄ\", \"ﾅ\", \"ﾆ\", \"ﾇ\", \"ﾈ\", \"ﾉ\",\n\t \"ﾊ\", \"ﾋ\", \"ﾌ\", \"ﾍ\", \"ﾎ\", \"ﾏ\", \"ﾐ\", \"ﾑ\", \"ﾒ\", \"ﾓ\", \"ﾔ\", \"ﾕ\", \"ﾖ\", \"ﾗ\", \"ﾘ\", \"ﾙ\", \"ﾚ\", \"ﾛ\", \"ﾜ\", \"ﾝ\", \"ⲁ\",\n\t \"Ⲃ\", \"ⲃ\", \"Ⲅ\", \"Γ\", \"Δ\", \"Θ\", \"Λ\", \"Ξ\", \"Π\", \"Ѐ\", \"Ё\", \"Ђ\", \"Ѓ\", \"Є\", \"ⲉ\", \"Ⲋ\", \"ⲋ\", \"Ⲍ\", \"ⲍ\", \"ⲏ\", \"ⲑ\",\n\t \"ⲓ\", \"ⲕ\", \"ⲗ\", \"ⲙ\", \"ⲛ\", \"Ⲝ\", \"ⲝ\", \"ⲡ\", \"ⲧ\", \"ⲩ\", \"ⲫ\", \"ⲭ\", \"ⲯ\", \"ⳁ\", \"Ⳉ\", \"ⳉ\", \"ⳋ\", \"ⳤ\", \"⳥\", \"⳦\", \"⳨\",\n\t \"⳩\", \"∀\", \"∁\", \"∂\", \"∃\", \"∄\", \"∅\", \"∆\", \"∇\", \"∈\", \"∉\", \"∊\", \"∋\", \"∌\", \"∍\", \"∎\", \"∏\", \"∐\", \"∑\", \"∓\",\n\t \"ℇ\", \"ℏ\", \"℥\", \"Ⅎ\", \"ℷ\", \"⩫\", \"⨀\", \"⨅\", \"⨆\", \"⨉\", \"⨍\", \"⨎\", \"⨏\", \"⨐\", \"⨑\", \"⨒\", \"⨓\", \"⨔\", \"⨕\", \"⨖\",\n\t \"⨗\", \"⨘\", \"⨙\", \"⨚\", \"⨛\", \"⨜\", \"⨝\", \"⨿\", \"⩪\" );\t\n\n } // End DigitalRain class\n\n} // End MatrixDigitalRain class\n","language":"Java"},{"code":"var tileSize = 20;\n// a higher fade factor will make the characters fade quicker\nvar fadeFactor = 0.05;\n\nvar canvas;\nvar ctx;\n\nvar columns = [];\nvar maxStackHeight;\n\nfunction init() {\n\tcanvas = document.getElementById('canvas');\n\tctx = canvas.getContext('2d');\n\n // https://developer.mozilla.org/en-US/docs/Web/API/ResizeObserver\n const resizeObserver = new ResizeObserver(entries =>\n {\n for (let entry of entries)\n {\n if (entry.contentBoxSize)\n {\n // Firefox implements `contentBoxSize` as a single content rect, rather than an array\n const contentBoxSize = Array.isArray(entry.contentBoxSize) ? entry.contentBoxSize[0] : entry.contentBoxSize;\n\n canvas.width = contentBoxSize.inlineSize;\n canvas.height = window.innerHeight;\n\n initMatrix();\n }\n }\n });\n\n // observe the size of the document\n resizeObserver.observe(document.documentElement);\n\n\t// start the main loop\n\ttick();\n}\n\nfunction initMatrix() {\n columns = [];\n\n maxStackHeight = Math.ceil(canvas.height/tileSize);\n\n // divide the canvas into columns\n for (let i = 0 ; i < canvas.width/tileSize ; ++i) {\n var column = {};\n // save the x position of the column\n column.x = i*tileSize;\n // create a random stack height for the column\n column.stackHeight = 10+Math.random()*maxStackHeight;\n // add a counter to count the stack height\n column.stackCounter = 0;\n // add the column to the list\n columns.push(column);\n }\n}\n\nfunction draw() {\n // draw a semi transparent black rectangle on top of the scene to slowly fade older characters\n ctx.fillStyle = \"rgba(0 , 0 , 0 , \"+fadeFactor+\")\";\n ctx.fillRect(0 , 0 , canvas.width , canvas.height);\n\n ctx.font = (tileSize-2)+\"px monospace\";\n ctx.fillStyle = \"rgb(0 , 255 , 0)\";\n for (let i = 0 ; i < columns.length ; ++i) {\n // pick a random ascii character (change the 94 to a higher number to include more characters)\n var randomCharacter = String.fromCharCode(33+Math.floor(Math.random()*94));\n ctx.fillText(randomCharacter , columns[i].x , columns[i].stackCounter*tileSize+tileSize);\n\n // if the stack is at its height limit, pick a new random height and reset the counter\n if (++columns[i].stackCounter >= columns[i].stackHeight)\n {\n columns[i].stackHeight = 10+Math.random()*maxStackHeight;\n columns[i].stackCounter = 0;\n }\n }\n}\n\n// MAIN LOOP\nfunction tick() {\t\n draw();\n setTimeout(tick , 50);\n}\n\nvar b_isFullscreen = false;\n\nfunction fullscreen() {\n var elem = document.documentElement;\n if (elem.requestFullscreen) {\n elem.requestFullscreen();\n }\n else if (elem.webkitRequestFullscreen) {\n elem.webkitRequestFullscreen(); // Safari\n }\n else if (elem.msRequestFullscreen) {\n elem.msRequestFullscreen(); // IE11\n }\n}\n\nfunction exitFullscreen() {\n if (document.exitFullscreen) {\n document.exitFullscreen();\n }\n else if (document.webkitExitFullscreen) {\n document.webkitExitFullscreen(); // Safari\n }\n else if (document.msExitFullscreen) {\n document.msExitFullscreen(); // IE11\n }\n}\n\nfunction toggleFullscreen() {\n if (!b_isFullscreen) {\n fullscreen();\n b_isFullscreen = true;\n }\n else {\n exitFullscreen();\n b_isFullscreen = false;\n }\n}\n\nfunction updateTileSize() {\n tileSize = Math.min(Math.max(document.getElementById(\"tileSize\").value , 10) , 100);\n initMatrix();\n}\n\nfunction updateFadeFactor() {\n fadeFactor = Math.min(Math.max(document.getElementById(\"fadeFactor\").value , 0.0) , 1.0);\n initMatrix();\n}\n","language":"JavaScript"},{"code":"using Gtk, Colors, Cairo\nimport Base.iterate, Base.IteratorSize, Base.IteratorEltype\n\nconst caps = [c for c in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"]\nstartfall() = rand() < 0.2\nendfall() = rand() < 0.2\nstartblank() = rand() < 0.1\nendblank() = rand() < 0.05\nbechangingchar() = rand() < 0.03\n\nstruct RainChars chars::Vector{Char} end\nBase.IteratorSize(s::RainChars) = Base.IsInfinite()\nBase.IteratorEltype(s::RainChars) = Char\nfunction Base.iterate(rain::RainChars, state = (true, false, 0))\n c = '\\0'\n isfalling, isblank, blankcount = state\n if isfalling # falling, so feed the column\n if isblank\n c = ' '\n ((blankcount += 1) > 12) && (isblank = endblank())\n else\n c = bechangingchar() ? '~' : rand(rain.chars)\n isblank, blankcount = startblank(), 0\n end\n endfall() && (isfalling = false)\n else\n isfalling = startfall()\n end\n return c, (isfalling, isblank, blankcount)\nend\n\nfunction digitalrain()\n mapwidth, mapheight, fontpointsize = 800, 450, 14\n windowmaxx = div(mapwidth, Int(round(fontpointsize * 0.9)))\n windowmaxy = div(mapheight, fontpointsize)\n basebuffer = fill(' ', windowmaxy, windowmaxx)\n bkcolor, rcolor, xcolor = colorant\"black\", colorant\"green\", colorant\"limegreen\"\n\n columngenerators = [Iterators.Stateful(RainChars(caps)) for _ in 1:windowmaxx]\n\n win = GtkWindow(\"Digital Rain Effect\", mapwidth, mapheight) |>\n (GtkFrame() |> (can = GtkCanvas()))\n set_gtk_property!(can, :expand, true)\n\n draw(can) do widget\n ctx = Gtk.getgc(can)\n select_font_face(ctx, \"Leonardo\\'s mirrorwriting\", Cairo.FONT_SLANT_NORMAL,\n Cairo.FONT_WEIGHT_BOLD)\n set_font_size(ctx, fontpointsize)\n set_source(ctx, bkcolor)\n rectangle(ctx, 0, 0, mapwidth, mapheight)\n fill(ctx)\n set_source(ctx, rcolor)\n for i in 1:size(basebuffer)[1], j in 1:size(basebuffer)[2]\n move_to(ctx, j * fontpointsize * 0.9, i * fontpointsize)\n c = basebuffer[i, j]\n if c == '~'\n\t\t\t\tset_source(ctx, xcolor)\n show_text(ctx, String([rand(caps)]))\n\t\t\t\tset_source(ctx, rcolor)\n else\n show_text(ctx, String([c]))\n end\n end\n end\n\n while true\n for col in 1:windowmaxx\n c = popfirst!(columngenerators[col])\n if c != '\\0'\n basebuffer[2:end, col] .= basebuffer[1:end-1, col]\n basebuffer[1, col] = c\n end\n end\n draw(can)\n Gtk.showall(win)\n sleep(0.05)\n end\nend\n\ndigitalrain()\n","language":"Julia"},{"code":"10 mode 0:defint a-z:randomize time:ink 0,0:ink 1,26:ink 2,19:border 0\n20 dim p(20):mm=5:dim act(mm):for i=1 to mm:act(i)=rnd*19+1:next\n30 md=mm-2:dim del(md):for i=1 to md:del(i)=rnd*19+1:next\n40 for i=1 to mm:x=act(i):locate x,p(x)+1:pen 1:print chr$(rnd*55+145);\n50 if p(x)>0 then locate x,p(x):pen 2:print chr$(rnd*55+145);\n60 p(x)=p(x)+1:if p(x)=25 then locate x,25:pen 2:print chr$(rnd*55+145);:p(x)=0:act(i)=rnd*19+1\n70 next\n80 for i=1 to md:x=del(i):locate x,p(x)+1:print \" \";\n90 p(x)=p(x)+1:if p(x)=25 then p(x)=0:del(i)=rnd*19+1\n100 next\n110 goto 40\n","language":"Locomotive-Basic"},{"code":"10 mode 3:defint a-z:randomize time:ink 0,0:ink 1,26:ink 2,19:border 0\n20 dim p(80):mm=12:dim act(mm):for i=1 to mm:act(i)=rnd*79+1:next\n30 md=mm-2:dim del(md):for i=1 to md:del(i)=rnd*79+1:next\n40 for i=1 to mm:x=act(i):locate x,p(x)+1:pen 1:print chr$(rnd*55+145);\n50 if p(x)>0 then locate x,p(x):pen 2:print chr$(rnd*55+145);\n60 p(x)=p(x)+1:if p(x)=50 then locate x,50:pen 2:print chr$(rnd*55+145);:p(x)=0:act(i)=rnd*79+1\n70 next\n80 for i=1 to md:x=del(i):locate x,p(x)+1:print \" \";\n90 p(x)=p(x)+1:if p(x)=50 then p(x)=0:del(i)=rnd*79+1\n100 next:frame\n110 goto 40\n","language":"Locomotive-Basic"},{"code":"SeedRandom[1234];\nClearAll[ColorFunc]\nchars = RandomSample[Flatten[CharacterRange @@@ Partition[Characters[\"\\[CapitalAlpha]\\[CapitalPi]ЀѵҊԯ\\:03e2\\:03efｦﾝⲀ⳩\\[ForAll]∗℀℺⨀⫿\"], 2]]];\ncharlen = Length[chars];\nfadelength = 6;\nColorFunc[fade_] := ColorFunc[fade] = Blend[{Black, Green}, fade/fadelength]\nrows = 30;\ncols = 50;\nn = 10;\ntrailpos = {RandomInteger[{1, cols}, n], RandomInteger[{1, rows}, n]} // Transpose;\ntrailchars = RandomInteger[{1, Length[chars]}, n];\ncharmap = ConstantArray[\".\", {rows, cols}];\nfade = ConstantArray[5, {rows, cols}];\nindices = MapIndexed[#2 &, fade, {2}];\nDynamic[Graphics[{txts}, PlotRange -> {{1, cols}, {1, rows}}, PlotRangePadding -> 1, Background -> Black]]\nDo[\n trailpos[[All, 2]] += 1;\n fade = Ramp[fade - 1];\n trailchars = Mod[trailchars + 1, charlen, 1];\n Do[\n If[trailpos[[i, 2]] >= rows,\n trailpos[[i, 2]] = 1;\n trailpos[[i, 1]] = RandomInteger[{1, cols}];\n ];\n charmap[[trailpos[[i, 2]], trailpos[[i, 1]]]] =\n chars[[trailchars[[i]]]];\n fade[[trailpos[[i, 2]], trailpos[[i, 1]]]] = fadelength\n ,\n {i, n}\n ];\n txts = MapThread[If[#2 > 0, Text[Style[#1, ColorFunc[#2]], {#1, rows - #2 + 1} & @@ Reverse[#3]], {}] &, {charmap, fade, indices}, 2];\n Pause[0.1]\n ,\n {1000}\n]\n","language":"Mathematica"},{"code":"import os, random, sequtils\nimport ncurses\n\nconst RowDelay = 40 # In milliseconds.\n\nproc exit() {.noconv.} =\n endwin()\n quit QuitSuccess\n\nproc run() =\n\n const\n Chars = \"0123456789\" # Characters to randomly appear in the rain sequence.\n\n let stdscr = initscr()\n noEcho()\n cursSet(0)\n startColor()\n initPair(1, COLOR_GREEN, COLOR_BLACK)\n attron(COLOR_PAIR(1).cint)\n\n var width, height: cint\n stdscr.getmaxyx(height, width)\n let maxX = width - 1\n let maxY = height - 1\n\n # Create arrays of columns based on screen width.\n\n # Array containing the current row of each column.\n # Set top row as current row for all columns.\n var columnsRow = repeat(cint -1, width)\n\n # Array containing the active status of each column.\n # A column draws characters on a row when active.\n var columnsActive = newSeq[bool](width)\n\n\n setControlCHook(exit)\n while true:\n\n for i in 0..maxX:\n if columnsRow[i] == -1:\n # If a column is at the top row, pick a random starting row and active status.\n columnsRow[i] = cint(rand(maxY))\n columnsActive[i] = bool(rand(1))\n\n # Loop through columns and draw characters on rows.\n for i in 0..maxX:\n if columnsActive[i]:\n # Draw a random character at this column's current row.\n let charIndex = rand(Chars.high)\n mvprintw(columnsRow[i], i, \"%c\", Chars[charIndex])\n else:\n # Draw an empty character if the column is inactive.\n mvprintw(columnsRow[i], i, \" \")\n\n inc columnsRow[i]\n # When a column reaches the bottom row, reset to top.\n if columnsRow[i] > maxY: columnsRow[i] = -1\n\n # Randomly alternate the column's active status.\n if rand(999) == 0: columnsActive[i] = not columnsActive[i]\n\n sleep(RowDelay)\n refresh()\n\nrun()\n","language":"Nim"},{"code":"#!/user/bin/perl\n\nuse strict;\nuse warnings;\nuse Tk;\n\nmy $delay = 50; # milliseconds\nmy $fade = 8; # number of characters to \"fade\"\nmy $base_color = '#004000'; # dark green\nmy $fontname = 'Times'; # Whatever\nmy $fontsize = 12; # point size\nmy $font = \"{$fontname} $fontsize bold\";\nmy @objects;\n\nmy ( $xv, $yv ) = ( 0, 0 );\n\nmy $top = MainWindow->new();\n\n$top->geometry('800x600');\n\nmy $run = 1;\n\n$top->protocol( 'WM_DELETE_WINDOW' => sub { $run = 0; } );\n\nmy @letters = ( 'A' .. 'Z', 'a' .. 'z', '0' .. '9' );\n\nmy $canvas = $top->Canvas(\n -background => 'black'\n)->pack(\n -fill => 'both',\n -expand => 'y'\n);\n\nmy $testch = $canvas->createText(\n 100, 100,\n -text => 'o',\n -fill => 'black',\n -font => $font\n);\n\n$top->update;\n\nmy @coords = $canvas->bbox($testch);\n\n$canvas->delete($testch);\n\nmy $lwidth = $coords[2] - $coords[0];\nmy $lheight = ( $coords[3] - $coords[1] ) * .8;\nmy $cols = int $canvas->width / $lwidth;\nmy $rows = int $canvas->height / $lheight;\n\nfor my $y ( 0 .. $rows ) {\n for my $x ( 0 .. $cols ) {\n $objects[$x][$y] = $canvas->createText(\n $x * $lwidth, $y * $lheight,\n -text => $letters[ int rand @letters ],\n -fill => $base_color,\n -font => $font\n );\n }\n}\n\nmy $neo_image = $top->Photo( -data => neo() );\n\nmy $neo = $canvas->createImage(\n $canvas->width / 2,\n $canvas->height / 2,\n -image => $neo_image\n);\n\nwhile ($run) {\n drop('Nothing Like The Matrix');\n}\nexit;\n\nMainLoop;\n\nsub drop {\n my @phrase = split //, reverse shift;\n my $x = int rand $cols;\n my @orig;\n for my $y ( 0 .. $rows ) {\n $orig[$y] = $canvas->itemcget( $objects[$x][$y], '-text' );\n }\n for my $y ( 0 .. $rows + @phrase + $fade ) {\n for my $letter ( 0 .. @phrase ) {\n last if ( $y - $letter < 0 );\n $canvas->itemconfigure(\n $objects[$x][ $y - $letter ],\n -text => $phrase[$letter],\n -fill => \"#00FF00\"\n );\n }\n if ( $y > @phrase ) {\n $canvas->itemconfigure(\n $objects[$x][ $y - @phrase ],\n -text => $orig[ $y - @phrase ],\n -fill => \"#009000\"\n );\n }\n if ( $y > @phrase + 2 ) {\n $canvas->itemconfigure( $objects[$x][ $y - @phrase - int ($fade / 2) ],\n -fill => \"#006000\" );\n $canvas->itemconfigure( $objects[$x][ $y - @phrase - $fade + 1 ],\n -fill => $base_color );\n }\n last unless $run;\n $top->after($delay);\n neo_move();\n $top->update;\n }\n}\n\nsub neo_move {\n $xv += ( ( rand 2 ) - 1 > 0 ) ? 1 : -1;\n $yv += ( ( rand 2 ) - 1 > 0 ) ? 1 : -1;\n my ( $x, $y ) = $canvas->coords($neo);\n $xv = -$xv if ( ( $x < 0 ) or ( $x > $canvas->width ) );\n $yv = -$yv if ( ( $y < 0 ) or ( $y > $canvas->height ) );\n $canvas->move( $neo, $xv, $yv );\n}\n\nsub neo {\nreturn '\nR0lGODlhjAC1APcAAAQDBISCZEJDM8nDq6eihGJjSyQjFOzj0oSEhGRlZCktLKKkpEhNTMHFxBES\nBFBSNDMyJJSSbOru7HFyVGt0aqm1q5OVhMnTy2RELLmzmy0UEUQiDMa1pZSEbCo4MrSVhIh0Z9jO\ntLSljNPV1IhkSPjy3D9EPCYDBB4VHJGVlCIjHGxKTOrl3GFkVLnCuUU5LQsLCXmDesq9tk9XTBEa\nFOXVxSEqImRUQvv37HF1dJOahZmkmOzq3Km6tMe8qEJLQJhyVIZ9Z9bFtJeEeLamlG5sVFEzIUAp\nLKSUfGBeXN/FxBIUFHN7XF9FPiwcDD0kITc9PF5ZTk1LNFlbQ3p9ZYqMdXhqZOna1C4lHREOFOXb\nxLesl/z6/JeNdj47JJqafLy7pZ+Vhjs+MKurlYl8dBUEBa2chNrQvBUNC9e8qkAsHIqLbGtrTH10\nW8O6m1Q+PPXs301EMpyMhMGtpFhURNzbykU+MVBMPS8dHPTq1B4UDD0zI4qTfDo4LU5FPJKclvTm\n3G1dTYFjVHhcXIOMhlprZKqrpFxMNJWLbEw+JF1NPqSbfGBQTKyri8XMxEQsFNbb1CYMBB8dHGRa\nPHR9dD8xLNvNxH1tWbCelOXQvG5lVUgcEIhcTM/KrDAqFPny7bTKvLq+t3RuZC8yLk1STZRqTPz6\n5FFeUfz+86B6XNbKt+ve1dTDrG1lTC4jFPTl1Hh1Zru2pNzUxMS0nEAWENW1qaiCaJh2aMzFtFw6\nNImFdte9tCEcEzEsIaCchqmmlLa4tZZ7aayGdFQiHMWtnKaNfJ+blo6OiWlsZm9OQbWqjGFeTtvW\nvFU+MszKtohuaPfu7B4VFH97XIhoZJmUfHRKNGQ6JLyafIeEbKijjBITDFZTPJWSdHJ0XIqUjGJE\nNEQkFKySjPvy5EJFRB8lJOPm5FtkXFBYVPv59Obs5KR2XNfDvLqmnG5sXC8dFOfczK6djD4tJKSO\njHxiXKutrMvMzNnd3CYODCQeJGVcRHx9fEkxNNTOzPz+/OTWvL+elCH5BAEAAP0ALAAAAACMALUA\nBwj/APsJHEiwoMGDCBMqXMiwocOHECNKnEixosWLGDNq3Mixo8ePIEOKHEmypMmTKFOqXMmSJReJ\nLxPGbEkT5EyBM2PerMmT4E6D6NJdAAasgQtHF8qNKFpOwqeeUB+iG4iqH6pyhpCJ8fCDEr0dpGio\nUKBCGylHUweiwzHwZ1So9kJVoHTKgzYYo855+0PpBwwAKlTYsGHCnDkKlCgQqoD0goR+bt+yRGfP\nWwJChGgAAGDDw4xxNLRtBqDNg4dxM86pAADDhjYVMbzF+AMpreSeKUbFuKCDHAAa4zzA+Du6+Oi/\nMNCQI4eM0igxFW5HNQblD4sdNgAogMJgifHv4AGQ/7PRulAPCY+lW4yM8Ga6GD/+9FC9ZMko7+Hz\nh18C5RylChdAkp56Gb2UU0ExwKDCDKSIpt+DEALmwSiU2GMbZAqxR2A/TwF1jDY26PbDZsSxFuGJ\nJv6lAgM/mPNHPR1qeFtk6NSIHiT9pFNOP+gk+MMpXZVonJAofofGEsmpYNooEyrAgCEXboghTv1I\n0MMOLuCAwwihpNOPN4Rc4OUO2lDijVjZgUdkkSSWONwSnf1ggmnjnZNCA5B4yYUEMvYkwR/nnOOB\nCYWcQg4FFxQCgwl/hGKaNx4sIclwarJZJAza0DAKFB4sp4ACpDRAmYVTShdDWfiZthkNCoimQHY/\n/P9Agw1orLkZkpZeCoByo4xCTqYepPBYlJLZYwMNJpggyRKBCkoiAJLcNUMhNHhHnJDKoZHrtkuQ\ngysAOUzVZ0vHAEAJKBSsRtqE4EkyirbJDYetJNpua1ytQ+JbHHKbESLlMTTEN8qrCghnYnjJoXFk\nvbfSa29+Cdt6bw4DSobOMcfeRYoJ9UF4JAz16QuApA4+jLDE3yWQ3oE0odPAOVD41ZqQtv6lDZIf\nHywpfibbS9wfBY0rEjos/EFDcuL5tq/E8carc7Q9Rz3KCG+hQw8DNZMo8pB/bX1kyVGjuCYpFdOE\nwx8mHKdmrQq7idxwtZZ45LdhP5xAhzVVIAnEKYL//C3cbTfN2ptLbF33g7bmIDRHOyUg9sJt+u1A\n5KxlkcUSWRh+LZvyRgj5aKQQe9JLhlgbIXKB+62NwqkTHrjCrK0+uOEnU8o3a5IoQA5xJthTakr2\nQFEcwwhvtrDCKCyxusJZyBu3Aw4s7PwS0WhjPS90R40cDfSWsdndLeWwL/H6Yaowksmt7jxrCt+8\nevJfv9ZLH2L00UtgvKBRBgzed27vx39ZQgNY0oC9talI7QuZ+5yXHOU1EA3L44UEe7GNblChG+3o\nRjeW0QsJ5m843juY2FhTuF0BQB+iGwk6HCfCx1lPGxI0gAqw0Ic95E8Pq6vekap3PQjEYQpVGEMG\n/zIAhgGAgRrtoMMdBNAL2ZkMBjSoFxR2lBJHqCtXw9GGJMhhAAjQQRPt0AU28hGHF/TCFb3oBRb0\nEA1epBEC2whCNsAgi3fY8R018EEGwgCLJPYiGiB8mBYDaAiVEOJZQ0IcBHkhhh+AMQwZcIMRs0EN\nbAShCHRYBiZ7AYE7LKMbYQADM1ggDjiI45TiAAQzMoANbMDiDmrkhfp8RilzpAQdI7LdidKnB1cI\nABbUyEYswCCEGsjimLgAQyy20IUgdCEMRWhFK7CxBVzIggefwAEceHBKHvDgFbLYQjayEYRJFEAA\nnuigHvjFNM39ZRReOkk9fIMy8ERPD70QAB1g8f+LWMRCFSE4gzHfUYd31FELqvABLnCRgV/4QgQD\nqCML4EDRim6TBweQhSpUkQFfUEMTSryDH7BAOxQtoZAnMQab9qcHFfQhCrCoAjyGiYsznEEWA73j\nK/LwigP49B1n8EFE7ThRHlDUqBc1ak8RGosudAEbXaACLHnBvzJY1X8QQgZKkHEpNLhRCt2oQjC3\noNCNCnSgB1jFO3wKiFf0FKNaeEdPX2HKbVK0BCWwKw5KCYc8aDQW2RABNoqQDylMyqr7858uv6OA\nAZYEHeNAURm82oc7FIEavsjGGLYAhpratAbGjKtPferNtr6CB3nwaR62aQq+nrIEfG3tKeHAggP/\nhMAHPlCGCKjRhju4wgH8498BW3gcFTiWJOlQACLzM1kViGEbRcAGNQgwxAwo1KbYjes7VjFab3rX\nm241JSotKl5xmEJLfH3FO5gRghD4wwciCEIc8re/ItHAESaRQGSJa5wyaAMLdqBDASZQBV/4Ygtb\nsO5CsXsGOx6gp6Q1Kja/6d3y8pWis8UwX7/5Ci3ENahmyIcNX/cdN5HoGIu7CAv5qzWX3mEKBWBC\nFcaZYCIOQBUMrsFaD7BjpEq4wqfEQTa1hN7WVjTDSuXxOyzhhjbQoQ8qkOXciCSyv/yATyXRhyIl\n0Qs7xEEKBQhAgUWA4FgIoaay+Oxa3arTI19U/7w4qBE6qmKVtQjZtXk9ak/foYUzbKGch3hB/tpH\nZZoBoy0h4cKK1bQELMzPy3coADb44At4/GILHBiAEG6aZh3v2KentbA3xaElOc+ZznZGr5u9yVMe\n1+AMYPBFEDRhBz18LW4lBddjGVA+SfTBDnbogwC2EWax+mIMseAAGMx6TO3e8cGAQGpFuWnqaqMC\nFTVSNYYvytM9A3UAYaDCMrCwLPbtimG6HAXeQiKBUYTHe9rI5x3uIOwotIAK0vXFL4bIASHg+Jie\nXit3WSBtCcMhzpCpdrXRO95SotatqeWzFo7YBilggaoH06XtBEiSevACYoy8wzbuIAYpLKMA3f/A\nRoGzcellc/qmce0pd426YW8evEZcuHaNsL1zO6OylDX3rloPoIUMBCAfHQRkIpd7jJFwYQEQgwEv\nBDCFkUtBwEXA9xowe+Ai2hSnnlbvWr/r44MjXOd0FojO94rKvNo8qd9c6xl8MQEB2BpealtuAkhS\nrrVRdt53kMKLi8CEVlLj8NkgRgZwIYQ6PpvHB+h2hWlealMTRM53fi3cedDWPKSWx2DARhRc0bR6\nQqFsHkEAwhRmAGHPWwDDLgAbqCBmpx44AwPAhSoC/o7PQ9ibBKd85RWO+U+Md5t5AES0H75TPg+g\nC8uwwweRlh9y1GMkhyQu3NwogCX24QUCtiD/7Y2dDRurQhZacPyDIQ9xb/qU1NmU89p57vPykh21\nD84Dn/1cgDusEW71lAIjoVIltn1YAHsCEGxSMAVZRwXOVGnZQFY+gGM39XgOBmrqdQBw8AkUFWf0\nV21DBnRJlQes1mpExwxgEAR0MGJwox8UkEIasQNqAjctZQdiYAcCIGwMaEFQdXhdN4FpBnbapV2j\nBXl11YFEloRrEYJHmFR2JXZaUAMDsAitYAdYIDuLZRwMsDIf8QcnA0EqEGwvAGxxQAdFUAQ86FTB\nRAwcgGZpJlB45GlF6FME93ND9gl3SGp7JV6b93BKVgMIJQK91UHoox/kQDUhQQHLpTVguAd9//CI\nAiAF26AJFhQErWSJ1LBvYDCBXwd2oPVsFzhRR3hhxmdKDLeH30SCfviHWsAKGdAFK6gC0ZBrt3Jc\nHoEOpLCI7LNI8/OIcSByBZB1KrcGAYAN3AAPCdZvneaJoPWJbWZXDmdzNodKROZwO1WCEXcAr8YK\nbpANrbAHBuBEWTgaC8BuaaMmL+RGv+ZlkohyrVQF3IAI2IAIvkAEHNBvnch7DmZHq8BNQDdbNDeN\nQcZ2DqeK36RkfFYDIdBRRWAH4Ygv47gZ+hAS5SA84aEN1YNPeyAAcfBlMBZdUNUFawBVSJANyjaB\nzIZTj6dk3DRtPzZtFvZzqeh5YheHWrCQ1P/QDVLQQZSCMkmQYhDxCfvVX8kRDUbZRb/4i7I3Ae9Y\nSYdnBglWRLrHac22Y3f0DqLoj5wXbR04kEV2VJwHYXbkYXwWAspAANjQAmJwFyGUHx6AehphD+72\nHfsDQUfpQ/MmYK1ABVXQl9TQBYdXDCIwCz5wZueHU1GImH12RwT3YD7GAxOlh0kognUllkOoBcyA\nC7s1WAJQFm0ZHocIEqFgOsVRl9rARl0UidvwkdIQACMJmE5VkpwlBJvmeMYEiOkXcATXU6L4ZpI5\nma4Vd2M5lmmmCluADd3wZB30meCBBqEAEgRIJKbJRm5kB4JHbGcIkoApXWYQgW14U552mwn/iVaR\n+XZ1JQ5DloSyVUpuxWZ8RpzMcAZu0AVFIAX2ow3MCR7l+BExMDhEaT04xH3bQAf5wAZFMAEp10q2\nF5VlpZJ3JJ549A6QKW1AZ3zpSWQXxZ4YyGOilX5nkFDUUAR9AAEqEJHG0XQegQrmwF+ThZHVU53b\nkA9oWARtIGaWtKC4t1EqyV3e5mxYSVGAsIFEZnxxlmqfUGEQ9mBieUdpxlAhCgEd5J/6gQAfIQHn\nWGJ2WT2O9gJgNgFMoEHG5oOJh48NhkerwAK15VauRlRaYopDOmRLCJDbNFft+VMe5mFnMAAiQJ9e\n8Ef8oh8T6RHJtXrWY5Rc1gdxgHJUgG/U//AFHjVWs+ByDaZWWIlR6wdUY0dqXnmh2TZeHAZhasqh\nHiYLuABYg2VDN2Oio5EDH1EOu5Nxm2GaRulGXpCo0oANa8ANh6ervkAAItBv/vZZooVRp5VWcbUK\nGPYJmIeea2FneMiBehaqP8WkeboFBMANBQAB2DMpxSORH/EJI8IzxwFBbBQNKjA/kcaXmHV4gElj\nHLBRFEiEPRVtxrpddqWsp1ZKRYpepYhK7ammYzmqsoCT2EAHKlAf2RMerPoRx8ALrWI76eOiesBl\nVLeXYgUP2QAPlaax8NCGC/Vv6ueYaxqkD2Z2DFcjHIieRNZagHAAbfVTOpZ+QXgGGcBb2/8waLQ4\nGuewbhsBDLmDK3BTqNaDBk7QB1MwAdKwBl/QCAm2BSKQDb5QDEhABNXFARP4oDrGYwNbAw+mYy1J\neShLanNWjW3lTWtlRzDXZzY1ANlQcQbANpPzIArgOx5RASDjMBBkPfVxF2iABZalrgTQCGAABhmA\nYJREDWYgAiKQuGS1e68GhzWgCqywe0CVtbXVm9kGp3ZmChTVbUvVbNhlnLpwCG+bWN0KGHTbEYaA\nKUcDAJfDC9GgPGyDDwqQRvMjAD/QAu0QBDJFY4m3BUjQBWRWmELACpsWuT5ATHXkDzb1DoCApkjl\ngXMmEDjAAsckCwfwdiWgXsf0oaogBBz/QASt4Ar4eSKSkLocQQ83gx9SF2U5exyvIQZREATIGAu+\nAJgHhltW+72sAAaN+w7+oAoDcAYHYF44gG04kA6OYAjeoA/IcA4mYD+jYAc/EAUUIAeG4Ax1pF4h\nwAqs4AMcgA1egHHlsxmSgIgdAQx30ZPmKgn5yWL7wkiaEARhALVbMAvEgGkffI8J5gNn4A8DkGCq\n4FPrMAYxEAV98HEQ4l+94AewkAEeFgKdwArEQA2+RT75sQTX5xEF5ACiMRzLUk+7NArLoAtjQAC+\nesM+gGAcwIaq0AndSAEUgAw/oAJxu0vPoiBR8AsNpgpusAhIBzb64ZwfMQIeIAklyj5i/4w4xmEA\ny8Cu9YhgW0AMl9a0LSDI2wIyw+EEUTAHB8BRRbAHWIwwh+YR5dAdq6GqDwMDAtYO8FC4OUwMlASY\nBXDHD7M/kxUN3oMFvtBnurAHd3Ei+8k4/UAJXnU44MELfUAHXUAE8EAERKBHT6UJShw2dTmLmKIJ\nnSUAwLXIACCAH6E3c4LMRsILe3DOXkajcbAHvYDMIIQGsastfaAJWOAAL5x3AOAvHsEF5eABp6Bl\n5Fwc2mAHNAwPyLgFIfoC/XM4cLMEybMZfdAOdqA0pwvOHyEolIDJPcMw2iAAuqDG/jYAv0AHSufO\neUspYuALENAHDDDK+0IPiQgDDGBAh/+jAPjRt9DVAWZABL9An71AKVrE0NowOc3TB2AgBQ6gLHyj\nDbaoETFBCVJaN5o8GliQCPkQBNXkDBkwAa4wGt3izbt0PDAgAM4QBN7jQHlXL1r8OwXSD1wV0P3l\nCofQAVtwBjyAA3mQDWoA1+xDPVTVCz6gC8JlQkYyHPQAlAwREyPC18WxB9gwCwR8wKYwC1gAwyZz\nzYCEBT4QBiR8QMSROQBQyh3BBTtgLVnA2ACwB74wADXAAlMhDqywB4ydMEgC2GFgADDcNePgO4i9\nECPgblgV0DCwB11ARwdQIzygBYpg2Zc9HNEAAIoABvDQC225OaNBDjC9z5CwGi5dN0v/4ACODdmr\ngIffBAKoDQO6XAa6kAHZIAAogwV0EASWAIMWgQPLgEhgzSZZUAZ90AUTeNyf0FbsgAez/Rd3kAGz\nsAXL4CCIdSt0EAZ9zAIfgQqcrT+kIa6HEw13gAQb9Q7ZBGqMMNsA0AfvGsTtoMRykwSqAAd4dVr0\nXRFDEA9YAG+9gOGrzD992wrZwAqysAqk1lZwsAVOMFn5zcjE4QmxoAUDjAvtMORSGgU+cG2mwAEg\nMAcvThFD4A6VoC3xBjU+Q0LBJQl7cAki4AOWAAhAJ1eyEAjyYt1FvjQAgAUZAFRnkH660NX8UgZh\ngG0H0AXf8ASMAAgfEQ56UAl/wWUq/+AwmeyfZRAN+PACbUBWNcCVPHBHv6AH5obPuyQkekAGdc4M\noxoGM641vBALqPAK2LAHRmAEzXAFvb0QxhAJzy0eHSRB3Q0hmGJVesALvkbmQrBdQcpdzbjcbYNF\nQlIGBnAHYWBNd/oOWxAHIQQDlaAI72AKSDAJ+fANG5ALSnCLYRAJ/ZNGQmvhbOJVDuAKfmCFeLAH\nRSACrKBjaF7poAUHHCDb8IxullIGbnQHWK0K+xdXsUAHJtILsBAEld4GHB4Mm/AN6/ARclAr++Mr\ny9Pmg/0gjd4Le2AHbSBfvPAE8XAJZGUJVwAIe7UKoKWB7FAJVsU69wxyaBQHRQAPPv9QRxnlYT6Q\nD8QB5T7wCj4wCxKaBtVgBDLwEUNgVazRB+RgaxQvLw1emivft3aQD9yQAW2ABXjg8W0wC2lQA/3I\ngfJeA3TFDgodCWyUOU3fX3W5667w8m3gC2BQpn2GfgNAB8SxDKrgVj6wCm1qC0bADh9BBibECx5w\nhayz9CB0VW2uMNHQC5ow9b6gCFaPD2NOBO/u43vFAs4YecRwA3qw8ihglNFwd6yTBaDvDh7/AorQ\nBl1Q1+g3lnVOqprQP9hAls6rrHBQC4IAD1cuEY5DVdogBiTVNvoz/AqDWGRP/GVQ6K3gCxkQX/Ml\nQX0QBJAN9nCADnMahWtFUWdQDIr/4AQncAL3EAmRcA96QPZO4A7goAZG8A35oPrRjGO4uVa5Wedn\n0AZ/oQeYEKHVz3ZacA3/8OoA0U/gwIEs+pSppIeXABVoHKLR5kBPNF5Yeu15cefGskBRbihSVKSL\niFkZzLR54Y4Xrz1BMpx5BwgODnFwXr17d+DAO3GocByYA0JRHKI3LgUJw24OBx9CZNU4wOMVHDh5\nXu3M+U7WmTOycBXRBgDLnHeqhBzAYYoHoDxp0hCEG1fu3AVooiXkZUKSHr7RKFrcE+dOvjZdfJkh\nQCCbsi2zBoDJsAWJphe98LAMskXVOx7iPonjcUBL1gN5xOFAhUrcga6yYn5KLTB1/2ocNOFI1Zn7\n3RlVqs6AybcEgJ8zNdIEAyHkzCqZqnahmxtdej90CQBEwwNDhQksfVdiCSwlH5sJ2BaJ2JKBw3of\n7X1kEEFt2R7LvF4EESGkBqDan3i8Gw0nzk5DZ7bUoOuHC3QKRAWd2h6siapXJrxpK9+YGSCfsDR5\nRRVijKCFEyRUkSkTIXCYLkW4oDnILxjy6k4hLMB74ZBtiggCG8MI2IKp9ZhqjwMRgrijFywkMSCO\nLrbQD5BPHIQDq5y04OHJBQvkIst+fHqQS3G+BPPLmwTkiitZfNgGDQDIEEeVW+6hxZpgarGEhQNq\nQFFFPRuI5qEy0JihEm3+6uUFO//oWKYbbHTpgpowRMjAPfc4mGUyO2asaAokOFinhpnQAW2nAN95\npaYnt7wyNVPEKeE0miKM8DYpteDKrDMyiAMGGIxBZRc1TtjkGyA+4IDUd/LUM0U5/oykjDJgiMIP\nhSqK54U4tsmnCFgWpcYX9GYBdxZKZyGmmHz2cAWLaHrRxIw0MvEUSkBEq6FeUlvFYUEuUK3tyxLg\nAJMHqm7DTTQttPAnBCEGEMKZX+yAoZJ1UBGiGXCGwYAEdf6x5JVVEEx2OmQAcPZPNEiJYiVq7VAk\nnwJa6SYIXahBjwgi2AHSB2LKvcEVJ440oB0zWKnhik9ve0WLemuACeB80VHwygX/P4FmLUCuBuQq\nnXA6mBlmeHsMlwF82UMPWOAwJY8tbuEkGRJKEcaHmEAOea5P7AAAhjJOiCSScdoxAI8jC1Xkhnxa\nkQaRL7LBhJgtiCCGKSF8ELKLfFzpQxMv9oBlCx9qWOUT6uBgARAAdQoBKkBOY722K3G4jfRVtsZJ\n1HeY5moAysGIJYxt7vAB4NW0EiEVINQhYpWZ6pbOnnjydrbvUdrppSLBq1WEDsQRoQYem7eInD0f\nZhkyjj6C+KWIO7AhxodMQu/ns3lzuo3WmFinikAHP/mEKkBWEZCAajAaWfSGFWAAAwcyEJluyaIz\noOlJHohhi1Qk7zTMiw4/3AEA/wCgIRIaiAQ+WjCKisyoF/G4VraCsAZqEEEERAAfezhADCRc4hCt\n+EUGihAHELAjDZuBw2fWMiYeSKU4UTnNJ3DAvyVCA2BIA2AAcXcGISwMMgvcwhZikQFckOpLB4BD\ngV5Ri2vMgid0wyBBLsCLMpDsgxrghTnu4I4Z1TEw22hFG4IwBGqYIRswFNcMJdOGfMAiG76Ywh5u\nsCn9xOR2ATzAK/LAFS2A8UGf4R+s/hfAp9RKd+2JzBZ+kR4fDMAS78jDqlggOuq8Iw1CeAWy0giX\ndPSBZM66hzv00IJl1NEiT8BCH+KgvRw1ygyQAxcx2GEGarSBmN2QwkUuIQIf+P+GaWZRBVSkkofd\nFOcVAvsS/zLZGdopjYpVnBwCMzDKLGrRB7hwDQ/UwgMEoeMdrMjE8mYpF2Po4Zb30IAeftDLdM3o\nCSe01o2KuQh4NCaQIuhCFAKTj2Xc4QV7UEQx2tcecrUPJhRiDStgEhWnfYYqAsvaTiw0AN0lcD1b\nEEE2tBgLMLTHNWgL4kDgcLupQGOfckHFECTBwTJEQg9iaMceLNKLJwAToYpoRRGkYUxkUmpIdnBF\nHFrRjmjZ4Q6wMIzNwtCFYmSDA6zIJlS0oIrUcUZgS7wNIIp4ldudU3cKXGAos/ELmuICF6qQxQHC\nOZBPAKIGsczpT+GCChb4gaj/Re2DKPrQC8piAZgzisdgEIcNJKCHGDAkhhk0EQ87FCEfXqhIL/yg\niaMMoQOwaMU2FBGIIJghUjV4RyZ6A7oiPnEtRYxiDVTBCh+osySOE+Uoa+qM3jCjVNBg5SeukNtX\nAOIKrFQsQdARBieUTA8QaEGRjOTLGb2ADppoQwC4QYAMEGMWW4DHIhSBhWX0rI15U8F585GPQNwB\nCzDgoAPicIkhbCETWhDCK3Hb29iNqa68Uad7HUeEX1R4C2DwKzyvIEmAOahonygLO3yA3ewKBAe/\ngIUd/OkOMSzjB+Ml7xMykq0AdMEM4COXCDrwAj34IQ7dvS8M+kAH2c6Xg0fW/4Md8hEEVeQBwUIg\n2jetNi+sbOUMuCiuAtnxOCLIND2xeKcqtCDXSHrmNg6yBDxA4IMSL1YXOCqSYE4xAwgYqbJ1JO02\nNFHjzmaRCGEIhBPEUglX6AENAC4DFjTyESw4S2/OegIGLnGGVdUgwWf4JiDsND/cWrm4CZxwFkeZ\ngVjQ1Bk3Fc07hKeaGnAAHhwQR5vhwoFe0KEdmtDEHZaxjDpbZEZ4ADYWDtUKbFCDZlk0AzZe0MYy\n8AIP0cgCDBziikMpwg8JUdOfNICHR3Qhljh4R4I3U92r0HWAXMEF7xS4s3aKUovLdQ0LWFAWTHeI\nHfCQGxxkTRAufEIRSc7eHv9+0AII+NIVKuvFsIvtLZh2oRV4yBvJHKI3h0RDxpWIB3102ayiPsIH\nr+KBcRoZyZxUGWzFzavjKjwG5Zby1DWoA1Vq0B4hEMEMHLCETLS07wTJowx6cAce9NCHdkzWl98p\n1B1aAYJiwEME8WlDHKIBvfs+609/4gsWtFrRF7jCHWooBg+8dE+R4vYmUlrpY/Iq6r26cwB+LY6q\naWJp4RINdDyHiwwCqod7RKISFBAAUynbCwNIAjBxCEQbOuBHM3SADYmYOlGP7Cw0PEsPtQ7CXn1R\njDDAYxaCdVVNwn2GTJT8KlqQxVbE9h4sVjgbbUdgewYAWC3MxD9SsQS8WAD/nX3hnQs4uMQb9VCJ\nIJhA8E9QgQokUZHAtCJHYRgrIffQJ2k/mmR5e1FpfRGLAXQFF01zGk5N8QohZOKIE1Kp6lWh9i28\nXgS+8IVMP/121xAADIBAR2gOAEDl9R7vA6kDUXgCNYgHP4CFF6sslQEMpWsDbOAGbgiCIqCDF1gJ\nQzs0RysDBzAAAYAFfKsDAZkQcAqTLwm5bBIQktuNEFAFZ2ApDhAlzYs/UkMgDEu9ZAiEWRiNVQAg\nftC3/4sLOOCAIZAZSgi8wVOBlXCHi5CCZZiAAECEAGgDCaSPI+GFaNCGh7i8O+iGLvgFeHKNSPqm\n2BnBKKmXUeGaMlm/AYiF/yxiOfjLIVJrjy4igieIB5cQAkvAwzDywbmABhbgAUO4g8mirCNMrRcQ\njyLQozZohQLYhj0QRHIgRIqAADqAhW7xhS3oCreSNxYQnlgpots5sEfaihAgxZZ6j1+AP1/IoVLL\nAATqoiAQnDvoAlyogd3bw+jYF1QAAwHogzrrheRLLa/SniKYADbYrzuwgxfog0rwRcp6AU3QhTDI\nBnjoFng6AE4sIk4kmCLixqSBF6VBPa4IARa8ojHIBh2IvzHIIshAIOa6ATzoBS+wgB68xRRxgcDz\nxeRbvoS7A2zZL5fJBykQADvoAzuwA0e0g2HqglITJfjzATASnvwhHTuJpP+ouIopSr2VQrkKQ8V0\nzKJWBIPui4U9wIM+EANDqEfp6D1UcAQxMAAjJERhk4I7mMk4kAIik4I4MEibHIxLwIZiAIN6UYX3\n8Jxvq42qCBUA+kBjEQ0VLBOuYMH3YLlDsoD4+8gLqylZgAfLqAQ6cIQESUmwnIsLMIGXHETlk4RC\nsck4UMYXEAApEEgf68cCACvIGYCYUCnAEqx8SYsSkAoAST0tqIM6kAWlUcEQ6ApPkspDQsdsUEct\nksEBkIUg+BnwgoSwTBFIoAMTgsTkw4JqIQqCLEg7EIA7EAM/0LWoKgJEDIJiiAVZuILZ2Q1ckAFZ\nWIXOaJWdUr0zYAYrYwb/FfSNbgoBLMsAc6zKvVJHDqCpvjqDQAsmPpAlzJSLdGgBG6gsFRivXhjN\nUYAAk7SDnCSKfIgCa7MDjHuCSkiGIYicPwsGQbgEEOgAJNgCVgCjeUtDZzgDxOQNKDM/TwKDF0zH\nMWjFLWJFNSwCV3CFO7hM6ZQOCaAA67SzOuqFSkhGyupOMRjIFwAJO4gHYGqqJ9i2SmiCZGiGeIiH\nSmiGEZ0tEKAGH/AHWlm/4mIphsGm/ExDyDBHx8wrdcqrLeqCOOgFK/CpgfA/BhUIdKgCG8DOpRo8\nR1SqXhiFPpDSFzCU8vzQI6iEfTiCI2gqLo2HLX2CI9gHOjwCxOuA+fSB//fzlgyYveFCqzT0gTV8\nPcccA3VkxciIjP+8BDuQByOdjh0gPBUgh8GjLCm10Ck1yPKshCN4Nr+wiyxw1GjQgHgQunuIhntA\nA0zVAA1wh2YIBoiaACrghkZwgxkVgt5Qu+I8JOQU0C1iQ3V8uyGIAhnwU+kIBZdUAYvgzkIVRCm1\nA9S8tid4tsq7ryObPGe5JWQtGWfBAx8TgG3oBmrIBjYVx6HEInNURXUktcj4BZYbJa4oBlhYULGs\n1YGAhBnwTBuI0kKtDO1M1D54gj5Z1j9xh6DTAIB6ghWYBxAgg2KQgyGwgiZogn2IBmUtA4p4gVbo\nAjbtDRVkvalUxY8MJf9z7NYtkAVmoIZjILFyJQgHHUTt7MXuvKg9IMhfrLwjsws8iIc3GIRpmAYQ\n4NdwqAXQgQNoMCxVqIU0KBdNaAZgyzY9uA9S9QG0wrItGgN4iL9urdMtqNNfgIc6fc0QgAcw4Njo\nqIJBlNJevIhktAMxIDxteJaKe4J9aIJBeAZ5+IcP+Ic5eKVX6pR62YVdEIJdyFmd/QB4CIZmQIFo\n2IMiWIRIYQUhSLfIYMxUfD3Xm8Y6BYMz8IFsqIOqnYtQMIE6i1Kt7YMX8AM/6AMV0AMY0APDS0IN\nvYRnEIRgKIa7/QcicIvIydlaqIVdUAIl2AWz0JlZYAVlaIVDeACRaIT/WSil/0yPwoU/x3S9pM2G\nAWCG95AAyJULFmgBMYCAKBWDXuwDAdDJyeIFGbEzjIgDkNCEYBiC8G06diCCGdoZDsjZOfgs8t2C\nNCBFH0ACPaIGUiUuyIip+Bve+JvTQ0rFagIz5p0Lb/iB6TVJXhSmg5xCE1LGE9oDjPhVkAAJPyic\nQGCtIOiADugCJECCYkACIvBdIQiBTMgEMOCGLuARcDlFX+gW/tWBFrYAYwsDC5BhXxhaAI6OC2gB\nAy5NgjRIQ6WsjLOWBubVPvjM8UJQi5ixVpiANpAGbqAmtjoDWgkBVsgAX2CvWXCD91LhFYY/auCD\nKgDjMOYDXfAFsbHh/7nAAWOggwIWAAJORkHECENhyz6gDwiw46WaEa/7zEqwlmyZgCBYBM95U94o\nxS24RCwWATP4Am4wtm7RgS/GBirAhhyZ5HbwBQw547mABCoQAAEwgU4eSDFQxj2ohEq43NAkyFKm\nrAZ+0sErZT6+oTagGWUYWrSaUaJ8vcjo4iqgBh0wNjCO5G4QZliAhRZogQzQgkyeC1QABgm8gx/4\ngTtoY9FcRj72Kh+7KD6m48sVYhM10T0Qj8ThkQsLl8aw39cjgPv9ZXSkhirAhkimgm5YzQJYBjoI\nAq5Q5rkQBwtoATqggztAxumN3lIuSKKQYEWgUqIw6GQ8UYxTAylAnP8MPmFKaScs2gIz8KNF8IUu\nwAYw5gYw1oVgLoICmIIp2IY4EIAwyOfm0YVT2IYHOE2tPdSE9AN//p25zIeTTgSi2Gk7wKPEQYTO\n+haY2gLGKGoRIIBF+IIIWAN4rgJf4IN3ZoKRnoKZnAJevIMzWGnpcARKMGkp6INREOs6gwBR7gPU\nBGg6eBkciUL0aocikORGWYRFQIIbc6GnS4/2a6dsWARuWIMAcGpq4AYqmABGpAMMRcY6C4NX2Oro\nQIcGaAdpJuvBE9mCnEls0RZsyIaQPLUCAiyckAVWWI8ECqX0wNMser9F/mtJ/ugA6AaS/h0pXVRJ\nUAStbuzowAELEEj/QSTU7rReKcAW50MCUoMJUpmrLzGFEniFa/KNAXCDLWiEtYOpQ+KGSHZAasAG\neTbpO7hjLLhtPXGGGeDFZqRsn96GAggCw9iCt/MN13iHVfDDiAwNraiBENCdVpTu96sCKqACYJbn\nAoBmIjYAXnCC71ZJE7MAEzBJQj3UbZiCIuCGbGgEIoBD/JSFD9QJbSRBraCV/GTBlsKi+FiDKqju\nbqioTg5UXtAGA9eTUKCAwx4FBu9OB0fvbmkoz2EpC1+FOtBGqmCBMdmKD79l+PCFL6CGL6gCWCgA\nAehOEoqGJdCGJWBxPfkDWJgBrx08i+gD4H7wNQiD+IOUUlIFLLtw/x5IBzuJIsA8g04orlLqhAHI\nAAJ4wHbGhgIQg6WyQm3QlSlPljGgglPwgjozAC1/1imYABb6Anh42lKa0TOog2t8hw8UzA5PQ5aK\n0+Ls678ugh+AAF5IvmiAgSzIGz5PFguIhRj4ARvwNSyAgO/cBjZYOF9oqFJ7u5AELMI0kyAXmxl9\nDDBoBGpYgzWgginYXJUJi7yRclKvmxhgCM+cUNKkg26oAiP3hccsNTCrKVxwBpdjLixzD3Uagy8Q\ndhMXA87VBj3PGxogB2XHID4QAF4Y9ELF0CkQ1Qes9sho1YomJb/qdfZrhC/ABiYoACkouIhQEw5S\nd3bHIGfQBeOzM//pvYMC6G8wllb4E4ExaIRGeD1thQymXaAc1YE1KIJt6AMDMHhdSXflU3gMqgAK\ngADsrLPqLU2J5+93XhQ+KHJfaGHHdEzF4PlHroIgWHIVoAE9PzQOWnnF2gFzGAUVsOMCNoE7mIIC\nKIDVLIJ2iJlugIV4nngv/oIid2cqUJ9eoIFD0xsAS/oSGwNzoF4x8AATgOaZBG5p3gYiIzLYZoMi\nEGYmIGySJngVuEJdATCkT/sS44MBFgBo9mQC7kWx5s4CJuDSvAMToPw+sAEV15WjPzIYKPwSAwMd\naIcfSHwC7rU6OsLkA0Z4V4EBX4mIADDBN9bOl7UdAH0CJtTOVBmcSVi+JYDyc3d9BxD86jNWzpd9\nWeODHJ7eXiAHLNDHldD95fMLv4DyhzD7wT+y4sc79eFtQmx+lYmGibDCJXgI6yd87PdB22f+XJ2R\nI2R9vtCDKDf78jf/lCRvGFv9CrRClL/++ffTLM9V/geIfgIHEixo8CDChAoXMmzo8CHEiBInUqxo\n8SLGjBo3cuzo8SPIkCJHkixp8iTKiQEBADs=\n';\n}\n","language":"Perl"},{"code":"#!/usr/bin/perl\n\nuse strict; # http://www.rosettacode.org/wiki/Matrix_Digital_Rain\nuse warnings;\nuse Tk;\nuse List::Util qw( shuffle );\n\nmy ($rows, $cols) = (20, 40);\nmy @text = shuffle 'a'..'z', 'A'..'Z';\nmy $n = 0;\n\nmy $mw = MainWindow->new;\n$mw->geometry( '+850+300' );\nmy $c = $mw->Canvas( -width => $cols * 10, -height => $rows * 20,\n -bg => 'black',\n )->pack;\n$c->Tk::bind('<ButtonRelease-1>' => sub { $mw->destroy } );\n\nmy @queue = [ 100, 0, 255, 'A' ]; # [ x, y, color, letter ]\n$mw->after( 5, \\&step );\nMainLoop;\n\nsub step\n {\n $c->delete('all');\n my @new = [ 10 * int rand $cols, 0, 255, $text[++$n % @text] ];\n for ( @queue )\n {\n my $color = $_->[2] == 255 ? '#ffffff' : sprintf '#00%02x00', $_->[2];\n $c->createText($_->[0], $_->[1],\n -font => '10x20', -text => $_->[3], -fill => $color );\n $_->[2] == 255 and push @new, [ $_->[0], $_->[1] + 20, 255, $_->[3] ];\n $_->[2] -= 13;\n }\n @queue = grep $_->[2] > 0 && $_->[1] < $rows * 20, @queue, @new;\n $mw->after( 63, \\&step );\n }\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\Matrix_Digital_Rain.exw\n --</span>\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;\">sushii</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span> <span style=\"color: #000080;font-style:italic;\">-- w x h of unicode char strings</span>\n <span style=\"color: #000000;\">colours</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- \"\"\" of their fading colours</span>\n <span style=\"color: #000000;\">droplets</span> <span style=\"color: #000080;font-style:italic;\">-- w column droplets, or zeroes</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;\">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;\">cddbuffer</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">cdcanvas</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">rain</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</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: #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;\">w</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">y</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">droplets</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">y</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">rand</span><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: #008080;\">then</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: #008080;\">then</span>\n <span style=\"color: #000000;\">droplets</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;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">sushii</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;\">x</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">utf32_to_utf8</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">0x30A0</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">96</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #000000;\">colours</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;\">x</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">CD_WHITE</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;\">y</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">clear_droplet</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">colours</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: #004600;\">CD_WHITE</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">colours</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: #0000FF;\">=</span> <span style=\"color: #000000;\">#00F800</span> <span style=\"color: #000080;font-style:italic;\">-- (CD_GREEN to nearest #800)</span>\n <span style=\"color: #000000;\">clear_droplet</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #000000;\">y</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;\">while</span> <span style=\"color: #000000;\">y</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;\">cy</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">colours</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>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">cy</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: #000000;\">clear_droplet</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #000000;\">cy</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">#000800</span>\n <span style=\"color: #000000;\">colours</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: #0000FF;\">=</span> <span style=\"color: #000000;\">cy</span>\n <span style=\"color: #000000;\">y</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;\">if</span> <span style=\"color: #000000;\">clear_droplet</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">droplets</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;\">0</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;\">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: #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: #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: #7060A8;\">cdCanvasGetTextSize</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"W\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">w</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: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">dx</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">h</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: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">dy</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;\">sushii</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">h</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sushii</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])!=</span><span style=\"color: #000000;\">w</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">sushii</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;\">w</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">colours</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: #004600;\">CD_BLACK</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;\">droplets</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;\">w</span><span style=\"color: #0000FF;\">)</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;\">cdCanvasClear</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">rain</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: #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;\">w</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;\">h</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">colours</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: #008080;\">then</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: #000000;\">colours</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>\n <span style=\"color: #7060A8;\">cdCanvasText</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;\">dx</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;\">y</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">dy</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">sushii</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>\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: #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;\">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: #7060A8;\">IupUpdate</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;\">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;\">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: #7060A8;\">IupSetGlobal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"UTF8MODE\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"YES\"</span><span style=\"color: #0000FF;\">)</span>\n\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=640x480\"</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\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;\">50</span><span style=\"color: #0000FF;\">)</span>\n\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=\"Matrix Digital Rain\"`</span><span style=\"color: #0000FF;\">)</span>\n\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: #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":"import curses\nimport random\nimport time\n\n\"\"\"\n\nBased on C ncurses version\n\nhttp://rosettacode.org/wiki/Matrix_Digital_Rain#NCURSES_version\n\n\"\"\"\n\n\"\"\"\nTime between row updates in seconds\nControls the speed of the digital rain effect.\n\"\"\"\n\nROW_DELAY=.0001\n\ndef get_rand_in_range(min, max):\n return random.randrange(min,max+1)\n\ntry:\n # Characters to randomly appear in the rain sequence.\n chars = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']\n\n total_chars = len(chars)\n\n stdscr = curses.initscr()\n curses.noecho()\n curses.curs_set(False)\n\n curses.start_color()\n curses.init_pair(1, curses.COLOR_GREEN, curses.COLOR_BLACK)\n stdscr.attron(curses.color_pair(1))\n\n max_x = curses.COLS - 1\n max_y = curses.LINES - 1\n\n\n # Create arrays of columns based on screen width.\n\n # Array containing the current row of each column.\n\n columns_row = []\n\n # Array containing the active status of each column.\n # A column draws characters on a row when active.\n\n columns_active = []\n\n for i in range(max_x+1):\n columns_row.append(-1)\n columns_active.append(0)\n\n while(True):\n for i in range(max_x):\n if columns_row[i] == -1:\n # If a column is at the top row, pick a\n # random starting row and active status.\n columns_row[i] = get_rand_in_range(0, max_y)\n columns_active[i] = get_rand_in_range(0, 1)\n\n # Loop through columns and draw characters on rows\n\n for i in range(max_x):\n if columns_active[i] == 1:\n # Draw a random character at this column's current row.\n char_index = get_rand_in_range(0, total_chars-1)\n #mvprintw(columns_row[i], i, \"%c\", chars[char_index])\n stdscr.addstr(columns_row[i], i, chars[char_index])\n else:\n # Draw an empty character if the column is inactive.\n #mvprintw(columns_row[i], i, \" \");\n stdscr.addstr(columns_row[i], i, \" \");\n\n\n columns_row[i]+=1\n\n # When a column reaches the bottom row, reset to top.\n if columns_row[i] >= max_y:\n columns_row[i] = -1\n\n # Randomly alternate the column's active status.\n if get_rand_in_range(0, 1000) == 0:\n if columns_active[i] == 0:\n columns_active[i] = 1\n else:\n columns_active[i] = 0\n\n time.sleep(ROW_DELAY)\n stdscr.refresh()\n\nexcept KeyboardInterrupt as err:\n curses.endwin()\n","language":"Python"},{"code":"DECLARE SUB d (p!, s!, x!, y!)\nDIM t(80)\nFOR i = 1 TO 80\n t(i) = INT(-50 * RND)\nNEXT\ns = TIMER\n\nCLS\nWHILE 1\n FOR i = 1 TO 80\n IF t(i) > 28 THEN t(i) = 0\n t(i) = t(i) + 1\n y = t(i)\n d 0, 0, i, y - 6\n d 2, 0, i, y - 5\n d 2, 0, i, y - 4\n d 10, 0, i, y - 3\n d 10, 0, i, y - 2\n d 11, 0, i, y - 1\n d 0, 2, i, y\n NEXT\n\n l = TIMER\n WHILE l = TIMER\n WEND\nWEND\n\nSUB d (p, s, x, y)\n COLOR p, s\n IF y > 0 AND y < 24 THEN LOCATE y, x: PRINT CHR$(33 + (x * y) MOD 200);\nEND SUB\n","language":"QBasic"},{"code":"#lang racket\n\n(define codes '((Α Π) (Ѐ ѵ) (Ҋ ԯ) (Ϣ ϯ) (ｦ ﾝ) (Ⲁ ⳩) (∀ ∗) (℀ ℺) (⨀ ⫿)))\n\n(define (symbol->integer s) (char->integer (string-ref (symbol->string s) 0)))\n(define (pick xs) (list-ref xs (random (length xs))))\n\n(define glyphs\n (map\n integer->char\n (append*\n (for/list ([c (in-list codes)])\n (range (symbol->integer (first c)) (add1 (symbol->integer (second c))))))))\n\n(define palette (vector-append (vector \"\\e[38;2;255;255;255m\")\n (for/vector ([n (in-range 245 29 -10)])\n (format \"\\e[38;2;0;~a;0m\" n))\n (make-vector 75 \"\\e[38;2;0;25;0m\")))\n\n(match-define (list (app (compose1 sub1 string->number) rows)\n (app string->number cols))\n (string-split (with-output-to-string (thunk (system \"stty size\")))))\n\n(define screen (for/vector ([_ (in-range (* rows cols))]) (pick glyphs)))\n(define offsets (for/vector ([col cols]) (random (vector-length palette))))\n\n(display \"\\e[?25l\\e[48;5;232m\") ; hide the cursor, set the background color\n\n(define (main)\n (for ([iter (in-naturals)])\n (sleep 0.1)\n (display \"\\e[1;1H\") ; reset cursor to top left\n (for ([i (in-range 30)]) (vector-set! screen (random (* rows cols)) (pick glyphs)))\n (for ([i (in-range rows)])\n (for ([j (in-range cols)])\n (display (vector-ref palette (modulo (+ (- i) iter (vector-ref offsets j))\n (vector-length palette))))\n (display (vector-ref screen (+ (* cols i) j))))\n (display \"\\n\"))))\n\n(with-handlers ([exn:break? (thunk*\n ; reset ANSI codes, reshow cursor, clear screen\n (display \"\\e[0m\")\n (display \"\\e[H\\e[J\\e[?25h\"))])\n (main))\n","language":"Racket"},{"code":"# clean up on exit, reset ANSI codes, scroll, re-show the cursor & clear screen\nsignal(SIGINT).tap: { print \"\\e[0m\", \"\\n\" xx 50, \"\\e[H\\e[J\\e[?25h\"; exit(0) }\n\n# a list of glyphs to use\nmy @codes = flat 'Α' .. 'Π', 'Ѐ' .. 'ѵ', 'Ҋ' .. 'ԯ', 'Ϣ' .. 'ϯ', 'ｦ'.. 'ﾝ',\n 'Ⲁ' .. '⳩', '∀' .. '∗', '℀' .. '℺', '⨀' .. '⫿';\n\n# palette of gradient ANSI foreground colors\nmy @palette = flat \"\\e[38;2;255;255;255m\", (255,245 … 30).map({\"\\e[38;2;0;$_;0m\"}),\n \"\\e[38;2;0;25;0m\" xx 75;\n\nmy @screen; # buffer to hold glyphs\nmy @rotate; # palette rotation position buffer\n\nmy ($rows, $cols) = qx/stty size/.words; # get the terminal size\ninit($rows, $cols); # set up the screen buffer and palette offsets\n\nmy $size-check;\n\nprint \"\\e[?25l\\e[48;5;232m\"; # hide the cursor, set the background color\n\nloop {\n if ++$size-check %% 20 { # periodically check for\n my ($r, $c) = qx/stty size/.words; # resized terminal and\n init($r, $c) if $r != $rows or $c != $cols; # re-initialize screen buffer\n $size-check = 0\n }\n print \"\\e[1;1H\"; # set cursor to top left\n print join '', (^@screen).map: {\n @rotate[$_] = (@rotate[$_] + 1) % +@palette; # rotate the palettes\n flat @palette[@rotate[$_]], @screen[$_] # and print foreground, glyph\n }\n @screen[(^@screen).pick] = @codes.roll for ^30; # replace some random glyphs\n}\n\nsub init ($r, $c) {\n @screen = @codes.roll($r * $c);\n ($rows, $cols) = $r, $c;\n my @offset = (^@palette).pick xx $cols;\n for ^$rows -> $row {\n @rotate[$row * $cols ..^ $row * $cols + $cols] = @offset;\n # for no \"lightning\" effect, add '1 + ' ↓ here: (1 + $_ % 3)\n @offset = (^@offset).map: {(@offset[$_] - ($_ % 3)) % +@palette};\n }\n}\n","language":"Raku"},{"code":"/*REXX program creates/displays Matrix (the movie) digital rain; favors non-Latin chars.*/\nsignal on halt /*allow the user to halt/stop this pgm.*/\nparse arg pc seed . /*obtain optional arguments from the CL*/\nif pc=='' | pc==\",\" then pc= 20 /*Not specified? Then use the default.*/\nif datatype(seed, 'W') then call random ,,seed /*Numeric? Use seed for repeatability.*/\nparse value scrsize() with sd sw . /*obtain the dimensions of the screen. */\nif sd==0 then sd= 54; sd= sd - 2 + 1 /*Not defined? Then use default; adjust*/\nif sw==0 then sw= 80; sw= sw - 1 /* \" \" \" \" \" \" */\nlowC= c2d(' ') + 1 /*don't use any characters ≤ a blank.*/\n@.= ' ' /*PC is the % new Matric rain streams.*/\ncloud= copies(@., sw) /*the cloud, where matrix rain is born.*/\ncls= 'CLS' /*DOS command used to clear the screen.*/\n do forever; call nimbus /*define bottom of cloud (the drops). */\n call rain /*generate rain, display the raindrops.*/\n end /*j*/\nhalt: exit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nrain: do a=sd by -1 for sd-1; _= a-1; @.a= @._; end; call fogger; return\nshow: cls; @.1= cloud; do r=1 for sd; say strip(@.r, 'T'); end /*r*/; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nnimbus: if random(, 100)<pc then call mist /*should this be a new rain stream ? */\n else call unmist /*should any of the rain streams cease?*/\n return /*note: this subroutine may pass──►MIST*/\n if random(, 100)<pc then return /*should this be a new rain stream ? */\n ?= random(1, sw) /*pick a random rain cloud position. */\n if substr(cloud,?,1)\\==' ' then return /*Is cloud position not a blank? Return*/\n/*───── ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ────────────────────────────────────────────────────*/\nmist: ?= random(1, sw) /*obtain a random column in cloud. */\n if substr(cloud,?,1)\\==' ' then return /*if this stream is active, return. */\n if random(, 100)<pc then return /*should this be a new rain stream ? */\n cloud= overlay(drop(), cloud, ?) /*seed cloud with new matrix rain drop.*/\n return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nunmist: ?= random(1, sw) /*obtain a random column in cloud. */\n if substr(cloud,?,1) ==' ' then return /*if this stream is dry, return. */\n if random(, 100)>pc then return /*should this be a new dry stream ? */\n cloud= overlay(' ', cloud, ?); return /*seed cloud with new matrix rain drop.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ndrop: Lat= random(1, 4) /*Now, chose a matrix rain stream char.*/\n tChr= 254; if Lat==1 then tChr= 127 /*choose the type of rain stream char.*/\n return d2c( random(lowC, tChr) ) /*Lat = 1? This favors Latin letters.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nfogger: do f=1 for sw /*display a screen full of rain streams*/\n if substr(cloud, f, 1) \\== ' ' then cloud= overlay( drop(), cloud, f)\n end /*f*/; call show; return /* [↑] if raindrop, then change drop. */\n","language":"REXX"},{"code":"[package]\nname = \"matrix-digital-rain\"\nversion = \"0.1.0\"\nedition = \"2021\"\n\n[dependencies]\ntermion = \"1.5.6\"\nrand = \"0.8.5\"\n","language":"Rust"},{"code":"#![warn(clippy::pedantic)] // make sure that clippy is even more annoying\n\nuse rand::prelude::{ThreadRng, SliceRandom};\nuse rand::{thread_rng, Rng};\nuse termion::{color::Rgb};\nuse termion::input::TermRead;\nuse termion::raw::IntoRawMode;\nuse std::sync::mpsc::{channel, TryRecvError};\nuse std::thread;\nuse std::{io::{Write, stdout, stdin}, iter::repeat, time::Duration};\n\n/// Character pool to pick from\n/// If your terminal is struggling with that choice, replace them by ordinary latin characters.\n/// There's currently no nicer way to initialize constant array in Rust\nconst CHARS: [char; 322] = [\n 'M', 'Ї', 'Љ', 'Њ', 'Ћ', 'Ќ', 'Ѝ', 'Ў', 'Џ', 'Б', 'Г', 'Д', 'Ж', 'И', 'Й', 'Л', 'П', 'Ф', 'Ц', 'Ч', 'Ш', 'Щ', 'Ъ',\n 'Ы', 'Э', 'Ю', 'Я', 'в', 'д', 'ж', 'з', 'и', 'й', 'к', 'л', 'м', 'н', 'п', 'т', 'ф', 'ц', 'ч', 'ш', 'щ', 'ъ', 'ы',\n 'ь', 'э', 'ю', 'я', 'ѐ', 'ё', 'ђ', 'ѓ', 'є', 'ї', 'љ', 'њ', 'ћ', 'ќ', 'ѝ', 'ў', 'џ', 'Ѣ', 'ѣ', 'ѧ', 'Ѯ', 'ѱ', 'Ѳ',\n 'ѳ', 'ҋ', 'Ҍ', 'ҍ', 'Ҏ', 'ҏ', 'Ґ', 'ґ', 'Ғ', 'ғ', 'Ҕ', 'ҕ', 'Җ', 'җ', 'Ҙ', 'ҙ', 'Қ', 'қ', 'ҝ', 'ҟ', 'ҡ', 'Ң', 'ң',\n 'Ҥ', 'ҥ', 'ҩ', 'Ҫ', 'ҫ', 'Ҭ', 'ҭ', 'Ұ', 'ұ', 'Ҳ', 'ҳ', 'ҵ', 'ҷ', 'ҹ', 'Һ', 'ҿ', 'Ӂ', 'ӂ', 'Ӄ', 'ӄ', 'ӆ', 'Ӈ', 'ӈ',\n 'ӊ', 'Ӌ', 'ӌ', 'ӎ', 'Ӑ', 'ӑ', 'Ӓ', 'ӓ', 'Ӕ', 'ӕ', 'Ӗ', 'ӗ', 'Ә', 'ә', 'Ӛ', 'ӛ', 'Ӝ', 'ӝ', 'Ӟ', 'ӟ', 'ӡ', 'Ӣ', 'ӣ',\n 'Ӥ', 'ӥ', 'Ӧ', 'ӧ', 'Ө', 'ө', 'Ӫ', 'ӫ', 'Ӭ', 'ӭ', 'Ӯ', 'ӯ', 'Ӱ', 'ӱ', 'Ӳ', 'ӳ', 'Ӵ', 'ӵ', 'Ӷ', 'ӷ', 'Ӹ', 'ӹ', 'Ӻ',\n 'ӽ', 'ӿ', 'Ԁ', 'ԍ', 'ԏ', 'Ԑ', 'ԑ', 'ԓ', 'Ԛ', 'ԟ', 'Ԧ', 'ԧ', 'Ϥ', 'ϥ', 'ϫ', 'ϭ', 'ｩ', 'ｪ', 'ｫ', 'ｬ', 'ｭ', 'ｮ', 'ｯ',\n 'ｰ', 'ｱ', 'ｲ', 'ｳ', 'ｴ', 'ｵ', 'ｶ', 'ｷ', 'ｸ', 'ｹ', 'ｺ', 'ｻ', 'ｼ', 'ｽ', 'ｾ', 'ｿ', 'ﾀ', 'ﾁ', 'ﾂ', 'ﾃ', 'ﾄ', 'ﾅ', 'ﾆ',\n 'ﾇ', 'ﾈ', 'ﾉ', 'ﾊ', 'ﾋ', 'ﾌ', 'ﾍ', 'ﾎ', 'ﾏ', 'ﾐ', 'ﾑ', 'ﾒ', 'ﾓ', 'ﾔ', 'ﾕ', 'ﾖ', 'ﾗ', 'ﾘ', 'ﾙ', 'ﾚ', 'ﾛ', 'ﾜ', 'ﾝ',\n 'ⲁ', 'Ⲃ', 'ⲃ', 'Ⲅ', 'Γ', 'Δ', 'Θ', 'Λ', 'Ξ', 'Π', 'Ѐ', 'Ё', 'Ђ', 'Ѓ', 'Є', 'ⲉ', 'Ⲋ', 'ⲋ', 'Ⲍ', 'ⲍ', 'ⲏ', 'ⲑ', 'ⲓ',\n 'ⲕ', 'ⲗ', 'ⲙ', 'ⲛ', 'Ⲝ', 'ⲝ', 'ⲡ', 'ⲧ', 'ⲩ', 'ⲫ', 'ⲭ', 'ⲯ', 'ⳁ', 'Ⳉ', 'ⳉ', 'ⳋ', 'ⳤ', '⳥', '⳦', '⳨', '⳩', '∀', '∁',\n '∂', '∃', '∄', '∅', '∆', '∇', '∈', '∉', '∊', '∋', '∌', '∍', '∎', '∏', '∐', '∑', '∓', 'ℇ', 'ℏ', '℥', 'Ⅎ', 'ℷ', '⩫',\n '⨀', '⨅', '⨆', '⨉', '⨍', '⨎', '⨏', '⨐', '⨑', '⨒', '⨓', '⨔', '⨕', '⨖', '⨗', '⨘', '⨙', '⨚', '⨛', '⨜', '⨝', '⨿', '⩪',\n ];\n\n/// convert a brightness value to a green-ish gradient color\nfn color(brightness: u8) -> Rgb {\n let v = f32::from(brightness) / 255.0;\n let r = v.powi(7);\n let g = v.powi(1);\n let b = v.powi(4);\n // r, g, b will be in 0.0..=1.0 so there's no risk of exceeding the u8's range\n #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]\n Rgb ((r * 255.0).round() as u8, (g * 255.0).round() as u8, (b * 255.0).round() as u8)\n}\n\n/// A single character on the screen with its current brightness\n#[derive(Clone, Copy)]\nstruct Symbol {\n char: char,\n brightness: u8,\n}\n\n/// Start with a black space by default\nimpl Default for Symbol {\n fn default() -> Self {\n Self { char: ' ', brightness: 0 }\n }\n}\n\nimpl Symbol {\n /// output the colored symbol at the current cursor position\n fn print<W: Write>(self, out: &mut W) {\n write!(out, \"{}{}\", termion::color::Fg(color(self.brightness)), self.char).unwrap();\n }\n\n /// reduce the brightness of the symbol by a certain amount and make sure the value doesn't underrun\n fn darken(&mut self) {\n self.brightness = self.brightness.saturating_sub(10);\n }\n\n /// replace the character for this symbol and bring it to full brightness\n fn set(&mut self, char: char) {\n self.char = char;\n self.brightness = 255;\n }\n}\n\n/// a single column of symbols\n#[derive(Clone)]\nstruct Column {\n symbols: Vec<Symbol>,\n}\n\nimpl Column {\n /// create a new column with a given height\n fn new(height: usize) -> Self {\n Self {\n symbols: vec![Symbol::default(); height],\n }\n }\n\n /// print out a single colored symbol of this column\n fn print_symbol<W: Write>(&self, out: &mut W, row: usize) {\n self.symbols[row].print(out);\n }\n\n /// reduce the brightness of the entire column\n fn darken(&mut self) {\n self.symbols.iter_mut().for_each(Symbol::darken);\n }\n\n fn set(&mut self, row: usize, char: char) {\n self.symbols[row].set(char);\n }\n}\n\n/// Current position of a _falling symbol_\nstruct Droplet {\n /// For the start of the animation we want to be able to place the symbol _above_ the screen,\n /// that's we need negative row values as well.\n row: isize,\n col: usize,\n}\n\nimpl Droplet {\n /// create a new Droplet at a random location somewhere above the actual screen\n fn new_random(rng: &mut ThreadRng, width: usize, height: usize) -> Self {\n // the height of the terminal is expected lie within a sane range of this type\n #[allow(clippy::cast_possible_wrap)]\n Self {\n row: -(rng.gen_range(0..height) as isize),\n col: rng.gen_range(0..width),\n }\n }\n\n /// move the droplet down by one row\n /// if it hits the bottom row, move it back up to a random column\n fn update(&mut self, width: usize, height: usize) {\n self.row += 1;\n // the height of the terminal is expected lie within a sane range of this type\n #[allow(clippy::cast_possible_wrap)]\n if self.row >= height as isize {\n let mut rng = thread_rng();\n self.col = rng.gen_range(0..width);\n self.row = 0;\n }\n }\n}\n\n/// The entire screen filled with colored symbols\nstruct Screen {\n width: usize,\n height: usize,\n columns: Vec<Column>,\n droplets: Vec<Droplet>,\n}\n\nimpl Screen {\n\n /// create a new empty screen with the given dimensions\n fn new(width: usize, height: usize) -> Self {\n let mut rng = thread_rng();\n Self {\n width,\n height,\n columns: repeat(Column::new(height)).take(width).collect(),\n droplets: (0..width).map(|_| Droplet::new_random(&mut rng, width, height)).collect(),\n }\n }\n\n /// print the entire screen to the terminal\n fn print<W: Write>(&self, out: &mut W) {\n for row in 0..self.height {\n for column in &self.columns {\n column.print_symbol(out, row);\n }\n write!(out, \"\\r\\n\").unwrap();\n }\n }\n\n // make all droplets fall down by one row\n fn update_droplets(&mut self) {\n let mut rng = thread_rng();\n for droplet in &mut self.droplets {\n droplet.update(self.width, self.height);\n if let Ok(row) = droplet.row.try_into() {\n let ch = CHARS.choose(&mut rng).copied().unwrap_or(' ');\n self.columns[droplet.col].set(row, ch);\n }\n }\n }\n\n // reduce the brightness of all symbols in this screen\n fn darken(&mut self) {\n self.columns.iter_mut().for_each(Column::darken);\n }\n\n}\n\nfn main() {\n // create the screen with the terminal's dimensions (omit the last row to prevent auto-scrolling)\n let (width, height) = termion::terminal_size().unwrap();\n let mut screen = Screen::new(width as usize, height as usize - 1);\n\n // create a channel which allows to send stuff between thread boundaries\n let (tx, rx) = channel();\n\n // spawn a new thread which will blockingly wait for a key to be pressed\n thread::spawn(move || {\n stdin().keys().next();\n // send something down the channel to notify the main thread that a key has been pressed\n tx.send(()).expect(\"Could not send signal on channel.\");\n });\n\n // get write access to the terminal\n let mut stdout = stdout().into_raw_mode().unwrap();\n\n // clear the screen and hide the cursor\n write!(stdout, \"{}{}\", termion::clear::All, termion::cursor::Hide).unwrap();\n\n // continue while no key has been pressed (i.e. the notification channel is empty)\n while rx.try_recv() == Err(TryRecvError::Empty) {\n // move cursor to the top left and set background color to black\n write!(stdout, \"{}{}\", termion::cursor::Goto(1, 1), termion::color::Bg(termion::color::Rgb(0, 0, 0))).unwrap();\n\n // screen update\n screen.print(&mut stdout);\n screen.darken();\n screen.update_droplets();\n // make sure the terminal updates _now_\n stdout.flush().unwrap();\n\n // slow down animation\n std::thread::sleep(Duration::from_millis(50));\n }\n\n // reset Terminal back to normal\n write!(stdout, \"{}\", termion::style::Reset).unwrap();\n write!(stdout, \"{}\", termion::clear::All).unwrap();\n write!(stdout, \"{}\", termion::cursor::Goto(1, 1)).unwrap();\n write!(stdout, \"{}\", termion::cursor::Show).unwrap();\n}\n","language":"Rust"},{"code":"SUB d (p,s,x,y)\n SET COLOR p\n SET BACKGROUND COLOR s\n\n IF y > 0 AND y < 24 THEN\n SET CURSOR y, x\n PRINT CHR$(33+REMAINDER((x*y),200));\n END IF\nEND SUB\n\nDIM t(80)\nFOR i = 1 TO 80\n LET t(i) = INT(-50*RND)\nNEXT i\nLET s = TIME\n\nCLEAR\nDO\n FOR i = 1 TO 80\n IF t(i) > 28 THEN LET t(i) = 0\n LET t(i) = t(i)+1\n LET y = t(i)\n CALL d (0, 0, i, y-6)\n CALL d (2, 0, i, y-5)\n CALL d (2, 0, i, y-4)\n CALL d (10, 0, i, y-2)\n CALL d (11, 0, i, y-1)\n CALL d (0, 2, i, y)\n NEXT i\n LET l = TIME\n DO WHILE l = TIME\n LOOP\nLOOP\nEND\n","language":"True-BASIC"},{"code":"import \"dome\" for Window\nimport \"graphics\" for Canvas, Color, Font\nimport \"random\" for Random\n\nvar Rand = Random.new()\n\nclass MatrixDigitalRain {\n construct new(width, height) {\n Window.resize(width, height)\n Canvas.resize(width, height)\n Window.title = \"Matrix digital rain\"\n Font.load(\"Mem12\", \"memory.ttf\", 24)\n Canvas.font = \"Mem12\"\n }\n\n letter(x, y, r, g, b) {\n if (y < 0 || y >= _my) return\n var col = Color.rgb(r, g, b)\n var c = String.fromByte(_scr[x][y])\n Canvas.print(c, x * 12.8 , y * 12.8 , col)\n }\n\n init() {\n _mx = 50\n _my = 42\n _scr = List.filled(_mx, null)\n for (x in 0..._mx) {\n _scr[x] = List.filled(_my, 0)\n for (y in 0..._my) _scr[x][y] = Rand.int(33, 128)\n }\n _ms = 50\n _sx = List.filled(_ms, 0)\n _sy = List.filled(_ms, 0)\n }\n\n update() {\n for (a in 0..._ms) {\n _sx[a] = Rand.int(_mx)\n _sy[a] = Rand.int(_my)\n }\n }\n\n draw(alpha) {\n for (s in 0..._ms) {\n var x = _sx[s]\n var y = _sy[s]\n letter(x, y, 0, 255, 0)\n y = y - 1\n letter(x, y, 0, 200, 0)\n y = y - 1\n letter(x, y, 0, 150, 0)\n y = y - 1\n if (y*12.8 + 3 < 0) y = 0\n var c = Color.rgb(0, 0, 0)\n Canvas.rectfill(x*12.8, y*12.8 + 3, 13, 14, c)\n letter(x, y, 0, 70, 0)\n y = y - 24\n if (y*12.8 + 3 < 0) y = 0\n Canvas.rectfill(x*12.8, y*12.8 + 3, 13, 14, c)\n }\n for (s in 0..._ms) {\n if (Rand.int(1, 6) == 1) _sy[s] = _sy[s] + 1\n if (_sy[s] > _my + 25) {\n _sy[s] = 0\n _sx[s] = Rand.int(_mx)\n }\n }\n }\n}\n\nvar Game = MatrixDigitalRain.new(640, 550)\n","language":"Wren"},{"code":"open window 640,512,\"swiss12\"\nbackcolor 0,0,0\nclear window\nmx=50\nmy=42\ndim scr(mx,my)\nfor y=0 to my\n for x=0 to mx\n scr(x,y)=int(ran(96)+33)\n next x\nnext y\nms=50\ndim sx(ms)\ndim sy(ms)\nfor a=1 to ms\n sx(a)=int(ran(mx))\n sy(a)=int(ran(my))\nnext a\ndo\n for s=1 to ms\n x=sx(s)\n y=sy(s)\n\n letter(0,255,0)\n y=y-1\n\n letter(0,200,0)\n y=y-1\n\n letter(0,150,0)\n y=y-1\n\n color 0,0,0\n fill rect x*12.8-1,y*12.8+4 to x*12.8+12,y*12.8-10\n letter(0,70,0)\n y=y-24\n\n color 0,0,0\n fill rect x*12.8-1,y*12.8+4 to x*12.8+12,y*12.8-10\n next s\n for s=1 to ms\n if int(ran(5)+1)=1 sy(s)=sy(s)+1\n if sy(s)>my+25 then\n sy(s)=0\n sx(s)=int(ran(mx))\n end if\n next s\nloop\n\nsub letter(r,g,b)\n if y<0 or y>my return\n c=scr(x,y)\n color r,g,b\n text x*12.8,y*12.8,chr$(c)\nend sub\n","language":"Yabasic"},{"code":"var [const] codes=Walker.chain( // a bunch of UTF non ascii chars\n [0x0391..0x03a0], [0x03a3..0x0475], [0x0400..0x0475],\n [0x048a..0x052f], [0x03e2..0x03ef], [0x2c80..0x2ce9],\n [0x2200..0x2217], [0x2100..0x213a], [0x2a00..0x2aff])\n\t .apply(fcn(utf){ utf.toString(-8) }), // jeez this is lame\n codeSz=codes.len(),\t// 970\n c=L(\"\\e[38;2;255;255;255m\",[255..30,-15].apply(\"\\e[38;2;0;%d;0m\".fmt),\n (250).pump(List,T(Void,\"\\e[38;2;0;25;0m\"))).flatten(),\n csz=c.len(); // 267, c is ANSI escape code fg colors: 38;2;<r;g;b>m\n\n// query the ANSI terminal\nrows,cols := System.popen(\"stty size\",\"r\").readln().split().apply(\"toInt\");\n\no,s,fg := buildScreen(rows,cols);\nssz:=s.len();\n\nprint(\"\\e[?25l\\e[48;5;232m\"); // hide the cursor, set background color to dark\nwhile(1){\t\t // ignore screen resizes\n print(\"\\e[1;1H\");\t // move cursor to 1,1\n foreach n in (ssz){\t // print a screen full\n print( c[fg[n]], s[n] ); // forground color, character\n fg[n]=(fg[n] + 1)%csz; // fade to black\n }\n do(100){ s[(0).random(ssz)]=codes[(0).random(codeSz)] } // some new chars\n Atomic.sleep(0.1);\t // frame rate for my system, up to 200x41 terminal\n}\n\nfcn buildScreen(rows,cols){ // build a row major array as list\n // s --> screen full of characters\n s:=(rows*cols).pump(List(), fcn{ codes[(0).random(codeSz)]});\n // array fb-->( fg color, fg ..) where fg is an ANSI term 48;5;<n>m color\n fg:=List.createLong(s.len(),0);\n o:=csz.pump(List()).shuffle()[0,cols]; // cols random #s\n foreach row in (rows){\t\t // set fg indices\n foreach col in (cols){ fg[row*cols + col] = o[col] }\n o=o.apply(fcn(n){ n-=1; if(n<0) n=csz-1; n%csz }); // fade out\n }\n return(o,s,fg);\n}\n","language":"Zkl"},{"code":"10 CLEAR 61999\n20 BORDER 0: POKE 23624,4: POKE 23693,0: CLS: REM easier than \"bright 0: flash 0: ink 0: paper 0\"\n30 PRINT INK 4; FLASH 1;\"Initialising\": GO SUB 9000: LET m=USR 62000: CLS: REM set up and run machine code; USR is the call function\n40 DIM s(32,2): REM current top and bottom of character sequence for each of the 32 spaces across the screen\n\n50 FOR x=1 TO 32: REM main loop\n60 IF s(x,1)=0 AND RND>.95 THEN LET s(x,1)=1: LET s(x,2)=2: GO SUB 4000: GO SUB 3000: GO TO 80: REM start a new column; decrease the .95 modifier for a busier - but slower - screen\n70 IF s(x,2)>0 THEN GO SUB 1000\n80 NEXT x\n90 FOR l=1 TO 10: REM matrix code switches existing glyphs occasionally\n100 LET x=INT (RND*22): LET y=INT (RND*32)\n110 IF PEEK (22528+32*x+y)=0 THEN GO TO 140: REM no point updating a blank space\n120 GO SUB 4000\n130 PRINT AT x,y; INK 8; BRIGHT 8;CHR$ (33+RND*95): REM ink 8 and bright 8 tells it to keep the cell's existing ink and bright values\n140 NEXT l\n150 GO TO 50\n\n999 REM continue an existing column\n1000 LET s(x,2)=s(x,2)+1\n1010 IF s(x,2)<21 THEN GO SUB 3000\n1020 IF s(x,2)>12 THEN LET s(x,1)=s(x,1)+1\n1030 LET k=2\n1040 GO SUB 2000\n1050 LET k=6\n1060 GO SUB 2000\n1070 LET k=12\n1080 GO SUB 2000\n1090 IF s(x,1)=22 THEN LET s(x,1)=0: LET s(x,2)=0\n1100 RETURN\n\n1999 REM update colour\n2000 LET a=22527+x+32*(s(x,2)-k)\n2010 LET c=PEEK a\n2020 IF c=4 THEN POKE a,0\n2030 IF c=68 THEN POKE a,4\n2040 IF c=71 THEN POKE a,68: REM this poke could be done with 'print at s(x,2)-k-1,x-1; ink 4; bright 1; over 1; \" \" ' but poking is FAR easier, especially considering the above pokes would be similar\n2050 RETURN\n\n2999 REM new character at bottom of column\n3000 PRINT AT s(x,2)-1,x-1; INK 7; BRIGHT 1;CHR$ (33+RND*95)\n3010 RETURN\n\n3999 REM select character set\n4000 POKE 23607,242+3*INT (RND*4): REM the spectrum character set is pointed to by the two-byte system value CHARS at 23606 and 23607, so repoking this selects a new character set - the machine code below has created four copies of the character set at suitable locations\n4010 RETURN\n\n8999 REM machine code routine to create multiple character sets\n9000 RESTORE 9800\n9010 LET h$=\"0123456789ABCDEF\"\n9020 LET o=62000\n9030 IF PEEK o=33 AND PEEK 62121=201 THEN RETURN: REM saves storing it all again if the machine code is already there\n9040 READ a$\n9050 IF a$=\"eof\" THEN RETURN\n9060 FOR x=1 TO 8\n9070 LET n=0\n9080 LET s=(x*2)-1\n9090 LET t=s+1\n9100 FOR m=1 TO 16\n9110 IF h$(m)=a$(s) THEN LET n=n+16*(m-1)\n9120 IF h$(m)=a$(t) THEN LET n=n+m-1\n9130 NEXT m\n9140 POKE o,n\n9150 LET o=o+1\n9160 NEXT x\n9170 GO TO 9040\n\n9800 DATA \"21003D1100F30100\"\n9810 DATA \"03EDB02100F31100\"\n9820 DATA \"F6010009EDB01100\"\n9830 DATA \"F901FF051A6F0707\"\n9840 DATA \"ADE6AAAD6F070707\"\n9850 DATA \"CB0DADE666AD1213\"\n9860 DATA \"0B78B120E721FFF5\"\n9870 DATA \"010000E5CD8BF2E1\"\n9880 DATA \"E5CD8BF2E1E5CD8B\"\n9890 DATA \"F2E1CD8BF2232323\"\n9900 DATA \"23AF470C79FEC0C2\"\n9910 DATA \"6BF2C9E5D1043E09\"\n9920 DATA \"90835F8A93577885\"\n9930 DATA \"6F8C95671AE521AA\"\n9940 DATA \"F277E17E123AAAF2\"\n9950 DATA \"77C9000000000000\"\n9960 DATA \"eof\"\n\n9999 POKE 23606,0: POKE 23607,60: INK 4: REM reset to default character set and colour if you get lost\n","language":"ZX-Spectrum-Basic"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Matrix_digital_rain\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Implement the Matrix Digital Rain visual effect from the movie \\\"The Matrix\\\" as described in [[wp:Matrix_digital_rain|Wikipedia]].\\n\\nProvided is a reference implementation in Common Lisp to be run in a terminal.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\nwith Ada.Numerics.Discrete_Random;\\nwith Ada.Strings.Fixed;\\n\\nprocedure Digital_Rain is\\n type Column_Type is range 0 .. 150;\\n type Row_Type is range 0 .. 25;\\n type Character_Range is new Character range 'A' .. 'Z';\\n subtype Delay_Range is Integer range 2 .. 6;\\n\\n package Column_Random is new Ada.Numerics.Discrete_Random (Column_Type);\\n package Row_Random is new Ada.Numerics.Discrete_Random (Row_Type);\\n package Character_Random is new Ada.Numerics.Discrete_Random (Character_Range);\\n package Delay_Random is new Ada.Numerics.Discrete_Random (Delay_Range);\\n\\n Column_Generator : Column_Random.Generator;\\n Row_Generator : Row_Random.Generator;\\n Character_Generator : Character_Random.Generator;\\n Delay_Generator : Delay_Random.Generator;\\n\\n Esc : constant Character := Character'Val (8#33#);\\n Running : Boolean := True;\\n Char : Character;\\n use Ada.Text_IO;\\n\\n protected Text_Out is\\n procedure Put_At (Row : Row_Type; Col : Column_Type;\\n Color : Integer; Item : Character);\\n end Text_Out;\\n\\n protected body Text_Out is\\n procedure Put_At (Row : Row_Type; Col : Column_Type;\\n Color : Integer; Item : Character)\\n is\\n use Ada.Strings;\\n begin\\n Put (Esc & \\\"[\\\" &\\n Fixed.Trim (Row'Image, Left) & \\\";\\\" &\\n Fixed.Trim (Col'Image, Left) & \\\"H\\\"); -- Place Cursor\\n Put (Esc & \\\"[\\\" & Fixed.Trim (Color'Image, Left) & \\\"m\\\"); -- Foreground color\\n Put (Item);\\n end Put_At;\\n end Text_Out;\\n\\n task type Rainer;\\n\\n task body Rainer is\\n Row : Row_Type;\\n Col : Column_Type;\\n Del : Delay_Range;\\n begin\\n Outer_Loop:\\n loop\\n Col := Column_Random.Random (Column_Generator);\\n Row := Row_Random.Random (Row_Generator);\\n for Rain in reverse Boolean loop\\n Del := Delay_Random.Random (Delay_Generator);\\n for R in 0 .. Row loop\\n if Rain then\\n if R in 1 .. Row then\\n Text_Out.Put_At (R - 1, Col, Color => 32, Item => Char);\\n end if;\\n Char := Character (Character_Random.Random (Character_Generator));\\n if R in 0 .. Row - 1 then\\n Text_Out.Put_At (R, Col, Color => 97, Item => Char);\\n end if;\\n else\\n Text_Out.Put_At (R, Col, Color => 30, Item => ' ');\\n end if;\\n delay 0.020 * Del;\\n exit Outer_Loop when not Running;\\n end loop;\\n end loop;\\n end loop Outer_Loop;\\n end Rainer;\\n\\n Dummy : Character;\\n Rainers : array (1 .. 50) of Rainer;\\nbegin\\n Put (ESC & \\\"[?25l\\\"); -- Hide the cursor\\n Put (ESC & \\\"[40m\\\"); -- Black background\\n Put (ESC & \\\"[2J\\\"); -- Clear Terminal\\n\\n Get_Immediate (Dummy);\\n Running := False;\\n delay 0.200;\\n\\n Put (ESC & \\\"[?25h\\\"); -- Restore the cursor\\n Put (ESC & \\\"[0;0H\\\"); -- Place cursor\\n Put (ESC & \\\"[39m\\\"); -- Default foreground\\n Put (ESC & \\\"[49m\\\"); -- Default backgound\\n Put (ESC & \\\"[2J\\\"); -- Clear Terminal\\nend Digital_Rain;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"#include <basico.h>\\n\\n#proto desplegarmatrixrain(_X_,_Y_,_Z_,_W_)\\n\\nalgoritmo\\n\\n permitir interrupción\\n\\n dimensionar (80) matriz aleatoria entera ( -50, t )\\n\\n y=0\\n\\n color(232,232)\\n borrar pantalla\\n\\n enfatizado\\n\\n iterar\\n\\n iterar para(i=1, #(i<=80), ++i )\\n cuando ( #(t[i]>50) ){ #(t[i]=0) }\\n #basic{\\n t[i] += 1\\n y = t[i]\\n desplegar matrix rain(232,232,i,(y-10))\\n desplegar matrix rain(22,232,i,(y-9))\\n desplegar matrix rain(22,232,i,(y-8))\\n desplegar matrix rain(22,232,i,(y-7))\\n desplegar matrix rain(28,232,i,(y-6))\\n desplegar matrix rain(28,232,i,(y-5))\\n desplegar matrix rain(34,232,i,(y-4))\\n desplegar matrix rain(34,232,i,(y-3))\\n desplegar matrix rain(40,232,i,(y-2))\\n desplegar matrix rain(46,232,i,(y-1))\\n desplegar matrix rain(232,40,i,y)\\n }\\n siguiente\\n\\n microsegundos(5000)\\n hasta que una tecla sea presionada\\n\\n color(7,0)\\n borrar pantalla\\nterminar\\n\\nsubrutinas\\n\\ndesplegar matrix rain(p,s,x,y)\\n\\n si ( y, está entre-excluyendo-(0,41) )\\n color (p,s)\\n imprimir en ( y,x, #(utf8(chr(33+((x*y) % 200)) )) )\\n fin si\\n\\nretornar\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"#include <basico.h>\\n\\n#proto desplegarmatrixrain(_X_,_Y_)\\n\\nalgoritmo\\n\\n dimensionar con (80) matriz aleatoria entera ( -50, t )\\n matrices (ctexto, cfondo)\\n '232,22,22,22,22,28,28,28,34,34,40,40,46,232' enlistar en 'ctexto'\\n '232,232,232,232,232,232,232,232,232,232,232,232,232,40' enlistar en 'cfondo'\\n\\n color(232,232)\\n borrar pantalla\\n\\n enfatizado\\n\\n iterar\\n\\n iterar para(i=1, #(i<=80), ++i )\\n cuando ( #(t[i]>53) ){ #(t[i]=rand(-50)) }\\n #basic{\\n t[i] += 1\\n desplegar matrix rain(i,t[i])\\n }\\n siguiente\\n\\n microsegundos(50000)\\n\\n hasta que una tecla sea presionada\\n\\n color(7,0)\\n borrar pantalla\\nterminar\\n\\nsubrutinas\\n\\ndesplegar matrix rain(x,y)\\n i=13, j=1\\n iterar\\n si ( #(y-i), está entre-excluyendo-(0,41) )\\n color ( #(ctexto[j]), #(cfondo[j]) )\\n imprimir en ( #(y-i),x, #(utf8(chr(33+((x*(y-i)) % 200)) )) )\\n fin si\\n --i, ++j\\n mientras ' no es negativo(i)'\\nretornar\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \":: Matrix Digital Rain Task from RosettaCode\\n:: Batch File Implementation\\n\\n@echo off\\nsetlocal enabledelayedexpansion\\n\\nrem escape character (for Windows 10 VT100 escape sequences)\\nrem info: https://docs.microsoft.com/en-us/windows/console/console-virtual-terminal-sequences\\nfor /f %%e in ('echo prompt $e^| cmd') do @set \\\"esc=%%e\\\"\\n\\nrem set window size\\nset \\\"col=120\\\" %== please don't make this too large ==%\\nset \\\"row=30\\\" %== please don't make this too large ==%\\nmode con cols=%col% lines=%row%\\n\\nrem set up the variables for display\\nset \\\"rain_length=12\\\"\\nfor /l %%y in (1,1,%col%) do set \\\"disp_col[%%y]= \\\" %== what to display ==%\\nfor /l %%y in (1,1,%col%) do set \\\"ctr_col[%%y]=0\\\" %== counter for rain length ==%\\n\\nrem hide the cursor, and clear the screen\\n<nul set /p \\\"=%esc%[?25l\\\"\\ncls\\n\\n:matrix_loop\\nfor /l %%y in (1,1,%col%) do (\\n if !ctr_col[%%y]! equ 0 (\\n set \\\"disp_col[%%y]= \\\"\\n ) else (\\n set /a \\\"rnd_digit=!random! %% 10\\\"\\n if !ctr_col[%%y]! equ 1 (\\n set \\\"disp_col[%%y]=%esc%[97m!rnd_digit!%esc%[32m\\\"\\n ) else if !ctr_col[%%y]! equ 2 (\\n set \\\"disp_col[%%y]=%esc%[92m!rnd_digit!%esc%[32m\\\"\\n ) else (\\n set \\\"disp_col[%%y]=!rnd_digit!\\\"\\n )\\n set /a \\\"ctr_col[%%y]=(!ctr_col[%%y]! + 1) %% (%rain_length% + 1)\\\"\\n )\\n rem drop rain randomly\\n set /a \\\"rnd_drop=!random! %% 20\\\"\\n if !rnd_drop! equ 0 set \\\"ctr_col[%%y]=1\\\"\\n)\\nset \\\"disp_line=%esc%[32m\\\"\\nfor /l %%y in (1,1,%col%) do set \\\"disp_line=!disp_line!!disp_col[%%y]!\\\"\\n<nul set /p \\\"=%esc%[1T%esc%[1;1H\\\" %== scroll down and set cursor position to home ==%\\necho(%disp_line%\\ngoto matrix_loop\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \"/**\\n * Loosely emulates the \\\"digital rain\\\" effect from The Matrix.\\n *\\n * @author Dan Ruscoe <dan@ruscoe.org>\\n */\\n#include <unistd.h>\\n#include <time.h>\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <ncurses.h>\\n\\n/* Time between row updates in microseconds.\\n Controls the speed of the digital rain effect.\\n*/\\n#define ROW_DELAY 40000\\n\\n/**\\n * Gets a random integer within a given range.\\n *\\n * @param int min The low-end of the range.\\n * @param int max The high-end of the range.\\n *\\n * @return int The random integer.\\n */\\nint get_rand_in_range(int min, int max)\\n{\\n return (rand() % ((max + 1) - min) + min);\\n}\\n\\nint main(void)\\n{\\n /* Basic seed for random numbers. */\\n srand(time(NULL));\\n\\n /* Characters to randomly appear in the rain sequence. */\\n char chars[] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};\\n\\n int total_chars = sizeof(chars);\\n\\n /* Set up ncurses screen and colors. */\\n initscr();\\n noecho();\\n curs_set(FALSE);\\n\\n start_color();\\n init_pair(1, COLOR_GREEN, COLOR_BLACK);\\n attron(COLOR_PAIR(1));\\n\\n int max_x = 0, max_y = 0;\\n\\n getmaxyx(stdscr, max_y, max_x);\\n\\n /* Create arrays of columns based on screen width. */\\n\\n /* Array containing the current row of each column. */\\n int columns_row[max_x];\\n\\n /* Array containing the active status of each column.\\n A column draws characters on a row when active.\\n */\\n int columns_active[max_x];\\n\\n int i;\\n\\n /* Set top row as current row for all columns. */\\n for (i = 0; i < max_x; i++)\\n {\\n columns_row[i] = -1;\\n columns_active[i] = 0;\\n }\\n\\n while (1)\\n {\\n for (i = 0; i < max_x; i++)\\n {\\n if (columns_row[i] == -1)\\n {\\n /* If a column is at the top row, pick a\\n random starting row and active status.\\n */\\n columns_row[i] = get_rand_in_range(0, max_y);\\n columns_active[i] = get_rand_in_range(0, 1);\\n }\\n }\\n\\n /* Loop through columns and draw characters on rows. */\\n for (i = 0; i < max_x; i++)\\n {\\n if (columns_active[i] == 1)\\n {\\n /* Draw a random character at this column's current row. */\\n int char_index = get_rand_in_range(0, total_chars);\\n mvprintw(columns_row[i], i, \\\"%c\\\", chars[char_index]);\\n }\\n else\\n {\\n /* Draw an empty character if the column is inactive. */\\n mvprintw(columns_row[i], i, \\\" \\\");\\n }\\n\\n columns_row[i]++;\\n\\n /* When a column reaches the bottom row, reset to top. */\\n if (columns_row[i] >= max_y)\\n {\\n columns_row[i] = -1;\\n }\\n\\n /* Randomly alternate the column's active status. */\\n if (get_rand_in_range(0, 1000) == 0)\\n {\\n columns_active[i] = (columns_active[i] == 0) ? 1 : 0;\\n }\\n }\\n\\n usleep(ROW_DELAY);\\n refresh();\\n }\\n\\n endwin();\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"/*******************************************************************************\\n*\\n* Digital ASCII rain - the single thread variant.\\n* 2012 (C) by Author, 2020 GPL licensed for RossetaCode\\n*\\n*******************************************************************************/\\n\\n#include <assert.h> /* assertions */\\n#include <conio.h> /* console operations */\\n#include <locale.h> /* l10n and i18n */\\n#include <string.h> /* operations on strings and memory blocks */\\n#include <process.h> /* Microsoft Windows API for threads etc. */\\n#include <stdio.h> /* standard i/o library */\\n#include <stdlib.h> /* standard library with rand() function */\\n#include <time.h> /* time(NULL) used as srand(time(NULL)) */\\n#include <windows.h> /* just the Microsoft Windows main header for C */\\n\\n\\n/*\\n * Global variables - you could use local variables instead...\\n * but then e.g. the memory for the buffer variable would be unnecessarily\\n * allocated and released manifold, which would lead to a worse performance.\\n */\\n\\nHANDLE hStdOut; /* the handle to console \\\"out\\\" */\\nCONSOLE_SCREEN_BUFFER_INFO csbi; /* numbers of rows, columns etc. */\\n\\nPCHAR_INFO buffer = NULL; /* an enough big buffer */\\nCOORD bufferSize, bufferCoord; /* the size of buffer etc. */\\n\\n\\n/*\\n * A structure that holds data that is distinct for each column.\\n */\\nstruct Data\\n{\\n DWORD armed; /* time in ms to synchronize */\\n int delay; /* armed = current_time + delay */\\n BOOL show; /* TRUE - draw, FALSE - erase */\\n COORD ncp; /* position for drawing new characters */\\n SMALL_RECT s, d; /* source/destination regions for copy */\\n};\\n\\n/*\\n * A function to generate random numbers from the range (a, b).\\n * NOTE: POSIX rand () is not thread safe,\\n * but we use secure rand() from MS runtime libraries.\\n */\\n\\nint rnd(int a, int b)\\n{\\n return a + rand() % (b + 1 - a);\\n}\\n\\nBOOL randomShow(void)\\n{\\n return rnd(0, 99) < 65;\\n}\\n\\nint randomDelay(void)\\n{\\n return rnd(0, 150) + rnd(0, 150) + rnd(0, 150);\\n}\\n\\nBOOL randomRegenerate(void)\\n{\\n return rnd(0, 99) < 2;\\n}\\n\\nvoid column_init(struct Data* data, int k)\\n{\\n data->armed = 0;\\n data->show = randomShow();\\n data->delay = randomDelay();\\n\\n data->s.Left = k;\\n data->s.Top = 0;\\n data->s.Bottom = bufferSize.Y - 2;\\n data->s.Right = k;\\n\\n data->d.Left = data->s.Left;\\n data->d.Top = data->s.Top + 1;\\n data->d.Right = data->s.Right;\\n data->d.Bottom = data->s.Bottom + 1;\\n\\n data->ncp.X = k;\\n data->ncp.Y = 0;\\n}\\n\\n\\nvoid column_run(struct Data* data)\\n{\\n char c;\\n WORD a;\\n DWORD result;\\n\\n /*\\n * Shift down a column.\\n */\\n ReadConsoleOutput (hStdOut, buffer, bufferSize, bufferCoord, &data->s);\\n WriteConsoleOutput(hStdOut, buffer, bufferSize, bufferCoord, &data->d);\\n\\n /*\\n * If show == TRUE then generate a new character.\\n * If show == FALSE write the space to erase.\\n */\\n if(data->show)\\n {\\n c = (rnd(1,100) <= 15) ? ' ' : rnd( 'a', 'z' );\\n a = FOREGROUND_GREEN | ((rnd(1,100) > 10) ? 0 : FOREGROUND_INTENSITY);\\n }\\n else\\n {\\n c = ' ';\\n a = FOREGROUND_GREEN;\\n }\\n\\n WriteConsoleOutputCharacter(hStdOut, &c, 1, data->ncp, &result);\\n WriteConsoleOutputAttribute(hStdOut, &a, 1, data->ncp, &result);\\n\\n /*\\n * Randomly regenerate the delay and the visibility state of the column.\\n */\\n if(randomRegenerate()) data->show = randomShow();\\n if(randomRegenerate()) data->delay = randomDelay();\\n\\n data->armed = GetTickCount() + data->delay;\\n}\\n\\n\\nint main(int argc, char* argv[])\\n{\\n int j;\\n struct Data* table;\\n\\n srand((unsigned int)time(NULL));\\n\\n hStdOut = GetStdHandle( STD_OUTPUT_HANDLE );\\n SetConsoleTitle(\\\"Digital ASCII rain\\\");\\n\\n /*\\n * An attempt to run in the full-screen mode.\\n */\\n if(argc == 1)\\n {\\n COORD coord;\\n CONSOLE_CURSOR_INFO cci;\\n cci.bVisible = FALSE;\\n cci.dwSize = 0;\\n SetConsoleDisplayMode(hStdOut, CONSOLE_FULLSCREEN_MODE, &coord);\\n SetConsoleCursorInfo(hStdOut, &cci);\\n }\\n\\n GetConsoleScreenBufferInfo(hStdOut, &csbi );\\n //SetConsoleTextAttribute(hStdOut, FOREGROUND_GREEN);\\n\\n bufferSize.X = 1;\\n bufferSize.Y = csbi.dwSize.Y - 1;\\n bufferCoord.X = 0;\\n bufferCoord.Y = 0;\\n buffer = (PCHAR_INFO)calloc(bufferSize.Y, sizeof(CHAR_INFO));\\n assert(buffer != NULL);\\n\\n table = (struct Data*)calloc(csbi.dwSize.X, sizeof(struct Data));\\n assert(table != NULL);\\n\\n for(j = 0; j < csbi.dwSize.X; j++) column_init(&table[j], j);\\n\\n /*\\n * Main loop. Sleep(1) significally decreases the CPU load.\\n */\\n\\n while(!_kbhit())\\n {\\n DWORD t = GetTickCount();\\n for(j = 0; j < csbi.dwSize.X; j++)\\n if(table[j].armed < t) column_run(&table[j]);\\n Sleep(1);\\n }\\n\\n free(table);\\n free(buffer);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"/*******************************************************************************\\n*\\n* Digital ASCII rain - multithreaded.\\n* 2012 (C) by Author, 2020 GPL licensed for RossetaCode\\n*\\n*******************************************************************************/\\n\\n#include <assert.h> /* assertions */\\n#include <conio.h> /* console operations */\\n#include <locale.h> /* l10n and i18n */\\n#include <string.h> /* operations on strings and memory blocks */\\n#include <process.h> /* Microsoft Windows API for threads etc. */\\n#include <stdio.h> /* standard i/o library */\\n#include <stdlib.h> /* standard library with rand() function */\\n#include <time.h> /* time(NULL) used as srand(time(NULL)) */\\n#include <windows.h> /* just the Microsoft Windows main header for C */\\n\\n\\n//#define SYNCHRONIZED_INIT\\n\\n\\n/*\\n * Global variables, common for all threads.\\n * The handle eventThreadInitialized is to synchronize threads initializations.\\n */\\n#ifdef SYNCHRONIZED_INIT\\nHANDLE eventThreadInitialized;\\n#endif\\n\\nBOOL loop = TRUE; /* FALSE - przerwać działanie */\\nHANDLE hStdOut; /* uchwyt do konsoli \\\"out\\\" */\\nCONSOLE_SCREEN_BUFFER_INFO csbi; /* liczby wierszy i kolumn itd.*/\\n\\n\\nstruct InitThreadData\\n{\\n int column;\\n unsigned seed;\\n};\\n\\n\\n/*\\n * A function to generate random numbers from the range (a, b).\\n * NOTE: POSIX rand () is not thread safe,\\n * but we use secure rand() from MS runtime libraries.\\n */\\n\\nint rnd(int a, int b)\\n{\\n return a + rand() % (b + 1 - a);\\n}\\n\\nBOOL randomShow(void)\\n{\\n return rnd(0, 99) < 65;\\n}\\n\\nint randomDelay(void)\\n{\\n return rnd(0,150) + rnd(0,150) + rnd(0,150);\\n}\\n\\nBOOL randomRegenerate(void)\\n{\\n return rnd(0,99) < 2;\\n}\\n\\n\\n/*\\n * Update a single column.\\n */\\nvoid one_column(void *arg)\\n{\\n BOOL show;\\n int k;\\n char c;\\n WORD a;\\n int delay;\\n PCHAR_INFO buffer;\\n COORD bufferSize, bufferCoord, newCharPosition;\\n SMALL_RECT s, d;\\n DWORD result;\\n\\n /*\\n * Retrieve the column number, initialize the (pseudo)random numbers\\n * generator with a \\\"private\\\" seed, check assertions.\\n */\\n k = ((struct InitThreadData*)arg)->column;\\n srand(((struct InitThreadData*)arg)->seed);\\n assert(csbi.dwSize.X != 0 && csbi.dwSize.Y != 0);\\n assert(0 <= k && k <= csbi.dwSize.X);\\n\\n show = randomShow();\\n delay = randomDelay();\\n\\n bufferSize.X = 1;\\n bufferSize.Y = csbi.dwSize.Y - 1;\\n bufferCoord.X = 0;\\n bufferCoord.Y = 0;\\n\\n buffer = (PCHAR_INFO)malloc(bufferSize.Y * sizeof(CHAR_INFO));\\n assert( buffer != NULL );\\n\\n s.Left = k;\\n s.Top = 0;\\n s.Bottom = bufferSize.Y - 2;\\n s.Right = k;\\n\\n d.Left = s.Left;\\n d.Top = s.Top + 1;\\n d.Right = s.Right;\\n d.Bottom = s.Bottom + 1;\\n\\n newCharPosition.X = k;\\n newCharPosition.Y = 0;\\n\\n#ifdef SYNCHRONIZED_INIT\\n SetEvent(eventThreadInitialized);\\n#endif\\n\\n /*\\n * Main loop inside this one thread.\\n */\\n while(loop)\\n {\\n ReadConsoleOutput ( hStdOut, buffer, bufferSize, bufferCoord, &s);\\n WriteConsoleOutput( hStdOut, buffer, bufferSize, bufferCoord, &d);\\n\\n if(show)\\n {\\n c = (rnd(1,100) <= 15) ? ' ' : rnd( 'a', 'z' );\\n a = FOREGROUND_GREEN | ((rnd(1,100) > 1) ? 0 : FOREGROUND_INTENSITY);\\n }\\n else\\n {\\n c = ' ';\\n a = FOREGROUND_GREEN;\\n }\\n\\n WriteConsoleOutputCharacter( hStdOut, &c, 1, newCharPosition, &result );\\n WriteConsoleOutputAttribute( hStdOut, &a, 1, newCharPosition, &result );\\n\\n if(randomRegenerate()) show = randomShow();\\n if(randomRegenerate()) delay = randomDelay();\\n\\n Sleep( delay );\\n }\\n\\n free(buffer);\\n}\\n\\n\\nint main(int argc, char* argv[])\\n{\\n int j;\\n struct InitThreadData *init = NULL;\\n\\n srand((time_t)time(NULL));\\n\\n hStdOut = GetStdHandle( STD_OUTPUT_HANDLE );\\n SetConsoleTitle(\\\"MATRIX\\\");\\n\\n if(argc == 1)\\n {\\n COORD coord;\\n CONSOLE_CURSOR_INFO cci;\\n\\n cci.bVisible = FALSE;\\n cci.dwSize = 0;\\n SetConsoleDisplayMode(hStdOut,CONSOLE_FULLSCREEN_MODE,&coord);\\n SetConsoleCursorInfo(hStdOut,&cci);\\n }\\n\\n GetConsoleScreenBufferInfo( hStdOut, &csbi );\\n //SetConsoleTextAttribute(hStdOut,FOREGROUND_GREEN);\\n\\n#ifdef SYNCHRONIZED_INIT\\n eventThreadInitialized = CreateEvent(NULL,FALSE,FALSE,NULL);\\n assert( eventThreadInitialized != NULL );\\n#endif\\n\\n init = (struct InitThreadData*)\\n malloc(csbi.dwSize.X * sizeof(struct InitThreadData));\\n assert( init != NULL );\\n\\n for(j = 0; j < csbi.dwSize.X; j++)\\n {\\n init[j].column = j;\\n init[j].seed = rand();\\n _beginthread(one_column, 0, (void*)&init[j]);\\n#ifdef SYNCHRONIZED_INIT\\n WaitForSingleObject(eventThreadInitialized,INFINITE);\\n#endif\\n }\\n\\n getchar();\\n free(init);\\n\\n#ifdef SYNCHRONIZED_INIT\\n CloseHandle(eventThreadInitialized);\\n#endif SYNCHRONIZED_INIT\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"/*******************************************************************************\\n*\\n* Digital ASCII rain - multithreaded.\\n* 2012 (C) by Author, 2020 GPL licensed for RossetaCode\\n*\\n*******************************************************************************/\\n\\n#include <assert.h> /* assertions */\\n#include <conio.h> /* console operations */\\n#include <locale.h> /* l10n and i18n */\\n#include <string.h> /* operations on strings and memory blocks */\\n#include <process.h> /* Microsoft Windows API for threads etc. */\\n#include <stdio.h> /* standard i/o library */\\n#include <stdlib.h> /* standard library with rand() function */\\n#include <time.h> /* time(NULL) used as srand(time(NULL)) */\\n#include <windows.h> /* just the Microsoft Windows main header for C */\\n\\n\\n/*\\n * Global variables, shared by fibers.\\n */\\n\\nBOOL loop = TRUE;\\nHANDLE hStdOut;\\nCONSOLE_SCREEN_BUFFER_INFO csbi;\\n\\nLPVOID mainFiber = NULL;\\n\\nstruct WorkingFiber\\n{\\n int column;\\n DWORD callAfter;\\n unsigned seed;\\n LPVOID fiber;\\n} *workingFibersTable = NULL;\\n\\n/*\\n * A function to generate random numbers from the range (a, b).\\n * NOTE: POSIX rand () is not thread safe,\\n * but we use secure rand() from MS runtime libraries.\\n */\\n\\nint rnd(int a, int b)\\n{\\n return a + rand() % (b + 1 - a);\\n}\\n\\nBOOL randomShow(void)\\n{\\n return rnd(0, 99) < 65;\\n}\\n\\nint randomDelay(void)\\n{\\n return rnd(0,150) + rnd(0,150) + rnd(0,150);\\n}\\n\\nBOOL randomRegenerate(void)\\n{\\n return rnd(0,99) < 2;\\n}\\n\\n\\nVOID CALLBACK one_column(void *arg)\\n{\\n struct WorkingFiber *ptr;\\n BOOL show;\\n int k;\\n char c;\\n WORD a;\\n int delay;\\n PCHAR_INFO buffer;\\n COORD bufferSize, bufferCoord, newCharPosition;\\n SMALL_RECT s, d;\\n DWORD result;\\n\\n ptr = (struct WorkingFiber*)arg;\\n k = ptr->column;\\n ptr->callAfter = 0;\\n srand(ptr->seed);\\n assert(csbi.dwSize.X != 0 && csbi.dwSize.Y != 0);\\n assert(0 <= k && k <= csbi.dwSize.X);\\n\\n show = randomShow();\\n delay = randomDelay();\\n\\n bufferSize.X = 1;\\n bufferSize.Y = csbi.dwSize.Y - 1;\\n bufferCoord.X = 0;\\n bufferCoord.Y = 0;\\n\\n buffer = (PCHAR_INFO)malloc(bufferSize.Y * sizeof(CHAR_INFO));\\n assert( buffer != NULL );\\n\\n s.Left = k;\\n s.Top = 0;\\n s.Bottom = bufferSize.Y - 2;\\n s.Right = k;\\n\\n d.Left = s.Left;\\n d.Top = s.Top + 1;\\n d.Right = s.Right;\\n d.Bottom = s.Bottom + 1;\\n\\n newCharPosition.X = k;\\n newCharPosition.Y = 0;\\n\\n while(loop)\\n {\\n ReadConsoleOutput ( hStdOut, buffer, bufferSize, bufferCoord, &s);\\n WriteConsoleOutput( hStdOut, buffer, bufferSize, bufferCoord, &d);\\n\\n if(show)\\n {\\n c = (rnd(1,100) <= 15) ? ' ' : rnd( 'a', 'z' );\\n a = FOREGROUND_GREEN | ((rnd(1,100) > 1) ? 0 : FOREGROUND_INTENSITY);\\n }\\n else\\n {\\n c = ' ';\\n a = FOREGROUND_GREEN;\\n }\\n\\n WriteConsoleOutputCharacter( hStdOut, &c, 1, newCharPosition, &result );\\n WriteConsoleOutputAttribute( hStdOut, &a, 1, newCharPosition, &result );\\n\\n if(randomRegenerate()) show = randomShow();\\n if(randomRegenerate()) delay = randomDelay();\\n\\n ptr->callAfter = GetTickCount() + delay;\\n SwitchToFiber(mainFiber);\\n }\\n\\n free(buffer);\\n}\\n\\n\\nint main(int argc, char* argv[])\\n{\\n int j;\\n\\n srand((unsigned int)time(NULL));\\n\\n hStdOut = GetStdHandle( STD_OUTPUT_HANDLE );\\n SetConsoleTitle(\\\"MATRIX - FIBERS\\\");\\n\\n if(argc == 1)\\n {\\n COORD coord;\\n CONSOLE_CURSOR_INFO cci;\\n\\n cci.bVisible = FALSE;\\n cci.dwSize = 0;\\n SetConsoleDisplayMode(hStdOut,CONSOLE_FULLSCREEN_MODE,&coord);\\n SetConsoleCursorInfo(hStdOut,&cci);\\n }\\n\\n GetConsoleScreenBufferInfo( hStdOut, &csbi );\\n //SetConsoleTextAttribute(hStdOut,FOREGROUND_GREEN);\\n\\n mainFiber = ConvertThreadToFiber(NULL);\\n assert( mainFiber != NULL );\\n\\n workingFibersTable = (struct WorkingFiber*)\\n calloc(csbi.dwSize.X, sizeof(struct WorkingFiber));\\n assert( workingFibersTable != NULL );\\n\\n for(j = 0; j < csbi.dwSize.X; j++)\\n {\\n workingFibersTable[j].column = j;\\n workingFibersTable[j].callAfter = 0;\\n workingFibersTable[j].seed = rand();\\n workingFibersTable[j].fiber = CreateFiber( 0, one_column, &workingFibersTable[j] );\\n }\\n\\n loop = TRUE;\\n while(!_kbhit())\\n {\\n DWORD t = GetTickCount();\\n for(j = 0; j < csbi.dwSize.X; j++)\\n if(workingFibersTable[j].callAfter < t)\\n SwitchToFiber( workingFibersTable[j].fiber );\\n Sleep(1);\\n }\\n\\n loop = FALSE;\\n for(j = 0; j < csbi.dwSize.X; j++)\\n {\\n SwitchToFiber( workingFibersTable[j].fiber );\\n DeleteFiber(workingFibersTable[j].fiber);\\n }\\n\\n free(workingFibersTable);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"(defun matrix-digital-rain ()\\n (with-screen (scr :input-echoing nil :input-blocking nil :cursor-visible nil)\\n (let* ((width (width scr))\\n (height (height scr))\\n ;; start at a random height in each column.\\n (positions (loop repeat width collect (random height)))\\n ;; run each column at a random speed.\\n (speeds (loop repeat width collect (random 4))))\\n ;; generate a random ascii char\\n (flet ((randch () (+ 64 (random 58))))\\n ;; hit the q key to exit the main loop.\\n (bind scr #\\\\q 'exit-event-loop)\\n (bind scr nil\\n (lambda (win event)\\n (loop for col from 0 to (1- width) do\\n (loop repeat (nth col speeds) do\\n ;; position of the first point in the current column\\n (let ((pos (nth col positions)))\\n (setf (attributes win) '(:bold))\\n (setf (fgcolor win) :green)\\n (add win (randch) :y (mod pos height) :x col :fgcolor :white)\\n (add win (randch) :y (mod (- pos 1) height) :x col)\\n (add win (randch) :y (mod (- pos 2) height) :x col)\\n (setf (attributes win) '())\\n (add win (randch) :y (mod (- pos 3) height) :x col)\\n ;; overwrite the last char half the height from the first char.\\n (add win #\\\\space :y (mod (- pos (floor height 2)) height) :x col)\\n (refresh win)\\n ;; advance the current column\\n (setf (nth col positions) (mod (+ pos 1) height))))))))\\n (setf (frame-rate scr) 20)\\n (run-event-loop scr))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"Sub d(p As Ulong, s As Ulong, x As Long, y As Long)\\n Color p, s\\n If y > 0 And y < 24 Then Locate y, x: Print Chr(33 + (x * y) Mod 200);\\nEnd Sub\\n\\nDim As Long t(80)\\nFor i As Integer = 1 To 80\\n t(i) = Int(-50 * Rnd)\\nNext\\nDim As Double s = Timer\\n\\nCls\\nDo\\n For i As Integer = 1 To 80\\n If t(i) > 28 Then t(i) = 0\\n t(i) += 1\\n Dim As Long y = t(i)\\n d( 0, 0, i, y - 6)\\n d( 2, 0, i, y - 5)\\n d( 2, 0, i, y - 4)\\n d(10, 0, i, y - 2)\\n d(11, 0, i, y - 1)\\n d( 0, 2, i, y)\\n Next i\\n\\n Dim As Double l = Timer\\n While l = Timer: Wend\\nLoop\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n gc \\\"github.com/rthornton128/goncurses\\\"\\n \\\"log\\\"\\n \\\"math/rand\\\"\\n \\\"time\\\"\\n)\\n\\n// Time between row updates in microseconds.\\n// Controls the speed of the digital rain effect.\\nconst rowDelay = 40000\\n\\nfunc main() {\\n start := time.Now()\\n rand.Seed(time.Now().UnixNano())\\n\\n // Characters to randomly appear in the rain sequence.\\n chars := []byte(\\\"0123456789\\\")\\n totalChars := len(chars)\\n\\n // Set up ncurses screen and colors.\\n stdscr, err := gc.Init()\\n if err != nil {\\n log.Fatal(\\\"init\\\", err)\\n }\\n defer gc.End()\\n\\n gc.Echo(false)\\n gc.Cursor(0)\\n\\n if !gc.HasColors() {\\n log.Fatal(\\\"Program requires a colour capable terminal\\\")\\n }\\n\\n if err := gc.StartColor(); err != nil {\\n log.Fatal(err)\\n }\\n\\n if err := gc.InitPair(1, gc.C_GREEN, gc.C_BLACK); err != nil {\\n log.Fatal(\\\"InitPair failed: \\\", err)\\n }\\n stdscr.ColorOn(1)\\n maxY, maxX := stdscr.MaxYX()\\n\\n /* Create slices of columns based on screen width. */\\n\\n // Slice containing the current row of each column.\\n columnsRow := make([]int, maxX)\\n\\n // Slice containing the active status of each column.\\n // A column draws characters on a row when active.\\n columnsActive := make([]int, maxX)\\n\\n // Set top row as current row for all columns.\\n for i := 0; i < maxX; i++ {\\n columnsRow[i] = -1\\n columnsActive[i] = 0\\n }\\n\\n for {\\n for i := 0; i < maxX; i++ {\\n if columnsRow[i] == -1 {\\n // If a column is at the top row, pick a\\n // random starting row and active status.\\n columnsRow[i] = rand.Intn(maxY + 1)\\n columnsActive[i] = rand.Intn(2)\\n }\\n }\\n\\n // Loop through columns and draw characters on rows.\\n for i := 0; i < maxX; i++ {\\n if columnsActive[i] == 1 {\\n // Draw a random character at this column's current row.\\n charIndex := rand.Intn(totalChars)\\n stdscr.MovePrintf(columnsRow[i], i, \\\"%c\\\", chars[charIndex])\\n } else {\\n // Draw an empty character if the column is inactive.\\n stdscr.MovePrintf(columnsRow[i], i, \\\"%c\\\", ' ')\\n }\\n\\n columnsRow[i]++\\n\\n // When a column reaches the bottom row, reset to top.\\n if columnsRow[i] >= maxY {\\n columnsRow[i] = -1\\n }\\n\\n // Randomly alternate the column's active status.\\n if rand.Intn(1001) == 0 {\\n if columnsActive[i] == 0 {\\n columnsActive[i] = 1\\n } else {\\n columnsActive[i] = 0\\n }\\n }\\n }\\n time.Sleep(rowDelay * time.Microsecond)\\n stdscr.Refresh()\\n elapsed := time.Since(start)\\n // Stop after 1 minute.\\n if elapsed.Minutes() >= 1 {\\n break\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"require'gl2'\\ncoinsert'jgl2'\\n\\njunk=: 7 u:;48 65 16b30a1(+i.)&.>10 26 90\\nsz=:40 25\\nlen=: <.1.4*{:sz\\nheat=: (224 255 255),~(<.0.5+255*(%>./)(-<./)^>:(% >./)i.len)*/0 1 0\\n\\ncols=: i.0\\nrows=: i.0\\nscale=: 24\\nlive=: (#heat)#<i.0 3\\n\\nrain_timer=: {{\\n try.\\n wd 'psel rain'\\n glsel 'green'\\n glfill 0 0 0 255\\n glfont font=.'courier ',\\\":0.8*scale\\n upd=. 0>._3++/?2 2 2 2 4\\n cols=: cols,upd{.(?~{.sz)-.(-<.0.3*{:sz){.cols\\n rows=: (#cols){.rows\\n live=: }.live,<(scale*cols,.rows),.?(#cols)##junk\\n for_p. live do.\\n gltextcolor glrgb p_index{heat\\n if.p_index=<:#live do.\\n glfont font,' bold'\\n end.\\n for_xyj.;p do.\\n gltextxy 2{.xyj\\n gltext 8 u:junk{~{:xyj\\n end.\\n end.\\n glpaintx''\\n keep=: rows<{:sz-1\\n cols=: keep#cols\\n rows=: keep#rows+1\\n EMPTY\\n catch.\\n wd'ptimer 0'\\n end.\\n}}\\n\\nwd rplc&('DIMS';\\\":scale*sz) {{)n\\n pc rain closeok;\\n setp wh DIMS;\\n cc green isidraw flush;\\n pshow;\\n ptimer 100\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.awt.Canvas;\\nimport java.awt.Color;\\nimport java.awt.Dimension;\\nimport java.awt.EventQueue;\\nimport java.awt.Font;\\nimport java.awt.Graphics2D;\\nimport java.awt.Point;\\nimport java.awt.image.BufferStrategy;\\nimport java.awt.image.BufferedImage;\\nimport java.util.List;\\nimport java.util.concurrent.ExecutorService;\\nimport java.util.concurrent.Executors;\\nimport java.util.concurrent.ScheduledExecutorService;\\nimport java.util.concurrent.ThreadLocalRandom;\\nimport java.util.concurrent.TimeUnit;\\nimport java.util.stream.Collectors;\\nimport java.util.stream.Stream;\\n\\nimport javax.swing.JFrame;\\n\\npublic final class MatrixDigitalRain {\\n\\n public static void main(String[] args) {\\n \\tEventQueue.invokeLater( () -> {\\n \\t\\t JFrame.setDefaultLookAndFeelDecorated(true);\\n JFrame frame = new JFrame(\\\"Matrix Digital Rain\\\");\\n frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\\n frame.setResizable(false);\\n DigitalRain digitalRain = new DigitalRain(800, 600);\\n frame.add(digitalRain);\\n frame.setLocationByPlatform(true);\\n frame.pack();\\n frame.setVisible(true);\\n\\n digitalRain.start();\\n \\t} );\\n }\\n\\n private static final class DigitalRain extends Canvas {\\n\\n public DigitalRain(int aWidth, int aHeight) { \\t\\t \\t\\t\\t\\t\\n \\t\\tsetPreferredSize( new Dimension(aWidth, aHeight) );\\n \\t\\tsetBackground(Color.BLACK);\\t\\n \\t\\t\\n \\t\\tcolumnCount = aWidth / ( 2 * halfColumnWidth ) - 1;\\n \\t\\trowCount = aHeight / ( 2 * halfFontSize );\\n \\t\\t\\n \\t\\tsetCursor(getToolkit().createCustomCursor(\\n new BufferedImage(1, 1, BufferedImage.TYPE_INT_ARGB), new Point(0, 0), \\\"transparent\\\")); \\t\\t\\n \\t\\t\\n \\t\\texecutiveService = Executors.newSingleThreadExecutor();\\n \\t\\trandom = ThreadLocalRandom.current();\\n }\\n\\n public void start() {\\n \\trequestFocus();\\n createBufferStrategy(2);\\n executiveService.execute( new DrawingCycle(rowCount) );\\n }\\n\\n private final class DrawingCycle implements Runnable {\\n \\t\\n \\tpublic DrawingCycle(int rowCount) {\\n \\t\\tcolumns = Stream.generate( () -> new Column(rowCount) )\\n \\t\\t\\t\\t .limit(columnCount).collect(Collectors.toList()); \\t\\t\\n \\t\\tbufferStrategy = getBufferStrategy();\\n \\t\\tscheduler = Executors.newSingleThreadScheduledExecutor();\\n \\t}\\n\\n @Override\\n public void run() {\\n \\tscheduler.scheduleAtFixedRate( () -> { draw(); update(); }, 0, 100, TimeUnit.MILLISECONDS);\\n }\\n\\n private void draw() {\\n Graphics2D graphics2D = (Graphics2D) bufferStrategy.getDrawGraphics(); \\t\\n \\tgraphics2D.setColor(Color.BLACK);\\n \\tgraphics2D.fillRect(0, 0, getWidth(), getHeight()); \\t\\n \\t\\n \\tfor ( int col = 0; col < columnCount; col++ ) {\\n \\t\\tfor ( int row = 0; row < rowCount; row++ ) {\\n \\t\\t\\t\\tSymbol symbol = columns.get(col).symbols.get(row);\\n \\t\\t\\t\\tgraphics2D.setFont(symbol.font);\\n \\t\\t\\t\\t\\tgraphics2D.setColor(symbol.color());\\n \\t\\t\\t\\t\\tfinal int size = symbol.font.getSize();\\n \\t\\t\\t\\t\\tgraphics2D.drawString(\\n \\t\\t\\t\\t\\t\\t\\tsymbol.element,\\n \\t\\t\\t\\t\\t\\t\\t2 * halfColumnWidth * col + halfColumnWidth + ( 6 * halfFontSize - size ) / 2,\\n \\t\\t\\t\\t\\t\\t\\trow * 2 * halfFontSize);\\n \\t}\\n \\t}\\n\\n \\t\\tgraphics2D.dispose();\\n bufferStrategy.show();\\n }\\n\\n private void update() {\\n \\tfor ( Column column : columns ) { \\t\\t\\n \\t\\tif ( column.index >= 0 ) {\\n \\t\\t\\tString element = elements.get(random.nextInt(elements.size()));\\n \\t\\t\\tcolumn.symbols.set(column.index, new Symbol(element, column.font, 255) );\\n \\t\\t}\\n \\t\\t\\n \\t\\tcolumn.index = Math.min(column.index + 1, rowCount);\\n \\tcolumn.darken();\\n\\n \\tif ( column.index == rowCount ) {\\n \\t\\tcolumn.reset();\\n \\t}\\n \\t} \\t\\n }\\n\\n private final List<Column> columns;\\n private final BufferStrategy bufferStrategy;\\n private final ScheduledExecutorService scheduler;\\n\\n } // End DrawingCycle class\\n\\n private final class Column {\\n \\t\\n \\tpublic Column(int aRowCount) {\\n \\t\\trowCount = aRowCount; \\t\\t\\n \\t\\tindex = random.nextInt(-rowCount, rowCount);\\n \\t\\tsetFont();\\n \\t\\t\\tsymbols = Stream.generate( () -> new Symbol(font) ).limit(rowCount).collect(Collectors.toList());\\n \\t\\t\\t\\n \\t\\t}\\n \\t\\n \\t public void darken() {\\n \\t \\tsymbols.stream().forEach(Symbol::darken);\\n \\t }\\n \\t\\n \\t public void reset() {\\n \\t\\t\\tindex = random.nextInt(-rowCount, rowCount / 2);\\n \\t\\t\\tsetFont();\\n \\t }\\n \\t\\n \\t private void setFont() {\\n \\t \\tfinal int fontSize = ( random.nextInt(2) == 0 ) ?\\n \\t \\t\\t2 * halfFontSize : ( random.nextInt(2) == 0 ) ?\\n \\t \\t\\t\\t(int) ( 1.5 * halfFontSize ) : 3 * halfFontSize;\\n \\t\\tfinal int fontStyle = ( random.nextInt(3) == 0 ) ? Font.BOLD : Font.PLAIN;\\n \\t\\tfont = new Font(\\\"Dialog\\\", fontStyle, fontSize);\\n \\t }\\n \\t\\n \\t private int index;\\n \\t private Font font;\\n \\t private List<Symbol> symbols;\\n \\t\\n \\t private final int rowCount;\\t\\n \\t\\n } // End Column class\\n\\n private final class Symbol {\\n \\t\\n \\tpublic Symbol(String aElement, Font aFont, int aBrightness) {\\n \\t\\telement = aElement;\\n \\t\\tfont = aFont;\\n \\t\\tbrightness = aBrightness;\\n \\t}\\n \\t\\n \\tpublic Symbol(Font font) {\\n \\t\\tthis(\\\" \\\", font, 0);\\n \\t}\\n \\t\\n \\tpublic Color color() {\\n \\t\\t\\treturn new Color(0, 255, 0, brightness);\\n \\t\\t}\\n \\t\\t\\n \\t public void darken() {\\n \\t \\tbrightness = Math.max(0, brightness - 5);\\n \\t }\\n \\t\\n \\t public String toString() {\\n \\t \\treturn element;\\n \\t }\\n \\t\\n \\t private int brightness;\\n \\t\\n \\t private final Font font;\\n \\tprivate final String element; \\t\\n \\t\\n } // End Symbol class\\n\\n \\tprivate final int columnCount;\\n \\tprivate final int rowCount; \\t\\n \\tprivate final ExecutorService executiveService; \\t\\n \\tprivate final int halfFontSize = 6;\\n \\tprivate final int halfColumnWidth = 10;\\n \\tprivate final ThreadLocalRandom random;\\n\\t private final List<String> elements = List.of(\\n\\t\\t\\t\\\"M\\\", \\\"Ї\\\", \\\"Љ\\\", \\\"Њ\\\", \\\"Ћ\\\", \\\"Ќ\\\", \\\"Ѝ\\\", \\\"Ў\\\", \\\"Џ\\\", \\\"Б\\\", \\\"Г\\\", \\\"Д\\\", \\\"Ж\\\", \\\"И\\\", \\\"Й\\\", \\\"Л\\\", \\\"П\\\", \\\"Ф\\\", \\\"Ц\\\", \\\"Ч\\\", \\\"Ш\\\",\\n\\t\\t\\t\\\"Щ\\\", \\\"Ъ\\\", \\\"Ы\\\", \\\"Э\\\", \\\"Ю\\\", \\\"Я\\\", \\\"в\\\", \\\"д\\\", \\\"ж\\\", \\\"з\\\", \\\"и\\\", \\\"й\\\", \\\"к\\\", \\\"л\\\", \\\"м\\\", \\\"н\\\", \\\"п\\\", \\\"т\\\", \\\"ф\\\", \\\"ц\\\", \\\"ч\\\",\\n\\t\\t\\t\\\"ш\\\", \\\"щ\\\", \\\"ъ\\\", \\\"ы\\\", \\\"ь\\\", \\\"э\\\", \\\"ю\\\", \\\"я\\\", \\\"ѐ\\\", \\\"ё\\\", \\\"ђ\\\", \\\"ѓ\\\", \\\"є\\\", \\\"ї\\\", \\\"љ\\\", \\\"њ\\\", \\\"ћ\\\", \\\"ќ\\\", \\\"ѝ\\\", \\\"ў\\\", \\\"џ\\\",\\n\\t \\\"Ѣ\\\", \\\"ѣ\\\", \\\"ѧ\\\", \\\"Ѯ\\\", \\\"ѱ\\\", \\\"Ѳ\\\", \\\"ѳ\\\", \\\"ҋ\\\", \\\"Ҍ\\\", \\\"ҍ\\\", \\\"Ҏ\\\", \\\"ҏ\\\", \\\"Ґ\\\", \\\"ґ\\\", \\\"Ғ\\\", \\\"ғ\\\", \\\"Ҕ\\\", \\\"ҕ\\\", \\\"Җ\\\", \\\"җ\\\", \\\"Ҙ\\\",\\n\\t \\\"ҙ\\\", \\\"Қ\\\", \\\"қ\\\", \\\"ҝ\\\", \\\"ҟ\\\", \\\"ҡ\\\", \\\"Ң\\\", \\\"ң\\\", \\\"Ҥ\\\", \\\"ҥ\\\", \\\"ҩ\\\", \\\"Ҫ\\\", \\\"ҫ\\\", \\\"Ҭ\\\", \\\"ҭ\\\", \\\"Ұ\\\", \\\"ұ\\\", \\\"Ҳ\\\", \\\"ҳ\\\", \\\"ҵ\\\", \\\"ҷ\\\",\\n\\t \\\"ҹ\\\", \\\"Һ\\\", \\\"ҿ\\\", \\\"Ӂ\\\", \\\"ӂ\\\", \\\"Ӄ\\\", \\\"ӄ\\\", \\\"ӆ\\\", \\\"Ӈ\\\", \\\"ӈ\\\", \\\"ӊ\\\", \\\"Ӌ\\\", \\\"ӌ\\\", \\\"ӎ\\\", \\\"Ӑ\\\", \\\"ӑ\\\", \\\"Ӓ\\\", \\\"ӓ\\\", \\\"Ӕ\\\", \\\"ӕ\\\", \\\"Ӗ\\\",\\n\\t \\\"ӗ\\\", \\\"Ә\\\", \\\"ә\\\", \\\"Ӛ\\\", \\\"ӛ\\\", \\\"Ӝ\\\", \\\"ӝ\\\", \\\"Ӟ\\\", \\\"ӟ\\\", \\\"ӡ\\\", \\\"Ӣ\\\", \\\"ӣ\\\", \\\"Ӥ\\\", \\\"ӥ\\\", \\\"Ӧ\\\", \\\"ӧ\\\", \\\"Ө\\\", \\\"ө\\\", \\\"Ӫ\\\", \\\"ӫ\\\", \\\"Ӭ\\\",\\n\\t \\\"ӭ\\\", \\\"Ӯ\\\", \\\"ӯ\\\", \\\"Ӱ\\\", \\\"ӱ\\\", \\\"Ӳ\\\", \\\"ӳ\\\", \\\"Ӵ\\\", \\\"ӵ\\\", \\\"Ӷ\\\", \\\"ӷ\\\", \\\"Ӹ\\\", \\\"ӹ\\\", \\\"Ӻ\\\", \\\"ӽ\\\", \\\"ӿ\\\", \\\"Ԁ\\\", \\\"ԍ\\\", \\\"ԏ\\\", \\\"Ԑ\\\", \\\"ԑ\\\",\\n\\t \\\"ԓ\\\", \\\"Ԛ\\\", \\\"ԟ\\\", \\\"Ԧ\\\", \\\"ԧ\\\", \\\"Ϥ\\\", \\\"ϥ\\\", \\\"ϫ\\\", \\\"ϭ\\\", \\\"ｩ\\\", \\\"ｪ\\\", \\\"ｫ\\\", \\\"ｬ\\\", \\\"ｭ\\\", \\\"ｮ\\\", \\\"ｯ\\\", \\\"ｰ\\\", \\\"ｱ\\\", \\\"ｲ\\\", \\\"ｳ\\\", \\\"ｴ\\\",\\n\\t \\\"ｵ\\\", \\\"ｶ\\\", \\\"ｷ\\\", \\\"ｸ\\\", \\\"ｹ\\\", \\\"ｺ\\\", \\\"ｻ\\\", \\\"ｼ\\\", \\\"ｽ\\\", \\\"ｾ\\\", \\\"ｿ\\\", \\\"ﾀ\\\", \\\"ﾁ\\\", \\\"ﾂ\\\", \\\"ﾃ\\\", \\\"ﾄ\\\", \\\"ﾅ\\\", \\\"ﾆ\\\", \\\"ﾇ\\\", \\\"ﾈ\\\", \\\"ﾉ\\\",\\n\\t \\\"ﾊ\\\", \\\"ﾋ\\\", \\\"ﾌ\\\", \\\"ﾍ\\\", \\\"ﾎ\\\", \\\"ﾏ\\\", \\\"ﾐ\\\", \\\"ﾑ\\\", \\\"ﾒ\\\", \\\"ﾓ\\\", \\\"ﾔ\\\", \\\"ﾕ\\\", \\\"ﾖ\\\", \\\"ﾗ\\\", \\\"ﾘ\\\", \\\"ﾙ\\\", \\\"ﾚ\\\", \\\"ﾛ\\\", \\\"ﾜ\\\", \\\"ﾝ\\\", \\\"ⲁ\\\",\\n\\t \\\"Ⲃ\\\", \\\"ⲃ\\\", \\\"Ⲅ\\\", \\\"Γ\\\", \\\"Δ\\\", \\\"Θ\\\", \\\"Λ\\\", \\\"Ξ\\\", \\\"Π\\\", \\\"Ѐ\\\", \\\"Ё\\\", \\\"Ђ\\\", \\\"Ѓ\\\", \\\"Є\\\", \\\"ⲉ\\\", \\\"Ⲋ\\\", \\\"ⲋ\\\", \\\"Ⲍ\\\", \\\"ⲍ\\\", \\\"ⲏ\\\", \\\"ⲑ\\\",\\n\\t \\\"ⲓ\\\", \\\"ⲕ\\\", \\\"ⲗ\\\", \\\"ⲙ\\\", \\\"ⲛ\\\", \\\"Ⲝ\\\", \\\"ⲝ\\\", \\\"ⲡ\\\", \\\"ⲧ\\\", \\\"ⲩ\\\", \\\"ⲫ\\\", \\\"ⲭ\\\", \\\"ⲯ\\\", \\\"ⳁ\\\", \\\"Ⳉ\\\", \\\"ⳉ\\\", \\\"ⳋ\\\", \\\"ⳤ\\\", \\\"⳥\\\", \\\"⳦\\\", \\\"⳨\\\",\\n\\t \\\"⳩\\\", \\\"∀\\\", \\\"∁\\\", \\\"∂\\\", \\\"∃\\\", \\\"∄\\\", \\\"∅\\\", \\\"∆\\\", \\\"∇\\\", \\\"∈\\\", \\\"∉\\\", \\\"∊\\\", \\\"∋\\\", \\\"∌\\\", \\\"∍\\\", \\\"∎\\\", \\\"∏\\\", \\\"∐\\\", \\\"∑\\\", \\\"∓\\\",\\n\\t \\\"ℇ\\\", \\\"ℏ\\\", \\\"℥\\\", \\\"Ⅎ\\\", \\\"ℷ\\\", \\\"⩫\\\", \\\"⨀\\\", \\\"⨅\\\", \\\"⨆\\\", \\\"⨉\\\", \\\"⨍\\\", \\\"⨎\\\", \\\"⨏\\\", \\\"⨐\\\", \\\"⨑\\\", \\\"⨒\\\", \\\"⨓\\\", \\\"⨔\\\", \\\"⨕\\\", \\\"⨖\\\",\\n\\t \\\"⨗\\\", \\\"⨘\\\", \\\"⨙\\\", \\\"⨚\\\", \\\"⨛\\\", \\\"⨜\\\", \\\"⨝\\\", \\\"⨿\\\", \\\"⩪\\\" );\\t\\n\\n } // End DigitalRain class\\n\\n} // End MatrixDigitalRain class\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var tileSize = 20;\\n// a higher fade factor will make the characters fade quicker\\nvar fadeFactor = 0.05;\\n\\nvar canvas;\\nvar ctx;\\n\\nvar columns = [];\\nvar maxStackHeight;\\n\\nfunction init() {\\n\\tcanvas = document.getElementById('canvas');\\n\\tctx = canvas.getContext('2d');\\n\\n // https://developer.mozilla.org/en-US/docs/Web/API/ResizeObserver\\n const resizeObserver = new ResizeObserver(entries =>\\n {\\n for (let entry of entries)\\n {\\n if (entry.contentBoxSize)\\n {\\n // Firefox implements `contentBoxSize` as a single content rect, rather than an array\\n const contentBoxSize = Array.isArray(entry.contentBoxSize) ? entry.contentBoxSize[0] : entry.contentBoxSize;\\n\\n canvas.width = contentBoxSize.inlineSize;\\n canvas.height = window.innerHeight;\\n\\n initMatrix();\\n }\\n }\\n });\\n\\n // observe the size of the document\\n resizeObserver.observe(document.documentElement);\\n\\n\\t// start the main loop\\n\\ttick();\\n}\\n\\nfunction initMatrix() {\\n columns = [];\\n\\n maxStackHeight = Math.ceil(canvas.height/tileSize);\\n\\n // divide the canvas into columns\\n for (let i = 0 ; i < canvas.width/tileSize ; ++i) {\\n var column = {};\\n // save the x position of the column\\n column.x = i*tileSize;\\n // create a random stack height for the column\\n column.stackHeight = 10+Math.random()*maxStackHeight;\\n // add a counter to count the stack height\\n column.stackCounter = 0;\\n // add the column to the list\\n columns.push(column);\\n }\\n}\\n\\nfunction draw() {\\n // draw a semi transparent black rectangle on top of the scene to slowly fade older characters\\n ctx.fillStyle = \\\"rgba(0 , 0 , 0 , \\\"+fadeFactor+\\\")\\\";\\n ctx.fillRect(0 , 0 , canvas.width , canvas.height);\\n\\n ctx.font = (tileSize-2)+\\\"px monospace\\\";\\n ctx.fillStyle = \\\"rgb(0 , 255 , 0)\\\";\\n for (let i = 0 ; i < columns.length ; ++i) {\\n // pick a random ascii character (change the 94 to a higher number to include more characters)\\n var randomCharacter = String.fromCharCode(33+Math.floor(Math.random()*94));\\n ctx.fillText(randomCharacter , columns[i].x , columns[i].stackCounter*tileSize+tileSize);\\n\\n // if the stack is at its height limit, pick a new random height and reset the counter\\n if (++columns[i].stackCounter >= columns[i].stackHeight)\\n {\\n columns[i].stackHeight = 10+Math.random()*maxStackHeight;\\n columns[i].stackCounter = 0;\\n }\\n }\\n}\\n\\n// MAIN LOOP\\nfunction tick() {\\t\\n draw();\\n setTimeout(tick , 50);\\n}\\n\\nvar b_isFullscreen = false;\\n\\nfunction fullscreen() {\\n var elem = document.documentElement;\\n if (elem.requestFullscreen) {\\n elem.requestFullscreen();\\n }\\n else if (elem.webkitRequestFullscreen) {\\n elem.webkitRequestFullscreen(); // Safari\\n }\\n else if (elem.msRequestFullscreen) {\\n elem.msRequestFullscreen(); // IE11\\n }\\n}\\n\\nfunction exitFullscreen() {\\n if (document.exitFullscreen) {\\n document.exitFullscreen();\\n }\\n else if (document.webkitExitFullscreen) {\\n document.webkitExitFullscreen(); // Safari\\n }\\n else if (document.msExitFullscreen) {\\n document.msExitFullscreen(); // IE11\\n }\\n}\\n\\nfunction toggleFullscreen() {\\n if (!b_isFullscreen) {\\n fullscreen();\\n b_isFullscreen = true;\\n }\\n else {\\n exitFullscreen();\\n b_isFullscreen = false;\\n }\\n}\\n\\nfunction updateTileSize() {\\n tileSize = Math.min(Math.max(document.getElementById(\\\"tileSize\\\").value , 10) , 100);\\n initMatrix();\\n}\\n\\nfunction updateFadeFactor() {\\n fadeFactor = Math.min(Math.max(document.getElementById(\\\"fadeFactor\\\").value , 0.0) , 1.0);\\n initMatrix();\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"using Gtk, Colors, Cairo\\nimport Base.iterate, Base.IteratorSize, Base.IteratorEltype\\n\\nconst caps = [c for c in \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"]\\nstartfall() = rand() < 0.2\\nendfall() = rand() < 0.2\\nstartblank() = rand() < 0.1\\nendblank() = rand() < 0.05\\nbechangingchar() = rand() < 0.03\\n\\nstruct RainChars chars::Vector{Char} end\\nBase.IteratorSize(s::RainChars) = Base.IsInfinite()\\nBase.IteratorEltype(s::RainChars) = Char\\nfunction Base.iterate(rain::RainChars, state = (true, false, 0))\\n c = '\\\\0'\\n isfalling, isblank, blankcount = state\\n if isfalling # falling, so feed the column\\n if isblank\\n c = ' '\\n ((blankcount += 1) > 12) && (isblank = endblank())\\n else\\n c = bechangingchar() ? '~' : rand(rain.chars)\\n isblank, blankcount = startblank(), 0\\n end\\n endfall() && (isfalling = false)\\n else\\n isfalling = startfall()\\n end\\n return c, (isfalling, isblank, blankcount)\\nend\\n\\nfunction digitalrain()\\n mapwidth, mapheight, fontpointsize = 800, 450, 14\\n windowmaxx = div(mapwidth, Int(round(fontpointsize * 0.9)))\\n windowmaxy = div(mapheight, fontpointsize)\\n basebuffer = fill(' ', windowmaxy, windowmaxx)\\n bkcolor, rcolor, xcolor = colorant\\\"black\\\", colorant\\\"green\\\", colorant\\\"limegreen\\\"\\n\\n columngenerators = [Iterators.Stateful(RainChars(caps)) for _ in 1:windowmaxx]\\n\\n win = GtkWindow(\\\"Digital Rain Effect\\\", mapwidth, mapheight) |>\\n (GtkFrame() |> (can = GtkCanvas()))\\n set_gtk_property!(can, :expand, true)\\n\\n draw(can) do widget\\n ctx = Gtk.getgc(can)\\n select_font_face(ctx, \\\"Leonardo\\\\'s mirrorwriting\\\", Cairo.FONT_SLANT_NORMAL,\\n Cairo.FONT_WEIGHT_BOLD)\\n set_font_size(ctx, fontpointsize)\\n set_source(ctx, bkcolor)\\n rectangle(ctx, 0, 0, mapwidth, mapheight)\\n fill(ctx)\\n set_source(ctx, rcolor)\\n for i in 1:size(basebuffer)[1], j in 1:size(basebuffer)[2]\\n move_to(ctx, j * fontpointsize * 0.9, i * fontpointsize)\\n c = basebuffer[i, j]\\n if c == '~'\\n\\t\\t\\t\\tset_source(ctx, xcolor)\\n show_text(ctx, String([rand(caps)]))\\n\\t\\t\\t\\tset_source(ctx, rcolor)\\n else\\n show_text(ctx, String([c]))\\n end\\n end\\n end\\n\\n while true\\n for col in 1:windowmaxx\\n c = popfirst!(columngenerators[col])\\n if c != '\\\\0'\\n basebuffer[2:end, col] .= basebuffer[1:end-1, col]\\n basebuffer[1, col] = c\\n end\\n end\\n draw(can)\\n Gtk.showall(win)\\n sleep(0.05)\\n end\\nend\\n\\ndigitalrain()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"10 mode 0:defint a-z:randomize time:ink 0,0:ink 1,26:ink 2,19:border 0\\n20 dim p(20):mm=5:dim act(mm):for i=1 to mm:act(i)=rnd*19+1:next\\n30 md=mm-2:dim del(md):for i=1 to md:del(i)=rnd*19+1:next\\n40 for i=1 to mm:x=act(i):locate x,p(x)+1:pen 1:print chr$(rnd*55+145);\\n50 if p(x)>0 then locate x,p(x):pen 2:print chr$(rnd*55+145);\\n60 p(x)=p(x)+1:if p(x)=25 then locate x,25:pen 2:print chr$(rnd*55+145);:p(x)=0:act(i)=rnd*19+1\\n70 next\\n80 for i=1 to md:x=del(i):locate x,p(x)+1:print \\\" \\\";\\n90 p(x)=p(x)+1:if p(x)=25 then p(x)=0:del(i)=rnd*19+1\\n100 next\\n110 goto 40\\n\",\n \"language\": \"Locomotive-Basic\"\n },\n {\n \"code\": \"10 mode 3:defint a-z:randomize time:ink 0,0:ink 1,26:ink 2,19:border 0\\n20 dim p(80):mm=12:dim act(mm):for i=1 to mm:act(i)=rnd*79+1:next\\n30 md=mm-2:dim del(md):for i=1 to md:del(i)=rnd*79+1:next\\n40 for i=1 to mm:x=act(i):locate x,p(x)+1:pen 1:print chr$(rnd*55+145);\\n50 if p(x)>0 then locate x,p(x):pen 2:print chr$(rnd*55+145);\\n60 p(x)=p(x)+1:if p(x)=50 then locate x,50:pen 2:print chr$(rnd*55+145);:p(x)=0:act(i)=rnd*79+1\\n70 next\\n80 for i=1 to md:x=del(i):locate x,p(x)+1:print \\\" \\\";\\n90 p(x)=p(x)+1:if p(x)=50 then p(x)=0:del(i)=rnd*79+1\\n100 next:frame\\n110 goto 40\\n\",\n \"language\": \"Locomotive-Basic\"\n },\n {\n \"code\": \"SeedRandom[1234];\\nClearAll[ColorFunc]\\nchars = RandomSample[Flatten[CharacterRange @@@ Partition[Characters[\\\"\\\\[CapitalAlpha]\\\\[CapitalPi]ЀѵҊԯ\\\\:03e2\\\\:03efｦﾝⲀ⳩\\\\[ForAll]∗℀℺⨀⫿\\\"], 2]]];\\ncharlen = Length[chars];\\nfadelength = 6;\\nColorFunc[fade_] := ColorFunc[fade] = Blend[{Black, Green}, fade/fadelength]\\nrows = 30;\\ncols = 50;\\nn = 10;\\ntrailpos = {RandomInteger[{1, cols}, n], RandomInteger[{1, rows}, n]} // Transpose;\\ntrailchars = RandomInteger[{1, Length[chars]}, n];\\ncharmap = ConstantArray[\\\".\\\", {rows, cols}];\\nfade = ConstantArray[5, {rows, cols}];\\nindices = MapIndexed[#2 &, fade, {2}];\\nDynamic[Graphics[{txts}, PlotRange -> {{1, cols}, {1, rows}}, PlotRangePadding -> 1, Background -> Black]]\\nDo[\\n trailpos[[All, 2]] += 1;\\n fade = Ramp[fade - 1];\\n trailchars = Mod[trailchars + 1, charlen, 1];\\n Do[\\n If[trailpos[[i, 2]] >= rows,\\n trailpos[[i, 2]] = 1;\\n trailpos[[i, 1]] = RandomInteger[{1, cols}];\\n ];\\n charmap[[trailpos[[i, 2]], trailpos[[i, 1]]]] =\\n chars[[trailchars[[i]]]];\\n fade[[trailpos[[i, 2]], trailpos[[i, 1]]]] = fadelength\\n ,\\n {i, n}\\n ];\\n txts = MapThread[If[#2 > 0, Text[Style[#1, ColorFunc[#2]], {#1, rows - #2 + 1} & @@ Reverse[#3]], {}] &, {charmap, fade, indices}, 2];\\n Pause[0.1]\\n ,\\n {1000}\\n]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import os, random, sequtils\\nimport ncurses\\n\\nconst RowDelay = 40 # In milliseconds.\\n\\nproc exit() {.noconv.} =\\n endwin()\\n quit QuitSuccess\\n\\nproc run() =\\n\\n const\\n Chars = \\\"0123456789\\\" # Characters to randomly appear in the rain sequence.\\n\\n let stdscr = initscr()\\n noEcho()\\n cursSet(0)\\n startColor()\\n initPair(1, COLOR_GREEN, COLOR_BLACK)\\n attron(COLOR_PAIR(1).cint)\\n\\n var width, height: cint\\n stdscr.getmaxyx(height, width)\\n let maxX = width - 1\\n let maxY = height - 1\\n\\n # Create arrays of columns based on screen width.\\n\\n # Array containing the current row of each column.\\n # Set top row as current row for all columns.\\n var columnsRow = repeat(cint -1, width)\\n\\n # Array containing the active status of each column.\\n # A column draws characters on a row when active.\\n var columnsActive = newSeq[bool](width)\\n\\n\\n setControlCHook(exit)\\n while true:\\n\\n for i in 0..maxX:\\n if columnsRow[i] == -1:\\n # If a column is at the top row, pick a random starting row and active status.\\n columnsRow[i] = cint(rand(maxY))\\n columnsActive[i] = bool(rand(1))\\n\\n # Loop through columns and draw characters on rows.\\n for i in 0..maxX:\\n if columnsActive[i]:\\n # Draw a random character at this column's current row.\\n let charIndex = rand(Chars.high)\\n mvprintw(columnsRow[i], i, \\\"%c\\\", Chars[charIndex])\\n else:\\n # Draw an empty character if the column is inactive.\\n mvprintw(columnsRow[i], i, \\\" \\\")\\n\\n inc columnsRow[i]\\n # When a column reaches the bottom row, reset to top.\\n if columnsRow[i] > maxY: columnsRow[i] = -1\\n\\n # Randomly alternate the column's active status.\\n if rand(999) == 0: columnsActive[i] = not columnsActive[i]\\n\\n sleep(RowDelay)\\n refresh()\\n\\nrun()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#!/user/bin/perl\\n\\nuse strict;\\nuse warnings;\\nuse Tk;\\n\\nmy $delay = 50; # milliseconds\\nmy $fade = 8; # number of characters to \\\"fade\\\"\\nmy $base_color = '#004000'; # dark green\\nmy $fontname = 'Times'; # Whatever\\nmy $fontsize = 12; # point size\\nmy $font = \\\"{$fontname} $fontsize bold\\\";\\nmy @objects;\\n\\nmy ( $xv, $yv ) = ( 0, 0 );\\n\\nmy $top = MainWindow->new();\\n\\n$top->geometry('800x600');\\n\\nmy $run = 1;\\n\\n$top->protocol( 'WM_DELETE_WINDOW' => sub { $run = 0; } );\\n\\nmy @letters = ( 'A' .. 'Z', 'a' .. 'z', '0' .. '9' );\\n\\nmy $canvas = $top->Canvas(\\n -background => 'black'\\n)->pack(\\n -fill => 'both',\\n -expand => 'y'\\n);\\n\\nmy $testch = $canvas->createText(\\n 100, 100,\\n -text => 'o',\\n -fill => 'black',\\n -font => $font\\n);\\n\\n$top->update;\\n\\nmy @coords = $canvas->bbox($testch);\\n\\n$canvas->delete($testch);\\n\\nmy $lwidth = $coords[2] - $coords[0];\\nmy $lheight = ( $coords[3] - $coords[1] ) * .8;\\nmy $cols = int $canvas->width / $lwidth;\\nmy $rows = int $canvas->height / $lheight;\\n\\nfor my $y ( 0 .. $rows ) {\\n for my $x ( 0 .. $cols ) {\\n $objects[$x][$y] = $canvas->createText(\\n $x * $lwidth, $y * $lheight,\\n -text => $letters[ int rand @letters ],\\n -fill => $base_color,\\n -font => $font\\n );\\n }\\n}\\n\\nmy $neo_image = $top->Photo( -data => neo() );\\n\\nmy $neo = $canvas->createImage(\\n $canvas->width / 2,\\n $canvas->height / 2,\\n -image => $neo_image\\n);\\n\\nwhile ($run) {\\n drop('Nothing Like The Matrix');\\n}\\nexit;\\n\\nMainLoop;\\n\\nsub drop {\\n my @phrase = split //, reverse shift;\\n my $x = int rand $cols;\\n my @orig;\\n for my $y ( 0 .. $rows ) {\\n $orig[$y] = $canvas->itemcget( $objects[$x][$y], '-text' );\\n }\\n for my $y ( 0 .. $rows + @phrase + $fade ) {\\n for my $letter ( 0 .. @phrase ) {\\n last if ( $y - $letter < 0 );\\n $canvas->itemconfigure(\\n $objects[$x][ $y - $letter ],\\n -text => $phrase[$letter],\\n -fill => \\\"#00FF00\\\"\\n );\\n }\\n if ( $y > @phrase ) {\\n $canvas->itemconfigure(\\n $objects[$x][ $y - @phrase ],\\n -text => $orig[ $y - @phrase ],\\n -fill => \\\"#009000\\\"\\n );\\n }\\n if ( $y > @phrase + 2 ) {\\n $canvas->itemconfigure( $objects[$x][ $y - @phrase - int ($fade / 2) ],\\n -fill => \\\"#006000\\\" );\\n $canvas->itemconfigure( $objects[$x][ $y - @phrase - $fade + 1 ],\\n -fill => $base_color );\\n }\\n last unless $run;\\n $top->after($delay);\\n neo_move();\\n $top->update;\\n }\\n}\\n\\nsub neo_move {\\n $xv += ( ( rand 2 ) - 1 > 0 ) ? 1 : -1;\\n $yv += ( ( rand 2 ) - 1 > 0 ) ? 1 : -1;\\n my ( $x, $y ) = $canvas->coords($neo);\\n $xv = -$xv if ( ( $x < 0 ) or ( $x > $canvas->width ) );\\n $yv = -$yv if ( ( $y < 0 ) or ( $y > $canvas->height ) );\\n $canvas->move( $neo, $xv, $yv );\\n}\\n\\nsub neo {\\nreturn '\\nR0lGODlhjAC1APcAAAQDBISCZEJDM8nDq6eihGJjSyQjFOzj0oSEhGRlZCktLKKkpEhNTMHFxBES\\nBFBSNDMyJJSSbOru7HFyVGt0aqm1q5OVhMnTy2RELLmzmy0UEUQiDMa1pZSEbCo4MrSVhIh0Z9jO\\ntLSljNPV1IhkSPjy3D9EPCYDBB4VHJGVlCIjHGxKTOrl3GFkVLnCuUU5LQsLCXmDesq9tk9XTBEa\\nFOXVxSEqImRUQvv37HF1dJOahZmkmOzq3Km6tMe8qEJLQJhyVIZ9Z9bFtJeEeLamlG5sVFEzIUAp\\nLKSUfGBeXN/FxBIUFHN7XF9FPiwcDD0kITc9PF5ZTk1LNFlbQ3p9ZYqMdXhqZOna1C4lHREOFOXb\\nxLesl/z6/JeNdj47JJqafLy7pZ+Vhjs+MKurlYl8dBUEBa2chNrQvBUNC9e8qkAsHIqLbGtrTH10\\nW8O6m1Q+PPXs301EMpyMhMGtpFhURNzbykU+MVBMPS8dHPTq1B4UDD0zI4qTfDo4LU5FPJKclvTm\\n3G1dTYFjVHhcXIOMhlprZKqrpFxMNJWLbEw+JF1NPqSbfGBQTKyri8XMxEQsFNbb1CYMBB8dHGRa\\nPHR9dD8xLNvNxH1tWbCelOXQvG5lVUgcEIhcTM/KrDAqFPny7bTKvLq+t3RuZC8yLk1STZRqTPz6\\n5FFeUfz+86B6XNbKt+ve1dTDrG1lTC4jFPTl1Hh1Zru2pNzUxMS0nEAWENW1qaiCaJh2aMzFtFw6\\nNImFdte9tCEcEzEsIaCchqmmlLa4tZZ7aayGdFQiHMWtnKaNfJ+blo6OiWlsZm9OQbWqjGFeTtvW\\nvFU+MszKtohuaPfu7B4VFH97XIhoZJmUfHRKNGQ6JLyafIeEbKijjBITDFZTPJWSdHJ0XIqUjGJE\\nNEQkFKySjPvy5EJFRB8lJOPm5FtkXFBYVPv59Obs5KR2XNfDvLqmnG5sXC8dFOfczK6djD4tJKSO\\njHxiXKutrMvMzNnd3CYODCQeJGVcRHx9fEkxNNTOzPz+/OTWvL+elCH5BAEAAP0ALAAAAACMALUA\\nBwj/APsJHEiwoMGDCBMqXMiwocOHECNKnEixosWLGDNq3Mixo8ePIEOKHEmypMmTKFOqXMmSJReJ\\nLxPGbEkT5EyBM2PerMmT4E6D6NJdAAasgQtHF8qNKFpOwqeeUB+iG4iqH6pyhpCJ8fCDEr0dpGio\\nUKBCGylHUweiwzHwZ1So9kJVoHTKgzYYo855+0PpBwwAKlTYsGHCnDkKlCgQqoD0goR+bt+yRGfP\\nWwJChGgAAGDDw4xxNLRtBqDNg4dxM86pAADDhjYVMbzF+AMpreSeKUbFuKCDHAAa4zzA+Du6+Oi/\\nMNCQI4eM0igxFW5HNQblD4sdNgAogMJgifHv4AGQ/7PRulAPCY+lW4yM8Ga6GD/+9FC9ZMko7+Hz\\nh18C5RylChdAkp56Gb2UU0ExwKDCDKSIpt+DEALmwSiU2GMbZAqxR2A/TwF1jDY26PbDZsSxFuGJ\\nJv6lAgM/mPNHPR1qeFtk6NSIHiT9pFNOP+gk+MMpXZVonJAofofGEsmpYNooEyrAgCEXboghTv1I\\n0MMOLuCAwwihpNOPN4Rc4OUO2lDijVjZgUdkkSSWONwSnf1ggmnjnZNCA5B4yYUEMvYkwR/nnOOB\\nCYWcQg4FFxQCgwl/hGKaNx4sIclwarJZJAza0DAKFB4sp4ACpDRAmYVTShdDWfiZthkNCoimQHY/\\n/P9Agw1orLkZkpZeCoByo4xCTqYepPBYlJLZYwMNJpggyRKBCkoiAJLcNUMhNHhHnJDKoZHrtkuQ\\ngysAOUzVZ0vHAEAJKBSsRtqE4EkyirbJDYetJNpua1ytQ+JbHHKbESLlMTTEN8qrCghnYnjJoXFk\\nvbfSa29+Cdt6bw4DSobOMcfeRYoJ9UF4JAz16QuApA4+jLDE3yWQ3oE0odPAOVD41ZqQtv6lDZIf\\nHywpfibbS9wfBY0rEjos/EFDcuL5tq/E8carc7Q9Rz3KCG+hQw8DNZMo8pB/bX1kyVGjuCYpFdOE\\nwx8mHKdmrQq7idxwtZZ45LdhP5xAhzVVIAnEKYL//C3cbTfN2ptLbF33g7bmIDRHOyUg9sJt+u1A\\n5KxlkcUSWRh+LZvyRgj5aKQQe9JLhlgbIXKB+62NwqkTHrjCrK0+uOEnU8o3a5IoQA5xJthTakr2\\nQFEcwwhvtrDCKCyxusJZyBu3Aw4s7PwS0WhjPS90R40cDfSWsdndLeWwL/H6Yaowksmt7jxrCt+8\\nevJfv9ZLH2L00UtgvKBRBgzed27vx39ZQgNY0oC9talI7QuZ+5yXHOU1EA3L44UEe7GNblChG+3o\\nRjeW0QsJ5m843juY2FhTuF0BQB+iGwk6HCfCx1lPGxI0gAqw0Ic95E8Pq6vekap3PQjEYQpVGEMG\\n/zIAhgGAgRrtoMMdBNAL2ZkMBjSoFxR2lBJHqCtXw9GGJMhhAAjQQRPt0AU28hGHF/TCFb3oBRb0\\nEA1epBEC2whCNsAgi3fY8R018EEGwgCLJPYiGiB8mBYDaAiVEOJZQ0IcBHkhhh+AMQwZcIMRs0EN\\nbAShCHRYBiZ7AYE7LKMbYQADM1ggDjiI45TiAAQzMoANbMDiDmrkhfp8RilzpAQdI7LdidKnB1cI\\nABbUyEYswCCEGsjimLgAQyy20IUgdCEMRWhFK7CxBVzIggefwAEceHBKHvDgFbLYQjayEYRJFEAA\\nnuigHvjFNM39ZRReOkk9fIMy8ERPD70QAB1g8f+LWMRCFSE4gzHfUYd31FELqvABLnCRgV/4QgQD\\nqCML4EDRim6TBweQhSpUkQFfUEMTSryDH7BAOxQtoZAnMQab9qcHFfQhCrCoAjyGiYsznEEWA73j\\nK/LwigP49B1n8EFE7ThRHlDUqBc1ak8RGosudAEbXaACLHnBvzJY1X8QQgZKkHEpNLhRCt2oQjC3\\noNCNCnSgB1jFO3wKiFf0FKNaeEdPX2HKbVK0BCWwKw5KCYc8aDQW2RABNoqQDylMyqr7858uv6OA\\nAZYEHeNAURm82oc7FIEavsjGGLYAhpratAbGjKtPferNtr6CB3nwaR62aQq+nrIEfG3tKeHAggP/\\nhMAHPlCGCKjRhju4wgH8498BW3gcFTiWJOlQACLzM1kViGEbRcAGNQgwxAwo1KbYjes7VjFab3rX\\nm241JSotKl5xmEJLfH3FO5gRghD4wwciCEIc8re/ItHAESaRQGSJa5wyaAMLdqBDASZQBV/4Ygtb\\nsO5CsXsGOx6gp6Q1Kja/6d3y8pWis8UwX7/5Ci3ENahmyIcNX/cdN5HoGIu7CAv5qzWX3mEKBWBC\\nFcaZYCIOQBUMrsFaD7BjpEq4wqfEQTa1hN7WVjTDSuXxOyzhhjbQoQ8qkOXciCSyv/yATyXRhyIl\\n0Qs7xEEKBQhAgUWA4FgIoaay+Oxa3arTI19U/7w4qBE6qmKVtQjZtXk9ak/foYUzbKGch3hB/tpH\\nZZoBoy0h4cKK1bQELMzPy3coADb44At4/GILHBiAEG6aZh3v2KentbA3xaElOc+ZznZGr5u9yVMe\\n1+AMYPBFEDRhBz18LW4lBddjGVA+SfTBDnbogwC2EWax+mIMseAAGMx6TO3e8cGAQGpFuWnqaqMC\\nFTVSNYYvytM9A3UAYaDCMrCwLPbtimG6HAXeQiKBUYTHe9rI5x3uIOwotIAK0vXFL4bIASHg+Jie\\nXit3WSBtCcMhzpCpdrXRO95SotatqeWzFo7YBilggaoH06XtBEiSevACYoy8wzbuIAYpLKMA3f/A\\nRoGzcellc/qmce0pd426YW8evEZcuHaNsL1zO6OylDX3rloPoIUMBCAfHQRkIpd7jJFwYQEQgwEv\\nBDCFkUtBwEXA9xowe+Ai2hSnnlbvWr/r44MjXOd0FojO94rKvNo8qd9c6xl8MQEB2BpealtuAkhS\\nrrVRdt53kMKLi8CEVlLj8NkgRgZwIYQ6PpvHB+h2hWlealMTRM53fi3cedDWPKSWx2DARhRc0bR6\\nQqFsHkEAwhRmAGHPWwDDLgAbqCBmpx44AwPAhSoC/o7PQ9ibBKd85RWO+U+Md5t5AES0H75TPg+g\\nC8uwwweRlh9y1GMkhyQu3NwogCX24QUCtiD/7Y2dDRurQhZacPyDIQ9xb/qU1NmU89p57vPykh21\\nD84Dn/1cgDusEW71lAIjoVIltn1YAHsCEGxSMAVZRwXOVGnZQFY+gGM39XgOBmrqdQBw8AkUFWf0\\nV21DBnRJlQes1mpExwxgEAR0MGJwox8UkEIasQNqAjctZQdiYAcCIGwMaEFQdXhdN4FpBnbapV2j\\nBXl11YFEloRrEYJHmFR2JXZaUAMDsAitYAdYIDuLZRwMsDIf8QcnA0EqEGwvAGxxQAdFUAQ86FTB\\nRAwcgGZpJlB45GlF6FME93ND9gl3SGp7JV6b93BKVgMIJQK91UHoox/kQDUhQQHLpTVguAd9//CI\\nAiAF26AJFhQErWSJ1LBvYDCBXwd2oPVsFzhRR3hhxmdKDLeH30SCfviHWsAKGdAFK6gC0ZBrt3Jc\\nHoEOpLCI7LNI8/OIcSByBZB1KrcGAYAN3AAPCdZvneaJoPWJbWZXDmdzNodKROZwO1WCEXcAr8YK\\nbpANrbAHBuBEWTgaC8BuaaMmL+RGv+ZlkohyrVQF3IAI2IAIvkAEHNBvnch7DmZHq8BNQDdbNDeN\\nQcZ2DqeK36RkfFYDIdBRRWAH4Ygv47gZ+hAS5SA84aEN1YNPeyAAcfBlMBZdUNUFawBVSJANyjaB\\nzIZTj6dk3DRtPzZtFvZzqeh5YheHWrCQ1P/QDVLQQZSCMkmQYhDxCfvVX8kRDUbZRb/4i7I3Ae9Y\\nSYdnBglWRLrHac22Y3f0DqLoj5wXbR04kEV2VJwHYXbkYXwWAspAANjQAmJwFyGUHx6AehphD+72\\nHfsDQUfpQ/MmYK1ABVXQl9TQBYdXDCIwCz5wZueHU1GImH12RwT3YD7GAxOlh0kognUllkOoBcyA\\nC7s1WAJQFm0ZHocIEqFgOsVRl9rARl0UidvwkdIQACMJmE5VkpwlBJvmeMYEiOkXcATXU6L4ZpI5\\nma4Vd2M5lmmmCluADd3wZB30meCBBqEAEgRIJKbJRm5kB4JHbGcIkoApXWYQgW14U552mwn/iVaR\\n+XZ1JQ5DloSyVUpuxWZ8RpzMcAZu0AVFIAX2ow3MCR7l+BExMDhEaT04xH3bQAf5wAZFMAEp10q2\\nF5VlpZJ3JJ549A6QKW1AZ3zpSWQXxZ4YyGOilX5nkFDUUAR9AAEqEJHG0XQegQrmwF+ThZHVU53b\\nkA9oWARtIGaWtKC4t1EqyV3e5mxYSVGAsIFEZnxxlmqfUGEQ9mBieUdpxlAhCgEd5J/6gQAfIQHn\\nWGJ2WT2O9gJgNgFMoEHG5oOJh48NhkerwAK15VauRlRaYopDOmRLCJDbNFft+VMe5mFnMAAiQJ9e\\n8Ef8oh8T6RHJtXrWY5Rc1gdxgHJUgG/U//AFHjVWs+ByDaZWWIlR6wdUY0dqXnmh2TZeHAZhasqh\\nHiYLuABYg2VDN2Oio5EDH1EOu5Nxm2GaRulGXpCo0oANa8ANh6ervkAAItBv/vZZooVRp5VWcbUK\\nGPYJmIeea2FneMiBehaqP8WkeboFBMANBQAB2DMpxSORH/EJI8IzxwFBbBQNKjA/kcaXmHV4gElj\\nHLBRFEiEPRVtxrpddqWsp1ZKRYpepYhK7ammYzmqsoCT2EAHKlAf2RMerPoRx8ALrWI76eOiesBl\\nVLeXYgUP2QAPlaax8NCGC/Vv6ueYaxqkD2Z2DFcjHIieRNZagHAAbfVTOpZ+QXgGGcBb2/8waLQ4\\nGuewbhsBDLmDK3BTqNaDBk7QB1MwAdKwBl/QCAm2BSKQDb5QDEhABNXFARP4oDrGYwNbAw+mYy1J\\neShLanNWjW3lTWtlRzDXZzY1ANlQcQbANpPzIArgOx5RASDjMBBkPfVxF2iABZalrgTQCGAABhmA\\nYJREDWYgAiKQuGS1e68GhzWgCqywe0CVtbXVm9kGp3ZmChTVbUvVbNhlnLpwCG+bWN0KGHTbEYaA\\nKUcDAJfDC9GgPGyDDwqQRvMjAD/QAu0QBDJFY4m3BUjQBWRWmELACpsWuT5ATHXkDzb1DoCApkjl\\ngXMmEDjAAsckCwfwdiWgXsf0oaogBBz/QASt4Ar4eSKSkLocQQ83gx9SF2U5exyvIQZREATIGAu+\\nAJgHhltW+72sAAaN+w7+oAoDcAYHYF44gG04kA6OYAjeoA/IcA4mYD+jYAc/EAUUIAeG4Ax1pF4h\\nwAqs4AMcgA1egHHlsxmSgIgdAQx30ZPmKgn5yWL7wkiaEARhALVbMAvEgGkffI8J5gNn4A8DkGCq\\n4FPrMAYxEAV98HEQ4l+94AewkAEeFgKdwArEQA2+RT75sQTX5xEF5ACiMRzLUk+7NArLoAtjQAC+\\nesM+gGAcwIaq0AndSAEUgAw/oAJxu0vPoiBR8AsNpgpusAhIBzb64ZwfMQIeIAklyj5i/4w4xmEA\\ny8Cu9YhgW0AMl9a0LSDI2wIyw+EEUTAHB8BRRbAHWIwwh+YR5dAdq6GqDwMDAtYO8FC4OUwMlASY\\nBXDHD7M/kxUN3oMFvtBnurAHd3Ei+8k4/UAJXnU44MELfUAHXUAE8EAERKBHT6UJShw2dTmLmKIJ\\nnSUAwLXIACCAH6E3c4LMRsILe3DOXkajcbAHvYDMIIQGsastfaAJWOAAL5x3AOAvHsEF5eABp6Bl\\n5Fwc2mAHNAwPyLgFIfoC/XM4cLMEybMZfdAOdqA0pwvOHyEolIDJPcMw2iAAuqDG/jYAv0AHSufO\\neUspYuALENAHDDDK+0IPiQgDDGBAh/+jAPjRt9DVAWZABL9An71AKVrE0NowOc3TB2AgBQ6gLHyj\\nDbaoETFBCVJaN5o8GliQCPkQBNXkDBkwAa4wGt3izbt0PDAgAM4QBN7jQHlXL1r8OwXSD1wV0P3l\\nCofQAVtwBjyAA3mQDWoA1+xDPVTVCz6gC8JlQkYyHPQAlAwREyPC18WxB9gwCwR8wKYwC1gAwyZz\\nzYCEBT4QBiR8QMSROQBQyh3BBTtgLVnA2ACwB74wADXAAlMhDqywB4ydMEgC2GFgADDcNePgO4i9\\nECPgblgV0DCwB11ARwdQIzygBYpg2Zc9HNEAAIoABvDQC225OaNBDjC9z5CwGi5dN0v/4ACODdmr\\ngIffBAKoDQO6XAa6kAHZIAAogwV0EASWAIMWgQPLgEhgzSZZUAZ90AUTeNyf0FbsgAez/Rd3kAGz\\nsAXL4CCIdSt0EAZ9zAIfgQqcrT+kIa6HEw13gAQb9Q7ZBGqMMNsA0AfvGsTtoMRykwSqAAd4dVr0\\nXRFDEA9YAG+9gOGrzD992wrZwAqysAqk1lZwsAVOMFn5zcjE4QmxoAUDjAvtMORSGgU+cG2mwAEg\\nMAcvThFD4A6VoC3xBjU+Q0LBJQl7cAki4AOWAAhAJ1eyEAjyYt1FvjQAgAUZAFRnkH660NX8UgZh\\ngG0H0AXf8ASMAAgfEQ56UAl/wWUq/+AwmeyfZRAN+PACbUBWNcCVPHBHv6AH5obPuyQkekAGdc4M\\noxoGM641vBALqPAK2LAHRmAEzXAFvb0QxhAJzy0eHSRB3Q0hmGJVesALvkbmQrBdQcpdzbjcbYNF\\nQlIGBnAHYWBNd/oOWxAHIQQDlaAI72AKSDAJ+fANG5ALSnCLYRAJ/ZNGQmvhbOJVDuAKfmCFeLAH\\nRSACrKBjaF7poAUHHCDb8IxullIGbnQHWK0K+xdXsUAHJtILsBAEld4GHB4Mm/AN6/ARclAr++Mr\\ny9Pmg/0gjd4Le2AHbSBfvPAE8XAJZGUJVwAIe7UKoKWB7FAJVsU69wxyaBQHRQAPPv9QRxnlYT6Q\\nD8QB5T7wCj4wCxKaBtVgBDLwEUNgVazRB+RgaxQvLw1emivft3aQD9yQAW2ABXjg8W0wC2lQA/3I\\ngfJeA3TFDgodCWyUOU3fX3W5667w8m3gC2BQpn2GfgNAB8SxDKrgVj6wCm1qC0bADh9BBibECx5w\\nhayz9CB0VW2uMNHQC5ow9b6gCFaPD2NOBO/u43vFAs4YecRwA3qw8ihglNFwd6yTBaDvDh7/AorQ\\nBl1Q1+g3lnVOqprQP9hAls6rrHBQC4IAD1cuEY5DVdogBiTVNvoz/AqDWGRP/GVQ6K3gCxkQX/Ml\\nQX0QBJAN9nCADnMahWtFUWdQDIr/4AQncAL3EAmRcA96QPZO4A7goAZG8A35oPrRjGO4uVa5Wedn\\n0AZ/oQeYEKHVz3ZacA3/8OoA0U/gwIEs+pSppIeXABVoHKLR5kBPNF5Yeu15cefGskBRbihSVKSL\\niFkZzLR54Y4Xrz1BMpx5BwgODnFwXr17d+DAO3GocByYA0JRHKI3LgUJw24OBx9CZNU4wOMVHDh5\\nXu3M+U7WmTOycBXRBgDLnHeqhBzAYYoHoDxp0hCEG1fu3AVooiXkZUKSHr7RKFrcE+dOvjZdfJkh\\nQCCbsi2zBoDJsAWJphe98LAMskXVOx7iPonjcUBL1gN5xOFAhUrcga6yYn5KLTB1/2ocNOFI1Zn7\\n3RlVqs6AybcEgJ8zNdIEAyHkzCqZqnahmxtdej90CQBEwwNDhQksfVdiCSwlH5sJ2BaJ2JKBw3of\\n7X1kEEFt2R7LvF4EESGkBqDan3i8Gw0nzk5DZ7bUoOuHC3QKRAWd2h6siapXJrxpK9+YGSCfsDR5\\nRRVijKCFEyRUkSkTIXCYLkW4oDnILxjy6k4hLMB74ZBtiggCG8MI2IKp9ZhqjwMRgrijFywkMSCO\\nLrbQD5BPHIQDq5y04OHJBQvkIst+fHqQS3G+BPPLmwTkiitZfNgGDQDIEEeVW+6hxZpgarGEhQNq\\nQFFFPRuI5qEy0JihEm3+6uUFO//oWKYbbHTpgpowRMjAPfc4mGUyO2asaAokOFinhpnQAW2nAN95\\npaYnt7wyNVPEKeE0miKM8DYpteDKrDMyiAMGGIxBZRc1TtjkGyA+4IDUd/LUM0U5/oykjDJgiMIP\\nhSqK54U4tsmnCFgWpcYX9GYBdxZKZyGmmHz2cAWLaHrRxIw0MvEUSkBEq6FeUlvFYUEuUK3tyxLg\\nAJMHqm7DTTQttPAnBCEGEMKZX+yAoZJ1UBGiGXCGwYAEdf6x5JVVEEx2OmQAcPZPNEiJYiVq7VAk\\nnwJa6SYIXahBjwgi2AHSB2LKvcEVJ440oB0zWKnhik9ve0WLemuACeB80VHwygX/P4FmLUCuBuQq\\nnXA6mBlmeHsMlwF82UMPWOAwJY8tbuEkGRJKEcaHmEAOea5P7AAAhjJOiCSScdoxAI8jC1Xkhnxa\\nkQaRL7LBhJgtiCCGKSF8ELKLfFzpQxMv9oBlCx9qWOUT6uBgARAAdQoBKkBOY722K3G4jfRVtsZJ\\n1HeY5moAysGIJYxt7vAB4NW0EiEVINQhYpWZ6pbOnnjydrbvUdrppSLBq1WEDsQRoQYem7eInD0f\\nZhkyjj6C+KWIO7AhxodMQu/ns3lzuo3WmFinikAHP/mEKkBWEZCAajAaWfSGFWAAAwcyEJluyaIz\\noOlJHohhi1Qk7zTMiw4/3AEA/wCgIRIaiAQ+WjCKisyoF/G4VraCsAZqEEEERAAfezhADCRc4hCt\\n+EUGihAHELAjDZuBw2fWMiYeSKU4UTnNJ3DAvyVCA2BIA2AAcXcGISwMMgvcwhZikQFckOpLB4BD\\ngV5Ri2vMgid0wyBBLsCLMpDsgxrghTnu4I4Z1TEw22hFG4IwBGqYIRswFNcMJdOGfMAiG76Ywh5u\\nsCn9xOR2ATzAK/LAFS2A8UGf4R+s/hfAp9RKd+2JzBZ+kR4fDMAS78jDqlggOuq8Iw1CeAWy0giX\\ndPSBZM66hzv00IJl1NEiT8BCH+KgvRw1ygyQAxcx2GEGarSBmN2QwkUuIQIf+P+GaWZRBVSkkofd\\nFOcVAvsS/zLZGdopjYpVnBwCMzDKLGrRB7hwDQ/UwgMEoeMdrMjE8mYpF2Po4Zb30IAeftDLdM3o\\nCSe01o2KuQh4NCaQIuhCFAKTj2Xc4QV7UEQx2tcecrUPJhRiDStgEhWnfYYqAsvaTiw0AN0lcD1b\\nEEE2tBgLMLTHNWgL4kDgcLupQGOfckHFECTBwTJEQg9iaMceLNKLJwAToYpoRRGkYUxkUmpIdnBF\\nHFrRjmjZ4Q6wMIzNwtCFYmSDA6zIJlS0oIrUcUZgS7wNIIp4ldudU3cKXGAos/ELmuICF6qQxQHC\\nOZBPAKIGsczpT+GCChb4gaj/Re2DKPrQC8piAZgzisdgEIcNJKCHGDAkhhk0EQ87FCEfXqhIL/yg\\niaMMoQOwaMU2FBGIIJghUjV4RyZ6A7oiPnEtRYxiDVTBCh+osySOE+Uoa+qM3jCjVNBg5SeukNtX\\nAOIKrFQsQdARBieUTA8QaEGRjOTLGb2ADppoQwC4QYAMEGMWW4DHIhSBhWX0rI15U8F585GPQNwB\\nCzDgoAPicIkhbCETWhDCK3Hb29iNqa68Uad7HUeEX1R4C2DwKzyvIEmAOahonygLO3yA3ewKBAe/\\ngIUd/OkOMSzjB+Ml7xMykq0AdMEM4COXCDrwAj34IQ7dvS8M+kAH2c6Xg0fW/4Md8hEEVeQBwUIg\\n2jetNi+sbOUMuCiuAtnxOCLIND2xeKcqtCDXSHrmNg6yBDxA4IMSL1YXOCqSYE4xAwgYqbJ1JO02\\nNFHjzmaRCGEIhBPEUglX6AENAC4DFjTyESw4S2/OegIGLnGGVdUgwWf4JiDsND/cWrm4CZxwFkeZ\\ngVjQ1Bk3Fc07hKeaGnAAHhwQR5vhwoFe0KEdmtDEHZaxjDpbZEZ4ADYWDtUKbFCDZlk0AzZe0MYy\\n8AIP0cgCDBziikMpwg8JUdOfNICHR3Qhljh4R4I3U92r0HWAXMEF7xS4s3aKUovLdQ0LWFAWTHeI\\nHfCQGxxkTRAufEIRSc7eHv9+0AII+NIVKuvFsIvtLZh2oRV4yBvJHKI3h0RDxpWIB3102ayiPsIH\\nr+KBcRoZyZxUGWzFzavjKjwG5Zby1DWoA1Vq0B4hEMEMHLCETLS07wTJowx6cAce9NCHdkzWl98p\\n1B1aAYJiwEME8WlDHKIBvfs+609/4gsWtFrRF7jCHWooBg+8dE+R4vYmUlrpY/Iq6r26cwB+LY6q\\naWJp4RINdDyHiwwCqod7RKISFBAAUynbCwNIAjBxCEQbOuBHM3SADYmYOlGP7Cw0PEsPtQ7CXn1R\\njDDAYxaCdVVNwn2GTJT8KlqQxVbE9h4sVjgbbUdgewYAWC3MxD9SsQS8WAD/nX3hnQs4uMQb9VCJ\\nIJhA8E9QgQokUZHAtCJHYRgrIffQJ2k/mmR5e1FpfRGLAXQFF01zGk5N8QohZOKIE1Kp6lWh9i28\\nXgS+8IVMP/121xAADIBAR2gOAEDl9R7vA6kDUXgCNYgHP4CFF6sslQEMpWsDbOAGbgiCIqCDF1gJ\\nQzs0RysDBzAAAYAFfKsDAZkQcAqTLwm5bBIQktuNEFAFZ2ApDhAlzYs/UkMgDEu9ZAiEWRiNVQAg\\nftC3/4sLOOCAIZAZSgi8wVOBlXCHi5CCZZiAAECEAGgDCaSPI+GFaNCGh7i8O+iGLvgFeHKNSPqm\\n2BnBKKmXUeGaMlm/AYiF/yxiOfjLIVJrjy4igieIB5cQAkvAwzDywbmABhbgAUO4g8mirCNMrRcQ\\njyLQozZohQLYhj0QRHIgRIqAADqAhW7xhS3oCreSNxYQnlgpots5sEfaihAgxZZ6j1+AP1/IoVLL\\nAATqoiAQnDvoAlyogd3bw+jYF1QAAwHogzrrheRLLa/SniKYADbYrzuwgxfog0rwRcp6AU3QhTDI\\nBnjoFng6AE4sIk4kmCLixqSBF6VBPa4IARa8ojHIBh2IvzHIIshAIOa6ATzoBS+wgB68xRRxgcDz\\nxeRbvoS7A2zZL5fJBykQADvoAzuwA0e0g2HqglITJfjzATASnvwhHTuJpP+ouIopSr2VQrkKQ8V0\\nzKJWBIPui4U9wIM+EANDqEfp6D1UcAQxMAAjJERhk4I7mMk4kAIik4I4MEibHIxLwIZiAIN6UYX3\\n8Jxvq42qCBUA+kBjEQ0VLBOuYMH3YLlDsoD4+8gLqylZgAfLqAQ6cIQESUmwnIsLMIGXHETlk4RC\\nsck4UMYXEAApEEgf68cCACvIGYCYUCnAEqx8SYsSkAoAST0tqIM6kAWlUcEQ6ApPkspDQsdsUEct\\nksEBkIUg+BnwgoSwTBFIoAMTgsTkw4JqIQqCLEg7EIA7EAM/0LWoKgJEDIJiiAVZuILZ2Q1ckAFZ\\nWIXOaJWdUr0zYAYrYwb/FfSNbgoBLMsAc6zKvVJHDqCpvjqDQAsmPpAlzJSLdGgBG6gsFRivXhjN\\nUYAAk7SDnCSKfIgCa7MDjHuCSkiGIYicPwsGQbgEEOgAJNgCVgCjeUtDZzgDxOQNKDM/TwKDF0zH\\nMWjFLWJFNSwCV3CFO7hM6ZQOCaAA67SzOuqFSkhGyupOMRjIFwAJO4gHYGqqJ9i2SmiCZGiGeIiH\\nSmiGEZ0tEKAGH/AHWlm/4mIphsGm/ExDyDBHx8wrdcqrLeqCOOgFK/CpgfA/BhUIdKgCG8DOpRo8\\nR1SqXhiFPpDSFzCU8vzQI6iEfTiCI2gqLo2HLX2CI9gHOjwCxOuA+fSB//fzlgyYveFCqzT0gTV8\\nPcccA3VkxciIjP+8BDuQByOdjh0gPBUgh8GjLCm10Ck1yPKshCN4Nr+wiyxw1GjQgHgQunuIhntA\\nA0zVAA1wh2YIBoiaACrghkZwgxkVgt5Qu+I8JOQU0C1iQ3V8uyGIAhnwU+kIBZdUAYvgzkIVRCm1\\nA9S8tid4tsq7ryObPGe5JWQtGWfBAx8TgG3oBmrIBjYVx6HEInNURXUktcj4BZYbJa4oBlhYULGs\\n1YGAhBnwTBuI0kKtDO1M1D54gj5Z1j9xh6DTAIB6ghWYBxAgg2KQgyGwgiZogn2IBmUtA4p4gVbo\\nAjbtDRVkvalUxY8MJf9z7NYtkAVmoIZjILFyJQgHHUTt7MXuvKg9IMhfrLwjsws8iIc3GIRpmAYQ\\n4NdwqAXQgQNoMCxVqIU0KBdNaAZgyzY9uA9S9QG0wrItGgN4iL9urdMtqNNfgIc6fc0QgAcw4Njo\\nqIJBlNJevIhktAMxIDxteJaKe4J9aIJBeAZ5+IcP+Ic5eKVX6pR62YVdEIJdyFmd/QB4CIZmQIFo\\n2IMiWIRIYQUhSLfIYMxUfD3Xm8Y6BYMz8IFsqIOqnYtQMIE6i1Kt7YMX8AM/6AMV0AMY0APDS0IN\\nvYRnEIRgKIa7/QcicIvIydlaqIVdUAIl2AWz0JlZYAVlaIVDeACRaIT/WSil/0yPwoU/x3S9pM2G\\nAWCG95AAyJULFmgBMYCAKBWDXuwDAdDJyeIFGbEzjIgDkNCEYBiC8G06diCCGdoZDsjZOfgs8t2C\\nNCBFH0ACPaIGUiUuyIip+Bve+JvTQ0rFagIz5p0Lb/iB6TVJXhSmg5xCE1LGE9oDjPhVkAAJPyic\\nQGCtIOiADugCJECCYkACIvBdIQiBTMgEMOCGLuARcDlFX+gW/tWBFrYAYwsDC5BhXxhaAI6OC2gB\\nAy5NgjRIQ6WsjLOWBubVPvjM8UJQi5ixVpiANpAGbqAmtjoDWgkBVsgAX2CvWXCD91LhFYY/auCD\\nKgDjMOYDXfAFsbHh/7nAAWOggwIWAAJORkHECENhyz6gDwiw46WaEa/7zEqwlmyZgCBYBM95U94o\\nxS24RCwWATP4Am4wtm7RgS/GBirAhhyZ5HbwBQw547mABCoQAAEwgU4eSDFQxj2ohEq43NAkyFKm\\nrAZ+0sErZT6+oTagGWUYWrSaUaJ8vcjo4iqgBh0wNjCO5G4QZliAhRZogQzQgkyeC1QABgm8gx/4\\ngTtoY9FcRj72Kh+7KD6m48sVYhM10T0Qj8ThkQsLl8aw39cjgPv9ZXSkhirAhkimgm5YzQJYBjoI\\nAq5Q5rkQBwtoATqggztAxumN3lIuSKKQYEWgUqIw6GQ8UYxTAylAnP8MPmFKaScs2gIz8KNF8IUu\\nwAYw5gYw1oVgLoICmIIp2IY4EIAwyOfm0YVT2IYHOE2tPdSE9AN//p25zIeTTgSi2Gk7wKPEQYTO\\n+haY2gLGKGoRIIBF+IIIWAN4rgJf4IN3ZoKRnoKZnAJevIMzWGnpcARKMGkp6INREOs6gwBR7gPU\\nBGg6eBkciUL0aocikORGWYRFQIIbc6GnS4/2a6dsWARuWIMAcGpq4AYqmABGpAMMRcY6C4NX2Oro\\nQIcGaAdpJuvBE9mCnEls0RZsyIaQPLUCAiyckAVWWI8ECqX0wNMser9F/mtJ/ugA6AaS/h0pXVRJ\\nUAStbuzowAELEEj/QSTU7rReKcAW50MCUoMJUpmrLzGFEniFa/KNAXCDLWiEtYOpQ+KGSHZAasAG\\neTbpO7hjLLhtPXGGGeDFZqRsn96GAggCw9iCt/MN13iHVfDDiAwNraiBENCdVpTu96sCKqACYJbn\\nAoBmIjYAXnCC71ZJE7MAEzBJQj3UbZiCIuCGbGgEIoBD/JSFD9QJbSRBraCV/GTBlsKi+FiDKqju\\nbqioTg5UXtAGA9eTUKCAwx4FBu9OB0fvbmkoz2EpC1+FOtBGqmCBMdmKD79l+PCFL6CGL6gCWCgA\\nAehOEoqGJdCGJWBxPfkDWJgBrx08i+gD4H7wNQiD+IOUUlIFLLtw/x5IBzuJIsA8g04orlLqhAHI\\nAAJ4wHbGhgIQg6WyQm3QlSlPljGgglPwgjozAC1/1imYABb6Anh42lKa0TOog2t8hw8UzA5PQ5aK\\n0+Ls678ugh+AAF5IvmiAgSzIGz5PFguIhRj4ARvwNSyAgO/cBjZYOF9oqFJ7u5AELMI0kyAXmxl9\\nDDBoBGpYgzWgginYXJUJi7yRclKvmxhgCM+cUNKkg26oAiP3hccsNTCrKVxwBpdjLixzD3Uagy8Q\\ndhMXA87VBj3PGxogB2XHID4QAF4Y9ELF0CkQ1Qes9sho1YomJb/qdfZrhC/ABiYoACkouIhQEw5S\\nd3bHIGfQBeOzM//pvYMC6G8wllb4E4ExaIRGeD1thQymXaAc1YE1KIJt6AMDMHhdSXflU3gMqgAK\\ngADsrLPqLU2J5+93XhQ+KHJfaGHHdEzF4PlHroIgWHIVoAE9PzQOWnnF2gFzGAUVsOMCNoE7mIIC\\nKIDVLIJ2iJlugIV4nngv/oIid2cqUJ9eoIFD0xsAS/oSGwNzoF4x8AATgOaZBG5p3gYiIzLYZoMi\\nEGYmIGySJngVuEJdATCkT/sS44MBFgBo9mQC7kWx5s4CJuDSvAMToPw+sAEV15WjPzIYKPwSAwMd\\naIcfSHwC7rU6OsLkA0Z4V4EBX4mIADDBN9bOl7UdAH0CJtTOVBmcSVi+JYDyc3d9BxD86jNWzpd9\\nWeODHJ7eXiAHLNDHldD95fMLv4DyhzD7wT+y4sc79eFtQmx+lYmGibDCJXgI6yd87PdB22f+XJ2R\\nI2R9vtCDKDf78jf/lCRvGFv9CrRClL/++ffTLM9V/geIfgIHEixo8CDChAoXMmzo8CHEiBInUqxo\\n8SLGjBo3cuzo8SPIkCJHkixp8iTKiQEBADs=\\n';\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\n\\nuse strict; # http://www.rosettacode.org/wiki/Matrix_Digital_Rain\\nuse warnings;\\nuse Tk;\\nuse List::Util qw( shuffle );\\n\\nmy ($rows, $cols) = (20, 40);\\nmy @text = shuffle 'a'..'z', 'A'..'Z';\\nmy $n = 0;\\n\\nmy $mw = MainWindow->new;\\n$mw->geometry( '+850+300' );\\nmy $c = $mw->Canvas( -width => $cols * 10, -height => $rows * 20,\\n -bg => 'black',\\n )->pack;\\n$c->Tk::bind('<ButtonRelease-1>' => sub { $mw->destroy } );\\n\\nmy @queue = [ 100, 0, 255, 'A' ]; # [ x, y, color, letter ]\\n$mw->after( 5, \\\\&step );\\nMainLoop;\\n\\nsub step\\n {\\n $c->delete('all');\\n my @new = [ 10 * int rand $cols, 0, 255, $text[++$n % @text] ];\\n for ( @queue )\\n {\\n my $color = $_->[2] == 255 ? '#ffffff' : sprintf '#00%02x00', $_->[2];\\n $c->createText($_->[0], $_->[1],\\n -font => '10x20', -text => $_->[3], -fill => $color );\\n $_->[2] == 255 and push @new, [ $_->[0], $_->[1] + 20, 255, $_->[3] ];\\n $_->[2] -= 13;\\n }\\n @queue = grep $_->[2] > 0 && $_->[1] < $rows * 20, @queue, @new;\\n $mw->after( 63, \\\\&step );\\n }\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\Matrix_Digital_Rain.exw\\n --</span>\\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;\\\">sushii</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- w x h of unicode char strings</span>\\n <span style=\\\"color: #000000;\\\">colours</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- \\\"\\\"\\\" of their fading colours</span>\\n <span style=\\\"color: #000000;\\\">droplets</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- w column droplets, or zeroes</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;\\\">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;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">cdcanvas</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">rain</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</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: #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;\\\">w</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">droplets</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">rand</span><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: #008080;\\\">then</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: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">droplets</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;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">sushii</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;\\\">x</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">utf32_to_utf8</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">0x30A0</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">96</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #000000;\\\">colours</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;\\\">x</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">CD_WHITE</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;\\\">y</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">clear_droplet</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">colours</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: #004600;\\\">CD_WHITE</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">colours</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: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">#00F800</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (CD_GREEN to nearest #800)</span>\\n <span style=\\\"color: #000000;\\\">clear_droplet</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #000000;\\\">y</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;\\\">while</span> <span style=\\\"color: #000000;\\\">y</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;\\\">cy</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">colours</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>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">cy</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: #000000;\\\">clear_droplet</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #000000;\\\">cy</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">#000800</span>\\n <span style=\\\"color: #000000;\\\">colours</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: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">cy</span>\\n <span style=\\\"color: #000000;\\\">y</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;\\\">if</span> <span style=\\\"color: #000000;\\\">clear_droplet</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">droplets</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;\\\">0</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;\\\">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: #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: #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: #7060A8;\\\">cdCanvasGetTextSize</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"W\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">w</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: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">dx</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">h</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: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">dy</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;\\\">sushii</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">h</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sushii</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])!=</span><span style=\\\"color: #000000;\\\">w</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">sushii</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;\\\">w</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">colours</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: #004600;\\\">CD_BLACK</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;\\\">droplets</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;\\\">w</span><span style=\\\"color: #0000FF;\\\">)</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;\\\">cdCanvasClear</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">rain</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: #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;\\\">w</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;\\\">h</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">colours</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: #008080;\\\">then</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: #000000;\\\">colours</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>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasText</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;\\\">dx</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;\\\">y</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">dy</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">sushii</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>\\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: #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;\\\">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: #7060A8;\\\">IupUpdate</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;\\\">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;\\\">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: #7060A8;\\\">IupSetGlobal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"UTF8MODE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"YES\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\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=640x480\\\"</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\\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;\\\">50</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\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=\\\"Matrix Digital Rain\\\"`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\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: #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\": \"import curses\\nimport random\\nimport time\\n\\n\\\"\\\"\\\"\\n\\nBased on C ncurses version\\n\\nhttp://rosettacode.org/wiki/Matrix_Digital_Rain#NCURSES_version\\n\\n\\\"\\\"\\\"\\n\\n\\\"\\\"\\\"\\nTime between row updates in seconds\\nControls the speed of the digital rain effect.\\n\\\"\\\"\\\"\\n\\nROW_DELAY=.0001\\n\\ndef get_rand_in_range(min, max):\\n return random.randrange(min,max+1)\\n\\ntry:\\n # Characters to randomly appear in the rain sequence.\\n chars = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']\\n\\n total_chars = len(chars)\\n\\n stdscr = curses.initscr()\\n curses.noecho()\\n curses.curs_set(False)\\n\\n curses.start_color()\\n curses.init_pair(1, curses.COLOR_GREEN, curses.COLOR_BLACK)\\n stdscr.attron(curses.color_pair(1))\\n\\n max_x = curses.COLS - 1\\n max_y = curses.LINES - 1\\n\\n\\n # Create arrays of columns based on screen width.\\n\\n # Array containing the current row of each column.\\n\\n columns_row = []\\n\\n # Array containing the active status of each column.\\n # A column draws characters on a row when active.\\n\\n columns_active = []\\n\\n for i in range(max_x+1):\\n columns_row.append(-1)\\n columns_active.append(0)\\n\\n while(True):\\n for i in range(max_x):\\n if columns_row[i] == -1:\\n # If a column is at the top row, pick a\\n # random starting row and active status.\\n columns_row[i] = get_rand_in_range(0, max_y)\\n columns_active[i] = get_rand_in_range(0, 1)\\n\\n # Loop through columns and draw characters on rows\\n\\n for i in range(max_x):\\n if columns_active[i] == 1:\\n # Draw a random character at this column's current row.\\n char_index = get_rand_in_range(0, total_chars-1)\\n #mvprintw(columns_row[i], i, \\\"%c\\\", chars[char_index])\\n stdscr.addstr(columns_row[i], i, chars[char_index])\\n else:\\n # Draw an empty character if the column is inactive.\\n #mvprintw(columns_row[i], i, \\\" \\\");\\n stdscr.addstr(columns_row[i], i, \\\" \\\");\\n\\n\\n columns_row[i]+=1\\n\\n # When a column reaches the bottom row, reset to top.\\n if columns_row[i] >= max_y:\\n columns_row[i] = -1\\n\\n # Randomly alternate the column's active status.\\n if get_rand_in_range(0, 1000) == 0:\\n if columns_active[i] == 0:\\n columns_active[i] = 1\\n else:\\n columns_active[i] = 0\\n\\n time.sleep(ROW_DELAY)\\n stdscr.refresh()\\n\\nexcept KeyboardInterrupt as err:\\n curses.endwin()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"DECLARE SUB d (p!, s!, x!, y!)\\nDIM t(80)\\nFOR i = 1 TO 80\\n t(i) = INT(-50 * RND)\\nNEXT\\ns = TIMER\\n\\nCLS\\nWHILE 1\\n FOR i = 1 TO 80\\n IF t(i) > 28 THEN t(i) = 0\\n t(i) = t(i) + 1\\n y = t(i)\\n d 0, 0, i, y - 6\\n d 2, 0, i, y - 5\\n d 2, 0, i, y - 4\\n d 10, 0, i, y - 3\\n d 10, 0, i, y - 2\\n d 11, 0, i, y - 1\\n d 0, 2, i, y\\n NEXT\\n\\n l = TIMER\\n WHILE l = TIMER\\n WEND\\nWEND\\n\\nSUB d (p, s, x, y)\\n COLOR p, s\\n IF y > 0 AND y < 24 THEN LOCATE y, x: PRINT CHR$(33 + (x * y) MOD 200);\\nEND SUB\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define codes '((Α Π) (Ѐ ѵ) (Ҋ ԯ) (Ϣ ϯ) (ｦ ﾝ) (Ⲁ ⳩) (∀ ∗) (℀ ℺) (⨀ ⫿)))\\n\\n(define (symbol->integer s) (char->integer (string-ref (symbol->string s) 0)))\\n(define (pick xs) (list-ref xs (random (length xs))))\\n\\n(define glyphs\\n (map\\n integer->char\\n (append*\\n (for/list ([c (in-list codes)])\\n (range (symbol->integer (first c)) (add1 (symbol->integer (second c))))))))\\n\\n(define palette (vector-append (vector \\\"\\\\e[38;2;255;255;255m\\\")\\n (for/vector ([n (in-range 245 29 -10)])\\n (format \\\"\\\\e[38;2;0;~a;0m\\\" n))\\n (make-vector 75 \\\"\\\\e[38;2;0;25;0m\\\")))\\n\\n(match-define (list (app (compose1 sub1 string->number) rows)\\n (app string->number cols))\\n (string-split (with-output-to-string (thunk (system \\\"stty size\\\")))))\\n\\n(define screen (for/vector ([_ (in-range (* rows cols))]) (pick glyphs)))\\n(define offsets (for/vector ([col cols]) (random (vector-length palette))))\\n\\n(display \\\"\\\\e[?25l\\\\e[48;5;232m\\\") ; hide the cursor, set the background color\\n\\n(define (main)\\n (for ([iter (in-naturals)])\\n (sleep 0.1)\\n (display \\\"\\\\e[1;1H\\\") ; reset cursor to top left\\n (for ([i (in-range 30)]) (vector-set! screen (random (* rows cols)) (pick glyphs)))\\n (for ([i (in-range rows)])\\n (for ([j (in-range cols)])\\n (display (vector-ref palette (modulo (+ (- i) iter (vector-ref offsets j))\\n (vector-length palette))))\\n (display (vector-ref screen (+ (* cols i) j))))\\n (display \\\"\\\\n\\\"))))\\n\\n(with-handlers ([exn:break? (thunk*\\n ; reset ANSI codes, reshow cursor, clear screen\\n (display \\\"\\\\e[0m\\\")\\n (display \\\"\\\\e[H\\\\e[J\\\\e[?25h\\\"))])\\n (main))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"# clean up on exit, reset ANSI codes, scroll, re-show the cursor & clear screen\\nsignal(SIGINT).tap: { print \\\"\\\\e[0m\\\", \\\"\\\\n\\\" xx 50, \\\"\\\\e[H\\\\e[J\\\\e[?25h\\\"; exit(0) }\\n\\n# a list of glyphs to use\\nmy @codes = flat 'Α' .. 'Π', 'Ѐ' .. 'ѵ', 'Ҋ' .. 'ԯ', 'Ϣ' .. 'ϯ', 'ｦ'.. 'ﾝ',\\n 'Ⲁ' .. '⳩', '∀' .. '∗', '℀' .. '℺', '⨀' .. '⫿';\\n\\n# palette of gradient ANSI foreground colors\\nmy @palette = flat \\\"\\\\e[38;2;255;255;255m\\\", (255,245 … 30).map({\\\"\\\\e[38;2;0;$_;0m\\\"}),\\n \\\"\\\\e[38;2;0;25;0m\\\" xx 75;\\n\\nmy @screen; # buffer to hold glyphs\\nmy @rotate; # palette rotation position buffer\\n\\nmy ($rows, $cols) = qx/stty size/.words; # get the terminal size\\ninit($rows, $cols); # set up the screen buffer and palette offsets\\n\\nmy $size-check;\\n\\nprint \\\"\\\\e[?25l\\\\e[48;5;232m\\\"; # hide the cursor, set the background color\\n\\nloop {\\n if ++$size-check %% 20 { # periodically check for\\n my ($r, $c) = qx/stty size/.words; # resized terminal and\\n init($r, $c) if $r != $rows or $c != $cols; # re-initialize screen buffer\\n $size-check = 0\\n }\\n print \\\"\\\\e[1;1H\\\"; # set cursor to top left\\n print join '', (^@screen).map: {\\n @rotate[$_] = (@rotate[$_] + 1) % +@palette; # rotate the palettes\\n flat @palette[@rotate[$_]], @screen[$_] # and print foreground, glyph\\n }\\n @screen[(^@screen).pick] = @codes.roll for ^30; # replace some random glyphs\\n}\\n\\nsub init ($r, $c) {\\n @screen = @codes.roll($r * $c);\\n ($rows, $cols) = $r, $c;\\n my @offset = (^@palette).pick xx $cols;\\n for ^$rows -> $row {\\n @rotate[$row * $cols ..^ $row * $cols + $cols] = @offset;\\n # for no \\\"lightning\\\" effect, add '1 + ' ↓ here: (1 + $_ % 3)\\n @offset = (^@offset).map: {(@offset[$_] - ($_ % 3)) % +@palette};\\n }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program creates/displays Matrix (the movie) digital rain; favors non-Latin chars.*/\\nsignal on halt /*allow the user to halt/stop this pgm.*/\\nparse arg pc seed . /*obtain optional arguments from the CL*/\\nif pc=='' | pc==\\\",\\\" then pc= 20 /*Not specified? Then use the default.*/\\nif datatype(seed, 'W') then call random ,,seed /*Numeric? Use seed for repeatability.*/\\nparse value scrsize() with sd sw . /*obtain the dimensions of the screen. */\\nif sd==0 then sd= 54; sd= sd - 2 + 1 /*Not defined? Then use default; adjust*/\\nif sw==0 then sw= 80; sw= sw - 1 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nlowC= c2d(' ') + 1 /*don't use any characters ≤ a blank.*/\\n@.= ' ' /*PC is the % new Matric rain streams.*/\\ncloud= copies(@., sw) /*the cloud, where matrix rain is born.*/\\ncls= 'CLS' /*DOS command used to clear the screen.*/\\n do forever; call nimbus /*define bottom of cloud (the drops). */\\n call rain /*generate rain, display the raindrops.*/\\n end /*j*/\\nhalt: exit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nrain: do a=sd by -1 for sd-1; _= a-1; @.a= @._; end; call fogger; return\\nshow: cls; @.1= cloud; do r=1 for sd; say strip(@.r, 'T'); end /*r*/; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nnimbus: if random(, 100)<pc then call mist /*should this be a new rain stream ? */\\n else call unmist /*should any of the rain streams cease?*/\\n return /*note: this subroutine may pass──►MIST*/\\n if random(, 100)<pc then return /*should this be a new rain stream ? */\\n ?= random(1, sw) /*pick a random rain cloud position. */\\n if substr(cloud,?,1)\\\\==' ' then return /*Is cloud position not a blank? Return*/\\n/*───── ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ────────────────────────────────────────────────────*/\\nmist: ?= random(1, sw) /*obtain a random column in cloud. */\\n if substr(cloud,?,1)\\\\==' ' then return /*if this stream is active, return. */\\n if random(, 100)<pc then return /*should this be a new rain stream ? */\\n cloud= overlay(drop(), cloud, ?) /*seed cloud with new matrix rain drop.*/\\n return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nunmist: ?= random(1, sw) /*obtain a random column in cloud. */\\n if substr(cloud,?,1) ==' ' then return /*if this stream is dry, return. */\\n if random(, 100)>pc then return /*should this be a new dry stream ? */\\n cloud= overlay(' ', cloud, ?); return /*seed cloud with new matrix rain drop.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ndrop: Lat= random(1, 4) /*Now, chose a matrix rain stream char.*/\\n tChr= 254; if Lat==1 then tChr= 127 /*choose the type of rain stream char.*/\\n return d2c( random(lowC, tChr) ) /*Lat = 1? This favors Latin letters.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nfogger: do f=1 for sw /*display a screen full of rain streams*/\\n if substr(cloud, f, 1) \\\\== ' ' then cloud= overlay( drop(), cloud, f)\\n end /*f*/; call show; return /* [↑] if raindrop, then change drop. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"[package]\\nname = \\\"matrix-digital-rain\\\"\\nversion = \\\"0.1.0\\\"\\nedition = \\\"2021\\\"\\n\\n[dependencies]\\ntermion = \\\"1.5.6\\\"\\nrand = \\\"0.8.5\\\"\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"#![warn(clippy::pedantic)] // make sure that clippy is even more annoying\\n\\nuse rand::prelude::{ThreadRng, SliceRandom};\\nuse rand::{thread_rng, Rng};\\nuse termion::{color::Rgb};\\nuse termion::input::TermRead;\\nuse termion::raw::IntoRawMode;\\nuse std::sync::mpsc::{channel, TryRecvError};\\nuse std::thread;\\nuse std::{io::{Write, stdout, stdin}, iter::repeat, time::Duration};\\n\\n/// Character pool to pick from\\n/// If your terminal is struggling with that choice, replace them by ordinary latin characters.\\n/// There's currently no nicer way to initialize constant array in Rust\\nconst CHARS: [char; 322] = [\\n 'M', 'Ї', 'Љ', 'Њ', 'Ћ', 'Ќ', 'Ѝ', 'Ў', 'Џ', 'Б', 'Г', 'Д', 'Ж', 'И', 'Й', 'Л', 'П', 'Ф', 'Ц', 'Ч', 'Ш', 'Щ', 'Ъ',\\n 'Ы', 'Э', 'Ю', 'Я', 'в', 'д', 'ж', 'з', 'и', 'й', 'к', 'л', 'м', 'н', 'п', 'т', 'ф', 'ц', 'ч', 'ш', 'щ', 'ъ', 'ы',\\n 'ь', 'э', 'ю', 'я', 'ѐ', 'ё', 'ђ', 'ѓ', 'є', 'ї', 'љ', 'њ', 'ћ', 'ќ', 'ѝ', 'ў', 'џ', 'Ѣ', 'ѣ', 'ѧ', 'Ѯ', 'ѱ', 'Ѳ',\\n 'ѳ', 'ҋ', 'Ҍ', 'ҍ', 'Ҏ', 'ҏ', 'Ґ', 'ґ', 'Ғ', 'ғ', 'Ҕ', 'ҕ', 'Җ', 'җ', 'Ҙ', 'ҙ', 'Қ', 'қ', 'ҝ', 'ҟ', 'ҡ', 'Ң', 'ң',\\n 'Ҥ', 'ҥ', 'ҩ', 'Ҫ', 'ҫ', 'Ҭ', 'ҭ', 'Ұ', 'ұ', 'Ҳ', 'ҳ', 'ҵ', 'ҷ', 'ҹ', 'Һ', 'ҿ', 'Ӂ', 'ӂ', 'Ӄ', 'ӄ', 'ӆ', 'Ӈ', 'ӈ',\\n 'ӊ', 'Ӌ', 'ӌ', 'ӎ', 'Ӑ', 'ӑ', 'Ӓ', 'ӓ', 'Ӕ', 'ӕ', 'Ӗ', 'ӗ', 'Ә', 'ә', 'Ӛ', 'ӛ', 'Ӝ', 'ӝ', 'Ӟ', 'ӟ', 'ӡ', 'Ӣ', 'ӣ',\\n 'Ӥ', 'ӥ', 'Ӧ', 'ӧ', 'Ө', 'ө', 'Ӫ', 'ӫ', 'Ӭ', 'ӭ', 'Ӯ', 'ӯ', 'Ӱ', 'ӱ', 'Ӳ', 'ӳ', 'Ӵ', 'ӵ', 'Ӷ', 'ӷ', 'Ӹ', 'ӹ', 'Ӻ',\\n 'ӽ', 'ӿ', 'Ԁ', 'ԍ', 'ԏ', 'Ԑ', 'ԑ', 'ԓ', 'Ԛ', 'ԟ', 'Ԧ', 'ԧ', 'Ϥ', 'ϥ', 'ϫ', 'ϭ', 'ｩ', 'ｪ', 'ｫ', 'ｬ', 'ｭ', 'ｮ', 'ｯ',\\n 'ｰ', 'ｱ', 'ｲ', 'ｳ', 'ｴ', 'ｵ', 'ｶ', 'ｷ', 'ｸ', 'ｹ', 'ｺ', 'ｻ', 'ｼ', 'ｽ', 'ｾ', 'ｿ', 'ﾀ', 'ﾁ', 'ﾂ', 'ﾃ', 'ﾄ', 'ﾅ', 'ﾆ',\\n 'ﾇ', 'ﾈ', 'ﾉ', 'ﾊ', 'ﾋ', 'ﾌ', 'ﾍ', 'ﾎ', 'ﾏ', 'ﾐ', 'ﾑ', 'ﾒ', 'ﾓ', 'ﾔ', 'ﾕ', 'ﾖ', 'ﾗ', 'ﾘ', 'ﾙ', 'ﾚ', 'ﾛ', 'ﾜ', 'ﾝ',\\n 'ⲁ', 'Ⲃ', 'ⲃ', 'Ⲅ', 'Γ', 'Δ', 'Θ', 'Λ', 'Ξ', 'Π', 'Ѐ', 'Ё', 'Ђ', 'Ѓ', 'Є', 'ⲉ', 'Ⲋ', 'ⲋ', 'Ⲍ', 'ⲍ', 'ⲏ', 'ⲑ', 'ⲓ',\\n 'ⲕ', 'ⲗ', 'ⲙ', 'ⲛ', 'Ⲝ', 'ⲝ', 'ⲡ', 'ⲧ', 'ⲩ', 'ⲫ', 'ⲭ', 'ⲯ', 'ⳁ', 'Ⳉ', 'ⳉ', 'ⳋ', 'ⳤ', '⳥', '⳦', '⳨', '⳩', '∀', '∁',\\n '∂', '∃', '∄', '∅', '∆', '∇', '∈', '∉', '∊', '∋', '∌', '∍', '∎', '∏', '∐', '∑', '∓', 'ℇ', 'ℏ', '℥', 'Ⅎ', 'ℷ', '⩫',\\n '⨀', '⨅', '⨆', '⨉', '⨍', '⨎', '⨏', '⨐', '⨑', '⨒', '⨓', '⨔', '⨕', '⨖', '⨗', '⨘', '⨙', '⨚', '⨛', '⨜', '⨝', '⨿', '⩪',\\n ];\\n\\n/// convert a brightness value to a green-ish gradient color\\nfn color(brightness: u8) -> Rgb {\\n let v = f32::from(brightness) / 255.0;\\n let r = v.powi(7);\\n let g = v.powi(1);\\n let b = v.powi(4);\\n // r, g, b will be in 0.0..=1.0 so there's no risk of exceeding the u8's range\\n #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]\\n Rgb ((r * 255.0).round() as u8, (g * 255.0).round() as u8, (b * 255.0).round() as u8)\\n}\\n\\n/// A single character on the screen with its current brightness\\n#[derive(Clone, Copy)]\\nstruct Symbol {\\n char: char,\\n brightness: u8,\\n}\\n\\n/// Start with a black space by default\\nimpl Default for Symbol {\\n fn default() -> Self {\\n Self { char: ' ', brightness: 0 }\\n }\\n}\\n\\nimpl Symbol {\\n /// output the colored symbol at the current cursor position\\n fn print<W: Write>(self, out: &mut W) {\\n write!(out, \\\"{}{}\\\", termion::color::Fg(color(self.brightness)), self.char).unwrap();\\n }\\n\\n /// reduce the brightness of the symbol by a certain amount and make sure the value doesn't underrun\\n fn darken(&mut self) {\\n self.brightness = self.brightness.saturating_sub(10);\\n }\\n\\n /// replace the character for this symbol and bring it to full brightness\\n fn set(&mut self, char: char) {\\n self.char = char;\\n self.brightness = 255;\\n }\\n}\\n\\n/// a single column of symbols\\n#[derive(Clone)]\\nstruct Column {\\n symbols: Vec<Symbol>,\\n}\\n\\nimpl Column {\\n /// create a new column with a given height\\n fn new(height: usize) -> Self {\\n Self {\\n symbols: vec![Symbol::default(); height],\\n }\\n }\\n\\n /// print out a single colored symbol of this column\\n fn print_symbol<W: Write>(&self, out: &mut W, row: usize) {\\n self.symbols[row].print(out);\\n }\\n\\n /// reduce the brightness of the entire column\\n fn darken(&mut self) {\\n self.symbols.iter_mut().for_each(Symbol::darken);\\n }\\n\\n fn set(&mut self, row: usize, char: char) {\\n self.symbols[row].set(char);\\n }\\n}\\n\\n/// Current position of a _falling symbol_\\nstruct Droplet {\\n /// For the start of the animation we want to be able to place the symbol _above_ the screen,\\n /// that's we need negative row values as well.\\n row: isize,\\n col: usize,\\n}\\n\\nimpl Droplet {\\n /// create a new Droplet at a random location somewhere above the actual screen\\n fn new_random(rng: &mut ThreadRng, width: usize, height: usize) -> Self {\\n // the height of the terminal is expected lie within a sane range of this type\\n #[allow(clippy::cast_possible_wrap)]\\n Self {\\n row: -(rng.gen_range(0..height) as isize),\\n col: rng.gen_range(0..width),\\n }\\n }\\n\\n /// move the droplet down by one row\\n /// if it hits the bottom row, move it back up to a random column\\n fn update(&mut self, width: usize, height: usize) {\\n self.row += 1;\\n // the height of the terminal is expected lie within a sane range of this type\\n #[allow(clippy::cast_possible_wrap)]\\n if self.row >= height as isize {\\n let mut rng = thread_rng();\\n self.col = rng.gen_range(0..width);\\n self.row = 0;\\n }\\n }\\n}\\n\\n/// The entire screen filled with colored symbols\\nstruct Screen {\\n width: usize,\\n height: usize,\\n columns: Vec<Column>,\\n droplets: Vec<Droplet>,\\n}\\n\\nimpl Screen {\\n\\n /// create a new empty screen with the given dimensions\\n fn new(width: usize, height: usize) -> Self {\\n let mut rng = thread_rng();\\n Self {\\n width,\\n height,\\n columns: repeat(Column::new(height)).take(width).collect(),\\n droplets: (0..width).map(|_| Droplet::new_random(&mut rng, width, height)).collect(),\\n }\\n }\\n\\n /// print the entire screen to the terminal\\n fn print<W: Write>(&self, out: &mut W) {\\n for row in 0..self.height {\\n for column in &self.columns {\\n column.print_symbol(out, row);\\n }\\n write!(out, \\\"\\\\r\\\\n\\\").unwrap();\\n }\\n }\\n\\n // make all droplets fall down by one row\\n fn update_droplets(&mut self) {\\n let mut rng = thread_rng();\\n for droplet in &mut self.droplets {\\n droplet.update(self.width, self.height);\\n if let Ok(row) = droplet.row.try_into() {\\n let ch = CHARS.choose(&mut rng).copied().unwrap_or(' ');\\n self.columns[droplet.col].set(row, ch);\\n }\\n }\\n }\\n\\n // reduce the brightness of all symbols in this screen\\n fn darken(&mut self) {\\n self.columns.iter_mut().for_each(Column::darken);\\n }\\n\\n}\\n\\nfn main() {\\n // create the screen with the terminal's dimensions (omit the last row to prevent auto-scrolling)\\n let (width, height) = termion::terminal_size().unwrap();\\n let mut screen = Screen::new(width as usize, height as usize - 1);\\n\\n // create a channel which allows to send stuff between thread boundaries\\n let (tx, rx) = channel();\\n\\n // spawn a new thread which will blockingly wait for a key to be pressed\\n thread::spawn(move || {\\n stdin().keys().next();\\n // send something down the channel to notify the main thread that a key has been pressed\\n tx.send(()).expect(\\\"Could not send signal on channel.\\\");\\n });\\n\\n // get write access to the terminal\\n let mut stdout = stdout().into_raw_mode().unwrap();\\n\\n // clear the screen and hide the cursor\\n write!(stdout, \\\"{}{}\\\", termion::clear::All, termion::cursor::Hide).unwrap();\\n\\n // continue while no key has been pressed (i.e. the notification channel is empty)\\n while rx.try_recv() == Err(TryRecvError::Empty) {\\n // move cursor to the top left and set background color to black\\n write!(stdout, \\\"{}{}\\\", termion::cursor::Goto(1, 1), termion::color::Bg(termion::color::Rgb(0, 0, 0))).unwrap();\\n\\n // screen update\\n screen.print(&mut stdout);\\n screen.darken();\\n screen.update_droplets();\\n // make sure the terminal updates _now_\\n stdout.flush().unwrap();\\n\\n // slow down animation\\n std::thread::sleep(Duration::from_millis(50));\\n }\\n\\n // reset Terminal back to normal\\n write!(stdout, \\\"{}\\\", termion::style::Reset).unwrap();\\n write!(stdout, \\\"{}\\\", termion::clear::All).unwrap();\\n write!(stdout, \\\"{}\\\", termion::cursor::Goto(1, 1)).unwrap();\\n write!(stdout, \\\"{}\\\", termion::cursor::Show).unwrap();\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"SUB d (p,s,x,y)\\n SET COLOR p\\n SET BACKGROUND COLOR s\\n\\n IF y > 0 AND y < 24 THEN\\n SET CURSOR y, x\\n PRINT CHR$(33+REMAINDER((x*y),200));\\n END IF\\nEND SUB\\n\\nDIM t(80)\\nFOR i = 1 TO 80\\n LET t(i) = INT(-50*RND)\\nNEXT i\\nLET s = TIME\\n\\nCLEAR\\nDO\\n FOR i = 1 TO 80\\n IF t(i) > 28 THEN LET t(i) = 0\\n LET t(i) = t(i)+1\\n LET y = t(i)\\n CALL d (0, 0, i, y-6)\\n CALL d (2, 0, i, y-5)\\n CALL d (2, 0, i, y-4)\\n CALL d (10, 0, i, y-2)\\n CALL d (11, 0, i, y-1)\\n CALL d (0, 2, i, y)\\n NEXT i\\n LET l = TIME\\n DO WHILE l = TIME\\n LOOP\\nLOOP\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"import \\\"dome\\\" for Window\\nimport \\\"graphics\\\" for Canvas, Color, Font\\nimport \\\"random\\\" for Random\\n\\nvar Rand = Random.new()\\n\\nclass MatrixDigitalRain {\\n construct new(width, height) {\\n Window.resize(width, height)\\n Canvas.resize(width, height)\\n Window.title = \\\"Matrix digital rain\\\"\\n Font.load(\\\"Mem12\\\", \\\"memory.ttf\\\", 24)\\n Canvas.font = \\\"Mem12\\\"\\n }\\n\\n letter(x, y, r, g, b) {\\n if (y < 0 || y >= _my) return\\n var col = Color.rgb(r, g, b)\\n var c = String.fromByte(_scr[x][y])\\n Canvas.print(c, x * 12.8 , y * 12.8 , col)\\n }\\n\\n init() {\\n _mx = 50\\n _my = 42\\n _scr = List.filled(_mx, null)\\n for (x in 0..._mx) {\\n _scr[x] = List.filled(_my, 0)\\n for (y in 0..._my) _scr[x][y] = Rand.int(33, 128)\\n }\\n _ms = 50\\n _sx = List.filled(_ms, 0)\\n _sy = List.filled(_ms, 0)\\n }\\n\\n update() {\\n for (a in 0..._ms) {\\n _sx[a] = Rand.int(_mx)\\n _sy[a] = Rand.int(_my)\\n }\\n }\\n\\n draw(alpha) {\\n for (s in 0..._ms) {\\n var x = _sx[s]\\n var y = _sy[s]\\n letter(x, y, 0, 255, 0)\\n y = y - 1\\n letter(x, y, 0, 200, 0)\\n y = y - 1\\n letter(x, y, 0, 150, 0)\\n y = y - 1\\n if (y*12.8 + 3 < 0) y = 0\\n var c = Color.rgb(0, 0, 0)\\n Canvas.rectfill(x*12.8, y*12.8 + 3, 13, 14, c)\\n letter(x, y, 0, 70, 0)\\n y = y - 24\\n if (y*12.8 + 3 < 0) y = 0\\n Canvas.rectfill(x*12.8, y*12.8 + 3, 13, 14, c)\\n }\\n for (s in 0..._ms) {\\n if (Rand.int(1, 6) == 1) _sy[s] = _sy[s] + 1\\n if (_sy[s] > _my + 25) {\\n _sy[s] = 0\\n _sx[s] = Rand.int(_mx)\\n }\\n }\\n }\\n}\\n\\nvar Game = MatrixDigitalRain.new(640, 550)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"open window 640,512,\\\"swiss12\\\"\\nbackcolor 0,0,0\\nclear window\\nmx=50\\nmy=42\\ndim scr(mx,my)\\nfor y=0 to my\\n for x=0 to mx\\n scr(x,y)=int(ran(96)+33)\\n next x\\nnext y\\nms=50\\ndim sx(ms)\\ndim sy(ms)\\nfor a=1 to ms\\n sx(a)=int(ran(mx))\\n sy(a)=int(ran(my))\\nnext a\\ndo\\n for s=1 to ms\\n x=sx(s)\\n y=sy(s)\\n\\n letter(0,255,0)\\n y=y-1\\n\\n letter(0,200,0)\\n y=y-1\\n\\n letter(0,150,0)\\n y=y-1\\n\\n color 0,0,0\\n fill rect x*12.8-1,y*12.8+4 to x*12.8+12,y*12.8-10\\n letter(0,70,0)\\n y=y-24\\n\\n color 0,0,0\\n fill rect x*12.8-1,y*12.8+4 to x*12.8+12,y*12.8-10\\n next s\\n for s=1 to ms\\n if int(ran(5)+1)=1 sy(s)=sy(s)+1\\n if sy(s)>my+25 then\\n sy(s)=0\\n sx(s)=int(ran(mx))\\n end if\\n next s\\nloop\\n\\nsub letter(r,g,b)\\n if y<0 or y>my return\\n c=scr(x,y)\\n color r,g,b\\n text x*12.8,y*12.8,chr$(c)\\nend sub\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"var [const] codes=Walker.chain( // a bunch of UTF non ascii chars\\n [0x0391..0x03a0], [0x03a3..0x0475], [0x0400..0x0475],\\n [0x048a..0x052f], [0x03e2..0x03ef], [0x2c80..0x2ce9],\\n [0x2200..0x2217], [0x2100..0x213a], [0x2a00..0x2aff])\\n\\t .apply(fcn(utf){ utf.toString(-8) }), // jeez this is lame\\n codeSz=codes.len(),\\t// 970\\n c=L(\\\"\\\\e[38;2;255;255;255m\\\",[255..30,-15].apply(\\\"\\\\e[38;2;0;%d;0m\\\".fmt),\\n (250).pump(List,T(Void,\\\"\\\\e[38;2;0;25;0m\\\"))).flatten(),\\n csz=c.len(); // 267, c is ANSI escape code fg colors: 38;2;<r;g;b>m\\n\\n// query the ANSI terminal\\nrows,cols := System.popen(\\\"stty size\\\",\\\"r\\\").readln().split().apply(\\\"toInt\\\");\\n\\no,s,fg := buildScreen(rows,cols);\\nssz:=s.len();\\n\\nprint(\\\"\\\\e[?25l\\\\e[48;5;232m\\\"); // hide the cursor, set background color to dark\\nwhile(1){\\t\\t // ignore screen resizes\\n print(\\\"\\\\e[1;1H\\\");\\t // move cursor to 1,1\\n foreach n in (ssz){\\t // print a screen full\\n print( c[fg[n]], s[n] ); // forground color, character\\n fg[n]=(fg[n] + 1)%csz; // fade to black\\n }\\n do(100){ s[(0).random(ssz)]=codes[(0).random(codeSz)] } // some new chars\\n Atomic.sleep(0.1);\\t // frame rate for my system, up to 200x41 terminal\\n}\\n\\nfcn buildScreen(rows,cols){ // build a row major array as list\\n // s --> screen full of characters\\n s:=(rows*cols).pump(List(), fcn{ codes[(0).random(codeSz)]});\\n // array fb-->( fg color, fg ..) where fg is an ANSI term 48;5;<n>m color\\n fg:=List.createLong(s.len(),0);\\n o:=csz.pump(List()).shuffle()[0,cols]; // cols random #s\\n foreach row in (rows){\\t\\t // set fg indices\\n foreach col in (cols){ fg[row*cols + col] = o[col] }\\n o=o.apply(fcn(n){ n-=1; if(n<0) n=csz-1; n%csz }); // fade out\\n }\\n return(o,s,fg);\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"10 CLEAR 61999\\n20 BORDER 0: POKE 23624,4: POKE 23693,0: CLS: REM easier than \\\"bright 0: flash 0: ink 0: paper 0\\\"\\n30 PRINT INK 4; FLASH 1;\\\"Initialising\\\": GO SUB 9000: LET m=USR 62000: CLS: REM set up and run machine code; USR is the call function\\n40 DIM s(32,2): REM current top and bottom of character sequence for each of the 32 spaces across the screen\\n\\n50 FOR x=1 TO 32: REM main loop\\n60 IF s(x,1)=0 AND RND>.95 THEN LET s(x,1)=1: LET s(x,2)=2: GO SUB 4000: GO SUB 3000: GO TO 80: REM start a new column; decrease the .95 modifier for a busier - but slower - screen\\n70 IF s(x,2)>0 THEN GO SUB 1000\\n80 NEXT x\\n90 FOR l=1 TO 10: REM matrix code switches existing glyphs occasionally\\n100 LET x=INT (RND*22): LET y=INT (RND*32)\\n110 IF PEEK (22528+32*x+y)=0 THEN GO TO 140: REM no point updating a blank space\\n120 GO SUB 4000\\n130 PRINT AT x,y; INK 8; BRIGHT 8;CHR$ (33+RND*95): REM ink 8 and bright 8 tells it to keep the cell's existing ink and bright values\\n140 NEXT l\\n150 GO TO 50\\n\\n999 REM continue an existing column\\n1000 LET s(x,2)=s(x,2)+1\\n1010 IF s(x,2)<21 THEN GO SUB 3000\\n1020 IF s(x,2)>12 THEN LET s(x,1)=s(x,1)+1\\n1030 LET k=2\\n1040 GO SUB 2000\\n1050 LET k=6\\n1060 GO SUB 2000\\n1070 LET k=12\\n1080 GO SUB 2000\\n1090 IF s(x,1)=22 THEN LET s(x,1)=0: LET s(x,2)=0\\n1100 RETURN\\n\\n1999 REM update colour\\n2000 LET a=22527+x+32*(s(x,2)-k)\\n2010 LET c=PEEK a\\n2020 IF c=4 THEN POKE a,0\\n2030 IF c=68 THEN POKE a,4\\n2040 IF c=71 THEN POKE a,68: REM this poke could be done with 'print at s(x,2)-k-1,x-1; ink 4; bright 1; over 1; \\\" \\\" ' but poking is FAR easier, especially considering the above pokes would be similar\\n2050 RETURN\\n\\n2999 REM new character at bottom of column\\n3000 PRINT AT s(x,2)-1,x-1; INK 7; BRIGHT 1;CHR$ (33+RND*95)\\n3010 RETURN\\n\\n3999 REM select character set\\n4000 POKE 23607,242+3*INT (RND*4): REM the spectrum character set is pointed to by the two-byte system value CHARS at 23606 and 23607, so repoking this selects a new character set - the machine code below has created four copies of the character set at suitable locations\\n4010 RETURN\\n\\n8999 REM machine code routine to create multiple character sets\\n9000 RESTORE 9800\\n9010 LET h$=\\\"0123456789ABCDEF\\\"\\n9020 LET o=62000\\n9030 IF PEEK o=33 AND PEEK 62121=201 THEN RETURN: REM saves storing it all again if the machine code is already there\\n9040 READ a$\\n9050 IF a$=\\\"eof\\\" THEN RETURN\\n9060 FOR x=1 TO 8\\n9070 LET n=0\\n9080 LET s=(x*2)-1\\n9090 LET t=s+1\\n9100 FOR m=1 TO 16\\n9110 IF h$(m)=a$(s) THEN LET n=n+16*(m-1)\\n9120 IF h$(m)=a$(t) THEN LET n=n+m-1\\n9130 NEXT m\\n9140 POKE o,n\\n9150 LET o=o+1\\n9160 NEXT x\\n9170 GO TO 9040\\n\\n9800 DATA \\\"21003D1100F30100\\\"\\n9810 DATA \\\"03EDB02100F31100\\\"\\n9820 DATA \\\"F6010009EDB01100\\\"\\n9830 DATA \\\"F901FF051A6F0707\\\"\\n9840 DATA \\\"ADE6AAAD6F070707\\\"\\n9850 DATA \\\"CB0DADE666AD1213\\\"\\n9860 DATA \\\"0B78B120E721FFF5\\\"\\n9870 DATA \\\"010000E5CD8BF2E1\\\"\\n9880 DATA \\\"E5CD8BF2E1E5CD8B\\\"\\n9890 DATA \\\"F2E1CD8BF2232323\\\"\\n9900 DATA \\\"23AF470C79FEC0C2\\\"\\n9910 DATA \\\"6BF2C9E5D1043E09\\\"\\n9920 DATA \\\"90835F8A93577885\\\"\\n9930 DATA \\\"6F8C95671AE521AA\\\"\\n9940 DATA \\\"F277E17E123AAAF2\\\"\\n9950 DATA \\\"77C9000000000000\\\"\\n9960 DATA \\\"eof\\\"\\n\\n9999 POKE 23606,0: POKE 23607,60: INK 4: REM reset to default character set and colour if you get lost\\n\",\n \"language\": \"ZX-Spectrum-Basic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Matrix-digital-rain"}}},{"rowIdx":471,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Matrix_multiplication\nnote: Matrices\n","language":"00-META"},{"code":";Task:\nMultiply two matrices together. \n\nThey can be of any dimensions, so long as the number of columns of the first matrix is equal to the number of rows of the second matrix.\n<br><br>\n\n","language":"00-TASK"},{"code":"F matrix_mul(m1, m2)\n assert(m1[0].len == m2.len)\n V r = [[0.0] * m2[0].len] * m1.len\n L(j) 0 .< m1.len\n L(i) 0 .< m2[0].len\n V s = 0.0\n L(k) 0 .< m2.len\n s += m1[j][k] * m2[k][i]\n r[j][i] = s\n R r\n\nF to_str(m)\n V result = ‘([’\n L(r) m\n I result.len > 2\n result ‘’= \"]\\n [\"\n L(val) r\n result ‘’= ‘#5.2’.format(val)\n R result‘])’\n\nV a = [[1.0, 1.0, 1.0, 1.0],\n [2.0, 4.0, 8.0, 16.0],\n [3.0, 9.0, 27.0, 81.0],\n [4.0, 16.0, 64.0, 256.0]]\n\nV b = [[ 4.0, -3.0 , 4/3.0, -1/4.0],\n [-13/3.0, 19/4.0, -7/3.0, 11/24.0],\n [ 3/2.0, -2.0 , 7/6.0, -1/4.0],\n [ -1/6.0, 1/4.0, -1/6.0, 1/24.0]]\n\nprint(to_str(a))\nprint(to_str(b))\nprint(to_str(matrix_mul(a, b)))\nprint(to_str(matrix_mul(b, a)))\n","language":"11l"},{"code":"* Matrix multiplication 06/08/2015\nMATRIXRC CSECT Matrix multiplication\n USING MATRIXRC,R13\nSAVEARA B STM-SAVEARA(R15)\n DC 17F'0'\nSTM STM R14,R12,12(R13)\n ST R13,4(R15)\n ST R15,8(R13)\n LR R13,R15\n LA R7,1 i=1\nLOOPI1 CH R7,M do i=1 to m (R7)\n BH ELOOPI1\n LA R8,1 j=1\nLOOPJ1 CH R8,P do j=1 to p (R8)\n BH ELOOPJ1\n LR R1,R7 i\n BCTR R1,0\n MH R1,P\n LR R6,R8 j\n BCTR R6,0\n AR R1,R6\n SLA R1,2\n LA R6,0\n ST R6,C(R1) c(i,j)=0\n LA R9,1 k=1\nLOOPK1 CH R9,N do k=1 to n (R9)\n BH ELOOPK1\n LR R1,R7 i\n BCTR R1,0\n MH R1,P\n LR R6,R8 j\n BCTR R6,0\n AR R1,R6\n SLA R1,2\n L R2,C(R1) R2=c(i,j)\n LR R10,R1 R10=offset(i,j)\n LR R1,R7 i\n BCTR R1,0\n MH R1,N\n LR R6,R9 k\n BCTR R6,0\n AR R1,R6\n SLA R1,2\n L R3,A(R1) R3=a(i,k)\n LR R1,R9 k\n BCTR R1,0\n MH R1,P\n LR R6,R8 j\n BCTR R6,0\n AR R1,R6\n SLA R1,2\n L R4,B(R1) R4=b(k,j)\n LR R15,R3 a(i,k)\n MR R14,R4 a(i,k)*b(k,j)\n LR R3,R15\n AR R2,R3 R2=R2+a(i,k)*b(k,j)\n ST R2,C(R10) c(i,j)=c(i,j)+a(i,k)*b(k,j)\n LA R9,1(R9) k=k+1\n B LOOPK1\nELOOPK1 LA R8,1(R8) j=j+1\n B LOOPJ1\nELOOPJ1 LA R7,1(R7) i=i+1\n B LOOPI1\nELOOPI1 MVC Z,=CL80' ' clear buffer\n LA R7,1\nLOOPI2 CH R7,M do i=1 to m\n BH ELOOPI2\n LA R8,1\nLOOPJ2 CH R8,P do j=1 to p\n BH ELOOPJ2\n LR R1,R7 i\n BCTR R1,0\n MH R1,P\n LR R6,R8 j\n BCTR R6,0\n AR R1,R6\n SLA R1,2\n L R6,C(R1) c(i,j)\n LA R3,Z\n AH R3,IZ\n XDECO R6,W\n MVC 0(5,R3),W+7 output c(i,j)\n LH R3,IZ\n LA R3,5(R3)\n STH R3,IZ\n LA R8,1(R8) j=j+1\n B LOOPJ2\nELOOPJ2 XPRNT Z,80 print buffer\n MVC IZ,=H'0'\n LA R7,1(R7) i=i+1\n B LOOPI2\nELOOPI2 L R13,4(0,R13)\n LM R14,R12,12(R13)\n XR R15,R15\n BR R14\nA DC F'1',F'2',F'3',F'4',F'5',F'6',F'7',F'8' a(4,2)\nB DC F'1',F'2',F'3',F'4',F'5',F'6' b(2,3)\nC DS 12F c(4,3)\nN DC H'2' dim(a,2)=dim(b,1)\nM DC H'4' dim(a,1)\nP DC H'3' dim(b,2)\nZ DS CL80\nIZ DC H'0'\nW DS CL16\n YREGS\n END MATRIXRC\n","language":"360-Assembly"},{"code":"INCLUDE \"D2:PRINTF.ACT\" ;from the Action! Tool Kit\n\nDEFINE PTR=\"CARD\"\n\nTYPE Matrix=[\n BYTE width,height\n PTR data] ;INT ARRAY\n\nPROC PrintMatrix(Matrix POINTER m)\n BYTE i,j\n INT ARRAY d\n CHAR ARRAY s(10)\n\n d=m.data\n FOR j=0 TO m.height-1\n DO\n FOR i=0 TO m.width-1\n DO\n StrI(d(j*m.width+i),s)\n PrintF(\"%2S \",s)\n OD\n PutE()\n OD\nRETURN\n\nPROC Create(MATRIX POINTER m BYTE w,h INT ARRAY a)\n m.width=w\n m.height=h\n m.data=a\nRETURN\n\nPROC MatrixMul(Matrix POINTER m1,m2,res)\n BYTE i,j,k\n INT ARRAY d1,d2,dres,sum\n\n IF m1.width#m2.height THEN\n Print(\"Invalid size of matrices for multiplication!\")\n Break()\n FI\n d1=m1.data\n d2=m2.data\n dres=res.data\n\n res.width=m2.width\n res.height=m1.height\n\n FOR j=0 TO res.height-1\n DO\n FOR i=0 TO res.width-1\n DO\n sum=0\n FOR k=0 TO m1.width-1\n DO\n sum==+d1(k+j*m1.width)*d2(i+k*m2.width)\n OD\n dres(j*res.width+i)=sum\n OD\n OD\nRETURN\n\nPROC Main()\n MATRIX m1,m2,res\n INT ARRAY\n d1=[2 1 4 0 1 1],\n d2=[6 3 65535 0 1 1 0 4 65534 5 0 2],\n dres(8)\n\n Put(125) PutE() ;clear the screen\n\n Create(m1,3,2,d1)\n Create(m2,4,3,d2)\n Create(res,0,0,dres)\n MatrixMul(m1,m2,res)\n\n PrintMatrix(m1)\n PutE() PrintE(\"multiplied by\") PutE()\n PrintMatrix(m2)\n PutE() PrintE(\"equals\") PutE()\n PrintMatrix(res)\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\nwith Ada.Numerics.Real_Arrays; use Ada.Numerics.Real_Arrays;\n\nprocedure Matrix_Product is\n\n procedure Put (X : Real_Matrix) is\n type Fixed is delta 0.01 range -100.0..100.0;\n begin\n for I in X'Range (1) loop\n for J in X'Range (2) loop\n Put (Fixed'Image (Fixed (X (I, J))));\n end loop;\n New_Line;\n end loop;\n end Put;\n\n A : constant Real_Matrix :=\n ( ( 1.0, 1.0, 1.0, 1.0),\n ( 2.0, 4.0, 8.0, 16.0),\n ( 3.0, 9.0, 27.0, 81.0),\n ( 4.0, 16.0, 64.0, 256.0)\n );\n B : constant Real_Matrix :=\n ( ( 4.0, -3.0, 4.0/3.0, -1.0/4.0 ),\n (-13.0/3.0, 19.0/4.0, -7.0/3.0, 11.0/24.0),\n ( 3.0/2.0, -2.0, 7.0/6.0, -1.0/4.0 ),\n ( -1.0/6.0, 1.0/4.0, -1.0/6.0, 1.0/24.0)\n );\nbegin\n Put (A * B);\nend Matrix_Product;\n","language":"Ada"},{"code":"package Matrix_Ops is\n type Matrix is array (Natural range <>, Natural range <>) of Float;\n function \"*\" (Left, Right : Matrix) return Matrix;\nend Matrix_Ops;\n\npackage body Matrix_Ops is\n ---------\n -- \"*\" --\n ---------\n function \"*\" (Left, Right : Matrix) return Matrix is\n Temp : Matrix(Left'Range(1), Right'Range(2)) := (others =>(others => 0.0));\n begin\n if Left'Length(2) /= Right'Length(1) then\n raise Constraint_Error;\n end if;\n\n for I in Left'range(1) loop\n for J in Right'range(2) loop\n for K in Left'range(2) loop\n Temp(I,J) := Temp(I,J) + Left(I, K)*Right(K, J);\n end loop;\n end loop;\n end loop;\n return Temp;\n end \"*\";\nend Matrix_Ops;\n","language":"Ada"},{"code":"MODE FIELD = LONG REAL; # field type is LONG REAL #\nINT default upb:=3;\nMODE VECTOR = [default upb]FIELD;\nMODE MATRIX = [default upb,default upb]FIELD;\n\n# crude exception handling #\nPROC VOID raise index error := VOID: GOTO exception index error;\n\n# define the vector/matrix operators #\nOP * = (VECTOR a,b)FIELD: ( # basically the dot product #\n FIELD result:=0;\n IF LWB a/=LWB b OR UPB a/=UPB b THEN raise index error FI;\n FOR i FROM LWB a TO UPB a DO result+:= a[i]*b[i] OD;\n result\n );\n\n OP * = (VECTOR a, MATRIX b)VECTOR: ( # overload vector times matrix #\n [2 LWB b:2 UPB b]FIELD result;\n IF LWB a/=LWB b OR UPB a/=UPB b THEN raise index error FI;\n FOR j FROM 2 LWB b TO 2 UPB b DO result[j]:=a*b[,j] OD;\n result\n );\n# this is the task portion #\nOP * = (MATRIX a, b)MATRIX: ( # overload matrix times matrix #\n [LWB a:UPB a, 2 LWB b:2 UPB b]FIELD result;\n IF 2 LWB a/=LWB b OR 2 UPB a/=UPB b THEN raise index error FI;\n FOR k FROM LWB result TO UPB result DO result[k,]:=a[k,]*b OD;\n result\n );\n\n # Some sample matrices to test #\ntest:(\n MATRIX a=((1, 1, 1, 1), # matrix A #\n (2, 4, 8, 16),\n (3, 9, 27, 81),\n (4, 16, 64, 256));\n\n MATRIX b=(( 4 , -3 , 4/3, -1/4 ), # matrix B #\n (-13/3, 19/4, -7/3, 11/24),\n ( 3/2, -2 , 7/6, -1/4 ),\n ( -1/6, 1/4, -1/6, 1/24));\n\n MATRIX prod = a * b; # actual multiplication example of A x B #\n\n FORMAT real fmt = $g(-6,2)$; # width of 6, with no '+' sign, 2 decimals #\n PROC real matrix printf= (FORMAT real fmt, MATRIX m)VOID:(\n FORMAT vector fmt = $\"(\"n(2 UPB m-1)(f(real fmt)\",\")f(real fmt)\")\"$;\n FORMAT matrix fmt = $x\"(\"n(UPB m-1)(f(vector fmt)\",\"lxx)f(vector fmt)\");\"$;\n # finally print the result #\n printf((matrix fmt,m))\n );\n\n # finally print the result #\n print((\"Product of a and b: \",new line));\n real matrix printf(real fmt, prod)\n EXIT\n\n exception index error:\n putf(stand error, $x\"Exception: index error.\"l$)\n)\n","language":"ALGOL-68"},{"code":"#include <hopper.h>\nmain:\n first matrix=0, second matrix=0,a=-1\n {5,2},rand array(a),mulby(10),ceil, cpy(first matrix), puts,{\"\\n\"},puts\n {2,3},rand array(a),mulby(10),ceil, cpy(second matrix), puts,{\"\\n\"},puts\n {first matrix,second matrix},mat mul, println\nexit(0)\n","language":"Amazing-Hopper"},{"code":"#include <natural.h>\n#include <hopper.h>\nmain:\n get a matrix of '5,2' integer random numbers, remember it in 'first matrix' and put it with a newline\n get a matrix of '2,3' integer random numbers, remember it in 'second matrix' and put it with a newline\n now take 'first matrix', and take 'second matrix', and multiply it; then, print with a new line.\nexit(0)\n","language":"Amazing-Hopper"},{"code":" x ← +.×\n\n A ← ↑A*¨⊂A←⍳4 ⍝ Same A as in other examples (1 1 1 1⍪ 2 4 8 16⍪ 3 9 27 81,[0.5] 4 16 64 256)\n B ← ⌹A ⍝ Matrix inverse of A\n\n 'F6.2' ⎕FMT A x B\n1.00 0.00 0.00 0.00\n0.00 1.00 0.00 0.00\n0.00 0.00 1.00 0.00\n0.00 0.00 0.00 1.00\n","language":"APL"},{"code":"--------------------- MATRIX MULTIPLY --------------------\n\n-- matrixMultiply :: Num a => [[a]] -> [[a]] -> [[a]]\nto matrixMultiply(a, b)\n script rows\n property xs : transpose(b)\n\n on |λ|(row)\n script columns\n on |λ|(col)\n my dotProduct(row, col)\n end |λ|\n end script\n\n map(columns, xs)\n end |λ|\n end script\n\n map(rows, a)\nend matrixMultiply\n\n\n--------------------------- TEST -------------------------\non run\n matrixMultiply({¬\n {-1, 1, 4}, ¬\n {6, -4, 2}, ¬\n {-3, 5, 0}, ¬\n {3, 7, -2} ¬\n }, {¬\n {-1, 1, 4, 8}, ¬\n {6, 9, 10, 2}, ¬\n {11, -4, 5, -3}})\n\n --> {{51, -8, 26, -18}, {-8, -38, -6, 34},\n -- {33, 42, 38, -14}, {17, 74, 72, 44}}\nend run\n\n\n-------------------- GENERIC FUNCTIONS -------------------\n\n-- dotProduct :: [n] -> [n] -> Maybe n\non dotProduct(xs, ys)\n script mult\n on |λ|(a, b)\n a * b\n end |λ|\n end script\n\n if length of xs is not length of ys then\n missing value\n else\n sum(zipWith(mult, xs, ys))\n end if\nend dotProduct\n\n\n-- foldr :: (a -> b -> a) -> a -> [b] -> a\non foldr(f, startValue, xs)\n tell mReturn(f)\n set v to startValue\n set lng to length of xs\n repeat with i from lng to 1 by -1\n set v to |λ|(v, item i of xs, i, xs)\n end repeat\n return v\n end tell\nend foldr\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-- 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-- product :: Num a => [a] -> a\non product(xs)\n script mult\n on |λ|(a, b)\n a * b\n end |λ|\n end script\n\n foldr(mult, 1, xs)\nend product\n\n\n-- sum :: Num a => [a] -> a\non sum(xs)\n script add\n on |λ|(a, b)\n a + b\n end |λ|\n end script\n\n foldr(add, 0, xs)\nend sum\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-- zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\non zipWith(f, xs, ys)\n set lng to min(length of xs, length of ys)\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":"{{51, -8, 26, -18}, {-8, -38, -6, 34}, {33, 42, 38, -14}, {17, 74, 72, 44}}\n","language":"AppleScript"},{"code":" 1 FOR K = 0 TO 1:M = O:N = P: READ O,P: IF K THEN DIM B(O,P): IF N < > O THEN PRINT \"INVALID DIMENSIONS\": STOP\n 2 IF NOT K THEN DIM A(O,P)\n 3 FOR I = 1 TO O: FOR J = 1 TO P: IF K THEN READ B(I,J)\n 4 IF NOT K THEN READ A(I,J)\n 5 NEXT J,I,K: DIM AB(M,P): FOR I = 1 TO M: FOR J = 1 TO P: FOR K = 1 TO N:AB(I,J) = AB(I,J) + (A(I,K) * B(K,J)): NEXT K,J,I: FOR I = 1 TO M: FOR J = 1 TO P: PRINT MID$ (S$,1 + (J = 1),1)AB(I,J);:S$ = \" \" + CHR$ (13): NEXT J,I\n 10000 DATA4,2\n 10010 DATA1,2,3,4,5,6,7,8\n 20000 DATA2,3\n 20010 DATA1,2,3,4,5,6\n","language":"Applesoft-BASIC"},{"code":"DIM matrix1(4,2),matrix2(2,3)\n\nMAT READ matrix1\nDATA 1,2\nDATA 3,4\nDATA 5,6\nDATA 7,8\n\nMAT READ matrix2\nDATA 1,2,3\nDATA 4,5,6\n\nMAT product=matrix1*matrix2\nMAT PRINT product\n","language":"Applesoft-BASIC"},{"code":"printMatrix: function [m][\n loop m 'row -> print map row 'val [pad to :string .format:\".2f\" val 6]\n print \"--------------------------------\"\n]\n\nmultiply: function [a,b][\n X: size a\n Y: size first b\n result: array.of: @[X Y] 0\n\n loop 0..X-1 'i [\n loop 0..Y-1 'j [\n loop 0..(size first a)-1 'k ->\n result\\[i]\\[j]: result\\[i]\\[j] + a\\[i]\\[k] * b\\[k]\\[j]\n ]\n ]\n return result\n]\n\nA: [[1.0 1.0 1.0 1.0]\n [2.0 4.0 8.0 16.0]\n [3.0 9.0 27.0 81.0]\n [4.0 16.0 64.0 256.0]]\n\nB: @[@[ 4.0 0-3.0 4/3.0 0-1/4.0]\n @[0-13/3.0 19/4.0 0-7/3.0 11/24.0]\n @[ 3/2.0 0-2.0 7/6.0 0-1/4.0]\n @[ 0-1/6.0 1/4.0 0-1/6.0 1/24.0]]\n\nprintMatrix A\nprintMatrix B\nprintMatrix multiply A B\nprintMatrix multiply B A\n","language":"Arturo"},{"code":"Matrix(\"b\",\" ; rows separated by \",\"\n, 1 2 ; entries separated by space or tab\n, 2 3\n, 3 0\")\nMsgBox % \"B`n`n\" MatrixPrint(b)\nMatrix(\"c\",\"\n, 1 2 3\n, 3 2 1\")\nMsgBox % \"C`n`n\" MatrixPrint(c)\n\nMatrixMul(\"a\",b,c)\nMsgBox % \"B * C`n`n\" MatrixPrint(a)\n\nMsgBox % MatrixMul(\"x\",b,b)\n\n\nMatrix(_a,_v) { ; Matrix structure: m_0_0 = #rows, m_0_1 = #columns, m_i_j = element[i,j], i,j > 0\n Local _i, _j = 0\n Loop Parse, _v, `,\n If (A_LoopField != \"\") {\n _i := 0, _j ++\n Loop Parse, A_LoopField, %A_Space%%A_Tab%\n If (A_LoopField != \"\")\n _i++, %_a%_%_i%_%_j% := A_LoopField\n }\n %_a% := _a, %_a%_0_0 := _j, %_a%_0_1 := _i\n}\nMatrixPrint(_a) {\n Local _i = 0, _t\n Loop % %_a%_0_0 {\n _i++\n Loop % %_a%_0_1\n _t .= %_a%_%A_Index%_%_i% \"`t\"\n _t .= \"`n\"\n }\n Return _t\n}\nMatrixMul(_a,_b,_c) {\n Local _i = 0, _j, _k, _s\n If (%_b%_0_0 != %_c%_0_1)\n Return \"ERROR: inner dimensions \" %_b%_0_0 \" != \" %_c%_0_1\n %_a% := _a, %_a%_0_0 := %_b%_0_0, %_a%_0_1 := %_c%_0_1\n Loop % %_c%_0_1 {\n _i++, _j := 0\n Loop % %_b%_0_0 {\n _j++, _k := _s := 0\n Loop % %_b%_0_1\n _k++, _s += %_b%_%_k%_%_j% * %_c%_%_i%_%_k%\n %_a%_%_i%_%_j% := _s\n }\n }\n}\n","language":"AutoHotkey"},{"code":"Multiply_Matrix(A,B){\n\tif (A[1].Count() <> B.Count())\n\t\treturn [\"Dimension Error\"]\n\tR := [], RRows := A.Count(), RCols:= b[1].Count()\n\tLoop, % RRows {\n\t\tRRow:=A_Index\n\t\tloop, % RCols {\n\t\t\tRCol:=A_Index, v := 0\n\t\t\tloop % A[1].Count()\n\t\t\t\tcol := A_Index, v += A[RRow, col] * B[col, RCol]\n\t\t\tR[RRow,RCol] := v\n\t\t}\n\t}\n\treturn R\n}\n","language":"AutoHotkey"},{"code":"A := [[1,2]\n\t, [3,4]\n\t, [5,6]\n\t, [7,8]]\n\nB := [[1,2,3]\n\t, [4,5,6]]\n\nif Res := Multiply_Matrix(A,B)\n\tMsgBox % Print(Res)\nelse\n\tMsgBox Error\nreturn\nPrint(M){\n\tfor i, row in M\n\t\tfor j, col in row\n\t\t\tRes .= (A_Index=1?\"\":\"`t\") col (Mod(A_Index,M[1].MaxIndex())?\"\":\"`n\")\n\treturn Trim(Res,\"`n\")\n}\n","language":"AutoHotkey"},{"code":"# Usage: GAWK -f MATRIX_MULTIPLICATION.AWK filename\n# Separate matrices a and b by a blank line\nBEGIN {\n ranka1 = 0; ranka2 = 0\n rankb1 = 0; rankb2 = 0\n matrix = 1 # Indicate first (1) or second (2) matrix\n i = 0\n}\nNF == 0 {\n if (++matrix > 2) {\n printf(\"Warning: Ignoring data below line %d.\\n\", NR)\n }\n i = 0\n next\n}\n{\n # Store first matrix in a, second matrix in b\n if (matrix == 1) {\n ranka1 = ++i\n ranka2 = max(ranka2, NF)\n for (j = 1; j <= NF; j++)\n a[i,j] = $j\n }\n if (matrix == 2) {\n rankb1 = ++i\n rankb2 = max(rankb2, NF)\n for (j = 1; j <= NF; j++)\n b[i,j] = $j\n }\n}\nEND {\n # Check ranks of a and b\n if ((ranka1 < 1) || (ranka2 < 1) || (rankb1 < 1) || (rankb2 < 1) ||\n (ranka2 != rankb1)) {\n printf(\"Error: Incompatible ranks (%dx%d)*(%dx%d).\\n\", ranka1, ranka2, rankb1, rankb2)\n exit\n }\n # Multiplication c = a * b\n for (i = 1; i <= ranka1; i++) {\n for (j = 1; j <= rankb2; j++) {\n c[i,j] = 0\n for (k = 1; k <= ranka2; k++)\n c[i,j] += a[i,k] * b[k,j]\n }\n }\n # Print matrix c\n for (i = 1; i <= ranka1; i++) {\n for (j = 1; j <= rankb2; j++)\n printf(\"%g%s\", c[i,j], j < rankb2 ? \" \" : \"\\n\")\n }\n}\nfunction max(m, n) {\n return m > n ? m : n\n}\n","language":"AWK"},{"code":"Assume the matrices to be multiplied are a and b\n IF (LEN(a,2) = LEN(b)) 'if valid dims\n n = LEN(a,2)\n m = LEN(a)\n p = LEN(b,2)\n\n DIM ans(0 TO m - 1, 0 TO p - 1)\n\n FOR i = 0 TO m - 1\n FOR j = 0 TO p - 1\n FOR k = 0 TO n - 1\n ans(i, j) = ans(i, j) + (a(i, k) * b(k, j))\n NEXT k, j, i\n\n 'print answer\n FOR i = 0 TO m - 1\n FOR j = 0 TO p - 1\n PRINT ans(i, j);\n NEXT j\n PRINT\n NEXT i\n ELSE\n PRINT \"invalid dimensions\"\n END IF\n","language":"BASIC"},{"code":" DIM matrix1(3,1), matrix2(1,2), product(3,2)\n\n matrix1() = 1, 2, \\\n \\ 3, 4, \\\n \\ 5, 6, \\\n \\ 7, 8\n\n matrix2() = 1, 2, 3, \\\n \\ 4, 5, 6\n\n product() = matrix1() . matrix2()\n\n FOR row% = 0 TO DIM(product(),1)\n FOR col% = 0 TO DIM(product(),2)\n PRINT product(row%,col%),;\n NEXT\n PRINT\n NEXT\n","language":"BBC-BASIC"},{"code":"Mul ← +˝∘×⎉1‿∞\n\n(>⟨\n ⟨1, 2, 3⟩\n ⟨4, 5, 6⟩\n ⟨7, 8, 9⟩\n⟩) Mul >⟨\n ⟨1, 2, 3, 4⟩\n ⟨5, 6, 7, 8⟩\n ⟨9, 10, 11, 12⟩\n⟩\n","language":"BQN"},{"code":"┌─\n╵ 20 23 26 29\n 56 68 80 92\n 92 113 134 155\n ┘\n","language":"BQN"},{"code":"blsq ) {{1 2}{3 4}{5 6}{7 8}}{{1 2 3}{4 5 6}}mmsp\n9 12 15\n19 26 33\n29 40 51\n39 54 69\n","language":"Burlesque"},{"code":"#include <stdio.h>\n\n#define MAT_ELEM(rows,cols,r,c) (r*cols+c)\n\n//Improve performance by assuming output matrices do not overlap with\n//input matrices. If this is C++, use the __restrict extension instead\n#ifdef __cplusplus\n typedef double * const __restrict MAT_OUT_t;\n#else\n typedef double * const restrict MAT_OUT_t;\n#endif\ntypedef const double * const MAT_IN_t;\n\nstatic inline void mat_mult(\n const int m,\n const int n,\n const int p,\n MAT_IN_t a,\n MAT_IN_t b,\n MAT_OUT_t c)\n{\n for (int row=0; row<m; row++) {\n for (int col=0; col<p; col++) {\n c[MAT_ELEM(m,p,row,col)] = 0;\n for (int i=0; i<n; i++) {\n c[MAT_ELEM(m,p,row,col)] += a[MAT_ELEM(m,n,row,i)]*b[MAT_ELEM(n,p,i,col)];\n }\n }\n }\n}\n\nstatic inline void mat_show(\n const int m,\n const int p,\n MAT_IN_t a)\n{\n for (int row=0; row<m;row++) {\n for (int col=0; col<p;col++) {\n printf(\"\\t%7.3f\", a[MAT_ELEM(m,p,row,col)]);\n }\n putchar('\\n');\n }\n}\n\nint main(void)\n{\n double a[4*4] = {1, 1, 1, 1,\n 2, 4, 8, 16,\n 3, 9, 27, 81,\n 4, 16, 64, 256};\n\n double b[4*3] = { 4.0, -3.0, 4.0/3,\n -13.0/3, 19.0/4, -7.0/3,\n 3.0/2, -2.0, 7.0/6,\n -1.0/6, 1.0/4, -1.0/6};\n\n double c[4*3] = {0};\n\n mat_mult(4,4,3,a,b,c);\n mat_show(4,3,c);\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <blitz/tinymat.h>\n\nint main()\n{\n using namespace blitz;\n\n TinyMatrix<double,3,3> A, B, C;\n\n A = 1, 2, 3,\n 4, 5, 6,\n 7, 8, 9;\n\n B = 1, 0, 0,\n 0, 1, 0,\n 0, 0, 1;\n\n C = product(A, B);\n\n std::cout << C << std::endl;\n}\n","language":"C++"},{"code":"#include <iostream>\n#include \"matrix.h\"\n\n#if !defined(ARRAY_SIZE)\n #define ARRAY_SIZE(x) (sizeof((x)) / sizeof((x)[0]))\n#endif\n\nint main() {\n int am[2][3] = {\n {1,2,3},\n {4,5,6},\n };\n int bm[3][2] = {\n {1,2},\n {3,4},\n {5,6}\n };\n\n Matrix<int> a(ARRAY_SIZE(am), ARRAY_SIZE(am[0]), am[0], ARRAY_SIZE(am)*ARRAY_SIZE(am[0]));\n Matrix<int> b(ARRAY_SIZE(bm), ARRAY_SIZE(bm[0]), bm[0], ARRAY_SIZE(bm)*ARRAY_SIZE(bm[0]));\n Matrix<int> c;\n\n try {\n c = a * b;\n for (unsigned int i = 0; i < c.rowNum(); i++) {\n for (unsigned int j = 0; j < c.colNum(); j++) {\n std::cout << c[i][j] << \" \";\n }\n std::cout << std::endl;\n }\n } catch (MatrixException& e) {\n std::cerr << e.message() << std::endl;\n return e.errorCode();\n }\n\n} /* main() */\n","language":"C++"},{"code":"#ifndef _MATRIX_H\n#define\t_MATRIX_H\n\n#include <sstream>\n#include <string>\n#include <vector>\n\n#define MATRIX_ERROR_CODE_COUNT 5\n#define MATRIX_ERR_UNDEFINED \"1 Undefined exception!\"\n#define MATRIX_ERR_WRONG_ROW_INDEX \"2 The row index is out of range.\"\n#define MATRIX_ERR_MUL_ROW_AND_COL_NOT_EQUAL \"3 The row number of second matrix must be equal with the column number of first matrix!\"\n#define MATRIX_ERR_MUL_ROW_AND_COL_BE_GREATER_THAN_ZERO \"4 The number of rows and columns must be greater than zero!\"\n#define MATRIX_ERR_TOO_FEW_DATA \"5 Too few data in matrix.\"\n\nclass MatrixException {\nprivate:\n std::string message_;\n int errorCode_;\npublic:\n MatrixException(std::string message = MATRIX_ERR_UNDEFINED);\n\n inline std::string message() {\n return message_;\n };\n\n inline int errorCode() {\n return errorCode_;\n };\n};\n\nMatrixException::MatrixException(std::string message) {\n errorCode_ = MATRIX_ERROR_CODE_COUNT + 1;\n std::stringstream ss(message);\n ss >> errorCode_;\n if (errorCode_ < 1) {\n errorCode_ = MATRIX_ERROR_CODE_COUNT + 1;\n }\n std::string::size_type pos = message.find(' ');\n if (errorCode_ <= MATRIX_ERROR_CODE_COUNT && pos != std::string::npos) {\n message_ = message.substr(pos + 1);\n } else {\n message_ = message + \" (This an unknown and unsupported exception!)\";\n }\n}\n\n/**\n * Generic class for matrices.\n */\ntemplate <class T>\nclass Matrix {\nprivate:\n std::vector<T> v; // the data of matrix\n unsigned int m; // the number of rows\n unsigned int n; // the number of columns\nprotected:\n\n virtual void clear() {\n v.clear();\n m = n = 0;\n }\npublic:\n\n Matrix() {\n clear();\n }\n Matrix(unsigned int, unsigned int, T* = 0, unsigned int = 0);\n Matrix(unsigned int, unsigned int, const std::vector<T>&);\n\n virtual ~Matrix() {\n clear();\n }\n Matrix& operator=(const Matrix&);\n std::vector<T> operator[](unsigned int) const;\n Matrix operator*(const Matrix&);\n\n inline unsigned int rowNum() const {\n return m;\n }\n\n inline unsigned int colNum() const {\n return n;\n }\n\n inline unsigned int size() const {\n return v.size();\n }\n\n inline void add(const T& t) {\n v.push_back(t);\n }\n};\n\ntemplate <class T>\nMatrix<T>::Matrix(unsigned int row, unsigned int col, T* data, unsigned int dataLength) {\n clear();\n if (row > 0 && col > 0) {\n m = row;\n n = col;\n unsigned int mxn = m * n;\n if (dataLength && data) {\n for (unsigned int i = 0; i < dataLength && i < mxn; i++) {\n v.push_back(data[i]);\n }\n }\n }\n}\n\ntemplate <class T>\nMatrix<T>::Matrix(unsigned int row, unsigned int col, const std::vector<T>& data) {\n clear();\n if (row > 0 && col > 0) {\n m = row;\n n = col;\n unsigned int mxn = m * n;\n if (data.size() > 0) {\n for (unsigned int i = 0; i < mxn && i < data.size(); i++) {\n v.push_back(data[i]);\n }\n }\n }\n}\n\ntemplate<class T>\nMatrix<T>& Matrix<T>::operator=(const Matrix<T>& other) {\n clear();\n if (other.m > 0 && other.n > 0) {\n m = other.m;\n n = other.n;\n unsigned int mxn = m * n;\n for (unsigned int i = 0; i < mxn && i < other.size(); i++) {\n v.push_back(other.v[i]);\n }\n }\n return *this;\n}\n\ntemplate<class T>\nstd::vector<T> Matrix<T>::operator[](unsigned int index) const {\n std::vector<T> result;\n if (index >= m) {\n throw MatrixException(MATRIX_ERR_WRONG_ROW_INDEX);\n } else if ((index + 1) * n > size()) {\n throw MatrixException(MATRIX_ERR_TOO_FEW_DATA);\n } else {\n unsigned int begin = index * n;\n unsigned int end = begin + n;\n for (unsigned int i = begin; i < end; i++) {\n result.push_back(v[i]);\n }\n }\n return result;\n}\n\ntemplate<class T>\nMatrix<T> Matrix<T>::operator*(const Matrix<T>& other) {\n Matrix result(m, other.n);\n if (n != other.m) {\n throw MatrixException(MATRIX_ERR_MUL_ROW_AND_COL_NOT_EQUAL);\n } else if (m <= 0 || n <= 0 || other.n <= 0) {\n throw MatrixException(MATRIX_ERR_MUL_ROW_AND_COL_BE_GREATER_THAN_ZERO);\n } else if (m * n > size() || other.m * other.n > other.size()) {\n throw MatrixException(MATRIX_ERR_TOO_FEW_DATA);\n } else {\n for (unsigned int i = 0; i < m; i++) {\n for (unsigned int j = 0; j < other.n; j++) {\n T temp = v[i * n] * other.v[j];\n for (unsigned int k = 1; k < n; k++) {\n temp += v[i * n + k] * other.v[k * other.n + j];\n }\n result.v.push_back(temp);\n }\n }\n }\n return result;\n}\n\n#endif\t/* _MATRIX_H */\n","language":"C++"},{"code":"alias Matrix => Integer[][];\n\nvoid printMatrix(Matrix m) {\n\tvalue strings = m.collect((row) => row.collect(Integer.string));\n\tvalue maxLength = max(expand(strings).map(String.size)) else 0;\n\tvalue padded = strings.collect((row) => row.collect((s) => s.padLeading(maxLength)));\n\tfor (row in padded) {\n\t\tprint(\"[``\", \".join(row)``]\");\n\t}\n}\n\nMatrix? multiplyMatrices(Matrix a, Matrix b) {\n\t\n\tfunction rectangular(Matrix m) =>\n\t\t\tif (exists firstRow = m.first)\n\t\t\tthen m.every((row) => row.size == firstRow.size)\n\t\t\telse false;\n\t\n\tfunction rowCount(Matrix m) => m.size;\n\tfunction columnCount(Matrix m) => m[0]?.size else 0;\n\t\n\tif (!rectangular(a) || !rectangular(b) || columnCount(a) != rowCount(b)) {\n\t\treturn null;\n\t}\n\t\n\tfunction getNumber(Matrix m, Integer x, Integer y) {\n\t\tassert (exists number = m[y]?.get(x));\n\t\treturn number;\n\t}\n\t\n\tfunction getRow(Matrix m, Integer rowIndex) {\n\t\tassert (exists row = m[rowIndex]);\n\t\treturn row;\n\t}\n\t\n\tfunction getColumn(Matrix m, Integer columnIndex) => {\n\t\tfor (y in 0:rowCount(m))\n\t\tgetNumber(m, columnIndex, y)\n\t};\n\t\n\treturn [\n\t\tfor (y in 0:rowCount(a)) [\n\t\t\tfor (x in 0:columnCount(b))\n\t\t\tsum { 0, for ([a1, b1] in zipPairs(getRow(a, y), getColumn(b, x))) a1 * b1 }\n\t\t]\n\t];\n}\n\nshared void run() {\n value m = [[1, 2, 3], [4, 5, 6]];\n printMatrix(m);\n print(\"---------\");\n print(\"multiplied by\");\n value m2 = [[7, 8], [9, 10], [11, 12]];\n printMatrix(m2);\n print(\"---------\");\n print(\"equals:\");\n value result = multiplyMatrices(m, m2);\n if (exists result) {\n printMatrix(result);\n }\n else {\n print(\"something went wrong!\");\n }\n}\n","language":"Ceylon"},{"code":"proc *(a:[], b:[]) {\n\n if (a.eltType != b.eltType) then\n writeln(\"type mismatch: \", a.eltType, \" \", b.eltType);\n\n var ad = a.domain.dims();\n var bd = b.domain.dims();\n var (arows, acols) = ad;\n var (brows, bcols) = bd;\n if (arows != bcols) then\n writeln(\"dimension mismatch: \", ad, \" \", bd);\n\n var c:[{arows, bcols}] a.eltType = 0;\n\n for i in arows do\n for j in bcols do\n for k in acols do\n c(i,j) += a(i,k) * b(k,j);\n\n return c;\n}\n","language":"Chapel"},{"code":"var m1:[{1..2, 1..2}] int;\nm1(1,1) = 1; m1(1,2) = 2;\nm1(2,1) = 3; m1(2,2) = 4;\nwriteln(m1);\n\nvar m2:[{1..2, 1..2}] int;\nm2(1,1) = 2; m2(1,2) = 3;\nm2(2,1) = 4; m2(2,2) = 5;\nwriteln(m2);\n\nvar m3 = m1 * m2;\nwriteln(m3);\n\nvar m4:[{1..2, 1..3}] int;\nm4(1, 1) = 1; m4(1, 2) = 2; m4(1, 3) = 3;\nm4(2, 1) = 4; m4(2, 2) = 5; m4(2, 3) = 6;\nwriteln(m4);\n\nvar m5:[{1..3, 1..2}] int;\nm5(1, 1) = 6; m5(1, 2) = -1;\nm5(2, 1) = 3; m5(2, 2) = 2;\nm5(3, 1) = 0; m5(3, 2) = -3;\nwriteln(m5);\n\nwriteln(m4 * m5);\n","language":"Chapel"},{"code":"(defn transpose\n [s]\n (apply map vector s))\n\n(defn nested-for\n [f x y]\n (map (fn [a]\n (map (fn [b]\n (f a b)) y))\n x))\n\n(defn matrix-mult\n [a b]\n (nested-for (fn [x y] (reduce + (map * x y))) a (transpose b)))\n\n(def ma [[1 1 1 1] [2 4 8 16] [3 9 27 81] [4 16 64 256]])\n(def mb [[4 -3 4/3 -1/4] [-13/3 19/4 -7/3 11/24] [3/2 -2 7/6 -1/4] [-1/6 1/4 -1/6 1/24]])\n","language":"Clojure"},{"code":"(defun matrix-multiply (a b)\n (flet ((col (mat i) (mapcar #'(lambda (row) (elt row i)) mat))\n (row (mat i) (elt mat i)))\n (loop for row from 0 below (length a)\n collect (loop for col from 0 below (length (row b 0))\n collect (apply #'+ (mapcar #'* (row a row) (col b col)))))))\n\n;; example use:\n(matrix-multiply '((1 2) (3 4)) '((-3 -8 3) (-2 1 4)))\n","language":"Common-Lisp"},{"code":"(defun matrix-multiply (matrix1 matrix2)\n (mapcar\n (lambda (row)\n (apply #'mapcar\n (lambda (&rest column)\n (apply #'+ (mapcar #'* row column))) matrix2)) matrix1))\n","language":"Common-Lisp"},{"code":"(defun mmul (A B)\n (let* ((m (car (array-dimensions A)))\n (n (cadr (array-dimensions A)))\n (l (cadr (array-dimensions B)))\n (C (make-array `(,m ,l) :initial-element 0)))\n (loop for i from 0 to (- m 1) do\n (loop for k from 0 to (- l 1) do\n (setf (aref C i k)\n (loop for j from 0 to (- n 1)\n sum (* (aref A i j)\n (aref B j k))))))\n C))\n","language":"Common-Lisp"},{"code":"(mmul #2a((1 2) (3 4)) #2a((-3 -8 3) (-2 1 4)))\n#2A((-7 -6 11) (-17 -20 25))\n","language":"Common-Lisp"},{"code":"(defun mmult (a b)\n (loop\n with m = (array-dimension a 0)\n with n = (array-dimension a 1)\n with l = (array-dimension b 1)\n with c = (make-array (list m l) :initial-element 0)\n for i below m do\n (loop for k below l do\n (setf (aref c i k)\n (loop for j below n\n sum (* (aref a i j)\n (aref b j k)))))\n finally (return c)))\n","language":"Common-Lisp"},{"code":"import std.stdio, std.string, std.conv, std.numeric,\n std.array, std.algorithm;\n\nbool isRectangular(T)(in T[][] M) pure nothrow {\n return M.all!(row => row.length == M[0].length);\n}\n\nT[][] matrixMul(T)(in T[][] A, in T[][] B) pure nothrow\nin {\n assert(A.isRectangular && B.isRectangular &&\n !A.empty && !B.empty && A[0].length == B.length);\n} body {\n auto result = new T[][](A.length, B[0].length);\n auto aux = new T[B.length];\n\n foreach (immutable j; 0 .. B[0].length) {\n foreach (immutable k, const row; B)\n aux[k] = row[j];\n foreach (immutable i, const ai; A)\n result[i][j] = dotProduct(ai, aux);\n }\n\n return result;\n}\n\nvoid main() {\n immutable a = [[1, 2], [3, 4], [3, 6]];\n immutable b = [[-3, -8, 3,], [-2, 1, 4]];\n\n immutable form = \"[%([%(%d, %)],\\n %)]]\";\n writefln(\"A = \\n\" ~ form ~ \"\\n\", a);\n writefln(\"B = \\n\" ~ form ~ \"\\n\", b);\n writefln(\"A * B = \\n\" ~ form, matrixMul(a, b));\n}\n","language":"D"},{"code":"import std.stdio, std.range, std.array, std.numeric, std.algorithm;\n\nT[][] matMul(T)(in T[][] A, in T[][] B) pure nothrow /*@safe*/ {\n const Bt = B[0].length.iota.map!(i=> B.transversal(i).array).array;\n return A.map!(a => Bt.map!(b => a.dotProduct(b)).array).array;\n}\n\nvoid main() {\n immutable a = [[1, 2], [3, 4], [3, 6]];\n immutable b = [[-3, -8, 3,], [-2, 1, 4]];\n\n immutable form = \"[%([%(%d, %)],\\n %)]]\";\n writefln(\"A = \\n\" ~ form ~ \"\\n\", a);\n writefln(\"B = \\n\" ~ form ~ \"\\n\", b);\n writefln(\"A * B = \\n\" ~ form, matMul(a, b));\n}\n","language":"D"},{"code":"import std.stdio, std.range, std.numeric, std.algorithm;\n\nT[][] matMul(T)(immutable T[][] A, immutable T[][] B) pure nothrow {\n immutable Bt = B[0].length.iota.map!(i=> B.transversal(i).array)\n .array;\n return A.map!((in a) => Bt.map!(b => a.dotProduct(b)).array).array;\n}\n\nvoid main() {\n immutable a = [[1, 2], [3, 4], [3, 6]];\n immutable b = [[-3, -8, 3,], [-2, 1, 4]];\n\n immutable form = \"[%([%(%d, %)],\\n %)]]\";\n writefln(\"A = \\n\" ~ form ~ \"\\n\", a);\n writefln(\"B = \\n\" ~ form ~ \"\\n\", b);\n writefln(\"A * B = \\n\" ~ form, matMul(a, b));\n}\n","language":"D"},{"code":"import std.stdio, std.string, std.numeric, std.algorithm, std.traits;\n\nalias TMMul_helper(M1, M2) = Unqual!(ForeachType!(ForeachType!M1))\n [M2.init[0].length][M1.length];\n\nvoid matrixMul(T, T2, size_t k, size_t m, size_t n)\n (in ref T[m][k] A, in ref T[n][m] B,\n /*out*/ ref T2[n][k] result) pure nothrow /*@safe*/ @nogc\nif (is(T2 == Unqual!T)) {\n static if (hasIndirections!T)\n T2[m] aux;\n else\n T2[m] aux = void;\n\n foreach (immutable j; 0 .. n) {\n foreach (immutable i, const ref bi; B)\n aux[i] = bi[j];\n foreach (immutable i, const ref ai; A)\n result[i][j] = dotProduct(ai, aux);\n }\n}\n\nvoid main() {\n immutable int[2][3] a = [[1, 2], [3, 4], [3, 6]];\n immutable int[3][2] b = [[-3, -8, 3,], [-2, 1, 4]];\n\n enum form = \"[%([%(%d, %)],\\n %)]]\";\n writefln(\"A = \\n\" ~ form ~ \"\\n\", a);\n writefln(\"B = \\n\" ~ form ~ \"\\n\", b);\n TMMul_helper!(typeof(a), typeof(b)) result = void;\n matrixMul(a, b, result);\n writefln(\"A * B = \\n\" ~ form, result);\n}\n","language":"D"},{"code":"program Matrix_multiplication;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils;\n\ntype\n TMatrix = record\n values: array of array of Double;\n Rows, Cols: Integer;\n constructor Create(Rows, Cols: Integer);\n class operator Multiply(a: TMatrix; b: TMatrix): TMatrix;\n function ToString: string;\n end;\n\n{ TMatrix }\n\nconstructor TMatrix.Create(Rows, Cols: Integer);\nvar\n i: Integer;\nbegin\n Self.Rows := Rows;\n self.Cols := Cols;\n SetLength(values, Rows);\n for i := 0 to High(values) do\n SetLength(values[i], Cols);\nend;\n\nclass operator TMatrix.Multiply(a, b: TMatrix): TMatrix;\nvar\n rows, cols, l: Integer;\n i, j: Integer;\n sum: Double;\n k: Integer;\nbegin\n rows := a.Rows;\n cols := b.Cols;\n l := a.Cols;\n if l <> b.Rows then\n raise Exception.Create('Illegal matrix dimensions for multiplication');\n result := TMatrix.create(a.rows, b.Cols);\n for i := 0 to rows - 1 do\n for j := 0 to cols - 1 do\n begin\n sum := 0.0;\n for k := 0 to l - 1 do\n sum := sum + (a.values[i, k] * b.values[k, j]);\n result.values[i, j] := sum;\n end;\nend;\n\nfunction TMatrix.ToString: string;\nvar\n i, j: Integer;\nbegin\n Result := '[';\n for i := 0 to 2 do\n begin\n if i > 0 then\n Result := Result + #10;\n Result := Result + '[';\n for j := 0 to 2 do\n begin\n if j > 0 then\n Result := Result + ', ';\n Result := Result + format('%5.2f', [values[i, j]]);\n end;\n Result := Result + ']';\n end;\n Result := Result + ']';\nend;\n\nvar\n a, b, r: TMatrix;\n i, j: Integer;\n\nbegin\n a := TMatrix.Create(3, 3);\n b := TMatrix.Create(3, 3);\n a.values := [[1, 2, 3], [4, 5, 6], [7, 8, 9]];\n b.values := [[2, 2, 2], [5, 5, 5], [7, 7, 7]];\n r := a * b;\n\n Writeln('a: ');\n Writeln(a.ToString, #10);\n Writeln('b: ');\n Writeln(b.ToString, #10);\n Writeln('a * b:');\n Writeln(r.ToString);\n readln;\n\nend.\n","language":"Delphi"},{"code":"proc matmul . m1[][] m2[][] r[][] .\n r[][] = [ ]\n for i to len m1[][]\n r[][] &= [ ]\n for j = 1 to len m2[1][]\n r[i][] &= 0\n for k to len m2[][]\n r[i][j] += m1[i][k] * m2[k][j]\n .\n .\n .\n.\nmat1[][] = [ [ 1 2 3 ] [ 4 5 6 ] ]\nmat2[][] = [ [ 1 2 ] [ 3 4 ] [ 5 6 ] ]\nmatmul mat1[][] mat2[][] erg[][]\nprint erg[][]\n","language":"EasyLang"},{"code":"program Matrix_multiplication type BasicProgram {}\n\t\n\tfunction main()\n\t\ta float[][] = [[1,2,3],[4,5,6]];\n\t\tb float[][] = [[1,2],[3,4],[5,6]];\n\t\tc float[][] = mult(a, b);\n\tend\n\t\n\tfunction mult(a float[][], b float[][]) returns(float[][])\n\t\tif(a.getSize() == 0)\n\t\t\treturn (new float[0][0]);\n\t\tend\n\t\tif(a[1].getSize() != b.getSize())\n\t\t\treturn (null); //invalid dims\n\t\tend\n\t\n\t \tn int = a[1].getSize();\n\t \tm int = a.getSize();\n\t \tp int = b[1].getSize();\n\t\t\n\t\tans float[0][0];\n\t\tans.resizeAll([m, p]);\n\t\t\n\t\t// Calculate dot product.\n\t\tfor(i int from 1 to m)\n\t\t\tfor(j int from 1 to p)\n\t\t\t\tfor(k int from 1 to n)\n\t \t ans[i][j] += a[i][k] * b[k][j];\n\t\t\t\tend\n\t\t\tend\n\t\tend\n\t\treturn (ans);\n\tend\nend\n","language":"EGL"},{"code":"open list\n\nmmult a b = [ [ sum $ zipWith (*) ar bc \\\\ bc <- (transpose b) ] \\\\ ar <- a ]\n\n[[1, 2],\n [3, 4]] `mmult` [[-3, -8, 3],\n [-2, 1, 4]]\n","language":"Ela"},{"code":" def mult(m1, m2) do\n Enum.map m1, fn (x) -> Enum.map t(m2), fn (y) -> Enum.zip(x, y)\n |> Enum.map(fn {x, y} -> x * y end)\n |> Enum.sum\n end\n end\n end\n\n def t(m) do # transpose\n List.zip(m) |> Enum.map(&Tuple.to_list(&1))\n end\n","language":"Elixir"},{"code":"MAC ZIP = ([INT n]TYPE t: vector1 vector2) -> [n][2]t:\n [INT k = 1..n](vector1[k], vector2[k]).\n\nMAC TRANSPOSE = ([INT n][INT m]TYPE t: matrix) -> [m][n]t:\n [INT i = 1..m] [INT j = 1..n] matrix[j][i].\n\nMAC INNER_PRODUCT{FN * = [2]TYPE t -> TYPE s, FN + = [2]s -> s}\n = ([INT n][2]t: vector) -> s:\n IF n = 1 THEN *vector[1]\n ELSE *vector[1] + INNER_PRODUCT {*,+} vector[2..n]\n FI.\n\nMAC MATRIX_MULT {FN * = [2]TYPE t->TYPE s, FN + = [2]s->s} =\n([INT n][INT m]t: matrix1, [m][INT p]t: matrix2) -> [n][p]s:\nBEGIN\n LET transposed_matrix2 = TRANSPOSE matrix2.\nOUTPUT [INT i = 1..n][INT j = 1..p]\n INNER_PRODUCT{*,+}ZIP(matrix1[i],transposed_matrix2[j])\nEND.\n\n\nTYPE element = NEW elt/(1..20),\n product = NEW prd/(1..1200).\n\nFN PLUS = (product: integer1 integer2) -> product:\n ARITH integer1 + integer2.\n\nFN MULT = (element: integer1 integer2) -> product:\n ARITH integer1 * integer2.\n\nFN MULT_234 = ([2][3]element:matrix1, [3][4]element:matrix2) ->\n [2][4]product:\n MATRIX_MULT{MULT,PLUS}(matrix1, matrix2).\n\nFN TEST = () -> [2][4]product:\n( LET m1 = ((elt/2, elt/1, elt/1),\n (elt/3, elt/6, elt/9)),\n m2 = ((elt/6, elt/1, elt/3, elt/4),\n (elt/9, elt/2, elt/8, elt/3),\n (elt/6, elt/4, elt/1, elt/2)).\n OUTPUT\n MULT_234 (m1, m2)\n).\n\nCOM test: just displaysignal MOC\n","language":"ELLA"},{"code":"(defvar M1 '((2 1 4)\n (0 1 1)))\n\n(defvar M2 '(( 6 3 -1 0)\n ( 1 1 0 4)\n (-2 5 0 2)))\n\n(seq-map (lambda (a1)\n (seq-map (lambda (a2) (apply #'+ (seq-mapn #'* a1 a2)))\n (apply #'seq-mapn #'list M2)))\n M1)\n","language":"Emacs-Lisp"},{"code":"%% Multiplies two matrices. Usage example:\n%% $ matrix:multiply([[1,2,3],[4,5,6]], [[4,4],[0,0],[1,4]])\n%% If the dimentions are incompatible, an error is thrown.\n%%\n%% The erl shell may encode the lists output as strings. In order to prevent such\n%% behaviour, BEFORE running matrix:multiply, run shell:strings(false) to disable\n%% auto-encoding. When finished, run shell:strings(true) to reset the defaults.\n\n-module(matrix).\n-export([multiply/2]).\n\ntranspose([[]|_]) ->\n [];\ntranspose(B) ->\n [lists:map(fun hd/1, B) | transpose(lists:map(fun tl/1, B))].\n\n\nred(Pair, Sum) ->\n X = element(1, Pair), %gets X\n Y = element(2, Pair), %gets Y\n X * Y + Sum.\n\n%% Mathematical dot product. A x B = d\n%% A, B = 1-dimension vector\n%% d = scalar\ndot_product(A, B) ->\n lists:foldl(fun red/2, 0, lists:zip(A, B)).\n\n\n%% Exposed function. Expected result is C = A x B.\nmultiply(A, B) ->\n %% First transposes B, to facilitate the calculations (It's easier to fetch\n %% row than column wise).\n multiply_internal(A, transpose(B)).\n\n\n%% This function does the actual multiplication, but expects the second matrix\n%% to be transposed.\nmultiply_internal([Head | Rest], B) ->\n % multiply each row by Y\n Element = multiply_row_by_col(Head, B),\n\n % concatenate the result of this multiplication with the next ones\n [Element | multiply_internal(Rest, B)];\n\nmultiply_internal([], B) ->\n % concatenating and empty list to the end of a list, changes nothing.\n [].\n\n\nmultiply_row_by_col(Row, [Col_Head | Col_Rest]) ->\n Scalar = dot_product(Row, Col_Head),\n\n [Scalar | multiply_row_by_col(Row, Col_Rest)];\n\nmultiply_row_by_col(Row, []) ->\n [].\n","language":"Erlang"},{"code":"PROGRAM MAT_PROD\n\nDIM A[3,1],B[1,2],ANS[3,2]\n\nBEGIN\n\nDATA(1,2,3,4,5,6,7,8)\nDATA(1,2,3,4,5,6)\n\nFOR I=0 TO 3 DO\n FOR J=0 TO 1 DO\n READ(A[I,J])\n END FOR\nEND FOR\n\nFOR I=0 TO 1 DO\n FOR J=0 TO 2 DO\n READ(B[I,J])\n END FOR\nEND FOR\n\nFOR I=0 TO UBOUND(ANS,1) DO\n FOR J=0 TO UBOUND(ANS,2) DO\n FOR K=0 TO UBOUND(A,2) DO\n ANS[I,J]=ANS[I,J]+(A[I,K]*B[K,J])\n END FOR\n END FOR\nEND FOR\n! print answer\n FOR I=0 TO UBOUND(ANS,1) DO\n FOR J=0 TO UBOUND(ANS,2) DO\n PRINT(ANS[I,J],)\n END FOR\n PRINT\n END FOR\n\nEND PROGRAM\n","language":"ERRE"},{"code":"function matrix_mul(sequence a, sequence b)\n sequence c\n if length(a[1]) != length(b) then\n return 0\n else\n c = repeat(repeat(0,length(b[1])),length(a))\n for i = 1 to length(a) do\n for j = 1 to length(b[1]) do\n for k = 1 to length(a[1]) do\n c[i][j] += a[i][k]*b[k][j]\n end for\n end for\n end for\n return c\n end if\nend function\n","language":"Euphoria"},{"code":"let MatrixMultiply (matrix1 : _[,] , matrix2 : _[,]) =\n let result_row = (matrix1.GetLength 0)\n let result_column = (matrix2.GetLength 1)\n let ret = Array2D.create result_row result_column 0\n for x in 0 .. result_row - 1 do\n for y in 0 .. result_column - 1 do\n let mutable acc = 0\n for z in 0 .. (matrix1.GetLength 1) - 1 do\n acc <- acc + matrix1.[x,z] * matrix2.[z,y]\n ret.[x,y] <- acc\n ret\n","language":"F-Sharp"},{"code":"class Main\n{\n // multiply two matrices (with no error checking)\n public static Int[][] multiply (Int[][] m1, Int[][] m2)\n {\n Int[][] result := [,]\n m1.each |Int[] row1|\n {\n Int[] row := [,]\n m2[0].size.times |Int colNumber|\n {\n Int value := 0\n m2.each |Int[] row2, Int index|\n {\n value += row1[index] * row2[colNumber]\n }\n row.add (value)\n }\n result.add (row)\n }\n return result\n }\n\n public static Void main ()\n {\n m1 := [[1,2,3],[4,5,6]]\n m2 := [[1,2],[3,4],[5,6]]\n\n echo (\"${m1} times ${m2} = ${multiply(m1,m2)}\")\n }\n}\n","language":"Fantom"},{"code":"Array a[3,2]\nArray b[2,3]\n[a]:=[(2,3,5,7,11,13)]\n[b]:=[(1,1,2,3,5,8)]\n[a]*[b]\n","language":"Fermat"},{"code":"S\" fsl-util.fs\" REQUIRED\nS\" fsl/dynmem.seq\" REQUIRED\n: F+! ( addr -- ) ( F: r -- ) DUP F@ F+ F! ;\n: FSQR ( F: r1 -- r2 ) FDUP F* ;\nS\" fsl/gaussj.seq\" REQUIRED\n\n3 3 float matrix A{{\n1e 2e 3e 4e 5e 6e 7e 8e 9e 3 3 A{{ }}fput\n3 3 float matrix B{{\n3e 3e 3e 2e 2e 2e 1e 1e 1e 3 3 B{{ }}fput\nfloat dmatrix C{{ \\ result\n\nA{{ 3 3 B{{ 3 3 & C{{ mat*\n3 3 C{{ }}fprint\n","language":"Forth"},{"code":"real, dimension(n,m) :: a = reshape( [ (i, i=1, n*m) ], [ n, m ] )\nreal, dimension(m,k) :: b = reshape( [ (i, i=1, m*k) ], [ m, k ] )\nreal, dimension(size(a,1), size(b,2)) :: c ! C is an array whose first dimension (row) size\n ! is the same as A's first dimension size, and\n ! whose second dimension (column) size is the same\n ! as B's second dimension size.\n\nc = matmul( a, b )\n\nprint *, 'A'\ndo i = 1, n\n print *, a(i,:)\nend do\n\nprint *,\nprint *, 'B'\ndo i = 1, m\n print *, b(i,:)\nend do\n\nprint *,\nprint *, 'C = AB'\ndo i = 1, n\n print *, c(i,:)\nend do\n","language":"Fortran"},{"code":" program mm\n real , allocatable :: a(:,:),b(:,:)\n integer :: l=5,m=6,n=4\n a = reshape([1:l*m],[l,m])\n b = reshape([1:m*n],[m,n])\n print'(<n>f15.7)',transpose(matmul(a,b))\n end program\n","language":"Fortran"},{"code":"type Matrix\n dim as double m( any , any )\n declare constructor ( )\n declare constructor ( byval x as uinteger , byval y as uinteger )\nend type\n\nconstructor Matrix ( )\nend constructor\n\nconstructor Matrix ( byval x as uinteger , byval y as uinteger )\n redim this.m( x - 1 , y - 1 )\nend constructor\n\noperator * ( byref a as Matrix , byref b as Matrix ) as Matrix\n dim as Matrix ret\n dim as uinteger i, j, k\n if ubound( a.m , 2 ) = ubound( b.m , 1 ) and ubound( a.m , 1 ) = ubound( b.m , 2 ) then\n redim ret.m( ubound( a.m , 1 ) , ubound( b.m , 2 ) )\n for i = 0 to ubound( a.m , 1 )\n for j = 0 to ubound( b.m , 2 )\n for k = 0 to ubound( b.m , 1 )\n ret.m( i , j ) += a.m( i , k ) * b.m( k , j )\n next k\n next j\n next i\n end if\n return ret\nend operator\n\n'some garbage matrices for demonstration\ndim as Matrix a = Matrix(4 , 2)\na.m(0 , 0) = 1 : a.m(0 , 1) = 0\na.m(1 , 0) = 0 : a.m(1 , 1) = 1\na.m(2 , 0) = 2 : a.m(2 , 1) = 3\na.m(3 , 0) = 0.75 : a.m(3 , 1) = -0.5\ndim as Matrix b = Matrix( 2 , 4 )\nb.m(0 , 0) = 3.1 : b.m(0 , 1) = 1.6 : b.m(0 , 2) = -99 : b.m (0, 3) = -8\nb.m(1 , 0) = 2.7 : b.m(1 , 1) = 0.6 : b.m(1 , 2) = 0 : b.m(1,3) = 21\ndim as Matrix c = a * b\nprint c.m(0, 0), c.m(0, 1), c.m(0, 2), c.m(0, 3)\nprint c.m(1, 0), c.m(1, 1), c.m(1, 2), c.m(1, 3)\nprint c.m(2, 0), c.m(2, 1), c.m(2, 2), c.m(2, 3)\nprint c.m(3, 0), c.m(3, 1), c.m(3, 2), c.m(3, 3)\n","language":"FreeBASIC"},{"code":"matprod[a is array, b is array] :=\n{\n c = makeArray[[length[a], length[b@0]], 0]\n\n a_row = length[a]-1\n a_col = length[a@0]-1\n b_col = length[b]-1\n\n for row = 0 to a_row\n for col = 0 to b_col\n for inc = 0 to a_col\n c@row@col = c@row@col + (a@row@inc * b@inc@col)\n\n return c\n}\n","language":"Frink"},{"code":"fun main(x: [n][m]int, y: [m][p]int): [n][p]int =\n map (fn xr => map (fn yc => reduce (+) 0 (zipWith (*) xr yc))\n (transpose y))\n x\n","language":"Futhark"},{"code":"# Built-in\nA := [[1, 2], [3, 4], [5, 6], [7, 8]];\nB := [[1, 2, 3], [4, 5, 6]];\n\nPrintArray(A);\n# [ [ 1, 2 ],\n# [ 3, 4 ],\n# [ 5, 6 ],\n# [ 7, 8 ] ]\n\nPrintArray(B);\n# [ [ 1, 2, 3 ],\n# [ 4, 5, 6 ] ]\n\nPrintArray(A * B);\n# [ [ 9, 12, 15 ],\n# [ 19, 26, 33 ],\n# [ 29, 40, 51 ],\n# [ 39, 54, 69 ] ]\n","language":"GAP"},{"code":"package main\n\nimport (\n \"fmt\"\n\n \"gonum.org/v1/gonum/mat\"\n)\n\nfunc main() {\n a := mat.NewDense(2, 4, []float64{\n 1, 2, 3, 4,\n 5, 6, 7, 8,\n })\n b := mat.NewDense(4, 3, []float64{\n 1, 2, 3,\n 4, 5, 6,\n 7, 8, 9,\n 10, 11, 12,\n })\n var m mat.Dense\n m.Mul(a, b)\n fmt.Println(mat.Formatted(&m))\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n\n mat \"github.com/skelterjohn/go.matrix\"\n)\n\nfunc main() {\n a := mat.MakeDenseMatrixStacked([][]float64{\n {1, 2, 3, 4},\n {5, 6, 7, 8},\n })\n b := mat.MakeDenseMatrixStacked([][]float64{\n {1, 2, 3},\n {4, 5, 6},\n {7, 8, 9},\n {10, 11, 12},\n })\n fmt.Printf(\"Matrix A:\\n%v\\n\", a)\n fmt.Printf(\"Matrix B:\\n%v\\n\", b)\n p, err := a.TimesDense(b)\n if err != nil {\n fmt.Println(err)\n return\n }\n fmt.Printf(\"Product of A and B:\\n%v\\n\", p)\n}\n","language":"Go"},{"code":"package main\n\nimport \"fmt\"\n\ntype Value float64\ntype Matrix [][]Value\n\nfunc Multiply(m1, m2 Matrix) (m3 Matrix, ok bool) {\n rows, cols, extra := len(m1), len(m2[0]), len(m2)\n if len(m1[0]) != extra {\n return nil, false\n }\n m3 = make(Matrix, rows)\n for i := 0; i < rows; i++ {\n m3[i] = make([]Value, cols)\n for j := 0; j < cols; j++ {\n for k := 0; k < extra; k++ {\n m3[i][j] += m1[i][k] * m2[k][j]\n }\n }\n }\n return m3, true\n}\n\nfunc (m Matrix) String() string {\n rows := len(m)\n cols := len(m[0])\n out := \"[\"\n for r := 0; r < rows; r++ {\n if r > 0 {\n out += \",\\n \"\n }\n out += \"[ \"\n for c := 0; c < cols; c++ {\n if c > 0 {\n out += \", \"\n }\n out += fmt.Sprintf(\"%7.3f\", m[r][c])\n }\n out += \" ]\"\n }\n out += \"]\"\n return out\n}\n\nfunc main() {\n A := Matrix{[]Value{1, 2, 3, 4},\n []Value{5, 6, 7, 8}}\n B := Matrix{[]Value{1, 2, 3},\n []Value{4, 5, 6},\n []Value{7, 8, 9},\n []Value{10, 11, 12}}\n P, ok := Multiply(A, B)\n if !ok {\n panic(\"Invalid dimensions\")\n }\n fmt.Printf(\"Matrix A:\\n%s\\n\\n\", A)\n fmt.Printf(\"Matrix B:\\n%s\\n\\n\", B)\n fmt.Printf(\"Product of A and B:\\n%s\\n\\n\", P)\n}\n","language":"Go"},{"code":"package main\n\nimport \"fmt\"\n\ntype matrix struct {\n stride int\n ele []float64\n}\n\nfunc (m *matrix) print(heading string) {\n if heading > \"\" {\n fmt.Print(\"\\n\", heading, \"\\n\")\n }\n for e := 0; e < len(m.ele); e += m.stride {\n fmt.Printf(\"%8.3f \", m.ele[e:e+m.stride])\n fmt.Println()\n }\n}\n\nfunc (m1 *matrix) multiply(m2 *matrix) (m3 *matrix, ok bool) {\n if m1.stride*m2.stride != len(m2.ele) {\n return nil, false\n }\n m3 = &matrix{m2.stride, make([]float64, (len(m1.ele)/m1.stride)*m2.stride)}\n for m1c0, m3x := 0, 0; m1c0 < len(m1.ele); m1c0 += m1.stride {\n for m2r0 := 0; m2r0 < m2.stride; m2r0++ {\n for m1x, m2x := m1c0, m2r0; m2x < len(m2.ele); m2x += m2.stride {\n m3.ele[m3x] += m1.ele[m1x] * m2.ele[m2x]\n m1x++\n }\n m3x++\n }\n }\n return m3, true\n}\n\nfunc main() {\n a := matrix{4, []float64{\n 1, 2, 3, 4,\n 5, 6, 7, 8,\n }}\n b := matrix{3, []float64{\n 1, 2, 3,\n 4, 5, 6,\n 7, 8, 9,\n 10, 11, 12,\n }}\n p, ok := a.multiply(&b)\n a.print(\"Matrix A:\")\n b.print(\"Matrix B:\")\n if !ok {\n fmt.Println(\"not conformable for matrix multiplication\")\n return\n }\n p.print(\"Product of A and B:\")\n}\n","language":"Go"},{"code":"def assertConformable = { a, b ->\n assert a instanceof List\n assert b instanceof List\n assert a.every { it instanceof List && it.size() == b.size() }\n assert b.every { it instanceof List && it.size() == b[0].size() }\n}\n\ndef matmulWOIL = { a, b ->\n assertConformable(a, b)\n\n def bt = b.transpose()\n a.collect { ai ->\n bt.collect { btj ->\n [ai, btj].transpose().collect { it[0] * it[1] }.sum()\n }\n }\n}\n","language":"Groovy"},{"code":"def matmulWOT = { a, b ->\n assertConformable(a, b)\n\n (0..<a.size()).collect { i ->\n (0..<b[0].size()).collect { j ->\n (0..<b.size()).collect { k -> a[i][k] * b[k][j] }.sum()\n }\n }\n}\n","language":"Groovy"},{"code":"def m4by2 = [ [ 1, 2 ],\n [ 3, 4 ],\n [ 5, 6 ],\n [ 7, 8 ] ]\n\ndef m2by3 = [ [ 1, 2, 3 ],\n [ 4, 5, 6 ] ]\n\nmatmulWOIL(m4by2, m2by3).each { println it }\nprintln()\nmatmulWOT(m4by2, m2by3).each { println it }\n","language":"Groovy"},{"code":"import Data.List\n\n mmult :: Num a => [[a]] -> [[a]] -> [[a]]\n mmult a b = [ [ sum $ zipWith (*) ar bc | bc <- (transpose b) ] | ar <- a ]\n\n -- Example use:\n test = [[1, 2],\n [3, 4]] `mmult` [[-3, -8, 3],\n [-2, 1, 4]]\n","language":"Haskell"},{"code":"import Data.Array\n\n mmult :: (Ix i, Num a) => Array (i,i) a -> Array (i,i) a -> Array (i,i) a\n mmult x y\n | x1 /= y0 || x1' /= y0' = error \"range mismatch\"\n | otherwise = array ((x0,y1),(x0',y1')) l\n where\n ((x0,x1),(x0',x1')) = bounds x\n ((y0,y1),(y0',y1')) = bounds y\n ir = range (x0,x0')\n jr = range (y1,y1')\n kr = range (x1,x1')\n l = [((i,j), sum [x!(i,k) * y!(k,j) | k <- kr]) | i <- ir, j <- jr]\n","language":"Haskell"},{"code":"multiply :: Num a => [[a]] -> [[a]] -> [[a]]\nmultiply us vs = map (mult [] vs) us\n where\n mult xs [] _ = xs\n mult xs _ [] = xs\n mult [] (zs : zss) (y : ys) = mult (map (y *) zs) zss ys\n mult xs (zs : zss) (y : ys) =\n mult\n (zipWith (\\u v -> u + v * y) xs zs)\n zss\n ys\n\nmain :: IO ()\nmain =\n mapM_ print $\n multiply\n [[1, 2], [3, 4]]\n [[-3, -8, 3], [-2, 1, 4]]\n","language":"Haskell"},{"code":"mult :: Num a => [[a]] -> [[a]] -> [[a]]\nmult uss vss =\n let go xs\n | null xs = []\n | otherwise = foldl1 (zipWith (+)) xs\n in go . zipWith (flip (map . (*))) vss <$> uss\n\nmain :: IO ()\nmain =\n mapM_ print $\n mult [[1, 2], [3, 4]] [[-3, -8, 3], [-2, 1, 4]]\n","language":"Haskell"},{"code":"import Numeric.LinearAlgebra\n\na, b :: Matrix I\na = (2 >< 2) [1, 2, 3, 4]\n\nb = (2 >< 3) [-3, -8, 3, -2, 1, 4]\n\nmain :: IO ()\nmain = print $ a <> b\n","language":"Haskell"},{"code":"REAL :: m=4, n=2, p=3, a(m,n), b(n,p), res(m,p)\n\na = $ ! initialize to 1, 2, ..., m*n\nb = $ ! initialize to 1, 2, ..., n*p\n\nres = 0\nDO i = 1, m\n DO j = 1, p\n DO k = 1, n\n res(i,j) = res(i,j) + a(i,k) * b(k,j)\n ENDDO\n ENDDO\nENDDO\n\nDLG(DefWidth=4, Text=a, Text=b,Y=0, Text=res,Y=0)\n","language":"HicEst"},{"code":"a b res\n1 2 1 2 3 9 12 15\n3 4 4 5 6 19 26 33\n5 6 29 40 51\n7 8 39 54 69\n","language":"HicEst"},{"code":"link matrix\n\nprocedure main ()\n m1 := [[1,2,3], [4,5,6]]\n m2 := [[1,2],[3,4],[5,6]]\n m3 := mult_matrix (m1, m2)\n write (\"Multiply:\")\n write_matrix (\"\", m1) # first argument is filename, or \"\" for stdout\n write (\"by:\")\n write_matrix (\"\", m2)\n write (\"Result: \")\n write_matrix (\"\", m3)\nend\n","language":"Icon"},{"code":"procedure multiply_matrix (m1, m2)\n result := [] # to hold the final matrix\n every row1 := !m1 do { # loop through each row in the first matrix\n row := []\n every colIndex := 1 to *m1 do { # and each column index of the result\n value := 0\n every rowIndex := 1 to *m2 do {\n value +:= row1[rowIndex] * m2[rowIndex][colIndex]\n }\n put (row, value)\n }\n put (result, row) # add each row as it is complete\n }\n return result\nend\n","language":"Icon"},{"code":"result = arr1 # arr2\n","language":"IDL"},{"code":"import Data.Vect\n\nMatrix : Nat -> Nat -> Type -> Type\nMatrix m n t = Vect m (Vect n t)\n\nmultiply : Num t => Matrix m1 n t -> Matrix n m2 t -> Matrix m1 m2 t\nmultiply a b = multiply' a (transpose b)\n where\n dot : Num t => Vect n t -> Vect n t -> t\n dot v1 v2 = sum $ map (\\(s1, s2) => (s1 * s2)) (zip v1 v2)\n\n multiply' : Num t => Matrix m1 n t -> Matrix m2 n t -> Matrix m1 m2 t\n multiply' (a::as) b = map (dot a) b :: multiply' as b\n multiply' [] _ = []\n","language":"Idris"},{"code":" mp =: +/ .* NB. Matrix product\n\n A =: ^/~>:i. 4 NB. Same A as in other examples (1 1 1 1, 2 4 8 16, 3 9 27 81,:4 16 64 256)\n B =: %.A NB. Matrix inverse of A\n\n '6.2' 8!:2 A mp B\n1.00 0.00 0.00 0.00\n0.00 1.00 0.00 0.00\n0.00 0.00 1.00 0.00\n0.00 0.00 0.00 1.00\n","language":"J"},{"code":"x ~:/ .*. y NB. boolean inner product ( ~: is \"not equal\" (exclusive or) and *. is \"and\")\nx *./ .= y NB. which rows of x are the same as vector y?\nx + / .= y NB. number of places where a value in row x equals the corresponding value in y\n","language":"J"},{"code":"public static double[][] mult(double a[][], double b[][]){//a[m][n], b[n][p]\n if(a.length == 0) return new double[0][0];\n if(a[0].length != b.length) return null; //invalid dims\n\n int n = a[0].length;\n int m = a.length;\n int p = b[0].length;\n\n double ans[][] = new double[m][p];\n\n for(int i = 0;i < m;i++){\n for(int j = 0;j < p;j++){\n for(int k = 0;k < n;k++){\n ans[i][j] += a[i][k] * b[k][j];\n }\n }\n }\n return ans;\n}\n","language":"Java"},{"code":"// returns a new matrix\nMatrix.prototype.mult = function(other) {\n if (this.width != other.height) {\n throw \"error: incompatible sizes\";\n }\n\n var result = [];\n for (var i = 0; i < this.height; i++) {\n result[i] = [];\n for (var j = 0; j < other.width; j++) {\n var sum = 0;\n for (var k = 0; k < this.width; k++) {\n sum += this.mtx[i][k] * other.mtx[k][j];\n }\n result[i][j] = sum;\n }\n }\n return new Matrix(result);\n}\n\nvar a = new Matrix([[1,2],[3,4]])\nvar b = new Matrix([[-3,-8,3],[-2,1,4]]);\nprint(a.mult(b));\n","language":"JavaScript"},{"code":"(function () {\n 'use strict';\n\n // matrixMultiply:: [[n]] -> [[n]] -> [[n]]\n function matrixMultiply(a, b) {\n var bCols = transpose(b);\n\n return a.map(function (aRow) {\n return bCols.map(function (bCol) {\n return dotProduct(aRow, bCol);\n });\n });\n }\n\n // [[n]] -> [[n]] -> [[n]]\n function dotProduct(xs, ys) {\n return sum(zipWith(product, xs, ys));\n }\n\n return matrixMultiply(\n [[-1, 1, 4],\n [ 6, -4, 2],\n [-3, 5, 0],\n [ 3, 7, -2]],\n\n [[-1, 1, 4, 8],\n [ 6, 9, 10, 2],\n [11, -4, 5, -3]]\n );\n\n // --> [[51, -8, 26, -18], [-8, -38, -6, 34],\n // [33, 42, 38, -14], [17, 74, 72, 44]]\n\n\n // GENERIC LIBRARY FUNCTIONS\n\n // (a -> b -> c) -> [a] -> [b] -> [c]\n function zipWith(f, xs, ys) {\n return xs.length === ys.length ? (\n xs.map(function (x, i) {\n return f(x, ys[i]);\n })\n ) : undefined;\n }\n\n // [[a]] -> [[a]]\n function transpose(lst) {\n return lst[0].map(function (_, iCol) {\n return lst.map(function (row) {\n return row[iCol];\n });\n });\n }\n\n // sum :: (Num a) => [a] -> a\n function sum(xs) {\n return xs.reduce(function (a, x) {\n return a + x;\n }, 0);\n }\n\n // product :: n -> n -> n\n function product(a, b) {\n return a * b;\n }\n\n})();\n","language":"JavaScript"},{"code":"[[51, -8, 26, -18], [-8, -38, -6, 34],\n [33, 42, 38, -14], [17, 74, 72, 44]]\n","language":"JavaScript"},{"code":"((() => {\n \"use strict\";\n\n // -------------- MATRIX MULTIPLICATION --------------\n\n // matrixMultiply :: Num a => [[a]] -> [[a]] -> [[a]]\n const matrixMultiply = a =>\n b => {\n const cols = transpose(b);\n\n return a.map(\n compose(\n f => cols.map(f),\n dotProduct\n )\n );\n };\n\n\n // ---------------------- TEST -----------------------\n const main = () =>\n JSON.stringify(matrixMultiply(\n [\n [-1, 1, 4],\n [6, -4, 2],\n [-3, 5, 0],\n [3, 7, -2]\n ]\n )([\n [-1, 1, 4, 8],\n [6, 9, 10, 2],\n [11, -4, 5, -3]\n ]));\n\n\n // --------------------- GENERIC ---------------------\n\n // compose (<<<) :: (b -> c) -> (a -> b) -> a -> c\n const compose = (...fs) =>\n // A function defined by the right-to-left\n // composition of all the functions in fs.\n fs.reduce(\n (f, g) => x => f(g(x)),\n x => x\n );\n\n\n // dotProduct :: Num a => [[a]] -> [[a]] -> [[a]]\n const dotProduct = xs =>\n // Sum of the products of the corresponding\n // values in two lists of the same length.\n compose(sum, zipWith(mul)(xs));\n\n\n // mul :: Num a => a -> a -> a\n const mul = a =>\n b => a * b;\n\n\n // sum :: (Num a) => [a] -> a\n const sum = xs =>\n xs.reduce((a, x) => a + x, 0);\n\n\n // transpose :: [[a]] -> [[a]]\n const transpose = rows =>\n // The columns of the input transposed\n // into new rows.\n // Simpler version of transpose, assuming input\n // rows of even length.\n Boolean(rows.length) ? rows[0].map(\n (_, i) => rows.flatMap(\n v => v[i]\n )\n ) : [];\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 // MAIN ---\n return main();\n}))();\n","language":"JavaScript"},{"code":"def dot_product(a; b):\n a as $a | b as $b\n | reduce range(0;$a|length) as $i (0; . + ($a[$i] * $b[$i]) );\n\n# transpose/0 expects its input to be a rectangular matrix (an array of equal-length arrays)\ndef transpose:\n if (.[0] | length) == 0 then []\n else [map(.[0])] + (map(.[1:]) | transpose)\n end ;\n\n# A and B should both be numeric matrices, A being m by n, and B being n by p.\ndef multiply(A; B):\n A as $A | B as $B\n | ($B[0]|length) as $p\n | ($B|transpose) as $BT\n | reduce range(0; $A|length) as $i\n ([]; reduce range(0; $p) as $j\n (.; .[$i][$j] = dot_product( $A[$i]; $BT[$j] ) )) ;\n","language":"Jq"},{"code":"/* Matrix multiplication, in Jsish */\nrequire('Matrix');\n\nif (Interp.conf('unitTest')) {\n var a = new Matrix([[1,2],[3,4]]);\n var b = new Matrix([[-3,-8,3],[-2,1,4]]);\n; a;\n; b;\n; a.mult(b);\n}\n\n/*\n=!EXPECTSTART!=\na ==> { height:2, mtx:[ [ 1, 2 ], [ 3, 4 ] ], width:2 }\nb ==> { height:2, mtx:[ [ -3, -8, 3 ], [ -2, 1, 4 ] ], width:3 }\na.mult(b) ==> { height:2, mtx:[ [ -7, -6, 11 ], [ -17, -20, 25 ] ], width:3 }\n=!EXPECTEND!=\n*/\n","language":"Jsish"},{"code":"julia> [1 2 3 ; 4 5 6] * [1 2 ; 3 4 ; 5 6] # product of a 2x3 by a 3x2\n2x2 Array{Int64,2}:\n 22 28\n 49 64\n\njulia> [1 2 3] * [1,2,3] # product of a row vector by a column vector\n1-element Array{Int64,1}:\n 14\n","language":"Julia"},{"code":" (1 2;3 4)_mul (5 6;7 8)\n(19 22\n 43 50)\n","language":"K"},{"code":" mul::{[a b];b::+y;{a::x;+/'{a*x}'b}'x}\n [[1 2] [3 4]] mul [[5 6] [7 8]]\n[[19 22]\n [43 50]]\n","language":"Klong"},{"code":"// version 1.1.3\n\ntypealias Vector = DoubleArray\ntypealias Matrix = Array<Vector>\n\noperator fun Matrix.times(other: Matrix): Matrix {\n val rows1 = this.size\n val cols1 = this[0].size\n val rows2 = other.size\n val cols2 = other[0].size\n require(cols1 == rows2)\n val result = Matrix(rows1) { Vector(cols2) }\n for (i in 0 until rows1) {\n for (j in 0 until cols2) {\n for (k in 0 until rows2) {\n result[i][j] += this[i][k] * other[k][j]\n }\n }\n }\n return result\n}\n\nfun printMatrix(m: Matrix) {\n for (i in 0 until m.size) println(m[i].contentToString())\n}\n\nfun main(args: Array<String>) {\n val m1 = arrayOf(\n doubleArrayOf(-1.0, 1.0, 4.0),\n doubleArrayOf( 6.0, -4.0, 2.0),\n doubleArrayOf(-3.0, 5.0, 0.0),\n doubleArrayOf( 3.0, 7.0, -2.0)\n )\n val m2 = arrayOf(\n doubleArrayOf(-1.0, 1.0, 4.0, 8.0),\n doubleArrayOf( 6.0, 9.0, 10.0, 2.0),\n doubleArrayOf(11.0, -4.0, 5.0, -3.0)\n )\n printMatrix(m1 * m2)\n}\n","language":"Kotlin"},{"code":"{require lib_matrix}\n\n1) applying a matrix to a vector\n\n{def M\n {M.new [[1,2,3],\n [4,5,6],\n [7,8,-9]]}}\n-> M\n\n{def V {M.new [1,2,3]} }\n-> V\n\n{M.multiply {M} {V}}\n-> [14,32,-4]\n\n2) matrix multiplication\n\n{M.multiply {M} {M}}\n-> [[ 30, 36,-12],\n [ 66, 81,-12],\n [-24,-18,150]]\n","language":"Lambdatalk"},{"code":"[[1 2 3] [4 5 6]] 'm dress\n[[1 2] [3 4] [5 6]] 'm dress * .\n","language":"Lang5"},{"code":"(defun matrix* (matrix-1 matrix-2)\n (list-comp\n ((<- a matrix-1))\n (list-comp\n ((<- b (transpose matrix-2)))\n (lists:foldl #'+/2 0\n (lists:zipwith #'*/2 a b)))))\n","language":"LFE"},{"code":"> (set ma '((1 2)\n (3 4)\n (5 6)\n (7 8)))\n((1 2) (3 4) (5 6) (7 8))\n> (set mb (transpose ma))\n((1 3 5 7) (2 4 6 8))\n> (matrix* ma mb)\n((5 11 17 23) (11 25 39 53) (17 39 61 83) (23 53 83 113))\n","language":"LFE"},{"code":"MatrixA$ =\"4, 4, 1, 1, 1, 1, 2, 4, 8, 16, 3, 9, 27, 81, 4, 16, 64, 256\"\nMatrixB$ =\"4, 4, 4, -3, 4/3, -1/4 , -13/3, 19/4, -7/3, 11/24, 3/2, -2, 7/6, -1/4, -1/6, 1/4, -1/6, 1/24\"\n\nprint \"Product of two matrices\"\ncall DisplayMatrix MatrixA$\nprint \" *\"\ncall DisplayMatrix MatrixB$\nprint \" =\"\nMatrixP$ =MatrixMultiply$( MatrixA$, MatrixB$)\ncall DisplayMatrix MatrixP$\n","language":"Liberty-BASIC"},{"code":"TO LISTVMD :A :F :C :NV\n;PROCEDURE LISTVMD\n;A = LIST\n;F = ROWS\n;C = COLS\n;NV = NAME OF MATRIX / VECTOR NEW\n;this procedure transform a list in matrix / vector square or rect\n\n(LOCAL \"CF \"CC \"NV \"T \"W)\nMAKE \"CF 1\nMAKE \"CC 1\nMAKE \"NV (MDARRAY (LIST :F :C) 1)\nMAKE \"T :F * :C\nFOR [Z 1 :T][MAKE \"W ITEM :Z :A\nMDSETITEM (LIST :CF :CC) :NV :W\nMAKE \"CC :CC + 1\nIF :CC = :C + 1 [MAKE \"CF :CF + 1 MAKE \"CC 1]]\nOUTPUT :NV\nEND\n::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\n::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\n\n\nTO XX\n; MAIN PROGRAM\n;LRCVS 10.04.12\n; THIS PROGRAM multiplies two \"square\" matrices / vector ONLY!!!\n; THE RECTANGULAR NOT WORK!!!\n\nCT CS HT\n\n; FIRST DATA MATRIX / VECTOR\nMAKE \"A [1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49]\nMAKE \"FA 5 ;\"ROWS\nMAKE \"CA 5 ;\"COLS\n\n; SECOND DATA MATRIX / VECTOR\nMAKE \"B [2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50]\nMAKE \"FB 5 ;\"ROWS\nMAKE \"CB 5 ;\"COLS\n\n\nIF (OR :FA <> :CA :FB <>:CB) [PRINT \"Las_matrices/vector_no_son_cuadradas THROW\n\"TOPLEVEL ]\nIFELSE (OR :CA <> :FB :FA <> :CB) [PRINT\n\"Las_matrices/vector_no_son_compatibles THROW \"TOPLEVEL ][MAKE \"MA LISTVMD :A\n:FA :CA \"MA MAKE \"MB LISTVMD :B :FB :CB \"MB] ;APPLICATION <<< \"LISTVMD\"\n\nPRINT (LIST \"THIS_IS: \"ROWS \"X \"COLS)\nPRINT []\nPRINT (LIST :MA \"=_M1 :FA \"ROWS \"X :CA \"COLS)\nPRINT []\nPRINT (LIST :MB \"=_M2 :FA \"ROWS \"X :CA \"COLS)\nPRINT []\n\n\nMAKE \"T :FA * :CB\nMAKE \"RE (ARRAY :T 1)\n\n\nMAKE \"CO 0\nFOR [AF 1 :CA][\nFOR [AC 1 :CA][\nMAKE \"TEMP 0\nFOR [I 1 :CA ][\nMAKE \"TEMP :TEMP + (MDITEM (LIST :I :AF) :MA) * (MDITEM (LIST :AC :I) :MB)]\nMAKE \"CO :CO + 1\nSETITEM :CO :RE :TEMP]]\n\n\nPRINT []\nPRINT (LIST \"THIS_IS: :FA \"ROWS \"X :CB \"COLS)\nSHOW LISTVMD :RE :FA :CB \"TO ;APPLICATION <<< \"LISTVMD\"\nEND\n\n\n::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\\\n\n\n M1 * M2 RESULT / SOLUTION\n\n 1 3 5 7 9 2 4 6 8 10 830 1880 2930 3980 5030\n11 13 15 17 19 12 14 16 18 20 890 2040 3190 4340 5490\n21 23 25 27 29 X 22 24 26 28 30 = 950 2200 3450 4700 5950\n31 33 35 37 39 32 34 36 38 40 1010 2360 3710 5060 6410\n41 43 45 47 49 42 44 46 48 50 1070 2520 3970 5420 6870\n\n::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\\\n\n\nNOW IN LOGO!!!!\n\n\nTHIS_IS: ROWS X COLS\n\n{{1 3 5 7 9} {11 13 15 17 19} {21 23 25 27 29} {31 33 35 37 39} {41 43 45 47\n49}} =_M1 5 ROWS X 5 COLS\n\n{{2 4 6 8 10} {12 14 16 18 20} {22 24 26 28 30} {32 34 36 38 40} {42 44 46 48\n50}} =_M2 5 ROWS X 5 COLS\n\n\nTHIS_IS: 5 ROWS X 5 COLS\n{{830 1880 2930 3980 5030} {890 2040 3190 4340 5490} {950 2200 3450 4700 5950}\n{1010 2360 3710 5060 6410} {1070 2520 3970 5420 6870}}\n","language":"Logo"},{"code":"function MatMul( m1, m2 )\n if #m1[1] ~= #m2 then -- inner matrix-dimensions must agree\n return nil\n end\n\n local res = {}\n\n for i = 1, #m1 do\n res[i] = {}\n for j = 1, #m2[1] do\n res[i][j] = 0\n for k = 1, #m2 do\n res[i][j] = res[i][j] + m1[i][k] * m2[k][j]\n end\n end\n end\n\n return res\nend\n\n-- Test for MatMul\nmat1 = { { 1, 2, 3 }, { 4, 5, 6 } }\nmat2 = { { 1, 2 }, { 3, 4 }, { 5, 6 } }\nerg = MatMul( mat1, mat2 )\nfor i = 1, #erg do\n for j = 1, #erg[1] do\n io.write( erg[i][j] )\n io.write(\" \")\n end\n io.write(\"\\n\")\nend\n","language":"Lua"},{"code":"local alg = require(\"sci.alg\")\nmat1 = alg.tomat{{1, 2, 3}, {4, 5, 6}}\nmat2 = alg.tomat{{1, 2}, {3, 4}, {5, 6}}\nmat3 = mat1[] ** mat2[]\nprint(mat3)\n","language":"Lua"},{"code":"Module CheckMatMult {\n\t\\\\ Matrix Multiplication\n\t\\\\ we use array pointers so we pass arrays byvalue but change this by reference\n\t\\\\ this can be done because always arrays passed by reference,\n\t\\\\ and Read statement decide if this goes to a pointer of array or copied to a local array\n\t\\\\ the first line of code for MatMul is: Read a as array, b as array\n\t\\\\ interpreter insert this at function construction.\n\t\\\\ if a pointer inside function change to point to a new array, the this has no reflect to the passed array.\n\tFunction MatMul(a as array, b as array) {\n\t\tif dimension(a)<>2 or dimension(b)<>2 then Error \"Need two 2D arrays \"\n\t\tlet a2=dimension(a,2), b1=dimension(b,1)\n\t\tif a2<>b1 then Error \"Need columns of first array equal to rows of second array\"\n\t\tlet a1=dimension(a,1), b2=dimension(b,2)\n\t\tlet aBase=dimension(a,1,0)-1, bBase=dimension(b,1,0)-1\n\t\tlet aBase1=dimension(a,2,0)-1, bBase1=dimension(b,2,0)-1\n\t\tlink a,b to a(), b() ' change interface for arrays\n\t\tdim base 1, c(a1, b2)\n\t\tfor i=1 to a1 : let ia=i+abase : for j=1 to b2 : let jb=j+bBase1 : for k=1 to a2\n\t\tc(i,j)+=a(ia,k+aBase1)*b(k+bBase,jb)\n\t\tnext k : next j : next i\n\t\t\\\\ redim to base 0\n\t\tdim base 0, c(a1, b2)\n\t\t=c()\n\t}\n\t\\\\ define arrays with different base per dimension\n\t\\\\ res() defined as empty array\n\tdim a(10 to 13, 4), b(4, 2 to 5), res()\n\t\\\\ numbers from ADA task\n\ta(10,0)= 1, 1, 1, 1, 2, 4, 8, 16, 3, 9, 27, 81, 4, 16, 64, 256\n\tb(0,2)= 4, -3, 4/3, -1/4, -13/3, 19/4, -7/3, 11/24, 3/2, -2, 7/6, -1/4, -1/6, 1/4, -1/6, 1/24\n\tres()=MatMul(a(), b())\n\tfor i=0 to 3 :for j=0 to 3\n\tPrint res(i,j),\n\tnext j : Print : next i\n}\nCheckMatMult\nModule CheckMatMult2 {\n\t\\\\ Matrix Multiplication\n\t\\\\ pass arrays by reference\n\t\\\\ if we change a passed array here, to a new array then this change also the reference array.\n\tFunction MatMul(&a(),&b()) {\n\t\tif dimension(a())<>2 or dimension(b())<>2 then Error \"Need two 2D arrays \"\n\t\tlet a2=dimension(a(),2), b1=dimension(b(),1)\n\t\tif a2<>b1 then Error \"Need columns of first array equal to rows of second array\"\n\t\tlet a1=dimension(a(),1), b2=dimension(b(),2)\n\t\tlet aBase=dimension(a(),1,0)-1, bBase=dimension(b(),1,0)-1\n\t\tlet aBase1=dimension(a(),2,0)-1, bBase1=dimension(b(),2,0)-1\n\t\tdim base 1, c(a1, b2)\n\t\tfor i=1 to a1 : let ia=i+abase : for j=1 to b2 : let jb=j+bBase1 : for k=1 to a2\n\t\tc(i,j)+=a(ia,k+aBase1)*b(k+bBase,jb)\n\t\tnext k : next j : next i\n\t\t\\\\ redim to base 0\n\t\tdim base 0, c(a1, b2)\n\t\t=c()\n\t}\n\t\\\\ define arrays with different base per dimension\n\t\\\\ res() defined as empty array\n\tdim a(10 to 13, 4), b(4, 2 to 5), res()\n\t\\\\ numbers from ADA task\n\ta(10,0)= 1, 1, 1, 1, 2, 4, 8, 16, 3, 9, 27, 81, 4, 16, 64, 256\n\tb(0,2)= 4, -3, 4/3, -1/4, -13/3, 19/4, -7/3, 11/24, 3/2, -2, 7/6, -1/4, -1/6, 1/4, -1/6, 1/24\n\tres()=MatMul(&a(), &b())\n\tfor i=0 to 3 :for j=0 to 3\n\tPrint res(i,j),\n\tnext j : Print : next i\n}\nCheckMatMult2\n","language":"M2000-Interpreter"},{"code":"A := <<1|2|3>,<4|5|6>>;\n\nB := <<1,2,3>|<4,5,6>|<7,8,9>|<10,11,12>>;\n\nA . B;\n","language":"Maple"},{"code":">> A = [2,3; -2,1]\n 2 3\n-2 1\n\n>> B = [1,2;4,2]\n 1 2\n 4 2\n\n>> A * B\n 14 10\n 2 -2\n","language":"MathCortex"},{"code":"Dot[{{a, b}, {c, d}}, {{w, x}, {y, z}}]\n","language":"Mathematica"},{"code":"{{a w + b y, a x + b z}, {c w + d y, c x + d z}}\n","language":"Mathematica"},{"code":"{{a, b}, {c, d}} . {{w, x}, {y, z}}\n","language":"Mathematica"},{"code":"Times[{{a, b}, {c, d}}, {{w, x}, {y, z}}]\n","language":"Mathematica"},{"code":"{{a w, b x}, {c y, d z}}\n","language":"Mathematica"},{"code":"{{a, b}, {c, d}}*{{w, x}, {y, z}}\n","language":"Mathematica"},{"code":"{{a, b}, {c, d}} {{w, x}, {y, z}}\n","language":"Mathematica"},{"code":"Dot[{{85, 60, 65}, {54, 99, 33}, {46, 52, 87}}, {{89, 77, 98}, {55, 27, 25}, {80, 68, 85}}]\n","language":"Mathematica"},{"code":"{{16065, 12585, 15355}, {12891, 9075, 10572}, {13914, 10862, 13203}}\n","language":"Mathematica"},{"code":">> A = [1 2;3 4]\n\nA =\n\n 1 2\n 3 4\n\n>> B = [5 6;7 8]\n\nB =\n\n 5 6\n 7 8\n\n>> A * B\n\nans =\n\n 19 22\n 43 50\n\n>> mtimes(A,B)\n\nans =\n\n 19 22\n 43 50\n","language":"MATLAB"},{"code":"a: matrix([1, 2],\n [3, 4],\n [5, 6],\n [7, 8])$\n\nb: matrix([1, 2, 3],\n [4, 5, 6])$\n\na . b;\n/* matrix([ 9, 12, 15],\n [19, 26, 33],\n [29, 40, 51],\n [39, 54, 69]) */\n","language":"Maxima"},{"code":"|A := 4 4 reshape 1 1 1 1 2 4 8 16 3 9 27 81 4 16 64 256\n=1 1 1 1\n=2 4 8 16\n=3 9 27 81\n=4 16 64 256\n|B := inverse A\n\n|A innerproduct B\n=1. 0. 8.3e-17 -2.9e-16\n=1.3e-15 1. -4.4e-16 -3.3e-16\n=0. 0. 1. 4.4e-16\n=0. 0. 0. 1.\n","language":"Nial"},{"code":"import strfmt\n\ntype Matrix[M, N: static[int]] = array[M, array[N, float]]\n\nlet a = [[1.0, 1.0, 1.0, 1.0],\n [2.0, 4.0, 8.0, 16.0],\n [3.0, 9.0, 27.0, 81.0],\n [4.0, 16.0, 64.0, 256.0]]\n\nlet b = [[ 4.0, -3.0 , 4/3.0, -1/4.0],\n [-13/3.0, 19/4.0, -7/3.0, 11/24.0],\n [ 3/2.0, -2.0 , 7/6.0, -1/4.0],\n [ -1/6.0, 1/4.0, -1/6.0, 1/24.0]]\n\nproc `$`(m: Matrix): string =\n result = \"([\"\n for r in m:\n if result.len > 2: result.add \"]\\n [\"\n for val in r: result.add val.format(\"8.2f\")\n result.add \"])\"\n\nproc `*`[M, P, N](a: Matrix[M, P]; b: Matrix[P, N]): Matrix[M, N] =\n for i in result.low .. result.high:\n for j in result[0].low .. result[0].high:\n for k in a[0].low .. a[0].high:\n result[i][j] += a[i][k] * b[k][j]\n\necho a\necho b\necho a * b\necho b * a\n","language":"Nim"},{"code":"let matrix_multiply x y =\n let x0 = Array.length x\n and y0 = Array.length y in\n let y1 = if y0 = 0 then 0 else Array.length y.(0) in\n let z = Array.make_matrix x0 y1 0 in\n for i = 0 to x0-1 do\n for j = 0 to y1-1 do\n for k = 0 to y0-1 do\n z.(i).(j) <- z.(i).(j) + x.(i).(k) * y.(k).(j)\n done\n done\n done;\n z\n","language":"OCaml"},{"code":"(* equivalent to (apply map ...) *)\nlet rec mapn f lists =\n assert (lists <> []);\n if List.mem [] lists then\n []\n else\n f (List.map List.hd lists) :: mapn f (List.map List.tl lists)\n\nlet matrix_multiply m1 m2 =\n List.map\n (fun row ->\n mapn\n (fun column ->\n List.fold_left (+) 0\n (List.map2 ( * ) row column))\n m2)\n m1\n","language":"OCaml"},{"code":"a = zeros(4);\n% prepare the matrix\n% 1 1 1 1\n% 2 4 8 16\n% 3 9 27 81\n% 4 16 64 256\nfor i = 1:4\n for j = 1:4\n a(i, j) = i^j;\n endfor\nendfor\nb = inverse(a);\na * b\n","language":"Octave"},{"code":"; short version based on 'apply'\n(define (matrix-multiply matrix1 matrix2)\n(map\n (lambda (row)\n (apply map\n (lambda column\n (apply + (map * row column)))\n matrix2))\n matrix1))\n","language":"Ol"},{"code":"; long version based on recursive cycles\n(define (matrix-multiply A B)\n (define m (length A))\n (define n (length (car A)))\n (assert (eq? (length B) n) ===> #true)\n (define q (length (car B)))\n (define (at m x y)\n (lref (lref m x) y))\n\n\n (let mloop ((i (- m 1)) (rows #null))\n (if (< i 0)\n rows\n (mloop\n (- i 1)\n (cons\n (let rloop ((j (- q 1)) (r #null))\n (if (< j 0)\n r\n (rloop\n (- j 1)\n (cons\n (let loop ((k 0) (c 0))\n (if (eq? k n)\n c\n (loop (+ k 1) (+ c (* (at A i k) (at B k j))))))\n r))))\n rows)))))\n","language":"Ol"},{"code":"; [372x17] * [17x372]\n(define M 372)\n(define N 17)\n\n; [0 1 2 ... 371]\n; [1 2 3 ... 372]\n; [2 3 4 ... 373]\n; ...\n; [16 17 ... 387]\n(define A (map (lambda (i)\n (iota M i))\n (iota N)))\n\n; [0 1 2 ... 16]\n; [1 2 3 ... 17]\n; [2 3 4 ... 18]\n; ...\n; [371 372 ... 387]\n(define B (map (lambda (i)\n (iota N i))\n (iota M)))\n\n(for-each print (matrix-multiply A B))\n","language":"Ol"},{"code":"/*REXX program multiplies two matrices together, */\n/* displays the matrices and the result. */\nSignal On syntax\nx.=0\na=.matrix~new('A',4,2,1 2 3 4 5 6 7 8) /* create matrix A */\nb=.matrix~new('B',2,3,1 2 3 4 5 6) /* create matrix B */\nIf a~cols<>b~rows Then\n Call exit 'Matrices are incompatible for matrix multiplication',\n 'a~cols='a~cols'<>b~rows='||b~rows\n-- say a~name'[2,2] changed from' a~set(2,2,4711) 'to 4711' ; Pull .\nc=multMat(a,b) /* multiply A x B */\na~show\nb~show\nc~show\nExit\n\nmultMat: Procedure\n Use Arg a,b\n c.=0\n Do i=1 To a~rows\n Do j=1 To b~cols\n Do k=1 To a~cols\n c.i.j=c.i.j+a~element(i,k)*b~element(k,j)\n End /*k*/\n End /*j*/\n End /*i*/\n mm=''\n Do i=1 To a~rows\n Do j=1 To b~cols\n mm=mm C.i.j\n End /*j*/\n End /*i*/\n c=.matrix~new('C',a~rows,b~cols,mm)\n Return c\n/*--------------------------------------------------------------------*/\nExit:\n Say arg(1)\n Exit\nSyntax:\n Say 'Syntax raised in line' sigl\n Say sourceline(sigl)\n Say 'rc='rc '('errortext(rc)')'\n Say '***** There was a problem!'\n Exit\n\n::class Matrix\n/********************************************************************\n* Matrix is implemented as an array of rows\n* where each row is an arryay of elements.\n********************************************************************/\n::Attribute name\n::Attribute rows\n::Attribute cols\n\n::Method init\n expose m name rows cols\n Use Arg name,rows,cols,elements\n If words(elements)<>(rows*cols) Then Do\n Say 'incorrect number of elements ('words(elements)')<>'||(rows*cols)\n m=.nil\n Return\n End\n m=.array~new\n Do r=1 To rows\n ro=.array~new\n Do c=1 To cols\n Parse Var elements e elements\n ro~append(e)\n End\n m~append(ro)\n End\n\n::Method element /* get an element's value */\n expose m\n Use Arg r,c\n ro=m[r]\n Return ro[c]\n\n::Method set /* set an element's value and return its previous */\n expose m\n Use Arg r,c,new\n ro=m[r]\n old=ro[c]\n ro[c]=new\n Return old\n\n::Method show /* display the matrix */\n expose m name rows cols\n z='+'\n b6=left('',6)\n Say ''\n Say b6 copies('-',7) 'matrix' name copies('-',7)\n w=0\n Do r=1 To rows\n ro=m[r]\n Do c=1 To cols\n x=ro[c]\n w=max(w,length(x))\n End\n End\n Say b6 b6 '+'copies('-',cols*(w+1)+1)'+' /* top border */\n Do r=1 To rows\n ro=m[r]\n line='|' right(ro[1],w) /* element of first colsumn */ /* start with long vertical bar */\n Do c=2 To cols /* loop for other columns */\n line=line right(ro[c],w) /* append the elements */\n End /* c */\n Say b6 b6 line '|' /* append a long vertical bar. */\n End /* r */\n Say b6 b6 '+'copies('-',cols*(w+1)+1)'+' /* bottom border */\n Return\n","language":"OoRexx"},{"code":" 'generic with striding pointers\n 'def typ float\n typedef float typ\n '\n function MatMul(typ *r,*a,*b, int n=4) 'NxN MATRIX : N=1..\n ============================================================\n int ystep=sizeof typ\n int xstep=n*sizeof typ\n int i,j,k\n sys px\n for i=1 to n\n px=@a\n for j=1 to n\n r=0\n for k=1 to n\n r+=(a*b)\n @a+=xstep\n @b+=ystep\n next\n @r+=ystep\n px+=ystep\n @a=px\n @b-=xstep\n next\n @a-=xstep\n @b+=xstep\n next\n end function\n","language":"OxygenBasic"},{"code":" 'Example of matrix layout mapped to an array of 4x4 cells\n '\n ' 0 4 8 C\n ' 1 5 9 D\n ' 2 6 A E\n ' 3 7 B F\n '\n\n % MatrixType double\n\n sub MatrixMul(MatrixType *A,*B,*C, sys n)\n '========================================\n '\n '\n #if leftmatch matrixtype single\n % OneStep 4\n % mtype single\n #endif\n '\n #if leftmatch matrixtype double\n % OneStep 8\n % mtype double\n #endif\n\n sys pa=@A, pb=@B, pc=@C\n sys ColStep=OneStep*n\n\n mov ecx,pa\n mov edx,pb\n mov eax,pc\n\n mov esi,n\n (\n call column : dec esi : jg repeat\n )\n exit sub\n\n column:\n '======\n\n mov edi,n\n (\n call cell : dec edi : jg repeat\n )\n add edx,ColStep\n sub ecx,ColStep\n ret\n\n cell: ' row A * column B\n '=======================\n\n 'matrix data is stored ascending vertically then horizontally\n 'thus rows are minor, columns are major\n '\n push ecx\n push edx\n push eax\n mov eax,4\n fldz\n (\n fld mtype [ecx]\n fmul mtype [edx]\n faddp st1\n add ecx,ColStep 'next column of matrix A\n add edx,OneStep 'next row of matrix B\n dec eax\n jnz repeat\n )\n pop eax\n fstp mtype [eax] 'assign to next row of matrix C\n '\n pop edx\n pop ecx\n add eax,OneStep 'next cell in column of matrix C (columns then rows)\n add ecx,OneStep 'next row of matrix A\n ret\n '\n end sub\n\n\n function ShowMatrix(MatrixType*A,sys n) as string\n '================================================\n string cr=chr(13)+chr(10), tab=chr(9)\n function=\"MATRIX \" n \"x\" n cr cr\n sys i,j,m\n '\n for i=1 to n\n m=0\n for j=1 to n\n function+=str( A[m+i] ) tab\n m+=n\n next\n function+=cr\n next\n end function\n\n 'TEST\n '====\n\n % n 4\n MatrixType A[n*n],B[n*n],C[n*n]\n\n\n 'reading vertically (minor) then left to right (major)\n\n A <= 4,0,0,1, 0,4,0,0, 0,0,4,0, 0,0,0,4\n\n B <= 2,0,0,2, 0,2,0,0, 0,0,2,0, 0,0,0,2\n\n\n MatrixMul A,B,C,n\n\n Print ShowMatrix C,n\n","language":"OxygenBasic"},{"code":"M*N\n","language":"PARI-GP"},{"code":"sub mmult\n {\n our @a; local *a = shift;\n our @b; local *b = shift;\n my @p = [];\n my $rows = @a;\n my $cols = @{ $b[0] };\n my $n = @b - 1;\n for (my $r = 0 ; $r < $rows ; ++$r)\n {\n for (my $c = 0 ; $c < $cols ; ++$c)\n {\n $p[$r][$c] += $a[$r][$_] * $b[$_][$c]\n foreach 0 .. $n;\n }\n }\n return [@p];\n }\n\nsub display { join(\"\\n\" => map join(\" \" => map(sprintf(\"%4d\", $_), @$_)), @{+shift}).\"\\n\" }\n\n@a =\n(\n [1, 2],\n [3, 4]\n);\n\n@b =\n(\n [-3, -8, 3],\n [-2, 1, 4]\n);\n\n$c = mmult(\\@a,\\@b);\ndisplay($c)\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;\">matrix_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</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: #0000FF;\">{</span><span style=\"color: #000000;\">ha</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">wa</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">hb</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">wb</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">apply</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">a</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;\">b</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]},</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">wa</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">hb</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"invalid aguments\"</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;\">c</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: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">wb</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">ha</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;\">ha</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;\">wb</span> <span style=\"color: #008080;\">do</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: #000000;\">wa</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">c</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: #0000FF;\">+=</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]*</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">j</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: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">c</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</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_IntFmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%3d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">pp_FltFmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%3.0f\"</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\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">A</span> <span style=\"color: #0000FF;\">=</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>\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>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6</span> <span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8</span> <span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #000000;\">B</span> <span style=\"color: #0000FF;\">=</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;\">3</span> <span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6</span> <span style=\"color: #0000FF;\">}}</span>\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">matrix_mul</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\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">C</span> <span style=\"color: #0000FF;\">=</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;\">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;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">16</span> <span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">27</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">81</span> <span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">16</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">64</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">256</span> <span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #000000;\">D</span> <span style=\"color: #0000FF;\">=</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: #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: #0000FF;\">-</span><span style=\"color: #000000;\">1</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;\">13</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">19</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">11</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;\">3</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;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">6</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;\">4</span> <span style=\"color: #0000FF;\">},</span>\n <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;\">6</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: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">24</span> <span style=\"color: #0000FF;\">}}</span>\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">matrix_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">C</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">D</span><span style=\"color: #0000FF;\">))</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">F</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;\">3</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #000000;\">G</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>\n <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: #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>\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">matrix_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">F</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">G</span><span style=\"color: #0000FF;\">))</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">H</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>\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>\n <span style=\"color: #000000;\">I</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">}}</span>\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">matrix_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">H</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">I</span><span style=\"color: #0000FF;\">))</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">r</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><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">R</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;\">r</span><span style=\"color: #0000FF;\">},</span>\n <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: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">matrix_mul</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\n <span style=\"color: #000080;font-style:italic;\">-- large matrix example from OI:</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">row</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;\">l</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">l</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;\">function</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">J</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: #000000;\">row</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">16</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">371</span><span style=\"color: #0000FF;\">}),</span>\n <span style=\"color: #000000;\">K</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: #000000;\">row</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">371</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">16</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #7060A8;\">pp</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: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">shorten</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">matrix_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">J</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">),{</span><span style=\"color: #008000;\">\"\"</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;\">2</span><span style=\"color: #0000FF;\">))</span>\n<!--\n","language":"Phix"},{"code":"(de matMul (Mat1 Mat2)\n (mapcar\n '((Row)\n (apply mapcar Mat2\n '(@ (sum * Row (rest))) ) )\n Mat1 ) )\n\n(matMul\n '((1 2 3) (4 5 6))\n '((6 -1) (3 2) (0 -3)) )\n","language":"PicoLisp"},{"code":"/* Matrix multiplication of A by B, yielding C */\nMMULT: procedure (a, b, c);\n declare (a, b, c)(*,*) float controlled;\n declare (i, j, m, n, p) fixed binary;\n\n if hbound(a,2) ^= hbound(b,1) then\n do;\n put skip list\n ('Matrices are incompatible for matrix multiplication');\n signal error;\n end;\n\n m = hbound(a, 1); p = hbound(b, 2);\n if allocation(c) > 0 then free c;\n\n allocate c(m,p);\n\n do i = 1 to m;\n do j = 1 to p;\n c(i,j) = sum(a(i,*) * b(*,j) );\n end;\n end;\nend MMULT;\n","language":"PL-I"},{"code":"define matmul(a, b) -> c;\n lvars ba = boundslist(a), bb = boundslist(b);\n lvars i, i0 = ba(1), i1 = ba(2);\n lvars j, j0 = bb(1), j1 = bb(2);\n lvars k, k0 = bb(3), k1 = bb(4);\n if length(ba) /= 4 then\n throw([need_2d_array ^a])\n endif;\n if length(bb) /= 4 then\n throw([need_2d_array ^b])\n endif;\n if ba(3) /= j0 or ba(4) /= j1 then\n throw([dimensions_do_not_match ^a ^b]);\n endif;\n newarray([^i0 ^i1 ^k0 ^k1], 0) -> c;\n for i from i0 to i1 do\n for k from k0 to k1 do\n for j from j0 to j1 do\n c(i, k) + a(i, j)*b(j, k) -> c(i, k);\n endfor;\n endfor;\n endfor;\nenddefine;\n","language":"Pop11"},{"code":"function multarrays($a, $b) {\n $n,$m,$p = ($a.Count - 1), ($b.Count - 1), ($b[0].Count - 1)\n if ($a[0].Count -ne $b.Count) {throw \"Multiplication impossible\"}\n $c = @(0)*($a[0].Count)\n foreach ($i in 0..$n) {\n $c[$i] = foreach ($j in 0..$p) {\n $sum = 0\n foreach ($k in 0..$m){$sum += $a[$i][$k]*$b[$k][$j]}\n $sum\n }\n }\n $c\n }\n\nfunction show($a) { $a | foreach{\"$_\"}}\n\n$a = @(@(1,2),@(3,4))\n$b = @(@(5,6),@(7,8))\n$c = @(5,6)\n\"`$a =\"\nshow $a\n\"\"\n\"`$b =\"\nshow $b\n\"\"\n\"`$c =\"\n$c\n\"\"\n\"`$a * `$b =\"\nshow (multarrays $a $b)\n\" \"\n\"`$a * `$c =\"\nshow (multarrays $a $c)\n","language":"PowerShell"},{"code":"% SWI-Prolog has transpose/2 in its clpfd library\n:- use_module(library(clpfd)).\n\n% N is the dot product of lists V1 and V2.\ndot(V1, V2, N) :- maplist(product,V1,V2,P), sumlist(P,N).\nproduct(N1,N2,N3) :- N3 is N1*N2.\n\n% Matrix multiplication with matrices represented\n% as lists of lists. M3 is the product of M1 and M2\nmmult(M1, M2, M3) :- transpose(M2,MT), maplist(mm_helper(MT), M1, M3).\nmm_helper(M2, I1, M3) :- maplist(dot(I1), M2, M3).\n","language":"Prolog"},{"code":"Procedure multiplyMatrix(Array a(2), Array b(2), Array prd(2))\n Protected ar = ArraySize(a()) ;#rows for matrix a\n Protected ac = ArraySize(a(), 2) ;#cols for matrix a\n Protected br = ArraySize(b()) ;#rows for matrix b\n Protected bc = ArraySize(b(), 2) ;#cols for matrix b\n\n If ac = br\n Dim prd(ar, bc)\n\n Protected i, j, k\n For i = 0 To ar\n For j = 0 To bc\n For k = 0 To br ;ac\n prd(i, j) = prd(i, j) + (a(i, k) * b(k, j))\n Next\n Next\n Next\n\n ProcedureReturn #True ;multiplication performed, product in prd()\n Else\n ProcedureReturn #False ;multiplication not performed, dimensions invalid\n EndIf\nEndProcedure\n","language":"PureBasic"},{"code":"DataSection\n Data.i 2,3 ;matrix a (#rows, #cols)\n Data.i 1,2,3, 4,5,6 ;elements by row\n\n Data.i 3,1 ;matrix b (#rows, #cols)\n Data.i 1, 5, 9 ;elements by row\nEndDataSection\n\nProcedure displayMatrix(Array a(2), text.s)\n Protected i, j\n Protected columns = ArraySize(a(), 2), rows = ArraySize(a(), 1)\n\n PrintN(text + \": (\" + Str(rows + 1) + \", \" + Str(columns + 1) + \")\")\n For i = 0 To rows\n For j = 0 To columns\n Print(LSet(Str(a(i, j)), 4, \" \"))\n Next\n PrintN(\"\")\n Next\n PrintN(\"\")\nEndProcedure\n\nProcedure loadMatrix(Array a(2))\n Protected rows, columns, i, j\n Read.i rows\n Read.i columns\n\n Dim a(rows - 1, columns - 1)\n\n For i = 0 To rows - 1\n For j = 0 To columns - 1\n Read.i a(i, j)\n Next\n Next\nEndProcedure\n\nDim a(0,0)\nDim b(0,0)\nDim c(0,0)\n\nIf OpenConsole()\n loadMatrix(a()): displayMatrix(a(), \"matrix a\")\n loadMatrix(b()): displayMatrix(b(), \"matrix b\")\n\n If multiplyMatrix(a(), b(), c())\n displayMatrix(c(), \"product of a * b\")\n Else\n PrintN(\"product of a * b is undefined\")\n EndIf\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\")\n Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"a=((1, 1, 1, 1), # matrix A #\n (2, 4, 8, 16),\n (3, 9, 27, 81),\n (4, 16, 64, 256))\n\nb=(( 4 , -3 , 4/3., -1/4. ), # matrix B #\n (-13/3., 19/4., -7/3., 11/24.),\n ( 3/2., -2. , 7/6., -1/4. ),\n ( -1/6., 1/4., -1/6., 1/24.))\n\n\n\ndef MatrixMul( mtx_a, mtx_b):\n tpos_b = zip( *mtx_b)\n rtn = [[ sum( ea*eb for ea,eb in zip(a,b)) for b in tpos_b] for a in mtx_a]\n return rtn\n\n\nv = MatrixMul( a, b )\n\nprint 'v = ('\nfor r in v:\n print '[',\n for val in r:\n print '%8.2f '%val,\n print ']'\nprint ')'\n\n\nu = MatrixMul(b,a)\n\nprint 'u = '\nfor r in u:\n print '[',\n for val in r:\n print '%8.2f '%val,\n print ']'\nprint ')'\n","language":"Python"},{"code":"from operator import mul\n\ndef matrixMul(m1, m2):\n return map(\n lambda row:\n map(\n lambda *column:\n sum(map(mul, row, column)),\n *m2),\n m1)\n","language":"Python"},{"code":"def mm(A, B):\n return [[sum(x * B[i][col] for i,x in enumerate(row)) for col in range(len(B[0]))] for row in A]\n","language":"Python"},{"code":"import numpy as np\nnp.dot(a,b)\n#or if a is an array\na.dot(b)\n","language":"Python"},{"code":"a %*% b\n","language":"R"},{"code":"#lang racket\n(define (m-mult m1 m2)\n (for/list ([r m1])\n (for/list ([c (apply map list m2)])\n (apply + (map * r c)))))\n(m-mult '((1 2) (3 4)) '((5 6) (7 8)))\n;; -> '((19 22) (43 50))\n","language":"Racket"},{"code":"#lang racket\n(require math)\n(matrix* (matrix [[1 2] [3 4]]) (matrix [[5 6] [7 8]]))\n;; -> (array #[#[19 22] #[43 50]])\n","language":"Racket"},{"code":"sub mmult(@a,@b) {\n my @p;\n for ^@a X ^@b[0] -> ($r, $c) {\n @p[$r][$c] += @a[$r][$_] * @b[$_][$c] for ^@b;\n }\n @p;\n}\n\nmy @a = [1, 1, 1, 1],\n [2, 4, 8, 16],\n [3, 9, 27, 81],\n [4, 16, 64, 256];\n\nmy @b = [ 4 , -3 , 4/3, -1/4 ],\n [-13/3, 19/4, -7/3, 11/24],\n [ 3/2, -2 , 7/6, -1/4 ],\n [ -1/6, 1/4, -1/6, 1/24];\n\n.say for mmult(@a,@b);\n","language":"Raku"},{"code":"sub mmult(\\a,\\b) {\n [\n for ^a -> \\r {\n [\n for ^b[0] -> \\c {\n [+] a[r;^b] Z* b[^b;c]\n }\n ]\n }\n ]\n}\n","language":"Raku"},{"code":"multi infix:<×> (@A, @B) {\n\t@A.map: -> @a { do [+] @a Z× @B[*;$_] for ^@B[0] }\n}\n","language":"Raku"},{"code":"sub infix:<·> { [+] @^a Z* @^b }\nsub infix:<×>(@A, @B) { (@A X· [Z] @B).rotor(@B) }\n","language":"Raku"},{"code":"public rel[real, real, real] matrixMultiplication(rel[real x, real y, real v] matrix1, rel[real x, real y, real v] matrix2){\n\tif (max(matrix1.x) == max(matrix2.y)){\n\t\tp = {<x1,y1,x2,y2, v1*v2> | <x1,y1,v1> <- matrix1, <x2,y2,v2> <- matrix2};\n\n\t\tresult = {};\n\t\tfor (y <- matrix1.y){\n\t\t\tfor (x <- matrix2.x){\n\t\t\t\tv = (0.0 | it + v | <x1, y1, x2, y2, v> <- p, x==x2 && y==y1, x1==y2 && y2==x1);\n\t\t\t\tresult += <x,y,v>;\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\telse throw \"Matrix sizes do not match.\";\n\n//a matrix, given by a relation of the x-coordinate, y-coordinate and value.\npublic rel[real x, real y, real v] matrixA = {\n<0.0,0.0,12.0>, <0.0,1.0, 6.0>, <0.0,2.0,-4.0>,\n<1.0,0.0,-51.0>, <1.0,1.0,167.0>, <1.0,2.0,24.0>,\n<2.0,0.0,4.0>, <2.0,1.0,-68.0>, <2.0,2.0,-41.0>\n};\n","language":"Rascal"},{"code":"/*REXX program calculates the Kronecker product of two arbitrary size matrices. */\nSignal On syntax\nx.=0\namat=4X2 1 2 3 4 5 6 7 8 /* define A matrix size and elements */\nbmat=2X3 1 2 3 4 5 6 /* \" B \" \" \" \" */\nCall makeMat 'A',amat /* construct A matrix from elements */\nCall makeMat 'B',bmat /* \" B \" \" \" */\nIf cols.A<>rows.B Then\n Call exit 'Matrices are incompatible for matrix multiplication',\n 'cols.A='cols.A'<>rows.B='rows.B\nCall multMat /* multiply A x B */\nCall showMat 'A',amat /* display matrix A */\nCall showMat 'B',bmat /* \" \" B */\nCall showMat 'C',mm /* \" \" C */\nExit\n/*--------------------------------------------------------------------*/\nmakeMat:\n Parse Arg what,size elements /*elements: e.1.1 e.1.2 - e.rows cols*/\n Parse Var size rows 'X' cols\n x.what.shape=rows cols\n Parse Value rows cols With rows.what cols.what\n n=0\n Do r=1 To rows\n Do c=1 To cols\n n=n+1\n element=word(elements,n)\n x.what.r.c=element\n End\n End\n Return\n/*--------------------------------------------------------------------*/\nmultMat:\n/* x.C.*.* = x.A.*.* x x.B.*.* */\n Do i=1 To rows.A\n Do j=1 To cols.B\n Do k=1 To cols.A\n x.C.i.j=x.C.i.j+x.A.i.k*x.B.k.j\n End /*k*/\n End /*j*/\n End /*i*/\n mm=rows.A||'X'||cols.B\n Do i=1 To rows.A\n Do j=1 To cols.B\n mm=mm x.C.i.j\n End /*j*/\n End /*i*/\n Call makeMat 'C',mm\n Return\n/*--------------------------------------------------------------------*/\nshowMat:\n Parse Arg what,size .\n Parse Var size rows 'X' cols\n z='+'\n b6=left('',6)\n Say ''\n Say b6 copies('-',7) 'matrix' what copies('-',7)\n w=0\n Do r=1 To rows\n Do c=1 To cols\n w=max(w,length(x.what.r.c))\n End\n End\n Say b6 b6 '+'copies('-',cols*(w+1)+1)'+' /* top border */\n Do r=1 To rows\n line='|' right(x.what.r.1,w) /* element of first colsumn */ /* start with long vertical bar */\n Do c=2 To cols /* loop for other columns */\n line=line right(x.what.r.c,w) /* append the elements */\n End /* c */\n Say b6 b6 line '|' /* append a long vertical bar. */\n End /* r */\n Say b6 b6 '+'copies('-',cols*(w+1)+1)'+' /* bottom border */\n Return\nexit:\n Say arg(1)\n Exit\n\nSyntax:\n Say 'Syntax raised in line' sigl\n Say sourceline(sigl)\n Say 'rc='rc '('errortext(rc)')'\n Say '***** There was a problem!'\n Exit\n","language":"REXX"},{"code":"load \"stdlib.ring\"\nn = 3\nC = newlist(n,n)\nA = [[1,2,3], [4,5,6], [7,8,9]]\nB = [[1,0,0], [0,1,0], [0,0,1]]\nfor i = 1 to n\n for j = 1 to n\n for k = 1 to n\n C[i][k] += A[i][j] * B[j][k]\n next\n next\nnext\nfor i = 1 to n\n for j = 1 to n\n see C[i][j] + \" \"\n next\n see nl\nnext\n","language":"Ring"},{"code":"require 'matrix'\n\nMatrix[[1, 2],\n [3, 4]] * Matrix[[-3, -8, 3],\n [-2, 1, 4]]\n","language":"Ruby"},{"code":"def matrix_mult(a, b)\n a.map do |ar|\n b.transpose.map { |bc| ar.zip(bc).map{ |x| x.inject(&:*) }.sum }\n end\nend\n","language":"Ruby"},{"code":"struct Matrix {\n dat: [[f32; 3]; 3]\n}\n\nimpl Matrix {\n pub fn mult_m(a: Matrix, b: Matrix) -> Matrix\n {\n let mut out = Matrix {\n dat: [[0., 0., 0.],\n [0., 0., 0.],\n [0., 0., 0.]\n ]\n };\n\n for i in 0..3{\n for j in 0..3 {\n for k in 0..3 {\n out.dat[i][j] += a.dat[i][k] * b.dat[k][j];\n }\n }\n }\n\n out\n }\n\n pub fn print(self)\n {\n for i in 0..3 {\n for j in 0..3 {\n print!(\"{} \", self.dat[i][j]);\n }\n print!(\"\\n\");\n }\n }\n}\n\nfn main()\n{\n let a = Matrix {\n dat: [[1., 2., 3.],\n [4., 5., 6.],\n [7., 8., 9.]\n ]\n };\n\n let b = Matrix {\n dat: [[1., 0., 0.],\n [0., 1., 0.],\n [0., 0., 1.]]\n };\n\t\n\n\n let c = Matrix::mult_m(a, b);\n\n\n c.print();\n}\n","language":"Rust"},{"code":"% Matrix multiplication is a built-in with the S-Lang octothorpe operator.\nvariable A = [1,2,3,4,5,6];\nreshape(A, [2,3]); % reshape 1d array to 2 rows, 3 columns\nprintf(\"A is %S\\n\", A); print(A);\n\nvariable B = [1:6]; % index range, 1 to 6 same as above in A\nreshape(B, [3,2]); % reshape to 3 rows, 2 columns\nprintf(\"\\nB is %S\\n\", B); print(B);\n\nprintf(\"\\nA # B is %S\\n\", A#B);\nprint(A#B);\n\n% Multiply binary operator is different, dimensions need to be equal\nreshape(B, [2,3]);\nprintf(\"\\nA * B is %S (with reshaped B to match A)\\n\", A*B);\nprint(A*B);\n","language":"S-lang"},{"code":"def mult[A](a: Array[Array[A]], b: Array[Array[A]])(implicit n: Numeric[A]) = {\n import n._\n for (row <- a)\n yield for(col <- b.transpose)\n yield row zip col map Function.tupled(_*_) reduceLeft (_+_)\n}\n","language":"Scala"},{"code":"def mult[A, CC[X] <: Seq[X], DD[Y] <: Seq[Y]](a: CC[DD[A]], b: CC[DD[A]])\n(implicit n: Numeric[A]): CC[DD[A]] = {\n import n._\n for (row <- a)\n yield for(col <- b.transpose)\n yield row zip col map Function.tupled(_*_) reduceLeft (_+_)\n}\n","language":"Scala"},{"code":"(define (matrix-multiply matrix1 matrix2)\n (map\n (lambda (row)\n (apply map\n (lambda column\n (apply + (map * row column)))\n matrix2))\n matrix1))\n","language":"Scheme"},{"code":"const type: matrix is array array float;\n\nconst func matrix: (in matrix: left) * (in matrix: right) is func\n result\n var matrix: result is matrix.value;\n local\n var integer: i is 0;\n var integer: j is 0;\n var integer: k is 0;\n var float: accumulator is 0.0;\n begin\n if length(left[1]) <> length(right) then\n raise RANGE_ERROR;\n else\n result := length(left) times length(right[1]) times 0.0;\n for i range 1 to length(left) do\n for j range 1 to length(right) do\n accumulator := 0.0;\n for k range 1 to length(left) do\n accumulator +:= left[i][k] * right[k][j];\n end for;\n result[i][j] := accumulator;\n end for;\n end for;\n end if;\n end func;\n","language":"Seed7"},{"code":"matmul(A(2), B(2)) [i,j] :=\n let k := 1...size(B);\n in sum( A[i,k] * B[k,j] );\n\n//Example Use\na := [[1, 2],\n [3, 4]];\n\nb := [[-3, -8, 3],\n [-2, 1, 4]];\n\ntest := matmul(a, b);\n","language":"SequenceL"},{"code":"matmul(A(2), B(2)) [i,j] := sum( A[i,all] * B[all,j] );\n","language":"SequenceL"},{"code":"func matrix_multi(a, b) {\n var m = [[]]\n for r in ^a {\n for c in ^b[0] {\n for i in ^b {\n m[r][c] := 0 += (a[r][i] * b[i][c])\n }\n }\n }\n return m\n}\n \nvar a = [\n [1, 2],\n [3, 4],\n [5, 6],\n [7, 8]\n ]\n \nvar b = [\n [1, 2, 3],\n [4, 5, 6]\n ]\n \nfor line in matrix_multi(a, b) {\n say line.map{|i|'%3d' % i }.join(', ')\n}\n","language":"Sidef"},{"code":"(1) -> A:=matrix [[1,2],[3,4],[5,6],[7,8]]\n\n +1 2+\n | |\n |3 4|\n (1) | |\n |5 6|\n | |\n +7 8+\n Type: Matrix(Integer)\n(2) -> B:=matrix [[1,2,3],[4,5,6]]\n\n +1 2 3+\n (2) | |\n +4 5 6+\n Type: Matrix(Integer)\n(3) -> A*B\n\n +9 12 15+\n | |\n |19 26 33|\n (3) | |\n |29 40 51|\n | |\n +39 54 69+\n Type: Matrix(Integer)\n","language":"SPAD"},{"code":"CREATE TABLE a (x integer, y integer, e real);\nCREATE TABLE b (x integer, y integer, e real);\n\n-- test data\n-- A is a 2x2 matrix\nINSERT INTO a VALUES(0,0,1); INSERT INTO a VALUES(1,0,2);\nINSERT INTO a VALUES(0,1,3); INSERT INTO a VALUES(1,1,4);\n\n-- B is a 2x3 matrix\nINSERT INTO b VALUES(0,0,-3); INSERT INTO b VALUES(1,0,-8); INSERT INTO b VALUES(2,0,3);\nINSERT INTO b VALUES(0,1,-2); INSERT INTO b VALUES(1,1, 1); INSERT INTO b VALUES(2,1,4);\n\n-- C is 2x2 * 2x3 so will be a 2x3 matrix\nSELECT rhs.x, lhs.y, (SELECT sum(a.e*b.e) FROM a, b\n WHERE a.y = lhs.y\n AND b.x = rhs.x\n AND a.x = b.y)\n INTO TABLE c\n FROM a AS lhs, b AS rhs\n WHERE lhs.x = 0 AND rhs.y = 0;\n","language":"SQL"},{"code":"structure IMatrix = struct\nfun dot(x,y) = Vector.foldli (fn (i,xi,agg) => agg+xi*Vector.sub(y,i)) 0 x\nfun x*y =\n let\n\topen Array2\n in\n\ttabulate ColMajor (nRows x, nCols y, fn (i,j) => dot(row(x,i),column(y,j)))\n end\nend;\n(* for display *)\nfun toList a =\n let\n\topen Array2\n in\n\tList.tabulate(nRows a, fn i => List.tabulate(nCols a, fn j => sub(a,i,j)))\n end;\n(* example *)\nlet\n open IMatrix\n val m1 = Array2.fromList [[1,2],[3,4]]\n val m2 = Array2.fromList [[~3,~8,3],[~2,1,4]]\nin\n toList (m1*m2)\nend;\n","language":"Standard-ML"},{"code":"val it = [[~7,~6,11],[~17,~20,25]] : int list list\n","language":"Standard-ML"},{"code":". mat a=1,2,3\\4,5,6\n. mat b=1,1,0,0\\1,0,0,1\\0,0,1,1\n. mat c=a*b\n. mat list c\n\nc[2,4]\n c1 c2 c3 c4\nr1 3 1 3 5\nr2 9 4 6 11\n","language":"Stata"},{"code":": a=1,2,3\\4,5,6\n: b=1,1,0,0\\1,0,0,1\\0,0,1,1\n: a*b\n 1 2 3 4\n +---------------------+\n 1 | 3 1 3 5 |\n 2 | 9 4 6 11 |\n +---------------------+\n","language":"Stata"},{"code":"@inlinable\npublic func matrixMult<T: Numeric>(_ m1: [[T]], _ m2: [[T]]) -> [[T]] {\n let n = m1[0].count\n let m = m1.count\n let p = m2[0].count\n\n guard m != 0 else {\n return []\n }\n\n precondition(n == m2.count)\n\n var ret = Array(repeating: Array(repeating: T.zero, count: p), count: m)\n\n for i in 0..<m {\n for j in 0..<p {\n for k in 0..<n {\n ret[i][j] += m1[i][k] * m2[k][j]\n }\n }\n }\n\n return ret\n}\n\n@inlinable\npublic func printMatrix<T>(_ matrix: [[T]]) {\n guard !matrix.isEmpty else {\n print()\n\n return\n }\n\n let rows = matrix.count\n let cols = matrix[0].count\n\n for i in 0..<rows {\n for j in 0..<cols {\n print(matrix[i][j], terminator: \" \")\n }\n\n print()\n }\n}\n\nlet m1 = [\n [6.5, 2, 3],\n [4.5, 1, 5]\n]\n\nlet m2 = [\n [10.0, 16, 23, 50],\n [12, -8, 16, -4],\n [70, 60, -1, -2]\n]\n\nlet m3 = matrixMult(m1, m2)\n\nprintMatrix(m3)\n","language":"Swift"},{"code":"operator (A matmul B)\n $A -> \\[i](\n $B(1) -> \\[j](@: 0;\n 1..$B::length -> @: $@ + $A($i;$) * $B($;$j);\n $@ !\\) !\n \\) !\nend matmul\n\ntemplates printMatrix&{w:}\n templates formatN\n @: [];\n $ -> #\n '$@ -> $::length~..$w -> ' ';$@(last..1:-1)...;' !\n when <1..> do ..|@: $ mod 10; $ ~/ 10 -> #\n when <=0?($@ <[](0)>)> do ..|@: 0;\n end formatN\n $... -> '|$(1) -> formatN;$(2..last)... -> ', $ -> formatN;';|\n' !\nend printMatrix\n\ndef a: [[1, 2, 3], [4, 5, 6]];\n'a:\n' -> !OUT::write\n$a -> printMatrix&{w:2} -> !OUT::write\n\ndef b: [[0, 1], [2, 3], [4, 5]];\n'\nb:\n' -> !OUT::write\n$b -> printMatrix&{w:2} -> !OUT::write\n'\naxb:\n' -> !OUT::write\n($a matmul $b) -> printMatrix&{w:2} -> !OUT::write\n","language":"Tailspin"},{"code":"package require Tcl 8.5\nnamespace path ::tcl::mathop\nproc matrix_multiply {a b} {\n lassign [size $a] a_rows a_cols\n lassign [size $b] b_rows b_cols\n if {$a_cols != $b_rows} {\n error \"incompatible sizes: a($a_rows, $a_cols), b($b_rows, $b_cols)\"\n }\n set temp [lrepeat $a_rows [lrepeat $b_cols 0]]\n for {set i 0} {$i < $a_rows} {incr i} {\n for {set j 0} {$j < $b_cols} {incr j} {\n set sum 0\n for {set k 0} {$k < $a_cols} {incr k} {\n set sum [+ $sum [* [lindex $a $i $k] [lindex $b $k $j]]]\n }\n lset temp $i $j $sum\n }\n }\n return $temp\n}\n","language":"Tcl"},{"code":"Disp [A]*[B]\n","language":"TI-83-BASIC"},{"code":"[[1,2][3,4][5,6][7,8]]*[[1,2,3][4,5,6]]\n","language":"TI-83-BASIC"},{"code":"[1,2; 3,4; 5,6; 7,8] → m1\n[1,2,3; 4,5,6] → m2\nm1 * m2\n","language":"TI-89-BASIC"},{"code":"[1,2; 3,4; 5,6; 7,8] * [1,2,3; 4,5,6]\n","language":"TI-89-BASIC"},{"code":"[[9,12,15][19,26,33][29,40,51][39,54,69]]\n","language":"TI-89-BASIC"},{"code":"#lang transd\n\n\nMainModule: {\n _start: (λ (with n 5\n A (for i in Range(n) project (for k in Range(n) project k))\n B (for i in Range(n) project (for k in Range(n) project (- n k)))\n C (for i in Range(n) project (for k in Range(n) project 0))\n\n (for i in Range( n ) do\n (for j in Range( n ) do\n (for k in Range( n ) do\n (+= (get (get C i) j) (* (get (get A i) k) (get (get B k) j)))\n )))\n (lout C))\n )\n}\n","language":"Transd"},{"code":"#!/bin/bash\n\nDELAY=0 # increase this if printing of matrices should be slower\n\necho \"This script takes two matrices, henceforth called A and B,\nand returns their product, AB.\n\nFor the time being, matrices can have integer components only.\n\n\"\n\nread -p \"Number of rows of matrix A: \" arows\nread -p \"Number of columns of matrix A: \" acols\nbrows=\"$acols\"\necho\necho \"Number of rows of matrix B: \"$brows\nread -p \"Number of columns of matrix B: \" bcols\n\ncrows=\"$arows\"\nccols=\"$bcols\"\necho\n\necho \"Number of rows of matrix AB: \" $crows\necho \"Number of columns of matrix AB: \" $ccols\necho\necho\n\nmatrixa=( )\nmatrixb=( )\n\n# input matrix A\n\nmaxlengtha=0\nfor ((row=1; row<=arows; row++)); do\n for ((col=1; col<=acols; col++)); do\n\tcheckentry=\"false\"\n\twhile [ \"$checkentry\" != \"true\" ]; do\n\t read -p \"Enter component A[$row, $col]: \" number\n\t index=$(((row-1)*acols+col))\n\t matrixa[$index]=\"$number\"\n\t [ \"${matrixa[$index]}\" -eq \"$number\" ] && checkentry=\"true\"\n\t echo\n\tdone\n\tentry=\"${matrixa[$index]}\"\n\t[ \"${#entry}\" -gt \"$maxlengtha\" ] && maxlengtha=\"${#entry}\"\n done\n echo\ndone\n\n# print matrix A to guard against errors\n\nif [ \"$maxlengtha\" -le \"5\" ]; then\n width=8\nelse\n width=$((maxlengtha + 3))\nfi\n\necho \"This is matrix A:\n\n\"\n\nfor ((row=1; row<=arows; row++)); do\n for ((col=1; col<=acols; col++)); do\n\n\tindex=$(((row-1)*acols+col))\n\tprintf \"%${width}d\" \"${matrixa[$index]}\"\n\tsleep \"$DELAY\"\n\n done\n echo; echo # printf %s \"\\n\\n\" does not work...\ndone\n\necho\necho\n\n# input matrix B\n\nmaxlengthb=0\nfor ((row=1; row<=brows; row++)); do\n for ((col=1; col<=bcols; col++)); do\n\tcheckentry=\"false\"\n\twhile [ \"$checkentry\" != \"true\" ]; do\n\t read -p \"Enter component B[$row, $col]: \" number\n\t index=$(((row-1)*bcols+col))\n\t matrixb[$index]=\"$number\"\n\t [ \"${matrixb[$index]}\" -eq \"$number\" ] && checkentry=\"true\"\n\t echo\n\tdone\n\tentry=\"${matrixb[$index]}\"\n\t[ \"${#entry}\" -gt \"$maxlengthb\" ] && maxlengthb=\"${#entry}\"\n done\n echo\ndone\n\n# print matrix B to guard against errors\n\nif [ \"$maxlengthb\" -le \"5\" ]; then\n width=8\nelse\n width=$((maxlengthb + 3))\nfi\n\necho \"This is matrix B:\n\n\"\n\nfor ((row=1; row<=brows; row++)); do\n for ((col=1; col<=bcols; col++)); do\n\n\tindex=$(((row-1)*bcols+col))\n\tprintf \"%${width}d\" \"${matrixb[$index]}\"\n\tsleep \"$DELAY\"\n\n done\n echo; echo # printf %s \"\\n\\n\" does not work...\ndone\n\nread -p \"Hit enter to continue\"\n\n# calculate matrix C := AB\n\nmaxlengthc=0\ntime for ((row=1; row<=crows; row++)); do\n for ((col=1; col<=ccols; col++)); do\n\t\n\t# calculate component C[$row, $col]\n\n\trunningtotal=0\n\tfor ((j=1; j<=acols; j++)); do\n\t rowa=\"$row\"\n\t cola=\"$j\"\n\t indexa=$(((rowa-1)*acols+cola))\n\t rowb=\"$j\"\n\t colb=\"$col\"\n\t indexb=$(((rowb-1)*bcols+colb))\n\t\n\t entry_from_A=${matrixa[$indexa]}\n\t entry_from_B=${matrixb[$indexb]}\n\n\t subtotal=$((entry_from_A * entry_from_B))\n\t ((runningtotal+=subtotal))\n\tdone\n\t\n\tnumber=\"$runningtotal\"\n\n\t# store component in the result array\n\tindex=$(((row-1)*ccols+col))\n\tmatrixc[$index]=\"$number\"\n\n\tentry=\"${matrixc[$index]}\"\n\t[ \"${#entry}\" -gt \"$maxlengthc\" ] && maxlengthc=\"${#entry}\"\n done\ndone\n\necho\nread -p \"Hit enter to continue\"\necho\n\n# print the matrix C\n\nif [ \"$maxlengthc\" -le \"5\" ]; then\n width=8\nelse\n width=$((maxlengthc + 3))\nfi\n\necho \"The product matrix is:\n\n\"\n\nfor ((row=1; row<=crows; row++)); do\n for ((col=1; col<=ccols; col++)); do\n\n\tindex=$(((row-1)*ccols+col))\n\tprintf \"%${width}d\" \"${matrixc[$index]}\"\n\tsleep \"$DELAY\"\n\n done\n echo; echo # printf %s \"\\n\\n\" does not work...\ndone\n\necho\necho\n","language":"UNIX-Shell"},{"code":"#import rat\n\na =\n\n<\n <1/1, 1/1, 1/1, 1/1>,\n <2/1, 4/1, 8/1, 16/1>,\n <3/1, 9/1, 27/1, 81/1>,\n <4/1, 16/1, 64/1, 256/1>>\n\nb =\n\n<\n < 4/1, -3/1, 4/3, -1/4>,\n <-13/3, 19/4, -7/3, 11/24>,\n < 3/2, -2/1, 7/6, -1/4>,\n < -1/6, 1/4, -1/6, 1/24>>\n\nmmult = *rK7lD *rlD sum:-0.+ product*p\n\n#cast %qLL\n\ntest = mmult(a,b)\n","language":"Ursala"},{"code":"Function matrix_multiplication(a As Variant, b As Variant) As Variant\n matrix_multiplication = WorksheetFunction.MMult(a, b)\nEnd Function\n","language":"VBA"},{"code":"Dim matrix1(2,2)\nmatrix1(0,0) = 3 : matrix1(0,1) = 7 : matrix1(0,2) = 4\nmatrix1(1,0) = 5 : matrix1(1,1) = -2 : matrix1(1,2) = 9\nmatrix1(2,0) = 8 : matrix1(2,1) = -6 : matrix1(2,2) = -5\nDim matrix2(2,2)\nmatrix2(0,0) = 9 : matrix2(0,1) = 2 : matrix2(0,2) = 1\nmatrix2(1,0) = -7 : matrix2(1,1) = 3 : matrix2(1,2) = -10\nmatrix2(2,0) = 4 : matrix2(2,1) = 5 : matrix2(2,2) = -6\n\nCall multiply_matrix(matrix1,matrix2)\n\nSub multiply_matrix(arr1,arr2)\n\tFor i = 0 To UBound(arr1)\n\t\tFor j = 0 To 2\n\t\t\tWScript.StdOut.Write (arr1(i,j) * arr2(i,j)) & vbTab\n\t\tNext\n\t\tWScript.StdOut.WriteLine\n\tNext\nEnd Sub\n","language":"VBScript"},{"code":"LOCAL ARRAY a[4,2], b[2,3], c[4,3]\nCLOSE DATABASES ALL\n*!* The arrays could be created directly but I prefer to do this:\nCREATE CURSOR mat1 (c1 I, c2 I)\nCREATE CURSOR mat2 (c1 I, c2 I, c3 I)\n*!* Since matrix multiplication of integer arrays\n*!* involves only multiplication and addition,\n*!* the result will contain integers\nCREATE CURSOR result (c1 I, c2 I, c3 I)\nINSERT INTO mat1 VALUES (1, 2)\nINSERT INTO mat1 VALUES (3, 4)\nINSERT INTO mat1 VALUES (5, 6)\nINSERT INTO mat1 VALUES (7, 8)\nSELECT * FROM mat1 INTO ARRAY a\n\nINSERT INTO mat2 VALUES (1, 2, 3)\nINSERT INTO mat2 VALUES (4, 5, 6)\nSELECT * FROM mat2 INTO ARRAY b\nSTORE 0 TO c\nMatMult(@a,@b,@c)\nSELECT result\nAPPEND FROM ARRAY c\nBROWSE\n\n\nPROCEDURE MatMult(aa, bb, cc)\nLOCAL n As Integer, m As Integer, p As Integer, i As Integer, j As Integer, k As Integer\nIF ALEN(aa,2) = ALEN(bb,1)\n\tn = ALEN(aa,2)\n\tm = ALEN(aa,1)\n\tp = ALEN(bb,2)\n\tFOR i = 1 TO m\n\t\tFOR j = 1 TO p\n\t\t\tFOR k = 1 TO n\n\t\t\t\tcc[i,j] = cc[i,j] + aa[i,k]*bb[k,j]\n\t\t\tENDFOR\n\t\tENDFOR\n\tENDFOR\t\t\nELSE\n\t? \"Invalid dimensions\"\nENDIF\nENDPROC\n","language":"Visual-FoxPro"},{"code":"import \"./matrix\" for Matrix\nimport \"./fmt\" for Fmt\n\nvar a = Matrix.new([\n [1, 2],\n [3, 4],\n [5, 6],\n [7, 8]\n])\n\nvar b = Matrix.new([\n [1, 2, 3],\n [4, 5, 6]\n])\n\nSystem.print(\"Matrix A:\\n\")\nFmt.mprint(a, 2, 0)\nSystem.print(\"\\nMatrix B:\\n\")\nFmt.mprint(b, 2, 0)\nSystem.print(\"\\nMatrix A x B:\\n\")\nFmt.mprint(a * b, 3, 0)\n","language":"Wren"},{"code":"proc Mat4x1Mul(M, V); \\Multiply matrix M times column vector V\nreal M, \\4x4 matrix [M] * [V] -> [V]\n V; \\column vector\nreal W(4); \\working copy of column vector\nint R; \\row\n[for R:= 0 to 4-1 do\n W(R):= M(R,0)*V(0) + M(R,1)*V(1) + M(R,2)*V(2) + M(R,3)*V(3);\nfor R:= 0 to 4-1 do V(R):= W(R);\n];\n\nproc Mat4x4Mul(M, N); \\Multiply matrix M times matrix N\nreal M, N; \\4x4 matrices [M] * [N] -> [N]\nreal W(4,4); \\working copy of matrix N\nint C; \\column\n[for C:= 0 to 4-1 do\n [W(0,C):= M(0,0)*N(0,C) + M(0,1)*N(1,C) + M(0,2)*N(2,C) + M(0,3)*N(3,C);\n W(1,C):= M(1,0)*N(0,C) + M(1,1)*N(1,C) + M(1,2)*N(2,C) + M(1,3)*N(3,C);\n W(2,C):= M(2,0)*N(0,C) + M(2,1)*N(1,C) + M(2,2)*N(2,C) + M(2,3)*N(3,C);\n W(3,C):= M(3,0)*N(0,C) + M(3,1)*N(1,C) + M(3,2)*N(2,C) + M(3,3)*N(3,C);\n ];\nfor C:= 0 to 4-1 do\n [N(0,C):= W(0,C);\n N(1,C):= W(1,C);\n N(2,C):= W(2,C);\n N(3,C):= W(3,C);\n ];\n];\n","language":"XPL0"},{"code":"<?xml-stylesheet href=\"matmul.templ.xsl\" type=\"text/xsl\"?>\n<mult>\n <A>\n <r><c>1</c><c>2</c></r>\n <r><c>3</c><c>4</c></r>\n <r><c>5</c><c>6</c></r>\n <r><c>7</c><c>8</c></r>\n </A>\n <B>\n <r><c>1</c><c>2</c><c>3</c></r>\n <r><c>4</c><c>5</c><c>6</c></r>\n </B>\n</mult>\n","language":"XSLT-1.0"},{"code":"<xsl:stylesheet version=\"1.0\"\n xmlns:xsl=\"http://www.w3.org/1999/XSL/Transform\"\n>\n <xsl:output method=\"html\"/>\n\n <xsl:template match=\"/mult\">\n <table>\n <tr><td>╭</td><td colspan=\"{count(*[2]/*[1]/*)}\"/><td>╮</td></tr>\n <xsl:call-template name=\"prodMM\">\n <xsl:with-param name=\"A\" select=\"*[1]/*\"/>\n <xsl:with-param name=\"B\" select=\"*[2]/*\"/>\n </xsl:call-template>\n <tr><td>╰</td><td colspan=\"{count(*[2]/*[1]/*)}\"/><td>╯</td></tr>\n </table>\n </xsl:template>\n\n <xsl:template name=\"prodMM\">\n <xsl:param name=\"A\"/>\n <xsl:param name=\"B\"/>\n\n <xsl:if test=\"$A/*\">\n <tr>\n <td>│</td>\n <xsl:call-template name=\"prodVM\">\n <xsl:with-param name=\"a\" select=\"$A[1]/*\"/>\n <xsl:with-param name=\"B\" select=\"$B\"/>\n </xsl:call-template>\n <td>│</td>\n </tr>\n\n <xsl:call-template name=\"prodMM\">\n <xsl:with-param name=\"A\" select=\"$A[position()>1]\"/>\n <xsl:with-param name=\"B\" select=\"$B\"/>\n </xsl:call-template>\n </xsl:if>\n </xsl:template>\n\n <xsl:template name=\"prodVM\">\n <xsl:param name=\"a\"/>\n <xsl:param name=\"B\"/>\n <xsl:param name=\"col\" select=\"1\"/>\n\n <xsl:if test=\"$B/*[$col]\">\n <td align=\"right\">\n <xsl:call-template name=\"prod\">\n <xsl:with-param name=\"a\" select=\"$a\"/>\n <xsl:with-param name=\"b\" select=\"$B/*[$col]\"/>\n </xsl:call-template>\n </td>\n\n <xsl:call-template name=\"prodVM\">\n <xsl:with-param name=\"a\" select=\"$a\"/>\n <xsl:with-param name=\"B\" select=\"$B\"/>\n <xsl:with-param name=\"col\" select=\"$col+1\"/>\n </xsl:call-template>\n </xsl:if>\n </xsl:template>\n\n <xsl:template name=\"prod\">\n <xsl:param name=\"a\"/>\n <xsl:param name=\"b\"/>\n\n <xsl:if test=\"not($a)\">0</xsl:if>\n\n <xsl:if test=\"$a\">\n <xsl:variable name=\"res\">\n <xsl:call-template name=\"prod\">\n <xsl:with-param name=\"a\" select=\"$a[position()>1]\"/>\n <xsl:with-param name=\"b\" select=\"$b[position()>1]\"/>\n </xsl:call-template>\n </xsl:variable>\n\n <xsl:value-of select=\"$a[1] * $b[1] + $res\"/>\n </xsl:if>\n </xsl:template>\n\n</xsl:stylesheet>\n","language":"XSLT-1.0"},{"code":"dim a(4, 2)\na(0, 0) = 1 : a(0, 1) = 2\na(1, 0) = 3 : a(1, 1) = 4\na(2, 0) = 5 : a(2, 1) = 6\na(3, 0) = 7 : a(3, 1) = 8\ndim b(2, 3)\nb(0, 0) = 1 : b(0, 1) = 2 : b(0, 2) = 3\nb(1, 0) = 4 : b(1, 1) = 5 : b(1, 2) = 6\ndim prod(arraysize(a(),1), arraysize(b(),2))\n\nif (arraysize(a(),2) = arraysize(b(),1)) then\n\tfor i = 0 to arraysize(a(),1)\n\t\tfor j = 0 to arraysize(b(),2)\n\t\t\tfor k = 0 to arraysize(a(),2)\n\t\t\t\tprod(i, j) = prod(i, j) + (a(i, k) * b(k, j))\n\t\t\tnext k\n\t\tnext j\n\tnext i\n\n\tfor i = 0 to arraysize(prod(),1)-1\n\t\tfor j = 0 to arraysize(prod(),2)-1\n\t\t\tprint prod(i, j),\n\t\tnext j\n\t\tprint\n\tnext i\nelse\n\tprint \"invalid dimensions\"\nend if\nend\n","language":"Yabasic"},{"code":"var [const] GSL=Import(\"zklGSL\");\t// libGSL (GNU Scientific Library)\nA:=GSL.Matrix(4,2).set(1,2, 3,4, 5,6, 7,8);\nB:=GSL.Matrix(2,3).set(1,2,3, 4,5,6);\n(A*B).format().println(); // creates a new matrix\n","language":"Zkl"},{"code":"fcn matMult(a,b){\n n,m,p:=a[0].len(),a.len(),b[0].len();\n ans:=(0).pump(m,List().write, (0).pump(p,List,0).copy); // matrix of zeros\n foreach i,j,k in (m,p,n){ ans[i][j]+=a[i][k]*b[k][j]; }\n ans\n}\n","language":"Zkl"},{"code":"a:=L( L(1,2,), L(3,4,), L(5,6,), L(7,8) );\nb:=L( L(1,2,3,), L(4,5,6) );\nprintM(matMult(a,b));\n\nfcn printM(m){ m.pump(Console.println,rowFmt) }\nfcn rowFmt(row){ (\"%4d \"*row.len()).fmt(row.xplode()) }\n","language":"Zkl"},{"code":"module MatrixOps;\ntype\n\tMatrix = array {math} *,* of integer;\n\n\n\tprocedure WriteMatrix(x: array {math} *,* of integer);\n\tvar\n\t\ti,j: integer;\n\tbegin\n\t\tfor i := 0 to len(x,0) - 1 do\n\t\t\tfor j := 0 to len(x,1) - 1 do\n\t\t\t\twrite(x[i,j]);\n\t\t\tend;\n\t\t\twriteln;\n\t\tend\t\n\tend WriteMatrix;\n\n\tprocedure Multiplication;\n\tvar\n\t\ta,b: Matrix;\n\tbegin\n\t\ta := [[1,2],[3,4],[5,6],[7,8]];\n\t\tb := [[1,2,3],[4,5,6]];\n\t\tWriteMatrix(a * b);\n\tend Multiplication;\n\nbegin\n\tMultiplication;\nend MatrixOps.\n","language":"Zonnon"},{"code":"program matmultSUMMA;\n\nprototype GetSingleDim(infile:file):integer;\nprototype GetInnerDim(infile1:file; infile2:file):integer;\n\nconfig var\n Afilename: string = \"\";\n Bfilename: string = \"\";\n\n Afile: file = open(Afilename,file_read);\n Bfile: file = open(Bfilename,file_read);\n\n default_size:integer = 4;\n m:integer = GetSingleDim(Afile);\n n:integer = GetInnerDim(Afile,Bfile);\n p:integer = GetSingleDim(Bfile);\n\n iters: integer = 1;\n\n printinput: boolean = false;\n verbose: boolean = true;\n dotiming: boolean = false;\n\nregion\n RA = [1..m,1..n];\n RB = [1..n,1..p];\n RC = [1..m,1..p];\n FCol = [1..m,*];\n FRow = [*,1..p];\n\nvar\n A : [RA] double;\n B : [RB] double;\n C : [RC] double;\n Aflood : [FCol] double;\n Bflood : [FRow] double;\n\n\nprocedure ReadA();\nvar step:double;\n[RA] begin\n if (Afile != znull) then\n read(Afile,A);\n else\n step := 1.0/(m*n);\n A := ((Index1-1)*n + Index2)*step + 1.0;\n end;\n end;\n\n\nprocedure ReadB();\nvar step:double;\n[RB] begin\n if (Bfile != znull) then\n read(Bfile,B);\n else\n step := 1.0/(n*p);\n B := ((Index1-1)*p + Index2)*step + 1.0;\n end;\n end;\n\n\nprocedure matmultSUMMA();\nvar\n i: integer;\n it: integer;\n runtime: double;\n[RC] begin\n ReadA();\n ReadB();\n\n if (printinput) then\n [RA] writeln(\"A is:\\n\",A);\n [RB] writeln(\"B is:\\n\",B);\n end;\n\n ResetTimer();\n\n for it := 1 to iters do\n\n C := 0.0; -- zero C\n\n for i := 1 to n do\n [FCol] Aflood := >>[,i] A; -- flood A col\n [FRow] Bflood := >>[i,] B; -- flood B row\n\n C += (Aflood * Bflood); -- multiply\n end;\n end;\n\n runtime := CheckTimer();\n\n if (verbose) then\n writeln(\"C is:\\n\",C);\n end;\n\n if (dotiming) then\n writeln(\"total runtime = %12.6f\":runtime);\n writeln(\"actual runtime = %12.6f\":runtime/iters);\n end;\n end;\n\n\nprocedure GetSingleDim(infile:file):integer;\nvar dim:integer;\nbegin\n if (infile != znull) then\n read(infile,dim);\n else\n dim := default_size;\n end;\n return dim;\nend;\n\n\nprocedure GetInnerDim(infile1:file; infile2:file):integer;\nvar\n col:integer;\n row:integer;\n retval:integer;\nbegin\n retval := -1;\n if (infile1 != znull) then\n read(infile1,col);\n retval := col;\n end;\n if (infile2 != znull) then\n read(infile2,row);\n if (retval = -1) then\n retval := row;\n else\n if (row != col) then\n halt(\"ERROR: Inner dimensions don't match\");\n end;\n end;\n end;\n if (retval = -1) then\n retval := default_size;\n end;\n return retval;\nend;\n","language":"ZPL"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Matrix_multiplication\\nnote: Matrices\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nMultiply two matrices together. \\n\\nThey can be of any dimensions, so long as the number of columns of the first matrix is equal to the number of rows of the second matrix.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F matrix_mul(m1, m2)\\n assert(m1[0].len == m2.len)\\n V r = [[0.0] * m2[0].len] * m1.len\\n L(j) 0 .< m1.len\\n L(i) 0 .< m2[0].len\\n V s = 0.0\\n L(k) 0 .< m2.len\\n s += m1[j][k] * m2[k][i]\\n r[j][i] = s\\n R r\\n\\nF to_str(m)\\n V result = ‘([’\\n L(r) m\\n I result.len > 2\\n result ‘’= \\\"]\\\\n [\\\"\\n L(val) r\\n result ‘’= ‘#5.2’.format(val)\\n R result‘])’\\n\\nV a = [[1.0, 1.0, 1.0, 1.0],\\n [2.0, 4.0, 8.0, 16.0],\\n [3.0, 9.0, 27.0, 81.0],\\n [4.0, 16.0, 64.0, 256.0]]\\n\\nV b = [[ 4.0, -3.0 , 4/3.0, -1/4.0],\\n [-13/3.0, 19/4.0, -7/3.0, 11/24.0],\\n [ 3/2.0, -2.0 , 7/6.0, -1/4.0],\\n [ -1/6.0, 1/4.0, -1/6.0, 1/24.0]]\\n\\nprint(to_str(a))\\nprint(to_str(b))\\nprint(to_str(matrix_mul(a, b)))\\nprint(to_str(matrix_mul(b, a)))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Matrix multiplication 06/08/2015\\nMATRIXRC CSECT Matrix multiplication\\n USING MATRIXRC,R13\\nSAVEARA B STM-SAVEARA(R15)\\n DC 17F'0'\\nSTM STM R14,R12,12(R13)\\n ST R13,4(R15)\\n ST R15,8(R13)\\n LR R13,R15\\n LA R7,1 i=1\\nLOOPI1 CH R7,M do i=1 to m (R7)\\n BH ELOOPI1\\n LA R8,1 j=1\\nLOOPJ1 CH R8,P do j=1 to p (R8)\\n BH ELOOPJ1\\n LR R1,R7 i\\n BCTR R1,0\\n MH R1,P\\n LR R6,R8 j\\n BCTR R6,0\\n AR R1,R6\\n SLA R1,2\\n LA R6,0\\n ST R6,C(R1) c(i,j)=0\\n LA R9,1 k=1\\nLOOPK1 CH R9,N do k=1 to n (R9)\\n BH ELOOPK1\\n LR R1,R7 i\\n BCTR R1,0\\n MH R1,P\\n LR R6,R8 j\\n BCTR R6,0\\n AR R1,R6\\n SLA R1,2\\n L R2,C(R1) R2=c(i,j)\\n LR R10,R1 R10=offset(i,j)\\n LR R1,R7 i\\n BCTR R1,0\\n MH R1,N\\n LR R6,R9 k\\n BCTR R6,0\\n AR R1,R6\\n SLA R1,2\\n L R3,A(R1) R3=a(i,k)\\n LR R1,R9 k\\n BCTR R1,0\\n MH R1,P\\n LR R6,R8 j\\n BCTR R6,0\\n AR R1,R6\\n SLA R1,2\\n L R4,B(R1) R4=b(k,j)\\n LR R15,R3 a(i,k)\\n MR R14,R4 a(i,k)*b(k,j)\\n LR R3,R15\\n AR R2,R3 R2=R2+a(i,k)*b(k,j)\\n ST R2,C(R10) c(i,j)=c(i,j)+a(i,k)*b(k,j)\\n LA R9,1(R9) k=k+1\\n B LOOPK1\\nELOOPK1 LA R8,1(R8) j=j+1\\n B LOOPJ1\\nELOOPJ1 LA R7,1(R7) i=i+1\\n B LOOPI1\\nELOOPI1 MVC Z,=CL80' ' clear buffer\\n LA R7,1\\nLOOPI2 CH R7,M do i=1 to m\\n BH ELOOPI2\\n LA R8,1\\nLOOPJ2 CH R8,P do j=1 to p\\n BH ELOOPJ2\\n LR R1,R7 i\\n BCTR R1,0\\n MH R1,P\\n LR R6,R8 j\\n BCTR R6,0\\n AR R1,R6\\n SLA R1,2\\n L R6,C(R1) c(i,j)\\n LA R3,Z\\n AH R3,IZ\\n XDECO R6,W\\n MVC 0(5,R3),W+7 output c(i,j)\\n LH R3,IZ\\n LA R3,5(R3)\\n STH R3,IZ\\n LA R8,1(R8) j=j+1\\n B LOOPJ2\\nELOOPJ2 XPRNT Z,80 print buffer\\n MVC IZ,=H'0'\\n LA R7,1(R7) i=i+1\\n B LOOPI2\\nELOOPI2 L R13,4(0,R13)\\n LM R14,R12,12(R13)\\n XR R15,R15\\n BR R14\\nA DC F'1',F'2',F'3',F'4',F'5',F'6',F'7',F'8' a(4,2)\\nB DC F'1',F'2',F'3',F'4',F'5',F'6' b(2,3)\\nC DS 12F c(4,3)\\nN DC H'2' dim(a,2)=dim(b,1)\\nM DC H'4' dim(a,1)\\nP DC H'3' dim(b,2)\\nZ DS CL80\\nIZ DC H'0'\\nW DS CL16\\n YREGS\\n END MATRIXRC\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"INCLUDE \\\"D2:PRINTF.ACT\\\" ;from the Action! Tool Kit\\n\\nDEFINE PTR=\\\"CARD\\\"\\n\\nTYPE Matrix=[\\n BYTE width,height\\n PTR data] ;INT ARRAY\\n\\nPROC PrintMatrix(Matrix POINTER m)\\n BYTE i,j\\n INT ARRAY d\\n CHAR ARRAY s(10)\\n\\n d=m.data\\n FOR j=0 TO m.height-1\\n DO\\n FOR i=0 TO m.width-1\\n DO\\n StrI(d(j*m.width+i),s)\\n PrintF(\\\"%2S \\\",s)\\n OD\\n PutE()\\n OD\\nRETURN\\n\\nPROC Create(MATRIX POINTER m BYTE w,h INT ARRAY a)\\n m.width=w\\n m.height=h\\n m.data=a\\nRETURN\\n\\nPROC MatrixMul(Matrix POINTER m1,m2,res)\\n BYTE i,j,k\\n INT ARRAY d1,d2,dres,sum\\n\\n IF m1.width#m2.height THEN\\n Print(\\\"Invalid size of matrices for multiplication!\\\")\\n Break()\\n FI\\n d1=m1.data\\n d2=m2.data\\n dres=res.data\\n\\n res.width=m2.width\\n res.height=m1.height\\n\\n FOR j=0 TO res.height-1\\n DO\\n FOR i=0 TO res.width-1\\n DO\\n sum=0\\n FOR k=0 TO m1.width-1\\n DO\\n sum==+d1(k+j*m1.width)*d2(i+k*m2.width)\\n OD\\n dres(j*res.width+i)=sum\\n OD\\n OD\\nRETURN\\n\\nPROC Main()\\n MATRIX m1,m2,res\\n INT ARRAY\\n d1=[2 1 4 0 1 1],\\n d2=[6 3 65535 0 1 1 0 4 65534 5 0 2],\\n dres(8)\\n\\n Put(125) PutE() ;clear the screen\\n\\n Create(m1,3,2,d1)\\n Create(m2,4,3,d2)\\n Create(res,0,0,dres)\\n MatrixMul(m1,m2,res)\\n\\n PrintMatrix(m1)\\n PutE() PrintE(\\\"multiplied by\\\") PutE()\\n PrintMatrix(m2)\\n PutE() PrintE(\\\"equals\\\") PutE()\\n PrintMatrix(res)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\nwith Ada.Numerics.Real_Arrays; use Ada.Numerics.Real_Arrays;\\n\\nprocedure Matrix_Product is\\n\\n procedure Put (X : Real_Matrix) is\\n type Fixed is delta 0.01 range -100.0..100.0;\\n begin\\n for I in X'Range (1) loop\\n for J in X'Range (2) loop\\n Put (Fixed'Image (Fixed (X (I, J))));\\n end loop;\\n New_Line;\\n end loop;\\n end Put;\\n\\n A : constant Real_Matrix :=\\n ( ( 1.0, 1.0, 1.0, 1.0),\\n ( 2.0, 4.0, 8.0, 16.0),\\n ( 3.0, 9.0, 27.0, 81.0),\\n ( 4.0, 16.0, 64.0, 256.0)\\n );\\n B : constant Real_Matrix :=\\n ( ( 4.0, -3.0, 4.0/3.0, -1.0/4.0 ),\\n (-13.0/3.0, 19.0/4.0, -7.0/3.0, 11.0/24.0),\\n ( 3.0/2.0, -2.0, 7.0/6.0, -1.0/4.0 ),\\n ( -1.0/6.0, 1.0/4.0, -1.0/6.0, 1.0/24.0)\\n );\\nbegin\\n Put (A * B);\\nend Matrix_Product;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package Matrix_Ops is\\n type Matrix is array (Natural range <>, Natural range <>) of Float;\\n function \\\"*\\\" (Left, Right : Matrix) return Matrix;\\nend Matrix_Ops;\\n\\npackage body Matrix_Ops is\\n ---------\\n -- \\\"*\\\" --\\n ---------\\n function \\\"*\\\" (Left, Right : Matrix) return Matrix is\\n Temp : Matrix(Left'Range(1), Right'Range(2)) := (others =>(others => 0.0));\\n begin\\n if Left'Length(2) /= Right'Length(1) then\\n raise Constraint_Error;\\n end if;\\n\\n for I in Left'range(1) loop\\n for J in Right'range(2) loop\\n for K in Left'range(2) loop\\n Temp(I,J) := Temp(I,J) + Left(I, K)*Right(K, J);\\n end loop;\\n end loop;\\n end loop;\\n return Temp;\\n end \\\"*\\\";\\nend Matrix_Ops;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"MODE FIELD = LONG REAL; # field type is LONG REAL #\\nINT default upb:=3;\\nMODE VECTOR = [default upb]FIELD;\\nMODE MATRIX = [default upb,default upb]FIELD;\\n\\n# crude exception handling #\\nPROC VOID raise index error := VOID: GOTO exception index error;\\n\\n# define the vector/matrix operators #\\nOP * = (VECTOR a,b)FIELD: ( # basically the dot product #\\n FIELD result:=0;\\n IF LWB a/=LWB b OR UPB a/=UPB b THEN raise index error FI;\\n FOR i FROM LWB a TO UPB a DO result+:= a[i]*b[i] OD;\\n result\\n );\\n\\n OP * = (VECTOR a, MATRIX b)VECTOR: ( # overload vector times matrix #\\n [2 LWB b:2 UPB b]FIELD result;\\n IF LWB a/=LWB b OR UPB a/=UPB b THEN raise index error FI;\\n FOR j FROM 2 LWB b TO 2 UPB b DO result[j]:=a*b[,j] OD;\\n result\\n );\\n# this is the task portion #\\nOP * = (MATRIX a, b)MATRIX: ( # overload matrix times matrix #\\n [LWB a:UPB a, 2 LWB b:2 UPB b]FIELD result;\\n IF 2 LWB a/=LWB b OR 2 UPB a/=UPB b THEN raise index error FI;\\n FOR k FROM LWB result TO UPB result DO result[k,]:=a[k,]*b OD;\\n result\\n );\\n\\n # Some sample matrices to test #\\ntest:(\\n MATRIX a=((1, 1, 1, 1), # matrix A #\\n (2, 4, 8, 16),\\n (3, 9, 27, 81),\\n (4, 16, 64, 256));\\n\\n MATRIX b=(( 4 , -3 , 4/3, -1/4 ), # matrix B #\\n (-13/3, 19/4, -7/3, 11/24),\\n ( 3/2, -2 , 7/6, -1/4 ),\\n ( -1/6, 1/4, -1/6, 1/24));\\n\\n MATRIX prod = a * b; # actual multiplication example of A x B #\\n\\n FORMAT real fmt = $g(-6,2)$; # width of 6, with no '+' sign, 2 decimals #\\n PROC real matrix printf= (FORMAT real fmt, MATRIX m)VOID:(\\n FORMAT vector fmt = $\\\"(\\\"n(2 UPB m-1)(f(real fmt)\\\",\\\")f(real fmt)\\\")\\\"$;\\n FORMAT matrix fmt = $x\\\"(\\\"n(UPB m-1)(f(vector fmt)\\\",\\\"lxx)f(vector fmt)\\\");\\\"$;\\n # finally print the result #\\n printf((matrix fmt,m))\\n );\\n\\n # finally print the result #\\n print((\\\"Product of a and b: \\\",new line));\\n real matrix printf(real fmt, prod)\\n EXIT\\n\\n exception index error:\\n putf(stand error, $x\\\"Exception: index error.\\\"l$)\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <hopper.h>\\nmain:\\n first matrix=0, second matrix=0,a=-1\\n {5,2},rand array(a),mulby(10),ceil, cpy(first matrix), puts,{\\\"\\\\n\\\"},puts\\n {2,3},rand array(a),mulby(10),ceil, cpy(second matrix), puts,{\\\"\\\\n\\\"},puts\\n {first matrix,second matrix},mat mul, println\\nexit(0)\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"#include <natural.h>\\n#include <hopper.h>\\nmain:\\n get a matrix of '5,2' integer random numbers, remember it in 'first matrix' and put it with a newline\\n get a matrix of '2,3' integer random numbers, remember it in 'second matrix' and put it with a newline\\n now take 'first matrix', and take 'second matrix', and multiply it; then, print with a new line.\\nexit(0)\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \" x ← +.×\\n\\n A ← ↑A*¨⊂A←⍳4 ⍝ Same A as in other examples (1 1 1 1⍪ 2 4 8 16⍪ 3 9 27 81,[0.5] 4 16 64 256)\\n B ← ⌹A ⍝ Matrix inverse of A\\n\\n 'F6.2' ⎕FMT A x B\\n1.00 0.00 0.00 0.00\\n0.00 1.00 0.00 0.00\\n0.00 0.00 1.00 0.00\\n0.00 0.00 0.00 1.00\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"--------------------- MATRIX MULTIPLY --------------------\\n\\n-- matrixMultiply :: Num a => [[a]] -> [[a]] -> [[a]]\\nto matrixMultiply(a, b)\\n script rows\\n property xs : transpose(b)\\n\\n on |λ|(row)\\n script columns\\n on |λ|(col)\\n my dotProduct(row, col)\\n end |λ|\\n end script\\n\\n map(columns, xs)\\n end |λ|\\n end script\\n\\n map(rows, a)\\nend matrixMultiply\\n\\n\\n--------------------------- TEST -------------------------\\non run\\n matrixMultiply({¬\\n {-1, 1, 4}, ¬\\n {6, -4, 2}, ¬\\n {-3, 5, 0}, ¬\\n {3, 7, -2} ¬\\n }, {¬\\n {-1, 1, 4, 8}, ¬\\n {6, 9, 10, 2}, ¬\\n {11, -4, 5, -3}})\\n\\n --> {{51, -8, 26, -18}, {-8, -38, -6, 34},\\n -- {33, 42, 38, -14}, {17, 74, 72, 44}}\\nend run\\n\\n\\n-------------------- GENERIC FUNCTIONS -------------------\\n\\n-- dotProduct :: [n] -> [n] -> Maybe n\\non dotProduct(xs, ys)\\n script mult\\n on |λ|(a, b)\\n a * b\\n end |λ|\\n end script\\n\\n if length of xs is not length of ys then\\n missing value\\n else\\n sum(zipWith(mult, xs, ys))\\n end if\\nend dotProduct\\n\\n\\n-- foldr :: (a -> b -> a) -> a -> [b] -> a\\non foldr(f, startValue, xs)\\n tell mReturn(f)\\n set v to startValue\\n set lng to length of xs\\n repeat with i from lng to 1 by -1\\n set v to |λ|(v, item i of xs, i, xs)\\n end repeat\\n return v\\n end tell\\nend foldr\\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-- 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-- product :: Num a => [a] -> a\\non product(xs)\\n script mult\\n on |λ|(a, b)\\n a * b\\n end |λ|\\n end script\\n\\n foldr(mult, 1, xs)\\nend product\\n\\n\\n-- sum :: Num a => [a] -> a\\non sum(xs)\\n script add\\n on |λ|(a, b)\\n a + b\\n end |λ|\\n end script\\n\\n foldr(add, 0, xs)\\nend sum\\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-- zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\\non zipWith(f, xs, ys)\\n set lng to min(length of xs, length of ys)\\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\": \"{{51, -8, 26, -18}, {-8, -38, -6, 34}, {33, 42, 38, -14}, {17, 74, 72, 44}}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \" 1 FOR K = 0 TO 1:M = O:N = P: READ O,P: IF K THEN DIM B(O,P): IF N < > O THEN PRINT \\\"INVALID DIMENSIONS\\\": STOP\\n 2 IF NOT K THEN DIM A(O,P)\\n 3 FOR I = 1 TO O: FOR J = 1 TO P: IF K THEN READ B(I,J)\\n 4 IF NOT K THEN READ A(I,J)\\n 5 NEXT J,I,K: DIM AB(M,P): FOR I = 1 TO M: FOR J = 1 TO P: FOR K = 1 TO N:AB(I,J) = AB(I,J) + (A(I,K) * B(K,J)): NEXT K,J,I: FOR I = 1 TO M: FOR J = 1 TO P: PRINT MID$ (S$,1 + (J = 1),1)AB(I,J);:S$ = \\\" \\\" + CHR$ (13): NEXT J,I\\n 10000 DATA4,2\\n 10010 DATA1,2,3,4,5,6,7,8\\n 20000 DATA2,3\\n 20010 DATA1,2,3,4,5,6\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"DIM matrix1(4,2),matrix2(2,3)\\n\\nMAT READ matrix1\\nDATA 1,2\\nDATA 3,4\\nDATA 5,6\\nDATA 7,8\\n\\nMAT READ matrix2\\nDATA 1,2,3\\nDATA 4,5,6\\n\\nMAT product=matrix1*matrix2\\nMAT PRINT product\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"printMatrix: function [m][\\n loop m 'row -> print map row 'val [pad to :string .format:\\\".2f\\\" val 6]\\n print \\\"--------------------------------\\\"\\n]\\n\\nmultiply: function [a,b][\\n X: size a\\n Y: size first b\\n result: array.of: @[X Y] 0\\n\\n loop 0..X-1 'i [\\n loop 0..Y-1 'j [\\n loop 0..(size first a)-1 'k ->\\n result\\\\[i]\\\\[j]: result\\\\[i]\\\\[j] + a\\\\[i]\\\\[k] * b\\\\[k]\\\\[j]\\n ]\\n ]\\n return result\\n]\\n\\nA: [[1.0 1.0 1.0 1.0]\\n [2.0 4.0 8.0 16.0]\\n [3.0 9.0 27.0 81.0]\\n [4.0 16.0 64.0 256.0]]\\n\\nB: @[@[ 4.0 0-3.0 4/3.0 0-1/4.0]\\n @[0-13/3.0 19/4.0 0-7/3.0 11/24.0]\\n @[ 3/2.0 0-2.0 7/6.0 0-1/4.0]\\n @[ 0-1/6.0 1/4.0 0-1/6.0 1/24.0]]\\n\\nprintMatrix A\\nprintMatrix B\\nprintMatrix multiply A B\\nprintMatrix multiply B A\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"Matrix(\\\"b\\\",\\\" ; rows separated by \\\",\\\"\\n, 1 2 ; entries separated by space or tab\\n, 2 3\\n, 3 0\\\")\\nMsgBox % \\\"B`n`n\\\" MatrixPrint(b)\\nMatrix(\\\"c\\\",\\\"\\n, 1 2 3\\n, 3 2 1\\\")\\nMsgBox % \\\"C`n`n\\\" MatrixPrint(c)\\n\\nMatrixMul(\\\"a\\\",b,c)\\nMsgBox % \\\"B * C`n`n\\\" MatrixPrint(a)\\n\\nMsgBox % MatrixMul(\\\"x\\\",b,b)\\n\\n\\nMatrix(_a,_v) { ; Matrix structure: m_0_0 = #rows, m_0_1 = #columns, m_i_j = element[i,j], i,j > 0\\n Local _i, _j = 0\\n Loop Parse, _v, `,\\n If (A_LoopField != \\\"\\\") {\\n _i := 0, _j ++\\n Loop Parse, A_LoopField, %A_Space%%A_Tab%\\n If (A_LoopField != \\\"\\\")\\n _i++, %_a%_%_i%_%_j% := A_LoopField\\n }\\n %_a% := _a, %_a%_0_0 := _j, %_a%_0_1 := _i\\n}\\nMatrixPrint(_a) {\\n Local _i = 0, _t\\n Loop % %_a%_0_0 {\\n _i++\\n Loop % %_a%_0_1\\n _t .= %_a%_%A_Index%_%_i% \\\"`t\\\"\\n _t .= \\\"`n\\\"\\n }\\n Return _t\\n}\\nMatrixMul(_a,_b,_c) {\\n Local _i = 0, _j, _k, _s\\n If (%_b%_0_0 != %_c%_0_1)\\n Return \\\"ERROR: inner dimensions \\\" %_b%_0_0 \\\" != \\\" %_c%_0_1\\n %_a% := _a, %_a%_0_0 := %_b%_0_0, %_a%_0_1 := %_c%_0_1\\n Loop % %_c%_0_1 {\\n _i++, _j := 0\\n Loop % %_b%_0_0 {\\n _j++, _k := _s := 0\\n Loop % %_b%_0_1\\n _k++, _s += %_b%_%_k%_%_j% * %_c%_%_i%_%_k%\\n %_a%_%_i%_%_j% := _s\\n }\\n }\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"Multiply_Matrix(A,B){\\n\\tif (A[1].Count() <> B.Count())\\n\\t\\treturn [\\\"Dimension Error\\\"]\\n\\tR := [], RRows := A.Count(), RCols:= b[1].Count()\\n\\tLoop, % RRows {\\n\\t\\tRRow:=A_Index\\n\\t\\tloop, % RCols {\\n\\t\\t\\tRCol:=A_Index, v := 0\\n\\t\\t\\tloop % A[1].Count()\\n\\t\\t\\t\\tcol := A_Index, v += A[RRow, col] * B[col, RCol]\\n\\t\\t\\tR[RRow,RCol] := v\\n\\t\\t}\\n\\t}\\n\\treturn R\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"A := [[1,2]\\n\\t, [3,4]\\n\\t, [5,6]\\n\\t, [7,8]]\\n\\nB := [[1,2,3]\\n\\t, [4,5,6]]\\n\\nif Res := Multiply_Matrix(A,B)\\n\\tMsgBox % Print(Res)\\nelse\\n\\tMsgBox Error\\nreturn\\nPrint(M){\\n\\tfor i, row in M\\n\\t\\tfor j, col in row\\n\\t\\t\\tRes .= (A_Index=1?\\\"\\\":\\\"`t\\\") col (Mod(A_Index,M[1].MaxIndex())?\\\"\\\":\\\"`n\\\")\\n\\treturn Trim(Res,\\\"`n\\\")\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# Usage: GAWK -f MATRIX_MULTIPLICATION.AWK filename\\n# Separate matrices a and b by a blank line\\nBEGIN {\\n ranka1 = 0; ranka2 = 0\\n rankb1 = 0; rankb2 = 0\\n matrix = 1 # Indicate first (1) or second (2) matrix\\n i = 0\\n}\\nNF == 0 {\\n if (++matrix > 2) {\\n printf(\\\"Warning: Ignoring data below line %d.\\\\n\\\", NR)\\n }\\n i = 0\\n next\\n}\\n{\\n # Store first matrix in a, second matrix in b\\n if (matrix == 1) {\\n ranka1 = ++i\\n ranka2 = max(ranka2, NF)\\n for (j = 1; j <= NF; j++)\\n a[i,j] = $j\\n }\\n if (matrix == 2) {\\n rankb1 = ++i\\n rankb2 = max(rankb2, NF)\\n for (j = 1; j <= NF; j++)\\n b[i,j] = $j\\n }\\n}\\nEND {\\n # Check ranks of a and b\\n if ((ranka1 < 1) || (ranka2 < 1) || (rankb1 < 1) || (rankb2 < 1) ||\\n (ranka2 != rankb1)) {\\n printf(\\\"Error: Incompatible ranks (%dx%d)*(%dx%d).\\\\n\\\", ranka1, ranka2, rankb1, rankb2)\\n exit\\n }\\n # Multiplication c = a * b\\n for (i = 1; i <= ranka1; i++) {\\n for (j = 1; j <= rankb2; j++) {\\n c[i,j] = 0\\n for (k = 1; k <= ranka2; k++)\\n c[i,j] += a[i,k] * b[k,j]\\n }\\n }\\n # Print matrix c\\n for (i = 1; i <= ranka1; i++) {\\n for (j = 1; j <= rankb2; j++)\\n printf(\\\"%g%s\\\", c[i,j], j < rankb2 ? \\\" \\\" : \\\"\\\\n\\\")\\n }\\n}\\nfunction max(m, n) {\\n return m > n ? m : n\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"Assume the matrices to be multiplied are a and b\\n IF (LEN(a,2) = LEN(b)) 'if valid dims\\n n = LEN(a,2)\\n m = LEN(a)\\n p = LEN(b,2)\\n\\n DIM ans(0 TO m - 1, 0 TO p - 1)\\n\\n FOR i = 0 TO m - 1\\n FOR j = 0 TO p - 1\\n FOR k = 0 TO n - 1\\n ans(i, j) = ans(i, j) + (a(i, k) * b(k, j))\\n NEXT k, j, i\\n\\n 'print answer\\n FOR i = 0 TO m - 1\\n FOR j = 0 TO p - 1\\n PRINT ans(i, j);\\n NEXT j\\n PRINT\\n NEXT i\\n ELSE\\n PRINT \\\"invalid dimensions\\\"\\n END IF\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \" DIM matrix1(3,1), matrix2(1,2), product(3,2)\\n\\n matrix1() = 1, 2, \\\\\\n \\\\ 3, 4, \\\\\\n \\\\ 5, 6, \\\\\\n \\\\ 7, 8\\n\\n matrix2() = 1, 2, 3, \\\\\\n \\\\ 4, 5, 6\\n\\n product() = matrix1() . matrix2()\\n\\n FOR row% = 0 TO DIM(product(),1)\\n FOR col% = 0 TO DIM(product(),2)\\n PRINT product(row%,col%),;\\n NEXT\\n PRINT\\n NEXT\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"Mul ← +˝∘×⎉1‿∞\\n\\n(>⟨\\n ⟨1, 2, 3⟩\\n ⟨4, 5, 6⟩\\n ⟨7, 8, 9⟩\\n⟩) Mul >⟨\\n ⟨1, 2, 3, 4⟩\\n ⟨5, 6, 7, 8⟩\\n ⟨9, 10, 11, 12⟩\\n⟩\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"┌─\\n╵ 20 23 26 29\\n 56 68 80 92\\n 92 113 134 155\\n ┘\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"blsq ) {{1 2}{3 4}{5 6}{7 8}}{{1 2 3}{4 5 6}}mmsp\\n9 12 15\\n19 26 33\\n29 40 51\\n39 54 69\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\n#define MAT_ELEM(rows,cols,r,c) (r*cols+c)\\n\\n//Improve performance by assuming output matrices do not overlap with\\n//input matrices. If this is C++, use the __restrict extension instead\\n#ifdef __cplusplus\\n typedef double * const __restrict MAT_OUT_t;\\n#else\\n typedef double * const restrict MAT_OUT_t;\\n#endif\\ntypedef const double * const MAT_IN_t;\\n\\nstatic inline void mat_mult(\\n const int m,\\n const int n,\\n const int p,\\n MAT_IN_t a,\\n MAT_IN_t b,\\n MAT_OUT_t c)\\n{\\n for (int row=0; row<m; row++) {\\n for (int col=0; col<p; col++) {\\n c[MAT_ELEM(m,p,row,col)] = 0;\\n for (int i=0; i<n; i++) {\\n c[MAT_ELEM(m,p,row,col)] += a[MAT_ELEM(m,n,row,i)]*b[MAT_ELEM(n,p,i,col)];\\n }\\n }\\n }\\n}\\n\\nstatic inline void mat_show(\\n const int m,\\n const int p,\\n MAT_IN_t a)\\n{\\n for (int row=0; row<m;row++) {\\n for (int col=0; col<p;col++) {\\n printf(\\\"\\\\t%7.3f\\\", a[MAT_ELEM(m,p,row,col)]);\\n }\\n putchar('\\\\n');\\n }\\n}\\n\\nint main(void)\\n{\\n double a[4*4] = {1, 1, 1, 1,\\n 2, 4, 8, 16,\\n 3, 9, 27, 81,\\n 4, 16, 64, 256};\\n\\n double b[4*3] = { 4.0, -3.0, 4.0/3,\\n -13.0/3, 19.0/4, -7.0/3,\\n 3.0/2, -2.0, 7.0/6,\\n -1.0/6, 1.0/4, -1.0/6};\\n\\n double c[4*3] = {0};\\n\\n mat_mult(4,4,3,a,b,c);\\n mat_show(4,3,c);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <blitz/tinymat.h>\\n\\nint main()\\n{\\n using namespace blitz;\\n\\n TinyMatrix<double,3,3> A, B, C;\\n\\n A = 1, 2, 3,\\n 4, 5, 6,\\n 7, 8, 9;\\n\\n B = 1, 0, 0,\\n 0, 1, 0,\\n 0, 0, 1;\\n\\n C = product(A, B);\\n\\n std::cout << C << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <iostream>\\n#include \\\"matrix.h\\\"\\n\\n#if !defined(ARRAY_SIZE)\\n #define ARRAY_SIZE(x) (sizeof((x)) / sizeof((x)[0]))\\n#endif\\n\\nint main() {\\n int am[2][3] = {\\n {1,2,3},\\n {4,5,6},\\n };\\n int bm[3][2] = {\\n {1,2},\\n {3,4},\\n {5,6}\\n };\\n\\n Matrix<int> a(ARRAY_SIZE(am), ARRAY_SIZE(am[0]), am[0], ARRAY_SIZE(am)*ARRAY_SIZE(am[0]));\\n Matrix<int> b(ARRAY_SIZE(bm), ARRAY_SIZE(bm[0]), bm[0], ARRAY_SIZE(bm)*ARRAY_SIZE(bm[0]));\\n Matrix<int> c;\\n\\n try {\\n c = a * b;\\n for (unsigned int i = 0; i < c.rowNum(); i++) {\\n for (unsigned int j = 0; j < c.colNum(); j++) {\\n std::cout << c[i][j] << \\\" \\\";\\n }\\n std::cout << std::endl;\\n }\\n } catch (MatrixException& e) {\\n std::cerr << e.message() << std::endl;\\n return e.errorCode();\\n }\\n\\n} /* main() */\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#ifndef _MATRIX_H\\n#define\\t_MATRIX_H\\n\\n#include <sstream>\\n#include <string>\\n#include <vector>\\n\\n#define MATRIX_ERROR_CODE_COUNT 5\\n#define MATRIX_ERR_UNDEFINED \\\"1 Undefined exception!\\\"\\n#define MATRIX_ERR_WRONG_ROW_INDEX \\\"2 The row index is out of range.\\\"\\n#define MATRIX_ERR_MUL_ROW_AND_COL_NOT_EQUAL \\\"3 The row number of second matrix must be equal with the column number of first matrix!\\\"\\n#define MATRIX_ERR_MUL_ROW_AND_COL_BE_GREATER_THAN_ZERO \\\"4 The number of rows and columns must be greater than zero!\\\"\\n#define MATRIX_ERR_TOO_FEW_DATA \\\"5 Too few data in matrix.\\\"\\n\\nclass MatrixException {\\nprivate:\\n std::string message_;\\n int errorCode_;\\npublic:\\n MatrixException(std::string message = MATRIX_ERR_UNDEFINED);\\n\\n inline std::string message() {\\n return message_;\\n };\\n\\n inline int errorCode() {\\n return errorCode_;\\n };\\n};\\n\\nMatrixException::MatrixException(std::string message) {\\n errorCode_ = MATRIX_ERROR_CODE_COUNT + 1;\\n std::stringstream ss(message);\\n ss >> errorCode_;\\n if (errorCode_ < 1) {\\n errorCode_ = MATRIX_ERROR_CODE_COUNT + 1;\\n }\\n std::string::size_type pos = message.find(' ');\\n if (errorCode_ <= MATRIX_ERROR_CODE_COUNT && pos != std::string::npos) {\\n message_ = message.substr(pos + 1);\\n } else {\\n message_ = message + \\\" (This an unknown and unsupported exception!)\\\";\\n }\\n}\\n\\n/**\\n * Generic class for matrices.\\n */\\ntemplate <class T>\\nclass Matrix {\\nprivate:\\n std::vector<T> v; // the data of matrix\\n unsigned int m; // the number of rows\\n unsigned int n; // the number of columns\\nprotected:\\n\\n virtual void clear() {\\n v.clear();\\n m = n = 0;\\n }\\npublic:\\n\\n Matrix() {\\n clear();\\n }\\n Matrix(unsigned int, unsigned int, T* = 0, unsigned int = 0);\\n Matrix(unsigned int, unsigned int, const std::vector<T>&);\\n\\n virtual ~Matrix() {\\n clear();\\n }\\n Matrix& operator=(const Matrix&);\\n std::vector<T> operator[](unsigned int) const;\\n Matrix operator*(const Matrix&);\\n\\n inline unsigned int rowNum() const {\\n return m;\\n }\\n\\n inline unsigned int colNum() const {\\n return n;\\n }\\n\\n inline unsigned int size() const {\\n return v.size();\\n }\\n\\n inline void add(const T& t) {\\n v.push_back(t);\\n }\\n};\\n\\ntemplate <class T>\\nMatrix<T>::Matrix(unsigned int row, unsigned int col, T* data, unsigned int dataLength) {\\n clear();\\n if (row > 0 && col > 0) {\\n m = row;\\n n = col;\\n unsigned int mxn = m * n;\\n if (dataLength && data) {\\n for (unsigned int i = 0; i < dataLength && i < mxn; i++) {\\n v.push_back(data[i]);\\n }\\n }\\n }\\n}\\n\\ntemplate <class T>\\nMatrix<T>::Matrix(unsigned int row, unsigned int col, const std::vector<T>& data) {\\n clear();\\n if (row > 0 && col > 0) {\\n m = row;\\n n = col;\\n unsigned int mxn = m * n;\\n if (data.size() > 0) {\\n for (unsigned int i = 0; i < mxn && i < data.size(); i++) {\\n v.push_back(data[i]);\\n }\\n }\\n }\\n}\\n\\ntemplate<class T>\\nMatrix<T>& Matrix<T>::operator=(const Matrix<T>& other) {\\n clear();\\n if (other.m > 0 && other.n > 0) {\\n m = other.m;\\n n = other.n;\\n unsigned int mxn = m * n;\\n for (unsigned int i = 0; i < mxn && i < other.size(); i++) {\\n v.push_back(other.v[i]);\\n }\\n }\\n return *this;\\n}\\n\\ntemplate<class T>\\nstd::vector<T> Matrix<T>::operator[](unsigned int index) const {\\n std::vector<T> result;\\n if (index >= m) {\\n throw MatrixException(MATRIX_ERR_WRONG_ROW_INDEX);\\n } else if ((index + 1) * n > size()) {\\n throw MatrixException(MATRIX_ERR_TOO_FEW_DATA);\\n } else {\\n unsigned int begin = index * n;\\n unsigned int end = begin + n;\\n for (unsigned int i = begin; i < end; i++) {\\n result.push_back(v[i]);\\n }\\n }\\n return result;\\n}\\n\\ntemplate<class T>\\nMatrix<T> Matrix<T>::operator*(const Matrix<T>& other) {\\n Matrix result(m, other.n);\\n if (n != other.m) {\\n throw MatrixException(MATRIX_ERR_MUL_ROW_AND_COL_NOT_EQUAL);\\n } else if (m <= 0 || n <= 0 || other.n <= 0) {\\n throw MatrixException(MATRIX_ERR_MUL_ROW_AND_COL_BE_GREATER_THAN_ZERO);\\n } else if (m * n > size() || other.m * other.n > other.size()) {\\n throw MatrixException(MATRIX_ERR_TOO_FEW_DATA);\\n } else {\\n for (unsigned int i = 0; i < m; i++) {\\n for (unsigned int j = 0; j < other.n; j++) {\\n T temp = v[i * n] * other.v[j];\\n for (unsigned int k = 1; k < n; k++) {\\n temp += v[i * n + k] * other.v[k * other.n + j];\\n }\\n result.v.push_back(temp);\\n }\\n }\\n }\\n return result;\\n}\\n\\n#endif\\t/* _MATRIX_H */\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"alias Matrix => Integer[][];\\n\\nvoid printMatrix(Matrix m) {\\n\\tvalue strings = m.collect((row) => row.collect(Integer.string));\\n\\tvalue maxLength = max(expand(strings).map(String.size)) else 0;\\n\\tvalue padded = strings.collect((row) => row.collect((s) => s.padLeading(maxLength)));\\n\\tfor (row in padded) {\\n\\t\\tprint(\\\"[``\\\", \\\".join(row)``]\\\");\\n\\t}\\n}\\n\\nMatrix? multiplyMatrices(Matrix a, Matrix b) {\\n\\t\\n\\tfunction rectangular(Matrix m) =>\\n\\t\\t\\tif (exists firstRow = m.first)\\n\\t\\t\\tthen m.every((row) => row.size == firstRow.size)\\n\\t\\t\\telse false;\\n\\t\\n\\tfunction rowCount(Matrix m) => m.size;\\n\\tfunction columnCount(Matrix m) => m[0]?.size else 0;\\n\\t\\n\\tif (!rectangular(a) || !rectangular(b) || columnCount(a) != rowCount(b)) {\\n\\t\\treturn null;\\n\\t}\\n\\t\\n\\tfunction getNumber(Matrix m, Integer x, Integer y) {\\n\\t\\tassert (exists number = m[y]?.get(x));\\n\\t\\treturn number;\\n\\t}\\n\\t\\n\\tfunction getRow(Matrix m, Integer rowIndex) {\\n\\t\\tassert (exists row = m[rowIndex]);\\n\\t\\treturn row;\\n\\t}\\n\\t\\n\\tfunction getColumn(Matrix m, Integer columnIndex) => {\\n\\t\\tfor (y in 0:rowCount(m))\\n\\t\\tgetNumber(m, columnIndex, y)\\n\\t};\\n\\t\\n\\treturn [\\n\\t\\tfor (y in 0:rowCount(a)) [\\n\\t\\t\\tfor (x in 0:columnCount(b))\\n\\t\\t\\tsum { 0, for ([a1, b1] in zipPairs(getRow(a, y), getColumn(b, x))) a1 * b1 }\\n\\t\\t]\\n\\t];\\n}\\n\\nshared void run() {\\n value m = [[1, 2, 3], [4, 5, 6]];\\n printMatrix(m);\\n print(\\\"---------\\\");\\n print(\\\"multiplied by\\\");\\n value m2 = [[7, 8], [9, 10], [11, 12]];\\n printMatrix(m2);\\n print(\\\"---------\\\");\\n print(\\\"equals:\\\");\\n value result = multiplyMatrices(m, m2);\\n if (exists result) {\\n printMatrix(result);\\n }\\n else {\\n print(\\\"something went wrong!\\\");\\n }\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"proc *(a:[], b:[]) {\\n\\n if (a.eltType != b.eltType) then\\n writeln(\\\"type mismatch: \\\", a.eltType, \\\" \\\", b.eltType);\\n\\n var ad = a.domain.dims();\\n var bd = b.domain.dims();\\n var (arows, acols) = ad;\\n var (brows, bcols) = bd;\\n if (arows != bcols) then\\n writeln(\\\"dimension mismatch: \\\", ad, \\\" \\\", bd);\\n\\n var c:[{arows, bcols}] a.eltType = 0;\\n\\n for i in arows do\\n for j in bcols do\\n for k in acols do\\n c(i,j) += a(i,k) * b(k,j);\\n\\n return c;\\n}\\n\",\n \"language\": \"Chapel\"\n },\n {\n \"code\": \"var m1:[{1..2, 1..2}] int;\\nm1(1,1) = 1; m1(1,2) = 2;\\nm1(2,1) = 3; m1(2,2) = 4;\\nwriteln(m1);\\n\\nvar m2:[{1..2, 1..2}] int;\\nm2(1,1) = 2; m2(1,2) = 3;\\nm2(2,1) = 4; m2(2,2) = 5;\\nwriteln(m2);\\n\\nvar m3 = m1 * m2;\\nwriteln(m3);\\n\\nvar m4:[{1..2, 1..3}] int;\\nm4(1, 1) = 1; m4(1, 2) = 2; m4(1, 3) = 3;\\nm4(2, 1) = 4; m4(2, 2) = 5; m4(2, 3) = 6;\\nwriteln(m4);\\n\\nvar m5:[{1..3, 1..2}] int;\\nm5(1, 1) = 6; m5(1, 2) = -1;\\nm5(2, 1) = 3; m5(2, 2) = 2;\\nm5(3, 1) = 0; m5(3, 2) = -3;\\nwriteln(m5);\\n\\nwriteln(m4 * m5);\\n\",\n \"language\": \"Chapel\"\n },\n {\n \"code\": \"(defn transpose\\n [s]\\n (apply map vector s))\\n\\n(defn nested-for\\n [f x y]\\n (map (fn [a]\\n (map (fn [b]\\n (f a b)) y))\\n x))\\n\\n(defn matrix-mult\\n [a b]\\n (nested-for (fn [x y] (reduce + (map * x y))) a (transpose b)))\\n\\n(def ma [[1 1 1 1] [2 4 8 16] [3 9 27 81] [4 16 64 256]])\\n(def mb [[4 -3 4/3 -1/4] [-13/3 19/4 -7/3 11/24] [3/2 -2 7/6 -1/4] [-1/6 1/4 -1/6 1/24]])\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defun matrix-multiply (a b)\\n (flet ((col (mat i) (mapcar #'(lambda (row) (elt row i)) mat))\\n (row (mat i) (elt mat i)))\\n (loop for row from 0 below (length a)\\n collect (loop for col from 0 below (length (row b 0))\\n collect (apply #'+ (mapcar #'* (row a row) (col b col)))))))\\n\\n;; example use:\\n(matrix-multiply '((1 2) (3 4)) '((-3 -8 3) (-2 1 4)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defun matrix-multiply (matrix1 matrix2)\\n (mapcar\\n (lambda (row)\\n (apply #'mapcar\\n (lambda (&rest column)\\n (apply #'+ (mapcar #'* row column))) matrix2)) matrix1))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defun mmul (A B)\\n (let* ((m (car (array-dimensions A)))\\n (n (cadr (array-dimensions A)))\\n (l (cadr (array-dimensions B)))\\n (C (make-array `(,m ,l) :initial-element 0)))\\n (loop for i from 0 to (- m 1) do\\n (loop for k from 0 to (- l 1) do\\n (setf (aref C i k)\\n (loop for j from 0 to (- n 1)\\n sum (* (aref A i j)\\n (aref B j k))))))\\n C))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(mmul #2a((1 2) (3 4)) #2a((-3 -8 3) (-2 1 4)))\\n#2A((-7 -6 11) (-17 -20 25))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defun mmult (a b)\\n (loop\\n with m = (array-dimension a 0)\\n with n = (array-dimension a 1)\\n with l = (array-dimension b 1)\\n with c = (make-array (list m l) :initial-element 0)\\n for i below m do\\n (loop for k below l do\\n (setf (aref c i k)\\n (loop for j below n\\n sum (* (aref a i j)\\n (aref b j k)))))\\n finally (return c)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.string, std.conv, std.numeric,\\n std.array, std.algorithm;\\n\\nbool isRectangular(T)(in T[][] M) pure nothrow {\\n return M.all!(row => row.length == M[0].length);\\n}\\n\\nT[][] matrixMul(T)(in T[][] A, in T[][] B) pure nothrow\\nin {\\n assert(A.isRectangular && B.isRectangular &&\\n !A.empty && !B.empty && A[0].length == B.length);\\n} body {\\n auto result = new T[][](A.length, B[0].length);\\n auto aux = new T[B.length];\\n\\n foreach (immutable j; 0 .. B[0].length) {\\n foreach (immutable k, const row; B)\\n aux[k] = row[j];\\n foreach (immutable i, const ai; A)\\n result[i][j] = dotProduct(ai, aux);\\n }\\n\\n return result;\\n}\\n\\nvoid main() {\\n immutable a = [[1, 2], [3, 4], [3, 6]];\\n immutable b = [[-3, -8, 3,], [-2, 1, 4]];\\n\\n immutable form = \\\"[%([%(%d, %)],\\\\n %)]]\\\";\\n writefln(\\\"A = \\\\n\\\" ~ form ~ \\\"\\\\n\\\", a);\\n writefln(\\\"B = \\\\n\\\" ~ form ~ \\\"\\\\n\\\", b);\\n writefln(\\\"A * B = \\\\n\\\" ~ form, matrixMul(a, b));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, std.range, std.array, std.numeric, std.algorithm;\\n\\nT[][] matMul(T)(in T[][] A, in T[][] B) pure nothrow /*@safe*/ {\\n const Bt = B[0].length.iota.map!(i=> B.transversal(i).array).array;\\n return A.map!(a => Bt.map!(b => a.dotProduct(b)).array).array;\\n}\\n\\nvoid main() {\\n immutable a = [[1, 2], [3, 4], [3, 6]];\\n immutable b = [[-3, -8, 3,], [-2, 1, 4]];\\n\\n immutable form = \\\"[%([%(%d, %)],\\\\n %)]]\\\";\\n writefln(\\\"A = \\\\n\\\" ~ form ~ \\\"\\\\n\\\", a);\\n writefln(\\\"B = \\\\n\\\" ~ form ~ \\\"\\\\n\\\", b);\\n writefln(\\\"A * B = \\\\n\\\" ~ form, matMul(a, b));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, std.range, std.numeric, std.algorithm;\\n\\nT[][] matMul(T)(immutable T[][] A, immutable T[][] B) pure nothrow {\\n immutable Bt = B[0].length.iota.map!(i=> B.transversal(i).array)\\n .array;\\n return A.map!((in a) => Bt.map!(b => a.dotProduct(b)).array).array;\\n}\\n\\nvoid main() {\\n immutable a = [[1, 2], [3, 4], [3, 6]];\\n immutable b = [[-3, -8, 3,], [-2, 1, 4]];\\n\\n immutable form = \\\"[%([%(%d, %)],\\\\n %)]]\\\";\\n writefln(\\\"A = \\\\n\\\" ~ form ~ \\\"\\\\n\\\", a);\\n writefln(\\\"B = \\\\n\\\" ~ form ~ \\\"\\\\n\\\", b);\\n writefln(\\\"A * B = \\\\n\\\" ~ form, matMul(a, b));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, std.string, std.numeric, std.algorithm, std.traits;\\n\\nalias TMMul_helper(M1, M2) = Unqual!(ForeachType!(ForeachType!M1))\\n [M2.init[0].length][M1.length];\\n\\nvoid matrixMul(T, T2, size_t k, size_t m, size_t n)\\n (in ref T[m][k] A, in ref T[n][m] B,\\n /*out*/ ref T2[n][k] result) pure nothrow /*@safe*/ @nogc\\nif (is(T2 == Unqual!T)) {\\n static if (hasIndirections!T)\\n T2[m] aux;\\n else\\n T2[m] aux = void;\\n\\n foreach (immutable j; 0 .. n) {\\n foreach (immutable i, const ref bi; B)\\n aux[i] = bi[j];\\n foreach (immutable i, const ref ai; A)\\n result[i][j] = dotProduct(ai, aux);\\n }\\n}\\n\\nvoid main() {\\n immutable int[2][3] a = [[1, 2], [3, 4], [3, 6]];\\n immutable int[3][2] b = [[-3, -8, 3,], [-2, 1, 4]];\\n\\n enum form = \\\"[%([%(%d, %)],\\\\n %)]]\\\";\\n writefln(\\\"A = \\\\n\\\" ~ form ~ \\\"\\\\n\\\", a);\\n writefln(\\\"B = \\\\n\\\" ~ form ~ \\\"\\\\n\\\", b);\\n TMMul_helper!(typeof(a), typeof(b)) result = void;\\n matrixMul(a, b, result);\\n writefln(\\\"A * B = \\\\n\\\" ~ form, result);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Matrix_multiplication;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils;\\n\\ntype\\n TMatrix = record\\n values: array of array of Double;\\n Rows, Cols: Integer;\\n constructor Create(Rows, Cols: Integer);\\n class operator Multiply(a: TMatrix; b: TMatrix): TMatrix;\\n function ToString: string;\\n end;\\n\\n{ TMatrix }\\n\\nconstructor TMatrix.Create(Rows, Cols: Integer);\\nvar\\n i: Integer;\\nbegin\\n Self.Rows := Rows;\\n self.Cols := Cols;\\n SetLength(values, Rows);\\n for i := 0 to High(values) do\\n SetLength(values[i], Cols);\\nend;\\n\\nclass operator TMatrix.Multiply(a, b: TMatrix): TMatrix;\\nvar\\n rows, cols, l: Integer;\\n i, j: Integer;\\n sum: Double;\\n k: Integer;\\nbegin\\n rows := a.Rows;\\n cols := b.Cols;\\n l := a.Cols;\\n if l <> b.Rows then\\n raise Exception.Create('Illegal matrix dimensions for multiplication');\\n result := TMatrix.create(a.rows, b.Cols);\\n for i := 0 to rows - 1 do\\n for j := 0 to cols - 1 do\\n begin\\n sum := 0.0;\\n for k := 0 to l - 1 do\\n sum := sum + (a.values[i, k] * b.values[k, j]);\\n result.values[i, j] := sum;\\n end;\\nend;\\n\\nfunction TMatrix.ToString: string;\\nvar\\n i, j: Integer;\\nbegin\\n Result := '[';\\n for i := 0 to 2 do\\n begin\\n if i > 0 then\\n Result := Result + #10;\\n Result := Result + '[';\\n for j := 0 to 2 do\\n begin\\n if j > 0 then\\n Result := Result + ', ';\\n Result := Result + format('%5.2f', [values[i, j]]);\\n end;\\n Result := Result + ']';\\n end;\\n Result := Result + ']';\\nend;\\n\\nvar\\n a, b, r: TMatrix;\\n i, j: Integer;\\n\\nbegin\\n a := TMatrix.Create(3, 3);\\n b := TMatrix.Create(3, 3);\\n a.values := [[1, 2, 3], [4, 5, 6], [7, 8, 9]];\\n b.values := [[2, 2, 2], [5, 5, 5], [7, 7, 7]];\\n r := a * b;\\n\\n Writeln('a: ');\\n Writeln(a.ToString, #10);\\n Writeln('b: ');\\n Writeln(b.ToString, #10);\\n Writeln('a * b:');\\n Writeln(r.ToString);\\n readln;\\n\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"proc matmul . m1[][] m2[][] r[][] .\\n r[][] = [ ]\\n for i to len m1[][]\\n r[][] &= [ ]\\n for j = 1 to len m2[1][]\\n r[i][] &= 0\\n for k to len m2[][]\\n r[i][j] += m1[i][k] * m2[k][j]\\n .\\n .\\n .\\n.\\nmat1[][] = [ [ 1 2 3 ] [ 4 5 6 ] ]\\nmat2[][] = [ [ 1 2 ] [ 3 4 ] [ 5 6 ] ]\\nmatmul mat1[][] mat2[][] erg[][]\\nprint erg[][]\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"program Matrix_multiplication type BasicProgram {}\\n\\t\\n\\tfunction main()\\n\\t\\ta float[][] = [[1,2,3],[4,5,6]];\\n\\t\\tb float[][] = [[1,2],[3,4],[5,6]];\\n\\t\\tc float[][] = mult(a, b);\\n\\tend\\n\\t\\n\\tfunction mult(a float[][], b float[][]) returns(float[][])\\n\\t\\tif(a.getSize() == 0)\\n\\t\\t\\treturn (new float[0][0]);\\n\\t\\tend\\n\\t\\tif(a[1].getSize() != b.getSize())\\n\\t\\t\\treturn (null); //invalid dims\\n\\t\\tend\\n\\t\\n\\t \\tn int = a[1].getSize();\\n\\t \\tm int = a.getSize();\\n\\t \\tp int = b[1].getSize();\\n\\t\\t\\n\\t\\tans float[0][0];\\n\\t\\tans.resizeAll([m, p]);\\n\\t\\t\\n\\t\\t// Calculate dot product.\\n\\t\\tfor(i int from 1 to m)\\n\\t\\t\\tfor(j int from 1 to p)\\n\\t\\t\\t\\tfor(k int from 1 to n)\\n\\t \\t ans[i][j] += a[i][k] * b[k][j];\\n\\t\\t\\t\\tend\\n\\t\\t\\tend\\n\\t\\tend\\n\\t\\treturn (ans);\\n\\tend\\nend\\n\",\n \"language\": \"EGL\"\n },\n {\n \"code\": \"open list\\n\\nmmult a b = [ [ sum $ zipWith (*) ar bc \\\\\\\\ bc <- (transpose b) ] \\\\\\\\ ar <- a ]\\n\\n[[1, 2],\\n [3, 4]] `mmult` [[-3, -8, 3],\\n [-2, 1, 4]]\\n\",\n \"language\": \"Ela\"\n },\n {\n \"code\": \" def mult(m1, m2) do\\n Enum.map m1, fn (x) -> Enum.map t(m2), fn (y) -> Enum.zip(x, y)\\n |> Enum.map(fn {x, y} -> x * y end)\\n |> Enum.sum\\n end\\n end\\n end\\n\\n def t(m) do # transpose\\n List.zip(m) |> Enum.map(&Tuple.to_list(&1))\\n end\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"MAC ZIP = ([INT n]TYPE t: vector1 vector2) -> [n][2]t:\\n [INT k = 1..n](vector1[k], vector2[k]).\\n\\nMAC TRANSPOSE = ([INT n][INT m]TYPE t: matrix) -> [m][n]t:\\n [INT i = 1..m] [INT j = 1..n] matrix[j][i].\\n\\nMAC INNER_PRODUCT{FN * = [2]TYPE t -> TYPE s, FN + = [2]s -> s}\\n = ([INT n][2]t: vector) -> s:\\n IF n = 1 THEN *vector[1]\\n ELSE *vector[1] + INNER_PRODUCT {*,+} vector[2..n]\\n FI.\\n\\nMAC MATRIX_MULT {FN * = [2]TYPE t->TYPE s, FN + = [2]s->s} =\\n([INT n][INT m]t: matrix1, [m][INT p]t: matrix2) -> [n][p]s:\\nBEGIN\\n LET transposed_matrix2 = TRANSPOSE matrix2.\\nOUTPUT [INT i = 1..n][INT j = 1..p]\\n INNER_PRODUCT{*,+}ZIP(matrix1[i],transposed_matrix2[j])\\nEND.\\n\\n\\nTYPE element = NEW elt/(1..20),\\n product = NEW prd/(1..1200).\\n\\nFN PLUS = (product: integer1 integer2) -> product:\\n ARITH integer1 + integer2.\\n\\nFN MULT = (element: integer1 integer2) -> product:\\n ARITH integer1 * integer2.\\n\\nFN MULT_234 = ([2][3]element:matrix1, [3][4]element:matrix2) ->\\n [2][4]product:\\n MATRIX_MULT{MULT,PLUS}(matrix1, matrix2).\\n\\nFN TEST = () -> [2][4]product:\\n( LET m1 = ((elt/2, elt/1, elt/1),\\n (elt/3, elt/6, elt/9)),\\n m2 = ((elt/6, elt/1, elt/3, elt/4),\\n (elt/9, elt/2, elt/8, elt/3),\\n (elt/6, elt/4, elt/1, elt/2)).\\n OUTPUT\\n MULT_234 (m1, m2)\\n).\\n\\nCOM test: just displaysignal MOC\\n\",\n \"language\": \"ELLA\"\n },\n {\n \"code\": \"(defvar M1 '((2 1 4)\\n (0 1 1)))\\n\\n(defvar M2 '(( 6 3 -1 0)\\n ( 1 1 0 4)\\n (-2 5 0 2)))\\n\\n(seq-map (lambda (a1)\\n (seq-map (lambda (a2) (apply #'+ (seq-mapn #'* a1 a2)))\\n (apply #'seq-mapn #'list M2)))\\n M1)\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"%% Multiplies two matrices. Usage example:\\n%% $ matrix:multiply([[1,2,3],[4,5,6]], [[4,4],[0,0],[1,4]])\\n%% If the dimentions are incompatible, an error is thrown.\\n%%\\n%% The erl shell may encode the lists output as strings. In order to prevent such\\n%% behaviour, BEFORE running matrix:multiply, run shell:strings(false) to disable\\n%% auto-encoding. When finished, run shell:strings(true) to reset the defaults.\\n\\n-module(matrix).\\n-export([multiply/2]).\\n\\ntranspose([[]|_]) ->\\n [];\\ntranspose(B) ->\\n [lists:map(fun hd/1, B) | transpose(lists:map(fun tl/1, B))].\\n\\n\\nred(Pair, Sum) ->\\n X = element(1, Pair), %gets X\\n Y = element(2, Pair), %gets Y\\n X * Y + Sum.\\n\\n%% Mathematical dot product. A x B = d\\n%% A, B = 1-dimension vector\\n%% d = scalar\\ndot_product(A, B) ->\\n lists:foldl(fun red/2, 0, lists:zip(A, B)).\\n\\n\\n%% Exposed function. Expected result is C = A x B.\\nmultiply(A, B) ->\\n %% First transposes B, to facilitate the calculations (It's easier to fetch\\n %% row than column wise).\\n multiply_internal(A, transpose(B)).\\n\\n\\n%% This function does the actual multiplication, but expects the second matrix\\n%% to be transposed.\\nmultiply_internal([Head | Rest], B) ->\\n % multiply each row by Y\\n Element = multiply_row_by_col(Head, B),\\n\\n % concatenate the result of this multiplication with the next ones\\n [Element | multiply_internal(Rest, B)];\\n\\nmultiply_internal([], B) ->\\n % concatenating and empty list to the end of a list, changes nothing.\\n [].\\n\\n\\nmultiply_row_by_col(Row, [Col_Head | Col_Rest]) ->\\n Scalar = dot_product(Row, Col_Head),\\n\\n [Scalar | multiply_row_by_col(Row, Col_Rest)];\\n\\nmultiply_row_by_col(Row, []) ->\\n [].\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"PROGRAM MAT_PROD\\n\\nDIM A[3,1],B[1,2],ANS[3,2]\\n\\nBEGIN\\n\\nDATA(1,2,3,4,5,6,7,8)\\nDATA(1,2,3,4,5,6)\\n\\nFOR I=0 TO 3 DO\\n FOR J=0 TO 1 DO\\n READ(A[I,J])\\n END FOR\\nEND FOR\\n\\nFOR I=0 TO 1 DO\\n FOR J=0 TO 2 DO\\n READ(B[I,J])\\n END FOR\\nEND FOR\\n\\nFOR I=0 TO UBOUND(ANS,1) DO\\n FOR J=0 TO UBOUND(ANS,2) DO\\n FOR K=0 TO UBOUND(A,2) DO\\n ANS[I,J]=ANS[I,J]+(A[I,K]*B[K,J])\\n END FOR\\n END FOR\\nEND FOR\\n! print answer\\n FOR I=0 TO UBOUND(ANS,1) DO\\n FOR J=0 TO UBOUND(ANS,2) DO\\n PRINT(ANS[I,J],)\\n END FOR\\n PRINT\\n END FOR\\n\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"function matrix_mul(sequence a, sequence b)\\n sequence c\\n if length(a[1]) != length(b) then\\n return 0\\n else\\n c = repeat(repeat(0,length(b[1])),length(a))\\n for i = 1 to length(a) do\\n for j = 1 to length(b[1]) do\\n for k = 1 to length(a[1]) do\\n c[i][j] += a[i][k]*b[k][j]\\n end for\\n end for\\n end for\\n return c\\n end if\\nend function\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"let MatrixMultiply (matrix1 : _[,] , matrix2 : _[,]) =\\n let result_row = (matrix1.GetLength 0)\\n let result_column = (matrix2.GetLength 1)\\n let ret = Array2D.create result_row result_column 0\\n for x in 0 .. result_row - 1 do\\n for y in 0 .. result_column - 1 do\\n let mutable acc = 0\\n for z in 0 .. (matrix1.GetLength 1) - 1 do\\n acc <- acc + matrix1.[x,z] * matrix2.[z,y]\\n ret.[x,y] <- acc\\n ret\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"class Main\\n{\\n // multiply two matrices (with no error checking)\\n public static Int[][] multiply (Int[][] m1, Int[][] m2)\\n {\\n Int[][] result := [,]\\n m1.each |Int[] row1|\\n {\\n Int[] row := [,]\\n m2[0].size.times |Int colNumber|\\n {\\n Int value := 0\\n m2.each |Int[] row2, Int index|\\n {\\n value += row1[index] * row2[colNumber]\\n }\\n row.add (value)\\n }\\n result.add (row)\\n }\\n return result\\n }\\n\\n public static Void main ()\\n {\\n m1 := [[1,2,3],[4,5,6]]\\n m2 := [[1,2],[3,4],[5,6]]\\n\\n echo (\\\"${m1} times ${m2} = ${multiply(m1,m2)}\\\")\\n }\\n}\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \"Array a[3,2]\\nArray b[2,3]\\n[a]:=[(2,3,5,7,11,13)]\\n[b]:=[(1,1,2,3,5,8)]\\n[a]*[b]\\n\",\n \"language\": \"Fermat\"\n },\n {\n \"code\": \"S\\\" fsl-util.fs\\\" REQUIRED\\nS\\\" fsl/dynmem.seq\\\" REQUIRED\\n: F+! ( addr -- ) ( F: r -- ) DUP F@ F+ F! ;\\n: FSQR ( F: r1 -- r2 ) FDUP F* ;\\nS\\\" fsl/gaussj.seq\\\" REQUIRED\\n\\n3 3 float matrix A{{\\n1e 2e 3e 4e 5e 6e 7e 8e 9e 3 3 A{{ }}fput\\n3 3 float matrix B{{\\n3e 3e 3e 2e 2e 2e 1e 1e 1e 3 3 B{{ }}fput\\nfloat dmatrix C{{ \\\\ result\\n\\nA{{ 3 3 B{{ 3 3 & C{{ mat*\\n3 3 C{{ }}fprint\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"real, dimension(n,m) :: a = reshape( [ (i, i=1, n*m) ], [ n, m ] )\\nreal, dimension(m,k) :: b = reshape( [ (i, i=1, m*k) ], [ m, k ] )\\nreal, dimension(size(a,1), size(b,2)) :: c ! C is an array whose first dimension (row) size\\n ! is the same as A's first dimension size, and\\n ! whose second dimension (column) size is the same\\n ! as B's second dimension size.\\n\\nc = matmul( a, b )\\n\\nprint *, 'A'\\ndo i = 1, n\\n print *, a(i,:)\\nend do\\n\\nprint *,\\nprint *, 'B'\\ndo i = 1, m\\n print *, b(i,:)\\nend do\\n\\nprint *,\\nprint *, 'C = AB'\\ndo i = 1, n\\n print *, c(i,:)\\nend do\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" program mm\\n real , allocatable :: a(:,:),b(:,:)\\n integer :: l=5,m=6,n=4\\n a = reshape([1:l*m],[l,m])\\n b = reshape([1:m*n],[m,n])\\n print'(<n>f15.7)',transpose(matmul(a,b))\\n end program\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"type Matrix\\n dim as double m( any , any )\\n declare constructor ( )\\n declare constructor ( byval x as uinteger , byval y as uinteger )\\nend type\\n\\nconstructor Matrix ( )\\nend constructor\\n\\nconstructor Matrix ( byval x as uinteger , byval y as uinteger )\\n redim this.m( x - 1 , y - 1 )\\nend constructor\\n\\noperator * ( byref a as Matrix , byref b as Matrix ) as Matrix\\n dim as Matrix ret\\n dim as uinteger i, j, k\\n if ubound( a.m , 2 ) = ubound( b.m , 1 ) and ubound( a.m , 1 ) = ubound( b.m , 2 ) then\\n redim ret.m( ubound( a.m , 1 ) , ubound( b.m , 2 ) )\\n for i = 0 to ubound( a.m , 1 )\\n for j = 0 to ubound( b.m , 2 )\\n for k = 0 to ubound( b.m , 1 )\\n ret.m( i , j ) += a.m( i , k ) * b.m( k , j )\\n next k\\n next j\\n next i\\n end if\\n return ret\\nend operator\\n\\n'some garbage matrices for demonstration\\ndim as Matrix a = Matrix(4 , 2)\\na.m(0 , 0) = 1 : a.m(0 , 1) = 0\\na.m(1 , 0) = 0 : a.m(1 , 1) = 1\\na.m(2 , 0) = 2 : a.m(2 , 1) = 3\\na.m(3 , 0) = 0.75 : a.m(3 , 1) = -0.5\\ndim as Matrix b = Matrix( 2 , 4 )\\nb.m(0 , 0) = 3.1 : b.m(0 , 1) = 1.6 : b.m(0 , 2) = -99 : b.m (0, 3) = -8\\nb.m(1 , 0) = 2.7 : b.m(1 , 1) = 0.6 : b.m(1 , 2) = 0 : b.m(1,3) = 21\\ndim as Matrix c = a * b\\nprint c.m(0, 0), c.m(0, 1), c.m(0, 2), c.m(0, 3)\\nprint c.m(1, 0), c.m(1, 1), c.m(1, 2), c.m(1, 3)\\nprint c.m(2, 0), c.m(2, 1), c.m(2, 2), c.m(2, 3)\\nprint c.m(3, 0), c.m(3, 1), c.m(3, 2), c.m(3, 3)\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"matprod[a is array, b is array] :=\\n{\\n c = makeArray[[length[a], length[b@0]], 0]\\n\\n a_row = length[a]-1\\n a_col = length[a@0]-1\\n b_col = length[b]-1\\n\\n for row = 0 to a_row\\n for col = 0 to b_col\\n for inc = 0 to a_col\\n c@row@col = c@row@col + (a@row@inc * b@inc@col)\\n\\n return c\\n}\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"fun main(x: [n][m]int, y: [m][p]int): [n][p]int =\\n map (fn xr => map (fn yc => reduce (+) 0 (zipWith (*) xr yc))\\n (transpose y))\\n x\\n\",\n \"language\": \"Futhark\"\n },\n {\n \"code\": \"# Built-in\\nA := [[1, 2], [3, 4], [5, 6], [7, 8]];\\nB := [[1, 2, 3], [4, 5, 6]];\\n\\nPrintArray(A);\\n# [ [ 1, 2 ],\\n# [ 3, 4 ],\\n# [ 5, 6 ],\\n# [ 7, 8 ] ]\\n\\nPrintArray(B);\\n# [ [ 1, 2, 3 ],\\n# [ 4, 5, 6 ] ]\\n\\nPrintArray(A * B);\\n# [ [ 9, 12, 15 ],\\n# [ 19, 26, 33 ],\\n# [ 29, 40, 51 ],\\n# [ 39, 54, 69 ] ]\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n\\n \\\"gonum.org/v1/gonum/mat\\\"\\n)\\n\\nfunc main() {\\n a := mat.NewDense(2, 4, []float64{\\n 1, 2, 3, 4,\\n 5, 6, 7, 8,\\n })\\n b := mat.NewDense(4, 3, []float64{\\n 1, 2, 3,\\n 4, 5, 6,\\n 7, 8, 9,\\n 10, 11, 12,\\n })\\n var m mat.Dense\\n m.Mul(a, b)\\n fmt.Println(mat.Formatted(&m))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n\\n mat \\\"github.com/skelterjohn/go.matrix\\\"\\n)\\n\\nfunc main() {\\n a := mat.MakeDenseMatrixStacked([][]float64{\\n {1, 2, 3, 4},\\n {5, 6, 7, 8},\\n })\\n b := mat.MakeDenseMatrixStacked([][]float64{\\n {1, 2, 3},\\n {4, 5, 6},\\n {7, 8, 9},\\n {10, 11, 12},\\n })\\n fmt.Printf(\\\"Matrix A:\\\\n%v\\\\n\\\", a)\\n fmt.Printf(\\\"Matrix B:\\\\n%v\\\\n\\\", b)\\n p, err := a.TimesDense(b)\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n fmt.Printf(\\\"Product of A and B:\\\\n%v\\\\n\\\", p)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\ntype Value float64\\ntype Matrix [][]Value\\n\\nfunc Multiply(m1, m2 Matrix) (m3 Matrix, ok bool) {\\n rows, cols, extra := len(m1), len(m2[0]), len(m2)\\n if len(m1[0]) != extra {\\n return nil, false\\n }\\n m3 = make(Matrix, rows)\\n for i := 0; i < rows; i++ {\\n m3[i] = make([]Value, cols)\\n for j := 0; j < cols; j++ {\\n for k := 0; k < extra; k++ {\\n m3[i][j] += m1[i][k] * m2[k][j]\\n }\\n }\\n }\\n return m3, true\\n}\\n\\nfunc (m Matrix) String() string {\\n rows := len(m)\\n cols := len(m[0])\\n out := \\\"[\\\"\\n for r := 0; r < rows; r++ {\\n if r > 0 {\\n out += \\\",\\\\n \\\"\\n }\\n out += \\\"[ \\\"\\n for c := 0; c < cols; c++ {\\n if c > 0 {\\n out += \\\", \\\"\\n }\\n out += fmt.Sprintf(\\\"%7.3f\\\", m[r][c])\\n }\\n out += \\\" ]\\\"\\n }\\n out += \\\"]\\\"\\n return out\\n}\\n\\nfunc main() {\\n A := Matrix{[]Value{1, 2, 3, 4},\\n []Value{5, 6, 7, 8}}\\n B := Matrix{[]Value{1, 2, 3},\\n []Value{4, 5, 6},\\n []Value{7, 8, 9},\\n []Value{10, 11, 12}}\\n P, ok := Multiply(A, B)\\n if !ok {\\n panic(\\\"Invalid dimensions\\\")\\n }\\n fmt.Printf(\\\"Matrix A:\\\\n%s\\\\n\\\\n\\\", A)\\n fmt.Printf(\\\"Matrix B:\\\\n%s\\\\n\\\\n\\\", B)\\n fmt.Printf(\\\"Product of A and B:\\\\n%s\\\\n\\\\n\\\", P)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\ntype matrix struct {\\n stride int\\n ele []float64\\n}\\n\\nfunc (m *matrix) print(heading string) {\\n if heading > \\\"\\\" {\\n fmt.Print(\\\"\\\\n\\\", heading, \\\"\\\\n\\\")\\n }\\n for e := 0; e < len(m.ele); e += m.stride {\\n fmt.Printf(\\\"%8.3f \\\", m.ele[e:e+m.stride])\\n fmt.Println()\\n }\\n}\\n\\nfunc (m1 *matrix) multiply(m2 *matrix) (m3 *matrix, ok bool) {\\n if m1.stride*m2.stride != len(m2.ele) {\\n return nil, false\\n }\\n m3 = &matrix{m2.stride, make([]float64, (len(m1.ele)/m1.stride)*m2.stride)}\\n for m1c0, m3x := 0, 0; m1c0 < len(m1.ele); m1c0 += m1.stride {\\n for m2r0 := 0; m2r0 < m2.stride; m2r0++ {\\n for m1x, m2x := m1c0, m2r0; m2x < len(m2.ele); m2x += m2.stride {\\n m3.ele[m3x] += m1.ele[m1x] * m2.ele[m2x]\\n m1x++\\n }\\n m3x++\\n }\\n }\\n return m3, true\\n}\\n\\nfunc main() {\\n a := matrix{4, []float64{\\n 1, 2, 3, 4,\\n 5, 6, 7, 8,\\n }}\\n b := matrix{3, []float64{\\n 1, 2, 3,\\n 4, 5, 6,\\n 7, 8, 9,\\n 10, 11, 12,\\n }}\\n p, ok := a.multiply(&b)\\n a.print(\\\"Matrix A:\\\")\\n b.print(\\\"Matrix B:\\\")\\n if !ok {\\n fmt.Println(\\\"not conformable for matrix multiplication\\\")\\n return\\n }\\n p.print(\\\"Product of A and B:\\\")\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def assertConformable = { a, b ->\\n assert a instanceof List\\n assert b instanceof List\\n assert a.every { it instanceof List && it.size() == b.size() }\\n assert b.every { it instanceof List && it.size() == b[0].size() }\\n}\\n\\ndef matmulWOIL = { a, b ->\\n assertConformable(a, b)\\n\\n def bt = b.transpose()\\n a.collect { ai ->\\n bt.collect { btj ->\\n [ai, btj].transpose().collect { it[0] * it[1] }.sum()\\n }\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def matmulWOT = { a, b ->\\n assertConformable(a, b)\\n\\n (0..<a.size()).collect { i ->\\n (0..<b[0].size()).collect { j ->\\n (0..<b.size()).collect { k -> a[i][k] * b[k][j] }.sum()\\n }\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def m4by2 = [ [ 1, 2 ],\\n [ 3, 4 ],\\n [ 5, 6 ],\\n [ 7, 8 ] ]\\n\\ndef m2by3 = [ [ 1, 2, 3 ],\\n [ 4, 5, 6 ] ]\\n\\nmatmulWOIL(m4by2, m2by3).each { println it }\\nprintln()\\nmatmulWOT(m4by2, m2by3).each { println it }\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Data.List\\n\\n mmult :: Num a => [[a]] -> [[a]] -> [[a]]\\n mmult a b = [ [ sum $ zipWith (*) ar bc | bc <- (transpose b) ] | ar <- a ]\\n\\n -- Example use:\\n test = [[1, 2],\\n [3, 4]] `mmult` [[-3, -8, 3],\\n [-2, 1, 4]]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Array\\n\\n mmult :: (Ix i, Num a) => Array (i,i) a -> Array (i,i) a -> Array (i,i) a\\n mmult x y\\n | x1 /= y0 || x1' /= y0' = error \\\"range mismatch\\\"\\n | otherwise = array ((x0,y1),(x0',y1')) l\\n where\\n ((x0,x1),(x0',x1')) = bounds x\\n ((y0,y1),(y0',y1')) = bounds y\\n ir = range (x0,x0')\\n jr = range (y1,y1')\\n kr = range (x1,x1')\\n l = [((i,j), sum [x!(i,k) * y!(k,j) | k <- kr]) | i <- ir, j <- jr]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"multiply :: Num a => [[a]] -> [[a]] -> [[a]]\\nmultiply us vs = map (mult [] vs) us\\n where\\n mult xs [] _ = xs\\n mult xs _ [] = xs\\n mult [] (zs : zss) (y : ys) = mult (map (y *) zs) zss ys\\n mult xs (zs : zss) (y : ys) =\\n mult\\n (zipWith (\\\\u v -> u + v * y) xs zs)\\n zss\\n ys\\n\\nmain :: IO ()\\nmain =\\n mapM_ print $\\n multiply\\n [[1, 2], [3, 4]]\\n [[-3, -8, 3], [-2, 1, 4]]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"mult :: Num a => [[a]] -> [[a]] -> [[a]]\\nmult uss vss =\\n let go xs\\n | null xs = []\\n | otherwise = foldl1 (zipWith (+)) xs\\n in go . zipWith (flip (map . (*))) vss <$> uss\\n\\nmain :: IO ()\\nmain =\\n mapM_ print $\\n mult [[1, 2], [3, 4]] [[-3, -8, 3], [-2, 1, 4]]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Numeric.LinearAlgebra\\n\\na, b :: Matrix I\\na = (2 >< 2) [1, 2, 3, 4]\\n\\nb = (2 >< 3) [-3, -8, 3, -2, 1, 4]\\n\\nmain :: IO ()\\nmain = print $ a <> b\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"REAL :: m=4, n=2, p=3, a(m,n), b(n,p), res(m,p)\\n\\na = $ ! initialize to 1, 2, ..., m*n\\nb = $ ! initialize to 1, 2, ..., n*p\\n\\nres = 0\\nDO i = 1, m\\n DO j = 1, p\\n DO k = 1, n\\n res(i,j) = res(i,j) + a(i,k) * b(k,j)\\n ENDDO\\n ENDDO\\nENDDO\\n\\nDLG(DefWidth=4, Text=a, Text=b,Y=0, Text=res,Y=0)\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"a b res\\n1 2 1 2 3 9 12 15\\n3 4 4 5 6 19 26 33\\n5 6 29 40 51\\n7 8 39 54 69\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"link matrix\\n\\nprocedure main ()\\n m1 := [[1,2,3], [4,5,6]]\\n m2 := [[1,2],[3,4],[5,6]]\\n m3 := mult_matrix (m1, m2)\\n write (\\\"Multiply:\\\")\\n write_matrix (\\\"\\\", m1) # first argument is filename, or \\\"\\\" for stdout\\n write (\\\"by:\\\")\\n write_matrix (\\\"\\\", m2)\\n write (\\\"Result: \\\")\\n write_matrix (\\\"\\\", m3)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"procedure multiply_matrix (m1, m2)\\n result := [] # to hold the final matrix\\n every row1 := !m1 do { # loop through each row in the first matrix\\n row := []\\n every colIndex := 1 to *m1 do { # and each column index of the result\\n value := 0\\n every rowIndex := 1 to *m2 do {\\n value +:= row1[rowIndex] * m2[rowIndex][colIndex]\\n }\\n put (row, value)\\n }\\n put (result, row) # add each row as it is complete\\n }\\n return result\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"result = arr1 # arr2\\n\",\n \"language\": \"IDL\"\n },\n {\n \"code\": \"import Data.Vect\\n\\nMatrix : Nat -> Nat -> Type -> Type\\nMatrix m n t = Vect m (Vect n t)\\n\\nmultiply : Num t => Matrix m1 n t -> Matrix n m2 t -> Matrix m1 m2 t\\nmultiply a b = multiply' a (transpose b)\\n where\\n dot : Num t => Vect n t -> Vect n t -> t\\n dot v1 v2 = sum $ map (\\\\(s1, s2) => (s1 * s2)) (zip v1 v2)\\n\\n multiply' : Num t => Matrix m1 n t -> Matrix m2 n t -> Matrix m1 m2 t\\n multiply' (a::as) b = map (dot a) b :: multiply' as b\\n multiply' [] _ = []\\n\",\n \"language\": \"Idris\"\n },\n {\n \"code\": \" mp =: +/ .* NB. Matrix product\\n\\n A =: ^/~>:i. 4 NB. Same A as in other examples (1 1 1 1, 2 4 8 16, 3 9 27 81,:4 16 64 256)\\n B =: %.A NB. Matrix inverse of A\\n\\n '6.2' 8!:2 A mp B\\n1.00 0.00 0.00 0.00\\n0.00 1.00 0.00 0.00\\n0.00 0.00 1.00 0.00\\n0.00 0.00 0.00 1.00\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"x ~:/ .*. y NB. boolean inner product ( ~: is \\\"not equal\\\" (exclusive or) and *. is \\\"and\\\")\\nx *./ .= y NB. which rows of x are the same as vector y?\\nx + / .= y NB. number of places where a value in row x equals the corresponding value in y\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public static double[][] mult(double a[][], double b[][]){//a[m][n], b[n][p]\\n if(a.length == 0) return new double[0][0];\\n if(a[0].length != b.length) return null; //invalid dims\\n\\n int n = a[0].length;\\n int m = a.length;\\n int p = b[0].length;\\n\\n double ans[][] = new double[m][p];\\n\\n for(int i = 0;i < m;i++){\\n for(int j = 0;j < p;j++){\\n for(int k = 0;k < n;k++){\\n ans[i][j] += a[i][k] * b[k][j];\\n }\\n }\\n }\\n return ans;\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"// returns a new matrix\\nMatrix.prototype.mult = function(other) {\\n if (this.width != other.height) {\\n throw \\\"error: incompatible sizes\\\";\\n }\\n\\n var result = [];\\n for (var i = 0; i < this.height; i++) {\\n result[i] = [];\\n for (var j = 0; j < other.width; j++) {\\n var sum = 0;\\n for (var k = 0; k < this.width; k++) {\\n sum += this.mtx[i][k] * other.mtx[k][j];\\n }\\n result[i][j] = sum;\\n }\\n }\\n return new Matrix(result);\\n}\\n\\nvar a = new Matrix([[1,2],[3,4]])\\nvar b = new Matrix([[-3,-8,3],[-2,1,4]]);\\nprint(a.mult(b));\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(function () {\\n 'use strict';\\n\\n // matrixMultiply:: [[n]] -> [[n]] -> [[n]]\\n function matrixMultiply(a, b) {\\n var bCols = transpose(b);\\n\\n return a.map(function (aRow) {\\n return bCols.map(function (bCol) {\\n return dotProduct(aRow, bCol);\\n });\\n });\\n }\\n\\n // [[n]] -> [[n]] -> [[n]]\\n function dotProduct(xs, ys) {\\n return sum(zipWith(product, xs, ys));\\n }\\n\\n return matrixMultiply(\\n [[-1, 1, 4],\\n [ 6, -4, 2],\\n [-3, 5, 0],\\n [ 3, 7, -2]],\\n\\n [[-1, 1, 4, 8],\\n [ 6, 9, 10, 2],\\n [11, -4, 5, -3]]\\n );\\n\\n // --> [[51, -8, 26, -18], [-8, -38, -6, 34],\\n // [33, 42, 38, -14], [17, 74, 72, 44]]\\n\\n\\n // GENERIC LIBRARY FUNCTIONS\\n\\n // (a -> b -> c) -> [a] -> [b] -> [c]\\n function zipWith(f, xs, ys) {\\n return xs.length === ys.length ? (\\n xs.map(function (x, i) {\\n return f(x, ys[i]);\\n })\\n ) : undefined;\\n }\\n\\n // [[a]] -> [[a]]\\n function transpose(lst) {\\n return lst[0].map(function (_, iCol) {\\n return lst.map(function (row) {\\n return row[iCol];\\n });\\n });\\n }\\n\\n // sum :: (Num a) => [a] -> a\\n function sum(xs) {\\n return xs.reduce(function (a, x) {\\n return a + x;\\n }, 0);\\n }\\n\\n // product :: n -> n -> n\\n function product(a, b) {\\n return a * b;\\n }\\n\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"[[51, -8, 26, -18], [-8, -38, -6, 34],\\n [33, 42, 38, -14], [17, 74, 72, 44]]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"((() => {\\n \\\"use strict\\\";\\n\\n // -------------- MATRIX MULTIPLICATION --------------\\n\\n // matrixMultiply :: Num a => [[a]] -> [[a]] -> [[a]]\\n const matrixMultiply = a =>\\n b => {\\n const cols = transpose(b);\\n\\n return a.map(\\n compose(\\n f => cols.map(f),\\n dotProduct\\n )\\n );\\n };\\n\\n\\n // ---------------------- TEST -----------------------\\n const main = () =>\\n JSON.stringify(matrixMultiply(\\n [\\n [-1, 1, 4],\\n [6, -4, 2],\\n [-3, 5, 0],\\n [3, 7, -2]\\n ]\\n )([\\n [-1, 1, 4, 8],\\n [6, 9, 10, 2],\\n [11, -4, 5, -3]\\n ]));\\n\\n\\n // --------------------- GENERIC ---------------------\\n\\n // compose (<<<) :: (b -> c) -> (a -> b) -> a -> c\\n const compose = (...fs) =>\\n // A function defined by the right-to-left\\n // composition of all the functions in fs.\\n fs.reduce(\\n (f, g) => x => f(g(x)),\\n x => x\\n );\\n\\n\\n // dotProduct :: Num a => [[a]] -> [[a]] -> [[a]]\\n const dotProduct = xs =>\\n // Sum of the products of the corresponding\\n // values in two lists of the same length.\\n compose(sum, zipWith(mul)(xs));\\n\\n\\n // mul :: Num a => a -> a -> a\\n const mul = a =>\\n b => a * b;\\n\\n\\n // sum :: (Num a) => [a] -> a\\n const sum = xs =>\\n xs.reduce((a, x) => a + x, 0);\\n\\n\\n // transpose :: [[a]] -> [[a]]\\n const transpose = rows =>\\n // The columns of the input transposed\\n // into new rows.\\n // Simpler version of transpose, assuming input\\n // rows of even length.\\n Boolean(rows.length) ? rows[0].map(\\n (_, i) => rows.flatMap(\\n v => v[i]\\n )\\n ) : [];\\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 // MAIN ---\\n return main();\\n}))();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def dot_product(a; b):\\n a as $a | b as $b\\n | reduce range(0;$a|length) as $i (0; . + ($a[$i] * $b[$i]) );\\n\\n# transpose/0 expects its input to be a rectangular matrix (an array of equal-length arrays)\\ndef transpose:\\n if (.[0] | length) == 0 then []\\n else [map(.[0])] + (map(.[1:]) | transpose)\\n end ;\\n\\n# A and B should both be numeric matrices, A being m by n, and B being n by p.\\ndef multiply(A; B):\\n A as $A | B as $B\\n | ($B[0]|length) as $p\\n | ($B|transpose) as $BT\\n | reduce range(0; $A|length) as $i\\n ([]; reduce range(0; $p) as $j\\n (.; .[$i][$j] = dot_product( $A[$i]; $BT[$j] ) )) ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"/* Matrix multiplication, in Jsish */\\nrequire('Matrix');\\n\\nif (Interp.conf('unitTest')) {\\n var a = new Matrix([[1,2],[3,4]]);\\n var b = new Matrix([[-3,-8,3],[-2,1,4]]);\\n; a;\\n; b;\\n; a.mult(b);\\n}\\n\\n/*\\n=!EXPECTSTART!=\\na ==> { height:2, mtx:[ [ 1, 2 ], [ 3, 4 ] ], width:2 }\\nb ==> { height:2, mtx:[ [ -3, -8, 3 ], [ -2, 1, 4 ] ], width:3 }\\na.mult(b) ==> { height:2, mtx:[ [ -7, -6, 11 ], [ -17, -20, 25 ] ], width:3 }\\n=!EXPECTEND!=\\n*/\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"julia> [1 2 3 ; 4 5 6] * [1 2 ; 3 4 ; 5 6] # product of a 2x3 by a 3x2\\n2x2 Array{Int64,2}:\\n 22 28\\n 49 64\\n\\njulia> [1 2 3] * [1,2,3] # product of a row vector by a column vector\\n1-element Array{Int64,1}:\\n 14\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \" (1 2;3 4)_mul (5 6;7 8)\\n(19 22\\n 43 50)\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \" mul::{[a b];b::+y;{a::x;+/'{a*x}'b}'x}\\n [[1 2] [3 4]] mul [[5 6] [7 8]]\\n[[19 22]\\n [43 50]]\\n\",\n \"language\": \"Klong\"\n },\n {\n \"code\": \"// version 1.1.3\\n\\ntypealias Vector = DoubleArray\\ntypealias Matrix = Array<Vector>\\n\\noperator fun Matrix.times(other: Matrix): Matrix {\\n val rows1 = this.size\\n val cols1 = this[0].size\\n val rows2 = other.size\\n val cols2 = other[0].size\\n require(cols1 == rows2)\\n val result = Matrix(rows1) { Vector(cols2) }\\n for (i in 0 until rows1) {\\n for (j in 0 until cols2) {\\n for (k in 0 until rows2) {\\n result[i][j] += this[i][k] * other[k][j]\\n }\\n }\\n }\\n return result\\n}\\n\\nfun printMatrix(m: Matrix) {\\n for (i in 0 until m.size) println(m[i].contentToString())\\n}\\n\\nfun main(args: Array<String>) {\\n val m1 = arrayOf(\\n doubleArrayOf(-1.0, 1.0, 4.0),\\n doubleArrayOf( 6.0, -4.0, 2.0),\\n doubleArrayOf(-3.0, 5.0, 0.0),\\n doubleArrayOf( 3.0, 7.0, -2.0)\\n )\\n val m2 = arrayOf(\\n doubleArrayOf(-1.0, 1.0, 4.0, 8.0),\\n doubleArrayOf( 6.0, 9.0, 10.0, 2.0),\\n doubleArrayOf(11.0, -4.0, 5.0, -3.0)\\n )\\n printMatrix(m1 * m2)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"{require lib_matrix}\\n\\n1) applying a matrix to a vector\\n\\n{def M\\n {M.new [[1,2,3],\\n [4,5,6],\\n [7,8,-9]]}}\\n-> M\\n\\n{def V {M.new [1,2,3]} }\\n-> V\\n\\n{M.multiply {M} {V}}\\n-> [14,32,-4]\\n\\n2) matrix multiplication\\n\\n{M.multiply {M} {M}}\\n-> [[ 30, 36,-12],\\n [ 66, 81,-12],\\n [-24,-18,150]]\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"[[1 2 3] [4 5 6]] 'm dress\\n[[1 2] [3 4] [5 6]] 'm dress * .\\n\",\n \"language\": \"Lang5\"\n },\n {\n \"code\": \"(defun matrix* (matrix-1 matrix-2)\\n (list-comp\\n ((<- a matrix-1))\\n (list-comp\\n ((<- b (transpose matrix-2)))\\n (lists:foldl #'+/2 0\\n (lists:zipwith #'*/2 a b)))))\\n\",\n \"language\": \"LFE\"\n },\n {\n \"code\": \"> (set ma '((1 2)\\n (3 4)\\n (5 6)\\n (7 8)))\\n((1 2) (3 4) (5 6) (7 8))\\n> (set mb (transpose ma))\\n((1 3 5 7) (2 4 6 8))\\n> (matrix* ma mb)\\n((5 11 17 23) (11 25 39 53) (17 39 61 83) (23 53 83 113))\\n\",\n \"language\": \"LFE\"\n },\n {\n \"code\": \"MatrixA$ =\\\"4, 4, 1, 1, 1, 1, 2, 4, 8, 16, 3, 9, 27, 81, 4, 16, 64, 256\\\"\\nMatrixB$ =\\\"4, 4, 4, -3, 4/3, -1/4 , -13/3, 19/4, -7/3, 11/24, 3/2, -2, 7/6, -1/4, -1/6, 1/4, -1/6, 1/24\\\"\\n\\nprint \\\"Product of two matrices\\\"\\ncall DisplayMatrix MatrixA$\\nprint \\\" *\\\"\\ncall DisplayMatrix MatrixB$\\nprint \\\" =\\\"\\nMatrixP$ =MatrixMultiply$( MatrixA$, MatrixB$)\\ncall DisplayMatrix MatrixP$\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"TO LISTVMD :A :F :C :NV\\n;PROCEDURE LISTVMD\\n;A = LIST\\n;F = ROWS\\n;C = COLS\\n;NV = NAME OF MATRIX / VECTOR NEW\\n;this procedure transform a list in matrix / vector square or rect\\n\\n(LOCAL \\\"CF \\\"CC \\\"NV \\\"T \\\"W)\\nMAKE \\\"CF 1\\nMAKE \\\"CC 1\\nMAKE \\\"NV (MDARRAY (LIST :F :C) 1)\\nMAKE \\\"T :F * :C\\nFOR [Z 1 :T][MAKE \\\"W ITEM :Z :A\\nMDSETITEM (LIST :CF :CC) :NV :W\\nMAKE \\\"CC :CC + 1\\nIF :CC = :C + 1 [MAKE \\\"CF :CF + 1 MAKE \\\"CC 1]]\\nOUTPUT :NV\\nEND\\n::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\\n::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\\n\\n\\nTO XX\\n; MAIN PROGRAM\\n;LRCVS 10.04.12\\n; THIS PROGRAM multiplies two \\\"square\\\" matrices / vector ONLY!!!\\n; THE RECTANGULAR NOT WORK!!!\\n\\nCT CS HT\\n\\n; FIRST DATA MATRIX / VECTOR\\nMAKE \\\"A [1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49]\\nMAKE \\\"FA 5 ;\\\"ROWS\\nMAKE \\\"CA 5 ;\\\"COLS\\n\\n; SECOND DATA MATRIX / VECTOR\\nMAKE \\\"B [2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50]\\nMAKE \\\"FB 5 ;\\\"ROWS\\nMAKE \\\"CB 5 ;\\\"COLS\\n\\n\\nIF (OR :FA <> :CA :FB <>:CB) [PRINT \\\"Las_matrices/vector_no_son_cuadradas THROW\\n\\\"TOPLEVEL ]\\nIFELSE (OR :CA <> :FB :FA <> :CB) [PRINT\\n\\\"Las_matrices/vector_no_son_compatibles THROW \\\"TOPLEVEL ][MAKE \\\"MA LISTVMD :A\\n:FA :CA \\\"MA MAKE \\\"MB LISTVMD :B :FB :CB \\\"MB] ;APPLICATION <<< \\\"LISTVMD\\\"\\n\\nPRINT (LIST \\\"THIS_IS: \\\"ROWS \\\"X \\\"COLS)\\nPRINT []\\nPRINT (LIST :MA \\\"=_M1 :FA \\\"ROWS \\\"X :CA \\\"COLS)\\nPRINT []\\nPRINT (LIST :MB \\\"=_M2 :FA \\\"ROWS \\\"X :CA \\\"COLS)\\nPRINT []\\n\\n\\nMAKE \\\"T :FA * :CB\\nMAKE \\\"RE (ARRAY :T 1)\\n\\n\\nMAKE \\\"CO 0\\nFOR [AF 1 :CA][\\nFOR [AC 1 :CA][\\nMAKE \\\"TEMP 0\\nFOR [I 1 :CA ][\\nMAKE \\\"TEMP :TEMP + (MDITEM (LIST :I :AF) :MA) * (MDITEM (LIST :AC :I) :MB)]\\nMAKE \\\"CO :CO + 1\\nSETITEM :CO :RE :TEMP]]\\n\\n\\nPRINT []\\nPRINT (LIST \\\"THIS_IS: :FA \\\"ROWS \\\"X :CB \\\"COLS)\\nSHOW LISTVMD :RE :FA :CB \\\"TO ;APPLICATION <<< \\\"LISTVMD\\\"\\nEND\\n\\n\\n::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\\\\\\n\\n\\n M1 * M2 RESULT / SOLUTION\\n\\n 1 3 5 7 9 2 4 6 8 10 830 1880 2930 3980 5030\\n11 13 15 17 19 12 14 16 18 20 890 2040 3190 4340 5490\\n21 23 25 27 29 X 22 24 26 28 30 = 950 2200 3450 4700 5950\\n31 33 35 37 39 32 34 36 38 40 1010 2360 3710 5060 6410\\n41 43 45 47 49 42 44 46 48 50 1070 2520 3970 5420 6870\\n\\n::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\\\\\\n\\n\\nNOW IN LOGO!!!!\\n\\n\\nTHIS_IS: ROWS X COLS\\n\\n{{1 3 5 7 9} {11 13 15 17 19} {21 23 25 27 29} {31 33 35 37 39} {41 43 45 47\\n49}} =_M1 5 ROWS X 5 COLS\\n\\n{{2 4 6 8 10} {12 14 16 18 20} {22 24 26 28 30} {32 34 36 38 40} {42 44 46 48\\n50}} =_M2 5 ROWS X 5 COLS\\n\\n\\nTHIS_IS: 5 ROWS X 5 COLS\\n{{830 1880 2930 3980 5030} {890 2040 3190 4340 5490} {950 2200 3450 4700 5950}\\n{1010 2360 3710 5060 6410} {1070 2520 3970 5420 6870}}\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"function MatMul( m1, m2 )\\n if #m1[1] ~= #m2 then -- inner matrix-dimensions must agree\\n return nil\\n end\\n\\n local res = {}\\n\\n for i = 1, #m1 do\\n res[i] = {}\\n for j = 1, #m2[1] do\\n res[i][j] = 0\\n for k = 1, #m2 do\\n res[i][j] = res[i][j] + m1[i][k] * m2[k][j]\\n end\\n end\\n end\\n\\n return res\\nend\\n\\n-- Test for MatMul\\nmat1 = { { 1, 2, 3 }, { 4, 5, 6 } }\\nmat2 = { { 1, 2 }, { 3, 4 }, { 5, 6 } }\\nerg = MatMul( mat1, mat2 )\\nfor i = 1, #erg do\\n for j = 1, #erg[1] do\\n io.write( erg[i][j] )\\n io.write(\\\" \\\")\\n end\\n io.write(\\\"\\\\n\\\")\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"local alg = require(\\\"sci.alg\\\")\\nmat1 = alg.tomat{{1, 2, 3}, {4, 5, 6}}\\nmat2 = alg.tomat{{1, 2}, {3, 4}, {5, 6}}\\nmat3 = mat1[] ** mat2[]\\nprint(mat3)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module CheckMatMult {\\n\\t\\\\\\\\ Matrix Multiplication\\n\\t\\\\\\\\ we use array pointers so we pass arrays byvalue but change this by reference\\n\\t\\\\\\\\ this can be done because always arrays passed by reference,\\n\\t\\\\\\\\ and Read statement decide if this goes to a pointer of array or copied to a local array\\n\\t\\\\\\\\ the first line of code for MatMul is: Read a as array, b as array\\n\\t\\\\\\\\ interpreter insert this at function construction.\\n\\t\\\\\\\\ if a pointer inside function change to point to a new array, the this has no reflect to the passed array.\\n\\tFunction MatMul(a as array, b as array) {\\n\\t\\tif dimension(a)<>2 or dimension(b)<>2 then Error \\\"Need two 2D arrays \\\"\\n\\t\\tlet a2=dimension(a,2), b1=dimension(b,1)\\n\\t\\tif a2<>b1 then Error \\\"Need columns of first array equal to rows of second array\\\"\\n\\t\\tlet a1=dimension(a,1), b2=dimension(b,2)\\n\\t\\tlet aBase=dimension(a,1,0)-1, bBase=dimension(b,1,0)-1\\n\\t\\tlet aBase1=dimension(a,2,0)-1, bBase1=dimension(b,2,0)-1\\n\\t\\tlink a,b to a(), b() ' change interface for arrays\\n\\t\\tdim base 1, c(a1, b2)\\n\\t\\tfor i=1 to a1 : let ia=i+abase : for j=1 to b2 : let jb=j+bBase1 : for k=1 to a2\\n\\t\\tc(i,j)+=a(ia,k+aBase1)*b(k+bBase,jb)\\n\\t\\tnext k : next j : next i\\n\\t\\t\\\\\\\\ redim to base 0\\n\\t\\tdim base 0, c(a1, b2)\\n\\t\\t=c()\\n\\t}\\n\\t\\\\\\\\ define arrays with different base per dimension\\n\\t\\\\\\\\ res() defined as empty array\\n\\tdim a(10 to 13, 4), b(4, 2 to 5), res()\\n\\t\\\\\\\\ numbers from ADA task\\n\\ta(10,0)= 1, 1, 1, 1, 2, 4, 8, 16, 3, 9, 27, 81, 4, 16, 64, 256\\n\\tb(0,2)= 4, -3, 4/3, -1/4, -13/3, 19/4, -7/3, 11/24, 3/2, -2, 7/6, -1/4, -1/6, 1/4, -1/6, 1/24\\n\\tres()=MatMul(a(), b())\\n\\tfor i=0 to 3 :for j=0 to 3\\n\\tPrint res(i,j),\\n\\tnext j : Print : next i\\n}\\nCheckMatMult\\nModule CheckMatMult2 {\\n\\t\\\\\\\\ Matrix Multiplication\\n\\t\\\\\\\\ pass arrays by reference\\n\\t\\\\\\\\ if we change a passed array here, to a new array then this change also the reference array.\\n\\tFunction MatMul(&a(),&b()) {\\n\\t\\tif dimension(a())<>2 or dimension(b())<>2 then Error \\\"Need two 2D arrays \\\"\\n\\t\\tlet a2=dimension(a(),2), b1=dimension(b(),1)\\n\\t\\tif a2<>b1 then Error \\\"Need columns of first array equal to rows of second array\\\"\\n\\t\\tlet a1=dimension(a(),1), b2=dimension(b(),2)\\n\\t\\tlet aBase=dimension(a(),1,0)-1, bBase=dimension(b(),1,0)-1\\n\\t\\tlet aBase1=dimension(a(),2,0)-1, bBase1=dimension(b(),2,0)-1\\n\\t\\tdim base 1, c(a1, b2)\\n\\t\\tfor i=1 to a1 : let ia=i+abase : for j=1 to b2 : let jb=j+bBase1 : for k=1 to a2\\n\\t\\tc(i,j)+=a(ia,k+aBase1)*b(k+bBase,jb)\\n\\t\\tnext k : next j : next i\\n\\t\\t\\\\\\\\ redim to base 0\\n\\t\\tdim base 0, c(a1, b2)\\n\\t\\t=c()\\n\\t}\\n\\t\\\\\\\\ define arrays with different base per dimension\\n\\t\\\\\\\\ res() defined as empty array\\n\\tdim a(10 to 13, 4), b(4, 2 to 5), res()\\n\\t\\\\\\\\ numbers from ADA task\\n\\ta(10,0)= 1, 1, 1, 1, 2, 4, 8, 16, 3, 9, 27, 81, 4, 16, 64, 256\\n\\tb(0,2)= 4, -3, 4/3, -1/4, -13/3, 19/4, -7/3, 11/24, 3/2, -2, 7/6, -1/4, -1/6, 1/4, -1/6, 1/24\\n\\tres()=MatMul(&a(), &b())\\n\\tfor i=0 to 3 :for j=0 to 3\\n\\tPrint res(i,j),\\n\\tnext j : Print : next i\\n}\\nCheckMatMult2\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"A := <<1|2|3>,<4|5|6>>;\\n\\nB := <<1,2,3>|<4,5,6>|<7,8,9>|<10,11,12>>;\\n\\nA . B;\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \">> A = [2,3; -2,1]\\n 2 3\\n-2 1\\n\\n>> B = [1,2;4,2]\\n 1 2\\n 4 2\\n\\n>> A * B\\n 14 10\\n 2 -2\\n\",\n \"language\": \"MathCortex\"\n },\n {\n \"code\": \"Dot[{{a, b}, {c, d}}, {{w, x}, {y, z}}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"{{a w + b y, a x + b z}, {c w + d y, c x + d z}}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"{{a, b}, {c, d}} . {{w, x}, {y, z}}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"Times[{{a, b}, {c, d}}, {{w, x}, {y, z}}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"{{a w, b x}, {c y, d z}}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"{{a, b}, {c, d}}*{{w, x}, {y, z}}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"{{a, b}, {c, d}} {{w, x}, {y, z}}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"Dot[{{85, 60, 65}, {54, 99, 33}, {46, 52, 87}}, {{89, 77, 98}, {55, 27, 25}, {80, 68, 85}}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"{{16065, 12585, 15355}, {12891, 9075, 10572}, {13914, 10862, 13203}}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \">> A = [1 2;3 4]\\n\\nA =\\n\\n 1 2\\n 3 4\\n\\n>> B = [5 6;7 8]\\n\\nB =\\n\\n 5 6\\n 7 8\\n\\n>> A * B\\n\\nans =\\n\\n 19 22\\n 43 50\\n\\n>> mtimes(A,B)\\n\\nans =\\n\\n 19 22\\n 43 50\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"a: matrix([1, 2],\\n [3, 4],\\n [5, 6],\\n [7, 8])$\\n\\nb: matrix([1, 2, 3],\\n [4, 5, 6])$\\n\\na . b;\\n/* matrix([ 9, 12, 15],\\n [19, 26, 33],\\n [29, 40, 51],\\n [39, 54, 69]) */\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"|A := 4 4 reshape 1 1 1 1 2 4 8 16 3 9 27 81 4 16 64 256\\n=1 1 1 1\\n=2 4 8 16\\n=3 9 27 81\\n=4 16 64 256\\n|B := inverse A\\n\\n|A innerproduct B\\n=1. 0. 8.3e-17 -2.9e-16\\n=1.3e-15 1. -4.4e-16 -3.3e-16\\n=0. 0. 1. 4.4e-16\\n=0. 0. 0. 1.\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \"import strfmt\\n\\ntype Matrix[M, N: static[int]] = array[M, array[N, float]]\\n\\nlet a = [[1.0, 1.0, 1.0, 1.0],\\n [2.0, 4.0, 8.0, 16.0],\\n [3.0, 9.0, 27.0, 81.0],\\n [4.0, 16.0, 64.0, 256.0]]\\n\\nlet b = [[ 4.0, -3.0 , 4/3.0, -1/4.0],\\n [-13/3.0, 19/4.0, -7/3.0, 11/24.0],\\n [ 3/2.0, -2.0 , 7/6.0, -1/4.0],\\n [ -1/6.0, 1/4.0, -1/6.0, 1/24.0]]\\n\\nproc `$`(m: Matrix): string =\\n result = \\\"([\\\"\\n for r in m:\\n if result.len > 2: result.add \\\"]\\\\n [\\\"\\n for val in r: result.add val.format(\\\"8.2f\\\")\\n result.add \\\"])\\\"\\n\\nproc `*`[M, P, N](a: Matrix[M, P]; b: Matrix[P, N]): Matrix[M, N] =\\n for i in result.low .. result.high:\\n for j in result[0].low .. result[0].high:\\n for k in a[0].low .. a[0].high:\\n result[i][j] += a[i][k] * b[k][j]\\n\\necho a\\necho b\\necho a * b\\necho b * a\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let matrix_multiply x y =\\n let x0 = Array.length x\\n and y0 = Array.length y in\\n let y1 = if y0 = 0 then 0 else Array.length y.(0) in\\n let z = Array.make_matrix x0 y1 0 in\\n for i = 0 to x0-1 do\\n for j = 0 to y1-1 do\\n for k = 0 to y0-1 do\\n z.(i).(j) <- z.(i).(j) + x.(i).(k) * y.(k).(j)\\n done\\n done\\n done;\\n z\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"(* equivalent to (apply map ...) *)\\nlet rec mapn f lists =\\n assert (lists <> []);\\n if List.mem [] lists then\\n []\\n else\\n f (List.map List.hd lists) :: mapn f (List.map List.tl lists)\\n\\nlet matrix_multiply m1 m2 =\\n List.map\\n (fun row ->\\n mapn\\n (fun column ->\\n List.fold_left (+) 0\\n (List.map2 ( * ) row column))\\n m2)\\n m1\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"a = zeros(4);\\n% prepare the matrix\\n% 1 1 1 1\\n% 2 4 8 16\\n% 3 9 27 81\\n% 4 16 64 256\\nfor i = 1:4\\n for j = 1:4\\n a(i, j) = i^j;\\n endfor\\nendfor\\nb = inverse(a);\\na * b\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"; short version based on 'apply'\\n(define (matrix-multiply matrix1 matrix2)\\n(map\\n (lambda (row)\\n (apply map\\n (lambda column\\n (apply + (map * row column)))\\n matrix2))\\n matrix1))\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"; long version based on recursive cycles\\n(define (matrix-multiply A B)\\n (define m (length A))\\n (define n (length (car A)))\\n (assert (eq? (length B) n) ===> #true)\\n (define q (length (car B)))\\n (define (at m x y)\\n (lref (lref m x) y))\\n\\n\\n (let mloop ((i (- m 1)) (rows #null))\\n (if (< i 0)\\n rows\\n (mloop\\n (- i 1)\\n (cons\\n (let rloop ((j (- q 1)) (r #null))\\n (if (< j 0)\\n r\\n (rloop\\n (- j 1)\\n (cons\\n (let loop ((k 0) (c 0))\\n (if (eq? k n)\\n c\\n (loop (+ k 1) (+ c (* (at A i k) (at B k j))))))\\n r))))\\n rows)))))\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"; [372x17] * [17x372]\\n(define M 372)\\n(define N 17)\\n\\n; [0 1 2 ... 371]\\n; [1 2 3 ... 372]\\n; [2 3 4 ... 373]\\n; ...\\n; [16 17 ... 387]\\n(define A (map (lambda (i)\\n (iota M i))\\n (iota N)))\\n\\n; [0 1 2 ... 16]\\n; [1 2 3 ... 17]\\n; [2 3 4 ... 18]\\n; ...\\n; [371 372 ... 387]\\n(define B (map (lambda (i)\\n (iota N i))\\n (iota M)))\\n\\n(for-each print (matrix-multiply A B))\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"/*REXX program multiplies two matrices together, */\\n/* displays the matrices and the result. */\\nSignal On syntax\\nx.=0\\na=.matrix~new('A',4,2,1 2 3 4 5 6 7 8) /* create matrix A */\\nb=.matrix~new('B',2,3,1 2 3 4 5 6) /* create matrix B */\\nIf a~cols<>b~rows Then\\n Call exit 'Matrices are incompatible for matrix multiplication',\\n 'a~cols='a~cols'<>b~rows='||b~rows\\n-- say a~name'[2,2] changed from' a~set(2,2,4711) 'to 4711' ; Pull .\\nc=multMat(a,b) /* multiply A x B */\\na~show\\nb~show\\nc~show\\nExit\\n\\nmultMat: Procedure\\n Use Arg a,b\\n c.=0\\n Do i=1 To a~rows\\n Do j=1 To b~cols\\n Do k=1 To a~cols\\n c.i.j=c.i.j+a~element(i,k)*b~element(k,j)\\n End /*k*/\\n End /*j*/\\n End /*i*/\\n mm=''\\n Do i=1 To a~rows\\n Do j=1 To b~cols\\n mm=mm C.i.j\\n End /*j*/\\n End /*i*/\\n c=.matrix~new('C',a~rows,b~cols,mm)\\n Return c\\n/*--------------------------------------------------------------------*/\\nExit:\\n Say arg(1)\\n Exit\\nSyntax:\\n Say 'Syntax raised in line' sigl\\n Say sourceline(sigl)\\n Say 'rc='rc '('errortext(rc)')'\\n Say '***** There was a problem!'\\n Exit\\n\\n::class Matrix\\n/********************************************************************\\n* Matrix is implemented as an array of rows\\n* where each row is an arryay of elements.\\n********************************************************************/\\n::Attribute name\\n::Attribute rows\\n::Attribute cols\\n\\n::Method init\\n expose m name rows cols\\n Use Arg name,rows,cols,elements\\n If words(elements)<>(rows*cols) Then Do\\n Say 'incorrect number of elements ('words(elements)')<>'||(rows*cols)\\n m=.nil\\n Return\\n End\\n m=.array~new\\n Do r=1 To rows\\n ro=.array~new\\n Do c=1 To cols\\n Parse Var elements e elements\\n ro~append(e)\\n End\\n m~append(ro)\\n End\\n\\n::Method element /* get an element's value */\\n expose m\\n Use Arg r,c\\n ro=m[r]\\n Return ro[c]\\n\\n::Method set /* set an element's value and return its previous */\\n expose m\\n Use Arg r,c,new\\n ro=m[r]\\n old=ro[c]\\n ro[c]=new\\n Return old\\n\\n::Method show /* display the matrix */\\n expose m name rows cols\\n z='+'\\n b6=left('',6)\\n Say ''\\n Say b6 copies('-',7) 'matrix' name copies('-',7)\\n w=0\\n Do r=1 To rows\\n ro=m[r]\\n Do c=1 To cols\\n x=ro[c]\\n w=max(w,length(x))\\n End\\n End\\n Say b6 b6 '+'copies('-',cols*(w+1)+1)'+' /* top border */\\n Do r=1 To rows\\n ro=m[r]\\n line='|' right(ro[1],w) /* element of first colsumn */ /* start with long vertical bar */\\n Do c=2 To cols /* loop for other columns */\\n line=line right(ro[c],w) /* append the elements */\\n End /* c */\\n Say b6 b6 line '|' /* append a long vertical bar. */\\n End /* r */\\n Say b6 b6 '+'copies('-',cols*(w+1)+1)'+' /* bottom border */\\n Return\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \" 'generic with striding pointers\\n 'def typ float\\n typedef float typ\\n '\\n function MatMul(typ *r,*a,*b, int n=4) 'NxN MATRIX : N=1..\\n ============================================================\\n int ystep=sizeof typ\\n int xstep=n*sizeof typ\\n int i,j,k\\n sys px\\n for i=1 to n\\n px=@a\\n for j=1 to n\\n r=0\\n for k=1 to n\\n r+=(a*b)\\n @a+=xstep\\n @b+=ystep\\n next\\n @r+=ystep\\n px+=ystep\\n @a=px\\n @b-=xstep\\n next\\n @a-=xstep\\n @b+=xstep\\n next\\n end function\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \" 'Example of matrix layout mapped to an array of 4x4 cells\\n '\\n ' 0 4 8 C\\n ' 1 5 9 D\\n ' 2 6 A E\\n ' 3 7 B F\\n '\\n\\n % MatrixType double\\n\\n sub MatrixMul(MatrixType *A,*B,*C, sys n)\\n '========================================\\n '\\n '\\n #if leftmatch matrixtype single\\n % OneStep 4\\n % mtype single\\n #endif\\n '\\n #if leftmatch matrixtype double\\n % OneStep 8\\n % mtype double\\n #endif\\n\\n sys pa=@A, pb=@B, pc=@C\\n sys ColStep=OneStep*n\\n\\n mov ecx,pa\\n mov edx,pb\\n mov eax,pc\\n\\n mov esi,n\\n (\\n call column : dec esi : jg repeat\\n )\\n exit sub\\n\\n column:\\n '======\\n\\n mov edi,n\\n (\\n call cell : dec edi : jg repeat\\n )\\n add edx,ColStep\\n sub ecx,ColStep\\n ret\\n\\n cell: ' row A * column B\\n '=======================\\n\\n 'matrix data is stored ascending vertically then horizontally\\n 'thus rows are minor, columns are major\\n '\\n push ecx\\n push edx\\n push eax\\n mov eax,4\\n fldz\\n (\\n fld mtype [ecx]\\n fmul mtype [edx]\\n faddp st1\\n add ecx,ColStep 'next column of matrix A\\n add edx,OneStep 'next row of matrix B\\n dec eax\\n jnz repeat\\n )\\n pop eax\\n fstp mtype [eax] 'assign to next row of matrix C\\n '\\n pop edx\\n pop ecx\\n add eax,OneStep 'next cell in column of matrix C (columns then rows)\\n add ecx,OneStep 'next row of matrix A\\n ret\\n '\\n end sub\\n\\n\\n function ShowMatrix(MatrixType*A,sys n) as string\\n '================================================\\n string cr=chr(13)+chr(10), tab=chr(9)\\n function=\\\"MATRIX \\\" n \\\"x\\\" n cr cr\\n sys i,j,m\\n '\\n for i=1 to n\\n m=0\\n for j=1 to n\\n function+=str( A[m+i] ) tab\\n m+=n\\n next\\n function+=cr\\n next\\n end function\\n\\n 'TEST\\n '====\\n\\n % n 4\\n MatrixType A[n*n],B[n*n],C[n*n]\\n\\n\\n 'reading vertically (minor) then left to right (major)\\n\\n A <= 4,0,0,1, 0,4,0,0, 0,0,4,0, 0,0,0,4\\n\\n B <= 2,0,0,2, 0,2,0,0, 0,0,2,0, 0,0,0,2\\n\\n\\n MatrixMul A,B,C,n\\n\\n Print ShowMatrix C,n\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"M*N\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"sub mmult\\n {\\n our @a; local *a = shift;\\n our @b; local *b = shift;\\n my @p = [];\\n my $rows = @a;\\n my $cols = @{ $b[0] };\\n my $n = @b - 1;\\n for (my $r = 0 ; $r < $rows ; ++$r)\\n {\\n for (my $c = 0 ; $c < $cols ; ++$c)\\n {\\n $p[$r][$c] += $a[$r][$_] * $b[$_][$c]\\n foreach 0 .. $n;\\n }\\n }\\n return [@p];\\n }\\n\\nsub display { join(\\\"\\\\n\\\" => map join(\\\" \\\" => map(sprintf(\\\"%4d\\\", $_), @$_)), @{+shift}).\\\"\\\\n\\\" }\\n\\n@a =\\n(\\n [1, 2],\\n [3, 4]\\n);\\n\\n@b =\\n(\\n [-3, -8, 3],\\n [-2, 1, 4]\\n);\\n\\n$c = mmult(\\\\@a,\\\\@b);\\ndisplay($c)\\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;\\\">matrix_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</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: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">ha</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">wa</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">hb</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">wb</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">apply</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">a</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;\\\">b</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]},</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">wa</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">hb</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"invalid aguments\\\"</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;\\\">c</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: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">wb</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">ha</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;\\\">ha</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;\\\">wb</span> <span style=\\\"color: #008080;\\\">do</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: #000000;\\\">wa</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">c</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: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]*</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">j</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: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">c</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</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_IntFmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%3d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">pp_FltFmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%3.0f\\\"</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\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">A</span> <span style=\\\"color: #0000FF;\\\">=</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>\\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>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6</span> <span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8</span> <span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #000000;\\\">B</span> <span style=\\\"color: #0000FF;\\\">=</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;\\\">3</span> <span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6</span> <span style=\\\"color: #0000FF;\\\">}}</span>\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">matrix_mul</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\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">C</span> <span style=\\\"color: #0000FF;\\\">=</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;\\\">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;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">16</span> <span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">27</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">81</span> <span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">16</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">64</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">256</span> <span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #000000;\\\">D</span> <span style=\\\"color: #0000FF;\\\">=</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: #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: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</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;\\\">13</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">19</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">11</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;\\\">3</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;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">6</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;\\\">4</span> <span style=\\\"color: #0000FF;\\\">},</span>\\n <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;\\\">6</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: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">24</span> <span style=\\\"color: #0000FF;\\\">}}</span>\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">matrix_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">C</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">D</span><span style=\\\"color: #0000FF;\\\">))</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">F</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;\\\">3</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #000000;\\\">G</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>\\n <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: #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>\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">matrix_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">F</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">G</span><span style=\\\"color: #0000FF;\\\">))</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">H</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>\\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>\\n <span style=\\\"color: #000000;\\\">I</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">}}</span>\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">matrix_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">H</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">I</span><span style=\\\"color: #0000FF;\\\">))</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">r</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><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">R</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;\\\">r</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <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: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">matrix_mul</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\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- large matrix example from OI:</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">row</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;\\\">l</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">l</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;\\\">function</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">J</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: #000000;\\\">row</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">16</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">371</span><span style=\\\"color: #0000FF;\\\">}),</span>\\n <span style=\\\"color: #000000;\\\">K</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: #000000;\\\">row</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">371</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">16</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #7060A8;\\\">pp</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: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">shorten</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">matrix_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">J</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">),{</span><span style=\\\"color: #008000;\\\">\\\"\\\"</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;\\\">2</span><span style=\\\"color: #0000FF;\\\">))</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(de matMul (Mat1 Mat2)\\n (mapcar\\n '((Row)\\n (apply mapcar Mat2\\n '(@ (sum * Row (rest))) ) )\\n Mat1 ) )\\n\\n(matMul\\n '((1 2 3) (4 5 6))\\n '((6 -1) (3 2) (0 -3)) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"/* Matrix multiplication of A by B, yielding C */\\nMMULT: procedure (a, b, c);\\n declare (a, b, c)(*,*) float controlled;\\n declare (i, j, m, n, p) fixed binary;\\n\\n if hbound(a,2) ^= hbound(b,1) then\\n do;\\n put skip list\\n ('Matrices are incompatible for matrix multiplication');\\n signal error;\\n end;\\n\\n m = hbound(a, 1); p = hbound(b, 2);\\n if allocation(c) > 0 then free c;\\n\\n allocate c(m,p);\\n\\n do i = 1 to m;\\n do j = 1 to p;\\n c(i,j) = sum(a(i,*) * b(*,j) );\\n end;\\n end;\\nend MMULT;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"define matmul(a, b) -> c;\\n lvars ba = boundslist(a), bb = boundslist(b);\\n lvars i, i0 = ba(1), i1 = ba(2);\\n lvars j, j0 = bb(1), j1 = bb(2);\\n lvars k, k0 = bb(3), k1 = bb(4);\\n if length(ba) /= 4 then\\n throw([need_2d_array ^a])\\n endif;\\n if length(bb) /= 4 then\\n throw([need_2d_array ^b])\\n endif;\\n if ba(3) /= j0 or ba(4) /= j1 then\\n throw([dimensions_do_not_match ^a ^b]);\\n endif;\\n newarray([^i0 ^i1 ^k0 ^k1], 0) -> c;\\n for i from i0 to i1 do\\n for k from k0 to k1 do\\n for j from j0 to j1 do\\n c(i, k) + a(i, j)*b(j, k) -> c(i, k);\\n endfor;\\n endfor;\\n endfor;\\nenddefine;\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \"function multarrays($a, $b) {\\n $n,$m,$p = ($a.Count - 1), ($b.Count - 1), ($b[0].Count - 1)\\n if ($a[0].Count -ne $b.Count) {throw \\\"Multiplication impossible\\\"}\\n $c = @(0)*($a[0].Count)\\n foreach ($i in 0..$n) {\\n $c[$i] = foreach ($j in 0..$p) {\\n $sum = 0\\n foreach ($k in 0..$m){$sum += $a[$i][$k]*$b[$k][$j]}\\n $sum\\n }\\n }\\n $c\\n }\\n\\nfunction show($a) { $a | foreach{\\\"$_\\\"}}\\n\\n$a = @(@(1,2),@(3,4))\\n$b = @(@(5,6),@(7,8))\\n$c = @(5,6)\\n\\\"`$a =\\\"\\nshow $a\\n\\\"\\\"\\n\\\"`$b =\\\"\\nshow $b\\n\\\"\\\"\\n\\\"`$c =\\\"\\n$c\\n\\\"\\\"\\n\\\"`$a * `$b =\\\"\\nshow (multarrays $a $b)\\n\\\" \\\"\\n\\\"`$a * `$c =\\\"\\nshow (multarrays $a $c)\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"% SWI-Prolog has transpose/2 in its clpfd library\\n:- use_module(library(clpfd)).\\n\\n% N is the dot product of lists V1 and V2.\\ndot(V1, V2, N) :- maplist(product,V1,V2,P), sumlist(P,N).\\nproduct(N1,N2,N3) :- N3 is N1*N2.\\n\\n% Matrix multiplication with matrices represented\\n% as lists of lists. M3 is the product of M1 and M2\\nmmult(M1, M2, M3) :- transpose(M2,MT), maplist(mm_helper(MT), M1, M3).\\nmm_helper(M2, I1, M3) :- maplist(dot(I1), M2, M3).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Procedure multiplyMatrix(Array a(2), Array b(2), Array prd(2))\\n Protected ar = ArraySize(a()) ;#rows for matrix a\\n Protected ac = ArraySize(a(), 2) ;#cols for matrix a\\n Protected br = ArraySize(b()) ;#rows for matrix b\\n Protected bc = ArraySize(b(), 2) ;#cols for matrix b\\n\\n If ac = br\\n Dim prd(ar, bc)\\n\\n Protected i, j, k\\n For i = 0 To ar\\n For j = 0 To bc\\n For k = 0 To br ;ac\\n prd(i, j) = prd(i, j) + (a(i, k) * b(k, j))\\n Next\\n Next\\n Next\\n\\n ProcedureReturn #True ;multiplication performed, product in prd()\\n Else\\n ProcedureReturn #False ;multiplication not performed, dimensions invalid\\n EndIf\\nEndProcedure\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"DataSection\\n Data.i 2,3 ;matrix a (#rows, #cols)\\n Data.i 1,2,3, 4,5,6 ;elements by row\\n\\n Data.i 3,1 ;matrix b (#rows, #cols)\\n Data.i 1, 5, 9 ;elements by row\\nEndDataSection\\n\\nProcedure displayMatrix(Array a(2), text.s)\\n Protected i, j\\n Protected columns = ArraySize(a(), 2), rows = ArraySize(a(), 1)\\n\\n PrintN(text + \\\": (\\\" + Str(rows + 1) + \\\", \\\" + Str(columns + 1) + \\\")\\\")\\n For i = 0 To rows\\n For j = 0 To columns\\n Print(LSet(Str(a(i, j)), 4, \\\" \\\"))\\n Next\\n PrintN(\\\"\\\")\\n Next\\n PrintN(\\\"\\\")\\nEndProcedure\\n\\nProcedure loadMatrix(Array a(2))\\n Protected rows, columns, i, j\\n Read.i rows\\n Read.i columns\\n\\n Dim a(rows - 1, columns - 1)\\n\\n For i = 0 To rows - 1\\n For j = 0 To columns - 1\\n Read.i a(i, j)\\n Next\\n Next\\nEndProcedure\\n\\nDim a(0,0)\\nDim b(0,0)\\nDim c(0,0)\\n\\nIf OpenConsole()\\n loadMatrix(a()): displayMatrix(a(), \\\"matrix a\\\")\\n loadMatrix(b()): displayMatrix(b(), \\\"matrix b\\\")\\n\\n If multiplyMatrix(a(), b(), c())\\n displayMatrix(c(), \\\"product of a * b\\\")\\n Else\\n PrintN(\\\"product of a * b is undefined\\\")\\n EndIf\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\")\\n Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"a=((1, 1, 1, 1), # matrix A #\\n (2, 4, 8, 16),\\n (3, 9, 27, 81),\\n (4, 16, 64, 256))\\n\\nb=(( 4 , -3 , 4/3., -1/4. ), # matrix B #\\n (-13/3., 19/4., -7/3., 11/24.),\\n ( 3/2., -2. , 7/6., -1/4. ),\\n ( -1/6., 1/4., -1/6., 1/24.))\\n\\n\\n\\ndef MatrixMul( mtx_a, mtx_b):\\n tpos_b = zip( *mtx_b)\\n rtn = [[ sum( ea*eb for ea,eb in zip(a,b)) for b in tpos_b] for a in mtx_a]\\n return rtn\\n\\n\\nv = MatrixMul( a, b )\\n\\nprint 'v = ('\\nfor r in v:\\n print '[',\\n for val in r:\\n print '%8.2f '%val,\\n print ']'\\nprint ')'\\n\\n\\nu = MatrixMul(b,a)\\n\\nprint 'u = '\\nfor r in u:\\n print '[',\\n for val in r:\\n print '%8.2f '%val,\\n print ']'\\nprint ')'\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from operator import mul\\n\\ndef matrixMul(m1, m2):\\n return map(\\n lambda row:\\n map(\\n lambda *column:\\n sum(map(mul, row, column)),\\n *m2),\\n m1)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def mm(A, B):\\n return [[sum(x * B[i][col] for i,x in enumerate(row)) for col in range(len(B[0]))] for row in A]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import numpy as np\\nnp.dot(a,b)\\n#or if a is an array\\na.dot(b)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"a %*% b\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(define (m-mult m1 m2)\\n (for/list ([r m1])\\n (for/list ([c (apply map list m2)])\\n (apply + (map * r c)))))\\n(m-mult '((1 2) (3 4)) '((5 6) (7 8)))\\n;; -> '((19 22) (43 50))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#lang racket\\n(require math)\\n(matrix* (matrix [[1 2] [3 4]]) (matrix [[5 6] [7 8]]))\\n;; -> (array #[#[19 22] #[43 50]])\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub mmult(@a,@b) {\\n my @p;\\n for ^@a X ^@b[0] -> ($r, $c) {\\n @p[$r][$c] += @a[$r][$_] * @b[$_][$c] for ^@b;\\n }\\n @p;\\n}\\n\\nmy @a = [1, 1, 1, 1],\\n [2, 4, 8, 16],\\n [3, 9, 27, 81],\\n [4, 16, 64, 256];\\n\\nmy @b = [ 4 , -3 , 4/3, -1/4 ],\\n [-13/3, 19/4, -7/3, 11/24],\\n [ 3/2, -2 , 7/6, -1/4 ],\\n [ -1/6, 1/4, -1/6, 1/24];\\n\\n.say for mmult(@a,@b);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"sub mmult(\\\\a,\\\\b) {\\n [\\n for ^a -> \\\\r {\\n [\\n for ^b[0] -> \\\\c {\\n [+] a[r;^b] Z* b[^b;c]\\n }\\n ]\\n }\\n ]\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"multi infix:<×> (@A, @B) {\\n\\t@A.map: -> @a { do [+] @a Z× @B[*;$_] for ^@B[0] }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"sub infix:<·> { [+] @^a Z* @^b }\\nsub infix:<×>(@A, @B) { (@A X· [Z] @B).rotor(@B) }\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"public rel[real, real, real] matrixMultiplication(rel[real x, real y, real v] matrix1, rel[real x, real y, real v] matrix2){\\n\\tif (max(matrix1.x) == max(matrix2.y)){\\n\\t\\tp = {<x1,y1,x2,y2, v1*v2> | <x1,y1,v1> <- matrix1, <x2,y2,v2> <- matrix2};\\n\\n\\t\\tresult = {};\\n\\t\\tfor (y <- matrix1.y){\\n\\t\\t\\tfor (x <- matrix2.x){\\n\\t\\t\\t\\tv = (0.0 | it + v | <x1, y1, x2, y2, v> <- p, x==x2 && y==y1, x1==y2 && y2==x1);\\n\\t\\t\\t\\tresult += <x,y,v>;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\telse throw \\\"Matrix sizes do not match.\\\";\\n\\n//a matrix, given by a relation of the x-coordinate, y-coordinate and value.\\npublic rel[real x, real y, real v] matrixA = {\\n<0.0,0.0,12.0>, <0.0,1.0, 6.0>, <0.0,2.0,-4.0>,\\n<1.0,0.0,-51.0>, <1.0,1.0,167.0>, <1.0,2.0,24.0>,\\n<2.0,0.0,4.0>, <2.0,1.0,-68.0>, <2.0,2.0,-41.0>\\n};\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"/*REXX program calculates the Kronecker product of two arbitrary size matrices. */\\nSignal On syntax\\nx.=0\\namat=4X2 1 2 3 4 5 6 7 8 /* define A matrix size and elements */\\nbmat=2X3 1 2 3 4 5 6 /* \\\" B \\\" \\\" \\\" \\\" */\\nCall makeMat 'A',amat /* construct A matrix from elements */\\nCall makeMat 'B',bmat /* \\\" B \\\" \\\" \\\" */\\nIf cols.A<>rows.B Then\\n Call exit 'Matrices are incompatible for matrix multiplication',\\n 'cols.A='cols.A'<>rows.B='rows.B\\nCall multMat /* multiply A x B */\\nCall showMat 'A',amat /* display matrix A */\\nCall showMat 'B',bmat /* \\\" \\\" B */\\nCall showMat 'C',mm /* \\\" \\\" C */\\nExit\\n/*--------------------------------------------------------------------*/\\nmakeMat:\\n Parse Arg what,size elements /*elements: e.1.1 e.1.2 - e.rows cols*/\\n Parse Var size rows 'X' cols\\n x.what.shape=rows cols\\n Parse Value rows cols With rows.what cols.what\\n n=0\\n Do r=1 To rows\\n Do c=1 To cols\\n n=n+1\\n element=word(elements,n)\\n x.what.r.c=element\\n End\\n End\\n Return\\n/*--------------------------------------------------------------------*/\\nmultMat:\\n/* x.C.*.* = x.A.*.* x x.B.*.* */\\n Do i=1 To rows.A\\n Do j=1 To cols.B\\n Do k=1 To cols.A\\n x.C.i.j=x.C.i.j+x.A.i.k*x.B.k.j\\n End /*k*/\\n End /*j*/\\n End /*i*/\\n mm=rows.A||'X'||cols.B\\n Do i=1 To rows.A\\n Do j=1 To cols.B\\n mm=mm x.C.i.j\\n End /*j*/\\n End /*i*/\\n Call makeMat 'C',mm\\n Return\\n/*--------------------------------------------------------------------*/\\nshowMat:\\n Parse Arg what,size .\\n Parse Var size rows 'X' cols\\n z='+'\\n b6=left('',6)\\n Say ''\\n Say b6 copies('-',7) 'matrix' what copies('-',7)\\n w=0\\n Do r=1 To rows\\n Do c=1 To cols\\n w=max(w,length(x.what.r.c))\\n End\\n End\\n Say b6 b6 '+'copies('-',cols*(w+1)+1)'+' /* top border */\\n Do r=1 To rows\\n line='|' right(x.what.r.1,w) /* element of first colsumn */ /* start with long vertical bar */\\n Do c=2 To cols /* loop for other columns */\\n line=line right(x.what.r.c,w) /* append the elements */\\n End /* c */\\n Say b6 b6 line '|' /* append a long vertical bar. */\\n End /* r */\\n Say b6 b6 '+'copies('-',cols*(w+1)+1)'+' /* bottom border */\\n Return\\nexit:\\n Say arg(1)\\n Exit\\n\\nSyntax:\\n Say 'Syntax raised in line' sigl\\n Say sourceline(sigl)\\n Say 'rc='rc '('errortext(rc)')'\\n Say '***** There was a problem!'\\n Exit\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"load \\\"stdlib.ring\\\"\\nn = 3\\nC = newlist(n,n)\\nA = [[1,2,3], [4,5,6], [7,8,9]]\\nB = [[1,0,0], [0,1,0], [0,0,1]]\\nfor i = 1 to n\\n for j = 1 to n\\n for k = 1 to n\\n C[i][k] += A[i][j] * B[j][k]\\n next\\n next\\nnext\\nfor i = 1 to n\\n for j = 1 to n\\n see C[i][j] + \\\" \\\"\\n next\\n see nl\\nnext\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'matrix'\\n\\nMatrix[[1, 2],\\n [3, 4]] * Matrix[[-3, -8, 3],\\n [-2, 1, 4]]\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"def matrix_mult(a, b)\\n a.map do |ar|\\n b.transpose.map { |bc| ar.zip(bc).map{ |x| x.inject(&:*) }.sum }\\n end\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"struct Matrix {\\n dat: [[f32; 3]; 3]\\n}\\n\\nimpl Matrix {\\n pub fn mult_m(a: Matrix, b: Matrix) -> Matrix\\n {\\n let mut out = Matrix {\\n dat: [[0., 0., 0.],\\n [0., 0., 0.],\\n [0., 0., 0.]\\n ]\\n };\\n\\n for i in 0..3{\\n for j in 0..3 {\\n for k in 0..3 {\\n out.dat[i][j] += a.dat[i][k] * b.dat[k][j];\\n }\\n }\\n }\\n\\n out\\n }\\n\\n pub fn print(self)\\n {\\n for i in 0..3 {\\n for j in 0..3 {\\n print!(\\\"{} \\\", self.dat[i][j]);\\n }\\n print!(\\\"\\\\n\\\");\\n }\\n }\\n}\\n\\nfn main()\\n{\\n let a = Matrix {\\n dat: [[1., 2., 3.],\\n [4., 5., 6.],\\n [7., 8., 9.]\\n ]\\n };\\n\\n let b = Matrix {\\n dat: [[1., 0., 0.],\\n [0., 1., 0.],\\n [0., 0., 1.]]\\n };\\n\\t\\n\\n\\n let c = Matrix::mult_m(a, b);\\n\\n\\n c.print();\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"% Matrix multiplication is a built-in with the S-Lang octothorpe operator.\\nvariable A = [1,2,3,4,5,6];\\nreshape(A, [2,3]); % reshape 1d array to 2 rows, 3 columns\\nprintf(\\\"A is %S\\\\n\\\", A); print(A);\\n\\nvariable B = [1:6]; % index range, 1 to 6 same as above in A\\nreshape(B, [3,2]); % reshape to 3 rows, 2 columns\\nprintf(\\\"\\\\nB is %S\\\\n\\\", B); print(B);\\n\\nprintf(\\\"\\\\nA # B is %S\\\\n\\\", A#B);\\nprint(A#B);\\n\\n% Multiply binary operator is different, dimensions need to be equal\\nreshape(B, [2,3]);\\nprintf(\\\"\\\\nA * B is %S (with reshaped B to match A)\\\\n\\\", A*B);\\nprint(A*B);\\n\",\n \"language\": \"S-lang\"\n },\n {\n \"code\": \"def mult[A](a: Array[Array[A]], b: Array[Array[A]])(implicit n: Numeric[A]) = {\\n import n._\\n for (row <- a)\\n yield for(col <- b.transpose)\\n yield row zip col map Function.tupled(_*_) reduceLeft (_+_)\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"def mult[A, CC[X] <: Seq[X], DD[Y] <: Seq[Y]](a: CC[DD[A]], b: CC[DD[A]])\\n(implicit n: Numeric[A]): CC[DD[A]] = {\\n import n._\\n for (row <- a)\\n yield for(col <- b.transpose)\\n yield row zip col map Function.tupled(_*_) reduceLeft (_+_)\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (matrix-multiply matrix1 matrix2)\\n (map\\n (lambda (row)\\n (apply map\\n (lambda column\\n (apply + (map * row column)))\\n matrix2))\\n matrix1))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"const type: matrix is array array float;\\n\\nconst func matrix: (in matrix: left) * (in matrix: right) is func\\n result\\n var matrix: result is matrix.value;\\n local\\n var integer: i is 0;\\n var integer: j is 0;\\n var integer: k is 0;\\n var float: accumulator is 0.0;\\n begin\\n if length(left[1]) <> length(right) then\\n raise RANGE_ERROR;\\n else\\n result := length(left) times length(right[1]) times 0.0;\\n for i range 1 to length(left) do\\n for j range 1 to length(right) do\\n accumulator := 0.0;\\n for k range 1 to length(left) do\\n accumulator +:= left[i][k] * right[k][j];\\n end for;\\n result[i][j] := accumulator;\\n end for;\\n end for;\\n end if;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"matmul(A(2), B(2)) [i,j] :=\\n let k := 1...size(B);\\n in sum( A[i,k] * B[k,j] );\\n\\n//Example Use\\na := [[1, 2],\\n [3, 4]];\\n\\nb := [[-3, -8, 3],\\n [-2, 1, 4]];\\n\\ntest := matmul(a, b);\\n\",\n \"language\": \"SequenceL\"\n },\n {\n \"code\": \"matmul(A(2), B(2)) [i,j] := sum( A[i,all] * B[all,j] );\\n\",\n \"language\": \"SequenceL\"\n },\n {\n \"code\": \"func matrix_multi(a, b) {\\n var m = [[]]\\n for r in ^a {\\n for c in ^b[0] {\\n for i in ^b {\\n m[r][c] := 0 += (a[r][i] * b[i][c])\\n }\\n }\\n }\\n return m\\n}\\n \\nvar a = [\\n [1, 2],\\n [3, 4],\\n [5, 6],\\n [7, 8]\\n ]\\n \\nvar b = [\\n [1, 2, 3],\\n [4, 5, 6]\\n ]\\n \\nfor line in matrix_multi(a, b) {\\n say line.map{|i|'%3d' % i }.join(', ')\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"(1) -> A:=matrix [[1,2],[3,4],[5,6],[7,8]]\\n\\n +1 2+\\n | |\\n |3 4|\\n (1) | |\\n |5 6|\\n | |\\n +7 8+\\n Type: Matrix(Integer)\\n(2) -> B:=matrix [[1,2,3],[4,5,6]]\\n\\n +1 2 3+\\n (2) | |\\n +4 5 6+\\n Type: Matrix(Integer)\\n(3) -> A*B\\n\\n +9 12 15+\\n | |\\n |19 26 33|\\n (3) | |\\n |29 40 51|\\n | |\\n +39 54 69+\\n Type: Matrix(Integer)\\n\",\n \"language\": \"SPAD\"\n },\n {\n \"code\": \"CREATE TABLE a (x integer, y integer, e real);\\nCREATE TABLE b (x integer, y integer, e real);\\n\\n-- test data\\n-- A is a 2x2 matrix\\nINSERT INTO a VALUES(0,0,1); INSERT INTO a VALUES(1,0,2);\\nINSERT INTO a VALUES(0,1,3); INSERT INTO a VALUES(1,1,4);\\n\\n-- B is a 2x3 matrix\\nINSERT INTO b VALUES(0,0,-3); INSERT INTO b VALUES(1,0,-8); INSERT INTO b VALUES(2,0,3);\\nINSERT INTO b VALUES(0,1,-2); INSERT INTO b VALUES(1,1, 1); INSERT INTO b VALUES(2,1,4);\\n\\n-- C is 2x2 * 2x3 so will be a 2x3 matrix\\nSELECT rhs.x, lhs.y, (SELECT sum(a.e*b.e) FROM a, b\\n WHERE a.y = lhs.y\\n AND b.x = rhs.x\\n AND a.x = b.y)\\n INTO TABLE c\\n FROM a AS lhs, b AS rhs\\n WHERE lhs.x = 0 AND rhs.y = 0;\\n\",\n \"language\": \"SQL\"\n },\n {\n \"code\": \"structure IMatrix = struct\\nfun dot(x,y) = Vector.foldli (fn (i,xi,agg) => agg+xi*Vector.sub(y,i)) 0 x\\nfun x*y =\\n let\\n\\topen Array2\\n in\\n\\ttabulate ColMajor (nRows x, nCols y, fn (i,j) => dot(row(x,i),column(y,j)))\\n end\\nend;\\n(* for display *)\\nfun toList a =\\n let\\n\\topen Array2\\n in\\n\\tList.tabulate(nRows a, fn i => List.tabulate(nCols a, fn j => sub(a,i,j)))\\n end;\\n(* example *)\\nlet\\n open IMatrix\\n val m1 = Array2.fromList [[1,2],[3,4]]\\n val m2 = Array2.fromList [[~3,~8,3],[~2,1,4]]\\nin\\n toList (m1*m2)\\nend;\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"val it = [[~7,~6,11],[~17,~20,25]] : int list list\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \". mat a=1,2,3\\\\4,5,6\\n. mat b=1,1,0,0\\\\1,0,0,1\\\\0,0,1,1\\n. mat c=a*b\\n. mat list c\\n\\nc[2,4]\\n c1 c2 c3 c4\\nr1 3 1 3 5\\nr2 9 4 6 11\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \": a=1,2,3\\\\4,5,6\\n: b=1,1,0,0\\\\1,0,0,1\\\\0,0,1,1\\n: a*b\\n 1 2 3 4\\n +---------------------+\\n 1 | 3 1 3 5 |\\n 2 | 9 4 6 11 |\\n +---------------------+\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"@inlinable\\npublic func matrixMult<T: Numeric>(_ m1: [[T]], _ m2: [[T]]) -> [[T]] {\\n let n = m1[0].count\\n let m = m1.count\\n let p = m2[0].count\\n\\n guard m != 0 else {\\n return []\\n }\\n\\n precondition(n == m2.count)\\n\\n var ret = Array(repeating: Array(repeating: T.zero, count: p), count: m)\\n\\n for i in 0..<m {\\n for j in 0..<p {\\n for k in 0..<n {\\n ret[i][j] += m1[i][k] * m2[k][j]\\n }\\n }\\n }\\n\\n return ret\\n}\\n\\n@inlinable\\npublic func printMatrix<T>(_ matrix: [[T]]) {\\n guard !matrix.isEmpty else {\\n print()\\n\\n return\\n }\\n\\n let rows = matrix.count\\n let cols = matrix[0].count\\n\\n for i in 0..<rows {\\n for j in 0..<cols {\\n print(matrix[i][j], terminator: \\\" \\\")\\n }\\n\\n print()\\n }\\n}\\n\\nlet m1 = [\\n [6.5, 2, 3],\\n [4.5, 1, 5]\\n]\\n\\nlet m2 = [\\n [10.0, 16, 23, 50],\\n [12, -8, 16, -4],\\n [70, 60, -1, -2]\\n]\\n\\nlet m3 = matrixMult(m1, m2)\\n\\nprintMatrix(m3)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"operator (A matmul B)\\n $A -> \\\\[i](\\n $B(1) -> \\\\[j](@: 0;\\n 1..$B::length -> @: $@ + $A($i;$) * $B($;$j);\\n $@ !\\\\) !\\n \\\\) !\\nend matmul\\n\\ntemplates printMatrix&{w:}\\n templates formatN\\n @: [];\\n $ -> #\\n '$@ -> $::length~..$w -> ' ';$@(last..1:-1)...;' !\\n when <1..> do ..|@: $ mod 10; $ ~/ 10 -> #\\n when <=0?($@ <[](0)>)> do ..|@: 0;\\n end formatN\\n $... -> '|$(1) -> formatN;$(2..last)... -> ', $ -> formatN;';|\\n' !\\nend printMatrix\\n\\ndef a: [[1, 2, 3], [4, 5, 6]];\\n'a:\\n' -> !OUT::write\\n$a -> printMatrix&{w:2} -> !OUT::write\\n\\ndef b: [[0, 1], [2, 3], [4, 5]];\\n'\\nb:\\n' -> !OUT::write\\n$b -> printMatrix&{w:2} -> !OUT::write\\n'\\naxb:\\n' -> !OUT::write\\n($a matmul $b) -> printMatrix&{w:2} -> !OUT::write\\n\",\n \"language\": \"Tailspin\"\n },\n {\n \"code\": \"package require Tcl 8.5\\nnamespace path ::tcl::mathop\\nproc matrix_multiply {a b} {\\n lassign [size $a] a_rows a_cols\\n lassign [size $b] b_rows b_cols\\n if {$a_cols != $b_rows} {\\n error \\\"incompatible sizes: a($a_rows, $a_cols), b($b_rows, $b_cols)\\\"\\n }\\n set temp [lrepeat $a_rows [lrepeat $b_cols 0]]\\n for {set i 0} {$i < $a_rows} {incr i} {\\n for {set j 0} {$j < $b_cols} {incr j} {\\n set sum 0\\n for {set k 0} {$k < $a_cols} {incr k} {\\n set sum [+ $sum [* [lindex $a $i $k] [lindex $b $k $j]]]\\n }\\n lset temp $i $j $sum\\n }\\n }\\n return $temp\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"Disp [A]*[B]\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"[[1,2][3,4][5,6][7,8]]*[[1,2,3][4,5,6]]\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"[1,2; 3,4; 5,6; 7,8] → m1\\n[1,2,3; 4,5,6] → m2\\nm1 * m2\\n\",\n \"language\": \"TI-89-BASIC\"\n },\n {\n \"code\": \"[1,2; 3,4; 5,6; 7,8] * [1,2,3; 4,5,6]\\n\",\n \"language\": \"TI-89-BASIC\"\n },\n {\n \"code\": \"[[9,12,15][19,26,33][29,40,51][39,54,69]]\\n\",\n \"language\": \"TI-89-BASIC\"\n },\n {\n \"code\": \"#lang transd\\n\\n\\nMainModule: {\\n _start: (λ (with n 5\\n A (for i in Range(n) project (for k in Range(n) project k))\\n B (for i in Range(n) project (for k in Range(n) project (- n k)))\\n C (for i in Range(n) project (for k in Range(n) project 0))\\n\\n (for i in Range( n ) do\\n (for j in Range( n ) do\\n (for k in Range( n ) do\\n (+= (get (get C i) j) (* (get (get A i) k) (get (get B k) j)))\\n )))\\n (lout C))\\n )\\n}\\n\",\n \"language\": \"Transd\"\n },\n {\n \"code\": \"#!/bin/bash\\n\\nDELAY=0 # increase this if printing of matrices should be slower\\n\\necho \\\"This script takes two matrices, henceforth called A and B,\\nand returns their product, AB.\\n\\nFor the time being, matrices can have integer components only.\\n\\n\\\"\\n\\nread -p \\\"Number of rows of matrix A: \\\" arows\\nread -p \\\"Number of columns of matrix A: \\\" acols\\nbrows=\\\"$acols\\\"\\necho\\necho \\\"Number of rows of matrix B: \\\"$brows\\nread -p \\\"Number of columns of matrix B: \\\" bcols\\n\\ncrows=\\\"$arows\\\"\\nccols=\\\"$bcols\\\"\\necho\\n\\necho \\\"Number of rows of matrix AB: \\\" $crows\\necho \\\"Number of columns of matrix AB: \\\" $ccols\\necho\\necho\\n\\nmatrixa=( )\\nmatrixb=( )\\n\\n# input matrix A\\n\\nmaxlengtha=0\\nfor ((row=1; row<=arows; row++)); do\\n for ((col=1; col<=acols; col++)); do\\n\\tcheckentry=\\\"false\\\"\\n\\twhile [ \\\"$checkentry\\\" != \\\"true\\\" ]; do\\n\\t read -p \\\"Enter component A[$row, $col]: \\\" number\\n\\t index=$(((row-1)*acols+col))\\n\\t matrixa[$index]=\\\"$number\\\"\\n\\t [ \\\"${matrixa[$index]}\\\" -eq \\\"$number\\\" ] && checkentry=\\\"true\\\"\\n\\t echo\\n\\tdone\\n\\tentry=\\\"${matrixa[$index]}\\\"\\n\\t[ \\\"${#entry}\\\" -gt \\\"$maxlengtha\\\" ] && maxlengtha=\\\"${#entry}\\\"\\n done\\n echo\\ndone\\n\\n# print matrix A to guard against errors\\n\\nif [ \\\"$maxlengtha\\\" -le \\\"5\\\" ]; then\\n width=8\\nelse\\n width=$((maxlengtha + 3))\\nfi\\n\\necho \\\"This is matrix A:\\n\\n\\\"\\n\\nfor ((row=1; row<=arows; row++)); do\\n for ((col=1; col<=acols; col++)); do\\n\\n\\tindex=$(((row-1)*acols+col))\\n\\tprintf \\\"%${width}d\\\" \\\"${matrixa[$index]}\\\"\\n\\tsleep \\\"$DELAY\\\"\\n\\n done\\n echo; echo # printf %s \\\"\\\\n\\\\n\\\" does not work...\\ndone\\n\\necho\\necho\\n\\n# input matrix B\\n\\nmaxlengthb=0\\nfor ((row=1; row<=brows; row++)); do\\n for ((col=1; col<=bcols; col++)); do\\n\\tcheckentry=\\\"false\\\"\\n\\twhile [ \\\"$checkentry\\\" != \\\"true\\\" ]; do\\n\\t read -p \\\"Enter component B[$row, $col]: \\\" number\\n\\t index=$(((row-1)*bcols+col))\\n\\t matrixb[$index]=\\\"$number\\\"\\n\\t [ \\\"${matrixb[$index]}\\\" -eq \\\"$number\\\" ] && checkentry=\\\"true\\\"\\n\\t echo\\n\\tdone\\n\\tentry=\\\"${matrixb[$index]}\\\"\\n\\t[ \\\"${#entry}\\\" -gt \\\"$maxlengthb\\\" ] && maxlengthb=\\\"${#entry}\\\"\\n done\\n echo\\ndone\\n\\n# print matrix B to guard against errors\\n\\nif [ \\\"$maxlengthb\\\" -le \\\"5\\\" ]; then\\n width=8\\nelse\\n width=$((maxlengthb + 3))\\nfi\\n\\necho \\\"This is matrix B:\\n\\n\\\"\\n\\nfor ((row=1; row<=brows; row++)); do\\n for ((col=1; col<=bcols; col++)); do\\n\\n\\tindex=$(((row-1)*bcols+col))\\n\\tprintf \\\"%${width}d\\\" \\\"${matrixb[$index]}\\\"\\n\\tsleep \\\"$DELAY\\\"\\n\\n done\\n echo; echo # printf %s \\\"\\\\n\\\\n\\\" does not work...\\ndone\\n\\nread -p \\\"Hit enter to continue\\\"\\n\\n# calculate matrix C := AB\\n\\nmaxlengthc=0\\ntime for ((row=1; row<=crows; row++)); do\\n for ((col=1; col<=ccols; col++)); do\\n\\t\\n\\t# calculate component C[$row, $col]\\n\\n\\trunningtotal=0\\n\\tfor ((j=1; j<=acols; j++)); do\\n\\t rowa=\\\"$row\\\"\\n\\t cola=\\\"$j\\\"\\n\\t indexa=$(((rowa-1)*acols+cola))\\n\\t rowb=\\\"$j\\\"\\n\\t colb=\\\"$col\\\"\\n\\t indexb=$(((rowb-1)*bcols+colb))\\n\\t\\n\\t entry_from_A=${matrixa[$indexa]}\\n\\t entry_from_B=${matrixb[$indexb]}\\n\\n\\t subtotal=$((entry_from_A * entry_from_B))\\n\\t ((runningtotal+=subtotal))\\n\\tdone\\n\\t\\n\\tnumber=\\\"$runningtotal\\\"\\n\\n\\t# store component in the result array\\n\\tindex=$(((row-1)*ccols+col))\\n\\tmatrixc[$index]=\\\"$number\\\"\\n\\n\\tentry=\\\"${matrixc[$index]}\\\"\\n\\t[ \\\"${#entry}\\\" -gt \\\"$maxlengthc\\\" ] && maxlengthc=\\\"${#entry}\\\"\\n done\\ndone\\n\\necho\\nread -p \\\"Hit enter to continue\\\"\\necho\\n\\n# print the matrix C\\n\\nif [ \\\"$maxlengthc\\\" -le \\\"5\\\" ]; then\\n width=8\\nelse\\n width=$((maxlengthc + 3))\\nfi\\n\\necho \\\"The product matrix is:\\n\\n\\\"\\n\\nfor ((row=1; row<=crows; row++)); do\\n for ((col=1; col<=ccols; col++)); do\\n\\n\\tindex=$(((row-1)*ccols+col))\\n\\tprintf \\\"%${width}d\\\" \\\"${matrixc[$index]}\\\"\\n\\tsleep \\\"$DELAY\\\"\\n\\n done\\n echo; echo # printf %s \\\"\\\\n\\\\n\\\" does not work...\\ndone\\n\\necho\\necho\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#import rat\\n\\na =\\n\\n<\\n <1/1, 1/1, 1/1, 1/1>,\\n <2/1, 4/1, 8/1, 16/1>,\\n <3/1, 9/1, 27/1, 81/1>,\\n <4/1, 16/1, 64/1, 256/1>>\\n\\nb =\\n\\n<\\n < 4/1, -3/1, 4/3, -1/4>,\\n <-13/3, 19/4, -7/3, 11/24>,\\n < 3/2, -2/1, 7/6, -1/4>,\\n < -1/6, 1/4, -1/6, 1/24>>\\n\\nmmult = *rK7lD *rlD sum:-0.+ product*p\\n\\n#cast %qLL\\n\\ntest = mmult(a,b)\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"Function matrix_multiplication(a As Variant, b As Variant) As Variant\\n matrix_multiplication = WorksheetFunction.MMult(a, b)\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Dim matrix1(2,2)\\nmatrix1(0,0) = 3 : matrix1(0,1) = 7 : matrix1(0,2) = 4\\nmatrix1(1,0) = 5 : matrix1(1,1) = -2 : matrix1(1,2) = 9\\nmatrix1(2,0) = 8 : matrix1(2,1) = -6 : matrix1(2,2) = -5\\nDim matrix2(2,2)\\nmatrix2(0,0) = 9 : matrix2(0,1) = 2 : matrix2(0,2) = 1\\nmatrix2(1,0) = -7 : matrix2(1,1) = 3 : matrix2(1,2) = -10\\nmatrix2(2,0) = 4 : matrix2(2,1) = 5 : matrix2(2,2) = -6\\n\\nCall multiply_matrix(matrix1,matrix2)\\n\\nSub multiply_matrix(arr1,arr2)\\n\\tFor i = 0 To UBound(arr1)\\n\\t\\tFor j = 0 To 2\\n\\t\\t\\tWScript.StdOut.Write (arr1(i,j) * arr2(i,j)) & vbTab\\n\\t\\tNext\\n\\t\\tWScript.StdOut.WriteLine\\n\\tNext\\nEnd Sub\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"LOCAL ARRAY a[4,2], b[2,3], c[4,3]\\nCLOSE DATABASES ALL\\n*!* The arrays could be created directly but I prefer to do this:\\nCREATE CURSOR mat1 (c1 I, c2 I)\\nCREATE CURSOR mat2 (c1 I, c2 I, c3 I)\\n*!* Since matrix multiplication of integer arrays\\n*!* involves only multiplication and addition,\\n*!* the result will contain integers\\nCREATE CURSOR result (c1 I, c2 I, c3 I)\\nINSERT INTO mat1 VALUES (1, 2)\\nINSERT INTO mat1 VALUES (3, 4)\\nINSERT INTO mat1 VALUES (5, 6)\\nINSERT INTO mat1 VALUES (7, 8)\\nSELECT * FROM mat1 INTO ARRAY a\\n\\nINSERT INTO mat2 VALUES (1, 2, 3)\\nINSERT INTO mat2 VALUES (4, 5, 6)\\nSELECT * FROM mat2 INTO ARRAY b\\nSTORE 0 TO c\\nMatMult(@a,@b,@c)\\nSELECT result\\nAPPEND FROM ARRAY c\\nBROWSE\\n\\n\\nPROCEDURE MatMult(aa, bb, cc)\\nLOCAL n As Integer, m As Integer, p As Integer, i As Integer, j As Integer, k As Integer\\nIF ALEN(aa,2) = ALEN(bb,1)\\n\\tn = ALEN(aa,2)\\n\\tm = ALEN(aa,1)\\n\\tp = ALEN(bb,2)\\n\\tFOR i = 1 TO m\\n\\t\\tFOR j = 1 TO p\\n\\t\\t\\tFOR k = 1 TO n\\n\\t\\t\\t\\tcc[i,j] = cc[i,j] + aa[i,k]*bb[k,j]\\n\\t\\t\\tENDFOR\\n\\t\\tENDFOR\\n\\tENDFOR\\t\\t\\nELSE\\n\\t? \\\"Invalid dimensions\\\"\\nENDIF\\nENDPROC\\n\",\n \"language\": \"Visual-FoxPro\"\n },\n {\n \"code\": \"import \\\"./matrix\\\" for Matrix\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar a = Matrix.new([\\n [1, 2],\\n [3, 4],\\n [5, 6],\\n [7, 8]\\n])\\n\\nvar b = Matrix.new([\\n [1, 2, 3],\\n [4, 5, 6]\\n])\\n\\nSystem.print(\\\"Matrix A:\\\\n\\\")\\nFmt.mprint(a, 2, 0)\\nSystem.print(\\\"\\\\nMatrix B:\\\\n\\\")\\nFmt.mprint(b, 2, 0)\\nSystem.print(\\\"\\\\nMatrix A x B:\\\\n\\\")\\nFmt.mprint(a * b, 3, 0)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"proc Mat4x1Mul(M, V); \\\\Multiply matrix M times column vector V\\nreal M, \\\\4x4 matrix [M] * [V] -> [V]\\n V; \\\\column vector\\nreal W(4); \\\\working copy of column vector\\nint R; \\\\row\\n[for R:= 0 to 4-1 do\\n W(R):= M(R,0)*V(0) + M(R,1)*V(1) + M(R,2)*V(2) + M(R,3)*V(3);\\nfor R:= 0 to 4-1 do V(R):= W(R);\\n];\\n\\nproc Mat4x4Mul(M, N); \\\\Multiply matrix M times matrix N\\nreal M, N; \\\\4x4 matrices [M] * [N] -> [N]\\nreal W(4,4); \\\\working copy of matrix N\\nint C; \\\\column\\n[for C:= 0 to 4-1 do\\n [W(0,C):= M(0,0)*N(0,C) + M(0,1)*N(1,C) + M(0,2)*N(2,C) + M(0,3)*N(3,C);\\n W(1,C):= M(1,0)*N(0,C) + M(1,1)*N(1,C) + M(1,2)*N(2,C) + M(1,3)*N(3,C);\\n W(2,C):= M(2,0)*N(0,C) + M(2,1)*N(1,C) + M(2,2)*N(2,C) + M(2,3)*N(3,C);\\n W(3,C):= M(3,0)*N(0,C) + M(3,1)*N(1,C) + M(3,2)*N(2,C) + M(3,3)*N(3,C);\\n ];\\nfor C:= 0 to 4-1 do\\n [N(0,C):= W(0,C);\\n N(1,C):= W(1,C);\\n N(2,C):= W(2,C);\\n N(3,C):= W(3,C);\\n ];\\n];\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"<?xml-stylesheet href=\\\"matmul.templ.xsl\\\" type=\\\"text/xsl\\\"?>\\n<mult>\\n <A>\\n <r><c>1</c><c>2</c></r>\\n <r><c>3</c><c>4</c></r>\\n <r><c>5</c><c>6</c></r>\\n <r><c>7</c><c>8</c></r>\\n </A>\\n <B>\\n <r><c>1</c><c>2</c><c>3</c></r>\\n <r><c>4</c><c>5</c><c>6</c></r>\\n </B>\\n</mult>\\n\",\n \"language\": \"XSLT-1.0\"\n },\n {\n \"code\": \"<xsl:stylesheet version=\\\"1.0\\\"\\n xmlns:xsl=\\\"http://www.w3.org/1999/XSL/Transform\\\"\\n>\\n <xsl:output method=\\\"html\\\"/>\\n\\n <xsl:template match=\\\"/mult\\\">\\n <table>\\n <tr><td>╭</td><td colspan=\\\"{count(*[2]/*[1]/*)}\\\"/><td>╮</td></tr>\\n <xsl:call-template name=\\\"prodMM\\\">\\n <xsl:with-param name=\\\"A\\\" select=\\\"*[1]/*\\\"/>\\n <xsl:with-param name=\\\"B\\\" select=\\\"*[2]/*\\\"/>\\n </xsl:call-template>\\n <tr><td>╰</td><td colspan=\\\"{count(*[2]/*[1]/*)}\\\"/><td>╯</td></tr>\\n </table>\\n </xsl:template>\\n\\n <xsl:template name=\\\"prodMM\\\">\\n <xsl:param name=\\\"A\\\"/>\\n <xsl:param name=\\\"B\\\"/>\\n\\n <xsl:if test=\\\"$A/*\\\">\\n <tr>\\n <td>│</td>\\n <xsl:call-template name=\\\"prodVM\\\">\\n <xsl:with-param name=\\\"a\\\" select=\\\"$A[1]/*\\\"/>\\n <xsl:with-param name=\\\"B\\\" select=\\\"$B\\\"/>\\n </xsl:call-template>\\n <td>│</td>\\n </tr>\\n\\n <xsl:call-template name=\\\"prodMM\\\">\\n <xsl:with-param name=\\\"A\\\" select=\\\"$A[position()>1]\\\"/>\\n <xsl:with-param name=\\\"B\\\" select=\\\"$B\\\"/>\\n </xsl:call-template>\\n </xsl:if>\\n </xsl:template>\\n\\n <xsl:template name=\\\"prodVM\\\">\\n <xsl:param name=\\\"a\\\"/>\\n <xsl:param name=\\\"B\\\"/>\\n <xsl:param name=\\\"col\\\" select=\\\"1\\\"/>\\n\\n <xsl:if test=\\\"$B/*[$col]\\\">\\n <td align=\\\"right\\\">\\n <xsl:call-template name=\\\"prod\\\">\\n <xsl:with-param name=\\\"a\\\" select=\\\"$a\\\"/>\\n <xsl:with-param name=\\\"b\\\" select=\\\"$B/*[$col]\\\"/>\\n </xsl:call-template>\\n </td>\\n\\n <xsl:call-template name=\\\"prodVM\\\">\\n <xsl:with-param name=\\\"a\\\" select=\\\"$a\\\"/>\\n <xsl:with-param name=\\\"B\\\" select=\\\"$B\\\"/>\\n <xsl:with-param name=\\\"col\\\" select=\\\"$col+1\\\"/>\\n </xsl:call-template>\\n </xsl:if>\\n </xsl:template>\\n\\n <xsl:template name=\\\"prod\\\">\\n <xsl:param name=\\\"a\\\"/>\\n <xsl:param name=\\\"b\\\"/>\\n\\n <xsl:if test=\\\"not($a)\\\">0</xsl:if>\\n\\n <xsl:if test=\\\"$a\\\">\\n <xsl:variable name=\\\"res\\\">\\n <xsl:call-template name=\\\"prod\\\">\\n <xsl:with-param name=\\\"a\\\" select=\\\"$a[position()>1]\\\"/>\\n <xsl:with-param name=\\\"b\\\" select=\\\"$b[position()>1]\\\"/>\\n </xsl:call-template>\\n </xsl:variable>\\n\\n <xsl:value-of select=\\\"$a[1] * $b[1] + $res\\\"/>\\n </xsl:if>\\n </xsl:template>\\n\\n</xsl:stylesheet>\\n\",\n \"language\": \"XSLT-1.0\"\n },\n {\n \"code\": \"dim a(4, 2)\\na(0, 0) = 1 : a(0, 1) = 2\\na(1, 0) = 3 : a(1, 1) = 4\\na(2, 0) = 5 : a(2, 1) = 6\\na(3, 0) = 7 : a(3, 1) = 8\\ndim b(2, 3)\\nb(0, 0) = 1 : b(0, 1) = 2 : b(0, 2) = 3\\nb(1, 0) = 4 : b(1, 1) = 5 : b(1, 2) = 6\\ndim prod(arraysize(a(),1), arraysize(b(),2))\\n\\nif (arraysize(a(),2) = arraysize(b(),1)) then\\n\\tfor i = 0 to arraysize(a(),1)\\n\\t\\tfor j = 0 to arraysize(b(),2)\\n\\t\\t\\tfor k = 0 to arraysize(a(),2)\\n\\t\\t\\t\\tprod(i, j) = prod(i, j) + (a(i, k) * b(k, j))\\n\\t\\t\\tnext k\\n\\t\\tnext j\\n\\tnext i\\n\\n\\tfor i = 0 to arraysize(prod(),1)-1\\n\\t\\tfor j = 0 to arraysize(prod(),2)-1\\n\\t\\t\\tprint prod(i, j),\\n\\t\\tnext j\\n\\t\\tprint\\n\\tnext i\\nelse\\n\\tprint \\\"invalid dimensions\\\"\\nend if\\nend\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"var [const] GSL=Import(\\\"zklGSL\\\");\\t// libGSL (GNU Scientific Library)\\nA:=GSL.Matrix(4,2).set(1,2, 3,4, 5,6, 7,8);\\nB:=GSL.Matrix(2,3).set(1,2,3, 4,5,6);\\n(A*B).format().println(); // creates a new matrix\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn matMult(a,b){\\n n,m,p:=a[0].len(),a.len(),b[0].len();\\n ans:=(0).pump(m,List().write, (0).pump(p,List,0).copy); // matrix of zeros\\n foreach i,j,k in (m,p,n){ ans[i][j]+=a[i][k]*b[k][j]; }\\n ans\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"a:=L( L(1,2,), L(3,4,), L(5,6,), L(7,8) );\\nb:=L( L(1,2,3,), L(4,5,6) );\\nprintM(matMult(a,b));\\n\\nfcn printM(m){ m.pump(Console.println,rowFmt) }\\nfcn rowFmt(row){ (\\\"%4d \\\"*row.len()).fmt(row.xplode()) }\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"module MatrixOps;\\ntype\\n\\tMatrix = array {math} *,* of integer;\\n\\n\\n\\tprocedure WriteMatrix(x: array {math} *,* of integer);\\n\\tvar\\n\\t\\ti,j: integer;\\n\\tbegin\\n\\t\\tfor i := 0 to len(x,0) - 1 do\\n\\t\\t\\tfor j := 0 to len(x,1) - 1 do\\n\\t\\t\\t\\twrite(x[i,j]);\\n\\t\\t\\tend;\\n\\t\\t\\twriteln;\\n\\t\\tend\\t\\n\\tend WriteMatrix;\\n\\n\\tprocedure Multiplication;\\n\\tvar\\n\\t\\ta,b: Matrix;\\n\\tbegin\\n\\t\\ta := [[1,2],[3,4],[5,6],[7,8]];\\n\\t\\tb := [[1,2,3],[4,5,6]];\\n\\t\\tWriteMatrix(a * b);\\n\\tend Multiplication;\\n\\nbegin\\n\\tMultiplication;\\nend MatrixOps.\\n\",\n \"language\": \"Zonnon\"\n },\n {\n \"code\": \"program matmultSUMMA;\\n\\nprototype GetSingleDim(infile:file):integer;\\nprototype GetInnerDim(infile1:file; infile2:file):integer;\\n\\nconfig var\\n Afilename: string = \\\"\\\";\\n Bfilename: string = \\\"\\\";\\n\\n Afile: file = open(Afilename,file_read);\\n Bfile: file = open(Bfilename,file_read);\\n\\n default_size:integer = 4;\\n m:integer = GetSingleDim(Afile);\\n n:integer = GetInnerDim(Afile,Bfile);\\n p:integer = GetSingleDim(Bfile);\\n\\n iters: integer = 1;\\n\\n printinput: boolean = false;\\n verbose: boolean = true;\\n dotiming: boolean = false;\\n\\nregion\\n RA = [1..m,1..n];\\n RB = [1..n,1..p];\\n RC = [1..m,1..p];\\n FCol = [1..m,*];\\n FRow = [*,1..p];\\n\\nvar\\n A : [RA] double;\\n B : [RB] double;\\n C : [RC] double;\\n Aflood : [FCol] double;\\n Bflood : [FRow] double;\\n\\n\\nprocedure ReadA();\\nvar step:double;\\n[RA] begin\\n if (Afile != znull) then\\n read(Afile,A);\\n else\\n step := 1.0/(m*n);\\n A := ((Index1-1)*n + Index2)*step + 1.0;\\n end;\\n end;\\n\\n\\nprocedure ReadB();\\nvar step:double;\\n[RB] begin\\n if (Bfile != znull) then\\n read(Bfile,B);\\n else\\n step := 1.0/(n*p);\\n B := ((Index1-1)*p + Index2)*step + 1.0;\\n end;\\n end;\\n\\n\\nprocedure matmultSUMMA();\\nvar\\n i: integer;\\n it: integer;\\n runtime: double;\\n[RC] begin\\n ReadA();\\n ReadB();\\n\\n if (printinput) then\\n [RA] writeln(\\\"A is:\\\\n\\\",A);\\n [RB] writeln(\\\"B is:\\\\n\\\",B);\\n end;\\n\\n ResetTimer();\\n\\n for it := 1 to iters do\\n\\n C := 0.0; -- zero C\\n\\n for i := 1 to n do\\n [FCol] Aflood := >>[,i] A; -- flood A col\\n [FRow] Bflood := >>[i,] B; -- flood B row\\n\\n C += (Aflood * Bflood); -- multiply\\n end;\\n end;\\n\\n runtime := CheckTimer();\\n\\n if (verbose) then\\n writeln(\\\"C is:\\\\n\\\",C);\\n end;\\n\\n if (dotiming) then\\n writeln(\\\"total runtime = %12.6f\\\":runtime);\\n writeln(\\\"actual runtime = %12.6f\\\":runtime/iters);\\n end;\\n end;\\n\\n\\nprocedure GetSingleDim(infile:file):integer;\\nvar dim:integer;\\nbegin\\n if (infile != znull) then\\n read(infile,dim);\\n else\\n dim := default_size;\\n end;\\n return dim;\\nend;\\n\\n\\nprocedure GetInnerDim(infile1:file; infile2:file):integer;\\nvar\\n col:integer;\\n row:integer;\\n retval:integer;\\nbegin\\n retval := -1;\\n if (infile1 != znull) then\\n read(infile1,col);\\n retval := col;\\n end;\\n if (infile2 != znull) then\\n read(infile2,row);\\n if (retval = -1) then\\n retval := row;\\n else\\n if (row != col) then\\n halt(\\\"ERROR: Inner dimensions don't match\\\");\\n end;\\n end;\\n end;\\n if (retval = -1) then\\n retval := default_size;\\n end;\\n return retval;\\nend;\\n\",\n \"language\": \"ZPL\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Matrix-multiplication"}}},{"rowIdx":472,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Matrix_transposition\nnote: Matrices\n","language":"00-META"},{"code":"[[wp:Transpose|Transpose]] an arbitrarily sized rectangular [[wp:Matrix (mathematics)|Matrix]].\n<br><br>\n","language":"00-TASK"},{"code":"F transpose(&matrix)\n V toRet = [[0] * matrix.len] * matrix[0].len\n L(row) (0 .< matrix.len)\n L(col) (0 .< matrix[row].len)\n toRet[col][row] = matrix[row][col]\n R toRet\n\nV m = [[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12]]\nprint(\"Original\")\nprint(m)\nprint(\"After Transposition\")\nprint(transpose(&m))\n","language":"11l"},{"code":"...\nKN EQU 3\nKM EQU 5\nN DC AL2(KN)\nM DC AL2(KM)\nA DS (KN*KM)F matrix a(n,m)\nB DS (KM*KN)F matrix b(m,n)\n...\n* b(j,i)=a(i,j)\n* transposition using Horner's formula\n LA R4,0 i,from 1\n LA R7,KN to n\n LA R6,1 step 1\nLOOPI BXH R4,R6,ELOOPI do i=1 to n\n LA R5,0 j,from 1\n LA R9,KM to m\n LA R8,1 step 1\nLOOPJ BXH R5,R8,ELOOPJ do j=1 to m\n LR R1,R4 i\n BCTR R1,0 i-1\n MH R1,M (i-1)*m\n LR R2,R5 j\n BCTR R2,0 j-1\n AR R1,R2 r1=(i-1)*m+(j-1)\n SLA R1,2 r1=((i-1)*m+(j-1))*itemlen\n L R0,A(R1) r0=a(i,j)\n LR R1,R5 j\n BCTR R1,0 j-1\n MH R1,N (j-1)*n\n LR R2,R4 i\n BCTR R2,0 i-1\n AR R1,R2 r1=(j-1)*n+(i-1)\n SLA R1,2 r1=((j-1)*n+(i-1))*itemlen\n ST R0,B(R1) b(j,i)=r0\n B LOOPJ next j\nELOOPJ EQU * out of loop j\n B LOOPI next i\nELOOPI EQU * out of loop i\n...\n","language":"360-Assembly"},{"code":"Transpose2DArray_B:\n\t;INPUT:\n\t;A0 = POINTER TO SOURCE ARRAY\n\t;A1 = POINTER TO BACKUP AREA\n\t;\t(YOU NEED THE SAME AMOUNT OF FREE SPACE AS THE SOURCE ARRAY.)\n\t;\t(IT'S YOUR RESPONSIBILITY TO KNOW WHERE THAT IS.)\n\t;D0.W = ARRAY ROW LENGTH-1\n ;D1.W = ARRAY COLUMN HEIGHT-1\n\n\tMOVEM.L D2-D7,-(SP)\n\t\tMOVE.W D0,D4\t;width - this copy is our loop counter\n\n.outerloop:\n\t\tMOVE.W D1,D7\t;height\n\t\tMOVEQ.L #0,D3\n\t\tMOVE.W D0,D6\t;width - this copy is used to offset the array\n\t\tADDQ.L #1,D6\n\n.innerloop:\n\t\tMOVE.B (A0,D3),(A1)+\n\t\tADD.W D6,D3\n\t\tDBRA D7,.innerloop\n\n\t\tADDA.L #1,A0\n\t\tDBRA D4,.outerloop\n\n\tMOVEM.L (SP)+,D2-D7\n\tRTS\n","language":"68000-Assembly"},{"code":"(defun cons-each (xs xss)\n (if (or (endp xs) (endp xss))\n nil\n (cons (cons (first xs) (first xss))\n (cons-each (rest xs) (rest xss)))))\n\n(defun list-each (xs)\n (if (endp xs)\n nil\n (cons (list (first xs))\n (list-each (rest xs)))))\n\n(defun transpose-list (xss)\n (if (endp (rest xss))\n (list-each (first xss))\n (cons-each (first xss)\n (transpose-list (rest xss)))))\n","language":"ACL2"},{"code":"DEFINE PTR=\"CARD\"\n\nTYPE Matrix=[\n BYTE width,height\n PTR data] ;BYTE ARRAY\n\nPROC PrintB2(BYTE b)\n IF b<10 THEN Put(32) FI\n PrintB(b)\nRETURN\n\nPROC PrintMatrix(Matrix POINTER m)\n BYTE i,j\n BYTE ARRAY d\n\n d=m.data\n FOR j=0 TO m.height-1\n DO\n FOR i=0 TO m.width-1\n DO\n PrintB2(d(j*m.width+i)) Put(32)\n OD\n PutE()\n OD\nRETURN\n\nPROC Create(MATRIX POINTER m BYTE w,h BYTE ARRAY a)\n m.width=w\n m.height=h\n m.data=a\nRETURN\n\nPROC Transpose(Matrix POINTER in,out)\n BYTE i,j\n BYTE ARRAY din,dout\n\n din=in.data\n dout=out.data\n out.width=in.height\n out.height=in.width\n FOR j=0 TO in.height-1\n DO\n FOR i=0 TO in.width-1\n DO\n dout(i*out.width+j)=din(j*in.width+i)\n OD\n OD\nRETURN\n\nPROC Main()\n MATRIX in,out\n BYTE ARRAY din(35),dout(35)\n BYTE i\n\n FOR i=0 TO 34\n DO\n din(i)=i\n OD\n Create(in,7,5,din)\n Create(out,0,0,dout)\n Transpose(in,out)\n\n PrintE(\"Input:\")\n PrintMatrix(in)\n PutE() PrintE(\"Transpose:\")\n PrintMatrix(out)\nRETURN\n","language":"Action-"},{"code":"function transpose( m:Array):Array\n{\n\t//Assume each element in m is an array. (If this were production code, use typeof to be sure)\n\n\t//Each element in m is a row, so this gets the length of a row in m,\n\t//which is the same as the number of rows in m transpose.\n\tvar mTranspose = new Array(m[0].length);\n\tfor(var i:uint = 0; i < mTranspose.length; i++)\n\t{\n //create a row\n\t\tmTranspose[i] = new Array(m.length);\n //set the row to the appropriate values\n\t\tfor(var j:uint = 0; j < mTranspose[i].length; j++)\n\t\t\tmTranspose[i][j] = m[j][i];\n\t}\n\treturn mTranspose;\n}\nvar m:Array = [[1, 2, 3, 10],\n\t [4, 5, 6, 11],\n\t [7, 8, 9, 12]];\nvar M:Array = transpose(m);\nfor(var i:uint = 0; i < M.length; i++)\n\ttrace(M[i]);\n","language":"ActionScript"},{"code":"with Ada.Numerics.Real_Arrays; use Ada.Numerics.Real_Arrays;\nwith Ada.Text_IO; use Ada.Text_IO;\n\nprocedure Matrix_Transpose is\n procedure Put (X : Real_Matrix) is\n type Fixed is delta 0.01 range -500.0..500.0;\n begin\n for I in X'Range (1) loop\n for J in X'Range (2) loop\n Put (Fixed'Image (Fixed (X (I, J))));\n end loop;\n New_Line;\n end loop;\n end Put;\n\n Matrix : constant Real_Matrix :=\n ( (0.0, 0.1, 0.2, 0.3),\n (0.4, 0.5, 0.6, 0.7),\n (0.8, 0.9, 1.0, 1.1)\n );\nbegin\n Put_Line (\"Before Transposition:\");\n Put (Matrix);\n New_Line;\n Put_Line (\"After Transposition:\");\n Put (Transpose (Matrix));\nend Matrix_Transpose;\n","language":"Ada"},{"code":"module Matrix where\n\nopen import Data.Nat\nopen import Data.Vec\n\nMatrix : (A : Set) → ℕ → ℕ → Set\nMatrix A m n = Vec (Vec A m) n\n\ntranspose : ∀ {A m n} → Matrix A m n → Matrix A n m\ntranspose [] = replicate []\ntranspose (xs ∷ xss) = zipWith _∷_ xs (transpose xss)\n\na = (1 ∷ 2 ∷ 3 ∷ []) ∷ (4 ∷ 5 ∷ 6 ∷ []) ∷ []\nb = transpose a\n","language":"Agda"},{"code":"(1 ∷ 4 ∷ []) ∷ (2 ∷ 5 ∷ []) ∷ (3 ∷ 6 ∷ []) ∷ []\n","language":"Agda"},{"code":"main:(\n\n [,]REAL m=((1, 1, 1, 1),\n (2, 4, 8, 16),\n (3, 9, 27, 81),\n (4, 16, 64, 256),\n (5, 25,125, 625));\n\n OP ZIP = ([,]REAL in)[,]REAL:(\n [2 LWB in:2 UPB in,1 LWB in:1UPB in]REAL out;\n FOR i FROM LWB in TO UPB in DO\n out[,i]:=in[i,]\n OD;\n out\n );\n\n PROC pprint = ([,]REAL m)VOID:(\n FORMAT real fmt = $g(-6,2)$; # width of 6, with no '+' sign, 2 decimals #\n FORMAT vec fmt = $\"(\"n(2 UPB m-1)(f(real fmt)\",\")f(real fmt)\")\"$;\n FORMAT matrix fmt = $x\"(\"n(UPB m-1)(f(vec fmt)\",\"lxx)f(vec fmt)\");\"$;\n # finally print the result #\n printf((matrix fmt,m))\n );\n\n printf(($x\"Transpose:\"l$));\n pprint((ZIP m))\n)\n","language":"ALGOL-68"},{"code":"#include<hopper.h>\n#proto showarraydata(_X_)\nmain:\n .stack 12\n nCols=0, nRows=0,nDims=0\n A=-1,{5,11} rand array(A),mulby(10),ceil,mov(A)\n {\"ORIGINAL ARRAY :\\n\",A}\n\n _show array data(A)\n\n /* transpose */\n TA=0,{nCols,nRows} nan array(TA)\n Limit = nRows\n {nRows}gthan(nCols) do{ Limit = nCols }\n\n for (i=1, {i} lethan (Limit), ++i)\n [i,i:end]get(A), [i:end,i]put(TA)\n [i:end,i]get(A), [i,i:end]put(TA)\n next\n clear mark\n {\"ARRAY TRANSPOSE:\\n\",TA}println\n _show array data(TA)\nexit(0)\n\n.locals\nshow array data(A)\n {\"\\nSIZE ARRAY : \"},size=0,size(A),cpy(size),\n dims(size,nDims)\n rows(size,nRows)\n cols(size,nCols)\n {\"\\nDIMENSION = \",nDims,\"; ROWS = \",nRows,\"; COLS = \",nCols,\"\\n\"}, println\nback\n","language":"Amazing-Hopper"},{"code":" 3 3⍴⍳10\n1 2 3\n4 5 6\n7 8 9\n ⍉ 3 3⍴⍳10\n1 4 7\n2 5 8\n3 6 9\n","language":"APL"},{"code":"on run\n transpose([[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]])\n\n --> {{1, 4, 7, 10}, {2, 5, 8, 11}, {3, 6, 9, 12}}\nend run\n\non transpose(xss)\n set lstTrans to {}\n\n repeat with iCol from 1 to length of item 1 of xss\n set lstCol to {}\n\n repeat with iRow from 1 to length of xss\n set end of lstCol to item iCol of item iRow of xss\n end repeat\n\n set end of lstTrans to lstCol\n end repeat\n\n return lstTrans\nend transpose\n","language":"AppleScript"},{"code":"------------------------ TRANSPOSE -----------------------\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--------------------------- TEST -------------------------\non run\n transpose([[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]])\n\n --> {{1, 4, 7, 10}, {2, 5, 8, 11}, {3, 6, 9, 12}}\nend run\n\n\n-------------------- GENERIC FUNCTIONS -------------------\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-- 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","language":"AppleScript"},{"code":"{{1, 4, 7, 10}, {2, 5, 8, 11}, {3, 6, 9, 12}}\n","language":"AppleScript"},{"code":"transpose: function [a][\n X: size a\n Y: size first a\n result: array.of: @[Y X] 0\n\n loop 0..X-1 'i [\n loop 0..Y-1 'j [\n result\\[j]\\[i]: a\\[i]\\[j]\n ]\n ]\n return result\n]\n\narr: [\n [ 0 1 2 3 4 ]\n [ 5 6 7 8 9 ]\n [ 1 0 0 0 42 ]\n]\n\nloop arr 'row -> print row\nprint \"-------------\"\nloop transpose arr 'row -> print row\n","language":"Arturo"},{"code":"a = a\nm = 10\nn = 10\nLoop, 10\n{\n i := A_Index - 1\n Loop, 10\n {\n j := A_Index - 1\n %a%%i%%j% := i - j\n }\n}\nbefore := matrix_print(\"a\", m, n)\ntranspose(\"a\", m, n)\nafter := matrix_print(\"a\", m, n)\nMsgBox % before . \"`ntransposed:`n\" . after\nReturn\n\ntranspose(a, m, n)\n{\n Local i, j, row, matrix\n Loop, % m\n {\n i := A_Index - 1\n Loop, % n\n {\n j := A_Index - 1\n temp%i%%j% := %a%%j%%i%\n }\n }\n Loop, % m\n {\n i := A_Index - 1\n Loop, % n\n {\n j := A_Index - 1\n %a%%i%%j% := temp%i%%j%\n }\n }\n}\n\nmatrix_print(a, m, n)\n{\n Local i, j, row, matrix\n Loop, % m\n {\n i := A_Index - 1\n row := \"\"\n Loop, % n\n {\n j := A_Index - 1\n row .= %a%%i%%j% . \",\"\n }\n StringTrimRight, row, row, 1\n matrix .= row . \"`n\"\n }\n Return matrix\n}\n","language":"AutoHotkey"},{"code":"Transpose(M){\n\tR := []\n\tfor i, row in M\n\t\tfor j, col in row\n\t\t\tR[j,i] := col\n\treturn R\n}\n","language":"AutoHotkey"},{"code":"Matrix := [[1,2,3],[4,5,6],[7,8,9],[10,11,12]]\nMsgBox % \t\"\"\n\t\t. \"Original Matrix :`n\" \t\tPrint(Matrix)\n\t\t. \"`nTransposed Matrix :`n\" \tPrint(Transpose(Matrix))\n\nPrint(M){\n\tfor i, row in M\n\t\tfor j, col in row\n\t\t\tRes .= (A_Index=1?\"\":\"`t\") col (Mod(A_Index,M[1].MaxIndex())?\"\":\"`n\")\n\treturn Trim(Res,\"`n\")\n}\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f MATRIX_TRANSPOSITION.AWK filename\n{ if (NF > nf) {\n nf = NF\n }\n for (i=1; i<=nf; i++) {\n row[i] = row[i] $i \" \"\n }\n}\nEND {\n for (i=1; i<=nf; i++) {\n printf(\"%s\\n\",row[i])\n }\n exit(0)\n}\n","language":"AWK"},{"code":"# Usage: GAWK -f MATRIX_TRANSPOSITION.AWK filename\n{\n i = NR\n for (j = 1; j <= NF; j++) {\n a[i,j] = $j\n }\n ranka1 = i\n ranka2 = max(ranka2, NF)\n}\nEND {\n rankb1 = ranka2\n rankb2 = ranka1\n b[rankb1, rankb2] = 0\n transpose_matrix(b, a)\n for (i = 1; i <= rankb1; i++) {\n for (j = 1; j <= rankb2; j++) {\n printf(\"%g%c\", b[i,j], j < rankb2 ? \" \" : \"\\n\");\n }\n }\n}\nfunction transpose_matrix(target, source, key, idx) {\n for (key in source) {\n split(key, idx, SUBSEP)\n target[idx[2], idx[1]] = source[idx[1], idx[2]]\n }\n}\nfunction max(m, n) {\n return m > n ? m : n\n}\n","language":"AWK"},{"code":"arraybase 1\ndim matriz= {{78,19,30,12,36}, {49,10,65,42,50}, {30,93,24,78,10}, {39,68,27,64,29}}\ndim mtranspuesta(matriz[,?], matriz[?,])\n\nfor fila = 1 to matriz[?,]\n for columna = 1 to matriz[,?]\n\t\tprint matriz[fila, columna]; \" \";\n\t\tmtranspuesta[columna, fila] = matriz[fila, columna]\n\tnext columna\n\tprint\nnext fila\nprint\n\nfor fila = 1 to mtranspuesta[?,]\n for columna = 1 to mtranspuesta[,?]\n\t\tprint mtranspuesta[fila, columna]; \" \";\n next columna\n\tprint\nnext fila\nend\n","language":"BASIC256"},{"code":" INSTALL @lib$+\"ARRAYLIB\"\n\n DIM matrix(3,4), transpose(4,3)\n matrix() = 78,19,30,12,36,49,10,65,42,50,30,93,24,78,10,39,68,27,64,29\n\n PROC_transpose(matrix(), transpose())\n\n FOR row% = 0 TO DIM(matrix(),1)\n FOR col% = 0 TO DIM(matrix(),2)\n PRINT ;matrix(row%,col%) \" \";\n NEXT\n PRINT\n NEXT row%\n\n PRINT\n\n FOR row% = 0 TO DIM(transpose(),1)\n FOR col% = 0 TO DIM(transpose(),2)\n PRINT ;transpose(row%,col%) \" \";\n NEXT\n PRINT\n NEXT row%\n","language":"BBC-BASIC"},{"code":" 3‿3⥊↕9\n┌─\n╵ 0 1 2\n 3 4 5\n 6 7 8\n ┘\n ⍉3‿3⥊↕9\n┌─\n╵ 0 3 6\n 1 4 7\n 2 5 8\n ┘\n","language":"BQN"},{"code":"blsq ) {{78 19 30 12 36}{49 10 65 42 50}{30 93 24 78 10}{39 68 27 64 29}}tpsp\n78 49 30 39\n19 10 93 68\n30 65 24 27\n12 42 78 64\n36 50 10 29\n","language":"Burlesque"},{"code":"#include <stdio.h>\n\nvoid transpose(void *dest, void *src, int src_h, int src_w)\n{\n\tint i, j;\n\tdouble (*d)[src_h] = dest, (*s)[src_w] = src;\n\tfor (i = 0; i < src_h; i++)\n\t\tfor (j = 0; j < src_w; j++)\n\t\t\td[j][i] = s[i][j];\n}\n\nint main()\n{\n\tint i, j;\n\tdouble a[3][5] = {{ 0, 1, 2, 3, 4 },\n\t\t\t { 5, 6, 7, 8, 9 },\n\t\t\t { 1, 0, 0, 0, 42}};\n\tdouble b[5][3];\n\ttranspose(b, a, 3, 5);\n\n\tfor (i = 0; i < 5; i++)\n\t\tfor (j = 0; j < 3; j++)\n\t\t\tprintf(\"%g%c\", b[i][j], j == 2 ? '\\n' : ' ');\n\treturn 0;\n}\n","language":"C"},{"code":"#include <stdio.h>\n\nvoid transpose(double *m, int w, int h)\n{\n\tint start, next, i;\n\tdouble tmp;\n\n\tfor (start = 0; start <= w * h - 1; start++) {\n\t\tnext = start;\n\t\ti = 0;\n\t\tdo {\ti++;\n\t\t\tnext = (next % h) * w + next / h;\n\t\t} while (next > start);\n\t\tif (next < start || i == 1) continue;\n\n\t\ttmp = m[next = start];\n\t\tdo {\n\t\t\ti = (next % h) * w + next / h;\n\t\t\tm[next] = (i == start) ? tmp : m[i];\n\t\t\tnext = i;\n\t\t} while (next > start);\n\t}\n}\n\nvoid show_matrix(double *m, int w, int h)\n{\n\tint i, j;\n\tfor (i = 0; i < h; i++) {\n\t\tfor (j = 0; j < w; j++)\n\t\t\tprintf(\"%2g \", m[i * w + j]);\n\t\tputchar('\\n');\n\t}\n}\n\nint main(void)\n{\n\tint i;\n\tdouble m[15];\n\tfor (i = 0; i < 15; i++) m[i] = i + 1;\n\n\tputs(\"before transpose:\");\n\tshow_matrix(m, 3, 5);\n\n\ttranspose(m, 3, 5);\n\n\tputs(\"\\nafter transpose:\");\n\tshow_matrix(m, 5, 3);\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <boost/numeric/ublas/matrix.hpp>\n#include <boost/numeric/ublas/io.hpp>\n\nint main()\n{\n using namespace boost::numeric::ublas;\n\n matrix<double> m(3,3);\n\n for(int i=0; i!=m.size1(); ++i)\n for(int j=0; j!=m.size2(); ++j)\n m(i,j)=3*i+j;\n\n std::cout << trans(m) << std::endl;\n}\n","language":"C++"},{"code":"#include <iostream>\n#include \"matrix.h\"\n\n#if !defined(ARRAY_SIZE)\n #define ARRAY_SIZE(x) (sizeof((x)) / sizeof((x)[0]))\n#endif\n\ntemplate<class T>\nvoid printMatrix(const Matrix<T>& m) {\n std::cout << \"rows = \" << m.rowNum() << \" columns = \" << m.colNum() << std::endl;\n for (unsigned int i = 0; i < m.rowNum(); i++) {\n for (unsigned int j = 0; j < m.colNum(); j++) {\n std::cout << m[i][j] << \" \";\n }\n std::cout << std::endl;\n }\n} /* printMatrix() */\n\nint main() {\n int am[2][3] = {\n {1,2,3},\n {4,5,6},\n };\n\n Matrix<int> a(ARRAY_SIZE(am), ARRAY_SIZE(am[0]), am[0], ARRAY_SIZE(am)*ARRAY_SIZE(am[0]));\n\n try {\n std::cout << \"Before transposition:\" << std::endl;\n printMatrix(a);\n std::cout << std::endl;\n a.transpose();\n std::cout << \"After transposition:\" << std::endl;\n printMatrix(a);\n } catch (MatrixException& e) {\n std::cerr << e.message() << std::endl;\n return e.errorCode();\n }\n\n} /* main() */\n","language":"C++"},{"code":"#ifndef _MATRIX_H\n#define\t_MATRIX_H\n\n#include <sstream>\n#include <string>\n#include <vector>\n#include <algorithm>\n\n#define MATRIX_ERROR_CODE_COUNT 5\n#define MATRIX_ERR_UNDEFINED \"1 Undefined exception!\"\n#define MATRIX_ERR_WRONG_ROW_INDEX \"2 The row index is out of range.\"\n#define MATRIX_ERR_MUL_ROW_AND_COL_NOT_EQUAL \"3 The row number of second matrix must be equal with the column number of first matrix!\"\n#define MATRIX_ERR_MUL_ROW_AND_COL_BE_GREATER_THAN_ZERO \"4 The number of rows and columns must be greater than zero!\"\n#define MATRIX_ERR_TOO_FEW_DATA \"5 Too few data in matrix.\"\n\nclass MatrixException {\nprivate:\n std::string message_;\n int errorCode_;\npublic:\n MatrixException(std::string message = MATRIX_ERR_UNDEFINED);\n\n inline std::string message() {\n return message_;\n };\n\n inline int errorCode() {\n return errorCode_;\n };\n};\n\nMatrixException::MatrixException(std::string message) {\n errorCode_ = MATRIX_ERROR_CODE_COUNT + 1;\n std::stringstream ss(message);\n ss >> errorCode_;\n if (errorCode_ < 1) {\n errorCode_ = MATRIX_ERROR_CODE_COUNT + 1;\n }\n std::string::size_type pos = message.find(' ');\n if (errorCode_ <= MATRIX_ERROR_CODE_COUNT && pos != std::string::npos) {\n message_ = message.substr(pos + 1);\n } else {\n message_ = message + \" (This an unknown and unsupported exception!)\";\n }\n}\n\n/**\n * Generic class for matrices.\n */\ntemplate <class T>\nclass Matrix {\nprivate:\n std::vector<T> v; // the data of matrix\n unsigned int m; // the number of rows\n unsigned int n; // the number of columns\nprotected:\n\n virtual void clear() {\n v.clear();\n m = n = 0;\n }\npublic:\n\n Matrix() {\n clear();\n }\n Matrix(unsigned int, unsigned int, T* = 0, unsigned int = 0);\n Matrix(unsigned int, unsigned int, const std::vector<T>&);\n\n virtual ~Matrix() {\n clear();\n }\n Matrix& operator=(const Matrix&);\n std::vector<T> operator[](unsigned int) const;\n Matrix operator*(const Matrix&);\n void transpose();\n\n inline unsigned int rowNum() const {\n return m;\n }\n\n inline unsigned int colNum() const {\n return n;\n }\n\n inline unsigned int size() const {\n return v.size();\n }\n\n inline void add(const T& t) {\n v.push_back(t);\n }\n};\n\ntemplate <class T>\nMatrix<T>::Matrix(unsigned int row, unsigned int col, T* data, unsigned int dataLength) {\n clear();\n if (row > 0 && col > 0) {\n m = row;\n n = col;\n unsigned int mxn = m * n;\n if (dataLength && data) {\n for (unsigned int i = 0; i < dataLength && i < mxn; i++) {\n v.push_back(data[i]);\n }\n }\n }\n}\n\ntemplate <class T>\nMatrix<T>::Matrix(unsigned int row, unsigned int col, const std::vector<T>& data) {\n clear();\n if (row > 0 && col > 0) {\n m = row;\n n = col;\n unsigned int mxn = m * n;\n if (data.size() > 0) {\n for (unsigned int i = 0; i < mxn && i < data.size(); i++) {\n v.push_back(data[i]);\n }\n }\n }\n}\n\ntemplate<class T>\nMatrix<T>& Matrix<T>::operator=(const Matrix<T>& other) {\n clear();\n if (other.m > 0 && other.n > 0) {\n m = other.m;\n n = other.n;\n unsigned int mxn = m * n;\n for (unsigned int i = 0; i < mxn && i < other.size(); i++) {\n v.push_back(other.v[i]);\n }\n }\n return *this;\n}\n\ntemplate<class T>\nstd::vector<T> Matrix<T>::operator[](unsigned int index) const {\n std::vector<T> result;\n if (index >= m) {\n throw MatrixException(MATRIX_ERR_WRONG_ROW_INDEX);\n } else if ((index + 1) * n > size()) {\n throw MatrixException(MATRIX_ERR_TOO_FEW_DATA);\n } else {\n unsigned int begin = index * n;\n unsigned int end = begin + n;\n for (unsigned int i = begin; i < end; i++) {\n result.push_back(v[i]);\n }\n }\n return result;\n}\n\ntemplate<class T>\nMatrix<T> Matrix<T>::operator*(const Matrix<T>& other) {\n Matrix result(m, other.n);\n if (n != other.m) {\n throw MatrixException(MATRIX_ERR_MUL_ROW_AND_COL_NOT_EQUAL);\n } else if (m <= 0 || n <= 0 || other.n <= 0) {\n throw MatrixException(MATRIX_ERR_MUL_ROW_AND_COL_BE_GREATER_THAN_ZERO);\n } else if (m * n > size() || other.m * other.n > other.size()) {\n throw MatrixException(MATRIX_ERR_TOO_FEW_DATA);\n } else {\n for (unsigned int i = 0; i < m; i++) {\n for (unsigned int j = 0; j < other.n; j++) {\n T temp = v[i * n] * other.v[j];\n for (unsigned int k = 1; k < n; k++) {\n temp += v[i * n + k] * other.v[k * other.n + j];\n }\n result.v.push_back(temp);\n }\n }\n }\n return result;\n}\n\ntemplate<class T>\nvoid Matrix<T>::transpose() {\n if (m * n > size()) {\n throw MatrixException(MATRIX_ERR_TOO_FEW_DATA);\n } else {\n std::vector<T> v2;\n std::swap(v, v2);\n for (unsigned int i = 0; i < n; i++) {\n for (unsigned int j = 0; j < m; j++) {\n v.push_back(v2[j * n + i]);\n }\n }\n std::swap(m, n);\n }\n}\n\n#endif\t/* _MATRIX_H */\n","language":"C++"},{"code":"#include <iostream>\n\nint main(){\n const int l = 5;\n const int w = 3;\n int m1[l][w] = {{1,2,3}, {4,5,6}, {7,8,9}, {10,11,12}, {13,14,15}};\n int m2[w][l];\n\n for(int i=0; i<w; i++){\n for(int x=0; x<l; x++){\n m2[i][x]=m1[x][i];\n }\n }\n\n // This is just output...\n\n std::cout << \"Before:\";\n for(int i=0; i<l; i++){\n std::cout << std::endl;\n for(int x=0; x<w; x++){\n std::cout << m1[i][x] << \" \";\n }\n }\n\n std::cout << \"\\n\\nAfter:\";\n for(int i=0; i<w; i++){\n std::cout << std::endl;\n for(int x=0; x<l; x++){\n std::cout << m2[i][x] << \" \";\n }\n }\n\n std::cout << std::endl;\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Text;\n\nnamespace prog\n{\n\tclass MainClass\n\t{\t\t\t\t\t\t\n\t\tpublic static void Main (string[] args)\n\t\t{\n\t\t\tdouble[,] m = { {1,2,3},{4,5,6},{7,8,9} };\n\t\t\t\n\t\t\tdouble[,] t = Transpose( m );\t\n\t\t\t\n\t\t\tfor( int i=0; i<t.GetLength(0); i++ )\n\t\t\t{\n\t\t\t\tfor( int j=0; j<t.GetLength(1); j++ )\t\t\n\t\t\t\t\tConsole.Write( t[i,j] + \" \" );\n\t\t\t\tConsole.WriteLine(\"\");\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic static double[,] Transpose( double[,] m )\n\t\t{\n\t\t\tdouble[,] t = new double[m.GetLength(1),m.GetLength(0)];\n\t\t\tfor( int i=0; i<m.GetLength(0); i++ )\n\t\t\t\tfor( int j=0; j<m.GetLength(1); j++ )\n\t\t\t\t\tt[j,i] = m[i,j];\t\t\t\n\t\t\t\n\t\t\treturn t;\n\t\t}\n\t}\n}\n","language":"C-sharp"},{"code":"(defmulti matrix-transpose\n \"Switch rows with columns.\"\n class)\n\n(defmethod matrix-transpose clojure.lang.PersistentList\n [mtx]\n (apply map list mtx))\n\n(defmethod matrix-transpose clojure.lang.PersistentVector\n [mtx]\n (apply mapv vector mtx))\n","language":"Clojure"},{"code":"transpose = (matrix) ->\n (t[i] for t in matrix) for i in [0...matrix[0].length]\n","language":"CoffeeScript"},{"code":"(defun transpose (m)\n (apply #'mapcar #'list m))\n","language":"Common-Lisp"},{"code":";; Transpose a mxn matrix A to a nxm matrix B=A'.\n(defun mtp (A)\n (let* ((m (array-dimension A 0))\n (n (array-dimension A 1))\n (B (make-array `(,n ,m) :initial-element 0)))\n (loop for i from 0 below m do\n (loop for j from 0 below n do\n (setf (aref B j i)\n (aref A i j))))\n B))\n","language":"Common-Lisp"},{"code":"void main() {\n import std.stdio, std.range;\n\n /*immutable*/ auto M = [[10, 11, 12, 13],\n [14, 15, 16, 17],\n [18, 19, 20, 21]];\n writefln(\"%(%(%2d %)\\n%)\", M.transposed);\n}\n","language":"D"},{"code":"T[][] transpose(T)(in T[][] m) pure nothrow {\n auto r = new typeof(return)(m[0].length, m.length);\n foreach (immutable nr, const row; m)\n foreach (immutable nc, immutable c; row)\n r[nc][nr] = c;\n return r;\n}\n\nvoid main() {\n import std.stdio;\n\n immutable M = [[10, 11, 12, 13],\n [14, 15, 16, 17],\n [18, 19, 20, 21]];\n writefln(\"%(%(%2d %)\\n%)\", M.transpose);\n}\n","language":"D"},{"code":"import std.stdio, std.algorithm, std.range, std.functional;\n\nauto transpose(T)(in T[][] m) pure nothrow {\n return m[0].length.iota.map!(curry!(transversal, m));\n}\n\nvoid main() {\n immutable M = [[10, 11, 12, 13],\n [14, 15, 16, 17],\n [18, 19, 20, 21]];\n writefln(\"%(%(%2d %)\\n%)\", M.transpose);\n}\n","language":"D"},{"code":"proc transpose . m[][] .\n len n[][] len m[1][]\n for i to len n[][]\n for j to len m[][]\n n[i][] &= m[j][i]\n .\n .\n swap n[][] m[][]\n.\nm[][] = [ [ 1 2 3 4 ] [ 5 6 7 8 ] [ 9 10 11 12 ] ]\nprint m[][]\nprint \"\"\ntranspose m[][]\nprint m[][]\n","language":"EasyLang"},{"code":"(lib 'matrix)\n\n(define M (list->array (iota 6) 3 2))\n(array-print M)\n 0 1\n 2 3\n 4 5\n(array-print (matrix-transpose M))\n 0 2 4\n 1 3 5\n","language":"EchoLisp"},{"code":" [Demo of matrix transposition. Not in place, creates a new matrix.\n EDSAC, Initial Orders 2.]\n ..PZ [blank tape and terminator]\n T 50 K [to call matrix transpose subroutine with 'G X']\n P 200 F [address of matrix transpose subroutine]\n T 47 K [to call matrix print subroutine with 'G M']\n P 100 F [address of matrix print subroutine]\n T 46 K [to call print subroutine with 'G N']\n P 56 F [address of print subroutine (EDSAC library P1)]\n\n [Subroutine to transpose a matrix of 17-bit real numbers, not in place.\n Caller must ensure original and transpose don't overlap.\n Parameters, all in the address field (i.e. denote n by P n F)\n 10F = width (number of columns)\n 11F = height (number of rows)\n 12F = start address of input matrix\n 13F = start address of output matrix]\n E25K TX GK\n\n [The subroutine loads elements by working down each column in turn.\n Elements are stored at consecutive locations in the transposed matrix.]\n A3F T31@ [set up return to caller]\n A13F A33@ T14@ [initialize T order for storing transpose]\n A12F A32@ U13@ [initialize A order for loading original]\n T36@ [also save as A order for top of current column]\n S10 F [negative of width]\n [10] T35@ [initialize negative counter]\n S11 F [negative of height]\n [12] T34@ [initialize negative counter]\n [13] AF [maunfactured order; load matrix element]\n [14] TF [maunfactured order; store matrix element]\n A14@ A2F T14@ [update address in T order]\n A13@ A10F T13@ [update address in A order]\n A34@ A2F G12@ [inner loop till finished this column]\n A36@ A2F U36@ T13@ [update address for start of column]\n A35@ A2F G10@ [outer loop till finished all columns]\n [31] ZF [exit]\n [32] AF [added to an address to make A order for that address]\n [33] TF [added to an address to make T order for that address]\n [34] PF [negative counter for rows]\n [35] PF [negative counter for columns]\n [36] AF [load order for first element in current column]\n\n [Subroutine to print a matrix of 17-bit real numbers.\n Straightforward, so given in condensed form.\n Parameters (in the address field, i.e. pass n as PnF):\n 10F = width (number of columns)\n 11F = height (number of rows)\n 12F = start address of matrix\n 13F = number of decimals]\n E25K TM\n GKA3FT30@A13FT18@A12FA31@T14@S11FT36@S10FT37@O34@O35@TDAFT1FA16@\n GN [call library subroutine P1]\n PFA14@A2FT14@A37@A2FG10@O32@O33@A36@A2FG8@ZFAF@F&F!FMFPFPF\n\n [Library subroutine P1.\n Prints number in 0D to n places of decimals, where\n n is specified by 'P n F' pseudo-order after subroutine call.]\n E25K TN\n GKA18@U17@S20@T5@H19@PFT5@VDUFOFFFSFL4FTDA5@A2FG6@EFU3FJFM1F\n\n [Main routine]\n PK T300K GK\n [Constants]\n [0] #F [figures shift on teleprinter]\n [1] @F [carriage return]\n [2] &F [line feed]\n [3] P3F [number of columns (in address field)]\n [4] P5F [number of rows (in address field)]\n [5] P400F [address of matrix]\n [6] P500F [address of transposed matrix]\n [7] P2F [number of decimals when printing matrix]\n [8] TF [add to address to make T order]\n [9] P328F [0.0100097...., matrix elements are multiples of this]\n [Variables]\n [10] PF [matrix element, initialized to 0.00]\n [11] PF [negative counter]\n\n [Enter with acc = 0]\n [12] O@ [set figures mode on teleprinter]\n A5@ [address of matrix]\n A8@ [make T order to store first elememt]\n T24@ [plant in code]\n H4@ N3@ L64F L32F [acc := negative number of entries]\n [20] T11@ [initialize negative counter]\n A10@ A9@ U10@ [increment matrix element]\n [24] TF [store in matrix]\n A24@ A2F T24@ [inc store address]\n A11@ A2F G20@ [inc negative counter, loop till zero]\n\n [Matrix is set up, now print it]\n A3@ T10F [10F := width]\n A4@ T11F [11F := height]\n A5@ T12F [12F := address of matrix]\n A7@ T13F [13F := number of decimals]\n [39] A39@ GM [call print subroutine]\n O1@ O2@ [add CR LF]\n\n [Transpose matrix: 10F, 11F, 12F stay the same]\n A6@ T13F [13F := address of transpose]\n [45] A45@ GX [call transpose routine]\n\n [Print transpose]\n A10F TF A11F T10F AF T11F [swap width and height]\n A13F T12F [12F := address of transpose]\n A7@ T13F [13F := number of decimals]\n [57] A57@ GM [call print subroutine]\n\n O@ [figures mode, dummy to flush teleprinter buffer]\n ZF [stop]\n E12Z [enter at 12 (relative)]\n PF [accumulator = 0 on entry]\n","language":"EDSAC-order-code"},{"code":"[Transpose a matrix in place. EDSAC, Initial Orders 2.]\n ..PZ [blank tape and terminator]\n T50K [to call matrix transpose with 'G X']\n P160F [address of matrix transpose subroutine]\n T47K [to call matrix print subroutine with 'G M']\n P120F [address of matrix print subroutine]\n T46K [to call print subroutine with 'G N']\n P56F [address of print subroutine (P1 in EDSAC library)]\n T48K [to call division subroutine with 'G &']\n P77F [address of division subroutine]\n\n [Subroutine to transpose a matrix of 17-bit values in place.\n Translated and slightly modified from C version on Rosetta Code website.\n Parameters, all in the address field (i.e. n is stored as P n F):\n 10F = width (number of columns, \"w\" in C program)\n 11F = height (number of rows, \"h\" in C program)\n 12F = start address of matrix]\n E25K TX GK\n A3F T64@ [set up return to caller]\n H10F V11F L32F L64F [acc := size of matrix as width*height]\n T84@ T85@ [store size; C variable start := 0]\n [8] TF A85@ T86@ T87@ [set C variables, next := start, i := 0]\n [12] TF A87@ A2F T87@ [i++]\n A16@ G65@ [call subroutine to update \"next\"]\n A85@ S86@ G12@ [acc := start - next, loop back if < 0]\n [Skip to location 58 if acc > 0 or i = 1.\n We already know that acc >= 0 and i > 0.]\n S2F E58@ [subtract 1 from acc, skip if still >= 0]\n S2F A87@ G58@ [acc := -2 + i, skip if < 0]\n [The assignment next := start in the C program is unnecessary]\n TF A86@ A12F A81@ T31@ [make and plant order to load m{next}]\n [31] AF T83@ [tmp := m{next}]\n [33] TF [clear acc; also added to an address to make T order for that address]\n [34] A86@ A12F A33@ T54@ [make and plant order to store m{next}]\n A38@ G65@ [call subroutine to update \"next\"]\n A86@ S85@ G48@ [go to 48 if i < start]\n S2F E48@ [go to 48 if i > start]\n TF A82@ G52@ [make order to load tmp, and go to 52]\n [48] TF A86@ A12F A81@ [make order to load m{next}]\n [52] T53@ [plant order to load tmp or m{next}]\n [53] AF [manufactured order; if i = start loads tmp, else loads m{next}]\n [54] TF [manufactured order; stores m{next}, using old value of \"next\"]\n A85@ S86@ G33@ [acc := start - next, loop back if < 0]\n [58] TF A85@ A2F U85@ [start++]\n S84@ G8@ [loop until start = size]\n [64] ZF [overwritten by return to caller]\n [Subroutine to execute next = (next % h) * w + next / h in C program]\n [65] A3F T80@ [set up return to caller]\n A86@ T4F A11F T5F [set up parameters to divide \"next\" by \"h\"]\n A71@ G& [call division subroutine]\n [In case anybody is following this in detail, note that \"next\" and \"h\" are\n stored in the address field, so we need to shift the quotient 1 left]\n H4F V10F L64F L16F A5F LD T86@ [compute RHS and store in \"next\"]\n [80] ZF [overwritten by return to caller]\n [Constants]\n [81] AF [added to an address to make A order for that address]\n [82] A83@ [order to load C variable \"tmp\"]\n [Variables; integers are stored in the address field for convenience.]\n [83] PF [C variable \"tmp\" (holds value of a matrix element)]\n [84] PF [size of matrix, width*height]\n [85] PF [C variable \"start\"]\n [86] PF [C variable \"next\"]\n [87] PF [C variable \"i\"]\n\n [Subroutine to print a matrix of 17-bit real numbers.]\n E25K TM\n GKA3FT30@A13FT18@A12FA31@T14@S11FT36@S10FT37@O34@O35@TDAFT1FA16@\n GN\n PFA14@A2FT14@A37@A2FG10@O32@O33@A36@A2FG8@ZFAF@F&F!FMFPFPF\n\n [Library subroutine P1.\n Prints positive number in 0D to n places of decimals, where\n n is specified by 'P n F' pseudo-order after subroutine call.]\n E25K TN\n GKA18@U17@S20@T5@H19@PFT5@VDUFOFFFSFL4FTDA5@A2FG6@EFU3FJFM1F\n\n [Integer division: number at 4F, divisor at 5F\n Returns remainder at 4F, quotient at 5F\n Working location 0D. 37 locations.]\n E25K T&\n GKA3FT34@A5FUFT35@A4FRDS35@G13@T1FA35@LDE4@T1FT5FA4FS35@G22@\n T4FA5FA36@T5FT1FAFS35@E34@T1FA35@RDT35@A5FLDT5FE15@EFPFPD\n\n [Main routine]\n [Given in condensed form, since it's the same as in part 1, except\n that the address of the transposed matrix is not required.]\n PKT250KGK#F@F&FP7FP4FP320FP2FTFP328FPFPFO@A5@A7@T23@H4@N3@L64FL32F\n T10@A9@A8@U9@TFA23@A2FT23@A10@A2FG19@A3@T10FA4@T11FA5@T12FA6@T13F\n A38@GMO1@O2@A42@GXA10FTFA11FT10FAFT11FA50@GMO@ZFE11ZPF\n","language":"EDSAC-order-code"},{"code":"m = [[1, 1, 1, 1],\n [2, 4, 8, 16],\n [3, 9, 27, 81],\n [4, 16, 64, 256],\n [5, 25,125, 625]]\n\ntranspose = fn(m)-> List.zip(m) |> Enum.map(&Tuple.to_list(&1)) end\n\nIO.inspect transpose.(m)\n","language":"Elixir"},{"code":"MAC TRANSPOSE = ([INT n][INT m]TYPE t: matrix) -> [m][n]t:\n [INT i = 1..m] [INT j = 1..n] matrix[j][i].\n","language":"ELLA"},{"code":"(require 'cl-lib)\n\n(defun transpose (m)\n (apply #'cl-mapcar #'list m))\n\n;;test for transposition function\n(transpose '((2 3 4 5) (3 5 6 9) (9 9 9 9)))\n","language":"Emacs-Lisp"},{"code":"(defun matrix-transposition (m)\n (apply #'seq-mapn (append (list #'list) m)) )\n\n(let ((m '(( 2 0 -5 -1)\n\t (-3 -2 -4 7)\n\t (-1 -3 0 -6))))\n (message \"%s\" (matrix-transposition m)) )\n","language":"Emacs-Lisp"},{"code":"-module(transmatrix).\n-export([trans/1,transL/1]).\n\n% using built-ins hd = head, tl = tail\n\ntrans([[]|_]) -> [];\ntrans(M) ->\n [ lists:map(fun hd/1, M) | transpose( lists:map(fun tl/1, M) ) ].\n\n% Purist version\n\ntransL( [ [Elem | Rest] | List] ) ->\n [ [Elem | [H || [H | _] <- List] ] |\n transL( [Rest |\n [ T || [_ | T] <- List ] ]\n ) ];\ntransL([ [] | List] ) -> transL(List);\ntransL([]) -> [].\n","language":"Erlang"},{"code":"function transpose(sequence in)\n sequence out\n out = repeat(repeat(0,length(in)),length(in[1]))\n for n = 1 to length(in) do\n for m = 1 to length(in[1]) do\n out[m][n] = in[n][m]\n end for\n end for\n return out\nend function\n\nsequence m\nm = {\n {1,2,3,4},\n {5,6,7,8},\n {9,10,11,12}\n}\n\n? transpose(m)\n","language":"Euphoria"},{"code":"let transpose (mtx : _ [,]) = Array2D.init (mtx.GetLength 1) (mtx.GetLength 0) (fun x y -> mtx.[y,x])\n","language":"F-Sharp"},{"code":"( scratchpad ) { { 1 2 3 } { 4 5 6 } } flip .\n { { 1 4 } { 2 5 } { 3 6 } }\n","language":"Factor"},{"code":"Array a[3,1]\n[a]:=[(1,2,3)]\n[b]:=Trans([a])\n[a]\n[b]\n","language":"Fermat"},{"code":"S\" fsl-util.fs\" REQUIRED\nS\" fsl/dynmem.seq\" REQUIRED\n: F+! ( addr -- ) ( F: r -- ) DUP F@ F+ F! ;\n: FSQR ( F: r1 -- r2 ) FDUP F* ;\nS\" fsl/gaussj.seq\" REQUIRED\n\n5 3 float matrix a{{\n1e 2e 3e 4e 5e 6e 7e 8e 9e 10e 11e 12e 13e 14e 15e 5 3 a{{ }}fput\nfloat dmatrix b{{\n\na{{ 5 3 & b{{ transpose\n3 5 b{{ }}fprint\n","language":"Forth"},{"code":"integer, parameter :: n = 3, m = 5\nreal, dimension(n,m) :: a = reshape( (/ (i,i=1,n*m) /), (/ n, m /) )\nreal, dimension(m,n) :: b\n\nb = transpose(a)\n\ndo i = 1, n\n print *, a(i,:)\nend do\n\ndo j = 1, m\n print *, b(j,:)\nend do\n","language":"Fortran"},{"code":"REAL A(3,5), B(5,3)\nDATA ((A(I,J),I=1,3),J=1,5) /1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15/\n\nDO I = 1, 3\n DO J = 1, 5\n B(J,I) = A(I,J)\n END DO\nEND DO\n","language":"Fortran"},{"code":" REAL A(3,5), B(5,3)\n DATA ((A(I,J),I=1,3),J=1,5) /1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15/\n\n DO 10 I = 1, 3\n DO 20 J = 1, 5\n B(J,I) = A(I,J)\n20 CONTINUE\n10 CONTINUE\n","language":"Fortran"},{"code":" DIMENSION A(3,5),B(5,3),C(5,3)\n EQUIVALENCE (A,C)\t!Occupy the same storage.\n DATA A/\n 1 1, 2, 3, 4, 5,\n 2 6, 7, 8, 9,10,\n 3 11,12,13,14,15/\t!Supplies values in storage order.\n\n WRITE (6,*) \"Three rows of five values:\"\n WRITE (6,1) A\t!This shows values in storage order.\n WRITE (6,*) \"...written as C(row,column):\"\n WRITE (6,2) ((C(I,J),J = 1,3),I = 1,5)\n WRITE (6,*) \"... written as A(row,column):\"\n WRITE (6,1) ((A(I,J),J = 1,5),I = 1,3)\n\n WRITE (6,*)\n WRITE (6,*) \"B = Transpose(A)\"\n DO 10 I = 1,3\n DO 10 J = 1,5\n 10 B(J,I) = A(I,J)\n\n WRITE (6,*) \"Five rows of three values:\"\n WRITE (6,2) B\n WRITE (6,*) \"... written as B(row,column):\"\n WRITE (6,2) ((B(I,J),J = 1,3),I = 1,5)\n\n 1 FORMAT (5F6.1)\t!Five values per line.\n 2 FORMAT (3F6.1)\t!Three values per line.\n END\n","language":"Fortran"},{"code":"Dim matriz(0 To 3, 0 To 4) As Integer = {{78,19,30,12,36},_\n{49,10,65,42,50},_\n{30,93,24,78,10},_\n{39,68,27,64,29}}\nDim As Integer mtranspuesta(Lbound(matriz, 2) To Ubound(matriz, 2), Lbound(matriz, 1) To Ubound(matriz, 1))\nDim As Integer fila, columna\n\nFor fila = Lbound(matriz,1) To Ubound(matriz,1)\n For columna = Lbound(matriz,2) To Ubound(matriz,2)\n mtranspuesta(columna, fila) = matriz(fila, columna)\n Print ; matriz(fila,columna); \" \";\n Next columna\n Print\nNext fila\nPrint\n\nFor fila = Lbound(mtranspuesta,1) To Ubound(mtranspuesta,1)\n For columna = Lbound(mtranspuesta,2) To Ubound(mtranspuesta,2)\n Print ; mtranspuesta(fila,columna); \" \";\n Next columna\n Print\nNext fila\nSleep\n","language":"FreeBASIC"},{"code":"a = [[1,2,3],\n [4,5,6],\n [7,8,9]]\njoinln[a.transpose[]]\n","language":"Frink"},{"code":"originalMatrix := [[1, 1, 1, 1],\n [2, 4, 8, 16],\n [3, 9, 27, 81],\n [4, 16, 64, 256],\n [5, 25, 125, 625]];\ntransposedMatrix := TransposedMat(originalMatrix);\n","language":"GAP"},{"code":"package main\n\nimport (\n \"fmt\"\n\n \"gonum.org/v1/gonum/mat\"\n)\n\nfunc main() {\n m := mat.NewDense(2, 3, []float64{\n 1, 2, 3,\n 4, 5, 6,\n })\n fmt.Println(mat.Formatted(m))\n fmt.Println()\n fmt.Println(mat.Formatted(m.T()))\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n\n mat \"github.com/skelterjohn/go.matrix\"\n)\n\nfunc main() {\n m := mat.MakeDenseMatrixStacked([][]float64{\n {1, 2, 3},\n {4, 5, 6},\n })\n fmt.Println(\"original:\")\n fmt.Println(m)\n m = m.Transpose()\n fmt.Println(\"transpose:\")\n fmt.Println(m)\n}\n","language":"Go"},{"code":"package main\n\nimport \"fmt\"\n\ntype row []float64\ntype matrix []row\n\nfunc main() {\n m := matrix{\n {1, 2, 3},\n {4, 5, 6},\n }\n printMatrix(m)\n t := transpose(m)\n printMatrix(t)\n}\n\nfunc printMatrix(m matrix) {\n for _, s := range m {\n fmt.Println(s)\n }\n}\n\nfunc transpose(m matrix) matrix {\n r := make(matrix, len(m[0]))\n for x, _ := range r {\n r[x] = make(row, len(m))\n }\n for y, s := range m {\n for x, e := range s {\n r[x][y] = e\n }\n }\n return r\n}\n","language":"Go"},{"code":"package main\n\nimport \"fmt\"\n\ntype matrix struct {\n ele []float64\n stride int\n}\n\n// construct new matrix from slice of slices\nfunc matrixFromRows(rows [][]float64) *matrix {\n if len(rows) == 0 {\n return &matrix{nil, 0}\n }\n m := &matrix{make([]float64, len(rows)*len(rows[0])), len(rows[0])}\n for rx, row := range rows {\n copy(m.ele[rx*m.stride:(rx+1)*m.stride], row)\n }\n return m\n}\n\nfunc main() {\n m := matrixFromRows([][]float64{\n {1, 2, 3},\n {4, 5, 6},\n })\n m.print(\"original:\")\n m.transpose().print(\"transpose:\")\n}\n\nfunc (m *matrix) print(heading string) {\n if heading > \"\" {\n fmt.Print(\"\\n\", heading, \"\\n\")\n }\n for e := 0; e < len(m.ele); e += m.stride {\n fmt.Println(m.ele[e : e+m.stride])\n }\n}\n\nfunc (m *matrix) transpose() *matrix {\n r := &matrix{make([]float64, len(m.ele)), len(m.ele) / m.stride}\n rx := 0\n for _, e := range m.ele {\n r.ele[rx] = e\n rx += r.stride\n if rx >= len(r.ele) {\n rx -= len(r.ele) - 1\n }\n }\n return r\n}\n","language":"Go"},{"code":"package main\n\nimport \"fmt\"\n\ntype matrix struct {\n stride int\n ele []float64\n}\n\nfunc main() {\n m := matrix{3, []float64{\n 1, 2, 3,\n 4, 5, 6,\n }}\n m.print(\"original:\")\n m.transposeInPlace()\n m.print(\"transpose:\")\n}\n\nfunc (m *matrix) print(heading string) {\n if heading > \"\" {\n fmt.Print(\"\\n\", heading, \"\\n\")\n }\n for e := 0; e < len(m.ele); e += m.stride {\n fmt.Println(m.ele[e : e+m.stride])\n }\n}\n\nfunc (m *matrix) transposeInPlace() {\n h := len(m.ele) / m.stride\n for start := range m.ele {\n next := start\n i := 0\n for {\n i++\n next = (next%h)*m.stride + next/h\n if next <= start {\n break\n }\n }\n if next < start || i == 1 {\n continue\n }\n\n next = start\n tmp := m.ele[next]\n for {\n i = (next%h)*m.stride + next/h\n if i == start {\n m.ele[next] = tmp\n } else {\n m.ele[next] = m.ele[i]\n }\n next = i\n if next <= start {\n break\n }\n }\n }\n m.stride = h\n}\n","language":"Go"},{"code":"def matrix = [ [ 1, 2, 3, 4 ],\n [ 5, 6, 7, 8 ] ]\n\nmatrix.each { println it }\nprintln()\ndef transpose = matrix.transpose()\n\ntranspose.each { println it }\n","language":"Groovy"},{"code":"*Main> transpose [[1,2],[3,4],[5,6]]\n[[1,3,5],[2,4,6]]\n","language":"Haskell"},{"code":"import Data.Array\n\nswap (x,y) = (y,x)\n\ntranspArray :: (Ix a, Ix b) => Array (a,b) e -> Array (b,a) e\ntranspArray a = ixmap (swap l, swap u) swap a where\n (l,u) = bounds a\n","language":"Haskell"},{"code":"tpose [ms] = [[m] | m <- ms]\ntpose (ms:mss) = zipWith (:) ms (tpose mss)\n","language":"Haskell"},{"code":"import Data.Matrix\n\nmain :: IO ()\nmain = print matrix >> print (transpose matrix)\n where\n matrix = fromList 3 4 [1 ..]\n","language":"Haskell"},{"code":"import Numeric.LinearAlgebra\n\na :: Matrix I\na = (3><2)\n [1,2\n ,3,4\n ,5,6]\n\nmain = do\n print $ a\n print $ tr a\n","language":"Haskell"},{"code":"class Matrix {\n static function main() {\n var m = [ [1, 1, 1, 1],\n [2, 4, 8, 16],\n [3, 9, 27, 81],\n [4, 16, 64, 256],\n [5, 25, 125, 625] ];\n var t = [ for (i in 0...m[0].length)\n [ for (j in 0...m.length) 0 ] ];\n for(i in 0...m.length)\n for(j in 0...m[0].length)\n t[j][i] = m[i][j];\n\n for(aa in [m, t])\n for(a in aa) Sys.println(a);\n }\n}\n","language":"Haxe"},{"code":"REAL :: mtx(2, 4)\n\nmtx = 1.1 * $\nWRITE() mtx\n\nSOLVE(Matrix=mtx, Transpose=mtx)\nWRITE() mtx\n","language":"HicEst"},{"code":"uses lists;\ndec transpose : list (list alpha) -> list (list alpha);\n--- transpose ([]::_) <= [];\n--- transpose n <= map head n :: transpose (map tail n);\n","language":"Hope"},{"code":"procedure transpose_matrix (matrix)\n result := []\n # for each column\n every (i := 1 to *matrix[1]) do {\n col := []\n # extract the number in each row for that column\n every (row := !matrix) do put (col, row[i])\n # and push that column as a row in the result matrix\n put (result, col)\n }\n return result\nend\n\nprocedure print_matrix (matrix)\n every (row := !matrix) do {\n every writes (!row || \" \")\n write ()\n }\nend\n\nprocedure main ()\n matrix := [[1,2,3],[4,5,6]]\n write (\"Start:\")\n print_matrix (matrix)\n transposed := transpose_matrix (matrix)\n write (\"Transposed:\")\n print_matrix (transposed)\nend\n","language":"Icon"},{"code":"m=[[1,1,1,1],[2, 4, 8, 16],[3, 9,27, 81],[5, 25,125, 625]]\nprint,transpose(m)\n","language":"IDL"},{"code":"Idris> transpose [[1,2],[3,4],[5,6]]\n[[1, 3, 5], [2, 4, 6]] : List (List Integer)\n","language":"Idris"},{"code":"(var transpose2d @(... map vec))\n\n(transpose2d [[1 1 1 1] [2 4 8 16] [3 9 27 81] [4 16 64 256] [5 25 125 625]])\n","language":"Idris"},{"code":" ]matrix=: (^/ }:) >:i.5 NB. make and show example matrix\n1 1 1 1\n2 4 8 16\n3 9 27 81\n4 16 64 256\n5 25 125 625\n |: matrix\n1 2 3 4 5\n1 4 9 16 25\n1 8 27 64 125\n1 16 81 256 625\n","language":"J"},{"code":"import java.util.Arrays;\npublic class Transpose{\n public static void main(String[] args){\n double[][] m = {{1, 1, 1, 1},\n {2, 4, 8, 16},\n {3, 9, 27, 81},\n {4, 16, 64, 256},\n {5, 25, 125, 625}};\n double[][] ans = new double[m[0].length][m.length];\n for(int rows = 0; rows < m.length; rows++){\n for(int cols = 0; cols < m[0].length; cols++){\n ans[cols][rows] = m[rows][cols];\n }\n }\n for(double[] i:ans){//2D arrays are arrays of arrays\n System.out.println(Arrays.toString(i));\n }\n }\n}\n","language":"Java"},{"code":"function Matrix(ary) {\n this.mtx = ary\n this.height = ary.length;\n this.width = ary[0].length;\n}\n\nMatrix.prototype.toString = function() {\n var s = []\n for (var i = 0; i < this.mtx.length; i++)\n s.push( this.mtx[i].join(\",\") );\n return s.join(\"\\n\");\n}\n\n// returns a new matrix\nMatrix.prototype.transpose = function() {\n var transposed = [];\n for (var i = 0; i < this.width; i++) {\n transposed[i] = [];\n for (var j = 0; j < this.height; j++) {\n transposed[i][j] = this.mtx[j][i];\n }\n }\n return new Matrix(transposed);\n}\n\nvar m = new Matrix([[1,1,1,1],[2,4,8,16],[3,9,27,81],[4,16,64,256],[5,25,125,625]]);\nprint(m);\nprint();\nprint(m.transpose());\n","language":"JavaScript"},{"code":"(function () {\n 'use strict';\n\n function transpose(lst) {\n return lst[0].map(function (_, iCol) {\n return lst.map(function (row) {\n return row[iCol];\n })\n });\n }\n\n return transpose(\n [[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]]\n );\n\n})();\n","language":"JavaScript"},{"code":"(() => {\n \"use strict\";\n\n // transpose :: [[a]] -> [[a]]\n const transpose = xs =>\n 0 < xs.length ? (\n xs[0].map(\n (_, iCol) => xs.map(\n row => row[iCol]\n )\n )\n ) : [];\n\n\n // ---------------------- TEST -----------------------\n const main = () =>\n JSON.stringify(\n transpose([\n [1, 2, 3],\n [4, 5, 6],\n [7, 8, 9]\n ])\n );\n\n\n // MAIN ---\n return main();\n})();\n","language":"JavaScript"},{"code":"[[1,4,7],[2,5,8],[3,6,9]]\n","language":"JavaScript"},{"code":"DEFINE transpose == [[null] [true] [[null] some] ifte]\n[pop []]\n[[[first] map] [[rest] map] cleave]\n[cons]\nlinrec.\n","language":"Joy"},{"code":"def transpose:\n if (.[0] | length) == 0 then []\n else [map(.[0])] + (map(.[1:]) | transpose)\n end ;\n","language":"Jq"},{"code":"/* Matrix transposition, multiplication, identity, and exponentiation, in Jsish */\nfunction Matrix(ary) {\n this.mtx = ary;\n this.height = ary.length;\n this.width = ary[0].length;\n}\n\nMatrix.prototype.toString = function() {\n var s = [];\n for (var i = 0; i < this.mtx.length; i++) s.push(this.mtx[i].join(\",\"));\n return s.join(\"\\n\");\n};\n\n// returns a transposed matrix\nMatrix.prototype.transpose = function() {\n var transposed = [];\n for (var i = 0; i < this.width; i++) {\n transposed[i] = [];\n for (var j = 0; j < this.height; j++) transposed[i][j] = this.mtx[j][i];\n }\n return new Matrix(transposed);\n};\n\n// returns a matrix as the product of two others\nMatrix.prototype.mult = function(other) {\n if (this.width != other.height) throw \"error: incompatible sizes\";\n\n var result = [];\n for (var i = 0; i < this.height; i++) {\n result[i] = [];\n for (var j = 0; j < other.width; j++) {\n var sum = 0;\n for (var k = 0; k < this.width; k++) sum += this.mtx[i][k] * other.mtx[k][j];\n result[i][j] = sum;\n }\n }\n return new Matrix(result);\n};\n\n// IdentityMatrix is a \"subclass\" of Matrix\nfunction IdentityMatrix(n) {\n this.height = n;\n this.width = n;\n this.mtx = [];\n for (var i = 0; i < n; i++) {\n this.mtx[i] = [];\n for (var j = 0; j < n; j++) this.mtx[i][j] = (i == j ? 1 : 0);\n }\n}\nIdentityMatrix.prototype = Matrix.prototype;\n\n// the Matrix exponentiation function\nMatrix.prototype.exp = function(n) {\n var result = new IdentityMatrix(this.height);\n for (var i = 1; i <= n; i++) result = result.mult(this);\n return result;\n};\n\nprovide('Matrix', '0.60');\n","language":"Jsish"},{"code":"/* Matrix transposition, in Jsish */\nrequire('Matrix');\n\nif (Interp.conf('unitTest')) {\n var m = new Matrix([[1,1,1,1],[2,4,8,16],[3,9,27,81],[4,16,64,256],[5,25,125,625]]);\n; m;\n; m.transpose();\n}\n\n/*\n=!EXPECTSTART!=\nm ==> { height:5, mtx:[ [ 1, 1, 1, 1 ], [ 2, 4, 8, 16 ], [ 3, 9, 27, 81 ], [ 4, 16, 64, 256 ], [ 5, 25, 125, 625 ] ], width:4 }\nm.transpose() ==> { height:4, mtx:[ [ 1, 2, 3, 4, 5 ], [ 1, 4, 9, 16, 25 ], [ 1, 8, 27, 64, 125 ], [ 1, 16, 81, 256, 625 ] ], width:5 }\n=!EXPECTEND!=\n*/\n","language":"Jsish"},{"code":"julia> [1 2 3 ; 4 5 6] # a 2x3 matrix\n2x3 Array{Int64,2}:\n 1 2 3\n 4 5 6\n\njulia> [1 2 3 ; 4 5 6]' # note the quote\n3x2 LinearAlgebra.Adjoint{Int64,Array{Int64,2}}:\n 1 4\n 2 5\n 3 6\n","language":"Julia"},{"code":" {x^\\:-1_ x}1+!:5\n(1 1 1 1.0\n 2 4 8 16.0\n 3 9 27 81.0\n 4 16 64 256.0\n 5 25 125 625.0)\n\n +{x^\\:-1_ x}1+!:5\n(1 2 3 4 5.0\n 1 4 9 16 25.0\n 1 8 27 64 125.0\n 1 16 81 256 625.0)\n","language":"K"},{"code":" [5 5]:^!25\n[[0 1 2 3 4]\n [5 6 7 8 9]\n [10 11 12 13 14]\n [15 16 17 18 19]\n [20 21 22 23 24]]\n\n +[5 5]:^!25\n[[0 5 10 15 20]\n [1 6 11 16 21]\n [2 7 12 17 22]\n [3 8 13 18 23]\n [4 9 14 19 24]]\n","language":"Klong"},{"code":"// version 1.1.3\n\ntypealias Vector = DoubleArray\ntypealias Matrix = Array<Vector>\n\nfun Matrix.transpose(): Matrix {\n val rows = this.size\n val cols = this[0].size\n val trans = Matrix(cols) { Vector(rows) }\n for (i in 0 until cols) {\n for (j in 0 until rows) trans[i][j] = this[j][i]\n }\n return trans\n}\n\n// Alternate version\ntypealias Matrix<T> = List<List<T>>\nfun <T> Matrix<T>.transpose(): Matrix<T> {\n return (0 until this[0].size).map { x ->\n (this.indices).map { y ->\n this[y][x]\n }\n }\n}\n","language":"Kotlin"},{"code":"{require lib_matrix}\n\n{M.disp\n {M.transp\n[[1, 1, 1, 1],\n [2, 4, 8, 16],\n [3, 9, 27, 81],\n [4, 16, 64, 256],\n [5, 25,125, 625]]\n}}\n->\n[[1,2,3,4,5],\n[1,4,9,16,25],\n[1,8,27,64,125],\n[1,16,81,256,625]]\n","language":"Lambdatalk"},{"code":"12 iota [3 4] reshape 1 + dup .\n1 transpose .\n","language":"Lang5"},{"code":"(defun transpose (matrix)\n (transpose matrix '()))\n\n(defun transpose (matrix acc)\n (cond\n ((lists:any\n (lambda (x) (== x '()))\n matrix)\n acc)\n ('true\n (let ((heads (lists:map #'car/1 matrix))\n (tails (lists:map #'cdr/1 matrix)))\n (transpose tails (++ acc `(,heads)))))))\n","language":"LFE"},{"code":"> (transpose '((1 2 3)\n (4 5 6)\n (7 8 9)\n (10 11 12)\n (13 14 15)\n (16 17 18)))\n((1 4 7 10 13 16) (2 5 8 11 14 17) (3 6 9 12 15 18))\n>\n","language":"LFE"},{"code":"MatrixC$ =\"4, 3, 0, 0.10, 0.20, 0.30, 0.40, 0.50, 0.60, 0.70, 0.80, 0.90, 1.00, 1.10\"\n\nprint \"Transpose of matrix\"\ncall DisplayMatrix MatrixC$\nprint \" =\"\nMatrixT$ =MatrixTranspose$( MatrixC$)\ncall DisplayMatrix MatrixT$\n","language":"Liberty-BASIC"},{"code":"function Transpose( m )\n local res = {}\n\n for i = 1, #m[1] do\n res[i] = {}\n for j = 1, #m do\n res[i][j] = m[j][i]\n end\n end\n\n return res\nend\n\n-- a test for Transpose(m)\nmat = { { 1, 2, 3 }, { 4, 5, 6 } }\nerg = Transpose( mat )\nfor i = 1, #erg do\n for j = 1, #erg[1] do\n io.write( erg[i][j] )\n io.write( \" \" )\n end\n io.write( \"\\n\" )\nend\n","language":"Lua"},{"code":"function map(f, a)\n local b = {}\n for k,v in ipairs(a) do b[k] = f(v) end\n return b\nend\n\nfunction mapn(f, ...)\n local c = {}\n local k = 1\n local aarg = {...}\n local n = #aarg\n while true do\n local a = map(function(b) return b[k] end, aarg)\n if #a < n then return c end\n c[k] = f(unpack(a))\n k = k + 1\n end\nend\n\nfunction apply(f1, f2, a)\n return f1(f2, unpack(a))\nend\n\nxy = {{1,2,3,4},{1,2,3,4},{1,2,3,4}}\nyx = apply(mapn, function(...) return {...} end, xy)\nprint(table.concat(map(function(a) return table.concat(a,\",\") end, xy), \"\\n\"),\"\\n\")\nprint(table.concat(map(function(a) return table.concat(a,\",\") end, yx), \"\\n\"))\n","language":"Lua"},{"code":"M := <<2,3>|<3,4>|<5,6>>;\n\nM^%T;\n\nwith(LinearAlgebra):\nTranspose(M);\n","language":"Maple"},{"code":"originalMatrix = {{1, 1, 1, 1},\n {2, 4, 8, 16},\n {3, 9, 27, 81},\n {4, 16, 64, 256},\n {5, 25, 125, 625}}\ntransposedMatrix = Transpose[originalMatrix]\n","language":"Mathematica"},{"code":">> transpose([1 2;3 4])\n\nans =\n\n 1 3\n 2 4\n\n>> [1 2;3 4].'\n\nans =\n\n 1 3\n 2 4\n","language":"MATLAB"},{"code":"B=size(A); %In this code, we assume that a previous matrix \"A\" has already been inputted.\nfor j=1:B(1)\n for i=1:B(2)\n C(i,j)=A(j,i);\n end %The transposed A-matrix should be C\nend\n","language":"MATLAB"},{"code":"xy = {{1,2,3,4},{1,2,3,4},{1,2,3,4}}\nyx = feval(@(x) cellfun(@(varargin)[varargin],x{:},'un',0), xy)\n","language":"MATLAB"},{"code":"originalMatrix : matrix([1, 1, 1, 1],\n [2, 4, 8, 16],\n [3, 9, 27, 81],\n [4, 16, 64, 256],\n [5, 25, 125, 625]);\ntransposedMatrix : transpose(originalMatrix);\n","language":"Maxima"},{"code":"m = bigMatrix 5 4\nfor i in 1 to 5 do for j in 1 to 4 do m[i][j] = pow i j\nm = transpose m\n","language":"MAXScript"},{"code":"|a := 2 3 reshape count 6\n=1 2 3\n=4 5 6\n","language":"Nial"},{"code":"|transpose a\n=1 4\n=2 5\n=3 6\n","language":"Nial"},{"code":"proc transpose[X, Y; T](s: array[Y, array[X, T]]): array[X, array[Y, T]] =\n for i in low(X)..high(X):\n for j in low(Y)..high(Y):\n result[i][j] = s[j][i]\n\nlet b = [[ 0, 1, 2, 3, 4],\n [ 5, 6, 7, 8, 9],\n [ 1, 0, 0, 0,42]]\nlet c = transpose(b)\nfor r in c:\n for i in r:\n stdout.write i, \" \"\n echo \"\"\n","language":"Nim"},{"code":"proc transpose[T](s: seq[seq[T]]): seq[seq[T]] =\n result = newSeq[seq[T]](s[0].len)\n for i in 0 .. s[0].high:\n result[i] = newSeq[T](s.len)\n for j in 0 .. s.high:\n result[i][j] = s[j][i]\n\nlet a = @[@[ 0, 1, 2, 3, 4],\n @[ 5, 6, 7, 8, 9],\n @[ 1, 0, 0, 0, 42]]\necho transpose(a)\n","language":"Nim"},{"code":"bundle Default {\n class Transpose {\n function : Main(args : String[]) ~ Nil {\n input := [[1, 1, 1, 1]\n [2, 4, 8, 16]\n [3, 9, 27, 81]\n [4, 16, 64, 256]\n [5, 25, 125, 625]];\n dim := input->Size();\n\n output := Int->New[dim[0],dim[1]];\n for(i := 0; i < dim[0]; i+=1;) {\n for(j := 0; j < dim[1]; j+=1;) {\n output[i,j] := input[i,j];\n };\n };\n\n Print(output);\n }\n\n function : Print(matrix : Int[,]) ~ Nil {\n dim := matrix->Size();\n for(i := 0; i < dim[0]; i+=1;) {\n for(j := 0; j < dim[1]; j+=1;) {\n IO.Console->Print(matrix[i,j])->Print('\\t');\n };\n '\\n'->Print();\n };\n }\n }\n}\n","language":"Objeck"},{"code":"open Bigarray\n\nlet transpose b =\n let dim1 = Array2.dim1 b\n and dim2 = Array2.dim2 b in\n let kind = Array2.kind b\n and layout = Array2.layout b in\n let b' = Array2.create kind layout dim2 dim1 in\n for i=0 to pred dim1 do\n for j=0 to pred dim2 do\n b'.{j,i} <- b.{i,j}\n done;\n done;\n (b')\n;;\n\nlet array2_display print newline b =\n for i=0 to Array2.dim1 b - 1 do\n for j=0 to Array2.dim2 b - 1 do\n print b.{i,j}\n done;\n newline();\n done;\n;;\n\nlet a = Array2.of_array int c_layout [|\n [| 1; 2; 3; 4 |];\n [| 5; 6; 7; 8 |];\n|]\n;;\n\narray2_display (Printf.printf \" %d\") print_newline (transpose a) ;;\n","language":"OCaml"},{"code":"let rec transpose m =\n assert (m <> []);\n if List.mem [] m then\n []\n else\n List.map List.hd m :: transpose (List.map List.tl m)\n","language":"OCaml"},{"code":"a = [ 1, 1, 1, 1 ;\n 2, 4, 8, 16 ;\n 3, 9, 27, 81 ;\n 4, 16, 64, 256 ;\n 5, 25, 125, 625 ];\ntranposed = a.'; % tranpose\nctransp = a'; % conjugate transpose\n","language":"Octave"},{"code":"function Transpose(double *A,*B, sys nx,ny)\n'==========================================\n sys x,y\n indexbase 0\n for x=0 to <nx\n for y=0 to <ny\n B[y*nx+x]=A[x*ny+y]\n next\n next\nend function\n\nfunction MatrixShow(double*A, sys nx,ny) as string\n'=================================================\n sys x,y\n indexbase 0\n string pr=\"\",tab=chr(9),cr=chr(13)+chr(10)\n for y=0 to <ny\n for x=0 to <nx\n pr+=tab A[x*ny+y]\n next\n pr+=cr\n next\n return pr\nend function\n\n'====\n'DEMO\n'====\n\ndouble A[5*4],B[4*5]\n'columns x\n'rows y\n\nA <= 'y minor, x major\n11,12,13,14,15,\n21,22,23,24,25,\n31,32,33,34,35,\n41,42,43,44,45\n\nprint MatrixShow A,5,4\nTranspose A,B,5,4\nprint MatrixShow B,4,5\n","language":"OxygenBasic"},{"code":"M~\n","language":"PARI-GP"},{"code":"gtrans(M)\n","language":"PARI-GP"},{"code":"Program Transpose;\n\nconst\n A: array[1..3,1..5] of integer = (( 1, 2, 3, 4, 5),\n ( 6, 7, 8, 9, 10),\n\t\t\t\t (11, 12, 13, 14, 15)\n\t\t\t\t );\nvar\n B: array[1..5,1..3] of integer;\n i, j: integer;\n\nbegin\n for i := low(A) to high(A) do\n for j := low(A[1]) to high(A[1]) do\n B[j,i] := A[i,j];\n\n writeln ('A:');\n for i := low(A) to high(A) do\n begin\n for j := low(A[1]) to high(A[1]) do\n write (A[i,j]:3);\n writeln;\n end;\n\n writeln ('B:');\n for i := low(B) to high(B) do\n begin\n for j := low(B[1]) to high(B[1]) do\n write (B[i,j]:3);\n writeln;\n end;\nend.\n","language":"Pascal"},{"code":"use Math::Matrix;\n\n$m = Math::Matrix->new(\n [1, 1, 1, 1],\n [2, 4, 8, 16],\n [3, 9, 27, 81],\n [4, 16, 64, 256],\n [5, 25, 125, 625],\n);\n\n$m->transpose->print;\n","language":"Perl"},{"code":"my @m = (\n [1, 1, 1, 1],\n [2, 4, 8, 16],\n [3, 9, 27, 81],\n [4, 16, 64, 256],\n [5, 25, 125, 625],\n);\n\nmy @transposed;\nforeach my $j (0..$#{$m[0]}) {\n push(@transposed, [map $_->[$j], @m]);\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;\">matrix_transpose</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">mat</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">rows</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">mat</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">cols</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">mat</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;\">res</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: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rows</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">cols</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;\">rows</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;\">cols</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">mat</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: #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;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n<!--\n","language":"Phix"},{"code":"function transpose($m) {\n if (count($m) == 0) // special case: empty matrix\n return array();\n else if (count($m) == 1) // special case: row matrix\n return array_chunk($m[0], 1);\n\n // array_map(NULL, m[0], m[1], ..)\n array_unshift($m, NULL); // the original matrix is not modified because it was passed by value\n return call_user_func_array('array_map', $m);\n}\n","language":"PHP"},{"code":"function transpose($m) {\n return count($m) == 0 ? $m : (count($m) == 1 ? array_chunk($m[0], 1) : array_map(null, ...$m));\n}\n","language":"PHP"},{"code":"import util.\n\ngo =>\n M = [[0.0, 0.1, 0.2, 0.3],\n [0.4, 0.5, 0.6, 0.7],\n [0.8, 0.9, 1.0, 1.1]],\n print_matrix(M),\n\n M2 = [[a,b,c,d,e],\n [f,g,h,i,j],\n [k,l,m,n,o],\n [p,q,r,s,t],\n [u,v,w,z,y]],\n print_matrix(M2),\n\n M3 = make_matrix(1..24,8),\n print_matrix(M3),\n nl.\n\n\n%\n% Print original matrix and its transpose\n%\nprint_matrix(M) =>\n println(\"Matrix:\"),\n foreach(Row in M) println(Row) end,\n println(\"\\nTransposed:\"),\n foreach(Row in M.transpose()) println(Row) end,\n nl.\n\n%\n% Make a matrix of list L with Rows rows\n% (and L.length div Rows columns)\n%\nmake_matrix(L,Rows) = M =>\n M = [],\n Cols = L.length div Rows,\n foreach(I in 1..Rows)\n NewRow = new_list(Cols),\n foreach(J in 1..Cols)\n NewRow[J] := L[ (I-1)*Cols + J]\n end,\n M := M ++ [NewRow]\n end.\n","language":"Picat"},{"code":"(de matTrans (Mat)\n (apply mapcar Mat list) )\n\n(matTrans '((1 2 3) (4 5 6)))\n","language":"PicoLisp"},{"code":"/* The short method: */\ndeclare A(m, n) float, B (n,m) float defined (A(2sub, 1sub));\n/* Any reference to B gives the transpose of matrix A. */\n","language":"PL-I"},{"code":"/* Transpose matrix A, result at B. */\ntranspose: procedure (a, b);\n declare (a, b) (*,*) float controlled;\n declare (m, n) fixed binary;\n\n if allocation(b) > 0 then free b;\n\n m = hbound(a,1); n = hbound(a,2);\n\n allocate b(n,m);\n\n do i = 1 to m;\n b(*,i) = a(i,*);\n end;\nend transpose;\n","language":"PL-I"},{"code":"define transpose(m) -> res;\n lvars bl = boundslist(m);\n if length(bl) /= 4 then\n throw([need_2d_array ^a])\n endif;\n lvars i, i0 = bl(1), i1 = bl(2);\n lvars j, j0 = bl(3), j1 = bl(4);\n newarray([^j0 ^j1 ^i0 ^i1], 0) -> res;\n for i from i0 to i1 do\n for j from j0 to j1 do\n m(i, j) -> res(j, i);\n endfor;\n endfor;\nenddefine;\n","language":"Pop11"},{"code":"/transpose {\n [ exch {\n { {empty? exch pop} map all?} {pop exit} ift\n [ exch {} {uncons {exch cons} dip exch} fold counttomark 1 roll] uncons\n } loop ] {reverse} map\n}.\n","language":"PostScript"},{"code":"#COMPILE EXE\n#DIM ALL\n#COMPILER PBCC 6\n'----------------------------------------------------------------------\nSUB TransposeMatrix(InitMatrix() AS DWORD, TransposedMatrix() AS DWORD)\nLOCAL l1, l2, u1, u2 AS LONG\n l1 = LBOUND(InitMatrix, 1)\n l2 = LBOUND(InitMatrix, 2)\n u1 = UBOUND(InitMatrix, 1)\n u2 = UBOUND(InitMatrix, 2)\n REDIM TransposedMatrix(l2 TO u2, l1 TO u1)\n MAT TransposedMatrix() = TRN(InitMatrix())\nEND SUB\n'----------------------------------------------------------------------\nSUB PrintMatrix(a() AS DWORD)\nLOCAL l1, l2, u1, u2, r, c AS LONG\nLOCAL s AS STRING * 8\n l1 = LBOUND(a(), 1)\n l2 = LBOUND(a(), 2)\n u1 = UBOUND(a(), 1)\n u2 = UBOUND(a(), 2)\n FOR r = l1 TO u1\n FOR c = l2 TO u2\n RSET s = STR$(a(r, c))\n CON.PRINT s;\n NEXT c\n CON.PRINT\n NEXT r\nEND SUB\n'----------------------------------------------------------------------\nSUB TranspositionDemo(BYVAL DimSize1 AS DWORD, BYVAL DimSize2 AS DWORD)\nLOCAL r, c, cc AS DWORD\nLOCAL a() AS DWORD\nLOCAL b() AS DWORD\n cc = DimSize2\n DECR DimSize1\n DECR DimSize2\n REDIM a(0 TO DimSize1, 0 TO DimSize2)\n FOR r = 0 TO DimSize1\n FOR c = 0 TO DimSize2\n a(r, c)= (cc * r) + c + 1\n NEXT c\n NEXT r\n CON.PRINT \"initial matrix:\"\n PrintMatrix a()\n TransposeMatrix a(), b()\n CON.PRINT \"transposed matrix:\"\n PrintMatrix b()\nEND SUB\n'----------------------------------------------------------------------\nFUNCTION PBMAIN () AS LONG\n TranspositionDemo 3, 3\n TranspositionDemo 3, 7\nEND FUNCTION\n","language":"PowerBASIC"},{"code":"function transpose($a) {\n $arr = @()\n if($a) {\n $n = $a.count - 1\n if(0 -lt $n) {\n $m = ($a | foreach {$_.count} | measure-object -Minimum).Minimum - 1\n if( 0 -le $m) {\n if (0 -lt $m) {\n $arr =@(0)*($m+1)\n foreach($i in 0..$m) {\n $arr[$i] = foreach($j in 0..$n) {@($a[$j][$i])}\n }\n } else {$arr = foreach($row in $a) {$row[0]}}\n }\n } else {$arr = $a}\n }\n $arr\n}\nfunction show($a) {\n if($a) {\n 0..($a.Count - 1) | foreach{ if($a[$_]){\"$($a[$_])\"}else{\"\"} }\n }\n}\n\n$a = @(@(2, 0, 7, 8),@(3, 5, 9, 1),@(4, 1, 6, 3))\n\"`$a =\"\nshow $a\n\"\"\n\"transpose `$a =\"\nshow (transpose $a)\n\"\"\n$a = @(1)\n\"`$a =\"\nshow $a\n\"\"\n\"transpose `$a =\"\nshow (transpose $a)\n\"\"\n\"`$a =\"\n$a = @(1,2,3)\nshow $a\n\"\"\n\"transpose `$a =\"\n\"$(transpose $a)\"\n\"\"\n\"`$a =\"\n$a = @(@(4,7,8),@(1),@(2,3))\nshow $a\n\"\"\n\"transpose `$a =\"\n\"$(transpose $a)\"\n\"\"\n\"`$a =\"\n$a = @(@(4,7,8),@(1,5,9,0),@(2,3))\nshow $a\n\"\"\n\"transpose `$a =\"\nshow (transpose $a)\n","language":"PowerShell"},{"code":"function transpose($a) {\n if($a) {\n $n = $a.Count - 1\n foreach($i in 0..$n) {\n $j = 0\n while($j -lt $i) {\n $a[$i][$j], $a[$j][$i] = $a[$j][$i], $a[$i][$j]\n $j++\n }\n }\n }\n $a\n}\nfunction show($a) {\n if($a) {\n 0..($a.Count - 1) | foreach{ if($a[$_]){\"$($a[$_])\"}else{\"\"} }\n }\n}\n$a = @(@(2, 4, 7),@(3, 5, 9),@(4, 1, 6))\nshow $a\n\"\"\nshow (transpose $a)\n","language":"PowerShell"},{"code":"% transposition of a rectangular matrix\n% e.g. [[1,2,3,4], [5,6,7,8]]\n% give [[1,5],[2,6],[3,7],[4,8]]\n\ntranspose(In, Out) :-\n In = [H | T],\n maplist(initdl, H, L),\n work(T, In, Out).\n\n% we use the difference list to make \"quick\" appends (one inference)\ninitdl(V, [V | X] - X).\n\nwork(Lst, [H], Out) :-\n\tmaplist(my_append_last, Lst, H, Out).\n\nwork(Lst, [H | T], Out) :-\n maplist(my_append, Lst, H, Lst1),\n work(Lst1, T, Out).\n\nmy_append(X-Y, C, X1-Y1) :-\n append_dl(X-Y, [C | U]- U, X1-Y1).\n\nmy_append_last(X-Y, C, X1) :-\n\tappend_dl(X-Y, [C | U]- U, X1-[]).\n\n% \"quick\" append\nappend_dl(X-Y, Y-Z, X-Z).\n","language":"Prolog"},{"code":"Procedure transposeMatrix(Array a(2), Array trans(2))\n Protected rows, cols\n\n Protected ar = ArraySize(a(), 1) ;rows in original matrix\n Protected ac = ArraySize(a(), 2) ;cols in original matrix\n\n ;size the matrix receiving the transposition\n Dim trans(ac, ar)\n\n ;copy the values\n For rows = 0 To ar\n For cols = 0 To ac\n trans(cols, rows) = a(rows, cols)\n Next\n Next\nEndProcedure\n\nProcedure displayMatrix(Array a(2), text.s = \"\")\n Protected i, j\n Protected cols = ArraySize(a(), 2), rows = ArraySize(a(), 1)\n\n PrintN(text + \": (\" + Str(rows + 1) + \", \" + Str(cols + 1) + \")\")\n For i = 0 To rows\n For j = 0 To cols\n Print(LSet(Str(a(i, j)), 4, \" \"))\n Next\n PrintN(\"\")\n Next\n PrintN(\"\")\nEndProcedure\n\n;setup a matrix of arbitrary size\nDim m(random(5), random(5))\n\nDefine rows, cols\n;fill matrix with 'random' data\nFor rows = 0 To ArraySize(m(),1) ;ArraySize() can take a dimension as its second argument\n For cols = 0 To ArraySize(m(), 2)\n m(rows, cols) = random(10) - 10\n Next\nNext\n\nDim t(0,0) ;this will be resized during transposition\nIf OpenConsole()\n displayMatrix(m(), \"matrix before transposition\")\n transposeMatrix(m(), t())\n displayMatrix(t(), \"matrix after transposition\")\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\")\n Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"m=((1, 1, 1, 1),\n (2, 4, 8, 16),\n (3, 9, 27, 81),\n (4, 16, 64, 256),\n (5, 25,125, 625))\nprint(zip(*m))\n# in Python 3.x, you would do:\n# print(list(zip(*m)))\n","language":"Python"},{"code":"# transpose :: Matrix a -> Matrix a\ndef transpose(m):\n if m:\n inner = type(m[0])\n z = zip(*m)\n return (type(m))(\n map(inner, z) if tuple != inner else z\n )\n else:\n return m\n\n\nif __name__ == '__main__':\n\n # TRANSPOSING FOUR BASIC TYPES OF PYTHON MATRIX\n # Cartesian product of (Outer, Inner) with (List, Tuple)\n\n # Matrix any = Tuple of Tuples of any type\n tts = ((1, 2, 3), (4, 5, 6), (7, 8, 9))\n\n # Matrix any = Tuple of Lists of any type\n tls = ([1, 2, 3], [4, 5, 6], [7, 8, 9])\n\n emptyTuple = ()\n\n # Matrix any = List of Lists of any type\n lls = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]\n\n # Matrix any = List of Tuples of any type\n lts = [(1, 2, 3), (4, 5, 6), (7, 8, 9)]\n\n emptyList = []\n\n print('transpose function :: (Transposition without type change):\\n')\n for m in [emptyTuple, tts, tls, emptyList, lls, lts]:\n tm = transpose(m)\n print (\n type(tm).__name__ + (\n (' of ' + type(tm[0]).__name__) if m else ''\n ) + ' :: ' + str(m) + ' -> ' + str(tm)\n )\n","language":"Python"},{"code":"# Uneven list of lists\nuls = [[10, 11], [20], [], [30, 31, 32]]\n\nprint (\n list(zip(*uls))\n)\n\n# --> []\n","language":"Python"},{"code":"'''Transposition of row sets with possible gaps'''\n\nfrom collections import defaultdict\n\n\n# listTranspose :: [[a]] -> [[a]]\ndef listTranspose(xss):\n '''Transposition of a matrix which may\n contain gaps.\n '''\n def go(xss):\n if xss:\n h, *t = xss\n return (\n [[h[0]] + [xs[0] for xs in t if xs]] + (\n go([h[1:]] + [xs[1:] for xs in t])\n )\n ) if h and isinstance(h, list) else go(t)\n else:\n return []\n return go(xss)\n\n\n# TEST ----------------------------------------------------\n# main :: IO ()\ndef main():\n '''Tests with various lists of rows or non-row data.'''\n\n def labelledList(kxs):\n k, xs = kxs\n return k + ': ' + showList(xs)\n\n print(\n fTable(\n __doc__ + ':\\n'\n )(labelledList)(fmapFn(showList)(snd))(\n fmapTuple(listTranspose)\n )([\n ('Square', [[1, 2, 3], [4, 5, 6], [7, 8, 9]]),\n ('Rectangle', [[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]]),\n ('Rows with gaps', [[10, 11], [20], [], [31, 32, 33]]),\n ('Single row', [[1, 2, 3]]),\n ('Single row, one cell', [[1]]),\n ('Not rows', [1, 2, 3]),\n ('Nothing', [])\n ])\n )\n\n\n# TEST RESULT FORMATTING ----------------------------------\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# fmapFn :: (a -> b) -> (r -> a) -> r -> b\ndef fmapFn(f):\n '''The application of f to the result of g.\n fmap over a function is composition.\n '''\n return lambda g: lambda x: f(g(x))\n\n\n# fmapTuple :: (a -> b) -> (c, a) -> (c, b)\ndef fmapTuple(f):\n '''A pair in which f has been\n applied to the second item.\n '''\n return lambda ab: (ab[0], f(ab[1])) if (\n 2 == len(ab)\n ) else None\n\n\n# show :: a -> String\ndef show(x):\n '''Stringification of a value.'''\n def go(v):\n return defaultdict(lambda: repr, [\n ('list', showList)\n # ('Either', showLR),\n # ('Maybe', showMaybe),\n # ('Tree', drawTree)\n ])[\n typeName(v)\n ](v)\n return go(x)\n\n\n# showList :: [a] -> String\ndef showList(xs):\n '''Stringification of a list.'''\n return '[' + ','.join(show(x) for x in xs) + ']'\n\n\n# snd :: (a, b) -> b\ndef snd(tpl):\n '''Second member of a pair.'''\n return tpl[1]\n\n\n# typeName :: a -> String\ndef typeName(x):\n '''Name string for a built-in or user-defined type.\n Selector for type-specific instances\n of polymorphic functions.\n '''\n if isinstance(x, dict):\n return x.get('type') if 'type' in x else 'dict'\n else:\n return 'iter' if hasattr(x, '__next__') else (\n type(x).__name__\n )\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":" [ ' [ [ ] ]\n over 0 peek size of\n [] rot\n witheach join\n witheach\n [ dip behead\n nested join\n nested join ] ] is transpose ( [ --> [ )\n\n ' [ [ 1 2 ] [ 3 4 ] [ 5 6 ] ]\n dup echo cr cr\n transpose dup echo cr cr\n transpose echo cr\n","language":"Quackery"},{"code":"b <- 1:5\nm <- matrix(c(b, b^2, b^3, b^4), 5, 4)\nprint(m)\ntm <- t(m)\nprint(tm)\n","language":"R"},{"code":"#lang racket\n(require math)\n(matrix-transpose (matrix [[1 2] [3 4]]))\n","language":"Racket"},{"code":"# Transposition can be done with the reduced zip meta-operator\n# on list-of-lists data structures\n\nsay [Z] (<A B C D>, <E F G H>, <I J K L>);\n\n# For native shaped arrays, a more traditional procedure of copying item-by-item\n# Here the resulting matrix is also a native shaped array\n\nmy @a[3;4] =\n [\n [<A B C D>],\n [<E F G H>],\n [<I J K L>],\n ];\n\n(my $n, my $m) = @a.shape;\nmy @b[$m;$n];\nfor ^$m X ^$n -> (\\i, \\j) {\n @b[i;j] = @a[j;i];\n}\n\nsay @b;\n","language":"Raku"},{"code":"public rel[real, real, real] matrixTranspose(rel[real x, real y, real v] matrix){\n return {<y, x, v> | <x, y, v> <- matrix};\n}\n\n//a matrix\npublic rel[real x, real y, real v] matrixA = {\n<0.0,0.0,12.0>, <0.0,1.0, 6.0>, <0.0,2.0,-4.0>,\n<1.0,0.0,-51.0>, <1.0,1.0,167.0>, <1.0,2.0,24.0>,\n<2.0,0.0,4.0>, <2.0,1.0,-68.0>, <2.0,2.0,-41.0>\n};\n","language":"Rascal"},{"code":"/*REXX program transposes any sized rectangular matrix, displays before & after matrices*/\n@.=; @.1 = 1.02 2.03 3.04 4.05 5.06 6.07 7.08\n @.2 = 111 2222 33333 444444 5555555 66666666 777777777\nw=0\n do row=1 while @.row\\==''\n do col=1 until @.row==''; parse var @.row A.row.col @.row\n w=max(w, length(A.row.col) ) /*max width for elements*/\n end /*col*/ /*(used to align ouput).*/\n end /*row*/ /* [↑] build matrix A from the @ lists*/\nrow= row-1 /*adjust for DO loop index increment.*/\n do j=1 for row /*process each row of the matrix.*/\n do k=1 for col /* \" \" column \" \" \" */\n B.k.j= A.j.k /*transpose the A matrix (into B). */\n end /*k*/\n end /*j*/\ncall showMat 'A', row, col /*display the A matrix to terminal.*/\ncall showMat 'B', col, row /* \" \" B \" \" \" */\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nshowMat: arg mat,rows,cols; say; say center( mat 'matrix', (w+1)*cols +4, \"─\")\n do r=1 for rows; _= /*newLine*/\n do c=1 for cols; _=_ right( value( mat'.'r\".\"c), w) /*append.*/\n end /*c*/\n say _ /*1 line.*/\n end /*r*/; return\n","language":"REXX"},{"code":"load \"stdlib.ring\"\ntranspose = newlist(5,4)\nmatrix = [[78,19,30,12,36], [49,10,65,42,50], [30,93,24,78,10], [39,68,27,64,29]]\nfor i = 1 to 5\n for j = 1 to 4\n transpose[i][j] = matrix[j][i]\n see \"\" + transpose[i][j] + \" \"\n next\n see nl\nnext\n","language":"Ring"},{"code":" >> m = rand(3,5)\n 0.41844289 0.476591435 0.75054022 0.226388925 0.963880314\n 0.91267171 0.941762397 0.464227895 0.693482786 0.203839405\n 0.261512966 0.157981873 0.26582235 0.11557427 0.0442493069\n>> m'\n 0.41844289 0.91267171 0.261512966\n 0.476591435 0.941762397 0.157981873\n 0.75054022 0.464227895 0.26582235\n 0.226388925 0.693482786 0.11557427\n 0.963880314 0.203839405 0.0442493069\n","language":"RLaB"},{"code":"m=[[1, 1, 1, 1],\n [2, 4, 8, 16],\n [3, 9, 27, 81],\n [4, 16, 64, 256],\n [5, 25,125, 625]]\nputs m.transpose\n","language":"Ruby"},{"code":"require 'matrix'\n\nm=Matrix[[1, 1, 1, 1],\n [2, 4, 8, 16],\n [3, 9, 27, 81],\n [4, 16, 64, 256],\n [5, 25,125, 625]]\nputs m.transpose\n","language":"Ruby"},{"code":"def transpose(m)\n m[0].zip(*m[1..-1])\nend\np transpose([[1,2,3],[4,5,6]])\n","language":"Ruby"},{"code":"mtrx$ =\"4, 3, 0, 0.10, 0.20, 0.30, 0.40, 0.50, 0.60, 0.70, 0.80, 0.90, 1.00, 1.10\"\n\nprint \"Transpose of matrix\"\ncall DisplayMatrix mtrx$\nprint \" =\"\nMatrixT$ =MatrixTranspose$(mtrx$)\ncall DisplayMatrix MatrixT$\n\nend\n\nfunction MatrixTranspose$(in$)\n w\t= val(word$(in$, 1, \",\")) ' swap w and h parameters\n h\t= val(word$(in$, 2, \",\"))\n t$\t= str$(h); \",\"; str$(w); \",\"\n for i =1 to w\n for j =1 to h\n t$ = t$ +word$(in$, 2 +i +(j -1) *w, \",\") +\",\"\n next j\n next i\nMatrixTranspose$ =left$(t$, len(t$) -1)\nend function\n\nsub DisplayMatrix in$ ' Display looking like a matrix!\nhtml \"<table border=2>\"\n w\t= val(word$(in$, 1, \",\"))\n h\t= val(word$(in$, 2, \",\"))\n for i =0 to h -1\n html \"<tr align=right>\"\n for j =1 to w\n term$\t= word$(in$, j +2 +i *w, \",\")\n html \"<td>\";val(term$);\"</td>\"\n next j\nhtml \"</tr>\"\nnext i\nhtml \"</table>\"\nend sub\n","language":"Run-BASIC"},{"code":"struct Matrix {\n dat: [[i32; 3]; 3]\n}\n\n\n\nimpl Matrix {\n pub fn transpose_m(a: Matrix) -> Matrix\n {\n let mut out = Matrix {\n dat: [[0, 0, 0],\n [0, 0, 0],\n [0, 0, 0]\n ]\n };\n\n for i in 0..3{\n for j in 0..3{\n\n out.dat[i][j] = a.dat[j][i];\n }\n }\n\n out\n }\n\n pub fn print(self)\n {\n for i in 0..3 {\n for j in 0..3 {\n print!(\"{} \", self.dat[i][j]);\n }\n print!(\"\\n\");\n }\n }\n}\n\nfn main()\n{\n let a = Matrix {\n dat: [[1, 2, 3],\n [4, 5, 6],\n [7, 8, 9] ]\n };\n\nlet c = Matrix::transpose_m(a);\n c.print();\n}\n","language":"Rust"},{"code":"fn main() {\n let m = vec![vec![1, 2, 3], vec![4, 5, 6]];\n println!(\"Matrix:\\n{}\", matrix_to_string(&m));\n let t = matrix_transpose(m);\n println!(\"Transpose:\\n{}\", matrix_to_string(&t));\n}\n\nfn matrix_to_string(m: &Vec<Vec<i32>>) -> String {\n m.iter().fold(\"\".to_string(), |a, r| {\n a + &r\n .iter()\n .fold(\"\".to_string(), |b, e| b + \"\\t\" + &e.to_string())\n + \"\\n\"\n })\n}\n\nfn matrix_transpose(m: Vec<Vec<i32>>) -> Vec<Vec<i32>> {\n let mut t = vec![Vec::with_capacity(m.len()); m[0].len()];\n for r in m {\n for i in 0..r.len() {\n t[i].push(r[i]);\n }\n }\n t\n}\n","language":"Rust"},{"code":"scala> Array.tabulate(4)(i => Array.tabulate(4)(j => i*4 + j))\nres12: Array[Array[Int]] = Array(Array(0, 1, 2, 3), Array(4, 5, 6, 7), Array(8, 9, 10, 11), Array(12, 13, 14, 15))\n\nscala> res12.transpose\nres13: Array[Array[Int]] = Array(Array(0, 4, 8, 12), Array(1, 5, 9, 13), Array(2, 6, 10, 14), Array(3, 7, 11, 15))\n\nscala> res12 map (_ map (\"%2d\" format _) mkString \" \") mkString \"\\n\"\nres16: String =\n 0 1 2 3\n 4 5 6 7\n 8 9 10 11\n12 13 14 15\n\nscala> res13 map (_ map (\"%2d\" format _) mkString \" \") mkString \"\\n\"\nres17: String =\n 0 4 8 12\n 1 5 9 13\n 2 6 10 14\n 3 7 11 15\n","language":"Scala"},{"code":"(define (transpose m)\n (apply map list m))\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n include \"float.s7i\";\n\nconst type: matrix is array array float;\n\nconst func matrix: transpose (in matrix: aMatrix) is func\n result\n var matrix: transposedMatrix is matrix.value;\n local\n var integer: i is 0;\n var integer: j is 0;\n begin\n transposedMatrix := length(aMatrix[1]) times length(aMatrix) times 0.0;\n for i range 1 to length(aMatrix) do\n for j range 1 to length(aMatrix[1]) do\n transposedMatrix[j][i] := aMatrix[i][j];\n end for;\n end for;\n end func;\n\nconst proc: write (in matrix: aMatrix) is func\n local\n var integer: line is 0;\n var integer: column is 0;\n begin\n for line range 1 to length(aMatrix) do\n for column range 1 to length(aMatrix[line]) do\n write(\" \" <& aMatrix[line][column] digits 2);\n end for;\n writeln;\n end for;\n end func;\n\nconst matrix: testMatrix is [] (\n [] (0.0, 0.1, 0.2, 0.3),\n [] (0.4, 0.5, 0.6, 0.7),\n [] (0.8, 0.9, 1.0, 1.1));\n\nconst proc: main is func\n begin\n writeln(\"Before Transposition:\");\n write(testMatrix);\n writeln;\n writeln(\"After Transposition:\");\n write(transpose(testMatrix));\n end func;\n","language":"Seed7"},{"code":"func transpose(matrix) {\n matrix[0].range.map{|i| matrix.map{_[i]}};\n};\n\nvar m = [\n [1, 1, 1, 1],\n [2, 4, 8, 16],\n [3, 9, 27, 81],\n [4, 16, 64, 256],\n [5, 25, 125, 625],\n];\n\ntranspose(m).each { |row|\n \"%5d\" * row.len -> printlnf(row...);\n}\n","language":"Sidef"},{"code":"(1) -> originalMatrix := matrix [[1, 1, 1, 1],[2, 4, 8, 16], _\n [3, 9, 27, 81],[4, 16, 64, 256], _\n [5, 25, 125, 625]]\n\n +1 1 1 1 +\n | |\n |2 4 8 16 |\n | |\n (1) |3 9 27 81 |\n | |\n |4 16 64 256|\n | |\n +5 25 125 625+\n Type: Matrix(Integer)\n(2) -> transposedMatrix := transpose(originalMatrix)\n\n +1 2 3 4 5 +\n | |\n |1 4 9 16 25 |\n (2) | |\n |1 8 27 64 125|\n | |\n +1 16 81 256 625+\n Type: Matrix(Integer)\n","language":"SPAD"},{"code":"function transpose(A) {\n return map(range(sizeof A), function(k, idx) {\n return map(A, function(k, row) {\n return row[idx];\n });\n });\n}\n","language":"Sparkling"},{"code":". mat a=1,2,3\\4,5,6\n. mat b=a'\n. mat list a\n\na[2,3]\n c1 c2 c3\nr1 1 2 3\nr2 4 5 6\n\n. mat list b\n\nb[3,2]\n r1 r2\nc1 1 4\nc2 2 5\nc3 3 6\n","language":"Stata"},{"code":": a=1,1i\n\n: a\n 1 2\n +-----------+\n 1 | 1 1i |\n +-----------+\n\n: a'\n 1\n +-------+\n 1 | 1 |\n 2 | -1i |\n +-------+\n\n: transposeonly(a)\n 1\n +------+\n 1 | 1 |\n 2 | 1i |\n +------+\n","language":"Stata"},{"code":"@inlinable\npublic func matrixTranspose<T>(_ matrix: [[T]]) -> [[T]] {\n guard !matrix.isEmpty else {\n return []\n }\n\n var ret = Array(repeating: [T](), count: matrix[0].count)\n\n for row in matrix {\n for j in 0..<row.count {\n ret[j].append(row[j])\n }\n }\n\n return ret\n}\n\n@inlinable\npublic func printMatrix<T>(_ matrix: [[T]]) {\n guard !matrix.isEmpty else {\n print()\n\n return\n }\n\n let rows = matrix.count\n let cols = matrix[0].count\n\n for i in 0..<rows {\n for j in 0..<cols {\n print(matrix[i][j], terminator: \" \")\n }\n\n print()\n }\n}\n\nlet m1 = [\n [1, 2, 3],\n [4, 5, 6]\n]\n\nprint(\"Input:\")\nprintMatrix(m1)\n\n\nlet m2 = matrixTranspose(m1)\n\nprint(\"Output:\")\nprintMatrix(m2)\n","language":"Swift"},{"code":"templates transpose\n def a: $;\n [1..$a(1)::length -> $a(1..last;$)] !\nend transpose\n\ntemplates printMatrix&{w:}\n templates formatN\n @: [];\n $ -> #\n '$@ -> $::length~..$w -> ' ';$@(last..1:-1)...;' !\n when <1..> do ..|@: $ mod 10; $ ~/ 10 -> #\n end formatN\n $... -> '|$(1) -> formatN;$(2..last)... -> ', $ -> formatN;';|\n' !\nend printMatrix\n\ndef m: [[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12]];\n'before:\n' -> !OUT::write\n$m -> printMatrix&{w:2} -> !OUT::write\n\ndef mT: $m -> transpose;\n'\ntransposed:\n' -> !OUT::write\n$mT -> printMatrix&{w:2} -> !OUT::write\n","language":"Tailspin"},{"code":"package require Tcl 8.5\nnamespace path ::tcl::mathfunc\n\nproc size {m} {\n set rows [llength $m]\n set cols [llength [lindex $m 0]]\n return [list $rows $cols]\n}\nproc transpose {m} {\n lassign [size $m] rows cols\n set new [lrepeat $cols [lrepeat $rows \"\"]]\n for {set i 0} {$i < $rows} {incr i} {\n for {set j 0} {$j < $cols} {incr j} {\n lset new $j $i [lindex $m $i $j]\n }\n }\n return $new\n}\nproc print_matrix {m {fmt \"%.17g\"}} {\n set max [widest $m $fmt]\n lassign [size $m] rows cols\n for {set i 0} {$i < $rows} {incr i} {\n for {set j 0} {$j < $cols} {incr j} {\n\t set s [format $fmt [lindex $m $i $j]]\n puts -nonewline [format \"%*s \" [lindex $max $j] $s]\n }\n puts \"\"\n }\n}\nproc widest {m {fmt \"%.17g\"}} {\n lassign [size $m] rows cols\n set max [lrepeat $cols 0]\n for {set i 0} {$i < $rows} {incr i} {\n for {set j 0} {$j < $cols} {incr j} {\n\t set s [format $fmt [lindex $m $i $j]]\n lset max $j [max [lindex $max $j] [string length $s]]\n }\n }\n return $max\n}\n\nset m {{1 1 1 1} {2 4 8 16} {3 9 27 81} {4 16 64 256} {5 25 125 625}}\nprint_matrix $m \"%d\"\nprint_matrix [transpose $m] \"%d\"\n","language":"Tcl"},{"code":"package require struct::matrix\nstruct::matrix M\nM deserialize {5 4 {{1 1 1 1} {2 4 8 16} {3 9 27 81} {4 16 64 256} {5 25 125 625}}}\nM format 2string\nM transpose\nM format 2string\n","language":"Tcl"},{"code":"OPTION BASE 0\nDIM matriz(3, 4)\nDATA 78, 19, 30, 12, 36\nDATA 49, 10, 65, 42, 50\nDATA 30, 93, 24, 78, 10\nDATA 39, 68, 27, 64, 29\n\nFOR f = 0 TO 3\n FOR c = 0 TO 4\n READ matriz(f, c)\n NEXT c\nNEXT f\n\nDIM mtranspuesta(0 TO 4, 0 TO 3)\n\nFOR fila = LBOUND(matriz,1) TO UBOUND(matriz,1)\n FOR columna = LBOUND(matriz,2) TO UBOUND(matriz,2)\n LET mtranspuesta(columna, fila) = matriz(fila, columna)\n PRINT matriz(fila, columna);\n NEXT columna\n PRINT\nNEXT fila\nPRINT\n\nFOR fila = LBOUND(mtranspuesta,1) TO UBOUND(mtranspuesta,1)\n FOR columna = LBOUND(mtranspuesta,2) TO UBOUND(mtranspuesta,2)\n PRINT mtranspuesta(fila, columna);\n NEXT columna\n PRINT\nNEXT fila\nEND\n","language":"True-BASIC"},{"code":"#cast %eLL\n\nexample =\n\n~&K7 <\n <1.,2.,3.,4.>,\n <5.,6.,7.,8.>,\n <9.,10.,11.,12.>>\n","language":"Ursala"},{"code":"Function transpose(m As Variant) As Variant\n transpose = WorksheetFunction.transpose(m)\nEnd Function\n","language":"VBA"},{"code":"'create and display the initial matrix\nWScript.StdOut.WriteLine \"Initial Matrix:\"\nx = 4 : y = 6 : n = 1\nDim matrix()\nReDim matrix(x,y)\nFor i = 0 To y\n\tFor j = 0 To x\n\t\tmatrix(j,i) = n\n\t\tIf j < x Then\n\t\t\tWScript.StdOut.Write n & vbTab\n\t\tElse\n\t\t\tWScript.StdOut.Write n\n\t\tEnd If\n\t\tn = n + 1\n\tNext\n\tWScript.StdOut.WriteLine\nNext\n\n'display the trasposed matrix\nWScript.StdOut.WriteBlankLines(1)\nWScript.StdOut.WriteLine \"Transposed Matrix:\"\nFor i = 0 To x\n\tFor j = 0 To y\n\t\tIf j < y Then\n\t\t\tWScript.StdOut.Write matrix(i,j) & vbTab\n\t\tElse\n\t\t\tWScript.StdOut.Write matrix(i,j)\n\t\tEnd If\n\tNext\n\tWScript.StdOut.WriteLine\nNext\n","language":"VBScript"},{"code":"Option Explicit\n'----------------------------------------------------------------------\nFunction TransposeMatrix(InitMatrix() As Long, TransposedMatrix() As Long)\nDim l1 As Long, l2 As Long, u1 As Long, u2 As Long, r As Long, c As Long\n l1 = LBound(InitMatrix, 1)\n l2 = LBound(InitMatrix, 2)\n u1 = UBound(InitMatrix, 1)\n u2 = UBound(InitMatrix, 2)\n ReDim TransposedMatrix(l2 To u2, l1 To u1)\n For r = l1 To u1\n For c = l2 To u2\n TransposedMatrix(c, r) = InitMatrix(r, c)\n Next c\n Next r\nEnd Function\n'----------------------------------------------------------------------\nSub PrintMatrix(a() As Long)\nDim l1 As Long, l2 As Long, u1 As Long, u2 As Long, r As Long, c As Long\nDim s As String * 8\n l1 = LBound(a(), 1)\n l2 = LBound(a(), 2)\n u1 = UBound(a(), 1)\n u2 = UBound(a(), 2)\n For r = l1 To u1\n For c = l2 To u2\n RSet s = Str$(a(r, c))\n Debug.Print s;\n Next c\n Debug.Print\n Next r\nEnd Sub\n'----------------------------------------------------------------------\nSub TranspositionDemo(ByVal DimSize1 As Long, ByVal DimSize2 As Long)\nDim r, c, cc As Long\nDim a() As Long\nDim b() As Long\n cc = DimSize2\n DimSize1 = DimSize1 - 1\n DimSize2 = DimSize2 - 1\n ReDim a(0 To DimSize1, 0 To DimSize2)\n For r = 0 To DimSize1\n For c = 0 To DimSize2\n a(r, c) = (cc * r) + c + 1\n Next c\n Next r\n Debug.Print \"initial matrix:\"\n PrintMatrix a()\n TransposeMatrix a(), b()\n Debug.Print \"transposed matrix:\"\n PrintMatrix b()\nEnd Sub\n'----------------------------------------------------------------------\nSub Main()\n TranspositionDemo 3, 3\n TranspositionDemo 3, 7\nEnd Sub\n","language":"Visual-Basic"},{"code":"@zipm [[1 2 3] [4 5 6] [7 8 9]]\n","language":"Wortel"},{"code":"import \"./matrix\" for Matrix\nimport \"./fmt\" for Fmt\n\nvar m = Matrix.new([\n [ 1, 2, 3],\n [ 4, 5, 6],\n [ 7, 8, 9],\n [10, 11, 12]\n])\n\nSystem.print(\"Original:\\n\")\nFmt.mprint(m, 2, 0)\nSystem.print(\"\\nTransposed:\\n\")\nFmt.mprint(m.transpose, 2, 0)\n","language":"Wren"},{"code":"proc Transpose(M, R, C, N); \\Transpose matrix M to N\nint M, R, C, N; \\rows and columns\nint I, J;\n[for I:= 0 to R-1 do\n for J:= 0 to C-1 do\n N(J,I):= M(I,J);\n];\n\nproc ShowMat(M, R, C); \\Display matrix M\nint M, R, C; \\rows and columns\nint I, J;\n[for I:= 0 to R-1 do\n [for J:= 0 to C-1 do\n RlOut(0, float(M(I,J)));\n CrLf(0);\n ];\n];\n\nint M, N(4,3);\n[M:= [[1, 2, 3, 4], \\3 rows by 4 columns\n [5, 6, 7, 8],\n [9,10,11,12]];\nFormat(4, 0);\nShowMat(M, 3, 4);\nCrLf(0);\nTranspose(M, 3, 4, N);\nShowMat(N, 4, 3);\n]\n","language":"XPL0"},{"code":"dim matriz(4,5)\ndim mtranspuesta(5,4)\n\nfor fila = 1 to arraysize(matriz(), 1)\n for columna = 1 to arraysize(matriz(), 2)\n\t read matriz(fila, columna)\n\t\tprint matriz(fila, columna);\n\t\tmtranspuesta(columna, fila) = matriz(fila, columna)\n\tnext columna\n\tprint\nnext fila\nprint\n\nfor fila = 1 to arraysize(mtranspuesta(), 1)\n for columna = 1 to arraysize(mtranspuesta(), 2)\n\t\tprint mtranspuesta(fila, columna);\n next columna\n\tprint\nnext fila\nend\n\ndata 78,19,30,12,36\ndata 49,10,65,42,50\ndata 30,93,24,78,10\ndata 39,68,27,64,29\n","language":"Yabasic"},{"code":"var [const] GSL=Import(\"zklGSL\");\t// libGSL (GNU Scientific Library)\nGSL.Matrix(2,3).set(1,2,3, 4,5,6).transpose().format(5).println(); // in place\nprintln(\"---\");\nGSL.Matrix(2,2).set(1,2, 3,4).transpose().format(5).println(); // in place\nprintln(\"---\");\nGSL.Matrix(3,1).set(1,2,3).transpose().format(5).println(); // in place\n","language":"Zkl"},{"code":"fcn transpose(M){\n if(M.len()==1) M[0].pump(List,List.create); // 1 row --> n columns\n else M[0].zip(M.xplode(1));\n}\n","language":"Zkl"},{"code":"m:=T(T(1,2,3),T(4,5,6)); transpose(m).println();\nm:=L(L(1,\"a\"),L(2,\"b\"),L(3,\"c\")); transpose(m).println();\ntranspose(L(L(1,2,3))).println();\ntranspose(L(L(1),L(2),L(3))).println();\ntranspose(L(L(1))).println();\n","language":"Zkl"},{"code":"module MatrixOps;\ntype\n\tMatrix = array {math} *,* of integer;\n\n\n\tprocedure WriteMatrix(x: array {math} *,* of integer);\n\tvar\n\t\ti,j: integer;\n\tbegin\n\t\tfor i := 0 to len(x,0) - 1 do\n\t\t\tfor j := 0 to len(x,1) - 1 do\n\t\t\t\twrite(x[i,j]);\n\t\t\tend;\n\t\t\twriteln;\n\t\tend\t\n\tend WriteMatrix;\n\n\tprocedure Transposition;\n\tvar\n\t\tm,x: Matrix;\n\tbegin\n\t\tm := [[1,2,3],[3,4,5]]; (* matrix initialization *)\n\t\tx := !m; (* matrix trasposition *)\n\t\tWriteMatrix(x);\n\tend Transposition;\n\nbegin\n\tTransposition;\nend MatrixOps.\n","language":"Zonnon"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Matrix_transposition\\nnote: Matrices\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"[[wp:Transpose|Transpose]] an arbitrarily sized rectangular [[wp:Matrix (mathematics)|Matrix]].\\n<br><br>\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F transpose(&matrix)\\n V toRet = [[0] * matrix.len] * matrix[0].len\\n L(row) (0 .< matrix.len)\\n L(col) (0 .< matrix[row].len)\\n toRet[col][row] = matrix[row][col]\\n R toRet\\n\\nV m = [[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12]]\\nprint(\\\"Original\\\")\\nprint(m)\\nprint(\\\"After Transposition\\\")\\nprint(transpose(&m))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"...\\nKN EQU 3\\nKM EQU 5\\nN DC AL2(KN)\\nM DC AL2(KM)\\nA DS (KN*KM)F matrix a(n,m)\\nB DS (KM*KN)F matrix b(m,n)\\n...\\n* b(j,i)=a(i,j)\\n* transposition using Horner's formula\\n LA R4,0 i,from 1\\n LA R7,KN to n\\n LA R6,1 step 1\\nLOOPI BXH R4,R6,ELOOPI do i=1 to n\\n LA R5,0 j,from 1\\n LA R9,KM to m\\n LA R8,1 step 1\\nLOOPJ BXH R5,R8,ELOOPJ do j=1 to m\\n LR R1,R4 i\\n BCTR R1,0 i-1\\n MH R1,M (i-1)*m\\n LR R2,R5 j\\n BCTR R2,0 j-1\\n AR R1,R2 r1=(i-1)*m+(j-1)\\n SLA R1,2 r1=((i-1)*m+(j-1))*itemlen\\n L R0,A(R1) r0=a(i,j)\\n LR R1,R5 j\\n BCTR R1,0 j-1\\n MH R1,N (j-1)*n\\n LR R2,R4 i\\n BCTR R2,0 i-1\\n AR R1,R2 r1=(j-1)*n+(i-1)\\n SLA R1,2 r1=((j-1)*n+(i-1))*itemlen\\n ST R0,B(R1) b(j,i)=r0\\n B LOOPJ next j\\nELOOPJ EQU * out of loop j\\n B LOOPI next i\\nELOOPI EQU * out of loop i\\n...\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"Transpose2DArray_B:\\n\\t;INPUT:\\n\\t;A0 = POINTER TO SOURCE ARRAY\\n\\t;A1 = POINTER TO BACKUP AREA\\n\\t;\\t(YOU NEED THE SAME AMOUNT OF FREE SPACE AS THE SOURCE ARRAY.)\\n\\t;\\t(IT'S YOUR RESPONSIBILITY TO KNOW WHERE THAT IS.)\\n\\t;D0.W = ARRAY ROW LENGTH-1\\n ;D1.W = ARRAY COLUMN HEIGHT-1\\n\\n\\tMOVEM.L D2-D7,-(SP)\\n\\t\\tMOVE.W D0,D4\\t;width - this copy is our loop counter\\n\\n.outerloop:\\n\\t\\tMOVE.W D1,D7\\t;height\\n\\t\\tMOVEQ.L #0,D3\\n\\t\\tMOVE.W D0,D6\\t;width - this copy is used to offset the array\\n\\t\\tADDQ.L #1,D6\\n\\n.innerloop:\\n\\t\\tMOVE.B (A0,D3),(A1)+\\n\\t\\tADD.W D6,D3\\n\\t\\tDBRA D7,.innerloop\\n\\n\\t\\tADDA.L #1,A0\\n\\t\\tDBRA D4,.outerloop\\n\\n\\tMOVEM.L (SP)+,D2-D7\\n\\tRTS\\n\",\n \"language\": \"68000-Assembly\"\n },\n {\n \"code\": \"(defun cons-each (xs xss)\\n (if (or (endp xs) (endp xss))\\n nil\\n (cons (cons (first xs) (first xss))\\n (cons-each (rest xs) (rest xss)))))\\n\\n(defun list-each (xs)\\n (if (endp xs)\\n nil\\n (cons (list (first xs))\\n (list-each (rest xs)))))\\n\\n(defun transpose-list (xss)\\n (if (endp (rest xss))\\n (list-each (first xss))\\n (cons-each (first xss)\\n (transpose-list (rest xss)))))\\n\",\n \"language\": \"ACL2\"\n },\n {\n \"code\": \"DEFINE PTR=\\\"CARD\\\"\\n\\nTYPE Matrix=[\\n BYTE width,height\\n PTR data] ;BYTE ARRAY\\n\\nPROC PrintB2(BYTE b)\\n IF b<10 THEN Put(32) FI\\n PrintB(b)\\nRETURN\\n\\nPROC PrintMatrix(Matrix POINTER m)\\n BYTE i,j\\n BYTE ARRAY d\\n\\n d=m.data\\n FOR j=0 TO m.height-1\\n DO\\n FOR i=0 TO m.width-1\\n DO\\n PrintB2(d(j*m.width+i)) Put(32)\\n OD\\n PutE()\\n OD\\nRETURN\\n\\nPROC Create(MATRIX POINTER m BYTE w,h BYTE ARRAY a)\\n m.width=w\\n m.height=h\\n m.data=a\\nRETURN\\n\\nPROC Transpose(Matrix POINTER in,out)\\n BYTE i,j\\n BYTE ARRAY din,dout\\n\\n din=in.data\\n dout=out.data\\n out.width=in.height\\n out.height=in.width\\n FOR j=0 TO in.height-1\\n DO\\n FOR i=0 TO in.width-1\\n DO\\n dout(i*out.width+j)=din(j*in.width+i)\\n OD\\n OD\\nRETURN\\n\\nPROC Main()\\n MATRIX in,out\\n BYTE ARRAY din(35),dout(35)\\n BYTE i\\n\\n FOR i=0 TO 34\\n DO\\n din(i)=i\\n OD\\n Create(in,7,5,din)\\n Create(out,0,0,dout)\\n Transpose(in,out)\\n\\n PrintE(\\\"Input:\\\")\\n PrintMatrix(in)\\n PutE() PrintE(\\\"Transpose:\\\")\\n PrintMatrix(out)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"function transpose( m:Array):Array\\n{\\n\\t//Assume each element in m is an array. (If this were production code, use typeof to be sure)\\n\\n\\t//Each element in m is a row, so this gets the length of a row in m,\\n\\t//which is the same as the number of rows in m transpose.\\n\\tvar mTranspose = new Array(m[0].length);\\n\\tfor(var i:uint = 0; i < mTranspose.length; i++)\\n\\t{\\n //create a row\\n\\t\\tmTranspose[i] = new Array(m.length);\\n //set the row to the appropriate values\\n\\t\\tfor(var j:uint = 0; j < mTranspose[i].length; j++)\\n\\t\\t\\tmTranspose[i][j] = m[j][i];\\n\\t}\\n\\treturn mTranspose;\\n}\\nvar m:Array = [[1, 2, 3, 10],\\n\\t [4, 5, 6, 11],\\n\\t [7, 8, 9, 12]];\\nvar M:Array = transpose(m);\\nfor(var i:uint = 0; i < M.length; i++)\\n\\ttrace(M[i]);\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"with Ada.Numerics.Real_Arrays; use Ada.Numerics.Real_Arrays;\\nwith Ada.Text_IO; use Ada.Text_IO;\\n\\nprocedure Matrix_Transpose is\\n procedure Put (X : Real_Matrix) is\\n type Fixed is delta 0.01 range -500.0..500.0;\\n begin\\n for I in X'Range (1) loop\\n for J in X'Range (2) loop\\n Put (Fixed'Image (Fixed (X (I, J))));\\n end loop;\\n New_Line;\\n end loop;\\n end Put;\\n\\n Matrix : constant Real_Matrix :=\\n ( (0.0, 0.1, 0.2, 0.3),\\n (0.4, 0.5, 0.6, 0.7),\\n (0.8, 0.9, 1.0, 1.1)\\n );\\nbegin\\n Put_Line (\\\"Before Transposition:\\\");\\n Put (Matrix);\\n New_Line;\\n Put_Line (\\\"After Transposition:\\\");\\n Put (Transpose (Matrix));\\nend Matrix_Transpose;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"module Matrix where\\n\\nopen import Data.Nat\\nopen import Data.Vec\\n\\nMatrix : (A : Set) → ℕ → ℕ → Set\\nMatrix A m n = Vec (Vec A m) n\\n\\ntranspose : ∀ {A m n} → Matrix A m n → Matrix A n m\\ntranspose [] = replicate []\\ntranspose (xs ∷ xss) = zipWith _∷_ xs (transpose xss)\\n\\na = (1 ∷ 2 ∷ 3 ∷ []) ∷ (4 ∷ 5 ∷ 6 ∷ []) ∷ []\\nb = transpose a\\n\",\n \"language\": \"Agda\"\n },\n {\n \"code\": \"(1 ∷ 4 ∷ []) ∷ (2 ∷ 5 ∷ []) ∷ (3 ∷ 6 ∷ []) ∷ []\\n\",\n \"language\": \"Agda\"\n },\n {\n \"code\": \"main:(\\n\\n [,]REAL m=((1, 1, 1, 1),\\n (2, 4, 8, 16),\\n (3, 9, 27, 81),\\n (4, 16, 64, 256),\\n (5, 25,125, 625));\\n\\n OP ZIP = ([,]REAL in)[,]REAL:(\\n [2 LWB in:2 UPB in,1 LWB in:1UPB in]REAL out;\\n FOR i FROM LWB in TO UPB in DO\\n out[,i]:=in[i,]\\n OD;\\n out\\n );\\n\\n PROC pprint = ([,]REAL m)VOID:(\\n FORMAT real fmt = $g(-6,2)$; # width of 6, with no '+' sign, 2 decimals #\\n FORMAT vec fmt = $\\\"(\\\"n(2 UPB m-1)(f(real fmt)\\\",\\\")f(real fmt)\\\")\\\"$;\\n FORMAT matrix fmt = $x\\\"(\\\"n(UPB m-1)(f(vec fmt)\\\",\\\"lxx)f(vec fmt)\\\");\\\"$;\\n # finally print the result #\\n printf((matrix fmt,m))\\n );\\n\\n printf(($x\\\"Transpose:\\\"l$));\\n pprint((ZIP m))\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include<hopper.h>\\n#proto showarraydata(_X_)\\nmain:\\n .stack 12\\n nCols=0, nRows=0,nDims=0\\n A=-1,{5,11} rand array(A),mulby(10),ceil,mov(A)\\n {\\\"ORIGINAL ARRAY :\\\\n\\\",A}\\n\\n _show array data(A)\\n\\n /* transpose */\\n TA=0,{nCols,nRows} nan array(TA)\\n Limit = nRows\\n {nRows}gthan(nCols) do{ Limit = nCols }\\n\\n for (i=1, {i} lethan (Limit), ++i)\\n [i,i:end]get(A), [i:end,i]put(TA)\\n [i:end,i]get(A), [i,i:end]put(TA)\\n next\\n clear mark\\n {\\\"ARRAY TRANSPOSE:\\\\n\\\",TA}println\\n _show array data(TA)\\nexit(0)\\n\\n.locals\\nshow array data(A)\\n {\\\"\\\\nSIZE ARRAY : \\\"},size=0,size(A),cpy(size),\\n dims(size,nDims)\\n rows(size,nRows)\\n cols(size,nCols)\\n {\\\"\\\\nDIMENSION = \\\",nDims,\\\"; ROWS = \\\",nRows,\\\"; COLS = \\\",nCols,\\\"\\\\n\\\"}, println\\nback\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \" 3 3⍴⍳10\\n1 2 3\\n4 5 6\\n7 8 9\\n ⍉ 3 3⍴⍳10\\n1 4 7\\n2 5 8\\n3 6 9\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"on run\\n transpose([[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]])\\n\\n --> {{1, 4, 7, 10}, {2, 5, 8, 11}, {3, 6, 9, 12}}\\nend run\\n\\non transpose(xss)\\n set lstTrans to {}\\n\\n repeat with iCol from 1 to length of item 1 of xss\\n set lstCol to {}\\n\\n repeat with iRow from 1 to length of xss\\n set end of lstCol to item iCol of item iRow of xss\\n end repeat\\n\\n set end of lstTrans to lstCol\\n end repeat\\n\\n return lstTrans\\nend transpose\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"------------------------ TRANSPOSE -----------------------\\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--------------------------- TEST -------------------------\\non run\\n transpose([[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]])\\n\\n --> {{1, 4, 7, 10}, {2, 5, 8, 11}, {3, 6, 9, 12}}\\nend run\\n\\n\\n-------------------- GENERIC FUNCTIONS -------------------\\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-- 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 \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{{1, 4, 7, 10}, {2, 5, 8, 11}, {3, 6, 9, 12}}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"transpose: function [a][\\n X: size a\\n Y: size first a\\n result: array.of: @[Y X] 0\\n\\n loop 0..X-1 'i [\\n loop 0..Y-1 'j [\\n result\\\\[j]\\\\[i]: a\\\\[i]\\\\[j]\\n ]\\n ]\\n return result\\n]\\n\\narr: [\\n [ 0 1 2 3 4 ]\\n [ 5 6 7 8 9 ]\\n [ 1 0 0 0 42 ]\\n]\\n\\nloop arr 'row -> print row\\nprint \\\"-------------\\\"\\nloop transpose arr 'row -> print row\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"a = a\\nm = 10\\nn = 10\\nLoop, 10\\n{\\n i := A_Index - 1\\n Loop, 10\\n {\\n j := A_Index - 1\\n %a%%i%%j% := i - j\\n }\\n}\\nbefore := matrix_print(\\\"a\\\", m, n)\\ntranspose(\\\"a\\\", m, n)\\nafter := matrix_print(\\\"a\\\", m, n)\\nMsgBox % before . \\\"`ntransposed:`n\\\" . after\\nReturn\\n\\ntranspose(a, m, n)\\n{\\n Local i, j, row, matrix\\n Loop, % m\\n {\\n i := A_Index - 1\\n Loop, % n\\n {\\n j := A_Index - 1\\n temp%i%%j% := %a%%j%%i%\\n }\\n }\\n Loop, % m\\n {\\n i := A_Index - 1\\n Loop, % n\\n {\\n j := A_Index - 1\\n %a%%i%%j% := temp%i%%j%\\n }\\n }\\n}\\n\\nmatrix_print(a, m, n)\\n{\\n Local i, j, row, matrix\\n Loop, % m\\n {\\n i := A_Index - 1\\n row := \\\"\\\"\\n Loop, % n\\n {\\n j := A_Index - 1\\n row .= %a%%i%%j% . \\\",\\\"\\n }\\n StringTrimRight, row, row, 1\\n matrix .= row . \\\"`n\\\"\\n }\\n Return matrix\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"Transpose(M){\\n\\tR := []\\n\\tfor i, row in M\\n\\t\\tfor j, col in row\\n\\t\\t\\tR[j,i] := col\\n\\treturn R\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"Matrix := [[1,2,3],[4,5,6],[7,8,9],[10,11,12]]\\nMsgBox % \\t\\\"\\\"\\n\\t\\t. \\\"Original Matrix :`n\\\" \\t\\tPrint(Matrix)\\n\\t\\t. \\\"`nTransposed Matrix :`n\\\" \\tPrint(Transpose(Matrix))\\n\\nPrint(M){\\n\\tfor i, row in M\\n\\t\\tfor j, col in row\\n\\t\\t\\tRes .= (A_Index=1?\\\"\\\":\\\"`t\\\") col (Mod(A_Index,M[1].MaxIndex())?\\\"\\\":\\\"`n\\\")\\n\\treturn Trim(Res,\\\"`n\\\")\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f MATRIX_TRANSPOSITION.AWK filename\\n{ if (NF > nf) {\\n nf = NF\\n }\\n for (i=1; i<=nf; i++) {\\n row[i] = row[i] $i \\\" \\\"\\n }\\n}\\nEND {\\n for (i=1; i<=nf; i++) {\\n printf(\\\"%s\\\\n\\\",row[i])\\n }\\n exit(0)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"# Usage: GAWK -f MATRIX_TRANSPOSITION.AWK filename\\n{\\n i = NR\\n for (j = 1; j <= NF; j++) {\\n a[i,j] = $j\\n }\\n ranka1 = i\\n ranka2 = max(ranka2, NF)\\n}\\nEND {\\n rankb1 = ranka2\\n rankb2 = ranka1\\n b[rankb1, rankb2] = 0\\n transpose_matrix(b, a)\\n for (i = 1; i <= rankb1; i++) {\\n for (j = 1; j <= rankb2; j++) {\\n printf(\\\"%g%c\\\", b[i,j], j < rankb2 ? \\\" \\\" : \\\"\\\\n\\\");\\n }\\n }\\n}\\nfunction transpose_matrix(target, source, key, idx) {\\n for (key in source) {\\n split(key, idx, SUBSEP)\\n target[idx[2], idx[1]] = source[idx[1], idx[2]]\\n }\\n}\\nfunction max(m, n) {\\n return m > n ? m : n\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"arraybase 1\\ndim matriz= {{78,19,30,12,36}, {49,10,65,42,50}, {30,93,24,78,10}, {39,68,27,64,29}}\\ndim mtranspuesta(matriz[,?], matriz[?,])\\n\\nfor fila = 1 to matriz[?,]\\n for columna = 1 to matriz[,?]\\n\\t\\tprint matriz[fila, columna]; \\\" \\\";\\n\\t\\tmtranspuesta[columna, fila] = matriz[fila, columna]\\n\\tnext columna\\n\\tprint\\nnext fila\\nprint\\n\\nfor fila = 1 to mtranspuesta[?,]\\n for columna = 1 to mtranspuesta[,?]\\n\\t\\tprint mtranspuesta[fila, columna]; \\\" \\\";\\n next columna\\n\\tprint\\nnext fila\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \" INSTALL @lib$+\\\"ARRAYLIB\\\"\\n\\n DIM matrix(3,4), transpose(4,3)\\n matrix() = 78,19,30,12,36,49,10,65,42,50,30,93,24,78,10,39,68,27,64,29\\n\\n PROC_transpose(matrix(), transpose())\\n\\n FOR row% = 0 TO DIM(matrix(),1)\\n FOR col% = 0 TO DIM(matrix(),2)\\n PRINT ;matrix(row%,col%) \\\" \\\";\\n NEXT\\n PRINT\\n NEXT row%\\n\\n PRINT\\n\\n FOR row% = 0 TO DIM(transpose(),1)\\n FOR col% = 0 TO DIM(transpose(),2)\\n PRINT ;transpose(row%,col%) \\\" \\\";\\n NEXT\\n PRINT\\n NEXT row%\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \" 3‿3⥊↕9\\n┌─\\n╵ 0 1 2\\n 3 4 5\\n 6 7 8\\n ┘\\n ⍉3‿3⥊↕9\\n┌─\\n╵ 0 3 6\\n 1 4 7\\n 2 5 8\\n ┘\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"blsq ) {{78 19 30 12 36}{49 10 65 42 50}{30 93 24 78 10}{39 68 27 64 29}}tpsp\\n78 49 30 39\\n19 10 93 68\\n30 65 24 27\\n12 42 78 64\\n36 50 10 29\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nvoid transpose(void *dest, void *src, int src_h, int src_w)\\n{\\n\\tint i, j;\\n\\tdouble (*d)[src_h] = dest, (*s)[src_w] = src;\\n\\tfor (i = 0; i < src_h; i++)\\n\\t\\tfor (j = 0; j < src_w; j++)\\n\\t\\t\\td[j][i] = s[i][j];\\n}\\n\\nint main()\\n{\\n\\tint i, j;\\n\\tdouble a[3][5] = {{ 0, 1, 2, 3, 4 },\\n\\t\\t\\t { 5, 6, 7, 8, 9 },\\n\\t\\t\\t { 1, 0, 0, 0, 42}};\\n\\tdouble b[5][3];\\n\\ttranspose(b, a, 3, 5);\\n\\n\\tfor (i = 0; i < 5; i++)\\n\\t\\tfor (j = 0; j < 3; j++)\\n\\t\\t\\tprintf(\\\"%g%c\\\", b[i][j], j == 2 ? '\\\\n' : ' ');\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nvoid transpose(double *m, int w, int h)\\n{\\n\\tint start, next, i;\\n\\tdouble tmp;\\n\\n\\tfor (start = 0; start <= w * h - 1; start++) {\\n\\t\\tnext = start;\\n\\t\\ti = 0;\\n\\t\\tdo {\\ti++;\\n\\t\\t\\tnext = (next % h) * w + next / h;\\n\\t\\t} while (next > start);\\n\\t\\tif (next < start || i == 1) continue;\\n\\n\\t\\ttmp = m[next = start];\\n\\t\\tdo {\\n\\t\\t\\ti = (next % h) * w + next / h;\\n\\t\\t\\tm[next] = (i == start) ? tmp : m[i];\\n\\t\\t\\tnext = i;\\n\\t\\t} while (next > start);\\n\\t}\\n}\\n\\nvoid show_matrix(double *m, int w, int h)\\n{\\n\\tint i, j;\\n\\tfor (i = 0; i < h; i++) {\\n\\t\\tfor (j = 0; j < w; j++)\\n\\t\\t\\tprintf(\\\"%2g \\\", m[i * w + j]);\\n\\t\\tputchar('\\\\n');\\n\\t}\\n}\\n\\nint main(void)\\n{\\n\\tint i;\\n\\tdouble m[15];\\n\\tfor (i = 0; i < 15; i++) m[i] = i + 1;\\n\\n\\tputs(\\\"before transpose:\\\");\\n\\tshow_matrix(m, 3, 5);\\n\\n\\ttranspose(m, 3, 5);\\n\\n\\tputs(\\\"\\\\nafter transpose:\\\");\\n\\tshow_matrix(m, 5, 3);\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <boost/numeric/ublas/matrix.hpp>\\n#include <boost/numeric/ublas/io.hpp>\\n\\nint main()\\n{\\n using namespace boost::numeric::ublas;\\n\\n matrix<double> m(3,3);\\n\\n for(int i=0; i!=m.size1(); ++i)\\n for(int j=0; j!=m.size2(); ++j)\\n m(i,j)=3*i+j;\\n\\n std::cout << trans(m) << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <iostream>\\n#include \\\"matrix.h\\\"\\n\\n#if !defined(ARRAY_SIZE)\\n #define ARRAY_SIZE(x) (sizeof((x)) / sizeof((x)[0]))\\n#endif\\n\\ntemplate<class T>\\nvoid printMatrix(const Matrix<T>& m) {\\n std::cout << \\\"rows = \\\" << m.rowNum() << \\\" columns = \\\" << m.colNum() << std::endl;\\n for (unsigned int i = 0; i < m.rowNum(); i++) {\\n for (unsigned int j = 0; j < m.colNum(); j++) {\\n std::cout << m[i][j] << \\\" \\\";\\n }\\n std::cout << std::endl;\\n }\\n} /* printMatrix() */\\n\\nint main() {\\n int am[2][3] = {\\n {1,2,3},\\n {4,5,6},\\n };\\n\\n Matrix<int> a(ARRAY_SIZE(am), ARRAY_SIZE(am[0]), am[0], ARRAY_SIZE(am)*ARRAY_SIZE(am[0]));\\n\\n try {\\n std::cout << \\\"Before transposition:\\\" << std::endl;\\n printMatrix(a);\\n std::cout << std::endl;\\n a.transpose();\\n std::cout << \\\"After transposition:\\\" << std::endl;\\n printMatrix(a);\\n } catch (MatrixException& e) {\\n std::cerr << e.message() << std::endl;\\n return e.errorCode();\\n }\\n\\n} /* main() */\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#ifndef _MATRIX_H\\n#define\\t_MATRIX_H\\n\\n#include <sstream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n\\n#define MATRIX_ERROR_CODE_COUNT 5\\n#define MATRIX_ERR_UNDEFINED \\\"1 Undefined exception!\\\"\\n#define MATRIX_ERR_WRONG_ROW_INDEX \\\"2 The row index is out of range.\\\"\\n#define MATRIX_ERR_MUL_ROW_AND_COL_NOT_EQUAL \\\"3 The row number of second matrix must be equal with the column number of first matrix!\\\"\\n#define MATRIX_ERR_MUL_ROW_AND_COL_BE_GREATER_THAN_ZERO \\\"4 The number of rows and columns must be greater than zero!\\\"\\n#define MATRIX_ERR_TOO_FEW_DATA \\\"5 Too few data in matrix.\\\"\\n\\nclass MatrixException {\\nprivate:\\n std::string message_;\\n int errorCode_;\\npublic:\\n MatrixException(std::string message = MATRIX_ERR_UNDEFINED);\\n\\n inline std::string message() {\\n return message_;\\n };\\n\\n inline int errorCode() {\\n return errorCode_;\\n };\\n};\\n\\nMatrixException::MatrixException(std::string message) {\\n errorCode_ = MATRIX_ERROR_CODE_COUNT + 1;\\n std::stringstream ss(message);\\n ss >> errorCode_;\\n if (errorCode_ < 1) {\\n errorCode_ = MATRIX_ERROR_CODE_COUNT + 1;\\n }\\n std::string::size_type pos = message.find(' ');\\n if (errorCode_ <= MATRIX_ERROR_CODE_COUNT && pos != std::string::npos) {\\n message_ = message.substr(pos + 1);\\n } else {\\n message_ = message + \\\" (This an unknown and unsupported exception!)\\\";\\n }\\n}\\n\\n/**\\n * Generic class for matrices.\\n */\\ntemplate <class T>\\nclass Matrix {\\nprivate:\\n std::vector<T> v; // the data of matrix\\n unsigned int m; // the number of rows\\n unsigned int n; // the number of columns\\nprotected:\\n\\n virtual void clear() {\\n v.clear();\\n m = n = 0;\\n }\\npublic:\\n\\n Matrix() {\\n clear();\\n }\\n Matrix(unsigned int, unsigned int, T* = 0, unsigned int = 0);\\n Matrix(unsigned int, unsigned int, const std::vector<T>&);\\n\\n virtual ~Matrix() {\\n clear();\\n }\\n Matrix& operator=(const Matrix&);\\n std::vector<T> operator[](unsigned int) const;\\n Matrix operator*(const Matrix&);\\n void transpose();\\n\\n inline unsigned int rowNum() const {\\n return m;\\n }\\n\\n inline unsigned int colNum() const {\\n return n;\\n }\\n\\n inline unsigned int size() const {\\n return v.size();\\n }\\n\\n inline void add(const T& t) {\\n v.push_back(t);\\n }\\n};\\n\\ntemplate <class T>\\nMatrix<T>::Matrix(unsigned int row, unsigned int col, T* data, unsigned int dataLength) {\\n clear();\\n if (row > 0 && col > 0) {\\n m = row;\\n n = col;\\n unsigned int mxn = m * n;\\n if (dataLength && data) {\\n for (unsigned int i = 0; i < dataLength && i < mxn; i++) {\\n v.push_back(data[i]);\\n }\\n }\\n }\\n}\\n\\ntemplate <class T>\\nMatrix<T>::Matrix(unsigned int row, unsigned int col, const std::vector<T>& data) {\\n clear();\\n if (row > 0 && col > 0) {\\n m = row;\\n n = col;\\n unsigned int mxn = m * n;\\n if (data.size() > 0) {\\n for (unsigned int i = 0; i < mxn && i < data.size(); i++) {\\n v.push_back(data[i]);\\n }\\n }\\n }\\n}\\n\\ntemplate<class T>\\nMatrix<T>& Matrix<T>::operator=(const Matrix<T>& other) {\\n clear();\\n if (other.m > 0 && other.n > 0) {\\n m = other.m;\\n n = other.n;\\n unsigned int mxn = m * n;\\n for (unsigned int i = 0; i < mxn && i < other.size(); i++) {\\n v.push_back(other.v[i]);\\n }\\n }\\n return *this;\\n}\\n\\ntemplate<class T>\\nstd::vector<T> Matrix<T>::operator[](unsigned int index) const {\\n std::vector<T> result;\\n if (index >= m) {\\n throw MatrixException(MATRIX_ERR_WRONG_ROW_INDEX);\\n } else if ((index + 1) * n > size()) {\\n throw MatrixException(MATRIX_ERR_TOO_FEW_DATA);\\n } else {\\n unsigned int begin = index * n;\\n unsigned int end = begin + n;\\n for (unsigned int i = begin; i < end; i++) {\\n result.push_back(v[i]);\\n }\\n }\\n return result;\\n}\\n\\ntemplate<class T>\\nMatrix<T> Matrix<T>::operator*(const Matrix<T>& other) {\\n Matrix result(m, other.n);\\n if (n != other.m) {\\n throw MatrixException(MATRIX_ERR_MUL_ROW_AND_COL_NOT_EQUAL);\\n } else if (m <= 0 || n <= 0 || other.n <= 0) {\\n throw MatrixException(MATRIX_ERR_MUL_ROW_AND_COL_BE_GREATER_THAN_ZERO);\\n } else if (m * n > size() || other.m * other.n > other.size()) {\\n throw MatrixException(MATRIX_ERR_TOO_FEW_DATA);\\n } else {\\n for (unsigned int i = 0; i < m; i++) {\\n for (unsigned int j = 0; j < other.n; j++) {\\n T temp = v[i * n] * other.v[j];\\n for (unsigned int k = 1; k < n; k++) {\\n temp += v[i * n + k] * other.v[k * other.n + j];\\n }\\n result.v.push_back(temp);\\n }\\n }\\n }\\n return result;\\n}\\n\\ntemplate<class T>\\nvoid Matrix<T>::transpose() {\\n if (m * n > size()) {\\n throw MatrixException(MATRIX_ERR_TOO_FEW_DATA);\\n } else {\\n std::vector<T> v2;\\n std::swap(v, v2);\\n for (unsigned int i = 0; i < n; i++) {\\n for (unsigned int j = 0; j < m; j++) {\\n v.push_back(v2[j * n + i]);\\n }\\n }\\n std::swap(m, n);\\n }\\n}\\n\\n#endif\\t/* _MATRIX_H */\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <iostream>\\n\\nint main(){\\n const int l = 5;\\n const int w = 3;\\n int m1[l][w] = {{1,2,3}, {4,5,6}, {7,8,9}, {10,11,12}, {13,14,15}};\\n int m2[w][l];\\n\\n for(int i=0; i<w; i++){\\n for(int x=0; x<l; x++){\\n m2[i][x]=m1[x][i];\\n }\\n }\\n\\n // This is just output...\\n\\n std::cout << \\\"Before:\\\";\\n for(int i=0; i<l; i++){\\n std::cout << std::endl;\\n for(int x=0; x<w; x++){\\n std::cout << m1[i][x] << \\\" \\\";\\n }\\n }\\n\\n std::cout << \\\"\\\\n\\\\nAfter:\\\";\\n for(int i=0; i<w; i++){\\n std::cout << std::endl;\\n for(int x=0; x<l; x++){\\n std::cout << m2[i][x] << \\\" \\\";\\n }\\n }\\n\\n std::cout << std::endl;\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Text;\\n\\nnamespace prog\\n{\\n\\tclass MainClass\\n\\t{\\t\\t\\t\\t\\t\\t\\n\\t\\tpublic static void Main (string[] args)\\n\\t\\t{\\n\\t\\t\\tdouble[,] m = { {1,2,3},{4,5,6},{7,8,9} };\\n\\t\\t\\t\\n\\t\\t\\tdouble[,] t = Transpose( m );\\t\\n\\t\\t\\t\\n\\t\\t\\tfor( int i=0; i<t.GetLength(0); i++ )\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor( int j=0; j<t.GetLength(1); j++ )\\t\\t\\n\\t\\t\\t\\t\\tConsole.Write( t[i,j] + \\\" \\\" );\\n\\t\\t\\t\\tConsole.WriteLine(\\\"\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tpublic static double[,] Transpose( double[,] m )\\n\\t\\t{\\n\\t\\t\\tdouble[,] t = new double[m.GetLength(1),m.GetLength(0)];\\n\\t\\t\\tfor( int i=0; i<m.GetLength(0); i++ )\\n\\t\\t\\t\\tfor( int j=0; j<m.GetLength(1); j++ )\\n\\t\\t\\t\\t\\tt[j,i] = m[i,j];\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\treturn t;\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defmulti matrix-transpose\\n \\\"Switch rows with columns.\\\"\\n class)\\n\\n(defmethod matrix-transpose clojure.lang.PersistentList\\n [mtx]\\n (apply map list mtx))\\n\\n(defmethod matrix-transpose clojure.lang.PersistentVector\\n [mtx]\\n (apply mapv vector mtx))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"transpose = (matrix) ->\\n (t[i] for t in matrix) for i in [0...matrix[0].length]\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(defun transpose (m)\\n (apply #'mapcar #'list m))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \";; Transpose a mxn matrix A to a nxm matrix B=A'.\\n(defun mtp (A)\\n (let* ((m (array-dimension A 0))\\n (n (array-dimension A 1))\\n (B (make-array `(,n ,m) :initial-element 0)))\\n (loop for i from 0 below m do\\n (loop for j from 0 below n do\\n (setf (aref B j i)\\n (aref A i j))))\\n B))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.range;\\n\\n /*immutable*/ auto M = [[10, 11, 12, 13],\\n [14, 15, 16, 17],\\n [18, 19, 20, 21]];\\n writefln(\\\"%(%(%2d %)\\\\n%)\\\", M.transposed);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"T[][] transpose(T)(in T[][] m) pure nothrow {\\n auto r = new typeof(return)(m[0].length, m.length);\\n foreach (immutable nr, const row; m)\\n foreach (immutable nc, immutable c; row)\\n r[nc][nr] = c;\\n return r;\\n}\\n\\nvoid main() {\\n import std.stdio;\\n\\n immutable M = [[10, 11, 12, 13],\\n [14, 15, 16, 17],\\n [18, 19, 20, 21]];\\n writefln(\\\"%(%(%2d %)\\\\n%)\\\", M.transpose);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, std.algorithm, std.range, std.functional;\\n\\nauto transpose(T)(in T[][] m) pure nothrow {\\n return m[0].length.iota.map!(curry!(transversal, m));\\n}\\n\\nvoid main() {\\n immutable M = [[10, 11, 12, 13],\\n [14, 15, 16, 17],\\n [18, 19, 20, 21]];\\n writefln(\\\"%(%(%2d %)\\\\n%)\\\", M.transpose);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"proc transpose . m[][] .\\n len n[][] len m[1][]\\n for i to len n[][]\\n for j to len m[][]\\n n[i][] &= m[j][i]\\n .\\n .\\n swap n[][] m[][]\\n.\\nm[][] = [ [ 1 2 3 4 ] [ 5 6 7 8 ] [ 9 10 11 12 ] ]\\nprint m[][]\\nprint \\\"\\\"\\ntranspose m[][]\\nprint m[][]\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"(lib 'matrix)\\n\\n(define M (list->array (iota 6) 3 2))\\n(array-print M)\\n 0 1\\n 2 3\\n 4 5\\n(array-print (matrix-transpose M))\\n 0 2 4\\n 1 3 5\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \" [Demo of matrix transposition. Not in place, creates a new matrix.\\n EDSAC, Initial Orders 2.]\\n ..PZ [blank tape and terminator]\\n T 50 K [to call matrix transpose subroutine with 'G X']\\n P 200 F [address of matrix transpose subroutine]\\n T 47 K [to call matrix print subroutine with 'G M']\\n P 100 F [address of matrix print subroutine]\\n T 46 K [to call print subroutine with 'G N']\\n P 56 F [address of print subroutine (EDSAC library P1)]\\n\\n [Subroutine to transpose a matrix of 17-bit real numbers, not in place.\\n Caller must ensure original and transpose don't overlap.\\n Parameters, all in the address field (i.e. denote n by P n F)\\n 10F = width (number of columns)\\n 11F = height (number of rows)\\n 12F = start address of input matrix\\n 13F = start address of output matrix]\\n E25K TX GK\\n\\n [The subroutine loads elements by working down each column in turn.\\n Elements are stored at consecutive locations in the transposed matrix.]\\n A3F T31@ [set up return to caller]\\n A13F A33@ T14@ [initialize T order for storing transpose]\\n A12F A32@ U13@ [initialize A order for loading original]\\n T36@ [also save as A order for top of current column]\\n S10 F [negative of width]\\n [10] T35@ [initialize negative counter]\\n S11 F [negative of height]\\n [12] T34@ [initialize negative counter]\\n [13] AF [maunfactured order; load matrix element]\\n [14] TF [maunfactured order; store matrix element]\\n A14@ A2F T14@ [update address in T order]\\n A13@ A10F T13@ [update address in A order]\\n A34@ A2F G12@ [inner loop till finished this column]\\n A36@ A2F U36@ T13@ [update address for start of column]\\n A35@ A2F G10@ [outer loop till finished all columns]\\n [31] ZF [exit]\\n [32] AF [added to an address to make A order for that address]\\n [33] TF [added to an address to make T order for that address]\\n [34] PF [negative counter for rows]\\n [35] PF [negative counter for columns]\\n [36] AF [load order for first element in current column]\\n\\n [Subroutine to print a matrix of 17-bit real numbers.\\n Straightforward, so given in condensed form.\\n Parameters (in the address field, i.e. pass n as PnF):\\n 10F = width (number of columns)\\n 11F = height (number of rows)\\n 12F = start address of matrix\\n 13F = number of decimals]\\n E25K TM\\n GKA3FT30@A13FT18@A12FA31@T14@S11FT36@S10FT37@O34@O35@TDAFT1FA16@\\n GN [call library subroutine P1]\\n PFA14@A2FT14@A37@A2FG10@O32@O33@A36@A2FG8@ZFAF@F&F!FMFPFPF\\n\\n [Library subroutine P1.\\n Prints number in 0D to n places of decimals, where\\n n is specified by 'P n F' pseudo-order after subroutine call.]\\n E25K TN\\n GKA18@U17@S20@T5@H19@PFT5@VDUFOFFFSFL4FTDA5@A2FG6@EFU3FJFM1F\\n\\n [Main routine]\\n PK T300K GK\\n [Constants]\\n [0] #F [figures shift on teleprinter]\\n [1] @F [carriage return]\\n [2] &F [line feed]\\n [3] P3F [number of columns (in address field)]\\n [4] P5F [number of rows (in address field)]\\n [5] P400F [address of matrix]\\n [6] P500F [address of transposed matrix]\\n [7] P2F [number of decimals when printing matrix]\\n [8] TF [add to address to make T order]\\n [9] P328F [0.0100097...., matrix elements are multiples of this]\\n [Variables]\\n [10] PF [matrix element, initialized to 0.00]\\n [11] PF [negative counter]\\n\\n [Enter with acc = 0]\\n [12] O@ [set figures mode on teleprinter]\\n A5@ [address of matrix]\\n A8@ [make T order to store first elememt]\\n T24@ [plant in code]\\n H4@ N3@ L64F L32F [acc := negative number of entries]\\n [20] T11@ [initialize negative counter]\\n A10@ A9@ U10@ [increment matrix element]\\n [24] TF [store in matrix]\\n A24@ A2F T24@ [inc store address]\\n A11@ A2F G20@ [inc negative counter, loop till zero]\\n\\n [Matrix is set up, now print it]\\n A3@ T10F [10F := width]\\n A4@ T11F [11F := height]\\n A5@ T12F [12F := address of matrix]\\n A7@ T13F [13F := number of decimals]\\n [39] A39@ GM [call print subroutine]\\n O1@ O2@ [add CR LF]\\n\\n [Transpose matrix: 10F, 11F, 12F stay the same]\\n A6@ T13F [13F := address of transpose]\\n [45] A45@ GX [call transpose routine]\\n\\n [Print transpose]\\n A10F TF A11F T10F AF T11F [swap width and height]\\n A13F T12F [12F := address of transpose]\\n A7@ T13F [13F := number of decimals]\\n [57] A57@ GM [call print subroutine]\\n\\n O@ [figures mode, dummy to flush teleprinter buffer]\\n ZF [stop]\\n E12Z [enter at 12 (relative)]\\n PF [accumulator = 0 on entry]\\n\",\n \"language\": \"EDSAC-order-code\"\n },\n {\n \"code\": \"[Transpose a matrix in place. EDSAC, Initial Orders 2.]\\n ..PZ [blank tape and terminator]\\n T50K [to call matrix transpose with 'G X']\\n P160F [address of matrix transpose subroutine]\\n T47K [to call matrix print subroutine with 'G M']\\n P120F [address of matrix print subroutine]\\n T46K [to call print subroutine with 'G N']\\n P56F [address of print subroutine (P1 in EDSAC library)]\\n T48K [to call division subroutine with 'G &']\\n P77F [address of division subroutine]\\n\\n [Subroutine to transpose a matrix of 17-bit values in place.\\n Translated and slightly modified from C version on Rosetta Code website.\\n Parameters, all in the address field (i.e. n is stored as P n F):\\n 10F = width (number of columns, \\\"w\\\" in C program)\\n 11F = height (number of rows, \\\"h\\\" in C program)\\n 12F = start address of matrix]\\n E25K TX GK\\n A3F T64@ [set up return to caller]\\n H10F V11F L32F L64F [acc := size of matrix as width*height]\\n T84@ T85@ [store size; C variable start := 0]\\n [8] TF A85@ T86@ T87@ [set C variables, next := start, i := 0]\\n [12] TF A87@ A2F T87@ [i++]\\n A16@ G65@ [call subroutine to update \\\"next\\\"]\\n A85@ S86@ G12@ [acc := start - next, loop back if < 0]\\n [Skip to location 58 if acc > 0 or i = 1.\\n We already know that acc >= 0 and i > 0.]\\n S2F E58@ [subtract 1 from acc, skip if still >= 0]\\n S2F A87@ G58@ [acc := -2 + i, skip if < 0]\\n [The assignment next := start in the C program is unnecessary]\\n TF A86@ A12F A81@ T31@ [make and plant order to load m{next}]\\n [31] AF T83@ [tmp := m{next}]\\n [33] TF [clear acc; also added to an address to make T order for that address]\\n [34] A86@ A12F A33@ T54@ [make and plant order to store m{next}]\\n A38@ G65@ [call subroutine to update \\\"next\\\"]\\n A86@ S85@ G48@ [go to 48 if i < start]\\n S2F E48@ [go to 48 if i > start]\\n TF A82@ G52@ [make order to load tmp, and go to 52]\\n [48] TF A86@ A12F A81@ [make order to load m{next}]\\n [52] T53@ [plant order to load tmp or m{next}]\\n [53] AF [manufactured order; if i = start loads tmp, else loads m{next}]\\n [54] TF [manufactured order; stores m{next}, using old value of \\\"next\\\"]\\n A85@ S86@ G33@ [acc := start - next, loop back if < 0]\\n [58] TF A85@ A2F U85@ [start++]\\n S84@ G8@ [loop until start = size]\\n [64] ZF [overwritten by return to caller]\\n [Subroutine to execute next = (next % h) * w + next / h in C program]\\n [65] A3F T80@ [set up return to caller]\\n A86@ T4F A11F T5F [set up parameters to divide \\\"next\\\" by \\\"h\\\"]\\n A71@ G& [call division subroutine]\\n [In case anybody is following this in detail, note that \\\"next\\\" and \\\"h\\\" are\\n stored in the address field, so we need to shift the quotient 1 left]\\n H4F V10F L64F L16F A5F LD T86@ [compute RHS and store in \\\"next\\\"]\\n [80] ZF [overwritten by return to caller]\\n [Constants]\\n [81] AF [added to an address to make A order for that address]\\n [82] A83@ [order to load C variable \\\"tmp\\\"]\\n [Variables; integers are stored in the address field for convenience.]\\n [83] PF [C variable \\\"tmp\\\" (holds value of a matrix element)]\\n [84] PF [size of matrix, width*height]\\n [85] PF [C variable \\\"start\\\"]\\n [86] PF [C variable \\\"next\\\"]\\n [87] PF [C variable \\\"i\\\"]\\n\\n [Subroutine to print a matrix of 17-bit real numbers.]\\n E25K TM\\n GKA3FT30@A13FT18@A12FA31@T14@S11FT36@S10FT37@O34@O35@TDAFT1FA16@\\n GN\\n PFA14@A2FT14@A37@A2FG10@O32@O33@A36@A2FG8@ZFAF@F&F!FMFPFPF\\n\\n [Library subroutine P1.\\n Prints positive number in 0D to n places of decimals, where\\n n is specified by 'P n F' pseudo-order after subroutine call.]\\n E25K TN\\n GKA18@U17@S20@T5@H19@PFT5@VDUFOFFFSFL4FTDA5@A2FG6@EFU3FJFM1F\\n\\n [Integer division: number at 4F, divisor at 5F\\n Returns remainder at 4F, quotient at 5F\\n Working location 0D. 37 locations.]\\n E25K T&\\n GKA3FT34@A5FUFT35@A4FRDS35@G13@T1FA35@LDE4@T1FT5FA4FS35@G22@\\n T4FA5FA36@T5FT1FAFS35@E34@T1FA35@RDT35@A5FLDT5FE15@EFPFPD\\n\\n [Main routine]\\n [Given in condensed form, since it's the same as in part 1, except\\n that the address of the transposed matrix is not required.]\\n PKT250KGK#F@F&FP7FP4FP320FP2FTFP328FPFPFO@A5@A7@T23@H4@N3@L64FL32F\\n T10@A9@A8@U9@TFA23@A2FT23@A10@A2FG19@A3@T10FA4@T11FA5@T12FA6@T13F\\n A38@GMO1@O2@A42@GXA10FTFA11FT10FAFT11FA50@GMO@ZFE11ZPF\\n\",\n \"language\": \"EDSAC-order-code\"\n },\n {\n \"code\": \"m = [[1, 1, 1, 1],\\n [2, 4, 8, 16],\\n [3, 9, 27, 81],\\n [4, 16, 64, 256],\\n [5, 25,125, 625]]\\n\\ntranspose = fn(m)-> List.zip(m) |> Enum.map(&Tuple.to_list(&1)) end\\n\\nIO.inspect transpose.(m)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"MAC TRANSPOSE = ([INT n][INT m]TYPE t: matrix) -> [m][n]t:\\n [INT i = 1..m] [INT j = 1..n] matrix[j][i].\\n\",\n \"language\": \"ELLA\"\n },\n {\n \"code\": \"(require 'cl-lib)\\n\\n(defun transpose (m)\\n (apply #'cl-mapcar #'list m))\\n\\n;;test for transposition function\\n(transpose '((2 3 4 5) (3 5 6 9) (9 9 9 9)))\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"(defun matrix-transposition (m)\\n (apply #'seq-mapn (append (list #'list) m)) )\\n\\n(let ((m '(( 2 0 -5 -1)\\n\\t (-3 -2 -4 7)\\n\\t (-1 -3 0 -6))))\\n (message \\\"%s\\\" (matrix-transposition m)) )\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"-module(transmatrix).\\n-export([trans/1,transL/1]).\\n\\n% using built-ins hd = head, tl = tail\\n\\ntrans([[]|_]) -> [];\\ntrans(M) ->\\n [ lists:map(fun hd/1, M) | transpose( lists:map(fun tl/1, M) ) ].\\n\\n% Purist version\\n\\ntransL( [ [Elem | Rest] | List] ) ->\\n [ [Elem | [H || [H | _] <- List] ] |\\n transL( [Rest |\\n [ T || [_ | T] <- List ] ]\\n ) ];\\ntransL([ [] | List] ) -> transL(List);\\ntransL([]) -> [].\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"function transpose(sequence in)\\n sequence out\\n out = repeat(repeat(0,length(in)),length(in[1]))\\n for n = 1 to length(in) do\\n for m = 1 to length(in[1]) do\\n out[m][n] = in[n][m]\\n end for\\n end for\\n return out\\nend function\\n\\nsequence m\\nm = {\\n {1,2,3,4},\\n {5,6,7,8},\\n {9,10,11,12}\\n}\\n\\n? transpose(m)\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"let transpose (mtx : _ [,]) = Array2D.init (mtx.GetLength 1) (mtx.GetLength 0) (fun x y -> mtx.[y,x])\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"( scratchpad ) { { 1 2 3 } { 4 5 6 } } flip .\\n { { 1 4 } { 2 5 } { 3 6 } }\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Array a[3,1]\\n[a]:=[(1,2,3)]\\n[b]:=Trans([a])\\n[a]\\n[b]\\n\",\n \"language\": \"Fermat\"\n },\n {\n \"code\": \"S\\\" fsl-util.fs\\\" REQUIRED\\nS\\\" fsl/dynmem.seq\\\" REQUIRED\\n: F+! ( addr -- ) ( F: r -- ) DUP F@ F+ F! ;\\n: FSQR ( F: r1 -- r2 ) FDUP F* ;\\nS\\\" fsl/gaussj.seq\\\" REQUIRED\\n\\n5 3 float matrix a{{\\n1e 2e 3e 4e 5e 6e 7e 8e 9e 10e 11e 12e 13e 14e 15e 5 3 a{{ }}fput\\nfloat dmatrix b{{\\n\\na{{ 5 3 & b{{ transpose\\n3 5 b{{ }}fprint\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"integer, parameter :: n = 3, m = 5\\nreal, dimension(n,m) :: a = reshape( (/ (i,i=1,n*m) /), (/ n, m /) )\\nreal, dimension(m,n) :: b\\n\\nb = transpose(a)\\n\\ndo i = 1, n\\n print *, a(i,:)\\nend do\\n\\ndo j = 1, m\\n print *, b(j,:)\\nend do\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"REAL A(3,5), B(5,3)\\nDATA ((A(I,J),I=1,3),J=1,5) /1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15/\\n\\nDO I = 1, 3\\n DO J = 1, 5\\n B(J,I) = A(I,J)\\n END DO\\nEND DO\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" REAL A(3,5), B(5,3)\\n DATA ((A(I,J),I=1,3),J=1,5) /1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15/\\n\\n DO 10 I = 1, 3\\n DO 20 J = 1, 5\\n B(J,I) = A(I,J)\\n20 CONTINUE\\n10 CONTINUE\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" DIMENSION A(3,5),B(5,3),C(5,3)\\n EQUIVALENCE (A,C)\\t!Occupy the same storage.\\n DATA A/\\n 1 1, 2, 3, 4, 5,\\n 2 6, 7, 8, 9,10,\\n 3 11,12,13,14,15/\\t!Supplies values in storage order.\\n\\n WRITE (6,*) \\\"Three rows of five values:\\\"\\n WRITE (6,1) A\\t!This shows values in storage order.\\n WRITE (6,*) \\\"...written as C(row,column):\\\"\\n WRITE (6,2) ((C(I,J),J = 1,3),I = 1,5)\\n WRITE (6,*) \\\"... written as A(row,column):\\\"\\n WRITE (6,1) ((A(I,J),J = 1,5),I = 1,3)\\n\\n WRITE (6,*)\\n WRITE (6,*) \\\"B = Transpose(A)\\\"\\n DO 10 I = 1,3\\n DO 10 J = 1,5\\n 10 B(J,I) = A(I,J)\\n\\n WRITE (6,*) \\\"Five rows of three values:\\\"\\n WRITE (6,2) B\\n WRITE (6,*) \\\"... written as B(row,column):\\\"\\n WRITE (6,2) ((B(I,J),J = 1,3),I = 1,5)\\n\\n 1 FORMAT (5F6.1)\\t!Five values per line.\\n 2 FORMAT (3F6.1)\\t!Three values per line.\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Dim matriz(0 To 3, 0 To 4) As Integer = {{78,19,30,12,36},_\\n{49,10,65,42,50},_\\n{30,93,24,78,10},_\\n{39,68,27,64,29}}\\nDim As Integer mtranspuesta(Lbound(matriz, 2) To Ubound(matriz, 2), Lbound(matriz, 1) To Ubound(matriz, 1))\\nDim As Integer fila, columna\\n\\nFor fila = Lbound(matriz,1) To Ubound(matriz,1)\\n For columna = Lbound(matriz,2) To Ubound(matriz,2)\\n mtranspuesta(columna, fila) = matriz(fila, columna)\\n Print ; matriz(fila,columna); \\\" \\\";\\n Next columna\\n Print\\nNext fila\\nPrint\\n\\nFor fila = Lbound(mtranspuesta,1) To Ubound(mtranspuesta,1)\\n For columna = Lbound(mtranspuesta,2) To Ubound(mtranspuesta,2)\\n Print ; mtranspuesta(fila,columna); \\\" \\\";\\n Next columna\\n Print\\nNext fila\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"a = [[1,2,3],\\n [4,5,6],\\n [7,8,9]]\\njoinln[a.transpose[]]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"originalMatrix := [[1, 1, 1, 1],\\n [2, 4, 8, 16],\\n [3, 9, 27, 81],\\n [4, 16, 64, 256],\\n [5, 25, 125, 625]];\\ntransposedMatrix := TransposedMat(originalMatrix);\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n\\n \\\"gonum.org/v1/gonum/mat\\\"\\n)\\n\\nfunc main() {\\n m := mat.NewDense(2, 3, []float64{\\n 1, 2, 3,\\n 4, 5, 6,\\n })\\n fmt.Println(mat.Formatted(m))\\n fmt.Println()\\n fmt.Println(mat.Formatted(m.T()))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n\\n mat \\\"github.com/skelterjohn/go.matrix\\\"\\n)\\n\\nfunc main() {\\n m := mat.MakeDenseMatrixStacked([][]float64{\\n {1, 2, 3},\\n {4, 5, 6},\\n })\\n fmt.Println(\\\"original:\\\")\\n fmt.Println(m)\\n m = m.Transpose()\\n fmt.Println(\\\"transpose:\\\")\\n fmt.Println(m)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\ntype row []float64\\ntype matrix []row\\n\\nfunc main() {\\n m := matrix{\\n {1, 2, 3},\\n {4, 5, 6},\\n }\\n printMatrix(m)\\n t := transpose(m)\\n printMatrix(t)\\n}\\n\\nfunc printMatrix(m matrix) {\\n for _, s := range m {\\n fmt.Println(s)\\n }\\n}\\n\\nfunc transpose(m matrix) matrix {\\n r := make(matrix, len(m[0]))\\n for x, _ := range r {\\n r[x] = make(row, len(m))\\n }\\n for y, s := range m {\\n for x, e := range s {\\n r[x][y] = e\\n }\\n }\\n return r\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\ntype matrix struct {\\n ele []float64\\n stride int\\n}\\n\\n// construct new matrix from slice of slices\\nfunc matrixFromRows(rows [][]float64) *matrix {\\n if len(rows) == 0 {\\n return &matrix{nil, 0}\\n }\\n m := &matrix{make([]float64, len(rows)*len(rows[0])), len(rows[0])}\\n for rx, row := range rows {\\n copy(m.ele[rx*m.stride:(rx+1)*m.stride], row)\\n }\\n return m\\n}\\n\\nfunc main() {\\n m := matrixFromRows([][]float64{\\n {1, 2, 3},\\n {4, 5, 6},\\n })\\n m.print(\\\"original:\\\")\\n m.transpose().print(\\\"transpose:\\\")\\n}\\n\\nfunc (m *matrix) print(heading string) {\\n if heading > \\\"\\\" {\\n fmt.Print(\\\"\\\\n\\\", heading, \\\"\\\\n\\\")\\n }\\n for e := 0; e < len(m.ele); e += m.stride {\\n fmt.Println(m.ele[e : e+m.stride])\\n }\\n}\\n\\nfunc (m *matrix) transpose() *matrix {\\n r := &matrix{make([]float64, len(m.ele)), len(m.ele) / m.stride}\\n rx := 0\\n for _, e := range m.ele {\\n r.ele[rx] = e\\n rx += r.stride\\n if rx >= len(r.ele) {\\n rx -= len(r.ele) - 1\\n }\\n }\\n return r\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\ntype matrix struct {\\n stride int\\n ele []float64\\n}\\n\\nfunc main() {\\n m := matrix{3, []float64{\\n 1, 2, 3,\\n 4, 5, 6,\\n }}\\n m.print(\\\"original:\\\")\\n m.transposeInPlace()\\n m.print(\\\"transpose:\\\")\\n}\\n\\nfunc (m *matrix) print(heading string) {\\n if heading > \\\"\\\" {\\n fmt.Print(\\\"\\\\n\\\", heading, \\\"\\\\n\\\")\\n }\\n for e := 0; e < len(m.ele); e += m.stride {\\n fmt.Println(m.ele[e : e+m.stride])\\n }\\n}\\n\\nfunc (m *matrix) transposeInPlace() {\\n h := len(m.ele) / m.stride\\n for start := range m.ele {\\n next := start\\n i := 0\\n for {\\n i++\\n next = (next%h)*m.stride + next/h\\n if next <= start {\\n break\\n }\\n }\\n if next < start || i == 1 {\\n continue\\n }\\n\\n next = start\\n tmp := m.ele[next]\\n for {\\n i = (next%h)*m.stride + next/h\\n if i == start {\\n m.ele[next] = tmp\\n } else {\\n m.ele[next] = m.ele[i]\\n }\\n next = i\\n if next <= start {\\n break\\n }\\n }\\n }\\n m.stride = h\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def matrix = [ [ 1, 2, 3, 4 ],\\n [ 5, 6, 7, 8 ] ]\\n\\nmatrix.each { println it }\\nprintln()\\ndef transpose = matrix.transpose()\\n\\ntranspose.each { println it }\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"*Main> transpose [[1,2],[3,4],[5,6]]\\n[[1,3,5],[2,4,6]]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Array\\n\\nswap (x,y) = (y,x)\\n\\ntranspArray :: (Ix a, Ix b) => Array (a,b) e -> Array (b,a) e\\ntranspArray a = ixmap (swap l, swap u) swap a where\\n (l,u) = bounds a\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"tpose [ms] = [[m] | m <- ms]\\ntpose (ms:mss) = zipWith (:) ms (tpose mss)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Matrix\\n\\nmain :: IO ()\\nmain = print matrix >> print (transpose matrix)\\n where\\n matrix = fromList 3 4 [1 ..]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Numeric.LinearAlgebra\\n\\na :: Matrix I\\na = (3><2)\\n [1,2\\n ,3,4\\n ,5,6]\\n\\nmain = do\\n print $ a\\n print $ tr a\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"class Matrix {\\n static function main() {\\n var m = [ [1, 1, 1, 1],\\n [2, 4, 8, 16],\\n [3, 9, 27, 81],\\n [4, 16, 64, 256],\\n [5, 25, 125, 625] ];\\n var t = [ for (i in 0...m[0].length)\\n [ for (j in 0...m.length) 0 ] ];\\n for(i in 0...m.length)\\n for(j in 0...m[0].length)\\n t[j][i] = m[i][j];\\n\\n for(aa in [m, t])\\n for(a in aa) Sys.println(a);\\n }\\n}\\n\",\n \"language\": \"Haxe\"\n },\n {\n \"code\": \"REAL :: mtx(2, 4)\\n\\nmtx = 1.1 * $\\nWRITE() mtx\\n\\nSOLVE(Matrix=mtx, Transpose=mtx)\\nWRITE() mtx\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"uses lists;\\ndec transpose : list (list alpha) -> list (list alpha);\\n--- transpose ([]::_) <= [];\\n--- transpose n <= map head n :: transpose (map tail n);\\n\",\n \"language\": \"Hope\"\n },\n {\n \"code\": \"procedure transpose_matrix (matrix)\\n result := []\\n # for each column\\n every (i := 1 to *matrix[1]) do {\\n col := []\\n # extract the number in each row for that column\\n every (row := !matrix) do put (col, row[i])\\n # and push that column as a row in the result matrix\\n put (result, col)\\n }\\n return result\\nend\\n\\nprocedure print_matrix (matrix)\\n every (row := !matrix) do {\\n every writes (!row || \\\" \\\")\\n write ()\\n }\\nend\\n\\nprocedure main ()\\n matrix := [[1,2,3],[4,5,6]]\\n write (\\\"Start:\\\")\\n print_matrix (matrix)\\n transposed := transpose_matrix (matrix)\\n write (\\\"Transposed:\\\")\\n print_matrix (transposed)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"m=[[1,1,1,1],[2, 4, 8, 16],[3, 9,27, 81],[5, 25,125, 625]]\\nprint,transpose(m)\\n\",\n \"language\": \"IDL\"\n },\n {\n \"code\": \"Idris> transpose [[1,2],[3,4],[5,6]]\\n[[1, 3, 5], [2, 4, 6]] : List (List Integer)\\n\",\n \"language\": \"Idris\"\n },\n {\n \"code\": \"(var transpose2d @(... map vec))\\n\\n(transpose2d [[1 1 1 1] [2 4 8 16] [3 9 27 81] [4 16 64 256] [5 25 125 625]])\\n\",\n \"language\": \"Idris\"\n },\n {\n \"code\": \" ]matrix=: (^/ }:) >:i.5 NB. make and show example matrix\\n1 1 1 1\\n2 4 8 16\\n3 9 27 81\\n4 16 64 256\\n5 25 125 625\\n |: matrix\\n1 2 3 4 5\\n1 4 9 16 25\\n1 8 27 64 125\\n1 16 81 256 625\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.Arrays;\\npublic class Transpose{\\n public static void main(String[] args){\\n double[][] m = {{1, 1, 1, 1},\\n {2, 4, 8, 16},\\n {3, 9, 27, 81},\\n {4, 16, 64, 256},\\n {5, 25, 125, 625}};\\n double[][] ans = new double[m[0].length][m.length];\\n for(int rows = 0; rows < m.length; rows++){\\n for(int cols = 0; cols < m[0].length; cols++){\\n ans[cols][rows] = m[rows][cols];\\n }\\n }\\n for(double[] i:ans){//2D arrays are arrays of arrays\\n System.out.println(Arrays.toString(i));\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function Matrix(ary) {\\n this.mtx = ary\\n this.height = ary.length;\\n this.width = ary[0].length;\\n}\\n\\nMatrix.prototype.toString = function() {\\n var s = []\\n for (var i = 0; i < this.mtx.length; i++)\\n s.push( this.mtx[i].join(\\\",\\\") );\\n return s.join(\\\"\\\\n\\\");\\n}\\n\\n// returns a new matrix\\nMatrix.prototype.transpose = function() {\\n var transposed = [];\\n for (var i = 0; i < this.width; i++) {\\n transposed[i] = [];\\n for (var j = 0; j < this.height; j++) {\\n transposed[i][j] = this.mtx[j][i];\\n }\\n }\\n return new Matrix(transposed);\\n}\\n\\nvar m = new Matrix([[1,1,1,1],[2,4,8,16],[3,9,27,81],[4,16,64,256],[5,25,125,625]]);\\nprint(m);\\nprint();\\nprint(m.transpose());\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(function () {\\n 'use strict';\\n\\n function transpose(lst) {\\n return lst[0].map(function (_, iCol) {\\n return lst.map(function (row) {\\n return row[iCol];\\n })\\n });\\n }\\n\\n return transpose(\\n [[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]]\\n );\\n\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n \\\"use strict\\\";\\n\\n // transpose :: [[a]] -> [[a]]\\n const transpose = xs =>\\n 0 < xs.length ? (\\n xs[0].map(\\n (_, iCol) => xs.map(\\n row => row[iCol]\\n )\\n )\\n ) : [];\\n\\n\\n // ---------------------- TEST -----------------------\\n const main = () =>\\n JSON.stringify(\\n transpose([\\n [1, 2, 3],\\n [4, 5, 6],\\n [7, 8, 9]\\n ])\\n );\\n\\n\\n // MAIN ---\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"[[1,4,7],[2,5,8],[3,6,9]]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"DEFINE transpose == [[null] [true] [[null] some] ifte]\\n[pop []]\\n[[[first] map] [[rest] map] cleave]\\n[cons]\\nlinrec.\\n\",\n \"language\": \"Joy\"\n },\n {\n \"code\": \"def transpose:\\n if (.[0] | length) == 0 then []\\n else [map(.[0])] + (map(.[1:]) | transpose)\\n end ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"/* Matrix transposition, multiplication, identity, and exponentiation, in Jsish */\\nfunction Matrix(ary) {\\n this.mtx = ary;\\n this.height = ary.length;\\n this.width = ary[0].length;\\n}\\n\\nMatrix.prototype.toString = function() {\\n var s = [];\\n for (var i = 0; i < this.mtx.length; i++) s.push(this.mtx[i].join(\\\",\\\"));\\n return s.join(\\\"\\\\n\\\");\\n};\\n\\n// returns a transposed matrix\\nMatrix.prototype.transpose = function() {\\n var transposed = [];\\n for (var i = 0; i < this.width; i++) {\\n transposed[i] = [];\\n for (var j = 0; j < this.height; j++) transposed[i][j] = this.mtx[j][i];\\n }\\n return new Matrix(transposed);\\n};\\n\\n// returns a matrix as the product of two others\\nMatrix.prototype.mult = function(other) {\\n if (this.width != other.height) throw \\\"error: incompatible sizes\\\";\\n\\n var result = [];\\n for (var i = 0; i < this.height; i++) {\\n result[i] = [];\\n for (var j = 0; j < other.width; j++) {\\n var sum = 0;\\n for (var k = 0; k < this.width; k++) sum += this.mtx[i][k] * other.mtx[k][j];\\n result[i][j] = sum;\\n }\\n }\\n return new Matrix(result);\\n};\\n\\n// IdentityMatrix is a \\\"subclass\\\" of Matrix\\nfunction IdentityMatrix(n) {\\n this.height = n;\\n this.width = n;\\n this.mtx = [];\\n for (var i = 0; i < n; i++) {\\n this.mtx[i] = [];\\n for (var j = 0; j < n; j++) this.mtx[i][j] = (i == j ? 1 : 0);\\n }\\n}\\nIdentityMatrix.prototype = Matrix.prototype;\\n\\n// the Matrix exponentiation function\\nMatrix.prototype.exp = function(n) {\\n var result = new IdentityMatrix(this.height);\\n for (var i = 1; i <= n; i++) result = result.mult(this);\\n return result;\\n};\\n\\nprovide('Matrix', '0.60');\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"/* Matrix transposition, in Jsish */\\nrequire('Matrix');\\n\\nif (Interp.conf('unitTest')) {\\n var m = new Matrix([[1,1,1,1],[2,4,8,16],[3,9,27,81],[4,16,64,256],[5,25,125,625]]);\\n; m;\\n; m.transpose();\\n}\\n\\n/*\\n=!EXPECTSTART!=\\nm ==> { height:5, mtx:[ [ 1, 1, 1, 1 ], [ 2, 4, 8, 16 ], [ 3, 9, 27, 81 ], [ 4, 16, 64, 256 ], [ 5, 25, 125, 625 ] ], width:4 }\\nm.transpose() ==> { height:4, mtx:[ [ 1, 2, 3, 4, 5 ], [ 1, 4, 9, 16, 25 ], [ 1, 8, 27, 64, 125 ], [ 1, 16, 81, 256, 625 ] ], width:5 }\\n=!EXPECTEND!=\\n*/\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"julia> [1 2 3 ; 4 5 6] # a 2x3 matrix\\n2x3 Array{Int64,2}:\\n 1 2 3\\n 4 5 6\\n\\njulia> [1 2 3 ; 4 5 6]' # note the quote\\n3x2 LinearAlgebra.Adjoint{Int64,Array{Int64,2}}:\\n 1 4\\n 2 5\\n 3 6\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \" {x^\\\\:-1_ x}1+!:5\\n(1 1 1 1.0\\n 2 4 8 16.0\\n 3 9 27 81.0\\n 4 16 64 256.0\\n 5 25 125 625.0)\\n\\n +{x^\\\\:-1_ x}1+!:5\\n(1 2 3 4 5.0\\n 1 4 9 16 25.0\\n 1 8 27 64 125.0\\n 1 16 81 256 625.0)\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \" [5 5]:^!25\\n[[0 1 2 3 4]\\n [5 6 7 8 9]\\n [10 11 12 13 14]\\n [15 16 17 18 19]\\n [20 21 22 23 24]]\\n\\n +[5 5]:^!25\\n[[0 5 10 15 20]\\n [1 6 11 16 21]\\n [2 7 12 17 22]\\n [3 8 13 18 23]\\n [4 9 14 19 24]]\\n\",\n \"language\": \"Klong\"\n },\n {\n \"code\": \"// version 1.1.3\\n\\ntypealias Vector = DoubleArray\\ntypealias Matrix = Array<Vector>\\n\\nfun Matrix.transpose(): Matrix {\\n val rows = this.size\\n val cols = this[0].size\\n val trans = Matrix(cols) { Vector(rows) }\\n for (i in 0 until cols) {\\n for (j in 0 until rows) trans[i][j] = this[j][i]\\n }\\n return trans\\n}\\n\\n// Alternate version\\ntypealias Matrix<T> = List<List<T>>\\nfun <T> Matrix<T>.transpose(): Matrix<T> {\\n return (0 until this[0].size).map { x ->\\n (this.indices).map { y ->\\n this[y][x]\\n }\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"{require lib_matrix}\\n\\n{M.disp\\n {M.transp\\n[[1, 1, 1, 1],\\n [2, 4, 8, 16],\\n [3, 9, 27, 81],\\n [4, 16, 64, 256],\\n [5, 25,125, 625]]\\n}}\\n->\\n[[1,2,3,4,5],\\n[1,4,9,16,25],\\n[1,8,27,64,125],\\n[1,16,81,256,625]]\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"12 iota [3 4] reshape 1 + dup .\\n1 transpose .\\n\",\n \"language\": \"Lang5\"\n },\n {\n \"code\": \"(defun transpose (matrix)\\n (transpose matrix '()))\\n\\n(defun transpose (matrix acc)\\n (cond\\n ((lists:any\\n (lambda (x) (== x '()))\\n matrix)\\n acc)\\n ('true\\n (let ((heads (lists:map #'car/1 matrix))\\n (tails (lists:map #'cdr/1 matrix)))\\n (transpose tails (++ acc `(,heads)))))))\\n\",\n \"language\": \"LFE\"\n },\n {\n \"code\": \"> (transpose '((1 2 3)\\n (4 5 6)\\n (7 8 9)\\n (10 11 12)\\n (13 14 15)\\n (16 17 18)))\\n((1 4 7 10 13 16) (2 5 8 11 14 17) (3 6 9 12 15 18))\\n>\\n\",\n \"language\": \"LFE\"\n },\n {\n \"code\": \"MatrixC$ =\\\"4, 3, 0, 0.10, 0.20, 0.30, 0.40, 0.50, 0.60, 0.70, 0.80, 0.90, 1.00, 1.10\\\"\\n\\nprint \\\"Transpose of matrix\\\"\\ncall DisplayMatrix MatrixC$\\nprint \\\" =\\\"\\nMatrixT$ =MatrixTranspose$( MatrixC$)\\ncall DisplayMatrix MatrixT$\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"function Transpose( m )\\n local res = {}\\n\\n for i = 1, #m[1] do\\n res[i] = {}\\n for j = 1, #m do\\n res[i][j] = m[j][i]\\n end\\n end\\n\\n return res\\nend\\n\\n-- a test for Transpose(m)\\nmat = { { 1, 2, 3 }, { 4, 5, 6 } }\\nerg = Transpose( mat )\\nfor i = 1, #erg do\\n for j = 1, #erg[1] do\\n io.write( erg[i][j] )\\n io.write( \\\" \\\" )\\n end\\n io.write( \\\"\\\\n\\\" )\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"function map(f, a)\\n local b = {}\\n for k,v in ipairs(a) do b[k] = f(v) end\\n return b\\nend\\n\\nfunction mapn(f, ...)\\n local c = {}\\n local k = 1\\n local aarg = {...}\\n local n = #aarg\\n while true do\\n local a = map(function(b) return b[k] end, aarg)\\n if #a < n then return c end\\n c[k] = f(unpack(a))\\n k = k + 1\\n end\\nend\\n\\nfunction apply(f1, f2, a)\\n return f1(f2, unpack(a))\\nend\\n\\nxy = {{1,2,3,4},{1,2,3,4},{1,2,3,4}}\\nyx = apply(mapn, function(...) return {...} end, xy)\\nprint(table.concat(map(function(a) return table.concat(a,\\\",\\\") end, xy), \\\"\\\\n\\\"),\\\"\\\\n\\\")\\nprint(table.concat(map(function(a) return table.concat(a,\\\",\\\") end, yx), \\\"\\\\n\\\"))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"M := <<2,3>|<3,4>|<5,6>>;\\n\\nM^%T;\\n\\nwith(LinearAlgebra):\\nTranspose(M);\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"originalMatrix = {{1, 1, 1, 1},\\n {2, 4, 8, 16},\\n {3, 9, 27, 81},\\n {4, 16, 64, 256},\\n {5, 25, 125, 625}}\\ntransposedMatrix = Transpose[originalMatrix]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \">> transpose([1 2;3 4])\\n\\nans =\\n\\n 1 3\\n 2 4\\n\\n>> [1 2;3 4].'\\n\\nans =\\n\\n 1 3\\n 2 4\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"B=size(A); %In this code, we assume that a previous matrix \\\"A\\\" has already been inputted.\\nfor j=1:B(1)\\n for i=1:B(2)\\n C(i,j)=A(j,i);\\n end %The transposed A-matrix should be C\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"xy = {{1,2,3,4},{1,2,3,4},{1,2,3,4}}\\nyx = feval(@(x) cellfun(@(varargin)[varargin],x{:},'un',0), xy)\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"originalMatrix : matrix([1, 1, 1, 1],\\n [2, 4, 8, 16],\\n [3, 9, 27, 81],\\n [4, 16, 64, 256],\\n [5, 25, 125, 625]);\\ntransposedMatrix : transpose(originalMatrix);\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"m = bigMatrix 5 4\\nfor i in 1 to 5 do for j in 1 to 4 do m[i][j] = pow i j\\nm = transpose m\\n\",\n \"language\": \"MAXScript\"\n },\n {\n \"code\": \"|a := 2 3 reshape count 6\\n=1 2 3\\n=4 5 6\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \"|transpose a\\n=1 4\\n=2 5\\n=3 6\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \"proc transpose[X, Y; T](s: array[Y, array[X, T]]): array[X, array[Y, T]] =\\n for i in low(X)..high(X):\\n for j in low(Y)..high(Y):\\n result[i][j] = s[j][i]\\n\\nlet b = [[ 0, 1, 2, 3, 4],\\n [ 5, 6, 7, 8, 9],\\n [ 1, 0, 0, 0,42]]\\nlet c = transpose(b)\\nfor r in c:\\n for i in r:\\n stdout.write i, \\\" \\\"\\n echo \\\"\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"proc transpose[T](s: seq[seq[T]]): seq[seq[T]] =\\n result = newSeq[seq[T]](s[0].len)\\n for i in 0 .. s[0].high:\\n result[i] = newSeq[T](s.len)\\n for j in 0 .. s.high:\\n result[i][j] = s[j][i]\\n\\nlet a = @[@[ 0, 1, 2, 3, 4],\\n @[ 5, 6, 7, 8, 9],\\n @[ 1, 0, 0, 0, 42]]\\necho transpose(a)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"bundle Default {\\n class Transpose {\\n function : Main(args : String[]) ~ Nil {\\n input := [[1, 1, 1, 1]\\n [2, 4, 8, 16]\\n [3, 9, 27, 81]\\n [4, 16, 64, 256]\\n [5, 25, 125, 625]];\\n dim := input->Size();\\n\\n output := Int->New[dim[0],dim[1]];\\n for(i := 0; i < dim[0]; i+=1;) {\\n for(j := 0; j < dim[1]; j+=1;) {\\n output[i,j] := input[i,j];\\n };\\n };\\n\\n Print(output);\\n }\\n\\n function : Print(matrix : Int[,]) ~ Nil {\\n dim := matrix->Size();\\n for(i := 0; i < dim[0]; i+=1;) {\\n for(j := 0; j < dim[1]; j+=1;) {\\n IO.Console->Print(matrix[i,j])->Print('\\\\t');\\n };\\n '\\\\n'->Print();\\n };\\n }\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"open Bigarray\\n\\nlet transpose b =\\n let dim1 = Array2.dim1 b\\n and dim2 = Array2.dim2 b in\\n let kind = Array2.kind b\\n and layout = Array2.layout b in\\n let b' = Array2.create kind layout dim2 dim1 in\\n for i=0 to pred dim1 do\\n for j=0 to pred dim2 do\\n b'.{j,i} <- b.{i,j}\\n done;\\n done;\\n (b')\\n;;\\n\\nlet array2_display print newline b =\\n for i=0 to Array2.dim1 b - 1 do\\n for j=0 to Array2.dim2 b - 1 do\\n print b.{i,j}\\n done;\\n newline();\\n done;\\n;;\\n\\nlet a = Array2.of_array int c_layout [|\\n [| 1; 2; 3; 4 |];\\n [| 5; 6; 7; 8 |];\\n|]\\n;;\\n\\narray2_display (Printf.printf \\\" %d\\\") print_newline (transpose a) ;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let rec transpose m =\\n assert (m <> []);\\n if List.mem [] m then\\n []\\n else\\n List.map List.hd m :: transpose (List.map List.tl m)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"a = [ 1, 1, 1, 1 ;\\n 2, 4, 8, 16 ;\\n 3, 9, 27, 81 ;\\n 4, 16, 64, 256 ;\\n 5, 25, 125, 625 ];\\ntranposed = a.'; % tranpose\\nctransp = a'; % conjugate transpose\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"function Transpose(double *A,*B, sys nx,ny)\\n'==========================================\\n sys x,y\\n indexbase 0\\n for x=0 to <nx\\n for y=0 to <ny\\n B[y*nx+x]=A[x*ny+y]\\n next\\n next\\nend function\\n\\nfunction MatrixShow(double*A, sys nx,ny) as string\\n'=================================================\\n sys x,y\\n indexbase 0\\n string pr=\\\"\\\",tab=chr(9),cr=chr(13)+chr(10)\\n for y=0 to <ny\\n for x=0 to <nx\\n pr+=tab A[x*ny+y]\\n next\\n pr+=cr\\n next\\n return pr\\nend function\\n\\n'====\\n'DEMO\\n'====\\n\\ndouble A[5*4],B[4*5]\\n'columns x\\n'rows y\\n\\nA <= 'y minor, x major\\n11,12,13,14,15,\\n21,22,23,24,25,\\n31,32,33,34,35,\\n41,42,43,44,45\\n\\nprint MatrixShow A,5,4\\nTranspose A,B,5,4\\nprint MatrixShow B,4,5\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"M~\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"gtrans(M)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"Program Transpose;\\n\\nconst\\n A: array[1..3,1..5] of integer = (( 1, 2, 3, 4, 5),\\n ( 6, 7, 8, 9, 10),\\n\\t\\t\\t\\t (11, 12, 13, 14, 15)\\n\\t\\t\\t\\t );\\nvar\\n B: array[1..5,1..3] of integer;\\n i, j: integer;\\n\\nbegin\\n for i := low(A) to high(A) do\\n for j := low(A[1]) to high(A[1]) do\\n B[j,i] := A[i,j];\\n\\n writeln ('A:');\\n for i := low(A) to high(A) do\\n begin\\n for j := low(A[1]) to high(A[1]) do\\n write (A[i,j]:3);\\n writeln;\\n end;\\n\\n writeln ('B:');\\n for i := low(B) to high(B) do\\n begin\\n for j := low(B[1]) to high(B[1]) do\\n write (B[i,j]:3);\\n writeln;\\n end;\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use Math::Matrix;\\n\\n$m = Math::Matrix->new(\\n [1, 1, 1, 1],\\n [2, 4, 8, 16],\\n [3, 9, 27, 81],\\n [4, 16, 64, 256],\\n [5, 25, 125, 625],\\n);\\n\\n$m->transpose->print;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"my @m = (\\n [1, 1, 1, 1],\\n [2, 4, 8, 16],\\n [3, 9, 27, 81],\\n [4, 16, 64, 256],\\n [5, 25, 125, 625],\\n);\\n\\nmy @transposed;\\nforeach my $j (0..$#{$m[0]}) {\\n push(@transposed, [map $_->[$j], @m]);\\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;\\\">matrix_transpose</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">mat</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">rows</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">mat</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">cols</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">mat</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;\\\">res</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: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rows</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">cols</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;\\\">rows</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;\\\">cols</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">mat</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: #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;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"function transpose($m) {\\n if (count($m) == 0) // special case: empty matrix\\n return array();\\n else if (count($m) == 1) // special case: row matrix\\n return array_chunk($m[0], 1);\\n\\n // array_map(NULL, m[0], m[1], ..)\\n array_unshift($m, NULL); // the original matrix is not modified because it was passed by value\\n return call_user_func_array('array_map', $m);\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"function transpose($m) {\\n return count($m) == 0 ? $m : (count($m) == 1 ? array_chunk($m[0], 1) : array_map(null, ...$m));\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"import util.\\n\\ngo =>\\n M = [[0.0, 0.1, 0.2, 0.3],\\n [0.4, 0.5, 0.6, 0.7],\\n [0.8, 0.9, 1.0, 1.1]],\\n print_matrix(M),\\n\\n M2 = [[a,b,c,d,e],\\n [f,g,h,i,j],\\n [k,l,m,n,o],\\n [p,q,r,s,t],\\n [u,v,w,z,y]],\\n print_matrix(M2),\\n\\n M3 = make_matrix(1..24,8),\\n print_matrix(M3),\\n nl.\\n\\n\\n%\\n% Print original matrix and its transpose\\n%\\nprint_matrix(M) =>\\n println(\\\"Matrix:\\\"),\\n foreach(Row in M) println(Row) end,\\n println(\\\"\\\\nTransposed:\\\"),\\n foreach(Row in M.transpose()) println(Row) end,\\n nl.\\n\\n%\\n% Make a matrix of list L with Rows rows\\n% (and L.length div Rows columns)\\n%\\nmake_matrix(L,Rows) = M =>\\n M = [],\\n Cols = L.length div Rows,\\n foreach(I in 1..Rows)\\n NewRow = new_list(Cols),\\n foreach(J in 1..Cols)\\n NewRow[J] := L[ (I-1)*Cols + J]\\n end,\\n M := M ++ [NewRow]\\n end.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de matTrans (Mat)\\n (apply mapcar Mat list) )\\n\\n(matTrans '((1 2 3) (4 5 6)))\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"/* The short method: */\\ndeclare A(m, n) float, B (n,m) float defined (A(2sub, 1sub));\\n/* Any reference to B gives the transpose of matrix A. */\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"/* Transpose matrix A, result at B. */\\ntranspose: procedure (a, b);\\n declare (a, b) (*,*) float controlled;\\n declare (m, n) fixed binary;\\n\\n if allocation(b) > 0 then free b;\\n\\n m = hbound(a,1); n = hbound(a,2);\\n\\n allocate b(n,m);\\n\\n do i = 1 to m;\\n b(*,i) = a(i,*);\\n end;\\nend transpose;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"define transpose(m) -> res;\\n lvars bl = boundslist(m);\\n if length(bl) /= 4 then\\n throw([need_2d_array ^a])\\n endif;\\n lvars i, i0 = bl(1), i1 = bl(2);\\n lvars j, j0 = bl(3), j1 = bl(4);\\n newarray([^j0 ^j1 ^i0 ^i1], 0) -> res;\\n for i from i0 to i1 do\\n for j from j0 to j1 do\\n m(i, j) -> res(j, i);\\n endfor;\\n endfor;\\nenddefine;\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \"/transpose {\\n [ exch {\\n { {empty? exch pop} map all?} {pop exit} ift\\n [ exch {} {uncons {exch cons} dip exch} fold counttomark 1 roll] uncons\\n } loop ] {reverse} map\\n}.\\n\",\n \"language\": \"PostScript\"\n },\n {\n \"code\": \"#COMPILE EXE\\n#DIM ALL\\n#COMPILER PBCC 6\\n'----------------------------------------------------------------------\\nSUB TransposeMatrix(InitMatrix() AS DWORD, TransposedMatrix() AS DWORD)\\nLOCAL l1, l2, u1, u2 AS LONG\\n l1 = LBOUND(InitMatrix, 1)\\n l2 = LBOUND(InitMatrix, 2)\\n u1 = UBOUND(InitMatrix, 1)\\n u2 = UBOUND(InitMatrix, 2)\\n REDIM TransposedMatrix(l2 TO u2, l1 TO u1)\\n MAT TransposedMatrix() = TRN(InitMatrix())\\nEND SUB\\n'----------------------------------------------------------------------\\nSUB PrintMatrix(a() AS DWORD)\\nLOCAL l1, l2, u1, u2, r, c AS LONG\\nLOCAL s AS STRING * 8\\n l1 = LBOUND(a(), 1)\\n l2 = LBOUND(a(), 2)\\n u1 = UBOUND(a(), 1)\\n u2 = UBOUND(a(), 2)\\n FOR r = l1 TO u1\\n FOR c = l2 TO u2\\n RSET s = STR$(a(r, c))\\n CON.PRINT s;\\n NEXT c\\n CON.PRINT\\n NEXT r\\nEND SUB\\n'----------------------------------------------------------------------\\nSUB TranspositionDemo(BYVAL DimSize1 AS DWORD, BYVAL DimSize2 AS DWORD)\\nLOCAL r, c, cc AS DWORD\\nLOCAL a() AS DWORD\\nLOCAL b() AS DWORD\\n cc = DimSize2\\n DECR DimSize1\\n DECR DimSize2\\n REDIM a(0 TO DimSize1, 0 TO DimSize2)\\n FOR r = 0 TO DimSize1\\n FOR c = 0 TO DimSize2\\n a(r, c)= (cc * r) + c + 1\\n NEXT c\\n NEXT r\\n CON.PRINT \\\"initial matrix:\\\"\\n PrintMatrix a()\\n TransposeMatrix a(), b()\\n CON.PRINT \\\"transposed matrix:\\\"\\n PrintMatrix b()\\nEND SUB\\n'----------------------------------------------------------------------\\nFUNCTION PBMAIN () AS LONG\\n TranspositionDemo 3, 3\\n TranspositionDemo 3, 7\\nEND FUNCTION\\n\",\n \"language\": \"PowerBASIC\"\n },\n {\n \"code\": \"function transpose($a) {\\n $arr = @()\\n if($a) {\\n $n = $a.count - 1\\n if(0 -lt $n) {\\n $m = ($a | foreach {$_.count} | measure-object -Minimum).Minimum - 1\\n if( 0 -le $m) {\\n if (0 -lt $m) {\\n $arr =@(0)*($m+1)\\n foreach($i in 0..$m) {\\n $arr[$i] = foreach($j in 0..$n) {@($a[$j][$i])}\\n }\\n } else {$arr = foreach($row in $a) {$row[0]}}\\n }\\n } else {$arr = $a}\\n }\\n $arr\\n}\\nfunction show($a) {\\n if($a) {\\n 0..($a.Count - 1) | foreach{ if($a[$_]){\\\"$($a[$_])\\\"}else{\\\"\\\"} }\\n }\\n}\\n\\n$a = @(@(2, 0, 7, 8),@(3, 5, 9, 1),@(4, 1, 6, 3))\\n\\\"`$a =\\\"\\nshow $a\\n\\\"\\\"\\n\\\"transpose `$a =\\\"\\nshow (transpose $a)\\n\\\"\\\"\\n$a = @(1)\\n\\\"`$a =\\\"\\nshow $a\\n\\\"\\\"\\n\\\"transpose `$a =\\\"\\nshow (transpose $a)\\n\\\"\\\"\\n\\\"`$a =\\\"\\n$a = @(1,2,3)\\nshow $a\\n\\\"\\\"\\n\\\"transpose `$a =\\\"\\n\\\"$(transpose $a)\\\"\\n\\\"\\\"\\n\\\"`$a =\\\"\\n$a = @(@(4,7,8),@(1),@(2,3))\\nshow $a\\n\\\"\\\"\\n\\\"transpose `$a =\\\"\\n\\\"$(transpose $a)\\\"\\n\\\"\\\"\\n\\\"`$a =\\\"\\n$a = @(@(4,7,8),@(1,5,9,0),@(2,3))\\nshow $a\\n\\\"\\\"\\n\\\"transpose `$a =\\\"\\nshow (transpose $a)\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"function transpose($a) {\\n if($a) {\\n $n = $a.Count - 1\\n foreach($i in 0..$n) {\\n $j = 0\\n while($j -lt $i) {\\n $a[$i][$j], $a[$j][$i] = $a[$j][$i], $a[$i][$j]\\n $j++\\n }\\n }\\n }\\n $a\\n}\\nfunction show($a) {\\n if($a) {\\n 0..($a.Count - 1) | foreach{ if($a[$_]){\\\"$($a[$_])\\\"}else{\\\"\\\"} }\\n }\\n}\\n$a = @(@(2, 4, 7),@(3, 5, 9),@(4, 1, 6))\\nshow $a\\n\\\"\\\"\\nshow (transpose $a)\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"% transposition of a rectangular matrix\\n% e.g. [[1,2,3,4], [5,6,7,8]]\\n% give [[1,5],[2,6],[3,7],[4,8]]\\n\\ntranspose(In, Out) :-\\n In = [H | T],\\n maplist(initdl, H, L),\\n work(T, In, Out).\\n\\n% we use the difference list to make \\\"quick\\\" appends (one inference)\\ninitdl(V, [V | X] - X).\\n\\nwork(Lst, [H], Out) :-\\n\\tmaplist(my_append_last, Lst, H, Out).\\n\\nwork(Lst, [H | T], Out) :-\\n maplist(my_append, Lst, H, Lst1),\\n work(Lst1, T, Out).\\n\\nmy_append(X-Y, C, X1-Y1) :-\\n append_dl(X-Y, [C | U]- U, X1-Y1).\\n\\nmy_append_last(X-Y, C, X1) :-\\n\\tappend_dl(X-Y, [C | U]- U, X1-[]).\\n\\n% \\\"quick\\\" append\\nappend_dl(X-Y, Y-Z, X-Z).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Procedure transposeMatrix(Array a(2), Array trans(2))\\n Protected rows, cols\\n\\n Protected ar = ArraySize(a(), 1) ;rows in original matrix\\n Protected ac = ArraySize(a(), 2) ;cols in original matrix\\n\\n ;size the matrix receiving the transposition\\n Dim trans(ac, ar)\\n\\n ;copy the values\\n For rows = 0 To ar\\n For cols = 0 To ac\\n trans(cols, rows) = a(rows, cols)\\n Next\\n Next\\nEndProcedure\\n\\nProcedure displayMatrix(Array a(2), text.s = \\\"\\\")\\n Protected i, j\\n Protected cols = ArraySize(a(), 2), rows = ArraySize(a(), 1)\\n\\n PrintN(text + \\\": (\\\" + Str(rows + 1) + \\\", \\\" + Str(cols + 1) + \\\")\\\")\\n For i = 0 To rows\\n For j = 0 To cols\\n Print(LSet(Str(a(i, j)), 4, \\\" \\\"))\\n Next\\n PrintN(\\\"\\\")\\n Next\\n PrintN(\\\"\\\")\\nEndProcedure\\n\\n;setup a matrix of arbitrary size\\nDim m(random(5), random(5))\\n\\nDefine rows, cols\\n;fill matrix with 'random' data\\nFor rows = 0 To ArraySize(m(),1) ;ArraySize() can take a dimension as its second argument\\n For cols = 0 To ArraySize(m(), 2)\\n m(rows, cols) = random(10) - 10\\n Next\\nNext\\n\\nDim t(0,0) ;this will be resized during transposition\\nIf OpenConsole()\\n displayMatrix(m(), \\\"matrix before transposition\\\")\\n transposeMatrix(m(), t())\\n displayMatrix(t(), \\\"matrix after transposition\\\")\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\")\\n Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"m=((1, 1, 1, 1),\\n (2, 4, 8, 16),\\n (3, 9, 27, 81),\\n (4, 16, 64, 256),\\n (5, 25,125, 625))\\nprint(zip(*m))\\n# in Python 3.x, you would do:\\n# print(list(zip(*m)))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"# transpose :: Matrix a -> Matrix a\\ndef transpose(m):\\n if m:\\n inner = type(m[0])\\n z = zip(*m)\\n return (type(m))(\\n map(inner, z) if tuple != inner else z\\n )\\n else:\\n return m\\n\\n\\nif __name__ == '__main__':\\n\\n # TRANSPOSING FOUR BASIC TYPES OF PYTHON MATRIX\\n # Cartesian product of (Outer, Inner) with (List, Tuple)\\n\\n # Matrix any = Tuple of Tuples of any type\\n tts = ((1, 2, 3), (4, 5, 6), (7, 8, 9))\\n\\n # Matrix any = Tuple of Lists of any type\\n tls = ([1, 2, 3], [4, 5, 6], [7, 8, 9])\\n\\n emptyTuple = ()\\n\\n # Matrix any = List of Lists of any type\\n lls = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]\\n\\n # Matrix any = List of Tuples of any type\\n lts = [(1, 2, 3), (4, 5, 6), (7, 8, 9)]\\n\\n emptyList = []\\n\\n print('transpose function :: (Transposition without type change):\\\\n')\\n for m in [emptyTuple, tts, tls, emptyList, lls, lts]:\\n tm = transpose(m)\\n print (\\n type(tm).__name__ + (\\n (' of ' + type(tm[0]).__name__) if m else ''\\n ) + ' :: ' + str(m) + ' -> ' + str(tm)\\n )\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"# Uneven list of lists\\nuls = [[10, 11], [20], [], [30, 31, 32]]\\n\\nprint (\\n list(zip(*uls))\\n)\\n\\n# --> []\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Transposition of row sets with possible gaps'''\\n\\nfrom collections import defaultdict\\n\\n\\n# listTranspose :: [[a]] -> [[a]]\\ndef listTranspose(xss):\\n '''Transposition of a matrix which may\\n contain gaps.\\n '''\\n def go(xss):\\n if xss:\\n h, *t = xss\\n return (\\n [[h[0]] + [xs[0] for xs in t if xs]] + (\\n go([h[1:]] + [xs[1:] for xs in t])\\n )\\n ) if h and isinstance(h, list) else go(t)\\n else:\\n return []\\n return go(xss)\\n\\n\\n# TEST ----------------------------------------------------\\n# main :: IO ()\\ndef main():\\n '''Tests with various lists of rows or non-row data.'''\\n\\n def labelledList(kxs):\\n k, xs = kxs\\n return k + ': ' + showList(xs)\\n\\n print(\\n fTable(\\n __doc__ + ':\\\\n'\\n )(labelledList)(fmapFn(showList)(snd))(\\n fmapTuple(listTranspose)\\n )([\\n ('Square', [[1, 2, 3], [4, 5, 6], [7, 8, 9]]),\\n ('Rectangle', [[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]]),\\n ('Rows with gaps', [[10, 11], [20], [], [31, 32, 33]]),\\n ('Single row', [[1, 2, 3]]),\\n ('Single row, one cell', [[1]]),\\n ('Not rows', [1, 2, 3]),\\n ('Nothing', [])\\n ])\\n )\\n\\n\\n# TEST RESULT FORMATTING ----------------------------------\\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# fmapFn :: (a -> b) -> (r -> a) -> r -> b\\ndef fmapFn(f):\\n '''The application of f to the result of g.\\n fmap over a function is composition.\\n '''\\n return lambda g: lambda x: f(g(x))\\n\\n\\n# fmapTuple :: (a -> b) -> (c, a) -> (c, b)\\ndef fmapTuple(f):\\n '''A pair in which f has been\\n applied to the second item.\\n '''\\n return lambda ab: (ab[0], f(ab[1])) if (\\n 2 == len(ab)\\n ) else None\\n\\n\\n# show :: a -> String\\ndef show(x):\\n '''Stringification of a value.'''\\n def go(v):\\n return defaultdict(lambda: repr, [\\n ('list', showList)\\n # ('Either', showLR),\\n # ('Maybe', showMaybe),\\n # ('Tree', drawTree)\\n ])[\\n typeName(v)\\n ](v)\\n return go(x)\\n\\n\\n# showList :: [a] -> String\\ndef showList(xs):\\n '''Stringification of a list.'''\\n return '[' + ','.join(show(x) for x in xs) + ']'\\n\\n\\n# snd :: (a, b) -> b\\ndef snd(tpl):\\n '''Second member of a pair.'''\\n return tpl[1]\\n\\n\\n# typeName :: a -> String\\ndef typeName(x):\\n '''Name string for a built-in or user-defined type.\\n Selector for type-specific instances\\n of polymorphic functions.\\n '''\\n if isinstance(x, dict):\\n return x.get('type') if 'type' in x else 'dict'\\n else:\\n return 'iter' if hasattr(x, '__next__') else (\\n type(x).__name__\\n )\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ ' [ [ ] ]\\n over 0 peek size of\\n [] rot\\n witheach join\\n witheach\\n [ dip behead\\n nested join\\n nested join ] ] is transpose ( [ --> [ )\\n\\n ' [ [ 1 2 ] [ 3 4 ] [ 5 6 ] ]\\n dup echo cr cr\\n transpose dup echo cr cr\\n transpose echo cr\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"b <- 1:5\\nm <- matrix(c(b, b^2, b^3, b^4), 5, 4)\\nprint(m)\\ntm <- t(m)\\nprint(tm)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(require math)\\n(matrix-transpose (matrix [[1 2] [3 4]]))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"# Transposition can be done with the reduced zip meta-operator\\n# on list-of-lists data structures\\n\\nsay [Z] (<A B C D>, <E F G H>, <I J K L>);\\n\\n# For native shaped arrays, a more traditional procedure of copying item-by-item\\n# Here the resulting matrix is also a native shaped array\\n\\nmy @a[3;4] =\\n [\\n [<A B C D>],\\n [<E F G H>],\\n [<I J K L>],\\n ];\\n\\n(my $n, my $m) = @a.shape;\\nmy @b[$m;$n];\\nfor ^$m X ^$n -> (\\\\i, \\\\j) {\\n @b[i;j] = @a[j;i];\\n}\\n\\nsay @b;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"public rel[real, real, real] matrixTranspose(rel[real x, real y, real v] matrix){\\n return {<y, x, v> | <x, y, v> <- matrix};\\n}\\n\\n//a matrix\\npublic rel[real x, real y, real v] matrixA = {\\n<0.0,0.0,12.0>, <0.0,1.0, 6.0>, <0.0,2.0,-4.0>,\\n<1.0,0.0,-51.0>, <1.0,1.0,167.0>, <1.0,2.0,24.0>,\\n<2.0,0.0,4.0>, <2.0,1.0,-68.0>, <2.0,2.0,-41.0>\\n};\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"/*REXX program transposes any sized rectangular matrix, displays before & after matrices*/\\n@.=; @.1 = 1.02 2.03 3.04 4.05 5.06 6.07 7.08\\n @.2 = 111 2222 33333 444444 5555555 66666666 777777777\\nw=0\\n do row=1 while @.row\\\\==''\\n do col=1 until @.row==''; parse var @.row A.row.col @.row\\n w=max(w, length(A.row.col) ) /*max width for elements*/\\n end /*col*/ /*(used to align ouput).*/\\n end /*row*/ /* [↑] build matrix A from the @ lists*/\\nrow= row-1 /*adjust for DO loop index increment.*/\\n do j=1 for row /*process each row of the matrix.*/\\n do k=1 for col /* \\\" \\\" column \\\" \\\" \\\" */\\n B.k.j= A.j.k /*transpose the A matrix (into B). */\\n end /*k*/\\n end /*j*/\\ncall showMat 'A', row, col /*display the A matrix to terminal.*/\\ncall showMat 'B', col, row /* \\\" \\\" B \\\" \\\" \\\" */\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nshowMat: arg mat,rows,cols; say; say center( mat 'matrix', (w+1)*cols +4, \\\"─\\\")\\n do r=1 for rows; _= /*newLine*/\\n do c=1 for cols; _=_ right( value( mat'.'r\\\".\\\"c), w) /*append.*/\\n end /*c*/\\n say _ /*1 line.*/\\n end /*r*/; return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"load \\\"stdlib.ring\\\"\\ntranspose = newlist(5,4)\\nmatrix = [[78,19,30,12,36], [49,10,65,42,50], [30,93,24,78,10], [39,68,27,64,29]]\\nfor i = 1 to 5\\n for j = 1 to 4\\n transpose[i][j] = matrix[j][i]\\n see \\\"\\\" + transpose[i][j] + \\\" \\\"\\n next\\n see nl\\nnext\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \" >> m = rand(3,5)\\n 0.41844289 0.476591435 0.75054022 0.226388925 0.963880314\\n 0.91267171 0.941762397 0.464227895 0.693482786 0.203839405\\n 0.261512966 0.157981873 0.26582235 0.11557427 0.0442493069\\n>> m'\\n 0.41844289 0.91267171 0.261512966\\n 0.476591435 0.941762397 0.157981873\\n 0.75054022 0.464227895 0.26582235\\n 0.226388925 0.693482786 0.11557427\\n 0.963880314 0.203839405 0.0442493069\\n\",\n \"language\": \"RLaB\"\n },\n {\n \"code\": \"m=[[1, 1, 1, 1],\\n [2, 4, 8, 16],\\n [3, 9, 27, 81],\\n [4, 16, 64, 256],\\n [5, 25,125, 625]]\\nputs m.transpose\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"require 'matrix'\\n\\nm=Matrix[[1, 1, 1, 1],\\n [2, 4, 8, 16],\\n [3, 9, 27, 81],\\n [4, 16, 64, 256],\\n [5, 25,125, 625]]\\nputs m.transpose\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"def transpose(m)\\n m[0].zip(*m[1..-1])\\nend\\np transpose([[1,2,3],[4,5,6]])\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"mtrx$ =\\\"4, 3, 0, 0.10, 0.20, 0.30, 0.40, 0.50, 0.60, 0.70, 0.80, 0.90, 1.00, 1.10\\\"\\n\\nprint \\\"Transpose of matrix\\\"\\ncall DisplayMatrix mtrx$\\nprint \\\" =\\\"\\nMatrixT$ =MatrixTranspose$(mtrx$)\\ncall DisplayMatrix MatrixT$\\n\\nend\\n\\nfunction MatrixTranspose$(in$)\\n w\\t= val(word$(in$, 1, \\\",\\\")) ' swap w and h parameters\\n h\\t= val(word$(in$, 2, \\\",\\\"))\\n t$\\t= str$(h); \\\",\\\"; str$(w); \\\",\\\"\\n for i =1 to w\\n for j =1 to h\\n t$ = t$ +word$(in$, 2 +i +(j -1) *w, \\\",\\\") +\\\",\\\"\\n next j\\n next i\\nMatrixTranspose$ =left$(t$, len(t$) -1)\\nend function\\n\\nsub DisplayMatrix in$ ' Display looking like a matrix!\\nhtml \\\"<table border=2>\\\"\\n w\\t= val(word$(in$, 1, \\\",\\\"))\\n h\\t= val(word$(in$, 2, \\\",\\\"))\\n for i =0 to h -1\\n html \\\"<tr align=right>\\\"\\n for j =1 to w\\n term$\\t= word$(in$, j +2 +i *w, \\\",\\\")\\n html \\\"<td>\\\";val(term$);\\\"</td>\\\"\\n next j\\nhtml \\\"</tr>\\\"\\nnext i\\nhtml \\\"</table>\\\"\\nend sub\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"struct Matrix {\\n dat: [[i32; 3]; 3]\\n}\\n\\n\\n\\nimpl Matrix {\\n pub fn transpose_m(a: Matrix) -> Matrix\\n {\\n let mut out = Matrix {\\n dat: [[0, 0, 0],\\n [0, 0, 0],\\n [0, 0, 0]\\n ]\\n };\\n\\n for i in 0..3{\\n for j in 0..3{\\n\\n out.dat[i][j] = a.dat[j][i];\\n }\\n }\\n\\n out\\n }\\n\\n pub fn print(self)\\n {\\n for i in 0..3 {\\n for j in 0..3 {\\n print!(\\\"{} \\\", self.dat[i][j]);\\n }\\n print!(\\\"\\\\n\\\");\\n }\\n }\\n}\\n\\nfn main()\\n{\\n let a = Matrix {\\n dat: [[1, 2, 3],\\n [4, 5, 6],\\n [7, 8, 9] ]\\n };\\n\\nlet c = Matrix::transpose_m(a);\\n c.print();\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"fn main() {\\n let m = vec![vec![1, 2, 3], vec![4, 5, 6]];\\n println!(\\\"Matrix:\\\\n{}\\\", matrix_to_string(&m));\\n let t = matrix_transpose(m);\\n println!(\\\"Transpose:\\\\n{}\\\", matrix_to_string(&t));\\n}\\n\\nfn matrix_to_string(m: &Vec<Vec<i32>>) -> String {\\n m.iter().fold(\\\"\\\".to_string(), |a, r| {\\n a + &r\\n .iter()\\n .fold(\\\"\\\".to_string(), |b, e| b + \\\"\\\\t\\\" + &e.to_string())\\n + \\\"\\\\n\\\"\\n })\\n}\\n\\nfn matrix_transpose(m: Vec<Vec<i32>>) -> Vec<Vec<i32>> {\\n let mut t = vec![Vec::with_capacity(m.len()); m[0].len()];\\n for r in m {\\n for i in 0..r.len() {\\n t[i].push(r[i]);\\n }\\n }\\n t\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"scala> Array.tabulate(4)(i => Array.tabulate(4)(j => i*4 + j))\\nres12: Array[Array[Int]] = Array(Array(0, 1, 2, 3), Array(4, 5, 6, 7), Array(8, 9, 10, 11), Array(12, 13, 14, 15))\\n\\nscala> res12.transpose\\nres13: Array[Array[Int]] = Array(Array(0, 4, 8, 12), Array(1, 5, 9, 13), Array(2, 6, 10, 14), Array(3, 7, 11, 15))\\n\\nscala> res12 map (_ map (\\\"%2d\\\" format _) mkString \\\" \\\") mkString \\\"\\\\n\\\"\\nres16: String =\\n 0 1 2 3\\n 4 5 6 7\\n 8 9 10 11\\n12 13 14 15\\n\\nscala> res13 map (_ map (\\\"%2d\\\" format _) mkString \\\" \\\") mkString \\\"\\\\n\\\"\\nres17: String =\\n 0 4 8 12\\n 1 5 9 13\\n 2 6 10 14\\n 3 7 11 15\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (transpose m)\\n (apply map list m))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"float.s7i\\\";\\n\\nconst type: matrix is array array float;\\n\\nconst func matrix: transpose (in matrix: aMatrix) is func\\n result\\n var matrix: transposedMatrix is matrix.value;\\n local\\n var integer: i is 0;\\n var integer: j is 0;\\n begin\\n transposedMatrix := length(aMatrix[1]) times length(aMatrix) times 0.0;\\n for i range 1 to length(aMatrix) do\\n for j range 1 to length(aMatrix[1]) do\\n transposedMatrix[j][i] := aMatrix[i][j];\\n end for;\\n end for;\\n end func;\\n\\nconst proc: write (in matrix: aMatrix) is func\\n local\\n var integer: line is 0;\\n var integer: column is 0;\\n begin\\n for line range 1 to length(aMatrix) do\\n for column range 1 to length(aMatrix[line]) do\\n write(\\\" \\\" <& aMatrix[line][column] digits 2);\\n end for;\\n writeln;\\n end for;\\n end func;\\n\\nconst matrix: testMatrix is [] (\\n [] (0.0, 0.1, 0.2, 0.3),\\n [] (0.4, 0.5, 0.6, 0.7),\\n [] (0.8, 0.9, 1.0, 1.1));\\n\\nconst proc: main is func\\n begin\\n writeln(\\\"Before Transposition:\\\");\\n write(testMatrix);\\n writeln;\\n writeln(\\\"After Transposition:\\\");\\n write(transpose(testMatrix));\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"func transpose(matrix) {\\n matrix[0].range.map{|i| matrix.map{_[i]}};\\n};\\n\\nvar m = [\\n [1, 1, 1, 1],\\n [2, 4, 8, 16],\\n [3, 9, 27, 81],\\n [4, 16, 64, 256],\\n [5, 25, 125, 625],\\n];\\n\\ntranspose(m).each { |row|\\n \\\"%5d\\\" * row.len -> printlnf(row...);\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"(1) -> originalMatrix := matrix [[1, 1, 1, 1],[2, 4, 8, 16], _\\n [3, 9, 27, 81],[4, 16, 64, 256], _\\n [5, 25, 125, 625]]\\n\\n +1 1 1 1 +\\n | |\\n |2 4 8 16 |\\n | |\\n (1) |3 9 27 81 |\\n | |\\n |4 16 64 256|\\n | |\\n +5 25 125 625+\\n Type: Matrix(Integer)\\n(2) -> transposedMatrix := transpose(originalMatrix)\\n\\n +1 2 3 4 5 +\\n | |\\n |1 4 9 16 25 |\\n (2) | |\\n |1 8 27 64 125|\\n | |\\n +1 16 81 256 625+\\n Type: Matrix(Integer)\\n\",\n \"language\": \"SPAD\"\n },\n {\n \"code\": \"function transpose(A) {\\n return map(range(sizeof A), function(k, idx) {\\n return map(A, function(k, row) {\\n return row[idx];\\n });\\n });\\n}\\n\",\n \"language\": \"Sparkling\"\n },\n {\n \"code\": \". mat a=1,2,3\\\\4,5,6\\n. mat b=a'\\n. mat list a\\n\\na[2,3]\\n c1 c2 c3\\nr1 1 2 3\\nr2 4 5 6\\n\\n. mat list b\\n\\nb[3,2]\\n r1 r2\\nc1 1 4\\nc2 2 5\\nc3 3 6\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \": a=1,1i\\n\\n: a\\n 1 2\\n +-----------+\\n 1 | 1 1i |\\n +-----------+\\n\\n: a'\\n 1\\n +-------+\\n 1 | 1 |\\n 2 | -1i |\\n +-------+\\n\\n: transposeonly(a)\\n 1\\n +------+\\n 1 | 1 |\\n 2 | 1i |\\n +------+\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"@inlinable\\npublic func matrixTranspose<T>(_ matrix: [[T]]) -> [[T]] {\\n guard !matrix.isEmpty else {\\n return []\\n }\\n\\n var ret = Array(repeating: [T](), count: matrix[0].count)\\n\\n for row in matrix {\\n for j in 0..<row.count {\\n ret[j].append(row[j])\\n }\\n }\\n\\n return ret\\n}\\n\\n@inlinable\\npublic func printMatrix<T>(_ matrix: [[T]]) {\\n guard !matrix.isEmpty else {\\n print()\\n\\n return\\n }\\n\\n let rows = matrix.count\\n let cols = matrix[0].count\\n\\n for i in 0..<rows {\\n for j in 0..<cols {\\n print(matrix[i][j], terminator: \\\" \\\")\\n }\\n\\n print()\\n }\\n}\\n\\nlet m1 = [\\n [1, 2, 3],\\n [4, 5, 6]\\n]\\n\\nprint(\\\"Input:\\\")\\nprintMatrix(m1)\\n\\n\\nlet m2 = matrixTranspose(m1)\\n\\nprint(\\\"Output:\\\")\\nprintMatrix(m2)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"templates transpose\\n def a: $;\\n [1..$a(1)::length -> $a(1..last;$)] !\\nend transpose\\n\\ntemplates printMatrix&{w:}\\n templates formatN\\n @: [];\\n $ -> #\\n '$@ -> $::length~..$w -> ' ';$@(last..1:-1)...;' !\\n when <1..> do ..|@: $ mod 10; $ ~/ 10 -> #\\n end formatN\\n $... -> '|$(1) -> formatN;$(2..last)... -> ', $ -> formatN;';|\\n' !\\nend printMatrix\\n\\ndef m: [[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12]];\\n'before:\\n' -> !OUT::write\\n$m -> printMatrix&{w:2} -> !OUT::write\\n\\ndef mT: $m -> transpose;\\n'\\ntransposed:\\n' -> !OUT::write\\n$mT -> printMatrix&{w:2} -> !OUT::write\\n\",\n \"language\": \"Tailspin\"\n },\n {\n \"code\": \"package require Tcl 8.5\\nnamespace path ::tcl::mathfunc\\n\\nproc size {m} {\\n set rows [llength $m]\\n set cols [llength [lindex $m 0]]\\n return [list $rows $cols]\\n}\\nproc transpose {m} {\\n lassign [size $m] rows cols\\n set new [lrepeat $cols [lrepeat $rows \\\"\\\"]]\\n for {set i 0} {$i < $rows} {incr i} {\\n for {set j 0} {$j < $cols} {incr j} {\\n lset new $j $i [lindex $m $i $j]\\n }\\n }\\n return $new\\n}\\nproc print_matrix {m {fmt \\\"%.17g\\\"}} {\\n set max [widest $m $fmt]\\n lassign [size $m] rows cols\\n for {set i 0} {$i < $rows} {incr i} {\\n for {set j 0} {$j < $cols} {incr j} {\\n\\t set s [format $fmt [lindex $m $i $j]]\\n puts -nonewline [format \\\"%*s \\\" [lindex $max $j] $s]\\n }\\n puts \\\"\\\"\\n }\\n}\\nproc widest {m {fmt \\\"%.17g\\\"}} {\\n lassign [size $m] rows cols\\n set max [lrepeat $cols 0]\\n for {set i 0} {$i < $rows} {incr i} {\\n for {set j 0} {$j < $cols} {incr j} {\\n\\t set s [format $fmt [lindex $m $i $j]]\\n lset max $j [max [lindex $max $j] [string length $s]]\\n }\\n }\\n return $max\\n}\\n\\nset m {{1 1 1 1} {2 4 8 16} {3 9 27 81} {4 16 64 256} {5 25 125 625}}\\nprint_matrix $m \\\"%d\\\"\\nprint_matrix [transpose $m] \\\"%d\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"package require struct::matrix\\nstruct::matrix M\\nM deserialize {5 4 {{1 1 1 1} {2 4 8 16} {3 9 27 81} {4 16 64 256} {5 25 125 625}}}\\nM format 2string\\nM transpose\\nM format 2string\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"OPTION BASE 0\\nDIM matriz(3, 4)\\nDATA 78, 19, 30, 12, 36\\nDATA 49, 10, 65, 42, 50\\nDATA 30, 93, 24, 78, 10\\nDATA 39, 68, 27, 64, 29\\n\\nFOR f = 0 TO 3\\n FOR c = 0 TO 4\\n READ matriz(f, c)\\n NEXT c\\nNEXT f\\n\\nDIM mtranspuesta(0 TO 4, 0 TO 3)\\n\\nFOR fila = LBOUND(matriz,1) TO UBOUND(matriz,1)\\n FOR columna = LBOUND(matriz,2) TO UBOUND(matriz,2)\\n LET mtranspuesta(columna, fila) = matriz(fila, columna)\\n PRINT matriz(fila, columna);\\n NEXT columna\\n PRINT\\nNEXT fila\\nPRINT\\n\\nFOR fila = LBOUND(mtranspuesta,1) TO UBOUND(mtranspuesta,1)\\n FOR columna = LBOUND(mtranspuesta,2) TO UBOUND(mtranspuesta,2)\\n PRINT mtranspuesta(fila, columna);\\n NEXT columna\\n PRINT\\nNEXT fila\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"#cast %eLL\\n\\nexample =\\n\\n~&K7 <\\n <1.,2.,3.,4.>,\\n <5.,6.,7.,8.>,\\n <9.,10.,11.,12.>>\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"Function transpose(m As Variant) As Variant\\n transpose = WorksheetFunction.transpose(m)\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"'create and display the initial matrix\\nWScript.StdOut.WriteLine \\\"Initial Matrix:\\\"\\nx = 4 : y = 6 : n = 1\\nDim matrix()\\nReDim matrix(x,y)\\nFor i = 0 To y\\n\\tFor j = 0 To x\\n\\t\\tmatrix(j,i) = n\\n\\t\\tIf j < x Then\\n\\t\\t\\tWScript.StdOut.Write n & vbTab\\n\\t\\tElse\\n\\t\\t\\tWScript.StdOut.Write n\\n\\t\\tEnd If\\n\\t\\tn = n + 1\\n\\tNext\\n\\tWScript.StdOut.WriteLine\\nNext\\n\\n'display the trasposed matrix\\nWScript.StdOut.WriteBlankLines(1)\\nWScript.StdOut.WriteLine \\\"Transposed Matrix:\\\"\\nFor i = 0 To x\\n\\tFor j = 0 To y\\n\\t\\tIf j < y Then\\n\\t\\t\\tWScript.StdOut.Write matrix(i,j) & vbTab\\n\\t\\tElse\\n\\t\\t\\tWScript.StdOut.Write matrix(i,j)\\n\\t\\tEnd If\\n\\tNext\\n\\tWScript.StdOut.WriteLine\\nNext\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"Option Explicit\\n'----------------------------------------------------------------------\\nFunction TransposeMatrix(InitMatrix() As Long, TransposedMatrix() As Long)\\nDim l1 As Long, l2 As Long, u1 As Long, u2 As Long, r As Long, c As Long\\n l1 = LBound(InitMatrix, 1)\\n l2 = LBound(InitMatrix, 2)\\n u1 = UBound(InitMatrix, 1)\\n u2 = UBound(InitMatrix, 2)\\n ReDim TransposedMatrix(l2 To u2, l1 To u1)\\n For r = l1 To u1\\n For c = l2 To u2\\n TransposedMatrix(c, r) = InitMatrix(r, c)\\n Next c\\n Next r\\nEnd Function\\n'----------------------------------------------------------------------\\nSub PrintMatrix(a() As Long)\\nDim l1 As Long, l2 As Long, u1 As Long, u2 As Long, r As Long, c As Long\\nDim s As String * 8\\n l1 = LBound(a(), 1)\\n l2 = LBound(a(), 2)\\n u1 = UBound(a(), 1)\\n u2 = UBound(a(), 2)\\n For r = l1 To u1\\n For c = l2 To u2\\n RSet s = Str$(a(r, c))\\n Debug.Print s;\\n Next c\\n Debug.Print\\n Next r\\nEnd Sub\\n'----------------------------------------------------------------------\\nSub TranspositionDemo(ByVal DimSize1 As Long, ByVal DimSize2 As Long)\\nDim r, c, cc As Long\\nDim a() As Long\\nDim b() As Long\\n cc = DimSize2\\n DimSize1 = DimSize1 - 1\\n DimSize2 = DimSize2 - 1\\n ReDim a(0 To DimSize1, 0 To DimSize2)\\n For r = 0 To DimSize1\\n For c = 0 To DimSize2\\n a(r, c) = (cc * r) + c + 1\\n Next c\\n Next r\\n Debug.Print \\\"initial matrix:\\\"\\n PrintMatrix a()\\n TransposeMatrix a(), b()\\n Debug.Print \\\"transposed matrix:\\\"\\n PrintMatrix b()\\nEnd Sub\\n'----------------------------------------------------------------------\\nSub Main()\\n TranspositionDemo 3, 3\\n TranspositionDemo 3, 7\\nEnd Sub\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"@zipm [[1 2 3] [4 5 6] [7 8 9]]\\n\",\n \"language\": \"Wortel\"\n },\n {\n \"code\": \"import \\\"./matrix\\\" for Matrix\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar m = Matrix.new([\\n [ 1, 2, 3],\\n [ 4, 5, 6],\\n [ 7, 8, 9],\\n [10, 11, 12]\\n])\\n\\nSystem.print(\\\"Original:\\\\n\\\")\\nFmt.mprint(m, 2, 0)\\nSystem.print(\\\"\\\\nTransposed:\\\\n\\\")\\nFmt.mprint(m.transpose, 2, 0)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"proc Transpose(M, R, C, N); \\\\Transpose matrix M to N\\nint M, R, C, N; \\\\rows and columns\\nint I, J;\\n[for I:= 0 to R-1 do\\n for J:= 0 to C-1 do\\n N(J,I):= M(I,J);\\n];\\n\\nproc ShowMat(M, R, C); \\\\Display matrix M\\nint M, R, C; \\\\rows and columns\\nint I, J;\\n[for I:= 0 to R-1 do\\n [for J:= 0 to C-1 do\\n RlOut(0, float(M(I,J)));\\n CrLf(0);\\n ];\\n];\\n\\nint M, N(4,3);\\n[M:= [[1, 2, 3, 4], \\\\3 rows by 4 columns\\n [5, 6, 7, 8],\\n [9,10,11,12]];\\nFormat(4, 0);\\nShowMat(M, 3, 4);\\nCrLf(0);\\nTranspose(M, 3, 4, N);\\nShowMat(N, 4, 3);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"dim matriz(4,5)\\ndim mtranspuesta(5,4)\\n\\nfor fila = 1 to arraysize(matriz(), 1)\\n for columna = 1 to arraysize(matriz(), 2)\\n\\t read matriz(fila, columna)\\n\\t\\tprint matriz(fila, columna);\\n\\t\\tmtranspuesta(columna, fila) = matriz(fila, columna)\\n\\tnext columna\\n\\tprint\\nnext fila\\nprint\\n\\nfor fila = 1 to arraysize(mtranspuesta(), 1)\\n for columna = 1 to arraysize(mtranspuesta(), 2)\\n\\t\\tprint mtranspuesta(fila, columna);\\n next columna\\n\\tprint\\nnext fila\\nend\\n\\ndata 78,19,30,12,36\\ndata 49,10,65,42,50\\ndata 30,93,24,78,10\\ndata 39,68,27,64,29\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"var [const] GSL=Import(\\\"zklGSL\\\");\\t// libGSL (GNU Scientific Library)\\nGSL.Matrix(2,3).set(1,2,3, 4,5,6).transpose().format(5).println(); // in place\\nprintln(\\\"---\\\");\\nGSL.Matrix(2,2).set(1,2, 3,4).transpose().format(5).println(); // in place\\nprintln(\\\"---\\\");\\nGSL.Matrix(3,1).set(1,2,3).transpose().format(5).println(); // in place\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn transpose(M){\\n if(M.len()==1) M[0].pump(List,List.create); // 1 row --> n columns\\n else M[0].zip(M.xplode(1));\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"m:=T(T(1,2,3),T(4,5,6)); transpose(m).println();\\nm:=L(L(1,\\\"a\\\"),L(2,\\\"b\\\"),L(3,\\\"c\\\")); transpose(m).println();\\ntranspose(L(L(1,2,3))).println();\\ntranspose(L(L(1),L(2),L(3))).println();\\ntranspose(L(L(1))).println();\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"module MatrixOps;\\ntype\\n\\tMatrix = array {math} *,* of integer;\\n\\n\\n\\tprocedure WriteMatrix(x: array {math} *,* of integer);\\n\\tvar\\n\\t\\ti,j: integer;\\n\\tbegin\\n\\t\\tfor i := 0 to len(x,0) - 1 do\\n\\t\\t\\tfor j := 0 to len(x,1) - 1 do\\n\\t\\t\\t\\twrite(x[i,j]);\\n\\t\\t\\tend;\\n\\t\\t\\twriteln;\\n\\t\\tend\\t\\n\\tend WriteMatrix;\\n\\n\\tprocedure Transposition;\\n\\tvar\\n\\t\\tm,x: Matrix;\\n\\tbegin\\n\\t\\tm := [[1,2,3],[3,4,5]]; (* matrix initialization *)\\n\\t\\tx := !m; (* matrix trasposition *)\\n\\t\\tWriteMatrix(x);\\n\\tend Transposition;\\n\\nbegin\\n\\tTransposition;\\nend MatrixOps.\\n\",\n \"language\": \"Zonnon\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Matrix-transposition"}}},{"rowIdx":473,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Maximum_triangle_path_sum\n","language":"00-META"},{"code":"Starting from the top of a pyramid of numbers like this, you can walk down going one step on the right or on the left, until you reach the bottom row:\n<pre>\n 55\n 94 48\n 95 30 96\n 77 71 26 67\n</pre>\n\nOne of such walks is 55 - 94 - 30 - 26. \nYou can compute the total of the numbers you have seen in such walk, \nin this case it's 205.\n\nYour problem is to find the maximum total among all possible paths from the top to the bottom row of the triangle. In the little example above it's 321.\n\n\n;Task:\nFind the maximum total in the triangle below:\n<pre>\n 55\n 94 48\n 95 30 96\n 77 71 26 67\n 97 13 76 38 45\n 07 36 79 16 37 68\n 48 07 09 18 70 26 06\n 18 72 79 46 59 79 29 90\n 20 76 87 11 32 07 07 49 18\n 27 83 58 35 71 11 25 57 29 85\n 14 64 36 96 27 11 58 56 92 18 55\n 02 90 03 60 48 49 41 46 33 36 47 23\n 92 50 48 02 36 59 42 79 72 20 82 77 42\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\n</pre>\n\nSuch numbers can be included in the solution code, or read from a \"triangle.txt\" file.\n\nThis task is derived from the [http://projecteuler.net/problem=18 Euler Problem #18].\n<br><br>\n\n","language":"00-TASK"},{"code":"F solve(&tri)\n L tri.len > 1\n V t0 = tri.pop()\n V t1 = tri.pop()\n tri.append(enumerate(t1).map((i, t) -> max(@t0[i], @t0[i + 1]) + t))\n R tri[0][0]\n\nV data = ‘ 55\n 94 48\n 95 30 96\n 77 71 26 67\n 97 13 76 38 45\n 07 36 79 16 37 68\n 48 07 09 18 70 26 06\n 18 72 79 46 59 79 29 90\n 20 76 87 11 32 07 07 49 18\n 27 83 58 35 71 11 25 57 29 85\n 14 64 36 96 27 11 58 56 92 18 55\n 02 90 03 60 48 49 41 46 33 36 47 23\n 92 50 48 02 36 59 42 79 72 20 82 77 42\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93’\n\nprint(solve(&data.split(\"\\n\").map(row -> row.split(‘ ’, group_delimiters' 1B).map(Int))))\n","language":"11l"},{"code":"* Maximum triangle path sum - 28/04/2023\nMAXTRIA CSECT\n USING MAXTRIA,R13 base register\n B 72(R15) skip savearea\n DC 17F'0' savearea\n SAVE (14,12) save previous context\n ST R13,4(R15) link backward\n ST R15,8(R13) link forward\n LR R13,R15 set addressability\n LA R9,1 k=1\n LA R6,1 i=1\n DO WHILE=(CH,R6,LE,=AL2(N)) do i=1 to hbound(t)\n LR R1,R6 i\n BCTR R1,0 -1\n MH R1,=AL2(X) *x\n LA R14,T(R1) @t(i)\n MVC C,0(R14) c=t(i)\n LA R7,1 j=1\n DO WHILE=(CR,R7,LE,R9) do j=1 to k\n MVC CC,C cc=substr(c,1,2)\n MVC XDEC,=CL12' ' clear\n MVC XDEC(L'CC),CC cc\n XDECI R2,XDEC r2=int(cc)\n LR R1,R9 k\n BCTR R1,0 -1\n MH R1,=AL2(N) *n\n LR R0,R7 j\n BCTR R0,0 -1\n AR R1,R0 (k-1)*n+(j-1)\n SLA R1,1 *2 (H)\n STH R2,MM(R1) m(k,j)=xdeci(substr(c,1,2),2)\n LA R10,X l=length(c)\n DO WHILE=(CH,R10,GE,=AL2(1)) do l=length(c) to 1 by -1\n LA R14,C-1 @c-1\n AR R14,R10 +l\n MVC CL,0(R14) cl=substr(c,l,1)\n IF CLI,CL,NE,C' ' THEN if substr(c,l,1)^=' ' then\n B LEAVEL leave l\n ENDIF , endif\n BCTR R10,0 l--\n ENDDO , enddo l\nLEAVEL EQU *\n IF CH,R10,GT,=AL2(4) THEN if l>4 then\n LR R5,R10 l\n SH R5,=H'3' l-3 (mvcl source length)\n LA R3,L'C64 x (mvcl target length)\n LA R4,C+3 @c+3 (mvcl source)\n LA R2,C64 @c64 (mvcl target)\n ICM R3,B'1000',=C' ' padding char\n MVCL R2,R4 mvcl @c64[64] <- @c+3[l-3]\n MVC C,C64 c=substr(c,4,l-3)\n ENDIF , endif\n LA R7,1(R7) j++\n ENDDO , enddo j\n LA R9,1(R9) k=k+1\n LA R6,1(R6) i++\n ENDDO , enddo i\n LR R6,R9 k\n SH R6,=H'2' k-2\n DO WHILE=(CH,R6,GE,=AL2(1)) do i=k-2 to 1 by -1\n LA R7,1 j=1\n DO WHILE=(CR,R7,LE,R6) do j=1 to i\n LR R1,R6 i\n MH R1,=AL2(N) *n\n LR R0,R7 j\n BCTR R0,0 j-1\n AR R1,R0 i*n+(j-1)\n SLA R1,1 *2 (H)\n LH R2,MM(R1) m(i+1,j)\n STH R2,S1 s1=m(i+1,j)\n LR R1,R6 i\n MH R1,=AL2(N) *n\n AR R1,R7 i*n+j\n SLA R1,1 *2 (H)\n LH R2,MM(R1) m(i+1,j+1)\n STH R2,S2 s2=m(i+1,j+1)\n LH R4,S1 s1\n IF CH,R4,GT,S2 THEN if s1>s2 then\n LH R8,S1 sm=s1\n ELSE , else\n LH R8,S2 sm=s2\n ENDIF , endif\n LR R1,R6 i\n BCTR R1,0 i-1\n MH R1,=AL2(N) *n\n LR R0,R7 j\n BCTR R0,0 j-1\n AR R1,R0 (i-1)*n+(j-1)\n SLA R1,1 *2 (H)\n LH R2,MM(R1) m(i,j)\n LR R10,R1 index m(i,j)\n AR R2,R8 m(i,j)+sm\n STH R2,MM(R10) m(i,j)=m(i,j)+sm\n LA R7,1(R7) j++\n ENDDO , enddo j\n BCTR R6,0 i--\n ENDDO , enddo i\n LH R1,MM m(1,1)\n XDECO R1,PG edit m(1,1)\n XPRNT PG,L'PG output m(1,1)\n L R13,4(0,R13) restore previous savearea pointer\n RETURN (14,12),RC=0 restore registers from calling save\nN EQU 18 n\nX EQU 64 x\nMM DS (N*N)H m(n,n)\nS1 DS H s1\nS2 DS H s2\nC DS CL(X) c\nCC DS CL2 cc\nCL DS CL1 cl\nC64 DS CL(X) c64\nPG DC CL80' ' buffer\nXDEC DS CL12 temp for xdeci xdeco\nT DC CL(X)'55' t(18) char(64)\n DC CL(X)'94 48'\n DC CL(X)'95 30 96'\n DC CL(X)'77 71 26 67'\n DC CL(X)'97 13 76 38 45'\n DC CL(X)'07 36 79 16 37 68'\n DC CL(X)'48 07 09 18 70 26 06'\n DC CL(X)'18 72 79 46 59 79 29 90'\n DC CL(X)'20 76 87 11 32 07 07 49 18'\n DC CL(X)'27 83 58 35 71 11 25 57 29 85'\n DC CL(X)'14 64 36 96 27 11 58 56 92 18 55'\n DC CL(X)'02 90 03 60 48 49 41 46 33 36 47 23'\n DC CL(X)'92 50 48 02 36 59 42 79 72 20 82 77 42'\n DC CL(X)'56 78 38 80 39 75 02 71 66 66 01 03 55 72'\n DC CL(X)'44 25 67 84 71 67 11 61 40 57 58 89 40 56 36'\n DC CL(X)'85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52'\n DC CL(X)'06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15'\n DC CL(X)'27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93'\n REGEQU\n END MAXTRIA\n","language":"360-Assembly"},{"code":"INT FUNC Max(INT a,b)\n IF a>b THEN RETURN (a) FI\nRETURN (b)\n\nPROC Main()\n DEFINE ROWCOUNT=\"18\"\n INT i,row,len,a,b\n INT ARRAY rows(ROWCOUNT)\n INT ARRAY data=[\n 55\n 94 48\n 95 30 96\n 77 71 26 67\n 97 13 76 38 45\n 07 36 79 16 37 68\n 48 07 09 18 70 26 06\n 18 72 79 46 59 79 29 90\n 20 76 87 11 32 07 07 49 18\n 27 83 58 35 71 11 25 57 29 85\n 14 64 36 96 27 11 58 56 92 18 55\n 02 90 03 60 48 49 41 46 33 36 47 23\n 92 50 48 02 36 59 42 79 72 20 82 77 42\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93]\n\n row=0 len=1\n FOR i=0 TO ROWCOUNT-1\n DO\n rows(i)=row\n row==+len len==+1\n OD\n\n row=ROWCOUNT-2\n WHILE row>=0\n DO\n len=row+1\n FOR i=0 TO len-1\n DO\n a=data(rows(row+1)+i)\n b=data(rows(row+1)+i+1)\n data(rows(row)+i)==+Max(a,b)\n OD\n row==-1\n OD\n\n PrintI(data(0))\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_Io; use Ada.Text_Io;\n\nprocedure Max_Sum is\n\n Triangle : array (Positive range <>) of integer :=\n (55,\n 94, 48,\n 95, 30, 96,\n 77, 71, 26, 67,\n 97, 13, 76, 38, 45,\n 07, 36, 79, 16, 37, 68,\n 48, 07, 09, 18, 70, 26, 06,\n 18, 72, 79, 46, 59, 79, 29, 90,\n 20, 76, 87, 11, 32, 07, 07, 49, 18,\n 27, 83, 58, 35, 71, 11, 25, 57, 29, 85,\n 14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55,\n 02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23,\n 92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42,\n 56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72,\n 44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36,\n 85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52,\n 06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15,\n 27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93);\n\n Last : Integer := Triangle'Length;\n Tn : Integer := 1;\n\nbegin\n while (Tn * (Tn + 1) / 2) < Last loop\n Tn := Tn + 1;\n end loop;\n for N in reverse 2 .. Tn loop\n for I in 2 .. N loop\n\t Triangle (Last - N) := Triangle (Last - N) +\n\t Integer'Max(Triangle (Last - 1), Triangle (Last));\n\t Last := Last - 1;\n end loop;\n Last := Last - 1;\n end loop;\n Put_Line(Integer'Image(Triangle(1)));\nend Max_Sum;\n","language":"Ada"},{"code":"# create a triangular array of the required values #\n\n [ 1]INT row 1 := ( 55 );\n [ 2]INT row 2 := ( 94, 48 );\n [ 3]INT row 3 := ( 95, 30, 96 );\n [ 4]INT row 4 := ( 77, 71, 26, 67 );\n [ 5]INT row 5 := ( 97, 13, 76, 38, 45 );\n [ 6]INT row 6 := ( 07, 36, 79, 16, 37, 68 );\n [ 7]INT row 7 := ( 48, 07, 09, 18, 70, 26, 06 );\n [ 8]INT row 8 := ( 18, 72, 79, 46, 59, 79, 29, 90 );\n [ 9]INT row 9 := ( 20, 76, 87, 11, 32, 07, 07, 49, 18 );\n [10]INT row 10 := ( 27, 83, 58, 35, 71, 11, 25, 57, 29, 85 );\n [11]INT row 11 := ( 14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55 );\n [12]INT row 12 := ( 02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23 );\n [13]INT row 13 := ( 92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42 );\n [14]INT row 14 := ( 56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72 );\n [15]INT row 15 := ( 44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36 );\n [16]INT row 16 := ( 85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52 );\n [17]INT row 17 := ( 06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15 );\n [18]INT row 18 := ( 27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93 );\n\n[18]REF[]INT triangle := ( row 1, row 2, row 3, row 4, row 5, row 6\n , row 7, row 8, row 9, row 10, row 11, row 12\n , row 13, row 14, row 15, row 16, row 17, row 18\n );\n\nPROC max = ( INT a, INT b )INT: IF a > b THEN a ELSE b FI;\n\n# working backwards, we replace the elements of each row with the sum of that #\n# element and the maximum of the two elements below it. #\n# That destroys the triangle but leaves element [1][1] equal to the required #\n# maximum #\n\n\nFOR row FROM UPB triangle - 1 BY -1 TO 1\nDO\n FOR element FROM 1 TO UPB triangle[row]\n DO\n # the elements \"under\" triangle[row][element] are #\n # triangle[row+1][element] and triangle[row+1][element+1] #\n triangle[row][element]\n +:= max( triangle[row+1][element], triangle[row+1][element+1] )\n OD\nOD;\n\nprint( ( triangle[1][1], newline ) )\n","language":"ALGOL-68"},{"code":"parse ← ⍎¨(~∊)∘⎕TC⊆⊢\nmaxpath ← ⊃(⊣+2⌈/⊢)/\n⎕ ← maxpath parse ⊃⎕NGET'G:\\triangle.txt'\n","language":"APL"},{"code":"---------------- MAXIMUM TRIANGLE PATH SUM ---------------\n\n-- Working from the bottom of the triangle upwards,\n-- summing each number with the larger of the two below\n-- until the maximum emerges at the top.\n\n-- maxPathSum :: [[Int]] -> Int\non maxPathSum(xss)\n\n -- With the last row as the initial accumulator,\n -- folding from the penultimate line,\n -- towards the top of the triangle:\n\n -- sumWithRowBelow :: [Int] -> [Int] -> [Int]\n script sumWithRowBelow\n on |λ|(row, accum)\n\n -- plusGreaterOfTwoBelow :: Int -> Int -> Int -> Int\n script plusGreaterOfTwoBelow\n on |λ|(x, intLeft, intRight)\n x + max(intLeft, intRight)\n end |λ|\n end script\n\n -- The accumulator, zipped with the tail of the\n -- accumulator, yields pairs of adjacent sums so far.\n\n zipWith3(plusGreaterOfTwoBelow, row, accum, tail(accum))\n end |λ|\n end script\n\n -- A list of lists folded down to a list of just one remaining integer.\n -- Head returns that integer from the list.\n\n head(foldr1(sumWithRowBelow, xss))\nend maxPathSum\n\n\n--------------------------- TEST -------------------------\non run\n\n maxPathSum({¬\n {55}, ¬\n {94, 48}, ¬\n {95, 30, 96}, ¬\n {77, 71, 26, 67}, ¬\n {97, 13, 76, 38, 45}, ¬\n {7, 36, 79, 16, 37, 68}, ¬\n {48, 7, 9, 18, 70, 26, 6}, ¬\n {18, 72, 79, 46, 59, 79, 29, 90}, ¬\n {20, 76, 87, 11, 32, 7, 7, 49, 18}, ¬\n {27, 83, 58, 35, 71, 11, 25, 57, 29, 85}, ¬\n {14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55}, ¬\n {2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23}, ¬\n {92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42}, ¬\n {56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72}, ¬\n {44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36}, ¬\n {85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52}, ¬\n {6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15}, ¬\n {27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93} ¬\n })\n\n --> 1320\nend run\n\n\n-------------------- GENERIC FUNCTIONS -------------------\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-- foldr1 :: (a -> a -> a) -> [a] -> a\non foldr1(f, xs)\n if length of xs > 1 then\n tell mReturn(f)\n set v to item -1 of xs\n set lng to length of xs\n repeat with i from lng - 1 to 1 by -1\n set v to |λ|(item i of xs, v, i, xs)\n end repeat\n return v\n end tell\n else\n xs\n end if\nend foldr1\n\n\n-- head :: [a] -> a\non head(xs)\n if length of xs > 0 then\n item 1 of xs\n else\n missing value\n end if\nend head\n\n\n-- max :: Ord a => a -> a -> a\non max(x, y)\n if x > y then\n x\n else\n y\n end if\nend max\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-- 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-- tail :: [a] -> [a]\non tail(xs)\n if length of xs > 1 then\n items 2 thru -1 of xs\n else\n {}\n end if\nend tail\n\n\n-- zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]\non zipWith3(f, xs, ys, zs)\n set lng to minimum({length of xs, length of ys, length of zs})\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, item i of zs)\n end repeat\n return lst\n end tell\nend zipWith3\n","language":"AppleScript"},{"code":"data: {:\n 55\n 94 48\n 95 30 96\n 77 71 26 67\n 97 13 76 38 45\n 07 36 79 16 37 68\n 48 07 09 18 70 26 06\n 18 72 79 46 59 79 29 90\n 20 76 87 11 32 07 07 49 18\n 27 83 58 35 71 11 25 57 29 85\n 14 64 36 96 27 11 58 56 92 18 55\n 02 90 03 60 48 49 41 46 33 36 47 23\n 92 50 48 02 36 59 42 79 72 20 82 77 42\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\n:}\n\nsolve: function [triangle][\n tri: triangle\n while [1 < size tri][\n t0: last tri\n chop 'tri\n loop.with:'i tri\\[dec size tri] 't ->\n tri\\[dec size tri]\\[i]: t + max @[t0\\[i] t0\\[inc i]]\n ]\n tri\\0\\0\n]\n\nprint solve map split.lines strip data 'x ->\n map split.by:\" \" strip x 'y ->\n to :integer y\n","language":"Arturo"},{"code":"fun maxpathsum(t): #: Array{Array{I}}\n let a = val t\n for i in a.length-1..-1..1, c in linearindices a[r]:\n a[r, c] += max(a[r+1, c], a[r=1, c+1])\n return a[1, 1]\n\nlet test = [\n [55],\n [94, 48],\n [95, 30, 96],\n [77, 71, 26, 67],\n [97, 13, 76, 38, 45],\n [07, 36, 79, 16, 37, 68],\n [48, 07, 09, 18, 70, 26, 06],\n [18, 72, 79, 46, 59, 79, 29, 90],\n [20, 76, 87, 11, 32, 07, 07, 49, 18],\n [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\n [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\n [02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23],\n [92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42],\n [56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72],\n [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\n [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52],\n [06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15],\n [27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\n]\n\n@print maxpathsum test\n","language":"Astro"},{"code":"data :=[\n(join ltrim\n 55,\n 94,48,\n 95,30,96,\n 77,71,26,67,\n 97,13,76,38,45,\n 07,36,79,16,37,68,\n 48,07,09,18,70,26,06,\n 18,72,79,46,59,79,29,90,\n 20,76,87,11,32,07,07,49,18,\n 27,83,58,35,71,11,25,57,29,85,\n 14,64,36,96,27,11,58,56,92,18,55,\n 02,90,03,60,48,49,41,46,33,36,47,23,\n 92,50,48,02,36,59,42,79,72,20,82,77,42,\n 56,78,38,80,39,75,02,71,66,66,01,03,55,72,\n 44,25,67,84,71,67,11,61,40,57,58,89,40,56,36,\n 85,32,25,85,57,48,84,35,47,62,17,01,01,99,89,52,\n 06,71,28,75,94,48,37,10,23,51,06,48,53,18,74,98,15,\n27,02,92,23,08,71,76,84,15,52,92,63,81,10,44,10,69,93\n)]\n\ni\t:= data.MaxIndex()\nrow\t:= Ceil((Sqrt(8*i+1) - 1) / 2)\npath:=[]\n\nloop % row {\n\tpath[i] := data[i]\n\ti--\n}\n\nwhile i {\n\trow := Ceil((Sqrt(8*i+1) - 1) / 2)\n\tpath[i] := data[i] \"+\" (data[i+row] > data[i+row+1] ? path[i+row] : path[i+row+1])\n\tdata[i] += data[i+row] > data[i+row+1] ? data[i+row] : data[i+row+1]\n\ti --\n}\n\nMsgBox % data[1] \"`n\" path[1]\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f MAXIMUM_TRIANGLE_PATH_SUM.AWK filename(s)\n{ printf(\"%s\\n\",$0)\n cols[FNR] = NF\n for (i=1; i<=NF; i++) {\n arr[FNR][i] = $i\n }\n}\nENDFILE {\n for (row=FNR-1; row>0; row--) {\n for (col=1; col<=cols[row]; col++) {\n arr[row][col] += max(arr[row+1][col],arr[row+1][col+1])\n }\n }\n printf(\"%d using %s\\n\\n\",arr[1][1],FILENAME)\n delete arr\n delete cols\n}\nEND {\n exit(0)\n}\nfunction max(x,y) { return((x > y) ? x : y) }\n","language":"AWK"},{"code":"arraybase 1\ndim ln(19)\nln[1] = \" 55\"\nln[2] = \" 94 48\"\nln[3] = \" 95 30 96\"\nln[4] = \" 77 71 26 67\"\nln[5] = \" 97 13 76 38 45\"\nln[6] = \" 07 36 79 16 37 68\"\nln[7] = \" 48 07 09 18 70 26 06\"\nln[8] = \" 18 72 79 46 59 79 29 90\"\nln[9] = \" 20 76 87 11 32 07 07 49 18\"\nln[10] = \" 27 83 58 35 71 11 25 57 29 85\"\nln[11] = \" 14 64 36 96 27 11 58 56 92 18 55\"\nln[12] = \" 02 90 03 60 48 49 41 46 33 36 47 23\"\nln[13] = \" 92 50 48 02 36 59 42 79 72 20 82 77 42\"\nln[14] = \" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\"\nln[15] = \" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\"\nln[16] = \" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\"\nln[17] = \" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\"\nln[18] = \" 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\"\nln[19] = \"end\"\n\ndim matrix(20,20)\nx = 1\ntam = 0\n\nfor n = 1 to length(ln) - 1\n\tln2 = trim(ln[n])\n\tfor y = 1 to x\n\t\tmatrix[x, y] = fromradix((left(ln2, 2)), 10)\n\t\tif length(ln2) > 4 then ln2 = mid(ln2, 4, length(ln2)-4)\n\tnext y\n\tx += 1\n\ttam += 1\nnext n\n\nfor x = tam - 1 to 1 step - 1\n\tfor y = 1 to x\n\t\ts1 = matrix[x+1, y]\n\t\ts2 = matrix[x+1, y+1]\n\t\tif s1 > s2 then\n\t\t\tmatrix[x, y] = matrix[x, y] + s1\n\t\telse\n\t\t\tmatrix[x, y] = matrix[x, y] + s2\n\t\tend if\n\tnext y\nnext x\n\nprint \" maximum triangle path sum = \" + matrix[1, 1]\n","language":"BASIC256"},{"code":"( \"\n 55\n 94 48\n 95 30 96\n 77 71 26 67\n 97 13 76 38 45\n 07 36 79 16 37 68\n 48 07 09 18 70 26 06\n 18 72 79 46 59 79 29 90\n 20 76 87 11 32 07 07 49 18\n 27 83 58 35 71 11 25 57 29 85\n 14 64 36 96 27 11 58 56 92 18 55\n 02 90 03 60 48 49 41 46 33 36 47 23\n 92 50 48 02 36 59 42 79 72 20 82 77 42\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\n\"\n : ?triangle\n& ( max\n = a b\n . !arg:(?a.?b)&(!a:>!b|!b)\n )\n& 0:?accumulator\n& whl\n ' ( @(!triangle:?row (\\n|\\r) ?triangle)\n & :?newaccumulator\n & 0:?first\n & whl\n ' ( @(!row:? #%?n (\" \" ?row|:?row))\n & !accumulator:#%?second ?accumulator\n & !newaccumulator max$(!first.!second)+!n:?newaccumulator\n & !second:?first\n )\n & !newaccumulator 0:?accumulator\n )\n& ( -1:?Max\n & !accumulator\n : ? (%@:>!Max:?Max&~) ?\n | out$!Max\n )\n)\n","language":"Bracmat"},{"code":"#include <stdio.h>\n#include <math.h>\n\n#define max(x,y) ((x) > (y) ? (x) : (y))\n\nint tri[] = {\n 55,\n\t94, 48,\n\t95, 30, 96,\n\t77, 71, 26, 67,\n\t97, 13, 76, 38, 45,\n\t7, 36, 79, 16, 37, 68,\n\t48, 7, 9, 18, 70, 26, 6,\n\t18, 72, 79, 46, 59, 79, 29, 90,\n\t20, 76, 87, 11, 32, 7, 7, 49, 18,\n\t27, 83, 58, 35, 71, 11, 25, 57, 29, 85,\n\t14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55,\n\t2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23,\n\t92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42,\n\t56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72,\n\t44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36,\n\t85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52,\n\t6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15,\n\t27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93\n};\n\nint main(void)\n{\n const int len = sizeof(tri) / sizeof(tri[0]);\n const int base = (sqrt(8*len + 1) - 1) / 2;\n int step = base - 1;\n int stepc = 0;\n\n int i;\n for (i = len - base - 1; i >= 0; --i) {\n tri[i] += max(tri[i + step], tri[i + step + 1]);\n if (++stepc == step) {\n step--;\n stepc = 0;\n }\n }\n\n printf(\"%d\\n\", tri[0]);\n return 0;\n}\n","language":"C"},{"code":"/* Algorithm complexity: n*log(n) */\n#include <iostream>\n\nint main( int argc, char* argv[] )\n{\n int triangle[] =\n {\n\t55,\n\t94, 48,\n\t95, 30, 96,\n\t77, 71, 26, 67,\n\t97, 13, 76, 38, 45,\n\t7, 36, 79, 16, 37, 68,\n\t48, 7, 9, 18, 70, 26, 6,\n\t18, 72, 79, 46, 59, 79, 29, 90,\n\t20, 76, 87, 11, 32, 7, 7, 49, 18,\n\t27, 83, 58, 35, 71, 11, 25, 57, 29, 85,\n\t14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55,\n\t2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23,\n\t92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42,\n\t56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72,\n\t44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36,\n\t85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52,\n\t6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15,\n\t27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93\n };\n\n const int size = sizeof( triangle ) / sizeof( int );\n const int tn = static_cast<int>(sqrt(2.0 * size));\n assert(tn * (tn + 1) == 2 * size); // size should be a triangular number\n\n // walk backward by rows, replacing each element with max attainable therefrom\n for (int n = tn - 1; n > 0; --n) // n is size of row, note we do not process last row\n for (int k = (n * (n-1)) / 2; k < (n * (n+1)) / 2; ++k) // from the start to the end of row\n triangle[k] += std::max(triangle[k + n], triangle[k + n + 1]);\n\n std::cout << \"Maximum total: \" << triangle[0] << \"\\n\\n\";\n}\n","language":"C++"},{"code":"using System;\n\nnamespace RosetaCode\n{\n\tclass MainClass\n\t{\n\t\tpublic static void Main (string[] args)\n\t\t{\n\t\t\tint[,] list = new int[18,19];\n\t\t\tstring input = @\"55\n\t 94 48\n\t 95 30 96\n\t 77 71 26 67\n\t 97 13 76 38 45\n\t 07 36 79 16 37 68\n\t 48 07 09 18 70 26 06\n\t 18 72 79 46 59 79 29 90\n\t 20 76 87 11 32 07 07 49 18\n\t 27 83 58 35 71 11 25 57 29 85\n\t 14 64 36 96 27 11 58 56 92 18 55\n\t 02 90 03 60 48 49 41 46 33 36 47 23\n\t 92 50 48 02 36 59 42 79 72 20 82 77 42\n\t 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n\t 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n\t 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n\t 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n\t27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\";\n\t\t\tvar charArray = input.Split ('\\n');\n\n\t\t\tfor (int i=0; i < charArray.Length; i++) {\n\t\t\t\tvar numArr = charArray[i].Trim().Split(' ');\n\n\t\t\t\tfor (int j = 0; j<numArr.Length; j++)\n\t\t\t\t{\n\t\t\t\t\tint number = Convert.ToInt32 (numArr[j]);\n\t\t\t\t\tlist [i, j] = number;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (int i = 16; i >= 0; i--) {\n\t\t\t\tfor (int j = 0; j < 18; j++) {\n\t\t\t\t\tlist[i,j] = Math.Max(list[i, j] + list[i+1, j], list[i,j] + list[i+1, j+1]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tConsole.WriteLine (string.Format(\"Maximum total: {0}\", list [0, 0]));\n\t\t}\n\t}\n}\n","language":"C-sharp"},{"code":"100 DIM LN$(19)\n110 LN$(1) = \"55\"\n120 LN$(2) = \"94 48\"\n130 LN$(3) = \"95 30 96\"\n140 LN$(4) = \"77 71 26 67\"\n150 LN$(5) = \"97 13 76 38 45\"\n160 LN$(6) = \"07 36 79 16 37 68\"\n170 LN$(7) = \"48 07 09 18 70 26 06\"\n180 LN$(8) = \"18 72 79 46 59 79 29 90\"\n190 LN$(9) = \"20 76 87 11 32 07 07 49 18\"\n200 LN$(10) = \"27 83 58 35 71 11 25 57 29 85\"\n210 LN$(11) = \"14 64 36 96 27 11 58 56 92 18 55\"\n220 LN$(12) = \"02 90 03 60 48 49 41 46 33 36 47 23\"\n230 LN$(13) = \"92 50 48 02 36 59 42 79 72 20 82 77 42\"\n240 LN$(14) = \"56 78 38 80 39 75 02 71 66 66 01 03 55 72\"\n250 LN$(15) = \"44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\"\n260 LN$(16) = \"85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\"\n270 LN$(17) = \"06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\"\n280 LN$(18) = \"27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\"\n290 LN$(19) = \"end\"\n300 DIM MATRIX(20,20)\n310 X = 1\n320 TAM = 0\n330 FOR N = 1 TO 19\n340 LN2$ = LN$(N)\n350 FOR Y = 1 TO X\n360 MATRIX(X,Y) = VAL(LEFT$(LN2$,2))\n370 IF LEN(LN2$) > 4 THEN LN2$ = MID$(LN2$,4,LEN(LN2$)-4)\n380 NEXT Y\n390 X = X+1\n400 TAM = TAM+1\n410 NEXT N\n420 FOR Z = TAM-1 TO 1 STEP -1\n430 FOR Y = 1 TO Z\n440 S1 = MATRIX(Z+1,Y)\n450 S2 = MATRIX(Z+1,Y+1)\n460 IF S1 > S2 THEN MATRIX(Z,Y) = MATRIX(Z,Y)+S1\n470 IF S1 <= S2 THEN MATRIX(Z,Y) = MATRIX(Z,Y)+S2\n480 NEXT Y\n490 NEXT Z\n500 PRINT \" maximum triangle path sum = \";MATRIX(1,1)\n","language":"Chipmunk-Basic"},{"code":"(ns clojure.examples.rosetta\n\t(:gen-class)\n (:require [clojure.string :as string]))\n\n(def rosetta \"55\n\t 94 48\n\t 95 30 96\n\t 77 71 26 67\n\t 97 13 76 38 45\n\t 07 36 79 16 37 68\n\t 48 07 09 18 70 26 06\n\t 18 72 79 46 59 79 29 90\n\t 20 76 87 11 32 07 07 49 18\n\t 27 83 58 35 71 11 25 57 29 85\n\t 14 64 36 96 27 11 58 56 92 18 55\n\t 02 90 03 60 48 49 41 46 33 36 47 23\n\t 92 50 48 02 36 59 42 79 72 20 82 77 42\n\t 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n\t 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n\t 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n\t 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n\t27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\")\n\n;; The technique is described here in more detail http://mishadoff.com/blog/clojure-euler-problem-018/\n;; Most of the code converts the string data to a nested array of integers.\n;; The code to calculate the max sum is then only a single line\n\n;; First convert string data to nested list\n;; with each inner list containing one row of the triangle\n;; [[55] [94 48] [95 30 96] ... [...10 69 93]\n(defn parse-int [s]\n \" Convert digits to a number (finds digits when could be surrounded by non-digits\"\n (Integer. (re-find #\"\\d+\" s)))\n\n(defn data-int-array [s]\n \" Convert string to integer array\"\n (map parse-int (string/split (string/trim s) #\"\\s+\")))\n\n(defn nested-triangle [s]\n \" Convert triangle to nested vector, with each inner vector containing one triangle row\"\n (loop [lst s n 1 newlist nil]\n (if (empty? lst) (reverse newlist)\n (recur (drop n lst) (inc n) (cons (take n lst) newlist)))))\n; Create nested list\n(def nested-list (nested-triangle (data-int-array rosetta)))\n\n;; Function to compute maximum path sum\n(defn max-sum [s]\n \" Compute maximum path sum using a technique described here: http://mishadoff.com/blog/clojure-euler-problem-018/\"\n (reduce (fn [a b] (map + b (map max a (rest a)))) (reverse s)))\n\n; Print result\n(println (max-sum nested-list))\n","language":"Clojure"},{"code":"(defun find-max-path-sum (s)\n (let ((triangle (loop for line = (read-line s NIL NIL)\n while line\n collect (with-input-from-string (str line)\n (loop for n = (read str NIL NIL)\n while n\n collect n)))))\n (flet ((get-max-of-pairs (xs)\n (maplist (lambda (ys)\n (and (cdr ys) (max (car ys) (cadr ys))))\n xs)))\n (car (reduce (lambda (xs ys)\n (mapcar #'+ (get-max-of-pairs xs) ys))\n (reverse triangle))))))\n\n(defparameter *small-triangle*\n \" 55\n 94 48\n 95 30 96\n 77 71 26 67\")\n(format T \"~a~%\" (with-input-from-string (s *small-triangle*)\n (find-max-path-sum s)))\n(format T \"~a~%\" (with-open-file (f \"triangle.txt\")\n (find-max-path-sum f)))\n","language":"Common-Lisp"},{"code":"void main() {\n import std.stdio, std.algorithm, std.range, std.file, std.conv;\n\n \"triangle.txt\".File.byLine.map!split.map!(to!(int[])).array.retro\n .reduce!((x, y) => zip(y, x, x.dropOne)\n .map!(t => t[0] + t[1 .. $].max)\n .array)[0]\n .writeln;\n}\n","language":"D"},{"code":"a[] = [ 0 0 ]\nrepeat\n s$ = input\n until s$ = \"\"\n i = 1\n while substr s$ i 1 = \" \"\n i += 1\n .\n s$ = \"0 \" & substr s$ i 999 & \" 0\"\n b[] = number strsplit s$ \" \"\n for i = 2 to len b[] - 1\n b[i] = higher (b[i] + a[i - 1]) (b[i] + a[i])\n .\n swap a[] b[]\n.\nfor v in a[]\n max = higher max v\n.\nprint max\n#\ninput_data\n 55\n 94 48\n 95 30 96\n 77 71 26 67\n 97 13 76 38 45\n 07 36 79 16 37 68\n 48 07 09 18 70 26 06\n 18 72 79 46 59 79 29 90\n 20 76 87 11 32 07 07 49 18\n 27 83 58 35 71 11 25 57 29 85\n 14 64 36 96 27 11 58 56 92 18 55\n 02 90 03 60 48 49 41 46 33 36 47 23\n 92 50 48 02 36 59 42 79 72 20 82 77 42\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\n","language":"EasyLang"},{"code":"import system'routines;\nimport extensions;\nimport extensions'math;\n\nstring input = \"55\n 94 48\n 95 30 96\n 77 71 26 67\n 97 13 76 38 45\n 07 36 79 16 37 68\n 48 07 09 18 70 26 06\n 18 72 79 46 59 79 29 90\n 20 76 87 11 32 07 07 49 18\n 27 83 58 35 71 11 25 57 29 85\n 14 64 36 96 27 11 58 56 92 18 55\n 02 90 03 60 48 49 41 46 33 36 47 23\n 92 50 48 02 36 59 42 79 72 20 82 77 42\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\";\n\npublic program()\n{\n var list := IntMatrix.allocate(18,19);\n\n int i := 0;\n int j := 0;\n input.splitBy(newLineConstant).forEach::(string line)\n {\n j := 0;\n line.trim().splitBy(\" \").forEach::(string num)\n {\n list[i][j] := num.toInt();\n\n j += 1\n };\n\n i += 1\n };\n\n for(int i := 16; i >= 0; i-=1)\n {\n for(int j := 0; j < 18; j += 1)\n {\n list[i][j] := max(list[i][j] + list[i+1][j], list[i][j] + list[i+1][j+1])\n }\n };\n\n console.printLine(\"Maximum total: \", list[0][0])\n}\n","language":"Elena"},{"code":"defmodule Maximum do\n def triangle_path(text) do\n text\n |> String.split(\"\\n\", trim: true)\n |> Enum.map(fn line ->\n line\n |> String.split()\n |> Enum.map(&String.to_integer(&1))\n end)\n |> Enum.reduce([], fn x,total ->\n [0]++total++[0]\n |> Enum.chunk_every( 2, 1)\n |> Enum.map(&Enum.max(&1))\n |> Enum.zip(x)\n |> Enum.map(fn{a,b} -> a+b end)\n end)\n |> Enum.max()\n end\nend\n\ntext = \"\"\"\n 55\n 94 48\n 95 30 96\n 77 71 26 67\n 97 13 76 38 45\n 07 36 79 16 37 68\n 48 07 09 18 70 26 06\n 18 72 79 46 59 79 29 90\n 20 76 87 11 32 07 07 49 18\n 27 83 58 35 71 11 25 57 29 85\n 14 64 36 96 27 11 58 56 92 18 55\n 02 90 03 60 48 49 41 46 33 36 47 23\n 92 50 48 02 36 59 42 79 72 20 82 77 42\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\n\"\"\"\n\nIO.puts Maximum.triangle_path(text)\n","language":"Elixir"},{"code":"-mode(compile).\n-import(lists, [foldl/3]).\n\nmain(_) ->\n {ok, Tmat} = file:open(\"triangle.txt\", [read, raw, {read_ahead, 16384}]),\n Max = max_sum(Tmat, []),\n io:format(\"The maximum total is ~b~n\", [Max]).\n\nmax_sum(FD, Last) ->\n case file:read_line(FD) of\n eof -> foldl(fun erlang:max/2, 0, Last);\n {ok, Line} ->\n Current = [binary_to_integer(B) || B <- re:split(Line, \"[ \\n]\"), byte_size(B) > 0],\n max_sum(FD, fold_row(Last, Current))\n end.\n\n% The first argument has one more element than the second, so compute\n% the initial sum so that both lists have identical length for fold_rest().\nfold_row([], L) -> L;\nfold_row([A|_] = Last, [B|Bs]) ->\n [A+B | fold_rest(Last, Bs)].\n\n% Both lists must have same length\nfold_rest([A], [B]) -> [A+B];\nfold_rest([A1 | [A2|_] = As], [B|Bs]) -> [B + max(A1,A2) | fold_rest(As, Bs)].\n","language":"Erlang"},{"code":"PROGRAM TRIANGLE_PATH\n\nCONST ROW=18\n\nDIM TRI[200]\n\n!\n! for rosettacode,org\n!\n\nFUNCTION MAX(X,Y)\n MAX=-X*(X>=Y)-Y*(X<Y)\nEND FUNCTION\n\nBEGIN\n\n DATA(55)\n DATA(94,48)\n DATA(95,30,96)\n DATA(77,71,26,67)\n DATA(97,13,76,38,45)\n DATA(7,36,79,16,37,68)\n DATA(48,7,9,18,70,26,6)\n DATA(18,72,79,46,59,79,29,90)\n DATA(20,76,87,11,32,7,7,49,18)\n DATA(27,83,58,35,71,11,25,57,29,85)\n DATA(14,64,36,96,27,11,58,56,92,18,55)\n DATA(2,90,3,60,48,49,41,46,33,36,47,23)\n DATA(92,50,48,2,36,59,42,79,72,20,82,77,42)\n DATA(56,78,38,80,39,75,2,71,66,66,1,3,55,72)\n DATA(44,25,67,84,71,67,11,61,40,57,58,89,40,56,36)\n DATA(85,32,25,85,57,48,84,35,47,62,17,1,1,99,89,52)\n DATA(6,71,28,75,94,48,37,10,23,51,6,48,53,18,74,98,15)\n DATA(27,2,92,23,8,71,76,84,15,52,92,63,81,10,44,10,69,93)\n\n PRINT(CHR$(12);) !CLS\n LUNG=ROW*(ROW+1)/2\n FOR I%=0 TO LUNG-1 DO\n READ(TRI[I%])\n END FOR\n\n BSE=(SQR(8*LUNG+1)-1)/2\n STP=BSE-1\n STEPC=0\n\n FOR I%=LUNG-BSE-1 TO 0 STEP -1 DO\n TRI[I%]=TRI[I%]+MAX(TRI[I%+STP],TRI[I%+STP+1])\n STEPC=STEPC+1\n IF STEPC=STP THEN\n STP=STP-1\n STEPC=0\n END IF\n END FOR\n\n PRINT(TRI[0])\nEND PROGRAM\n","language":"ERRE"},{"code":"// Maximum triangle path sum. Nigel Galloway: October 23rd., 2023\nlet g=[[27;02;92;23;08;71;76;84;15;52;92;63;81;10;44;10;69;93];[06;71;28;75;94;48;37;10;23;51;06;48;53;18;74;98;15];[85;32;25;85;57;48;84;35;47;62;17;01;01;99;89;52];[44;25;67;84;71;67;11;61;40;57;58;89;40;56;36];[56;78;38;80;39;75;02;71;66;66;01;03;55;72];[92;50;48;02;36;59;42;79;72;20;82;77;42];[02;90;03;60;48;49;41;46;33;36;47;23];[14;64;36;96;27;11;58;56;92;18;55];[27;83;58;35;71;11;25;57;29;85];[20;76;87;11;32;07;07;49;18];[18;72;79;46;59;79;29;90];[48;07;09;18;70;26;06];[07;36;79;16;37;68];[97;13;76;38;45];[77;71;26;67];[95;30;96];[94;48];[55]]\nlet fG n g=List.map2(fun (n1,n2) g->(max n1 n2)+g) (n|>List.pairwise) g\nlet rec fN=function n::g::t->fN ((fG n g)::t) |n::_->List.head n\nprintfn \"%d\" (fN g)\n","language":"F-Sharp"},{"code":"USING: grouping.extras io.encodings.utf8 io.files kernel\nmath.order math.parser math.vectors prettyprint sequences\nsplitting ;\nIN: rosetta-code.maximum-triangle-path-sum\n\n: parse-triangle ( path -- seq )\n utf8 file-lines [ \" \" split harvest ] map\n [ [ string>number ] map ] map ;\n\n: max-triangle-path-sum ( seq -- n )\n <reversed> unclip-slice [ swap [ max ] 2clump-map v+ ]\n reduce first ;\n\n\"triangle.txt\" parse-triangle max-triangle-path-sum .\n","language":"Factor"},{"code":"\\ Triangle representation; words created by this defining word return the address of element\n\\ specified by its row number and position within that row, both indexed from 0.\n: TRIANGLE ( \"name\" -- |DOES: row pos -- addr )\n CREATE DOES> ROT DUP 1+ * 2/ CELLS + SWAP CELLS +\n;\n\n18 CONSTANT #ROWS \\ total number of rows in triangle\nTRIANGLE triang\n 55 ,\n 94 , 48 ,\n 95 , 30 , 96 ,\n 77 , 71 , 26 , 67 ,\n 97 , 13 , 76 , 38 , 45 ,\n 7 , 36 , 79 , 16 , 37 , 68 ,\n 48 , 7 , 9 , 18 , 70 , 26 , 6 ,\n 18 , 72 , 79 , 46 , 59 , 79 , 29 , 90 ,\n 20 , 76 , 87 , 11 , 32 , 7 , 7 , 49 , 18 ,\n 27 , 83 , 58 , 35 , 71 , 11 , 25 , 57 , 29 , 85 ,\n 14 , 64 , 36 , 96 , 27 , 11 , 58 , 56 , 92 , 18 , 55 ,\n 2 , 90 , 3 , 60 , 48 , 49 , 41 , 46 , 33 , 36 , 47 , 23 ,\n 92 , 50 , 48 , 2 , 36 , 59 , 42 , 79 , 72 , 20 , 82 , 77 , 42 ,\n 56 , 78 , 38 , 80 , 39 , 75 , 2 , 71 , 66 , 66 , 1 , 3 , 55 , 72 ,\n 44 , 25 , 67 , 84 , 71 , 67 , 11 , 61 , 40 , 57 , 58 , 89 , 40 , 56 , 36 ,\n 85 , 32 , 25 , 85 , 57 , 48 , 84 , 35 , 47 , 62 , 17 , 1 , 1 , 99 , 89 , 52 ,\n 6 , 71 , 28 , 75 , 94 , 48 , 37 , 10 , 23 , 51 , 6 , 48 , 53 , 18 , 74 , 98 , 15 ,\n 27 , 2 , 92 , 23 , 8 , 71 , 76 , 84 , 15 , 52 , 92 , 63 , 81 , 10 , 44 , 10 , 69 , 93 ,\n\n\\ Starting from the row above the bottom row and ending on the top, for every item in row\n\\ find the bigger number from the two neighbours underneath and add it to this item. At\n\\ the end, the result will be returned from the top element of the triangle.\n: MAX-SUM ( -- n )\n 0 #ROWS 2 - DO\n I 1+ 0 DO\n J 1+ I triang @ J 1+ I 1+ triang @\n MAX J I triang +!\n LOOP\n -1 +LOOP\n 0 0 triang @\n;\n\nMAX-SUM .\n","language":"Forth"},{"code":" MODULE PYRAMIDS\t!Produces a pyramid of numbers in 1-D array.\n INTEGER MANY\t\t!The usual storage issues.\n PARAMETER (MANY = 666)\t!This should suffice.\n INTEGER BRICK(MANY),IN,LAYERS\t!Defines a pyramid.\n CONTAINS\n SUBROUTINE IMHOTEP(PLAN)!The architect.\nCounting is from the apex down, the Erich von Daniken construction.\n CHARACTER*(*) PLAN\t!The instruction file.\n INTEGER I,IT\t\t!Steppers.\n CHARACTER*666 ALINE\t!A scratchpad for input.\n IN = 0\t\t!No bricks.\n LAYERS = 0\t\t!In no courses.\n WRITE (6,*) \"Reading from \",PLAN\t!Here we go.\n OPEN(10,FILE=PLAN,FORM=\"FORMATTED\",ACTION=\"READ\",ERR=6)\t!I hope.\n GO TO 10\t\t!Why can't OPEN be a function?@*&%#^%!\n 6 STOP \"Can't grab the file!\"\nChew into the plan.\n 10 READ (10,11,END = 20) ALINE\t!Get the whole line in one piece.\n 11 FORMAT (A)\t\t\t!As plain text.\n IF (ALINE .EQ. \"\") GO TO 10\t!Ignoring any blank lines.\n IF (ALINE(1:1).EQ.\"%\") GO TO 10\t!A comment opportunity.\n LAYERS = LAYERS + 1\t\t!Righto, this should be the next layer.\n IF (IN + LAYERS.GT.MANY) STOP \"Too many bricks!\"\t!Perhaps not.\n READ (ALINE,*,END = 15,ERR = 15) BRICK(IN + 1:IN + LAYERS)\t!Free format.\n IN = IN + LAYERS\t\t!Insufficient numbers will provoke trouble.\n GO TO 10\t\t\t!Extra numbers/stuff will be ignored.\nCaught a crab? A bad number, or too few numbers on a line? No read-next-record antics, thanks.\n 15 WRITE (6,16) LAYERS,ALINE\t!Just complain.\n 16 FORMAT (\"Bad layer \",I0,\": \",A)\nCompleted the plan.\n 20 WRITE (6,21) IN,LAYERS\t!Announce some details.\n 21 FORMAT (I0,\" bricks in \",I0,\" layers.\")\n CLOSE(10)\t\t\t!Finished with input.\nCast forth the numbers in a nice pyramid.\n 30 IT = 0\t\t!For traversing the pyramid.\n DO I = 1,LAYERS\t!Each course has one more number than the one before.\n WRITE (6,31) BRICK(IT + 1:IT + I)\t!Sweep along the layer.\n 31 FORMAT (<LAYERS*2 - 2*I>X,666I4)\t!Leading spaces may be zero in number.\n IT = IT + I\t\t\t\t!Thus finger the last of a layer.\n END DO\t\t!On to the start of the next layer.\n END SUBROUTINE IMHOTEP\t!The pyramid's plan is ready.\n\n SUBROUTINE TRAVERSE\t!Clamber around the pyramid. Thoroughly.\nC The idea is that a pyramid of numbers is provided, and then, starting at the peak,\nc work down to the base summing the numbers at each step to find the maximum value path.\nc The constraint is that from a particular brick, only the two numbers below left and below right\nc may be reached in stepping to that lower layer.\nc Since that is a 0/1 choice, recorded in MOVE, a base-two scan searches the possibilities.\n INTEGER MOVE(LAYERS)\t\t!Choices are made at the various positions.\n INTEGER STEP(LAYERS),WALK(LAYERS)\t!Thus determining the path.\n INTEGER I,L,IT\t\t!Steppers.\n INTEGER PS,WS\t\t!Scores.\n WRITE (6,1) LAYERS\t\t!Announce the intention.\n 1 FORMAT (//,\"Find the highest score path across a pyramid of \",\n 1 I0,\" layers.\"/)\t!I'm not worrying over singular/plural.\n MOVE = 0\t!All 0/1 values to zero.\n MOVE(1) = 1\t!Except the first.\n STEP(1) = 1\t!Every path starts here, without option.\n WS = -666\t!The best score so far.\nCommence a multi-level loop, using the values of MOVE as the digits, one digit per level.\n 10 IT = 1\t\t!All paths start with the first step.\n PS = BRICK(1)\t!The starting score,.\nc write (6,8) \"Move\",MOVE,WS\n DO L = 2,LAYERS\t!Deal with the subsequent layers.\n IT = IT + L - 1 + MOVE(L)\t!Choose a brick.\n STEP(L) = IT\t\t!Remember this step.\n PS = PS + BRICK(IT)\t!Count its score.\nc WRITE (6,6) L,IT,BRICK(IT),PS\n 6 FORMAT (\"Layer \",I0,\",Brick(\",I0,\")=\",I0,\",Sum=\",I0)\n END DO\t\t!Thus is the path determined.\n IF (PS .GT. WS) THEN\t!An improvement?\n IF (WS.GT.0) WRITE (6,7) WS,PS\t!Yes! Announce.\n 7 FORMAT (\"Improved path score: \",I0,\" to \",I0)\n WRITE (6,8) \"Moves\",MOVE\t\t!Show the choices at each layer..\n WRITE (6,8) \"Steps\",STEP\t\t!That resulted in this path.\n WRITE (6,8) \"Score\",BRICK(STEP)\t!Whose steps were scored thus.\n 8 FORMAT (A8,666I4)\t\t\t!This should suffice.\n WS = PS\t\t\t\t!Record the new best value.\n WALK = STEP\t\t\t!And the path thereby.\n END IF\t\t\t!So much for an improvement.\n DO L = LAYERS,1,-1\t\t!Now add one to the number in MOVE.\n IF (MOVE(L).EQ.0) THEN\t!By finding the lowest order zero.\n MOVE(L) = 1\t\t!Making it one,\n MOVE(L + 1:LAYERS) = 0\t!And setting still lower orders back to zero.\n GO TO 10\t\t!And if we did, there's more to do!\n END IF\t\t!But if that bit wasn't zero,\n END DO\t\t!Perhaps the next one up will be.\n WRITE (6,*) WS,\" is the highest score.\"\t!So much for that.\n END SUBROUTINE TRAVERSE\t!All paths considered...\n\n SUBROUTINE REFINE\t!Ascertain the highest score without searching.\n INTEGER BEST(LAYERS)\t!A scratchpad.\n INTEGER I,L\t\t!Steppers.\n L = LAYERS*(LAYERS - 1)/2 + 1\t!Finger the first brick of the lowest layer.\n BEST = BRICK(L:L + LAYERS - 1)!Syncopation. Copy the lowest layer.\n DO L = LAYERS - 1,1,-1\t!Work towards the peak.\n FORALL (I = 1:L) BEST(I) = BRICK(L*(L - 1)/2 + I)\t!Add to each brick's value\n 1 + MAXVAL(BEST(I:I + 1))\t!The better of its two possibles.\n END DO\t\t\t!On to the next layer.\n WRITE (6,*) BEST(1),\" is the highest score. By some path.\"\n END SUBROUTINE REFINE\t!Who knows how we get there.\n END MODULE PYRAMIDS\n\n PROGRAM TRICKLE\n USE PYRAMIDS\nc CALL IMHOTEP(\"Sakkara.txt\")\n CALL IMHOTEP(\"Cheops.txt\")\n CALL TRAVERSE\t\t\t!Do this the definite way.\n CALL REFINE\t\t\t!Only the result by more cunning.\n END\n","language":"Fortran"},{"code":"' version 21-06-2015\n' compile with: fbc -s console\n\nData \" 55\"\nData \" 94 48\"\nData \" 95 30 96\"\nData \" 77 71 26 67\"\nData \" 97 13 76 38 45\"\nData \" 07 36 79 16 37 68\"\nData \" 48 07 09 18 70 26 06\"\nData \" 18 72 79 46 59 79 29 90\"\nData \" 20 76 87 11 32 07 07 49 18\"\nData \" 27 83 58 35 71 11 25 57 29 85\"\nData \" 14 64 36 96 27 11 58 56 92 18 55\"\nData \" 02 90 03 60 48 49 41 46 33 36 47 23\"\nData \" 92 50 48 02 36 59 42 79 72 20 82 77 42\"\nData \" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\"\nData \" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\"\nData \" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\"\nData \" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\"\nData \" 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\"\nData \"END\" ' no more data\n\n' ------=< MAIN >=------\n\nDim As String ln\nDim As Integer matrix(1 To 20, 1 To 20)\nDim As Integer x = 1, y, s1, s2, size\n\nDo\n Read ln\n ln = Trim(ln)\n If ln = \"END\" Then Exit Do\n For y = 1 To x\n matrix(x, y) = Val(Left(ln, 2))\n ln = Mid(ln, 4)\n Next\n x += 1\n size += 1\nLoop\n\nFor x = size - 1 To 1 Step - 1\n For y = 1 To x\n s1 = matrix(x + 1, y)\n s2 = matrix(x + 1, y + 1)\n If s1 > s2 Then\n matrix(x, y) += s1\n Else\n matrix(x, y) += s2\n End If\n Next\nNext\n\nPrint\nPrint \" maximum triangle path sum =\"; matrix(1, 1)\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 \"strconv\"\n \"strings\"\n)\n\nconst t = ` 55\n 94 48\n 95 30 96\n 77 71 26 67\n 97 13 76 38 45\n 07 36 79 16 37 68\n 48 07 09 18 70 26 06\n 18 72 79 46 59 79 29 90\n 20 76 87 11 32 07 07 49 18\n 27 83 58 35 71 11 25 57 29 85\n 14 64 36 96 27 11 58 56 92 18 55\n 02 90 03 60 48 49 41 46 33 36 47 23\n 92 50 48 02 36 59 42 79 72 20 82 77 42\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93`\n\nfunc main() {\n lines := strings.Split(t, \"\\n\")\n f := strings.Fields(lines[len(lines)-1])\n d := make([]int, len(f))\n var err error\n for i, s := range f {\n if d[i], err = strconv.Atoi(s); err != nil {\n panic(err)\n }\n }\n d1 := d[1:]\n var l, r, u int\n for row := len(lines) - 2; row >= 0; row-- {\n l = d[0]\n for i, s := range strings.Fields(lines[row]) {\n if u, err = strconv.Atoi(s); err != nil {\n panic(err)\n }\n if r = d1[i]; l > r {\n d[i] = u + l\n } else {\n d[i] = u + r\n }\n l = r\n }\n }\n fmt.Println(d[0])\n}\n","language":"Go"},{"code":"parse = map (map read . words) . lines\nf x y z = x + max y z\ng xs ys = zipWith3 f xs ys $ tail ys\nsolve = head . foldr1 g\nmain = readFile \"triangle.txt\" >>= print . solve . parse\n","language":"Haskell"},{"code":"---------------- MAXIMUM TRIANGLE PATH SUM ---------------\n\nmaxPathSum :: [[Int]] -> Int\nmaxPathSum =\n head\n . foldr1\n ((<*> tail) . zipWith3 (\\x y z -> x + max y z))\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain =\n print $\n maxPathSum\n [ [55],\n [94, 48],\n [95, 30, 96],\n [77, 71, 26, 67],\n [97, 13, 76, 38, 45],\n [07, 36, 79, 16, 37, 68],\n [48, 07, 09, 18, 70, 26, 06],\n [18, 72, 79, 46, 59, 79, 29, 90],\n [20, 76, 87, 11, 32, 07, 07, 49, 18],\n [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\n [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\n [02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23],\n [92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42],\n [56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72],\n [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\n [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52],\n [06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15],\n [27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\n ]\n","language":"Haskell"},{"code":"import Control.Applicative (ZipList (ZipList, getZipList))\n\n\n---------------- MAXIMUM TRIANGLE PATH SUM ---------------\n\nmaxPathSum :: [[Int]] -> Int\nmaxPathSum [] = 0\nmaxPathSum triangleRows =\n head\n ( foldr1\n ( \\xs ->\n ( \\ys zs ->\n getZipList\n ( ( ( (\\x y z -> x + max y z)\n <$> ZipList xs\n )\n <*> ZipList ys\n )\n <*> ZipList zs\n )\n )\n <*> tail\n )\n triangleRows\n )\n\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain =\n print $\n maxPathSum\n [ [55],\n [94, 48],\n [95, 30, 96],\n [77, 71, 26, 67],\n [97, 13, 76, 38, 45],\n [07, 36, 79, 16, 37, 68],\n [48, 07, 09, 18, 70, 26, 06],\n [18, 72, 79, 46, 59, 79, 29, 90],\n [20, 76, 87, 11, 32, 07, 07, 49, 18],\n [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\n [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\n [02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23],\n [92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42],\n [56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72],\n [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\n [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52],\n [06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15],\n [27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\n ]\n","language":"Haskell"},{"code":"padTri=: 0 \". ];._2 NB. parse triangle and (implicitly) pad with zeros\nmaxSum=: [: {. (+ (0 ,~ 2 >./\\ ]))/ NB. find max triangle path sum\n","language":"J"},{"code":" maxSum padTri freads 'triangle.txt'\n1320\n","language":"J"},{"code":"maxsum=: ((] + #@] {. [)2 >./\\ ])/\n","language":"J"},{"code":"import java.nio.file.*;\nimport static java.util.Arrays.stream;\n\npublic class MaxPathSum {\n\n public static void main(String[] args) throws Exception {\n int[][] data = Files.lines(Paths.get(\"triangle.txt\"))\n .map(s -> stream(s.trim().split(\"\\\\s+\"))\n .mapToInt(Integer::parseInt)\n .toArray())\n .toArray(int[][]::new);\n\n for (int r = data.length - 1; r > 0; r--)\n for (int c = 0; c < data[r].length - 1; c++)\n data[r - 1][c] += Math.max(data[r][c], data[r][c + 1]);\n\n System.out.println(data[0][0]);\n }\n}\n","language":"Java"},{"code":"var arr = [\n[55],\n[94, 48],\n[95, 30, 96],\n[77, 71, 26, 67],\n[97, 13, 76, 38, 45],\n[07, 36, 79, 16, 37, 68],\n[48, 07, 09, 18, 70, 26, 06],\n[18, 72, 79, 46, 59, 79, 29, 90],\n[20, 76, 87, 11, 32, 07, 07, 49, 18],\n[27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\n[14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\n[02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23],\n[92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42],\n[56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72],\n[44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\n[85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52],\n[06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15],\n[27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\n];\n\nwhile (arr.length !== 1) {\n var len = arr.length;\n var row = [];\n var current = arr[len-2];\n var currentLen = current.length - 1;\n var end = arr[len-1];\n\n for ( var i = 0; i <= currentLen; i++ ) {\n row.push(Math.max(current[i] + end[i] || 0, current[i] + end[i+1] || 0) )\n }\n\n arr.pop();\n arr.pop();\n\n arr.push(row);\n}\n\nconsole.log(arr);\n","language":"JavaScript"},{"code":"[ [ 1320 ] ]\n","language":"JavaScript"},{"code":"(function () {\n\n // Right fold using final element as initial accumulator\n // (a -> a -> a) -> t a -> a\n function foldr1(f, lst) {\n return lst.length > 1 ? (\n f(lst[0], foldr1(f, lst.slice(1)))\n ) : lst[0];\n }\n\n // function of arity 3 mapped over nth items of each of 3 lists\n // (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]\n function zipWith3(f, xs, ys, zs) {\n return zs.length ? [f(xs[0], ys[0], zs[0])].concat(\n zipWith3(f, xs.slice(1), ys.slice(1), zs.slice(1))) : [];\n }\n\n // Evaluating from bottom up (right fold)\n // and with recursion left to right (head and first item of tail at each stage)\n return foldr1(\n function (xs, ys) {\n return zipWith3(\n function (x, y, z) {\n return x + (y < z ? z : y);\n },\n xs, ys, ys.slice(1) // item above, and larger of two below\n );\n }, [\n [55],\n [94, 48],\n [95, 30, 96],\n [77, 71, 26, 67],\n [97, 13, 76, 38, 45],\n [07, 36, 79, 16, 37, 68],\n [48, 07, 09, 18, 70, 26, 06],\n [18, 72, 79, 46, 59, 79, 29, 90],\n [20, 76, 87, 11, 32, 07, 07, 49, 18],\n [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\n [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\n [02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23],\n [92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42],\n [56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72],\n [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\n [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52],\n [06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15],\n [27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\n ]\n )[0];\n\n})();\n","language":"JavaScript"},{"code":"1320\n","language":"JavaScript"},{"code":"function maximumTrianglePathSum(triangle) {\n\n function distilLastLine() {\n let lastLine = triangle.pop(),\n aboveLine = triangle.pop();\n for (let i = 0; i < aboveLine.length; i++)\n aboveLine[i] = Math.max(\n aboveLine[i] + lastLine[i],\n aboveLine[i] + lastLine[i + 1]\n );\n triangle.push(aboveLine);\n }\n\n do {\n distilLastLine();\n } while (triangle.length > 1);\n return triangle[0][0];\n}\n\n// testing\nlet theTriangle = [\n[55],\n[94, 48],\n[95, 30, 96],\n[77, 71, 26, 67],\n[97, 13, 76, 38, 45],\n[ 7, 36, 79, 16, 37, 68],\n[48, 7, 9, 18, 70, 26, 6],\n[18, 72, 79, 46, 59, 79, 29, 90],\n[20, 76, 87, 11, 32, 7, 7, 49, 18],\n[27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\n[14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\n[ 2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23],\n[92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42],\n[56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72],\n[44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\n[85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52],\n[ 6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15],\n[27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\n];\n\nconsole.log(maximumTrianglePathSum(theTriangle));\n","language":"JavaScript"},{"code":"1320\n","language":"JavaScript"},{"code":"(() => {\n \"use strict\";\n\n // ------------------ MAX PATH SUM -------------------\n\n // Working from the bottom of the triangle upwards,\n // summing each number with the larger of the two below\n // until the maximum emerges at the top.\n\n // maxPathSum ::[[Int]] -> Int\n const maxPathSum = xss =>\n // A list of lists folded down to a list of just one\n // remaining integer.\n foldr1(\n // The accumulator, zipped with the tail of the\n // accumulator, yields pairs of adjacent sums.\n (ys, xs) => zipWith3(\n\n // Plus greater of two below\n (a, b, c) => a + Math.max(b, c)\n )(xs)(ys)(ys.slice(1))\n )(xss)[0];\n\n\n // ---------------- GENERIC FUNCTIONS ----------------\n\n // foldr1 :: (a -> a -> a) -> [a] -> a\n const foldr1 = f =>\n xs => 0 < xs.length ? (\n xs.slice(0, -1).reduceRight(\n f, xs.slice(-1)[0]\n )\n ) : [];\n\n\n // zipWith3 :: (a -> b -> c -> d) ->\n // [a] -> [b] -> [c] -> [d]\n const zipWith3 = f =>\n xs => ys => zs => Array.from({\n length: Math.min(\n ...[xs, ys, zs].map(x => x.length)\n )\n }, (_, i) => f(xs[i], ys[i], zs[i]));\n\n\n // ---------------------- TEST -----------------------\n return maxPathSum([\n [55],\n [94, 48],\n [95, 30, 96],\n [77, 71, 26, 67],\n [97, 13, 76, 38, 45],\n [7, 36, 79, 16, 37, 68],\n [48, 7, 9, 18, 70, 26, 6],\n [18, 72, 79, 46, 59, 79, 29, 90],\n [20, 76, 87, 11, 32, 7, 7, 49, 18],\n [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\n [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\n [2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23],\n [92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42],\n [56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72],\n [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\n [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52],\n [6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15],\n [27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\n ]);\n})();\n","language":"JavaScript"},{"code":"# Usage: TRIANGLE | solve\ndef solve:\n\n # update(next) updates the input row of maxima:\n def update(next):\n . as $maxima\n | [ range(0; next|length)\n | next[.] + ([$maxima[.], $maxima[. + 1]] | max) ];\n\n . as $in\n | reduce range(length -2; -1; -1) as $i\n ($in[-1]; update( $in[$i] ) ) ;\n","language":"Jq"},{"code":"# dynamic solution\nfunction maxpathsum(t::Array{Array{I, 1}, 1}) where I\n T = deepcopy(t)\n for r in length(T)-1:-1:1\n for c in linearindices(T[r])\n T[r][c] += max(T[r+1][c], T[r+1][c+1])\n end\n end\n return T[1][1]\nend\n\ntest = [[55],\n [94, 48],\n [95, 30, 96],\n [77, 71, 26, 67],\n [97, 13, 76, 38, 45],\n [07, 36, 79, 16, 37, 68],\n [48, 07, 09, 18, 70, 26, 06],\n [18, 72, 79, 46, 59, 79, 29, 90],\n [20, 76, 87, 11, 32, 07, 07, 49, 18],\n [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\n [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\n [02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23],\n [92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42],\n [56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72],\n [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\n [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52],\n [06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15],\n [27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]]\n\n@show maxpathsum(test)\n","language":"Julia"},{"code":"// version 1.1.2\n\nval tri = intArrayOf(\n 55,\n 94, 48,\n 95, 30, 96,\n 77, 71, 26, 67,\n 97, 13, 76, 38, 45,\n 7, 36, 79, 16, 37, 68,\n 48, 7, 9, 18, 70, 26, 6,\n 18, 72, 79, 46, 59, 79, 29, 90,\n 20, 76, 87, 11, 32, 7, 7, 49, 18,\n 27, 83, 58, 35, 71, 11, 25, 57, 29, 85,\n 14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55,\n 2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23,\n 92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42,\n 56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72,\n 44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36,\n 85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52,\n 6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15,\n 27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93\n)\n\nfun main(args: Array<String>) {\n val triangles = arrayOf(tri.sliceArray(0..9), tri)\n for (triangle in triangles) {\n val size = triangle.size\n val base = ((Math.sqrt(8.0 * size + 1.0) - 1.0)/ 2.0).toInt()\n var step = base - 1\n var stepc = 0\n for (i in (size - base - 1) downTo 0) {\n triangle[i] += maxOf(triangle[i + step], triangle[i + step + 1])\n if (++stepc == step) {\n step--\n stepc = 0\n }\n }\n println(\"Maximum total = ${triangle[0]}\")\n }\n}\n","language":"Kotlin"},{"code":"local triangleSmall = {\n { 55 },\n { 94, 48 },\n { 95, 30, 96 },\n { 77, 71, 26, 67 },\n}\n\nlocal triangleLarge = {\n { 55 },\n { 94, 48 },\n { 95, 30, 96 },\n { 77, 71, 26, 67 },\n { 97, 13, 76, 38, 45 },\n { 7, 36, 79, 16, 37, 68 },\n { 48, 7, 9, 18, 70, 26, 6 },\n { 18, 72, 79, 46, 59, 79, 29, 90 },\n { 20, 76, 87, 11, 32, 7, 7, 49, 18 },\n { 27, 83, 58, 35, 71, 11, 25, 57, 29, 85 },\n { 14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55 },\n { 2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23 },\n { 92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42 },\n { 56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72 },\n { 44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36 },\n { 85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52 },\n { 6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15 },\n { 27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93 },\n};\n\nfunction solve(triangle)\n\n -- Get total number of rows in triangle.\n local nRows = table.getn(triangle)\n\n -- Start at 2nd-to-last row and work up to the top.\n for row = nRows-1, 1, -1 do\n\n -- For each value in row, add the max of the 2 children beneath it.\n for i = 1, row do\n local child1 = triangle[row+1][i]\n local child2 = triangle[row+1][i+1]\n triangle[row][i] = triangle[row][i] + math.max(child1, child2)\n end\n\n end\n\n -- The top of the triangle now holds the answer.\n return triangle[1][1];\n\nend\n\nprint(solve(triangleSmall))\nprint(solve(triangleLarge))\n","language":"Lua"},{"code":"nums={{55},{94,48},{95,30,96},{77,71,26,67},{97,13,76,38,45},{7,36,79,16,37,68},{48,7,9,18,70,26,6},{18,72,79,46,59,79,29,90},{20,76,87,11,32,7,7,49,18},{27,83,58,35,71,11,25,57,29,85},{14,64,36,96,27,11,58,56,92,18,55},{2,90,3,60,48,49,41,46,33,36,47,23},{92,50,48,2,36,59,42,79,72,20,82,77,42},{56,78,38,80,39,75,2,71,66,66,1,3,55,72},{44,25,67,84,71,67,11,61,40,57,58,89,40,56,36},{85,32,25,85,57,48,84,35,47,62,17,1,1,99,89,52},{6,71,28,75,94,48,37,10,23,51,6,48,53,18,74,98,15},{27,2,92,23,8,71,76,84,15,52,92,63,81,10,44,10,69,93}};\nClearAll[DoStep,MaximumTrianglePathSum]\nDoStep[lst1_List,lst2_List]:=lst2+Join[{First[lst1]},Max/@Partition[lst1,2,1],{Last[lst1]}]\nMaximumTrianglePathSum[triangle_List]:=Max[Fold[DoStep,First[triangle],Rest[triangle]]]\n","language":"Mathematica"},{"code":"import sequtils, strutils, sugar\n\nproc solve(tri: seq[seq[int]]): int =\n var tri = tri\n while tri.len > 1:\n let t0 = tri.pop\n for i, t in tri[tri.high]: tri[tri.high][i] = max(t0[i], t0[i+1]) + t\n tri[0][0]\n\nconst data = \"\"\"\n 55\n 94 48\n 95 30 96\n 77 71 26 67\n 97 13 76 38 45\n 07 36 79 16 37 68\n 48 07 09 18 70 26 06\n 18 72 79 46 59 79 29 90\n 20 76 87 11 32 07 07 49 18\n 27 83 58 35 71 11 25 57 29 85\n 14 64 36 96 27 11 58 56 92 18 55\n 02 90 03 60 48 49 41 46 33 36 47 23\n 92 50 48 02 36 59 42 79 72 20 82 77 42\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\"\"\"\n\necho solve data.splitLines.map((x: string) => x.strip.split.map parseInt)\n","language":"Nim"},{"code":"V=[[55],[94,48],[95,30,96],[77,71,26,67],[97,13,76,38,45],[07,36,79,16,37,68],[48,07,09,18,70,26,06],[18,72,79,46,59,79,29,90],[20,76,87,11,32,07,07,49,18],[27,83,58,35,71,11,25,57,29,85],[14,64,36,96,27,11,58,56,92,18,55],[02,90,03,60,48,49,41,46,33,36,47,23],[92,50,48,02,36,59,42,79,72,20,82,77,42],[56,78,38,80,39,75,02,71,66,66,01,03,55,72],[44,25,67,84,71,67,11,61,40,57,58,89,40,56,36],[85,32,25,85,57,48,84,35,47,62,17,01,01,99,89,52],[06,71,28,75,94,48,37,10,23,51,06,48,53,18,74,98,15],[27,02,92,23,08,71,76,84,15,52,92,63,81,10,44,10,69,93]];\nforstep(i=#V,2,-1,V[i-1]+=vector(i-1,j,max(V[i][j],V[i][j+1]))); V[1][1]\n","language":"PARI-GP"},{"code":"program TriSum;\n{'triangle.txt'\n* one element per line\n55\n94\n48\n95\n30\n96\n...}\nconst\n cMaxTriHeight = 18;\n cMaxTriElemCnt = (cMaxTriHeight+1)*cMaxTriHeight DIV 2 +1;\ntype\n tElem = longint;\n tbaseRow = array[0..cMaxTriHeight] of tElem;\n tmyTri = array[0..cMaxTriElemCnt] of tElem;\n\nfunction ReadTri( fname:string;\n out t:tmyTri):integer;\n{read triangle values into t and returns height}\nvar\n f : text;\n s : string;\n i : integer;\n ValCode : word;\nbegin\n i := 0;\n fillchar(t,Sizeof(t),#0);\n\n Assign(f,fname);\n {$I-}\n reset(f);\n IF ioResult <> 0 then\n begin\n writeln('IO-Error ',ioResult);\n close(f);\n ReadTri := i;\n EXIT;\n end;\n {$I+}\n\n while NOT(EOF(f)) AND (i<cMaxTriElemCnt) do\n begin\n readln(f,s);\n val(s,t[i],ValCode);\n inc(i);\n IF ValCode <> 0 then\n begin\n writeln(ValCode,' conversion error at line ',i);\n fillchar(t,Sizeof(t),#0);\n i := 0;\n BREAK;\n end;\n end;\n close(f);\n ReadTri := round(sqrt(2*(i-1)));\nend;\n\nfunction TriMaxSum(var t: tmyTri;hei:integer):integer;\n{sums up higher values bottom to top}\nvar\n i,r,h,tmpMax : integer;\n idxN : integer;\n sumrow : tbaseRow;\nbegin\n h := hei;\n idxN := (h*(h+1)) div 2 -1;\n {copy base row}\n move(t[idxN-h+1],sumrow[0],SizeOf(tElem)*h);\n dec(h);\n{ for r := 0 to h do write(sumrow[r]:4);writeln;}\n idxN := idxN-h;\n while idxN >0 do\n begin\n i := idxN-h;\n r := 0;\n while r < h do\n begin\n tmpMax:= sumrow[r];\n IF tmpMax<sumrow[r+1] then\n tmpMax:=sumrow[r+1];\n sumrow[r]:= tmpMax+t[i];\n inc(i);\n inc(r);\n end;\n idxN := idxN-h;\n dec(h);\n{ for r := 0 to h do write(sumrow[r]:4);writeln;}\n end;\n TriMaxSum := sumrow[0];\nend;\n\nvar\n h : integer;\n triangle : tmyTri;\nBegin\n{ writeln(TriMaxSum(triangle,ReadTri('triangle.txt',triangle))); -> 1320}\n h := ReadTri('triangle.txt',triangle);\n writeln('height sum');\n while h > 0 do\n begin\n writeln(h:4,TriMaxSum(triangle,h):7);\n dec(h);\n end;\nend.\n","language":"Pascal"},{"code":"use 5.10.0;\nuse List::Util 'max';\n\nmy @sum;\nwhile (<>) {\n\tmy @x = split;\n\t@sum = ($x[0] + $sum[0],\n\t\tmap($x[$_] + max(@sum[$_-1, $_]), 1 .. @x-2),\n\t\t$x[-1] + $sum[-1]);\n}\n\nsay max(@sum);\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;\">tri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #000000;\">55</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">94</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">48</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">95</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">30</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">96</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">77</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">71</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">26</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">67</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">97</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">13</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">76</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">38</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">45</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">36</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">79</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">16</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">37</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">68</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">48</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">18</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">70</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">26</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6</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;\">72</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">79</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">46</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">59</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">79</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">29</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">90</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;\">76</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">87</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">49</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">18</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">27</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">83</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">58</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">35</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">71</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">25</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">57</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">29</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">85</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">14</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">64</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">36</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">96</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">27</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">58</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">56</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">92</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">18</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">55</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;\">90</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">60</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">48</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">49</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">41</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">46</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">33</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">36</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">47</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">23</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">92</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">50</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">48</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">36</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">59</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">42</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">79</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">72</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">82</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">77</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">42</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">56</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">78</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">38</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">80</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">39</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">75</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">71</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">66</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">66</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;\">55</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">72</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">44</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">25</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">67</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">84</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">71</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">67</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">61</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">40</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">57</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">58</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">89</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">40</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">56</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">36</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">85</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">25</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">85</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">57</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">48</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">84</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">35</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">47</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">62</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">17</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;\">99</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">89</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">52</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">71</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">28</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">75</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">94</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">48</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">37</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">23</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">51</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">48</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">53</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">18</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">74</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">98</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">15</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">27</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">92</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">23</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">71</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">76</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">84</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">15</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">52</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">92</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">63</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">81</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">44</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">69</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">93</span><span style=\"color: #0000FF;\">}}</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- update each row from last but one upwards, with the larger\n -- child, so the first step is to replace 6 with 6+27 or 6+2.</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tri</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: #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;\">tri</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: #000000;\">tri</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: #7060A8;\">max</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tri</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;\">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;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">tri</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<!--\n","language":"Phix"},{"code":"table (+,+,+,max)\npp(Row,_Column,Tri,Sum),Row>Tri.length => Sum=0.\npp(Row,Column,Tri,Sum) ?=>\n pp(Row+1,Column,Tri,Sum1),\n Sum = Sum1+Tri[Row,Column].\npp(Row,Column,Tri,Sum) =>\n pp(Row+1,Column+1,Tri,Sum1),\n Sum = Sum1+Tri[Row,Column].\n","language":"Picat"},{"code":"pp2(Row, Column, Sum, Tri, M) =>\n if Sum > M.get(max_val,0) then\n M.put(max_val,Sum)\n end,\n Row := Row + 1,\n if Row <= Tri.length then\n foreach(I in 0..1)\n pp2(Row,Column+I, Sum+Tri[Row,Column+I], Tri, M)\n end\n end.\n","language":"Picat"},{"code":"max_path(N, V) :-\n\tdata(N, T),\n\tpath(1, T, V).\n\npath(_N, [], 0) .\npath(N, [H | T], V) :-\n\tnth(N, H, V0),\n\tN1 is N+1,\n\tpath(N, T, V1),\n\tpath(N1, T, V2),\n\tV = V0 + max(V1, V2).\n\ndata(2, P) :-\n\tP =\n\t[ [55],\n\t [94, 48],\n\t [95, 30, 96],\n\t [77, 71, 26, 67],\n\t [97, 13, 76, 38, 45],\n\t [7, 36, 79, 16, 37, 68],\n\t [48, 7, 9, 18, 70, 26, 6],\n\t [18, 72, 79, 46, 59, 79, 29, 90],\n\t [20, 76, 87, 11, 32, 7, 7, 49, 18],\n\t [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\n\t [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\n\t [2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23],\n\t [92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42],\n\t [56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72],\n\t [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\n\t [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52],\n\t [6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15],\n\t [27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]].\n","language":"Picat"},{"code":"import util.\n\ngo =>\n tri(Tri),\n\n println(\"Mode directed tabling:\"),\n pp(1,1,Tri,Sum),\n writeln(max_val=Sum),\n nl,\n\n println(\"Loop based:\"),\n M = new_map([max_val=0]),\n pp2(1,1, Tri[1,1], Tri, M),\n writeln(max_val=M.get(max_val)),\n nl,\n\n println(\"Adapted the Prolog solution:\"),\n max_path(2, V2),\n println(max_val=V2),\n nl.\n\ntri(Tri) =>\n Tri =\n{\n{55},\n{94,48},\n{95,30,96},\n{77,71,26,67},\n{97,13,76,38,45},\n{07,36,79,16,37,68},\n{48,07,09,18,70,26,06},\n{18,72,79,46,59,79,29,90},\n{20,76,87,11,32,07,07,49,18},\n{27,83,58,35,71,11,25,57,29,85},\n{14,64,36,96,27,11,58,56,92,18,55},\n{02,90,03,60,48,49,41,46,33,36,47,23},\n{92,50,48,02,36,59,42,79,72,20,82,77,42},\n{56,78,38,80,39,75,02,71,66,66,01,03,55,72},\n{44,25,67,84,71,67,11,61,40,57,58,89,40,56,36},\n{85,32,25,85,57,48,84,35,47,62,17,01,01,99,89,52},\n{06,71,28,75,94,48,37,10,23,51,06,48,53,18,74,98,15},\n{27,02,92,23,08,71,76,84,15,52,92,63,81,10,44,10,69,93}\n}.\n","language":"Picat"},{"code":"(de maxpath (Lst)\n (let (Lst (reverse Lst) R (car Lst))\n (for I (cdr Lst)\n (setq R\n (mapcar\n +\n (maplist\n '((L)\n (and (cdr L) (max (car L) (cadr L))) )\n R )\n I ) ) )\n (car R) ) )\n","language":"PicoLisp"},{"code":"*process source xref attributes or(!);\n triang: Proc Options(Main);\n Dcl nn(18,18) Bin Fixed(31);\n Dcl (rows,i,j) Bin Fixed(31);\n Dcl (p,k,kn) Bin Fixed(31);\n Call f_r(1 ,' 55 ');\n Call f_r(2 ,' 94 48 ');\n Call f_r(3 ,' 95 30 96 ');\n Call f_r(4 ,' 77 71 26 67 ');\n Call f_r(5 ,' 97 13 76 38 45 ');\n Call f_r(6 ,' 07 36 79 16 37 68 ');\n Call f_r(7 ,' 48 07 09 18 70 26 06 ');\n Call f_r(8 ,' 18 72 79 46 59 79 29 90 ');\n Call f_r(9 ,' 20 76 87 11 32 07 07 49 18 ');\n Call f_r(10,' 27 83 58 35 71 11 25 57 29 85 ');\n Call f_r(11,' 14 64 36 96 27 11 58 56 92 18 55 ');\n Call f_r(12,' 02 90 03 60 48 49 41 46 33 36 47 23 ');\n Call f_r(13,' 92 50 48 02 36 59 42 79 72 20 82 77 42 ');\n Call f_r(14,' 56 78 38 80 39 75 02 71 66 66 01 03 55 72 ');\n Call f_r(15,' 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36 ');\n Call f_r(16,' 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52 ');\n Call f_r(17,' 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15 ');\n Call f_r(18,' 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93');\n rows=hbound(nn,1);\n\n do r=rows by -1 to 2;\n p=r-1; /*traipse through triangle rows. */\n do k=1 to p;\n kn=k+1; /*re-calculate the previous row. */\n nn(p,k)=max(nn(r,k),nn(r,kn))+nn(p,k); /*replace previous nn */\n end;\n end;\n Put Edit('maximum path sum:',nn(1,1))(Skip,a,f(5)); /*display result*/\n f_r: Proc(r,vl);\n /* fill row r with r values */\n Dcl r Bin Fixed(31);\n Dcl vl Char(*);\n Dcl vla Char(100) Var;\n vla=' '!!trim(vl);\n get string(vla) Edit((nn(r,j) Do j=1 To r))(f(3));\n End;\n End;\n","language":"PL-I"},{"code":"max_path(N, V) :-\n\tdata(N, T),\n\tpath(0, T, V).\n\npath(_N, [], 0) .\npath(N, [H | T], V) :-\n\tnth0(N, H, V0),\n\tN1 is N+1,\n\tpath(N, T, V1),\n\tpath(N1, T, V2),\n\tV is V0 + max(V1, V2).\n\ndata(1, P) :-\n\tP =\n\t[ [55],\n\t [94, 48],\n\t [95, 30, 96],\n\t [77, 71, 26, 67]].\n\n\ndata(2, P) :-\n\tP =\n\t[ [55],\n\t [94, 48],\n\t [95, 30, 96],\n\t [77, 71, 26, 67],\n\t [97, 13, 76, 38, 45],\n\t [7, 36, 79, 16, 37, 68],\n\t [48, 7, 9, 18, 70, 26, 6],\n\t [18, 72, 79, 46, 59, 79, 29, 90],\n\t [20, 76, 87, 11, 32, 7, 7, 49, 18],\n\t [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\n\t [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\n\t [2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23],\n\t [92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42],\n\t [56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72],\n\t [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\n\t [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52],\n\t [6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15],\n\t [27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]].\n","language":"Prolog"},{"code":"OpenConsole()\nDim ln.s(19)\nln(1) = \" 55\"\nln(2) = \" 94 48\"\nln(3) = \" 95 30 96\"\nln(4) = \" 77 71 26 67\"\nln(5) = \" 97 13 76 38 45\"\nln(6) = \" 07 36 79 16 37 68\"\nln(7) = \" 48 07 09 18 70 26 06\"\nln(8) = \" 18 72 79 46 59 79 29 90\"\nln(9) = \" 20 76 87 11 32 07 07 49 18\"\nln(10) = \" 27 83 58 35 71 11 25 57 29 85\"\nln(11) = \" 14 64 36 96 27 11 58 56 92 18 55\"\nln(12) = \" 02 90 03 60 48 49 41 46 33 36 47 23\"\nln(13) = \" 92 50 48 02 36 59 42 79 72 20 82 77 42\"\nln(14) = \" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\"\nln(15) = \" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\"\nln(16) = \" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\"\nln(17) = \" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\"\nln(18) = \" 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\"\nln(19) = \"end\"\n\nDim matrix.i(20,20)\nDefine.i x = 1, tam = 0\nDefine.i i, y, s1, s2, n\n\nFor n = 1 To ArraySize(ln(),1) - 1\n ln2.s = LTrim(ln(n))\n For y = 1 To x\n matrix(x, y) = Val(Left(ln2, 2))\n If Len(ln2) > 4:\n ln2 = Mid(ln2, 4, Len(ln2)-4)\n EndIf\n Next y\n x + 1\n tam + 1\nNext n\n\nFor x = tam - 1 To 1 Step - 1\n For y = 1 To x\n s1 = matrix(x+1, y)\n s2 = matrix(x+1, y+1)\n If s1 > s2:\n matrix(x, y) = matrix(x, y) + s1\n Else\n matrix(x, y) = matrix(x, y) + s2\n EndIf\n Next y\nNext x\n\nPrintN(#CRLF$ + \" maximum triangle path sum = \" + Str(matrix(1, 1)))\n\nInput()\nCloseConsole()\n","language":"PureBasic"},{"code":"def solve(tri):\n while len(tri) > 1:\n t0 = tri.pop()\n t1 = tri.pop()\n tri.append([max(t0[i], t0[i+1]) + t for i,t in enumerate(t1)])\n return tri[0][0]\n\n\ndata = \"\"\" 55\n 94 48\n 95 30 96\n 77 71 26 67\n 97 13 76 38 45\n 07 36 79 16 37 68\n 48 07 09 18 70 26 06\n 18 72 79 46 59 79 29 90\n 20 76 87 11 32 07 07 49 18\n 27 83 58 35 71 11 25 57 29 85\n 14 64 36 96 27 11 58 56 92 18 55\n 02 90 03 60 48 49 41 46 33 36 47 23\n 92 50 48 02 36 59 42 79 72 20 82 77 42\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\"\"\"\n\nprint solve([map(int, row.split()) for row in data.splitlines()])\n","language":"Python"},{"code":"from itertools import imap\n\nf = lambda x, y, z: x + max(y, z)\ng = lambda xs, ys: list(imap(f, ys, xs, xs[1:]))\ndata = [map(int, row.split()) for row in open(\"triangle.txt\")][::-1]\nprint reduce(g, data)[0]\n","language":"Python"},{"code":"'''Maximum triangle path sum'''\n\nfrom functools import (reduce)\n\n\n# maxPathSum :: [[Int]] -> Int\ndef maxPathSum(rows):\n '''The maximum total among all possible\n paths from the top to the bottom row.\n '''\n return reduce(\n lambda xs, ys: [\n a + max(b, c) for (a, b, c)\n in zip(ys, xs, xs[1:])\n ],\n reversed(rows[:-1]), rows[-1]\n )[0]\n\n\n# ------------------------- TEST -------------------------\nprint(\n maxPathSum([\n [55],\n [94, 48],\n [95, 30, 96],\n [77, 71, 26, 67],\n [97, 13, 76, 38, 45],\n [7, 36, 79, 16, 37, 68],\n [48, 7, 9, 18, 70, 26, 6],\n [18, 72, 79, 46, 59, 79, 29, 90],\n [20, 76, 87, 11, 32, 7, 7, 49, 18],\n [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\n [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\n [2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23],\n [92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42],\n [56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72],\n [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\n [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52],\n [6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15],\n [27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\n ])\n)\n","language":"Python"},{"code":" [ [] swap\n behead swap\n witheach\n [ tuck max\n rot swap join\n swap ]\n drop ] is pairwise-max ( [ --> [ )\n\n [ [] unrot\n witheach\n [ dip behead +\n rot swap join\n swap ]\n drop ] is add-items ( [ --> [ )\n\n [ behead dip\n [ reverse\n behead\n pairwise-max\n swap witheach\n [ add-items\n pairwise-max ] ]\n add-items\n 0 peek ] is mtps ( [ --> n )\n\n' [ [ 55 ]\n [ 94 48 ]\n [ 95 30 96 ]\n [ 77 71 26 67 ]\n [ 97 13 76 38 45 ]\n [ 07 36 79 16 37 68 ]\n [ 48 07 09 18 70 26 06 ]\n [ 18 72 79 46 59 79 29 90 ]\n [ 20 76 87 11 32 07 07 49 18 ]\n [ 27 83 58 35 71 11 25 57 29 85 ]\n [ 14 64 36 96 27 11 58 56 92 18 55 ]\n [ 02 90 03 60 48 49 41 46 33 36 47 23 ]\n [ 92 50 48 02 36 59 42 79 72 20 82 77 42 ]\n [ 56 78 38 80 39 75 02 71 66 66 01 03 55 72 ]\n [ 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36 ]\n [ 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52 ]\n [ 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15 ]\n [ 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93 ] ]\nmtps echo\n","language":"Quackery"},{"code":"#lang racket\n(require math/number-theory)\n\n(define (trinv n) ; OEIS A002024\n (exact-floor (/ (+ 1 (sqrt (* 1 (* 8 n)))) 2)))\n\n(define (triangle-neighbour-bl n)\n (define row (trinv n))\n (+ n (- (triangle-number row) (triangle-number (- row 1)))))\n\n(define (maximum-triangle-path-sum T)\n (define n-rows (trinv (vector-length T)))\n (define memo# (make-hash))\n (define (inner i)\n (hash-ref!\n memo# i\n (λ ()\n (+ (vector-ref T (sub1 i)) ; index is 1-based (so vector-refs need -1'ing)\n (cond [(= (trinv i) n-rows) 0]\n [else\n (define bl (triangle-neighbour-bl i))\n (max (inner bl) (inner (add1 bl)))])))))\n (inner 1))\n\n(module+ main\n (maximum-triangle-path-sum\n #(55\n 94 48\n 95 30 96\n 77 71 26 67\n 97 13 76 38 45\n 07 36 79 16 37 68\n 48 07 09 18 70 26 06\n 18 72 79 46 59 79 29 90\n 20 76 87 11 32 07 07 49 18\n 27 83 58 35 71 11 25 57 29 85\n 14 64 36 96 27 11 58 56 92 18 55\n 02 90 03 60 48 49 41 46 33 36 47 23\n 92 50 48 02 36 59 42 79 72 20 82 77 42\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93)))\n\n(module+ test\n (require rackunit)\n (check-equal? (for/list ((n (in-range 1 (add1 10)))) (trinv n)) '(1 2 2 3 3 3 4 4 4 4))\n ; 1\n ; 2 3\n ; 4 5 6\n ; 7 8 9 10\n (check-eq? (triangle-neighbour-bl 1) 2)\n (check-eq? (triangle-neighbour-bl 3) 5)\n (check-eq? (triangle-neighbour-bl 5) 8)\n (define test-triangle\n #(55 94 48 95 30 96 77 71 26 67))\n (check-equal? (maximum-triangle-path-sum test-triangle) 321)\n )\n","language":"Racket"},{"code":"my $triangle = q| 55\n 94 48\n 95 30 96\n 77 71 26 67\n 97 13 76 38 45\n 07 36 79 16 37 68\n 48 07 09 18 70 26 06\n 18 72 79 46 59 79 29 90\n 20 76 87 11 32 07 07 49 18\n 27 83 58 35 71 11 25 57 29 85\n 14 64 36 96 27 11 58 56 92 18 55\n 02 90 03 60 48 49 41 46 33 36 47 23\n 92 50 48 02 36 59 42 79 72 20 82 77 42\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93|;\n\n\nmy @rows = $triangle.lines.map: { [.words] }\nwhile @rows > 1 {\n my @last := @rows.pop;\n @rows[*-1] = (@rows[*-1][] Z+ (@last Zmax @last[1..*])).List;\n}\nput @rows;\n\n\n# Here's a more FPish version. We define our own operator and the use it in the reduction metaoperator form, [op], which turns any infix into a list operator.\nsub infix:<op>(@a,@b) { (@a Zmax @a[1..*]) Z+ @b }\nput [op] $triangle.lines.reverse.map: { [.words] }\n\n\n# Or, instead of using reverse, one could also define the op as right-associative.\nsub infix:<rop>(@a,@b) is assoc('right') { @a Z+ (@b Zmax @b[1..*]) }\nput [rop] $triangle.lines.map: { [.words] }\n","language":"Raku"},{"code":"/*REXX program finds the maximum sum of a path of numbers in a pyramid of numbers. */\n@.=.; @.1 = 55\n @.2 = 94 48\n @.3 = 95 30 96\n @.4 = 77 71 26 67\n @.5 = 97 13 76 38 45\n @.6 = 07 36 79 16 37 68\n @.7 = 48 07 09 18 70 26 06\n @.8 = 18 72 79 46 59 79 29 90\n @.9 = 20 76 87 11 32 07 07 49 18\n @.10 = 27 83 58 35 71 11 25 57 29 85\n @.11 = 14 64 36 96 27 11 58 56 92 18 55\n @.12 = 02 90 03 60 48 49 41 46 33 36 47 23\n @.13 = 92 50 48 02 36 59 42 79 72 20 82 77 42\n @.14 = 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n @.15 = 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n @.16 = 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n @.17 = 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n @.18 = 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\n#.=0\n do r=1 while @.r\\==. /*build another version of the pyramid.*/\n do k=1 for r; #.r.k=word(@.r, k) /*assign a number to an array number. */\n end /*k*/\n end /*r*/\n\n do r=r-1 by -1 to 2; p=r-1 /*traipse through the pyramid rows. */\n do k=1 for p; _=k+1 /*re─calculate the previous pyramid row*/\n #.p.k=max(#.r.k, #.r._) + #.p.k /*replace the previous number. */\n end /*k*/\n end /*r*/\n /*stick a fork in it, we're all done. */\nsay 'maximum path sum: ' #.1.1 /*show the top (row 1) pyramid number. */\n","language":"REXX"},{"code":"# Project : Maximum triangle path sum\n\nload \"stdlib.ring\"\nln = list(19)\nln[1] = \" 55\"\nln[2] = \" 94 48\"\nln[3] = \" 95 30 96\"\nln[4] = \" 77 71 26 67\"\nln[5] = \" 97 13 76 38 45\"\nln[6] = \" 07 36 79 16 37 68\"\nln[7] = \" 48 07 09 18 70 26 06\"\nln[8] = \" 18 72 79 46 59 79 29 90\"\nln[9] = \" 20 76 87 11 32 07 07 49 18\"\nln[10] = \" 27 83 58 35 71 11 25 57 29 85\"\nln[11] = \" 14 64 36 96 27 11 58 56 92 18 55\"\nln[12] = \" 02 90 03 60 48 49 41 46 33 36 47 23\"\nln[13] = \" 92 50 48 02 36 59 42 79 72 20 82 77 42\"\nln[14] = \" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\"\nln[15] = \" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\"\nln[16] = \" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\"\nln[17] = \" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\"\nln[18] = \" 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\"\nln[19] = \"end\"\n\nmatrix = newlist(20,20)\nx = 1\nsize = 0\n\nfor n = 1 to len(ln) - 1\n ln2 = ln[n]\n ln2 = trim(ln2)\n for y = 1 to x\n matrix[x][y] = number(left(ln2,2))\n if len(ln2) > 4\n ln2 = substr(ln2,4,len(ln2)-4)\n ok\n next\n x = x + 1\n size = size + 1\nnext\n\nfor x = size - 1 to 1 step - 1\n for y = 1 to x\n s1 = matrix[x+1][y]\n s2 = matrix[x+1][y+1]\n if s1 > s2\n matrix[x][y] = matrix[x][y] + s1\n else\n matrix[x][y] = matrix[x][y] + s2\n ok\n next\nnext\n\nsee \"maximum triangle path sum = \" + matrix[1][1]\n","language":"Ring"},{"code":"triangle =\n\" 55\n 94 48\n 95 30 96\n 77 71 26 67\n 97 13 76 38 45\n 07 36 79 16 37 68\n 48 07 09 18 70 26 06\n 18 72 79 46 59 79 29 90\n 20 76 87 11 32 07 07 49 18\n 27 83 58 35 71 11 25 57 29 85\n 14 64 36 96 27 11 58 56 92 18 55\n 02 90 03 60 48 49 41 46 33 36 47 23\n 92 50 48 02 36 59 42 79 72 20 82 77 42\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\"\n\nar = triangle.each_line.map{|line| line.split.map(&:to_i)}\nputs ar.inject([]){|res,x|\n maxes = [0, *res, 0].each_cons(2).map(&:max)\n x.zip(maxes).map{|a,b| a+b}\n}.max\n# => 1320\n","language":"Ruby"},{"code":"dim ln$(19)\nln$(1) = \" 55\"\nln$(2) = \" 94 48\"\nln$(3) = \" 95 30 96\"\nln$(4) = \" 77 71 26 67\"\nln$(5) = \" 97 13 76 38 45\"\nln$(6) = \" 07 36 79 16 37 68\"\nln$(7) = \" 48 07 09 18 70 26 06\"\nln$(8) = \" 18 72 79 46 59 79 29 90\"\nln$(9) = \" 20 76 87 11 32 07 07 49 18\"\nln$(10) = \" 27 83 58 35 71 11 25 57 29 85\"\nln$(11) = \" 14 64 36 96 27 11 58 56 92 18 55\"\nln$(12) = \" 02 90 03 60 48 49 41 46 33 36 47 23\"\nln$(13) = \" 92 50 48 02 36 59 42 79 72 20 82 77 42\"\nln$(14) = \" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\"\nln$(15) = \" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\"\nln$(16) = \" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\"\nln$(17) = \" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\"\nln$(18) = \" 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\"\nln$(19) = \"end\"\n\ndim matrix(20,20)\nx = 1\ntam = 0\n\nfor n = 1 to 19 'ubound(ln$) - 1\n ln2$ = trim$(ln$(n))\n for y = 1 to x\n matrix(x, y) = val(left$(ln2$, 2))\n if len(ln2$) > 4 then ln2$ = mid$(ln2$, 4, len(ln2$)-4)\n next y\n x = x +1\n tam = tam +1\nnext n\n\nfor z = tam-1 to 1 step -1\n for y = 1 to z\n s1 = matrix(z+1, y)\n s2 = matrix(z+1, y+1)\n if s1 > s2 then\n matrix(z, y) = matrix(z, y) +s1\n else\n matrix(z, y) = matrix(z, y) +s2\n end if\n next y\nnext z\n\nprint \" maximum triangle path sum = \"; matrix(1, 1)\n","language":"Run-BASIC"},{"code":"use std::cmp::max;\n\nfn max_path(vector: &mut Vec<Vec<u32>>) -> u32 {\n\n while vector.len() > 1 {\n\n let last = vector.pop().unwrap();\n let ante = vector.pop().unwrap();\n\n let mut new: Vec<u32> = Vec::new();\n\n for (i, value) in ante.iter().enumerate() {\n new.push(max(last[i], last[i+1]) + value);\n };\n\n vector.push(new);\n };\n\n vector[0][0]\n}\n\nfn main() {\n let mut data = \"55\n94 48\n95 30 96\n77 71 26 67\n97 13 76 38 45\n07 36 79 16 37 68\n48 07 09 18 70 26 06\n18 72 79 46 59 79 29 90\n20 76 87 11 32 07 07 49 18\n27 83 58 35 71 11 25 57 29 85\n14 64 36 96 27 11 58 56 92 18 55\n02 90 03 60 48 49 41 46 33 36 47 23\n92 50 48 02 36 59 42 79 72 20 82 77 42\n56 78 38 80 39 75 02 71 66 66 01 03 55 72\n44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\";\n\n let mut vector = data.split(\"\\n\").map(|x| x.split(\" \").map(|s: &str| s.parse::<u32>().unwrap())\n .collect::<Vec<u32>>()).collect::<Vec<Vec<u32>>>();\n\n let max_value = max_path(&mut vector);\n\n println!(\"{}\", max_value);\n //=> 7273\n}\n","language":"Rust"},{"code":"object MaximumTrianglePathSum extends App {\n // Solution:\n def sum(triangle: Array[Array[Int]]) =\n triangle.reduceRight((upper, lower) =>\n upper zip (lower zip lower.tail)\n map {case (above, (left, right)) => above + Math.max(left, right)}\n ).head\n\n // Tests:\n def triangle = \"\"\"\n 55\n 94 48\n 95 30 96\n 77 71 26 67\n \"\"\"\n def parse(s: String) = s.trim.split(\"\\\\s+\").map(_.toInt)\n def parseLines(s: String) = s.trim.split(\"\\n\").map(parse)\n def parseFile(f: String) = scala.io.Source.fromFile(f).getLines.map(parse).toArray\n println(sum(parseLines(triangle)))\n println(sum(parseFile(\"triangle.txt\")))\n}\n","language":"Scala"},{"code":"var sum = [0]\n\nARGF.each { |line|\n var x = line.words.map{.to_n}\n sum = [\n x.first + sum.first,\n 1 ..^ x.end -> map{|i| x[i] + [sum[i-1, i]].max}...,\n x.last + sum.last,\n ]\n}\n\nsay sum.max\n","language":"Sidef"},{"code":"var triangle = ARGF.slurp.lines.map{.words.map{.to_n}}\n \nfunc max_value(i=0, j=0) is cached {\n i == triangle.len && return 0\n triangle[i][j] + [max_value(i+1, j), max_value(i+1, j+1)].max\n}\n \nsay max_value()\n","language":"Sidef"},{"code":"import delimited triangle.txt, delim(\" \") clear\nmata\na = st_data(.,.)\nn = rows(a)\nfor (i=n-1; i>=1; i--) {\n\tfor (j=1; j<=i; j++) {\n\t\ta[i,j] = a[i,j]+max((a[i+1,j],a[i+1,j+1]))\n\t}\n}\na[1,1]\nend\n","language":"Stata"},{"code":"package require Tcl 8.6\n\nproc maxTrianglePathSum {definition} {\n # Parse the definition, stripping whitespace and leading zeroes.\n set lines [lmap line [split [string trim $definition] \"\\n\"] {\n\tlmap val $line {scan $val %d}\n }]\n # Paths are bit strings (0 = go left, 1 = go right).\n # Enumerate the possible paths.\n set numPaths [expr {2 ** [llength $lines]}]\n for {set path 0; set max -inf} {$path < $numPaths} {incr path} {\n\t# Work out how much the current path costs.\n\tset sum [set idx [set row 0]]\n\tfor {set bit 1} {$row < [llength $lines]} {incr row} {\n\t incr sum [lindex $lines $row $idx]\n\t if {$path & $bit} {incr idx}\n\t set bit [expr {$bit << 1}]\n\t}\n\t# Remember the max so far.\n\tif {$sum > $max} {set max $sum}\n }\n return $max\n}\n\nputs [maxTrianglePathSum {\n 55\n 94 48\n 95 30 96\n 77 71 26 67\n 97 13 76 38 45\n 07 36 79 16 37 68\n 48 07 09 18 70 26 06\n 18 72 79 46 59 79 29 90\n 20 76 87 11 32 07 07 49 18\n 27 83 58 35 71 11 25 57 29 85\n 14 64 36 96 27 11 58 56 92 18 55\n 02 90 03 60 48 49 41 46 33 36 47 23\n 92 50 48 02 36 59 42 79 72 20 82 77 42\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\n}]\n# Reading from a file is left as an exercise…\n","language":"Tcl"},{"code":"DATA \" 55\"\nDATA \" 94 48\"\nDATA \" 95 30 96\"\nDATA \" 77 71 26 67\"\nDATA \" 97 13 76 38 45\"\nDATA \" 07 36 79 16 37 68\"\nDATA \" 48 07 09 18 70 26 06\"\nDATA \" 18 72 79 46 59 79 29 90\"\nDATA \" 20 76 87 11 32 07 07 49 18\"\nDATA \" 27 83 58 35 71 11 25 57 29 85\"\nDATA \" 14 64 36 96 27 11 58 56 92 18 55\"\nDATA \" 02 90 03 60 48 49 41 46 33 36 47 23\"\nDATA \" 92 50 48 02 36 59 42 79 72 20 82 77 42\"\nDATA \" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\"\nDATA \" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\"\nDATA \" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\"\nDATA \" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\"\nDATA \" 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\"\nDATA \"END\" ! no more DATA\n\nDIM matrix(1 TO 20, 1 TO 20)\nLET x = 1\nDO\n READ ln$\n LET ln$ = LTRIM$(RTRIM$(ln$))\n IF ln$ = \"END\" THEN EXIT DO\n FOR y = 1 TO x\n LET matrix(x, y) = VAL((ln$)[1:2])\n LET ln$ = (ln$)[4:maxnum]\n NEXT y\n LET x = x+1\n LET tam = tam+1\nLOOP\nFOR x = tam-1 TO 1 STEP -1\n FOR y = 1 TO x\n LET s1 = matrix(x+1, y)\n LET s2 = matrix(x+1, y+1)\n IF s1 > s2 THEN LET matrix(x, y) = matrix(x, y)+s1 ELSE LET matrix(x, y) = matrix(x, y)+s2\n NEXT y\nNEXT x\n\nPRINT \" maximum triangle path sum =\"; matrix(1, 1)\nEND\n","language":"True-BASIC"},{"code":"'Solution derived from http://stackoverflow.com/questions/8002252/euler-project-18-approach.\n\nSet objfso = CreateObject(\"Scripting.FileSystemObject\")\nSet objinfile = objfso.OpenTextFile(objfso.GetParentFolderName(WScript.ScriptFullName) &_\n\t\"\\triangle.txt\",1,False)\n\t\nrow = Split(objinfile.ReadAll,vbCrLf)\n\nFor i = UBound(row) To 0 Step -1\n\trow(i) = Split(row(i),\" \")\n\tIf i < UBound(row) Then\n\t\tFor j = 0 To UBound(row(i))\n\t\t\tIf (row(i)(j) + row(i+1)(j)) > (row(i)(j) + row(i+1)(j+1)) Then\n\t\t\t\trow(i)(j) = CInt(row(i)(j)) + CInt(row(i+1)(j))\n\t\t\tElse\n\t\t\t\trow(i)(j) = CInt(row(i)(j)) + CInt(row(i+1)(j+1))\n\t\t\tEnd If\n\t\tNext\n\tEnd If\t\nNext\n\nWScript.Echo row(0)(0)\n\nobjinfile.Close\nSet objfso = Nothing\n","language":"VBScript"},{"code":"var lines = [\n \" 55\",\n \" 94 48\",\n \" 95 30 96\",\n \" 77 71 26 67\",\n \" 97 13 76 38 45\",\n \" 07 36 79 16 37 68\",\n \" 48 07 09 18 70 26 06\",\n \" 18 72 79 46 59 79 29 90\",\n \" 20 76 87 11 32 07 07 49 18\",\n \" 27 83 58 35 71 11 25 57 29 85\",\n \" 14 64 36 96 27 11 58 56 92 18 55\",\n \" 02 90 03 60 48 49 41 46 33 36 47 23\",\n \" 92 50 48 02 36 59 42 79 72 20 82 77 42\",\n \" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\",\n \" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\",\n \" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\",\n \" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\",\n \"27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\"\n]\nvar f = lines[-1].split(\" \")\nvar d = f.map { |s| Num.fromString(s) }.toList\nfor (row in lines.count-2..0) {\n var l = d[0]\n var i = 0\n for (s in lines[row].trimStart().split(\" \")) {\n var u = Num.fromString(s)\n var r = d[i+1]\n d[i] = (l > r) ? u + l : u + r\n l = r\n i = i + 1\n }\n}\nSystem.print(d[0])\n","language":"Wren"},{"code":"function Max(A, B);\nint A, B;\nreturn if A > B then A else B;\n\nint Triangle, Last, Tn, N, I;\nbegin\nTriangle:= [0,\n 55,\n 94, 48,\n 95, 30, 96,\n 77, 71, 26, 67,\n 97, 13, 76, 38, 45,\n 07, 36, 79, 16, 37, 68,\n 48, 07, 09, 18, 70, 26, 06,\n 18, 72, 79, 46, 59, 79, 29, 90,\n 20, 76, 87, 11, 32, 07, 07, 49, 18,\n 27, 83, 58, 35, 71, 11, 25, 57, 29, 85,\n 14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55,\n 02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23,\n 92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42,\n 56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72,\n 44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36,\n 85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52,\n 06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15,\n 27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93];\n\n Last := (18*18+18)/2;\n Tn := 1;\n\n while (Tn * (Tn + 1) / 2) < Last do\n Tn := Tn + 1;\n for N:= Tn downto 2 do begin\n for I:= 2 to N do begin\n Triangle (Last - N) := Triangle (Last - N) +\n Max(Triangle (Last - 1), Triangle (Last));\n Last := Last - 1;\n end;\n Last := Last - 1;\n end;\n IntOut(0, Triangle(1));\n CrLf(0);\nend;\n","language":"XPL0"},{"code":"dim ln$(19)\nln$(1) = \" 55\"\nln$(2) = \" 94 48\"\nln$(3) = \" 95 30 96\"\nln$(4) = \" 77 71 26 67\"\nln$(5) = \" 97 13 76 38 45\"\nln$(6) = \" 07 36 79 16 37 68\"\nln$(7) = \" 48 07 09 18 70 26 06\"\nln$(8) = \" 18 72 79 46 59 79 29 90\"\nln$(9) = \" 20 76 87 11 32 07 07 49 18\"\nln$(10) = \" 27 83 58 35 71 11 25 57 29 85\"\nln$(11) = \" 14 64 36 96 27 11 58 56 92 18 55\"\nln$(12) = \" 02 90 03 60 48 49 41 46 33 36 47 23\"\nln$(13) = \" 92 50 48 02 36 59 42 79 72 20 82 77 42\"\nln$(14) = \" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\"\nln$(15) = \" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\"\nln$(16) = \" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\"\nln$(17) = \" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\"\nln$(18) = \" 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\"\nln$(19) = \"end\"\n\ndim matrix(20,20)\nx = 1\ntam = 0\n\nfor n = 1 to arraysize(ln$(),1) - 1\n\tln2$ = trim$(ln$(n))\n\tfor y = 1 to x\n\t\tmatrix(x, y) = val(left$(ln2$, 2))\n\t\tif len(ln2$) > 4 ln2$ = mid$(ln2$, 4, len(ln2$)-4)\n\tnext y\n\tx = x + 1\n\ttam = tam + 1\nnext n\n\nfor x = tam - 1 to 1 step - 1\n\tfor y = 1 to x\n\t\ts1 = matrix(x+1, y)\n\t\ts2 = matrix(x+1, y+1)\n\t\tif s1 > s2 then\n\t\t\tmatrix(x, y) = matrix(x, y) + s1\n\t\telse\n\t\t\tmatrix(x, y) = matrix(x, y) + s2\n\t\tend if\n\tnext y\nnext x\n\nprint \"\\n maximum triangle path sum = \", matrix(1, 1)\n","language":"Yabasic"},{"code":"\t;\n\t; Find maximum triangle path sum 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; Thanks to https://wikiti.brandonw.net for the idea for the conversion routine hl -> decimal ASCII\n\t;\n\t;\n\t; 2023-04-28 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\twrtstr\tequ 09h\t\t; Write string to console\n\n\tnul\tequ 00h\t\t; ASCII control characters\n\tcr\tequ 0dh\n\tlf\tequ 0ah\n\n\tcnull\tequ '0'\t\t; ASCII character constants\n\n\ttrisize\tequ 171\t\t; Number of elements in triangle, must be counted manually - elements are 16 bit words\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\npushall\tmacro\t\t\t; Save all registers to stack\n\tpush\taf\n\tpush\tbc\n\tpush\tde\n\tpush\thl\n\tpush\tix\n\tpush\tiy\n\tendm\n\npopall\tmacro\t\t\t; Recall all registers from stack\n\tpop\tiy\n\tpop\tix\n\tpop\thl\n\tpop\tde\n\tpop\tbc\n\tpop\taf\n\tendm\n\n\t;\n\t; =====================\n\t; Start of main program\n\t; =====================\n\t;\n\n\tcseg\n\n\t;\n\t; The total number of elements in a triangle with N rows is the sum of the numbers 1..N, and we need to\n\t; determine N for the given number of elements (trisize from above).\n\t; Since the Z80 has no multiplication instruction, we can not use the Gauss formula N * (N + 1) / 2. Instead, we\n\t; just sum up all the numbers beginning with 1, until we exceed the number of elements.\n\t;\n\n\tld\ta,trisize\t; a holds number of elements for comparison\n\tld\tde,1\t\t; de is the counter from 1..N\n\tld\thl,0\t\t; hl holds the accumulated sum. Since a must be used for comparison, we need hl as accumulator\n\nsum1toN:\n\tadd\thl,de\t\t; Add next number to hl\n\tcp\tl\t\t; Comparison is only 8 bit! The maximum number of elements is limited to 255\n\tjr\tc,foundN\t; If l exceeds trisize, we are finished and need to reduce de again\n\tinc\tde\t\t; Otherwise, increase de and repeat\n\tjr\tsum1toN\n\nfoundN:\n\tdec\tde\t\t; We overshot the target and need to reduce de again. de now holds N, the number of rows = elements in last row\n\tld\tb,e\t\t; Our actual counters will be b and c\n\n\tld\tix,triangle\t; Set ix to LSB of very last element (16 bit word) of triangle\n\tld\tde,2*trisize-2\n\tadd\tix,de\t\t; Everything is 0-based! Here we need the bytes instead of the number of elements\n\n\tpush\tix\t\t; Set iy to last element of penultimate row\n\tpop\thl\t\t; Need to use hl for subtraction of number of bytes in last row\n\tld\tc,b\t\t; Get number of bytes in c, b shall keep the number of elements\n\tsla\tc\t\t; bytes = 2 * elements\n\tld\td,0\t\t; Use de for 16 bit subtraction of c from hl\n\tld\te,c\n\tsbc\thl,de\t\t\n\tpush\thl\t\t; and then move it to iy via stack, no direct load\n\tpop\tiy\n\n\tdec\tb\t\t; b runs over the penultimate row, which has 1 element less\n\tld\tc,b\t\t; c is the row counter, b the element counter - each row contains as many elements as is its number\n\nloop:\t\t\t\t; Loop entry point is the same for inner and outer loop\n\tpush\tbc\t\t; Save bc to stack, it will hold the maximum of right and left successor\n\tld\tl,(ix)\t\t; Right successor of iy\n\tld\th,(ix+1)\n\tld\te,(ix-2)\t; Left successor of iy\n\tld\td,(ix-1)\n\tpush\thl\t\t; Save hl, it is modified by the comparison/subtraction\n\tor\ta\t\t; Clear carry flag\n\tsbc\thl,de\t\t; 16 bit comparison by subtracting left from right\n\tpop\thl\t\t; Restore hl\n\tjr\tc,delarger\t; If carry, then the left successor in de is larger\n\n\tpush\thl\t\t; hl is larger, move it to bc\n\tpop\tbc\n\tjr\taddmax\n\ndelarger:\n\tpush\tde\t\t; de is larger, move it to bc\n\tpop\tbc\n\naddmax:\n\tld\tl,(iy)\t\t; Get \"parent\" element into hl and add maximum of its two successors\n\tld\th,(iy+1)\n\tadd\thl,bc\t\t; Add maximum, which is in bc\n\tld\t(iy),l\t\t; Store hl back to triangle\n\tld\t(iy+1),h\n\tpop\tbc\t\t; Restore bc with loop counters\n\n\tdec\tix\t\t; Decrement element pointers (by 2 bytes)\n\tdec\tix\n\tdec\tiy\n\tdec\tiy\n\n\tdec\tb\t\t; Decrement element counter\n\tjp\tnz,loop\t\t; Check if penultimate row finished - this is the inner loop\n\n\tld\tb,c\t\t; Restore inner loop counter, check if more rows above current\n\tdec\tix\t\t; Decrement element pointer of row below again (by 2 bytes), skip leftmost element\n\tdec\tix\n\tdec\tb\t\t; Decrement loop counters, first the element counter\n\tdec\tc\t\t; ...then the row counter\n\tjp\tnz,loop\t\t; Check if triangle finished - this is the outer loop\n\n\tld\thl,(triangle)\t; Root element now contains maximum sum\n\tld\tix,buffer\t; Set ix to output buffer\n\tcall\tdispHL\t\t; Create decimal representation\n\n\tsetdel\tnul\t\t; Set string delimiter to 00h\n\tprint\tbuffer\t\t; Display result\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; Helper routines - notice that the Z80 does not have a divide instruction\n\t; Notice further that CP/M does not have any support for pretty-printing\n\t; formatted numbers and stuff like that. So we have to do all this by hand...\n\t;\n\n\t;\n\t; Converts the value (unsigned int) in register hl to its decimal representation\n\t; Register ix has memory address of target for converted value\n\t; String is terminated with nul character (\\0)\n\t;\n\ndispHL:\n\tpushall\n\tld\tb,1\t\t; Flag for leading '0'\n\tirp\tx,<-10000,-1000,-100,-10,-1>\n\tld\tde,x\t\t; Subtract powers of 10 and determine digit\n\tcall\tcalcdig\n\tendm\n\n\tld\ta,nul\t\t; Terminate result string with nul\n\tld\t(ix+0),a\n\n\tpopall\n\tret\t\t\t; End of conversion routine\n\ncalcdig:\n\tld\ta,cnull-1\t; Determine the digit character\nincrdig:\n\tinc\ta\t\t; Start with '0'\n\tadd\thl,de\t\t; As long as subtraction is possible, increment digit character\n\tjr\tc,incrdig\n\n\tsbc\thl,de\t\t; If negative, undo last subtraction and continue with remainder\n\tcp\tcnull\t\t; Check for leading '0', these are ignored\n\tjr\tnz,adddig\n\tbit\t0,b\t\t; Use bit instruction for check if flag set, register a contains digit\n\tret\tnz\t\t; If '0' found and flag set, it is a leading '0' and we return\nadddig:\n\tld\tb,0\t\t; Reset flag for leading '0', we are now outputting digits\n\tld\t(ix+0),a\t; Store character in memory and set ix to next location\n\tinc\tix\n\n\tret\t\t\t; End of conversion helper routine\n\n\t;\n\t; ================\n\t; Data definitions\n\t; ================\n\t;\n\n\tdseg\n\ncrlf:\tdefb\tcr,lf,nul\t; Generic newline\nbuffer:\tdefs\t10\t\t; Buffer for conversion of number to text\n\ntriangle:\t\t\t; Triangle data, number of elements is \"trisize\" equ further above\n\tdefw\t55\n\tdefw\t94\n\tdefw\t48\n\tdefw\t95\n\tdefw\t30\n\tdefw\t96\n\tdefw\t77\n\tdefw\t71\n\tdefw\t26\n\tdefw\t67\n\tdefw\t97\n\tdefw\t13\n\tdefw\t76\n\tdefw\t38\n\tdefw\t45\n\tdefw\t07\n\tdefw\t36\n\tdefw\t79\n\tdefw\t16\n\tdefw\t37\n\tdefw\t68\n\tdefw\t48\n\tdefw\t07\n\tdefw\t09\n\tdefw\t18\n\tdefw\t70\n\tdefw\t26\n\tdefw\t06\n\tdefw\t18\n\tdefw\t72\n\tdefw\t79\n\tdefw\t46\n\tdefw\t59\n\tdefw\t79\n\tdefw\t29\n\tdefw\t90\n\tdefw\t20\n\tdefw\t76\n\tdefw\t87\n\tdefw\t11\n\tdefw\t32\n\tdefw\t07\n\tdefw\t07\n\tdefw\t49\n\tdefw\t18\n\tdefw\t27\n\tdefw\t83\n\tdefw\t58\n\tdefw\t35\n\tdefw\t71\n\tdefw\t11\n\tdefw\t25\n\tdefw\t57\n\tdefw\t29\n\tdefw\t85\n\tdefw\t14\n\tdefw\t64\n\tdefw\t36\n\tdefw\t96\n\tdefw\t27\n\tdefw\t11\n\tdefw\t58\n\tdefw\t56\n\tdefw\t92\n\tdefw\t18\n\tdefw\t55\n\tdefw\t02\n\tdefw\t90\n\tdefw\t03\n\tdefw\t60\n\tdefw\t48\n\tdefw\t49\n\tdefw\t41\n\tdefw\t46\n\tdefw\t33\n\tdefw\t36\n\tdefw\t47\n\tdefw\t23\n\tdefw\t92\n\tdefw\t50\n\tdefw\t48\n\tdefw\t02\n\tdefw\t36\n\tdefw\t59\n\tdefw\t42\n\tdefw\t79\n\tdefw\t72\n\tdefw\t20\n\tdefw\t82\n\tdefw\t77\n\tdefw\t42\n\tdefw\t56\n\tdefw\t78\n\tdefw\t38\n\tdefw\t80\n\tdefw\t39\n\tdefw\t75\n\tdefw\t02\n\tdefw\t71\n\tdefw\t66\n\tdefw\t66\n\tdefw\t01\n\tdefw\t03\n\tdefw\t55\n\tdefw\t72\n\tdefw\t44\n\tdefw\t25\n\tdefw\t67\n\tdefw\t84\n\tdefw\t71\n\tdefw\t67\n\tdefw\t11\n\tdefw\t61\n\tdefw\t40\n\tdefw\t57\n\tdefw\t58\n\tdefw\t89\n\tdefw\t40\n\tdefw\t56\n\tdefw\t36\n\tdefw\t85\n\tdefw\t32\n\tdefw\t25\n\tdefw\t85\n\tdefw\t57\n\tdefw\t48\n\tdefw\t84\n\tdefw\t35\n\tdefw\t47\n\tdefw\t62\n\tdefw\t17\n\tdefw\t01\n\tdefw\t01\n\tdefw\t99\n\tdefw\t89\n\tdefw\t52\n\tdefw\t06\n\tdefw\t71\n\tdefw\t28\n\tdefw\t75\n\tdefw\t94\n\tdefw\t48\n\tdefw\t37\n\tdefw\t10\n\tdefw\t23\n\tdefw\t51\n\tdefw\t06\n\tdefw\t48\n\tdefw\t53\n\tdefw\t18\n\tdefw\t74\n\tdefw\t98\n\tdefw\t15\n\tdefw\t27\n\tdefw\t02\n\tdefw\t92\n\tdefw\t23\n\tdefw\t08\n\tdefw\t71\n\tdefw\t76\n\tdefw\t84\n\tdefw\t15\n\tdefw\t52\n\tdefw\t92\n\tdefw\t63\n\tdefw\t81\n\tdefw\t10\n\tdefw\t44\n\tdefw\t10\n\tdefw\t69\n\tdefw\t93\n","language":"Z80-Assembly"},{"code":"tri:=File(\"triangle.txt\").pump(List,fcn(s){ s.strip().split(\" \").apply(\"toInt\") }).copy();\nwhile(tri.len()>1){\n t0:=tri.pop();\n t1:=tri.pop();\n tri.append( [[(it); t1.enumerate();\n\t'wrap([(i,t)]){ t + t0[i].max(t0[i+1]) }]])\n}\ntri[0][0].println();\n","language":"Zkl"},{"code":"data:=File(\"triangle.txt\").pump(List,fcn(s){ s.strip().split(\" \").apply(\"toInt\") });\nfcn f(x,y,z){ x + y.max(z) }\nfcn g(xs,ys){ Utils.zipWith(f,ys,xs,xs[1,*]); }\ndata.reverse().reduce(g)[0].println();\n","language":"Zkl"},{"code":"lines:=File(\"triangle.txt\").pump(List,fcn(s){ s.strip().split(\" \").apply(\"toInt\") });\nd:=lines[-1].copy();\nforeach row in ([lines.len()-2..0,-1]){\n d1:=d[1,*];\n l :=d[0];\n foreach i,u in (lines[row].enumerate()){\n d[i] = u + l.max(r:=d1[i]);\n l = r;\n }\n}\nprintln(d[0]);\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Maximum_triangle_path_sum\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Starting from the top of a pyramid of numbers like this, you can walk down going one step on the right or on the left, until you reach the bottom row:\\n<pre>\\n 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n</pre>\\n\\nOne of such walks is 55 - 94 - 30 - 26. \\nYou can compute the total of the numbers you have seen in such walk, \\nin this case it's 205.\\n\\nYour problem is to find the maximum total among all possible paths from the top to the bottom row of the triangle. In the little example above it's 321.\\n\\n\\n;Task:\\nFind the maximum total in the triangle below:\\n<pre>\\n 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n 97 13 76 38 45\\n 07 36 79 16 37 68\\n 48 07 09 18 70 26 06\\n 18 72 79 46 59 79 29 90\\n 20 76 87 11 32 07 07 49 18\\n 27 83 58 35 71 11 25 57 29 85\\n 14 64 36 96 27 11 58 56 92 18 55\\n 02 90 03 60 48 49 41 46 33 36 47 23\\n 92 50 48 02 36 59 42 79 72 20 82 77 42\\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\n</pre>\\n\\nSuch numbers can be included in the solution code, or read from a \\\"triangle.txt\\\" file.\\n\\nThis task is derived from the [http://projecteuler.net/problem=18 Euler Problem #18].\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F solve(&tri)\\n L tri.len > 1\\n V t0 = tri.pop()\\n V t1 = tri.pop()\\n tri.append(enumerate(t1).map((i, t) -> max(@t0[i], @t0[i + 1]) + t))\\n R tri[0][0]\\n\\nV data = ‘ 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n 97 13 76 38 45\\n 07 36 79 16 37 68\\n 48 07 09 18 70 26 06\\n 18 72 79 46 59 79 29 90\\n 20 76 87 11 32 07 07 49 18\\n 27 83 58 35 71 11 25 57 29 85\\n 14 64 36 96 27 11 58 56 92 18 55\\n 02 90 03 60 48 49 41 46 33 36 47 23\\n 92 50 48 02 36 59 42 79 72 20 82 77 42\\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93’\\n\\nprint(solve(&data.split(\\\"\\\\n\\\").map(row -> row.split(‘ ’, group_delimiters' 1B).map(Int))))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Maximum triangle path sum - 28/04/2023\\nMAXTRIA CSECT\\n USING MAXTRIA,R13 base register\\n B 72(R15) skip savearea\\n DC 17F'0' savearea\\n SAVE (14,12) save previous context\\n ST R13,4(R15) link backward\\n ST R15,8(R13) link forward\\n LR R13,R15 set addressability\\n LA R9,1 k=1\\n LA R6,1 i=1\\n DO WHILE=(CH,R6,LE,=AL2(N)) do i=1 to hbound(t)\\n LR R1,R6 i\\n BCTR R1,0 -1\\n MH R1,=AL2(X) *x\\n LA R14,T(R1) @t(i)\\n MVC C,0(R14) c=t(i)\\n LA R7,1 j=1\\n DO WHILE=(CR,R7,LE,R9) do j=1 to k\\n MVC CC,C cc=substr(c,1,2)\\n MVC XDEC,=CL12' ' clear\\n MVC XDEC(L'CC),CC cc\\n XDECI R2,XDEC r2=int(cc)\\n LR R1,R9 k\\n BCTR R1,0 -1\\n MH R1,=AL2(N) *n\\n LR R0,R7 j\\n BCTR R0,0 -1\\n AR R1,R0 (k-1)*n+(j-1)\\n SLA R1,1 *2 (H)\\n STH R2,MM(R1) m(k,j)=xdeci(substr(c,1,2),2)\\n LA R10,X l=length(c)\\n DO WHILE=(CH,R10,GE,=AL2(1)) do l=length(c) to 1 by -1\\n LA R14,C-1 @c-1\\n AR R14,R10 +l\\n MVC CL,0(R14) cl=substr(c,l,1)\\n IF CLI,CL,NE,C' ' THEN if substr(c,l,1)^=' ' then\\n B LEAVEL leave l\\n ENDIF , endif\\n BCTR R10,0 l--\\n ENDDO , enddo l\\nLEAVEL EQU *\\n IF CH,R10,GT,=AL2(4) THEN if l>4 then\\n LR R5,R10 l\\n SH R5,=H'3' l-3 (mvcl source length)\\n LA R3,L'C64 x (mvcl target length)\\n LA R4,C+3 @c+3 (mvcl source)\\n LA R2,C64 @c64 (mvcl target)\\n ICM R3,B'1000',=C' ' padding char\\n MVCL R2,R4 mvcl @c64[64] <- @c+3[l-3]\\n MVC C,C64 c=substr(c,4,l-3)\\n ENDIF , endif\\n LA R7,1(R7) j++\\n ENDDO , enddo j\\n LA R9,1(R9) k=k+1\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n LR R6,R9 k\\n SH R6,=H'2' k-2\\n DO WHILE=(CH,R6,GE,=AL2(1)) do i=k-2 to 1 by -1\\n LA R7,1 j=1\\n DO WHILE=(CR,R7,LE,R6) do j=1 to i\\n LR R1,R6 i\\n MH R1,=AL2(N) *n\\n LR R0,R7 j\\n BCTR R0,0 j-1\\n AR R1,R0 i*n+(j-1)\\n SLA R1,1 *2 (H)\\n LH R2,MM(R1) m(i+1,j)\\n STH R2,S1 s1=m(i+1,j)\\n LR R1,R6 i\\n MH R1,=AL2(N) *n\\n AR R1,R7 i*n+j\\n SLA R1,1 *2 (H)\\n LH R2,MM(R1) m(i+1,j+1)\\n STH R2,S2 s2=m(i+1,j+1)\\n LH R4,S1 s1\\n IF CH,R4,GT,S2 THEN if s1>s2 then\\n LH R8,S1 sm=s1\\n ELSE , else\\n LH R8,S2 sm=s2\\n ENDIF , endif\\n LR R1,R6 i\\n BCTR R1,0 i-1\\n MH R1,=AL2(N) *n\\n LR R0,R7 j\\n BCTR R0,0 j-1\\n AR R1,R0 (i-1)*n+(j-1)\\n SLA R1,1 *2 (H)\\n LH R2,MM(R1) m(i,j)\\n LR R10,R1 index m(i,j)\\n AR R2,R8 m(i,j)+sm\\n STH R2,MM(R10) m(i,j)=m(i,j)+sm\\n LA R7,1(R7) j++\\n ENDDO , enddo j\\n BCTR R6,0 i--\\n ENDDO , enddo i\\n LH R1,MM m(1,1)\\n XDECO R1,PG edit m(1,1)\\n XPRNT PG,L'PG output m(1,1)\\n L R13,4(0,R13) restore previous savearea pointer\\n RETURN (14,12),RC=0 restore registers from calling save\\nN EQU 18 n\\nX EQU 64 x\\nMM DS (N*N)H m(n,n)\\nS1 DS H s1\\nS2 DS H s2\\nC DS CL(X) c\\nCC DS CL2 cc\\nCL DS CL1 cl\\nC64 DS CL(X) c64\\nPG DC CL80' ' buffer\\nXDEC DS CL12 temp for xdeci xdeco\\nT DC CL(X)'55' t(18) char(64)\\n DC CL(X)'94 48'\\n DC CL(X)'95 30 96'\\n DC CL(X)'77 71 26 67'\\n DC CL(X)'97 13 76 38 45'\\n DC CL(X)'07 36 79 16 37 68'\\n DC CL(X)'48 07 09 18 70 26 06'\\n DC CL(X)'18 72 79 46 59 79 29 90'\\n DC CL(X)'20 76 87 11 32 07 07 49 18'\\n DC CL(X)'27 83 58 35 71 11 25 57 29 85'\\n DC CL(X)'14 64 36 96 27 11 58 56 92 18 55'\\n DC CL(X)'02 90 03 60 48 49 41 46 33 36 47 23'\\n DC CL(X)'92 50 48 02 36 59 42 79 72 20 82 77 42'\\n DC CL(X)'56 78 38 80 39 75 02 71 66 66 01 03 55 72'\\n DC CL(X)'44 25 67 84 71 67 11 61 40 57 58 89 40 56 36'\\n DC CL(X)'85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52'\\n DC CL(X)'06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15'\\n DC CL(X)'27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93'\\n REGEQU\\n END MAXTRIA\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"INT FUNC Max(INT a,b)\\n IF a>b THEN RETURN (a) FI\\nRETURN (b)\\n\\nPROC Main()\\n DEFINE ROWCOUNT=\\\"18\\\"\\n INT i,row,len,a,b\\n INT ARRAY rows(ROWCOUNT)\\n INT ARRAY data=[\\n 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n 97 13 76 38 45\\n 07 36 79 16 37 68\\n 48 07 09 18 70 26 06\\n 18 72 79 46 59 79 29 90\\n 20 76 87 11 32 07 07 49 18\\n 27 83 58 35 71 11 25 57 29 85\\n 14 64 36 96 27 11 58 56 92 18 55\\n 02 90 03 60 48 49 41 46 33 36 47 23\\n 92 50 48 02 36 59 42 79 72 20 82 77 42\\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93]\\n\\n row=0 len=1\\n FOR i=0 TO ROWCOUNT-1\\n DO\\n rows(i)=row\\n row==+len len==+1\\n OD\\n\\n row=ROWCOUNT-2\\n WHILE row>=0\\n DO\\n len=row+1\\n FOR i=0 TO len-1\\n DO\\n a=data(rows(row+1)+i)\\n b=data(rows(row+1)+i+1)\\n data(rows(row)+i)==+Max(a,b)\\n OD\\n row==-1\\n OD\\n\\n PrintI(data(0))\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_Io; use Ada.Text_Io;\\n\\nprocedure Max_Sum is\\n\\n Triangle : array (Positive range <>) of integer :=\\n (55,\\n 94, 48,\\n 95, 30, 96,\\n 77, 71, 26, 67,\\n 97, 13, 76, 38, 45,\\n 07, 36, 79, 16, 37, 68,\\n 48, 07, 09, 18, 70, 26, 06,\\n 18, 72, 79, 46, 59, 79, 29, 90,\\n 20, 76, 87, 11, 32, 07, 07, 49, 18,\\n 27, 83, 58, 35, 71, 11, 25, 57, 29, 85,\\n 14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55,\\n 02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23,\\n 92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42,\\n 56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72,\\n 44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36,\\n 85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52,\\n 06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15,\\n 27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93);\\n\\n Last : Integer := Triangle'Length;\\n Tn : Integer := 1;\\n\\nbegin\\n while (Tn * (Tn + 1) / 2) < Last loop\\n Tn := Tn + 1;\\n end loop;\\n for N in reverse 2 .. Tn loop\\n for I in 2 .. N loop\\n\\t Triangle (Last - N) := Triangle (Last - N) +\\n\\t Integer'Max(Triangle (Last - 1), Triangle (Last));\\n\\t Last := Last - 1;\\n end loop;\\n Last := Last - 1;\\n end loop;\\n Put_Line(Integer'Image(Triangle(1)));\\nend Max_Sum;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# create a triangular array of the required values #\\n\\n [ 1]INT row 1 := ( 55 );\\n [ 2]INT row 2 := ( 94, 48 );\\n [ 3]INT row 3 := ( 95, 30, 96 );\\n [ 4]INT row 4 := ( 77, 71, 26, 67 );\\n [ 5]INT row 5 := ( 97, 13, 76, 38, 45 );\\n [ 6]INT row 6 := ( 07, 36, 79, 16, 37, 68 );\\n [ 7]INT row 7 := ( 48, 07, 09, 18, 70, 26, 06 );\\n [ 8]INT row 8 := ( 18, 72, 79, 46, 59, 79, 29, 90 );\\n [ 9]INT row 9 := ( 20, 76, 87, 11, 32, 07, 07, 49, 18 );\\n [10]INT row 10 := ( 27, 83, 58, 35, 71, 11, 25, 57, 29, 85 );\\n [11]INT row 11 := ( 14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55 );\\n [12]INT row 12 := ( 02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23 );\\n [13]INT row 13 := ( 92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42 );\\n [14]INT row 14 := ( 56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72 );\\n [15]INT row 15 := ( 44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36 );\\n [16]INT row 16 := ( 85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52 );\\n [17]INT row 17 := ( 06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15 );\\n [18]INT row 18 := ( 27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93 );\\n\\n[18]REF[]INT triangle := ( row 1, row 2, row 3, row 4, row 5, row 6\\n , row 7, row 8, row 9, row 10, row 11, row 12\\n , row 13, row 14, row 15, row 16, row 17, row 18\\n );\\n\\nPROC max = ( INT a, INT b )INT: IF a > b THEN a ELSE b FI;\\n\\n# working backwards, we replace the elements of each row with the sum of that #\\n# element and the maximum of the two elements below it. #\\n# That destroys the triangle but leaves element [1][1] equal to the required #\\n# maximum #\\n\\n\\nFOR row FROM UPB triangle - 1 BY -1 TO 1\\nDO\\n FOR element FROM 1 TO UPB triangle[row]\\n DO\\n # the elements \\\"under\\\" triangle[row][element] are #\\n # triangle[row+1][element] and triangle[row+1][element+1] #\\n triangle[row][element]\\n +:= max( triangle[row+1][element], triangle[row+1][element+1] )\\n OD\\nOD;\\n\\nprint( ( triangle[1][1], newline ) )\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"parse ← ⍎¨(~∊)∘⎕TC⊆⊢\\nmaxpath ← ⊃(⊣+2⌈/⊢)/\\n⎕ ← maxpath parse ⊃⎕NGET'G:\\\\triangle.txt'\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"---------------- MAXIMUM TRIANGLE PATH SUM ---------------\\n\\n-- Working from the bottom of the triangle upwards,\\n-- summing each number with the larger of the two below\\n-- until the maximum emerges at the top.\\n\\n-- maxPathSum :: [[Int]] -> Int\\non maxPathSum(xss)\\n\\n -- With the last row as the initial accumulator,\\n -- folding from the penultimate line,\\n -- towards the top of the triangle:\\n\\n -- sumWithRowBelow :: [Int] -> [Int] -> [Int]\\n script sumWithRowBelow\\n on |λ|(row, accum)\\n\\n -- plusGreaterOfTwoBelow :: Int -> Int -> Int -> Int\\n script plusGreaterOfTwoBelow\\n on |λ|(x, intLeft, intRight)\\n x + max(intLeft, intRight)\\n end |λ|\\n end script\\n\\n -- The accumulator, zipped with the tail of the\\n -- accumulator, yields pairs of adjacent sums so far.\\n\\n zipWith3(plusGreaterOfTwoBelow, row, accum, tail(accum))\\n end |λ|\\n end script\\n\\n -- A list of lists folded down to a list of just one remaining integer.\\n -- Head returns that integer from the list.\\n\\n head(foldr1(sumWithRowBelow, xss))\\nend maxPathSum\\n\\n\\n--------------------------- TEST -------------------------\\non run\\n\\n maxPathSum({¬\\n {55}, ¬\\n {94, 48}, ¬\\n {95, 30, 96}, ¬\\n {77, 71, 26, 67}, ¬\\n {97, 13, 76, 38, 45}, ¬\\n {7, 36, 79, 16, 37, 68}, ¬\\n {48, 7, 9, 18, 70, 26, 6}, ¬\\n {18, 72, 79, 46, 59, 79, 29, 90}, ¬\\n {20, 76, 87, 11, 32, 7, 7, 49, 18}, ¬\\n {27, 83, 58, 35, 71, 11, 25, 57, 29, 85}, ¬\\n {14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55}, ¬\\n {2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23}, ¬\\n {92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42}, ¬\\n {56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72}, ¬\\n {44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36}, ¬\\n {85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52}, ¬\\n {6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15}, ¬\\n {27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93} ¬\\n })\\n\\n --> 1320\\nend run\\n\\n\\n-------------------- GENERIC FUNCTIONS -------------------\\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-- foldr1 :: (a -> a -> a) -> [a] -> a\\non foldr1(f, xs)\\n if length of xs > 1 then\\n tell mReturn(f)\\n set v to item -1 of xs\\n set lng to length of xs\\n repeat with i from lng - 1 to 1 by -1\\n set v to |λ|(item i of xs, v, i, xs)\\n end repeat\\n return v\\n end tell\\n else\\n xs\\n end if\\nend foldr1\\n\\n\\n-- head :: [a] -> a\\non head(xs)\\n if length of xs > 0 then\\n item 1 of xs\\n else\\n missing value\\n end if\\nend head\\n\\n\\n-- max :: Ord a => a -> a -> a\\non max(x, y)\\n if x > y then\\n x\\n else\\n y\\n end if\\nend max\\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-- 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-- tail :: [a] -> [a]\\non tail(xs)\\n if length of xs > 1 then\\n items 2 thru -1 of xs\\n else\\n {}\\n end if\\nend tail\\n\\n\\n-- zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]\\non zipWith3(f, xs, ys, zs)\\n set lng to minimum({length of xs, length of ys, length of zs})\\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, item i of zs)\\n end repeat\\n return lst\\n end tell\\nend zipWith3\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"data: {:\\n 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n 97 13 76 38 45\\n 07 36 79 16 37 68\\n 48 07 09 18 70 26 06\\n 18 72 79 46 59 79 29 90\\n 20 76 87 11 32 07 07 49 18\\n 27 83 58 35 71 11 25 57 29 85\\n 14 64 36 96 27 11 58 56 92 18 55\\n 02 90 03 60 48 49 41 46 33 36 47 23\\n 92 50 48 02 36 59 42 79 72 20 82 77 42\\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\n:}\\n\\nsolve: function [triangle][\\n tri: triangle\\n while [1 < size tri][\\n t0: last tri\\n chop 'tri\\n loop.with:'i tri\\\\[dec size tri] 't ->\\n tri\\\\[dec size tri]\\\\[i]: t + max @[t0\\\\[i] t0\\\\[inc i]]\\n ]\\n tri\\\\0\\\\0\\n]\\n\\nprint solve map split.lines strip data 'x ->\\n map split.by:\\\" \\\" strip x 'y ->\\n to :integer y\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"fun maxpathsum(t): #: Array{Array{I}}\\n let a = val t\\n for i in a.length-1..-1..1, c in linearindices a[r]:\\n a[r, c] += max(a[r+1, c], a[r=1, c+1])\\n return a[1, 1]\\n\\nlet test = [\\n [55],\\n [94, 48],\\n [95, 30, 96],\\n [77, 71, 26, 67],\\n [97, 13, 76, 38, 45],\\n [07, 36, 79, 16, 37, 68],\\n [48, 07, 09, 18, 70, 26, 06],\\n [18, 72, 79, 46, 59, 79, 29, 90],\\n [20, 76, 87, 11, 32, 07, 07, 49, 18],\\n [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\\n [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\\n [02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23],\\n [92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42],\\n [56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72],\\n [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\\n [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52],\\n [06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15],\\n [27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\\n]\\n\\n@print maxpathsum test\\n\",\n \"language\": \"Astro\"\n },\n {\n \"code\": \"data :=[\\n(join ltrim\\n 55,\\n 94,48,\\n 95,30,96,\\n 77,71,26,67,\\n 97,13,76,38,45,\\n 07,36,79,16,37,68,\\n 48,07,09,18,70,26,06,\\n 18,72,79,46,59,79,29,90,\\n 20,76,87,11,32,07,07,49,18,\\n 27,83,58,35,71,11,25,57,29,85,\\n 14,64,36,96,27,11,58,56,92,18,55,\\n 02,90,03,60,48,49,41,46,33,36,47,23,\\n 92,50,48,02,36,59,42,79,72,20,82,77,42,\\n 56,78,38,80,39,75,02,71,66,66,01,03,55,72,\\n 44,25,67,84,71,67,11,61,40,57,58,89,40,56,36,\\n 85,32,25,85,57,48,84,35,47,62,17,01,01,99,89,52,\\n 06,71,28,75,94,48,37,10,23,51,06,48,53,18,74,98,15,\\n27,02,92,23,08,71,76,84,15,52,92,63,81,10,44,10,69,93\\n)]\\n\\ni\\t:= data.MaxIndex()\\nrow\\t:= Ceil((Sqrt(8*i+1) - 1) / 2)\\npath:=[]\\n\\nloop % row {\\n\\tpath[i] := data[i]\\n\\ti--\\n}\\n\\nwhile i {\\n\\trow := Ceil((Sqrt(8*i+1) - 1) / 2)\\n\\tpath[i] := data[i] \\\"+\\\" (data[i+row] > data[i+row+1] ? path[i+row] : path[i+row+1])\\n\\tdata[i] += data[i+row] > data[i+row+1] ? data[i+row] : data[i+row+1]\\n\\ti --\\n}\\n\\nMsgBox % data[1] \\\"`n\\\" path[1]\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f MAXIMUM_TRIANGLE_PATH_SUM.AWK filename(s)\\n{ printf(\\\"%s\\\\n\\\",$0)\\n cols[FNR] = NF\\n for (i=1; i<=NF; i++) {\\n arr[FNR][i] = $i\\n }\\n}\\nENDFILE {\\n for (row=FNR-1; row>0; row--) {\\n for (col=1; col<=cols[row]; col++) {\\n arr[row][col] += max(arr[row+1][col],arr[row+1][col+1])\\n }\\n }\\n printf(\\\"%d using %s\\\\n\\\\n\\\",arr[1][1],FILENAME)\\n delete arr\\n delete cols\\n}\\nEND {\\n exit(0)\\n}\\nfunction max(x,y) { return((x > y) ? x : y) }\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"arraybase 1\\ndim ln(19)\\nln[1] = \\\" 55\\\"\\nln[2] = \\\" 94 48\\\"\\nln[3] = \\\" 95 30 96\\\"\\nln[4] = \\\" 77 71 26 67\\\"\\nln[5] = \\\" 97 13 76 38 45\\\"\\nln[6] = \\\" 07 36 79 16 37 68\\\"\\nln[7] = \\\" 48 07 09 18 70 26 06\\\"\\nln[8] = \\\" 18 72 79 46 59 79 29 90\\\"\\nln[9] = \\\" 20 76 87 11 32 07 07 49 18\\\"\\nln[10] = \\\" 27 83 58 35 71 11 25 57 29 85\\\"\\nln[11] = \\\" 14 64 36 96 27 11 58 56 92 18 55\\\"\\nln[12] = \\\" 02 90 03 60 48 49 41 46 33 36 47 23\\\"\\nln[13] = \\\" 92 50 48 02 36 59 42 79 72 20 82 77 42\\\"\\nln[14] = \\\" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\\"\\nln[15] = \\\" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\\"\\nln[16] = \\\" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\\"\\nln[17] = \\\" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\\"\\nln[18] = \\\" 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\"\\nln[19] = \\\"end\\\"\\n\\ndim matrix(20,20)\\nx = 1\\ntam = 0\\n\\nfor n = 1 to length(ln) - 1\\n\\tln2 = trim(ln[n])\\n\\tfor y = 1 to x\\n\\t\\tmatrix[x, y] = fromradix((left(ln2, 2)), 10)\\n\\t\\tif length(ln2) > 4 then ln2 = mid(ln2, 4, length(ln2)-4)\\n\\tnext y\\n\\tx += 1\\n\\ttam += 1\\nnext n\\n\\nfor x = tam - 1 to 1 step - 1\\n\\tfor y = 1 to x\\n\\t\\ts1 = matrix[x+1, y]\\n\\t\\ts2 = matrix[x+1, y+1]\\n\\t\\tif s1 > s2 then\\n\\t\\t\\tmatrix[x, y] = matrix[x, y] + s1\\n\\t\\telse\\n\\t\\t\\tmatrix[x, y] = matrix[x, y] + s2\\n\\t\\tend if\\n\\tnext y\\nnext x\\n\\nprint \\\" maximum triangle path sum = \\\" + matrix[1, 1]\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"( \\\"\\n 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n 97 13 76 38 45\\n 07 36 79 16 37 68\\n 48 07 09 18 70 26 06\\n 18 72 79 46 59 79 29 90\\n 20 76 87 11 32 07 07 49 18\\n 27 83 58 35 71 11 25 57 29 85\\n 14 64 36 96 27 11 58 56 92 18 55\\n 02 90 03 60 48 49 41 46 33 36 47 23\\n 92 50 48 02 36 59 42 79 72 20 82 77 42\\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\n\\\"\\n : ?triangle\\n& ( max\\n = a b\\n . !arg:(?a.?b)&(!a:>!b|!b)\\n )\\n& 0:?accumulator\\n& whl\\n ' ( @(!triangle:?row (\\\\n|\\\\r) ?triangle)\\n & :?newaccumulator\\n & 0:?first\\n & whl\\n ' ( @(!row:? #%?n (\\\" \\\" ?row|:?row))\\n & !accumulator:#%?second ?accumulator\\n & !newaccumulator max$(!first.!second)+!n:?newaccumulator\\n & !second:?first\\n )\\n & !newaccumulator 0:?accumulator\\n )\\n& ( -1:?Max\\n & !accumulator\\n : ? (%@:>!Max:?Max&~) ?\\n | out$!Max\\n )\\n)\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <math.h>\\n\\n#define max(x,y) ((x) > (y) ? (x) : (y))\\n\\nint tri[] = {\\n 55,\\n\\t94, 48,\\n\\t95, 30, 96,\\n\\t77, 71, 26, 67,\\n\\t97, 13, 76, 38, 45,\\n\\t7, 36, 79, 16, 37, 68,\\n\\t48, 7, 9, 18, 70, 26, 6,\\n\\t18, 72, 79, 46, 59, 79, 29, 90,\\n\\t20, 76, 87, 11, 32, 7, 7, 49, 18,\\n\\t27, 83, 58, 35, 71, 11, 25, 57, 29, 85,\\n\\t14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55,\\n\\t2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23,\\n\\t92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42,\\n\\t56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72,\\n\\t44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36,\\n\\t85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52,\\n\\t6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15,\\n\\t27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93\\n};\\n\\nint main(void)\\n{\\n const int len = sizeof(tri) / sizeof(tri[0]);\\n const int base = (sqrt(8*len + 1) - 1) / 2;\\n int step = base - 1;\\n int stepc = 0;\\n\\n int i;\\n for (i = len - base - 1; i >= 0; --i) {\\n tri[i] += max(tri[i + step], tri[i + step + 1]);\\n if (++stepc == step) {\\n step--;\\n stepc = 0;\\n }\\n }\\n\\n printf(\\\"%d\\\\n\\\", tri[0]);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"/* Algorithm complexity: n*log(n) */\\n#include <iostream>\\n\\nint main( int argc, char* argv[] )\\n{\\n int triangle[] =\\n {\\n\\t55,\\n\\t94, 48,\\n\\t95, 30, 96,\\n\\t77, 71, 26, 67,\\n\\t97, 13, 76, 38, 45,\\n\\t7, 36, 79, 16, 37, 68,\\n\\t48, 7, 9, 18, 70, 26, 6,\\n\\t18, 72, 79, 46, 59, 79, 29, 90,\\n\\t20, 76, 87, 11, 32, 7, 7, 49, 18,\\n\\t27, 83, 58, 35, 71, 11, 25, 57, 29, 85,\\n\\t14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55,\\n\\t2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23,\\n\\t92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42,\\n\\t56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72,\\n\\t44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36,\\n\\t85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52,\\n\\t6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15,\\n\\t27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93\\n };\\n\\n const int size = sizeof( triangle ) / sizeof( int );\\n const int tn = static_cast<int>(sqrt(2.0 * size));\\n assert(tn * (tn + 1) == 2 * size); // size should be a triangular number\\n\\n // walk backward by rows, replacing each element with max attainable therefrom\\n for (int n = tn - 1; n > 0; --n) // n is size of row, note we do not process last row\\n for (int k = (n * (n-1)) / 2; k < (n * (n+1)) / 2; ++k) // from the start to the end of row\\n triangle[k] += std::max(triangle[k + n], triangle[k + n + 1]);\\n\\n std::cout << \\\"Maximum total: \\\" << triangle[0] << \\\"\\\\n\\\\n\\\";\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nnamespace RosetaCode\\n{\\n\\tclass MainClass\\n\\t{\\n\\t\\tpublic static void Main (string[] args)\\n\\t\\t{\\n\\t\\t\\tint[,] list = new int[18,19];\\n\\t\\t\\tstring input = @\\\"55\\n\\t 94 48\\n\\t 95 30 96\\n\\t 77 71 26 67\\n\\t 97 13 76 38 45\\n\\t 07 36 79 16 37 68\\n\\t 48 07 09 18 70 26 06\\n\\t 18 72 79 46 59 79 29 90\\n\\t 20 76 87 11 32 07 07 49 18\\n\\t 27 83 58 35 71 11 25 57 29 85\\n\\t 14 64 36 96 27 11 58 56 92 18 55\\n\\t 02 90 03 60 48 49 41 46 33 36 47 23\\n\\t 92 50 48 02 36 59 42 79 72 20 82 77 42\\n\\t 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n\\t 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n\\t 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n\\t 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n\\t27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\";\\n\\t\\t\\tvar charArray = input.Split ('\\\\n');\\n\\n\\t\\t\\tfor (int i=0; i < charArray.Length; i++) {\\n\\t\\t\\t\\tvar numArr = charArray[i].Trim().Split(' ');\\n\\n\\t\\t\\t\\tfor (int j = 0; j<numArr.Length; j++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tint number = Convert.ToInt32 (numArr[j]);\\n\\t\\t\\t\\t\\tlist [i, j] = number;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor (int i = 16; i >= 0; i--) {\\n\\t\\t\\t\\tfor (int j = 0; j < 18; j++) {\\n\\t\\t\\t\\t\\tlist[i,j] = Math.Max(list[i, j] + list[i+1, j], list[i,j] + list[i+1, j+1]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tConsole.WriteLine (string.Format(\\\"Maximum total: {0}\\\", list [0, 0]));\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"100 DIM LN$(19)\\n110 LN$(1) = \\\"55\\\"\\n120 LN$(2) = \\\"94 48\\\"\\n130 LN$(3) = \\\"95 30 96\\\"\\n140 LN$(4) = \\\"77 71 26 67\\\"\\n150 LN$(5) = \\\"97 13 76 38 45\\\"\\n160 LN$(6) = \\\"07 36 79 16 37 68\\\"\\n170 LN$(7) = \\\"48 07 09 18 70 26 06\\\"\\n180 LN$(8) = \\\"18 72 79 46 59 79 29 90\\\"\\n190 LN$(9) = \\\"20 76 87 11 32 07 07 49 18\\\"\\n200 LN$(10) = \\\"27 83 58 35 71 11 25 57 29 85\\\"\\n210 LN$(11) = \\\"14 64 36 96 27 11 58 56 92 18 55\\\"\\n220 LN$(12) = \\\"02 90 03 60 48 49 41 46 33 36 47 23\\\"\\n230 LN$(13) = \\\"92 50 48 02 36 59 42 79 72 20 82 77 42\\\"\\n240 LN$(14) = \\\"56 78 38 80 39 75 02 71 66 66 01 03 55 72\\\"\\n250 LN$(15) = \\\"44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\\"\\n260 LN$(16) = \\\"85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\\"\\n270 LN$(17) = \\\"06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\\"\\n280 LN$(18) = \\\"27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\"\\n290 LN$(19) = \\\"end\\\"\\n300 DIM MATRIX(20,20)\\n310 X = 1\\n320 TAM = 0\\n330 FOR N = 1 TO 19\\n340 LN2$ = LN$(N)\\n350 FOR Y = 1 TO X\\n360 MATRIX(X,Y) = VAL(LEFT$(LN2$,2))\\n370 IF LEN(LN2$) > 4 THEN LN2$ = MID$(LN2$,4,LEN(LN2$)-4)\\n380 NEXT Y\\n390 X = X+1\\n400 TAM = TAM+1\\n410 NEXT N\\n420 FOR Z = TAM-1 TO 1 STEP -1\\n430 FOR Y = 1 TO Z\\n440 S1 = MATRIX(Z+1,Y)\\n450 S2 = MATRIX(Z+1,Y+1)\\n460 IF S1 > S2 THEN MATRIX(Z,Y) = MATRIX(Z,Y)+S1\\n470 IF S1 <= S2 THEN MATRIX(Z,Y) = MATRIX(Z,Y)+S2\\n480 NEXT Y\\n490 NEXT Z\\n500 PRINT \\\" maximum triangle path sum = \\\";MATRIX(1,1)\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"(ns clojure.examples.rosetta\\n\\t(:gen-class)\\n (:require [clojure.string :as string]))\\n\\n(def rosetta \\\"55\\n\\t 94 48\\n\\t 95 30 96\\n\\t 77 71 26 67\\n\\t 97 13 76 38 45\\n\\t 07 36 79 16 37 68\\n\\t 48 07 09 18 70 26 06\\n\\t 18 72 79 46 59 79 29 90\\n\\t 20 76 87 11 32 07 07 49 18\\n\\t 27 83 58 35 71 11 25 57 29 85\\n\\t 14 64 36 96 27 11 58 56 92 18 55\\n\\t 02 90 03 60 48 49 41 46 33 36 47 23\\n\\t 92 50 48 02 36 59 42 79 72 20 82 77 42\\n\\t 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n\\t 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n\\t 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n\\t 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n\\t27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\")\\n\\n;; The technique is described here in more detail http://mishadoff.com/blog/clojure-euler-problem-018/\\n;; Most of the code converts the string data to a nested array of integers.\\n;; The code to calculate the max sum is then only a single line\\n\\n;; First convert string data to nested list\\n;; with each inner list containing one row of the triangle\\n;; [[55] [94 48] [95 30 96] ... [...10 69 93]\\n(defn parse-int [s]\\n \\\" Convert digits to a number (finds digits when could be surrounded by non-digits\\\"\\n (Integer. (re-find #\\\"\\\\d+\\\" s)))\\n\\n(defn data-int-array [s]\\n \\\" Convert string to integer array\\\"\\n (map parse-int (string/split (string/trim s) #\\\"\\\\s+\\\")))\\n\\n(defn nested-triangle [s]\\n \\\" Convert triangle to nested vector, with each inner vector containing one triangle row\\\"\\n (loop [lst s n 1 newlist nil]\\n (if (empty? lst) (reverse newlist)\\n (recur (drop n lst) (inc n) (cons (take n lst) newlist)))))\\n; Create nested list\\n(def nested-list (nested-triangle (data-int-array rosetta)))\\n\\n;; Function to compute maximum path sum\\n(defn max-sum [s]\\n \\\" Compute maximum path sum using a technique described here: http://mishadoff.com/blog/clojure-euler-problem-018/\\\"\\n (reduce (fn [a b] (map + b (map max a (rest a)))) (reverse s)))\\n\\n; Print result\\n(println (max-sum nested-list))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defun find-max-path-sum (s)\\n (let ((triangle (loop for line = (read-line s NIL NIL)\\n while line\\n collect (with-input-from-string (str line)\\n (loop for n = (read str NIL NIL)\\n while n\\n collect n)))))\\n (flet ((get-max-of-pairs (xs)\\n (maplist (lambda (ys)\\n (and (cdr ys) (max (car ys) (cadr ys))))\\n xs)))\\n (car (reduce (lambda (xs ys)\\n (mapcar #'+ (get-max-of-pairs xs) ys))\\n (reverse triangle))))))\\n\\n(defparameter *small-triangle*\\n \\\" 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\\")\\n(format T \\\"~a~%\\\" (with-input-from-string (s *small-triangle*)\\n (find-max-path-sum s)))\\n(format T \\\"~a~%\\\" (with-open-file (f \\\"triangle.txt\\\")\\n (find-max-path-sum f)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.algorithm, std.range, std.file, std.conv;\\n\\n \\\"triangle.txt\\\".File.byLine.map!split.map!(to!(int[])).array.retro\\n .reduce!((x, y) => zip(y, x, x.dropOne)\\n .map!(t => t[0] + t[1 .. $].max)\\n .array)[0]\\n .writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"a[] = [ 0 0 ]\\nrepeat\\n s$ = input\\n until s$ = \\\"\\\"\\n i = 1\\n while substr s$ i 1 = \\\" \\\"\\n i += 1\\n .\\n s$ = \\\"0 \\\" & substr s$ i 999 & \\\" 0\\\"\\n b[] = number strsplit s$ \\\" \\\"\\n for i = 2 to len b[] - 1\\n b[i] = higher (b[i] + a[i - 1]) (b[i] + a[i])\\n .\\n swap a[] b[]\\n.\\nfor v in a[]\\n max = higher max v\\n.\\nprint max\\n#\\ninput_data\\n 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n 97 13 76 38 45\\n 07 36 79 16 37 68\\n 48 07 09 18 70 26 06\\n 18 72 79 46 59 79 29 90\\n 20 76 87 11 32 07 07 49 18\\n 27 83 58 35 71 11 25 57 29 85\\n 14 64 36 96 27 11 58 56 92 18 55\\n 02 90 03 60 48 49 41 46 33 36 47 23\\n 92 50 48 02 36 59 42 79 72 20 82 77 42\\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"import system'routines;\\nimport extensions;\\nimport extensions'math;\\n\\nstring input = \\\"55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n 97 13 76 38 45\\n 07 36 79 16 37 68\\n 48 07 09 18 70 26 06\\n 18 72 79 46 59 79 29 90\\n 20 76 87 11 32 07 07 49 18\\n 27 83 58 35 71 11 25 57 29 85\\n 14 64 36 96 27 11 58 56 92 18 55\\n 02 90 03 60 48 49 41 46 33 36 47 23\\n 92 50 48 02 36 59 42 79 72 20 82 77 42\\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\";\\n\\npublic program()\\n{\\n var list := IntMatrix.allocate(18,19);\\n\\n int i := 0;\\n int j := 0;\\n input.splitBy(newLineConstant).forEach::(string line)\\n {\\n j := 0;\\n line.trim().splitBy(\\\" \\\").forEach::(string num)\\n {\\n list[i][j] := num.toInt();\\n\\n j += 1\\n };\\n\\n i += 1\\n };\\n\\n for(int i := 16; i >= 0; i-=1)\\n {\\n for(int j := 0; j < 18; j += 1)\\n {\\n list[i][j] := max(list[i][j] + list[i+1][j], list[i][j] + list[i+1][j+1])\\n }\\n };\\n\\n console.printLine(\\\"Maximum total: \\\", list[0][0])\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"defmodule Maximum do\\n def triangle_path(text) do\\n text\\n |> String.split(\\\"\\\\n\\\", trim: true)\\n |> Enum.map(fn line ->\\n line\\n |> String.split()\\n |> Enum.map(&String.to_integer(&1))\\n end)\\n |> Enum.reduce([], fn x,total ->\\n [0]++total++[0]\\n |> Enum.chunk_every( 2, 1)\\n |> Enum.map(&Enum.max(&1))\\n |> Enum.zip(x)\\n |> Enum.map(fn{a,b} -> a+b end)\\n end)\\n |> Enum.max()\\n end\\nend\\n\\ntext = \\\"\\\"\\\"\\n 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n 97 13 76 38 45\\n 07 36 79 16 37 68\\n 48 07 09 18 70 26 06\\n 18 72 79 46 59 79 29 90\\n 20 76 87 11 32 07 07 49 18\\n 27 83 58 35 71 11 25 57 29 85\\n 14 64 36 96 27 11 58 56 92 18 55\\n 02 90 03 60 48 49 41 46 33 36 47 23\\n 92 50 48 02 36 59 42 79 72 20 82 77 42\\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\n\\\"\\\"\\\"\\n\\nIO.puts Maximum.triangle_path(text)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-mode(compile).\\n-import(lists, [foldl/3]).\\n\\nmain(_) ->\\n {ok, Tmat} = file:open(\\\"triangle.txt\\\", [read, raw, {read_ahead, 16384}]),\\n Max = max_sum(Tmat, []),\\n io:format(\\\"The maximum total is ~b~n\\\", [Max]).\\n\\nmax_sum(FD, Last) ->\\n case file:read_line(FD) of\\n eof -> foldl(fun erlang:max/2, 0, Last);\\n {ok, Line} ->\\n Current = [binary_to_integer(B) || B <- re:split(Line, \\\"[ \\\\n]\\\"), byte_size(B) > 0],\\n max_sum(FD, fold_row(Last, Current))\\n end.\\n\\n% The first argument has one more element than the second, so compute\\n% the initial sum so that both lists have identical length for fold_rest().\\nfold_row([], L) -> L;\\nfold_row([A|_] = Last, [B|Bs]) ->\\n [A+B | fold_rest(Last, Bs)].\\n\\n% Both lists must have same length\\nfold_rest([A], [B]) -> [A+B];\\nfold_rest([A1 | [A2|_] = As], [B|Bs]) -> [B + max(A1,A2) | fold_rest(As, Bs)].\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"PROGRAM TRIANGLE_PATH\\n\\nCONST ROW=18\\n\\nDIM TRI[200]\\n\\n!\\n! for rosettacode,org\\n!\\n\\nFUNCTION MAX(X,Y)\\n MAX=-X*(X>=Y)-Y*(X<Y)\\nEND FUNCTION\\n\\nBEGIN\\n\\n DATA(55)\\n DATA(94,48)\\n DATA(95,30,96)\\n DATA(77,71,26,67)\\n DATA(97,13,76,38,45)\\n DATA(7,36,79,16,37,68)\\n DATA(48,7,9,18,70,26,6)\\n DATA(18,72,79,46,59,79,29,90)\\n DATA(20,76,87,11,32,7,7,49,18)\\n DATA(27,83,58,35,71,11,25,57,29,85)\\n DATA(14,64,36,96,27,11,58,56,92,18,55)\\n DATA(2,90,3,60,48,49,41,46,33,36,47,23)\\n DATA(92,50,48,2,36,59,42,79,72,20,82,77,42)\\n DATA(56,78,38,80,39,75,2,71,66,66,1,3,55,72)\\n DATA(44,25,67,84,71,67,11,61,40,57,58,89,40,56,36)\\n DATA(85,32,25,85,57,48,84,35,47,62,17,1,1,99,89,52)\\n DATA(6,71,28,75,94,48,37,10,23,51,6,48,53,18,74,98,15)\\n DATA(27,2,92,23,8,71,76,84,15,52,92,63,81,10,44,10,69,93)\\n\\n PRINT(CHR$(12);) !CLS\\n LUNG=ROW*(ROW+1)/2\\n FOR I%=0 TO LUNG-1 DO\\n READ(TRI[I%])\\n END FOR\\n\\n BSE=(SQR(8*LUNG+1)-1)/2\\n STP=BSE-1\\n STEPC=0\\n\\n FOR I%=LUNG-BSE-1 TO 0 STEP -1 DO\\n TRI[I%]=TRI[I%]+MAX(TRI[I%+STP],TRI[I%+STP+1])\\n STEPC=STEPC+1\\n IF STEPC=STP THEN\\n STP=STP-1\\n STEPC=0\\n END IF\\n END FOR\\n\\n PRINT(TRI[0])\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"// Maximum triangle path sum. Nigel Galloway: October 23rd., 2023\\nlet g=[[27;02;92;23;08;71;76;84;15;52;92;63;81;10;44;10;69;93];[06;71;28;75;94;48;37;10;23;51;06;48;53;18;74;98;15];[85;32;25;85;57;48;84;35;47;62;17;01;01;99;89;52];[44;25;67;84;71;67;11;61;40;57;58;89;40;56;36];[56;78;38;80;39;75;02;71;66;66;01;03;55;72];[92;50;48;02;36;59;42;79;72;20;82;77;42];[02;90;03;60;48;49;41;46;33;36;47;23];[14;64;36;96;27;11;58;56;92;18;55];[27;83;58;35;71;11;25;57;29;85];[20;76;87;11;32;07;07;49;18];[18;72;79;46;59;79;29;90];[48;07;09;18;70;26;06];[07;36;79;16;37;68];[97;13;76;38;45];[77;71;26;67];[95;30;96];[94;48];[55]]\\nlet fG n g=List.map2(fun (n1,n2) g->(max n1 n2)+g) (n|>List.pairwise) g\\nlet rec fN=function n::g::t->fN ((fG n g)::t) |n::_->List.head n\\nprintfn \\\"%d\\\" (fN g)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: grouping.extras io.encodings.utf8 io.files kernel\\nmath.order math.parser math.vectors prettyprint sequences\\nsplitting ;\\nIN: rosetta-code.maximum-triangle-path-sum\\n\\n: parse-triangle ( path -- seq )\\n utf8 file-lines [ \\\" \\\" split harvest ] map\\n [ [ string>number ] map ] map ;\\n\\n: max-triangle-path-sum ( seq -- n )\\n <reversed> unclip-slice [ swap [ max ] 2clump-map v+ ]\\n reduce first ;\\n\\n\\\"triangle.txt\\\" parse-triangle max-triangle-path-sum .\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"\\\\ Triangle representation; words created by this defining word return the address of element\\n\\\\ specified by its row number and position within that row, both indexed from 0.\\n: TRIANGLE ( \\\"name\\\" -- |DOES: row pos -- addr )\\n CREATE DOES> ROT DUP 1+ * 2/ CELLS + SWAP CELLS +\\n;\\n\\n18 CONSTANT #ROWS \\\\ total number of rows in triangle\\nTRIANGLE triang\\n 55 ,\\n 94 , 48 ,\\n 95 , 30 , 96 ,\\n 77 , 71 , 26 , 67 ,\\n 97 , 13 , 76 , 38 , 45 ,\\n 7 , 36 , 79 , 16 , 37 , 68 ,\\n 48 , 7 , 9 , 18 , 70 , 26 , 6 ,\\n 18 , 72 , 79 , 46 , 59 , 79 , 29 , 90 ,\\n 20 , 76 , 87 , 11 , 32 , 7 , 7 , 49 , 18 ,\\n 27 , 83 , 58 , 35 , 71 , 11 , 25 , 57 , 29 , 85 ,\\n 14 , 64 , 36 , 96 , 27 , 11 , 58 , 56 , 92 , 18 , 55 ,\\n 2 , 90 , 3 , 60 , 48 , 49 , 41 , 46 , 33 , 36 , 47 , 23 ,\\n 92 , 50 , 48 , 2 , 36 , 59 , 42 , 79 , 72 , 20 , 82 , 77 , 42 ,\\n 56 , 78 , 38 , 80 , 39 , 75 , 2 , 71 , 66 , 66 , 1 , 3 , 55 , 72 ,\\n 44 , 25 , 67 , 84 , 71 , 67 , 11 , 61 , 40 , 57 , 58 , 89 , 40 , 56 , 36 ,\\n 85 , 32 , 25 , 85 , 57 , 48 , 84 , 35 , 47 , 62 , 17 , 1 , 1 , 99 , 89 , 52 ,\\n 6 , 71 , 28 , 75 , 94 , 48 , 37 , 10 , 23 , 51 , 6 , 48 , 53 , 18 , 74 , 98 , 15 ,\\n 27 , 2 , 92 , 23 , 8 , 71 , 76 , 84 , 15 , 52 , 92 , 63 , 81 , 10 , 44 , 10 , 69 , 93 ,\\n\\n\\\\ Starting from the row above the bottom row and ending on the top, for every item in row\\n\\\\ find the bigger number from the two neighbours underneath and add it to this item. At\\n\\\\ the end, the result will be returned from the top element of the triangle.\\n: MAX-SUM ( -- n )\\n 0 #ROWS 2 - DO\\n I 1+ 0 DO\\n J 1+ I triang @ J 1+ I 1+ triang @\\n MAX J I triang +!\\n LOOP\\n -1 +LOOP\\n 0 0 triang @\\n;\\n\\nMAX-SUM .\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" MODULE PYRAMIDS\\t!Produces a pyramid of numbers in 1-D array.\\n INTEGER MANY\\t\\t!The usual storage issues.\\n PARAMETER (MANY = 666)\\t!This should suffice.\\n INTEGER BRICK(MANY),IN,LAYERS\\t!Defines a pyramid.\\n CONTAINS\\n SUBROUTINE IMHOTEP(PLAN)!The architect.\\nCounting is from the apex down, the Erich von Daniken construction.\\n CHARACTER*(*) PLAN\\t!The instruction file.\\n INTEGER I,IT\\t\\t!Steppers.\\n CHARACTER*666 ALINE\\t!A scratchpad for input.\\n IN = 0\\t\\t!No bricks.\\n LAYERS = 0\\t\\t!In no courses.\\n WRITE (6,*) \\\"Reading from \\\",PLAN\\t!Here we go.\\n OPEN(10,FILE=PLAN,FORM=\\\"FORMATTED\\\",ACTION=\\\"READ\\\",ERR=6)\\t!I hope.\\n GO TO 10\\t\\t!Why can't OPEN be a function?@*&%#^%!\\n 6 STOP \\\"Can't grab the file!\\\"\\nChew into the plan.\\n 10 READ (10,11,END = 20) ALINE\\t!Get the whole line in one piece.\\n 11 FORMAT (A)\\t\\t\\t!As plain text.\\n IF (ALINE .EQ. \\\"\\\") GO TO 10\\t!Ignoring any blank lines.\\n IF (ALINE(1:1).EQ.\\\"%\\\") GO TO 10\\t!A comment opportunity.\\n LAYERS = LAYERS + 1\\t\\t!Righto, this should be the next layer.\\n IF (IN + LAYERS.GT.MANY) STOP \\\"Too many bricks!\\\"\\t!Perhaps not.\\n READ (ALINE,*,END = 15,ERR = 15) BRICK(IN + 1:IN + LAYERS)\\t!Free format.\\n IN = IN + LAYERS\\t\\t!Insufficient numbers will provoke trouble.\\n GO TO 10\\t\\t\\t!Extra numbers/stuff will be ignored.\\nCaught a crab? A bad number, or too few numbers on a line? No read-next-record antics, thanks.\\n 15 WRITE (6,16) LAYERS,ALINE\\t!Just complain.\\n 16 FORMAT (\\\"Bad layer \\\",I0,\\\": \\\",A)\\nCompleted the plan.\\n 20 WRITE (6,21) IN,LAYERS\\t!Announce some details.\\n 21 FORMAT (I0,\\\" bricks in \\\",I0,\\\" layers.\\\")\\n CLOSE(10)\\t\\t\\t!Finished with input.\\nCast forth the numbers in a nice pyramid.\\n 30 IT = 0\\t\\t!For traversing the pyramid.\\n DO I = 1,LAYERS\\t!Each course has one more number than the one before.\\n WRITE (6,31) BRICK(IT + 1:IT + I)\\t!Sweep along the layer.\\n 31 FORMAT (<LAYERS*2 - 2*I>X,666I4)\\t!Leading spaces may be zero in number.\\n IT = IT + I\\t\\t\\t\\t!Thus finger the last of a layer.\\n END DO\\t\\t!On to the start of the next layer.\\n END SUBROUTINE IMHOTEP\\t!The pyramid's plan is ready.\\n\\n SUBROUTINE TRAVERSE\\t!Clamber around the pyramid. Thoroughly.\\nC The idea is that a pyramid of numbers is provided, and then, starting at the peak,\\nc work down to the base summing the numbers at each step to find the maximum value path.\\nc The constraint is that from a particular brick, only the two numbers below left and below right\\nc may be reached in stepping to that lower layer.\\nc Since that is a 0/1 choice, recorded in MOVE, a base-two scan searches the possibilities.\\n INTEGER MOVE(LAYERS)\\t\\t!Choices are made at the various positions.\\n INTEGER STEP(LAYERS),WALK(LAYERS)\\t!Thus determining the path.\\n INTEGER I,L,IT\\t\\t!Steppers.\\n INTEGER PS,WS\\t\\t!Scores.\\n WRITE (6,1) LAYERS\\t\\t!Announce the intention.\\n 1 FORMAT (//,\\\"Find the highest score path across a pyramid of \\\",\\n 1 I0,\\\" layers.\\\"/)\\t!I'm not worrying over singular/plural.\\n MOVE = 0\\t!All 0/1 values to zero.\\n MOVE(1) = 1\\t!Except the first.\\n STEP(1) = 1\\t!Every path starts here, without option.\\n WS = -666\\t!The best score so far.\\nCommence a multi-level loop, using the values of MOVE as the digits, one digit per level.\\n 10 IT = 1\\t\\t!All paths start with the first step.\\n PS = BRICK(1)\\t!The starting score,.\\nc write (6,8) \\\"Move\\\",MOVE,WS\\n DO L = 2,LAYERS\\t!Deal with the subsequent layers.\\n IT = IT + L - 1 + MOVE(L)\\t!Choose a brick.\\n STEP(L) = IT\\t\\t!Remember this step.\\n PS = PS + BRICK(IT)\\t!Count its score.\\nc WRITE (6,6) L,IT,BRICK(IT),PS\\n 6 FORMAT (\\\"Layer \\\",I0,\\\",Brick(\\\",I0,\\\")=\\\",I0,\\\",Sum=\\\",I0)\\n END DO\\t\\t!Thus is the path determined.\\n IF (PS .GT. WS) THEN\\t!An improvement?\\n IF (WS.GT.0) WRITE (6,7) WS,PS\\t!Yes! Announce.\\n 7 FORMAT (\\\"Improved path score: \\\",I0,\\\" to \\\",I0)\\n WRITE (6,8) \\\"Moves\\\",MOVE\\t\\t!Show the choices at each layer..\\n WRITE (6,8) \\\"Steps\\\",STEP\\t\\t!That resulted in this path.\\n WRITE (6,8) \\\"Score\\\",BRICK(STEP)\\t!Whose steps were scored thus.\\n 8 FORMAT (A8,666I4)\\t\\t\\t!This should suffice.\\n WS = PS\\t\\t\\t\\t!Record the new best value.\\n WALK = STEP\\t\\t\\t!And the path thereby.\\n END IF\\t\\t\\t!So much for an improvement.\\n DO L = LAYERS,1,-1\\t\\t!Now add one to the number in MOVE.\\n IF (MOVE(L).EQ.0) THEN\\t!By finding the lowest order zero.\\n MOVE(L) = 1\\t\\t!Making it one,\\n MOVE(L + 1:LAYERS) = 0\\t!And setting still lower orders back to zero.\\n GO TO 10\\t\\t!And if we did, there's more to do!\\n END IF\\t\\t!But if that bit wasn't zero,\\n END DO\\t\\t!Perhaps the next one up will be.\\n WRITE (6,*) WS,\\\" is the highest score.\\\"\\t!So much for that.\\n END SUBROUTINE TRAVERSE\\t!All paths considered...\\n\\n SUBROUTINE REFINE\\t!Ascertain the highest score without searching.\\n INTEGER BEST(LAYERS)\\t!A scratchpad.\\n INTEGER I,L\\t\\t!Steppers.\\n L = LAYERS*(LAYERS - 1)/2 + 1\\t!Finger the first brick of the lowest layer.\\n BEST = BRICK(L:L + LAYERS - 1)!Syncopation. Copy the lowest layer.\\n DO L = LAYERS - 1,1,-1\\t!Work towards the peak.\\n FORALL (I = 1:L) BEST(I) = BRICK(L*(L - 1)/2 + I)\\t!Add to each brick's value\\n 1 + MAXVAL(BEST(I:I + 1))\\t!The better of its two possibles.\\n END DO\\t\\t\\t!On to the next layer.\\n WRITE (6,*) BEST(1),\\\" is the highest score. By some path.\\\"\\n END SUBROUTINE REFINE\\t!Who knows how we get there.\\n END MODULE PYRAMIDS\\n\\n PROGRAM TRICKLE\\n USE PYRAMIDS\\nc CALL IMHOTEP(\\\"Sakkara.txt\\\")\\n CALL IMHOTEP(\\\"Cheops.txt\\\")\\n CALL TRAVERSE\\t\\t\\t!Do this the definite way.\\n CALL REFINE\\t\\t\\t!Only the result by more cunning.\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' version 21-06-2015\\n' compile with: fbc -s console\\n\\nData \\\" 55\\\"\\nData \\\" 94 48\\\"\\nData \\\" 95 30 96\\\"\\nData \\\" 77 71 26 67\\\"\\nData \\\" 97 13 76 38 45\\\"\\nData \\\" 07 36 79 16 37 68\\\"\\nData \\\" 48 07 09 18 70 26 06\\\"\\nData \\\" 18 72 79 46 59 79 29 90\\\"\\nData \\\" 20 76 87 11 32 07 07 49 18\\\"\\nData \\\" 27 83 58 35 71 11 25 57 29 85\\\"\\nData \\\" 14 64 36 96 27 11 58 56 92 18 55\\\"\\nData \\\" 02 90 03 60 48 49 41 46 33 36 47 23\\\"\\nData \\\" 92 50 48 02 36 59 42 79 72 20 82 77 42\\\"\\nData \\\" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\\"\\nData \\\" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\\"\\nData \\\" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\\"\\nData \\\" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\\"\\nData \\\" 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\"\\nData \\\"END\\\" ' no more data\\n\\n' ------=< MAIN >=------\\n\\nDim As String ln\\nDim As Integer matrix(1 To 20, 1 To 20)\\nDim As Integer x = 1, y, s1, s2, size\\n\\nDo\\n Read ln\\n ln = Trim(ln)\\n If ln = \\\"END\\\" Then Exit Do\\n For y = 1 To x\\n matrix(x, y) = Val(Left(ln, 2))\\n ln = Mid(ln, 4)\\n Next\\n x += 1\\n size += 1\\nLoop\\n\\nFor x = size - 1 To 1 Step - 1\\n For y = 1 To x\\n s1 = matrix(x + 1, y)\\n s2 = matrix(x + 1, y + 1)\\n If s1 > s2 Then\\n matrix(x, y) += s1\\n Else\\n matrix(x, y) += s2\\n End If\\n Next\\nNext\\n\\nPrint\\nPrint \\\" maximum triangle path sum =\\\"; matrix(1, 1)\\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 \\\"strconv\\\"\\n \\\"strings\\\"\\n)\\n\\nconst t = ` 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n 97 13 76 38 45\\n 07 36 79 16 37 68\\n 48 07 09 18 70 26 06\\n 18 72 79 46 59 79 29 90\\n 20 76 87 11 32 07 07 49 18\\n 27 83 58 35 71 11 25 57 29 85\\n 14 64 36 96 27 11 58 56 92 18 55\\n 02 90 03 60 48 49 41 46 33 36 47 23\\n 92 50 48 02 36 59 42 79 72 20 82 77 42\\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93`\\n\\nfunc main() {\\n lines := strings.Split(t, \\\"\\\\n\\\")\\n f := strings.Fields(lines[len(lines)-1])\\n d := make([]int, len(f))\\n var err error\\n for i, s := range f {\\n if d[i], err = strconv.Atoi(s); err != nil {\\n panic(err)\\n }\\n }\\n d1 := d[1:]\\n var l, r, u int\\n for row := len(lines) - 2; row >= 0; row-- {\\n l = d[0]\\n for i, s := range strings.Fields(lines[row]) {\\n if u, err = strconv.Atoi(s); err != nil {\\n panic(err)\\n }\\n if r = d1[i]; l > r {\\n d[i] = u + l\\n } else {\\n d[i] = u + r\\n }\\n l = r\\n }\\n }\\n fmt.Println(d[0])\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"parse = map (map read . words) . lines\\nf x y z = x + max y z\\ng xs ys = zipWith3 f xs ys $ tail ys\\nsolve = head . foldr1 g\\nmain = readFile \\\"triangle.txt\\\" >>= print . solve . parse\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"---------------- MAXIMUM TRIANGLE PATH SUM ---------------\\n\\nmaxPathSum :: [[Int]] -> Int\\nmaxPathSum =\\n head\\n . foldr1\\n ((<*> tail) . zipWith3 (\\\\x y z -> x + max y z))\\n\\n--------------------------- TEST -------------------------\\nmain :: IO ()\\nmain =\\n print $\\n maxPathSum\\n [ [55],\\n [94, 48],\\n [95, 30, 96],\\n [77, 71, 26, 67],\\n [97, 13, 76, 38, 45],\\n [07, 36, 79, 16, 37, 68],\\n [48, 07, 09, 18, 70, 26, 06],\\n [18, 72, 79, 46, 59, 79, 29, 90],\\n [20, 76, 87, 11, 32, 07, 07, 49, 18],\\n [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\\n [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\\n [02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23],\\n [92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42],\\n [56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72],\\n [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\\n [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52],\\n [06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15],\\n [27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\\n ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Control.Applicative (ZipList (ZipList, getZipList))\\n\\n\\n---------------- MAXIMUM TRIANGLE PATH SUM ---------------\\n\\nmaxPathSum :: [[Int]] -> Int\\nmaxPathSum [] = 0\\nmaxPathSum triangleRows =\\n head\\n ( foldr1\\n ( \\\\xs ->\\n ( \\\\ys zs ->\\n getZipList\\n ( ( ( (\\\\x y z -> x + max y z)\\n <$> ZipList xs\\n )\\n <*> ZipList ys\\n )\\n <*> ZipList zs\\n )\\n )\\n <*> tail\\n )\\n triangleRows\\n )\\n\\n\\n--------------------------- TEST -------------------------\\nmain :: IO ()\\nmain =\\n print $\\n maxPathSum\\n [ [55],\\n [94, 48],\\n [95, 30, 96],\\n [77, 71, 26, 67],\\n [97, 13, 76, 38, 45],\\n [07, 36, 79, 16, 37, 68],\\n [48, 07, 09, 18, 70, 26, 06],\\n [18, 72, 79, 46, 59, 79, 29, 90],\\n [20, 76, 87, 11, 32, 07, 07, 49, 18],\\n [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\\n [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\\n [02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23],\\n [92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42],\\n [56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72],\\n [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\\n [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52],\\n [06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15],\\n [27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\\n ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"padTri=: 0 \\\". ];._2 NB. parse triangle and (implicitly) pad with zeros\\nmaxSum=: [: {. (+ (0 ,~ 2 >./\\\\ ]))/ NB. find max triangle path sum\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" maxSum padTri freads 'triangle.txt'\\n1320\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"maxsum=: ((] + #@] {. [)2 >./\\\\ ])/\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.nio.file.*;\\nimport static java.util.Arrays.stream;\\n\\npublic class MaxPathSum {\\n\\n public static void main(String[] args) throws Exception {\\n int[][] data = Files.lines(Paths.get(\\\"triangle.txt\\\"))\\n .map(s -> stream(s.trim().split(\\\"\\\\\\\\s+\\\"))\\n .mapToInt(Integer::parseInt)\\n .toArray())\\n .toArray(int[][]::new);\\n\\n for (int r = data.length - 1; r > 0; r--)\\n for (int c = 0; c < data[r].length - 1; c++)\\n data[r - 1][c] += Math.max(data[r][c], data[r][c + 1]);\\n\\n System.out.println(data[0][0]);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var arr = [\\n[55],\\n[94, 48],\\n[95, 30, 96],\\n[77, 71, 26, 67],\\n[97, 13, 76, 38, 45],\\n[07, 36, 79, 16, 37, 68],\\n[48, 07, 09, 18, 70, 26, 06],\\n[18, 72, 79, 46, 59, 79, 29, 90],\\n[20, 76, 87, 11, 32, 07, 07, 49, 18],\\n[27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\\n[14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\\n[02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23],\\n[92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42],\\n[56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72],\\n[44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\\n[85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52],\\n[06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15],\\n[27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\\n];\\n\\nwhile (arr.length !== 1) {\\n var len = arr.length;\\n var row = [];\\n var current = arr[len-2];\\n var currentLen = current.length - 1;\\n var end = arr[len-1];\\n\\n for ( var i = 0; i <= currentLen; i++ ) {\\n row.push(Math.max(current[i] + end[i] || 0, current[i] + end[i+1] || 0) )\\n }\\n\\n arr.pop();\\n arr.pop();\\n\\n arr.push(row);\\n}\\n\\nconsole.log(arr);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"[ [ 1320 ] ]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(function () {\\n\\n // Right fold using final element as initial accumulator\\n // (a -> a -> a) -> t a -> a\\n function foldr1(f, lst) {\\n return lst.length > 1 ? (\\n f(lst[0], foldr1(f, lst.slice(1)))\\n ) : lst[0];\\n }\\n\\n // function of arity 3 mapped over nth items of each of 3 lists\\n // (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]\\n function zipWith3(f, xs, ys, zs) {\\n return zs.length ? [f(xs[0], ys[0], zs[0])].concat(\\n zipWith3(f, xs.slice(1), ys.slice(1), zs.slice(1))) : [];\\n }\\n\\n // Evaluating from bottom up (right fold)\\n // and with recursion left to right (head and first item of tail at each stage)\\n return foldr1(\\n function (xs, ys) {\\n return zipWith3(\\n function (x, y, z) {\\n return x + (y < z ? z : y);\\n },\\n xs, ys, ys.slice(1) // item above, and larger of two below\\n );\\n }, [\\n [55],\\n [94, 48],\\n [95, 30, 96],\\n [77, 71, 26, 67],\\n [97, 13, 76, 38, 45],\\n [07, 36, 79, 16, 37, 68],\\n [48, 07, 09, 18, 70, 26, 06],\\n [18, 72, 79, 46, 59, 79, 29, 90],\\n [20, 76, 87, 11, 32, 07, 07, 49, 18],\\n [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\\n [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\\n [02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23],\\n [92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42],\\n [56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72],\\n [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\\n [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52],\\n [06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15],\\n [27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\\n ]\\n )[0];\\n\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"1320\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"function maximumTrianglePathSum(triangle) {\\n\\n function distilLastLine() {\\n let lastLine = triangle.pop(),\\n aboveLine = triangle.pop();\\n for (let i = 0; i < aboveLine.length; i++)\\n aboveLine[i] = Math.max(\\n aboveLine[i] + lastLine[i],\\n aboveLine[i] + lastLine[i + 1]\\n );\\n triangle.push(aboveLine);\\n }\\n\\n do {\\n distilLastLine();\\n } while (triangle.length > 1);\\n return triangle[0][0];\\n}\\n\\n// testing\\nlet theTriangle = [\\n[55],\\n[94, 48],\\n[95, 30, 96],\\n[77, 71, 26, 67],\\n[97, 13, 76, 38, 45],\\n[ 7, 36, 79, 16, 37, 68],\\n[48, 7, 9, 18, 70, 26, 6],\\n[18, 72, 79, 46, 59, 79, 29, 90],\\n[20, 76, 87, 11, 32, 7, 7, 49, 18],\\n[27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\\n[14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\\n[ 2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23],\\n[92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42],\\n[56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72],\\n[44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\\n[85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52],\\n[ 6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15],\\n[27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\\n];\\n\\nconsole.log(maximumTrianglePathSum(theTriangle));\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"1320\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n \\\"use strict\\\";\\n\\n // ------------------ MAX PATH SUM -------------------\\n\\n // Working from the bottom of the triangle upwards,\\n // summing each number with the larger of the two below\\n // until the maximum emerges at the top.\\n\\n // maxPathSum ::[[Int]] -> Int\\n const maxPathSum = xss =>\\n // A list of lists folded down to a list of just one\\n // remaining integer.\\n foldr1(\\n // The accumulator, zipped with the tail of the\\n // accumulator, yields pairs of adjacent sums.\\n (ys, xs) => zipWith3(\\n\\n // Plus greater of two below\\n (a, b, c) => a + Math.max(b, c)\\n )(xs)(ys)(ys.slice(1))\\n )(xss)[0];\\n\\n\\n // ---------------- GENERIC FUNCTIONS ----------------\\n\\n // foldr1 :: (a -> a -> a) -> [a] -> a\\n const foldr1 = f =>\\n xs => 0 < xs.length ? (\\n xs.slice(0, -1).reduceRight(\\n f, xs.slice(-1)[0]\\n )\\n ) : [];\\n\\n\\n // zipWith3 :: (a -> b -> c -> d) ->\\n // [a] -> [b] -> [c] -> [d]\\n const zipWith3 = f =>\\n xs => ys => zs => Array.from({\\n length: Math.min(\\n ...[xs, ys, zs].map(x => x.length)\\n )\\n }, (_, i) => f(xs[i], ys[i], zs[i]));\\n\\n\\n // ---------------------- TEST -----------------------\\n return maxPathSum([\\n [55],\\n [94, 48],\\n [95, 30, 96],\\n [77, 71, 26, 67],\\n [97, 13, 76, 38, 45],\\n [7, 36, 79, 16, 37, 68],\\n [48, 7, 9, 18, 70, 26, 6],\\n [18, 72, 79, 46, 59, 79, 29, 90],\\n [20, 76, 87, 11, 32, 7, 7, 49, 18],\\n [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\\n [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\\n [2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23],\\n [92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42],\\n [56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72],\\n [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\\n [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52],\\n [6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15],\\n [27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\\n ]);\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Usage: TRIANGLE | solve\\ndef solve:\\n\\n # update(next) updates the input row of maxima:\\n def update(next):\\n . as $maxima\\n | [ range(0; next|length)\\n | next[.] + ([$maxima[.], $maxima[. + 1]] | max) ];\\n\\n . as $in\\n | reduce range(length -2; -1; -1) as $i\\n ($in[-1]; update( $in[$i] ) ) ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# dynamic solution\\nfunction maxpathsum(t::Array{Array{I, 1}, 1}) where I\\n T = deepcopy(t)\\n for r in length(T)-1:-1:1\\n for c in linearindices(T[r])\\n T[r][c] += max(T[r+1][c], T[r+1][c+1])\\n end\\n end\\n return T[1][1]\\nend\\n\\ntest = [[55],\\n [94, 48],\\n [95, 30, 96],\\n [77, 71, 26, 67],\\n [97, 13, 76, 38, 45],\\n [07, 36, 79, 16, 37, 68],\\n [48, 07, 09, 18, 70, 26, 06],\\n [18, 72, 79, 46, 59, 79, 29, 90],\\n [20, 76, 87, 11, 32, 07, 07, 49, 18],\\n [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\\n [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\\n [02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23],\\n [92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42],\\n [56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72],\\n [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\\n [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52],\\n [06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15],\\n [27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]]\\n\\n@show maxpathsum(test)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nval tri = intArrayOf(\\n 55,\\n 94, 48,\\n 95, 30, 96,\\n 77, 71, 26, 67,\\n 97, 13, 76, 38, 45,\\n 7, 36, 79, 16, 37, 68,\\n 48, 7, 9, 18, 70, 26, 6,\\n 18, 72, 79, 46, 59, 79, 29, 90,\\n 20, 76, 87, 11, 32, 7, 7, 49, 18,\\n 27, 83, 58, 35, 71, 11, 25, 57, 29, 85,\\n 14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55,\\n 2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23,\\n 92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42,\\n 56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72,\\n 44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36,\\n 85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52,\\n 6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15,\\n 27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93\\n)\\n\\nfun main(args: Array<String>) {\\n val triangles = arrayOf(tri.sliceArray(0..9), tri)\\n for (triangle in triangles) {\\n val size = triangle.size\\n val base = ((Math.sqrt(8.0 * size + 1.0) - 1.0)/ 2.0).toInt()\\n var step = base - 1\\n var stepc = 0\\n for (i in (size - base - 1) downTo 0) {\\n triangle[i] += maxOf(triangle[i + step], triangle[i + step + 1])\\n if (++stepc == step) {\\n step--\\n stepc = 0\\n }\\n }\\n println(\\\"Maximum total = ${triangle[0]}\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"local triangleSmall = {\\n { 55 },\\n { 94, 48 },\\n { 95, 30, 96 },\\n { 77, 71, 26, 67 },\\n}\\n\\nlocal triangleLarge = {\\n { 55 },\\n { 94, 48 },\\n { 95, 30, 96 },\\n { 77, 71, 26, 67 },\\n { 97, 13, 76, 38, 45 },\\n { 7, 36, 79, 16, 37, 68 },\\n { 48, 7, 9, 18, 70, 26, 6 },\\n { 18, 72, 79, 46, 59, 79, 29, 90 },\\n { 20, 76, 87, 11, 32, 7, 7, 49, 18 },\\n { 27, 83, 58, 35, 71, 11, 25, 57, 29, 85 },\\n { 14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55 },\\n { 2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23 },\\n { 92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42 },\\n { 56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72 },\\n { 44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36 },\\n { 85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52 },\\n { 6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15 },\\n { 27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93 },\\n};\\n\\nfunction solve(triangle)\\n\\n -- Get total number of rows in triangle.\\n local nRows = table.getn(triangle)\\n\\n -- Start at 2nd-to-last row and work up to the top.\\n for row = nRows-1, 1, -1 do\\n\\n -- For each value in row, add the max of the 2 children beneath it.\\n for i = 1, row do\\n local child1 = triangle[row+1][i]\\n local child2 = triangle[row+1][i+1]\\n triangle[row][i] = triangle[row][i] + math.max(child1, child2)\\n end\\n\\n end\\n\\n -- The top of the triangle now holds the answer.\\n return triangle[1][1];\\n\\nend\\n\\nprint(solve(triangleSmall))\\nprint(solve(triangleLarge))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"nums={{55},{94,48},{95,30,96},{77,71,26,67},{97,13,76,38,45},{7,36,79,16,37,68},{48,7,9,18,70,26,6},{18,72,79,46,59,79,29,90},{20,76,87,11,32,7,7,49,18},{27,83,58,35,71,11,25,57,29,85},{14,64,36,96,27,11,58,56,92,18,55},{2,90,3,60,48,49,41,46,33,36,47,23},{92,50,48,2,36,59,42,79,72,20,82,77,42},{56,78,38,80,39,75,2,71,66,66,1,3,55,72},{44,25,67,84,71,67,11,61,40,57,58,89,40,56,36},{85,32,25,85,57,48,84,35,47,62,17,1,1,99,89,52},{6,71,28,75,94,48,37,10,23,51,6,48,53,18,74,98,15},{27,2,92,23,8,71,76,84,15,52,92,63,81,10,44,10,69,93}};\\nClearAll[DoStep,MaximumTrianglePathSum]\\nDoStep[lst1_List,lst2_List]:=lst2+Join[{First[lst1]},Max/@Partition[lst1,2,1],{Last[lst1]}]\\nMaximumTrianglePathSum[triangle_List]:=Max[Fold[DoStep,First[triangle],Rest[triangle]]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import sequtils, strutils, sugar\\n\\nproc solve(tri: seq[seq[int]]): int =\\n var tri = tri\\n while tri.len > 1:\\n let t0 = tri.pop\\n for i, t in tri[tri.high]: tri[tri.high][i] = max(t0[i], t0[i+1]) + t\\n tri[0][0]\\n\\nconst data = \\\"\\\"\\\"\\n 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n 97 13 76 38 45\\n 07 36 79 16 37 68\\n 48 07 09 18 70 26 06\\n 18 72 79 46 59 79 29 90\\n 20 76 87 11 32 07 07 49 18\\n 27 83 58 35 71 11 25 57 29 85\\n 14 64 36 96 27 11 58 56 92 18 55\\n 02 90 03 60 48 49 41 46 33 36 47 23\\n 92 50 48 02 36 59 42 79 72 20 82 77 42\\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\"\\\"\\\"\\n\\necho solve data.splitLines.map((x: string) => x.strip.split.map parseInt)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"V=[[55],[94,48],[95,30,96],[77,71,26,67],[97,13,76,38,45],[07,36,79,16,37,68],[48,07,09,18,70,26,06],[18,72,79,46,59,79,29,90],[20,76,87,11,32,07,07,49,18],[27,83,58,35,71,11,25,57,29,85],[14,64,36,96,27,11,58,56,92,18,55],[02,90,03,60,48,49,41,46,33,36,47,23],[92,50,48,02,36,59,42,79,72,20,82,77,42],[56,78,38,80,39,75,02,71,66,66,01,03,55,72],[44,25,67,84,71,67,11,61,40,57,58,89,40,56,36],[85,32,25,85,57,48,84,35,47,62,17,01,01,99,89,52],[06,71,28,75,94,48,37,10,23,51,06,48,53,18,74,98,15],[27,02,92,23,08,71,76,84,15,52,92,63,81,10,44,10,69,93]];\\nforstep(i=#V,2,-1,V[i-1]+=vector(i-1,j,max(V[i][j],V[i][j+1]))); V[1][1]\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"program TriSum;\\n{'triangle.txt'\\n* one element per line\\n55\\n94\\n48\\n95\\n30\\n96\\n...}\\nconst\\n cMaxTriHeight = 18;\\n cMaxTriElemCnt = (cMaxTriHeight+1)*cMaxTriHeight DIV 2 +1;\\ntype\\n tElem = longint;\\n tbaseRow = array[0..cMaxTriHeight] of tElem;\\n tmyTri = array[0..cMaxTriElemCnt] of tElem;\\n\\nfunction ReadTri( fname:string;\\n out t:tmyTri):integer;\\n{read triangle values into t and returns height}\\nvar\\n f : text;\\n s : string;\\n i : integer;\\n ValCode : word;\\nbegin\\n i := 0;\\n fillchar(t,Sizeof(t),#0);\\n\\n Assign(f,fname);\\n {$I-}\\n reset(f);\\n IF ioResult <> 0 then\\n begin\\n writeln('IO-Error ',ioResult);\\n close(f);\\n ReadTri := i;\\n EXIT;\\n end;\\n {$I+}\\n\\n while NOT(EOF(f)) AND (i<cMaxTriElemCnt) do\\n begin\\n readln(f,s);\\n val(s,t[i],ValCode);\\n inc(i);\\n IF ValCode <> 0 then\\n begin\\n writeln(ValCode,' conversion error at line ',i);\\n fillchar(t,Sizeof(t),#0);\\n i := 0;\\n BREAK;\\n end;\\n end;\\n close(f);\\n ReadTri := round(sqrt(2*(i-1)));\\nend;\\n\\nfunction TriMaxSum(var t: tmyTri;hei:integer):integer;\\n{sums up higher values bottom to top}\\nvar\\n i,r,h,tmpMax : integer;\\n idxN : integer;\\n sumrow : tbaseRow;\\nbegin\\n h := hei;\\n idxN := (h*(h+1)) div 2 -1;\\n {copy base row}\\n move(t[idxN-h+1],sumrow[0],SizeOf(tElem)*h);\\n dec(h);\\n{ for r := 0 to h do write(sumrow[r]:4);writeln;}\\n idxN := idxN-h;\\n while idxN >0 do\\n begin\\n i := idxN-h;\\n r := 0;\\n while r < h do\\n begin\\n tmpMax:= sumrow[r];\\n IF tmpMax<sumrow[r+1] then\\n tmpMax:=sumrow[r+1];\\n sumrow[r]:= tmpMax+t[i];\\n inc(i);\\n inc(r);\\n end;\\n idxN := idxN-h;\\n dec(h);\\n{ for r := 0 to h do write(sumrow[r]:4);writeln;}\\n end;\\n TriMaxSum := sumrow[0];\\nend;\\n\\nvar\\n h : integer;\\n triangle : tmyTri;\\nBegin\\n{ writeln(TriMaxSum(triangle,ReadTri('triangle.txt',triangle))); -> 1320}\\n h := ReadTri('triangle.txt',triangle);\\n writeln('height sum');\\n while h > 0 do\\n begin\\n writeln(h:4,TriMaxSum(triangle,h):7);\\n dec(h);\\n end;\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use 5.10.0;\\nuse List::Util 'max';\\n\\nmy @sum;\\nwhile (<>) {\\n\\tmy @x = split;\\n\\t@sum = ($x[0] + $sum[0],\\n\\t\\tmap($x[$_] + max(@sum[$_-1, $_]), 1 .. @x-2),\\n\\t\\t$x[-1] + $sum[-1]);\\n}\\n\\nsay max(@sum);\\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;\\\">tri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #000000;\\\">55</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">94</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">48</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">95</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">30</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">96</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">77</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">71</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">26</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">67</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">97</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">13</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">76</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">38</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">45</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">36</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">79</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">16</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">37</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">68</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">48</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">18</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">70</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">26</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6</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;\\\">72</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">79</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">46</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">59</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">79</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">29</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">90</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;\\\">76</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">87</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">49</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">18</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">27</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">83</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">58</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">35</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">71</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">25</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">57</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">29</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">85</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">14</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">64</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">36</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">96</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">27</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">58</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">56</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">92</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">18</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">55</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;\\\">90</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">60</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">48</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">49</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">41</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">46</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">33</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">36</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">47</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">23</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">92</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">50</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">48</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">36</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">59</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">42</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">79</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">72</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">82</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">77</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">42</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">56</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">78</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">38</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">80</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">39</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">75</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">71</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">66</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">66</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;\\\">55</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">72</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">44</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">25</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">67</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">84</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">71</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">67</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">61</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">40</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">57</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">58</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">89</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">40</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">56</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">36</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">85</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">25</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">85</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">57</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">48</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">84</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">35</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">47</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">62</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">17</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;\\\">99</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">89</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">52</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">71</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">28</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">75</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">94</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">48</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">37</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">23</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">51</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">48</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">53</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">18</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">74</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">98</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">15</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">27</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">92</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">23</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">71</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">76</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">84</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">15</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">52</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">92</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">63</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">81</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">44</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">69</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">93</span><span style=\\\"color: #0000FF;\\\">}}</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- update each row from last but one upwards, with the larger\\n -- child, so the first step is to replace 6 with 6+27 or 6+2.</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tri</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: #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;\\\">tri</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: #000000;\\\">tri</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: #7060A8;\\\">max</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tri</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;\\\">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;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">tri</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<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"table (+,+,+,max)\\npp(Row,_Column,Tri,Sum),Row>Tri.length => Sum=0.\\npp(Row,Column,Tri,Sum) ?=>\\n pp(Row+1,Column,Tri,Sum1),\\n Sum = Sum1+Tri[Row,Column].\\npp(Row,Column,Tri,Sum) =>\\n pp(Row+1,Column+1,Tri,Sum1),\\n Sum = Sum1+Tri[Row,Column].\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"pp2(Row, Column, Sum, Tri, M) =>\\n if Sum > M.get(max_val,0) then\\n M.put(max_val,Sum)\\n end,\\n Row := Row + 1,\\n if Row <= Tri.length then\\n foreach(I in 0..1)\\n pp2(Row,Column+I, Sum+Tri[Row,Column+I], Tri, M)\\n end\\n end.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"max_path(N, V) :-\\n\\tdata(N, T),\\n\\tpath(1, T, V).\\n\\npath(_N, [], 0) .\\npath(N, [H | T], V) :-\\n\\tnth(N, H, V0),\\n\\tN1 is N+1,\\n\\tpath(N, T, V1),\\n\\tpath(N1, T, V2),\\n\\tV = V0 + max(V1, V2).\\n\\ndata(2, P) :-\\n\\tP =\\n\\t[ [55],\\n\\t [94, 48],\\n\\t [95, 30, 96],\\n\\t [77, 71, 26, 67],\\n\\t [97, 13, 76, 38, 45],\\n\\t [7, 36, 79, 16, 37, 68],\\n\\t [48, 7, 9, 18, 70, 26, 6],\\n\\t [18, 72, 79, 46, 59, 79, 29, 90],\\n\\t [20, 76, 87, 11, 32, 7, 7, 49, 18],\\n\\t [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\\n\\t [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\\n\\t [2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23],\\n\\t [92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42],\\n\\t [56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72],\\n\\t [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\\n\\t [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52],\\n\\t [6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15],\\n\\t [27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]].\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"import util.\\n\\ngo =>\\n tri(Tri),\\n\\n println(\\\"Mode directed tabling:\\\"),\\n pp(1,1,Tri,Sum),\\n writeln(max_val=Sum),\\n nl,\\n\\n println(\\\"Loop based:\\\"),\\n M = new_map([max_val=0]),\\n pp2(1,1, Tri[1,1], Tri, M),\\n writeln(max_val=M.get(max_val)),\\n nl,\\n\\n println(\\\"Adapted the Prolog solution:\\\"),\\n max_path(2, V2),\\n println(max_val=V2),\\n nl.\\n\\ntri(Tri) =>\\n Tri =\\n{\\n{55},\\n{94,48},\\n{95,30,96},\\n{77,71,26,67},\\n{97,13,76,38,45},\\n{07,36,79,16,37,68},\\n{48,07,09,18,70,26,06},\\n{18,72,79,46,59,79,29,90},\\n{20,76,87,11,32,07,07,49,18},\\n{27,83,58,35,71,11,25,57,29,85},\\n{14,64,36,96,27,11,58,56,92,18,55},\\n{02,90,03,60,48,49,41,46,33,36,47,23},\\n{92,50,48,02,36,59,42,79,72,20,82,77,42},\\n{56,78,38,80,39,75,02,71,66,66,01,03,55,72},\\n{44,25,67,84,71,67,11,61,40,57,58,89,40,56,36},\\n{85,32,25,85,57,48,84,35,47,62,17,01,01,99,89,52},\\n{06,71,28,75,94,48,37,10,23,51,06,48,53,18,74,98,15},\\n{27,02,92,23,08,71,76,84,15,52,92,63,81,10,44,10,69,93}\\n}.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de maxpath (Lst)\\n (let (Lst (reverse Lst) R (car Lst))\\n (for I (cdr Lst)\\n (setq R\\n (mapcar\\n +\\n (maplist\\n '((L)\\n (and (cdr L) (max (car L) (cadr L))) )\\n R )\\n I ) ) )\\n (car R) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"*process source xref attributes or(!);\\n triang: Proc Options(Main);\\n Dcl nn(18,18) Bin Fixed(31);\\n Dcl (rows,i,j) Bin Fixed(31);\\n Dcl (p,k,kn) Bin Fixed(31);\\n Call f_r(1 ,' 55 ');\\n Call f_r(2 ,' 94 48 ');\\n Call f_r(3 ,' 95 30 96 ');\\n Call f_r(4 ,' 77 71 26 67 ');\\n Call f_r(5 ,' 97 13 76 38 45 ');\\n Call f_r(6 ,' 07 36 79 16 37 68 ');\\n Call f_r(7 ,' 48 07 09 18 70 26 06 ');\\n Call f_r(8 ,' 18 72 79 46 59 79 29 90 ');\\n Call f_r(9 ,' 20 76 87 11 32 07 07 49 18 ');\\n Call f_r(10,' 27 83 58 35 71 11 25 57 29 85 ');\\n Call f_r(11,' 14 64 36 96 27 11 58 56 92 18 55 ');\\n Call f_r(12,' 02 90 03 60 48 49 41 46 33 36 47 23 ');\\n Call f_r(13,' 92 50 48 02 36 59 42 79 72 20 82 77 42 ');\\n Call f_r(14,' 56 78 38 80 39 75 02 71 66 66 01 03 55 72 ');\\n Call f_r(15,' 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36 ');\\n Call f_r(16,' 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52 ');\\n Call f_r(17,' 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15 ');\\n Call f_r(18,' 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93');\\n rows=hbound(nn,1);\\n\\n do r=rows by -1 to 2;\\n p=r-1; /*traipse through triangle rows. */\\n do k=1 to p;\\n kn=k+1; /*re-calculate the previous row. */\\n nn(p,k)=max(nn(r,k),nn(r,kn))+nn(p,k); /*replace previous nn */\\n end;\\n end;\\n Put Edit('maximum path sum:',nn(1,1))(Skip,a,f(5)); /*display result*/\\n f_r: Proc(r,vl);\\n /* fill row r with r values */\\n Dcl r Bin Fixed(31);\\n Dcl vl Char(*);\\n Dcl vla Char(100) Var;\\n vla=' '!!trim(vl);\\n get string(vla) Edit((nn(r,j) Do j=1 To r))(f(3));\\n End;\\n End;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"max_path(N, V) :-\\n\\tdata(N, T),\\n\\tpath(0, T, V).\\n\\npath(_N, [], 0) .\\npath(N, [H | T], V) :-\\n\\tnth0(N, H, V0),\\n\\tN1 is N+1,\\n\\tpath(N, T, V1),\\n\\tpath(N1, T, V2),\\n\\tV is V0 + max(V1, V2).\\n\\ndata(1, P) :-\\n\\tP =\\n\\t[ [55],\\n\\t [94, 48],\\n\\t [95, 30, 96],\\n\\t [77, 71, 26, 67]].\\n\\n\\ndata(2, P) :-\\n\\tP =\\n\\t[ [55],\\n\\t [94, 48],\\n\\t [95, 30, 96],\\n\\t [77, 71, 26, 67],\\n\\t [97, 13, 76, 38, 45],\\n\\t [7, 36, 79, 16, 37, 68],\\n\\t [48, 7, 9, 18, 70, 26, 6],\\n\\t [18, 72, 79, 46, 59, 79, 29, 90],\\n\\t [20, 76, 87, 11, 32, 7, 7, 49, 18],\\n\\t [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\\n\\t [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\\n\\t [2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23],\\n\\t [92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42],\\n\\t [56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72],\\n\\t [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\\n\\t [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52],\\n\\t [6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15],\\n\\t [27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]].\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"OpenConsole()\\nDim ln.s(19)\\nln(1) = \\\" 55\\\"\\nln(2) = \\\" 94 48\\\"\\nln(3) = \\\" 95 30 96\\\"\\nln(4) = \\\" 77 71 26 67\\\"\\nln(5) = \\\" 97 13 76 38 45\\\"\\nln(6) = \\\" 07 36 79 16 37 68\\\"\\nln(7) = \\\" 48 07 09 18 70 26 06\\\"\\nln(8) = \\\" 18 72 79 46 59 79 29 90\\\"\\nln(9) = \\\" 20 76 87 11 32 07 07 49 18\\\"\\nln(10) = \\\" 27 83 58 35 71 11 25 57 29 85\\\"\\nln(11) = \\\" 14 64 36 96 27 11 58 56 92 18 55\\\"\\nln(12) = \\\" 02 90 03 60 48 49 41 46 33 36 47 23\\\"\\nln(13) = \\\" 92 50 48 02 36 59 42 79 72 20 82 77 42\\\"\\nln(14) = \\\" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\\"\\nln(15) = \\\" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\\"\\nln(16) = \\\" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\\"\\nln(17) = \\\" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\\"\\nln(18) = \\\" 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\"\\nln(19) = \\\"end\\\"\\n\\nDim matrix.i(20,20)\\nDefine.i x = 1, tam = 0\\nDefine.i i, y, s1, s2, n\\n\\nFor n = 1 To ArraySize(ln(),1) - 1\\n ln2.s = LTrim(ln(n))\\n For y = 1 To x\\n matrix(x, y) = Val(Left(ln2, 2))\\n If Len(ln2) > 4:\\n ln2 = Mid(ln2, 4, Len(ln2)-4)\\n EndIf\\n Next y\\n x + 1\\n tam + 1\\nNext n\\n\\nFor x = tam - 1 To 1 Step - 1\\n For y = 1 To x\\n s1 = matrix(x+1, y)\\n s2 = matrix(x+1, y+1)\\n If s1 > s2:\\n matrix(x, y) = matrix(x, y) + s1\\n Else\\n matrix(x, y) = matrix(x, y) + s2\\n EndIf\\n Next y\\nNext x\\n\\nPrintN(#CRLF$ + \\\" maximum triangle path sum = \\\" + Str(matrix(1, 1)))\\n\\nInput()\\nCloseConsole()\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"def solve(tri):\\n while len(tri) > 1:\\n t0 = tri.pop()\\n t1 = tri.pop()\\n tri.append([max(t0[i], t0[i+1]) + t for i,t in enumerate(t1)])\\n return tri[0][0]\\n\\n\\ndata = \\\"\\\"\\\" 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n 97 13 76 38 45\\n 07 36 79 16 37 68\\n 48 07 09 18 70 26 06\\n 18 72 79 46 59 79 29 90\\n 20 76 87 11 32 07 07 49 18\\n 27 83 58 35 71 11 25 57 29 85\\n 14 64 36 96 27 11 58 56 92 18 55\\n 02 90 03 60 48 49 41 46 33 36 47 23\\n 92 50 48 02 36 59 42 79 72 20 82 77 42\\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\"\\\"\\\"\\n\\nprint solve([map(int, row.split()) for row in data.splitlines()])\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from itertools import imap\\n\\nf = lambda x, y, z: x + max(y, z)\\ng = lambda xs, ys: list(imap(f, ys, xs, xs[1:]))\\ndata = [map(int, row.split()) for row in open(\\\"triangle.txt\\\")][::-1]\\nprint reduce(g, data)[0]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Maximum triangle path sum'''\\n\\nfrom functools import (reduce)\\n\\n\\n# maxPathSum :: [[Int]] -> Int\\ndef maxPathSum(rows):\\n '''The maximum total among all possible\\n paths from the top to the bottom row.\\n '''\\n return reduce(\\n lambda xs, ys: [\\n a + max(b, c) for (a, b, c)\\n in zip(ys, xs, xs[1:])\\n ],\\n reversed(rows[:-1]), rows[-1]\\n )[0]\\n\\n\\n# ------------------------- TEST -------------------------\\nprint(\\n maxPathSum([\\n [55],\\n [94, 48],\\n [95, 30, 96],\\n [77, 71, 26, 67],\\n [97, 13, 76, 38, 45],\\n [7, 36, 79, 16, 37, 68],\\n [48, 7, 9, 18, 70, 26, 6],\\n [18, 72, 79, 46, 59, 79, 29, 90],\\n [20, 76, 87, 11, 32, 7, 7, 49, 18],\\n [27, 83, 58, 35, 71, 11, 25, 57, 29, 85],\\n [14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55],\\n [2, 90, 3, 60, 48, 49, 41, 46, 33, 36, 47, 23],\\n [92, 50, 48, 2, 36, 59, 42, 79, 72, 20, 82, 77, 42],\\n [56, 78, 38, 80, 39, 75, 2, 71, 66, 66, 1, 3, 55, 72],\\n [44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36],\\n [85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 1, 1, 99, 89, 52],\\n [6, 71, 28, 75, 94, 48, 37, 10, 23, 51, 6, 48, 53, 18, 74, 98, 15],\\n [27, 2, 92, 23, 8, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93]\\n ])\\n)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ [] swap\\n behead swap\\n witheach\\n [ tuck max\\n rot swap join\\n swap ]\\n drop ] is pairwise-max ( [ --> [ )\\n\\n [ [] unrot\\n witheach\\n [ dip behead +\\n rot swap join\\n swap ]\\n drop ] is add-items ( [ --> [ )\\n\\n [ behead dip\\n [ reverse\\n behead\\n pairwise-max\\n swap witheach\\n [ add-items\\n pairwise-max ] ]\\n add-items\\n 0 peek ] is mtps ( [ --> n )\\n\\n' [ [ 55 ]\\n [ 94 48 ]\\n [ 95 30 96 ]\\n [ 77 71 26 67 ]\\n [ 97 13 76 38 45 ]\\n [ 07 36 79 16 37 68 ]\\n [ 48 07 09 18 70 26 06 ]\\n [ 18 72 79 46 59 79 29 90 ]\\n [ 20 76 87 11 32 07 07 49 18 ]\\n [ 27 83 58 35 71 11 25 57 29 85 ]\\n [ 14 64 36 96 27 11 58 56 92 18 55 ]\\n [ 02 90 03 60 48 49 41 46 33 36 47 23 ]\\n [ 92 50 48 02 36 59 42 79 72 20 82 77 42 ]\\n [ 56 78 38 80 39 75 02 71 66 66 01 03 55 72 ]\\n [ 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36 ]\\n [ 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52 ]\\n [ 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15 ]\\n [ 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93 ] ]\\nmtps echo\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"#lang racket\\n(require math/number-theory)\\n\\n(define (trinv n) ; OEIS A002024\\n (exact-floor (/ (+ 1 (sqrt (* 1 (* 8 n)))) 2)))\\n\\n(define (triangle-neighbour-bl n)\\n (define row (trinv n))\\n (+ n (- (triangle-number row) (triangle-number (- row 1)))))\\n\\n(define (maximum-triangle-path-sum T)\\n (define n-rows (trinv (vector-length T)))\\n (define memo# (make-hash))\\n (define (inner i)\\n (hash-ref!\\n memo# i\\n (λ ()\\n (+ (vector-ref T (sub1 i)) ; index is 1-based (so vector-refs need -1'ing)\\n (cond [(= (trinv i) n-rows) 0]\\n [else\\n (define bl (triangle-neighbour-bl i))\\n (max (inner bl) (inner (add1 bl)))])))))\\n (inner 1))\\n\\n(module+ main\\n (maximum-triangle-path-sum\\n #(55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n 97 13 76 38 45\\n 07 36 79 16 37 68\\n 48 07 09 18 70 26 06\\n 18 72 79 46 59 79 29 90\\n 20 76 87 11 32 07 07 49 18\\n 27 83 58 35 71 11 25 57 29 85\\n 14 64 36 96 27 11 58 56 92 18 55\\n 02 90 03 60 48 49 41 46 33 36 47 23\\n 92 50 48 02 36 59 42 79 72 20 82 77 42\\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93)))\\n\\n(module+ test\\n (require rackunit)\\n (check-equal? (for/list ((n (in-range 1 (add1 10)))) (trinv n)) '(1 2 2 3 3 3 4 4 4 4))\\n ; 1\\n ; 2 3\\n ; 4 5 6\\n ; 7 8 9 10\\n (check-eq? (triangle-neighbour-bl 1) 2)\\n (check-eq? (triangle-neighbour-bl 3) 5)\\n (check-eq? (triangle-neighbour-bl 5) 8)\\n (define test-triangle\\n #(55 94 48 95 30 96 77 71 26 67))\\n (check-equal? (maximum-triangle-path-sum test-triangle) 321)\\n )\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my $triangle = q| 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n 97 13 76 38 45\\n 07 36 79 16 37 68\\n 48 07 09 18 70 26 06\\n 18 72 79 46 59 79 29 90\\n 20 76 87 11 32 07 07 49 18\\n 27 83 58 35 71 11 25 57 29 85\\n 14 64 36 96 27 11 58 56 92 18 55\\n 02 90 03 60 48 49 41 46 33 36 47 23\\n 92 50 48 02 36 59 42 79 72 20 82 77 42\\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93|;\\n\\n\\nmy @rows = $triangle.lines.map: { [.words] }\\nwhile @rows > 1 {\\n my @last := @rows.pop;\\n @rows[*-1] = (@rows[*-1][] Z+ (@last Zmax @last[1..*])).List;\\n}\\nput @rows;\\n\\n\\n# Here's a more FPish version. We define our own operator and the use it in the reduction metaoperator form, [op], which turns any infix into a list operator.\\nsub infix:<op>(@a,@b) { (@a Zmax @a[1..*]) Z+ @b }\\nput [op] $triangle.lines.reverse.map: { [.words] }\\n\\n\\n# Or, instead of using reverse, one could also define the op as right-associative.\\nsub infix:<rop>(@a,@b) is assoc('right') { @a Z+ (@b Zmax @b[1..*]) }\\nput [rop] $triangle.lines.map: { [.words] }\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program finds the maximum sum of a path of numbers in a pyramid of numbers. */\\n@.=.; @.1 = 55\\n @.2 = 94 48\\n @.3 = 95 30 96\\n @.4 = 77 71 26 67\\n @.5 = 97 13 76 38 45\\n @.6 = 07 36 79 16 37 68\\n @.7 = 48 07 09 18 70 26 06\\n @.8 = 18 72 79 46 59 79 29 90\\n @.9 = 20 76 87 11 32 07 07 49 18\\n @.10 = 27 83 58 35 71 11 25 57 29 85\\n @.11 = 14 64 36 96 27 11 58 56 92 18 55\\n @.12 = 02 90 03 60 48 49 41 46 33 36 47 23\\n @.13 = 92 50 48 02 36 59 42 79 72 20 82 77 42\\n @.14 = 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n @.15 = 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n @.16 = 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n @.17 = 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n @.18 = 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\n#.=0\\n do r=1 while @.r\\\\==. /*build another version of the pyramid.*/\\n do k=1 for r; #.r.k=word(@.r, k) /*assign a number to an array number. */\\n end /*k*/\\n end /*r*/\\n\\n do r=r-1 by -1 to 2; p=r-1 /*traipse through the pyramid rows. */\\n do k=1 for p; _=k+1 /*re─calculate the previous pyramid row*/\\n #.p.k=max(#.r.k, #.r._) + #.p.k /*replace the previous number. */\\n end /*k*/\\n end /*r*/\\n /*stick a fork in it, we're all done. */\\nsay 'maximum path sum: ' #.1.1 /*show the top (row 1) pyramid number. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Maximum triangle path sum\\n\\nload \\\"stdlib.ring\\\"\\nln = list(19)\\nln[1] = \\\" 55\\\"\\nln[2] = \\\" 94 48\\\"\\nln[3] = \\\" 95 30 96\\\"\\nln[4] = \\\" 77 71 26 67\\\"\\nln[5] = \\\" 97 13 76 38 45\\\"\\nln[6] = \\\" 07 36 79 16 37 68\\\"\\nln[7] = \\\" 48 07 09 18 70 26 06\\\"\\nln[8] = \\\" 18 72 79 46 59 79 29 90\\\"\\nln[9] = \\\" 20 76 87 11 32 07 07 49 18\\\"\\nln[10] = \\\" 27 83 58 35 71 11 25 57 29 85\\\"\\nln[11] = \\\" 14 64 36 96 27 11 58 56 92 18 55\\\"\\nln[12] = \\\" 02 90 03 60 48 49 41 46 33 36 47 23\\\"\\nln[13] = \\\" 92 50 48 02 36 59 42 79 72 20 82 77 42\\\"\\nln[14] = \\\" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\\"\\nln[15] = \\\" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\\"\\nln[16] = \\\" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\\"\\nln[17] = \\\" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\\"\\nln[18] = \\\" 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\"\\nln[19] = \\\"end\\\"\\n\\nmatrix = newlist(20,20)\\nx = 1\\nsize = 0\\n\\nfor n = 1 to len(ln) - 1\\n ln2 = ln[n]\\n ln2 = trim(ln2)\\n for y = 1 to x\\n matrix[x][y] = number(left(ln2,2))\\n if len(ln2) > 4\\n ln2 = substr(ln2,4,len(ln2)-4)\\n ok\\n next\\n x = x + 1\\n size = size + 1\\nnext\\n\\nfor x = size - 1 to 1 step - 1\\n for y = 1 to x\\n s1 = matrix[x+1][y]\\n s2 = matrix[x+1][y+1]\\n if s1 > s2\\n matrix[x][y] = matrix[x][y] + s1\\n else\\n matrix[x][y] = matrix[x][y] + s2\\n ok\\n next\\nnext\\n\\nsee \\\"maximum triangle path sum = \\\" + matrix[1][1]\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"triangle =\\n\\\" 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n 97 13 76 38 45\\n 07 36 79 16 37 68\\n 48 07 09 18 70 26 06\\n 18 72 79 46 59 79 29 90\\n 20 76 87 11 32 07 07 49 18\\n 27 83 58 35 71 11 25 57 29 85\\n 14 64 36 96 27 11 58 56 92 18 55\\n 02 90 03 60 48 49 41 46 33 36 47 23\\n 92 50 48 02 36 59 42 79 72 20 82 77 42\\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\"\\n\\nar = triangle.each_line.map{|line| line.split.map(&:to_i)}\\nputs ar.inject([]){|res,x|\\n maxes = [0, *res, 0].each_cons(2).map(&:max)\\n x.zip(maxes).map{|a,b| a+b}\\n}.max\\n# => 1320\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"dim ln$(19)\\nln$(1) = \\\" 55\\\"\\nln$(2) = \\\" 94 48\\\"\\nln$(3) = \\\" 95 30 96\\\"\\nln$(4) = \\\" 77 71 26 67\\\"\\nln$(5) = \\\" 97 13 76 38 45\\\"\\nln$(6) = \\\" 07 36 79 16 37 68\\\"\\nln$(7) = \\\" 48 07 09 18 70 26 06\\\"\\nln$(8) = \\\" 18 72 79 46 59 79 29 90\\\"\\nln$(9) = \\\" 20 76 87 11 32 07 07 49 18\\\"\\nln$(10) = \\\" 27 83 58 35 71 11 25 57 29 85\\\"\\nln$(11) = \\\" 14 64 36 96 27 11 58 56 92 18 55\\\"\\nln$(12) = \\\" 02 90 03 60 48 49 41 46 33 36 47 23\\\"\\nln$(13) = \\\" 92 50 48 02 36 59 42 79 72 20 82 77 42\\\"\\nln$(14) = \\\" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\\"\\nln$(15) = \\\" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\\"\\nln$(16) = \\\" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\\"\\nln$(17) = \\\" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\\"\\nln$(18) = \\\" 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\"\\nln$(19) = \\\"end\\\"\\n\\ndim matrix(20,20)\\nx = 1\\ntam = 0\\n\\nfor n = 1 to 19 'ubound(ln$) - 1\\n ln2$ = trim$(ln$(n))\\n for y = 1 to x\\n matrix(x, y) = val(left$(ln2$, 2))\\n if len(ln2$) > 4 then ln2$ = mid$(ln2$, 4, len(ln2$)-4)\\n next y\\n x = x +1\\n tam = tam +1\\nnext n\\n\\nfor z = tam-1 to 1 step -1\\n for y = 1 to z\\n s1 = matrix(z+1, y)\\n s2 = matrix(z+1, y+1)\\n if s1 > s2 then\\n matrix(z, y) = matrix(z, y) +s1\\n else\\n matrix(z, y) = matrix(z, y) +s2\\n end if\\n next y\\nnext z\\n\\nprint \\\" maximum triangle path sum = \\\"; matrix(1, 1)\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use std::cmp::max;\\n\\nfn max_path(vector: &mut Vec<Vec<u32>>) -> u32 {\\n\\n while vector.len() > 1 {\\n\\n let last = vector.pop().unwrap();\\n let ante = vector.pop().unwrap();\\n\\n let mut new: Vec<u32> = Vec::new();\\n\\n for (i, value) in ante.iter().enumerate() {\\n new.push(max(last[i], last[i+1]) + value);\\n };\\n\\n vector.push(new);\\n };\\n\\n vector[0][0]\\n}\\n\\nfn main() {\\n let mut data = \\\"55\\n94 48\\n95 30 96\\n77 71 26 67\\n97 13 76 38 45\\n07 36 79 16 37 68\\n48 07 09 18 70 26 06\\n18 72 79 46 59 79 29 90\\n20 76 87 11 32 07 07 49 18\\n27 83 58 35 71 11 25 57 29 85\\n14 64 36 96 27 11 58 56 92 18 55\\n02 90 03 60 48 49 41 46 33 36 47 23\\n92 50 48 02 36 59 42 79 72 20 82 77 42\\n56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\";\\n\\n let mut vector = data.split(\\\"\\\\n\\\").map(|x| x.split(\\\" \\\").map(|s: &str| s.parse::<u32>().unwrap())\\n .collect::<Vec<u32>>()).collect::<Vec<Vec<u32>>>();\\n\\n let max_value = max_path(&mut vector);\\n\\n println!(\\\"{}\\\", max_value);\\n //=> 7273\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object MaximumTrianglePathSum extends App {\\n // Solution:\\n def sum(triangle: Array[Array[Int]]) =\\n triangle.reduceRight((upper, lower) =>\\n upper zip (lower zip lower.tail)\\n map {case (above, (left, right)) => above + Math.max(left, right)}\\n ).head\\n\\n // Tests:\\n def triangle = \\\"\\\"\\\"\\n 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n \\\"\\\"\\\"\\n def parse(s: String) = s.trim.split(\\\"\\\\\\\\s+\\\").map(_.toInt)\\n def parseLines(s: String) = s.trim.split(\\\"\\\\n\\\").map(parse)\\n def parseFile(f: String) = scala.io.Source.fromFile(f).getLines.map(parse).toArray\\n println(sum(parseLines(triangle)))\\n println(sum(parseFile(\\\"triangle.txt\\\")))\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"var sum = [0]\\n\\nARGF.each { |line|\\n var x = line.words.map{.to_n}\\n sum = [\\n x.first + sum.first,\\n 1 ..^ x.end -> map{|i| x[i] + [sum[i-1, i]].max}...,\\n x.last + sum.last,\\n ]\\n}\\n\\nsay sum.max\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"var triangle = ARGF.slurp.lines.map{.words.map{.to_n}}\\n \\nfunc max_value(i=0, j=0) is cached {\\n i == triangle.len && return 0\\n triangle[i][j] + [max_value(i+1, j), max_value(i+1, j+1)].max\\n}\\n \\nsay max_value()\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"import delimited triangle.txt, delim(\\\" \\\") clear\\nmata\\na = st_data(.,.)\\nn = rows(a)\\nfor (i=n-1; i>=1; i--) {\\n\\tfor (j=1; j<=i; j++) {\\n\\t\\ta[i,j] = a[i,j]+max((a[i+1,j],a[i+1,j+1]))\\n\\t}\\n}\\na[1,1]\\nend\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"package require Tcl 8.6\\n\\nproc maxTrianglePathSum {definition} {\\n # Parse the definition, stripping whitespace and leading zeroes.\\n set lines [lmap line [split [string trim $definition] \\\"\\\\n\\\"] {\\n\\tlmap val $line {scan $val %d}\\n }]\\n # Paths are bit strings (0 = go left, 1 = go right).\\n # Enumerate the possible paths.\\n set numPaths [expr {2 ** [llength $lines]}]\\n for {set path 0; set max -inf} {$path < $numPaths} {incr path} {\\n\\t# Work out how much the current path costs.\\n\\tset sum [set idx [set row 0]]\\n\\tfor {set bit 1} {$row < [llength $lines]} {incr row} {\\n\\t incr sum [lindex $lines $row $idx]\\n\\t if {$path & $bit} {incr idx}\\n\\t set bit [expr {$bit << 1}]\\n\\t}\\n\\t# Remember the max so far.\\n\\tif {$sum > $max} {set max $sum}\\n }\\n return $max\\n}\\n\\nputs [maxTrianglePathSum {\\n 55\\n 94 48\\n 95 30 96\\n 77 71 26 67\\n 97 13 76 38 45\\n 07 36 79 16 37 68\\n 48 07 09 18 70 26 06\\n 18 72 79 46 59 79 29 90\\n 20 76 87 11 32 07 07 49 18\\n 27 83 58 35 71 11 25 57 29 85\\n 14 64 36 96 27 11 58 56 92 18 55\\n 02 90 03 60 48 49 41 46 33 36 47 23\\n 92 50 48 02 36 59 42 79 72 20 82 77 42\\n 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\n 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\n 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\n 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\n27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\n}]\\n# Reading from a file is left as an exercise…\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"DATA \\\" 55\\\"\\nDATA \\\" 94 48\\\"\\nDATA \\\" 95 30 96\\\"\\nDATA \\\" 77 71 26 67\\\"\\nDATA \\\" 97 13 76 38 45\\\"\\nDATA \\\" 07 36 79 16 37 68\\\"\\nDATA \\\" 48 07 09 18 70 26 06\\\"\\nDATA \\\" 18 72 79 46 59 79 29 90\\\"\\nDATA \\\" 20 76 87 11 32 07 07 49 18\\\"\\nDATA \\\" 27 83 58 35 71 11 25 57 29 85\\\"\\nDATA \\\" 14 64 36 96 27 11 58 56 92 18 55\\\"\\nDATA \\\" 02 90 03 60 48 49 41 46 33 36 47 23\\\"\\nDATA \\\" 92 50 48 02 36 59 42 79 72 20 82 77 42\\\"\\nDATA \\\" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\\"\\nDATA \\\" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\\"\\nDATA \\\" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\\"\\nDATA \\\" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\\"\\nDATA \\\" 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\"\\nDATA \\\"END\\\" ! no more DATA\\n\\nDIM matrix(1 TO 20, 1 TO 20)\\nLET x = 1\\nDO\\n READ ln$\\n LET ln$ = LTRIM$(RTRIM$(ln$))\\n IF ln$ = \\\"END\\\" THEN EXIT DO\\n FOR y = 1 TO x\\n LET matrix(x, y) = VAL((ln$)[1:2])\\n LET ln$ = (ln$)[4:maxnum]\\n NEXT y\\n LET x = x+1\\n LET tam = tam+1\\nLOOP\\nFOR x = tam-1 TO 1 STEP -1\\n FOR y = 1 TO x\\n LET s1 = matrix(x+1, y)\\n LET s2 = matrix(x+1, y+1)\\n IF s1 > s2 THEN LET matrix(x, y) = matrix(x, y)+s1 ELSE LET matrix(x, y) = matrix(x, y)+s2\\n NEXT y\\nNEXT x\\n\\nPRINT \\\" maximum triangle path sum =\\\"; matrix(1, 1)\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"'Solution derived from http://stackoverflow.com/questions/8002252/euler-project-18-approach.\\n\\nSet objfso = CreateObject(\\\"Scripting.FileSystemObject\\\")\\nSet objinfile = objfso.OpenTextFile(objfso.GetParentFolderName(WScript.ScriptFullName) &_\\n\\t\\\"\\\\triangle.txt\\\",1,False)\\n\\t\\nrow = Split(objinfile.ReadAll,vbCrLf)\\n\\nFor i = UBound(row) To 0 Step -1\\n\\trow(i) = Split(row(i),\\\" \\\")\\n\\tIf i < UBound(row) Then\\n\\t\\tFor j = 0 To UBound(row(i))\\n\\t\\t\\tIf (row(i)(j) + row(i+1)(j)) > (row(i)(j) + row(i+1)(j+1)) Then\\n\\t\\t\\t\\trow(i)(j) = CInt(row(i)(j)) + CInt(row(i+1)(j))\\n\\t\\t\\tElse\\n\\t\\t\\t\\trow(i)(j) = CInt(row(i)(j)) + CInt(row(i+1)(j+1))\\n\\t\\t\\tEnd If\\n\\t\\tNext\\n\\tEnd If\\t\\nNext\\n\\nWScript.Echo row(0)(0)\\n\\nobjinfile.Close\\nSet objfso = Nothing\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"var lines = [\\n \\\" 55\\\",\\n \\\" 94 48\\\",\\n \\\" 95 30 96\\\",\\n \\\" 77 71 26 67\\\",\\n \\\" 97 13 76 38 45\\\",\\n \\\" 07 36 79 16 37 68\\\",\\n \\\" 48 07 09 18 70 26 06\\\",\\n \\\" 18 72 79 46 59 79 29 90\\\",\\n \\\" 20 76 87 11 32 07 07 49 18\\\",\\n \\\" 27 83 58 35 71 11 25 57 29 85\\\",\\n \\\" 14 64 36 96 27 11 58 56 92 18 55\\\",\\n \\\" 02 90 03 60 48 49 41 46 33 36 47 23\\\",\\n \\\" 92 50 48 02 36 59 42 79 72 20 82 77 42\\\",\\n \\\" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\\",\\n \\\" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\\",\\n \\\" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\\",\\n \\\" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\\",\\n \\\"27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\"\\n]\\nvar f = lines[-1].split(\\\" \\\")\\nvar d = f.map { |s| Num.fromString(s) }.toList\\nfor (row in lines.count-2..0) {\\n var l = d[0]\\n var i = 0\\n for (s in lines[row].trimStart().split(\\\" \\\")) {\\n var u = Num.fromString(s)\\n var r = d[i+1]\\n d[i] = (l > r) ? u + l : u + r\\n l = r\\n i = i + 1\\n }\\n}\\nSystem.print(d[0])\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"function Max(A, B);\\nint A, B;\\nreturn if A > B then A else B;\\n\\nint Triangle, Last, Tn, N, I;\\nbegin\\nTriangle:= [0,\\n 55,\\n 94, 48,\\n 95, 30, 96,\\n 77, 71, 26, 67,\\n 97, 13, 76, 38, 45,\\n 07, 36, 79, 16, 37, 68,\\n 48, 07, 09, 18, 70, 26, 06,\\n 18, 72, 79, 46, 59, 79, 29, 90,\\n 20, 76, 87, 11, 32, 07, 07, 49, 18,\\n 27, 83, 58, 35, 71, 11, 25, 57, 29, 85,\\n 14, 64, 36, 96, 27, 11, 58, 56, 92, 18, 55,\\n 02, 90, 03, 60, 48, 49, 41, 46, 33, 36, 47, 23,\\n 92, 50, 48, 02, 36, 59, 42, 79, 72, 20, 82, 77, 42,\\n 56, 78, 38, 80, 39, 75, 02, 71, 66, 66, 01, 03, 55, 72,\\n 44, 25, 67, 84, 71, 67, 11, 61, 40, 57, 58, 89, 40, 56, 36,\\n 85, 32, 25, 85, 57, 48, 84, 35, 47, 62, 17, 01, 01, 99, 89, 52,\\n 06, 71, 28, 75, 94, 48, 37, 10, 23, 51, 06, 48, 53, 18, 74, 98, 15,\\n 27, 02, 92, 23, 08, 71, 76, 84, 15, 52, 92, 63, 81, 10, 44, 10, 69, 93];\\n\\n Last := (18*18+18)/2;\\n Tn := 1;\\n\\n while (Tn * (Tn + 1) / 2) < Last do\\n Tn := Tn + 1;\\n for N:= Tn downto 2 do begin\\n for I:= 2 to N do begin\\n Triangle (Last - N) := Triangle (Last - N) +\\n Max(Triangle (Last - 1), Triangle (Last));\\n Last := Last - 1;\\n end;\\n Last := Last - 1;\\n end;\\n IntOut(0, Triangle(1));\\n CrLf(0);\\nend;\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"dim ln$(19)\\nln$(1) = \\\" 55\\\"\\nln$(2) = \\\" 94 48\\\"\\nln$(3) = \\\" 95 30 96\\\"\\nln$(4) = \\\" 77 71 26 67\\\"\\nln$(5) = \\\" 97 13 76 38 45\\\"\\nln$(6) = \\\" 07 36 79 16 37 68\\\"\\nln$(7) = \\\" 48 07 09 18 70 26 06\\\"\\nln$(8) = \\\" 18 72 79 46 59 79 29 90\\\"\\nln$(9) = \\\" 20 76 87 11 32 07 07 49 18\\\"\\nln$(10) = \\\" 27 83 58 35 71 11 25 57 29 85\\\"\\nln$(11) = \\\" 14 64 36 96 27 11 58 56 92 18 55\\\"\\nln$(12) = \\\" 02 90 03 60 48 49 41 46 33 36 47 23\\\"\\nln$(13) = \\\" 92 50 48 02 36 59 42 79 72 20 82 77 42\\\"\\nln$(14) = \\\" 56 78 38 80 39 75 02 71 66 66 01 03 55 72\\\"\\nln$(15) = \\\" 44 25 67 84 71 67 11 61 40 57 58 89 40 56 36\\\"\\nln$(16) = \\\" 85 32 25 85 57 48 84 35 47 62 17 01 01 99 89 52\\\"\\nln$(17) = \\\" 06 71 28 75 94 48 37 10 23 51 06 48 53 18 74 98 15\\\"\\nln$(18) = \\\" 27 02 92 23 08 71 76 84 15 52 92 63 81 10 44 10 69 93\\\"\\nln$(19) = \\\"end\\\"\\n\\ndim matrix(20,20)\\nx = 1\\ntam = 0\\n\\nfor n = 1 to arraysize(ln$(),1) - 1\\n\\tln2$ = trim$(ln$(n))\\n\\tfor y = 1 to x\\n\\t\\tmatrix(x, y) = val(left$(ln2$, 2))\\n\\t\\tif len(ln2$) > 4 ln2$ = mid$(ln2$, 4, len(ln2$)-4)\\n\\tnext y\\n\\tx = x + 1\\n\\ttam = tam + 1\\nnext n\\n\\nfor x = tam - 1 to 1 step - 1\\n\\tfor y = 1 to x\\n\\t\\ts1 = matrix(x+1, y)\\n\\t\\ts2 = matrix(x+1, y+1)\\n\\t\\tif s1 > s2 then\\n\\t\\t\\tmatrix(x, y) = matrix(x, y) + s1\\n\\t\\telse\\n\\t\\t\\tmatrix(x, y) = matrix(x, y) + s2\\n\\t\\tend if\\n\\tnext y\\nnext x\\n\\nprint \\\"\\\\n maximum triangle path sum = \\\", matrix(1, 1)\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"\\t;\\n\\t; Find maximum triangle path sum 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; Thanks to https://wikiti.brandonw.net for the idea for the conversion routine hl -> decimal ASCII\\n\\t;\\n\\t;\\n\\t; 2023-04-28 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\\twrtstr\\tequ 09h\\t\\t; Write string to console\\n\\n\\tnul\\tequ 00h\\t\\t; ASCII control characters\\n\\tcr\\tequ 0dh\\n\\tlf\\tequ 0ah\\n\\n\\tcnull\\tequ '0'\\t\\t; ASCII character constants\\n\\n\\ttrisize\\tequ 171\\t\\t; Number of elements in triangle, must be counted manually - elements are 16 bit words\\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\\npushall\\tmacro\\t\\t\\t; Save all registers to stack\\n\\tpush\\taf\\n\\tpush\\tbc\\n\\tpush\\tde\\n\\tpush\\thl\\n\\tpush\\tix\\n\\tpush\\tiy\\n\\tendm\\n\\npopall\\tmacro\\t\\t\\t; Recall all registers from stack\\n\\tpop\\tiy\\n\\tpop\\tix\\n\\tpop\\thl\\n\\tpop\\tde\\n\\tpop\\tbc\\n\\tpop\\taf\\n\\tendm\\n\\n\\t;\\n\\t; =====================\\n\\t; Start of main program\\n\\t; =====================\\n\\t;\\n\\n\\tcseg\\n\\n\\t;\\n\\t; The total number of elements in a triangle with N rows is the sum of the numbers 1..N, and we need to\\n\\t; determine N for the given number of elements (trisize from above).\\n\\t; Since the Z80 has no multiplication instruction, we can not use the Gauss formula N * (N + 1) / 2. Instead, we\\n\\t; just sum up all the numbers beginning with 1, until we exceed the number of elements.\\n\\t;\\n\\n\\tld\\ta,trisize\\t; a holds number of elements for comparison\\n\\tld\\tde,1\\t\\t; de is the counter from 1..N\\n\\tld\\thl,0\\t\\t; hl holds the accumulated sum. Since a must be used for comparison, we need hl as accumulator\\n\\nsum1toN:\\n\\tadd\\thl,de\\t\\t; Add next number to hl\\n\\tcp\\tl\\t\\t; Comparison is only 8 bit! The maximum number of elements is limited to 255\\n\\tjr\\tc,foundN\\t; If l exceeds trisize, we are finished and need to reduce de again\\n\\tinc\\tde\\t\\t; Otherwise, increase de and repeat\\n\\tjr\\tsum1toN\\n\\nfoundN:\\n\\tdec\\tde\\t\\t; We overshot the target and need to reduce de again. de now holds N, the number of rows = elements in last row\\n\\tld\\tb,e\\t\\t; Our actual counters will be b and c\\n\\n\\tld\\tix,triangle\\t; Set ix to LSB of very last element (16 bit word) of triangle\\n\\tld\\tde,2*trisize-2\\n\\tadd\\tix,de\\t\\t; Everything is 0-based! Here we need the bytes instead of the number of elements\\n\\n\\tpush\\tix\\t\\t; Set iy to last element of penultimate row\\n\\tpop\\thl\\t\\t; Need to use hl for subtraction of number of bytes in last row\\n\\tld\\tc,b\\t\\t; Get number of bytes in c, b shall keep the number of elements\\n\\tsla\\tc\\t\\t; bytes = 2 * elements\\n\\tld\\td,0\\t\\t; Use de for 16 bit subtraction of c from hl\\n\\tld\\te,c\\n\\tsbc\\thl,de\\t\\t\\n\\tpush\\thl\\t\\t; and then move it to iy via stack, no direct load\\n\\tpop\\tiy\\n\\n\\tdec\\tb\\t\\t; b runs over the penultimate row, which has 1 element less\\n\\tld\\tc,b\\t\\t; c is the row counter, b the element counter - each row contains as many elements as is its number\\n\\nloop:\\t\\t\\t\\t; Loop entry point is the same for inner and outer loop\\n\\tpush\\tbc\\t\\t; Save bc to stack, it will hold the maximum of right and left successor\\n\\tld\\tl,(ix)\\t\\t; Right successor of iy\\n\\tld\\th,(ix+1)\\n\\tld\\te,(ix-2)\\t; Left successor of iy\\n\\tld\\td,(ix-1)\\n\\tpush\\thl\\t\\t; Save hl, it is modified by the comparison/subtraction\\n\\tor\\ta\\t\\t; Clear carry flag\\n\\tsbc\\thl,de\\t\\t; 16 bit comparison by subtracting left from right\\n\\tpop\\thl\\t\\t; Restore hl\\n\\tjr\\tc,delarger\\t; If carry, then the left successor in de is larger\\n\\n\\tpush\\thl\\t\\t; hl is larger, move it to bc\\n\\tpop\\tbc\\n\\tjr\\taddmax\\n\\ndelarger:\\n\\tpush\\tde\\t\\t; de is larger, move it to bc\\n\\tpop\\tbc\\n\\naddmax:\\n\\tld\\tl,(iy)\\t\\t; Get \\\"parent\\\" element into hl and add maximum of its two successors\\n\\tld\\th,(iy+1)\\n\\tadd\\thl,bc\\t\\t; Add maximum, which is in bc\\n\\tld\\t(iy),l\\t\\t; Store hl back to triangle\\n\\tld\\t(iy+1),h\\n\\tpop\\tbc\\t\\t; Restore bc with loop counters\\n\\n\\tdec\\tix\\t\\t; Decrement element pointers (by 2 bytes)\\n\\tdec\\tix\\n\\tdec\\tiy\\n\\tdec\\tiy\\n\\n\\tdec\\tb\\t\\t; Decrement element counter\\n\\tjp\\tnz,loop\\t\\t; Check if penultimate row finished - this is the inner loop\\n\\n\\tld\\tb,c\\t\\t; Restore inner loop counter, check if more rows above current\\n\\tdec\\tix\\t\\t; Decrement element pointer of row below again (by 2 bytes), skip leftmost element\\n\\tdec\\tix\\n\\tdec\\tb\\t\\t; Decrement loop counters, first the element counter\\n\\tdec\\tc\\t\\t; ...then the row counter\\n\\tjp\\tnz,loop\\t\\t; Check if triangle finished - this is the outer loop\\n\\n\\tld\\thl,(triangle)\\t; Root element now contains maximum sum\\n\\tld\\tix,buffer\\t; Set ix to output buffer\\n\\tcall\\tdispHL\\t\\t; Create decimal representation\\n\\n\\tsetdel\\tnul\\t\\t; Set string delimiter to 00h\\n\\tprint\\tbuffer\\t\\t; Display result\\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; Helper routines - notice that the Z80 does not have a divide instruction\\n\\t; Notice further that CP/M does not have any support for pretty-printing\\n\\t; formatted numbers and stuff like that. So we have to do all this by hand...\\n\\t;\\n\\n\\t;\\n\\t; Converts the value (unsigned int) in register hl to its decimal representation\\n\\t; Register ix has memory address of target for converted value\\n\\t; String is terminated with nul character (\\\\0)\\n\\t;\\n\\ndispHL:\\n\\tpushall\\n\\tld\\tb,1\\t\\t; Flag for leading '0'\\n\\tirp\\tx,<-10000,-1000,-100,-10,-1>\\n\\tld\\tde,x\\t\\t; Subtract powers of 10 and determine digit\\n\\tcall\\tcalcdig\\n\\tendm\\n\\n\\tld\\ta,nul\\t\\t; Terminate result string with nul\\n\\tld\\t(ix+0),a\\n\\n\\tpopall\\n\\tret\\t\\t\\t; End of conversion routine\\n\\ncalcdig:\\n\\tld\\ta,cnull-1\\t; Determine the digit character\\nincrdig:\\n\\tinc\\ta\\t\\t; Start with '0'\\n\\tadd\\thl,de\\t\\t; As long as subtraction is possible, increment digit character\\n\\tjr\\tc,incrdig\\n\\n\\tsbc\\thl,de\\t\\t; If negative, undo last subtraction and continue with remainder\\n\\tcp\\tcnull\\t\\t; Check for leading '0', these are ignored\\n\\tjr\\tnz,adddig\\n\\tbit\\t0,b\\t\\t; Use bit instruction for check if flag set, register a contains digit\\n\\tret\\tnz\\t\\t; If '0' found and flag set, it is a leading '0' and we return\\nadddig:\\n\\tld\\tb,0\\t\\t; Reset flag for leading '0', we are now outputting digits\\n\\tld\\t(ix+0),a\\t; Store character in memory and set ix to next location\\n\\tinc\\tix\\n\\n\\tret\\t\\t\\t; End of conversion helper routine\\n\\n\\t;\\n\\t; ================\\n\\t; Data definitions\\n\\t; ================\\n\\t;\\n\\n\\tdseg\\n\\ncrlf:\\tdefb\\tcr,lf,nul\\t; Generic newline\\nbuffer:\\tdefs\\t10\\t\\t; Buffer for conversion of number to text\\n\\ntriangle:\\t\\t\\t; Triangle data, number of elements is \\\"trisize\\\" equ further above\\n\\tdefw\\t55\\n\\tdefw\\t94\\n\\tdefw\\t48\\n\\tdefw\\t95\\n\\tdefw\\t30\\n\\tdefw\\t96\\n\\tdefw\\t77\\n\\tdefw\\t71\\n\\tdefw\\t26\\n\\tdefw\\t67\\n\\tdefw\\t97\\n\\tdefw\\t13\\n\\tdefw\\t76\\n\\tdefw\\t38\\n\\tdefw\\t45\\n\\tdefw\\t07\\n\\tdefw\\t36\\n\\tdefw\\t79\\n\\tdefw\\t16\\n\\tdefw\\t37\\n\\tdefw\\t68\\n\\tdefw\\t48\\n\\tdefw\\t07\\n\\tdefw\\t09\\n\\tdefw\\t18\\n\\tdefw\\t70\\n\\tdefw\\t26\\n\\tdefw\\t06\\n\\tdefw\\t18\\n\\tdefw\\t72\\n\\tdefw\\t79\\n\\tdefw\\t46\\n\\tdefw\\t59\\n\\tdefw\\t79\\n\\tdefw\\t29\\n\\tdefw\\t90\\n\\tdefw\\t20\\n\\tdefw\\t76\\n\\tdefw\\t87\\n\\tdefw\\t11\\n\\tdefw\\t32\\n\\tdefw\\t07\\n\\tdefw\\t07\\n\\tdefw\\t49\\n\\tdefw\\t18\\n\\tdefw\\t27\\n\\tdefw\\t83\\n\\tdefw\\t58\\n\\tdefw\\t35\\n\\tdefw\\t71\\n\\tdefw\\t11\\n\\tdefw\\t25\\n\\tdefw\\t57\\n\\tdefw\\t29\\n\\tdefw\\t85\\n\\tdefw\\t14\\n\\tdefw\\t64\\n\\tdefw\\t36\\n\\tdefw\\t96\\n\\tdefw\\t27\\n\\tdefw\\t11\\n\\tdefw\\t58\\n\\tdefw\\t56\\n\\tdefw\\t92\\n\\tdefw\\t18\\n\\tdefw\\t55\\n\\tdefw\\t02\\n\\tdefw\\t90\\n\\tdefw\\t03\\n\\tdefw\\t60\\n\\tdefw\\t48\\n\\tdefw\\t49\\n\\tdefw\\t41\\n\\tdefw\\t46\\n\\tdefw\\t33\\n\\tdefw\\t36\\n\\tdefw\\t47\\n\\tdefw\\t23\\n\\tdefw\\t92\\n\\tdefw\\t50\\n\\tdefw\\t48\\n\\tdefw\\t02\\n\\tdefw\\t36\\n\\tdefw\\t59\\n\\tdefw\\t42\\n\\tdefw\\t79\\n\\tdefw\\t72\\n\\tdefw\\t20\\n\\tdefw\\t82\\n\\tdefw\\t77\\n\\tdefw\\t42\\n\\tdefw\\t56\\n\\tdefw\\t78\\n\\tdefw\\t38\\n\\tdefw\\t80\\n\\tdefw\\t39\\n\\tdefw\\t75\\n\\tdefw\\t02\\n\\tdefw\\t71\\n\\tdefw\\t66\\n\\tdefw\\t66\\n\\tdefw\\t01\\n\\tdefw\\t03\\n\\tdefw\\t55\\n\\tdefw\\t72\\n\\tdefw\\t44\\n\\tdefw\\t25\\n\\tdefw\\t67\\n\\tdefw\\t84\\n\\tdefw\\t71\\n\\tdefw\\t67\\n\\tdefw\\t11\\n\\tdefw\\t61\\n\\tdefw\\t40\\n\\tdefw\\t57\\n\\tdefw\\t58\\n\\tdefw\\t89\\n\\tdefw\\t40\\n\\tdefw\\t56\\n\\tdefw\\t36\\n\\tdefw\\t85\\n\\tdefw\\t32\\n\\tdefw\\t25\\n\\tdefw\\t85\\n\\tdefw\\t57\\n\\tdefw\\t48\\n\\tdefw\\t84\\n\\tdefw\\t35\\n\\tdefw\\t47\\n\\tdefw\\t62\\n\\tdefw\\t17\\n\\tdefw\\t01\\n\\tdefw\\t01\\n\\tdefw\\t99\\n\\tdefw\\t89\\n\\tdefw\\t52\\n\\tdefw\\t06\\n\\tdefw\\t71\\n\\tdefw\\t28\\n\\tdefw\\t75\\n\\tdefw\\t94\\n\\tdefw\\t48\\n\\tdefw\\t37\\n\\tdefw\\t10\\n\\tdefw\\t23\\n\\tdefw\\t51\\n\\tdefw\\t06\\n\\tdefw\\t48\\n\\tdefw\\t53\\n\\tdefw\\t18\\n\\tdefw\\t74\\n\\tdefw\\t98\\n\\tdefw\\t15\\n\\tdefw\\t27\\n\\tdefw\\t02\\n\\tdefw\\t92\\n\\tdefw\\t23\\n\\tdefw\\t08\\n\\tdefw\\t71\\n\\tdefw\\t76\\n\\tdefw\\t84\\n\\tdefw\\t15\\n\\tdefw\\t52\\n\\tdefw\\t92\\n\\tdefw\\t63\\n\\tdefw\\t81\\n\\tdefw\\t10\\n\\tdefw\\t44\\n\\tdefw\\t10\\n\\tdefw\\t69\\n\\tdefw\\t93\\n\",\n \"language\": \"Z80-Assembly\"\n },\n {\n \"code\": \"tri:=File(\\\"triangle.txt\\\").pump(List,fcn(s){ s.strip().split(\\\" \\\").apply(\\\"toInt\\\") }).copy();\\nwhile(tri.len()>1){\\n t0:=tri.pop();\\n t1:=tri.pop();\\n tri.append( [[(it); t1.enumerate();\\n\\t'wrap([(i,t)]){ t + t0[i].max(t0[i+1]) }]])\\n}\\ntri[0][0].println();\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"data:=File(\\\"triangle.txt\\\").pump(List,fcn(s){ s.strip().split(\\\" \\\").apply(\\\"toInt\\\") });\\nfcn f(x,y,z){ x + y.max(z) }\\nfcn g(xs,ys){ Utils.zipWith(f,ys,xs,xs[1,*]); }\\ndata.reverse().reduce(g)[0].println();\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"lines:=File(\\\"triangle.txt\\\").pump(List,fcn(s){ s.strip().split(\\\" \\\").apply(\\\"toInt\\\") });\\nd:=lines[-1].copy();\\nforeach row in ([lines.len()-2..0,-1]){\\n d1:=d[1,*];\\n l :=d[0];\\n foreach i,u in (lines[row].enumerate()){\\n d[i] = u + l.max(r:=d1[i]);\\n l = r;\\n }\\n}\\nprintln(d[0]);\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Maximum-triangle-path-sum"}}},{"rowIdx":474,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Mayan_numerals\nnote: Mayan numerals\n","language":"00-META"},{"code":";Task:\nPresent numbers using the Mayan numbering system (displaying the Mayan numerals in a cartouche).\n\n\n;Mayan numbers:\nNormally, Mayan <u>numbers</u> are written vertically (top─to─bottom) with the most significant\nnumeral at the top (in the sense that decimal numbers are written left─to─right with the most significant\ndigit at the left). This task will be using a left─to─right (horizontal) format, mostly for familiarity and\nreadability, and to conserve screen space (when showing the output) on this task page.\n\n\n;Mayan numerals:\nMayan <u>numerals</u> (a base─20 \"digit\" or glyph) are written in two orientations, this\ntask will be using the \"vertical\" format (as displayed below). Using the vertical format makes\nit much easier to draw/construct the Mayan numerals (glyphs) with simple dots ('''.''')\nand hyphen ('''-'''); (however, round bullets ('''•''') and long dashes ('''─''')\nmake a better presentation on Rosetta Code).\n\n\nFurthermore, each Mayan numeral (for this task) is to be displayed as a\ncartouche (enclosed in a box) to make it easier to parse (read); the box may be\ndrawn with any suitable (ASCII or Unicode) characters that are presentable/visible in all web browsers.\n\n\n;Mayan numerals added to Unicode\nMayan numerals (glyphs) were added to the Unicode Standard in June of 2018 (this corresponds with\nversion 11.0). But since most web browsers don't support them at this time, this Rosetta Code\ntask will be constructing the glyphs with \"simple\" characters and/or ASCII art.\n\n\n;The \"zero\" glyph:\nThe Mayan numbering system has the concept of '''zero''', and should be shown by a glyph that represents\nan upside─down (sea) shell, or an egg. The Greek letter '''theta''' (<big>'''Θ'''</big>) can be\nused (which more─or─less, looks like an\negg). A ''commercial at'' symbol (<big>'''@'''</big>) could make a poor substitute.\n\n\n;Mayan glyphs (constructed):\nThe Mayan numbering system is\na [[https://en.wikipedia.org/wiki/Vigesimal vigesimal (base 20)]] positional numeral system.\n\n\n\n;The Mayan numerals (and some random numbers) shown in the ''vertical'' format would be shown as:\n\n ╔════╗ ╔════╗ ╔════╦════╗\n ║ ║ ║ ║ ║ ║ ║\n ║ ║ ║ ∙ ║ ║ ║ ║\n 1──► ║ ║ 11──► ║────║ 21──► ║ ║ ║\n ║ ∙ ║ ║────║ ║ ∙ ║ ∙ ║\n ╚════╝ ╚════╝ ╚════╩════╝\n ╔════╗ ╔════╗ ╔════╦════╗\n ║ ║ ║ ║ ║ ║ ║\n ║ ║ ║ ∙∙ ║ ║ ║ ║\n 2──► ║ ║ 12──► ║────║ 22──► ║ ║ ║\n ║ ∙∙ ║ ║────║ ║ ∙ ║ ∙∙ ║\n ╚════╝ ╚════╝ ╚════╩════╝\n ╔════╗ ╔════╗ ╔════╦════╗\n ║ ║ ║ ║ ║ ║ ║\n ║ ║ ║∙∙∙ ║ ║ ║ ║\n 3──► ║ ║ 13──► ║────║ 40──► ║ ║ ║\n ║∙∙∙ ║ ║────║ ║ ∙∙ ║ Θ ║\n ╚════╝ ╚════╝ ╚════╩════╝\n ╔════╗ ╔════╗ ╔════╦════╗\n ║ ║ ║ ║ ║ ║ ║\n ║ ║ ║∙∙∙∙║ ║ ║ ║\n 4──► ║ ║ 14──► ║────║ 80──► ║ ║ ║\n ║∙∙∙∙║ ║────║ ║∙∙∙∙║ Θ ║\n ╚════╝ ╚════╝ ╚════╩════╝\n ╔════╗ ╔════╗ ╔════╦════╗\n ║ ║ ║ ║ ║ ║ ║\n ║ ║ ║────║ ║ ║ ║\n 5──► ║ ║ 15──► ║────║ 90──► ║ ║────║\n ║────║ ║────║ ║∙∙∙∙║────║\n ╚════╝ ╚════╝ ╚════╩════╝\n ╔════╗ ╔════╗ ╔════╦════╗\n ║ ║ ║ ∙ ║ ║ ║ ║\n ║ ║ ║────║ ║ ║ ║\n 6──► ║ ∙ ║ 16──► ║────║ 100──► ║ ║ ║\n ║────║ ║────║ ║────║ Θ ║\n ╚════╝ ╚════╝ ╚════╩════╝\n ╔════╗ ╔════╗ ╔════╦════╗\n ║ ║ ║ ∙∙ ║ ║ ║ ║\n ║ ║ ║────║ ║ ║ ║\n 7──► ║ ∙∙ ║ 17──► ║────║ 200──► ║────║ ║\n ║────║ ║────║ ║────║ Θ ║\n ╚════╝ ╚════╝ ╚════╩════╝\n ╔════╗ ╔════╗ ╔════╦════╗\n ║ ║ ║∙∙∙ ║ ║ ║ ║\n ║ ║ ║────║ 300──► ║────║ ║\n 8──► ║∙∙∙ ║ 18──► ║────║ ║────║ ║\n ║────║ ║────║ ║────║ Θ ║\n ╚════╝ ╚════╝ ╚════╩════╝\n ╔════╗ ╔════╗ ╔════╦════╦════╗\n ║ ║ ║∙∙∙∙║ ║ ║ ║ ║\n ║ ║ ║────║ 400──► ║ ║ ║ ║\n 9──► ║∙∙∙∙║ 19──► ║────║ ║ ║ ║ ║\n ║────║ ║────║ ║ ∙ ║ Θ ║ Θ ║\n ╚════╝ ╚════╝ ╚════╩════╩════╝\n ╔════╗ ╔════╦════╗ ╔════╦════╦════╦════╗\n ║ ║ ║ ║ ║ ║ ║ ║ ║ ║\n ║ ║ ║ ║ ║ ║ ║ ║ ║ ║\n 10──► ║────║ 20──► ║ ║ ║ 16,000──► ║ ║ ║ ║ ║\n ║────║ ║ ∙ ║ Θ ║ ║ ∙∙ ║ Θ ║ Θ ║ Θ ║\n ╚════╝ ╚════╩════╝ ╚════╩════╩════╩════╝\n\n\nNote that the Mayan numeral '''13''' in ''horizontal'' format would be shown as:\n\n ╔════╗\n ║ ││║\n ║ ∙││║\n 13──► ║ ∙││║ ◄─── this glyph form <u>won't</u> be used in this Rosetta Code task.\n ║ ∙││║\n ╚════╝\n\n\n\nOther forms of cartouches (boxes) can be used for this task.\n\n\n;Task requirements:\n:* convert the following decimal numbers to Mayan numbers:\n:::* 4,005\n:::* 8,017\n:::* 326,205\n:::* 886,205\n:* show a <u>unique</u> ''interesting/pretty/unusual/intriguing/odd/amusing/weird'' Mayan number\n:* show all output here\n\n\n;Related tasks:\n:* [[Roman numerals/Encode]] ─── convert numeric values into Roman numerals\n:* [[Roman numerals/Decode]] ─── convert Roman numerals into Arabic numbers\n\n\n;See also:\n:* The Wikipedia entry: [[https://en.wikipedia.org/wiki/Maya_numerals Mayan numerals]]\n<br><br>\n\n","language":"00-TASK"},{"code":"-V\n UL = ‘╔’\n UC = ‘╦’\n UR = ‘╗’\n LL = ‘╚’\n LC = ‘╩’\n LR = ‘╝’\n HB = ‘═’\n VB = ‘║’\n\n Mayan = [‘ ’,\n ‘ ∙ ’,\n ‘ ∙∙ ’,\n ‘∙∙∙ ’,\n ‘∙∙∙∙’]\n\n M0 = ‘ @ ’\n M5 = ‘────’\n\nF toBase20(=n)\n V result = [n % 20]\n n I/= 20\n L n != 0\n result [+]= n % 20\n n I/= 20\n R reversed(result)\n\nF toMayanNumeral(=d)\n V result = [Mayan[0], Mayan[0], Mayan[0], Mayan[0]]\n I d == 0\n result[3] = :M0\n R result\n\n L(i) (3..0).step(-1)\n I d >= 5\n result[i] = :M5\n d -= 5\n E\n result[i] = Mayan[d]\n L.break\n\n R result\n\nF draw(mayans)\n V idx = mayans.len - 1\n\n print(:UL, end' ‘’)\n L(i) 0 .. idx\n print(:HB * 4, end' ‘’)\n I i < idx\n print(:UC, end' ‘’)\n E\n print(:UR)\n\n L(i) 1..4\n print(:VB, end' ‘’)\n L(j) 0 .. idx\n print(mayans[j][i - 1]‘’:VB, end' ‘’)\n print()\n\n print(:LL, end' ‘’)\n L(i) 0 .. idx\n print(:HB * 4, end' ‘’)\n I i < idx\n print(:LC, end' ‘’)\n E\n print(:LR)\n\nL(n) [4005, 8017, 326205, 886205, 1081439556]\n print(‘Converting ’n‘ to Mayan:’)\n V digits = toBase20(n)\n V mayans = digits.map(d -> toMayanNumeral(d))\n draw(mayans)\n print()\n","language":"11l"},{"code":"putch:\tequ\t2\nputs:\tequ\t9\n\torg\t100h\n\tlxi\th,80h\t; Get length of command line input\n\tmov\ta,m\n\tcpi\t2\n\trc\t\t; If no input, stop\n\tadd\tl\n\tmov\tl,a\t; Go to end of numbers\n\tmov\tc,l\t; C = end of numbers\n\tinx\th\n\tmvi\tm,0FFh\t; Terminate digit sequence with FFh\n\tdcx\th\nsub0:\tmov\ta,m\n\tcpi\t32\t; When space reached, we're at the beginning\n\tjz\tto20\n\tsui\t'0'\t; Subtract '0' from each digit and make sure\n\trc\t\t; they are all valid\n\tcpi\t10\t\n\trnc\t\n\tmov\tm,a\n\tdcx \th\n\tjmp\tsub0\nto20:\tmov\ta,c\t; Calculate amount of numbers\n\tsui\t81h\n\tmov\tc,a\nto20l:\tmov\te,c\t; E = digit counter\n\tmvi\tl,82h\t; Start at beginning\ndiv2:\tmov\ta,m\t; Grab digit\n\tjnc\t$+5\t; If carry, add ten\n\tadi\t10\n\trar\t\t; Divide by two\n\tmov\tm,a\t; Write back\n\tinx\th\n\tdcr\te\n\tjnz\tdiv2\t; Keep going\n\tdcx\th\t; For the last number we want\n\tral\t\t; to keep the carry\n\tmov\tm,a\t; This digit is now base-20\n\tdcr\tc\t; One fewer digit left to do\n\tjnz\tto20l\n\tmvi\tl,81h\t; Find start and end of numbers\nstart:\tinx\th\n\tmov\ta,m\n\tana\ta\n\tjz\tstart\n\tmov\tb,l\t; B = start\n\tinr\ta\t; If number is zero, output nothing\n\trz\nnend:\tinx\th\n\tmov\ta,m\n\tinr\ta\n\tjnz\tnend\n\tmov\ta,l\t; A = end\n\tsub\tb\n\tmov\tc,a\t; C = amount\n\tcall\tedge\n\tmvi\td,3\t; D=line\nline:\tpush\tb\t; Save start and amount\n\tmov\tl,b\t; HL = first digit\n\tmvi\th,0\nnum:\tcall\tdline\t; Print line for digit\n\tinx\th\t; Next digit\n\tdcr\tc\n\tjnz\tnum\n\tpush\td\t; Save line number\n\tlxi\td,dn\t; Print end of line\n\tcall\tprint\n\tpop \td\t; Restore variables\n\tpop \tb\n\tdcr\td\n\tjp\tline\t; Print next line\nedge:\tpush\tb\t; Print edge (top or bottom)\nedge_l:\tpush\tb\t; Keep counter\n\tlxi\td,edges\t\n\tcall \tprint\n\tpop\tb\n\tdcr \tc\n\tjnz\tedge_l\n\tlxi\td,edgen\t\n\tcall\tprint\n\tpop\tb\n\tret\t\ndline:\tpush\th\t; Print line for digit (D'th from bottom)\n\tpush\td\n\tpush\tb\n\tmov\ta,m\n\tora\td\t; Line and number both 0?\n\tjnz\t$+9\n\tlxi\td,dz\t; Then print line with @\n\tjmp\tdnum\n\tmov\ta,d\t; 5 * line\n\tadd\ta\n\tadd\ta\n\tadd\td\n\tmov\te,a\n\tmov\ta,m\t; A -= 5 * line\n\tsub\te\n\tlxi\td,d0\t; If <0, empty\n\tjm\tdnum\n\tcpi\t5\n\tjc\t$+9\n\tlxi\td,d5\t; If >=5, ----\n\tjmp\tdnum\n\tadd\ta\t; Otherwise, d[n]\n\tmov\tl,a\n\tadd\ta\n\tadd\tl\n\tmov\tl,a\n\tmvi\th,0\n\tdad\td\n\txchg\ndnum:\tcall\tprint\n\tpop\tb\n\tpop\td\n\tpop\th\n\tret\t\t\nprint:\tmvi\tc,puts\n\tjmp\t5\nedges:\tdb\t'+----$'\nedgen:\tdb\t'+',13,10,'$'\ndz:\tdb\t'| @ $'\nd0:\tdb\t'| $| . $| .. $|... $|....$'\nd5:\tdb\t'|----$'\ndn:\tdb\t'|',13,10,'$'\n","language":"8080-Assembly"},{"code":"#include <basico.h>\n\nalgoritmo\n\n muestra=\"\"\n obtener total argumentos\n cuando ' sea distinto a( 2 ) '{ terminar }\n obtener parámetro alfanumérico (2), guardar en 'muestra'\n\n lsimb={}, '\" \",\" . \",\" .. \",\"... \",\"....\"'#(utf8(\"────\")), enlistar en 'lsimb'\n\n largo=0, #( largo = len(muestra))\n sdígitos={}, separar( muestra, sdígitos, \"\")\n ndígitos=0, #( ndígitos = number(sdígitos) )\n\n m=0, t=0\n #( m = largo-1)\n\n // convertir dígitos a base 20,la base de los mayas:\n iterar para( j=m, #(j>=1), --j )\n iterar para( i=1, #(i<=j), ++i )\n bit.and( #(ndígitos[i]), 1 ), por '10',\n guardar en 't'\n #( ndígitos[i+1] += t )\n #( ndígitos[i] = int(ndígitos[i]/2) )\n siguiente\n siguiente\n\n s=1\n iterar mientras ( #( ndígitos[s]==0 && s<largo) )\n ++s\n reiterar\n\n\n // armar los cartuchos:\n imprimir ( #(utf8(\"╔═════\")),#(replicate( utf8(\"═════\"), largo-s) ), #(utf8(\"═╗\")), NL,\\\n #(utf8(\"║┌────\")),#(replicate( utf8(\"┬────\"), largo-s) ), #(utf8(\"┐║\")), NL )\n\n n=0\n iterar para ( l=3, #(l>=0), --l )\n\n imprimir (#(utf8(\"║\")))\n iterar para ( i=s, #(i<=largo), ++i )\n si ( bit.or ( #(ndígitos[i]), l ), es igual a '0' )\n imprimir ( #(utf8(\"│ Θ \")) )\n\n sino\n guardar ' #(ndígitos[i]-5*l) ' en 'n'\n si ( #(n>5) )\n n=5\n sino si ( n, es negativo? )\n n=0\n fin si\n imprimir( #(utf8(\"│\")), #(lsimb[n+1]) )\n\n fin si\n siguiente\n imprimir (#(utf8(\"│║\")),NL)\n\n siguiente\n\n imprimir ( #(utf8(\"║└────\")),#(replicate( utf8(\"┴────\"), largo-s) ), #(utf8(\"┘║\")), NL,\\\n #(utf8(\"╚═════\")),#(replicate( utf8(\"═════\"), largo-s) ), #(utf8(\"═╝\")), NL )\n saltar\n\nterminar\n","language":"Amazing-Hopper"},{"code":"mayan←{\n ds←6 4⍴' . .. ... ....────'\n d←{ ⍵=0:4 4⍴¯14↑'Θ'\n ds[1+5⌊0⌈⍵-15 10 5 0;]\n }¨20(⊥⍣¯1)⍵\n top←'╔',(1↓∊(≢d)⍴⊂'╦════'),'╗'\n btm←'╚',(1↓∊(≢d)⍴⊂'╩════'),'╝'\n top⍪((⊃,/'║',¨d),'║')⍪btm\n}\n","language":"APL"},{"code":"use AppleScript version \"2.4\"\nuse framework \"Foundation\"\nuse scripting additions\n\n-- MAYAN NUMBERS ------------------------------------------\n\n-- mayanNumber:: Int -> [[String]]\non mayanNumber(n)\n showIntAtBase(20, my mayanDigit, n, {})\nend mayanNumber\n\n-- mayanDigit :: Int -> String\non mayanDigit(n)\n if 0 < n then\n set r to n mod 5\n bool({}, {concat(replicate(r, \"●\"))}, 0 < r) & ¬\n replicate(n div 5, \"━━\")\n else\n {\"Θ\"}\n end if\nend mayanDigit\n\n-- mayanFrame :: Int -> String\non mayanFrame(n)\n \"Mayan \" & (n as string) & \":\\n\" & wikiTable({|class|:¬\n \"wikitable\", colwidth:¬\n \"3em\", cell:¬\n \"vertical-align:bottom;\", |style|:¬\n \"text-align:center;background-color:#F0EDDE;\" & ¬\n \"color:#605B4B;border:2px solid silver\"})'s ¬\n |λ|({map(intercalateS(\"<br>\"), mayanNumber(n))}) & \"\\n\"\nend mayanFrame\n\n-- TEST ---------------------------------------------------\n\non run\n set str to unlines(map(mayanFrame, ¬\n {4005, 8017, 326205, 886205, 2978480}))\n\n set the clipboard to (str)\n return str\nend run\n\n-- GENERIC ------------------------------------------------\n\n-- Just :: a -> Maybe a\non Just(x)\n {type:\"Maybe\", Nothing:false, Just:x}\nend Just\n\n-- Nothing :: Maybe a\non Nothing()\n {type:\"Maybe\", Nothing:true}\nend Nothing\n\n-- Tuple (,) :: a -> b -> (a, b)\non Tuple(a, b)\n {type:\"Tuple\", |1|:a, |2|:b, length:2}\nend Tuple\n\n-- bool :: a -> a -> Bool -> a\non bool(f, t, p)\n if p then\n t\n else\n f\n end if\nend bool\n\n-- concat :: [[a]] -> [a]\n-- concat :: [String] -> String\non concat(xs)\n set lng to length of xs\n if 0 < lng and string is class of (item 1 of xs) then\n set acc to \"\"\n else\n set acc to {}\n end if\n repeat with i from 1 to lng\n set acc to acc & item i of xs\n end repeat\n acc\nend concat\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-- intercalateS :: String -> [String] -> String\non intercalateS(sep)\n script\n on |λ|(xs)\n set {dlm, my text item delimiters} to {my text item delimiters, sep}\n set s to xs as text\n set my text item delimiters to dlm\n return s\n end |λ|\n end script\nend intercalateS\n\n-- lookupDict :: a -> Dict -> Maybe b\non lookupDict(k, dct)\n set ca to current application\n set v to (ca's NSDictionary's dictionaryWithDictionary:dct)'s objectForKey:k\n if missing value ≠ v then\n Just(item 1 of ((ca's NSArray's arrayWithObject:v) as list))\n else\n Nothing()\n end if\nend lookupDict\n\n-- Lift 2nd class handler function into 1st class script wrapper\n-- mReturn :: First-class m => (a -> b) -> m (a -> b)\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-- 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-- | The 'maybe' function takes a default value, a function, and a 'Maybe'\n-- value. If the 'Maybe' value is 'Nothing', the function returns the\n-- default value. Otherwise, it applies the function to the value inside\n-- the 'Just' and returns the result.\n-- maybe :: b -> (a -> b) -> Maybe a -> b\non maybe(v, f, mb)\n if Nothing of mb then\n v\n else\n tell mReturn(f) to |λ|(Just of mb)\n end if\nend maybe\n\n-- quotRem :: Int -> Int -> (Int, Int)\non quotRem(m, n)\n Tuple(m div n, m mod n)\nend quotRem\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-- showIntAtBase :: Int -> (Int -> [String]) -> Int -> String -> String\non showIntAtBase(base, toDigit, n, rs)\n script showIt\n property f : mReturn(toDigit)\n on |λ|(nd_, r)\n set {n, d} to ({|1|, |2|} of nd_)\n set r_ to {f's |λ|(d)} & r\n if n > 0 then\n |λ|(quotRem(n, base), r_)\n else\n r_\n end if\n end |λ|\n end script\n showIt's |λ|(quotRem(n, base), rs)\nend showIntAtBase\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-- 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-- wikiTable :: Dict -> [[String]] -> String\non wikiTable(opts)\n script ksv\n on |λ|(k)\n script\n on |λ|(s)\n script\n on |λ|(v)\n k & v & s\n end |λ|\n end script\n end |λ|\n end script\n end |λ|\n end script\n script\n on |λ|(rows)\n script boxStyle\n on |λ|(a, k)\n maybe(a, ksv's |λ|(a & k & \"=\\\"\")'s |λ|(\"\\\" \"), ¬\n lookupDict(k, opts))\n end |λ|\n end script\n script rowText\n on |λ|(row, iRow)\n script cellText\n on |λ|(cell)\n if 1 = iRow then\n set w to maybe(\"\", ksv's |λ|(\"width:\")'s |λ|(\";\"), ¬\n lookupDict(\"colwidth\", opts))\n else\n set w to \"\"\n end if\n set s to maybe(w, ksv's |λ|(w)'s |λ|(\"\"), ¬\n lookupDict(\"cell\", opts))\n if 0 < length of s then\n \"style=\\\"\" & s & \"\\\"|\" & cell\n else\n cell\n end if\n end |λ|\n end script\n intercalateS(\"\\n|\")'s |λ|(map(cellText, row))\n end |λ|\n end script\n \"{| \" & unwords(foldl(boxStyle, \"\", {\"class\", \"style\"})) & \"\\n|\" & ¬\n intercalateS(\"\\n|-\\n\")'s |λ|(map(rowText, rows)) & \"\\n|}\"\n end |λ|\n end script\nend wikiTable\n","language":"AppleScript"},{"code":"UL: \"╔\"\nUC: \"╦\"\nUR: \"╗\"\nLL: \"╚\"\nLC: \"╩\"\nLR: \"╝\"\nHB: \"═\"\nVB: \"║\"\n\nMayan: [\" \", \" ∙ \", \" ∙∙ \", \"∙∙∙ \", \"∙∙∙∙\"]\n\nM0: \" Θ \"\nM5: \"────\"\n\ntoMayan: function [digit][\n result: array.of:4 Mayan\\0\n if digit = 0 [\n result\\3: M0\n return result\n ]\n\n d: digit\n loop 3..0 'i [\n if? d >= 5 [\n result\\[i]: M5\n d: d - 5\n ]\n else [\n result\\[i]: Mayan\\[d]\n break\n ]\n ]\n return result\n]\n\ndraw: function [mayans][\n idx: dec size mayans\n\n prints UL\n\n loop 0..idx 'i [\n loop 0..3 'j [\n prints HB\n ]\n prints (i < idx)? -> UC -> UR ++ `\\n`\n ]\n\n loop 1..4 'i [\n prints VB\n loop 0..idx 'j ->\n prints mayans\\[j]\\[dec i] ++ VB\n print \"\"\n ]\n\n prints LL\n\n loop 0..idx 'i [\n loop 0..3 'j ->\n prints HB\n prints (i < idx)? -> LC -> LR ++ `\\n`\n ]\n]\n\nloop [4005, 8017, 326205, 886205, 1081439556] 'n [\n print [\"Converting\" n \"to Mayan:\"]\n digs: digits.base:20 n\n mayans: map digs => toMayan\n draw mayans\n print \"\"\n]\n","language":"Arturo"},{"code":"MayanNumerals(num){\n\tpwr:=1, obj:=[], grid:=[]\n\twhile (num // 20**pwr)\n\t\tpwr++\t\n\twhile --pwr\n\t{\n\t\tobj.Push(num // 20**pwr)\n\t\tnum := Mod(num, 20**pwr)\n\t}\n\tobj.Push(num)\n\tcols := obj.count()\n\tloop % cols\n\t{\n\t\tc := A_Index\n\t\tloop 4\n\t\t\tgrid[c, A_Index] := \" \"\n\t\tgrid[c, 4] := \" Θ \"\n\t}\n\t\n\tfor i, v in obj\n\t{\n\t\tj := 5\n\t\tloop % v//5\n\t\t{\n\t\t\tj := 5 - A_Index\n\t\t\tgrid[i, j] := \"————\"\n\t\t}\n\t\trem := \"\"\n\t\tloop % Mod(v, 5)\n\t\t\trem .= \"●\"\n\t\trem := rem = \"●\" ? \" ● \" : rem = \"●●\" ? \" ●● \" : rem = \"●●●\" ? \"●●● \" : rem\n\t\tif Mod(v, 5)\n\t\t\tgrid[i, j-1] := rem\n\t}\n\treturn grid2table(grid, cols)\n}\n\ngrid2table(grid, cols){\n\tloop, % cols-1\n\t\ttopRow .= \"════╦\", bottomRow .= \"════╩\"\n\ttopRow := \"╔\" topRow \"════╗\"\n\tbottomRow := \"╚\" bottomRow \"════╝\"\n\tloop % 4\n\t{\n\t\tr := A_Index\n\t\tloop % cols\n\t\t\tresult .= \"║\" grid[A_Index, r]\n\t\tresult .= \"║`n\"\n\t}\n\tresult := topRow \"`n\" result . bottomRow\n\treturn % result\n}\n","language":"AutoHotkey"},{"code":"for i, n in [4005, 8017, 326205, 886205, 194481]\n{\n\tx := MayanNumerals(n)\n\tGui, Font, S12, Consolas\n\tGui, Add, Text, , % n\n\tGui, Add, Text, y+0, % x\n\tGui, Show, y100\n\tMsgBox, 262180, , continue with next number?\n\tIfMsgBox, No\n\t\tExitApp\n\tGui, Destroy\n}\n","language":"AutoHotkey"},{"code":"10 DEFINT A-Z: DIM L$(5)\n15 FOR I=0 TO 5: READ L$(I): NEXT I\n20 LINE INPUT I$\n30 M=LEN(I$): DIM D(M)\n40 FOR I=1 TO M: D(I)=VAL(MID$(I$,I,1)): NEXT I\n50 FOR J=M-1 TO 1 STEP -1\n60 FOR I=1 TO J\n70 D(I+1) = D(I+1) + 10*(D(I) AND 1)\n80 D(I) = D(I)\\2\n90 NEXT I,J\n100 S=1\n110 IF D(S)=0 AND S<M THEN S=S+1: GOTO 110\n120 FOR I=S TO M: PRINT \"+----\";: NEXT I: PRINT \"+\"\n130 FOR L=3 TO 0 STEP -1\n140 FOR I=S TO M\n150 IF (D(I) OR L)=0 THEN PRINT \"| @ \";: GOTO 180\n160 N=D(I)-5*L: IF N>5 THEN N=5 ELSE IF N<0 THEN N=0\n170 PRINT \"|\";L$(N);\n180 NEXT I\n190 PRINT \"|\"\n200 NEXT L\n210 FOR I=S TO M: PRINT \"+----\";: NEXT I: PRINT \"+\"\n220 END\n230 DATA \" \",\" . \",\" .. \",\"... \",\"....\",\"----\"\n","language":"BASIC"},{"code":"get \"libhdr\"\n\nlet reads(v) be\n$( v%0 := 0\n $( let ch = rdch()\n if ch = '*N' | ch = endstreamch break\n v%0 := v%0 + 1\n v%(v%0) := ch\n $) repeat\n$)\n\nlet digits(v) = valof\n$( for i=1 to v%0\n $( unless '0' <= v%i <= '9' resultis false\n v%i := v%i - '0'\n $)\n resultis true\n$)\n\nlet base20(v) be\n$( let i = ?\n for j=v%0-1 to 1 by -1\n for i=1 to j\n $( v%(i+1) := v%(i+1) + 10*(v%i & 1)\n v%i := v%i >> 1\n $)\n i := 1\n while v%i=0 & i<v%0 do i := i+1\n for j=i to v%0 do v%(j-i+1) := v%j\n v%0 := v%0-i+1\n$)\n\nlet mayan(v) be\n$( let border(n) be\n $( for i=1 to n do writes(\"+----\")\n writes(\"+*N\")\n $)\n let part(num, line) be\n test num=0 do\n writes(line=0 -> \" @ \", \" \")\n or\n $( num := num - line*5\n writes(num<=0 -> \" \",\n num =1 -> \" . \",\n num =2 -> \" .. \",\n num =3 -> \"... \",\n num =4 -> \"....\",\n \"----\")\n $)\n border(v%0)\n for l=3 to 0 by -1\n $( for d=1 to v%0\n $( wrch('|')\n part(v%d, l)\n $)\n writes(\"|*N\")\n $)\n border(v%0)\n$)\n\nlet start() be\n$( let v = vec 1+255/BYTESPERWORD\n $( writes(\"Number? \")\n reads(v)\n if v%0=0 finish\n unless digits(v) loop\n base20(v)\n mayan(v)\n $) repeat\n$)\n","language":"BCPL"},{"code":"#include <stdio.h>\n#include <string.h>\n#include <stdint.h>\n#include <stdlib.h>\n\n#define MAX(x,y) ((x) > (y) ? (x) : (y))\n#define MIN(x,y) ((x) < (y) ? (x) : (y))\n\n/* Find base-20 digits. */\nsize_t base20(unsigned int n, uint8_t *out) {\n /* generate digits */\n uint8_t *start = out;\n do {*out++ = n % 20;} while (n /= 20);\n size_t length = out - start;\n\n /* put digits in high-endian order */\n while (out > start) {\n uint8_t x = *--out;\n *out = *start;\n *start++ = x;\n }\n return length;\n}\n\n/* Write a Mayan digit */\nvoid make_digit(int n, char *place, size_t line_length) {\n static const char *parts[] = {\" \",\" . \",\" .. \",\"... \",\"....\",\"----\"};\n int i;\n\n /* write 4-part digit */\n for (i=4; i>0; i--, n -= 5)\n memcpy(place + i*line_length, parts[MAX(0, MIN(5, n))], 4);\n\n /* if digit was 0 we should put '@' in 2nd position of last line */\n if (n == -20) place[4 * line_length + 1] = '@';\n}\n\n/* Make a Mayan numeral */\nchar *mayan(unsigned int n) {\n if (n == 0) return NULL;\n\n uint8_t digits[15]; /* 2**64 is 15 Mayan digits long */\n size_t n_digits = base20(n, digits);\n\n /* a digit is 4 chars wide, plus N+1 divider lines, plus a newline\n makes for a length of 5*n+2 */\n size_t line_length = n_digits*5 + 2;\n\n /* we need 6 lines - four for the digits, plus top and bottom row */\n char *str = malloc(line_length * 6 + 1);\n if (str == NULL) return NULL;\n str[line_length * 6] = 0;\n\n /* make the cartouche divider lines */\n char *ptr;\n unsigned int i;\n /* top and bottom row */\n for (ptr=str, i=0; i<line_length; i+=5, ptr+=5)\n memcpy(ptr, \"+----\", 5);\n memcpy(ptr-5, \"+\\n\", 2);\n memcpy(str+5*line_length, str, line_length);\n /* middle rows */\n for (ptr=str+line_length, i=0; i<line_length; i+=5, ptr+=5)\n memcpy(ptr, \"| \", 5);\n memcpy(ptr-5, \"|\\n\", 2);\n memcpy(str+2*line_length, str+line_length, line_length);\n memcpy(str+3*line_length, str+line_length, 2*line_length);\n\n /* copy in the digits */\n for (i=0; i<n_digits; i++)\n make_digit(digits[i], str+1+5*i, line_length);\n\n return str;\n}\n\nint main(int argc, char **argv) {\n if (argc != 2) {\n fprintf(stderr, \"usage: mayan <number>\\n\");\n return 1;\n }\n int i = atoi(argv[1]);\n if (i <= 0) {\n fprintf(stderr, \"number must be positive\\n\");\n return 1;\n }\n char *m = mayan(i);\n printf(\"%s\",m);\n free(m);\n return 0;\n}\n","language":"C"},{"code":"#include <algorithm>\n#include <cstdint>\n#include <iostream>\n#include <string>\n#include <unordered_map>\n#include <vector>\n\nconst std::vector<std::string> MAYAN_DIGITS = { \" Θ \", \" ∙ \", \" ∙∙ \", \"∙∙∙ \", \"∙∙∙∙\", \"────\" };\nconst std::string BLANK = \" \";\n\nstd::unordered_map<std::string, std::string> BORDER { { \"horizontal_beam\", \"═\" }, { \"vertical_beam\", \"║\" },\n\t{ \"lower_left\", \"╚\" }, { \"lower_central\", \"╩\" }, { \"lower_right\", \"╝\" },\n\t{ \"upper_left\", \"╔\" }, { \"upper_central\", \"╦\" }, { \"upper_right\", \"╗\" }\t};\n\nstd::vector<int32_t> to_base20(const int32_t& number) {\n\tstd::vector<int32_t> result;\n\tresult.emplace_back(number % 20);\n\tint32_t n = number / 20;\n\twhile ( n != 0 ) {\n\t\tresult.emplace_back(n % 20);\n\t\tn /= 20;\n\t}\n\tstd::reverse(result.begin(), result.end());\n\treturn result;\n}\n\nstd::vector<std::string> to_mayan_numeral(int32_t digit) {\n\tstd::vector<std::string> result(4, BLANK);\n\tif ( digit == 0 ) {\n\t\tresult[3] = MAYAN_DIGITS[0];\n\t\treturn result;\n\t}\n\n\tfor ( int32_t i = 3; i >= 0; --i ) {\n\t\tif ( digit >= 5 ) {\n\t\t\tresult[i] = MAYAN_DIGITS[5];\n\t\t\tdigit -= 5;\n\t\t} else {\n\t\t\tresult[i] = ( digit == 0 ) ? BLANK : MAYAN_DIGITS[digit];\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn result;\n}\n\nvoid display(const std::vector<std::vector<std::string>>& numerals) {\n\t\tconst int32_t index = numerals.size() - 1;\n\n\t\tstd::cout << BORDER[\"upper_left\"];\n\t\tfor ( int32_t i = 0; i <= index; ++i ) {\n\t\t\tfor ( int32_t j = 0; j <= 3; ++j ) {\n\t\t\t\tstd::cout << BORDER[\"horizontal_beam\"];\n\t\t\t}\n\t\t\tif ( i < index ) {\n\t\t\t\tstd::cout << BORDER[\"upper_central\"];\n\t\t\t} else {\n\t\t\t\tstd::cout << BORDER[\"upper_right\"] << std::endl;\n\t\t\t}\n\t\t}\n\n\t\tfor ( int32_t i = 1; i <= 4; ++i ) {\n\t\t\tstd::cout << BORDER[\"vertical_beam\"];\n\t\t\tfor ( int32_t j = 0; j <= index; ++j ) {\n\t\t\t\tstd::cout << numerals[j][i - 1] + BORDER[\"vertical_beam\"];\n\t\t\t}\n\t\t\tstd::cout << std::endl;\n\t\t}\n\n\t\tstd::cout << BORDER[\"lower_left\"];\n\t\tfor ( int32_t i = 0; i <= index; ++i ) {\n\t\t\tfor ( int32_t j = 0; j <= 3; ++j ) {\n\t\t\t\tstd::cout << BORDER[\"horizontal_beam\"];\n\t\t\t}\n\t\t\tif ( i < index ) {\n\t\t\t\tstd::cout << BORDER[\"lower_central\"];\n\t\t\t} else {\n\t\t\t\tstd::cout << BORDER[\"lower_right\"] << std::endl;\n\t\t\t}\n\t\t}\n\t}\n\nint main() {\n\tfor ( const int32_t& base10 : { 4'005, 8'017, 326'205, 886'205, 1'081'439'556 } ) {\n\t\tstd::cout << \"Base 10 number, \" << base10 << \" to Mayan:\" << std::endl;\n\t\tstd::vector<int32_t> digits = to_base20(base10);\n\t\tstd::vector<std::vector<std::string>> mayans;\n\t\tfor ( const int32_t& digit : digits ) {\n\t\t\tstd::vector<std::string> mayan = to_mayan_numeral(digit);\n\t\t\tmayans.push_back(mayan);\n\t\t}\n\t\tdisplay(mayans);\n\t\tstd::cout << std::endl;\n\t}\n}\n","language":"C++"},{"code":"% This program must be linked with PCLU's \"misc.lib\" and \"useful.lib\"\n\nbase20 = proc (n: bigint) returns (sequence[int])\n own zero: bigint := bigint$i2bi(0)\n own twenty: bigint := bigint$i2bi(20)\n if n=zero then return(sequence[int]$[0]) end\n\n digits: array[int] := array[int]$[]\n while n>zero do\n array[int]$addl(digits, bigint$bi2i(n//twenty))\n n := n/twenty\n end\n return(sequence[int]$a2s(digits))\nend base20\n\nmayan = proc (digits: sequence[int]) returns (string)\n own parts: array[string] := array[string]$[0:\n \" \", \" . \", \" .. \", \"... \", \"....\", \"----\"\n ]\n % generate edges\n edge: stream := stream$create_output()\n for i: int in int$from_to(1, sequence[int]$size(digits)) do\n stream$puts(edge, \"+----\")\n end\n stream$putl(edge, \"+\")\n\n % generate digits\n lines: stream := stream$create_output()\n for i: int in int$from_to_by(15, 0, -5) do\n for d: int in sequence[int]$elements(digits) do\n p: int := d-i\n if p<0 then p:=0 end\n if p>5 then p:=5 end\n if i=0 & p=0\n then stream$puts(lines, \"| @ \")\n else stream$puts(lines, \"|\" || parts[p])\n end\n end\n stream$putl(lines, \"|\")\n end\n\n s_edge: string := stream$get_contents(edge)\n return(s_edge || stream$get_contents(lines) || s_edge)\nend mayan\n\nstart_up = proc ()\n po: stream := stream$primary_output()\n n: bigint := bigint$parse(sequence[string]$bottom(get_argv()))\n stream$puts(po, mayan(base20(n)))\nend start_up\n","language":"CLU"},{"code":"include \"cowgol.coh\";\ninclude \"argv.coh\";\n\n# convert number to base 20\nsub base20(n: uint32, out: [uint8]): (n_digits: uint8) is\n n_digits := 0;\n loop\n [out] := (n % 20) as uint8;\n n := n / 20;\n out := @next out;\n n_digits := n_digits + 1;\n if n == 0 then break; end if;\n end loop;\nend sub;\n\n# get the N'th line (from the top) for a Mayan digit\nsub digit_line(n: uint8, line: uint8): (s: [uint8]) is\n var parts: [uint8][] := {\" \",\" . \",\" .. \",\"... \",\"....\",\"----\"};\n if n == 0 then\n if line == 3 then s := \" @ \";\n else s := parts[0];\n end if;\n else\n var nn := n - 5*(3-line);\n if nn > 128 then s := parts[0];\n elseif nn > 5 then s := parts[5];\n else s := parts[nn];\n end if;\n end if;\nend sub;\n\n# print Mayan number\nsub print_mayan(n: uint32) is\n sub edge(n: uint8) is\n while n>0 loop\n print(\"+----\");\n n := n-1;\n end loop;\n print_char('+');\n print_nl();\n end sub;\n\n var digits: uint8[8]; # 8 digits is enough for 2**32\n var size := base20(n, &digits[0]);\n\n edge(size);\n var line: uint8 := 0;\n while line < 4 loop\n var d: uint8 := size-1;\n loop\n print_char('|');\n print(digit_line(digits[d], line));\n if d==0 then break; end if;\n d := d - 1;\n end loop;\n print_char('|');\n print_nl();\n line := line + 1;\n end loop;\n edge(size);\nend sub;\n\nsub Error() is\n print(\"usage: mayan <number>. number must be positive\");\n print_nl();\n ExitWithError();\nend sub;\n\n# read number from command line\nArgvInit();\nvar arg := ArgvNext();\nif arg == 0 as [uint8] then Error(); end if;\nvar n: int32;\n(n, arg) := AToI(arg);\nif n <= 0 then Error(); end if;\nprint_mayan(n as uint32);\n","language":"Cowgol"},{"code":"// Mayan numerals. Nigel Galloway: February 19th., 2021\nlet N=[|\"│ \";\"│. \";\"│.. \";\"│... \";\"│....\";\"│~~~~\"|]\nlet fN g=(fun(n)->if g=0 && n=0 then \"│ Θ \" else N.[let g=g-5*n in if g>4 then 5 else if g<0 then 0 else g])\nlet rec fG n g=match n/20L,n%20L with (0L,0L)->(g,List.length g) |(i,n)->fG i ((fN(int n))::g)\nlet mayan n=let n,g=fG n []\n printf \"┌────\"; for _ in 2..g do printf \"┬────\"\n printfn \"┐\"; for g in 3.. -1 ..0 do n|>List.iter(fun n->printf \"%s\" (n(g))); printfn \"│\"\n printf \"└────\"; for _ in 2..g do printf \"┴────\"\n printfn \"┘\"\n[4005L;8017L;326205L;886205L]|>List.iter(fun n->printfn \"%d\" n; mayan n)\n","language":"F-Sharp"},{"code":"USING: arrays formatting io kernel make math math.extras\nsequences ;\nIN: rosetta-code.mayan-numerals\n\n: mayan-digit ( n -- m pair ) 20 /mod 5 /mod swap 2array ;\n\n: integer>mayan ( n -- seq )\n [ [ mayan-digit , ] until-zero ] { } make reverse ;\n\n: ones ( n -- str ) [ CHAR: ● ] \"\" replicate-as ;\n: fives ( n -- str ) [ \"——\" ] replicate \"<br>\" join ;\n\n: numeral ( pair -- str )\n dup sum zero? [ drop \"Θ\" ]\n [ first2 [ ones ] [ fives ] bi* 2array harvest \"<br>\" join ]\n if ;\n\n: .table-row ( pair -- )\n \"|style=\\\"width:3em;vertical-align:bottom;\\\"|\" write numeral\n print ;\n\n: .table-head ( -- )\n \"class=\\\"wikitable\\\" style=\\\"text-align:center;\\\"\" print ;\n\n: .table-body ( n -- ) integer>mayan [ .table-row ] each ;\n\n: .mayan ( n -- )\n [ \"Mayan %d:\\n\" printf ]\n [ \"{|\" write .table-head .table-body \"|}\" print ] bi ;\n\n: mayan-numerals ( -- )\n { 4005 8017 326205 886205 } [ .mayan ] each ;\n\nMAIN: mayan-numerals\n","language":"Factor"},{"code":"Dim As Integer i, j, m, n, s, v\nDim As String maya(5), num\nFor i = 0 To 5\n Read maya(i)\nNext i\nConst ul = Chr(201), uc = Chr(203), ur = Chr(187), ll = Chr(200)\nConst lc = Chr(202), lr = Chr(188), hb = Chr(205), vb = Chr(186)\n\nDim As Longint numbers(0 To ...) = {4005, 8017, 326205, 886205, 1081439556, 18380658207197784}\nFor v = 0 To Ubound(numbers)\n num = Str(numbers(v))\n Print \"Converting\"; numbers(v); \" to Mayan:\"\n\n m = Len(num)\n Redim As Integer D(m)\n For i = 1 To m\n D(i) = Val(Mid(num,i,1))\n Next i\n\n For j = m-1 To 1 Step -1\n For i = 1 To j\n D(i+1) += 10*(D(i) And 1)\n D(i) \\= 2\n Next i\n Next j\n\n s = 1\n Do While D(s) = 0 And s < m\n s += 1\n Loop\n\n For i = s To m\n Print Iif(i < m-1, ul+hb+hb+hb+hb, uc+hb+hb+hb+hb);\n Next i\n Print ur\n For j = 3 To 0 Step -1\n For i = s To m\n If (D(i) Or j) = 0 Then\n Print vb + \" @ \";\n Else\n n = D(i)-5*j\n If n > 5 Then\n n = 5\n Elseif n < 0 Then\n n = 0\n End If\n Print vb; maya(n);\n End If\n Next i\n Print vb\n Next j\n For i = s To m\n Print Iif(i < m-1, ll+hb+hb+hb+hb, lc+hb+hb+hb+hb);\n Next i\n Print lr + Chr(10) '\"+\"\nNext v\nSleep\nData \" \",\" . \",\" .. \",\"... \",\"....\",\"----\"\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"strconv\"\n)\n\nconst (\n ul = \"╔\"\n uc = \"╦\"\n ur = \"╗\"\n ll = \"╚\"\n lc = \"╩\"\n lr = \"╝\"\n hb = \"═\"\n vb = \"║\"\n)\n\nvar mayan = [5]string{\n \" \",\n \" ∙ \",\n \" ∙∙ \",\n \"∙∙∙ \",\n \"∙∙∙∙\",\n}\n\nconst (\n m0 = \" Θ \"\n m5 = \"────\"\n)\n\nfunc dec2vig(n uint64) []uint64 {\n vig := strconv.FormatUint(n, 20)\n res := make([]uint64, len(vig))\n for i, d := range vig {\n res[i], _ = strconv.ParseUint(string(d), 20, 64)\n }\n return res\n}\n\nfunc vig2quin(n uint64) [4]string {\n if n >= 20 {\n panic(\"Cant't convert a number >= 20\")\n }\n res := [4]string{mayan[0], mayan[0], mayan[0], mayan[0]}\n if n == 0 {\n res[3] = m0\n return res\n }\n fives := n / 5\n rem := n % 5\n res[3-fives] = mayan[rem]\n for i := 3; i > 3-int(fives); i-- {\n res[i] = m5\n }\n return res\n}\n\nfunc draw(mayans [][4]string) {\n lm := len(mayans)\n fmt.Print(ul)\n for i := 0; i < lm; i++ {\n for j := 0; j < 4; j++ {\n fmt.Print(hb)\n }\n if i < lm-1 {\n fmt.Print(uc)\n } else {\n fmt.Println(ur)\n }\n }\n for i := 1; i < 5; i++ {\n fmt.Print(vb)\n for j := 0; j < lm; j++ {\n fmt.Print(mayans[j][i-1])\n fmt.Print(vb)\n }\n fmt.Println()\n }\n fmt.Print(ll)\n for i := 0; i < lm; i++ {\n for j := 0; j < 4; j++ {\n fmt.Print(hb)\n }\n if i < lm-1 {\n fmt.Print(lc)\n } else {\n fmt.Println(lr)\n }\n }\n}\n\nfunc main() {\n numbers := []uint64{4005, 8017, 326205, 886205, 1081439556}\n for _, n := range numbers {\n fmt.Printf(\"Converting %d to Mayan:\\n\", n)\n vigs := dec2vig(n)\n lv := len(vigs)\n mayans := make([][4]string, lv)\n for i, vig := range vigs {\n mayans[i] = vig2quin(vig)\n }\n draw(mayans)\n fmt.Println()\n }\n}\n","language":"Go"},{"code":"import Data.Bool (bool)\nimport Data.List (intercalate, transpose)\nimport qualified Data.Map.Strict as M\nimport Data.Maybe (maybe)\n\n--------------------------- MAIN -------------------------\nmain :: IO ()\nmain =\n (putStrLn . unlines) $\n mayanFramed\n <$> [ 4005,\n 8017,\n 326205,\n 886205,\n 1081439556,\n 1000000,\n 1000000000\n ]\n\n---------------------- MAYAN NUMBERS ---------------------\nmayanGlyph :: Int -> [[String]]\nmayanGlyph =\n filter (any (not . null))\n . transpose\n . leftPadded\n . flip (showIntAtBaseS 20 mayanDigit) []\n\nmayanDigit :: Int -> [String]\nmayanDigit n\n | 0 /= n =\n replicate (rem n 5) mayaOne :\n concat\n ( replicate (quot n 5) [mayaFive]\n )\n | otherwise = [[mayaZero]]\n\nmayanFramed :: Int -> String\nmayanFramed =\n (\"Mayan \" <>)\n . ( (<>) <$> show\n <*> ( (\":\\n\\n\" <>)\n . wikiTable\n ( M.fromList\n [ ( \"style\",\n concat\n [ \"text-align:center;\",\n \"background-color:#F0EDDE;\",\n \"color:#605B4B;\",\n \"border:2px solid silver;\"\n ]\n ),\n (\"colwidth\", \"3em;\")\n ]\n )\n . mayanGlyph\n )\n )\n\nmayaZero, mayaOne :: Char\nmayaZero = '\\920'\nmayaOne = '\\9679'\n\nmayaFive :: String\nmayaFive = \"\\9473\\9473\"\n\n---------------------- NUMERIC BASES ---------------------\n-- Based on the Prelude showIntAtBase but uses an\n-- (Int -> [String]) (rather than Int -> Char) function\n-- as its second argument.\n--\n-- Shows a /non-negative/ 'Integral' number using the base\n-- specified by the first argument, and the **String**\n-- representation specified by the second.\nshowIntAtBaseS ::\n Integral a =>\n a ->\n (Int -> [String]) ->\n a ->\n [[String]] ->\n [[String]]\nshowIntAtBaseS base toStr n0 r0 =\n let go (n, d) r =\n seq s $\n case n of\n 0 -> r_\n _ -> go (quotRem n base) r_\n where\n s = toStr (fromIntegral d)\n r_ = s : r\n in go (quotRem n0 base) r0\n\n------------------------- DISPLAY ------------------------\nwikiTable :: M.Map String String -> [[String]] -> String\nwikiTable opts rows\n | null rows = []\n | otherwise =\n \"{| \"\n <> foldr\n ( \\k a ->\n maybe\n a\n ( ((a <> k <> \"=\\\"\") <>)\n . ( <> \"\\\" \"\n )\n )\n (M.lookup k opts)\n )\n []\n [\"class\", \"style\"]\n <> ( '\\n' :\n intercalate\n \"|-\\n\"\n ( zipWith renderedRow rows [0 ..]\n )\n )\n <> \"|}\\n\\n\"\n where\n renderedRow row i =\n unlines\n ( fmap\n ( ( bool\n []\n ( maybe\n \"|\"\n ((\"|style=\\\"width:\" <>) . (<> \"\\\"\"))\n (M.lookup \"colwidth\" opts)\n )\n (0 == i)\n <>\n )\n . ('|' :)\n )\n row\n )\n\nleftPadded :: [[String]] -> [[String]]\nleftPadded xs =\n let w = maximum (length <$> xs)\n in ((<>) =<< flip replicate [] . (-) w . length) <$> xs\n","language":"Haskell"},{"code":"elems =: 6 4$' . .. ... ....----'\ndigit =: (elems{~5:<.0:>.15 10 5 0-~])`((4 4$_14{.'@')&[)@.(0&=)\nmayan =: \":@(digit each@(20&#.^:_1))\n","language":"J"},{"code":"import java.math.BigInteger;\n\npublic class MayanNumerals {\n\n public static void main(String[] args) {\n for ( long base10 : new long[] {4005, 8017, 326205, 886205, 1000000000, 1081439556L, 26960840421L, 503491211079L }) {\n displayMyan(BigInteger.valueOf(base10));\n System.out.printf(\"%n\");\n }\n }\n\n private static char[] digits = \"0123456789ABCDEFGHJK\".toCharArray();\n private static BigInteger TWENTY = BigInteger.valueOf(20);\n\n private static void displayMyan(BigInteger numBase10) {\n System.out.printf(\"As base 10: %s%n\", numBase10);\n String numBase20 = \"\";\n while ( numBase10.compareTo(BigInteger.ZERO) > 0 ) {\n numBase20 = digits[numBase10.mod(TWENTY).intValue()] + numBase20;\n numBase10 = numBase10.divide(TWENTY);\n }\n System.out.printf(\"As base 20: %s%nAs Mayan:%n\", numBase20);\n displayMyanLine1(numBase20);\n displayMyanLine2(numBase20);\n displayMyanLine3(numBase20);\n displayMyanLine4(numBase20);\n displayMyanLine5(numBase20);\n displayMyanLine6(numBase20);\n }\n\n private static char boxUL = Character.toChars(9556)[0];\n private static char boxTeeUp = Character.toChars(9574)[0];\n private static char boxUR = Character.toChars(9559)[0];\n private static char boxHorz = Character.toChars(9552)[0];\n private static char boxVert = Character.toChars(9553)[0];\n private static char theta = Character.toChars(952)[0];\n private static char boxLL = Character.toChars(9562)[0];\n private static char boxLR = Character.toChars(9565)[0];\n private static char boxTeeLow = Character.toChars(9577)[0];\n private static char bullet = Character.toChars(8729)[0];\n private static char dash = Character.toChars(9472)[0];\n\n private static void displayMyanLine1(String base20) {\n char[] chars = base20.toCharArray();\n StringBuilder sb = new StringBuilder();\n for ( int i = 0 ; i < chars.length ; i++ ) {\n if ( i == 0 ) {\n sb.append(boxUL);\n }\n for ( int j = 0 ; j < 4 ; j++ ) {\n sb.append(boxHorz);\n }\n sb.append(i < chars.length-1 ? boxTeeUp : boxUR);\n }\n System.out.println(sb.toString());\n }\n\n private static String getBullet(int count) {\n StringBuilder sb = new StringBuilder();\n switch ( count ) {\n case 1: sb.append(\" \" + bullet + \" \"); break;\n case 2: sb.append(\" \" + bullet + bullet + \" \"); break;\n case 3: sb.append(\"\" + bullet + bullet + bullet + \" \"); break;\n case 4: sb.append(\"\" + bullet + bullet + bullet + bullet); break;\n default: throw new IllegalArgumentException(\"Must be 1-4: \" + count);\n }\n return sb.toString();\n }\n\n private static void displayMyanLine2(String base20) {\n char[] chars = base20.toCharArray();\n StringBuilder sb = new StringBuilder();\n for ( int i = 0 ; i < chars.length ; i++ ) {\n if ( i == 0 ) {\n sb.append(boxVert);\n }\n switch ( chars[i] ) {\n case 'G': sb.append(getBullet(1)); break;\n case 'H': sb.append(getBullet(2)); break;\n case 'J': sb.append(getBullet(3)); break;\n case 'K': sb.append(getBullet(4)); break;\n default : sb.append(\" \");\n }\n sb.append(boxVert);\n }\n System.out.println(sb.toString());\n }\n\n private static String DASH = getDash();\n\n private static String getDash() {\n StringBuilder sb = new StringBuilder();\n for ( int i = 0 ; i < 4 ; i++ ) {\n sb.append(dash);\n }\n return sb.toString();\n }\n\n private static void displayMyanLine3(String base20) {\n char[] chars = base20.toCharArray();\n StringBuilder sb = new StringBuilder();\n for ( int i = 0 ; i < chars.length ; i++ ) {\n if ( i == 0 ) {\n sb.append(boxVert);\n }\n switch ( chars[i] ) {\n case 'B': sb.append(getBullet(1)); break;\n case 'C': sb.append(getBullet(2)); break;\n case 'D': sb.append(getBullet(3)); break;\n case 'E': sb.append(getBullet(4)); break;\n case 'F': case 'G': case 'H': case 'J': case 'K':\n sb.append(DASH); break;\n default : sb.append(\" \");\n }\n sb.append(boxVert);\n }\n System.out.println(sb.toString());\n }\n\n private static void displayMyanLine4(String base20) {\n char[] chars = base20.toCharArray();\n StringBuilder sb = new StringBuilder();\n for ( int i = 0 ; i < chars.length ; i++ ) {\n if ( i == 0 ) {\n sb.append(boxVert);\n }\n switch ( chars[i] ) {\n case '6': sb.append(getBullet(1)); break;\n case '7': sb.append(getBullet(2)); break;\n case '8': sb.append(getBullet(3)); break;\n case '9': sb.append(getBullet(4)); break;\n case 'A': case 'B': case 'C': case 'D': case 'E':\n case 'F': case 'G': case 'H': case 'J': case 'K':\n sb.append(DASH); break;\n default : sb.append(\" \");\n }\n sb.append(boxVert);\n }\n System.out.println(sb.toString());\n }\n\n private static void displayMyanLine5(String base20) {\n char[] chars = base20.toCharArray();\n StringBuilder sb = new StringBuilder();\n for ( int i = 0 ; i < chars.length ; i++ ) {\n if ( i == 0 ) {\n sb.append(boxVert);\n }\n switch ( chars[i] ) {\n case '0': sb.append(\" \" + theta + \" \"); break;\n case '1': sb.append(getBullet(1)); break;\n case '2': sb.append(getBullet(2)); break;\n case '3': sb.append(getBullet(3)); break;\n case '4': sb.append(getBullet(4)); break;\n case '5': case '6': case '7': case '8': case '9':\n case 'A': case 'B': case 'C': case 'D': case 'E':\n case 'F': case 'G': case 'H': case 'J': case 'K':\n sb.append(DASH); break;\n default : sb.append(\" \");\n }\n sb.append(boxVert);\n }\n System.out.println(sb.toString());\n }\n\n private static void displayMyanLine6(String base20) {\n char[] chars = base20.toCharArray();\n StringBuilder sb = new StringBuilder();\n for ( int i = 0 ; i < chars.length ; i++ ) {\n if ( i == 0 ) {\n sb.append(boxLL);\n }\n for ( int j = 0 ; j < 4 ; j++ ) {\n sb.append(boxHorz);\n }\n sb.append(i < chars.length-1 ? boxTeeLow : boxLR);\n }\n System.out.println(sb.toString());\n }\n\n}\n","language":"Java"},{"code":"(() => {\n 'use strict';\n\n const main = () =>\n unlines(\n map(mayanFramed,\n [4005, 8017, 326205, 886205, 1081439556, 1000000, 1000000000]\n )\n );\n\n // MAYAN NUMBERS --------------------------------------\n\n // mayanFramed :: Int -> String\n const mayanFramed = n =>\n '\\nMayan ' + n.toString() + ':\\n\\n' +\n wikiTable({\n style: 'text-align:center; background-color:#F0EDDE; ' +\n 'color:#605B4B; border:2px solid silver',\n colwidth: '3em'\n })(\n mayanGlyph(n)\n );\n\n // mayanGlyph :: Int -> [[String]]\n const mayanGlyph = n =>\n filter(any(compose(not, isNull)),\n transpose(leftPadded(\n showIntAtBase(20, mayanDigit, n, [])\n ))\n );\n\n // mayanDigit :: Int -> [String]\n const mayanDigit = n =>\n 0 !== n ? cons(\n replicateString(rem(n, 5), '●'),\n replicate(quot(n, 5), '━━')\n ) : ['Θ'];\n\n // FORMATTING -----------------------------------------\n\n // wikiTable :: Dict -> [[a]] -> String\n const wikiTable = opts => rows => {\n const colWidth = () =>\n 'colwidth' in opts ? (\n '|style=\"width:' + opts.colwidth + ';\"'\n ) : '';\n return 0 < rows.length ? (\n '{| ' + ['class', 'style'].reduce(\n (a, k) => k in opts ? (\n a + k + '=\"' + opts[k] + '\" '\n ) : a, ''\n ) + '\\n' + rows.map(\n (row, i) => row.map(\n x => (0 === i ? (\n colWidth() + '| '\n ) : '|') + (x.toString() || ' ')\n ).join('\\n')\n ).join('\\n|-\\n') + '\\n|}\\n\\n'\n ) : '';\n };\n\n // leftPadded :: [[String]] -> [[String]]\n const leftPadded = xs => {\n const w = maximum(map(length, xs));\n return map(\n x => replicate(w - x.length, '').concat(x),\n xs\n );\n };\n\n // GENERIC FUNCTIONS ----------------------------------\n\n // Tuple (,) :: a -> b -> (a, b)\n const Tuple = (a, b) => ({\n type: 'Tuple',\n '0': a,\n '1': b,\n length: 2\n });\n\n // any :: (a -> Bool) -> [a] -> Bool\n const any = p => xs => xs.some(p);\n\n // comparing :: (a -> b) -> (a -> a -> Ordering)\n const comparing = f =>\n (x, y) => {\n const\n a = f(x),\n b = f(y);\n return a < b ? -1 : (a > b ? 1 : 0);\n };\n\n // compose (<<<) :: (b -> c) -> (a -> b) -> a -> c\n const compose = (f, g) => x => f(g(x));\n\n // concatMap :: (a -> [b]) -> [a] -> [b]\n const concatMap = (f, xs) =>\n xs.reduce((a, x) => a.concat(f(x)), []);\n\n // cons :: a -> [a] -> [a]\n const cons = (x, xs) =>\n Array.isArray(xs) ? (\n [x].concat(xs)\n ) : 'GeneratorFunction' !== xs.constructor.constructor.name ? (\n x + xs\n ) : ( // Existing generator wrapped with one additional element\n function*() {\n yield x;\n let nxt = xs.next()\n while (!nxt.done) {\n yield nxt.value;\n nxt = xs.next();\n }\n }\n )();\n\n // filter :: (a -> Bool) -> [a] -> [a]\n const filter = (f, xs) => xs.filter(f);\n\n // foldl1 :: (a -> a -> a) -> [a] -> a\n const foldl1 = (f, xs) =>\n 1 < xs.length ? xs.slice(1)\n .reduce(f, xs[0]) : xs[0];\n\n // isNull :: [a] -> Bool\n // isNull :: String -> Bool\n const isNull = xs =>\n Array.isArray(xs) || ('string' === typeof xs) ? (\n 1 > xs.length\n ) : undefined;\n\n // Returns Infinity over objects without finite length.\n // This enables zip and zipWith to choose the shorter\n // argument when one is non-finite, like cycle, repeat etc\n\n // length :: [a] -> Int\n const length = xs =>\n (Array.isArray(xs) || 'string' === typeof xs) ? (\n xs.length\n ) : Infinity;\n\n // map :: (a -> b) -> [a] -> [b]\n const map = (f, xs) =>\n (Array.isArray(xs) ? (\n xs\n ) : xs.split('')).map(f);\n\n // maximum :: Ord a => [a] -> a\n const maximum = xs =>\n 0 < xs.length ? (\n foldl1((a, x) => x > a ? x : a, xs)\n ) : undefined;\n\n // Ordering: (LT|EQ|GT):\n // GT: 1 (or other positive n)\n // EQ: 0\n // LT: -1 (or other negative n)\n\n // maximumBy :: (a -> a -> Ordering) -> [a] -> a\n const maximumBy = (f, xs) =>\n 0 < xs.length ? (\n xs.slice(1)\n .reduce((a, x) => 0 < f(x, a) ? x : a, xs[0])\n ) : undefined;\n\n // not :: Bool -> Bool\n const not = b => !b;\n\n // quot :: Int -> Int -> Int\n const quot = (n, m) => Math.floor(n / m);\n\n // quotRem :: Int -> Int -> (Int, Int)\n const quotRem = (m, n) =>\n Tuple(Math.floor(m / n), m % n);\n\n // rem :: Int -> Int -> Int\n const rem = (n, m) => n % m;\n\n // replicate :: Int -> a -> [a]\n const replicate = (n, x) =>\n Array.from({\n length: n\n }, () => x);\n\n // replicateString :: Int -> String -> String\n const replicateString = (n, s) => s.repeat(n);\n\n // showIntAtBase :: Int -> (Int -> [String])\n // -> Int -> [[String]] -> [[String]]\n const showIntAtBase = (base, toStr, n, rs) => {\n const go = ([n, d], r) => {\n const r_ = cons(toStr(d), r);\n return 0 !== n ? (\n go(Array.from(quotRem(n, base)), r_)\n ) : r_;\n };\n return go(Array.from(quotRem(n, base)), rs);\n };\n\n // transpose :: [[a]] -> [[a]]\n const transpose = tbl => {\n const\n gaps = replicate(\n length(maximumBy(comparing(length), tbl)), []\n ),\n rows = map(xs => xs.concat(gaps.slice(xs.length)), tbl);\n return map(\n (_, col) => concatMap(row => [row[col]], rows),\n rows[0]\n );\n };\n\n // unlines :: [String] -> String\n const unlines = xs => xs.join('\\n');\n\n // MAIN ---\n return main();\n})();\n","language":"JavaScript"},{"code":"def m:\n{ ul: \"╔\",\n uc: \"╦\",\n ur: \"╗\",\n ll: \"╚\",\n lc: \"╩\",\n lr: \"╝\",\n hb: \"═\",\n vb: \"║\",\n\n m0: \" Θ \",\n m5: \"────\"\n};\n\ndef mayan: [\n \" \",\n \" ∙ \",\n \" ∙∙ \",\n \"∙∙∙ \",\n \"∙∙∙∙\"\n];\n\n# decimal number to base-20 array, most significant digit first\ndef dec2vig:\n [recurse(if . >= 20 then ./20|floor else empty end) | . % 20]\n | reverse;\n\ndef vig2quin:\n if . >= 20 then \"Cannot convert a number >= 20.\" | error\n else . as $n\n | [mayan[0], mayan[0], mayan[0], mayan[0]]\n | if $n == 0\n then .[3] = m.m0\n else (($n/5)|floor) as $fives\n | ($n % 5) as $rem\n | .[3-$fives] = mayan[$rem]\n | reduce range(3; 3-$fives; -1) as $i (.; .[$i] = m.m5)\n end\n end;\n\ndef draw($mayans):\n ($mayans|length) as $lm\n | (reduce range(0; $lm) as $i (m.ul;\n . + m.hb * 4 + if $i < $lm - 1 then m.uc else m.ur + \"\\n\" end ) )\n + (reduce range(1; 5) as $i (\"\";\n . + m.vb\n + (reduce range(0; $lm) as $j (\"\";\n . + $mayans[$j][$i-1] + m.vb)) + \"\\n\" ) )\n + (reduce range(0; $lm) as $i (m.ll;\n . + (m.hb * 4)\n + if ($i < $lm - 1) then m.lc else m.lr + \"\\n\" end ) );\n\ndef decimal2mayan:\n \"Converting \\(.) to Mayan:\",\n draw(dec2vig | map( vig2quin ) ),\n \"\" ;\n\n4005, 8017, 326205, 886205, 1081439556\n| decimal2mayan\n","language":"Jq"},{"code":"using Gumbo\n\nmayan_glyphs(x, y) = (x == 0 && y == 0) ? \"\\n<td>Θ</td>\\n\" : \"<td>\\n\" * \"●\" ^ x * \"<br />\\n───\" ^ y * \"</td>\\n\"\n\ninttomayan(n) = (s = string(n, base=20); map(ch -> reverse(divrem(parse(Int, ch, base=20), 5)), split(s, \"\")))\n\nfunction testmayan()\n startstring = \"\"\"\\n\n<style>\ntable.roundedcorners {\n border: 1px solid DarkOrange;\n border-radius: 13px;\n border-spacing: 1;\n }\ntable.roundedcorners td,\ntable.roundedcorners th {\n border: 2px solid DarkOrange;\n border-radius: 13px;\n border-bottom: 3px solid DarkOrange;\n vertical-align: bottom;\n text-align: center;\n padding: 10px;\n }\n</style>\n\\n\"\"\"\n\n txt = startstring\n\n for n in [4005, 8017, 326205, 886205, 70913241, 2147483647]\n txt *= \"<h3>The Mayan representation for the integer $n is: </h3><table class=\\\"roundedcorners\\\"><tr>\" *\n join(map(x -> mayan_glyphs(x[1], x[2]), inttomayan(n))) * \"</tr></table>\\n\\n\"\n end\n\n println(parsehtml(txt))\nend\n\ntestmayan()\n","language":"Julia"},{"code":"mayan_glyphs(x, y) = (x == 0 && y == 0) ? \"\\n| style=$tdconfig | Θ\" : \"\\n| style=$tdconfig | \" * \"●\" ^ x * \"<br>───\" ^ y\n\ninttomayan(n) = (s = string(n, base=20); map(ch -> reverse(divrem(parse(Int, ch, base=20), 5)), split(s, \"\")))\n\ntableconfig = raw\"\"\" \" border: 1px solid DarkOrange; border-radius: 13px; border-spacing: 1; \" \"\"\"\ntdconfig = raw\"\"\" \"border: 2px solid DarkOrange; border-radius: 13px; border-bottom: 2px solid DarkOrange; vertical-align: bottom; text-align: center; padding: 10px;\" \"\"\"\n\nfunction testmayan()\n txt = \"\"\n for n in [4005, 8017, 326205, 886205, 70913241, 2147483647]\n txt *= \"\\n'''The Mayan representation for the integer $n is:'''\\n\" *\n \"{| style=$tableconfig \\n|- \" *\n join(map(x -> mayan_glyphs(x[1], x[2]), inttomayan(n))) * \"\\n|}\\n\\n\"\n end\n println(txt)\nend\n\ntestmayan()\n","language":"Julia"},{"code":"ClearAll[MakeLengthFive, MayanNumeral]\nMakeLengthFive[ci_String] := Module[{c},\n c = If[EvenQ[StringLength[ci]], ci <> \" \", ci];\n While[StringLength[c] < 5, c = \" \" <> c <> \" \"];\n c\n ]\nMayanNumeral[n_Integer?Positive] := Module[{nums, q, r, c},\n nums = IntegerDigits[n, 20];\n Row[Table[\n {q, r} = QuotientRemainder[m, 5];\n If[{q, r} =!= {0, 0},\n c = Prepend[ConstantArray[\"-----\", q], StringJoin[ConstantArray[\".\", r]]];\n c = Join[ConstantArray[\"\", 4 - Length[c]], c];\n c\n ,\n c = {\"\", \"\", \"\", \"\\[Theta]\"}\n ];\n Column[MakeLengthFive /@ c, Frame -> True]\n ,\n {m, nums}\n ], Spacer[1]]\n ]\nMayanNumeral[4005]\nMayanNumeral[8017]\nMayanNumeral[326205]\nMayanNumeral[886205]\nMayanNumeral[1337]\n","language":"Mathematica"},{"code":"import algorithm\n\ntype Border = enum UL = \"╔\", UC = \"╦\", UR = \"╗\", LL = \"╚\", LC = \"╩\", LR = \"╝\", HB = \"═\", VB = \"║\"\n\nconst\n\n Mayan = [\" \", \" ∙ \", \" ∙∙ \", \"∙∙∙ \", \"∙∙∙∙\"]\n\n M0 = \" Θ \"\n M5 = \"────\"\n\ntype\n Digit = range[0..19]\n Numeral = array[4, string]\n MayanNumber = seq[Numeral]\n\n\nfunc toBase20(n: Natural): seq[Digit] =\n ## Return \"n\" expressed as a sequence of base 20 digits.\n result.add(n mod 20)\n var n = n div 20\n while n != 0:\n result.add n mod 20\n n = n div 20\n result.reverse()\n\n\nfunc toMayanNumeral(d: Digit): Numeral =\n ## Return the Numeral representing a base 20 digits.\n\n result = [Mayan[0], Mayan[0], Mayan[0], Mayan[0]]\n if d == 0:\n result[3] = M0\n return\n\n var d = d\n for i in countdown(3, 0):\n if d >= 5:\n result[i] = M5\n dec d, 5\n else:\n result[i] = Mayan[d]\n break\n\n\nproc draw(mayans: MayanNumber) =\n ## Draw the representation fo a mayan number.\n\n let idx = mayans.high\n\n stdout.write UL\n for i in 0..idx:\n for j in 0..3: stdout.write HB\n if i < idx: stdout.write UC else: echo UR\n\n for i in 1..4:\n stdout.write VB\n for j in 0..idx: stdout.write mayans[j][i-1], VB\n stdout.write '\\n'\n\n stdout.write LL\n for i in 0..idx:\n for j in 0..3: stdout.write HB\n if i < idx: stdout.write LC else: echo LR\n\n\nwhen isMainModule:\n\n import sequtils, strutils\n\n for n in [4005, 8017, 326205, 886205, 1081439556]:\n echo \"Converting $1 to Mayan:\".format(n)\n let digits = n.toBase20()\n let mayans = digits.mapIt(it.toMayanNumeral)\n mayans.draw()\n echo \"\"\n","language":"Nim"},{"code":"use ntheory qw/fromdigits todigitstring/;\n\nmy $t_style = '\"border-collapse: separate; text-align: center; border-spacing: 3px 0px;\"';\nmy $c_style = '\"border: solid black 2px;background-color: #fffff0;border-bottom: double 6px;'.\n 'border-radius: 1em;-moz-border-radius: 1em;-webkit-border-radius: 1em;'.\n 'vertical-align: bottom;width: 3.25em;\"';\n\nsub cartouches {\n my($num, @digits) = @_;\n my $render;\n for my $d (@digits) {\n $render .= \"| style=$c_style | $_\\n\" for glyphs(@$d);\n }\n chomp $render;\n join \"\\n\", \"\\{| style=$t_style\", \"|+ $num\", '|-', $render, '|}'\n}\n\nsub glyphs {\n return 'Θ' unless $_[0] || $_[1];\n join '<br>', '●' x $_[0], ('───') x $_[1];\n}\n\nsub mmod {\n my($n,$b) = @_;\n my @nb;\n return 0 unless $n;\n push @nb, fromdigits($_, $b) for split '', todigitstring($n, $b);\n return @nb;\n}\n\nfor $n (qw<4005 8017 326205 886205 26960840421>) {\n push @output, cartouches($n, map { [reverse mmod($_,5)] } mmod($n,20) );\n}\n\nprint join \"\\n<br>\\n\", @output;\n","language":"Perl"},{"code":"(notonline)-->\n <span style=\"color: #000080;font-style:italic;\">-- demo\\rosetta\\Mayan_numerals.exw</span>\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- (file i/o [when as_html is true])</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><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- false == nasty ascii</span>\n <span style=\"color: #000000;\">inline_css</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #000080;font-style:italic;\">-- also uses wiki tables ({| etc) if false</span>\n\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">html</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">t_style</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"border-collapse: separate; text-align: center; border-spacing: 3px 0px;\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">c_style</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"border: solid black 2px;background-color: #fffff0;border-bottom: double 6px;\"</span><span style=\"color: #0000FF;\">&</span>\n <span style=\"color: #008000;\">\"border-radius: 1em;-moz-border-radius: 1em;-webkit-border-radius: 1em;\"</span><span style=\"color: #0000FF;\">&</span>\n <span style=\"color: #008000;\">\"vertical-align: bottom;width: 3.25em;\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">dot</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"●\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">bar</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"───\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">zero</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"Θ\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">digits</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\" 0 \"</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\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">to_seq</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: #004080;\">sequence</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</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;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">prepend</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">a</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: #008080;\">return</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: #008080;\">procedure</span> <span style=\"color: #000000;\">show_mayan</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: #004080;\">sequence</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">to_seq</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</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;\">tb</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: #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: #0000FF;\">),</span><span style=\"color: #008000;\">\"------\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">ln</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: #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: #0000FF;\">),</span><span style=\"color: #008000;\">\" \"</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><span style=\"color: #000000;\">tb</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ln</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ln</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ln</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ln</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">tb</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;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">si</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;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">m</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">4</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;\">res</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: #000000;\">m</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: #000000;\">digits</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">si</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;\">si</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">5</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">si</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: #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: #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;\">\"%d\\n%s\\n\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">a</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;\">\"\\n\"</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">else</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;\">sequence</span> <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;\">\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">si</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;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">4</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;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">l</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: #000000;\">si</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">bar</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">si</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;\">dot</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">si</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">):</span><span style=\"color: #000000;\">zero</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">si</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">5</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">si</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: #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;\">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: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"<br>\"</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;\">inline_css</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;\">\" <table>\\n <caption>%d</caption>\\n <tr>\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">a</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;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</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;\">\" <td>%s</td>\\n\"</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: #000000;\">html</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #008000;\">\" </tr>\\n </table>\\n\"</span>\n <span style=\"color: #008080;\">else</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;\">\"{| style=\\\"%s\\\"\\n|+ %d\\n|-\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">t_style</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">a</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;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</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;\">\"| style=\\\"%s\\\" | %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">c_style</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: #000000;\">html</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #008000;\">\"|}\\n\"</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;\">procedure</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>Mayan numerals</title>\n <style>\n table {%s}\n td { %s }\n </style>\n </head>\n <body>\n <h2>Mayan numerals</h2>\n \"\"\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">wiki_header</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n The following is intended to be pasted into the rosettacode wiki, or similar<br>\n \"\"\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">html_footer</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n </body>\n </html>\n \"\"\"</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;\">4005</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8017</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">326205</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">886205</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">26960840421</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">126524984376952</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> <span style=\"color: #000000;\">show_mayan</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: #008080;\">end</span> <span style=\"color: #008080;\">for</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: #004080;\">string</span> <span style=\"color: #000000;\">filename</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"Mayan_numerals.html\"</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: #000000;\">filename</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"w\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">inline_css</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</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><span style=\"color: #000000;\">t_style</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c_style</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;\">fn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">wiki_header</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;\">fn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">html</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">inline_css</span> <span style=\"color: #008080;\">then</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: #008080;\">end</span> <span style=\"color: #008080;\">if</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: #008080;\">if</span> <span style=\"color: #000000;\">inline_css</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">system</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">filename</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;\">\"See %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">})</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 <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">else</span>\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 <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n<!--\n","language":"Phix"},{"code":"/* MAYAN NUMERALS IN PL/M\n\n THIS PROGRAM RUNS UNDER CP/M AND TAKES THE NUMBER ON THE COMMAND LINE */\n100H:\n/* CP/M CALLS */\nBDOS: PROCEDURE (FN, ARG); DECLARE FN BYTE, ARG ADDRESS; GO TO 5; END BDOS;\nEXIT: PROCEDURE; CALL BDOS(0,0); END EXIT;\nPRINT: PROCEDURE (S); DECLARE S ADDRESS; CALL BDOS(9,S); END PRINT;\n\n/* CP/M COMMAND LINE */\nDECLARE CL$PTR ADDRESS INITIAL (80H), CMD$LEN BASED CL$PTR BYTE;\nDECLARE CMD$PTR ADDRESS INITIAL (81H), CMD$LINE BASED CMD$PTR BYTE;\n\n/* THE PIPE AND AT SYMBOLS ARE NOT INCLUDED IN THE PL/M CHARSET */\nDECLARE PIPE LITERALLY '7CH', AT LITERALLY '40H';\n\n/* PRINT BORDER FOR N DIGITS */\nBORDER: PROCEDURE (N);\n DECLARE (I, N) BYTE;\n DO I=1 TO N;\n CALL PRINT(.'+----$');\n END;\n CALL PRINT(.('+',13,10,'$'));\nEND BORDER;\n\n/* PRINT LINE FOR GIVEN DIGIT */\nDIGIT$LINE: PROCEDURE (LINE, DIGIT);\n DECLARE (I, LINE, DIGIT, UPB) BYTE;\n DECLARE PARTS (6) ADDRESS;\n PARTS(0) = .(PIPE,' $'); PARTS(1) = .(PIPE,' . $');\n PARTS(2) = .(PIPE,' .. $'); PARTS(3) = .(PIPE,'... $');\n PARTS(4) = .(PIPE,'....$'); PARTS(5) = .(PIPE,'----$');\n\n IF DIGIT = 0 THEN DO;\n IF LINE = 3 THEN CALL PRINT(.(PIPE,' ',AT,' $'));\n ELSE CALL PRINT(PARTS(0));\n END;\n ELSE DO;\n UPB = 15-LINE*5;\n IF DIGIT < UPB THEN CALL PRINT(PARTS(0));\n ELSE IF DIGIT >= UPB+5 THEN CALL PRINT(PARTS(5));\n ELSE CALL PRINT(PARTS(DIGIT-UPB));\n END;\nEND DIGIT$LINE;\n\n/* PRINT LINE GIVEN DIGITS */\nLINE: PROCEDURE (L, DIGITS, NDIGITS);\n DECLARE DIGITS ADDRESS;\n DECLARE (L, I, D BASED DIGITS, NDIGITS) BYTE;\n DO I=0 TO NDIGITS-1;\n CALL DIGIT$LINE(L, D(I));\n END;\n CALL PRINT(.(PIPE,13,10,'$'));\nEND LINE;\n\n/* CHECK FOR ARGUMENT */\nIF CMD$LEN < 2 THEN DO;\n CALL PRINT(.'NO INPUT$');\n CALL EXIT;\nEND;\n\n/* PREPROCESS COMMAND LINE - TURN EACH ASCII DIGIT INTO 0-9 */\nDECLARE (I, J) BYTE;\nDO I = 1 TO CMD$LEN-1;\n CMD$LINE(I) = CMD$LINE(I) - '0';\n IF CMD$LINE(I) > 9 THEN DO;\n /* ERROR MESSAGE FOR INVALID INPUT */\n CALL PRINT(.'INVALID DIGIT IN INPUT$');\n CALL EXIT;\n END;\nEND;\n\n/* CONVERT TO BASE 20 DIGIT BY DIGIT */\nJ = CMD$LEN-2;\nDO WHILE J > 0;\n DO I = 1 TO J;\n CMD$LINE(I+1) = CMD$LINE(I+1) + 10*(CMD$LINE(I) AND 1);\n CMD$LINE(I) = CMD$LINE(I) / 2;\n END;\n J = J - 1;\nEND;\n\n/* FIND FIRST NONZERO DIGIT */\nJ = 1;\nDO WHILE CMD$LINE(J) = 0 AND J < CMD$LEN-1;\n J = J + 1;\nEND;\n\n/* PRINT CARTOUCHES */\nDECLARE SIZE BYTE;\nSIZE = CMD$LEN-J;\nCALL BORDER(SIZE);\nDO I=0 TO 3;\n CALL LINE(I, .CMD$LINE(J), SIZE);\nEND;\nCALL BORDER(SIZE);\n\nCALL EXIT;\nEOF\n","language":"PL-M"},{"code":"#START_X=-4 : #START_Y=2\nDim pl$(5)\npl$(0)=\" Θ \" : pl$(1)=\" • \" : pl$(2)=\" •• \"\npl$(3)=\"••• \" : pl$(4)=\"••••\" : pl$(5)=\"‒‒‒‒\"\nIf OpenConsole() : EnableGraphicalConsole(1) : Else : End 1 : EndIf\n\nProcedure.s Dec2Mayan(wert.i)\n result$=\"\"\n If wert=0 : result$=\"0;\" : EndIf\n While wert : result$=Str(wert%20)+\";\"+result$ : wert/20 : Wend\n ProcedureReturn result$\nEndProcedure\n\nProcedure PutMayan(may$)\n Shared pl$()\n X=#START_X+6 : Y=#START_Y\n For i=1 To CountString(may$,\";\")\n m=Val(StringField(may$,i,\";\"))\n yp=Y+4\n If m=0 : ConsoleLocate(X,yp) : Print(pl$(0)) : X+5 : Continue : EndIf\n While m\n If m-5>=0\n ConsoleLocate(X,yp) : Print(pl$(5)) : yp-1 : m-5\n ElseIf m-4>=0\n ConsoleLocate(X,yp) : Print(pl$(4)) : yp-1 : m-4\n ElseIf m-3>=0\n ConsoleLocate(X,yp) : Print(pl$(3)) : yp-1 : m-3\n ElseIf m-2>=0\n ConsoleLocate(X,yp) : Print(pl$(2)) : yp-1 : m-2\n ElseIf m-1>=0\n ConsoleLocate(X,yp) : Print(pl$(1)) : yp-1 : m-1\n EndIf\n Wend\n X+5\n Next\nEndProcedure\n\nProcedure MayanNumerals(may$)\n X=#START_X : Y=#START_Y\n m.i=CountString(may$,\";\")\n For i=1 To m\n X+5\n ConsoleLocate(X,Y) : Print(\"╔════╗\")\n ConsoleLocate(X,Y+1) : Print(\"║ ║\")\n ConsoleLocate(X,Y+2) : Print(\"║ ║\")\n ConsoleLocate(X,Y+3) : Print(\"║ ║\")\n ConsoleLocate(X,Y+4) : Print(\"║ ║\")\n ConsoleLocate(X,Y+5) : Print(\"╚════╝\")\n Next\n X=#START_X\n For i=1 To m\n X+5\n If i<m\n ConsoleLocate(X+5,Y) : Print(\"╦\")\n ConsoleLocate(X+5,Y+5) : Print(\"╩\")\n EndIf\n Next\n PutMayan(may$)\nEndProcedure\n\nRepeat\n ConsoleLocate(0,0) : Print(LSet(\" \",60))\n ConsoleLocate(0,0) : Print(\"MAYAN: ? \") : i$=Input()\n ClearConsole() : If i$=\"\" : End : EndIf\n j$=Dec2Mayan(Val(i$)) : MayanNumerals(j$)\n ConsoleLocate(0,#START_Y+7) : Print(\"Dezimal = \"+i$)\n ConsoleLocate(0,#START_Y+8) : Print(\"Vigesimal= \"+j$)\nForEver\n","language":"PureBasic"},{"code":"'''Mayan numerals'''\n\nfrom functools import (reduce)\n\n\n# -------------------- MAYAN NUMERALS --------------------\n\n# mayanNumerals :: Int -> [[String]]\ndef mayanNumerals(n):\n '''Rows of Mayan digit cells,\n representing the integer n.\n '''\n return showIntAtBase(20)(\n mayanDigit\n )(n)([])\n\n\n# mayanDigit :: Int -> [String]\ndef mayanDigit(n):\n '''List of strings representing a Mayan digit.'''\n if 0 < n:\n r = n % 5\n return [\n (['●' * r] if 0 < r else []) +\n (['━━'] * (n // 5))\n ]\n else:\n return ['Θ']\n\n\n# mayanFramed :: Int -> String\ndef mayanFramed(n):\n '''Mayan integer in the form of a\n Wiki table source string.\n '''\n return 'Mayan ' + str(n) + ':\\n\\n' + (\n wikiTable({\n 'class': 'wikitable',\n 'style': cssFromDict({\n 'text-align': 'center',\n 'background-color': '#F0EDDE',\n 'color': '#605B4B',\n 'border': '2px solid silver'\n }),\n 'colwidth': '3em',\n 'cell': 'vertical-align: bottom;'\n })([[\n '<br>'.join(col) for col in mayanNumerals(n)\n ]])\n )\n\n\n# ------------------------- TEST -------------------------\n\n# main :: IO ()\ndef main():\n '''Mayan numeral representations of various integers'''\n print(\n main.__doc__ + ':\\n\\n' +\n '\\n'.join(mayanFramed(n) for n in [\n 4005, 8017, 326205, 886205, 1081439556,\n 1000000, 1000000000\n ])\n )\n\n\n# ------------------------ BOXES -------------------------\n\n# wikiTable :: Dict -> [[a]] -> String\ndef wikiTable(opts):\n '''Source text for wiki-table display of rows of cells,\n using CSS key-value pairs in the opts dictionary.\n '''\n def colWidth():\n return 'width:' + opts['colwidth'] + '; ' if (\n 'colwidth' in opts\n ) else ''\n\n def cellStyle():\n return opts['cell'] if 'cell' in opts else ''\n\n return lambda rows: '{| ' + reduce(\n lambda a, k: (\n a + k + '=\"' + opts[k] + '\" ' if (\n k in opts\n ) else a\n ),\n ['class', 'style'],\n ''\n ) + '\\n' + '\\n|-\\n'.join(\n '\\n'.join(\n ('|' if (\n 0 != i and ('cell' not in opts)\n ) else (\n '|style=\"' + colWidth() + cellStyle() + '\"|'\n )) + (\n str(x) or ' '\n ) for x in row\n ) for i, row in enumerate(rows)\n ) + '\\n|}\\n\\n'\n\n\n# ----------------------- GENERIC ------------------------\n\n# cssFromDict :: Dict -> String\ndef cssFromDict(dct):\n '''CSS string from a dictinary of key-value pairs'''\n return reduce(\n lambda a, k: a + k + ':' + dct[k] + '; ',\n dct.keys(),\n ''\n )\n\n\n# showIntAtBase :: Int -> (Int -> String)\n# -> Int -> String -> String\ndef showIntAtBase(base):\n '''String representation of an integer in a given base,\n using a supplied function for the string\n representation of digits.\n '''\n def wrap(toChr, n, rs):\n def go(nd, r):\n n, d = nd\n r_ = toChr(d) + r\n return go(divmod(n, base), r_) if 0 != n else r_\n return 'unsupported base' if 1 >= base else (\n 'negative number' if 0 > n else (\n go(divmod(n, base), rs))\n )\n return lambda toChr: lambda n: lambda rs: (\n wrap(toChr, n, rs)\n )\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"### Formatting ###\nmy $t-style = '\"border-collapse: separate; text-align: center; border-spacing: 3px 0px;\"';\nmy $c-style = '\"border: solid black 2px;background-color: #fffff0;border-bottom: double 6px;'~\n 'border-radius: 1em;-moz-border-radius: 1em;-webkit-border-radius: 1em;'~\n 'vertical-align: bottom;width: 3.25em;\"';\nmy $joiner = '<br>';\n\nsub display ($num, @digits) { join \"\\n\", \"\\{| style=$t-style\", \"|+ $num\", '|-', (|@digits.map: {\"| style=$c-style | $_\"}), '|}' }\n\n### Logic ###\n\nsub mayan ($int) { $int.polymod(20 xx *).reverse.map: *.polymod(5) }\n\nmy @output = <4005 8017 326205 886205 16160025 1081439556 503491211079>.map: {\n display $_, .&mayan.map: { [flat '' xx 3, '●' x .[0], '───' xx .[1], ('Θ' if !.[0,1].sum)].tail(4).join: $joiner }\n}\n\nsay @output.join: \"\\n$joiner\\n\";\n","language":"Raku"},{"code":"### Formatting ###\nuse Terminal::Boxer;\nmy $joiner = \"\\n\";\n\nsub display ($num, @digits) { \"$num\\n\" ~ dd-box( :6cw, :4ch, @digits ) }\n\n### Logic ###\n\nsub mayan ($int) { $int.polymod(20 xx *).reverse.map: *.polymod(5) }\n\nmy @output = <4005 8017 326205 886205 16160025 1081439556 503491211079>.map: {\n display $_, .&mayan.map: { [flat '' xx 3, '●' x .[0], '────' xx .[1], ('Θ' if !.[0,1].sum)].tail(4).join: $joiner }\n}\n\nsay @output.join: $joiner;\n","language":"Raku"},{"code":"/*REXX program converts decimal numbers to the Mayan numbering system (with cartouches).*/\nparse arg $ /*obtain optional arguments from the CL*/\nif $='' then $= 4005 8017 326205 886205, /*Not specified? Then use the default.*/\n 172037122592320200101 /*Morse code for MAYAN; egg is a blank.*/\n\n do j=1 for words($) /*convert each of the numbers specified*/\n #= word($, j) /*extract a number from (possible) list*/\n say\n say center('converting the decimal number ' # \" to a Mayan number:\", 90, '─')\n say\n call $MAYAN # '(overlap)' /*invoke the $MAYAN (REXX) subroutine.*/\n say\n end /*j*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"numbers = ARGV.map(&:to_i)\nif numbers.length == 0\n puts\n puts(\"usage: #{File.basename(__FILE__)} number...\")\n exit\nend\n\ndef maya_print(number)\n digits5s1s = number.to_s(20).chars.map { |ch| ch.to_i(20) }.map { |dig| dig.divmod(5) }\n puts(('+----' * digits5s1s.length) + '+')\n 3.downto(0) do |row|\n digits5s1s.each do |d5s1s|\n if row < d5s1s[0]\n print('|----')\n elsif row == d5s1s[0]\n print(\"|#{[(d5s1s[0] == 0 ? ' @ ' : ' '), ' . ', ' .. ', '... ', '....'][d5s1s[1]]}\")\n else\n print('| ')\n end\n end\n puts('|')\n end\n puts(('+----' * digits5s1s.length) + '+')\nend\n\nnumbers.each do |num|\n puts(num)\n maya_print(num)\nend\n","language":"Ruby"},{"code":"const ONE: &str = \"●\";\nconst FIVE: &str = \"——\";\nconst ZERO: &str = \"Θ\";\n\nfn main() {\n println!(\"{}\", mayan(4005));\n println!(\"{}\", mayan(8017));\n println!(\"{}\", mayan(326_205));\n println!(\"{}\", mayan(886_205));\n println!(\"{}\", mayan(69));\n println!(\"{}\", mayan(420));\n println!(\"{}\", mayan(1_063_715_456));\n}\n\nfn mayan(dec: i64) -> String {\n let mut digits = vec![];\n let mut num = dec;\n while num > 0 {\n digits.push(num % 20);\n num /= 20;\n }\n digits = digits.into_iter().rev().collect();\n let mut boxes = vec![\"\".to_string(); 6];\n let n = digits.len();\n for (i, digit) in digits.iter().enumerate() {\n if i == 0 {\n boxes[0] = \"┏━━━━\".to_string();\n if i == n - 1 {\n boxes[0] += \"┓\";\n }\n } else if i == n - 1 {\n boxes[0] += \"┳━━━━┓\";\n } else {\n boxes[0] += \"┳━━━━\";\n }\n for j in 1..5 {\n boxes[j] += \"┃\";\n let elem = 0.max(digit - (4 - j as i64) * 5);\n if elem >= 5 {\n boxes[j] += &format!(\"{: ^4}\", FIVE);\n } else if elem > 0 {\n boxes[j] += &format!(\"{: ^4}\", ONE.repeat(elem as usize % 15));\n } else if j == 4 {\n boxes[j] += &format!(\"{: ^4}\", ZERO);\n } else {\n boxes[j] += &\" \";\n }\n if i == n - 1 {\n boxes[j] += \"┃\";\n }\n }\n if i == 0 {\n boxes[5] = \"┗━━━━\".to_string();\n if i == n - 1 {\n boxes[5] += \"┛\";\n }\n } else if i == n - 1 {\n boxes[5] += \"┻━━━━┛\";\n } else {\n boxes[5] += \"┻━━━━\";\n }\n }\n\n let mut mayan = format!(\"Mayan {}:\\n\", dec);\n for b in boxes {\n mayan += &(b + \"\\n\");\n }\n mayan\n}\n","language":"Rust"},{"code":"import \"./fmt\" for Conv\n\nvar ul = \"╔\"\nvar uc = \"╦\"\nvar ur = \"╗\"\nvar ll = \"╚\"\nvar lc = \"╩\"\nvar lr = \"╝\"\nvar hb = \"═\"\nvar vb = \"║\"\n\nvar mayan= [\n \" \",\n \" ∙ \",\n \" ∙∙ \",\n \"∙∙∙ \",\n \"∙∙∙∙\"\n]\n\nvar m0 = \" Θ \"\nvar m5 = \"────\"\n\nvar dec2vig = Fn.new { |n| Conv.itoa(n, 20).map { |c| Conv.atoi(c, 20) }.toList }\n\nvar vig2quin = Fn.new { |n|\n if (n >= 20) Fiber.abort(\"Cant't convert a number >= 20.\")\n var res = [mayan[0], mayan[0], mayan[0], mayan[0]]\n if (n == 0) {\n res[3] = m0\n return res\n }\n var fives = (n/5).floor\n var rem = n % 5\n res[3-fives] = mayan[rem]\n for (i in 3...3-fives) res[i] = m5\n return res\n}\n\nvar draw = Fn.new { |mayans|\n var lm = mayans.count\n System.write(ul)\n for (i in 0...lm) {\n for (j in 0..3) System.write(hb)\n if (i < lm - 1) {\n System.write(uc)\n } else {\n System.print(ur)\n }\n }\n for (i in 1..4) {\n System.write(vb)\n for (j in 0...lm) {\n System.write(mayans[j][i-1])\n System.write(vb)\n }\n System.print()\n }\n System.write(ll)\n for (i in 0...lm) {\n for (j in 0..3) System.write(hb)\n if (i < lm - 1) {\n System.write(lc)\n } else {\n System.print(lr)\n }\n }\n}\n\nvar numbers = [4005, 8017, 326205, 886205, 1081439556]\nfor (n in numbers) {\n System.print(\"Converting %(n) to Mayan:\")\n var vigs = dec2vig.call(n)\n var mayans = vigs.map { |vig| vig2quin.call(vig) }.toList\n draw.call(mayans)\n System.print()\n}\n","language":"Wren"},{"code":"var zero=\" \\u0398 \",one=\"\\u2219\", five=String(\"\\u2500\"*4,\"\\n\"), fill=\" \\n\";\nvar ds=T(\" \",\" \\u2219 \",\" \\u2219\\u2219 \",\"\\u2219\\u2219\\u2219 \",\"\\u2219\\u2219\\u2219\\u2219\");\nfcn mayan(m){ //--> lists of lists of strings (each line of tile)\n m.toString(20).pump(List,fcn(m){\t\t// 4,005 --> \"a05\"\n bars,dots := m.toInt(20).divr(5);\t\t// \"a\" --> 10 --> (2,0)\n if(0==bars==dots) return(String(fill*3, zero).split(\"\\n\")); // 0\n String(fill*(3-bars), ds[dots],\"\\n\", five*bars)[0,-1].split(\"\\n\") // tile\n })\n}\n","language":"Zkl"},{"code":"var vbar=\"\\u2551\", hbar=\"\\u2550\"*4, ut=(hbar+\"\\u2566\"), bt=(hbar+\"\\u2569\");\nfcn displayMayan(m){ // eg 11 is ( ( ),( * ),(----),(----) )\n println(\"\\u2554\", ut*(m.len()-1), hbar,\"\\u2557\"); // top\n foreach n in (4){ println(vbar, m.apply(\"get\",n).concat(vbar), vbar) }\n println(\"\\u255a\", bt*(m.len()-1), hbar,\"\\u255d\"); // bottom\n}\n","language":"Zkl"},{"code":"foreach m in (T(4_005, 8_017, 326_205, 886_205, 503_491_211_079, 88_637_341)){\n println(\"\\n%,d:\".fmt(m)); mayan(m):displayMayan(_);\n}\n","language":"Zkl"},{"code":"var [const]\n t_style=0''\"border-collapse: separate; text-align: center; border-spacing: 3px 0px;\"',\n c_style=0''\"border: solid black 2px;background-color: #fffff0;border-bottom: double 6px;'\n 0''border-radius: 1em;-moz-border-radius: 1em;-webkit-border-radius: 1em;'\n 0''vertical-align: bottom;width: 3.25em;\"';\nvar [const] dot=\"\\u25cf\", bar=\"\\u2500\\u2500\\u2500!\", zero=\" \\u0398 \";\n\nfcn mayan(m){ m.toString(20).pump(List,fcn(m){ m.toInt(20).divr(5) }) }\nfcn display(num,digits){\n \"{| style=%s\\n|+ %s \\n|-\\n%s|}\".fmt(t_style,num,\n digits.split().pump(String, \"| style=%s | %s\\n\".fmt.fp(c_style)) );\n}\n\nT(88637341,26960840421).apply(\n fcn(m){\n mayan(m).pump(String,\n\t fcn([(bars,dots)]){\n\t (if(bars or dots) (dot*dots + \"!\" + bar*bars)[0,-1] else zero)\n\t + \" \"\n\t }).replace(\"!\",\"<br>\") : display(m,_)\n })\n.concat(\"\\n<br>\\n\").println();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Mayan_numerals\\nnote: Mayan numerals\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nPresent numbers using the Mayan numbering system (displaying the Mayan numerals in a cartouche).\\n\\n\\n;Mayan numbers:\\nNormally, Mayan <u>numbers</u> are written vertically (top─to─bottom) with the most significant\\nnumeral at the top (in the sense that decimal numbers are written left─to─right with the most significant\\ndigit at the left). This task will be using a left─to─right (horizontal) format, mostly for familiarity and\\nreadability, and to conserve screen space (when showing the output) on this task page.\\n\\n\\n;Mayan numerals:\\nMayan <u>numerals</u> (a base─20 \\\"digit\\\" or glyph) are written in two orientations, this\\ntask will be using the \\\"vertical\\\" format (as displayed below). Using the vertical format makes\\nit much easier to draw/construct the Mayan numerals (glyphs) with simple dots ('''.''')\\nand hyphen ('''-'''); (however, round bullets ('''•''') and long dashes ('''─''')\\nmake a better presentation on Rosetta Code).\\n\\n\\nFurthermore, each Mayan numeral (for this task) is to be displayed as a\\ncartouche (enclosed in a box) to make it easier to parse (read); the box may be\\ndrawn with any suitable (ASCII or Unicode) characters that are presentable/visible in all web browsers.\\n\\n\\n;Mayan numerals added to Unicode\\nMayan numerals (glyphs) were added to the Unicode Standard in June of 2018 (this corresponds with\\nversion 11.0). But since most web browsers don't support them at this time, this Rosetta Code\\ntask will be constructing the glyphs with \\\"simple\\\" characters and/or ASCII art.\\n\\n\\n;The \\\"zero\\\" glyph:\\nThe Mayan numbering system has the concept of '''zero''', and should be shown by a glyph that represents\\nan upside─down (sea) shell, or an egg. The Greek letter '''theta''' (<big>'''Θ'''</big>) can be\\nused (which more─or─less, looks like an\\negg). A ''commercial at'' symbol (<big>'''@'''</big>) could make a poor substitute.\\n\\n\\n;Mayan glyphs (constructed):\\nThe Mayan numbering system is\\na [[https://en.wikipedia.org/wiki/Vigesimal vigesimal (base 20)]] positional numeral system.\\n\\n\\n\\n;The Mayan numerals (and some random numbers) shown in the ''vertical'' format would be shown as:\\n\\n ╔════╗ ╔════╗ ╔════╦════╗\\n ║ ║ ║ ║ ║ ║ ║\\n ║ ║ ║ ∙ ║ ║ ║ ║\\n 1──► ║ ║ 11──► ║────║ 21──► ║ ║ ║\\n ║ ∙ ║ ║────║ ║ ∙ ║ ∙ ║\\n ╚════╝ ╚════╝ ╚════╩════╝\\n ╔════╗ ╔════╗ ╔════╦════╗\\n ║ ║ ║ ║ ║ ║ ║\\n ║ ║ ║ ∙∙ ║ ║ ║ ║\\n 2──► ║ ║ 12──► ║────║ 22──► ║ ║ ║\\n ║ ∙∙ ║ ║────║ ║ ∙ ║ ∙∙ ║\\n ╚════╝ ╚════╝ ╚════╩════╝\\n ╔════╗ ╔════╗ ╔════╦════╗\\n ║ ║ ║ ║ ║ ║ ║\\n ║ ║ ║∙∙∙ ║ ║ ║ ║\\n 3──► ║ ║ 13──► ║────║ 40──► ║ ║ ║\\n ║∙∙∙ ║ ║────║ ║ ∙∙ ║ Θ ║\\n ╚════╝ ╚════╝ ╚════╩════╝\\n ╔════╗ ╔════╗ ╔════╦════╗\\n ║ ║ ║ ║ ║ ║ ║\\n ║ ║ ║∙∙∙∙║ ║ ║ ║\\n 4──► ║ ║ 14──► ║────║ 80──► ║ ║ ║\\n ║∙∙∙∙║ ║────║ ║∙∙∙∙║ Θ ║\\n ╚════╝ ╚════╝ ╚════╩════╝\\n ╔════╗ ╔════╗ ╔════╦════╗\\n ║ ║ ║ ║ ║ ║ ║\\n ║ ║ ║────║ ║ ║ ║\\n 5──► ║ ║ 15──► ║────║ 90──► ║ ║────║\\n ║────║ ║────║ ║∙∙∙∙║────║\\n ╚════╝ ╚════╝ ╚════╩════╝\\n ╔════╗ ╔════╗ ╔════╦════╗\\n ║ ║ ║ ∙ ║ ║ ║ ║\\n ║ ║ ║────║ ║ ║ ║\\n 6──► ║ ∙ ║ 16──► ║────║ 100──► ║ ║ ║\\n ║────║ ║────║ ║────║ Θ ║\\n ╚════╝ ╚════╝ ╚════╩════╝\\n ╔════╗ ╔════╗ ╔════╦════╗\\n ║ ║ ║ ∙∙ ║ ║ ║ ║\\n ║ ║ ║────║ ║ ║ ║\\n 7──► ║ ∙∙ ║ 17──► ║────║ 200──► ║────║ ║\\n ║────║ ║────║ ║────║ Θ ║\\n ╚════╝ ╚════╝ ╚════╩════╝\\n ╔════╗ ╔════╗ ╔════╦════╗\\n ║ ║ ║∙∙∙ ║ ║ ║ ║\\n ║ ║ ║────║ 300──► ║────║ ║\\n 8──► ║∙∙∙ ║ 18──► ║────║ ║────║ ║\\n ║────║ ║────║ ║────║ Θ ║\\n ╚════╝ ╚════╝ ╚════╩════╝\\n ╔════╗ ╔════╗ ╔════╦════╦════╗\\n ║ ║ ║∙∙∙∙║ ║ ║ ║ ║\\n ║ ║ ║────║ 400──► ║ ║ ║ ║\\n 9──► ║∙∙∙∙║ 19──► ║────║ ║ ║ ║ ║\\n ║────║ ║────║ ║ ∙ ║ Θ ║ Θ ║\\n ╚════╝ ╚════╝ ╚════╩════╩════╝\\n ╔════╗ ╔════╦════╗ ╔════╦════╦════╦════╗\\n ║ ║ ║ ║ ║ ║ ║ ║ ║ ║\\n ║ ║ ║ ║ ║ ║ ║ ║ ║ ║\\n 10──► ║────║ 20──► ║ ║ ║ 16,000──► ║ ║ ║ ║ ║\\n ║────║ ║ ∙ ║ Θ ║ ║ ∙∙ ║ Θ ║ Θ ║ Θ ║\\n ╚════╝ ╚════╩════╝ ╚════╩════╩════╩════╝\\n\\n\\nNote that the Mayan numeral '''13''' in ''horizontal'' format would be shown as:\\n\\n ╔════╗\\n ║ ││║\\n ║ ∙││║\\n 13──► ║ ∙││║ ◄─── this glyph form <u>won't</u> be used in this Rosetta Code task.\\n ║ ∙││║\\n ╚════╝\\n\\n\\n\\nOther forms of cartouches (boxes) can be used for this task.\\n\\n\\n;Task requirements:\\n:* convert the following decimal numbers to Mayan numbers:\\n:::* 4,005\\n:::* 8,017\\n:::* 326,205\\n:::* 886,205\\n:* show a <u>unique</u> ''interesting/pretty/unusual/intriguing/odd/amusing/weird'' Mayan number\\n:* show all output here\\n\\n\\n;Related tasks:\\n:* [[Roman numerals/Encode]] ─── convert numeric values into Roman numerals\\n:* [[Roman numerals/Decode]] ─── convert Roman numerals into Arabic numbers\\n\\n\\n;See also:\\n:* The Wikipedia entry: [[https://en.wikipedia.org/wiki/Maya_numerals Mayan numerals]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"-V\\n UL = ‘╔’\\n UC = ‘╦’\\n UR = ‘╗’\\n LL = ‘╚’\\n LC = ‘╩’\\n LR = ‘╝’\\n HB = ‘═’\\n VB = ‘║’\\n\\n Mayan = [‘ ’,\\n ‘ ∙ ’,\\n ‘ ∙∙ ’,\\n ‘∙∙∙ ’,\\n ‘∙∙∙∙’]\\n\\n M0 = ‘ @ ’\\n M5 = ‘────’\\n\\nF toBase20(=n)\\n V result = [n % 20]\\n n I/= 20\\n L n != 0\\n result [+]= n % 20\\n n I/= 20\\n R reversed(result)\\n\\nF toMayanNumeral(=d)\\n V result = [Mayan[0], Mayan[0], Mayan[0], Mayan[0]]\\n I d == 0\\n result[3] = :M0\\n R result\\n\\n L(i) (3..0).step(-1)\\n I d >= 5\\n result[i] = :M5\\n d -= 5\\n E\\n result[i] = Mayan[d]\\n L.break\\n\\n R result\\n\\nF draw(mayans)\\n V idx = mayans.len - 1\\n\\n print(:UL, end' ‘’)\\n L(i) 0 .. idx\\n print(:HB * 4, end' ‘’)\\n I i < idx\\n print(:UC, end' ‘’)\\n E\\n print(:UR)\\n\\n L(i) 1..4\\n print(:VB, end' ‘’)\\n L(j) 0 .. idx\\n print(mayans[j][i - 1]‘’:VB, end' ‘’)\\n print()\\n\\n print(:LL, end' ‘’)\\n L(i) 0 .. idx\\n print(:HB * 4, end' ‘’)\\n I i < idx\\n print(:LC, end' ‘’)\\n E\\n print(:LR)\\n\\nL(n) [4005, 8017, 326205, 886205, 1081439556]\\n print(‘Converting ’n‘ to Mayan:’)\\n V digits = toBase20(n)\\n V mayans = digits.map(d -> toMayanNumeral(d))\\n draw(mayans)\\n print()\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"putch:\\tequ\\t2\\nputs:\\tequ\\t9\\n\\torg\\t100h\\n\\tlxi\\th,80h\\t; Get length of command line input\\n\\tmov\\ta,m\\n\\tcpi\\t2\\n\\trc\\t\\t; If no input, stop\\n\\tadd\\tl\\n\\tmov\\tl,a\\t; Go to end of numbers\\n\\tmov\\tc,l\\t; C = end of numbers\\n\\tinx\\th\\n\\tmvi\\tm,0FFh\\t; Terminate digit sequence with FFh\\n\\tdcx\\th\\nsub0:\\tmov\\ta,m\\n\\tcpi\\t32\\t; When space reached, we're at the beginning\\n\\tjz\\tto20\\n\\tsui\\t'0'\\t; Subtract '0' from each digit and make sure\\n\\trc\\t\\t; they are all valid\\n\\tcpi\\t10\\t\\n\\trnc\\t\\n\\tmov\\tm,a\\n\\tdcx \\th\\n\\tjmp\\tsub0\\nto20:\\tmov\\ta,c\\t; Calculate amount of numbers\\n\\tsui\\t81h\\n\\tmov\\tc,a\\nto20l:\\tmov\\te,c\\t; E = digit counter\\n\\tmvi\\tl,82h\\t; Start at beginning\\ndiv2:\\tmov\\ta,m\\t; Grab digit\\n\\tjnc\\t$+5\\t; If carry, add ten\\n\\tadi\\t10\\n\\trar\\t\\t; Divide by two\\n\\tmov\\tm,a\\t; Write back\\n\\tinx\\th\\n\\tdcr\\te\\n\\tjnz\\tdiv2\\t; Keep going\\n\\tdcx\\th\\t; For the last number we want\\n\\tral\\t\\t; to keep the carry\\n\\tmov\\tm,a\\t; This digit is now base-20\\n\\tdcr\\tc\\t; One fewer digit left to do\\n\\tjnz\\tto20l\\n\\tmvi\\tl,81h\\t; Find start and end of numbers\\nstart:\\tinx\\th\\n\\tmov\\ta,m\\n\\tana\\ta\\n\\tjz\\tstart\\n\\tmov\\tb,l\\t; B = start\\n\\tinr\\ta\\t; If number is zero, output nothing\\n\\trz\\nnend:\\tinx\\th\\n\\tmov\\ta,m\\n\\tinr\\ta\\n\\tjnz\\tnend\\n\\tmov\\ta,l\\t; A = end\\n\\tsub\\tb\\n\\tmov\\tc,a\\t; C = amount\\n\\tcall\\tedge\\n\\tmvi\\td,3\\t; D=line\\nline:\\tpush\\tb\\t; Save start and amount\\n\\tmov\\tl,b\\t; HL = first digit\\n\\tmvi\\th,0\\nnum:\\tcall\\tdline\\t; Print line for digit\\n\\tinx\\th\\t; Next digit\\n\\tdcr\\tc\\n\\tjnz\\tnum\\n\\tpush\\td\\t; Save line number\\n\\tlxi\\td,dn\\t; Print end of line\\n\\tcall\\tprint\\n\\tpop \\td\\t; Restore variables\\n\\tpop \\tb\\n\\tdcr\\td\\n\\tjp\\tline\\t; Print next line\\nedge:\\tpush\\tb\\t; Print edge (top or bottom)\\nedge_l:\\tpush\\tb\\t; Keep counter\\n\\tlxi\\td,edges\\t\\n\\tcall \\tprint\\n\\tpop\\tb\\n\\tdcr \\tc\\n\\tjnz\\tedge_l\\n\\tlxi\\td,edgen\\t\\n\\tcall\\tprint\\n\\tpop\\tb\\n\\tret\\t\\ndline:\\tpush\\th\\t; Print line for digit (D'th from bottom)\\n\\tpush\\td\\n\\tpush\\tb\\n\\tmov\\ta,m\\n\\tora\\td\\t; Line and number both 0?\\n\\tjnz\\t$+9\\n\\tlxi\\td,dz\\t; Then print line with @\\n\\tjmp\\tdnum\\n\\tmov\\ta,d\\t; 5 * line\\n\\tadd\\ta\\n\\tadd\\ta\\n\\tadd\\td\\n\\tmov\\te,a\\n\\tmov\\ta,m\\t; A -= 5 * line\\n\\tsub\\te\\n\\tlxi\\td,d0\\t; If <0, empty\\n\\tjm\\tdnum\\n\\tcpi\\t5\\n\\tjc\\t$+9\\n\\tlxi\\td,d5\\t; If >=5, ----\\n\\tjmp\\tdnum\\n\\tadd\\ta\\t; Otherwise, d[n]\\n\\tmov\\tl,a\\n\\tadd\\ta\\n\\tadd\\tl\\n\\tmov\\tl,a\\n\\tmvi\\th,0\\n\\tdad\\td\\n\\txchg\\ndnum:\\tcall\\tprint\\n\\tpop\\tb\\n\\tpop\\td\\n\\tpop\\th\\n\\tret\\t\\t\\nprint:\\tmvi\\tc,puts\\n\\tjmp\\t5\\nedges:\\tdb\\t'+----$'\\nedgen:\\tdb\\t'+',13,10,'$'\\ndz:\\tdb\\t'| @ $'\\nd0:\\tdb\\t'| $| . $| .. $|... $|....$'\\nd5:\\tdb\\t'|----$'\\ndn:\\tdb\\t'|',13,10,'$'\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \"#include <basico.h>\\n\\nalgoritmo\\n\\n muestra=\\\"\\\"\\n obtener total argumentos\\n cuando ' sea distinto a( 2 ) '{ terminar }\\n obtener parámetro alfanumérico (2), guardar en 'muestra'\\n\\n lsimb={}, '\\\" \\\",\\\" . \\\",\\\" .. \\\",\\\"... \\\",\\\"....\\\"'#(utf8(\\\"────\\\")), enlistar en 'lsimb'\\n\\n largo=0, #( largo = len(muestra))\\n sdígitos={}, separar( muestra, sdígitos, \\\"\\\")\\n ndígitos=0, #( ndígitos = number(sdígitos) )\\n\\n m=0, t=0\\n #( m = largo-1)\\n\\n // convertir dígitos a base 20,la base de los mayas:\\n iterar para( j=m, #(j>=1), --j )\\n iterar para( i=1, #(i<=j), ++i )\\n bit.and( #(ndígitos[i]), 1 ), por '10',\\n guardar en 't'\\n #( ndígitos[i+1] += t )\\n #( ndígitos[i] = int(ndígitos[i]/2) )\\n siguiente\\n siguiente\\n\\n s=1\\n iterar mientras ( #( ndígitos[s]==0 && s<largo) )\\n ++s\\n reiterar\\n\\n\\n // armar los cartuchos:\\n imprimir ( #(utf8(\\\"╔═════\\\")),#(replicate( utf8(\\\"═════\\\"), largo-s) ), #(utf8(\\\"═╗\\\")), NL,\\\\\\n #(utf8(\\\"║┌────\\\")),#(replicate( utf8(\\\"┬────\\\"), largo-s) ), #(utf8(\\\"┐║\\\")), NL )\\n\\n n=0\\n iterar para ( l=3, #(l>=0), --l )\\n\\n imprimir (#(utf8(\\\"║\\\")))\\n iterar para ( i=s, #(i<=largo), ++i )\\n si ( bit.or ( #(ndígitos[i]), l ), es igual a '0' )\\n imprimir ( #(utf8(\\\"│ Θ \\\")) )\\n\\n sino\\n guardar ' #(ndígitos[i]-5*l) ' en 'n'\\n si ( #(n>5) )\\n n=5\\n sino si ( n, es negativo? )\\n n=0\\n fin si\\n imprimir( #(utf8(\\\"│\\\")), #(lsimb[n+1]) )\\n\\n fin si\\n siguiente\\n imprimir (#(utf8(\\\"│║\\\")),NL)\\n\\n siguiente\\n\\n imprimir ( #(utf8(\\\"║└────\\\")),#(replicate( utf8(\\\"┴────\\\"), largo-s) ), #(utf8(\\\"┘║\\\")), NL,\\\\\\n #(utf8(\\\"╚═════\\\")),#(replicate( utf8(\\\"═════\\\"), largo-s) ), #(utf8(\\\"═╝\\\")), NL )\\n saltar\\n\\nterminar\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"mayan←{\\n ds←6 4⍴' . .. ... ....────'\\n d←{ ⍵=0:4 4⍴¯14↑'Θ'\\n ds[1+5⌊0⌈⍵-15 10 5 0;]\\n }¨20(⊥⍣¯1)⍵\\n top←'╔',(1↓∊(≢d)⍴⊂'╦════'),'╗'\\n btm←'╚',(1↓∊(≢d)⍴⊂'╩════'),'╝'\\n top⍪((⊃,/'║',¨d),'║')⍪btm\\n}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"use AppleScript version \\\"2.4\\\"\\nuse framework \\\"Foundation\\\"\\nuse scripting additions\\n\\n-- MAYAN NUMBERS ------------------------------------------\\n\\n-- mayanNumber:: Int -> [[String]]\\non mayanNumber(n)\\n showIntAtBase(20, my mayanDigit, n, {})\\nend mayanNumber\\n\\n-- mayanDigit :: Int -> String\\non mayanDigit(n)\\n if 0 < n then\\n set r to n mod 5\\n bool({}, {concat(replicate(r, \\\"●\\\"))}, 0 < r) & ¬\\n replicate(n div 5, \\\"━━\\\")\\n else\\n {\\\"Θ\\\"}\\n end if\\nend mayanDigit\\n\\n-- mayanFrame :: Int -> String\\non mayanFrame(n)\\n \\\"Mayan \\\" & (n as string) & \\\":\\\\n\\\" & wikiTable({|class|:¬\\n \\\"wikitable\\\", colwidth:¬\\n \\\"3em\\\", cell:¬\\n \\\"vertical-align:bottom;\\\", |style|:¬\\n \\\"text-align:center;background-color:#F0EDDE;\\\" & ¬\\n \\\"color:#605B4B;border:2px solid silver\\\"})'s ¬\\n |λ|({map(intercalateS(\\\"<br>\\\"), mayanNumber(n))}) & \\\"\\\\n\\\"\\nend mayanFrame\\n\\n-- TEST ---------------------------------------------------\\n\\non run\\n set str to unlines(map(mayanFrame, ¬\\n {4005, 8017, 326205, 886205, 2978480}))\\n\\n set the clipboard to (str)\\n return str\\nend run\\n\\n-- GENERIC ------------------------------------------------\\n\\n-- Just :: a -> Maybe a\\non Just(x)\\n {type:\\\"Maybe\\\", Nothing:false, Just:x}\\nend Just\\n\\n-- Nothing :: Maybe a\\non Nothing()\\n {type:\\\"Maybe\\\", Nothing:true}\\nend Nothing\\n\\n-- Tuple (,) :: a -> b -> (a, b)\\non Tuple(a, b)\\n {type:\\\"Tuple\\\", |1|:a, |2|:b, length:2}\\nend Tuple\\n\\n-- bool :: a -> a -> Bool -> a\\non bool(f, t, p)\\n if p then\\n t\\n else\\n f\\n end if\\nend bool\\n\\n-- concat :: [[a]] -> [a]\\n-- concat :: [String] -> String\\non concat(xs)\\n set lng to length of xs\\n if 0 < lng and string is class of (item 1 of xs) then\\n set acc to \\\"\\\"\\n else\\n set acc to {}\\n end if\\n repeat with i from 1 to lng\\n set acc to acc & item i of xs\\n end repeat\\n acc\\nend concat\\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-- intercalateS :: String -> [String] -> String\\non intercalateS(sep)\\n script\\n on |λ|(xs)\\n set {dlm, my text item delimiters} to {my text item delimiters, sep}\\n set s to xs as text\\n set my text item delimiters to dlm\\n return s\\n end |λ|\\n end script\\nend intercalateS\\n\\n-- lookupDict :: a -> Dict -> Maybe b\\non lookupDict(k, dct)\\n set ca to current application\\n set v to (ca's NSDictionary's dictionaryWithDictionary:dct)'s objectForKey:k\\n if missing value ≠ v then\\n Just(item 1 of ((ca's NSArray's arrayWithObject:v) as list))\\n else\\n Nothing()\\n end if\\nend lookupDict\\n\\n-- Lift 2nd class handler function into 1st class script wrapper\\n-- mReturn :: First-class m => (a -> b) -> m (a -> b)\\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-- 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-- | The 'maybe' function takes a default value, a function, and a 'Maybe'\\n-- value. If the 'Maybe' value is 'Nothing', the function returns the\\n-- default value. Otherwise, it applies the function to the value inside\\n-- the 'Just' and returns the result.\\n-- maybe :: b -> (a -> b) -> Maybe a -> b\\non maybe(v, f, mb)\\n if Nothing of mb then\\n v\\n else\\n tell mReturn(f) to |λ|(Just of mb)\\n end if\\nend maybe\\n\\n-- quotRem :: Int -> Int -> (Int, Int)\\non quotRem(m, n)\\n Tuple(m div n, m mod n)\\nend quotRem\\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-- showIntAtBase :: Int -> (Int -> [String]) -> Int -> String -> String\\non showIntAtBase(base, toDigit, n, rs)\\n script showIt\\n property f : mReturn(toDigit)\\n on |λ|(nd_, r)\\n set {n, d} to ({|1|, |2|} of nd_)\\n set r_ to {f's |λ|(d)} & r\\n if n > 0 then\\n |λ|(quotRem(n, base), r_)\\n else\\n r_\\n end if\\n end |λ|\\n end script\\n showIt's |λ|(quotRem(n, base), rs)\\nend showIntAtBase\\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-- 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-- wikiTable :: Dict -> [[String]] -> String\\non wikiTable(opts)\\n script ksv\\n on |λ|(k)\\n script\\n on |λ|(s)\\n script\\n on |λ|(v)\\n k & v & s\\n end |λ|\\n end script\\n end |λ|\\n end script\\n end |λ|\\n end script\\n script\\n on |λ|(rows)\\n script boxStyle\\n on |λ|(a, k)\\n maybe(a, ksv's |λ|(a & k & \\\"=\\\\\\\"\\\")'s |λ|(\\\"\\\\\\\" \\\"), ¬\\n lookupDict(k, opts))\\n end |λ|\\n end script\\n script rowText\\n on |λ|(row, iRow)\\n script cellText\\n on |λ|(cell)\\n if 1 = iRow then\\n set w to maybe(\\\"\\\", ksv's |λ|(\\\"width:\\\")'s |λ|(\\\";\\\"), ¬\\n lookupDict(\\\"colwidth\\\", opts))\\n else\\n set w to \\\"\\\"\\n end if\\n set s to maybe(w, ksv's |λ|(w)'s |λ|(\\\"\\\"), ¬\\n lookupDict(\\\"cell\\\", opts))\\n if 0 < length of s then\\n \\\"style=\\\\\\\"\\\" & s & \\\"\\\\\\\"|\\\" & cell\\n else\\n cell\\n end if\\n end |λ|\\n end script\\n intercalateS(\\\"\\\\n|\\\")'s |λ|(map(cellText, row))\\n end |λ|\\n end script\\n \\\"{| \\\" & unwords(foldl(boxStyle, \\\"\\\", {\\\"class\\\", \\\"style\\\"})) & \\\"\\\\n|\\\" & ¬\\n intercalateS(\\\"\\\\n|-\\\\n\\\")'s |λ|(map(rowText, rows)) & \\\"\\\\n|}\\\"\\n end |λ|\\n end script\\nend wikiTable\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"UL: \\\"╔\\\"\\nUC: \\\"╦\\\"\\nUR: \\\"╗\\\"\\nLL: \\\"╚\\\"\\nLC: \\\"╩\\\"\\nLR: \\\"╝\\\"\\nHB: \\\"═\\\"\\nVB: \\\"║\\\"\\n\\nMayan: [\\\" \\\", \\\" ∙ \\\", \\\" ∙∙ \\\", \\\"∙∙∙ \\\", \\\"∙∙∙∙\\\"]\\n\\nM0: \\\" Θ \\\"\\nM5: \\\"────\\\"\\n\\ntoMayan: function [digit][\\n result: array.of:4 Mayan\\\\0\\n if digit = 0 [\\n result\\\\3: M0\\n return result\\n ]\\n\\n d: digit\\n loop 3..0 'i [\\n if? d >= 5 [\\n result\\\\[i]: M5\\n d: d - 5\\n ]\\n else [\\n result\\\\[i]: Mayan\\\\[d]\\n break\\n ]\\n ]\\n return result\\n]\\n\\ndraw: function [mayans][\\n idx: dec size mayans\\n\\n prints UL\\n\\n loop 0..idx 'i [\\n loop 0..3 'j [\\n prints HB\\n ]\\n prints (i < idx)? -> UC -> UR ++ `\\\\n`\\n ]\\n\\n loop 1..4 'i [\\n prints VB\\n loop 0..idx 'j ->\\n prints mayans\\\\[j]\\\\[dec i] ++ VB\\n print \\\"\\\"\\n ]\\n\\n prints LL\\n\\n loop 0..idx 'i [\\n loop 0..3 'j ->\\n prints HB\\n prints (i < idx)? -> LC -> LR ++ `\\\\n`\\n ]\\n]\\n\\nloop [4005, 8017, 326205, 886205, 1081439556] 'n [\\n print [\\\"Converting\\\" n \\\"to Mayan:\\\"]\\n digs: digits.base:20 n\\n mayans: map digs => toMayan\\n draw mayans\\n print \\\"\\\"\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"MayanNumerals(num){\\n\\tpwr:=1, obj:=[], grid:=[]\\n\\twhile (num // 20**pwr)\\n\\t\\tpwr++\\t\\n\\twhile --pwr\\n\\t{\\n\\t\\tobj.Push(num // 20**pwr)\\n\\t\\tnum := Mod(num, 20**pwr)\\n\\t}\\n\\tobj.Push(num)\\n\\tcols := obj.count()\\n\\tloop % cols\\n\\t{\\n\\t\\tc := A_Index\\n\\t\\tloop 4\\n\\t\\t\\tgrid[c, A_Index] := \\\" \\\"\\n\\t\\tgrid[c, 4] := \\\" Θ \\\"\\n\\t}\\n\\t\\n\\tfor i, v in obj\\n\\t{\\n\\t\\tj := 5\\n\\t\\tloop % v//5\\n\\t\\t{\\n\\t\\t\\tj := 5 - A_Index\\n\\t\\t\\tgrid[i, j] := \\\"————\\\"\\n\\t\\t}\\n\\t\\trem := \\\"\\\"\\n\\t\\tloop % Mod(v, 5)\\n\\t\\t\\trem .= \\\"●\\\"\\n\\t\\trem := rem = \\\"●\\\" ? \\\" ● \\\" : rem = \\\"●●\\\" ? \\\" ●● \\\" : rem = \\\"●●●\\\" ? \\\"●●● \\\" : rem\\n\\t\\tif Mod(v, 5)\\n\\t\\t\\tgrid[i, j-1] := rem\\n\\t}\\n\\treturn grid2table(grid, cols)\\n}\\n\\ngrid2table(grid, cols){\\n\\tloop, % cols-1\\n\\t\\ttopRow .= \\\"════╦\\\", bottomRow .= \\\"════╩\\\"\\n\\ttopRow := \\\"╔\\\" topRow \\\"════╗\\\"\\n\\tbottomRow := \\\"╚\\\" bottomRow \\\"════╝\\\"\\n\\tloop % 4\\n\\t{\\n\\t\\tr := A_Index\\n\\t\\tloop % cols\\n\\t\\t\\tresult .= \\\"║\\\" grid[A_Index, r]\\n\\t\\tresult .= \\\"║`n\\\"\\n\\t}\\n\\tresult := topRow \\\"`n\\\" result . bottomRow\\n\\treturn % result\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"for i, n in [4005, 8017, 326205, 886205, 194481]\\n{\\n\\tx := MayanNumerals(n)\\n\\tGui, Font, S12, Consolas\\n\\tGui, Add, Text, , % n\\n\\tGui, Add, Text, y+0, % x\\n\\tGui, Show, y100\\n\\tMsgBox, 262180, , continue with next number?\\n\\tIfMsgBox, No\\n\\t\\tExitApp\\n\\tGui, Destroy\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"10 DEFINT A-Z: DIM L$(5)\\n15 FOR I=0 TO 5: READ L$(I): NEXT I\\n20 LINE INPUT I$\\n30 M=LEN(I$): DIM D(M)\\n40 FOR I=1 TO M: D(I)=VAL(MID$(I$,I,1)): NEXT I\\n50 FOR J=M-1 TO 1 STEP -1\\n60 FOR I=1 TO J\\n70 D(I+1) = D(I+1) + 10*(D(I) AND 1)\\n80 D(I) = D(I)\\\\2\\n90 NEXT I,J\\n100 S=1\\n110 IF D(S)=0 AND S<M THEN S=S+1: GOTO 110\\n120 FOR I=S TO M: PRINT \\\"+----\\\";: NEXT I: PRINT \\\"+\\\"\\n130 FOR L=3 TO 0 STEP -1\\n140 FOR I=S TO M\\n150 IF (D(I) OR L)=0 THEN PRINT \\\"| @ \\\";: GOTO 180\\n160 N=D(I)-5*L: IF N>5 THEN N=5 ELSE IF N<0 THEN N=0\\n170 PRINT \\\"|\\\";L$(N);\\n180 NEXT I\\n190 PRINT \\\"|\\\"\\n200 NEXT L\\n210 FOR I=S TO M: PRINT \\\"+----\\\";: NEXT I: PRINT \\\"+\\\"\\n220 END\\n230 DATA \\\" \\\",\\\" . \\\",\\\" .. \\\",\\\"... \\\",\\\"....\\\",\\\"----\\\"\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\nlet reads(v) be\\n$( v%0 := 0\\n $( let ch = rdch()\\n if ch = '*N' | ch = endstreamch break\\n v%0 := v%0 + 1\\n v%(v%0) := ch\\n $) repeat\\n$)\\n\\nlet digits(v) = valof\\n$( for i=1 to v%0\\n $( unless '0' <= v%i <= '9' resultis false\\n v%i := v%i - '0'\\n $)\\n resultis true\\n$)\\n\\nlet base20(v) be\\n$( let i = ?\\n for j=v%0-1 to 1 by -1\\n for i=1 to j\\n $( v%(i+1) := v%(i+1) + 10*(v%i & 1)\\n v%i := v%i >> 1\\n $)\\n i := 1\\n while v%i=0 & i<v%0 do i := i+1\\n for j=i to v%0 do v%(j-i+1) := v%j\\n v%0 := v%0-i+1\\n$)\\n\\nlet mayan(v) be\\n$( let border(n) be\\n $( for i=1 to n do writes(\\\"+----\\\")\\n writes(\\\"+*N\\\")\\n $)\\n let part(num, line) be\\n test num=0 do\\n writes(line=0 -> \\\" @ \\\", \\\" \\\")\\n or\\n $( num := num - line*5\\n writes(num<=0 -> \\\" \\\",\\n num =1 -> \\\" . \\\",\\n num =2 -> \\\" .. \\\",\\n num =3 -> \\\"... \\\",\\n num =4 -> \\\"....\\\",\\n \\\"----\\\")\\n $)\\n border(v%0)\\n for l=3 to 0 by -1\\n $( for d=1 to v%0\\n $( wrch('|')\\n part(v%d, l)\\n $)\\n writes(\\\"|*N\\\")\\n $)\\n border(v%0)\\n$)\\n\\nlet start() be\\n$( let v = vec 1+255/BYTESPERWORD\\n $( writes(\\\"Number? \\\")\\n reads(v)\\n if v%0=0 finish\\n unless digits(v) loop\\n base20(v)\\n mayan(v)\\n $) repeat\\n$)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <string.h>\\n#include <stdint.h>\\n#include <stdlib.h>\\n\\n#define MAX(x,y) ((x) > (y) ? (x) : (y))\\n#define MIN(x,y) ((x) < (y) ? (x) : (y))\\n\\n/* Find base-20 digits. */\\nsize_t base20(unsigned int n, uint8_t *out) {\\n /* generate digits */\\n uint8_t *start = out;\\n do {*out++ = n % 20;} while (n /= 20);\\n size_t length = out - start;\\n\\n /* put digits in high-endian order */\\n while (out > start) {\\n uint8_t x = *--out;\\n *out = *start;\\n *start++ = x;\\n }\\n return length;\\n}\\n\\n/* Write a Mayan digit */\\nvoid make_digit(int n, char *place, size_t line_length) {\\n static const char *parts[] = {\\\" \\\",\\\" . \\\",\\\" .. \\\",\\\"... \\\",\\\"....\\\",\\\"----\\\"};\\n int i;\\n\\n /* write 4-part digit */\\n for (i=4; i>0; i--, n -= 5)\\n memcpy(place + i*line_length, parts[MAX(0, MIN(5, n))], 4);\\n\\n /* if digit was 0 we should put '@' in 2nd position of last line */\\n if (n == -20) place[4 * line_length + 1] = '@';\\n}\\n\\n/* Make a Mayan numeral */\\nchar *mayan(unsigned int n) {\\n if (n == 0) return NULL;\\n\\n uint8_t digits[15]; /* 2**64 is 15 Mayan digits long */\\n size_t n_digits = base20(n, digits);\\n\\n /* a digit is 4 chars wide, plus N+1 divider lines, plus a newline\\n makes for a length of 5*n+2 */\\n size_t line_length = n_digits*5 + 2;\\n\\n /* we need 6 lines - four for the digits, plus top and bottom row */\\n char *str = malloc(line_length * 6 + 1);\\n if (str == NULL) return NULL;\\n str[line_length * 6] = 0;\\n\\n /* make the cartouche divider lines */\\n char *ptr;\\n unsigned int i;\\n /* top and bottom row */\\n for (ptr=str, i=0; i<line_length; i+=5, ptr+=5)\\n memcpy(ptr, \\\"+----\\\", 5);\\n memcpy(ptr-5, \\\"+\\\\n\\\", 2);\\n memcpy(str+5*line_length, str, line_length);\\n /* middle rows */\\n for (ptr=str+line_length, i=0; i<line_length; i+=5, ptr+=5)\\n memcpy(ptr, \\\"| \\\", 5);\\n memcpy(ptr-5, \\\"|\\\\n\\\", 2);\\n memcpy(str+2*line_length, str+line_length, line_length);\\n memcpy(str+3*line_length, str+line_length, 2*line_length);\\n\\n /* copy in the digits */\\n for (i=0; i<n_digits; i++)\\n make_digit(digits[i], str+1+5*i, line_length);\\n\\n return str;\\n}\\n\\nint main(int argc, char **argv) {\\n if (argc != 2) {\\n fprintf(stderr, \\\"usage: mayan <number>\\\\n\\\");\\n return 1;\\n }\\n int i = atoi(argv[1]);\\n if (i <= 0) {\\n fprintf(stderr, \\\"number must be positive\\\\n\\\");\\n return 1;\\n }\\n char *m = mayan(i);\\n printf(\\\"%s\\\",m);\\n free(m);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <cstdint>\\n#include <iostream>\\n#include <string>\\n#include <unordered_map>\\n#include <vector>\\n\\nconst std::vector<std::string> MAYAN_DIGITS = { \\\" Θ \\\", \\\" ∙ \\\", \\\" ∙∙ \\\", \\\"∙∙∙ \\\", \\\"∙∙∙∙\\\", \\\"────\\\" };\\nconst std::string BLANK = \\\" \\\";\\n\\nstd::unordered_map<std::string, std::string> BORDER { { \\\"horizontal_beam\\\", \\\"═\\\" }, { \\\"vertical_beam\\\", \\\"║\\\" },\\n\\t{ \\\"lower_left\\\", \\\"╚\\\" }, { \\\"lower_central\\\", \\\"╩\\\" }, { \\\"lower_right\\\", \\\"╝\\\" },\\n\\t{ \\\"upper_left\\\", \\\"╔\\\" }, { \\\"upper_central\\\", \\\"╦\\\" }, { \\\"upper_right\\\", \\\"╗\\\" }\\t};\\n\\nstd::vector<int32_t> to_base20(const int32_t& number) {\\n\\tstd::vector<int32_t> result;\\n\\tresult.emplace_back(number % 20);\\n\\tint32_t n = number / 20;\\n\\twhile ( n != 0 ) {\\n\\t\\tresult.emplace_back(n % 20);\\n\\t\\tn /= 20;\\n\\t}\\n\\tstd::reverse(result.begin(), result.end());\\n\\treturn result;\\n}\\n\\nstd::vector<std::string> to_mayan_numeral(int32_t digit) {\\n\\tstd::vector<std::string> result(4, BLANK);\\n\\tif ( digit == 0 ) {\\n\\t\\tresult[3] = MAYAN_DIGITS[0];\\n\\t\\treturn result;\\n\\t}\\n\\n\\tfor ( int32_t i = 3; i >= 0; --i ) {\\n\\t\\tif ( digit >= 5 ) {\\n\\t\\t\\tresult[i] = MAYAN_DIGITS[5];\\n\\t\\t\\tdigit -= 5;\\n\\t\\t} else {\\n\\t\\t\\tresult[i] = ( digit == 0 ) ? BLANK : MAYAN_DIGITS[digit];\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\n\\nvoid display(const std::vector<std::vector<std::string>>& numerals) {\\n\\t\\tconst int32_t index = numerals.size() - 1;\\n\\n\\t\\tstd::cout << BORDER[\\\"upper_left\\\"];\\n\\t\\tfor ( int32_t i = 0; i <= index; ++i ) {\\n\\t\\t\\tfor ( int32_t j = 0; j <= 3; ++j ) {\\n\\t\\t\\t\\tstd::cout << BORDER[\\\"horizontal_beam\\\"];\\n\\t\\t\\t}\\n\\t\\t\\tif ( i < index ) {\\n\\t\\t\\t\\tstd::cout << BORDER[\\\"upper_central\\\"];\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tstd::cout << BORDER[\\\"upper_right\\\"] << std::endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor ( int32_t i = 1; i <= 4; ++i ) {\\n\\t\\t\\tstd::cout << BORDER[\\\"vertical_beam\\\"];\\n\\t\\t\\tfor ( int32_t j = 0; j <= index; ++j ) {\\n\\t\\t\\t\\tstd::cout << numerals[j][i - 1] + BORDER[\\\"vertical_beam\\\"];\\n\\t\\t\\t}\\n\\t\\t\\tstd::cout << std::endl;\\n\\t\\t}\\n\\n\\t\\tstd::cout << BORDER[\\\"lower_left\\\"];\\n\\t\\tfor ( int32_t i = 0; i <= index; ++i ) {\\n\\t\\t\\tfor ( int32_t j = 0; j <= 3; ++j ) {\\n\\t\\t\\t\\tstd::cout << BORDER[\\\"horizontal_beam\\\"];\\n\\t\\t\\t}\\n\\t\\t\\tif ( i < index ) {\\n\\t\\t\\t\\tstd::cout << BORDER[\\\"lower_central\\\"];\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tstd::cout << BORDER[\\\"lower_right\\\"] << std::endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\nint main() {\\n\\tfor ( const int32_t& base10 : { 4'005, 8'017, 326'205, 886'205, 1'081'439'556 } ) {\\n\\t\\tstd::cout << \\\"Base 10 number, \\\" << base10 << \\\" to Mayan:\\\" << std::endl;\\n\\t\\tstd::vector<int32_t> digits = to_base20(base10);\\n\\t\\tstd::vector<std::vector<std::string>> mayans;\\n\\t\\tfor ( const int32_t& digit : digits ) {\\n\\t\\t\\tstd::vector<std::string> mayan = to_mayan_numeral(digit);\\n\\t\\t\\tmayans.push_back(mayan);\\n\\t\\t}\\n\\t\\tdisplay(mayans);\\n\\t\\tstd::cout << std::endl;\\n\\t}\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"% This program must be linked with PCLU's \\\"misc.lib\\\" and \\\"useful.lib\\\"\\n\\nbase20 = proc (n: bigint) returns (sequence[int])\\n own zero: bigint := bigint$i2bi(0)\\n own twenty: bigint := bigint$i2bi(20)\\n if n=zero then return(sequence[int]$[0]) end\\n\\n digits: array[int] := array[int]$[]\\n while n>zero do\\n array[int]$addl(digits, bigint$bi2i(n//twenty))\\n n := n/twenty\\n end\\n return(sequence[int]$a2s(digits))\\nend base20\\n\\nmayan = proc (digits: sequence[int]) returns (string)\\n own parts: array[string] := array[string]$[0:\\n \\\" \\\", \\\" . \\\", \\\" .. \\\", \\\"... \\\", \\\"....\\\", \\\"----\\\"\\n ]\\n % generate edges\\n edge: stream := stream$create_output()\\n for i: int in int$from_to(1, sequence[int]$size(digits)) do\\n stream$puts(edge, \\\"+----\\\")\\n end\\n stream$putl(edge, \\\"+\\\")\\n\\n % generate digits\\n lines: stream := stream$create_output()\\n for i: int in int$from_to_by(15, 0, -5) do\\n for d: int in sequence[int]$elements(digits) do\\n p: int := d-i\\n if p<0 then p:=0 end\\n if p>5 then p:=5 end\\n if i=0 & p=0\\n then stream$puts(lines, \\\"| @ \\\")\\n else stream$puts(lines, \\\"|\\\" || parts[p])\\n end\\n end\\n stream$putl(lines, \\\"|\\\")\\n end\\n\\n s_edge: string := stream$get_contents(edge)\\n return(s_edge || stream$get_contents(lines) || s_edge)\\nend mayan\\n\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n n: bigint := bigint$parse(sequence[string]$bottom(get_argv()))\\n stream$puts(po, mayan(base20(n)))\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\ninclude \\\"argv.coh\\\";\\n\\n# convert number to base 20\\nsub base20(n: uint32, out: [uint8]): (n_digits: uint8) is\\n n_digits := 0;\\n loop\\n [out] := (n % 20) as uint8;\\n n := n / 20;\\n out := @next out;\\n n_digits := n_digits + 1;\\n if n == 0 then break; end if;\\n end loop;\\nend sub;\\n\\n# get the N'th line (from the top) for a Mayan digit\\nsub digit_line(n: uint8, line: uint8): (s: [uint8]) is\\n var parts: [uint8][] := {\\\" \\\",\\\" . \\\",\\\" .. \\\",\\\"... \\\",\\\"....\\\",\\\"----\\\"};\\n if n == 0 then\\n if line == 3 then s := \\\" @ \\\";\\n else s := parts[0];\\n end if;\\n else\\n var nn := n - 5*(3-line);\\n if nn > 128 then s := parts[0];\\n elseif nn > 5 then s := parts[5];\\n else s := parts[nn];\\n end if;\\n end if;\\nend sub;\\n\\n# print Mayan number\\nsub print_mayan(n: uint32) is\\n sub edge(n: uint8) is\\n while n>0 loop\\n print(\\\"+----\\\");\\n n := n-1;\\n end loop;\\n print_char('+');\\n print_nl();\\n end sub;\\n\\n var digits: uint8[8]; # 8 digits is enough for 2**32\\n var size := base20(n, &digits[0]);\\n\\n edge(size);\\n var line: uint8 := 0;\\n while line < 4 loop\\n var d: uint8 := size-1;\\n loop\\n print_char('|');\\n print(digit_line(digits[d], line));\\n if d==0 then break; end if;\\n d := d - 1;\\n end loop;\\n print_char('|');\\n print_nl();\\n line := line + 1;\\n end loop;\\n edge(size);\\nend sub;\\n\\nsub Error() is\\n print(\\\"usage: mayan <number>. number must be positive\\\");\\n print_nl();\\n ExitWithError();\\nend sub;\\n\\n# read number from command line\\nArgvInit();\\nvar arg := ArgvNext();\\nif arg == 0 as [uint8] then Error(); end if;\\nvar n: int32;\\n(n, arg) := AToI(arg);\\nif n <= 0 then Error(); end if;\\nprint_mayan(n as uint32);\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"// Mayan numerals. Nigel Galloway: February 19th., 2021\\nlet N=[|\\\"│ \\\";\\\"│. \\\";\\\"│.. \\\";\\\"│... \\\";\\\"│....\\\";\\\"│~~~~\\\"|]\\nlet fN g=(fun(n)->if g=0 && n=0 then \\\"│ Θ \\\" else N.[let g=g-5*n in if g>4 then 5 else if g<0 then 0 else g])\\nlet rec fG n g=match n/20L,n%20L with (0L,0L)->(g,List.length g) |(i,n)->fG i ((fN(int n))::g)\\nlet mayan n=let n,g=fG n []\\n printf \\\"┌────\\\"; for _ in 2..g do printf \\\"┬────\\\"\\n printfn \\\"┐\\\"; for g in 3.. -1 ..0 do n|>List.iter(fun n->printf \\\"%s\\\" (n(g))); printfn \\\"│\\\"\\n printf \\\"└────\\\"; for _ in 2..g do printf \\\"┴────\\\"\\n printfn \\\"┘\\\"\\n[4005L;8017L;326205L;886205L]|>List.iter(fun n->printfn \\\"%d\\\" n; mayan n)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: arrays formatting io kernel make math math.extras\\nsequences ;\\nIN: rosetta-code.mayan-numerals\\n\\n: mayan-digit ( n -- m pair ) 20 /mod 5 /mod swap 2array ;\\n\\n: integer>mayan ( n -- seq )\\n [ [ mayan-digit , ] until-zero ] { } make reverse ;\\n\\n: ones ( n -- str ) [ CHAR: ● ] \\\"\\\" replicate-as ;\\n: fives ( n -- str ) [ \\\"——\\\" ] replicate \\\"<br>\\\" join ;\\n\\n: numeral ( pair -- str )\\n dup sum zero? [ drop \\\"Θ\\\" ]\\n [ first2 [ ones ] [ fives ] bi* 2array harvest \\\"<br>\\\" join ]\\n if ;\\n\\n: .table-row ( pair -- )\\n \\\"|style=\\\\\\\"width:3em;vertical-align:bottom;\\\\\\\"|\\\" write numeral\\n print ;\\n\\n: .table-head ( -- )\\n \\\"class=\\\\\\\"wikitable\\\\\\\" style=\\\\\\\"text-align:center;\\\\\\\"\\\" print ;\\n\\n: .table-body ( n -- ) integer>mayan [ .table-row ] each ;\\n\\n: .mayan ( n -- )\\n [ \\\"Mayan %d:\\\\n\\\" printf ]\\n [ \\\"{|\\\" write .table-head .table-body \\\"|}\\\" print ] bi ;\\n\\n: mayan-numerals ( -- )\\n { 4005 8017 326205 886205 } [ .mayan ] each ;\\n\\nMAIN: mayan-numerals\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Dim As Integer i, j, m, n, s, v\\nDim As String maya(5), num\\nFor i = 0 To 5\\n Read maya(i)\\nNext i\\nConst ul = Chr(201), uc = Chr(203), ur = Chr(187), ll = Chr(200)\\nConst lc = Chr(202), lr = Chr(188), hb = Chr(205), vb = Chr(186)\\n\\nDim As Longint numbers(0 To ...) = {4005, 8017, 326205, 886205, 1081439556, 18380658207197784}\\nFor v = 0 To Ubound(numbers)\\n num = Str(numbers(v))\\n Print \\\"Converting\\\"; numbers(v); \\\" to Mayan:\\\"\\n\\n m = Len(num)\\n Redim As Integer D(m)\\n For i = 1 To m\\n D(i) = Val(Mid(num,i,1))\\n Next i\\n\\n For j = m-1 To 1 Step -1\\n For i = 1 To j\\n D(i+1) += 10*(D(i) And 1)\\n D(i) \\\\= 2\\n Next i\\n Next j\\n\\n s = 1\\n Do While D(s) = 0 And s < m\\n s += 1\\n Loop\\n\\n For i = s To m\\n Print Iif(i < m-1, ul+hb+hb+hb+hb, uc+hb+hb+hb+hb);\\n Next i\\n Print ur\\n For j = 3 To 0 Step -1\\n For i = s To m\\n If (D(i) Or j) = 0 Then\\n Print vb + \\\" @ \\\";\\n Else\\n n = D(i)-5*j\\n If n > 5 Then\\n n = 5\\n Elseif n < 0 Then\\n n = 0\\n End If\\n Print vb; maya(n);\\n End If\\n Next i\\n Print vb\\n Next j\\n For i = s To m\\n Print Iif(i < m-1, ll+hb+hb+hb+hb, lc+hb+hb+hb+hb);\\n Next i\\n Print lr + Chr(10) '\\\"+\\\"\\nNext v\\nSleep\\nData \\\" \\\",\\\" . \\\",\\\" .. \\\",\\\"... \\\",\\\"....\\\",\\\"----\\\"\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"strconv\\\"\\n)\\n\\nconst (\\n ul = \\\"╔\\\"\\n uc = \\\"╦\\\"\\n ur = \\\"╗\\\"\\n ll = \\\"╚\\\"\\n lc = \\\"╩\\\"\\n lr = \\\"╝\\\"\\n hb = \\\"═\\\"\\n vb = \\\"║\\\"\\n)\\n\\nvar mayan = [5]string{\\n \\\" \\\",\\n \\\" ∙ \\\",\\n \\\" ∙∙ \\\",\\n \\\"∙∙∙ \\\",\\n \\\"∙∙∙∙\\\",\\n}\\n\\nconst (\\n m0 = \\\" Θ \\\"\\n m5 = \\\"────\\\"\\n)\\n\\nfunc dec2vig(n uint64) []uint64 {\\n vig := strconv.FormatUint(n, 20)\\n res := make([]uint64, len(vig))\\n for i, d := range vig {\\n res[i], _ = strconv.ParseUint(string(d), 20, 64)\\n }\\n return res\\n}\\n\\nfunc vig2quin(n uint64) [4]string {\\n if n >= 20 {\\n panic(\\\"Cant't convert a number >= 20\\\")\\n }\\n res := [4]string{mayan[0], mayan[0], mayan[0], mayan[0]}\\n if n == 0 {\\n res[3] = m0\\n return res\\n }\\n fives := n / 5\\n rem := n % 5\\n res[3-fives] = mayan[rem]\\n for i := 3; i > 3-int(fives); i-- {\\n res[i] = m5\\n }\\n return res\\n}\\n\\nfunc draw(mayans [][4]string) {\\n lm := len(mayans)\\n fmt.Print(ul)\\n for i := 0; i < lm; i++ {\\n for j := 0; j < 4; j++ {\\n fmt.Print(hb)\\n }\\n if i < lm-1 {\\n fmt.Print(uc)\\n } else {\\n fmt.Println(ur)\\n }\\n }\\n for i := 1; i < 5; i++ {\\n fmt.Print(vb)\\n for j := 0; j < lm; j++ {\\n fmt.Print(mayans[j][i-1])\\n fmt.Print(vb)\\n }\\n fmt.Println()\\n }\\n fmt.Print(ll)\\n for i := 0; i < lm; i++ {\\n for j := 0; j < 4; j++ {\\n fmt.Print(hb)\\n }\\n if i < lm-1 {\\n fmt.Print(lc)\\n } else {\\n fmt.Println(lr)\\n }\\n }\\n}\\n\\nfunc main() {\\n numbers := []uint64{4005, 8017, 326205, 886205, 1081439556}\\n for _, n := range numbers {\\n fmt.Printf(\\\"Converting %d to Mayan:\\\\n\\\", n)\\n vigs := dec2vig(n)\\n lv := len(vigs)\\n mayans := make([][4]string, lv)\\n for i, vig := range vigs {\\n mayans[i] = vig2quin(vig)\\n }\\n draw(mayans)\\n fmt.Println()\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.Bool (bool)\\nimport Data.List (intercalate, transpose)\\nimport qualified Data.Map.Strict as M\\nimport Data.Maybe (maybe)\\n\\n--------------------------- MAIN -------------------------\\nmain :: IO ()\\nmain =\\n (putStrLn . unlines) $\\n mayanFramed\\n <$> [ 4005,\\n 8017,\\n 326205,\\n 886205,\\n 1081439556,\\n 1000000,\\n 1000000000\\n ]\\n\\n---------------------- MAYAN NUMBERS ---------------------\\nmayanGlyph :: Int -> [[String]]\\nmayanGlyph =\\n filter (any (not . null))\\n . transpose\\n . leftPadded\\n . flip (showIntAtBaseS 20 mayanDigit) []\\n\\nmayanDigit :: Int -> [String]\\nmayanDigit n\\n | 0 /= n =\\n replicate (rem n 5) mayaOne :\\n concat\\n ( replicate (quot n 5) [mayaFive]\\n )\\n | otherwise = [[mayaZero]]\\n\\nmayanFramed :: Int -> String\\nmayanFramed =\\n (\\\"Mayan \\\" <>)\\n . ( (<>) <$> show\\n <*> ( (\\\":\\\\n\\\\n\\\" <>)\\n . wikiTable\\n ( M.fromList\\n [ ( \\\"style\\\",\\n concat\\n [ \\\"text-align:center;\\\",\\n \\\"background-color:#F0EDDE;\\\",\\n \\\"color:#605B4B;\\\",\\n \\\"border:2px solid silver;\\\"\\n ]\\n ),\\n (\\\"colwidth\\\", \\\"3em;\\\")\\n ]\\n )\\n . mayanGlyph\\n )\\n )\\n\\nmayaZero, mayaOne :: Char\\nmayaZero = '\\\\920'\\nmayaOne = '\\\\9679'\\n\\nmayaFive :: String\\nmayaFive = \\\"\\\\9473\\\\9473\\\"\\n\\n---------------------- NUMERIC BASES ---------------------\\n-- Based on the Prelude showIntAtBase but uses an\\n-- (Int -> [String]) (rather than Int -> Char) function\\n-- as its second argument.\\n--\\n-- Shows a /non-negative/ 'Integral' number using the base\\n-- specified by the first argument, and the **String**\\n-- representation specified by the second.\\nshowIntAtBaseS ::\\n Integral a =>\\n a ->\\n (Int -> [String]) ->\\n a ->\\n [[String]] ->\\n [[String]]\\nshowIntAtBaseS base toStr n0 r0 =\\n let go (n, d) r =\\n seq s $\\n case n of\\n 0 -> r_\\n _ -> go (quotRem n base) r_\\n where\\n s = toStr (fromIntegral d)\\n r_ = s : r\\n in go (quotRem n0 base) r0\\n\\n------------------------- DISPLAY ------------------------\\nwikiTable :: M.Map String String -> [[String]] -> String\\nwikiTable opts rows\\n | null rows = []\\n | otherwise =\\n \\\"{| \\\"\\n <> foldr\\n ( \\\\k a ->\\n maybe\\n a\\n ( ((a <> k <> \\\"=\\\\\\\"\\\") <>)\\n . ( <> \\\"\\\\\\\" \\\"\\n )\\n )\\n (M.lookup k opts)\\n )\\n []\\n [\\\"class\\\", \\\"style\\\"]\\n <> ( '\\\\n' :\\n intercalate\\n \\\"|-\\\\n\\\"\\n ( zipWith renderedRow rows [0 ..]\\n )\\n )\\n <> \\\"|}\\\\n\\\\n\\\"\\n where\\n renderedRow row i =\\n unlines\\n ( fmap\\n ( ( bool\\n []\\n ( maybe\\n \\\"|\\\"\\n ((\\\"|style=\\\\\\\"width:\\\" <>) . (<> \\\"\\\\\\\"\\\"))\\n (M.lookup \\\"colwidth\\\" opts)\\n )\\n (0 == i)\\n <>\\n )\\n . ('|' :)\\n )\\n row\\n )\\n\\nleftPadded :: [[String]] -> [[String]]\\nleftPadded xs =\\n let w = maximum (length <$> xs)\\n in ((<>) =<< flip replicate [] . (-) w . length) <$> xs\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"elems =: 6 4$' . .. ... ....----'\\ndigit =: (elems{~5:<.0:>.15 10 5 0-~])`((4 4$_14{.'@')&[)@.(0&=)\\nmayan =: \\\":@(digit each@(20&#.^:_1))\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.math.BigInteger;\\n\\npublic class MayanNumerals {\\n\\n public static void main(String[] args) {\\n for ( long base10 : new long[] {4005, 8017, 326205, 886205, 1000000000, 1081439556L, 26960840421L, 503491211079L }) {\\n displayMyan(BigInteger.valueOf(base10));\\n System.out.printf(\\\"%n\\\");\\n }\\n }\\n\\n private static char[] digits = \\\"0123456789ABCDEFGHJK\\\".toCharArray();\\n private static BigInteger TWENTY = BigInteger.valueOf(20);\\n\\n private static void displayMyan(BigInteger numBase10) {\\n System.out.printf(\\\"As base 10: %s%n\\\", numBase10);\\n String numBase20 = \\\"\\\";\\n while ( numBase10.compareTo(BigInteger.ZERO) > 0 ) {\\n numBase20 = digits[numBase10.mod(TWENTY).intValue()] + numBase20;\\n numBase10 = numBase10.divide(TWENTY);\\n }\\n System.out.printf(\\\"As base 20: %s%nAs Mayan:%n\\\", numBase20);\\n displayMyanLine1(numBase20);\\n displayMyanLine2(numBase20);\\n displayMyanLine3(numBase20);\\n displayMyanLine4(numBase20);\\n displayMyanLine5(numBase20);\\n displayMyanLine6(numBase20);\\n }\\n\\n private static char boxUL = Character.toChars(9556)[0];\\n private static char boxTeeUp = Character.toChars(9574)[0];\\n private static char boxUR = Character.toChars(9559)[0];\\n private static char boxHorz = Character.toChars(9552)[0];\\n private static char boxVert = Character.toChars(9553)[0];\\n private static char theta = Character.toChars(952)[0];\\n private static char boxLL = Character.toChars(9562)[0];\\n private static char boxLR = Character.toChars(9565)[0];\\n private static char boxTeeLow = Character.toChars(9577)[0];\\n private static char bullet = Character.toChars(8729)[0];\\n private static char dash = Character.toChars(9472)[0];\\n\\n private static void displayMyanLine1(String base20) {\\n char[] chars = base20.toCharArray();\\n StringBuilder sb = new StringBuilder();\\n for ( int i = 0 ; i < chars.length ; i++ ) {\\n if ( i == 0 ) {\\n sb.append(boxUL);\\n }\\n for ( int j = 0 ; j < 4 ; j++ ) {\\n sb.append(boxHorz);\\n }\\n sb.append(i < chars.length-1 ? boxTeeUp : boxUR);\\n }\\n System.out.println(sb.toString());\\n }\\n\\n private static String getBullet(int count) {\\n StringBuilder sb = new StringBuilder();\\n switch ( count ) {\\n case 1: sb.append(\\\" \\\" + bullet + \\\" \\\"); break;\\n case 2: sb.append(\\\" \\\" + bullet + bullet + \\\" \\\"); break;\\n case 3: sb.append(\\\"\\\" + bullet + bullet + bullet + \\\" \\\"); break;\\n case 4: sb.append(\\\"\\\" + bullet + bullet + bullet + bullet); break;\\n default: throw new IllegalArgumentException(\\\"Must be 1-4: \\\" + count);\\n }\\n return sb.toString();\\n }\\n\\n private static void displayMyanLine2(String base20) {\\n char[] chars = base20.toCharArray();\\n StringBuilder sb = new StringBuilder();\\n for ( int i = 0 ; i < chars.length ; i++ ) {\\n if ( i == 0 ) {\\n sb.append(boxVert);\\n }\\n switch ( chars[i] ) {\\n case 'G': sb.append(getBullet(1)); break;\\n case 'H': sb.append(getBullet(2)); break;\\n case 'J': sb.append(getBullet(3)); break;\\n case 'K': sb.append(getBullet(4)); break;\\n default : sb.append(\\\" \\\");\\n }\\n sb.append(boxVert);\\n }\\n System.out.println(sb.toString());\\n }\\n\\n private static String DASH = getDash();\\n\\n private static String getDash() {\\n StringBuilder sb = new StringBuilder();\\n for ( int i = 0 ; i < 4 ; i++ ) {\\n sb.append(dash);\\n }\\n return sb.toString();\\n }\\n\\n private static void displayMyanLine3(String base20) {\\n char[] chars = base20.toCharArray();\\n StringBuilder sb = new StringBuilder();\\n for ( int i = 0 ; i < chars.length ; i++ ) {\\n if ( i == 0 ) {\\n sb.append(boxVert);\\n }\\n switch ( chars[i] ) {\\n case 'B': sb.append(getBullet(1)); break;\\n case 'C': sb.append(getBullet(2)); break;\\n case 'D': sb.append(getBullet(3)); break;\\n case 'E': sb.append(getBullet(4)); break;\\n case 'F': case 'G': case 'H': case 'J': case 'K':\\n sb.append(DASH); break;\\n default : sb.append(\\\" \\\");\\n }\\n sb.append(boxVert);\\n }\\n System.out.println(sb.toString());\\n }\\n\\n private static void displayMyanLine4(String base20) {\\n char[] chars = base20.toCharArray();\\n StringBuilder sb = new StringBuilder();\\n for ( int i = 0 ; i < chars.length ; i++ ) {\\n if ( i == 0 ) {\\n sb.append(boxVert);\\n }\\n switch ( chars[i] ) {\\n case '6': sb.append(getBullet(1)); break;\\n case '7': sb.append(getBullet(2)); break;\\n case '8': sb.append(getBullet(3)); break;\\n case '9': sb.append(getBullet(4)); break;\\n case 'A': case 'B': case 'C': case 'D': case 'E':\\n case 'F': case 'G': case 'H': case 'J': case 'K':\\n sb.append(DASH); break;\\n default : sb.append(\\\" \\\");\\n }\\n sb.append(boxVert);\\n }\\n System.out.println(sb.toString());\\n }\\n\\n private static void displayMyanLine5(String base20) {\\n char[] chars = base20.toCharArray();\\n StringBuilder sb = new StringBuilder();\\n for ( int i = 0 ; i < chars.length ; i++ ) {\\n if ( i == 0 ) {\\n sb.append(boxVert);\\n }\\n switch ( chars[i] ) {\\n case '0': sb.append(\\\" \\\" + theta + \\\" \\\"); break;\\n case '1': sb.append(getBullet(1)); break;\\n case '2': sb.append(getBullet(2)); break;\\n case '3': sb.append(getBullet(3)); break;\\n case '4': sb.append(getBullet(4)); break;\\n case '5': case '6': case '7': case '8': case '9':\\n case 'A': case 'B': case 'C': case 'D': case 'E':\\n case 'F': case 'G': case 'H': case 'J': case 'K':\\n sb.append(DASH); break;\\n default : sb.append(\\\" \\\");\\n }\\n sb.append(boxVert);\\n }\\n System.out.println(sb.toString());\\n }\\n\\n private static void displayMyanLine6(String base20) {\\n char[] chars = base20.toCharArray();\\n StringBuilder sb = new StringBuilder();\\n for ( int i = 0 ; i < chars.length ; i++ ) {\\n if ( i == 0 ) {\\n sb.append(boxLL);\\n }\\n for ( int j = 0 ; j < 4 ; j++ ) {\\n sb.append(boxHorz);\\n }\\n sb.append(i < chars.length-1 ? boxTeeLow : boxLR);\\n }\\n System.out.println(sb.toString());\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"(() => {\\n 'use strict';\\n\\n const main = () =>\\n unlines(\\n map(mayanFramed,\\n [4005, 8017, 326205, 886205, 1081439556, 1000000, 1000000000]\\n )\\n );\\n\\n // MAYAN NUMBERS --------------------------------------\\n\\n // mayanFramed :: Int -> String\\n const mayanFramed = n =>\\n '\\\\nMayan ' + n.toString() + ':\\\\n\\\\n' +\\n wikiTable({\\n style: 'text-align:center; background-color:#F0EDDE; ' +\\n 'color:#605B4B; border:2px solid silver',\\n colwidth: '3em'\\n })(\\n mayanGlyph(n)\\n );\\n\\n // mayanGlyph :: Int -> [[String]]\\n const mayanGlyph = n =>\\n filter(any(compose(not, isNull)),\\n transpose(leftPadded(\\n showIntAtBase(20, mayanDigit, n, [])\\n ))\\n );\\n\\n // mayanDigit :: Int -> [String]\\n const mayanDigit = n =>\\n 0 !== n ? cons(\\n replicateString(rem(n, 5), '●'),\\n replicate(quot(n, 5), '━━')\\n ) : ['Θ'];\\n\\n // FORMATTING -----------------------------------------\\n\\n // wikiTable :: Dict -> [[a]] -> String\\n const wikiTable = opts => rows => {\\n const colWidth = () =>\\n 'colwidth' in opts ? (\\n '|style=\\\"width:' + opts.colwidth + ';\\\"'\\n ) : '';\\n return 0 < rows.length ? (\\n '{| ' + ['class', 'style'].reduce(\\n (a, k) => k in opts ? (\\n a + k + '=\\\"' + opts[k] + '\\\" '\\n ) : a, ''\\n ) + '\\\\n' + rows.map(\\n (row, i) => row.map(\\n x => (0 === i ? (\\n colWidth() + '| '\\n ) : '|') + (x.toString() || ' ')\\n ).join('\\\\n')\\n ).join('\\\\n|-\\\\n') + '\\\\n|}\\\\n\\\\n'\\n ) : '';\\n };\\n\\n // leftPadded :: [[String]] -> [[String]]\\n const leftPadded = xs => {\\n const w = maximum(map(length, xs));\\n return map(\\n x => replicate(w - x.length, '').concat(x),\\n xs\\n );\\n };\\n\\n // GENERIC FUNCTIONS ----------------------------------\\n\\n // Tuple (,) :: a -> b -> (a, b)\\n const Tuple = (a, b) => ({\\n type: 'Tuple',\\n '0': a,\\n '1': b,\\n length: 2\\n });\\n\\n // any :: (a -> Bool) -> [a] -> Bool\\n const any = p => xs => xs.some(p);\\n\\n // comparing :: (a -> b) -> (a -> a -> Ordering)\\n const comparing = f =>\\n (x, y) => {\\n const\\n a = f(x),\\n b = f(y);\\n return a < b ? -1 : (a > b ? 1 : 0);\\n };\\n\\n // compose (<<<) :: (b -> c) -> (a -> b) -> a -> c\\n const compose = (f, g) => x => f(g(x));\\n\\n // concatMap :: (a -> [b]) -> [a] -> [b]\\n const concatMap = (f, xs) =>\\n xs.reduce((a, x) => a.concat(f(x)), []);\\n\\n // cons :: a -> [a] -> [a]\\n const cons = (x, xs) =>\\n Array.isArray(xs) ? (\\n [x].concat(xs)\\n ) : 'GeneratorFunction' !== xs.constructor.constructor.name ? (\\n x + xs\\n ) : ( // Existing generator wrapped with one additional element\\n function*() {\\n yield x;\\n let nxt = xs.next()\\n while (!nxt.done) {\\n yield nxt.value;\\n nxt = xs.next();\\n }\\n }\\n )();\\n\\n // filter :: (a -> Bool) -> [a] -> [a]\\n const filter = (f, xs) => xs.filter(f);\\n\\n // foldl1 :: (a -> a -> a) -> [a] -> a\\n const foldl1 = (f, xs) =>\\n 1 < xs.length ? xs.slice(1)\\n .reduce(f, xs[0]) : xs[0];\\n\\n // isNull :: [a] -> Bool\\n // isNull :: String -> Bool\\n const isNull = xs =>\\n Array.isArray(xs) || ('string' === typeof xs) ? (\\n 1 > xs.length\\n ) : undefined;\\n\\n // Returns Infinity over objects without finite length.\\n // This enables zip and zipWith to choose the shorter\\n // argument when one is non-finite, like cycle, repeat etc\\n\\n // length :: [a] -> Int\\n const length = xs =>\\n (Array.isArray(xs) || 'string' === typeof xs) ? (\\n xs.length\\n ) : Infinity;\\n\\n // map :: (a -> b) -> [a] -> [b]\\n const map = (f, xs) =>\\n (Array.isArray(xs) ? (\\n xs\\n ) : xs.split('')).map(f);\\n\\n // maximum :: Ord a => [a] -> a\\n const maximum = xs =>\\n 0 < xs.length ? (\\n foldl1((a, x) => x > a ? x : a, xs)\\n ) : undefined;\\n\\n // Ordering: (LT|EQ|GT):\\n // GT: 1 (or other positive n)\\n // EQ: 0\\n // LT: -1 (or other negative n)\\n\\n // maximumBy :: (a -> a -> Ordering) -> [a] -> a\\n const maximumBy = (f, xs) =>\\n 0 < xs.length ? (\\n xs.slice(1)\\n .reduce((a, x) => 0 < f(x, a) ? x : a, xs[0])\\n ) : undefined;\\n\\n // not :: Bool -> Bool\\n const not = b => !b;\\n\\n // quot :: Int -> Int -> Int\\n const quot = (n, m) => Math.floor(n / m);\\n\\n // quotRem :: Int -> Int -> (Int, Int)\\n const quotRem = (m, n) =>\\n Tuple(Math.floor(m / n), m % n);\\n\\n // rem :: Int -> Int -> Int\\n const rem = (n, m) => n % m;\\n\\n // replicate :: Int -> a -> [a]\\n const replicate = (n, x) =>\\n Array.from({\\n length: n\\n }, () => x);\\n\\n // replicateString :: Int -> String -> String\\n const replicateString = (n, s) => s.repeat(n);\\n\\n // showIntAtBase :: Int -> (Int -> [String])\\n // -> Int -> [[String]] -> [[String]]\\n const showIntAtBase = (base, toStr, n, rs) => {\\n const go = ([n, d], r) => {\\n const r_ = cons(toStr(d), r);\\n return 0 !== n ? (\\n go(Array.from(quotRem(n, base)), r_)\\n ) : r_;\\n };\\n return go(Array.from(quotRem(n, base)), rs);\\n };\\n\\n // transpose :: [[a]] -> [[a]]\\n const transpose = tbl => {\\n const\\n gaps = replicate(\\n length(maximumBy(comparing(length), tbl)), []\\n ),\\n rows = map(xs => xs.concat(gaps.slice(xs.length)), tbl);\\n return map(\\n (_, col) => concatMap(row => [row[col]], rows),\\n rows[0]\\n );\\n };\\n\\n // unlines :: [String] -> String\\n const unlines = xs => xs.join('\\\\n');\\n\\n // MAIN ---\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def m:\\n{ ul: \\\"╔\\\",\\n uc: \\\"╦\\\",\\n ur: \\\"╗\\\",\\n ll: \\\"╚\\\",\\n lc: \\\"╩\\\",\\n lr: \\\"╝\\\",\\n hb: \\\"═\\\",\\n vb: \\\"║\\\",\\n\\n m0: \\\" Θ \\\",\\n m5: \\\"────\\\"\\n};\\n\\ndef mayan: [\\n \\\" \\\",\\n \\\" ∙ \\\",\\n \\\" ∙∙ \\\",\\n \\\"∙∙∙ \\\",\\n \\\"∙∙∙∙\\\"\\n];\\n\\n# decimal number to base-20 array, most significant digit first\\ndef dec2vig:\\n [recurse(if . >= 20 then ./20|floor else empty end) | . % 20]\\n | reverse;\\n\\ndef vig2quin:\\n if . >= 20 then \\\"Cannot convert a number >= 20.\\\" | error\\n else . as $n\\n | [mayan[0], mayan[0], mayan[0], mayan[0]]\\n | if $n == 0\\n then .[3] = m.m0\\n else (($n/5)|floor) as $fives\\n | ($n % 5) as $rem\\n | .[3-$fives] = mayan[$rem]\\n | reduce range(3; 3-$fives; -1) as $i (.; .[$i] = m.m5)\\n end\\n end;\\n\\ndef draw($mayans):\\n ($mayans|length) as $lm\\n | (reduce range(0; $lm) as $i (m.ul;\\n . + m.hb * 4 + if $i < $lm - 1 then m.uc else m.ur + \\\"\\\\n\\\" end ) )\\n + (reduce range(1; 5) as $i (\\\"\\\";\\n . + m.vb\\n + (reduce range(0; $lm) as $j (\\\"\\\";\\n . + $mayans[$j][$i-1] + m.vb)) + \\\"\\\\n\\\" ) )\\n + (reduce range(0; $lm) as $i (m.ll;\\n . + (m.hb * 4)\\n + if ($i < $lm - 1) then m.lc else m.lr + \\\"\\\\n\\\" end ) );\\n\\ndef decimal2mayan:\\n \\\"Converting \\\\(.) to Mayan:\\\",\\n draw(dec2vig | map( vig2quin ) ),\\n \\\"\\\" ;\\n\\n4005, 8017, 326205, 886205, 1081439556\\n| decimal2mayan\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Gumbo\\n\\nmayan_glyphs(x, y) = (x == 0 && y == 0) ? \\\"\\\\n<td>Θ</td>\\\\n\\\" : \\\"<td>\\\\n\\\" * \\\"●\\\" ^ x * \\\"<br />\\\\n───\\\" ^ y * \\\"</td>\\\\n\\\"\\n\\ninttomayan(n) = (s = string(n, base=20); map(ch -> reverse(divrem(parse(Int, ch, base=20), 5)), split(s, \\\"\\\")))\\n\\nfunction testmayan()\\n startstring = \\\"\\\"\\\"\\\\n\\n<style>\\ntable.roundedcorners {\\n border: 1px solid DarkOrange;\\n border-radius: 13px;\\n border-spacing: 1;\\n }\\ntable.roundedcorners td,\\ntable.roundedcorners th {\\n border: 2px solid DarkOrange;\\n border-radius: 13px;\\n border-bottom: 3px solid DarkOrange;\\n vertical-align: bottom;\\n text-align: center;\\n padding: 10px;\\n }\\n</style>\\n\\\\n\\\"\\\"\\\"\\n\\n txt = startstring\\n\\n for n in [4005, 8017, 326205, 886205, 70913241, 2147483647]\\n txt *= \\\"<h3>The Mayan representation for the integer $n is: </h3><table class=\\\\\\\"roundedcorners\\\\\\\"><tr>\\\" *\\n join(map(x -> mayan_glyphs(x[1], x[2]), inttomayan(n))) * \\\"</tr></table>\\\\n\\\\n\\\"\\n end\\n\\n println(parsehtml(txt))\\nend\\n\\ntestmayan()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"mayan_glyphs(x, y) = (x == 0 && y == 0) ? \\\"\\\\n| style=$tdconfig | Θ\\\" : \\\"\\\\n| style=$tdconfig | \\\" * \\\"●\\\" ^ x * \\\"<br>───\\\" ^ y\\n\\ninttomayan(n) = (s = string(n, base=20); map(ch -> reverse(divrem(parse(Int, ch, base=20), 5)), split(s, \\\"\\\")))\\n\\ntableconfig = raw\\\"\\\"\\\" \\\" border: 1px solid DarkOrange; border-radius: 13px; border-spacing: 1; \\\" \\\"\\\"\\\"\\ntdconfig = raw\\\"\\\"\\\" \\\"border: 2px solid DarkOrange; border-radius: 13px; border-bottom: 2px solid DarkOrange; vertical-align: bottom; text-align: center; padding: 10px;\\\" \\\"\\\"\\\"\\n\\nfunction testmayan()\\n txt = \\\"\\\"\\n for n in [4005, 8017, 326205, 886205, 70913241, 2147483647]\\n txt *= \\\"\\\\n'''The Mayan representation for the integer $n is:'''\\\\n\\\" *\\n \\\"{| style=$tableconfig \\\\n|- \\\" *\\n join(map(x -> mayan_glyphs(x[1], x[2]), inttomayan(n))) * \\\"\\\\n|}\\\\n\\\\n\\\"\\n end\\n println(txt)\\nend\\n\\ntestmayan()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"ClearAll[MakeLengthFive, MayanNumeral]\\nMakeLengthFive[ci_String] := Module[{c},\\n c = If[EvenQ[StringLength[ci]], ci <> \\\" \\\", ci];\\n While[StringLength[c] < 5, c = \\\" \\\" <> c <> \\\" \\\"];\\n c\\n ]\\nMayanNumeral[n_Integer?Positive] := Module[{nums, q, r, c},\\n nums = IntegerDigits[n, 20];\\n Row[Table[\\n {q, r} = QuotientRemainder[m, 5];\\n If[{q, r} =!= {0, 0},\\n c = Prepend[ConstantArray[\\\"-----\\\", q], StringJoin[ConstantArray[\\\".\\\", r]]];\\n c = Join[ConstantArray[\\\"\\\", 4 - Length[c]], c];\\n c\\n ,\\n c = {\\\"\\\", \\\"\\\", \\\"\\\", \\\"\\\\[Theta]\\\"}\\n ];\\n Column[MakeLengthFive /@ c, Frame -> True]\\n ,\\n {m, nums}\\n ], Spacer[1]]\\n ]\\nMayanNumeral[4005]\\nMayanNumeral[8017]\\nMayanNumeral[326205]\\nMayanNumeral[886205]\\nMayanNumeral[1337]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import algorithm\\n\\ntype Border = enum UL = \\\"╔\\\", UC = \\\"╦\\\", UR = \\\"╗\\\", LL = \\\"╚\\\", LC = \\\"╩\\\", LR = \\\"╝\\\", HB = \\\"═\\\", VB = \\\"║\\\"\\n\\nconst\\n\\n Mayan = [\\\" \\\", \\\" ∙ \\\", \\\" ∙∙ \\\", \\\"∙∙∙ \\\", \\\"∙∙∙∙\\\"]\\n\\n M0 = \\\" Θ \\\"\\n M5 = \\\"────\\\"\\n\\ntype\\n Digit = range[0..19]\\n Numeral = array[4, string]\\n MayanNumber = seq[Numeral]\\n\\n\\nfunc toBase20(n: Natural): seq[Digit] =\\n ## Return \\\"n\\\" expressed as a sequence of base 20 digits.\\n result.add(n mod 20)\\n var n = n div 20\\n while n != 0:\\n result.add n mod 20\\n n = n div 20\\n result.reverse()\\n\\n\\nfunc toMayanNumeral(d: Digit): Numeral =\\n ## Return the Numeral representing a base 20 digits.\\n\\n result = [Mayan[0], Mayan[0], Mayan[0], Mayan[0]]\\n if d == 0:\\n result[3] = M0\\n return\\n\\n var d = d\\n for i in countdown(3, 0):\\n if d >= 5:\\n result[i] = M5\\n dec d, 5\\n else:\\n result[i] = Mayan[d]\\n break\\n\\n\\nproc draw(mayans: MayanNumber) =\\n ## Draw the representation fo a mayan number.\\n\\n let idx = mayans.high\\n\\n stdout.write UL\\n for i in 0..idx:\\n for j in 0..3: stdout.write HB\\n if i < idx: stdout.write UC else: echo UR\\n\\n for i in 1..4:\\n stdout.write VB\\n for j in 0..idx: stdout.write mayans[j][i-1], VB\\n stdout.write '\\\\n'\\n\\n stdout.write LL\\n for i in 0..idx:\\n for j in 0..3: stdout.write HB\\n if i < idx: stdout.write LC else: echo LR\\n\\n\\nwhen isMainModule:\\n\\n import sequtils, strutils\\n\\n for n in [4005, 8017, 326205, 886205, 1081439556]:\\n echo \\\"Converting $1 to Mayan:\\\".format(n)\\n let digits = n.toBase20()\\n let mayans = digits.mapIt(it.toMayanNumeral)\\n mayans.draw()\\n echo \\\"\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use ntheory qw/fromdigits todigitstring/;\\n\\nmy $t_style = '\\\"border-collapse: separate; text-align: center; border-spacing: 3px 0px;\\\"';\\nmy $c_style = '\\\"border: solid black 2px;background-color: #fffff0;border-bottom: double 6px;'.\\n 'border-radius: 1em;-moz-border-radius: 1em;-webkit-border-radius: 1em;'.\\n 'vertical-align: bottom;width: 3.25em;\\\"';\\n\\nsub cartouches {\\n my($num, @digits) = @_;\\n my $render;\\n for my $d (@digits) {\\n $render .= \\\"| style=$c_style | $_\\\\n\\\" for glyphs(@$d);\\n }\\n chomp $render;\\n join \\\"\\\\n\\\", \\\"\\\\{| style=$t_style\\\", \\\"|+ $num\\\", '|-', $render, '|}'\\n}\\n\\nsub glyphs {\\n return 'Θ' unless $_[0] || $_[1];\\n join '<br>', '●' x $_[0], ('───') x $_[1];\\n}\\n\\nsub mmod {\\n my($n,$b) = @_;\\n my @nb;\\n return 0 unless $n;\\n push @nb, fromdigits($_, $b) for split '', todigitstring($n, $b);\\n return @nb;\\n}\\n\\nfor $n (qw<4005 8017 326205 886205 26960840421>) {\\n push @output, cartouches($n, map { [reverse mmod($_,5)] } mmod($n,20) );\\n}\\n\\nprint join \\\"\\\\n<br>\\\\n\\\", @output;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- demo\\\\rosetta\\\\Mayan_numerals.exw</span>\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (file i/o [when as_html is true])</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><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- false == nasty ascii</span>\\n <span style=\\\"color: #000000;\\\">inline_css</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- also uses wiki tables ({| etc) if false</span>\\n\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">html</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">t_style</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"border-collapse: separate; text-align: center; border-spacing: 3px 0px;\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">c_style</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"border: solid black 2px;background-color: #fffff0;border-bottom: double 6px;\\\"</span><span style=\\\"color: #0000FF;\\\">&</span>\\n <span style=\\\"color: #008000;\\\">\\\"border-radius: 1em;-moz-border-radius: 1em;-webkit-border-radius: 1em;\\\"</span><span style=\\\"color: #0000FF;\\\">&</span>\\n <span style=\\\"color: #008000;\\\">\\\"vertical-align: bottom;width: 3.25em;\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">dot</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"●\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">bar</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"───\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">zero</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"Θ\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">digits</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\" 0 \\\"</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\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">to_seq</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: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</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;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">prepend</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">a</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: #008080;\\\">return</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: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">show_mayan</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: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">to_seq</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</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;\\\">tb</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: #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: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">\\\"------\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">ln</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: #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: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">\\\" \\\"</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><span style=\\\"color: #000000;\\\">tb</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ln</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ln</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ln</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ln</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">tb</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;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">si</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;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">m</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">4</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;\\\">res</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: #000000;\\\">m</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: #000000;\\\">digits</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">si</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;\\\">si</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">5</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">si</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: #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: #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;\\\">\\\"%d\\\\n%s\\\\n\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">a</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;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">else</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;\\\">sequence</span> <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;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">si</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;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">4</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;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">l</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: #000000;\\\">si</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">bar</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">si</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;\\\">dot</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">si</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">):</span><span style=\\\"color: #000000;\\\">zero</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">si</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">5</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">si</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: #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;\\\">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: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"<br>\\\"</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;\\\">inline_css</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;\\\">\\\" <table>\\\\n <caption>%d</caption>\\\\n <tr>\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">a</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;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</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;\\\">\\\" <td>%s</td>\\\\n\\\"</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: #000000;\\\">html</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #008000;\\\">\\\" </tr>\\\\n </table>\\\\n\\\"</span>\\n <span style=\\\"color: #008080;\\\">else</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;\\\">\\\"{| style=\\\\\\\"%s\\\\\\\"\\\\n|+ %d\\\\n|-\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">t_style</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">a</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;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</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;\\\">\\\"| style=\\\\\\\"%s\\\\\\\" | %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">c_style</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: #000000;\\\">html</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #008000;\\\">\\\"|}\\\\n\\\"</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;\\\">procedure</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>Mayan numerals</title>\\n <style>\\n table {%s}\\n td { %s }\\n </style>\\n </head>\\n <body>\\n <h2>Mayan numerals</h2>\\n \\\"\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">wiki_header</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n The following is intended to be pasted into the rosettacode wiki, or similar<br>\\n \\\"\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">html_footer</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n </body>\\n </html>\\n \\\"\\\"\\\"</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;\\\">4005</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8017</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">326205</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">886205</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">26960840421</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">126524984376952</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> <span style=\\\"color: #000000;\\\">show_mayan</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: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</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: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">filename</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"Mayan_numerals.html\\\"</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: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"w\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">inline_css</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</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><span style=\\\"color: #000000;\\\">t_style</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c_style</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;\\\">fn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">wiki_header</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;\\\">fn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">html</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">inline_css</span> <span style=\\\"color: #008080;\\\">then</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: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</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: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">inline_css</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">system</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">filename</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;\\\">\\\"See %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">})</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 <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\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 <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"/* MAYAN NUMERALS IN PL/M\\n\\n THIS PROGRAM RUNS UNDER CP/M AND TAKES THE NUMBER ON THE COMMAND LINE */\\n100H:\\n/* CP/M CALLS */\\nBDOS: PROCEDURE (FN, ARG); DECLARE FN BYTE, ARG ADDRESS; GO TO 5; END BDOS;\\nEXIT: PROCEDURE; CALL BDOS(0,0); END EXIT;\\nPRINT: PROCEDURE (S); DECLARE S ADDRESS; CALL BDOS(9,S); END PRINT;\\n\\n/* CP/M COMMAND LINE */\\nDECLARE CL$PTR ADDRESS INITIAL (80H), CMD$LEN BASED CL$PTR BYTE;\\nDECLARE CMD$PTR ADDRESS INITIAL (81H), CMD$LINE BASED CMD$PTR BYTE;\\n\\n/* THE PIPE AND AT SYMBOLS ARE NOT INCLUDED IN THE PL/M CHARSET */\\nDECLARE PIPE LITERALLY '7CH', AT LITERALLY '40H';\\n\\n/* PRINT BORDER FOR N DIGITS */\\nBORDER: PROCEDURE (N);\\n DECLARE (I, N) BYTE;\\n DO I=1 TO N;\\n CALL PRINT(.'+----$');\\n END;\\n CALL PRINT(.('+',13,10,'$'));\\nEND BORDER;\\n\\n/* PRINT LINE FOR GIVEN DIGIT */\\nDIGIT$LINE: PROCEDURE (LINE, DIGIT);\\n DECLARE (I, LINE, DIGIT, UPB) BYTE;\\n DECLARE PARTS (6) ADDRESS;\\n PARTS(0) = .(PIPE,' $'); PARTS(1) = .(PIPE,' . $');\\n PARTS(2) = .(PIPE,' .. $'); PARTS(3) = .(PIPE,'... $');\\n PARTS(4) = .(PIPE,'....$'); PARTS(5) = .(PIPE,'----$');\\n\\n IF DIGIT = 0 THEN DO;\\n IF LINE = 3 THEN CALL PRINT(.(PIPE,' ',AT,' $'));\\n ELSE CALL PRINT(PARTS(0));\\n END;\\n ELSE DO;\\n UPB = 15-LINE*5;\\n IF DIGIT < UPB THEN CALL PRINT(PARTS(0));\\n ELSE IF DIGIT >= UPB+5 THEN CALL PRINT(PARTS(5));\\n ELSE CALL PRINT(PARTS(DIGIT-UPB));\\n END;\\nEND DIGIT$LINE;\\n\\n/* PRINT LINE GIVEN DIGITS */\\nLINE: PROCEDURE (L, DIGITS, NDIGITS);\\n DECLARE DIGITS ADDRESS;\\n DECLARE (L, I, D BASED DIGITS, NDIGITS) BYTE;\\n DO I=0 TO NDIGITS-1;\\n CALL DIGIT$LINE(L, D(I));\\n END;\\n CALL PRINT(.(PIPE,13,10,'$'));\\nEND LINE;\\n\\n/* CHECK FOR ARGUMENT */\\nIF CMD$LEN < 2 THEN DO;\\n CALL PRINT(.'NO INPUT$');\\n CALL EXIT;\\nEND;\\n\\n/* PREPROCESS COMMAND LINE - TURN EACH ASCII DIGIT INTO 0-9 */\\nDECLARE (I, J) BYTE;\\nDO I = 1 TO CMD$LEN-1;\\n CMD$LINE(I) = CMD$LINE(I) - '0';\\n IF CMD$LINE(I) > 9 THEN DO;\\n /* ERROR MESSAGE FOR INVALID INPUT */\\n CALL PRINT(.'INVALID DIGIT IN INPUT$');\\n CALL EXIT;\\n END;\\nEND;\\n\\n/* CONVERT TO BASE 20 DIGIT BY DIGIT */\\nJ = CMD$LEN-2;\\nDO WHILE J > 0;\\n DO I = 1 TO J;\\n CMD$LINE(I+1) = CMD$LINE(I+1) + 10*(CMD$LINE(I) AND 1);\\n CMD$LINE(I) = CMD$LINE(I) / 2;\\n END;\\n J = J - 1;\\nEND;\\n\\n/* FIND FIRST NONZERO DIGIT */\\nJ = 1;\\nDO WHILE CMD$LINE(J) = 0 AND J < CMD$LEN-1;\\n J = J + 1;\\nEND;\\n\\n/* PRINT CARTOUCHES */\\nDECLARE SIZE BYTE;\\nSIZE = CMD$LEN-J;\\nCALL BORDER(SIZE);\\nDO I=0 TO 3;\\n CALL LINE(I, .CMD$LINE(J), SIZE);\\nEND;\\nCALL BORDER(SIZE);\\n\\nCALL EXIT;\\nEOF\\n\",\n \"language\": \"PL-M\"\n },\n {\n \"code\": \"#START_X=-4 : #START_Y=2\\nDim pl$(5)\\npl$(0)=\\\" Θ \\\" : pl$(1)=\\\" • \\\" : pl$(2)=\\\" •• \\\"\\npl$(3)=\\\"••• \\\" : pl$(4)=\\\"••••\\\" : pl$(5)=\\\"‒‒‒‒\\\"\\nIf OpenConsole() : EnableGraphicalConsole(1) : Else : End 1 : EndIf\\n\\nProcedure.s Dec2Mayan(wert.i)\\n result$=\\\"\\\"\\n If wert=0 : result$=\\\"0;\\\" : EndIf\\n While wert : result$=Str(wert%20)+\\\";\\\"+result$ : wert/20 : Wend\\n ProcedureReturn result$\\nEndProcedure\\n\\nProcedure PutMayan(may$)\\n Shared pl$()\\n X=#START_X+6 : Y=#START_Y\\n For i=1 To CountString(may$,\\\";\\\")\\n m=Val(StringField(may$,i,\\\";\\\"))\\n yp=Y+4\\n If m=0 : ConsoleLocate(X,yp) : Print(pl$(0)) : X+5 : Continue : EndIf\\n While m\\n If m-5>=0\\n ConsoleLocate(X,yp) : Print(pl$(5)) : yp-1 : m-5\\n ElseIf m-4>=0\\n ConsoleLocate(X,yp) : Print(pl$(4)) : yp-1 : m-4\\n ElseIf m-3>=0\\n ConsoleLocate(X,yp) : Print(pl$(3)) : yp-1 : m-3\\n ElseIf m-2>=0\\n ConsoleLocate(X,yp) : Print(pl$(2)) : yp-1 : m-2\\n ElseIf m-1>=0\\n ConsoleLocate(X,yp) : Print(pl$(1)) : yp-1 : m-1\\n EndIf\\n Wend\\n X+5\\n Next\\nEndProcedure\\n\\nProcedure MayanNumerals(may$)\\n X=#START_X : Y=#START_Y\\n m.i=CountString(may$,\\\";\\\")\\n For i=1 To m\\n X+5\\n ConsoleLocate(X,Y) : Print(\\\"╔════╗\\\")\\n ConsoleLocate(X,Y+1) : Print(\\\"║ ║\\\")\\n ConsoleLocate(X,Y+2) : Print(\\\"║ ║\\\")\\n ConsoleLocate(X,Y+3) : Print(\\\"║ ║\\\")\\n ConsoleLocate(X,Y+4) : Print(\\\"║ ║\\\")\\n ConsoleLocate(X,Y+5) : Print(\\\"╚════╝\\\")\\n Next\\n X=#START_X\\n For i=1 To m\\n X+5\\n If i<m\\n ConsoleLocate(X+5,Y) : Print(\\\"╦\\\")\\n ConsoleLocate(X+5,Y+5) : Print(\\\"╩\\\")\\n EndIf\\n Next\\n PutMayan(may$)\\nEndProcedure\\n\\nRepeat\\n ConsoleLocate(0,0) : Print(LSet(\\\" \\\",60))\\n ConsoleLocate(0,0) : Print(\\\"MAYAN: ? \\\") : i$=Input()\\n ClearConsole() : If i$=\\\"\\\" : End : EndIf\\n j$=Dec2Mayan(Val(i$)) : MayanNumerals(j$)\\n ConsoleLocate(0,#START_Y+7) : Print(\\\"Dezimal = \\\"+i$)\\n ConsoleLocate(0,#START_Y+8) : Print(\\\"Vigesimal= \\\"+j$)\\nForEver\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"'''Mayan numerals'''\\n\\nfrom functools import (reduce)\\n\\n\\n# -------------------- MAYAN NUMERALS --------------------\\n\\n# mayanNumerals :: Int -> [[String]]\\ndef mayanNumerals(n):\\n '''Rows of Mayan digit cells,\\n representing the integer n.\\n '''\\n return showIntAtBase(20)(\\n mayanDigit\\n )(n)([])\\n\\n\\n# mayanDigit :: Int -> [String]\\ndef mayanDigit(n):\\n '''List of strings representing a Mayan digit.'''\\n if 0 < n:\\n r = n % 5\\n return [\\n (['●' * r] if 0 < r else []) +\\n (['━━'] * (n // 5))\\n ]\\n else:\\n return ['Θ']\\n\\n\\n# mayanFramed :: Int -> String\\ndef mayanFramed(n):\\n '''Mayan integer in the form of a\\n Wiki table source string.\\n '''\\n return 'Mayan ' + str(n) + ':\\\\n\\\\n' + (\\n wikiTable({\\n 'class': 'wikitable',\\n 'style': cssFromDict({\\n 'text-align': 'center',\\n 'background-color': '#F0EDDE',\\n 'color': '#605B4B',\\n 'border': '2px solid silver'\\n }),\\n 'colwidth': '3em',\\n 'cell': 'vertical-align: bottom;'\\n })([[\\n '<br>'.join(col) for col in mayanNumerals(n)\\n ]])\\n )\\n\\n\\n# ------------------------- TEST -------------------------\\n\\n# main :: IO ()\\ndef main():\\n '''Mayan numeral representations of various integers'''\\n print(\\n main.__doc__ + ':\\\\n\\\\n' +\\n '\\\\n'.join(mayanFramed(n) for n in [\\n 4005, 8017, 326205, 886205, 1081439556,\\n 1000000, 1000000000\\n ])\\n )\\n\\n\\n# ------------------------ BOXES -------------------------\\n\\n# wikiTable :: Dict -> [[a]] -> String\\ndef wikiTable(opts):\\n '''Source text for wiki-table display of rows of cells,\\n using CSS key-value pairs in the opts dictionary.\\n '''\\n def colWidth():\\n return 'width:' + opts['colwidth'] + '; ' if (\\n 'colwidth' in opts\\n ) else ''\\n\\n def cellStyle():\\n return opts['cell'] if 'cell' in opts else ''\\n\\n return lambda rows: '{| ' + reduce(\\n lambda a, k: (\\n a + k + '=\\\"' + opts[k] + '\\\" ' if (\\n k in opts\\n ) else a\\n ),\\n ['class', 'style'],\\n ''\\n ) + '\\\\n' + '\\\\n|-\\\\n'.join(\\n '\\\\n'.join(\\n ('|' if (\\n 0 != i and ('cell' not in opts)\\n ) else (\\n '|style=\\\"' + colWidth() + cellStyle() + '\\\"|'\\n )) + (\\n str(x) or ' '\\n ) for x in row\\n ) for i, row in enumerate(rows)\\n ) + '\\\\n|}\\\\n\\\\n'\\n\\n\\n# ----------------------- GENERIC ------------------------\\n\\n# cssFromDict :: Dict -> String\\ndef cssFromDict(dct):\\n '''CSS string from a dictinary of key-value pairs'''\\n return reduce(\\n lambda a, k: a + k + ':' + dct[k] + '; ',\\n dct.keys(),\\n ''\\n )\\n\\n\\n# showIntAtBase :: Int -> (Int -> String)\\n# -> Int -> String -> String\\ndef showIntAtBase(base):\\n '''String representation of an integer in a given base,\\n using a supplied function for the string\\n representation of digits.\\n '''\\n def wrap(toChr, n, rs):\\n def go(nd, r):\\n n, d = nd\\n r_ = toChr(d) + r\\n return go(divmod(n, base), r_) if 0 != n else r_\\n return 'unsupported base' if 1 >= base else (\\n 'negative number' if 0 > n else (\\n go(divmod(n, base), rs))\\n )\\n return lambda toChr: lambda n: lambda rs: (\\n wrap(toChr, n, rs)\\n )\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"### Formatting ###\\nmy $t-style = '\\\"border-collapse: separate; text-align: center; border-spacing: 3px 0px;\\\"';\\nmy $c-style = '\\\"border: solid black 2px;background-color: #fffff0;border-bottom: double 6px;'~\\n 'border-radius: 1em;-moz-border-radius: 1em;-webkit-border-radius: 1em;'~\\n 'vertical-align: bottom;width: 3.25em;\\\"';\\nmy $joiner = '<br>';\\n\\nsub display ($num, @digits) { join \\\"\\\\n\\\", \\\"\\\\{| style=$t-style\\\", \\\"|+ $num\\\", '|-', (|@digits.map: {\\\"| style=$c-style | $_\\\"}), '|}' }\\n\\n### Logic ###\\n\\nsub mayan ($int) { $int.polymod(20 xx *).reverse.map: *.polymod(5) }\\n\\nmy @output = <4005 8017 326205 886205 16160025 1081439556 503491211079>.map: {\\n display $_, .&mayan.map: { [flat '' xx 3, '●' x .[0], '───' xx .[1], ('Θ' if !.[0,1].sum)].tail(4).join: $joiner }\\n}\\n\\nsay @output.join: \\\"\\\\n$joiner\\\\n\\\";\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"### Formatting ###\\nuse Terminal::Boxer;\\nmy $joiner = \\\"\\\\n\\\";\\n\\nsub display ($num, @digits) { \\\"$num\\\\n\\\" ~ dd-box( :6cw, :4ch, @digits ) }\\n\\n### Logic ###\\n\\nsub mayan ($int) { $int.polymod(20 xx *).reverse.map: *.polymod(5) }\\n\\nmy @output = <4005 8017 326205 886205 16160025 1081439556 503491211079>.map: {\\n display $_, .&mayan.map: { [flat '' xx 3, '●' x .[0], '────' xx .[1], ('Θ' if !.[0,1].sum)].tail(4).join: $joiner }\\n}\\n\\nsay @output.join: $joiner;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program converts decimal numbers to the Mayan numbering system (with cartouches).*/\\nparse arg $ /*obtain optional arguments from the CL*/\\nif $='' then $= 4005 8017 326205 886205, /*Not specified? Then use the default.*/\\n 172037122592320200101 /*Morse code for MAYAN; egg is a blank.*/\\n\\n do j=1 for words($) /*convert each of the numbers specified*/\\n #= word($, j) /*extract a number from (possible) list*/\\n say\\n say center('converting the decimal number ' # \\\" to a Mayan number:\\\", 90, '─')\\n say\\n call $MAYAN # '(overlap)' /*invoke the $MAYAN (REXX) subroutine.*/\\n say\\n end /*j*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"numbers = ARGV.map(&:to_i)\\nif numbers.length == 0\\n puts\\n puts(\\\"usage: #{File.basename(__FILE__)} number...\\\")\\n exit\\nend\\n\\ndef maya_print(number)\\n digits5s1s = number.to_s(20).chars.map { |ch| ch.to_i(20) }.map { |dig| dig.divmod(5) }\\n puts(('+----' * digits5s1s.length) + '+')\\n 3.downto(0) do |row|\\n digits5s1s.each do |d5s1s|\\n if row < d5s1s[0]\\n print('|----')\\n elsif row == d5s1s[0]\\n print(\\\"|#{[(d5s1s[0] == 0 ? ' @ ' : ' '), ' . ', ' .. ', '... ', '....'][d5s1s[1]]}\\\")\\n else\\n print('| ')\\n end\\n end\\n puts('|')\\n end\\n puts(('+----' * digits5s1s.length) + '+')\\nend\\n\\nnumbers.each do |num|\\n puts(num)\\n maya_print(num)\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"const ONE: &str = \\\"●\\\";\\nconst FIVE: &str = \\\"——\\\";\\nconst ZERO: &str = \\\"Θ\\\";\\n\\nfn main() {\\n println!(\\\"{}\\\", mayan(4005));\\n println!(\\\"{}\\\", mayan(8017));\\n println!(\\\"{}\\\", mayan(326_205));\\n println!(\\\"{}\\\", mayan(886_205));\\n println!(\\\"{}\\\", mayan(69));\\n println!(\\\"{}\\\", mayan(420));\\n println!(\\\"{}\\\", mayan(1_063_715_456));\\n}\\n\\nfn mayan(dec: i64) -> String {\\n let mut digits = vec![];\\n let mut num = dec;\\n while num > 0 {\\n digits.push(num % 20);\\n num /= 20;\\n }\\n digits = digits.into_iter().rev().collect();\\n let mut boxes = vec![\\\"\\\".to_string(); 6];\\n let n = digits.len();\\n for (i, digit) in digits.iter().enumerate() {\\n if i == 0 {\\n boxes[0] = \\\"┏━━━━\\\".to_string();\\n if i == n - 1 {\\n boxes[0] += \\\"┓\\\";\\n }\\n } else if i == n - 1 {\\n boxes[0] += \\\"┳━━━━┓\\\";\\n } else {\\n boxes[0] += \\\"┳━━━━\\\";\\n }\\n for j in 1..5 {\\n boxes[j] += \\\"┃\\\";\\n let elem = 0.max(digit - (4 - j as i64) * 5);\\n if elem >= 5 {\\n boxes[j] += &format!(\\\"{: ^4}\\\", FIVE);\\n } else if elem > 0 {\\n boxes[j] += &format!(\\\"{: ^4}\\\", ONE.repeat(elem as usize % 15));\\n } else if j == 4 {\\n boxes[j] += &format!(\\\"{: ^4}\\\", ZERO);\\n } else {\\n boxes[j] += &\\\" \\\";\\n }\\n if i == n - 1 {\\n boxes[j] += \\\"┃\\\";\\n }\\n }\\n if i == 0 {\\n boxes[5] = \\\"┗━━━━\\\".to_string();\\n if i == n - 1 {\\n boxes[5] += \\\"┛\\\";\\n }\\n } else if i == n - 1 {\\n boxes[5] += \\\"┻━━━━┛\\\";\\n } else {\\n boxes[5] += \\\"┻━━━━\\\";\\n }\\n }\\n\\n let mut mayan = format!(\\\"Mayan {}:\\\\n\\\", dec);\\n for b in boxes {\\n mayan += &(b + \\\"\\\\n\\\");\\n }\\n mayan\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Conv\\n\\nvar ul = \\\"╔\\\"\\nvar uc = \\\"╦\\\"\\nvar ur = \\\"╗\\\"\\nvar ll = \\\"╚\\\"\\nvar lc = \\\"╩\\\"\\nvar lr = \\\"╝\\\"\\nvar hb = \\\"═\\\"\\nvar vb = \\\"║\\\"\\n\\nvar mayan= [\\n \\\" \\\",\\n \\\" ∙ \\\",\\n \\\" ∙∙ \\\",\\n \\\"∙∙∙ \\\",\\n \\\"∙∙∙∙\\\"\\n]\\n\\nvar m0 = \\\" Θ \\\"\\nvar m5 = \\\"────\\\"\\n\\nvar dec2vig = Fn.new { |n| Conv.itoa(n, 20).map { |c| Conv.atoi(c, 20) }.toList }\\n\\nvar vig2quin = Fn.new { |n|\\n if (n >= 20) Fiber.abort(\\\"Cant't convert a number >= 20.\\\")\\n var res = [mayan[0], mayan[0], mayan[0], mayan[0]]\\n if (n == 0) {\\n res[3] = m0\\n return res\\n }\\n var fives = (n/5).floor\\n var rem = n % 5\\n res[3-fives] = mayan[rem]\\n for (i in 3...3-fives) res[i] = m5\\n return res\\n}\\n\\nvar draw = Fn.new { |mayans|\\n var lm = mayans.count\\n System.write(ul)\\n for (i in 0...lm) {\\n for (j in 0..3) System.write(hb)\\n if (i < lm - 1) {\\n System.write(uc)\\n } else {\\n System.print(ur)\\n }\\n }\\n for (i in 1..4) {\\n System.write(vb)\\n for (j in 0...lm) {\\n System.write(mayans[j][i-1])\\n System.write(vb)\\n }\\n System.print()\\n }\\n System.write(ll)\\n for (i in 0...lm) {\\n for (j in 0..3) System.write(hb)\\n if (i < lm - 1) {\\n System.write(lc)\\n } else {\\n System.print(lr)\\n }\\n }\\n}\\n\\nvar numbers = [4005, 8017, 326205, 886205, 1081439556]\\nfor (n in numbers) {\\n System.print(\\\"Converting %(n) to Mayan:\\\")\\n var vigs = dec2vig.call(n)\\n var mayans = vigs.map { |vig| vig2quin.call(vig) }.toList\\n draw.call(mayans)\\n System.print()\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"var zero=\\\" \\\\u0398 \\\",one=\\\"\\\\u2219\\\", five=String(\\\"\\\\u2500\\\"*4,\\\"\\\\n\\\"), fill=\\\" \\\\n\\\";\\nvar ds=T(\\\" \\\",\\\" \\\\u2219 \\\",\\\" \\\\u2219\\\\u2219 \\\",\\\"\\\\u2219\\\\u2219\\\\u2219 \\\",\\\"\\\\u2219\\\\u2219\\\\u2219\\\\u2219\\\");\\nfcn mayan(m){ //--> lists of lists of strings (each line of tile)\\n m.toString(20).pump(List,fcn(m){\\t\\t// 4,005 --> \\\"a05\\\"\\n bars,dots := m.toInt(20).divr(5);\\t\\t// \\\"a\\\" --> 10 --> (2,0)\\n if(0==bars==dots) return(String(fill*3, zero).split(\\\"\\\\n\\\")); // 0\\n String(fill*(3-bars), ds[dots],\\\"\\\\n\\\", five*bars)[0,-1].split(\\\"\\\\n\\\") // tile\\n })\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"var vbar=\\\"\\\\u2551\\\", hbar=\\\"\\\\u2550\\\"*4, ut=(hbar+\\\"\\\\u2566\\\"), bt=(hbar+\\\"\\\\u2569\\\");\\nfcn displayMayan(m){ // eg 11 is ( ( ),( * ),(----),(----) )\\n println(\\\"\\\\u2554\\\", ut*(m.len()-1), hbar,\\\"\\\\u2557\\\"); // top\\n foreach n in (4){ println(vbar, m.apply(\\\"get\\\",n).concat(vbar), vbar) }\\n println(\\\"\\\\u255a\\\", bt*(m.len()-1), hbar,\\\"\\\\u255d\\\"); // bottom\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"foreach m in (T(4_005, 8_017, 326_205, 886_205, 503_491_211_079, 88_637_341)){\\n println(\\\"\\\\n%,d:\\\".fmt(m)); mayan(m):displayMayan(_);\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"var [const]\\n t_style=0''\\\"border-collapse: separate; text-align: center; border-spacing: 3px 0px;\\\"',\\n c_style=0''\\\"border: solid black 2px;background-color: #fffff0;border-bottom: double 6px;'\\n 0''border-radius: 1em;-moz-border-radius: 1em;-webkit-border-radius: 1em;'\\n 0''vertical-align: bottom;width: 3.25em;\\\"';\\nvar [const] dot=\\\"\\\\u25cf\\\", bar=\\\"\\\\u2500\\\\u2500\\\\u2500!\\\", zero=\\\" \\\\u0398 \\\";\\n\\nfcn mayan(m){ m.toString(20).pump(List,fcn(m){ m.toInt(20).divr(5) }) }\\nfcn display(num,digits){\\n \\\"{| style=%s\\\\n|+ %s \\\\n|-\\\\n%s|}\\\".fmt(t_style,num,\\n digits.split().pump(String, \\\"| style=%s | %s\\\\n\\\".fmt.fp(c_style)) );\\n}\\n\\nT(88637341,26960840421).apply(\\n fcn(m){\\n mayan(m).pump(String,\\n\\t fcn([(bars,dots)]){\\n\\t (if(bars or dots) (dot*dots + \\\"!\\\" + bar*bars)[0,-1] else zero)\\n\\t + \\\" \\\"\\n\\t }).replace(\\\"!\\\",\\\"<br>\\\") : display(m,_)\\n })\\n.concat(\\\"\\\\n<br>\\\\n\\\").println();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Mayan-numerals"}}},{"rowIdx":475,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Maze_generation\nnote: Games\n","language":"00-META"},{"code":"<br>\n;Task:\nGenerate and show a maze, using the simple [[wp:Maze_generation_algorithm#Depth-first_search|Depth-first search]] algorithm.\n\n<!-- BEGIN TEXT FROM WIKIPEDIA -->\n#Start at a random cell.\n#Mark the current cell as visited, and get a list of its neighbors. For each neighbor, starting with a randomly selected neighbor:\n#:If that neighbor hasn't been visited, remove the wall between this cell and that neighbor, and then recurse with that neighbor as the current cell.\n<!-- END TEXT FROM WIKIPEDIA -->\n<br><br>\n\n; Related tasks\n* [[Maze solving]].\n<br><br>\n\n","language":"00-TASK"},{"code":"F make_maze(w = 16, h = 8)\n V vis = [[0] * w [+] [1]] * h [+] [[1] * (w + 1)]\n V ver = [[‘| ’] * w [+] [String(‘|’)]] * h [+] [[String]()]\n V hor = [[‘+--’] * w [+] [String(‘+’)]] * (h + 1)\n\n F walk(Int x, Int y) -> N\n @vis[y][x] = 1\n V d = [(x - 1, y), (x, y + 1), (x + 1, y), (x, y - 1)]\n random:shuffle(&d)\n L(=xx, =yy) d\n I yy == -1\n yy = @vis.len - 1\n I xx == -1\n xx = @vis[0].len - 1\n I @vis[yy][xx]\n L.continue\n I xx == x\n @hor[max(y, yy)][x] = ‘+ ’\n I yy == y\n @ver[y][max(x, xx)] = ‘ ’\n @walk(xx, yy)\n\n walk(random:(w), random:(h))\n\n V s = ‘’\n L(a, b) zip(hor, ver)\n s ‘’= (a [+] [String(\"\\n\")] + b [+] [String(\"\\n\")]).join(‘’)\n R s\n\nprint(make_maze())\n","language":"11l"},{"code":"DEFINE TOP=\"0\"\nDEFINE RIGHT=\"1\"\nDEFINE BOTTOM=\"2\"\nDEFINE LEFT=\"3\"\nDEFINE WIDTH=\"160\"\nDEFINE HEIGHT=\"96\"\n\nDEFINE STACK_SIZE=\"5000\"\nBYTE ARRAY stack(STACK_SIZE)\nINT stackSize\n\nPROC InitStack()\n stackSize=0\nRETURN\n\nBYTE FUNC IsEmpty()\n IF stackSize=0 THEN\n RETURN (1)\n FI\nRETURN (0)\n\nBYTE FUNC IsFull()\n IF stackSize>=STACK_SIZE THEN\n RETURN (1)\n FI\nRETURN (0)\n\nPROC Push(BYTE x,y)\n IF IsFull() THEN Break() RETURN FI\n stack(stackSize)=x stackSize==+1\n stack(stackSize)=y stackSize==+1\nRETURN\n\nPROC Pop(BYTE POINTER x,y)\n IF IsEmpty() THEN Break() RETURN FI\n stackSize==-1 y^=stack(stackSize)\n stackSize==-1 x^=stack(stackSize)\nRETURN\n\nPROC FillScreen()\n BYTE POINTER ptr ;pointer to the screen memory\n INT screenSize=[3840]\n\n ptr=PeekC(88)\n SetBlock(ptr,screenSize,$55)\n\n Color=0\n Plot(0,HEIGHT-1) DrawTo(WIDTH-1,HEIGHT-1) DrawTo(WIDTH-1,0)\nRETURN\n\nPROC GetNeighbors(BYTE x,y BYTE ARRAY n BYTE POINTER count)\n DEFINE WALL=\"1\"\n\n count^=0\n IF y>2 AND Locate(x,y-2)=WALL THEN\n n(count^)=TOP count^==+1\n FI\n IF x<WIDTH-3 AND Locate(x+2,y)=WALL THEN\n n(count^)=RIGHT count^==+1\n FI\n IF y<HEIGHT-3 AND Locate(x,y+2)=WALL THEN\n n(count^)=BOTTOM count^==+1\n FI\n IF x>2 AND Locate(x-2,y)=WALL THEN\n n(count^)=LEFT count^==+1\n FI\nRETURN\n\nPROC Maze(BYTE x,y)\n BYTE ARRAY stack,neighbors\n BYTE dir,nCount\n\n FillScreen()\n\n Color=2\n InitStack()\n Push(x,y)\n WHILE IsEmpty()=0\n DO\n Pop(@x,@y)\n GetNeighbors(x,y,neighbors,@nCount)\n IF nCount>0 THEN\n Push(x,y)\n Plot(x,y)\n dir=neighbors(Rand(nCount))\n IF dir=TOP THEN\n y==-2\n ELSEIF dir=RIGHT THEN\n x==+2\n ELSEIF dir=BOTTOM THEN\n y==+2\n ELSE\n x==-2\n FI\n DrawTo(x,y)\n Push(x,y)\n FI\n OD\nRETURN\n\nPROC Main()\n BYTE CH=$02FC,COLOR0=$02C4,COLOR1=$02C5\n BYTE x,y\n\n Graphics(7+16)\n COLOR0=$0A\n COLOR1=$04\n\n x=Rand((WIDTH RSH 1)-1) LSH 1+1\n y=Rand((HEIGHT RSH 1)-1) LSH 1+1\n Maze(x,y)\n\n DO UNTIL CH#$FF OD\n CH=$FF\nRETURN\n","language":"Action-"},{"code":"generic\n Height : Positive;\n Width : Positive;\npackage Mazes is\n\n type Maze_Grid is private;\n\n procedure Initialize (Maze : in out Maze_Grid);\n\n procedure Put (Item : Maze_Grid);\n\nprivate\n\n type Directions is (North, South, West, East);\n\n type Cell_Walls is array (Directions) of Boolean;\n type Cells is record\n Walls : Cell_Walls := (others => True);\n Visited : Boolean := False;\n end record;\n\n subtype Height_Type is Positive range 1 .. Height;\n subtype Width_Type is Positive range 1 .. Width;\n\n type Maze_Grid is array (Height_Type, Width_Type) of Cells;\n\nend Mazes;\n","language":"Ada"},{"code":"with Ada.Numerics.Discrete_Random;\nwith Ada.Text_IO;\n\npackage body Mazes is\n package RNG is new Ada.Numerics.Discrete_Random (Positive);\n package Random_Direction is new Ada.Numerics.Discrete_Random (Directions);\n\n Generator : RNG.Generator;\n Dir_Generator : Random_Direction.Generator;\n\n function \"-\" (Dir : Directions) return Directions is\n begin\n case Dir is\n when North =>\n return South;\n when South =>\n return North;\n when East =>\n return West;\n when West =>\n return East;\n end case;\n end \"-\";\n\n procedure Move\n (Row : in out Height_Type;\n Column : in out Width_Type;\n Direction : Directions;\n Valid_Move : out Boolean)\n is\n begin\n Valid_Move := False;\n case Direction is\n when North =>\n if Row > Height_Type'First then\n Valid_Move := True;\n Row := Row - 1;\n end if;\n when East =>\n if Column < Width_Type'Last then\n Valid_Move := True;\n Column := Column + 1;\n end if;\n when West =>\n if Column > Width_Type'First then\n Valid_Move := True;\n Column := Column - 1;\n end if;\n when South =>\n if Row < Height_Type'Last then\n Valid_Move := True;\n Row := Row + 1;\n end if;\n end case;\n end Move;\n\n procedure Depth_First_Algorithm\n (Maze : in out Maze_Grid;\n Row : Height_Type;\n Column : Width_Type)\n is\n Next_Row : Height_Type;\n Next_Column : Width_Type;\n Next_Direction : Directions;\n Valid_Direction : Boolean;\n Tested_Wall : array (Directions) of Boolean := (others => False);\n All_Tested : Boolean;\n begin\n -- mark as visited\n Maze (Row, Column).Visited := True;\n loop\n -- use random direction\n loop\n Next_Direction := Random_Direction.Random (Dir_Generator);\n exit when not Tested_Wall (Next_Direction);\n end loop;\n Next_Row := Row;\n Next_Column := Column;\n Move (Next_Row, Next_Column, Next_Direction, Valid_Direction);\n if Valid_Direction then\n if not Maze (Next_Row, Next_Column).Visited then\n -- connect the two cells\n Maze (Row, Column).Walls (Next_Direction) :=\n False;\n Maze (Next_Row, Next_Column).Walls (-Next_Direction) :=\n False;\n Depth_First_Algorithm (Maze, Next_Row, Next_Column);\n end if;\n end if;\n Tested_Wall (Next_Direction) := True;\n -- continue as long as there are unvisited neighbours left\n All_Tested := True;\n for D in Directions loop\n All_Tested := All_Tested and Tested_Wall (D);\n end loop;\n -- all directions are either visited (from here,\n -- or previously visited), or invalid.\n exit when All_Tested;\n end loop;\n end Depth_First_Algorithm;\n\n procedure Initialize (Maze : in out Maze_Grid) is\n Row, Column : Positive;\n begin\n -- initialize random generators\n RNG.Reset (Generator);\n Random_Direction.Reset (Dir_Generator);\n -- choose starting cell\n Row := RNG.Random (Generator) mod Height + 1;\n Column := RNG.Random (Generator) mod Width + 1;\n Ada.Text_IO.Put_Line\n (\"Starting generation at \" &\n Positive'Image (Row) &\n \" x\" &\n Positive'Image (Column));\n Depth_First_Algorithm (Maze, Row, Column);\n end Initialize;\n\n procedure Put (Item : Maze_Grid) is\n begin\n for Row in Item'Range (1) loop\n if Row = Item'First (1) then\n Ada.Text_IO.Put ('+');\n for Col in Item'Range (2) loop\n if Item (Row, Col).Walls (North) then\n Ada.Text_IO.Put (\"---+\");\n else\n Ada.Text_IO.Put (\" +\");\n end if;\n end loop;\n Ada.Text_IO.New_Line;\n end if;\n for Col in Item'Range (2) loop\n if Col = Item'First (2) then\n if Item (Row, Col).Walls (West) then\n Ada.Text_IO.Put ('|');\n else\n Ada.Text_IO.Put (' ');\n end if;\n elsif Item (Row, Col).Walls (West)\n and then Item (Row, Col - 1).Walls (East)\n then\n Ada.Text_IO.Put ('|');\n elsif Item (Row, Col).Walls (West)\n or else Item (Row, Col - 1).Walls (East)\n then\n Ada.Text_IO.Put ('>');\n else\n Ada.Text_IO.Put (' ');\n end if;\n if Item (Row, Col).Visited then\n Ada.Text_IO.Put (\" \");\n else\n Ada.Text_IO.Put (\"???\");\n end if;\n end loop;\n if Item (Row, Item'Last (2)).Walls (East) then\n Ada.Text_IO.Put_Line (\"|\");\n else\n Ada.Text_IO.Put_Line (\" \");\n end if;\n Ada.Text_IO.Put ('+');\n for Col in Item'Range (2) loop\n if Item (Row, Col).Walls (South) then\n Ada.Text_IO.Put (\"---+\");\n else\n Ada.Text_IO.Put (\" +\");\n end if;\n end loop;\n Ada.Text_IO.New_Line;\n end loop;\n end Put;\nend Mazes;\n","language":"Ada"},{"code":"with Mazes;\nprocedure Main is\n package Small_Mazes is new Mazes (Height => 8, Width => 11);\n My_Maze : Small_Mazes.Maze_Grid;\nbegin\n Small_Mazes.Initialize (My_Maze);\n Small_Mazes.Put (My_Maze);\nend Main;\n","language":"Ada"},{"code":"grid_maze(data b, integer N)\n{\n data d;\n\n N.times(bb_cast, d, \"+---\");\n bb_cast(d, \"+\\n\");\n\n N.times(bb_cast, d, \"| * \");\n bb_cast(d, \"|\\n\");\n\n N.times(bb_copy, b, d);\n\n b_size(d, N * 4 + 2);\n\n bb_copy(b, d);\n}\n\nvoid\nwalk_cell(data b, integer N, line_size, x, y, list x_offsets, y_offsets)\n{\n integer i, p, q, r;\n\n b_replace(b, y + x, ' ');\n\n r = drand(3);\n\n i = 0;\n while (i < 4) {\n p = x + x_offsets[q = (r + i) & 3];\n q = y + y_offsets[q];\n\n if (-1 < p && p < line_size\n && -1 < q && q < line_size * (N * 2 + 1)) {\n if (b[q + p] == '*') {\n walk_cell(b, N, line_size, p, q, x_offsets, y_offsets);\n b[(q + y) / 2 + (p + x) / 2] = ' ';\n if (p == x) {\n b[(q + y) / 2 + p - 1] = ' ';\n b[(q + y) / 2 + p + 1] = ' ';\n }\n }\n }\n\n i += 1;\n }\n}\n\nwalk_maze(data b, integer N)\n{\n integer line_size, x, y;\n list x_offsets, y_offsets;\n\n line_size = N * 4 + 1 + 1;\n\n l_bill(x_offsets, 0, 4, 0, -4, 0);\n l_bill(y_offsets, 0, 0, line_size * 2, 0, line_size * -2);\n\n x = drand(N - 1) * 4 + 2;\n y = line_size * (drand(N - 1) * 2 + 1);\n\n walk_cell(b, N, line_size, x, y, x_offsets, y_offsets);\n}\n\nmain(void)\n{\n data b;\n\n grid_maze(b, 10);\n walk_maze(b, 10);\n\n o_(b);\n\n 0;\n}\n","language":"Aime"},{"code":"This example shows how to use GNU APL scripting.\n\n#!/usr/local/bin/apl --script --\n ⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝\n⍝ ⍝\n⍝ mazeGen.apl 2022-01-07 19:47:35 (GMT-8) ⍝\n⍝ ⍝\n ⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝\n\n∇initPRNG\n ⍝⍝ Seed the internal PRNG used by APL ? operator\n ⎕RL ← +/ ⎕TS ⍝⍝ Not great... but good enough\n∇\n\n∇offs ← cellTo dir\n ⍝⍝ Return the offset (row col) to cell which lies in compass (dir)\n offs ← ∊((¯1 0)(0 1)(1 0)(0 ¯1))[('nesw'⍳dir)]\n∇\n\n∇doMaze rc\n ⍝⍝ Main function\n 0 0 mazeGen rc ⍝⍝ Do the maze gen\n m ⍝⍝ output result\n∇\n\n∇b ← m isVisited coord;mr;mc\n →( ∨/ (coord[1] < 1) (coord[2] < 1) )/yes\n →( ∨/ (coord > ⌊(⍴m)÷2) )/yes\n b ← ' ' ∊ m[2×coord[1];2×coord[2]]\n →0\nyes:\n b←1\n∇\n\n∇c mazeGen sz ;dirs;c;dir;cell;next\n →(c≠(0 0))/gen\ninit:\n c ← ?sz[1],?sz[2]\n m ← mazeInit sz\ngen:\n cell ← c\n dirs ← 'nesw'[4?4]\n m[2×c[1];2×c[2]] ← ' ' ⍝ mark cell as visited\ndir1:\n dir ← dirs[1]\n next ← cell + cellTo dir\n →(m isVisited next)/dir2\n m ← m openWall cell dir\n next mazeGen sz\ndir2:\n dir ← dirs[2]\n next ← cell + cellTo dir\n →(m isVisited next)/dir3\n m ← m openWall cell dir\n next mazeGen sz\ndir3:\n dir ← dirs[3]\n next ← cell + cellTo dir\n →(m isVisited next)/dir4\n m ← m openWall cell dir\n next mazeGen sz\ndir4:\n dir ← dirs[4]\n next ← cell + cellTo dir\n →(m isVisited next)/done\n m ← m openWall cell dir\n next mazeGen sz\ndone:\n∇\n\n∇m ← mazeInit sz;rows;cols;r\n ⍝⍝ Init an ASCII grid which\n ⍝⍝ has all closed and unvisited cells:\n ⍝⍝\n ⍝⍝ +-+\n ⍝⍝ |.|\n ⍝⍝ +-+\n ⍝⍝\n ⍝⍝ @param sz - tuple (rows cols)\n ⍝⍝ @return m - ASCII representation of (rows × cols) closed maze cells\n ⍝⍝⍝⍝\n\n initPRNG\n (rows cols) ← sz\n r ← ∊ (cols ⍴ ⊂\"+-\" ),\"+\"\n r ← r,∊ (cols ⍴ ⊂\"|.\" ),\"|\"\n r ← (rows,(⍴r))⍴r\n r ← ((2×rows),(1+2×cols))⍴r\n r ← r⍪ (∊ (cols ⍴ ⊂\"+-\" ),\"+\")\n m ← r\n∇\n\n∇r ← m openWall cellAndDir ;ri;ci;rw;cw;row;col;dir\n (row col dir) ← ∊cellAndDir\n ri ← 2×row\n ci ← 2×col\n (rw cw) ← (ri ci) + cellTo dir\n m[rw;cw] ← ' ' ⍝ open wall in (dir)\n r ← m\n∇\n\n⎕IO←1\n\ndoMaze 9 9\n)OFF\n","language":"APL"},{"code":"; Initially build the board\nWidth\t:= 11\nHeight\t:= 8\nLoop % height*2+1\n{\n\tOuter := A_Index\n\tLoop % Width\n\t\tmaze .= Outer & 1 ? \"+-\" : \"|0\"\n\tmaze .= (Outer & 1 ? \"+\" : \"|\") \"`n\"\n}\nStringTrimRight, maze, maze, 1 ; removes trailing newline\nClipboard := Walk(maze)\n\nWalk(S, x=0, y=0){\n\tIf !x{\t; --Start at a random cell...\n\t\tStringReplace, junk, S, `n,,UseErrorLevel ; Calculate rows\n\t\tRandom, y, 1, ErrorLevel//2\n\t\tRandom, x, 1, InStr(S, \"`n\")//2-1 ; Calculate height\n\t}\n\t\n\t; --Obtain a list of its neighbors...\n\tneighbors := x \",\" y+1 \"`n\" x \",\" y-1 \"`n\" x+1 \",\" y \"`n\" x-1 \",\" y\n\t; --Randomize the list...\n\tSort neighbors, random\n\t\n\t; --Then for each neighbor...\n\tLoop Parse, neighbors, `n\n\t{\n\t\tpC := InStr(A_LoopField, \",\"), x2 := SubStr(A_LoopField, 1, pC-1), y2 := SubStr(A_LoopField, pC+1)\n\t\t; If it has not been visited...\n\t\tIf GetChar(S, 2*x2, 2*y2) = \"0\"{\n\t\t\t; Mark it as visited...\n\t\t\tS := ChangeChar(s, 2*x2, 2*y2, \" \")\n\t\t\t; Remove the wall between this cell and the neighbor...\n\t\t\tS := ChangeChar(S, x+x2, y+y2, \" \")\n\t\t\t; Then recurse with the neighbor as the current cell\n\t\t\tS := Walk(S, x2, y2)\n\t\t}\n\t}\n\treturn S\n}\n\t\n; Change a character in a string using x and y coordinates\nChangeChar(s, x, y, c){\n\tLoop Parse, s, `n\n\t{\n\t\tIf (A_Index = Y)\n\t\t\tLoop Parse, A_LoopField\n\t\t\t\tIf (A_Index = x)\n\t\t\t\t\tout .= c\n\t\t\t\tElse\tout .= A_LoopField\n\t\tElse out .= A_LoopField\n\t\tout .= \"`n\"\n\t}\n\tStringTrimRight, out, out, 1\n\treturn out\n}\n\n; retrieve a character in a string using x and y coordinates\nGetChar(s, x, y, n=1){\n\tx*=n, y*=n\n\tLoop Parse, s, `n\n\t\tIf (A_Index = Y)\n\t\t\treturn SubStr(A_LoopField, x, 1)\n}\n","language":"AutoHotkey"},{"code":"#!/usr/bin/awk -f\n\n# Remember: AWK is 1-based, for better or worse.\n\nBEGIN {\n # The maze dimensions.\n width = 20; # Global\n height = 20; # Global\n resetMaze();\n\n # Some constants.\n top = 1;\n bottom = 2;\n left = 3;\n right = 4;\n\n # Randomize the PRNG.\n randomize();\n\n # Visit all the cells starting at a random point.\n visitCell(getRandX(), getRandY());\n\n # Show the result.\n printMaze();\n}\n\n# Wander through the maze removing walls as we go.\nfunction visitCell(x, y, dirList, dir, nx, ny, ndir, pi) {\n setVisited(x, y); # This cell has been visited.\n\n # Visit neighbors in a random order.\n dirList = getRandDirList();\n for (dir = 1; dir <= 4; dir++) {\n # Get coordinates of a random neighbor (next in random direction list).\n ndir = substr(dirList, dir, 1);\n nx = getNextX(x, ndir);\n ny = getNextY(y, ndir);\n\n # Visit an unvisited neighbor, removing the separating walls.\n if (wasVisited(nx, ny) == 0) {\n rmWall(x, y, ndir);\n rmWall(nx, ny, getOppositeDir(ndir));\n visitCell(nx, ny)\n }\n }\n}\n\n# Display the text-mode maze.\nfunction printMaze( x, y, r, w) {\n for (y = 1; y <= height; y++) {\n for (pass = 1; pass <= 2; pass++) { # Go over each row twice: top, middle\n for (x = 1; x <= width; x++) {\n if (pass == 1) { # top\n printf(\"+\");\n printf(hasWall(x, y, top) == 1 ? \"---\" : \" \");\n if (x == width) printf(\"+\");\n }\n else if (pass == 2) { # left, right\n printf(hasWall(x, y, left) == 1 ? \"|\" : \" \");\n printf(\" \");\n if (x == width) printf(hasWall(x, y, right) == 1 ? \"|\" : \" \");\n }\n }\n print;\n }\n }\n for (x = 1; x <= width; x++) printf(\"+---\"); # bottom row\n print(\"+\"); # bottom right corner\n}\n\n# Given a direction, get its opposite.\nfunction getOppositeDir(d) {\n if (d == top) return bottom;\n if (d == bottom) return top;\n if (d == left) return right;\n if (d == right) return left;\n}\n\n# Build a list (string) of the four directions in random order.\nfunction getRandDirList( dirList, randDir, nx, ny, idx) {\n dirList = \"\";\n while (length(dirList) < 4) {\n randDir = getRandDir();\n if (!index(dirList, randDir)) {\n dirList = dirList randDir;\n }\n }\n return dirList;\n}\n\n# Get x coordinate of the neighbor in a given a direction.\nfunction getNextX(x, dir) {\n if (dir == left) x = x - 1;\n if (dir == right) x = x + 1;\n if (!isGoodXY(x, 1)) return -1; # Off the edge.\n return x;\n}\n\n# Get y coordinate of the neighbor in a given a direction.\nfunction getNextY(y, dir) {\n if (dir == top) y = y - 1;\n if (dir == bottom) y = y + 1;\n if (!isGoodXY(1, y)) return -1; # Off the edge.\n return y;\n}\n\n# Mark a cell as visited.\nfunction setVisited(x, y, cell) {\n cell = getCell(x, y);\n if (cell == -1) return;\n cell = substr(cell, 1, 4) \"1\"; # walls plus visited\n setCell(x, y, cell);\n}\n\n# Get the visited state of a cell.\nfunction wasVisited(x, y, cell) {\n cell = getCell(x, y);\n if (cell == -1) return 1; # Off edges already visited.\n return substr(getCell(x,y), 5, 1);\n}\n\n# Remove a cell's wall in a given direction.\nfunction rmWall(x, y, d, i, oldCell, newCell) {\n oldCell = getCell(x, y);\n if (oldCell == -1) return;\n newCell = \"\";\n for (i = 1; i <= 4; i++) { # Ugly as concat of two substrings and a constant?.\n newCell = newCell (i == d ? \"0\" : substr(oldCell, i, 1));\n }\n newCell = newCell wasVisited(x, y);\n setCell(x, y, newCell);\n}\n\n# Determine if a cell has a wall in a given direction.\nfunction hasWall(x, y, d, cell) {\n cell = getCell(x, y);\n if (cell == -1) return 1; # Cells off edge always have all walls.\n return substr(getCell(x, y), d, 1);\n}\n\n# Plunk a cell into the maze.\nfunction setCell(x, y, cell, idx) {\n if (!isGoodXY(x, y)) return;\n maze[x, y] = cell\n}\n\n# Get a cell from the maze.\nfunction getCell(x, y, idx) {\n if (!isGoodXY(x, y)) return -1; # Bad cell marker.\n return maze[x, y];\n}\n\n# Are the given coordinates in the maze?\nfunction isGoodXY(x, y) {\n if (x < 1 || x > width) return 0;\n if (y < 1 || y > height) return 0;\n return 1;\n}\n\n# Build the empty maze.\nfunction resetMaze( x, y) {\n delete maze;\n for (y = 1; y <= height; y++) {\n for (x = 1; x <= width; x++) {\n maze[x, y] = \"11110\"; # walls (up, down, left, right) and visited state.\n }\n }\n}\n\n# Random things properly scaled.\n\nfunction getRandX() {\n return 1 + int(rand() * width);\n}\n\nfunction getRandY() {\n return 1 +int(rand() * height);\n}\n\nfunction getRandDir() {\n return 1 + int(rand() * 4);\n}\n\nfunction randomize() {\n \"echo $RANDOM\" | getline t;\n srand(t);\n}\n","language":"AWK"},{"code":"global size_x, size_y\nsize_x = 25\nsize_y = 15\n\nglobal char_wall, char_room\nchar_wall = \"#\"\nchar_room = \" \"\n\nglobal directions_permutations\ndirections_permutations = {{0, 1, 2, 3}, {0, 1, 3, 2}, {0, 2, 1, 3}, {0, 2, 3, 1}, {0, 3, 1, 2}, {0, 3, 2, 1}, {1, 0, 2, 3}, {1, 0, 3, 2}, {1, 2, 0, 3}, {1, 2, 3, 0}, {1, 3, 0, 2}, {1, 3, 2, 0}, {2, 0, 1, 3}, {2, 0, 3, 1}, {2, 1, 0, 3}, {2, 1, 3, 0}, {2, 3, 0, 1}, {2, 3, 1, 0}, {3, 0, 1, 2}, {3, 0, 2, 1}, {3, 1, 0, 2}, {3, 1, 2, 0}, {3, 2, 0, 1}, {3, 2, 1, 0}}\n\nglobal maze\ndim maze[size_x * 2 + 1][size_y * 2 + 1]\nfor i = 0 to size_x * 2\n for j = 0 to size_y * 2\n maze[i][j] = char_wall\n next j\nnext i\n\ncall make_room(int(rand * size_x), int(rand * size_y))\n\ncall draw_maze()\n\nend\n\nsubroutine make_room(room_x, room_y)\n maze[1 + room_x * 2][1 + room_y * 2] = char_room\n random_directions_index = rand * 24\n for i = 0 to 3\n random_direction = directions_permutations[random_directions_index][i]\n if ((random_direction / 2) mod 2) < 1 then\n dx = (random_direction mod 2) * 2 - 1\n dy = 0\n else\n dx = 0\n dy = (random_direction mod 2) * 2 - 1\n end if\n if can_dig(room_x + dx, room_y + dy) then\n call make_door(room_x, room_y, dx, dy)\n call make_room(room_x + dx, room_y + dy)\n end if\n next i\nend subroutine\n\nfunction can_dig(room_x, room_y)\n if (room_x < 0) or (room_x >= size_x) or (room_y < 0) or (room_y >= size_y) then\n can_dig = false\n else\n can_dig = (maze[1 + room_x * 2][1 + room_y * 2] = char_wall)\n end if\nend function\n\nsubroutine make_door(room_x, room_y, dx, dy)\n maze[1 + room_x * 2 + dx][1 + room_y * 2 + dy] = char_room\nend subroutine\n\nsubroutine draw_maze()\n for i = 0 to size_y * 2\n for j = 0 to size_x * 2\n print maze[j][i];\n next j\n print\n next i\nend subroutine\n","language":"BASIC256"},{"code":":amaze Rows Cols [wall char]\n:: A stack-less, iterative, depth-first maze generator in native WinNT batch.\n:: Rows and Cols must each be >1 and Rows*Cols cannot exceed 2096.\n:: Default wall character is #, [wall char] is used if provided.\n\n@ECHO OFF\nSETLOCAL EnableDelayedExpansion\n\n:: check for valid input, else GOTO :help\nIF /I \"%~2\" EQU \"\" GOTO :amaze_help\nFOR /F \"tokens=* delims=0123456789\" %%A IN (\"%~1%~2\") DO IF \"%%~A\" NEQ \"\" GOTO :amaze_help\nSET /A \"rows=%~1, cols=%~2, mTmp=rows*cols\"\nIF !rows! LSS 2 GOTO :amaze_help\nIF !cols! LSS 2 GOTO :amaze_help\nIF !mTmp! GTR 2096 GOTO :amaze_help\n\n:: set map characters and use 1st character of %3 for wall, if defined\nSET \"wall=#\"\nSET \"hall= \"\nSET \"crumb=.\"\nIF \"%~3\" NEQ \"\" SET \"wall=%~3\"\nSET \"wall=!wall:~0,1!\"\n\n:: assign width, height, cursor position, loop count, and offsets for NSEW\nSET /A \"cnt=0, wide=cols*2-1, high=rows*2-1, size=wide*high, N=wide*-2, S=wide*2, E=2, W=-2\"\n\n:: different random entrance points\n:: ...on top\n:: SET /A \"start=(!RANDOM! %% cols)*2\"\n:: ...on bottom\n:: SET /A \"start=size-(!RANDOM! %% cols)*2-1\"\n:: ...on top or bottom\n:: SET /A ch=cols*2, ch=!RANDOM! %% ch\n:: IF !ch! GEQ !cols! ( SET /A \"start=size-(ch-cols)*2-1\"\n:: ) ELSE SET /A start=ch*2\n:: random entrance inside maze\nSET /A \"start=(!RANDOM! %% cols*2)+(!RANDOM! %% rows*2)*wide\"\nSET /A \"curPos=start, cTmp=curPos+1, loops=cols*rows*2+1\"\n\n:: fill the maze with 8186 wall characters, clip to size, and open 1st cell\nSET \"mz=!wall!\"\nFOR /L %%A IN (1,1,6) DO SET mz=!mz!!mz!!mz!!mz!\nSET bdr=!mz:~-%wide%!\nSET mz=!mz:~3!!mz:~3!\nSET mz=!mz:~-%size%!\nSET mz=!mz:~0,%curPos%!!hall!!mz:~%cTmp%!\n\n:: iterate #cells*2+1 steps of random depth-first search\nFOR /L %%@ IN (1,1,%loops%) DO (\n\tSET \"rand=\" & SET \"crmPos=\"\n\tREM set values for NSEW cell and wall positions\n\tSET /A \"rCnt=rTmp=0, cTmp=curPos+1, np=curPos+N, sp=curPos+S, ep=curPos+E, wp=curPos+W, wChk=curPos/wide*wide, eChk=wChk+wide, nw=curPos-wide, sw=curPos+wide, ew=curPos+1, ww=curPos-1\"\n\tREM examine adjacent cells, build direction list, and find last crumb position\n\tFOR /F \"tokens=1-8\" %%A IN (\"!np! !sp! !ep! !wp! !nw! !sw! !ew! !ww!\") DO (\n\t\tIF !np! GEQ 0 IF \"!mz:~%%A,1!\" EQU \"!wall!\" ( SET /A rCnt+=1 & SET \"rand=n !rand!\"\n\t\t) ELSE IF \"!mz:~%%E,1!\" EQU \"!crumb!\" SET /A crmPos=np, cw=nw\n\t\tIF !sp! LEQ !size! IF \"!mz:~%%B,1!\" EQU \"!wall!\" ( SET /A rCnt+=1 & SET \"rand=s !rand!\"\n\t\t) ELSE IF \"!mz:~%%F,1!\" EQU \"!crumb!\" SET /A crmPos=sp, cw=sw\n\t\tIF !ep! LEQ !eChk! IF \"!mz:~%%C,1!\" EQU \"!wall!\" ( SET /A rCnt+=1 & SET \"rand=e !rand!\"\n\t\t) ELSE IF \"!mz:~%%G,1!\" EQU \"!crumb!\" SET /A crmPos=ep, cw=ew\n\t\tIF !wp! GEQ !wChk! IF \"!mz:~%%D,1!\" EQU \"!wall!\" ( SET /A rCnt+=1 & SET \"rand=w !rand!\"\n\t\t) ELSE IF \"!mz:~%%H,1!\" EQU \"!crumb!\" SET /A crmPos=wp, cw=ww\n\t)\n\tIF DEFINED rand ( REM adjacent unvisited cell is available\n\t\tSET /A rCnt=!RANDOM! %% rCnt\n\t\tFOR %%A IN (!rand!) DO ( REM pick random cell + wall\n\t\t\tIF !rTmp! EQU !rCnt! SET /A \"curPos=!%%Ap!, cTmp=curPos+1, mw=!%%Aw!, mTmp=mw+1\"\n\t\t\tSET /A rTmp+=1\n\t\t)\n\t\tREM write the 2 new characters into the maze\n\t\tFOR /F \"tokens=1-4\" %%A IN (\"!mw! !mTmp! !curPos! !cTmp!\") DO (\n\t\t\tSET \"mz=!mz:~0,%%A!!crumb!!mz:~%%B!\"\n\t\t\tSET \"mz=!mz:~0,%%C!!hall!!mz:~%%D!\"\n\t\t)\n\t) ELSE IF DEFINED crmPos ( REM follow the crumbs backward\n\t\tSET /A mTmp=cw+1\n\t\tREM erase the crumb character and set new cursor position\n\t\tFOR /F \"tokens=1-2\" %%A IN (\"!cw! !mTmp!\") DO SET \"mz=!mz:~0,%%A!!hall!!mz:~%%B!\"\n\t\tSET \"curPos=!crmPos!\"\n\t)\n)\nSET /A open=cols/2*2, mTmp=open+1\nECHO !wall!!bdr:~0,%open%!!hall!!bdr:~%mTmp%!!wall!\nFOR /L %%A IN (0,!wide!,!size!) DO IF %%A LSS !size! ECHO !wall!!mz:~%%A,%wide%!!wall!\nECHO !wall!!bdr:~0,%open%!!hall!!bdr:~%mTmp%!!wall!\nENDLOCAL\nEXIT /B 0\n\n:amaze_help\nECHO Usage: %~0 Rows Cols [wall char]\nECHO Rows^>1, Cols^>1, and Rows*Cols^<=2096\nECHO Example: %~0 11 39 @\nENDLOCAL\nEXIT /B 0\n","language":"Batch-File"},{"code":" MazeWidth% = 11\n MazeHeight% = 9\n MazeCell% = 50\n\n VDU 23,22,MazeWidth%*MazeCell%/2+3;MazeHeight%*MazeCell%/2+3;8,16,16,128\n VDU 23,23,3;0;0;0; : REM Line thickness\n PROCgeneratemaze(Maze&(), MazeWidth%, MazeHeight%, MazeCell%)\n END\n\n DEF PROCgeneratemaze(RETURN m&(), w%, h%, s%)\n LOCAL x%, y%\n DIM m&(w%, h%)\n FOR y% = 0 TO h%\n LINE 0,y%*s%,w%*s%,y%*s%\n NEXT\n FOR x% = 0 TO w%\n LINE x%*s%,0,x%*s%,h%*s%\n NEXT\n GCOL 15\n PROCcell(m&(), RND(w%)-1, y% = RND(h%)-1, w%, h%, s%)\n ENDPROC\n\n DEF PROCcell(m&(), x%, y%, w%, h%, s%)\n LOCAL i%, p%, q%, r%\n m&(x%,y%) OR= &40 : REM Mark visited\n r% = RND(4)\n FOR i% = r% TO r%+3\n CASE i% MOD 4 OF\n WHEN 0: p% = x%-1 : q% = y%\n WHEN 1: p% = x%+1 : q% = y%\n WHEN 2: p% = x% : q% = y%-1\n WHEN 3: p% = x% : q% = y%+1\n ENDCASE\n IF p% >= 0 IF p% < w% IF q% >= 0 IF q% < h% IF m&(p%,q%) < &40 THEN\n IF p% > x% m&(p%,q%) OR= 1 : LINE p%*s%,y%*s%+4,p%*s%,(y%+1)*s%-4\n IF q% > y% m&(p%,q%) OR= 2 : LINE x%*s%+4,q%*s%,(x%+1)*s%-4,q%*s%\n IF x% > p% m&(x%,y%) OR= 1 : LINE x%*s%,y%*s%+4,x%*s%,(y%+1)*s%-4\n IF y% > q% m&(x%,y%) OR= 2 : LINE x%*s%+4,y%*s%,(x%+1)*s%-4,y%*s%\n PROCcell(m&(), p%, q%, w%, h%, s%)\n ENDIF\n NEXT\n ENDPROC\n","language":"BBC-BASIC"},{"code":"45*28*10p00p020p030p006p0>20g30g00g*+::\"P\"%\\\"P\"/6+gv>$\\1v@v1::\\+g02+*g00+g03-\\<\n0_ 1!%4+1\\-\\0!::\\-\\2%2:p<pv0<< v0p+6/\"P\"\\%\"P\":\\+4%4<^<v-<$>+2%\\1-*20g+\\1+4%::v^\n#| +2%\\1-*30g+\\1\\40g1-:v0+v2?1#<v>+:00g%!55+*>:#0>#,_^>:!|>\\#%\"P\"v#:*+*g00g0<>1\n02!:++`\\0\\`-1g01:\\+`\\< !46v3<^$$<^1,g2+1%2/2,g1+1<v%g00:\\<*g01,<>:30p\\:20p:v^3g\n0#$g#<1#<-#<`#<\\#<0#<^#_^/>#1+#4<>\"P\"%\\\"P\"/6+g:2%^!>,1-:#v_$55+^|$$ \"JH\" $$>#<0\n::\"P\"%\\\"P\"/6+g40p\\40g+\\:#^\"P\"%#\\<^ ::$_,#!0#:<*\"|\"<^,\" _\"<:g000 <> /6+g4/2%+#^_\n","language":"Befunge"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <locale.h>\n\n#define DOUBLE_SPACE 1\n\n#if DOUBLE_SPACE\n#\tdefine SPC \" \"\n#else\n#\tdefine SPC \" \"\n#endif\n\nwchar_t glyph[] = L\"\"SPC\"│││─┘┐┤─└┌├─┴┬┼\"SPC\"┆┆┆┄╯╮ ┄╰╭ ┄\";\n\ntypedef unsigned char byte;\nenum { N = 1, S = 2, W = 4, E = 8, V = 16 };\n\nbyte **cell;\nint w, h, avail;\n#define each(i, x, y) for (i = x; i <= y; i++)\n\nint irand(int n)\n{\n\tint r, rmax = n * (RAND_MAX / n);\n\twhile ((r = rand()) >= rmax);\n\treturn r / (RAND_MAX/n);\n}\n\nvoid show()\n{\n\tint i, j, c;\n\teach(i, 0, 2 * h) {\n\t\teach(j, 0, 2 * w) {\n\t\t\tc = cell[i][j];\n\t\t\tif (c > V) printf(\"\\033[31m\");\n\t\t\tprintf(\"%lc\", glyph[c]);\n\t\t\tif (c > V) printf(\"\\033[m\");\n\t\t}\n\t\tputchar('\\n');\n\t}\n}\n\ninline int max(int a, int b) { return a >= b ? a : b; }\ninline int min(int a, int b) { return b >= a ? a : b; }\n\nstatic int dirs[4][2] = {{-2, 0}, {0, 2}, {2, 0}, {0, -2}};\nvoid walk(int x, int y)\n{\n\tint i, t, x1, y1, d[4] = { 0, 1, 2, 3 };\n\n\tcell[y][x] |= V;\n\tavail--;\n\n\tfor (x1 = 3; x1; x1--)\n\t\tif (x1 != (y1 = irand(x1 + 1)))\n\t\t\ti = d[x1], d[x1] = d[y1], d[y1] = i;\n\n\tfor (i = 0; avail && i < 4; i++) {\n\t\tx1 = x + dirs[ d[i] ][0], y1 = y + dirs[ d[i] ][1];\n\n\t\tif (cell[y1][x1] & V) continue;\n\n\t\t/* break walls */\n\t\tif (x1 == x) {\n\t\t\tt = (y + y1) / 2;\n\t\t\tcell[t][x+1] &= ~W, cell[t][x] &= ~(E|W), cell[t][x-1] &= ~E;\n\t\t} else if (y1 == y) {\n\t\t\tt = (x + x1)/2;\n\t\t\tcell[y-1][t] &= ~S, cell[y][t] &= ~(N|S), cell[y+1][t] &= ~N;\n\t\t}\n\t\twalk(x1, y1);\n\t}\n}\n\nint solve(int x, int y, int tox, int toy)\n{\n\tint i, t, x1, y1;\n\n\tcell[y][x] |= V;\n\tif (x == tox && y == toy) return 1;\n\n\teach(i, 0, 3) {\n\t\tx1 = x + dirs[i][0], y1 = y + dirs[i][1];\n\t\tif (cell[y1][x1]) continue;\n\n\t\t/* mark path */\n\t\tif (x1 == x) {\n\t\t\tt = (y + y1)/2;\n\t\t\tif (cell[t][x] || !solve(x1, y1, tox, toy)) continue;\n\n\t\t\tcell[t-1][x] |= S, cell[t][x] |= V|N|S, cell[t+1][x] |= N;\n\t\t} else if (y1 == y) {\n\t\t\tt = (x + x1)/2;\n\t\t\tif (cell[y][t] || !solve(x1, y1, tox, toy)) continue;\n\n\t\t\tcell[y][t-1] |= E, cell[y][t] |= V|E|W, cell[y][t+1] |= W;\n\t\t}\n\t\treturn 1;\n\t}\n\n\t/* backtrack */\n\tcell[y][x] &= ~V;\n\treturn 0;\n}\n\nvoid make_maze()\n{\n\tint i, j;\n\tint h2 = 2 * h + 2, w2 = 2 * w + 2;\n\tbyte **p;\n\n\tp = calloc(sizeof(byte*) * (h2 + 2) + w2 * h2 + 1, 1);\n\n\tp[1] = (byte*)(p + h2 + 2) + 1;\n\teach(i, 2, h2) p[i] = p[i-1] + w2;\n\tp[0] = p[h2];\n\tcell = &p[1];\n\n\teach(i, -1, 2 * h + 1) cell[i][-1] = cell[i][w2 - 1] = V;\n\teach(j, 0, 2 * w) cell[-1][j] = cell[h2 - 1][j] = V;\n\teach(i, 0, h) each(j, 0, 2 * w) cell[2*i][j] |= E|W;\n\teach(i, 0, 2 * h) each(j, 0, w) cell[i][2*j] |= N|S;\n\teach(j, 0, 2 * w) cell[0][j] &= ~N, cell[2*h][j] &= ~S;\n\teach(i, 0, 2 * h) cell[i][0] &= ~W, cell[i][2*w] &= ~E;\n\n\tavail = w * h;\n\twalk(irand(2) * 2 + 1, irand(h) * 2 + 1);\n\n\t/* reset visited marker (it's also used by path finder) */\n\teach(i, 0, 2 * h) each(j, 0, 2 * w) cell[i][j] &= ~V;\n\tsolve(1, 1, 2 * w - 1, 2 * h - 1);\n\n\tshow();\n}\n\nint main(int c, char **v)\n{\n\tsetlocale(LC_ALL, \"\");\n\tif (c < 2 || (w = atoi(v[1])) <= 0) w = 16;\n\tif (c < 3 || (h = atoi(v[2])) <= 0) h = 8;\n\n\tmake_maze();\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <windows.h>\n#include <iostream>\n#include <string>\n\n//--------------------------------------------------------------------------------------------------\nusing namespace std;\n\n//--------------------------------------------------------------------------------------------------\nconst int BMP_SIZE = 512, CELL_SIZE = 8;\n\n//--------------------------------------------------------------------------------------------------\nenum directions { NONE, NOR = 1, EAS = 2, SOU = 4, WES = 8 };\n\n//--------------------------------------------------------------------------------------------------\nclass myBitmap\n{\npublic:\n myBitmap() : pen( NULL ) {}\n ~myBitmap()\n {\n\tDeleteObject( pen );\n\tDeleteDC( hdc );\n\tDeleteObject( bmp );\n }\n\n bool create( int w, int h )\n {\n\tBITMAPINFO\tbi;\n\tZeroMemory( &bi, sizeof( bi ) );\n\tbi.bmiHeader.biSize\t = sizeof( bi.bmiHeader );\n\tbi.bmiHeader.biBitCount\t = sizeof( DWORD ) * 8;\n\tbi.bmiHeader.biCompression = BI_RGB;\n\tbi.bmiHeader.biPlanes\t = 1;\n\tbi.bmiHeader.biWidth\t = w;\n\tbi.bmiHeader.biHeight\t = -h;\n\n\tHDC dc = GetDC( GetConsoleWindow() );\n\tbmp = CreateDIBSection( dc, &bi, DIB_RGB_COLORS, &pBits, NULL, 0 );\n\tif( !bmp ) return false;\n\n\thdc = CreateCompatibleDC( dc );\n\tSelectObject( hdc, bmp );\n\tReleaseDC( GetConsoleWindow(), dc );\n\twidth = w; height = h;\n\n\treturn true;\n }\n\n void clear()\n {\n\tZeroMemory( pBits, width * height * sizeof( DWORD ) );\n }\n\n void setPenColor( DWORD clr )\n {\n\tif( pen ) DeleteObject( pen );\n\tpen = CreatePen( PS_SOLID, 1, clr );\n\tSelectObject( hdc, pen );\n }\n\n void saveBitmap( string path )\n {\n\tBITMAPFILEHEADER fileheader;\n\tBITMAPINFO\t infoheader;\n\tBITMAP\t\t bitmap;\n\tDWORD\t\t wb;\n\n\tGetObject( bmp, sizeof( bitmap ), &bitmap );\n\n\tDWORD* dwpBits = new DWORD[bitmap.bmWidth * bitmap.bmHeight];\n\tZeroMemory( dwpBits, bitmap.bmWidth * bitmap.bmHeight * sizeof( DWORD ) );\n\tZeroMemory( &infoheader, sizeof( BITMAPINFO ) );\n\tZeroMemory( &fileheader, sizeof( BITMAPFILEHEADER ) );\n\n\tinfoheader.bmiHeader.biBitCount = sizeof( DWORD ) * 8;\n\tinfoheader.bmiHeader.biCompression = BI_RGB;\n\tinfoheader.bmiHeader.biPlanes = 1;\n\tinfoheader.bmiHeader.biSize = sizeof( infoheader.bmiHeader );\n\tinfoheader.bmiHeader.biHeight = bitmap.bmHeight;\n\tinfoheader.bmiHeader.biWidth = bitmap.bmWidth;\n\tinfoheader.bmiHeader.biSizeImage = bitmap.bmWidth * bitmap.bmHeight * sizeof( DWORD );\n\n\tfileheader.bfType = 0x4D42;\n\tfileheader.bfOffBits = sizeof( infoheader.bmiHeader ) + sizeof( BITMAPFILEHEADER );\n\tfileheader.bfSize = fileheader.bfOffBits + infoheader.bmiHeader.biSizeImage;\n\n\tGetDIBits( hdc, bmp, 0, height, ( LPVOID )dwpBits, &infoheader, DIB_RGB_COLORS );\n\n\tHANDLE file = CreateFile( path.c_str(), GENERIC_WRITE, 0, NULL, CREATE_ALWAYS, FILE_ATTRIBUTE_NORMAL, NULL );\n\tWriteFile( file, &fileheader, sizeof( BITMAPFILEHEADER ), &wb, NULL );\n\tWriteFile( file, &infoheader.bmiHeader, sizeof( infoheader.bmiHeader ), &wb, NULL );\n\tWriteFile( file, dwpBits, bitmap.bmWidth * bitmap.bmHeight * 4, &wb, NULL );\n\tCloseHandle( file );\n\n\tdelete [] dwpBits;\n }\n\n HDC getDC() const { return hdc; }\n int getWidth() const { return width; }\n int getHeight() const { return height; }\n\nprivate:\n HBITMAP bmp;\n HDC\t hdc;\n HPEN pen;\n void *pBits;\n int\t width, height;\n};\n//--------------------------------------------------------------------------------------------------\nclass mazeGenerator\n{\npublic:\n mazeGenerator()\n {\n\t_world = 0;\n\t_bmp.create( BMP_SIZE, BMP_SIZE );\n\t_bmp.setPenColor( RGB( 0, 255, 0 ) );\n }\n\n ~mazeGenerator() { killArray(); }\n\n void create( int side )\n {\n\t_s = side;\n\tgenerate();\n\tdisplay();\n }\n\nprivate:\n void generate()\n {\n\tkillArray();\n\t_world = new BYTE[_s * _s];\n\tZeroMemory( _world, _s * _s );\n\t_ptX = rand() % _s; _ptY = rand() % _s;\n\tcarve();\n }\n\n void carve()\n {\n\twhile( true )\n\t{\n\t int d = getDirection();\n\t if( d < NOR ) return;\n\n\t switch( d )\n\t {\n\t case NOR:\n\t _world[_ptX + _s * _ptY] |= NOR; _ptY--;\n\t\t _world[_ptX + _s * _ptY] = SOU | SOU << 4;\n\t\tbreak;\n\t case EAS:\n\t\t _world[_ptX + _s * _ptY] |= EAS; _ptX++;\n\t\t _world[_ptX + _s * _ptY] = WES | WES << 4;\n\t\tbreak;\n\t\tcase SOU:\n\t\t _world[_ptX + _s * _ptY] |= SOU; _ptY++;\n\t\t _world[_ptX + _s * _ptY] = NOR | NOR << 4;\n\t\tbreak;\n\t\tcase WES:\n\t\t _world[_ptX + _s * _ptY] |= WES; _ptX--;\n\t\t _world[_ptX + _s * _ptY] = EAS | EAS << 4;\n\t }\n\t}\n }\n\n void display()\n {\n\t_bmp.clear();\n\tHDC dc = _bmp.getDC();\n\tfor( int y = 0; y < _s; y++ )\n\t{\n\t int yy = y * _s;\n\t for( int x = 0; x < _s; x++ )\n\t {\n\t\tBYTE b = _world[x + yy];\n\t\tint nx = x * CELL_SIZE,\n\t\t ny = y * CELL_SIZE;\n\t\t\t\t\n\t\tif( !( b & NOR ) )\n\t\t{\n\t\t MoveToEx( dc, nx, ny, NULL );\n\t\t LineTo( dc, nx + CELL_SIZE + 1, ny );\n\t\t}\n\t\tif( !( b & EAS ) )\n\t\t{\n\t\t MoveToEx( dc, nx + CELL_SIZE, ny, NULL );\n\t\t LineTo( dc, nx + CELL_SIZE, ny + CELL_SIZE + 1 );\n\t\t}\n\t\tif( !( b & SOU ) )\n\t\t{\n\t\t MoveToEx( dc, nx, ny + CELL_SIZE, NULL );\n\t\t LineTo( dc, nx + CELL_SIZE + 1, ny + CELL_SIZE );\n\t\t}\n\t\tif( !( b & WES ) )\n\t\t{\n\t\t MoveToEx( dc, nx, ny, NULL );\n\t\t LineTo( dc, nx, ny + CELL_SIZE + 1 );\n\t\t}\n\t }\n\t}\n\n\t//_bmp.saveBitmap( \"f:\\\\rc\\\\maze.bmp\" );\n\tBitBlt( GetDC( GetConsoleWindow() ), 10, 60, BMP_SIZE, BMP_SIZE, _bmp.getDC(), 0, 0, SRCCOPY );\n }\n\n int getDirection()\n {\n\tint d = 1 << rand() % 4;\n\twhile( true )\n\t{\n\t for( int x = 0; x < 4; x++ )\n\t {\n\t\tif( testDir( d ) ) return d;\n\t\td <<= 1;\n\t\tif( d > 8 ) d = 1;\n\t }\n\t d = ( _world[_ptX + _s * _ptY] & 0xf0 ) >> 4;\n\t if( !d ) return -1;\n\t switch( d )\n\t {\n\t\tcase NOR: _ptY--; break;\n\t\tcase EAS: _ptX++; break;\n\t\tcase SOU: _ptY++; break;\n\t\tcase WES: _ptX--; break;\n\t }\n d = 1 << rand() % 4;\n\t}\n }\n\n bool testDir( int d )\n {\n\tswitch( d )\n\t{\n\t case NOR: return ( _ptY - 1 > -1 && !_world[_ptX + _s * ( _ptY - 1 )] );\n\t case EAS: return ( _ptX + 1 < _s && !_world[_ptX + 1 + _s * _ptY] );\n\t case SOU: return ( _ptY + 1 < _s && !_world[_ptX + _s * ( _ptY + 1 )] );\n\t case WES: return ( _ptX - 1 > -1 && !_world[_ptX - 1 + _s * _ptY] );\n\t}\n\treturn false;\n }\n\n void killArray() { if( _world ) delete [] _world; }\n\n BYTE* _world;\n int _s, _ptX, _ptY;\n myBitmap _bmp;\n};\n//--------------------------------------------------------------------------------------------------\nint main( int argc, char* argv[] )\n{\n ShowWindow( GetConsoleWindow(), SW_MAXIMIZE );\n srand( GetTickCount() );\n\n mazeGenerator mg;\n int s;\n while( true )\n {\n\tcout << \"Enter the maze size, an odd number bigger than 2 ( 0 to QUIT ): \"; cin >> s;\n\tif( !s ) return 0;\n\tif( !( s & 1 ) ) s++;\n\tif( s >= 3 ) mg.create( s );\n\tcout << endl;\n\tsystem( \"pause\" );\n\tsystem( \"cls\" );\n }\n return 0;\n}\n//--------------------------------------------------------------------------------------------------\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Diagnostics;\nusing System.Linq;\nusing System.Text;\nusing System.Drawing;\n\nnamespace MazeGeneration\n{\n public static class Extensions\n {\n public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> source, Random rng)\n {\n var e = source.ToArray();\n for (var i = e.Length - 1; i >= 0; i--)\n {\n var swapIndex = rng.Next(i + 1);\n yield return e[swapIndex];\n e[swapIndex] = e[i];\n }\n }\n\n public static CellState OppositeWall(this CellState orig)\n {\n return (CellState)(((int) orig >> 2) | ((int) orig << 2)) & CellState.Initial;\n }\n\n public static bool HasFlag(this CellState cs,CellState flag)\n {\n return ((int)cs & (int)flag) != 0;\n }\n }\n\n [Flags]\n public enum CellState\n {\n Top = 1,\n Right = 2,\n Bottom = 4,\n Left = 8,\n Visited = 128,\n Initial = Top | Right | Bottom | Left,\n }\n\n public struct RemoveWallAction\n {\n public Point Neighbour;\n public CellState Wall;\n }\n\n public class Maze\n {\n private readonly CellState[,] _cells;\n private readonly int _width;\n private readonly int _height;\n private readonly Random _rng;\n\n public Maze(int width, int height)\n {\n _width = width;\n _height = height;\n _cells = new CellState[width, height];\n for(var x=0; x<width; x++)\n for(var y=0; y<height; y++)\n _cells[x, y] = CellState.Initial;\n _rng = new Random();\n VisitCell(_rng.Next(width), _rng.Next(height));\n }\n\n public CellState this[int x, int y]\n {\n get { return _cells[x,y]; }\n set { _cells[x,y] = value; }\n }\n\n public IEnumerable<RemoveWallAction> GetNeighbours(Point p)\n {\n if (p.X > 0) yield return new RemoveWallAction {Neighbour = new Point(p.X - 1, p.Y), Wall = CellState.Left};\n if (p.Y > 0) yield return new RemoveWallAction {Neighbour = new Point(p.X, p.Y - 1), Wall = CellState.Top};\n if (p.X < _width-1) yield return new RemoveWallAction {Neighbour = new Point(p.X + 1, p.Y), Wall = CellState.Right};\n if (p.Y < _height-1) yield return new RemoveWallAction {Neighbour = new Point(p.X, p.Y + 1), Wall = CellState.Bottom};\n }\n\n public void VisitCell(int x, int y)\n {\n this[x,y] |= CellState.Visited;\n foreach (var p in GetNeighbours(new Point(x, y)).Shuffle(_rng).Where(z => !(this[z.Neighbour.X, z.Neighbour.Y].HasFlag(CellState.Visited))))\n {\n this[x, y] -= p.Wall;\n this[p.Neighbour.X, p.Neighbour.Y] -= p.Wall.OppositeWall();\n VisitCell(p.Neighbour.X, p.Neighbour.Y);\n }\n }\n\n public void Display()\n {\n var firstLine = string.Empty;\n for (var y = 0; y < _height; y++)\n {\n var sbTop = new StringBuilder();\n var sbMid = new StringBuilder();\n for (var x = 0; x < _width; x++)\n {\n sbTop.Append(this[x, y].HasFlag(CellState.Top) ? \"+---\" : \"+ \");\n sbMid.Append(this[x, y].HasFlag(CellState.Left) ? \"| \" : \" \");\n }\n if (firstLine == string.Empty)\n firstLine = \" \" + sbTop.ToString();\n Debug.WriteLine(\" \" + sbTop + \"+\");\n Debug.WriteLine(\" \" + sbMid + \"|\");\n }\n Debug.WriteLine(firstLine);\n }\n }\n\n class Program\n {\n static void Main(string[] args)\n {\n var maze = new Maze(20, 20);\n maze.Display();\n }\n }\n}\n","language":"C-sharp"},{"code":"(ns maze.core\n (:require [clojure.set :refer [intersection\n select]]\n [clojure.string :as str]))\n\n;; Misc functions\n(defn neighborhood\n ([] (neighborhood [0 0]))\n ([coord] (neighborhood coord 1))\n ([[y x] r]\n (let [y-- (- y r) y++ (+ y r)\n x-- (- x r) x++ (+ x r)]\n #{[y++ x] [y-- x] [y x--] [y x++]})))\n\n(defn cell-empty? [maze coords]\n (= :empty (get-in maze coords)))\n\n(defn wall? [maze coords]\n (= :wall (get-in maze coords)))\n\n(defn filter-maze\n ([pred maze coords]\n (select (partial pred maze) (set coords)))\n ([pred maze]\n (filter-maze\n pred\n maze\n (for [y (range (count maze))\n x (range (count (nth maze y)))]\n [y x]))))\n\n(defn create-empty-maze [width height]\n (let [width (inc (* 2 width))\n height (inc (* 2 height))]\n (vec (take height\n (interleave\n (repeat (vec (take width (repeat :wall))))\n (repeat (vec (take width (cycle [:wall :empty])))))))))\n\n(defn next-step [possible-steps]\n (rand-nth (vec possible-steps)))\n\n;;Algo\n(defn create-random-maze [width height]\n (loop [maze (create-empty-maze width height)\n stack []\n nonvisited (filter-maze cell-empty? maze)\n visited #{}\n coords (next-step nonvisited)]\n (if (empty? nonvisited)\n maze\n (let [nonvisited-neighbors (intersection (neighborhood coords 2) nonvisited)]\n (cond\n (seq nonvisited-neighbors)\n (let [next-coords (next-step nonvisited-neighbors)\n wall-coords (map #(+ %1 (/ (- %2 %1) 2)) coords next-coords)]\n (recur (assoc-in maze wall-coords :empty)\n (conj stack coords)\n (disj nonvisited next-coords)\n (conj visited next-coords)\n next-coords))\n\n (seq stack)\n (recur maze (pop stack) nonvisited visited (last stack)))))))\n\n;;Conversion to string\n(def cell-code->str\n [\" \" \" \" \" \" \" \" \"· \" \"╵ \" \"╴ \" \"┘ \"\n \" \" \" \" \" \" \" \" \"╶─\" \"└─\" \"──\" \"┴─\"\n \" \" \" \" \" \" \" \" \"╷ \" \"│ \" \"┐ \" \"┤ \"\n \" \" \" \" \" \" \" \" \"┌─\" \"├─\" \"┬─\" \"┼─\"])\n\n(defn cell-code [maze coord]\n (transduce\n (comp\n (map (partial wall? maze))\n (keep-indexed (fn [idx el] (when el idx)))\n (map (partial bit-shift-left 1)))\n (completing bit-or)\n 0\n (sort (cons coord (neighborhood coord)))))\n\n(defn cell->str [maze coord]\n (get cell-code->str (cell-code maze coord)))\n\n(defn maze->str [maze]\n (->> (for [y (range (count maze))]\n (for [x (range (count (nth maze y)))]\n (cell->str maze [y x])))\n (map str/join)\n (str/join \\newline)))\n\n;;Task\n(println (maze->str (create-random-maze 10 10)))\n","language":"Clojure"},{"code":"100 MS=10:REM MAZE SIZE\n110 DIM S(MS+1,MS+1):REM SOUTH WALLS\n120 DIM W(MS+1,MS+1):REM WEST WALLS\n130 DIM V(MS+1,MS+1):REM VISITED CELLS\n140 PRINT \"INITIALIZING...\"\n150 GOSUB 260:REM INITIALIZE MAZE\n160 PRINT \"BUILDING...\"\n170 DIM PC(MS*MS+1):DIM PR(MS*MS+1):REM STACK\n180 REM PICK RANDOM STARTING CELL\n190 X = RND(-TI)\n200 C=(INT(RND(1)*MS)+1)\n210 R=(INT(RND(1)*MS)+1)\n220 GOSUB 400:REM BUILD MAZE\n230 GOSUB 540:REM DRAW MAZE\n240 END\n250 REM -----INITIALIZE MAZE-----\n260 REM SET WALLS ON AND VISITED CELLS OFF\n270 T=MS+1\n280 FOR C=0 TO T:FOR R=0 TO T:\n290 S(C,R)=1:W(C,R)=1:V(C,R)=0\n300 NEXT R:NEXT C\n310 REM SET BORDER CELLS TO VISITED\n320 FOR C=0 TO T\n330 V(C,0)=1:V(C,T)=1\n340 NEXT C\n350 FOR R=0 TO T\n360 V(0,R)=1:V(T,R)=1\n370 NEXT R\n380 RETURN\n390 REM -----BUILD MAZE-----\n400 U=U+1:PC(U)=C:PR(U)=R:REM PUSH\n410 V(C,R)=1\n420 IF V(C,R+1)=1 AND V(C+1,R)=1 AND V(C,R-1)=1 AND V(C-1,R)=1 THEN GOTO 500\n430 Z=INT(RND(1)*4)\n440 IF Z=0 AND V(C,R+1)=0 THEN S(C,R)=0:R=R+1:GOTO 400\n450 IF Z=1 AND V(C+1,R)=0 THEN W(C+1,R)=0:C=C+1:GOTO 400\n460 IF Z=2 AND V(C,R-1)=0 THEN S(C,R-1)=0:R=R-1:GOTO 400\n470 IF Z=3 AND V(C-1,R)=0 THEN W(C,R)=0:C=C-1:GOTO 400\n480 GOTO 430\n500 C=PC(U):R=PR(U):U=U-1:REM POP\n510 IF U > 0 THEN GOTO 420\n520 RETURN\n530 REM -----DRAW MAZE-----\n540 REM OPEN 4,4:CMD 4:REM SEND OUTPUT TO PRINTER\n550 PRINT \"+--+--+--+--+--+--+--+--+--+--+\"\n560 FOR R = 1 TO MS\n570 FOR C = 1 TO MS+1\n580 IF W(C,R)=0 THEN PRINT \" \";\n590 IF W(C,R)=1 THEN PRINT \": \";\n600 NEXT C\n610 PRINT\n620 FOR C = 1 TO MS\n630 IF S(C,R)=0 THEN PRINT \"+ \";\n640 IF S(C,R)=1 THEN PRINT \"+--\";\n650 NEXT C\n660 PRINT \"+\"\n670 NEXT R\n680 REM PRINT#4:CLOSE 4:REM CLOSE PRINTER DEVICE\n690 RETURN\n","language":"Commodore-BASIC"},{"code":"(defun shuffle (list) ;; Z not uniform\n (sort list '> :key (lambda(x) (random 1.0))))\n\n(defun neighbors (x y maze)\n (remove-if-not\n (lambda (x-y) (and (< -1 (first x-y) (array-dimension maze 0))\n (< -1 (second x-y) (array-dimension maze 1))))\n `((,x ,(+ y 2)) (,(- x 2) ,y) (,x ,(- y 2)) (,(+ x 2) ,y))))\n\n(defun remove-wall (maze x y &optional visited)\n (labels ((walk (maze x y)\n (push (list x y) visited)\n (loop for (u v) in (shuffle (neighbors x y maze))\n unless (member (list u v) visited :test 'equal)\n do (setf (aref maze u v) #\\space\n (aref maze (/ (+ x u) 2) (/ (+ y v) 2)) #\\space)\n (walk maze u v))))\n (setf (aref maze x y) #\\space)\n (walk maze x y)))\n\n(defun draw-maze (width height &key (block #\\BOX_DRAWINGS_LIGHT_DIAGONAL_CROSS))\n (let ((maze (make-array (list (1+ (* 2 height)) (1+ (* 2 width)))\n :element-type 'character :initial-element block)))\n (remove-wall maze (1+ (* 2 (random height))) (1+ (* 2 (random width))))\n (loop for i below (array-dimension maze 0)\n do (fresh-line)\n (loop for j below (array-dimension maze 1)\n do (princ (aref maze i j))))))\n\n(draw-maze 20 6)\n","language":"Common-Lisp"},{"code":"(setf *random-state* (make-random-state t))\n\n(defun 2d-array (w h)\n (make-array (list h w) :initial-element 0))\n\n(defmacro or-and (v a b c)\n `(if (or ,a (and ,b (= 1 ,c))) 0 ,v))\n\n(defun make-maze (w h)\n (let ((vis (2d-array w h))\n\t(ver (2d-array w h))\n\t(hor (2d-array w h)))\n (labels\n ((walk (y x)\n\t (setf (aref vis y x) 1)\n\t (loop\n\t (let (x2 y2)\n\t\t (loop for (dx dy) in '((-1 0) (1 0) (0 -1) (0 1))\n\t\t with cnt = 0 do\n\t\t (let ((xx (+ x dx))\n\t\t\t (yy (+ y dy)))\n\t\t\t (if (and (array-in-bounds-p vis yy xx)\n\t\t\t\t (zerop (aref vis yy xx))\n\t\t\t\t (zerop (random (incf cnt))))\n\t\t\t (setf x2 xx y2 yy))))\n\t\t (if (not x2) (return-from walk))\n\t\t (if (= x x2)\n\t\t (setf (aref hor (min y y2) x) 1)\n\t\t (setf (aref ver y (min x x2)) 1))\n\t\t (walk y2 x2))))\n\n (show ()\n\t (let ((g \" │││─┘┐┤─└┌├─┴┬┼\"))\n\t (loop for i from 0 to h do\n\t\t (loop for j from 0 to w do\n\t\t\t (format t \"~c~a\"\n\t\t\t (char g\n\t\t\t (+ (or-and 1 (= i 0) (> j 0) (aref ver (1- i) (1- j)))\n\t\t\t\t (or-and 2 (= i h) (> j 0) (aref ver i (1- j)))\n\t\t\t\t (or-and 4 (= j 0) (> i 0) (aref hor (1- i) (1- j)))\n\t\t\t\t (or-and 8 (= j w) (> i 0) (aref hor (1- i) j ))))\n\t\t\t (if (and (< j w)\n\t\t\t\t (or (= i 0)\n\t\t\t\t\t (= 0 (aref hor (1- i) j))))\n\t\t\t \"───\" \" \")))\n\t\t (terpri)\n\t\t (when (< i h)\n\t\t (loop for j from 0 below w do\n\t\t\t (format t (if (or (= j 0)\n\t\t\t\t\t (= 0 (aref ver i (1- j))))\n\t\t\t\t\t \"│ \" \" \")))\n\t\t (format t \"│~%\"))))))\n\n (walk (random h) (random w))\n (show))))\n\n(make-maze 20 20)\n","language":"Common-Lisp"},{"code":"void main() @safe {\n import std.stdio, std.algorithm, std.range, std.random;\n\n enum uint w = 14, h = 10;\n auto vis = new bool[][](h, w),\n hor = iota(h + 1).map!(_ => [\"+---\"].replicate(w)).array,\n ver = h.iota.map!(_ => [\"| \"].replicate(w) ~ \"|\").array;\n\n void walk(in uint x, in uint y) /*nothrow*/ @safe /*@nogc*/ {\n vis[y][x] = true;\n //foreach (immutable p; [[x-1,y], [x,y+1], [x+1,y], [x,y-1]].randomCover) {\n foreach (const p; [[x-1, y], [x, y+1], [x+1, y], [x, y-1]].randomCover) {\n if (p[0] >= w || p[1] >= h || vis[p[1]][p[0]]) continue;\n if (p[0] == x) hor[max(y, p[1])][x] = \"+ \";\n if (p[1] == y) ver[y][max(x, p[0])] = \" \";\n walk(p[0], p[1]);\n }\n }\n walk(uniform(0, w), uniform(0, h));\n foreach (const a, const b; hor.zip(ver ~ []))\n join(a ~ \"+\\n\" ~ b).writeln;\n}\n","language":"D"},{"code":"program MazeGen_Rosetta;\n\n{$APPTYPE CONSOLE}\n\nuses System.SysUtils, System.Types, System.Generics.Collections, System.IOUtils;\n\ntype\n TMCell = record\n Visited : Boolean;\n PassTop : Boolean;\n PassLeft : Boolean;\n end;\n TMaze = array of array of TMCell;\n TRoute = TStack<TPoint>;\n\nconst\n mwidth = 24;\n mheight = 14;\n\nprocedure ClearVisited(var AMaze: TMaze);\nvar\n x, y: Integer;\nbegin\n for y := 0 to mheight - 1 do\n for x := 0 to mwidth - 1 do\n AMaze[x, y].Visited := False;\nend;\n\nprocedure PrepareMaze(var AMaze: TMaze);\nvar\n Route : TRoute;\n Position : TPoint;\n d : Integer;\n Pool : array of TPoint; // Pool of directions to pick randomly from\nbegin\n SetLength(AMaze, mwidth, mheight);\n ClearVisited(AMaze);\n Position := Point(Random(mwidth), Random(mheight));\n Route := TStack<TPoint>.Create;\n try\n with Position do\n while True do\n begin\n repeat\n SetLength(Pool, 0);\n if (y > 0) and not AMaze[x, y-1].Visited then Pool := Pool + [Point(0, -1)];\n if (x < mwidth-1) and not AMaze[x+1, y].Visited then Pool := Pool + [Point(1, 0)];\n if (y < mheight-1) and not AMaze[x, y+1].Visited then Pool := Pool + [Point(0, 1)];\n if (x > 0) and not AMaze[x-1, y].Visited then Pool := Pool + [Point(-1, 0)];\n\n if Length(Pool) = 0 then // no direction to draw from\n begin\n if Route.Count = 0 then Exit; // and we are back at start so this is the end\n Position := Route.Pop;\n end;\n until Length(Pool) > 0;\n\n d := Random(Length(Pool));\n Offset(Pool[d]);\n\n AMaze[x, y].Visited := True;\n if Pool[d].y = -1 then AMaze[x, y+1].PassTop := True; // comes from down to up ( ^ )\n if Pool[d].x = 1 then AMaze[x, y].PassLeft := True; // comes from left to right ( --> )\n if Pool[d].y = 1 then AMaze[x, y].PassTop := True; // comes from left to right ( v )\n if Pool[d].x = -1 then AMaze[x+1, y].PassLeft := True; // comes from right to left ( <-- )\n Route.Push(Position);\n end;\n finally\n Route.Free;\n end;\nend;\n\nfunction MazeToString(const AMaze: TMaze; const S, E: TPoint): String; overload;\nvar\n x, y: Integer;\n v : Char;\nbegin\n Result := '';\n for y := 0 to mheight - 1 do\n begin\n for x := 0 to mwidth - 1 do\n if AMaze[x, y].PassTop then Result := Result + '+'#32#32#32 else Result := Result + '+---';\n Result := Result + '+' + sLineBreak;\n for x := 0 to mwidth - 1 do\n begin\n if S = Point(x, y) then v := 'S' else\n if E = Point(x, y) then v := 'E' else\n v := #32'*'[Ord(AMaze[x, y].Visited) + 1];\n\n Result := Result + '|'#32[Ord(AMaze[x, y].PassLeft) + 1] + #32 + v + #32;\n end;\n Result := Result + '|' + sLineBreak;\n end;\n for x := 0 to mwidth - 1 do Result := Result + '+---';\n Result := Result + '+' + sLineBreak;\nend;\n\nprocedure Main;\nvar\n Maze: TMaze;\nbegin\n Randomize;\n PrepareMaze(Maze);\n ClearVisited(Maze); // show no route\n Write(MazeToString(Maze, Point(-1, -1), Point(-1, -1)));\n ReadLn;\nend;\n\nbegin\n Main;\n\nend.\n","language":"Delphi"},{"code":"size = 15\nn = 2 * size + 1\nf = 100 / (n - 0.5)\nlen m[] n * n\n#\nbackground 000\nproc show_maze . .\n clear\n for i = 1 to len m[]\n if m[i] = 0\n x = (i - 1) mod n\n y = (i - 1) div n\n color 999\n move x * f - f / 2 y * f - f / 2\n rect f * 1.5 f * 1.5\n .\n .\n sleep 0.01\n.\noffs[] = [ 1 n -1 (-n) ]\n#\nproc m_maze pos . .\n m[pos] = 0\n show_maze\n d[] = [ 1 2 3 4 ]\n for i = 4 downto 1\n d = randint i\n dir = offs[d[d]]\n d[d] = d[i]\n if m[pos + dir] = 1 and m[pos + 2 * dir] = 1\n m[pos + dir] = 0\n m_maze pos + 2 * dir\n .\n .\n.\nendpos = n * n - 1\nproc make_maze . .\n for i = 1 to len m[]\n m[i] = 1\n .\n for i = 1 to n\n m[i] = 2\n m[n * i] = 2\n m[n * i - n + 1] = 2\n m[n * n - n + i] = 2\n .\n h = 2 * randint 15 - n + n * 2 * randint 15\n m_maze h\n m[endpos] = 0\n endpos += n\n.\nmake_maze\nshow_maze\n","language":"EasyLang"},{"code":"[Maze generation for Rosetta Code.\n EDSAC program, Initial Orders 2.\n\n Cells, horizontal walls, and vertical walls are numbered\n as shown in this example:\n +---1---+---2---+---3---+\n | | | |\n 1 1 2 2 3 3 4 N\n | | | | |\n +---5---+---6---+---7---+ W---+---E\n | | | | |\n 5 5 6 6 7 7 8 S\n | | | |\n +---9---+--10---+--11---+\n\nMaze data are held in a single 1-based array of 17-bit values\n(equivalent to an array of records in a high-level language).\nIn each entry, fields for cells and walls are as shown in \"Flags\" below.]\n\n [Arrange the storage]\n T51K P56F [G parameter: generator for pseudo-random numbers]\n T47K P100F [M parameter: main routine + dependent subroutines]\n T45K P398F [H parameter: storage for maze]\n [The following once-only code can be overwritten by the maze data.]\n T46K P398F [N parameter: library subroutine R4 to read data]\n T50K P420F [X parameter: code executed at start-up only]\n\n[=========== Executed at start-up, then overwritten ================]\n E25K TX GK\n [Enter with acc = 0]\n [0] A@ GN [read 35-bit maze width into 0D]\n AF TM [load and store width, assuming high word = 0]\n [4] A4@ GN AF T1M [same for height]\n [Initialize linear congruential generator for pseudo-random numbers]\n [8] A8@ GN [read seed for LCG into 0D]\n AD T4D [pass seed to LCG in 4D]\n [12] A12@ GG [initialize LCG]\n [Choose a random cell in the maze, for use later.]\n [Also update storage of width and height.]\n T4D [clear the whole of 4D, including sandwich bit]\n AM U4F [load 17-bit width, pass to LCG as 35-bit value]\n LD A2F TM [width to address field, add 1, store]\n [20] A20@ G1G [call LCG, 0D := random in 0..(width - 1)]\n AF T3M [save random to temporary store]\n T4D A1M U4F [pass height of maze to LCG]\n LD A2F T1M [height to address field, add 1, store]\n [30] A30@ G1G [call LCG, 0D := random in 0..(height - 1)]\n HF VM L64F L32F [acc := random*(width + 1)]\n A3M LD A2F [add first random, shift to address, add 1]\n T3M [save random index for use below]\n HM V1M L64F L32F T2M [store (width+1)*(height+1)]\n E65M [jump to main routine with acc = 0]\n\n[================ Main routine ====================]\n E25K TM GK\n[Variables]\n [0] PF [initially maze width; then (width + 1) in address field]\n [1] PF [initially maze height; then (height + 1) in address field]\n[List of up to four E orders to move N, S, W, E.]\n[The first two are also used as temporary store at program start]\n [2] PF\n [3] PF PF PF\n [6] TF [T order to store E order in list]\n[Constants]\n [7] T2@ [initial value of T order]\n [8] TH [order to store into array{0}]\n [9] AH [order to load from array{0}]\n [10] C1H [order to collate with array{1};]\n [also teleprinter colon in figures mode]\n [11] MF [add to T order to make A order with same address]\n [12] LF [add to T order to make C order with same address]\n[Flags]\n [13] K4096F [horizontal wall deleted, 10000 hex]\n [14] IF [vertical wall deleted, 8000 hex]\n [15] RF [no north neighbour, 4000 hex]\n [16] WF [no south neighbour, 2000 hex]\n [17] QF [no west neighbour, 1000 hex]\n [18] P1024F [no east neighbour, 0800 hex]\n [19] PD [cell visited, 0001 hex]\n [20] V2047F [mask to clear visited bit]\n [21] P1023F [mask to select EDSAC address field, which contains\n index of previous cell for backtracking (0 if none).\n[Teleprinter]\n [22] #F [set figures mode]\n [23] !F [space]\n [24] @F [carriage return]\n [25] &F [line feed]\n\n[Subroutine called to set flag \"no north neighbour\" in cells along north edge,\n similarly for east, south and west edges (order must be N, E, S, W).\n Input: 4F = negative count of cells\n 5F = step in array index\n 6F = flag to be set]\n [26] A3F T42@ [plant return link as usual]\n A36@\n G34@ [jump into middle of loop (since A < 0)]\n [30] T4F [loop: update megative count]\n A36@ A5F U36@\n [34] S11@ T38@\n[The following order initially refers to the NW corner cell.\n First call leaves it referring to NE corner; second call to SE corner, etc.\n Hence the need for calls to be in the order N, E, S, W.]\n [36] A1H [planted; loaded as A1H]\n A6F\n [38] TF\n A4F A2F [add 1 to negative count]\n G30@ [if not yet 0, loop back]\n [42] ZF\n\n[Subroutine to test for unvisited neighbour of current cell in a given direction.\n Input: 4F = E order to be added to list if unvisited neighbour is found\n 5F = step in array index to reach neighbour\n 6F = flag to test for no neighbour in this direction]\n [43] A3F T64@ [plant return link as usual]\n S6F H6F CH [if no neighbour then acc = 0, else acc < 0]\n E64@ [exit if no neighbour]\n TF A118@\n A5F T55@\n S19@ H19@\n [55] CF E64@\n TF A6@ U63@\n A2F T6@\n A4F [load jump to execute move]\n [63] TF [store in list of moves]\n [64] ZF [(planted) jump back to caller]\n\n[Jump to here from once-only code, with acc = 0]\n [Clear maze array]\n [65] S2@\n [66] TF [use 0F as loop counter]\n [67] TH [planted, loaded as TH]\n A67@ A2F T67@\n AF A2F G66@\n\n [Set flag \"no north neighbour\" in cells along northern edge]\n S@ A2F T4F [count = width, pass in 4F]\n A2F T5F [step in array index = 1, pass in 5F]\n A15@ T6F [pass flag in 6F]\n [81] A81@ G26@ [call subroutine to set flag]\n\n [Repeat for east, south, west edges (must be in that order)]\n S1@ A2F T4F A@ T5F A18@ T6F\n [90] A90@ G26@\n S@ A2F T4F S2F T5F A16@ T6F\n [99] A99@ G26@\n S1@ A2F T4F S@ T5F A17@ T6F\n [108] A108@ G26@\n\n [Start with the random cell chosen at program start (X parameter)]\n A3@ A8@\n [Loop: here acc = T order for current cell]\n [112] U121@ [plant T order]\n A12@ T118@ [make and plant C order, same address]\n\n [Initialize storing in list of moves]\n A7@ T6@\n H20@\n [118] CF A19@ [mark cell as visited]\n UH [store flags of current cell in array{0} for easy access]\n [121] TF [and also in the body of the array]\n\n [If cell has unvisited North neighbour, add North to list of possible moves]\n A177@ T4F\n S@ T5F\n A15@ T6F\n [128] A128@ G43@\n [Repeat for South, West, East neighbours]\n A178@ T4F\n A@ T5F\n A16@ T6F\n [136] A136@ G43@\n A179@ T4F\n S2F T5F\n A17@ T6F\n [144] A144@ G43@\n A180@ T4F\n A2F T5F\n A18@ T6F\n [152] A152@ G43@\n\n [List now has 0..4 possible moves. If more than one, choose randomly.]\n T4D [clear whole of 4D, including sandwich bit, for randomizer]\n A6@ S7@ [address field := count of moves]\n S2F G225@ [jump if none]\n S2F G169@ [jump if one only]\n RD A2F T4F [pass count, right-justified, to randomizer]\n [164] A164@ G1G [0F := random value 0..(count - 1)]\n AF LD E170@\n [169] TF [only one move, must be at list{0}]\n [170] A7@ A11@ T173@\n [173] AF T176@\n A121@ [common to all moves]\n [176] EF [jump to move N,S,E, or W with acc = 0]\n [177] E181@\n [178] E190@\n [179] E199@\n [180] E208@\n\n [Move North and delete horizontal wall]\n [181] U186@ A11@ T184@\n [184] AF A13@\n [186] TF A121@ S@ E216@\n\n [Move South and delete horizontal wall]\n [190] A@ U196@ A11@ T194@\n [194] AF A13@\n [196] TF A196@ E216@\n\n [Move West and delete vertical wall]\n [199] U204@ A11@ T202@\n [202] AF A14@\n [204] TF A121@ S2F E216@\n\n [Move East and delete vertical wall]\n [208] A2F U214@ A11@ T212@\n [212] AF A14@\n [214] TF A214@\n [fall through]\n\n [Set index of current cell as previous to the new cell.\n Here with T order for new cell in acc.]\n [216] U222@ A11@ T221@\n A121@ S8@\n [221] AF\n [222] TF\n A222@ E112@\n\n [No unvisited neighbour, backtrack if possible]\n [225] TF [clear acc, needed]\n H21@ CH [get index of previous cell (in address field)]\n S2F [is it 0?]\n G233@ [if so, maze is complete, jump to print]\n A2F [restore]\n A8@ [make T order]\n E112@\n\n[Print the maze created above]\n [233] O22@ [set teleprinter to figures mode]\n TF [clear acc]\n S1@ T5F\n [Outer 'loop and a half' with 5F as negative counter.\n h + 1 rows for horizontal walls plus h rows for vertical walls]\n [237]\n [Print row for horizontal walls]\n O296@ [print leading + sign]\n S@ A2F [set inner loop counter in 4F]\n H13@\n [241] T4F [4F := negative count of horizontal walls per row]\n S13@ [has current horizontal wall been deleted?]\n [243] C1H [planted; loaded as C1H]\n G247@ [jump if not]\n A23@ G249@\n [247] T1F [clear acc]\n [248] A248@ [load hyphen (since A = minus in figures mode)]\n [249] TF OF OF OF [print 3 spaces or 3 minus]\n O296@ [print plus sign]\n A243@ A2F T243@ [inc address in C order]\n A4F A2F G241@\n [Here with acc = 0 after printing one row]\n A243@ A2F T243@ [skip next element in array]\n O24@ O25@ [print CR, LF]\n A5F A2F E295@\n T5F\n [Print row for vertical walls]\n S@\n T4F\n H14@\n [272] S14@\n [273] C1H [planted; loaded as C1H]\n G277@\n A23@ G279@\n [277] T1F [clear acc]\n A10@ [colon in figures mode]\n [279] TF OF [print colon or space]\n A273@ A2F T273@ [update C order]\n A4F A2F [inc negative counter for inner loop]\n E292@ [jump out of loop if counter = 0]\n T4F [update counter]\n O23@ O23@ O23@ [print 3 spaces]\n E272@\n[Exit from inner loop for vertical walls]\n [292] O24@ O25@ [print CR, LF]\n E237@\n[Exit]\n [295] O22@ [dummy character to flush print buffer]\n [296] ZF [(1) halt program (2) plus sign in figures mode]\n\n[==================== Generator for pseudo-random numbers ===========]\n[Linear congruential generator, same algorithm as Delphi 7 LCG\n 38 locations]\n E25K TG\n GKG10@G15@T2#ZPFT2ZI514DP257FT4#ZPFT4ZPDPFT6#ZPFT6ZPFRFA6#@S4#@\n T6#@E25FE8ZPFT8ZPFPFA3FT14@A4DT8#@ZFA3FT37@H2#@V8#@L512FL512F\n L1024FA4#@T8#@H6#@C8#@T8#@S4DG32@TDA8#@E35@H4DTDV8#@L1FTDZF\n\n[==================== LIBRARY SUBROUTINE ============================]\n E25K TN\n[R4 Input of one signed integer.\n 22 storage locations; working positions 4, 5, and 6.]\n GKA3FT21@T4DH6@E11@P5DJFT6FVDL4FA4DTDI4FA4FS5@G7@S5@G20@SDTDT6FEF\n\n[===================================================================]\n[The following, without the comments and white space, might have\n been input from a separate tape.]\n E25K TX GK\n EZ [define entry point]\n PF [acc = 0 on entry]\n[Integers supplied by user: maze width, maze height, seed for LCG.\n To be read by library subroutine R4; sign comes after value.]\n 12+8+987654321+\n","language":"EDSAC-order-code"},{"code":"program MazeGen\n\n // First and last columns/rows are \"dead\" cells. Makes generating\n // a maze with border walls much easier. Therefore, a visible\n // 20x20 maze has a maze size of 22. \t\n mazeSize int = 22;\n\n south boolean[][];\n west boolean[][];\n visited boolean[][];\n\n function main()\n initMaze();\n generateMaze();\n drawMaze();\n end\n\n private function initMaze()\n\n visited = createBooleanArray(mazeSize, mazeSize, false);\n\n // Initialize border cells as already visited\n for(col int from 1 to mazeSize)\n visited[col][1] = true;\n visited[col][mazeSize] = true;\n end\n for(row int from 1 to mazeSize)\n visited[1][row] = true;\n visited[mazeSize][row] = true;\n end\n\n // Initialize all walls as present\n south = createBooleanArray(mazeSize, mazeSize, true);\n west = createBooleanArray(mazeSize, mazeSize, true);\n\n end\n\n private function createBooleanArray(col int in, row int in, initialState boolean in) returns(boolean[][])\n\n newArray boolean[][] = new boolean[0][0];\n\n for(i int from 1 to col)\n innerArray boolean[] = new boolean[0];\n for(j int from 1 to row)\n innerArray.appendElement(initialState);\n end\n newArray.appendElement(innerArray);\n end\n\n return(newArray);\n\n end\n\n private function createIntegerArray(col int in, row int in, initialValue int in) returns(int[][])\n\n newArray int[][] = new int[0][0];\n\n for(i int from 1 to col)\n innerArray int[] = new int[0];\n for(j int from 1 to row)\n innerArray.appendElement(initialValue);\n end\n newArray.appendElement(innerArray);\n end\n\n return(newArray);\n\n end\n\n private function generate(col int in, row int in)\n\n // Mark cell as visited\n visited[col][row] = true;\n\n // Keep going as long as there is an unvisited neighbor\n while(!visited[col][row + 1] || !visited[col + 1][row] ||\n !visited[col][row - 1] || !visited[col - 1][row])\n\n while(true)\n r float = MathLib.random(); // Choose a random direction\n\n case\n when(r < 0.25 && !visited[col][row + 1]) // Go south\n south[col][row] = false; // South wall down\n generate(col, row + 1);\n exit while;\n when(r >= 0.25 && r < 0.50 && !visited[col + 1][row]) // Go east\n west[col + 1][row] = false; // West wall of neighbor to the east down\n generate(col + 1, row);\n exit while;\n when(r >= 0.5 && r < 0.75 && !visited[col][row - 1]) // Go north\n south[col][row - 1] = false; // South wall of neighbor to the north down\n generate(col, row - 1);\n exit while;\n when(r >= 0.75 && r < 1.00 && !visited[col - 1][row]) // Go west\n west[col][row] = false; // West wall down\n generate(col - 1, row);\n exit while;\n end\n end\n end\n\n end\n\n private function generateMaze()\n\n // Pick random start position (within the visible maze space)\n randomStartCol int = MathLib.floor((MathLib.random() *(mazeSize - 2)) + 2);\n randomStartRow int = MathLib.floor((MathLib.random() *(mazeSize - 2)) + 2);\n\n generate(randomStartCol, randomStartRow);\n\n end\n\n private function drawMaze()\n\n line string;\n\n // Iterate over wall arrays (skipping dead border cells as required).\n // Construct a line at a time and output to console.\n for(row int from 1 to mazeSize - 1)\n\n if(row > 1)\n line = \"\";\n for(col int from 2 to mazeSize)\n if(west[col][row])\n line ::= \"| \";\n else\n line ::= \" \";\n end\n end\n Syslib.writeStdout(line);\n end\n\n line = \"\";\n for(col int from 2 to mazeSize - 1)\n if(south[col][row])\n line ::= \"+---\";\n else\n line ::= \"+ \";\n end\n end\n line ::= \"+\";\n SysLib.writeStdout(line);\n\n end\n\n end\n\nend\n","language":"EGL"},{"code":"defmodule Maze do\n def generate(w, h) do\n maze = (for i <- 1..w, j <- 1..h, into: Map.new, do: {{:vis, i, j}, true})\n |> walk(:rand.uniform(w), :rand.uniform(h))\n print(maze, w, h)\n maze\n end\n\n defp walk(map, x, y) do\n Enum.shuffle( [[x-1,y], [x,y+1], [x+1,y], [x,y-1]] )\n |> Enum.reduce(Map.put(map, {:vis, x, y}, false), fn [i,j],acc ->\n if acc[{:vis, i, j}] do\n {k, v} = if i == x, do: {{:hor, x, max(y, j)}, \"+ \"},\n else: {{:ver, max(x, i), y}, \" \"}\n walk(Map.put(acc, k, v), i, j)\n else\n acc\n end\n end)\n end\n\n defp print(map, w, h) do\n Enum.each(1..h, fn j ->\n IO.puts Enum.map_join(1..w, fn i -> Map.get(map, {:hor, i, j}, \"+---\") end) <> \"+\"\n IO.puts Enum.map_join(1..w, fn i -> Map.get(map, {:ver, i, j}, \"| \") end) <> \"|\"\n end)\n IO.puts String.duplicate(\"+---\", w) <> \"+\"\n end\nend\n\nMaze.generate(20, 10)\n","language":"Elixir"},{"code":"import Maybe as M\nimport Result as R\nimport Matrix\nimport Mouse\nimport Random exposing (Seed)\nimport Matrix.Random\nimport Time exposing (Time, every, second)\nimport Set exposing (Set, fromList)\nimport List exposing (..)\nimport String exposing (join)\nimport Html exposing (Html, br, input, h1, h2, text, div, button)\nimport Html.Events as HE\nimport Html.Attributes as HA\nimport Html.App exposing (program)\nimport Json.Decode as JD\nimport Svg\nimport Svg.Attributes exposing (version, viewBox, cx, cy, r, x, y, x1, y1, x2, y2, fill,points, style, width, height, preserveAspectRatio)\n\nminSide = 10\nmaxSide = 40\nw = 700\nh = 700\ndt = 0.001\n\ntype alias Direction = Int\ndown = 0\nright = 1\n\ntype alias Door = (Matrix.Location, Direction)\n\ntype State = Initial | Generating | Generated | Solved\n\ntype alias Model =\n { rows : Int\n , cols : Int\n , animate : Bool\n , boxes : Matrix.Matrix Bool\n , doors : Set Door\n , current : List Matrix.Location\n , state : State\n , seedStarter : Int\n , seed : Seed\n }\n\ninitdoors : Int -> Int -> Set Door\ninitdoors rows cols =\n let\n pairs la lb = List.concatMap (\\at -> List.map ((,) at) lb) la\n downs = pairs (pairs [0..rows-2] [0..cols-1]) [down]\n rights = pairs (pairs [0..rows-1] [0..cols-2]) [right]\n in downs ++ rights |> fromList\n\ninitModel : Int -> Int -> Bool -> State -> Int -> Model\ninitModel rows cols animate state starter =\n let rowGenerator = Random.int 0 (rows-1)\n colGenerator = Random.int 0 (cols-1)\n locationGenerator = Random.pair rowGenerator colGenerator\n (c, s)= Random.step locationGenerator (Random.initialSeed starter)\n in { rows = rows\n , cols = cols\n , animate = animate\n , boxes = Matrix.matrix rows cols (\\location -> state == Generating && location == c)\n , doors = initdoors rows cols\n , current = if state == Generating then [c] else []\n , state = state\n , seedStarter = starter -- updated every Tick until maze generated.\n , seed = s\n }\n\nview model =\n let\n borderLineStyle = style \"stroke:green;stroke-width:0.3\"\n wallLineStyle = style \"stroke:green;stroke-width:0.1\"\n\n x1Min = x1 <| toString 0\n y1Min = y1 <| toString 0\n x1Max = x1 <| toString model.cols\n y1Max = y1 <| toString model.rows\n x2Min = x2 <| toString 0\n y2Min = y2 <| toString 0\n x2Max = x2 <| toString model.cols\n y2Max = y2 <| toString model.rows\n\n borders = [ Svg.line [ x1Min, y1Min, x2Max, y2Min, borderLineStyle ] []\n , Svg.line [ x1Max, y1Min, x2Max, y2Max, borderLineStyle ] []\n , Svg.line [ x1Max, y1Max, x2Min, y2Max, borderLineStyle ] []\n , Svg.line [ x1Min, y1Max, x2Min, y2Min, borderLineStyle ] []\n ]\n\n doorToLine door =\n let (deltaX1, deltaY1) = if (snd door == right) then (1,0) else (0,1)\n (row, column) = fst door\n in Svg.line [ x1 <| toString (column + deltaX1)\n , y1 <| toString (row + deltaY1)\n , x2 <| toString (column + 1)\n , y2 <| toString (row + 1)\n , wallLineStyle ] []\n\n doors = (List.map doorToLine <| Set.toList model.doors )\n\n circleInBox (row,col) color =\n Svg.circle [ r \"0.25\"\n , fill (color)\n , cx (toString (toFloat col + 0.5))\n , cy (toString (toFloat row + 0.5))\n ] []\n\n showUnvisited location box =\n if box then [] else [ circleInBox location \"yellow\" ]\n\n unvisited = model.boxes\n |> Matrix.mapWithLocation showUnvisited\n |> Matrix.flatten\n |> concat\n\n current =\n case head model.current of\n Nothing -> []\n Just c -> [circleInBox c \"black\"]\n\n maze =\n if model.animate || model.state /= Generating\n then [ Svg.g [] <| doors ++ borders ++ unvisited ++ current ]\n else [ Svg.g [] <| borders ]\n in\n div\n []\n [ h2 [centerTitle] [text \"Maze Generator\"]\n , div\n [floatLeft]\n ( slider \"rows\" minSide maxSide model.rows SetRows\n ++ [ br [] [] ]\n\n ++ slider \"cols\" minSide maxSide model.cols SetCols\n ++ [ br [] [] ]\n\n ++ checkbox \"Animate\" model.animate SetAnimate\n ++ [ br [] [] ]\n\n ++ [ button\n [ HE.onClick Generate ]\n [ text \"Generate\"]\n ] )\n , div\n [floatLeft]\n [ Svg.svg\n [ version \"1.1\"\n , width (toString w)\n , height (toString h)\n , viewBox (join \" \"\n [ 0 |> toString\n , 0 |> toString\n , model.cols |> toString\n , model.rows |> toString ])\n ]\n maze\n ]\n ]\n\ncheckbox label checked msg =\n [ input\n [ HA.type' \"checkbox\"\n , HA.checked checked\n , HE.on \"change\" (JD.map msg HE.targetChecked)\n ]\n []\n , text label\n ]\n\nslider name min max current msg =\n [ input\n [ HA.value (if current >= min then current |> toString else \"\")\n , HE.on \"input\" (JD.map msg HE.targetValue )\n , HA.type' \"range\"\n , HA.min <| toString min\n , HA.max <| toString max\n ]\n []\n , text <| name ++ \"=\" ++ (current |> toString)\n ]\n\nfloatLeft = HA.style [ (\"float\", \"left\") ]\ncenterTitle = HA.style [ ( \"text-align\", \"center\") ]\n\nunvisitedNeighbors : Model -> Matrix.Location -> List Matrix.Location\nunvisitedNeighbors model (row,col) =\n [(row, col-1), (row-1, col), (row, col+1), (row+1, col)]\n |> List.filter (\\l -> fst l >= 0 && snd l >= 0 && fst l < model.rows && snd l < model.cols)\n |> List.filter (\\l -> (Matrix.get l model.boxes) |> M.withDefault False |> not)\n\nupdateModel' : Model -> Int -> Model\nupdateModel' model t =\n case head model.current of\n Nothing -> {model | state = Generated, seedStarter = t }\n Just prev ->\n let neighbors = unvisitedNeighbors model prev\n in if (length neighbors) > 0 then\n let (neighborIndex, seed) = Random.step (Random.int 0 (length neighbors-1)) model.seed\n next = head (drop neighborIndex neighbors) |> M.withDefault (0,0)\n boxes = Matrix.set next True model.boxes\n dir = if fst prev == fst next then right else down\n doorCell = if ( (dir == down) && (fst prev < fst next))\n || (dir == right ) && (snd prev < snd next) then prev else next\n doors = Set.remove (doorCell, dir) model.doors\n in {model | boxes=boxes, doors=doors, current=next :: model.current, seed=seed, seedStarter = t}\n else\n let tailCurrent = tail model.current |> M.withDefault []\n in updateModel' {model | current = tailCurrent} t\n\nupdateModel : Msg -> Model -> Model\nupdateModel msg model =\n let stringToCellCount s =\n let v' = String.toInt s |> R.withDefault minSide\n in if v' < minSide then minSide else v'\n in case msg of\n Tick tf ->\n let t = truncate tf\n in\n if (model.state == Generating) then updateModel' model t\n else { model | seedStarter = t }\n\n Generate ->\n initModel model.rows model.cols model.animate Generating model.seedStarter\n\n SetRows countString ->\n initModel (stringToCellCount countString) model.cols model.animate Initial model.seedStarter\n\n SetCols countString ->\n initModel model.rows (stringToCellCount countString) model.animate Initial model.seedStarter\n\n SetAnimate b ->\n { model | animate = b }\n\n NoOp -> model\n\ntype Msg = NoOp | Tick Time | Generate | SetRows String | SetCols String | SetAnimate Bool\n\nsubscriptions model = every (dt * second) Tick\n\nmain =\n let\n update msg model = (updateModel msg model, Cmd.none)\n init = (initModel 21 36 False Initial 0, Cmd.none)\n in program\n { init = init\n , view = view\n , update = update\n , subscriptions = subscriptions\n }\n","language":"Elm"},{"code":"(require 'cl-lib)\n\n(cl-defstruct maze rows cols data)\n\n(defmacro maze-pt (w r c)\n `(+ (* (mod ,r (maze-rows ,w)) (maze-cols ,w))\n (mod ,c (maze-cols ,w))))\n\n(defmacro maze-ref (w r c)\n `(aref (maze-data ,w) (maze-pt ,w ,r ,c)))\n\n(defun new-maze (rows cols)\n (setq rows (1+ rows)\n cols (1+ cols))\n (let ((m (make-maze :rows rows :cols cols :data (make-vector (* rows cols) nil))))\n\n (dotimes (r rows)\n (dotimes (c cols)\n (setf (maze-ref m r c) (copy-sequence '(wall ceiling)))))\n\n (dotimes (r rows)\n (maze-set m r (1- cols) 'visited))\n\n (dotimes (c cols)\n (maze-set m (1- rows) c 'visited))\n\n (maze-unset m 0 0 'ceiling) ;; Maze Entrance\n (maze-unset m (1- rows) (- cols 2) 'ceiling) ;; Maze Exit\n\n m))\n\n(defun maze-is-set (maze r c v)\n (member v (maze-ref maze r c)))\n\n(defun maze-set (maze r c v)\n (let ((cell (maze-ref maze r c)))\n (when (not (member v cell))\n (setf (maze-ref maze r c) (cons v cell)))))\n\n(defun maze-unset (maze r c v)\n (setf (maze-ref maze r c) (delete v (maze-ref maze r c))))\n\n(defun print-maze (maze &optional marks)\n (dotimes (r (1- (maze-rows maze)))\n\n (dotimes (c (1- (maze-cols maze)))\n (princ (if (maze-is-set maze r c 'ceiling) \"+---\" \"+ \")))\n (princ \"+\")\n (terpri)\n\n (dotimes (c (1- (maze-cols maze)))\n (princ (if (maze-is-set maze r c 'wall) \"|\" \" \"))\n (princ (if (member (cons r c) marks) \" * \" \" \")))\n (princ \"|\")\n (terpri))\n\n (dotimes (c (1- (maze-cols maze)))\n (princ (if (maze-is-set maze (1- (maze-rows maze)) c 'ceiling) \"+---\" \"+ \")))\n (princ \"+\")\n (terpri))\n\n(defun shuffle (lst)\n (sort lst (lambda (a b) (= 1 (random 2)))))\n\n(defun to-visit (maze row col)\n (let (unvisited)\n (dolist (p '((0 . +1) (0 . -1) (+1 . 0) (-1 . 0)))\n (let ((r (+ row (car p)))\n (c (+ col (cdr p))))\n (unless (maze-is-set maze r c 'visited)\n (push (cons r c) unvisited))))\n unvisited))\n\n(defun make-passage (maze r1 c1 r2 c2)\n (if (= r1 r2)\n (if (< c1 c2)\n (maze-unset maze r2 c2 'wall) ; right\n (maze-unset maze r1 c1 'wall)) ; left\n (if (< r1 r2)\n (maze-unset maze r2 c2 'ceiling) ; up\n (maze-unset maze r1 c1 'ceiling)))) ; down\n\n(defun dig-maze (maze row col)\n (let (backup\n (run 0))\n (maze-set maze row col 'visited)\n (push (cons row col) backup)\n (while backup\n (setq run (1+ run))\n (when (> run (/ (+ row col) 3))\n (setq run 0)\n (setq backup (shuffle backup)))\n (setq row (caar backup)\n col (cdar backup))\n (let ((p (shuffle (to-visit maze row col))))\n (if p\n (let ((r (caar p))\n (c (cdar p)))\n (make-passage maze row col r c)\n (maze-set maze r c 'visited)\n (push (cons r c) backup))\n (pop backup)\n (setq backup (shuffle backup))\n (setq run 0))))))\n\n(defun generate (rows cols)\n (let* ((m (new-maze rows cols)))\n (dig-maze m (random rows) (random cols))\n (print-maze m)))\n\n(defun parse-ceilings (line)\n (let (rtn\n (i 1))\n (while (< i (length line))\n (push (eq ?- (elt line i)) rtn)\n (setq i (+ i 4)))\n (nreverse rtn)))\n\n(defun parse-walls (line)\n (let (rtn\n (i 0))\n (while (< i (length line))\n (push (eq ?| (elt line i)) rtn)\n (setq i (+ i 4)))\n (nreverse rtn)))\n\n(defun parse-maze (file-name)\n (let ((rtn)\n (lines (with-temp-buffer\n (insert-file-contents-literally file-name)\n (split-string (buffer-string) \"\\n\" t))))\n (while lines\n (push (parse-ceilings (pop lines)) rtn)\n (push (parse-walls (pop lines)) rtn))\n (nreverse rtn)))\n\n(defun read-maze (file-name)\n (let* ((raw (parse-maze file-name))\n (rows (1- (/ (length raw) 2)))\n (cols (length (car raw)))\n (maze (new-maze rows cols)))\n (dotimes (r rows)\n (let ((ceilings (pop raw)))\n (dotimes (c cols)\n (unless (pop ceilings)\n (maze-unset maze r c 'ceiling))))\n (let ((walls (pop raw)))\n (dotimes (c cols)\n (unless (pop walls)\n (maze-unset maze r c 'wall)))))\n maze))\n\n(defun find-exits (maze row col)\n (let (exits)\n (dolist (p '((0 . +1) (0 . -1) (-1 . 0) (+1 . 0)))\n (let ((r (+ row (car p)))\n (c (+ col (cdr p))))\n (unless\n (cond\n ((equal p '(0 . +1)) (maze-is-set maze r c 'wall))\n ((equal p '(0 . -1)) (maze-is-set maze row col 'wall))\n ((equal p '(+1 . 0)) (maze-is-set maze r c 'ceiling))\n ((equal p '(-1 . 0)) (maze-is-set maze row col 'ceiling)))\n (push (cons r c) exits))))\n exits))\n\n(defun drop-visited (maze points)\n (let (not-visited)\n (while points\n (unless (maze-is-set maze (caar points) (cdar points) 'visited)\n (push (car points) not-visited))\n (pop points))\n not-visited))\n\n(defun solve-maze (maze)\n (let (solution\n (exit (cons (- (maze-rows maze) 2) (- (maze-cols maze) 2)))\n (pt (cons 0 0)))\n (while (not (equal pt exit))\n (maze-set maze (car pt) (cdr pt) 'visited)\n (let ((exits (drop-visited maze (find-exits maze (car pt) (cdr pt)))))\n (if (null exits)\n (setq pt (pop solution))\n (push pt solution)\n (setq pt (pop exits)))))\n (push pt solution)))\n\n(defun solve (file-name)\n (let* ((maze (read-maze file-name))\n (solution (solve-maze maze)))\n (print-maze maze solution)))\n\n(generate 20 20)\n","language":"Emacs-Lisp"},{"code":"-module( maze ).\n\n-export( [cell_accessible_neighbours/1, cell_content/1, cell_content_set/2, cell_pid/3, cell_position/1, display/1, generation/2, stop/1, task/0] ).\n\n-record( maze, {dict, max_x, max_y, start} ).\n-record( state, {content=\" \", controller, is_dug=false, max_x, max_y, neighbours=[], position, walls=[north, south, east, west], walk_done} ).\n\ncell_accessible_neighbours( Pid ) -> read( Pid, accessible_neighbours ).\n\ncell_content( Pid ) -> read( Pid, content ).\n\ncell_content_set( Pid, Content ) -> Pid ! {content, Content, erlang:self()}.\n\ncell_pid( X, Y, Maze ) -> dict:fetch( {X, Y}, Maze#maze.dict ).\n\ncell_position( Pid ) -> read( Pid, position ).\n\ndisplay( #maze{dict=Dict, max_x=Max_x, max_y=Max_y} ) ->\n\tPosition_pids = dict:to_list( Dict ),\n\tdisplay( Max_x, Max_y, reads(Position_pids, content), reads(Position_pids, walls) ).\n\ngeneration( Max_x, Max_y ) ->\n Controller = erlang:self(),\n Position_pids = cells_create( Controller, Max_x, Max_y ),\n Pids = [Y || {_X, Y} <- Position_pids],\n [X ! {position_pids, Position_pids} || X <- Pids],\n {Position, Pid} = lists:nth( random:uniform(Max_x * Max_y), Position_pids ),\n Pid ! {dig, Controller},\n receive\n {dig_done} -> ok\n end,\n #maze{dict=dict:from_list(Position_pids), max_x=Max_x, max_y=Max_y, start=Position}.\n\nstop( #maze{dict=Dict} ) ->\n Controller = erlang:self(),\n Pids = [Y || {_X, Y} <- dict:to_list(Dict)],\n [X ! {stop, Controller} || X <- Pids],\n ok.\n\ntask() ->\n Maze = generation( 16, 8 ),\n io:fwrite( \"Starting at ~p~n\", [Maze#maze.start] ),\n display( Maze ),\n stop( Maze ).\n\n\n\ncells_create( Controller, Max_x, Max_y ) -> [{{X, Y}, cell_create(Controller, Max_x, Max_y, {X, Y})} || X <- lists:seq(1, Max_x), Y<- lists:seq(1, Max_y)].\n\ncell_create( Controller, Max_x, Max_y, {X, Y} ) -> erlang:spawn_link( fun() -> random:seed( X*1000, Y*1000, (X+Y)*1000 ), loop( #state{controller=Controller, max_x=Max_x, max_y=Max_y, position={X, Y}} ) end ).\n\ndisplay( Max_x, Max_y, Position_contents, Position_walls ) ->\n All_rows = [display_row( Max_x, Y, Position_contents, Position_walls ) || Y <- lists:seq(Max_y, 1, -1)],\n [io:fwrite(\"~s+~n~s|~n\", [North, West]) || {North, West} <- All_rows],\n\tio:fwrite(\"~s+~n\", [lists:flatten(lists:duplicate(Max_x, display_row_north(true)))] ).\n\ndisplay_row( Max_x, Y, Position_contents, Position_walls ) ->\n\tNorth_wests = [display_row_walls(proplists:get_value({X,Y}, Position_contents), proplists:get_value({X,Y}, Position_walls)) || X <- lists:seq(1, Max_x)],\n\tNorth = lists:append( [North || {North, _West} <- North_wests] ),\n\tWest = lists:append( [West || {_X, West} <- North_wests] ),\n\t{North, West}.\n\ndisplay_row_walls( Content, Walls ) -> {display_row_north( lists:member(north, Walls) ), display_row_west( lists:member(west, Walls), Content )}.\n\ndisplay_row_north( true ) -> \"+---\";\ndisplay_row_north( false ) -> \"+ \".\n\ndisplay_row_west( true, Content ) -> \"| \" ++ Content ++ \" \";\ndisplay_row_west( false, Content ) -> \" \" ++ Content ++ \" \".\n\nloop( State ) ->\n receive\n {accessible_neighbours, Pid} ->\n \tPid ! {accessible_neighbours, loop_accessible_neighbours( State#state.neighbours, State#state.walls ), erlang:self()},\n loop( State );\n {content, Pid} ->\n \tPid ! {content, State#state.content, erlang:self()},\n loop( State );\n {content, Content, _Pid} ->\n loop( State#state{content=Content} );\n {dig, Pid} ->\n\t Not_dug_neighbours = loop_not_dug( State#state.neighbours ),\n\t New_walls = loop_dig( Not_dug_neighbours, lists:delete( loop_wall_from_pid(Pid, State#state.neighbours), State#state.walls), Pid ),\n\t loop( State#state{is_dug=true, walls=New_walls, walk_done=Pid} );\n {dig_done} ->\n\t Not_dug_neighbours = loop_not_dug( State#state.neighbours ),\n\t New_walls = loop_dig( Not_dug_neighbours, State#state.walls, State#state.walk_done ),\n\t loop( State#state{walls=New_walls} );\n {is_dug, Pid} ->\n \t Pid ! {is_dug, State#state.is_dug, erlang:self()},\n\t loop( State );\n {position, Pid} ->\n \tPid ! {position, State#state.position, erlang:self()},\n loop( State );\n {position_pids, Position_pids} ->\n {_My_position, Neighbours} = lists:foldl( fun loop_neighbours/2, {State#state.position, []}, Position_pids ),\n erlang:garbage_collect(), % Shrink process after using large Pid_positions. For memory starved systems.\n loop( State#state{neighbours=Neighbours} );\n {stop, Controller} when Controller =:= State#state.controller ->\n \t ok;\n {walls, Pid} ->\n \t Pid ! {walls, State#state.walls, erlang:self()},\n\t loop( State )\n end.\n\nloop_accessible_neighbours( Neighbours, Walls ) -> [Pid || {Direction, Pid} <- Neighbours, not lists:member(Direction, Walls)].\n\nloop_dig( [], Walls, Pid ) ->\n\tPid ! {dig_done},\n\tWalls;\nloop_dig( Not_dug_neighbours, Walls, _Pid ) ->\n {Dig_pid, Dig_direction} = lists:nth( random:uniform(erlang:length(Not_dug_neighbours)), Not_dug_neighbours ),\n Dig_pid ! {dig, erlang:self()},\n\tlists:delete( Dig_direction, Walls ).\n\nloop_neighbours( {{X, Y}, Pid}, {{X, My_y}, Acc} ) when Y =:= My_y + 1 -> {{X, My_y}, [{north, Pid} | Acc]};\nloop_neighbours( {{X, Y}, Pid}, {{X, My_y}, Acc} ) when Y =:= My_y - 1 -> {{X, My_y}, [{south, Pid} | Acc]};\nloop_neighbours( {{X, Y}, Pid}, {{My_x, Y}, Acc} ) when X =:= My_x + 1 -> {{My_x, Y}, [{east, Pid} | Acc]};\nloop_neighbours( {{X, Y}, Pid}, {{My_x, Y}, Acc} ) when X =:= My_x - 1 -> {{My_x, Y}, [{west, Pid} | Acc]};\nloop_neighbours( _Position_pid, Acc ) -> Acc.\n\nloop_not_dug( Neighbours ) ->\n\tMy_pid = erlang:self(),\n\t[Pid ! {is_dug, My_pid} || {_Direction, Pid} <- Neighbours],\n\t[{Pid, Direction} || {Direction, Pid} <- Neighbours, not read_receive(Pid, is_dug)].\n\nloop_wall_from_pid( Pid, Neighbours ) -> loop_wall_from_pid_result( lists:keyfind(Pid, 2, Neighbours) ).\nloop_wall_from_pid_result( {Direction, _Pid} ) -> Direction;\nloop_wall_from_pid_result( false ) -> controller.\n\nread( Pid, Key ) ->\n\tPid ! {Key, erlang:self()},\n\tread_receive( Pid, Key ).\n\nread_receive( Pid, Key ) ->\n receive\n {Key, Value, Pid} -> Value\n end.\n\nreads( Position_pids, Key ) ->\n My_pid = erlang:self(),\n [Pid ! {Key, My_pid} || {_Position, Pid} <- Position_pids],\n [{Position, read_receive(Pid, Key)} || {Position, Pid} <- Position_pids].\n","language":"Erlang"},{"code":"-module(maze).\n-record(maze, {g, m, n}).\n-export([generate_default/0, generate_MxN/2]).\n\nmake_maze(M, N) ->\n Maze = #maze{g = digraph:new(), m = M, n = N},\n lists:foreach(fun(X) -> digraph:add_vertex(Maze#maze.g, X) end, lists:seq(0, M * N - 1)),\n Maze.\n\nrow_at(V, Maze) -> trunc(V / Maze#maze.n).\ncol_at(V, Maze) -> V - row_at(V, Maze) * Maze#maze.n.\nvertex_at(Row, Col, Maze) -> Cell_Exists = cell_exists(Row, Col, Maze), if Cell_Exists -> Row * Maze#maze.n + Col; true -> -1 end.\ncell_exists(Row, Col, Maze) -> (Row >= 0) and (Row < Maze#maze.m) and (Col >= 0) and (Col < Maze#maze.n).\n\nadjacent_cells(V, Maze) -> % ordered: left, up, right, down\n adjacent_cell(cell_left, V, Maze)++adjacent_cell(cell_up, V, Maze)++adjacent_cell(cell_right, V, Maze)++adjacent_cell(cell_down, V, Maze).\n\nadjacent_cell(cell_left, V, Maze) -> case (col_at(V, Maze) == 0) of true -> []; _Else -> [V - 1] end;\nadjacent_cell(cell_up, V, Maze) -> case (row_at(V, Maze) == 0) of true -> []; _Else -> [V - Maze#maze.n] end;\nadjacent_cell(cell_right, V, Maze) -> case (col_at(V, Maze) == Maze#maze.n - 1) of true -> []; _Else -> [V + 1] end;\nadjacent_cell(cell_down, V, Maze) -> case (row_at(V, Maze) == Maze#maze.m - 1) of true -> []; _Else -> [V + Maze#maze.n] end.\n\nconnect_all(V, Maze) ->\n lists:foreach(fun(X) -> digraph:add_edge(Maze#maze.g, V, X) end, adjacent_cells(V, Maze)).\n\nmake_maze(M, N, all_connected) ->\n Maze = make_maze(M, N),\n lists:foreach(fun(X) -> connect_all(X, Maze) end, lists:seq(0, M * N - 1)),\n Maze.\n\nmaze_parts(Maze) ->\n SPR = Maze#maze.n + 1, % slots per row is #columns + 1\n NPR = (Maze#maze.m * 2) + 1, % # part rows is #(rows * 2) + 1\n [make_part(Maze, trunc(Index/SPR), Index - trunc(Index/SPR) * SPR) || Index <- lists:seq(0, (SPR * NPR) - 1)].\n\ndraw_part(Part) ->\n case Part of\n {pwall, pclosed} -> io:format(\"+---\");\n {pwall, popen} -> io:format(\"+ \");\n {pwall, pend} -> io:format(\"+~n\");\n {phall, pclosed} -> io:format(\"| \");\n {phall, popen} -> io:format(\" \");\n {phall, pend} -> io:format(\"|~n\")\n end.\n\nhas_neighbour(Maze, Row, Col, Direction) ->\n V = vertex_at(Row, Col, Maze),\n if\n V >= 0 ->\n Adjacent = adjacent_cell(Direction, V, Maze),\n if\n length(Adjacent) > 0 ->\n Neighbours = digraph:out_neighbours(Maze#maze.g, lists:nth(1, Adjacent)),\n lists:member(V, Neighbours);\n true -> false\n end;\n true -> false\n end.\n\nmake_part(Maze, DoubledRow, Col) ->\n if\n trunc(DoubledRow/2) * 2 == DoubledRow -> % --- (even row) making a wall above the cell\n make_part(Maze, trunc(DoubledRow/2), Col, cell_up, pwall);\n true -> % ---otherwise (odd row) making a hall through the cell\n make_part(Maze, trunc(DoubledRow/2), Col, cell_left, phall)\n end.\n\nmake_part(Maze, _, Col, _, Part_Type) when Col == Maze#maze.n -> {Part_Type, pend};\nmake_part(Maze, Row, Col, Direction, Part_Type) ->\n Has_Neighbour = has_neighbour(Maze, Row, Col, Direction),\n if\n Has_Neighbour -> {Part_Type, popen};\n true -> {Part_Type, pclosed}\n end.\n\nshuffle([], Acc) -> Acc;\nshuffle(List, Acc) ->\n Elem = lists:nth(random:uniform(length(List)), List),\n shuffle(lists:delete(Elem, List), Acc++[Elem]).\n\nprocessDepthFirst(Maze) ->\n if\n Maze#maze.m * Maze#maze.n == 0 -> [{pwall, pend}];\n true ->\n Visited = array:new([{size, Maze#maze.m * Maze#maze.n},{fixed,true},{default,false}]),\n {_, Path} = processDepthFirst(Maze, -1, random:uniform(Maze#maze.m * Maze#maze.n) - 1, {Visited, []}),\n Path\n end.\n\nprocessDepthFirst(Maze, Vfrom, V, VandP) ->\n {Visited, Path} = VandP,\n Was_Visited = array:get(V, Visited),\n if\n not Was_Visited ->\n Walker = fun(X, Acc) -> processDepthFirst(Maze, V, X, Acc) end,\n Random_Neighbours = shuffle(digraph:out_neighbours(Maze#maze.g, V), []),\n lists:foldl(Walker, {array:set(V, true, Visited), Path++[{Vfrom, V}]}, Random_Neighbours);\n true -> VandP\n end.\n\nopen_wall(_, {-1, _}) -> ok;\nopen_wall(Maze, {V, V2}) ->\n case (V2 > V) of true -> digraph:add_edge(Maze#maze.g, V, V2); _Else -> digraph:add_edge(Maze#maze.g, V2, V) end.\n\ngenerate_MxN(M, N) ->\n Maze = make_maze(M, N),\n Matrix = make_maze(M, N, all_connected),\n Trail = processDepthFirst(Matrix),\n lists:foreach(fun(X) -> open_wall(Maze, X) end, Trail),\n Parts = maze_parts(Maze),\n lists:foreach(fun(X) -> draw_part(X) end, Parts).\n\ngenerate_default() ->\n generate_MxN(9, 9).\n","language":"Erlang"},{"code":"let rnd : int -> int =\n let gen = new System.Random()\n fun max -> gen.Next(max)\n\n// randomly choose an element of a list\nlet choose (xs:_ list) = xs.[rnd xs.Length]\n\ntype Maze(width, height) =\n // (x,y) -> have we been here before?\n let visited = Array2D.create width height false\n // (x,y) -> is there a wall between (x,y) and (x+1,y)?\n let horizWalls = Array2D.create width height true\n // (x,y) -> is there a wall between (x,y) and (x,y+1)?\n let vertWalls = Array2D.create width height true\n\n let isLegalPoint (x,y) =\n x >= 0 && x < width && y >= 0 && y < height\n\n let neighbours (x,y) =\n [(x-1,y);(x+1,y);(x,y-1);(x,y+1)] |> List.filter isLegalPoint\n\n let removeWallBetween (x1,y1) (x2,y2) =\n if x1 <> x2 then\n horizWalls.[min x1 x2, y1] <- false\n else\n vertWalls.[x1, min y1 y2] <- false\n\n let rec visit (x,y as p) =\n let rec loop ns =\n let (nx,ny) as n = choose ns\n if not visited.[nx,ny] then\n removeWallBetween p n\n visit n\n match List.filter ((<>) n) ns with\n | [] -> ()\n | others -> loop others\n\n visited.[x,y] <- true\n loop (neighbours p)\n\n do visit (rnd width, rnd height)\n\n member x.Print() =\n (\"+\" + (String.replicate width \"-+\")) ::\n [for y in 0..(height-1) do\n yield \"\\n|\"\n for x in 0..(width-1) do\n yield if horizWalls.[x,y] then \" |\" else \" \"\n yield \"\\n+\"\n for x in 0..(width-1) do\n yield if vertWalls.[x,y] then \"-+\" else \" +\"\n ]\n |> String.concat \"\"\n |> printfn \"%s\"\n\nlet m = new Maze(10,10)\nm.Print()\n","language":"F-Sharp"},{"code":"\\ Bit Arrays\n\n: to-bits ( c -- f f f f f f f f )\n 8 0 ?do\n 2 /mod\n swap negate swap\n loop\n drop ;\n\n: from-bits ( f f f f f f f f -- )\n 8 0 ?do\n if [char] 1 emit else [char] 0 emit then\n loop ;\n\n: byte-bin. ( c -- )\n to-bits from-bits space ;\n\n: byte. ( c -- )\n dup byte-bin.\n dup 2 ['] u.r 16 base-execute space\n 3 u.r space ;\n\n: bytes-for-bits ( u1 -- u2 )\n 8 /mod swap\n 0> if 1+ then ;\n\n: bits ( u -- bits )\n dup bytes-for-bits cell + \\ u-bits u-bytes\n dup allocate throw \\ u-bits u-bytes addr\n 2dup swap erase nip \\ u-bits addr\n swap over ! ; \\ addr\n\n: free-bits ( bits -- )\n free throw ;\n\n: bits. ( bits -- )\n dup @ bytes-for-bits \\ addr bytes\n swap cell+ swap \\ addr+cell bytes\n bounds ?do\n i cr 20 ['] u.r 16 base-execute space\n i c@ byte.\n loop\n cr ;\n\n: bit-position ( u -- u-bit u-byte )\n 8 /mod ;\n\n: assert-bit ( bits u -- bits u )\n assert( 2dup swap @ < ) ;\n\n: find-bit ( bits u1 -- addr u2 )\n assert-bit\n bit-position \\ addr bit byte\n rot \\ bit byte addr\n cell+ + swap ; \\ addr' bit\n\n: set-true ( addr u -- )\n 1 swap lshift over \\ addr mask addr\n c@ or swap c! ;\n\n: set-false ( addr u -- )\n 1 swap lshift invert over \\ addr mask addr\n c@ and swap c! ;\n\n: set ( addr u f -- )\n if set-true else set-false then ;\n\n: set-bit ( bits u f -- )\n { f }\n find-bit f set ;\n\n: set-bits-at-addr ( addr u-start u-stop f -- )\n { f }\n 1+ swap u+do\n dup i f set\n loop\n drop ;\n\n: byte-from-flag ( f -- c )\n if 255 else 0 then ;\n\n: set-bits { bits u-start u-stop f -- }\n\n u-start u-stop > if exit then\n\n bits u-start find-bit { addr-start bit-start }\n bits u-stop find-bit { addr-stop bit-stop }\n\n addr-start addr-stop = if\n addr-start bit-start bit-stop f set-bits-at-addr\n else\n addr-start bit-start 7 f set-bits-at-addr\n addr-start 1+ addr-stop addr-start - 1- f byte-from-flag fill\n addr-stop 0 bit-stop f set-bits-at-addr\n then ;\n\n: check-bit ( addr u -- f )\n find-bit \\ addr bit\n 1 swap lshift swap \\ mask addr\n c@ and 0> ;\n\n: resize-bits ( bits u -- bits )\n over @ { old-size }\n tuck bytes-for-bits cell + resize throw \\ u-bits bits\n 2dup ! swap \\ bits u-bits\n dup old-size > if\n over swap \\ bits bits u-bits\n 1- old-size swap false set-bits\n else\n drop\n then ;\n","language":"Forth"},{"code":"#! /usr/bin/gforth\n\\ Maze Generation\n\nwarnings off\n\nrequire random.fs\nrequire bits.fs\n\n\\ command line\n\n: parse-number s>number? invert throw drop ;\n: parse-width .\" width : \" next-arg parse-number dup . cr ;\n: parse-height .\" height: \" next-arg parse-number dup . cr ;\n: parse-args cr parse-width parse-height ;\n\nparse-args constant HEIGHT constant WIDTH\n\n 2 CONSTANT AISLE-WIDTH\n 1 CONSTANT AISLE-HEIGHT\n\nWIDTH HEIGHT * bits CONSTANT VISITED\nWIDTH 1- HEIGHT * bits CONSTANT EAST-WALLS\nHEIGHT 1- WIDTH * bits CONSTANT SOUTH-WALLS\n\n0 CONSTANT NORTH\n1 CONSTANT EAST\n2 CONSTANT SOUTH\n3 CONSTANT WEST\n\n: visited-ix ( x y -- u ) WIDTH * + ;\n: east-wall-ix ( x y -- u ) [ WIDTH 1- ] literal * + ;\n: south-wall-ix ( x y -- u ) WIDTH * + ;\n: visited! ( x y -- ) visited-ix VISITED swap TRUE set-bit ;\n: visited? ( x y -- f ) visited-ix VISITED swap check-bit ;\n: east-wall? ( x y -- f ) east-wall-ix EAST-WALLS swap check-bit ;\n: south-wall? ( x y -- f ) south-wall-ix SOUTH-WALLS swap check-bit ;\n: remove-east-wall ( x y -- ) east-wall-ix EAST-WALLS swap FALSE set-bit ;\n: remove-south-wall ( x y -- ) south-wall-ix SOUTH-WALLS swap FALSE set-bit ;\n\n: clear-visited ( -- ) VISITED 0 WIDTH 1- HEIGHT 1- visited-ix FALSE set-bits ;\n: set-east-walls ( -- ) EAST-WALLS 0 WIDTH 2 - HEIGHT 1- east-wall-ix TRUE set-bits ;\n: set-south-walls ( -- ) SOUTH-WALLS 0 WIDTH 1- HEIGHT 2 - south-wall-ix TRUE set-bits ;\n: initial-pos ( -- x y ) WIDTH random HEIGHT random ;\n: init-state ( -- -1 x y 0 ) clear-visited set-east-walls set-south-walls -1 initial-pos 2dup visited! 0 ;\n\n: north-valid? ( x y -- f ) nip 0> ;\n: east-valid? ( x y -- f ) drop [ WIDTH 1- ] literal < ;\n: south-valid? ( x y -- f ) nip [ HEIGHT 1- ] literal < ;\n: west-valid? ( x y -- f ) drop 0> ;\n: dir-valid? ( x y d -- f ) case\n NORTH of north-valid? endof\n EAST of east-valid? endof\n SOUTH of south-valid? endof\n WEST of west-valid? endof\n endcase ;\n: move-north ( x y -- x' y' ) 1- ;\n: move-east ( x y -- x' y' ) swap 1+ swap ;\n: move-south ( x y -- x' y' ) 1+ ;\n: move-west ( x y -- x' y' ) swap 1- swap ;\n: move ( x y d -- x' y' ) case\n NORTH of move-north endof\n EAST of move-east endof\n SOUTH of move-south endof\n WEST of move-west endof\n endcase ;\n\n: remove-north-wall ( x y -- ) 1- remove-south-wall ;\n: remove-west-wall ( x y -- ) swap 1- swap remove-east-wall ;\n: remove-wall ( x y d -- ) case\n NORTH of remove-north-wall endof\n EAST of remove-east-wall endof\n SOUTH of remove-south-wall endof\n WEST of remove-west-wall endof\n endcase ;\n\n: dir? ( m d -- f ) 1 swap lshift and 0= ;\n: dir! ( m d -- m' ) 1 swap lshift or ;\n: pick-dir ( m -- m' d ) assert( dup $f <> ) begin 4 random 2dup dir? if tuck dir! swap exit then drop again ;\n\n: update-state ( x y m d -- x' y' m' ) { x y m d }\n x y d dir-valid? if\n x y m\n x y d move\n 2dup visited? if\n 2drop\n else\n 2dup visited!\n x y d remove-wall\n 0\n then\n else\n x y m\n then ;\n\n: step ( x y m -- x' y' m' ) dup $f = if\n drop 2drop \\ backtracking!\n else\n pick-dir update-state\n then ;\n\n: build-maze ( -- ) init-state\n begin\n dup -1 <> while\n step\n repeat drop ;\n\n: corner ( -- ) [char] + emit ;\n: h-wall ( -- ) [char] - emit ;\n: v-wall ( -- ) [char] | emit ;\n: top-bottom. ( -- ) cr corner WIDTH 0 ?do AISLE-WIDTH 0 ?do h-wall loop corner loop ;\n: empty ( -- ) AISLE-WIDTH 0 ?do space loop ;\n: interior-cell ( x y -- ) empty east-wall? if v-wall else space then ;\n: last-cell ( -- ) empty v-wall ;\n: row ( y -- ) cr v-wall [ WIDTH 1- ] literal 0 ?do i over interior-cell loop drop last-cell ;\n: last-row ( y -- ) cr WIDTH 0 ?do corner i over south-wall? if AISLE-WIDTH 0 ?do h-wall loop else empty then loop drop corner ;\n: aisle ( y -- ) AISLE-HEIGHT 0 ?do dup row loop dup [ HEIGHT 1- ] literal < if last-row else drop then ;\n: maze. ( -- ) top-bottom.\n HEIGHT 0 ?do i aisle loop\n top-bottom. ;\n: maze ( width height -- ) build-maze maze. ;\n\nmaze cr bye\n","language":"Forth"},{"code":"' version 04-12-2016\n' compile with: fbc -s console\n' when generating a big maze it's possible to run out of stack space\n' increase stack with the -t xxxx (xxxx is the amount you want in Kbytes)\n\nReDim Shared As String d() ' directions\nReDim Shared As ULong c() ' cell's\n\nSub cell(x As ULong, y As ULong, s As ULong)\n\n Dim As ULong x1, y1, di_n\n c(x,y) = 1 ' mark as visited\n\n Do\n Dim As String di = d(x, y)\n Dim As Long l = Len(di) -1\n If l < 0 Then Exit Sub ' no directions left then exit\n di_n = di[l] ' get direction\n If l = 0 Then\n d(x,y) = \"\"\n Else\n d(x,y) = Left(di,l)\n End If\n\n Select Case di_n ' 0,0 is upper left corner\n Case Asc(\"N\")\n x1 = x : y1 = y -1\n Case Asc(\"E\")\n x1 = x +1 : y1 = y\n Case Asc(\"S\")\n x1 = x : y1 = y +1\n Case Asc(\"W\")\n x1 = x -1 : y1 = y\n End Select\n\n If c(x1,y1) <> 0 Then Continue Do\n\n Select Case di_n ' 0,0 is upper left corner\n Case Asc(\"N\")\n Line (x * s +1 , y * s) - ((x +1) * s -1, y * s),0\n Case Asc(\"E\")\n Line (x1 * s, y * s +1) - (x1 * s, (y +1) * s -1),0\n Case Asc(\"S\")\n Line (x * s +1, y1 * s) - ((x +1) * s -1, y1 * s),0\n Case Asc(\"W\")\n Line (x * s , y * s +1) - (x * s, (y +1) * s -1),0\n End Select\n\n cell(x1, y1, s)\n Loop\n\nEnd Sub\n\nSub gen_maze(w As ULong, h As ULong, s As ULong)\n\n ReDim d(w, h)\n ReDim c(w, h)\n Dim As ULong x, y, r, i\n Dim As String di\n\n d(0, 0) = \"SE\" ' cornes\n d(0, h -1) =\"NE\"\n d(w -1, 0) =\"SW\"\n d(w -1, h -1) =\"NW\"\n\n For x = 1 To w -2 ' sides\n d(x,0) = \"EWS\"\n d(x,h -1) = \"NEW\"\n Next\n\n For y = 1 To h -2\n d(0, y) = \"NSE\"\n d(w -1, y) =\"NSW\"\n Next\n\n For x = 0 To w -1 ' shuffle directions\n For y = 0 To h -1\n di = d(x,y)\n If di = \"\" Then di = \"NEWS\"\n i = Len(di)\n Do\n r = Fix(Rnd * i)\n i = i - 1\n Swap di[r], di[i]\n Loop Until i = 0\n d(x,y) = di\n Next\n Next\n\n ScreenRes w * s +1, h * s +1, 8\n ' draw the grid\n For x = 0 To w\n Line (x * s, 0) - (x * s, h * s), 2 ' green color\n Next\n\n For y = 0 To h\n Line(0, y * s) - (w* s, y * s),2\n Next\n ' choice the start cell\n x = Fix(Rnd * w)\n y = Fix(Rnd * h)\n\n cell(x, y, s)\n\nEnd Sub\n\n' ------=< MAIN >=------\n\nRandomize Timer\n\nDim As ULong t\n\nDo\n ' gen_maxe(width, height, cell size)\n gen_maze(30, 30, 20)\n WindowTitle \" S to save, N for next maze, other key to stop\"\n Do\n Var key = Inkey\n key = UCase(key)\n If key = \"S\" Then\n t = t +1\n BSave(\"maze\" + Str(t) + \".bmp\"), 0\n key = \"\"\n End If\n If key = \"N\" Then Continue Do, Do\n If key <> \"\" Then Exit Do, Do\n Loop\nLoop\n\nEnd\n","language":"FreeBASIC"},{"code":"_rows = 9\n_cols = 11\n_size = 32\n_mgn = 32\n\n_t = ( 1 << 0 )\n_l = ( 1 << 1 )\n_b = ( 1 << 2 )\n_r = ( 1 << 3 )\n_a = _t + _l + _b + _r\n\n_window = 1\n\nvoid local fn BuildWindow\n window _window, @\"FutureBasic - Maze generation\", (0,0,_cols*_size+_mgn*2,_rows*_size+_mgn*2), NSWindowStyleMaskTitled\nend fn\n\n\nlocal fn CellAvailable( r as long, c as long ) as BOOL\n if ( r < 0 || c < 0 || r >= _rows || c >= _cols ) then exit fn\n if ( mda_integer(r,c) == _a ) then exit fn = YES\nend fn = NO\n\n\nvoid local fn ProcessCell( r as long, c as long )\n long r1 = r, c1 = c, d(3), count, dir, opp\n\n while ( 1 )\n BlockZero( @d(0), sizeof(long) * 4 )\n count = 0\n if ( fn CellAvailable( r - 1, c ) ) then d(count) = _t : count++\n if ( fn CellAvailable( r, c - 1 ) ) then d(count) = _l : count++\n if ( fn CellAvailable( r + 1, c ) ) then d(count) = _b : count++\n if ( fn CellAvailable( r, c + 1 ) ) then d(count) = _r : count++\n if ( count == 0 ) then break\n\n dir = d(rnd(count)-1)\n mda(r,c) = @(mda_integer(r,c) - dir)\n\n select ( dir )\n case _t\n r1 = r-1 : opp = _b\n case _l\n c1 = c-1 : opp = _r\n case _b\n r1 = r+1 : opp = _t\n case _r\n c1 = c+1 : opp = _l\n end select\n\n mda(r1,c1) = @(mda_integer(r1,c1) - opp)\n fn ProcessCell( r1, c1 )\n wend\nend fn\n\n\nvoid local fn DrawMaze\n long r, c, x = _mgn, y = _mgn, value\n\n pen 2,, NSLineCapStyleRound\n\n for r = 0 to _rows - 1\n for c = 0 to _cols - 1\n value = mda(r,c)\n if ( value & _t ) then line x, y to x + _size, y\n if ( value & _l ) then line x, y to x, y + _size\n if ( value & _b ) then line x, y + _size to x + _size, y + _size\n if ( value & _r ) then line x + _size, y to x + _size, y + _size\n x += _size\n next\n x = _mgn\n y += _size\n next\nend fn\n\n\nvoid local fn BuildMaze\n long r, c\n\n for r = 0 to _rows - 1\n for c = 0 to _cols - 1\n mda(r,c) = _a\n next\n next\n\n random\n r = rnd(_rows) - 1\n c = rnd(_cols) - 1\n fn ProcessCell( r, c )\n fn DrawMaze\nend fn\n\nfn BuildWindow\nfn BuildMaze\n\nHandleEvents\n","language":"FutureBasic"},{"code":"package main\n\nimport (\n \"bytes\"\n \"fmt\"\n \"math/rand\"\n \"time\"\n)\n\ntype maze struct {\n c []byte // cell contents\n h []byte // horizontal walls above cells\n v []byte // vertical walls to the left of cells\n c2 [][]byte // cells by row\n h2 [][]byte // horizontal walls by row (ignore first row)\n v2 [][]byte // vertical walls by row (ignore first of each column)\n}\n\nfunc newMaze(rows, cols int) *maze {\n c := make([]byte, rows*cols) // all cells\n h := bytes.Repeat([]byte{'-'}, rows*cols) // all horizontal walls\n v := bytes.Repeat([]byte{'|'}, rows*cols) // all vertical walls\n c2 := make([][]byte, rows) // cells by row\n h2 := make([][]byte, rows) // horizontal walls by row\n v2 := make([][]byte, rows) // vertical walls by row\n for i := range h2 {\n c2[i] = c[i*cols : (i+1)*cols]\n h2[i] = h[i*cols : (i+1)*cols]\n v2[i] = v[i*cols : (i+1)*cols]\n }\n return &maze{c, h, v, c2, h2, v2}\n}\n\nfunc (m *maze) String() string {\n hWall := []byte(\"+---\")\n hOpen := []byte(\"+ \")\n vWall := []byte(\"| \")\n vOpen := []byte(\" \")\n rightCorner := []byte(\"+\\n\")\n rightWall := []byte(\"|\\n\")\n var b []byte\n // for all rows\n for r, hw := range m.h2 {\n // draw h walls\n for _, h := range hw {\n if h == '-' || r == 0 {\n b = append(b, hWall...)\n } else {\n b = append(b, hOpen...)\n }\n }\n b = append(b, rightCorner...)\n // draw v walls\n for c, vw := range m.v2[r] {\n if vw == '|' || c == 0 {\n b = append(b, vWall...)\n } else {\n b = append(b, vOpen...)\n }\n // draw cell contents\n if m.c2[r][c] != 0 {\n b[len(b)-2] = m.c2[r][c]\n }\n }\n b = append(b, rightWall...)\n }\n // draw bottom edge of maze\n for _ = range m.h2[0] {\n b = append(b, hWall...)\n }\n b = append(b, rightCorner...)\n return string(b)\n}\n\nfunc (m *maze) gen() {\n m.g2(rand.Intn(len(m.c2)), rand.Intn(len(m.c2[0])))\n}\n\nconst (\n up = iota\n dn\n rt\n lf\n)\n\nfunc (m *maze) g2(r, c int) {\n m.c2[r][c] = ' '\n for _, dir := range rand.Perm(4) {\n switch dir {\n case up:\n if r > 0 && m.c2[r-1][c] == 0 {\n m.h2[r][c] = 0\n m.g2(r-1, c)\n }\n case lf:\n if c > 0 && m.c2[r][c-1] == 0 {\n m.v2[r][c] = 0\n m.g2(r, c-1)\n }\n case dn:\n if r < len(m.c2)-1 && m.c2[r+1][c] == 0 {\n m.h2[r+1][c] = 0\n m.g2(r+1, c)\n }\n case rt:\n if c < len(m.c2[0])-1 && m.c2[r][c+1] == 0 {\n m.v2[r][c+1] = 0\n m.g2(r, c+1)\n }\n }\n }\n}\n\nfunc main() {\n rand.Seed(time.Now().UnixNano())\n m := newMaze(4, 6)\n m.gen()\n fmt.Print(m)\n}\n","language":"Go"},{"code":"{-# LANGUAGE FlexibleContexts #-}\n{-# LANGUAGE TypeFamilies #-}\n\nimport Data.Array.ST\n (STArray, freeze, newArray, readArray, writeArray)\nimport Data.STRef (STRef, newSTRef, readSTRef, writeSTRef)\nimport System.Random (Random(..), getStdGen, StdGen)\nimport Control.Monad (forM_, unless)\nimport Control.Monad.ST (ST, stToIO)\nimport Data.Array (Array, (!), bounds)\nimport Data.Bool (bool)\n\nrand\n :: Random a\n => (a, a) -> STRef s StdGen -> ST s a\nrand range gen = do\n (a, g) <- randomR range <$> readSTRef gen\n gen `writeSTRef` g\n return a\n\ndata Maze = Maze\n { rightWalls, belowWalls :: Array (Int, Int) Bool\n }\n\nmaze :: Int -> Int -> StdGen -> ST s Maze\nmaze width height gen = do\n visited <- mazeArray False\n rWalls <- mazeArray True\n bWalls <- mazeArray True\n gen <- newSTRef gen\n (,) <$> rand (0, maxX) gen <*> rand (0, maxY) gen >>=\n visit gen visited rWalls bWalls\n Maze <$> freeze rWalls <*> freeze bWalls\n where\n visit gen visited rWalls bWalls here = do\n writeArray visited here True\n let ns = neighbors here\n i <- rand (0, length ns - 1) gen\n forM_ (ns !! i : take i ns ++ drop (i + 1) ns) $\n \\there -> do\n seen <- readArray visited there\n unless seen $\n do removeWall here there\n visit gen visited rWalls bWalls there\n where\n removeWall (x1, y1) (x2, y2) =\n writeArray (bool rWalls bWalls (x1 == x2)) (min x1 x2, min y1 y2) False\n neighbors (x, y) =\n bool [(x - 1, y)] [] (0 == x) ++\n bool [(x + 1, y)] [] (maxX == x) ++\n bool [(x, y - 1)] [] (0 == y) ++ bool [(x, y + 1)] [] (maxY == y)\n maxX = width - 1\n maxY = height - 1\n mazeArray =\n newArray ((0, 0), (maxX, maxY)) :: Bool -> ST s (STArray s (Int, Int) Bool)\n\nprintMaze :: Maze -> IO ()\nprintMaze (Maze rWalls bWalls) = do\n putStrLn $ '+' : concat (replicate (maxX + 1) \"---+\")\n forM_ [0 .. maxY] $\n \\y -> do\n putStr \"|\"\n forM_ [0 .. maxX] $\n \\x -> do\n putStr \" \"\n putStr $ bool \" \" \"|\" (rWalls ! (x, y))\n putStrLn \"\"\n forM_ [0 .. maxX] $\n \\x -> do\n putStr \"+\"\n putStr $ bool \" \" \"---\" (bWalls ! (x, y))\n putStrLn \"+\"\n where\n maxX = fst (snd $ bounds rWalls)\n maxY = snd (snd $ bounds rWalls)\n\nmain :: IO ()\nmain = getStdGen >>= stToIO . maze 11 8 >>= printMaze\n","language":"Haskell"},{"code":"import Algorithms as algo;\nimport Mathematics as math;\nimport Terminal as term;\n\nclass Maze {\n\t_rows = none;\n\t_cols = none;\n\t_data = none;\n\tconstructor( rows_, cols_ ) {\n\t\t_rows = ( rows_ / 2 ) * 2 - 1;\n\t\t_cols = ( cols_ / 2 ) * 2 - 1;\n\t\t_data = [].resize( _rows + 2, [].resize( _cols + 2, false ) );\n\t\tx = 0;\n\t\ty = 0;\n\t\tpath = [];\n\t\trng = math.Randomizer( math.Randomizer.DISTRIBUTION.DISCRETE, 0, integer( $2 ^ $63 - $1 ) );\n\t\tfor ( _ : algo.range( _rows * _cols / 3 ) ) {\n\t\t\t_data[y + 1][x + 1] = true;\n\t\t\twhile ( true ) {\n\t\t\t\tn = neighbours( y, x );\n\t\t\t\tns = size( n );\n\t\t\t\tif ( ns == 0 ) {\n\t\t\t\t\tif ( size( path ) == 0 ) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\ty, x = path[-1];\n\t\t\t\t\tpath.pop();\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\toy, ox = ( y, x );\n\t\t\t\ty, x = n[rng.next() % ns];\n\t\t\t\t_data[(y + oy) / 2 + 1][(x + ox) / 2 + 1] = true;\n\t\t\t\tpath.push( ( y, x ) );\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t_data[0][1] = true;\n\t\t_data[-1][-2] = true;\n\t}\n\tneighbours( y_, x_ ) {\n\t\tn = [];\n\t\tif ( ( x_ > 1 ) && ! _data[y_ + 1][x_ - 1] ) {\n\t\t\tn.push( ( y_, x_ - 2 ) );\n\t\t}\n\t\tif ( ( y_ > 1 ) && ! _data[y_ - 1][x_ + 1] ) {\n\t\t\tn.push( ( y_ - 2, x_ ) );\n\t\t}\n\t\tif ( ( x_ < ( _cols - 2 ) ) && ! _data[y_ + 1][x_ + 3] ) {\n\t\t\tn.push( ( y_, x_ + 2 ) );\n\t\t}\n\t\tif ( ( y_ < ( _rows - 2 ) ) && ! _data[y_ + 3][x_ + 1] ) {\n\t\t\tn.push( ( y_ + 2, x_ ) );\n\t\t}\n\t\treturn ( n );\n\t}\n\tto_string() {\n\t\ts = \"\";\n\t\tfor ( r : _data ) {\n\t\t\ts += ∑( algo.map( r, @( b ) { b ? \" \" : \"#\"; } ) );\n\t\t\ts += \"\\n\";\n\t\t}\n\t\treturn ( s );\n\t}\n}\n\nmain() {\n\trows = term.lines() - 2;\n\tcols = term.columns() - 1;\n\tmaze = Maze( rows, cols );\n\tprint( \"{}\".format( maze ) );\n}\n","language":"Huginn"},{"code":"link printf\n\nprocedure main(A) # generate rows x col maze\n /mh := \\A[1] | 12 # or take defaults 12 x 16\n /mw := \\A[2] | 16\n mz := DisplayMaze(GenerateMaze(mh,mw))\n WriteImage(mz.filename) # save file\n WAttrib(mz.window,\"canvas=normal\") # show maze in hidden window\n until Event() == &lpress # wait for left mouse press\n close(mz.window)\nend\n\n$define FINISH 64 # exit\n$define START 32 # entrance\n$define PATH 128\n$define SEEN 16 # bread crumbs for generator\n$define NORTH 8 # sides ...\n$define EAST 4\n$define SOUTH 2\n$define WEST 1\n$define EMPTY 0 # like new\n\nprocedure GenerateMaze(r,c) #: Depth First Maze Generation\nstatic maze,h,w,rd\n if /maze then { # BEGING - No maze yet\n /h := integer(1 < r) | runerr(r,205) # valid size 2x2 or better\n /w := integer(1 < c) | runerr(r,205)\n every !(maze := list(h)) := list(w,EMPTY) # shinny new empty maze\n start := [?h,?w,?4-1,START] # random [r,c] start & finish\n finish := [?h,?w,(start[3]+2)%4,FINISH] # w/ opposite side exponent\n every x := start | finish do {\n case x[3] := 2 ^ x[3] of { # get side from exponent and\n NORTH : x[1] := 1 # project r,c to selected edge\n EAST : x[2] := w\n SOUTH : x[1] := h\n WEST : x[2] := 1\n }\n maze[x[1],x[2]] +:= x[3] + x[4] # transcribe s/f to maze\n }\n rd := [NORTH, EAST, SOUTH, WEST] # initial list of directions\n GenerateMaze(start[1],start[2]) # recurse through maze\n return 1(.maze,maze := &null) # return maze, reset for next\n }\n else { # ----------------------- recursed to clear insize of maze\n if iand(maze[r,c],SEEN) = 0 then { # in bounds and not SEEN yet?\n maze[r,c] +:= SEEN # Mark current cell as visited\n every !rd :=: ?rd # randomize list of directions\n every d := !rd do\n case d of { # try all, succeed & clear wall\n NORTH : maze[r,c] +:= ( GenerateMaze(r-1,c), NORTH)\n EAST : maze[r,c] +:= ( GenerateMaze(r,c+1), EAST)\n SOUTH : maze[r,c] +:= ( GenerateMaze(r+1,c), SOUTH)\n WEST : maze[r,c] +:= ( GenerateMaze(r,c-1), WEST)\n }\n return # signal success to caller\n }\n }\nend\n\n$define CELL 20 # cell size in pixels\n$define BORDER 30 # border size in pixels\n\nrecord mazeinfo(window,maze,filename) # keepers\n\nprocedure DisplayMaze(maze) #: show it off\nif CELL < 8 then runerr(205,CELL) # too small\n\nwh := (ch := (mh := *maze ) * CELL) + 2 * BORDER # win, cell, maze height\nww := (cw := (mw := *maze[1]) * CELL) + 2 * BORDER # win, cell, maze width\n\nwparms := [ sprintf(\"Maze %dx%d\",*maze,*maze[1]), # window parameters\n \"g\",\"bg=white\",\"canvas=hidden\",\n sprintf(\"size=%d,%d\",ww,wh),\n sprintf(\"dx=%d\",BORDER),\n sprintf(\"dy=%d\",BORDER)]\n\n&window := open!wparms | stop(\"Unable to open Window\")\n\nFg(\"black\") # Draw full grid\nevery DrawLine(x := 0 to cw by CELL,0,x,ch+1) # . verticals\nevery DrawLine(0,y := 0 to ch by CELL,cw+1,y) # . horizontals\n\nFg(\"white\") # Set to erase lines\nevery y := CELL*((r := 1 to mh)-1) & x := CELL*((c := 1 to mw)-1) do {\n WAttrib(\"dx=\"||x+BORDER,\"dy=\"||y+BORDER) # position @ cell r,c\n if iand(maze[r,c],NORTH) > 0 then DrawLine(2,0,CELL-1,0)\n if iand(maze[r,c],EAST) > 0 then DrawLine(CELL,2,CELL,CELL-1)\n if iand(maze[r,c],SOUTH) > 0 then DrawLine(2,CELL,CELL-1,CELL)\n if iand(maze[r,c],WEST) > 0 then DrawLine(0,2,0,CELL-1)\n }\n\nreturn mazeinfo(&window,maze,sprintf(\"maze-%dx%d-%d.gif\",r,c,&now))\nend\n","language":"Icon"},{"code":"maze=:4 :0\n assert.0<:n=.<:x*y\n horiz=. 0$~x,y-1\n verti=. 0$~(x-1),y\n path=.,:here=. ?x,y\n unvisited=.0 (<here+1)} 0,0,~|:0,0,~1$~y,x\n while.n do.\n neighbors=. here+\"1 (,-)=0 1\n neighbors=. neighbors #~ (<\"1 neighbors+1) {unvisited\n if.#neighbors do.\n n=.n-1\n next=. ({~ ?@#) neighbors\n unvisited=.0 (<next+1)} unvisited\n if.{.next=here\n do. horiz=.1 (<-:here+next-0 1)} horiz\n else. verti=. 1 (<-:here+next-1 0)} verti end.\n path=.path,here=.next\n else.\n here=.{:path\n path=.}:path\n end.\n end.\n horiz;verti\n)\n\ndisplay=:3 :0\n size=. >.&$&>/y\n text=. (}:1 3$~2*1+{:size)#\"1\":size$<' '\n 'hdoor vdoor'=. 2 4&*&.>&.> (#&,{@;&i./@$)&.> y\n ' ' (a:-.~0 1;0 2; 0 3;(2 1-~$text);(1 4&+&.> hdoor),,vdoor+&.>\"0/2 1;2 2;2 3)} text\n)\n","language":"J"},{"code":" display 8 maze 11\n+ +---+---+---+---+---+---+---+---+---+---+\n| | | | |\n+ + + + +---+ + +---+---+ + +\n| | | | | | | |\n+ +---+---+ + +---+---+---+ + + +\n| | | | | | |\n+---+ +---+ + + +---+ + +---+---+\n| | | | | | |\n+ + +---+---+ +---+ + +---+---+ +\n| | | | | | | | |\n+ +---+ + + + + +---+---+ + +\n| | | | |\n+ +---+---+---+---+---+---+---+ +---+ +\n| | | | | | | | |\n+ + + + + + + + +---+ + +\n| | | | |\n+---+---+---+---+---+---+---+---+---+---+---+\n","language":"J"},{"code":"package org.rosettacode;\n\nimport java.util.Collections;\nimport java.util.Arrays;\n\n/*\n * recursive backtracking algorithm\n * shamelessly borrowed from the ruby at\n * http://weblog.jamisbuck.org/2010/12/27/maze-generation-recursive-backtracking\n */\npublic class MazeGenerator {\n\tprivate final int x;\n\tprivate final int y;\n\tprivate final int[][] maze;\n\n\tpublic MazeGenerator(int x, int y) {\n\t\tthis.x = x;\n\t\tthis.y = y;\n\t\tmaze = new int[this.x][this.y];\n\t\tgenerateMaze(0, 0);\n\t}\n\n\tpublic void display() {\n\t\tfor (int i = 0; i < y; i++) {\n\t\t\t// draw the north edge\n\t\t\tfor (int j = 0; j < x; j++) {\n\t\t\t\tSystem.out.print((maze[j][i] & 1) == 0 ? \"+---\" : \"+ \");\n\t\t\t}\n\t\t\tSystem.out.println(\"+\");\n\t\t\t// draw the west edge\n\t\t\tfor (int j = 0; j < x; j++) {\n\t\t\t\tSystem.out.print((maze[j][i] & 8) == 0 ? \"| \" : \" \");\n\t\t\t}\n\t\t\tSystem.out.println(\"|\");\n\t\t}\n\t\t// draw the bottom line\n\t\tfor (int j = 0; j < x; j++) {\n\t\t\tSystem.out.print(\"+---\");\n\t\t}\n\t\tSystem.out.println(\"+\");\n\t}\n\n\tprivate void generateMaze(int cx, int cy) {\n\t\tDIR[] dirs = DIR.values();\n\t\tCollections.shuffle(Arrays.asList(dirs));\n\t\tfor (DIR dir : dirs) {\n\t\t\tint nx = cx + dir.dx;\n\t\t\tint ny = cy + dir.dy;\n\t\t\tif (between(nx, x) && between(ny, y)\n\t\t\t\t\t&& (maze[nx][ny] == 0)) {\n\t\t\t\tmaze[cx][cy] |= dir.bit;\n\t\t\t\tmaze[nx][ny] |= dir.opposite.bit;\n\t\t\t\tgenerateMaze(nx, ny);\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate static boolean between(int v, int upper) {\n\t\treturn (v >= 0) && (v < upper);\n\t}\n\n\tprivate enum DIR {\n\t\tN(1, 0, -1), S(2, 0, 1), E(4, 1, 0), W(8, -1, 0);\n\t\tprivate final int bit;\n\t\tprivate final int dx;\n\t\tprivate final int dy;\n\t\tprivate DIR opposite;\n\n\t\t// use the static initializer to resolve forward references\n\t\tstatic {\n\t\t\tN.opposite = S;\n\t\t\tS.opposite = N;\n\t\t\tE.opposite = W;\n\t\t\tW.opposite = E;\n\t\t}\n\n\t\tprivate DIR(int bit, int dx, int dy) {\n\t\t\tthis.bit = bit;\n\t\t\tthis.dx = dx;\n\t\t\tthis.dy = dy;\n\t\t}\n\t};\n\n\tpublic static void main(String[] args) {\n\t\tint x = args.length >= 1 ? (Integer.parseInt(args[0])) : 8;\n\t\tint y = args.length == 2 ? (Integer.parseInt(args[1])) : 8;\n\t\tMazeGenerator maze = new MazeGenerator(x, y);\n\t\tmaze.display();\n\t}\n\n}\n","language":"Java"},{"code":"function maze(x,y) {\n\tvar n=x*y-1;\n\tif (n<0) {alert(\"illegal maze dimensions\");return;}\n\tvar horiz =[]; for (var j= 0; j<x+1; j++) horiz[j]= [],\n\t verti =[]; for (var j= 0; j<x+1; j++) verti[j]= [],\n\t here = [Math.floor(Math.random()*x), Math.floor(Math.random()*y)],\n\t path = [here],\n\t unvisited = [];\n\tfor (var j = 0; j<x+2; j++) {\n\t\tunvisited[j] = [];\n\t\tfor (var k= 0; k<y+1; k++)\n\t\t\tunvisited[j].push(j>0 && j<x+1 && k>0 && (j != here[0]+1 || k != here[1]+1));\n\t}\n\twhile (0<n) {\n\t\tvar potential = [[here[0]+1, here[1]], [here[0],here[1]+1],\n\t\t [here[0]-1, here[1]], [here[0],here[1]-1]];\n\t\tvar neighbors = [];\n\t\tfor (var j = 0; j < 4; j++)\n\t\t\tif (unvisited[potential[j][0]+1][potential[j][1]+1])\n\t\t\t\tneighbors.push(potential[j]);\n\t\tif (neighbors.length) {\n\t\t\tn = n-1;\n\t\t\tnext= neighbors[Math.floor(Math.random()*neighbors.length)];\n\t\t\tunvisited[next[0]+1][next[1]+1]= false;\n\t\t\tif (next[0] == here[0])\n\t\t\t\thoriz[next[0]][(next[1]+here[1]-1)/2]= true;\n\t\t\telse\n\t\t\t\tverti[(next[0]+here[0]-1)/2][next[1]]= true;\n\t\t\tpath.push(here = next);\n\t\t} else\n\t\t\there = path.pop();\n\t}\n\treturn {x: x, y: y, horiz: horiz, verti: verti};\n}\n\nfunction display(m) {\n\tvar text= [];\n\tfor (var j= 0; j<m.x*2+1; j++) {\n\t\tvar line= [];\n\t\tif (0 == j%2)\n\t\t\tfor (var k=0; k<m.y*4+1; k++)\n\t\t\t\tif (0 == k%4)\n\t\t\t\t\tline[k]= '+';\n\t\t\t\telse\n\t\t\t\t\tif (j>0 && m.verti[j/2-1][Math.floor(k/4)])\n\t\t\t\t\t\tline[k]= ' ';\n\t\t\t\t\telse\n\t\t\t\t\t\tline[k]= '-';\n\t\telse\n\t\t\tfor (var k=0; k<m.y*4+1; k++)\n\t\t\t\tif (0 == k%4)\n\t\t\t\t\tif (k>0 && m.horiz[(j-1)/2][k/4-1])\n\t\t\t\t\t\tline[k]= ' ';\n\t\t\t\t\telse\n\t\t\t\t\t\tline[k]= '|';\n\t\t\t\telse\n\t\t\t\t\tline[k]= ' ';\n\t\tif (0 == j) line[1]= line[2]= line[3]= ' ';\n\t\tif (m.x*2-1 == j) line[4*m.y]= ' ';\n\t\ttext.push(line.join('')+'\\r\\n');\n\t}\n\treturn text.join('');\n}\n","language":"JavaScript"},{"code":"<html><head><title></title></head><body><pre id=\"out\"></pre></body></html>\n<script type=\"text/javascript\">\n/* ABOVE CODE GOES HERE */\ndocument.getElementById('out').innerHTML= display(maze(8,11));\n</script>\n","language":"JavaScript"},{"code":"\tfunction step() {\n\t\tif (0<n) {\n","language":"JavaScript"},{"code":"\t\t\tdocument.getElementById('out').innerHTML= display({x: x, y: y, horiz: horiz, verti: verti, here: here});\n\t\t\tsetTimeout(step, 100);\n\t\t}\n\t}\n\tstep();\n","language":"JavaScript"},{"code":"\t\t\t\tif (m.here && m.here[0]*2+1 == j && m.here[1]*4+2 == k)\n\t\t\t\t\tline[k]= '#'\n\t\t\t\telse if (0 == k%4) {\n","language":"JavaScript"},{"code":"\t\t\there= next;\n\t\t\tif (1 < neighbors.length)\n\t\t\t\tpath.push(here);\n","language":"JavaScript"},{"code":"<html><head><title>Maze maker</title>\n<style type=\"text/css\">\ntable { border-collapse: collapse }\ntd { width: 1em; height: 1em; border: 1px solid }\ntd.s { border-bottom: none }\ntd.n { border-top: none }\ntd.w { border-left: none }\ntd.e { border-right: none }\ntd.v { background: skyblue}\n</style>\n<script type=\"application/javascript\">\nNode.prototype.add = function(tag, cnt, txt) {\n\tfor (var i = 0; i < cnt; i++)\n\t\tthis.appendChild(ce(tag, txt));\n}\nNode.prototype.ins = function(tag) {\n\tthis.insertBefore(ce(tag), this.firstChild)\n}\nNode.prototype.kid = function(i) { return this.childNodes[i] }\nNode.prototype.cls = function(t) { this.className += ' ' + t }\n\nNodeList.prototype.map = function(g) {\n\tfor (var i = 0; i < this.length; i++) g(this[i]);\n}\n\nfunction ce(tag, txt) {\n\tvar x = document.createElement(tag);\n\tif (txt !== undefined) x.innerHTML = txt;\n\treturn x\n}\n\nfunction gid(e) { return document.getElementById(e) }\nfunction irand(x) { return Math.floor(Math.random() * x) }\n\nfunction make_maze() {\n\tvar w = parseInt(gid('rows').value || 8, 10);\n\tvar h = parseInt(gid('cols').value || 8, 10);\n\tvar tbl = gid('maze');\n\ttbl.innerHTML = '';\n\ttbl.add('tr', h);\n\ttbl.childNodes.map(function(x) {\n\t\t\tx.add('th', 1);\n\t\t\tx.add('td', w, '*');\n\t\t\tx.add('th', 1)});\n\ttbl.ins('tr');\n\ttbl.add('tr', 1);\n\ttbl.firstChild.add('th', w + 2);\n\ttbl.lastChild.add('th', w + 2);\n\tfor (var i = 1; i <= h; i++) {\n\t\tfor (var j = 1; j <= w; j++) {\n\t\t\ttbl.kid(i).kid(j).neighbors = [\n\t\t\t\ttbl.kid(i + 1).kid(j),\n\t\t\t\ttbl.kid(i).kid(j + 1),\n\t\t\t\ttbl.kid(i).kid(j - 1),\n\t\t\t\ttbl.kid(i - 1).kid(j)\n\t\t\t];\n\t\t}\n\t}\n\twalk(tbl.kid(irand(h) + 1).kid(irand(w) + 1));\n\tgid('solve').style.display='inline';\n}\n\nfunction shuffle(x) {\n\tfor (var i = 3; i > 0; i--) {\n\t\tj = irand(i + 1);\n\t\tif (j == i) continue;\n\t\tvar t = x[j]; x[j] = x[i]; x[i] = t;\n\t}\n\treturn x;\n}\n\nvar dirs = ['s', 'e', 'w', 'n'];\nfunction walk(c) {\n\tc.innerHTML = ' ';\n\tvar idx = shuffle([0, 1, 2, 3]);\n\tfor (var j = 0; j < 4; j++) {\n\t\tvar i = idx[j];\n\t\tvar x = c.neighbors[i];\n\t\tif (x.textContent != '*') continue;\n\t\tc.cls(dirs[i]), x.cls(dirs[3 - i]);\n\t\twalk(x);\n\t}\n}\n\nfunction solve(c, t) {\n\tif (c === undefined) {\n\t\tc = gid('maze').kid(1).kid(1);\n\t\tc.cls('v');\n\t}\n\tif (t === undefined)\n\t\tt = gid('maze')\t.lastChild.previousSibling\n\t\t\t\t.lastChild.previousSibling;\n\n\tif (c === t) return 1;\n\tc.vis = 1;\n\tfor (var i = 0; i < 4; i++) {\n\t\tvar x = c.neighbors[i];\n\t\tif (x.tagName.toLowerCase() == 'th') continue;\n\t\tif (x.vis || !c.className.match(dirs[i]) || !solve(x, t))\n\t\t\tcontinue;\n\n\t\tx.cls('v');\n\t\treturn 1;\n\t}\n\tc.vis = null;\n\treturn 0;\n}\n\n</script></head>\n<body><form><fieldset>\n<label>rows </label><input id='rows' size=\"3\"/>\n<label>colums </label><input id='cols' size=\"3\"/>\n<a href=\"javascript:make_maze()\">Generate</a>\n<a id='solve' style='display:none' href='javascript:solve(); void(0)'>Solve</a>\n</fieldset></form><table id='maze'/></body></html>\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 | (($n-1)|tostring|length) as $w\n | [limit($w; inputs)] | join(\"\") | tonumber\n | if . < $n then . else ($n | prn) end\n end;\n\n# Input: an array\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# Compass is a JSON object {n,s,e,w} representing the four possible\n# directions in which to move, i.e. to open a gate.\n# For example, Compass.n corresponds to a move north (i.e. dx is 0, dy is 1),\n# and Compass.n.gates[\"N\"] is true indicating that the \"northern\" gate should be opened.\ndef Compass:\n {n: { gates: {\"N\": true}, dx: 0, dy: -1},\n s: { gates: {\"S\": true}, dx: 0, dy: 1},\n e: { gates: {\"E\": true}, dx: 1, dy: 0},\n w: { gates: {\"W\": true}, dx:-1, dy: 0} }\n | .n.opposite = .s\n | .s.opposite = .n\n | .e.opposite = .w\n | .w.opposite = .e\n;\n\n# Produce a matrix representing an $x x $y maze.\n# .[$i][$j] represents the box in row $i, column $j.\n# Initially, all the gates of all the boxes are closed.\ndef MazeMatrix($x; $y):\n [range(0;$x) | {} ] as $v | [range(0;$y) | $v];\n\n# Input: a MazeMatrix\ndef generate($cx; $cy):\n def interior($a; $upper): $a >= 0 and $a < $upper;\n length as $x\n | (.[0]|length) as $y\n | Compass as $Compass\n | ([$Compass.n, $Compass.s, $Compass.e, $Compass.w] | knuthShuffle) as $directions\n | reduce $directions[] as $v (.;\n ($cx + $v.dx) as $nx\n | ($cy + $v.dy) as $ny\n | if interior($nx; $x) and interior($ny; $y) and .[$nx][$ny] == {}\n then .[$cx][$cy] += $v.gates\n | .[$nx][$ny] += $v.opposite.gates\n | generate($nx; $ny)\n end );\n\n# Input: a MazeMatrix\ndef display:\n . as $maze\n | ($maze|length) as $x\n | ($maze[0]|length) as $y\n | ( range(0;$y) as $i\n # draw the north edge\n | ([range(0;$x) as $j\n | if $maze[$j][$i][\"N\"] then \"+ \" else \"+---\" end] | join(\"\")) + \"+\",\n # draw the west edge\n ([range(0;$x) as $j\n | if $maze[$j][$i][\"W\"] then \" \" else \"| \" end] | join(\"\")) + \"|\" ),\n # draw the bottom line\n ($x * \"+---\") + \"+\"\n;\n\n# Start the walk at the top left\ndef amaze($x;$y):\n MazeMatrix($x; $y)\n | generate(0; 0)\n | display;\n\n# Example\namaze(4; 5);\n","language":"Jq"},{"code":"using Random\ncheck(bound::Vector) = cell -> all([1, 1] .≤ cell .≤ bound)\nneighbors(cell::Vector, bound::Vector, step::Int=2) =\n filter(check(bound), map(dir -> cell + step * dir, [[0, 1], [-1, 0], [0, -1], [1, 0]]))\n\nfunction walk(maze::Matrix, nxtcell::Vector, visited::Vector=[])\n push!(visited, nxtcell)\n for neigh in shuffle(neighbors(nxtcell, collect(size(maze))))\n if neigh ∉ visited\n maze[round.(Int, (nxtcell + neigh) / 2)...] = 0\n walk(maze, neigh, visited)\n end\n end\n maze\nend\nfunction maze(w::Int, h::Int)\n maze = collect(i % 2 | j % 2 for i in 1:2w+1, j in 1:2h+1)\n firstcell = 2 * [rand(1:w), rand(1:h)]\n return walk(maze, firstcell)\nend\n","language":"Julia"},{"code":"pprint(matrix) = for i = 1:size(matrix, 1) println(join(matrix[i, :])) end\nfunction printmaze(maze)\n walls = split(\"╹ ╸ ┛ ╺ ┗ ━ ┻ ╻ ┃ ┓ ┫ ┏ ┣ ┳ ╋\")\n h, w = size(maze)\n f = cell -> 2 ^ ((3cell[1] + cell[2] + 3) / 2)\n wall(i, j) = if maze[i,j] == 0 \" \" else\n walls[Int(sum(f, filter(x -> maze[x...] != 0, neighbors([i, j], [h, w], 1)) .- [[i, j]]))]\n end\n mazewalls = collect(wall(i, j) for i in 1:2:h, j in 1:w)\n pprint(mazewalls)\nend\n\nprintmaze(maze(10, 10))\n","language":"Julia"},{"code":"import java.util.*\n\nclass MazeGenerator(val x: Int, val y: Int) {\n private val maze = Array(x) { IntArray(y) }\n\n fun generate(cx: Int, cy: Int) {\n Direction.values().shuffle().forEach {\n val nx = cx + it.dx\n val ny = cy + it.dy\n if (between(nx, x) && between(ny, y) && maze[nx][ny] == 0) {\n maze[cx][cy] = maze[cx][cy] or it.bit\n maze[nx][ny] = maze[nx][ny] or it.opposite!!.bit\n generate(nx, ny)\n }\n }\n }\n\n fun display() {\n for (i in 0..y - 1) {\n // draw the north edge\n for (j in 0..x - 1)\n print(if (maze[j][i] and 1 == 0) \"+---\" else \"+ \")\n println('+')\n\n // draw the west edge\n for (j in 0..x - 1)\n print(if (maze[j][i] and 8 == 0) \"| \" else \" \")\n println('|')\n }\n\n // draw the bottom line\n for (j in 0..x - 1) print(\"+---\")\n println('+')\n }\n\n inline private fun <reified T> Array<T>.shuffle(): Array<T> {\n val list = toMutableList()\n Collections.shuffle(list)\n return list.toTypedArray()\n }\n\n private enum class Direction(val bit: Int, val dx: Int, val dy: Int) {\n N(1, 0, -1), S(2, 0, 1), E(4, 1, 0),W(8, -1, 0);\n\n var opposite: Direction? = null\n\n companion object {\n init {\n N.opposite = S\n S.opposite = N\n E.opposite = W\n W.opposite = E\n }\n }\n }\n\n private fun between(v: Int, upper: Int) = v >= 0 && v < upper\n}\n\nfun main(args: Array<String>) {\n val x = if (args.size >= 1) args[0].toInt() else 8\n val y = if (args.size == 2) args[1].toInt() else 8\n with(MazeGenerator(x, y)) {\n generate(0, 0)\n display()\n }\n}\n","language":"Kotlin"},{"code":"math.randomseed( os.time() )\n\n-- Fisher-Yates shuffle from http://santos.nfshost.com/shuffling.html\nfunction shuffle(t)\n for i = 1, #t - 1 do\n local r = math.random(i, #t)\n t[i], t[r] = t[r], t[i]\n end\nend\n\n-- builds a width-by-height grid of trues\nfunction initialize_grid(w, h)\n local a = {}\n for i = 1, h do\n table.insert(a, {})\n for j = 1, w do\n table.insert(a[i], true)\n end\n end\n return a\nend\n\n-- average of a and b\nfunction avg(a, b)\n return (a + b) / 2\nend\n\n\ndirs = {\n {x = 0, y = -2}, -- north\n {x = 2, y = 0}, -- east\n {x = -2, y = 0}, -- west\n {x = 0, y = 2}, -- south\n}\n\nfunction make_maze(w, h)\n w = w or 16\n h = h or 8\n\n local map = initialize_grid(w*2+1, h*2+1)\n\n function walk(x, y)\n map[y][x] = false\n\n local d = { 1, 2, 3, 4 }\n shuffle(d)\n for i, dirnum in ipairs(d) do\n local xx = x + dirs[dirnum].x\n local yy = y + dirs[dirnum].y\n if map[yy] and map[yy][xx] then\n map[avg(y, yy)][avg(x, xx)] = false\n walk(xx, yy)\n end\n end\n end\n\n walk(math.random(1, w)*2, math.random(1, h)*2)\n\n local s = {}\n for i = 1, h*2+1 do\n for j = 1, w*2+1 do\n if map[i][j] then\n table.insert(s, '#')\n else\n table.insert(s, ' ')\n end\n end\n table.insert(s, '\\n')\n end\n return table.concat(s)\nend\n\nprint(make_maze())\n","language":"Lua"},{"code":"Module Maze {\n width% = 40\n height% = 20\n \\\\ we can use DIM maze$(0 to width%,0 to height%)=\"#\"\n \\\\ so we can delete the two For loops\n DIM maze$(0 to width%,0 to height%)\n FOR x% = 0 TO width%\n FOR y% = 0 TO height%\n maze$(x%, y%) = \"#\"\n NEXT y%\n NEXT x%\n\n currentx% = INT(RND * (width% - 1))\n currenty% = INT(RND * (height% - 1))\n\n IF currentx% MOD 2 = 0 THEN currentx%++\n IF currenty% MOD 2 = 0 THEN currenty%++\n maze$(currentx%, currenty%) = \" \"\n\n done% = 0\n WHILE done% = 0 {\n FOR i% = 0 TO 99\n oldx% = currentx%\n oldy% = currenty%\n SELECT CASE INT(RND * 4)\n CASE 0\n IF currentx% + 2 < width% THEN currentx%+=2\n CASE 1\n IF currenty% + 2 < height% THEN currenty%+=2\n CASE 2\n IF currentx% - 2 > 0 THEN currentx%-=2\n CASE 3\n IF currenty% - 2 > 0 THEN currenty%-=2\n END SELECT\n IF maze$(currentx%, currenty%) = \"#\" Then {\n maze$(currentx%, currenty%) = \" \"\n maze$(INT((currentx% + oldx%) / 2), ((currenty% + oldy%) / 2)) = \" \"\n }\n NEXT i%\n done% = 1\n FOR x% = 1 TO width% - 1 STEP 2\n FOR y% = 1 TO height% - 1 STEP 2\n IF maze$(x%, y%) = \"#\" THEN done% = 0\n NEXT y%\n NEXT x%\n }\n\n\n FOR y% = 0 TO height%\n FOR x% = 0 TO width%\n PRINT maze$(x%, y%);\n NEXT x%\n PRINT\n NEXT y%\n}\nMaze\n","language":"M2000-Interpreter"},{"code":"Module Maze2 {\n \\\\ depth-first search\n Profiler\n Form 80,50\n let w=60, h=40\n Double\n \\\\center proportional text double size\n Report 2, Format$(\"Maze {0}x{1}\",w,h)\n Normal\n Refresh\n Set Fast !\n Dim maze$(1 to w+1, 1 to h+1)=\"#\"\n Include=Lambda w,h (a,b) ->a>=1 and a<=w and b>=1 and b<=h\n Flush ' empty stack\n if random(1,2)=1 then {\n entry=(if(random(1,2)=1->2, w),Random(1, h/2)*2)\n } else {\n entry=(random(1,w/2)*2,If(Random(1,2)=1->2,h))\n }\n maze$(entry#val(0), entry#val(1))=\" \"\n forchoose=(,)\n Push Entry\n do {\n do {\n NewForChoose(!entry)\n status=len(forchoose)\n if status>0 then {\n status--\n forchoose=forchoose#val(random(0,status))\n Push forchoose\n OpenDoor(!Entry, !forchoose)\n Rem : ShowMaze()\n } else exit\n entry=forchoose\n } Always\n if empty then exit\n Read entry\n } Always\n ShowMaze()\n Print timecount/1000\n Sub NewForChoose(x,y)\n Local x1=x-2, x2=x+2, y1=y-2, y2=y+2, arr=(,)\n Stack New {\n if include(x1,y) then if Maze$(x1,y)<>\" \" Then push (x1, y)\n if include(x2,y) then if Maze$(x2,y)<>\" \" Then push (x2, y)\n if include(x,y1) then if Maze$(x,y1)<>\" \" Then push (x, y1)\n if include(x,y2) then if Maze$(x,y2)<>\" \" Then push (x, y2)\n forchoose= Array([])\n }\n End Sub\n Sub OpenDoor(x1,y1, x2,y2)\n Local i\n if x1=x2 then {\n y1+=y2<=>y1\n for i=y1 to y2 {maze$(x1, i)=\" \" }\n } Else {\n x1+=x2<=>x1\n for i=x1 to x2 {maze$(i, y1)=\" \"}\n }\n End Sub\n Sub ShowMaze()\n Refresh 5000\n cls ,4 ' split screen - preserve lines form 0 to 3\n Local i, j\n For j=1 to h+1 { Print @(10) : for i=1 to w+1 {Print maze$(i,j);}:Print}\n Print\n Refresh 100\n End Sub\n}\nMaze2\n","language":"M2000-Interpreter"},{"code":"MazeGraphics[m_, n_] :=\n Block[{$RecursionLimit = Infinity,\n unvisited = Tuples[Range /@ {m, n}], maze},\n maze = Graphics[{Line[{{#, # - {0, 1}}, {#, # - {1, 0}}}] & /@\n unvisited,\n Line[{{0, n}, {0, 0}, {m, 0}}]}]; {unvisited =\n DeleteCases[unvisited, #];\n Do[If[MemberQ[unvisited, neighbor],\n maze = DeleteCases[\n maze, {#,\n neighbor - {1, 1}} | {neighbor, # - {1, 1}}, {5}]; #0@\n neighbor], {neighbor,\n RandomSample@{# + {0, 1}, # - {0, 1}, # + {1, 0}, # - {1,\n 0}}}]} &@RandomChoice@unvisited; maze];\nmaze = MazeGraphics[21, 13]\n","language":"Mathematica"},{"code":"MazeGraph[m_, n_] :=\n Block[{$RecursionLimit = Infinity, grid = GridGraph[{m, n}],\n unvisitedQ}, unvisitedQ[_] := True;\n Graph[Range[m n], Reap[{unvisitedQ[#] = False;\n Do[\n If[unvisitedQ[neighbor],\n Sow[# <-> neighbor]; #0@neighbor], {neighbor,\n RandomSample@AdjacencyList[grid, #]}]} &@\n RandomChoice@VertexList@grid][[2, 1]],\n GraphLayout -> {\"GridEmbedding\", \"Dimension\" -> {m, n}}]];\nmaze = MazeGraph[13, 21]\n","language":"Mathematica"},{"code":"function M = makeMaze(n)\n showProgress = false;\n\n colormap([1,1,1;1,1,1;0,0,0]);\n set(gcf,'color','w');\n\n NoWALL = 0;\n WALL = 2;\n NotVISITED = -1;\n VISITED = -2;\n\n m = 2*n+3;\n M = NotVISITED(ones(m));\n offsets = [-1, m, 1, -m];\n\n M([1 2:2:end end],:) = WALL;\n M(:,[1 2:2:end end]) = WALL;\n\n currentCell = sub2ind(size(M),3,3);\n M(currentCell) = VISITED;\n\n S = currentCell;\n\n while (~isempty(S))\n moves = currentCell + 2*offsets;\n unvistedNeigbors = find(M(moves)==NotVISITED);\n\n if (~isempty(unvistedNeigbors))\n next = unvistedNeigbors(randi(length(unvistedNeigbors),1));\n M(currentCell + offsets(next)) = NoWALL;\n\n newCell = currentCell + 2*offsets(next);\n if (any(M(newCell+2*offsets)==NotVISITED))\n S = [S newCell];\n end\n\n currentCell = newCell;\n M(currentCell) = VISITED;\n else\n currentCell = S(1);\n S = S(2:end);\n end\n\n if (showProgress)\n image(M-VISITED);\n axis equal off;\n drawnow;\n pause(.01);\n end\n end\n\n image(M-VISITED);\n axis equal off;\n","language":"MATLAB"},{"code":"import random, sequtils, strutils\nrandomize()\n\niterator randomCover[T](xs: openarray[T]): T =\n var js = toSeq 0..xs.high\n for i in countdown(js.high, 0):\n let j = random(i)\n swap(js[i], js[j])\n for j in js:\n yield xs[j]\n\nconst\n w = 14\n h = 10\n\nvar\n vis = newSeqWith(h, newSeq[bool](w))\n hor = newSeqWith(h+1, newSeqWith(w, \"+---\"))\n ver = newSeqWith(h, newSeqWith(w, \"| \") & \"|\")\n\nproc walk(x, y: int) =\n vis[y][x] = true\n for p in [[x-1,y], [x,y+1], [x+1,y], [x,y-1]].randomCover:\n if p[0] notin 0 ..< w or p[1] notin 0 ..< h or vis[p[1]][p[0]]: continue\n if p[0] == x: hor[max(y, p[1])][x] = \"+ \"\n if p[1] == y: ver[y][max(x, p[0])] = \" \"\n walk p[0], p[1]\n\nwalk rand(0..<w), rand(0..<h)\nfor a,b in zip(hor, ver & @[\"\"]).items:\n echo join(a & \"+\\n\" & b)\n","language":"Nim"},{"code":"let seen = Hashtbl.create 7\nlet mark t = Hashtbl.add seen t true\nlet marked t = Hashtbl.mem seen t\n\nlet walls = Hashtbl.create 7\nlet ord a b = if a <= b then (a,b) else (b,a)\nlet join a b = Hashtbl.add walls (ord a b) true\nlet joined a b = Hashtbl.mem walls (ord a b)\n\nlet () =\n let nx = int_of_string Sys.argv.(1) in\n let ny = int_of_string Sys.argv.(2) in\n\n let shuffle lst =\n let nl = List.map (fun c -> (Random.bits (), c)) lst in\n List.map snd (List.sort compare nl) in\n\n let get_neighbours (x,y) =\n let lim n k = (0 <= k) && (k < n) in\n let bounds (x,y) = lim nx x && lim ny y in\n List.filter bounds [(x-1,y);(x+1,y);(x,y-1);(x,y+1)] in\n\n let rec visit cell =\n mark cell;\n let check k =\n if not (marked k) then (join cell k; visit k) in\n List.iter check (shuffle (get_neighbours cell)) in\n\n let print_maze () =\n begin\n for i = 1 to nx do print_string \"+---\";done; print_endline \"+\";\n let line n j k l s t u =\n for i = 0 to n do print_string (if joined (i,j) (i+k,j+l) then s else t) done;\n print_endline u in\n for j = 0 to ny-2 do\n print_string \"| \";\n line (nx-2) j 1 0 \" \" \"| \" \"|\";\n line (nx-1) j 0 1 \"+ \" \"+---\" \"+\";\n done;\n print_string \"| \";\n line (nx-2) (ny-1) 1 0 \" \" \"| \" \"|\";\n for i = 1 to nx do print_string \"+---\";done; print_endline \"+\";\n end in\n\n Random.self_init();\n visit (Random.int nx, Random.int ny);\n print_maze ();\n","language":"OCaml"},{"code":"; maze generation\n(import (otus random!))\n(define WIDTH 30)\n(define HEIGHT 8)\n\n(define maze\n (map (lambda (?)\n (repeat #b01111 WIDTH)) ; 0 - unvisited, 1111 - all walls exists\n (iota HEIGHT)))\n(define (at x y)\n (list-ref (list-ref maze y) x))\n\n(define (unvisited? x y)\n (if (and (< -1 x WIDTH) (< -1 y HEIGHT))\n (zero? (band (at x y) #b10000))))\n(define neighbors '((-1 . 0) (0 . -1) (+1 . 0) (0 . +1)))\n(define walls '( #b10111 #b11011 #b11101 #b11110))\n(define antiwalls '( #b11101 #b11110 #b10111 #b11011))\n\n(let loop ((x (rand! WIDTH)) (y (rand! HEIGHT)))\n (list-set! (list-ref maze y) x (bor (at x y) #b10000))\n (let try ()\n (if (or\n (unvisited? (- x 1) y) ; left\n (unvisited? x (- y 1)) ; top\n (unvisited? (+ x 1) y) ; right\n (unvisited? x (+ y 1))) ; bottom\n (let*((p (rand! 4))\n (neighbor (list-ref neighbors p)))\n (let ((nx (+ x (car neighbor)))\n (ny (+ y (cdr neighbor))))\n (if (unvisited? nx ny)\n (let ((ncell (at nx ny)))\n (list-set! (list-ref maze y) x (band (at x y) (list-ref walls p)))\n (list-set! (list-ref maze ny) nx (band ncell (list-ref antiwalls p)))\n (loop nx ny)))\n (try))))))\n","language":"Ol"},{"code":"; maze printing:\n(display \"+\")\n(for-each (lambda (?) (display \"--+\")) (iota WIDTH))\n(print)\n(for-each (lambda (l)\n ; left wall (always)\n (display \"|\")\n ; draw right wall\n (for-each (lambda (x)\n (display \" \")\n (display (if (zero? (band x #b10)) \" \" \"|\")))\n l)\n (print)\n (display \"+\")\n ; draw bottom wall\n (for-each (lambda (x)\n (display (if (zero? (band x #b01)) \" \" \"--\"))\n (display \"+\"))\n l)\n (print))\n maze)\n(print)\n","language":"Ol"},{"code":"use List::Util 'max';\n\nmy ($w, $h) = @ARGV;\n$w ||= 26;\n$h ||= 127;\nmy $avail = $w * $h;\n\n# cell is padded by sentinel col and row, so I don't check array bounds\nmy @cell = (map([(('1') x $w), 0], 1 .. $h), [('') x ($w + 1)]);\nmy @ver = map([(\"| \") x $w], 1 .. $h);\nmy @hor = map([(\"+--\") x $w], 0 .. $h);\n\nsub walk {\n\tmy ($x, $y) = @_;\n\t$cell[$y][$x] = '';\n\t$avail-- or return;\t# no more bottles, er, cells\n\n\tmy @d = ([-1, 0], [0, 1], [1, 0], [0, -1]);\n\twhile (@d) {\n\t\tmy $i = splice @d, int(rand @d), 1;\n\t\tmy ($x1, $y1) = ($x + $i->[0], $y + $i->[1]);\n\n\t\t$cell[$y1][$x1] or next;\n\n\t\tif ($x == $x1) { $hor[ max($y1, $y) ][$x] = '+ ' }\n\t\tif ($y == $y1) { $ver[$y][ max($x1, $x) ] = ' ' }\n\t\twalk($x1, $y1);\n\t}\n}\n\nwalk(int rand $w, int rand $h);\t# generate\n\nfor (0 .. $h) {\t\t\t# display\n\tprint @{$hor[$_]}, \"+\\n\";\n\tprint @{$ver[$_]}, \"|\\n\" if $_ < $h;\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #000080;font-style:italic;\">--\n -- grid is eg for w=3,h=2: {\"+---+---+---+\", -- (\"wall\")\n -- \"| ? | ? | ? |\", -- (\"cell\")\n -- \"+---+---+---+\", -- (\"wall\")\n -- \"| ? | ? | ? |\", -- (\"cell\")\n -- \"+---+---+---+\", -- (\"wall\")\n -- \"\"} -- (for a trailing \\n)\n --\n -- note those ?(x,y) are at [y*2][x*4-1], and we navigate\n -- using y=2..2*h (+/-2), x=3..w*4-1 (+/-4) directly.\n --</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">w</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">h</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">8</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> <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\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">amaze</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: #004080;\">integer</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">)</span>\n <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: #0000FF;\">=</span> <span style=\"color: #008000;\">' '</span> <span style=\"color: #000080;font-style:italic;\">-- mark cell visited</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shuffle</span><span style=\"color: #0000FF;\">({{</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">4</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: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">4</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: #000000;\">y</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;\">p</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;\">nx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ny</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>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">nx</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">nx</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">ny</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">ny</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">h</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">ny</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">nx</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #008000;\">'?'</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">mx</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;\">nx</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">2</span>\n <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;\">ny</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">mx</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">mx</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> <span style=\"color: #000080;font-style:italic;\">-- knock down wall</span>\n <span style=\"color: #000000;\">amaze</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ny</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;\">procedure</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">heads</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">rand</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: #000080;font-style:italic;\">-- 50:50 true(1)/false(0)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\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: #0000FF;\">{(</span><span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">rand</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;\">amaze</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: #000080;font-style:italic;\">-- mark start pos</span>\n <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: #0000FF;\">=</span> <span style=\"color: #008000;\">'*'</span>\n <span style=\"color: #000080;font-style:italic;\">-- add a random door (heads=rhs/lhs, tails=top/btm)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">heads</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: #7060A8;\">rand</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><span style=\"color: #000000;\">heads</span><span style=\"color: #0000FF;\">()*</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">4</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;\">else</span>\n <span style=\"color: #000000;\">x</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">heads</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><span style=\"color: #000000;\">1</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;\">x</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;\">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;\">\"%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":"<?php\nclass Maze\n{\n protected $width;\n protected $height;\n protected $grid;\n protected $path;\n protected $horWalls;\n protected $vertWalls;\n protected $dirs;\n protected $isDebug;\n\n public function __construct($x, $y, $debug = false)\n {\n $this->width = $x;\n $this->height = $y;\n $this->path = [];\n $this->dirs = [ [0, -1], [0, 1], [-1, 0], [1, 0]]; // array of coordinates of N,S,W,E\n $this->horWalls = []; // list of removed horizontal walls (---+)\n $this->vertWalls = [];// list of removed vertical walls (|)\n $this->isDebug = $debug; // debug flag\n\n // generate the maze:\n $this->generate();\n }\n\n protected function generate()\n {\n $this->initMaze(); // init the stack and an unvisited grid\n // start from a random cell and then proceed recursively\n $this->walk(mt_rand(0, $this->width-1), mt_rand(0, $this->height-1));\n }\n\n /**\n * Actually prints the Maze, on stdOut. Put in a separate method to allow extensibility\n * For simplicity sake doors are positioned on the north wall and east wall\n */\n public function printOut()\n {\n $this->log(\"Horizontal walls: %s\", json_encode($this->horWalls));\n $this->log(\"Vertical walls: %s\", json_encode($this->vertWalls));\n\n $northDoor = mt_rand(0,$this->width-1);\n $eastDoor = mt_rand(0, $this->height-1);\n\n $str = '+';\n for ($i=0;$i<$this->width;$i++) {\n $str .= ($northDoor == $i) ? ' +' : '---+';\n }\n $str .= PHP_EOL;\n for ($i=0; $i<$this->height; $i++) {\n\n for ($j=0; $j<$this->width; $j++) {\n $str .= (!empty($this->vertWalls[$j][$i]) ? $this->vertWalls[$j][$i] : '| ');\n }\n $str .= ($i == $eastDoor ? ' ' : '|').PHP_EOL.'+';\n for ($j=0; $j<$this->width; $j++) {\n $str .= (!empty($this->horWalls[$j][$i]) ? $this->horWalls[$j][$i] : '---+');\n }\n $str .= PHP_EOL;\n }\n echo $str;\n }\n\n /**\n * Logs to stdOut if debug flag is enabled\n */\n protected function log(...$params)\n {\n if ($this->isDebug) {\n echo vsprintf(array_shift($params), $params).PHP_EOL;\n }\n }\n\n private function walk($x, $y)\n {\n $this->log('Entering cell %d,%d', $x, $y);\n // mark current cell as visited\n $this->grid[$x][$y] = true;\n // add cell to path\n $this->path[] = [$x, $y];\n // get list of all neighbors\n $neighbors = $this->getNeighbors($x, $y);\n $this->log(\"Valid neighbors: %s\", json_encode($neighbors));\n\n if(empty($neighbors)) {\n // Dead end, we need now to backtrack, if there's still any cell left to be visited\n $this->log(\"Start backtracking along path: %s\", json_encode($this->path));\n array_pop($this->path);\n if (!empty($this->path)) {\n $next = array_pop($this->path);\n return $this->walk($next[0], $next[1]);\n }\n } else {\n // randomize neighbors, as per request\n shuffle($neighbors);\n\n foreach ($neighbors as $n) {\n $nextX = $n[0];\n $nextY = $n[1];\n if ($nextX == $x) {\n $wallY = max($nextY, $y);\n $this->log(\"New cell is on the same column (%d,%d), removing %d, (%d-1) horizontal wall\", $nextX, $nextY, $x, $wallY);\n $this->horWalls[$x][min($nextY, $y)] = \" +\";\n }\n if ($nextY == $y) {\n $wallX = max($nextX, $x);\n $this->log(\"New cell is on the same row (%d,%d), removing %d,%d vertical wall\", $nextX, $nextY, $wallX, $y);\n $this->vertWalls[$wallX][$y] = \" \";\n }\n return $this->walk($nextX, $nextY);\n }\n }\n }\n\n /**\n * Initialize an empty grid of $width * $height dimensions\n */\n private function initMaze()\n {\n for ($i=0;$i<$this->width;$i++) {\n for ($j = 0;$j<$this->height;$j++) {\n $this->grid[$i][$j] = false;\n }\n }\n }\n\n /**\n * @param int $x\n * @param int $y\n * @return array\n */\n private function getNeighbors($x, $y)\n {\n $neighbors = [];\n foreach ($this->dirs as $dir) {\n $nextX = $dir[0] + $x;\n $nextY = $dir[1] + $y;\n if (($nextX >= 0 && $nextX < $this->width && $nextY >= 0 && $nextY < $this->height) && !$this->grid[$nextX][$nextY]) {\n $neighbors[] = [$nextX, $nextY];\n }\n }\n return $neighbors;\n }\n}\n\n$maze = new Maze(10,10);\n$maze->printOut();\n","language":"PHP"},{"code":"main =>\n gen_maze(8,8).\n\nmain([RStr,CStr]) =>\n MaxR = to_int(RStr),\n MaxC = to_int(CStr),\n gen_maze(MaxR,MaxC).\n\ngen_maze(MaxR,MaxC) =>\n Maze = new_array(MaxR,MaxC),\n foreach (R in 1..MaxR, C in 1..MaxC)\n Maze[R,C] = 0\n end,\n gen_maze(Maze,MaxR,MaxC,1,1),\n display_maze(Maze,MaxR,MaxC).\n\ngen_maze(Maze,MaxR,MaxC,R,C) =>\n Dirs = shuffle([left, right, up, down]),\n foreach (Dir in Dirs)\n dir(Dir,Dr,Dc,B,OB),\n R1 := R+Dr,\n C1 := C+Dc,\n if (R1 >= 1 && R1 =< MaxR && C1 >= 1 && C1 =< MaxC && Maze[R1,C1] == 0) then\n Maze[R,C] := Maze[R,C] \\/ B,\n Maze[R1,C1] := Maze[R1,C1] \\/ OB,\n gen_maze(Maze,MaxR,MaxC,R1,C1)\n end\n end.\n\n% dir(direction, Dr, Dc, Bit, OppBit)\ndir(left, 0, -1, 1, 2).\ndir(right, 0, 1, 2, 1).\ndir(up, -1, 0, 4, 8).\ndir(down, 1, 0, 8, 4).\n\nshuffle(Arr) = Res =>\n foreach (_ in 1..10)\n I1 = random() mod 4 + 1,\n I2 = random() mod 4 + 1,\n T := Arr[I1],\n Arr[I1] := Arr[I2],\n Arr[I2] := T\n end,\n Res = Arr.\n\ndisplay_maze(Maze,MaxR,MaxC) =>\n foreach (R in 1..MaxR)\n foreach (C in 1..MaxC)\n printf(\"%s\", cond(Maze[R,C] /\\ 4 == 0, \"+---\", \"+ \"))\n end,\n println(\"+\"),\n foreach (C in 1..MaxC)\n printf(\"%s\", cond(Maze[R,C] /\\ 1 == 0, \"| \", \" \")),\n end,\n println(\"|\")\n end,\n foreach (C in 1..MaxC)\n print(\"+---\")\n end,\n println(\"+\").\n","language":"Picat"},{"code":"(load \"@lib/simul.l\")\n\n(de maze (DX DY)\n (let Maze (grid DX DY)\n (let Fld (get Maze (rand 1 DX) (rand 1 DY))\n (recur (Fld)\n (for Dir (shuffle '((west . east) (east . west) (south . north) (north . south)))\n (with ((car Dir) Fld)\n (unless (or (: west) (: east) (: south) (: north))\n (put Fld (car Dir) This)\n (put This (cdr Dir) Fld)\n (recurse This) ) ) ) ) )\n (for (X . Col) Maze\n (for (Y . This) Col\n (set This\n (cons\n (cons\n (: west)\n (or\n (: east)\n (and (= Y 1) (= X DX)) ) )\n (cons\n (: south)\n (or\n (: north)\n (and (= X 1) (= Y DY)) ) ) ) ) ) )\n Maze ) )\n\n(de display (Maze)\n (disp Maze 0 '((This) \" \")) )\n","language":"PicoLisp"},{"code":"*process source attributes xref or(!);\n mgg: Proc Options(main);\n /* REXX ***************************************************************\n * 04.09.2013 Walter Pachl translated from REXX version 3\n **********************************************************************/\n Dcl (MIN,MOD,RANDOM,REPEAT,SUBSTR) Builtin;\n Dcl SYSIN STREAM INPUT;\n Dcl print Print;\n Dcl imax Bin Fixed(31) init(10);\n Dcl jmax Bin Fixed(31) init(15);\n Dcl seed Bin Fixed(31) init(4711);\n Get File(sysin) Data(imax,jmax,seed);\n Dcl ii Bin Fixed(31);\n Dcl jj Bin Fixed(31);\n Dcl id Bin Fixed(31);\n Dcl jd Bin Fixed(31);\n id=2*imax+1; /* vertical dimension of a.i.j */\n jd=2*jmax+1; /* horizontal dimension of a.i.j */\n Dcl c Char(2000) Var;\n c=repeat('123456789'!!'abcdefghijklmnopqrstuvwxyz'!!\n 'ABCDEFGHIJKLMNOPQRSTUVWXYZ',20);\n Dcl x Bin Float(53);\n x=random(seed);\n Dcl ps Bin Fixed(31) Init(1); /* first position */\n Dcl na Bin Fixed(31) Init(1); /* number of points used */\n Dcl si Bin Fixed(31); /* loop to compute paths */\n Begin;\n Dcl a(id,jd) Bin Fixed(15);\n Dcl p(imax,jmax) Char(1);\n Dcl 1 pl(imax*jmax),\n 2 ic Bin Fixed(15),\n 2 jc Bin Fixed(15);\n Dcl 1 np(imax*jmax),\n 2 ic Bin Fixed(15),\n 2 jc Bin Fixed(15);\n Dcl 1 pos(imax*jmax),\n 2 ic Bin Fixed(15),\n 2 jc Bin Fixed(15);\n Dcl npl Bin Fixed(31) Init(0);\n a=1; /* mark all borders present */\n p='.'; /* Initialize all grid points */\n ii=rnd(imax); /* find a start position */\n jj=rnd(jmax);\n Do si=1 To 1000; /* Do Forever - see Leave */\n Call path(ii,jj); /* compute a path starting at ii/jj */\n If na=imax*jmax Then /* all points used */\n Leave; /* we are done */\n Call select_next(ii,jj); /* get a new start from a path*/\n End;\n Call show;\n Return;\n\n path: Procedure(ii,jj);\n /**********************************************************************\n * compute a path starting from point (ii,jj)\n **********************************************************************/\n Dcl ii Bin Fixed(31);\n Dcl jj Bin Fixed(31);\n Dcl nb Bin Fixed(31);\n Dcl ch Bin Fixed(31);\n Dcl pp Bin Fixed(31);\n p(ii,jj)='1';\n pos.ic(ps)=ii;\n pos.jc(ps)=jj;\n Do pp=1 to 50; /* compute a path of maximum length 50*/\n nb=neighbors(ii,jj); /* number of free neighbors */\n Select;\n When(nb=1) /* just one */\n Call advance((1),ii,jj); /* go for it */\n When(nb>0) Do; /* more Than 1 */\n ch=rnd(nb); /* choose one possibility */\n Call advance(ch,ii,jj); /* and go for that */\n End;\n Otherwise /* none available */\n Leave;\n End;\n End;\n End;\n\n neighbors: Procedure(i,j) Returns(Bin Fixed(31));\n /**********************************************************************\n * count the number of free neighbors of point (i,j)\n **********************************************************************/\n Dcl i Bin Fixed(31);\n Dcl j Bin Fixed(31);\n Dcl in Bin Fixed(31);\n Dcl jn Bin Fixed(31);\n Dcl nb Bin Fixed(31) Init(0);\n in=i-1; If in>0 Then Call check(in,j,nb);\n in=i+1; If in<=imax Then Call check(in,j,nb);\n jn=j-1; If jn>0 Then Call check(i,jn,nb);\n jn=j+1; If jn<=jmax Then Call check(i,jn,nb);\n Return(nb);\n End;\n\n check: Procedure(i,j,n);\n /**********************************************************************\n * check if point (i,j) is free and note it as possible successor\n **********************************************************************/\n Dcl i Bin Fixed(31);\n Dcl j Bin Fixed(31);\n Dcl n Bin Fixed(31);\n If p(i,j)='.' Then Do; /* point is free */\n n+=1; /* number of free neighbors */\n np.ic(n)=i; /* note it as possible choice */\n np.jc(n)=j;\n End;\n End;\n\n advance: Procedure(ch,ii,jj);\n /**********************************************************************\n * move to the next point of the current path\n **********************************************************************/\n Dcl ch Bin Fixed(31);\n Dcl ii Bin Fixed(31);\n Dcl jj Bin Fixed(31);\n Dcl ai Bin Fixed(31);\n Dcl aj Bin Fixed(31);\n Dcl pii Bin Fixed(31) Init((ii));\n Dcl pjj Bin Fixed(31) Init((jj));\n Dcl z Bin Fixed(31);\n ii=np.ic(ch);\n jj=np.jc(ch);\n ps+=1; /* position number */\n pos.ic(ps)=ii; /* note its coordinates */\n pos.jc(ps)=jj;\n p(ii,jj)=substr(c,ps,1); /* mark the point as used */\n ai=pii+ii; /* vertical border position */\n aj=pjj+jj; /* horizontal border position */\n a(ai,aj)=0; /* tear the border down */\n na+=1; /* number of used positions */\n z=npl+1; /* add the point to the list */\n pl.ic(z)=ii; /* of follow-up start pos. */\n pl.jc(z)=jj;\n npl=z;\n End;\n\n show: Procedure;\n /*********************************************************************\n * Show the resulting maze\n *********************************************************************/\n Dcl i Bin Fixed(31);\n Dcl j Bin Fixed(31);\n Dcl ol Char(300) Var;\n Put File(print) Edit('mgg',imax,jmax,seed)(Skip,a,3(f(4)));\n Put File(print) Skip Data(na);\n Do i=1 To id;\n ol='';\n Do j=1 To jd;\n If mod(i,2)=1 Then Do; /* odd lines */\n If a(i,j)=1 Then Do; /* border to be drawn */\n If mod(j,2)=0 Then\n ol=ol!!'---'; /* draw the border */\n Else\n ol=ol!!'+';\n End;\n Else Do; /* border was torn down */\n If mod(j,2)=0 Then\n ol=ol!!' '; /* blanks instead of border */\n Else\n ol=ol!!'+';\n End;\n End;\n Else Do; /* even line */\n If a(i,j)=1 Then Do;\n If mod(j,2)=0 Then /* even column */\n ol=ol!!' '; /* moving space */\n Else /* odd column */\n ol=ol!!'!'; /* draw the border */\n End;\n Else /* border was torn down */\n ol=ol!!' '; /* blank instead of border */\n End;\n End;\n Select;\n When(i=6) substr(ol,11,1)='A';\n When(i=8) substr(ol, 3,1)='B';\n Otherwise;\n End;\n Put File(print) Edit(ol,i)(Skip,a,f(3));\n End;\n End;\n\n select_next: Procedure(is,js);\n /**********************************************************************\n * look for a point to start the nnext path\n **********************************************************************/\n Dcl is Bin Fixed(31);\n Dcl js Bin Fixed(31);\n Dcl n Bin Fixed(31);\n Dcl nb Bin Fixed(31);\n Dcl s Bin Fixed(31);\n Do Until(nb>0); /* loop until one is found */\n n=npl; /* number of points recorded */\n s=rnd(n); /* pick a random index */\n is=pl.ic(s); /* its coordinates */\n js=pl.jc(s);\n nb=neighbors(is,js); /* count free neighbors */\n If nb=0 Then Do; /* if there is none */\n pl.ic(s)=pl.ic(n); /* remove this point */\n pl.jc(s)=pl.jc(n);\n npl-=1;\n End;\n End;\n End;\n\n rnd: Proc(n) Returns(Bin Fixed(31));\n /*********************************************************************\n * return a pseudo-random integer between 1 and n\n *********************************************************************/\n dcl (r,n) Bin Fixed(31);\n r=min(random()*n+1,n);\n Return(r);\n End;\n\n End;\n End;\n","language":"PL-I"},{"code":"int g_size = 10;\ncolor background_color = color (80, 80, 220);\ncolor runner = color (255, 50, 50);\ncolor visited_color = color(220, 240, 240);\ncolor done_color = color (100, 160, 250);\nint c_size;\n\nCell[][] cell;\nArrayList<Cell> done = new ArrayList<Cell>();\nArrayList<Cell> visit = new ArrayList<Cell>();\nCell run_cell;\n\nvoid setup() {\n size(600, 600);\n frameRate(20);\n smooth(4);\n strokeCap(ROUND);\n c_size = max(width/g_size, height/g_size);\n cell = new Cell[g_size][g_size];\n for (int i = 0; i < g_size; i++) {\n for (int j = 0; j < g_size; j++) {\n cell[i][j] = new Cell(i, j);\n }\n }\n for (int i = 0; i < g_size; i++) {\n for (int j = 0; j < g_size; j++) {\n cell[i][j].add_neighbor();\n }\n }\n run_cell = cell[0][0];\n visit.add(run_cell);\n}\n\nvoid draw() {\n background(background_color);\n for (int i = 0; i < g_size; i++) {\n for (int j = 0; j < g_size; j++) {\n cell[i][j].draw_cell();\n cell[i][j].draw_wall();\n }\n }\n if (visit.size() < g_size*g_size) {\n if (run_cell.check_sides()) {\n Cell chosen = run_cell.pick_neighbor();\n done.add(run_cell);\n run_cell.stacked = true;\n if (chosen.i - run_cell.i == 1) {\n run_cell.wall[1] = false;\n chosen.wall[3] = false;\n } else if (chosen.i - run_cell.i == -1) {\n run_cell.wall[3] = false;\n chosen.wall[1] = false;\n } else if (chosen.j - run_cell.j == 1) {\n run_cell.wall[2] = false;\n chosen.wall[0] = false;\n } else {\n run_cell.wall[0] = false;\n chosen.wall[2] = false;\n }\n run_cell.current = false;\n run_cell = chosen;\n run_cell.current = true;\n run_cell.visited = true;\n } else if (done.size()>0) {\n run_cell.current = false;\n run_cell = done.remove(done.size()-1);\n run_cell.stacked = false;\n run_cell.current = true;\n }\n }\n}\n\nclass Cell {\n ArrayList<Cell> neighbor;\n boolean visited, stacked, current;\n boolean[] wall;\n int i, j;\n\n Cell(int _i, int _j) {\n i = _i;\n j = _j;\n wall = new boolean[]{true,true,true,true};\n }\n\n Cell pick_neighbor() {\n ArrayList<Cell> unvisited = new ArrayList<Cell>();\n for(int i = 0; i < neighbor.size(); i++){\n Cell nb = neighbor.get(i);\n if(nb.visited == false) unvisited.add(nb);\n }\n return unvisited.get(floor(random(unvisited.size())));\n }\n\n void add_neighbor() {\n neighbor = new ArrayList<Cell>();\n if(i>0){neighbor.add(cell[i-1][j]);}\n if(i<g_size-1){neighbor.add(cell[i+1][j]);}\n if(j>0){neighbor.add(cell[i][j-1]);}\n if(j<g_size-1){neighbor.add(cell[i][j+1]);}\n }\n\n boolean check_sides() {\n for(int i = 0; i < neighbor.size(); i++){\n Cell nb = neighbor.get(i);\n if(!nb.visited) return true;\n }\n return false;\n }\n\n void draw_cell() {\n noStroke();\n noFill();\n if(current) fill(runner);\n else if(stacked) fill(done_color);\n else if(visited) fill(visited_color);\n rect(j*c_size,i*c_size,c_size,c_size);\n }\n\n void draw_wall() {\n stroke(0);\n strokeWeight(5);\n if(wall[0]) line(j*c_size, i*c_size, j*c_size, (i+1)* c_size);\n if(wall[1]) line(j*c_size, (i+1)*c_size, (j+1)*c_size, (i+1)*c_size);\n if(wall[2]) line((j+1)*c_size, (i+1)*c_size, (j+1)*c_size, i*c_size);\n if(wall[3]) line((j+1)*c_size, i*c_size, j*c_size, i*c_size);\n }\n}\n","language":"Processing"},{"code":"g_size = 10\nbackground_color = color(80, 80, 220)\nrunner = color(255, 50, 50)\nvisited_color = color(220, 240, 240)\ndone_color = color(100, 160, 250)\n\ndef setup():\n global cell, done, visit, run_cell, c_size\n size(600, 600)\n frameRate(20)\n smooth(4)\n strokeCap(ROUND)\n c_size = max(width / g_size, height / g_size)\n cell = [[None] * g_size for _ in range(g_size)]\n\n for i in range(g_size):\n for j in range(g_size):\n cell[i][j] = Cell(i, j)\n\n for i in range(g_size):\n for j in range(g_size):\n cell[i][j].add_neighbor()\n\n run_cell = cell[0][0]\n visit, done = [], []\n visit.append(run_cell)\n\n\ndef draw():\n global run_cell\n\n background(background_color)\n\n for i in range(g_size):\n for j in range(g_size):\n cell[i][j].draw_cell()\n cell[i][j].draw_wall()\n\n if len(visit) < g_size * g_size:\n if run_cell.check_sides():\n chosen = run_cell.pick_neighbor()\n done.append(run_cell)\n run_cell.stacked = True\n if chosen.i - run_cell.i == 1:\n run_cell.wall[1] = False\n chosen.wall[3] = False\n elif chosen.i - run_cell.i == -1:\n run_cell.wall[3] = False\n chosen.wall[1] = False\n elif chosen.j - run_cell.j == 1:\n run_cell.wall[2] = False\n chosen.wall[0] = False\n else:\n run_cell.wall[0] = False\n chosen.wall[2] = False\n run_cell.current = False\n run_cell = chosen\n run_cell.current = True\n run_cell.visited = True\n elif done:\n run_cell.current = False\n run_cell = done.pop()\n run_cell.stacked = False\n run_cell.current = True\n\n\nclass Cell:\n\n def __init__(self, i, j):\n self.i = i\n self.j = j\n self.wall = [True, True, True, True]\n self.visited = False\n self.stacked = False\n self.current = False\n\n def pick_neighbor(self):\n from random import choice\n unvisited = [nb for nb in self.neighbor\n if nb.visited == False]\n return choice(unvisited)\n\n def add_neighbor(self):\n i, j = self.i, self.j\n neighbor = []\n if i > 0:\n neighbor.append(cell[i - 1][j])\n if i < g_size - 1:\n neighbor.append(cell[i + 1][j])\n if j > 0:\n neighbor.append(cell[i][j - 1])\n if j < g_size - 1:\n neighbor.append(cell[i][j + 1])\n self.neighbor = neighbor\n\n def check_sides(self):\n for nb in self.neighbor:\n if not nb.visited:\n return True\n return False\n\n def draw_cell(self):\n s = c_size\n noStroke()\n noFill()\n if self.current:\n fill(runner)\n elif self.stacked:\n fill(done_color)\n elif self.visited:\n fill(visited_color)\n rect(self.j * s, self.i * s, s, s)\n\n def draw_wall(self):\n i, j = self.i, self.j\n wall = self.wall\n stroke(0)\n strokeWeight(5)\n if wall[0]: line(j * c_size, i * c_size, j * c_size, (i + 1) * c_size)\n if wall[1]: line(j * c_size, (i + 1) * c_size, (j + 1) * c_size, (i + 1) * c_size)\n if wall[2]: line((j + 1) * c_size, (i + 1) * c_size, (j + 1) * c_size, i * c_size)\n if wall[3]: line((j + 1) * c_size, i * c_size, j * c_size, i * c_size)\n","language":"Processing-Python-mode"},{"code":":- dynamic cell/2.\n\nmaze(Lig,Col) :-\n\tretractall(cell(_,_)),\n\n\tnew(D, window('Maze')),\n\n\t% creation of the grid\n\tforall(between(0,Lig, I),\n\t (XL is 50, YL is I * 30 + 50,\n\t\tXR is Col * 30 + 50,\n\t\tnew(L, line(XL, YL, XR, YL)),\n\t\tsend(D, display, L))),\n\n\tforall(between(0,Col, I),\n\t (XT is 50 + I * 30, YT is 50,\n\t\tYB is Lig * 30 + 50,\n\t\tnew(L, line(XT, YT, XT, YB)),\n\t\tsend(D, display, L))),\n\n\tSX is Col * 30 + 100,\n\tSY is Lig * 30 + 100,\n\tsend(D, size, new(_, size(SX, SY))),\n\n\t% choosing a first cell\n\tL0 is random(Lig),\n\tC0 is random(Col),\n\tassert(cell(L0, C0)),\n\t\\+search(D, Lig, Col, L0, C0),\n\tsend(D, open).\n\nsearch(D, Lig, Col, L, C) :-\n\tDir is random(4),\n\tnextcell(Dir, Lig, Col, L, C, L1, C1),\n\tassert(cell(L1,C1)),\n\tassert(cur(L1,C1)),\n\terase_line(D, L, C, L1, C1),\n\tsearch(D, Lig, Col, L1, C1).\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nerase_line(D, L, C, L, C1) :-\n\t( C < C1 -> C2 = C1; C2 = C),\n\tXT is C2 * 30 + 50,\n\tYT is L * 30 + 51, YR is (L+1) * 30 + 50,\n\tnew(Line, line(XT, YT, XT, YR)),\n\tsend(Line, colour, white),\n\tsend(D, display, Line).\n\nerase_line(D, L, C, L1, C) :-\n\tXT is 51 + C * 30, XR is 50 + (C + 1) * 30,\n\t( L < L1 -> L2 is L1; L2 is L),\n\tYT is L2 * 30 + 50,\n\tnew(Line, line(XT, YT, XR, YT)),\n\tsend(Line, colour, white),\n\tsend(D, display, Line).\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nnextcell(Dir, Lig, Col, L, C, L1, C1) :-\n\tnext(Dir, Lig, Col, L, C, L1, C1);\n\t( Dir1 is (Dir+3) mod 4,\n\t next(Dir1, Lig, Col, L, C, L1, C1));\n\t( Dir2 is (Dir+1) mod 4,\n\t next(Dir2, Lig, Col, L, C, L1, C1));\n\t( Dir3 is (Dir+2) mod 4,\n\t next(Dir3, Lig, Col, L, C, L1, C1)).\n\n% 0 => northward\nnext(0, _Lig, _Col, L, C, L1, C) :-\n\tL > 0,\n\tL1 is L - 1,\n\t\\+cell(L1, C).\n\n% 1 => rightward\nnext(1, _Lig, Col, L, C, L, C1) :-\n\tC < Col - 1,\n\tC1 is C + 1,\n\t\\+cell(L, C1).\n\n% 2 => southward\nnext(2, Lig, _Col, L, C, L1, C) :-\n\tL < Lig - 1,\n\tL1 is L + 1,\n\t\\+cell(L1, C).\n\n% 3 => leftward\nnext(2, _Lig, _Col, L, C, L, C1) :-\n\tC > 0,\n\tC1 is C - 1,\n\t\\+cell(L, C1).\n","language":"Prolog"},{"code":"Enumeration\n ;indexes for types of offsets from maze coordinates (x,y)\n #visited ;used to index visited(x,y) in a given direction from current maze cell\n #maze ;used to index maze() in a given direction from current maze cell\n #wall ;used to index walls in maze() in a given direction from current maze cell\n #numOffsets = #wall\n ;direction indexes\n #dir_ID = 0 ;identity value, produces no changes\n #firstDir\n #dir_N = #firstDir\n #dir_E\n #dir_S\n #dir_W\n #numDirs = #dir_W\nEndEnumeration\n\nDataSection\n ;maze(x,y) offsets for visited, maze, & walls for each direction\n Data.i 1, 1, 0, 0, 0, 0 ;ID\n Data.i 1, 0, 0, -1, 0, 0 ;N\n Data.i 2, 1, 1, 0, 1, 0 ;E\n Data.i 1, 2, 0, 1, 0, 1 ;S\n Data.i 0, 1, -1, 0, 0, 0 ;W\n Data.i %00, %01, %10, %01, %10 ;wall values for ID, N, E, S, W\nEndDataSection\n\n#cellDWidth = 4\n\nStructure mazeOutput\n vWall.s\n hWall.s\nEndStructure\n\n\n;setup reference values indexed by type and direction from current map cell\nGlobal Dim offset.POINT(#numOffsets, #numDirs)\nDefine i, j\nFor i = 0 To #numDirs\n For j = 0 To #numOffsets\n Read.i offset(j, i)\\x: Read.i offset(j, i)\\y\n Next\nNext\n\nGlobal Dim wallvalue(#numDirs)\nFor i = 0 To #numDirs: Read.i wallvalue(i): Next\n\n\nProcedure makeDisplayMazeRow(Array mazeRow.mazeOutput(1), Array maze(2), y)\n ;modify mazeRow() to produce output of 2 strings showing the vertical walls above and horizontal walls across a given maze row\n Protected x, vWall.s, hWall.s\n Protected mazeWidth = ArraySize(maze(), 1), mazeHeight = ArraySize(maze(), 2)\n\n vWall = \"\": hWall = \"\"\n For x = 0 To mazeWidth\n If maze(x, y) & wallvalue(#dir_N): vWall + \"+ \": Else: vWall + \"+---\": EndIf\n If maze(x, y) & wallvalue(#dir_W): hWall + \" \": Else: hWall + \"| \": EndIf\n Next\n mazeRow(0)\\vWall = Left(vWall, mazeWidth * #cellDWidth + 1)\n If y <> mazeHeight: mazeRow(0)\\hWall = Left(hWall, mazeWidth * #cellDWidth + 1): Else: mazeRow(0)\\hWall = \"\": EndIf\nEndProcedure\n\nProcedure displayMaze(Array maze(2))\n Protected x, y, vWall.s, hWall.s, mazeHeight = ArraySize(maze(), 2)\n Protected Dim mazeRow.mazeOutput(0)\n\n For y = 0 To mazeHeight\n makeDisplayMazeRow(mazeRow(), maze(), y)\n PrintN(mazeRow(0)\\vWall): PrintN(mazeRow(0)\\hWall)\n Next\nEndProcedure\n\nProcedure generateMaze(Array maze(2), mazeWidth, mazeHeight)\n Dim maze(mazeWidth, mazeHeight) ;Each cell specifies walls present above and to the left of it,\n ;array includes an extra row and column for the right and bottom walls\n Dim visited(mazeWidth + 1, mazeHeight + 1) ;Each cell represents a cell of the maze, an extra line of cells are included\n ;as padding around the representative cells for easy border detection\n\n Protected i\n ;mark outside border as already visited (off limits)\n For i = 0 To mazeWidth\n visited(i + offset(#visited, #dir_N)\\x, 0 + offset(#visited, #dir_N)\\y) = #True\n visited(i + offset(#visited, #dir_S)\\x, mazeHeight - 1 + offset(#visited, #dir_S)\\y) = #True\n Next\n For i = 0 To mazeHeight\n visited(0 + offset(#visited, #dir_W)\\x, i + offset(#visited, #dir_W)\\y) = #True\n visited(mazeWidth - 1 + offset(#visited, #dir_E)\\x, i + offset(#visited, #dir_E)\\y) = #True\n Next\n\n ;generate maze\n Protected x = Random(mazeWidth - 1), y = Random (mazeHeight - 1), cellCount, nextCell\n visited(x + offset(#visited, #dir_ID)\\x, y + offset(#visited, #dir_ID)\\y) = #True\n PrintN(\"Maze of size \" + Str(mazeWidth) + \" x \" + Str(mazeHeight) + \", generation started at \" + Str(x) + \" x \" + Str(y))\n\n NewList stack.POINT()\n Dim unvisited(#numDirs - #firstDir)\n Repeat\n cellCount = 0\n For i = #firstDir To #numDirs\n If Not visited(x + offset(#visited, i)\\x, y + offset(#visited, i)\\y)\n unvisited(cellCount) = i: cellCount + 1\n EndIf\n Next\n\n If cellCount\n nextCell = unvisited(Random(cellCount - 1))\n visited(x + offset(#visited, nextCell)\\x, y + offset(#visited, nextCell)\\y) = #True\n maze(x + offset(#wall, nextCell)\\x, y + offset(#wall, nextCell)\\y) | wallvalue(nextCell)\n\n If cellCount > 1\n AddElement(stack())\n stack()\\x = x: stack()\\y = y\n EndIf\n x + offset(#maze, nextCell)\\x: y + offset(#maze, nextCell)\\y\n ElseIf ListSize(stack()) > 0\n x = stack()\\x: y = stack()\\y\n DeleteElement(stack())\n Else\n Break ;end maze generation\n EndIf\n ForEver\n\n ; ;mark random entry and exit point\n ; x = Random(mazeWidth - 1): y = Random(mazeHeight - 1)\n ; maze(x, 0) | wallvalue(#dir_N): maze(mazeWidth, y) | wallvalue(#dir_E)\n ProcedureReturn\nEndProcedure\n\nIf OpenConsole()\n Dim maze(0, 0)\n Define mazeWidth = Random(5) + 7: mazeHeight = Random(5) + 3\n generateMaze(maze(), mazeWidth, mazeHeight)\n displayMaze(maze())\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\"): Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"from random import shuffle, randrange\n\ndef make_maze(w = 16, h = 8):\n vis = [[0] * w + [1] for _ in range(h)] + [[1] * (w + 1)]\n ver = [[\"| \"] * w + ['|'] for _ in range(h)] + [[]]\n hor = [[\"+--\"] * w + ['+'] for _ in range(h + 1)]\n\n def walk(x, y):\n vis[y][x] = 1\n\n d = [(x - 1, y), (x, y + 1), (x + 1, y), (x, y - 1)]\n shuffle(d)\n for (xx, yy) in d:\n if vis[yy][xx]: continue\n if xx == x: hor[max(y, yy)][x] = \"+ \"\n if yy == y: ver[y][max(x, xx)] = \" \"\n walk(xx, yy)\n\n walk(randrange(w), randrange(h))\n\n s = \"\"\n for (a, b) in zip(hor, ver):\n s += ''.join(a + ['\\n'] + b + ['\\n'])\n return s\n\nif __name__ == '__main__':\n print(make_maze())\n","language":"Python"},{"code":"OPTION BASE 0\nRANDOMIZE TIMER\n\nREM must be even\nwidth% = 40\nheight% = 20\n\nREM make array and fill\nDIM maze$(width%, height%)\nFOR x% = 0 TO width%\n FOR y% = 0 TO height%\n maze$(x%, y%) = \"#\"\n NEXT y%\nNEXT x%\n\nREM initial start location\ncurrentx% = INT(RND * (width% - 1))\ncurrenty% = INT(RND * (height% - 1))\nREM value must be odd\nIF currentx% MOD 2 = 0 THEN currentx% = currentx% + 1\nIF currenty% MOD 2 = 0 THEN currenty% = currenty% + 1\nmaze$(currentx%, currenty%) = \" \"\n\nREM generate maze\ndone% = 0\nDO WHILE done% = 0\n FOR i% = 0 TO 99\n oldx% = currentx%\n oldy% = currenty%\n\n REM move in random direction\n SELECT CASE INT(RND * 4)\n CASE 0\n IF currentx% + 2 < width% THEN currentx% = currentx% + 2\n CASE 1\n IF currenty% + 2 < height% THEN currenty% = currenty% + 2\n CASE 2\n IF currentx% - 2 > 0 THEN currentx% = currentx% - 2\n CASE 3\n IF currenty% - 2 > 0 THEN currenty% = currenty% - 2\n END SELECT\n\n REM if cell is unvisited then connect it\n IF maze$(currentx%, currenty%) = \"#\" THEN\n maze$(currentx%, currenty%) = \" \"\n maze$(INT((currentx% + oldx%) / 2), ((currenty% + oldy%) / 2)) = \" \"\n END IF\n NEXT i%\n\n REM check if all cells are visited\n done% = 1\n FOR x% = 1 TO width% - 1 STEP 2\n FOR y% = 1 TO height% - 1 STEP 2\n IF maze$(x%, y%) = \"#\" THEN done% = 0\n NEXT y%\n NEXT x%\nLOOP\n\nREM draw maze\nFOR y% = 0 TO height%\n FOR x% = 0 TO width%\n PRINT maze$(x%, y%);\n NEXT x%\n PRINT\nNEXT y%\n\nREM wait\nDO: LOOP WHILE INKEY$ = \"\"\n","language":"QB64"},{"code":"#lang racket\n\n;; the structure representing a maze of size NxM\n(struct maze (N M tbl))\n\n;; managing cell properties\n(define (connections tbl c) (dict-ref tbl c '()))\n\n(define (connect! tbl c n)\n (dict-set! tbl c (cons n (connections tbl c)))\n (dict-set! tbl n (cons c (connections tbl n))))\n\n(define (connected? tbl a b) (member a (connections tbl b)))\n\n;; Returns a maze of a given size\n;; build-maze :: Index Index -> Maze\n(define (build-maze N M)\n (define tbl (make-hash))\n (define (visited? tbl c) (dict-has-key? tbl c))\n (define (neigbours c)\n (filter\n (match-lambda [(list i j) (and (<= 0 i (- N 1)) (<= 0 j (- M 1)))])\n (for/list ([d '((0 1) (0 -1) (-1 0) (1 0))]) (map + c d))))\n ; generate the maze\n (let move-to-cell ([c (list (random N) (random M))])\n (for ([n (shuffle (neigbours c))] #:unless (visited? tbl n))\n (connect! tbl c n)\n (move-to-cell n)))\n ; return the result\n (maze N M tbl))\n","language":"Racket"},{"code":";; Shows a maze\n(define (show-maze m)\n (match-define (maze N M tbl) m)\n (for ([i N]) (display \"+---\"))\n (displayln \"+\")\n (for ([j M])\n (display \"|\")\n (for ([i (- N 1)])\n (if (connected? tbl (list i j) (list (+ 1 i) j))\n (display \" \")\n (display \" |\")))\n (display \" |\")\n (newline)\n (for ([i N])\n (if (connected? tbl (list i j) (list i (+ j 1)))\n (display \"+ \")\n (display \"+---\")))\n (displayln \"+\"))\n (newline))\n","language":"Racket"},{"code":"constant mapping = :OPEN(' '),\n\t\t :N< ╵ >,\n\t\t :E< ╶ >,\n\t\t :NE< └ >,\n\t\t :S< ╷ >,\n\t\t :NS< │ >,\n\t\t :ES< ┌ >,\n\t\t :NES< ├ >,\n\t\t :W< ╴ >,\n\t\t :NW< ┘ >,\n\t\t :EW< ─ >,\n\t\t :NEW< ┴ >,\n\t\t :SW< ┐ >,\n\t\t :NSW< ┤ >,\n\t\t :ESW< ┬ >,\n\t\t :NESW< ┼ >,\n\t\t :TODO< x >,\n\t :TRIED< · >;\n\nenum Sym (mapping.map: *.key);\nmy @ch = mapping.map: *.value;\n\nenum Direction <DeadEnd Up Right Down Left>;\n\nsub gen_maze ( $X,\n $Y,\n $start_x = (^$X).pick * 2 + 1,\n $start_y = (^$Y).pick * 2 + 1 )\n{\n my @maze;\n push @maze, $[ flat ES, -N, (ESW, EW) xx $X - 1, SW ];\n push @maze, $[ flat (NS, TODO) xx $X, NS ];\n for 1 ..^ $Y {\n\tpush @maze, $[ flat NES, EW, (NESW, EW) xx $X - 1, NSW ];\n\tpush @maze, $[ flat (NS, TODO) xx $X, NS ];\n }\n push @maze, $[ flat NE, (EW, NEW) xx $X - 1, -NS, NW ];\n @maze[$start_y][$start_x] = OPEN;\n\n my @stack;\n my $current = [$start_x, $start_y];\n loop {\n if my $dir = pick_direction( $current ) {\n @stack.push: $current;\n $current = move( $dir, $current );\n }\n else {\n last unless @stack;\n $current = @stack.pop;\n }\n }\n return @maze;\n\n sub pick_direction([$x,$y]) {\n\tmy @neighbors =\n\t (Up if @maze[$y - 2][$x]),\n\t (Down if @maze[$y + 2][$x]),\n\t (Left if @maze[$y][$x - 2]),\n\t (Right if @maze[$y][$x + 2]);\n\t@neighbors.pick or DeadEnd;\n }\n\n sub move ($dir, @cur) {\n\tmy ($x,$y) = @cur;\n\tgiven $dir {\n\t when Up { @maze[--$y][$x] = OPEN; @maze[$y][$x-1] -= E; @maze[$y--][$x+1] -= W; }\n\t when Down { @maze[++$y][$x] = OPEN; @maze[$y][$x-1] -= E; @maze[$y++][$x+1] -= W; }\n\t when Left { @maze[$y][--$x] = OPEN; @maze[$y-1][$x] -= S; @maze[$y+1][$x--] -= N; }\n\t when Right { @maze[$y][++$x] = OPEN; @maze[$y-1][$x] -= S; @maze[$y+1][$x++] -= N; }\n\t}\n\t@maze[$y][$x] = 0;\n\t[$x,$y];\n }\n}\n\nsub display (@maze) {\n for @maze -> @y {\n\tfor @y.rotor(2) -> ($w, $c) {\n\t print @ch[abs $w];\n\t if $c >= 0 { print @ch[$c] x 3 }\n\t else { print ' ', @ch[abs $c], ' ' }\n\t}\n\tsay @ch[@y[*-1]];\n }\n}\n\ndisplay gen_maze( 29, 19 );\n","language":"Raku"},{"code":"import IO;\nimport util::Math;\nimport List;\n\npublic void make_maze(int w, int h){\n\tvis = [[0 | _ <- [1..w]] | _ <- [1..h]];\n\tver = [[\"| \"| _ <- [1..w]] + [\"|\"] | _ <- [1..h]] + [[]];\n\thor = [[\"+--\"| _ <- [1..w]] + [\"+\"] | _ <- [1..h + 1]];\n\n\tvoid walk(int x, int y){\n\t\tvis[y][x] = 1;\n\n\t\td = [<x - 1, y>, <x, y + 1>, <x + 1, y>, <x, y - 1>];\n\t\twhile (d != []){\n\t\t\t<<xx, yy>, d> = takeOneFrom(d);\n\t\t\tif (xx < 0 || yy < 0 || xx >= w || yy >= w) continue;\n\t\t\tif (vis[yy][xx] == 1) continue;\n\t\t\tif (xx == x) hor[max([y, yy])][x] = \"+ \";\n\t\t\tif (yy == y) ver[y][max([x, xx])] = \" \";\n\t\t\twalk(xx, yy);\n\t\t\t}\n \t}\n \t\n\twalk(arbInt(w), arbInt(h));\n\tfor (<a, b> <- zip(hor, ver)){\n\t\tprintln((\"\" | it + \"<z>\" | z <- a));\n\t\tprintln((\"\" | it + \"<z>\" | z <- b));\n\t}\n}\n","language":"Rascal"},{"code":"Red [\"Maze generation\"]\n\nsize: as-pair to-integer ask \"Maze width: \" to-integer ask \"Maze height: \"\nrandom/seed now/time\noffsetof: function [pos] [pos/y * size/x + pos/x + 1]\nvisited?: function [pos] [find visited pos]\n\nnewneighbour: function [pos][\n\tnnbs: collect [\n\t\tif all [pos/x > 0 not visited? p: pos - 1x0] [keep p]\n\t\tif all [pos/x < (size/x - 1) not visited? p: pos + 1x0] [keep p]\n\t\tif all [pos/y > 0 not visited? p: pos - 0x1] [keep p]\n\t\tif all [pos/y < (size/y - 1) not visited? p: pos + 0x1] [keep p]\n\t]\n\tpick nnbs random length? nnbs\n]\nexpand: function [pos][\t\n\tinsert visited pos\n\teither npos: newneighbour pos [\n\t\tinsert exploring npos\n\t\tdo select [\n\t\t\t0x-1 [o: offsetof npos walls/:o/y: 0]\n\t\t\t1x0 [o: offsetof pos walls/:o/x: 0]\n\t\t\t0x1 [o: offsetof pos walls/:o/y: 0]\n\t\t\t-1x0 [o: offsetof npos walls/:o/x: 0]\n\t\t] npos - pos\n\t][\n\t\tremove exploring\n\t]\n]\nvisited: []\nwalls: append/dup [] 1x1 size/x * size/y\nexploring: reduce [random size - 1x1]\n\nuntil [\n\texpand exploring/1\n\tempty? exploring\n]\n\nprint append/dup \"\" \" _\" size/x\nrepeat j size/y [\n\tprin \"|\"\n\trepeat i size/x [\n\t\tp: pick walls (j - 1 * size/x + i)\n\t\tprin rejoin [pick \" _\" 1 + p/y pick \" |\" 1 + p/x]\n\t]\n\tprint \"\"\n]\n","language":"Red"},{"code":"/*REXX program generates and displays a rectangular solvable maze (of any size). */\nparse arg rows cols seed . /*allow user to specify the maze size. */\nif rows='' | rows==',' then rows= 19 /*No rows given? Then use the default.*/\nif cols='' | cols==',' then cols= 19 /* \" cols \" ? \" \" \" \" */\nif datatype(seed, 'W') then call random ,,seed /*use a random seed for repeatability.*/\nht=0; @.=0 /*HT= # rows in grid; @.: default cell*/\ncall makeRow '┌'copies(\"~┬\", cols - 1)'~┐' /*construct the top edge of the maze. */\n /* [↓] construct the maze's grid. */\n do r=1 for rows; _=; __=; hp= \"|\"; hj= '├'\n do c=1 for cols; _= _ || hp'1'; __= __ || hj\"~\"; hj= '┼'; hp= \"│\"\n end /*c*/\n call makeRow _'│' /*construct the right edge of the cells*/\n if r\\==rows then call makeRow __'┤' /* \" \" \" \" \" \" maze.*/\n end /*r*/ /* [↑] construct the maze's grid. */\n\ncall makeRow '└'copies(\"~┴\", cols - 1)'~┘' /*construct the bottom edge of the maze*/\nr!= random(1, rows) *2; c!= random(1, cols) *2; @.r!.c!= 0 /*choose 1st cell.*/\n /* [↓] traipse through the maze. */\n do forever; n= hood(r!, c!); if n==0 then if \\fCell() then leave /*¬freecell?*/\n call ?; @._r._c= 0 /*get the (next) maze direction to go. */\n ro= r!; co= c!; r!= _r; c!= _c /*save original maze cell coordinates. */\n ?.zr= ?.zr % 2; ?.zc= ?.zc % 2 /*get the maze row and cell directions.*/\n rw= ro + ?.zr; cw= co + ?.zc /*calculate the next row and column. */\n @.rw.cw= . /*mark the maze cell as being visited. */\n end /*forever*/\n /* [↓] display maze to the terminal. */\n do r=1 for ht; _=\n do c=1 for cols*2 + 1; _= _ || @.r.c; end /*c*/\n if \\(r//2) then _= translate(_, '\\', .) /*trans to backslash*/\n @.r= _ /*save the row in @.*/\n end /*r*/\n\n do #=1 for ht; _= @.# /*display the maze to the terminal. */\n call makeNice /*prettify cell corners and dead─ends. */\n _= changestr( 1 , _ , 111 ) /*──────these four ────────────────────*/\n _= changestr( 0 , _ , 000 ) /*───────── statements are ────────────*/\n _= changestr( . , _ , \" \" ) /*────────────── used for preserving ──*/\n _= changestr('~', _ , \"───\" ) /*────────────────── the aspect ratio. */\n say translate( _ , '─│' , \"═|\\10\" ) /*make it presentable for the screen. */\n end /*#*/\n exit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n@: parse arg _r,_c; return @._r._c /*a fast way to reference a maze cell. */\nmakeRow: parse arg z; ht= ht+1; do c=1 for length(z); @.ht.c=substr(z,c,1); end; return\nhood: parse arg rh,ch; return @(rh+2,ch) + @(rh-2,ch) + @(rh,ch-2) + @(rh,ch+2)\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n?: do forever; ?.= 0; ?= random(1, 4); if ?==1 then ?.zc= -2 /*north*/\n if ?==2 then ?.zr= 2 /* east*/\n if ?==3 then ?.zc= 2 /*south*/\n if ?==4 then ?.zr= -2 /* west*/\n _r= r! + ?.zr; _c= c! + ?.zc; if @._r._c == 1 then return\n end /*forever*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nfCell: do r=1 for rows; rr= r + r\n do c=1 for cols; cc= c + c\n if hood(rr,cc)==1 then do; r!= rr; c!= cc; @.r!.c!= 0; return 1; end\n end /*c*/ /* [↑] r! and c! are used by invoker.*/\n end /*r*/; return 0\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nmakeNice: width= length(_); old= # - 1; new= # + 1; old_= @.old; new_= @.new\n if left(_, 2)=='├.' then _= translate(_, \"|\", '├')\n if right(_,2)=='.┤' then _= translate(_, \"|\", '┤')\n\n do k=1 for width while #==1; z= substr(_, k, 1) /*maze top row.*/\n if z\\=='┬' then iterate\n if substr(new_, k, 1)=='\\' then _= overlay(\"═\", _, k)\n end /*k*/\n\n do k=1 for width while #==ht; z= substr(_, k, 1) /*maze bot row.*/\n if z\\=='┴' then iterate\n if substr(old_, k, 1)=='\\' then _= overlay(\"═\", _, k)\n end /*k*/\n\n do k=3 to width-2 by 2 while #//2; z= substr(_, k, 1) /*maze mid rows*/\n if z\\=='┼' then iterate\n le= substr(_ , k-1, 1)\n ri= substr(_ , k+1, 1)\n up= substr(old_, k , 1)\n dw= substr(new_, k , 1)\n select\n when le== . & ri== . & up=='│' & dw==\"│\" then _= overlay('|', _, k)\n when le=='~' & ri==\"~\" & up=='\\' & dw==\"\\\" then _= overlay('═', _, k)\n when le=='~' & ri==\"~\" & up=='\\' & dw==\"│\" then _= overlay('┬', _, k)\n when le=='~' & ri==\"~\" & up=='│' & dw==\"\\\" then _= overlay('┴', _, k)\n when le=='~' & ri== . & up=='\\' & dw==\"\\\" then _= overlay('═', _, k)\n when le== . & ri==\"~\" & up=='\\' & dw==\"\\\" then _= overlay('═', _, k)\n when le== . & ri== . & up=='│' & dw==\"\\\" then _= overlay('|', _, k)\n when le== . & ri== . & up=='\\' & dw==\"│\" then _= overlay('|', _, k)\n when le== . & ri==\"~\" & up=='\\' & dw==\"│\" then _= overlay('┌', _, k)\n when le== . & ri==\"~\" & up=='│' & dw==\"\\\" then _= overlay('└', _, k)\n when le=='~' & ri== . & up=='\\' & dw==\"│\" then _= overlay('┐', _, k)\n when le=='~' & ri== . & up=='│' & dw==\"\\\" then _= overlay('┘', _, k)\n when le=='~' & ri== . & up=='│' & dw==\"│\" then _= overlay('┤', _, k)\n when le== . & ri==\"~\" & up=='│' & dw==\"│\" then _= overlay('├', _, k)\n otherwise nop\n end /*select*/\n end /*k*/; return\n","language":"REXX"},{"code":"/*REXX program generates and displays a rectangular solvable maze (of any size). */\nparse arg rows cols seed . /*allow user to specify the maze size. */\nif rows='' | rows==\",\" then rows= 19 /*No rows given? Then use the default.*/\nif cols='' | cols==\",\" then cols= 19 /* \" cols \" ? \" \" \" \" */\nif datatype(seed, 'W') then call random ,,seed /*use a random seed for repeatability.*/\nht=0; @.=0 /*HT= # rows in grid; @.: default cell*/\ncall makeRow '┌'copies(\"─┬\", cols-1)'─┐' /*construct the top edge of the maze.*/\n\n do r=1 for rows; _=; __=; hp= \"|\"; hj= '├'\n do c=1 for cols; _= _ || hp'1'; __= __ || hj\"─\"; hj= '┼'; hp= \"│\"\n end /*c*/\n call makeRow _'│' /*construct the right edge of the cells*/\n if r\\==rows then call makeRow __'┤' /* \" \" \" \" \" \" maze.*/\n end /*r*/ /* [↑] construct the maze's grid. */\n\ncall makeRow '└'copies(\"─┴\", cols-1)'─┘' /*construct the bottom edge of the maze*/\nr!= random(1, rows)*2; c!= random(1, cols)*2; @.r!.c!= 0 /*choose the 1st cell.*/\n /* [↓] traipse through the maze. */\n do forever; n= hood(r!, c!) /*number of free maze cells. */\n if n==0 then if \\fCell() then leave /*if no free maze cells left, then done*/\n call ?; @._r._c= 0 /*get the (next) maze direction to go. */\n ro= r!; co= c!; r!= _r; c!= _c /*save the original cell coordinates. */\n ?.zr= ?.zr % 2; ?.zc= ?.zc % 2 /*get the maze row and cell directions.*/\n rw= ro + ?.zr; cw= co + ?.zc /*calculate the next maze row and col. */\n @.rw.cw=. /*mark the maze cell as being visited. */\n end /*forever*/\n /* [↓] display maze to the terminal. */\n do r=1 for ht; _=\n do c=1 for cols*2 + 1; _= _ || @.r.c; end /*c*/\n if \\(r//2) then _= translate(_, '\\',.) /*translate a period to a backslash.*/\n _= changestr( 1 , _ , 111 ) /*──────these four ────────────────────*/\n _= changestr( 0 , _ , 000 ) /*───────── statements are ────────────*/\n _= changestr( . , _ , \" \" ) /*────────────── used for preserving ──*/\n _= changestr('─', _ , \"───\" ) /*────────────────── the aspect ratio. */\n say translate( _ , '│' , \"|\\10\") /*make it presentable for the screen. */\n end /*r*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n@: parse arg _r,_c; return @._r._c /*a fast way to reference a maze cell. */\nmakeRow: parse arg z; ht= ht+1; do c=1 for length(z); @.ht.c=substr(z,c,1); end; return\nhood: parse arg rh,ch; return @(rh+2,ch) + @(rh-2,ch) + @(rh,ch-2) + @(rh,ch+2)\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n?: do forever; ?.= 0; ?= random(1, 4); if ?==1 then ?.zc= -2 /*north*/\n if ?==2 then ?.zr= 2 /* east*/\n if ?==3 then ?.zc= 2 /*south*/\n if ?==4 then ?.zr= -2 /* west*/\n _r= r! + ?.zr; _c= c! + ?.zc; if @._r._c == 1 then return\n end /*forever*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nfCell: do r=1 for rows; rr= r + r\n do c=1 for cols; cc= c + c\n if hood(rr,cc)==1 then do; r!= rr; c!= cc; @.r!.c!= 0; return 1; end\n end /*c*/ /* [↑] r! and c! are used by invoker.*/\n end /*r*/; return 0\n","language":"REXX"},{"code":"/* REXX ***************************************************************\n* 04.09.2013 Walter Pachl\n**********************************************************************/\nParse Arg imax jmax seed\nIf imax='' Then imax=10\nIf jmax='' Then jmax=15\nIf seed='' Then seed=4711\nc='123456789'||,\n 'abcdefghijklmnopqrstuvwxyz'||,\n translate('abcdefghijklmnopqrstuvwxyz')\nc=copies(c,10)\ncall random 1,10,seed\nid=2*imax+1 /* vertical dimension of a.i.j */\njd=2*jmax+1 /* horizontal dimension of a.i.j */\na.=1 /* mark all borders present */\np.='.' /* Initialize all grid points */\npl.=0 /* path list */\nii=random(1,imax) /* find a start position */\njj=random(1,jmax)\np=1 /* first position */\nna=1 /* number of points used */\nDo si=1 To 1000 /* Do Forever - see Leave */\n /* Say 'loop' si na show progress */\n Call path ii,jj /* compute a path starting at ii/jj */\n If na=imax*jmax Then /* all points used */\n Leave /* we are done */\n Parse Value select_next() With ii jj /* get a new start from a path*/\n End\n\n/***************\nDo i=1 To imax\n ol=''\n Do j=1 To jmax\n ol=ol||p.i.j\n End\n Say ol\n End\nSay ' '\n***************/\nCall show\n/***********************\nDo pi=1 To imax*jmax\n Say right(pi,3) pos.pi\n End\n***********************/\nExit\n\npath: Procedure Expose p. np. p pl. c a. na imax jmax id jd pos.\n/**********************************************************************\n* compute a path starting from point (ii,jj)\n**********************************************************************/\n Parse Arg ii,jj\n p.ii.jj='1'\n pos.p=ii jj\n Do pp=1 to 50 /* compute a path of maximum length 50*/\n neighbors=neighbors(ii,jj) /* number of free neighbors */\n Select\n When neighbors=1 Then /* just one */\n Call advance 1,ii,jj /* go for it */\n When neighbors>0 Then Do /* more Than 1 */\n ch=random(1,neighbors) /* choose one possibility */\n Call advance ch,ii,jj /* and go for that */\n End\n Otherwise /* none available */\n Leave\n End\n End\n Return\n\nneighbors: Procedure Expose p. np. imax jmax neighbors pl.\n/**********************************************************************\n* count the number of free neighbors of point (i,j)\n**********************************************************************/\n Parse Arg i,j\n neighbors=0\n in=i-1; If in>0 Then Call check in,j\n in=i+1; If in<=imax Then Call check in,j\n jn=j-1; If jn>0 Then Call check i,jn\n jn=j+1; If jn<=jmax Then Call check i,jn\n Return neighbors\n\ncheck: Procedure Expose p. imax jmax np. neighbors pl.\n/**********************************************************************\n* check if point (i,j) is free and note it as possible successor\n**********************************************************************/\n Parse Arg i,j\n If p.i.j='.' Then Do /* point is free */\n neighbors=neighbors+1 /* number of free neighbors */\n np.neighbors=i j /* note it as possible choice */\n End\n Return\n\nadvance: Procedure Expose p pos. np. p. c ii jj a. na pl. pos.\n/**********************************************************************\n* move to the next point of the current path\n**********************************************************************/\n Parse Arg ch,pii,pjj\n Parse Var np.ch ii jj\n p=p+1 /* position number */\n pos.p=ii jj /* note its coordinates */\n p.ii.jj=substr(c,p,1) /* mark the point as used */\n ai=pii+ii /* vertical border position */\n aj=pjj+jj /* horizontal border position */\n a.ai.aj=0 /* tear the border down */\n na=na+1 /* number of used positions */\n z=pl.0+1 /* add the point to the list */\n pl.z=ii jj /* of follow-up start pos. */\n pl.0=z\n Return\n\nshow: Procedure Expose id jd a. na\n/*********************************************************************\n* Show the resulting maze\n*********************************************************************/\n say 'mgg 6 18 4711'\n say 'show na='na\n Do i=1 To id\n ol=''\n Do j=1 To jd\n If i//2=1 Then Do /* odd lines */\n If a.i.j=1 Then Do /* border to be drawn */\n If j//2=0 Then\n ol=ol||'---' /* draw the border */\n Else\n ol=ol'+'\n End\n Else Do /* border was torn down */\n If j//2=0 Then\n ol=ol||' ' /* blanks instead of border */\n Else\n ol=ol||'+'\n End\n End\n Else Do /* even line */\n If a.i.j=1 Then Do\n If j//2=0 Then /* even column */\n ol=ol||' ' /* moving space */\n Else /* odd column */\n ol=ol||'|' /* draw the border */\n End\n Else /* border was torn down */\n ol=ol||' ' /* blank instead of border */\n End\n End\n Select\n When i=6 Then ol=overlay('A',ol,11)\n When i=8 Then ol=overlay('B',ol, 3)\n Otherwise Nop\n End\n Say ol format(i,2)\n End\n Return\n\nselect_next: Procedure Expose p. pl. imax jmax\n/*********************************************************************\n* look for a point to start the nnext path\n*********************************************************************/\n Do Until neighbors>0 /* loop until one is found */\n n=pl.0 /* number of points recorded */\n s=random(1,n) /* pick a random index */\n Parse Var pl.s is js /* its coordinates */\n neighbors=neighbors(is,js) /* count free neighbors */\n If neighbors=0 Then Do /* if there is none */\n pl.s=pl.n /* remove this point */\n pl.0=pl.0-1\n End\n End\n Return is js /* return the new start point*/\n","language":"REXX"},{"code":"class Maze\n DIRECTIONS = [ [1, 0], [-1, 0], [0, 1], [0, -1] ]\n\n def initialize(width, height)\n @width = width\n @height = height\n @start_x = rand(width)\n @start_y = 0\n @end_x = rand(width)\n @end_y = height - 1\n\n # Which walls do exist? Default to \"true\". Both arrays are\n # one element bigger than they need to be. For example, the\n # @vertical_walls[x][y] is true if there is a wall between\n # (x,y) and (x+1,y). The additional entry makes printing easier.\n @vertical_walls = Array.new(width) { Array.new(height, true) }\n @horizontal_walls = Array.new(width) { Array.new(height, true) }\n # Path for the solved maze.\n @path = Array.new(width) { Array.new(height) }\n\n # \"Hack\" to print the exit.\n @horizontal_walls[@end_x][@end_y] = false\n\n # Generate the maze.\n generate\n end\n\n # Print a nice ASCII maze.\n def print\n # Special handling: print the top line.\n puts @width.times.inject(\"+\") {|str, x| str << (x == @start_x ? \" +\" : \"---+\")}\n\n # For each cell, print the right and bottom wall, if it exists.\n @height.times do |y|\n line = @width.times.inject(\"|\") do |str, x|\n str << (@path[x][y] ? \" * \" : \" \") << (@vertical_walls[x][y] ? \"|\" : \" \")\n end\n puts line\n\n puts @width.times.inject(\"+\") {|str, x| str << (@horizontal_walls[x][y] ? \"---+\" : \" +\")}\n end\n end\n\n private\n\n # Reset the VISITED state of all cells.\n def reset_visiting_state\n @visited = Array.new(@width) { Array.new(@height) }\n end\n\n # Is the given coordinate valid and the cell not yet visited?\n def move_valid?(x, y)\n (0...@width).cover?(x) && (0...@height).cover?(y) && !@visited[x][y]\n end\n\n # Generate the maze.\n def generate\n reset_visiting_state\n generate_visit_cell(@start_x, @start_y)\n end\n\n # Depth-first maze generation.\n def generate_visit_cell(x, y)\n # Mark cell as visited.\n @visited[x][y] = true\n\n # Randomly get coordinates of surrounding cells (may be outside\n # of the maze range, will be sorted out later).\n coordinates = DIRECTIONS.shuffle.map { |dx, dy| [x + dx, y + dy] }\n\n for new_x, new_y in coordinates\n next unless move_valid?(new_x, new_y)\n\n # Recurse if it was possible to connect the current and\n # the cell (this recursion is the \"depth-first\" part).\n connect_cells(x, y, new_x, new_y)\n generate_visit_cell(new_x, new_y)\n end\n end\n\n # Try to connect two cells. Returns whether it was valid to do so.\n def connect_cells(x1, y1, x2, y2)\n if x1 == x2\n # Cells must be above each other, remove a horizontal wall.\n @horizontal_walls[x1][ [y1, y2].min ] = false\n else\n # Cells must be next to each other, remove a vertical wall.\n @vertical_walls[ [x1, x2].min ][y1] = false\n end\n end\nend\n\n# Demonstration:\nmaze = Maze.new 20, 10\nmaze.print\n","language":"Ruby"},{"code":"use rand::{thread_rng, Rng, rngs::ThreadRng};\n\nconst WIDTH: usize = 16;\nconst HEIGHT: usize = 16;\n\n#[derive(Clone, Copy)]\nstruct Cell {\n col: usize,\n row: usize,\n}\n\nimpl Cell {\n fn from(col: usize, row: usize) -> Cell {\n Cell {col, row}\n }\n}\n\nstruct Maze {\n cells: [[bool; HEIGHT]; WIDTH], //cell visited/non visited\n walls_h: [[bool; WIDTH]; HEIGHT + 1], //horizontal walls existing/removed\n walls_v: [[bool; WIDTH + 1]; HEIGHT], //vertical walls existing/removed\n thread_rng: ThreadRng, //Random numbers generator\n}\n\nimpl Maze {\n\n ///Inits the maze, with all the cells unvisited and all the walls active\n fn new() -> Maze {\n Maze {\n cells: [[true; HEIGHT]; WIDTH],\n walls_h: [[true; WIDTH]; HEIGHT + 1],\n walls_v: [[true; WIDTH + 1]; HEIGHT],\n thread_rng: thread_rng(),\n }\n }\n\n ///Randomly chooses the starting cell\n fn first(&mut self) -> Cell {\n Cell::from(self.thread_rng.gen_range(0, WIDTH), self.thread_rng.gen_range(0, HEIGHT))\n }\n\n ///Opens the enter and exit doors\n fn open_doors(&mut self) {\n let from_top: bool = self.thread_rng.gen();\n let limit = if from_top { WIDTH } else { HEIGHT };\n let door = self.thread_rng.gen_range(0, limit);\n let exit = self.thread_rng.gen_range(0, limit);\n if from_top {\n self.walls_h[0][door] = false;\n self.walls_h[HEIGHT][exit] = false;\n } else {\n self.walls_v[door][0] = false;\n self.walls_v[exit][WIDTH] = false;\n }\n }\n\n ///Removes a wall between the two Cell arguments\n fn remove_wall(&mut self, cell1: &Cell, cell2: &Cell) {\n if cell1.row == cell2.row {\n self.walls_v[cell1.row][if cell1.col > cell2.col { cell1.col } else { cell2.col }] = false;\n } else {\n self.walls_h[if cell1.row > cell2.row { cell1.row } else { cell2.row }][cell1.col] = false;\n };\n }\n\n ///Returns a random non-visited neighbor of the Cell passed as argument\n fn neighbor(&mut self, cell: &Cell) -> Option<Cell> {\n self.cells[cell.col][cell.row] = false;\n let mut neighbors = Vec::new();\n if cell.col > 0 && self.cells[cell.col - 1][cell.row] { neighbors.push(Cell::from(cell.col - 1, cell.row)); }\n if cell.row > 0 && self.cells[cell.col][cell.row - 1] { neighbors.push(Cell::from(cell.col, cell.row - 1)); }\n if cell.col < WIDTH - 1 && self.cells[cell.col + 1][cell.row] { neighbors.push(Cell::from(cell.col + 1, cell.row)); }\n if cell.row < HEIGHT - 1 && self.cells[cell.col][cell.row + 1] { neighbors.push(Cell::from(cell.col, cell.row + 1)); }\n if neighbors.is_empty() {\n None\n } else {\n let next = neighbors.get(self.thread_rng.gen_range(0, neighbors.len())).unwrap();\n self.remove_wall(cell, next);\n Some(*next)\n }\n }\n\n ///Builds the maze (runs the Depth-first search algorithm)\n fn build(&mut self) {\n let mut cell_stack: Vec<Cell> = Vec::new();\n let mut next = self.first();\n loop {\n while let Some(cell) = self.neighbor(&next) {\n cell_stack.push(cell);\n next = cell;\n }\n match cell_stack.pop() {\n Some(cell) => next = cell,\n None => break,\n }\n }\n }\n\n ///Displays a wall\n fn paint_wall(h_wall: bool, active: bool) {\n if h_wall {\n print!(\"{}\", if active { \"+---\" } else { \"+ \" });\n } else {\n print!(\"{}\", if active { \"| \" } else { \" \" });\n }\n }\n\n ///Displays a final wall for a row\n fn paint_close_wall(h_wall: bool) {\n if h_wall { println!(\"+\") } else { println!() }\n }\n\n ///Displays a whole row of walls\n fn paint_row(&self, h_walls: bool, index: usize) {\n let iter = if h_walls { self.walls_h[index].iter() } else { self.walls_v[index].iter() };\n for &wall in iter {\n Maze::paint_wall(h_walls, wall);\n }\n Maze::paint_close_wall(h_walls);\n }\n\n ///Paints the maze\n fn paint(&self) {\n for i in 0 .. HEIGHT {\n self.paint_row(true, i);\n self.paint_row(false, i);\n }\n self.paint_row(true, HEIGHT);\n }\n}\n\nfn main() {\n let mut maze = Maze::new();\n maze.build();\n maze.open_doors();\n maze.paint();\n}\n","language":"Rust"},{"code":"import scala.util.Random\n\nobject MazeTypes {\n case class Direction(val dx: Int, val dy: Int)\n\n case class Loc(val x: Int, val y: Int) {\n def +(that: Direction): Loc = Loc(x + that.dx, y + that.dy)\n }\n\n case class Door(val from: Loc, to: Loc)\n\n val North = Direction(0,-1)\n val South = Direction(0,1)\n val West = Direction(-1,0)\n val East = Direction(1,0)\n val directions = Set(North, South, West, East)\n}\n\nobject MazeBuilder {\n import MazeTypes._\n\n def shuffle[T](set: Set[T]): List[T] = Random.shuffle(set.toList)\n\n def buildImpl(current: Loc, grid: Grid): Grid = {\n var newgrid = grid.markVisited(current)\n val nbors = shuffle(grid.neighbors(current))\n nbors.foreach { n =>\n if (!newgrid.isVisited(n)) {\n newgrid = buildImpl(n, newgrid.markVisited(current).addDoor(Door(current, n)))\n }\n }\n newgrid\n }\n\n def build(width: Int, height: Int): Grid = {\n val exit = Loc(width-1, height-1)\n buildImpl(exit, new Grid(width, height, Set(), Set()))\n }\n}\n\nclass Grid(val width: Int, val height: Int, val doors: Set[Door], val visited: Set[Loc]) {\n\n def addDoor(door: Door): Grid =\n new Grid(width, height, doors + door, visited)\n\n def markVisited(loc: Loc): Grid =\n new Grid(width, height, doors, visited + loc)\n\n def isVisited(loc: Loc): Boolean =\n visited.contains(loc)\n\n def neighbors(current: Loc): Set[Loc] =\n directions.map(current + _).filter(inBounds(_)) -- visited\n\n def printGrid(): List[String] = {\n (0 to height).toList.flatMap(y => printRow(y))\n }\n\n private def inBounds(loc: Loc): Boolean =\n loc.x >= 0 && loc.x < width && loc.y >= 0 && loc.y < height\n\n private def printRow(y: Int): List[String] = {\n val row = (0 until width).toList.map(x => printCell(Loc(x, y)))\n val rightSide = if (y == height-1) \" \" else \"|\"\n val newRow = row :+ List(\"+\", rightSide)\n List.transpose(newRow).map(_.mkString)\n }\n\n private val entrance = Loc(0,0)\n\n private def printCell(loc: Loc): List[String] = {\n if (loc.y == height)\n List(\"+--\")\n else List(\n if (openNorth(loc)) \"+ \" else \"+--\",\n if (openWest(loc) || loc == entrance) \" \" else \"| \"\n )\n }\n\n def openNorth(loc: Loc): Boolean = openInDirection(loc, North)\n\n def openWest(loc: Loc): Boolean = openInDirection(loc, West)\n\n private def openInDirection(loc: Loc, dir: Direction): Boolean =\n doors.contains(Door(loc, loc + dir)) || doors.contains(Door(loc + dir, loc))\n}\n","language":"Scala"},{"code":"var(w:5, h:5) = ARGV.map{.to_i}...\nvar avail = (w * h)\n\n# cell is padded by sentinel col and row, so I don't check array bounds\nvar cell = (1..h -> map {([true] * w) + [false]} + [[false] * w+1])\nvar ver = (1..h -> map {[\"| \"] * w })\nvar hor = (0..h -> map {[\"+--\"] * w })\n\nfunc walk(x, y) {\n cell[y][x] = false\n avail-- > 0 || return nil # no more cells\n\n var d = [[-1, 0], [0, 1], [1, 0], [0, -1]]\n while (!d.is_empty) {\n var i = d.pop_rand\n var (x1, y1) = (x + i[0], y + i[1])\n\n cell[y1][x1] || next\n\n if (x == x1) { hor[[y1, y].max][x] = '+ ' }\n if (y == y1) { ver[y][[x1, x].max] = ' ' }\n walk(x1, y1)\n }\n}\n\nwalk(w.rand.int, h.rand.int) # generate\n\nfor i in (0 .. h) {\n say (hor[i].join('') + '+')\n if (i < h) {\n say (ver[i].join('') + '|')\n }\n}\n","language":"Sidef"},{"code":"// some useful functions\n(\n~grid = { 0 ! 60 } ! 60;\n\n~at = { |coord|\n\tvar col = ~grid.at(coord[0]);\n\tif(col.notNil) { col.at(coord[1]) }\n};\n~put = { |coord, value|\n\tvar col = ~grid.at(coord[0]);\n\tif(col.notNil) { col.put(coord[1], value) }\n};\n\n~coord = ~grid.shape.rand;\n~next = { |p|\n\tvar possible = [p] + [[0, 1], [1, 0], [-1, 0], [0, -1]];\n\tpossible = possible.select { |x|\n\t\tvar c = ~at.(x);\n\t\tc.notNil and: { c == 0 }\n\t};\n\tpossible.choose\n};\n~walkN = { |p, scale|\n\tvar next = ~next.(p);\n\tif(next.notNil) {\n\t\t~put.(next, 1);\n\t\tPen.lineTo(~topoint.(next, scale));\n\t\t~walkN.(next, scale);\n\t\t~walkN.(next, scale);\n\t\tPen.moveTo(~topoint.(p, scale));\n\t};\n};\n\n~topoint = { |c, scale| (c + [1, 1] * scale).asPoint };\n\n)\n\n// do the drawing\n(\nvar b, w;\n\nb = Rect(100, 100, 700, 700);\nw = Window(\"so-a-mazing\", b);\nw.view.background_(Color.black);\n\nw.drawFunc = {\n\tvar p = ~grid.shape.rand;\n\tvar scale = b.width / ~grid.size * 0.98;\n\tPen.moveTo(~topoint.(p, scale));\n\t~walkN.(p, scale);\n\tPen.width = scale / 4;\n\tPen.color = Color.white;\n\tPen.stroke;\n};\nw.front.refresh;\n)\n","language":"SuperCollider"},{"code":"import Foundation\n\nextension Array {\n mutating func shuffle() {\n guard count > 1 else { return }\n\n for i in 0..<self.count - 1 {\n let j = Int(arc4random_uniform(UInt32(count - i))) + i\n guard i != j else { continue }\n swap(&self[i], &self[j])\n }\n }\n}\n\nenum Direction:Int {\n case north = 1\n case south = 2\n case east = 4\n case west = 8\n\n static var allDirections:[Direction] {\n return [Direction.north, Direction.south, Direction.east, Direction.west]\n }\n\n var opposite:Direction {\n switch self {\n case .north:\n return .south\n case .south:\n return .north\n case .east:\n return .west\n case .west:\n return .east\n }\n }\n\n var diff:(Int, Int) {\n switch self {\n case .north:\n return (0, -1)\n case .south:\n return (0, 1)\n case .east:\n return (1, 0)\n case .west:\n return (-1, 0)\n }\n }\n\n var char:String {\n switch self {\n case .north:\n return \"N\"\n case .south:\n return \"S\"\n case .east:\n return \"E\"\n case .west:\n return \"W\"\n }\n }\n\n}\n\nclass MazeGenerator {\n let x:Int\n let y:Int\n var maze:[[Int]]\n\n init(_ x:Int, _ y:Int) {\n self.x = x\n self.y = y\n let column = [Int](repeating: 0, count: y)\n self.maze = [[Int]](repeating: column, count: x)\n generateMaze(0, 0)\n }\n\n private func generateMaze(_ cx:Int, _ cy:Int) {\n var directions = Direction.allDirections\n directions.shuffle()\n for direction in directions {\n let (dx, dy) = direction.diff\n let nx = cx + dx\n let ny = cy + dy\n if inBounds(nx, ny) && maze[nx][ny] == 0 {\n maze[cx][cy] |= direction.rawValue\n maze[nx][ny] |= direction.opposite.rawValue\n generateMaze(nx, ny)\n }\n }\n }\n\n private func inBounds(_ testX:Int, _ testY:Int) -> Bool {\n return inBounds(value:testX, upper:self.x) && inBounds(value:testY, upper:self.y)\n }\n\n private func inBounds(value:Int, upper:Int) -> Bool {\n return (value >= 0) && (value < upper)\n }\n\n func display() {\n let cellWidth = 3\n for j in 0..<y {\n // Draw top edge\n var topEdge = \"\"\n for i in 0..<x {\n topEdge += \"+\"\n topEdge += String(repeating: (maze[i][j] & Direction.north.rawValue) == 0 ? \"-\" : \" \", count: cellWidth)\n }\n topEdge += \"+\"\n print(topEdge)\n\n // Draw left edge\n var leftEdge = \"\"\n for i in 0..<x {\n leftEdge += (maze[i][j] & Direction.west.rawValue) == 0 ? \"|\" : \" \"\n leftEdge += String(repeating: \" \", count: cellWidth)\n }\n leftEdge += \"|\"\n print(leftEdge)\n }\n\n // Draw bottom edge\n var bottomEdge = \"\"\n for _ in 0..<x {\n bottomEdge += \"+\"\n bottomEdge += String(repeating: \"-\", count: cellWidth)\n }\n bottomEdge += \"+\"\n print(bottomEdge)\n }\n\n func displayInts() {\n for j in 0..<y {\n var line = \"\"\n for i in 0..<x {\n line += String(maze[i][j]) + \"\\t\"\n }\n print(line)\n }\n }\n\n func displayDirections() {\n for j in 0..<y {\n var line = \"\"\n for i in 0..<x {\n line += getDirectionsAsString(maze[i][j]) + \"\\t\"\n }\n print(line)\n }\n }\n\n private func getDirectionsAsString(_ value:Int) -> String {\n var line = \"\"\n for direction in Direction.allDirections {\n if (value & direction.rawValue) != 0 {\n line += direction.char\n }\n }\n return line\n }\n}\n\n\nlet x = 20\nlet y = 10\nlet maze = MazeGenerator(x, y)\nmaze.display()\n","language":"Swift"},{"code":"package require TclOO; # Or Tcl 8.6\n\n# Helper to pick a random number\nproc rand n {expr {int(rand() * $n)}}\n# Helper to pick a random element of a list\nproc pick list {lindex $list [rand [llength $list]]}\n# Helper _function_ to index into a list of lists\nproc tcl::mathfunc::idx {v x y} {lindex $v $x $y}\n\noo::class create maze {\n variable x y horiz verti content\n constructor {width height} {\n\tset y $width\n\tset x $height\n\n\tset n [expr {$x * $y - 1}]\n\tif {$n < 0} {error \"illegal maze dimensions\"}\n\tset horiz [set verti [lrepeat $x [lrepeat $y 0]]]\n\t# This matrix holds the output for the Maze Solving task; not used for generation\n\tset content [lrepeat $x [lrepeat $y \" \"]]\n\tset unvisited [lrepeat [expr {$x+2}] [lrepeat [expr {$y+2}] 0]]\n\t# Helper to write into a list of lists (with offsets)\n\tproc unvisited= {x y value} {\n\t upvar 1 unvisited u\n\t lset u [expr {$x+1}] [expr {$y+1}] $value\n\t}\n\n\tlappend stack [set here [list [rand $x] [rand $y]]]\n\tfor {set j 0} {$j < $x} {incr j} {\n\t for {set k 0} {$k < $y} {incr k} {\n\t\tunvisited= $j $k [expr {$here ne [list $j $k]}]\n\t }\n\t}\n\n\twhile {0 < $n} {\n\t lassign $here hx hy\n\t set neighbours {}\n\t foreach {dx dy} {1 0 0 1 -1 0\t 0 -1} {\n\t\tif {idx($unvisited, $hx+$dx+1, $hy+$dy+1)} {\n\t\t lappend neighbours [list [expr {$hx+$dx}] [expr {$hy+$dy}]]\n\t\t}\n\t }\n\t if {[llength $neighbours]} {\n\t\tlassign [set here [pick $neighbours]] nx ny\n\t\tunvisited= $nx $ny 0\n\t\tif {$nx == $hx} {\n\t\t lset horiz $nx [expr {min($ny, $hy)}] 1\n\t\t} else {\n\t\t lset verti [expr {min($nx, $hx)}] $ny 1\n\t\t}\n\t\tlappend stack $here\n\t\tincr n -1\n\t } else {\n\t\tset here [lindex $stack end]\n\t\tset stack [lrange $stack 0 end-1]\n\t }\n\t}\n\n\trename unvisited= {}\n }\n\n # Maze displayer; takes a maze dictionary, returns a string\n method view {} {\n\tset text {}\n\tfor {set j 0} {$j < $x*2+1} {incr j} {\n\t set line {}\n\t for {set k 0} {$k < $y*4+1} {incr k} {\n\t\tif {$j%2 && $k%4==2} {\n\t\t # At the centre of the cell, put the \"content\" of the cell\n\t\t append line [expr {idx($content, $j/2, $k/4)}]\n\t\t} elseif {$j%2 && ($k%4 || $k && idx($horiz, $j/2, $k/4-1))} {\n\t\t append line \" \"\n\t\t} elseif {$j%2} {\n\t\t append line \"|\"\n\t\t} elseif {0 == $k%4} {\n\t\t append line \"+\"\n\t\t} elseif {$j && idx($verti, $j/2-1, $k/4)} {\n\t\t append line \" \"\n\t\t} else {\n\t\t append line \"-\"\n\t\t}\n\t }\n\t if {!$j} {\n\t\tlappend text [string replace $line 1 3 \" \"]\n\t } elseif {$x*2-1 == $j} {\n\t\tlappend text [string replace $line end end \" \"]\n\t } else {\n\t\tlappend text $line\n\t }\n\t}\n\treturn [join $text \\n]\n }\n}\n\n# Demonstration\nmaze create m 11 8\nputs [m view]\n","language":"Tcl"},{"code":"@(bind (width height) (15 15))\n@(do\n (defvar *r* (make-random-state nil))\n (defvar vi)\n (defvar pa)\n\n (defun neigh (loc)\n (let ((x (from loc))\n (y (to loc)))\n (list (- x 1)..y (+ x 1)..y\n x..(- y 1) x..(+ y 1))))\n\n (defun make-maze-rec (cu)\n (set [vi cu] t)\n (each ((ne (shuffle (neigh cu))))\n (cond ((not [vi ne])\n (push ne [pa cu])\n (push cu [pa ne])\n (make-maze-rec ne)))))\n\n (defun make-maze (w h)\n (let ((vi (hash :equal-based))\n (pa (hash :equal-based)))\n (each ((x (range -1 w)))\n (set [vi x..-1] t)\n (set [vi x..h] t))\n (each ((y (range* 0 h)))\n (set [vi -1..y] t)\n (set [vi w..y] t))\n (make-maze-rec 0..0)\n pa))\n\n (defun print-tops (pa w j)\n (each ((i (range* 0 w)))\n (if (memqual i..(- j 1) [pa i..j])\n (put-string \"+ \")\n (put-string \"+----\")))\n (put-line \"+\"))\n\n (defun print-sides (pa w j)\n (let ((str \"\"))\n (each ((i (range* 0 w)))\n (if (memqual (- i 1)..j [pa i..j])\n (set str `@str `)\n (set str `@str| `)))\n (put-line `@str|\\n@str|`)))\n\n (defun print-maze (pa w h)\n (each ((j (range* 0 h)))\n (print-tops pa w j)\n (print-sides pa w j))\n (print-tops pa w h)))\n@;;\n@(bind m @(make-maze width height))\n@(do (print-maze m width height))\n","language":"TXR"},{"code":"(defvar vi) ;; visited hash\n(defvar pa) ;; path connectivity hash\n(defvar sc) ;; count, derived from straightness fator\n\n(defun rnd-pick (list)\n (if list [list (rand (length list))]))\n\n(defun neigh (loc)\n (let ((x (from loc))\n (y (to loc)))\n (list (- x 1)..y (+ x 1)..y\n x..(- y 1) x..(+ y 1))))\n\n(defun make-maze-impl (cu)\n (let ((q (list cu))\n (c sc))\n (set [vi cu] t)\n (while q\n (let* ((cu (first q))\n (ne (rnd-pick (remove-if vi (neigh cu)))))\n (cond (ne (set [vi ne] t)\n (push ne [pa cu])\n (push cu [pa ne])\n (push ne q)\n (cond ((<= (dec c) 0)\n (set q (shuffle q))\n (set c sc))))\n (t (pop q)))))))\n\n(defun make-maze (w h sf)\n (let ((vi (hash :equal-based))\n (pa (hash :equal-based))\n (sc (max 1 (trunc (* sf w h) 100))))\n (each ((x (range -1 w)))\n (set [vi x..-1] t)\n (set [vi x..h] t))\n (each ((y (range* 0 h)))\n (set [vi -1..y] t)\n (set [vi w..y] t))\n (make-maze-impl 0..0)\n pa))\n\n(defun print-tops (pa w j)\n (each ((i (range* 0 w)))\n (if (memqual i..(- j 1) [pa i..j])\n (put-string \"+ \")\n (put-string \"+----\")))\n (put-line \"+\"))\n\n(defun print-sides (pa w j)\n (let ((str \"\"))\n (each ((i (range* 0 w)))\n (if (memqual (- i 1)..j [pa i..j])\n (set str `@str `)\n (set str `@str| `)))\n (put-line `@str|\\n@str|`)))\n\n(defun print-maze (pa w h)\n (each ((j (range* 0 h)))\n (print-tops pa w j)\n (print-sides pa w j))\n (print-tops pa w h))\n\n(defun usage ()\n (let ((invocation (ldiff *full-args* *args*)))\n (put-line \"usage: \")\n (put-line `@invocation <width> <height> [<straightness>]`)\n (put-line \"straightness-factor is a percentage, defaulting to 15\")\n (exit 1)))\n\n(let ((args [mapcar int-str *args*])\n (*random-state* (make-random-state nil)))\n (if (memq nil args)\n (usage))\n (tree-case args\n ((w h s ju . nk) (usage))\n ((w h : (s 15)) (set w (max 1 w))\n (set h (max 1 h))\n (print-maze (make-maze w h s) w h))\n (else (usage))))\n","language":"TXR"},{"code":"interface mazeData{\n\tnodes:Node[]\n\tx:number\n\ty:number\n\tblockSize:number\n}\n\nclass Node{\n\tx:number\n\ty:number\n\twallsTo:Node[]\n\tvisited = false\n\tconstructor(x:number,y:number){\n\t\tthis.x = x\n\t\tthis.y = y\n\t}\n\tgetTouchingNodes(nodes:Node[],blockSize:number){\n return nodes.filter(n=>\n (this != n) &&\n (Math.hypot(this.x-n.x,this.y-n.y) == blockSize )\n )\n }\n\tdraw(ctx:CanvasRenderingContext2D,blockSize:number){\n ctx.fillStyle ='black'\n this.wallsTo.forEach(el=>{\n ctx.save()\n ctx.translate(this.x,this.y)\n ctx.rotate(Math.atan2(this.y-el.y,this.x-el.x)+ Math.PI)\n ctx.beginPath()\n ctx.moveTo(blockSize/2,blockSize/2)\n ctx.lineTo(blockSize/2,-blockSize/2)\n ctx.stroke()\n ctx.restore()\n })\n }\n}\n\nexport function maze(x:number,y:number):mazeData {\n\tlet blockSize = 20\n\tx *= blockSize\n\ty *= blockSize\n\tlet nodes = Array((x/blockSize)*(y/blockSize)).fill(0).map((_el,i)=>\n\t\tnew Node(\n\t\t\t(i%(x/blockSize)*(blockSize))+(blockSize/2),\n\t\t\t(Math.floor(i/(x/blockSize))*(blockSize))+(blockSize/2)\n\t\t)\n\t)\n\tnodes.forEach(n=>n.wallsTo = n.getTouchingNodes(nodes,blockSize))\n\tlet que = [nodes[0]]\n\twhile(que.length > 0){\n\t\tlet current = que.shift()\n\t\tlet unvisited = current\n\t\t.getTouchingNodes(nodes,blockSize)\n\t\t.filter(el=>!el.visited)\n\t\tif(unvisited.length >0){\n\t\t\tque.push(current)\n\t\t\tlet chosen = unvisited[Math.floor(Math.random()*unvisited.length)];\n\t\t\tcurrent.wallsTo = current.wallsTo.filter((el)=>el != chosen)\n\t\t\tchosen.wallsTo = chosen.wallsTo.filter((el)=>el != current)\n\t\t\tchosen.visited = true\n\t\t\tque.unshift(chosen)\n\t\t}\n\t}\n\treturn {x:x,y:y,nodes:nodes,blockSize:blockSize}\n}\n\nexport function display(c:HTMLCanvasElement,mazeData:mazeData){\n\tlet ctx = c.getContext('2d')\n\tc.width = mazeData.x\n\tc.height = mazeData.y\n\tctx.fillStyle = 'white'\n\tctx.strokeStyle = 'black'\n\tctx.fillRect(0,0,mazeData.x,mazeData.y)\n\tctx.strokeRect(0,0,mazeData.x,mazeData.y)\n\tmazeData.nodes.forEach(el=>el.draw(ctx,mazeData.blockSize))\n}\n","language":"TypeScript"},{"code":"import { maze,display } from \"./maze\"\nconst X = 10\nconst Y = 10\n\nlet canvas = document.createElement('canvas')\ndocument.body.appendChild(canvas)\nlet m = maze(X,Y)\ndisplay(canvas,m)\n","language":"TypeScript"},{"code":"H ← 8\nW ← 18\nVer ← 0\nHor ← 1\nVis ← 2\n\nBreakNS ← ⊂Ver⊂⊃(/↥≡⊡0|⊡0_1)\nBreakEW ← ⊂Hor⊂⊃(⊡0_0|/↥≡⊡1)\n# ([here, next], maze) -> (maze')\nBreakWall ← ⍜⊡(0◌)⟨BreakNS|BreakEW⟩=°⊟≡⊢.\n\nNeighbours ← +⊙¤[[¯1 0] [1 0] [0 1] [0 ¯1]] # Gives N4\nShuffle ← ⊏⍏[⍥⚂]⧻.\nIsVisited ← ¬⊡⊂Vis\nMarkAsVisited ← ⟜(⍜(⊡|1◌)⊂Vis)\nOnlyInBounds ← ▽≡IsVisited ⊙¤,, # (finds the boundary 1's)\n\n# (here, maze) -> (maze')\nWalk ← |2 (\n MarkAsVisited\n # (here, maze) -> ([[here, next] x(up to)4], maze)\n ≡⊟¤⟜(Shuffle OnlyInBounds Neighbours)\n\n # Update maze for each in turn. For each, if it\n # still isn't visited, break the wall, recurse into it.\n ∧(⟨◌|Walk ⊡1 ⟜BreakWall⟩IsVisited◌°⊟,,)\n)\n\n⊂↯H⊂↯W0 1↯+1W1 # vis (added 1's help bounds checks)\n⊂↯H⊂↯W1 1↯+1W 0 # ver\n↯+1H⊂↯W1 0 # hor\n⊂⊟\n# Stack: ([hor, ver, vis])\nWalk [0 0]\n\nPP! ← ≡/⊂∵^! # Pretty print using switch.\n≡(&p$\"_\\n_\")⊃(PP!⟨\"+ \"|\"+--\"⟩⊡Ver|PP!⟨\" \"|\"| \"⟩⊡Hor)\n","language":"Uiua"},{"code":"import \"random\" for Random\nimport \"os\" for Process\n\nvar Rand = Random.new()\n\nclass Direction {\n static n { __n }\n static s { __s }\n static e { __e }\n static w { __w }\n\n static init() {\n __n = new_(1, 0, -1)\n __s = new_(2, 0, 1)\n __e = new_(4, 1, 0)\n __w = new_(8, -1, 0)\n\n __n.opposite = __s\n __s.opposite = __n\n __e.opposite = __w\n __w.opposite = __e\n }\n\n construct new_(bit, dx, dy) {\n _bit = bit\n _dx = dx\n _dy = dy\n _opposite = null\n }\n\n bit { _bit }\n dx { _dx }\n dy { _dy }\n\n opposite { _opposite }\n opposite=(d) { _opposite = d }\n}\n\nDirection.init()\n\nclass MazeGenerator {\n construct new(x, y) {\n _x = x\n _y = y\n _maze = List.filled(x, null)\n for (i in 0...x) _maze[i] = List.filled(y, 0)\n }\n\n between_(v, upper) { v >= 0 && v < upper }\n\n generate(cx, cy) {\n var values = [Direction.n, Direction.s, Direction.e, Direction.w]\n Rand.shuffle(values)\n values.each { |v|\n var nx = cx + v.dx\n var ny = cy + v.dy\n if (between_(nx, _x) && between_(ny, _y) && _maze[nx][ny] == 0) {\n _maze[cx][cy] = _maze[cx][cy] | v.bit\n _maze[nx][ny] = _maze[nx][ny] | v.opposite.bit\n generate(nx, ny)\n }\n }\n }\n\n display() {\n for (i in 0..._y) {\n // draw the north edge\n for (j in 0..._x) System.write((_maze[j][i] & 1) == 0 ? \"+---\" : \"+ \")\n System.print(\"+\")\n\n // draw the west edge\n for (j in 0..._x) System.write((_maze[j][i] & 8) == 0 ? \"| \" : \" \")\n System.print(\"|\")\n }\n\n // draw the bottom line\n for (j in 0..._x) System.write(\"+---\")\n System.print(\"+\")\n }\n}\n\nvar args = Process.arguments\nvar x = (args.count >= 1) ? Num.fromString(args[0]) : 8\nvar y = (args.count == 2) ? Num.fromString(args[1]) : 8\nvar mg = MazeGenerator.new(x, y)\nmg.generate(0, 0)\nmg.display()\n","language":"Wren"},{"code":"code Ran=1, CrLf=9, Text=12; \\intrinsic routines\ndef Cols=20, Rows=6; \\dimensions of maze (cells)\nint Cell(Cols+1, Rows+1, 3); \\cells (plus right and bottom borders)\ndef LeftWall, Ceiling, Connected; \\attributes of each cell (= 0, 1 and 2)\n\nproc ConnectFrom(X, Y); \\Connect cells starting from cell X,Y\nint X, Y;\nint Dir, Dir0;\n[Cell(X, Y, Connected):= true; \\mark current cell as connected\nDir:= Ran(4); \\randomly choose a direction\nDir0:= Dir; \\save this initial direction\nrepeat case Dir of \\try to connect to cell at Dir\n 0: if X+1<Cols & not Cell(X+1, Y, Connected) then \\go right\n [Cell(X+1, Y, LeftWall):= false; ConnectFrom(X+1, Y)];\n 1: if Y+1<Rows & not Cell(X, Y+1, Connected) then \\go down\n [Cell(X, Y+1, Ceiling):= false; ConnectFrom(X, Y+1)];\n 2: if X-1>=0 & not Cell(X-1, Y, Connected) then \\go left\n [Cell(X, Y, LeftWall):= false; ConnectFrom(X-1, Y)];\n 3: if Y-1>=0 & not Cell(X, Y-1, Connected) then \\go up\n [Cell(X, Y, Ceiling):= false; ConnectFrom(X, Y-1)]\n other []; \\(never occurs)\n Dir:= Dir+1 & $03; \\next direction\nuntil Dir = Dir0;\n];\n\nint X, Y;\n[for Y:= 0 to Rows do\n for X:= 0 to Cols do\n [Cell(X, Y, LeftWall):= true; \\start with all walls and\n Cell(X, Y, Ceiling):= true; \\ ceilings in place\n Cell(X, Y, Connected):= false; \\ and all cells disconnected\n ];\nCell(0, 0, LeftWall):= false; \\make left and right doorways\nCell(Cols, Rows-1, LeftWall):= false;\nConnectFrom(Ran(Cols), Ran(Rows)); \\randomly pick a starting cell\nfor Y:= 0 to Rows do \\display the maze\n [CrLf(0);\n for X:= 0 to Cols do\n Text(0, if X#Cols & Cell(X, Y, Ceiling) then \"+--\" else \"+ \");\n CrLf(0);\n for X:= 0 to Cols do\n Text(0, if Y#Rows & Cell(X, Y, LeftWall) then \"| \" else \" \");\n ];\n]\n","language":"XPL0"},{"code":"fcn make_maze(w = 16, h = 8){\n // make arrays with lists of lists (all mutable)\n vis:=(w.pump(List().write,0)+1)*h + w.pump(List().write,1);\n ver:=(w.pump(List().write,T(Void,\"| \")) + \"|\")*h + T;\n hor:=(w.pump(List().write,T(Void,\"+---\")) + \"+\")*(h + 1);\n\n fcn(x,y,vis,ver,hor){\n vis[y][x] = 1;\n\n d:=L(T(x - 1, y), T(x, y + 1), T(x + 1, y), T(x, y - 1)).shuffle();\n foreach xx,yy in (d){\n\t if(vis[yy][xx]) continue;\n\t if(xx==x) hor[y.max(yy)][x]=\"+ \";\n\t if(yy==y) ver[y][x.max(xx)]=\" \";\n\t self.fcn(xx,yy,vis,ver,hor);\n }\n }((0).random(w),(0).random(h),vis,ver,hor);\n foreach a,b in (hor.zip(ver)) { println(a.concat(),\"\\n\",b.concat()) }\n return(ver,hor);\n}\nmake_maze();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Maze_generation\\nnote: Games\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"<br>\\n;Task:\\nGenerate and show a maze, using the simple [[wp:Maze_generation_algorithm#Depth-first_search|Depth-first search]] algorithm.\\n\\n<!-- BEGIN TEXT FROM WIKIPEDIA -->\\n#Start at a random cell.\\n#Mark the current cell as visited, and get a list of its neighbors. For each neighbor, starting with a randomly selected neighbor:\\n#:If that neighbor hasn't been visited, remove the wall between this cell and that neighbor, and then recurse with that neighbor as the current cell.\\n<!-- END TEXT FROM WIKIPEDIA -->\\n<br><br>\\n\\n; Related tasks\\n* [[Maze solving]].\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F make_maze(w = 16, h = 8)\\n V vis = [[0] * w [+] [1]] * h [+] [[1] * (w + 1)]\\n V ver = [[‘| ’] * w [+] [String(‘|’)]] * h [+] [[String]()]\\n V hor = [[‘+--’] * w [+] [String(‘+’)]] * (h + 1)\\n\\n F walk(Int x, Int y) -> N\\n @vis[y][x] = 1\\n V d = [(x - 1, y), (x, y + 1), (x + 1, y), (x, y - 1)]\\n random:shuffle(&d)\\n L(=xx, =yy) d\\n I yy == -1\\n yy = @vis.len - 1\\n I xx == -1\\n xx = @vis[0].len - 1\\n I @vis[yy][xx]\\n L.continue\\n I xx == x\\n @hor[max(y, yy)][x] = ‘+ ’\\n I yy == y\\n @ver[y][max(x, xx)] = ‘ ’\\n @walk(xx, yy)\\n\\n walk(random:(w), random:(h))\\n\\n V s = ‘’\\n L(a, b) zip(hor, ver)\\n s ‘’= (a [+] [String(\\\"\\\\n\\\")] + b [+] [String(\\\"\\\\n\\\")]).join(‘’)\\n R s\\n\\nprint(make_maze())\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"DEFINE TOP=\\\"0\\\"\\nDEFINE RIGHT=\\\"1\\\"\\nDEFINE BOTTOM=\\\"2\\\"\\nDEFINE LEFT=\\\"3\\\"\\nDEFINE WIDTH=\\\"160\\\"\\nDEFINE HEIGHT=\\\"96\\\"\\n\\nDEFINE STACK_SIZE=\\\"5000\\\"\\nBYTE ARRAY stack(STACK_SIZE)\\nINT stackSize\\n\\nPROC InitStack()\\n stackSize=0\\nRETURN\\n\\nBYTE FUNC IsEmpty()\\n IF stackSize=0 THEN\\n RETURN (1)\\n FI\\nRETURN (0)\\n\\nBYTE FUNC IsFull()\\n IF stackSize>=STACK_SIZE THEN\\n RETURN (1)\\n FI\\nRETURN (0)\\n\\nPROC Push(BYTE x,y)\\n IF IsFull() THEN Break() RETURN FI\\n stack(stackSize)=x stackSize==+1\\n stack(stackSize)=y stackSize==+1\\nRETURN\\n\\nPROC Pop(BYTE POINTER x,y)\\n IF IsEmpty() THEN Break() RETURN FI\\n stackSize==-1 y^=stack(stackSize)\\n stackSize==-1 x^=stack(stackSize)\\nRETURN\\n\\nPROC FillScreen()\\n BYTE POINTER ptr ;pointer to the screen memory\\n INT screenSize=[3840]\\n\\n ptr=PeekC(88)\\n SetBlock(ptr,screenSize,$55)\\n\\n Color=0\\n Plot(0,HEIGHT-1) DrawTo(WIDTH-1,HEIGHT-1) DrawTo(WIDTH-1,0)\\nRETURN\\n\\nPROC GetNeighbors(BYTE x,y BYTE ARRAY n BYTE POINTER count)\\n DEFINE WALL=\\\"1\\\"\\n\\n count^=0\\n IF y>2 AND Locate(x,y-2)=WALL THEN\\n n(count^)=TOP count^==+1\\n FI\\n IF x<WIDTH-3 AND Locate(x+2,y)=WALL THEN\\n n(count^)=RIGHT count^==+1\\n FI\\n IF y<HEIGHT-3 AND Locate(x,y+2)=WALL THEN\\n n(count^)=BOTTOM count^==+1\\n FI\\n IF x>2 AND Locate(x-2,y)=WALL THEN\\n n(count^)=LEFT count^==+1\\n FI\\nRETURN\\n\\nPROC Maze(BYTE x,y)\\n BYTE ARRAY stack,neighbors\\n BYTE dir,nCount\\n\\n FillScreen()\\n\\n Color=2\\n InitStack()\\n Push(x,y)\\n WHILE IsEmpty()=0\\n DO\\n Pop(@x,@y)\\n GetNeighbors(x,y,neighbors,@nCount)\\n IF nCount>0 THEN\\n Push(x,y)\\n Plot(x,y)\\n dir=neighbors(Rand(nCount))\\n IF dir=TOP THEN\\n y==-2\\n ELSEIF dir=RIGHT THEN\\n x==+2\\n ELSEIF dir=BOTTOM THEN\\n y==+2\\n ELSE\\n x==-2\\n FI\\n DrawTo(x,y)\\n Push(x,y)\\n FI\\n OD\\nRETURN\\n\\nPROC Main()\\n BYTE CH=$02FC,COLOR0=$02C4,COLOR1=$02C5\\n BYTE x,y\\n\\n Graphics(7+16)\\n COLOR0=$0A\\n COLOR1=$04\\n\\n x=Rand((WIDTH RSH 1)-1) LSH 1+1\\n y=Rand((HEIGHT RSH 1)-1) LSH 1+1\\n Maze(x,y)\\n\\n DO UNTIL CH#$FF OD\\n CH=$FF\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"generic\\n Height : Positive;\\n Width : Positive;\\npackage Mazes is\\n\\n type Maze_Grid is private;\\n\\n procedure Initialize (Maze : in out Maze_Grid);\\n\\n procedure Put (Item : Maze_Grid);\\n\\nprivate\\n\\n type Directions is (North, South, West, East);\\n\\n type Cell_Walls is array (Directions) of Boolean;\\n type Cells is record\\n Walls : Cell_Walls := (others => True);\\n Visited : Boolean := False;\\n end record;\\n\\n subtype Height_Type is Positive range 1 .. Height;\\n subtype Width_Type is Positive range 1 .. Width;\\n\\n type Maze_Grid is array (Height_Type, Width_Type) of Cells;\\n\\nend Mazes;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Numerics.Discrete_Random;\\nwith Ada.Text_IO;\\n\\npackage body Mazes is\\n package RNG is new Ada.Numerics.Discrete_Random (Positive);\\n package Random_Direction is new Ada.Numerics.Discrete_Random (Directions);\\n\\n Generator : RNG.Generator;\\n Dir_Generator : Random_Direction.Generator;\\n\\n function \\\"-\\\" (Dir : Directions) return Directions is\\n begin\\n case Dir is\\n when North =>\\n return South;\\n when South =>\\n return North;\\n when East =>\\n return West;\\n when West =>\\n return East;\\n end case;\\n end \\\"-\\\";\\n\\n procedure Move\\n (Row : in out Height_Type;\\n Column : in out Width_Type;\\n Direction : Directions;\\n Valid_Move : out Boolean)\\n is\\n begin\\n Valid_Move := False;\\n case Direction is\\n when North =>\\n if Row > Height_Type'First then\\n Valid_Move := True;\\n Row := Row - 1;\\n end if;\\n when East =>\\n if Column < Width_Type'Last then\\n Valid_Move := True;\\n Column := Column + 1;\\n end if;\\n when West =>\\n if Column > Width_Type'First then\\n Valid_Move := True;\\n Column := Column - 1;\\n end if;\\n when South =>\\n if Row < Height_Type'Last then\\n Valid_Move := True;\\n Row := Row + 1;\\n end if;\\n end case;\\n end Move;\\n\\n procedure Depth_First_Algorithm\\n (Maze : in out Maze_Grid;\\n Row : Height_Type;\\n Column : Width_Type)\\n is\\n Next_Row : Height_Type;\\n Next_Column : Width_Type;\\n Next_Direction : Directions;\\n Valid_Direction : Boolean;\\n Tested_Wall : array (Directions) of Boolean := (others => False);\\n All_Tested : Boolean;\\n begin\\n -- mark as visited\\n Maze (Row, Column).Visited := True;\\n loop\\n -- use random direction\\n loop\\n Next_Direction := Random_Direction.Random (Dir_Generator);\\n exit when not Tested_Wall (Next_Direction);\\n end loop;\\n Next_Row := Row;\\n Next_Column := Column;\\n Move (Next_Row, Next_Column, Next_Direction, Valid_Direction);\\n if Valid_Direction then\\n if not Maze (Next_Row, Next_Column).Visited then\\n -- connect the two cells\\n Maze (Row, Column).Walls (Next_Direction) :=\\n False;\\n Maze (Next_Row, Next_Column).Walls (-Next_Direction) :=\\n False;\\n Depth_First_Algorithm (Maze, Next_Row, Next_Column);\\n end if;\\n end if;\\n Tested_Wall (Next_Direction) := True;\\n -- continue as long as there are unvisited neighbours left\\n All_Tested := True;\\n for D in Directions loop\\n All_Tested := All_Tested and Tested_Wall (D);\\n end loop;\\n -- all directions are either visited (from here,\\n -- or previously visited), or invalid.\\n exit when All_Tested;\\n end loop;\\n end Depth_First_Algorithm;\\n\\n procedure Initialize (Maze : in out Maze_Grid) is\\n Row, Column : Positive;\\n begin\\n -- initialize random generators\\n RNG.Reset (Generator);\\n Random_Direction.Reset (Dir_Generator);\\n -- choose starting cell\\n Row := RNG.Random (Generator) mod Height + 1;\\n Column := RNG.Random (Generator) mod Width + 1;\\n Ada.Text_IO.Put_Line\\n (\\\"Starting generation at \\\" &\\n Positive'Image (Row) &\\n \\\" x\\\" &\\n Positive'Image (Column));\\n Depth_First_Algorithm (Maze, Row, Column);\\n end Initialize;\\n\\n procedure Put (Item : Maze_Grid) is\\n begin\\n for Row in Item'Range (1) loop\\n if Row = Item'First (1) then\\n Ada.Text_IO.Put ('+');\\n for Col in Item'Range (2) loop\\n if Item (Row, Col).Walls (North) then\\n Ada.Text_IO.Put (\\\"---+\\\");\\n else\\n Ada.Text_IO.Put (\\\" +\\\");\\n end if;\\n end loop;\\n Ada.Text_IO.New_Line;\\n end if;\\n for Col in Item'Range (2) loop\\n if Col = Item'First (2) then\\n if Item (Row, Col).Walls (West) then\\n Ada.Text_IO.Put ('|');\\n else\\n Ada.Text_IO.Put (' ');\\n end if;\\n elsif Item (Row, Col).Walls (West)\\n and then Item (Row, Col - 1).Walls (East)\\n then\\n Ada.Text_IO.Put ('|');\\n elsif Item (Row, Col).Walls (West)\\n or else Item (Row, Col - 1).Walls (East)\\n then\\n Ada.Text_IO.Put ('>');\\n else\\n Ada.Text_IO.Put (' ');\\n end if;\\n if Item (Row, Col).Visited then\\n Ada.Text_IO.Put (\\\" \\\");\\n else\\n Ada.Text_IO.Put (\\\"???\\\");\\n end if;\\n end loop;\\n if Item (Row, Item'Last (2)).Walls (East) then\\n Ada.Text_IO.Put_Line (\\\"|\\\");\\n else\\n Ada.Text_IO.Put_Line (\\\" \\\");\\n end if;\\n Ada.Text_IO.Put ('+');\\n for Col in Item'Range (2) loop\\n if Item (Row, Col).Walls (South) then\\n Ada.Text_IO.Put (\\\"---+\\\");\\n else\\n Ada.Text_IO.Put (\\\" +\\\");\\n end if;\\n end loop;\\n Ada.Text_IO.New_Line;\\n end loop;\\n end Put;\\nend Mazes;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Mazes;\\nprocedure Main is\\n package Small_Mazes is new Mazes (Height => 8, Width => 11);\\n My_Maze : Small_Mazes.Maze_Grid;\\nbegin\\n Small_Mazes.Initialize (My_Maze);\\n Small_Mazes.Put (My_Maze);\\nend Main;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"grid_maze(data b, integer N)\\n{\\n data d;\\n\\n N.times(bb_cast, d, \\\"+---\\\");\\n bb_cast(d, \\\"+\\\\n\\\");\\n\\n N.times(bb_cast, d, \\\"| * \\\");\\n bb_cast(d, \\\"|\\\\n\\\");\\n\\n N.times(bb_copy, b, d);\\n\\n b_size(d, N * 4 + 2);\\n\\n bb_copy(b, d);\\n}\\n\\nvoid\\nwalk_cell(data b, integer N, line_size, x, y, list x_offsets, y_offsets)\\n{\\n integer i, p, q, r;\\n\\n b_replace(b, y + x, ' ');\\n\\n r = drand(3);\\n\\n i = 0;\\n while (i < 4) {\\n p = x + x_offsets[q = (r + i) & 3];\\n q = y + y_offsets[q];\\n\\n if (-1 < p && p < line_size\\n && -1 < q && q < line_size * (N * 2 + 1)) {\\n if (b[q + p] == '*') {\\n walk_cell(b, N, line_size, p, q, x_offsets, y_offsets);\\n b[(q + y) / 2 + (p + x) / 2] = ' ';\\n if (p == x) {\\n b[(q + y) / 2 + p - 1] = ' ';\\n b[(q + y) / 2 + p + 1] = ' ';\\n }\\n }\\n }\\n\\n i += 1;\\n }\\n}\\n\\nwalk_maze(data b, integer N)\\n{\\n integer line_size, x, y;\\n list x_offsets, y_offsets;\\n\\n line_size = N * 4 + 1 + 1;\\n\\n l_bill(x_offsets, 0, 4, 0, -4, 0);\\n l_bill(y_offsets, 0, 0, line_size * 2, 0, line_size * -2);\\n\\n x = drand(N - 1) * 4 + 2;\\n y = line_size * (drand(N - 1) * 2 + 1);\\n\\n walk_cell(b, N, line_size, x, y, x_offsets, y_offsets);\\n}\\n\\nmain(void)\\n{\\n data b;\\n\\n grid_maze(b, 10);\\n walk_maze(b, 10);\\n\\n o_(b);\\n\\n 0;\\n}\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"This example shows how to use GNU APL scripting.\\n\\n#!/usr/local/bin/apl --script --\\n ⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝\\n⍝ ⍝\\n⍝ mazeGen.apl 2022-01-07 19:47:35 (GMT-8) ⍝\\n⍝ ⍝\\n ⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝⍝\\n\\n∇initPRNG\\n ⍝⍝ Seed the internal PRNG used by APL ? operator\\n ⎕RL ← +/ ⎕TS ⍝⍝ Not great... but good enough\\n∇\\n\\n∇offs ← cellTo dir\\n ⍝⍝ Return the offset (row col) to cell which lies in compass (dir)\\n offs ← ∊((¯1 0)(0 1)(1 0)(0 ¯1))[('nesw'⍳dir)]\\n∇\\n\\n∇doMaze rc\\n ⍝⍝ Main function\\n 0 0 mazeGen rc ⍝⍝ Do the maze gen\\n m ⍝⍝ output result\\n∇\\n\\n∇b ← m isVisited coord;mr;mc\\n →( ∨/ (coord[1] < 1) (coord[2] < 1) )/yes\\n →( ∨/ (coord > ⌊(⍴m)÷2) )/yes\\n b ← ' ' ∊ m[2×coord[1];2×coord[2]]\\n →0\\nyes:\\n b←1\\n∇\\n\\n∇c mazeGen sz ;dirs;c;dir;cell;next\\n →(c≠(0 0))/gen\\ninit:\\n c ← ?sz[1],?sz[2]\\n m ← mazeInit sz\\ngen:\\n cell ← c\\n dirs ← 'nesw'[4?4]\\n m[2×c[1];2×c[2]] ← ' ' ⍝ mark cell as visited\\ndir1:\\n dir ← dirs[1]\\n next ← cell + cellTo dir\\n →(m isVisited next)/dir2\\n m ← m openWall cell dir\\n next mazeGen sz\\ndir2:\\n dir ← dirs[2]\\n next ← cell + cellTo dir\\n →(m isVisited next)/dir3\\n m ← m openWall cell dir\\n next mazeGen sz\\ndir3:\\n dir ← dirs[3]\\n next ← cell + cellTo dir\\n →(m isVisited next)/dir4\\n m ← m openWall cell dir\\n next mazeGen sz\\ndir4:\\n dir ← dirs[4]\\n next ← cell + cellTo dir\\n →(m isVisited next)/done\\n m ← m openWall cell dir\\n next mazeGen sz\\ndone:\\n∇\\n\\n∇m ← mazeInit sz;rows;cols;r\\n ⍝⍝ Init an ASCII grid which\\n ⍝⍝ has all closed and unvisited cells:\\n ⍝⍝\\n ⍝⍝ +-+\\n ⍝⍝ |.|\\n ⍝⍝ +-+\\n ⍝⍝\\n ⍝⍝ @param sz - tuple (rows cols)\\n ⍝⍝ @return m - ASCII representation of (rows × cols) closed maze cells\\n ⍝⍝⍝⍝\\n\\n initPRNG\\n (rows cols) ← sz\\n r ← ∊ (cols ⍴ ⊂\\\"+-\\\" ),\\\"+\\\"\\n r ← r,∊ (cols ⍴ ⊂\\\"|.\\\" ),\\\"|\\\"\\n r ← (rows,(⍴r))⍴r\\n r ← ((2×rows),(1+2×cols))⍴r\\n r ← r⍪ (∊ (cols ⍴ ⊂\\\"+-\\\" ),\\\"+\\\")\\n m ← r\\n∇\\n\\n∇r ← m openWall cellAndDir ;ri;ci;rw;cw;row;col;dir\\n (row col dir) ← ∊cellAndDir\\n ri ← 2×row\\n ci ← 2×col\\n (rw cw) ← (ri ci) + cellTo dir\\n m[rw;cw] ← ' ' ⍝ open wall in (dir)\\n r ← m\\n∇\\n\\n⎕IO←1\\n\\ndoMaze 9 9\\n)OFF\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"; Initially build the board\\nWidth\\t:= 11\\nHeight\\t:= 8\\nLoop % height*2+1\\n{\\n\\tOuter := A_Index\\n\\tLoop % Width\\n\\t\\tmaze .= Outer & 1 ? \\\"+-\\\" : \\\"|0\\\"\\n\\tmaze .= (Outer & 1 ? \\\"+\\\" : \\\"|\\\") \\\"`n\\\"\\n}\\nStringTrimRight, maze, maze, 1 ; removes trailing newline\\nClipboard := Walk(maze)\\n\\nWalk(S, x=0, y=0){\\n\\tIf !x{\\t; --Start at a random cell...\\n\\t\\tStringReplace, junk, S, `n,,UseErrorLevel ; Calculate rows\\n\\t\\tRandom, y, 1, ErrorLevel//2\\n\\t\\tRandom, x, 1, InStr(S, \\\"`n\\\")//2-1 ; Calculate height\\n\\t}\\n\\t\\n\\t; --Obtain a list of its neighbors...\\n\\tneighbors := x \\\",\\\" y+1 \\\"`n\\\" x \\\",\\\" y-1 \\\"`n\\\" x+1 \\\",\\\" y \\\"`n\\\" x-1 \\\",\\\" y\\n\\t; --Randomize the list...\\n\\tSort neighbors, random\\n\\t\\n\\t; --Then for each neighbor...\\n\\tLoop Parse, neighbors, `n\\n\\t{\\n\\t\\tpC := InStr(A_LoopField, \\\",\\\"), x2 := SubStr(A_LoopField, 1, pC-1), y2 := SubStr(A_LoopField, pC+1)\\n\\t\\t; If it has not been visited...\\n\\t\\tIf GetChar(S, 2*x2, 2*y2) = \\\"0\\\"{\\n\\t\\t\\t; Mark it as visited...\\n\\t\\t\\tS := ChangeChar(s, 2*x2, 2*y2, \\\" \\\")\\n\\t\\t\\t; Remove the wall between this cell and the neighbor...\\n\\t\\t\\tS := ChangeChar(S, x+x2, y+y2, \\\" \\\")\\n\\t\\t\\t; Then recurse with the neighbor as the current cell\\n\\t\\t\\tS := Walk(S, x2, y2)\\n\\t\\t}\\n\\t}\\n\\treturn S\\n}\\n\\t\\n; Change a character in a string using x and y coordinates\\nChangeChar(s, x, y, c){\\n\\tLoop Parse, s, `n\\n\\t{\\n\\t\\tIf (A_Index = Y)\\n\\t\\t\\tLoop Parse, A_LoopField\\n\\t\\t\\t\\tIf (A_Index = x)\\n\\t\\t\\t\\t\\tout .= c\\n\\t\\t\\t\\tElse\\tout .= A_LoopField\\n\\t\\tElse out .= A_LoopField\\n\\t\\tout .= \\\"`n\\\"\\n\\t}\\n\\tStringTrimRight, out, out, 1\\n\\treturn out\\n}\\n\\n; retrieve a character in a string using x and y coordinates\\nGetChar(s, x, y, n=1){\\n\\tx*=n, y*=n\\n\\tLoop Parse, s, `n\\n\\t\\tIf (A_Index = Y)\\n\\t\\t\\treturn SubStr(A_LoopField, x, 1)\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#!/usr/bin/awk -f\\n\\n# Remember: AWK is 1-based, for better or worse.\\n\\nBEGIN {\\n # The maze dimensions.\\n width = 20; # Global\\n height = 20; # Global\\n resetMaze();\\n\\n # Some constants.\\n top = 1;\\n bottom = 2;\\n left = 3;\\n right = 4;\\n\\n # Randomize the PRNG.\\n randomize();\\n\\n # Visit all the cells starting at a random point.\\n visitCell(getRandX(), getRandY());\\n\\n # Show the result.\\n printMaze();\\n}\\n\\n# Wander through the maze removing walls as we go.\\nfunction visitCell(x, y, dirList, dir, nx, ny, ndir, pi) {\\n setVisited(x, y); # This cell has been visited.\\n\\n # Visit neighbors in a random order.\\n dirList = getRandDirList();\\n for (dir = 1; dir <= 4; dir++) {\\n # Get coordinates of a random neighbor (next in random direction list).\\n ndir = substr(dirList, dir, 1);\\n nx = getNextX(x, ndir);\\n ny = getNextY(y, ndir);\\n\\n # Visit an unvisited neighbor, removing the separating walls.\\n if (wasVisited(nx, ny) == 0) {\\n rmWall(x, y, ndir);\\n rmWall(nx, ny, getOppositeDir(ndir));\\n visitCell(nx, ny)\\n }\\n }\\n}\\n\\n# Display the text-mode maze.\\nfunction printMaze( x, y, r, w) {\\n for (y = 1; y <= height; y++) {\\n for (pass = 1; pass <= 2; pass++) { # Go over each row twice: top, middle\\n for (x = 1; x <= width; x++) {\\n if (pass == 1) { # top\\n printf(\\\"+\\\");\\n printf(hasWall(x, y, top) == 1 ? \\\"---\\\" : \\\" \\\");\\n if (x == width) printf(\\\"+\\\");\\n }\\n else if (pass == 2) { # left, right\\n printf(hasWall(x, y, left) == 1 ? \\\"|\\\" : \\\" \\\");\\n printf(\\\" \\\");\\n if (x == width) printf(hasWall(x, y, right) == 1 ? \\\"|\\\" : \\\" \\\");\\n }\\n }\\n print;\\n }\\n }\\n for (x = 1; x <= width; x++) printf(\\\"+---\\\"); # bottom row\\n print(\\\"+\\\"); # bottom right corner\\n}\\n\\n# Given a direction, get its opposite.\\nfunction getOppositeDir(d) {\\n if (d == top) return bottom;\\n if (d == bottom) return top;\\n if (d == left) return right;\\n if (d == right) return left;\\n}\\n\\n# Build a list (string) of the four directions in random order.\\nfunction getRandDirList( dirList, randDir, nx, ny, idx) {\\n dirList = \\\"\\\";\\n while (length(dirList) < 4) {\\n randDir = getRandDir();\\n if (!index(dirList, randDir)) {\\n dirList = dirList randDir;\\n }\\n }\\n return dirList;\\n}\\n\\n# Get x coordinate of the neighbor in a given a direction.\\nfunction getNextX(x, dir) {\\n if (dir == left) x = x - 1;\\n if (dir == right) x = x + 1;\\n if (!isGoodXY(x, 1)) return -1; # Off the edge.\\n return x;\\n}\\n\\n# Get y coordinate of the neighbor in a given a direction.\\nfunction getNextY(y, dir) {\\n if (dir == top) y = y - 1;\\n if (dir == bottom) y = y + 1;\\n if (!isGoodXY(1, y)) return -1; # Off the edge.\\n return y;\\n}\\n\\n# Mark a cell as visited.\\nfunction setVisited(x, y, cell) {\\n cell = getCell(x, y);\\n if (cell == -1) return;\\n cell = substr(cell, 1, 4) \\\"1\\\"; # walls plus visited\\n setCell(x, y, cell);\\n}\\n\\n# Get the visited state of a cell.\\nfunction wasVisited(x, y, cell) {\\n cell = getCell(x, y);\\n if (cell == -1) return 1; # Off edges already visited.\\n return substr(getCell(x,y), 5, 1);\\n}\\n\\n# Remove a cell's wall in a given direction.\\nfunction rmWall(x, y, d, i, oldCell, newCell) {\\n oldCell = getCell(x, y);\\n if (oldCell == -1) return;\\n newCell = \\\"\\\";\\n for (i = 1; i <= 4; i++) { # Ugly as concat of two substrings and a constant?.\\n newCell = newCell (i == d ? \\\"0\\\" : substr(oldCell, i, 1));\\n }\\n newCell = newCell wasVisited(x, y);\\n setCell(x, y, newCell);\\n}\\n\\n# Determine if a cell has a wall in a given direction.\\nfunction hasWall(x, y, d, cell) {\\n cell = getCell(x, y);\\n if (cell == -1) return 1; # Cells off edge always have all walls.\\n return substr(getCell(x, y), d, 1);\\n}\\n\\n# Plunk a cell into the maze.\\nfunction setCell(x, y, cell, idx) {\\n if (!isGoodXY(x, y)) return;\\n maze[x, y] = cell\\n}\\n\\n# Get a cell from the maze.\\nfunction getCell(x, y, idx) {\\n if (!isGoodXY(x, y)) return -1; # Bad cell marker.\\n return maze[x, y];\\n}\\n\\n# Are the given coordinates in the maze?\\nfunction isGoodXY(x, y) {\\n if (x < 1 || x > width) return 0;\\n if (y < 1 || y > height) return 0;\\n return 1;\\n}\\n\\n# Build the empty maze.\\nfunction resetMaze( x, y) {\\n delete maze;\\n for (y = 1; y <= height; y++) {\\n for (x = 1; x <= width; x++) {\\n maze[x, y] = \\\"11110\\\"; # walls (up, down, left, right) and visited state.\\n }\\n }\\n}\\n\\n# Random things properly scaled.\\n\\nfunction getRandX() {\\n return 1 + int(rand() * width);\\n}\\n\\nfunction getRandY() {\\n return 1 +int(rand() * height);\\n}\\n\\nfunction getRandDir() {\\n return 1 + int(rand() * 4);\\n}\\n\\nfunction randomize() {\\n \\\"echo $RANDOM\\\" | getline t;\\n srand(t);\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"global size_x, size_y\\nsize_x = 25\\nsize_y = 15\\n\\nglobal char_wall, char_room\\nchar_wall = \\\"#\\\"\\nchar_room = \\\" \\\"\\n\\nglobal directions_permutations\\ndirections_permutations = {{0, 1, 2, 3}, {0, 1, 3, 2}, {0, 2, 1, 3}, {0, 2, 3, 1}, {0, 3, 1, 2}, {0, 3, 2, 1}, {1, 0, 2, 3}, {1, 0, 3, 2}, {1, 2, 0, 3}, {1, 2, 3, 0}, {1, 3, 0, 2}, {1, 3, 2, 0}, {2, 0, 1, 3}, {2, 0, 3, 1}, {2, 1, 0, 3}, {2, 1, 3, 0}, {2, 3, 0, 1}, {2, 3, 1, 0}, {3, 0, 1, 2}, {3, 0, 2, 1}, {3, 1, 0, 2}, {3, 1, 2, 0}, {3, 2, 0, 1}, {3, 2, 1, 0}}\\n\\nglobal maze\\ndim maze[size_x * 2 + 1][size_y * 2 + 1]\\nfor i = 0 to size_x * 2\\n for j = 0 to size_y * 2\\n maze[i][j] = char_wall\\n next j\\nnext i\\n\\ncall make_room(int(rand * size_x), int(rand * size_y))\\n\\ncall draw_maze()\\n\\nend\\n\\nsubroutine make_room(room_x, room_y)\\n maze[1 + room_x * 2][1 + room_y * 2] = char_room\\n random_directions_index = rand * 24\\n for i = 0 to 3\\n random_direction = directions_permutations[random_directions_index][i]\\n if ((random_direction / 2) mod 2) < 1 then\\n dx = (random_direction mod 2) * 2 - 1\\n dy = 0\\n else\\n dx = 0\\n dy = (random_direction mod 2) * 2 - 1\\n end if\\n if can_dig(room_x + dx, room_y + dy) then\\n call make_door(room_x, room_y, dx, dy)\\n call make_room(room_x + dx, room_y + dy)\\n end if\\n next i\\nend subroutine\\n\\nfunction can_dig(room_x, room_y)\\n if (room_x < 0) or (room_x >= size_x) or (room_y < 0) or (room_y >= size_y) then\\n can_dig = false\\n else\\n can_dig = (maze[1 + room_x * 2][1 + room_y * 2] = char_wall)\\n end if\\nend function\\n\\nsubroutine make_door(room_x, room_y, dx, dy)\\n maze[1 + room_x * 2 + dx][1 + room_y * 2 + dy] = char_room\\nend subroutine\\n\\nsubroutine draw_maze()\\n for i = 0 to size_y * 2\\n for j = 0 to size_x * 2\\n print maze[j][i];\\n next j\\n print\\n next i\\nend subroutine\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \":amaze Rows Cols [wall char]\\n:: A stack-less, iterative, depth-first maze generator in native WinNT batch.\\n:: Rows and Cols must each be >1 and Rows*Cols cannot exceed 2096.\\n:: Default wall character is #, [wall char] is used if provided.\\n\\n@ECHO OFF\\nSETLOCAL EnableDelayedExpansion\\n\\n:: check for valid input, else GOTO :help\\nIF /I \\\"%~2\\\" EQU \\\"\\\" GOTO :amaze_help\\nFOR /F \\\"tokens=* delims=0123456789\\\" %%A IN (\\\"%~1%~2\\\") DO IF \\\"%%~A\\\" NEQ \\\"\\\" GOTO :amaze_help\\nSET /A \\\"rows=%~1, cols=%~2, mTmp=rows*cols\\\"\\nIF !rows! LSS 2 GOTO :amaze_help\\nIF !cols! LSS 2 GOTO :amaze_help\\nIF !mTmp! GTR 2096 GOTO :amaze_help\\n\\n:: set map characters and use 1st character of %3 for wall, if defined\\nSET \\\"wall=#\\\"\\nSET \\\"hall= \\\"\\nSET \\\"crumb=.\\\"\\nIF \\\"%~3\\\" NEQ \\\"\\\" SET \\\"wall=%~3\\\"\\nSET \\\"wall=!wall:~0,1!\\\"\\n\\n:: assign width, height, cursor position, loop count, and offsets for NSEW\\nSET /A \\\"cnt=0, wide=cols*2-1, high=rows*2-1, size=wide*high, N=wide*-2, S=wide*2, E=2, W=-2\\\"\\n\\n:: different random entrance points\\n:: ...on top\\n:: SET /A \\\"start=(!RANDOM! %% cols)*2\\\"\\n:: ...on bottom\\n:: SET /A \\\"start=size-(!RANDOM! %% cols)*2-1\\\"\\n:: ...on top or bottom\\n:: SET /A ch=cols*2, ch=!RANDOM! %% ch\\n:: IF !ch! GEQ !cols! ( SET /A \\\"start=size-(ch-cols)*2-1\\\"\\n:: ) ELSE SET /A start=ch*2\\n:: random entrance inside maze\\nSET /A \\\"start=(!RANDOM! %% cols*2)+(!RANDOM! %% rows*2)*wide\\\"\\nSET /A \\\"curPos=start, cTmp=curPos+1, loops=cols*rows*2+1\\\"\\n\\n:: fill the maze with 8186 wall characters, clip to size, and open 1st cell\\nSET \\\"mz=!wall!\\\"\\nFOR /L %%A IN (1,1,6) DO SET mz=!mz!!mz!!mz!!mz!\\nSET bdr=!mz:~-%wide%!\\nSET mz=!mz:~3!!mz:~3!\\nSET mz=!mz:~-%size%!\\nSET mz=!mz:~0,%curPos%!!hall!!mz:~%cTmp%!\\n\\n:: iterate #cells*2+1 steps of random depth-first search\\nFOR /L %%@ IN (1,1,%loops%) DO (\\n\\tSET \\\"rand=\\\" & SET \\\"crmPos=\\\"\\n\\tREM set values for NSEW cell and wall positions\\n\\tSET /A \\\"rCnt=rTmp=0, cTmp=curPos+1, np=curPos+N, sp=curPos+S, ep=curPos+E, wp=curPos+W, wChk=curPos/wide*wide, eChk=wChk+wide, nw=curPos-wide, sw=curPos+wide, ew=curPos+1, ww=curPos-1\\\"\\n\\tREM examine adjacent cells, build direction list, and find last crumb position\\n\\tFOR /F \\\"tokens=1-8\\\" %%A IN (\\\"!np! !sp! !ep! !wp! !nw! !sw! !ew! !ww!\\\") DO (\\n\\t\\tIF !np! GEQ 0 IF \\\"!mz:~%%A,1!\\\" EQU \\\"!wall!\\\" ( SET /A rCnt+=1 & SET \\\"rand=n !rand!\\\"\\n\\t\\t) ELSE IF \\\"!mz:~%%E,1!\\\" EQU \\\"!crumb!\\\" SET /A crmPos=np, cw=nw\\n\\t\\tIF !sp! LEQ !size! IF \\\"!mz:~%%B,1!\\\" EQU \\\"!wall!\\\" ( SET /A rCnt+=1 & SET \\\"rand=s !rand!\\\"\\n\\t\\t) ELSE IF \\\"!mz:~%%F,1!\\\" EQU \\\"!crumb!\\\" SET /A crmPos=sp, cw=sw\\n\\t\\tIF !ep! LEQ !eChk! IF \\\"!mz:~%%C,1!\\\" EQU \\\"!wall!\\\" ( SET /A rCnt+=1 & SET \\\"rand=e !rand!\\\"\\n\\t\\t) ELSE IF \\\"!mz:~%%G,1!\\\" EQU \\\"!crumb!\\\" SET /A crmPos=ep, cw=ew\\n\\t\\tIF !wp! GEQ !wChk! IF \\\"!mz:~%%D,1!\\\" EQU \\\"!wall!\\\" ( SET /A rCnt+=1 & SET \\\"rand=w !rand!\\\"\\n\\t\\t) ELSE IF \\\"!mz:~%%H,1!\\\" EQU \\\"!crumb!\\\" SET /A crmPos=wp, cw=ww\\n\\t)\\n\\tIF DEFINED rand ( REM adjacent unvisited cell is available\\n\\t\\tSET /A rCnt=!RANDOM! %% rCnt\\n\\t\\tFOR %%A IN (!rand!) DO ( REM pick random cell + wall\\n\\t\\t\\tIF !rTmp! EQU !rCnt! SET /A \\\"curPos=!%%Ap!, cTmp=curPos+1, mw=!%%Aw!, mTmp=mw+1\\\"\\n\\t\\t\\tSET /A rTmp+=1\\n\\t\\t)\\n\\t\\tREM write the 2 new characters into the maze\\n\\t\\tFOR /F \\\"tokens=1-4\\\" %%A IN (\\\"!mw! !mTmp! !curPos! !cTmp!\\\") DO (\\n\\t\\t\\tSET \\\"mz=!mz:~0,%%A!!crumb!!mz:~%%B!\\\"\\n\\t\\t\\tSET \\\"mz=!mz:~0,%%C!!hall!!mz:~%%D!\\\"\\n\\t\\t)\\n\\t) ELSE IF DEFINED crmPos ( REM follow the crumbs backward\\n\\t\\tSET /A mTmp=cw+1\\n\\t\\tREM erase the crumb character and set new cursor position\\n\\t\\tFOR /F \\\"tokens=1-2\\\" %%A IN (\\\"!cw! !mTmp!\\\") DO SET \\\"mz=!mz:~0,%%A!!hall!!mz:~%%B!\\\"\\n\\t\\tSET \\\"curPos=!crmPos!\\\"\\n\\t)\\n)\\nSET /A open=cols/2*2, mTmp=open+1\\nECHO !wall!!bdr:~0,%open%!!hall!!bdr:~%mTmp%!!wall!\\nFOR /L %%A IN (0,!wide!,!size!) DO IF %%A LSS !size! ECHO !wall!!mz:~%%A,%wide%!!wall!\\nECHO !wall!!bdr:~0,%open%!!hall!!bdr:~%mTmp%!!wall!\\nENDLOCAL\\nEXIT /B 0\\n\\n:amaze_help\\nECHO Usage: %~0 Rows Cols [wall char]\\nECHO Rows^>1, Cols^>1, and Rows*Cols^<=2096\\nECHO Example: %~0 11 39 @\\nENDLOCAL\\nEXIT /B 0\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" MazeWidth% = 11\\n MazeHeight% = 9\\n MazeCell% = 50\\n\\n VDU 23,22,MazeWidth%*MazeCell%/2+3;MazeHeight%*MazeCell%/2+3;8,16,16,128\\n VDU 23,23,3;0;0;0; : REM Line thickness\\n PROCgeneratemaze(Maze&(), MazeWidth%, MazeHeight%, MazeCell%)\\n END\\n\\n DEF PROCgeneratemaze(RETURN m&(), w%, h%, s%)\\n LOCAL x%, y%\\n DIM m&(w%, h%)\\n FOR y% = 0 TO h%\\n LINE 0,y%*s%,w%*s%,y%*s%\\n NEXT\\n FOR x% = 0 TO w%\\n LINE x%*s%,0,x%*s%,h%*s%\\n NEXT\\n GCOL 15\\n PROCcell(m&(), RND(w%)-1, y% = RND(h%)-1, w%, h%, s%)\\n ENDPROC\\n\\n DEF PROCcell(m&(), x%, y%, w%, h%, s%)\\n LOCAL i%, p%, q%, r%\\n m&(x%,y%) OR= &40 : REM Mark visited\\n r% = RND(4)\\n FOR i% = r% TO r%+3\\n CASE i% MOD 4 OF\\n WHEN 0: p% = x%-1 : q% = y%\\n WHEN 1: p% = x%+1 : q% = y%\\n WHEN 2: p% = x% : q% = y%-1\\n WHEN 3: p% = x% : q% = y%+1\\n ENDCASE\\n IF p% >= 0 IF p% < w% IF q% >= 0 IF q% < h% IF m&(p%,q%) < &40 THEN\\n IF p% > x% m&(p%,q%) OR= 1 : LINE p%*s%,y%*s%+4,p%*s%,(y%+1)*s%-4\\n IF q% > y% m&(p%,q%) OR= 2 : LINE x%*s%+4,q%*s%,(x%+1)*s%-4,q%*s%\\n IF x% > p% m&(x%,y%) OR= 1 : LINE x%*s%,y%*s%+4,x%*s%,(y%+1)*s%-4\\n IF y% > q% m&(x%,y%) OR= 2 : LINE x%*s%+4,y%*s%,(x%+1)*s%-4,y%*s%\\n PROCcell(m&(), p%, q%, w%, h%, s%)\\n ENDIF\\n NEXT\\n ENDPROC\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"45*28*10p00p020p030p006p0>20g30g00g*+::\\\"P\\\"%\\\\\\\"P\\\"/6+gv>$\\\\1v@v1::\\\\+g02+*g00+g03-\\\\<\\n0_ 1!%4+1\\\\-\\\\0!::\\\\-\\\\2%2:p<pv0<< v0p+6/\\\"P\\\"\\\\%\\\"P\\\":\\\\+4%4<^<v-<$>+2%\\\\1-*20g+\\\\1+4%::v^\\n#| +2%\\\\1-*30g+\\\\1\\\\40g1-:v0+v2?1#<v>+:00g%!55+*>:#0>#,_^>:!|>\\\\#%\\\"P\\\"v#:*+*g00g0<>1\\n02!:++`\\\\0\\\\`-1g01:\\\\+`\\\\< !46v3<^$$<^1,g2+1%2/2,g1+1<v%g00:\\\\<*g01,<>:30p\\\\:20p:v^3g\\n0#$g#<1#<-#<`#<\\\\#<0#<^#_^/>#1+#4<>\\\"P\\\"%\\\\\\\"P\\\"/6+g:2%^!>,1-:#v_$55+^|$$ \\\"JH\\\" $$>#<0\\n::\\\"P\\\"%\\\\\\\"P\\\"/6+g40p\\\\40g+\\\\:#^\\\"P\\\"%#\\\\<^ ::$_,#!0#:<*\\\"|\\\"<^,\\\" _\\\"<:g000 <> /6+g4/2%+#^_\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <locale.h>\\n\\n#define DOUBLE_SPACE 1\\n\\n#if DOUBLE_SPACE\\n#\\tdefine SPC \\\" \\\"\\n#else\\n#\\tdefine SPC \\\" \\\"\\n#endif\\n\\nwchar_t glyph[] = L\\\"\\\"SPC\\\"│││─┘┐┤─└┌├─┴┬┼\\\"SPC\\\"┆┆┆┄╯╮ ┄╰╭ ┄\\\";\\n\\ntypedef unsigned char byte;\\nenum { N = 1, S = 2, W = 4, E = 8, V = 16 };\\n\\nbyte **cell;\\nint w, h, avail;\\n#define each(i, x, y) for (i = x; i <= y; i++)\\n\\nint irand(int n)\\n{\\n\\tint r, rmax = n * (RAND_MAX / n);\\n\\twhile ((r = rand()) >= rmax);\\n\\treturn r / (RAND_MAX/n);\\n}\\n\\nvoid show()\\n{\\n\\tint i, j, c;\\n\\teach(i, 0, 2 * h) {\\n\\t\\teach(j, 0, 2 * w) {\\n\\t\\t\\tc = cell[i][j];\\n\\t\\t\\tif (c > V) printf(\\\"\\\\033[31m\\\");\\n\\t\\t\\tprintf(\\\"%lc\\\", glyph[c]);\\n\\t\\t\\tif (c > V) printf(\\\"\\\\033[m\\\");\\n\\t\\t}\\n\\t\\tputchar('\\\\n');\\n\\t}\\n}\\n\\ninline int max(int a, int b) { return a >= b ? a : b; }\\ninline int min(int a, int b) { return b >= a ? a : b; }\\n\\nstatic int dirs[4][2] = {{-2, 0}, {0, 2}, {2, 0}, {0, -2}};\\nvoid walk(int x, int y)\\n{\\n\\tint i, t, x1, y1, d[4] = { 0, 1, 2, 3 };\\n\\n\\tcell[y][x] |= V;\\n\\tavail--;\\n\\n\\tfor (x1 = 3; x1; x1--)\\n\\t\\tif (x1 != (y1 = irand(x1 + 1)))\\n\\t\\t\\ti = d[x1], d[x1] = d[y1], d[y1] = i;\\n\\n\\tfor (i = 0; avail && i < 4; i++) {\\n\\t\\tx1 = x + dirs[ d[i] ][0], y1 = y + dirs[ d[i] ][1];\\n\\n\\t\\tif (cell[y1][x1] & V) continue;\\n\\n\\t\\t/* break walls */\\n\\t\\tif (x1 == x) {\\n\\t\\t\\tt = (y + y1) / 2;\\n\\t\\t\\tcell[t][x+1] &= ~W, cell[t][x] &= ~(E|W), cell[t][x-1] &= ~E;\\n\\t\\t} else if (y1 == y) {\\n\\t\\t\\tt = (x + x1)/2;\\n\\t\\t\\tcell[y-1][t] &= ~S, cell[y][t] &= ~(N|S), cell[y+1][t] &= ~N;\\n\\t\\t}\\n\\t\\twalk(x1, y1);\\n\\t}\\n}\\n\\nint solve(int x, int y, int tox, int toy)\\n{\\n\\tint i, t, x1, y1;\\n\\n\\tcell[y][x] |= V;\\n\\tif (x == tox && y == toy) return 1;\\n\\n\\teach(i, 0, 3) {\\n\\t\\tx1 = x + dirs[i][0], y1 = y + dirs[i][1];\\n\\t\\tif (cell[y1][x1]) continue;\\n\\n\\t\\t/* mark path */\\n\\t\\tif (x1 == x) {\\n\\t\\t\\tt = (y + y1)/2;\\n\\t\\t\\tif (cell[t][x] || !solve(x1, y1, tox, toy)) continue;\\n\\n\\t\\t\\tcell[t-1][x] |= S, cell[t][x] |= V|N|S, cell[t+1][x] |= N;\\n\\t\\t} else if (y1 == y) {\\n\\t\\t\\tt = (x + x1)/2;\\n\\t\\t\\tif (cell[y][t] || !solve(x1, y1, tox, toy)) continue;\\n\\n\\t\\t\\tcell[y][t-1] |= E, cell[y][t] |= V|E|W, cell[y][t+1] |= W;\\n\\t\\t}\\n\\t\\treturn 1;\\n\\t}\\n\\n\\t/* backtrack */\\n\\tcell[y][x] &= ~V;\\n\\treturn 0;\\n}\\n\\nvoid make_maze()\\n{\\n\\tint i, j;\\n\\tint h2 = 2 * h + 2, w2 = 2 * w + 2;\\n\\tbyte **p;\\n\\n\\tp = calloc(sizeof(byte*) * (h2 + 2) + w2 * h2 + 1, 1);\\n\\n\\tp[1] = (byte*)(p + h2 + 2) + 1;\\n\\teach(i, 2, h2) p[i] = p[i-1] + w2;\\n\\tp[0] = p[h2];\\n\\tcell = &p[1];\\n\\n\\teach(i, -1, 2 * h + 1) cell[i][-1] = cell[i][w2 - 1] = V;\\n\\teach(j, 0, 2 * w) cell[-1][j] = cell[h2 - 1][j] = V;\\n\\teach(i, 0, h) each(j, 0, 2 * w) cell[2*i][j] |= E|W;\\n\\teach(i, 0, 2 * h) each(j, 0, w) cell[i][2*j] |= N|S;\\n\\teach(j, 0, 2 * w) cell[0][j] &= ~N, cell[2*h][j] &= ~S;\\n\\teach(i, 0, 2 * h) cell[i][0] &= ~W, cell[i][2*w] &= ~E;\\n\\n\\tavail = w * h;\\n\\twalk(irand(2) * 2 + 1, irand(h) * 2 + 1);\\n\\n\\t/* reset visited marker (it's also used by path finder) */\\n\\teach(i, 0, 2 * h) each(j, 0, 2 * w) cell[i][j] &= ~V;\\n\\tsolve(1, 1, 2 * w - 1, 2 * h - 1);\\n\\n\\tshow();\\n}\\n\\nint main(int c, char **v)\\n{\\n\\tsetlocale(LC_ALL, \\\"\\\");\\n\\tif (c < 2 || (w = atoi(v[1])) <= 0) w = 16;\\n\\tif (c < 3 || (h = atoi(v[2])) <= 0) h = 8;\\n\\n\\tmake_maze();\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <windows.h>\\n#include <iostream>\\n#include <string>\\n\\n//--------------------------------------------------------------------------------------------------\\nusing namespace std;\\n\\n//--------------------------------------------------------------------------------------------------\\nconst int BMP_SIZE = 512, CELL_SIZE = 8;\\n\\n//--------------------------------------------------------------------------------------------------\\nenum directions { NONE, NOR = 1, EAS = 2, SOU = 4, WES = 8 };\\n\\n//--------------------------------------------------------------------------------------------------\\nclass myBitmap\\n{\\npublic:\\n myBitmap() : pen( NULL ) {}\\n ~myBitmap()\\n {\\n\\tDeleteObject( pen );\\n\\tDeleteDC( hdc );\\n\\tDeleteObject( bmp );\\n }\\n\\n bool create( int w, int h )\\n {\\n\\tBITMAPINFO\\tbi;\\n\\tZeroMemory( &bi, sizeof( bi ) );\\n\\tbi.bmiHeader.biSize\\t = sizeof( bi.bmiHeader );\\n\\tbi.bmiHeader.biBitCount\\t = sizeof( DWORD ) * 8;\\n\\tbi.bmiHeader.biCompression = BI_RGB;\\n\\tbi.bmiHeader.biPlanes\\t = 1;\\n\\tbi.bmiHeader.biWidth\\t = w;\\n\\tbi.bmiHeader.biHeight\\t = -h;\\n\\n\\tHDC dc = GetDC( GetConsoleWindow() );\\n\\tbmp = CreateDIBSection( dc, &bi, DIB_RGB_COLORS, &pBits, NULL, 0 );\\n\\tif( !bmp ) return false;\\n\\n\\thdc = CreateCompatibleDC( dc );\\n\\tSelectObject( hdc, bmp );\\n\\tReleaseDC( GetConsoleWindow(), dc );\\n\\twidth = w; height = h;\\n\\n\\treturn true;\\n }\\n\\n void clear()\\n {\\n\\tZeroMemory( pBits, width * height * sizeof( DWORD ) );\\n }\\n\\n void setPenColor( DWORD clr )\\n {\\n\\tif( pen ) DeleteObject( pen );\\n\\tpen = CreatePen( PS_SOLID, 1, clr );\\n\\tSelectObject( hdc, pen );\\n }\\n\\n void saveBitmap( string path )\\n {\\n\\tBITMAPFILEHEADER fileheader;\\n\\tBITMAPINFO\\t infoheader;\\n\\tBITMAP\\t\\t bitmap;\\n\\tDWORD\\t\\t wb;\\n\\n\\tGetObject( bmp, sizeof( bitmap ), &bitmap );\\n\\n\\tDWORD* dwpBits = new DWORD[bitmap.bmWidth * bitmap.bmHeight];\\n\\tZeroMemory( dwpBits, bitmap.bmWidth * bitmap.bmHeight * sizeof( DWORD ) );\\n\\tZeroMemory( &infoheader, sizeof( BITMAPINFO ) );\\n\\tZeroMemory( &fileheader, sizeof( BITMAPFILEHEADER ) );\\n\\n\\tinfoheader.bmiHeader.biBitCount = sizeof( DWORD ) * 8;\\n\\tinfoheader.bmiHeader.biCompression = BI_RGB;\\n\\tinfoheader.bmiHeader.biPlanes = 1;\\n\\tinfoheader.bmiHeader.biSize = sizeof( infoheader.bmiHeader );\\n\\tinfoheader.bmiHeader.biHeight = bitmap.bmHeight;\\n\\tinfoheader.bmiHeader.biWidth = bitmap.bmWidth;\\n\\tinfoheader.bmiHeader.biSizeImage = bitmap.bmWidth * bitmap.bmHeight * sizeof( DWORD );\\n\\n\\tfileheader.bfType = 0x4D42;\\n\\tfileheader.bfOffBits = sizeof( infoheader.bmiHeader ) + sizeof( BITMAPFILEHEADER );\\n\\tfileheader.bfSize = fileheader.bfOffBits + infoheader.bmiHeader.biSizeImage;\\n\\n\\tGetDIBits( hdc, bmp, 0, height, ( LPVOID )dwpBits, &infoheader, DIB_RGB_COLORS );\\n\\n\\tHANDLE file = CreateFile( path.c_str(), GENERIC_WRITE, 0, NULL, CREATE_ALWAYS, FILE_ATTRIBUTE_NORMAL, NULL );\\n\\tWriteFile( file, &fileheader, sizeof( BITMAPFILEHEADER ), &wb, NULL );\\n\\tWriteFile( file, &infoheader.bmiHeader, sizeof( infoheader.bmiHeader ), &wb, NULL );\\n\\tWriteFile( file, dwpBits, bitmap.bmWidth * bitmap.bmHeight * 4, &wb, NULL );\\n\\tCloseHandle( file );\\n\\n\\tdelete [] dwpBits;\\n }\\n\\n HDC getDC() const { return hdc; }\\n int getWidth() const { return width; }\\n int getHeight() const { return height; }\\n\\nprivate:\\n HBITMAP bmp;\\n HDC\\t hdc;\\n HPEN pen;\\n void *pBits;\\n int\\t width, height;\\n};\\n//--------------------------------------------------------------------------------------------------\\nclass mazeGenerator\\n{\\npublic:\\n mazeGenerator()\\n {\\n\\t_world = 0;\\n\\t_bmp.create( BMP_SIZE, BMP_SIZE );\\n\\t_bmp.setPenColor( RGB( 0, 255, 0 ) );\\n }\\n\\n ~mazeGenerator() { killArray(); }\\n\\n void create( int side )\\n {\\n\\t_s = side;\\n\\tgenerate();\\n\\tdisplay();\\n }\\n\\nprivate:\\n void generate()\\n {\\n\\tkillArray();\\n\\t_world = new BYTE[_s * _s];\\n\\tZeroMemory( _world, _s * _s );\\n\\t_ptX = rand() % _s; _ptY = rand() % _s;\\n\\tcarve();\\n }\\n\\n void carve()\\n {\\n\\twhile( true )\\n\\t{\\n\\t int d = getDirection();\\n\\t if( d < NOR ) return;\\n\\n\\t switch( d )\\n\\t {\\n\\t case NOR:\\n\\t _world[_ptX + _s * _ptY] |= NOR; _ptY--;\\n\\t\\t _world[_ptX + _s * _ptY] = SOU | SOU << 4;\\n\\t\\tbreak;\\n\\t case EAS:\\n\\t\\t _world[_ptX + _s * _ptY] |= EAS; _ptX++;\\n\\t\\t _world[_ptX + _s * _ptY] = WES | WES << 4;\\n\\t\\tbreak;\\n\\t\\tcase SOU:\\n\\t\\t _world[_ptX + _s * _ptY] |= SOU; _ptY++;\\n\\t\\t _world[_ptX + _s * _ptY] = NOR | NOR << 4;\\n\\t\\tbreak;\\n\\t\\tcase WES:\\n\\t\\t _world[_ptX + _s * _ptY] |= WES; _ptX--;\\n\\t\\t _world[_ptX + _s * _ptY] = EAS | EAS << 4;\\n\\t }\\n\\t}\\n }\\n\\n void display()\\n {\\n\\t_bmp.clear();\\n\\tHDC dc = _bmp.getDC();\\n\\tfor( int y = 0; y < _s; y++ )\\n\\t{\\n\\t int yy = y * _s;\\n\\t for( int x = 0; x < _s; x++ )\\n\\t {\\n\\t\\tBYTE b = _world[x + yy];\\n\\t\\tint nx = x * CELL_SIZE,\\n\\t\\t ny = y * CELL_SIZE;\\n\\t\\t\\t\\t\\n\\t\\tif( !( b & NOR ) )\\n\\t\\t{\\n\\t\\t MoveToEx( dc, nx, ny, NULL );\\n\\t\\t LineTo( dc, nx + CELL_SIZE + 1, ny );\\n\\t\\t}\\n\\t\\tif( !( b & EAS ) )\\n\\t\\t{\\n\\t\\t MoveToEx( dc, nx + CELL_SIZE, ny, NULL );\\n\\t\\t LineTo( dc, nx + CELL_SIZE, ny + CELL_SIZE + 1 );\\n\\t\\t}\\n\\t\\tif( !( b & SOU ) )\\n\\t\\t{\\n\\t\\t MoveToEx( dc, nx, ny + CELL_SIZE, NULL );\\n\\t\\t LineTo( dc, nx + CELL_SIZE + 1, ny + CELL_SIZE );\\n\\t\\t}\\n\\t\\tif( !( b & WES ) )\\n\\t\\t{\\n\\t\\t MoveToEx( dc, nx, ny, NULL );\\n\\t\\t LineTo( dc, nx, ny + CELL_SIZE + 1 );\\n\\t\\t}\\n\\t }\\n\\t}\\n\\n\\t//_bmp.saveBitmap( \\\"f:\\\\\\\\rc\\\\\\\\maze.bmp\\\" );\\n\\tBitBlt( GetDC( GetConsoleWindow() ), 10, 60, BMP_SIZE, BMP_SIZE, _bmp.getDC(), 0, 0, SRCCOPY );\\n }\\n\\n int getDirection()\\n {\\n\\tint d = 1 << rand() % 4;\\n\\twhile( true )\\n\\t{\\n\\t for( int x = 0; x < 4; x++ )\\n\\t {\\n\\t\\tif( testDir( d ) ) return d;\\n\\t\\td <<= 1;\\n\\t\\tif( d > 8 ) d = 1;\\n\\t }\\n\\t d = ( _world[_ptX + _s * _ptY] & 0xf0 ) >> 4;\\n\\t if( !d ) return -1;\\n\\t switch( d )\\n\\t {\\n\\t\\tcase NOR: _ptY--; break;\\n\\t\\tcase EAS: _ptX++; break;\\n\\t\\tcase SOU: _ptY++; break;\\n\\t\\tcase WES: _ptX--; break;\\n\\t }\\n d = 1 << rand() % 4;\\n\\t}\\n }\\n\\n bool testDir( int d )\\n {\\n\\tswitch( d )\\n\\t{\\n\\t case NOR: return ( _ptY - 1 > -1 && !_world[_ptX + _s * ( _ptY - 1 )] );\\n\\t case EAS: return ( _ptX + 1 < _s && !_world[_ptX + 1 + _s * _ptY] );\\n\\t case SOU: return ( _ptY + 1 < _s && !_world[_ptX + _s * ( _ptY + 1 )] );\\n\\t case WES: return ( _ptX - 1 > -1 && !_world[_ptX - 1 + _s * _ptY] );\\n\\t}\\n\\treturn false;\\n }\\n\\n void killArray() { if( _world ) delete [] _world; }\\n\\n BYTE* _world;\\n int _s, _ptX, _ptY;\\n myBitmap _bmp;\\n};\\n//--------------------------------------------------------------------------------------------------\\nint main( int argc, char* argv[] )\\n{\\n ShowWindow( GetConsoleWindow(), SW_MAXIMIZE );\\n srand( GetTickCount() );\\n\\n mazeGenerator mg;\\n int s;\\n while( true )\\n {\\n\\tcout << \\\"Enter the maze size, an odd number bigger than 2 ( 0 to QUIT ): \\\"; cin >> s;\\n\\tif( !s ) return 0;\\n\\tif( !( s & 1 ) ) s++;\\n\\tif( s >= 3 ) mg.create( s );\\n\\tcout << endl;\\n\\tsystem( \\\"pause\\\" );\\n\\tsystem( \\\"cls\\\" );\\n }\\n return 0;\\n}\\n//--------------------------------------------------------------------------------------------------\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Diagnostics;\\nusing System.Linq;\\nusing System.Text;\\nusing System.Drawing;\\n\\nnamespace MazeGeneration\\n{\\n public static class Extensions\\n {\\n public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> source, Random rng)\\n {\\n var e = source.ToArray();\\n for (var i = e.Length - 1; i >= 0; i--)\\n {\\n var swapIndex = rng.Next(i + 1);\\n yield return e[swapIndex];\\n e[swapIndex] = e[i];\\n }\\n }\\n\\n public static CellState OppositeWall(this CellState orig)\\n {\\n return (CellState)(((int) orig >> 2) | ((int) orig << 2)) & CellState.Initial;\\n }\\n\\n public static bool HasFlag(this CellState cs,CellState flag)\\n {\\n return ((int)cs & (int)flag) != 0;\\n }\\n }\\n\\n [Flags]\\n public enum CellState\\n {\\n Top = 1,\\n Right = 2,\\n Bottom = 4,\\n Left = 8,\\n Visited = 128,\\n Initial = Top | Right | Bottom | Left,\\n }\\n\\n public struct RemoveWallAction\\n {\\n public Point Neighbour;\\n public CellState Wall;\\n }\\n\\n public class Maze\\n {\\n private readonly CellState[,] _cells;\\n private readonly int _width;\\n private readonly int _height;\\n private readonly Random _rng;\\n\\n public Maze(int width, int height)\\n {\\n _width = width;\\n _height = height;\\n _cells = new CellState[width, height];\\n for(var x=0; x<width; x++)\\n for(var y=0; y<height; y++)\\n _cells[x, y] = CellState.Initial;\\n _rng = new Random();\\n VisitCell(_rng.Next(width), _rng.Next(height));\\n }\\n\\n public CellState this[int x, int y]\\n {\\n get { return _cells[x,y]; }\\n set { _cells[x,y] = value; }\\n }\\n\\n public IEnumerable<RemoveWallAction> GetNeighbours(Point p)\\n {\\n if (p.X > 0) yield return new RemoveWallAction {Neighbour = new Point(p.X - 1, p.Y), Wall = CellState.Left};\\n if (p.Y > 0) yield return new RemoveWallAction {Neighbour = new Point(p.X, p.Y - 1), Wall = CellState.Top};\\n if (p.X < _width-1) yield return new RemoveWallAction {Neighbour = new Point(p.X + 1, p.Y), Wall = CellState.Right};\\n if (p.Y < _height-1) yield return new RemoveWallAction {Neighbour = new Point(p.X, p.Y + 1), Wall = CellState.Bottom};\\n }\\n\\n public void VisitCell(int x, int y)\\n {\\n this[x,y] |= CellState.Visited;\\n foreach (var p in GetNeighbours(new Point(x, y)).Shuffle(_rng).Where(z => !(this[z.Neighbour.X, z.Neighbour.Y].HasFlag(CellState.Visited))))\\n {\\n this[x, y] -= p.Wall;\\n this[p.Neighbour.X, p.Neighbour.Y] -= p.Wall.OppositeWall();\\n VisitCell(p.Neighbour.X, p.Neighbour.Y);\\n }\\n }\\n\\n public void Display()\\n {\\n var firstLine = string.Empty;\\n for (var y = 0; y < _height; y++)\\n {\\n var sbTop = new StringBuilder();\\n var sbMid = new StringBuilder();\\n for (var x = 0; x < _width; x++)\\n {\\n sbTop.Append(this[x, y].HasFlag(CellState.Top) ? \\\"+---\\\" : \\\"+ \\\");\\n sbMid.Append(this[x, y].HasFlag(CellState.Left) ? \\\"| \\\" : \\\" \\\");\\n }\\n if (firstLine == string.Empty)\\n firstLine = \\\" \\\" + sbTop.ToString();\\n Debug.WriteLine(\\\" \\\" + sbTop + \\\"+\\\");\\n Debug.WriteLine(\\\" \\\" + sbMid + \\\"|\\\");\\n }\\n Debug.WriteLine(firstLine);\\n }\\n }\\n\\n class Program\\n {\\n static void Main(string[] args)\\n {\\n var maze = new Maze(20, 20);\\n maze.Display();\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(ns maze.core\\n (:require [clojure.set :refer [intersection\\n select]]\\n [clojure.string :as str]))\\n\\n;; Misc functions\\n(defn neighborhood\\n ([] (neighborhood [0 0]))\\n ([coord] (neighborhood coord 1))\\n ([[y x] r]\\n (let [y-- (- y r) y++ (+ y r)\\n x-- (- x r) x++ (+ x r)]\\n #{[y++ x] [y-- x] [y x--] [y x++]})))\\n\\n(defn cell-empty? [maze coords]\\n (= :empty (get-in maze coords)))\\n\\n(defn wall? [maze coords]\\n (= :wall (get-in maze coords)))\\n\\n(defn filter-maze\\n ([pred maze coords]\\n (select (partial pred maze) (set coords)))\\n ([pred maze]\\n (filter-maze\\n pred\\n maze\\n (for [y (range (count maze))\\n x (range (count (nth maze y)))]\\n [y x]))))\\n\\n(defn create-empty-maze [width height]\\n (let [width (inc (* 2 width))\\n height (inc (* 2 height))]\\n (vec (take height\\n (interleave\\n (repeat (vec (take width (repeat :wall))))\\n (repeat (vec (take width (cycle [:wall :empty])))))))))\\n\\n(defn next-step [possible-steps]\\n (rand-nth (vec possible-steps)))\\n\\n;;Algo\\n(defn create-random-maze [width height]\\n (loop [maze (create-empty-maze width height)\\n stack []\\n nonvisited (filter-maze cell-empty? maze)\\n visited #{}\\n coords (next-step nonvisited)]\\n (if (empty? nonvisited)\\n maze\\n (let [nonvisited-neighbors (intersection (neighborhood coords 2) nonvisited)]\\n (cond\\n (seq nonvisited-neighbors)\\n (let [next-coords (next-step nonvisited-neighbors)\\n wall-coords (map #(+ %1 (/ (- %2 %1) 2)) coords next-coords)]\\n (recur (assoc-in maze wall-coords :empty)\\n (conj stack coords)\\n (disj nonvisited next-coords)\\n (conj visited next-coords)\\n next-coords))\\n\\n (seq stack)\\n (recur maze (pop stack) nonvisited visited (last stack)))))))\\n\\n;;Conversion to string\\n(def cell-code->str\\n [\\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\"· \\\" \\\"╵ \\\" \\\"╴ \\\" \\\"┘ \\\"\\n \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\"╶─\\\" \\\"└─\\\" \\\"──\\\" \\\"┴─\\\"\\n \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\"╷ \\\" \\\"│ \\\" \\\"┐ \\\" \\\"┤ \\\"\\n \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\"┌─\\\" \\\"├─\\\" \\\"┬─\\\" \\\"┼─\\\"])\\n\\n(defn cell-code [maze coord]\\n (transduce\\n (comp\\n (map (partial wall? maze))\\n (keep-indexed (fn [idx el] (when el idx)))\\n (map (partial bit-shift-left 1)))\\n (completing bit-or)\\n 0\\n (sort (cons coord (neighborhood coord)))))\\n\\n(defn cell->str [maze coord]\\n (get cell-code->str (cell-code maze coord)))\\n\\n(defn maze->str [maze]\\n (->> (for [y (range (count maze))]\\n (for [x (range (count (nth maze y)))]\\n (cell->str maze [y x])))\\n (map str/join)\\n (str/join \\\\newline)))\\n\\n;;Task\\n(println (maze->str (create-random-maze 10 10)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"100 MS=10:REM MAZE SIZE\\n110 DIM S(MS+1,MS+1):REM SOUTH WALLS\\n120 DIM W(MS+1,MS+1):REM WEST WALLS\\n130 DIM V(MS+1,MS+1):REM VISITED CELLS\\n140 PRINT \\\"INITIALIZING...\\\"\\n150 GOSUB 260:REM INITIALIZE MAZE\\n160 PRINT \\\"BUILDING...\\\"\\n170 DIM PC(MS*MS+1):DIM PR(MS*MS+1):REM STACK\\n180 REM PICK RANDOM STARTING CELL\\n190 X = RND(-TI)\\n200 C=(INT(RND(1)*MS)+1)\\n210 R=(INT(RND(1)*MS)+1)\\n220 GOSUB 400:REM BUILD MAZE\\n230 GOSUB 540:REM DRAW MAZE\\n240 END\\n250 REM -----INITIALIZE MAZE-----\\n260 REM SET WALLS ON AND VISITED CELLS OFF\\n270 T=MS+1\\n280 FOR C=0 TO T:FOR R=0 TO T:\\n290 S(C,R)=1:W(C,R)=1:V(C,R)=0\\n300 NEXT R:NEXT C\\n310 REM SET BORDER CELLS TO VISITED\\n320 FOR C=0 TO T\\n330 V(C,0)=1:V(C,T)=1\\n340 NEXT C\\n350 FOR R=0 TO T\\n360 V(0,R)=1:V(T,R)=1\\n370 NEXT R\\n380 RETURN\\n390 REM -----BUILD MAZE-----\\n400 U=U+1:PC(U)=C:PR(U)=R:REM PUSH\\n410 V(C,R)=1\\n420 IF V(C,R+1)=1 AND V(C+1,R)=1 AND V(C,R-1)=1 AND V(C-1,R)=1 THEN GOTO 500\\n430 Z=INT(RND(1)*4)\\n440 IF Z=0 AND V(C,R+1)=0 THEN S(C,R)=0:R=R+1:GOTO 400\\n450 IF Z=1 AND V(C+1,R)=0 THEN W(C+1,R)=0:C=C+1:GOTO 400\\n460 IF Z=2 AND V(C,R-1)=0 THEN S(C,R-1)=0:R=R-1:GOTO 400\\n470 IF Z=3 AND V(C-1,R)=0 THEN W(C,R)=0:C=C-1:GOTO 400\\n480 GOTO 430\\n500 C=PC(U):R=PR(U):U=U-1:REM POP\\n510 IF U > 0 THEN GOTO 420\\n520 RETURN\\n530 REM -----DRAW MAZE-----\\n540 REM OPEN 4,4:CMD 4:REM SEND OUTPUT TO PRINTER\\n550 PRINT \\\"+--+--+--+--+--+--+--+--+--+--+\\\"\\n560 FOR R = 1 TO MS\\n570 FOR C = 1 TO MS+1\\n580 IF W(C,R)=0 THEN PRINT \\\" \\\";\\n590 IF W(C,R)=1 THEN PRINT \\\": \\\";\\n600 NEXT C\\n610 PRINT\\n620 FOR C = 1 TO MS\\n630 IF S(C,R)=0 THEN PRINT \\\"+ \\\";\\n640 IF S(C,R)=1 THEN PRINT \\\"+--\\\";\\n650 NEXT C\\n660 PRINT \\\"+\\\"\\n670 NEXT R\\n680 REM PRINT#4:CLOSE 4:REM CLOSE PRINTER DEVICE\\n690 RETURN\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"(defun shuffle (list) ;; Z not uniform\\n (sort list '> :key (lambda(x) (random 1.0))))\\n\\n(defun neighbors (x y maze)\\n (remove-if-not\\n (lambda (x-y) (and (< -1 (first x-y) (array-dimension maze 0))\\n (< -1 (second x-y) (array-dimension maze 1))))\\n `((,x ,(+ y 2)) (,(- x 2) ,y) (,x ,(- y 2)) (,(+ x 2) ,y))))\\n\\n(defun remove-wall (maze x y &optional visited)\\n (labels ((walk (maze x y)\\n (push (list x y) visited)\\n (loop for (u v) in (shuffle (neighbors x y maze))\\n unless (member (list u v) visited :test 'equal)\\n do (setf (aref maze u v) #\\\\space\\n (aref maze (/ (+ x u) 2) (/ (+ y v) 2)) #\\\\space)\\n (walk maze u v))))\\n (setf (aref maze x y) #\\\\space)\\n (walk maze x y)))\\n\\n(defun draw-maze (width height &key (block #\\\\BOX_DRAWINGS_LIGHT_DIAGONAL_CROSS))\\n (let ((maze (make-array (list (1+ (* 2 height)) (1+ (* 2 width)))\\n :element-type 'character :initial-element block)))\\n (remove-wall maze (1+ (* 2 (random height))) (1+ (* 2 (random width))))\\n (loop for i below (array-dimension maze 0)\\n do (fresh-line)\\n (loop for j below (array-dimension maze 1)\\n do (princ (aref maze i j))))))\\n\\n(draw-maze 20 6)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(setf *random-state* (make-random-state t))\\n\\n(defun 2d-array (w h)\\n (make-array (list h w) :initial-element 0))\\n\\n(defmacro or-and (v a b c)\\n `(if (or ,a (and ,b (= 1 ,c))) 0 ,v))\\n\\n(defun make-maze (w h)\\n (let ((vis (2d-array w h))\\n\\t(ver (2d-array w h))\\n\\t(hor (2d-array w h)))\\n (labels\\n ((walk (y x)\\n\\t (setf (aref vis y x) 1)\\n\\t (loop\\n\\t (let (x2 y2)\\n\\t\\t (loop for (dx dy) in '((-1 0) (1 0) (0 -1) (0 1))\\n\\t\\t with cnt = 0 do\\n\\t\\t (let ((xx (+ x dx))\\n\\t\\t\\t (yy (+ y dy)))\\n\\t\\t\\t (if (and (array-in-bounds-p vis yy xx)\\n\\t\\t\\t\\t (zerop (aref vis yy xx))\\n\\t\\t\\t\\t (zerop (random (incf cnt))))\\n\\t\\t\\t (setf x2 xx y2 yy))))\\n\\t\\t (if (not x2) (return-from walk))\\n\\t\\t (if (= x x2)\\n\\t\\t (setf (aref hor (min y y2) x) 1)\\n\\t\\t (setf (aref ver y (min x x2)) 1))\\n\\t\\t (walk y2 x2))))\\n\\n (show ()\\n\\t (let ((g \\\" │││─┘┐┤─└┌├─┴┬┼\\\"))\\n\\t (loop for i from 0 to h do\\n\\t\\t (loop for j from 0 to w do\\n\\t\\t\\t (format t \\\"~c~a\\\"\\n\\t\\t\\t (char g\\n\\t\\t\\t (+ (or-and 1 (= i 0) (> j 0) (aref ver (1- i) (1- j)))\\n\\t\\t\\t\\t (or-and 2 (= i h) (> j 0) (aref ver i (1- j)))\\n\\t\\t\\t\\t (or-and 4 (= j 0) (> i 0) (aref hor (1- i) (1- j)))\\n\\t\\t\\t\\t (or-and 8 (= j w) (> i 0) (aref hor (1- i) j ))))\\n\\t\\t\\t (if (and (< j w)\\n\\t\\t\\t\\t (or (= i 0)\\n\\t\\t\\t\\t\\t (= 0 (aref hor (1- i) j))))\\n\\t\\t\\t \\\"───\\\" \\\" \\\")))\\n\\t\\t (terpri)\\n\\t\\t (when (< i h)\\n\\t\\t (loop for j from 0 below w do\\n\\t\\t\\t (format t (if (or (= j 0)\\n\\t\\t\\t\\t\\t (= 0 (aref ver i (1- j))))\\n\\t\\t\\t\\t\\t \\\"│ \\\" \\\" \\\")))\\n\\t\\t (format t \\\"│~%\\\"))))))\\n\\n (walk (random h) (random w))\\n (show))))\\n\\n(make-maze 20 20)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"void main() @safe {\\n import std.stdio, std.algorithm, std.range, std.random;\\n\\n enum uint w = 14, h = 10;\\n auto vis = new bool[][](h, w),\\n hor = iota(h + 1).map!(_ => [\\\"+---\\\"].replicate(w)).array,\\n ver = h.iota.map!(_ => [\\\"| \\\"].replicate(w) ~ \\\"|\\\").array;\\n\\n void walk(in uint x, in uint y) /*nothrow*/ @safe /*@nogc*/ {\\n vis[y][x] = true;\\n //foreach (immutable p; [[x-1,y], [x,y+1], [x+1,y], [x,y-1]].randomCover) {\\n foreach (const p; [[x-1, y], [x, y+1], [x+1, y], [x, y-1]].randomCover) {\\n if (p[0] >= w || p[1] >= h || vis[p[1]][p[0]]) continue;\\n if (p[0] == x) hor[max(y, p[1])][x] = \\\"+ \\\";\\n if (p[1] == y) ver[y][max(x, p[0])] = \\\" \\\";\\n walk(p[0], p[1]);\\n }\\n }\\n walk(uniform(0, w), uniform(0, h));\\n foreach (const a, const b; hor.zip(ver ~ []))\\n join(a ~ \\\"+\\\\n\\\" ~ b).writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program MazeGen_Rosetta;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses System.SysUtils, System.Types, System.Generics.Collections, System.IOUtils;\\n\\ntype\\n TMCell = record\\n Visited : Boolean;\\n PassTop : Boolean;\\n PassLeft : Boolean;\\n end;\\n TMaze = array of array of TMCell;\\n TRoute = TStack<TPoint>;\\n\\nconst\\n mwidth = 24;\\n mheight = 14;\\n\\nprocedure ClearVisited(var AMaze: TMaze);\\nvar\\n x, y: Integer;\\nbegin\\n for y := 0 to mheight - 1 do\\n for x := 0 to mwidth - 1 do\\n AMaze[x, y].Visited := False;\\nend;\\n\\nprocedure PrepareMaze(var AMaze: TMaze);\\nvar\\n Route : TRoute;\\n Position : TPoint;\\n d : Integer;\\n Pool : array of TPoint; // Pool of directions to pick randomly from\\nbegin\\n SetLength(AMaze, mwidth, mheight);\\n ClearVisited(AMaze);\\n Position := Point(Random(mwidth), Random(mheight));\\n Route := TStack<TPoint>.Create;\\n try\\n with Position do\\n while True do\\n begin\\n repeat\\n SetLength(Pool, 0);\\n if (y > 0) and not AMaze[x, y-1].Visited then Pool := Pool + [Point(0, -1)];\\n if (x < mwidth-1) and not AMaze[x+1, y].Visited then Pool := Pool + [Point(1, 0)];\\n if (y < mheight-1) and not AMaze[x, y+1].Visited then Pool := Pool + [Point(0, 1)];\\n if (x > 0) and not AMaze[x-1, y].Visited then Pool := Pool + [Point(-1, 0)];\\n\\n if Length(Pool) = 0 then // no direction to draw from\\n begin\\n if Route.Count = 0 then Exit; // and we are back at start so this is the end\\n Position := Route.Pop;\\n end;\\n until Length(Pool) > 0;\\n\\n d := Random(Length(Pool));\\n Offset(Pool[d]);\\n\\n AMaze[x, y].Visited := True;\\n if Pool[d].y = -1 then AMaze[x, y+1].PassTop := True; // comes from down to up ( ^ )\\n if Pool[d].x = 1 then AMaze[x, y].PassLeft := True; // comes from left to right ( --> )\\n if Pool[d].y = 1 then AMaze[x, y].PassTop := True; // comes from left to right ( v )\\n if Pool[d].x = -1 then AMaze[x+1, y].PassLeft := True; // comes from right to left ( <-- )\\n Route.Push(Position);\\n end;\\n finally\\n Route.Free;\\n end;\\nend;\\n\\nfunction MazeToString(const AMaze: TMaze; const S, E: TPoint): String; overload;\\nvar\\n x, y: Integer;\\n v : Char;\\nbegin\\n Result := '';\\n for y := 0 to mheight - 1 do\\n begin\\n for x := 0 to mwidth - 1 do\\n if AMaze[x, y].PassTop then Result := Result + '+'#32#32#32 else Result := Result + '+---';\\n Result := Result + '+' + sLineBreak;\\n for x := 0 to mwidth - 1 do\\n begin\\n if S = Point(x, y) then v := 'S' else\\n if E = Point(x, y) then v := 'E' else\\n v := #32'*'[Ord(AMaze[x, y].Visited) + 1];\\n\\n Result := Result + '|'#32[Ord(AMaze[x, y].PassLeft) + 1] + #32 + v + #32;\\n end;\\n Result := Result + '|' + sLineBreak;\\n end;\\n for x := 0 to mwidth - 1 do Result := Result + '+---';\\n Result := Result + '+' + sLineBreak;\\nend;\\n\\nprocedure Main;\\nvar\\n Maze: TMaze;\\nbegin\\n Randomize;\\n PrepareMaze(Maze);\\n ClearVisited(Maze); // show no route\\n Write(MazeToString(Maze, Point(-1, -1), Point(-1, -1)));\\n ReadLn;\\nend;\\n\\nbegin\\n Main;\\n\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"size = 15\\nn = 2 * size + 1\\nf = 100 / (n - 0.5)\\nlen m[] n * n\\n#\\nbackground 000\\nproc show_maze . .\\n clear\\n for i = 1 to len m[]\\n if m[i] = 0\\n x = (i - 1) mod n\\n y = (i - 1) div n\\n color 999\\n move x * f - f / 2 y * f - f / 2\\n rect f * 1.5 f * 1.5\\n .\\n .\\n sleep 0.01\\n.\\noffs[] = [ 1 n -1 (-n) ]\\n#\\nproc m_maze pos . .\\n m[pos] = 0\\n show_maze\\n d[] = [ 1 2 3 4 ]\\n for i = 4 downto 1\\n d = randint i\\n dir = offs[d[d]]\\n d[d] = d[i]\\n if m[pos + dir] = 1 and m[pos + 2 * dir] = 1\\n m[pos + dir] = 0\\n m_maze pos + 2 * dir\\n .\\n .\\n.\\nendpos = n * n - 1\\nproc make_maze . .\\n for i = 1 to len m[]\\n m[i] = 1\\n .\\n for i = 1 to n\\n m[i] = 2\\n m[n * i] = 2\\n m[n * i - n + 1] = 2\\n m[n * n - n + i] = 2\\n .\\n h = 2 * randint 15 - n + n * 2 * randint 15\\n m_maze h\\n m[endpos] = 0\\n endpos += n\\n.\\nmake_maze\\nshow_maze\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"[Maze generation for Rosetta Code.\\n EDSAC program, Initial Orders 2.\\n\\n Cells, horizontal walls, and vertical walls are numbered\\n as shown in this example:\\n +---1---+---2---+---3---+\\n | | | |\\n 1 1 2 2 3 3 4 N\\n | | | | |\\n +---5---+---6---+---7---+ W---+---E\\n | | | | |\\n 5 5 6 6 7 7 8 S\\n | | | |\\n +---9---+--10---+--11---+\\n\\nMaze data are held in a single 1-based array of 17-bit values\\n(equivalent to an array of records in a high-level language).\\nIn each entry, fields for cells and walls are as shown in \\\"Flags\\\" below.]\\n\\n [Arrange the storage]\\n T51K P56F [G parameter: generator for pseudo-random numbers]\\n T47K P100F [M parameter: main routine + dependent subroutines]\\n T45K P398F [H parameter: storage for maze]\\n [The following once-only code can be overwritten by the maze data.]\\n T46K P398F [N parameter: library subroutine R4 to read data]\\n T50K P420F [X parameter: code executed at start-up only]\\n\\n[=========== Executed at start-up, then overwritten ================]\\n E25K TX GK\\n [Enter with acc = 0]\\n [0] A@ GN [read 35-bit maze width into 0D]\\n AF TM [load and store width, assuming high word = 0]\\n [4] A4@ GN AF T1M [same for height]\\n [Initialize linear congruential generator for pseudo-random numbers]\\n [8] A8@ GN [read seed for LCG into 0D]\\n AD T4D [pass seed to LCG in 4D]\\n [12] A12@ GG [initialize LCG]\\n [Choose a random cell in the maze, for use later.]\\n [Also update storage of width and height.]\\n T4D [clear the whole of 4D, including sandwich bit]\\n AM U4F [load 17-bit width, pass to LCG as 35-bit value]\\n LD A2F TM [width to address field, add 1, store]\\n [20] A20@ G1G [call LCG, 0D := random in 0..(width - 1)]\\n AF T3M [save random to temporary store]\\n T4D A1M U4F [pass height of maze to LCG]\\n LD A2F T1M [height to address field, add 1, store]\\n [30] A30@ G1G [call LCG, 0D := random in 0..(height - 1)]\\n HF VM L64F L32F [acc := random*(width + 1)]\\n A3M LD A2F [add first random, shift to address, add 1]\\n T3M [save random index for use below]\\n HM V1M L64F L32F T2M [store (width+1)*(height+1)]\\n E65M [jump to main routine with acc = 0]\\n\\n[================ Main routine ====================]\\n E25K TM GK\\n[Variables]\\n [0] PF [initially maze width; then (width + 1) in address field]\\n [1] PF [initially maze height; then (height + 1) in address field]\\n[List of up to four E orders to move N, S, W, E.]\\n[The first two are also used as temporary store at program start]\\n [2] PF\\n [3] PF PF PF\\n [6] TF [T order to store E order in list]\\n[Constants]\\n [7] T2@ [initial value of T order]\\n [8] TH [order to store into array{0}]\\n [9] AH [order to load from array{0}]\\n [10] C1H [order to collate with array{1};]\\n [also teleprinter colon in figures mode]\\n [11] MF [add to T order to make A order with same address]\\n [12] LF [add to T order to make C order with same address]\\n[Flags]\\n [13] K4096F [horizontal wall deleted, 10000 hex]\\n [14] IF [vertical wall deleted, 8000 hex]\\n [15] RF [no north neighbour, 4000 hex]\\n [16] WF [no south neighbour, 2000 hex]\\n [17] QF [no west neighbour, 1000 hex]\\n [18] P1024F [no east neighbour, 0800 hex]\\n [19] PD [cell visited, 0001 hex]\\n [20] V2047F [mask to clear visited bit]\\n [21] P1023F [mask to select EDSAC address field, which contains\\n index of previous cell for backtracking (0 if none).\\n[Teleprinter]\\n [22] #F [set figures mode]\\n [23] !F [space]\\n [24] @F [carriage return]\\n [25] &F [line feed]\\n\\n[Subroutine called to set flag \\\"no north neighbour\\\" in cells along north edge,\\n similarly for east, south and west edges (order must be N, E, S, W).\\n Input: 4F = negative count of cells\\n 5F = step in array index\\n 6F = flag to be set]\\n [26] A3F T42@ [plant return link as usual]\\n A36@\\n G34@ [jump into middle of loop (since A < 0)]\\n [30] T4F [loop: update megative count]\\n A36@ A5F U36@\\n [34] S11@ T38@\\n[The following order initially refers to the NW corner cell.\\n First call leaves it referring to NE corner; second call to SE corner, etc.\\n Hence the need for calls to be in the order N, E, S, W.]\\n [36] A1H [planted; loaded as A1H]\\n A6F\\n [38] TF\\n A4F A2F [add 1 to negative count]\\n G30@ [if not yet 0, loop back]\\n [42] ZF\\n\\n[Subroutine to test for unvisited neighbour of current cell in a given direction.\\n Input: 4F = E order to be added to list if unvisited neighbour is found\\n 5F = step in array index to reach neighbour\\n 6F = flag to test for no neighbour in this direction]\\n [43] A3F T64@ [plant return link as usual]\\n S6F H6F CH [if no neighbour then acc = 0, else acc < 0]\\n E64@ [exit if no neighbour]\\n TF A118@\\n A5F T55@\\n S19@ H19@\\n [55] CF E64@\\n TF A6@ U63@\\n A2F T6@\\n A4F [load jump to execute move]\\n [63] TF [store in list of moves]\\n [64] ZF [(planted) jump back to caller]\\n\\n[Jump to here from once-only code, with acc = 0]\\n [Clear maze array]\\n [65] S2@\\n [66] TF [use 0F as loop counter]\\n [67] TH [planted, loaded as TH]\\n A67@ A2F T67@\\n AF A2F G66@\\n\\n [Set flag \\\"no north neighbour\\\" in cells along northern edge]\\n S@ A2F T4F [count = width, pass in 4F]\\n A2F T5F [step in array index = 1, pass in 5F]\\n A15@ T6F [pass flag in 6F]\\n [81] A81@ G26@ [call subroutine to set flag]\\n\\n [Repeat for east, south, west edges (must be in that order)]\\n S1@ A2F T4F A@ T5F A18@ T6F\\n [90] A90@ G26@\\n S@ A2F T4F S2F T5F A16@ T6F\\n [99] A99@ G26@\\n S1@ A2F T4F S@ T5F A17@ T6F\\n [108] A108@ G26@\\n\\n [Start with the random cell chosen at program start (X parameter)]\\n A3@ A8@\\n [Loop: here acc = T order for current cell]\\n [112] U121@ [plant T order]\\n A12@ T118@ [make and plant C order, same address]\\n\\n [Initialize storing in list of moves]\\n A7@ T6@\\n H20@\\n [118] CF A19@ [mark cell as visited]\\n UH [store flags of current cell in array{0} for easy access]\\n [121] TF [and also in the body of the array]\\n\\n [If cell has unvisited North neighbour, add North to list of possible moves]\\n A177@ T4F\\n S@ T5F\\n A15@ T6F\\n [128] A128@ G43@\\n [Repeat for South, West, East neighbours]\\n A178@ T4F\\n A@ T5F\\n A16@ T6F\\n [136] A136@ G43@\\n A179@ T4F\\n S2F T5F\\n A17@ T6F\\n [144] A144@ G43@\\n A180@ T4F\\n A2F T5F\\n A18@ T6F\\n [152] A152@ G43@\\n\\n [List now has 0..4 possible moves. If more than one, choose randomly.]\\n T4D [clear whole of 4D, including sandwich bit, for randomizer]\\n A6@ S7@ [address field := count of moves]\\n S2F G225@ [jump if none]\\n S2F G169@ [jump if one only]\\n RD A2F T4F [pass count, right-justified, to randomizer]\\n [164] A164@ G1G [0F := random value 0..(count - 1)]\\n AF LD E170@\\n [169] TF [only one move, must be at list{0}]\\n [170] A7@ A11@ T173@\\n [173] AF T176@\\n A121@ [common to all moves]\\n [176] EF [jump to move N,S,E, or W with acc = 0]\\n [177] E181@\\n [178] E190@\\n [179] E199@\\n [180] E208@\\n\\n [Move North and delete horizontal wall]\\n [181] U186@ A11@ T184@\\n [184] AF A13@\\n [186] TF A121@ S@ E216@\\n\\n [Move South and delete horizontal wall]\\n [190] A@ U196@ A11@ T194@\\n [194] AF A13@\\n [196] TF A196@ E216@\\n\\n [Move West and delete vertical wall]\\n [199] U204@ A11@ T202@\\n [202] AF A14@\\n [204] TF A121@ S2F E216@\\n\\n [Move East and delete vertical wall]\\n [208] A2F U214@ A11@ T212@\\n [212] AF A14@\\n [214] TF A214@\\n [fall through]\\n\\n [Set index of current cell as previous to the new cell.\\n Here with T order for new cell in acc.]\\n [216] U222@ A11@ T221@\\n A121@ S8@\\n [221] AF\\n [222] TF\\n A222@ E112@\\n\\n [No unvisited neighbour, backtrack if possible]\\n [225] TF [clear acc, needed]\\n H21@ CH [get index of previous cell (in address field)]\\n S2F [is it 0?]\\n G233@ [if so, maze is complete, jump to print]\\n A2F [restore]\\n A8@ [make T order]\\n E112@\\n\\n[Print the maze created above]\\n [233] O22@ [set teleprinter to figures mode]\\n TF [clear acc]\\n S1@ T5F\\n [Outer 'loop and a half' with 5F as negative counter.\\n h + 1 rows for horizontal walls plus h rows for vertical walls]\\n [237]\\n [Print row for horizontal walls]\\n O296@ [print leading + sign]\\n S@ A2F [set inner loop counter in 4F]\\n H13@\\n [241] T4F [4F := negative count of horizontal walls per row]\\n S13@ [has current horizontal wall been deleted?]\\n [243] C1H [planted; loaded as C1H]\\n G247@ [jump if not]\\n A23@ G249@\\n [247] T1F [clear acc]\\n [248] A248@ [load hyphen (since A = minus in figures mode)]\\n [249] TF OF OF OF [print 3 spaces or 3 minus]\\n O296@ [print plus sign]\\n A243@ A2F T243@ [inc address in C order]\\n A4F A2F G241@\\n [Here with acc = 0 after printing one row]\\n A243@ A2F T243@ [skip next element in array]\\n O24@ O25@ [print CR, LF]\\n A5F A2F E295@\\n T5F\\n [Print row for vertical walls]\\n S@\\n T4F\\n H14@\\n [272] S14@\\n [273] C1H [planted; loaded as C1H]\\n G277@\\n A23@ G279@\\n [277] T1F [clear acc]\\n A10@ [colon in figures mode]\\n [279] TF OF [print colon or space]\\n A273@ A2F T273@ [update C order]\\n A4F A2F [inc negative counter for inner loop]\\n E292@ [jump out of loop if counter = 0]\\n T4F [update counter]\\n O23@ O23@ O23@ [print 3 spaces]\\n E272@\\n[Exit from inner loop for vertical walls]\\n [292] O24@ O25@ [print CR, LF]\\n E237@\\n[Exit]\\n [295] O22@ [dummy character to flush print buffer]\\n [296] ZF [(1) halt program (2) plus sign in figures mode]\\n\\n[==================== Generator for pseudo-random numbers ===========]\\n[Linear congruential generator, same algorithm as Delphi 7 LCG\\n 38 locations]\\n E25K TG\\n GKG10@G15@T2#ZPFT2ZI514DP257FT4#ZPFT4ZPDPFT6#ZPFT6ZPFRFA6#@S4#@\\n T6#@E25FE8ZPFT8ZPFPFA3FT14@A4DT8#@ZFA3FT37@H2#@V8#@L512FL512F\\n L1024FA4#@T8#@H6#@C8#@T8#@S4DG32@TDA8#@E35@H4DTDV8#@L1FTDZF\\n\\n[==================== LIBRARY SUBROUTINE ============================]\\n E25K TN\\n[R4 Input of one signed integer.\\n 22 storage locations; working positions 4, 5, and 6.]\\n GKA3FT21@T4DH6@E11@P5DJFT6FVDL4FA4DTDI4FA4FS5@G7@S5@G20@SDTDT6FEF\\n\\n[===================================================================]\\n[The following, without the comments and white space, might have\\n been input from a separate tape.]\\n E25K TX GK\\n EZ [define entry point]\\n PF [acc = 0 on entry]\\n[Integers supplied by user: maze width, maze height, seed for LCG.\\n To be read by library subroutine R4; sign comes after value.]\\n 12+8+987654321+\\n\",\n \"language\": \"EDSAC-order-code\"\n },\n {\n \"code\": \"program MazeGen\\n\\n // First and last columns/rows are \\\"dead\\\" cells. Makes generating\\n // a maze with border walls much easier. Therefore, a visible\\n // 20x20 maze has a maze size of 22. \\t\\n mazeSize int = 22;\\n\\n south boolean[][];\\n west boolean[][];\\n visited boolean[][];\\n\\n function main()\\n initMaze();\\n generateMaze();\\n drawMaze();\\n end\\n\\n private function initMaze()\\n\\n visited = createBooleanArray(mazeSize, mazeSize, false);\\n\\n // Initialize border cells as already visited\\n for(col int from 1 to mazeSize)\\n visited[col][1] = true;\\n visited[col][mazeSize] = true;\\n end\\n for(row int from 1 to mazeSize)\\n visited[1][row] = true;\\n visited[mazeSize][row] = true;\\n end\\n\\n // Initialize all walls as present\\n south = createBooleanArray(mazeSize, mazeSize, true);\\n west = createBooleanArray(mazeSize, mazeSize, true);\\n\\n end\\n\\n private function createBooleanArray(col int in, row int in, initialState boolean in) returns(boolean[][])\\n\\n newArray boolean[][] = new boolean[0][0];\\n\\n for(i int from 1 to col)\\n innerArray boolean[] = new boolean[0];\\n for(j int from 1 to row)\\n innerArray.appendElement(initialState);\\n end\\n newArray.appendElement(innerArray);\\n end\\n\\n return(newArray);\\n\\n end\\n\\n private function createIntegerArray(col int in, row int in, initialValue int in) returns(int[][])\\n\\n newArray int[][] = new int[0][0];\\n\\n for(i int from 1 to col)\\n innerArray int[] = new int[0];\\n for(j int from 1 to row)\\n innerArray.appendElement(initialValue);\\n end\\n newArray.appendElement(innerArray);\\n end\\n\\n return(newArray);\\n\\n end\\n\\n private function generate(col int in, row int in)\\n\\n // Mark cell as visited\\n visited[col][row] = true;\\n\\n // Keep going as long as there is an unvisited neighbor\\n while(!visited[col][row + 1] || !visited[col + 1][row] ||\\n !visited[col][row - 1] || !visited[col - 1][row])\\n\\n while(true)\\n r float = MathLib.random(); // Choose a random direction\\n\\n case\\n when(r < 0.25 && !visited[col][row + 1]) // Go south\\n south[col][row] = false; // South wall down\\n generate(col, row + 1);\\n exit while;\\n when(r >= 0.25 && r < 0.50 && !visited[col + 1][row]) // Go east\\n west[col + 1][row] = false; // West wall of neighbor to the east down\\n generate(col + 1, row);\\n exit while;\\n when(r >= 0.5 && r < 0.75 && !visited[col][row - 1]) // Go north\\n south[col][row - 1] = false; // South wall of neighbor to the north down\\n generate(col, row - 1);\\n exit while;\\n when(r >= 0.75 && r < 1.00 && !visited[col - 1][row]) // Go west\\n west[col][row] = false; // West wall down\\n generate(col - 1, row);\\n exit while;\\n end\\n end\\n end\\n\\n end\\n\\n private function generateMaze()\\n\\n // Pick random start position (within the visible maze space)\\n randomStartCol int = MathLib.floor((MathLib.random() *(mazeSize - 2)) + 2);\\n randomStartRow int = MathLib.floor((MathLib.random() *(mazeSize - 2)) + 2);\\n\\n generate(randomStartCol, randomStartRow);\\n\\n end\\n\\n private function drawMaze()\\n\\n line string;\\n\\n // Iterate over wall arrays (skipping dead border cells as required).\\n // Construct a line at a time and output to console.\\n for(row int from 1 to mazeSize - 1)\\n\\n if(row > 1)\\n line = \\\"\\\";\\n for(col int from 2 to mazeSize)\\n if(west[col][row])\\n line ::= \\\"| \\\";\\n else\\n line ::= \\\" \\\";\\n end\\n end\\n Syslib.writeStdout(line);\\n end\\n\\n line = \\\"\\\";\\n for(col int from 2 to mazeSize - 1)\\n if(south[col][row])\\n line ::= \\\"+---\\\";\\n else\\n line ::= \\\"+ \\\";\\n end\\n end\\n line ::= \\\"+\\\";\\n SysLib.writeStdout(line);\\n\\n end\\n\\n end\\n\\nend\\n\",\n \"language\": \"EGL\"\n },\n {\n \"code\": \"defmodule Maze do\\n def generate(w, h) do\\n maze = (for i <- 1..w, j <- 1..h, into: Map.new, do: {{:vis, i, j}, true})\\n |> walk(:rand.uniform(w), :rand.uniform(h))\\n print(maze, w, h)\\n maze\\n end\\n\\n defp walk(map, x, y) do\\n Enum.shuffle( [[x-1,y], [x,y+1], [x+1,y], [x,y-1]] )\\n |> Enum.reduce(Map.put(map, {:vis, x, y}, false), fn [i,j],acc ->\\n if acc[{:vis, i, j}] do\\n {k, v} = if i == x, do: {{:hor, x, max(y, j)}, \\\"+ \\\"},\\n else: {{:ver, max(x, i), y}, \\\" \\\"}\\n walk(Map.put(acc, k, v), i, j)\\n else\\n acc\\n end\\n end)\\n end\\n\\n defp print(map, w, h) do\\n Enum.each(1..h, fn j ->\\n IO.puts Enum.map_join(1..w, fn i -> Map.get(map, {:hor, i, j}, \\\"+---\\\") end) <> \\\"+\\\"\\n IO.puts Enum.map_join(1..w, fn i -> Map.get(map, {:ver, i, j}, \\\"| \\\") end) <> \\\"|\\\"\\n end)\\n IO.puts String.duplicate(\\\"+---\\\", w) <> \\\"+\\\"\\n end\\nend\\n\\nMaze.generate(20, 10)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"import Maybe as M\\nimport Result as R\\nimport Matrix\\nimport Mouse\\nimport Random exposing (Seed)\\nimport Matrix.Random\\nimport Time exposing (Time, every, second)\\nimport Set exposing (Set, fromList)\\nimport List exposing (..)\\nimport String exposing (join)\\nimport Html exposing (Html, br, input, h1, h2, text, div, button)\\nimport Html.Events as HE\\nimport Html.Attributes as HA\\nimport Html.App exposing (program)\\nimport Json.Decode as JD\\nimport Svg\\nimport Svg.Attributes exposing (version, viewBox, cx, cy, r, x, y, x1, y1, x2, y2, fill,points, style, width, height, preserveAspectRatio)\\n\\nminSide = 10\\nmaxSide = 40\\nw = 700\\nh = 700\\ndt = 0.001\\n\\ntype alias Direction = Int\\ndown = 0\\nright = 1\\n\\ntype alias Door = (Matrix.Location, Direction)\\n\\ntype State = Initial | Generating | Generated | Solved\\n\\ntype alias Model =\\n { rows : Int\\n , cols : Int\\n , animate : Bool\\n , boxes : Matrix.Matrix Bool\\n , doors : Set Door\\n , current : List Matrix.Location\\n , state : State\\n , seedStarter : Int\\n , seed : Seed\\n }\\n\\ninitdoors : Int -> Int -> Set Door\\ninitdoors rows cols =\\n let\\n pairs la lb = List.concatMap (\\\\at -> List.map ((,) at) lb) la\\n downs = pairs (pairs [0..rows-2] [0..cols-1]) [down]\\n rights = pairs (pairs [0..rows-1] [0..cols-2]) [right]\\n in downs ++ rights |> fromList\\n\\ninitModel : Int -> Int -> Bool -> State -> Int -> Model\\ninitModel rows cols animate state starter =\\n let rowGenerator = Random.int 0 (rows-1)\\n colGenerator = Random.int 0 (cols-1)\\n locationGenerator = Random.pair rowGenerator colGenerator\\n (c, s)= Random.step locationGenerator (Random.initialSeed starter)\\n in { rows = rows\\n , cols = cols\\n , animate = animate\\n , boxes = Matrix.matrix rows cols (\\\\location -> state == Generating && location == c)\\n , doors = initdoors rows cols\\n , current = if state == Generating then [c] else []\\n , state = state\\n , seedStarter = starter -- updated every Tick until maze generated.\\n , seed = s\\n }\\n\\nview model =\\n let\\n borderLineStyle = style \\\"stroke:green;stroke-width:0.3\\\"\\n wallLineStyle = style \\\"stroke:green;stroke-width:0.1\\\"\\n\\n x1Min = x1 <| toString 0\\n y1Min = y1 <| toString 0\\n x1Max = x1 <| toString model.cols\\n y1Max = y1 <| toString model.rows\\n x2Min = x2 <| toString 0\\n y2Min = y2 <| toString 0\\n x2Max = x2 <| toString model.cols\\n y2Max = y2 <| toString model.rows\\n\\n borders = [ Svg.line [ x1Min, y1Min, x2Max, y2Min, borderLineStyle ] []\\n , Svg.line [ x1Max, y1Min, x2Max, y2Max, borderLineStyle ] []\\n , Svg.line [ x1Max, y1Max, x2Min, y2Max, borderLineStyle ] []\\n , Svg.line [ x1Min, y1Max, x2Min, y2Min, borderLineStyle ] []\\n ]\\n\\n doorToLine door =\\n let (deltaX1, deltaY1) = if (snd door == right) then (1,0) else (0,1)\\n (row, column) = fst door\\n in Svg.line [ x1 <| toString (column + deltaX1)\\n , y1 <| toString (row + deltaY1)\\n , x2 <| toString (column + 1)\\n , y2 <| toString (row + 1)\\n , wallLineStyle ] []\\n\\n doors = (List.map doorToLine <| Set.toList model.doors )\\n\\n circleInBox (row,col) color =\\n Svg.circle [ r \\\"0.25\\\"\\n , fill (color)\\n , cx (toString (toFloat col + 0.5))\\n , cy (toString (toFloat row + 0.5))\\n ] []\\n\\n showUnvisited location box =\\n if box then [] else [ circleInBox location \\\"yellow\\\" ]\\n\\n unvisited = model.boxes\\n |> Matrix.mapWithLocation showUnvisited\\n |> Matrix.flatten\\n |> concat\\n\\n current =\\n case head model.current of\\n Nothing -> []\\n Just c -> [circleInBox c \\\"black\\\"]\\n\\n maze =\\n if model.animate || model.state /= Generating\\n then [ Svg.g [] <| doors ++ borders ++ unvisited ++ current ]\\n else [ Svg.g [] <| borders ]\\n in\\n div\\n []\\n [ h2 [centerTitle] [text \\\"Maze Generator\\\"]\\n , div\\n [floatLeft]\\n ( slider \\\"rows\\\" minSide maxSide model.rows SetRows\\n ++ [ br [] [] ]\\n\\n ++ slider \\\"cols\\\" minSide maxSide model.cols SetCols\\n ++ [ br [] [] ]\\n\\n ++ checkbox \\\"Animate\\\" model.animate SetAnimate\\n ++ [ br [] [] ]\\n\\n ++ [ button\\n [ HE.onClick Generate ]\\n [ text \\\"Generate\\\"]\\n ] )\\n , div\\n [floatLeft]\\n [ Svg.svg\\n [ version \\\"1.1\\\"\\n , width (toString w)\\n , height (toString h)\\n , viewBox (join \\\" \\\"\\n [ 0 |> toString\\n , 0 |> toString\\n , model.cols |> toString\\n , model.rows |> toString ])\\n ]\\n maze\\n ]\\n ]\\n\\ncheckbox label checked msg =\\n [ input\\n [ HA.type' \\\"checkbox\\\"\\n , HA.checked checked\\n , HE.on \\\"change\\\" (JD.map msg HE.targetChecked)\\n ]\\n []\\n , text label\\n ]\\n\\nslider name min max current msg =\\n [ input\\n [ HA.value (if current >= min then current |> toString else \\\"\\\")\\n , HE.on \\\"input\\\" (JD.map msg HE.targetValue )\\n , HA.type' \\\"range\\\"\\n , HA.min <| toString min\\n , HA.max <| toString max\\n ]\\n []\\n , text <| name ++ \\\"=\\\" ++ (current |> toString)\\n ]\\n\\nfloatLeft = HA.style [ (\\\"float\\\", \\\"left\\\") ]\\ncenterTitle = HA.style [ ( \\\"text-align\\\", \\\"center\\\") ]\\n\\nunvisitedNeighbors : Model -> Matrix.Location -> List Matrix.Location\\nunvisitedNeighbors model (row,col) =\\n [(row, col-1), (row-1, col), (row, col+1), (row+1, col)]\\n |> List.filter (\\\\l -> fst l >= 0 && snd l >= 0 && fst l < model.rows && snd l < model.cols)\\n |> List.filter (\\\\l -> (Matrix.get l model.boxes) |> M.withDefault False |> not)\\n\\nupdateModel' : Model -> Int -> Model\\nupdateModel' model t =\\n case head model.current of\\n Nothing -> {model | state = Generated, seedStarter = t }\\n Just prev ->\\n let neighbors = unvisitedNeighbors model prev\\n in if (length neighbors) > 0 then\\n let (neighborIndex, seed) = Random.step (Random.int 0 (length neighbors-1)) model.seed\\n next = head (drop neighborIndex neighbors) |> M.withDefault (0,0)\\n boxes = Matrix.set next True model.boxes\\n dir = if fst prev == fst next then right else down\\n doorCell = if ( (dir == down) && (fst prev < fst next))\\n || (dir == right ) && (snd prev < snd next) then prev else next\\n doors = Set.remove (doorCell, dir) model.doors\\n in {model | boxes=boxes, doors=doors, current=next :: model.current, seed=seed, seedStarter = t}\\n else\\n let tailCurrent = tail model.current |> M.withDefault []\\n in updateModel' {model | current = tailCurrent} t\\n\\nupdateModel : Msg -> Model -> Model\\nupdateModel msg model =\\n let stringToCellCount s =\\n let v' = String.toInt s |> R.withDefault minSide\\n in if v' < minSide then minSide else v'\\n in case msg of\\n Tick tf ->\\n let t = truncate tf\\n in\\n if (model.state == Generating) then updateModel' model t\\n else { model | seedStarter = t }\\n\\n Generate ->\\n initModel model.rows model.cols model.animate Generating model.seedStarter\\n\\n SetRows countString ->\\n initModel (stringToCellCount countString) model.cols model.animate Initial model.seedStarter\\n\\n SetCols countString ->\\n initModel model.rows (stringToCellCount countString) model.animate Initial model.seedStarter\\n\\n SetAnimate b ->\\n { model | animate = b }\\n\\n NoOp -> model\\n\\ntype Msg = NoOp | Tick Time | Generate | SetRows String | SetCols String | SetAnimate Bool\\n\\nsubscriptions model = every (dt * second) Tick\\n\\nmain =\\n let\\n update msg model = (updateModel msg model, Cmd.none)\\n init = (initModel 21 36 False Initial 0, Cmd.none)\\n in program\\n { init = init\\n , view = view\\n , update = update\\n , subscriptions = subscriptions\\n }\\n\",\n \"language\": \"Elm\"\n },\n {\n \"code\": \"(require 'cl-lib)\\n\\n(cl-defstruct maze rows cols data)\\n\\n(defmacro maze-pt (w r c)\\n `(+ (* (mod ,r (maze-rows ,w)) (maze-cols ,w))\\n (mod ,c (maze-cols ,w))))\\n\\n(defmacro maze-ref (w r c)\\n `(aref (maze-data ,w) (maze-pt ,w ,r ,c)))\\n\\n(defun new-maze (rows cols)\\n (setq rows (1+ rows)\\n cols (1+ cols))\\n (let ((m (make-maze :rows rows :cols cols :data (make-vector (* rows cols) nil))))\\n\\n (dotimes (r rows)\\n (dotimes (c cols)\\n (setf (maze-ref m r c) (copy-sequence '(wall ceiling)))))\\n\\n (dotimes (r rows)\\n (maze-set m r (1- cols) 'visited))\\n\\n (dotimes (c cols)\\n (maze-set m (1- rows) c 'visited))\\n\\n (maze-unset m 0 0 'ceiling) ;; Maze Entrance\\n (maze-unset m (1- rows) (- cols 2) 'ceiling) ;; Maze Exit\\n\\n m))\\n\\n(defun maze-is-set (maze r c v)\\n (member v (maze-ref maze r c)))\\n\\n(defun maze-set (maze r c v)\\n (let ((cell (maze-ref maze r c)))\\n (when (not (member v cell))\\n (setf (maze-ref maze r c) (cons v cell)))))\\n\\n(defun maze-unset (maze r c v)\\n (setf (maze-ref maze r c) (delete v (maze-ref maze r c))))\\n\\n(defun print-maze (maze &optional marks)\\n (dotimes (r (1- (maze-rows maze)))\\n\\n (dotimes (c (1- (maze-cols maze)))\\n (princ (if (maze-is-set maze r c 'ceiling) \\\"+---\\\" \\\"+ \\\")))\\n (princ \\\"+\\\")\\n (terpri)\\n\\n (dotimes (c (1- (maze-cols maze)))\\n (princ (if (maze-is-set maze r c 'wall) \\\"|\\\" \\\" \\\"))\\n (princ (if (member (cons r c) marks) \\\" * \\\" \\\" \\\")))\\n (princ \\\"|\\\")\\n (terpri))\\n\\n (dotimes (c (1- (maze-cols maze)))\\n (princ (if (maze-is-set maze (1- (maze-rows maze)) c 'ceiling) \\\"+---\\\" \\\"+ \\\")))\\n (princ \\\"+\\\")\\n (terpri))\\n\\n(defun shuffle (lst)\\n (sort lst (lambda (a b) (= 1 (random 2)))))\\n\\n(defun to-visit (maze row col)\\n (let (unvisited)\\n (dolist (p '((0 . +1) (0 . -1) (+1 . 0) (-1 . 0)))\\n (let ((r (+ row (car p)))\\n (c (+ col (cdr p))))\\n (unless (maze-is-set maze r c 'visited)\\n (push (cons r c) unvisited))))\\n unvisited))\\n\\n(defun make-passage (maze r1 c1 r2 c2)\\n (if (= r1 r2)\\n (if (< c1 c2)\\n (maze-unset maze r2 c2 'wall) ; right\\n (maze-unset maze r1 c1 'wall)) ; left\\n (if (< r1 r2)\\n (maze-unset maze r2 c2 'ceiling) ; up\\n (maze-unset maze r1 c1 'ceiling)))) ; down\\n\\n(defun dig-maze (maze row col)\\n (let (backup\\n (run 0))\\n (maze-set maze row col 'visited)\\n (push (cons row col) backup)\\n (while backup\\n (setq run (1+ run))\\n (when (> run (/ (+ row col) 3))\\n (setq run 0)\\n (setq backup (shuffle backup)))\\n (setq row (caar backup)\\n col (cdar backup))\\n (let ((p (shuffle (to-visit maze row col))))\\n (if p\\n (let ((r (caar p))\\n (c (cdar p)))\\n (make-passage maze row col r c)\\n (maze-set maze r c 'visited)\\n (push (cons r c) backup))\\n (pop backup)\\n (setq backup (shuffle backup))\\n (setq run 0))))))\\n\\n(defun generate (rows cols)\\n (let* ((m (new-maze rows cols)))\\n (dig-maze m (random rows) (random cols))\\n (print-maze m)))\\n\\n(defun parse-ceilings (line)\\n (let (rtn\\n (i 1))\\n (while (< i (length line))\\n (push (eq ?- (elt line i)) rtn)\\n (setq i (+ i 4)))\\n (nreverse rtn)))\\n\\n(defun parse-walls (line)\\n (let (rtn\\n (i 0))\\n (while (< i (length line))\\n (push (eq ?| (elt line i)) rtn)\\n (setq i (+ i 4)))\\n (nreverse rtn)))\\n\\n(defun parse-maze (file-name)\\n (let ((rtn)\\n (lines (with-temp-buffer\\n (insert-file-contents-literally file-name)\\n (split-string (buffer-string) \\\"\\\\n\\\" t))))\\n (while lines\\n (push (parse-ceilings (pop lines)) rtn)\\n (push (parse-walls (pop lines)) rtn))\\n (nreverse rtn)))\\n\\n(defun read-maze (file-name)\\n (let* ((raw (parse-maze file-name))\\n (rows (1- (/ (length raw) 2)))\\n (cols (length (car raw)))\\n (maze (new-maze rows cols)))\\n (dotimes (r rows)\\n (let ((ceilings (pop raw)))\\n (dotimes (c cols)\\n (unless (pop ceilings)\\n (maze-unset maze r c 'ceiling))))\\n (let ((walls (pop raw)))\\n (dotimes (c cols)\\n (unless (pop walls)\\n (maze-unset maze r c 'wall)))))\\n maze))\\n\\n(defun find-exits (maze row col)\\n (let (exits)\\n (dolist (p '((0 . +1) (0 . -1) (-1 . 0) (+1 . 0)))\\n (let ((r (+ row (car p)))\\n (c (+ col (cdr p))))\\n (unless\\n (cond\\n ((equal p '(0 . +1)) (maze-is-set maze r c 'wall))\\n ((equal p '(0 . -1)) (maze-is-set maze row col 'wall))\\n ((equal p '(+1 . 0)) (maze-is-set maze r c 'ceiling))\\n ((equal p '(-1 . 0)) (maze-is-set maze row col 'ceiling)))\\n (push (cons r c) exits))))\\n exits))\\n\\n(defun drop-visited (maze points)\\n (let (not-visited)\\n (while points\\n (unless (maze-is-set maze (caar points) (cdar points) 'visited)\\n (push (car points) not-visited))\\n (pop points))\\n not-visited))\\n\\n(defun solve-maze (maze)\\n (let (solution\\n (exit (cons (- (maze-rows maze) 2) (- (maze-cols maze) 2)))\\n (pt (cons 0 0)))\\n (while (not (equal pt exit))\\n (maze-set maze (car pt) (cdr pt) 'visited)\\n (let ((exits (drop-visited maze (find-exits maze (car pt) (cdr pt)))))\\n (if (null exits)\\n (setq pt (pop solution))\\n (push pt solution)\\n (setq pt (pop exits)))))\\n (push pt solution)))\\n\\n(defun solve (file-name)\\n (let* ((maze (read-maze file-name))\\n (solution (solve-maze maze)))\\n (print-maze maze solution)))\\n\\n(generate 20 20)\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"-module( maze ).\\n\\n-export( [cell_accessible_neighbours/1, cell_content/1, cell_content_set/2, cell_pid/3, cell_position/1, display/1, generation/2, stop/1, task/0] ).\\n\\n-record( maze, {dict, max_x, max_y, start} ).\\n-record( state, {content=\\\" \\\", controller, is_dug=false, max_x, max_y, neighbours=[], position, walls=[north, south, east, west], walk_done} ).\\n\\ncell_accessible_neighbours( Pid ) -> read( Pid, accessible_neighbours ).\\n\\ncell_content( Pid ) -> read( Pid, content ).\\n\\ncell_content_set( Pid, Content ) -> Pid ! {content, Content, erlang:self()}.\\n\\ncell_pid( X, Y, Maze ) -> dict:fetch( {X, Y}, Maze#maze.dict ).\\n\\ncell_position( Pid ) -> read( Pid, position ).\\n\\ndisplay( #maze{dict=Dict, max_x=Max_x, max_y=Max_y} ) ->\\n\\tPosition_pids = dict:to_list( Dict ),\\n\\tdisplay( Max_x, Max_y, reads(Position_pids, content), reads(Position_pids, walls) ).\\n\\ngeneration( Max_x, Max_y ) ->\\n Controller = erlang:self(),\\n Position_pids = cells_create( Controller, Max_x, Max_y ),\\n Pids = [Y || {_X, Y} <- Position_pids],\\n [X ! {position_pids, Position_pids} || X <- Pids],\\n {Position, Pid} = lists:nth( random:uniform(Max_x * Max_y), Position_pids ),\\n Pid ! {dig, Controller},\\n receive\\n {dig_done} -> ok\\n end,\\n #maze{dict=dict:from_list(Position_pids), max_x=Max_x, max_y=Max_y, start=Position}.\\n\\nstop( #maze{dict=Dict} ) ->\\n Controller = erlang:self(),\\n Pids = [Y || {_X, Y} <- dict:to_list(Dict)],\\n [X ! {stop, Controller} || X <- Pids],\\n ok.\\n\\ntask() ->\\n Maze = generation( 16, 8 ),\\n io:fwrite( \\\"Starting at ~p~n\\\", [Maze#maze.start] ),\\n display( Maze ),\\n stop( Maze ).\\n\\n\\n\\ncells_create( Controller, Max_x, Max_y ) -> [{{X, Y}, cell_create(Controller, Max_x, Max_y, {X, Y})} || X <- lists:seq(1, Max_x), Y<- lists:seq(1, Max_y)].\\n\\ncell_create( Controller, Max_x, Max_y, {X, Y} ) -> erlang:spawn_link( fun() -> random:seed( X*1000, Y*1000, (X+Y)*1000 ), loop( #state{controller=Controller, max_x=Max_x, max_y=Max_y, position={X, Y}} ) end ).\\n\\ndisplay( Max_x, Max_y, Position_contents, Position_walls ) ->\\n All_rows = [display_row( Max_x, Y, Position_contents, Position_walls ) || Y <- lists:seq(Max_y, 1, -1)],\\n [io:fwrite(\\\"~s+~n~s|~n\\\", [North, West]) || {North, West} <- All_rows],\\n\\tio:fwrite(\\\"~s+~n\\\", [lists:flatten(lists:duplicate(Max_x, display_row_north(true)))] ).\\n\\ndisplay_row( Max_x, Y, Position_contents, Position_walls ) ->\\n\\tNorth_wests = [display_row_walls(proplists:get_value({X,Y}, Position_contents), proplists:get_value({X,Y}, Position_walls)) || X <- lists:seq(1, Max_x)],\\n\\tNorth = lists:append( [North || {North, _West} <- North_wests] ),\\n\\tWest = lists:append( [West || {_X, West} <- North_wests] ),\\n\\t{North, West}.\\n\\ndisplay_row_walls( Content, Walls ) -> {display_row_north( lists:member(north, Walls) ), display_row_west( lists:member(west, Walls), Content )}.\\n\\ndisplay_row_north( true ) -> \\\"+---\\\";\\ndisplay_row_north( false ) -> \\\"+ \\\".\\n\\ndisplay_row_west( true, Content ) -> \\\"| \\\" ++ Content ++ \\\" \\\";\\ndisplay_row_west( false, Content ) -> \\\" \\\" ++ Content ++ \\\" \\\".\\n\\nloop( State ) ->\\n receive\\n {accessible_neighbours, Pid} ->\\n \\tPid ! {accessible_neighbours, loop_accessible_neighbours( State#state.neighbours, State#state.walls ), erlang:self()},\\n loop( State );\\n {content, Pid} ->\\n \\tPid ! {content, State#state.content, erlang:self()},\\n loop( State );\\n {content, Content, _Pid} ->\\n loop( State#state{content=Content} );\\n {dig, Pid} ->\\n\\t Not_dug_neighbours = loop_not_dug( State#state.neighbours ),\\n\\t New_walls = loop_dig( Not_dug_neighbours, lists:delete( loop_wall_from_pid(Pid, State#state.neighbours), State#state.walls), Pid ),\\n\\t loop( State#state{is_dug=true, walls=New_walls, walk_done=Pid} );\\n {dig_done} ->\\n\\t Not_dug_neighbours = loop_not_dug( State#state.neighbours ),\\n\\t New_walls = loop_dig( Not_dug_neighbours, State#state.walls, State#state.walk_done ),\\n\\t loop( State#state{walls=New_walls} );\\n {is_dug, Pid} ->\\n \\t Pid ! {is_dug, State#state.is_dug, erlang:self()},\\n\\t loop( State );\\n {position, Pid} ->\\n \\tPid ! {position, State#state.position, erlang:self()},\\n loop( State );\\n {position_pids, Position_pids} ->\\n {_My_position, Neighbours} = lists:foldl( fun loop_neighbours/2, {State#state.position, []}, Position_pids ),\\n erlang:garbage_collect(), % Shrink process after using large Pid_positions. For memory starved systems.\\n loop( State#state{neighbours=Neighbours} );\\n {stop, Controller} when Controller =:= State#state.controller ->\\n \\t ok;\\n {walls, Pid} ->\\n \\t Pid ! {walls, State#state.walls, erlang:self()},\\n\\t loop( State )\\n end.\\n\\nloop_accessible_neighbours( Neighbours, Walls ) -> [Pid || {Direction, Pid} <- Neighbours, not lists:member(Direction, Walls)].\\n\\nloop_dig( [], Walls, Pid ) ->\\n\\tPid ! {dig_done},\\n\\tWalls;\\nloop_dig( Not_dug_neighbours, Walls, _Pid ) ->\\n {Dig_pid, Dig_direction} = lists:nth( random:uniform(erlang:length(Not_dug_neighbours)), Not_dug_neighbours ),\\n Dig_pid ! {dig, erlang:self()},\\n\\tlists:delete( Dig_direction, Walls ).\\n\\nloop_neighbours( {{X, Y}, Pid}, {{X, My_y}, Acc} ) when Y =:= My_y + 1 -> {{X, My_y}, [{north, Pid} | Acc]};\\nloop_neighbours( {{X, Y}, Pid}, {{X, My_y}, Acc} ) when Y =:= My_y - 1 -> {{X, My_y}, [{south, Pid} | Acc]};\\nloop_neighbours( {{X, Y}, Pid}, {{My_x, Y}, Acc} ) when X =:= My_x + 1 -> {{My_x, Y}, [{east, Pid} | Acc]};\\nloop_neighbours( {{X, Y}, Pid}, {{My_x, Y}, Acc} ) when X =:= My_x - 1 -> {{My_x, Y}, [{west, Pid} | Acc]};\\nloop_neighbours( _Position_pid, Acc ) -> Acc.\\n\\nloop_not_dug( Neighbours ) ->\\n\\tMy_pid = erlang:self(),\\n\\t[Pid ! {is_dug, My_pid} || {_Direction, Pid} <- Neighbours],\\n\\t[{Pid, Direction} || {Direction, Pid} <- Neighbours, not read_receive(Pid, is_dug)].\\n\\nloop_wall_from_pid( Pid, Neighbours ) -> loop_wall_from_pid_result( lists:keyfind(Pid, 2, Neighbours) ).\\nloop_wall_from_pid_result( {Direction, _Pid} ) -> Direction;\\nloop_wall_from_pid_result( false ) -> controller.\\n\\nread( Pid, Key ) ->\\n\\tPid ! {Key, erlang:self()},\\n\\tread_receive( Pid, Key ).\\n\\nread_receive( Pid, Key ) ->\\n receive\\n {Key, Value, Pid} -> Value\\n end.\\n\\nreads( Position_pids, Key ) ->\\n My_pid = erlang:self(),\\n [Pid ! {Key, My_pid} || {_Position, Pid} <- Position_pids],\\n [{Position, read_receive(Pid, Key)} || {Position, Pid} <- Position_pids].\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"-module(maze).\\n-record(maze, {g, m, n}).\\n-export([generate_default/0, generate_MxN/2]).\\n\\nmake_maze(M, N) ->\\n Maze = #maze{g = digraph:new(), m = M, n = N},\\n lists:foreach(fun(X) -> digraph:add_vertex(Maze#maze.g, X) end, lists:seq(0, M * N - 1)),\\n Maze.\\n\\nrow_at(V, Maze) -> trunc(V / Maze#maze.n).\\ncol_at(V, Maze) -> V - row_at(V, Maze) * Maze#maze.n.\\nvertex_at(Row, Col, Maze) -> Cell_Exists = cell_exists(Row, Col, Maze), if Cell_Exists -> Row * Maze#maze.n + Col; true -> -1 end.\\ncell_exists(Row, Col, Maze) -> (Row >= 0) and (Row < Maze#maze.m) and (Col >= 0) and (Col < Maze#maze.n).\\n\\nadjacent_cells(V, Maze) -> % ordered: left, up, right, down\\n adjacent_cell(cell_left, V, Maze)++adjacent_cell(cell_up, V, Maze)++adjacent_cell(cell_right, V, Maze)++adjacent_cell(cell_down, V, Maze).\\n\\nadjacent_cell(cell_left, V, Maze) -> case (col_at(V, Maze) == 0) of true -> []; _Else -> [V - 1] end;\\nadjacent_cell(cell_up, V, Maze) -> case (row_at(V, Maze) == 0) of true -> []; _Else -> [V - Maze#maze.n] end;\\nadjacent_cell(cell_right, V, Maze) -> case (col_at(V, Maze) == Maze#maze.n - 1) of true -> []; _Else -> [V + 1] end;\\nadjacent_cell(cell_down, V, Maze) -> case (row_at(V, Maze) == Maze#maze.m - 1) of true -> []; _Else -> [V + Maze#maze.n] end.\\n\\nconnect_all(V, Maze) ->\\n lists:foreach(fun(X) -> digraph:add_edge(Maze#maze.g, V, X) end, adjacent_cells(V, Maze)).\\n\\nmake_maze(M, N, all_connected) ->\\n Maze = make_maze(M, N),\\n lists:foreach(fun(X) -> connect_all(X, Maze) end, lists:seq(0, M * N - 1)),\\n Maze.\\n\\nmaze_parts(Maze) ->\\n SPR = Maze#maze.n + 1, % slots per row is #columns + 1\\n NPR = (Maze#maze.m * 2) + 1, % # part rows is #(rows * 2) + 1\\n [make_part(Maze, trunc(Index/SPR), Index - trunc(Index/SPR) * SPR) || Index <- lists:seq(0, (SPR * NPR) - 1)].\\n\\ndraw_part(Part) ->\\n case Part of\\n {pwall, pclosed} -> io:format(\\\"+---\\\");\\n {pwall, popen} -> io:format(\\\"+ \\\");\\n {pwall, pend} -> io:format(\\\"+~n\\\");\\n {phall, pclosed} -> io:format(\\\"| \\\");\\n {phall, popen} -> io:format(\\\" \\\");\\n {phall, pend} -> io:format(\\\"|~n\\\")\\n end.\\n\\nhas_neighbour(Maze, Row, Col, Direction) ->\\n V = vertex_at(Row, Col, Maze),\\n if\\n V >= 0 ->\\n Adjacent = adjacent_cell(Direction, V, Maze),\\n if\\n length(Adjacent) > 0 ->\\n Neighbours = digraph:out_neighbours(Maze#maze.g, lists:nth(1, Adjacent)),\\n lists:member(V, Neighbours);\\n true -> false\\n end;\\n true -> false\\n end.\\n\\nmake_part(Maze, DoubledRow, Col) ->\\n if\\n trunc(DoubledRow/2) * 2 == DoubledRow -> % --- (even row) making a wall above the cell\\n make_part(Maze, trunc(DoubledRow/2), Col, cell_up, pwall);\\n true -> % ---otherwise (odd row) making a hall through the cell\\n make_part(Maze, trunc(DoubledRow/2), Col, cell_left, phall)\\n end.\\n\\nmake_part(Maze, _, Col, _, Part_Type) when Col == Maze#maze.n -> {Part_Type, pend};\\nmake_part(Maze, Row, Col, Direction, Part_Type) ->\\n Has_Neighbour = has_neighbour(Maze, Row, Col, Direction),\\n if\\n Has_Neighbour -> {Part_Type, popen};\\n true -> {Part_Type, pclosed}\\n end.\\n\\nshuffle([], Acc) -> Acc;\\nshuffle(List, Acc) ->\\n Elem = lists:nth(random:uniform(length(List)), List),\\n shuffle(lists:delete(Elem, List), Acc++[Elem]).\\n\\nprocessDepthFirst(Maze) ->\\n if\\n Maze#maze.m * Maze#maze.n == 0 -> [{pwall, pend}];\\n true ->\\n Visited = array:new([{size, Maze#maze.m * Maze#maze.n},{fixed,true},{default,false}]),\\n {_, Path} = processDepthFirst(Maze, -1, random:uniform(Maze#maze.m * Maze#maze.n) - 1, {Visited, []}),\\n Path\\n end.\\n\\nprocessDepthFirst(Maze, Vfrom, V, VandP) ->\\n {Visited, Path} = VandP,\\n Was_Visited = array:get(V, Visited),\\n if\\n not Was_Visited ->\\n Walker = fun(X, Acc) -> processDepthFirst(Maze, V, X, Acc) end,\\n Random_Neighbours = shuffle(digraph:out_neighbours(Maze#maze.g, V), []),\\n lists:foldl(Walker, {array:set(V, true, Visited), Path++[{Vfrom, V}]}, Random_Neighbours);\\n true -> VandP\\n end.\\n\\nopen_wall(_, {-1, _}) -> ok;\\nopen_wall(Maze, {V, V2}) ->\\n case (V2 > V) of true -> digraph:add_edge(Maze#maze.g, V, V2); _Else -> digraph:add_edge(Maze#maze.g, V2, V) end.\\n\\ngenerate_MxN(M, N) ->\\n Maze = make_maze(M, N),\\n Matrix = make_maze(M, N, all_connected),\\n Trail = processDepthFirst(Matrix),\\n lists:foreach(fun(X) -> open_wall(Maze, X) end, Trail),\\n Parts = maze_parts(Maze),\\n lists:foreach(fun(X) -> draw_part(X) end, Parts).\\n\\ngenerate_default() ->\\n generate_MxN(9, 9).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"let rnd : int -> int =\\n let gen = new System.Random()\\n fun max -> gen.Next(max)\\n\\n// randomly choose an element of a list\\nlet choose (xs:_ list) = xs.[rnd xs.Length]\\n\\ntype Maze(width, height) =\\n // (x,y) -> have we been here before?\\n let visited = Array2D.create width height false\\n // (x,y) -> is there a wall between (x,y) and (x+1,y)?\\n let horizWalls = Array2D.create width height true\\n // (x,y) -> is there a wall between (x,y) and (x,y+1)?\\n let vertWalls = Array2D.create width height true\\n\\n let isLegalPoint (x,y) =\\n x >= 0 && x < width && y >= 0 && y < height\\n\\n let neighbours (x,y) =\\n [(x-1,y);(x+1,y);(x,y-1);(x,y+1)] |> List.filter isLegalPoint\\n\\n let removeWallBetween (x1,y1) (x2,y2) =\\n if x1 <> x2 then\\n horizWalls.[min x1 x2, y1] <- false\\n else\\n vertWalls.[x1, min y1 y2] <- false\\n\\n let rec visit (x,y as p) =\\n let rec loop ns =\\n let (nx,ny) as n = choose ns\\n if not visited.[nx,ny] then\\n removeWallBetween p n\\n visit n\\n match List.filter ((<>) n) ns with\\n | [] -> ()\\n | others -> loop others\\n\\n visited.[x,y] <- true\\n loop (neighbours p)\\n\\n do visit (rnd width, rnd height)\\n\\n member x.Print() =\\n (\\\"+\\\" + (String.replicate width \\\"-+\\\")) ::\\n [for y in 0..(height-1) do\\n yield \\\"\\\\n|\\\"\\n for x in 0..(width-1) do\\n yield if horizWalls.[x,y] then \\\" |\\\" else \\\" \\\"\\n yield \\\"\\\\n+\\\"\\n for x in 0..(width-1) do\\n yield if vertWalls.[x,y] then \\\"-+\\\" else \\\" +\\\"\\n ]\\n |> String.concat \\\"\\\"\\n |> printfn \\\"%s\\\"\\n\\nlet m = new Maze(10,10)\\nm.Print()\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"\\\\ Bit Arrays\\n\\n: to-bits ( c -- f f f f f f f f )\\n 8 0 ?do\\n 2 /mod\\n swap negate swap\\n loop\\n drop ;\\n\\n: from-bits ( f f f f f f f f -- )\\n 8 0 ?do\\n if [char] 1 emit else [char] 0 emit then\\n loop ;\\n\\n: byte-bin. ( c -- )\\n to-bits from-bits space ;\\n\\n: byte. ( c -- )\\n dup byte-bin.\\n dup 2 ['] u.r 16 base-execute space\\n 3 u.r space ;\\n\\n: bytes-for-bits ( u1 -- u2 )\\n 8 /mod swap\\n 0> if 1+ then ;\\n\\n: bits ( u -- bits )\\n dup bytes-for-bits cell + \\\\ u-bits u-bytes\\n dup allocate throw \\\\ u-bits u-bytes addr\\n 2dup swap erase nip \\\\ u-bits addr\\n swap over ! ; \\\\ addr\\n\\n: free-bits ( bits -- )\\n free throw ;\\n\\n: bits. ( bits -- )\\n dup @ bytes-for-bits \\\\ addr bytes\\n swap cell+ swap \\\\ addr+cell bytes\\n bounds ?do\\n i cr 20 ['] u.r 16 base-execute space\\n i c@ byte.\\n loop\\n cr ;\\n\\n: bit-position ( u -- u-bit u-byte )\\n 8 /mod ;\\n\\n: assert-bit ( bits u -- bits u )\\n assert( 2dup swap @ < ) ;\\n\\n: find-bit ( bits u1 -- addr u2 )\\n assert-bit\\n bit-position \\\\ addr bit byte\\n rot \\\\ bit byte addr\\n cell+ + swap ; \\\\ addr' bit\\n\\n: set-true ( addr u -- )\\n 1 swap lshift over \\\\ addr mask addr\\n c@ or swap c! ;\\n\\n: set-false ( addr u -- )\\n 1 swap lshift invert over \\\\ addr mask addr\\n c@ and swap c! ;\\n\\n: set ( addr u f -- )\\n if set-true else set-false then ;\\n\\n: set-bit ( bits u f -- )\\n { f }\\n find-bit f set ;\\n\\n: set-bits-at-addr ( addr u-start u-stop f -- )\\n { f }\\n 1+ swap u+do\\n dup i f set\\n loop\\n drop ;\\n\\n: byte-from-flag ( f -- c )\\n if 255 else 0 then ;\\n\\n: set-bits { bits u-start u-stop f -- }\\n\\n u-start u-stop > if exit then\\n\\n bits u-start find-bit { addr-start bit-start }\\n bits u-stop find-bit { addr-stop bit-stop }\\n\\n addr-start addr-stop = if\\n addr-start bit-start bit-stop f set-bits-at-addr\\n else\\n addr-start bit-start 7 f set-bits-at-addr\\n addr-start 1+ addr-stop addr-start - 1- f byte-from-flag fill\\n addr-stop 0 bit-stop f set-bits-at-addr\\n then ;\\n\\n: check-bit ( addr u -- f )\\n find-bit \\\\ addr bit\\n 1 swap lshift swap \\\\ mask addr\\n c@ and 0> ;\\n\\n: resize-bits ( bits u -- bits )\\n over @ { old-size }\\n tuck bytes-for-bits cell + resize throw \\\\ u-bits bits\\n 2dup ! swap \\\\ bits u-bits\\n dup old-size > if\\n over swap \\\\ bits bits u-bits\\n 1- old-size swap false set-bits\\n else\\n drop\\n then ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"#! /usr/bin/gforth\\n\\\\ Maze Generation\\n\\nwarnings off\\n\\nrequire random.fs\\nrequire bits.fs\\n\\n\\\\ command line\\n\\n: parse-number s>number? invert throw drop ;\\n: parse-width .\\\" width : \\\" next-arg parse-number dup . cr ;\\n: parse-height .\\\" height: \\\" next-arg parse-number dup . cr ;\\n: parse-args cr parse-width parse-height ;\\n\\nparse-args constant HEIGHT constant WIDTH\\n\\n 2 CONSTANT AISLE-WIDTH\\n 1 CONSTANT AISLE-HEIGHT\\n\\nWIDTH HEIGHT * bits CONSTANT VISITED\\nWIDTH 1- HEIGHT * bits CONSTANT EAST-WALLS\\nHEIGHT 1- WIDTH * bits CONSTANT SOUTH-WALLS\\n\\n0 CONSTANT NORTH\\n1 CONSTANT EAST\\n2 CONSTANT SOUTH\\n3 CONSTANT WEST\\n\\n: visited-ix ( x y -- u ) WIDTH * + ;\\n: east-wall-ix ( x y -- u ) [ WIDTH 1- ] literal * + ;\\n: south-wall-ix ( x y -- u ) WIDTH * + ;\\n: visited! ( x y -- ) visited-ix VISITED swap TRUE set-bit ;\\n: visited? ( x y -- f ) visited-ix VISITED swap check-bit ;\\n: east-wall? ( x y -- f ) east-wall-ix EAST-WALLS swap check-bit ;\\n: south-wall? ( x y -- f ) south-wall-ix SOUTH-WALLS swap check-bit ;\\n: remove-east-wall ( x y -- ) east-wall-ix EAST-WALLS swap FALSE set-bit ;\\n: remove-south-wall ( x y -- ) south-wall-ix SOUTH-WALLS swap FALSE set-bit ;\\n\\n: clear-visited ( -- ) VISITED 0 WIDTH 1- HEIGHT 1- visited-ix FALSE set-bits ;\\n: set-east-walls ( -- ) EAST-WALLS 0 WIDTH 2 - HEIGHT 1- east-wall-ix TRUE set-bits ;\\n: set-south-walls ( -- ) SOUTH-WALLS 0 WIDTH 1- HEIGHT 2 - south-wall-ix TRUE set-bits ;\\n: initial-pos ( -- x y ) WIDTH random HEIGHT random ;\\n: init-state ( -- -1 x y 0 ) clear-visited set-east-walls set-south-walls -1 initial-pos 2dup visited! 0 ;\\n\\n: north-valid? ( x y -- f ) nip 0> ;\\n: east-valid? ( x y -- f ) drop [ WIDTH 1- ] literal < ;\\n: south-valid? ( x y -- f ) nip [ HEIGHT 1- ] literal < ;\\n: west-valid? ( x y -- f ) drop 0> ;\\n: dir-valid? ( x y d -- f ) case\\n NORTH of north-valid? endof\\n EAST of east-valid? endof\\n SOUTH of south-valid? endof\\n WEST of west-valid? endof\\n endcase ;\\n: move-north ( x y -- x' y' ) 1- ;\\n: move-east ( x y -- x' y' ) swap 1+ swap ;\\n: move-south ( x y -- x' y' ) 1+ ;\\n: move-west ( x y -- x' y' ) swap 1- swap ;\\n: move ( x y d -- x' y' ) case\\n NORTH of move-north endof\\n EAST of move-east endof\\n SOUTH of move-south endof\\n WEST of move-west endof\\n endcase ;\\n\\n: remove-north-wall ( x y -- ) 1- remove-south-wall ;\\n: remove-west-wall ( x y -- ) swap 1- swap remove-east-wall ;\\n: remove-wall ( x y d -- ) case\\n NORTH of remove-north-wall endof\\n EAST of remove-east-wall endof\\n SOUTH of remove-south-wall endof\\n WEST of remove-west-wall endof\\n endcase ;\\n\\n: dir? ( m d -- f ) 1 swap lshift and 0= ;\\n: dir! ( m d -- m' ) 1 swap lshift or ;\\n: pick-dir ( m -- m' d ) assert( dup $f <> ) begin 4 random 2dup dir? if tuck dir! swap exit then drop again ;\\n\\n: update-state ( x y m d -- x' y' m' ) { x y m d }\\n x y d dir-valid? if\\n x y m\\n x y d move\\n 2dup visited? if\\n 2drop\\n else\\n 2dup visited!\\n x y d remove-wall\\n 0\\n then\\n else\\n x y m\\n then ;\\n\\n: step ( x y m -- x' y' m' ) dup $f = if\\n drop 2drop \\\\ backtracking!\\n else\\n pick-dir update-state\\n then ;\\n\\n: build-maze ( -- ) init-state\\n begin\\n dup -1 <> while\\n step\\n repeat drop ;\\n\\n: corner ( -- ) [char] + emit ;\\n: h-wall ( -- ) [char] - emit ;\\n: v-wall ( -- ) [char] | emit ;\\n: top-bottom. ( -- ) cr corner WIDTH 0 ?do AISLE-WIDTH 0 ?do h-wall loop corner loop ;\\n: empty ( -- ) AISLE-WIDTH 0 ?do space loop ;\\n: interior-cell ( x y -- ) empty east-wall? if v-wall else space then ;\\n: last-cell ( -- ) empty v-wall ;\\n: row ( y -- ) cr v-wall [ WIDTH 1- ] literal 0 ?do i over interior-cell loop drop last-cell ;\\n: last-row ( y -- ) cr WIDTH 0 ?do corner i over south-wall? if AISLE-WIDTH 0 ?do h-wall loop else empty then loop drop corner ;\\n: aisle ( y -- ) AISLE-HEIGHT 0 ?do dup row loop dup [ HEIGHT 1- ] literal < if last-row else drop then ;\\n: maze. ( -- ) top-bottom.\\n HEIGHT 0 ?do i aisle loop\\n top-bottom. ;\\n: maze ( width height -- ) build-maze maze. ;\\n\\nmaze cr bye\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"' version 04-12-2016\\n' compile with: fbc -s console\\n' when generating a big maze it's possible to run out of stack space\\n' increase stack with the -t xxxx (xxxx is the amount you want in Kbytes)\\n\\nReDim Shared As String d() ' directions\\nReDim Shared As ULong c() ' cell's\\n\\nSub cell(x As ULong, y As ULong, s As ULong)\\n\\n Dim As ULong x1, y1, di_n\\n c(x,y) = 1 ' mark as visited\\n\\n Do\\n Dim As String di = d(x, y)\\n Dim As Long l = Len(di) -1\\n If l < 0 Then Exit Sub ' no directions left then exit\\n di_n = di[l] ' get direction\\n If l = 0 Then\\n d(x,y) = \\\"\\\"\\n Else\\n d(x,y) = Left(di,l)\\n End If\\n\\n Select Case di_n ' 0,0 is upper left corner\\n Case Asc(\\\"N\\\")\\n x1 = x : y1 = y -1\\n Case Asc(\\\"E\\\")\\n x1 = x +1 : y1 = y\\n Case Asc(\\\"S\\\")\\n x1 = x : y1 = y +1\\n Case Asc(\\\"W\\\")\\n x1 = x -1 : y1 = y\\n End Select\\n\\n If c(x1,y1) <> 0 Then Continue Do\\n\\n Select Case di_n ' 0,0 is upper left corner\\n Case Asc(\\\"N\\\")\\n Line (x * s +1 , y * s) - ((x +1) * s -1, y * s),0\\n Case Asc(\\\"E\\\")\\n Line (x1 * s, y * s +1) - (x1 * s, (y +1) * s -1),0\\n Case Asc(\\\"S\\\")\\n Line (x * s +1, y1 * s) - ((x +1) * s -1, y1 * s),0\\n Case Asc(\\\"W\\\")\\n Line (x * s , y * s +1) - (x * s, (y +1) * s -1),0\\n End Select\\n\\n cell(x1, y1, s)\\n Loop\\n\\nEnd Sub\\n\\nSub gen_maze(w As ULong, h As ULong, s As ULong)\\n\\n ReDim d(w, h)\\n ReDim c(w, h)\\n Dim As ULong x, y, r, i\\n Dim As String di\\n\\n d(0, 0) = \\\"SE\\\" ' cornes\\n d(0, h -1) =\\\"NE\\\"\\n d(w -1, 0) =\\\"SW\\\"\\n d(w -1, h -1) =\\\"NW\\\"\\n\\n For x = 1 To w -2 ' sides\\n d(x,0) = \\\"EWS\\\"\\n d(x,h -1) = \\\"NEW\\\"\\n Next\\n\\n For y = 1 To h -2\\n d(0, y) = \\\"NSE\\\"\\n d(w -1, y) =\\\"NSW\\\"\\n Next\\n\\n For x = 0 To w -1 ' shuffle directions\\n For y = 0 To h -1\\n di = d(x,y)\\n If di = \\\"\\\" Then di = \\\"NEWS\\\"\\n i = Len(di)\\n Do\\n r = Fix(Rnd * i)\\n i = i - 1\\n Swap di[r], di[i]\\n Loop Until i = 0\\n d(x,y) = di\\n Next\\n Next\\n\\n ScreenRes w * s +1, h * s +1, 8\\n ' draw the grid\\n For x = 0 To w\\n Line (x * s, 0) - (x * s, h * s), 2 ' green color\\n Next\\n\\n For y = 0 To h\\n Line(0, y * s) - (w* s, y * s),2\\n Next\\n ' choice the start cell\\n x = Fix(Rnd * w)\\n y = Fix(Rnd * h)\\n\\n cell(x, y, s)\\n\\nEnd Sub\\n\\n' ------=< MAIN >=------\\n\\nRandomize Timer\\n\\nDim As ULong t\\n\\nDo\\n ' gen_maxe(width, height, cell size)\\n gen_maze(30, 30, 20)\\n WindowTitle \\\" S to save, N for next maze, other key to stop\\\"\\n Do\\n Var key = Inkey\\n key = UCase(key)\\n If key = \\\"S\\\" Then\\n t = t +1\\n BSave(\\\"maze\\\" + Str(t) + \\\".bmp\\\"), 0\\n key = \\\"\\\"\\n End If\\n If key = \\\"N\\\" Then Continue Do, Do\\n If key <> \\\"\\\" Then Exit Do, Do\\n Loop\\nLoop\\n\\nEnd\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"_rows = 9\\n_cols = 11\\n_size = 32\\n_mgn = 32\\n\\n_t = ( 1 << 0 )\\n_l = ( 1 << 1 )\\n_b = ( 1 << 2 )\\n_r = ( 1 << 3 )\\n_a = _t + _l + _b + _r\\n\\n_window = 1\\n\\nvoid local fn BuildWindow\\n window _window, @\\\"FutureBasic - Maze generation\\\", (0,0,_cols*_size+_mgn*2,_rows*_size+_mgn*2), NSWindowStyleMaskTitled\\nend fn\\n\\n\\nlocal fn CellAvailable( r as long, c as long ) as BOOL\\n if ( r < 0 || c < 0 || r >= _rows || c >= _cols ) then exit fn\\n if ( mda_integer(r,c) == _a ) then exit fn = YES\\nend fn = NO\\n\\n\\nvoid local fn ProcessCell( r as long, c as long )\\n long r1 = r, c1 = c, d(3), count, dir, opp\\n\\n while ( 1 )\\n BlockZero( @d(0), sizeof(long) * 4 )\\n count = 0\\n if ( fn CellAvailable( r - 1, c ) ) then d(count) = _t : count++\\n if ( fn CellAvailable( r, c - 1 ) ) then d(count) = _l : count++\\n if ( fn CellAvailable( r + 1, c ) ) then d(count) = _b : count++\\n if ( fn CellAvailable( r, c + 1 ) ) then d(count) = _r : count++\\n if ( count == 0 ) then break\\n\\n dir = d(rnd(count)-1)\\n mda(r,c) = @(mda_integer(r,c) - dir)\\n\\n select ( dir )\\n case _t\\n r1 = r-1 : opp = _b\\n case _l\\n c1 = c-1 : opp = _r\\n case _b\\n r1 = r+1 : opp = _t\\n case _r\\n c1 = c+1 : opp = _l\\n end select\\n\\n mda(r1,c1) = @(mda_integer(r1,c1) - opp)\\n fn ProcessCell( r1, c1 )\\n wend\\nend fn\\n\\n\\nvoid local fn DrawMaze\\n long r, c, x = _mgn, y = _mgn, value\\n\\n pen 2,, NSLineCapStyleRound\\n\\n for r = 0 to _rows - 1\\n for c = 0 to _cols - 1\\n value = mda(r,c)\\n if ( value & _t ) then line x, y to x + _size, y\\n if ( value & _l ) then line x, y to x, y + _size\\n if ( value & _b ) then line x, y + _size to x + _size, y + _size\\n if ( value & _r ) then line x + _size, y to x + _size, y + _size\\n x += _size\\n next\\n x = _mgn\\n y += _size\\n next\\nend fn\\n\\n\\nvoid local fn BuildMaze\\n long r, c\\n\\n for r = 0 to _rows - 1\\n for c = 0 to _cols - 1\\n mda(r,c) = _a\\n next\\n next\\n\\n random\\n r = rnd(_rows) - 1\\n c = rnd(_cols) - 1\\n fn ProcessCell( r, c )\\n fn DrawMaze\\nend fn\\n\\nfn BuildWindow\\nfn BuildMaze\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bytes\\\"\\n \\\"fmt\\\"\\n \\\"math/rand\\\"\\n \\\"time\\\"\\n)\\n\\ntype maze struct {\\n c []byte // cell contents\\n h []byte // horizontal walls above cells\\n v []byte // vertical walls to the left of cells\\n c2 [][]byte // cells by row\\n h2 [][]byte // horizontal walls by row (ignore first row)\\n v2 [][]byte // vertical walls by row (ignore first of each column)\\n}\\n\\nfunc newMaze(rows, cols int) *maze {\\n c := make([]byte, rows*cols) // all cells\\n h := bytes.Repeat([]byte{'-'}, rows*cols) // all horizontal walls\\n v := bytes.Repeat([]byte{'|'}, rows*cols) // all vertical walls\\n c2 := make([][]byte, rows) // cells by row\\n h2 := make([][]byte, rows) // horizontal walls by row\\n v2 := make([][]byte, rows) // vertical walls by row\\n for i := range h2 {\\n c2[i] = c[i*cols : (i+1)*cols]\\n h2[i] = h[i*cols : (i+1)*cols]\\n v2[i] = v[i*cols : (i+1)*cols]\\n }\\n return &maze{c, h, v, c2, h2, v2}\\n}\\n\\nfunc (m *maze) String() string {\\n hWall := []byte(\\\"+---\\\")\\n hOpen := []byte(\\\"+ \\\")\\n vWall := []byte(\\\"| \\\")\\n vOpen := []byte(\\\" \\\")\\n rightCorner := []byte(\\\"+\\\\n\\\")\\n rightWall := []byte(\\\"|\\\\n\\\")\\n var b []byte\\n // for all rows\\n for r, hw := range m.h2 {\\n // draw h walls\\n for _, h := range hw {\\n if h == '-' || r == 0 {\\n b = append(b, hWall...)\\n } else {\\n b = append(b, hOpen...)\\n }\\n }\\n b = append(b, rightCorner...)\\n // draw v walls\\n for c, vw := range m.v2[r] {\\n if vw == '|' || c == 0 {\\n b = append(b, vWall...)\\n } else {\\n b = append(b, vOpen...)\\n }\\n // draw cell contents\\n if m.c2[r][c] != 0 {\\n b[len(b)-2] = m.c2[r][c]\\n }\\n }\\n b = append(b, rightWall...)\\n }\\n // draw bottom edge of maze\\n for _ = range m.h2[0] {\\n b = append(b, hWall...)\\n }\\n b = append(b, rightCorner...)\\n return string(b)\\n}\\n\\nfunc (m *maze) gen() {\\n m.g2(rand.Intn(len(m.c2)), rand.Intn(len(m.c2[0])))\\n}\\n\\nconst (\\n up = iota\\n dn\\n rt\\n lf\\n)\\n\\nfunc (m *maze) g2(r, c int) {\\n m.c2[r][c] = ' '\\n for _, dir := range rand.Perm(4) {\\n switch dir {\\n case up:\\n if r > 0 && m.c2[r-1][c] == 0 {\\n m.h2[r][c] = 0\\n m.g2(r-1, c)\\n }\\n case lf:\\n if c > 0 && m.c2[r][c-1] == 0 {\\n m.v2[r][c] = 0\\n m.g2(r, c-1)\\n }\\n case dn:\\n if r < len(m.c2)-1 && m.c2[r+1][c] == 0 {\\n m.h2[r+1][c] = 0\\n m.g2(r+1, c)\\n }\\n case rt:\\n if c < len(m.c2[0])-1 && m.c2[r][c+1] == 0 {\\n m.v2[r][c+1] = 0\\n m.g2(r, c+1)\\n }\\n }\\n }\\n}\\n\\nfunc main() {\\n rand.Seed(time.Now().UnixNano())\\n m := newMaze(4, 6)\\n m.gen()\\n fmt.Print(m)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"{-# LANGUAGE FlexibleContexts #-}\\n{-# LANGUAGE TypeFamilies #-}\\n\\nimport Data.Array.ST\\n (STArray, freeze, newArray, readArray, writeArray)\\nimport Data.STRef (STRef, newSTRef, readSTRef, writeSTRef)\\nimport System.Random (Random(..), getStdGen, StdGen)\\nimport Control.Monad (forM_, unless)\\nimport Control.Monad.ST (ST, stToIO)\\nimport Data.Array (Array, (!), bounds)\\nimport Data.Bool (bool)\\n\\nrand\\n :: Random a\\n => (a, a) -> STRef s StdGen -> ST s a\\nrand range gen = do\\n (a, g) <- randomR range <$> readSTRef gen\\n gen `writeSTRef` g\\n return a\\n\\ndata Maze = Maze\\n { rightWalls, belowWalls :: Array (Int, Int) Bool\\n }\\n\\nmaze :: Int -> Int -> StdGen -> ST s Maze\\nmaze width height gen = do\\n visited <- mazeArray False\\n rWalls <- mazeArray True\\n bWalls <- mazeArray True\\n gen <- newSTRef gen\\n (,) <$> rand (0, maxX) gen <*> rand (0, maxY) gen >>=\\n visit gen visited rWalls bWalls\\n Maze <$> freeze rWalls <*> freeze bWalls\\n where\\n visit gen visited rWalls bWalls here = do\\n writeArray visited here True\\n let ns = neighbors here\\n i <- rand (0, length ns - 1) gen\\n forM_ (ns !! i : take i ns ++ drop (i + 1) ns) $\\n \\\\there -> do\\n seen <- readArray visited there\\n unless seen $\\n do removeWall here there\\n visit gen visited rWalls bWalls there\\n where\\n removeWall (x1, y1) (x2, y2) =\\n writeArray (bool rWalls bWalls (x1 == x2)) (min x1 x2, min y1 y2) False\\n neighbors (x, y) =\\n bool [(x - 1, y)] [] (0 == x) ++\\n bool [(x + 1, y)] [] (maxX == x) ++\\n bool [(x, y - 1)] [] (0 == y) ++ bool [(x, y + 1)] [] (maxY == y)\\n maxX = width - 1\\n maxY = height - 1\\n mazeArray =\\n newArray ((0, 0), (maxX, maxY)) :: Bool -> ST s (STArray s (Int, Int) Bool)\\n\\nprintMaze :: Maze -> IO ()\\nprintMaze (Maze rWalls bWalls) = do\\n putStrLn $ '+' : concat (replicate (maxX + 1) \\\"---+\\\")\\n forM_ [0 .. maxY] $\\n \\\\y -> do\\n putStr \\\"|\\\"\\n forM_ [0 .. maxX] $\\n \\\\x -> do\\n putStr \\\" \\\"\\n putStr $ bool \\\" \\\" \\\"|\\\" (rWalls ! (x, y))\\n putStrLn \\\"\\\"\\n forM_ [0 .. maxX] $\\n \\\\x -> do\\n putStr \\\"+\\\"\\n putStr $ bool \\\" \\\" \\\"---\\\" (bWalls ! (x, y))\\n putStrLn \\\"+\\\"\\n where\\n maxX = fst (snd $ bounds rWalls)\\n maxY = snd (snd $ bounds rWalls)\\n\\nmain :: IO ()\\nmain = getStdGen >>= stToIO . maze 11 8 >>= printMaze\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Algorithms as algo;\\nimport Mathematics as math;\\nimport Terminal as term;\\n\\nclass Maze {\\n\\t_rows = none;\\n\\t_cols = none;\\n\\t_data = none;\\n\\tconstructor( rows_, cols_ ) {\\n\\t\\t_rows = ( rows_ / 2 ) * 2 - 1;\\n\\t\\t_cols = ( cols_ / 2 ) * 2 - 1;\\n\\t\\t_data = [].resize( _rows + 2, [].resize( _cols + 2, false ) );\\n\\t\\tx = 0;\\n\\t\\ty = 0;\\n\\t\\tpath = [];\\n\\t\\trng = math.Randomizer( math.Randomizer.DISTRIBUTION.DISCRETE, 0, integer( $2 ^ $63 - $1 ) );\\n\\t\\tfor ( _ : algo.range( _rows * _cols / 3 ) ) {\\n\\t\\t\\t_data[y + 1][x + 1] = true;\\n\\t\\t\\twhile ( true ) {\\n\\t\\t\\t\\tn = neighbours( y, x );\\n\\t\\t\\t\\tns = size( n );\\n\\t\\t\\t\\tif ( ns == 0 ) {\\n\\t\\t\\t\\t\\tif ( size( path ) == 0 ) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\ty, x = path[-1];\\n\\t\\t\\t\\t\\tpath.pop();\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\toy, ox = ( y, x );\\n\\t\\t\\t\\ty, x = n[rng.next() % ns];\\n\\t\\t\\t\\t_data[(y + oy) / 2 + 1][(x + ox) / 2 + 1] = true;\\n\\t\\t\\t\\tpath.push( ( y, x ) );\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t_data[0][1] = true;\\n\\t\\t_data[-1][-2] = true;\\n\\t}\\n\\tneighbours( y_, x_ ) {\\n\\t\\tn = [];\\n\\t\\tif ( ( x_ > 1 ) && ! _data[y_ + 1][x_ - 1] ) {\\n\\t\\t\\tn.push( ( y_, x_ - 2 ) );\\n\\t\\t}\\n\\t\\tif ( ( y_ > 1 ) && ! _data[y_ - 1][x_ + 1] ) {\\n\\t\\t\\tn.push( ( y_ - 2, x_ ) );\\n\\t\\t}\\n\\t\\tif ( ( x_ < ( _cols - 2 ) ) && ! _data[y_ + 1][x_ + 3] ) {\\n\\t\\t\\tn.push( ( y_, x_ + 2 ) );\\n\\t\\t}\\n\\t\\tif ( ( y_ < ( _rows - 2 ) ) && ! _data[y_ + 3][x_ + 1] ) {\\n\\t\\t\\tn.push( ( y_ + 2, x_ ) );\\n\\t\\t}\\n\\t\\treturn ( n );\\n\\t}\\n\\tto_string() {\\n\\t\\ts = \\\"\\\";\\n\\t\\tfor ( r : _data ) {\\n\\t\\t\\ts += ∑( algo.map( r, @( b ) { b ? \\\" \\\" : \\\"#\\\"; } ) );\\n\\t\\t\\ts += \\\"\\\\n\\\";\\n\\t\\t}\\n\\t\\treturn ( s );\\n\\t}\\n}\\n\\nmain() {\\n\\trows = term.lines() - 2;\\n\\tcols = term.columns() - 1;\\n\\tmaze = Maze( rows, cols );\\n\\tprint( \\\"{}\\\".format( maze ) );\\n}\\n\",\n \"language\": \"Huginn\"\n },\n {\n \"code\": \"link printf\\n\\nprocedure main(A) # generate rows x col maze\\n /mh := \\\\A[1] | 12 # or take defaults 12 x 16\\n /mw := \\\\A[2] | 16\\n mz := DisplayMaze(GenerateMaze(mh,mw))\\n WriteImage(mz.filename) # save file\\n WAttrib(mz.window,\\\"canvas=normal\\\") # show maze in hidden window\\n until Event() == &lpress # wait for left mouse press\\n close(mz.window)\\nend\\n\\n$define FINISH 64 # exit\\n$define START 32 # entrance\\n$define PATH 128\\n$define SEEN 16 # bread crumbs for generator\\n$define NORTH 8 # sides ...\\n$define EAST 4\\n$define SOUTH 2\\n$define WEST 1\\n$define EMPTY 0 # like new\\n\\nprocedure GenerateMaze(r,c) #: Depth First Maze Generation\\nstatic maze,h,w,rd\\n if /maze then { # BEGING - No maze yet\\n /h := integer(1 < r) | runerr(r,205) # valid size 2x2 or better\\n /w := integer(1 < c) | runerr(r,205)\\n every !(maze := list(h)) := list(w,EMPTY) # shinny new empty maze\\n start := [?h,?w,?4-1,START] # random [r,c] start & finish\\n finish := [?h,?w,(start[3]+2)%4,FINISH] # w/ opposite side exponent\\n every x := start | finish do {\\n case x[3] := 2 ^ x[3] of { # get side from exponent and\\n NORTH : x[1] := 1 # project r,c to selected edge\\n EAST : x[2] := w\\n SOUTH : x[1] := h\\n WEST : x[2] := 1\\n }\\n maze[x[1],x[2]] +:= x[3] + x[4] # transcribe s/f to maze\\n }\\n rd := [NORTH, EAST, SOUTH, WEST] # initial list of directions\\n GenerateMaze(start[1],start[2]) # recurse through maze\\n return 1(.maze,maze := &null) # return maze, reset for next\\n }\\n else { # ----------------------- recursed to clear insize of maze\\n if iand(maze[r,c],SEEN) = 0 then { # in bounds and not SEEN yet?\\n maze[r,c] +:= SEEN # Mark current cell as visited\\n every !rd :=: ?rd # randomize list of directions\\n every d := !rd do\\n case d of { # try all, succeed & clear wall\\n NORTH : maze[r,c] +:= ( GenerateMaze(r-1,c), NORTH)\\n EAST : maze[r,c] +:= ( GenerateMaze(r,c+1), EAST)\\n SOUTH : maze[r,c] +:= ( GenerateMaze(r+1,c), SOUTH)\\n WEST : maze[r,c] +:= ( GenerateMaze(r,c-1), WEST)\\n }\\n return # signal success to caller\\n }\\n }\\nend\\n\\n$define CELL 20 # cell size in pixels\\n$define BORDER 30 # border size in pixels\\n\\nrecord mazeinfo(window,maze,filename) # keepers\\n\\nprocedure DisplayMaze(maze) #: show it off\\nif CELL < 8 then runerr(205,CELL) # too small\\n\\nwh := (ch := (mh := *maze ) * CELL) + 2 * BORDER # win, cell, maze height\\nww := (cw := (mw := *maze[1]) * CELL) + 2 * BORDER # win, cell, maze width\\n\\nwparms := [ sprintf(\\\"Maze %dx%d\\\",*maze,*maze[1]), # window parameters\\n \\\"g\\\",\\\"bg=white\\\",\\\"canvas=hidden\\\",\\n sprintf(\\\"size=%d,%d\\\",ww,wh),\\n sprintf(\\\"dx=%d\\\",BORDER),\\n sprintf(\\\"dy=%d\\\",BORDER)]\\n\\n&window := open!wparms | stop(\\\"Unable to open Window\\\")\\n\\nFg(\\\"black\\\") # Draw full grid\\nevery DrawLine(x := 0 to cw by CELL,0,x,ch+1) # . verticals\\nevery DrawLine(0,y := 0 to ch by CELL,cw+1,y) # . horizontals\\n\\nFg(\\\"white\\\") # Set to erase lines\\nevery y := CELL*((r := 1 to mh)-1) & x := CELL*((c := 1 to mw)-1) do {\\n WAttrib(\\\"dx=\\\"||x+BORDER,\\\"dy=\\\"||y+BORDER) # position @ cell r,c\\n if iand(maze[r,c],NORTH) > 0 then DrawLine(2,0,CELL-1,0)\\n if iand(maze[r,c],EAST) > 0 then DrawLine(CELL,2,CELL,CELL-1)\\n if iand(maze[r,c],SOUTH) > 0 then DrawLine(2,CELL,CELL-1,CELL)\\n if iand(maze[r,c],WEST) > 0 then DrawLine(0,2,0,CELL-1)\\n }\\n\\nreturn mazeinfo(&window,maze,sprintf(\\\"maze-%dx%d-%d.gif\\\",r,c,&now))\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"maze=:4 :0\\n assert.0<:n=.<:x*y\\n horiz=. 0$~x,y-1\\n verti=. 0$~(x-1),y\\n path=.,:here=. ?x,y\\n unvisited=.0 (<here+1)} 0,0,~|:0,0,~1$~y,x\\n while.n do.\\n neighbors=. here+\\\"1 (,-)=0 1\\n neighbors=. neighbors #~ (<\\\"1 neighbors+1) {unvisited\\n if.#neighbors do.\\n n=.n-1\\n next=. ({~ ?@#) neighbors\\n unvisited=.0 (<next+1)} unvisited\\n if.{.next=here\\n do. horiz=.1 (<-:here+next-0 1)} horiz\\n else. verti=. 1 (<-:here+next-1 0)} verti end.\\n path=.path,here=.next\\n else.\\n here=.{:path\\n path=.}:path\\n end.\\n end.\\n horiz;verti\\n)\\n\\ndisplay=:3 :0\\n size=. >.&$&>/y\\n text=. (}:1 3$~2*1+{:size)#\\\"1\\\":size$<' '\\n 'hdoor vdoor'=. 2 4&*&.>&.> (#&,{@;&i./@$)&.> y\\n ' ' (a:-.~0 1;0 2; 0 3;(2 1-~$text);(1 4&+&.> hdoor),,vdoor+&.>\\\"0/2 1;2 2;2 3)} text\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" display 8 maze 11\\n+ +---+---+---+---+---+---+---+---+---+---+\\n| | | | |\\n+ + + + +---+ + +---+---+ + +\\n| | | | | | | |\\n+ +---+---+ + +---+---+---+ + + +\\n| | | | | | |\\n+---+ +---+ + + +---+ + +---+---+\\n| | | | | | |\\n+ + +---+---+ +---+ + +---+---+ +\\n| | | | | | | | |\\n+ +---+ + + + + +---+---+ + +\\n| | | | |\\n+ +---+---+---+---+---+---+---+ +---+ +\\n| | | | | | | | |\\n+ + + + + + + + +---+ + +\\n| | | | |\\n+---+---+---+---+---+---+---+---+---+---+---+\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"package org.rosettacode;\\n\\nimport java.util.Collections;\\nimport java.util.Arrays;\\n\\n/*\\n * recursive backtracking algorithm\\n * shamelessly borrowed from the ruby at\\n * http://weblog.jamisbuck.org/2010/12/27/maze-generation-recursive-backtracking\\n */\\npublic class MazeGenerator {\\n\\tprivate final int x;\\n\\tprivate final int y;\\n\\tprivate final int[][] maze;\\n\\n\\tpublic MazeGenerator(int x, int y) {\\n\\t\\tthis.x = x;\\n\\t\\tthis.y = y;\\n\\t\\tmaze = new int[this.x][this.y];\\n\\t\\tgenerateMaze(0, 0);\\n\\t}\\n\\n\\tpublic void display() {\\n\\t\\tfor (int i = 0; i < y; i++) {\\n\\t\\t\\t// draw the north edge\\n\\t\\t\\tfor (int j = 0; j < x; j++) {\\n\\t\\t\\t\\tSystem.out.print((maze[j][i] & 1) == 0 ? \\\"+---\\\" : \\\"+ \\\");\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println(\\\"+\\\");\\n\\t\\t\\t// draw the west edge\\n\\t\\t\\tfor (int j = 0; j < x; j++) {\\n\\t\\t\\t\\tSystem.out.print((maze[j][i] & 8) == 0 ? \\\"| \\\" : \\\" \\\");\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println(\\\"|\\\");\\n\\t\\t}\\n\\t\\t// draw the bottom line\\n\\t\\tfor (int j = 0; j < x; j++) {\\n\\t\\t\\tSystem.out.print(\\\"+---\\\");\\n\\t\\t}\\n\\t\\tSystem.out.println(\\\"+\\\");\\n\\t}\\n\\n\\tprivate void generateMaze(int cx, int cy) {\\n\\t\\tDIR[] dirs = DIR.values();\\n\\t\\tCollections.shuffle(Arrays.asList(dirs));\\n\\t\\tfor (DIR dir : dirs) {\\n\\t\\t\\tint nx = cx + dir.dx;\\n\\t\\t\\tint ny = cy + dir.dy;\\n\\t\\t\\tif (between(nx, x) && between(ny, y)\\n\\t\\t\\t\\t\\t&& (maze[nx][ny] == 0)) {\\n\\t\\t\\t\\tmaze[cx][cy] |= dir.bit;\\n\\t\\t\\t\\tmaze[nx][ny] |= dir.opposite.bit;\\n\\t\\t\\t\\tgenerateMaze(nx, ny);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprivate static boolean between(int v, int upper) {\\n\\t\\treturn (v >= 0) && (v < upper);\\n\\t}\\n\\n\\tprivate enum DIR {\\n\\t\\tN(1, 0, -1), S(2, 0, 1), E(4, 1, 0), W(8, -1, 0);\\n\\t\\tprivate final int bit;\\n\\t\\tprivate final int dx;\\n\\t\\tprivate final int dy;\\n\\t\\tprivate DIR opposite;\\n\\n\\t\\t// use the static initializer to resolve forward references\\n\\t\\tstatic {\\n\\t\\t\\tN.opposite = S;\\n\\t\\t\\tS.opposite = N;\\n\\t\\t\\tE.opposite = W;\\n\\t\\t\\tW.opposite = E;\\n\\t\\t}\\n\\n\\t\\tprivate DIR(int bit, int dx, int dy) {\\n\\t\\t\\tthis.bit = bit;\\n\\t\\t\\tthis.dx = dx;\\n\\t\\t\\tthis.dy = dy;\\n\\t\\t}\\n\\t};\\n\\n\\tpublic static void main(String[] args) {\\n\\t\\tint x = args.length >= 1 ? (Integer.parseInt(args[0])) : 8;\\n\\t\\tint y = args.length == 2 ? (Integer.parseInt(args[1])) : 8;\\n\\t\\tMazeGenerator maze = new MazeGenerator(x, y);\\n\\t\\tmaze.display();\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function maze(x,y) {\\n\\tvar n=x*y-1;\\n\\tif (n<0) {alert(\\\"illegal maze dimensions\\\");return;}\\n\\tvar horiz =[]; for (var j= 0; j<x+1; j++) horiz[j]= [],\\n\\t verti =[]; for (var j= 0; j<x+1; j++) verti[j]= [],\\n\\t here = [Math.floor(Math.random()*x), Math.floor(Math.random()*y)],\\n\\t path = [here],\\n\\t unvisited = [];\\n\\tfor (var j = 0; j<x+2; j++) {\\n\\t\\tunvisited[j] = [];\\n\\t\\tfor (var k= 0; k<y+1; k++)\\n\\t\\t\\tunvisited[j].push(j>0 && j<x+1 && k>0 && (j != here[0]+1 || k != here[1]+1));\\n\\t}\\n\\twhile (0<n) {\\n\\t\\tvar potential = [[here[0]+1, here[1]], [here[0],here[1]+1],\\n\\t\\t [here[0]-1, here[1]], [here[0],here[1]-1]];\\n\\t\\tvar neighbors = [];\\n\\t\\tfor (var j = 0; j < 4; j++)\\n\\t\\t\\tif (unvisited[potential[j][0]+1][potential[j][1]+1])\\n\\t\\t\\t\\tneighbors.push(potential[j]);\\n\\t\\tif (neighbors.length) {\\n\\t\\t\\tn = n-1;\\n\\t\\t\\tnext= neighbors[Math.floor(Math.random()*neighbors.length)];\\n\\t\\t\\tunvisited[next[0]+1][next[1]+1]= false;\\n\\t\\t\\tif (next[0] == here[0])\\n\\t\\t\\t\\thoriz[next[0]][(next[1]+here[1]-1)/2]= true;\\n\\t\\t\\telse\\n\\t\\t\\t\\tverti[(next[0]+here[0]-1)/2][next[1]]= true;\\n\\t\\t\\tpath.push(here = next);\\n\\t\\t} else\\n\\t\\t\\there = path.pop();\\n\\t}\\n\\treturn {x: x, y: y, horiz: horiz, verti: verti};\\n}\\n\\nfunction display(m) {\\n\\tvar text= [];\\n\\tfor (var j= 0; j<m.x*2+1; j++) {\\n\\t\\tvar line= [];\\n\\t\\tif (0 == j%2)\\n\\t\\t\\tfor (var k=0; k<m.y*4+1; k++)\\n\\t\\t\\t\\tif (0 == k%4)\\n\\t\\t\\t\\t\\tline[k]= '+';\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tif (j>0 && m.verti[j/2-1][Math.floor(k/4)])\\n\\t\\t\\t\\t\\t\\tline[k]= ' ';\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tline[k]= '-';\\n\\t\\telse\\n\\t\\t\\tfor (var k=0; k<m.y*4+1; k++)\\n\\t\\t\\t\\tif (0 == k%4)\\n\\t\\t\\t\\t\\tif (k>0 && m.horiz[(j-1)/2][k/4-1])\\n\\t\\t\\t\\t\\t\\tline[k]= ' ';\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tline[k]= '|';\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tline[k]= ' ';\\n\\t\\tif (0 == j) line[1]= line[2]= line[3]= ' ';\\n\\t\\tif (m.x*2-1 == j) line[4*m.y]= ' ';\\n\\t\\ttext.push(line.join('')+'\\\\r\\\\n');\\n\\t}\\n\\treturn text.join('');\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"<html><head><title></title></head><body><pre id=\\\"out\\\"></pre></body></html>\\n<script type=\\\"text/javascript\\\">\\n/* ABOVE CODE GOES HERE */\\ndocument.getElementById('out').innerHTML= display(maze(8,11));\\n</script>\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"\\tfunction step() {\\n\\t\\tif (0<n) {\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"\\t\\t\\tdocument.getElementById('out').innerHTML= display({x: x, y: y, horiz: horiz, verti: verti, here: here});\\n\\t\\t\\tsetTimeout(step, 100);\\n\\t\\t}\\n\\t}\\n\\tstep();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"\\t\\t\\t\\tif (m.here && m.here[0]*2+1 == j && m.here[1]*4+2 == k)\\n\\t\\t\\t\\t\\tline[k]= '#'\\n\\t\\t\\t\\telse if (0 == k%4) {\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"\\t\\t\\there= next;\\n\\t\\t\\tif (1 < neighbors.length)\\n\\t\\t\\t\\tpath.push(here);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"<html><head><title>Maze maker</title>\\n<style type=\\\"text/css\\\">\\ntable { border-collapse: collapse }\\ntd { width: 1em; height: 1em; border: 1px solid }\\ntd.s { border-bottom: none }\\ntd.n { border-top: none }\\ntd.w { border-left: none }\\ntd.e { border-right: none }\\ntd.v { background: skyblue}\\n</style>\\n<script type=\\\"application/javascript\\\">\\nNode.prototype.add = function(tag, cnt, txt) {\\n\\tfor (var i = 0; i < cnt; i++)\\n\\t\\tthis.appendChild(ce(tag, txt));\\n}\\nNode.prototype.ins = function(tag) {\\n\\tthis.insertBefore(ce(tag), this.firstChild)\\n}\\nNode.prototype.kid = function(i) { return this.childNodes[i] }\\nNode.prototype.cls = function(t) { this.className += ' ' + t }\\n\\nNodeList.prototype.map = function(g) {\\n\\tfor (var i = 0; i < this.length; i++) g(this[i]);\\n}\\n\\nfunction ce(tag, txt) {\\n\\tvar x = document.createElement(tag);\\n\\tif (txt !== undefined) x.innerHTML = txt;\\n\\treturn x\\n}\\n\\nfunction gid(e) { return document.getElementById(e) }\\nfunction irand(x) { return Math.floor(Math.random() * x) }\\n\\nfunction make_maze() {\\n\\tvar w = parseInt(gid('rows').value || 8, 10);\\n\\tvar h = parseInt(gid('cols').value || 8, 10);\\n\\tvar tbl = gid('maze');\\n\\ttbl.innerHTML = '';\\n\\ttbl.add('tr', h);\\n\\ttbl.childNodes.map(function(x) {\\n\\t\\t\\tx.add('th', 1);\\n\\t\\t\\tx.add('td', w, '*');\\n\\t\\t\\tx.add('th', 1)});\\n\\ttbl.ins('tr');\\n\\ttbl.add('tr', 1);\\n\\ttbl.firstChild.add('th', w + 2);\\n\\ttbl.lastChild.add('th', w + 2);\\n\\tfor (var i = 1; i <= h; i++) {\\n\\t\\tfor (var j = 1; j <= w; j++) {\\n\\t\\t\\ttbl.kid(i).kid(j).neighbors = [\\n\\t\\t\\t\\ttbl.kid(i + 1).kid(j),\\n\\t\\t\\t\\ttbl.kid(i).kid(j + 1),\\n\\t\\t\\t\\ttbl.kid(i).kid(j - 1),\\n\\t\\t\\t\\ttbl.kid(i - 1).kid(j)\\n\\t\\t\\t];\\n\\t\\t}\\n\\t}\\n\\twalk(tbl.kid(irand(h) + 1).kid(irand(w) + 1));\\n\\tgid('solve').style.display='inline';\\n}\\n\\nfunction shuffle(x) {\\n\\tfor (var i = 3; i > 0; i--) {\\n\\t\\tj = irand(i + 1);\\n\\t\\tif (j == i) continue;\\n\\t\\tvar t = x[j]; x[j] = x[i]; x[i] = t;\\n\\t}\\n\\treturn x;\\n}\\n\\nvar dirs = ['s', 'e', 'w', 'n'];\\nfunction walk(c) {\\n\\tc.innerHTML = ' ';\\n\\tvar idx = shuffle([0, 1, 2, 3]);\\n\\tfor (var j = 0; j < 4; j++) {\\n\\t\\tvar i = idx[j];\\n\\t\\tvar x = c.neighbors[i];\\n\\t\\tif (x.textContent != '*') continue;\\n\\t\\tc.cls(dirs[i]), x.cls(dirs[3 - i]);\\n\\t\\twalk(x);\\n\\t}\\n}\\n\\nfunction solve(c, t) {\\n\\tif (c === undefined) {\\n\\t\\tc = gid('maze').kid(1).kid(1);\\n\\t\\tc.cls('v');\\n\\t}\\n\\tif (t === undefined)\\n\\t\\tt = gid('maze')\\t.lastChild.previousSibling\\n\\t\\t\\t\\t.lastChild.previousSibling;\\n\\n\\tif (c === t) return 1;\\n\\tc.vis = 1;\\n\\tfor (var i = 0; i < 4; i++) {\\n\\t\\tvar x = c.neighbors[i];\\n\\t\\tif (x.tagName.toLowerCase() == 'th') continue;\\n\\t\\tif (x.vis || !c.className.match(dirs[i]) || !solve(x, t))\\n\\t\\t\\tcontinue;\\n\\n\\t\\tx.cls('v');\\n\\t\\treturn 1;\\n\\t}\\n\\tc.vis = null;\\n\\treturn 0;\\n}\\n\\n</script></head>\\n<body><form><fieldset>\\n<label>rows </label><input id='rows' size=\\\"3\\\"/>\\n<label>colums </label><input id='cols' size=\\\"3\\\"/>\\n<a href=\\\"javascript:make_maze()\\\">Generate</a>\\n<a id='solve' style='display:none' href='javascript:solve(); void(0)'>Solve</a>\\n</fieldset></form><table id='maze'/></body></html>\\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 | (($n-1)|tostring|length) as $w\\n | [limit($w; inputs)] | join(\\\"\\\") | tonumber\\n | if . < $n then . else ($n | prn) end\\n end;\\n\\n# Input: an array\\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# Compass is a JSON object {n,s,e,w} representing the four possible\\n# directions in which to move, i.e. to open a gate.\\n# For example, Compass.n corresponds to a move north (i.e. dx is 0, dy is 1),\\n# and Compass.n.gates[\\\"N\\\"] is true indicating that the \\\"northern\\\" gate should be opened.\\ndef Compass:\\n {n: { gates: {\\\"N\\\": true}, dx: 0, dy: -1},\\n s: { gates: {\\\"S\\\": true}, dx: 0, dy: 1},\\n e: { gates: {\\\"E\\\": true}, dx: 1, dy: 0},\\n w: { gates: {\\\"W\\\": true}, dx:-1, dy: 0} }\\n | .n.opposite = .s\\n | .s.opposite = .n\\n | .e.opposite = .w\\n | .w.opposite = .e\\n;\\n\\n# Produce a matrix representing an $x x $y maze.\\n# .[$i][$j] represents the box in row $i, column $j.\\n# Initially, all the gates of all the boxes are closed.\\ndef MazeMatrix($x; $y):\\n [range(0;$x) | {} ] as $v | [range(0;$y) | $v];\\n\\n# Input: a MazeMatrix\\ndef generate($cx; $cy):\\n def interior($a; $upper): $a >= 0 and $a < $upper;\\n length as $x\\n | (.[0]|length) as $y\\n | Compass as $Compass\\n | ([$Compass.n, $Compass.s, $Compass.e, $Compass.w] | knuthShuffle) as $directions\\n | reduce $directions[] as $v (.;\\n ($cx + $v.dx) as $nx\\n | ($cy + $v.dy) as $ny\\n | if interior($nx; $x) and interior($ny; $y) and .[$nx][$ny] == {}\\n then .[$cx][$cy] += $v.gates\\n | .[$nx][$ny] += $v.opposite.gates\\n | generate($nx; $ny)\\n end );\\n\\n# Input: a MazeMatrix\\ndef display:\\n . as $maze\\n | ($maze|length) as $x\\n | ($maze[0]|length) as $y\\n | ( range(0;$y) as $i\\n # draw the north edge\\n | ([range(0;$x) as $j\\n | if $maze[$j][$i][\\\"N\\\"] then \\\"+ \\\" else \\\"+---\\\" end] | join(\\\"\\\")) + \\\"+\\\",\\n # draw the west edge\\n ([range(0;$x) as $j\\n | if $maze[$j][$i][\\\"W\\\"] then \\\" \\\" else \\\"| \\\" end] | join(\\\"\\\")) + \\\"|\\\" ),\\n # draw the bottom line\\n ($x * \\\"+---\\\") + \\\"+\\\"\\n;\\n\\n# Start the walk at the top left\\ndef amaze($x;$y):\\n MazeMatrix($x; $y)\\n | generate(0; 0)\\n | display;\\n\\n# Example\\namaze(4; 5);\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Random\\ncheck(bound::Vector) = cell -> all([1, 1] .≤ cell .≤ bound)\\nneighbors(cell::Vector, bound::Vector, step::Int=2) =\\n filter(check(bound), map(dir -> cell + step * dir, [[0, 1], [-1, 0], [0, -1], [1, 0]]))\\n\\nfunction walk(maze::Matrix, nxtcell::Vector, visited::Vector=[])\\n push!(visited, nxtcell)\\n for neigh in shuffle(neighbors(nxtcell, collect(size(maze))))\\n if neigh ∉ visited\\n maze[round.(Int, (nxtcell + neigh) / 2)...] = 0\\n walk(maze, neigh, visited)\\n end\\n end\\n maze\\nend\\nfunction maze(w::Int, h::Int)\\n maze = collect(i % 2 | j % 2 for i in 1:2w+1, j in 1:2h+1)\\n firstcell = 2 * [rand(1:w), rand(1:h)]\\n return walk(maze, firstcell)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"pprint(matrix) = for i = 1:size(matrix, 1) println(join(matrix[i, :])) end\\nfunction printmaze(maze)\\n walls = split(\\\"╹ ╸ ┛ ╺ ┗ ━ ┻ ╻ ┃ ┓ ┫ ┏ ┣ ┳ ╋\\\")\\n h, w = size(maze)\\n f = cell -> 2 ^ ((3cell[1] + cell[2] + 3) / 2)\\n wall(i, j) = if maze[i,j] == 0 \\\" \\\" else\\n walls[Int(sum(f, filter(x -> maze[x...] != 0, neighbors([i, j], [h, w], 1)) .- [[i, j]]))]\\n end\\n mazewalls = collect(wall(i, j) for i in 1:2:h, j in 1:w)\\n pprint(mazewalls)\\nend\\n\\nprintmaze(maze(10, 10))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import java.util.*\\n\\nclass MazeGenerator(val x: Int, val y: Int) {\\n private val maze = Array(x) { IntArray(y) }\\n\\n fun generate(cx: Int, cy: Int) {\\n Direction.values().shuffle().forEach {\\n val nx = cx + it.dx\\n val ny = cy + it.dy\\n if (between(nx, x) && between(ny, y) && maze[nx][ny] == 0) {\\n maze[cx][cy] = maze[cx][cy] or it.bit\\n maze[nx][ny] = maze[nx][ny] or it.opposite!!.bit\\n generate(nx, ny)\\n }\\n }\\n }\\n\\n fun display() {\\n for (i in 0..y - 1) {\\n // draw the north edge\\n for (j in 0..x - 1)\\n print(if (maze[j][i] and 1 == 0) \\\"+---\\\" else \\\"+ \\\")\\n println('+')\\n\\n // draw the west edge\\n for (j in 0..x - 1)\\n print(if (maze[j][i] and 8 == 0) \\\"| \\\" else \\\" \\\")\\n println('|')\\n }\\n\\n // draw the bottom line\\n for (j in 0..x - 1) print(\\\"+---\\\")\\n println('+')\\n }\\n\\n inline private fun <reified T> Array<T>.shuffle(): Array<T> {\\n val list = toMutableList()\\n Collections.shuffle(list)\\n return list.toTypedArray()\\n }\\n\\n private enum class Direction(val bit: Int, val dx: Int, val dy: Int) {\\n N(1, 0, -1), S(2, 0, 1), E(4, 1, 0),W(8, -1, 0);\\n\\n var opposite: Direction? = null\\n\\n companion object {\\n init {\\n N.opposite = S\\n S.opposite = N\\n E.opposite = W\\n W.opposite = E\\n }\\n }\\n }\\n\\n private fun between(v: Int, upper: Int) = v >= 0 && v < upper\\n}\\n\\nfun main(args: Array<String>) {\\n val x = if (args.size >= 1) args[0].toInt() else 8\\n val y = if (args.size == 2) args[1].toInt() else 8\\n with(MazeGenerator(x, y)) {\\n generate(0, 0)\\n display()\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"math.randomseed( os.time() )\\n\\n-- Fisher-Yates shuffle from http://santos.nfshost.com/shuffling.html\\nfunction shuffle(t)\\n for i = 1, #t - 1 do\\n local r = math.random(i, #t)\\n t[i], t[r] = t[r], t[i]\\n end\\nend\\n\\n-- builds a width-by-height grid of trues\\nfunction initialize_grid(w, h)\\n local a = {}\\n for i = 1, h do\\n table.insert(a, {})\\n for j = 1, w do\\n table.insert(a[i], true)\\n end\\n end\\n return a\\nend\\n\\n-- average of a and b\\nfunction avg(a, b)\\n return (a + b) / 2\\nend\\n\\n\\ndirs = {\\n {x = 0, y = -2}, -- north\\n {x = 2, y = 0}, -- east\\n {x = -2, y = 0}, -- west\\n {x = 0, y = 2}, -- south\\n}\\n\\nfunction make_maze(w, h)\\n w = w or 16\\n h = h or 8\\n\\n local map = initialize_grid(w*2+1, h*2+1)\\n\\n function walk(x, y)\\n map[y][x] = false\\n\\n local d = { 1, 2, 3, 4 }\\n shuffle(d)\\n for i, dirnum in ipairs(d) do\\n local xx = x + dirs[dirnum].x\\n local yy = y + dirs[dirnum].y\\n if map[yy] and map[yy][xx] then\\n map[avg(y, yy)][avg(x, xx)] = false\\n walk(xx, yy)\\n end\\n end\\n end\\n\\n walk(math.random(1, w)*2, math.random(1, h)*2)\\n\\n local s = {}\\n for i = 1, h*2+1 do\\n for j = 1, w*2+1 do\\n if map[i][j] then\\n table.insert(s, '#')\\n else\\n table.insert(s, ' ')\\n end\\n end\\n table.insert(s, '\\\\n')\\n end\\n return table.concat(s)\\nend\\n\\nprint(make_maze())\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Maze {\\n width% = 40\\n height% = 20\\n \\\\\\\\ we can use DIM maze$(0 to width%,0 to height%)=\\\"#\\\"\\n \\\\\\\\ so we can delete the two For loops\\n DIM maze$(0 to width%,0 to height%)\\n FOR x% = 0 TO width%\\n FOR y% = 0 TO height%\\n maze$(x%, y%) = \\\"#\\\"\\n NEXT y%\\n NEXT x%\\n\\n currentx% = INT(RND * (width% - 1))\\n currenty% = INT(RND * (height% - 1))\\n\\n IF currentx% MOD 2 = 0 THEN currentx%++\\n IF currenty% MOD 2 = 0 THEN currenty%++\\n maze$(currentx%, currenty%) = \\\" \\\"\\n\\n done% = 0\\n WHILE done% = 0 {\\n FOR i% = 0 TO 99\\n oldx% = currentx%\\n oldy% = currenty%\\n SELECT CASE INT(RND * 4)\\n CASE 0\\n IF currentx% + 2 < width% THEN currentx%+=2\\n CASE 1\\n IF currenty% + 2 < height% THEN currenty%+=2\\n CASE 2\\n IF currentx% - 2 > 0 THEN currentx%-=2\\n CASE 3\\n IF currenty% - 2 > 0 THEN currenty%-=2\\n END SELECT\\n IF maze$(currentx%, currenty%) = \\\"#\\\" Then {\\n maze$(currentx%, currenty%) = \\\" \\\"\\n maze$(INT((currentx% + oldx%) / 2), ((currenty% + oldy%) / 2)) = \\\" \\\"\\n }\\n NEXT i%\\n done% = 1\\n FOR x% = 1 TO width% - 1 STEP 2\\n FOR y% = 1 TO height% - 1 STEP 2\\n IF maze$(x%, y%) = \\\"#\\\" THEN done% = 0\\n NEXT y%\\n NEXT x%\\n }\\n\\n\\n FOR y% = 0 TO height%\\n FOR x% = 0 TO width%\\n PRINT maze$(x%, y%);\\n NEXT x%\\n PRINT\\n NEXT y%\\n}\\nMaze\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Module Maze2 {\\n \\\\\\\\ depth-first search\\n Profiler\\n Form 80,50\\n let w=60, h=40\\n Double\\n \\\\\\\\center proportional text double size\\n Report 2, Format$(\\\"Maze {0}x{1}\\\",w,h)\\n Normal\\n Refresh\\n Set Fast !\\n Dim maze$(1 to w+1, 1 to h+1)=\\\"#\\\"\\n Include=Lambda w,h (a,b) ->a>=1 and a<=w and b>=1 and b<=h\\n Flush ' empty stack\\n if random(1,2)=1 then {\\n entry=(if(random(1,2)=1->2, w),Random(1, h/2)*2)\\n } else {\\n entry=(random(1,w/2)*2,If(Random(1,2)=1->2,h))\\n }\\n maze$(entry#val(0), entry#val(1))=\\\" \\\"\\n forchoose=(,)\\n Push Entry\\n do {\\n do {\\n NewForChoose(!entry)\\n status=len(forchoose)\\n if status>0 then {\\n status--\\n forchoose=forchoose#val(random(0,status))\\n Push forchoose\\n OpenDoor(!Entry, !forchoose)\\n Rem : ShowMaze()\\n } else exit\\n entry=forchoose\\n } Always\\n if empty then exit\\n Read entry\\n } Always\\n ShowMaze()\\n Print timecount/1000\\n Sub NewForChoose(x,y)\\n Local x1=x-2, x2=x+2, y1=y-2, y2=y+2, arr=(,)\\n Stack New {\\n if include(x1,y) then if Maze$(x1,y)<>\\\" \\\" Then push (x1, y)\\n if include(x2,y) then if Maze$(x2,y)<>\\\" \\\" Then push (x2, y)\\n if include(x,y1) then if Maze$(x,y1)<>\\\" \\\" Then push (x, y1)\\n if include(x,y2) then if Maze$(x,y2)<>\\\" \\\" Then push (x, y2)\\n forchoose= Array([])\\n }\\n End Sub\\n Sub OpenDoor(x1,y1, x2,y2)\\n Local i\\n if x1=x2 then {\\n y1+=y2<=>y1\\n for i=y1 to y2 {maze$(x1, i)=\\\" \\\" }\\n } Else {\\n x1+=x2<=>x1\\n for i=x1 to x2 {maze$(i, y1)=\\\" \\\"}\\n }\\n End Sub\\n Sub ShowMaze()\\n Refresh 5000\\n cls ,4 ' split screen - preserve lines form 0 to 3\\n Local i, j\\n For j=1 to h+1 { Print @(10) : for i=1 to w+1 {Print maze$(i,j);}:Print}\\n Print\\n Refresh 100\\n End Sub\\n}\\nMaze2\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"MazeGraphics[m_, n_] :=\\n Block[{$RecursionLimit = Infinity,\\n unvisited = Tuples[Range /@ {m, n}], maze},\\n maze = Graphics[{Line[{{#, # - {0, 1}}, {#, # - {1, 0}}}] & /@\\n unvisited,\\n Line[{{0, n}, {0, 0}, {m, 0}}]}]; {unvisited =\\n DeleteCases[unvisited, #];\\n Do[If[MemberQ[unvisited, neighbor],\\n maze = DeleteCases[\\n maze, {#,\\n neighbor - {1, 1}} | {neighbor, # - {1, 1}}, {5}]; #0@\\n neighbor], {neighbor,\\n RandomSample@{# + {0, 1}, # - {0, 1}, # + {1, 0}, # - {1,\\n 0}}}]} &@RandomChoice@unvisited; maze];\\nmaze = MazeGraphics[21, 13]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"MazeGraph[m_, n_] :=\\n Block[{$RecursionLimit = Infinity, grid = GridGraph[{m, n}],\\n unvisitedQ}, unvisitedQ[_] := True;\\n Graph[Range[m n], Reap[{unvisitedQ[#] = False;\\n Do[\\n If[unvisitedQ[neighbor],\\n Sow[# <-> neighbor]; #0@neighbor], {neighbor,\\n RandomSample@AdjacencyList[grid, #]}]} &@\\n RandomChoice@VertexList@grid][[2, 1]],\\n GraphLayout -> {\\\"GridEmbedding\\\", \\\"Dimension\\\" -> {m, n}}]];\\nmaze = MazeGraph[13, 21]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function M = makeMaze(n)\\n showProgress = false;\\n\\n colormap([1,1,1;1,1,1;0,0,0]);\\n set(gcf,'color','w');\\n\\n NoWALL = 0;\\n WALL = 2;\\n NotVISITED = -1;\\n VISITED = -2;\\n\\n m = 2*n+3;\\n M = NotVISITED(ones(m));\\n offsets = [-1, m, 1, -m];\\n\\n M([1 2:2:end end],:) = WALL;\\n M(:,[1 2:2:end end]) = WALL;\\n\\n currentCell = sub2ind(size(M),3,3);\\n M(currentCell) = VISITED;\\n\\n S = currentCell;\\n\\n while (~isempty(S))\\n moves = currentCell + 2*offsets;\\n unvistedNeigbors = find(M(moves)==NotVISITED);\\n\\n if (~isempty(unvistedNeigbors))\\n next = unvistedNeigbors(randi(length(unvistedNeigbors),1));\\n M(currentCell + offsets(next)) = NoWALL;\\n\\n newCell = currentCell + 2*offsets(next);\\n if (any(M(newCell+2*offsets)==NotVISITED))\\n S = [S newCell];\\n end\\n\\n currentCell = newCell;\\n M(currentCell) = VISITED;\\n else\\n currentCell = S(1);\\n S = S(2:end);\\n end\\n\\n if (showProgress)\\n image(M-VISITED);\\n axis equal off;\\n drawnow;\\n pause(.01);\\n end\\n end\\n\\n image(M-VISITED);\\n axis equal off;\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"import random, sequtils, strutils\\nrandomize()\\n\\niterator randomCover[T](xs: openarray[T]): T =\\n var js = toSeq 0..xs.high\\n for i in countdown(js.high, 0):\\n let j = random(i)\\n swap(js[i], js[j])\\n for j in js:\\n yield xs[j]\\n\\nconst\\n w = 14\\n h = 10\\n\\nvar\\n vis = newSeqWith(h, newSeq[bool](w))\\n hor = newSeqWith(h+1, newSeqWith(w, \\\"+---\\\"))\\n ver = newSeqWith(h, newSeqWith(w, \\\"| \\\") & \\\"|\\\")\\n\\nproc walk(x, y: int) =\\n vis[y][x] = true\\n for p in [[x-1,y], [x,y+1], [x+1,y], [x,y-1]].randomCover:\\n if p[0] notin 0 ..< w or p[1] notin 0 ..< h or vis[p[1]][p[0]]: continue\\n if p[0] == x: hor[max(y, p[1])][x] = \\\"+ \\\"\\n if p[1] == y: ver[y][max(x, p[0])] = \\\" \\\"\\n walk p[0], p[1]\\n\\nwalk rand(0..<w), rand(0..<h)\\nfor a,b in zip(hor, ver & @[\\\"\\\"]).items:\\n echo join(a & \\\"+\\\\n\\\" & b)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let seen = Hashtbl.create 7\\nlet mark t = Hashtbl.add seen t true\\nlet marked t = Hashtbl.mem seen t\\n\\nlet walls = Hashtbl.create 7\\nlet ord a b = if a <= b then (a,b) else (b,a)\\nlet join a b = Hashtbl.add walls (ord a b) true\\nlet joined a b = Hashtbl.mem walls (ord a b)\\n\\nlet () =\\n let nx = int_of_string Sys.argv.(1) in\\n let ny = int_of_string Sys.argv.(2) in\\n\\n let shuffle lst =\\n let nl = List.map (fun c -> (Random.bits (), c)) lst in\\n List.map snd (List.sort compare nl) in\\n\\n let get_neighbours (x,y) =\\n let lim n k = (0 <= k) && (k < n) in\\n let bounds (x,y) = lim nx x && lim ny y in\\n List.filter bounds [(x-1,y);(x+1,y);(x,y-1);(x,y+1)] in\\n\\n let rec visit cell =\\n mark cell;\\n let check k =\\n if not (marked k) then (join cell k; visit k) in\\n List.iter check (shuffle (get_neighbours cell)) in\\n\\n let print_maze () =\\n begin\\n for i = 1 to nx do print_string \\\"+---\\\";done; print_endline \\\"+\\\";\\n let line n j k l s t u =\\n for i = 0 to n do print_string (if joined (i,j) (i+k,j+l) then s else t) done;\\n print_endline u in\\n for j = 0 to ny-2 do\\n print_string \\\"| \\\";\\n line (nx-2) j 1 0 \\\" \\\" \\\"| \\\" \\\"|\\\";\\n line (nx-1) j 0 1 \\\"+ \\\" \\\"+---\\\" \\\"+\\\";\\n done;\\n print_string \\\"| \\\";\\n line (nx-2) (ny-1) 1 0 \\\" \\\" \\\"| \\\" \\\"|\\\";\\n for i = 1 to nx do print_string \\\"+---\\\";done; print_endline \\\"+\\\";\\n end in\\n\\n Random.self_init();\\n visit (Random.int nx, Random.int ny);\\n print_maze ();\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"; maze generation\\n(import (otus random!))\\n(define WIDTH 30)\\n(define HEIGHT 8)\\n\\n(define maze\\n (map (lambda (?)\\n (repeat #b01111 WIDTH)) ; 0 - unvisited, 1111 - all walls exists\\n (iota HEIGHT)))\\n(define (at x y)\\n (list-ref (list-ref maze y) x))\\n\\n(define (unvisited? x y)\\n (if (and (< -1 x WIDTH) (< -1 y HEIGHT))\\n (zero? (band (at x y) #b10000))))\\n(define neighbors '((-1 . 0) (0 . -1) (+1 . 0) (0 . +1)))\\n(define walls '( #b10111 #b11011 #b11101 #b11110))\\n(define antiwalls '( #b11101 #b11110 #b10111 #b11011))\\n\\n(let loop ((x (rand! WIDTH)) (y (rand! HEIGHT)))\\n (list-set! (list-ref maze y) x (bor (at x y) #b10000))\\n (let try ()\\n (if (or\\n (unvisited? (- x 1) y) ; left\\n (unvisited? x (- y 1)) ; top\\n (unvisited? (+ x 1) y) ; right\\n (unvisited? x (+ y 1))) ; bottom\\n (let*((p (rand! 4))\\n (neighbor (list-ref neighbors p)))\\n (let ((nx (+ x (car neighbor)))\\n (ny (+ y (cdr neighbor))))\\n (if (unvisited? nx ny)\\n (let ((ncell (at nx ny)))\\n (list-set! (list-ref maze y) x (band (at x y) (list-ref walls p)))\\n (list-set! (list-ref maze ny) nx (band ncell (list-ref antiwalls p)))\\n (loop nx ny)))\\n (try))))))\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"; maze printing:\\n(display \\\"+\\\")\\n(for-each (lambda (?) (display \\\"--+\\\")) (iota WIDTH))\\n(print)\\n(for-each (lambda (l)\\n ; left wall (always)\\n (display \\\"|\\\")\\n ; draw right wall\\n (for-each (lambda (x)\\n (display \\\" \\\")\\n (display (if (zero? (band x #b10)) \\\" \\\" \\\"|\\\")))\\n l)\\n (print)\\n (display \\\"+\\\")\\n ; draw bottom wall\\n (for-each (lambda (x)\\n (display (if (zero? (band x #b01)) \\\" \\\" \\\"--\\\"))\\n (display \\\"+\\\"))\\n l)\\n (print))\\n maze)\\n(print)\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"use List::Util 'max';\\n\\nmy ($w, $h) = @ARGV;\\n$w ||= 26;\\n$h ||= 127;\\nmy $avail = $w * $h;\\n\\n# cell is padded by sentinel col and row, so I don't check array bounds\\nmy @cell = (map([(('1') x $w), 0], 1 .. $h), [('') x ($w + 1)]);\\nmy @ver = map([(\\\"| \\\") x $w], 1 .. $h);\\nmy @hor = map([(\\\"+--\\\") x $w], 0 .. $h);\\n\\nsub walk {\\n\\tmy ($x, $y) = @_;\\n\\t$cell[$y][$x] = '';\\n\\t$avail-- or return;\\t# no more bottles, er, cells\\n\\n\\tmy @d = ([-1, 0], [0, 1], [1, 0], [0, -1]);\\n\\twhile (@d) {\\n\\t\\tmy $i = splice @d, int(rand @d), 1;\\n\\t\\tmy ($x1, $y1) = ($x + $i->[0], $y + $i->[1]);\\n\\n\\t\\t$cell[$y1][$x1] or next;\\n\\n\\t\\tif ($x == $x1) { $hor[ max($y1, $y) ][$x] = '+ ' }\\n\\t\\tif ($y == $y1) { $ver[$y][ max($x1, $x) ] = ' ' }\\n\\t\\twalk($x1, $y1);\\n\\t}\\n}\\n\\nwalk(int rand $w, int rand $h);\\t# generate\\n\\nfor (0 .. $h) {\\t\\t\\t# display\\n\\tprint @{$hor[$_]}, \\\"+\\\\n\\\";\\n\\tprint @{$ver[$_]}, \\\"|\\\\n\\\" if $_ < $h;\\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: #000080;font-style:italic;\\\">--\\n -- grid is eg for w=3,h=2: {\\\"+---+---+---+\\\", -- (\\\"wall\\\")\\n -- \\\"| ? | ? | ? |\\\", -- (\\\"cell\\\")\\n -- \\\"+---+---+---+\\\", -- (\\\"wall\\\")\\n -- \\\"| ? | ? | ? |\\\", -- (\\\"cell\\\")\\n -- \\\"+---+---+---+\\\", -- (\\\"wall\\\")\\n -- \\\"\\\"} -- (for a trailing \\\\n)\\n --\\n -- note those ?(x,y) are at [y*2][x*4-1], and we navigate\\n -- using y=2..2*h (+/-2), x=3..w*4-1 (+/-4) directly.\\n --</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">w</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">h</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">8</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> <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\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">amaze</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: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <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: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- mark cell visited</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shuffle</span><span style=\\\"color: #0000FF;\\\">({{</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">4</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: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">4</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: #000000;\\\">y</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;\\\">p</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;\\\">nx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ny</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>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">nx</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">nx</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">ny</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">ny</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">h</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">ny</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">nx</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">'?'</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">mx</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;\\\">nx</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">2</span>\\n <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;\\\">ny</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">mx</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">mx</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> <span style=\\\"color: #000080;font-style:italic;\\\">-- knock down wall</span>\\n <span style=\\\"color: #000000;\\\">amaze</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ny</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;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">heads</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">rand</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: #000080;font-style:italic;\\\">-- 50:50 true(1)/false(0)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\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: #0000FF;\\\">{(</span><span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">rand</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;\\\">amaze</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: #000080;font-style:italic;\\\">-- mark start pos</span>\\n <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: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">'*'</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- add a random door (heads=rhs/lhs, tails=top/btm)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">heads</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: #7060A8;\\\">rand</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><span style=\\\"color: #000000;\\\">heads</span><span style=\\\"color: #0000FF;\\\">()*</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">4</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;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">heads</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><span style=\\\"color: #000000;\\\">1</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;\\\">x</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;\\\">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;\\\">\\\"%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\": \"<?php\\nclass Maze\\n{\\n protected $width;\\n protected $height;\\n protected $grid;\\n protected $path;\\n protected $horWalls;\\n protected $vertWalls;\\n protected $dirs;\\n protected $isDebug;\\n\\n public function __construct($x, $y, $debug = false)\\n {\\n $this->width = $x;\\n $this->height = $y;\\n $this->path = [];\\n $this->dirs = [ [0, -1], [0, 1], [-1, 0], [1, 0]]; // array of coordinates of N,S,W,E\\n $this->horWalls = []; // list of removed horizontal walls (---+)\\n $this->vertWalls = [];// list of removed vertical walls (|)\\n $this->isDebug = $debug; // debug flag\\n\\n // generate the maze:\\n $this->generate();\\n }\\n\\n protected function generate()\\n {\\n $this->initMaze(); // init the stack and an unvisited grid\\n // start from a random cell and then proceed recursively\\n $this->walk(mt_rand(0, $this->width-1), mt_rand(0, $this->height-1));\\n }\\n\\n /**\\n * Actually prints the Maze, on stdOut. Put in a separate method to allow extensibility\\n * For simplicity sake doors are positioned on the north wall and east wall\\n */\\n public function printOut()\\n {\\n $this->log(\\\"Horizontal walls: %s\\\", json_encode($this->horWalls));\\n $this->log(\\\"Vertical walls: %s\\\", json_encode($this->vertWalls));\\n\\n $northDoor = mt_rand(0,$this->width-1);\\n $eastDoor = mt_rand(0, $this->height-1);\\n\\n $str = '+';\\n for ($i=0;$i<$this->width;$i++) {\\n $str .= ($northDoor == $i) ? ' +' : '---+';\\n }\\n $str .= PHP_EOL;\\n for ($i=0; $i<$this->height; $i++) {\\n\\n for ($j=0; $j<$this->width; $j++) {\\n $str .= (!empty($this->vertWalls[$j][$i]) ? $this->vertWalls[$j][$i] : '| ');\\n }\\n $str .= ($i == $eastDoor ? ' ' : '|').PHP_EOL.'+';\\n for ($j=0; $j<$this->width; $j++) {\\n $str .= (!empty($this->horWalls[$j][$i]) ? $this->horWalls[$j][$i] : '---+');\\n }\\n $str .= PHP_EOL;\\n }\\n echo $str;\\n }\\n\\n /**\\n * Logs to stdOut if debug flag is enabled\\n */\\n protected function log(...$params)\\n {\\n if ($this->isDebug) {\\n echo vsprintf(array_shift($params), $params).PHP_EOL;\\n }\\n }\\n\\n private function walk($x, $y)\\n {\\n $this->log('Entering cell %d,%d', $x, $y);\\n // mark current cell as visited\\n $this->grid[$x][$y] = true;\\n // add cell to path\\n $this->path[] = [$x, $y];\\n // get list of all neighbors\\n $neighbors = $this->getNeighbors($x, $y);\\n $this->log(\\\"Valid neighbors: %s\\\", json_encode($neighbors));\\n\\n if(empty($neighbors)) {\\n // Dead end, we need now to backtrack, if there's still any cell left to be visited\\n $this->log(\\\"Start backtracking along path: %s\\\", json_encode($this->path));\\n array_pop($this->path);\\n if (!empty($this->path)) {\\n $next = array_pop($this->path);\\n return $this->walk($next[0], $next[1]);\\n }\\n } else {\\n // randomize neighbors, as per request\\n shuffle($neighbors);\\n\\n foreach ($neighbors as $n) {\\n $nextX = $n[0];\\n $nextY = $n[1];\\n if ($nextX == $x) {\\n $wallY = max($nextY, $y);\\n $this->log(\\\"New cell is on the same column (%d,%d), removing %d, (%d-1) horizontal wall\\\", $nextX, $nextY, $x, $wallY);\\n $this->horWalls[$x][min($nextY, $y)] = \\\" +\\\";\\n }\\n if ($nextY == $y) {\\n $wallX = max($nextX, $x);\\n $this->log(\\\"New cell is on the same row (%d,%d), removing %d,%d vertical wall\\\", $nextX, $nextY, $wallX, $y);\\n $this->vertWalls[$wallX][$y] = \\\" \\\";\\n }\\n return $this->walk($nextX, $nextY);\\n }\\n }\\n }\\n\\n /**\\n * Initialize an empty grid of $width * $height dimensions\\n */\\n private function initMaze()\\n {\\n for ($i=0;$i<$this->width;$i++) {\\n for ($j = 0;$j<$this->height;$j++) {\\n $this->grid[$i][$j] = false;\\n }\\n }\\n }\\n\\n /**\\n * @param int $x\\n * @param int $y\\n * @return array\\n */\\n private function getNeighbors($x, $y)\\n {\\n $neighbors = [];\\n foreach ($this->dirs as $dir) {\\n $nextX = $dir[0] + $x;\\n $nextY = $dir[1] + $y;\\n if (($nextX >= 0 && $nextX < $this->width && $nextY >= 0 && $nextY < $this->height) && !$this->grid[$nextX][$nextY]) {\\n $neighbors[] = [$nextX, $nextY];\\n }\\n }\\n return $neighbors;\\n }\\n}\\n\\n$maze = new Maze(10,10);\\n$maze->printOut();\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"main =>\\n gen_maze(8,8).\\n\\nmain([RStr,CStr]) =>\\n MaxR = to_int(RStr),\\n MaxC = to_int(CStr),\\n gen_maze(MaxR,MaxC).\\n\\ngen_maze(MaxR,MaxC) =>\\n Maze = new_array(MaxR,MaxC),\\n foreach (R in 1..MaxR, C in 1..MaxC)\\n Maze[R,C] = 0\\n end,\\n gen_maze(Maze,MaxR,MaxC,1,1),\\n display_maze(Maze,MaxR,MaxC).\\n\\ngen_maze(Maze,MaxR,MaxC,R,C) =>\\n Dirs = shuffle([left, right, up, down]),\\n foreach (Dir in Dirs)\\n dir(Dir,Dr,Dc,B,OB),\\n R1 := R+Dr,\\n C1 := C+Dc,\\n if (R1 >= 1 && R1 =< MaxR && C1 >= 1 && C1 =< MaxC && Maze[R1,C1] == 0) then\\n Maze[R,C] := Maze[R,C] \\\\/ B,\\n Maze[R1,C1] := Maze[R1,C1] \\\\/ OB,\\n gen_maze(Maze,MaxR,MaxC,R1,C1)\\n end\\n end.\\n\\n% dir(direction, Dr, Dc, Bit, OppBit)\\ndir(left, 0, -1, 1, 2).\\ndir(right, 0, 1, 2, 1).\\ndir(up, -1, 0, 4, 8).\\ndir(down, 1, 0, 8, 4).\\n\\nshuffle(Arr) = Res =>\\n foreach (_ in 1..10)\\n I1 = random() mod 4 + 1,\\n I2 = random() mod 4 + 1,\\n T := Arr[I1],\\n Arr[I1] := Arr[I2],\\n Arr[I2] := T\\n end,\\n Res = Arr.\\n\\ndisplay_maze(Maze,MaxR,MaxC) =>\\n foreach (R in 1..MaxR)\\n foreach (C in 1..MaxC)\\n printf(\\\"%s\\\", cond(Maze[R,C] /\\\\ 4 == 0, \\\"+---\\\", \\\"+ \\\"))\\n end,\\n println(\\\"+\\\"),\\n foreach (C in 1..MaxC)\\n printf(\\\"%s\\\", cond(Maze[R,C] /\\\\ 1 == 0, \\\"| \\\", \\\" \\\")),\\n end,\\n println(\\\"|\\\")\\n end,\\n foreach (C in 1..MaxC)\\n print(\\\"+---\\\")\\n end,\\n println(\\\"+\\\").\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(load \\\"@lib/simul.l\\\")\\n\\n(de maze (DX DY)\\n (let Maze (grid DX DY)\\n (let Fld (get Maze (rand 1 DX) (rand 1 DY))\\n (recur (Fld)\\n (for Dir (shuffle '((west . east) (east . west) (south . north) (north . south)))\\n (with ((car Dir) Fld)\\n (unless (or (: west) (: east) (: south) (: north))\\n (put Fld (car Dir) This)\\n (put This (cdr Dir) Fld)\\n (recurse This) ) ) ) ) )\\n (for (X . Col) Maze\\n (for (Y . This) Col\\n (set This\\n (cons\\n (cons\\n (: west)\\n (or\\n (: east)\\n (and (= Y 1) (= X DX)) ) )\\n (cons\\n (: south)\\n (or\\n (: north)\\n (and (= X 1) (= Y DY)) ) ) ) ) ) )\\n Maze ) )\\n\\n(de display (Maze)\\n (disp Maze 0 '((This) \\\" \\\")) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"*process source attributes xref or(!);\\n mgg: Proc Options(main);\\n /* REXX ***************************************************************\\n * 04.09.2013 Walter Pachl translated from REXX version 3\\n **********************************************************************/\\n Dcl (MIN,MOD,RANDOM,REPEAT,SUBSTR) Builtin;\\n Dcl SYSIN STREAM INPUT;\\n Dcl print Print;\\n Dcl imax Bin Fixed(31) init(10);\\n Dcl jmax Bin Fixed(31) init(15);\\n Dcl seed Bin Fixed(31) init(4711);\\n Get File(sysin) Data(imax,jmax,seed);\\n Dcl ii Bin Fixed(31);\\n Dcl jj Bin Fixed(31);\\n Dcl id Bin Fixed(31);\\n Dcl jd Bin Fixed(31);\\n id=2*imax+1; /* vertical dimension of a.i.j */\\n jd=2*jmax+1; /* horizontal dimension of a.i.j */\\n Dcl c Char(2000) Var;\\n c=repeat('123456789'!!'abcdefghijklmnopqrstuvwxyz'!!\\n 'ABCDEFGHIJKLMNOPQRSTUVWXYZ',20);\\n Dcl x Bin Float(53);\\n x=random(seed);\\n Dcl ps Bin Fixed(31) Init(1); /* first position */\\n Dcl na Bin Fixed(31) Init(1); /* number of points used */\\n Dcl si Bin Fixed(31); /* loop to compute paths */\\n Begin;\\n Dcl a(id,jd) Bin Fixed(15);\\n Dcl p(imax,jmax) Char(1);\\n Dcl 1 pl(imax*jmax),\\n 2 ic Bin Fixed(15),\\n 2 jc Bin Fixed(15);\\n Dcl 1 np(imax*jmax),\\n 2 ic Bin Fixed(15),\\n 2 jc Bin Fixed(15);\\n Dcl 1 pos(imax*jmax),\\n 2 ic Bin Fixed(15),\\n 2 jc Bin Fixed(15);\\n Dcl npl Bin Fixed(31) Init(0);\\n a=1; /* mark all borders present */\\n p='.'; /* Initialize all grid points */\\n ii=rnd(imax); /* find a start position */\\n jj=rnd(jmax);\\n Do si=1 To 1000; /* Do Forever - see Leave */\\n Call path(ii,jj); /* compute a path starting at ii/jj */\\n If na=imax*jmax Then /* all points used */\\n Leave; /* we are done */\\n Call select_next(ii,jj); /* get a new start from a path*/\\n End;\\n Call show;\\n Return;\\n\\n path: Procedure(ii,jj);\\n /**********************************************************************\\n * compute a path starting from point (ii,jj)\\n **********************************************************************/\\n Dcl ii Bin Fixed(31);\\n Dcl jj Bin Fixed(31);\\n Dcl nb Bin Fixed(31);\\n Dcl ch Bin Fixed(31);\\n Dcl pp Bin Fixed(31);\\n p(ii,jj)='1';\\n pos.ic(ps)=ii;\\n pos.jc(ps)=jj;\\n Do pp=1 to 50; /* compute a path of maximum length 50*/\\n nb=neighbors(ii,jj); /* number of free neighbors */\\n Select;\\n When(nb=1) /* just one */\\n Call advance((1),ii,jj); /* go for it */\\n When(nb>0) Do; /* more Than 1 */\\n ch=rnd(nb); /* choose one possibility */\\n Call advance(ch,ii,jj); /* and go for that */\\n End;\\n Otherwise /* none available */\\n Leave;\\n End;\\n End;\\n End;\\n\\n neighbors: Procedure(i,j) Returns(Bin Fixed(31));\\n /**********************************************************************\\n * count the number of free neighbors of point (i,j)\\n **********************************************************************/\\n Dcl i Bin Fixed(31);\\n Dcl j Bin Fixed(31);\\n Dcl in Bin Fixed(31);\\n Dcl jn Bin Fixed(31);\\n Dcl nb Bin Fixed(31) Init(0);\\n in=i-1; If in>0 Then Call check(in,j,nb);\\n in=i+1; If in<=imax Then Call check(in,j,nb);\\n jn=j-1; If jn>0 Then Call check(i,jn,nb);\\n jn=j+1; If jn<=jmax Then Call check(i,jn,nb);\\n Return(nb);\\n End;\\n\\n check: Procedure(i,j,n);\\n /**********************************************************************\\n * check if point (i,j) is free and note it as possible successor\\n **********************************************************************/\\n Dcl i Bin Fixed(31);\\n Dcl j Bin Fixed(31);\\n Dcl n Bin Fixed(31);\\n If p(i,j)='.' Then Do; /* point is free */\\n n+=1; /* number of free neighbors */\\n np.ic(n)=i; /* note it as possible choice */\\n np.jc(n)=j;\\n End;\\n End;\\n\\n advance: Procedure(ch,ii,jj);\\n /**********************************************************************\\n * move to the next point of the current path\\n **********************************************************************/\\n Dcl ch Bin Fixed(31);\\n Dcl ii Bin Fixed(31);\\n Dcl jj Bin Fixed(31);\\n Dcl ai Bin Fixed(31);\\n Dcl aj Bin Fixed(31);\\n Dcl pii Bin Fixed(31) Init((ii));\\n Dcl pjj Bin Fixed(31) Init((jj));\\n Dcl z Bin Fixed(31);\\n ii=np.ic(ch);\\n jj=np.jc(ch);\\n ps+=1; /* position number */\\n pos.ic(ps)=ii; /* note its coordinates */\\n pos.jc(ps)=jj;\\n p(ii,jj)=substr(c,ps,1); /* mark the point as used */\\n ai=pii+ii; /* vertical border position */\\n aj=pjj+jj; /* horizontal border position */\\n a(ai,aj)=0; /* tear the border down */\\n na+=1; /* number of used positions */\\n z=npl+1; /* add the point to the list */\\n pl.ic(z)=ii; /* of follow-up start pos. */\\n pl.jc(z)=jj;\\n npl=z;\\n End;\\n\\n show: Procedure;\\n /*********************************************************************\\n * Show the resulting maze\\n *********************************************************************/\\n Dcl i Bin Fixed(31);\\n Dcl j Bin Fixed(31);\\n Dcl ol Char(300) Var;\\n Put File(print) Edit('mgg',imax,jmax,seed)(Skip,a,3(f(4)));\\n Put File(print) Skip Data(na);\\n Do i=1 To id;\\n ol='';\\n Do j=1 To jd;\\n If mod(i,2)=1 Then Do; /* odd lines */\\n If a(i,j)=1 Then Do; /* border to be drawn */\\n If mod(j,2)=0 Then\\n ol=ol!!'---'; /* draw the border */\\n Else\\n ol=ol!!'+';\\n End;\\n Else Do; /* border was torn down */\\n If mod(j,2)=0 Then\\n ol=ol!!' '; /* blanks instead of border */\\n Else\\n ol=ol!!'+';\\n End;\\n End;\\n Else Do; /* even line */\\n If a(i,j)=1 Then Do;\\n If mod(j,2)=0 Then /* even column */\\n ol=ol!!' '; /* moving space */\\n Else /* odd column */\\n ol=ol!!'!'; /* draw the border */\\n End;\\n Else /* border was torn down */\\n ol=ol!!' '; /* blank instead of border */\\n End;\\n End;\\n Select;\\n When(i=6) substr(ol,11,1)='A';\\n When(i=8) substr(ol, 3,1)='B';\\n Otherwise;\\n End;\\n Put File(print) Edit(ol,i)(Skip,a,f(3));\\n End;\\n End;\\n\\n select_next: Procedure(is,js);\\n /**********************************************************************\\n * look for a point to start the nnext path\\n **********************************************************************/\\n Dcl is Bin Fixed(31);\\n Dcl js Bin Fixed(31);\\n Dcl n Bin Fixed(31);\\n Dcl nb Bin Fixed(31);\\n Dcl s Bin Fixed(31);\\n Do Until(nb>0); /* loop until one is found */\\n n=npl; /* number of points recorded */\\n s=rnd(n); /* pick a random index */\\n is=pl.ic(s); /* its coordinates */\\n js=pl.jc(s);\\n nb=neighbors(is,js); /* count free neighbors */\\n If nb=0 Then Do; /* if there is none */\\n pl.ic(s)=pl.ic(n); /* remove this point */\\n pl.jc(s)=pl.jc(n);\\n npl-=1;\\n End;\\n End;\\n End;\\n\\n rnd: Proc(n) Returns(Bin Fixed(31));\\n /*********************************************************************\\n * return a pseudo-random integer between 1 and n\\n *********************************************************************/\\n dcl (r,n) Bin Fixed(31);\\n r=min(random()*n+1,n);\\n Return(r);\\n End;\\n\\n End;\\n End;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"int g_size = 10;\\ncolor background_color = color (80, 80, 220);\\ncolor runner = color (255, 50, 50);\\ncolor visited_color = color(220, 240, 240);\\ncolor done_color = color (100, 160, 250);\\nint c_size;\\n\\nCell[][] cell;\\nArrayList<Cell> done = new ArrayList<Cell>();\\nArrayList<Cell> visit = new ArrayList<Cell>();\\nCell run_cell;\\n\\nvoid setup() {\\n size(600, 600);\\n frameRate(20);\\n smooth(4);\\n strokeCap(ROUND);\\n c_size = max(width/g_size, height/g_size);\\n cell = new Cell[g_size][g_size];\\n for (int i = 0; i < g_size; i++) {\\n for (int j = 0; j < g_size; j++) {\\n cell[i][j] = new Cell(i, j);\\n }\\n }\\n for (int i = 0; i < g_size; i++) {\\n for (int j = 0; j < g_size; j++) {\\n cell[i][j].add_neighbor();\\n }\\n }\\n run_cell = cell[0][0];\\n visit.add(run_cell);\\n}\\n\\nvoid draw() {\\n background(background_color);\\n for (int i = 0; i < g_size; i++) {\\n for (int j = 0; j < g_size; j++) {\\n cell[i][j].draw_cell();\\n cell[i][j].draw_wall();\\n }\\n }\\n if (visit.size() < g_size*g_size) {\\n if (run_cell.check_sides()) {\\n Cell chosen = run_cell.pick_neighbor();\\n done.add(run_cell);\\n run_cell.stacked = true;\\n if (chosen.i - run_cell.i == 1) {\\n run_cell.wall[1] = false;\\n chosen.wall[3] = false;\\n } else if (chosen.i - run_cell.i == -1) {\\n run_cell.wall[3] = false;\\n chosen.wall[1] = false;\\n } else if (chosen.j - run_cell.j == 1) {\\n run_cell.wall[2] = false;\\n chosen.wall[0] = false;\\n } else {\\n run_cell.wall[0] = false;\\n chosen.wall[2] = false;\\n }\\n run_cell.current = false;\\n run_cell = chosen;\\n run_cell.current = true;\\n run_cell.visited = true;\\n } else if (done.size()>0) {\\n run_cell.current = false;\\n run_cell = done.remove(done.size()-1);\\n run_cell.stacked = false;\\n run_cell.current = true;\\n }\\n }\\n}\\n\\nclass Cell {\\n ArrayList<Cell> neighbor;\\n boolean visited, stacked, current;\\n boolean[] wall;\\n int i, j;\\n\\n Cell(int _i, int _j) {\\n i = _i;\\n j = _j;\\n wall = new boolean[]{true,true,true,true};\\n }\\n\\n Cell pick_neighbor() {\\n ArrayList<Cell> unvisited = new ArrayList<Cell>();\\n for(int i = 0; i < neighbor.size(); i++){\\n Cell nb = neighbor.get(i);\\n if(nb.visited == false) unvisited.add(nb);\\n }\\n return unvisited.get(floor(random(unvisited.size())));\\n }\\n\\n void add_neighbor() {\\n neighbor = new ArrayList<Cell>();\\n if(i>0){neighbor.add(cell[i-1][j]);}\\n if(i<g_size-1){neighbor.add(cell[i+1][j]);}\\n if(j>0){neighbor.add(cell[i][j-1]);}\\n if(j<g_size-1){neighbor.add(cell[i][j+1]);}\\n }\\n\\n boolean check_sides() {\\n for(int i = 0; i < neighbor.size(); i++){\\n Cell nb = neighbor.get(i);\\n if(!nb.visited) return true;\\n }\\n return false;\\n }\\n\\n void draw_cell() {\\n noStroke();\\n noFill();\\n if(current) fill(runner);\\n else if(stacked) fill(done_color);\\n else if(visited) fill(visited_color);\\n rect(j*c_size,i*c_size,c_size,c_size);\\n }\\n\\n void draw_wall() {\\n stroke(0);\\n strokeWeight(5);\\n if(wall[0]) line(j*c_size, i*c_size, j*c_size, (i+1)* c_size);\\n if(wall[1]) line(j*c_size, (i+1)*c_size, (j+1)*c_size, (i+1)*c_size);\\n if(wall[2]) line((j+1)*c_size, (i+1)*c_size, (j+1)*c_size, i*c_size);\\n if(wall[3]) line((j+1)*c_size, i*c_size, j*c_size, i*c_size);\\n }\\n}\\n\",\n \"language\": \"Processing\"\n },\n {\n \"code\": \"g_size = 10\\nbackground_color = color(80, 80, 220)\\nrunner = color(255, 50, 50)\\nvisited_color = color(220, 240, 240)\\ndone_color = color(100, 160, 250)\\n\\ndef setup():\\n global cell, done, visit, run_cell, c_size\\n size(600, 600)\\n frameRate(20)\\n smooth(4)\\n strokeCap(ROUND)\\n c_size = max(width / g_size, height / g_size)\\n cell = [[None] * g_size for _ in range(g_size)]\\n\\n for i in range(g_size):\\n for j in range(g_size):\\n cell[i][j] = Cell(i, j)\\n\\n for i in range(g_size):\\n for j in range(g_size):\\n cell[i][j].add_neighbor()\\n\\n run_cell = cell[0][0]\\n visit, done = [], []\\n visit.append(run_cell)\\n\\n\\ndef draw():\\n global run_cell\\n\\n background(background_color)\\n\\n for i in range(g_size):\\n for j in range(g_size):\\n cell[i][j].draw_cell()\\n cell[i][j].draw_wall()\\n\\n if len(visit) < g_size * g_size:\\n if run_cell.check_sides():\\n chosen = run_cell.pick_neighbor()\\n done.append(run_cell)\\n run_cell.stacked = True\\n if chosen.i - run_cell.i == 1:\\n run_cell.wall[1] = False\\n chosen.wall[3] = False\\n elif chosen.i - run_cell.i == -1:\\n run_cell.wall[3] = False\\n chosen.wall[1] = False\\n elif chosen.j - run_cell.j == 1:\\n run_cell.wall[2] = False\\n chosen.wall[0] = False\\n else:\\n run_cell.wall[0] = False\\n chosen.wall[2] = False\\n run_cell.current = False\\n run_cell = chosen\\n run_cell.current = True\\n run_cell.visited = True\\n elif done:\\n run_cell.current = False\\n run_cell = done.pop()\\n run_cell.stacked = False\\n run_cell.current = True\\n\\n\\nclass Cell:\\n\\n def __init__(self, i, j):\\n self.i = i\\n self.j = j\\n self.wall = [True, True, True, True]\\n self.visited = False\\n self.stacked = False\\n self.current = False\\n\\n def pick_neighbor(self):\\n from random import choice\\n unvisited = [nb for nb in self.neighbor\\n if nb.visited == False]\\n return choice(unvisited)\\n\\n def add_neighbor(self):\\n i, j = self.i, self.j\\n neighbor = []\\n if i > 0:\\n neighbor.append(cell[i - 1][j])\\n if i < g_size - 1:\\n neighbor.append(cell[i + 1][j])\\n if j > 0:\\n neighbor.append(cell[i][j - 1])\\n if j < g_size - 1:\\n neighbor.append(cell[i][j + 1])\\n self.neighbor = neighbor\\n\\n def check_sides(self):\\n for nb in self.neighbor:\\n if not nb.visited:\\n return True\\n return False\\n\\n def draw_cell(self):\\n s = c_size\\n noStroke()\\n noFill()\\n if self.current:\\n fill(runner)\\n elif self.stacked:\\n fill(done_color)\\n elif self.visited:\\n fill(visited_color)\\n rect(self.j * s, self.i * s, s, s)\\n\\n def draw_wall(self):\\n i, j = self.i, self.j\\n wall = self.wall\\n stroke(0)\\n strokeWeight(5)\\n if wall[0]: line(j * c_size, i * c_size, j * c_size, (i + 1) * c_size)\\n if wall[1]: line(j * c_size, (i + 1) * c_size, (j + 1) * c_size, (i + 1) * c_size)\\n if wall[2]: line((j + 1) * c_size, (i + 1) * c_size, (j + 1) * c_size, i * c_size)\\n if wall[3]: line((j + 1) * c_size, i * c_size, j * c_size, i * c_size)\\n\",\n \"language\": \"Processing-Python-mode\"\n },\n {\n \"code\": \":- dynamic cell/2.\\n\\nmaze(Lig,Col) :-\\n\\tretractall(cell(_,_)),\\n\\n\\tnew(D, window('Maze')),\\n\\n\\t% creation of the grid\\n\\tforall(between(0,Lig, I),\\n\\t (XL is 50, YL is I * 30 + 50,\\n\\t\\tXR is Col * 30 + 50,\\n\\t\\tnew(L, line(XL, YL, XR, YL)),\\n\\t\\tsend(D, display, L))),\\n\\n\\tforall(between(0,Col, I),\\n\\t (XT is 50 + I * 30, YT is 50,\\n\\t\\tYB is Lig * 30 + 50,\\n\\t\\tnew(L, line(XT, YT, XT, YB)),\\n\\t\\tsend(D, display, L))),\\n\\n\\tSX is Col * 30 + 100,\\n\\tSY is Lig * 30 + 100,\\n\\tsend(D, size, new(_, size(SX, SY))),\\n\\n\\t% choosing a first cell\\n\\tL0 is random(Lig),\\n\\tC0 is random(Col),\\n\\tassert(cell(L0, C0)),\\n\\t\\\\+search(D, Lig, Col, L0, C0),\\n\\tsend(D, open).\\n\\nsearch(D, Lig, Col, L, C) :-\\n\\tDir is random(4),\\n\\tnextcell(Dir, Lig, Col, L, C, L1, C1),\\n\\tassert(cell(L1,C1)),\\n\\tassert(cur(L1,C1)),\\n\\terase_line(D, L, C, L1, C1),\\n\\tsearch(D, Lig, Col, L1, C1).\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\nerase_line(D, L, C, L, C1) :-\\n\\t( C < C1 -> C2 = C1; C2 = C),\\n\\tXT is C2 * 30 + 50,\\n\\tYT is L * 30 + 51, YR is (L+1) * 30 + 50,\\n\\tnew(Line, line(XT, YT, XT, YR)),\\n\\tsend(Line, colour, white),\\n\\tsend(D, display, Line).\\n\\nerase_line(D, L, C, L1, C) :-\\n\\tXT is 51 + C * 30, XR is 50 + (C + 1) * 30,\\n\\t( L < L1 -> L2 is L1; L2 is L),\\n\\tYT is L2 * 30 + 50,\\n\\tnew(Line, line(XT, YT, XR, YT)),\\n\\tsend(Line, colour, white),\\n\\tsend(D, display, Line).\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\nnextcell(Dir, Lig, Col, L, C, L1, C1) :-\\n\\tnext(Dir, Lig, Col, L, C, L1, C1);\\n\\t( Dir1 is (Dir+3) mod 4,\\n\\t next(Dir1, Lig, Col, L, C, L1, C1));\\n\\t( Dir2 is (Dir+1) mod 4,\\n\\t next(Dir2, Lig, Col, L, C, L1, C1));\\n\\t( Dir3 is (Dir+2) mod 4,\\n\\t next(Dir3, Lig, Col, L, C, L1, C1)).\\n\\n% 0 => northward\\nnext(0, _Lig, _Col, L, C, L1, C) :-\\n\\tL > 0,\\n\\tL1 is L - 1,\\n\\t\\\\+cell(L1, C).\\n\\n% 1 => rightward\\nnext(1, _Lig, Col, L, C, L, C1) :-\\n\\tC < Col - 1,\\n\\tC1 is C + 1,\\n\\t\\\\+cell(L, C1).\\n\\n% 2 => southward\\nnext(2, Lig, _Col, L, C, L1, C) :-\\n\\tL < Lig - 1,\\n\\tL1 is L + 1,\\n\\t\\\\+cell(L1, C).\\n\\n% 3 => leftward\\nnext(2, _Lig, _Col, L, C, L, C1) :-\\n\\tC > 0,\\n\\tC1 is C - 1,\\n\\t\\\\+cell(L, C1).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Enumeration\\n ;indexes for types of offsets from maze coordinates (x,y)\\n #visited ;used to index visited(x,y) in a given direction from current maze cell\\n #maze ;used to index maze() in a given direction from current maze cell\\n #wall ;used to index walls in maze() in a given direction from current maze cell\\n #numOffsets = #wall\\n ;direction indexes\\n #dir_ID = 0 ;identity value, produces no changes\\n #firstDir\\n #dir_N = #firstDir\\n #dir_E\\n #dir_S\\n #dir_W\\n #numDirs = #dir_W\\nEndEnumeration\\n\\nDataSection\\n ;maze(x,y) offsets for visited, maze, & walls for each direction\\n Data.i 1, 1, 0, 0, 0, 0 ;ID\\n Data.i 1, 0, 0, -1, 0, 0 ;N\\n Data.i 2, 1, 1, 0, 1, 0 ;E\\n Data.i 1, 2, 0, 1, 0, 1 ;S\\n Data.i 0, 1, -1, 0, 0, 0 ;W\\n Data.i %00, %01, %10, %01, %10 ;wall values for ID, N, E, S, W\\nEndDataSection\\n\\n#cellDWidth = 4\\n\\nStructure mazeOutput\\n vWall.s\\n hWall.s\\nEndStructure\\n\\n\\n;setup reference values indexed by type and direction from current map cell\\nGlobal Dim offset.POINT(#numOffsets, #numDirs)\\nDefine i, j\\nFor i = 0 To #numDirs\\n For j = 0 To #numOffsets\\n Read.i offset(j, i)\\\\x: Read.i offset(j, i)\\\\y\\n Next\\nNext\\n\\nGlobal Dim wallvalue(#numDirs)\\nFor i = 0 To #numDirs: Read.i wallvalue(i): Next\\n\\n\\nProcedure makeDisplayMazeRow(Array mazeRow.mazeOutput(1), Array maze(2), y)\\n ;modify mazeRow() to produce output of 2 strings showing the vertical walls above and horizontal walls across a given maze row\\n Protected x, vWall.s, hWall.s\\n Protected mazeWidth = ArraySize(maze(), 1), mazeHeight = ArraySize(maze(), 2)\\n\\n vWall = \\\"\\\": hWall = \\\"\\\"\\n For x = 0 To mazeWidth\\n If maze(x, y) & wallvalue(#dir_N): vWall + \\\"+ \\\": Else: vWall + \\\"+---\\\": EndIf\\n If maze(x, y) & wallvalue(#dir_W): hWall + \\\" \\\": Else: hWall + \\\"| \\\": EndIf\\n Next\\n mazeRow(0)\\\\vWall = Left(vWall, mazeWidth * #cellDWidth + 1)\\n If y <> mazeHeight: mazeRow(0)\\\\hWall = Left(hWall, mazeWidth * #cellDWidth + 1): Else: mazeRow(0)\\\\hWall = \\\"\\\": EndIf\\nEndProcedure\\n\\nProcedure displayMaze(Array maze(2))\\n Protected x, y, vWall.s, hWall.s, mazeHeight = ArraySize(maze(), 2)\\n Protected Dim mazeRow.mazeOutput(0)\\n\\n For y = 0 To mazeHeight\\n makeDisplayMazeRow(mazeRow(), maze(), y)\\n PrintN(mazeRow(0)\\\\vWall): PrintN(mazeRow(0)\\\\hWall)\\n Next\\nEndProcedure\\n\\nProcedure generateMaze(Array maze(2), mazeWidth, mazeHeight)\\n Dim maze(mazeWidth, mazeHeight) ;Each cell specifies walls present above and to the left of it,\\n ;array includes an extra row and column for the right and bottom walls\\n Dim visited(mazeWidth + 1, mazeHeight + 1) ;Each cell represents a cell of the maze, an extra line of cells are included\\n ;as padding around the representative cells for easy border detection\\n\\n Protected i\\n ;mark outside border as already visited (off limits)\\n For i = 0 To mazeWidth\\n visited(i + offset(#visited, #dir_N)\\\\x, 0 + offset(#visited, #dir_N)\\\\y) = #True\\n visited(i + offset(#visited, #dir_S)\\\\x, mazeHeight - 1 + offset(#visited, #dir_S)\\\\y) = #True\\n Next\\n For i = 0 To mazeHeight\\n visited(0 + offset(#visited, #dir_W)\\\\x, i + offset(#visited, #dir_W)\\\\y) = #True\\n visited(mazeWidth - 1 + offset(#visited, #dir_E)\\\\x, i + offset(#visited, #dir_E)\\\\y) = #True\\n Next\\n\\n ;generate maze\\n Protected x = Random(mazeWidth - 1), y = Random (mazeHeight - 1), cellCount, nextCell\\n visited(x + offset(#visited, #dir_ID)\\\\x, y + offset(#visited, #dir_ID)\\\\y) = #True\\n PrintN(\\\"Maze of size \\\" + Str(mazeWidth) + \\\" x \\\" + Str(mazeHeight) + \\\", generation started at \\\" + Str(x) + \\\" x \\\" + Str(y))\\n\\n NewList stack.POINT()\\n Dim unvisited(#numDirs - #firstDir)\\n Repeat\\n cellCount = 0\\n For i = #firstDir To #numDirs\\n If Not visited(x + offset(#visited, i)\\\\x, y + offset(#visited, i)\\\\y)\\n unvisited(cellCount) = i: cellCount + 1\\n EndIf\\n Next\\n\\n If cellCount\\n nextCell = unvisited(Random(cellCount - 1))\\n visited(x + offset(#visited, nextCell)\\\\x, y + offset(#visited, nextCell)\\\\y) = #True\\n maze(x + offset(#wall, nextCell)\\\\x, y + offset(#wall, nextCell)\\\\y) | wallvalue(nextCell)\\n\\n If cellCount > 1\\n AddElement(stack())\\n stack()\\\\x = x: stack()\\\\y = y\\n EndIf\\n x + offset(#maze, nextCell)\\\\x: y + offset(#maze, nextCell)\\\\y\\n ElseIf ListSize(stack()) > 0\\n x = stack()\\\\x: y = stack()\\\\y\\n DeleteElement(stack())\\n Else\\n Break ;end maze generation\\n EndIf\\n ForEver\\n\\n ; ;mark random entry and exit point\\n ; x = Random(mazeWidth - 1): y = Random(mazeHeight - 1)\\n ; maze(x, 0) | wallvalue(#dir_N): maze(mazeWidth, y) | wallvalue(#dir_E)\\n ProcedureReturn\\nEndProcedure\\n\\nIf OpenConsole()\\n Dim maze(0, 0)\\n Define mazeWidth = Random(5) + 7: mazeHeight = Random(5) + 3\\n generateMaze(maze(), mazeWidth, mazeHeight)\\n displayMaze(maze())\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\"): Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"from random import shuffle, randrange\\n\\ndef make_maze(w = 16, h = 8):\\n vis = [[0] * w + [1] for _ in range(h)] + [[1] * (w + 1)]\\n ver = [[\\\"| \\\"] * w + ['|'] for _ in range(h)] + [[]]\\n hor = [[\\\"+--\\\"] * w + ['+'] for _ in range(h + 1)]\\n\\n def walk(x, y):\\n vis[y][x] = 1\\n\\n d = [(x - 1, y), (x, y + 1), (x + 1, y), (x, y - 1)]\\n shuffle(d)\\n for (xx, yy) in d:\\n if vis[yy][xx]: continue\\n if xx == x: hor[max(y, yy)][x] = \\\"+ \\\"\\n if yy == y: ver[y][max(x, xx)] = \\\" \\\"\\n walk(xx, yy)\\n\\n walk(randrange(w), randrange(h))\\n\\n s = \\\"\\\"\\n for (a, b) in zip(hor, ver):\\n s += ''.join(a + ['\\\\n'] + b + ['\\\\n'])\\n return s\\n\\nif __name__ == '__main__':\\n print(make_maze())\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"OPTION BASE 0\\nRANDOMIZE TIMER\\n\\nREM must be even\\nwidth% = 40\\nheight% = 20\\n\\nREM make array and fill\\nDIM maze$(width%, height%)\\nFOR x% = 0 TO width%\\n FOR y% = 0 TO height%\\n maze$(x%, y%) = \\\"#\\\"\\n NEXT y%\\nNEXT x%\\n\\nREM initial start location\\ncurrentx% = INT(RND * (width% - 1))\\ncurrenty% = INT(RND * (height% - 1))\\nREM value must be odd\\nIF currentx% MOD 2 = 0 THEN currentx% = currentx% + 1\\nIF currenty% MOD 2 = 0 THEN currenty% = currenty% + 1\\nmaze$(currentx%, currenty%) = \\\" \\\"\\n\\nREM generate maze\\ndone% = 0\\nDO WHILE done% = 0\\n FOR i% = 0 TO 99\\n oldx% = currentx%\\n oldy% = currenty%\\n\\n REM move in random direction\\n SELECT CASE INT(RND * 4)\\n CASE 0\\n IF currentx% + 2 < width% THEN currentx% = currentx% + 2\\n CASE 1\\n IF currenty% + 2 < height% THEN currenty% = currenty% + 2\\n CASE 2\\n IF currentx% - 2 > 0 THEN currentx% = currentx% - 2\\n CASE 3\\n IF currenty% - 2 > 0 THEN currenty% = currenty% - 2\\n END SELECT\\n\\n REM if cell is unvisited then connect it\\n IF maze$(currentx%, currenty%) = \\\"#\\\" THEN\\n maze$(currentx%, currenty%) = \\\" \\\"\\n maze$(INT((currentx% + oldx%) / 2), ((currenty% + oldy%) / 2)) = \\\" \\\"\\n END IF\\n NEXT i%\\n\\n REM check if all cells are visited\\n done% = 1\\n FOR x% = 1 TO width% - 1 STEP 2\\n FOR y% = 1 TO height% - 1 STEP 2\\n IF maze$(x%, y%) = \\\"#\\\" THEN done% = 0\\n NEXT y%\\n NEXT x%\\nLOOP\\n\\nREM draw maze\\nFOR y% = 0 TO height%\\n FOR x% = 0 TO width%\\n PRINT maze$(x%, y%);\\n NEXT x%\\n PRINT\\nNEXT y%\\n\\nREM wait\\nDO: LOOP WHILE INKEY$ = \\\"\\\"\\n\",\n \"language\": \"QB64\"\n },\n {\n \"code\": \"#lang racket\\n\\n;; the structure representing a maze of size NxM\\n(struct maze (N M tbl))\\n\\n;; managing cell properties\\n(define (connections tbl c) (dict-ref tbl c '()))\\n\\n(define (connect! tbl c n)\\n (dict-set! tbl c (cons n (connections tbl c)))\\n (dict-set! tbl n (cons c (connections tbl n))))\\n\\n(define (connected? tbl a b) (member a (connections tbl b)))\\n\\n;; Returns a maze of a given size\\n;; build-maze :: Index Index -> Maze\\n(define (build-maze N M)\\n (define tbl (make-hash))\\n (define (visited? tbl c) (dict-has-key? tbl c))\\n (define (neigbours c)\\n (filter\\n (match-lambda [(list i j) (and (<= 0 i (- N 1)) (<= 0 j (- M 1)))])\\n (for/list ([d '((0 1) (0 -1) (-1 0) (1 0))]) (map + c d))))\\n ; generate the maze\\n (let move-to-cell ([c (list (random N) (random M))])\\n (for ([n (shuffle (neigbours c))] #:unless (visited? tbl n))\\n (connect! tbl c n)\\n (move-to-cell n)))\\n ; return the result\\n (maze N M tbl))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \";; Shows a maze\\n(define (show-maze m)\\n (match-define (maze N M tbl) m)\\n (for ([i N]) (display \\\"+---\\\"))\\n (displayln \\\"+\\\")\\n (for ([j M])\\n (display \\\"|\\\")\\n (for ([i (- N 1)])\\n (if (connected? tbl (list i j) (list (+ 1 i) j))\\n (display \\\" \\\")\\n (display \\\" |\\\")))\\n (display \\\" |\\\")\\n (newline)\\n (for ([i N])\\n (if (connected? tbl (list i j) (list i (+ j 1)))\\n (display \\\"+ \\\")\\n (display \\\"+---\\\")))\\n (displayln \\\"+\\\"))\\n (newline))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"constant mapping = :OPEN(' '),\\n\\t\\t :N< ╵ >,\\n\\t\\t :E< ╶ >,\\n\\t\\t :NE< └ >,\\n\\t\\t :S< ╷ >,\\n\\t\\t :NS< │ >,\\n\\t\\t :ES< ┌ >,\\n\\t\\t :NES< ├ >,\\n\\t\\t :W< ╴ >,\\n\\t\\t :NW< ┘ >,\\n\\t\\t :EW< ─ >,\\n\\t\\t :NEW< ┴ >,\\n\\t\\t :SW< ┐ >,\\n\\t\\t :NSW< ┤ >,\\n\\t\\t :ESW< ┬ >,\\n\\t\\t :NESW< ┼ >,\\n\\t\\t :TODO< x >,\\n\\t :TRIED< · >;\\n\\nenum Sym (mapping.map: *.key);\\nmy @ch = mapping.map: *.value;\\n\\nenum Direction <DeadEnd Up Right Down Left>;\\n\\nsub gen_maze ( $X,\\n $Y,\\n $start_x = (^$X).pick * 2 + 1,\\n $start_y = (^$Y).pick * 2 + 1 )\\n{\\n my @maze;\\n push @maze, $[ flat ES, -N, (ESW, EW) xx $X - 1, SW ];\\n push @maze, $[ flat (NS, TODO) xx $X, NS ];\\n for 1 ..^ $Y {\\n\\tpush @maze, $[ flat NES, EW, (NESW, EW) xx $X - 1, NSW ];\\n\\tpush @maze, $[ flat (NS, TODO) xx $X, NS ];\\n }\\n push @maze, $[ flat NE, (EW, NEW) xx $X - 1, -NS, NW ];\\n @maze[$start_y][$start_x] = OPEN;\\n\\n my @stack;\\n my $current = [$start_x, $start_y];\\n loop {\\n if my $dir = pick_direction( $current ) {\\n @stack.push: $current;\\n $current = move( $dir, $current );\\n }\\n else {\\n last unless @stack;\\n $current = @stack.pop;\\n }\\n }\\n return @maze;\\n\\n sub pick_direction([$x,$y]) {\\n\\tmy @neighbors =\\n\\t (Up if @maze[$y - 2][$x]),\\n\\t (Down if @maze[$y + 2][$x]),\\n\\t (Left if @maze[$y][$x - 2]),\\n\\t (Right if @maze[$y][$x + 2]);\\n\\t@neighbors.pick or DeadEnd;\\n }\\n\\n sub move ($dir, @cur) {\\n\\tmy ($x,$y) = @cur;\\n\\tgiven $dir {\\n\\t when Up { @maze[--$y][$x] = OPEN; @maze[$y][$x-1] -= E; @maze[$y--][$x+1] -= W; }\\n\\t when Down { @maze[++$y][$x] = OPEN; @maze[$y][$x-1] -= E; @maze[$y++][$x+1] -= W; }\\n\\t when Left { @maze[$y][--$x] = OPEN; @maze[$y-1][$x] -= S; @maze[$y+1][$x--] -= N; }\\n\\t when Right { @maze[$y][++$x] = OPEN; @maze[$y-1][$x] -= S; @maze[$y+1][$x++] -= N; }\\n\\t}\\n\\t@maze[$y][$x] = 0;\\n\\t[$x,$y];\\n }\\n}\\n\\nsub display (@maze) {\\n for @maze -> @y {\\n\\tfor @y.rotor(2) -> ($w, $c) {\\n\\t print @ch[abs $w];\\n\\t if $c >= 0 { print @ch[$c] x 3 }\\n\\t else { print ' ', @ch[abs $c], ' ' }\\n\\t}\\n\\tsay @ch[@y[*-1]];\\n }\\n}\\n\\ndisplay gen_maze( 29, 19 );\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"import IO;\\nimport util::Math;\\nimport List;\\n\\npublic void make_maze(int w, int h){\\n\\tvis = [[0 | _ <- [1..w]] | _ <- [1..h]];\\n\\tver = [[\\\"| \\\"| _ <- [1..w]] + [\\\"|\\\"] | _ <- [1..h]] + [[]];\\n\\thor = [[\\\"+--\\\"| _ <- [1..w]] + [\\\"+\\\"] | _ <- [1..h + 1]];\\n\\n\\tvoid walk(int x, int y){\\n\\t\\tvis[y][x] = 1;\\n\\n\\t\\td = [<x - 1, y>, <x, y + 1>, <x + 1, y>, <x, y - 1>];\\n\\t\\twhile (d != []){\\n\\t\\t\\t<<xx, yy>, d> = takeOneFrom(d);\\n\\t\\t\\tif (xx < 0 || yy < 0 || xx >= w || yy >= w) continue;\\n\\t\\t\\tif (vis[yy][xx] == 1) continue;\\n\\t\\t\\tif (xx == x) hor[max([y, yy])][x] = \\\"+ \\\";\\n\\t\\t\\tif (yy == y) ver[y][max([x, xx])] = \\\" \\\";\\n\\t\\t\\twalk(xx, yy);\\n\\t\\t\\t}\\n \\t}\\n \\t\\n\\twalk(arbInt(w), arbInt(h));\\n\\tfor (<a, b> <- zip(hor, ver)){\\n\\t\\tprintln((\\\"\\\" | it + \\\"<z>\\\" | z <- a));\\n\\t\\tprintln((\\\"\\\" | it + \\\"<z>\\\" | z <- b));\\n\\t}\\n}\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"Red [\\\"Maze generation\\\"]\\n\\nsize: as-pair to-integer ask \\\"Maze width: \\\" to-integer ask \\\"Maze height: \\\"\\nrandom/seed now/time\\noffsetof: function [pos] [pos/y * size/x + pos/x + 1]\\nvisited?: function [pos] [find visited pos]\\n\\nnewneighbour: function [pos][\\n\\tnnbs: collect [\\n\\t\\tif all [pos/x > 0 not visited? p: pos - 1x0] [keep p]\\n\\t\\tif all [pos/x < (size/x - 1) not visited? p: pos + 1x0] [keep p]\\n\\t\\tif all [pos/y > 0 not visited? p: pos - 0x1] [keep p]\\n\\t\\tif all [pos/y < (size/y - 1) not visited? p: pos + 0x1] [keep p]\\n\\t]\\n\\tpick nnbs random length? nnbs\\n]\\nexpand: function [pos][\\t\\n\\tinsert visited pos\\n\\teither npos: newneighbour pos [\\n\\t\\tinsert exploring npos\\n\\t\\tdo select [\\n\\t\\t\\t0x-1 [o: offsetof npos walls/:o/y: 0]\\n\\t\\t\\t1x0 [o: offsetof pos walls/:o/x: 0]\\n\\t\\t\\t0x1 [o: offsetof pos walls/:o/y: 0]\\n\\t\\t\\t-1x0 [o: offsetof npos walls/:o/x: 0]\\n\\t\\t] npos - pos\\n\\t][\\n\\t\\tremove exploring\\n\\t]\\n]\\nvisited: []\\nwalls: append/dup [] 1x1 size/x * size/y\\nexploring: reduce [random size - 1x1]\\n\\nuntil [\\n\\texpand exploring/1\\n\\tempty? exploring\\n]\\n\\nprint append/dup \\\"\\\" \\\" _\\\" size/x\\nrepeat j size/y [\\n\\tprin \\\"|\\\"\\n\\trepeat i size/x [\\n\\t\\tp: pick walls (j - 1 * size/x + i)\\n\\t\\tprin rejoin [pick \\\" _\\\" 1 + p/y pick \\\" |\\\" 1 + p/x]\\n\\t]\\n\\tprint \\\"\\\"\\n]\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"/*REXX program generates and displays a rectangular solvable maze (of any size). */\\nparse arg rows cols seed . /*allow user to specify the maze size. */\\nif rows='' | rows==',' then rows= 19 /*No rows given? Then use the default.*/\\nif cols='' | cols==',' then cols= 19 /* \\\" cols \\\" ? \\\" \\\" \\\" \\\" */\\nif datatype(seed, 'W') then call random ,,seed /*use a random seed for repeatability.*/\\nht=0; @.=0 /*HT= # rows in grid; @.: default cell*/\\ncall makeRow '┌'copies(\\\"~┬\\\", cols - 1)'~┐' /*construct the top edge of the maze. */\\n /* [↓] construct the maze's grid. */\\n do r=1 for rows; _=; __=; hp= \\\"|\\\"; hj= '├'\\n do c=1 for cols; _= _ || hp'1'; __= __ || hj\\\"~\\\"; hj= '┼'; hp= \\\"│\\\"\\n end /*c*/\\n call makeRow _'│' /*construct the right edge of the cells*/\\n if r\\\\==rows then call makeRow __'┤' /* \\\" \\\" \\\" \\\" \\\" \\\" maze.*/\\n end /*r*/ /* [↑] construct the maze's grid. */\\n\\ncall makeRow '└'copies(\\\"~┴\\\", cols - 1)'~┘' /*construct the bottom edge of the maze*/\\nr!= random(1, rows) *2; c!= random(1, cols) *2; @.r!.c!= 0 /*choose 1st cell.*/\\n /* [↓] traipse through the maze. */\\n do forever; n= hood(r!, c!); if n==0 then if \\\\fCell() then leave /*¬freecell?*/\\n call ?; @._r._c= 0 /*get the (next) maze direction to go. */\\n ro= r!; co= c!; r!= _r; c!= _c /*save original maze cell coordinates. */\\n ?.zr= ?.zr % 2; ?.zc= ?.zc % 2 /*get the maze row and cell directions.*/\\n rw= ro + ?.zr; cw= co + ?.zc /*calculate the next row and column. */\\n @.rw.cw= . /*mark the maze cell as being visited. */\\n end /*forever*/\\n /* [↓] display maze to the terminal. */\\n do r=1 for ht; _=\\n do c=1 for cols*2 + 1; _= _ || @.r.c; end /*c*/\\n if \\\\(r//2) then _= translate(_, '\\\\', .) /*trans to backslash*/\\n @.r= _ /*save the row in @.*/\\n end /*r*/\\n\\n do #=1 for ht; _= @.# /*display the maze to the terminal. */\\n call makeNice /*prettify cell corners and dead─ends. */\\n _= changestr( 1 , _ , 111 ) /*──────these four ────────────────────*/\\n _= changestr( 0 , _ , 000 ) /*───────── statements are ────────────*/\\n _= changestr( . , _ , \\\" \\\" ) /*────────────── used for preserving ──*/\\n _= changestr('~', _ , \\\"───\\\" ) /*────────────────── the aspect ratio. */\\n say translate( _ , '─│' , \\\"═|\\\\10\\\" ) /*make it presentable for the screen. */\\n end /*#*/\\n exit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n@: parse arg _r,_c; return @._r._c /*a fast way to reference a maze cell. */\\nmakeRow: parse arg z; ht= ht+1; do c=1 for length(z); @.ht.c=substr(z,c,1); end; return\\nhood: parse arg rh,ch; return @(rh+2,ch) + @(rh-2,ch) + @(rh,ch-2) + @(rh,ch+2)\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n?: do forever; ?.= 0; ?= random(1, 4); if ?==1 then ?.zc= -2 /*north*/\\n if ?==2 then ?.zr= 2 /* east*/\\n if ?==3 then ?.zc= 2 /*south*/\\n if ?==4 then ?.zr= -2 /* west*/\\n _r= r! + ?.zr; _c= c! + ?.zc; if @._r._c == 1 then return\\n end /*forever*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nfCell: do r=1 for rows; rr= r + r\\n do c=1 for cols; cc= c + c\\n if hood(rr,cc)==1 then do; r!= rr; c!= cc; @.r!.c!= 0; return 1; end\\n end /*c*/ /* [↑] r! and c! are used by invoker.*/\\n end /*r*/; return 0\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nmakeNice: width= length(_); old= # - 1; new= # + 1; old_= @.old; new_= @.new\\n if left(_, 2)=='├.' then _= translate(_, \\\"|\\\", '├')\\n if right(_,2)=='.┤' then _= translate(_, \\\"|\\\", '┤')\\n\\n do k=1 for width while #==1; z= substr(_, k, 1) /*maze top row.*/\\n if z\\\\=='┬' then iterate\\n if substr(new_, k, 1)=='\\\\' then _= overlay(\\\"═\\\", _, k)\\n end /*k*/\\n\\n do k=1 for width while #==ht; z= substr(_, k, 1) /*maze bot row.*/\\n if z\\\\=='┴' then iterate\\n if substr(old_, k, 1)=='\\\\' then _= overlay(\\\"═\\\", _, k)\\n end /*k*/\\n\\n do k=3 to width-2 by 2 while #//2; z= substr(_, k, 1) /*maze mid rows*/\\n if z\\\\=='┼' then iterate\\n le= substr(_ , k-1, 1)\\n ri= substr(_ , k+1, 1)\\n up= substr(old_, k , 1)\\n dw= substr(new_, k , 1)\\n select\\n when le== . & ri== . & up=='│' & dw==\\\"│\\\" then _= overlay('|', _, k)\\n when le=='~' & ri==\\\"~\\\" & up=='\\\\' & dw==\\\"\\\\\\\" then _= overlay('═', _, k)\\n when le=='~' & ri==\\\"~\\\" & up=='\\\\' & dw==\\\"│\\\" then _= overlay('┬', _, k)\\n when le=='~' & ri==\\\"~\\\" & up=='│' & dw==\\\"\\\\\\\" then _= overlay('┴', _, k)\\n when le=='~' & ri== . & up=='\\\\' & dw==\\\"\\\\\\\" then _= overlay('═', _, k)\\n when le== . & ri==\\\"~\\\" & up=='\\\\' & dw==\\\"\\\\\\\" then _= overlay('═', _, k)\\n when le== . & ri== . & up=='│' & dw==\\\"\\\\\\\" then _= overlay('|', _, k)\\n when le== . & ri== . & up=='\\\\' & dw==\\\"│\\\" then _= overlay('|', _, k)\\n when le== . & ri==\\\"~\\\" & up=='\\\\' & dw==\\\"│\\\" then _= overlay('┌', _, k)\\n when le== . & ri==\\\"~\\\" & up=='│' & dw==\\\"\\\\\\\" then _= overlay('└', _, k)\\n when le=='~' & ri== . & up=='\\\\' & dw==\\\"│\\\" then _= overlay('┐', _, k)\\n when le=='~' & ri== . & up=='│' & dw==\\\"\\\\\\\" then _= overlay('┘', _, k)\\n when le=='~' & ri== . & up=='│' & dw==\\\"│\\\" then _= overlay('┤', _, k)\\n when le== . & ri==\\\"~\\\" & up=='│' & dw==\\\"│\\\" then _= overlay('├', _, k)\\n otherwise nop\\n end /*select*/\\n end /*k*/; return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program generates and displays a rectangular solvable maze (of any size). */\\nparse arg rows cols seed . /*allow user to specify the maze size. */\\nif rows='' | rows==\\\",\\\" then rows= 19 /*No rows given? Then use the default.*/\\nif cols='' | cols==\\\",\\\" then cols= 19 /* \\\" cols \\\" ? \\\" \\\" \\\" \\\" */\\nif datatype(seed, 'W') then call random ,,seed /*use a random seed for repeatability.*/\\nht=0; @.=0 /*HT= # rows in grid; @.: default cell*/\\ncall makeRow '┌'copies(\\\"─┬\\\", cols-1)'─┐' /*construct the top edge of the maze.*/\\n\\n do r=1 for rows; _=; __=; hp= \\\"|\\\"; hj= '├'\\n do c=1 for cols; _= _ || hp'1'; __= __ || hj\\\"─\\\"; hj= '┼'; hp= \\\"│\\\"\\n end /*c*/\\n call makeRow _'│' /*construct the right edge of the cells*/\\n if r\\\\==rows then call makeRow __'┤' /* \\\" \\\" \\\" \\\" \\\" \\\" maze.*/\\n end /*r*/ /* [↑] construct the maze's grid. */\\n\\ncall makeRow '└'copies(\\\"─┴\\\", cols-1)'─┘' /*construct the bottom edge of the maze*/\\nr!= random(1, rows)*2; c!= random(1, cols)*2; @.r!.c!= 0 /*choose the 1st cell.*/\\n /* [↓] traipse through the maze. */\\n do forever; n= hood(r!, c!) /*number of free maze cells. */\\n if n==0 then if \\\\fCell() then leave /*if no free maze cells left, then done*/\\n call ?; @._r._c= 0 /*get the (next) maze direction to go. */\\n ro= r!; co= c!; r!= _r; c!= _c /*save the original cell coordinates. */\\n ?.zr= ?.zr % 2; ?.zc= ?.zc % 2 /*get the maze row and cell directions.*/\\n rw= ro + ?.zr; cw= co + ?.zc /*calculate the next maze row and col. */\\n @.rw.cw=. /*mark the maze cell as being visited. */\\n end /*forever*/\\n /* [↓] display maze to the terminal. */\\n do r=1 for ht; _=\\n do c=1 for cols*2 + 1; _= _ || @.r.c; end /*c*/\\n if \\\\(r//2) then _= translate(_, '\\\\',.) /*translate a period to a backslash.*/\\n _= changestr( 1 , _ , 111 ) /*──────these four ────────────────────*/\\n _= changestr( 0 , _ , 000 ) /*───────── statements are ────────────*/\\n _= changestr( . , _ , \\\" \\\" ) /*────────────── used for preserving ──*/\\n _= changestr('─', _ , \\\"───\\\" ) /*────────────────── the aspect ratio. */\\n say translate( _ , '│' , \\\"|\\\\10\\\") /*make it presentable for the screen. */\\n end /*r*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n@: parse arg _r,_c; return @._r._c /*a fast way to reference a maze cell. */\\nmakeRow: parse arg z; ht= ht+1; do c=1 for length(z); @.ht.c=substr(z,c,1); end; return\\nhood: parse arg rh,ch; return @(rh+2,ch) + @(rh-2,ch) + @(rh,ch-2) + @(rh,ch+2)\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n?: do forever; ?.= 0; ?= random(1, 4); if ?==1 then ?.zc= -2 /*north*/\\n if ?==2 then ?.zr= 2 /* east*/\\n if ?==3 then ?.zc= 2 /*south*/\\n if ?==4 then ?.zr= -2 /* west*/\\n _r= r! + ?.zr; _c= c! + ?.zc; if @._r._c == 1 then return\\n end /*forever*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nfCell: do r=1 for rows; rr= r + r\\n do c=1 for cols; cc= c + c\\n if hood(rr,cc)==1 then do; r!= rr; c!= cc; @.r!.c!= 0; return 1; end\\n end /*c*/ /* [↑] r! and c! are used by invoker.*/\\n end /*r*/; return 0\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/* REXX ***************************************************************\\n* 04.09.2013 Walter Pachl\\n**********************************************************************/\\nParse Arg imax jmax seed\\nIf imax='' Then imax=10\\nIf jmax='' Then jmax=15\\nIf seed='' Then seed=4711\\nc='123456789'||,\\n 'abcdefghijklmnopqrstuvwxyz'||,\\n translate('abcdefghijklmnopqrstuvwxyz')\\nc=copies(c,10)\\ncall random 1,10,seed\\nid=2*imax+1 /* vertical dimension of a.i.j */\\njd=2*jmax+1 /* horizontal dimension of a.i.j */\\na.=1 /* mark all borders present */\\np.='.' /* Initialize all grid points */\\npl.=0 /* path list */\\nii=random(1,imax) /* find a start position */\\njj=random(1,jmax)\\np=1 /* first position */\\nna=1 /* number of points used */\\nDo si=1 To 1000 /* Do Forever - see Leave */\\n /* Say 'loop' si na show progress */\\n Call path ii,jj /* compute a path starting at ii/jj */\\n If na=imax*jmax Then /* all points used */\\n Leave /* we are done */\\n Parse Value select_next() With ii jj /* get a new start from a path*/\\n End\\n\\n/***************\\nDo i=1 To imax\\n ol=''\\n Do j=1 To jmax\\n ol=ol||p.i.j\\n End\\n Say ol\\n End\\nSay ' '\\n***************/\\nCall show\\n/***********************\\nDo pi=1 To imax*jmax\\n Say right(pi,3) pos.pi\\n End\\n***********************/\\nExit\\n\\npath: Procedure Expose p. np. p pl. c a. na imax jmax id jd pos.\\n/**********************************************************************\\n* compute a path starting from point (ii,jj)\\n**********************************************************************/\\n Parse Arg ii,jj\\n p.ii.jj='1'\\n pos.p=ii jj\\n Do pp=1 to 50 /* compute a path of maximum length 50*/\\n neighbors=neighbors(ii,jj) /* number of free neighbors */\\n Select\\n When neighbors=1 Then /* just one */\\n Call advance 1,ii,jj /* go for it */\\n When neighbors>0 Then Do /* more Than 1 */\\n ch=random(1,neighbors) /* choose one possibility */\\n Call advance ch,ii,jj /* and go for that */\\n End\\n Otherwise /* none available */\\n Leave\\n End\\n End\\n Return\\n\\nneighbors: Procedure Expose p. np. imax jmax neighbors pl.\\n/**********************************************************************\\n* count the number of free neighbors of point (i,j)\\n**********************************************************************/\\n Parse Arg i,j\\n neighbors=0\\n in=i-1; If in>0 Then Call check in,j\\n in=i+1; If in<=imax Then Call check in,j\\n jn=j-1; If jn>0 Then Call check i,jn\\n jn=j+1; If jn<=jmax Then Call check i,jn\\n Return neighbors\\n\\ncheck: Procedure Expose p. imax jmax np. neighbors pl.\\n/**********************************************************************\\n* check if point (i,j) is free and note it as possible successor\\n**********************************************************************/\\n Parse Arg i,j\\n If p.i.j='.' Then Do /* point is free */\\n neighbors=neighbors+1 /* number of free neighbors */\\n np.neighbors=i j /* note it as possible choice */\\n End\\n Return\\n\\nadvance: Procedure Expose p pos. np. p. c ii jj a. na pl. pos.\\n/**********************************************************************\\n* move to the next point of the current path\\n**********************************************************************/\\n Parse Arg ch,pii,pjj\\n Parse Var np.ch ii jj\\n p=p+1 /* position number */\\n pos.p=ii jj /* note its coordinates */\\n p.ii.jj=substr(c,p,1) /* mark the point as used */\\n ai=pii+ii /* vertical border position */\\n aj=pjj+jj /* horizontal border position */\\n a.ai.aj=0 /* tear the border down */\\n na=na+1 /* number of used positions */\\n z=pl.0+1 /* add the point to the list */\\n pl.z=ii jj /* of follow-up start pos. */\\n pl.0=z\\n Return\\n\\nshow: Procedure Expose id jd a. na\\n/*********************************************************************\\n* Show the resulting maze\\n*********************************************************************/\\n say 'mgg 6 18 4711'\\n say 'show na='na\\n Do i=1 To id\\n ol=''\\n Do j=1 To jd\\n If i//2=1 Then Do /* odd lines */\\n If a.i.j=1 Then Do /* border to be drawn */\\n If j//2=0 Then\\n ol=ol||'---' /* draw the border */\\n Else\\n ol=ol'+'\\n End\\n Else Do /* border was torn down */\\n If j//2=0 Then\\n ol=ol||' ' /* blanks instead of border */\\n Else\\n ol=ol||'+'\\n End\\n End\\n Else Do /* even line */\\n If a.i.j=1 Then Do\\n If j//2=0 Then /* even column */\\n ol=ol||' ' /* moving space */\\n Else /* odd column */\\n ol=ol||'|' /* draw the border */\\n End\\n Else /* border was torn down */\\n ol=ol||' ' /* blank instead of border */\\n End\\n End\\n Select\\n When i=6 Then ol=overlay('A',ol,11)\\n When i=8 Then ol=overlay('B',ol, 3)\\n Otherwise Nop\\n End\\n Say ol format(i,2)\\n End\\n Return\\n\\nselect_next: Procedure Expose p. pl. imax jmax\\n/*********************************************************************\\n* look for a point to start the nnext path\\n*********************************************************************/\\n Do Until neighbors>0 /* loop until one is found */\\n n=pl.0 /* number of points recorded */\\n s=random(1,n) /* pick a random index */\\n Parse Var pl.s is js /* its coordinates */\\n neighbors=neighbors(is,js) /* count free neighbors */\\n If neighbors=0 Then Do /* if there is none */\\n pl.s=pl.n /* remove this point */\\n pl.0=pl.0-1\\n End\\n End\\n Return is js /* return the new start point*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"class Maze\\n DIRECTIONS = [ [1, 0], [-1, 0], [0, 1], [0, -1] ]\\n\\n def initialize(width, height)\\n @width = width\\n @height = height\\n @start_x = rand(width)\\n @start_y = 0\\n @end_x = rand(width)\\n @end_y = height - 1\\n\\n # Which walls do exist? Default to \\\"true\\\". Both arrays are\\n # one element bigger than they need to be. For example, the\\n # @vertical_walls[x][y] is true if there is a wall between\\n # (x,y) and (x+1,y). The additional entry makes printing easier.\\n @vertical_walls = Array.new(width) { Array.new(height, true) }\\n @horizontal_walls = Array.new(width) { Array.new(height, true) }\\n # Path for the solved maze.\\n @path = Array.new(width) { Array.new(height) }\\n\\n # \\\"Hack\\\" to print the exit.\\n @horizontal_walls[@end_x][@end_y] = false\\n\\n # Generate the maze.\\n generate\\n end\\n\\n # Print a nice ASCII maze.\\n def print\\n # Special handling: print the top line.\\n puts @width.times.inject(\\\"+\\\") {|str, x| str << (x == @start_x ? \\\" +\\\" : \\\"---+\\\")}\\n\\n # For each cell, print the right and bottom wall, if it exists.\\n @height.times do |y|\\n line = @width.times.inject(\\\"|\\\") do |str, x|\\n str << (@path[x][y] ? \\\" * \\\" : \\\" \\\") << (@vertical_walls[x][y] ? \\\"|\\\" : \\\" \\\")\\n end\\n puts line\\n\\n puts @width.times.inject(\\\"+\\\") {|str, x| str << (@horizontal_walls[x][y] ? \\\"---+\\\" : \\\" +\\\")}\\n end\\n end\\n\\n private\\n\\n # Reset the VISITED state of all cells.\\n def reset_visiting_state\\n @visited = Array.new(@width) { Array.new(@height) }\\n end\\n\\n # Is the given coordinate valid and the cell not yet visited?\\n def move_valid?(x, y)\\n (0...@width).cover?(x) && (0...@height).cover?(y) && !@visited[x][y]\\n end\\n\\n # Generate the maze.\\n def generate\\n reset_visiting_state\\n generate_visit_cell(@start_x, @start_y)\\n end\\n\\n # Depth-first maze generation.\\n def generate_visit_cell(x, y)\\n # Mark cell as visited.\\n @visited[x][y] = true\\n\\n # Randomly get coordinates of surrounding cells (may be outside\\n # of the maze range, will be sorted out later).\\n coordinates = DIRECTIONS.shuffle.map { |dx, dy| [x + dx, y + dy] }\\n\\n for new_x, new_y in coordinates\\n next unless move_valid?(new_x, new_y)\\n\\n # Recurse if it was possible to connect the current and\\n # the cell (this recursion is the \\\"depth-first\\\" part).\\n connect_cells(x, y, new_x, new_y)\\n generate_visit_cell(new_x, new_y)\\n end\\n end\\n\\n # Try to connect two cells. Returns whether it was valid to do so.\\n def connect_cells(x1, y1, x2, y2)\\n if x1 == x2\\n # Cells must be above each other, remove a horizontal wall.\\n @horizontal_walls[x1][ [y1, y2].min ] = false\\n else\\n # Cells must be next to each other, remove a vertical wall.\\n @vertical_walls[ [x1, x2].min ][y1] = false\\n end\\n end\\nend\\n\\n# Demonstration:\\nmaze = Maze.new 20, 10\\nmaze.print\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use rand::{thread_rng, Rng, rngs::ThreadRng};\\n\\nconst WIDTH: usize = 16;\\nconst HEIGHT: usize = 16;\\n\\n#[derive(Clone, Copy)]\\nstruct Cell {\\n col: usize,\\n row: usize,\\n}\\n\\nimpl Cell {\\n fn from(col: usize, row: usize) -> Cell {\\n Cell {col, row}\\n }\\n}\\n\\nstruct Maze {\\n cells: [[bool; HEIGHT]; WIDTH], //cell visited/non visited\\n walls_h: [[bool; WIDTH]; HEIGHT + 1], //horizontal walls existing/removed\\n walls_v: [[bool; WIDTH + 1]; HEIGHT], //vertical walls existing/removed\\n thread_rng: ThreadRng, //Random numbers generator\\n}\\n\\nimpl Maze {\\n\\n ///Inits the maze, with all the cells unvisited and all the walls active\\n fn new() -> Maze {\\n Maze {\\n cells: [[true; HEIGHT]; WIDTH],\\n walls_h: [[true; WIDTH]; HEIGHT + 1],\\n walls_v: [[true; WIDTH + 1]; HEIGHT],\\n thread_rng: thread_rng(),\\n }\\n }\\n\\n ///Randomly chooses the starting cell\\n fn first(&mut self) -> Cell {\\n Cell::from(self.thread_rng.gen_range(0, WIDTH), self.thread_rng.gen_range(0, HEIGHT))\\n }\\n\\n ///Opens the enter and exit doors\\n fn open_doors(&mut self) {\\n let from_top: bool = self.thread_rng.gen();\\n let limit = if from_top { WIDTH } else { HEIGHT };\\n let door = self.thread_rng.gen_range(0, limit);\\n let exit = self.thread_rng.gen_range(0, limit);\\n if from_top {\\n self.walls_h[0][door] = false;\\n self.walls_h[HEIGHT][exit] = false;\\n } else {\\n self.walls_v[door][0] = false;\\n self.walls_v[exit][WIDTH] = false;\\n }\\n }\\n\\n ///Removes a wall between the two Cell arguments\\n fn remove_wall(&mut self, cell1: &Cell, cell2: &Cell) {\\n if cell1.row == cell2.row {\\n self.walls_v[cell1.row][if cell1.col > cell2.col { cell1.col } else { cell2.col }] = false;\\n } else {\\n self.walls_h[if cell1.row > cell2.row { cell1.row } else { cell2.row }][cell1.col] = false;\\n };\\n }\\n\\n ///Returns a random non-visited neighbor of the Cell passed as argument\\n fn neighbor(&mut self, cell: &Cell) -> Option<Cell> {\\n self.cells[cell.col][cell.row] = false;\\n let mut neighbors = Vec::new();\\n if cell.col > 0 && self.cells[cell.col - 1][cell.row] { neighbors.push(Cell::from(cell.col - 1, cell.row)); }\\n if cell.row > 0 && self.cells[cell.col][cell.row - 1] { neighbors.push(Cell::from(cell.col, cell.row - 1)); }\\n if cell.col < WIDTH - 1 && self.cells[cell.col + 1][cell.row] { neighbors.push(Cell::from(cell.col + 1, cell.row)); }\\n if cell.row < HEIGHT - 1 && self.cells[cell.col][cell.row + 1] { neighbors.push(Cell::from(cell.col, cell.row + 1)); }\\n if neighbors.is_empty() {\\n None\\n } else {\\n let next = neighbors.get(self.thread_rng.gen_range(0, neighbors.len())).unwrap();\\n self.remove_wall(cell, next);\\n Some(*next)\\n }\\n }\\n\\n ///Builds the maze (runs the Depth-first search algorithm)\\n fn build(&mut self) {\\n let mut cell_stack: Vec<Cell> = Vec::new();\\n let mut next = self.first();\\n loop {\\n while let Some(cell) = self.neighbor(&next) {\\n cell_stack.push(cell);\\n next = cell;\\n }\\n match cell_stack.pop() {\\n Some(cell) => next = cell,\\n None => break,\\n }\\n }\\n }\\n\\n ///Displays a wall\\n fn paint_wall(h_wall: bool, active: bool) {\\n if h_wall {\\n print!(\\\"{}\\\", if active { \\\"+---\\\" } else { \\\"+ \\\" });\\n } else {\\n print!(\\\"{}\\\", if active { \\\"| \\\" } else { \\\" \\\" });\\n }\\n }\\n\\n ///Displays a final wall for a row\\n fn paint_close_wall(h_wall: bool) {\\n if h_wall { println!(\\\"+\\\") } else { println!() }\\n }\\n\\n ///Displays a whole row of walls\\n fn paint_row(&self, h_walls: bool, index: usize) {\\n let iter = if h_walls { self.walls_h[index].iter() } else { self.walls_v[index].iter() };\\n for &wall in iter {\\n Maze::paint_wall(h_walls, wall);\\n }\\n Maze::paint_close_wall(h_walls);\\n }\\n\\n ///Paints the maze\\n fn paint(&self) {\\n for i in 0 .. HEIGHT {\\n self.paint_row(true, i);\\n self.paint_row(false, i);\\n }\\n self.paint_row(true, HEIGHT);\\n }\\n}\\n\\nfn main() {\\n let mut maze = Maze::new();\\n maze.build();\\n maze.open_doors();\\n maze.paint();\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import scala.util.Random\\n\\nobject MazeTypes {\\n case class Direction(val dx: Int, val dy: Int)\\n\\n case class Loc(val x: Int, val y: Int) {\\n def +(that: Direction): Loc = Loc(x + that.dx, y + that.dy)\\n }\\n\\n case class Door(val from: Loc, to: Loc)\\n\\n val North = Direction(0,-1)\\n val South = Direction(0,1)\\n val West = Direction(-1,0)\\n val East = Direction(1,0)\\n val directions = Set(North, South, West, East)\\n}\\n\\nobject MazeBuilder {\\n import MazeTypes._\\n\\n def shuffle[T](set: Set[T]): List[T] = Random.shuffle(set.toList)\\n\\n def buildImpl(current: Loc, grid: Grid): Grid = {\\n var newgrid = grid.markVisited(current)\\n val nbors = shuffle(grid.neighbors(current))\\n nbors.foreach { n =>\\n if (!newgrid.isVisited(n)) {\\n newgrid = buildImpl(n, newgrid.markVisited(current).addDoor(Door(current, n)))\\n }\\n }\\n newgrid\\n }\\n\\n def build(width: Int, height: Int): Grid = {\\n val exit = Loc(width-1, height-1)\\n buildImpl(exit, new Grid(width, height, Set(), Set()))\\n }\\n}\\n\\nclass Grid(val width: Int, val height: Int, val doors: Set[Door], val visited: Set[Loc]) {\\n\\n def addDoor(door: Door): Grid =\\n new Grid(width, height, doors + door, visited)\\n\\n def markVisited(loc: Loc): Grid =\\n new Grid(width, height, doors, visited + loc)\\n\\n def isVisited(loc: Loc): Boolean =\\n visited.contains(loc)\\n\\n def neighbors(current: Loc): Set[Loc] =\\n directions.map(current + _).filter(inBounds(_)) -- visited\\n\\n def printGrid(): List[String] = {\\n (0 to height).toList.flatMap(y => printRow(y))\\n }\\n\\n private def inBounds(loc: Loc): Boolean =\\n loc.x >= 0 && loc.x < width && loc.y >= 0 && loc.y < height\\n\\n private def printRow(y: Int): List[String] = {\\n val row = (0 until width).toList.map(x => printCell(Loc(x, y)))\\n val rightSide = if (y == height-1) \\\" \\\" else \\\"|\\\"\\n val newRow = row :+ List(\\\"+\\\", rightSide)\\n List.transpose(newRow).map(_.mkString)\\n }\\n\\n private val entrance = Loc(0,0)\\n\\n private def printCell(loc: Loc): List[String] = {\\n if (loc.y == height)\\n List(\\\"+--\\\")\\n else List(\\n if (openNorth(loc)) \\\"+ \\\" else \\\"+--\\\",\\n if (openWest(loc) || loc == entrance) \\\" \\\" else \\\"| \\\"\\n )\\n }\\n\\n def openNorth(loc: Loc): Boolean = openInDirection(loc, North)\\n\\n def openWest(loc: Loc): Boolean = openInDirection(loc, West)\\n\\n private def openInDirection(loc: Loc, dir: Direction): Boolean =\\n doors.contains(Door(loc, loc + dir)) || doors.contains(Door(loc + dir, loc))\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"var(w:5, h:5) = ARGV.map{.to_i}...\\nvar avail = (w * h)\\n\\n# cell is padded by sentinel col and row, so I don't check array bounds\\nvar cell = (1..h -> map {([true] * w) + [false]} + [[false] * w+1])\\nvar ver = (1..h -> map {[\\\"| \\\"] * w })\\nvar hor = (0..h -> map {[\\\"+--\\\"] * w })\\n\\nfunc walk(x, y) {\\n cell[y][x] = false\\n avail-- > 0 || return nil # no more cells\\n\\n var d = [[-1, 0], [0, 1], [1, 0], [0, -1]]\\n while (!d.is_empty) {\\n var i = d.pop_rand\\n var (x1, y1) = (x + i[0], y + i[1])\\n\\n cell[y1][x1] || next\\n\\n if (x == x1) { hor[[y1, y].max][x] = '+ ' }\\n if (y == y1) { ver[y][[x1, x].max] = ' ' }\\n walk(x1, y1)\\n }\\n}\\n\\nwalk(w.rand.int, h.rand.int) # generate\\n\\nfor i in (0 .. h) {\\n say (hor[i].join('') + '+')\\n if (i < h) {\\n say (ver[i].join('') + '|')\\n }\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"// some useful functions\\n(\\n~grid = { 0 ! 60 } ! 60;\\n\\n~at = { |coord|\\n\\tvar col = ~grid.at(coord[0]);\\n\\tif(col.notNil) { col.at(coord[1]) }\\n};\\n~put = { |coord, value|\\n\\tvar col = ~grid.at(coord[0]);\\n\\tif(col.notNil) { col.put(coord[1], value) }\\n};\\n\\n~coord = ~grid.shape.rand;\\n~next = { |p|\\n\\tvar possible = [p] + [[0, 1], [1, 0], [-1, 0], [0, -1]];\\n\\tpossible = possible.select { |x|\\n\\t\\tvar c = ~at.(x);\\n\\t\\tc.notNil and: { c == 0 }\\n\\t};\\n\\tpossible.choose\\n};\\n~walkN = { |p, scale|\\n\\tvar next = ~next.(p);\\n\\tif(next.notNil) {\\n\\t\\t~put.(next, 1);\\n\\t\\tPen.lineTo(~topoint.(next, scale));\\n\\t\\t~walkN.(next, scale);\\n\\t\\t~walkN.(next, scale);\\n\\t\\tPen.moveTo(~topoint.(p, scale));\\n\\t};\\n};\\n\\n~topoint = { |c, scale| (c + [1, 1] * scale).asPoint };\\n\\n)\\n\\n// do the drawing\\n(\\nvar b, w;\\n\\nb = Rect(100, 100, 700, 700);\\nw = Window(\\\"so-a-mazing\\\", b);\\nw.view.background_(Color.black);\\n\\nw.drawFunc = {\\n\\tvar p = ~grid.shape.rand;\\n\\tvar scale = b.width / ~grid.size * 0.98;\\n\\tPen.moveTo(~topoint.(p, scale));\\n\\t~walkN.(p, scale);\\n\\tPen.width = scale / 4;\\n\\tPen.color = Color.white;\\n\\tPen.stroke;\\n};\\nw.front.refresh;\\n)\\n\",\n \"language\": \"SuperCollider\"\n },\n {\n \"code\": \"import Foundation\\n\\nextension Array {\\n mutating func shuffle() {\\n guard count > 1 else { return }\\n\\n for i in 0..<self.count - 1 {\\n let j = Int(arc4random_uniform(UInt32(count - i))) + i\\n guard i != j else { continue }\\n swap(&self[i], &self[j])\\n }\\n }\\n}\\n\\nenum Direction:Int {\\n case north = 1\\n case south = 2\\n case east = 4\\n case west = 8\\n\\n static var allDirections:[Direction] {\\n return [Direction.north, Direction.south, Direction.east, Direction.west]\\n }\\n\\n var opposite:Direction {\\n switch self {\\n case .north:\\n return .south\\n case .south:\\n return .north\\n case .east:\\n return .west\\n case .west:\\n return .east\\n }\\n }\\n\\n var diff:(Int, Int) {\\n switch self {\\n case .north:\\n return (0, -1)\\n case .south:\\n return (0, 1)\\n case .east:\\n return (1, 0)\\n case .west:\\n return (-1, 0)\\n }\\n }\\n\\n var char:String {\\n switch self {\\n case .north:\\n return \\\"N\\\"\\n case .south:\\n return \\\"S\\\"\\n case .east:\\n return \\\"E\\\"\\n case .west:\\n return \\\"W\\\"\\n }\\n }\\n\\n}\\n\\nclass MazeGenerator {\\n let x:Int\\n let y:Int\\n var maze:[[Int]]\\n\\n init(_ x:Int, _ y:Int) {\\n self.x = x\\n self.y = y\\n let column = [Int](repeating: 0, count: y)\\n self.maze = [[Int]](repeating: column, count: x)\\n generateMaze(0, 0)\\n }\\n\\n private func generateMaze(_ cx:Int, _ cy:Int) {\\n var directions = Direction.allDirections\\n directions.shuffle()\\n for direction in directions {\\n let (dx, dy) = direction.diff\\n let nx = cx + dx\\n let ny = cy + dy\\n if inBounds(nx, ny) && maze[nx][ny] == 0 {\\n maze[cx][cy] |= direction.rawValue\\n maze[nx][ny] |= direction.opposite.rawValue\\n generateMaze(nx, ny)\\n }\\n }\\n }\\n\\n private func inBounds(_ testX:Int, _ testY:Int) -> Bool {\\n return inBounds(value:testX, upper:self.x) && inBounds(value:testY, upper:self.y)\\n }\\n\\n private func inBounds(value:Int, upper:Int) -> Bool {\\n return (value >= 0) && (value < upper)\\n }\\n\\n func display() {\\n let cellWidth = 3\\n for j in 0..<y {\\n // Draw top edge\\n var topEdge = \\\"\\\"\\n for i in 0..<x {\\n topEdge += \\\"+\\\"\\n topEdge += String(repeating: (maze[i][j] & Direction.north.rawValue) == 0 ? \\\"-\\\" : \\\" \\\", count: cellWidth)\\n }\\n topEdge += \\\"+\\\"\\n print(topEdge)\\n\\n // Draw left edge\\n var leftEdge = \\\"\\\"\\n for i in 0..<x {\\n leftEdge += (maze[i][j] & Direction.west.rawValue) == 0 ? \\\"|\\\" : \\\" \\\"\\n leftEdge += String(repeating: \\\" \\\", count: cellWidth)\\n }\\n leftEdge += \\\"|\\\"\\n print(leftEdge)\\n }\\n\\n // Draw bottom edge\\n var bottomEdge = \\\"\\\"\\n for _ in 0..<x {\\n bottomEdge += \\\"+\\\"\\n bottomEdge += String(repeating: \\\"-\\\", count: cellWidth)\\n }\\n bottomEdge += \\\"+\\\"\\n print(bottomEdge)\\n }\\n\\n func displayInts() {\\n for j in 0..<y {\\n var line = \\\"\\\"\\n for i in 0..<x {\\n line += String(maze[i][j]) + \\\"\\\\t\\\"\\n }\\n print(line)\\n }\\n }\\n\\n func displayDirections() {\\n for j in 0..<y {\\n var line = \\\"\\\"\\n for i in 0..<x {\\n line += getDirectionsAsString(maze[i][j]) + \\\"\\\\t\\\"\\n }\\n print(line)\\n }\\n }\\n\\n private func getDirectionsAsString(_ value:Int) -> String {\\n var line = \\\"\\\"\\n for direction in Direction.allDirections {\\n if (value & direction.rawValue) != 0 {\\n line += direction.char\\n }\\n }\\n return line\\n }\\n}\\n\\n\\nlet x = 20\\nlet y = 10\\nlet maze = MazeGenerator(x, y)\\nmaze.display()\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"package require TclOO; # Or Tcl 8.6\\n\\n# Helper to pick a random number\\nproc rand n {expr {int(rand() * $n)}}\\n# Helper to pick a random element of a list\\nproc pick list {lindex $list [rand [llength $list]]}\\n# Helper _function_ to index into a list of lists\\nproc tcl::mathfunc::idx {v x y} {lindex $v $x $y}\\n\\noo::class create maze {\\n variable x y horiz verti content\\n constructor {width height} {\\n\\tset y $width\\n\\tset x $height\\n\\n\\tset n [expr {$x * $y - 1}]\\n\\tif {$n < 0} {error \\\"illegal maze dimensions\\\"}\\n\\tset horiz [set verti [lrepeat $x [lrepeat $y 0]]]\\n\\t# This matrix holds the output for the Maze Solving task; not used for generation\\n\\tset content [lrepeat $x [lrepeat $y \\\" \\\"]]\\n\\tset unvisited [lrepeat [expr {$x+2}] [lrepeat [expr {$y+2}] 0]]\\n\\t# Helper to write into a list of lists (with offsets)\\n\\tproc unvisited= {x y value} {\\n\\t upvar 1 unvisited u\\n\\t lset u [expr {$x+1}] [expr {$y+1}] $value\\n\\t}\\n\\n\\tlappend stack [set here [list [rand $x] [rand $y]]]\\n\\tfor {set j 0} {$j < $x} {incr j} {\\n\\t for {set k 0} {$k < $y} {incr k} {\\n\\t\\tunvisited= $j $k [expr {$here ne [list $j $k]}]\\n\\t }\\n\\t}\\n\\n\\twhile {0 < $n} {\\n\\t lassign $here hx hy\\n\\t set neighbours {}\\n\\t foreach {dx dy} {1 0 0 1 -1 0\\t 0 -1} {\\n\\t\\tif {idx($unvisited, $hx+$dx+1, $hy+$dy+1)} {\\n\\t\\t lappend neighbours [list [expr {$hx+$dx}] [expr {$hy+$dy}]]\\n\\t\\t}\\n\\t }\\n\\t if {[llength $neighbours]} {\\n\\t\\tlassign [set here [pick $neighbours]] nx ny\\n\\t\\tunvisited= $nx $ny 0\\n\\t\\tif {$nx == $hx} {\\n\\t\\t lset horiz $nx [expr {min($ny, $hy)}] 1\\n\\t\\t} else {\\n\\t\\t lset verti [expr {min($nx, $hx)}] $ny 1\\n\\t\\t}\\n\\t\\tlappend stack $here\\n\\t\\tincr n -1\\n\\t } else {\\n\\t\\tset here [lindex $stack end]\\n\\t\\tset stack [lrange $stack 0 end-1]\\n\\t }\\n\\t}\\n\\n\\trename unvisited= {}\\n }\\n\\n # Maze displayer; takes a maze dictionary, returns a string\\n method view {} {\\n\\tset text {}\\n\\tfor {set j 0} {$j < $x*2+1} {incr j} {\\n\\t set line {}\\n\\t for {set k 0} {$k < $y*4+1} {incr k} {\\n\\t\\tif {$j%2 && $k%4==2} {\\n\\t\\t # At the centre of the cell, put the \\\"content\\\" of the cell\\n\\t\\t append line [expr {idx($content, $j/2, $k/4)}]\\n\\t\\t} elseif {$j%2 && ($k%4 || $k && idx($horiz, $j/2, $k/4-1))} {\\n\\t\\t append line \\\" \\\"\\n\\t\\t} elseif {$j%2} {\\n\\t\\t append line \\\"|\\\"\\n\\t\\t} elseif {0 == $k%4} {\\n\\t\\t append line \\\"+\\\"\\n\\t\\t} elseif {$j && idx($verti, $j/2-1, $k/4)} {\\n\\t\\t append line \\\" \\\"\\n\\t\\t} else {\\n\\t\\t append line \\\"-\\\"\\n\\t\\t}\\n\\t }\\n\\t if {!$j} {\\n\\t\\tlappend text [string replace $line 1 3 \\\" \\\"]\\n\\t } elseif {$x*2-1 == $j} {\\n\\t\\tlappend text [string replace $line end end \\\" \\\"]\\n\\t } else {\\n\\t\\tlappend text $line\\n\\t }\\n\\t}\\n\\treturn [join $text \\\\n]\\n }\\n}\\n\\n# Demonstration\\nmaze create m 11 8\\nputs [m view]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"@(bind (width height) (15 15))\\n@(do\\n (defvar *r* (make-random-state nil))\\n (defvar vi)\\n (defvar pa)\\n\\n (defun neigh (loc)\\n (let ((x (from loc))\\n (y (to loc)))\\n (list (- x 1)..y (+ x 1)..y\\n x..(- y 1) x..(+ y 1))))\\n\\n (defun make-maze-rec (cu)\\n (set [vi cu] t)\\n (each ((ne (shuffle (neigh cu))))\\n (cond ((not [vi ne])\\n (push ne [pa cu])\\n (push cu [pa ne])\\n (make-maze-rec ne)))))\\n\\n (defun make-maze (w h)\\n (let ((vi (hash :equal-based))\\n (pa (hash :equal-based)))\\n (each ((x (range -1 w)))\\n (set [vi x..-1] t)\\n (set [vi x..h] t))\\n (each ((y (range* 0 h)))\\n (set [vi -1..y] t)\\n (set [vi w..y] t))\\n (make-maze-rec 0..0)\\n pa))\\n\\n (defun print-tops (pa w j)\\n (each ((i (range* 0 w)))\\n (if (memqual i..(- j 1) [pa i..j])\\n (put-string \\\"+ \\\")\\n (put-string \\\"+----\\\")))\\n (put-line \\\"+\\\"))\\n\\n (defun print-sides (pa w j)\\n (let ((str \\\"\\\"))\\n (each ((i (range* 0 w)))\\n (if (memqual (- i 1)..j [pa i..j])\\n (set str `@str `)\\n (set str `@str| `)))\\n (put-line `@str|\\\\n@str|`)))\\n\\n (defun print-maze (pa w h)\\n (each ((j (range* 0 h)))\\n (print-tops pa w j)\\n (print-sides pa w j))\\n (print-tops pa w h)))\\n@;;\\n@(bind m @(make-maze width height))\\n@(do (print-maze m width height))\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"(defvar vi) ;; visited hash\\n(defvar pa) ;; path connectivity hash\\n(defvar sc) ;; count, derived from straightness fator\\n\\n(defun rnd-pick (list)\\n (if list [list (rand (length list))]))\\n\\n(defun neigh (loc)\\n (let ((x (from loc))\\n (y (to loc)))\\n (list (- x 1)..y (+ x 1)..y\\n x..(- y 1) x..(+ y 1))))\\n\\n(defun make-maze-impl (cu)\\n (let ((q (list cu))\\n (c sc))\\n (set [vi cu] t)\\n (while q\\n (let* ((cu (first q))\\n (ne (rnd-pick (remove-if vi (neigh cu)))))\\n (cond (ne (set [vi ne] t)\\n (push ne [pa cu])\\n (push cu [pa ne])\\n (push ne q)\\n (cond ((<= (dec c) 0)\\n (set q (shuffle q))\\n (set c sc))))\\n (t (pop q)))))))\\n\\n(defun make-maze (w h sf)\\n (let ((vi (hash :equal-based))\\n (pa (hash :equal-based))\\n (sc (max 1 (trunc (* sf w h) 100))))\\n (each ((x (range -1 w)))\\n (set [vi x..-1] t)\\n (set [vi x..h] t))\\n (each ((y (range* 0 h)))\\n (set [vi -1..y] t)\\n (set [vi w..y] t))\\n (make-maze-impl 0..0)\\n pa))\\n\\n(defun print-tops (pa w j)\\n (each ((i (range* 0 w)))\\n (if (memqual i..(- j 1) [pa i..j])\\n (put-string \\\"+ \\\")\\n (put-string \\\"+----\\\")))\\n (put-line \\\"+\\\"))\\n\\n(defun print-sides (pa w j)\\n (let ((str \\\"\\\"))\\n (each ((i (range* 0 w)))\\n (if (memqual (- i 1)..j [pa i..j])\\n (set str `@str `)\\n (set str `@str| `)))\\n (put-line `@str|\\\\n@str|`)))\\n\\n(defun print-maze (pa w h)\\n (each ((j (range* 0 h)))\\n (print-tops pa w j)\\n (print-sides pa w j))\\n (print-tops pa w h))\\n\\n(defun usage ()\\n (let ((invocation (ldiff *full-args* *args*)))\\n (put-line \\\"usage: \\\")\\n (put-line `@invocation <width> <height> [<straightness>]`)\\n (put-line \\\"straightness-factor is a percentage, defaulting to 15\\\")\\n (exit 1)))\\n\\n(let ((args [mapcar int-str *args*])\\n (*random-state* (make-random-state nil)))\\n (if (memq nil args)\\n (usage))\\n (tree-case args\\n ((w h s ju . nk) (usage))\\n ((w h : (s 15)) (set w (max 1 w))\\n (set h (max 1 h))\\n (print-maze (make-maze w h s) w h))\\n (else (usage))))\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"interface mazeData{\\n\\tnodes:Node[]\\n\\tx:number\\n\\ty:number\\n\\tblockSize:number\\n}\\n\\nclass Node{\\n\\tx:number\\n\\ty:number\\n\\twallsTo:Node[]\\n\\tvisited = false\\n\\tconstructor(x:number,y:number){\\n\\t\\tthis.x = x\\n\\t\\tthis.y = y\\n\\t}\\n\\tgetTouchingNodes(nodes:Node[],blockSize:number){\\n return nodes.filter(n=>\\n (this != n) &&\\n (Math.hypot(this.x-n.x,this.y-n.y) == blockSize )\\n )\\n }\\n\\tdraw(ctx:CanvasRenderingContext2D,blockSize:number){\\n ctx.fillStyle ='black'\\n this.wallsTo.forEach(el=>{\\n ctx.save()\\n ctx.translate(this.x,this.y)\\n ctx.rotate(Math.atan2(this.y-el.y,this.x-el.x)+ Math.PI)\\n ctx.beginPath()\\n ctx.moveTo(blockSize/2,blockSize/2)\\n ctx.lineTo(blockSize/2,-blockSize/2)\\n ctx.stroke()\\n ctx.restore()\\n })\\n }\\n}\\n\\nexport function maze(x:number,y:number):mazeData {\\n\\tlet blockSize = 20\\n\\tx *= blockSize\\n\\ty *= blockSize\\n\\tlet nodes = Array((x/blockSize)*(y/blockSize)).fill(0).map((_el,i)=>\\n\\t\\tnew Node(\\n\\t\\t\\t(i%(x/blockSize)*(blockSize))+(blockSize/2),\\n\\t\\t\\t(Math.floor(i/(x/blockSize))*(blockSize))+(blockSize/2)\\n\\t\\t)\\n\\t)\\n\\tnodes.forEach(n=>n.wallsTo = n.getTouchingNodes(nodes,blockSize))\\n\\tlet que = [nodes[0]]\\n\\twhile(que.length > 0){\\n\\t\\tlet current = que.shift()\\n\\t\\tlet unvisited = current\\n\\t\\t.getTouchingNodes(nodes,blockSize)\\n\\t\\t.filter(el=>!el.visited)\\n\\t\\tif(unvisited.length >0){\\n\\t\\t\\tque.push(current)\\n\\t\\t\\tlet chosen = unvisited[Math.floor(Math.random()*unvisited.length)];\\n\\t\\t\\tcurrent.wallsTo = current.wallsTo.filter((el)=>el != chosen)\\n\\t\\t\\tchosen.wallsTo = chosen.wallsTo.filter((el)=>el != current)\\n\\t\\t\\tchosen.visited = true\\n\\t\\t\\tque.unshift(chosen)\\n\\t\\t}\\n\\t}\\n\\treturn {x:x,y:y,nodes:nodes,blockSize:blockSize}\\n}\\n\\nexport function display(c:HTMLCanvasElement,mazeData:mazeData){\\n\\tlet ctx = c.getContext('2d')\\n\\tc.width = mazeData.x\\n\\tc.height = mazeData.y\\n\\tctx.fillStyle = 'white'\\n\\tctx.strokeStyle = 'black'\\n\\tctx.fillRect(0,0,mazeData.x,mazeData.y)\\n\\tctx.strokeRect(0,0,mazeData.x,mazeData.y)\\n\\tmazeData.nodes.forEach(el=>el.draw(ctx,mazeData.blockSize))\\n}\\n\",\n \"language\": \"TypeScript\"\n },\n {\n \"code\": \"import { maze,display } from \\\"./maze\\\"\\nconst X = 10\\nconst Y = 10\\n\\nlet canvas = document.createElement('canvas')\\ndocument.body.appendChild(canvas)\\nlet m = maze(X,Y)\\ndisplay(canvas,m)\\n\",\n \"language\": \"TypeScript\"\n },\n {\n \"code\": \"H ← 8\\nW ← 18\\nVer ← 0\\nHor ← 1\\nVis ← 2\\n\\nBreakNS ← ⊂Ver⊂⊃(/↥≡⊡0|⊡0_1)\\nBreakEW ← ⊂Hor⊂⊃(⊡0_0|/↥≡⊡1)\\n# ([here, next], maze) -> (maze')\\nBreakWall ← ⍜⊡(0◌)⟨BreakNS|BreakEW⟩=°⊟≡⊢.\\n\\nNeighbours ← +⊙¤[[¯1 0] [1 0] [0 1] [0 ¯1]] # Gives N4\\nShuffle ← ⊏⍏[⍥⚂]⧻.\\nIsVisited ← ¬⊡⊂Vis\\nMarkAsVisited ← ⟜(⍜(⊡|1◌)⊂Vis)\\nOnlyInBounds ← ▽≡IsVisited ⊙¤,, # (finds the boundary 1's)\\n\\n# (here, maze) -> (maze')\\nWalk ← |2 (\\n MarkAsVisited\\n # (here, maze) -> ([[here, next] x(up to)4], maze)\\n ≡⊟¤⟜(Shuffle OnlyInBounds Neighbours)\\n\\n # Update maze for each in turn. For each, if it\\n # still isn't visited, break the wall, recurse into it.\\n ∧(⟨◌|Walk ⊡1 ⟜BreakWall⟩IsVisited◌°⊟,,)\\n)\\n\\n⊂↯H⊂↯W0 1↯+1W1 # vis (added 1's help bounds checks)\\n⊂↯H⊂↯W1 1↯+1W 0 # ver\\n↯+1H⊂↯W1 0 # hor\\n⊂⊟\\n# Stack: ([hor, ver, vis])\\nWalk [0 0]\\n\\nPP! ← ≡/⊂∵^! # Pretty print using switch.\\n≡(&p$\\\"_\\\\n_\\\")⊃(PP!⟨\\\"+ \\\"|\\\"+--\\\"⟩⊡Ver|PP!⟨\\\" \\\"|\\\"| \\\"⟩⊡Hor)\\n\",\n \"language\": \"Uiua\"\n },\n {\n \"code\": \"import \\\"random\\\" for Random\\nimport \\\"os\\\" for Process\\n\\nvar Rand = Random.new()\\n\\nclass Direction {\\n static n { __n }\\n static s { __s }\\n static e { __e }\\n static w { __w }\\n\\n static init() {\\n __n = new_(1, 0, -1)\\n __s = new_(2, 0, 1)\\n __e = new_(4, 1, 0)\\n __w = new_(8, -1, 0)\\n\\n __n.opposite = __s\\n __s.opposite = __n\\n __e.opposite = __w\\n __w.opposite = __e\\n }\\n\\n construct new_(bit, dx, dy) {\\n _bit = bit\\n _dx = dx\\n _dy = dy\\n _opposite = null\\n }\\n\\n bit { _bit }\\n dx { _dx }\\n dy { _dy }\\n\\n opposite { _opposite }\\n opposite=(d) { _opposite = d }\\n}\\n\\nDirection.init()\\n\\nclass MazeGenerator {\\n construct new(x, y) {\\n _x = x\\n _y = y\\n _maze = List.filled(x, null)\\n for (i in 0...x) _maze[i] = List.filled(y, 0)\\n }\\n\\n between_(v, upper) { v >= 0 && v < upper }\\n\\n generate(cx, cy) {\\n var values = [Direction.n, Direction.s, Direction.e, Direction.w]\\n Rand.shuffle(values)\\n values.each { |v|\\n var nx = cx + v.dx\\n var ny = cy + v.dy\\n if (between_(nx, _x) && between_(ny, _y) && _maze[nx][ny] == 0) {\\n _maze[cx][cy] = _maze[cx][cy] | v.bit\\n _maze[nx][ny] = _maze[nx][ny] | v.opposite.bit\\n generate(nx, ny)\\n }\\n }\\n }\\n\\n display() {\\n for (i in 0..._y) {\\n // draw the north edge\\n for (j in 0..._x) System.write((_maze[j][i] & 1) == 0 ? \\\"+---\\\" : \\\"+ \\\")\\n System.print(\\\"+\\\")\\n\\n // draw the west edge\\n for (j in 0..._x) System.write((_maze[j][i] & 8) == 0 ? \\\"| \\\" : \\\" \\\")\\n System.print(\\\"|\\\")\\n }\\n\\n // draw the bottom line\\n for (j in 0..._x) System.write(\\\"+---\\\")\\n System.print(\\\"+\\\")\\n }\\n}\\n\\nvar args = Process.arguments\\nvar x = (args.count >= 1) ? Num.fromString(args[0]) : 8\\nvar y = (args.count == 2) ? Num.fromString(args[1]) : 8\\nvar mg = MazeGenerator.new(x, y)\\nmg.generate(0, 0)\\nmg.display()\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"code Ran=1, CrLf=9, Text=12; \\\\intrinsic routines\\ndef Cols=20, Rows=6; \\\\dimensions of maze (cells)\\nint Cell(Cols+1, Rows+1, 3); \\\\cells (plus right and bottom borders)\\ndef LeftWall, Ceiling, Connected; \\\\attributes of each cell (= 0, 1 and 2)\\n\\nproc ConnectFrom(X, Y); \\\\Connect cells starting from cell X,Y\\nint X, Y;\\nint Dir, Dir0;\\n[Cell(X, Y, Connected):= true; \\\\mark current cell as connected\\nDir:= Ran(4); \\\\randomly choose a direction\\nDir0:= Dir; \\\\save this initial direction\\nrepeat case Dir of \\\\try to connect to cell at Dir\\n 0: if X+1<Cols & not Cell(X+1, Y, Connected) then \\\\go right\\n [Cell(X+1, Y, LeftWall):= false; ConnectFrom(X+1, Y)];\\n 1: if Y+1<Rows & not Cell(X, Y+1, Connected) then \\\\go down\\n [Cell(X, Y+1, Ceiling):= false; ConnectFrom(X, Y+1)];\\n 2: if X-1>=0 & not Cell(X-1, Y, Connected) then \\\\go left\\n [Cell(X, Y, LeftWall):= false; ConnectFrom(X-1, Y)];\\n 3: if Y-1>=0 & not Cell(X, Y-1, Connected) then \\\\go up\\n [Cell(X, Y, Ceiling):= false; ConnectFrom(X, Y-1)]\\n other []; \\\\(never occurs)\\n Dir:= Dir+1 & $03; \\\\next direction\\nuntil Dir = Dir0;\\n];\\n\\nint X, Y;\\n[for Y:= 0 to Rows do\\n for X:= 0 to Cols do\\n [Cell(X, Y, LeftWall):= true; \\\\start with all walls and\\n Cell(X, Y, Ceiling):= true; \\\\ ceilings in place\\n Cell(X, Y, Connected):= false; \\\\ and all cells disconnected\\n ];\\nCell(0, 0, LeftWall):= false; \\\\make left and right doorways\\nCell(Cols, Rows-1, LeftWall):= false;\\nConnectFrom(Ran(Cols), Ran(Rows)); \\\\randomly pick a starting cell\\nfor Y:= 0 to Rows do \\\\display the maze\\n [CrLf(0);\\n for X:= 0 to Cols do\\n Text(0, if X#Cols & Cell(X, Y, Ceiling) then \\\"+--\\\" else \\\"+ \\\");\\n CrLf(0);\\n for X:= 0 to Cols do\\n Text(0, if Y#Rows & Cell(X, Y, LeftWall) then \\\"| \\\" else \\\" \\\");\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"fcn make_maze(w = 16, h = 8){\\n // make arrays with lists of lists (all mutable)\\n vis:=(w.pump(List().write,0)+1)*h + w.pump(List().write,1);\\n ver:=(w.pump(List().write,T(Void,\\\"| \\\")) + \\\"|\\\")*h + T;\\n hor:=(w.pump(List().write,T(Void,\\\"+---\\\")) + \\\"+\\\")*(h + 1);\\n\\n fcn(x,y,vis,ver,hor){\\n vis[y][x] = 1;\\n\\n d:=L(T(x - 1, y), T(x, y + 1), T(x + 1, y), T(x, y - 1)).shuffle();\\n foreach xx,yy in (d){\\n\\t if(vis[yy][xx]) continue;\\n\\t if(xx==x) hor[y.max(yy)][x]=\\\"+ \\\";\\n\\t if(yy==y) ver[y][x.max(xx)]=\\\" \\\";\\n\\t self.fcn(xx,yy,vis,ver,hor);\\n }\\n }((0).random(w),(0).random(h),vis,ver,hor);\\n foreach a,b in (hor.zip(ver)) { println(a.concat(),\\\"\\\\n\\\",b.concat()) }\\n return(ver,hor);\\n}\\nmake_maze();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Maze-generation"}}},{"rowIdx":476,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Recursion\n- Puzzles\nfrom: http://rosettacode.org/wiki/Maze_solving\nnote: Games\n","language":"00-META"},{"code":";Task:\nFor a maze generated by [[Maze generation|this task]], write a function \nthat finds (and displays) the shortest path between two cells. \n\n\nNote that because these mazes are generated by the [[wp:Maze_generation_algorithm#Depth-first_search|Depth-first search]] algorithm, they contain no circular paths, \nand a simple depth-first tree search can be used.\n<br><br>\n\n","language":"00-TASK"},{"code":"F dijkstra(graph, source)\n V n = graph.len\n V dist = [Float.infinity] * n\n V previous = [-1] * n\n dist[source] = 0\n V Q = Array(0 .< n)\n L !Q.empty\n V u = min(Q, key' n -> @dist[n])\n Q.remove(u)\n I dist[u] == Float.infinity\n L.break\n L(v) 0 .< n\n I graph[u][v] & (v C Q)\n V alt = dist[u] + graph[u][v]\n I alt < dist[v]\n dist[v] = alt\n previous[v] = u\n R previous\n\nF display_solution(predecessor)\n V cell = predecessor.len - 1\n L cell != 0\n print(cell, end' ‘<’)\n cell = predecessor[cell]\n print(0)\n\nV graph = [\n [0,1,0,0,0,0],\n [1,0,1,0,1,0],\n [0,1,0,0,0,1],\n [0,0,0,0,1,0],\n [0,1,0,1,0,0],\n [0,0,1,0,0,0]\n]\n\ndisplay_solution(dijkstra(graph, 0))\n","language":"11l"},{"code":"DEFINE TOP=\"0\"\nDEFINE RIGHT=\"1\"\nDEFINE BOTTOM=\"2\"\nDEFINE LEFT=\"3\"\nDEFINE WIDTH=\"160\"\nDEFINE HEIGHT=\"96\"\n\nDEFINE STACK_SIZE=\"5000\"\nBYTE ARRAY stack(STACK_SIZE)\nINT stackSize\n\nPROC InitStack()\n stackSize=0\nRETURN\n\nBYTE FUNC IsEmpty()\n IF stackSize=0 THEN\n RETURN (1)\n FI\nRETURN (0)\n\nBYTE FUNC IsFull()\n IF stackSize>=STACK_SIZE THEN\n RETURN (1)\n FI\nRETURN (0)\n\nPROC Push(BYTE x,y)\n IF IsFull() THEN Break() RETURN FI\n stack(stackSize)=x stackSize==+1\n stack(stackSize)=y stackSize==+1\nRETURN\n\nPROC Pop(BYTE POINTER x,y)\n IF IsEmpty() THEN Break() RETURN FI\n stackSize==-1 y^=stack(stackSize)\n stackSize==-1 x^=stack(stackSize)\nRETURN\n\nPROC Push3(BYTE x,y,d)\n IF IsFull() THEN Break() RETURN FI\n stack(stackSize)=x stackSize==+1\n stack(stackSize)=y stackSize==+1\n stack(stackSize)=d stackSize==+1\nRETURN\n\nPROC Pop3(BYTE POINTER x,y,d)\n IF IsEmpty() THEN Break() RETURN FI\n stackSize==-1 d^=stack(stackSize)\n stackSize==-1 y^=stack(stackSize)\n stackSize==-1 x^=stack(stackSize)\nRETURN\n\nPROC FillScreen()\n BYTE POINTER ptr ;pointer to the screen memory\n INT screenSize=[3840]\n\n ptr=PeekC(88)\n SetBlock(ptr,screenSize,$55)\n\n Color=0\n Plot(0,HEIGHT-1) DrawTo(WIDTH-1,HEIGHT-1) DrawTo(WIDTH-1,0)\nRETURN\n\nPROC GetNeighbors(BYTE x,y BYTE ARRAY n BYTE POINTER count)\n DEFINE WALL=\"1\"\n\n count^=0\n IF y>2 AND Locate(x,y-2)=WALL THEN\n n(count^)=TOP count^==+1\n FI\n IF x<WIDTH-3 AND Locate(x+2,y)=WALL THEN\n n(count^)=RIGHT count^==+1\n FI\n IF y<HEIGHT-3 AND Locate(x,y+2)=WALL THEN\n n(count^)=BOTTOM count^==+1\n FI\n IF x>2 AND Locate(x-2,y)=WALL THEN\n n(count^)=LEFT count^==+1\n FI\nRETURN\n\nPROC DrawConnection(BYTE POINTER x,y BYTE dir)\n Plot(x^,y^)\n IF dir=TOP THEN\n y^==-2\n ELSEIF dir=RIGHT THEN\n x^==+2\n ELSEIF dir=BOTTOM THEN\n y^==+2\n ELSE\n x^==-2\n FI\n DrawTo(x^,y^)\nRETURN\n\nPROC Maze(BYTE x,y)\n BYTE ARRAY stack,neighbors\n BYTE dir,nCount\n\n FillScreen()\n\n Color=2\n InitStack()\n Push(x,y)\n WHILE IsEmpty()=0\n DO\n Pop(@x,@y)\n GetNeighbors(x,y,neighbors,@nCount)\n IF nCount>0 THEN\n Push(x,y)\n dir=neighbors(Rand(nCount))\n DrawConnection(@x,@y,dir)\n Push(x,y)\n FI\n OD\nRETURN\n\nBYTE FUNC IsConnection(BYTE x,y,dir)\n DEFINE WAY=\"2\"\n IF dir=TOP AND y>2 AND Locate(x,y-1)=WAY THEN\n RETURN (1)\n ELSEIF dir=RIGHT AND x<WIDTH-3 AND Locate(x+1,y)=WAY THEN\n RETURN (1)\n ELSEIF dir=BOTTOM AND y<HEIGHT-3 AND Locate(x,y+1)=WAY THEN\n RETURN (1)\n ELSEIF dir=LEFT AND x>2 AND Locate(x-1,y)=WAY THEN\n RETURN (1)\n FI\nRETURN (0)\n\nPROC Solve(BYTE x1,y1,x2,y2)\n BYTE dir,x,y,lastX,lastY,back\n\n Color=3\n Plot(x1,y1)\n Plot(x2,y2)\n\n InitStack()\n Push3(x1,y1,TOP)\n WHILE IsEmpty()=0\n DO\n Pop3(@x,@y,@dir)\n IF back THEN\n Color=2\n Plot(lastX,lastY)\n DrawTo(x,y)\n FI\n IF IsConnection(x,y,dir) THEN\n Color=3\n Push3(x,y,dir+1)\n DrawConnection(@x,@y,dir)\n IF x=x2 AND y=y2 THEN\n RETURN\n FI\n Push3(x,y,TOP)\n back=0\n ELSEIF dir<=LEFT THEN\n Push3(x,y,dir+1)\n back=0\n ELSE\n lastX=x\n lastY=y\n back=1\n FI\n OD\nRETURN\n\nPROC Main()\n BYTE CH=$02FC,COLOR0=$02C4,COLOR1=$02C5,COLOR2=$02C6\n BYTE x,y,x2,y2\n\n Graphics(7+16)\n COLOR0=$0A\n COLOR1=$04\n COLOR2=$A6\n\n x=Rand((WIDTH RSH 1)-1) LSH 1+1\n y=Rand((HEIGHT RSH 1)-1) LSH 1+1\n Maze(x,y)\n\n x=Rand((WIDTH RSH 1)-1) LSH 1+1\n y=Rand((HEIGHT RSH 1)-1) LSH 1+1\n x2=Rand((WIDTH RSH 1)-1) LSH 1+1\n y2=Rand((HEIGHT RSH 1)-1) LSH 1+1\n Solve(x,y,x2,y2)\n\n DO UNTIL CH#$FF OD\n CH=$FF\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_IO;\n\nprocedure Maze_Solver is\n\n X_Size: constant Natural := 45;\n Y_Size: constant Natural := 17;\n\n subtype X_Range is Natural range 1 .. X_Size;\n subtype Y_Range is Natural range 1 .. Y_Size;\n\n East: constant X_Range := 2;\n South: constant Y_Range := 1;\n\n X_Start: constant X_Range := 3; -- start at the upper left\n Y_Start: constant Y_Range := 1;\n X_Finish: constant X_Range := X_Size-East; -- go to the lower right\n Y_Finish: constant Y_Range := Y_Size;\n\n type Maze_Type is array (Y_Range) of String(X_Range);\n\n function Solved(X: X_Range; Y: Y_Range) return Boolean is\n begin\n return (X = X_Finish) and (Y = Y_Finish);\n end Solved;\n\n procedure Output_Maze(M: Maze_Type; Message: String := \"\") is\n begin\n if Message /= \"\" then\n Ada.Text_IO.Put_Line(Message);\n end if;\n for I in M'Range loop\n Ada.Text_IO.Put_Line(M(I));\n end loop;\n end Output_Maze;\n\n procedure Search(M: in out Maze_Type; X: X_Range; Y:Y_Range) is\n begin\n M(Y)(X) := '*';\n if Solved(X, Y) then\n Output_Maze(M, \"Solution found!\");\n else\n if Integer(Y)-South >= 1 and then M(Y-South)(X) = ' ' then\n Search(M, X, Y-South);\n end if;\n if Integer(Y)+South <= Y_Size and then M(Y+South)(X) = ' ' then\n Search(M, X, Y+South);\n end if;\n if Integer(X)-East >= 1 and then M(Y)(X-East) = ' ' then\n Search(M, X-East, Y);\n end if;\n if Integer(Y)+East <= Y_Size and then M(Y)(X+East) = ' ' then\n Search(M, X+East, Y);\n end if;\n end if;\n M(Y)(X) := ' ';\n end Search;\n\n Maze: Maze_Type;\n X: X_Range := X_Start;\n Y: Y_Range := Y_Start;\n\nbegin\n for I in 1 .. Y_Size loop\n Maze(I) := Ada.Text_IO.Get_Line;\n end loop;\n Maze(Y_Start)(X_Start) := ' '; -- Start from\n Maze(Y_Finish)(X_Finish) := ' '; -- Go_To\n Output_Maze(Maze, \"The Maze:\");\n Ada.Text_IO.New_Line;\n\n Search(Maze, X, Y) ; -- Will output *all* Solutions.\n -- If there is no output, there is no solution.\nend Maze_Solver;\n","language":"Ada"},{"code":"Width := 10, Height\t:= 10\t\t\t\t\t\t\t\t\t\t\t\t; set grid size\nSleepTime := 0\n\ngosub, Startup\n\nGui, +AlwaysOnTop\nGui, font, s12, consolas\nGui, add, edit, vEditGrid x10, % maze\nGui, add, button, xs gStartup Default, Generate maze\nGui, add, button, x+10 gSolve, Solve\nGui, show,, maze\nGuiControl,, EditGrid, % maze\t\t\t\t\t\t\t\t\t\t\t; show maze\nreturn\n\n;-----------------------------------------------------------------------\n^Esc::\nGuiEscape:\nGuiClose:\nExitApp\nreturn\n\n;-----------------------------------------------------------------------\nStartup:\noMaze := []\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t; initialize\nSolved := false\nloop, % Height\n{\n\trow := A_Index\n\tloop, % Width\t\t\t\t\t\t\t\t\t\t\t\t\t\t; create oMaze[row,column] borders\n\t\tcol := A_Index, oMaze[row,col] := \"LRTB\"\t\t\t\t\t\t; i.e. oMaze[2,5] := LRTB (add all borders)\n}\nRandom, row, 1, % Height\t\t\t\t\t\t\t\t\t\t\t\t; random row\nRandom, col, 1, % Width\t\t\t\t\t\t\t\t\t\t\t\t\t; random col\ngrid := maze2text(oMaze)\t\t\t\t\t\t\t\t\t\t\t\t; object to text\nGuiControl,, EditGrid, % Grid\t\t\t\t\t\t\t\t\t\t\t; show Grid\nrow := col := 1\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t; reset to 1,1\noMaze := Generate_maze(row, col, oMaze)\t\t\t\t\t\t\t\t\t; generate maze starting from random row/column\noMaze[1,1] .= \"X\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t; start from 1,1\nmaze := maze2text(oMaze)\t\t\t\t\t\t\t\t\t\t\t\t; object to text\nGuiControl,, EditGrid, % maze\t\t\t\t\t\t\t\t\t\t\t; show maze\nGuiControl,, EditRoute\t\t\t\t\t\t\t\t\t\t\t\t\t; clear route\nGuiControl, Enable, Solve\nreturn\n\n;-----------------------------------------------------------------------\nSolve:\nGuiControl, Disable, Generate maze\nGuiControl, Disable, Solve\nloop % oRoute.MaxIndex()\n\toRoute.pop()\n\noSolution\t:= Solve(1, 1, oMaze)\t\t\t\t\t\t\t\t\t\t; solve starting from 1,1\noMaze \t\t:= oSolution.1\noRoute \t\t:= oSolution.2\nUpdate(oMaze, oRoute)\nSolved := true\nGuiControl, Enable, Generate maze\nreturn\n\n;-----------------------------------------------------------------------\nUpdate(oMaze, oRoute){\n\tglobal SleepTime\n\tGuiControl,, EditGrid, % maze2text(oMaze)\n\tSleep, % SleepTime\n}\n\n;-----------------------------------------------------------------------\nmaze2text(oMaze){\n\twidth := oMaze.1.MaxIndex()\n\tBLK := \"█\"\n\tfor row, objRow in oMaze\n\t{\n\t\tfor col, val in objRow\t\t\t\t\t\t\t\t\t\t\t; add ceiling\n\t\t{\n\t\t\tceiling := InStr(oMaze[row, col] , \"x\") && InStr(oMaze[row-1, col] , \"x\") ? \"+ \" BLK \" \" : \"+ \"\n\t\t\tgrid .= (InStr(val, \"T\") ? \"+---\" : ceiling) (col = Width ? \"+`n\" : \"\")\n\t\t}\n\t\tfor col, val in objRow\t\t\t\t\t\t\t\t\t\t\t; add left wall\n\t\t{\n\t\t\twall := SubStr(val, 0) = \"X\" ? BLK : \" \"\n\t\t\tgrid .= (InStr(val, \"L\") ? \"| \" : \" \") wall \" \" (col = Width ? \"|`n\" : \"\") ; add left wall if needed then outer right border\n\t\t}\n\t}\n\tLoop % Width\n\t\tGrid .= \"+---\"\t\t\t\t\t\t\t\t\t\t\t\t\t; add bottom floor\n\tGrid .= \"+\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t; add right bottom corner\n\treturn RegExReplace(grid , BLK \" (?=\" BLK \")\" , BLK BLK BLK BLK)\t; fill gaps\n}\n\n;-----------------------------------------------------------------------\nGenerate_maze(row, col, oMaze) {\n\tneighbors := row+1 \",\" col \"`n\" row-1 \",\" col \"`n\" row \",\" col+1 \"`n\" row \",\" col-1\n\tSort, neighbors, random\t\t\t\t\t\t\t\t\t\t\t\t; randomize neighbors list\n\tLoop, parse, neighbors, `n\t\t\t\t\t\t\t\t\t\t\t; for each neighbor\n\t{\n\t\trowX := StrSplit(A_LoopField, \",\").1\t\t\t\t\t\t\t; this neighbor row\n\t\tcolX := StrSplit(A_LoopField, \",\").2\t\t\t\t\t\t\t; this neighbor column\n\t\tif !instr(oMaze[rowX,colX], \"LRTB\") || !oMaze[rowX, colX]\t\t; if visited (has a missing border) or out of bounds\n\t\t\tcontinue\t\t\t\t\t\t\t\t\t\t\t\t\t; skip\n\t\t\n\t\t; remove borders\n\t\tif (row > rowX)\t\t\t\t\t\t\t\t\t\t\t\t\t; Cell is below this neighbor\n\t\t\toMaze[row,col] := StrReplace(oMaze[row,col], \"T\") , oMaze[rowX,colX] := StrReplace(oMaze[rowX,colX], \"B\")\n\t\telse if (row < rowX)\t\t\t\t\t\t\t\t\t\t\t; Cell is above this neighbor\n\t\t\toMaze[row,col] := StrReplace(oMaze[row,col], \"B\") , oMaze[rowX,colX] := StrReplace(oMaze[rowX,colX], \"T\")\n\t\telse if (col > colX)\t\t\t\t\t\t\t\t\t\t\t; Cell is right of this neighbor\n\t\t\toMaze[row,col] := StrReplace(oMaze[row,col], \"L\") , oMaze[rowX,colX] := StrReplace(oMaze[rowX,colX], \"R\")\n\t\telse if (col < colX)\t\t\t\t\t\t\t\t\t\t\t; Cell is left of this neighbor\n\t\t\toMaze[row,col] := StrReplace(oMaze[row,col], \"R\") , oMaze[rowX,colX] := StrReplace(oMaze[rowX,colX], \"L\")\n\t\t\n\t\tGenerate_maze(rowX, colX, oMaze)\t\t\t\t\t\t\t\t; recurse for this neighbor\n\t}\n\treturn, oMaze\n}\n\n;-----------------------------------------------------------------------\nSolve(row, col, oMaze){\n\tstatic oRoute := []\n\toNeighbor := [], targetrow := oMaze.MaxIndex(), targetCol := oMaze.1.MaxIndex()\n\t\n\t;~ Update(oMaze, oRoute)\n\toRoute.push(row \":\" col)\t\t\t\t\t\t\t\t\t\t\t; push current cell address to oRoute\n\toMaze[row, col] .= \"X\"\t\t\t\t\t\t\t\t\t\t\t\t; mark it visited \"X\"\n\t\t\n\tif (row = targetrow) && (Col = targetCol)\t\t\t\t\t\t\t; if solved\n\t\treturn true\t\t\t\t\t\t\t\t\t\t\t\t\t\t; return ture\n\n\t; create list of Neighbors\n\toNeighbor[row, col] := []\n\tif !InStr(oMaze[row, col], \"R\")\t\t\t\t\t\t\t\t\t\t; if no Right border\n\t\toNeighbor[row, col].push(row \",\" col+1)\t\t\t\t\t\t\t; add neighbor\n\tif !InStr(oMaze[row, col], \"B\")\t\t\t\t\t\t\t\t\t\t; if no Bottom border\n\t\toNeighbor[row, col].push(row+1 \",\" col)\t\t\t\t\t\t\t; add neighbor\n\tif !InStr(oMaze[row, col], \"T\")\t\t\t\t\t\t\t\t\t\t; if no Top border\n\t\toNeighbor[row, col].push(row-1 \",\" col)\t\t\t\t\t\t\t; add neighbor\n\tif !InStr(oMaze[row, col], \"L\")\t\t\t\t\t\t\t\t\t\t; if no Left border\n\t\toNeighbor[row, col].push(row \",\" col-1)\t\t\t\t\t\t\t; add neighbor\n\t\n\t; recurese for each oNeighbor\n\tfor each, neighbor in oNeighbor[row, col]\t\t\t\t\t\t\t; for each neighbor\n\t{\n\t\tUpdate(oMaze, oRoute)\n\t\tstartrow := StrSplit(neighbor, \",\").1\t\t\t\t\t\t\t; this neighbor\n\t\tstartCol := StrSplit(neighbor, \",\").2\t\t\t\t\t\t\t; becomes starting point\t\t\n\t\t\n\t\tif !InStr(oMaze[startrow, startCol], \"X\")\t\t\t\t\t\t; if it was not visited\n\t\t\tif Solve(startrow, startCol, oMaze)\t\t\t\t\t\t\t; recurse for current neighbor\n\t\t\t\treturn [oMaze, oRoute]\t\t\t\t\t\t\t\t\t; return solution if solved\n\t}\n\toRoute.pop()\t\t\t\t\t\t\t\t\t\t\t\t\t\t; no solution found, back track\n\toMaze[row, Col] := StrReplace(oMaze[row, Col], \"X\")\t\t\t\t\t; no solution found, back track\n\t;~ Update(oMaze, oRoute)\n}\n\n;-----------------------------------------------------------------------\n#IfWinActive, maze\nRight::\nLeft::\nUp::\nDown::\nif Solved\n\treturn\n\nif (A_ThisHotkey=\"Right\") && (!InStr(oMaze[row,col], \"R\"))\n\toMaze[row, col] := StrReplace(oMaze[row, col], \"X\")\t\t, col++\nif (A_ThisHotkey=\"Left\") && (!InStr(oMaze[row,col], \"L\"))\n\toMaze[row, col] := StrReplace(oMaze[row, col], \"X\")\t\t, col--\nif (A_ThisHotkey=\"Up\") && (!InStr(oMaze[row,col], \"T\"))\n\toMaze[row, col] := StrReplace(oMaze[row, col], \"X\")\t\t, row--\nif (A_ThisHotkey=\"Down\") && (!InStr(oMaze[row,col], \"B\"))\n\toMaze[row, col] := StrReplace(oMaze[row, col], \"X\")\t\t, row++\n\noMaze[row, col] .= \"X\"\nGuiControl,, EditGrid, % maze2text(oMaze)\n\nif (col = Width) && (row = Height)\n{\n\tSolved := true\n\toMaze[height, width] := StrReplace(oMaze[height, width], \"X\")\n\tSleepTime := 0\n\tgosub, solve\n\treturn\n}\nreturn\n#IfWinActive\n","language":"AutoHotkey"},{"code":" MazeWidth% = 11\n MazeHeight% = 9\n MazeCell% = 50\n\n VDU 23,22,MazeWidth%*MazeCell%/2+3;MazeHeight%*MazeCell%/2+3;8,16,16,128\n VDU 23,23,3;0;0;0; : REM Line thickness\n OFF\n PROCgeneratemaze(Maze&(), MazeWidth%, MazeHeight%, MazeCell%)\n PROCsolvemaze(Path{()}, Maze&(), 0, MazeHeight%-1, MazeWidth%-1, 0, MazeCell%)\n END\n\n DEF PROCsolvemaze(RETURN s{()}, m&(), x%, y%, dstx%, dsty%, s%)\n LOCAL h%, i%, n%, p%, q%, w%\n w% = DIM(m&(),1)\n h% = DIM(m&(),2)\n DIM s{(w%*h%) x%,y%}\n GCOL 3,14\n m&(x%,y%) OR= &80\n REPEAT\n FOR i% = 0 TO 3\n CASE i% OF\n WHEN 0: p% = x%-1 : q% = y%\n WHEN 1: p% = x%+1 : q% = y%\n WHEN 2: p% = x% : q% = y%-1\n WHEN 3: p% = x% : q% = y%+1\n ENDCASE\n IF p% >= 0 IF p% < w% IF q% >= 0 IF q% < h% IF m&(p%,q%) < &80 THEN\n IF p% > x% IF m&(p%,q%) AND 1 EXIT FOR\n IF q% > y% IF m&(p%,q%) AND 2 EXIT FOR\n IF x% > p% IF m&(x%,y%) AND 1 EXIT FOR\n IF y% > q% IF m&(x%,y%) AND 2 EXIT FOR\n ENDIF\n NEXT\n IF i% < 4 THEN\n m&(p%,q%) OR= &80\n s{(n%)}.x% = x%\n s{(n%)}.y% = y%\n n% += 1\n ELSE\n IF n% > 0 THEN\n n% -= 1\n p% = s{(n%)}.x%\n q% = s{(n%)}.y%\n ENDIF\n ENDIF\n LINE (x%+0.5)*s%,(y%+0.5)*s%,(p%+0.5)*s%,(q%+0.5)*s%\n x% = p%\n y% = q%\n UNTIL x%=dstx% AND y%=dsty%\n s{(n%)}.x% = x%\n s{(n%)}.y% = y%\n ENDPROC\n\n DEF PROCgeneratemaze(RETURN m&(), w%, h%, s%)\n LOCAL x%, y%\n DIM m&(w%, h%)\n FOR y% = 0 TO h%\n LINE 0,y%*s%,w%*s%,y%*s%\n NEXT\n FOR x% = 0 TO w%\n LINE x%*s%,0,x%*s%,h%*s%\n NEXT\n GCOL 15\n PROCcell(m&(), RND(w%)-1, y% = RND(h%)-1, w%, h%, s%)\n ENDPROC\n\n DEF PROCcell(m&(), x%, y%, w%, h%, s%)\n LOCAL i%, p%, q%, r%\n m&(x%,y%) OR= &40 : REM Mark visited\n r% = RND(4)\n FOR i% = r% TO r%+3\n CASE i% MOD 4 OF\n WHEN 0: p% = x%-1 : q% = y%\n WHEN 1: p% = x%+1 : q% = y%\n WHEN 2: p% = x% : q% = y%-1\n WHEN 3: p% = x% : q% = y%+1\n ENDCASE\n IF p% >= 0 IF p% < w% IF q% >= 0 IF q% < h% IF m&(p%,q%) < &40 THEN\n IF p% > x% m&(p%,q%) OR= 1 : LINE p%*s%,y%*s%+4,p%*s%,(y%+1)*s%-4\n IF q% > y% m&(p%,q%) OR= 2 : LINE x%*s%+4,q%*s%,(x%+1)*s%-4,q%*s%\n IF x% > p% m&(x%,y%) OR= 1 : LINE x%*s%,y%*s%+4,x%*s%,(y%+1)*s%-4\n IF y% > q% m&(x%,y%) OR= 2 : LINE x%*s%+4,y%*s%,(x%+1)*s%-4,y%*s%\n PROCcell(m&(), p%, q%, w%, h%, s%)\n ENDIF\n NEXT\n ENDPROC\n","language":"BBC-BASIC"},{"code":"#include <windows.h>\n#include <iostream>\n#include <string>\n\n//--------------------------------------------------------------------------------------------------\nusing namespace std;\n\n//--------------------------------------------------------------------------------------------------\nconst int BMP_SIZE = 512, CELL_SIZE = 8;\n\n//--------------------------------------------------------------------------------------------------\nenum directions { NONE, NOR = 1, EAS = 2, SOU = 4, WES = 8 };\n\n//--------------------------------------------------------------------------------------------------\nclass myBitmap\n{\npublic:\n myBitmap() : pen( NULL ) {}\n ~myBitmap()\n {\n\tDeleteObject( pen );\n\tDeleteDC( hdc );\n\tDeleteObject( bmp );\n }\n\n bool create( int w, int h )\n {\n\tBITMAPINFO\tbi;\n\tZeroMemory( &bi, sizeof( bi ) );\n\tbi.bmiHeader.biSize\t = sizeof( bi.bmiHeader );\n\tbi.bmiHeader.biBitCount\t = sizeof( DWORD ) * 8;\n\tbi.bmiHeader.biCompression = BI_RGB;\n\tbi.bmiHeader.biPlanes\t = 1;\n\tbi.bmiHeader.biWidth\t = w;\n\tbi.bmiHeader.biHeight\t = -h;\n\n\tHDC dc = GetDC( GetConsoleWindow() );\n\tbmp = CreateDIBSection( dc, &bi, DIB_RGB_COLORS, &pBits, NULL, 0 );\n\tif( !bmp ) return false;\n\n\thdc = CreateCompatibleDC( dc );\n\tSelectObject( hdc, bmp );\n\tReleaseDC( GetConsoleWindow(), dc );\n\twidth = w; height = h;\n\n\treturn true;\n }\n\n void clear()\n {\n\tZeroMemory( pBits, width * height * sizeof( DWORD ) );\n }\n\n void setPenColor( DWORD clr )\n {\n\tif( pen ) DeleteObject( pen );\n\tpen = CreatePen( PS_SOLID, 1, clr );\n\tSelectObject( hdc, pen );\n }\n\n void saveBitmap( string path )\n {\n\tBITMAPFILEHEADER fileheader;\n\tBITMAPINFO\t infoheader;\n\tBITMAP\t\t bitmap;\n\tDWORD\t\t wb;\n\n\tGetObject( bmp, sizeof( bitmap ), &bitmap );\n\n\tDWORD* dwpBits = new DWORD[bitmap.bmWidth * bitmap.bmHeight];\n\tZeroMemory( dwpBits, bitmap.bmWidth * bitmap.bmHeight * sizeof( DWORD ) );\n\tZeroMemory( &infoheader, sizeof( BITMAPINFO ) );\n\tZeroMemory( &fileheader, sizeof( BITMAPFILEHEADER ) );\n\n\tinfoheader.bmiHeader.biBitCount = sizeof( DWORD ) * 8;\n\tinfoheader.bmiHeader.biCompression = BI_RGB;\n\tinfoheader.bmiHeader.biPlanes = 1;\n\tinfoheader.bmiHeader.biSize = sizeof( infoheader.bmiHeader );\n\tinfoheader.bmiHeader.biHeight = bitmap.bmHeight;\n\tinfoheader.bmiHeader.biWidth = bitmap.bmWidth;\n\tinfoheader.bmiHeader.biSizeImage = bitmap.bmWidth * bitmap.bmHeight * sizeof( DWORD );\n\n\tfileheader.bfType = 0x4D42;\n\tfileheader.bfOffBits = sizeof( infoheader.bmiHeader ) + sizeof( BITMAPFILEHEADER );\n\tfileheader.bfSize = fileheader.bfOffBits + infoheader.bmiHeader.biSizeImage;\n\n\tGetDIBits( hdc, bmp, 0, height, ( LPVOID )dwpBits, &infoheader, DIB_RGB_COLORS );\n\n\tHANDLE file = CreateFile( path.c_str(), GENERIC_WRITE, 0, NULL, CREATE_ALWAYS, FILE_ATTRIBUTE_NORMAL, NULL );\n\tWriteFile( file, &fileheader, sizeof( BITMAPFILEHEADER ), &wb, NULL );\n\tWriteFile( file, &infoheader.bmiHeader, sizeof( infoheader.bmiHeader ), &wb, NULL );\n\tWriteFile( file, dwpBits, bitmap.bmWidth * bitmap.bmHeight * 4, &wb, NULL );\n\tCloseHandle( file );\n\n\tdelete [] dwpBits;\n }\n\n HDC getDC() const { return hdc; }\n int getWidth() const { return width; }\n int getHeight() const { return height; }\n\nprivate:\n HBITMAP bmp;\n HDC\t hdc;\n HPEN pen;\n void *pBits;\n int\t width, height;\n};\n//--------------------------------------------------------------------------------------------------\nclass mazeGenerator\n{\npublic:\n mazeGenerator()\n {\n\t_world = 0;\n\t_bmp.create( BMP_SIZE, BMP_SIZE );\n\t_bmp.setPenColor( RGB( 0, 255, 0 ) );\n }\n\n ~mazeGenerator() { killArray(); }\n\n BYTE* getMaze() const { return _world; }\n\n void create( int side )\n {\n\t_s = side;\n\tgenerate();\n }\n\nprivate:\n void generate()\n {\n\tkillArray();\n\t_world = new BYTE[_s * _s];\n\tZeroMemory( _world, _s * _s );\n\t_ptX = rand() % _s; _ptY = rand() % _s;\n\tcarve();\n }\n\n void carve()\n {\n\twhile( true )\n\t{\n\t int d = getDirection();\n\t if( d < NOR ) return;\n\n\t switch( d )\n\t {\n\t\tcase NOR:\n\t\t _world[_ptX + _s * _ptY] |= NOR; _ptY--;\n\t\t _world[_ptX + _s * _ptY] = SOU | SOU << 4;\n\t\tbreak;\n\t\tcase EAS:\n\t\t _world[_ptX + _s * _ptY] |= EAS; _ptX++;\n\t\t _world[_ptX + _s * _ptY] = WES | WES << 4;\n\t\tbreak;\n\t\tcase SOU:\n\t\t _world[_ptX + _s * _ptY] |= SOU; _ptY++;\n\t\t _world[_ptX + _s * _ptY] = NOR | NOR << 4;\n\t\tbreak;\n\t\tcase WES:\n\t\t _world[_ptX + _s * _ptY] |= WES; _ptX--;\n\t\t _world[_ptX + _s * _ptY] = EAS | EAS << 4;\n\t }\n\t}\n }\n\n int getDirection()\n {\n\tint d = 1 << rand() % 4;\n\twhile( true )\n\t{\n\t for( int x = 0; x < 4; x++ )\n\t {\n\t\tif( testDir( d ) ) return d;\n\t\td <<= 1;\n\t\tif( d > 8 ) d = 1;\n\t }\n\t d = ( _world[_ptX + _s * _ptY] & 0xf0 ) >> 4;\n\t if( !d ) return -1;\n\t switch( d )\n\t {\n\t\tcase NOR: _ptY--; break;\n\t\tcase EAS: _ptX++; break;\n\t\tcase SOU: _ptY++; break;\n\t\tcase WES: _ptX--; break;\n\t }\n\n\t d = 1 << rand() % 4;\n }\n }\n\n bool testDir( int d )\n {\n\tswitch( d )\n\t{\n\t case NOR: return ( _ptY - 1 > -1 && !_world[_ptX + _s * ( _ptY - 1 )] );\n\t case EAS: return ( _ptX + 1 < _s && !_world[_ptX + 1 + _s * _ptY] );\n\t case SOU: return ( _ptY + 1 < _s && !_world[_ptX + _s * ( _ptY + 1 )] );\n\t case WES: return ( _ptX - 1 > -1 && !_world[_ptX - 1 + _s * _ptY] );\n\t}\n\treturn false;\n }\n\n void killArray() { if( _world ) delete [] _world; }\n\n BYTE* _world;\n int _s, _ptX, _ptY;\n myBitmap _bmp;\n};\n//--------------------------------------------------------------------------------------------------\nclass mazeSolver\n{\npublic:\n mazeSolver()\n {\n\t_bmp.create( BMP_SIZE, BMP_SIZE );\n\t_pts = 0;\n }\n\n ~mazeSolver() { killPoints(); }\n\n void solveIt( BYTE* maze, int size, int sX, int sY, int eX, int eY )\n {\n\t_lastDir = NONE;\n\t_world = maze; _s = size; _sx = sX; _sy = sY; _ex = eX; _ey = eY;\n\t\t\n\tfor( int y = 0; y < _s; y++ )\n\t for( int x = 0; x < _s; x++ )\n\t\t_world[x + _s * y] &= 0x0f;\n\n _world[_sx + _s * _sy] |= NOR << 4;\n\n\tkillPoints();\n\t_pts = new BYTE[_s * _s];\n\tZeroMemory( _pts, _s * _s );\n\t\t\n\tfindTheWay();\n\n\t_sx = sX; _sy = sY;\n\tdisplay();\n }\n\nprivate:\n int invert( int d )\n {\n\tswitch( d )\n\t{\n\t case NOR: return SOU;\n\t case SOU: return NOR;\n\t case WES: return EAS;\n\t case EAS: return WES;\n\t}\n\treturn NONE;\n }\n\n void updatePosition( int d )\n {\n switch( d )\n\t{\n\t case NOR: _sy--; break;\n\t case EAS: _sx++; break;\n\t case SOU: _sy++; break;\n\t case WES: _sx--;\n\t}\n }\n\n void findTheWay()\n {\n\twhile( true )\n\t{\n\t int d = getDirection();\n\t if( d < NOR ) return;\n\t _lastDir = invert( d );\n\t _world[_sx + _s * _sy] |= d;\n\t _pts[_sx + _s * _sy] = d;\n\t updatePosition( d );\n\t if( _sx == _ex && _sy == _ey ) return;\n\t _world[_sx + _s * _sy] |= _lastDir << 4;\n\t}\n }\n\n int getDirection()\n {\n\tint d = 1 << rand() % 4;\n\twhile( true )\n\t{\n\t for( int x = 0; x < 4; x++ )\n\t {\n\t\tif( testDirection( d ) ) return d;\n\t\td <<= 1;\n\t\tif( d > 8 ) d = 1;\n\t }\n\n\t d = ( _world[_sx + _s * _sy] & 0xf0 ) >> 4;\n\t if( !d ) return -1;\n\t _pts[_sx + _s * _sy] = 0;\n\t updatePosition( d );\n\t _lastDir = invert( d );\n\t d = 1 << rand() % 4;\n\t}\n }\n\n bool testDirection( int d )\n {\n\tif( d == _lastDir || !( _world[_sx + _s * _sy] & d ) ) return false;\n\tswitch( d )\n\t{\n\t case NOR:\n\t\treturn _sy - 1 > -1 && !( _world[_sx + _s * ( _sy - 1 )] & 0xf0 );\n\t case EAS:\n\t\treturn _sx + 1 < _s && !( _world[_sx + 1 + _s * _sy] & 0xf0 );\n\t case SOU:\n\t\treturn _sy + 1 < _s && !( _world[_sx + _s * ( _sy + 1 )] & 0xf0 );\n\t case WES:\n\t\treturn _sx - 1 > -1 && !( _world[_sx - 1 + _s * _sy] & 0xf0 );\n\t}\n\treturn false;\n }\n\n void display()\n {\n\t_bmp.setPenColor( RGB( 0, 255, 0 ) );\n\t_bmp.clear();\n\tHDC dc = _bmp.getDC();\n\tfor( int y = 0; y < _s; y++ )\n\t{\n\t int yy = y * _s;\n\t for( int x = 0; x < _s; x++ )\n\t {\n\t\tBYTE b = _world[x + yy];\n\t\tint nx = x * CELL_SIZE,\n\t\t ny = y * CELL_SIZE;\n\n\t\tif( !( b & NOR ) )\n\t\t{\n\t\t MoveToEx( dc, nx, ny, NULL );\n\t\t LineTo( dc, nx + CELL_SIZE + 1, ny );\n\t\t}\n\t\tif( !( b & EAS ) )\n\t\t{\n\t\t MoveToEx( dc, nx + CELL_SIZE, ny, NULL );\n\t\t LineTo( dc, nx + CELL_SIZE, ny + CELL_SIZE + 1 );\n\t\t}\n\t\tif( !( b & SOU ) )\n\t\t{\n\t\t MoveToEx( dc, nx, ny + CELL_SIZE, NULL );\n\t\t LineTo( dc, nx + CELL_SIZE + 1, ny + CELL_SIZE );\n\t\t}\n\t\tif( !( b & WES ) )\n\t\t{\n\t\t MoveToEx( dc, nx, ny, NULL );\n\t\t LineTo( dc, nx, ny + CELL_SIZE + 1 );\n\t\t}\n\t }\n\t}\n\n\tdrawEndPoints( dc );\n\t_bmp.setPenColor( RGB( 255, 0, 0 ) );\n\n\tfor( int y = 0; y < _s; y++ )\n\t{\n\t int yy = y * _s;\n\t for( int x = 0; x < _s; x++ )\n\t {\n\t\tBYTE d = _pts[x + yy];\n\t\tif( !d ) continue;\n\n\t\tint nx = x * CELL_SIZE + 4,\n\t\t ny = y * CELL_SIZE + 4;\n\n\t\tMoveToEx( dc, nx, ny, NULL );\n\t\tswitch( d )\n\t\t{\n\t\t case NOR: LineTo( dc, nx, ny - CELL_SIZE - 1 ); break;\n\t\t case EAS: LineTo( dc, nx + CELL_SIZE + 1, ny ); break;\n\t\t case SOU: LineTo( dc, nx, ny + CELL_SIZE + 1 ); break;\n\t\t case WES: LineTo( dc, nx - CELL_SIZE - 1, ny ); break;\n\t\t}\n\t }\n\t}\n\n\t_bmp.saveBitmap( \"f:\\\\rc\\\\maze_s.bmp\" );\n\tBitBlt( GetDC( GetConsoleWindow() ), 10, 60, BMP_SIZE, BMP_SIZE, _bmp.getDC(), 0, 0, SRCCOPY );\n }\n\n void drawEndPoints( HDC dc )\n {\n\tRECT rc;\n\tint x = 1 + _sx * CELL_SIZE, y = 1 + _sy * CELL_SIZE;\n\tSetRect( &rc, x, y, x + CELL_SIZE - 1, y + CELL_SIZE - 1 );\n\tFillRect( dc, &rc, ( HBRUSH )GetStockObject( WHITE_BRUSH ) );\n\tx = 1 + _ex * CELL_SIZE, y = 1 + _ey * CELL_SIZE;\n\tSetRect( &rc, x, y, x + CELL_SIZE - 1, y + CELL_SIZE - 1 );\n\tFillRect( dc, &rc, ( HBRUSH )GetStockObject( WHITE_BRUSH ) );\n }\n\n void killPoints() { if( _pts ) delete [] _pts; }\n\n BYTE* _world, *_pts;\n int _s, _sx, _sy, _ex, _ey, _lastDir;\n myBitmap _bmp;\n};\n//--------------------------------------------------------------------------------------------------\nint main( int argc, char* argv[] )\n{\n ShowWindow( GetConsoleWindow(), SW_MAXIMIZE );\n srand( GetTickCount() );\n\n mazeGenerator mg;\n mazeSolver ms;\n int s;\n while( true )\n {\n\tcout << \"Enter the maze size, an odd number bigger than 2 ( 0 to QUIT ): \"; cin >> s;\n\tif( !s ) return 0;\n\tif( !( s & 1 ) ) s++;\n\tif( s >= 3 )\n\t{\n\t mg.create( s );\n\t int sx, sy, ex, ey;\n\t while( true )\n\t {\n\t\tsx = rand() % s; sy = rand() % s;\n\t\tex = rand() % s; ey = rand() % s;\n\t\tif( ex != sx || ey != sy ) break;\n\t }\n\t ms.solveIt( mg.getMaze(), s, sx, sy, ex, ey );\n\t cout << endl;\n\t}\n\tsystem( \"pause\" );\n\tsystem( \"cls\" );\n }\n return 0;\n}\n//--------------------------------------------------------------------------------------------------\n","language":"C++"},{"code":"using System;\nusing System.Text;\n\npublic class Maze\n{\n private char[,] cells;\n private char[,] hWalls; // Horizontal walls\n private char[,] vWalls; // Vertical walls\n private Random rand = new Random();\n\n public Maze(int rows, int cols)\n {\n cells = new char[rows, cols];\n hWalls = new char[rows + 1, cols]; // Include walls for the bottom\n vWalls = new char[rows, cols + 1]; // Include walls for the right side\n\n // Initialize walls\n for (int i = 0; i < rows; i++)\n {\n for (int j = 0; j < cols; j++)\n {\n hWalls[i, j] = '-';\n vWalls[i, j] = '|';\n }\n }\n\n // Set the outer walls for the bottom and right\n for (int i = 0; i < cols; i++)\n {\n hWalls[rows, i] = '-';\n }\n for (int i = 0; i < rows; i++)\n {\n vWalls[i, cols] = '|';\n }\n }\n\n public override string ToString()\n {\n var builder = new StringBuilder();\n\n for (int i = 0; i < cells.GetLength(0); i++)\n {\n // Top walls\n for (int j = 0; j < cells.GetLength(1); j++)\n {\n builder.Append(\"+\");\n builder.Append(hWalls[i, j] == '-' ? \"---\" : \" \");\n }\n builder.AppendLine(\"+\");\n\n // Side walls and cells\n for (int j = 0; j < cells.GetLength(1); j++)\n {\n builder.Append(vWalls[i, j] == '|' ? \"| \" : \" \");\n char cell = cells[i, j] == '\\0' ? ' ' : cells[i, j];\n builder.Append(cell + \" \");\n }\n builder.AppendLine(\"|\");\n }\n\n // Bottom walls\n for (int j = 0; j < cells.GetLength(1); j++)\n {\n builder.Append(\"+---\");\n }\n builder.AppendLine(\"+\");\n\n return builder.ToString();\n }\n\n public void Generate()\n {\n Generate(rand.Next(cells.GetLength(0)), rand.Next(cells.GetLength(1)));\n }\n\n private void Generate(int r, int c)\n {\n cells[r, c] = ' ';\n int[] dirs = { 0, 1, 2, 3 };\n Shuffle(dirs);\n\n foreach (int dir in dirs)\n {\n switch (dir)\n {\n case 0: // Up\n if (r > 0 && cells[r - 1, c] == '\\0')\n {\n hWalls[r, c] = ' ';\n Generate(r - 1, c);\n }\n break;\n case 1: // Down\n if (r < cells.GetLength(0) - 1 && cells[r + 1, c] == '\\0')\n {\n hWalls[r + 1, c] = ' ';\n Generate(r + 1, c);\n }\n break;\n case 2: // Right\n if (c < cells.GetLength(1) - 1 && cells[r, c + 1] == '\\0')\n {\n vWalls[r, c + 1] = ' ';\n Generate(r, c + 1);\n }\n break;\n case 3: // Left\n if (c > 0 && cells[r, c - 1] == '\\0')\n {\n vWalls[r, c] = ' ';\n Generate(r, c - 1);\n }\n break;\n }\n }\n }\n\n private void Shuffle(int[] array)\n {\n for (int i = array.Length - 1; i > 0; i--)\n {\n int j = rand.Next(i + 1);\n int temp = array[i];\n array[i] = array[j];\n array[j] = temp;\n }\n }\n\n public void Solve(int startRow, int startCol, int endRow, int endCol)\n {\n if (Solve(startRow, startCol, endRow, endCol, -1))\n {\n cells[startRow, startCol] = 'S';\n cells[endRow, endCol] = 'F';\n }\n }\n\n private bool Solve(int r, int c, int endRow, int endCol, int dir)\n {\n if (r == endRow && c == endCol) return true;\n\n // Up\n if (dir != 1 && r > 0 && hWalls[r, c] == ' ' && Solve(r - 1, c, endRow, endCol, 0))\n {\n cells[r, c] = '^';\n return true;\n }\n // Down\n if (dir != 0 && r < cells.GetLength(0) - 1 && hWalls[r + 1, c] == ' ' && Solve(r + 1, c, endRow, endCol, 1))\n {\n cells[r, c] = 'v';\n return true;\n }\n // Right\n if (dir != 3 && c < cells.GetLength(1) - 1 && vWalls[r, c + 1] == ' ' && Solve(r, c + 1, endRow, endCol, 2))\n {\n cells[r, c] = '>';\n return true;\n }\n // Left\n if (dir != 2 && c > 0 && vWalls[r, c] == ' ' && Solve(r, c - 1, endRow, endCol, 3))\n {\n cells[r, c] = '<';\n return true;\n }\n\n return false;\n }\n}\n\nclass Program\n{\n static void Main(string[] args)\n {\n var maze = new Maze(4, 7);\n maze.Generate();\n Random rand = new Random();\n maze.Solve(rand.Next(4), rand.Next(7), rand.Next(4), rand.Next(7));\n Console.WriteLine(maze);\n }\n}\n","language":"C-sharp"},{"code":"(ns small-projects.find-shortest-way\n (:require [clojure.string :as str]))\n\n;Misk functions\n(defn cell-empty? [maze coords]\n (= :empty (get-in maze coords)))\n\n(defn wall? [maze coords]\n (= :wall (get-in maze coords)))\n\n(defn track? [maze coords]\n (= :track (get-in maze coords)))\n\n(defn get-neighbours [maze [y x cell]]\n [[y (dec x)] [(inc y) x] [y (inc x)] [(dec y) x]])\n\n(defn get-difference [coll1 filter-coll]\n (filter #(not (contains? filter-coll %)) coll1))\n\n(defn get-empties [maze cell]\n (->> (get-neighbours maze cell)\n (filter (partial cell-empty? maze))))\n\n(defn possible-ways [maze cell filter-coll]\n (-> (get-empties maze cell)\n (get-difference filter-coll)))\n\n(defn replace-cells [maze coords v]\n (if (empty? coords)\n maze\n (recur (assoc-in maze (first coords) v) (rest coords) v)))\n\n;Print and parse functions\n(def cell-code->str\n [\" \" \" \" \" \" \" \" \"· \" \"╵ \" \"╴ \" \"┘ \"\n \" \" \" \" \" \" \" \" \"╶─\" \"└─\" \"──\" \"┴─\"\n \" \" \" \" \" \" \" \" \"╷ \" \"│ \" \"┐ \" \"┤ \"\n \" \" \" \" \" \" \" \" \"┌─\" \"├─\" \"┬─\" \"┼─\"\n \" \" \" \" \" \" \" \" \"■ \" \"╹ \" \"╸ \" \"┛ \"\n \" \" \" \" \" \" \" \" \"╺━\" \"┗━\" \"━━\" \"┻━\"\n \" \" \" \" \" \" \" \" \"╻ \" \"┃ \" \"┓ \" \"┫ \"\n \" \" \" \" \" \" \" \" \"┏━\" \"┣━\" \"┳━\" \"╋━\"\n \" \"])\n\n(defn get-cell-code [maze coords]\n (let [mode (if (track? maze coords) 1 0)\n check (if (zero? mode) wall? track?)]\n (transduce\n (comp\n (map (partial check maze))\n (keep-indexed (fn [idx test] (when test idx)))\n (map (partial bit-shift-left 1)))\n (completing bit-or)\n (bit-shift-left mode 5)\n (sort (conj (get-neighbours maze coords) coords)))))\n\n(defn code->str [cell-code]\n (nth cell-code->str cell-code))\n\n(defn maze->str-symbols [maze]\n (for [y (range (count maze))]\n (for [x (range (count (nth maze y)))]\n (code->str (get-cell-code maze [y x])))))\n\n(defn maze->str [maze]\n (->> (maze->str-symbols maze)\n (map str/join)\n (str/join \"\\n\")))\n\n(defn parse-pretty-maze [maze-str]\n (->> (str/split-lines maze-str)\n (map (partial take-nth 2))\n (map (partial map #(if (= \\space %) :empty :wall)))\n (map vec)\n (vec)))\n\n;Core\n(defn find-new-border [maze border old-border]\n (apply conj (map (fn [cell]\n (zipmap (possible-ways maze cell (conj border old-border))\n (repeat cell)))\n (keys border))))\n\n(defn backtrack [visited route]\n (let [cur-cell (get visited (first route))]\n (if (= cur-cell :start)\n route\n (recur visited (conj route cur-cell)))))\n\n(defn breadth-first-search [maze start-cell end-cell]\n (loop [visited {start-cell :start}\n border {start-cell :start}\n old-border {start-cell :start}]\n (if (contains? old-border end-cell)\n (backtrack visited (list end-cell))\n (recur\n (conj visited border)\n (find-new-border maze border old-border)\n border))))\n\n(def maze (parse-pretty-maze maze-str))\n\n(def solved-maze\n (replace-cells maze (breadth-first-search maze [1 1] [19 19]) :track))\n\n(println (maze->str solved-maze))\n","language":"Clojure"},{"code":"import std.stdio, std.random, std.string, std.array, std.algorithm,\n std.file, std.conv;\n\nenum int cx = 4, cy = 2; // Cell size x and y.\nenum int cx2 = cx / 2, cy2 = cy / 2;\nenum pathSymbol = '.';\nstruct V2 { int x, y; }\n\nbool solveMaze(char[][] maze, in V2 s, in V2 end) pure nothrow @safe @nogc {\n if (s == end)\n return true;\n\n foreach (immutable d; [V2(0, -cy), V2(+cx, 0), V2(0, +cy), V2(-cx, 0)])\n if (maze[s.y + (d.y / 2)][s.x + (d.x / 2)] == ' ' &&\n maze[s.y + d.y][s.x + d.x] == ' ') {\n//Would this help?\n// maze[s.y + (d.y / 2)][s.x + (d.x / 2)] = pathSymbol;\n maze[s.y + d.y][s.x + d.x] = pathSymbol;\n if (solveMaze(maze, V2(s.x + d.x, s.y + d.y), end))\n return true;\n maze[s.y + d.y][s.x + d.x] = ' ';\n }\n\n return false;\n}\n\nvoid main() {\n auto maze = \"maze.txt\".File.byLine.map!(r => r.chomp.dup).array;\n immutable h = (maze.length.signed - 1) / cy;\n assert (h > 0);\n immutable w = (maze[0].length.signed - 1) / cx;\n\n immutable start = V2(cx2 + cx * uniform(0, w), cy2 + cy * uniform(0, h));\n immutable end = V2(cx2 + cx * uniform(0, w), cy2 + cy * uniform(0, h));\n\n maze[start.y][start.x] = pathSymbol;\n if (!solveMaze(maze, start, end))\n return \"No solution path found.\".writeln;\n maze[start.y][start.x] = 'S';\n maze[end.y][end.x] = 'E';\n writefln(\"%-(%s\\n%)\", maze);\n}\n","language":"D"},{"code":"procedure SolveMaze(var AMaze: TMaze; const S, E: TPoint);\nvar\n Route : TRoute;\n Position : TPoint;\n V : TPoint; // delta vector\nbegin\n ClearVisited(AMaze);\n Position := S;\n Route := TStack<TPoint>.Create;\n with Position do\n try\n AMaze[x, y].Visited := True;\n repeat\n if (y > 0) and not AMaze[x, y-1].Visited and AMaze[x, y].PassTop then V := Point(0, -1) else\n if (x < mwidth-1) and not AMaze[x+1, y].Visited and AMaze[x+1, y].PassLeft then V := Point(1, 0) else\n if (y < mheight-1) and not AMaze[x, y+1].Visited and AMaze[x, y+1].PassTop then V := Point(0, 1) else\n if (x > 0) and not AMaze[x-1, y].Visited and AMaze[x, y].PassLeft then V := Point(-1, 0) else\n begin\n if Route.Count = 0 then Exit; // we are back at start so no way found\n Position := Route.Pop; // step back\n Continue;\n end;\n\n Route.Push(Position); // save current position to route\n Offset(V); // move forward\n AMaze[x, y].Visited := True;\n until Position = E; // solved\n\n ClearVisited(AMaze);\n while Route.Count > 0 do // Route to Maze\n with Route.Pop do\n AMaze[x, y].Visited := True;\n\n finally\n Route.Free;\n end;\nend;\n\nprocedure Main;\nvar\n Maze: TMaze;\n S, E: TPoint;\nbegin\n Randomize;\n PrepareMaze(Maze);\n S := Point(Random(mwidth), Random(mheight));\n E := Point(Random(mwidth), Random(mheight));\n SolveMaze(Maze, S, E);\n Write(MazeToString(Maze, S, E));\n ReadLn;\nend;\n\nbegin\n Main;\nend.\n","language":"Delphi"},{"code":"size = 15\nn = 2 * size + 1\nf = 100 / (n - 0.5)\nlen m[] n * n\n#\nbackground 000\nproc show_maze . .\n clear\n for i = 1 to len m[]\n if m[i] = 0\n x = (i - 1) mod n\n y = (i - 1) div n\n color 999\n move x * f - f / 2 y * f - f / 2\n rect f * 1.5 f * 1.5\n .\n .\n sleep 0.01\n.\noffs[] = [ 1 n -1 (-n) ]\nproc m_maze pos . .\n m[pos] = 0\n show_maze\n d[] = [ 1 2 3 4 ]\n for i = 4 downto 1\n d = randint i\n dir = offs[d[d]]\n d[d] = d[i]\n if m[pos + dir] = 1 and m[pos + 2 * dir] = 1\n m[pos + dir] = 0\n m_maze pos + 2 * dir\n .\n .\n.\nendpos = n * n - 1\nproc make_maze . .\n for i = 1 to len m[]\n m[i] = 1\n .\n for i = 1 to n\n m[i] = 2\n m[n * i] = 2\n m[n * i - n + 1] = 2\n m[n * n - n + i] = 2\n .\n h = 2 * randint 15 - n + n * 2 * randint 15\n m_maze h\n m[endpos] = 0\n.\nmake_maze\nshow_maze\n#\nproc mark pos col . .\n x = (pos - 1) mod n\n y = (pos - 1) div n\n color col\n move x * f + f / 4 y * f + f / 4\n circle f / 3.5\n.\nglobal found .\nproc solve dir0 pos . .\n if found = 1\n return\n .\n mark pos 900\n sleep 0.05\n if pos = endpos\n found = 1\n return\n .\n of = randint 4 - 1\n for h = 1 to 4\n dir = (h + of) mod1 4\n posn = pos + offs[dir]\n if dir <> dir0 and m[posn] = 0\n solve (dir + 1) mod 4 + 1 posn\n if found = 0\n mark posn 888\n sleep 0.08\n .\n .\n .\n.\nsleep 1\nsolve 0 n + 2\n","language":"EasyLang"},{"code":"program MazeGenAndSolve\n\n // First and last columns/rows are \"dead\" cells. Makes generating\n // a maze with border walls much easier. Therefore, a visible\n // 20x20 maze has a maze size of 22. \t\n mazeSize int = 22;\n\n south boolean[][];\n west boolean[][];\n visited boolean[][];\n\n // Solution variables\n solution Dictionary;\n done boolean;\n startingRow, startingCol, endingRow, endingCol int;\n\n function main()\n initMaze();\n generateMaze();\n drawMaze(false); // Draw maze without solution\n\n solveMaze();\n drawMaze(true); // Draw maze with solution\n end\n\n private function initMaze()\n\n visited = createBooleanArray(mazeSize, mazeSize, false);\n\n // Initialize border cells as already visited\n for(col int from 1 to mazeSize)\n visited[col][1] = true;\n visited[col][mazeSize] = true;\n end\n for(row int from 1 to mazeSize)\n visited[1][row] = true;\n visited[mazeSize][row] = true;\n end\n\n // Initialize all walls as present\n south = createBooleanArray(mazeSize, mazeSize, true);\n west = createBooleanArray(mazeSize, mazeSize, true);\n\n end\n\n private function createBooleanArray(col int in, row int in, initialState boolean in) returns(boolean[][])\n\n newArray boolean[][] = new boolean[0][0];\n\n for(i int from 1 to col)\n innerArray boolean[] = new boolean[0];\n for(j int from 1 to row)\n innerArray.appendElement(initialState);\n end\n newArray.appendElement(innerArray);\n end\n\n return(newArray);\n\n end\n\n private function createIntegerArray(col int in, row int in, initialValue int in) returns(int[][])\n\n newArray int[][] = new int[0][0];\n\n for(i int from 1 to col)\n innerArray int[] = new int[0];\n for(j int from 1 to row)\n innerArray.appendElement(initialValue);\n end\n newArray.appendElement(innerArray);\n end\n\n return(newArray);\n\n end\n\n private function generate(col int in, row int in)\n\n\t // Mark cell as visited\n visited[col][row] = true;\n\n // Keep going as long as there is an unvisited neighbor\n while(!visited[col][row + 1] || !visited[col + 1][row] ||\n !visited[col][row - 1] || !visited[col - 1][row])\n\n while(true)\n r float = MathLib.random(); // Choose a random direction\n\n case\n when(r < 0.25 && !visited[col][row + 1]) // Go south\n south[col][row] = false; // South wall down\n generate(col, row + 1);\n exit while;\n when(r >= 0.25 && r < 0.50 && !visited[col + 1][row]) // Go east\n west[col + 1][row] = false; // West wall of neighbor to the east down\n generate(col + 1, row);\n exit while;\n when(r >= 0.5 && r < 0.75 && !visited[col][row - 1]) // Go north\n south[col][row - 1] = false; // South wall of neighbor to the north down\n generate(col, row - 1);\n exit while;\n when(r >= 0.75 && r < 1.00 && !visited[col - 1][row]) // Go west\n west[col][row] = false; // West wall down\n generate(col - 1, row);\n exit while;\n end\n end\n end\n\n end\n\n private function generateMaze()\n\n \t// Pick random start position (within the visible maze space)\n randomStartCol int = MathLib.floor((MathLib.random() *(mazeSize - 2)) + 2);\n randomStartRow int = MathLib.floor((MathLib.random() *(mazeSize - 2)) + 2);\n\n generate(randomStartCol, randomStartRow);\n\n end\n\n private function drawMaze(solve boolean in)\n\n line string;\n\n // Iterate over wall arrays (skipping dead border cells as required).\n // Construct a row at a time and output to console.\n for(row int from 1 to mazeSize - 1)\n\n if(row > 1)\n line = \"\";\n for(col int from 2 to mazeSize)\n if(west[col][row])\n line ::= cellTest(col, row, solve);\n else\n line ::= cellTest(col, row, solve);\n end\n end\n Syslib.writeStdout(line);\n end\n\n line = \"\";\n for(col int from 2 to mazeSize - 1)\n if(south[col][row])\n line ::= \"+---\";\n else\n line ::= \"+ \";\n end\n end\n line ::= \"+\";\n SysLib.writeStdout(line);\n\n end\n\n end\n\n private function cellTest(col int in, row int in, solve boolean in) returns(string)\n\n wall string;\n\n // Determine cell wall structure. If in solve mode, show start, end and\n // solution markers.\n if(!solve)\n if(west[col][row])\n wall = \"| \";\n else\n wall = \" \";\n end\n else\n if(west[col][row])\n\n case\n when(col == startingCol and row == startingRow)\n wall = \"| S \";\n when(col == endingCol and row == endingRow)\n wall = \"| E \";\n when(solution.containsKey(\"x=\" + col + \"y=\" + row))\n wall = \"| * \";\n otherwise\n wall = \"| \";\n end\n\n else\n case\n when(col == startingCol and row == startingRow)\n wall = \" S \";\n when(col == endingCol and row == endingRow)\n wall = \" E \";\n when(solution.containsKey(\"x=\" + col + \"y=\" + row))\n wall = \" * \";\n otherwise\n wall = \" \";\n end\n end\n end\n\n return(wall);\n end\n\n private function solve(col int in, row int in)\n\n if(col == 1 || row == 1 || col == mazeSize || row == mazeSize)\n return;\n end\n\n if(done || visited[col][row])\n return;\n end\n\n visited[col][row] = true;\n\n solution[\"x=\" + col + \"y=\" + row] = true;\n\n // Reached the end point\n if(col == endingCol && row == endingRow)\n done = true;\n end\n\n if(!south[col][row]) // Go South\n solve(col, row + 1);\n end\n if(!west[col + 1][row]) // Go East\n solve(col + 1, row);\n end\n if(!south[col][row - 1]) // Go North\n solve(col, row - 1);\n end\n if(!west[col][row]) // Go West\n solve(col - 1, row);\n end\n\n if(done)\n return;\n end\n\n solution.removeElement(\"x=\" + col + \"y=\" + row);\n\n end\n\n private function solveMaze()\n for(col int from 1 to mazeSize)\n for(row int from 1 to mazeSize)\n visited[col][row] = false;\n end\n end\n\n solution = new Dictionary(false, OrderingKind.byInsertion);\n done = false;\n\n // Pick random start position on first visible row\n startingCol = MathLib.floor((MathLib.random() *(mazeSize - 2)) + 2);\n startingRow = 2;\n\n // Pick random end position on last visible row\n endingCol = MathLib.floor((MathLib.random() *(mazeSize - 2)) + 2);\n endingRow = mazeSize - 1;\n\n solve(startingCol, startingRow);\n end\n\nend\n","language":"EGL"},{"code":"(require 'cl-lib)\n\n(cl-defstruct maze rows cols data)\n\n(defmacro maze-pt (w r c)\n `(+ (* (mod ,r (maze-rows ,w)) (maze-cols ,w))\n (mod ,c (maze-cols ,w))))\n\n(defmacro maze-ref (w r c)\n `(aref (maze-data ,w) (maze-pt ,w ,r ,c)))\n\n(defun new-maze (rows cols)\n (setq rows (1+ rows)\n cols (1+ cols))\n (let ((m (make-maze :rows rows :cols cols :data (make-vector (* rows cols) nil))))\n\n (dotimes (r rows)\n (dotimes (c cols)\n (setf (maze-ref m r c) (copy-sequence '(wall ceiling)))))\n\n (dotimes (r rows)\n (maze-set m r (1- cols) 'visited))\n\n (dotimes (c cols)\n (maze-set m (1- rows) c 'visited))\n\n (maze-unset m 0 0 'ceiling) ;; Maze Entrance\n (maze-unset m (1- rows) (- cols 2) 'ceiling) ;; Maze Exit\n\n m))\n\n(defun maze-is-set (maze r c v)\n (member v (maze-ref maze r c)))\n\n(defun maze-set (maze r c v)\n (let ((cell (maze-ref maze r c)))\n (when (not (member v cell))\n (setf (maze-ref maze r c) (cons v cell)))))\n\n(defun maze-unset (maze r c v)\n (setf (maze-ref maze r c) (delete v (maze-ref maze r c))))\n\n(defun print-maze (maze &optional marks)\n (dotimes (r (1- (maze-rows maze)))\n\n (dotimes (c (1- (maze-cols maze)))\n (princ (if (maze-is-set maze r c 'ceiling) \"+---\" \"+ \")))\n (princ \"+\")\n (terpri)\n\n (dotimes (c (1- (maze-cols maze)))\n (princ (if (maze-is-set maze r c 'wall) \"|\" \" \"))\n (princ (if (member (cons r c) marks) \" * \" \" \")))\n (princ \"|\")\n (terpri))\n\n (dotimes (c (1- (maze-cols maze)))\n (princ (if (maze-is-set maze (1- (maze-rows maze)) c 'ceiling) \"+---\" \"+ \")))\n (princ \"+\")\n (terpri))\n\n(defun shuffle (lst)\n (sort lst (lambda (a b) (= 1 (random 2)))))\n\n(defun to-visit (maze row col)\n (let (unvisited)\n (dolist (p '((0 . +1) (0 . -1) (+1 . 0) (-1 . 0)))\n (let ((r (+ row (car p)))\n (c (+ col (cdr p))))\n (unless (maze-is-set maze r c 'visited)\n (push (cons r c) unvisited))))\n unvisited))\n\n(defun make-passage (maze r1 c1 r2 c2)\n (if (= r1 r2)\n (if (< c1 c2)\n (maze-unset maze r2 c2 'wall) ; right\n (maze-unset maze r1 c1 'wall)) ; left\n (if (< r1 r2)\n (maze-unset maze r2 c2 'ceiling) ; up\n (maze-unset maze r1 c1 'ceiling)))) ; down\n\n(defun dig-maze (maze row col)\n (let (backup\n (run 0))\n (maze-set maze row col 'visited)\n (push (cons row col) backup)\n (while backup\n (setq run (1+ run))\n (when (> run (/ (+ row col) 3))\n (setq run 0)\n (setq backup (shuffle backup)))\n (setq row (caar backup)\n col (cdar backup))\n (let ((p (shuffle (to-visit maze row col))))\n (if p\n (let ((r (caar p))\n (c (cdar p)))\n (make-passage maze row col r c)\n (maze-set maze r c 'visited)\n (push (cons r c) backup))\n (pop backup)\n (setq backup (shuffle backup))\n (setq run 0))))))\n\n(defun generate (rows cols)\n (let* ((m (new-maze rows cols)))\n (dig-maze m (random rows) (random cols))\n (print-maze m)))\n\n(defun parse-ceilings (line)\n (let (rtn\n (i 1))\n (while (< i (length line))\n (push (eq ?- (elt line i)) rtn)\n (setq i (+ i 4)))\n (nreverse rtn)))\n\n(defun parse-walls (line)\n (let (rtn\n (i 0))\n (while (< i (length line))\n (push (eq ?| (elt line i)) rtn)\n (setq i (+ i 4)))\n (nreverse rtn)))\n\n(defun parse-maze (file-name)\n (let ((rtn)\n (lines (with-temp-buffer\n (insert-file-contents-literally file-name)\n (split-string (buffer-string) \"\\n\" t))))\n (while lines\n (push (parse-ceilings (pop lines)) rtn)\n (push (parse-walls (pop lines)) rtn))\n (nreverse rtn)))\n\n(defun read-maze (file-name)\n (let* ((raw (parse-maze file-name))\n (rows (1- (/ (length raw) 2)))\n (cols (length (car raw)))\n (maze (new-maze rows cols)))\n (dotimes (r rows)\n (let ((ceilings (pop raw)))\n (dotimes (c cols)\n (unless (pop ceilings)\n (maze-unset maze r c 'ceiling))))\n (let ((walls (pop raw)))\n (dotimes (c cols)\n (unless (pop walls)\n (maze-unset maze r c 'wall)))))\n maze))\n\n(defun find-exits (maze row col)\n (let (exits)\n (dolist (p '((0 . +1) (0 . -1) (-1 . 0) (+1 . 0)))\n (let ((r (+ row (car p)))\n (c (+ col (cdr p))))\n (unless\n (cond\n ((equal p '(0 . +1)) (maze-is-set maze r c 'wall))\n ((equal p '(0 . -1)) (maze-is-set maze row col 'wall))\n ((equal p '(+1 . 0)) (maze-is-set maze r c 'ceiling))\n ((equal p '(-1 . 0)) (maze-is-set maze row col 'ceiling)))\n (push (cons r c) exits))))\n exits))\n\n(defun drop-visited (maze points)\n (let (not-visited)\n (while points\n (unless (maze-is-set maze (caar points) (cdar points) 'visited)\n (push (car points) not-visited))\n (pop points))\n not-visited))\n\n(defun solve-maze (maze)\n (let (solution\n (exit (cons (- (maze-rows maze) 2) (- (maze-cols maze) 2)))\n (pt (cons 0 0)))\n (while (not (equal pt exit))\n (maze-set maze (car pt) (cdr pt) 'visited)\n (let ((exits (drop-visited maze (find-exits maze (car pt) (cdr pt)))))\n (if (null exits)\n (setq pt (pop solution))\n (push pt solution)\n (setq pt (pop exits)))))\n (push pt solution)))\n\n(defun solve (file-name)\n (let* ((maze (read-maze file-name))\n (solution (solve-maze maze)))\n (print-maze maze solution)))\n\n(solve \"maze.txt\")\n","language":"Emacs-Lisp"},{"code":"-module( maze_solving ).\n\n-export( [task/0] ).\n\ncells( {Start_x, Start_y}, {Stop_x, Stop_y}, Maze ) ->\n Start_pid = maze:cell_pid( Start_x, Start_y, Maze ),\n Stop_pid = maze:cell_pid( Stop_x, Stop_y, Maze ),\n {ok, Cells} = loop( Start_pid, Stop_pid, maze:cell_accessible_neighbours(Start_pid), [Start_pid] ),\n Cells.\n\ntask() ->\n Max_x = 16,\n Max_y = 8,\n Maze = maze:generation( Max_x, Max_y ),\n Start_x = random:uniform( Max_x ),\n Start_y = random:uniform( Max_y ),\n Stop_x = random:uniform( Max_x ),\n Stop_y = random:uniform( Max_y ),\n Cells = cells( {Start_x, Start_y}, {Stop_x, Stop_y}, Maze ),\n [maze:cell_content_set(X, \".\") || X <- Cells],\n maze:cell_content_set( maze:cell_pid(Start_x, Start_y, Maze), \"S\" ),\n maze:cell_content_set( maze:cell_pid(Stop_x, Stop_y, Maze), \"G\" ),\n maze:display( Maze ),\n maze:stop( Maze ).\n\n\n\nloop( _Start, _Stop, [], _Acc) -> {error, dead_end};\nloop( _Start, Stop, [Stop], Acc ) -> {ok, lists:reverse( [Stop | Acc] )};\nloop( Start, Stop, [Next], [Previous | _T]=Acc ) -> loop( Start, Stop, lists:delete(Previous, maze:cell_accessible_neighbours(Next)), [Next | Acc] );\nloop( Start, Stop, Nexts, Acc ) -> loop_stop( lists:member(Stop, Nexts), Start, Stop, Nexts, Acc ).\n\nloop_stop( true, _Start, Stop, _Nexts, Acc ) -> {ok, lists:reverse( [Stop | Acc] )};\nloop_stop( false, Start, Stop, Nexts, Acc ) ->\n My_pid = erlang:self(),\n [erlang:spawn( fun() -> My_pid ! loop( Start, Stop, [X], Acc ) end ) || X <- Nexts],\n receive\n {ok, Cells} -> {ok, Cells}\n end.\n","language":"Erlang"},{"code":"module MazeSolver where\n\nimport frege.IO\nimport Data.Maybe\n\n-- given two points, returns the average of them\naverage :: (Int, Int) -> (Int, Int) -> (Int, Int)\naverage (x, y) (x', y') = ((x + x') `div` 2, (y + y') `div` 2)\n\n-- given a maze and a tuple of position and wall position, returns\n-- true if the wall position is not blocked (first position is unused)\nnotBlocked :: [String] -> ((Int, Int), (Int, Int)) -> Bool\nnotBlocked maze (_, (x, y)) = (' ' == String.charAt (maze !! y) x)\n\n-- given a list, a position, and an element, returns a new list\n-- with the new element substituted at the position\nsubstitute :: [a] -> Int -> a -> [a]\nsubstitute orig pos el =\n let (before, after) = splitAt pos orig\n in before ++ [el] ++ tail after\n\n-- like above, but for strings, since Frege strings are not\n-- lists of characters\nsubstituteString :: String -> Int -> String -> String\nsubstituteString orig pos el =\n let before = substr orig 0 pos\n after = strtail orig (pos + 1)\n in before ++ el ++ after\n\n-- given a maze and a position, draw a '*' at that position in the maze\ndraw :: [String] -> (Int, Int) -> [String]\ndraw maze (x,y) = substitute maze y $ substituteString row x \"*\"\n where row = maze !! y\n\n-- given a maze, a previous position, and a list of tuples of potential\n-- new positions and their wall positions, returns the solved maze, or\n-- None if it cannot be solved\ntryMoves :: [String] -> (Int, Int) -> [((Int, Int), (Int, Int))] -> Maybe [String]\ntryMoves _ _ [] = Nothing\ntryMoves maze prevPos ((newPos,wallPos):more) =\n case solve' maze newPos prevPos\n of Nothing -> tryMoves maze prevPos more\n Just maze' -> Just $ foldl draw maze' [newPos, wallPos]\n\n-- given a maze, a new position, and a previous position, returns\n-- the solved maze, or None if it cannot be solved\n-- (assumes goal is upper-left corner of maze)\nsolve' :: [String] -> (Int, Int) -> (Int, Int) -> Maybe [String]\nsolve' maze (2, 1) _ = Just maze\nsolve' maze (x, y) prevPos =\n let newPositions = [(x, y - 2), (x + 4, y), (x, y + 2), (x - 4, y)]\n notPrev pos' = pos' /= prevPos\n newPositions' = filter notPrev newPositions\n wallPositions = map (average (x,y)) newPositions'\n zipped = zip newPositions' wallPositions\n legalMoves = filter (notBlocked maze) zipped\n in tryMoves maze (x,y) legalMoves\n\n-- given a maze, returns a solved maze, or None if it cannot be solved\n-- (starts at lower right corner and goes to upper left corner)\nsolve :: [String] -> Maybe [String]\nsolve maze = solve' (draw maze start) start (-1, -1)\n where startx = (length $ head maze) - 3\n starty = (length maze) - 2\n start = (startx, starty)\n\n-- takes unsolved maze on standard input, prints solved maze on standard output\nmain _ = do\n isin <- stdin\n isrin <- InputStreamReader.new isin\n brin <- BufferedReader.fromISR isrin\n lns <- BufferedReader.getlines brin\n printStr $ unlines $ fromMaybe [\"can't solve\"] $ solve lns\n","language":"Frege"},{"code":"package main\n\nimport (\n \"bytes\"\n \"fmt\"\n \"math/rand\"\n \"time\"\n)\n\ntype maze struct {\n c2 [][]byte // cells by row\n h2 [][]byte // horizontal walls by row (ignore first row)\n v2 [][]byte // vertical walls by row (ignore first of each column)\n}\n\nfunc newMaze(rows, cols int) *maze {\n c := make([]byte, rows*cols) // all cells\n h := bytes.Repeat([]byte{'-'}, rows*cols) // all horizontal walls\n v := bytes.Repeat([]byte{'|'}, rows*cols) // all vertical walls\n c2 := make([][]byte, rows) // cells by row\n h2 := make([][]byte, rows) // horizontal walls by row\n v2 := make([][]byte, rows) // vertical walls by row\n for i := range h2 {\n c2[i] = c[i*cols : (i+1)*cols]\n h2[i] = h[i*cols : (i+1)*cols]\n v2[i] = v[i*cols : (i+1)*cols]\n }\n return &maze{c2, h2, v2}\n}\n\nfunc (m *maze) String() string {\n hWall := []byte(\"+---\")\n hOpen := []byte(\"+ \")\n vWall := []byte(\"| \")\n vOpen := []byte(\" \")\n rightCorner := []byte(\"+\\n\")\n rightWall := []byte(\"|\\n\")\n var b []byte\n for r, hw := range m.h2 {\n for _, h := range hw {\n if h == '-' || r == 0 {\n b = append(b, hWall...)\n } else {\n b = append(b, hOpen...)\n if h != '-' && h != 0 {\n b[len(b)-2] = h\n }\n }\n }\n b = append(b, rightCorner...)\n for c, vw := range m.v2[r] {\n if vw == '|' || c == 0 {\n b = append(b, vWall...)\n } else {\n b = append(b, vOpen...)\n if vw != '|' && vw != 0 {\n b[len(b)-4] = vw\n }\n }\n if m.c2[r][c] != 0 {\n b[len(b)-2] = m.c2[r][c]\n }\n }\n b = append(b, rightWall...)\n }\n for _ = range m.h2[0] {\n b = append(b, hWall...)\n }\n b = append(b, rightCorner...)\n return string(b)\n}\n\nfunc (m *maze) gen() {\n m.g2(rand.Intn(len(m.c2)), rand.Intn(len(m.c2[0])))\n}\n\nconst (\n up = iota\n dn\n rt\n lf\n)\n\nfunc (m *maze) g2(r, c int) {\n m.c2[r][c] = ' '\n for _, dir := range rand.Perm(4) {\n switch dir {\n case up:\n if r > 0 && m.c2[r-1][c] == 0 {\n m.h2[r][c] = 0\n m.g2(r-1, c)\n }\n case lf:\n if c > 0 && m.c2[r][c-1] == 0 {\n m.v2[r][c] = 0\n m.g2(r, c-1)\n }\n case dn:\n if r < len(m.c2)-1 && m.c2[r+1][c] == 0 {\n m.h2[r+1][c] = 0\n m.g2(r+1, c)\n }\n case rt:\n if c < len(m.c2[0])-1 && m.c2[r][c+1] == 0 {\n m.v2[r][c+1] = 0\n m.g2(r, c+1)\n }\n }\n }\n}\n\nfunc main() {\n rand.Seed(time.Now().UnixNano())\n const height = 4\n const width = 7\n m := newMaze(height, width)\n m.gen()\n m.solve(\n rand.Intn(height), rand.Intn(width),\n rand.Intn(height), rand.Intn(width))\n fmt.Print(m)\n}\n\nfunc (m *maze) solve(ra, ca, rz, cz int) {\n var rSolve func(ra, ca, dir int) bool\n rSolve = func(r, c, dir int) bool {\n if r == rz && c == cz {\n m.c2[r][c] = 'F'\n return true\n }\n if dir != dn && m.h2[r][c] == 0 {\n if rSolve(r-1, c, up) {\n m.c2[r][c] = '^'\n m.h2[r][c] = '^'\n return true\n }\n }\n if dir != up && r+1 < len(m.h2) && m.h2[r+1][c] == 0 {\n if rSolve(r+1, c, dn) {\n m.c2[r][c] = 'v'\n m.h2[r+1][c] = 'v'\n return true\n }\n }\n if dir != lf && c+1 < len(m.v2[0]) && m.v2[r][c+1] == 0 {\n if rSolve(r, c+1, rt) {\n m.c2[r][c] = '>'\n m.v2[r][c+1] = '>'\n return true\n }\n }\n if dir != rt && m.v2[r][c] == 0 {\n if rSolve(r, c-1, lf) {\n m.c2[r][c] = '<'\n m.v2[r][c] = '<'\n return true\n }\n }\n return false\n }\n rSolve(ra, ca, -1)\n m.c2[ra][ca] = 'S'\n}\n","language":"Go"},{"code":"#!/usr/bin/runhaskell\n\nimport Data.Maybe (fromMaybe)\n\n-- given two points, returns the average of them\naverage :: (Int, Int) -> (Int, Int) -> (Int, Int)\naverage (x, y) (x_, y_) = ((x + x_) `div` 2, (y + y_) `div` 2)\n\n-- given a maze and a tuple of position and wall position, returns\n-- true if the wall position is not blocked (first position is unused)\nnotBlocked :: [String] -> ((Int, Int), (Int, Int)) -> Bool\nnotBlocked maze (_, (x, y)) = ' ' == (maze !! y) !! x\n\n-- given a list, a position, and an element, returns a new list\n-- with the new element substituted at the position\n-- (it seems such a function should exist in the standard library;\n-- I must be missing it)\nsubstitute :: [a] -> Int -> a -> [a]\nsubstitute orig pos el =\n let (before, after) = splitAt pos orig\n in before ++ [el] ++ tail after\n\n-- given a maze and a position, draw a '*' at that position in the maze\ndraw :: [String] -> (Int, Int) -> [String]\ndraw maze (x, y) =\n let row = maze !! y\n in substitute maze y $ substitute row x '*'\n\n-- given a maze, a previous position, and a list of tuples of potential\n-- new positions and their wall positions, returns the solved maze, or\n-- None if it cannot be solved\ntryMoves :: [String]\n -> (Int, Int)\n -> [((Int, Int), (Int, Int))]\n -> Maybe [String]\ntryMoves _ _ [] = Nothing\ntryMoves maze prevPos ((newPos, wallPos):more) =\n case solve_ maze newPos prevPos of\n Nothing -> tryMoves maze prevPos more\n Just maze_ -> Just $ foldl draw maze_ [newPos, wallPos]\n\n-- given a maze, a new position, and a previous position, returns\n-- the solved maze, or None if it cannot be solved\n-- (assumes goal is upper-left corner of maze)\nsolve_ :: [String] -> (Int, Int) -> (Int, Int) -> Maybe [String]\nsolve_ maze (2, 1) _ = Just maze\nsolve_ maze pos@(x, y) prevPos =\n let newPositions = [(x, y - 2), (x + 4, y), (x, y + 2), (x - 4, y)]\n notPrev pos_ = pos_ /= prevPos\n newPositions_ = filter notPrev newPositions\n wallPositions = map (average pos) newPositions_\n zipped = zip newPositions_ wallPositions\n legalMoves = filter (notBlocked maze) zipped\n in tryMoves maze pos legalMoves\n\n-- given a maze, returns a solved maze, or None if it cannot be solved\n-- (starts at lower right corner and goes to upper left corner)\nsolve :: [String] -> Maybe [String]\nsolve maze = solve_ (draw maze start) start (-1, -1)\n where\n startx = length (head maze) - 3\n starty = length maze - 2\n start = (startx, starty)\n\n-- takes unsolved maze on standard input, prints solved maze on standard output\nmain =\n let main_ = unlines . fromMaybe [\"can_t solve\"] . solve . lines\n in interact main_\n","language":"Haskell"},{"code":"procedure main(A)\n /mh := \\A[1] | 12\n /mw := \\A[2] | 16\n mz := DisplayMaze(GenerateMaze(mh,mw))\n WriteImage(mz.filename) # save file\n WAttrib(mz.window,\"canvas=normal\") # show it\n until Event() == &lpress # wait for left mouse press\n Solver(mz.maze)\n DisplayMazeSolution(mz)\n WriteImage(mz.filename ?:= (=\"maze-\", \"maze-solved-\" || tab(0)))\n until Event() == &lpress # wait\n close(mz.window)\nend\n","language":"Icon"},{"code":"procedure Solver(r,c)\nstatic maze,h,w,rd\n\n if type(r) == \"list\" then { # ------------------- Top Level (r == maze)\n h := *(maze := r) # height\n w := *maze[1] # width\n every r := 1 to h & c := 1 to w do # remove breadcrumbs\n maze[r,c] := iand(maze[r,c],NORTH+EAST+SOUTH+WEST+START+FINISH)\n every ((r := 1 | h) & (c := 1 to w)) | # search perimiter\n ((r := 1 to h) & (c := 1 | w)) do\n if iand(maze[r,c],START) > 0 then break # until start found\n Solver(r,c) # recurse through maze\n return 1(.maze,maze := &null) # return maze and reset\n }\n else # ------------------- Recurse way through maze\n if iand(x := maze[r,c],SEEN) = 0 then { # in bounds and not seen?\n (iand(x,FINISH) > 0, maze[r,c] +:= PATH, return ) # at finish? - done!\n maze[r,c] +:= SEEN # drop bread crumb\n (iand(x,NORTH) > 0, Solver(r-1,c), maze[r,c] +:= PATH, return)\n (iand(x,EAST) > 0, Solver(r,c+1), maze[r,c] +:= PATH, return)\n (iand(x,SOUTH) > 0, Solver(r+1,c), maze[r,c] +:= PATH, return)\n (iand(x,WEST) > 0, Solver(r,c-1), maze[r,c] +:= PATH, return)\n }\nend\n\nprocedure DisplayMazeSolution(mz) #: draw marked PATH\n&window := mz.window\nmaze := mz.maze\nWAttrib(\"dx=\"||(dxy:=BORDER+CELL/2),\"dy=\"||dxy)\nevery (r := 1 to *maze) & (c := 1 to *maze[1]) do {\n if fg ~=== \"blue\" then Fg(fg := \"blue\")\n if iand(maze[r,c],START) > 0 then Fg(fg := \"red\")\n if iand(maze[r,c],PATH) > 0 then\n FillCircle(x := CELL*(c-1),y := CELL*(r-1),rad := CELL/5)\n }\nreturn mz\nend\n","language":"Icon"},{"code":"global showMice\n\nimport Utils\t# To get 'Args' singleton class\n\nprocedure main(A)\n Args(A)\n if \\Args().get(\"help\",\"yes\") then helpMesg()\n showMice := Args().get(\"showmice\",\"yes\") # Show movements of all mice\n mh := Args().get(\"rows\") | 32 # Maze height (rows)\n mw := Args().get(\"cols\") | 48 # Maze width (columns)\n\n mz := DisplayMaze(GenerateMaze(mh,mw)) # Build and show maze\n\n QMouse(mz.maze,findStart(mz.maze),&null,0) # Start first quantum mouse\n waitForCompletion() # block until all quantum mice have finished\n\n # Mark the best path into the maze and display it.\n if showPath(mz.maze) then DisplayMazeSolution(mz) else write(\"No path found!\")\nend\n\nprocedure helpMesg()\n write(&errout,\"Usage: qSolve [--showmice] [--cols=C] [--rows=R]\")\n write(&errout,\"\\twhere:\")\n write(&errout,\"\\t\\t--showmice # displays all mice paths as they search\")\n write(&errout,\"\\t\\t--cols=C # sets maze width to C (default 16) columns\")\n write(&errout,\"\\t\\t--rows=R # sets maze height to R (default 12) rows\")\n stop()\nend\n\n# A \"Quantum-mouse\" for traversing mazes. Each mouse lives for just one cell, but\n# can spawn other mice to search from adjoining cells.\n\nglobal qMice, bestMouse, bestMouseLock, region, qMiceEmpty\nrecord Position(r,c)\n\n# Must match values used in maze generation!\n$define FINISH 64 # exit\n$define START 32 # entrance\n$define PATH 128\n$define SEEN 16 # bread crumbs for generator\n$define NORTH 8 # sides ...\n$define EAST 4\n$define SOUTH 2\n$define WEST 1\n$define EMPTY 0 # like new\n\nclass QMouse(maze, loc, parent, len, val)\n\n method getLoc(); return loc; end\n method getParent(); return \\parent; end\n method getLen(); return len; end\n method atEnd(); return EMPTY ~= iand(val, FINISH); end\n method goNorth(); if EMPTY ~= iand(val,NORTH) then return visit(loc.r-1, loc.c); end\n method goSouth(); if EMPTY ~= iand(val,SOUTH) then return visit(loc.r+1, loc.c); end\n method goEast(); if EMPTY ~= iand(val,EAST) then return visit(loc.r, loc.c+1); end\n method goWest(); if EMPTY ~= iand(val,WEST) then return visit(loc.r, loc.c-1); end\n\n method visit(r,c)\n critical region[r,c]: if EMPTY = iand(maze[r,c],SEEN) then {\n if /bestMouse | (len <= bestMouse.getLen()) then { # Keep going?\n mark(maze, r,c)\n unlock(region[r,c])\n return Position(r,c)\n }\n }\n end\n\ninitially (m, l, p, n)\n initial { # Construct critical region mutexes and completion condvar\n qMice := mutex(set())\n qMiceEmpty := condvar()\n bestMouseLock := mutex()\n region := list(*m) # Minimize critical region size\n every r := 1 to *m do region[r] := list(*m[1])\n every !!region := mutex()\n }\n maze := m\n loc := l\n parent := p\n len := n+1\n val := maze[loc.r,loc.c] | fail # Fail if outside maze\n insert(qMice, self)\n thread {\n if atEnd() then {\n critical bestMouseLock:\n if /bestMouse | (len < bestMouse.getLen()) then bestMouse := self\n }\n else { # Spawn more mice to look for finish\n QMouse(maze, goNorth(), self, len)\n QMouse(maze, goSouth(), self, len)\n QMouse(maze, goEast(), self, len)\n QMouse(maze, goWest(), self, len)\n }\n\n delete(qMice, self)\n if *qMice=0 then signal(qMiceEmpty)\n }\nend\n\nprocedure mark(maze, r,c)\n ior(maze[r,c],SEEN)\n if \\showMice then markCell(r,c,\"grey\",5)\n return Position(r,c)\nend\n\nprocedure clearMaze(maze) # Clear out dregs from maze creation\n every r := 1 to *maze & c := 1 to *maze[1] do # remove breadcrumbs\n maze[r,c] := iand(maze[r,c],NORTH+EAST+SOUTH+WEST+START+FINISH)\nend\n\nprocedure findStart(maze) # Anywhere in maze\n clearMaze(maze) # Remove breadcrumbs\n every r := 1 to *maze & c := 1 to *maze[1] do # Locate START cell\n if EMPTY ~= iand(maze[r,c],START) then return mark(maze, r,c)\nend\n\nprocedure showPath(maze)\n if path := \\bestMouse then { # Mark it in maze\n repeat {\n loc := path.getLoc()\n maze[loc.r,loc.c] +:= PATH\n path := \\path.getParent() | break\n }\n return\n }\nend\n\nprocedure waitForCompletion()\n critical qMiceEmpty: while *qMice > 0 do wait(qMiceEmpty)\nend\n","language":"Icon"},{"code":"maze=:4 :0\n assert.0<:n=.<:x*y\n horiz=. 0$~x,y-1\n verti=. 0$~(x-1),y\n path=.,:here=. ?x,y\n unvisited=.0 (<here+1)} 0,0,~|:0,0,~1$~y,x\n while.n do.\n neighbors=. here+\"1 (,-)=0 1\n neighbors=. neighbors #~ (<\"1 neighbors+1) {unvisited\n if.#neighbors do.\n n=.n-1\n next=. ({~ ?@#) neighbors\n unvisited=.0 (<next+1)} unvisited\n if.{.next=here\n do. horiz=.1 (<-:here+next-0 1)} horiz\n else. verti=. 1 (<-:here+next-1 0)} verti end.\n path=.path,here=.next\n else.\n here=.{:path\n path=.}:path\n end.\n end.\n horiz;verti\n)\n\nNB. source Dijkstra_equal_weights graph\nNB.\nNB. + +---+---+\nNB. | 0 1 2 | (sample cell numbers)\nNB. +---+ + +\nNB. | 3 4 | 5\nNB. +---+---+---+\nNB.\nNB. graph =: 1;0 2 4;1 5;4;1 3;2\nNB. The graph is a vector of boxed vectors of neighbors.\n\nDijkstra_equal_weights =: 4 : 0\n dist =. previous =. #&_ n =. # graph =. y [ source =. x\n dist =. 0 source } dist\n Q =. 0\n while. #Q do.\n u =. {.Q\n Q =. }.Q\n if. _ = u{dist do. break. end.\n for_v. >u{graph do.\n if. -. v e. previous do.\n alt =. >: u { dist\n if. alt < v { dist do.\n dist =. alt v } dist\n previous =. u v } previous\n if. v e. Q do.\n echo 'belch'\n else.\n Q =. Q,v\n end.\n end.\n end.\n end.\n end.\n dist;previous\n)\n\npath =: 3 : 0\n p =. <:#y\n while. _ > {:p do.\n p =. p,y{~{:p\n end.\n |.}:p\n)\n\nsolve=:3 :0\n NB. convert walls to graph\n shape =. }.@$@:>\n ew =. (,.&0 ,: 0&,.)@>@{. NB. east west doors\n ns =. (, &0 ,: 0&, )@>@{:\n cell_offsets =. 1 _1 1 _1 * 2 # 1 , {:@shape\n cell_numbers =. i.@shape\n neighbors =. (cell_numbers +\"_ _1 cell_offsets *\"_1 (ew , ns))y\n graph =. (|:@(,/\"_1) <@-.\"1 0 ,@i.@shape)neighbors NB. list of boxed neighbors\n NB. solve it\n path , > {: 0 Dijkstra_equal_weights graph\n)\n\ndisplay=:3 :0\n size=. >.&$&>/y\n text=. (}:1 3$~2*1+{:size)#\"1\":size$<' '\n 'hdoor vdoor'=. 2 4&*&.>&.> (#&,{@;&i./@$)&.> y\n ' ' (a:-.~0 1;0 2; 0 3;(2 1-~$text);(1 4&+&.> hdoor),,vdoor+&.>\"0/2 1;2 2;2 3)} text\n:\n a=. display y\n size=. >.&$&>/y\n columns=. {: size\n cells =. <\"1(1 2&p.@<.@(%&columns) ,. 2 4&p.@(columns&|))x\n 'o' cells } a NB. exercise, replace cells with a gerund to draw arrows on the path.\n)\n","language":"J"},{"code":"import java.io.*;\nimport java.util.*;\n\npublic class MazeSolver\n{\n /**\n * Reads a file into an array of strings, one per line.\n */\n private static String[] readLines (InputStream f) throws IOException\n {\n BufferedReader r =\n new BufferedReader (new InputStreamReader (f, \"US-ASCII\"));\n ArrayList<String> lines = new ArrayList<String>();\n String line;\n while ((line = r.readLine()) != null)\n lines.add (line);\n return lines.toArray(new String[0]);\n }\n\n /**\n * Makes the maze half as wide (i. e. \"+---+\" becomes \"+-+\"), so that\n * each cell in the maze is the same size horizontally as vertically.\n * (Versus the expanded version, which looks better visually.)\n * Also, converts each line of the maze from a String to a\n * char[], because we'll want mutability when drawing the solution later.\n */\n private static char[][] decimateHorizontally (String[] lines)\n {\n final int width = (lines[0].length() + 1) / 2;\n char[][] c = new char[lines.length][width];\n for (int i = 0 ; i < lines.length ; i++)\n for (int j = 0 ; j < width ; j++)\n c[i][j] = lines[i].charAt (j * 2);\n return c;\n }\n\n /**\n * Given the maze, the x and y coordinates (which must be odd),\n * and the direction we came from, return true if the maze is\n * solvable, and draw the solution if so.\n */\n private static boolean solveMazeRecursively (char[][] maze,\n int x, int y, int d)\n {\n boolean ok = false;\n for (int i = 0 ; i < 4 && !ok ; i++)\n if (i != d)\n switch (i)\n {\n // 0 = up, 1 = right, 2 = down, 3 = left\n case 0:\n if (maze[y-1][x] == ' ')\n ok = solveMazeRecursively (maze, x, y - 2, 2);\n break;\n case 1:\n if (maze[y][x+1] == ' ')\n ok = solveMazeRecursively (maze, x + 2, y, 3);\n break;\n case 2:\n if (maze[y+1][x] == ' ')\n ok = solveMazeRecursively (maze, x, y + 2, 0);\n break;\n case 3:\n if (maze[y][x-1] == ' ')\n ok = solveMazeRecursively (maze, x - 2, y, 1);\n break;\n }\n // check for end condition\n if (x == 1 && y == 1)\n ok = true;\n // once we have found a solution, draw it as we unwind the recursion\n if (ok)\n {\n maze[y][x] = '*';\n switch (d)\n {\n case 0:\n maze[y-1][x] = '*';\n break;\n case 1:\n maze[y][x+1] = '*';\n break;\n case 2:\n maze[y+1][x] = '*';\n break;\n case 3:\n maze[y][x-1] = '*';\n break;\n }\n }\n return ok;\n }\n\n /**\n * Solve the maze and draw the solution. For simplicity,\n * assumes the starting point is the lower right, and the\n * ending point is the upper left.\n */\n private static void solveMaze (char[][] maze)\n {\n solveMazeRecursively (maze, maze[0].length - 2, maze.length - 2, -1);\n }\n\n /**\n * Opposite of decimateHorizontally(). Adds extra characters to make\n * the maze \"look right\", and converts each line from char[] to\n * String at the same time.\n */\n private static String[] expandHorizontally (char[][] maze)\n {\n char[] tmp = new char[3];\n String[] lines = new String[maze.length];\n for (int i = 0 ; i < maze.length ; i++)\n {\n StringBuilder sb = new StringBuilder(maze[i].length * 2);\n for (int j = 0 ; j < maze[i].length ; j++)\n if (j % 2 == 0)\n sb.append (maze[i][j]);\n else\n {\n tmp[0] = tmp[1] = tmp[2] = maze[i][j];\n if (tmp[1] == '*')\n tmp[0] = tmp[2] = ' ';\n sb.append (tmp);\n }\n lines[i] = sb.toString();\n }\n return lines;\n }\n\n /**\n * Accepts a maze as generated by:\n * http://rosettacode.org/wiki/Maze_generation#Java\n * in a file whose name is specified as a command-line argument,\n * or on standard input if no argument is specified.\n */\n public static void main (String[] args) throws IOException\n {\n InputStream f = (args.length > 0\n ? new FileInputStream (args[0])\n : System.in);\n String[] lines = readLines (f);\n char[][] maze = decimateHorizontally (lines);\n solveMaze (maze);\n String[] solvedLines = expandHorizontally (maze);\n for (int i = 0 ; i < solvedLines.length ; i++)\n System.out.println (solvedLines[i]);\n }\n}\n","language":"Java"},{"code":"import java.awt.*;\nimport java.awt.event.*;\nimport java.awt.geom.Path2D;\nimport java.util.*;\nimport javax.swing.*;\n\npublic class MazeGenerator extends JPanel {\n enum Dir {\n N(1, 0, -1), S(2, 0, 1), E(4, 1, 0), W(8, -1, 0);\n final int bit;\n final int dx;\n final int dy;\n Dir opposite;\n\n // use the static initializer to resolve forward references\n static {\n N.opposite = S;\n S.opposite = N;\n E.opposite = W;\n W.opposite = E;\n }\n\n Dir(int bit, int dx, int dy) {\n this.bit = bit;\n this.dx = dx;\n this.dy = dy;\n }\n };\n final int nCols;\n final int nRows;\n final int cellSize = 25;\n final int margin = 25;\n final int[][] maze;\n LinkedList<Integer> solution;\n\n public MazeGenerator(int size) {\n setPreferredSize(new Dimension(650, 650));\n setBackground(Color.white);\n nCols = size;\n nRows = size;\n maze = new int[nRows][nCols];\n solution = new LinkedList<>();\n generateMaze(0, 0);\n\n addMouseListener(new MouseAdapter() {\n @Override\n public void mousePressed(MouseEvent e) {\n new Thread(() -> {\n solve(0);\n }).start();\n }\n });\n }\n\n @Override\n public void paintComponent(Graphics gg) {\n super.paintComponent(gg);\n Graphics2D g = (Graphics2D) gg;\n g.setRenderingHint(RenderingHints.KEY_ANTIALIASING,\n RenderingHints.VALUE_ANTIALIAS_ON);\n\n g.setStroke(new BasicStroke(5));\n g.setColor(Color.black);\n\n // draw maze\n for (int r = 0; r < nRows; r++) {\n for (int c = 0; c < nCols; c++) {\n\n int x = margin + c * cellSize;\n int y = margin + r * cellSize;\n\n if ((maze[r][c] & 1) == 0) // N\n g.drawLine(x, y, x + cellSize, y);\n\n if ((maze[r][c] & 2) == 0) // S\n g.drawLine(x, y + cellSize, x + cellSize, y + cellSize);\n\n if ((maze[r][c] & 4) == 0) // E\n g.drawLine(x + cellSize, y, x + cellSize, y + cellSize);\n\n if ((maze[r][c] & 8) == 0) // W\n g.drawLine(x, y, x, y + cellSize);\n }\n }\n\n // draw pathfinding animation\n int offset = margin + cellSize / 2;\n\n Path2D path = new Path2D.Float();\n path.moveTo(offset, offset);\n\n for (int pos : solution) {\n int x = pos % nCols * cellSize + offset;\n int y = pos / nCols * cellSize + offset;\n path.lineTo(x, y);\n }\n\n g.setColor(Color.orange);\n g.draw(path);\n\n g.setColor(Color.blue);\n g.fillOval(offset - 5, offset - 5, 10, 10);\n\n g.setColor(Color.green);\n int x = offset + (nCols - 1) * cellSize;\n int y = offset + (nRows - 1) * cellSize;\n g.fillOval(x - 5, y - 5, 10, 10);\n\n }\n\n void generateMaze(int r, int c) {\n Dir[] dirs = Dir.values();\n Collections.shuffle(Arrays.asList(dirs));\n for (Dir dir : dirs) {\n int nc = c + dir.dx;\n int nr = r + dir.dy;\n if (withinBounds(nr, nc) && maze[nr][nc] == 0) {\n maze[r][c] |= dir.bit;\n maze[nr][nc] |= dir.opposite.bit;\n generateMaze(nr, nc);\n }\n }\n }\n\n boolean withinBounds(int r, int c) {\n return c >= 0 && c < nCols && r >= 0 && r < nRows;\n }\n\n boolean solve(int pos) {\n if (pos == nCols * nRows - 1)\n return true;\n\n int c = pos % nCols;\n int r = pos / nCols;\n\n for (Dir dir : Dir.values()) {\n int nc = c + dir.dx;\n int nr = r + dir.dy;\n if (withinBounds(nr, nc) && (maze[r][c] & dir.bit) != 0\n && (maze[nr][nc] & 16) == 0) {\n\n int newPos = nr * nCols + nc;\n\n solution.add(newPos);\n maze[nr][nc] |= 16;\n\n animate();\n\n if (solve(newPos))\n return true;\n\n animate();\n\n solution.removeLast();\n maze[nr][nc] &= ~16;\n }\n }\n\n return false;\n }\n\n void animate() {\n try {\n Thread.sleep(50L);\n } catch (InterruptedException ignored) {\n }\n repaint();\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(\"Maze Generator\");\n f.setResizable(false);\n f.add(new MazeGenerator(24), BorderLayout.CENTER);\n f.pack();\n f.setLocationRelativeTo(null);\n f.setVisible(true);\n });\n }\n}\n","language":"Java"},{"code":"var ctx, wid, hei, cols, rows, maze, stack = [], start = {x:-1, y:-1}, end = {x:-1, y:-1}, grid = 8;\nfunction drawMaze() {\n for( var i = 0; i < cols; i++ ) {\n for( var j = 0; j < rows; j++ ) {\n switch( maze[i][j] ) {\n case 0: ctx.fillStyle = \"black\"; break;\n case 1: ctx.fillStyle = \"green\"; break;\n case 2: ctx.fillStyle = \"red\"; break;\n case 3: ctx.fillStyle = \"yellow\"; break;\n case 4: ctx.fillStyle = \"#500000\"; break;\n }\n ctx.fillRect( grid * i, grid * j, grid, grid );\n }\n }\n}\nfunction getFNeighbours( sx, sy, a ) {\n var n = [];\n if( sx - 1 > 0 && maze[sx - 1][sy] == a ) {\n n.push( { x:sx - 1, y:sy } );\n }\n if( sx + 1 < cols - 1 && maze[sx + 1][sy] == a ) {\n n.push( { x:sx + 1, y:sy } );\n }\n if( sy - 1 > 0 && maze[sx][sy - 1] == a ) {\n n.push( { x:sx, y:sy - 1 } );\n }\n if( sy + 1 < rows - 1 && maze[sx][sy + 1] == a ) {\n n.push( { x:sx, y:sy + 1 } );\n }\n return n;\n}\nfunction solveMaze() {\n if( start.x == end.x && start.y == end.y ) {\n for( var i = 0; i < cols; i++ ) {\n for( var j = 0; j < rows; j++ ) {\n switch( maze[i][j] ) {\n case 2: maze[i][j] = 3; break;\n case 4: maze[i][j] = 0; break;\n }\n }\n }\n drawMaze();\n return;\n }\n var neighbours = getFNeighbours( start.x, start.y, 0 );\n if( neighbours.length ) {\n stack.push( start );\n start = neighbours[0];\n maze[start.x][start.y] = 2;\n } else {\n maze[start.x][start.y] = 4;\n start = stack.pop();\n }\n\n drawMaze();\n requestAnimationFrame( solveMaze );\n}\nfunction getCursorPos( event ) {\n var rect = this.getBoundingClientRect();\n var x = Math.floor( ( event.clientX - rect.left ) / grid ),\n y = Math.floor( ( event.clientY - rect.top ) / grid );\n if( maze[x][y] ) return;\n if( start.x == -1 ) {\n start = { x: x, y: y };\n } else {\n end = { x: x, y: y };\n maze[start.x][start.y] = 2;\n solveMaze();\n }\n}\nfunction getNeighbours( sx, sy, a ) {\n var n = [];\n if( sx - 1 > 0 && maze[sx - 1][sy] == a && sx - 2 > 0 && maze[sx - 2][sy] == a ) {\n n.push( { x:sx - 1, y:sy } ); n.push( { x:sx - 2, y:sy } );\n }\n if( sx + 1 < cols - 1 && maze[sx + 1][sy] == a && sx + 2 < cols - 1 && maze[sx + 2][sy] == a ) {\n n.push( { x:sx + 1, y:sy } ); n.push( { x:sx + 2, y:sy } );\n }\n if( sy - 1 > 0 && maze[sx][sy - 1] == a && sy - 2 > 0 && maze[sx][sy - 2] == a ) {\n n.push( { x:sx, y:sy - 1 } ); n.push( { x:sx, y:sy - 2 } );\n }\n if( sy + 1 < rows - 1 && maze[sx][sy + 1] == a && sy + 2 < rows - 1 && maze[sx][sy + 2] == a ) {\n n.push( { x:sx, y:sy + 1 } ); n.push( { x:sx, y:sy + 2 } );\n }\n return n;\n}\nfunction createArray( c, r ) {\n var m = new Array( c );\n for( var i = 0; i < c; i++ ) {\n m[i] = new Array( r );\n for( var j = 0; j < r; j++ ) {\n m[i][j] = 1;\n }\n }\n return m;\n}\nfunction createMaze() {\n var neighbours = getNeighbours( start.x, start.y, 1 ), l;\n if( neighbours.length < 1 ) {\n if( stack.length < 1 ) {\n drawMaze(); stack = [];\n start.x = start.y = -1;\n document.getElementById( \"canvas\" ).addEventListener( \"mousedown\", getCursorPos, false );\n return;\n }\n start = stack.pop();\n } else {\n var i = 2 * Math.floor( Math.random() * ( neighbours.length / 2 ) )\n l = neighbours[i]; maze[l.x][l.y] = 0;\n l = neighbours[i + 1]; maze[l.x][l.y] = 0;\n start = l\n stack.push( start )\n }\n drawMaze();\n requestAnimationFrame( createMaze );\n}\nfunction createCanvas( w, h ) {\n var canvas = document.createElement( \"canvas\" );\n wid = w; hei = h;\n canvas.width = wid; canvas.height = hei;\n canvas.id = \"canvas\";\n ctx = canvas.getContext( \"2d\" );\n ctx.fillStyle = \"black\"; ctx.fillRect( 0, 0, wid, hei );\n document.body.appendChild( canvas );\n}\nfunction init() {\n cols = 73; rows = 53;\n createCanvas( grid * cols, grid * rows );\n maze = createArray( cols, rows );\n start.x = Math.floor( Math.random() * ( cols / 2 ) );\n start.y = Math.floor( Math.random() * ( rows / 2 ) );\n if( !( start.x & 1 ) ) start.x++; if( !( start.y & 1 ) ) start.y++;\n maze[start.x][start.y] = 0;\n createMaze();\n}\n","language":"JavaScript"},{"code":"\"\"\"\n + +---+---+\n | 1 2 3 |\n +---+ + +\n | 4 5 | 6\n +---+---+---+\n\n julia> const graph = [\n 0 1 0 0 0 0;\n 1 0 1 0 1 0;\n 0 1 0 0 0 1;\n 0 0 0 0 1 0;\n 0 1 0 1 0 0;\n 0 0 1 0 0 0]\n\n julia> dist, path = dijkstra(graph, 1)\n (Dict(4=>3,2=>1,3=>2,5=>2,6=>3,1=>0), Dict(4=>5,2=>1,3=>2,5=>2,6=>3,1=>0))\n\n julia> printpath(path, 6) # Display solution of the maze\n 1 -> 2 -> 3 -> 6\n\n\"\"\"\nfunction dijkstra(graph, source::Int=1)\n # ensure that the adjacency matrix is squared\n @assert size(graph, 1) == size(graph, 2)\n inf = typemax(Int64)\n n = size(graph, 1)\n\n Q = IntSet(1:n) # Set of unvisited nodes\n dist = Dict(n => inf for n in Q) # Unknown distance function from source to v\n prev = Dict(n => 0 for n in Q) # Previous node in optimal path from source\n dist[source] = 0 # Distance from source to source\n\n function _minimumdist(nodes) # Find the less distant node among nodes\n kmin, vmin = nothing, inf\n for (k, v) in dist\n if k ∈ nodes && v ≤ vmin\n kmin, vmin = k, v\n end\n end\n return kmin\n end\n # Until all nodes are visited...\n while !isempty(Q)\n u = _minimumdist(Q) # Vertex in Q with smallest dist[]\n pop!(Q, u)\n if dist[u] == inf break end # All remaining vertices are inaccessible from source\n for v in 1:n # Each neighbor v of u\n if graph[u, v] != 0 && v ∈ Q # where v has not yet been visited\n alt = dist[u] + graph[u, v]\n if alt < dist[v] # Relax (u, v, a)\n dist[v] = alt\n prev[v] = u\n end\n end\n end\n end\n\n return dist, prev\nend\n\nfunction printpath(prev::Dict, target::Int)\n path = \"$target\"\n while prev[target] != 0\n target = prev[target]\n path = \"$target -> \" * path\n end\n println(path)\nend\n\nconst graph = [\n 0 1 0 0 0 0;\n 1 0 1 0 1 0;\n 0 1 0 0 0 1;\n 0 0 0 0 1 0;\n 0 1 0 1 0 0;\n 0 0 1 0 0 0]\n\ndist, path = dijkstra(graph)\nprintpath(path, 6)\n","language":"Julia"},{"code":"// Version 1.2.31\n\nimport java.io.File\n\ntypealias Maze = List<CharArray>\n\n/**\n * Makes the maze half as wide (i. e. \"+---+\" becomes \"+-+\"), so that\n * each cell in the maze is the same size horizontally as vertically.\n * (Versus the expanded version, which looks better visually.)\n * Also, converts each line of the maze from a String to a\n * char[], because we'll want mutability when drawing the solution later.\n */\nfun decimateHorizontally(lines: List<String>): Maze {\n val width = (lines[0].length + 1) / 2\n val c = List(lines.size) { CharArray(width) }\n for (i in 0 until lines.size) {\n for (j in 0 until width) c[i][j] = lines[i][j * 2]\n }\n return c\n}\n\n/**\n * Given the maze, the x and y coordinates (which must be odd),\n * and the direction we came from, return true if the maze is\n * solvable, and draw the solution if so.\n */\nfun solveMazeRecursively(maze: Maze, x: Int, y: Int, d: Int): Boolean {\n var ok = false\n var i = 0\n while (i < 4 && !ok) {\n if (i != d) {\n // 0 = up, 1 = right, 2 = down, 3 = left\n when(i) {\n 0 -> if (maze[y - 1][x] == ' ') ok = solveMazeRecursively (maze, x, y - 2, 2)\n 1 -> if (maze[y][x + 1] == ' ') ok = solveMazeRecursively (maze, x + 2, y, 3)\n 2 -> if (maze[y + 1][x] == ' ') ok = solveMazeRecursively (maze, x, y + 2, 0)\n 3 -> if (maze[y][x - 1] == ' ') ok = solveMazeRecursively (maze, x - 2, y, 1)\n else -> {}\n }\n }\n i++\n }\n\n // check for end condition\n if (x == 1 && y == 1) ok = true\n\n // once we have found a solution, draw it as we unwind the recursion\n if (ok) {\n maze[y][x] = '*'\n when (d) {\n 0 -> maze[y - 1][x] = '*'\n 1 -> maze[y][x + 1] = '*'\n 2 -> maze[y + 1][x] = '*'\n 3 -> maze[y][x - 1] = '*'\n else -> {}\n }\n }\n return ok\n}\n\n/**\n * Solve the maze and draw the solution. For simplicity,\n * assumes the starting point is the lower right, and the\n * ending point is the upper left.\n */\nfun solveMaze(maze: Maze) =\n solveMazeRecursively(maze, maze[0].size - 2, maze.size - 2, -1)\n\n/**\n * Opposite of decimateHorizontally(). Adds extra characters to make\n * the maze \"look right\", and converts each line from char[] to\n * String at the same time.\n */\nfun expandHorizontally(maze: Maze): Array<String> {\n val tmp = CharArray(3)\n val lines = Array<String>(maze.size) { \"\" }\n for (i in 0 until maze.size) {\n val sb = StringBuilder(maze[i].size * 2)\n for (j in 0 until maze[i].size) {\n if (j % 2 == 0)\n sb.append(maze[i][j])\n else {\n for (k in 0..2) tmp[k] = maze[i][j]\n if (tmp[1] == '*') {\n tmp[0] = ' '\n tmp[2] = ' '\n }\n sb.append(tmp)\n }\n }\n lines[i] = sb.toString()\n }\n return lines\n}\n\n/**\n * Accepts a maze as generated by:\n * http://rosettacode.org/wiki/Maze_generation#Kotlin\n * in a file whose name is specified as a command-line argument.\n */\nfun main(args: Array<String>) {\n if (args.size != 1) {\n println(\"The maze file to be read should be passed as a single command line argument.\")\n return\n }\n val f = File(args[0])\n if (!f.exists()) {\n println(\"Sorry ${args[0]} does not exist.\")\n return\n }\n val lines = f.readLines(Charsets.US_ASCII)\n val maze = decimateHorizontally(lines)\n solveMaze(maze)\n val solvedLines = expandHorizontally(maze)\n println(solvedLines.joinToString(\"\\n\"))\n}\n","language":"Kotlin"},{"code":"HighlightGraph[maze, PathGraph@FindShortestPath[maze, 1, 273]]\n","language":"Mathematica"},{"code":"import random, strutils\n\ntype\n\n Direction {.pure.} = enum None, Up, Left, Down, Right\n\n Maze = object\n cells: seq[string]\n hwalls: seq[string]\n vwalls: seq[string]\n\n\n####################################################################################################\n# Maze creation.\n\nfunc initMaze(rows, cols: Positive): Maze =\n ## Initialize a maze description.\n var h = repeat('-', cols)\n var v = repeat(\"|\", cols)\n for i in 0..<rows:\n result.cells.add newString(cols)\n result.hwalls.add h\n result.vwalls.add v\n\n\nproc gen(maze: var Maze; r, c: Natural) =\n ## Generate a maze starting from point (r, c).\n\n maze.cells[r][c] = ' '\n var dirs = [Up, Left, Down, Right]\n dirs.shuffle()\n for dir in dirs:\n case dir\n of None:\n discard\n of Up:\n if r > 0 and maze.cells[r-1][c] == '\\0':\n maze.hwalls[r][c] = chr(0)\n maze.gen(r-1, c)\n of Left:\n if c > 0 and maze.cells[r][c-1] == '\\0':\n maze.vwalls[r][c] = chr(0)\n maze.gen(r, c-1)\n of Down:\n if r < maze.cells.high and maze.cells[r+1][c] == '\\0':\n maze.hwalls[r+1][c] = chr(0)\n maze.gen(r+1, c)\n of Right:\n if c < maze.cells[0].high and maze.cells[r][c+1] == '\\0':\n maze.vwalls[r][c+1] = chr(0)\n maze.gen(r, c+1)\n\n\nproc gen(maze: var Maze) =\n ## Generate a maze, choosing a random starting point.\n maze.gen(rand(maze.cells.high), rand(maze.cells[0].high))\n\n\n####################################################################################################\n# Maze solving.\n\nproc solve(maze: var Maze; ra, ca, rz, cz: Natural) =\n ## Solve a maze by finding the path from point (ra, ca) to point (rz, cz).\n\n proc rsolve(maze: var Maze; r, c: Natural; dir: Direction): bool {.discardable.} =\n ## Recursive solver.\n\n if r == rz and c == cz:\n maze.cells[r][c] = 'F'\n return true\n\n if dir != Down and maze.hwalls[r][c] == '\\0':\n if maze.rSolve(r-1, c, Up):\n maze.cells[r][c] = '^'\n maze.hwalls[r][c] = '^'\n return true\n\n if dir != Up and r < maze.hwalls.high and maze.hwalls[r+1][c] == '\\0':\n if maze.rSolve(r+1, c, Down):\n maze.cells[r][c] = 'v'\n maze.hwalls[r+1][c] = 'v'\n return true\n\n if dir != Left and c < maze.vwalls[0].high and maze.vwalls[r][c+1] == '\\0':\n if maze.rSolve(r, c+1, Right):\n maze.cells[r][c] = '>'\n maze.vwalls[r][c+1] = '>'\n return true\n\n if dir != Right and maze.vwalls[r][c] == '\\0':\n if maze.rSolve(r, c-1, Left):\n maze.cells[r][c] = '<'\n maze.vwalls[r][c] = '<'\n return true\n\n\n maze.rsolve(ra, ca, None)\n maze.cells[ra][ca] = 'S'\n\n\n####################################################################################################\n# Maze display.\n\nfunc `$`(maze: Maze): string =\n ## Return the string representation fo a maze.\n\n const\n HWall = \"+---\"\n HOpen = \"+ \"\n VWall = \"| \"\n VOpen = \" \"\n RightCorner = \"+\\n\"\n RightWall = \"|\\n\"\n\n for r, hw in maze.hwalls:\n\n for h in hw:\n if h == '-' or r == 0:\n result.add HWall\n else:\n result.add HOpen\n if h notin {'-', '\\0'}: result[^2] = h\n result.add RightCorner\n\n for c, vw in maze.vwalls[r]:\n if vw == '|' or c == 0:\n result.add VWall\n else:\n result.add VOpen\n if vw notin {'|', '\\0'}: result[^4] = vw\n if maze.cells[r][c] != '\\0': result[^2] = maze.cells[r][c]\n result.add RightWall\n\n for _ in 1..maze.hwalls[0].len:\n result.add HWall\n result.add RightCorner\n\n\n#———————————————————————————————————————————————————————————————————————————————————————————————————\n\nwhen isMainModule:\n\n const\n Width = 8\n Height = 8\n\n randomize()\n var maze = initMaze(Width, Height)\n maze.gen()\n var ra, rz = rand(Width - 1)\n var ca, cz = rand(Height - 1)\n while rz == ra and cz == ca:\n # Make sur starting and ending points are different.\n rz = rand(Width - 1)\n cz = rand(Height - 1)\n maze.solve(ra, ca , rz, cz)\n echo maze\n","language":"Nim"},{"code":"#!perl\nuse strict;\nuse warnings;\n\nmy ($width, $height) = @ARGV;\n$_ ||= 10 for $width, $height;\n\nmy %visited;\n\nmy $h_barrier = \"+\" . (\"--+\" x $width) . \"\\n\";\nmy $v_barrier = \"|\" . (\" |\" x $width) . \"\\n\";\nmy @output = ($h_barrier, $v_barrier) x $height;\npush @output, $h_barrier;\nmy @dx = qw(-1 1 0 0);\nmy @dy = qw(0 0 -1 1);\n\nsub visit {\n my ($x, $y) = @_;\n $visited{$x, $y} = 1;\n my $rand = int rand 4;\n for my $n ( $rand .. 3, 0 .. $rand-1 ) {\n my ($xx, $yy) = ($x + $dx[$n], $y + $dy[$n]);\n next if $visited{ $xx, $yy };\n next if $xx < 0 or $xx >= $width;\n next if $yy < 0 or $yy >= $height;\n\n my $row = $y * 2 + 1 + $dy[$n];\n my $col = $x * 3 + 1 + $dx[$n];\n substr( $output[$row], $col, 2, ' ' );\n\n no warnings 'recursion';\n visit( $xx, $yy );\n }\n}\n\nvisit( int rand $width, int rand $height );\n\nprint \"Here is the maze:\\n\";\nprint @output;\n\n%visited = ();\n\nmy @d = ('>>', '<<', 'vv', '^^');\nsub solve {\n my ($x, $y) = @_;\n return 1 if $x == 0 and $y == 0;\n $visited{ $x, $y } = 1;\n my $rand = int rand 4;\n for my $n ( $rand .. 3, 0 .. $rand-1 ) {\n my ($xx, $yy) = ($x + $dx[$n], $y + $dy[$n]);\n next if $visited{ $xx, $yy };\n next if $xx < 0 or $xx >= $width;\n next if $yy < 0 or $yy >= $height;\n\n my $row = $y * 2 + 1 + $dy[$n];\n my $col = $x * 3 + 1 + $dx[$n];\n\n my $b = substr( $output[$row], $col, 2 );\n next if \" \" ne $b;\n\n no warnings 'recursion';\n next if not solve( $xx, $yy );\n\n substr( $output[$row], $col, 2, $d[$n] );\n substr( $output[$row-$dy[$n]], $col-$dx[$n], 2, $d[$n] );\n return 1;\n }\n 0;\n}\n\nif( solve( $width-1, $height-1 ) ) {\n print \"Here is the solution:\\n\";\n substr( $output[1], 1, 2, '**' );\n print @output;\n} else {\n print \"Could not solve!\\n\";\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\Maze_solving.exw\n -- =============================\n --</span>\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;\">11</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">h</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">8</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> <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\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">amaze</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>\n <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: #0000FF;\">=</span> <span style=\"color: #008000;\">' '</span> <span style=\"color: #000080;font-style:italic;\">-- mark cell visited</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shuffle</span><span style=\"color: #0000FF;\">({{</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">4</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: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">4</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: #000000;\">y</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;\">p</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;\">nx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ny</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>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">nx</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">nx</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">ny</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">ny</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">h</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">ny</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">nx</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #008000;\">'?'</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">mx</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;\">nx</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">2</span>\n <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;\">ny</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">mx</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">mx</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> <span style=\"color: #000080;font-style:italic;\">-- knock down wall</span>\n <span style=\"color: #000000;\">amaze</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ny</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;\">procedure</span>\n\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">dx</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">dy</span> <span style=\"color: #000080;font-style:italic;\">-- door location (in a wall!)</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">solve_maze</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>\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;\">x</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">4</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: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">4</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: #000000;\">y</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;\">d</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: #004080;\">integer</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">nx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ny</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;\">d</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">wx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">wy</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;\">nx</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,(</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">ny</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">2</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;\">wy</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">wx</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;\">wy</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">wx</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"-:-:\"</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #000080;font-style:italic;\">-- mark path</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">wx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">wy</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: #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;\">if</span> <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">ny</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">nx</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;\">ny</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">nx</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">'o'</span> <span style=\"color: #000080;font-style:italic;\">-- mark cell</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">solve_maze</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ny</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;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">ny</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">nx</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">' '</span> <span style=\"color: #000080;font-style:italic;\">-- unmark cell</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">wy</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">wx</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">' '</span> <span style=\"color: #000080;font-style:italic;\">-- unmark path</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;\">heads</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">rand</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: #000080;font-style:italic;\">-- toin coss 50:50 true(1)/false(0)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\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: #0000FF;\">{(</span><span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">rand</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;\">amaze</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: #000080;font-style:italic;\">-- mark start pos</span>\n <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: #0000FF;\">=</span> <span style=\"color: #008000;\">'*'</span>\n <span style=\"color: #000080;font-style:italic;\">-- add a random door (heads=rhs/lhs, tails=top/btm)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">heads</span><span style=\"color: #0000FF;\">()</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">dy</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dx</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">rand</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><span style=\"color: #000000;\">heads</span><span style=\"color: #0000FF;\">()*</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">dy</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">dx</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">' '</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">dy</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dx</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">heads</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><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">dy</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">dx</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">dx</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;\">if</span>\n <span style=\"color: #0000FF;\">{}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">solve_maze</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: #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>\n<!--\n","language":"Phix"},{"code":"main =>\n Maze0 = [\"+---+---+---+---+---+---+---+---+\",\n \"| | | | |\",\n \"+ + + +---+ + +---+ +\",\n \"| | | | | |\",\n \"+---+---+ + +---+---+ + +\",\n \"| | | | |\",\n \"+---+ + + +---+---+---+ +\",\n \"| | | | |\",\n \"+ + + +---+---+---+ + +\",\n \"| | | | | |\",\n \"+ + + +---+ +---+---+ +\",\n \"| | | | | |\",\n \"+ +---+---+ +---+---+---+ +\",\n \"| | | |\",\n \"+ +---+ +---+ + +---+ +\",\n \"| | | |\",\n \"+---+---+---+---+---+---+---+---+\"],\n MaxR = len(Maze0) div 2,\n MaxC = len(Maze0[1]) div 4,\n Maze = new_array(MaxR,MaxC),\n foreach (R in 1..MaxR, C in 1..MaxC)\n Maze[R,C] = 0\n end,\n fill_maze(Maze0,Maze,1),\n solve_maze(Maze,(1,1),(MaxR,MaxC),Cost,Plan),\n OutputMaze = new_array(MaxR,MaxC),\n foreach ((R,C) in Plan)\n OutputMaze[R,C] = '*'\n end,\n output_maze(Maze0,OutputMaze,1).\n\nfill_maze([Line1,Line2|Maze0],Maze,R) =>\n fill_maze_cols(Line1,Maze,R,1),\n fill_maze_cols(Line2,Maze,R,1),\n fill_maze(Maze0,Maze,R+1).\nfill_maze(_,_,_) => true.\n\nfill_maze_cols(['+',' ',' ',' '|Line],Maze,R,C) =>\n Maze[R,C] := Maze[R,C] \\/ 4, % up\n Maze[R-1,C] := Maze[R-1,C] \\/ 8, % down\n fill_maze_cols(Line,Maze,R,C+1).\nfill_maze_cols([' ',' ',' ',' '|Line],Maze,R,C) =>\n Maze[R,C] := Maze[R,C] \\/ 1, % left\n Maze[R,C-1] := Maze[R,C-1] \\/ 2, % right\n fill_maze_cols(Line,Maze,R,C+1).\nfill_maze_cols([_,_,_,_|Line],Maze,R,C) =>\n fill_maze_cols(Line,Maze,R,C+1).\nfill_maze_cols(_,_,_,_) => true.\n\ntable (+,+,+,min,-)\nsolve_maze(_Maze,FPos,FPos,Cost,Plan) =>\n Cost = 0,\n Plan = [FPos].\nsolve_maze(Maze,Pos@(R,C),FPos,Cost,Plan) ?=>\n Maze[R,C] /\\ 1 == 1, % left\n solve_maze(Maze,(R,C-1),FPos,Cost1,Plan1),\n Plan = [Pos|Plan1],\n Cost = Cost1+1.\nsolve_maze(Maze,Pos@(R,C),FPos,Cost,Plan) ?=>\n Maze[R,C] /\\ 2 == 2, % right\n solve_maze(Maze,(R,C+1),FPos,Cost1,Plan1),\n Plan = [Pos|Plan1],\n Cost = Cost1+1.\nsolve_maze(Maze,Pos@(R,C),FPos,Cost,Plan) ?=>\n Maze[R,C] /\\ 4 == 4, % up\n solve_maze(Maze,(R-1,C),FPos,Cost1,Plan1),\n Plan = [Pos|Plan1],\n Cost = Cost1+1.\nsolve_maze(Maze,Pos@(R,C),FPos,Cost,Plan) ?=>\n Maze[R,C] /\\ 8 == 8, % down\n solve_maze(Maze,(R+1,C),FPos,Cost1,Plan1),\n Plan = [Pos|Plan1],\n Cost = Cost1+1.\n\noutput_maze([Line1,Line2|Maze0],Maze,R) =>\n output_maze_cols(Line1,Maze,R,1),\n output_maze_cols(Line2,Maze,R,1),\n output_maze(Maze0,Maze,R+1).\noutput_maze([Line],_,_) => println(Line).\n\noutput_maze_cols([' ',' ',' ',' '|Line],Maze,R,C) =>\n if Maze[R,C] == '*' then\n print(\" * \")\n else\n print(\" \")\n end,\n output_maze_cols(Line,Maze,R,C+1).\noutput_maze_cols(['|',' ',' ',' '|Line],Maze,R,C) =>\n if Maze[R,C] == '*' then\n print(\"| * \")\n else\n print(\"| \")\n end,\n output_maze_cols(Line,Maze,R,C+1).\noutput_maze_cols(['+',' ',' ',' '|Line],Maze,R,C) =>\n if Maze[R,C] == '*' && Maze[R-1,C] == '*' then\n print(\"+ * \")\n else\n print(\"+ \")\n end,\n output_maze_cols(Line,Maze,R,C+1).\noutput_maze_cols([C1,C2,C3,C4|Line],Maze,R,C) =>\n printf(\"%c%c%c%c\",C1,C3,C3,C4),\n output_maze_cols(Line,Maze,R,C+1).\noutput_maze_cols(Line,_,_,_) => println(Line).\n","language":"Picat"},{"code":"(de shortestPath (Goal This Maze)\n (let (Path NIL Best NIL Dir \" > \")\n (recur (This Path Dir)\n (when (and This (not (: mark)))\n (push 'Path (cons This Dir))\n (if (== Goal This)\n (unless (and Best (>= (length Path) (length Best)))\n (setq Best Path) )\n (=: mark T)\n (recurse (: west) Path \" > \")\n (recurse (: east) Path \" < \")\n (recurse (: south) Path \" \\^ \")\n (recurse (: north) Path \" v \")\n (=: mark NIL) ) ) )\n (disp Maze 0\n '((Fld) (if (asoq Fld Best) (cdr @) \" \")) ) ) )\n","language":"PicoLisp"},{"code":":- dynamic cell/2.\n:- dynamic maze/3.\n:- dynamic path/1.\n\nmaze_solve(Lig,Col) :-\n\tretractall(cell(_,_)),\n\tretractall(maze(_,_,_)),\n\tretractall(path(_)),\n\n\t% initialisation of the neighbours of the cells\n\tforall(between(0, Lig, I),\n\t ( forall(between(0, Col, J), assert(maze(I, J, []))))),\n\n\t% creation of the window of the maze\n\tnew(D, window('Maze')),\n\tforall(between(0,Lig, I),\n\t (XL is 50, YL is I * 30 + 50,\n\t\tXR is Col * 30 + 50,\n\t\tnew(L, line(XL, YL, XR, YL)),\n\t\tsend(D, display, L))),\n\n\tforall(between(0,Col, I),\n\t (XT is 50 + I * 30, YT is 50,\n\t\tYB is Lig * 30 + 50,\n\t\tnew(L, line(XT, YT, XT, YB)),\n\t\tsend(D, display, L))),\n\n\tSX is Col * 30 + 100,\n\tSY is Lig * 30 + 100,\n\tsend(D, size, new(_, size(SX, SY))),\n\tL0 is random(Lig),\n\tC0 is random(Col),\n\tassert(cell(L0, C0)),\n\t\\+search(D, Lig, Col, L0, C0),\n\tsend(D, open),\n\n\t% we look for a path from cell(0, 0) to cell(Lig-1, Col-1)\n\t% creation of the entrance\n\terase_line(D, -1, 0, 0, 0),\n\n\t% creation of the exit\n\tLig1 is Lig-1,\n\tCol1 is Col-1,\n\terase_line(D, Lig1, Col1, Lig, Col1),\n\n\t% seraching the path\n\tassert(path([[0, 0], [-1, 0]])),\n\twalk(Lig, Col),\n\tpath(P),\n\tdisplay_path(D, P).\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nwalk(Lig, Col) :-\n\tpath([[L, C] | _R]),\n\tL is Lig - 1,\n\tC is Col - 1,\n\tretract(path(P)),\n\tassert(path([[Lig, C]|P])).\n\nwalk(Lig, Col) :-\n\tretract(path([[L, C] | R])),\n\tmaze(L, C, Edge),\n\tmember([L1, C1], Edge),\n\t\\+member([L1, C1], R),\n\tassert(path([[L1,C1], [L, C] | R])),\n\twalk(Lig, Col).\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\ndisplay_path(_, []).\n\ndisplay_path(D, [[L, C] | R]):-\n\tnew(B, box(10,10)),\n\tsend(B, fill_pattern, new(_, colour(@default, 0,0,0))),\n\tX is C * 30 + 60,\n\tY is L * 30 + 60,\n\tsend(D, display, B, point(X,Y)),\n\tdisplay_path(D, R).\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nsearch(D, Lig, Col, L, C) :-\n\tDir is random(4),\n\tnextcell(Dir, Lig, Col, L, C, L1, C1),\n\tassert(cell(L1,C1)),\n\tassert(cur(L1,C1)),\n\n\tretract(maze(L, C, Edge)),\n\tassert(maze(L, C, [[L1, C1] | Edge])),\n\tretract(maze(L1, C1, Edge1)),\n\tassert(maze(L1, C1, [[L, C] | Edge1])),\n\n\terase_line(D, L, C, L1, C1),\n\tsearch(D, Lig, Col, L1, C1).\n\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nerase_line(D, L, C, L, C1) :-\n\t( C < C1 -> C2 = C1; C2 = C),\n\tXT is C2 * 30 + 50,\n\tYT is L * 30 + 51, YR is (L+1) * 30 + 50,\n\tnew(Line, line(XT, YT, XT, YR)),\n\tsend(Line, colour, white),\n\tsend(D, display, Line).\n\nerase_line(D, L, C, L1, C) :-\n\tXT is 51 + C * 30, XR is 50 + (C + 1) * 30,\n\t( L < L1 -> L2 is L1; L2 is L),\n\tYT is L2 * 30 + 50,\n\tnew(Line, line(XT, YT, XR, YT)),\n\tsend(Line, colour, white),\n\tsend(D, display, Line).\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nnextcell(Dir, Lig, Col, L, C, L1, C1) :-\n\tnext(Dir, Lig, Col, L, C, L1, C1);\n\t( Dir1 is (Dir+3) mod 4,\n\t next(Dir1, Lig, Col, L, C, L1, C1));\n\t( Dir2 is (Dir+1) mod 4,\n\t next(Dir2, Lig, Col, L, C, L1, C1));\n\t( Dir3 is (Dir+2) mod 4,\n\t next(Dir3, Lig, Col, L, C, L1, C1)).\n\n% 0 => northward\nnext(0, _Lig, _Col, L, C, L1, C) :-\n\tL > 0,\n\tL1 is L - 1,\n\t\\+cell(L1, C).\n\n% 1 => rightward\nnext(1, _Lig, Col, L, C, L, C1) :-\n\tC < Col - 1,\n\tC1 is C + 1,\n\t\\+cell(L, C1).\n\n% 2 => southward\nnext(2, Lig, _Col, L, C, L1, C) :-\n\tL < Lig - 1,\n\tL1 is L + 1,\n\t\\+cell(L1, C).\n\n% 3 => leftward\nnext(2, _Lig, _Col, L, C, L, C1) :-\n\tC > 0,\n\tC1 is C - 1,\n\t\\+cell(L, C1).\n","language":"Prolog"},{"code":";code from the maze generation task is place here in its entirety before the rest of the code\n\nProcedure displayMazePath(Array maze(2), List Path.POINT())\n Protected x, y, vWall.s, hWall.s\n Protected mazeWidth = ArraySize(maze(), 1), mazeHeight = ArraySize(maze(), 2)\n Protected Dim mazeOutput.mazeOutput(mazeHeight)\n Protected Dim mazeRow.mazeOutput(0)\n Static pathChars.s = \"@^>v<\"\n\n For y = 0 To mazeHeight\n makeDisplayMazeRow(mazeRow(), maze(), y): mazeOutput(y) = mazeRow(0)\n Next\n\n If ListSize(path())\n FirstElement(path())\n Protected prevPath.POINT = path()\n\n While NextElement(path())\n x = path()\\x - prevPath\\x\n y = path()\\y - prevPath\\y\n Select x\n Case -1: dirTaken = #dir_W\n Case 1: dirTaken = #dir_E\n Default\n If y < 0\n dirTaken = #dir_N\n Else\n dirTaken = #dir_S\n EndIf\n EndSelect\n hWall = mazeOutput(prevPath\\y)\\hWall\n mazeOutput(prevPath\\y)\\hWall = Left(hWall, prevPath\\x * #cellDWidth + 2) + Mid(pathChars, dirTaken + 1, 1) + Right(hWall, Len(hWall) - (prevPath\\x * #cellDWidth + 3))\n prevPath = path()\n Wend\n hWall = mazeOutput(prevPath\\y)\\hWall\n mazeOutput(prevPath\\y)\\hWall = Left(hWall, prevPath\\x * #cellDWidth + 2) + Mid(pathChars, #dir_ID + 1, 1) + Right(hWall, Len(hWall) - (prevPath\\x * #cellDWidth + 3))\n\n For y = 0 To mazeHeight\n PrintN(mazeOutput(y)\\vWall): PrintN(mazeOutput(y)\\hWall)\n Next\n EndIf\nEndProcedure\n\nProcedure solveMaze(Array maze(2), *start.POINT, *finish.POINT, List Path.POINT())\n Protected mazeWidth = ArraySize(maze(), 1), mazeHeight = ArraySize(maze(), 2)\n Dim visited(mazeWidth + 1, mazeHeight + 1) ;includes padding for easy border detection\n\n Protected i\n ;mark outside border as already visited (off limits)\n For i = 1 To mazeWidth\n visited(i, 0) = #True: visited(i, mazeHeight + 1) = #True\n Next\n For i = 1 To mazeHeight\n visited(0, i) = #True: visited(mazeWidth + 1, i) = #True\n Next\n\n Protected x = *start\\x, y = *start\\y, nextCellDir\n visited(x + offset(#visited, #dir_ID)\\x, y + offset(#visited, #dir_ID)\\y) = #True\n\n ClearList(path())\n Repeat\n If x = *finish\\x And y = *finish\\y\n AddElement(path())\n path()\\x = x: path()\\y = y\n Break ;success\n EndIf\n\n nextCellDir = #firstDir - 1\n For i = #firstDir To #numDirs\n If Not visited(x + offset(#visited, i)\\x, y + offset(#visited, i)\\y)\n If maze(x + offset(#wall, i)\\x, y + offset(#wall, i)\\y) & wallvalue(i) <> #Null\n nextCellDir = i: Break ;exit for/next search\n EndIf\n EndIf\n Next\n\n If nextCellDir >= #firstDir\n visited(x + offset(#visited, nextCellDir)\\x, y + offset(#visited, nextCellDir)\\y) = #True\n\n AddElement(path())\n path()\\x = x: path()\\y = y\n\n x + offset(#maze, nextCellDir)\\x: y + offset(#maze, nextCellDir)\\y\n ElseIf ListSize(path()) > 0\n x = path()\\x: y = path()\\y\n DeleteElement(path())\n Else\n Break\n EndIf\n ForEver\n\nEndProcedure\n\n;demonstration\nIf OpenConsole()\n Define.POINT start, finish\n start\\x = Random(mazeWidth - 1): start\\y = Random(mazeHeight - 1)\n finish\\x = Random(mazeWidth - 1): finish\\y = Random(mazeHeight - 1)\n NewList Path.POINT()\n solveMaze(maze(), start, finish, path())\n If ListSize(path()) > 0\n PrintN(\"Solution found for path between (\" + Str(start\\x) + \", \" + Str(start\\y) + \") and (\" + Str(finish\\x) + \", \" + Str(finish\\y) + \")\")\n displayMazePath(maze(), path())\n Else\n PrintN(\"No solution found for path between (\" + Str(start\\x) + \", \" + Str(start\\y) + \") and (\" + Str(finish\\x) + \", \" + Str(finish\\y) + \")\")\n EndIf\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\"): Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"# python 3\n\ndef Dijkstra(Graph, source):\n '''\n + +---+---+\n | 0 1 2 |\n +---+ + +\n | 3 4 | 5\n +---+---+---+\n\n >>> graph = ( # or ones on the diagonal\n ... (0,1,0,0,0,0,),\n ... (1,0,1,0,1,0,),\n ... (0,1,0,0,0,1,),\n ... (0,0,0,0,1,0,),\n ... (0,1,0,1,0,0,),\n ... (0,0,1,0,0,0,),\n ... )\n ...\n >>> Dijkstra(graph, 0)\n ([0, 1, 2, 3, 2, 3], [1e+140, 0, 1, 4, 1, 2])\n >>> display_solution([1e+140, 0, 1, 4, 1, 2])\n 5<2<1<0\n '''\n # Graph[u][v] is the weight from u to v (however 0 means infinity)\n infinity = float('infinity')\n n = len(graph)\n dist = [infinity]*n # Unknown distance function from source to v\n previous = [infinity]*n # Previous node in optimal path from source\n dist[source] = 0 # Distance from source to source\n Q = list(range(n)) # All nodes in the graph are unoptimized - thus are in Q\n while Q: # The main loop\n u = min(Q, key=lambda n:dist[n]) # vertex in Q with smallest dist[]\n Q.remove(u)\n if dist[u] == infinity:\n break # all remaining vertices are inaccessible from source\n for v in range(n): # each neighbor v of u\n if Graph[u][v] and (v in Q): # where v has not yet been visited\n alt = dist[u] + Graph[u][v]\n if alt < dist[v]: # Relax (u,v,a)\n dist[v] = alt\n previous[v] = u\n return dist,previous\n\ndef display_solution(predecessor):\n cell = len(predecessor)-1\n while cell:\n print(cell,end='<')\n cell = predecessor[cell]\n print(0)\n","language":"Python"},{"code":";; Returns a path connecting two given cells in the maze\n;; find-path :: Maze Cell Cell -> (Listof Cell)\n(define (find-path m p1 p2)\n (match-define (maze N M tbl) m)\n (define (alternatives p prev) (remove prev (connections tbl p)))\n (define (dead-end? p prev) (empty? (alternatives p prev)))\n (define ((next-turn route) p)\n (define prev (car route))\n (cond\n [(equal? p p2) (cons p2 route)]\n [(dead-end? p prev) '()]\n [else (append-map (next-turn (cons p route))\n (alternatives p prev))]))\n (reverse\n (append-map (next-turn (list p1))\n (alternatives p1 (list p1)))))\n","language":"Racket"},{"code":";; Reads the maze from the textual form\n;; read-maze :: File-path -> Maze\n(define (read-maze file)\n (define tbl (make-hash))\n (with-input-from-file file\n (λ ()\n ; the first line gives us the width of the maze\n (define N (/ (- (string-length (read-line)) 1) 4))\n ; while reading other lines we get the height of the maze\n (define M\n (for/sum ([h (in-lines)] [v (in-lines)] [j (in-naturals)])\n (for ([i (in-range N)])\n (when (eq? #\\space (string-ref h (* 4 (+ 1 i))))\n (connect! tbl (list i j) (list (+ i 1) j)))\n (when (eq? #\\space (string-ref v (+ 1 (* 4 i))))\n (connect! tbl (list i j) (list i (+ j 1)))))\n 1))\n (maze N M tbl))))\n","language":"Racket"},{"code":";; Shows a maze with a path connecting two given cells\n(define (show-path m p1 p2)\n (match-define (maze N M tbl) m)\n (define route (find-path m p1 p2))\n (for ([i N]) (display \"+---\"))\n (displayln \"+\")\n (for ([j M])\n (display \"|\")\n (for ([i (- N 0)])\n (if (member (list i j) route)\n (display \" *\")\n (display \" \"))\n (if (connected? tbl (list i j) (list (+ 1 i) j))\n (display \" \")\n (display \" |\")))\n (newline)\n (for ([i N])\n (if (connected? tbl (list i j) (list i (+ j 1)))\n (display \"+ \")\n (display \"+---\")))\n (displayln \"+\"))\n (newline))\n","language":"Racket"},{"code":"constant mapping = :OPEN(' '),\n\t\t :N< ╵ >,\n\t\t :E< ╶ >,\n\t\t :NE< └ >,\n\t\t :S< ╷ >,\n\t\t :NS< │ >,\n\t\t :ES< ┌ >,\n\t\t :NES< ├ >,\n\t\t :W< ╴ >,\n\t\t :NW< ┘ >,\n\t\t :EW< ─ >,\n\t\t :NEW< ┴ >,\n\t\t :SW< ┐ >,\n\t\t :NSW< ┤ >,\n\t\t :ESW< ┬ >,\n\t\t :NESW< ┼ >,\n\t\t :TODO< x >,\n\t :TRIED< · >;\n\nenum Sym (mapping.map: *.key);\nmy @ch = mapping.map: *.value;\n\nenum Direction <DeadEnd Up Right Down Left>;\n\nsub gen_maze ( $X,\n $Y,\n $start_x = (^$X).pick * 2 + 1,\n $start_y = (^$Y).pick * 2 + 1 )\n{\n my @maze;\n push @maze, $[ flat ES, -N, (ESW, EW) xx $X - 1, SW ];\n push @maze, $[ flat (NS, TODO) xx $X, NS ];\n for 1 ..^ $Y {\n\tpush @maze, $[ flat NES, EW, (NESW, EW) xx $X - 1, NSW ];\n\tpush @maze, $[ flat (NS, TODO) xx $X, NS ];\n }\n push @maze, $[ flat NE, (EW, NEW) xx $X - 1, -NS, NW ];\n @maze[$start_y][$start_x] = OPEN;\n\n my @stack;\n my $current = [$start_x, $start_y];\n loop {\n if my $dir = pick_direction( $current ) {\n @stack.push: $current;\n $current = move( $dir, $current );\n }\n else {\n last unless @stack;\n $current = @stack.pop;\n }\n }\n return @maze;\n\n sub pick_direction([$x,$y]) {\n\tmy @neighbors =\n\t (Up if @maze[$y - 2][$x]),\n\t (Down if @maze[$y + 2][$x]),\n\t (Left if @maze[$y][$x - 2]),\n\t (Right if @maze[$y][$x + 2]);\n\t@neighbors.pick or DeadEnd;\n }\n\n sub move ($dir, @cur) {\n\tmy ($x,$y) = @cur;\n\tgiven $dir {\n\t when Up { @maze[--$y][$x] = OPEN; @maze[$y][$x-1] -= E; @maze[$y--][$x+1] -= W; }\n\t when Down { @maze[++$y][$x] = OPEN; @maze[$y][$x-1] -= E; @maze[$y++][$x+1] -= W; }\n\t when Left { @maze[$y][--$x] = OPEN; @maze[$y-1][$x] -= S; @maze[$y+1][$x--] -= N; }\n\t when Right { @maze[$y][++$x] = OPEN; @maze[$y-1][$x] -= S; @maze[$y+1][$x++] -= N; }\n\t}\n\t@maze[$y][$x] = 0;\n\t[$x,$y];\n }\n}\n\nsub display (@maze) {\n for @maze -> @y {\n\tfor @y.rotor(2) -> ($w, $c) {\n\t print @ch[abs $w];\n\t if $c >= 0 { print @ch[$c] x 3 }\n\t else { print ' ', @ch[abs $c], ' ' }\n\t}\n\tsay @ch[@y[*-1]];\n }\n}\n\nsub solve (@maze is copy, @from = [1, 1], @to = [@maze[0] - 2, @maze - 2]) {\n my ($x, $y) = @from;\n my ($xto, $yto) = @to;\n my @stack;\n\n sub drop-crumb($x,$y,$c) { @maze[$y][$x] = -$c }\n drop-crumb($x,$y,N);\n\n loop {\n\tmy $dir = pick_direction([$x,$y]);\n\tif $dir {\n\t ($x, $y) = move($dir, [$x,$y]);\n\t return @maze if $x == $xto and $y == $yto;\n\t}\n\telse {\n\t @maze[$y][$x] = -TRIED;\n\t ($x,$y) = @stack.pop;\n\t @maze[$y][$x] = -TRIED;\n\t ($x,$y) = @stack.pop;\n\t}\n }\n\n sub pick_direction([$x,$y]) {\n\tmy @neighbors =\n\t (Up unless @maze[$y - 1][$x]),\n\t (Down unless @maze[$y + 1][$x]),\n\t (Left unless @maze[$y][$x - 1]),\n\t (Right unless @maze[$y][$x + 1]);\n\t@neighbors.pick or DeadEnd;\n }\n\n sub move ($dir, @cur) {\n\tmy ($x,$y) = @cur;\n\tgiven $dir {\n\t when Up { for ^2 { push @stack, $[$x,$y--]; drop-crumb $x,$y,S; } }\n\t when Down { for ^2 { push @stack, $[$x,$y++]; drop-crumb $x,$y,N; } }\n\t when Left { for ^2 { push @stack, $[$x--,$y]; drop-crumb $x,$y,E; } }\n\t when Right { for ^2 { push @stack, $[$x++,$y]; drop-crumb $x,$y,W; } }\n\t}\n\t$x,$y;\n }\n}\n\ndisplay solve gen_maze( 29, 19 );\n","language":"Raku"},{"code":"Red [\"Maze solver\"]\n\ndo %mazegen.red\t\nprint [\n\t\"start:\" start: random size - 1x1\n\t\"end:\" end: random size - 1x1\n]\nisnew?: function [pos] [not find visited pos]\nopen?: function [pos d] [\n\to: pos/y * size/x + pos/x + 1\n\t0 = pick walls/:o d\n]\nexpand: function [pos][\n\teither any [\n\t\tall [pos/x > 0 isnew? p: pos - 1x0 open? p 1]\n\t\tall [pos/x < (size/x - 1) isnew? p: pos + 1x0 open? pos 1]\n\t\tall [pos/y > 0 isnew? p: pos - 0x1 open? p 2]\n\t\tall [pos/y < (size/y - 1) isnew? p: pos + 0x1 open? pos 2]\n\t][append visited p insert path p][remove path]\n\tpath/1\n]\npath: reduce [start]\nvisited: []\nuntil [end = expand path/1]\nprint reverse path\n","language":"Red"},{"code":"class Maze\n # Solve via breadth-first algorithm.\n # Each queue entry is a path, that is list of coordinates with the\n # last coordinate being the one that shall be visited next.\n def solve\n\n # Clean up.\n reset_visiting_state\n\n # Enqueue start position.\n @queue = []\n enqueue_cell([], @start_x, @start_y)\n\n # Loop as long as there are cells to visit and no solution has\n # been found yet.\n path = nil\n until path || @queue.empty?\n path = solve_visit_cell\n end\n\n if path\n # Mark the cells that make up the shortest path.\n for x, y in path\n @path[x][y] = true\n end\n else\n puts \"No solution found?!\"\n end\n end\n\n private\n\n # Maze solving visiting method.\n def solve_visit_cell\n # Get the next path.\n path = @queue.shift\n # The cell to visit is the last entry in the path.\n x, y = path.last\n\n # Have we reached the end yet?\n return path if x == @end_x && y == @end_y\n\n # Mark cell as visited.\n @visited[x][y] = true\n\n for dx, dy in DIRECTIONS\n if dx.nonzero?\n # Left / Right\n new_x = x + dx\n if move_valid?(new_x, y) && !@vertical_walls[ [x, new_x].min ][y]\n enqueue_cell(path, new_x, y)\n end\n else\n # Top / Bottom\n new_y = y + dy\n if move_valid?(x, new_y) && !@horizontal_walls[x][ [y, new_y].min ]\n enqueue_cell(path, x, new_y)\n end\n end\n end\n\n nil # No solution yet.\n end\n\n # Enqueue a new coordinate to visit.\n def enqueue_cell(path, x, y)\n # Add new coordinates to the current path and enqueue the new path.\n @queue << path + [[x, y]]\n end\nend\n\n# Demonstration:\nmaze = Maze.new 20, 10\nmaze.solve\nmaze.print\n","language":"Ruby"},{"code":"use rand::{thread_rng, Rng, rngs::ThreadRng};\n\nconst WIDTH: usize = 16;\nconst HEIGHT: usize = 16;\n\n#[derive(Clone, Copy, PartialEq)]\nstruct Cell {\n col: usize,\n row: usize,\n}\n\nimpl Cell {\n fn from(col: usize, row: usize) -> Cell {\n Cell {col, row}\n }\n}\n\nstruct Maze {\n cells: [[bool; HEIGHT]; WIDTH], //cell visited/non visited\n walls_h: [[bool; WIDTH]; HEIGHT + 1], //horizontal walls existing/removed\n walls_v: [[bool; WIDTH + 1]; HEIGHT], //vertical walls existing/removed\n thread_rng: ThreadRng, //Random numbers generator\n}\n\nimpl Maze {\n\n ///Inits the maze, with all the cells unvisited and all the walls active\n fn new() -> Maze {\n Maze {\n cells: [[true; HEIGHT]; WIDTH],\n walls_h: [[true; WIDTH]; HEIGHT + 1],\n walls_v: [[true; WIDTH + 1]; HEIGHT],\n thread_rng: thread_rng(),\n }\n }\n\n ///Randomly chooses the starting cell\n fn first(&mut self) -> Cell {\n Cell::from(self.thread_rng.gen_range(0, WIDTH), self.thread_rng.gen_range(0, HEIGHT))\n }\n\n ///Opens the enter and exit doors\n fn open_doors(&mut self) {\n let from_top: bool = self.thread_rng.gen();\n let limit = if from_top { WIDTH } else { HEIGHT };\n let door = self.thread_rng.gen_range(0, limit);\n let exit = self.thread_rng.gen_range(0, limit);\n if from_top {\n self.walls_h[0][door] = false;\n self.walls_h[HEIGHT][exit] = false;\n } else {\n self.walls_v[door][0] = false;\n self.walls_v[exit][WIDTH] = false;\n }\n }\n\n ///Removes a wall between the two Cell arguments\n fn remove_wall(&mut self, cell1: &Cell, cell2: &Cell) {\n if cell1.row == cell2.row {\n self.walls_v[cell1.row][if cell1.col > cell2.col { cell1.col } else { cell2.col }] = false;\n } else {\n self.walls_h[if cell1.row > cell2.row { cell1.row } else { cell2.row }][cell1.col] = false;\n };\n }\n\n ///Returns a random non-visited neighbor of the Cell passed as argument\n fn neighbor(&mut self, cell: &Cell) -> Option<Cell> {\n self.cells[cell.col][cell.row] = false;\n let mut neighbors = Vec::new();\n if cell.col > 0 && self.cells[cell.col - 1][cell.row] { neighbors.push(Cell::from(cell.col - 1, cell.row)); }\n if cell.row > 0 && self.cells[cell.col][cell.row - 1] { neighbors.push(Cell::from(cell.col, cell.row - 1)); }\n if cell.col < WIDTH - 1 && self.cells[cell.col + 1][cell.row] { neighbors.push(Cell::from(cell.col + 1, cell.row)); }\n if cell.row < HEIGHT - 1 && self.cells[cell.col][cell.row + 1] { neighbors.push(Cell::from(cell.col, cell.row + 1)); }\n if neighbors.is_empty() {\n None\n } else {\n let next = neighbors.get(self.thread_rng.gen_range(0, neighbors.len())).unwrap();\n self.remove_wall(cell, next);\n Some(*next)\n }\n }\n\n ///Builds the maze (runs the Depth-first search algorithm)\n fn build(&mut self) {\n let mut cell_stack: Vec<Cell> = Vec::new();\n let mut next = self.first();\n loop {\n while let Some(cell) = self.neighbor(&next) {\n cell_stack.push(cell);\n next = cell;\n }\n match cell_stack.pop() {\n Some(cell) => next = cell,\n None => break,\n }\n }\n }\n\n ///MAZE SOLVING: Find the starting cell of the solution\n fn solution_first(&self) -> Option<Cell> {\n for (i, wall) in self.walls_h[0].iter().enumerate() {\n if !wall {\n return Some(Cell::from(i, 0));\n }\n }\n for (i, wall) in self.walls_v.iter().enumerate() {\n if !wall[0] {\n return Some(Cell::from(0, i));\n }\n }\n None\n }\n\n ///MAZE SOLVING: Find the last cell of the solution\n fn solution_last(&self) -> Option<Cell> {\n for (i, wall) in self.walls_h[HEIGHT].iter().enumerate() {\n if !wall {\n return Some(Cell::from(i, HEIGHT - 1));\n }\n }\n for (i, wall) in self.walls_v.iter().enumerate() {\n if !wall[WIDTH] {\n return Some(Cell::from(WIDTH - 1, i));\n }\n }\n None\n }\n\n ///MAZE SOLVING: Get the next candidate cell\n fn solution_next(&mut self, cell: &Cell) -> Option<Cell> {\n self.cells[cell.col][cell.row] = false;\n let mut neighbors = Vec::new();\n if cell.col > 0 && self.cells[cell.col - 1][cell.row] && !self.walls_v[cell.row][cell.col] { neighbors.push(Cell::from(cell.col - 1, cell.row)); }\n if cell.row > 0 && self.cells[cell.col][cell.row - 1] && !self.walls_h[cell.row][cell.col] { neighbors.push(Cell::from(cell.col, cell.row - 1)); }\n if cell.col < WIDTH - 1 && self.cells[cell.col + 1][cell.row] && !self.walls_v[cell.row][cell.col + 1] { neighbors.push(Cell::from(cell.col + 1, cell.row)); }\n if cell.row < HEIGHT - 1 && self.cells[cell.col][cell.row + 1] && !self.walls_h[cell.row + 1][cell.col] { neighbors.push(Cell::from(cell.col, cell.row + 1)); }\n if neighbors.is_empty() {\n None\n } else {\n let next = neighbors.get(self.thread_rng.gen_range(0, neighbors.len())).unwrap();\n Some(*next)\n }\n }\n\n ///MAZE SOLVING: solve the maze\n ///Uses self.cells to store the solution cells (true)\n fn solve(&mut self) {\n self.cells = [[true; HEIGHT]; WIDTH];\n let mut solution: Vec<Cell> = Vec::new();\n let mut next = self.solution_first().unwrap();\n solution.push(next);\n let last = self.solution_last().unwrap();\n 'main: loop {\n while let Some(cell) = self.solution_next(&next) {\n solution.push(cell);\n if cell == last {\n break 'main;\n }\n next = cell;\n }\n solution.pop().unwrap();\n next = *solution.last().unwrap();\n }\n self.cells = [[false; HEIGHT]; WIDTH];\n for cell in solution {\n self.cells[cell.col][cell.row] = true;\n }\n }\n\n ///MAZE SOLVING: Ask if cell is part of the solution (cells[col][row] == true)\n fn is_solution(&self, col: usize, row: usize) -> bool {\n self.cells[col][row]\n }\n\n ///Displays a wall\n ///MAZE SOLVING: Leave space for printing '*' if cell is part of the solution\n /// (only when painting vertical walls)\n ///\n // fn paint_wall(h_wall: bool, active: bool) {\n // if h_wall {\n // print!(\"{}\", if active { \"+---\" } else { \"+ \" });\n // } else {\n // print!(\"{}\", if active { \"| \" } else { \" \" });\n // }\n // }\n fn paint_wall(h_wall: bool, active: bool, with_solution: bool) {\n if h_wall {\n print!(\"{}\", if active { \"+---\" } else { \"+ \" });\n } else {\n print!(\"{}{}\", if active { \"|\" } else { \" \" }, if with_solution { \"\" } else { \" \" });\n }\n }\n\n ///MAZE SOLVING: Paint * if cell is part of the solution\n fn paint_solution(is_part: bool) {\n print!(\"{}\", if is_part { \" * \" } else {\" \"});\n }\n\n ///Displays a final wall for a row\n fn paint_close_wall(h_wall: bool) {\n if h_wall { println!(\"+\") } else { println!() }\n }\n\n ///Displays a whole row of walls\n ///MAZE SOLVING: Displays a whole row of walls and, optionally, the included solution cells.\n // fn paint_row(&self, h_walls: bool, index: usize) {\n // let iter = if h_walls { self.walls_h[index].iter() } else { self.walls_v[index].iter() };\n // for &wall in iter {\n // Maze::paint_wall(h_walls, wall);\n // }\n // Maze::paint_close_wall(h_walls);\n // }\n fn paint_row(&self, h_walls: bool, index: usize, with_solution: bool) {\n let iter = if h_walls { self.walls_h[index].iter() } else { self.walls_v[index].iter() };\n for (col, &wall) in iter.enumerate() {\n Maze::paint_wall(h_walls, wall, with_solution);\n if !h_walls && with_solution && col < WIDTH {\n Maze::paint_solution(self.is_solution(col, index));\n }\n }\n Maze::paint_close_wall(h_walls);\n }\n\n ///Paints the maze\n ///MAZE SOLVING: Displaying the solution is an option\n // fn paint(&self) {\n // for i in 0 .. HEIGHT {\n // self.paint_row(true, i);\n // self.paint_row(false, i);\n // }\n // self.paint_row(true, HEIGHT);\n // }\n fn paint(&self, with_solution: bool) {\n for i in 0 .. HEIGHT {\n self.paint_row(true, i, with_solution);\n self.paint_row(false, i, with_solution);\n }\n self.paint_row(true, HEIGHT, with_solution);\n }\n}\n\nfn main() {\n let mut maze = Maze::new();\n maze.build();\n maze.open_doors();\n\n println!(\"The maze:\");\n maze.paint(false);\n\n maze.solve();\n println!(\"The maze, solved:\");\n maze.paint(true);\n}\n","language":"Rust"},{"code":"oo::define maze {\n method solve {} {\n\t### Initialization of visited matrix and location/path queue\n\tset visited [lrepeat $x [lrepeat $y 0]]\n\tset queue {0 0 {}}\n\n\t### Loop to do the searching ###\n\twhile 1 {\n\t # Check for running out of path; an error in maze construction\n\t if {[llength $queue] == 0} {\n\t\terror \"cannot reach finish\"\n\t }\n\t # Visit the next square from the queue\n\t set queue [lassign $queue cx cy path]\n\t if {[lindex $visited $cx $cy]} continue\n\t lset visited $cx $cy 1\n\t lappend path $cx $cy\n\t # Check for reaching the goal\n\t if {$cx == $x-1 && $cy == $y-1} break\n\t # Add the square in each direction to the queue if a move there is legal\n\t foreach {dx dy} {0 1 1 0 0 -1 -1 0} {\n\t\tset nx [expr {$cx + $dx}]; set ny [expr {$cy + $dy}]\n\t\tif {\n\t\t $nx >= 0 && $nx < $x && $ny >= 0 && $ny < $y\n\t\t && ($dx && idx($verti, min($cx,$nx), $cy) ||\n\t\t\t$dy && idx($horiz, $cx, min($cy,$ny)))\n\t\t} then {\n\t\t lappend queue $nx $ny $path\n\t\t}\n\t }\n\t}\n\n\t### Loop to set up the path rendering ###\n\t# (-2,-2) is just a marker that isn't next to the maze at all, so\n\t# guaranteeing the use of the last 'else' clause\n\tforeach {cx cy} $path {nx ny} [concat [lrange $path 2 end] -2 -2] {\n\t if {$nx-$cx == 1} {\n\t\tlset content $cx $cy \"v\"\n\t } elseif {$nx-$cx == -1} {\n\t\tlset content $cx $cy \"^\"\n\t } elseif {$ny-$cy == -1} {\n\t\tlset content $cx $cy \"<\"\n\t } else {\n\t\tlset content $cx $cy \">\"\n\t }\n\t}\n\n\t### Return the path ###\n\treturn $path\n }\n}\n\n# Do the solution (we ignore the returned path here...)\nm solve\n# Print it out\nputs [m view]\n","language":"Tcl"},{"code":"import \"os\" for Process\nimport \"./ioutil\" for File, FileUtil\n\n/*\n * Makes the maze half as wide (i. e. \"+---+\" becomes \"+-+\"), so that\n * each cell in the maze is the same size horizontally as vertically.\n * (Versus the expanded version, which looks better visually.)\n * Also, converts each line of the maze from a string to a\n * character list, because we'll want mutability when drawing the solution later.\n*/\nvar decimateHorizontally = Fn.new { |lines|\n var width = ((lines[0].count + 1)/2).floor\n var c = List.filled(lines.count, null)\n for (i in 0...lines.count) {\n c[i] = List.filled(width, null)\n for (j in 0...width) c[i][j] = lines[i][j*2]\n }\n return c\n}\n\n/*\n * Given the maze, the x and y coordinates (which must be odd),\n * and the direction we came from, return true if the maze is\n * solvable, and draw the solution if so.\n*/\nvar solveMazeRecursively // recursive function\nsolveMazeRecursively = Fn.new { |maze, x, y, d|\n var ok = false\n var i = 0\n while (i < 4 && !ok) {\n if (i != d) {\n // 0 = up, 1 = right, 2 = down, 3 = left\n if (i == 0) {\n if (maze[y - 1][x] == \" \") ok = solveMazeRecursively.call(maze, x, y - 2, 2)\n } else if (i == 1) {\n if (maze[y][x + 1] == \" \") ok = solveMazeRecursively.call(maze, x + 2, y, 3)\n } else if (i == 2) {\n if (maze[y + 1][x] == \" \") ok = solveMazeRecursively.call(maze, x, y + 2, 0)\n } else if (i == 3) {\n if (maze[y][x - 1] == \" \") ok = solveMazeRecursively.call(maze, x - 2, y, 1)\n }\n }\n i = i + 1\n }\n\n // check for end condition\n if (x == 1 && y == 1) ok = true\n\n // once we have found a solution, draw it as we unwind the recursion\n if (ok) {\n maze[y][x] = \"*\"\n if (d == 0) {\n maze[y - 1][x] = \"*\"\n } else if (d == 1) {\n maze[y][x + 1] = \"*\"\n } else if (d == 2) {\n maze[y + 1][x] = \"*\"\n } else if (d == 3) {\n maze[y][x - 1] = \"*\"\n }\n }\n return ok\n}\n\n/*\n * Solve the maze and draw the solution. For simplicity,\n * assumes the starting point is the lower right, and the\n * ending point is the upper left.\n*/\nvar solveMaze = Fn.new { |maze|\n solveMazeRecursively.call(maze, maze[0].count - 2, maze.count - 2, -1)\n}\n\n/*\n * Opposite of decimateHorizontally(). Adds extra characters to make\n * the maze \"look right\", and converts each line from a char list to a\n * string at the same time.\n*/\nvar expandHorizontally = Fn.new { |maze|\n var tmp = List.filled(3, \" \")\n var lines = List.filled(maze.count, null)\n for (i in 0...maze.count) {\n var sb = \"\"\n for (j in 0...maze[i].count) {\n if (j % 2 == 0) {\n sb = sb + maze[i][j]\n } else {\n for (k in 0..2) tmp[k] = maze[i][j]\n if (tmp[1] == \"*\") {\n tmp[0] = \" \"\n tmp[2] = \" \"\n }\n sb = sb + tmp.join()\n }\n }\n lines[i] = sb\n }\n return lines\n}\n\n/*\n * Accepts a maze as generated by:\n * http://rosettacode.org/wiki/Maze_generation#Wren\n * in a file whose name is specified as a command-line argument.\n*/\nvar args = Process.arguments\nif (args.count != 1) {\n System.print(\"The maze file to be read should be passed as a single command line argument.\")\n return\n}\nif (!File.exists(args[0])) {\n System.print(\"Sorry %(args[0]) does not exist.\")\n return\n}\nvar lines = FileUtil.readLines(args[0]).where { |l| l != \"\" }.toList\nvar maze = decimateHorizontally.call(lines)\nsolveMaze.call(maze)\nvar solvedLines = expandHorizontally.call(maze)\nSystem.print(solvedLines.join(\"\\n\"))\n","language":"Wren"},{"code":"ver,hor:=make_maze(); // see above link for this code\n\nfcn munge(a,b){ String(a[0,2],b,a[3,*]) } // \"+---\" --> \"+-*-\"\n\nfcn solveMaze(ver,hor, a,b, u,v, w,h){\n if (a==u and b==v) return(True);\n\n sh:=hor[b][a]; sv:=ver[b][a];\n hor[b][a]=munge(sh,\"*\"); ver[b][a]=munge(sv,\"*\"); // drop breadcrumb\n\n foreach dx,dy in (T( T(0,-1),T(1,0),T(0,1),T(-1,0) )){\n x:=a+dx; y:=b+dy; hy:=hor[y]; vy:=ver[y];\n if ( (0<=x<w) and (0<=y<h) and // (x,y) in bounds\n\t (dx==0 or (dx== 1 and vy[x]==\" \") or // horizontal\n\t\t (dx==-1 and vy[a][0]==\" \" and vy[x][2]!=\"*\")) and\n\t (dy==0 or (dy== 1 and hy[x]==\"+ \") or // vertical\n\t\t (dy==-1 and hor[b][a][1]==\" \" and hy[x][2]!=\"*\"))\n )\n {\n\t sh:=hy[x];\n\t if(solveMaze(ver,hor, x,y, u,v, w,h)){\n\t hy[x]=sh; // remove splat on wall but not floor while backing out\n\t return(True);\n\t }\n }\n }\n hor[b][a]=sh; ver[b][a]=sv; // pick up breadcrumb when backtracking\n return(False);\n}\n\nw:=(hor[0].len() - 1); h:=(hor.len() - 1);\nstartx:=(0).random(w); starty:=(0).random(h);\nendx :=(0).random(w); endy :=(0).random(h);\n\nsh:=hor[starty][startx];\nif (not solveMaze(ver,hor, startx,starty, endx,endy, w,h))\n println(\"No solution path found.\");\nelse{\n hor[starty][startx]=sh;\n ver[starty][startx]=munge(ver[starty][startx],\"S\");\n ver[endy][endx] =munge(ver[endy][endx],\"E\");\n foreach a,b in (hor.zip(ver)) { println(a.concat(),\"\\n\",b.concat()) }\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Recursion\\n- Puzzles\\nfrom: http://rosettacode.org/wiki/Maze_solving\\nnote: Games\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nFor a maze generated by [[Maze generation|this task]], write a function \\nthat finds (and displays) the shortest path between two cells. \\n\\n\\nNote that because these mazes are generated by the [[wp:Maze_generation_algorithm#Depth-first_search|Depth-first search]] algorithm, they contain no circular paths, \\nand a simple depth-first tree search can be used.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F dijkstra(graph, source)\\n V n = graph.len\\n V dist = [Float.infinity] * n\\n V previous = [-1] * n\\n dist[source] = 0\\n V Q = Array(0 .< n)\\n L !Q.empty\\n V u = min(Q, key' n -> @dist[n])\\n Q.remove(u)\\n I dist[u] == Float.infinity\\n L.break\\n L(v) 0 .< n\\n I graph[u][v] & (v C Q)\\n V alt = dist[u] + graph[u][v]\\n I alt < dist[v]\\n dist[v] = alt\\n previous[v] = u\\n R previous\\n\\nF display_solution(predecessor)\\n V cell = predecessor.len - 1\\n L cell != 0\\n print(cell, end' ‘<’)\\n cell = predecessor[cell]\\n print(0)\\n\\nV graph = [\\n [0,1,0,0,0,0],\\n [1,0,1,0,1,0],\\n [0,1,0,0,0,1],\\n [0,0,0,0,1,0],\\n [0,1,0,1,0,0],\\n [0,0,1,0,0,0]\\n]\\n\\ndisplay_solution(dijkstra(graph, 0))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"DEFINE TOP=\\\"0\\\"\\nDEFINE RIGHT=\\\"1\\\"\\nDEFINE BOTTOM=\\\"2\\\"\\nDEFINE LEFT=\\\"3\\\"\\nDEFINE WIDTH=\\\"160\\\"\\nDEFINE HEIGHT=\\\"96\\\"\\n\\nDEFINE STACK_SIZE=\\\"5000\\\"\\nBYTE ARRAY stack(STACK_SIZE)\\nINT stackSize\\n\\nPROC InitStack()\\n stackSize=0\\nRETURN\\n\\nBYTE FUNC IsEmpty()\\n IF stackSize=0 THEN\\n RETURN (1)\\n FI\\nRETURN (0)\\n\\nBYTE FUNC IsFull()\\n IF stackSize>=STACK_SIZE THEN\\n RETURN (1)\\n FI\\nRETURN (0)\\n\\nPROC Push(BYTE x,y)\\n IF IsFull() THEN Break() RETURN FI\\n stack(stackSize)=x stackSize==+1\\n stack(stackSize)=y stackSize==+1\\nRETURN\\n\\nPROC Pop(BYTE POINTER x,y)\\n IF IsEmpty() THEN Break() RETURN FI\\n stackSize==-1 y^=stack(stackSize)\\n stackSize==-1 x^=stack(stackSize)\\nRETURN\\n\\nPROC Push3(BYTE x,y,d)\\n IF IsFull() THEN Break() RETURN FI\\n stack(stackSize)=x stackSize==+1\\n stack(stackSize)=y stackSize==+1\\n stack(stackSize)=d stackSize==+1\\nRETURN\\n\\nPROC Pop3(BYTE POINTER x,y,d)\\n IF IsEmpty() THEN Break() RETURN FI\\n stackSize==-1 d^=stack(stackSize)\\n stackSize==-1 y^=stack(stackSize)\\n stackSize==-1 x^=stack(stackSize)\\nRETURN\\n\\nPROC FillScreen()\\n BYTE POINTER ptr ;pointer to the screen memory\\n INT screenSize=[3840]\\n\\n ptr=PeekC(88)\\n SetBlock(ptr,screenSize,$55)\\n\\n Color=0\\n Plot(0,HEIGHT-1) DrawTo(WIDTH-1,HEIGHT-1) DrawTo(WIDTH-1,0)\\nRETURN\\n\\nPROC GetNeighbors(BYTE x,y BYTE ARRAY n BYTE POINTER count)\\n DEFINE WALL=\\\"1\\\"\\n\\n count^=0\\n IF y>2 AND Locate(x,y-2)=WALL THEN\\n n(count^)=TOP count^==+1\\n FI\\n IF x<WIDTH-3 AND Locate(x+2,y)=WALL THEN\\n n(count^)=RIGHT count^==+1\\n FI\\n IF y<HEIGHT-3 AND Locate(x,y+2)=WALL THEN\\n n(count^)=BOTTOM count^==+1\\n FI\\n IF x>2 AND Locate(x-2,y)=WALL THEN\\n n(count^)=LEFT count^==+1\\n FI\\nRETURN\\n\\nPROC DrawConnection(BYTE POINTER x,y BYTE dir)\\n Plot(x^,y^)\\n IF dir=TOP THEN\\n y^==-2\\n ELSEIF dir=RIGHT THEN\\n x^==+2\\n ELSEIF dir=BOTTOM THEN\\n y^==+2\\n ELSE\\n x^==-2\\n FI\\n DrawTo(x^,y^)\\nRETURN\\n\\nPROC Maze(BYTE x,y)\\n BYTE ARRAY stack,neighbors\\n BYTE dir,nCount\\n\\n FillScreen()\\n\\n Color=2\\n InitStack()\\n Push(x,y)\\n WHILE IsEmpty()=0\\n DO\\n Pop(@x,@y)\\n GetNeighbors(x,y,neighbors,@nCount)\\n IF nCount>0 THEN\\n Push(x,y)\\n dir=neighbors(Rand(nCount))\\n DrawConnection(@x,@y,dir)\\n Push(x,y)\\n FI\\n OD\\nRETURN\\n\\nBYTE FUNC IsConnection(BYTE x,y,dir)\\n DEFINE WAY=\\\"2\\\"\\n IF dir=TOP AND y>2 AND Locate(x,y-1)=WAY THEN\\n RETURN (1)\\n ELSEIF dir=RIGHT AND x<WIDTH-3 AND Locate(x+1,y)=WAY THEN\\n RETURN (1)\\n ELSEIF dir=BOTTOM AND y<HEIGHT-3 AND Locate(x,y+1)=WAY THEN\\n RETURN (1)\\n ELSEIF dir=LEFT AND x>2 AND Locate(x-1,y)=WAY THEN\\n RETURN (1)\\n FI\\nRETURN (0)\\n\\nPROC Solve(BYTE x1,y1,x2,y2)\\n BYTE dir,x,y,lastX,lastY,back\\n\\n Color=3\\n Plot(x1,y1)\\n Plot(x2,y2)\\n\\n InitStack()\\n Push3(x1,y1,TOP)\\n WHILE IsEmpty()=0\\n DO\\n Pop3(@x,@y,@dir)\\n IF back THEN\\n Color=2\\n Plot(lastX,lastY)\\n DrawTo(x,y)\\n FI\\n IF IsConnection(x,y,dir) THEN\\n Color=3\\n Push3(x,y,dir+1)\\n DrawConnection(@x,@y,dir)\\n IF x=x2 AND y=y2 THEN\\n RETURN\\n FI\\n Push3(x,y,TOP)\\n back=0\\n ELSEIF dir<=LEFT THEN\\n Push3(x,y,dir+1)\\n back=0\\n ELSE\\n lastX=x\\n lastY=y\\n back=1\\n FI\\n OD\\nRETURN\\n\\nPROC Main()\\n BYTE CH=$02FC,COLOR0=$02C4,COLOR1=$02C5,COLOR2=$02C6\\n BYTE x,y,x2,y2\\n\\n Graphics(7+16)\\n COLOR0=$0A\\n COLOR1=$04\\n COLOR2=$A6\\n\\n x=Rand((WIDTH RSH 1)-1) LSH 1+1\\n y=Rand((HEIGHT RSH 1)-1) LSH 1+1\\n Maze(x,y)\\n\\n x=Rand((WIDTH RSH 1)-1) LSH 1+1\\n y=Rand((HEIGHT RSH 1)-1) LSH 1+1\\n x2=Rand((WIDTH RSH 1)-1) LSH 1+1\\n y2=Rand((HEIGHT RSH 1)-1) LSH 1+1\\n Solve(x,y,x2,y2)\\n\\n DO UNTIL CH#$FF OD\\n CH=$FF\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\n\\nprocedure Maze_Solver is\\n\\n X_Size: constant Natural := 45;\\n Y_Size: constant Natural := 17;\\n\\n subtype X_Range is Natural range 1 .. X_Size;\\n subtype Y_Range is Natural range 1 .. Y_Size;\\n\\n East: constant X_Range := 2;\\n South: constant Y_Range := 1;\\n\\n X_Start: constant X_Range := 3; -- start at the upper left\\n Y_Start: constant Y_Range := 1;\\n X_Finish: constant X_Range := X_Size-East; -- go to the lower right\\n Y_Finish: constant Y_Range := Y_Size;\\n\\n type Maze_Type is array (Y_Range) of String(X_Range);\\n\\n function Solved(X: X_Range; Y: Y_Range) return Boolean is\\n begin\\n return (X = X_Finish) and (Y = Y_Finish);\\n end Solved;\\n\\n procedure Output_Maze(M: Maze_Type; Message: String := \\\"\\\") is\\n begin\\n if Message /= \\\"\\\" then\\n Ada.Text_IO.Put_Line(Message);\\n end if;\\n for I in M'Range loop\\n Ada.Text_IO.Put_Line(M(I));\\n end loop;\\n end Output_Maze;\\n\\n procedure Search(M: in out Maze_Type; X: X_Range; Y:Y_Range) is\\n begin\\n M(Y)(X) := '*';\\n if Solved(X, Y) then\\n Output_Maze(M, \\\"Solution found!\\\");\\n else\\n if Integer(Y)-South >= 1 and then M(Y-South)(X) = ' ' then\\n Search(M, X, Y-South);\\n end if;\\n if Integer(Y)+South <= Y_Size and then M(Y+South)(X) = ' ' then\\n Search(M, X, Y+South);\\n end if;\\n if Integer(X)-East >= 1 and then M(Y)(X-East) = ' ' then\\n Search(M, X-East, Y);\\n end if;\\n if Integer(Y)+East <= Y_Size and then M(Y)(X+East) = ' ' then\\n Search(M, X+East, Y);\\n end if;\\n end if;\\n M(Y)(X) := ' ';\\n end Search;\\n\\n Maze: Maze_Type;\\n X: X_Range := X_Start;\\n Y: Y_Range := Y_Start;\\n\\nbegin\\n for I in 1 .. Y_Size loop\\n Maze(I) := Ada.Text_IO.Get_Line;\\n end loop;\\n Maze(Y_Start)(X_Start) := ' '; -- Start from\\n Maze(Y_Finish)(X_Finish) := ' '; -- Go_To\\n Output_Maze(Maze, \\\"The Maze:\\\");\\n Ada.Text_IO.New_Line;\\n\\n Search(Maze, X, Y) ; -- Will output *all* Solutions.\\n -- If there is no output, there is no solution.\\nend Maze_Solver;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"Width := 10, Height\\t:= 10\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; set grid size\\nSleepTime := 0\\n\\ngosub, Startup\\n\\nGui, +AlwaysOnTop\\nGui, font, s12, consolas\\nGui, add, edit, vEditGrid x10, % maze\\nGui, add, button, xs gStartup Default, Generate maze\\nGui, add, button, x+10 gSolve, Solve\\nGui, show,, maze\\nGuiControl,, EditGrid, % maze\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; show maze\\nreturn\\n\\n;-----------------------------------------------------------------------\\n^Esc::\\nGuiEscape:\\nGuiClose:\\nExitApp\\nreturn\\n\\n;-----------------------------------------------------------------------\\nStartup:\\noMaze := []\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; initialize\\nSolved := false\\nloop, % Height\\n{\\n\\trow := A_Index\\n\\tloop, % Width\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; create oMaze[row,column] borders\\n\\t\\tcol := A_Index, oMaze[row,col] := \\\"LRTB\\\"\\t\\t\\t\\t\\t\\t; i.e. oMaze[2,5] := LRTB (add all borders)\\n}\\nRandom, row, 1, % Height\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; random row\\nRandom, col, 1, % Width\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; random col\\ngrid := maze2text(oMaze)\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; object to text\\nGuiControl,, EditGrid, % Grid\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; show Grid\\nrow := col := 1\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; reset to 1,1\\noMaze := Generate_maze(row, col, oMaze)\\t\\t\\t\\t\\t\\t\\t\\t\\t; generate maze starting from random row/column\\noMaze[1,1] .= \\\"X\\\"\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; start from 1,1\\nmaze := maze2text(oMaze)\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; object to text\\nGuiControl,, EditGrid, % maze\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; show maze\\nGuiControl,, EditRoute\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; clear route\\nGuiControl, Enable, Solve\\nreturn\\n\\n;-----------------------------------------------------------------------\\nSolve:\\nGuiControl, Disable, Generate maze\\nGuiControl, Disable, Solve\\nloop % oRoute.MaxIndex()\\n\\toRoute.pop()\\n\\noSolution\\t:= Solve(1, 1, oMaze)\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; solve starting from 1,1\\noMaze \\t\\t:= oSolution.1\\noRoute \\t\\t:= oSolution.2\\nUpdate(oMaze, oRoute)\\nSolved := true\\nGuiControl, Enable, Generate maze\\nreturn\\n\\n;-----------------------------------------------------------------------\\nUpdate(oMaze, oRoute){\\n\\tglobal SleepTime\\n\\tGuiControl,, EditGrid, % maze2text(oMaze)\\n\\tSleep, % SleepTime\\n}\\n\\n;-----------------------------------------------------------------------\\nmaze2text(oMaze){\\n\\twidth := oMaze.1.MaxIndex()\\n\\tBLK := \\\"█\\\"\\n\\tfor row, objRow in oMaze\\n\\t{\\n\\t\\tfor col, val in objRow\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; add ceiling\\n\\t\\t{\\n\\t\\t\\tceiling := InStr(oMaze[row, col] , \\\"x\\\") && InStr(oMaze[row-1, col] , \\\"x\\\") ? \\\"+ \\\" BLK \\\" \\\" : \\\"+ \\\"\\n\\t\\t\\tgrid .= (InStr(val, \\\"T\\\") ? \\\"+---\\\" : ceiling) (col = Width ? \\\"+`n\\\" : \\\"\\\")\\n\\t\\t}\\n\\t\\tfor col, val in objRow\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; add left wall\\n\\t\\t{\\n\\t\\t\\twall := SubStr(val, 0) = \\\"X\\\" ? BLK : \\\" \\\"\\n\\t\\t\\tgrid .= (InStr(val, \\\"L\\\") ? \\\"| \\\" : \\\" \\\") wall \\\" \\\" (col = Width ? \\\"|`n\\\" : \\\"\\\") ; add left wall if needed then outer right border\\n\\t\\t}\\n\\t}\\n\\tLoop % Width\\n\\t\\tGrid .= \\\"+---\\\"\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; add bottom floor\\n\\tGrid .= \\\"+\\\"\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; add right bottom corner\\n\\treturn RegExReplace(grid , BLK \\\" (?=\\\" BLK \\\")\\\" , BLK BLK BLK BLK)\\t; fill gaps\\n}\\n\\n;-----------------------------------------------------------------------\\nGenerate_maze(row, col, oMaze) {\\n\\tneighbors := row+1 \\\",\\\" col \\\"`n\\\" row-1 \\\",\\\" col \\\"`n\\\" row \\\",\\\" col+1 \\\"`n\\\" row \\\",\\\" col-1\\n\\tSort, neighbors, random\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; randomize neighbors list\\n\\tLoop, parse, neighbors, `n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; for each neighbor\\n\\t{\\n\\t\\trowX := StrSplit(A_LoopField, \\\",\\\").1\\t\\t\\t\\t\\t\\t\\t; this neighbor row\\n\\t\\tcolX := StrSplit(A_LoopField, \\\",\\\").2\\t\\t\\t\\t\\t\\t\\t; this neighbor column\\n\\t\\tif !instr(oMaze[rowX,colX], \\\"LRTB\\\") || !oMaze[rowX, colX]\\t\\t; if visited (has a missing border) or out of bounds\\n\\t\\t\\tcontinue\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; skip\\n\\t\\t\\n\\t\\t; remove borders\\n\\t\\tif (row > rowX)\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; Cell is below this neighbor\\n\\t\\t\\toMaze[row,col] := StrReplace(oMaze[row,col], \\\"T\\\") , oMaze[rowX,colX] := StrReplace(oMaze[rowX,colX], \\\"B\\\")\\n\\t\\telse if (row < rowX)\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; Cell is above this neighbor\\n\\t\\t\\toMaze[row,col] := StrReplace(oMaze[row,col], \\\"B\\\") , oMaze[rowX,colX] := StrReplace(oMaze[rowX,colX], \\\"T\\\")\\n\\t\\telse if (col > colX)\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; Cell is right of this neighbor\\n\\t\\t\\toMaze[row,col] := StrReplace(oMaze[row,col], \\\"L\\\") , oMaze[rowX,colX] := StrReplace(oMaze[rowX,colX], \\\"R\\\")\\n\\t\\telse if (col < colX)\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; Cell is left of this neighbor\\n\\t\\t\\toMaze[row,col] := StrReplace(oMaze[row,col], \\\"R\\\") , oMaze[rowX,colX] := StrReplace(oMaze[rowX,colX], \\\"L\\\")\\n\\t\\t\\n\\t\\tGenerate_maze(rowX, colX, oMaze)\\t\\t\\t\\t\\t\\t\\t\\t; recurse for this neighbor\\n\\t}\\n\\treturn, oMaze\\n}\\n\\n;-----------------------------------------------------------------------\\nSolve(row, col, oMaze){\\n\\tstatic oRoute := []\\n\\toNeighbor := [], targetrow := oMaze.MaxIndex(), targetCol := oMaze.1.MaxIndex()\\n\\t\\n\\t;~ Update(oMaze, oRoute)\\n\\toRoute.push(row \\\":\\\" col)\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; push current cell address to oRoute\\n\\toMaze[row, col] .= \\\"X\\\"\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; mark it visited \\\"X\\\"\\n\\t\\t\\n\\tif (row = targetrow) && (Col = targetCol)\\t\\t\\t\\t\\t\\t\\t; if solved\\n\\t\\treturn true\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; return ture\\n\\n\\t; create list of Neighbors\\n\\toNeighbor[row, col] := []\\n\\tif !InStr(oMaze[row, col], \\\"R\\\")\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; if no Right border\\n\\t\\toNeighbor[row, col].push(row \\\",\\\" col+1)\\t\\t\\t\\t\\t\\t\\t; add neighbor\\n\\tif !InStr(oMaze[row, col], \\\"B\\\")\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; if no Bottom border\\n\\t\\toNeighbor[row, col].push(row+1 \\\",\\\" col)\\t\\t\\t\\t\\t\\t\\t; add neighbor\\n\\tif !InStr(oMaze[row, col], \\\"T\\\")\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; if no Top border\\n\\t\\toNeighbor[row, col].push(row-1 \\\",\\\" col)\\t\\t\\t\\t\\t\\t\\t; add neighbor\\n\\tif !InStr(oMaze[row, col], \\\"L\\\")\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; if no Left border\\n\\t\\toNeighbor[row, col].push(row \\\",\\\" col-1)\\t\\t\\t\\t\\t\\t\\t; add neighbor\\n\\t\\n\\t; recurese for each oNeighbor\\n\\tfor each, neighbor in oNeighbor[row, col]\\t\\t\\t\\t\\t\\t\\t; for each neighbor\\n\\t{\\n\\t\\tUpdate(oMaze, oRoute)\\n\\t\\tstartrow := StrSplit(neighbor, \\\",\\\").1\\t\\t\\t\\t\\t\\t\\t; this neighbor\\n\\t\\tstartCol := StrSplit(neighbor, \\\",\\\").2\\t\\t\\t\\t\\t\\t\\t; becomes starting point\\t\\t\\n\\t\\t\\n\\t\\tif !InStr(oMaze[startrow, startCol], \\\"X\\\")\\t\\t\\t\\t\\t\\t; if it was not visited\\n\\t\\t\\tif Solve(startrow, startCol, oMaze)\\t\\t\\t\\t\\t\\t\\t; recurse for current neighbor\\n\\t\\t\\t\\treturn [oMaze, oRoute]\\t\\t\\t\\t\\t\\t\\t\\t\\t; return solution if solved\\n\\t}\\n\\toRoute.pop()\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t; no solution found, back track\\n\\toMaze[row, Col] := StrReplace(oMaze[row, Col], \\\"X\\\")\\t\\t\\t\\t\\t; no solution found, back track\\n\\t;~ Update(oMaze, oRoute)\\n}\\n\\n;-----------------------------------------------------------------------\\n#IfWinActive, maze\\nRight::\\nLeft::\\nUp::\\nDown::\\nif Solved\\n\\treturn\\n\\nif (A_ThisHotkey=\\\"Right\\\") && (!InStr(oMaze[row,col], \\\"R\\\"))\\n\\toMaze[row, col] := StrReplace(oMaze[row, col], \\\"X\\\")\\t\\t, col++\\nif (A_ThisHotkey=\\\"Left\\\") && (!InStr(oMaze[row,col], \\\"L\\\"))\\n\\toMaze[row, col] := StrReplace(oMaze[row, col], \\\"X\\\")\\t\\t, col--\\nif (A_ThisHotkey=\\\"Up\\\") && (!InStr(oMaze[row,col], \\\"T\\\"))\\n\\toMaze[row, col] := StrReplace(oMaze[row, col], \\\"X\\\")\\t\\t, row--\\nif (A_ThisHotkey=\\\"Down\\\") && (!InStr(oMaze[row,col], \\\"B\\\"))\\n\\toMaze[row, col] := StrReplace(oMaze[row, col], \\\"X\\\")\\t\\t, row++\\n\\noMaze[row, col] .= \\\"X\\\"\\nGuiControl,, EditGrid, % maze2text(oMaze)\\n\\nif (col = Width) && (row = Height)\\n{\\n\\tSolved := true\\n\\toMaze[height, width] := StrReplace(oMaze[height, width], \\\"X\\\")\\n\\tSleepTime := 0\\n\\tgosub, solve\\n\\treturn\\n}\\nreturn\\n#IfWinActive\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \" MazeWidth% = 11\\n MazeHeight% = 9\\n MazeCell% = 50\\n\\n VDU 23,22,MazeWidth%*MazeCell%/2+3;MazeHeight%*MazeCell%/2+3;8,16,16,128\\n VDU 23,23,3;0;0;0; : REM Line thickness\\n OFF\\n PROCgeneratemaze(Maze&(), MazeWidth%, MazeHeight%, MazeCell%)\\n PROCsolvemaze(Path{()}, Maze&(), 0, MazeHeight%-1, MazeWidth%-1, 0, MazeCell%)\\n END\\n\\n DEF PROCsolvemaze(RETURN s{()}, m&(), x%, y%, dstx%, dsty%, s%)\\n LOCAL h%, i%, n%, p%, q%, w%\\n w% = DIM(m&(),1)\\n h% = DIM(m&(),2)\\n DIM s{(w%*h%) x%,y%}\\n GCOL 3,14\\n m&(x%,y%) OR= &80\\n REPEAT\\n FOR i% = 0 TO 3\\n CASE i% OF\\n WHEN 0: p% = x%-1 : q% = y%\\n WHEN 1: p% = x%+1 : q% = y%\\n WHEN 2: p% = x% : q% = y%-1\\n WHEN 3: p% = x% : q% = y%+1\\n ENDCASE\\n IF p% >= 0 IF p% < w% IF q% >= 0 IF q% < h% IF m&(p%,q%) < &80 THEN\\n IF p% > x% IF m&(p%,q%) AND 1 EXIT FOR\\n IF q% > y% IF m&(p%,q%) AND 2 EXIT FOR\\n IF x% > p% IF m&(x%,y%) AND 1 EXIT FOR\\n IF y% > q% IF m&(x%,y%) AND 2 EXIT FOR\\n ENDIF\\n NEXT\\n IF i% < 4 THEN\\n m&(p%,q%) OR= &80\\n s{(n%)}.x% = x%\\n s{(n%)}.y% = y%\\n n% += 1\\n ELSE\\n IF n% > 0 THEN\\n n% -= 1\\n p% = s{(n%)}.x%\\n q% = s{(n%)}.y%\\n ENDIF\\n ENDIF\\n LINE (x%+0.5)*s%,(y%+0.5)*s%,(p%+0.5)*s%,(q%+0.5)*s%\\n x% = p%\\n y% = q%\\n UNTIL x%=dstx% AND y%=dsty%\\n s{(n%)}.x% = x%\\n s{(n%)}.y% = y%\\n ENDPROC\\n\\n DEF PROCgeneratemaze(RETURN m&(), w%, h%, s%)\\n LOCAL x%, y%\\n DIM m&(w%, h%)\\n FOR y% = 0 TO h%\\n LINE 0,y%*s%,w%*s%,y%*s%\\n NEXT\\n FOR x% = 0 TO w%\\n LINE x%*s%,0,x%*s%,h%*s%\\n NEXT\\n GCOL 15\\n PROCcell(m&(), RND(w%)-1, y% = RND(h%)-1, w%, h%, s%)\\n ENDPROC\\n\\n DEF PROCcell(m&(), x%, y%, w%, h%, s%)\\n LOCAL i%, p%, q%, r%\\n m&(x%,y%) OR= &40 : REM Mark visited\\n r% = RND(4)\\n FOR i% = r% TO r%+3\\n CASE i% MOD 4 OF\\n WHEN 0: p% = x%-1 : q% = y%\\n WHEN 1: p% = x%+1 : q% = y%\\n WHEN 2: p% = x% : q% = y%-1\\n WHEN 3: p% = x% : q% = y%+1\\n ENDCASE\\n IF p% >= 0 IF p% < w% IF q% >= 0 IF q% < h% IF m&(p%,q%) < &40 THEN\\n IF p% > x% m&(p%,q%) OR= 1 : LINE p%*s%,y%*s%+4,p%*s%,(y%+1)*s%-4\\n IF q% > y% m&(p%,q%) OR= 2 : LINE x%*s%+4,q%*s%,(x%+1)*s%-4,q%*s%\\n IF x% > p% m&(x%,y%) OR= 1 : LINE x%*s%,y%*s%+4,x%*s%,(y%+1)*s%-4\\n IF y% > q% m&(x%,y%) OR= 2 : LINE x%*s%+4,y%*s%,(x%+1)*s%-4,y%*s%\\n PROCcell(m&(), p%, q%, w%, h%, s%)\\n ENDIF\\n NEXT\\n ENDPROC\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <windows.h>\\n#include <iostream>\\n#include <string>\\n\\n//--------------------------------------------------------------------------------------------------\\nusing namespace std;\\n\\n//--------------------------------------------------------------------------------------------------\\nconst int BMP_SIZE = 512, CELL_SIZE = 8;\\n\\n//--------------------------------------------------------------------------------------------------\\nenum directions { NONE, NOR = 1, EAS = 2, SOU = 4, WES = 8 };\\n\\n//--------------------------------------------------------------------------------------------------\\nclass myBitmap\\n{\\npublic:\\n myBitmap() : pen( NULL ) {}\\n ~myBitmap()\\n {\\n\\tDeleteObject( pen );\\n\\tDeleteDC( hdc );\\n\\tDeleteObject( bmp );\\n }\\n\\n bool create( int w, int h )\\n {\\n\\tBITMAPINFO\\tbi;\\n\\tZeroMemory( &bi, sizeof( bi ) );\\n\\tbi.bmiHeader.biSize\\t = sizeof( bi.bmiHeader );\\n\\tbi.bmiHeader.biBitCount\\t = sizeof( DWORD ) * 8;\\n\\tbi.bmiHeader.biCompression = BI_RGB;\\n\\tbi.bmiHeader.biPlanes\\t = 1;\\n\\tbi.bmiHeader.biWidth\\t = w;\\n\\tbi.bmiHeader.biHeight\\t = -h;\\n\\n\\tHDC dc = GetDC( GetConsoleWindow() );\\n\\tbmp = CreateDIBSection( dc, &bi, DIB_RGB_COLORS, &pBits, NULL, 0 );\\n\\tif( !bmp ) return false;\\n\\n\\thdc = CreateCompatibleDC( dc );\\n\\tSelectObject( hdc, bmp );\\n\\tReleaseDC( GetConsoleWindow(), dc );\\n\\twidth = w; height = h;\\n\\n\\treturn true;\\n }\\n\\n void clear()\\n {\\n\\tZeroMemory( pBits, width * height * sizeof( DWORD ) );\\n }\\n\\n void setPenColor( DWORD clr )\\n {\\n\\tif( pen ) DeleteObject( pen );\\n\\tpen = CreatePen( PS_SOLID, 1, clr );\\n\\tSelectObject( hdc, pen );\\n }\\n\\n void saveBitmap( string path )\\n {\\n\\tBITMAPFILEHEADER fileheader;\\n\\tBITMAPINFO\\t infoheader;\\n\\tBITMAP\\t\\t bitmap;\\n\\tDWORD\\t\\t wb;\\n\\n\\tGetObject( bmp, sizeof( bitmap ), &bitmap );\\n\\n\\tDWORD* dwpBits = new DWORD[bitmap.bmWidth * bitmap.bmHeight];\\n\\tZeroMemory( dwpBits, bitmap.bmWidth * bitmap.bmHeight * sizeof( DWORD ) );\\n\\tZeroMemory( &infoheader, sizeof( BITMAPINFO ) );\\n\\tZeroMemory( &fileheader, sizeof( BITMAPFILEHEADER ) );\\n\\n\\tinfoheader.bmiHeader.biBitCount = sizeof( DWORD ) * 8;\\n\\tinfoheader.bmiHeader.biCompression = BI_RGB;\\n\\tinfoheader.bmiHeader.biPlanes = 1;\\n\\tinfoheader.bmiHeader.biSize = sizeof( infoheader.bmiHeader );\\n\\tinfoheader.bmiHeader.biHeight = bitmap.bmHeight;\\n\\tinfoheader.bmiHeader.biWidth = bitmap.bmWidth;\\n\\tinfoheader.bmiHeader.biSizeImage = bitmap.bmWidth * bitmap.bmHeight * sizeof( DWORD );\\n\\n\\tfileheader.bfType = 0x4D42;\\n\\tfileheader.bfOffBits = sizeof( infoheader.bmiHeader ) + sizeof( BITMAPFILEHEADER );\\n\\tfileheader.bfSize = fileheader.bfOffBits + infoheader.bmiHeader.biSizeImage;\\n\\n\\tGetDIBits( hdc, bmp, 0, height, ( LPVOID )dwpBits, &infoheader, DIB_RGB_COLORS );\\n\\n\\tHANDLE file = CreateFile( path.c_str(), GENERIC_WRITE, 0, NULL, CREATE_ALWAYS, FILE_ATTRIBUTE_NORMAL, NULL );\\n\\tWriteFile( file, &fileheader, sizeof( BITMAPFILEHEADER ), &wb, NULL );\\n\\tWriteFile( file, &infoheader.bmiHeader, sizeof( infoheader.bmiHeader ), &wb, NULL );\\n\\tWriteFile( file, dwpBits, bitmap.bmWidth * bitmap.bmHeight * 4, &wb, NULL );\\n\\tCloseHandle( file );\\n\\n\\tdelete [] dwpBits;\\n }\\n\\n HDC getDC() const { return hdc; }\\n int getWidth() const { return width; }\\n int getHeight() const { return height; }\\n\\nprivate:\\n HBITMAP bmp;\\n HDC\\t hdc;\\n HPEN pen;\\n void *pBits;\\n int\\t width, height;\\n};\\n//--------------------------------------------------------------------------------------------------\\nclass mazeGenerator\\n{\\npublic:\\n mazeGenerator()\\n {\\n\\t_world = 0;\\n\\t_bmp.create( BMP_SIZE, BMP_SIZE );\\n\\t_bmp.setPenColor( RGB( 0, 255, 0 ) );\\n }\\n\\n ~mazeGenerator() { killArray(); }\\n\\n BYTE* getMaze() const { return _world; }\\n\\n void create( int side )\\n {\\n\\t_s = side;\\n\\tgenerate();\\n }\\n\\nprivate:\\n void generate()\\n {\\n\\tkillArray();\\n\\t_world = new BYTE[_s * _s];\\n\\tZeroMemory( _world, _s * _s );\\n\\t_ptX = rand() % _s; _ptY = rand() % _s;\\n\\tcarve();\\n }\\n\\n void carve()\\n {\\n\\twhile( true )\\n\\t{\\n\\t int d = getDirection();\\n\\t if( d < NOR ) return;\\n\\n\\t switch( d )\\n\\t {\\n\\t\\tcase NOR:\\n\\t\\t _world[_ptX + _s * _ptY] |= NOR; _ptY--;\\n\\t\\t _world[_ptX + _s * _ptY] = SOU | SOU << 4;\\n\\t\\tbreak;\\n\\t\\tcase EAS:\\n\\t\\t _world[_ptX + _s * _ptY] |= EAS; _ptX++;\\n\\t\\t _world[_ptX + _s * _ptY] = WES | WES << 4;\\n\\t\\tbreak;\\n\\t\\tcase SOU:\\n\\t\\t _world[_ptX + _s * _ptY] |= SOU; _ptY++;\\n\\t\\t _world[_ptX + _s * _ptY] = NOR | NOR << 4;\\n\\t\\tbreak;\\n\\t\\tcase WES:\\n\\t\\t _world[_ptX + _s * _ptY] |= WES; _ptX--;\\n\\t\\t _world[_ptX + _s * _ptY] = EAS | EAS << 4;\\n\\t }\\n\\t}\\n }\\n\\n int getDirection()\\n {\\n\\tint d = 1 << rand() % 4;\\n\\twhile( true )\\n\\t{\\n\\t for( int x = 0; x < 4; x++ )\\n\\t {\\n\\t\\tif( testDir( d ) ) return d;\\n\\t\\td <<= 1;\\n\\t\\tif( d > 8 ) d = 1;\\n\\t }\\n\\t d = ( _world[_ptX + _s * _ptY] & 0xf0 ) >> 4;\\n\\t if( !d ) return -1;\\n\\t switch( d )\\n\\t {\\n\\t\\tcase NOR: _ptY--; break;\\n\\t\\tcase EAS: _ptX++; break;\\n\\t\\tcase SOU: _ptY++; break;\\n\\t\\tcase WES: _ptX--; break;\\n\\t }\\n\\n\\t d = 1 << rand() % 4;\\n }\\n }\\n\\n bool testDir( int d )\\n {\\n\\tswitch( d )\\n\\t{\\n\\t case NOR: return ( _ptY - 1 > -1 && !_world[_ptX + _s * ( _ptY - 1 )] );\\n\\t case EAS: return ( _ptX + 1 < _s && !_world[_ptX + 1 + _s * _ptY] );\\n\\t case SOU: return ( _ptY + 1 < _s && !_world[_ptX + _s * ( _ptY + 1 )] );\\n\\t case WES: return ( _ptX - 1 > -1 && !_world[_ptX - 1 + _s * _ptY] );\\n\\t}\\n\\treturn false;\\n }\\n\\n void killArray() { if( _world ) delete [] _world; }\\n\\n BYTE* _world;\\n int _s, _ptX, _ptY;\\n myBitmap _bmp;\\n};\\n//--------------------------------------------------------------------------------------------------\\nclass mazeSolver\\n{\\npublic:\\n mazeSolver()\\n {\\n\\t_bmp.create( BMP_SIZE, BMP_SIZE );\\n\\t_pts = 0;\\n }\\n\\n ~mazeSolver() { killPoints(); }\\n\\n void solveIt( BYTE* maze, int size, int sX, int sY, int eX, int eY )\\n {\\n\\t_lastDir = NONE;\\n\\t_world = maze; _s = size; _sx = sX; _sy = sY; _ex = eX; _ey = eY;\\n\\t\\t\\n\\tfor( int y = 0; y < _s; y++ )\\n\\t for( int x = 0; x < _s; x++ )\\n\\t\\t_world[x + _s * y] &= 0x0f;\\n\\n _world[_sx + _s * _sy] |= NOR << 4;\\n\\n\\tkillPoints();\\n\\t_pts = new BYTE[_s * _s];\\n\\tZeroMemory( _pts, _s * _s );\\n\\t\\t\\n\\tfindTheWay();\\n\\n\\t_sx = sX; _sy = sY;\\n\\tdisplay();\\n }\\n\\nprivate:\\n int invert( int d )\\n {\\n\\tswitch( d )\\n\\t{\\n\\t case NOR: return SOU;\\n\\t case SOU: return NOR;\\n\\t case WES: return EAS;\\n\\t case EAS: return WES;\\n\\t}\\n\\treturn NONE;\\n }\\n\\n void updatePosition( int d )\\n {\\n switch( d )\\n\\t{\\n\\t case NOR: _sy--; break;\\n\\t case EAS: _sx++; break;\\n\\t case SOU: _sy++; break;\\n\\t case WES: _sx--;\\n\\t}\\n }\\n\\n void findTheWay()\\n {\\n\\twhile( true )\\n\\t{\\n\\t int d = getDirection();\\n\\t if( d < NOR ) return;\\n\\t _lastDir = invert( d );\\n\\t _world[_sx + _s * _sy] |= d;\\n\\t _pts[_sx + _s * _sy] = d;\\n\\t updatePosition( d );\\n\\t if( _sx == _ex && _sy == _ey ) return;\\n\\t _world[_sx + _s * _sy] |= _lastDir << 4;\\n\\t}\\n }\\n\\n int getDirection()\\n {\\n\\tint d = 1 << rand() % 4;\\n\\twhile( true )\\n\\t{\\n\\t for( int x = 0; x < 4; x++ )\\n\\t {\\n\\t\\tif( testDirection( d ) ) return d;\\n\\t\\td <<= 1;\\n\\t\\tif( d > 8 ) d = 1;\\n\\t }\\n\\n\\t d = ( _world[_sx + _s * _sy] & 0xf0 ) >> 4;\\n\\t if( !d ) return -1;\\n\\t _pts[_sx + _s * _sy] = 0;\\n\\t updatePosition( d );\\n\\t _lastDir = invert( d );\\n\\t d = 1 << rand() % 4;\\n\\t}\\n }\\n\\n bool testDirection( int d )\\n {\\n\\tif( d == _lastDir || !( _world[_sx + _s * _sy] & d ) ) return false;\\n\\tswitch( d )\\n\\t{\\n\\t case NOR:\\n\\t\\treturn _sy - 1 > -1 && !( _world[_sx + _s * ( _sy - 1 )] & 0xf0 );\\n\\t case EAS:\\n\\t\\treturn _sx + 1 < _s && !( _world[_sx + 1 + _s * _sy] & 0xf0 );\\n\\t case SOU:\\n\\t\\treturn _sy + 1 < _s && !( _world[_sx + _s * ( _sy + 1 )] & 0xf0 );\\n\\t case WES:\\n\\t\\treturn _sx - 1 > -1 && !( _world[_sx - 1 + _s * _sy] & 0xf0 );\\n\\t}\\n\\treturn false;\\n }\\n\\n void display()\\n {\\n\\t_bmp.setPenColor( RGB( 0, 255, 0 ) );\\n\\t_bmp.clear();\\n\\tHDC dc = _bmp.getDC();\\n\\tfor( int y = 0; y < _s; y++ )\\n\\t{\\n\\t int yy = y * _s;\\n\\t for( int x = 0; x < _s; x++ )\\n\\t {\\n\\t\\tBYTE b = _world[x + yy];\\n\\t\\tint nx = x * CELL_SIZE,\\n\\t\\t ny = y * CELL_SIZE;\\n\\n\\t\\tif( !( b & NOR ) )\\n\\t\\t{\\n\\t\\t MoveToEx( dc, nx, ny, NULL );\\n\\t\\t LineTo( dc, nx + CELL_SIZE + 1, ny );\\n\\t\\t}\\n\\t\\tif( !( b & EAS ) )\\n\\t\\t{\\n\\t\\t MoveToEx( dc, nx + CELL_SIZE, ny, NULL );\\n\\t\\t LineTo( dc, nx + CELL_SIZE, ny + CELL_SIZE + 1 );\\n\\t\\t}\\n\\t\\tif( !( b & SOU ) )\\n\\t\\t{\\n\\t\\t MoveToEx( dc, nx, ny + CELL_SIZE, NULL );\\n\\t\\t LineTo( dc, nx + CELL_SIZE + 1, ny + CELL_SIZE );\\n\\t\\t}\\n\\t\\tif( !( b & WES ) )\\n\\t\\t{\\n\\t\\t MoveToEx( dc, nx, ny, NULL );\\n\\t\\t LineTo( dc, nx, ny + CELL_SIZE + 1 );\\n\\t\\t}\\n\\t }\\n\\t}\\n\\n\\tdrawEndPoints( dc );\\n\\t_bmp.setPenColor( RGB( 255, 0, 0 ) );\\n\\n\\tfor( int y = 0; y < _s; y++ )\\n\\t{\\n\\t int yy = y * _s;\\n\\t for( int x = 0; x < _s; x++ )\\n\\t {\\n\\t\\tBYTE d = _pts[x + yy];\\n\\t\\tif( !d ) continue;\\n\\n\\t\\tint nx = x * CELL_SIZE + 4,\\n\\t\\t ny = y * CELL_SIZE + 4;\\n\\n\\t\\tMoveToEx( dc, nx, ny, NULL );\\n\\t\\tswitch( d )\\n\\t\\t{\\n\\t\\t case NOR: LineTo( dc, nx, ny - CELL_SIZE - 1 ); break;\\n\\t\\t case EAS: LineTo( dc, nx + CELL_SIZE + 1, ny ); break;\\n\\t\\t case SOU: LineTo( dc, nx, ny + CELL_SIZE + 1 ); break;\\n\\t\\t case WES: LineTo( dc, nx - CELL_SIZE - 1, ny ); break;\\n\\t\\t}\\n\\t }\\n\\t}\\n\\n\\t_bmp.saveBitmap( \\\"f:\\\\\\\\rc\\\\\\\\maze_s.bmp\\\" );\\n\\tBitBlt( GetDC( GetConsoleWindow() ), 10, 60, BMP_SIZE, BMP_SIZE, _bmp.getDC(), 0, 0, SRCCOPY );\\n }\\n\\n void drawEndPoints( HDC dc )\\n {\\n\\tRECT rc;\\n\\tint x = 1 + _sx * CELL_SIZE, y = 1 + _sy * CELL_SIZE;\\n\\tSetRect( &rc, x, y, x + CELL_SIZE - 1, y + CELL_SIZE - 1 );\\n\\tFillRect( dc, &rc, ( HBRUSH )GetStockObject( WHITE_BRUSH ) );\\n\\tx = 1 + _ex * CELL_SIZE, y = 1 + _ey * CELL_SIZE;\\n\\tSetRect( &rc, x, y, x + CELL_SIZE - 1, y + CELL_SIZE - 1 );\\n\\tFillRect( dc, &rc, ( HBRUSH )GetStockObject( WHITE_BRUSH ) );\\n }\\n\\n void killPoints() { if( _pts ) delete [] _pts; }\\n\\n BYTE* _world, *_pts;\\n int _s, _sx, _sy, _ex, _ey, _lastDir;\\n myBitmap _bmp;\\n};\\n//--------------------------------------------------------------------------------------------------\\nint main( int argc, char* argv[] )\\n{\\n ShowWindow( GetConsoleWindow(), SW_MAXIMIZE );\\n srand( GetTickCount() );\\n\\n mazeGenerator mg;\\n mazeSolver ms;\\n int s;\\n while( true )\\n {\\n\\tcout << \\\"Enter the maze size, an odd number bigger than 2 ( 0 to QUIT ): \\\"; cin >> s;\\n\\tif( !s ) return 0;\\n\\tif( !( s & 1 ) ) s++;\\n\\tif( s >= 3 )\\n\\t{\\n\\t mg.create( s );\\n\\t int sx, sy, ex, ey;\\n\\t while( true )\\n\\t {\\n\\t\\tsx = rand() % s; sy = rand() % s;\\n\\t\\tex = rand() % s; ey = rand() % s;\\n\\t\\tif( ex != sx || ey != sy ) break;\\n\\t }\\n\\t ms.solveIt( mg.getMaze(), s, sx, sy, ex, ey );\\n\\t cout << endl;\\n\\t}\\n\\tsystem( \\\"pause\\\" );\\n\\tsystem( \\\"cls\\\" );\\n }\\n return 0;\\n}\\n//--------------------------------------------------------------------------------------------------\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Text;\\n\\npublic class Maze\\n{\\n private char[,] cells;\\n private char[,] hWalls; // Horizontal walls\\n private char[,] vWalls; // Vertical walls\\n private Random rand = new Random();\\n\\n public Maze(int rows, int cols)\\n {\\n cells = new char[rows, cols];\\n hWalls = new char[rows + 1, cols]; // Include walls for the bottom\\n vWalls = new char[rows, cols + 1]; // Include walls for the right side\\n\\n // Initialize walls\\n for (int i = 0; i < rows; i++)\\n {\\n for (int j = 0; j < cols; j++)\\n {\\n hWalls[i, j] = '-';\\n vWalls[i, j] = '|';\\n }\\n }\\n\\n // Set the outer walls for the bottom and right\\n for (int i = 0; i < cols; i++)\\n {\\n hWalls[rows, i] = '-';\\n }\\n for (int i = 0; i < rows; i++)\\n {\\n vWalls[i, cols] = '|';\\n }\\n }\\n\\n public override string ToString()\\n {\\n var builder = new StringBuilder();\\n\\n for (int i = 0; i < cells.GetLength(0); i++)\\n {\\n // Top walls\\n for (int j = 0; j < cells.GetLength(1); j++)\\n {\\n builder.Append(\\\"+\\\");\\n builder.Append(hWalls[i, j] == '-' ? \\\"---\\\" : \\\" \\\");\\n }\\n builder.AppendLine(\\\"+\\\");\\n\\n // Side walls and cells\\n for (int j = 0; j < cells.GetLength(1); j++)\\n {\\n builder.Append(vWalls[i, j] == '|' ? \\\"| \\\" : \\\" \\\");\\n char cell = cells[i, j] == '\\\\0' ? ' ' : cells[i, j];\\n builder.Append(cell + \\\" \\\");\\n }\\n builder.AppendLine(\\\"|\\\");\\n }\\n\\n // Bottom walls\\n for (int j = 0; j < cells.GetLength(1); j++)\\n {\\n builder.Append(\\\"+---\\\");\\n }\\n builder.AppendLine(\\\"+\\\");\\n\\n return builder.ToString();\\n }\\n\\n public void Generate()\\n {\\n Generate(rand.Next(cells.GetLength(0)), rand.Next(cells.GetLength(1)));\\n }\\n\\n private void Generate(int r, int c)\\n {\\n cells[r, c] = ' ';\\n int[] dirs = { 0, 1, 2, 3 };\\n Shuffle(dirs);\\n\\n foreach (int dir in dirs)\\n {\\n switch (dir)\\n {\\n case 0: // Up\\n if (r > 0 && cells[r - 1, c] == '\\\\0')\\n {\\n hWalls[r, c] = ' ';\\n Generate(r - 1, c);\\n }\\n break;\\n case 1: // Down\\n if (r < cells.GetLength(0) - 1 && cells[r + 1, c] == '\\\\0')\\n {\\n hWalls[r + 1, c] = ' ';\\n Generate(r + 1, c);\\n }\\n break;\\n case 2: // Right\\n if (c < cells.GetLength(1) - 1 && cells[r, c + 1] == '\\\\0')\\n {\\n vWalls[r, c + 1] = ' ';\\n Generate(r, c + 1);\\n }\\n break;\\n case 3: // Left\\n if (c > 0 && cells[r, c - 1] == '\\\\0')\\n {\\n vWalls[r, c] = ' ';\\n Generate(r, c - 1);\\n }\\n break;\\n }\\n }\\n }\\n\\n private void Shuffle(int[] array)\\n {\\n for (int i = array.Length - 1; i > 0; i--)\\n {\\n int j = rand.Next(i + 1);\\n int temp = array[i];\\n array[i] = array[j];\\n array[j] = temp;\\n }\\n }\\n\\n public void Solve(int startRow, int startCol, int endRow, int endCol)\\n {\\n if (Solve(startRow, startCol, endRow, endCol, -1))\\n {\\n cells[startRow, startCol] = 'S';\\n cells[endRow, endCol] = 'F';\\n }\\n }\\n\\n private bool Solve(int r, int c, int endRow, int endCol, int dir)\\n {\\n if (r == endRow && c == endCol) return true;\\n\\n // Up\\n if (dir != 1 && r > 0 && hWalls[r, c] == ' ' && Solve(r - 1, c, endRow, endCol, 0))\\n {\\n cells[r, c] = '^';\\n return true;\\n }\\n // Down\\n if (dir != 0 && r < cells.GetLength(0) - 1 && hWalls[r + 1, c] == ' ' && Solve(r + 1, c, endRow, endCol, 1))\\n {\\n cells[r, c] = 'v';\\n return true;\\n }\\n // Right\\n if (dir != 3 && c < cells.GetLength(1) - 1 && vWalls[r, c + 1] == ' ' && Solve(r, c + 1, endRow, endCol, 2))\\n {\\n cells[r, c] = '>';\\n return true;\\n }\\n // Left\\n if (dir != 2 && c > 0 && vWalls[r, c] == ' ' && Solve(r, c - 1, endRow, endCol, 3))\\n {\\n cells[r, c] = '<';\\n return true;\\n }\\n\\n return false;\\n }\\n}\\n\\nclass Program\\n{\\n static void Main(string[] args)\\n {\\n var maze = new Maze(4, 7);\\n maze.Generate();\\n Random rand = new Random();\\n maze.Solve(rand.Next(4), rand.Next(7), rand.Next(4), rand.Next(7));\\n Console.WriteLine(maze);\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(ns small-projects.find-shortest-way\\n (:require [clojure.string :as str]))\\n\\n;Misk functions\\n(defn cell-empty? [maze coords]\\n (= :empty (get-in maze coords)))\\n\\n(defn wall? [maze coords]\\n (= :wall (get-in maze coords)))\\n\\n(defn track? [maze coords]\\n (= :track (get-in maze coords)))\\n\\n(defn get-neighbours [maze [y x cell]]\\n [[y (dec x)] [(inc y) x] [y (inc x)] [(dec y) x]])\\n\\n(defn get-difference [coll1 filter-coll]\\n (filter #(not (contains? filter-coll %)) coll1))\\n\\n(defn get-empties [maze cell]\\n (->> (get-neighbours maze cell)\\n (filter (partial cell-empty? maze))))\\n\\n(defn possible-ways [maze cell filter-coll]\\n (-> (get-empties maze cell)\\n (get-difference filter-coll)))\\n\\n(defn replace-cells [maze coords v]\\n (if (empty? coords)\\n maze\\n (recur (assoc-in maze (first coords) v) (rest coords) v)))\\n\\n;Print and parse functions\\n(def cell-code->str\\n [\\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\"· \\\" \\\"╵ \\\" \\\"╴ \\\" \\\"┘ \\\"\\n \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\"╶─\\\" \\\"└─\\\" \\\"──\\\" \\\"┴─\\\"\\n \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\"╷ \\\" \\\"│ \\\" \\\"┐ \\\" \\\"┤ \\\"\\n \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\"┌─\\\" \\\"├─\\\" \\\"┬─\\\" \\\"┼─\\\"\\n \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\"■ \\\" \\\"╹ \\\" \\\"╸ \\\" \\\"┛ \\\"\\n \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\"╺━\\\" \\\"┗━\\\" \\\"━━\\\" \\\"┻━\\\"\\n \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\"╻ \\\" \\\"┃ \\\" \\\"┓ \\\" \\\"┫ \\\"\\n \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\"┏━\\\" \\\"┣━\\\" \\\"┳━\\\" \\\"╋━\\\"\\n \\\" \\\"])\\n\\n(defn get-cell-code [maze coords]\\n (let [mode (if (track? maze coords) 1 0)\\n check (if (zero? mode) wall? track?)]\\n (transduce\\n (comp\\n (map (partial check maze))\\n (keep-indexed (fn [idx test] (when test idx)))\\n (map (partial bit-shift-left 1)))\\n (completing bit-or)\\n (bit-shift-left mode 5)\\n (sort (conj (get-neighbours maze coords) coords)))))\\n\\n(defn code->str [cell-code]\\n (nth cell-code->str cell-code))\\n\\n(defn maze->str-symbols [maze]\\n (for [y (range (count maze))]\\n (for [x (range (count (nth maze y)))]\\n (code->str (get-cell-code maze [y x])))))\\n\\n(defn maze->str [maze]\\n (->> (maze->str-symbols maze)\\n (map str/join)\\n (str/join \\\"\\\\n\\\")))\\n\\n(defn parse-pretty-maze [maze-str]\\n (->> (str/split-lines maze-str)\\n (map (partial take-nth 2))\\n (map (partial map #(if (= \\\\space %) :empty :wall)))\\n (map vec)\\n (vec)))\\n\\n;Core\\n(defn find-new-border [maze border old-border]\\n (apply conj (map (fn [cell]\\n (zipmap (possible-ways maze cell (conj border old-border))\\n (repeat cell)))\\n (keys border))))\\n\\n(defn backtrack [visited route]\\n (let [cur-cell (get visited (first route))]\\n (if (= cur-cell :start)\\n route\\n (recur visited (conj route cur-cell)))))\\n\\n(defn breadth-first-search [maze start-cell end-cell]\\n (loop [visited {start-cell :start}\\n border {start-cell :start}\\n old-border {start-cell :start}]\\n (if (contains? old-border end-cell)\\n (backtrack visited (list end-cell))\\n (recur\\n (conj visited border)\\n (find-new-border maze border old-border)\\n border))))\\n\\n(def maze (parse-pretty-maze maze-str))\\n\\n(def solved-maze\\n (replace-cells maze (breadth-first-search maze [1 1] [19 19]) :track))\\n\\n(println (maze->str solved-maze))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"import std.stdio, std.random, std.string, std.array, std.algorithm,\\n std.file, std.conv;\\n\\nenum int cx = 4, cy = 2; // Cell size x and y.\\nenum int cx2 = cx / 2, cy2 = cy / 2;\\nenum pathSymbol = '.';\\nstruct V2 { int x, y; }\\n\\nbool solveMaze(char[][] maze, in V2 s, in V2 end) pure nothrow @safe @nogc {\\n if (s == end)\\n return true;\\n\\n foreach (immutable d; [V2(0, -cy), V2(+cx, 0), V2(0, +cy), V2(-cx, 0)])\\n if (maze[s.y + (d.y / 2)][s.x + (d.x / 2)] == ' ' &&\\n maze[s.y + d.y][s.x + d.x] == ' ') {\\n//Would this help?\\n// maze[s.y + (d.y / 2)][s.x + (d.x / 2)] = pathSymbol;\\n maze[s.y + d.y][s.x + d.x] = pathSymbol;\\n if (solveMaze(maze, V2(s.x + d.x, s.y + d.y), end))\\n return true;\\n maze[s.y + d.y][s.x + d.x] = ' ';\\n }\\n\\n return false;\\n}\\n\\nvoid main() {\\n auto maze = \\\"maze.txt\\\".File.byLine.map!(r => r.chomp.dup).array;\\n immutable h = (maze.length.signed - 1) / cy;\\n assert (h > 0);\\n immutable w = (maze[0].length.signed - 1) / cx;\\n\\n immutable start = V2(cx2 + cx * uniform(0, w), cy2 + cy * uniform(0, h));\\n immutable end = V2(cx2 + cx * uniform(0, w), cy2 + cy * uniform(0, h));\\n\\n maze[start.y][start.x] = pathSymbol;\\n if (!solveMaze(maze, start, end))\\n return \\\"No solution path found.\\\".writeln;\\n maze[start.y][start.x] = 'S';\\n maze[end.y][end.x] = 'E';\\n writefln(\\\"%-(%s\\\\n%)\\\", maze);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"procedure SolveMaze(var AMaze: TMaze; const S, E: TPoint);\\nvar\\n Route : TRoute;\\n Position : TPoint;\\n V : TPoint; // delta vector\\nbegin\\n ClearVisited(AMaze);\\n Position := S;\\n Route := TStack<TPoint>.Create;\\n with Position do\\n try\\n AMaze[x, y].Visited := True;\\n repeat\\n if (y > 0) and not AMaze[x, y-1].Visited and AMaze[x, y].PassTop then V := Point(0, -1) else\\n if (x < mwidth-1) and not AMaze[x+1, y].Visited and AMaze[x+1, y].PassLeft then V := Point(1, 0) else\\n if (y < mheight-1) and not AMaze[x, y+1].Visited and AMaze[x, y+1].PassTop then V := Point(0, 1) else\\n if (x > 0) and not AMaze[x-1, y].Visited and AMaze[x, y].PassLeft then V := Point(-1, 0) else\\n begin\\n if Route.Count = 0 then Exit; // we are back at start so no way found\\n Position := Route.Pop; // step back\\n Continue;\\n end;\\n\\n Route.Push(Position); // save current position to route\\n Offset(V); // move forward\\n AMaze[x, y].Visited := True;\\n until Position = E; // solved\\n\\n ClearVisited(AMaze);\\n while Route.Count > 0 do // Route to Maze\\n with Route.Pop do\\n AMaze[x, y].Visited := True;\\n\\n finally\\n Route.Free;\\n end;\\nend;\\n\\nprocedure Main;\\nvar\\n Maze: TMaze;\\n S, E: TPoint;\\nbegin\\n Randomize;\\n PrepareMaze(Maze);\\n S := Point(Random(mwidth), Random(mheight));\\n E := Point(Random(mwidth), Random(mheight));\\n SolveMaze(Maze, S, E);\\n Write(MazeToString(Maze, S, E));\\n ReadLn;\\nend;\\n\\nbegin\\n Main;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"size = 15\\nn = 2 * size + 1\\nf = 100 / (n - 0.5)\\nlen m[] n * n\\n#\\nbackground 000\\nproc show_maze . .\\n clear\\n for i = 1 to len m[]\\n if m[i] = 0\\n x = (i - 1) mod n\\n y = (i - 1) div n\\n color 999\\n move x * f - f / 2 y * f - f / 2\\n rect f * 1.5 f * 1.5\\n .\\n .\\n sleep 0.01\\n.\\noffs[] = [ 1 n -1 (-n) ]\\nproc m_maze pos . .\\n m[pos] = 0\\n show_maze\\n d[] = [ 1 2 3 4 ]\\n for i = 4 downto 1\\n d = randint i\\n dir = offs[d[d]]\\n d[d] = d[i]\\n if m[pos + dir] = 1 and m[pos + 2 * dir] = 1\\n m[pos + dir] = 0\\n m_maze pos + 2 * dir\\n .\\n .\\n.\\nendpos = n * n - 1\\nproc make_maze . .\\n for i = 1 to len m[]\\n m[i] = 1\\n .\\n for i = 1 to n\\n m[i] = 2\\n m[n * i] = 2\\n m[n * i - n + 1] = 2\\n m[n * n - n + i] = 2\\n .\\n h = 2 * randint 15 - n + n * 2 * randint 15\\n m_maze h\\n m[endpos] = 0\\n.\\nmake_maze\\nshow_maze\\n#\\nproc mark pos col . .\\n x = (pos - 1) mod n\\n y = (pos - 1) div n\\n color col\\n move x * f + f / 4 y * f + f / 4\\n circle f / 3.5\\n.\\nglobal found .\\nproc solve dir0 pos . .\\n if found = 1\\n return\\n .\\n mark pos 900\\n sleep 0.05\\n if pos = endpos\\n found = 1\\n return\\n .\\n of = randint 4 - 1\\n for h = 1 to 4\\n dir = (h + of) mod1 4\\n posn = pos + offs[dir]\\n if dir <> dir0 and m[posn] = 0\\n solve (dir + 1) mod 4 + 1 posn\\n if found = 0\\n mark posn 888\\n sleep 0.08\\n .\\n .\\n .\\n.\\nsleep 1\\nsolve 0 n + 2\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"program MazeGenAndSolve\\n\\n // First and last columns/rows are \\\"dead\\\" cells. Makes generating\\n // a maze with border walls much easier. Therefore, a visible\\n // 20x20 maze has a maze size of 22. \\t\\n mazeSize int = 22;\\n\\n south boolean[][];\\n west boolean[][];\\n visited boolean[][];\\n\\n // Solution variables\\n solution Dictionary;\\n done boolean;\\n startingRow, startingCol, endingRow, endingCol int;\\n\\n function main()\\n initMaze();\\n generateMaze();\\n drawMaze(false); // Draw maze without solution\\n\\n solveMaze();\\n drawMaze(true); // Draw maze with solution\\n end\\n\\n private function initMaze()\\n\\n visited = createBooleanArray(mazeSize, mazeSize, false);\\n\\n // Initialize border cells as already visited\\n for(col int from 1 to mazeSize)\\n visited[col][1] = true;\\n visited[col][mazeSize] = true;\\n end\\n for(row int from 1 to mazeSize)\\n visited[1][row] = true;\\n visited[mazeSize][row] = true;\\n end\\n\\n // Initialize all walls as present\\n south = createBooleanArray(mazeSize, mazeSize, true);\\n west = createBooleanArray(mazeSize, mazeSize, true);\\n\\n end\\n\\n private function createBooleanArray(col int in, row int in, initialState boolean in) returns(boolean[][])\\n\\n newArray boolean[][] = new boolean[0][0];\\n\\n for(i int from 1 to col)\\n innerArray boolean[] = new boolean[0];\\n for(j int from 1 to row)\\n innerArray.appendElement(initialState);\\n end\\n newArray.appendElement(innerArray);\\n end\\n\\n return(newArray);\\n\\n end\\n\\n private function createIntegerArray(col int in, row int in, initialValue int in) returns(int[][])\\n\\n newArray int[][] = new int[0][0];\\n\\n for(i int from 1 to col)\\n innerArray int[] = new int[0];\\n for(j int from 1 to row)\\n innerArray.appendElement(initialValue);\\n end\\n newArray.appendElement(innerArray);\\n end\\n\\n return(newArray);\\n\\n end\\n\\n private function generate(col int in, row int in)\\n\\n\\t // Mark cell as visited\\n visited[col][row] = true;\\n\\n // Keep going as long as there is an unvisited neighbor\\n while(!visited[col][row + 1] || !visited[col + 1][row] ||\\n !visited[col][row - 1] || !visited[col - 1][row])\\n\\n while(true)\\n r float = MathLib.random(); // Choose a random direction\\n\\n case\\n when(r < 0.25 && !visited[col][row + 1]) // Go south\\n south[col][row] = false; // South wall down\\n generate(col, row + 1);\\n exit while;\\n when(r >= 0.25 && r < 0.50 && !visited[col + 1][row]) // Go east\\n west[col + 1][row] = false; // West wall of neighbor to the east down\\n generate(col + 1, row);\\n exit while;\\n when(r >= 0.5 && r < 0.75 && !visited[col][row - 1]) // Go north\\n south[col][row - 1] = false; // South wall of neighbor to the north down\\n generate(col, row - 1);\\n exit while;\\n when(r >= 0.75 && r < 1.00 && !visited[col - 1][row]) // Go west\\n west[col][row] = false; // West wall down\\n generate(col - 1, row);\\n exit while;\\n end\\n end\\n end\\n\\n end\\n\\n private function generateMaze()\\n\\n \\t// Pick random start position (within the visible maze space)\\n randomStartCol int = MathLib.floor((MathLib.random() *(mazeSize - 2)) + 2);\\n randomStartRow int = MathLib.floor((MathLib.random() *(mazeSize - 2)) + 2);\\n\\n generate(randomStartCol, randomStartRow);\\n\\n end\\n\\n private function drawMaze(solve boolean in)\\n\\n line string;\\n\\n // Iterate over wall arrays (skipping dead border cells as required).\\n // Construct a row at a time and output to console.\\n for(row int from 1 to mazeSize - 1)\\n\\n if(row > 1)\\n line = \\\"\\\";\\n for(col int from 2 to mazeSize)\\n if(west[col][row])\\n line ::= cellTest(col, row, solve);\\n else\\n line ::= cellTest(col, row, solve);\\n end\\n end\\n Syslib.writeStdout(line);\\n end\\n\\n line = \\\"\\\";\\n for(col int from 2 to mazeSize - 1)\\n if(south[col][row])\\n line ::= \\\"+---\\\";\\n else\\n line ::= \\\"+ \\\";\\n end\\n end\\n line ::= \\\"+\\\";\\n SysLib.writeStdout(line);\\n\\n end\\n\\n end\\n\\n private function cellTest(col int in, row int in, solve boolean in) returns(string)\\n\\n wall string;\\n\\n // Determine cell wall structure. If in solve mode, show start, end and\\n // solution markers.\\n if(!solve)\\n if(west[col][row])\\n wall = \\\"| \\\";\\n else\\n wall = \\\" \\\";\\n end\\n else\\n if(west[col][row])\\n\\n case\\n when(col == startingCol and row == startingRow)\\n wall = \\\"| S \\\";\\n when(col == endingCol and row == endingRow)\\n wall = \\\"| E \\\";\\n when(solution.containsKey(\\\"x=\\\" + col + \\\"y=\\\" + row))\\n wall = \\\"| * \\\";\\n otherwise\\n wall = \\\"| \\\";\\n end\\n\\n else\\n case\\n when(col == startingCol and row == startingRow)\\n wall = \\\" S \\\";\\n when(col == endingCol and row == endingRow)\\n wall = \\\" E \\\";\\n when(solution.containsKey(\\\"x=\\\" + col + \\\"y=\\\" + row))\\n wall = \\\" * \\\";\\n otherwise\\n wall = \\\" \\\";\\n end\\n end\\n end\\n\\n return(wall);\\n end\\n\\n private function solve(col int in, row int in)\\n\\n if(col == 1 || row == 1 || col == mazeSize || row == mazeSize)\\n return;\\n end\\n\\n if(done || visited[col][row])\\n return;\\n end\\n\\n visited[col][row] = true;\\n\\n solution[\\\"x=\\\" + col + \\\"y=\\\" + row] = true;\\n\\n // Reached the end point\\n if(col == endingCol && row == endingRow)\\n done = true;\\n end\\n\\n if(!south[col][row]) // Go South\\n solve(col, row + 1);\\n end\\n if(!west[col + 1][row]) // Go East\\n solve(col + 1, row);\\n end\\n if(!south[col][row - 1]) // Go North\\n solve(col, row - 1);\\n end\\n if(!west[col][row]) // Go West\\n solve(col - 1, row);\\n end\\n\\n if(done)\\n return;\\n end\\n\\n solution.removeElement(\\\"x=\\\" + col + \\\"y=\\\" + row);\\n\\n end\\n\\n private function solveMaze()\\n for(col int from 1 to mazeSize)\\n for(row int from 1 to mazeSize)\\n visited[col][row] = false;\\n end\\n end\\n\\n solution = new Dictionary(false, OrderingKind.byInsertion);\\n done = false;\\n\\n // Pick random start position on first visible row\\n startingCol = MathLib.floor((MathLib.random() *(mazeSize - 2)) + 2);\\n startingRow = 2;\\n\\n // Pick random end position on last visible row\\n endingCol = MathLib.floor((MathLib.random() *(mazeSize - 2)) + 2);\\n endingRow = mazeSize - 1;\\n\\n solve(startingCol, startingRow);\\n end\\n\\nend\\n\",\n \"language\": \"EGL\"\n },\n {\n \"code\": \"(require 'cl-lib)\\n\\n(cl-defstruct maze rows cols data)\\n\\n(defmacro maze-pt (w r c)\\n `(+ (* (mod ,r (maze-rows ,w)) (maze-cols ,w))\\n (mod ,c (maze-cols ,w))))\\n\\n(defmacro maze-ref (w r c)\\n `(aref (maze-data ,w) (maze-pt ,w ,r ,c)))\\n\\n(defun new-maze (rows cols)\\n (setq rows (1+ rows)\\n cols (1+ cols))\\n (let ((m (make-maze :rows rows :cols cols :data (make-vector (* rows cols) nil))))\\n\\n (dotimes (r rows)\\n (dotimes (c cols)\\n (setf (maze-ref m r c) (copy-sequence '(wall ceiling)))))\\n\\n (dotimes (r rows)\\n (maze-set m r (1- cols) 'visited))\\n\\n (dotimes (c cols)\\n (maze-set m (1- rows) c 'visited))\\n\\n (maze-unset m 0 0 'ceiling) ;; Maze Entrance\\n (maze-unset m (1- rows) (- cols 2) 'ceiling) ;; Maze Exit\\n\\n m))\\n\\n(defun maze-is-set (maze r c v)\\n (member v (maze-ref maze r c)))\\n\\n(defun maze-set (maze r c v)\\n (let ((cell (maze-ref maze r c)))\\n (when (not (member v cell))\\n (setf (maze-ref maze r c) (cons v cell)))))\\n\\n(defun maze-unset (maze r c v)\\n (setf (maze-ref maze r c) (delete v (maze-ref maze r c))))\\n\\n(defun print-maze (maze &optional marks)\\n (dotimes (r (1- (maze-rows maze)))\\n\\n (dotimes (c (1- (maze-cols maze)))\\n (princ (if (maze-is-set maze r c 'ceiling) \\\"+---\\\" \\\"+ \\\")))\\n (princ \\\"+\\\")\\n (terpri)\\n\\n (dotimes (c (1- (maze-cols maze)))\\n (princ (if (maze-is-set maze r c 'wall) \\\"|\\\" \\\" \\\"))\\n (princ (if (member (cons r c) marks) \\\" * \\\" \\\" \\\")))\\n (princ \\\"|\\\")\\n (terpri))\\n\\n (dotimes (c (1- (maze-cols maze)))\\n (princ (if (maze-is-set maze (1- (maze-rows maze)) c 'ceiling) \\\"+---\\\" \\\"+ \\\")))\\n (princ \\\"+\\\")\\n (terpri))\\n\\n(defun shuffle (lst)\\n (sort lst (lambda (a b) (= 1 (random 2)))))\\n\\n(defun to-visit (maze row col)\\n (let (unvisited)\\n (dolist (p '((0 . +1) (0 . -1) (+1 . 0) (-1 . 0)))\\n (let ((r (+ row (car p)))\\n (c (+ col (cdr p))))\\n (unless (maze-is-set maze r c 'visited)\\n (push (cons r c) unvisited))))\\n unvisited))\\n\\n(defun make-passage (maze r1 c1 r2 c2)\\n (if (= r1 r2)\\n (if (< c1 c2)\\n (maze-unset maze r2 c2 'wall) ; right\\n (maze-unset maze r1 c1 'wall)) ; left\\n (if (< r1 r2)\\n (maze-unset maze r2 c2 'ceiling) ; up\\n (maze-unset maze r1 c1 'ceiling)))) ; down\\n\\n(defun dig-maze (maze row col)\\n (let (backup\\n (run 0))\\n (maze-set maze row col 'visited)\\n (push (cons row col) backup)\\n (while backup\\n (setq run (1+ run))\\n (when (> run (/ (+ row col) 3))\\n (setq run 0)\\n (setq backup (shuffle backup)))\\n (setq row (caar backup)\\n col (cdar backup))\\n (let ((p (shuffle (to-visit maze row col))))\\n (if p\\n (let ((r (caar p))\\n (c (cdar p)))\\n (make-passage maze row col r c)\\n (maze-set maze r c 'visited)\\n (push (cons r c) backup))\\n (pop backup)\\n (setq backup (shuffle backup))\\n (setq run 0))))))\\n\\n(defun generate (rows cols)\\n (let* ((m (new-maze rows cols)))\\n (dig-maze m (random rows) (random cols))\\n (print-maze m)))\\n\\n(defun parse-ceilings (line)\\n (let (rtn\\n (i 1))\\n (while (< i (length line))\\n (push (eq ?- (elt line i)) rtn)\\n (setq i (+ i 4)))\\n (nreverse rtn)))\\n\\n(defun parse-walls (line)\\n (let (rtn\\n (i 0))\\n (while (< i (length line))\\n (push (eq ?| (elt line i)) rtn)\\n (setq i (+ i 4)))\\n (nreverse rtn)))\\n\\n(defun parse-maze (file-name)\\n (let ((rtn)\\n (lines (with-temp-buffer\\n (insert-file-contents-literally file-name)\\n (split-string (buffer-string) \\\"\\\\n\\\" t))))\\n (while lines\\n (push (parse-ceilings (pop lines)) rtn)\\n (push (parse-walls (pop lines)) rtn))\\n (nreverse rtn)))\\n\\n(defun read-maze (file-name)\\n (let* ((raw (parse-maze file-name))\\n (rows (1- (/ (length raw) 2)))\\n (cols (length (car raw)))\\n (maze (new-maze rows cols)))\\n (dotimes (r rows)\\n (let ((ceilings (pop raw)))\\n (dotimes (c cols)\\n (unless (pop ceilings)\\n (maze-unset maze r c 'ceiling))))\\n (let ((walls (pop raw)))\\n (dotimes (c cols)\\n (unless (pop walls)\\n (maze-unset maze r c 'wall)))))\\n maze))\\n\\n(defun find-exits (maze row col)\\n (let (exits)\\n (dolist (p '((0 . +1) (0 . -1) (-1 . 0) (+1 . 0)))\\n (let ((r (+ row (car p)))\\n (c (+ col (cdr p))))\\n (unless\\n (cond\\n ((equal p '(0 . +1)) (maze-is-set maze r c 'wall))\\n ((equal p '(0 . -1)) (maze-is-set maze row col 'wall))\\n ((equal p '(+1 . 0)) (maze-is-set maze r c 'ceiling))\\n ((equal p '(-1 . 0)) (maze-is-set maze row col 'ceiling)))\\n (push (cons r c) exits))))\\n exits))\\n\\n(defun drop-visited (maze points)\\n (let (not-visited)\\n (while points\\n (unless (maze-is-set maze (caar points) (cdar points) 'visited)\\n (push (car points) not-visited))\\n (pop points))\\n not-visited))\\n\\n(defun solve-maze (maze)\\n (let (solution\\n (exit (cons (- (maze-rows maze) 2) (- (maze-cols maze) 2)))\\n (pt (cons 0 0)))\\n (while (not (equal pt exit))\\n (maze-set maze (car pt) (cdr pt) 'visited)\\n (let ((exits (drop-visited maze (find-exits maze (car pt) (cdr pt)))))\\n (if (null exits)\\n (setq pt (pop solution))\\n (push pt solution)\\n (setq pt (pop exits)))))\\n (push pt solution)))\\n\\n(defun solve (file-name)\\n (let* ((maze (read-maze file-name))\\n (solution (solve-maze maze)))\\n (print-maze maze solution)))\\n\\n(solve \\\"maze.txt\\\")\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"-module( maze_solving ).\\n\\n-export( [task/0] ).\\n\\ncells( {Start_x, Start_y}, {Stop_x, Stop_y}, Maze ) ->\\n Start_pid = maze:cell_pid( Start_x, Start_y, Maze ),\\n Stop_pid = maze:cell_pid( Stop_x, Stop_y, Maze ),\\n {ok, Cells} = loop( Start_pid, Stop_pid, maze:cell_accessible_neighbours(Start_pid), [Start_pid] ),\\n Cells.\\n\\ntask() ->\\n Max_x = 16,\\n Max_y = 8,\\n Maze = maze:generation( Max_x, Max_y ),\\n Start_x = random:uniform( Max_x ),\\n Start_y = random:uniform( Max_y ),\\n Stop_x = random:uniform( Max_x ),\\n Stop_y = random:uniform( Max_y ),\\n Cells = cells( {Start_x, Start_y}, {Stop_x, Stop_y}, Maze ),\\n [maze:cell_content_set(X, \\\".\\\") || X <- Cells],\\n maze:cell_content_set( maze:cell_pid(Start_x, Start_y, Maze), \\\"S\\\" ),\\n maze:cell_content_set( maze:cell_pid(Stop_x, Stop_y, Maze), \\\"G\\\" ),\\n maze:display( Maze ),\\n maze:stop( Maze ).\\n\\n\\n\\nloop( _Start, _Stop, [], _Acc) -> {error, dead_end};\\nloop( _Start, Stop, [Stop], Acc ) -> {ok, lists:reverse( [Stop | Acc] )};\\nloop( Start, Stop, [Next], [Previous | _T]=Acc ) -> loop( Start, Stop, lists:delete(Previous, maze:cell_accessible_neighbours(Next)), [Next | Acc] );\\nloop( Start, Stop, Nexts, Acc ) -> loop_stop( lists:member(Stop, Nexts), Start, Stop, Nexts, Acc ).\\n\\nloop_stop( true, _Start, Stop, _Nexts, Acc ) -> {ok, lists:reverse( [Stop | Acc] )};\\nloop_stop( false, Start, Stop, Nexts, Acc ) ->\\n My_pid = erlang:self(),\\n [erlang:spawn( fun() -> My_pid ! loop( Start, Stop, [X], Acc ) end ) || X <- Nexts],\\n receive\\n {ok, Cells} -> {ok, Cells}\\n end.\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"module MazeSolver where\\n\\nimport frege.IO\\nimport Data.Maybe\\n\\n-- given two points, returns the average of them\\naverage :: (Int, Int) -> (Int, Int) -> (Int, Int)\\naverage (x, y) (x', y') = ((x + x') `div` 2, (y + y') `div` 2)\\n\\n-- given a maze and a tuple of position and wall position, returns\\n-- true if the wall position is not blocked (first position is unused)\\nnotBlocked :: [String] -> ((Int, Int), (Int, Int)) -> Bool\\nnotBlocked maze (_, (x, y)) = (' ' == String.charAt (maze !! y) x)\\n\\n-- given a list, a position, and an element, returns a new list\\n-- with the new element substituted at the position\\nsubstitute :: [a] -> Int -> a -> [a]\\nsubstitute orig pos el =\\n let (before, after) = splitAt pos orig\\n in before ++ [el] ++ tail after\\n\\n-- like above, but for strings, since Frege strings are not\\n-- lists of characters\\nsubstituteString :: String -> Int -> String -> String\\nsubstituteString orig pos el =\\n let before = substr orig 0 pos\\n after = strtail orig (pos + 1)\\n in before ++ el ++ after\\n\\n-- given a maze and a position, draw a '*' at that position in the maze\\ndraw :: [String] -> (Int, Int) -> [String]\\ndraw maze (x,y) = substitute maze y $ substituteString row x \\\"*\\\"\\n where row = maze !! y\\n\\n-- given a maze, a previous position, and a list of tuples of potential\\n-- new positions and their wall positions, returns the solved maze, or\\n-- None if it cannot be solved\\ntryMoves :: [String] -> (Int, Int) -> [((Int, Int), (Int, Int))] -> Maybe [String]\\ntryMoves _ _ [] = Nothing\\ntryMoves maze prevPos ((newPos,wallPos):more) =\\n case solve' maze newPos prevPos\\n of Nothing -> tryMoves maze prevPos more\\n Just maze' -> Just $ foldl draw maze' [newPos, wallPos]\\n\\n-- given a maze, a new position, and a previous position, returns\\n-- the solved maze, or None if it cannot be solved\\n-- (assumes goal is upper-left corner of maze)\\nsolve' :: [String] -> (Int, Int) -> (Int, Int) -> Maybe [String]\\nsolve' maze (2, 1) _ = Just maze\\nsolve' maze (x, y) prevPos =\\n let newPositions = [(x, y - 2), (x + 4, y), (x, y + 2), (x - 4, y)]\\n notPrev pos' = pos' /= prevPos\\n newPositions' = filter notPrev newPositions\\n wallPositions = map (average (x,y)) newPositions'\\n zipped = zip newPositions' wallPositions\\n legalMoves = filter (notBlocked maze) zipped\\n in tryMoves maze (x,y) legalMoves\\n\\n-- given a maze, returns a solved maze, or None if it cannot be solved\\n-- (starts at lower right corner and goes to upper left corner)\\nsolve :: [String] -> Maybe [String]\\nsolve maze = solve' (draw maze start) start (-1, -1)\\n where startx = (length $ head maze) - 3\\n starty = (length maze) - 2\\n start = (startx, starty)\\n\\n-- takes unsolved maze on standard input, prints solved maze on standard output\\nmain _ = do\\n isin <- stdin\\n isrin <- InputStreamReader.new isin\\n brin <- BufferedReader.fromISR isrin\\n lns <- BufferedReader.getlines brin\\n printStr $ unlines $ fromMaybe [\\\"can't solve\\\"] $ solve lns\\n\",\n \"language\": \"Frege\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bytes\\\"\\n \\\"fmt\\\"\\n \\\"math/rand\\\"\\n \\\"time\\\"\\n)\\n\\ntype maze struct {\\n c2 [][]byte // cells by row\\n h2 [][]byte // horizontal walls by row (ignore first row)\\n v2 [][]byte // vertical walls by row (ignore first of each column)\\n}\\n\\nfunc newMaze(rows, cols int) *maze {\\n c := make([]byte, rows*cols) // all cells\\n h := bytes.Repeat([]byte{'-'}, rows*cols) // all horizontal walls\\n v := bytes.Repeat([]byte{'|'}, rows*cols) // all vertical walls\\n c2 := make([][]byte, rows) // cells by row\\n h2 := make([][]byte, rows) // horizontal walls by row\\n v2 := make([][]byte, rows) // vertical walls by row\\n for i := range h2 {\\n c2[i] = c[i*cols : (i+1)*cols]\\n h2[i] = h[i*cols : (i+1)*cols]\\n v2[i] = v[i*cols : (i+1)*cols]\\n }\\n return &maze{c2, h2, v2}\\n}\\n\\nfunc (m *maze) String() string {\\n hWall := []byte(\\\"+---\\\")\\n hOpen := []byte(\\\"+ \\\")\\n vWall := []byte(\\\"| \\\")\\n vOpen := []byte(\\\" \\\")\\n rightCorner := []byte(\\\"+\\\\n\\\")\\n rightWall := []byte(\\\"|\\\\n\\\")\\n var b []byte\\n for r, hw := range m.h2 {\\n for _, h := range hw {\\n if h == '-' || r == 0 {\\n b = append(b, hWall...)\\n } else {\\n b = append(b, hOpen...)\\n if h != '-' && h != 0 {\\n b[len(b)-2] = h\\n }\\n }\\n }\\n b = append(b, rightCorner...)\\n for c, vw := range m.v2[r] {\\n if vw == '|' || c == 0 {\\n b = append(b, vWall...)\\n } else {\\n b = append(b, vOpen...)\\n if vw != '|' && vw != 0 {\\n b[len(b)-4] = vw\\n }\\n }\\n if m.c2[r][c] != 0 {\\n b[len(b)-2] = m.c2[r][c]\\n }\\n }\\n b = append(b, rightWall...)\\n }\\n for _ = range m.h2[0] {\\n b = append(b, hWall...)\\n }\\n b = append(b, rightCorner...)\\n return string(b)\\n}\\n\\nfunc (m *maze) gen() {\\n m.g2(rand.Intn(len(m.c2)), rand.Intn(len(m.c2[0])))\\n}\\n\\nconst (\\n up = iota\\n dn\\n rt\\n lf\\n)\\n\\nfunc (m *maze) g2(r, c int) {\\n m.c2[r][c] = ' '\\n for _, dir := range rand.Perm(4) {\\n switch dir {\\n case up:\\n if r > 0 && m.c2[r-1][c] == 0 {\\n m.h2[r][c] = 0\\n m.g2(r-1, c)\\n }\\n case lf:\\n if c > 0 && m.c2[r][c-1] == 0 {\\n m.v2[r][c] = 0\\n m.g2(r, c-1)\\n }\\n case dn:\\n if r < len(m.c2)-1 && m.c2[r+1][c] == 0 {\\n m.h2[r+1][c] = 0\\n m.g2(r+1, c)\\n }\\n case rt:\\n if c < len(m.c2[0])-1 && m.c2[r][c+1] == 0 {\\n m.v2[r][c+1] = 0\\n m.g2(r, c+1)\\n }\\n }\\n }\\n}\\n\\nfunc main() {\\n rand.Seed(time.Now().UnixNano())\\n const height = 4\\n const width = 7\\n m := newMaze(height, width)\\n m.gen()\\n m.solve(\\n rand.Intn(height), rand.Intn(width),\\n rand.Intn(height), rand.Intn(width))\\n fmt.Print(m)\\n}\\n\\nfunc (m *maze) solve(ra, ca, rz, cz int) {\\n var rSolve func(ra, ca, dir int) bool\\n rSolve = func(r, c, dir int) bool {\\n if r == rz && c == cz {\\n m.c2[r][c] = 'F'\\n return true\\n }\\n if dir != dn && m.h2[r][c] == 0 {\\n if rSolve(r-1, c, up) {\\n m.c2[r][c] = '^'\\n m.h2[r][c] = '^'\\n return true\\n }\\n }\\n if dir != up && r+1 < len(m.h2) && m.h2[r+1][c] == 0 {\\n if rSolve(r+1, c, dn) {\\n m.c2[r][c] = 'v'\\n m.h2[r+1][c] = 'v'\\n return true\\n }\\n }\\n if dir != lf && c+1 < len(m.v2[0]) && m.v2[r][c+1] == 0 {\\n if rSolve(r, c+1, rt) {\\n m.c2[r][c] = '>'\\n m.v2[r][c+1] = '>'\\n return true\\n }\\n }\\n if dir != rt && m.v2[r][c] == 0 {\\n if rSolve(r, c-1, lf) {\\n m.c2[r][c] = '<'\\n m.v2[r][c] = '<'\\n return true\\n }\\n }\\n return false\\n }\\n rSolve(ra, ca, -1)\\n m.c2[ra][ca] = 'S'\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"#!/usr/bin/runhaskell\\n\\nimport Data.Maybe (fromMaybe)\\n\\n-- given two points, returns the average of them\\naverage :: (Int, Int) -> (Int, Int) -> (Int, Int)\\naverage (x, y) (x_, y_) = ((x + x_) `div` 2, (y + y_) `div` 2)\\n\\n-- given a maze and a tuple of position and wall position, returns\\n-- true if the wall position is not blocked (first position is unused)\\nnotBlocked :: [String] -> ((Int, Int), (Int, Int)) -> Bool\\nnotBlocked maze (_, (x, y)) = ' ' == (maze !! y) !! x\\n\\n-- given a list, a position, and an element, returns a new list\\n-- with the new element substituted at the position\\n-- (it seems such a function should exist in the standard library;\\n-- I must be missing it)\\nsubstitute :: [a] -> Int -> a -> [a]\\nsubstitute orig pos el =\\n let (before, after) = splitAt pos orig\\n in before ++ [el] ++ tail after\\n\\n-- given a maze and a position, draw a '*' at that position in the maze\\ndraw :: [String] -> (Int, Int) -> [String]\\ndraw maze (x, y) =\\n let row = maze !! y\\n in substitute maze y $ substitute row x '*'\\n\\n-- given a maze, a previous position, and a list of tuples of potential\\n-- new positions and their wall positions, returns the solved maze, or\\n-- None if it cannot be solved\\ntryMoves :: [String]\\n -> (Int, Int)\\n -> [((Int, Int), (Int, Int))]\\n -> Maybe [String]\\ntryMoves _ _ [] = Nothing\\ntryMoves maze prevPos ((newPos, wallPos):more) =\\n case solve_ maze newPos prevPos of\\n Nothing -> tryMoves maze prevPos more\\n Just maze_ -> Just $ foldl draw maze_ [newPos, wallPos]\\n\\n-- given a maze, a new position, and a previous position, returns\\n-- the solved maze, or None if it cannot be solved\\n-- (assumes goal is upper-left corner of maze)\\nsolve_ :: [String] -> (Int, Int) -> (Int, Int) -> Maybe [String]\\nsolve_ maze (2, 1) _ = Just maze\\nsolve_ maze pos@(x, y) prevPos =\\n let newPositions = [(x, y - 2), (x + 4, y), (x, y + 2), (x - 4, y)]\\n notPrev pos_ = pos_ /= prevPos\\n newPositions_ = filter notPrev newPositions\\n wallPositions = map (average pos) newPositions_\\n zipped = zip newPositions_ wallPositions\\n legalMoves = filter (notBlocked maze) zipped\\n in tryMoves maze pos legalMoves\\n\\n-- given a maze, returns a solved maze, or None if it cannot be solved\\n-- (starts at lower right corner and goes to upper left corner)\\nsolve :: [String] -> Maybe [String]\\nsolve maze = solve_ (draw maze start) start (-1, -1)\\n where\\n startx = length (head maze) - 3\\n starty = length maze - 2\\n start = (startx, starty)\\n\\n-- takes unsolved maze on standard input, prints solved maze on standard output\\nmain =\\n let main_ = unlines . fromMaybe [\\\"can_t solve\\\"] . solve . lines\\n in interact main_\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main(A)\\n /mh := \\\\A[1] | 12\\n /mw := \\\\A[2] | 16\\n mz := DisplayMaze(GenerateMaze(mh,mw))\\n WriteImage(mz.filename) # save file\\n WAttrib(mz.window,\\\"canvas=normal\\\") # show it\\n until Event() == &lpress # wait for left mouse press\\n Solver(mz.maze)\\n DisplayMazeSolution(mz)\\n WriteImage(mz.filename ?:= (=\\\"maze-\\\", \\\"maze-solved-\\\" || tab(0)))\\n until Event() == &lpress # wait\\n close(mz.window)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"procedure Solver(r,c)\\nstatic maze,h,w,rd\\n\\n if type(r) == \\\"list\\\" then { # ------------------- Top Level (r == maze)\\n h := *(maze := r) # height\\n w := *maze[1] # width\\n every r := 1 to h & c := 1 to w do # remove breadcrumbs\\n maze[r,c] := iand(maze[r,c],NORTH+EAST+SOUTH+WEST+START+FINISH)\\n every ((r := 1 | h) & (c := 1 to w)) | # search perimiter\\n ((r := 1 to h) & (c := 1 | w)) do\\n if iand(maze[r,c],START) > 0 then break # until start found\\n Solver(r,c) # recurse through maze\\n return 1(.maze,maze := &null) # return maze and reset\\n }\\n else # ------------------- Recurse way through maze\\n if iand(x := maze[r,c],SEEN) = 0 then { # in bounds and not seen?\\n (iand(x,FINISH) > 0, maze[r,c] +:= PATH, return ) # at finish? - done!\\n maze[r,c] +:= SEEN # drop bread crumb\\n (iand(x,NORTH) > 0, Solver(r-1,c), maze[r,c] +:= PATH, return)\\n (iand(x,EAST) > 0, Solver(r,c+1), maze[r,c] +:= PATH, return)\\n (iand(x,SOUTH) > 0, Solver(r+1,c), maze[r,c] +:= PATH, return)\\n (iand(x,WEST) > 0, Solver(r,c-1), maze[r,c] +:= PATH, return)\\n }\\nend\\n\\nprocedure DisplayMazeSolution(mz) #: draw marked PATH\\n&window := mz.window\\nmaze := mz.maze\\nWAttrib(\\\"dx=\\\"||(dxy:=BORDER+CELL/2),\\\"dy=\\\"||dxy)\\nevery (r := 1 to *maze) & (c := 1 to *maze[1]) do {\\n if fg ~=== \\\"blue\\\" then Fg(fg := \\\"blue\\\")\\n if iand(maze[r,c],START) > 0 then Fg(fg := \\\"red\\\")\\n if iand(maze[r,c],PATH) > 0 then\\n FillCircle(x := CELL*(c-1),y := CELL*(r-1),rad := CELL/5)\\n }\\nreturn mz\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"global showMice\\n\\nimport Utils\\t# To get 'Args' singleton class\\n\\nprocedure main(A)\\n Args(A)\\n if \\\\Args().get(\\\"help\\\",\\\"yes\\\") then helpMesg()\\n showMice := Args().get(\\\"showmice\\\",\\\"yes\\\") # Show movements of all mice\\n mh := Args().get(\\\"rows\\\") | 32 # Maze height (rows)\\n mw := Args().get(\\\"cols\\\") | 48 # Maze width (columns)\\n\\n mz := DisplayMaze(GenerateMaze(mh,mw)) # Build and show maze\\n\\n QMouse(mz.maze,findStart(mz.maze),&null,0) # Start first quantum mouse\\n waitForCompletion() # block until all quantum mice have finished\\n\\n # Mark the best path into the maze and display it.\\n if showPath(mz.maze) then DisplayMazeSolution(mz) else write(\\\"No path found!\\\")\\nend\\n\\nprocedure helpMesg()\\n write(&errout,\\\"Usage: qSolve [--showmice] [--cols=C] [--rows=R]\\\")\\n write(&errout,\\\"\\\\twhere:\\\")\\n write(&errout,\\\"\\\\t\\\\t--showmice # displays all mice paths as they search\\\")\\n write(&errout,\\\"\\\\t\\\\t--cols=C # sets maze width to C (default 16) columns\\\")\\n write(&errout,\\\"\\\\t\\\\t--rows=R # sets maze height to R (default 12) rows\\\")\\n stop()\\nend\\n\\n# A \\\"Quantum-mouse\\\" for traversing mazes. Each mouse lives for just one cell, but\\n# can spawn other mice to search from adjoining cells.\\n\\nglobal qMice, bestMouse, bestMouseLock, region, qMiceEmpty\\nrecord Position(r,c)\\n\\n# Must match values used in maze generation!\\n$define FINISH 64 # exit\\n$define START 32 # entrance\\n$define PATH 128\\n$define SEEN 16 # bread crumbs for generator\\n$define NORTH 8 # sides ...\\n$define EAST 4\\n$define SOUTH 2\\n$define WEST 1\\n$define EMPTY 0 # like new\\n\\nclass QMouse(maze, loc, parent, len, val)\\n\\n method getLoc(); return loc; end\\n method getParent(); return \\\\parent; end\\n method getLen(); return len; end\\n method atEnd(); return EMPTY ~= iand(val, FINISH); end\\n method goNorth(); if EMPTY ~= iand(val,NORTH) then return visit(loc.r-1, loc.c); end\\n method goSouth(); if EMPTY ~= iand(val,SOUTH) then return visit(loc.r+1, loc.c); end\\n method goEast(); if EMPTY ~= iand(val,EAST) then return visit(loc.r, loc.c+1); end\\n method goWest(); if EMPTY ~= iand(val,WEST) then return visit(loc.r, loc.c-1); end\\n\\n method visit(r,c)\\n critical region[r,c]: if EMPTY = iand(maze[r,c],SEEN) then {\\n if /bestMouse | (len <= bestMouse.getLen()) then { # Keep going?\\n mark(maze, r,c)\\n unlock(region[r,c])\\n return Position(r,c)\\n }\\n }\\n end\\n\\ninitially (m, l, p, n)\\n initial { # Construct critical region mutexes and completion condvar\\n qMice := mutex(set())\\n qMiceEmpty := condvar()\\n bestMouseLock := mutex()\\n region := list(*m) # Minimize critical region size\\n every r := 1 to *m do region[r] := list(*m[1])\\n every !!region := mutex()\\n }\\n maze := m\\n loc := l\\n parent := p\\n len := n+1\\n val := maze[loc.r,loc.c] | fail # Fail if outside maze\\n insert(qMice, self)\\n thread {\\n if atEnd() then {\\n critical bestMouseLock:\\n if /bestMouse | (len < bestMouse.getLen()) then bestMouse := self\\n }\\n else { # Spawn more mice to look for finish\\n QMouse(maze, goNorth(), self, len)\\n QMouse(maze, goSouth(), self, len)\\n QMouse(maze, goEast(), self, len)\\n QMouse(maze, goWest(), self, len)\\n }\\n\\n delete(qMice, self)\\n if *qMice=0 then signal(qMiceEmpty)\\n }\\nend\\n\\nprocedure mark(maze, r,c)\\n ior(maze[r,c],SEEN)\\n if \\\\showMice then markCell(r,c,\\\"grey\\\",5)\\n return Position(r,c)\\nend\\n\\nprocedure clearMaze(maze) # Clear out dregs from maze creation\\n every r := 1 to *maze & c := 1 to *maze[1] do # remove breadcrumbs\\n maze[r,c] := iand(maze[r,c],NORTH+EAST+SOUTH+WEST+START+FINISH)\\nend\\n\\nprocedure findStart(maze) # Anywhere in maze\\n clearMaze(maze) # Remove breadcrumbs\\n every r := 1 to *maze & c := 1 to *maze[1] do # Locate START cell\\n if EMPTY ~= iand(maze[r,c],START) then return mark(maze, r,c)\\nend\\n\\nprocedure showPath(maze)\\n if path := \\\\bestMouse then { # Mark it in maze\\n repeat {\\n loc := path.getLoc()\\n maze[loc.r,loc.c] +:= PATH\\n path := \\\\path.getParent() | break\\n }\\n return\\n }\\nend\\n\\nprocedure waitForCompletion()\\n critical qMiceEmpty: while *qMice > 0 do wait(qMiceEmpty)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"maze=:4 :0\\n assert.0<:n=.<:x*y\\n horiz=. 0$~x,y-1\\n verti=. 0$~(x-1),y\\n path=.,:here=. ?x,y\\n unvisited=.0 (<here+1)} 0,0,~|:0,0,~1$~y,x\\n while.n do.\\n neighbors=. here+\\\"1 (,-)=0 1\\n neighbors=. neighbors #~ (<\\\"1 neighbors+1) {unvisited\\n if.#neighbors do.\\n n=.n-1\\n next=. ({~ ?@#) neighbors\\n unvisited=.0 (<next+1)} unvisited\\n if.{.next=here\\n do. horiz=.1 (<-:here+next-0 1)} horiz\\n else. verti=. 1 (<-:here+next-1 0)} verti end.\\n path=.path,here=.next\\n else.\\n here=.{:path\\n path=.}:path\\n end.\\n end.\\n horiz;verti\\n)\\n\\nNB. source Dijkstra_equal_weights graph\\nNB.\\nNB. + +---+---+\\nNB. | 0 1 2 | (sample cell numbers)\\nNB. +---+ + +\\nNB. | 3 4 | 5\\nNB. +---+---+---+\\nNB.\\nNB. graph =: 1;0 2 4;1 5;4;1 3;2\\nNB. The graph is a vector of boxed vectors of neighbors.\\n\\nDijkstra_equal_weights =: 4 : 0\\n dist =. previous =. #&_ n =. # graph =. y [ source =. x\\n dist =. 0 source } dist\\n Q =. 0\\n while. #Q do.\\n u =. {.Q\\n Q =. }.Q\\n if. _ = u{dist do. break. end.\\n for_v. >u{graph do.\\n if. -. v e. previous do.\\n alt =. >: u { dist\\n if. alt < v { dist do.\\n dist =. alt v } dist\\n previous =. u v } previous\\n if. v e. Q do.\\n echo 'belch'\\n else.\\n Q =. Q,v\\n end.\\n end.\\n end.\\n end.\\n end.\\n dist;previous\\n)\\n\\npath =: 3 : 0\\n p =. <:#y\\n while. _ > {:p do.\\n p =. p,y{~{:p\\n end.\\n |.}:p\\n)\\n\\nsolve=:3 :0\\n NB. convert walls to graph\\n shape =. }.@$@:>\\n ew =. (,.&0 ,: 0&,.)@>@{. NB. east west doors\\n ns =. (, &0 ,: 0&, )@>@{:\\n cell_offsets =. 1 _1 1 _1 * 2 # 1 , {:@shape\\n cell_numbers =. i.@shape\\n neighbors =. (cell_numbers +\\\"_ _1 cell_offsets *\\\"_1 (ew , ns))y\\n graph =. (|:@(,/\\\"_1) <@-.\\\"1 0 ,@i.@shape)neighbors NB. list of boxed neighbors\\n NB. solve it\\n path , > {: 0 Dijkstra_equal_weights graph\\n)\\n\\ndisplay=:3 :0\\n size=. >.&$&>/y\\n text=. (}:1 3$~2*1+{:size)#\\\"1\\\":size$<' '\\n 'hdoor vdoor'=. 2 4&*&.>&.> (#&,{@;&i./@$)&.> y\\n ' ' (a:-.~0 1;0 2; 0 3;(2 1-~$text);(1 4&+&.> hdoor),,vdoor+&.>\\\"0/2 1;2 2;2 3)} text\\n:\\n a=. display y\\n size=. >.&$&>/y\\n columns=. {: size\\n cells =. <\\\"1(1 2&p.@<.@(%&columns) ,. 2 4&p.@(columns&|))x\\n 'o' cells } a NB. exercise, replace cells with a gerund to draw arrows on the path.\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.io.*;\\nimport java.util.*;\\n\\npublic class MazeSolver\\n{\\n /**\\n * Reads a file into an array of strings, one per line.\\n */\\n private static String[] readLines (InputStream f) throws IOException\\n {\\n BufferedReader r =\\n new BufferedReader (new InputStreamReader (f, \\\"US-ASCII\\\"));\\n ArrayList<String> lines = new ArrayList<String>();\\n String line;\\n while ((line = r.readLine()) != null)\\n lines.add (line);\\n return lines.toArray(new String[0]);\\n }\\n\\n /**\\n * Makes the maze half as wide (i. e. \\\"+---+\\\" becomes \\\"+-+\\\"), so that\\n * each cell in the maze is the same size horizontally as vertically.\\n * (Versus the expanded version, which looks better visually.)\\n * Also, converts each line of the maze from a String to a\\n * char[], because we'll want mutability when drawing the solution later.\\n */\\n private static char[][] decimateHorizontally (String[] lines)\\n {\\n final int width = (lines[0].length() + 1) / 2;\\n char[][] c = new char[lines.length][width];\\n for (int i = 0 ; i < lines.length ; i++)\\n for (int j = 0 ; j < width ; j++)\\n c[i][j] = lines[i].charAt (j * 2);\\n return c;\\n }\\n\\n /**\\n * Given the maze, the x and y coordinates (which must be odd),\\n * and the direction we came from, return true if the maze is\\n * solvable, and draw the solution if so.\\n */\\n private static boolean solveMazeRecursively (char[][] maze,\\n int x, int y, int d)\\n {\\n boolean ok = false;\\n for (int i = 0 ; i < 4 && !ok ; i++)\\n if (i != d)\\n switch (i)\\n {\\n // 0 = up, 1 = right, 2 = down, 3 = left\\n case 0:\\n if (maze[y-1][x] == ' ')\\n ok = solveMazeRecursively (maze, x, y - 2, 2);\\n break;\\n case 1:\\n if (maze[y][x+1] == ' ')\\n ok = solveMazeRecursively (maze, x + 2, y, 3);\\n break;\\n case 2:\\n if (maze[y+1][x] == ' ')\\n ok = solveMazeRecursively (maze, x, y + 2, 0);\\n break;\\n case 3:\\n if (maze[y][x-1] == ' ')\\n ok = solveMazeRecursively (maze, x - 2, y, 1);\\n break;\\n }\\n // check for end condition\\n if (x == 1 && y == 1)\\n ok = true;\\n // once we have found a solution, draw it as we unwind the recursion\\n if (ok)\\n {\\n maze[y][x] = '*';\\n switch (d)\\n {\\n case 0:\\n maze[y-1][x] = '*';\\n break;\\n case 1:\\n maze[y][x+1] = '*';\\n break;\\n case 2:\\n maze[y+1][x] = '*';\\n break;\\n case 3:\\n maze[y][x-1] = '*';\\n break;\\n }\\n }\\n return ok;\\n }\\n\\n /**\\n * Solve the maze and draw the solution. For simplicity,\\n * assumes the starting point is the lower right, and the\\n * ending point is the upper left.\\n */\\n private static void solveMaze (char[][] maze)\\n {\\n solveMazeRecursively (maze, maze[0].length - 2, maze.length - 2, -1);\\n }\\n\\n /**\\n * Opposite of decimateHorizontally(). Adds extra characters to make\\n * the maze \\\"look right\\\", and converts each line from char[] to\\n * String at the same time.\\n */\\n private static String[] expandHorizontally (char[][] maze)\\n {\\n char[] tmp = new char[3];\\n String[] lines = new String[maze.length];\\n for (int i = 0 ; i < maze.length ; i++)\\n {\\n StringBuilder sb = new StringBuilder(maze[i].length * 2);\\n for (int j = 0 ; j < maze[i].length ; j++)\\n if (j % 2 == 0)\\n sb.append (maze[i][j]);\\n else\\n {\\n tmp[0] = tmp[1] = tmp[2] = maze[i][j];\\n if (tmp[1] == '*')\\n tmp[0] = tmp[2] = ' ';\\n sb.append (tmp);\\n }\\n lines[i] = sb.toString();\\n }\\n return lines;\\n }\\n\\n /**\\n * Accepts a maze as generated by:\\n * http://rosettacode.org/wiki/Maze_generation#Java\\n * in a file whose name is specified as a command-line argument,\\n * or on standard input if no argument is specified.\\n */\\n public static void main (String[] args) throws IOException\\n {\\n InputStream f = (args.length > 0\\n ? new FileInputStream (args[0])\\n : System.in);\\n String[] lines = readLines (f);\\n char[][] maze = decimateHorizontally (lines);\\n solveMaze (maze);\\n String[] solvedLines = expandHorizontally (maze);\\n for (int i = 0 ; i < solvedLines.length ; i++)\\n System.out.println (solvedLines[i]);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.awt.*;\\nimport java.awt.event.*;\\nimport java.awt.geom.Path2D;\\nimport java.util.*;\\nimport javax.swing.*;\\n\\npublic class MazeGenerator extends JPanel {\\n enum Dir {\\n N(1, 0, -1), S(2, 0, 1), E(4, 1, 0), W(8, -1, 0);\\n final int bit;\\n final int dx;\\n final int dy;\\n Dir opposite;\\n\\n // use the static initializer to resolve forward references\\n static {\\n N.opposite = S;\\n S.opposite = N;\\n E.opposite = W;\\n W.opposite = E;\\n }\\n\\n Dir(int bit, int dx, int dy) {\\n this.bit = bit;\\n this.dx = dx;\\n this.dy = dy;\\n }\\n };\\n final int nCols;\\n final int nRows;\\n final int cellSize = 25;\\n final int margin = 25;\\n final int[][] maze;\\n LinkedList<Integer> solution;\\n\\n public MazeGenerator(int size) {\\n setPreferredSize(new Dimension(650, 650));\\n setBackground(Color.white);\\n nCols = size;\\n nRows = size;\\n maze = new int[nRows][nCols];\\n solution = new LinkedList<>();\\n generateMaze(0, 0);\\n\\n addMouseListener(new MouseAdapter() {\\n @Override\\n public void mousePressed(MouseEvent e) {\\n new Thread(() -> {\\n solve(0);\\n }).start();\\n }\\n });\\n }\\n\\n @Override\\n public void paintComponent(Graphics gg) {\\n super.paintComponent(gg);\\n Graphics2D g = (Graphics2D) gg;\\n g.setRenderingHint(RenderingHints.KEY_ANTIALIASING,\\n RenderingHints.VALUE_ANTIALIAS_ON);\\n\\n g.setStroke(new BasicStroke(5));\\n g.setColor(Color.black);\\n\\n // draw maze\\n for (int r = 0; r < nRows; r++) {\\n for (int c = 0; c < nCols; c++) {\\n\\n int x = margin + c * cellSize;\\n int y = margin + r * cellSize;\\n\\n if ((maze[r][c] & 1) == 0) // N\\n g.drawLine(x, y, x + cellSize, y);\\n\\n if ((maze[r][c] & 2) == 0) // S\\n g.drawLine(x, y + cellSize, x + cellSize, y + cellSize);\\n\\n if ((maze[r][c] & 4) == 0) // E\\n g.drawLine(x + cellSize, y, x + cellSize, y + cellSize);\\n\\n if ((maze[r][c] & 8) == 0) // W\\n g.drawLine(x, y, x, y + cellSize);\\n }\\n }\\n\\n // draw pathfinding animation\\n int offset = margin + cellSize / 2;\\n\\n Path2D path = new Path2D.Float();\\n path.moveTo(offset, offset);\\n\\n for (int pos : solution) {\\n int x = pos % nCols * cellSize + offset;\\n int y = pos / nCols * cellSize + offset;\\n path.lineTo(x, y);\\n }\\n\\n g.setColor(Color.orange);\\n g.draw(path);\\n\\n g.setColor(Color.blue);\\n g.fillOval(offset - 5, offset - 5, 10, 10);\\n\\n g.setColor(Color.green);\\n int x = offset + (nCols - 1) * cellSize;\\n int y = offset + (nRows - 1) * cellSize;\\n g.fillOval(x - 5, y - 5, 10, 10);\\n\\n }\\n\\n void generateMaze(int r, int c) {\\n Dir[] dirs = Dir.values();\\n Collections.shuffle(Arrays.asList(dirs));\\n for (Dir dir : dirs) {\\n int nc = c + dir.dx;\\n int nr = r + dir.dy;\\n if (withinBounds(nr, nc) && maze[nr][nc] == 0) {\\n maze[r][c] |= dir.bit;\\n maze[nr][nc] |= dir.opposite.bit;\\n generateMaze(nr, nc);\\n }\\n }\\n }\\n\\n boolean withinBounds(int r, int c) {\\n return c >= 0 && c < nCols && r >= 0 && r < nRows;\\n }\\n\\n boolean solve(int pos) {\\n if (pos == nCols * nRows - 1)\\n return true;\\n\\n int c = pos % nCols;\\n int r = pos / nCols;\\n\\n for (Dir dir : Dir.values()) {\\n int nc = c + dir.dx;\\n int nr = r + dir.dy;\\n if (withinBounds(nr, nc) && (maze[r][c] & dir.bit) != 0\\n && (maze[nr][nc] & 16) == 0) {\\n\\n int newPos = nr * nCols + nc;\\n\\n solution.add(newPos);\\n maze[nr][nc] |= 16;\\n\\n animate();\\n\\n if (solve(newPos))\\n return true;\\n\\n animate();\\n\\n solution.removeLast();\\n maze[nr][nc] &= ~16;\\n }\\n }\\n\\n return false;\\n }\\n\\n void animate() {\\n try {\\n Thread.sleep(50L);\\n } catch (InterruptedException ignored) {\\n }\\n repaint();\\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(\\\"Maze Generator\\\");\\n f.setResizable(false);\\n f.add(new MazeGenerator(24), BorderLayout.CENTER);\\n f.pack();\\n f.setLocationRelativeTo(null);\\n f.setVisible(true);\\n });\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var ctx, wid, hei, cols, rows, maze, stack = [], start = {x:-1, y:-1}, end = {x:-1, y:-1}, grid = 8;\\nfunction drawMaze() {\\n for( var i = 0; i < cols; i++ ) {\\n for( var j = 0; j < rows; j++ ) {\\n switch( maze[i][j] ) {\\n case 0: ctx.fillStyle = \\\"black\\\"; break;\\n case 1: ctx.fillStyle = \\\"green\\\"; break;\\n case 2: ctx.fillStyle = \\\"red\\\"; break;\\n case 3: ctx.fillStyle = \\\"yellow\\\"; break;\\n case 4: ctx.fillStyle = \\\"#500000\\\"; break;\\n }\\n ctx.fillRect( grid * i, grid * j, grid, grid );\\n }\\n }\\n}\\nfunction getFNeighbours( sx, sy, a ) {\\n var n = [];\\n if( sx - 1 > 0 && maze[sx - 1][sy] == a ) {\\n n.push( { x:sx - 1, y:sy } );\\n }\\n if( sx + 1 < cols - 1 && maze[sx + 1][sy] == a ) {\\n n.push( { x:sx + 1, y:sy } );\\n }\\n if( sy - 1 > 0 && maze[sx][sy - 1] == a ) {\\n n.push( { x:sx, y:sy - 1 } );\\n }\\n if( sy + 1 < rows - 1 && maze[sx][sy + 1] == a ) {\\n n.push( { x:sx, y:sy + 1 } );\\n }\\n return n;\\n}\\nfunction solveMaze() {\\n if( start.x == end.x && start.y == end.y ) {\\n for( var i = 0; i < cols; i++ ) {\\n for( var j = 0; j < rows; j++ ) {\\n switch( maze[i][j] ) {\\n case 2: maze[i][j] = 3; break;\\n case 4: maze[i][j] = 0; break;\\n }\\n }\\n }\\n drawMaze();\\n return;\\n }\\n var neighbours = getFNeighbours( start.x, start.y, 0 );\\n if( neighbours.length ) {\\n stack.push( start );\\n start = neighbours[0];\\n maze[start.x][start.y] = 2;\\n } else {\\n maze[start.x][start.y] = 4;\\n start = stack.pop();\\n }\\n\\n drawMaze();\\n requestAnimationFrame( solveMaze );\\n}\\nfunction getCursorPos( event ) {\\n var rect = this.getBoundingClientRect();\\n var x = Math.floor( ( event.clientX - rect.left ) / grid ),\\n y = Math.floor( ( event.clientY - rect.top ) / grid );\\n if( maze[x][y] ) return;\\n if( start.x == -1 ) {\\n start = { x: x, y: y };\\n } else {\\n end = { x: x, y: y };\\n maze[start.x][start.y] = 2;\\n solveMaze();\\n }\\n}\\nfunction getNeighbours( sx, sy, a ) {\\n var n = [];\\n if( sx - 1 > 0 && maze[sx - 1][sy] == a && sx - 2 > 0 && maze[sx - 2][sy] == a ) {\\n n.push( { x:sx - 1, y:sy } ); n.push( { x:sx - 2, y:sy } );\\n }\\n if( sx + 1 < cols - 1 && maze[sx + 1][sy] == a && sx + 2 < cols - 1 && maze[sx + 2][sy] == a ) {\\n n.push( { x:sx + 1, y:sy } ); n.push( { x:sx + 2, y:sy } );\\n }\\n if( sy - 1 > 0 && maze[sx][sy - 1] == a && sy - 2 > 0 && maze[sx][sy - 2] == a ) {\\n n.push( { x:sx, y:sy - 1 } ); n.push( { x:sx, y:sy - 2 } );\\n }\\n if( sy + 1 < rows - 1 && maze[sx][sy + 1] == a && sy + 2 < rows - 1 && maze[sx][sy + 2] == a ) {\\n n.push( { x:sx, y:sy + 1 } ); n.push( { x:sx, y:sy + 2 } );\\n }\\n return n;\\n}\\nfunction createArray( c, r ) {\\n var m = new Array( c );\\n for( var i = 0; i < c; i++ ) {\\n m[i] = new Array( r );\\n for( var j = 0; j < r; j++ ) {\\n m[i][j] = 1;\\n }\\n }\\n return m;\\n}\\nfunction createMaze() {\\n var neighbours = getNeighbours( start.x, start.y, 1 ), l;\\n if( neighbours.length < 1 ) {\\n if( stack.length < 1 ) {\\n drawMaze(); stack = [];\\n start.x = start.y = -1;\\n document.getElementById( \\\"canvas\\\" ).addEventListener( \\\"mousedown\\\", getCursorPos, false );\\n return;\\n }\\n start = stack.pop();\\n } else {\\n var i = 2 * Math.floor( Math.random() * ( neighbours.length / 2 ) )\\n l = neighbours[i]; maze[l.x][l.y] = 0;\\n l = neighbours[i + 1]; maze[l.x][l.y] = 0;\\n start = l\\n stack.push( start )\\n }\\n drawMaze();\\n requestAnimationFrame( createMaze );\\n}\\nfunction createCanvas( w, h ) {\\n var canvas = document.createElement( \\\"canvas\\\" );\\n wid = w; hei = h;\\n canvas.width = wid; canvas.height = hei;\\n canvas.id = \\\"canvas\\\";\\n ctx = canvas.getContext( \\\"2d\\\" );\\n ctx.fillStyle = \\\"black\\\"; ctx.fillRect( 0, 0, wid, hei );\\n document.body.appendChild( canvas );\\n}\\nfunction init() {\\n cols = 73; rows = 53;\\n createCanvas( grid * cols, grid * rows );\\n maze = createArray( cols, rows );\\n start.x = Math.floor( Math.random() * ( cols / 2 ) );\\n start.y = Math.floor( Math.random() * ( rows / 2 ) );\\n if( !( start.x & 1 ) ) start.x++; if( !( start.y & 1 ) ) start.y++;\\n maze[start.x][start.y] = 0;\\n createMaze();\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\n + +---+---+\\n | 1 2 3 |\\n +---+ + +\\n | 4 5 | 6\\n +---+---+---+\\n\\n julia> const graph = [\\n 0 1 0 0 0 0;\\n 1 0 1 0 1 0;\\n 0 1 0 0 0 1;\\n 0 0 0 0 1 0;\\n 0 1 0 1 0 0;\\n 0 0 1 0 0 0]\\n\\n julia> dist, path = dijkstra(graph, 1)\\n (Dict(4=>3,2=>1,3=>2,5=>2,6=>3,1=>0), Dict(4=>5,2=>1,3=>2,5=>2,6=>3,1=>0))\\n\\n julia> printpath(path, 6) # Display solution of the maze\\n 1 -> 2 -> 3 -> 6\\n\\n\\\"\\\"\\\"\\nfunction dijkstra(graph, source::Int=1)\\n # ensure that the adjacency matrix is squared\\n @assert size(graph, 1) == size(graph, 2)\\n inf = typemax(Int64)\\n n = size(graph, 1)\\n\\n Q = IntSet(1:n) # Set of unvisited nodes\\n dist = Dict(n => inf for n in Q) # Unknown distance function from source to v\\n prev = Dict(n => 0 for n in Q) # Previous node in optimal path from source\\n dist[source] = 0 # Distance from source to source\\n\\n function _minimumdist(nodes) # Find the less distant node among nodes\\n kmin, vmin = nothing, inf\\n for (k, v) in dist\\n if k ∈ nodes && v ≤ vmin\\n kmin, vmin = k, v\\n end\\n end\\n return kmin\\n end\\n # Until all nodes are visited...\\n while !isempty(Q)\\n u = _minimumdist(Q) # Vertex in Q with smallest dist[]\\n pop!(Q, u)\\n if dist[u] == inf break end # All remaining vertices are inaccessible from source\\n for v in 1:n # Each neighbor v of u\\n if graph[u, v] != 0 && v ∈ Q # where v has not yet been visited\\n alt = dist[u] + graph[u, v]\\n if alt < dist[v] # Relax (u, v, a)\\n dist[v] = alt\\n prev[v] = u\\n end\\n end\\n end\\n end\\n\\n return dist, prev\\nend\\n\\nfunction printpath(prev::Dict, target::Int)\\n path = \\\"$target\\\"\\n while prev[target] != 0\\n target = prev[target]\\n path = \\\"$target -> \\\" * path\\n end\\n println(path)\\nend\\n\\nconst graph = [\\n 0 1 0 0 0 0;\\n 1 0 1 0 1 0;\\n 0 1 0 0 0 1;\\n 0 0 0 0 1 0;\\n 0 1 0 1 0 0;\\n 0 0 1 0 0 0]\\n\\ndist, path = dijkstra(graph)\\nprintpath(path, 6)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// Version 1.2.31\\n\\nimport java.io.File\\n\\ntypealias Maze = List<CharArray>\\n\\n/**\\n * Makes the maze half as wide (i. e. \\\"+---+\\\" becomes \\\"+-+\\\"), so that\\n * each cell in the maze is the same size horizontally as vertically.\\n * (Versus the expanded version, which looks better visually.)\\n * Also, converts each line of the maze from a String to a\\n * char[], because we'll want mutability when drawing the solution later.\\n */\\nfun decimateHorizontally(lines: List<String>): Maze {\\n val width = (lines[0].length + 1) / 2\\n val c = List(lines.size) { CharArray(width) }\\n for (i in 0 until lines.size) {\\n for (j in 0 until width) c[i][j] = lines[i][j * 2]\\n }\\n return c\\n}\\n\\n/**\\n * Given the maze, the x and y coordinates (which must be odd),\\n * and the direction we came from, return true if the maze is\\n * solvable, and draw the solution if so.\\n */\\nfun solveMazeRecursively(maze: Maze, x: Int, y: Int, d: Int): Boolean {\\n var ok = false\\n var i = 0\\n while (i < 4 && !ok) {\\n if (i != d) {\\n // 0 = up, 1 = right, 2 = down, 3 = left\\n when(i) {\\n 0 -> if (maze[y - 1][x] == ' ') ok = solveMazeRecursively (maze, x, y - 2, 2)\\n 1 -> if (maze[y][x + 1] == ' ') ok = solveMazeRecursively (maze, x + 2, y, 3)\\n 2 -> if (maze[y + 1][x] == ' ') ok = solveMazeRecursively (maze, x, y + 2, 0)\\n 3 -> if (maze[y][x - 1] == ' ') ok = solveMazeRecursively (maze, x - 2, y, 1)\\n else -> {}\\n }\\n }\\n i++\\n }\\n\\n // check for end condition\\n if (x == 1 && y == 1) ok = true\\n\\n // once we have found a solution, draw it as we unwind the recursion\\n if (ok) {\\n maze[y][x] = '*'\\n when (d) {\\n 0 -> maze[y - 1][x] = '*'\\n 1 -> maze[y][x + 1] = '*'\\n 2 -> maze[y + 1][x] = '*'\\n 3 -> maze[y][x - 1] = '*'\\n else -> {}\\n }\\n }\\n return ok\\n}\\n\\n/**\\n * Solve the maze and draw the solution. For simplicity,\\n * assumes the starting point is the lower right, and the\\n * ending point is the upper left.\\n */\\nfun solveMaze(maze: Maze) =\\n solveMazeRecursively(maze, maze[0].size - 2, maze.size - 2, -1)\\n\\n/**\\n * Opposite of decimateHorizontally(). Adds extra characters to make\\n * the maze \\\"look right\\\", and converts each line from char[] to\\n * String at the same time.\\n */\\nfun expandHorizontally(maze: Maze): Array<String> {\\n val tmp = CharArray(3)\\n val lines = Array<String>(maze.size) { \\\"\\\" }\\n for (i in 0 until maze.size) {\\n val sb = StringBuilder(maze[i].size * 2)\\n for (j in 0 until maze[i].size) {\\n if (j % 2 == 0)\\n sb.append(maze[i][j])\\n else {\\n for (k in 0..2) tmp[k] = maze[i][j]\\n if (tmp[1] == '*') {\\n tmp[0] = ' '\\n tmp[2] = ' '\\n }\\n sb.append(tmp)\\n }\\n }\\n lines[i] = sb.toString()\\n }\\n return lines\\n}\\n\\n/**\\n * Accepts a maze as generated by:\\n * http://rosettacode.org/wiki/Maze_generation#Kotlin\\n * in a file whose name is specified as a command-line argument.\\n */\\nfun main(args: Array<String>) {\\n if (args.size != 1) {\\n println(\\\"The maze file to be read should be passed as a single command line argument.\\\")\\n return\\n }\\n val f = File(args[0])\\n if (!f.exists()) {\\n println(\\\"Sorry ${args[0]} does not exist.\\\")\\n return\\n }\\n val lines = f.readLines(Charsets.US_ASCII)\\n val maze = decimateHorizontally(lines)\\n solveMaze(maze)\\n val solvedLines = expandHorizontally(maze)\\n println(solvedLines.joinToString(\\\"\\\\n\\\"))\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"HighlightGraph[maze, PathGraph@FindShortestPath[maze, 1, 273]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import random, strutils\\n\\ntype\\n\\n Direction {.pure.} = enum None, Up, Left, Down, Right\\n\\n Maze = object\\n cells: seq[string]\\n hwalls: seq[string]\\n vwalls: seq[string]\\n\\n\\n####################################################################################################\\n# Maze creation.\\n\\nfunc initMaze(rows, cols: Positive): Maze =\\n ## Initialize a maze description.\\n var h = repeat('-', cols)\\n var v = repeat(\\\"|\\\", cols)\\n for i in 0..<rows:\\n result.cells.add newString(cols)\\n result.hwalls.add h\\n result.vwalls.add v\\n\\n\\nproc gen(maze: var Maze; r, c: Natural) =\\n ## Generate a maze starting from point (r, c).\\n\\n maze.cells[r][c] = ' '\\n var dirs = [Up, Left, Down, Right]\\n dirs.shuffle()\\n for dir in dirs:\\n case dir\\n of None:\\n discard\\n of Up:\\n if r > 0 and maze.cells[r-1][c] == '\\\\0':\\n maze.hwalls[r][c] = chr(0)\\n maze.gen(r-1, c)\\n of Left:\\n if c > 0 and maze.cells[r][c-1] == '\\\\0':\\n maze.vwalls[r][c] = chr(0)\\n maze.gen(r, c-1)\\n of Down:\\n if r < maze.cells.high and maze.cells[r+1][c] == '\\\\0':\\n maze.hwalls[r+1][c] = chr(0)\\n maze.gen(r+1, c)\\n of Right:\\n if c < maze.cells[0].high and maze.cells[r][c+1] == '\\\\0':\\n maze.vwalls[r][c+1] = chr(0)\\n maze.gen(r, c+1)\\n\\n\\nproc gen(maze: var Maze) =\\n ## Generate a maze, choosing a random starting point.\\n maze.gen(rand(maze.cells.high), rand(maze.cells[0].high))\\n\\n\\n####################################################################################################\\n# Maze solving.\\n\\nproc solve(maze: var Maze; ra, ca, rz, cz: Natural) =\\n ## Solve a maze by finding the path from point (ra, ca) to point (rz, cz).\\n\\n proc rsolve(maze: var Maze; r, c: Natural; dir: Direction): bool {.discardable.} =\\n ## Recursive solver.\\n\\n if r == rz and c == cz:\\n maze.cells[r][c] = 'F'\\n return true\\n\\n if dir != Down and maze.hwalls[r][c] == '\\\\0':\\n if maze.rSolve(r-1, c, Up):\\n maze.cells[r][c] = '^'\\n maze.hwalls[r][c] = '^'\\n return true\\n\\n if dir != Up and r < maze.hwalls.high and maze.hwalls[r+1][c] == '\\\\0':\\n if maze.rSolve(r+1, c, Down):\\n maze.cells[r][c] = 'v'\\n maze.hwalls[r+1][c] = 'v'\\n return true\\n\\n if dir != Left and c < maze.vwalls[0].high and maze.vwalls[r][c+1] == '\\\\0':\\n if maze.rSolve(r, c+1, Right):\\n maze.cells[r][c] = '>'\\n maze.vwalls[r][c+1] = '>'\\n return true\\n\\n if dir != Right and maze.vwalls[r][c] == '\\\\0':\\n if maze.rSolve(r, c-1, Left):\\n maze.cells[r][c] = '<'\\n maze.vwalls[r][c] = '<'\\n return true\\n\\n\\n maze.rsolve(ra, ca, None)\\n maze.cells[ra][ca] = 'S'\\n\\n\\n####################################################################################################\\n# Maze display.\\n\\nfunc `$`(maze: Maze): string =\\n ## Return the string representation fo a maze.\\n\\n const\\n HWall = \\\"+---\\\"\\n HOpen = \\\"+ \\\"\\n VWall = \\\"| \\\"\\n VOpen = \\\" \\\"\\n RightCorner = \\\"+\\\\n\\\"\\n RightWall = \\\"|\\\\n\\\"\\n\\n for r, hw in maze.hwalls:\\n\\n for h in hw:\\n if h == '-' or r == 0:\\n result.add HWall\\n else:\\n result.add HOpen\\n if h notin {'-', '\\\\0'}: result[^2] = h\\n result.add RightCorner\\n\\n for c, vw in maze.vwalls[r]:\\n if vw == '|' or c == 0:\\n result.add VWall\\n else:\\n result.add VOpen\\n if vw notin {'|', '\\\\0'}: result[^4] = vw\\n if maze.cells[r][c] != '\\\\0': result[^2] = maze.cells[r][c]\\n result.add RightWall\\n\\n for _ in 1..maze.hwalls[0].len:\\n result.add HWall\\n result.add RightCorner\\n\\n\\n#———————————————————————————————————————————————————————————————————————————————————————————————————\\n\\nwhen isMainModule:\\n\\n const\\n Width = 8\\n Height = 8\\n\\n randomize()\\n var maze = initMaze(Width, Height)\\n maze.gen()\\n var ra, rz = rand(Width - 1)\\n var ca, cz = rand(Height - 1)\\n while rz == ra and cz == ca:\\n # Make sur starting and ending points are different.\\n rz = rand(Width - 1)\\n cz = rand(Height - 1)\\n maze.solve(ra, ca , rz, cz)\\n echo maze\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#!perl\\nuse strict;\\nuse warnings;\\n\\nmy ($width, $height) = @ARGV;\\n$_ ||= 10 for $width, $height;\\n\\nmy %visited;\\n\\nmy $h_barrier = \\\"+\\\" . (\\\"--+\\\" x $width) . \\\"\\\\n\\\";\\nmy $v_barrier = \\\"|\\\" . (\\\" |\\\" x $width) . \\\"\\\\n\\\";\\nmy @output = ($h_barrier, $v_barrier) x $height;\\npush @output, $h_barrier;\\nmy @dx = qw(-1 1 0 0);\\nmy @dy = qw(0 0 -1 1);\\n\\nsub visit {\\n my ($x, $y) = @_;\\n $visited{$x, $y} = 1;\\n my $rand = int rand 4;\\n for my $n ( $rand .. 3, 0 .. $rand-1 ) {\\n my ($xx, $yy) = ($x + $dx[$n], $y + $dy[$n]);\\n next if $visited{ $xx, $yy };\\n next if $xx < 0 or $xx >= $width;\\n next if $yy < 0 or $yy >= $height;\\n\\n my $row = $y * 2 + 1 + $dy[$n];\\n my $col = $x * 3 + 1 + $dx[$n];\\n substr( $output[$row], $col, 2, ' ' );\\n\\n no warnings 'recursion';\\n visit( $xx, $yy );\\n }\\n}\\n\\nvisit( int rand $width, int rand $height );\\n\\nprint \\\"Here is the maze:\\\\n\\\";\\nprint @output;\\n\\n%visited = ();\\n\\nmy @d = ('>>', '<<', 'vv', '^^');\\nsub solve {\\n my ($x, $y) = @_;\\n return 1 if $x == 0 and $y == 0;\\n $visited{ $x, $y } = 1;\\n my $rand = int rand 4;\\n for my $n ( $rand .. 3, 0 .. $rand-1 ) {\\n my ($xx, $yy) = ($x + $dx[$n], $y + $dy[$n]);\\n next if $visited{ $xx, $yy };\\n next if $xx < 0 or $xx >= $width;\\n next if $yy < 0 or $yy >= $height;\\n\\n my $row = $y * 2 + 1 + $dy[$n];\\n my $col = $x * 3 + 1 + $dx[$n];\\n\\n my $b = substr( $output[$row], $col, 2 );\\n next if \\\" \\\" ne $b;\\n\\n no warnings 'recursion';\\n next if not solve( $xx, $yy );\\n\\n substr( $output[$row], $col, 2, $d[$n] );\\n substr( $output[$row-$dy[$n]], $col-$dx[$n], 2, $d[$n] );\\n return 1;\\n }\\n 0;\\n}\\n\\nif( solve( $width-1, $height-1 ) ) {\\n print \\\"Here is the solution:\\\\n\\\";\\n substr( $output[1], 1, 2, '**' );\\n print @output;\\n} else {\\n print \\\"Could not solve!\\\\n\\\";\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\Maze_solving.exw\\n -- =============================\\n --</span>\\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;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">h</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">8</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> <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\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">amaze</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>\\n <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: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- mark cell visited</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shuffle</span><span style=\\\"color: #0000FF;\\\">({{</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">4</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: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">4</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: #000000;\\\">y</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;\\\">p</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;\\\">nx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ny</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>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">nx</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">nx</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">ny</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">ny</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">h</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">ny</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">nx</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">'?'</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">mx</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;\\\">nx</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">2</span>\\n <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;\\\">ny</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">mx</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">mx</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> <span style=\\\"color: #000080;font-style:italic;\\\">-- knock down wall</span>\\n <span style=\\\"color: #000000;\\\">amaze</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ny</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;\\\">procedure</span>\\n\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">dx</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">dy</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- door location (in a wall!)</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">solve_maze</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>\\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;\\\">x</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">4</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: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">4</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: #000000;\\\">y</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;\\\">d</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: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">nx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ny</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;\\\">d</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">wx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">wy</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;\\\">nx</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,(</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">ny</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">2</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;\\\">wy</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">wx</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;\\\">wy</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">wx</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"-:-:\\\"</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- mark path</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">wx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">wy</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: #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;\\\">if</span> <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">ny</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">nx</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;\\\">ny</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">nx</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">'o'</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- mark cell</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">solve_maze</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ny</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;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">ny</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">nx</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- unmark cell</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">wy</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">wx</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- unmark path</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;\\\">heads</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">rand</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: #000080;font-style:italic;\\\">-- toin coss 50:50 true(1)/false(0)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\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: #0000FF;\\\">{(</span><span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">rand</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;\\\">amaze</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: #000080;font-style:italic;\\\">-- mark start pos</span>\\n <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: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">'*'</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- add a random door (heads=rhs/lhs, tails=top/btm)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">heads</span><span style=\\\"color: #0000FF;\\\">()</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">dy</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dx</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">rand</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><span style=\\\"color: #000000;\\\">heads</span><span style=\\\"color: #0000FF;\\\">()*</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">dy</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">dx</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">' '</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">dy</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dx</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">heads</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><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">dy</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">dx</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">dx</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;\\\">if</span>\\n <span style=\\\"color: #0000FF;\\\">{}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">solve_maze</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: #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>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"main =>\\n Maze0 = [\\\"+---+---+---+---+---+---+---+---+\\\",\\n \\\"| | | | |\\\",\\n \\\"+ + + +---+ + +---+ +\\\",\\n \\\"| | | | | |\\\",\\n \\\"+---+---+ + +---+---+ + +\\\",\\n \\\"| | | | |\\\",\\n \\\"+---+ + + +---+---+---+ +\\\",\\n \\\"| | | | |\\\",\\n \\\"+ + + +---+---+---+ + +\\\",\\n \\\"| | | | | |\\\",\\n \\\"+ + + +---+ +---+---+ +\\\",\\n \\\"| | | | | |\\\",\\n \\\"+ +---+---+ +---+---+---+ +\\\",\\n \\\"| | | |\\\",\\n \\\"+ +---+ +---+ + +---+ +\\\",\\n \\\"| | | |\\\",\\n \\\"+---+---+---+---+---+---+---+---+\\\"],\\n MaxR = len(Maze0) div 2,\\n MaxC = len(Maze0[1]) div 4,\\n Maze = new_array(MaxR,MaxC),\\n foreach (R in 1..MaxR, C in 1..MaxC)\\n Maze[R,C] = 0\\n end,\\n fill_maze(Maze0,Maze,1),\\n solve_maze(Maze,(1,1),(MaxR,MaxC),Cost,Plan),\\n OutputMaze = new_array(MaxR,MaxC),\\n foreach ((R,C) in Plan)\\n OutputMaze[R,C] = '*'\\n end,\\n output_maze(Maze0,OutputMaze,1).\\n\\nfill_maze([Line1,Line2|Maze0],Maze,R) =>\\n fill_maze_cols(Line1,Maze,R,1),\\n fill_maze_cols(Line2,Maze,R,1),\\n fill_maze(Maze0,Maze,R+1).\\nfill_maze(_,_,_) => true.\\n\\nfill_maze_cols(['+',' ',' ',' '|Line],Maze,R,C) =>\\n Maze[R,C] := Maze[R,C] \\\\/ 4, % up\\n Maze[R-1,C] := Maze[R-1,C] \\\\/ 8, % down\\n fill_maze_cols(Line,Maze,R,C+1).\\nfill_maze_cols([' ',' ',' ',' '|Line],Maze,R,C) =>\\n Maze[R,C] := Maze[R,C] \\\\/ 1, % left\\n Maze[R,C-1] := Maze[R,C-1] \\\\/ 2, % right\\n fill_maze_cols(Line,Maze,R,C+1).\\nfill_maze_cols([_,_,_,_|Line],Maze,R,C) =>\\n fill_maze_cols(Line,Maze,R,C+1).\\nfill_maze_cols(_,_,_,_) => true.\\n\\ntable (+,+,+,min,-)\\nsolve_maze(_Maze,FPos,FPos,Cost,Plan) =>\\n Cost = 0,\\n Plan = [FPos].\\nsolve_maze(Maze,Pos@(R,C),FPos,Cost,Plan) ?=>\\n Maze[R,C] /\\\\ 1 == 1, % left\\n solve_maze(Maze,(R,C-1),FPos,Cost1,Plan1),\\n Plan = [Pos|Plan1],\\n Cost = Cost1+1.\\nsolve_maze(Maze,Pos@(R,C),FPos,Cost,Plan) ?=>\\n Maze[R,C] /\\\\ 2 == 2, % right\\n solve_maze(Maze,(R,C+1),FPos,Cost1,Plan1),\\n Plan = [Pos|Plan1],\\n Cost = Cost1+1.\\nsolve_maze(Maze,Pos@(R,C),FPos,Cost,Plan) ?=>\\n Maze[R,C] /\\\\ 4 == 4, % up\\n solve_maze(Maze,(R-1,C),FPos,Cost1,Plan1),\\n Plan = [Pos|Plan1],\\n Cost = Cost1+1.\\nsolve_maze(Maze,Pos@(R,C),FPos,Cost,Plan) ?=>\\n Maze[R,C] /\\\\ 8 == 8, % down\\n solve_maze(Maze,(R+1,C),FPos,Cost1,Plan1),\\n Plan = [Pos|Plan1],\\n Cost = Cost1+1.\\n\\noutput_maze([Line1,Line2|Maze0],Maze,R) =>\\n output_maze_cols(Line1,Maze,R,1),\\n output_maze_cols(Line2,Maze,R,1),\\n output_maze(Maze0,Maze,R+1).\\noutput_maze([Line],_,_) => println(Line).\\n\\noutput_maze_cols([' ',' ',' ',' '|Line],Maze,R,C) =>\\n if Maze[R,C] == '*' then\\n print(\\\" * \\\")\\n else\\n print(\\\" \\\")\\n end,\\n output_maze_cols(Line,Maze,R,C+1).\\noutput_maze_cols(['|',' ',' ',' '|Line],Maze,R,C) =>\\n if Maze[R,C] == '*' then\\n print(\\\"| * \\\")\\n else\\n print(\\\"| \\\")\\n end,\\n output_maze_cols(Line,Maze,R,C+1).\\noutput_maze_cols(['+',' ',' ',' '|Line],Maze,R,C) =>\\n if Maze[R,C] == '*' && Maze[R-1,C] == '*' then\\n print(\\\"+ * \\\")\\n else\\n print(\\\"+ \\\")\\n end,\\n output_maze_cols(Line,Maze,R,C+1).\\noutput_maze_cols([C1,C2,C3,C4|Line],Maze,R,C) =>\\n printf(\\\"%c%c%c%c\\\",C1,C3,C3,C4),\\n output_maze_cols(Line,Maze,R,C+1).\\noutput_maze_cols(Line,_,_,_) => println(Line).\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de shortestPath (Goal This Maze)\\n (let (Path NIL Best NIL Dir \\\" > \\\")\\n (recur (This Path Dir)\\n (when (and This (not (: mark)))\\n (push 'Path (cons This Dir))\\n (if (== Goal This)\\n (unless (and Best (>= (length Path) (length Best)))\\n (setq Best Path) )\\n (=: mark T)\\n (recurse (: west) Path \\\" > \\\")\\n (recurse (: east) Path \\\" < \\\")\\n (recurse (: south) Path \\\" \\\\^ \\\")\\n (recurse (: north) Path \\\" v \\\")\\n (=: mark NIL) ) ) )\\n (disp Maze 0\\n '((Fld) (if (asoq Fld Best) (cdr @) \\\" \\\")) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \":- dynamic cell/2.\\n:- dynamic maze/3.\\n:- dynamic path/1.\\n\\nmaze_solve(Lig,Col) :-\\n\\tretractall(cell(_,_)),\\n\\tretractall(maze(_,_,_)),\\n\\tretractall(path(_)),\\n\\n\\t% initialisation of the neighbours of the cells\\n\\tforall(between(0, Lig, I),\\n\\t ( forall(between(0, Col, J), assert(maze(I, J, []))))),\\n\\n\\t% creation of the window of the maze\\n\\tnew(D, window('Maze')),\\n\\tforall(between(0,Lig, I),\\n\\t (XL is 50, YL is I * 30 + 50,\\n\\t\\tXR is Col * 30 + 50,\\n\\t\\tnew(L, line(XL, YL, XR, YL)),\\n\\t\\tsend(D, display, L))),\\n\\n\\tforall(between(0,Col, I),\\n\\t (XT is 50 + I * 30, YT is 50,\\n\\t\\tYB is Lig * 30 + 50,\\n\\t\\tnew(L, line(XT, YT, XT, YB)),\\n\\t\\tsend(D, display, L))),\\n\\n\\tSX is Col * 30 + 100,\\n\\tSY is Lig * 30 + 100,\\n\\tsend(D, size, new(_, size(SX, SY))),\\n\\tL0 is random(Lig),\\n\\tC0 is random(Col),\\n\\tassert(cell(L0, C0)),\\n\\t\\\\+search(D, Lig, Col, L0, C0),\\n\\tsend(D, open),\\n\\n\\t% we look for a path from cell(0, 0) to cell(Lig-1, Col-1)\\n\\t% creation of the entrance\\n\\terase_line(D, -1, 0, 0, 0),\\n\\n\\t% creation of the exit\\n\\tLig1 is Lig-1,\\n\\tCol1 is Col-1,\\n\\terase_line(D, Lig1, Col1, Lig, Col1),\\n\\n\\t% seraching the path\\n\\tassert(path([[0, 0], [-1, 0]])),\\n\\twalk(Lig, Col),\\n\\tpath(P),\\n\\tdisplay_path(D, P).\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\nwalk(Lig, Col) :-\\n\\tpath([[L, C] | _R]),\\n\\tL is Lig - 1,\\n\\tC is Col - 1,\\n\\tretract(path(P)),\\n\\tassert(path([[Lig, C]|P])).\\n\\nwalk(Lig, Col) :-\\n\\tretract(path([[L, C] | R])),\\n\\tmaze(L, C, Edge),\\n\\tmember([L1, C1], Edge),\\n\\t\\\\+member([L1, C1], R),\\n\\tassert(path([[L1,C1], [L, C] | R])),\\n\\twalk(Lig, Col).\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\ndisplay_path(_, []).\\n\\ndisplay_path(D, [[L, C] | R]):-\\n\\tnew(B, box(10,10)),\\n\\tsend(B, fill_pattern, new(_, colour(@default, 0,0,0))),\\n\\tX is C * 30 + 60,\\n\\tY is L * 30 + 60,\\n\\tsend(D, display, B, point(X,Y)),\\n\\tdisplay_path(D, R).\\n\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\nsearch(D, Lig, Col, L, C) :-\\n\\tDir is random(4),\\n\\tnextcell(Dir, Lig, Col, L, C, L1, C1),\\n\\tassert(cell(L1,C1)),\\n\\tassert(cur(L1,C1)),\\n\\n\\tretract(maze(L, C, Edge)),\\n\\tassert(maze(L, C, [[L1, C1] | Edge])),\\n\\tretract(maze(L1, C1, Edge1)),\\n\\tassert(maze(L1, C1, [[L, C] | Edge1])),\\n\\n\\terase_line(D, L, C, L1, C1),\\n\\tsearch(D, Lig, Col, L1, C1).\\n\\n\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\nerase_line(D, L, C, L, C1) :-\\n\\t( C < C1 -> C2 = C1; C2 = C),\\n\\tXT is C2 * 30 + 50,\\n\\tYT is L * 30 + 51, YR is (L+1) * 30 + 50,\\n\\tnew(Line, line(XT, YT, XT, YR)),\\n\\tsend(Line, colour, white),\\n\\tsend(D, display, Line).\\n\\nerase_line(D, L, C, L1, C) :-\\n\\tXT is 51 + C * 30, XR is 50 + (C + 1) * 30,\\n\\t( L < L1 -> L2 is L1; L2 is L),\\n\\tYT is L2 * 30 + 50,\\n\\tnew(Line, line(XT, YT, XR, YT)),\\n\\tsend(Line, colour, white),\\n\\tsend(D, display, Line).\\n\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\nnextcell(Dir, Lig, Col, L, C, L1, C1) :-\\n\\tnext(Dir, Lig, Col, L, C, L1, C1);\\n\\t( Dir1 is (Dir+3) mod 4,\\n\\t next(Dir1, Lig, Col, L, C, L1, C1));\\n\\t( Dir2 is (Dir+1) mod 4,\\n\\t next(Dir2, Lig, Col, L, C, L1, C1));\\n\\t( Dir3 is (Dir+2) mod 4,\\n\\t next(Dir3, Lig, Col, L, C, L1, C1)).\\n\\n% 0 => northward\\nnext(0, _Lig, _Col, L, C, L1, C) :-\\n\\tL > 0,\\n\\tL1 is L - 1,\\n\\t\\\\+cell(L1, C).\\n\\n% 1 => rightward\\nnext(1, _Lig, Col, L, C, L, C1) :-\\n\\tC < Col - 1,\\n\\tC1 is C + 1,\\n\\t\\\\+cell(L, C1).\\n\\n% 2 => southward\\nnext(2, Lig, _Col, L, C, L1, C) :-\\n\\tL < Lig - 1,\\n\\tL1 is L + 1,\\n\\t\\\\+cell(L1, C).\\n\\n% 3 => leftward\\nnext(2, _Lig, _Col, L, C, L, C1) :-\\n\\tC > 0,\\n\\tC1 is C - 1,\\n\\t\\\\+cell(L, C1).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \";code from the maze generation task is place here in its entirety before the rest of the code\\n\\nProcedure displayMazePath(Array maze(2), List Path.POINT())\\n Protected x, y, vWall.s, hWall.s\\n Protected mazeWidth = ArraySize(maze(), 1), mazeHeight = ArraySize(maze(), 2)\\n Protected Dim mazeOutput.mazeOutput(mazeHeight)\\n Protected Dim mazeRow.mazeOutput(0)\\n Static pathChars.s = \\\"@^>v<\\\"\\n\\n For y = 0 To mazeHeight\\n makeDisplayMazeRow(mazeRow(), maze(), y): mazeOutput(y) = mazeRow(0)\\n Next\\n\\n If ListSize(path())\\n FirstElement(path())\\n Protected prevPath.POINT = path()\\n\\n While NextElement(path())\\n x = path()\\\\x - prevPath\\\\x\\n y = path()\\\\y - prevPath\\\\y\\n Select x\\n Case -1: dirTaken = #dir_W\\n Case 1: dirTaken = #dir_E\\n Default\\n If y < 0\\n dirTaken = #dir_N\\n Else\\n dirTaken = #dir_S\\n EndIf\\n EndSelect\\n hWall = mazeOutput(prevPath\\\\y)\\\\hWall\\n mazeOutput(prevPath\\\\y)\\\\hWall = Left(hWall, prevPath\\\\x * #cellDWidth + 2) + Mid(pathChars, dirTaken + 1, 1) + Right(hWall, Len(hWall) - (prevPath\\\\x * #cellDWidth + 3))\\n prevPath = path()\\n Wend\\n hWall = mazeOutput(prevPath\\\\y)\\\\hWall\\n mazeOutput(prevPath\\\\y)\\\\hWall = Left(hWall, prevPath\\\\x * #cellDWidth + 2) + Mid(pathChars, #dir_ID + 1, 1) + Right(hWall, Len(hWall) - (prevPath\\\\x * #cellDWidth + 3))\\n\\n For y = 0 To mazeHeight\\n PrintN(mazeOutput(y)\\\\vWall): PrintN(mazeOutput(y)\\\\hWall)\\n Next\\n EndIf\\nEndProcedure\\n\\nProcedure solveMaze(Array maze(2), *start.POINT, *finish.POINT, List Path.POINT())\\n Protected mazeWidth = ArraySize(maze(), 1), mazeHeight = ArraySize(maze(), 2)\\n Dim visited(mazeWidth + 1, mazeHeight + 1) ;includes padding for easy border detection\\n\\n Protected i\\n ;mark outside border as already visited (off limits)\\n For i = 1 To mazeWidth\\n visited(i, 0) = #True: visited(i, mazeHeight + 1) = #True\\n Next\\n For i = 1 To mazeHeight\\n visited(0, i) = #True: visited(mazeWidth + 1, i) = #True\\n Next\\n\\n Protected x = *start\\\\x, y = *start\\\\y, nextCellDir\\n visited(x + offset(#visited, #dir_ID)\\\\x, y + offset(#visited, #dir_ID)\\\\y) = #True\\n\\n ClearList(path())\\n Repeat\\n If x = *finish\\\\x And y = *finish\\\\y\\n AddElement(path())\\n path()\\\\x = x: path()\\\\y = y\\n Break ;success\\n EndIf\\n\\n nextCellDir = #firstDir - 1\\n For i = #firstDir To #numDirs\\n If Not visited(x + offset(#visited, i)\\\\x, y + offset(#visited, i)\\\\y)\\n If maze(x + offset(#wall, i)\\\\x, y + offset(#wall, i)\\\\y) & wallvalue(i) <> #Null\\n nextCellDir = i: Break ;exit for/next search\\n EndIf\\n EndIf\\n Next\\n\\n If nextCellDir >= #firstDir\\n visited(x + offset(#visited, nextCellDir)\\\\x, y + offset(#visited, nextCellDir)\\\\y) = #True\\n\\n AddElement(path())\\n path()\\\\x = x: path()\\\\y = y\\n\\n x + offset(#maze, nextCellDir)\\\\x: y + offset(#maze, nextCellDir)\\\\y\\n ElseIf ListSize(path()) > 0\\n x = path()\\\\x: y = path()\\\\y\\n DeleteElement(path())\\n Else\\n Break\\n EndIf\\n ForEver\\n\\nEndProcedure\\n\\n;demonstration\\nIf OpenConsole()\\n Define.POINT start, finish\\n start\\\\x = Random(mazeWidth - 1): start\\\\y = Random(mazeHeight - 1)\\n finish\\\\x = Random(mazeWidth - 1): finish\\\\y = Random(mazeHeight - 1)\\n NewList Path.POINT()\\n solveMaze(maze(), start, finish, path())\\n If ListSize(path()) > 0\\n PrintN(\\\"Solution found for path between (\\\" + Str(start\\\\x) + \\\", \\\" + Str(start\\\\y) + \\\") and (\\\" + Str(finish\\\\x) + \\\", \\\" + Str(finish\\\\y) + \\\")\\\")\\n displayMazePath(maze(), path())\\n Else\\n PrintN(\\\"No solution found for path between (\\\" + Str(start\\\\x) + \\\", \\\" + Str(start\\\\y) + \\\") and (\\\" + Str(finish\\\\x) + \\\", \\\" + Str(finish\\\\y) + \\\")\\\")\\n EndIf\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\"): Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"# python 3\\n\\ndef Dijkstra(Graph, source):\\n '''\\n + +---+---+\\n | 0 1 2 |\\n +---+ + +\\n | 3 4 | 5\\n +---+---+---+\\n\\n >>> graph = ( # or ones on the diagonal\\n ... (0,1,0,0,0,0,),\\n ... (1,0,1,0,1,0,),\\n ... (0,1,0,0,0,1,),\\n ... (0,0,0,0,1,0,),\\n ... (0,1,0,1,0,0,),\\n ... (0,0,1,0,0,0,),\\n ... )\\n ...\\n >>> Dijkstra(graph, 0)\\n ([0, 1, 2, 3, 2, 3], [1e+140, 0, 1, 4, 1, 2])\\n >>> display_solution([1e+140, 0, 1, 4, 1, 2])\\n 5<2<1<0\\n '''\\n # Graph[u][v] is the weight from u to v (however 0 means infinity)\\n infinity = float('infinity')\\n n = len(graph)\\n dist = [infinity]*n # Unknown distance function from source to v\\n previous = [infinity]*n # Previous node in optimal path from source\\n dist[source] = 0 # Distance from source to source\\n Q = list(range(n)) # All nodes in the graph are unoptimized - thus are in Q\\n while Q: # The main loop\\n u = min(Q, key=lambda n:dist[n]) # vertex in Q with smallest dist[]\\n Q.remove(u)\\n if dist[u] == infinity:\\n break # all remaining vertices are inaccessible from source\\n for v in range(n): # each neighbor v of u\\n if Graph[u][v] and (v in Q): # where v has not yet been visited\\n alt = dist[u] + Graph[u][v]\\n if alt < dist[v]: # Relax (u,v,a)\\n dist[v] = alt\\n previous[v] = u\\n return dist,previous\\n\\ndef display_solution(predecessor):\\n cell = len(predecessor)-1\\n while cell:\\n print(cell,end='<')\\n cell = predecessor[cell]\\n print(0)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \";; Returns a path connecting two given cells in the maze\\n;; find-path :: Maze Cell Cell -> (Listof Cell)\\n(define (find-path m p1 p2)\\n (match-define (maze N M tbl) m)\\n (define (alternatives p prev) (remove prev (connections tbl p)))\\n (define (dead-end? p prev) (empty? (alternatives p prev)))\\n (define ((next-turn route) p)\\n (define prev (car route))\\n (cond\\n [(equal? p p2) (cons p2 route)]\\n [(dead-end? p prev) '()]\\n [else (append-map (next-turn (cons p route))\\n (alternatives p prev))]))\\n (reverse\\n (append-map (next-turn (list p1))\\n (alternatives p1 (list p1)))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \";; Reads the maze from the textual form\\n;; read-maze :: File-path -> Maze\\n(define (read-maze file)\\n (define tbl (make-hash))\\n (with-input-from-file file\\n (λ ()\\n ; the first line gives us the width of the maze\\n (define N (/ (- (string-length (read-line)) 1) 4))\\n ; while reading other lines we get the height of the maze\\n (define M\\n (for/sum ([h (in-lines)] [v (in-lines)] [j (in-naturals)])\\n (for ([i (in-range N)])\\n (when (eq? #\\\\space (string-ref h (* 4 (+ 1 i))))\\n (connect! tbl (list i j) (list (+ i 1) j)))\\n (when (eq? #\\\\space (string-ref v (+ 1 (* 4 i))))\\n (connect! tbl (list i j) (list i (+ j 1)))))\\n 1))\\n (maze N M tbl))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \";; Shows a maze with a path connecting two given cells\\n(define (show-path m p1 p2)\\n (match-define (maze N M tbl) m)\\n (define route (find-path m p1 p2))\\n (for ([i N]) (display \\\"+---\\\"))\\n (displayln \\\"+\\\")\\n (for ([j M])\\n (display \\\"|\\\")\\n (for ([i (- N 0)])\\n (if (member (list i j) route)\\n (display \\\" *\\\")\\n (display \\\" \\\"))\\n (if (connected? tbl (list i j) (list (+ 1 i) j))\\n (display \\\" \\\")\\n (display \\\" |\\\")))\\n (newline)\\n (for ([i N])\\n (if (connected? tbl (list i j) (list i (+ j 1)))\\n (display \\\"+ \\\")\\n (display \\\"+---\\\")))\\n (displayln \\\"+\\\"))\\n (newline))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"constant mapping = :OPEN(' '),\\n\\t\\t :N< ╵ >,\\n\\t\\t :E< ╶ >,\\n\\t\\t :NE< └ >,\\n\\t\\t :S< ╷ >,\\n\\t\\t :NS< │ >,\\n\\t\\t :ES< ┌ >,\\n\\t\\t :NES< ├ >,\\n\\t\\t :W< ╴ >,\\n\\t\\t :NW< ┘ >,\\n\\t\\t :EW< ─ >,\\n\\t\\t :NEW< ┴ >,\\n\\t\\t :SW< ┐ >,\\n\\t\\t :NSW< ┤ >,\\n\\t\\t :ESW< ┬ >,\\n\\t\\t :NESW< ┼ >,\\n\\t\\t :TODO< x >,\\n\\t :TRIED< · >;\\n\\nenum Sym (mapping.map: *.key);\\nmy @ch = mapping.map: *.value;\\n\\nenum Direction <DeadEnd Up Right Down Left>;\\n\\nsub gen_maze ( $X,\\n $Y,\\n $start_x = (^$X).pick * 2 + 1,\\n $start_y = (^$Y).pick * 2 + 1 )\\n{\\n my @maze;\\n push @maze, $[ flat ES, -N, (ESW, EW) xx $X - 1, SW ];\\n push @maze, $[ flat (NS, TODO) xx $X, NS ];\\n for 1 ..^ $Y {\\n\\tpush @maze, $[ flat NES, EW, (NESW, EW) xx $X - 1, NSW ];\\n\\tpush @maze, $[ flat (NS, TODO) xx $X, NS ];\\n }\\n push @maze, $[ flat NE, (EW, NEW) xx $X - 1, -NS, NW ];\\n @maze[$start_y][$start_x] = OPEN;\\n\\n my @stack;\\n my $current = [$start_x, $start_y];\\n loop {\\n if my $dir = pick_direction( $current ) {\\n @stack.push: $current;\\n $current = move( $dir, $current );\\n }\\n else {\\n last unless @stack;\\n $current = @stack.pop;\\n }\\n }\\n return @maze;\\n\\n sub pick_direction([$x,$y]) {\\n\\tmy @neighbors =\\n\\t (Up if @maze[$y - 2][$x]),\\n\\t (Down if @maze[$y + 2][$x]),\\n\\t (Left if @maze[$y][$x - 2]),\\n\\t (Right if @maze[$y][$x + 2]);\\n\\t@neighbors.pick or DeadEnd;\\n }\\n\\n sub move ($dir, @cur) {\\n\\tmy ($x,$y) = @cur;\\n\\tgiven $dir {\\n\\t when Up { @maze[--$y][$x] = OPEN; @maze[$y][$x-1] -= E; @maze[$y--][$x+1] -= W; }\\n\\t when Down { @maze[++$y][$x] = OPEN; @maze[$y][$x-1] -= E; @maze[$y++][$x+1] -= W; }\\n\\t when Left { @maze[$y][--$x] = OPEN; @maze[$y-1][$x] -= S; @maze[$y+1][$x--] -= N; }\\n\\t when Right { @maze[$y][++$x] = OPEN; @maze[$y-1][$x] -= S; @maze[$y+1][$x++] -= N; }\\n\\t}\\n\\t@maze[$y][$x] = 0;\\n\\t[$x,$y];\\n }\\n}\\n\\nsub display (@maze) {\\n for @maze -> @y {\\n\\tfor @y.rotor(2) -> ($w, $c) {\\n\\t print @ch[abs $w];\\n\\t if $c >= 0 { print @ch[$c] x 3 }\\n\\t else { print ' ', @ch[abs $c], ' ' }\\n\\t}\\n\\tsay @ch[@y[*-1]];\\n }\\n}\\n\\nsub solve (@maze is copy, @from = [1, 1], @to = [@maze[0] - 2, @maze - 2]) {\\n my ($x, $y) = @from;\\n my ($xto, $yto) = @to;\\n my @stack;\\n\\n sub drop-crumb($x,$y,$c) { @maze[$y][$x] = -$c }\\n drop-crumb($x,$y,N);\\n\\n loop {\\n\\tmy $dir = pick_direction([$x,$y]);\\n\\tif $dir {\\n\\t ($x, $y) = move($dir, [$x,$y]);\\n\\t return @maze if $x == $xto and $y == $yto;\\n\\t}\\n\\telse {\\n\\t @maze[$y][$x] = -TRIED;\\n\\t ($x,$y) = @stack.pop;\\n\\t @maze[$y][$x] = -TRIED;\\n\\t ($x,$y) = @stack.pop;\\n\\t}\\n }\\n\\n sub pick_direction([$x,$y]) {\\n\\tmy @neighbors =\\n\\t (Up unless @maze[$y - 1][$x]),\\n\\t (Down unless @maze[$y + 1][$x]),\\n\\t (Left unless @maze[$y][$x - 1]),\\n\\t (Right unless @maze[$y][$x + 1]);\\n\\t@neighbors.pick or DeadEnd;\\n }\\n\\n sub move ($dir, @cur) {\\n\\tmy ($x,$y) = @cur;\\n\\tgiven $dir {\\n\\t when Up { for ^2 { push @stack, $[$x,$y--]; drop-crumb $x,$y,S; } }\\n\\t when Down { for ^2 { push @stack, $[$x,$y++]; drop-crumb $x,$y,N; } }\\n\\t when Left { for ^2 { push @stack, $[$x--,$y]; drop-crumb $x,$y,E; } }\\n\\t when Right { for ^2 { push @stack, $[$x++,$y]; drop-crumb $x,$y,W; } }\\n\\t}\\n\\t$x,$y;\\n }\\n}\\n\\ndisplay solve gen_maze( 29, 19 );\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"Red [\\\"Maze solver\\\"]\\n\\ndo %mazegen.red\\t\\nprint [\\n\\t\\\"start:\\\" start: random size - 1x1\\n\\t\\\"end:\\\" end: random size - 1x1\\n]\\nisnew?: function [pos] [not find visited pos]\\nopen?: function [pos d] [\\n\\to: pos/y * size/x + pos/x + 1\\n\\t0 = pick walls/:o d\\n]\\nexpand: function [pos][\\n\\teither any [\\n\\t\\tall [pos/x > 0 isnew? p: pos - 1x0 open? p 1]\\n\\t\\tall [pos/x < (size/x - 1) isnew? p: pos + 1x0 open? pos 1]\\n\\t\\tall [pos/y > 0 isnew? p: pos - 0x1 open? p 2]\\n\\t\\tall [pos/y < (size/y - 1) isnew? p: pos + 0x1 open? pos 2]\\n\\t][append visited p insert path p][remove path]\\n\\tpath/1\\n]\\npath: reduce [start]\\nvisited: []\\nuntil [end = expand path/1]\\nprint reverse path\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"class Maze\\n # Solve via breadth-first algorithm.\\n # Each queue entry is a path, that is list of coordinates with the\\n # last coordinate being the one that shall be visited next.\\n def solve\\n\\n # Clean up.\\n reset_visiting_state\\n\\n # Enqueue start position.\\n @queue = []\\n enqueue_cell([], @start_x, @start_y)\\n\\n # Loop as long as there are cells to visit and no solution has\\n # been found yet.\\n path = nil\\n until path || @queue.empty?\\n path = solve_visit_cell\\n end\\n\\n if path\\n # Mark the cells that make up the shortest path.\\n for x, y in path\\n @path[x][y] = true\\n end\\n else\\n puts \\\"No solution found?!\\\"\\n end\\n end\\n\\n private\\n\\n # Maze solving visiting method.\\n def solve_visit_cell\\n # Get the next path.\\n path = @queue.shift\\n # The cell to visit is the last entry in the path.\\n x, y = path.last\\n\\n # Have we reached the end yet?\\n return path if x == @end_x && y == @end_y\\n\\n # Mark cell as visited.\\n @visited[x][y] = true\\n\\n for dx, dy in DIRECTIONS\\n if dx.nonzero?\\n # Left / Right\\n new_x = x + dx\\n if move_valid?(new_x, y) && !@vertical_walls[ [x, new_x].min ][y]\\n enqueue_cell(path, new_x, y)\\n end\\n else\\n # Top / Bottom\\n new_y = y + dy\\n if move_valid?(x, new_y) && !@horizontal_walls[x][ [y, new_y].min ]\\n enqueue_cell(path, x, new_y)\\n end\\n end\\n end\\n\\n nil # No solution yet.\\n end\\n\\n # Enqueue a new coordinate to visit.\\n def enqueue_cell(path, x, y)\\n # Add new coordinates to the current path and enqueue the new path.\\n @queue << path + [[x, y]]\\n end\\nend\\n\\n# Demonstration:\\nmaze = Maze.new 20, 10\\nmaze.solve\\nmaze.print\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use rand::{thread_rng, Rng, rngs::ThreadRng};\\n\\nconst WIDTH: usize = 16;\\nconst HEIGHT: usize = 16;\\n\\n#[derive(Clone, Copy, PartialEq)]\\nstruct Cell {\\n col: usize,\\n row: usize,\\n}\\n\\nimpl Cell {\\n fn from(col: usize, row: usize) -> Cell {\\n Cell {col, row}\\n }\\n}\\n\\nstruct Maze {\\n cells: [[bool; HEIGHT]; WIDTH], //cell visited/non visited\\n walls_h: [[bool; WIDTH]; HEIGHT + 1], //horizontal walls existing/removed\\n walls_v: [[bool; WIDTH + 1]; HEIGHT], //vertical walls existing/removed\\n thread_rng: ThreadRng, //Random numbers generator\\n}\\n\\nimpl Maze {\\n\\n ///Inits the maze, with all the cells unvisited and all the walls active\\n fn new() -> Maze {\\n Maze {\\n cells: [[true; HEIGHT]; WIDTH],\\n walls_h: [[true; WIDTH]; HEIGHT + 1],\\n walls_v: [[true; WIDTH + 1]; HEIGHT],\\n thread_rng: thread_rng(),\\n }\\n }\\n\\n ///Randomly chooses the starting cell\\n fn first(&mut self) -> Cell {\\n Cell::from(self.thread_rng.gen_range(0, WIDTH), self.thread_rng.gen_range(0, HEIGHT))\\n }\\n\\n ///Opens the enter and exit doors\\n fn open_doors(&mut self) {\\n let from_top: bool = self.thread_rng.gen();\\n let limit = if from_top { WIDTH } else { HEIGHT };\\n let door = self.thread_rng.gen_range(0, limit);\\n let exit = self.thread_rng.gen_range(0, limit);\\n if from_top {\\n self.walls_h[0][door] = false;\\n self.walls_h[HEIGHT][exit] = false;\\n } else {\\n self.walls_v[door][0] = false;\\n self.walls_v[exit][WIDTH] = false;\\n }\\n }\\n\\n ///Removes a wall between the two Cell arguments\\n fn remove_wall(&mut self, cell1: &Cell, cell2: &Cell) {\\n if cell1.row == cell2.row {\\n self.walls_v[cell1.row][if cell1.col > cell2.col { cell1.col } else { cell2.col }] = false;\\n } else {\\n self.walls_h[if cell1.row > cell2.row { cell1.row } else { cell2.row }][cell1.col] = false;\\n };\\n }\\n\\n ///Returns a random non-visited neighbor of the Cell passed as argument\\n fn neighbor(&mut self, cell: &Cell) -> Option<Cell> {\\n self.cells[cell.col][cell.row] = false;\\n let mut neighbors = Vec::new();\\n if cell.col > 0 && self.cells[cell.col - 1][cell.row] { neighbors.push(Cell::from(cell.col - 1, cell.row)); }\\n if cell.row > 0 && self.cells[cell.col][cell.row - 1] { neighbors.push(Cell::from(cell.col, cell.row - 1)); }\\n if cell.col < WIDTH - 1 && self.cells[cell.col + 1][cell.row] { neighbors.push(Cell::from(cell.col + 1, cell.row)); }\\n if cell.row < HEIGHT - 1 && self.cells[cell.col][cell.row + 1] { neighbors.push(Cell::from(cell.col, cell.row + 1)); }\\n if neighbors.is_empty() {\\n None\\n } else {\\n let next = neighbors.get(self.thread_rng.gen_range(0, neighbors.len())).unwrap();\\n self.remove_wall(cell, next);\\n Some(*next)\\n }\\n }\\n\\n ///Builds the maze (runs the Depth-first search algorithm)\\n fn build(&mut self) {\\n let mut cell_stack: Vec<Cell> = Vec::new();\\n let mut next = self.first();\\n loop {\\n while let Some(cell) = self.neighbor(&next) {\\n cell_stack.push(cell);\\n next = cell;\\n }\\n match cell_stack.pop() {\\n Some(cell) => next = cell,\\n None => break,\\n }\\n }\\n }\\n\\n ///MAZE SOLVING: Find the starting cell of the solution\\n fn solution_first(&self) -> Option<Cell> {\\n for (i, wall) in self.walls_h[0].iter().enumerate() {\\n if !wall {\\n return Some(Cell::from(i, 0));\\n }\\n }\\n for (i, wall) in self.walls_v.iter().enumerate() {\\n if !wall[0] {\\n return Some(Cell::from(0, i));\\n }\\n }\\n None\\n }\\n\\n ///MAZE SOLVING: Find the last cell of the solution\\n fn solution_last(&self) -> Option<Cell> {\\n for (i, wall) in self.walls_h[HEIGHT].iter().enumerate() {\\n if !wall {\\n return Some(Cell::from(i, HEIGHT - 1));\\n }\\n }\\n for (i, wall) in self.walls_v.iter().enumerate() {\\n if !wall[WIDTH] {\\n return Some(Cell::from(WIDTH - 1, i));\\n }\\n }\\n None\\n }\\n\\n ///MAZE SOLVING: Get the next candidate cell\\n fn solution_next(&mut self, cell: &Cell) -> Option<Cell> {\\n self.cells[cell.col][cell.row] = false;\\n let mut neighbors = Vec::new();\\n if cell.col > 0 && self.cells[cell.col - 1][cell.row] && !self.walls_v[cell.row][cell.col] { neighbors.push(Cell::from(cell.col - 1, cell.row)); }\\n if cell.row > 0 && self.cells[cell.col][cell.row - 1] && !self.walls_h[cell.row][cell.col] { neighbors.push(Cell::from(cell.col, cell.row - 1)); }\\n if cell.col < WIDTH - 1 && self.cells[cell.col + 1][cell.row] && !self.walls_v[cell.row][cell.col + 1] { neighbors.push(Cell::from(cell.col + 1, cell.row)); }\\n if cell.row < HEIGHT - 1 && self.cells[cell.col][cell.row + 1] && !self.walls_h[cell.row + 1][cell.col] { neighbors.push(Cell::from(cell.col, cell.row + 1)); }\\n if neighbors.is_empty() {\\n None\\n } else {\\n let next = neighbors.get(self.thread_rng.gen_range(0, neighbors.len())).unwrap();\\n Some(*next)\\n }\\n }\\n\\n ///MAZE SOLVING: solve the maze\\n ///Uses self.cells to store the solution cells (true)\\n fn solve(&mut self) {\\n self.cells = [[true; HEIGHT]; WIDTH];\\n let mut solution: Vec<Cell> = Vec::new();\\n let mut next = self.solution_first().unwrap();\\n solution.push(next);\\n let last = self.solution_last().unwrap();\\n 'main: loop {\\n while let Some(cell) = self.solution_next(&next) {\\n solution.push(cell);\\n if cell == last {\\n break 'main;\\n }\\n next = cell;\\n }\\n solution.pop().unwrap();\\n next = *solution.last().unwrap();\\n }\\n self.cells = [[false; HEIGHT]; WIDTH];\\n for cell in solution {\\n self.cells[cell.col][cell.row] = true;\\n }\\n }\\n\\n ///MAZE SOLVING: Ask if cell is part of the solution (cells[col][row] == true)\\n fn is_solution(&self, col: usize, row: usize) -> bool {\\n self.cells[col][row]\\n }\\n\\n ///Displays a wall\\n ///MAZE SOLVING: Leave space for printing '*' if cell is part of the solution\\n /// (only when painting vertical walls)\\n ///\\n // fn paint_wall(h_wall: bool, active: bool) {\\n // if h_wall {\\n // print!(\\\"{}\\\", if active { \\\"+---\\\" } else { \\\"+ \\\" });\\n // } else {\\n // print!(\\\"{}\\\", if active { \\\"| \\\" } else { \\\" \\\" });\\n // }\\n // }\\n fn paint_wall(h_wall: bool, active: bool, with_solution: bool) {\\n if h_wall {\\n print!(\\\"{}\\\", if active { \\\"+---\\\" } else { \\\"+ \\\" });\\n } else {\\n print!(\\\"{}{}\\\", if active { \\\"|\\\" } else { \\\" \\\" }, if with_solution { \\\"\\\" } else { \\\" \\\" });\\n }\\n }\\n\\n ///MAZE SOLVING: Paint * if cell is part of the solution\\n fn paint_solution(is_part: bool) {\\n print!(\\\"{}\\\", if is_part { \\\" * \\\" } else {\\\" \\\"});\\n }\\n\\n ///Displays a final wall for a row\\n fn paint_close_wall(h_wall: bool) {\\n if h_wall { println!(\\\"+\\\") } else { println!() }\\n }\\n\\n ///Displays a whole row of walls\\n ///MAZE SOLVING: Displays a whole row of walls and, optionally, the included solution cells.\\n // fn paint_row(&self, h_walls: bool, index: usize) {\\n // let iter = if h_walls { self.walls_h[index].iter() } else { self.walls_v[index].iter() };\\n // for &wall in iter {\\n // Maze::paint_wall(h_walls, wall);\\n // }\\n // Maze::paint_close_wall(h_walls);\\n // }\\n fn paint_row(&self, h_walls: bool, index: usize, with_solution: bool) {\\n let iter = if h_walls { self.walls_h[index].iter() } else { self.walls_v[index].iter() };\\n for (col, &wall) in iter.enumerate() {\\n Maze::paint_wall(h_walls, wall, with_solution);\\n if !h_walls && with_solution && col < WIDTH {\\n Maze::paint_solution(self.is_solution(col, index));\\n }\\n }\\n Maze::paint_close_wall(h_walls);\\n }\\n\\n ///Paints the maze\\n ///MAZE SOLVING: Displaying the solution is an option\\n // fn paint(&self) {\\n // for i in 0 .. HEIGHT {\\n // self.paint_row(true, i);\\n // self.paint_row(false, i);\\n // }\\n // self.paint_row(true, HEIGHT);\\n // }\\n fn paint(&self, with_solution: bool) {\\n for i in 0 .. HEIGHT {\\n self.paint_row(true, i, with_solution);\\n self.paint_row(false, i, with_solution);\\n }\\n self.paint_row(true, HEIGHT, with_solution);\\n }\\n}\\n\\nfn main() {\\n let mut maze = Maze::new();\\n maze.build();\\n maze.open_doors();\\n\\n println!(\\\"The maze:\\\");\\n maze.paint(false);\\n\\n maze.solve();\\n println!(\\\"The maze, solved:\\\");\\n maze.paint(true);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"oo::define maze {\\n method solve {} {\\n\\t### Initialization of visited matrix and location/path queue\\n\\tset visited [lrepeat $x [lrepeat $y 0]]\\n\\tset queue {0 0 {}}\\n\\n\\t### Loop to do the searching ###\\n\\twhile 1 {\\n\\t # Check for running out of path; an error in maze construction\\n\\t if {[llength $queue] == 0} {\\n\\t\\terror \\\"cannot reach finish\\\"\\n\\t }\\n\\t # Visit the next square from the queue\\n\\t set queue [lassign $queue cx cy path]\\n\\t if {[lindex $visited $cx $cy]} continue\\n\\t lset visited $cx $cy 1\\n\\t lappend path $cx $cy\\n\\t # Check for reaching the goal\\n\\t if {$cx == $x-1 && $cy == $y-1} break\\n\\t # Add the square in each direction to the queue if a move there is legal\\n\\t foreach {dx dy} {0 1 1 0 0 -1 -1 0} {\\n\\t\\tset nx [expr {$cx + $dx}]; set ny [expr {$cy + $dy}]\\n\\t\\tif {\\n\\t\\t $nx >= 0 && $nx < $x && $ny >= 0 && $ny < $y\\n\\t\\t && ($dx && idx($verti, min($cx,$nx), $cy) ||\\n\\t\\t\\t$dy && idx($horiz, $cx, min($cy,$ny)))\\n\\t\\t} then {\\n\\t\\t lappend queue $nx $ny $path\\n\\t\\t}\\n\\t }\\n\\t}\\n\\n\\t### Loop to set up the path rendering ###\\n\\t# (-2,-2) is just a marker that isn't next to the maze at all, so\\n\\t# guaranteeing the use of the last 'else' clause\\n\\tforeach {cx cy} $path {nx ny} [concat [lrange $path 2 end] -2 -2] {\\n\\t if {$nx-$cx == 1} {\\n\\t\\tlset content $cx $cy \\\"v\\\"\\n\\t } elseif {$nx-$cx == -1} {\\n\\t\\tlset content $cx $cy \\\"^\\\"\\n\\t } elseif {$ny-$cy == -1} {\\n\\t\\tlset content $cx $cy \\\"<\\\"\\n\\t } else {\\n\\t\\tlset content $cx $cy \\\">\\\"\\n\\t }\\n\\t}\\n\\n\\t### Return the path ###\\n\\treturn $path\\n }\\n}\\n\\n# Do the solution (we ignore the returned path here...)\\nm solve\\n# Print it out\\nputs [m view]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"os\\\" for Process\\nimport \\\"./ioutil\\\" for File, FileUtil\\n\\n/*\\n * Makes the maze half as wide (i. e. \\\"+---+\\\" becomes \\\"+-+\\\"), so that\\n * each cell in the maze is the same size horizontally as vertically.\\n * (Versus the expanded version, which looks better visually.)\\n * Also, converts each line of the maze from a string to a\\n * character list, because we'll want mutability when drawing the solution later.\\n*/\\nvar decimateHorizontally = Fn.new { |lines|\\n var width = ((lines[0].count + 1)/2).floor\\n var c = List.filled(lines.count, null)\\n for (i in 0...lines.count) {\\n c[i] = List.filled(width, null)\\n for (j in 0...width) c[i][j] = lines[i][j*2]\\n }\\n return c\\n}\\n\\n/*\\n * Given the maze, the x and y coordinates (which must be odd),\\n * and the direction we came from, return true if the maze is\\n * solvable, and draw the solution if so.\\n*/\\nvar solveMazeRecursively // recursive function\\nsolveMazeRecursively = Fn.new { |maze, x, y, d|\\n var ok = false\\n var i = 0\\n while (i < 4 && !ok) {\\n if (i != d) {\\n // 0 = up, 1 = right, 2 = down, 3 = left\\n if (i == 0) {\\n if (maze[y - 1][x] == \\\" \\\") ok = solveMazeRecursively.call(maze, x, y - 2, 2)\\n } else if (i == 1) {\\n if (maze[y][x + 1] == \\\" \\\") ok = solveMazeRecursively.call(maze, x + 2, y, 3)\\n } else if (i == 2) {\\n if (maze[y + 1][x] == \\\" \\\") ok = solveMazeRecursively.call(maze, x, y + 2, 0)\\n } else if (i == 3) {\\n if (maze[y][x - 1] == \\\" \\\") ok = solveMazeRecursively.call(maze, x - 2, y, 1)\\n }\\n }\\n i = i + 1\\n }\\n\\n // check for end condition\\n if (x == 1 && y == 1) ok = true\\n\\n // once we have found a solution, draw it as we unwind the recursion\\n if (ok) {\\n maze[y][x] = \\\"*\\\"\\n if (d == 0) {\\n maze[y - 1][x] = \\\"*\\\"\\n } else if (d == 1) {\\n maze[y][x + 1] = \\\"*\\\"\\n } else if (d == 2) {\\n maze[y + 1][x] = \\\"*\\\"\\n } else if (d == 3) {\\n maze[y][x - 1] = \\\"*\\\"\\n }\\n }\\n return ok\\n}\\n\\n/*\\n * Solve the maze and draw the solution. For simplicity,\\n * assumes the starting point is the lower right, and the\\n * ending point is the upper left.\\n*/\\nvar solveMaze = Fn.new { |maze|\\n solveMazeRecursively.call(maze, maze[0].count - 2, maze.count - 2, -1)\\n}\\n\\n/*\\n * Opposite of decimateHorizontally(). Adds extra characters to make\\n * the maze \\\"look right\\\", and converts each line from a char list to a\\n * string at the same time.\\n*/\\nvar expandHorizontally = Fn.new { |maze|\\n var tmp = List.filled(3, \\\" \\\")\\n var lines = List.filled(maze.count, null)\\n for (i in 0...maze.count) {\\n var sb = \\\"\\\"\\n for (j in 0...maze[i].count) {\\n if (j % 2 == 0) {\\n sb = sb + maze[i][j]\\n } else {\\n for (k in 0..2) tmp[k] = maze[i][j]\\n if (tmp[1] == \\\"*\\\") {\\n tmp[0] = \\\" \\\"\\n tmp[2] = \\\" \\\"\\n }\\n sb = sb + tmp.join()\\n }\\n }\\n lines[i] = sb\\n }\\n return lines\\n}\\n\\n/*\\n * Accepts a maze as generated by:\\n * http://rosettacode.org/wiki/Maze_generation#Wren\\n * in a file whose name is specified as a command-line argument.\\n*/\\nvar args = Process.arguments\\nif (args.count != 1) {\\n System.print(\\\"The maze file to be read should be passed as a single command line argument.\\\")\\n return\\n}\\nif (!File.exists(args[0])) {\\n System.print(\\\"Sorry %(args[0]) does not exist.\\\")\\n return\\n}\\nvar lines = FileUtil.readLines(args[0]).where { |l| l != \\\"\\\" }.toList\\nvar maze = decimateHorizontally.call(lines)\\nsolveMaze.call(maze)\\nvar solvedLines = expandHorizontally.call(maze)\\nSystem.print(solvedLines.join(\\\"\\\\n\\\"))\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"ver,hor:=make_maze(); // see above link for this code\\n\\nfcn munge(a,b){ String(a[0,2],b,a[3,*]) } // \\\"+---\\\" --> \\\"+-*-\\\"\\n\\nfcn solveMaze(ver,hor, a,b, u,v, w,h){\\n if (a==u and b==v) return(True);\\n\\n sh:=hor[b][a]; sv:=ver[b][a];\\n hor[b][a]=munge(sh,\\\"*\\\"); ver[b][a]=munge(sv,\\\"*\\\"); // drop breadcrumb\\n\\n foreach dx,dy in (T( T(0,-1),T(1,0),T(0,1),T(-1,0) )){\\n x:=a+dx; y:=b+dy; hy:=hor[y]; vy:=ver[y];\\n if ( (0<=x<w) and (0<=y<h) and // (x,y) in bounds\\n\\t (dx==0 or (dx== 1 and vy[x]==\\\" \\\") or // horizontal\\n\\t\\t (dx==-1 and vy[a][0]==\\\" \\\" and vy[x][2]!=\\\"*\\\")) and\\n\\t (dy==0 or (dy== 1 and hy[x]==\\\"+ \\\") or // vertical\\n\\t\\t (dy==-1 and hor[b][a][1]==\\\" \\\" and hy[x][2]!=\\\"*\\\"))\\n )\\n {\\n\\t sh:=hy[x];\\n\\t if(solveMaze(ver,hor, x,y, u,v, w,h)){\\n\\t hy[x]=sh; // remove splat on wall but not floor while backing out\\n\\t return(True);\\n\\t }\\n }\\n }\\n hor[b][a]=sh; ver[b][a]=sv; // pick up breadcrumb when backtracking\\n return(False);\\n}\\n\\nw:=(hor[0].len() - 1); h:=(hor.len() - 1);\\nstartx:=(0).random(w); starty:=(0).random(h);\\nendx :=(0).random(w); endy :=(0).random(h);\\n\\nsh:=hor[starty][startx];\\nif (not solveMaze(ver,hor, startx,starty, endx,endy, w,h))\\n println(\\\"No solution path found.\\\");\\nelse{\\n hor[starty][startx]=sh;\\n ver[starty][startx]=munge(ver[starty][startx],\\\"S\\\");\\n ver[endy][endx] =munge(ver[endy][endx],\\\"E\\\");\\n foreach a,b in (hor.zip(ver)) { println(a.concat(),\\\"\\\\n\\\",b.concat()) }\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Maze-solving"}}},{"rowIdx":477,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Checksums\nfrom: http://rosettacode.org/wiki/MD4\n","language":"00-META"},{"code":"Find the MD4 message digest of a string of [[octet]]s. \nUse the ASCII encoded string “<tt>Rosetta Code</tt>” (without quotes). \nYou may either call an MD4 library, or implement MD4 in your language.\n\n'''MD4''' is an obsolete hash function that computes a 128-bit message digest that sometimes appears in obsolete protocols.\n\nRFC 1320 specifies the MD4 algorithm. RFC 6150 declares that MD4 is obsolete.\n\n","language":"00-TASK"},{"code":"with Ada.Text_IO;\n\nwith CryptAda.Digests.Message_Digests.MD4;\nwith CryptAda.Digests.Hashes;\nwith CryptAda.Pragmatics;\nwith CryptAda.Utils.Format;\n\nprocedure RC_MD4 is\n use CryptAda.Digests.Message_Digests;\n use CryptAda.Digests;\n use CryptAda.Pragmatics;\n\n function To_Byte_Array (Item : String) return Byte_Array is\n Result : Byte_Array (Item'Range);\n begin\n for I in Result'Range loop\n Result (I) := Byte (Character'Pos (Item (I)));\n end loop;\n return Result;\n end To_Byte_Array;\n\n Text : constant String := \"Rosetta Code\";\n Bytes : constant Byte_Array := To_Byte_Array (Text);\n Handle : constant Message_Digest_Handle := MD4.Get_Message_Digest_Handle;\n Pointer : constant Message_Digest_Ptr := Get_Message_Digest_Ptr (Handle);\n Hash : Hashes.Hash;\nbegin\n Digest_Start (Pointer);\n Digest_Update (Pointer, Bytes);\n Digest_End (Pointer, Hash);\n\n Ada.Text_IO.Put_Line\n (\"\"\"\" & Text & \"\"\": \" & CryptAda.Utils.Format.To_Hex_String (Hashes.Get_Bytes (Hash)));\nend RC_MD4;\n","language":"Ada"},{"code":"str := \"Rosetta Code\"\nMsgBox, % \"String:`n\" (str) \"`n`nMD4:`n\" MD4(str)\n\n\n\n; MD4 ===============================================================================\nMD4(string, encoding = \"utf-8\")\n{\n return CalcStringHash(string, 0x8002, encoding)\n}\n\n; CalcAddrHash ======================================================================\nCalcAddrHash(addr, length, algid, byref hash = 0, byref hashlength = 0)\n{\n static h := [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, \"A\", \"B\", \"C\", \"D\", \"E\", \"F\"]\n static b := h.minIndex()\n o := \"\"\n if (DllCall(\"advapi32\\CryptAcquireContext\", \"Ptr*\", hProv, \"Ptr\", 0, \"Ptr\", 0, \"UInt\", 24, \"UInt\", 0xF0000000))\n {\n if (DllCall(\"advapi32\\CryptCreateHash\", \"Ptr\", hProv, \"UInt\", algid, \"UInt\", 0, \"UInt\", 0, \"Ptr*\", hHash))\n {\n if (DllCall(\"advapi32\\CryptHashData\", \"Ptr\", hHash, \"Ptr\", addr, \"UInt\", length, \"UInt\", 0))\n {\n if (DllCall(\"advapi32\\CryptGetHashParam\", \"Ptr\", hHash, \"UInt\", 2, \"Ptr\", 0, \"UInt*\", hashlength, \"UInt\", 0))\n {\n VarSetCapacity(hash, hashlength, 0)\n if (DllCall(\"advapi32\\CryptGetHashParam\", \"Ptr\", hHash, \"UInt\", 2, \"Ptr\", &hash, \"UInt*\", hashlength, \"UInt\", 0))\n {\n loop, % hashlength\n {\n v := NumGet(hash, A_Index - 1, \"UChar\")\n o .= h[(v >> 4) + b] h[(v & 0xf) + b]\n }\n }\n }\n }\n DllCall(\"advapi32\\CryptDestroyHash\", \"Ptr\", hHash)\n }\n DllCall(\"advapi32\\CryPtreleaseContext\", \"Ptr\", hProv, \"UInt\", 0)\n }\n return o\n}\n\n; CalcStringHash ====================================================================\nCalcStringHash(string, algid, encoding = \"utf-8\", byref hash = 0, byref hashlength = 0)\n{\n chrlength := (encoding = \"cp1200\" || encoding = \"utf-16\") ? 2 : 1\n length := (StrPut(string, encoding) - 1) * chrlength\n VarSetCapacity(data, length, 0)\n StrPut(string, &data, floor(length / chrlength), encoding)\n return CalcAddrHash(&data, length, algid, hash, hashlength)\n}\n","language":"AutoHotkey"},{"code":"/*\n *\n * Author: George Mossessian\n *\n * The MD4 hash algorithm, as described in https://tools.ietf.org/html/rfc1320\n */\n\n\n#include <stdlib.h>\n#include <string.h>\n#include <stdint.h>\n\nchar *MD4(char *str, int len); //this is the prototype you want to call. Everything else is internal.\n\ntypedef struct string{\n char *c;\n int len;\n char sign;\n}string;\n\nstatic uint32_t *MD4Digest(uint32_t *w, int len);\nstatic void setMD4Registers(uint32_t AA, uint32_t BB, uint32_t CC, uint32_t DD);\nstatic uint32_t changeEndianness(uint32_t x);\nstatic void resetMD4Registers(void);\nstatic string stringCat(string first, string second);\nstatic string uint32ToString(uint32_t l);\nstatic uint32_t stringToUint32(string s);\n\nstatic const char *BASE16 = \"0123456789abcdef=\";\n\n#define F(X,Y,Z) (((X)&(Y))|((~(X))&(Z)))\n#define G(X,Y,Z) (((X)&(Y))|((X)&(Z))|((Y)&(Z)))\n#define H(X,Y,Z) ((X)^(Y)^(Z))\n\n#define LEFTROTATE(A,N) ((A)<<(N))|((A)>>(32-(N)))\n\n#define MD4ROUND1(a,b,c,d,x,s) a += F(b,c,d) + x; a = LEFTROTATE(a, s);\n#define MD4ROUND2(a,b,c,d,x,s) a += G(b,c,d) + x + (uint32_t)0x5A827999; a = LEFTROTATE(a, s);\n#define MD4ROUND3(a,b,c,d,x,s) a += H(b,c,d) + x + (uint32_t)0x6ED9EBA1; a = LEFTROTATE(a, s);\n\nstatic uint32_t A = 0x67452301;\nstatic uint32_t B = 0xefcdab89;\nstatic uint32_t C = 0x98badcfe;\nstatic uint32_t D = 0x10325476;\n\nstring newString(char * c, int t){\n\tstring r;\n\tint i;\n\tif(c!=NULL){\n\t\tr.len = (t<=0)?strlen(c):t;\n\t\tr.c=(char *)malloc(sizeof(char)*(r.len+1));\n\t\tfor(i=0; i<r.len; i++) r.c[i]=c[i];\n\t\tr.c[r.len]='\\0';\n\t\treturn r;\n\t}\n\tr.len=t;\n\tr.c=(char *)malloc(sizeof(char)*(r.len+1));\n\tmemset(r.c,(char)0,sizeof(char)*(t+1));\n\tr.sign = 1;\n\treturn r;\n}\n\nstring stringCat(string first, string second){\n\tstring str=newString(NULL, first.len+second.len);\n\tint i;\n\n\tfor(i=0; i<first.len; i++){\n\t\tstr.c[i]=first.c[i];\n\t}\n\tfor(i=first.len; i<str.len; i++){\n\t\tstr.c[i]=second.c[i-first.len];\n\t}\n\treturn str;\n}\n\nstring base16Encode(string in){\n\tstring out=newString(NULL, in.len*2);\n\tint i,j;\n\n\tj=0;\n\tfor(i=0; i<in.len; i++){\n\t\tout.c[j++]=BASE16[((in.c[i] & 0xF0)>>4)];\n\t\tout.c[j++]=BASE16[(in.c[i] & 0x0F)];\n\t}\n\tout.c[j]='\\0';\n\treturn out;\n}\n\n\nstring uint32ToString(uint32_t l){\n\tstring s = newString(NULL,4);\n\tint i;\n\tfor(i=0; i<4; i++){\n\t\ts.c[i] = (l >> (8*(3-i))) & 0xFF;\n\t}\n\treturn s;\n}\n\nuint32_t stringToUint32(string s){\n\tuint32_t l;\n\tint i;\n\tl=0;\n\tfor(i=0; i<4; i++){\n\t\tl = l|(((uint32_t)((unsigned char)s.c[i]))<<(8*(3-i)));\n\t}\n\treturn l;\n}\n\nchar *MD4(char *str, int len){\n\tstring m=newString(str, len);\n\tstring digest;\n\tuint32_t *w;\n\tuint32_t *hash;\n\tuint64_t mlen=m.len;\n\tunsigned char oneBit = 0x80;\n\tint i, wlen;\n\n\n\tm=stringCat(m, newString((char *)&oneBit,1));\n\n\t//append 0 ≤ k < 512 bits '0', such that the resulting message length in bits\n\t//\tis congruent to −64 ≡ 448 (mod 512)4\n\ti=((56-m.len)%64);\n\tif(i<0) i+=64;\n\tm=stringCat(m,newString(NULL, i));\n\n\tw = malloc(sizeof(uint32_t)*(m.len/4+2));\n\n\t//append length, in bits (hence <<3), least significant word first\n\tfor(i=0; i<m.len/4; i++){\n\t\tw[i]=stringToUint32(newString(&(m.c[4*i]), 4));\n\t}\n\tw[i++] = (mlen<<3) & 0xFFFFFFFF;\n\tw[i++] = (mlen>>29) & 0xFFFFFFFF;\n\n\twlen=i;\n\n\n\t//change endianness, but not for the appended message length, for some reason?\n\tfor(i=0; i<wlen-2; i++){\n\t\tw[i]=changeEndianness(w[i]);\n\t}\n\n\thash = MD4Digest(w,wlen);\n\n\tdigest=newString(NULL,0);\n\tfor(i=0; i<4; i++){\n\t\thash[i]=changeEndianness(hash[i]);\n\t\tdigest=stringCat(digest,uint32ToString(hash[i]));\n\t}\n\n\treturn base16Encode(digest).c;\n}\n\nuint32_t *MD4Digest(uint32_t *w, int len){\n\t//assumes message.len is a multiple of 64 bytes.\n\tint i,j;\n\tuint32_t X[16];\n\tuint32_t *digest = malloc(sizeof(uint32_t)*4);\n\tuint32_t AA, BB, CC, DD;\n\n\tfor(i=0; i<len/16; i++){\n\t\tfor(j=0; j<16; j++){\n\t\t\tX[j]=w[i*16+j];\n\t\t}\n\n\t\tAA=A;\n\t\tBB=B;\n\t\tCC=C;\n\t\tDD=D;\n\n\t\tMD4ROUND1(A,B,C,D,X[0],3);\n\t\tMD4ROUND1(D,A,B,C,X[1],7);\n\t\tMD4ROUND1(C,D,A,B,X[2],11);\n\t\tMD4ROUND1(B,C,D,A,X[3],19);\n\t\tMD4ROUND1(A,B,C,D,X[4],3);\n\t\tMD4ROUND1(D,A,B,C,X[5],7);\n\t\tMD4ROUND1(C,D,A,B,X[6],11);\n\t\tMD4ROUND1(B,C,D,A,X[7],19);\n\t\tMD4ROUND1(A,B,C,D,X[8],3);\n\t\tMD4ROUND1(D,A,B,C,X[9],7);\n\t\tMD4ROUND1(C,D,A,B,X[10],11);\n\t\tMD4ROUND1(B,C,D,A,X[11],19);\n\t\tMD4ROUND1(A,B,C,D,X[12],3);\n\t\tMD4ROUND1(D,A,B,C,X[13],7);\n\t\tMD4ROUND1(C,D,A,B,X[14],11);\n\t\tMD4ROUND1(B,C,D,A,X[15],19);\n\n\t\tMD4ROUND2(A,B,C,D,X[0],3);\n\t\tMD4ROUND2(D,A,B,C,X[4],5);\n\t\tMD4ROUND2(C,D,A,B,X[8],9);\n\t\tMD4ROUND2(B,C,D,A,X[12],13);\n\t\tMD4ROUND2(A,B,C,D,X[1],3);\n\t\tMD4ROUND2(D,A,B,C,X[5],5);\n\t\tMD4ROUND2(C,D,A,B,X[9],9);\n\t\tMD4ROUND2(B,C,D,A,X[13],13);\n\t\tMD4ROUND2(A,B,C,D,X[2],3);\n\t\tMD4ROUND2(D,A,B,C,X[6],5);\n\t\tMD4ROUND2(C,D,A,B,X[10],9);\n\t\tMD4ROUND2(B,C,D,A,X[14],13);\n\t\tMD4ROUND2(A,B,C,D,X[3],3);\n\t\tMD4ROUND2(D,A,B,C,X[7],5);\n\t\tMD4ROUND2(C,D,A,B,X[11],9);\n\t\tMD4ROUND2(B,C,D,A,X[15],13);\n\n\t\tMD4ROUND3(A,B,C,D,X[0],3);\n\t\tMD4ROUND3(D,A,B,C,X[8],9);\n\t\tMD4ROUND3(C,D,A,B,X[4],11);\n\t\tMD4ROUND3(B,C,D,A,X[12],15);\n\t\tMD4ROUND3(A,B,C,D,X[2],3);\n\t\tMD4ROUND3(D,A,B,C,X[10],9);\n\t\tMD4ROUND3(C,D,A,B,X[6],11);\n\t\tMD4ROUND3(B,C,D,A,X[14],15);\n\t\tMD4ROUND3(A,B,C,D,X[1],3);\n\t\tMD4ROUND3(D,A,B,C,X[9],9);\n\t\tMD4ROUND3(C,D,A,B,X[5],11);\n\t\tMD4ROUND3(B,C,D,A,X[13],15);\n\t\tMD4ROUND3(A,B,C,D,X[3],3);\n\t\tMD4ROUND3(D,A,B,C,X[11],9);\n\t\tMD4ROUND3(C,D,A,B,X[7],11);\n\t\tMD4ROUND3(B,C,D,A,X[15],15);\n\n\t\tA+=AA;\n\t\tB+=BB;\n\t\tC+=CC;\n\t\tD+=DD;\n\t}\n\n\tdigest[0]=A;\n\tdigest[1]=B;\n\tdigest[2]=C;\n\tdigest[3]=D;\n\tresetMD4Registers();\n\treturn digest;\n}\n\nuint32_t changeEndianness(uint32_t x){\n\treturn ((x & 0xFF) << 24) | ((x & 0xFF00) << 8) | ((x & 0xFF0000) >> 8) | ((x & 0xFF000000) >> 24);\n}\n\nvoid setMD4Registers(uint32_t AA, uint32_t BB, uint32_t CC, uint32_t DD){\n\tA=AA;\n\tB=BB;\n\tC=CC;\n\tD=DD;\n}\n\nvoid resetMD4Registers(void){\n\tsetMD4Registers(0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476);\n}\n","language":"C"},{"code":"printf(\"%s\\n\", MD4(\"Rosetta Code\", 12));\n","language":"C"},{"code":"#include <algorithm>\n#include <cstdint>\n#include <iomanip>\n#include <iostream>\n#include <string>\n#include <vector>\n\nclass MD4 {\npublic:\n\tMD4() {\n\t\tengine_reset();\n\t}\n\n\tstd::vector<int8_t> engine_digest(const std::string& text) {\n\t\tengine_update(string_to_byte_vector(text), 0, text.length());\n\n\t\tconst int32_t buffer_index = static_cast<int32_t>(count % BLOCK_LENGTH);\n\t\tconst int32_t padding_length = ( buffer_index < 56 ) ? 56 - buffer_index : 120 - buffer_index;\n\n\t\tstd::vector<int8_t> tail(padding_length + 8, 0);\n\t\ttail[0] = static_cast<int8_t>(0x80);\n\n\t\tfor ( int32_t i = 0; i < 8; ++i ) {\n\t\t\ttail[padding_length + i] = static_cast<int8_t>(unsigned_right_shift(count * 8, 8 * i));\n\t\t}\n\n\t\tengine_update(tail, 0, tail.size());\n\n\t\tstd::vector<int8_t> result(16, 0);\n\t\tfor ( int32_t i = 0; i < 4; ++i ) {\n\t\t\tfor ( int32_t j = 0; j < 4; ++j ) {\n\t\t\t\tresult[i * 4 + j] = static_cast<int8_t>(unsigned_right_shift(context[i], 8 * j));\n\t\t\t}\n\t\t}\n\n\t\tengine_reset();\n\t\treturn result;\n\t}\n\nprivate:\n\tvoid engine_update(const std::vector<int8_t>& message_bytes,\n\t\t\t\t\t const int32_t& offset, const int32_t& message_length) {\n\t\tif ( offset < 0 || message_length < 0\n\t\t\t|| (int64_t) offset + message_length > (int64_t) message_bytes.size() ) {\n\t\t\tthrow std::invalid_argument(\"Incorrect arguments for function engine_update\");\n\t\t}\n\n\t\tint32_t buffer_index = static_cast<int32_t>(count % BLOCK_LENGTH);\n\t\tcount += message_length;\n\t\tconst int32_t partial_length = BLOCK_LENGTH - buffer_index;\n\t\tint32_t i = 0;\n\n\t\tif ( message_length >= partial_length ) {\n\t\t\tfor ( int32_t j = 0; j < partial_length; ++j ) {\n\t\t\t\tbuffer[buffer_index + j] = message_bytes[offset + j];\n\t\t\t}\n\t\t\ttransform(buffer, 0);\n\t\t\ti = partial_length;\n\t\t\twhile ( i + BLOCK_LENGTH - 1 < message_length ) {\n\t\t\t\ttransform(message_bytes, offset + i);\n\t\t\t\ti += BLOCK_LENGTH;\n\t\t\t}\n\t\t\tbuffer_index = 0;\n\t\t}\n\n\t\tif ( i < message_length ) {\n\t\t\tfor ( int32_t j = 0; j < message_length - i; ++j ) {\n\t\t\t\tbuffer[buffer_index + j] = message_bytes[offset + i + j];\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid transform(const std::vector<int8_t>& buffer, int32_t offset) {\n\t\tfor ( int32_t i = 0; i < 16; ++i ) {\n\t\t\textra[i] = ( ( buffer[offset + 0] & 0xff ) ) |\n\t\t\t\t\t ( ( buffer[offset + 1] & 0xff ) << 8 ) |\n\t\t\t\t\t ( ( buffer[offset + 2] & 0xff ) << 16 ) |\n\t\t\t\t\t ( ( buffer[offset + 3] & 0xff ) << 24 );\n\t\t\toffset += 4;\n\t\t}\n\n\t\tint32_t a = context[0];\n\t\tint32_t b = context[1];\n\t\tint32_t c = context[2];\n\t\tint32_t d = context[3];\n\n\t\tfor ( const int32_t& i : { 0, 4, 8, 12 } ) {\n\t\t\ta = ff(a, b, c, d, extra[i + 0], 3);\n\t\t\td = ff(d, a, b, c, extra[i + 1], 7);\n\t\t\tc = ff(c, d, a, b, extra[i + 2], 11);\n\t\t\tb = ff(b, c, d, a, extra[i + 3], 19);\n\t\t}\n\n\t\tfor ( const int32_t& i : { 0, 1, 2, 3 } ) {\n\t\t\ta = gg(a, b, c, d, extra[i + 0], 3);\n\t\t\td = gg(d, a, b, c, extra[i + 4], 5);\n\t\t\tc = gg(c, d, a, b, extra[i + 8], 9);\n\t\t\tb = gg(b, c, d, a, extra[i + 12], 13);\n\t\t}\n\n\t\tfor ( const int32_t& i : { 0, 2, 1, 3 } ) {\n\t\t\ta = hh(a, b, c, d, extra[i + 0], 3);\n\t\t\td = hh(d, a, b, c, extra[i + 8], 9);\n\t\t\tc = hh(c, d, a, b, extra[i + 4], 11);\n\t\t\tb = hh(b, c, d, a, extra[i + 12], 15);\n\t\t}\n\n\t\tcontext[0] += a;\n\t\tcontext[1] += b;\n\t\tcontext[2] += c;\n\t\tcontext[3] += d;\n\t}\n\n\tvoid engine_reset() {\n\t\tcount = 0;\n\t\tcontext.assign(4, 0);\n\t\tcontext[0] = 0x67452301;\n\t\tcontext[1] = 0xefcdab89;\n\t\tcontext[2] = 0x98badcfe;\n\t\tcontext[3] = 0x10325476;\n\t\textra.assign(16, 0);\n\t\tbuffer.assign(BLOCK_LENGTH, 0);\n\t}\n\n\tstd::vector<int8_t> string_to_byte_vector(const std::string& text) {\n\t\tstd::vector<int8_t> bytes;\n\t\tbytes.reserve(text.size());\n\n\t\tstd::transform(text.begin(), text.end(), std::back_inserter(bytes),\n\t\t\t[](char ch){ return static_cast<int8_t>(ch); });\n\n\t\treturn bytes;\n\t}\n\n\tint32_t unsigned_right_shift(const int32_t& base, const int32_t& shift) {\n\t\tif ( shift < 0 || shift >= 32 || base == 0 ) {\n\t\t\treturn 0;\n\t\t}\n\t\treturn ( base > 0 ) ? base >> shift : static_cast<uint32_t>(base) >> shift;\n\t}\n\n\tint32_t rotate(const int32_t& t, const int32_t& s) {\n\t\treturn ( t << s ) | unsigned_right_shift(t, 32 - s);\n\t}\n\n\tint32_t ff(const int32_t& a, const int32_t& b, const int32_t& c,\n\t\t\t const int32_t& d, const int32_t& x, const int32_t& s) {\n\t\treturn rotate(a + ( ( b & c ) | ( ~b & d ) ) + x, s);\n\t}\n\n\tint32_t gg(const int32_t& a, const int32_t& b, const int32_t& c,\n\t\t\t const int32_t& d, const int32_t& x, const int32_t& s) {\n\t\treturn rotate(a + ( ( b & ( c | d ) ) | ( c & d ) ) + x + 0x5A827999, s);\n\t}\n\n\tint32_t hh(const int32_t& a, const int32_t& b, const int32_t& c,\n\t\t\t const int32_t& d, const int32_t& x, const int32_t& s) {\n\t\treturn rotate(a + ( b ^ c ^ d ) + x + 0x6ED9EBA1, s);\n\t}\n\n\tuint64_t count;\n std::vector<int32_t> context;\n std::vector<int32_t> extra;\n std::vector<int8_t> buffer;\n\n const int32_t BLOCK_LENGTH = 64;\n};\n\nint main() {\n\tMD4 md4;\n\tstd::vector<int8_t> result = md4.engine_digest(\"Rosetta Code\");\n\n\tfor ( const int8_t& bb : result ) {\n\t\tstd::cout << std::hex << std::setfill('0') << std::setw(2) << ( bb & 0xff );\n\t}\n\tstd::cout << std::endl;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nstatic class Md4\n{\n public static string Md4Hash(this string input)\n {\n // get padded uints from bytes\n List<byte> bytes = Encoding.ASCII.GetBytes(input).ToList();\n uint bitCount = (uint)(bytes.Count) * 8;\n bytes.Add(128);\n while (bytes.Count % 64 != 56) bytes.Add(0);\n var uints = new List<uint>();\n for (int i = 0; i + 3 < bytes.Count; i += 4)\n uints.Add(bytes[i] | (uint)bytes[i + 1] << 8 | (uint)bytes[i + 2] << 16 | (uint)bytes[i + 3] << 24);\n uints.Add(bitCount);\n uints.Add(0);\n\n // run rounds\n uint a = 0x67452301, b = 0xefcdab89, c = 0x98badcfe, d = 0x10325476;\n Func<uint, uint, uint> rol = (x, y) => x << (int)y | x >> 32 - (int)y;\n for (int q = 0; q + 15 < uints.Count; q += 16)\n {\n var chunk = uints.GetRange(q, 16);\n uint aa = a, bb = b, cc = c, dd = d;\n Action<Func<uint, uint, uint, uint>, uint[]> round = (f, y) =>\n {\n foreach (uint i in new[] { y[0], y[1], y[2], y[3] })\n {\n a = rol(a + f(b, c, d) + chunk[(int)(i + y[4])] + y[12], y[8]);\n d = rol(d + f(a, b, c) + chunk[(int)(i + y[5])] + y[12], y[9]);\n c = rol(c + f(d, a, b) + chunk[(int)(i + y[6])] + y[12], y[10]);\n b = rol(b + f(c, d, a) + chunk[(int)(i + y[7])] + y[12], y[11]);\n }\n };\n round((x, y, z) => (x & y) | (~x & z), new uint[] { 0, 4, 8, 12, 0, 1, 2, 3, 3, 7, 11, 19, 0 });\n round((x, y, z) => (x & y) | (x & z) | (y & z), new uint[] { 0, 1, 2, 3, 0, 4, 8, 12, 3, 5, 9, 13, 0x5a827999 });\n round((x, y, z) => x ^ y ^ z, new uint[] { 0, 2, 1, 3, 0, 8, 4, 12, 3, 9, 11, 15, 0x6ed9eba1 });\n a += aa; b += bb; c += cc; d += dd;\n }\n\n // return hex encoded string\n byte[] outBytes = new[] { a, b, c, d }.SelectMany(BitConverter.GetBytes).ToArray();\n return BitConverter.ToString(outBytes).Replace(\"-\", \"\").ToLower();\n }\n static void Main() { Console.WriteLine(\"Rosetta Code\".Md4Hash()); }\n}\n","language":"C-sharp"},{"code":"(use 'pandect.core)\n(md4 \"Rosetta Code\")\n","language":"Clojure"},{"code":"(ql:quickload 'ironclad)\n(defun md4 (str)\n (ironclad:byte-array-to-hex-string\n (ironclad:digest-sequence :md4\n (ironclad:ascii-string-to-byte-array str))))\n\n(md4 \"Rosetta Code\")\n","language":"Common-Lisp"},{"code":"import std.stdio, std.string, std.range;\n\nubyte[16] md4(const(ubyte)[] inData) pure nothrow {\n enum f = (uint x, uint y, uint z) => (x & y) | (~x & z);\n enum g = (uint x, uint y, uint z) => (x & y) | (x & z) | (y & z);\n enum h = (uint x, uint y, uint z) => x ^ y ^ z;\n enum r = (uint v, uint s) => (v << s) | (v >> (32 - s));\n\n immutable bitLen = ulong(inData.length) << 3;\n inData ~= 0x80;\n while (inData.length % 64 != 56)\n inData ~= 0;\n const data = cast(uint[])inData ~ [uint(bitLen & uint.max), uint(bitLen >> 32)];\n\n uint a = 0x67452301, b = 0xefcdab89, c = 0x98badcfe, d = 0x10325476;\n\n foreach (const x; data.chunks(16)) {\n immutable a2 = a, b2 = b, c2 = c, d2 = d;\n foreach (immutable i; [0, 4, 8, 12]) {\n a = r(a + f(b, c, d) + x[i+0], 3);\n d = r(d + f(a, b, c) + x[i+1], 7);\n c = r(c + f(d, a, b) + x[i+2], 11);\n b = r(b + f(c, d, a) + x[i+3], 19);\n }\n foreach (immutable i; [0, 1, 2, 3]) {\n a = r(a + g(b, c, d) + x[i+0] + 0x5a827999, 3);\n d = r(d + g(a, b, c) + x[i+4] + 0x5a827999, 5);\n c = r(c + g(d, a, b) + x[i+8] + 0x5a827999, 9);\n b = r(b + g(c, d, a) + x[i+12] + 0x5a827999, 13);\n }\n foreach (immutable i; [0, 2, 1, 3]) {\n a = r(a + h(b, c, d) + x[i+0] + 0x6ed9eba1, 3);\n d = r(d + h(a, b, c) + x[i+8] + 0x6ed9eba1, 9);\n c = r(c + h(d, a, b) + x[i+4] + 0x6ed9eba1, 11);\n b = r(b + h(c, d, a) + x[i+12] + 0x6ed9eba1, 15);\n }\n a += a2, b += b2, c += c2, d += d2;\n }\n\n //return cast(ubyte[16])[a, b, c, d];\n immutable uint[4] result = [a, b, c, d];\n return cast(ubyte[16])result;\n}\n\nvoid main() {\n writefln(\"%(%02x%)\", \"Rosetta Code\".representation.md4);\n}\n","language":"D"},{"code":"program CalcMD4;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils,\n DCPmd4;\n\nfunction MD4(const Str: string): string;\nvar\n HashDigest: array of byte;\n d: Byte;\nbegin\n Result := '';\n with TDCP_md4.Create(nil) do\n begin\n Init;\n UpdateStr(Str);\n SetLength(HashDigest, GetHashSize div 8);\n final(HashDigest[0]);\n for d in HashDigest do\n Result := Result + d.ToHexString(2);\n Free;\n end;\nend;\n\nbegin\n Writeln(MD4('Rosetta Code'));\n readln;\nend.\n","language":"Delphi"},{"code":"(require 'md4)\n(require 'hex-util)\n(let* ((s \"Rosetta Code\")\n (m (md4 s (length s)))) ;; m = 16 binary bytes\n (encode-hex-string m))\n=>\n\"a52bcfc6a0d0d300cdc5ddbfbefe478b\"\n","language":"Emacs-Lisp"},{"code":"-module(md4).\n-export([md4/0]).\n\nmd4() ->\n <<MD4:128>> = crypto:md4(\"Rosetta Code\"),\n io:fwrite(\"Rosetta Code => ~.16B~n\",[MD4]).\n","language":"Erlang"},{"code":"' version 19-10-2016\n' translation of the (pseudo) code in RFC 1320\n' compile with: fbc -s console\n\nFunction MD4(test_str As String) As String\n\n Dim As String message = test_str ' string are passed as ByRef\n\n ' some macro's\n #Macro F(X, Y, Z)\n (((X) And (Y)) Or ((Not(X)) And (Z)))\n #EndMacro\n\n #Macro G(X, Y, Z)\n (((X) And (Y)) Or (((X) And (Z)) Or ((Y) And (Z))))\n #EndMacro\n\n #Macro H(X, Y, Z)\n ((X) Xor (Y) Xor (Z))\n #EndMacro\n\n ' a little piece of inline asm to do a rotate left on a 32bit variable\n #Macro ROtate_Left(x, n) ' rotate left\n Asm\n rol dword Ptr [x], n\n End Asm\n #EndMacro\n\n ' #Macro ROtate_left(x, n)\n ' x = x Shl n + x Shr (32 - n)\n ' #EndMacro\n\n Dim As Long i\n Dim As String answer, s1\n\n Dim As ULongInt l = Len(message)\n ' set the first bit after the message to 1\n message = message + Chr(1 Shl 7)\n ' add one char to the length\n Dim As ULong padding = 64 - ((l +1) Mod (512 \\ 8)) ' 512 \\ 8 = 64 char.\n\n ' check if we have enough room for inserting the length\n If padding < 8 Then padding = padding + 64\n\n message = message + String(padding, Chr(0)) ' adjust length\n Dim As ULong l1 = Len(message) ' new length\n\n l = l * 8 ' orignal length in bits\n ' create ubyte ptr to point to l ( = length in bits)\n Dim As UByte Ptr ub_ptr = Cast(UByte Ptr, @l)\n\n For i = 0 To 7 'copy length of message to the last 8 bytes\n message[l1 -8 + i] = ub_ptr[i]\n Next\n\n ' unsigned 32bit integers only\n Dim As UInteger<32> AA, A = &H67452301\n Dim As UInteger<32> BB, B = &Hefcdab89\n Dim As UInteger<32> CC, C = &H98badcfe\n Dim As UInteger<32> DD, D = &H10325476\n\n For i = 0 To (l1 -1) \\ 64 ' split into 64 byte block\n\n AA = A : BB = B : CC = C : DD = D\n\n ' x point to 64 byte block inside the string message\n Dim As UInteger<32> Ptr x = Cast(UInteger<32> Ptr, @message[i*64])\n\n ' round 1\n A = A + F(B, C, D) + x[ 0] : ROtate_Left(A, 3)\n D = D + F(A, B, C) + x[ 1] : ROtate_Left(D, 7)\n C = C + F(D, A, B) + x[ 2] : ROtate_Left(C, 11)\n B = B + F(C, D, A) + x[ 3] : ROtate_Left(B, 19)\n A = A + F(B, C, D) + x[ 4] : ROtate_Left(A, 3)\n D = D + F(A, B, C) + x[ 5] : ROtate_Left(D, 7)\n C = C + F(D, A, B) + x[ 6] : ROtate_Left(C, 11)\n B = B + F(C, D, A) + x[ 7] : ROtate_Left(B, 19)\n A = A + F(B, C, D) + x[ 8] : ROtate_Left(A, 3)\n D = D + F(A, B, C) + x[ 9] : ROtate_Left(D, 7)\n C = C + F(D, A, B) + x[10] : ROtate_Left(C, 11)\n B = B + F(C, D, A) + x[11] : ROtate_Left(B, 19)\n A = A + F(B, C, D) + x[12] : ROtate_Left(A, 3)\n D = D + F(A, B, C) + x[13] : ROtate_Left(D, 7)\n C = C + F(D, A, B) + x[14] : ROtate_Left(C, 11)\n B = B + F(C, D, A) + x[15] : ROtate_Left(B, 19)\n\n ' round 2\n A = A + G(B, C, D) + x[ 0] + &H5A827999 : ROtate_Left(A, 3)\n D = D + G(A, B, C) + x[ 4] + &H5A827999 : ROtate_Left(D, 5)\n C = C + G(D, A, B) + x[ 8] + &H5A827999 : ROtate_Left(C, 9)\n B = B + G(C, D, A) + x[12] + &H5A827999 : ROtate_Left(B, 13)\n A = A + G(B, C, D) + x[ 1] + &H5A827999 : ROtate_Left(A, 3)\n D = D + G(A, B, C) + x[ 5] + &H5A827999 : ROtate_Left(D, 5)\n C = C + G(D, A, B) + x[ 9] + &H5A827999 : ROtate_Left(C, 9)\n B = B + G(C, D, A) + x[13] + &H5A827999 : ROtate_Left(B, 13)\n A = A + G(B, C, D) + x[ 2] + &H5A827999 : ROtate_Left(A, 3)\n D = D + G(A, B, C) + x[ 6] + &H5A827999 : ROtate_Left(D, 5)\n C = C + G(D, A, B) + x[10] + &H5A827999 : ROtate_Left(C, 9)\n B = B + G(C, D, A) + x[14] + &H5A827999 : ROtate_Left(B, 13)\n A = A + G(B, C, D) + x[ 3] + &H5A827999 : ROtate_Left(A, 3)\n D = D + G(A, B, C) + x[ 7] + &H5A827999 : ROtate_Left(D, 5)\n C = C + G(D, A, B) + x[11] + &H5A827999 : ROtate_Left(C, 9)\n B = B + G(C, D, A) + x[15] + &H5A827999 : ROtate_Left(B, 13)\n\n ' round 3\n A = A + H(B, C, D) + x[ 0] + &H6ED9EBA1 : ROtate_Left(A, 3)\n D = D + H(A, B, C) + x[ 8] + &H6ED9EBA1 : ROtate_Left(D, 9)\n C = C + H(D, A, B) + x[ 4] + &H6ED9EBA1 : ROtate_Left(C, 11)\n B = B + H(C, D, A) + x[12] + &H6ED9EBA1 : ROtate_Left(B, 15)\n A = A + H(B, C, D) + x[ 2] + &H6ED9EBA1 : ROtate_Left(A, 3)\n D = D + H(A, B, C) + x[10] + &H6ED9EBA1 : ROtate_Left(D, 9)\n C = C + H(D, A, B) + x[ 6] + &H6ED9EBA1 : ROtate_Left(C, 11)\n B = B + H(C, D, A) + x[14] + &H6ED9EBA1 : ROtate_Left(B, 15)\n A = A + H(B, C, D) + x[ 1] + &H6ED9EBA1 : ROtate_Left(A, 3)\n D = D + H(A, B, C) + x[ 9] + &H6ED9EBA1 : ROtate_Left(D, 9)\n C = C + H(D, A, B) + x[ 5] + &H6ED9EBA1 : ROtate_Left(C, 11)\n B = B + H(C, D, A) + x[13] + &H6ED9EBA1 : ROtate_Left(B, 15)\n A = A + H(B, C, D) + x[ 3] + &H6ED9EBA1 : ROtate_Left(A, 3)\n D = D + H(A, B, C) + x[11] + &H6ED9EBA1 : ROtate_Left(D, 9)\n C = C + H(D, A, B) + x[ 7] + &H6ED9EBA1 : ROtate_Left(C, 11)\n B = B + H(C, D, A) + x[15] + &H6ED9EBA1 : ROtate_Left(B, 15)\n\n A += AA : B += BB : C += CC : D += DD\n\n Next\n\n ' convert A, B, C and D in hex, then add low order first\n s1 = Hex(A, 8)\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\n s1 = Hex(B, 8)\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\n s1 = Hex(C, 8)\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\n s1 = Hex(D, 8)\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\n\nReturn LCase(answer)\n\nEnd Function\n\n' ------=< MAIN >=------\n\nDim As String test = \"Rosetta Code\"\nPrint\nPrint test; \" => \"; MD4(test)\n\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 \"golang.org/x/crypto/md4\"\n \"fmt\"\n)\n\nfunc main() {\n h := md4.New()\n h.Write([]byte(\"Rosetta Code\"))\n fmt.Printf(\"%x\\n\", h.Sum(nil))\n}\n","language":"Go"},{"code":"#!/usr/bin/env runhaskell\n\nimport Data.ByteString.Char8 (pack)\nimport System.Environment (getArgs)\nimport Crypto.Hash\n\nmain :: IO ()\nmain = print . md4 . pack . unwords =<< getArgs\n where md4 x = hash x :: Digest MD4\n","language":"Haskell"},{"code":" require 'ide/qt'\n gethash_jqtide_ 'MD4';'Rosetta Code'\na52bcfc6a0d0d300cdc5ddbfbefe478b\n","language":"J"},{"code":"import org.bouncycastle.crypto.digests.MD4Digest;\nimport org.bouncycastle.util.encoders.Hex;\n\npublic class RosettaMD4\n{\n public static void main (String[] argv) throws Exception\n {\n byte[] r = \"Rosetta Code\".getBytes(\"US-ASCII\");\n MD4Digest d = new MD4Digest();\n d.update (r, 0, r.length);\n byte[] o = new byte[d.getDigestSize()];\n d.doFinal (o, 0);\n Hex.encode (o, System.out);\n System.out.println();\n }\n}\n","language":"Java"},{"code":"import java.util.Arrays;\nimport java.util.List;\n\npublic final class MD4Task {\n\t\n\tpublic static void main(String[] aArgs) {\n\t\tString text = \"Rosetta Code\";\n\t\n\t MD4 md4 = new MD4();\t\n\t byte[] result = md4.engineDigest(text);\n\t \t\t\n\t\tStringBuilder stringBuilder = new StringBuilder();\n\t for ( byte bb : result ) {\n stringBuilder.append(String.format(\"%02x\", bb));\n }\n System.out.println(stringBuilder.toString());\n\t}\n\t\n}\n\t\nfinal class MD4 {\n\t\n\tpublic MD4() {\n\t\tengineReset();\n\t}\t\n\n\tpublic byte[] engineDigest(String aText) {\n\t\tengineUpdate(aText.getBytes(), 0, aText.length());\t\t\n\t\t\n final int bufferIndex = (int) ( count % BLOCK_LENGTH );\n final int paddingLength = ( bufferIndex < 56 ) ? 56 - bufferIndex : 120 - bufferIndex;\n\n byte[] tail = new byte[paddingLength + 8];\n tail[0] = (byte) 0x80;\n\n for ( int i = 0; i < 8; i++ ) {\n tail[paddingLength + i] = (byte) ( ( count * 8 ) >>> ( 8 * i ) );\n }\n\n engineUpdate(tail, 0, tail.length);\n\n byte[] result = new byte[16];\n for ( int i = 0; i < 4; i++ ) {\n for ( int j = 0; j < 4; j++ ) {\n result[i * 4 + j] = (byte) ( context[i] >>> ( 8 * j ) );\n }\n }\n\n engineReset();\n return result;\n\t}\n\t\n\tprivate void engineUpdate(byte[] aMessageBytes, int aOffset, int aMessageLength) {\n if ( aOffset < 0 || aMessageLength < 0 || (long) aOffset + aMessageLength > (long) aMessageBytes.length ) {\n throw new ArrayIndexOutOfBoundsException(\"Incorrect arguments for method engineUpdate\");\n }\n\n int bufferIndex = (int) ( count % BLOCK_LENGTH );\n count += aMessageLength;\n final int partialLength = BLOCK_LENGTH - bufferIndex;\n int i = 0;\n\n if ( aMessageLength >= partialLength ) {\n System.arraycopy(aMessageBytes, aOffset, buffer, bufferIndex, partialLength);\n transform(buffer, 0);\t\n i = partialLength;\t\n while ( i + BLOCK_LENGTH - 1 < aMessageLength ) {\n transform(aMessageBytes, aOffset + i);\n i += BLOCK_LENGTH;\n }\n bufferIndex = 0;\n }\n\n if ( i < aMessageLength ) {\n \tSystem.arraycopy(aMessageBytes, aOffset + i, buffer, bufferIndex, aMessageLength - i);\n }\n }\n\t\n\tprivate void transform (byte[] aBuffer, int aOffset) {\n for ( int i = 0; i < 16; i++ ) {\n extra[i] = ( ( aBuffer[aOffset++] & 0xff ) ) |\n \t\t ( ( aBuffer[aOffset++] & 0xff ) << 8 ) |\n ( ( aBuffer[aOffset++] & 0xff ) << 16 ) |\n ( ( aBuffer[aOffset++] & 0xff ) << 24 );\n }\n\n int a = context[0];\n int b = context[1];\n int c = context[2];\n int d = context[3];\n\n for ( int i : List.of( 0, 4, 8, 12 ) ) {\n \ta = ff(a, b, c, d, extra[i + 0], 3);\n\t d = ff(d, a, b, c, extra[i + 1], 7);\n\t c = ff(c, d, a, b, extra[i + 2], 11);\n\t b = ff(b, c, d, a, extra[i + 3], 19);\n }\n\n for ( int i : List.of( 0, 1, 2, 3 ) ) {\n \ta = gg(a, b, c, d, extra[i + 0], 3);\n \t d = gg(d, a, b, c, extra[i + 4], 5);\n \t c = gg(c, d, a, b, extra[i + 8], 9);\n \t b = gg(b, c, d, a, extra[i + 12], 13);\n }\n\n for ( int i : List.of( 0, 2, 1, 3 ) ) {\n \ta = hh(a, b, c, d, extra[i + 0], 3);\n \t d = hh(d, a, b, c, extra[i + 8], 9);\n \t c = hh(c, d, a, b, extra[i + 4], 11);\n \t b = hh(b, c, d, a, extra[i + 12], 15);\n }\n\n context[0] += a;\n context[1] += b;\n context[2] += c;\n context[3] += d;\n }\n\t\n\tprivate void engineReset() {\n\t\tcount = 0;\n context[0] = 0x67452301;\n context[1] = 0xefcdab89;\n context[2] = 0x98badcfe;\n context[3] = 0x10325476;\n Arrays.fill(extra, 0);\n Arrays.fill(buffer, (byte) 0);\n }\n\t\n\tprivate static int rotate(int t, int s) {\n\t\treturn t << s | t >>> ( 32 - s );\n\t}\n\t\n\tprivate static int ff(int a, int b, int c, int d, int x, int s) {\n\t return rotate(a + ( ( b & c ) | ( ~b & d ) ) + x, s);\n\t}\n\t\n\tprivate static int gg(int a, int b, int c, int d, int x, int s) {\n\t return rotate(a + ( ( b & ( c | d ) ) | ( c & d ) ) + x + 0x5A827999, s);\n\t}\n\t\n\tprivate static int hh(int a, int b, int c, int d, int x, int s) {\n\t return rotate(a + ( b ^ c ^ d ) + x + 0x6ED9EBA1, s);\n\t}\n\t\n\tprivate static final int BLOCK_LENGTH = 64;\n\t\n\tprivate long count;\n private int[] context = new int[4];\t \t\n private int[] extra = new int[16];\t\n private byte[] buffer = new byte[BLOCK_LENGTH];\n\n}\t\n","language":"Java"},{"code":"const md4func = () => {\n\n const hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */\n const b64pad = \"\"; /* base-64 pad character. \"=\" for strict RFC compliance */\n const chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */\n\n const tab = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\n const hex_tab = hexcase ? \"0123456789ABCDEF\" : \"0123456789abcdef\";\n\n /**\n * Add integers, wrapping at 2^32. This uses 16-bit operations internally\n * to work around bugs in some JS interpreters.\n */\n const safe_add = (x, y) => {\n const lsw = (x & 0xFFFF) + (y & 0xFFFF);\n const msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return (msw << 16) | (lsw & 0xFFFF);\n };\n\n /**\n * Bitwise rotate a 32-bit number to the left.\n */\n const rol = (num, cnt) => (num << cnt) | (num >>> (32 - cnt));\n\n /**\n * Convert a string to an array of little-endian words\n * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.\n */\n const str2binl = str => {\n const bin = Array();\n const mask = (1 << chrsz) - 1;\n for (let i = 0; i < str.length * chrsz; i += chrsz)\n bin[i >> 5] |= (str.charCodeAt(i / chrsz) & mask) << (i % 32);\n return bin;\n };\n\n /**\n * Convert an array of little-endian words to a string\n */\n const binl2str = bin => {\n let str = \"\";\n const mask = (1 << chrsz) - 1;\n for (let i = 0; i < bin.length * 32; i += chrsz)\n str += String.fromCharCode((bin[i >> 5] >>> (i % 32)) & mask);\n return str;\n };\n\n /**\n * Convert an array of little-endian words to a hex string.\n */\n const binl2hex = binarray => {\n let str = \"\";\n for (let i = 0; i < binarray.length * 4; i++) {\n str += hex_tab.charAt((binarray[i >> 2] >> ((i % 4) * 8 + 4)) & 0xF) +\n hex_tab.charAt((binarray[i >> 2] >> ((i % 4) * 8)) & 0xF);\n }\n return str;\n };\n\n /**\n * Convert an array of little-endian words to a base-64 string\n */\n const binl2b64 = binarray => {\n let str = \"\";\n for (let i = 0; i < binarray.length * 4; i += 3) {\n const triplet = (((binarray[i >> 2] >> 8 * (i % 4)) & 0xFF) << 16)\n | (((binarray[i + 1 >> 2] >> 8 * ((i + 1) % 4)) & 0xFF) << 8)\n | ((binarray[i + 2 >> 2] >> 8 * ((i + 2) % 4)) & 0xFF);\n for (let j = 0; j < 4; j++) {\n if (i * 8 + j * 6 > binarray.length * 32) str += b64pad;\n else str += tab.charAt((triplet >> 6 * (3 - j)) & 0x3F);\n }\n }\n return str;\n };\n\n\n /**\n * Calculate the MD4 of an array of little-endian words, and a bit length\n */\n const core_md4 = (x, len) => {\n\n x[len >> 5] |= 0x80 << (len % 32);\n x[(((len + 64) >>> 9) << 4) + 14] = len;\n let a = 1732584193;\n let b = -271733879;\n let c = -1732584194;\n let d = 271733878;\n\n for (let i = 0; i < x.length; i += 16) {\n\n const olda = a;\n const oldb = b;\n const oldc = c;\n const oldd = d;\n\n a = md4_ff(a, b, c, d, x[i], 3);\n d = md4_ff(d, a, b, c, x[i + 1], 7);\n c = md4_ff(c, d, a, b, x[i + 2], 11);\n b = md4_ff(b, c, d, a, x[i + 3], 19);\n a = md4_ff(a, b, c, d, x[i + 4], 3);\n d = md4_ff(d, a, b, c, x[i + 5], 7);\n c = md4_ff(c, d, a, b, x[i + 6], 11);\n b = md4_ff(b, c, d, a, x[i + 7], 19);\n a = md4_ff(a, b, c, d, x[i + 8], 3);\n d = md4_ff(d, a, b, c, x[i + 9], 7);\n c = md4_ff(c, d, a, b, x[i + 10], 11);\n b = md4_ff(b, c, d, a, x[i + 11], 19);\n a = md4_ff(a, b, c, d, x[i + 12], 3);\n d = md4_ff(d, a, b, c, x[i + 13], 7);\n c = md4_ff(c, d, a, b, x[i + 14], 11);\n b = md4_ff(b, c, d, a, x[i + 15], 19);\n\n a = md4_gg(a, b, c, d, x[i], 3);\n d = md4_gg(d, a, b, c, x[i + 4], 5);\n c = md4_gg(c, d, a, b, x[i + 8], 9);\n b = md4_gg(b, c, d, a, x[i + 12], 13);\n a = md4_gg(a, b, c, d, x[i + 1], 3);\n d = md4_gg(d, a, b, c, x[i + 5], 5);\n c = md4_gg(c, d, a, b, x[i + 9], 9);\n b = md4_gg(b, c, d, a, x[i + 13], 13);\n a = md4_gg(a, b, c, d, x[i + 2], 3);\n d = md4_gg(d, a, b, c, x[i + 6], 5);\n c = md4_gg(c, d, a, b, x[i + 10], 9);\n b = md4_gg(b, c, d, a, x[i + 14], 13);\n a = md4_gg(a, b, c, d, x[i + 3], 3);\n d = md4_gg(d, a, b, c, x[i + 7], 5);\n c = md4_gg(c, d, a, b, x[i + 11], 9);\n b = md4_gg(b, c, d, a, x[i + 15], 13);\n\n a = md4_hh(a, b, c, d, x[i], 3);\n d = md4_hh(d, a, b, c, x[i + 8], 9);\n c = md4_hh(c, d, a, b, x[i + 4], 11);\n b = md4_hh(b, c, d, a, x[i + 12], 15);\n a = md4_hh(a, b, c, d, x[i + 2], 3);\n d = md4_hh(d, a, b, c, x[i + 10], 9);\n c = md4_hh(c, d, a, b, x[i + 6], 11);\n b = md4_hh(b, c, d, a, x[i + 14], 15);\n a = md4_hh(a, b, c, d, x[i + 1], 3);\n d = md4_hh(d, a, b, c, x[i + 9], 9);\n c = md4_hh(c, d, a, b, x[i + 5], 11);\n b = md4_hh(b, c, d, a, x[i + 13], 15);\n a = md4_hh(a, b, c, d, x[i + 3], 3);\n d = md4_hh(d, a, b, c, x[i + 11], 9);\n c = md4_hh(c, d, a, b, x[i + 7], 11);\n b = md4_hh(b, c, d, a, x[i + 15], 15);\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n }\n\n return Array(a, b, c, d);\n\n };\n\n /**\n * These functions implement the basic operation for each round of the\n * algorithm.\n */\n const md4_cmn = (q, a, b, x, s, t) => safe_add(\n rol(safe_add(safe_add(a, q), safe_add(x, t)), s), b);\n\n const md4_ff = (a, b, c, d, x, s) => md4_cmn(\n (b & c) | ((~b) & d), a, 0, x, s, 0);\n\n const md4_gg = (a, b, c, d, x, s) => md4_cmn(\n (b & c) | (b & d) | (c & d), a, 0, x, s, 1518500249);\n\n const md4_hh = (a, b, c, d, x, s) => md4_cmn(\n b ^ c ^ d, a, 0, x, s, 1859775393);\n\n /**\n * Calculate the HMAC-MD4, of a key and some data\n */\n const core_hmac_md4 = (key, data) => {\n\n let bkey = str2binl(key);\n if (bkey.length > 16) {\n bkey = core_md4(bkey, key.length * chrsz)\n }\n\n const ipad = Array(16);\n const opad = Array(16);\n\n for (let i = 0; i < 16; i++) {\n ipad[i] = bkey[i] ^ 0x36363636;\n opad[i] = bkey[i] ^ 0x5C5C5C5C;\n }\n const hash = core_md4(\n ipad.concat(str2binl(data)), 512 + data.length * chrsz);\n\n return core_md4(opad.concat(hash), 512 + 128);\n };\n\n /**\n * These are the functions you'll usually want to call\n */\n return {\n hex_md4: s => binl2hex(core_md4(str2binl(s), s.length * chrsz)),\n b64_md4: s => binl2b64(core_md4(str2binl(s), s.length * chrsz)),\n str_md4: s => binl2str(core_md4(str2binl(s), s.length * chrsz)),\n hex_hmac_md4: (key, data) => binl2hex(core_hmac_md4(key, data)),\n b64_hmac_md4: (key, data) => binl2b64(core_hmac_md4(key, data)),\n str_hmac_md4: (key, data) => binl2str(core_hmac_md4(key, data)),\n };\n\n};\n\nconst md4 = md4func();\nconsole.log(md4.hex_md4('Rosetta Code'));\n","language":"JavaScript"},{"code":"using Nettle\n\nmsg = \"Rosetta Code\"\n\nh = HashState(MD4)\nupdate!(h, msg)\nh = hexdigest!(h)\n\nprintln(\"\\\"\", msg, \"\\\" => \", h)\n","language":"Julia"},{"code":"// version 1.0.6\n\nimport java.security.MessageDigest\n\nclass MD4() : MessageDigest(\"MD4\"), Cloneable {\n private val blockLength = 64\n private var context = IntArray(4)\n private var count = 0L\n private var buffer = ByteArray(blockLength)\n private var x = IntArray(16)\n\n init {\n engineReset()\n }\n\n private constructor(md: MD4): this() {\n context = md.context.clone()\n buffer = md.buffer.clone()\n count = md.count\n }\n\n override fun clone(): Any = MD4(this)\n\n override fun engineReset() {\n context[0] = 0x67452301\n context[1] = 0xefcdab89.toInt()\n context[2] = 0x98badcfe.toInt()\n context[3] = 0x10325476\n count = 0L\n for (i in 0 until blockLength) buffer[i] = 0\n }\n\n override fun engineUpdate(b: Byte) {\n val i = (count % blockLength).toInt()\n count++\n buffer[i] = b\n if (i == blockLength - 1) transform(buffer, 0)\n }\n\n override fun engineUpdate(input: ByteArray, offset: Int, len: Int) {\n if (offset < 0 || len < 0 || offset.toLong() + len > input.size.toLong())\n throw ArrayIndexOutOfBoundsException()\n var bufferNdx = (count % blockLength).toInt()\n count += len\n val partLen = blockLength - bufferNdx\n var i = 0\n if (len >= partLen) {\n System.arraycopy(input, offset, buffer, bufferNdx, partLen)\n transform(buffer, 0)\n i = partLen\n while (i + blockLength - 1 < len) {\n transform(input, offset + i)\n i += blockLength\n }\n bufferNdx = 0\n }\n if (i < len) System.arraycopy(input, offset + i, buffer, bufferNdx, len - i)\n }\n\n override fun engineDigest(): ByteArray {\n val bufferNdx = (count % blockLength).toInt()\n val padLen = if (bufferNdx < 56) 56 - bufferNdx else 120 - bufferNdx\n val tail = ByteArray(padLen + 8)\n tail[0] = 0x80.toByte()\n for (i in 0..7) tail[padLen + i] = ((count * 8) ushr (8 * i)).toByte()\n engineUpdate(tail, 0, tail.size)\n val result = ByteArray(16)\n for (i in 0..3)\n for (j in 0..3)\n result[i * 4 + j] = (context[i] ushr (8 * j)).toByte()\n engineReset()\n return result\n }\n\n private fun transform (block: ByteArray, offset: Int) {\n var offset2 = offset\n for (i in 0..15)\n x[i] = ((block[offset2++].toInt() and 0xff) ) or\n ((block[offset2++].toInt() and 0xff) shl 8 ) or\n ((block[offset2++].toInt() and 0xff) shl 16) or\n ((block[offset2++].toInt() and 0xff) shl 24)\n\n var a = context[0]\n var b = context[1]\n var c = context[2]\n var d = context[3]\n\n a = ff(a, b, c, d, x[ 0], 3)\n d = ff(d, a, b, c, x[ 1], 7)\n c = ff(c, d, a, b, x[ 2], 11)\n b = ff(b, c, d, a, x[ 3], 19)\n a = ff(a, b, c, d, x[ 4], 3)\n d = ff(d, a, b, c, x[ 5], 7)\n c = ff(c, d, a, b, x[ 6], 11)\n b = ff(b, c, d, a, x[ 7], 19)\n a = ff(a, b, c, d, x[ 8], 3)\n d = ff(d, a, b, c, x[ 9], 7)\n c = ff(c, d, a, b, x[10], 11)\n b = ff(b, c, d, a, x[11], 19)\n a = ff(a, b, c, d, x[12], 3)\n d = ff(d, a, b, c, x[13], 7)\n c = ff(c, d, a, b, x[14], 11)\n b = ff(b, c, d, a, x[15], 19)\n\n a = gg(a, b, c, d, x[ 0], 3)\n d = gg(d, a, b, c, x[ 4], 5)\n c = gg(c, d, a, b, x[ 8], 9)\n b = gg(b, c, d, a, x[12], 13)\n a = gg(a, b, c, d, x[ 1], 3)\n d = gg(d, a, b, c, x[ 5], 5)\n c = gg(c, d, a, b, x[ 9], 9)\n b = gg(b, c, d, a, x[13], 13)\n a = gg(a, b, c, d, x[ 2], 3)\n d = gg(d, a, b, c, x[ 6], 5)\n c = gg(c, d, a, b, x[10], 9)\n b = gg(b, c, d, a, x[14], 13)\n a = gg(a, b, c, d, x[ 3], 3)\n d = gg(d, a, b, c, x[ 7], 5)\n c = gg(c, d, a, b, x[11], 9)\n b = gg(b, c, d, a, x[15], 13)\n\n a = hh(a, b, c, d, x[ 0], 3)\n d = hh(d, a, b, c, x[ 8], 9)\n c = hh(c, d, a, b, x[ 4], 11)\n b = hh(b, c, d, a, x[12], 15)\n a = hh(a, b, c, d, x[ 2], 3)\n d = hh(d, a, b, c, x[10], 9)\n c = hh(c, d, a, b, x[ 6], 11)\n b = hh(b, c, d, a, x[14], 15)\n a = hh(a, b, c, d, x[ 1], 3)\n d = hh(d, a, b, c, x[ 9], 9)\n c = hh(c, d, a, b, x[ 5], 11)\n b = hh(b, c, d, a, x[13], 15)\n a = hh(a, b, c, d, x[ 3], 3)\n d = hh(d, a, b, c, x[11], 9)\n c = hh(c, d, a, b, x[ 7], 11)\n b = hh(b, c, d, a, x[15], 15)\n\n context[0] += a\n context[1] += b\n context[2] += c\n context[3] += d\n }\n\n private fun ff(a: Int, b: Int, c: Int, d: Int, x: Int, s: Int): Int {\n val t = a + ((b and c) or (b.inv() and d)) + x\n return (t shl s) or (t ushr (32 - s))\n }\n\n private fun gg(a: Int, b: Int, c: Int, d: Int, x: Int, s: Int): Int {\n val t = a + ((b and (c or d)) or (c and d)) + x + 0x5a827999\n return (t shl s) or (t ushr (32 - s))\n }\n\n private fun hh(a: Int, b: Int, c: Int, d: Int, x: Int, s: Int): Int {\n val t = a + (b xor c xor d) + x + 0x6ed9eba1\n return (t shl s) or (t ushr (32 - s))\n }\n}\n\nfun main(args: Array<String>) {\n val text = \"Rosetta Code\"\n val bytes = text.toByteArray(Charsets.US_ASCII)\n val md: MessageDigest = MD4()\n val digest = md.digest(bytes)\n for (byte in digest) print(\"%02x\".format(byte))\n println()\n}\n","language":"Kotlin"},{"code":"cipher_digest('Rosetta Code', -digest='MD4')->encodeHex->asString\n","language":"Lasso"},{"code":"#!/usr/bin/lua\n\nrequire \"crypto\"\n\nprint(crypto.digest(\"MD4\", \"Rosetta Code\"))\n","language":"Lua"},{"code":"Hash[\"Rosetta Code\", \"MD4\", \"HexString\"]\n","language":"Mathematica"},{"code":"import strutils\n\nconst MD4Len = 16\n\nproc MD4(d: cstring, n: culong, md: cstring = nil): cstring {.cdecl, dynlib: \"libssl.so\", importc.}\n\nproc MD4(s: string): string =\n result = \"\"\n var s = MD4(s.cstring, s.len.culong)\n for i in 0 ..< MD4Len:\n result.add s[i].BiggestInt.toHex(2).toLower\n\necho MD4(\"Rosetta Code\")\n","language":"Nim"},{"code":"#include <pari/pari.h>\n#include <openssl/md4.h>\n\n#define HEX(x) (((x) < 10)? (x)+'0': (x)-10+'a')\n\n/*\n * PARI/GP func: MD4 hash\n *\n * gp code: install(\"plug_md4\", \"s\", \"MD4\", \"<library path>\");\n */\nGEN plug_md4(char *text)\n{\n char md[MD4_DIGEST_LENGTH];\n char hash[sizeof(md) * 2 + 1];\n int i;\n\n MD4((unsigned char*)text, strlen(text), (unsigned char*)md);\n\n for (i = 0; i < sizeof(md); i++) {\n hash[i+i] = HEX((md[i] >> 4) & 0x0f);\n hash[i+i+1] = HEX(md[i] & 0x0f);\n }\n\n hash[sizeof(md) * 2] = 0;\n\n return strtoGENstr(hash);\n}\n","language":"PARI-GP"},{"code":"install(\"plug_md4\", \"s\", \"MD4\", \"~/libmd4.so\");\n\nMD4(\"Rosetta Code\")\n","language":"PARI-GP"},{"code":"sub md4 :prototype(@) {\n my @input = grep { defined && length > 0 } split /(.{64})/s, join '', @_;\n push @input, '' if !@input || length($input[$#input]) >= 56;\n\n my @A = (0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476); # initial regs\n my @T = (0, 0x5A827999, 0x6ED9EBA1);\n my @L = qw(3 7 11 19 3 5 9 13 3 9 11 15); # left rotate counts\n my @O = (1, 4, 4, # x stride for input index\n 4, 1, 1, # y stride for input index\n 0, 0, 1); # bitwise reverse both indexes\n my @I = map {\n my $z = int $_/16;\n my $x = $_%4;\n my $y = int $_%16/4;\n ($x,$y) = (R($x),R($y)) if $O[6+$z];\n $O[$z] * $x + $O[3+$z] * $y\n } 0..47;\n\n my ($a,$b,$c,$d);\n my($l,$p) = (0,0);\n foreach (@input) {\n my $r = length($_);\n $l += $r;\n $r++, $_.=\"\\x80\" if $r<64 && !$p++;\n my @W = unpack 'V16', $_ . \"\\0\"x7;\n push @W, (0)x16 if @W < 16;\n $W[14] = $l*8 if $r < 57; # add bit-length in low 32-bits\n ($a,$b,$c,$d) = @A;\n for (0..47) {\n my $z = int $_/16;\n $a = L($L[4*($_>>4) + $_%4],\n M(&{(sub{$b&$c|~$b&$d}, # F\n sub{$b&$c|$b&$d|$c&$d}, # G\n sub{$b^$c^$d} # H\n )[$z]}\n + $a + $W[$I[$_]] + $T[$z]));\n ($a,$b,$c,$d) = ($d,$a,$b,$c);\n }\n my @v = ($a, $b, $c, $d);\n $A[$_] = M($A[$_] + $v[$_]) for 0..3;\n }\n pack 'V4', @A;\n}\n\nsub L { # left-rotate\n my ($n, $x) = @_;\n $x<<$n | 2**$n - 1 & $x>>(32-$n);\n}\n\nsub M { # mod 2**32\n no integer;\n my ($x) = @_;\n my $m = 1+0xffffffff;\n $x - $m * int $x/$m;\n}\n\nsub R { # reverse two bit number\n my $n = pop;\n ($n&1)*2 + ($n&2)/2;\n}\n\nsub md4_hex :prototype(@) { # convert to hexadecimal\n unpack 'H*', &md4;\n}\n\nprint \"Rosetta Code => \" . md4_hex( \"Rosetta Code\" ) . \"\\n\";\n","language":"Perl"},{"code":"(notonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\md4.exw\n -- ====================\n --\n -- Non-optimised. If there is a genuine need for something faster, I can give #ilASM a bash.\n -- MD4 is an obsolete hash function that computes a 128-bit message digest that sometimes appears in obsolete protocols.\n -- Even the replacement, MD5 is now considered severly comprimised.\n --</span>\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- (allocate/poke/peek)</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">r32</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;\">if</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">+=</span><span style=\"color: #000000;\">#100000000</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">#100000000</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;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">bits</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- left rotate the bits of a 32-bit number by the specified number of bits</span>\n <span style=\"color: #000000;\">word</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- trim to a 32-bit uint again</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">bits</span><span style=\"color: #0000FF;\">))+</span><span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">bits</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;\">f</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: #000000;\">y</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</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;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">not_bits</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>\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;\">g</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: #000000;\">y</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">or_all</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</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: #7060A8;\">and_bits</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: #7060A8;\">and_bits</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 <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">h</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: #000000;\">y</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">xor_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">xor_bits</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 <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">md4</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">data</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">bytes_to_add</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">64</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">data</span><span style=\"color: #0000FF;\">)+</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">64</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">bytes_to_add</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">64</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">bytes_to_add</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: #000000;\">data</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">data</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">#80</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;\">bytes_to_add</span><span style=\"color: #0000FF;\">)&</span>\n <span style=\"color: #7060A8;\">int_to_bytes</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">data</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0x67452301</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0xefcdab89</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0x98badcfe</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0x10325476</span>\n\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">m64</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">allocate</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: #004080;\">integer</span> <span style=\"color: #000000;\">i</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: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">data</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">64</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">poke</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">m64</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">data</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">63</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">z</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">peek4u</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">m64</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">16</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">a2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">b2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">c2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">d2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">d</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">12</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">z</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;\">3</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">f</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> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">z</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;\">7</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</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> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">z</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;\">11</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">19</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: #000000;\">4</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">g</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">z</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: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">0x5a827999</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">g</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> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">0x5a827999</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">g</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</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> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">0x5a827999</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">g</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">0x5a827999</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">13</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;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">do</span>\n <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: #000000;\">3</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;\">j</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">z</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: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">0x6ed9eba1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">h</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> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">0x6ed9eba1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</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> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">0x6ed9eba1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">0x6ed9eba1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">15</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">a2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">b2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">c2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">d2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">poke4</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">m64</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><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">peek</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">m64</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">16</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;\">hexify</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;\">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: #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: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%02X\"</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;\">return</span> <span style=\"color: #7060A8;\">join</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>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">hexify</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">md4</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Rosetta Code\"</span><span style=\"color: #0000FF;\">))</span>\n\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":"echo hash('md4', \"Rosetta Code\"), \"\\n\";\n","language":"PHP"},{"code":"(de *Md4-W .\n (1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16\n 1 5 9 13 2 6 10 14 3 7 11 15 4 8 12 16\n 1 9 5 13 3 11 7 15 2 10 6 14 4 12 8 16 .))\n(de *Md4-R1 . (3 7 11 19 .))\n(de *Md4-R2 . (3 5 9 13 .))\n(de *Md4-R3 . (3 9 11 15 .))\n\n(de mod32 (N)\n (& N `(hex \"FFFFFFFF\")) )\n\n(de not32 (N)\n (x| N `(hex \"FFFFFFFF\")) )\n\n(de add32 @\n (mod32 (pass +)) )\n\n(de leftRotate (X C)\n (| (mod32 (>> (- C) X)) (>> (- 32 C) X)) )\n\n(de md4 (Str)\n (let Len (length Str)\n (setq Str\n (conc\n (need\n (- 8 (* 64 (/ (+ Len 1 8 63) 64))) # Pad to 64-8 bytes\n (conc\n (mapcar char (chop Str)) # Works only with ASCII characters\n (cons `(hex \"80\")) ) # '1' bit\n 0 ) # Pad with '0'\n (make\n (setq Len (* 8 Len))\n (do 8\n (link (& Len 255))\n (setq Len (>> 8 Len )) ) ) ) ) )\n (let\n (H0 `(hex \"67452301\")\n H1 `(hex \"EFCDAB89\")\n H2 `(hex \"98BADCFE\")\n H3 `(hex \"10325476\")\n R2 `(hex \"5A827999\")\n R3 `(hex \"6ED9EBA1\") )\n (while Str\n (let\n (A H0 B H1 C H2 D H3\n W (make\n (do 16\n (link\n (apply |\n (mapcar >> (0 -8 -16 -24) (cut 4 'Str)) ) ) ) ) )\n (for I 12\n (cond\n ((>= 4 I)\n (setq\n A (leftRotate\n (add32\n A\n (| (& B C) (& (not32 B) D))\n (get W (pop '*Md4-W)) )\n (pop '*Md4-R1) )\n D (leftRotate\n (add32\n D\n (| (& A B) (& (not32 A) C))\n (get W (pop '*Md4-W)) )\n (pop '*Md4-R1) )\n C (leftRotate\n (add32\n C\n (| (& D A) (& (not32 D) B))\n (get W (pop '*Md4-W)) )\n (pop '*Md4-R1) )\n B (leftRotate\n (add32\n B\n (| (& C D) (& (not32 C) A))\n (get W (pop '*Md4-W)) )\n (pop '*Md4-R1) ) ) )\n ((>= 8 I)\n (setq\n A (leftRotate\n (add32\n A\n (|\n (& B (| C D))\n (& C D) )\n (get W (pop '*Md4-W))\n R2 )\n (pop '*Md4-R2) )\n D (leftRotate\n (add32\n D\n (|\n (& A (| B C))\n (& B C) )\n (get W (pop '*Md4-W))\n R2 )\n (pop '*Md4-R2) )\n C (leftRotate\n (add32\n C\n (|\n (& D (| A B))\n (& A B) )\n (get W (pop '*Md4-W))\n R2 )\n (pop '*Md4-R2) )\n B (leftRotate\n (add32\n B\n (|\n (& C (| D A))\n (& D A) )\n (get W (pop '*Md4-W))\n R2 )\n (pop '*Md4-R2) ) ) )\n (T\n (setq\n A (leftRotate\n (add32\n A\n (x| B C D)\n (get W (pop '*Md4-W))\n R3 )\n (pop '*Md4-R3) )\n D (leftRotate\n (add32\n D\n (x| A B C)\n (get W (pop '*Md4-W))\n R3 )\n (pop '*Md4-R3) )\n C (leftRotate\n (add32\n C\n (x| D A B)\n (get W (pop '*Md4-W))\n R3 )\n (pop '*Md4-R3) )\n B (leftRotate\n (add32\n B\n (x| C D A)\n (get W (pop '*Md4-W))\n R3 )\n (pop '*Md4-R3) ) ) ) ) )\n (setq\n H0 (add32 H0 A)\n H1 (add32 H1 B)\n H2 (add32 H2 C)\n H3 (add32 H3 D) ) ) )\n (make\n (for N (list H0 H1 H2 H3)\n (do 4\n (link (& N 255))\n (setq N (>> 8 N)) ) ) ) ) )\n\n(let Str \"Rosetta Code\"\n (println\n (pack\n (mapcar\n '((B) (pad 2 (hex B)))\n (md4 Str) ) ) )\n (println\n (pack\n (mapcar\n '((B) (pad 2 (hex B)))\n (native\n \"libcrypto.so\"\n \"MD4\"\n '(B . 16)\n Str\n (length Str)\n '(NIL (16)) ) ) ) ) )\n\n(bye)\n","language":"PicoLisp"},{"code":"import hashlib\nprint hashlib.new(\"md4\",raw_input().encode('utf-16le')).hexdigest().upper()\n","language":"Python"},{"code":"#lang racket\n(require (planet soegaard/digest:1:2/digest))\n(md4 #\"Rosetta Code\")\n","language":"Racket"},{"code":"sub md4($str) {\n my buf8 $buf .= new: $str.encode;\n my $buf-length = $buf.elems;\n $buf.push: 0x80;\n $buf.push: 0 until ($buf - (448 div 8)) %% (512 div 8);\n # raku serializes in little endian by default\n $buf.write-uint64: $buf.elems, $buf-length*8;\n\n my (&f, &g, &h, &r) =\n { $^x +& $^y +| +^$x +& $^z },\n { $^x +& $^y +| $x +& $^z +| $y +& $z },\n { $^x +^ $^y +^ $^z },\n # for some reason we have to type v here\n -> uint32 $v, $s { $v +< $s +| $v +> (32 - $s) }\n\n my uint32 ($a, $b, $c, $d) = 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476;\n\n loop (my $pos = 0; $pos < $buf.elems; $pos+=64) {\n my ($aa, $bb, $cc, $dd) = $a, $b, $c, $d;\n for 0, 4, 8, 12 -> $i {\n $a = r($a + f($b, $c, $d) + $buf.read-uint32($pos+($i+0)*4), 3);\n $d = r($d + f($a, $b, $c) + $buf.read-uint32($pos+($i+1)*4), 7);\n $c = r($c + f($d, $a, $b) + $buf.read-uint32($pos+($i+2)*4), 11);\n $b = r($b + f($c, $d, $a) + $buf.read-uint32($pos+($i+3)*4), 19);\n }\n for 0, 1, 2, 3 -> $i {\n $a = r($a + g($b, $c, $d) + $buf.read-uint32($pos+($i+0 )*4) + 0x5a827999, 3);\n $d = r($d + g($a, $b, $c) + $buf.read-uint32($pos+($i+4 )*4) + 0x5a827999, 5);\n $c = r($c + g($d, $a, $b) + $buf.read-uint32($pos+($i+8 )*4) + 0x5a827999, 9);\n $b = r($b + g($c, $d, $a) + $buf.read-uint32($pos+($i+12)*4) + 0x5a827999, 13);\n }\n for 0, 2, 1, 3 -> $i {\n $a = r($a + h($b, $c, $d) + $buf.read-uint32($pos+($i+0 )*4) + 0x6ed9eba1, 3);\n $d = r($d + h($a, $b, $c) + $buf.read-uint32($pos+($i+4 )*4) + 0x6ed9eba1, 9);\n $c = r($c + h($d, $a, $b) + $buf.read-uint32($pos+($i+8 )*4) + 0x6ed9eba1, 11);\n $b = r($b + h($c, $d, $a) + $buf.read-uint32($pos+($i+12)*4) + 0x6ed9eba1, 15);\n }\n ($a,$b,$c,$d) Z[+=] ($aa,$bb,$cc,$dd);\n }\n\n reduce { $^buf.write-uint32: $buf.elems, $^x; $buf }, buf8.new, $a, $b, $c, $d;\n}\n\nCHECK {\n use Test;\n plan 1;\n is md4('Rosetta Code').list.fmt('%02X'), 'A5 2B CF C6 A0 D0 D3 00 CD C5 DD BF BE FE 47 8B';\n}\n","language":"Raku"},{"code":"require 'openssl'\nputs OpenSSL::Digest::MD4.hexdigest('Rosetta Code')\n","language":"Ruby"},{"code":"require 'stringio'\n\n# Calculates MD4 message digest of _string_. Returns binary digest.\n# For hexadecimal digest, use +*md4(str).unpack('H*')+.\ndef md4(string)\n # functions\n mask = (1 << 32) - 1\n f = proc {|x, y, z| x & y | x.^(mask) & z}\n g = proc {|x, y, z| x & y | x & z | y & z}\n h = proc {|x, y, z| x ^ y ^ z}\n r = proc {|v, s| (v << s).&(mask) | (v.&(mask) >> (32 - s))}\n\n # initial hash\n a, b, c, d = 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476\n\n bit_len = string.size << 3\n string += \"\\x80\"\n while (string.size % 64) != 56\n string += \"\\0\"\n end\n string = string.force_encoding('ascii-8bit') + [bit_len & mask, bit_len >> 32].pack(\"V2\")\n\n if string.size % 64 != 0\n fail \"failed to pad to correct length\"\n end\n\n io = StringIO.new(string)\n block = \"\"\n\n while io.read(64, block)\n x = block.unpack(\"V16\")\n\n # Process this block.\n aa, bb, cc, dd = a, b, c, d\n [0, 4, 8, 12].each {|i|\n a = r[a + f[b, c, d] + x[i], 3]; i += 1\n d = r[d + f[a, b, c] + x[i], 7]; i += 1\n c = r[c + f[d, a, b] + x[i], 11]; i += 1\n b = r[b + f[c, d, a] + x[i], 19]\n }\n [0, 1, 2, 3].each {|i|\n a = r[a + g[b, c, d] + x[i] + 0x5a827999, 3]; i += 4\n d = r[d + g[a, b, c] + x[i] + 0x5a827999, 5]; i += 4\n c = r[c + g[d, a, b] + x[i] + 0x5a827999, 9]; i += 4\n b = r[b + g[c, d, a] + x[i] + 0x5a827999, 13]\n }\n [0, 2, 1, 3].each {|i|\n a = r[a + h[b, c, d] + x[i] + 0x6ed9eba1, 3]; i += 8\n d = r[d + h[a, b, c] + x[i] + 0x6ed9eba1, 9]; i -= 4\n c = r[c + h[d, a, b] + x[i] + 0x6ed9eba1, 11]; i += 8\n b = r[b + h[c, d, a] + x[i] + 0x6ed9eba1, 15]\n }\n a = (a + aa) & mask\n b = (b + bb) & mask\n c = (c + cc) & mask\n d = (d + dd) & mask\n end\n\n [a, b, c, d].pack(\"V4\")\nend\n\nif __FILE__ == $0\n # Print an example MD4 digest.\n str = 'Rosetta Code'\n printf \"%s:\\n %s\\n\", str, *md4(str).unpack('H*')\nend\n","language":"Ruby"},{"code":"// MD4, based on RFC 1186 and RFC 1320.\n//\n// https://www.ietf.org/rfc/rfc1186.txt\n// https://tools.ietf.org/html/rfc1320\n//\n\nuse std::fmt::Write;\nuse std::mem;\n\n// Let not(X) denote the bit-wise complement of X.\n// Let X v Y denote the bit-wise OR of X and Y.\n// Let X xor Y denote the bit-wise XOR of X and Y.\n// Let XY denote the bit-wise AND of X and Y.\n\n// f(X,Y,Z) = XY v not(X)Z\nfn f(x: u32, y: u32, z: u32) -> u32 {\n (x & y) | (!x & z)\n}\n\n// g(X,Y,Z) = XY v XZ v YZ\nfn g(x: u32, y: u32, z: u32) -> u32 {\n (x & y) | (x & z) | (y & z)\n}\n\n// h(X,Y,Z) = X xor Y xor Z\nfn h(x: u32, y: u32, z: u32) -> u32 {\n x ^ y ^ z\n}\n\n// Round 1 macro\n// Let [A B C D i s] denote the operation\n// A = (A + f(B,C,D) + X[i]) <<< s\nmacro_rules! md4round1 {\n ( $a:expr, $b:expr, $c:expr, $d:expr, $i:expr, $s:expr, $x:expr) => {\n {\n // Rust defaults to non-overflowing arithmetic, so we need to specify wrapping add.\n $a = ($a.wrapping_add( f($b, $c, $d) ).wrapping_add( $x[$i] ) ).rotate_left($s);\n }\n };\n}\n\n// Round 2 macro\n// Let [A B C D i s] denote the operation\n// A = (A + g(B,C,D) + X[i] + 5A827999) <<< s .\nmacro_rules! md4round2 {\n ( $a:expr, $b:expr, $c:expr, $d:expr, $i:expr, $s:expr, $x:expr) => {\n {\n $a = ($a.wrapping_add( g($b, $c, $d)).wrapping_add($x[$i]).wrapping_add(0x5a827999_u32)).rotate_left($s);\n }\n };\n}\n\n// Round 3 macro\n// Let [A B C D i s] denote the operation\n// A = (A + h(B,C,D) + X[i] + 6ED9EBA1) <<< s .\nmacro_rules! md4round3 {\n ( $a:expr, $b:expr, $c:expr, $d:expr, $i:expr, $s:expr, $x:expr) => {\n {\n $a = ($a.wrapping_add(h($b, $c, $d)).wrapping_add($x[$i]).wrapping_add(0x6ed9eba1_u32)).rotate_left($s);\n }\n };\n}\n\nfn convert_byte_vec_to_u32(mut bytes: Vec<u8>) -> Vec<u32> {\n\n bytes.shrink_to_fit();\n let num_bytes = bytes.len();\n let num_words = num_bytes / 4;\n unsafe {\n let words = Vec::from_raw_parts(bytes.as_mut_ptr() as *mut u32, num_words, num_words);\n mem::forget(bytes);\n words\n }\n}\n\n// Returns a 128-bit MD4 hash as an array of four 32-bit words.\n// Based on RFC 1186 from https://www.ietf.org/rfc/rfc1186.txt\nfn md4<T: Into<Vec<u8>>>(input: T) -> [u32; 4] {\n\n let mut bytes = input.into().to_vec();\n let initial_bit_len = (bytes.len() << 3) as u64;\n\n // Step 1. Append padding bits\n // Append one '1' bit, then append 0 ≤ k < 512 bits '0', such that the resulting message\n // length in bis is congruent to 448 (mod 512).\n // Since our message is in bytes, we use one byte with a set high-order bit (0x80) plus\n // a variable number of zero bytes.\n\n // Append zeros\n // Number of padding bytes needed is 448 bits (56 bytes) modulo 512 bits (64 bytes)\n bytes.push(0x80_u8);\n while (bytes.len() % 64) != 56 {\n bytes.push(0_u8);\n }\n\n // Everything after this operates on 32-bit words, so reinterpret the buffer.\n let mut w = convert_byte_vec_to_u32(bytes);\n\n // Step 2. Append length\n // A 64-bit representation of b (the length of the message before the padding bits were added)\n // is appended to the result of the previous step, low-order bytes first.\n w.push(initial_bit_len as u32); // Push low-order bytes first\n w.push((initial_bit_len >> 32) as u32);\n\n // Step 3. Initialize MD buffer\n let mut a = 0x67452301_u32;\n let mut b = 0xefcdab89_u32;\n let mut c = 0x98badcfe_u32;\n let mut d = 0x10325476_u32;\n\n // Step 4. Process message in 16-word blocks\n let n = w.len();\n for i in 0..n / 16 {\n\n // Select the next 512-bit (16-word) block to process.\n let x = &w[i * 16..i * 16 + 16];\n\n let aa = a;\n let bb = b;\n let cc = c;\n let dd = d;\n\n // [Round 1]\n md4round1!(a, b, c, d, 0, 3, x); // [A B C D 0 3]\n md4round1!(d, a, b, c, 1, 7, x); // [D A B C 1 7]\n md4round1!(c, d, a, b, 2, 11, x); // [C D A B 2 11]\n md4round1!(b, c, d, a, 3, 19, x); // [B C D A 3 19]\n md4round1!(a, b, c, d, 4, 3, x); // [A B C D 4 3]\n md4round1!(d, a, b, c, 5, 7, x); // [D A B C 5 7]\n md4round1!(c, d, a, b, 6, 11, x); // [C D A B 6 11]\n md4round1!(b, c, d, a, 7, 19, x); // [B C D A 7 19]\n md4round1!(a, b, c, d, 8, 3, x); // [A B C D 8 3]\n md4round1!(d, a, b, c, 9, 7, x); // [D A B C 9 7]\n md4round1!(c, d, a, b, 10, 11, x);// [C D A B 10 11]\n md4round1!(b, c, d, a, 11, 19, x);// [B C D A 11 19]\n md4round1!(a, b, c, d, 12, 3, x); // [A B C D 12 3]\n md4round1!(d, a, b, c, 13, 7, x); // [D A B C 13 7]\n md4round1!(c, d, a, b, 14, 11, x);// [C D A B 14 11]\n md4round1!(b, c, d, a, 15, 19, x);// [B C D A 15 19]\n\n // [Round 2]\n md4round2!(a, b, c, d, 0, 3, x); //[A B C D 0 3]\n md4round2!(d, a, b, c, 4, 5, x); //[D A B C 4 5]\n md4round2!(c, d, a, b, 8, 9, x); //[C D A B 8 9]\n md4round2!(b, c, d, a, 12, 13, x);//[B C D A 12 13]\n md4round2!(a, b, c, d, 1, 3, x); //[A B C D 1 3]\n md4round2!(d, a, b, c, 5, 5, x); //[D A B C 5 5]\n md4round2!(c, d, a, b, 9, 9, x); //[C D A B 9 9]\n md4round2!(b, c, d, a, 13, 13, x);//[B C D A 13 13]\n md4round2!(a, b, c, d, 2, 3, x); //[A B C D 2 3]\n md4round2!(d, a, b, c, 6, 5, x); //[D A B C 6 5]\n md4round2!(c, d, a, b, 10, 9, x); //[C D A B 10 9]\n md4round2!(b, c, d, a, 14, 13, x);//[B C D A 14 13]\n md4round2!(a, b, c, d, 3, 3, x); //[A B C D 3 3]\n md4round2!(d, a, b, c, 7, 5, x); //[D A B C 7 5]\n md4round2!(c, d, a, b, 11, 9, x); //[C D A B 11 9]\n md4round2!(b, c, d, a, 15, 13, x);//[B C D A 15 13]\n\n // [Round 3]\n md4round3!(a, b, c, d, 0, 3, x); //[A B C D 0 3]\n md4round3!(d, a, b, c, 8, 9, x); //[D A B C 8 9]\n md4round3!(c, d, a, b, 4, 11, x); //[C D A B 4 11]\n md4round3!(b, c, d, a, 12, 15, x);//[B C D A 12 15]\n md4round3!(a, b, c, d, 2, 3, x); //[A B C D 2 3]\n md4round3!(d, a, b, c, 10, 9, x); //[D A B C 10 9]\n md4round3!(c, d, a, b, 6, 11, x); //[C D A B 6 11]\n md4round3!(b, c, d, a, 14, 15, x);//[B C D A 14 15]\n md4round3!(a, b, c, d, 1, 3, x); //[A B C D 1 3]\n md4round3!(d, a, b, c, 9, 9, x); //[D A B C 9 9]\n md4round3!(c, d, a, b, 5, 11, x); //[C D A B 5 11]\n md4round3!(b, c, d, a, 13, 15, x);//[B C D A 13 15]\n md4round3!(a, b, c, d, 3, 3, x); //[A B C D 3 3]\n md4round3!(d, a, b, c, 11, 9, x); //[D A B C 11 9]\n md4round3!(c, d, a, b, 7, 11, x); //[C D A B 7 11]\n md4round3!(b, c, d, a, 15, 15, x);//[B C D A 15 15]\n\n a = a.wrapping_add(aa);\n b = b.wrapping_add(bb);\n c = c.wrapping_add(cc);\n d = d.wrapping_add(dd);\n }\n\n // Step 5. Output\n // The message digest produced as output is A, B, C, D. That is, we begin with the low-order\n // byte of A, and end with the high-order byte of D.\n [u32::from_be(a), u32::from_be(b), u32::from_be(c), u32::from_be(d)]\n}\n\nfn digest_to_str(digest: &[u32]) -> String {\n let mut s = String::new();\n for &word in digest {\n write!(&mut s, \"{:08x}\", word).unwrap();\n }\n s\n}\n\nfn main() {\n let val = \"Rosetta Code\";\n println!(\"md4(\\\"{}\\\") = {}\", val, digest_to_str(&md4(val)));\n}\n","language":"Rust"},{"code":"import org.bouncycastle.crypto.digests.MD4Digest\n\nobject RosettaRIPEMD160 extends App {\n val (raw, messageDigest) = (\"Rosetta Code\".getBytes(\"US-ASCII\"), new MD4Digest())\n messageDigest.update(raw, 0, raw.length)\n val out = Array.fill[Byte](messageDigest.getDigestSize())(0)\n messageDigest.doFinal(out, 0)\n\n assert(out.map(\"%02x\".format(_)).mkString == \"a52bcfc6a0d0d300cdc5ddbfbefe478b\")\n import scala.compat.Platform.currentTime\n println(s\"Successfully completed without errors. [total ${currentTime - executionStart} ms]\")\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n include \"msgdigest.s7i\";\n\nconst proc: main is func\n begin\n writeln(hex(md4(\"Rosetta Code\")));\n end func;\n","language":"Seed7"},{"code":"var digest = frequire('Digest::MD4');\nsay digest.md4_hex('Rosetta Code');\n","language":"Sidef"},{"code":"package require md4\n\n# Use -hex option for hexadecimal output instead of binary\nputs [md4::md4 -hex \"Rosetta Code\"]\n","language":"Tcl"},{"code":"import \"./fmt\" for Fmt\n\nvar toBytes = Fn.new { |val|\n var bytes = List.filled(4, 0)\n bytes[0] = val & 255\n bytes[1] = (val >> 8) & 255\n bytes[2] = (val >> 16) & 255\n bytes[3] = (val >> 24) & 255\n return bytes\n}\n\nvar toInt = Fn.new { |bytes| bytes[0] | bytes[1] << 8 | bytes[2] << 16 | bytes[3] << 24 }\n\nvar md4 = Fn.new { |initMsg|\n var f = Fn.new { |x, y, z| (x & y) | (~x & z) }\n var g = Fn.new { |x, y, z| (x & y) | (x & z) | (y & z) }\n var h = Fn.new { |x, y, z| x ^ y ^ z }\n var r = Fn.new { |v, s| (v << s) | (v >> (32 - s)) }\n\n var a = 0x67452301\n var b = 0xefcdab89\n var c = 0x98badcfe\n var d = 0x10325476\n var initBytes = initMsg.bytes\n var initLen = initBytes.count\n var newLen = initLen + 1\n while (newLen % 64 != 56) newLen = newLen + 1\n var msg = List.filled(newLen + 8, 0)\n for (i in 0...initLen) msg[i] = initBytes[i]\n msg[initLen] = 0x80 // remaining bytes already 0\n var lenBits = toBytes.call(initLen * 8)\n for (i in newLen...newLen+4) msg[i] = lenBits[i-newLen]\n var extraBits = toBytes.call(initLen >> 29)\n for (i in newLen+4...newLen+8) msg[i] = extraBits[i-newLen-4]\n var offset = 0\n var x = List.filled(16, 0)\n while (offset < newLen) {\n for (i in 0...16) x[i] = toInt.call(msg[offset+i*4...offset + i*4 + 4])\n var a2 = a\n var b2 = b\n var c2 = c\n var d2 = d\n for (i in [0, 4, 8, 12]) {\n a = r.call(a + f.call(b, c, d) + x[i+0], 3)\n d = r.call(d + f.call(a, b, c) + x[i+1], 7)\n c = r.call(c + f.call(d, a, b) + x[i+2], 11)\n b = r.call(b + f.call(c, d, a) + x[i+3], 19)\n }\n for (i in 0..3) {\n a = r.call(a + g.call(b, c, d) + x[i+0] + 0x5a827999, 3)\n d = r.call(d + g.call(a, b, c) + x[i+4] + 0x5a827999, 5)\n c = r.call(c + g.call(d, a, b) + x[i+8] + 0x5a827999, 9)\n b = r.call(b + g.call(c, d, a) + x[i+12] + 0x5a827999, 13)\n }\n for (i in [0, 2, 1, 3]) {\n a = r.call(a + h.call(b, c, d) + x[i+0] + 0x6ed9eba1, 3)\n d = r.call(d + h.call(a, b, c) + x[i+8] + 0x6ed9eba1, 9)\n c = r.call(c + h.call(d, a, b) + x[i+4] + 0x6ed9eba1, 11)\n b = r.call(b + h.call(c, d, a) + x[i+12] + 0x6ed9eba1, 15)\n }\n a = a + a2\n b = b + b2\n c = c + c2\n d = d + d2\n offset = offset + 64\n }\n var digest = List.filled(16, 0)\n var dBytes = toBytes.call(a)\n for (i in 0...4) digest[i] = dBytes[i]\n dBytes = toBytes.call(b)\n for (i in 0...4) digest[i+4] = dBytes[i]\n dBytes = toBytes.call(c)\n for (i in 0...4) digest[i+8] = dBytes[i]\n dBytes = toBytes.call(d)\n for (i in 0...4) digest[i+12] = dBytes[i]\n return digest\n}\n\nvar strings = [\n \"\",\n \"a\",\n \"abc\",\n \"message digest\",\n \"abcdefghijklmnopqrstuvwxyz\",\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\",\n \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\",\n \"Rosetta Code\"\n]\n\nfor (s in strings) {\n var digest = md4.call(s)\n Fmt.print(\"$s <== '$0s'\", Fmt.v(\"xz\", 2, digest, 0, \"\", \"\"), s)\n}\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Checksums\\nfrom: http://rosettacode.org/wiki/MD4\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Find the MD4 message digest of a string of [[octet]]s. \\nUse the ASCII encoded string “<tt>Rosetta Code</tt>” (without quotes). \\nYou may either call an MD4 library, or implement MD4 in your language.\\n\\n'''MD4''' is an obsolete hash function that computes a 128-bit message digest that sometimes appears in obsolete protocols.\\n\\nRFC 1320 specifies the MD4 algorithm. RFC 6150 declares that MD4 is obsolete.\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\n\\nwith CryptAda.Digests.Message_Digests.MD4;\\nwith CryptAda.Digests.Hashes;\\nwith CryptAda.Pragmatics;\\nwith CryptAda.Utils.Format;\\n\\nprocedure RC_MD4 is\\n use CryptAda.Digests.Message_Digests;\\n use CryptAda.Digests;\\n use CryptAda.Pragmatics;\\n\\n function To_Byte_Array (Item : String) return Byte_Array is\\n Result : Byte_Array (Item'Range);\\n begin\\n for I in Result'Range loop\\n Result (I) := Byte (Character'Pos (Item (I)));\\n end loop;\\n return Result;\\n end To_Byte_Array;\\n\\n Text : constant String := \\\"Rosetta Code\\\";\\n Bytes : constant Byte_Array := To_Byte_Array (Text);\\n Handle : constant Message_Digest_Handle := MD4.Get_Message_Digest_Handle;\\n Pointer : constant Message_Digest_Ptr := Get_Message_Digest_Ptr (Handle);\\n Hash : Hashes.Hash;\\nbegin\\n Digest_Start (Pointer);\\n Digest_Update (Pointer, Bytes);\\n Digest_End (Pointer, Hash);\\n\\n Ada.Text_IO.Put_Line\\n (\\\"\\\"\\\"\\\" & Text & \\\"\\\"\\\": \\\" & CryptAda.Utils.Format.To_Hex_String (Hashes.Get_Bytes (Hash)));\\nend RC_MD4;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"str := \\\"Rosetta Code\\\"\\nMsgBox, % \\\"String:`n\\\" (str) \\\"`n`nMD4:`n\\\" MD4(str)\\n\\n\\n\\n; MD4 ===============================================================================\\nMD4(string, encoding = \\\"utf-8\\\")\\n{\\n return CalcStringHash(string, 0x8002, encoding)\\n}\\n\\n; CalcAddrHash ======================================================================\\nCalcAddrHash(addr, length, algid, byref hash = 0, byref hashlength = 0)\\n{\\n static h := [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, \\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"D\\\", \\\"E\\\", \\\"F\\\"]\\n static b := h.minIndex()\\n o := \\\"\\\"\\n if (DllCall(\\\"advapi32\\\\CryptAcquireContext\\\", \\\"Ptr*\\\", hProv, \\\"Ptr\\\", 0, \\\"Ptr\\\", 0, \\\"UInt\\\", 24, \\\"UInt\\\", 0xF0000000))\\n {\\n if (DllCall(\\\"advapi32\\\\CryptCreateHash\\\", \\\"Ptr\\\", hProv, \\\"UInt\\\", algid, \\\"UInt\\\", 0, \\\"UInt\\\", 0, \\\"Ptr*\\\", hHash))\\n {\\n if (DllCall(\\\"advapi32\\\\CryptHashData\\\", \\\"Ptr\\\", hHash, \\\"Ptr\\\", addr, \\\"UInt\\\", length, \\\"UInt\\\", 0))\\n {\\n if (DllCall(\\\"advapi32\\\\CryptGetHashParam\\\", \\\"Ptr\\\", hHash, \\\"UInt\\\", 2, \\\"Ptr\\\", 0, \\\"UInt*\\\", hashlength, \\\"UInt\\\", 0))\\n {\\n VarSetCapacity(hash, hashlength, 0)\\n if (DllCall(\\\"advapi32\\\\CryptGetHashParam\\\", \\\"Ptr\\\", hHash, \\\"UInt\\\", 2, \\\"Ptr\\\", &hash, \\\"UInt*\\\", hashlength, \\\"UInt\\\", 0))\\n {\\n loop, % hashlength\\n {\\n v := NumGet(hash, A_Index - 1, \\\"UChar\\\")\\n o .= h[(v >> 4) + b] h[(v & 0xf) + b]\\n }\\n }\\n }\\n }\\n DllCall(\\\"advapi32\\\\CryptDestroyHash\\\", \\\"Ptr\\\", hHash)\\n }\\n DllCall(\\\"advapi32\\\\CryPtreleaseContext\\\", \\\"Ptr\\\", hProv, \\\"UInt\\\", 0)\\n }\\n return o\\n}\\n\\n; CalcStringHash ====================================================================\\nCalcStringHash(string, algid, encoding = \\\"utf-8\\\", byref hash = 0, byref hashlength = 0)\\n{\\n chrlength := (encoding = \\\"cp1200\\\" || encoding = \\\"utf-16\\\") ? 2 : 1\\n length := (StrPut(string, encoding) - 1) * chrlength\\n VarSetCapacity(data, length, 0)\\n StrPut(string, &data, floor(length / chrlength), encoding)\\n return CalcAddrHash(&data, length, algid, hash, hashlength)\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"/*\\n *\\n * Author: George Mossessian\\n *\\n * The MD4 hash algorithm, as described in https://tools.ietf.org/html/rfc1320\\n */\\n\\n\\n#include <stdlib.h>\\n#include <string.h>\\n#include <stdint.h>\\n\\nchar *MD4(char *str, int len); //this is the prototype you want to call. Everything else is internal.\\n\\ntypedef struct string{\\n char *c;\\n int len;\\n char sign;\\n}string;\\n\\nstatic uint32_t *MD4Digest(uint32_t *w, int len);\\nstatic void setMD4Registers(uint32_t AA, uint32_t BB, uint32_t CC, uint32_t DD);\\nstatic uint32_t changeEndianness(uint32_t x);\\nstatic void resetMD4Registers(void);\\nstatic string stringCat(string first, string second);\\nstatic string uint32ToString(uint32_t l);\\nstatic uint32_t stringToUint32(string s);\\n\\nstatic const char *BASE16 = \\\"0123456789abcdef=\\\";\\n\\n#define F(X,Y,Z) (((X)&(Y))|((~(X))&(Z)))\\n#define G(X,Y,Z) (((X)&(Y))|((X)&(Z))|((Y)&(Z)))\\n#define H(X,Y,Z) ((X)^(Y)^(Z))\\n\\n#define LEFTROTATE(A,N) ((A)<<(N))|((A)>>(32-(N)))\\n\\n#define MD4ROUND1(a,b,c,d,x,s) a += F(b,c,d) + x; a = LEFTROTATE(a, s);\\n#define MD4ROUND2(a,b,c,d,x,s) a += G(b,c,d) + x + (uint32_t)0x5A827999; a = LEFTROTATE(a, s);\\n#define MD4ROUND3(a,b,c,d,x,s) a += H(b,c,d) + x + (uint32_t)0x6ED9EBA1; a = LEFTROTATE(a, s);\\n\\nstatic uint32_t A = 0x67452301;\\nstatic uint32_t B = 0xefcdab89;\\nstatic uint32_t C = 0x98badcfe;\\nstatic uint32_t D = 0x10325476;\\n\\nstring newString(char * c, int t){\\n\\tstring r;\\n\\tint i;\\n\\tif(c!=NULL){\\n\\t\\tr.len = (t<=0)?strlen(c):t;\\n\\t\\tr.c=(char *)malloc(sizeof(char)*(r.len+1));\\n\\t\\tfor(i=0; i<r.len; i++) r.c[i]=c[i];\\n\\t\\tr.c[r.len]='\\\\0';\\n\\t\\treturn r;\\n\\t}\\n\\tr.len=t;\\n\\tr.c=(char *)malloc(sizeof(char)*(r.len+1));\\n\\tmemset(r.c,(char)0,sizeof(char)*(t+1));\\n\\tr.sign = 1;\\n\\treturn r;\\n}\\n\\nstring stringCat(string first, string second){\\n\\tstring str=newString(NULL, first.len+second.len);\\n\\tint i;\\n\\n\\tfor(i=0; i<first.len; i++){\\n\\t\\tstr.c[i]=first.c[i];\\n\\t}\\n\\tfor(i=first.len; i<str.len; i++){\\n\\t\\tstr.c[i]=second.c[i-first.len];\\n\\t}\\n\\treturn str;\\n}\\n\\nstring base16Encode(string in){\\n\\tstring out=newString(NULL, in.len*2);\\n\\tint i,j;\\n\\n\\tj=0;\\n\\tfor(i=0; i<in.len; i++){\\n\\t\\tout.c[j++]=BASE16[((in.c[i] & 0xF0)>>4)];\\n\\t\\tout.c[j++]=BASE16[(in.c[i] & 0x0F)];\\n\\t}\\n\\tout.c[j]='\\\\0';\\n\\treturn out;\\n}\\n\\n\\nstring uint32ToString(uint32_t l){\\n\\tstring s = newString(NULL,4);\\n\\tint i;\\n\\tfor(i=0; i<4; i++){\\n\\t\\ts.c[i] = (l >> (8*(3-i))) & 0xFF;\\n\\t}\\n\\treturn s;\\n}\\n\\nuint32_t stringToUint32(string s){\\n\\tuint32_t l;\\n\\tint i;\\n\\tl=0;\\n\\tfor(i=0; i<4; i++){\\n\\t\\tl = l|(((uint32_t)((unsigned char)s.c[i]))<<(8*(3-i)));\\n\\t}\\n\\treturn l;\\n}\\n\\nchar *MD4(char *str, int len){\\n\\tstring m=newString(str, len);\\n\\tstring digest;\\n\\tuint32_t *w;\\n\\tuint32_t *hash;\\n\\tuint64_t mlen=m.len;\\n\\tunsigned char oneBit = 0x80;\\n\\tint i, wlen;\\n\\n\\n\\tm=stringCat(m, newString((char *)&oneBit,1));\\n\\n\\t//append 0 ≤ k < 512 bits '0', such that the resulting message length in bits\\n\\t//\\tis congruent to −64 ≡ 448 (mod 512)4\\n\\ti=((56-m.len)%64);\\n\\tif(i<0) i+=64;\\n\\tm=stringCat(m,newString(NULL, i));\\n\\n\\tw = malloc(sizeof(uint32_t)*(m.len/4+2));\\n\\n\\t//append length, in bits (hence <<3), least significant word first\\n\\tfor(i=0; i<m.len/4; i++){\\n\\t\\tw[i]=stringToUint32(newString(&(m.c[4*i]), 4));\\n\\t}\\n\\tw[i++] = (mlen<<3) & 0xFFFFFFFF;\\n\\tw[i++] = (mlen>>29) & 0xFFFFFFFF;\\n\\n\\twlen=i;\\n\\n\\n\\t//change endianness, but not for the appended message length, for some reason?\\n\\tfor(i=0; i<wlen-2; i++){\\n\\t\\tw[i]=changeEndianness(w[i]);\\n\\t}\\n\\n\\thash = MD4Digest(w,wlen);\\n\\n\\tdigest=newString(NULL,0);\\n\\tfor(i=0; i<4; i++){\\n\\t\\thash[i]=changeEndianness(hash[i]);\\n\\t\\tdigest=stringCat(digest,uint32ToString(hash[i]));\\n\\t}\\n\\n\\treturn base16Encode(digest).c;\\n}\\n\\nuint32_t *MD4Digest(uint32_t *w, int len){\\n\\t//assumes message.len is a multiple of 64 bytes.\\n\\tint i,j;\\n\\tuint32_t X[16];\\n\\tuint32_t *digest = malloc(sizeof(uint32_t)*4);\\n\\tuint32_t AA, BB, CC, DD;\\n\\n\\tfor(i=0; i<len/16; i++){\\n\\t\\tfor(j=0; j<16; j++){\\n\\t\\t\\tX[j]=w[i*16+j];\\n\\t\\t}\\n\\n\\t\\tAA=A;\\n\\t\\tBB=B;\\n\\t\\tCC=C;\\n\\t\\tDD=D;\\n\\n\\t\\tMD4ROUND1(A,B,C,D,X[0],3);\\n\\t\\tMD4ROUND1(D,A,B,C,X[1],7);\\n\\t\\tMD4ROUND1(C,D,A,B,X[2],11);\\n\\t\\tMD4ROUND1(B,C,D,A,X[3],19);\\n\\t\\tMD4ROUND1(A,B,C,D,X[4],3);\\n\\t\\tMD4ROUND1(D,A,B,C,X[5],7);\\n\\t\\tMD4ROUND1(C,D,A,B,X[6],11);\\n\\t\\tMD4ROUND1(B,C,D,A,X[7],19);\\n\\t\\tMD4ROUND1(A,B,C,D,X[8],3);\\n\\t\\tMD4ROUND1(D,A,B,C,X[9],7);\\n\\t\\tMD4ROUND1(C,D,A,B,X[10],11);\\n\\t\\tMD4ROUND1(B,C,D,A,X[11],19);\\n\\t\\tMD4ROUND1(A,B,C,D,X[12],3);\\n\\t\\tMD4ROUND1(D,A,B,C,X[13],7);\\n\\t\\tMD4ROUND1(C,D,A,B,X[14],11);\\n\\t\\tMD4ROUND1(B,C,D,A,X[15],19);\\n\\n\\t\\tMD4ROUND2(A,B,C,D,X[0],3);\\n\\t\\tMD4ROUND2(D,A,B,C,X[4],5);\\n\\t\\tMD4ROUND2(C,D,A,B,X[8],9);\\n\\t\\tMD4ROUND2(B,C,D,A,X[12],13);\\n\\t\\tMD4ROUND2(A,B,C,D,X[1],3);\\n\\t\\tMD4ROUND2(D,A,B,C,X[5],5);\\n\\t\\tMD4ROUND2(C,D,A,B,X[9],9);\\n\\t\\tMD4ROUND2(B,C,D,A,X[13],13);\\n\\t\\tMD4ROUND2(A,B,C,D,X[2],3);\\n\\t\\tMD4ROUND2(D,A,B,C,X[6],5);\\n\\t\\tMD4ROUND2(C,D,A,B,X[10],9);\\n\\t\\tMD4ROUND2(B,C,D,A,X[14],13);\\n\\t\\tMD4ROUND2(A,B,C,D,X[3],3);\\n\\t\\tMD4ROUND2(D,A,B,C,X[7],5);\\n\\t\\tMD4ROUND2(C,D,A,B,X[11],9);\\n\\t\\tMD4ROUND2(B,C,D,A,X[15],13);\\n\\n\\t\\tMD4ROUND3(A,B,C,D,X[0],3);\\n\\t\\tMD4ROUND3(D,A,B,C,X[8],9);\\n\\t\\tMD4ROUND3(C,D,A,B,X[4],11);\\n\\t\\tMD4ROUND3(B,C,D,A,X[12],15);\\n\\t\\tMD4ROUND3(A,B,C,D,X[2],3);\\n\\t\\tMD4ROUND3(D,A,B,C,X[10],9);\\n\\t\\tMD4ROUND3(C,D,A,B,X[6],11);\\n\\t\\tMD4ROUND3(B,C,D,A,X[14],15);\\n\\t\\tMD4ROUND3(A,B,C,D,X[1],3);\\n\\t\\tMD4ROUND3(D,A,B,C,X[9],9);\\n\\t\\tMD4ROUND3(C,D,A,B,X[5],11);\\n\\t\\tMD4ROUND3(B,C,D,A,X[13],15);\\n\\t\\tMD4ROUND3(A,B,C,D,X[3],3);\\n\\t\\tMD4ROUND3(D,A,B,C,X[11],9);\\n\\t\\tMD4ROUND3(C,D,A,B,X[7],11);\\n\\t\\tMD4ROUND3(B,C,D,A,X[15],15);\\n\\n\\t\\tA+=AA;\\n\\t\\tB+=BB;\\n\\t\\tC+=CC;\\n\\t\\tD+=DD;\\n\\t}\\n\\n\\tdigest[0]=A;\\n\\tdigest[1]=B;\\n\\tdigest[2]=C;\\n\\tdigest[3]=D;\\n\\tresetMD4Registers();\\n\\treturn digest;\\n}\\n\\nuint32_t changeEndianness(uint32_t x){\\n\\treturn ((x & 0xFF) << 24) | ((x & 0xFF00) << 8) | ((x & 0xFF0000) >> 8) | ((x & 0xFF000000) >> 24);\\n}\\n\\nvoid setMD4Registers(uint32_t AA, uint32_t BB, uint32_t CC, uint32_t DD){\\n\\tA=AA;\\n\\tB=BB;\\n\\tC=CC;\\n\\tD=DD;\\n}\\n\\nvoid resetMD4Registers(void){\\n\\tsetMD4Registers(0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476);\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"printf(\\\"%s\\\\n\\\", MD4(\\\"Rosetta Code\\\", 12));\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <cstdint>\\n#include <iomanip>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\n\\nclass MD4 {\\npublic:\\n\\tMD4() {\\n\\t\\tengine_reset();\\n\\t}\\n\\n\\tstd::vector<int8_t> engine_digest(const std::string& text) {\\n\\t\\tengine_update(string_to_byte_vector(text), 0, text.length());\\n\\n\\t\\tconst int32_t buffer_index = static_cast<int32_t>(count % BLOCK_LENGTH);\\n\\t\\tconst int32_t padding_length = ( buffer_index < 56 ) ? 56 - buffer_index : 120 - buffer_index;\\n\\n\\t\\tstd::vector<int8_t> tail(padding_length + 8, 0);\\n\\t\\ttail[0] = static_cast<int8_t>(0x80);\\n\\n\\t\\tfor ( int32_t i = 0; i < 8; ++i ) {\\n\\t\\t\\ttail[padding_length + i] = static_cast<int8_t>(unsigned_right_shift(count * 8, 8 * i));\\n\\t\\t}\\n\\n\\t\\tengine_update(tail, 0, tail.size());\\n\\n\\t\\tstd::vector<int8_t> result(16, 0);\\n\\t\\tfor ( int32_t i = 0; i < 4; ++i ) {\\n\\t\\t\\tfor ( int32_t j = 0; j < 4; ++j ) {\\n\\t\\t\\t\\tresult[i * 4 + j] = static_cast<int8_t>(unsigned_right_shift(context[i], 8 * j));\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tengine_reset();\\n\\t\\treturn result;\\n\\t}\\n\\nprivate:\\n\\tvoid engine_update(const std::vector<int8_t>& message_bytes,\\n\\t\\t\\t\\t\\t const int32_t& offset, const int32_t& message_length) {\\n\\t\\tif ( offset < 0 || message_length < 0\\n\\t\\t\\t|| (int64_t) offset + message_length > (int64_t) message_bytes.size() ) {\\n\\t\\t\\tthrow std::invalid_argument(\\\"Incorrect arguments for function engine_update\\\");\\n\\t\\t}\\n\\n\\t\\tint32_t buffer_index = static_cast<int32_t>(count % BLOCK_LENGTH);\\n\\t\\tcount += message_length;\\n\\t\\tconst int32_t partial_length = BLOCK_LENGTH - buffer_index;\\n\\t\\tint32_t i = 0;\\n\\n\\t\\tif ( message_length >= partial_length ) {\\n\\t\\t\\tfor ( int32_t j = 0; j < partial_length; ++j ) {\\n\\t\\t\\t\\tbuffer[buffer_index + j] = message_bytes[offset + j];\\n\\t\\t\\t}\\n\\t\\t\\ttransform(buffer, 0);\\n\\t\\t\\ti = partial_length;\\n\\t\\t\\twhile ( i + BLOCK_LENGTH - 1 < message_length ) {\\n\\t\\t\\t\\ttransform(message_bytes, offset + i);\\n\\t\\t\\t\\ti += BLOCK_LENGTH;\\n\\t\\t\\t}\\n\\t\\t\\tbuffer_index = 0;\\n\\t\\t}\\n\\n\\t\\tif ( i < message_length ) {\\n\\t\\t\\tfor ( int32_t j = 0; j < message_length - i; ++j ) {\\n\\t\\t\\t\\tbuffer[buffer_index + j] = message_bytes[offset + i + j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvoid transform(const std::vector<int8_t>& buffer, int32_t offset) {\\n\\t\\tfor ( int32_t i = 0; i < 16; ++i ) {\\n\\t\\t\\textra[i] = ( ( buffer[offset + 0] & 0xff ) ) |\\n\\t\\t\\t\\t\\t ( ( buffer[offset + 1] & 0xff ) << 8 ) |\\n\\t\\t\\t\\t\\t ( ( buffer[offset + 2] & 0xff ) << 16 ) |\\n\\t\\t\\t\\t\\t ( ( buffer[offset + 3] & 0xff ) << 24 );\\n\\t\\t\\toffset += 4;\\n\\t\\t}\\n\\n\\t\\tint32_t a = context[0];\\n\\t\\tint32_t b = context[1];\\n\\t\\tint32_t c = context[2];\\n\\t\\tint32_t d = context[3];\\n\\n\\t\\tfor ( const int32_t& i : { 0, 4, 8, 12 } ) {\\n\\t\\t\\ta = ff(a, b, c, d, extra[i + 0], 3);\\n\\t\\t\\td = ff(d, a, b, c, extra[i + 1], 7);\\n\\t\\t\\tc = ff(c, d, a, b, extra[i + 2], 11);\\n\\t\\t\\tb = ff(b, c, d, a, extra[i + 3], 19);\\n\\t\\t}\\n\\n\\t\\tfor ( const int32_t& i : { 0, 1, 2, 3 } ) {\\n\\t\\t\\ta = gg(a, b, c, d, extra[i + 0], 3);\\n\\t\\t\\td = gg(d, a, b, c, extra[i + 4], 5);\\n\\t\\t\\tc = gg(c, d, a, b, extra[i + 8], 9);\\n\\t\\t\\tb = gg(b, c, d, a, extra[i + 12], 13);\\n\\t\\t}\\n\\n\\t\\tfor ( const int32_t& i : { 0, 2, 1, 3 } ) {\\n\\t\\t\\ta = hh(a, b, c, d, extra[i + 0], 3);\\n\\t\\t\\td = hh(d, a, b, c, extra[i + 8], 9);\\n\\t\\t\\tc = hh(c, d, a, b, extra[i + 4], 11);\\n\\t\\t\\tb = hh(b, c, d, a, extra[i + 12], 15);\\n\\t\\t}\\n\\n\\t\\tcontext[0] += a;\\n\\t\\tcontext[1] += b;\\n\\t\\tcontext[2] += c;\\n\\t\\tcontext[3] += d;\\n\\t}\\n\\n\\tvoid engine_reset() {\\n\\t\\tcount = 0;\\n\\t\\tcontext.assign(4, 0);\\n\\t\\tcontext[0] = 0x67452301;\\n\\t\\tcontext[1] = 0xefcdab89;\\n\\t\\tcontext[2] = 0x98badcfe;\\n\\t\\tcontext[3] = 0x10325476;\\n\\t\\textra.assign(16, 0);\\n\\t\\tbuffer.assign(BLOCK_LENGTH, 0);\\n\\t}\\n\\n\\tstd::vector<int8_t> string_to_byte_vector(const std::string& text) {\\n\\t\\tstd::vector<int8_t> bytes;\\n\\t\\tbytes.reserve(text.size());\\n\\n\\t\\tstd::transform(text.begin(), text.end(), std::back_inserter(bytes),\\n\\t\\t\\t[](char ch){ return static_cast<int8_t>(ch); });\\n\\n\\t\\treturn bytes;\\n\\t}\\n\\n\\tint32_t unsigned_right_shift(const int32_t& base, const int32_t& shift) {\\n\\t\\tif ( shift < 0 || shift >= 32 || base == 0 ) {\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\treturn ( base > 0 ) ? base >> shift : static_cast<uint32_t>(base) >> shift;\\n\\t}\\n\\n\\tint32_t rotate(const int32_t& t, const int32_t& s) {\\n\\t\\treturn ( t << s ) | unsigned_right_shift(t, 32 - s);\\n\\t}\\n\\n\\tint32_t ff(const int32_t& a, const int32_t& b, const int32_t& c,\\n\\t\\t\\t const int32_t& d, const int32_t& x, const int32_t& s) {\\n\\t\\treturn rotate(a + ( ( b & c ) | ( ~b & d ) ) + x, s);\\n\\t}\\n\\n\\tint32_t gg(const int32_t& a, const int32_t& b, const int32_t& c,\\n\\t\\t\\t const int32_t& d, const int32_t& x, const int32_t& s) {\\n\\t\\treturn rotate(a + ( ( b & ( c | d ) ) | ( c & d ) ) + x + 0x5A827999, s);\\n\\t}\\n\\n\\tint32_t hh(const int32_t& a, const int32_t& b, const int32_t& c,\\n\\t\\t\\t const int32_t& d, const int32_t& x, const int32_t& s) {\\n\\t\\treturn rotate(a + ( b ^ c ^ d ) + x + 0x6ED9EBA1, s);\\n\\t}\\n\\n\\tuint64_t count;\\n std::vector<int32_t> context;\\n std::vector<int32_t> extra;\\n std::vector<int8_t> buffer;\\n\\n const int32_t BLOCK_LENGTH = 64;\\n};\\n\\nint main() {\\n\\tMD4 md4;\\n\\tstd::vector<int8_t> result = md4.engine_digest(\\\"Rosetta Code\\\");\\n\\n\\tfor ( const int8_t& bb : result ) {\\n\\t\\tstd::cout << std::hex << std::setfill('0') << std::setw(2) << ( bb & 0xff );\\n\\t}\\n\\tstd::cout << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\nusing System.Text;\\nstatic class Md4\\n{\\n public static string Md4Hash(this string input)\\n {\\n // get padded uints from bytes\\n List<byte> bytes = Encoding.ASCII.GetBytes(input).ToList();\\n uint bitCount = (uint)(bytes.Count) * 8;\\n bytes.Add(128);\\n while (bytes.Count % 64 != 56) bytes.Add(0);\\n var uints = new List<uint>();\\n for (int i = 0; i + 3 < bytes.Count; i += 4)\\n uints.Add(bytes[i] | (uint)bytes[i + 1] << 8 | (uint)bytes[i + 2] << 16 | (uint)bytes[i + 3] << 24);\\n uints.Add(bitCount);\\n uints.Add(0);\\n\\n // run rounds\\n uint a = 0x67452301, b = 0xefcdab89, c = 0x98badcfe, d = 0x10325476;\\n Func<uint, uint, uint> rol = (x, y) => x << (int)y | x >> 32 - (int)y;\\n for (int q = 0; q + 15 < uints.Count; q += 16)\\n {\\n var chunk = uints.GetRange(q, 16);\\n uint aa = a, bb = b, cc = c, dd = d;\\n Action<Func<uint, uint, uint, uint>, uint[]> round = (f, y) =>\\n {\\n foreach (uint i in new[] { y[0], y[1], y[2], y[3] })\\n {\\n a = rol(a + f(b, c, d) + chunk[(int)(i + y[4])] + y[12], y[8]);\\n d = rol(d + f(a, b, c) + chunk[(int)(i + y[5])] + y[12], y[9]);\\n c = rol(c + f(d, a, b) + chunk[(int)(i + y[6])] + y[12], y[10]);\\n b = rol(b + f(c, d, a) + chunk[(int)(i + y[7])] + y[12], y[11]);\\n }\\n };\\n round((x, y, z) => (x & y) | (~x & z), new uint[] { 0, 4, 8, 12, 0, 1, 2, 3, 3, 7, 11, 19, 0 });\\n round((x, y, z) => (x & y) | (x & z) | (y & z), new uint[] { 0, 1, 2, 3, 0, 4, 8, 12, 3, 5, 9, 13, 0x5a827999 });\\n round((x, y, z) => x ^ y ^ z, new uint[] { 0, 2, 1, 3, 0, 8, 4, 12, 3, 9, 11, 15, 0x6ed9eba1 });\\n a += aa; b += bb; c += cc; d += dd;\\n }\\n\\n // return hex encoded string\\n byte[] outBytes = new[] { a, b, c, d }.SelectMany(BitConverter.GetBytes).ToArray();\\n return BitConverter.ToString(outBytes).Replace(\\\"-\\\", \\\"\\\").ToLower();\\n }\\n static void Main() { Console.WriteLine(\\\"Rosetta Code\\\".Md4Hash()); }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(use 'pandect.core)\\n(md4 \\\"Rosetta Code\\\")\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(ql:quickload 'ironclad)\\n(defun md4 (str)\\n (ironclad:byte-array-to-hex-string\\n (ironclad:digest-sequence :md4\\n (ironclad:ascii-string-to-byte-array str))))\\n\\n(md4 \\\"Rosetta Code\\\")\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.string, std.range;\\n\\nubyte[16] md4(const(ubyte)[] inData) pure nothrow {\\n enum f = (uint x, uint y, uint z) => (x & y) | (~x & z);\\n enum g = (uint x, uint y, uint z) => (x & y) | (x & z) | (y & z);\\n enum h = (uint x, uint y, uint z) => x ^ y ^ z;\\n enum r = (uint v, uint s) => (v << s) | (v >> (32 - s));\\n\\n immutable bitLen = ulong(inData.length) << 3;\\n inData ~= 0x80;\\n while (inData.length % 64 != 56)\\n inData ~= 0;\\n const data = cast(uint[])inData ~ [uint(bitLen & uint.max), uint(bitLen >> 32)];\\n\\n uint a = 0x67452301, b = 0xefcdab89, c = 0x98badcfe, d = 0x10325476;\\n\\n foreach (const x; data.chunks(16)) {\\n immutable a2 = a, b2 = b, c2 = c, d2 = d;\\n foreach (immutable i; [0, 4, 8, 12]) {\\n a = r(a + f(b, c, d) + x[i+0], 3);\\n d = r(d + f(a, b, c) + x[i+1], 7);\\n c = r(c + f(d, a, b) + x[i+2], 11);\\n b = r(b + f(c, d, a) + x[i+3], 19);\\n }\\n foreach (immutable i; [0, 1, 2, 3]) {\\n a = r(a + g(b, c, d) + x[i+0] + 0x5a827999, 3);\\n d = r(d + g(a, b, c) + x[i+4] + 0x5a827999, 5);\\n c = r(c + g(d, a, b) + x[i+8] + 0x5a827999, 9);\\n b = r(b + g(c, d, a) + x[i+12] + 0x5a827999, 13);\\n }\\n foreach (immutable i; [0, 2, 1, 3]) {\\n a = r(a + h(b, c, d) + x[i+0] + 0x6ed9eba1, 3);\\n d = r(d + h(a, b, c) + x[i+8] + 0x6ed9eba1, 9);\\n c = r(c + h(d, a, b) + x[i+4] + 0x6ed9eba1, 11);\\n b = r(b + h(c, d, a) + x[i+12] + 0x6ed9eba1, 15);\\n }\\n a += a2, b += b2, c += c2, d += d2;\\n }\\n\\n //return cast(ubyte[16])[a, b, c, d];\\n immutable uint[4] result = [a, b, c, d];\\n return cast(ubyte[16])result;\\n}\\n\\nvoid main() {\\n writefln(\\\"%(%02x%)\\\", \\\"Rosetta Code\\\".representation.md4);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program CalcMD4;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils,\\n DCPmd4;\\n\\nfunction MD4(const Str: string): string;\\nvar\\n HashDigest: array of byte;\\n d: Byte;\\nbegin\\n Result := '';\\n with TDCP_md4.Create(nil) do\\n begin\\n Init;\\n UpdateStr(Str);\\n SetLength(HashDigest, GetHashSize div 8);\\n final(HashDigest[0]);\\n for d in HashDigest do\\n Result := Result + d.ToHexString(2);\\n Free;\\n end;\\nend;\\n\\nbegin\\n Writeln(MD4('Rosetta Code'));\\n readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"(require 'md4)\\n(require 'hex-util)\\n(let* ((s \\\"Rosetta Code\\\")\\n (m (md4 s (length s)))) ;; m = 16 binary bytes\\n (encode-hex-string m))\\n=>\\n\\\"a52bcfc6a0d0d300cdc5ddbfbefe478b\\\"\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"-module(md4).\\n-export([md4/0]).\\n\\nmd4() ->\\n <<MD4:128>> = crypto:md4(\\\"Rosetta Code\\\"),\\n io:fwrite(\\\"Rosetta Code => ~.16B~n\\\",[MD4]).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"' version 19-10-2016\\n' translation of the (pseudo) code in RFC 1320\\n' compile with: fbc -s console\\n\\nFunction MD4(test_str As String) As String\\n\\n Dim As String message = test_str ' string are passed as ByRef\\n\\n ' some macro's\\n #Macro F(X, Y, Z)\\n (((X) And (Y)) Or ((Not(X)) And (Z)))\\n #EndMacro\\n\\n #Macro G(X, Y, Z)\\n (((X) And (Y)) Or (((X) And (Z)) Or ((Y) And (Z))))\\n #EndMacro\\n\\n #Macro H(X, Y, Z)\\n ((X) Xor (Y) Xor (Z))\\n #EndMacro\\n\\n ' a little piece of inline asm to do a rotate left on a 32bit variable\\n #Macro ROtate_Left(x, n) ' rotate left\\n Asm\\n rol dword Ptr [x], n\\n End Asm\\n #EndMacro\\n\\n ' #Macro ROtate_left(x, n)\\n ' x = x Shl n + x Shr (32 - n)\\n ' #EndMacro\\n\\n Dim As Long i\\n Dim As String answer, s1\\n\\n Dim As ULongInt l = Len(message)\\n ' set the first bit after the message to 1\\n message = message + Chr(1 Shl 7)\\n ' add one char to the length\\n Dim As ULong padding = 64 - ((l +1) Mod (512 \\\\ 8)) ' 512 \\\\ 8 = 64 char.\\n\\n ' check if we have enough room for inserting the length\\n If padding < 8 Then padding = padding + 64\\n\\n message = message + String(padding, Chr(0)) ' adjust length\\n Dim As ULong l1 = Len(message) ' new length\\n\\n l = l * 8 ' orignal length in bits\\n ' create ubyte ptr to point to l ( = length in bits)\\n Dim As UByte Ptr ub_ptr = Cast(UByte Ptr, @l)\\n\\n For i = 0 To 7 'copy length of message to the last 8 bytes\\n message[l1 -8 + i] = ub_ptr[i]\\n Next\\n\\n ' unsigned 32bit integers only\\n Dim As UInteger<32> AA, A = &H67452301\\n Dim As UInteger<32> BB, B = &Hefcdab89\\n Dim As UInteger<32> CC, C = &H98badcfe\\n Dim As UInteger<32> DD, D = &H10325476\\n\\n For i = 0 To (l1 -1) \\\\ 64 ' split into 64 byte block\\n\\n AA = A : BB = B : CC = C : DD = D\\n\\n ' x point to 64 byte block inside the string message\\n Dim As UInteger<32> Ptr x = Cast(UInteger<32> Ptr, @message[i*64])\\n\\n ' round 1\\n A = A + F(B, C, D) + x[ 0] : ROtate_Left(A, 3)\\n D = D + F(A, B, C) + x[ 1] : ROtate_Left(D, 7)\\n C = C + F(D, A, B) + x[ 2] : ROtate_Left(C, 11)\\n B = B + F(C, D, A) + x[ 3] : ROtate_Left(B, 19)\\n A = A + F(B, C, D) + x[ 4] : ROtate_Left(A, 3)\\n D = D + F(A, B, C) + x[ 5] : ROtate_Left(D, 7)\\n C = C + F(D, A, B) + x[ 6] : ROtate_Left(C, 11)\\n B = B + F(C, D, A) + x[ 7] : ROtate_Left(B, 19)\\n A = A + F(B, C, D) + x[ 8] : ROtate_Left(A, 3)\\n D = D + F(A, B, C) + x[ 9] : ROtate_Left(D, 7)\\n C = C + F(D, A, B) + x[10] : ROtate_Left(C, 11)\\n B = B + F(C, D, A) + x[11] : ROtate_Left(B, 19)\\n A = A + F(B, C, D) + x[12] : ROtate_Left(A, 3)\\n D = D + F(A, B, C) + x[13] : ROtate_Left(D, 7)\\n C = C + F(D, A, B) + x[14] : ROtate_Left(C, 11)\\n B = B + F(C, D, A) + x[15] : ROtate_Left(B, 19)\\n\\n ' round 2\\n A = A + G(B, C, D) + x[ 0] + &H5A827999 : ROtate_Left(A, 3)\\n D = D + G(A, B, C) + x[ 4] + &H5A827999 : ROtate_Left(D, 5)\\n C = C + G(D, A, B) + x[ 8] + &H5A827999 : ROtate_Left(C, 9)\\n B = B + G(C, D, A) + x[12] + &H5A827999 : ROtate_Left(B, 13)\\n A = A + G(B, C, D) + x[ 1] + &H5A827999 : ROtate_Left(A, 3)\\n D = D + G(A, B, C) + x[ 5] + &H5A827999 : ROtate_Left(D, 5)\\n C = C + G(D, A, B) + x[ 9] + &H5A827999 : ROtate_Left(C, 9)\\n B = B + G(C, D, A) + x[13] + &H5A827999 : ROtate_Left(B, 13)\\n A = A + G(B, C, D) + x[ 2] + &H5A827999 : ROtate_Left(A, 3)\\n D = D + G(A, B, C) + x[ 6] + &H5A827999 : ROtate_Left(D, 5)\\n C = C + G(D, A, B) + x[10] + &H5A827999 : ROtate_Left(C, 9)\\n B = B + G(C, D, A) + x[14] + &H5A827999 : ROtate_Left(B, 13)\\n A = A + G(B, C, D) + x[ 3] + &H5A827999 : ROtate_Left(A, 3)\\n D = D + G(A, B, C) + x[ 7] + &H5A827999 : ROtate_Left(D, 5)\\n C = C + G(D, A, B) + x[11] + &H5A827999 : ROtate_Left(C, 9)\\n B = B + G(C, D, A) + x[15] + &H5A827999 : ROtate_Left(B, 13)\\n\\n ' round 3\\n A = A + H(B, C, D) + x[ 0] + &H6ED9EBA1 : ROtate_Left(A, 3)\\n D = D + H(A, B, C) + x[ 8] + &H6ED9EBA1 : ROtate_Left(D, 9)\\n C = C + H(D, A, B) + x[ 4] + &H6ED9EBA1 : ROtate_Left(C, 11)\\n B = B + H(C, D, A) + x[12] + &H6ED9EBA1 : ROtate_Left(B, 15)\\n A = A + H(B, C, D) + x[ 2] + &H6ED9EBA1 : ROtate_Left(A, 3)\\n D = D + H(A, B, C) + x[10] + &H6ED9EBA1 : ROtate_Left(D, 9)\\n C = C + H(D, A, B) + x[ 6] + &H6ED9EBA1 : ROtate_Left(C, 11)\\n B = B + H(C, D, A) + x[14] + &H6ED9EBA1 : ROtate_Left(B, 15)\\n A = A + H(B, C, D) + x[ 1] + &H6ED9EBA1 : ROtate_Left(A, 3)\\n D = D + H(A, B, C) + x[ 9] + &H6ED9EBA1 : ROtate_Left(D, 9)\\n C = C + H(D, A, B) + x[ 5] + &H6ED9EBA1 : ROtate_Left(C, 11)\\n B = B + H(C, D, A) + x[13] + &H6ED9EBA1 : ROtate_Left(B, 15)\\n A = A + H(B, C, D) + x[ 3] + &H6ED9EBA1 : ROtate_Left(A, 3)\\n D = D + H(A, B, C) + x[11] + &H6ED9EBA1 : ROtate_Left(D, 9)\\n C = C + H(D, A, B) + x[ 7] + &H6ED9EBA1 : ROtate_Left(C, 11)\\n B = B + H(C, D, A) + x[15] + &H6ED9EBA1 : ROtate_Left(B, 15)\\n\\n A += AA : B += BB : C += CC : D += DD\\n\\n Next\\n\\n ' convert A, B, C and D in hex, then add low order first\\n s1 = Hex(A, 8)\\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\\n s1 = Hex(B, 8)\\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\\n s1 = Hex(C, 8)\\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\\n s1 = Hex(D, 8)\\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\\n\\nReturn LCase(answer)\\n\\nEnd Function\\n\\n' ------=< MAIN >=------\\n\\nDim As String test = \\\"Rosetta Code\\\"\\nPrint\\nPrint test; \\\" => \\\"; MD4(test)\\n\\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 \\\"golang.org/x/crypto/md4\\\"\\n \\\"fmt\\\"\\n)\\n\\nfunc main() {\\n h := md4.New()\\n h.Write([]byte(\\\"Rosetta Code\\\"))\\n fmt.Printf(\\\"%x\\\\n\\\", h.Sum(nil))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"#!/usr/bin/env runhaskell\\n\\nimport Data.ByteString.Char8 (pack)\\nimport System.Environment (getArgs)\\nimport Crypto.Hash\\n\\nmain :: IO ()\\nmain = print . md4 . pack . unwords =<< getArgs\\n where md4 x = hash x :: Digest MD4\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" require 'ide/qt'\\n gethash_jqtide_ 'MD4';'Rosetta Code'\\na52bcfc6a0d0d300cdc5ddbfbefe478b\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import org.bouncycastle.crypto.digests.MD4Digest;\\nimport org.bouncycastle.util.encoders.Hex;\\n\\npublic class RosettaMD4\\n{\\n public static void main (String[] argv) throws Exception\\n {\\n byte[] r = \\\"Rosetta Code\\\".getBytes(\\\"US-ASCII\\\");\\n MD4Digest d = new MD4Digest();\\n d.update (r, 0, r.length);\\n byte[] o = new byte[d.getDigestSize()];\\n d.doFinal (o, 0);\\n Hex.encode (o, System.out);\\n System.out.println();\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.util.Arrays;\\nimport java.util.List;\\n\\npublic final class MD4Task {\\n\\t\\n\\tpublic static void main(String[] aArgs) {\\n\\t\\tString text = \\\"Rosetta Code\\\";\\n\\t\\n\\t MD4 md4 = new MD4();\\t\\n\\t byte[] result = md4.engineDigest(text);\\n\\t \\t\\t\\n\\t\\tStringBuilder stringBuilder = new StringBuilder();\\n\\t for ( byte bb : result ) {\\n stringBuilder.append(String.format(\\\"%02x\\\", bb));\\n }\\n System.out.println(stringBuilder.toString());\\n\\t}\\n\\t\\n}\\n\\t\\nfinal class MD4 {\\n\\t\\n\\tpublic MD4() {\\n\\t\\tengineReset();\\n\\t}\\t\\n\\n\\tpublic byte[] engineDigest(String aText) {\\n\\t\\tengineUpdate(aText.getBytes(), 0, aText.length());\\t\\t\\n\\t\\t\\n final int bufferIndex = (int) ( count % BLOCK_LENGTH );\\n final int paddingLength = ( bufferIndex < 56 ) ? 56 - bufferIndex : 120 - bufferIndex;\\n\\n byte[] tail = new byte[paddingLength + 8];\\n tail[0] = (byte) 0x80;\\n\\n for ( int i = 0; i < 8; i++ ) {\\n tail[paddingLength + i] = (byte) ( ( count * 8 ) >>> ( 8 * i ) );\\n }\\n\\n engineUpdate(tail, 0, tail.length);\\n\\n byte[] result = new byte[16];\\n for ( int i = 0; i < 4; i++ ) {\\n for ( int j = 0; j < 4; j++ ) {\\n result[i * 4 + j] = (byte) ( context[i] >>> ( 8 * j ) );\\n }\\n }\\n\\n engineReset();\\n return result;\\n\\t}\\n\\t\\n\\tprivate void engineUpdate(byte[] aMessageBytes, int aOffset, int aMessageLength) {\\n if ( aOffset < 0 || aMessageLength < 0 || (long) aOffset + aMessageLength > (long) aMessageBytes.length ) {\\n throw new ArrayIndexOutOfBoundsException(\\\"Incorrect arguments for method engineUpdate\\\");\\n }\\n\\n int bufferIndex = (int) ( count % BLOCK_LENGTH );\\n count += aMessageLength;\\n final int partialLength = BLOCK_LENGTH - bufferIndex;\\n int i = 0;\\n\\n if ( aMessageLength >= partialLength ) {\\n System.arraycopy(aMessageBytes, aOffset, buffer, bufferIndex, partialLength);\\n transform(buffer, 0);\\t\\n i = partialLength;\\t\\n while ( i + BLOCK_LENGTH - 1 < aMessageLength ) {\\n transform(aMessageBytes, aOffset + i);\\n i += BLOCK_LENGTH;\\n }\\n bufferIndex = 0;\\n }\\n\\n if ( i < aMessageLength ) {\\n \\tSystem.arraycopy(aMessageBytes, aOffset + i, buffer, bufferIndex, aMessageLength - i);\\n }\\n }\\n\\t\\n\\tprivate void transform (byte[] aBuffer, int aOffset) {\\n for ( int i = 0; i < 16; i++ ) {\\n extra[i] = ( ( aBuffer[aOffset++] & 0xff ) ) |\\n \\t\\t ( ( aBuffer[aOffset++] & 0xff ) << 8 ) |\\n ( ( aBuffer[aOffset++] & 0xff ) << 16 ) |\\n ( ( aBuffer[aOffset++] & 0xff ) << 24 );\\n }\\n\\n int a = context[0];\\n int b = context[1];\\n int c = context[2];\\n int d = context[3];\\n\\n for ( int i : List.of( 0, 4, 8, 12 ) ) {\\n \\ta = ff(a, b, c, d, extra[i + 0], 3);\\n\\t d = ff(d, a, b, c, extra[i + 1], 7);\\n\\t c = ff(c, d, a, b, extra[i + 2], 11);\\n\\t b = ff(b, c, d, a, extra[i + 3], 19);\\n }\\n\\n for ( int i : List.of( 0, 1, 2, 3 ) ) {\\n \\ta = gg(a, b, c, d, extra[i + 0], 3);\\n \\t d = gg(d, a, b, c, extra[i + 4], 5);\\n \\t c = gg(c, d, a, b, extra[i + 8], 9);\\n \\t b = gg(b, c, d, a, extra[i + 12], 13);\\n }\\n\\n for ( int i : List.of( 0, 2, 1, 3 ) ) {\\n \\ta = hh(a, b, c, d, extra[i + 0], 3);\\n \\t d = hh(d, a, b, c, extra[i + 8], 9);\\n \\t c = hh(c, d, a, b, extra[i + 4], 11);\\n \\t b = hh(b, c, d, a, extra[i + 12], 15);\\n }\\n\\n context[0] += a;\\n context[1] += b;\\n context[2] += c;\\n context[3] += d;\\n }\\n\\t\\n\\tprivate void engineReset() {\\n\\t\\tcount = 0;\\n context[0] = 0x67452301;\\n context[1] = 0xefcdab89;\\n context[2] = 0x98badcfe;\\n context[3] = 0x10325476;\\n Arrays.fill(extra, 0);\\n Arrays.fill(buffer, (byte) 0);\\n }\\n\\t\\n\\tprivate static int rotate(int t, int s) {\\n\\t\\treturn t << s | t >>> ( 32 - s );\\n\\t}\\n\\t\\n\\tprivate static int ff(int a, int b, int c, int d, int x, int s) {\\n\\t return rotate(a + ( ( b & c ) | ( ~b & d ) ) + x, s);\\n\\t}\\n\\t\\n\\tprivate static int gg(int a, int b, int c, int d, int x, int s) {\\n\\t return rotate(a + ( ( b & ( c | d ) ) | ( c & d ) ) + x + 0x5A827999, s);\\n\\t}\\n\\t\\n\\tprivate static int hh(int a, int b, int c, int d, int x, int s) {\\n\\t return rotate(a + ( b ^ c ^ d ) + x + 0x6ED9EBA1, s);\\n\\t}\\n\\t\\n\\tprivate static final int BLOCK_LENGTH = 64;\\n\\t\\n\\tprivate long count;\\n private int[] context = new int[4];\\t \\t\\n private int[] extra = new int[16];\\t\\n private byte[] buffer = new byte[BLOCK_LENGTH];\\n\\n}\\t\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"const md4func = () => {\\n\\n const hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */\\n const b64pad = \\\"\\\"; /* base-64 pad character. \\\"=\\\" for strict RFC compliance */\\n const chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */\\n\\n const tab = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\\\";\\n const hex_tab = hexcase ? \\\"0123456789ABCDEF\\\" : \\\"0123456789abcdef\\\";\\n\\n /**\\n * Add integers, wrapping at 2^32. This uses 16-bit operations internally\\n * to work around bugs in some JS interpreters.\\n */\\n const safe_add = (x, y) => {\\n const lsw = (x & 0xFFFF) + (y & 0xFFFF);\\n const msw = (x >> 16) + (y >> 16) + (lsw >> 16);\\n return (msw << 16) | (lsw & 0xFFFF);\\n };\\n\\n /**\\n * Bitwise rotate a 32-bit number to the left.\\n */\\n const rol = (num, cnt) => (num << cnt) | (num >>> (32 - cnt));\\n\\n /**\\n * Convert a string to an array of little-endian words\\n * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.\\n */\\n const str2binl = str => {\\n const bin = Array();\\n const mask = (1 << chrsz) - 1;\\n for (let i = 0; i < str.length * chrsz; i += chrsz)\\n bin[i >> 5] |= (str.charCodeAt(i / chrsz) & mask) << (i % 32);\\n return bin;\\n };\\n\\n /**\\n * Convert an array of little-endian words to a string\\n */\\n const binl2str = bin => {\\n let str = \\\"\\\";\\n const mask = (1 << chrsz) - 1;\\n for (let i = 0; i < bin.length * 32; i += chrsz)\\n str += String.fromCharCode((bin[i >> 5] >>> (i % 32)) & mask);\\n return str;\\n };\\n\\n /**\\n * Convert an array of little-endian words to a hex string.\\n */\\n const binl2hex = binarray => {\\n let str = \\\"\\\";\\n for (let i = 0; i < binarray.length * 4; i++) {\\n str += hex_tab.charAt((binarray[i >> 2] >> ((i % 4) * 8 + 4)) & 0xF) +\\n hex_tab.charAt((binarray[i >> 2] >> ((i % 4) * 8)) & 0xF);\\n }\\n return str;\\n };\\n\\n /**\\n * Convert an array of little-endian words to a base-64 string\\n */\\n const binl2b64 = binarray => {\\n let str = \\\"\\\";\\n for (let i = 0; i < binarray.length * 4; i += 3) {\\n const triplet = (((binarray[i >> 2] >> 8 * (i % 4)) & 0xFF) << 16)\\n | (((binarray[i + 1 >> 2] >> 8 * ((i + 1) % 4)) & 0xFF) << 8)\\n | ((binarray[i + 2 >> 2] >> 8 * ((i + 2) % 4)) & 0xFF);\\n for (let j = 0; j < 4; j++) {\\n if (i * 8 + j * 6 > binarray.length * 32) str += b64pad;\\n else str += tab.charAt((triplet >> 6 * (3 - j)) & 0x3F);\\n }\\n }\\n return str;\\n };\\n\\n\\n /**\\n * Calculate the MD4 of an array of little-endian words, and a bit length\\n */\\n const core_md4 = (x, len) => {\\n\\n x[len >> 5] |= 0x80 << (len % 32);\\n x[(((len + 64) >>> 9) << 4) + 14] = len;\\n let a = 1732584193;\\n let b = -271733879;\\n let c = -1732584194;\\n let d = 271733878;\\n\\n for (let i = 0; i < x.length; i += 16) {\\n\\n const olda = a;\\n const oldb = b;\\n const oldc = c;\\n const oldd = d;\\n\\n a = md4_ff(a, b, c, d, x[i], 3);\\n d = md4_ff(d, a, b, c, x[i + 1], 7);\\n c = md4_ff(c, d, a, b, x[i + 2], 11);\\n b = md4_ff(b, c, d, a, x[i + 3], 19);\\n a = md4_ff(a, b, c, d, x[i + 4], 3);\\n d = md4_ff(d, a, b, c, x[i + 5], 7);\\n c = md4_ff(c, d, a, b, x[i + 6], 11);\\n b = md4_ff(b, c, d, a, x[i + 7], 19);\\n a = md4_ff(a, b, c, d, x[i + 8], 3);\\n d = md4_ff(d, a, b, c, x[i + 9], 7);\\n c = md4_ff(c, d, a, b, x[i + 10], 11);\\n b = md4_ff(b, c, d, a, x[i + 11], 19);\\n a = md4_ff(a, b, c, d, x[i + 12], 3);\\n d = md4_ff(d, a, b, c, x[i + 13], 7);\\n c = md4_ff(c, d, a, b, x[i + 14], 11);\\n b = md4_ff(b, c, d, a, x[i + 15], 19);\\n\\n a = md4_gg(a, b, c, d, x[i], 3);\\n d = md4_gg(d, a, b, c, x[i + 4], 5);\\n c = md4_gg(c, d, a, b, x[i + 8], 9);\\n b = md4_gg(b, c, d, a, x[i + 12], 13);\\n a = md4_gg(a, b, c, d, x[i + 1], 3);\\n d = md4_gg(d, a, b, c, x[i + 5], 5);\\n c = md4_gg(c, d, a, b, x[i + 9], 9);\\n b = md4_gg(b, c, d, a, x[i + 13], 13);\\n a = md4_gg(a, b, c, d, x[i + 2], 3);\\n d = md4_gg(d, a, b, c, x[i + 6], 5);\\n c = md4_gg(c, d, a, b, x[i + 10], 9);\\n b = md4_gg(b, c, d, a, x[i + 14], 13);\\n a = md4_gg(a, b, c, d, x[i + 3], 3);\\n d = md4_gg(d, a, b, c, x[i + 7], 5);\\n c = md4_gg(c, d, a, b, x[i + 11], 9);\\n b = md4_gg(b, c, d, a, x[i + 15], 13);\\n\\n a = md4_hh(a, b, c, d, x[i], 3);\\n d = md4_hh(d, a, b, c, x[i + 8], 9);\\n c = md4_hh(c, d, a, b, x[i + 4], 11);\\n b = md4_hh(b, c, d, a, x[i + 12], 15);\\n a = md4_hh(a, b, c, d, x[i + 2], 3);\\n d = md4_hh(d, a, b, c, x[i + 10], 9);\\n c = md4_hh(c, d, a, b, x[i + 6], 11);\\n b = md4_hh(b, c, d, a, x[i + 14], 15);\\n a = md4_hh(a, b, c, d, x[i + 1], 3);\\n d = md4_hh(d, a, b, c, x[i + 9], 9);\\n c = md4_hh(c, d, a, b, x[i + 5], 11);\\n b = md4_hh(b, c, d, a, x[i + 13], 15);\\n a = md4_hh(a, b, c, d, x[i + 3], 3);\\n d = md4_hh(d, a, b, c, x[i + 11], 9);\\n c = md4_hh(c, d, a, b, x[i + 7], 11);\\n b = md4_hh(b, c, d, a, x[i + 15], 15);\\n\\n a = safe_add(a, olda);\\n b = safe_add(b, oldb);\\n c = safe_add(c, oldc);\\n d = safe_add(d, oldd);\\n }\\n\\n return Array(a, b, c, d);\\n\\n };\\n\\n /**\\n * These functions implement the basic operation for each round of the\\n * algorithm.\\n */\\n const md4_cmn = (q, a, b, x, s, t) => safe_add(\\n rol(safe_add(safe_add(a, q), safe_add(x, t)), s), b);\\n\\n const md4_ff = (a, b, c, d, x, s) => md4_cmn(\\n (b & c) | ((~b) & d), a, 0, x, s, 0);\\n\\n const md4_gg = (a, b, c, d, x, s) => md4_cmn(\\n (b & c) | (b & d) | (c & d), a, 0, x, s, 1518500249);\\n\\n const md4_hh = (a, b, c, d, x, s) => md4_cmn(\\n b ^ c ^ d, a, 0, x, s, 1859775393);\\n\\n /**\\n * Calculate the HMAC-MD4, of a key and some data\\n */\\n const core_hmac_md4 = (key, data) => {\\n\\n let bkey = str2binl(key);\\n if (bkey.length > 16) {\\n bkey = core_md4(bkey, key.length * chrsz)\\n }\\n\\n const ipad = Array(16);\\n const opad = Array(16);\\n\\n for (let i = 0; i < 16; i++) {\\n ipad[i] = bkey[i] ^ 0x36363636;\\n opad[i] = bkey[i] ^ 0x5C5C5C5C;\\n }\\n const hash = core_md4(\\n ipad.concat(str2binl(data)), 512 + data.length * chrsz);\\n\\n return core_md4(opad.concat(hash), 512 + 128);\\n };\\n\\n /**\\n * These are the functions you'll usually want to call\\n */\\n return {\\n hex_md4: s => binl2hex(core_md4(str2binl(s), s.length * chrsz)),\\n b64_md4: s => binl2b64(core_md4(str2binl(s), s.length * chrsz)),\\n str_md4: s => binl2str(core_md4(str2binl(s), s.length * chrsz)),\\n hex_hmac_md4: (key, data) => binl2hex(core_hmac_md4(key, data)),\\n b64_hmac_md4: (key, data) => binl2b64(core_hmac_md4(key, data)),\\n str_hmac_md4: (key, data) => binl2str(core_hmac_md4(key, data)),\\n };\\n\\n};\\n\\nconst md4 = md4func();\\nconsole.log(md4.hex_md4('Rosetta Code'));\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"using Nettle\\n\\nmsg = \\\"Rosetta Code\\\"\\n\\nh = HashState(MD4)\\nupdate!(h, msg)\\nh = hexdigest!(h)\\n\\nprintln(\\\"\\\\\\\"\\\", msg, \\\"\\\\\\\" => \\\", h)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nimport java.security.MessageDigest\\n\\nclass MD4() : MessageDigest(\\\"MD4\\\"), Cloneable {\\n private val blockLength = 64\\n private var context = IntArray(4)\\n private var count = 0L\\n private var buffer = ByteArray(blockLength)\\n private var x = IntArray(16)\\n\\n init {\\n engineReset()\\n }\\n\\n private constructor(md: MD4): this() {\\n context = md.context.clone()\\n buffer = md.buffer.clone()\\n count = md.count\\n }\\n\\n override fun clone(): Any = MD4(this)\\n\\n override fun engineReset() {\\n context[0] = 0x67452301\\n context[1] = 0xefcdab89.toInt()\\n context[2] = 0x98badcfe.toInt()\\n context[3] = 0x10325476\\n count = 0L\\n for (i in 0 until blockLength) buffer[i] = 0\\n }\\n\\n override fun engineUpdate(b: Byte) {\\n val i = (count % blockLength).toInt()\\n count++\\n buffer[i] = b\\n if (i == blockLength - 1) transform(buffer, 0)\\n }\\n\\n override fun engineUpdate(input: ByteArray, offset: Int, len: Int) {\\n if (offset < 0 || len < 0 || offset.toLong() + len > input.size.toLong())\\n throw ArrayIndexOutOfBoundsException()\\n var bufferNdx = (count % blockLength).toInt()\\n count += len\\n val partLen = blockLength - bufferNdx\\n var i = 0\\n if (len >= partLen) {\\n System.arraycopy(input, offset, buffer, bufferNdx, partLen)\\n transform(buffer, 0)\\n i = partLen\\n while (i + blockLength - 1 < len) {\\n transform(input, offset + i)\\n i += blockLength\\n }\\n bufferNdx = 0\\n }\\n if (i < len) System.arraycopy(input, offset + i, buffer, bufferNdx, len - i)\\n }\\n\\n override fun engineDigest(): ByteArray {\\n val bufferNdx = (count % blockLength).toInt()\\n val padLen = if (bufferNdx < 56) 56 - bufferNdx else 120 - bufferNdx\\n val tail = ByteArray(padLen + 8)\\n tail[0] = 0x80.toByte()\\n for (i in 0..7) tail[padLen + i] = ((count * 8) ushr (8 * i)).toByte()\\n engineUpdate(tail, 0, tail.size)\\n val result = ByteArray(16)\\n for (i in 0..3)\\n for (j in 0..3)\\n result[i * 4 + j] = (context[i] ushr (8 * j)).toByte()\\n engineReset()\\n return result\\n }\\n\\n private fun transform (block: ByteArray, offset: Int) {\\n var offset2 = offset\\n for (i in 0..15)\\n x[i] = ((block[offset2++].toInt() and 0xff) ) or\\n ((block[offset2++].toInt() and 0xff) shl 8 ) or\\n ((block[offset2++].toInt() and 0xff) shl 16) or\\n ((block[offset2++].toInt() and 0xff) shl 24)\\n\\n var a = context[0]\\n var b = context[1]\\n var c = context[2]\\n var d = context[3]\\n\\n a = ff(a, b, c, d, x[ 0], 3)\\n d = ff(d, a, b, c, x[ 1], 7)\\n c = ff(c, d, a, b, x[ 2], 11)\\n b = ff(b, c, d, a, x[ 3], 19)\\n a = ff(a, b, c, d, x[ 4], 3)\\n d = ff(d, a, b, c, x[ 5], 7)\\n c = ff(c, d, a, b, x[ 6], 11)\\n b = ff(b, c, d, a, x[ 7], 19)\\n a = ff(a, b, c, d, x[ 8], 3)\\n d = ff(d, a, b, c, x[ 9], 7)\\n c = ff(c, d, a, b, x[10], 11)\\n b = ff(b, c, d, a, x[11], 19)\\n a = ff(a, b, c, d, x[12], 3)\\n d = ff(d, a, b, c, x[13], 7)\\n c = ff(c, d, a, b, x[14], 11)\\n b = ff(b, c, d, a, x[15], 19)\\n\\n a = gg(a, b, c, d, x[ 0], 3)\\n d = gg(d, a, b, c, x[ 4], 5)\\n c = gg(c, d, a, b, x[ 8], 9)\\n b = gg(b, c, d, a, x[12], 13)\\n a = gg(a, b, c, d, x[ 1], 3)\\n d = gg(d, a, b, c, x[ 5], 5)\\n c = gg(c, d, a, b, x[ 9], 9)\\n b = gg(b, c, d, a, x[13], 13)\\n a = gg(a, b, c, d, x[ 2], 3)\\n d = gg(d, a, b, c, x[ 6], 5)\\n c = gg(c, d, a, b, x[10], 9)\\n b = gg(b, c, d, a, x[14], 13)\\n a = gg(a, b, c, d, x[ 3], 3)\\n d = gg(d, a, b, c, x[ 7], 5)\\n c = gg(c, d, a, b, x[11], 9)\\n b = gg(b, c, d, a, x[15], 13)\\n\\n a = hh(a, b, c, d, x[ 0], 3)\\n d = hh(d, a, b, c, x[ 8], 9)\\n c = hh(c, d, a, b, x[ 4], 11)\\n b = hh(b, c, d, a, x[12], 15)\\n a = hh(a, b, c, d, x[ 2], 3)\\n d = hh(d, a, b, c, x[10], 9)\\n c = hh(c, d, a, b, x[ 6], 11)\\n b = hh(b, c, d, a, x[14], 15)\\n a = hh(a, b, c, d, x[ 1], 3)\\n d = hh(d, a, b, c, x[ 9], 9)\\n c = hh(c, d, a, b, x[ 5], 11)\\n b = hh(b, c, d, a, x[13], 15)\\n a = hh(a, b, c, d, x[ 3], 3)\\n d = hh(d, a, b, c, x[11], 9)\\n c = hh(c, d, a, b, x[ 7], 11)\\n b = hh(b, c, d, a, x[15], 15)\\n\\n context[0] += a\\n context[1] += b\\n context[2] += c\\n context[3] += d\\n }\\n\\n private fun ff(a: Int, b: Int, c: Int, d: Int, x: Int, s: Int): Int {\\n val t = a + ((b and c) or (b.inv() and d)) + x\\n return (t shl s) or (t ushr (32 - s))\\n }\\n\\n private fun gg(a: Int, b: Int, c: Int, d: Int, x: Int, s: Int): Int {\\n val t = a + ((b and (c or d)) or (c and d)) + x + 0x5a827999\\n return (t shl s) or (t ushr (32 - s))\\n }\\n\\n private fun hh(a: Int, b: Int, c: Int, d: Int, x: Int, s: Int): Int {\\n val t = a + (b xor c xor d) + x + 0x6ed9eba1\\n return (t shl s) or (t ushr (32 - s))\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val text = \\\"Rosetta Code\\\"\\n val bytes = text.toByteArray(Charsets.US_ASCII)\\n val md: MessageDigest = MD4()\\n val digest = md.digest(bytes)\\n for (byte in digest) print(\\\"%02x\\\".format(byte))\\n println()\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"cipher_digest('Rosetta Code', -digest='MD4')->encodeHex->asString\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"#!/usr/bin/lua\\n\\nrequire \\\"crypto\\\"\\n\\nprint(crypto.digest(\\\"MD4\\\", \\\"Rosetta Code\\\"))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Hash[\\\"Rosetta Code\\\", \\\"MD4\\\", \\\"HexString\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import strutils\\n\\nconst MD4Len = 16\\n\\nproc MD4(d: cstring, n: culong, md: cstring = nil): cstring {.cdecl, dynlib: \\\"libssl.so\\\", importc.}\\n\\nproc MD4(s: string): string =\\n result = \\\"\\\"\\n var s = MD4(s.cstring, s.len.culong)\\n for i in 0 ..< MD4Len:\\n result.add s[i].BiggestInt.toHex(2).toLower\\n\\necho MD4(\\\"Rosetta Code\\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#include <pari/pari.h>\\n#include <openssl/md4.h>\\n\\n#define HEX(x) (((x) < 10)? (x)+'0': (x)-10+'a')\\n\\n/*\\n * PARI/GP func: MD4 hash\\n *\\n * gp code: install(\\\"plug_md4\\\", \\\"s\\\", \\\"MD4\\\", \\\"<library path>\\\");\\n */\\nGEN plug_md4(char *text)\\n{\\n char md[MD4_DIGEST_LENGTH];\\n char hash[sizeof(md) * 2 + 1];\\n int i;\\n\\n MD4((unsigned char*)text, strlen(text), (unsigned char*)md);\\n\\n for (i = 0; i < sizeof(md); i++) {\\n hash[i+i] = HEX((md[i] >> 4) & 0x0f);\\n hash[i+i+1] = HEX(md[i] & 0x0f);\\n }\\n\\n hash[sizeof(md) * 2] = 0;\\n\\n return strtoGENstr(hash);\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"install(\\\"plug_md4\\\", \\\"s\\\", \\\"MD4\\\", \\\"~/libmd4.so\\\");\\n\\nMD4(\\\"Rosetta Code\\\")\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"sub md4 :prototype(@) {\\n my @input = grep { defined && length > 0 } split /(.{64})/s, join '', @_;\\n push @input, '' if !@input || length($input[$#input]) >= 56;\\n\\n my @A = (0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476); # initial regs\\n my @T = (0, 0x5A827999, 0x6ED9EBA1);\\n my @L = qw(3 7 11 19 3 5 9 13 3 9 11 15); # left rotate counts\\n my @O = (1, 4, 4, # x stride for input index\\n 4, 1, 1, # y stride for input index\\n 0, 0, 1); # bitwise reverse both indexes\\n my @I = map {\\n my $z = int $_/16;\\n my $x = $_%4;\\n my $y = int $_%16/4;\\n ($x,$y) = (R($x),R($y)) if $O[6+$z];\\n $O[$z] * $x + $O[3+$z] * $y\\n } 0..47;\\n\\n my ($a,$b,$c,$d);\\n my($l,$p) = (0,0);\\n foreach (@input) {\\n my $r = length($_);\\n $l += $r;\\n $r++, $_.=\\\"\\\\x80\\\" if $r<64 && !$p++;\\n my @W = unpack 'V16', $_ . \\\"\\\\0\\\"x7;\\n push @W, (0)x16 if @W < 16;\\n $W[14] = $l*8 if $r < 57; # add bit-length in low 32-bits\\n ($a,$b,$c,$d) = @A;\\n for (0..47) {\\n my $z = int $_/16;\\n $a = L($L[4*($_>>4) + $_%4],\\n M(&{(sub{$b&$c|~$b&$d}, # F\\n sub{$b&$c|$b&$d|$c&$d}, # G\\n sub{$b^$c^$d} # H\\n )[$z]}\\n + $a + $W[$I[$_]] + $T[$z]));\\n ($a,$b,$c,$d) = ($d,$a,$b,$c);\\n }\\n my @v = ($a, $b, $c, $d);\\n $A[$_] = M($A[$_] + $v[$_]) for 0..3;\\n }\\n pack 'V4', @A;\\n}\\n\\nsub L { # left-rotate\\n my ($n, $x) = @_;\\n $x<<$n | 2**$n - 1 & $x>>(32-$n);\\n}\\n\\nsub M { # mod 2**32\\n no integer;\\n my ($x) = @_;\\n my $m = 1+0xffffffff;\\n $x - $m * int $x/$m;\\n}\\n\\nsub R { # reverse two bit number\\n my $n = pop;\\n ($n&1)*2 + ($n&2)/2;\\n}\\n\\nsub md4_hex :prototype(@) { # convert to hexadecimal\\n unpack 'H*', &md4;\\n}\\n\\nprint \\\"Rosetta Code => \\\" . md4_hex( \\\"Rosetta Code\\\" ) . \\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\md4.exw\\n -- ====================\\n --\\n -- Non-optimised. If there is a genuine need for something faster, I can give #ilASM a bash.\\n -- MD4 is an obsolete hash function that computes a 128-bit message digest that sometimes appears in obsolete protocols.\\n -- Even the replacement, MD5 is now considered severly comprimised.\\n --</span>\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (allocate/poke/peek)</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">r32</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;\\\">if</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">+=</span><span style=\\\"color: #000000;\\\">#100000000</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">#100000000</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;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">bits</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- left rotate the bits of a 32-bit number by the specified number of bits</span>\\n <span style=\\\"color: #000000;\\\">word</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- trim to a 32-bit uint again</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">bits</span><span style=\\\"color: #0000FF;\\\">))+</span><span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">bits</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;\\\">f</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: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</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;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">not_bits</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>\\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;\\\">g</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: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">or_all</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</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: #7060A8;\\\">and_bits</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: #7060A8;\\\">and_bits</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 <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">h</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: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">xor_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">xor_bits</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 <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">md4</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">data</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">bytes_to_add</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">64</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">data</span><span style=\\\"color: #0000FF;\\\">)+</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">64</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">bytes_to_add</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">64</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">bytes_to_add</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: #000000;\\\">data</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">data</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">#80</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;\\\">bytes_to_add</span><span style=\\\"color: #0000FF;\\\">)&</span>\\n <span style=\\\"color: #7060A8;\\\">int_to_bytes</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">data</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0x67452301</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0xefcdab89</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0x98badcfe</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0x10325476</span>\\n\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">m64</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">allocate</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: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">i</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: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">data</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">64</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">poke</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">m64</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">data</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">63</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">z</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">peek4u</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">m64</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">16</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">a2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">b2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">c2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">d2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">d</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">12</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">z</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;\\\">3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">f</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> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">z</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;\\\">7</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</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> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">z</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;\\\">11</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">19</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: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">g</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">z</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: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">0x5a827999</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">g</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> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">0x5a827999</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">g</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</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> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">0x5a827999</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">g</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">0x5a827999</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">13</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;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">do</span>\\n <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: #000000;\\\">3</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;\\\">j</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">z</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: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">0x6ed9eba1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">h</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> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">0x6ed9eba1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</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> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">0x6ed9eba1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">0x6ed9eba1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">15</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">a2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">b2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">c2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">d2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">poke4</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">m64</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><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">peek</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">m64</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">16</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;\\\">hexify</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;\\\">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: #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: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%02X\\\"</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;\\\">return</span> <span style=\\\"color: #7060A8;\\\">join</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>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">hexify</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">md4</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Rosetta Code\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n\\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\": \"echo hash('md4', \\\"Rosetta Code\\\"), \\\"\\\\n\\\";\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(de *Md4-W .\\n (1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16\\n 1 5 9 13 2 6 10 14 3 7 11 15 4 8 12 16\\n 1 9 5 13 3 11 7 15 2 10 6 14 4 12 8 16 .))\\n(de *Md4-R1 . (3 7 11 19 .))\\n(de *Md4-R2 . (3 5 9 13 .))\\n(de *Md4-R3 . (3 9 11 15 .))\\n\\n(de mod32 (N)\\n (& N `(hex \\\"FFFFFFFF\\\")) )\\n\\n(de not32 (N)\\n (x| N `(hex \\\"FFFFFFFF\\\")) )\\n\\n(de add32 @\\n (mod32 (pass +)) )\\n\\n(de leftRotate (X C)\\n (| (mod32 (>> (- C) X)) (>> (- 32 C) X)) )\\n\\n(de md4 (Str)\\n (let Len (length Str)\\n (setq Str\\n (conc\\n (need\\n (- 8 (* 64 (/ (+ Len 1 8 63) 64))) # Pad to 64-8 bytes\\n (conc\\n (mapcar char (chop Str)) # Works only with ASCII characters\\n (cons `(hex \\\"80\\\")) ) # '1' bit\\n 0 ) # Pad with '0'\\n (make\\n (setq Len (* 8 Len))\\n (do 8\\n (link (& Len 255))\\n (setq Len (>> 8 Len )) ) ) ) ) )\\n (let\\n (H0 `(hex \\\"67452301\\\")\\n H1 `(hex \\\"EFCDAB89\\\")\\n H2 `(hex \\\"98BADCFE\\\")\\n H3 `(hex \\\"10325476\\\")\\n R2 `(hex \\\"5A827999\\\")\\n R3 `(hex \\\"6ED9EBA1\\\") )\\n (while Str\\n (let\\n (A H0 B H1 C H2 D H3\\n W (make\\n (do 16\\n (link\\n (apply |\\n (mapcar >> (0 -8 -16 -24) (cut 4 'Str)) ) ) ) ) )\\n (for I 12\\n (cond\\n ((>= 4 I)\\n (setq\\n A (leftRotate\\n (add32\\n A\\n (| (& B C) (& (not32 B) D))\\n (get W (pop '*Md4-W)) )\\n (pop '*Md4-R1) )\\n D (leftRotate\\n (add32\\n D\\n (| (& A B) (& (not32 A) C))\\n (get W (pop '*Md4-W)) )\\n (pop '*Md4-R1) )\\n C (leftRotate\\n (add32\\n C\\n (| (& D A) (& (not32 D) B))\\n (get W (pop '*Md4-W)) )\\n (pop '*Md4-R1) )\\n B (leftRotate\\n (add32\\n B\\n (| (& C D) (& (not32 C) A))\\n (get W (pop '*Md4-W)) )\\n (pop '*Md4-R1) ) ) )\\n ((>= 8 I)\\n (setq\\n A (leftRotate\\n (add32\\n A\\n (|\\n (& B (| C D))\\n (& C D) )\\n (get W (pop '*Md4-W))\\n R2 )\\n (pop '*Md4-R2) )\\n D (leftRotate\\n (add32\\n D\\n (|\\n (& A (| B C))\\n (& B C) )\\n (get W (pop '*Md4-W))\\n R2 )\\n (pop '*Md4-R2) )\\n C (leftRotate\\n (add32\\n C\\n (|\\n (& D (| A B))\\n (& A B) )\\n (get W (pop '*Md4-W))\\n R2 )\\n (pop '*Md4-R2) )\\n B (leftRotate\\n (add32\\n B\\n (|\\n (& C (| D A))\\n (& D A) )\\n (get W (pop '*Md4-W))\\n R2 )\\n (pop '*Md4-R2) ) ) )\\n (T\\n (setq\\n A (leftRotate\\n (add32\\n A\\n (x| B C D)\\n (get W (pop '*Md4-W))\\n R3 )\\n (pop '*Md4-R3) )\\n D (leftRotate\\n (add32\\n D\\n (x| A B C)\\n (get W (pop '*Md4-W))\\n R3 )\\n (pop '*Md4-R3) )\\n C (leftRotate\\n (add32\\n C\\n (x| D A B)\\n (get W (pop '*Md4-W))\\n R3 )\\n (pop '*Md4-R3) )\\n B (leftRotate\\n (add32\\n B\\n (x| C D A)\\n (get W (pop '*Md4-W))\\n R3 )\\n (pop '*Md4-R3) ) ) ) ) )\\n (setq\\n H0 (add32 H0 A)\\n H1 (add32 H1 B)\\n H2 (add32 H2 C)\\n H3 (add32 H3 D) ) ) )\\n (make\\n (for N (list H0 H1 H2 H3)\\n (do 4\\n (link (& N 255))\\n (setq N (>> 8 N)) ) ) ) ) )\\n\\n(let Str \\\"Rosetta Code\\\"\\n (println\\n (pack\\n (mapcar\\n '((B) (pad 2 (hex B)))\\n (md4 Str) ) ) )\\n (println\\n (pack\\n (mapcar\\n '((B) (pad 2 (hex B)))\\n (native\\n \\\"libcrypto.so\\\"\\n \\\"MD4\\\"\\n '(B . 16)\\n Str\\n (length Str)\\n '(NIL (16)) ) ) ) ) )\\n\\n(bye)\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"import hashlib\\nprint hashlib.new(\\\"md4\\\",raw_input().encode('utf-16le')).hexdigest().upper()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n(require (planet soegaard/digest:1:2/digest))\\n(md4 #\\\"Rosetta Code\\\")\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub md4($str) {\\n my buf8 $buf .= new: $str.encode;\\n my $buf-length = $buf.elems;\\n $buf.push: 0x80;\\n $buf.push: 0 until ($buf - (448 div 8)) %% (512 div 8);\\n # raku serializes in little endian by default\\n $buf.write-uint64: $buf.elems, $buf-length*8;\\n\\n my (&f, &g, &h, &r) =\\n { $^x +& $^y +| +^$x +& $^z },\\n { $^x +& $^y +| $x +& $^z +| $y +& $z },\\n { $^x +^ $^y +^ $^z },\\n # for some reason we have to type v here\\n -> uint32 $v, $s { $v +< $s +| $v +> (32 - $s) }\\n\\n my uint32 ($a, $b, $c, $d) = 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476;\\n\\n loop (my $pos = 0; $pos < $buf.elems; $pos+=64) {\\n my ($aa, $bb, $cc, $dd) = $a, $b, $c, $d;\\n for 0, 4, 8, 12 -> $i {\\n $a = r($a + f($b, $c, $d) + $buf.read-uint32($pos+($i+0)*4), 3);\\n $d = r($d + f($a, $b, $c) + $buf.read-uint32($pos+($i+1)*4), 7);\\n $c = r($c + f($d, $a, $b) + $buf.read-uint32($pos+($i+2)*4), 11);\\n $b = r($b + f($c, $d, $a) + $buf.read-uint32($pos+($i+3)*4), 19);\\n }\\n for 0, 1, 2, 3 -> $i {\\n $a = r($a + g($b, $c, $d) + $buf.read-uint32($pos+($i+0 )*4) + 0x5a827999, 3);\\n $d = r($d + g($a, $b, $c) + $buf.read-uint32($pos+($i+4 )*4) + 0x5a827999, 5);\\n $c = r($c + g($d, $a, $b) + $buf.read-uint32($pos+($i+8 )*4) + 0x5a827999, 9);\\n $b = r($b + g($c, $d, $a) + $buf.read-uint32($pos+($i+12)*4) + 0x5a827999, 13);\\n }\\n for 0, 2, 1, 3 -> $i {\\n $a = r($a + h($b, $c, $d) + $buf.read-uint32($pos+($i+0 )*4) + 0x6ed9eba1, 3);\\n $d = r($d + h($a, $b, $c) + $buf.read-uint32($pos+($i+4 )*4) + 0x6ed9eba1, 9);\\n $c = r($c + h($d, $a, $b) + $buf.read-uint32($pos+($i+8 )*4) + 0x6ed9eba1, 11);\\n $b = r($b + h($c, $d, $a) + $buf.read-uint32($pos+($i+12)*4) + 0x6ed9eba1, 15);\\n }\\n ($a,$b,$c,$d) Z[+=] ($aa,$bb,$cc,$dd);\\n }\\n\\n reduce { $^buf.write-uint32: $buf.elems, $^x; $buf }, buf8.new, $a, $b, $c, $d;\\n}\\n\\nCHECK {\\n use Test;\\n plan 1;\\n is md4('Rosetta Code').list.fmt('%02X'), 'A5 2B CF C6 A0 D0 D3 00 CD C5 DD BF BE FE 47 8B';\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"require 'openssl'\\nputs OpenSSL::Digest::MD4.hexdigest('Rosetta Code')\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"require 'stringio'\\n\\n# Calculates MD4 message digest of _string_. Returns binary digest.\\n# For hexadecimal digest, use +*md4(str).unpack('H*')+.\\ndef md4(string)\\n # functions\\n mask = (1 << 32) - 1\\n f = proc {|x, y, z| x & y | x.^(mask) & z}\\n g = proc {|x, y, z| x & y | x & z | y & z}\\n h = proc {|x, y, z| x ^ y ^ z}\\n r = proc {|v, s| (v << s).&(mask) | (v.&(mask) >> (32 - s))}\\n\\n # initial hash\\n a, b, c, d = 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476\\n\\n bit_len = string.size << 3\\n string += \\\"\\\\x80\\\"\\n while (string.size % 64) != 56\\n string += \\\"\\\\0\\\"\\n end\\n string = string.force_encoding('ascii-8bit') + [bit_len & mask, bit_len >> 32].pack(\\\"V2\\\")\\n\\n if string.size % 64 != 0\\n fail \\\"failed to pad to correct length\\\"\\n end\\n\\n io = StringIO.new(string)\\n block = \\\"\\\"\\n\\n while io.read(64, block)\\n x = block.unpack(\\\"V16\\\")\\n\\n # Process this block.\\n aa, bb, cc, dd = a, b, c, d\\n [0, 4, 8, 12].each {|i|\\n a = r[a + f[b, c, d] + x[i], 3]; i += 1\\n d = r[d + f[a, b, c] + x[i], 7]; i += 1\\n c = r[c + f[d, a, b] + x[i], 11]; i += 1\\n b = r[b + f[c, d, a] + x[i], 19]\\n }\\n [0, 1, 2, 3].each {|i|\\n a = r[a + g[b, c, d] + x[i] + 0x5a827999, 3]; i += 4\\n d = r[d + g[a, b, c] + x[i] + 0x5a827999, 5]; i += 4\\n c = r[c + g[d, a, b] + x[i] + 0x5a827999, 9]; i += 4\\n b = r[b + g[c, d, a] + x[i] + 0x5a827999, 13]\\n }\\n [0, 2, 1, 3].each {|i|\\n a = r[a + h[b, c, d] + x[i] + 0x6ed9eba1, 3]; i += 8\\n d = r[d + h[a, b, c] + x[i] + 0x6ed9eba1, 9]; i -= 4\\n c = r[c + h[d, a, b] + x[i] + 0x6ed9eba1, 11]; i += 8\\n b = r[b + h[c, d, a] + x[i] + 0x6ed9eba1, 15]\\n }\\n a = (a + aa) & mask\\n b = (b + bb) & mask\\n c = (c + cc) & mask\\n d = (d + dd) & mask\\n end\\n\\n [a, b, c, d].pack(\\\"V4\\\")\\nend\\n\\nif __FILE__ == $0\\n # Print an example MD4 digest.\\n str = 'Rosetta Code'\\n printf \\\"%s:\\\\n %s\\\\n\\\", str, *md4(str).unpack('H*')\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"// MD4, based on RFC 1186 and RFC 1320.\\n//\\n// https://www.ietf.org/rfc/rfc1186.txt\\n// https://tools.ietf.org/html/rfc1320\\n//\\n\\nuse std::fmt::Write;\\nuse std::mem;\\n\\n// Let not(X) denote the bit-wise complement of X.\\n// Let X v Y denote the bit-wise OR of X and Y.\\n// Let X xor Y denote the bit-wise XOR of X and Y.\\n// Let XY denote the bit-wise AND of X and Y.\\n\\n// f(X,Y,Z) = XY v not(X)Z\\nfn f(x: u32, y: u32, z: u32) -> u32 {\\n (x & y) | (!x & z)\\n}\\n\\n// g(X,Y,Z) = XY v XZ v YZ\\nfn g(x: u32, y: u32, z: u32) -> u32 {\\n (x & y) | (x & z) | (y & z)\\n}\\n\\n// h(X,Y,Z) = X xor Y xor Z\\nfn h(x: u32, y: u32, z: u32) -> u32 {\\n x ^ y ^ z\\n}\\n\\n// Round 1 macro\\n// Let [A B C D i s] denote the operation\\n// A = (A + f(B,C,D) + X[i]) <<< s\\nmacro_rules! md4round1 {\\n ( $a:expr, $b:expr, $c:expr, $d:expr, $i:expr, $s:expr, $x:expr) => {\\n {\\n // Rust defaults to non-overflowing arithmetic, so we need to specify wrapping add.\\n $a = ($a.wrapping_add( f($b, $c, $d) ).wrapping_add( $x[$i] ) ).rotate_left($s);\\n }\\n };\\n}\\n\\n// Round 2 macro\\n// Let [A B C D i s] denote the operation\\n// A = (A + g(B,C,D) + X[i] + 5A827999) <<< s .\\nmacro_rules! md4round2 {\\n ( $a:expr, $b:expr, $c:expr, $d:expr, $i:expr, $s:expr, $x:expr) => {\\n {\\n $a = ($a.wrapping_add( g($b, $c, $d)).wrapping_add($x[$i]).wrapping_add(0x5a827999_u32)).rotate_left($s);\\n }\\n };\\n}\\n\\n// Round 3 macro\\n// Let [A B C D i s] denote the operation\\n// A = (A + h(B,C,D) + X[i] + 6ED9EBA1) <<< s .\\nmacro_rules! md4round3 {\\n ( $a:expr, $b:expr, $c:expr, $d:expr, $i:expr, $s:expr, $x:expr) => {\\n {\\n $a = ($a.wrapping_add(h($b, $c, $d)).wrapping_add($x[$i]).wrapping_add(0x6ed9eba1_u32)).rotate_left($s);\\n }\\n };\\n}\\n\\nfn convert_byte_vec_to_u32(mut bytes: Vec<u8>) -> Vec<u32> {\\n\\n bytes.shrink_to_fit();\\n let num_bytes = bytes.len();\\n let num_words = num_bytes / 4;\\n unsafe {\\n let words = Vec::from_raw_parts(bytes.as_mut_ptr() as *mut u32, num_words, num_words);\\n mem::forget(bytes);\\n words\\n }\\n}\\n\\n// Returns a 128-bit MD4 hash as an array of four 32-bit words.\\n// Based on RFC 1186 from https://www.ietf.org/rfc/rfc1186.txt\\nfn md4<T: Into<Vec<u8>>>(input: T) -> [u32; 4] {\\n\\n let mut bytes = input.into().to_vec();\\n let initial_bit_len = (bytes.len() << 3) as u64;\\n\\n // Step 1. Append padding bits\\n // Append one '1' bit, then append 0 ≤ k < 512 bits '0', such that the resulting message\\n // length in bis is congruent to 448 (mod 512).\\n // Since our message is in bytes, we use one byte with a set high-order bit (0x80) plus\\n // a variable number of zero bytes.\\n\\n // Append zeros\\n // Number of padding bytes needed is 448 bits (56 bytes) modulo 512 bits (64 bytes)\\n bytes.push(0x80_u8);\\n while (bytes.len() % 64) != 56 {\\n bytes.push(0_u8);\\n }\\n\\n // Everything after this operates on 32-bit words, so reinterpret the buffer.\\n let mut w = convert_byte_vec_to_u32(bytes);\\n\\n // Step 2. Append length\\n // A 64-bit representation of b (the length of the message before the padding bits were added)\\n // is appended to the result of the previous step, low-order bytes first.\\n w.push(initial_bit_len as u32); // Push low-order bytes first\\n w.push((initial_bit_len >> 32) as u32);\\n\\n // Step 3. Initialize MD buffer\\n let mut a = 0x67452301_u32;\\n let mut b = 0xefcdab89_u32;\\n let mut c = 0x98badcfe_u32;\\n let mut d = 0x10325476_u32;\\n\\n // Step 4. Process message in 16-word blocks\\n let n = w.len();\\n for i in 0..n / 16 {\\n\\n // Select the next 512-bit (16-word) block to process.\\n let x = &w[i * 16..i * 16 + 16];\\n\\n let aa = a;\\n let bb = b;\\n let cc = c;\\n let dd = d;\\n\\n // [Round 1]\\n md4round1!(a, b, c, d, 0, 3, x); // [A B C D 0 3]\\n md4round1!(d, a, b, c, 1, 7, x); // [D A B C 1 7]\\n md4round1!(c, d, a, b, 2, 11, x); // [C D A B 2 11]\\n md4round1!(b, c, d, a, 3, 19, x); // [B C D A 3 19]\\n md4round1!(a, b, c, d, 4, 3, x); // [A B C D 4 3]\\n md4round1!(d, a, b, c, 5, 7, x); // [D A B C 5 7]\\n md4round1!(c, d, a, b, 6, 11, x); // [C D A B 6 11]\\n md4round1!(b, c, d, a, 7, 19, x); // [B C D A 7 19]\\n md4round1!(a, b, c, d, 8, 3, x); // [A B C D 8 3]\\n md4round1!(d, a, b, c, 9, 7, x); // [D A B C 9 7]\\n md4round1!(c, d, a, b, 10, 11, x);// [C D A B 10 11]\\n md4round1!(b, c, d, a, 11, 19, x);// [B C D A 11 19]\\n md4round1!(a, b, c, d, 12, 3, x); // [A B C D 12 3]\\n md4round1!(d, a, b, c, 13, 7, x); // [D A B C 13 7]\\n md4round1!(c, d, a, b, 14, 11, x);// [C D A B 14 11]\\n md4round1!(b, c, d, a, 15, 19, x);// [B C D A 15 19]\\n\\n // [Round 2]\\n md4round2!(a, b, c, d, 0, 3, x); //[A B C D 0 3]\\n md4round2!(d, a, b, c, 4, 5, x); //[D A B C 4 5]\\n md4round2!(c, d, a, b, 8, 9, x); //[C D A B 8 9]\\n md4round2!(b, c, d, a, 12, 13, x);//[B C D A 12 13]\\n md4round2!(a, b, c, d, 1, 3, x); //[A B C D 1 3]\\n md4round2!(d, a, b, c, 5, 5, x); //[D A B C 5 5]\\n md4round2!(c, d, a, b, 9, 9, x); //[C D A B 9 9]\\n md4round2!(b, c, d, a, 13, 13, x);//[B C D A 13 13]\\n md4round2!(a, b, c, d, 2, 3, x); //[A B C D 2 3]\\n md4round2!(d, a, b, c, 6, 5, x); //[D A B C 6 5]\\n md4round2!(c, d, a, b, 10, 9, x); //[C D A B 10 9]\\n md4round2!(b, c, d, a, 14, 13, x);//[B C D A 14 13]\\n md4round2!(a, b, c, d, 3, 3, x); //[A B C D 3 3]\\n md4round2!(d, a, b, c, 7, 5, x); //[D A B C 7 5]\\n md4round2!(c, d, a, b, 11, 9, x); //[C D A B 11 9]\\n md4round2!(b, c, d, a, 15, 13, x);//[B C D A 15 13]\\n\\n // [Round 3]\\n md4round3!(a, b, c, d, 0, 3, x); //[A B C D 0 3]\\n md4round3!(d, a, b, c, 8, 9, x); //[D A B C 8 9]\\n md4round3!(c, d, a, b, 4, 11, x); //[C D A B 4 11]\\n md4round3!(b, c, d, a, 12, 15, x);//[B C D A 12 15]\\n md4round3!(a, b, c, d, 2, 3, x); //[A B C D 2 3]\\n md4round3!(d, a, b, c, 10, 9, x); //[D A B C 10 9]\\n md4round3!(c, d, a, b, 6, 11, x); //[C D A B 6 11]\\n md4round3!(b, c, d, a, 14, 15, x);//[B C D A 14 15]\\n md4round3!(a, b, c, d, 1, 3, x); //[A B C D 1 3]\\n md4round3!(d, a, b, c, 9, 9, x); //[D A B C 9 9]\\n md4round3!(c, d, a, b, 5, 11, x); //[C D A B 5 11]\\n md4round3!(b, c, d, a, 13, 15, x);//[B C D A 13 15]\\n md4round3!(a, b, c, d, 3, 3, x); //[A B C D 3 3]\\n md4round3!(d, a, b, c, 11, 9, x); //[D A B C 11 9]\\n md4round3!(c, d, a, b, 7, 11, x); //[C D A B 7 11]\\n md4round3!(b, c, d, a, 15, 15, x);//[B C D A 15 15]\\n\\n a = a.wrapping_add(aa);\\n b = b.wrapping_add(bb);\\n c = c.wrapping_add(cc);\\n d = d.wrapping_add(dd);\\n }\\n\\n // Step 5. Output\\n // The message digest produced as output is A, B, C, D. That is, we begin with the low-order\\n // byte of A, and end with the high-order byte of D.\\n [u32::from_be(a), u32::from_be(b), u32::from_be(c), u32::from_be(d)]\\n}\\n\\nfn digest_to_str(digest: &[u32]) -> String {\\n let mut s = String::new();\\n for &word in digest {\\n write!(&mut s, \\\"{:08x}\\\", word).unwrap();\\n }\\n s\\n}\\n\\nfn main() {\\n let val = \\\"Rosetta Code\\\";\\n println!(\\\"md4(\\\\\\\"{}\\\\\\\") = {}\\\", val, digest_to_str(&md4(val)));\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import org.bouncycastle.crypto.digests.MD4Digest\\n\\nobject RosettaRIPEMD160 extends App {\\n val (raw, messageDigest) = (\\\"Rosetta Code\\\".getBytes(\\\"US-ASCII\\\"), new MD4Digest())\\n messageDigest.update(raw, 0, raw.length)\\n val out = Array.fill[Byte](messageDigest.getDigestSize())(0)\\n messageDigest.doFinal(out, 0)\\n\\n assert(out.map(\\\"%02x\\\".format(_)).mkString == \\\"a52bcfc6a0d0d300cdc5ddbfbefe478b\\\")\\n import scala.compat.Platform.currentTime\\n println(s\\\"Successfully completed without errors. [total ${currentTime - executionStart} ms]\\\")\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"msgdigest.s7i\\\";\\n\\nconst proc: main is func\\n begin\\n writeln(hex(md4(\\\"Rosetta Code\\\")));\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"var digest = frequire('Digest::MD4');\\nsay digest.md4_hex('Rosetta Code');\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"package require md4\\n\\n# Use -hex option for hexadecimal output instead of binary\\nputs [md4::md4 -hex \\\"Rosetta Code\\\"]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar toBytes = Fn.new { |val|\\n var bytes = List.filled(4, 0)\\n bytes[0] = val & 255\\n bytes[1] = (val >> 8) & 255\\n bytes[2] = (val >> 16) & 255\\n bytes[3] = (val >> 24) & 255\\n return bytes\\n}\\n\\nvar toInt = Fn.new { |bytes| bytes[0] | bytes[1] << 8 | bytes[2] << 16 | bytes[3] << 24 }\\n\\nvar md4 = Fn.new { |initMsg|\\n var f = Fn.new { |x, y, z| (x & y) | (~x & z) }\\n var g = Fn.new { |x, y, z| (x & y) | (x & z) | (y & z) }\\n var h = Fn.new { |x, y, z| x ^ y ^ z }\\n var r = Fn.new { |v, s| (v << s) | (v >> (32 - s)) }\\n\\n var a = 0x67452301\\n var b = 0xefcdab89\\n var c = 0x98badcfe\\n var d = 0x10325476\\n var initBytes = initMsg.bytes\\n var initLen = initBytes.count\\n var newLen = initLen + 1\\n while (newLen % 64 != 56) newLen = newLen + 1\\n var msg = List.filled(newLen + 8, 0)\\n for (i in 0...initLen) msg[i] = initBytes[i]\\n msg[initLen] = 0x80 // remaining bytes already 0\\n var lenBits = toBytes.call(initLen * 8)\\n for (i in newLen...newLen+4) msg[i] = lenBits[i-newLen]\\n var extraBits = toBytes.call(initLen >> 29)\\n for (i in newLen+4...newLen+8) msg[i] = extraBits[i-newLen-4]\\n var offset = 0\\n var x = List.filled(16, 0)\\n while (offset < newLen) {\\n for (i in 0...16) x[i] = toInt.call(msg[offset+i*4...offset + i*4 + 4])\\n var a2 = a\\n var b2 = b\\n var c2 = c\\n var d2 = d\\n for (i in [0, 4, 8, 12]) {\\n a = r.call(a + f.call(b, c, d) + x[i+0], 3)\\n d = r.call(d + f.call(a, b, c) + x[i+1], 7)\\n c = r.call(c + f.call(d, a, b) + x[i+2], 11)\\n b = r.call(b + f.call(c, d, a) + x[i+3], 19)\\n }\\n for (i in 0..3) {\\n a = r.call(a + g.call(b, c, d) + x[i+0] + 0x5a827999, 3)\\n d = r.call(d + g.call(a, b, c) + x[i+4] + 0x5a827999, 5)\\n c = r.call(c + g.call(d, a, b) + x[i+8] + 0x5a827999, 9)\\n b = r.call(b + g.call(c, d, a) + x[i+12] + 0x5a827999, 13)\\n }\\n for (i in [0, 2, 1, 3]) {\\n a = r.call(a + h.call(b, c, d) + x[i+0] + 0x6ed9eba1, 3)\\n d = r.call(d + h.call(a, b, c) + x[i+8] + 0x6ed9eba1, 9)\\n c = r.call(c + h.call(d, a, b) + x[i+4] + 0x6ed9eba1, 11)\\n b = r.call(b + h.call(c, d, a) + x[i+12] + 0x6ed9eba1, 15)\\n }\\n a = a + a2\\n b = b + b2\\n c = c + c2\\n d = d + d2\\n offset = offset + 64\\n }\\n var digest = List.filled(16, 0)\\n var dBytes = toBytes.call(a)\\n for (i in 0...4) digest[i] = dBytes[i]\\n dBytes = toBytes.call(b)\\n for (i in 0...4) digest[i+4] = dBytes[i]\\n dBytes = toBytes.call(c)\\n for (i in 0...4) digest[i+8] = dBytes[i]\\n dBytes = toBytes.call(d)\\n for (i in 0...4) digest[i+12] = dBytes[i]\\n return digest\\n}\\n\\nvar strings = [\\n \\\"\\\",\\n \\\"a\\\",\\n \\\"abc\\\",\\n \\\"message digest\\\",\\n \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\",\\n \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\",\\n \\\"Rosetta Code\\\"\\n]\\n\\nfor (s in strings) {\\n var digest = md4.call(s)\\n Fmt.print(\\\"$s <== '$0s'\\\", Fmt.v(\\\"xz\\\", 2, digest, 0, \\\"\\\", \\\"\\\"), s)\\n}\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"MD4"}}},{"rowIdx":478,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/MD5\nnote: Checksums\n","language":"00-META"},{"code":";Task:\nEncode a string using an MD5 algorithm. The algorithm can be found on [[wp:Md5#Algorithm|Wikipedia]].\n\n\nOptionally, validate your implementation by running all of the test values in [http://tools.ietf.org/html/rfc1321 IETF RFC (1321) for MD5]. \n\nAdditionally, RFC 1321 provides more precise information on the algorithm than the Wikipedia article.\n\n{{alertbox|lightgray|'''Warning:''' MD5 has [http://tools.ietf.org/html/rfc6151 known weaknesses], including '''collisions''' and [http://www.win.tue.nl/hashclash/rogue-ca/ forged signatures]. Users may consider a stronger alternative when doing production-grade cryptography, such as SHA-256 (from the SHA-2 family), or the upcoming SHA-3.}}\n\nIf the solution on this page is a library solution, see [[MD5/Implementation]] for an implementation from scratch.\n<br><br>\n\n","language":"00-TASK"},{"code":"\"md5\" cr:hash! \"Some text\" cr:hash cr:hash>s\n. cr bye\n","language":"8th"},{"code":"/* ARM assembly AARCH64 Raspberry PI 3B */\n/* program MD5_64.s */\n\n/*******************************************/\n/* Constantes file */\n/*******************************************/\n/* for this file see task include a file in language AArch64 assembly*/\n.include \"../includeConstantesARM64.inc\"\n\n.equ MD5_DIGEST_LENGTH, 16\n.equ ZWORKSIZE, 1000\n\n/*********************************/\n/* Initialized data */\n/*********************************/\n.data\nszMessRosetta: .asciz \"Rosetta Code\"\nszMessTest1: .asciz \"\"\nszMessTest2: .asciz \"abc\"\nszMessTest3: .asciz \"abcdefghijklmnopqrstuvwxyz\"\nszMessTest4: .asciz \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"\nszMessTest5: .asciz \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"\nszMessFinPgm: .asciz \"Program End ok.\\n\"\nszMessResult: .asciz \"Result for \"\nszMessResult1: .asciz \" => \"\nszMessSizeError: .asciz \"\\033[31mWork area too small !! \\033[0m \\n\"\nszCarriageReturn: .asciz \"\\n\"\n\n/* array constantes K */\ntbConstK: .int 0xd76aa478,0xe8c7b756,0x242070db,0xc1bdceee\n .int 0xf57c0faf,0x4787c62a,0xa8304613,0xfd469501\n .int 0x698098d8,0x8b44f7af,0xffff5bb1,0x895cd7be\n .int 0x6b901122,0xfd987193,0xa679438e,0x49b40821\n .int 0xf61e2562,0xc040b340,0x265e5a51,0xe9b6c7aa\n .int 0xd62f105d,0x2441453,0xd8a1e681,0xe7d3fbc8\n .int 0x21e1cde6,0xc33707d6,0xf4d50d87,0x455a14ed\n .int 0xa9e3e905,0xfcefa3f8,0x676f02d9,0x8d2a4c8a\n .int 0xfffa3942,0x8771f681,0x6d9d6122,0xfde5380c\n .int 0xa4beea44,0x4bdecfa9,0xf6bb4b60,0xbebfbc70\n .int 0x289b7ec6,0xeaa127fa,0xd4ef3085,0x4881d05\n .int 0xd9d4d039,0xe6db99e5,0x1fa27cf8,0xc4ac5665\n .int 0xf4292244,0x432aff97,0xab9423a7,0xfc93a039\n .int 0x655b59c3,0x8f0ccc92,0xffeff47d,0x85845dd1\n .int 0x6fa87e4f,0xfe2ce6e0,0xa3014314,0x4e0811a1\n .int 0xf7537e82,0xbd3af235,0x2ad7d2bb,0xeb86d391\n\n/* array rotation coef R */\ntbRotaR: .int 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22\n .int 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20\n .int 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23\n .int 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21\n\ntbConstH: .int 0x67452301 // H0\n .int 0xEFCDAB89 // H1\n .int 0x98BADCFE // H2\n .int 0x10325476 // H3\n\n/*********************************/\n/* UnInitialized data */\n/*********************************/\n.bss\n.align 4\n//iNbBlocs: .skip 8\nsZoneConv: .skip 24\nsZoneResult: .skip 24\ntbH: .skip 4 * 4 // 4 variables H\nsZoneTrav: .skip ZWORKSIZE\n/*********************************/\n/* code section */\n/*********************************/\n.text\n.global main\nmain: // entry of program\n\n ldr x0,qAdrszMessTest1\n bl computeExemple\n\n ldr x0,qAdrszMessTest2\n bl computeExemple\n\n ldr x0,qAdrszMessTest3\n bl computeExemple\n\n ldr x0,qAdrszMessTest4\n bl computeExemple\n\n ldr x0,qAdrszMessTest5\n bl computeExemple\n\n ldr x0,qAdrszMessFinPgm\n bl affichageMess // display message\n\n\n100: // standard end of the program\n mov x0,0 // return code\n mov x8,EXIT // request to exit program\n svc 0 // perform the system call\n\nqAdrszCarriageReturn: .quad szCarriageReturn\nqAdrszMessResult: .quad szMessResult\nqAdrszMessResult1: .quad szMessResult1\nqAdrszMessRosetta: .quad szMessRosetta\nqAdrszMessTest1: .quad szMessTest1\nqAdrszMessTest2: .quad szMessTest2\nqAdrszMessTest3: .quad szMessTest3\nqAdrszMessTest4: .quad szMessTest4\nqAdrszMessTest5: .quad szMessTest5\nqAdrsZoneTrav: .quad sZoneTrav\nqAdrsZoneConv: .quad sZoneConv\nqAdrszMessFinPgm: .quad szMessFinPgm\n/***********************************************/\n/* compute exemple */\n/***********************************************/\n/* x0 contains the address of the message */\ncomputeExemple:\n stp x18,lr,[sp,-16]! // save registers\n mov x18,x0\n bl computeMD5 // call routine MD5\n\n ldr x0,qAdrszMessResult\n bl affichageMess\n mov x0,x18\n bl affichageMess\n ldr x0,qAdrszMessResult1\n bl affichageMess\n ldr x0, qAdrsZoneResult\n bl displayMD5\n\n100:\n ldp x18,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\n/******************************************************************/\n/* compute MD5 */\n/******************************************************************/\n/* x0 contains the address of the message */\ncomputeMD5:\n stp x1,lr,[sp,-16]! // save registers\n ldr x1,qAdrsZoneTrav\n mov x2,#0 // counter length\n1: // copy string in work area\n cmp x2,ZWORKSIZE\n bge 99f\n ldrb w3,[x0,x2]\n strb w3,[x1,x2]\n cmp x3,#0\n add x4,x2,1\n csel x2,x4,x2,ne\n bne 1b\n // add bit et compute length\n lsl x6,x2,#3 // initial message length in bits\n mov x3,#0b10000000 // add bit 1 at end of string\n strb w3,[x1,x2]\n add x2,x2,#1 // length in bytes\n lsl x4,x2,#3 // length in bits\n mov x3,#0\n2:\n lsr x5,x2,#6 // padding block 512 bytes\n lsl x5,x5,#6\n sub x5,x2,x5\n cmp x5,#56\n beq 3f // yes -> end add\n strb w3,[x1,x2] // add zero at message end\n add x2,x2,#1 // increment length bytes\n add x4,x4,#8 // increment length in bits\n b 2b\n3:\n str x6,[x1,x2] // and store at end\n\n ldr x7,qAdrtbConstH // constantes H address\n ldr x4,qAdrtbH // start area H\n mov x5,#0\n4: // init array H with start constantes\n ldr w6,[x7,x5,lsl #2] // load constante\n str w6,[x4,x5,lsl #2] // and store\n add x5,x5,#1\n cmp x5,#4 // constantes number\n blt 4b\n\n // split into block of 64 bytes\n add x2,x2,#4 // TODO : à revoir\n lsr x4,x2,#6 // blocks number\n mov x7,#0 // no de block et x1 contient l'adresse zone de travail\n ldr x3,qAdrtbConstK // K constantes address\n ldr x5,qAdrtbRotaR // R rotation address\n\n5: // begin loop of each block of 64 bytes\n // init variable a b c d with H0 H1 H2 H3\n ldr x0,qAdrtbH\n ldr w8,[x0] // a\n ldr w9,[x0,#4] // b\n ldr w10,[x0,#8] // c\n ldr w11,[x0,#12] // d\n\n mov x6,#0 // indice t\n /* x2 address begin each block */\n ldr x1,qAdrsZoneTrav\n add x2,x1,x7,lsl #6 // compute block begin indice * 4 * 16\n6: // begin loop one\n cmp x6,15\n bgt 7f\n // cas 1 f := (b et c) ou ((non b) et d)\n // g := i\n and w12,w9,w10\n mvn w13,w9\n and w13,w13,w11\n orr w12,w12,w13 // f\n mov x14,x6 // g\n b 10f\n7:\n cmp x6,31\n bgt 8f\n // f := (d et b) ou ((non d) et c)\n // g := (5×i + 1) mod 16\n and w12,w11,w9\n mvn w13,w11\n and w13,w13,w10\n orr w12,w12,w13 // f\n mov x13,5\n mul x13,x6,x13\n add x13,x13,1\n lsr x15,x13,4\n lsl x15,x15,4\n sub x14,x13,x15\n b 10f\n8:\n cmp x6,47\n bgt 9f\n // f := b xor c xor d\n // g := (3×i + 5) mod 16\n eor w12,w9,w10\n eor w12,w12,w11\n mov x13,3\n mul x13,x6,x13\n add x13,x13,5\n lsr x15,x13,4\n lsl x15,x15,4\n sub x14,x13,x15\n\n b 10f\n9:\n // f := c xor (b ou (non d))\n // g := (7×i) mod 16\n mvn w13,w11\n orr w13,w13,w9\n eor w12,w13,w10 // f\n mov x13,7\n mul x13,x6,x13\n lsr x15,x13,4\n lsl x15,x15,4\n sub x14,x13,x15 // g\n\n10:\n mov w15,w11\n mov w11,w10 // d = c\n mov w10,w9 // c = b\n add w16,w8,w12 // a + f\n ldr w17,[x2,x14,lsl #2]\n add w16,w16,w17 // + valeur bloc g\n ldr w13,[x3,x6,lsl #2]\n add w16,w16,w13 // + valeur constante K de i\n ldr w17,[x5,x6,lsl #2] // rotate left value\n mov w13,32\n sub w17,w13,w17\n ror w13,w16,w17\n add w9,w9,w13 // new b\n mov w8, w15 // new a\n\n add x6,x6,1\n cmp x6,63\n ble 6b\n\n ldr x0,qAdrtbH\n ldr w1,[x0] // H0\n add w1,w1,w8 // + a\n str w1,[x0]\n ldr w1,[x0,#4] // H1\n add w1,w1,w9 // + b\n str w1,[x0,#4]\n ldr w1,[x0,#8] // H2\n add w1,w1,w10 // + c\n str w1,[x0,#8]\n ldr w1,[x0,#12] // H3\n add w1,w1,w11 // + d\n str w1,[x0,#12]\n // other bloc\n add x7,x7,1 // increment block\n cmp x7,x4 // maxi ?\n ble 5b\n\n // compute final result\n ldr x0,qAdrtbH // start area H\n ldr x2,qAdrsZoneResult\n ldr w1,[x0]\n str w1,[x2]\n ldr w1,[x0,#4]\n str w1,[x2,#4]\n ldr w1,[x0,#8]\n str w1,[x2,#8]\n ldr w1,[x0,#12]\n str w1,[x2,#12]\n\n mov x0,#0 // routine OK\n b 100f\n99: // size error\n ldr x0,qAdrszMessSizeError\n bl affichageMess\n mov x0,-1\n100:\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\nqAdrtbConstH: .quad tbConstH\nqAdrtbConstK: .quad tbConstK\nqAdrtbRotaR: .quad tbRotaR\nqAdrtbH: .quad tbH\nqAdrsZoneResult: .quad sZoneResult\nqAdrszMessSizeError: .quad szMessSizeError\n\n/******************************************************************/\n/* display hash MD5 */\n/******************************************************************/\n/* x0 contains the address of hash */\ndisplayMD5:\n stp x1,lr,[sp,-16]! // save registers\n stp x2,x3,[sp,-16]! // save registers\n mov x3,x0\n mov x2,#0\n1:\n ldr w0,[x3,x2,lsl #2] // load 4 bytes\n rev w0,w0 // reverse bytes\n ldr x1,qAdrsZoneConv\n bl conversion16_4W // conversion hexa\n ldr x0,qAdrsZoneConv\n bl affichageMess\n add x2,x2,#1\n cmp x2,#MD5_DIGEST_LENGTH / 4\n blt 1b // and loop\n ldr x0,qAdrszCarriageReturn\n bl affichageMess // display message\n100:\n ldp x2,x3,[sp],16 // restaur 2 registers\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\n/******************************************************************/\n/* conversion hexadecimal register 32 bits */\n/******************************************************************/\n/* x0 contains value and x1 address zone receptrice */\nconversion16_4W:\n stp x0,lr,[sp,-48]! // save registres\n stp x1,x2,[sp,32] // save registres\n stp x3,x4,[sp,16] // save registres\n mov x2,#28 // start bit position\n mov x4,#0xF0000000 // mask\n mov x3,x0 // save entry value\n1: // start loop\n and x0,x3,x4 // value register and mask\n lsr x0,x0,x2 // right shift\n cmp x0,#10 // >= 10 ?\n bge 2f // yes\n add x0,x0,#48 // no is digit\n b 3f\n2:\n add x0,x0,#55 // else is a letter A-F\n3:\n strb w0,[x1],#1 // load result and + 1 in address\n lsr x4,x4,#4 // shift mask 4 bits left\n subs x2,x2,#4 // decrement counter 4 bits <= zero ?\n bge 1b // no -> loop\n\n100: // fin standard de la fonction\n ldp x3,x4,[sp,16] // restaur des 2 registres\n ldp x1,x2,[sp,32] // restaur des 2 registres\n ldp x0,lr,[sp],48 // restaur des 2 registres\n ret\n/********************************************************/\n/* File Include fonctions */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"\n","language":"AArch64-Assembly"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\nwith GNAT.MD5;\n\nprocedure MD5_Digest is\nbegin\n Put(GNAT.MD5.Digest(\"Foo bar baz\"));\nend MD5_Digest;\n","language":"Ada"},{"code":"# Based on wikipedia article pseudocode #\n\n# s specifies the per-round shift amounts #\n[]INT s = (7,12,17,22, 7,12,17,22, 7,12,17,22, 7,12,17,22,\n 5, 9,14,20, 5, 9,14,20, 5, 9,14,20, 5, 9,14,20,\n 4,11,16,23, 4,11,16,23, 4,11,16,23, 4,11,16,23,\n 6,10,15,21, 6,10,15,21, 6,10,15,21, 6,10,15,21);\n\n[]BITS k = (16rd76aa478, 16re8c7b756, 16r242070db, 16rc1bdceee,\n\t 16rf57c0faf, 16r4787c62a, 16ra8304613, 16rfd469501,\n\t 16r698098d8, 16r8b44f7af, 16rffff5bb1, 16r895cd7be,\n\t 16r6b901122, 16rfd987193, 16ra679438e, 16r49b40821,\n\t 16rf61e2562, 16rc040b340, 16r265e5a51, 16re9b6c7aa,\n\t 16rd62f105d, 16r02441453, 16rd8a1e681, 16re7d3fbc8,\n\t 16r21e1cde6, 16rc33707d6, 16rf4d50d87, 16r455a14ed,\n\t 16ra9e3e905, 16rfcefa3f8, 16r676f02d9, 16r8d2a4c8a,\n\t 16rfffa3942, 16r8771f681, 16r6d9d6122, 16rfde5380c,\n\t 16ra4beea44, 16r4bdecfa9, 16rf6bb4b60, 16rbebfbc70,\n\t 16r289b7ec6, 16reaa127fa, 16rd4ef3085, 16r04881d05,\n\t 16rd9d4d039, 16re6db99e5, 16r1fa27cf8, 16rc4ac5665,\n\t 16rf4292244, 16r432aff97, 16rab9423a7, 16rfc93a039,\n\t 16r655b59c3, 16r8f0ccc92, 16rffeff47d, 16r85845dd1,\n\t 16r6fa87e4f, 16rfe2ce6e0, 16ra3014314, 16r4e0811a1,\n\t 16rf7537e82, 16rbd3af235, 16r2ad7d2bb, 16reb86d391);\n\nOP + = (BITS a, b) BITS:\n BEGIN\n BITS c = BIN (ABS (a AND 16rffff) + ABS (b AND 16rffff));\n BITS d = BIN (ABS (a SHR 16) + ABS (b SHR 16) + ABS (c SHR 16));\n (c AND 16rffff) OR (d SHL 16)\n END;\n\n#[0:63]LONG INT k;\nFOR i FROM 0 TO 63 DO\n k[i] := ENTIER (ABS (sin(i+1)) * LONG INT(2)**32)\nOD;#\n\nPROC md5 = (STRING intext) STRING:\n BEGIN\n # Initialize variables: #\n BITS a0 := 16r67452301,\n a1 := 16refcdab89,\n a2 := 16r98badcfe,\n a3 := 16r10325476;\n\n STRING text := intext;\n\n # Pre-processing: adding a single 1 bit #\n text +:= REPR 128;\n\n # Pre-processing: padding with zeros\n append \"0\" bit until message length in bits ≡ 448 (mod 512) #\n WHILE ELEMS text MOD 64 ≠ 56 DO\n text +:= REPR 0\n OD;\n\n # append original length in bits mod (2 pow 64) to message #\n text +:= dec2asc (ELEMS intext * 8);\n\n # MD5 rounds #\n # Process the message in successive 512-bit chunks: #\n WHILE text ≠ \"\" DO\n\t # for each 512-bit (64 byte) chunk of message #\n\t []CHAR chunk = text[1:64]; text := text[65:];\n\t # break chunk into sixteen 32-bit words M[j], 0 <= j <= 15 #\n\t [0:15]BITS m;\n FOR j FROM 0 TO 15 DO\n m[j] := BIN (ABS chunk[j*4+1]) OR\n\t BIN (ABS chunk[j*4+2]) SHL 8 OR\n\t BIN (ABS chunk[j*4+3]) SHL 16 OR\n\t BIN (ABS chunk[j*4+4]) SHL 24\n OD;\n INT g;\n\t BITS a, b, c, d, f, dtemp;\n\n\t # Initialize hash value for this chunk #\n\t a := a0;\n b := a1;\n c := a2;\n d := a3;\n FOR i FROM 0 TO 63 DO\n IF 0 <= i AND i <= 15 THEN\n\t\tf := (b AND c) OR ((NOT b) AND d);\n\t\tg := i\n\t ELIF 16 <= i AND i <= 31 THEN\n\t\t f := (d AND b) OR ((NOT d) AND c);\n\t\t g := (5×i + 1) MOD 16\n\t ELIF 32 <= i AND i <= 47 THEN\n\t\t f := b XOR c XOR d;\n\t\t g := (3×i + 5) MOD 16\n\t ELIF 48 <= i AND i <= 63 THEN\n\t\t f := c XOR (b OR (NOT d));\n\t\t g := (7×i) MOD 16\n\t FI;\n\t dtemp := d;\n\t d := c;\n\t c := b;\n\t b := b + leftrotate ((a + f + k[1+i] + m[g]), s[1+i]);\n\t a := dtemp\n OD;\n\t # Add this chunk's hash to result so far #\n a0 := a0 + a;\n a1 := a1 + b;\n a2 := a2 + c;\n a3 := a3 + d\n OD;\n revhex (a0) + revhex (a1) + revhex (a2) + revhex (a3)\n END;\n\nPROC leftrotate = (BITS x, INT c) BITS:\n (x SHL c) OR (x SHR (32-c));\n\n# dec2asc: dec to 8 byte asc #\nPROC dec2asc = (INT nn)STRING:\n BEGIN\n STRING h := \"\"; INT n := nn;\n FOR i TO 8 DO\n h +:= REPR (n MOD 256);\n n ÷:= 256\n OD;\n h\n END;\n\n PROC revhex = (BITS x) STRING :\n BEGIN # Convert to lowercase hexadecimal STRING #\n PROC hexdig = (BITS x) CHAR: (REPR (ABS(x) <= 9 | ABS(x) + ABS(\"0\") | ABS(x) - 10 + ABS(\"a\")));\n hexdig (x SHR 4 AND 16rf) +\n hexdig (x AND 16rf) +\n hexdig (x SHR 12 AND 16rf) +\n hexdig (x SHR 8 AND 16rf) +\n hexdig (x SHR 20 AND 16rf) +\n hexdig (x SHR 16 AND 16rf) +\n hexdig (x SHR 28 AND 16rf) +\n hexdig (x SHR 24 AND 16rf)\n END;\n\nSTRING testmsg = \"The quick brown fox jumps over the lazy dog\";\nSTRING checksum = \"9e107d9d372bb6826bd81d3542a419d6\";\n\nprint ((testmsg, new line));\nprint ((checksum, new line));\n\nSTRING test = md5 (testmsg);\n\nIF test = checksum THEN\n print ((\"passed\", new line));\n print ((test, new line))\nELSE\n print ((\"failed\"))\nFI\n","language":"ALGOL-68"},{"code":" md5←{\n ⍝ index origin zero\n ⎕IO←0\n ⍝ decoding UTF-8 & padding\n M←(⊢,(0⍴⍨512|448-512|≢))1,⍨l←,⍉(8⍴2)⊤'UTF-8'⎕UCS ⍵\n ⍝ add length\n M,←,⍉(8⍴2)⊤⌽(8⍴256)⊤≢l\n ⍝ init registers\n A←16⊥6 7 4 5 2 3 0 1\n B←16⊥14 15 12 13 10 11 8 9\n C←16⊥9 8 11 10 13 12 15 14\n D←16⊥1 0 3 2 5 4 7 6\n ⍝ T table\n T←⌊(2*32)×|1○1+⍳64\n ⍝ index table\n K←16|i,(1+5×i),(5+3×i),7×i←⍳16\n ⍝ rot table\n S←,1 0 2⍉4 4 4⍴7 12 17 22 5 9 14 20 4 11 16 23 6 10 15 21\n ⍝ truncate ⍵ to 32 bit & rot left ⍺\n rot←{2⊥⍺⌽(32⍴2)⊤⍵}\n proc←{\n ⍝ pack 512 bits into 32 bit words &\n ⍝ precompute X[k] + T[i]\n l←T+(⊂K)⌷256⊥⍉⌽16 4⍴2⊥⍉64 8⍴⍺\n fn←{\n ⍝ a b c d to binary\n a b c d←↓⍉(32⍴2)⊤⍵\n ⍝ a + F(b,c,d)\n ⍺<16:S[⍺]rot l[⍺]+2⊥a+d≠b∧c≠d\n ⍺<32:S[⍺]rot l[⍺]+2⊥a+(b∧d)∨(c∧~d)\n ⍺<48:S[⍺]rot l[⍺]+2⊥a+b≠c≠d\n S[⍺]rot l[⍺]+2⊥a+c≠b∨~d\n }\n (2*32)|⍵+⊃{¯1⌽((⍵[1]+⍺ fn ⍵)@0)⍵}/(⌽⍳64),⊂⍵\n }\n ⍝ process each 512 bits\n loop←{⍬≡⍺:⍵ ⋄ (512↓⍺)∇(512↑⍺)proc ⍵}\n ⍝ output registers\n (⎕D,⎕A)[,⍉(2⍴16)⊤,⍉⊖(4⍴256)⊤M loop A B C D]\n }\n","language":"APL"},{"code":"/* ARM assembly Raspberry PI */\n/* program MD5.s */\n\n/* REMARK 1 : this program use routines in a include file\n see task Include a file language arm assembly\n for the routine affichageMess conversion10\n see at end of this program the instruction include */\n/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes */\n/************************************/\n.include \"../constantes.inc\"\n\n.equ LGHASH, 16 // result length\n.equ ZWORKSIZE, 1000 // work area size\n\n/*******************************************/\n/* Structures */\n/********************************************/\n/* example structure variables */\n .struct 0\nvar_a: // a\n .struct var_a + 4\nvar_b: // b\n .struct var_b + 4\nvar_c: // c\n .struct var_c + 4\nvar_d: // d\n .struct var_d + 4\n/*********************************/\n/* Initialized data */\n/*********************************/\n.data\nszMessTest1: .asciz \"abc\"\nszMessTest4: .asciz \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"\nszMessTest2: .asciz \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"\nszMessTest3: .asciz \"abcdefghijklmnopqrstuvwxyz\"\nszMessFinPgm: .asciz \"Program End ok.\\n\"\nszMessResult: .asciz \"Result for \"\nszMessResult1: .asciz \" => \"\nszMessSizeError: .asciz \"\\033[31mWork area too small !! \\033[0m \\n\"\nszCarriageReturn: .asciz \"\\n\"\n\n.align 4\n/* array constantes K */\ntbConstK: .int 0xd76aa478,0xe8c7b756,0x242070db,0xc1bdceee\n .int 0xf57c0faf,0x4787c62a,0xa8304613,0xfd469501\n .int 0x698098d8,0x8b44f7af,0xffff5bb1,0x895cd7be\n .int 0x6b901122,0xfd987193,0xa679438e,0x49b40821\n .int 0xf61e2562,0xc040b340,0x265e5a51,0xe9b6c7aa\n .int 0xd62f105d,0x2441453,0xd8a1e681,0xe7d3fbc8\n .int 0x21e1cde6,0xc33707d6,0xf4d50d87,0x455a14ed\n .int 0xa9e3e905,0xfcefa3f8,0x676f02d9,0x8d2a4c8a\n .int 0xfffa3942,0x8771f681,0x6d9d6122,0xfde5380c\n .int 0xa4beea44,0x4bdecfa9,0xf6bb4b60,0xbebfbc70\n .int 0x289b7ec6,0xeaa127fa,0xd4ef3085,0x4881d05\n .int 0xd9d4d039,0xe6db99e5,0x1fa27cf8,0xc4ac5665\n .int 0xf4292244,0x432aff97,0xab9423a7,0xfc93a039\n .int 0x655b59c3,0x8f0ccc92,0xffeff47d,0x85845dd1\n .int 0x6fa87e4f,0xfe2ce6e0,0xa3014314,0x4e0811a1\n .int 0xf7537e82,0xbd3af235,0x2ad7d2bb,0xeb86d391\n\n/* array rotation coef R */\ntbRotaR: .int 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22\n .int 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20\n .int 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23\n .int 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21\n\ntbConstH: .int 0x67452301 // H0\n .int 0xEFCDAB89 // H1\n .int 0x98BADCFE // H2\n .int 0x10325476 // H3\n\n/*********************************/\n/* UnInitialized data */\n/*********************************/\n.bss\n.align 4\nsZoneConv: .skip 24\ntbH: .skip 4 * 4 @ 4 variables H\ntbabcd: .skip 4 * 4 @ 4 variables a b c d\nsZoneTrav: .skip 1000\n/*********************************/\n/* code section */\n/*********************************/\n.text\n.global main\nmain: @ entry of program\n\n ldr r0,iAdrszMessTest1\n bl computeExemple\n\n ldr r0,iAdrszMessTest2\n bl computeExemple\n\n ldr r0,iAdrszMessTest3\n bl computeExemple\n\n ldr r0,iAdrszMessTest4\n bl computeExemple\n\n ldr r0,iAdrszMessFinPgm\n bl affichageMess @ display message\n\n\n100: @ standard end of the program\n mov r0, #0 @ return code\n mov r7, #EXIT @ request to exit program\n svc #0 @ perform the system call\n\niAdrszCarriageReturn: .int szCarriageReturn\niAdrszMessResult: .int szMessResult\niAdrszMessResult1: .int szMessResult1\niAdrszMessTest1: .int szMessTest1\niAdrszMessTest2: .int szMessTest2\niAdrszMessTest3: .int szMessTest3\niAdrszMessTest4: .int szMessTest4\niAdrsZoneTrav: .int sZoneTrav\niAdrsZoneConv: .int sZoneConv\niAdrszMessFinPgm: .int szMessFinPgm\niAdrszMessSizeError: .int szMessSizeError\n/***********************************************/\n/* compute exemple */\n/***********************************************/\n/* r0 contains the address of the message */\ncomputeExemple:\n push {r1,lr} @ save registres\n mov r1,r0\n bl computeMD5 @ call routine MD5\n\n ldr r0,iAdrszMessResult\n bl affichageMess\n mov r0,r1\n bl affichageMess\n ldr r0,iAdrszMessResult1\n bl affichageMess\n ldr r0, iAdrtbH\n bl displayMD5\n\n100:\n pop {r1,pc} @ restaur registers\n\n/******************************************************************/\n/* compute MD5 */\n/******************************************************************/\n/* r0 contains the address of the message */\ncomputeMD5:\n push {r1-r12,lr} @ save registres\n ldr r1,iAdrsZoneTrav\n mov r2,#0 @ counter length\n1: @ copy string in work area\n cmp r2,#ZWORKSIZE @ maxi ?\n bge 99f @ error\n ldrb r3,[r0,r2]\n strb r3,[r1,r2]\n cmp r3,#0\n addne r2,r2,#1\n bne 1b\n lsl r6,r2,#3 @ initial message length in bits\n mov r3,#0b10000000 @ add bit 1 at end of string\n strb r3,[r1,r2]\n add r2,r2,#1 @ length in bytes\n lsl r4,r2,#3 @ length in bits\n mov r3,#0\n2:\n lsr r5,r2,#6\n lsl r5,r5,#6\n sub r5,r2,r5\n cmp r5,#56\n beq 3f @ yes -> end add\n strb r3,[r1,r2] @ add zero at message end\n add r2,#1 @ increment lenght bytes\n add r4,#8 @ increment length in bits\n b 2b\n3:\n str r6,[r1,r2] @ and store length at end\n add r5,r2,#4\n str r3,[r1,r5] @ store zero in hight bits for 64 bits\n\n ldr r7,iAdrtbConstH @ constantes H address\n ldr r4,iAdrtbH @ start area H\n mov r5,#0\n4: @ init array H with start constantes\n ldr r6,[r7,r5,lsl #2] @ load constante\n str r6,[r4,r5,lsl #2] @ and store\n add r5,r5,#1\n cmp r5,#4\n blt 4b\n @ split into block of 64 bytes\n add r2,#4 @ TODO : à revoir\n lsr r4,r2,#6 @ blocks number\n\n ldr r0,iAdrtbH @ variables H\n ldr r1,iAdrsZoneTrav\n ldr r5,iAdrtbConstK\n ldr r3,iAdrtbRotaR\n ldr r8,iAdrtbabcd\n mov r7,#0 @ n° de block et r1 contient l adresse zone de travail\n5: @ begin loop of each block of 64 bytes\n add r2,r1,r7,lsl #6 @ compute block begin indice * 4 * 16\n mov r6,#0 @ indice t\n /* COMPUTING THE MESSAGE DIGEST */\n /* r0 variables H address */\n /* r1 work area */\n /* r2 block work area begin address */\n /* r3 address constantes rotate */\n /* r4 block number */\n /* r5 constance K address */\n /* r6 counter t */\n /* r7 block counter */\n /* r8 addresse variables a b c d */\n @ init variable a b c d with variables H\n mov r10,#0\n6: @ loop init\n ldr r9,[r0,r10,lsl #2] @ variables H\n str r9,[r8,r10,lsl #2] @ variables a b c d\n add r10,r10,#1\n cmp r10,#4\n blt 6b\n\n7: @ loop begin\n cmp r6,#15\n bgt 8f\n @ cas 1 f := (b et c) ou ((non b) et d)\n @ g := i\n ldr r9,[r8,#var_b]\n ldr r10,[r8,#var_c]\n and r12,r10,r9\n mvn r9,r9\n ldr r10,[r8,#var_d]\n and r11,r9,r10\n orr r12,r12,r11 @ f\n mov r9,r6 @ g\n b 11f\n8:\n cmp r6,#31\n bgt 9f\n @ f := (d et b) ou ((non d) et c)\n @ g := (5×i + 1) mod 16\n ldr r9,[r8,#var_b]\n ldr r10,[r8,#var_d]\n and r12,r10,r9\n mvn r10,r10\n ldr r9,[r8,#var_c]\n and r11,r9,r10\n orr r12,r12,r11 @ f\n mov r9,#5\n mul r9,r6,r9\n add r9,r9,#1\n lsr r10,r9,#4\n lsl r10,r10,#4\n sub r9,r9,r10 @ g\n\n b 11f\n9:\n cmp r6,#47\n bgt 10f\n @ f := b xor c xor d\n @ g := (3×i + 5) mod 16\n ldr r9,[r8,#var_b]\n ldr r10,[r8,#var_c]\n eor r12,r10,r9\n ldr r10,[r8,#var_d]\n eor r12,r12,r10 @ f\n mov r9,#3\n mul r9,r6,r9\n add r9,r9,#5\n lsr r10,r9,#4\n lsl r10,r10,#4\n sub r9,r9,r10 @ g\n b 11f\n10:\n @ f := c xor (b ou (non d))\n @ g := (7×i) mod 16\n ldr r10,[r8,#var_d]\n mvn r12,r10\n ldr r10,[r8,#var_b]\n orr r12,r12,r10\n ldr r10,[r8,#var_c]\n eor r12,r12,r10 @ f\n mov r9,#7\n mul r9,r6,r9\n lsr r10,r9,#4\n lsl r10,r10,#4\n sub r9,r9,r10 @ g\n\n11:\n ldr r10,[r8,#var_d]\n mov r11,r10 @ save old d\n ldr r10,[r8,#var_c]\n str r10,[r8,#var_d] @ new d = c\n ldr r10,[r8,#var_b]\n str r10,[r8,#var_c] @ new c = b\n ldr r10,[r8,#var_a]\n add r12,r12,r10 @ a + f\n ldr r10,[r2,r9,lsl #2]\n add r12,r12,r10 @ + valeur bloc g\n ldr r10,[r5,r6,lsl #2]\n add r12,r12,r10 @ + valeur constante K de i\n ldr r10,[r3,r6,lsl #2] @ rotate left value\n rsb r10,r10,#32 @ compute right rotate\n ror r12,r12,r10\n ldr r10,[r8,#var_b]\n add r12,r12,r10\n str r12,[r8,#var_b] @ new b\n str r11,[r8,#var_a] @ new a = old d\n\n add r6,r6,#1\n cmp r6,#63\n ble 7b\n @ maj area H\n ldr r10,[r0] @ H0\n ldr r11,[r8,#var_a]\n add r10,r10,r11 @ + a\n str r10,[r0]\n ldr r10,[r0,#4] @ H1\n ldr r11,[r8,#var_b]\n add r10,r10,r11 @ + b\n str r10,[r0,#4]\n ldr r10,[r0,#8] @ H2\n ldr r11,[r8,#var_c]\n add r10,r10,r11 @ + c\n str r10,[r0,#8]\n ldr r10,[r0,#12] @ H3\n ldr r11,[r8,#var_d]\n add r10,r10,r11 @ + d\n str r10,[r0,#12]\n\n @ loop other block\n add r7,r7,#1 @ increment block\n cmp r7,r4 @ maxi ?\n ble 5b\n\n mov r9,#0 @ reverse bytes loop\n12:\n ldr r10,[r0,r9,lsl #2]\n rev r10,r10 @ reverse bytes\n str r10,[r0,r9,lsl #2]\n add r9,r9,#1\n cmp r9,#LGHASH / 4\n blt 12b\n mov r0,#0 @ routine OK\n b 100f\n99: @ size error\n ldr r0,iAdrszMessSizeError\n bl affichageMess\n mov r0,#-1 @ error routine\n\n100:\n pop {r1-r12,pc} @ restaur registers\niAdrtbConstH: .int tbConstH\niAdrtbConstK: .int tbConstK\niAdrtbRotaR: .int tbRotaR\niAdrtbH: .int tbH\niAdrtbabcd: .int tbabcd\n\n/*************************************************/\n/* display hash MD5 */\n/*************************************************/\n/* r0 contains the address of hash */\ndisplayMD5:\n push {r1-r3,lr} @ save registres\n mov r3,r0\n mov r2,#0\n1:\n ldr r0,[r3,r2,lsl #2] @ load 4 bytes\n ldr r1,iAdrsZoneConv\n bl conversion16 @ conversion hexa\n ldr r0,iAdrsZoneConv\n bl affichageMess\n add r2,r2,#1\n cmp r2,#LGHASH / 4\n blt 1b @ and loop\n ldr r0,iAdrszCarriageReturn\n bl affichageMess @ display message\n100:\n pop {r1-r3,lr} @ restaur registers\n bx lr @ return\n/***************************************************/\n/* ROUTINES INCLUDE */\n/***************************************************/\n.include \"../affichage.inc\"\n","language":"ARM-Assembly"},{"code":"print digest \"The quick brown fox jumped over the lazy dog's back\"\n","language":"Arturo"},{"code":"data := \"abc\"\nMsgBox % MD5(data,StrLen(data)) ; 900150983cd24fb0d6963f7d28e17f72\n\nMD5( ByRef V, L=0 ) {\n VarSetCapacity( MD5_CTX,104,0 ), DllCall( \"advapi32\\MD5Init\", Str,MD5_CTX )\n DllCall( \"advapi32\\MD5Update\", Str,MD5_CTX, Str,V, UInt,L ? L : VarSetCapacity(V) )\n DllCall( \"advapi32\\MD5Final\", Str,MD5_CTX )\n Loop % StrLen( Hex:=\"123456789ABCDEF0\" )\n N := NumGet( MD5_CTX,87+A_Index,\"Char\"), MD5 .= SubStr(Hex,N>>4,1) . SubStr(Hex,N&15,1)\nReturn MD5\n}\n","language":"AutoHotkey"},{"code":"; GLOBAL CONSTANTS r[64], k[64]\nr = 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22\n, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20\n, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23\n, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21\nStringSplit r, r, `,\nr0 := 7\nLoop 64\n i := A_Index-1, k%i% := floor(abs(sin(A_Index)) * 2**32)\n\n; TEST CASES\nMsgBox % MD5(x:=\"\", 0) ; d41d8cd98f00b204e9800998ecf8427e\nMsgBox % MD5(x:=\"a\", StrLen(x)) ; 0cc175b9c0f1b6a831c399e269772661\nMsgBox % MD5(x:=\"abc\", StrLen(x)) ; 900150983cd24fb0d6963f7d28e17f72\nMsgBox % MD5(x:=\"message digest\", StrLen(x)) ; f96b697d7cb7938d525a2f31aaf161d0\nMsgBox % MD5(x:=\"abcdefghijklmnopqrstuvwxyz\", StrLen(x))\n; c3fcd3d76192e4007dfb496cca67e13b\nMsgBox % MD5(x:=\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\", StrLen(x))\n; d174ab98d277d9f5a5611c2c9f419d9f\nMsgBox % MD5(x:=\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\", StrLen(x))\n; 57edf4a22be3c955ac49da2e2107b67a\nMsgBox % MD5(x:=\"The quick brown fox jumps over the lazy dog\", StrLen(x))\n; 9e107d9d372bb6826bd81d3542a419d6\nMsgBox % MD5(x:=\"The quick brown fox jumps over the lazy cog\", StrLen(x))\n; 1055d3e698d289f2af8663725127bd4b\n\nMD5(ByRef Buf, L) { ; Binary buffer, Length in bytes\n Static P, Q, N, i, a,b,c,d, t, h0,h1,h2,h3, y = 0xFFFFFFFF\n\n h0 := 0x67452301, h1 := 0xEFCDAB89, h2 := 0x98BADCFE, h3 := 0x10325476\n\n N := ceil((L+9)/64)*64 ; padded length (100..separator, 8B length)\n VarSetCapacity(Q,N,0) ; room for padded data\n P := &Q ; pointer\n DllCall(\"RtlMoveMemory\", UInt,P, UInt,&Buf, UInt,L) ; copy data\n DllCall(\"RtlFillMemory\", UInt,P+L, UInt,1, UInt,0x80) ; pad separator\n DllCall(\"ntdll.dll\\RtlFillMemoryUlong\",UInt,P+N-8,UInt,4,UInt,8*L) ; at end: length in bits < 512 MB\n\n Loop % N//64 {\n Loop 16\n i := A_Index-1, w%i% := *P | *(P+1)<<8 | *(P+2)<<16 | *(P+3)<<24, P += 4\n\n a := h0, b := h1, c := h2, d := h3\n\n Loop 64 {\n i := A_Index-1\n If i < 16\n f := (b & c) | (~b & d), g := i\n Else If i < 32\n f := (d & b) | (~d & c), g := 5*i+1 & 15\n Else If i < 48\n f := b ^ c ^ d, g := 3*i+5 & 15\n Else\n f := c ^ (b | ~d), g := 7*i & 15\n\n t := d, d := c, c := b\n b += rotate(a + f + k%i% + w%g%, r%i%) ; reduced to 32 bits later\n a := t\n }\n\n h0 := h0+a & y, h1 := h1+b & y, h2 := h2+c & y, h3 := h3+d & y\n }\n Return hex(h0) . hex(h1) . hex(h2) . hex(h3)\n}\n\nrotate(a,b) { ; 32-bit rotate a to left by b bits, bit32..63 garbage\n Return a << b | (a & 0xFFFFFFFF) >> (32-b)\n}\n\nhex(x) { ; 32-bit little endian hex digits\n SetFormat Integer, HEX\n x += 0x100000000, x := SubStr(x,-1) . SubStr(x,8,2) . SubStr(x,6,2) . SubStr(x,4,2)\n SetFormat Integer, DECIMAL\n Return x\n}\n","language":"AutoHotkey"},{"code":"PRAGMA INCLUDE <stdio.h>\nPRAGMA INCLUDE <stdlib.h>\nPRAGMA INCLUDE <string.h>\nPRAGMA INCLUDE <openssl/md5.h>\nPRAGMA LDFLAGS -lcrypto -lm -w\n\nDECLARE result TYPE unsigned char *\nDECLARE string TYPE const char *\n\nstring = \"Rosetta code\"\nstrlenght = LEN(string)\n\nresult = MD5( string, strlenght , 0)\n\nFOR i = 0 TO MD5_DIGEST_LENGTH-1\n PRINT result[i] FORMAT \"%02x\"\nNEXT\n","language":"BaCon"},{"code":"print MD5(\"\")\nprint MD5(\"a\")\nprint MD5(\"abc\")\nprint MD5(\"message digest\")\nprint MD5(\"abcdefghijklmnopqrstuvwxyz\")\nprint MD5(\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\")\nprint MD5(\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\")\nend\n","language":"BASIC256"},{"code":" PRINT FN_MD5(\"\")\n PRINT FN_MD5(\"a\")\n PRINT FN_MD5(\"abc\")\n PRINT FN_MD5(\"message digest\")\n PRINT FN_MD5(\"abcdefghijklmnopqrstuvwxyz\")\n PRINT FN_MD5(\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\")\n PRINT FN_MD5(STRING$(8,\"1234567890\"))\n END\n\n DEF FN_MD5(message$)\n LOCAL I%, MD5$, MD5_CTX{}\n DIM MD5_CTX{i%(1), buf%(3), in&(63), digest&(15)}\n SYS \"MD5Init\", MD5_CTX{}\n SYS \"MD5Update\", MD5_CTX{}, message$, LEN(message$)\n SYS \"MD5Final\", MD5_CTX{}\n FOR I% = 0 TO 15\n MD5$ += RIGHT$(\"0\"+STR$~(MD5_CTX.digest&(I%)),2)\n NEXT\n = MD5$\n","language":"BBC-BASIC"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <openssl/md5.h>\n\nconst char *string = \"The quick brown fox jumped over the lazy dog's back\";\n\nint main()\n{\n int i;\n unsigned char result[MD5_DIGEST_LENGTH];\n\n MD5(string, strlen(string), result);\n\n // output\n for(i = 0; i < MD5_DIGEST_LENGTH; i++)\n printf(\"%02x\", result[i]);\n printf(\"\\n\");\n\n return EXIT_SUCCESS;\n}\n","language":"C"},{"code":"#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <math.h>\n\ntypedef union uwb {\n unsigned w;\n unsigned char b[4];\n} WBunion;\n\ntypedef unsigned Digest[4];\n\nunsigned f0( unsigned abcd[] ){\n return ( abcd[1] & abcd[2]) | (~abcd[1] & abcd[3]);}\n\nunsigned f1( unsigned abcd[] ){\n return ( abcd[3] & abcd[1]) | (~abcd[3] & abcd[2]);}\n\nunsigned f2( unsigned abcd[] ){\n return abcd[1] ^ abcd[2] ^ abcd[3];}\n\nunsigned f3( unsigned abcd[] ){\n return abcd[2] ^ (abcd[1] |~ abcd[3]);}\n\ntypedef unsigned (*DgstFctn)(unsigned a[]);\n\nunsigned *calcKs( unsigned *k)\n{\n double s, pwr;\n int i;\n\n pwr = pow( 2, 32);\n for (i=0; i<64; i++) {\n s = fabs(sin(1+i));\n k[i] = (unsigned)( s * pwr );\n }\n return k;\n}\n\n// ROtate v Left by amt bits\nunsigned rol( unsigned v, short amt )\n{\n unsigned msk1 = (1<<amt) -1;\n return ((v>>(32-amt)) & msk1) | ((v<<amt) & ~msk1);\n}\n\nunsigned *md5( const char *msg, int mlen)\n{\n static Digest h0 = { 0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476 };\n// static Digest h0 = { 0x01234567, 0x89ABCDEF, 0xFEDCBA98, 0x76543210 };\n static DgstFctn ff[] = { &f0, &f1, &f2, &f3 };\n static short M[] = { 1, 5, 3, 7 };\n static short O[] = { 0, 1, 5, 0 };\n static short rot0[] = { 7,12,17,22};\n static short rot1[] = { 5, 9,14,20};\n static short rot2[] = { 4,11,16,23};\n static short rot3[] = { 6,10,15,21};\n static short *rots[] = {rot0, rot1, rot2, rot3 };\n static unsigned kspace[64];\n static unsigned *k;\n\n static Digest h;\n Digest abcd;\n DgstFctn fctn;\n short m, o, g;\n unsigned f;\n short *rotn;\n union {\n unsigned w[16];\n char b[64];\n }mm;\n int os = 0;\n int grp, grps, q, p;\n unsigned char *msg2;\n\n if (k==NULL) k= calcKs(kspace);\n\n for (q=0; q<4; q++) h[q] = h0[q]; // initialize\n\n {\n grps = 1 + (mlen+8)/64;\n msg2 = malloc( 64*grps);\n memcpy( msg2, msg, mlen);\n msg2[mlen] = (unsigned char)0x80;\n q = mlen + 1;\n while (q < 64*grps){ msg2[q] = 0; q++ ; }\n {\n// unsigned char t;\n WBunion u;\n u.w = 8*mlen;\n// t = u.b[0]; u.b[0] = u.b[3]; u.b[3] = t;\n// t = u.b[1]; u.b[1] = u.b[2]; u.b[2] = t;\n q -= 8;\n memcpy(msg2+q, &u.w, 4 );\n }\n }\n\n for (grp=0; grp<grps; grp++)\n {\n memcpy( mm.b, msg2+os, 64);\n for(q=0;q<4;q++) abcd[q] = h[q];\n for (p = 0; p<4; p++) {\n fctn = ff[p];\n rotn = rots[p];\n m = M[p]; o= O[p];\n for (q=0; q<16; q++) {\n g = (m*q + o) % 16;\n f = abcd[1] + rol( abcd[0]+ fctn(abcd) + k[q+16*p] + mm.w[g], rotn[q%4]);\n\n abcd[0] = abcd[3];\n abcd[3] = abcd[2];\n abcd[2] = abcd[1];\n abcd[1] = f;\n }\n }\n for (p=0; p<4; p++)\n h[p] += abcd[p];\n os += 64;\n }\n\n if( msg2 )\n free( msg2 );\n\n return h;\n}\n\nint main( int argc, char *argv[] )\n{\n int j,k;\n const char *msg = \"The quick brown fox jumps over the lazy dog.\";\n unsigned *d = md5(msg, strlen(msg));\n WBunion u;\n\n printf(\"= 0x\");\n for (j=0;j<4; j++){\n u.w = d[j];\n for (k=0;k<4;k++) printf(\"%02x\",u.b[k]);\n }\n printf(\"\\n\");\n\n return 0;\n}\n","language":"C"},{"code":"#include <string>\n#include <iostream>\n#include \"Poco/MD5Engine.h\"\n#include \"Poco/DigestStream.h\"\n\nusing Poco::DigestEngine ;\nusing Poco::MD5Engine ;\nusing Poco::DigestOutputStream ;\n\nint main( ) {\n std::string myphrase ( \"The quick brown fox jumped over the lazy dog's back\" ) ;\n MD5Engine md5 ;\n DigestOutputStream outstr( md5 ) ;\n outstr << myphrase ;\n outstr.flush( ) ; //to pass everything to the digest engine\n const DigestEngine::Digest& digest = md5.digest( ) ;\n std::cout << myphrase << \" as a MD5 digest :\\n\" << DigestEngine::digestToHex( digest )\n << \" !\" << std::endl ;\n return 0 ;\n}\n","language":"C++"},{"code":"using System.Text;\nusing System.Security.Cryptography;\n\nbyte[] data = Encoding.ASCII.GetBytes(\"The quick brown fox jumped over the lazy dog's back\");\nbyte[] hash = MD5.Create().ComputeHash(data);\nConsole.WriteLine(BitConverter.ToString(hash).Replace(\"-\", \"\").ToLower());\n","language":"C-sharp"},{"code":"(apply str\n (map (partial format \"%02x\")\n (.digest (doto (java.security.MessageDigest/getInstance \"MD5\")\n .reset\n (.update (.getBytes \"The quick brown fox jumps over the lazy dog\"))))))\n","language":"Clojure"},{"code":" IDENTIFICATION DIVISION.\n PROGRAM-ID. MD5.\n AUTHOR. Bill Gunshannon\n INSTALLATION. Home.\n DATE-WRITTEN. 16 December 2021.\n ************************************************************\n ** Program Abstract:\n ** Use the md5sum utility and pass the HASH back using\n ** a temp file. Not elegant, but it works.\n ************************************************************\n\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n FILE-CONTROL.\n SELECT Tmp-MD5 ASSIGN TO \"/tmp/MD5\"\n ORGANIZATION IS LINE SEQUENTIAL.\n\n\n DATA DIVISION.\n\n FILE SECTION.\n\n FD Tmp-MD5\n DATA RECORD IS MD5-Rec.\n 01 MD5-Rec PIC X(32).\n\n\n WORKING-STORAGE SECTION.\n\n 01 Eof PIC X VALUE 'F'.\n 01 Str1.\n 05 Pre-cmd PIC X(8)\n VALUE 'echo -n '.\n 05 Str1-complete.\n 10 Str1-Part1 PIC X(26)\n VALUE 'The quick brown fox jumps'.\n 10 Str1-Part2 PIC X(19)\n VALUE ' over the lazy dog'.\n 05 Post-cmd PIC X(20)\n VALUE ' | md5sum > /tmp/MD5'.\n 01 Str1-MD5 PIC X(32).\n\n\n PROCEDURE DIVISION.\n\n Main-Program.\n\n DISPLAY Str1-complete.\n PERFORM Get-MD5.\n DISPLAY Str1-MD5.\n\n STOP RUN.\n\n Get-MD5.\n\n CALL \"SYSTEM\" USING Str1.\n OPEN INPUT Tmp-MD5.\n READ Tmp-MD5 INTO Str1-MD5.\n CLOSE Tmp-MD5.\n CALL \"CBL_DELETE_FILE\" USING '/tmp/MD5'.\n","language":"COBOL"},{"code":" IDENTIFICATION DIVISION.\n PROGRAM-ID. MD5-DEMO.\n AUTHOR. Bill Gunshannon\n INSTALLATION. Home.\n DATE-WRITTEN. 16 December 2021.\n ************************************************************\n ** Program Abstract:\n ** Use the md5sum utility and pass the HASH back using\n ** a temp file. Not elegant, but it works.\n ** Same program but made MD5 a User Defined Function\n ** instead of a procedure.\n ************************************************************\n\n\n ENVIRONMENT DIVISION.\n\n CONFIGURATION SECTION.\n\n REPOSITORY.\n FUNCTION MD5.\n\n DATA DIVISION.\n\n WORKING-STORAGE SECTION.\n\n 01 Eof PIC X VALUE 'F'.\n 01 Str1.\n 05 Pre-cmd PIC X(8)\n VALUE 'echo -n '.\n 05 Str1-complete.\n 10 Str1-Part1 PIC X(26)\n VALUE 'The quick brown fox jumps'.\n 10 Str1-Part2 PIC X(19)\n VALUE ' over the lazy dog'.\n 05 Post-cmd PIC X(20)\n VALUE ' | md5sum > /tmp/MD5'.\n 01 Str1-MD5 PIC X(32).\n\n\n PROCEDURE DIVISION.\n\n Main-Program.\n\n DISPLAY Str1-complete.\n * PERFORM Get-MD5.\n MOVE FUNCTION MD5(Str1) TO Str1-MD5.\n DISPLAY Str1-MD5.\n\n STOP RUN.\n\n END PROGRAM MD5-DEMO.\n\n IDENTIFICATION DIVISION.\n FUNCTION-ID. MD5.\n\n ENVIRONMENT DIVISION.\n\n INPUT-OUTPUT SECTION.\n FILE-CONTROL.\n SELECT Tmp-MD5 ASSIGN TO \"/tmp/MD5\"\n ORGANIZATION IS LINE SEQUENTIAL.\n\n\n DATA DIVISION.\n\n FILE SECTION.\n\n FD Tmp-MD5\n DATA RECORD IS MD5-Rec.\n 01 MD5-Rec PIC X(32).\n\n\n\n LINKAGE SECTION.\n 01 Str1 PIC X(128).\n 01 Str1-MD5 PIC X(32).\n\n PROCEDURE DIVISION USING Str1 RETURNING Str1-MD5.\n\n CALL \"SYSTEM\" USING FUNCTION TRIM(Str1).\n OPEN INPUT Tmp-MD5.\n READ Tmp-MD5 INTO Str1-MD5.\n CLOSE Tmp-MD5.\n CALL \"CBL_DELETE_FILE\" USING '/tmp/MD5'.\n GO-BACK.\n\n END FUNCTION MD5.\n","language":"COBOL"},{"code":"(ql:quickload 'ironclad)\n(defun md5 (str)\n (ironclad:byte-array-to-hex-string\n (ironclad:digest-sequence :md5\n (ironclad:ascii-string-to-byte-array str))))\n(defvar *tests* '(\"\"\n \"a\"\n \"abc\"\n \"message digest\"\n \"abcdefghijklmnopqrstuvwxyz\"\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"\n \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"))\n(dolist (msg *tests*)\n (format T \"~s: ~a~%\" msg (md5 msg)))\n","language":"Common-Lisp"},{"code":"(cffi:load-foreign-library \"libcrypto.so\")\n\n(cffi:defcfun (\"MD5\" MD5) :void (string :string) (len :int) (ptr :pointer))\n\n(let ((string-to-convert \"The quick brown fox jumped over the lazy dog's back\")\n (ptr (cffi:foreign-alloc :unsigned-char :count 16)))\n (md5 string-to-convert (length string-to-convert) ptr)\n (loop for i from 0 below 16 do\n (format t \"~a\" (write-to-string (cffi:mem-ref ptr :unsigned-char i) :base 16)))\n (cffi:foreign-free ptr))\n","language":"Common-Lisp"},{"code":"require \"digest/md5\"\n\nputs Digest::MD5.hexdigest(\"The quick brown fox jumped over the lazy dog's back\")\n","language":"Crystal"},{"code":"void main() {\n import std.stdio, std.digest.md;\n\n auto txt = \"The quick brown fox jumped over the lazy dog's back\";\n writefln(\"%-(%02x%)\", txt.md5Of);\n}\n","language":"D"},{"code":"import tango.io.digest.Md5, tango.io.Stdout;\n\nvoid main(char[][] args) {\n auto md5 = new Md5();\n for(int i = 1; i < args.length; i++) {\n md5.update(args[i]);\n Stdout.formatln(\"[{}]=>\\n[{}]\", args[i], md5.hexDigest());\n }\n}\n","language":"D"},{"code":"program MD5Hash;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,\n IdHashMessageDigest;\n\nfunction MD5(aValue: string): string;\nbegin\n with TIdHashMessageDigest5.Create do\n begin\n Result:= HashStringAsHex(aValue);\n Free;\n end;\nend;\n\nbegin\n Writeln(MD5(''));\n Writeln(MD5('a'));\n Writeln(MD5('abc'));\n Writeln(MD5('message digest'));\n Writeln(MD5('abcdefghijklmnopqrstuvwxyz'));\n Writeln(MD5('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'));\n Writeln(MD5('12345678901234567890123456789012345678901234567890123456789012345678901234567890'));\n Readln;\nend.\n","language":"Delphi"},{"code":"def makeMessageDigest := <import:java.security.makeMessageDigest>\ndef sprintf := <import:java.lang.makeString>.format\n\ndef digest := makeMessageDigest.getInstance(\"MD5\") \\\n .digest(\"The quick brown fox jumped over the lazy dog's back\".getBytes(\"iso-8859-1\"))\n\nfor b in digest {\n print(sprintf(\"%02x\", [b]))\n}\nprintln()\n","language":"E"},{"code":"len md5k[] 64\nproc md5init . .\n for i = 1 to 64\n md5k[i] = floor (0x100000000 * abs sin (i * 180 / pi))\n .\n.\nmd5init\n#\nfunc$ md5 inp$ .\n subr addinp\n if inp4 = 1\n inp[] &= 0\n .\n inp[len inp[]] += b * inp4\n inp4 *= 0x100\n if inp4 = 0x100000000\n inp4 = 1\n .\n .\n s[] = [ 7 12 17 22 7 12 17 22 7 12 17 22 7 12 17 22 5 9 14 20 5 9 14 20 5 9 14 20 5 9 14 20 4 11 16 23 4 11 16 23 4 11 16 23 4 11 16 23 6 10 15 21 6 10 15 21 6 10 15 21 6 10 15 21 ]\n inp[] = [ ]\n inp4 = 1\n for i = 1 to len inp$\n b = strcode substr inp$ i 1\n addinp\n .\n b = 0x80\n addinp\n while len inp[] mod 16 <> 14 or inp4 <> 1\n b = 0\n addinp\n .\n h = len inp$ * 8\n for i = 1 to 4\n b = h mod 0x100\n addinp\n h = h div 0x100\n .\n inp[] &= 0\n #\n a0 = 0x67452301\n b0 = 0xefcdab89\n c0 = 0x98badcfe\n d0 = 0x10325476\n for chunk = 1 step 16 to len inp[] - 15\n a = a0 ; b = b0 ; c = c0 ; d = d0\n for i = 1 to 64\n if i <= 16\n h1 = bitand b c\n h2 = bitand bitnot b d\n f = bitor h1 h2\n g = i - 1\n elif i <= 32\n h1 = bitand d b\n h2 = bitand bitnot d c\n f = bitor h1 h2\n g = (5 * i - 4) mod 16\n elif i <= 48\n h1 = bitxor b c\n f = bitxor h1 d\n g = (3 * i + 2) mod 16\n else\n h1 = bitor b bitnot d\n f = bitxor c h1\n g = (7 * i - 7) mod 16\n .\n f = (f + a + md5k[i] + inp[chunk + g])\n a = d\n d = c\n c = b\n h1 = bitshift f s[i]\n h2 = bitshift f (s[i] - 32)\n b = (b + h1 + h2)\n .\n a0 += a ; b0 += b ; c0 += c ; d0 += d\n .\n for a in [ a0 b0 c0 d0 ]\n for i = 1 to 4\n b = a mod 256\n a = a div 256\n for h in [ b div 16 b mod 16 ]\n h += 48\n if h > 57\n h += 39\n .\n s$ &= strchar h\n .\n .\n .\n return s$\n.\n#\nprint md5 \"The quick brown fox jumped over the lazy dog's back\"\n","language":"EasyLang"},{"code":"(md5 \"The quick brown fox jumped over the lazy dog's back\") ;=> \"e38ca1d920c4b8b8d3946b2c72f01680\"\n(secure-hash 'md5 \"The quick brown fox jumped over the lazy dog's back\") ;=> \"e38ca1d920c4b8b8d3946b2c72f01680\"\n","language":"Emacs-Lisp"},{"code":"-module(tests).\n-export([md5/1]).\n\nmd5(S) ->\n string:to_upper(\n lists:flatten([io_lib:format(\"~2.16.0b\",[N]) || <<N>> <= erlang:md5(S)])\n ).\n","language":"Erlang"},{"code":"1> c(tests).\n{ok,tests}\n2> tests:md5(\"The quick brown fox jumped over the lazy dog's back\").\n\"E38CA1D920C4B8B8D3946B2C72F01680\"\n","language":"Erlang"},{"code":"let md5ootb (msg: string) =\n use md5 = System.Security.Cryptography.MD5.Create()\n msg\n |> System.Text.Encoding.ASCII.GetBytes\n |> md5.ComputeHash\n |> Seq.map (fun c -> c.ToString(\"X2\"))\n |> Seq.reduce ( + )\n\nmd5ootb @\"The quick brown fox jumped over the lazy dog's back\"\n","language":"F-Sharp"},{"code":"include ffl/md5.fs\n\n\\ Create a MD5 variable md1 in the dictionary\n\nmd5-create md1\n\n\\ Update the variable with data\n\ns\" The quick brown fox jumps over the lazy dog\" md1 md5-update\n\n\\ Finish the MD5 calculation resulting in four unsigned 32 bit words\n\\ on the stack representing the hash value\n\nmd1 md5-finish\n\n\\ Convert the hash value to a hex string and print it\n\nmd5+to-string type cr\n","language":"Forth"},{"code":"module md5_mod\n use kernel32\n use advapi32\n implicit none\n integer, parameter :: MD5LEN = 16\ncontains\n subroutine md5hash(name, hash, dwStatus, filesize)\n implicit none\n character(*) :: name\n integer, parameter :: BUFLEN = 32768\n integer(HANDLE) :: hFile, hProv, hHash\n integer(DWORD) :: dwStatus, nRead\n integer(BOOL) :: status\n integer(BYTE) :: buffer(BUFLEN)\n integer(BYTE) :: hash(MD5LEN)\n integer(UINT64) :: filesize\n\n dwStatus = 0\n filesize = 0\n hFile = CreateFile(trim(name) // char(0), GENERIC_READ, FILE_SHARE_READ, NULL, &\n OPEN_EXISTING, FILE_FLAG_SEQUENTIAL_SCAN, NULL)\n\n if (hFile == INVALID_HANDLE_VALUE) then\n dwStatus = GetLastError()\n print *, \"CreateFile failed.\"\n return\n end if\n\n if (CryptAcquireContext(hProv, NULL, NULL, PROV_RSA_FULL, &\n CRYPT_VERIFYCONTEXT) == FALSE) then\n dwStatus = GetLastError()\n print *, \"CryptAcquireContext failed.\"\n goto 3\n end if\n\n if (CryptCreateHash(hProv, CALG_MD5, 0_ULONG_PTR, 0_DWORD, hHash) == FALSE) then\n dwStatus = GetLastError()\n print *, \"CryptCreateHash failed.\"\n go to 2\n end if\n\n do\n status = ReadFile(hFile, loc(buffer), BUFLEN, nRead, NULL)\n if (status == FALSE .or. nRead == 0) exit\n filesize = filesize + nRead\n if (CryptHashData(hHash, buffer, nRead, 0) == FALSE) then\n dwStatus = GetLastError()\n print *, \"CryptHashData failed.\"\n go to 1\n end if\n end do\n\n if (status == FALSE) then\n dwStatus = GetLastError()\n print *, \"ReadFile failed.\"\n go to 1\n end if\n\n nRead = MD5LEN\n if (CryptGetHashParam(hHash, HP_HASHVAL, hash, nRead, 0) == FALSE) then\n dwStatus = GetLastError()\n print *, \"CryptGetHashParam failed.\", status, nRead, dwStatus\n end if\n\n 1 status = CryptDestroyHash(hHash)\n 2 status = CryptReleaseContext(hProv, 0)\n 3 status = CloseHandle(hFile)\n end subroutine\nend module\n\nprogram md5\n use md5_mod\n implicit none\n integer :: n, m, i, j\n character(:), allocatable :: name\n integer(DWORD) :: dwStatus\n integer(BYTE) :: hash(MD5LEN)\n integer(UINT64) :: filesize\n\n n = command_argument_count()\n do i = 1, n\n call get_command_argument(i, length=m)\n allocate(character(m) :: name)\n call get_command_argument(i, name)\n call md5hash(name, hash, dwStatus, filesize)\n if (dwStatus == 0) then\n do j = 1, MD5LEN\n write(*, \"(Z2.2)\", advance=\"NO\") hash(j)\n end do\n write(*, \"(' ',A,' (',G0,' bytes)')\") name, filesize\n end if\n deallocate(name)\n end do\nend program\n","language":"Fortran"},{"code":"println[messageDigest[\"The quick brown fox\", \"MD5\"]]\n","language":"Frink"},{"code":"type md5 = (u32, u32, u32, u32)\n\nfun rs(): [64]u32 =\n map u32\n ([ 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21 ])\n\nfun ks(): [64]u32 =\n map u32\n ([ 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee ,\n 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501 ,\n 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be ,\n 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821 ,\n 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa ,\n 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8 ,\n 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed ,\n 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a ,\n 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c ,\n 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70 ,\n 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05 ,\n 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665 ,\n 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039 ,\n 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1 ,\n 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1 ,\n 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391 ])\n\nfun md5(ms: [n][16]u32): md5 =\n let a0 = u32(0x67452301)\n let b0 = u32(0xefcdab89)\n let c0 = u32(0x98badcfe)\n let d0 = u32(0x10325476)\n loop ((a0,b0,c0,d0)) = for i < n do\n let (a,b,c,d) = md5_chunk (a0,b0,c0,d0) ms[i]\n in (a0+a, b0+b, c0+c, d0+d)\n in (a0,b0,c0,d0)\n\nfun rotate_left(x: u32, c: u32): u32 = (x << c) | (x >> (32u32 - c))\n\nfun bytes(x: u32): [4]u8 = [u8(x),\n u8(x/0x100u32),\n u8(x/0x10000u32),\n u8(x/0x1000000u32)]\n\nfun unbytes(bs: [4]u8): u32 =\n u32(bs[0]) +\n u32(bs[1]) * 0x100u32 +\n u32(bs[2]) * 0x10000u32 +\n u32(bs[3]) * 0x1000000u32\n\nfun unbytes_block(block: [64]u8): [16]u32 =\n map unbytes (reshape (16,4) block)\n\nfun main(ms: [n]u8): [16]u8 =\n let padding = 64 - (n % 64)\n let n_padded = n + padding\n let ms_padded = concat ms (bytes 0x80u32) (replicate (padding-12) 0x0u8) (bytes (u32(n*8))) ([0u8,0u8,0u8,0u8])\n let (a,b,c,d) = md5 (map unbytes_block (reshape (n_padded / 64, 64) ms_padded))\n in reshape 16 (map bytes ([a,b,c,d]))\n\n-- Process 512 bits of the input.\nfun md5_chunk ((a0,b0,c0,d0): md5) (m: [16]u32): md5 =\n loop ((a,b,c,d) = (a0,b0,c0,d0)) = for i < 64 do\n let (f,g) =\n if i < 16 then ((b & c) | ((~b) & d),\n i)\n else if i < 32 then ((d & b) | ((~d) & c),\n i32((5u32*u32(i) + 1u32) % 16u32))\n else if i < 48 then (b ^ c ^ d,\n i32((3u32*u32(i) + 5u32) % 16u32))\n else (c ^ (b | (~d)),\n i32((7u32*u32(i)) % 16u32))\n in (d, b + rotate_left(a + f + (ks())[i] + m[g], (rs())[i]), b, c)\n in (a,b,c,d)\n","language":"Futhark"},{"code":"package main\n\nimport (\n \"crypto/md5\"\n \"fmt\"\n)\n\nfunc main() {\n for _, p := range [][2]string{\n // RFC 1321 test cases\n {\"d41d8cd98f00b204e9800998ecf8427e\", \"\"},\n {\"0cc175b9c0f1b6a831c399e269772661\", \"a\"},\n {\"900150983cd24fb0d6963f7d28e17f72\", \"abc\"},\n {\"f96b697d7cb7938d525a2f31aaf161d0\", \"message digest\"},\n {\"c3fcd3d76192e4007dfb496cca67e13b\", \"abcdefghijklmnopqrstuvwxyz\"},\n {\"d174ab98d277d9f5a5611c2c9f419d9f\",\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"},\n {\"57edf4a22be3c955ac49da2e2107b67a\", \"12345678901234567890\" +\n \"123456789012345678901234567890123456789012345678901234567890\"},\n // test case popular with other RC solutions\n {\"e38ca1d920c4b8b8d3946b2c72f01680\",\n \"The quick brown fox jumped over the lazy dog's back\"},\n } {\n validate(p[0], p[1])\n }\n}\n\nvar h = md5.New()\n\nfunc validate(check, s string) {\n h.Reset()\n h.Write([]byte(s))\n sum := fmt.Sprintf(\"%x\", h.Sum(nil))\n if sum != check {\n fmt.Println(\"MD5 fail\")\n fmt.Println(\" for string,\", s)\n fmt.Println(\" expected: \", check)\n fmt.Println(\" got: \", sum)\n }\n}\n","language":"Go"},{"code":"import java.security.MessageDigest\n\nString.metaClass.md5Checksum = {\n MessageDigest.getInstance('md5').digest(delegate.bytes).collect { String.format(\"%02x\", it) }.join('')\n}\n","language":"Groovy"},{"code":"assert 'The quick brown fox jumps over the lazy dog'.md5Checksum() == '9e107d9d372bb6826bd81d3542a419d6'\n","language":"Groovy"},{"code":"import Data.Digest.OpenSSL.MD5 (md5sum)\nimport Data.ByteString (pack)\nimport Data.Char (ord)\n\nmain = do\n let message = \"The quick brown fox jumped over the lazy dog's back\"\n digest = (md5sum . pack . map (fromIntegral . ord)) message\n putStrLn digest\n","language":"Haskell"},{"code":"#!/usr/bin/env runhaskell\n\nimport Data.ByteString.Char8 (pack)\nimport System.Environment (getArgs)\nimport Crypto.Hash\n\nmain :: IO ()\nmain = print . md5 . pack . unwords =<< getArgs\n where md5 x = hash x :: Digest MD5\n","language":"Haskell"},{"code":"import haxe.crypto.Md5;\n\nclass Main {\n static function main() {\t\n var md5 = Md5.encode(\"The quick brown fox jumped over the lazy dog's back\");\n Sys.println(md5);\n }\n}\n","language":"Haxe"},{"code":"procedure main() # validate against the RFC test strings and more\n testMD5(\"The quick brown fox jumps over the lazy dog\", 16r9e107d9d372bb6826bd81d3542a419d6)\n testMD5(\"The quick brown fox jumps over the lazy dog.\", 16re4d909c290d0fb1ca068ffaddf22cbd0)\n testMD5(\"\", 16rd41d8cd98f00b204e9800998ecf8427e)\nend\n\nprocedure testMD5(s,rh) # compute the MD5 hash and compare it to reference value\n write(\"Message(length=\",*s,\") = \",image(s))\n write(\"Digest = \",hexstring(h := MD5(s)),if h = rh then \" matches reference hash\" else (\" does not match reference hash = \" || hexstring(rh)),\"\\n\")\nend\n","language":"Icon"},{"code":"Io> MD5\n==> MD5_0x97663e0:\n appendSeq = MD5_appendSeq()\n md5 = MD5_md5()\n md5String = MD5_md5String()\nIo> MD5 clone appendSeq(\"The quick brown fox jumped over the lazy dog's back\") md5String\n==> e38ca1d920c4b8b8d3946b2c72f01680\n","language":"Io"},{"code":" require 'convert/misc/md5'\n md5 'The quick brown fox jumped over the lazy dog''s back'\ne38ca1d920c4b8b8d3946b2c72f01680\n","language":"J"},{"code":"require 'convert'\n\n'`lt gt ge xor'=: (20 b.)`(18 b.)`(27 b.)`(22 b.)\n'`and or sh'=: (17 b.)`(23 b.)`(33 b.)\n\n{{\nif. IF64 do.\nrot=: (16bffffffff and sh or ] sh~ 32 -~ [) NB. (y << x) | (y >>> (32 - x))\nadd=: ((16bffffffff&and)@+)\"0\nelse.\nrot=: (32 b.)\nadd=: (+&(_16&sh) (16&sh@(+ _16&sh) or and&65535@]) +&(and&65535))\"0\nend.\nEMPTY\n}}''\n\nhexlist=: tolower@:,@:hfd@:,@:(|.\"1)@(256 256 256 256&#:)\n\ncmn=: {{\n'x s t'=. x [ 'q a b'=. y\nb add s rot (a add q) add (x add t)\n}}\n\nff=: cmn (((1&{ and 2&{) or 1&{ lt 3&{) , 2&{.)\ngg=: cmn (((1&{ and 3&{) or 2&{ gt 3&{) , 2&{.)\nhh=: cmn (((1&{ xor 2&{)xor 3&{ ) , 2&{.)\nii=: cmn (( 2&{ xor 1&{ ge 3&{ ) , 2&{.)\nop=: ff`gg`hh`ii\n\nI=: \".;._2{{)n\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15\n1 6 11 0 5 10 15 4 9 14 3 8 13 2 7 12\n5 8 11 14 1 4 7 10 13 0 3 6 9 12 15 2\n0 7 14 5 12 3 10 1 8 15 6 13 4 11 2 9\n}}\nS=: 4 4$7 12 17 22 5 9 14 20 4 11 16 23 6 10 15 21\n\nT=: |:\".;._2{{)n\n _680876936 _165796510 _378558 _198630844\n _389564586 _1069501632 _2022574463 1126891415\n 606105819 643717713 1839030562 _1416354905\n_1044525330 _373897302 _35309556 _57434055\n _176418897 _701558691 _1530992060 1700485571\n 1200080426 38016083 1272893353 _1894986606\n_1473231341 _660478335 _155497632 _1051523\n _45705983 _405537848 _1094730640 _2054922799\n 1770035416 568446438 681279174 1873313359\n_1958414417 _1019803690 _358537222 _30611744\n _42063 _187363961 _722521979 _1560198380\n_1990404162 1163531501 76029189 1309151649\n 1804603682 _1444681467 _640364487 _145523070\n _40341101 _51403784 _421815835 _1120210379\n_1502002290 1735328473 530742520 718787259\n 1236535329 _1926607734 _995338651 _343485551\n}}\n\nnorm=: {{\nN=. 16 * 1 + _6 sh 8 + #y\nb=. N#0 [ y=. a.i.y\nfor_i. i. #y do.\n b=. ((j { b) or (8*4|i) sh i{y) (j=. _2 sh i) } b\nend.\nb=. ((j { b) or (8*4|i) sh 128) (j=._2 sh i=.#y) } b\n_16]\\ (8 * #y) (N-2) } b\n}}\n\nmd5=: {{\nX=. norm y\nq=. r=. 1732584193 _271733879 _1732584194 271733878\nfor_k. X do.\n for_j. i.4 do.\n l=. ((j{I){k) ,. (16$j{S) ,. j{T\n for_i. i.16 do.\n r=. _1|.((i{l) (op@.j) r),}.r\n end.\n end.\n q=. r=. r add q\nend.\nhexlist r\n}}\n","language":"J"},{"code":" require '~addons/ide/qt/qt.ijs'\n getmd5=: 'md5'&gethash_jqtide_\n getmd5 'The quick brown fox jumped over the lazy dog''s back'\ne38ca1d920c4b8b8d3946b2c72f01680\n","language":"J"},{"code":"import java.nio.charset.StandardCharsets;\nimport java.security.MessageDigest;\nimport java.security.NoSuchAlgorithmException;\n\npublic class Digester {\n\n public static void main(String[] args) {\n System.out.println(hexDigest(\"Rosetta code\", \"MD5\"));\n }\n\n static String hexDigest(String str, String digestName) {\n try {\n MessageDigest md = MessageDigest.getInstance(digestName);\n byte[] digest = md.digest(str.getBytes(StandardCharsets.UTF_8));\n char[] hex = new char[digest.length * 2];\n for (int i = 0; i < digest.length; i++) {\n hex[2 * i] = \"0123456789abcdef\".charAt((digest[i] & 0xf0) >> 4);\n hex[2 * i + 1] = \"0123456789abcdef\".charAt(digest[i] & 0x0f);\n }\n return new String(hex);\n } catch (NoSuchAlgorithmException e) {\n throw new IllegalStateException(e);\n }\n }\n}\n","language":"Java"},{"code":"/* MD5 hash in Jsish */\nvar str = 'Rosetta code';\nputs(Util.hash(str, {type:'md5'}));\n\n/* MD5 RFC1321 test suite */\nfunction MD5(str) { return Util.hash(str, {type:'md5'}); }\n\n;MD5('');\n;MD5('a');\n;MD5('abc');\n;MD5('message digest');\n;MD5('abcdefghijklmnopqrstuvwxyz');\n;MD5('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789');\n;MD5('12345678901234567890123456789012345678901234567890123456789012345678901234567890');\n\n/*\n=!EXPECTSTART!=\nbf0ac9c7e94e9d50c18f4ff592643546\nMD5('') ==> d41d8cd98f00b204e9800998ecf8427e\nMD5('a') ==> 0cc175b9c0f1b6a831c399e269772661\nMD5('abc') ==> 900150983cd24fb0d6963f7d28e17f72\nMD5('message digest') ==> f96b697d7cb7938d525a2f31aaf161d0\nMD5('abcdefghijklmnopqrstuvwxyz') ==> c3fcd3d76192e4007dfb496cca67e13b\nMD5('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789') ==> d174ab98d277d9f5a5611c2c9f419d9f\nMD5('12345678901234567890123456789012345678901234567890123456789012345678901234567890') ==> 57edf4a22be3c955ac49da2e2107b67a\n=!EXPECTEND!=\n*/\n","language":"Jsish"},{"code":"using Nettle\n\nfunction Base.trunc(s::AbstractString, n::Integer)\n n > 0 || throw(DomainError())\n l = length(s)\n l > n || return s\n n > 3 || return s[1:n]\n return s[1:n-3] * \"...\"\nend\n\ntests = [\"\" => \"d41d8cd98f00b204e9800998ecf8427e\",\n \"a\" => \"0cc175b9c0f1b6a831c399e269772661\",\n \"abc\" => \"900150983cd24fb0d6963f7d28e17f72\",\n \"message digest\" => \"f96b697d7cb7938d525a2f31aaf161d0\",\n \"abcdefghijklmnopqrstuvwxyz\" => \"c3fcd3d76192e4007dfb496cca67e13b\",\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\" =>\n \"d174ab98d277d9f5a5611c2c9f419d9f\",\n \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\" =>\n \"57edf4a22be3c955ac49da2e2107b67a\",\n \"foobad\" => \"3858f62230ac3c915f300c664312c63f\"]\n\nprintln(\"Testing Julia's MD5 hash against RFC 1321.\")\nfor (k, h) in sort(tests, by = length ∘ first)\n md5sum = hexdigest(\"md5\", k)\n @printf(\"%20s → %s \", trunc(k, 15), md5sum)\n if md5sum == h\n println(\"MD5 OK\")\n else\n println(\"MD5 Bad\")\n println(\"* The sum should be \", h)\n end\nend\n","language":"Julia"},{"code":"// version 1.0.6\n\nimport java.security.MessageDigest\n\nfun main(args: Array<String>) {\n val text = \"The quick brown fox jumped over the lazy dog's back\"\n val bytes = text.toByteArray()\n val md = MessageDigest.getInstance(\"MD5\")\n val digest = md.digest(bytes)\n for (byte in digest) print(\"%02x\".format(byte))\n println()\n}\n","language":"Kotlin"},{"code":"Encrypt_MD5('Welcome all Rhinos!')\n//80ba88ee2600e9e9b36e739458c39ebd\n","language":"Lasso"},{"code":"local(test = map(\n\t\t'a' = '0cc175b9c0f1b6a831c399e269772661',\n\t\t'abc' = '900150983cd24fb0d6963f7d28e17f72',\n\t\t'message digest' = 'f96b697d7cb7938d525a2f31aaf161d0',\n\t\t'abcdefghijklmnopqrstuvwxyz' = 'c3fcd3d76192e4007dfb496cca67e13b',\n\t\t'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789' = 'd174ab98d277d9f5a5611c2c9f419d9f',\n\t\t'12345678901234567890123456789012345678901234567890123456789012345678901234567890' = '57edf4a22be3c955ac49da2e2107b67a'\n\t)\n)\nwith a in #test->keys do => {^\n\t'testing: \"'+#a+'\": '+(Encrypt_MD5(#a)->asBytes == #test->find(#a)->asBytes)+'\\r'\n^}\n","language":"Lasso"},{"code":"'[RC]MD5\n 'from tsh73's January 2008 code\n\n text$=\"The quick brown fox jumps over the lazy dog\"\n checkSum$=\"9e107d9d372bb6826bd81d3542a419d6\"\n\n print text$\n print checkSum$\n\n test$=md5$(text$)\n\n if test$=checkSum$ then\n print \"passed\"\n print test$\n else\n print \"failed\"\n end if\n end\n\n function md5$(text$)\n\n dim r(64)\n dim k(64)\n dim w(16)\n global two32\n two32=2^32\n\n 'prepare the MD5 checksum table\n restore [perRoundShiftAmounts]\n for i=0 to 63\n read x\n r(i)=x\n next\n\n 'prepare constants\n for i=0 to 63\n k(i) = int(abs(sin(i+1)) * two32)\n next\n\n 'initialise variables\n h0 = HEXDEC(\"67452301\")\n h1 = HEXDEC(\"EFCDAB89\")\n h2 = HEXDEC(\"98BADCFE\")\n h3 = HEXDEC(\"10325476\")\n\n 'find num bits in message\n numbits=len(text$)*8\n\n 'add bits \"10000000\"\n text$=text$+chr$(128)\n\n 'add bits \"00000000\"\n while len(text$) mod 64 <> 56\n text$=text$+chr$(0)\n wend\n\n 'add original length in bits\n text$=text$+dec2asc$(numbits)\n\n 'MD5 rounds\n 'process in 64 byte chunks 512bits\n for chunk = 1 to len(text$) step 64\n chunk$ = mid$(text$, chunk, 64)\n for word = 0 TO 15\n 'invert byte order\n b0 = asc(mid$(chunk$, word*4+1, 1))\n b1 = asc(mid$(chunk$, word*4+2, 1))\n b2 = asc(mid$(chunk$, word*4+3, 1))\n b3 = asc(mid$(chunk$, word*4+4, 1))\n w(word) = ((b3*256+b2)*256+b1)*256+b0\n next word\n a = h0\n b = h1\n c = h2\n d = h3\n for i = 0 to 63\n select case\n case 0 <= i and i <= 15\n f = (b and c) or (bitNot(b) and d)\n g = i\n case 16 <= i and i <= 31\n f = (d and b) or (bitNot(d) and c)\n g = (5 * i + 1) mod 16\n case 32 <= i and i <= 47\n f = b xor c xor d\n g = (3 * i + 5) mod 16\n case 48 <= i and i <= 63\n f = c xor (b or bitNot(d))\n g = (7 * i) mod 16\n end select\n temp = d\n d = c\n c = b\n b=b+leftrotate(a + f + k(i) + w(g),r(i))\n b = b mod two32\n a = temp\n next i\n h0 = (h0 + a) mod two32\n h1 = (h1 + b) mod two32\n h2 = (h2 + c) mod two32\n h3 = (h3 + d) mod two32\n next chunk\n\n md5$ = revOrd$(DECHEX$(h0))+_\n revOrd$(DECHEX$(h1))+_\n revOrd$(DECHEX$(h2))+_\n revOrd$(DECHEX$(h3))\n\n [perRoundShiftAmounts]\n DATA 7,12,17,22, 7,12,17,22, 7,12,17,22, 7,12,17,22\n DATA 5, 9,14,20, 5, 9,14,20, 5, 9,14,20, 5, 9,14,20\n DATA 4,11,16,23, 4,11,16,23, 4,11,16,23, 4,11,16,23\n DATA 6,10,15,21, 6,10,15,21, 6,10,15,21, 6,10,15,21\n\n end function\n\n\n ' dec2asc: dec to 8 byte asc\n function dec2asc$(n)\n h$ = \"\"\n for i = 1 to 8\n h$ = h$ + chr$(n mod 256)\n n = int(n/256)\n next\n dec2asc$= h$\n end function\n\n ' bitNot\n function bitNot(num)\n bitNot = two32 -1 -num\n end function\n\n ' leftrotate: spins bits left n times\n function leftrotate(num,times)\n num=num mod two32\n r = (num*2^times) mod two32\n l = int(num/(2^(32-times)))\n leftrotate = r+l\n end function\n\n ' reverse the HEXDEC$ order\n function revOrd$(a$)\n a$=left$(\"00000000\", 8-len(a$))+a$\n revOrd$ = lower$(mid$(a$,7,2)+mid$(a$,5,2)+mid$(a$,3,2)+mid$(a$,1,2))\n end function\n","language":"Liberty-BASIC"},{"code":"put cx_md5_string(str)\n","language":"Lingo"},{"code":"----------------------------------------\n-- Calculates MD5 hash of string or bytearray\n-- @param {bytearray|string} input\n-- @return {bytearray} (16 bytes)\n----------------------------------------\non md5 (input)\n if stringP(input) then input = bytearray(input)\n\n -- Convert string to list of little-endian words...\n t_iLen = input.length * 8\n t_iCnt = (t_iLen + 64) / 512 * 16 + 16\n\n -- Create list, fill with zeros...\n x = []\n x[t_iCnt] = 0\n\n t_fArr = [1, 256, 65536, 16777216]\n i = 0\n j = 0\n repeat while i < t_iLen\n j = j + 1\n t_iNext = i / 32 + 1\n t_iTemp = bitAnd(input[i/8+1], 255) * t_fArr[j]\n x[t_iNext] = bitOr(x[t_iNext], t_iTemp)\n i = i + 8\n j = j mod 4\n end repeat\n\n -- Append padding...\n t_iNext = t_iLen / 32 + 1\n x[t_iNext] = bitOr(x[t_iNext], 128 * t_fArr[j + 1])\n x[(t_iLen + 64) / 512 * 16 + 15] = t_iLen\n\n -- Actual algorithm starts here...\n a = 1732584193\n b = -271733879\n c = -1732584194\n d = 271733878\n i = 1\n t_iWrap = the maxInteger + 1\n t_iCount = x.count + 1\n\n repeat while i < t_iCount\n olda = a\n oldb = b\n oldc = c\n oldd = d\n\n -- Round(1) --\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i] - 680876936\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\n else a = bitOr(n * 128, n / 33554432) + b\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 1] - 389564586\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\n else d = bitOr(n * 4096, n / 1048576) + a\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 2] + 606105819\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\n else c = bitOr(n * 131072, n / 32768) + d\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 3] - 1044525330\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\n else b = bitOr(n * 4194304, n / 1024) + c\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i + 4] - 176418897\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\n else a = bitOr(n * 128, n / 33554432) + b\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 5] + 1200080426\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\n else d = bitOr(n * 4096, n / 1048576) + a\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 6] - 1473231341\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\n else c = bitOr(n * 131072, n / 32768) + d\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 7] - 45705983\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\n else b = bitOr(n * 4194304, n / 1024) + c\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i + 8] + 1770035416\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\n else a = bitOr(n * 128, n / 33554432) + b\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 9] - 1958414417\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\n else d = bitOr(n * 4096, n / 1048576) + a\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 10] - 42063\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\n else c = bitOr(n * 131072, n / 32768) + d\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 11] - 1990404162\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\n else b = bitOr(n * 4194304, n / 1024) + c\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i + 12] + 1804603682\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\n else a = bitOr(n * 128, n / 33554432) + b\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 13] - 40341101\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\n else d = bitOr(n * 4096, n / 1048576) + a\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 14] - 1502002290\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\n else c = bitOr(n * 131072, n / 32768) + d\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 15] + 1236535329\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\n else b = bitOr(n * 4194304, n / 1024) + c\n\n -- Round(2) --\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 1] - 165796510\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\n else a = bitOr(n * 32, n / 134217728) + b\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 6] - 1069501632\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\n else d = bitOr(n * 512, n / 8388608) + a\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 11] + 643717713\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\n else c = bitOr(n * 16384, n / 262144) + d\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i] - 373897302\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\n else b = bitOr(n * 1048576, n / 4096) + c\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 5] - 701558691\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\n else a = bitOr(n * 32, n / 134217728) + b\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 10] + 38016083\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\n else d = bitOr(n * 512, n / 8388608) + a\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 15] - 660478335\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\n else c = bitOr(n * 16384, n / 262144) + d\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i + 4] - 405537848\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\n else b = bitOr(n * 1048576, n / 4096) + c\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 9] + 568446438\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\n else a = bitOr(n * 32, n / 134217728) + b\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 14] - 1019803690\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\n else d = bitOr(n * 512, n / 8388608) + a\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 3] - 187363961\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\n else c = bitOr(n * 16384, n / 262144) + d\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i + 8] + 1163531501\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\n else b = bitOr(n * 1048576, n / 4096) + c\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 13] - 1444681467\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\n else a = bitOr(n * 32, n / 134217728) + b\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 2] - 51403784\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\n else d = bitOr(n * 512, n / 8388608) + a\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 7] + 1735328473\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\n else c = bitOr(n * 16384, n / 262144) + d\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i + 12] - 1926607734\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\n else b = bitOr(n * 1048576, n / 4096) + c\n\n -- Round(3) --\n n = bitXor(bitXor(b, c), d) + a + x[i + 5] - 378558\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\n else a = bitOr(n * 16, n / 268435456) + b\n n = bitXor(bitXor(a, b), c) + d + x[i + 8] - 2022574463\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\n else d = bitOr(n * 2048, n / 2097152) + a\n n = bitXor(bitXor(d, a), b) + c + x[i + 11] + 1839030562\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\n else c = bitOr(n * 65536, n / 65536) + d\n n = bitXor(bitXor(c, d), a) + b + x[i + 14] - 35309556\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\n else b = bitOr(n * 8388608, n / 512) + c\n n = bitXor(bitXor(b, c), d) + a + x[i + 1] - 1530992060\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\n else a = bitOr(n * 16, n / 268435456) + b\n n = bitXor(bitXor(a, b), c) + d + x[i + 4] + 1272893353\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\n else d = bitOr(n * 2048, n / 2097152) + a\n n = bitXor(bitXor(d, a), b) + c + x[i + 7] - 155497632\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\n else c = bitOr(n * 65536, n / 65536) + d\n n = bitXor(bitXor(c, d), a) + b + x[i + 10] - 1094730640\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\n else b = bitOr(n * 8388608, n / 512) + c\n n = bitXor(bitXor(b, c), d) + a + x[i + 13] + 681279174\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\n else a = bitOr(n * 16, n / 268435456) + b\n n = bitXor(bitXor(a, b), c) + d + x[i] - 358537222\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\n else d = bitOr(n * 2048, n / 2097152) + a\n n = bitXor(bitXor(d, a), b) + c + x[i + 3] - 722521979\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\n else c = bitOr(n * 65536, n / 65536) + d\n n = bitXor(bitXor(c, d), a) + b + x[i + 6] + 76029189\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\n else b = bitOr(n * 8388608, n / 512) + c\n n = bitXor(bitXor(b, c), d) + a + x[i + 9] - 640364487\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\n else a = bitOr(n * 16, n / 268435456) + b\n n = bitXor(bitXor(a, b), c) + d + x[i + 12] - 421815835\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\n else d = bitOr(n * 2048, n / 2097152) + a\n n = bitXor(bitXor(d, a), b) + c + x[i + 15] + 530742520\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\n else c = bitOr(n * 65536, n / 65536) + d\n n = bitXor(bitXor(c, d), a) + b + x[i + 2] - 995338651\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\n else b = bitOr(n * 8388608, n / 512) + c\n\n -- Round(4) --\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i] - 198630844\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\n else a = bitOr(n * 64, n / 67108864) + b\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 7] + 1126891415\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\n else d = bitOr(n * 1024, n / 4194304) + a\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 14] - 1416354905\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\n else c = bitOr(n * 32768, n / 131072) + d\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 5] - 57434055\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\n else b = bitOr(n * 2097152, n / 2048) + c\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i + 12] + 1700485571\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\n else a = bitOr(n * 64, n / 67108864) + b\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 3] - 1894986606\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\n else d = bitOr(n * 1024, n / 4194304) + a\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 10] - 1051523\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\n else c = bitOr(n * 32768, n / 131072) + d\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 1] - 2054922799\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\n else b = bitOr(n * 2097152, n / 2048) + c\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i + 8] + 1873313359\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\n else a = bitOr(n * 64, n / 67108864) + b\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 15] - 30611744\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\n else d = bitOr(n * 1024, n / 4194304) + a\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 6] - 1560198380\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\n else c = bitOr(n * 32768, n / 131072) + d\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 13] + 1309151649\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\n else b = bitOr(n * 2097152, n / 2048) + c\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i + 4] - 145523070\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\n else a = bitOr(n * 64, n / 67108864) + b\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 11] - 1120210379\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\n else d = bitOr(n * 1024, n / 4194304) + a\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 2] + 718787259\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\n else c = bitOr(n * 32768, n / 131072) + d\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 9] - 343485551\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\n else b = bitOr(n * 2097152, n / 2048) + c\n a = a + olda\n b = b + oldb\n c = c + oldc\n d = d + oldd\n i = i + 16\n end repeat\n\n t_iArr = [a, b, c, d]\n ba = bytearray()\n p = 1\n repeat with i in t_iArr\n if(i > 0) then\n repeat with n = 1 to 4\n ba[p] = (i mod 256)\n i = i / 256\n p = p+1\n end repeat\n else\n i = bitNot(i)\n repeat with n = 1 to 4\n ba[p] = 255-(i mod 256)\n i = i / 256\n p = p+1\n end repeat\n end if\n end repeat\n ba.position = 1\n return ba\nend\n","language":"Lingo"},{"code":"function md5sum hashtext\n local md5, mdhex\n put md5Digest(hashtext) into md5\n get binaryDecode(\"H*\",md5,mdhex)\n return mdhex\nend md5sum\n","language":"LiveCode"},{"code":"command md5testsuite\n // rfc1321 MD5 test suite:\n local md5\n put md5sum(\"\") is \"d41d8cd98f00b204e9800998ecf8427e\" into md5[\"empty\"]\n put md5sum(\"a\") is \"0cc175b9c0f1b6a831c399e269772661\" into md5[\"a\"]\n put md5sum(\"abc\") is \"900150983cd24fb0d6963f7d28e17f72\" into md5[\"abc\"]\n put md5sum(\"message digest\") is \"f96b697d7cb7938d525a2f31aaf161d0\" into md5[\"message digest\"]\n put md5sum(\"abcdefghijklmnopqrstuvwxyz\") is \"c3fcd3d76192e4007dfb496cca67e13b\" \\\n into md5[\"abclower\"]\n put md5sum(\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\") \\\n is \"d174ab98d277d9f5a5611c2c9f419d9f\" into md5[\"abcupper\"]\n put md5sum(\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\")\\\n is \"57edf4a22be3c955ac49da2e2107b67a\" into md5[\"123\"]\n\n repeat for each line n in the keys of md5\n if md5[n] is not true then\n put \"err\" & tab & n & return after results\n exit repeat\n else\n put \"ok\" & tab & n & return after results\n end if\n end repeat\n put results\nend md5testsuite\n","language":"LiveCode"},{"code":"require \"md5\"\n\n--printing a sum:\nprint(md5.sumhexa\"The quick brown fox jumps over the lazy dog\")\n\n--running the test suite:\n\nlocal function test(msg,sum) assert(md5.sumhexa(msg)==sum) end\n\ntest(\"\",\"d41d8cd98f00b204e9800998ecf8427e\")\ntest(\"a\",\"0cc175b9c0f1b6a831c399e269772661\")\ntest(\"abc\",\"900150983cd24fb0d6963f7d28e17f72\")\ntest(\"message digest\",\"f96b697d7cb7938d525a2f31aaf161d0\")\ntest(\"abcdefghijklmnopqrstuvwxyz\",\"c3fcd3d76192e4007dfb496cca67e13b\")\ntest(\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\",\"d174ab98d277d9f5a5611c2c9f419d9f\")\ntest(\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\",\"57edf4a22be3c955ac49da2e2107b67a\")\n","language":"Lua"},{"code":"> with( StringTools ):\n> Hash( \"\" );\n \"d41d8cd98f00b204e9800998ecf8427e\"\n\n> Hash( \"a\" );\n \"0cc175b9c0f1b6a831c399e269772661\"\n\n> Hash( \"abc\" );\n \"900150983cd24fb0d6963f7d28e17f72\"\n\n> Hash( \"message digest\" );\n \"f96b697d7cb7938d525a2f31aaf161d0\"\n\n> Hash( \"abcdefghijklmnopqrstuvwxyz\" );\n \"c3fcd3d76192e4007dfb496cca67e13b\"\n\n> Hash( \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\" );\n \"d174ab98d277d9f5a5611c2c9f419d9f\"\n\n> Hash( \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\" );\n \"57edf4a22be3c955ac49da2e2107b67a\"\n","language":"Maple"},{"code":" Hash[\"The quick brown fox jumped over the lazy dog's back\",\"MD5\",\"HexString\"]\n","language":"Mathematica"},{"code":" e38ca1d920c4b8b8d3946b2c72f01680\n","language":"Mathematica"},{"code":"function digest = md5(message)\n % digest = md5(message)\n % Compute the MD5 digest of the message, as a hexadecimal digest.\n\n % Follow the MD5 algorithm from RFC 1321 [1] and Wikipedia [2].\n % [1] http://tools.ietf.org/html/rfc1321\n % [2] http://en.wikipedia.org/wiki/MD5\n\n % m is the modulus for 32-bit unsigned arithmetic.\n m = 2 ^ 32;\n\n % s is the shift table for circshift(). Each shift is negative\n % because it is a left shift.\n s = [-7, -12, -17, -22\n -5, -9, -14, -20\n -4, -11, -16, -23\n -6, -10, -15, -21];\n\n % t is the sine table. Each sine is a 32-bit integer, unsigned.\n t = floor(abs(sin(1:64)) .* m);\n\n % Initialize the hash, as a row vector of 32-bit integers.\n digest = [hex2dec('67452301') ...\n hex2dec('EFCDAB89') ...\n hex2dec('98BADCFE') ...\n hex2dec('10325476')];\n\n % If message contains characters, convert them to ASCII values.\n message = double(message);\n bytelen = numel(message);\n\n % Pad the message by appending a 1, then appending enough 0s to make\n % the bit length congruent to 448 mod 512. Because we have bytes, we\n % append 128 '10000000', then append enough 0s '00000000's to make\n % the byte length congruent to 56 mod 64.\n message = [message, 128, zeros(1, mod(55 - bytelen, 64))];\n\n % Convert the message to 32-bit integers, little endian.\n % For little endian, first byte is least significant byte.\n message = reshape(message, 4, numel(message) / 4);\n message = message(1,:) + ... % least significant byte\n message(2,:) * 256 + ...\n message(3,:) * 65536 + ...\n message(4,:) * 16777216; % most significant byte\n\n % Append the bit length as a 64-bit integer, little endian.\n bitlen = bytelen * 8;\n message = [message, mod(bitlen, m), mod(bitlen / m, m)];\n\n % Process each 512-bit block. Because we have 32-bit integers, each\n % block has 16 elements, message(k + (0:15)).\n for k = 1:16:numel(message)\n % Copy hash.\n a = digest(1); b = digest(2); c = digest(3); d = digest(4);\n\n % Do 64 operations.\n for i = (1:64)\n % Convert b, c, d to row vectors of bits (0s and 1s).\n bv = dec2bin(b, 32) - '0';\n cv = dec2bin(c, 32) - '0';\n dv = dec2bin(d, 32) - '0';\n\n % Find f = mix of b, c, d.\n % ki = index in 0:15, to message(k + ki).\n % sr = row in 1:4, to s(sr, :).\n if i <= 16 % Round 1\n f = (bv & cv) | (~bv & dv);\n ki = i - 1;\n sr = 1;\n elseif i <= 32 % Round 2\n f = (bv & dv) | (cv & ~dv);\n ki = mod(5 * i - 4, 16);\n sr = 2;\n elseif i <= 48 % Round 3\n f = xor(bv, xor(cv, dv));\n ki = mod(3 * i + 2, 16);\n sr = 3;\n else % Round 4\n f = xor(cv, bv | ~dv);\n ki = mod(7 * i - 7, 16);\n sr = 4;\n end\n\n % Convert f, from row vector of bits, to 32-bit integer.\n f = bin2dec(char(f + '0'));\n\n % Do circular shift of sum.\n sc = mod(i - 1, 4) + 1;\n sum = mod(a + f + message(k + ki) + t(i), m);\n sum = dec2bin(sum, 32);\n sum = circshift(sum, [0, s(sr, sc)]);\n sum = bin2dec(sum);\n\n % Update a, b, c, d.\n temp = d;\n d = c;\n c = b;\n b = mod(b + sum, m);\n a = temp;\n end %for i\n\n % Add hash of this block to hash of previous blocks.\n digest = mod(digest + [a, b, c, d], m);\n end %for k\n\n % Convert hash from 32-bit integers, little endian, to bytes.\n digest = [digest % least significant byte\n digest / 256\n digest / 65536\n digest / 16777216]; % most significant byte\n digest = reshape(mod(floor(digest), 256), 1, numel(digest));\n\n % Convert hash to hexadecimal.\n digest = dec2hex(digest);\n digest = reshape(transpose(digest), 1, numel(digest));\nend %md5\n","language":"MATLAB"},{"code":"octave:14> md5('Rosetta Code')\nans = CCA1BF66B09554E10F837838C3D3EFB1\n","language":"MATLAB"},{"code":"\"The quick brown fox jumps over the lazy dog\" md5 puts!\n","language":"Min"},{"code":"string = \"The quick brown fox jumped over the lazy dog's back\";\nplayer:tell(string_hash(string));\n","language":"MOO"},{"code":"/**\n MD5 in Neko\n Tectonics:\n nekoc md5.neko\n neko md5\n*/\n\nvar MD5 = $loader.loadprim(\"std@make_md5\", 1);\nvar base_encode = $loader.loadprim(\"std@base_encode\", 2);\n\nvar result = MD5(\"The quick brown fox jumps over the lazy dog\");\n\n/* Output in lowercase hex */\n$print(base_encode(result, \"0123456789abcdef\"));\n","language":"Neko"},{"code":"using System;\nusing System.Console;\nusing System.Text;\nusing System.Security.Cryptography;\nusing Nemerle.Collections;\nusing Nemerle.Collections.NCollectionsExtensions;\n\nmodule Md5\n{\n HashMD5(input : string) : string\n {\n BitConverter.ToString\n (MD5.Create().ComputeHash(Encoding.Default.GetBytes(input))).Replace(\"-\", \"\").ToLower()\n }\n\n IsValidMD5(text : string, hash : string) : bool\n {\n HashMD5(text) == hash.ToLower()\n }\n\n Main() : void\n {\n def examples = [\"The quick brown fox jumped over the lazy dog's back\", \"\", \"a\", \"abc\", \"message digest\",\n \"abcdefghijklmnopqrstuvwxyz\", \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\",\n \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"];\n def hashes = [\"e38ca1d920c4b8b8d3946b2c72f01680\", \"d41d8cd98f00b204e9800998ecf8427e\",\n \"0cc175b9c0f1b6a831c399e269772661\", \"900150983cd24fb0d6963f7d28e17f72\",\n \"f96b697d7cb7938d525a2f31aaf161d0\", \"c3fcd3d76192e4007dfb496cca67e13b\",\n \"d174ab98d277d9f5a5611c2c9f419d9f\", \"57edf4a22be3c955ac49da2e2107b67a\"];\n def tests = Hashtable(ZipLazy(examples, hashes));\n foreach (test in tests)\n Write($\"$(IsValidMD5(test.Key, test.Value)) \");\n }\n}\n","language":"Nemerle"},{"code":"/* NetRexx */\n\noptions replace format comments java crossref savelog symbols binary\n\nimport java.security.MessageDigest\n\nMD5('The quick brown fox jumps over the lazy dog', '9e107d9d372bb6826bd81d3542a419d6')\n-- RFC 1321 MD5 test suite:\nMD5(\"\", 'd41d8cd98f00b204e9800998ecf8427e')\nMD5(\"a\", '0cc175b9c0f1b6a831c399e269772661')\nMD5(\"abc\", '900150983cd24fb0d6963f7d28e17f72')\nMD5(\"message digest\", 'f96b697d7cb7938d525a2f31aaf161d0')\nMD5(\"abcdefghijklmnopqrstuvwxyz\", 'c3fcd3d76192e4007dfb496cca67e13b')\nMD5(\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\", 'd174ab98d277d9f5a5611c2c9f419d9f')\nMD5(\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\", '57edf4a22be3c955ac49da2e2107b67a')\n\nreturn\n\n-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\nmethod MD5(messageText, verifyCheck) public static\n\n algorithm = 'MD5'\n digestSum = getDigest(messageText, algorithm)\n\n say '<Message>'messageText'</Message>'\n say Rexx('<'algorithm'>').right(12) || digestSum'</'algorithm'>'\n say Rexx('<Verify>').right(12) || verifyCheck'</Verify>'\n if digestSum == verifyCheck then say algorithm 'Confirmed'\n else say algorithm 'Failed'\n\n return\n\n-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\nmethod getDigest(messageText = Rexx, algorithm = Rexx 'MD5', encoding = Rexx 'UTF-8', lowercase = boolean 1) public static returns Rexx\n\n algorithm = algorithm.upper\n encoding = encoding.upper\n\n message = String(messageText)\n messageBytes = byte[]\n digestBytes = byte[]\n digestSum = Rexx ''\n\n do\n messageBytes = message.getBytes(encoding)\n md = MessageDigest.getInstance(algorithm)\n md.update(messageBytes)\n digestBytes = md.digest\n\n loop b_ = 0 to digestBytes.length - 1\n bb = Rexx(digestBytes[b_]).d2x(2)\n if lowercase then digestSum = digestSum || bb.lower\n else digestSum = digestSum || bb.upper\n end b_\n catch ex = Exception\n ex.printStackTrace\n end\n\n return digestSum\n","language":"NetRexx"},{"code":";; using the crypto module from http://www.newlisp.org/code/modules/crypto.lsp.html\n;; (import native functions from the crypto library, provided by OpenSSL)\n(module \"crypto.lsp\")\n(crypto:md5 \"The quick brown fox jumped over the lazy dog's back\")\n","language":"NewLISP"},{"code":"import md5\n\necho toMD5(\"The quick brown fox jumped over the lazy dog's back\")\n","language":"Nim"},{"code":"MODULE MD5;\nIMPORT\n Crypto:MD5,\n Crypto:Utils,\n Strings,\n Out;\nVAR\n h: MD5.Hash;\n str: ARRAY 128 OF CHAR;\nBEGIN\n h := MD5.NewHash();\n h.Initialize;\n str := \"The quick brown fox jumped over the lazy dog's back\";\n h.Update(str,0,Strings.Length(str));\n h.GetHash(str,0);\n Out.String(\"MD5: \");Utils.PrintHex(str,0,h.size);Out.Ln\nEND MD5.\n","language":"Oberon"},{"code":"class MD5 {\n function : Main(args : String[]) ~ Nil {\n in := \"The quick brown fox jumped over the lazy dog's back\"->ToByteArray();\n hash := Encryption.Hash->MD5(in);\n hash->ToHexString()->PrintLine();\n }\n}\n","language":"Objeck"},{"code":"NSString *myString = @\"The quick brown fox jumped over the lazy dog's back\";\nNSData *digest = [[myString dataUsingEncoding:NSUTF8StringEncoding] md5Digest]; // or another encoding of your choosing\nNSLog(@\"%@\", [digest hexadecimalRepresentation]);\n","language":"Objective-C"},{"code":"#import <CommonCrypto/CommonDigest.h>\n\nNSString *myString = @\"The quick brown fox jumped over the lazy dog's back\";\nNSData *data = [myString dataUsingEncoding:NSUTF8StringEncoding]; // or another encoding of your choosing\nunsigned char digest[CC_MD5_DIGEST_LENGTH];\nif (CC_MD5([data bytes], [data length], digest)) {\n NSMutableString *hex = [NSMutableString string];\n for (int i = 0; i < CC_MD5_DIGEST_LENGTH; i++) {\n [hex appendFormat: @\"%02x\", (int)(digest[i])];\n }\n NSLog(@\"%@\", hex);\n}\n","language":"Objective-C"},{"code":"#include <openssl/md5.h>\n\nNSString *myString = @\"The quick brown fox jumped over the lazy dog's back\";\nNSData *data = [myString dataUsingEncoding:NSUTF8StringEncoding]; // or another encoding of your choosing\nunsigned char digest[MD5_DIGEST_LENGTH];\nif (MD5([data bytes], [data length], digest)) {\n NSMutableString *hex = [NSMutableString string];\n for (int i = 0; i < MD5_DIGEST_LENGTH; i++) {\n [hex appendFormat: @\"%02x\", (int)(digest[i])];\n }\n NSLog(@\"%@\", hex);\n}\n","language":"Objective-C"},{"code":"# Digest.to_hex(Digest.string \"The quick brown fox jumped over the lazy dog's back\") ;;\n- : string = \"e38ca1d920c4b8b8d3946b2c72f01680\"\n","language":"OCaml"},{"code":"s = \"The quick brown fox jumped over the lazy dog's back\";\nhash = md5sum(s, true);\ndisp(hash)\n","language":"Octave"},{"code":"(import (otus ffi))\n(define libcrypto (load-dynamic-library \"libcrypto.so.1.0.0\"))\n(define MD5 (libcrypto type-vptr \"MD5\" type-string fft-unsigned-long type-string))\n","language":"Ol"},{"code":"(define (test str)\n (define md5 \"----------------\")\n (MD5 str (string-length str) md5)\n (for-each display (list \"\\\"\" str \"\\\": \"))\n (for-each (lambda (c)\n (define hex \"0123456789abcdef\")\n (display (string (ref hex (>> c 4))))\n (display (string (ref hex (band c #x0F)))))\n (string->list md5))\n (print))\n\n(test \"\")\n(test \"a\")\n(test \"abc\")\n(test \"message digest\")\n(test \"abcdefghijklmnopqrstuvwxyz\")\n(test \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\")\n(test \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\")\n","language":"Ol"},{"code":"MESSAGE\n 1 STRING( HEX-ENCODE( MD5-DIGEST( \"\" ) ) ) SKIP\n 2 STRING( HEX-ENCODE( MD5-DIGEST( \"a\" ) ) ) SKIP\n 3 STRING( HEX-ENCODE( MD5-DIGEST( \"abc\" ) ) ) SKIP\n 4 STRING( HEX-ENCODE( MD5-DIGEST( \"message digest\" ) ) ) SKIP\n 5 STRING( HEX-ENCODE( MD5-DIGEST( \"abcdefghijklmnopqrstuvwxyz\" ) ) ) SKIP\n 6 STRING( HEX-ENCODE( MD5-DIGEST( \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\" ) ) ) SKIP\n 7 STRING( HEX-ENCODE( MD5-DIGEST( \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\" ) ) )\nVIEW-AS ALERT-BOX\n","language":"OpenEdge-Progress"},{"code":"#include <pari/pari.h>\n#include <openssl/md5.h>\n\n#define HEX(x) (((x) < 10)? (x)+'0': (x)-10+'a')\n\n/*\n * PARI/GP func: MD5 hash\n *\n * gp code: install(\"plug_md5\", \"s\", \"MD5\", \"<library path>\");\n */\nGEN plug_md5(char *text)\n{\n char md[MD5_DIGEST_LENGTH];\n char hash[sizeof(md) * 2 + 1];\n int i;\n\n MD5((unsigned char*)text, strlen(text), (unsigned char*)md);\n\n for (i = 0; i < sizeof(md); i++) {\n hash[i+i] = HEX((md[i] >> 4) & 0x0f);\n hash[i+i+1] = HEX(md[i] & 0x0f);\n }\n\n hash[sizeof(md) * 2] = 0;\n\n return strtoGENstr(hash);\n}\n","language":"PARI-GP"},{"code":"install(\"plug_md5\", \"s\", \"MD5\", \"~/libmd5.so\");\n\nMD5(\"The quick brown fox jumped over the lazy dog's back\")\n","language":"PARI-GP"},{"code":"md5( message ) = { my(\n a = 0x67452301, b = 0xefcdab89, c = 0x98badcfe, d = 0x10325476,\n s = [ 7, 12, 17, 22; 5, 9, 14, 20; 4, 11, 16, 23; 6, 10, 15, 21 ],\n msg = concat( Vec( concat(Vecsmall(message), Vecsmall(128)), (#message + 9) \\ 64 * 64 + 56 ),\n Vecrev(digits( #message % 2^61 * 8, 256), 8)), \\\\ little endian !\n leftrotate(x, c) = x << c + x >> (32-c)\n );\n \\\\*** Process the message in successive 512-bit chunks ***\n forstep( m=1, #msg, 512/8,\n my( \\\\ break chunk into 32-bit words M[j] - LITTLE ENDIAN !\n M = vector( 16, j, fromdigits( Vecrev(msg[ m + j*4 - 4 .. m + j*4 - 1 ]), 2^8 )),\n A = a, B = b, C = c, D = d);\n for( i = 0 , 63 , [A, D, C, B] = [D, C, B, B + leftrotate( ( A + abs(sin(i+1))\\2^-32 +\n if( i < 16 , bitor( bitand(B , C) , bitand( bitneg(B) , D)) + M[ i +1]\n , i < 32 , bitor( bitand(D , B) , bitand( bitneg(D) , C)) + M[ (5*i + 1) % 16 +1]\n , i < 48 , bitxor( bitxor( B , C ) , D ) + M[ (3*i + 5) % 16 +1]\n , bitxor( C , bitor( bitneg(D), B)) + M[ 7*i % 16 +1]\n )) % 2^32, s[i\\16+1, i%4+1] )]\n ); \\\\ end for\n [a,b,c,d] = ([a,b,c,d] + [A,B,C,D]) % 2^32 ;\n ); \\\\ end forstep\n Strprintf(\"%032x\",fromdigits(Vecrev(digits(fromdigits([d,c,b,a],2^32),256),16),256))\n}\n","language":"PARI-GP"},{"code":"gp > md5(\"\")\n","language":"PARI-GP"},{"code":"gp > md5(\"The quick brown fox jumps over lazy dogs.\")\n","language":"PARI-GP"},{"code":"program GetMd5;\n\nuses md5;\n\nvar\n strEncrypted : string;\n\nbegin\n strEncrypted := md5Print(md5String('The quick brown fox jumped over the lazy dog''s back'));\n writeln(strEncrypted);\nend.\n","language":"PARI-GP"},{"code":"use Digest::MD5 qw(md5_hex);\n\nprint md5_hex(\"The quick brown fox jumped over the lazy dog's back\"), \"\\n\";\n","language":"Perl"},{"code":"use Digest::MD5;\n\n$md5 = Digest::MD5->new;\n$md5->add(\"The quick brown fox jumped over the lazy dog's back\");\nprint $md5->hexdigest, \"\\n\";\n","language":"Perl"},{"code":"$string = \"The quick brown fox jumped over the lazy dog's back\";\necho md5( $string );\n","language":"PHP"},{"code":"(let Str \"The quick brown fox jumped over the lazy dog's back\"\n (pack\n (mapcar '((B) (pad 2 (hex B)))\n (native \"libcrypto.so\" \"MD5\" '(B . 16) Str (length Str) '(NIL (16))) ) ) )\n","language":"PicoLisp"},{"code":"import String;\nimport Crypto.MD5;\n\nint main(){\n write( string2hex( hash( \"The quick brown fox jumped over the lazy dog's back\" ) ) + \"\\n\" );\n}\n","language":"Pike"},{"code":"$string = \"The quick brown fox jumped over the lazy dog's back\"\n$data = [Text.Encoding]::UTF8.GetBytes($string)\n$hash = [Security.Cryptography.MD5]::Create().ComputeHash($data)\n([BitConverter]::ToString($hash) -replace '-').ToLower()\n","language":"PowerShell"},{"code":"UseMD5Fingerprint() ; register the MD5 fingerprint plugin\n\ntest$ = \"The quick brown fox jumped over the lazy dog's back\"\n\n; Call StringFingerprint() function and display MD5 result in Debug window\nDebug StringFingerprint(test$, #PB_Cipher_MD5)\n","language":"PureBasic"},{"code":">>> import hashlib\n>>> # RFC 1321 test suite:\n>>> tests = (\n (b\"\", 'd41d8cd98f00b204e9800998ecf8427e'),\n (b\"a\", '0cc175b9c0f1b6a831c399e269772661'),\n (b\"abc\", '900150983cd24fb0d6963f7d28e17f72'),\n (b\"message digest\", 'f96b697d7cb7938d525a2f31aaf161d0'),\n (b\"abcdefghijklmnopqrstuvwxyz\", 'c3fcd3d76192e4007dfb496cca67e13b'),\n (b\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\", 'd174ab98d277d9f5a5611c2c9f419d9f'),\n (b\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\", '57edf4a22be3c955ac49da2e2107b67a') )\n>>> for text, golden in tests: assert hashlib.md5(text).hexdigest() == golden\n\n>>>\n","language":"Python"},{"code":">>> import hashlib\n>>> print hashlib.md5(\"The quick brown fox jumped over the lazy dog's back\").hexdigest()\ne38ca1d920c4b8b8d3946b2c72f01680\n","language":"Python"},{"code":">>> import md5\n>>> print md5.md5(\"The quick brown fox jumped over the lazy dog's back\").hexdigest()\ne38ca1d920c4b8b8d3946b2c72f01680\n","language":"Python"},{"code":"library(digest)\nhexdigest <- digest(\"The quick brown fox jumped over the lazy dog's back\",\n algo=\"md5\", serialize=FALSE)\n","language":"R"},{"code":"#lang racket\n(require file/md5)\n\n(md5 \"\")\n(md5 \"a\")\n(md5 \"abc\")\n(md5 \"message digest\")\n(md5 \"abcdefghijklmnopqrstuvwxyz\")\n(md5 \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\")\n(md5 \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\")\n","language":"Racket"},{"code":"use Digest::MD5;\nsay Digest::MD5.md5_hex: \"The quick brown fox jumped over the lazy dog's back\";\n","language":"Raku"},{"code":">> checksum/method \"The quick brown fox jumped over the lazy dog\" 'md5\n== #{08A008A01D498C404B0C30852B39D3B8}\n","language":"REBOL"},{"code":"/*REXX program tests the MD5 procedure (below) as per a test suite the IETF RFC (1321).*/\nmsg.1 = /*─────MD5 test suite [from above doc].*/\nmsg.2 = 'a'\nmsg.3 = 'abc'\nmsg.4 = 'message digest'\nmsg.5 = 'abcdefghijklmnopqrstuvwxyz'\nmsg.6 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'\nmsg.7 = 12345678901234567890123456789012345678901234567890123456789012345678901234567890\nmsg.0 = 7 /* [↑] last value doesn't need quotes.*/\n do m=1 for msg.0; say /*process each of the seven messages. */\n say ' in =' msg.m /*display the in message. */\n say 'out =' MD5(msg.m) /* \" \" out \" */\n end /*m*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nMD5: procedure; parse arg !; numeric digits 20 /*insure there's enough decimal digits.*/\n a='67452301'x; b=\"efcdab89\"x; c='98badcfe'x; d=\"10325476\"x; x00='0'x; x80=\"80\"x\n #=length(!) /*length in bytes of the input message.*/\n L=#*8//512; if L<448 then plus=448 - L /*is the length less than 448 ? */\n if L>448 then plus=960 - L /* \" \" \" greater \" \" */\n if L=448 then plus=512 /* \" \" \" equal to \" */\n /* [↓] a little of this, ··· */\n $=! || x80 || copies(x00, plus%8 -1)reverse(right(d2c(8 * #), 4, x00)) || '00000000'x\n /* [↑] ··· and a little of that.*/\n do j=0 to length($) % 64 - 1 /*process the message (lots of steps).*/\n a_=a; b_=b; c_=c; d_=d /*save the original values for later.*/\n chunk=j*64 /*calculate the size of the chunks. */\n do k=1 for 16 /*process the message in chunks. */\n !.k=reverse( substr($, chunk + 1 + 4*(k-1), 4) ) /*magic stuff.*/\n end /*k*/ /*────step────*/\n a = .part1( a, b, c, d, 0, 7, 3614090360) /*■■■■ 1 ■■■■*/\n d = .part1( d, a, b, c, 1, 12, 3905402710) /*■■■■ 2 ■■■■*/\n c = .part1( c, d, a, b, 2, 17, 606105819) /*■■■■ 3 ■■■■*/\n b = .part1( b, c, d, a, 3, 22, 3250441966) /*■■■■ 4 ■■■■*/\n a = .part1( a, b, c, d, 4, 7, 4118548399) /*■■■■ 5 ■■■■*/\n d = .part1( d, a, b, c, 5, 12, 1200080426) /*■■■■ 6 ■■■■*/\n c = .part1( c, d, a, b, 6, 17, 2821735955) /*■■■■ 7 ■■■■*/\n b = .part1( b, c, d, a, 7, 22, 4249261313) /*■■■■ 8 ■■■■*/\n a = .part1( a, b, c, d, 8, 7, 1770035416) /*■■■■ 9 ■■■■*/\n d = .part1( d, a, b, c, 9, 12, 2336552879) /*■■■■ 10 ■■■■*/\n c = .part1( c, d, a, b, 10, 17, 4294925233) /*■■■■ 11 ■■■■*/\n b = .part1( b, c, d, a, 11, 22, 2304563134) /*■■■■ 12 ■■■■*/\n a = .part1( a, b, c, d, 12, 7, 1804603682) /*■■■■ 13 ■■■■*/\n d = .part1( d, a, b, c, 13, 12, 4254626195) /*■■■■ 14 ■■■■*/\n c = .part1( c, d, a, b, 14, 17, 2792965006) /*■■■■ 15 ■■■■*/\n b = .part1( b, c, d, a, 15, 22, 1236535329) /*■■■■ 16 ■■■■*/\n a = .part2( a, b, c, d, 1, 5, 4129170786) /*■■■■ 17 ■■■■*/\n d = .part2( d, a, b, c, 6, 9, 3225465664) /*■■■■ 18 ■■■■*/\n c = .part2( c, d, a, b, 11, 14, 643717713) /*■■■■ 19 ■■■■*/\n b = .part2( b, c, d, a, 0, 20, 3921069994) /*■■■■ 20 ■■■■*/\n a = .part2( a, b, c, d, 5, 5, 3593408605) /*■■■■ 21 ■■■■*/\n d = .part2( d, a, b, c, 10, 9, 38016083) /*■■■■ 22 ■■■■*/\n c = .part2( c, d, a, b, 15, 14, 3634488961) /*■■■■ 23 ■■■■*/\n b = .part2( b, c, d, a, 4, 20, 3889429448) /*■■■■ 24 ■■■■*/\n a = .part2( a, b, c, d, 9, 5, 568446438) /*■■■■ 25 ■■■■*/\n d = .part2( d, a, b, c, 14, 9, 3275163606) /*■■■■ 26 ■■■■*/\n c = .part2( c, d, a, b, 3, 14, 4107603335) /*■■■■ 27 ■■■■*/\n b = .part2( b, c, d, a, 8, 20, 1163531501) /*■■■■ 28 ■■■■*/\n a = .part2( a, b, c, d, 13, 5, 2850285829) /*■■■■ 29 ■■■■*/\n d = .part2( d, a, b, c, 2, 9, 4243563512) /*■■■■ 30 ■■■■*/\n c = .part2( c, d, a, b, 7, 14, 1735328473) /*■■■■ 31 ■■■■*/\n b = .part2( b, c, d, a, 12, 20, 2368359562) /*■■■■ 32 ■■■■*/\n a = .part3( a, b, c, d, 5, 4, 4294588738) /*■■■■ 33 ■■■■*/\n d = .part3( d, a, b, c, 8, 11, 2272392833) /*■■■■ 34 ■■■■*/\n c = .part3( c, d, a, b, 11, 16, 1839030562) /*■■■■ 35 ■■■■*/\n b = .part3( b, c, d, a, 14, 23, 4259657740) /*■■■■ 36 ■■■■*/\n a = .part3( a, b, c, d, 1, 4, 2763975236) /*■■■■ 37 ■■■■*/\n d = .part3( d, a, b, c, 4, 11, 1272893353) /*■■■■ 38 ■■■■*/\n c = .part3( c, d, a, b, 7, 16, 4139469664) /*■■■■ 39 ■■■■*/\n b = .part3( b, c, d, a, 10, 23, 3200236656) /*■■■■ 40 ■■■■*/\n a = .part3( a, b, c, d, 13, 4, 681279174) /*■■■■ 41 ■■■■*/\n d = .part3( d, a, b, c, 0, 11, 3936430074) /*■■■■ 42 ■■■■*/\n c = .part3( c, d, a, b, 3, 16, 3572445317) /*■■■■ 43 ■■■■*/\n b = .part3( b, c, d, a, 6, 23, 76029189) /*■■■■ 44 ■■■■*/\n a = .part3( a, b, c, d, 9, 4, 3654602809) /*■■■■ 45 ■■■■*/\n d = .part3( d, a, b, c, 12, 11, 3873151461) /*■■■■ 46 ■■■■*/\n c = .part3( c, d, a, b, 15, 16, 530742520) /*■■■■ 47 ■■■■*/\n b = .part3( b, c, d, a, 2, 23, 3299628645) /*■■■■ 48 ■■■■*/\n a = .part4( a, b, c, d, 0, 6, 4096336452) /*■■■■ 49 ■■■■*/\n d = .part4( d, a, b, c, 7, 10, 1126891415) /*■■■■ 50 ■■■■*/\n c = .part4( c, d, a, b, 14, 15, 2878612391) /*■■■■ 51 ■■■■*/\n b = .part4( b, c, d, a, 5, 21, 4237533241) /*■■■■ 52 ■■■■*/\n a = .part4( a, b, c, d, 12, 6, 1700485571) /*■■■■ 53 ■■■■*/\n d = .part4( d, a, b, c, 3, 10, 2399980690) /*■■■■ 54 ■■■■*/\n c = .part4( c, d, a, b, 10, 15, 4293915773) /*■■■■ 55 ■■■■*/\n b = .part4( b, c, d, a, 1, 21, 2240044497) /*■■■■ 56 ■■■■*/\n a = .part4( a, b, c, d, 8, 6, 1873313359) /*■■■■ 57 ■■■■*/\n d = .part4( d, a, b, c, 15, 10, 4264355552) /*■■■■ 58 ■■■■*/\n c = .part4( c, d, a, b, 6, 15, 2734768916) /*■■■■ 59 ■■■■*/\n b = .part4( b, c, d, a, 13, 21, 1309151649) /*■■■■ 60 ■■■■*/\n a = .part4( a, b, c, d, 4, 6, 4149444226) /*■■■■ 61 ■■■■*/\n d = .part4( d, a, b, c, 11, 10, 3174756917) /*■■■■ 62 ■■■■*/\n c = .part4( c, d, a, b, 2, 15, 718787259) /*■■■■ 63 ■■■■*/\n b = .part4( b, c, d, a, 9, 21, 3951481745) /*■■■■ 64 ■■■■*/\n a = .a(a_, a); b=.a(b_, b); c=.a(c_, c); d=.a(d_, d)\n end /*j*/\n\n return c2x( reverse(a) )c2x( reverse(b) )c2x( reverse(c) )c2x( reverse(d) )\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n.a: return right( d2c( c2d( arg(1) ) + c2d( arg(2) ) ), 4, '0'x)\n.h: return bitxor( bitxor( arg(1), arg(2) ), arg(3) )\n.i: return bitxor( arg(2), bitor(arg(1), bitxor(arg(3), 'ffffffff'x)))\n.f: return bitor( bitand(arg(1),arg(2)), bitand(bitxor(arg(1), 'ffffffff'x), arg(3)))\n.g: return bitor( bitand(arg(1),arg(3)), bitand(arg(2), bitxor(arg(3), 'ffffffff'x)))\n.Lr: procedure; parse arg _,#; if #==0 then return _ /*left rotate.*/\n ?=x2b(c2x(_)); return x2c( b2x( right(? || left(?, #), length(?) )))\n.part1: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n+1\n return .a(.Lr(right(d2c(_+c2d(w) +c2d(.f(x,y,z))+c2d(!.n)),4,'0'x),m),x)\n.part2: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n+1\n return .a(.Lr(right(d2c(_+c2d(w) +c2d(.g(x,y,z))+c2d(!.n)),4,'0'x),m),x)\n.part3: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n+1\n return .a(.Lr(right(d2c(_+c2d(w) +c2d(.h(x,y,z))+c2d(!.n)),4,'0'x),m),x)\n.part4: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n+1\n return .a(.Lr(right(d2c(c2d(w) +c2d(.i(x,y,z))+c2d(!.n)+_),4,'0'x),m),x)\n","language":"REXX"},{"code":"See MD5(\"my string!\") + nl\n# output : a83a049fbe50cf7334caa86bf16a3520\n","language":"Ring"},{"code":">> x = \"The quick brown fox jumped over the lazy dog's back\"\nThe quick brown fox jumped over the lazy dog's back\n\n>> hash(\"md5\", x)\ne38ca1d920c4b8b8d3946b2c72f01680\n","language":"RLaB"},{"code":"**FREE\nCtl-opt MAIN(Main);\nCtl-opt DFTACTGRP(*NO) ACTGRP(*NEW);\n\ndcl-pr QDCXLATE EXTPGM('QDCXLATE');\n dataLen packed(5 : 0) CONST;\n data char(32767) options(*VARSIZE);\n conversionTable char(10) CONST;\nend-pr;\n\ndcl-pr Qc3CalculateHash EXTPROC('Qc3CalculateHash');\n inputData pointer value;\n inputDataLen int(10) const;\n inputDataFormat char(8) const;\n algorithmDscr char(16) const;\n algorithmFormat char(8) const;\n cryptoServiceProvider char(1) const;\n cryptoDeviceName char(1) const options(*OMIT);\n hash char(64) options(*VARSIZE : *OMIT);\n errorCode char(32767) options(*VARSIZE);\nend-pr;\n\ndcl-c HEX_CHARS CONST('0123456789ABCDEF');\n\ndcl-proc Main;\n dcl-s inputData char(45);\n dcl-s inputDataLen int(10) INZ(0);\n dcl-s outputHash char(16);\n dcl-s outputHashHex char(32);\n dcl-ds algorithmDscr QUALIFIED;\n hashAlgorithm int(10) INZ(0);\n end-ds;\n dcl-ds ERRC0100_NULL QUALIFIED;\n bytesProvided int(10) INZ(0); // Leave at zero\n bytesAvailable int(10);\n end-ds;\n\n dow inputDataLen = 0;\n DSPLY 'Input: ' '' inputData;\n inputData = %trim(inputData);\n inputDataLen = %len(%trim(inputData));\n DSPLY ('Input=' + inputData);\n DSPLY ('InputLen=' + %char(inputDataLen));\n if inputDataLen = 0;\n DSPLY 'Input must not be blank';\n endif;\n enddo;\n\n // Convert from EBCDIC to ASCII\n QDCXLATE(inputDataLen : inputData : 'QTCPASC');\n algorithmDscr.hashAlgorithm = 1; // MD5\n // Calculate hash\n Qc3CalculateHash(%addr(inputData) : inputDataLen : 'DATA0100' : algorithmDscr\n : 'ALGD0500' : '0' : *OMIT : outputHash : ERRC0100_NULL);\n // Convert to hex\n CVTHC(outputHashHex : outputHash : 32);\n DSPLY ('MD5: ' + outputHashHex);\n return;\nend-proc;\n\n// This procedure is actually a MI, but I couldn't get it to bind so I wrote my own version\ndcl-proc CVTHC;\n dcl-pi *N;\n target char(65534) options(*VARSIZE);\n srcBits char(32767) options(*VARSIZE) CONST;\n targetLen int(10) value;\n end-pi;\n dcl-s i int(10);\n dcl-s lowNibble ind INZ(*OFF);\n dcl-s inputOffset int(10) INZ(1);\n dcl-ds dataStruct QUALIFIED;\n numField int(5) INZ(0);\n // IBM i is big-endian\n charField char(1) OVERLAY(numField : 2);\n end-ds;\n\n for i = 1 to targetLen;\n if lowNibble;\n dataStruct.charField = %BitAnd(%subst(srcBits : inputOffset : 1) : X'0F');\n inputOffset += 1;\n else;\n dataStruct.charField = %BitAnd(%subst(srcBits : inputOffset : 1) : X'F0');\n dataStruct.numField /= 16;\n endif;\n %subst(target : i : 1) = %subst(HEX_CHARS : dataStruct.numField + 1 : 1);\n lowNibble = NOT lowNibble;\n endfor;\n return;\nend-proc;\n","language":"RPG"},{"code":"require 'digest'\nDigest::MD5.hexdigest(\"The quick brown fox jumped over the lazy dog's back\")\n# => \"e38ca1d920c4b8b8d3946b2c72f01680\"\n","language":"Ruby"},{"code":"[dependencies]\nrust-crypto = \"0.2\"\n","language":"Rust"},{"code":"extern crate crypto;\n\nuse crypto::digest::Digest;\nuse crypto::md5::Md5;\n\nfn main() {\n let mut sh = Md5::new();\n sh.input_str(\"The quick brown fox jumped over the lazy dog's back\");\n println!(\"{}\", sh.result_str());\n}\n","language":"Rust"},{"code":"require(\"chksum\");\nprint(md5sum(\"The quick brown fox jumped over the lazy dog's back\"));\n","language":"S-lang"},{"code":"object RosettaMD5 extends App {\n\n def MD5(s: String): String = {\n // Besides \"MD5\", \"SHA-256\", and other hashes are available\n val m = java.security.MessageDigest.getInstance(\"MD5\").digest(s.getBytes(\"UTF-8\"))\n m.map(\"%02x\".format(_)).mkString\n }\n\n assert(\"d41d8cd98f00b204e9800998ecf8427e\" == MD5(\"\"))\n assert(\"0cc175b9c0f1b6a831c399e269772661\" == MD5(\"a\"))\n assert(\"900150983cd24fb0d6963f7d28e17f72\" == MD5(\"abc\"))\n assert(\"f96b697d7cb7938d525a2f31aaf161d0\" == MD5(\"message digest\"))\n assert(\"c3fcd3d76192e4007dfb496cca67e13b\" == MD5(\"abcdefghijklmnopqrstuvwxyz\"))\n assert(\"e38ca1d920c4b8b8d3946b2c72f01680\" == MD5(\"The quick brown fox jumped over the lazy dog's back\"))\n assert(\"d174ab98d277d9f5a5611c2c9f419d9f\" ==\n MD5(\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"))\n assert(\"57edf4a22be3c955ac49da2e2107b67a\" ==\n MD5(\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"))\n import scala.compat.Platform.currentTime\n println(s\"Successfully completed without errors. [total ${currentTime - executionStart} ms]\")\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n include \"msgdigest.s7i\";\n\nconst proc: main is func\n begin\n writeln(hex(md5(\"The quick brown fox jumped over the lazy dog's back\")));\n end func;\n","language":"Seed7"},{"code":"var digest = frequire('Digest::MD5');\nsay digest.md5_hex(\"The quick brown fox jumped over the lazy dog's back\");\n","language":"Sidef"},{"code":"var md5 = require('Digest::MD5').new;\nmd5.add(\"The quick brown fox jumped over the lazy dog's back\");\nsay md5.hexdigest;\n","language":"Sidef"},{"code":"'The quick brown fox jumped over the lazy dog\\'s back' md5String. \"==> 'e38ca1d920c4b8b8d3946b2c72f01680'\"\n","language":"Slate"},{"code":"(display (string->md5 \"The quick brown fox jumped over the lazy dog's back\"))\n","language":"Slope"},{"code":"PackageLoader fileInPackage: 'Digest' !\n(MD5 hexDigestOf: 'The quick brown fox jumped over the lazy dog''s back') displayNl.\n","language":"Smalltalk"},{"code":"(MD5Stream hashValueOf: 'The quick brown fox jumped over the lazy dog''s back') printCR.\n","language":"Smalltalk"},{"code":"SELECT MD5('The quick brown fox jumped over the lazy dog\\'s back')\n","language":"SQL"},{"code":"Md5('The quick brown fox jumped over the lazy dog\\'s back')\n","language":"Suneido"},{"code":"package require md5\nputs [md5::md5 -hex \"The quick brown fox jumped over the lazy dog's back\"]\n# ==> E38CA1D920C4B8B8D3946B2C72F01680\n","language":"Tcl"},{"code":"echo -n \"The quick brown fox jumped over the lazy dog's back\" | md5sum\n","language":"UNIX-Shell"},{"code":"echo -n \"The quick brown fox jumped over the lazy dog's back\" | md5\n","language":"UNIX-Shell"},{"code":"echo -n \"The quick brown fox jumped over the lazy dog's back\" |\n openssl md5 | sed 's/.*= //'\n","language":"UNIX-Shell"},{"code":"import crypto.md5\n\nfn main() {\n for p in [\n // RFC 1321 test cases\n [\"d41d8cd98f00b204e9800998ecf8427e\", \"\"],\n [\"0cc175b9c0f1b6a831c399e269772661\", \"a\"],\n [\"900150983cd24fb0d6963f7d28e17f72\", \"abc\"],\n [\"f96b697d7cb7938d525a2f31aaf161d0\", \"message digest\"],\n [\"c3fcd3d76192e4007dfb496cca67e13b\", \"abcdefghijklmnopqrstuvwxyz\"],\n [\"d174ab98d277d9f5a5611c2c9f419d9f\",\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"],\n [\"57edf4a22be3c955ac49da2e2107b67a\", \"12345678901234567890\" +\n \"123456789012345678901234567890123456789012345678901234567890\"],\n // test case popular with other RC solutions\n [\"e38ca1d920c4b8b8d3946b2c72f01680\",\n \"The quick brown fox jumped over the lazy dog's back\"],\n ] {\n validate(p[0], p[1])\n }\n}\n\nfn validate(check string, s string) {\n sum := md5.hexhash(s)\n if sum != check {\n println(\"MD5 fail\")\n println(\" for string, $s\")\n println(\" expected: $check\")\n println(\" got: $sum\")\n } else {\n println('MD5 succeeded $s')\n }\n}\n","language":"V-(Vlang)"},{"code":"Imports System.Security.Cryptography\nImports System.Text\n\nModule MD5hash\n Sub Main(args As String())\n Console.WriteLine(GetMD5(\"Visual Basic .Net\"))\n End Sub\n\n Private Function GetMD5(plainText As String) As String\n Dim hash As String = \"\"\n\n Using hashObject As MD5 = MD5.Create()\n Dim ptBytes As Byte() = hashObject.ComputeHash(Encoding.UTF8.GetBytes(plainText))\n Dim hashBuilder As New StringBuilder\n\n For i As Integer = 0 To ptBytes.Length - 1\n hashBuilder.Append(ptBytes(i).ToString(\"X2\"))\n Next\n hash = hashBuilder.ToString\n End Using\n\n Return hash\n End Function\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"./crypto\" for Md5\nimport \"./fmt\" for Fmt\n\nvar strings = [\n \"The quick brown fox jumps over the lazy dog\",\n \"The quick brown fox jumps over the lazy dog.\",\n \"\"\n]\n\nfor (s in strings) {\n var digest = Md5.digest(s)\n Fmt.print(\"$s <== '$0s'\", digest, s)\n}\n","language":"Wren"},{"code":"Utils.MD5.calc(\"message digest\"); //-->\"f96b697d7cb7938d525a2f31aaf161d0\"\nUtils.MD5.calc(\"abcdefghijklmnopqrstuvwxyz\"); //-->\"c3fcd3d76192e4007dfb496cca67e13b\"\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/MD5\\nnote: Checksums\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nEncode a string using an MD5 algorithm. The algorithm can be found on [[wp:Md5#Algorithm|Wikipedia]].\\n\\n\\nOptionally, validate your implementation by running all of the test values in [http://tools.ietf.org/html/rfc1321 IETF RFC (1321) for MD5]. \\n\\nAdditionally, RFC 1321 provides more precise information on the algorithm than the Wikipedia article.\\n\\n{{alertbox|lightgray|'''Warning:''' MD5 has [http://tools.ietf.org/html/rfc6151 known weaknesses], including '''collisions''' and [http://www.win.tue.nl/hashclash/rogue-ca/ forged signatures]. Users may consider a stronger alternative when doing production-grade cryptography, such as SHA-256 (from the SHA-2 family), or the upcoming SHA-3.}}\\n\\nIf the solution on this page is a library solution, see [[MD5/Implementation]] for an implementation from scratch.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"\\\"md5\\\" cr:hash! \\\"Some text\\\" cr:hash cr:hash>s\\n. cr bye\\n\",\n \"language\": \"8th\"\n },\n {\n \"code\": \"/* ARM assembly AARCH64 Raspberry PI 3B */\\n/* program MD5_64.s */\\n\\n/*******************************************/\\n/* Constantes file */\\n/*******************************************/\\n/* for this file see task include a file in language AArch64 assembly*/\\n.include \\\"../includeConstantesARM64.inc\\\"\\n\\n.equ MD5_DIGEST_LENGTH, 16\\n.equ ZWORKSIZE, 1000\\n\\n/*********************************/\\n/* Initialized data */\\n/*********************************/\\n.data\\nszMessRosetta: .asciz \\\"Rosetta Code\\\"\\nszMessTest1: .asciz \\\"\\\"\\nszMessTest2: .asciz \\\"abc\\\"\\nszMessTest3: .asciz \\\"abcdefghijklmnopqrstuvwxyz\\\"\\nszMessTest4: .asciz \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"\\nszMessTest5: .asciz \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"\\nszMessFinPgm: .asciz \\\"Program End ok.\\\\n\\\"\\nszMessResult: .asciz \\\"Result for \\\"\\nszMessResult1: .asciz \\\" => \\\"\\nszMessSizeError: .asciz \\\"\\\\033[31mWork area too small !! \\\\033[0m \\\\n\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\n\\n/* array constantes K */\\ntbConstK: .int 0xd76aa478,0xe8c7b756,0x242070db,0xc1bdceee\\n .int 0xf57c0faf,0x4787c62a,0xa8304613,0xfd469501\\n .int 0x698098d8,0x8b44f7af,0xffff5bb1,0x895cd7be\\n .int 0x6b901122,0xfd987193,0xa679438e,0x49b40821\\n .int 0xf61e2562,0xc040b340,0x265e5a51,0xe9b6c7aa\\n .int 0xd62f105d,0x2441453,0xd8a1e681,0xe7d3fbc8\\n .int 0x21e1cde6,0xc33707d6,0xf4d50d87,0x455a14ed\\n .int 0xa9e3e905,0xfcefa3f8,0x676f02d9,0x8d2a4c8a\\n .int 0xfffa3942,0x8771f681,0x6d9d6122,0xfde5380c\\n .int 0xa4beea44,0x4bdecfa9,0xf6bb4b60,0xbebfbc70\\n .int 0x289b7ec6,0xeaa127fa,0xd4ef3085,0x4881d05\\n .int 0xd9d4d039,0xe6db99e5,0x1fa27cf8,0xc4ac5665\\n .int 0xf4292244,0x432aff97,0xab9423a7,0xfc93a039\\n .int 0x655b59c3,0x8f0ccc92,0xffeff47d,0x85845dd1\\n .int 0x6fa87e4f,0xfe2ce6e0,0xa3014314,0x4e0811a1\\n .int 0xf7537e82,0xbd3af235,0x2ad7d2bb,0xeb86d391\\n\\n/* array rotation coef R */\\ntbRotaR: .int 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22\\n .int 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20\\n .int 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23\\n .int 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21\\n\\ntbConstH: .int 0x67452301 // H0\\n .int 0xEFCDAB89 // H1\\n .int 0x98BADCFE // H2\\n .int 0x10325476 // H3\\n\\n/*********************************/\\n/* UnInitialized data */\\n/*********************************/\\n.bss\\n.align 4\\n//iNbBlocs: .skip 8\\nsZoneConv: .skip 24\\nsZoneResult: .skip 24\\ntbH: .skip 4 * 4 // 4 variables H\\nsZoneTrav: .skip ZWORKSIZE\\n/*********************************/\\n/* code section */\\n/*********************************/\\n.text\\n.global main\\nmain: // entry of program\\n\\n ldr x0,qAdrszMessTest1\\n bl computeExemple\\n\\n ldr x0,qAdrszMessTest2\\n bl computeExemple\\n\\n ldr x0,qAdrszMessTest3\\n bl computeExemple\\n\\n ldr x0,qAdrszMessTest4\\n bl computeExemple\\n\\n ldr x0,qAdrszMessTest5\\n bl computeExemple\\n\\n ldr x0,qAdrszMessFinPgm\\n bl affichageMess // display message\\n\\n\\n100: // standard end of the program\\n mov x0,0 // return code\\n mov x8,EXIT // request to exit program\\n svc 0 // perform the system call\\n\\nqAdrszCarriageReturn: .quad szCarriageReturn\\nqAdrszMessResult: .quad szMessResult\\nqAdrszMessResult1: .quad szMessResult1\\nqAdrszMessRosetta: .quad szMessRosetta\\nqAdrszMessTest1: .quad szMessTest1\\nqAdrszMessTest2: .quad szMessTest2\\nqAdrszMessTest3: .quad szMessTest3\\nqAdrszMessTest4: .quad szMessTest4\\nqAdrszMessTest5: .quad szMessTest5\\nqAdrsZoneTrav: .quad sZoneTrav\\nqAdrsZoneConv: .quad sZoneConv\\nqAdrszMessFinPgm: .quad szMessFinPgm\\n/***********************************************/\\n/* compute exemple */\\n/***********************************************/\\n/* x0 contains the address of the message */\\ncomputeExemple:\\n stp x18,lr,[sp,-16]! // save registers\\n mov x18,x0\\n bl computeMD5 // call routine MD5\\n\\n ldr x0,qAdrszMessResult\\n bl affichageMess\\n mov x0,x18\\n bl affichageMess\\n ldr x0,qAdrszMessResult1\\n bl affichageMess\\n ldr x0, qAdrsZoneResult\\n bl displayMD5\\n\\n100:\\n ldp x18,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\n/******************************************************************/\\n/* compute MD5 */\\n/******************************************************************/\\n/* x0 contains the address of the message */\\ncomputeMD5:\\n stp x1,lr,[sp,-16]! // save registers\\n ldr x1,qAdrsZoneTrav\\n mov x2,#0 // counter length\\n1: // copy string in work area\\n cmp x2,ZWORKSIZE\\n bge 99f\\n ldrb w3,[x0,x2]\\n strb w3,[x1,x2]\\n cmp x3,#0\\n add x4,x2,1\\n csel x2,x4,x2,ne\\n bne 1b\\n // add bit et compute length\\n lsl x6,x2,#3 // initial message length in bits\\n mov x3,#0b10000000 // add bit 1 at end of string\\n strb w3,[x1,x2]\\n add x2,x2,#1 // length in bytes\\n lsl x4,x2,#3 // length in bits\\n mov x3,#0\\n2:\\n lsr x5,x2,#6 // padding block 512 bytes\\n lsl x5,x5,#6\\n sub x5,x2,x5\\n cmp x5,#56\\n beq 3f // yes -> end add\\n strb w3,[x1,x2] // add zero at message end\\n add x2,x2,#1 // increment length bytes\\n add x4,x4,#8 // increment length in bits\\n b 2b\\n3:\\n str x6,[x1,x2] // and store at end\\n\\n ldr x7,qAdrtbConstH // constantes H address\\n ldr x4,qAdrtbH // start area H\\n mov x5,#0\\n4: // init array H with start constantes\\n ldr w6,[x7,x5,lsl #2] // load constante\\n str w6,[x4,x5,lsl #2] // and store\\n add x5,x5,#1\\n cmp x5,#4 // constantes number\\n blt 4b\\n\\n // split into block of 64 bytes\\n add x2,x2,#4 // TODO : à revoir\\n lsr x4,x2,#6 // blocks number\\n mov x7,#0 // no de block et x1 contient l'adresse zone de travail\\n ldr x3,qAdrtbConstK // K constantes address\\n ldr x5,qAdrtbRotaR // R rotation address\\n\\n5: // begin loop of each block of 64 bytes\\n // init variable a b c d with H0 H1 H2 H3\\n ldr x0,qAdrtbH\\n ldr w8,[x0] // a\\n ldr w9,[x0,#4] // b\\n ldr w10,[x0,#8] // c\\n ldr w11,[x0,#12] // d\\n\\n mov x6,#0 // indice t\\n /* x2 address begin each block */\\n ldr x1,qAdrsZoneTrav\\n add x2,x1,x7,lsl #6 // compute block begin indice * 4 * 16\\n6: // begin loop one\\n cmp x6,15\\n bgt 7f\\n // cas 1 f := (b et c) ou ((non b) et d)\\n // g := i\\n and w12,w9,w10\\n mvn w13,w9\\n and w13,w13,w11\\n orr w12,w12,w13 // f\\n mov x14,x6 // g\\n b 10f\\n7:\\n cmp x6,31\\n bgt 8f\\n // f := (d et b) ou ((non d) et c)\\n // g := (5×i + 1) mod 16\\n and w12,w11,w9\\n mvn w13,w11\\n and w13,w13,w10\\n orr w12,w12,w13 // f\\n mov x13,5\\n mul x13,x6,x13\\n add x13,x13,1\\n lsr x15,x13,4\\n lsl x15,x15,4\\n sub x14,x13,x15\\n b 10f\\n8:\\n cmp x6,47\\n bgt 9f\\n // f := b xor c xor d\\n // g := (3×i + 5) mod 16\\n eor w12,w9,w10\\n eor w12,w12,w11\\n mov x13,3\\n mul x13,x6,x13\\n add x13,x13,5\\n lsr x15,x13,4\\n lsl x15,x15,4\\n sub x14,x13,x15\\n\\n b 10f\\n9:\\n // f := c xor (b ou (non d))\\n // g := (7×i) mod 16\\n mvn w13,w11\\n orr w13,w13,w9\\n eor w12,w13,w10 // f\\n mov x13,7\\n mul x13,x6,x13\\n lsr x15,x13,4\\n lsl x15,x15,4\\n sub x14,x13,x15 // g\\n\\n10:\\n mov w15,w11\\n mov w11,w10 // d = c\\n mov w10,w9 // c = b\\n add w16,w8,w12 // a + f\\n ldr w17,[x2,x14,lsl #2]\\n add w16,w16,w17 // + valeur bloc g\\n ldr w13,[x3,x6,lsl #2]\\n add w16,w16,w13 // + valeur constante K de i\\n ldr w17,[x5,x6,lsl #2] // rotate left value\\n mov w13,32\\n sub w17,w13,w17\\n ror w13,w16,w17\\n add w9,w9,w13 // new b\\n mov w8, w15 // new a\\n\\n add x6,x6,1\\n cmp x6,63\\n ble 6b\\n\\n ldr x0,qAdrtbH\\n ldr w1,[x0] // H0\\n add w1,w1,w8 // + a\\n str w1,[x0]\\n ldr w1,[x0,#4] // H1\\n add w1,w1,w9 // + b\\n str w1,[x0,#4]\\n ldr w1,[x0,#8] // H2\\n add w1,w1,w10 // + c\\n str w1,[x0,#8]\\n ldr w1,[x0,#12] // H3\\n add w1,w1,w11 // + d\\n str w1,[x0,#12]\\n // other bloc\\n add x7,x7,1 // increment block\\n cmp x7,x4 // maxi ?\\n ble 5b\\n\\n // compute final result\\n ldr x0,qAdrtbH // start area H\\n ldr x2,qAdrsZoneResult\\n ldr w1,[x0]\\n str w1,[x2]\\n ldr w1,[x0,#4]\\n str w1,[x2,#4]\\n ldr w1,[x0,#8]\\n str w1,[x2,#8]\\n ldr w1,[x0,#12]\\n str w1,[x2,#12]\\n\\n mov x0,#0 // routine OK\\n b 100f\\n99: // size error\\n ldr x0,qAdrszMessSizeError\\n bl affichageMess\\n mov x0,-1\\n100:\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\nqAdrtbConstH: .quad tbConstH\\nqAdrtbConstK: .quad tbConstK\\nqAdrtbRotaR: .quad tbRotaR\\nqAdrtbH: .quad tbH\\nqAdrsZoneResult: .quad sZoneResult\\nqAdrszMessSizeError: .quad szMessSizeError\\n\\n/******************************************************************/\\n/* display hash MD5 */\\n/******************************************************************/\\n/* x0 contains the address of hash */\\ndisplayMD5:\\n stp x1,lr,[sp,-16]! // save registers\\n stp x2,x3,[sp,-16]! // save registers\\n mov x3,x0\\n mov x2,#0\\n1:\\n ldr w0,[x3,x2,lsl #2] // load 4 bytes\\n rev w0,w0 // reverse bytes\\n ldr x1,qAdrsZoneConv\\n bl conversion16_4W // conversion hexa\\n ldr x0,qAdrsZoneConv\\n bl affichageMess\\n add x2,x2,#1\\n cmp x2,#MD5_DIGEST_LENGTH / 4\\n blt 1b // and loop\\n ldr x0,qAdrszCarriageReturn\\n bl affichageMess // display message\\n100:\\n ldp x2,x3,[sp],16 // restaur 2 registers\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\n/******************************************************************/\\n/* conversion hexadecimal register 32 bits */\\n/******************************************************************/\\n/* x0 contains value and x1 address zone receptrice */\\nconversion16_4W:\\n stp x0,lr,[sp,-48]! // save registres\\n stp x1,x2,[sp,32] // save registres\\n stp x3,x4,[sp,16] // save registres\\n mov x2,#28 // start bit position\\n mov x4,#0xF0000000 // mask\\n mov x3,x0 // save entry value\\n1: // start loop\\n and x0,x3,x4 // value register and mask\\n lsr x0,x0,x2 // right shift\\n cmp x0,#10 // >= 10 ?\\n bge 2f // yes\\n add x0,x0,#48 // no is digit\\n b 3f\\n2:\\n add x0,x0,#55 // else is a letter A-F\\n3:\\n strb w0,[x1],#1 // load result and + 1 in address\\n lsr x4,x4,#4 // shift mask 4 bits left\\n subs x2,x2,#4 // decrement counter 4 bits <= zero ?\\n bge 1b // no -> loop\\n\\n100: // fin standard de la fonction\\n ldp x3,x4,[sp,16] // restaur des 2 registres\\n ldp x1,x2,[sp,32] // restaur des 2 registres\\n ldp x0,lr,[sp],48 // restaur des 2 registres\\n ret\\n/********************************************************/\\n/* File Include fonctions */\\n/********************************************************/\\n/* for this file see task include a file in language AArch64 assembly */\\n.include \\\"../includeARM64.inc\\\"\\n\",\n \"language\": \"AArch64-Assembly\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\nwith GNAT.MD5;\\n\\nprocedure MD5_Digest is\\nbegin\\n Put(GNAT.MD5.Digest(\\\"Foo bar baz\\\"));\\nend MD5_Digest;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# Based on wikipedia article pseudocode #\\n\\n# s specifies the per-round shift amounts #\\n[]INT s = (7,12,17,22, 7,12,17,22, 7,12,17,22, 7,12,17,22,\\n 5, 9,14,20, 5, 9,14,20, 5, 9,14,20, 5, 9,14,20,\\n 4,11,16,23, 4,11,16,23, 4,11,16,23, 4,11,16,23,\\n 6,10,15,21, 6,10,15,21, 6,10,15,21, 6,10,15,21);\\n\\n[]BITS k = (16rd76aa478, 16re8c7b756, 16r242070db, 16rc1bdceee,\\n\\t 16rf57c0faf, 16r4787c62a, 16ra8304613, 16rfd469501,\\n\\t 16r698098d8, 16r8b44f7af, 16rffff5bb1, 16r895cd7be,\\n\\t 16r6b901122, 16rfd987193, 16ra679438e, 16r49b40821,\\n\\t 16rf61e2562, 16rc040b340, 16r265e5a51, 16re9b6c7aa,\\n\\t 16rd62f105d, 16r02441453, 16rd8a1e681, 16re7d3fbc8,\\n\\t 16r21e1cde6, 16rc33707d6, 16rf4d50d87, 16r455a14ed,\\n\\t 16ra9e3e905, 16rfcefa3f8, 16r676f02d9, 16r8d2a4c8a,\\n\\t 16rfffa3942, 16r8771f681, 16r6d9d6122, 16rfde5380c,\\n\\t 16ra4beea44, 16r4bdecfa9, 16rf6bb4b60, 16rbebfbc70,\\n\\t 16r289b7ec6, 16reaa127fa, 16rd4ef3085, 16r04881d05,\\n\\t 16rd9d4d039, 16re6db99e5, 16r1fa27cf8, 16rc4ac5665,\\n\\t 16rf4292244, 16r432aff97, 16rab9423a7, 16rfc93a039,\\n\\t 16r655b59c3, 16r8f0ccc92, 16rffeff47d, 16r85845dd1,\\n\\t 16r6fa87e4f, 16rfe2ce6e0, 16ra3014314, 16r4e0811a1,\\n\\t 16rf7537e82, 16rbd3af235, 16r2ad7d2bb, 16reb86d391);\\n\\nOP + = (BITS a, b) BITS:\\n BEGIN\\n BITS c = BIN (ABS (a AND 16rffff) + ABS (b AND 16rffff));\\n BITS d = BIN (ABS (a SHR 16) + ABS (b SHR 16) + ABS (c SHR 16));\\n (c AND 16rffff) OR (d SHL 16)\\n END;\\n\\n#[0:63]LONG INT k;\\nFOR i FROM 0 TO 63 DO\\n k[i] := ENTIER (ABS (sin(i+1)) * LONG INT(2)**32)\\nOD;#\\n\\nPROC md5 = (STRING intext) STRING:\\n BEGIN\\n # Initialize variables: #\\n BITS a0 := 16r67452301,\\n a1 := 16refcdab89,\\n a2 := 16r98badcfe,\\n a3 := 16r10325476;\\n\\n STRING text := intext;\\n\\n # Pre-processing: adding a single 1 bit #\\n text +:= REPR 128;\\n\\n # Pre-processing: padding with zeros\\n append \\\"0\\\" bit until message length in bits ≡ 448 (mod 512) #\\n WHILE ELEMS text MOD 64 ≠ 56 DO\\n text +:= REPR 0\\n OD;\\n\\n # append original length in bits mod (2 pow 64) to message #\\n text +:= dec2asc (ELEMS intext * 8);\\n\\n # MD5 rounds #\\n # Process the message in successive 512-bit chunks: #\\n WHILE text ≠ \\\"\\\" DO\\n\\t # for each 512-bit (64 byte) chunk of message #\\n\\t []CHAR chunk = text[1:64]; text := text[65:];\\n\\t # break chunk into sixteen 32-bit words M[j], 0 <= j <= 15 #\\n\\t [0:15]BITS m;\\n FOR j FROM 0 TO 15 DO\\n m[j] := BIN (ABS chunk[j*4+1]) OR\\n\\t BIN (ABS chunk[j*4+2]) SHL 8 OR\\n\\t BIN (ABS chunk[j*4+3]) SHL 16 OR\\n\\t BIN (ABS chunk[j*4+4]) SHL 24\\n OD;\\n INT g;\\n\\t BITS a, b, c, d, f, dtemp;\\n\\n\\t # Initialize hash value for this chunk #\\n\\t a := a0;\\n b := a1;\\n c := a2;\\n d := a3;\\n FOR i FROM 0 TO 63 DO\\n IF 0 <= i AND i <= 15 THEN\\n\\t\\tf := (b AND c) OR ((NOT b) AND d);\\n\\t\\tg := i\\n\\t ELIF 16 <= i AND i <= 31 THEN\\n\\t\\t f := (d AND b) OR ((NOT d) AND c);\\n\\t\\t g := (5×i + 1) MOD 16\\n\\t ELIF 32 <= i AND i <= 47 THEN\\n\\t\\t f := b XOR c XOR d;\\n\\t\\t g := (3×i + 5) MOD 16\\n\\t ELIF 48 <= i AND i <= 63 THEN\\n\\t\\t f := c XOR (b OR (NOT d));\\n\\t\\t g := (7×i) MOD 16\\n\\t FI;\\n\\t dtemp := d;\\n\\t d := c;\\n\\t c := b;\\n\\t b := b + leftrotate ((a + f + k[1+i] + m[g]), s[1+i]);\\n\\t a := dtemp\\n OD;\\n\\t # Add this chunk's hash to result so far #\\n a0 := a0 + a;\\n a1 := a1 + b;\\n a2 := a2 + c;\\n a3 := a3 + d\\n OD;\\n revhex (a0) + revhex (a1) + revhex (a2) + revhex (a3)\\n END;\\n\\nPROC leftrotate = (BITS x, INT c) BITS:\\n (x SHL c) OR (x SHR (32-c));\\n\\n# dec2asc: dec to 8 byte asc #\\nPROC dec2asc = (INT nn)STRING:\\n BEGIN\\n STRING h := \\\"\\\"; INT n := nn;\\n FOR i TO 8 DO\\n h +:= REPR (n MOD 256);\\n n ÷:= 256\\n OD;\\n h\\n END;\\n\\n PROC revhex = (BITS x) STRING :\\n BEGIN # Convert to lowercase hexadecimal STRING #\\n PROC hexdig = (BITS x) CHAR: (REPR (ABS(x) <= 9 | ABS(x) + ABS(\\\"0\\\") | ABS(x) - 10 + ABS(\\\"a\\\")));\\n hexdig (x SHR 4 AND 16rf) +\\n hexdig (x AND 16rf) +\\n hexdig (x SHR 12 AND 16rf) +\\n hexdig (x SHR 8 AND 16rf) +\\n hexdig (x SHR 20 AND 16rf) +\\n hexdig (x SHR 16 AND 16rf) +\\n hexdig (x SHR 28 AND 16rf) +\\n hexdig (x SHR 24 AND 16rf)\\n END;\\n\\nSTRING testmsg = \\\"The quick brown fox jumps over the lazy dog\\\";\\nSTRING checksum = \\\"9e107d9d372bb6826bd81d3542a419d6\\\";\\n\\nprint ((testmsg, new line));\\nprint ((checksum, new line));\\n\\nSTRING test = md5 (testmsg);\\n\\nIF test = checksum THEN\\n print ((\\\"passed\\\", new line));\\n print ((test, new line))\\nELSE\\n print ((\\\"failed\\\"))\\nFI\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \" md5←{\\n ⍝ index origin zero\\n ⎕IO←0\\n ⍝ decoding UTF-8 & padding\\n M←(⊢,(0⍴⍨512|448-512|≢))1,⍨l←,⍉(8⍴2)⊤'UTF-8'⎕UCS ⍵\\n ⍝ add length\\n M,←,⍉(8⍴2)⊤⌽(8⍴256)⊤≢l\\n ⍝ init registers\\n A←16⊥6 7 4 5 2 3 0 1\\n B←16⊥14 15 12 13 10 11 8 9\\n C←16⊥9 8 11 10 13 12 15 14\\n D←16⊥1 0 3 2 5 4 7 6\\n ⍝ T table\\n T←⌊(2*32)×|1○1+⍳64\\n ⍝ index table\\n K←16|i,(1+5×i),(5+3×i),7×i←⍳16\\n ⍝ rot table\\n S←,1 0 2⍉4 4 4⍴7 12 17 22 5 9 14 20 4 11 16 23 6 10 15 21\\n ⍝ truncate ⍵ to 32 bit & rot left ⍺\\n rot←{2⊥⍺⌽(32⍴2)⊤⍵}\\n proc←{\\n ⍝ pack 512 bits into 32 bit words &\\n ⍝ precompute X[k] + T[i]\\n l←T+(⊂K)⌷256⊥⍉⌽16 4⍴2⊥⍉64 8⍴⍺\\n fn←{\\n ⍝ a b c d to binary\\n a b c d←↓⍉(32⍴2)⊤⍵\\n ⍝ a + F(b,c,d)\\n ⍺<16:S[⍺]rot l[⍺]+2⊥a+d≠b∧c≠d\\n ⍺<32:S[⍺]rot l[⍺]+2⊥a+(b∧d)∨(c∧~d)\\n ⍺<48:S[⍺]rot l[⍺]+2⊥a+b≠c≠d\\n S[⍺]rot l[⍺]+2⊥a+c≠b∨~d\\n }\\n (2*32)|⍵+⊃{¯1⌽((⍵[1]+⍺ fn ⍵)@0)⍵}/(⌽⍳64),⊂⍵\\n }\\n ⍝ process each 512 bits\\n loop←{⍬≡⍺:⍵ ⋄ (512↓⍺)∇(512↑⍺)proc ⍵}\\n ⍝ output registers\\n (⎕D,⎕A)[,⍉(2⍴16)⊤,⍉⊖(4⍴256)⊤M loop A B C D]\\n }\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"/* ARM assembly Raspberry PI */\\n/* program MD5.s */\\n\\n/* REMARK 1 : this program use routines in a include file\\n see task Include a file language arm assembly\\n for the routine affichageMess conversion10\\n see at end of this program the instruction include */\\n/* for constantes see task include a file in arm assembly */\\n/************************************/\\n/* Constantes */\\n/************************************/\\n.include \\\"../constantes.inc\\\"\\n\\n.equ LGHASH, 16 // result length\\n.equ ZWORKSIZE, 1000 // work area size\\n\\n/*******************************************/\\n/* Structures */\\n/********************************************/\\n/* example structure variables */\\n .struct 0\\nvar_a: // a\\n .struct var_a + 4\\nvar_b: // b\\n .struct var_b + 4\\nvar_c: // c\\n .struct var_c + 4\\nvar_d: // d\\n .struct var_d + 4\\n/*********************************/\\n/* Initialized data */\\n/*********************************/\\n.data\\nszMessTest1: .asciz \\\"abc\\\"\\nszMessTest4: .asciz \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"\\nszMessTest2: .asciz \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"\\nszMessTest3: .asciz \\\"abcdefghijklmnopqrstuvwxyz\\\"\\nszMessFinPgm: .asciz \\\"Program End ok.\\\\n\\\"\\nszMessResult: .asciz \\\"Result for \\\"\\nszMessResult1: .asciz \\\" => \\\"\\nszMessSizeError: .asciz \\\"\\\\033[31mWork area too small !! \\\\033[0m \\\\n\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\n\\n.align 4\\n/* array constantes K */\\ntbConstK: .int 0xd76aa478,0xe8c7b756,0x242070db,0xc1bdceee\\n .int 0xf57c0faf,0x4787c62a,0xa8304613,0xfd469501\\n .int 0x698098d8,0x8b44f7af,0xffff5bb1,0x895cd7be\\n .int 0x6b901122,0xfd987193,0xa679438e,0x49b40821\\n .int 0xf61e2562,0xc040b340,0x265e5a51,0xe9b6c7aa\\n .int 0xd62f105d,0x2441453,0xd8a1e681,0xe7d3fbc8\\n .int 0x21e1cde6,0xc33707d6,0xf4d50d87,0x455a14ed\\n .int 0xa9e3e905,0xfcefa3f8,0x676f02d9,0x8d2a4c8a\\n .int 0xfffa3942,0x8771f681,0x6d9d6122,0xfde5380c\\n .int 0xa4beea44,0x4bdecfa9,0xf6bb4b60,0xbebfbc70\\n .int 0x289b7ec6,0xeaa127fa,0xd4ef3085,0x4881d05\\n .int 0xd9d4d039,0xe6db99e5,0x1fa27cf8,0xc4ac5665\\n .int 0xf4292244,0x432aff97,0xab9423a7,0xfc93a039\\n .int 0x655b59c3,0x8f0ccc92,0xffeff47d,0x85845dd1\\n .int 0x6fa87e4f,0xfe2ce6e0,0xa3014314,0x4e0811a1\\n .int 0xf7537e82,0xbd3af235,0x2ad7d2bb,0xeb86d391\\n\\n/* array rotation coef R */\\ntbRotaR: .int 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22\\n .int 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20\\n .int 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23\\n .int 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21\\n\\ntbConstH: .int 0x67452301 // H0\\n .int 0xEFCDAB89 // H1\\n .int 0x98BADCFE // H2\\n .int 0x10325476 // H3\\n\\n/*********************************/\\n/* UnInitialized data */\\n/*********************************/\\n.bss\\n.align 4\\nsZoneConv: .skip 24\\ntbH: .skip 4 * 4 @ 4 variables H\\ntbabcd: .skip 4 * 4 @ 4 variables a b c d\\nsZoneTrav: .skip 1000\\n/*********************************/\\n/* code section */\\n/*********************************/\\n.text\\n.global main\\nmain: @ entry of program\\n\\n ldr r0,iAdrszMessTest1\\n bl computeExemple\\n\\n ldr r0,iAdrszMessTest2\\n bl computeExemple\\n\\n ldr r0,iAdrszMessTest3\\n bl computeExemple\\n\\n ldr r0,iAdrszMessTest4\\n bl computeExemple\\n\\n ldr r0,iAdrszMessFinPgm\\n bl affichageMess @ display message\\n\\n\\n100: @ standard end of the program\\n mov r0, #0 @ return code\\n mov r7, #EXIT @ request to exit program\\n svc #0 @ perform the system call\\n\\niAdrszCarriageReturn: .int szCarriageReturn\\niAdrszMessResult: .int szMessResult\\niAdrszMessResult1: .int szMessResult1\\niAdrszMessTest1: .int szMessTest1\\niAdrszMessTest2: .int szMessTest2\\niAdrszMessTest3: .int szMessTest3\\niAdrszMessTest4: .int szMessTest4\\niAdrsZoneTrav: .int sZoneTrav\\niAdrsZoneConv: .int sZoneConv\\niAdrszMessFinPgm: .int szMessFinPgm\\niAdrszMessSizeError: .int szMessSizeError\\n/***********************************************/\\n/* compute exemple */\\n/***********************************************/\\n/* r0 contains the address of the message */\\ncomputeExemple:\\n push {r1,lr} @ save registres\\n mov r1,r0\\n bl computeMD5 @ call routine MD5\\n\\n ldr r0,iAdrszMessResult\\n bl affichageMess\\n mov r0,r1\\n bl affichageMess\\n ldr r0,iAdrszMessResult1\\n bl affichageMess\\n ldr r0, iAdrtbH\\n bl displayMD5\\n\\n100:\\n pop {r1,pc} @ restaur registers\\n\\n/******************************************************************/\\n/* compute MD5 */\\n/******************************************************************/\\n/* r0 contains the address of the message */\\ncomputeMD5:\\n push {r1-r12,lr} @ save registres\\n ldr r1,iAdrsZoneTrav\\n mov r2,#0 @ counter length\\n1: @ copy string in work area\\n cmp r2,#ZWORKSIZE @ maxi ?\\n bge 99f @ error\\n ldrb r3,[r0,r2]\\n strb r3,[r1,r2]\\n cmp r3,#0\\n addne r2,r2,#1\\n bne 1b\\n lsl r6,r2,#3 @ initial message length in bits\\n mov r3,#0b10000000 @ add bit 1 at end of string\\n strb r3,[r1,r2]\\n add r2,r2,#1 @ length in bytes\\n lsl r4,r2,#3 @ length in bits\\n mov r3,#0\\n2:\\n lsr r5,r2,#6\\n lsl r5,r5,#6\\n sub r5,r2,r5\\n cmp r5,#56\\n beq 3f @ yes -> end add\\n strb r3,[r1,r2] @ add zero at message end\\n add r2,#1 @ increment lenght bytes\\n add r4,#8 @ increment length in bits\\n b 2b\\n3:\\n str r6,[r1,r2] @ and store length at end\\n add r5,r2,#4\\n str r3,[r1,r5] @ store zero in hight bits for 64 bits\\n\\n ldr r7,iAdrtbConstH @ constantes H address\\n ldr r4,iAdrtbH @ start area H\\n mov r5,#0\\n4: @ init array H with start constantes\\n ldr r6,[r7,r5,lsl #2] @ load constante\\n str r6,[r4,r5,lsl #2] @ and store\\n add r5,r5,#1\\n cmp r5,#4\\n blt 4b\\n @ split into block of 64 bytes\\n add r2,#4 @ TODO : à revoir\\n lsr r4,r2,#6 @ blocks number\\n\\n ldr r0,iAdrtbH @ variables H\\n ldr r1,iAdrsZoneTrav\\n ldr r5,iAdrtbConstK\\n ldr r3,iAdrtbRotaR\\n ldr r8,iAdrtbabcd\\n mov r7,#0 @ n° de block et r1 contient l adresse zone de travail\\n5: @ begin loop of each block of 64 bytes\\n add r2,r1,r7,lsl #6 @ compute block begin indice * 4 * 16\\n mov r6,#0 @ indice t\\n /* COMPUTING THE MESSAGE DIGEST */\\n /* r0 variables H address */\\n /* r1 work area */\\n /* r2 block work area begin address */\\n /* r3 address constantes rotate */\\n /* r4 block number */\\n /* r5 constance K address */\\n /* r6 counter t */\\n /* r7 block counter */\\n /* r8 addresse variables a b c d */\\n @ init variable a b c d with variables H\\n mov r10,#0\\n6: @ loop init\\n ldr r9,[r0,r10,lsl #2] @ variables H\\n str r9,[r8,r10,lsl #2] @ variables a b c d\\n add r10,r10,#1\\n cmp r10,#4\\n blt 6b\\n\\n7: @ loop begin\\n cmp r6,#15\\n bgt 8f\\n @ cas 1 f := (b et c) ou ((non b) et d)\\n @ g := i\\n ldr r9,[r8,#var_b]\\n ldr r10,[r8,#var_c]\\n and r12,r10,r9\\n mvn r9,r9\\n ldr r10,[r8,#var_d]\\n and r11,r9,r10\\n orr r12,r12,r11 @ f\\n mov r9,r6 @ g\\n b 11f\\n8:\\n cmp r6,#31\\n bgt 9f\\n @ f := (d et b) ou ((non d) et c)\\n @ g := (5×i + 1) mod 16\\n ldr r9,[r8,#var_b]\\n ldr r10,[r8,#var_d]\\n and r12,r10,r9\\n mvn r10,r10\\n ldr r9,[r8,#var_c]\\n and r11,r9,r10\\n orr r12,r12,r11 @ f\\n mov r9,#5\\n mul r9,r6,r9\\n add r9,r9,#1\\n lsr r10,r9,#4\\n lsl r10,r10,#4\\n sub r9,r9,r10 @ g\\n\\n b 11f\\n9:\\n cmp r6,#47\\n bgt 10f\\n @ f := b xor c xor d\\n @ g := (3×i + 5) mod 16\\n ldr r9,[r8,#var_b]\\n ldr r10,[r8,#var_c]\\n eor r12,r10,r9\\n ldr r10,[r8,#var_d]\\n eor r12,r12,r10 @ f\\n mov r9,#3\\n mul r9,r6,r9\\n add r9,r9,#5\\n lsr r10,r9,#4\\n lsl r10,r10,#4\\n sub r9,r9,r10 @ g\\n b 11f\\n10:\\n @ f := c xor (b ou (non d))\\n @ g := (7×i) mod 16\\n ldr r10,[r8,#var_d]\\n mvn r12,r10\\n ldr r10,[r8,#var_b]\\n orr r12,r12,r10\\n ldr r10,[r8,#var_c]\\n eor r12,r12,r10 @ f\\n mov r9,#7\\n mul r9,r6,r9\\n lsr r10,r9,#4\\n lsl r10,r10,#4\\n sub r9,r9,r10 @ g\\n\\n11:\\n ldr r10,[r8,#var_d]\\n mov r11,r10 @ save old d\\n ldr r10,[r8,#var_c]\\n str r10,[r8,#var_d] @ new d = c\\n ldr r10,[r8,#var_b]\\n str r10,[r8,#var_c] @ new c = b\\n ldr r10,[r8,#var_a]\\n add r12,r12,r10 @ a + f\\n ldr r10,[r2,r9,lsl #2]\\n add r12,r12,r10 @ + valeur bloc g\\n ldr r10,[r5,r6,lsl #2]\\n add r12,r12,r10 @ + valeur constante K de i\\n ldr r10,[r3,r6,lsl #2] @ rotate left value\\n rsb r10,r10,#32 @ compute right rotate\\n ror r12,r12,r10\\n ldr r10,[r8,#var_b]\\n add r12,r12,r10\\n str r12,[r8,#var_b] @ new b\\n str r11,[r8,#var_a] @ new a = old d\\n\\n add r6,r6,#1\\n cmp r6,#63\\n ble 7b\\n @ maj area H\\n ldr r10,[r0] @ H0\\n ldr r11,[r8,#var_a]\\n add r10,r10,r11 @ + a\\n str r10,[r0]\\n ldr r10,[r0,#4] @ H1\\n ldr r11,[r8,#var_b]\\n add r10,r10,r11 @ + b\\n str r10,[r0,#4]\\n ldr r10,[r0,#8] @ H2\\n ldr r11,[r8,#var_c]\\n add r10,r10,r11 @ + c\\n str r10,[r0,#8]\\n ldr r10,[r0,#12] @ H3\\n ldr r11,[r8,#var_d]\\n add r10,r10,r11 @ + d\\n str r10,[r0,#12]\\n\\n @ loop other block\\n add r7,r7,#1 @ increment block\\n cmp r7,r4 @ maxi ?\\n ble 5b\\n\\n mov r9,#0 @ reverse bytes loop\\n12:\\n ldr r10,[r0,r9,lsl #2]\\n rev r10,r10 @ reverse bytes\\n str r10,[r0,r9,lsl #2]\\n add r9,r9,#1\\n cmp r9,#LGHASH / 4\\n blt 12b\\n mov r0,#0 @ routine OK\\n b 100f\\n99: @ size error\\n ldr r0,iAdrszMessSizeError\\n bl affichageMess\\n mov r0,#-1 @ error routine\\n\\n100:\\n pop {r1-r12,pc} @ restaur registers\\niAdrtbConstH: .int tbConstH\\niAdrtbConstK: .int tbConstK\\niAdrtbRotaR: .int tbRotaR\\niAdrtbH: .int tbH\\niAdrtbabcd: .int tbabcd\\n\\n/*************************************************/\\n/* display hash MD5 */\\n/*************************************************/\\n/* r0 contains the address of hash */\\ndisplayMD5:\\n push {r1-r3,lr} @ save registres\\n mov r3,r0\\n mov r2,#0\\n1:\\n ldr r0,[r3,r2,lsl #2] @ load 4 bytes\\n ldr r1,iAdrsZoneConv\\n bl conversion16 @ conversion hexa\\n ldr r0,iAdrsZoneConv\\n bl affichageMess\\n add r2,r2,#1\\n cmp r2,#LGHASH / 4\\n blt 1b @ and loop\\n ldr r0,iAdrszCarriageReturn\\n bl affichageMess @ display message\\n100:\\n pop {r1-r3,lr} @ restaur registers\\n bx lr @ return\\n/***************************************************/\\n/* ROUTINES INCLUDE */\\n/***************************************************/\\n.include \\\"../affichage.inc\\\"\\n\",\n \"language\": \"ARM-Assembly\"\n },\n {\n \"code\": \"print digest \\\"The quick brown fox jumped over the lazy dog's back\\\"\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"data := \\\"abc\\\"\\nMsgBox % MD5(data,StrLen(data)) ; 900150983cd24fb0d6963f7d28e17f72\\n\\nMD5( ByRef V, L=0 ) {\\n VarSetCapacity( MD5_CTX,104,0 ), DllCall( \\\"advapi32\\\\MD5Init\\\", Str,MD5_CTX )\\n DllCall( \\\"advapi32\\\\MD5Update\\\", Str,MD5_CTX, Str,V, UInt,L ? L : VarSetCapacity(V) )\\n DllCall( \\\"advapi32\\\\MD5Final\\\", Str,MD5_CTX )\\n Loop % StrLen( Hex:=\\\"123456789ABCDEF0\\\" )\\n N := NumGet( MD5_CTX,87+A_Index,\\\"Char\\\"), MD5 .= SubStr(Hex,N>>4,1) . SubStr(Hex,N&15,1)\\nReturn MD5\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"; GLOBAL CONSTANTS r[64], k[64]\\nr = 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22\\n, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20\\n, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23\\n, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21\\nStringSplit r, r, `,\\nr0 := 7\\nLoop 64\\n i := A_Index-1, k%i% := floor(abs(sin(A_Index)) * 2**32)\\n\\n; TEST CASES\\nMsgBox % MD5(x:=\\\"\\\", 0) ; d41d8cd98f00b204e9800998ecf8427e\\nMsgBox % MD5(x:=\\\"a\\\", StrLen(x)) ; 0cc175b9c0f1b6a831c399e269772661\\nMsgBox % MD5(x:=\\\"abc\\\", StrLen(x)) ; 900150983cd24fb0d6963f7d28e17f72\\nMsgBox % MD5(x:=\\\"message digest\\\", StrLen(x)) ; f96b697d7cb7938d525a2f31aaf161d0\\nMsgBox % MD5(x:=\\\"abcdefghijklmnopqrstuvwxyz\\\", StrLen(x))\\n; c3fcd3d76192e4007dfb496cca67e13b\\nMsgBox % MD5(x:=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\", StrLen(x))\\n; d174ab98d277d9f5a5611c2c9f419d9f\\nMsgBox % MD5(x:=\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\", StrLen(x))\\n; 57edf4a22be3c955ac49da2e2107b67a\\nMsgBox % MD5(x:=\\\"The quick brown fox jumps over the lazy dog\\\", StrLen(x))\\n; 9e107d9d372bb6826bd81d3542a419d6\\nMsgBox % MD5(x:=\\\"The quick brown fox jumps over the lazy cog\\\", StrLen(x))\\n; 1055d3e698d289f2af8663725127bd4b\\n\\nMD5(ByRef Buf, L) { ; Binary buffer, Length in bytes\\n Static P, Q, N, i, a,b,c,d, t, h0,h1,h2,h3, y = 0xFFFFFFFF\\n\\n h0 := 0x67452301, h1 := 0xEFCDAB89, h2 := 0x98BADCFE, h3 := 0x10325476\\n\\n N := ceil((L+9)/64)*64 ; padded length (100..separator, 8B length)\\n VarSetCapacity(Q,N,0) ; room for padded data\\n P := &Q ; pointer\\n DllCall(\\\"RtlMoveMemory\\\", UInt,P, UInt,&Buf, UInt,L) ; copy data\\n DllCall(\\\"RtlFillMemory\\\", UInt,P+L, UInt,1, UInt,0x80) ; pad separator\\n DllCall(\\\"ntdll.dll\\\\RtlFillMemoryUlong\\\",UInt,P+N-8,UInt,4,UInt,8*L) ; at end: length in bits < 512 MB\\n\\n Loop % N//64 {\\n Loop 16\\n i := A_Index-1, w%i% := *P | *(P+1)<<8 | *(P+2)<<16 | *(P+3)<<24, P += 4\\n\\n a := h0, b := h1, c := h2, d := h3\\n\\n Loop 64 {\\n i := A_Index-1\\n If i < 16\\n f := (b & c) | (~b & d), g := i\\n Else If i < 32\\n f := (d & b) | (~d & c), g := 5*i+1 & 15\\n Else If i < 48\\n f := b ^ c ^ d, g := 3*i+5 & 15\\n Else\\n f := c ^ (b | ~d), g := 7*i & 15\\n\\n t := d, d := c, c := b\\n b += rotate(a + f + k%i% + w%g%, r%i%) ; reduced to 32 bits later\\n a := t\\n }\\n\\n h0 := h0+a & y, h1 := h1+b & y, h2 := h2+c & y, h3 := h3+d & y\\n }\\n Return hex(h0) . hex(h1) . hex(h2) . hex(h3)\\n}\\n\\nrotate(a,b) { ; 32-bit rotate a to left by b bits, bit32..63 garbage\\n Return a << b | (a & 0xFFFFFFFF) >> (32-b)\\n}\\n\\nhex(x) { ; 32-bit little endian hex digits\\n SetFormat Integer, HEX\\n x += 0x100000000, x := SubStr(x,-1) . SubStr(x,8,2) . SubStr(x,6,2) . SubStr(x,4,2)\\n SetFormat Integer, DECIMAL\\n Return x\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"PRAGMA INCLUDE <stdio.h>\\nPRAGMA INCLUDE <stdlib.h>\\nPRAGMA INCLUDE <string.h>\\nPRAGMA INCLUDE <openssl/md5.h>\\nPRAGMA LDFLAGS -lcrypto -lm -w\\n\\nDECLARE result TYPE unsigned char *\\nDECLARE string TYPE const char *\\n\\nstring = \\\"Rosetta code\\\"\\nstrlenght = LEN(string)\\n\\nresult = MD5( string, strlenght , 0)\\n\\nFOR i = 0 TO MD5_DIGEST_LENGTH-1\\n PRINT result[i] FORMAT \\\"%02x\\\"\\nNEXT\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"print MD5(\\\"\\\")\\nprint MD5(\\\"a\\\")\\nprint MD5(\\\"abc\\\")\\nprint MD5(\\\"message digest\\\")\\nprint MD5(\\\"abcdefghijklmnopqrstuvwxyz\\\")\\nprint MD5(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\")\\nprint MD5(\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\")\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \" PRINT FN_MD5(\\\"\\\")\\n PRINT FN_MD5(\\\"a\\\")\\n PRINT FN_MD5(\\\"abc\\\")\\n PRINT FN_MD5(\\\"message digest\\\")\\n PRINT FN_MD5(\\\"abcdefghijklmnopqrstuvwxyz\\\")\\n PRINT FN_MD5(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\")\\n PRINT FN_MD5(STRING$(8,\\\"1234567890\\\"))\\n END\\n\\n DEF FN_MD5(message$)\\n LOCAL I%, MD5$, MD5_CTX{}\\n DIM MD5_CTX{i%(1), buf%(3), in&(63), digest&(15)}\\n SYS \\\"MD5Init\\\", MD5_CTX{}\\n SYS \\\"MD5Update\\\", MD5_CTX{}, message$, LEN(message$)\\n SYS \\\"MD5Final\\\", MD5_CTX{}\\n FOR I% = 0 TO 15\\n MD5$ += RIGHT$(\\\"0\\\"+STR$~(MD5_CTX.digest&(I%)),2)\\n NEXT\\n = MD5$\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <openssl/md5.h>\\n\\nconst char *string = \\\"The quick brown fox jumped over the lazy dog's back\\\";\\n\\nint main()\\n{\\n int i;\\n unsigned char result[MD5_DIGEST_LENGTH];\\n\\n MD5(string, strlen(string), result);\\n\\n // output\\n for(i = 0; i < MD5_DIGEST_LENGTH; i++)\\n printf(\\\"%02x\\\", result[i]);\\n printf(\\\"\\\\n\\\");\\n\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdlib.h>\\n#include <stdio.h>\\n#include <string.h>\\n#include <math.h>\\n\\ntypedef union uwb {\\n unsigned w;\\n unsigned char b[4];\\n} WBunion;\\n\\ntypedef unsigned Digest[4];\\n\\nunsigned f0( unsigned abcd[] ){\\n return ( abcd[1] & abcd[2]) | (~abcd[1] & abcd[3]);}\\n\\nunsigned f1( unsigned abcd[] ){\\n return ( abcd[3] & abcd[1]) | (~abcd[3] & abcd[2]);}\\n\\nunsigned f2( unsigned abcd[] ){\\n return abcd[1] ^ abcd[2] ^ abcd[3];}\\n\\nunsigned f3( unsigned abcd[] ){\\n return abcd[2] ^ (abcd[1] |~ abcd[3]);}\\n\\ntypedef unsigned (*DgstFctn)(unsigned a[]);\\n\\nunsigned *calcKs( unsigned *k)\\n{\\n double s, pwr;\\n int i;\\n\\n pwr = pow( 2, 32);\\n for (i=0; i<64; i++) {\\n s = fabs(sin(1+i));\\n k[i] = (unsigned)( s * pwr );\\n }\\n return k;\\n}\\n\\n// ROtate v Left by amt bits\\nunsigned rol( unsigned v, short amt )\\n{\\n unsigned msk1 = (1<<amt) -1;\\n return ((v>>(32-amt)) & msk1) | ((v<<amt) & ~msk1);\\n}\\n\\nunsigned *md5( const char *msg, int mlen)\\n{\\n static Digest h0 = { 0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476 };\\n// static Digest h0 = { 0x01234567, 0x89ABCDEF, 0xFEDCBA98, 0x76543210 };\\n static DgstFctn ff[] = { &f0, &f1, &f2, &f3 };\\n static short M[] = { 1, 5, 3, 7 };\\n static short O[] = { 0, 1, 5, 0 };\\n static short rot0[] = { 7,12,17,22};\\n static short rot1[] = { 5, 9,14,20};\\n static short rot2[] = { 4,11,16,23};\\n static short rot3[] = { 6,10,15,21};\\n static short *rots[] = {rot0, rot1, rot2, rot3 };\\n static unsigned kspace[64];\\n static unsigned *k;\\n\\n static Digest h;\\n Digest abcd;\\n DgstFctn fctn;\\n short m, o, g;\\n unsigned f;\\n short *rotn;\\n union {\\n unsigned w[16];\\n char b[64];\\n }mm;\\n int os = 0;\\n int grp, grps, q, p;\\n unsigned char *msg2;\\n\\n if (k==NULL) k= calcKs(kspace);\\n\\n for (q=0; q<4; q++) h[q] = h0[q]; // initialize\\n\\n {\\n grps = 1 + (mlen+8)/64;\\n msg2 = malloc( 64*grps);\\n memcpy( msg2, msg, mlen);\\n msg2[mlen] = (unsigned char)0x80;\\n q = mlen + 1;\\n while (q < 64*grps){ msg2[q] = 0; q++ ; }\\n {\\n// unsigned char t;\\n WBunion u;\\n u.w = 8*mlen;\\n// t = u.b[0]; u.b[0] = u.b[3]; u.b[3] = t;\\n// t = u.b[1]; u.b[1] = u.b[2]; u.b[2] = t;\\n q -= 8;\\n memcpy(msg2+q, &u.w, 4 );\\n }\\n }\\n\\n for (grp=0; grp<grps; grp++)\\n {\\n memcpy( mm.b, msg2+os, 64);\\n for(q=0;q<4;q++) abcd[q] = h[q];\\n for (p = 0; p<4; p++) {\\n fctn = ff[p];\\n rotn = rots[p];\\n m = M[p]; o= O[p];\\n for (q=0; q<16; q++) {\\n g = (m*q + o) % 16;\\n f = abcd[1] + rol( abcd[0]+ fctn(abcd) + k[q+16*p] + mm.w[g], rotn[q%4]);\\n\\n abcd[0] = abcd[3];\\n abcd[3] = abcd[2];\\n abcd[2] = abcd[1];\\n abcd[1] = f;\\n }\\n }\\n for (p=0; p<4; p++)\\n h[p] += abcd[p];\\n os += 64;\\n }\\n\\n if( msg2 )\\n free( msg2 );\\n\\n return h;\\n}\\n\\nint main( int argc, char *argv[] )\\n{\\n int j,k;\\n const char *msg = \\\"The quick brown fox jumps over the lazy dog.\\\";\\n unsigned *d = md5(msg, strlen(msg));\\n WBunion u;\\n\\n printf(\\\"= 0x\\\");\\n for (j=0;j<4; j++){\\n u.w = d[j];\\n for (k=0;k<4;k++) printf(\\\"%02x\\\",u.b[k]);\\n }\\n printf(\\\"\\\\n\\\");\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <string>\\n#include <iostream>\\n#include \\\"Poco/MD5Engine.h\\\"\\n#include \\\"Poco/DigestStream.h\\\"\\n\\nusing Poco::DigestEngine ;\\nusing Poco::MD5Engine ;\\nusing Poco::DigestOutputStream ;\\n\\nint main( ) {\\n std::string myphrase ( \\\"The quick brown fox jumped over the lazy dog's back\\\" ) ;\\n MD5Engine md5 ;\\n DigestOutputStream outstr( md5 ) ;\\n outstr << myphrase ;\\n outstr.flush( ) ; //to pass everything to the digest engine\\n const DigestEngine::Digest& digest = md5.digest( ) ;\\n std::cout << myphrase << \\\" as a MD5 digest :\\\\n\\\" << DigestEngine::digestToHex( digest )\\n << \\\" !\\\" << std::endl ;\\n return 0 ;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System.Text;\\nusing System.Security.Cryptography;\\n\\nbyte[] data = Encoding.ASCII.GetBytes(\\\"The quick brown fox jumped over the lazy dog's back\\\");\\nbyte[] hash = MD5.Create().ComputeHash(data);\\nConsole.WriteLine(BitConverter.ToString(hash).Replace(\\\"-\\\", \\\"\\\").ToLower());\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(apply str\\n (map (partial format \\\"%02x\\\")\\n (.digest (doto (java.security.MessageDigest/getInstance \\\"MD5\\\")\\n .reset\\n (.update (.getBytes \\\"The quick brown fox jumps over the lazy dog\\\"))))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. MD5.\\n AUTHOR. Bill Gunshannon\\n INSTALLATION. Home.\\n DATE-WRITTEN. 16 December 2021.\\n ************************************************************\\n ** Program Abstract:\\n ** Use the md5sum utility and pass the HASH back using\\n ** a temp file. Not elegant, but it works.\\n ************************************************************\\n\\n\\n ENVIRONMENT DIVISION.\\n\\n INPUT-OUTPUT SECTION.\\n FILE-CONTROL.\\n SELECT Tmp-MD5 ASSIGN TO \\\"/tmp/MD5\\\"\\n ORGANIZATION IS LINE SEQUENTIAL.\\n\\n\\n DATA DIVISION.\\n\\n FILE SECTION.\\n\\n FD Tmp-MD5\\n DATA RECORD IS MD5-Rec.\\n 01 MD5-Rec PIC X(32).\\n\\n\\n WORKING-STORAGE SECTION.\\n\\n 01 Eof PIC X VALUE 'F'.\\n 01 Str1.\\n 05 Pre-cmd PIC X(8)\\n VALUE 'echo -n '.\\n 05 Str1-complete.\\n 10 Str1-Part1 PIC X(26)\\n VALUE 'The quick brown fox jumps'.\\n 10 Str1-Part2 PIC X(19)\\n VALUE ' over the lazy dog'.\\n 05 Post-cmd PIC X(20)\\n VALUE ' | md5sum > /tmp/MD5'.\\n 01 Str1-MD5 PIC X(32).\\n\\n\\n PROCEDURE DIVISION.\\n\\n Main-Program.\\n\\n DISPLAY Str1-complete.\\n PERFORM Get-MD5.\\n DISPLAY Str1-MD5.\\n\\n STOP RUN.\\n\\n Get-MD5.\\n\\n CALL \\\"SYSTEM\\\" USING Str1.\\n OPEN INPUT Tmp-MD5.\\n READ Tmp-MD5 INTO Str1-MD5.\\n CLOSE Tmp-MD5.\\n CALL \\\"CBL_DELETE_FILE\\\" USING '/tmp/MD5'.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. MD5-DEMO.\\n AUTHOR. Bill Gunshannon\\n INSTALLATION. Home.\\n DATE-WRITTEN. 16 December 2021.\\n ************************************************************\\n ** Program Abstract:\\n ** Use the md5sum utility and pass the HASH back using\\n ** a temp file. Not elegant, but it works.\\n ** Same program but made MD5 a User Defined Function\\n ** instead of a procedure.\\n ************************************************************\\n\\n\\n ENVIRONMENT DIVISION.\\n\\n CONFIGURATION SECTION.\\n\\n REPOSITORY.\\n FUNCTION MD5.\\n\\n DATA DIVISION.\\n\\n WORKING-STORAGE SECTION.\\n\\n 01 Eof PIC X VALUE 'F'.\\n 01 Str1.\\n 05 Pre-cmd PIC X(8)\\n VALUE 'echo -n '.\\n 05 Str1-complete.\\n 10 Str1-Part1 PIC X(26)\\n VALUE 'The quick brown fox jumps'.\\n 10 Str1-Part2 PIC X(19)\\n VALUE ' over the lazy dog'.\\n 05 Post-cmd PIC X(20)\\n VALUE ' | md5sum > /tmp/MD5'.\\n 01 Str1-MD5 PIC X(32).\\n\\n\\n PROCEDURE DIVISION.\\n\\n Main-Program.\\n\\n DISPLAY Str1-complete.\\n * PERFORM Get-MD5.\\n MOVE FUNCTION MD5(Str1) TO Str1-MD5.\\n DISPLAY Str1-MD5.\\n\\n STOP RUN.\\n\\n END PROGRAM MD5-DEMO.\\n\\n IDENTIFICATION DIVISION.\\n FUNCTION-ID. MD5.\\n\\n ENVIRONMENT DIVISION.\\n\\n INPUT-OUTPUT SECTION.\\n FILE-CONTROL.\\n SELECT Tmp-MD5 ASSIGN TO \\\"/tmp/MD5\\\"\\n ORGANIZATION IS LINE SEQUENTIAL.\\n\\n\\n DATA DIVISION.\\n\\n FILE SECTION.\\n\\n FD Tmp-MD5\\n DATA RECORD IS MD5-Rec.\\n 01 MD5-Rec PIC X(32).\\n\\n\\n\\n LINKAGE SECTION.\\n 01 Str1 PIC X(128).\\n 01 Str1-MD5 PIC X(32).\\n\\n PROCEDURE DIVISION USING Str1 RETURNING Str1-MD5.\\n\\n CALL \\\"SYSTEM\\\" USING FUNCTION TRIM(Str1).\\n OPEN INPUT Tmp-MD5.\\n READ Tmp-MD5 INTO Str1-MD5.\\n CLOSE Tmp-MD5.\\n CALL \\\"CBL_DELETE_FILE\\\" USING '/tmp/MD5'.\\n GO-BACK.\\n\\n END FUNCTION MD5.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"(ql:quickload 'ironclad)\\n(defun md5 (str)\\n (ironclad:byte-array-to-hex-string\\n (ironclad:digest-sequence :md5\\n (ironclad:ascii-string-to-byte-array str))))\\n(defvar *tests* '(\\\"\\\"\\n \\\"a\\\"\\n \\\"abc\\\"\\n \\\"message digest\\\"\\n \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"\\n \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"))\\n(dolist (msg *tests*)\\n (format T \\\"~s: ~a~%\\\" msg (md5 msg)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(cffi:load-foreign-library \\\"libcrypto.so\\\")\\n\\n(cffi:defcfun (\\\"MD5\\\" MD5) :void (string :string) (len :int) (ptr :pointer))\\n\\n(let ((string-to-convert \\\"The quick brown fox jumped over the lazy dog's back\\\")\\n (ptr (cffi:foreign-alloc :unsigned-char :count 16)))\\n (md5 string-to-convert (length string-to-convert) ptr)\\n (loop for i from 0 below 16 do\\n (format t \\\"~a\\\" (write-to-string (cffi:mem-ref ptr :unsigned-char i) :base 16)))\\n (cffi:foreign-free ptr))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"require \\\"digest/md5\\\"\\n\\nputs Digest::MD5.hexdigest(\\\"The quick brown fox jumped over the lazy dog's back\\\")\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.digest.md;\\n\\n auto txt = \\\"The quick brown fox jumped over the lazy dog's back\\\";\\n writefln(\\\"%-(%02x%)\\\", txt.md5Of);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import tango.io.digest.Md5, tango.io.Stdout;\\n\\nvoid main(char[][] args) {\\n auto md5 = new Md5();\\n for(int i = 1; i < args.length; i++) {\\n md5.update(args[i]);\\n Stdout.formatln(\\\"[{}]=>\\\\n[{}]\\\", args[i], md5.hexDigest());\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program MD5Hash;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n SysUtils,\\n IdHashMessageDigest;\\n\\nfunction MD5(aValue: string): string;\\nbegin\\n with TIdHashMessageDigest5.Create do\\n begin\\n Result:= HashStringAsHex(aValue);\\n Free;\\n end;\\nend;\\n\\nbegin\\n Writeln(MD5(''));\\n Writeln(MD5('a'));\\n Writeln(MD5('abc'));\\n Writeln(MD5('message digest'));\\n Writeln(MD5('abcdefghijklmnopqrstuvwxyz'));\\n Writeln(MD5('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'));\\n Writeln(MD5('12345678901234567890123456789012345678901234567890123456789012345678901234567890'));\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"def makeMessageDigest := <import:java.security.makeMessageDigest>\\ndef sprintf := <import:java.lang.makeString>.format\\n\\ndef digest := makeMessageDigest.getInstance(\\\"MD5\\\") \\\\\\n .digest(\\\"The quick brown fox jumped over the lazy dog's back\\\".getBytes(\\\"iso-8859-1\\\"))\\n\\nfor b in digest {\\n print(sprintf(\\\"%02x\\\", [b]))\\n}\\nprintln()\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"len md5k[] 64\\nproc md5init . .\\n for i = 1 to 64\\n md5k[i] = floor (0x100000000 * abs sin (i * 180 / pi))\\n .\\n.\\nmd5init\\n#\\nfunc$ md5 inp$ .\\n subr addinp\\n if inp4 = 1\\n inp[] &= 0\\n .\\n inp[len inp[]] += b * inp4\\n inp4 *= 0x100\\n if inp4 = 0x100000000\\n inp4 = 1\\n .\\n .\\n s[] = [ 7 12 17 22 7 12 17 22 7 12 17 22 7 12 17 22 5 9 14 20 5 9 14 20 5 9 14 20 5 9 14 20 4 11 16 23 4 11 16 23 4 11 16 23 4 11 16 23 6 10 15 21 6 10 15 21 6 10 15 21 6 10 15 21 ]\\n inp[] = [ ]\\n inp4 = 1\\n for i = 1 to len inp$\\n b = strcode substr inp$ i 1\\n addinp\\n .\\n b = 0x80\\n addinp\\n while len inp[] mod 16 <> 14 or inp4 <> 1\\n b = 0\\n addinp\\n .\\n h = len inp$ * 8\\n for i = 1 to 4\\n b = h mod 0x100\\n addinp\\n h = h div 0x100\\n .\\n inp[] &= 0\\n #\\n a0 = 0x67452301\\n b0 = 0xefcdab89\\n c0 = 0x98badcfe\\n d0 = 0x10325476\\n for chunk = 1 step 16 to len inp[] - 15\\n a = a0 ; b = b0 ; c = c0 ; d = d0\\n for i = 1 to 64\\n if i <= 16\\n h1 = bitand b c\\n h2 = bitand bitnot b d\\n f = bitor h1 h2\\n g = i - 1\\n elif i <= 32\\n h1 = bitand d b\\n h2 = bitand bitnot d c\\n f = bitor h1 h2\\n g = (5 * i - 4) mod 16\\n elif i <= 48\\n h1 = bitxor b c\\n f = bitxor h1 d\\n g = (3 * i + 2) mod 16\\n else\\n h1 = bitor b bitnot d\\n f = bitxor c h1\\n g = (7 * i - 7) mod 16\\n .\\n f = (f + a + md5k[i] + inp[chunk + g])\\n a = d\\n d = c\\n c = b\\n h1 = bitshift f s[i]\\n h2 = bitshift f (s[i] - 32)\\n b = (b + h1 + h2)\\n .\\n a0 += a ; b0 += b ; c0 += c ; d0 += d\\n .\\n for a in [ a0 b0 c0 d0 ]\\n for i = 1 to 4\\n b = a mod 256\\n a = a div 256\\n for h in [ b div 16 b mod 16 ]\\n h += 48\\n if h > 57\\n h += 39\\n .\\n s$ &= strchar h\\n .\\n .\\n .\\n return s$\\n.\\n#\\nprint md5 \\\"The quick brown fox jumped over the lazy dog's back\\\"\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"(md5 \\\"The quick brown fox jumped over the lazy dog's back\\\") ;=> \\\"e38ca1d920c4b8b8d3946b2c72f01680\\\"\\n(secure-hash 'md5 \\\"The quick brown fox jumped over the lazy dog's back\\\") ;=> \\\"e38ca1d920c4b8b8d3946b2c72f01680\\\"\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"-module(tests).\\n-export([md5/1]).\\n\\nmd5(S) ->\\n string:to_upper(\\n lists:flatten([io_lib:format(\\\"~2.16.0b\\\",[N]) || <<N>> <= erlang:md5(S)])\\n ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"1> c(tests).\\n{ok,tests}\\n2> tests:md5(\\\"The quick brown fox jumped over the lazy dog's back\\\").\\n\\\"E38CA1D920C4B8B8D3946B2C72F01680\\\"\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"let md5ootb (msg: string) =\\n use md5 = System.Security.Cryptography.MD5.Create()\\n msg\\n |> System.Text.Encoding.ASCII.GetBytes\\n |> md5.ComputeHash\\n |> Seq.map (fun c -> c.ToString(\\\"X2\\\"))\\n |> Seq.reduce ( + )\\n\\nmd5ootb @\\\"The quick brown fox jumped over the lazy dog's back\\\"\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"include ffl/md5.fs\\n\\n\\\\ Create a MD5 variable md1 in the dictionary\\n\\nmd5-create md1\\n\\n\\\\ Update the variable with data\\n\\ns\\\" The quick brown fox jumps over the lazy dog\\\" md1 md5-update\\n\\n\\\\ Finish the MD5 calculation resulting in four unsigned 32 bit words\\n\\\\ on the stack representing the hash value\\n\\nmd1 md5-finish\\n\\n\\\\ Convert the hash value to a hex string and print it\\n\\nmd5+to-string type cr\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"module md5_mod\\n use kernel32\\n use advapi32\\n implicit none\\n integer, parameter :: MD5LEN = 16\\ncontains\\n subroutine md5hash(name, hash, dwStatus, filesize)\\n implicit none\\n character(*) :: name\\n integer, parameter :: BUFLEN = 32768\\n integer(HANDLE) :: hFile, hProv, hHash\\n integer(DWORD) :: dwStatus, nRead\\n integer(BOOL) :: status\\n integer(BYTE) :: buffer(BUFLEN)\\n integer(BYTE) :: hash(MD5LEN)\\n integer(UINT64) :: filesize\\n\\n dwStatus = 0\\n filesize = 0\\n hFile = CreateFile(trim(name) // char(0), GENERIC_READ, FILE_SHARE_READ, NULL, &\\n OPEN_EXISTING, FILE_FLAG_SEQUENTIAL_SCAN, NULL)\\n\\n if (hFile == INVALID_HANDLE_VALUE) then\\n dwStatus = GetLastError()\\n print *, \\\"CreateFile failed.\\\"\\n return\\n end if\\n\\n if (CryptAcquireContext(hProv, NULL, NULL, PROV_RSA_FULL, &\\n CRYPT_VERIFYCONTEXT) == FALSE) then\\n dwStatus = GetLastError()\\n print *, \\\"CryptAcquireContext failed.\\\"\\n goto 3\\n end if\\n\\n if (CryptCreateHash(hProv, CALG_MD5, 0_ULONG_PTR, 0_DWORD, hHash) == FALSE) then\\n dwStatus = GetLastError()\\n print *, \\\"CryptCreateHash failed.\\\"\\n go to 2\\n end if\\n\\n do\\n status = ReadFile(hFile, loc(buffer), BUFLEN, nRead, NULL)\\n if (status == FALSE .or. nRead == 0) exit\\n filesize = filesize + nRead\\n if (CryptHashData(hHash, buffer, nRead, 0) == FALSE) then\\n dwStatus = GetLastError()\\n print *, \\\"CryptHashData failed.\\\"\\n go to 1\\n end if\\n end do\\n\\n if (status == FALSE) then\\n dwStatus = GetLastError()\\n print *, \\\"ReadFile failed.\\\"\\n go to 1\\n end if\\n\\n nRead = MD5LEN\\n if (CryptGetHashParam(hHash, HP_HASHVAL, hash, nRead, 0) == FALSE) then\\n dwStatus = GetLastError()\\n print *, \\\"CryptGetHashParam failed.\\\", status, nRead, dwStatus\\n end if\\n\\n 1 status = CryptDestroyHash(hHash)\\n 2 status = CryptReleaseContext(hProv, 0)\\n 3 status = CloseHandle(hFile)\\n end subroutine\\nend module\\n\\nprogram md5\\n use md5_mod\\n implicit none\\n integer :: n, m, i, j\\n character(:), allocatable :: name\\n integer(DWORD) :: dwStatus\\n integer(BYTE) :: hash(MD5LEN)\\n integer(UINT64) :: filesize\\n\\n n = command_argument_count()\\n do i = 1, n\\n call get_command_argument(i, length=m)\\n allocate(character(m) :: name)\\n call get_command_argument(i, name)\\n call md5hash(name, hash, dwStatus, filesize)\\n if (dwStatus == 0) then\\n do j = 1, MD5LEN\\n write(*, \\\"(Z2.2)\\\", advance=\\\"NO\\\") hash(j)\\n end do\\n write(*, \\\"(' ',A,' (',G0,' bytes)')\\\") name, filesize\\n end if\\n deallocate(name)\\n end do\\nend program\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"println[messageDigest[\\\"The quick brown fox\\\", \\\"MD5\\\"]]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"type md5 = (u32, u32, u32, u32)\\n\\nfun rs(): [64]u32 =\\n map u32\\n ([ 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21 ])\\n\\nfun ks(): [64]u32 =\\n map u32\\n ([ 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee ,\\n 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501 ,\\n 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be ,\\n 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821 ,\\n 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa ,\\n 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8 ,\\n 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed ,\\n 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a ,\\n 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c ,\\n 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70 ,\\n 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05 ,\\n 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665 ,\\n 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039 ,\\n 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1 ,\\n 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1 ,\\n 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391 ])\\n\\nfun md5(ms: [n][16]u32): md5 =\\n let a0 = u32(0x67452301)\\n let b0 = u32(0xefcdab89)\\n let c0 = u32(0x98badcfe)\\n let d0 = u32(0x10325476)\\n loop ((a0,b0,c0,d0)) = for i < n do\\n let (a,b,c,d) = md5_chunk (a0,b0,c0,d0) ms[i]\\n in (a0+a, b0+b, c0+c, d0+d)\\n in (a0,b0,c0,d0)\\n\\nfun rotate_left(x: u32, c: u32): u32 = (x << c) | (x >> (32u32 - c))\\n\\nfun bytes(x: u32): [4]u8 = [u8(x),\\n u8(x/0x100u32),\\n u8(x/0x10000u32),\\n u8(x/0x1000000u32)]\\n\\nfun unbytes(bs: [4]u8): u32 =\\n u32(bs[0]) +\\n u32(bs[1]) * 0x100u32 +\\n u32(bs[2]) * 0x10000u32 +\\n u32(bs[3]) * 0x1000000u32\\n\\nfun unbytes_block(block: [64]u8): [16]u32 =\\n map unbytes (reshape (16,4) block)\\n\\nfun main(ms: [n]u8): [16]u8 =\\n let padding = 64 - (n % 64)\\n let n_padded = n + padding\\n let ms_padded = concat ms (bytes 0x80u32) (replicate (padding-12) 0x0u8) (bytes (u32(n*8))) ([0u8,0u8,0u8,0u8])\\n let (a,b,c,d) = md5 (map unbytes_block (reshape (n_padded / 64, 64) ms_padded))\\n in reshape 16 (map bytes ([a,b,c,d]))\\n\\n-- Process 512 bits of the input.\\nfun md5_chunk ((a0,b0,c0,d0): md5) (m: [16]u32): md5 =\\n loop ((a,b,c,d) = (a0,b0,c0,d0)) = for i < 64 do\\n let (f,g) =\\n if i < 16 then ((b & c) | ((~b) & d),\\n i)\\n else if i < 32 then ((d & b) | ((~d) & c),\\n i32((5u32*u32(i) + 1u32) % 16u32))\\n else if i < 48 then (b ^ c ^ d,\\n i32((3u32*u32(i) + 5u32) % 16u32))\\n else (c ^ (b | (~d)),\\n i32((7u32*u32(i)) % 16u32))\\n in (d, b + rotate_left(a + f + (ks())[i] + m[g], (rs())[i]), b, c)\\n in (a,b,c,d)\\n\",\n \"language\": \"Futhark\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"crypto/md5\\\"\\n \\\"fmt\\\"\\n)\\n\\nfunc main() {\\n for _, p := range [][2]string{\\n // RFC 1321 test cases\\n {\\\"d41d8cd98f00b204e9800998ecf8427e\\\", \\\"\\\"},\\n {\\\"0cc175b9c0f1b6a831c399e269772661\\\", \\\"a\\\"},\\n {\\\"900150983cd24fb0d6963f7d28e17f72\\\", \\\"abc\\\"},\\n {\\\"f96b697d7cb7938d525a2f31aaf161d0\\\", \\\"message digest\\\"},\\n {\\\"c3fcd3d76192e4007dfb496cca67e13b\\\", \\\"abcdefghijklmnopqrstuvwxyz\\\"},\\n {\\\"d174ab98d277d9f5a5611c2c9f419d9f\\\",\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"},\\n {\\\"57edf4a22be3c955ac49da2e2107b67a\\\", \\\"12345678901234567890\\\" +\\n \\\"123456789012345678901234567890123456789012345678901234567890\\\"},\\n // test case popular with other RC solutions\\n {\\\"e38ca1d920c4b8b8d3946b2c72f01680\\\",\\n \\\"The quick brown fox jumped over the lazy dog's back\\\"},\\n } {\\n validate(p[0], p[1])\\n }\\n}\\n\\nvar h = md5.New()\\n\\nfunc validate(check, s string) {\\n h.Reset()\\n h.Write([]byte(s))\\n sum := fmt.Sprintf(\\\"%x\\\", h.Sum(nil))\\n if sum != check {\\n fmt.Println(\\\"MD5 fail\\\")\\n fmt.Println(\\\" for string,\\\", s)\\n fmt.Println(\\\" expected: \\\", check)\\n fmt.Println(\\\" got: \\\", sum)\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import java.security.MessageDigest\\n\\nString.metaClass.md5Checksum = {\\n MessageDigest.getInstance('md5').digest(delegate.bytes).collect { String.format(\\\"%02x\\\", it) }.join('')\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"assert 'The quick brown fox jumps over the lazy dog'.md5Checksum() == '9e107d9d372bb6826bd81d3542a419d6'\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Data.Digest.OpenSSL.MD5 (md5sum)\\nimport Data.ByteString (pack)\\nimport Data.Char (ord)\\n\\nmain = do\\n let message = \\\"The quick brown fox jumped over the lazy dog's back\\\"\\n digest = (md5sum . pack . map (fromIntegral . ord)) message\\n putStrLn digest\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"#!/usr/bin/env runhaskell\\n\\nimport Data.ByteString.Char8 (pack)\\nimport System.Environment (getArgs)\\nimport Crypto.Hash\\n\\nmain :: IO ()\\nmain = print . md5 . pack . unwords =<< getArgs\\n where md5 x = hash x :: Digest MD5\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import haxe.crypto.Md5;\\n\\nclass Main {\\n static function main() {\\t\\n var md5 = Md5.encode(\\\"The quick brown fox jumped over the lazy dog's back\\\");\\n Sys.println(md5);\\n }\\n}\\n\",\n \"language\": \"Haxe\"\n },\n {\n \"code\": \"procedure main() # validate against the RFC test strings and more\\n testMD5(\\\"The quick brown fox jumps over the lazy dog\\\", 16r9e107d9d372bb6826bd81d3542a419d6)\\n testMD5(\\\"The quick brown fox jumps over the lazy dog.\\\", 16re4d909c290d0fb1ca068ffaddf22cbd0)\\n testMD5(\\\"\\\", 16rd41d8cd98f00b204e9800998ecf8427e)\\nend\\n\\nprocedure testMD5(s,rh) # compute the MD5 hash and compare it to reference value\\n write(\\\"Message(length=\\\",*s,\\\") = \\\",image(s))\\n write(\\\"Digest = \\\",hexstring(h := MD5(s)),if h = rh then \\\" matches reference hash\\\" else (\\\" does not match reference hash = \\\" || hexstring(rh)),\\\"\\\\n\\\")\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"Io> MD5\\n==> MD5_0x97663e0:\\n appendSeq = MD5_appendSeq()\\n md5 = MD5_md5()\\n md5String = MD5_md5String()\\nIo> MD5 clone appendSeq(\\\"The quick brown fox jumped over the lazy dog's back\\\") md5String\\n==> e38ca1d920c4b8b8d3946b2c72f01680\\n\",\n \"language\": \"Io\"\n },\n {\n \"code\": \" require 'convert/misc/md5'\\n md5 'The quick brown fox jumped over the lazy dog''s back'\\ne38ca1d920c4b8b8d3946b2c72f01680\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"require 'convert'\\n\\n'`lt gt ge xor'=: (20 b.)`(18 b.)`(27 b.)`(22 b.)\\n'`and or sh'=: (17 b.)`(23 b.)`(33 b.)\\n\\n{{\\nif. IF64 do.\\nrot=: (16bffffffff and sh or ] sh~ 32 -~ [) NB. (y << x) | (y >>> (32 - x))\\nadd=: ((16bffffffff&and)@+)\\\"0\\nelse.\\nrot=: (32 b.)\\nadd=: (+&(_16&sh) (16&sh@(+ _16&sh) or and&65535@]) +&(and&65535))\\\"0\\nend.\\nEMPTY\\n}}''\\n\\nhexlist=: tolower@:,@:hfd@:,@:(|.\\\"1)@(256 256 256 256&#:)\\n\\ncmn=: {{\\n'x s t'=. x [ 'q a b'=. y\\nb add s rot (a add q) add (x add t)\\n}}\\n\\nff=: cmn (((1&{ and 2&{) or 1&{ lt 3&{) , 2&{.)\\ngg=: cmn (((1&{ and 3&{) or 2&{ gt 3&{) , 2&{.)\\nhh=: cmn (((1&{ xor 2&{)xor 3&{ ) , 2&{.)\\nii=: cmn (( 2&{ xor 1&{ ge 3&{ ) , 2&{.)\\nop=: ff`gg`hh`ii\\n\\nI=: \\\".;._2{{)n\\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15\\n1 6 11 0 5 10 15 4 9 14 3 8 13 2 7 12\\n5 8 11 14 1 4 7 10 13 0 3 6 9 12 15 2\\n0 7 14 5 12 3 10 1 8 15 6 13 4 11 2 9\\n}}\\nS=: 4 4$7 12 17 22 5 9 14 20 4 11 16 23 6 10 15 21\\n\\nT=: |:\\\".;._2{{)n\\n _680876936 _165796510 _378558 _198630844\\n _389564586 _1069501632 _2022574463 1126891415\\n 606105819 643717713 1839030562 _1416354905\\n_1044525330 _373897302 _35309556 _57434055\\n _176418897 _701558691 _1530992060 1700485571\\n 1200080426 38016083 1272893353 _1894986606\\n_1473231341 _660478335 _155497632 _1051523\\n _45705983 _405537848 _1094730640 _2054922799\\n 1770035416 568446438 681279174 1873313359\\n_1958414417 _1019803690 _358537222 _30611744\\n _42063 _187363961 _722521979 _1560198380\\n_1990404162 1163531501 76029189 1309151649\\n 1804603682 _1444681467 _640364487 _145523070\\n _40341101 _51403784 _421815835 _1120210379\\n_1502002290 1735328473 530742520 718787259\\n 1236535329 _1926607734 _995338651 _343485551\\n}}\\n\\nnorm=: {{\\nN=. 16 * 1 + _6 sh 8 + #y\\nb=. N#0 [ y=. a.i.y\\nfor_i. i. #y do.\\n b=. ((j { b) or (8*4|i) sh i{y) (j=. _2 sh i) } b\\nend.\\nb=. ((j { b) or (8*4|i) sh 128) (j=._2 sh i=.#y) } b\\n_16]\\\\ (8 * #y) (N-2) } b\\n}}\\n\\nmd5=: {{\\nX=. norm y\\nq=. r=. 1732584193 _271733879 _1732584194 271733878\\nfor_k. X do.\\n for_j. i.4 do.\\n l=. ((j{I){k) ,. (16$j{S) ,. j{T\\n for_i. i.16 do.\\n r=. _1|.((i{l) (op@.j) r),}.r\\n end.\\n end.\\n q=. r=. r add q\\nend.\\nhexlist r\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" require '~addons/ide/qt/qt.ijs'\\n getmd5=: 'md5'&gethash_jqtide_\\n getmd5 'The quick brown fox jumped over the lazy dog''s back'\\ne38ca1d920c4b8b8d3946b2c72f01680\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.nio.charset.StandardCharsets;\\nimport java.security.MessageDigest;\\nimport java.security.NoSuchAlgorithmException;\\n\\npublic class Digester {\\n\\n public static void main(String[] args) {\\n System.out.println(hexDigest(\\\"Rosetta code\\\", \\\"MD5\\\"));\\n }\\n\\n static String hexDigest(String str, String digestName) {\\n try {\\n MessageDigest md = MessageDigest.getInstance(digestName);\\n byte[] digest = md.digest(str.getBytes(StandardCharsets.UTF_8));\\n char[] hex = new char[digest.length * 2];\\n for (int i = 0; i < digest.length; i++) {\\n hex[2 * i] = \\\"0123456789abcdef\\\".charAt((digest[i] & 0xf0) >> 4);\\n hex[2 * i + 1] = \\\"0123456789abcdef\\\".charAt(digest[i] & 0x0f);\\n }\\n return new String(hex);\\n } catch (NoSuchAlgorithmException e) {\\n throw new IllegalStateException(e);\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"/* MD5 hash in Jsish */\\nvar str = 'Rosetta code';\\nputs(Util.hash(str, {type:'md5'}));\\n\\n/* MD5 RFC1321 test suite */\\nfunction MD5(str) { return Util.hash(str, {type:'md5'}); }\\n\\n;MD5('');\\n;MD5('a');\\n;MD5('abc');\\n;MD5('message digest');\\n;MD5('abcdefghijklmnopqrstuvwxyz');\\n;MD5('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789');\\n;MD5('12345678901234567890123456789012345678901234567890123456789012345678901234567890');\\n\\n/*\\n=!EXPECTSTART!=\\nbf0ac9c7e94e9d50c18f4ff592643546\\nMD5('') ==> d41d8cd98f00b204e9800998ecf8427e\\nMD5('a') ==> 0cc175b9c0f1b6a831c399e269772661\\nMD5('abc') ==> 900150983cd24fb0d6963f7d28e17f72\\nMD5('message digest') ==> f96b697d7cb7938d525a2f31aaf161d0\\nMD5('abcdefghijklmnopqrstuvwxyz') ==> c3fcd3d76192e4007dfb496cca67e13b\\nMD5('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789') ==> d174ab98d277d9f5a5611c2c9f419d9f\\nMD5('12345678901234567890123456789012345678901234567890123456789012345678901234567890') ==> 57edf4a22be3c955ac49da2e2107b67a\\n=!EXPECTEND!=\\n*/\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"using Nettle\\n\\nfunction Base.trunc(s::AbstractString, n::Integer)\\n n > 0 || throw(DomainError())\\n l = length(s)\\n l > n || return s\\n n > 3 || return s[1:n]\\n return s[1:n-3] * \\\"...\\\"\\nend\\n\\ntests = [\\\"\\\" => \\\"d41d8cd98f00b204e9800998ecf8427e\\\",\\n \\\"a\\\" => \\\"0cc175b9c0f1b6a831c399e269772661\\\",\\n \\\"abc\\\" => \\\"900150983cd24fb0d6963f7d28e17f72\\\",\\n \\\"message digest\\\" => \\\"f96b697d7cb7938d525a2f31aaf161d0\\\",\\n \\\"abcdefghijklmnopqrstuvwxyz\\\" => \\\"c3fcd3d76192e4007dfb496cca67e13b\\\",\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\" =>\\n \\\"d174ab98d277d9f5a5611c2c9f419d9f\\\",\\n \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\" =>\\n \\\"57edf4a22be3c955ac49da2e2107b67a\\\",\\n \\\"foobad\\\" => \\\"3858f62230ac3c915f300c664312c63f\\\"]\\n\\nprintln(\\\"Testing Julia's MD5 hash against RFC 1321.\\\")\\nfor (k, h) in sort(tests, by = length ∘ first)\\n md5sum = hexdigest(\\\"md5\\\", k)\\n @printf(\\\"%20s → %s \\\", trunc(k, 15), md5sum)\\n if md5sum == h\\n println(\\\"MD5 OK\\\")\\n else\\n println(\\\"MD5 Bad\\\")\\n println(\\\"* The sum should be \\\", h)\\n end\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nimport java.security.MessageDigest\\n\\nfun main(args: Array<String>) {\\n val text = \\\"The quick brown fox jumped over the lazy dog's back\\\"\\n val bytes = text.toByteArray()\\n val md = MessageDigest.getInstance(\\\"MD5\\\")\\n val digest = md.digest(bytes)\\n for (byte in digest) print(\\\"%02x\\\".format(byte))\\n println()\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"Encrypt_MD5('Welcome all Rhinos!')\\n//80ba88ee2600e9e9b36e739458c39ebd\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"local(test = map(\\n\\t\\t'a' = '0cc175b9c0f1b6a831c399e269772661',\\n\\t\\t'abc' = '900150983cd24fb0d6963f7d28e17f72',\\n\\t\\t'message digest' = 'f96b697d7cb7938d525a2f31aaf161d0',\\n\\t\\t'abcdefghijklmnopqrstuvwxyz' = 'c3fcd3d76192e4007dfb496cca67e13b',\\n\\t\\t'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789' = 'd174ab98d277d9f5a5611c2c9f419d9f',\\n\\t\\t'12345678901234567890123456789012345678901234567890123456789012345678901234567890' = '57edf4a22be3c955ac49da2e2107b67a'\\n\\t)\\n)\\nwith a in #test->keys do => {^\\n\\t'testing: \\\"'+#a+'\\\": '+(Encrypt_MD5(#a)->asBytes == #test->find(#a)->asBytes)+'\\\\r'\\n^}\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"'[RC]MD5\\n 'from tsh73's January 2008 code\\n\\n text$=\\\"The quick brown fox jumps over the lazy dog\\\"\\n checkSum$=\\\"9e107d9d372bb6826bd81d3542a419d6\\\"\\n\\n print text$\\n print checkSum$\\n\\n test$=md5$(text$)\\n\\n if test$=checkSum$ then\\n print \\\"passed\\\"\\n print test$\\n else\\n print \\\"failed\\\"\\n end if\\n end\\n\\n function md5$(text$)\\n\\n dim r(64)\\n dim k(64)\\n dim w(16)\\n global two32\\n two32=2^32\\n\\n 'prepare the MD5 checksum table\\n restore [perRoundShiftAmounts]\\n for i=0 to 63\\n read x\\n r(i)=x\\n next\\n\\n 'prepare constants\\n for i=0 to 63\\n k(i) = int(abs(sin(i+1)) * two32)\\n next\\n\\n 'initialise variables\\n h0 = HEXDEC(\\\"67452301\\\")\\n h1 = HEXDEC(\\\"EFCDAB89\\\")\\n h2 = HEXDEC(\\\"98BADCFE\\\")\\n h3 = HEXDEC(\\\"10325476\\\")\\n\\n 'find num bits in message\\n numbits=len(text$)*8\\n\\n 'add bits \\\"10000000\\\"\\n text$=text$+chr$(128)\\n\\n 'add bits \\\"00000000\\\"\\n while len(text$) mod 64 <> 56\\n text$=text$+chr$(0)\\n wend\\n\\n 'add original length in bits\\n text$=text$+dec2asc$(numbits)\\n\\n 'MD5 rounds\\n 'process in 64 byte chunks 512bits\\n for chunk = 1 to len(text$) step 64\\n chunk$ = mid$(text$, chunk, 64)\\n for word = 0 TO 15\\n 'invert byte order\\n b0 = asc(mid$(chunk$, word*4+1, 1))\\n b1 = asc(mid$(chunk$, word*4+2, 1))\\n b2 = asc(mid$(chunk$, word*4+3, 1))\\n b3 = asc(mid$(chunk$, word*4+4, 1))\\n w(word) = ((b3*256+b2)*256+b1)*256+b0\\n next word\\n a = h0\\n b = h1\\n c = h2\\n d = h3\\n for i = 0 to 63\\n select case\\n case 0 <= i and i <= 15\\n f = (b and c) or (bitNot(b) and d)\\n g = i\\n case 16 <= i and i <= 31\\n f = (d and b) or (bitNot(d) and c)\\n g = (5 * i + 1) mod 16\\n case 32 <= i and i <= 47\\n f = b xor c xor d\\n g = (3 * i + 5) mod 16\\n case 48 <= i and i <= 63\\n f = c xor (b or bitNot(d))\\n g = (7 * i) mod 16\\n end select\\n temp = d\\n d = c\\n c = b\\n b=b+leftrotate(a + f + k(i) + w(g),r(i))\\n b = b mod two32\\n a = temp\\n next i\\n h0 = (h0 + a) mod two32\\n h1 = (h1 + b) mod two32\\n h2 = (h2 + c) mod two32\\n h3 = (h3 + d) mod two32\\n next chunk\\n\\n md5$ = revOrd$(DECHEX$(h0))+_\\n revOrd$(DECHEX$(h1))+_\\n revOrd$(DECHEX$(h2))+_\\n revOrd$(DECHEX$(h3))\\n\\n [perRoundShiftAmounts]\\n DATA 7,12,17,22, 7,12,17,22, 7,12,17,22, 7,12,17,22\\n DATA 5, 9,14,20, 5, 9,14,20, 5, 9,14,20, 5, 9,14,20\\n DATA 4,11,16,23, 4,11,16,23, 4,11,16,23, 4,11,16,23\\n DATA 6,10,15,21, 6,10,15,21, 6,10,15,21, 6,10,15,21\\n\\n end function\\n\\n\\n ' dec2asc: dec to 8 byte asc\\n function dec2asc$(n)\\n h$ = \\\"\\\"\\n for i = 1 to 8\\n h$ = h$ + chr$(n mod 256)\\n n = int(n/256)\\n next\\n dec2asc$= h$\\n end function\\n\\n ' bitNot\\n function bitNot(num)\\n bitNot = two32 -1 -num\\n end function\\n\\n ' leftrotate: spins bits left n times\\n function leftrotate(num,times)\\n num=num mod two32\\n r = (num*2^times) mod two32\\n l = int(num/(2^(32-times)))\\n leftrotate = r+l\\n end function\\n\\n ' reverse the HEXDEC$ order\\n function revOrd$(a$)\\n a$=left$(\\\"00000000\\\", 8-len(a$))+a$\\n revOrd$ = lower$(mid$(a$,7,2)+mid$(a$,5,2)+mid$(a$,3,2)+mid$(a$,1,2))\\n end function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"put cx_md5_string(str)\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"----------------------------------------\\n-- Calculates MD5 hash of string or bytearray\\n-- @param {bytearray|string} input\\n-- @return {bytearray} (16 bytes)\\n----------------------------------------\\non md5 (input)\\n if stringP(input) then input = bytearray(input)\\n\\n -- Convert string to list of little-endian words...\\n t_iLen = input.length * 8\\n t_iCnt = (t_iLen + 64) / 512 * 16 + 16\\n\\n -- Create list, fill with zeros...\\n x = []\\n x[t_iCnt] = 0\\n\\n t_fArr = [1, 256, 65536, 16777216]\\n i = 0\\n j = 0\\n repeat while i < t_iLen\\n j = j + 1\\n t_iNext = i / 32 + 1\\n t_iTemp = bitAnd(input[i/8+1], 255) * t_fArr[j]\\n x[t_iNext] = bitOr(x[t_iNext], t_iTemp)\\n i = i + 8\\n j = j mod 4\\n end repeat\\n\\n -- Append padding...\\n t_iNext = t_iLen / 32 + 1\\n x[t_iNext] = bitOr(x[t_iNext], 128 * t_fArr[j + 1])\\n x[(t_iLen + 64) / 512 * 16 + 15] = t_iLen\\n\\n -- Actual algorithm starts here...\\n a = 1732584193\\n b = -271733879\\n c = -1732584194\\n d = 271733878\\n i = 1\\n t_iWrap = the maxInteger + 1\\n t_iCount = x.count + 1\\n\\n repeat while i < t_iCount\\n olda = a\\n oldb = b\\n oldc = c\\n oldd = d\\n\\n -- Round(1) --\\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i] - 680876936\\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\\n else a = bitOr(n * 128, n / 33554432) + b\\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 1] - 389564586\\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\\n else d = bitOr(n * 4096, n / 1048576) + a\\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 2] + 606105819\\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\\n else c = bitOr(n * 131072, n / 32768) + d\\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 3] - 1044525330\\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\\n else b = bitOr(n * 4194304, n / 1024) + c\\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i + 4] - 176418897\\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\\n else a = bitOr(n * 128, n / 33554432) + b\\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 5] + 1200080426\\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\\n else d = bitOr(n * 4096, n / 1048576) + a\\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 6] - 1473231341\\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\\n else c = bitOr(n * 131072, n / 32768) + d\\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 7] - 45705983\\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\\n else b = bitOr(n * 4194304, n / 1024) + c\\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i + 8] + 1770035416\\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\\n else a = bitOr(n * 128, n / 33554432) + b\\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 9] - 1958414417\\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\\n else d = bitOr(n * 4096, n / 1048576) + a\\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 10] - 42063\\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\\n else c = bitOr(n * 131072, n / 32768) + d\\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 11] - 1990404162\\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\\n else b = bitOr(n * 4194304, n / 1024) + c\\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i + 12] + 1804603682\\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\\n else a = bitOr(n * 128, n / 33554432) + b\\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 13] - 40341101\\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\\n else d = bitOr(n * 4096, n / 1048576) + a\\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 14] - 1502002290\\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\\n else c = bitOr(n * 131072, n / 32768) + d\\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 15] + 1236535329\\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\\n else b = bitOr(n * 4194304, n / 1024) + c\\n\\n -- Round(2) --\\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 1] - 165796510\\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\\n else a = bitOr(n * 32, n / 134217728) + b\\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 6] - 1069501632\\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\\n else d = bitOr(n * 512, n / 8388608) + a\\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 11] + 643717713\\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\\n else c = bitOr(n * 16384, n / 262144) + d\\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i] - 373897302\\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\\n else b = bitOr(n * 1048576, n / 4096) + c\\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 5] - 701558691\\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\\n else a = bitOr(n * 32, n / 134217728) + b\\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 10] + 38016083\\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\\n else d = bitOr(n * 512, n / 8388608) + a\\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 15] - 660478335\\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\\n else c = bitOr(n * 16384, n / 262144) + d\\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i + 4] - 405537848\\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\\n else b = bitOr(n * 1048576, n / 4096) + c\\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 9] + 568446438\\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\\n else a = bitOr(n * 32, n / 134217728) + b\\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 14] - 1019803690\\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\\n else d = bitOr(n * 512, n / 8388608) + a\\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 3] - 187363961\\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\\n else c = bitOr(n * 16384, n / 262144) + d\\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i + 8] + 1163531501\\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\\n else b = bitOr(n * 1048576, n / 4096) + c\\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 13] - 1444681467\\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\\n else a = bitOr(n * 32, n / 134217728) + b\\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 2] - 51403784\\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\\n else d = bitOr(n * 512, n / 8388608) + a\\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 7] + 1735328473\\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\\n else c = bitOr(n * 16384, n / 262144) + d\\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i + 12] - 1926607734\\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\\n else b = bitOr(n * 1048576, n / 4096) + c\\n\\n -- Round(3) --\\n n = bitXor(bitXor(b, c), d) + a + x[i + 5] - 378558\\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\\n else a = bitOr(n * 16, n / 268435456) + b\\n n = bitXor(bitXor(a, b), c) + d + x[i + 8] - 2022574463\\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\\n else d = bitOr(n * 2048, n / 2097152) + a\\n n = bitXor(bitXor(d, a), b) + c + x[i + 11] + 1839030562\\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\\n else c = bitOr(n * 65536, n / 65536) + d\\n n = bitXor(bitXor(c, d), a) + b + x[i + 14] - 35309556\\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\\n else b = bitOr(n * 8388608, n / 512) + c\\n n = bitXor(bitXor(b, c), d) + a + x[i + 1] - 1530992060\\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\\n else a = bitOr(n * 16, n / 268435456) + b\\n n = bitXor(bitXor(a, b), c) + d + x[i + 4] + 1272893353\\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\\n else d = bitOr(n * 2048, n / 2097152) + a\\n n = bitXor(bitXor(d, a), b) + c + x[i + 7] - 155497632\\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\\n else c = bitOr(n * 65536, n / 65536) + d\\n n = bitXor(bitXor(c, d), a) + b + x[i + 10] - 1094730640\\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\\n else b = bitOr(n * 8388608, n / 512) + c\\n n = bitXor(bitXor(b, c), d) + a + x[i + 13] + 681279174\\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\\n else a = bitOr(n * 16, n / 268435456) + b\\n n = bitXor(bitXor(a, b), c) + d + x[i] - 358537222\\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\\n else d = bitOr(n * 2048, n / 2097152) + a\\n n = bitXor(bitXor(d, a), b) + c + x[i + 3] - 722521979\\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\\n else c = bitOr(n * 65536, n / 65536) + d\\n n = bitXor(bitXor(c, d), a) + b + x[i + 6] + 76029189\\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\\n else b = bitOr(n * 8388608, n / 512) + c\\n n = bitXor(bitXor(b, c), d) + a + x[i + 9] - 640364487\\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\\n else a = bitOr(n * 16, n / 268435456) + b\\n n = bitXor(bitXor(a, b), c) + d + x[i + 12] - 421815835\\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\\n else d = bitOr(n * 2048, n / 2097152) + a\\n n = bitXor(bitXor(d, a), b) + c + x[i + 15] + 530742520\\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\\n else c = bitOr(n * 65536, n / 65536) + d\\n n = bitXor(bitXor(c, d), a) + b + x[i + 2] - 995338651\\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\\n else b = bitOr(n * 8388608, n / 512) + c\\n\\n -- Round(4) --\\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i] - 198630844\\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\\n else a = bitOr(n * 64, n / 67108864) + b\\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 7] + 1126891415\\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\\n else d = bitOr(n * 1024, n / 4194304) + a\\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 14] - 1416354905\\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\\n else c = bitOr(n * 32768, n / 131072) + d\\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 5] - 57434055\\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\\n else b = bitOr(n * 2097152, n / 2048) + c\\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i + 12] + 1700485571\\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\\n else a = bitOr(n * 64, n / 67108864) + b\\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 3] - 1894986606\\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\\n else d = bitOr(n * 1024, n / 4194304) + a\\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 10] - 1051523\\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\\n else c = bitOr(n * 32768, n / 131072) + d\\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 1] - 2054922799\\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\\n else b = bitOr(n * 2097152, n / 2048) + c\\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i + 8] + 1873313359\\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\\n else a = bitOr(n * 64, n / 67108864) + b\\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 15] - 30611744\\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\\n else d = bitOr(n * 1024, n / 4194304) + a\\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 6] - 1560198380\\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\\n else c = bitOr(n * 32768, n / 131072) + d\\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 13] + 1309151649\\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\\n else b = bitOr(n * 2097152, n / 2048) + c\\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i + 4] - 145523070\\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\\n else a = bitOr(n * 64, n / 67108864) + b\\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 11] - 1120210379\\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\\n else d = bitOr(n * 1024, n / 4194304) + a\\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 2] + 718787259\\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\\n else c = bitOr(n * 32768, n / 131072) + d\\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 9] - 343485551\\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\\n else b = bitOr(n * 2097152, n / 2048) + c\\n a = a + olda\\n b = b + oldb\\n c = c + oldc\\n d = d + oldd\\n i = i + 16\\n end repeat\\n\\n t_iArr = [a, b, c, d]\\n ba = bytearray()\\n p = 1\\n repeat with i in t_iArr\\n if(i > 0) then\\n repeat with n = 1 to 4\\n ba[p] = (i mod 256)\\n i = i / 256\\n p = p+1\\n end repeat\\n else\\n i = bitNot(i)\\n repeat with n = 1 to 4\\n ba[p] = 255-(i mod 256)\\n i = i / 256\\n p = p+1\\n end repeat\\n end if\\n end repeat\\n ba.position = 1\\n return ba\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"function md5sum hashtext\\n local md5, mdhex\\n put md5Digest(hashtext) into md5\\n get binaryDecode(\\\"H*\\\",md5,mdhex)\\n return mdhex\\nend md5sum\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"command md5testsuite\\n // rfc1321 MD5 test suite:\\n local md5\\n put md5sum(\\\"\\\") is \\\"d41d8cd98f00b204e9800998ecf8427e\\\" into md5[\\\"empty\\\"]\\n put md5sum(\\\"a\\\") is \\\"0cc175b9c0f1b6a831c399e269772661\\\" into md5[\\\"a\\\"]\\n put md5sum(\\\"abc\\\") is \\\"900150983cd24fb0d6963f7d28e17f72\\\" into md5[\\\"abc\\\"]\\n put md5sum(\\\"message digest\\\") is \\\"f96b697d7cb7938d525a2f31aaf161d0\\\" into md5[\\\"message digest\\\"]\\n put md5sum(\\\"abcdefghijklmnopqrstuvwxyz\\\") is \\\"c3fcd3d76192e4007dfb496cca67e13b\\\" \\\\\\n into md5[\\\"abclower\\\"]\\n put md5sum(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\") \\\\\\n is \\\"d174ab98d277d9f5a5611c2c9f419d9f\\\" into md5[\\\"abcupper\\\"]\\n put md5sum(\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\")\\\\\\n is \\\"57edf4a22be3c955ac49da2e2107b67a\\\" into md5[\\\"123\\\"]\\n\\n repeat for each line n in the keys of md5\\n if md5[n] is not true then\\n put \\\"err\\\" & tab & n & return after results\\n exit repeat\\n else\\n put \\\"ok\\\" & tab & n & return after results\\n end if\\n end repeat\\n put results\\nend md5testsuite\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"require \\\"md5\\\"\\n\\n--printing a sum:\\nprint(md5.sumhexa\\\"The quick brown fox jumps over the lazy dog\\\")\\n\\n--running the test suite:\\n\\nlocal function test(msg,sum) assert(md5.sumhexa(msg)==sum) end\\n\\ntest(\\\"\\\",\\\"d41d8cd98f00b204e9800998ecf8427e\\\")\\ntest(\\\"a\\\",\\\"0cc175b9c0f1b6a831c399e269772661\\\")\\ntest(\\\"abc\\\",\\\"900150983cd24fb0d6963f7d28e17f72\\\")\\ntest(\\\"message digest\\\",\\\"f96b697d7cb7938d525a2f31aaf161d0\\\")\\ntest(\\\"abcdefghijklmnopqrstuvwxyz\\\",\\\"c3fcd3d76192e4007dfb496cca67e13b\\\")\\ntest(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\",\\\"d174ab98d277d9f5a5611c2c9f419d9f\\\")\\ntest(\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\",\\\"57edf4a22be3c955ac49da2e2107b67a\\\")\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"> with( StringTools ):\\n> Hash( \\\"\\\" );\\n \\\"d41d8cd98f00b204e9800998ecf8427e\\\"\\n\\n> Hash( \\\"a\\\" );\\n \\\"0cc175b9c0f1b6a831c399e269772661\\\"\\n\\n> Hash( \\\"abc\\\" );\\n \\\"900150983cd24fb0d6963f7d28e17f72\\\"\\n\\n> Hash( \\\"message digest\\\" );\\n \\\"f96b697d7cb7938d525a2f31aaf161d0\\\"\\n\\n> Hash( \\\"abcdefghijklmnopqrstuvwxyz\\\" );\\n \\\"c3fcd3d76192e4007dfb496cca67e13b\\\"\\n\\n> Hash( \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\" );\\n \\\"d174ab98d277d9f5a5611c2c9f419d9f\\\"\\n\\n> Hash( \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\" );\\n \\\"57edf4a22be3c955ac49da2e2107b67a\\\"\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \" Hash[\\\"The quick brown fox jumped over the lazy dog's back\\\",\\\"MD5\\\",\\\"HexString\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \" e38ca1d920c4b8b8d3946b2c72f01680\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function digest = md5(message)\\n % digest = md5(message)\\n % Compute the MD5 digest of the message, as a hexadecimal digest.\\n\\n % Follow the MD5 algorithm from RFC 1321 [1] and Wikipedia [2].\\n % [1] http://tools.ietf.org/html/rfc1321\\n % [2] http://en.wikipedia.org/wiki/MD5\\n\\n % m is the modulus for 32-bit unsigned arithmetic.\\n m = 2 ^ 32;\\n\\n % s is the shift table for circshift(). Each shift is negative\\n % because it is a left shift.\\n s = [-7, -12, -17, -22\\n -5, -9, -14, -20\\n -4, -11, -16, -23\\n -6, -10, -15, -21];\\n\\n % t is the sine table. Each sine is a 32-bit integer, unsigned.\\n t = floor(abs(sin(1:64)) .* m);\\n\\n % Initialize the hash, as a row vector of 32-bit integers.\\n digest = [hex2dec('67452301') ...\\n hex2dec('EFCDAB89') ...\\n hex2dec('98BADCFE') ...\\n hex2dec('10325476')];\\n\\n % If message contains characters, convert them to ASCII values.\\n message = double(message);\\n bytelen = numel(message);\\n\\n % Pad the message by appending a 1, then appending enough 0s to make\\n % the bit length congruent to 448 mod 512. Because we have bytes, we\\n % append 128 '10000000', then append enough 0s '00000000's to make\\n % the byte length congruent to 56 mod 64.\\n message = [message, 128, zeros(1, mod(55 - bytelen, 64))];\\n\\n % Convert the message to 32-bit integers, little endian.\\n % For little endian, first byte is least significant byte.\\n message = reshape(message, 4, numel(message) / 4);\\n message = message(1,:) + ... % least significant byte\\n message(2,:) * 256 + ...\\n message(3,:) * 65536 + ...\\n message(4,:) * 16777216; % most significant byte\\n\\n % Append the bit length as a 64-bit integer, little endian.\\n bitlen = bytelen * 8;\\n message = [message, mod(bitlen, m), mod(bitlen / m, m)];\\n\\n % Process each 512-bit block. Because we have 32-bit integers, each\\n % block has 16 elements, message(k + (0:15)).\\n for k = 1:16:numel(message)\\n % Copy hash.\\n a = digest(1); b = digest(2); c = digest(3); d = digest(4);\\n\\n % Do 64 operations.\\n for i = (1:64)\\n % Convert b, c, d to row vectors of bits (0s and 1s).\\n bv = dec2bin(b, 32) - '0';\\n cv = dec2bin(c, 32) - '0';\\n dv = dec2bin(d, 32) - '0';\\n\\n % Find f = mix of b, c, d.\\n % ki = index in 0:15, to message(k + ki).\\n % sr = row in 1:4, to s(sr, :).\\n if i <= 16 % Round 1\\n f = (bv & cv) | (~bv & dv);\\n ki = i - 1;\\n sr = 1;\\n elseif i <= 32 % Round 2\\n f = (bv & dv) | (cv & ~dv);\\n ki = mod(5 * i - 4, 16);\\n sr = 2;\\n elseif i <= 48 % Round 3\\n f = xor(bv, xor(cv, dv));\\n ki = mod(3 * i + 2, 16);\\n sr = 3;\\n else % Round 4\\n f = xor(cv, bv | ~dv);\\n ki = mod(7 * i - 7, 16);\\n sr = 4;\\n end\\n\\n % Convert f, from row vector of bits, to 32-bit integer.\\n f = bin2dec(char(f + '0'));\\n\\n % Do circular shift of sum.\\n sc = mod(i - 1, 4) + 1;\\n sum = mod(a + f + message(k + ki) + t(i), m);\\n sum = dec2bin(sum, 32);\\n sum = circshift(sum, [0, s(sr, sc)]);\\n sum = bin2dec(sum);\\n\\n % Update a, b, c, d.\\n temp = d;\\n d = c;\\n c = b;\\n b = mod(b + sum, m);\\n a = temp;\\n end %for i\\n\\n % Add hash of this block to hash of previous blocks.\\n digest = mod(digest + [a, b, c, d], m);\\n end %for k\\n\\n % Convert hash from 32-bit integers, little endian, to bytes.\\n digest = [digest % least significant byte\\n digest / 256\\n digest / 65536\\n digest / 16777216]; % most significant byte\\n digest = reshape(mod(floor(digest), 256), 1, numel(digest));\\n\\n % Convert hash to hexadecimal.\\n digest = dec2hex(digest);\\n digest = reshape(transpose(digest), 1, numel(digest));\\nend %md5\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"octave:14> md5('Rosetta Code')\\nans = CCA1BF66B09554E10F837838C3D3EFB1\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"\\\"The quick brown fox jumps over the lazy dog\\\" md5 puts!\\n\",\n \"language\": \"Min\"\n },\n {\n \"code\": \"string = \\\"The quick brown fox jumped over the lazy dog's back\\\";\\nplayer:tell(string_hash(string));\\n\",\n \"language\": \"MOO\"\n },\n {\n \"code\": \"/**\\n MD5 in Neko\\n Tectonics:\\n nekoc md5.neko\\n neko md5\\n*/\\n\\nvar MD5 = $loader.loadprim(\\\"std@make_md5\\\", 1);\\nvar base_encode = $loader.loadprim(\\\"std@base_encode\\\", 2);\\n\\nvar result = MD5(\\\"The quick brown fox jumps over the lazy dog\\\");\\n\\n/* Output in lowercase hex */\\n$print(base_encode(result, \\\"0123456789abcdef\\\"));\\n\",\n \"language\": \"Neko\"\n },\n {\n \"code\": \"using System;\\nusing System.Console;\\nusing System.Text;\\nusing System.Security.Cryptography;\\nusing Nemerle.Collections;\\nusing Nemerle.Collections.NCollectionsExtensions;\\n\\nmodule Md5\\n{\\n HashMD5(input : string) : string\\n {\\n BitConverter.ToString\\n (MD5.Create().ComputeHash(Encoding.Default.GetBytes(input))).Replace(\\\"-\\\", \\\"\\\").ToLower()\\n }\\n\\n IsValidMD5(text : string, hash : string) : bool\\n {\\n HashMD5(text) == hash.ToLower()\\n }\\n\\n Main() : void\\n {\\n def examples = [\\\"The quick brown fox jumped over the lazy dog's back\\\", \\\"\\\", \\\"a\\\", \\\"abc\\\", \\\"message digest\\\",\\n \\\"abcdefghijklmnopqrstuvwxyz\\\", \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\",\\n \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"];\\n def hashes = [\\\"e38ca1d920c4b8b8d3946b2c72f01680\\\", \\\"d41d8cd98f00b204e9800998ecf8427e\\\",\\n \\\"0cc175b9c0f1b6a831c399e269772661\\\", \\\"900150983cd24fb0d6963f7d28e17f72\\\",\\n \\\"f96b697d7cb7938d525a2f31aaf161d0\\\", \\\"c3fcd3d76192e4007dfb496cca67e13b\\\",\\n \\\"d174ab98d277d9f5a5611c2c9f419d9f\\\", \\\"57edf4a22be3c955ac49da2e2107b67a\\\"];\\n def tests = Hashtable(ZipLazy(examples, hashes));\\n foreach (test in tests)\\n Write($\\\"$(IsValidMD5(test.Key, test.Value)) \\\");\\n }\\n}\\n\",\n \"language\": \"Nemerle\"\n },\n {\n \"code\": \"/* NetRexx */\\n\\noptions replace format comments java crossref savelog symbols binary\\n\\nimport java.security.MessageDigest\\n\\nMD5('The quick brown fox jumps over the lazy dog', '9e107d9d372bb6826bd81d3542a419d6')\\n-- RFC 1321 MD5 test suite:\\nMD5(\\\"\\\", 'd41d8cd98f00b204e9800998ecf8427e')\\nMD5(\\\"a\\\", '0cc175b9c0f1b6a831c399e269772661')\\nMD5(\\\"abc\\\", '900150983cd24fb0d6963f7d28e17f72')\\nMD5(\\\"message digest\\\", 'f96b697d7cb7938d525a2f31aaf161d0')\\nMD5(\\\"abcdefghijklmnopqrstuvwxyz\\\", 'c3fcd3d76192e4007dfb496cca67e13b')\\nMD5(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\", 'd174ab98d277d9f5a5611c2c9f419d9f')\\nMD5(\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\", '57edf4a22be3c955ac49da2e2107b67a')\\n\\nreturn\\n\\n-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\nmethod MD5(messageText, verifyCheck) public static\\n\\n algorithm = 'MD5'\\n digestSum = getDigest(messageText, algorithm)\\n\\n say '<Message>'messageText'</Message>'\\n say Rexx('<'algorithm'>').right(12) || digestSum'</'algorithm'>'\\n say Rexx('<Verify>').right(12) || verifyCheck'</Verify>'\\n if digestSum == verifyCheck then say algorithm 'Confirmed'\\n else say algorithm 'Failed'\\n\\n return\\n\\n-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\nmethod getDigest(messageText = Rexx, algorithm = Rexx 'MD5', encoding = Rexx 'UTF-8', lowercase = boolean 1) public static returns Rexx\\n\\n algorithm = algorithm.upper\\n encoding = encoding.upper\\n\\n message = String(messageText)\\n messageBytes = byte[]\\n digestBytes = byte[]\\n digestSum = Rexx ''\\n\\n do\\n messageBytes = message.getBytes(encoding)\\n md = MessageDigest.getInstance(algorithm)\\n md.update(messageBytes)\\n digestBytes = md.digest\\n\\n loop b_ = 0 to digestBytes.length - 1\\n bb = Rexx(digestBytes[b_]).d2x(2)\\n if lowercase then digestSum = digestSum || bb.lower\\n else digestSum = digestSum || bb.upper\\n end b_\\n catch ex = Exception\\n ex.printStackTrace\\n end\\n\\n return digestSum\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \";; using the crypto module from http://www.newlisp.org/code/modules/crypto.lsp.html\\n;; (import native functions from the crypto library, provided by OpenSSL)\\n(module \\\"crypto.lsp\\\")\\n(crypto:md5 \\\"The quick brown fox jumped over the lazy dog's back\\\")\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"import md5\\n\\necho toMD5(\\\"The quick brown fox jumped over the lazy dog's back\\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"MODULE MD5;\\nIMPORT\\n Crypto:MD5,\\n Crypto:Utils,\\n Strings,\\n Out;\\nVAR\\n h: MD5.Hash;\\n str: ARRAY 128 OF CHAR;\\nBEGIN\\n h := MD5.NewHash();\\n h.Initialize;\\n str := \\\"The quick brown fox jumped over the lazy dog's back\\\";\\n h.Update(str,0,Strings.Length(str));\\n h.GetHash(str,0);\\n Out.String(\\\"MD5: \\\");Utils.PrintHex(str,0,h.size);Out.Ln\\nEND MD5.\\n\",\n \"language\": \"Oberon\"\n },\n {\n \"code\": \"class MD5 {\\n function : Main(args : String[]) ~ Nil {\\n in := \\\"The quick brown fox jumped over the lazy dog's back\\\"->ToByteArray();\\n hash := Encryption.Hash->MD5(in);\\n hash->ToHexString()->PrintLine();\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"NSString *myString = @\\\"The quick brown fox jumped over the lazy dog's back\\\";\\nNSData *digest = [[myString dataUsingEncoding:NSUTF8StringEncoding] md5Digest]; // or another encoding of your choosing\\nNSLog(@\\\"%@\\\", [digest hexadecimalRepresentation]);\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"#import <CommonCrypto/CommonDigest.h>\\n\\nNSString *myString = @\\\"The quick brown fox jumped over the lazy dog's back\\\";\\nNSData *data = [myString dataUsingEncoding:NSUTF8StringEncoding]; // or another encoding of your choosing\\nunsigned char digest[CC_MD5_DIGEST_LENGTH];\\nif (CC_MD5([data bytes], [data length], digest)) {\\n NSMutableString *hex = [NSMutableString string];\\n for (int i = 0; i < CC_MD5_DIGEST_LENGTH; i++) {\\n [hex appendFormat: @\\\"%02x\\\", (int)(digest[i])];\\n }\\n NSLog(@\\\"%@\\\", hex);\\n}\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"#include <openssl/md5.h>\\n\\nNSString *myString = @\\\"The quick brown fox jumped over the lazy dog's back\\\";\\nNSData *data = [myString dataUsingEncoding:NSUTF8StringEncoding]; // or another encoding of your choosing\\nunsigned char digest[MD5_DIGEST_LENGTH];\\nif (MD5([data bytes], [data length], digest)) {\\n NSMutableString *hex = [NSMutableString string];\\n for (int i = 0; i < MD5_DIGEST_LENGTH; i++) {\\n [hex appendFormat: @\\\"%02x\\\", (int)(digest[i])];\\n }\\n NSLog(@\\\"%@\\\", hex);\\n}\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"# Digest.to_hex(Digest.string \\\"The quick brown fox jumped over the lazy dog's back\\\") ;;\\n- : string = \\\"e38ca1d920c4b8b8d3946b2c72f01680\\\"\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"s = \\\"The quick brown fox jumped over the lazy dog's back\\\";\\nhash = md5sum(s, true);\\ndisp(hash)\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"(import (otus ffi))\\n(define libcrypto (load-dynamic-library \\\"libcrypto.so.1.0.0\\\"))\\n(define MD5 (libcrypto type-vptr \\\"MD5\\\" type-string fft-unsigned-long type-string))\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"(define (test str)\\n (define md5 \\\"----------------\\\")\\n (MD5 str (string-length str) md5)\\n (for-each display (list \\\"\\\\\\\"\\\" str \\\"\\\\\\\": \\\"))\\n (for-each (lambda (c)\\n (define hex \\\"0123456789abcdef\\\")\\n (display (string (ref hex (>> c 4))))\\n (display (string (ref hex (band c #x0F)))))\\n (string->list md5))\\n (print))\\n\\n(test \\\"\\\")\\n(test \\\"a\\\")\\n(test \\\"abc\\\")\\n(test \\\"message digest\\\")\\n(test \\\"abcdefghijklmnopqrstuvwxyz\\\")\\n(test \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\")\\n(test \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\")\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"MESSAGE\\n 1 STRING( HEX-ENCODE( MD5-DIGEST( \\\"\\\" ) ) ) SKIP\\n 2 STRING( HEX-ENCODE( MD5-DIGEST( \\\"a\\\" ) ) ) SKIP\\n 3 STRING( HEX-ENCODE( MD5-DIGEST( \\\"abc\\\" ) ) ) SKIP\\n 4 STRING( HEX-ENCODE( MD5-DIGEST( \\\"message digest\\\" ) ) ) SKIP\\n 5 STRING( HEX-ENCODE( MD5-DIGEST( \\\"abcdefghijklmnopqrstuvwxyz\\\" ) ) ) SKIP\\n 6 STRING( HEX-ENCODE( MD5-DIGEST( \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\" ) ) ) SKIP\\n 7 STRING( HEX-ENCODE( MD5-DIGEST( \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\" ) ) )\\nVIEW-AS ALERT-BOX\\n\",\n \"language\": \"OpenEdge-Progress\"\n },\n {\n \"code\": \"#include <pari/pari.h>\\n#include <openssl/md5.h>\\n\\n#define HEX(x) (((x) < 10)? (x)+'0': (x)-10+'a')\\n\\n/*\\n * PARI/GP func: MD5 hash\\n *\\n * gp code: install(\\\"plug_md5\\\", \\\"s\\\", \\\"MD5\\\", \\\"<library path>\\\");\\n */\\nGEN plug_md5(char *text)\\n{\\n char md[MD5_DIGEST_LENGTH];\\n char hash[sizeof(md) * 2 + 1];\\n int i;\\n\\n MD5((unsigned char*)text, strlen(text), (unsigned char*)md);\\n\\n for (i = 0; i < sizeof(md); i++) {\\n hash[i+i] = HEX((md[i] >> 4) & 0x0f);\\n hash[i+i+1] = HEX(md[i] & 0x0f);\\n }\\n\\n hash[sizeof(md) * 2] = 0;\\n\\n return strtoGENstr(hash);\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"install(\\\"plug_md5\\\", \\\"s\\\", \\\"MD5\\\", \\\"~/libmd5.so\\\");\\n\\nMD5(\\\"The quick brown fox jumped over the lazy dog's back\\\")\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"md5( message ) = { my(\\n a = 0x67452301, b = 0xefcdab89, c = 0x98badcfe, d = 0x10325476,\\n s = [ 7, 12, 17, 22; 5, 9, 14, 20; 4, 11, 16, 23; 6, 10, 15, 21 ],\\n msg = concat( Vec( concat(Vecsmall(message), Vecsmall(128)), (#message + 9) \\\\ 64 * 64 + 56 ),\\n Vecrev(digits( #message % 2^61 * 8, 256), 8)), \\\\\\\\ little endian !\\n leftrotate(x, c) = x << c + x >> (32-c)\\n );\\n \\\\\\\\*** Process the message in successive 512-bit chunks ***\\n forstep( m=1, #msg, 512/8,\\n my( \\\\\\\\ break chunk into 32-bit words M[j] - LITTLE ENDIAN !\\n M = vector( 16, j, fromdigits( Vecrev(msg[ m + j*4 - 4 .. m + j*4 - 1 ]), 2^8 )),\\n A = a, B = b, C = c, D = d);\\n for( i = 0 , 63 , [A, D, C, B] = [D, C, B, B + leftrotate( ( A + abs(sin(i+1))\\\\2^-32 +\\n if( i < 16 , bitor( bitand(B , C) , bitand( bitneg(B) , D)) + M[ i +1]\\n , i < 32 , bitor( bitand(D , B) , bitand( bitneg(D) , C)) + M[ (5*i + 1) % 16 +1]\\n , i < 48 , bitxor( bitxor( B , C ) , D ) + M[ (3*i + 5) % 16 +1]\\n , bitxor( C , bitor( bitneg(D), B)) + M[ 7*i % 16 +1]\\n )) % 2^32, s[i\\\\16+1, i%4+1] )]\\n ); \\\\\\\\ end for\\n [a,b,c,d] = ([a,b,c,d] + [A,B,C,D]) % 2^32 ;\\n ); \\\\\\\\ end forstep\\n Strprintf(\\\"%032x\\\",fromdigits(Vecrev(digits(fromdigits([d,c,b,a],2^32),256),16),256))\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"gp > md5(\\\"\\\")\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"gp > md5(\\\"The quick brown fox jumps over lazy dogs.\\\")\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"program GetMd5;\\n\\nuses md5;\\n\\nvar\\n strEncrypted : string;\\n\\nbegin\\n strEncrypted := md5Print(md5String('The quick brown fox jumped over the lazy dog''s back'));\\n writeln(strEncrypted);\\nend.\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use Digest::MD5 qw(md5_hex);\\n\\nprint md5_hex(\\\"The quick brown fox jumped over the lazy dog's back\\\"), \\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use Digest::MD5;\\n\\n$md5 = Digest::MD5->new;\\n$md5->add(\\\"The quick brown fox jumped over the lazy dog's back\\\");\\nprint $md5->hexdigest, \\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"$string = \\\"The quick brown fox jumped over the lazy dog's back\\\";\\necho md5( $string );\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(let Str \\\"The quick brown fox jumped over the lazy dog's back\\\"\\n (pack\\n (mapcar '((B) (pad 2 (hex B)))\\n (native \\\"libcrypto.so\\\" \\\"MD5\\\" '(B . 16) Str (length Str) '(NIL (16))) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"import String;\\nimport Crypto.MD5;\\n\\nint main(){\\n write( string2hex( hash( \\\"The quick brown fox jumped over the lazy dog's back\\\" ) ) + \\\"\\\\n\\\" );\\n}\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"$string = \\\"The quick brown fox jumped over the lazy dog's back\\\"\\n$data = [Text.Encoding]::UTF8.GetBytes($string)\\n$hash = [Security.Cryptography.MD5]::Create().ComputeHash($data)\\n([BitConverter]::ToString($hash) -replace '-').ToLower()\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"UseMD5Fingerprint() ; register the MD5 fingerprint plugin\\n\\ntest$ = \\\"The quick brown fox jumped over the lazy dog's back\\\"\\n\\n; Call StringFingerprint() function and display MD5 result in Debug window\\nDebug StringFingerprint(test$, #PB_Cipher_MD5)\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \">>> import hashlib\\n>>> # RFC 1321 test suite:\\n>>> tests = (\\n (b\\\"\\\", 'd41d8cd98f00b204e9800998ecf8427e'),\\n (b\\\"a\\\", '0cc175b9c0f1b6a831c399e269772661'),\\n (b\\\"abc\\\", '900150983cd24fb0d6963f7d28e17f72'),\\n (b\\\"message digest\\\", 'f96b697d7cb7938d525a2f31aaf161d0'),\\n (b\\\"abcdefghijklmnopqrstuvwxyz\\\", 'c3fcd3d76192e4007dfb496cca67e13b'),\\n (b\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\", 'd174ab98d277d9f5a5611c2c9f419d9f'),\\n (b\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\", '57edf4a22be3c955ac49da2e2107b67a') )\\n>>> for text, golden in tests: assert hashlib.md5(text).hexdigest() == golden\\n\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \">>> import hashlib\\n>>> print hashlib.md5(\\\"The quick brown fox jumped over the lazy dog's back\\\").hexdigest()\\ne38ca1d920c4b8b8d3946b2c72f01680\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \">>> import md5\\n>>> print md5.md5(\\\"The quick brown fox jumped over the lazy dog's back\\\").hexdigest()\\ne38ca1d920c4b8b8d3946b2c72f01680\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"library(digest)\\nhexdigest <- digest(\\\"The quick brown fox jumped over the lazy dog's back\\\",\\n algo=\\\"md5\\\", serialize=FALSE)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(require file/md5)\\n\\n(md5 \\\"\\\")\\n(md5 \\\"a\\\")\\n(md5 \\\"abc\\\")\\n(md5 \\\"message digest\\\")\\n(md5 \\\"abcdefghijklmnopqrstuvwxyz\\\")\\n(md5 \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\")\\n(md5 \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\")\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use Digest::MD5;\\nsay Digest::MD5.md5_hex: \\\"The quick brown fox jumped over the lazy dog's back\\\";\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \">> checksum/method \\\"The quick brown fox jumped over the lazy dog\\\" 'md5\\n== #{08A008A01D498C404B0C30852B39D3B8}\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \"/*REXX program tests the MD5 procedure (below) as per a test suite the IETF RFC (1321).*/\\nmsg.1 = /*─────MD5 test suite [from above doc].*/\\nmsg.2 = 'a'\\nmsg.3 = 'abc'\\nmsg.4 = 'message digest'\\nmsg.5 = 'abcdefghijklmnopqrstuvwxyz'\\nmsg.6 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'\\nmsg.7 = 12345678901234567890123456789012345678901234567890123456789012345678901234567890\\nmsg.0 = 7 /* [↑] last value doesn't need quotes.*/\\n do m=1 for msg.0; say /*process each of the seven messages. */\\n say ' in =' msg.m /*display the in message. */\\n say 'out =' MD5(msg.m) /* \\\" \\\" out \\\" */\\n end /*m*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nMD5: procedure; parse arg !; numeric digits 20 /*insure there's enough decimal digits.*/\\n a='67452301'x; b=\\\"efcdab89\\\"x; c='98badcfe'x; d=\\\"10325476\\\"x; x00='0'x; x80=\\\"80\\\"x\\n #=length(!) /*length in bytes of the input message.*/\\n L=#*8//512; if L<448 then plus=448 - L /*is the length less than 448 ? */\\n if L>448 then plus=960 - L /* \\\" \\\" \\\" greater \\\" \\\" */\\n if L=448 then plus=512 /* \\\" \\\" \\\" equal to \\\" */\\n /* [↓] a little of this, ··· */\\n $=! || x80 || copies(x00, plus%8 -1)reverse(right(d2c(8 * #), 4, x00)) || '00000000'x\\n /* [↑] ··· and a little of that.*/\\n do j=0 to length($) % 64 - 1 /*process the message (lots of steps).*/\\n a_=a; b_=b; c_=c; d_=d /*save the original values for later.*/\\n chunk=j*64 /*calculate the size of the chunks. */\\n do k=1 for 16 /*process the message in chunks. */\\n !.k=reverse( substr($, chunk + 1 + 4*(k-1), 4) ) /*magic stuff.*/\\n end /*k*/ /*────step────*/\\n a = .part1( a, b, c, d, 0, 7, 3614090360) /*■■■■ 1 ■■■■*/\\n d = .part1( d, a, b, c, 1, 12, 3905402710) /*■■■■ 2 ■■■■*/\\n c = .part1( c, d, a, b, 2, 17, 606105819) /*■■■■ 3 ■■■■*/\\n b = .part1( b, c, d, a, 3, 22, 3250441966) /*■■■■ 4 ■■■■*/\\n a = .part1( a, b, c, d, 4, 7, 4118548399) /*■■■■ 5 ■■■■*/\\n d = .part1( d, a, b, c, 5, 12, 1200080426) /*■■■■ 6 ■■■■*/\\n c = .part1( c, d, a, b, 6, 17, 2821735955) /*■■■■ 7 ■■■■*/\\n b = .part1( b, c, d, a, 7, 22, 4249261313) /*■■■■ 8 ■■■■*/\\n a = .part1( a, b, c, d, 8, 7, 1770035416) /*■■■■ 9 ■■■■*/\\n d = .part1( d, a, b, c, 9, 12, 2336552879) /*■■■■ 10 ■■■■*/\\n c = .part1( c, d, a, b, 10, 17, 4294925233) /*■■■■ 11 ■■■■*/\\n b = .part1( b, c, d, a, 11, 22, 2304563134) /*■■■■ 12 ■■■■*/\\n a = .part1( a, b, c, d, 12, 7, 1804603682) /*■■■■ 13 ■■■■*/\\n d = .part1( d, a, b, c, 13, 12, 4254626195) /*■■■■ 14 ■■■■*/\\n c = .part1( c, d, a, b, 14, 17, 2792965006) /*■■■■ 15 ■■■■*/\\n b = .part1( b, c, d, a, 15, 22, 1236535329) /*■■■■ 16 ■■■■*/\\n a = .part2( a, b, c, d, 1, 5, 4129170786) /*■■■■ 17 ■■■■*/\\n d = .part2( d, a, b, c, 6, 9, 3225465664) /*■■■■ 18 ■■■■*/\\n c = .part2( c, d, a, b, 11, 14, 643717713) /*■■■■ 19 ■■■■*/\\n b = .part2( b, c, d, a, 0, 20, 3921069994) /*■■■■ 20 ■■■■*/\\n a = .part2( a, b, c, d, 5, 5, 3593408605) /*■■■■ 21 ■■■■*/\\n d = .part2( d, a, b, c, 10, 9, 38016083) /*■■■■ 22 ■■■■*/\\n c = .part2( c, d, a, b, 15, 14, 3634488961) /*■■■■ 23 ■■■■*/\\n b = .part2( b, c, d, a, 4, 20, 3889429448) /*■■■■ 24 ■■■■*/\\n a = .part2( a, b, c, d, 9, 5, 568446438) /*■■■■ 25 ■■■■*/\\n d = .part2( d, a, b, c, 14, 9, 3275163606) /*■■■■ 26 ■■■■*/\\n c = .part2( c, d, a, b, 3, 14, 4107603335) /*■■■■ 27 ■■■■*/\\n b = .part2( b, c, d, a, 8, 20, 1163531501) /*■■■■ 28 ■■■■*/\\n a = .part2( a, b, c, d, 13, 5, 2850285829) /*■■■■ 29 ■■■■*/\\n d = .part2( d, a, b, c, 2, 9, 4243563512) /*■■■■ 30 ■■■■*/\\n c = .part2( c, d, a, b, 7, 14, 1735328473) /*■■■■ 31 ■■■■*/\\n b = .part2( b, c, d, a, 12, 20, 2368359562) /*■■■■ 32 ■■■■*/\\n a = .part3( a, b, c, d, 5, 4, 4294588738) /*■■■■ 33 ■■■■*/\\n d = .part3( d, a, b, c, 8, 11, 2272392833) /*■■■■ 34 ■■■■*/\\n c = .part3( c, d, a, b, 11, 16, 1839030562) /*■■■■ 35 ■■■■*/\\n b = .part3( b, c, d, a, 14, 23, 4259657740) /*■■■■ 36 ■■■■*/\\n a = .part3( a, b, c, d, 1, 4, 2763975236) /*■■■■ 37 ■■■■*/\\n d = .part3( d, a, b, c, 4, 11, 1272893353) /*■■■■ 38 ■■■■*/\\n c = .part3( c, d, a, b, 7, 16, 4139469664) /*■■■■ 39 ■■■■*/\\n b = .part3( b, c, d, a, 10, 23, 3200236656) /*■■■■ 40 ■■■■*/\\n a = .part3( a, b, c, d, 13, 4, 681279174) /*■■■■ 41 ■■■■*/\\n d = .part3( d, a, b, c, 0, 11, 3936430074) /*■■■■ 42 ■■■■*/\\n c = .part3( c, d, a, b, 3, 16, 3572445317) /*■■■■ 43 ■■■■*/\\n b = .part3( b, c, d, a, 6, 23, 76029189) /*■■■■ 44 ■■■■*/\\n a = .part3( a, b, c, d, 9, 4, 3654602809) /*■■■■ 45 ■■■■*/\\n d = .part3( d, a, b, c, 12, 11, 3873151461) /*■■■■ 46 ■■■■*/\\n c = .part3( c, d, a, b, 15, 16, 530742520) /*■■■■ 47 ■■■■*/\\n b = .part3( b, c, d, a, 2, 23, 3299628645) /*■■■■ 48 ■■■■*/\\n a = .part4( a, b, c, d, 0, 6, 4096336452) /*■■■■ 49 ■■■■*/\\n d = .part4( d, a, b, c, 7, 10, 1126891415) /*■■■■ 50 ■■■■*/\\n c = .part4( c, d, a, b, 14, 15, 2878612391) /*■■■■ 51 ■■■■*/\\n b = .part4( b, c, d, a, 5, 21, 4237533241) /*■■■■ 52 ■■■■*/\\n a = .part4( a, b, c, d, 12, 6, 1700485571) /*■■■■ 53 ■■■■*/\\n d = .part4( d, a, b, c, 3, 10, 2399980690) /*■■■■ 54 ■■■■*/\\n c = .part4( c, d, a, b, 10, 15, 4293915773) /*■■■■ 55 ■■■■*/\\n b = .part4( b, c, d, a, 1, 21, 2240044497) /*■■■■ 56 ■■■■*/\\n a = .part4( a, b, c, d, 8, 6, 1873313359) /*■■■■ 57 ■■■■*/\\n d = .part4( d, a, b, c, 15, 10, 4264355552) /*■■■■ 58 ■■■■*/\\n c = .part4( c, d, a, b, 6, 15, 2734768916) /*■■■■ 59 ■■■■*/\\n b = .part4( b, c, d, a, 13, 21, 1309151649) /*■■■■ 60 ■■■■*/\\n a = .part4( a, b, c, d, 4, 6, 4149444226) /*■■■■ 61 ■■■■*/\\n d = .part4( d, a, b, c, 11, 10, 3174756917) /*■■■■ 62 ■■■■*/\\n c = .part4( c, d, a, b, 2, 15, 718787259) /*■■■■ 63 ■■■■*/\\n b = .part4( b, c, d, a, 9, 21, 3951481745) /*■■■■ 64 ■■■■*/\\n a = .a(a_, a); b=.a(b_, b); c=.a(c_, c); d=.a(d_, d)\\n end /*j*/\\n\\n return c2x( reverse(a) )c2x( reverse(b) )c2x( reverse(c) )c2x( reverse(d) )\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n.a: return right( d2c( c2d( arg(1) ) + c2d( arg(2) ) ), 4, '0'x)\\n.h: return bitxor( bitxor( arg(1), arg(2) ), arg(3) )\\n.i: return bitxor( arg(2), bitor(arg(1), bitxor(arg(3), 'ffffffff'x)))\\n.f: return bitor( bitand(arg(1),arg(2)), bitand(bitxor(arg(1), 'ffffffff'x), arg(3)))\\n.g: return bitor( bitand(arg(1),arg(3)), bitand(arg(2), bitxor(arg(3), 'ffffffff'x)))\\n.Lr: procedure; parse arg _,#; if #==0 then return _ /*left rotate.*/\\n ?=x2b(c2x(_)); return x2c( b2x( right(? || left(?, #), length(?) )))\\n.part1: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n+1\\n return .a(.Lr(right(d2c(_+c2d(w) +c2d(.f(x,y,z))+c2d(!.n)),4,'0'x),m),x)\\n.part2: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n+1\\n return .a(.Lr(right(d2c(_+c2d(w) +c2d(.g(x,y,z))+c2d(!.n)),4,'0'x),m),x)\\n.part3: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n+1\\n return .a(.Lr(right(d2c(_+c2d(w) +c2d(.h(x,y,z))+c2d(!.n)),4,'0'x),m),x)\\n.part4: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n+1\\n return .a(.Lr(right(d2c(c2d(w) +c2d(.i(x,y,z))+c2d(!.n)+_),4,'0'x),m),x)\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"See MD5(\\\"my string!\\\") + nl\\n# output : a83a049fbe50cf7334caa86bf16a3520\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \">> x = \\\"The quick brown fox jumped over the lazy dog's back\\\"\\nThe quick brown fox jumped over the lazy dog's back\\n\\n>> hash(\\\"md5\\\", x)\\ne38ca1d920c4b8b8d3946b2c72f01680\\n\",\n \"language\": \"RLaB\"\n },\n {\n \"code\": \"**FREE\\nCtl-opt MAIN(Main);\\nCtl-opt DFTACTGRP(*NO) ACTGRP(*NEW);\\n\\ndcl-pr QDCXLATE EXTPGM('QDCXLATE');\\n dataLen packed(5 : 0) CONST;\\n data char(32767) options(*VARSIZE);\\n conversionTable char(10) CONST;\\nend-pr;\\n\\ndcl-pr Qc3CalculateHash EXTPROC('Qc3CalculateHash');\\n inputData pointer value;\\n inputDataLen int(10) const;\\n inputDataFormat char(8) const;\\n algorithmDscr char(16) const;\\n algorithmFormat char(8) const;\\n cryptoServiceProvider char(1) const;\\n cryptoDeviceName char(1) const options(*OMIT);\\n hash char(64) options(*VARSIZE : *OMIT);\\n errorCode char(32767) options(*VARSIZE);\\nend-pr;\\n\\ndcl-c HEX_CHARS CONST('0123456789ABCDEF');\\n\\ndcl-proc Main;\\n dcl-s inputData char(45);\\n dcl-s inputDataLen int(10) INZ(0);\\n dcl-s outputHash char(16);\\n dcl-s outputHashHex char(32);\\n dcl-ds algorithmDscr QUALIFIED;\\n hashAlgorithm int(10) INZ(0);\\n end-ds;\\n dcl-ds ERRC0100_NULL QUALIFIED;\\n bytesProvided int(10) INZ(0); // Leave at zero\\n bytesAvailable int(10);\\n end-ds;\\n\\n dow inputDataLen = 0;\\n DSPLY 'Input: ' '' inputData;\\n inputData = %trim(inputData);\\n inputDataLen = %len(%trim(inputData));\\n DSPLY ('Input=' + inputData);\\n DSPLY ('InputLen=' + %char(inputDataLen));\\n if inputDataLen = 0;\\n DSPLY 'Input must not be blank';\\n endif;\\n enddo;\\n\\n // Convert from EBCDIC to ASCII\\n QDCXLATE(inputDataLen : inputData : 'QTCPASC');\\n algorithmDscr.hashAlgorithm = 1; // MD5\\n // Calculate hash\\n Qc3CalculateHash(%addr(inputData) : inputDataLen : 'DATA0100' : algorithmDscr\\n : 'ALGD0500' : '0' : *OMIT : outputHash : ERRC0100_NULL);\\n // Convert to hex\\n CVTHC(outputHashHex : outputHash : 32);\\n DSPLY ('MD5: ' + outputHashHex);\\n return;\\nend-proc;\\n\\n// This procedure is actually a MI, but I couldn't get it to bind so I wrote my own version\\ndcl-proc CVTHC;\\n dcl-pi *N;\\n target char(65534) options(*VARSIZE);\\n srcBits char(32767) options(*VARSIZE) CONST;\\n targetLen int(10) value;\\n end-pi;\\n dcl-s i int(10);\\n dcl-s lowNibble ind INZ(*OFF);\\n dcl-s inputOffset int(10) INZ(1);\\n dcl-ds dataStruct QUALIFIED;\\n numField int(5) INZ(0);\\n // IBM i is big-endian\\n charField char(1) OVERLAY(numField : 2);\\n end-ds;\\n\\n for i = 1 to targetLen;\\n if lowNibble;\\n dataStruct.charField = %BitAnd(%subst(srcBits : inputOffset : 1) : X'0F');\\n inputOffset += 1;\\n else;\\n dataStruct.charField = %BitAnd(%subst(srcBits : inputOffset : 1) : X'F0');\\n dataStruct.numField /= 16;\\n endif;\\n %subst(target : i : 1) = %subst(HEX_CHARS : dataStruct.numField + 1 : 1);\\n lowNibble = NOT lowNibble;\\n endfor;\\n return;\\nend-proc;\\n\",\n \"language\": \"RPG\"\n },\n {\n \"code\": \"require 'digest'\\nDigest::MD5.hexdigest(\\\"The quick brown fox jumped over the lazy dog's back\\\")\\n# => \\\"e38ca1d920c4b8b8d3946b2c72f01680\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"[dependencies]\\nrust-crypto = \\\"0.2\\\"\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"extern crate crypto;\\n\\nuse crypto::digest::Digest;\\nuse crypto::md5::Md5;\\n\\nfn main() {\\n let mut sh = Md5::new();\\n sh.input_str(\\\"The quick brown fox jumped over the lazy dog's back\\\");\\n println!(\\\"{}\\\", sh.result_str());\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"require(\\\"chksum\\\");\\nprint(md5sum(\\\"The quick brown fox jumped over the lazy dog's back\\\"));\\n\",\n \"language\": \"S-lang\"\n },\n {\n \"code\": \"object RosettaMD5 extends App {\\n\\n def MD5(s: String): String = {\\n // Besides \\\"MD5\\\", \\\"SHA-256\\\", and other hashes are available\\n val m = java.security.MessageDigest.getInstance(\\\"MD5\\\").digest(s.getBytes(\\\"UTF-8\\\"))\\n m.map(\\\"%02x\\\".format(_)).mkString\\n }\\n\\n assert(\\\"d41d8cd98f00b204e9800998ecf8427e\\\" == MD5(\\\"\\\"))\\n assert(\\\"0cc175b9c0f1b6a831c399e269772661\\\" == MD5(\\\"a\\\"))\\n assert(\\\"900150983cd24fb0d6963f7d28e17f72\\\" == MD5(\\\"abc\\\"))\\n assert(\\\"f96b697d7cb7938d525a2f31aaf161d0\\\" == MD5(\\\"message digest\\\"))\\n assert(\\\"c3fcd3d76192e4007dfb496cca67e13b\\\" == MD5(\\\"abcdefghijklmnopqrstuvwxyz\\\"))\\n assert(\\\"e38ca1d920c4b8b8d3946b2c72f01680\\\" == MD5(\\\"The quick brown fox jumped over the lazy dog's back\\\"))\\n assert(\\\"d174ab98d277d9f5a5611c2c9f419d9f\\\" ==\\n MD5(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"))\\n assert(\\\"57edf4a22be3c955ac49da2e2107b67a\\\" ==\\n MD5(\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"))\\n import scala.compat.Platform.currentTime\\n println(s\\\"Successfully completed without errors. [total ${currentTime - executionStart} ms]\\\")\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"msgdigest.s7i\\\";\\n\\nconst proc: main is func\\n begin\\n writeln(hex(md5(\\\"The quick brown fox jumped over the lazy dog's back\\\")));\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"var digest = frequire('Digest::MD5');\\nsay digest.md5_hex(\\\"The quick brown fox jumped over the lazy dog's back\\\");\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"var md5 = require('Digest::MD5').new;\\nmd5.add(\\\"The quick brown fox jumped over the lazy dog's back\\\");\\nsay md5.hexdigest;\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"'The quick brown fox jumped over the lazy dog\\\\'s back' md5String. \\\"==> 'e38ca1d920c4b8b8d3946b2c72f01680'\\\"\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"(display (string->md5 \\\"The quick brown fox jumped over the lazy dog's back\\\"))\\n\",\n \"language\": \"Slope\"\n },\n {\n \"code\": \"PackageLoader fileInPackage: 'Digest' !\\n(MD5 hexDigestOf: 'The quick brown fox jumped over the lazy dog''s back') displayNl.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"(MD5Stream hashValueOf: 'The quick brown fox jumped over the lazy dog''s back') printCR.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"SELECT MD5('The quick brown fox jumped over the lazy dog\\\\'s back')\\n\",\n \"language\": \"SQL\"\n },\n {\n \"code\": \"Md5('The quick brown fox jumped over the lazy dog\\\\'s back')\\n\",\n \"language\": \"Suneido\"\n },\n {\n \"code\": \"package require md5\\nputs [md5::md5 -hex \\\"The quick brown fox jumped over the lazy dog's back\\\"]\\n# ==> E38CA1D920C4B8B8D3946B2C72F01680\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"echo -n \\\"The quick brown fox jumped over the lazy dog's back\\\" | md5sum\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"echo -n \\\"The quick brown fox jumped over the lazy dog's back\\\" | md5\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"echo -n \\\"The quick brown fox jumped over the lazy dog's back\\\" |\\n openssl md5 | sed 's/.*= //'\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"import crypto.md5\\n\\nfn main() {\\n for p in [\\n // RFC 1321 test cases\\n [\\\"d41d8cd98f00b204e9800998ecf8427e\\\", \\\"\\\"],\\n [\\\"0cc175b9c0f1b6a831c399e269772661\\\", \\\"a\\\"],\\n [\\\"900150983cd24fb0d6963f7d28e17f72\\\", \\\"abc\\\"],\\n [\\\"f96b697d7cb7938d525a2f31aaf161d0\\\", \\\"message digest\\\"],\\n [\\\"c3fcd3d76192e4007dfb496cca67e13b\\\", \\\"abcdefghijklmnopqrstuvwxyz\\\"],\\n [\\\"d174ab98d277d9f5a5611c2c9f419d9f\\\",\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"],\\n [\\\"57edf4a22be3c955ac49da2e2107b67a\\\", \\\"12345678901234567890\\\" +\\n \\\"123456789012345678901234567890123456789012345678901234567890\\\"],\\n // test case popular with other RC solutions\\n [\\\"e38ca1d920c4b8b8d3946b2c72f01680\\\",\\n \\\"The quick brown fox jumped over the lazy dog's back\\\"],\\n ] {\\n validate(p[0], p[1])\\n }\\n}\\n\\nfn validate(check string, s string) {\\n sum := md5.hexhash(s)\\n if sum != check {\\n println(\\\"MD5 fail\\\")\\n println(\\\" for string, $s\\\")\\n println(\\\" expected: $check\\\")\\n println(\\\" got: $sum\\\")\\n } else {\\n println('MD5 succeeded $s')\\n }\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Imports System.Security.Cryptography\\nImports System.Text\\n\\nModule MD5hash\\n Sub Main(args As String())\\n Console.WriteLine(GetMD5(\\\"Visual Basic .Net\\\"))\\n End Sub\\n\\n Private Function GetMD5(plainText As String) As String\\n Dim hash As String = \\\"\\\"\\n\\n Using hashObject As MD5 = MD5.Create()\\n Dim ptBytes As Byte() = hashObject.ComputeHash(Encoding.UTF8.GetBytes(plainText))\\n Dim hashBuilder As New StringBuilder\\n\\n For i As Integer = 0 To ptBytes.Length - 1\\n hashBuilder.Append(ptBytes(i).ToString(\\\"X2\\\"))\\n Next\\n hash = hashBuilder.ToString\\n End Using\\n\\n Return hash\\n End Function\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./crypto\\\" for Md5\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar strings = [\\n \\\"The quick brown fox jumps over the lazy dog\\\",\\n \\\"The quick brown fox jumps over the lazy dog.\\\",\\n \\\"\\\"\\n]\\n\\nfor (s in strings) {\\n var digest = Md5.digest(s)\\n Fmt.print(\\\"$s <== '$0s'\\\", digest, s)\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"Utils.MD5.calc(\\\"message digest\\\"); //-->\\\"f96b697d7cb7938d525a2f31aaf161d0\\\"\\nUtils.MD5.calc(\\\"abcdefghijklmnopqrstuvwxyz\\\"); //-->\\\"c3fcd3d76192e4007dfb496cca67e13b\\\"\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"MD5"}}},{"rowIdx":479,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/MD5/Implementation\nnote: Checksums\n","language":"00-META"},{"code":"The purpose of this task to code and validate an implementation of the MD5 Message Digest Algorithm by coding the algorithm directly (not using a call to a built-in or external hashing library). For details of the algorithm refer to [[wp:Md5#Algorithm|MD5 on Wikipedia]] or the [http://www.ietf.org/rfc/rfc1321.txt MD5 definition in IETF RFC (1321)]. \n\n* The implementation needs to implement the key functionality namely producing a correct message digest for an input string. It is not necessary to mimic all of the calling modes such as adding to a digest one block at a time over subsequent calls. \n* In addition to coding and verifying your implementation, note any challenges your language presented implementing the solution, implementation choices made, or limitations of your solution. \n* Solutions on this page should implement MD5 directly and NOT use built in (MD5) functions, call outs to operating system calls or library routines written in other languages as is common in the original [[MD5]] task.\n* The following are acceptable:\n** An original implementation from the specification, reference implementation, or pseudo-code\n** A translation of a correct implementation from another language\n** A library routine in the same language; however, the source must be included here.\n\n\nThe solutions shown here will provide practical illustrations of bit manipulation, unsigned integers, working with little-endian data. Additionally, the task requires an attention to details such as boundary conditions since being out by even 1 bit will produce dramatically different results. Subtle implementation bugs can result in some hashes being correct while others are wrong. Not only is it critical to get the individual sub functions working correctly, even small errors in padding, endianness, or data layout will result in failure.\n\nThe following verification strings and hashes come from RFC 1321:<pre> hash code <== string \n 0xd41d8cd98f00b204e9800998ecf8427e <== \"\" \n 0x0cc175b9c0f1b6a831c399e269772661 <== \"a\"\n 0x900150983cd24fb0d6963f7d28e17f72 <== \"abc\"\n 0xf96b697d7cb7938d525a2f31aaf161d0 <== \"message digest\"\n 0xc3fcd3d76192e4007dfb496cca67e13b <== \"abcdefghijklmnopqrstuvwxyz\"\n 0xd174ab98d277d9f5a5611c2c9f419d9f <== \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"\n 0x57edf4a22be3c955ac49da2e2107b67a <== \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"</pre>\n\nIn addition, intermediate outputs to aid in developing an implementation can be found [[MD5/Implementation Debug|here]].\n\nThe MD5 Message-Digest Algorithm was developed by [[wp:RSA_SecurityRSA|RSA Data Security, Inc.]] in 1991.\n\n{{alertbox|#ffff70|'''<big>Warning</big>'''<br/>Rosetta Code is '''not''' a place you should rely on for examples of code in critical roles, including security.<br/>Also, note that MD5 has been ''broken'' and should not be used in applications requiring security. For these consider [[wp:SHA2|SHA2]] or the upcoming [[wp:SHA3|SHA3]].}}\n\n","language":"00-TASK"},{"code":"-V\n rotate_amounts = [7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21]\n\n constants = (0.<64).map(i -> UInt32(UInt64(abs(sin(i + 1)) * 2.0 ^ 32) [&] FFFF'FFFF))\n\n init_values = (UInt32(6745'2301), UInt32(EFCD'AB89), UInt32(98BA'DCFE), UInt32(1032'5476))\n\n[((UInt32, UInt32, UInt32) -> UInt32)] functions\nfunctions [+]= (b, c, d) -> (b [&] c) [|] (~b [&] d)\nfunctions [+]= (b, c, d) -> (d [&] b) [|] (~d [&] c)\nfunctions [+]= (b, c, d) -> b (+) c (+) d\nfunctions [+]= (b, c, d) -> c (+) (b [|] ~d)\n\n[(Int -> Int)] index_functions\nindex_functions [+]= i -> i\nindex_functions [+]= i -> (5 * i + 1) % 16\nindex_functions [+]= i -> (3 * i + 5) % 16\nindex_functions [+]= i -> (7 * i) % 16\n\nF md5(=message)\n V orig_len_in_bits = UInt64(8) * message.len\n message.append(8'0)\n L message.len % 64 != 56\n message.append(0)\n message.extend(bytes_from_int(orig_len_in_bits))\n\n V hash_pieces = init_values\n\n L(chunk_ofst) (0 .< message.len).step(64)\n V (a, b, c, d) = hash_pieces\n V chunk = message[chunk_ofst .+ 64]\n L(i) 64\n V f = :functions[i I/ 16](b, c, d)\n V g = :index_functions[i I/ 16](i)\n V to_rotate = a + f + :constants[i] + UInt32(bytes' chunk[4 * g .+ 4])\n V new_b = UInt32(b + rotl(to_rotate, :rotate_amounts[i]))\n (a, b, c, d) = (d, new_b, b, c)\n L(val) (a, b, c, d)\n hash_pieces[L.index] += val\n\n [Byte] r\n L(x) hash_pieces\n r.extend([x [&] F'F, (x >> 8) [&] F'F, (x >> 16) [&] F'F, (x >> 24) [&] F'F])\n R r\n\nF md5_to_hex(digest)\n V s = ‘’\n L(d) digest\n s ‘’= hex(d).lowercase().zfill(2)\n R s\n\nV demo = [Bytes(‘’), Bytes(‘a’), Bytes(‘abc’), Bytes(‘message digest’), Bytes(‘abcdefghijklmnopqrstuvwxyz’),\n Bytes(‘ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789’),\n Bytes(‘12345678901234567890123456789012345678901234567890123456789012345678901234567890’)]\nL(message) demo\n print(md5_to_hex(md5(message))‘ <= \"’message.decode(‘ascii’)‘\"’)\n","language":"11l"},{"code":"package MD5 is\n\n type Int32 is mod 2 ** 32;\n type MD5_Hash is array (1 .. 4) of Int32;\n function MD5 (Input : String) return MD5_Hash;\n\n -- 32 hexadecimal characters + '0x' prefix\n subtype MD5_String is String (1 .. 34);\n function To_String (Item : MD5_Hash) return MD5_String;\n\nend MD5;\n","language":"Ada"},{"code":"with Ada.Unchecked_Conversion;\n\npackage body MD5 is\n type Int32_Array is array (Positive range <>) of Int32;\n\n function Rotate_Left (Value : Int32; Count : Int32) return Int32 is\n Bit : Boolean;\n Result : Int32 := Value;\n begin\n for I in 1 .. Count loop\n Bit := (2 ** 31 and Result) = 2 ** 31;\n Result := Result * 2;\n if Bit then\n Result := Result + 1;\n end if;\n end loop;\n return Result;\n end Rotate_Left;\n\n function Pad_String (Item : String) return Int32_Array is\n -- always pad positive amount of Bytes\n Padding_Bytes : Positive := 64 - Item'Length mod 64;\n subtype String4 is String (1 .. 4);\n function String4_To_Int32 is new Ada.Unchecked_Conversion\n (Source => String4,\n Target => Int32);\n begin\n if Padding_Bytes <= 2 then\n Padding_Bytes := Padding_Bytes + 64;\n end if;\n declare\n Result : Int32_Array (1 .. (Item'Length + Padding_Bytes) / 4);\n Current_Index : Positive := 1;\n begin\n for I in 1 .. Item'Length / 4 loop\n Result (I) :=\n String4_To_Int32 (Item (4 * (I - 1) + 1 .. 4 * I));\n Current_Index := Current_Index + 1;\n end loop;\n\n declare\n Last_String : String4 := (others => Character'Val (0));\n Chars_Left : constant Natural := Item'Length mod 4;\n begin\n Last_String (1 .. Chars_Left) :=\n Item (Item'Last - Chars_Left + 1 .. Item'Last);\n Last_String (Chars_Left + 1) := Character'Val (2#1000_0000#);\n Result (Current_Index) := String4_To_Int32 (Last_String);\n Current_Index := Current_Index + 1;\n end;\n\n Result (Current_Index .. Result'Last) := (others => 0);\n -- append length as bit count\n Result (Result'Last - 1) := Item'Length * 2 ** 3; -- mod 2 ** 32;\n Result (Result'Last) := Item'Length / 2 ** (32 - 3);\n return Result;\n end;\n end Pad_String;\n\n function Turn_Around (X : Int32) return Int32 is\n Result : Int32 := 0;\n begin\n for Byte in 1 .. 4 loop\n Result := Result * 16#100#;\n Result := Result + (X / (2 ** (8 * (Byte - 1)))) mod 16#100#;\n end loop;\n return Result;\n end Turn_Around;\n\n function MD5 (Input : String) return MD5_Hash is\n function F (X, Y, Z : Int32) return Int32 is\n begin\n return Z xor (X and (Y xor Z));\n end F;\n function G (X, Y, Z : Int32) return Int32 is\n begin\n return (X and Z) or (Y and (not Z));\n end G;\n function H (X, Y, Z : Int32) return Int32 is\n begin\n return X xor Y xor Z;\n end H;\n function I (X, Y, Z : Int32) return Int32 is\n begin\n return Y xor (X or (not Z));\n end I;\n T : constant Int32_Array :=\n (16#d76aa478#, 16#e8c7b756#, 16#242070db#, 16#c1bdceee#,\n 16#f57c0faf#, 16#4787c62a#, 16#a8304613#, 16#fd469501#,\n 16#698098d8#, 16#8b44f7af#, 16#ffff5bb1#, 16#895cd7be#,\n 16#6b901122#, 16#fd987193#, 16#a679438e#, 16#49b40821#,\n 16#f61e2562#, 16#c040b340#, 16#265e5a51#, 16#e9b6c7aa#,\n 16#d62f105d#, 16#02441453#, 16#d8a1e681#, 16#e7d3fbc8#,\n 16#21e1cde6#, 16#c33707d6#, 16#f4d50d87#, 16#455a14ed#,\n 16#a9e3e905#, 16#fcefa3f8#, 16#676f02d9#, 16#8d2a4c8a#,\n 16#fffa3942#, 16#8771f681#, 16#6d9d6122#, 16#fde5380c#,\n 16#a4beea44#, 16#4bdecfa9#, 16#f6bb4b60#, 16#bebfbc70#,\n 16#289b7ec6#, 16#eaa127fa#, 16#d4ef3085#, 16#04881d05#,\n 16#d9d4d039#, 16#e6db99e5#, 16#1fa27cf8#, 16#c4ac5665#,\n 16#f4292244#, 16#432aff97#, 16#ab9423a7#, 16#fc93a039#,\n 16#655b59c3#, 16#8f0ccc92#, 16#ffeff47d#, 16#85845dd1#,\n 16#6fa87e4f#, 16#fe2ce6e0#, 16#a3014314#, 16#4e0811a1#,\n 16#f7537e82#, 16#bd3af235#, 16#2ad7d2bb#, 16#eb86d391#);\n A : Int32 := 16#67452301#;\n B : Int32 := 16#EFCDAB89#;\n C : Int32 := 16#98BADCFE#;\n D : Int32 := 16#10325476#;\n Padded_String : constant Int32_Array := Pad_String (Input);\n begin\n for Block512 in 1 .. Padded_String'Length / 16 loop\n declare\n Words : constant Int32_Array (1 .. 16) :=\n Padded_String (16 * (Block512 - 1) + 1 .. 16 * Block512);\n AA : constant Int32 := A;\n BB : constant Int32 := B;\n CC : constant Int32 := C;\n DD : constant Int32 := D;\n begin\n -- round 1\n A := B + Rotate_Left ((A + F (B, C, D) + Words (1) + T (1)), 7);\n D := A + Rotate_Left ((D + F (A, B, C) + Words (2) + T (2)), 12);\n C := D + Rotate_Left ((C + F (D, A, B) + Words (3) + T (3)), 17);\n B := C + Rotate_Left ((B + F (C, D, A) + Words (4) + T (4)), 22);\n A := B + Rotate_Left ((A + F (B, C, D) + Words (5) + T (5)), 7);\n D := A + Rotate_Left ((D + F (A, B, C) + Words (6) + T (6)), 12);\n C := D + Rotate_Left ((C + F (D, A, B) + Words (7) + T (7)), 17);\n B := C + Rotate_Left ((B + F (C, D, A) + Words (8) + T (8)), 22);\n A := B + Rotate_Left ((A + F (B, C, D) + Words (9) + T (9)), 7);\n D := A + Rotate_Left ((D + F (A, B, C) + Words (10) + T (10)), 12);\n C := D + Rotate_Left ((C + F (D, A, B) + Words (11) + T (11)), 17);\n B := C + Rotate_Left ((B + F (C, D, A) + Words (12) + T (12)), 22);\n A := B + Rotate_Left ((A + F (B, C, D) + Words (13) + T (13)), 7);\n D := A + Rotate_Left ((D + F (A, B, C) + Words (14) + T (14)), 12);\n C := D + Rotate_Left ((C + F (D, A, B) + Words (15) + T (15)), 17);\n B := C + Rotate_Left ((B + F (C, D, A) + Words (16) + T (16)), 22);\n -- round 2\n A := B + Rotate_Left ((A + G (B, C, D) + Words (2) + T (17)), 5);\n D := A + Rotate_Left ((D + G (A, B, C) + Words (7) + T (18)), 9);\n C := D + Rotate_Left ((C + G (D, A, B) + Words (12) + T (19)), 14);\n B := C + Rotate_Left ((B + G (C, D, A) + Words (1) + T (20)), 20);\n A := B + Rotate_Left ((A + G (B, C, D) + Words (6) + T (21)), 5);\n D := A + Rotate_Left ((D + G (A, B, C) + Words (11) + T (22)), 9);\n C := D + Rotate_Left ((C + G (D, A, B) + Words (16) + T (23)), 14);\n B := C + Rotate_Left ((B + G (C, D, A) + Words (5) + T (24)), 20);\n A := B + Rotate_Left ((A + G (B, C, D) + Words (10) + T (25)), 5);\n D := A + Rotate_Left ((D + G (A, B, C) + Words (15) + T (26)), 9);\n C := D + Rotate_Left ((C + G (D, A, B) + Words (4) + T (27)), 14);\n B := C + Rotate_Left ((B + G (C, D, A) + Words (9) + T (28)), 20);\n A := B + Rotate_Left ((A + G (B, C, D) + Words (14) + T (29)), 5);\n D := A + Rotate_Left ((D + G (A, B, C) + Words (3) + T (30)), 9);\n C := D + Rotate_Left ((C + G (D, A, B) + Words (8) + T (31)), 14);\n B := C + Rotate_Left ((B + G (C, D, A) + Words (13) + T (32)), 20);\n -- round 3\n A := B + Rotate_Left ((A + H (B, C, D) + Words (6) + T (33)), 4);\n D := A + Rotate_Left ((D + H (A, B, C) + Words (9) + T (34)), 11);\n C := D + Rotate_Left ((C + H (D, A, B) + Words (12) + T (35)), 16);\n B := C + Rotate_Left ((B + H (C, D, A) + Words (15) + T (36)), 23);\n A := B + Rotate_Left ((A + H (B, C, D) + Words (2) + T (37)), 4);\n D := A + Rotate_Left ((D + H (A, B, C) + Words (5) + T (38)), 11);\n C := D + Rotate_Left ((C + H (D, A, B) + Words (8) + T (39)), 16);\n B := C + Rotate_Left ((B + H (C, D, A) + Words (11) + T (40)), 23);\n A := B + Rotate_Left ((A + H (B, C, D) + Words (14) + T (41)), 4);\n D := A + Rotate_Left ((D + H (A, B, C) + Words (1) + T (42)), 11);\n C := D + Rotate_Left ((C + H (D, A, B) + Words (4) + T (43)), 16);\n B := C + Rotate_Left ((B + H (C, D, A) + Words (7) + T (44)), 23);\n A := B + Rotate_Left ((A + H (B, C, D) + Words (10) + T (45)), 4);\n D := A + Rotate_Left ((D + H (A, B, C) + Words (13) + T (46)), 11);\n C := D + Rotate_Left ((C + H (D, A, B) + Words (16) + T (47)), 16);\n B := C + Rotate_Left ((B + H (C, D, A) + Words (3) + T (48)), 23);\n -- round 4\n A := B + Rotate_Left ((A + I (B, C, D) + Words (1) + T (49)), 6);\n D := A + Rotate_Left ((D + I (A, B, C) + Words (8) + T (50)), 10);\n C := D + Rotate_Left ((C + I (D, A, B) + Words (15) + T (51)), 15);\n B := C + Rotate_Left ((B + I (C, D, A) + Words (6) + T (52)), 21);\n A := B + Rotate_Left ((A + I (B, C, D) + Words (13) + T (53)), 6);\n D := A + Rotate_Left ((D + I (A, B, C) + Words (4) + T (54)), 10);\n C := D + Rotate_Left ((C + I (D, A, B) + Words (11) + T (55)), 15);\n B := C + Rotate_Left ((B + I (C, D, A) + Words (2) + T (56)), 21);\n A := B + Rotate_Left ((A + I (B, C, D) + Words (9) + T (57)), 6);\n D := A + Rotate_Left ((D + I (A, B, C) + Words (16) + T (58)), 10);\n C := D + Rotate_Left ((C + I (D, A, B) + Words (7) + T (59)), 15);\n B := C + Rotate_Left ((B + I (C, D, A) + Words (14) + T (60)), 21);\n A := B + Rotate_Left ((A + I (B, C, D) + Words (5) + T (61)), 6);\n D := A + Rotate_Left ((D + I (A, B, C) + Words (12) + T (62)), 10);\n C := D + Rotate_Left ((C + I (D, A, B) + Words (3) + T (63)), 15);\n B := C + Rotate_Left ((B + I (C, D, A) + Words (10) + T (64)), 21);\n -- increment\n A := A + AA;\n B := B + BB;\n C := C + CC;\n D := D + DD;\n end;\n end loop;\n return\n (Turn_Around (A),\n Turn_Around (B),\n Turn_Around (C),\n Turn_Around (D));\n end MD5;\n\n function To_String (Item : MD5_Hash) return MD5_String is\n Hex_Chars : constant array (0 .. 15) of Character :=\n ('0', '1', '2', '3', '4', '5', '6', '7',\n '8', '9', 'a', 'b', 'c', 'd', 'e', 'f');\n Result : MD5_String := (1 => '0',\n 2 => 'x',\n others => '0');\n Temp : Int32;\n Position : Natural := Result'Last;\n begin\n for Part in reverse Item'Range loop\n Temp := Item (Part);\n while Position > Result'Last - (5 - Part) * 8 loop\n Result (Position) := Hex_Chars (Natural (Temp mod 16));\n Position := Position - 1;\n Temp := Temp / 16;\n end loop;\n end loop;\n return Result;\n end To_String;\n\nend MD5;\n","language":"Ada"},{"code":"with Ada.Strings.Unbounded;\nwith Ada.Text_IO;\nwith MD5;\n\nprocedure Tester is\n use Ada.Strings.Unbounded;\n type String_Array is array (Positive range <>) of Unbounded_String;\n Sources : constant String_Array :=\n (To_Unbounded_String (\"\"),\n To_Unbounded_String (\"a\"),\n To_Unbounded_String (\"abc\"),\n To_Unbounded_String (\"message digest\"),\n To_Unbounded_String (\"abcdefghijklmnopqrstuvwxyz\"),\n To_Unbounded_String\n (\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"),\n To_Unbounded_String\n (\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\")\n );\n Digests : constant String_Array :=\n (To_Unbounded_String (\"0xd41d8cd98f00b204e9800998ecf8427e\"),\n To_Unbounded_String (\"0x0cc175b9c0f1b6a831c399e269772661\"),\n To_Unbounded_String (\"0x900150983cd24fb0d6963f7d28e17f72\"),\n To_Unbounded_String (\"0xf96b697d7cb7938d525a2f31aaf161d0\"),\n To_Unbounded_String (\"0xc3fcd3d76192e4007dfb496cca67e13b\"),\n To_Unbounded_String (\"0xd174ab98d277d9f5a5611c2c9f419d9f\"),\n To_Unbounded_String (\"0x57edf4a22be3c955ac49da2e2107b67a\"));\nbegin\n for I in Sources'Range loop\n Ada.Text_IO.Put_Line (\"MD5 (\"\"\" & To_String (Sources (I)) & \"\"\"):\");\n Ada.Text_IO.Put_Line\n (MD5.To_String (MD5.MD5 (To_String (Sources (I)))));\n Ada.Text_IO.Put_Line (To_String (Digests (I)) & \" (correct value)\");\n end loop;\nend Tester;\n","language":"Ada"},{"code":" PRINT FN_MD5(\"\")\n PRINT FN_MD5(\"a\")\n PRINT FN_MD5(\"abc\")\n PRINT FN_MD5(\"message digest\")\n PRINT FN_MD5(\"abcdefghijklmnopqrstuvwxyz\")\n PRINT FN_MD5(\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\")\n PRINT FN_MD5(STRING$(8,\"1234567890\"))\n END\n\n DEF FN_MD5(message$)\n LOCAL a%, b%, c%, d%, f%, g%, h0%, h1%, h2%, h3%, i%, bits%, chunk%, temp%\n LOCAL r&(), k%(), w%()\n DIM r&(63), k%(63), w%(15)\n\n REM r specifies the per-round shift amounts:\n r&() = 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, \\\n \\ 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, \\\n \\ 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, \\\n \\ 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21\n\n REM Use binary integer part of the sines of integers (Radians) as constants:\n FOR i% = 0 TO 63\n k%(i%) = FN32(INT(ABS(SIN(i% + 1.0#)) * 2^32))\n NEXT\n\n REM Initialize variables:\n h0% = &67452301\n h1% = &EFCDAB89\n h2% = &98BADCFE\n h3% = &10325476\n\n bits% = LEN(message$)*8\n\n REM Append '1' bit to message:\n message$ += CHR$&80\n\n REM Append '0' bits until message length in bits = 448 (mod 512):\n WHILE (LEN(message$) MOD 64) <> 56\n message$ += CHR$0\n ENDWHILE\n\n REM Append length of message (before pre-processing), in bits, as\n REM 64-bit little-endian integer:\n FOR i% = 0 TO 56 STEP 8\n message$ += CHR$(bits% >>> i%)\n NEXT\n\n REM Process the message in successive 512-bit chunks:\n FOR chunk% = 0 TO LEN(message$) DIV 64 - 1\n\n REM Break chunk into sixteen 32-bit little-endian words:\n FOR i% = 0 TO 15\n w%(i%) = !(PTR(message$) + 64*chunk% + 4*i%)\n NEXT i%\n\n REM Initialize hash value for this chunk:\n a% = h0%\n b% = h1%\n c% = h2%\n d% = h3%\n\n REM Main loop:\n FOR i% = 0 TO 63\n CASE TRUE OF\n WHEN i% <= 15:\n f% = d% EOR (b% AND (c% EOR d%))\n g% = i%\n WHEN 16 <= i% AND i% <= 31:\n f% = c% EOR (d% AND (b% EOR c%))\n g% = (5 * i% + 1) MOD 16\n WHEN 32 <= i% AND i% <= 47:\n f% = b% EOR c% EOR d%\n g% = (3 * i% + 5) MOD 16\n OTHERWISE:\n f% = c% EOR (b% OR (NOT d%))\n g% = (7 * i%) MOD 16\n ENDCASE\n\n temp% = d%\n d% = c%\n c% = b%\n b% = FN32(b% + FNlrot(FN32(a% + f%) + FN32(k%(i%) + w%(g%)), r&(i%)))\n a% = temp%\n\n NEXT i%\n\n REM Add this chunk's hash to result so far:\n h0% = FN32(h0% + a%)\n h1% = FN32(h1% + b%)\n h2% = FN32(h2% + c%)\n h3% = FN32(h3% + d%)\n\n NEXT chunk%\n\n = FNrevhex(h0%) + FNrevhex(h1%) + FNrevhex(h2%) + FNrevhex(h3%)\n\n DEF FNrevhex(A%)\n SWAP ?(^A%+0),?(^A%+3)\n SWAP ?(^A%+1),?(^A%+2)\n = RIGHT$(\"0000000\"+STR$~A%,8)\n\n DEF FNlrot(n#, r%)\n n# = FN32(n#)\n = (n# << r%) OR (n# >>> (32 - r%))\n\n DEF FN32(n#)\n WHILE n# > &7FFFFFFF : n# -= 2^32 : ENDWHILE\n WHILE n# < &80000000 : n# += 2^32 : ENDWHILE\n = n#\n","language":"BBC-BASIC"},{"code":"\t/// Represent digest with ABCD\n\tsealed public class Digest\n\t{\n\t\tpublic uint A;\n\t\tpublic uint B;\n\t\tpublic uint C;\n\t\tpublic uint D;\n\n\t\tpublic Digest()\n\t\t{\n\t\t\tA=(uint)MD5InitializerConstant.A;\n\t\t\tB=(uint)MD5InitializerConstant.B;\n\t\t\tC=(uint)MD5InitializerConstant.C;\n\t\t\tD=(uint)MD5InitializerConstant.D;\n \t }\n\n\t\tpublic override string ToString()\n\t\t{\n\t\t\tstring st ;\n\t\t\tst= MD5Helper.ReverseByte(A).ToString(\"X8\")+\n\t\t\t MD5Helper.ReverseByte(B).ToString(\"X8\")+\n MD5Helper.ReverseByte(C).ToString(\"X8\")+\n\t\t\t MD5Helper.ReverseByte(D).ToString(\"X8\");\n\t\t\treturn st;\n\t\t\t\n\t\t}\n\t}\n\n\tpublic class MD5\n\t{\n\t\t/***********************VARIABLES************************************/\n\n\n\t\t/***********************Statics**************************************/\n\t\t/// <summary>\n\t\t/// lookup table 4294967296*sin(i)\n\t\t/// </summary>\n\t\tprotected readonly static uint [] T =new uint[64]\n\t\t\t{\t0xd76aa478,0xe8c7b756,0x242070db,0xc1bdceee,\n\t\t\t\t0xf57c0faf,0x4787c62a,0xa8304613,0xfd469501,\n 0x698098d8,0x8b44f7af,0xffff5bb1,0x895cd7be,\n 0x6b901122,0xfd987193,0xa679438e,0x49b40821,\n\t\t\t\t0xf61e2562,0xc040b340,0x265e5a51,0xe9b6c7aa,\n 0xd62f105d,0x2441453,0xd8a1e681,0xe7d3fbc8,\n 0x21e1cde6,0xc33707d6,0xf4d50d87,0x455a14ed,\n\t\t\t\t0xa9e3e905,0xfcefa3f8,0x676f02d9,0x8d2a4c8a,\n 0xfffa3942,0x8771f681,0x6d9d6122,0xfde5380c,\n 0xa4beea44,0x4bdecfa9,0xf6bb4b60,0xbebfbc70,\n 0x289b7ec6,0xeaa127fa,0xd4ef3085,0x4881d05,\n\t\t\t\t0xd9d4d039,0xe6db99e5,0x1fa27cf8,0xc4ac5665,\n 0xf4292244,0x432aff97,0xab9423a7,0xfc93a039,\n 0x655b59c3,0x8f0ccc92,0xffeff47d,0x85845dd1,\n 0x6fa87e4f,0xfe2ce6e0,0xa3014314,0x4e0811a1,\n\t\t\t\t0xf7537e82,0xbd3af235,0x2ad7d2bb,0xeb86d391};\n\t\t\n\t\t/*****instance variables**************/\n\t\t/// <summary>\n\t\t/// X used to proces data in\n\t\t///\t512 bits chunks as 16 32 bit word\n\t\t/// </summary>\n\t\tprotected uint [] X = new uint [16];\t\n\t\t\n\t\t/// <summary>\n\t\t/// the finger print obtained.\n\t\t/// </summary>\n\t\tprotected Digest dgFingerPrint;\t\t\t\n\n\t\t/// <summary>\n\t\t/// the input bytes\n\t\t/// </summary>\n\t\tprotected\tbyte [] m_byteInput;\t\t\n\t\t\n\t\n\t\t\n\t\t/**********************EVENTS AND DELEGATES*******************************************/\n\n\t\tpublic delegate void ValueChanging (object sender,MD5ChangingEventArgs Changing);\n\t\tpublic delegate void ValueChanged (object sender,MD5ChangedEventArgs Changed);\n\n\n\t\tpublic event ValueChanging OnValueChanging;\n\t\tpublic event ValueChanged OnValueChanged;\n\n\n\t\t\n\t\t/********************************************************************/\n\t\t/***********************PROPERTIES ***********************/\n\t\t/// <summary>\n\t\t///gets or sets as string\n\t\t/// </summary>\n\t\tpublic string Value\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\tstring st ;\n\t\t\t\tchar [] tempCharArray= new Char[m_byteInput.Length];\n\t\t\t\t\n\t\t\t\tfor(int i =0; i<m_byteInput.Length;i++)\n\t\t\t\t\ttempCharArray[i]=(char)m_byteInput[i];\n\n\t\t\t\tst= new String(tempCharArray);\n\t\t\t\treturn st;\n\t\t\t}\n\t\t\tset\n\t\t\t{\n\t\t\t\t/// raise the event to notify the changing\n\t\t\t\tif (this.OnValueChanging !=null)\n\t\t\t\t\tthis.OnValueChanging(this,new MD5ChangingEventArgs(value));\n\n\n\t\t\t\tm_byteInput=new byte[value.Length];\n\t\t\t\tfor (int i =0; i<value.Length;i++)\n\t\t\t\t\tm_byteInput[i]=(byte)value[i];\n\t\t\t\tdgFingerPrint=CalculateMD5Value();\t\t\t\t\n\n\t\t\t\t/// raise the event to notify the change\n\t\t\t\tif (this.OnValueChanged !=null)\n\t\t\t\t\tthis.OnValueChanged(this,new MD5ChangedEventArgs(value,dgFingerPrint.ToString()));\n\t\t\t\t\n\t\t\t}\n\t\t}\t\t\n\t\t\n\t\t/// <summary>\n\t\t/// get/sets as byte array\n\t\t/// </summary>\n\t\tpublic byte [] ValueAsByte\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\tbyte [] bt = new byte[m_byteInput.Length];\n\t\t\t\tfor (int i =0; i<m_byteInput.Length;i++)\n\t\t\t\t\tbt[i]=m_byteInput[i];\n\t\t\t\treturn bt;\n }\n\t\t\tset\n\t\t\t{\n\t\t\t\t/// raise the event to notify the changing\n\t\t\t\tif (this.OnValueChanging !=null)\n\t\t\t\t\tthis.OnValueChanging(this,new MD5ChangingEventArgs(value));\n\n\t\t\t\tm_byteInput=new byte[value.Length];\n\t\t\t\tfor (int i =0; i<value.Length;i++)\n\t\t\t\t\tm_byteInput[i]=value[i];\n\t\t\t\tdgFingerPrint=CalculateMD5Value();\n\n\t\n\t\t\t\t/// notify the changed value\n\t\t\t\tif (this.OnValueChanged !=null)\n\t\t\t\t\tthis.OnValueChanged(this,new MD5ChangedEventArgs(value,dgFingerPrint.ToString()));\n\t\t\t}\n\t\t}\n\n\t\t//gets the signature/figner print as string\n\t\tpublic string FingerPrint\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\treturn dgFingerPrint.ToString();\n\t\t\t}\n\t\t}\n\n\n\t\t/*************************************************************************/\n\t\t/// <summary>\n\t\t/// Constructor\n\t\t/// </summary>\n\t\tpublic MD5()\n\t\t{\t\t\t\n\t\t\tValue=\"\";\n\t\t}\n\t\t\n\t\t\n\t\t/******************************************************************************/\n\t\t/*********************METHODS**************************/\n\n\t\t/// <summary>\n\t\t/// calculat md5 signature of the string in Input\n\t\t/// </summary>\n\t\t/// <returns> Digest: the finger print of msg</returns>\n\t\tprotected Digest CalculateMD5Value()\n\t\t{\n\t\t\t/***********vairable declaration**************/\n\t\t\tbyte [] bMsg;\t//buffer to hold bits\n\t\t\tuint N;\t\t\t//N is the size of msg as word (32 bit)\n\t\t\tDigest dg =new Digest();\t\t\t// the value to be returned\n\n\t\t\t// create a buffer with bits padded and length is alos padded\n\t\t\tbMsg=CreatePaddedBuffer();\n\n\t\t\tN=(uint)(bMsg.Length*8)/32;\t\t//no of 32 bit blocks\n\t\t\t\n\t\t\tfor (uint i=0; i<N/16;i++)\n\t\t\t{\n\t\t\t\tCopyBlock(bMsg,i);\n\t\t\t\tPerformTransformation(ref dg.A,ref dg.B,ref dg.C,ref dg.D);\n\t\t\t}\n\t\t\treturn dg;\n\t\t}\n\t\n\t\t/********************************************************\n\t\t * TRANSFORMATIONS : FF , GG , HH , II acc to RFC 1321\n\t\t * where each Each letter represnets the aux function used\n\t\t *********************************************************/\n\n\n\n\t\t/// <summary>\n\t\t/// perform transformatio using f(((b&c) | (~(b)&d))\n\t\t/// </summary>\n\t\tprotected void TransF(ref uint a, uint b, uint c, uint d,uint k,ushort s, uint i )\n\t\t{\n\t\t\ta = b + MD5Helper.RotateLeft((a + ((b&c) | (~(b)&d)) + X[k] + T[i-1]), s);\n\t\t}\n\n\t\t/// <summary>\n\t\t/// perform transformatio using g((b&d) | (c & ~d) )\n\t\t/// </summary>\n\t\tprotected void TransG(ref uint a, uint b, uint c, uint d,uint k,ushort s, uint i )\n\t\t{\n\t\t\ta = b + MD5Helper.RotateLeft((a + ((b&d) | (c & ~d) ) + X[k] + T[i-1]), s);\n\t\t}\n\t\t\n\t\t/// <summary>\n\t\t/// perform transformatio using h(b^c^d)\n\t\t/// </summary>\n\t\tprotected void TransH(ref uint a, uint b, uint c, uint d,uint k,ushort s, uint i )\n\t\t{\n\t\t\ta = b + MD5Helper.RotateLeft((a + (b^c^d) + X[k] + T[i-1]), s);\n\t\t}\n\t\t\n\t\t/// <summary>\n\t\t/// perform transformatio using i (c^(b|~d))\n\t\t/// </summary>\n\t\tprotected void TransI(ref uint a, uint b, uint c, uint d,uint k,ushort s, uint i )\n\t\t{\n\t\t\ta = b + MD5Helper.RotateLeft((a + (c^(b|~d))+ X[k] + T[i-1]), s);\n\t\t}\n\t\t\n\t\t\n\t\t\n\t\t/// <summary>\n\t\t/// Perform All the transformation on the data\n\t\t/// </summary>\n\t\t/// <param name=\"A\">A</param>\n\t\t/// <param name=\"B\">B </param>\n\t\t/// <param name=\"C\">C</param>\n\t\t/// <param name=\"D\">D</param>\n\t\tprotected void PerformTransformation(ref uint A,ref uint B,ref uint C, ref uint D)\n\t\t{\n\t\t\t//// saving ABCD to be used in end of loop\n\t\t\t\n\t\t\tuint AA,BB,CC,DD;\n\n\t\t\tAA=A;\t\n\t\t\tBB=B;\n\t\t\tCC=C;\n\t\t\tDD=D;\n\n\t\t\t/* Round 1\n\t\t\t\t* [ABCD 0 7 1] [DABC 1 12 2] [CDAB 2 17 3] [BCDA 3 22 4]\n\t\t\t\t* [ABCD 4 7 5] [DABC 5 12 6] [CDAB 6 17 7] [BCDA 7 22 8]\n\t\t\t\t* [ABCD 8 7 9] [DABC 9 12 10] [CDAB 10 17 11] [BCDA 11 22 12]\n\t\t\t\t* [ABCD 12 7 13] [DABC 13 12 14] [CDAB 14 17 15] [BCDA 15 22 16]\n\t\t\t\t* * */\n\t\t\tTransF(ref A,B,C,D,0,7,1);TransF(ref D,A,B,C,1,12,2);TransF(ref C,D,A,B,2,17,3);TransF(ref B,C,D,A,3,22,4);\n\t\t\tTransF(ref A,B,C,D,4,7,5);TransF(ref D,A,B,C,5,12,6);TransF(ref C,D,A,B,6,17,7);TransF(ref B,C,D,A,7,22,8);\n\t\t\tTransF(ref A,B,C,D,8,7,9);TransF(ref D,A,B,C,9,12,10);TransF(ref C,D,A,B,10,17,11);TransF(ref B,C,D,A,11,22,12);\n\t\t\tTransF(ref A,B,C,D,12,7,13);TransF(ref D,A,B,C,13,12,14);TransF(ref C,D,A,B,14,17,15);TransF(ref B,C,D,A,15,22,16);\n\t\t\t/** rOUND 2\n\t\t\t\t**[ABCD 1 5 17] [DABC 6 9 18] [CDAB 11 14 19] [BCDA 0 20 20]\n\t\t\t\t*[ABCD 5 5 21] [DABC 10 9 22] [CDAB 15 14 23] [BCDA 4 20 24]\n\t\t\t\t*[ABCD 9 5 25] [DABC 14 9 26] [CDAB 3 14 27] [BCDA 8 20 28]\n\t\t\t\t*[ABCD 13 5 29] [DABC 2 9 30] [CDAB 7 14 31] [BCDA 12 20 32]\n\t\t\t*/\n\t\t\tTransG(ref A,B,C,D,1,5,17);TransG(ref D,A,B,C,6,9,18);TransG(ref C,D,A,B,11,14,19);TransG(ref B,C,D,A,0,20,20);\n\t\t\tTransG(ref A,B,C,D,5,5,21);TransG(ref D,A,B,C,10,9,22);TransG(ref C,D,A,B,15,14,23);TransG(ref B,C,D,A,4,20,24);\n\t\t\tTransG(ref A,B,C,D,9,5,25);TransG(ref D,A,B,C,14,9,26);TransG(ref C,D,A,B,3,14,27);TransG(ref B,C,D,A,8,20,28);\n\t\t\tTransG(ref A,B,C,D,13,5,29);TransG(ref D,A,B,C,2,9,30);TransG(ref C,D,A,B,7,14,31);TransG(ref B,C,D,A,12,20,32);\n\t\t\t/* rOUND 3\n\t\t\t\t* [ABCD 5 4 33] [DABC 8 11 34] [CDAB 11 16 35] [BCDA 14 23 36]\n\t\t\t\t* [ABCD 1 4 37] [DABC 4 11 38] [CDAB 7 16 39] [BCDA 10 23 40]\n\t\t\t\t* [ABCD 13 4 41] [DABC 0 11 42] [CDAB 3 16 43] [BCDA 6 23 44]\n\t\t\t\t* [ABCD 9 4 45] [DABC 12 11 46] [CDAB 15 16 47] [BCDA 2 23 48]\n\t\t\t * */\n\t\t\tTransH(ref A,B,C,D,5,4,33);TransH(ref D,A,B,C,8,11,34);TransH(ref C,D,A,B,11,16,35);TransH(ref B,C,D,A,14,23,36);\n\t\t\tTransH(ref A,B,C,D,1,4,37);TransH(ref D,A,B,C,4,11,38);TransH(ref C,D,A,B,7,16,39);TransH(ref B,C,D,A,10,23,40);\n\t\t\tTransH(ref A,B,C,D,13,4,41);TransH(ref D,A,B,C,0,11,42);TransH(ref C,D,A,B,3,16,43);TransH(ref B,C,D,A,6,23,44);\n\t\t\tTransH(ref A,B,C,D,9,4,45);TransH(ref D,A,B,C,12,11,46);TransH(ref C,D,A,B,15,16,47);TransH(ref B,C,D,A,2,23,48);\n\t\t\t/*ORUNF 4\n\t\t\t\t*[ABCD 0 6 49] [DABC 7 10 50] [CDAB 14 15 51] [BCDA 5 21 52]\n\t\t\t\t*[ABCD 12 6 53] [DABC 3 10 54] [CDAB 10 15 55] [BCDA 1 21 56]\n\t\t\t\t*[ABCD 8 6 57] [DABC 15 10 58] [CDAB 6 15 59] [BCDA 13 21 60]\n\t\t\t\t*[ABCD 4 6 61] [DABC 11 10 62] [CDAB 2 15 63] [BCDA 9 21 64]\n\t\t\t\t\t\t * */\n\t\t\tTransI(ref A,B,C,D,0,6,49);TransI(ref D,A,B,C,7,10,50);TransI(ref C,D,A,B,14,15,51);TransI(ref B,C,D,A,5,21,52);\n\t\t\tTransI(ref A,B,C,D,12,6,53);TransI(ref D,A,B,C,3,10,54);TransI(ref C,D,A,B,10,15,55);TransI(ref B,C,D,A,1,21,56);\n\t\t\tTransI(ref A,B,C,D,8,6,57);TransI(ref D,A,B,C,15,10,58);TransI(ref C,D,A,B,6,15,59);TransI(ref B,C,D,A,13,21,60);\n\t\t\tTransI(ref A,B,C,D,4,6,61);TransI(ref D,A,B,C,11,10,62);TransI(ref C,D,A,B,2,15,63);TransI(ref B,C,D,A,9,21,64);\n\n\n\t\t\tA=A+AA;\n\t\t\tB=B+BB;\n\t\t\tC=C+CC;\n\t\t\tD=D+DD;\n\n\n\t\t}\n\n\n\t\t/// <summary>\n\t\t/// Create Padded buffer for processing , buffer is padded with 0 along\n\t\t/// with the size in the end\n\t\t/// </summary>\n\t\t/// <returns>the padded buffer as byte array</returns>\n\t\tprotected byte[] CreatePaddedBuffer()\n\t\t{\n\t\t\tuint pad;\t\t//no of padding bits for 448 mod 512\n\t\t\tbyte [] bMsg;\t//buffer to hold bits\n\t\t\tulong sizeMsg;\t\t//64 bit size pad\n\t\t\tuint sizeMsgBuff;\t//buffer size in multiple of bytes\n\t\t\tint temp=(448-((m_byteInput.Length*8)%512)); //temporary\n\n\n\t\t\tpad = (uint )((temp+512)%512);\t\t//getting no of bits to be pad\n\t\t\tif (pad==0)\t\t\t\t///pad is in bits\n\t\t\t\tpad=512;\t\t\t//at least 1 or max 512 can be added\n\n\t\t\tsizeMsgBuff= (uint) ((m_byteInput.Length)+ (pad/8)+8);\n\t\t\tsizeMsg=(ulong)m_byteInput.Length*8;\n\t\t\tbMsg=new byte[sizeMsgBuff];\t///no need to pad with 0 coz new bytes\n\t\t\t// are already initialize to 0 :)\n\n\n\n\n\t\t\t////copying string to buffer\n\t\t\tfor (int i =0; i<m_byteInput.Length;i++)\n\t\t\t\tbMsg[i]=m_byteInput[i];\n\n\t\t\tbMsg[m_byteInput.Length]|=0x80;\t\t///making first bit of padding 1,\n\t\t\t\n\t\t\t//wrting the size value\n\t\t\tfor (int i =8; i >0;i--)\n\t\t\t\tbMsg[sizeMsgBuff-i]=(byte) (sizeMsg>>((8-i)*8) & 0x00000000000000ff);\n\n\t\t\treturn bMsg;\n\t\t}\n\n\n\t\t/// <summary>\n\t\t/// Copies a 512 bit block into X as 16 32 bit words\n\t\t/// </summary>\n\t\t/// <param name=\"bMsg\"> source buffer</param>\n\t\t/// <param name=\"block\">no of block to copy starting from 0</param>\n\t\tprotected void CopyBlock(byte[] bMsg,uint block)\n\t\t{\n\n\t\t\tblock=block<<6;\n\t\t\tfor (uint j=0; j<61;j+=4)\n\t\t\t{\n\t\t\t\tX[j>>2]=(((uint) bMsg[block+(j+3)]) <<24 ) |\n\t\t\t\t\t\t(((uint) bMsg[block+(j+2)]) <<16 ) |\n\t\t\t\t\t\t(((uint) bMsg[block+(j+1)]) <<8 ) |\n\t\t\t\t\t\t(((uint) bMsg[block+(j)]) ) ;\n\t\t\t\n\t\t\t}\n\t\t}\n\t}\n","language":"C-sharp"},{"code":"System.Security.Cryptography.MD5CryptoServiceProvider x = new System.Security.Cryptography.MD5CryptoServiceProvider();\nbyte[] bs = System.Text.Encoding.UTF8.GetBytes(password);\nbs = x.ComputeHash(bs); //this function is not in the above classdefinition\nSystem.Text.StringBuilder s = new System.Text.StringBuilder();\nforeach (byte b in bs)\n{\n s.Append(b.ToString(\"x2\").ToLower());\n}\npassword = s.ToString();\n","language":"C-sharp"},{"code":"# Array sum helper function.\nsum = (array) ->\n array.reduce (x, y) -> x + y\n\nmd5 = do ->\n # Per-round shift amounts.\n s = [738695, 669989, 770404, 703814]\n s = (s[i >> 4] >> i % 4 * 5 & 31 for i in [0..63])\n\n # Constants cache generated by sine.\n K = (Math.floor 2**32 * Math.abs Math.sin i for i in [1..64])\n\n # Bitwise left rotate helper function.\n lrot = (x, y) ->\n x << y | x >>> 32 - y;\n\n (input) ->\n # Initialize values.\n d0 = 0x10325476;\n a0 = 0x67452301;\n b0 = ~d0\n c0 = ~a0;\n\n # Convert the message to 32-bit words, little-endian.\n M =\n for i in [0...input.length] by 4\n sum (input.charCodeAt(i + j) << j*8 for j in [0..3])\n\n # Pre-processing: append a 1 bit, then message length % 2^64.\n len = input.length * 8\n M[len >> 5] |= 128 << len % 32\n M[(len + 64 >>> 9 << 4) + 14] = len\n\n # Process the message in chunks of 16 32-bit words.\n for x in [0...M.length] by 16\n [A, B, C, D] = [a0, b0, c0, d0]\n\n # Main loop.\n for i in [0..63]\n if i < 16\n F = B & C | ~B & D\n g = i\n else if i < 32\n F = B & D | C & ~D\n g = i * 5 + 1\n else if i < 48\n F = B ^ C ^ D\n g = i * 3 + 5\n else\n F = C ^ (B | ~D)\n g = i * 7\n\n [A, B, C, D] =\n [D, B + lrot(A + F + K[i] + (M[x + g % 16] ? 0), s[i]), B, C]\n\n a0 += A\n b0 += B\n c0 += C\n d0 += D\n\n # Convert the four words back to a string.\n return (\n for x in [a0, b0, c0, d0]\n (String.fromCharCode x >>> 8 * y & 255 for y in [0..3]).join ''\n ).join ''\n","language":"CoffeeScript"},{"code":"str2hex = do ->\n hex = ['0', '1', '2', '3', '4', '5', '6', '7',\n '8', '9', 'a', 'b', 'c', 'd', 'e', 'f']\n hex = (hex[x >> 4] + hex[x & 15] for x in [0..255])\n (str) ->\n (hex[c.charCodeAt()] for c in str).join ''\n\nconsole.log str2hex md5 message for message in [\n \"\"\n \"a\"\n \"abc\"\n \"message digest\"\n \"abcdefghijklmnopqrstuvwxyz\"\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"\n \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"\n]\n","language":"CoffeeScript"},{"code":"(defpackage #:md5\n (:use #:cl))\n\n(in-package #:md5)\n\n(require :babel)\n\n(deftype word () '(unsigned-byte 32))\n(deftype octet () '(unsigned-byte 8))\n(deftype octets () '(vector octet))\n\n(defparameter *s*\n (make-array 16 :element-type 'word\n :initial-contents '(7 12 17 22\n 5 9 14 20\n 4 11 16 23\n 6 10 15 21)))\n\n(defun s (i)\n (declare ((integer 0 63) i))\n (aref *s* (+ (ash (ash i -4) 2)\n (ldb (byte 2 0) i))))\n\n(defparameter *k*\n (loop with result = (make-array 64 :element-type 'word)\n for i from 0 below 64\n do (setf (aref result i) (floor (* (ash 1 32) (abs (sin (1+ (float i 1d0)))))))\n finally (return result)))\n\n(defun wrap (bits integer)\n (declare (fixnum bits) (integer integer))\n (ldb (byte bits 0) integer))\n\n(defun integer->8octets (integer)\n (declare (integer integer))\n (loop for n = (wrap 64 integer) then (ash n -8)\n repeat 8\n collect (wrap 8 n)))\n\n(defun pad-octets (octets)\n (declare (octets octets))\n (let* ((octets-length (length octets))\n (zero-pad-length (- 64 (mod (+ octets-length 9) 64)))\n (zero-pads (loop repeat zero-pad-length collect 0)))\n (concatenate 'octets octets '(#x80) zero-pads (integer->8octets (* 8 octets-length)))))\n\n(defun octets->words (octets)\n (declare (octets octets))\n (loop with result = (make-array (/ (length octets) 4) :element-type 'word)\n for n from 0 below (length octets) by 4\n for i from 0\n do (setf (aref result i)\n (dpb (aref octets (+ n 3)) (byte 8 24)\n (dpb (aref octets (+ n 2)) (byte 8 16)\n (dpb (aref octets (1+ n)) (byte 8 8)\n (dpb (aref octets n) (byte 8 0) 0)))))\n finally (return result)))\n\n(defun words->octets (&rest words)\n (loop for word of-type word in words\n collect (ldb (byte 8 0) word)\n collect (ldb (byte 8 8) word)\n collect (ldb (byte 8 16) word)\n collect (ldb (byte 8 24) word)))\n\n(defun left-rotate (x c)\n (declare (integer x) (fixnum c))\n (let ((x (wrap 32 x)))\n (wrap 32 (logior (ash x c)\n (ash x (- c 32))))))\n\n(defun md5 (string)\n (declare (string string))\n (loop with m = (octets->words (pad-octets (babel:string-to-octets string)))\n with a0 of-type word = #x67452301\n with b0 of-type word = #xefcdab89\n with c0 of-type word = #x98badcfe\n with d0 of-type word = #x10325476\n for j from 0 below (length m) by 16\n do (loop for a of-type word = a0 then d\n and b of-type word = b0 then new-b\n and c of-type word = c0 then b\n and d of-type word = d0 then c\n for i from 0 below 64\n for new-b = (multiple-value-bind (f g)\n (ecase (ash i -4)\n (0 (values (wrap 32 (logior (logand b c)\n (logand (lognot b) d)))\n i))\n (1 (values (wrap 32 (logior (logand d b)\n (logand (lognot d) c)))\n (wrap 4 (1+ (* 5 i)))))\n (2 (values (wrap 32 (logxor b c d))\n (wrap 4 (+ (* 3 i) 5))))\n (3 (values (wrap 32 (logxor c\n (logior b (lognot d))))\n (wrap 4 (* 7 i)))))\n (declare (word f g))\n (wrap 32 (+ b (left-rotate (+ a f (aref *k* i) (aref m (+ j g)))\n (s i)))))\n finally (setf a0 (wrap 32 (+ a0 a))\n b0 (wrap 32 (+ b0 b))\n c0 (wrap 32 (+ c0 c))\n d0 (wrap 32 (+ d0 d))))\n finally (return (with-output-to-string (s)\n (dolist (o (words->octets a0 b0 c0 d0))\n (format s \"~(~2,'0X~)\" o))))))\n\n(defun test-cases ()\n (assert (string= \"d41d8cd98f00b204e9800998ecf8427e\"\n (md5 \"\")))\n (assert (string= \"0cc175b9c0f1b6a831c399e269772661\"\n (md5 \"a\")))\n (assert (string= \"900150983cd24fb0d6963f7d28e17f72\"\n (md5 \"abc\")))\n (assert (string= \"f96b697d7cb7938d525a2f31aaf161d0\"\n (md5 \"message digest\")))\n (assert (string= \"c3fcd3d76192e4007dfb496cca67e13b\"\n (md5 \"abcdefghijklmnopqrstuvwxyz\")))\n (assert (string= \"d174ab98d277d9f5a5611c2c9f419d9f\"\n (md5 \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\")))\n (assert (string= \"57edf4a22be3c955ac49da2e2107b67a\"\n (md5 \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"))))\n","language":"Common-Lisp"},{"code":"import std.bitmanip, core.stdc.string, std.conv, std.math, std.array,\n std.string;\n\nversion (D_InlineAsm_X86) {} else {\n static assert(false, \"For X86 machine only.\");\n}\n\n// CTFE construction of transform expressions.\nuint S(in uint n) pure nothrow @safe @nogc {\n static immutable aux = [7u, 12, 17, 22, 5, 9, 14, 20, 4, 11,\n 16, 23, 6, 10, 15, 21];\n return aux[(n / 16) * 4 + (n % 4)];\n}\n\nuint K(in uint n) pure nothrow @safe @nogc {\n uint r = 0;\n if (n <= 15)\n r = n;\n else if (n <= 31)\n r = 5 * n + 1;\n else if (n <= 47)\n r = 3 * n + 5;\n else\n r = 7 * n;\n return r % 16;\n}\n\nuint T(in uint n) pure nothrow @nogc {\n return cast(uint)(abs(sin(n + 1.0L)) * (2UL ^^ 32));\n}\n\nstring[] ABCD(in int n) pure nothrow {\n enum abcd = [\"EAX\", \"EBX\", \"ECX\", \"EDX\"];\n return abcd[(64 - n) % 4 .. 4] ~ abcd[0 .. (64 - n) % 4];\n}\n\nstring SUB(in int n, in string s) pure nothrow {\n return s\n .replace(\"ax\", n.ABCD[0])\n .replace(\"bx\", n.ABCD[1])\n .replace(\"cx\", n.ABCD[2])\n .replace(\"dx\", n.ABCD[3]);\n}\n\n// FF, GG, HH & II expressions part 1 (F, G, H, I).\nstring fghi1(in int n) pure nothrow @nogc {\n switch (n / 16) {\n case 0:\n // (bb & cc) | (~bb & dd)\n return q{\n mov ESI, bx;\n mov EDI, bx;\n not ESI;\n and EDI, cx;\n and ESI, dx;\n or EDI, ESI;\n add ax, EDI;\n };\n case 1:\n // (dd & bb) | (~dd & cc)\n return q{\n mov ESI, dx;\n mov EDI, dx;\n not ESI;\n and EDI, bx;\n and ESI, cx;\n or EDI, ESI;\n add ax, EDI;\n };\n case 2: // (bb ^ cc ^ dd)\n return q{\n mov EDI, bx;\n xor EDI, cx;\n xor EDI, dx;\n add ax, EDI;\n };\n case 3: // (cc ^ (bb | ~dd))\n return q{\n mov EDI, dx;\n not EDI;\n or EDI, bx;\n xor EDI, cx;\n add ax, EDI;\n };\n default:\n assert(false);\n }\n}\n\n// FF, GG, HH & II expressions part 2.\nstring fghi2(in int n) pure nothrow {\n return q{\n add ax, [EBP + 4 * KK];\n add ax, TT;\n } ~ n.fghi1;\n}\n\n// FF, GG, HH & II expressions prepended with previous parts\n// & subsitute ABCD.\nstring FGHI(in int n) pure nothrow {\n // aa = ((aa << SS)|( aa >>> (32 - SS))) + bb = ROL(aa, SS) + bb\n return SUB(n, n.fghi2 ~ q{\n rol ax, SS;\n add ax, bx;\n });\n}\n\nstring genExpr(uint n) pure nothrow {\n return FGHI(n)\n .replace(\"SS\", n.S.text)\n .replace(\"KK\", n.K.text)\n .replace(\"TT\", \"0x\" ~ to!string(n.T, 16));\n}\n\nstring genTransformCode(int n) pure nothrow {\n return (n < 63) ? n.genExpr ~ genTransformCode(n + 1) : n.genExpr;\n}\n\nenum string coreZMD5 = 0.genTransformCode;\n\nstruct ZMD5 {\n uint[4] state = [0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476];\n ulong count;\n ubyte[64] buffer;\n\n ubyte[64] padding = [\n 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0];\n\n private void transform(ubyte* block) pure nothrow @nogc {\n uint[16] x = void;\n\n version (BigEndian) {\n foreach (immutable i; 0 .. 16)\n x[i] = littleEndianToNative!uint(*cast(ubyte[4]*)&block[i * 4]);\n } else {\n (cast(ubyte*)x.ptr)[0 .. 64] = block[0 .. 64];\n }\n\n auto pState = state.ptr;\n auto pBuffer = x.ptr;\n\n asm pure nothrow @nogc {\n mov ESI, pState[EBP];\n mov EDX, [ESI + 3 * 4];\n mov ECX, [ESI + 2 * 4];\n mov EBX, [ESI + 1 * 4];\n mov EAX, [ESI + 0 * 4];\n push EBP;\n push ESI;\n\n mov EBP, pBuffer[EBP];\n }\n\n mixin(\"asm pure nothrow @nogc { \" ~ coreZMD5 ~ \"}\");\n\n asm pure nothrow @nogc {\n pop ESI;\n pop EBP;\n add [ESI + 0 * 4], EAX;\n add [ESI + 1 * 4], EBX;\n add [ESI + 2 * 4], ECX;\n add [ESI + 3 * 4], EDX;\n }\n x[] = 0;\n }\n\n void update(in void[] input) pure nothrow @nogc {\n auto inputLen = input.length;\n uint index = (count >> 3) & 0b11_1111U;\n count += inputLen * 8;\n immutable uint partLen = 64 - index;\n\n uint i;\n if (inputLen >= partLen) {\n memcpy(&buffer[index], input.ptr, partLen);\n transform(buffer.ptr);\n for (i = partLen; i + 63 < inputLen; i += 64)\n transform((cast(ubyte[])input)[i .. i + 64].ptr);\n index = 0;\n } else\n i = 0;\n\n if (inputLen - i)\n memcpy(&buffer[index], &input[i], inputLen - i);\n }\n\n void finish(ref ubyte[16] digest) pure nothrow @nogc {\n ubyte[8] bits = void;\n bits[0 .. 8] = nativeToLittleEndian(count)[];\n\n immutable uint index = (count >> 3) & 0b11_1111U;\n immutable uint padLen = (index < 56) ?\n (56 - index) : (120 - index);\n update(padding[0 .. padLen]);\n update(bits);\n\n digest[0 .. 4] = nativeToLittleEndian(state[0])[];\n digest[4 .. 8] = nativeToLittleEndian(state[1])[];\n digest[8 .. 12] = nativeToLittleEndian(state[2])[];\n digest[12 .. 16] = nativeToLittleEndian(state[3])[];\n\n // Zeroize sensitive information.\n memset(&this, 0, ZMD5.sizeof);\n }\n}\n\nstring getDigestString(in void[][] data...) pure {\n ZMD5 ctx;\n foreach (datum; data)\n ctx.update(datum);\n ubyte[16] digest;\n ctx.finish(digest);\n return format(\"%-(%02X%)\", digest);\n}\n\n\nvoid main() { // Benchmark code --------------\n import std.stdio, std.datetime, std.digest.md;\n\n writefln(`md5 digest(\"\") = %-(%02X%)`, \"\".md5Of);\n writefln(`zmd5 digest(\"\") = %s`, \"\".getDigestString);\n\n enum megaBytes = 512;\n writefln(\"\\nTest performance / message size %dMBytes:\", megaBytes);\n auto data = new float[megaBytes * 0x40000 + 13];\n\n StopWatch sw;\n sw.start;\n immutable d1 = data.md5Of;\n sw.stop;\n immutable time1 = sw.peek.msecs / 1000.0;\n writefln(\"digest(data) = %-(%02X%)\", d1);\n writefln(\"std.md5: %8.2f M/sec ( %8.2f secs)\",\n megaBytes / time1, time1);\n\n sw.reset;\n sw.start;\n immutable d2 = data.getDigestString;\n sw.stop;\n immutable time2 = sw.peek.msecs / 1000.0;\n writefln(\"digest(data) = %s\", d2);\n writefln(\"zmd5 : %8.2f M/sec ( %8.2f secs)\",\n megaBytes / time2, time2);\n}\n","language":"D"},{"code":"program MD5Implementation;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils,\n System.Classes;\n\ntype\n TTestCase = record\n hashCode: string;\n _: string;\n end;\n\nvar\n testCases: array[0..6] of TTestCase = ((\n hashCode: 'D41D8CD98F00B204E9800998ECF8427E';\n _: ''\n ), (\n hashCode: '0CC175B9C0F1B6A831C399E269772661';\n _: 'a'\n ), (\n hashCode: '900150983CD24FB0D6963F7D28E17F72';\n _: 'abc'\n ), (\n hashCode: 'F96B697D7CB7938D525A2F31AAF161D0';\n _: 'message digest'\n ), (\n hashCode: 'C3FCD3D76192E4007DFB496CCA67E13B';\n _: 'abcdefghijklmnopqrstuvwxyz'\n ), (\n hashCode: 'D174AB98D277D9F5A5611C2C9F419D9F';\n _: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'\n ), (\n hashCode: '57EDF4A22BE3C955AC49DA2E2107B67A';\n _: '12345678901234567890123456789' + '012345678901234567890123456789012345678901234567890'\n ));\n shift: array of UInt32 = [7, 12, 17, 22, 5, 9, 14, 20, 4, 11, 16, 23, 6, 10, 15, 21];\n table: array[0..63] of UInt32;\n\nprocedure Init();\nvar\n i: integer;\n\n function fAbs(x: Extended): Extended;\n begin\n if x < 0 then\n exit(-x);\n exit(x);\n end;\n\nbegin\n for i := 0 to High(table) do\n table[i] := Trunc((UInt64(1) shl 32) * fAbs(Sin(i + 1.0)));\nend;\n\nfunction Md5(s: string): TBytes;\nconst\n BUFFER_SIZE = 16;\nvar\n binary: TBytesStream;\n buffer: Tarray<UInt32>;\n messageLenBits: UInt64;\n i, j, bufferIndex, count: integer;\n byte_data: byte;\n string_data: ansistring;\n k, k1: Tarray<UInt32>;\n f, rnd, sa: UInt32;\n tmp: UInt64;\nbegin\n k := [$67452301, $EFCDAB89, $98BADCFE, $10325476];\n\n binary := TBytesStream.Create();\n\n if not s.IsEmpty then\n begin\n string_data := Utf8ToAnsi(s);\n binary.Write(Tbytes(string_data), length(string_data));\n end;\n\n byte_data := $80;\n binary.Write(byte_data, 1);\n\n messageLenBits := UInt64(s.Length * 8);\n count := s.Length + 1;\n\n while (count mod 64) <> 56 do\n begin\n byte_data := $00;\n binary.Write(byte_data, 1);\n inc(count);\n end;\n\n binary.Write(messageLenBits, sizeof(messageLenBits));\n\n SetLength(buffer, BUFFER_SIZE);\n SetLength(k1, length(k));\n\n binary.Seek(0, soFromBeginning);\n\n while binary.Read(buffer[0], BUFFER_SIZE * 4) > 0 do\n begin\n for i := 0 to 3 do\n k1[i] := k[i];\n\n for i := 0 to 63 do\n begin\n f := 0;\n bufferIndex := i;\n rnd := i shr 4;\n case rnd of\n 0:\n f := (k1[1] and k1[2]) or (not k1[1] and k1[3]);\n 1:\n begin\n f := (k1[1] and k1[3]) or (k1[2] and not k1[3]);\n bufferIndex := (bufferIndex * 5 + 1) and $0F\n end;\n 2:\n begin\n f := k1[1] xor k1[2] xor k1[3];\n bufferIndex := (bufferIndex * 3 + 5) and $0F;\n end;\n 3:\n begin\n f := k1[2] xor (k1[1] or not k1[3]);\n bufferIndex := (bufferIndex * 7) and $0F;\n end;\n end;\n\n sa := shift[(rnd shl 2) or (i and 3)];\n\n k1[0] := k1[0] + f + buffer[bufferIndex] + table[i];\n\n tmp := k1[0];\n\n k1[0] := k1[3];\n k1[3] := k1[2];\n k1[2] := k1[1];\n\n k1[1] := ((tmp shl sa) or (tmp shr (32 - sa))) + k1[1];\n end;\n\n for i := 0 to 3 do\n k[i] := k[i] + k1[i];\n end;\n\n SetLength(result, BUFFER_SIZE);\n\n binary.Clear;\n for i := 0 to 3 do\n binary.Write(k[i], 4);\n\n binary.Seek(0, soBeginning);\n\n binary.Read(Result, BUFFER_SIZE);\n\n binary.Free;\nend;\n\nfunction BytesToString(b: TBytes): string;\nvar\n v: byte;\nbegin\n Result := '';\n for v in b do\n Result := Result + v.ToHexString(2);\nend;\n\nvar\n tc: TTestCase;\n\nbegin\n Init;\n\n for tc in testCases do\n Writeln(Format('%s'#10'%s'#10, [tc.hashCode, BytesToString(md5(tc._))]));\n Readln;\nend.\n","language":"Delphi"},{"code":"len md5k[] 64\nproc md5init . .\n for i = 1 to 64\n md5k[i] = floor (0x100000000 * abs sin (i * 180 / pi))\n .\n.\nmd5init\n#\nproc md5 inp$ . s$ .\n subr addinp\n if inp4 = 1\n inp[] &= 0\n .\n inp[len inp[]] += b * inp4\n inp4 *= 0x100\n if inp4 = 0x100000000\n inp4 = 1\n .\n .\n s[] = [ 7 12 17 22 7 12 17 22 7 12 17 22 7 12 17 22 5 9 14 20 5 9 14 20 5 9 14 20 5 9 14 20 4 11 16 23 4 11 16 23 4 11 16 23 4 11 16 23 6 10 15 21 6 10 15 21 6 10 15 21 6 10 15 21 ]\n inp[] = [ ]\n inp4 = 1\n for i = 1 to len inp$\n b = strcode substr inp$ i 1\n addinp\n .\n b = 0x80\n addinp\n while len inp[] mod 16 <> 14 or inp4 <> 1\n b = 0\n addinp\n .\n h = len inp$ * 8\n for i = 1 to 4\n b = h mod 0x100\n addinp\n h = h div 0x100\n .\n inp[] &= 0\n #\n a0 = 0x67452301\n b0 = 0xefcdab89\n c0 = 0x98badcfe\n d0 = 0x10325476\n for chunk = 1 step 16 to len inp[] - 15\n a = a0 ; b = b0 ; c = c0 ; d = d0\n for i = 1 to 64\n if i <= 16\n h1 = bitand b c\n h2 = bitand bitnot b d\n f = bitor h1 h2\n g = i - 1\n elif i <= 32\n h1 = bitand d b\n h2 = bitand bitnot d c\n f = bitor h1 h2\n g = (5 * i - 4) mod 16\n elif i <= 48\n h1 = bitxor b c\n f = bitxor h1 d\n g = (3 * i + 2) mod 16\n else\n h1 = bitor b bitnot d\n f = bitxor c h1\n g = (7 * i - 7) mod 16\n .\n f = (f + a + md5k[i] + inp[chunk + g])\n a = d\n d = c\n c = b\n h1 = bitshift f s[i]\n h2 = bitshift f (s[i] - 32)\n b = (b + h1 + h2)\n .\n a0 += a ; b0 += b ; c0 += c ; d0 += d\n .\n s$ = \"\"\n for a in [ a0 b0 c0 d0 ]\n for i = 1 to 4\n b = a mod 256\n a = a div 256\n for h in [ b div 16 b mod 16 ]\n h += 48\n if h > 57\n h += 39\n .\n s$ &= strchar h\n .\n .\n .\n.\nrepeat\n s$ = input\n until error = 1\n md5 s$ h$\n print h$\n.\ninput_data\na\nabc\nmessage digest\nabcdefghijklmnopqrstuvwxyz\nABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\n12345678901234567890123456789012345678901234567890123456789012345678901234567890\n","language":"EasyLang"},{"code":"let fxyz x y z : uint32 = (x &&& y) ||| (~~~x &&& z)\nlet gxyz x y z : uint32 = (z &&& x) ||| (~~~z &&& y)\nlet hxyz x y z : uint32 = x ^^^ y ^^^ z\nlet ixyz x y z : uint32 = y ^^^ (x ||| ~~~z)\nlet fghi = [ fxyz; gxyz; hxyz; ixyz ] |> List.collect (List.replicate 16)\nlet g1Idx = id\nlet g2Idx i = (5 * i + 1) % 16\nlet g3Idx i = (3 * i + 5) % 16\nlet g4Idx i = (7 * i) % 16\n\nlet gIdxs =\n [ g1Idx; g2Idx; g3Idx; g4Idx ]\n |> List.collect (List.replicate 16)\n |> List.map2 (fun idx func -> func idx) [ 0..63 ]\n\nlet s =\n [ [ 7; 12; 17; 22 ]\n [ 5; 9; 14; 20 ]\n [ 4; 11; 16; 23 ]\n [ 6; 10; 15; 21 ] ]\n |> List.collect (List.replicate 4)\n |> List.concat\n\nlet k =\n [ 1...64. ] |> List.map (sin\n >> abs\n >> ((*) (2. ** 32.))\n >> floor\n >> uint32)\n\ntype MD5 =\n { a : uint32\n b : uint32\n c : uint32\n d : uint32 }\n\nlet initialMD5 =\n { a = 0x67452301u\n b = 0xefcdab89u\n c = 0x98badcfeu\n d = 0x10325476u }\n\nlet md5round (msg : uint32 []) { MD5.a = a; MD5.b = b; MD5.c = c; MD5.d = d } i =\n let rotateL32 r x = (x <<< r) ||| (x >>> (32 - r))\n let f = fghi.[i] b c d\n let a' = b + (a + f + k.[i] + msg.[gIdxs.[i]]\n |> rotateL32 s.[i])\n { a = d\n b = a'\n c = b\n d = c }\n\nlet md5plus m (bs : byte []) =\n let msg =\n bs\n |> Array.chunkBySize 4\n |> Array.take 16\n |> Array.map (fun elt -> System.BitConverter.ToUInt32(elt, 0))\n\n let m' = List.fold (md5round msg) m [ 0..63 ]\n { a = m.a + m'.a\n b = m.b + m'.b\n c = m.c + m'.c\n d = m.d + m'.d }\n\nlet padMessage (msg : byte []) =\n let msgLen = Array.length msg\n let msgLenInBits = (uint64 msgLen) * 8UL\n\n let lastSegmentSize =\n let m = msgLen % 64\n if m = 0 then 64\n else m\n\n let padLen =\n 64 - lastSegmentSize + (if lastSegmentSize >= 56 then 64\n else 0)\n\n [| yield 128uy\n for i in 2..padLen - 8 do\n yield 0uy\n for i in 0..7 do\n yield ((msgLenInBits >>> (8 * i)) |> byte) |]\n |> Array.append msg\n\nlet md5sum (msg : string) =\n System.Text.Encoding.ASCII.GetBytes msg\n |> padMessage\n |> Array.chunkBySize 64\n |> Array.fold md5plus initialMD5\n |> (fun { MD5.a = a; MD5.b = b; MD5.c = c; MD5.d = d } ->\n System.BitConverter.GetBytes a\n |> (fun x -> System.BitConverter.GetBytes b |> Array.append x)\n |> (fun x -> System.BitConverter.GetBytes c |> Array.append x)\n |> (fun x -> System.BitConverter.GetBytes d |> Array.append x))\n |> Array.map (sprintf \"%02X\")\n |> Array.reduce (+)\n","language":"F-Sharp"},{"code":"' version 19-10-2016\n' MD5 from the Wikipedia page \"MD5\"\n' compile with: fbc -s console\n\n' macro for a rotate left\n#Macro ROtate_Left (x, n) ' rotate left\n (x) = (x) Shl (n) + (x) Shr (32 - (n))\n#EndMacro\n\nFunction MD5(test_str As String) As String\n\n Dim As String message = test_str ' strings are passed as ByRef's\n\n Dim As UByte sx, s(0 To ...) = { 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, _\n 17, 22, 7, 12, 17, 22, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, _\n 5, 9, 14, 20, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, _\n 16, 23, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21 }\n\n Dim As UInteger<32> K(0 To ...) = { &Hd76aa478, &He8c7b756, &H242070db, _\n &Hc1bdceee, &Hf57c0faf, &H4787c62a, &Ha8304613, &Hfd469501, &H698098d8, _\n &H8b44f7af, &Hffff5bb1, &H895cd7be, &H6b901122, &Hfd987193, &Ha679438e, _\n &H49b40821, &Hf61e2562, &Hc040b340, &H265e5a51, &He9b6c7aa, &Hd62f105d, _\n &H02441453, &Hd8a1e681, &He7d3fbc8, &H21e1cde6, &Hc33707d6, &Hf4d50d87, _\n &H455a14ed, &Ha9e3e905, &Hfcefa3f8, &H676f02d9, &H8d2a4c8a, &Hfffa3942, _\n &H8771f681, &H6d9d6122, &Hfde5380c, &Ha4beea44, &H4bdecfa9, &Hf6bb4b60, _\n &Hbebfbc70, &H289b7ec6, &Heaa127fa, &Hd4ef3085, &H04881d05, &Hd9d4d039, _\n &He6db99e5, &H1fa27cf8, &Hc4ac5665, &Hf4292244, &H432aff97, &Hab9423a7, _\n &Hfc93a039, &H655b59c3, &H8f0ccc92, &Hffeff47d, &H85845dd1, &H6fa87e4f, _\n &Hfe2ce6e0, &Ha3014314, &H4e0811a1, &Hf7537e82, &Hbd3af235, &H2ad7d2bb, _\n &Heb86d391 }\n\n ' Initialize variables\n Dim As UInteger<32> A, a0 = &H67452301\n Dim As UInteger<32> B, b0 = &Hefcdab89\n Dim As UInteger<32> C, c0 = &H98badcfe\n Dim As UInteger<32> D, d0 = &H10325476\n Dim As UInteger<32> dtemp, F, g, temp\n\n Dim As Long i, j\n\n Dim As ULongInt l = Len(message)\n ' set the first bit after the message to 1\n message = message + Chr(1 Shl 7)\n ' add one char to the length\n Dim As ULong padding = 64 - ((l +1) Mod (512 \\ 8)) ' 512 \\ 8 = 64 char.\n\n ' check if we have enough room for inserting the length\n If padding < 8 Then padding = padding + 64\n\n message = message + String(padding, Chr(0)) ' adjust length\n Dim As ULong l1 = Len(message) ' new length\n\n l = l * 8 ' orignal length in bits\n ' create ubyte ptr to point to l ( = length in bits)\n Dim As UByte Ptr ub_ptr = Cast(UByte Ptr, @l)\n\n For i = 0 To 7 'copy length of message to the last 8 bytes\n message[l1 -8 + i] = ub_ptr[i]\n Next\n\n For j = 0 To (l1 -1) \\ 64 ' split into block of 64 bytes\n\n A = a0 : B = b0 : C = c0 : D = d0\n\n ' break chunk into 16 32bit uinteger\n Dim As UInteger<32> Ptr M = Cast(UInteger<32> Ptr, @message[j * 64])\n\n For i = 0 To 63\n Select Case As Const i\n Case 0 To 15\n F = (B And C) Or ((Not B) And D)\n g = i\n Case 16 To 31\n F = (B And D) Or (C And (Not D))\n g = (i * 5 +1) Mod 16\n Case 32 To 47\n F = (B Xor C Xor D)\n g = (i * 3 +5) Mod 16\n Case 48 To 63\n F = C Xor (B Or (Not D))\n g = (i * 7) Mod 16\n End Select\n dtemp = D\n D = C\n C = B\n temp = A + F + K(i)+ M[g] : ROtate_left(temp, s(i))\n B = B + temp\n A = dtemp\n Next\n\n a0 += A : b0 += B : c0 += C : d0 += D\n\n Next\n\n Dim As String answer\n ' convert a0, b0, c0 and d0 in hex, then add, low order first\n Dim As String s1 = Hex(a0, 8)\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\n s1 = Hex(b0, 8)\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\n s1 = Hex(c0, 8)\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\n s1 = Hex(d0, 8)\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\n\nReturn LCase(answer)\n\nEnd Function\n\n\n' ------=< MAIN >=------\n\nDim As String test, hash, md5_hash\nDim As ULong i\n\nFor i = 1 To 7\n Read hash, test\n md5_hash = MD5(test)\n\n Print\n Print test\n Print hash\n Print md5_hash;\n\n If hash = md5_hash Then\n Print \" PASS\"\n Else\n Print \" FAIL\"\n Beep\n End If\n\nNext\n\n' testdata\nData \"d41d8cd98f00b204e9800998ecf8427e\", \"\"\nData \"0cc175b9c0f1b6a831c399e269772661\", \"a\"\nData \"900150983cd24fb0d6963f7d28e17f72\", \"abc\"\nData \"f96b697d7cb7938d525a2f31aaf161d0\", \"message digest\"\nData \"c3fcd3d76192e4007dfb496cca67e13b\", \"abcdefghijklmnopqrstuvwxyz\"\nData \"d174ab98d277d9f5a5611c2c9f419d9f\"\nData \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"\nData \"57edf4a22be3c955ac49da2e2107b67a\"\nData \"123456789012345678901234567890123456789012345678901234567890\" _\n + \"12345678901234567890\"\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\"\n \"bytes\"\n \"encoding/binary\"\n)\n\ntype testCase struct {\n hashCode string\n string\n}\n\nvar testCases = []testCase{\n {\"d41d8cd98f00b204e9800998ecf8427e\", \"\"},\n {\"0cc175b9c0f1b6a831c399e269772661\", \"a\"},\n {\"900150983cd24fb0d6963f7d28e17f72\", \"abc\"},\n {\"f96b697d7cb7938d525a2f31aaf161d0\", \"message digest\"},\n {\"c3fcd3d76192e4007dfb496cca67e13b\", \"abcdefghijklmnopqrstuvwxyz\"},\n {\"d174ab98d277d9f5a5611c2c9f419d9f\",\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"},\n {\"57edf4a22be3c955ac49da2e2107b67a\", \"12345678901234567890\" +\n \"123456789012345678901234567890123456789012345678901234567890\"},\n}\n\nfunc main() {\n for _, tc := range testCases {\n fmt.Printf(\"%s\\n%x\\n\\n\", tc.hashCode, md5(tc.string))\n }\n}\n\nvar shift = [...]uint{7, 12, 17, 22, 5, 9, 14, 20, 4, 11, 16, 23, 6, 10, 15, 21}\nvar table [64]uint32\n\nfunc init() {\n for i := range table {\n table[i] = uint32((1 << 32) * math.Abs(math.Sin(float64(i + 1))))\n }\n}\n\nfunc md5(s string) (r [16]byte) {\n padded := bytes.NewBuffer([]byte(s))\n padded.WriteByte(0x80)\n for padded.Len() % 64 != 56 {\n padded.WriteByte(0)\n }\n messageLenBits := uint64(len(s)) * 8\n binary.Write(padded, binary.LittleEndian, messageLenBits)\n\n var a, b, c, d uint32 = 0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476\n var buffer [16]uint32\n for binary.Read(padded, binary.LittleEndian, buffer[:]) == nil { // read every 64 bytes\n a1, b1, c1, d1 := a, b, c, d\n for j := 0; j < 64; j++ {\n var f uint32\n bufferIndex := j\n round := j >> 4\n switch round {\n case 0:\n f = (b1 & c1) | (^b1 & d1)\n case 1:\n f = (b1 & d1) | (c1 & ^d1)\n bufferIndex = (bufferIndex*5 + 1) & 0x0F\n case 2:\n f = b1 ^ c1 ^ d1\n bufferIndex = (bufferIndex*3 + 5) & 0x0F\n case 3:\n f = c1 ^ (b1 | ^d1)\n bufferIndex = (bufferIndex * 7) & 0x0F\n }\n sa := shift[(round<<2)|(j&3)]\n a1 += f + buffer[bufferIndex] + table[j]\n a1, d1, c1, b1 = d1, c1, b1, a1<<sa|a1>>(32-sa)+b1\n }\n a, b, c, d = a+a1, b+b1, c+c1, d+d1\n }\n\n binary.Write(bytes.NewBuffer(r[:0]), binary.LittleEndian, []uint32{a, b, c, d})\n return\n}\n","language":"Go"},{"code":"class MD5 {\n\n private static final int INIT_A = 0x67452301\n private static final int INIT_B = (int)0xEFCDAB89L\n private static final int INIT_C = (int)0x98BADCFEL\n private static final int INIT_D = 0x10325476\n\n private static final int[] SHIFT_AMTS = [\n 7, 12, 17, 22,\n 5, 9, 14, 20,\n 4, 11, 16, 23,\n 6, 10, 15, 21\n ]\n\n private static final int[] TABLE_T = new int[64]\n static\n {\n for (int i in 0..63)\n TABLE_T[i] = (int)(long)((1L << 32) * Math.abs(Math.sin(i + 1)))\n }\n\n static byte[] computeMD5(byte[] message)\n {\n int messageLenBytes = message.length\n int numBlocks = ((messageLenBytes + 8) >>> 6) + 1\n int totalLen = numBlocks << 6\n byte[] paddingBytes = new byte[totalLen - messageLenBytes]\n paddingBytes[0] = (byte)0x80\n\n long messageLenBits = (long)messageLenBytes << 3\n for (int i in 0..7)\n {\n paddingBytes[paddingBytes.length - 8 + i] = (byte)messageLenBits\n messageLenBits >>>= 8\n }\n\n int a = INIT_A\n int b = INIT_B\n int c = INIT_C\n int d = INIT_D\n int[] buffer = new int[16]\n for (int i in 0..(numBlocks - 1))\n {\n int index = i << 6\n for (int j in 0..63) {\n buffer[j >>> 2] = ((int) ((index < messageLenBytes) ? message[index] : paddingBytes[index - messageLenBytes]) << 24) | (buffer[j >>> 2] >>> 8)\n index++\n }\n int originalA = a\n int originalB = b\n int originalC = c\n int originalD = d\n for (int j in 0..63)\n {\n int div16 = j >>> 4\n int f = 0\n int bufferIndex = j\n switch (div16)\n {\n case 0:\n f = (b & c) | (~b & d)\n break\n\n case 1:\n f = (b & d) | (c & ~d)\n bufferIndex = (bufferIndex * 5 + 1) & 0x0F\n break\n\n case 2:\n f = b ^ c ^ d\n bufferIndex = (bufferIndex * 3 + 5) & 0x0F\n break\n\n case 3:\n f = c ^ (b | ~d)\n bufferIndex = (bufferIndex * 7) & 0x0F\n break\n }\n int temp = b + Integer.rotateLeft(a + f + buffer[bufferIndex] + TABLE_T[j], SHIFT_AMTS[(div16 << 2) | (j & 3)])\n a = d\n d = c\n c = b\n b = temp\n }\n\n a += originalA\n b += originalB\n c += originalC\n d += originalD\n }\n\n byte[] md5 = new byte[16]\n int count = 0\n for (int i in 0..3)\n {\n int n = (i == 0) ? a : ((i == 1) ? b : ((i == 2) ? c : d))\n for (int j in 0..3)\n {\n md5[count++] = (byte)n\n n >>>= 8\n }\n }\n return md5\n }\n\n static String toHexString(byte[] b)\n {\n StringBuilder sb = new StringBuilder()\n for (int i in 0..(b.length - 1))\n {\n sb.append(String.format(\"%02X\", b[i] & 0xFF))\n }\n return sb.toString()\n }\n\n static void main(String[] args)\n {\n String[] testStrings = [\"\", \"a\", \"abc\", \"message digest\", \"abcdefghijklmnopqrstuvwxyz\",\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\",\n \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\" ]\n for (String s : testStrings)\n System.out.println(\"0x\" + toHexString(computeMD5(s.getBytes())) + \" <== \\\"\" + s + \"\\\"\")\n }\n\n}\n","language":"Groovy"},{"code":"import Control.Monad (replicateM)\n\nimport qualified Data.ByteString.Lazy as BL\nimport qualified Data.ByteString.Lazy.Char8 as BLC\nimport Data.Binary.Get\nimport Data.Binary.Put\nimport Data.Bits\n\nimport Data.Array (Array, listArray, (!))\nimport Data.List (foldl)\nimport Data.Word (Word32)\n\nimport Numeric (showHex)\n\n\n-- functions\ntype Fun = Word32 -> Word32 -> Word32 -> Word32\n\nfunF, funG, funH, funI :: Fun\nfunF x y z = (x .&. y) .|. (complement x .&. z)\nfunG x y z = (x .&. z) .|. (complement z .&. y)\nfunH x y z = x `xor` y `xor` z\nfunI x y z = y `xor` (complement z .|. x)\n\nidxF, idxG, idxH, idxI :: Int -> Int\nidxF i = i\nidxG i = (5 * i + 1) `mod` 16\nidxH i = (3 * i + 5) `mod` 16\nidxI i = 7 * i `mod` 16\n\n\n-- arrays\nfunA :: Array Int Fun\nfunA = listArray (1,64) $ replicate 16 =<< [funF, funG, funH, funI]\n\nidxA :: Array Int Int\nidxA = listArray (1,64) $ zipWith ($) (replicate 16 =<< [idxF, idxG, idxH, idxI]) [0..63]\n\nrotA :: Array Int Int\nrotA = listArray (1,64) $ concat . replicate 4 =<<\n [[7, 12, 17, 22], [5, 9, 14, 20], [4, 11, 16, 23], [6, 10, 15, 21]]\n\nsinA :: Array Int Word32\nsinA = listArray (1,64) $ map (floor . (*mult) . abs . sin) [1..64]\n where mult = 2 ** 32 :: Double\n\n\n-- to lazily calculate MD5 sum for standart input:\n-- main = putStrLn . md5sum =<< BL.getContents\n\nmain :: IO ()\nmain = mapM_ (putStrLn . md5sum . BLC.pack)\n [ \"\"\n , \"a\"\n , \"abc\"\n , \"message digest\"\n , \"abcdefghijklmnopqrstuvwxyz\"\n , \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"\n , \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"\n ]\n\n\nmd5sum :: BL.ByteString -> String\nmd5sum input =\n let MD5 a b c d = getMD5 initial `runGet` input\n in foldr hex [] . BL.unpack . runPut $ mapM_ putWord32le [a,b,c,d]\n where\n initial = MD5 0x67452301 0xEFCDAB89 0x98BADCFE 0x10325476\n\n hex x s | x < 16 = '0' : showHex x s -- quick hack: like \"%02x\"\n | otherwise = showHex x s\n\n\ndata MD5 = MD5\n { a :: {-# UNPACK #-} !Word32\n , b :: {-# UNPACK #-} !Word32\n , c :: {-# UNPACK #-} !Word32\n , d :: {-# UNPACK #-} !Word32\n }\n\n\ngetMD5 :: MD5 -> Get MD5\ngetMD5 md5 = do\n chunk <- getLazyByteString 64\n let len = BL.length chunk\n\n if len == 64\n then getMD5 $! md5 <+> chunk -- apply and process next chunk\n\n else do -- input is totally eaten, finalize\n bytes <- bytesRead\n let fin = runPut . putWord64le $ fromIntegral (bytes - 64 + len) * 8\n pad n = chunk `BL.append` (0x80 `BL.cons` BL.replicate (n - 1) 0x00)\n\n return $ if len >= 56\n then md5 <+> pad (64 - len) <+> BL.replicate 56 0x00 `BL.append` fin\n else md5 <+> pad (56 - len) `BL.append` fin\n\n\n(<+>) :: MD5 -> BL.ByteString -> MD5\ninfixl 5 <+>\nmd5@(MD5 a b c d) <+> bs =\n let datA = listArray (0,15) $ replicateM 16 getWord32le `runGet` bs\n MD5 a' b' c' d' = foldl' (md5round datA) md5 [1..64]\n in MD5 (a + a') (b + b') (c + c') (d + d')\n\n\nmd5round :: Array Int Word32 -> MD5 -> Int -> MD5\nmd5round datA (MD5 a b c d) i =\n let f = funA ! i\n w = datA ! (idxA ! i)\n a' = b + (a + f b c d + w + sinA ! i) `rotateL` rotA ! i\n in MD5 d a' b c\n","language":"Haskell"},{"code":"procedure main() # validate against the RFC test strings and more\n testMD5(\"The quick brown fox jumps over the lazy dog\", 16r9e107d9d372bb6826bd81d3542a419d6)\n testMD5(\"The quick brown fox jumps over the lazy dog.\", 16re4d909c290d0fb1ca068ffaddf22cbd0)\n testMD5(\"\", 16rd41d8cd98f00b204e9800998ecf8427e) #R = MD5 test suite from RFC\n testMD5(\"a\", 16r0cc175b9c0f1b6a831c399e269772661) #R\n testMD5(\"abc\", 16r900150983cd24fb0d6963f7d28e17f72) #R\n testMD5(\"message digest\", 16rf96b697d7cb7938d525a2f31aaf161d0) #R\n testMD5(\"abcdefghijklmnopqrstuvwxyz\", 16rc3fcd3d76192e4007dfb496cca67e13b) #R\n testMD5(\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\", 16rd174ab98d277d9f5a5611c2c9f419d9f) #R\n testMD5(\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\", 16r57edf4a22be3c955ac49da2e2107b67a) #R\nend\n\nprocedure testMD5(s,rh) # compute the MD5 hash and compare it to reference value\n write(\"Message(length=\",*s,\") = \",image(s))\n write(\"Digest = \",hexstring(h := MD5(s)),if h = rh then \" matches reference hash\" else (\" does not match reference hash = \" || hexstring(rh)),\"\\n\")\nend\n\nlink hexcvt # for testMD5\n\n$define B32 4 # 32 bits\n$define B64 8 # 64 bits in bytes\n$define B512 64 # 512 bits in bytes\n$define M32 16r100000000 # 2^32\n$define M64 16r10000000000000000 # 2^64\n\nprocedure MD5(s) #: return MD5 hash of message s\nlocal w,a,b,c,d,i,t,m\nlocal mlength,message,hash\nstatic rs,ks,istate,maxpad,g\n\ninitial {\n every (rs := []) |||:=\n (t := [ 7, 12, 17, 22] | [ 5, 9, 14, 20] | [ 4, 11, 16, 23] | [ 6, 10, 15, 21]) ||| t ||| t ||| t\n every put(ks := [],integer(M32 * abs(sin(i := 1 to 64))))\n istate := [ 16r67452301, 16rEFCDAB89, 16r98BADCFE, 16r10325476 ] # \"Magic\" IV\n maxpad := left(char(16r80),B512+B64,char(16r00)) # maximum possible padding\n g := []\n every i := 0 to 63 do # precompute offsets\n case round := i/16 of {\n 0 : put(g,i + 1)\n 1 : put(g,(5*i+1) % 16 + 1)\n\t 2 : put(g,(3*i+5) % 16 + 1)\n 3 : put(g,(7*i) % 16 + 1)\n }\n if not (*rs = *ks = 64) then runerr(500,\"MD5 setup error\")\n }\n # 1. Construct prefix\n t := (*s*8)%M64 # original message length\n s ||:= maxpad # append maximum padding\n s[0-:*s%B512] := \"\" # trim to final length\n s[0-:B64] := reverse(unsigned2string(t,B64) ) # as little endian length\n\n message := [] # 2. Subdivide message\n s ? while put(message,move(B512)) # into 512 bit blocks\n\n # 3. Transform message ...\n state := copy(istate) # Initialize hashes\n every m := !message do { # For each message block\n w := []\n m ? while put(w,unsigned(reverse(move(B32)))) # break into little-endian words\n\n a := state[1] # pick up hashes\n b := state[2]\n c := state[3]\n d := state[4]\n\n every i := 1 to 64 do { # Process 4 rounds of hashes\t\n case round := (i-1)/16 of {\n\t 0 : a +:= ixor(d, iand(b,ixor(c,d))) # 0..15 - alternate F\n 1 : a +:= ixor(c,iand(d,ixor(b,c))) # 16..31 - alternate G\t\n 2 : a +:= ixor(b,ixor(c,d)) # 32..47 - H\n 3 : a +:= ixor(c,ior(b,ixor(d,16rffffffff))) # 48..64 - alternate I\n\t } # Core of FF, GG, HH, II\n a +:= ks[i] + w[g[i]] # and the rest\n a %:= M32\n a := ior( ishift(a,rs[i]), ishift(a,-(32-rs[i]))) # 32bit rotate\n a +:= b\n a :=: b :=: c :=: d # rotate variables\n\t }\n\n state[1] +:= a # Add back new hashes\n state[2] +:= b\n state[3] +:= c\n state[4] +:= d\n every !state %:= M32 # mod 2^32\n }\n every (hash := \"\") ||:= reverse(unsigned2string(!state,4)) # little-endian digest\n return unsigned(hash)\nend\n\nprocedure unsigned2string(i,w) # uint to string pad to w bytes\nlocal s\n if i < 0 then runerr(500,i)\n s := \"\"\n while (0 < i) | (*s < \\w) do {\n s ||:= char(i % 256)\n i /:= 256\n }\n return reverse(s)\nend\n\nlink unsigned # string to unsigned integer\n","language":"Icon"},{"code":"NB. convert/misc/md5\nNB. RSA Data Security, Inc. MD5 Message-Digest Algorithm\nNB. version: 1.0.2\nNB.\nNB. See RFC 1321 for license details\nNB. J implementation -- (C) 2003 Oleg Kobchenko;\nNB.\nNB. 09/04/2003 Oleg Kobchenko\nNB. 03/31/2007 Oleg Kobchenko j601, JAL\nNB. 12/17/2015 G.Pruss 64-bit\nNB. ~60+ times slower than using the jqt library\n\nrequire 'convert'\ncoclass 'pcrypt'\n\nNB. lt= (*. -.)~ gt= *. -. ge= +. -. xor= ~:\n'`lt gt ge xor'=: (20 b.)`(18 b.)`(27 b.)`(22 b.)\n'`and or sh'=: (17 b.)`(23 b.)`(33 b.)\n\n3 : 0 ''\nif. IF64 do.\nrot=: (16bffffffff and sh or ] sh~ 32 -~ [) NB. (y << x) | (y >>> (32 - x))\nadd=: ((16bffffffff&and)@+)\"0\nelse.\nrot=: (32 b.)\nadd=: (+&(_16&sh) (16&sh@(+ _16&sh) or and&65535@]) +&(and&65535))\"0\nend.\nEMPTY\n)\n\nhexlist=: tolower@:,@:hfd@:,@:(|.\"1)@(256 256 256 256&#:)\n\ncmn=: 4 : 0\n'x s t'=. x [ 'q a b'=. y\nb add s rot (a add q) add (x add t)\n)\n\nff=: cmn (((1&{ and 2&{) or 1&{ lt 3&{) , 2&{.)\ngg=: cmn (((1&{ and 3&{) or 2&{ gt 3&{) , 2&{.)\nhh=: cmn (((1&{ xor 2&{)xor 3&{ ) , 2&{.)\nii=: cmn (( 2&{ xor 1&{ ge 3&{ ) , 2&{.)\nop=: ff`gg`hh`ii\n\nI=: \".;._2(0 : 0)\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15\n1 6 11 0 5 10 15 4 9 14 3 8 13 2 7 12\n5 8 11 14 1 4 7 10 13 0 3 6 9 12 15 2\n0 7 14 5 12 3 10 1 8 15 6 13 4 11 2 9\n)\nS=: 4 4$7 12 17 22 5 9 14 20 4 11 16 23 6 10 15 21\n\nT=: |:\".;._2(0 : 0)\n _680876936 _165796510 _378558 _198630844\n _389564586 _1069501632 _2022574463 1126891415\n 606105819 643717713 1839030562 _1416354905\n_1044525330 _373897302 _35309556 _57434055\n _176418897 _701558691 _1530992060 1700485571\n 1200080426 38016083 1272893353 _1894986606\n_1473231341 _660478335 _155497632 _1051523\n _45705983 _405537848 _1094730640 _2054922799\n 1770035416 568446438 681279174 1873313359\n_1958414417 _1019803690 _358537222 _30611744\n _42063 _187363961 _722521979 _1560198380\n_1990404162 1163531501 76029189 1309151649\n 1804603682 _1444681467 _640364487 _145523070\n _40341101 _51403784 _421815835 _1120210379\n_1502002290 1735328473 530742520 718787259\n 1236535329 _1926607734 _995338651 _343485551\n)\n\nnorm=: 3 : 0\nn=. 16 * 1 + _6 sh 8 + #y\nb=. n#0 [ y=. a.i.y\nfor_i. i. #y do.\n b=. ((j { b) or (8*4|i) sh i{y) (j=. _2 sh i) } b\nend.\nb=. ((j { b) or (8*4|i) sh 128) (j=._2 sh i=.#y) } b\n_16]\\ (8 * #y) (n-2) } b\n)\n\nNB.*md5 v MD5 Message-Digest Algorithm\nNB. diagest=. md5 message\nmd5=: 3 : 0\nX=. norm y\nq=. r=. 1732584193 _271733879 _1732584194 271733878\nfor_x. X do.\n for_j. i.4 do.\n l=. ((j{I){x) ,. (16$j{S) ,. j{T\n for_i. i.16 do.\n r=. _1|.((i{l) (op@.j) r),}.r\n end.\n end.\n q=. r=. r add q\nend.\nhexlist r\n)\n\nmd5_z_=: md5_pcrypt_\n","language":"J"},{"code":" md5''\nd41d8cd98f00b204e9800998ecf8427e\n md5'a'\n0cc175b9c0f1b6a831c399e269772661\n md5'abc'\n900150983cd24fb0d6963f7d28e17f72\n md5'message digest'\nf96b697d7cb7938d525a2f31aaf161d0\n md5'abcdefghijklmnopqrstuvwxyz'\nc3fcd3d76192e4007dfb496cca67e13b\n md5'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'\nd174ab98d277d9f5a5611c2c9f419d9f\n md5'12345678901234567890123456789012345678901234567890123456789012345678901234567890'\n57edf4a22be3c955ac49da2e2107b67a\n","language":"J"},{"code":"class MD5\n{\n\n private static final int INIT_A = 0x67452301;\n private static final int INIT_B = (int)0xEFCDAB89L;\n private static final int INIT_C = (int)0x98BADCFEL;\n private static final int INIT_D = 0x10325476;\n\n private static final int[] SHIFT_AMTS = {\n 7, 12, 17, 22,\n 5, 9, 14, 20,\n 4, 11, 16, 23,\n 6, 10, 15, 21\n };\n\n private static final int[] TABLE_T = new int[64];\n static\n {\n for (int i = 0; i < 64; i++)\n TABLE_T[i] = (int)(long)((1L << 32) * Math.abs(Math.sin(i + 1)));\n }\n\n public static byte[] computeMD5(byte[] message)\n {\n int messageLenBytes = message.length;\n int numBlocks = ((messageLenBytes + 8) >>> 6) + 1;\n int totalLen = numBlocks << 6;\n byte[] paddingBytes = new byte[totalLen - messageLenBytes];\n paddingBytes[0] = (byte)0x80;\n\n long messageLenBits = (long)messageLenBytes << 3;\n for (int i = 0; i < 8; i++)\n {\n paddingBytes[paddingBytes.length - 8 + i] = (byte)messageLenBits;\n messageLenBits >>>= 8;\n }\n\n int a = INIT_A;\n int b = INIT_B;\n int c = INIT_C;\n int d = INIT_D;\n int[] buffer = new int[16];\n for (int i = 0; i < numBlocks; i ++)\n {\n int index = i << 6;\n for (int j = 0; j < 64; j++, index++)\n buffer[j >>> 2] = ((int)((index < messageLenBytes) ? message[index] : paddingBytes[index - messageLenBytes]) << 24) | (buffer[j >>> 2] >>> 8);\n int originalA = a;\n int originalB = b;\n int originalC = c;\n int originalD = d;\n for (int j = 0; j < 64; j++)\n {\n int div16 = j >>> 4;\n int f = 0;\n int bufferIndex = j;\n switch (div16)\n {\n case 0:\n f = (b & c) | (~b & d);\n break;\n\n case 1:\n f = (b & d) | (c & ~d);\n bufferIndex = (bufferIndex * 5 + 1) & 0x0F;\n break;\n\n case 2:\n f = b ^ c ^ d;\n bufferIndex = (bufferIndex * 3 + 5) & 0x0F;\n break;\n\n case 3:\n f = c ^ (b | ~d);\n bufferIndex = (bufferIndex * 7) & 0x0F;\n break;\n }\n int temp = b + Integer.rotateLeft(a + f + buffer[bufferIndex] + TABLE_T[j], SHIFT_AMTS[(div16 << 2) | (j & 3)]);\n a = d;\n d = c;\n c = b;\n b = temp;\n }\n\n a += originalA;\n b += originalB;\n c += originalC;\n d += originalD;\n }\n\n byte[] md5 = new byte[16];\n int count = 0;\n for (int i = 0; i < 4; i++)\n {\n int n = (i == 0) ? a : ((i == 1) ? b : ((i == 2) ? c : d));\n for (int j = 0; j < 4; j++)\n {\n md5[count++] = (byte)n;\n n >>>= 8;\n }\n }\n return md5;\n }\n\n public static String toHexString(byte[] b)\n {\n StringBuilder sb = new StringBuilder();\n for (int i = 0; i < b.length; i++)\n {\n sb.append(String.format(\"%02X\", b[i] & 0xFF));\n }\n return sb.toString();\n }\n\n public static void main(String[] args)\n {\n String[] testStrings = { \"\", \"a\", \"abc\", \"message digest\", \"abcdefghijklmnopqrstuvwxyz\", \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\", \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\" };\n for (String s : testStrings)\n System.out.println(\"0x\" + toHexString(computeMD5(s.getBytes())) + \" <== \\\"\" + s + \"\\\"\");\n return;\n }\n\n}\n","language":"Java"},{"code":"import java.nio.ByteBuffer;\nimport java.nio.ByteOrder;\n\nclass MD5\n{\n\n private static final int INIT_A = 0x67452301;\n private static final int INIT_B = (int)0xEFCDAB89L;\n private static final int INIT_C = (int)0x98BADCFEL;\n private static final int INIT_D = 0x10325476;\n\n private static final int[] SHIFT_AMTS = {\n 7, 12, 17, 22,\n 5, 9, 14, 20,\n 4, 11, 16, 23,\n 6, 10, 15, 21\n };\n\n private static final int[] TABLE_T = new int[64];\n static\n {\n for (int i = 0; i < 64; i++)\n TABLE_T[i] = (int)(long)((1L << 32) * Math.abs(Math.sin(i + 1)));\n }\n\n public static byte[] computeMD5(byte[] message)\n {\n ByteBuffer padded = ByteBuffer.allocate((((message.length + 8) / 64) + 1) * 64).order(ByteOrder.LITTLE_ENDIAN);\n padded.put(message);\n padded.put((byte)0x80);\n long messageLenBits = (long)message.length * 8;\n padded.putLong(padded.capacity() - 8, messageLenBits);\n\n padded.rewind();\n\n int a = INIT_A;\n int b = INIT_B;\n int c = INIT_C;\n int d = INIT_D;\n while (padded.hasRemaining()) {\n // obtain a slice of the buffer from the current position,\n // and view it as an array of 32-bit ints\n IntBuffer chunk = padded.slice().order(ByteOrder.LITTLE_ENDIAN).asIntBuffer();\n int originalA = a;\n int originalB = b;\n int originalC = c;\n int originalD = d;\n for (int j = 0; j < 64; j++)\n {\n int div16 = j >>> 4;\n int f = 0;\n int bufferIndex = j;\n switch (div16)\n {\n case 0:\n f = (b & c) | (~b & d);\n break;\n\n case 1:\n f = (b & d) | (c & ~d);\n bufferIndex = (bufferIndex * 5 + 1) & 0x0F;\n break;\n\n case 2:\n f = b ^ c ^ d;\n bufferIndex = (bufferIndex * 3 + 5) & 0x0F;\n break;\n\n case 3:\n f = c ^ (b | ~d);\n bufferIndex = (bufferIndex * 7) & 0x0F;\n break;\n }\n int temp = b + Integer.rotateLeft(a + f + chunk.get(bufferIndex) + TABLE_T[j], SHIFT_AMTS[(div16 << 2) | (j & 3)]);\n a = d;\n d = c;\n c = b;\n b = temp;\n }\n\n a += originalA;\n b += originalB;\n c += originalC;\n d += originalD;\n padded.position(padded.position() + 64);\n }\n\n ByteBuffer md5 = ByteBuffer.allocate(16).order(ByteOrder.LITTLE_ENDIAN);\n for (int n : new int[]{a, b, c, d})\n {\n md5.putInt(n);\n }\n return md5.array();\n }\n\n public static String toHexString(byte[] b)\n {\n StringBuilder sb = new StringBuilder();\n for (int i = 0; i < b.length; i++)\n {\n sb.append(String.format(\"%02X\", b[i] & 0xFF));\n }\n return sb.toString();\n }\n\n public static void main(String[] args)\n {\n String[] testStrings = { \"\", \"a\", \"abc\", \"message digest\", \"abcdefghijklmnopqrstuvwxyz\", \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\", \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\" };\n for (String s : testStrings)\n System.out.println(\"0x\" + toHexString(computeMD5(s.getBytes())) + \" <== \\\"\" + s + \"\\\"\");\n return;\n }\n\n}\n","language":"Java"},{"code":"# a rather literal translation of the pseudocode at https://en.wikipedia.org/wiki/MD5\n\nconst s = UInt32[7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21]\n\nconst K = UInt32[0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, 0xf57c0faf,\n 0x4787c62a, 0xa8304613, 0xfd469501, 0x698098d8, 0x8b44f7af, 0xffff5bb1,\n 0x895cd7be, 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821, 0xf61e2562,\n 0xc040b340, 0x265e5a51, 0xe9b6c7aa, 0xd62f105d, 0x02441453, 0xd8a1e681,\n 0xe7d3fbc8, 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed, 0xa9e3e905,\n 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a, 0xfffa3942, 0x8771f681, 0x6d9d6122,\n 0xfde5380c, 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70, 0x289b7ec6,\n 0xeaa127fa, 0xd4ef3085, 0x04881d05, 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8,\n 0xc4ac5665, 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, 0x655b59c3,\n 0x8f0ccc92, 0xffeff47d, 0x85845dd1, 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314,\n 0x4e0811a1, 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391]\n\nfunction md5(msgbytes)\n a0::UInt32 = 0x67452301 # A\n b0::UInt32 = 0xefcdab89 # B\n c0::UInt32 = 0x98badcfe # C\n d0::UInt32 = 0x10325476 # D\n\n oldlen = length(msgbytes)\n umsg = push!([UInt8(b) for b in msgbytes], UInt8(0x80))\n while length(umsg) % 64 != 56\n push!(umsg, UInt8(0))\n end\n append!(umsg, reinterpret(UInt8, [htol(UInt64(oldlen) * 8)]))\n\n for j in 1:64:length(umsg)-1\n arr = view(umsg, j:j+63)\n M = [reinterpret(UInt32, arr[k:k+3])[1] for k in 1:4:62]\n A = a0\n B = b0\n C = c0\n D = d0\n\n for i in 0:63\n if 0 ≤ i ≤ 15\n F = D ⊻ (B & (C ⊻ D))\n g = i\n elseif 16 ≤ i ≤ 31\n F = C ⊻ (D & (B ⊻ C))\n g = (5 * i + 1) % 16\n elseif 32 ≤ i ≤ 47\n F = B ⊻ C ⊻ D\n g = (3 * i + 5) % 16\n elseif 48 ≤ i ≤ 63\n F = C ⊻ (B | (~D))\n g = (7 * i) % 16\n end\n F += A + K[i+1] + M[g+1]\n A = D\n D = C\n C = B\n B += ((F) << s[i+1]) | (F >> (32 - s[i+1]))\n end\n\n a0 += A\n b0 += B\n c0 += C\n d0 += D\n end\n digest = join(map(x -> lpad(string(x, base=16), 2, '0'), reinterpret(UInt8, [a0, b0, c0, d0])), \"\") # Output is in little-endian\nend\n\nfor pair in [0xd41d8cd98f00b204e9800998ecf8427e => \"\", 0x0cc175b9c0f1b6a831c399e269772661 => \"a\",\n 0x900150983cd24fb0d6963f7d28e17f72 => \"abc\", 0xf96b697d7cb7938d525a2f31aaf161d0 => \"message digest\",\n 0xc3fcd3d76192e4007dfb496cca67e13b => \"abcdefghijklmnopqrstuvwxyz\",\n 0xd174ab98d277d9f5a5611c2c9f419d9f => \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\",\n 0x57edf4a22be3c955ac49da2e2107b67a => \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"]\n println(\"MD5 of $(pair[2]) is $(md5(pair[2])), which checks with $(string(pair[1], base=16)).\")\nend\n","language":"Julia"},{"code":"// version 1.1.3\n\nobject MD5 {\n\n private val INIT_A = 0x67452301\n private val INIT_B = 0xEFCDAB89L.toInt()\n private val INIT_C = 0x98BADCFEL.toInt()\n private val INIT_D = 0x10325476\n\n private val SHIFT_AMTS = intArrayOf(\n 7, 12, 17, 22,\n 5, 9, 14, 20,\n 4, 11, 16, 23,\n 6, 10, 15, 21\n )\n\n private val TABLE_T = IntArray(64) {\n ((1L shl 32) * Math.abs(Math.sin(it + 1.0))).toLong().toInt()\n }\n\n fun compute(message: ByteArray): ByteArray {\n val messageLenBytes = message.size\n val numBlocks = ((messageLenBytes + 8) ushr 6) + 1\n val totalLen = numBlocks shl 6\n val paddingBytes = ByteArray(totalLen - messageLenBytes)\n paddingBytes[0] = 0x80.toByte()\n var messageLenBits = (messageLenBytes shl 3).toLong()\n\n for (i in 0..7) {\n paddingBytes[paddingBytes.size - 8 + i] = messageLenBits.toByte()\n messageLenBits = messageLenBits ushr 8\n }\n\n var a = INIT_A\n var b = INIT_B\n var c = INIT_C\n var d = INIT_D\n val buffer = IntArray(16)\n\n for (i in 0 until numBlocks) {\n var index = i shl 6\n\n for (j in 0..63) {\n val temp = if (index < messageLenBytes) message[index] else\n paddingBytes[index - messageLenBytes]\n buffer[j ushr 2] = (temp.toInt() shl 24) or (buffer[j ushr 2] ushr 8)\n index++\n }\n\n val originalA = a\n val originalB = b\n val originalC = c\n val originalD = d\n\n for (j in 0..63) {\n val div16 = j ushr 4\n var f = 0\n var bufferIndex = j\n when (div16) {\n 0 -> {\n f = (b and c) or (b.inv() and d)\n }\n\n 1 -> {\n f = (b and d) or (c and d.inv())\n bufferIndex = (bufferIndex * 5 + 1) and 0x0F\n }\n\n 2 -> {\n f = b xor c xor d;\n bufferIndex = (bufferIndex * 3 + 5) and 0x0F\n }\n\n 3 -> {\n f = c xor (b or d.inv());\n bufferIndex = (bufferIndex * 7) and 0x0F\n }\n }\n\n val temp = b + Integer.rotateLeft(a + f + buffer[bufferIndex] +\n TABLE_T[j], SHIFT_AMTS[(div16 shl 2) or (j and 3)])\n a = d\n d = c\n c = b\n b = temp\n }\n\n a += originalA\n b += originalB\n c += originalC\n d += originalD\n }\n\n val md5 = ByteArray(16)\n var count = 0\n\n for (i in 0..3) {\n var n = if (i == 0) a else (if (i == 1) b else (if (i == 2) c else d))\n\n for (j in 0..3) {\n md5[count++] = n.toByte()\n n = n ushr 8\n }\n }\n return md5\n }\n}\n\nfun ByteArray.toHexString(): String {\n val sb = StringBuilder()\n for (b in this) sb.append(String.format(\"%02x\", b.toInt() and 0xFF))\n return sb.toString()\n}\n\nfun main(args: Array<String>) {\n val testStrings = arrayOf(\n \"\",\n \"a\",\n \"abc\",\n \"message digest\",\n \"abcdefghijklmnopqrstuvwxyz\",\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\",\n \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"\n )\n\n println(\"${\"hash code\".padStart(34)} <== string\")\n for (s in testStrings) {\n println(\"0x${MD5.compute(s.toByteArray()).toHexString()} <== \\\"$s\\\"\")\n }\n}\n","language":"Kotlin"},{"code":"----------------------------------------\n-- Calculates MD5 hash of string or bytearray\n-- @param {bytearray|string} input\n-- @return {bytearray} (16 bytes)\n----------------------------------------\non md5 (input)\n if stringP(input) then input = bytearray(input)\n\n -- Convert string to list of little-endian words...\n t_iLen = input.length * 8\n t_iCnt = (t_iLen + 64) / 512 * 16 + 16\n\n -- Create list, fill with zeros...\n x = []\n x[t_iCnt] = 0\n\n t_fArr = [1, 256, 65536, 16777216]\n i = 0\n j = 0\n repeat while i < t_iLen\n j = j + 1\n t_iNext = i / 32 + 1\n t_iTemp = bitAnd(input[i/8+1], 255) * t_fArr[j]\n x[t_iNext] = bitOr(x[t_iNext], t_iTemp)\n i = i + 8\n j = j mod 4\n end repeat\n\n -- Append padding...\n t_iNext = t_iLen / 32 + 1\n x[t_iNext] = bitOr(x[t_iNext], 128 * t_fArr[j + 1])\n x[(t_iLen + 64) / 512 * 16 + 15] = t_iLen\n\n -- Actual algorithm starts here...\n a = 1732584193\n b = -271733879\n c = -1732584194\n d = 271733878\n i = 1\n t_iWrap = the maxInteger + 1\n t_iCount = x.count + 1\n repeat while i < t_iCount\n olda = a\n oldb = b\n oldc = c\n oldd = d\n\n -- Round(1) --\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i] - 680876936\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\n else a = bitOr(n * 128, n / 33554432) + b\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 1] - 389564586\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\n else d = bitOr(n * 4096, n / 1048576) + a\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 2] + 606105819\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\n else c = bitOr(n * 131072, n / 32768) + d\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 3] - 1044525330\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\n else b = bitOr(n * 4194304, n / 1024) + c\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i + 4] - 176418897\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\n else a = bitOr(n * 128, n / 33554432) + b\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 5] + 1200080426\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\n else d = bitOr(n * 4096, n / 1048576) + a\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 6] - 1473231341\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\n else c = bitOr(n * 131072, n / 32768) + d\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 7] - 45705983\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\n else b = bitOr(n * 4194304, n / 1024) + c\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i + 8] + 1770035416\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\n else a = bitOr(n * 128, n / 33554432) + b\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 9] - 1958414417\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\n else d = bitOr(n * 4096, n / 1048576) + a\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 10] - 42063\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\n else c = bitOr(n * 131072, n / 32768) + d\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 11] - 1990404162\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\n else b = bitOr(n * 4194304, n / 1024) + c\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i + 12] + 1804603682\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\n else a = bitOr(n * 128, n / 33554432) + b\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 13] - 40341101\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\n else d = bitOr(n * 4096, n / 1048576) + a\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 14] - 1502002290\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\n else c = bitOr(n * 131072, n / 32768) + d\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 15] + 1236535329\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\n else b = bitOr(n * 4194304, n / 1024) + c\n\n -- Round(2) --\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 1] - 165796510\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\n else a = bitOr(n * 32, n / 134217728) + b\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 6] - 1069501632\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\n else d = bitOr(n * 512, n / 8388608) + a\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 11] + 643717713\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\n else c = bitOr(n * 16384, n / 262144) + d\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i] - 373897302\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\n else b = bitOr(n * 1048576, n / 4096) + c\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 5] - 701558691\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\n else a = bitOr(n * 32, n / 134217728) + b\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 10] + 38016083\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\n else d = bitOr(n * 512, n / 8388608) + a\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 15] - 660478335\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\n else c = bitOr(n * 16384, n / 262144) + d\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i + 4] - 405537848\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\n else b = bitOr(n * 1048576, n / 4096) + c\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 9] + 568446438\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\n else a = bitOr(n * 32, n / 134217728) + b\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 14] - 1019803690\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\n else d = bitOr(n * 512, n / 8388608) + a\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 3] - 187363961\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\n else c = bitOr(n * 16384, n / 262144) + d\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i + 8] + 1163531501\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\n else b = bitOr(n * 1048576, n / 4096) + c\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 13] - 1444681467\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\n else a = bitOr(n * 32, n / 134217728) + b\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 2] - 51403784\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\n else d = bitOr(n * 512, n / 8388608) + a\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 7] + 1735328473\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\n else c = bitOr(n * 16384, n / 262144) + d\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i + 12] - 1926607734\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\n else b = bitOr(n * 1048576, n / 4096) + c\n\n -- Round(3) --\n n = bitXor(bitXor(b, c), d) + a + x[i + 5] - 378558\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\n else a = bitOr(n * 16, n / 268435456) + b\n n = bitXor(bitXor(a, b), c) + d + x[i + 8] - 2022574463\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\n else d = bitOr(n * 2048, n / 2097152) + a\n n = bitXor(bitXor(d, a), b) + c + x[i + 11] + 1839030562\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\n else c = bitOr(n * 65536, n / 65536) + d\n n = bitXor(bitXor(c, d), a) + b + x[i + 14] - 35309556\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\n else b = bitOr(n * 8388608, n / 512) + c\n n = bitXor(bitXor(b, c), d) + a + x[i + 1] - 1530992060\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\n else a = bitOr(n * 16, n / 268435456) + b\n n = bitXor(bitXor(a, b), c) + d + x[i + 4] + 1272893353\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\n else d = bitOr(n * 2048, n / 2097152) + a\n n = bitXor(bitXor(d, a), b) + c + x[i + 7] - 155497632\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\n else c = bitOr(n * 65536, n / 65536) + d\n n = bitXor(bitXor(c, d), a) + b + x[i + 10] - 1094730640\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\n else b = bitOr(n * 8388608, n / 512) + c\n n = bitXor(bitXor(b, c), d) + a + x[i + 13] + 681279174\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\n else a = bitOr(n * 16, n / 268435456) + b\n n = bitXor(bitXor(a, b), c) + d + x[i] - 358537222\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\n else d = bitOr(n * 2048, n / 2097152) + a\n n = bitXor(bitXor(d, a), b) + c + x[i + 3] - 722521979\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\n else c = bitOr(n * 65536, n / 65536) + d\n n = bitXor(bitXor(c, d), a) + b + x[i + 6] + 76029189\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\n else b = bitOr(n * 8388608, n / 512) + c\n n = bitXor(bitXor(b, c), d) + a + x[i + 9] - 640364487\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\n else a = bitOr(n * 16, n / 268435456) + b\n n = bitXor(bitXor(a, b), c) + d + x[i + 12] - 421815835\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\n else d = bitOr(n * 2048, n / 2097152) + a\n n = bitXor(bitXor(d, a), b) + c + x[i + 15] + 530742520\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\n else c = bitOr(n * 65536, n / 65536) + d\n n = bitXor(bitXor(c, d), a) + b + x[i + 2] - 995338651\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\n else b = bitOr(n * 8388608, n / 512) + c\n\n -- Round(4) --\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i] - 198630844\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\n else a = bitOr(n * 64, n / 67108864) + b\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 7] + 1126891415\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\n else d = bitOr(n * 1024, n / 4194304) + a\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 14] - 1416354905\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\n else c = bitOr(n * 32768, n / 131072) + d\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 5] - 57434055\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\n else b = bitOr(n * 2097152, n / 2048) + c\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i + 12] + 1700485571\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\n else a = bitOr(n * 64, n / 67108864) + b\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 3] - 1894986606\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\n else d = bitOr(n * 1024, n / 4194304) + a\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 10] - 1051523\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\n else c = bitOr(n * 32768, n / 131072) + d\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 1] - 2054922799\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\n else b = bitOr(n * 2097152, n / 2048) + c\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i + 8] + 1873313359\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\n else a = bitOr(n * 64, n / 67108864) + b\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 15] - 30611744\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\n else d = bitOr(n * 1024, n / 4194304) + a\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 6] - 1560198380\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\n else c = bitOr(n * 32768, n / 131072) + d\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 13] + 1309151649\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\n else b = bitOr(n * 2097152, n / 2048) + c\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i + 4] - 145523070\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\n else a = bitOr(n * 64, n / 67108864) + b\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 11] - 1120210379\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\n else d = bitOr(n * 1024, n / 4194304) + a\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 2] + 718787259\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\n else c = bitOr(n * 32768, n / 131072) + d\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 9] - 343485551\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\n else b = bitOr(n * 2097152, n / 2048) + c\n a = a + olda\n b = b + oldb\n c = c + oldc\n d = d + oldd\n i = i + 16\n end repeat\n\n t_iArr = [a, b, c, d]\n ba = bytearray()\n p = 1\n repeat with i in t_iArr\n if(i > 0) then\n repeat with n = 1 to 4\n ba[p] = (i mod 256)\n i = i / 256\n p = p+1\n end repeat\n else\n i = bitNot(i)\n repeat with n = 1 to 4\n ba[p] = 255-(i mod 256)\n i = i / 256\n p = p+1\n end repeat\n end if\n end repeat\n ba.position = 1\n return ba\nend\n","language":"Lingo"},{"code":"tests = []\ntests.add(\"\")\ntests.add(\"a\")\ntests.add(\"abc\")\ntests.add(\"message digest\")\ntests.add(\"abcdefghijklmnopqrstuvwxyz\")\ntests.add(\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\")\ntests.add(\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\")\nrepeat with t in tests\n ba = md5(t)\n put ba.toHexString(1, ba.length)\nend repeat\n","language":"Lingo"},{"code":"-- shift amounts\nlocal s = {\n 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21\n}\n\n-- constants\nlocal K = {\n 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,\n 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,\n 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,\n 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,\n 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,\n 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,\n 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,\n 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,\n 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,\n 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,\n 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,\n 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,\n 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,\n 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,\n 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,\n 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,\n}\n\nlocal function leftRotate(x, c)\n return (x << c) | (x >> (32-c))\nend\n\nlocal function getInt(byteArray, n)\n return (byteArray[n+3]<<24) + (byteArray[n+2]<<16) + (byteArray[n+1]<<8) + byteArray[n]\nend\n\n--- converts 32bit integer n to a little endian hex representation\n-- @tparam integer n\nlocal function lE(n)\n local s = ''\n for i = 0, 3 do\n s = ('%s%02x'):format(s, (n>>(i*8))&0xff)\n end\n return s\nend\n\n--- md5\n-- @tparam string message\nlocal function md5(message)\n local a0, b0, c0, d0 = 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476\n local bytes = {message:byte(1, -1)}\n\n -- insert 1 bit (and the rest of the byte)\n table.insert(bytes, 0x80)\n\n -- pad with zeros until we have *just enough*\n local p = #bytes%64\n if p > 56 then\n p = p - 64\n end\n for _ = p+1, 56 do\n table.insert(bytes, 0)\n end\n\n -- insert the initial message length, in little-endian\n local len = ((#message)<<3)&0xffffffffffffffff -- length in bits\n for i = 0, 7 do\n table.insert(bytes, (len>>(i*8))&0xff)\n end\n\n\n for i = 0, #bytes//64-1 do\n local a, b, c, d = a0, b0, c0, d0\n for j = 0, 63 do\n local F, g\n -- permutate\n if j <= 15 then\n F = (b & c) | (~b & d)\n g = j\n elseif j <= 31 then\n F = (d & b) | (~d & c)\n g = (5*j + 1) & 15\n elseif j <= 47 then\n F = b ~ c ~ d\n g = (3*j + 5) & 15\n else\n F = c ~ (b | ~d)\n g = (7*j) & 15\n end\n\n F = (F + a + K[j+1] + getInt(bytes, i*64+g*4+1))&0xffffffff\n -- shuffle\n a = d\n d = c\n c = b\n b = (b + leftRotate(F, s[j+1]))&0xffffffff\n end\n -- update internal state\n a0 = (a0 + a)&0xffffffff\n b0 = (b0 + b)&0xffffffff\n c0 = (c0 + c)&0xffffffff\n d0 = (d0 + d)&0xffffffff\n end\n\n -- lua doesn't support any other byte strings. Could convert to a wacky string but this is more printable.\n return lE(a0)..lE(b0)..lE(c0)..lE(d0)\nend\n\nlocal demo = {\n [\"\"] = \"d41d8cd98f00b204e9800998ecf8427e\",\n [\"a\"] = \"0cc175b9c0f1b6a831c399e269772661\",\n [\"abc\"] = \"900150983cd24fb0d6963f7d28e17f72\",\n [\"message digest\"] = \"f96b697d7cb7938d525a2f31aaf161d0\",\n [\"abcdefghijklmnopqrstuvwxyz\"] = \"c3fcd3d76192e4007dfb496cca67e13b\",\n [\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"] = \"d174ab98d277d9f5a5611c2c9f419d9f\",\n [\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"] = \"57edf4a22be3c955ac49da2e2107b67a\",\n}\n\nfor k, v in pairs(demo) do\n local m = md5(k)\n print((\"%s [%2s] <== \\\"%s\\\"\"):format(m, m==v and 'OK' or '', k))\nend\n","language":"Lua"},{"code":"f96b697d7cb7938d525a2f31aaf161d0 [OK] <== \"message digest\"\nd174ab98d277d9f5a5611c2c9f419d9f [OK] <== \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"\nc3fcd3d76192e4007dfb496cca67e13b [OK] <== \"abcdefghijklmnopqrstuvwxyz\"\nd41d8cd98f00b204e9800998ecf8427e [OK] <== \"\"\n900150983cd24fb0d6963f7d28e17f72 [OK] <== \"abc\"\n57edf4a22be3c955ac49da2e2107b67a [OK] <== \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"\n0cc175b9c0f1b6a831c399e269772661 [OK] <== \"a\"\n","language":"Lua"},{"code":"md5[string_String] :=\n Module[{r = {7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17,\n 22, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 4,\n 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 6, 10,\n 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21},\n k = Table[Floor[2^32*Abs@Sin@i], {i, 1, 64}], h0 = 16^^67452301,\n h1 = 16^^efcdab89, h2 = 16^^98badcfe, h3 = 16^^10325476,\n data = Partition[\n Join[FromDigits[Reverse@#, 256] & /@\n Partition[\n PadRight[Append[#, 128], Mod[56, 64, Length@# + 1]], 4],\n Reverse@IntegerDigits[8 Length@#, 2^32, 2]] &@\n ImportString[string, \"Binary\"], 16], a, b, c, d, f, g},\n Do[{a, b, c, d} = {h0, h1, h2, h3};\n Do[Which[1 <= i <= 16,\n f = BitOr[BitAnd[b, c], BitAnd[BitNot[b], d]]; g = i - 1,\n 17 <= i <= 32, f = BitOr[BitAnd[d, b], BitAnd[BitNot[d], c]];\n g = Mod[5 i - 4, 16], 33 <= i <= 48, f = BitXor[b, c, d];\n g = Mod[3 i + 2, 16], 49 <= i <= 64,\n f = BitXor[c, BitOr[b, BitNot[d] + 2^32]];\n g = Mod[7 i - 7, 16]]; {a, b, c, d} = {d,\n BitOr[BitShiftLeft[#1, #2], BitShiftRight[#1, 32 - #2]] &[\n Mod[a + f + k[[i]] + w[[g + 1]], 2^32], r[[i]]] + b, b,\n c}, {i, 1, 64}]; {h0, h1, h2, h3} =\n Mod[{h0, h1, h2, h3} + {a, b, c, d}, 2^32], {w, data}];\n \"0x\" ~~ IntegerString[\n FromDigits[\n Flatten[Reverse@IntegerDigits[#, 256, 4] & /@ {h0, h1, h2, h3}],\n 256], 16, 32]]\n","language":"Mathematica"},{"code":"md5[\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"]\n","language":"Mathematica"},{"code":"0x57edf4a22be3c955ac49da2e2107b67a\n","language":"Mathematica"},{"code":"INTERFACE MD5;\n\nIMPORT Word;\n\nTYPE Digest = ARRAY [0..15] OF CHAR;\nTYPE Buffer = ARRAY [0..63] OF CHAR;\n\nTYPE T = RECORD\n state: ARRAY [0..3] OF Word.T;\n count: ARRAY [0..1] OF Word.T;\n buffer: Buffer;\nEND;\n\nPROCEDURE Init(VAR md5ctx: T);\nPROCEDURE Update(VAR md5ctx: T; input: TEXT);\nPROCEDURE Final(VAR md5ctx: T): Digest;\nPROCEDURE ToText(hash: Digest): TEXT;\n\nEND MD5.\n","language":"Modula-3"},{"code":"MODULE MD5;\n\nIMPORT Word, Text, Fmt;\n\nCONST S11 = 7; S12 = 12; S13 = 17; S14 = 22;\n S21 = 5; S22 = 9; S23 = 14; S24 = 20;\n S31 = 4; S32 = 11; S33 = 16; S34 = 23;\n S41 = 6; S42 = 10; S43 = 15; S44 = 21;\n pad1 = \"\\200\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\";\n pad2 = \"\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\";\n pad3 = \"\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\";\n pad4 = \"\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\\000\";\n padding = pad1 & pad2 & pad3 & pad4;\n\nPROCEDURE Init(VAR md5ctx: T) =\n BEGIN\n <*ASSERT Word.Size = 32*>\n md5ctx.count[0] := 0;\n md5ctx.count[1] := 0;\n\n md5ctx.state[0] := 16_67452301;\n md5ctx.state[1] := 16_efcdab89;\n md5ctx.state[2] := 16_98badcfe;\n md5ctx.state[3] := 16_10325476;\n END Init;\n\nPROCEDURE Transform(VAR state: ARRAY [0..3] OF Word.T;\n VAR input: Buffer) =\n VAR a, b, c, d: INTEGER;\n x: ARRAY [0..15] OF INTEGER;\n\n PROCEDURE Decode(VAR x: ARRAY [0..15] OF INTEGER;\n VAR input: Buffer) =\n BEGIN\n FOR i := 0 TO 15 DO\n x[i] := Word.Insert(x[i], ORD(input[4*i+0]), 0, 8);\n x[i] := Word.Insert(x[i], ORD(input[4*i+1]), 8, 8);\n x[i] := Word.Insert(x[i], ORD(input[4*i+2]), 16, 8);\n x[i] := Word.Insert(x[i], ORD(input[4*i+3]), 24, 8);\n END;\n END Decode;\n\n PROCEDURE FF(VAR a: INTEGER; b, c, d, x, s, ac: INTEGER) =\n PROCEDURE F(x, y, z: INTEGER): INTEGER =\n BEGIN\n RETURN Word.Or(Word.And(x, y), Word.And(Word.Not(x), z));\n END F;\n BEGIN\n a := b + Word.Rotate(a + F(b, c, d) + x + ac, s);\n END FF;\n\n PROCEDURE GG(VAR a: INTEGER; b, c, d, x, s, ac: INTEGER) =\n PROCEDURE G(x, y, z: INTEGER): INTEGER =\n BEGIN\n RETURN Word.Or(Word.And(x, z), Word.And(y, Word.Not(z)));\n END G;\n BEGIN\n a := b + Word.Rotate(a + G(b, c, d) + x + ac, s);\n END GG;\n\n PROCEDURE HH(VAR a: INTEGER; b, c, d, x, s, ac: INTEGER) =\n PROCEDURE H(x, y, z: INTEGER): INTEGER =\n BEGIN\n RETURN Word.Xor(x, Word.Xor(y,z));\n END H;\n BEGIN\n a := b + Word.Rotate(a + H(b, c, d) + x + ac, s);\n END HH;\n\n PROCEDURE II(VAR a: INTEGER; b, c, d, x, s, ac: INTEGER) =\n PROCEDURE I(x, y, z: INTEGER): INTEGER =\n BEGIN\n RETURN Word.Xor(y, Word.Or(x, Word.Not(z)))\n END I;\n BEGIN\n a := b + Word.Rotate(a + I(b, c, d) + x + ac, s)\n END II;\n\n BEGIN\n Decode(x, input);\n\n a := state[0];\n b := state[1];\n c := state[2];\n d := state[3];\n\n (* Round 1 *)\n FF(a, b, c, d, x[ 0], S11, 16_d76aa478); (* 1 *)\n FF(d, a, b, c, x[ 1], S12, 16_e8c7b756); (* 2 *)\n FF(c, d, a, b, x[ 2], S13, 16_242070db); (* 3 *)\n FF(b, c, d, a, x[ 3], S14, 16_c1bdceee); (* 4 *)\n FF(a, b, c, d, x[ 4], S11, 16_f57c0faf); (* 5 *)\n FF(d, a, b, c, x[ 5], S12, 16_4787c62a); (* 6 *)\n FF(c, d, a, b, x[ 6], S13, 16_a8304613); (* 7 *)\n FF(b, c, d, a, x[ 7], S14, 16_fd469501); (* 8 *)\n FF(a, b, c, d, x[ 8], S11, 16_698098d8); (* 9 *)\n FF(d, a, b, c, x[ 9], S12, 16_8b44f7af); (* 10 *)\n FF(c, d, a, b, x[10], S13, 16_ffff5bb1); (* 11 *)\n FF(b, c, d, a, x[11], S14, 16_895cd7be); (* 12 *)\n FF(a, b, c, d, x[12], S11, 16_6b901122); (* 13 *)\n FF(d, a, b, c, x[13], S12, 16_fd987193); (* 14 *)\n FF(c, d, a, b, x[14], S13, 16_a679438e); (* 15 *)\n FF(b, c, d, a, x[15], S14, 16_49b40821); (* 16 *)\n\n (* Round 2 *)\n GG(a, b, c, d, x[ 1], S21, 16_f61e2562); (* 17 *)\n GG(d, a, b, c, x[ 6], S22, 16_c040b340); (* 18 *)\n GG(c, d, a, b, x[11], S23, 16_265e5a51); (* 19 *)\n GG(b, c, d, a, x[ 0], S24, 16_e9b6c7aa); (* 20 *)\n GG(a, b, c, d, x[ 5], S21, 16_d62f105d); (* 21 *)\n GG(d, a, b, c, x[10], S22, 16_02441453); (* 22 *)\n GG(c, d, a, b, x[15], S23, 16_d8a1e681); (* 23 *)\n GG(b, c, d, a, x[ 4], S24, 16_e7d3fbc8); (* 24 *)\n GG(a, b, c, d, x[ 9], S21, 16_21e1cde6); (* 25 *)\n GG(d, a, b, c, x[14], S22, 16_c33707d6); (* 26 *)\n GG(c, d, a, b, x[ 3], S23, 16_f4d50d87); (* 27 *)\n GG(b, c, d, a, x[ 8], S24, 16_455a14ed); (* 28 *)\n GG(a, b, c, d, x[13], S21, 16_a9e3e905); (* 29 *)\n GG(d, a, b, c, x[ 2], S22, 16_fcefa3f8); (* 30 *)\n GG(c, d, a, b, x[ 7], S23, 16_676f02d9); (* 31 *)\n GG(b, c, d, a, x[12], S24, 16_8d2a4c8a); (* 32 *)\n\n (* Round 3 *)\n HH(a, b, c, d, x[ 5], S31, 16_fffa3942); (* 33 *)\n HH(d, a, b, c, x[ 8], S32, 16_8771f681); (* 34 *)\n HH(c, d, a, b, x[11], S33, 16_6d9d6122); (* 35 *)\n HH(b, c, d, a, x[14], S34, 16_fde5380c); (* 36 *)\n HH(a, b, c, d, x[ 1], S31, 16_a4beea44); (* 37 *)\n HH(d, a, b, c, x[ 4], S32, 16_4bdecfa9); (* 38 *)\n HH(c, d, a, b, x[ 7], S33, 16_f6bb4b60); (* 39 *)\n HH(b, c, d, a, x[10], S34, 16_bebfbc70); (* 40 *)\n HH(a, b, c, d, x[13], S31, 16_289b7ec6); (* 41 *)\n HH(d, a, b, c, x[ 0], S32, 16_eaa127fa); (* 42 *)\n HH(c, d, a, b, x[ 3], S33, 16_d4ef3085); (* 43 *)\n HH(b, c, d, a, x[ 6], S34, 16_04881d05); (* 44 *)\n HH(a, b, c, d, x[ 9], S31, 16_d9d4d039); (* 45 *)\n HH(d, a, b, c, x[12], S32, 16_e6db99e5); (* 46 *)\n HH(c, d, a, b, x[15], S33, 16_1fa27cf8); (* 47 *)\n HH(b, c, d, a, x[ 2], S34, 16_c4ac5665); (* 48 *)\n\n (* Round 4 *)\n II(a, b, c, d, x[ 0], S41, 16_f4292244); (* 49 *)\n II(d, a, b, c, x[ 7], S42, 16_432aff97); (* 50 *)\n II(c, d, a, b, x[14], S43, 16_ab9423a7); (* 51 *)\n II(b, c, d, a, x[ 5], S44, 16_fc93a039); (* 52 *)\n II(a, b, c, d, x[12], S41, 16_655b59c3); (* 53 *)\n II(d, a, b, c, x[ 3], S42, 16_8f0ccc92); (* 54 *)\n II(c, d, a, b, x[10], S43, 16_ffeff47d); (* 55 *)\n II(b, c, d, a, x[ 1], S44, 16_85845dd1); (* 56 *)\n II(a, b, c, d, x[ 8], S41, 16_6fa87e4f); (* 57 *)\n II(d, a, b, c, x[15], S42, 16_fe2ce6e0); (* 58 *)\n II(c, d, a, b, x[ 6], S43, 16_a3014314); (* 59 *)\n II(b, c, d, a, x[13], S44, 16_4e0811a1); (* 60 *)\n II(a, b, c, d, x[ 4], S41, 16_f7537e82); (* 61 *)\n II(d, a, b, c, x[11], S42, 16_bd3af235); (* 62 *)\n II(c, d, a, b, x[ 2], S43, 16_2ad7d2bb); (* 63 *)\n II(b, c, d, a, x[ 9], S44, 16_eb86d391); (* 64 *)\n\n state[0] := Word.Plus(state[0], a);\n state[1] := Word.Plus(state[1], b);\n state[2] := Word.Plus(state[2], c);\n state[3] := Word.Plus(state[3], d);\n END Transform;\n\nPROCEDURE Update(VAR md5ctx: T; input: TEXT) =\n VAR index, i, j, partLen: Word.T;\n locbuff: Buffer;\n\n BEGIN\n index := Word.And(Word.Shift(md5ctx.count[0], -3), 16_3F);\n md5ctx.count[0] :=\n Word.Plus(md5ctx.count[0], Word.Shift(Text.Length(input), 3));\n\n IF md5ctx.count[0] < Text.Length(input) THEN\n INC(md5ctx.count[1]);\n END;\n md5ctx.count[1] := md5ctx.count[1] + Word.Shift(Text.Length(input), -29);\n partLen := 64 - index;\n IF Text.Length(input) >= partLen THEN\n FOR i := index TO 63 DO\n md5ctx.buffer[i] := Text.GetChar(input, i-index);\n END;\n Transform(md5ctx.state, md5ctx.buffer);\n i := partLen;\n WHILE (i + 63) < Text.Length(input) DO\n FOR j := 0 TO 63 DO\n locbuff[j] := Text.GetChar(input, i+j);\n END;\n Transform(md5ctx.state, locbuff);\n INC(i, 64);\n END;\n index := 0;\n ELSE\n i := 0;\n END;\n\n j := 0;\n WHILE i+j < Text.Length(input) DO\n md5ctx.buffer[j+index] := Text.GetChar(input, i+j);\n INC(j);\n END;\n END Update;\n\nPROCEDURE Final(VAR md5ctx: T): Digest=\n VAR bits: ARRAY [0..7] OF CHAR;\n index, padLen: INTEGER;\n digest: Digest;\n\n PROCEDURE Encode(VAR output: ARRAY OF CHAR;\n VAR input: ARRAY OF Word.T;\n count: INTEGER) =\n BEGIN\n FOR i := 0 TO count DO\n output[i*4+0] := VAL(Word.Extract(input[i], 0, 8), CHAR);\n output[i*4+1] := VAL(Word.Extract(input[i], 8, 8), CHAR);\n output[i*4+2] := VAL(Word.Extract(input[i], 16, 8), CHAR);\n output[i*4+3] := VAL(Word.Extract(input[i], 24, 8), CHAR)\n END;\n END Encode;\n BEGIN\n Encode(bits, md5ctx.count, 1);\n index := Word.And(Word.Shift(md5ctx.count[0], -3), 16_3F);\n IF index < 56 THEN\n padLen := 56 - index;\n ELSE\n padLen := 120 - index;\n END;\n Update(md5ctx, Text.Sub(padding, 0, padLen));\n Update(md5ctx, Text.FromChars(bits));\n Encode(digest, md5ctx.state, 3);\n RETURN digest;\n END Final;\n\nPROCEDURE ToText(hash: Digest): TEXT =\n VAR buf: TEXT := \"\";\n BEGIN\n FOR i := 0 TO 15 DO\n buf := buf & Fmt.Pad(Fmt.Int(ORD(hash[i]), 16), 2, '0');\n END;\n RETURN buf;\n END ToText;\n\nBEGIN\nEND MD5.\n","language":"Modula-3"},{"code":"MODULE Main;\n\nIMPORT MD5, IO;\n\nVAR md5ctx: MD5.T;\n\nBEGIN\n MD5.Init(md5ctx);\n MD5.Update(md5ctx, \"The quick brown fox jumped over the lazy dog's back\");\n IO.Put(MD5.ToText(MD5.Final(md5ctx)) & \"\\n\");\nEND Main.\n","language":"Modula-3"},{"code":"import sequtils\n\nconst\n ChunkSize = 512 div 8\n SumSize = 128 div 8\n\nproc extractChunk(msg : seq[uint8], chunk: var openarray[uint32], offset: int) =\n var\n srcIndex = offset\n\n for dstIndex in 0 ..< 16:\n chunk[dstIndex] = 0\n for ii in 0 ..< 4:\n chunk[dstIndex] = chunk[dstIndex] shr 8\n chunk[dstIndex] = chunk[dstIndex] or (msg[srcIndex].uint32 shl 24)\n srcIndex.inc\n\nproc leftRotate(val: uint32, shift: int) : uint32 =\n result = (val shl shift) or (val shr (32 - shift))\n\nproc md5Sum(msg : seq[uint8]) : array[SumSize, uint8] =\n const\n s : array[ChunkSize, int] =\n [ 7, 12, 17, 22, 7, 12, 17, 22,\n 7, 12, 17, 22, 7, 12, 17, 22,\n 5, 9, 14, 20, 5, 9, 14, 20,\n 5, 9, 14, 20, 5, 9, 14, 20,\n 4, 11, 16, 23, 4, 11, 16, 23,\n 4, 11, 16, 23, 4, 11, 16, 23,\n 6, 10, 15, 21, 6, 10, 15, 21,\n 6, 10, 15, 21, 6, 10, 15, 21 ]\n\n K : array[ChunkSize, uint32] =\n [ 0xd76aa478'u32, 0xe8c7b756'u32, 0x242070db'u32, 0xc1bdceee'u32,\n 0xf57c0faf'u32, 0x4787c62a'u32, 0xa8304613'u32, 0xfd469501'u32,\n 0x698098d8'u32, 0x8b44f7af'u32, 0xffff5bb1'u32, 0x895cd7be'u32,\n 0x6b901122'u32, 0xfd987193'u32, 0xa679438e'u32, 0x49b40821'u32,\n 0xf61e2562'u32, 0xc040b340'u32, 0x265e5a51'u32, 0xe9b6c7aa'u32,\n 0xd62f105d'u32, 0x02441453'u32, 0xd8a1e681'u32, 0xe7d3fbc8'u32,\n 0x21e1cde6'u32, 0xc33707d6'u32, 0xf4d50d87'u32, 0x455a14ed'u32,\n 0xa9e3e905'u32, 0xfcefa3f8'u32, 0x676f02d9'u32, 0x8d2a4c8a'u32,\n 0xfffa3942'u32, 0x8771f681'u32, 0x6d9d6122'u32, 0xfde5380c'u32,\n 0xa4beea44'u32, 0x4bdecfa9'u32, 0xf6bb4b60'u32, 0xbebfbc70'u32,\n 0x289b7ec6'u32, 0xeaa127fa'u32, 0xd4ef3085'u32, 0x04881d05'u32,\n 0xd9d4d039'u32, 0xe6db99e5'u32, 0x1fa27cf8'u32, 0xc4ac5665'u32,\n 0xf4292244'u32, 0x432aff97'u32, 0xab9423a7'u32, 0xfc93a039'u32,\n 0x655b59c3'u32, 0x8f0ccc92'u32, 0xffeff47d'u32, 0x85845dd1'u32,\n 0x6fa87e4f'u32, 0xfe2ce6e0'u32, 0xa3014314'u32, 0x4e0811a1'u32,\n 0xf7537e82'u32, 0xbd3af235'u32, 0x2ad7d2bb'u32, 0xeb86d391'u32 ]\n\n\n # Pad with 1-bit, and fill with 0's up to 448 bits mod 512\n var paddedMsgSize = msg.len + 1\n var remain = (msg.len + 1) mod ChunkSize\n if remain > (448 div 8):\n paddedMsgSize += ChunkSize - remain + (448 div 8)\n else:\n paddedMsgSize += (448 div 8) - remain\n\n var paddingSize = paddedMsgSize - msg.len\n var padding = newSeq[uint8](paddingSize)\n padding[0] = 0x80\n\n # Pad with number of *bits* in original message, little-endian\n var sizePadding = newSeq[uint8](8)\n var size = msg.len * 8\n for ii in 0 ..< 4:\n sizePadding[ii] = uint8(size and 0xff)\n size = size shr 8\n\n var paddedMsg = concat(msg, padding, sizePadding)\n\n var accum = [ 0x67452301'u32, 0xefcdab89'u32, 0x98badcfe'u32, 0x10325476'u32 ]\n\n for offset in countup(0, paddedMsg.len - 1, ChunkSize):\n var A = accum[0]\n var B = accum[1]\n var C = accum[2]\n var D = accum[3]\n var F : uint32\n var g : int\n var M : array[16, uint32]\n var dTemp : uint32\n\n extractChunk(paddedMsg, M, offset)\n\n # This is pretty much the same as Wikipedia's MD5 entry\n for ii in 0 .. 63:\n if ii <= 15:\n F = (B and C) or ((not B) and D)\n g = ii\n\n elif ii <= 31:\n F = (D and B) or ((not D) and C)\n g = (5 * ii + 1) mod 16\n\n elif ii <= 47:\n F = B xor C xor D\n g = (3 * ii + 5) mod 16\n\n else:\n F = C xor (B or (not D))\n g = (7 * ii) mod 16\n\n dTemp = D\n D = C\n C = B\n B = B + leftRotate((A + F + K[ii] + M[g]), s[ii])\n A = dTemp\n\n accum[0] += A\n accum[1] += B\n accum[2] += C\n accum[3] += D\n\n # Convert four 32-bit accumulators to 16 byte array, little-endian\n var dstIdx : int\n for acc in accum:\n var tmp = acc\n\n for ii in 0 ..< 4:\n result[dstIdx] = uint8(tmp and 0xff)\n tmp = tmp shr 8\n dstIdx.inc\n\n# Only needed to convert from string to uint8 sequence\niterator items * (str : string) : uint8 =\n for ii in 0 ..< len(str):\n yield str[ii].uint8\n\nproc main =\n var msg = \"\"\n var sum = md5Sum(toSeq(msg.items()))\n assert(sum == [ 0xD4'u8, 0x1D, 0x8C, 0xD9, 0x8F, 0x00, 0xB2, 0x04,\n 0xE9, 0x80, 0x09, 0x98, 0xEC, 0xF8, 0x42, 0x7E ] )\n\n msg = \"The quick brown fox jumps over the lazy dog\"\n sum = md5Sum(toSeq(msg.items()))\n assert(sum == [ 0x9E'u8, 0x10, 0x7D, 0x9D, 0x37, 0x2B, 0xB6, 0x82,\n 0x6B, 0xD8, 0x1D, 0x35, 0x42, 0xA4, 0x19, 0xD6 ] )\n\n msg = \"The quick brown fox jumps over the lazy dog.\"\n sum = md5Sum(toSeq(msg.items()))\n assert(sum == [ 0xE4'u8, 0xD9, 0x09, 0xC2, 0x90, 0xD0, 0xFB, 0x1C,\n 0xA0, 0x68, 0xFF, 0xAD, 0xDF, 0x22, 0xCB, 0xD0 ])\n\n\n # Message size around magic 512 bits\n msg = \"01234567890123456789012345678901234567890123456789012345678901234\"\n sum = md5Sum(toSeq(msg.items()))\n assert(sum == [ 0xBE'u8, 0xB9, 0xF4, 0x8B, 0xC8, 0x02, 0xCA, 0x5C,\n 0xA0, 0x43, 0xBC, 0xC1, 0x5E, 0x21, 0x9A, 0x5A ])\n\n msg = \"0123456789012345678901234567890123456789012345678901234567890123\"\n sum = md5Sum(toSeq(msg.items()))\n assert(sum == [ 0x7F'u8, 0x7B, 0xFD, 0x34, 0x87, 0x09, 0xDE, 0xEA,\n 0xAC, 0xE1, 0x9E, 0x3F, 0x53, 0x5F, 0x8C, 0x54 ])\n\n msg = \"012345678901234567890123456789012345678901234567890123456789012\"\n sum = md5Sum(toSeq(msg.items()))\n assert(sum == [ 0xC5'u8, 0xE2, 0x56, 0x43, 0x7E, 0x75, 0x80, 0x92,\n 0xDB, 0xFE, 0x06, 0x28, 0x3E, 0x48, 0x90, 0x19 ])\n\n\n # Message size around magic 448 bits\n msg = \"01234567890123456789012345678901234567890123456789012345\"\n sum = md5Sum(toSeq(msg.items()))\n assert(sum == [ 0x8A'u8, 0xF2, 0x70, 0xB2, 0x84, 0x76, 0x10, 0xE7,\n 0x42, 0xB0, 0x79, 0x1B, 0x53, 0x64, 0x8C, 0x09 ])\n\n msg = \"0123456789012345678901234567890123456789012345678901234\"\n sum = md5Sum(toSeq(msg.items()))\n assert(sum == [ 0x6E'u8, 0x7A, 0x4F, 0xC9, 0x2E, 0xB1, 0xC3, 0xF6,\n 0xE6, 0x52, 0x42, 0x5B, 0xCC, 0x8D, 0x44, 0xB5 ])\n\n msg = \"012345678901234567890123456789012345678901234567890123\"\n sum = md5Sum(toSeq(msg.items()))\n assert(sum == [ 0x3D'u8, 0xFF, 0x83, 0xC8, 0xFA, 0xDD, 0x26, 0x37,\n 0x0D, 0x5B, 0x09, 0x84, 0x09, 0x64, 0x44, 0x57 ])\n\nmain()\n","language":"Nim"},{"code":"#!/usr/bin/env rexx\n\n/* Expected results:\n 0xd41d8cd98f00b204e9800998ecf8427e <== \"\"\n 0x0cc175b9c0f1b6a831c399e269772661 <== \"a\"\n 0x900150983cd24fb0d6963f7d28e17f72 <== \"abc\"\n 0xf96b697d7cb7938d525a2f31aaf161d0 <== \"message digest\"\n 0xc3fcd3d76192e4007dfb496cca67e13b <== \"abcdefghijklmnopqrstuvwxyz\"\n 0xd174ab98d277d9f5a5611c2c9f419d9f <== \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"\n 0x57edf4a22be3c955ac49da2e2107b67a <== \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"\n*/\n\nmd5 = .md5~new; md5~update(\"\"); say md5~digest\nmd5 = .md5~new; md5~update(\"a\"); say md5~digest\nmd5 = .md5~new; md5~update(\"abc\"); say md5~digest\nmd5 = .md5~new; md5~update(\"message digest\"); say md5~digest\nmd5 = .md5~new(\"abcdefghijklmnopqrstuvwxyz\"); say md5~digest\nmd5 = .md5~new(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"); md5~update(\"abcdefghijklmnopqrstuvwxyz0123456789\"); say md5~digest\nmd5 = .md5~new; md5~update(\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"); say md5~digest\n\n-- requires OORexx 4.2.0 or later\n-- standard numeric digits of 9 is not enough in this case\n::options digits 20\n\n-- Implementation mainly based on pseudocode in https://en.wikipedia.org/wiki/MD5\n::class md5 public\n\n::method init\nexpose a0 b0 c0 d0 count buffer index K. s -- instance variables\nuse strict arg chunk=\"\"\n-- Initialize message digest\na0 = .int32~new('67452301'x,\"C\") -- A\nb0 = .int32~new('efcdab89'x,\"C\") -- B\nc0 = .int32~new('98badcfe'x,\"C\") -- C\nd0 = .int32~new('10325476'x,\"C\") -- D\n-- The 512 bit chunk buffer\nbuffer = .mutablebuffer~new('00'x~copies(64),64)\n-- The position in the buffer to insert new input\nindex = 1\n-- message bytecount\ncount = 0\n-- initialize leftrotate amounts\nnrs = .array~of(7,12,17,22)\ns = nrs~union(nrs)~union(nrs)~union(nrs)\nnrs = .array~of(5,9,14,20)\ns = s~union(nrs)~union(nrs)~union(nrs)~union(nrs)\nnrs = .array~of(4,11,16,23)\ns = s~union(nrs)~union(nrs)~union(nrs)~union(nrs)\nnrs = .array~of(6,10,15,21)\ns = s~union(nrs)~union(nrs)~union(nrs)~union(nrs)\n-- initialize sinus derived constants.\n-- sin function from RXMath Library shipped with OORexx\n-- see ::routine directive at the end of the code\ndo i=0 to 63\n K.i = .int32~new(((2**32)*(sin(i+1,16,R)~abs))~floor)\nend\n-- process initial string if any\nself~update(chunk)\nexit\n\n::method update\n expose a0 b0 c0 d0 count buffer index K. s -- instance variables\n use strict arg chunk\n count += chunk~length\n if chunk~length<65-index then do\n buffer~overlay(chunk,index)\n index += chunk~length\n end\n else do\n split = 65-index+1\n parse var chunk part =(split) chunk\n buffer~overlay(part,index)\n index = 65\n end\n -- Only process completely filled buffer\n do while index=65\n A = a0\n B = b0\n C = c0\n D = d0\n do i=0 to 63\n select\n when i<16 then do\n F = D~xor(B~and(C~xor(D)))\n g = i\n end\n when i<32 then do\n F = C~xor(D~and(B~xor(C)))\n g = (5*i+1)//16\n end\n when i<48 then do\n F = B~xor(C)~xor(D)\n g = (3*i+5)//16\n end\n otherwise do\n F = C~xor(B~or(D~xor(.int32~new('ffffffff'x,\"C\"))))\n g = (7*i)//16\n end\n end\n M = .int32~new(buffer~substr(g*4+1,4)~reverse,\"C\") -- 32bit word in little-endian\n dTemp = D\n D = C\n C = B\n B = (B + (A+F+K.i+M)~bitrotate(s[i+1]))\n A = dTemp\n end\n a0 = a0+A\n b0 = b0+B\n c0 = c0+C\n d0 = d0+D\n parse var chunk part 65 chunk\n index = part~length+1\n buffer~overlay(part,1,part~length)\n end\nexit\n\n::method digest\n expose a0 b0 c0 d0 count buffer index K s -- instance variables\n padlen = 64\n if index<57 then padlen = 57-index\n if index>57 then padlen = 121-index\n padding = '00'x~copies(padlen)~bitor('80'x)\n bitcount = count*8//2**64\n lowword = bitcount//2**32\n hiword = bitcount%2**32\n lowcount = lowword~d2c(4)~reverse -- make it little-endian\n hicount = hiword~d2c(4)~reverse -- make it little-endian\n self~update(padding || lowcount || hicount)\nreturn a0~string || b0~string || c0~string || d0~string\n\n-- A convenience class to encapsulate operations on non OORexx-like\n-- things such as little-endian 32-bit words\n::class int32 public\n\n::attribute arch class\n\n::method init class\n self~arch = \"little-endian\" -- can be adapted for multiple architectures\n\n-- Method to create an int32 like object\n-- Input can be a OORexx whole number (type=\"I\") or\n-- a character string of 4 bytes (type=\"C\")\n-- input truncated or padded to 32-bit word/string\n::method init\n expose char4 int32\n use strict arg input, type=\"Integer\"\n -- type must be one of \"I\"nteger or \"C\"haracter\n t = type~subchar(1)~upper\n select\n when t=='I' then do\n char4 = input~d2c(4)\n int32 = char4~c2d\n end\n when t=='C' then do\n char4 = input~right(4,'00'x)\n int32 = char4~c2d\n end\n otherwise do\n raise syntax 93.915 array(\"IC\",type)\n end\n end\nexit\n\n::method xor -- wrapper for OORexx bitxor method\n expose char4\n use strict arg other\nreturn .int32~new(char4~bitxor(other~char),\"C\")\n\n::method and -- wrapper for OORexx bitand method\n expose char4\n use strict arg other\nreturn .int32~new(char4~bitand(other~char),\"C\")\n\n::method or -- wrapper for OORexx bitor method\n expose char4\n use strict arg other\nreturn .int32~new(char4~bitor(other~char),\"C\")\n\n::method bitleft -- OORexx shift (<<) implementation\n expose char4\n use strict arg bits\n bstring = char4~c2x~x2b\n bstring = bstring~substr(bits+1)~left(bstring~length,'0')\nreturn .int32~new(bstring~b2x~x2d)\n\n-- For those who like to code the shift operation in a traditional way\n::method '<<'\n forward to (self) message(\"bitleft\")\n\n::method bitright -- OORexx shift (>>) implementation\n expose char4\n use strict arg bits, signed=.false\n bstring = char4~c2x~x2b\n fill = '0'\n if signed then fill = bstring~subchar(1)\n bstring = bstring~left(bstring~length-bits)~right(bstring~length,fill)\nreturn .int32~new(bstring~b2x~x2d)\n\n-- For those who like to code the shift operation in a traditional way\n::method '>>'\n forward to (self) message(\"bitright\")\n\n::method bitnot -- OORexx not implementation\n expose char4\nreturn .int32~new(char4~bitxor('ffffffff'x)~c2d,\"C\")\n\n::method bitrotate -- OORexx (left) rotate method\n expose char4\n use strict arg bits, direction='left'\n d = direction~subchar(1)~upper\n if d=='L' then do\n leftpart = self~bitleft(bits)\n rightpart = self~bitright(32-bits)\n end\n else do\n leftpart = self~bitleft(32-bits)\n rightpart = self~bitright(bits)\n end\nreturn rightpart~or(leftpart)\n\n::method int -- retrieve integer as number\n expose int32\nreturn int32\n\n::method char -- retrieve integer as characters\n expose char4\nreturn char4\n\n::method '+' -- OORexx method to add 2 .int32 instances\n expose int32\n use strict arg other\nreturn .int32~new(int32+other~int)\n\n::method string -- retrieve integer as hexadecimal string\n expose char4\nreturn char4~reverse~c2x~lower\n\n-- Simplify function names for the necessary 'RxMath' functions\t\n::routine sin EXTERNAL \"LIBRARY rxmath RxCalcSin\"\n","language":"OoRexx"},{"code":"use strict;\nuse warnings;\nuse integer;\nuse Test::More;\n\nBEGIN { plan tests => 7 }\n\nsub A() { 0x67_45_23_01 }\nsub B() { 0xef_cd_ab_89 }\nsub C() { 0x98_ba_dc_fe }\nsub D() { 0x10_32_54_76 }\nsub MAX() { 0xFFFFFFFF }\n\nsub padding {\n my $l = length (my $msg = shift() . chr(128));\n $msg .= \"\\0\" x (($l%64<=56?56:120)-$l%64);\n $l = ($l-1)*8;\n $msg .= pack 'VV', $l & MAX , ($l >> 16 >> 16);\n}\n\nsub rotate_left {\n ($_[0] << $_[1]) | (( $_[0] >> (32 - $_[1]) ) & ((1 << $_[1]) - 1));\n}\n\nsub gen_code {\n # Discard upper 32 bits on 64 bit archs.\n my $MSK = ((1 << 16) << 16) ? ' & ' . MAX : '';\n my %f = (\n FF => \"X0=rotate_left((X3^(X1&(X2^X3)))+X0+X4+X6$MSK,X5)+X1$MSK;\",\n GG => \"X0=rotate_left((X2^(X3&(X1^X2)))+X0+X4+X6$MSK,X5)+X1$MSK;\",\n HH => \"X0=rotate_left((X1^X2^X3)+X0+X4+X6$MSK,X5)+X1$MSK;\",\n II => \"X0=rotate_left((X2^(X1|(~X3)))+X0+X4+X6$MSK,X5)+X1$MSK;\",\n );\n\n my %s = ( # shift lengths\n S11 => 7, S12 => 12, S13 => 17, S14 => 22, S21 => 5, S22 => 9, S23 => 14,\n S24 => 20, S31 => 4, S32 => 11, S33 => 16, S34 => 23, S41 => 6, S42 => 10,\n S43 => 15, S44 => 21\n );\n\n my $insert = \"\\n\";\n while(defined( my $data = <DATA> )) {\n chomp $data;\n next unless $data =~ /^[FGHI]/;\n my ($func,@x) = split /,/, $data;\n my $c = $f{$func};\n $c =~ s/X(\\d)/$x[$1]/g;\n $c =~ s/(S\\d{2})/$s{$1}/;\n $c =~ s/^(.*)=rotate_left\\((.*),(.*)\\)\\+(.*)$//;\n\n my $su = 32 - $3;\n my $sh = (1 << $3) - 1;\n\n $c = \"$1=(((\\$r=$2)<<$3)|((\\$r>>$su)&$sh))+$4\";\n\n $insert .= \"\\t$c\\n\";\n }\n close DATA;\n\n my $dump = '\n sub round {\n my ($a,$b,$c,$d) = @_[0 .. 3];\n my $r;' . $insert . '\n $_[0]+$a' . $MSK . ', $_[1]+$b ' . $MSK .\n ', $_[2]+$c' . $MSK . ', $_[3]+$d' . $MSK . ';\n }';\n eval $dump;\n}\n\ngen_code();\n\nsub _encode_hex { unpack 'H*', $_[0] }\n\nsub md5 {\n my $message = padding(join'',@_);\n my ($a,$b,$c,$d) = (A,B,C,D);\n my $i;\n for $i (0 .. (length $message)/64-1) {\n my @X = unpack 'V16', substr $message,$i*64,64;\n ($a,$b,$c,$d) = round($a,$b,$c,$d,@X);\n }\n pack 'V4',$a,$b,$c,$d;\n}\n\nmy $strings = {\n 'd41d8cd98f00b204e9800998ecf8427e' => '',\n '0cc175b9c0f1b6a831c399e269772661' => 'a',\n '900150983cd24fb0d6963f7d28e17f72' => 'abc',\n 'f96b697d7cb7938d525a2f31aaf161d0' => 'message digest',\n 'c3fcd3d76192e4007dfb496cca67e13b' => 'abcdefghijklmnopqrstuvwxyz',\n 'd174ab98d277d9f5a5611c2c9f419d9f' => 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789',\n '57edf4a22be3c955ac49da2e2107b67a' => '12345678901234567890123456789012345678901234567890123456789012345678901234567890',\n};\n\nfor my $k (keys %$strings) {\n my $digest = _encode_hex md5($strings->{$k});\n is($digest, $k, \"$digest is MD5 digest $strings->{$k}\");\n}\n\n__DATA__\nFF,$a,$b,$c,$d,$_[4],7,0xd76aa478,/* 1 */\nFF,$d,$a,$b,$c,$_[5],12,0xe8c7b756,/* 2 */\nFF,$c,$d,$a,$b,$_[6],17,0x242070db,/* 3 */\nFF,$b,$c,$d,$a,$_[7],22,0xc1bdceee,/* 4 */\nFF,$a,$b,$c,$d,$_[8],7,0xf57c0faf,/* 5 */\nFF,$d,$a,$b,$c,$_[9],12,0x4787c62a,/* 6 */\nFF,$c,$d,$a,$b,$_[10],17,0xa8304613,/* 7 */\nFF,$b,$c,$d,$a,$_[11],22,0xfd469501,/* 8 */\nFF,$a,$b,$c,$d,$_[12],7,0x698098d8,/* 9 */\nFF,$d,$a,$b,$c,$_[13],12,0x8b44f7af,/* 10 */\nFF,$c,$d,$a,$b,$_[14],17,0xffff5bb1,/* 11 */\nFF,$b,$c,$d,$a,$_[15],22,0x895cd7be,/* 12 */\nFF,$a,$b,$c,$d,$_[16],7,0x6b901122,/* 13 */\nFF,$d,$a,$b,$c,$_[17],12,0xfd987193,/* 14 */\nFF,$c,$d,$a,$b,$_[18],17,0xa679438e,/* 15 */\nFF,$b,$c,$d,$a,$_[19],22,0x49b40821,/* 16 */\nGG,$a,$b,$c,$d,$_[5],5,0xf61e2562,/* 17 */\nGG,$d,$a,$b,$c,$_[10],9,0xc040b340,/* 18 */\nGG,$c,$d,$a,$b,$_[15],14,0x265e5a51,/* 19 */\nGG,$b,$c,$d,$a,$_[4],20,0xe9b6c7aa,/* 20 */\nGG,$a,$b,$c,$d,$_[9],5,0xd62f105d,/* 21 */\nGG,$d,$a,$b,$c,$_[14],9,0x2441453,/* 22 */\nGG,$c,$d,$a,$b,$_[19],14,0xd8a1e681,/* 23 */\nGG,$b,$c,$d,$a,$_[8],20,0xe7d3fbc8,/* 24 */\nGG,$a,$b,$c,$d,$_[13],5,0x21e1cde6,/* 25 */\nGG,$d,$a,$b,$c,$_[18],9,0xc33707d6,/* 26 */\nGG,$c,$d,$a,$b,$_[7],14,0xf4d50d87,/* 27 */\nGG,$b,$c,$d,$a,$_[12],20,0x455a14ed,/* 28 */\nGG,$a,$b,$c,$d,$_[17],5,0xa9e3e905,/* 29 */\nGG,$d,$a,$b,$c,$_[6],9,0xfcefa3f8,/* 30 */\nGG,$c,$d,$a,$b,$_[11],14,0x676f02d9,/* 31 */\nGG,$b,$c,$d,$a,$_[16],20,0x8d2a4c8a,/* 32 */\nHH,$a,$b,$c,$d,$_[9],4,0xfffa3942,/* 33 */\nHH,$d,$a,$b,$c,$_[12],11,0x8771f681,/* 34 */\nHH,$c,$d,$a,$b,$_[15],16,0x6d9d6122,/* 35 */\nHH,$b,$c,$d,$a,$_[18],23,0xfde5380c,/* 36 */\nHH,$a,$b,$c,$d,$_[5],4,0xa4beea44,/* 37 */\nHH,$d,$a,$b,$c,$_[8],11,0x4bdecfa9,/* 38 */\nHH,$c,$d,$a,$b,$_[11],16,0xf6bb4b60,/* 39 */\nHH,$b,$c,$d,$a,$_[14],23,0xbebfbc70,/* 40 */\nHH,$a,$b,$c,$d,$_[17],4,0x289b7ec6,/* 41 */\nHH,$d,$a,$b,$c,$_[4],11,0xeaa127fa,/* 42 */\nHH,$c,$d,$a,$b,$_[7],16,0xd4ef3085,/* 43 */\nHH,$b,$c,$d,$a,$_[10],23,0x4881d05,/* 44 */\nHH,$a,$b,$c,$d,$_[13],4,0xd9d4d039,/* 45 */\nHH,$d,$a,$b,$c,$_[16],11,0xe6db99e5,/* 46 */\nHH,$c,$d,$a,$b,$_[19],16,0x1fa27cf8,/* 47 */\nHH,$b,$c,$d,$a,$_[6],23,0xc4ac5665,/* 48 */\nII,$a,$b,$c,$d,$_[4],6,0xf4292244,/* 49 */\nII,$d,$a,$b,$c,$_[11],10,0x432aff97,/* 50 */\nII,$c,$d,$a,$b,$_[18],15,0xab9423a7,/* 51 */\nII,$b,$c,$d,$a,$_[9],21,0xfc93a039,/* 52 */\nII,$a,$b,$c,$d,$_[16],6,0x655b59c3,/* 53 */\nII,$d,$a,$b,$c,$_[7],10,0x8f0ccc92,/* 54 */\nII,$c,$d,$a,$b,$_[14],15,0xffeff47d,/* 55 */\nII,$b,$c,$d,$a,$_[5],21,0x85845dd1,/* 56 */\nII,$a,$b,$c,$d,$_[12],6,0x6fa87e4f,/* 57 */\nII,$d,$a,$b,$c,$_[19],10,0xfe2ce6e0,/* 58 */\nII,$c,$d,$a,$b,$_[10],15,0xa3014314,/* 59 */\nII,$b,$c,$d,$a,$_[17],21,0x4e0811a1,/* 60 */\nII,$a,$b,$c,$d,$_[8],6,0xf7537e82,/* 61 */\nII,$d,$a,$b,$c,$_[15],10,0xbd3af235,/* 62 */\nII,$c,$d,$a,$b,$_[6],15,0x2ad7d2bb,/* 63 */\nII,$b,$c,$d,$a,$_[13],21,0xeb86d391,/* 64 */\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">-- demo\\rosetta\\md5.exw</span>\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;\">uxor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">data1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">data2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">result</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">xor_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">data1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">data2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">result</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">result</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">#100000000</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">result</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;\">uor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">data1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">data2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">result</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">or_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">data1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">data2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">result</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">result</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">#100000000</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">result</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;\">r32</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: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">#100000000</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;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">bits</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- left rotate the bits of a 32-bit number by the specified number of bits</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">bits</span><span style=\"color: #0000FF;\">))+</span><span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">bits</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;\">K</span> <span style=\"color: #0000FF;\">=</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">#d76aa478</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#e8c7b756</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#242070db</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#c1bdceee</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#f57c0faf</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#4787c62a</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#a8304613</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#fd469501</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">#698098d8</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#8b44f7af</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#ffff5bb1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#895cd7be</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#6b901122</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#fd987193</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#a679438e</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#49b40821</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">#f61e2562</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#c040b340</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#265e5a51</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#e9b6c7aa</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#d62f105d</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#02441453</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#d8a1e681</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#e7d3fbc8</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">#21e1cde6</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#c33707d6</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#f4d50d87</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#455a14ed</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#a9e3e905</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#fcefa3f8</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#676f02d9</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#8d2a4c8a</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">#fffa3942</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#8771f681</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#6d9d6122</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#fde5380c</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#a4beea44</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#4bdecfa9</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#f6bb4b60</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#bebfbc70</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">#289b7ec6</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#eaa127fa</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#d4ef3085</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#04881d05</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#d9d4d039</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#e6db99e5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#1fa27cf8</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#c4ac5665</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">#f4292244</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#432aff97</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#ab9423a7</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#fc93a039</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#655b59c3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#8f0ccc92</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#ffeff47d</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#85845dd1</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">#6fa87e4f</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#fe2ce6e0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#a3014314</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#4e0811a1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#f7537e82</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#bd3af235</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#2ad7d2bb</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#eb86d391</span><span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">m_block</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;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">13</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">14</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">15</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">16</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">16</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">15</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">14</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">13</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">15</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">14</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;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">13</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">16</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">15</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">13</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;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">16</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">14</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">c_words</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">#67452301</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">#efcdab89</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">#98badcfe</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">#10325476</span><span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">words</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">divide_in_words</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">message</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- Divides the string into words (32-bit numbers)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">message</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;\">res</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>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">word</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;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">bytes_to_int</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">message</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">word</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;\">word</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">4</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;\">process_block</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- Updates the words according to the contents of the block</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">d</span>\n\n <span style=\"color: #000000;\">block</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">divide_in_words</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000000;\">a</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>\n <span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">]</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- Round 1</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">16</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span> <span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span> <span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">not_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">))),</span> <span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</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><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">not_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">))),</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">not_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">))),</span><span style=\"color: #000000;\">17</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">not_bits</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;\">22</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- Round 2</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">17</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">32</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span> <span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span> <span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">not_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)))),</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">not_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)))),</span> <span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">not_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">)))),</span><span style=\"color: #000000;\">14</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</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: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">not_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">)))),</span><span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- Round 3</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">33</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">48</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span> <span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span> <span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uxor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">xor_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">))),</span> <span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uxor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">xor_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">))),</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uxor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">xor_bits</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><span style=\"color: #000000;\">16</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uxor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">xor_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">))),</span><span style=\"color: #000000;\">23</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- Round 4</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">49</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">64</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span> <span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span> <span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uxor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">or_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">not_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)))),</span> <span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uxor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">or_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">not_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)))),</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uxor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">or_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">not_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">)))),</span><span style=\"color: #000000;\">15</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rol</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">m_block</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">]]+</span><span style=\"color: #000000;\">K</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">step</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">uxor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">or_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">not_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">)))),</span><span style=\"color: #000000;\">21</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- Update the words</span>\n <span style=\"color: #000000;\">words</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">deep_copy</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">)</span>\n <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: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</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;\">a</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">words</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;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">words</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: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">4</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;\">procedure</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">pad_message</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">message</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- Add bytes to the end of the message so it can be divided\n -- in an exact number of 64-byte blocks.</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;\">message</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">bytes_to_add</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">64</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">64</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">bytes_to_add</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">64</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">bytes_to_add</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\n <span style=\"color: #000000;\">message</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">deep_copy</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">message</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">message</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">#80</span>\n <span style=\"color: #000000;\">message</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;\">bytes_to_add</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">message</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">int_to_bytes</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">8</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>\n\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">message</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n\n <span style=\"color: #008080;\">global</span> <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">md5</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">message</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- Given a string, returns a 16-byte hash of it.</span>\n\n <span style=\"color: #000000;\">words</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">c_words</span> <span style=\"color: #000080;font-style:italic;\">-- Initialize the H words</span>\n\n <span style=\"color: #000000;\">message</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pad_message</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">message</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- Add bytes to the message\n\n -- Process each 64-byte block</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">block</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;\">message</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">64</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">process_block</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">message</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">block</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">63</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- Convert hash into bytes</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">int_to_bytes</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: #000080;font-style:italic;\">-- Return the hash</span>\n <span style=\"color: #7060A8;\">int_to_bytes</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">])&</span>\n <span style=\"color: #7060A8;\">int_to_bytes</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">])&</span>\n <span style=\"color: #7060A8;\">int_to_bytes</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">])</span>\n\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\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;\">or</span> <span style=\"color: #7060A8;\">include_file</span><span style=\"color: #0000FF;\">()=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">fmt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"0x%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X\\n\"</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: #000000;\">fmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">md5</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: #000000;\">fmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">md5</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"a\"</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: #000000;\">fmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">md5</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"abc\"</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: #000000;\">fmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">md5</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"message digest\"</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: #000000;\">fmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">md5</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"abcdefghijklmnopqrstuvwxyz\"</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: #000000;\">fmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">md5</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"</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: #000000;\">fmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">md5</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n<!--\n","language":"Phix"},{"code":"(scl 12)\n(load \"@lib/math.l\") # For 'sin'\n\n(de *Md5-R\n 7 12 17 22 7 12 17 22 7 12 17 22 7 12 17 22\n 5 9 14 20 5 9 14 20 5 9 14 20 5 9 14 20\n 4 11 16 23 4 11 16 23 4 11 16 23 4 11 16 23\n 6 10 15 21 6 10 15 21 6 10 15 21 6 10 15 21 )\n\n(de *Md5-K\n ~(make\n (for I 64\n (link\n (/ (* (abs (sin (* I 1.0))) `(** 2 32)) 1.0) ) ) ) )\n\n(de mod32 (N)\n (& N `(hex \"FFFFFFFF\")) )\n\n(de not32 (N)\n (x| N `(hex \"FFFFFFFF\")) )\n\n(de add32 @\n (mod32 (pass +)) )\n\n(de leftRotate (X C)\n (| (mod32 (>> (- C) X)) (>> (- 32 C) X)) )\n\n(de md5 (Str)\n (let Len (length Str)\n (setq Str\n (conc\n (need\n (- 8 (* 64 (/ (+ Len 1 8 63) 64))) # Pad to 64-8 bytes\n (conc\n (mapcar char (chop Str)) # Works only with ASCII characters\n (cons `(hex \"80\")) ) # '1' bit\n 0 ) # Pad with '0'\n (make\n (setq Len (* 8 Len))\n (do 8\n (link (& Len 255))\n (setq Len (>> 8 Len )) ) ) ) ) )\n (let\n (H0 `(hex \"67452301\")\n H1 `(hex \"EFCDAB89\")\n H2 `(hex \"98BADCFE\")\n H3 `(hex \"10325476\") )\n (while Str\n (let\n (A H0 B H1 C H2 D H3\n W (make\n (do 16\n (link\n (apply |\n (mapcar >> (0 -8 -16 -24) (cut 4 'Str)) ) ) ) ) )\n (use (Tmp F G)\n (for I 64\n (cond\n ((>= 16 I)\n (setq\n F (| (& B C) (& (not32 B) D))\n G I ) )\n ((>= 32 I)\n (setq\n F (| (& D B) (& (not32 D) C))\n G (inc (& (inc (* 5 (dec I))) 15)) ) )\n ((>= 48 I)\n (setq\n F (x| B C D)\n G (inc (& (+ 5 (* 3 (dec I))) 15)) ) )\n (T\n (setq\n F (x| C (| B (not32 D)))\n G (inc (& (* 7 (dec I)) 15)) ) ) )\n (setq\n Tmp D\n D C\n C B\n B\n (add32 B\n (leftRotate\n (add32 A F (get *Md5-K I) (get W G))\n (get *Md5-R I) ) )\n A Tmp ) ) )\n (setq\n H0 (add32 H0 A)\n H1 (add32 H1 B)\n H2 (add32 H2 C)\n H3 (add32 H3 D) ) ) )\n (pack\n (make\n (for N (list H0 H1 H2 H3)\n (do 4 # Convert to little endian hex string\n (link (pad 2 (hex (& N 255))))\n (setq N (>> 8 N)) ) ) ) ) ) )\n","language":"PicoLisp"},{"code":"import math\n\nrotate_amounts = [7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21]\n\nconstants = [int(abs(math.sin(i+1)) * 2**32) & 0xFFFFFFFF for i in range(64)]\n\ninit_values = [0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476]\n\nfunctions = 16*[lambda b, c, d: (b & c) | (~b & d)] + \\\n 16*[lambda b, c, d: (d & b) | (~d & c)] + \\\n 16*[lambda b, c, d: b ^ c ^ d] + \\\n 16*[lambda b, c, d: c ^ (b | ~d)]\n\nindex_functions = 16*[lambda i: i] + \\\n 16*[lambda i: (5*i + 1)%16] + \\\n 16*[lambda i: (3*i + 5)%16] + \\\n 16*[lambda i: (7*i)%16]\n\ndef left_rotate(x, amount):\n x &= 0xFFFFFFFF\n return ((x<<amount) | (x>>(32-amount))) & 0xFFFFFFFF\n\ndef md5(message):\n\n message = bytearray(message) #copy our input into a mutable buffer\n orig_len_in_bits = (8 * len(message)) & 0xffffffffffffffff\n message.append(0x80)\n while len(message)%64 != 56:\n message.append(0)\n message += orig_len_in_bits.to_bytes(8, byteorder='little')\n\n hash_pieces = init_values[:]\n\n for chunk_ofst in range(0, len(message), 64):\n a, b, c, d = hash_pieces\n chunk = message[chunk_ofst:chunk_ofst+64]\n for i in range(64):\n f = functions[i](b, c, d)\n g = index_functions[i](i)\n to_rotate = a + f + constants[i] + int.from_bytes(chunk[4*g:4*g+4], byteorder='little')\n new_b = (b + left_rotate(to_rotate, rotate_amounts[i])) & 0xFFFFFFFF\n a, b, c, d = d, new_b, b, c\n for i, val in enumerate([a, b, c, d]):\n hash_pieces[i] += val\n hash_pieces[i] &= 0xFFFFFFFF\n\n return sum(x<<(32*i) for i, x in enumerate(hash_pieces))\n\ndef md5_to_hex(digest):\n raw = digest.to_bytes(16, byteorder='little')\n return '{:032x}'.format(int.from_bytes(raw, byteorder='big'))\n\nif __name__=='__main__':\n demo = [b\"\", b\"a\", b\"abc\", b\"message digest\", b\"abcdefghijklmnopqrstuvwxyz\",\n b\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\",\n b\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"]\n for message in demo:\n print(md5_to_hex(md5(message)),' <= \"',message.decode('ascii'),'\"', sep='')\n","language":"Python"},{"code":"#lang racket\n(require file/md5)\n(md5 #\"Rosetta Code\")\n","language":"Racket"},{"code":"#\"cca1bf66b09554e10f837838c3d3efb1\"\n","language":"Racket"},{"code":"proto md5($msg) returns Blob is export {*}\nmulti md5(Str $msg) { md5 $msg.encode }\nmulti md5(Blob $msg) {\n my \\bits = 8 * $msg.elems;\n my buf8 $buf .= new;\n $buf.write-uint32: $buf.elems, $_, LittleEndian for\n reduce -> Blob $blob, blob32 $X {\n blob32.new: $blob Z+\n reduce -> $b, $i {\n blob32.new:\n $b[3],\n $b[1] +\n -> uint32 \\x, \\n { (x +< n) +| (x +> (32-n)) }(\n ($b[0] + (BEGIN Array.new:\n { ($^x +& $^y) +| (+^$x +& $^z) },\n { ($^x +& $^z) +| ($^y +& +^$z) },\n { $^x +^ $^y +^ $^z },\n { $^y +^ ($^x +| +^$^z) }\n )[$i div 16](|$b[1..3]) +\n (BEGIN blob32.new: map &floor ∘ * * 2**32 ∘ &abs ∘ &sin ∘ * + 1, ^64)[$i] +\n $X[(BEGIN Blob.new: 16 X[R%] flat ($++, 5*$++ + 1, 3*$++ + 5, 7*$++) Xxx 16)[$i]]\n ) mod 2**32,\n (BEGIN flat < 7 12 17 22 5 9 14 20 4 11 16 23 6 10 15 21 >.rotor(4) Xxx 4)[$i]\n ),\n $b[1],\n $b[2]\n }, $blob, |^64;\n },\n (BEGIN blob32.new: 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476),\n |map { blob32.new: @$_ },\n {\n $^b.push(blob8.new(@$_).read-uint32(0)) for (@$msg, 0x80, 0x00 xx (-(bits div 8 + 1 + 8) % 64))\n .flat.rotor(4);\n $b.write-uint64: $b.elems, bits, LittleEndian;\n $b;\n }(buf32.new)\n .rotor(16);\n $buf;\n}\n\nCHECK {\n use Test;\n\n for 'd41d8cd98f00b204e9800998ecf8427e', '',\n '0cc175b9c0f1b6a831c399e269772661', 'a',\n '900150983cd24fb0d6963f7d28e17f72', 'abc',\n 'f96b697d7cb7938d525a2f31aaf161d0', 'message digest',\n 'c3fcd3d76192e4007dfb496cca67e13b', 'abcdefghijklmnopqrstuvwxyz',\n 'd174ab98d277d9f5a5611c2c9f419d9f', 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789',\n '57edf4a22be3c955ac49da2e2107b67a', '12345678901234567890123456789012345678901234567890123456789012345678901234567890'\n -> $expected, $msg {\n my $digest = md5($msg).list».fmt('%02x').join;\n is($digest, $expected, \"$digest is MD5 digest of '$msg'\");\n }\n done-testing;\n}\n","language":"Raku"},{"code":"/*REXX program tests the MD5 procedure (below) as per a test suite from IETF RFC (1321).*/\n@.1 = /*─────MD5 test suite [from above doc].*/\n@.2 = 'a'\n@.3 = 'abc'\n@.4 = 'message digest'\n@.5 = 'abcdefghijklmnopqrstuvwxyz'\n@.6 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'\n@.7 = 12345678901234567890123456789012345678901234567890123456789012345678901234567890\n@.0 = 7 /* [↑] last value doesn't need quotes.*/\n do m=1 for @.0; say /*process each of the seven messages. */\n say ' in =' @.m /*display the in message. */\n say 'out =' MD5(@.m) /* \" \" out \" */\n end /*m*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nMD5: procedure; parse arg !; numeric digits 20 /*insure there's enough decimal digits.*/\n a= '67452301'x; b= \"efcdab89\"x; c= '98badcfe'x; d= \"10325476\"x\n #= length(!) /*length in bytes of the input message.*/\n L= #*8//512; if L<448 then plus= 448 - L /*is the length less than 448 ? */\n if L>448 then plus= 960 - L /* \" \" \" greater \" \" */\n if L=448 then plus= 512 /* \" \" \" equal to \" */\n /* [↓] a little of this, ··· */\n $=! || \"80\"x || copies('0'x,plus%8-1)reverse(right(d2c(8*#), 4, '0'x)) || '00000000'x\n /* [↑] ··· and a little of that.*/\n do j=0 for length($) % 64 /*process the message (lots of steps).*/\n a_= a; b_= b; c_= c; d_= d /*save the original values for later.*/\n chunk= j * 64 /*calculate the size of the chunks. */\n do k=1 for 16 /*process the message in chunks. */\n !.k= reverse( substr($, chunk + 1 + 4*(k-1), 4) ) /*magic stuff.*/\n end /*k*/ /*────step────*/\n a = .p1( a, b, c, d, 0, 7, 3614090360) /*■■■■ 1 ■■■■*/\n d = .p1( d, a, b, c, 1, 12, 3905402710) /*■■■■ 2 ■■■■*/\n c = .p1( c, d, a, b, 2, 17, 606105819) /*■■■■ 3 ■■■■*/\n b = .p1( b, c, d, a, 3, 22, 3250441966) /*■■■■ 4 ■■■■*/\n a = .p1( a, b, c, d, 4, 7, 4118548399) /*■■■■ 5 ■■■■*/\n d = .p1( d, a, b, c, 5, 12, 1200080426) /*■■■■ 6 ■■■■*/\n c = .p1( c, d, a, b, 6, 17, 2821735955) /*■■■■ 7 ■■■■*/\n b = .p1( b, c, d, a, 7, 22, 4249261313) /*■■■■ 8 ■■■■*/\n a = .p1( a, b, c, d, 8, 7, 1770035416) /*■■■■ 9 ■■■■*/\n d = .p1( d, a, b, c, 9, 12, 2336552879) /*■■■■ 10 ■■■■*/\n c = .p1( c, d, a, b, 10, 17, 4294925233) /*■■■■ 11 ■■■■*/\n b = .p1( b, c, d, a, 11, 22, 2304563134) /*■■■■ 12 ■■■■*/\n a = .p1( a, b, c, d, 12, 7, 1804603682) /*■■■■ 13 ■■■■*/\n d = .p1( d, a, b, c, 13, 12, 4254626195) /*■■■■ 14 ■■■■*/\n c = .p1( c, d, a, b, 14, 17, 2792965006) /*■■■■ 15 ■■■■*/\n b = .p1( b, c, d, a, 15, 22, 1236535329) /*■■■■ 16 ■■■■*/\n a = .p2( a, b, c, d, 1, 5, 4129170786) /*■■■■ 17 ■■■■*/\n d = .p2( d, a, b, c, 6, 9, 3225465664) /*■■■■ 18 ■■■■*/\n c = .p2( c, d, a, b, 11, 14, 643717713) /*■■■■ 19 ■■■■*/\n b = .p2( b, c, d, a, 0, 20, 3921069994) /*■■■■ 20 ■■■■*/\n a = .p2( a, b, c, d, 5, 5, 3593408605) /*■■■■ 21 ■■■■*/\n d = .p2( d, a, b, c, 10, 9, 38016083) /*■■■■ 22 ■■■■*/\n c = .p2( c, d, a, b, 15, 14, 3634488961) /*■■■■ 23 ■■■■*/\n b = .p2( b, c, d, a, 4, 20, 3889429448) /*■■■■ 24 ■■■■*/\n a = .p2( a, b, c, d, 9, 5, 568446438) /*■■■■ 25 ■■■■*/\n d = .p2( d, a, b, c, 14, 9, 3275163606) /*■■■■ 26 ■■■■*/\n c = .p2( c, d, a, b, 3, 14, 4107603335) /*■■■■ 27 ■■■■*/\n b = .p2( b, c, d, a, 8, 20, 1163531501) /*■■■■ 28 ■■■■*/\n a = .p2( a, b, c, d, 13, 5, 2850285829) /*■■■■ 29 ■■■■*/\n d = .p2( d, a, b, c, 2, 9, 4243563512) /*■■■■ 30 ■■■■*/\n c = .p2( c, d, a, b, 7, 14, 1735328473) /*■■■■ 31 ■■■■*/\n b = .p2( b, c, d, a, 12, 20, 2368359562) /*■■■■ 32 ■■■■*/\n a = .p3( a, b, c, d, 5, 4, 4294588738) /*■■■■ 33 ■■■■*/\n d = .p3( d, a, b, c, 8, 11, 2272392833) /*■■■■ 34 ■■■■*/\n c = .p3( c, d, a, b, 11, 16, 1839030562) /*■■■■ 35 ■■■■*/\n b = .p3( b, c, d, a, 14, 23, 4259657740) /*■■■■ 36 ■■■■*/\n a = .p3( a, b, c, d, 1, 4, 2763975236) /*■■■■ 37 ■■■■*/\n d = .p3( d, a, b, c, 4, 11, 1272893353) /*■■■■ 38 ■■■■*/\n c = .p3( c, d, a, b, 7, 16, 4139469664) /*■■■■ 39 ■■■■*/\n b = .p3( b, c, d, a, 10, 23, 3200236656) /*■■■■ 40 ■■■■*/\n a = .p3( a, b, c, d, 13, 4, 681279174) /*■■■■ 41 ■■■■*/\n d = .p3( d, a, b, c, 0, 11, 3936430074) /*■■■■ 42 ■■■■*/\n c = .p3( c, d, a, b, 3, 16, 3572445317) /*■■■■ 43 ■■■■*/\n b = .p3( b, c, d, a, 6, 23, 76029189) /*■■■■ 44 ■■■■*/\n a = .p3( a, b, c, d, 9, 4, 3654602809) /*■■■■ 45 ■■■■*/\n d = .p3( d, a, b, c, 12, 11, 3873151461) /*■■■■ 46 ■■■■*/\n c = .p3( c, d, a, b, 15, 16, 530742520) /*■■■■ 47 ■■■■*/\n b = .p3( b, c, d, a, 2, 23, 3299628645) /*■■■■ 48 ■■■■*/\n a = .p4( a, b, c, d, 0, 6, 4096336452) /*■■■■ 49 ■■■■*/\n d = .p4( d, a, b, c, 7, 10, 1126891415) /*■■■■ 50 ■■■■*/\n c = .p4( c, d, a, b, 14, 15, 2878612391) /*■■■■ 51 ■■■■*/\n b = .p4( b, c, d, a, 5, 21, 4237533241) /*■■■■ 52 ■■■■*/\n a = .p4( a, b, c, d, 12, 6, 1700485571) /*■■■■ 53 ■■■■*/\n d = .p4( d, a, b, c, 3, 10, 2399980690) /*■■■■ 54 ■■■■*/\n c = .p4( c, d, a, b, 10, 15, 4293915773) /*■■■■ 55 ■■■■*/\n b = .p4( b, c, d, a, 1, 21, 2240044497) /*■■■■ 56 ■■■■*/\n a = .p4( a, b, c, d, 8, 6, 1873313359) /*■■■■ 57 ■■■■*/\n d = .p4( d, a, b, c, 15, 10, 4264355552) /*■■■■ 58 ■■■■*/\n c = .p4( c, d, a, b, 6, 15, 2734768916) /*■■■■ 59 ■■■■*/\n b = .p4( b, c, d, a, 13, 21, 1309151649) /*■■■■ 60 ■■■■*/\n a = .p4( a, b, c, d, 4, 6, 4149444226) /*■■■■ 61 ■■■■*/\n d = .p4( d, a, b, c, 11, 10, 3174756917) /*■■■■ 62 ■■■■*/\n c = .p4( c, d, a, b, 2, 15, 718787259) /*■■■■ 63 ■■■■*/\n b = .p4( b, c, d, a, 9, 21, 3951481745) /*■■■■ 64 ■■■■*/\n a = .a(a_, a); b=.a(b_, b); c=.a(c_, c); d=.a(d_, d)\n end /*j*/\n return .rx(a).rx(b).rx(c).rx(d) /*same as: .rx(a) || .rx(b) || ··· */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n.a: return right( d2c( c2d( arg(1) ) + c2d( arg(2) ) ), 4, '0'x)\n.h: return bitxor( bitxor( arg(1), arg(2) ), arg(3) )\n.i: return bitxor( arg(2), bitor(arg(1), bitxor(arg(3), 'ffffffff'x) ) )\n.f: return bitor( bitand(arg(1), arg(2)), bitand(bitxor(arg(1), 'ffffffff'x), arg(3) ) )\n.g: return bitor( bitand(arg(1), arg(3)), bitand(arg(2), bitxor(arg(3), 'ffffffff'x) ) )\n.rx: return c2x( reverse( arg(1) ) )\n.Lr: procedure; parse arg _,#; if #==0 then return _ /*left bit rotate.*/\n ?=x2b(c2x(_)); return x2c( b2x( right(? || left(?, #), length(?) ) ) )\n.p1: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n + 1\n return .a(.Lr(right(d2c(_+c2d(w) + c2d(.f(x,y,z)) + c2d(!.n)),4,'0'x),m),x)\n.p2: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n + 1\n return .a(.Lr(right(d2c(_+c2d(w) + c2d(.g(x,y,z)) + c2d(!.n)),4,'0'x),m),x)\n.p3: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n + 1\n return .a(.Lr(right(d2c(_+c2d(w) + c2d(.h(x,y,z)) + c2d(!.n)),4,'0'x),m),x)\n.p4: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n + 1\n return .a(.Lr(right(d2c(c2d(w) + c2d(.i(x,y,z)) + c2d(!.n)+_),4,'0'x),m),x)\n","language":"REXX"},{"code":"**FREE\nCtl-opt MAIN(Main);\nCtl-opt DFTACTGRP(*NO) ACTGRP(*NEW);\n\ndcl-pr QDCXLATE EXTPGM('QDCXLATE');\n dataLen packed(5 : 0) CONST;\n data char(32767) options(*VARSIZE);\n conversionTable char(10) CONST;\nend-pr;\n\ndcl-c MASK32 CONST(4294967295);\ndcl-s SHIFT_AMTS int(3) dim(16) CTDATA PERRCD(16);\ndcl-s MD5_TABLE_T int(20) dim(64) CTDATA PERRCD(4);\n\ndcl-proc Main;\n dcl-s inputData char(45);\n dcl-s inputDataLen int(10) INZ(0);\n dcl-s outputHash char(16);\n dcl-s outputHashHex char(32);\n\n DSPLY 'Input: ' '' inputData;\n inputData = %trim(inputData);\n inputDataLen = %len(%trim(inputData));\n DSPLY ('Input=' + inputData);\n DSPLY ('InputLen=' + %char(inputDataLen));\n\n // Convert from EBCDIC to ASCII\n if inputDataLen > 0;\n QDCXLATE(inputDataLen : inputData : 'QTCPASC');\n endif;\n CalculateMD5(inputData : inputDataLen : outputHash);\n // Convert to hex\n ConvertToHex(outputHash : 16 : outputHashHex);\n DSPLY ('MD5: ' + outputHashHex);\n return;\nend-proc;\n\ndcl-proc CalculateMD5;\n dcl-pi *N;\n message char(65535) options(*VARSIZE) CONST;\n messageLen int(10) value;\n outputHash char(16);\n end-pi;\n dcl-s numBlocks int(10);\n dcl-s padding char(72);\n dcl-s a int(20) INZ(1732584193);\n dcl-s b int(20) INZ(4023233417);\n dcl-s c int(20) INZ(2562383102);\n dcl-s d int(20) INZ(271733878);\n dcl-s buffer int(20) dim(16) INZ(0);\n dcl-s i int(10);\n dcl-s j int(10);\n dcl-s k int(10);\n dcl-s multiplier int(20);\n dcl-s index int(10);\n dcl-s originalA int(20);\n dcl-s originalB int(20);\n dcl-s originalC int(20);\n dcl-s originalD int(20);\n dcl-s div16 int(10);\n dcl-s f int(20);\n dcl-s tempInt int(20);\n dcl-s bufferIndex int(10);\n dcl-ds byteToInt QUALIFIED;\n n int(5) INZ(0);\n c char(1) OVERLAY(n : 2);\n end-ds;\n\n numBlocks = (messageLen + 8) / 64 + 1;\n MD5_FillPadding(messageLen : numBlocks : padding);\n for i = 0 to numBlocks - 1;\n index = i * 64;\n\n // Read message as little-endian 32-bit words\n for j = 1 to 16;\n multiplier = 1;\n for k = 1 to 4;\n index += 1;\n if index <= messageLen;\n byteToInt.c = %subst(message : index : 1);\n else;\n byteToInt.c = %subst(padding : index - messageLen : 1);\n endif;\n buffer(j) += multiplier * byteToInt.n;\n multiplier *= 256;\n endfor;\n endfor;\n\n originalA = a;\n originalB = b;\n originalC = c;\n originalD = d;\n\n for j = 0 to 63;\n div16 = j / 16;\n select;\n when div16 = 0;\n f = %bitor(%bitand(b : c) : %bitand(%bitnot(b) : d));\n bufferIndex = j;\n\n when div16 = 1;\n f = %bitor(%bitand(b : d) : %bitand(c : %bitnot(d)));\n bufferIndex = %bitand(j * 5 + 1 : 15);\n\n when div16 = 2;\n f = %bitxor(b : %bitxor(c : d));\n bufferIndex = %bitand(j * 3 + 5 : 15);\n\n when div16 = 3;\n f = %bitxor(c : %bitor(b : Mask32Bit(%bitnot(d))));\n bufferIndex = %bitand(j * 7 : 15);\n endsl;\n tempInt = Mask32Bit(b + RotateLeft32Bit(a + f + buffer(bufferIndex + 1) + MD5_TABLE_T(j + 1) :\n SHIFT_AMTS(div16 * 4 + %bitand(j : 3) + 1)));\n a = d;\n d = c;\n c = b;\n b = tempInt;\n endfor;\n a = Mask32Bit(a + originalA);\n b = Mask32Bit(b + originalB);\n c = Mask32Bit(c + originalC);\n d = Mask32Bit(d + originalD);\n endfor;\n\n for i = 0 to 3;\n if i = 0;\n tempInt = a;\n elseif i = 1;\n tempInt = b;\n elseif i = 2;\n tempInt = c;\n else;\n tempInt = d;\n endif;\n\n for j = 0 to 3;\n byteToInt.n = %bitand(tempInt : 255);\n %subst(outputHash : i * 4 + j + 1 : 1) = byteToInt.c;\n tempInt /= 256;\n endfor;\n endfor;\n return;\nend-proc;\n\ndcl-proc MD5_FillPadding;\n dcl-pi *N;\n messageLen int(10);\n numBlocks int(10);\n padding char(72);\n end-pi;\n dcl-s totalLen int(10);\n dcl-s paddingSize int(10);\n dcl-ds *N;\n messageLenBits int(20);\n mlb_bytes char(8) OVERLAY(messageLenBits);\n end-ds;\n dcl-s i int(10);\n\n %subst(padding : 1 : 1) = X'80';\n totalLen = numBlocks * 64;\n paddingSize = totalLen - messageLen; // 9 to 72\n messageLenBits = messageLen;\n messageLenBits *= 8;\n for i = 1 to 8;\n %subst(padding : paddingSize - i + 1 : 1) = %subst(mlb_bytes : i : 1);\n endfor;\n for i = 2 to paddingSize - 8;\n %subst(padding : i : 1) = X'00';\n endfor;\n return;\nend-proc;\n\ndcl-proc RotateLeft32Bit;\n dcl-pi *N int(20);\n n int(20) value;\n amount int(3) value;\n end-pi;\n dcl-s i int(3);\n\n n = Mask32Bit(n);\n for i = 1 to amount;\n n *= 2;\n if n >= 4294967296;\n n -= MASK32;\n endif;\n endfor;\n return n;\nend-proc;\n\ndcl-proc Mask32Bit;\n dcl-pi *N int(20);\n n int(20) value;\n end-pi;\n return %bitand(n : MASK32);\nend-proc;\n\ndcl-proc ConvertToHex;\n dcl-pi *N;\n inputData char(32767) options(*VARSIZE) CONST;\n inputDataLen int(10) value;\n outputData char(65534) options(*VARSIZE);\n end-pi;\n dcl-c HEX_CHARS CONST('0123456789ABCDEF');\n dcl-s i int(10);\n dcl-s outputOffset int(10) INZ(1);\n dcl-ds dataStruct QUALIFIED;\n numField int(5) INZ(0);\n // IBM i is big-endian\n charField char(1) OVERLAY(numField : 2);\n end-ds;\n\n for i = 1 to inputDataLen;\n dataStruct.charField = %BitAnd(%subst(inputData : i : 1) : X'F0');\n dataStruct.numField /= 16;\n %subst(outputData : outputOffset : 1) = %subst(HEX_CHARS : dataStruct.numField + 1 : 1);\n outputOffset += 1;\n dataStruct.charField = %BitAnd(%subst(inputData : i : 1) : X'0F');\n %subst(outputData : outputOffset : 1) = %subst(HEX_CHARS : dataStruct.numField + 1 : 1);\n outputOffset += 1;\n endfor;\n return;\nend-proc;\n\n**CTDATA SHIFT_AMTS\n 7 12 17 22 5 9 14 20 4 11 16 23 6 10 15 21\n**CTDATA MD5_TABLE_T\n 3614090360 3905402710 606105819 3250441966\n 4118548399 1200080426 2821735955 4249261313\n 1770035416 2336552879 4294925233 2304563134\n 1804603682 4254626195 2792965006 1236535329\n 4129170786 3225465664 643717713 3921069994\n 3593408605 38016083 3634488961 3889429448\n 568446438 3275163606 4107603335 1163531501\n 2850285829 4243563512 1735328473 2368359562\n 4294588738 2272392833 1839030562 4259657740\n 2763975236 1272893353 4139469664 3200236656\n 681279174 3936430074 3572445317 76029189\n 3654602809 3873151461 530742520 3299628645\n 4096336452 1126891415 2878612391 4237533241\n 1700485571 2399980690 4293915773 2240044497\n 1873313359 4264355552 2734768916 1309151649\n 4149444226 3174756917 718787259 3951481745\n","language":"RPG"},{"code":"#![allow(non_snake_case)] // RFC 1321 uses many capitalized variables\nuse std::mem;\n\nfn md5(mut msg: Vec<u8>) -> (u32, u32, u32, u32) {\n let bitcount = msg.len().saturating_mul(8) as u64;\n\n // Step 1: Append Padding Bits\n msg.push(0b10000000);\n while (msg.len() * 8) % 512 != 448 {\n msg.push(0u8);\n }\n\n // Step 2. Append Length (64 bit integer)\n msg.extend(&[\n bitcount as u8,\n (bitcount >> 8) as u8,\n (bitcount >> 16) as u8,\n (bitcount >> 24) as u8,\n (bitcount >> 32) as u8,\n (bitcount >> 40) as u8,\n (bitcount >> 48) as u8,\n (bitcount >> 56) as u8,\n ]);\n\n // Step 3. Initialize MD Buffer\n /*A four-word buffer (A,B,C,D) is used to compute the message digest.\n Here each of A, B, C, D is a 32-bit register.*/\n let mut A = 0x67452301u32;\n let mut B = 0xefcdab89u32;\n let mut C = 0x98badcfeu32;\n let mut D = 0x10325476u32;\n\n // Step 4. Process Message in 16-Word Blocks\n /* We first define four auxiliary functions */\n let F = |X: u32, Y: u32, Z: u32| -> u32 { X & Y | !X & Z };\n let G = |X: u32, Y: u32, Z: u32| -> u32 { X & Z | Y & !Z };\n let H = |X: u32, Y: u32, Z: u32| -> u32 { X ^ Y ^ Z };\n let I = |X: u32, Y: u32, Z: u32| -> u32 { Y ^ (X | !Z) };\n\n /* This step uses a 64-element table T[1 ... 64] constructed from the sine function. */\n let T = [\n 0x00000000, // enable use as a 1-indexed table\n 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, 0xf57c0faf, 0x4787c62a, 0xa8304613,\n 0xfd469501, 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be, 0x6b901122, 0xfd987193,\n 0xa679438e, 0x49b40821, 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa, 0xd62f105d,\n 0x02441453, 0xd8a1e681, 0xe7d3fbc8, 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,\n 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a, 0xfffa3942, 0x8771f681, 0x6d9d6122,\n 0xfde5380c, 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70, 0x289b7ec6, 0xeaa127fa,\n 0xd4ef3085, 0x04881d05, 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665, 0xf4292244,\n 0x432aff97, 0xab9423a7, 0xfc93a039, 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,\n 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1, 0xf7537e82, 0xbd3af235, 0x2ad7d2bb,\n 0xeb86d391,\n ];\n\n /* Process each 16-word block. (since 1 word is 4 bytes, then 16 words is 64 bytes) */\n for mut block in msg.chunks_exact_mut(64) {\n /* Copy block into X. */\n #![allow(unused_mut)]\n let mut X = unsafe { mem::transmute::<&mut [u8], &mut [u32]>(&mut block) };\n #[cfg(target_endian = \"big\")]\n for j in 0..16 {\n X[j] = X[j].swap_bytes();\n }\n\n /* Save Registers A,B,C,D */\n let AA = A;\n let BB = B;\n let CC = C;\n let DD = D;\n\n /* Round 1. Let [abcd k s i] denote the operation\n a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */\n macro_rules! op1 {\n ($a:ident,$b:ident,$c:ident,$d:ident,$k:expr,$s:expr,$i:expr) => {\n $a = $b.wrapping_add(\n ($a.wrapping_add(F($b, $c, $d))\n .wrapping_add(X[$k])\n .wrapping_add(T[$i]))\n .rotate_left($s),\n )\n };\n }\n\n /* Do the following 16 operations. */\n op1!(A, B, C, D, 0, 7, 1);\n op1!(D, A, B, C, 1, 12, 2);\n op1!(C, D, A, B, 2, 17, 3);\n op1!(B, C, D, A, 3, 22, 4);\n\n op1!(A, B, C, D, 4, 7, 5);\n op1!(D, A, B, C, 5, 12, 6);\n op1!(C, D, A, B, 6, 17, 7);\n op1!(B, C, D, A, 7, 22, 8);\n\n op1!(A, B, C, D, 8, 7, 9);\n op1!(D, A, B, C, 9, 12, 10);\n op1!(C, D, A, B, 10, 17, 11);\n op1!(B, C, D, A, 11, 22, 12);\n\n op1!(A, B, C, D, 12, 7, 13);\n op1!(D, A, B, C, 13, 12, 14);\n op1!(C, D, A, B, 14, 17, 15);\n op1!(B, C, D, A, 15, 22, 16);\n\n /* Round 2. Let [abcd k s i] denote the operation\n a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */\n macro_rules! op2 {\n ($a:ident,$b:ident,$c:ident,$d:ident,$k:expr,$s:expr,$i:expr) => {\n $a = $b.wrapping_add(\n ($a.wrapping_add(G($b, $c, $d))\n .wrapping_add(X[$k])\n .wrapping_add(T[$i]))\n .rotate_left($s),\n )\n };\n }\n\n /* Do the following 16 operations. */\n op2!(A, B, C, D, 1, 5, 17);\n op2!(D, A, B, C, 6, 9, 18);\n op2!(C, D, A, B, 11, 14, 19);\n op2!(B, C, D, A, 0, 20, 20);\n\n op2!(A, B, C, D, 5, 5, 21);\n op2!(D, A, B, C, 10, 9, 22);\n op2!(C, D, A, B, 15, 14, 23);\n op2!(B, C, D, A, 4, 20, 24);\n\n op2!(A, B, C, D, 9, 5, 25);\n op2!(D, A, B, C, 14, 9, 26);\n op2!(C, D, A, B, 3, 14, 27);\n op2!(B, C, D, A, 8, 20, 28);\n\n op2!(A, B, C, D, 13, 5, 29);\n op2!(D, A, B, C, 2, 9, 30);\n op2!(C, D, A, B, 7, 14, 31);\n op2!(B, C, D, A, 12, 20, 32);\n\n /* Round 3. Let [abcd k s t] denote the operation\n a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */\n macro_rules! op3 {\n ($a:ident,$b:ident,$c:ident,$d:ident,$k:expr,$s:expr,$i:expr) => {\n $a = $b.wrapping_add(\n ($a.wrapping_add(H($b, $c, $d))\n .wrapping_add(X[$k])\n .wrapping_add(T[$i]))\n .rotate_left($s),\n )\n };\n }\n\n /* Do the following 16 operations. */\n op3!(A, B, C, D, 5, 4, 33);\n op3!(D, A, B, C, 8, 11, 34);\n op3!(C, D, A, B, 11, 16, 35);\n op3!(B, C, D, A, 14, 23, 36);\n\n op3!(A, B, C, D, 1, 4, 37);\n op3!(D, A, B, C, 4, 11, 38);\n op3!(C, D, A, B, 7, 16, 39);\n op3!(B, C, D, A, 10, 23, 40);\n\n op3!(A, B, C, D, 13, 4, 41);\n op3!(D, A, B, C, 0, 11, 42);\n op3!(C, D, A, B, 3, 16, 43);\n op3!(B, C, D, A, 6, 23, 44);\n\n op3!(A, B, C, D, 9, 4, 45);\n op3!(D, A, B, C, 12, 11, 46);\n op3!(C, D, A, B, 15, 16, 47);\n op3!(B, C, D, A, 2, 23, 48);\n\n /* Round 4. Let [abcd k s t] denote the operation\n a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */\n macro_rules! op4 {\n ($a:ident,$b:ident,$c:ident,$d:ident,$k:expr,$s:expr,$i:expr) => {\n $a = $b.wrapping_add(\n ($a.wrapping_add(I($b, $c, $d))\n .wrapping_add(X[$k])\n .wrapping_add(T[$i]))\n .rotate_left($s),\n )\n };\n }\n\n /* Do the following 16 operations. */\n op4!(A, B, C, D, 0, 6, 49);\n op4!(D, A, B, C, 7, 10, 50);\n op4!(C, D, A, B, 14, 15, 51);\n op4!(B, C, D, A, 5, 21, 52);\n\n op4!(A, B, C, D, 12, 6, 53);\n op4!(D, A, B, C, 3, 10, 54);\n op4!(C, D, A, B, 10, 15, 55);\n op4!(B, C, D, A, 1, 21, 56);\n\n op4!(A, B, C, D, 8, 6, 57);\n op4!(D, A, B, C, 15, 10, 58);\n op4!(C, D, A, B, 6, 15, 59);\n op4!(B, C, D, A, 13, 21, 60);\n\n op4!(A, B, C, D, 4, 6, 61);\n op4!(D, A, B, C, 11, 10, 62);\n op4!(C, D, A, B, 2, 15, 63);\n op4!(B, C, D, A, 9, 21, 64);\n\n /* . . . increment each of the four registers by the value\n it had before this block was started.) */\n\n A = A.wrapping_add(AA);\n B = B.wrapping_add(BB);\n C = C.wrapping_add(CC);\n D = D.wrapping_add(DD);\n }\n (\n A.swap_bytes(),\n B.swap_bytes(),\n C.swap_bytes(),\n D.swap_bytes(),\n )\n}\n\nfn md5_utf8(smsg: &str) -> String {\n let mut msg = vec![0u8; 0];\n msg.extend(smsg.as_bytes());\n let (A, B, C, D) = md5(msg);\n format!(\"{:08x}{:08x}{:08x}{:08x}\", A, B, C, D)\n}\n\nfn main() {\n assert!(md5_utf8(\"\") == \"d41d8cd98f00b204e9800998ecf8427e\");\n assert!(md5_utf8(\"a\") == \"0cc175b9c0f1b6a831c399e269772661\");\n assert!(md5_utf8(\"abc\") == \"900150983cd24fb0d6963f7d28e17f72\");\n assert!(md5_utf8(\"message digest\") == \"f96b697d7cb7938d525a2f31aaf161d0\");\n assert!(md5_utf8(\"abcdefghijklmnopqrstuvwxyz\") == \"c3fcd3d76192e4007dfb496cca67e13b\");\n assert!(md5_utf8(\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\") == \"d174ab98d277d9f5a5611c2c9f419d9f\");\n assert!(md5_utf8(\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\") == \"57edf4a22be3c955ac49da2e2107b67a\");\n}\n","language":"Rust"},{"code":"import java.lang.Math\n\nobject MD5 {\n private val INIT_A = 0x67452301\n private val INIT_B = 0xEFCDAB89\n private val INIT_C = 0x98BADCFE\n private val INIT_D = 0x10325476\n\n private val SHIFT_AMTS = Array(\n 7, 12, 17, 22,\n 5, 9, 14, 20,\n 4, 11, 16, 23,\n 6, 10, 15, 21\n )\n\n private val TABLE_T = Array.tabulate(64)(i => (Math.abs(Math.sin(i + 1)) * (1L << 32)).toLong.toInt)\n\n def computeMD5(message: Array[Byte]): Array[Byte] = {\n val messageLenBytes = message.length\n val numBlocks = ((messageLenBytes + 8) >>> 6) + 1\n val totalLen = numBlocks << 6\n val paddingBytes = Array.fill[Byte](totalLen - messageLenBytes)(0)\n paddingBytes(0) = 0x80.toByte\n\n var messageLenBits = messageLenBytes.toLong << 3\n for (i <- 0 until 8) {\n paddingBytes(paddingBytes.length - 8 + i) = messageLenBits.toByte\n messageLenBits >>>= 8\n }\n\n var a = INIT_A\n var b = INIT_B\n var c = INIT_C\n var d = INIT_D\n val buffer = new Array[Int](16)\n\n for (i <- 0 until numBlocks) {\n var index = i << 6\n for (j <- 0 until 64) {\n buffer(j >>> 2) = (((if (index < messageLenBytes) message(index) else paddingBytes(index - messageLenBytes)) << 24) | (buffer(j >>> 2) >>> 8)).toInt\n index += 1\n }\n val originalA = a\n val originalB = b\n val originalC = c\n val originalD = d\n\n for (j <- 0 until 64) {\n val div16 = j >>> 4\n val bufferIndex = j match {\n case j if j < 16 => j\n case j if j < 32 => (j * 5 + 1) & 0x0F\n case j if j < 48 => (j * 3 + 5) & 0x0F\n case j => (j * 7) & 0x0F\n }\n\n val f = div16 match {\n case 0 => (b & c) | (~b & d)\n case 1 => (b & d) | (c & ~d)\n case 2 => b ^ c ^ d\n case 3 => c ^ (b | ~d)\n }\n\n val temp = b + Integer.rotateLeft(a + f + buffer(bufferIndex) + TABLE_T(j), SHIFT_AMTS((div16 << 2) | (j & 3)))\n a = d\n d = c\n c = b\n b = temp\n }\n\n a += originalA\n b += originalB\n c += originalC\n d += originalD\n }\n\n val md5 = new Array[Byte](16)\n var count = 0\n for (i <- 0 until 4) {\n var n = i match {\n case 0 => a\n case 1 => b\n case 2 => c\n case 3 => d\n }\n for (j <- 0 until 4) {\n md5(count) = n.toByte\n n >>>= 8\n count += 1\n }\n }\n md5\n }\n\n def toHexString(b: Array[Byte]): String = b.map(byte => f\"$byte%02X\").mkString\n\n def main(args: Array[String]): Unit = {\n val testStrings = Array(\"\", \"a\", \"abc\", \"message digest\", \"abcdefghijklmnopqrstuvwxyz\", \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\", \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\")\n testStrings.foreach { s =>\n println(s\"0x${toHexString(computeMD5(s.getBytes))} <== \\\"$s\\\"\")\n }\n }\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n include \"bytedata.s7i\";\n include \"bin32.s7i\";\n include \"float.s7i\";\n include \"math.s7i\";\n\n# Use binary integer part of the sines of integers (Radians) as constants:\nconst func array integer: createMd5Table is func\n result\n var array integer: k is 64 times 0;\n local\n var integer: index is 0;\n begin\n for index range 1 to 64 do\n k[index] := trunc(abs(sin(flt(index))) * 2.0 ** 32);\n end for;\n end func;\n\nconst func string: md5 (in var string: message) is func\n result\n var string: digest is \"\";\n local\n # Specify the per-round shift amounts\n const array integer: shiftAmount is [] (\n 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21);\n const array integer: k is createMd5Table;\n var integer: length is 0;\n var integer: wordIndex is 1;\n var integer: index is 0;\n var array bin32: m is 16 times bin32.value;\n var integer: a0 is 16#67452301; # a\n var integer: b0 is 16#efcdab89; # b\n var integer: c0 is 16#98badcfe; # c\n var integer: d0 is 16#10325476; # d\n var bin32: a is bin32(0);\n var bin32: b is bin32(0);\n var bin32: c is bin32(0);\n var bin32: d is bin32(0);\n var bin32: f is bin32(0);\n var integer: g is 0;\n var bin32: temp is bin32(0);\n begin\n length := length(message);\n # Append the bit '1' to the message.\n message &:= '\\16#80;';\n # Append '0' bits, so that the resulting bit length is congruent to 448 (mod 512).\n message &:= \"\\0;\" mult 63 - (length + 8) mod 64;\n # Append length of message (before pre-processing), in bits, as 64-bit little-endian integer.\n message &:= bytes(8 * length, UNSIGNED, LE, 8);\n\n # Process the message in successive 512-bit chunks:\n while wordIndex <= length(message) do\n # Break chunk into sixteen 32-bit little-endian words.\n for index range 1 to 16 do\n m[index] := bin32(bytes2Int(message[wordIndex fixLen 4], UNSIGNED, LE));\n wordIndex +:= 4;\n end for;\n\n a := bin32(a0 mod 16#100000000);\n b := bin32(b0 mod 16#100000000);\n c := bin32(c0 mod 16#100000000);\n d := bin32(d0 mod 16#100000000);\n\n for index range 1 to 64 do\n if index <= 16 then\n f := d >< (b & (c >< d));\n g := index;\n elsif index <= 32 then\n f := c >< (d & (b >< c));\n g := succ((5 * index - 4) mod 16);\n elsif index <= 48 then\n f := b >< c >< d;\n g := succ((3 * index + 2) mod 16);\n else\n f := c >< (b | (bin32(16#ffffffff) >< d));\n g := succ((7 * pred(index)) mod 16);\n end if;\n\n temp := d;\n d := c;\n c := b;\n b := bin32((ord(b) +\n ord(rotLeft(bin32((ord(a) + ord(f) + k[index] + ord(m[g])) mod 16#100000000),\n shiftAmount[index]))) mod 16#100000000);\n a := temp;\n end for;\n\n # Add this chunk's hash to result so far:\n a0 +:= ord(a);\n b0 +:= ord(b);\n c0 +:= ord(c);\n d0 +:= ord(d);\n end while;\n\n # Produce the final hash value:\n digest := bytes(a0 mod 16#100000000, UNSIGNED, LE, 4) &\n bytes(b0 mod 16#100000000, UNSIGNED, LE, 4) &\n bytes(c0 mod 16#100000000, UNSIGNED, LE, 4) &\n bytes(d0 mod 16#100000000, UNSIGNED, LE, 4);\n end func;\n\nconst func boolean: checkMd5 (in string: message, in string: hexMd5) is\n return hex(md5(message)) = hexMd5;\n\nconst proc: main is func\n begin\n if checkMd5(\"\", \"d41d8cd98f00b204e9800998ecf8427e\") and\n checkMd5(\"a\", \"0cc175b9c0f1b6a831c399e269772661\") and\n checkMd5(\"abc\", \"900150983cd24fb0d6963f7d28e17f72\") and\n checkMd5(\"message digest\", \"f96b697d7cb7938d525a2f31aaf161d0\") and\n checkMd5(\"abcdefghijklmnopqrstuvwxyz\", \"c3fcd3d76192e4007dfb496cca67e13b\") and\n checkMd5(\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\", \"d174ab98d277d9f5a5611c2c9f419d9f\") and\n checkMd5(\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\", \"57edf4a22be3c955ac49da2e2107b67a\") then\n writeln(\"md5 is computed correct\");\n else\n writeln(\"There is an error in the md5 function\");\n end if;\n end func;\n","language":"Seed7"},{"code":"class MD5(String msg) {\n\n method init {\n msg = msg.bytes\n }\n\n const FGHI = [\n {|a,b,c| (a & b) | (~a & c) },\n {|a,b,c| (a & c) | (b & ~c) },\n {|a,b,c| (a ^ b ^ c) },\n {|a,b,c| (b ^ (a | ~c)) },\n ]\n\n const S = [\n [7, 12, 17, 22] * 4,\n [5, 9, 14, 20] * 4,\n [4, 11, 16, 23] * 4,\n [6, 10, 15, 21] * 4,\n ].flat\n\n const T = 64.of {|i| floor(abs(sin(i+1)) * 1<<32) }\n\n const K = [\n ^16 -> map {|n| n },\n ^16 -> map {|n| (5*n + 1) % 16 },\n ^16 -> map {|n| (3*n + 5) % 16 },\n ^16 -> map {|n| (7*n ) % 16 },\n ].flat\n\n func radix(Number b, Array a) {\n ^a -> sum {|i| b**i * a[i] }\n }\n\n func little_endian(Number w, Number n, Array v) {\n var step1 = (^n »*» w)\n var step2 = (v ~X>> step1)\n step2 »%» (1 << w)\n }\n\n func block(Number a, Number b) { (a + b) & 0xffffffff }\n func srble(Number a, Number n) { (a << n) & 0xffffffff | (a >> (32-n)) }\n\n func md5_pad(msg) {\n var bits = 8*msg.len\n var padded = [msg..., 128, [0] * (-(floor(bits / 8) + 1 + 8) % 64)].flat\n\n gather {\n padded.each_slice(4, {|*a|\n take(radix(256, a))\n })\n take(little_endian(32, 2, [bits]))\n }.flat\n }\n\n func md5_block(Array H, Array X) {\n var (A, B, C, D) = H...\n\n for i in ^64 {\n (A, B, C, D) = (D,\n block(B, srble(\n block(\n block(\n block(A, FGHI[floor(i / 16)](B, C, D)), T[i]\n ), X[K[i]]\n ), S[i])\n ), B, C)\n }\n\n for k,v in ([A, B, C, D].kv) {\n H[k] = block(H[k], v)\n }\n\n return H\n }\n\n method md5_hex {\n self.md5.map {|n| '%02x' % n }.join\n }\n\n method md5 {\n var M = md5_pad(msg)\n var H = [0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476]\n\n for i in (range(0, M.end, 16)) {\n md5_block(H, M.slice(i).first(16))\n }\n\n little_endian(8, 4, H)\n }\n}\n\nvar tests = [\n ['d41d8cd98f00b204e9800998ecf8427e', ''],\n ['0cc175b9c0f1b6a831c399e269772661', 'a'],\n ['900150983cd24fb0d6963f7d28e17f72', 'abc'],\n ['f96b697d7cb7938d525a2f31aaf161d0', 'message digest'],\n ['c3fcd3d76192e4007dfb496cca67e13b', 'abcdefghijklmnopqrstuvwxyz'],\n ['d174ab98d277d9f5a5611c2c9f419d9f', 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'],\n ['57edf4a22be3c955ac49da2e2107b67a', '12345678901234567890123456789012345678901234567890123456789012345678901234567890'],\n]\n\nfor md5,msg in tests {\n var hash = MD5(msg).md5_hex\n say \"#{hash} : #{msg}\"\n\n if (hash != md5) {\n say \"\\tHowever, that is incorrect (expected: #{md5})\"\n }\n}\n","language":"Sidef"},{"code":" import Foundation\n public class MD5 {\n /** specifies the per-round shift amounts */\n private let s: [UInt32] = [7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21]\n\n /** binary integer part of the sines of integers (Radians) */\n private let K: [UInt32] = (0 ..< 64).map { UInt32(0x100000000 * abs(sin(Double($0 + 1)))) }\n\n let a0: UInt32 = 0x67452301\n let b0: UInt32 = 0xefcdab89\n let c0: UInt32 = 0x98badcfe\n let d0: UInt32 = 0x10325476\n\n private var message: NSData\n\n //MARK: Public\n\n public init(_ message: NSData) {\n self.message = message\n }\n\n public func calculate() -> NSData? {\n var tmpMessage: NSMutableData = NSMutableData(data: message)\n let wordSize = sizeof(UInt32)\n\n var aa = a0\n var bb = b0\n var cc = c0\n var dd = d0\n\n // Step 1. Append Padding Bits\n tmpMessage.appendBytes([0x80]) // append one bit (Byte with one bit) to message\n\n // append \"0\" bit until message length in bits ≡ 448 (mod 512)\n while tmpMessage.length % 64 != 56 {\n tmpMessage.appendBytes([0x00])\n }\n\n // Step 2. Append Length a 64-bit representation of lengthInBits\n var lengthInBits = (message.length * 8)\n var lengthBytes = lengthInBits.bytes(64 / 8)\n tmpMessage.appendBytes(reverse(lengthBytes));\n\n // Process the message in successive 512-bit chunks:\n let chunkSizeBytes = 512 / 8\n var leftMessageBytes = tmpMessage.length\n for var i = 0; i < tmpMessage.length; i = i + chunkSizeBytes, leftMessageBytes -= chunkSizeBytes {\n let chunk = tmpMessage.subdataWithRange(NSRange(location: i, length: min(chunkSizeBytes,leftMessageBytes)))\n\n // break chunk into sixteen 32-bit words M[j], 0 ≤ j ≤ 15\n // println(\"wordSize \\(wordSize)\");\n var M:[UInt32] = [UInt32](count: 16, repeatedValue: 0)\n for x in 0..<M.count {\n var range = NSRange(location:x * wordSize, length: wordSize)\n chunk.getBytes(&M[x], range:range);\n }\n\n // Initialize hash value for this chunk:\n var A:UInt32 = a0\n var B:UInt32 = b0\n var C:UInt32 = c0\n var D:UInt32 = d0\n\n var dTemp:UInt32 = 0\n\n // Main loop\n for j in 0...63 {\n var g = 0\n var F:UInt32 = 0\n\n switch (j) {\n case 0...15:\n F = (B & C) | ((~B) & D)\n g = j\n break\n case 16...31:\n F = (D & B) | (~D & C)\n g = (5 * j + 1) % 16\n break\n case 32...47:\n F = B ^ C ^ D\n g = (3 * j + 5) % 16\n break\n case 48...63:\n F = C ^ (B | (~D))\n g = (7 * j) % 16\n break\n default:\n break\n }\n dTemp = D\n D = C\n C = B\n B = B &+ rotateLeft((A &+ F &+ K[j] &+ M[g]), s[j])\n A = dTemp\n }\n\n aa = aa &+ A\n bb = bb &+ B\n cc = cc &+ C\n dd = dd &+ D\n }\n\n var buf: NSMutableData = NSMutableData();\n buf.appendBytes(&aa, length: wordSize)\n buf.appendBytes(&bb, length: wordSize)\n buf.appendBytes(&cc, length: wordSize)\n buf.appendBytes(&dd, length: wordSize)\n\n return buf.copy() as? NSData;\n }\n\n //MARK: Class\n class func calculate(message: NSData) -> NSData?\n {\n return MD5(message).calculate();\n }\n\n //MARK: Private\n private func rotateLeft(x:UInt32, _ n:UInt32) -> UInt32 {\n return (x &<< n) | (x &>> (32 - n))\n }\n }\n","language":"Swift"},{"code":"import Foundation\n\nlet shift : [UInt32] = [7, 12, 17, 22, 5, 9, 14, 20, 4, 11, 16, 23, 6, 10, 15, 21]\nlet table: [UInt32] = (0 ..< 64).map { UInt32(0x100000000 * abs(sin(Double($0 + 1)))) }\n\nfunc md5(var message: [UInt8]) -> [UInt8] {\n var messageLenBits = UInt64(message.count) * 8\n message.append(0x80)\n while message.count % 64 != 56 {\n message.append(0)\n }\n\n var lengthBytes = [UInt8](count: 8, repeatedValue: 0)\n UnsafeMutablePointer<UInt64>(lengthBytes).memory = messageLenBits.littleEndian\n message += lengthBytes\n\n var a : UInt32 = 0x67452301\n var b : UInt32 = 0xEFCDAB89\n var c : UInt32 = 0x98BADCFE\n var d : UInt32 = 0x10325476\n for chunkOffset in stride(from: 0, to: message.count, by: 64) {\n let chunk = UnsafePointer<UInt32>(UnsafePointer<UInt8>(message) + chunkOffset)\n let originalA = a\n let originalB = b\n let originalC = c\n let originalD = d\n for j in 0 ..< 64 {\n var f : UInt32 = 0\n var bufferIndex = j\n let round = j >> 4\n switch round {\n case 0:\n f = (b & c) | (~b & d)\n case 1:\n f = (b & d) | (c & ~d)\n bufferIndex = (bufferIndex*5 + 1) & 0x0F\n case 2:\n f = b ^ c ^ d\n bufferIndex = (bufferIndex*3 + 5) & 0x0F\n case 3:\n f = c ^ (b | ~d)\n bufferIndex = (bufferIndex * 7) & 0x0F\n default:\n assert(false)\n }\n let sa = shift[(round<<2)|(j&3)]\n let tmp = a &+ f &+ UInt32(littleEndian: chunk[bufferIndex]) &+ table[j]\n a = d\n d = c\n c = b\n b = b &+ (tmp << sa | tmp >> (32-sa))\n }\n a = a &+ originalA\n b = b &+ originalB\n c = c &+ originalC\n d = d &+ originalD\n }\n\n var result = [UInt8](count: 16, repeatedValue: 0)\n for (i, n) in enumerate([a, b, c, d]) {\n UnsafeMutablePointer<UInt32>(result)[i] = n.littleEndian\n }\n return result\n}\n\nfunc toHexString(bytes: [UInt8]) -> String {\n return \"\".join(bytes.map { String(format:\"%02x\", $0) })\n}\n\nfor (hashCode, string) in [\n (\"d41d8cd98f00b204e9800998ecf8427e\", \"\"),\n (\"0cc175b9c0f1b6a831c399e269772661\", \"a\"),\n (\"900150983cd24fb0d6963f7d28e17f72\", \"abc\"),\n (\"f96b697d7cb7938d525a2f31aaf161d0\", \"message digest\"),\n (\"c3fcd3d76192e4007dfb496cca67e13b\", \"abcdefghijklmnopqrstuvwxyz\"),\n (\"d174ab98d277d9f5a5611c2c9f419d9f\",\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"),\n (\"57edf4a22be3c955ac49da2e2107b67a\", \"12345678901234567890\" +\n \"123456789012345678901234567890123456789012345678901234567890\")] {\n println(hashCode)\n println(toHexString(md5(Array(string.utf8))))\n println()\n}\n","language":"Swift"},{"code":"# We just define the body of md5::md5 here; later we regsub to inline a few\n# function calls for speed\nvariable ::md5::md5body {\n ### Step 1. Append Padding Bits\n\n set msgLen [string length $msg]\n\n set padLen [expr {56 - $msgLen%64}]\n if {$msgLen % 64 > 56} {\n\tincr padLen 64\n }\n\n # pad even if no padding required\n if {$padLen == 0} {\n\tincr padLen 64\n }\n\n # append single 1b followed by 0b's\n append msg [binary format \"a$padLen\" \\200]\n\n ### Step 2. Append Length\n\n # RFC doesn't say whether to use little- or big-endian; code demonstrates\n # little-endian.\n # This step limits our input to size 2^32b or 2^24B\n append msg [binary format \"i1i1\" [expr {8*$msgLen}] 0]\n\n ### Step 3. Initialize MD Buffer\n\n set A [expr 0x67452301]\n set B [expr 0xefcdab89]\n set C [expr 0x98badcfe]\n set D [expr 0x10325476]\n\n ### Step 4. Process Message in 16-Word Blocks\n\n # process each 16-word block\n # RFC doesn't say whether to use little- or big-endian; code says\n # little-endian.\n binary scan $msg i* blocks\n\n # loop over the message taking 16 blocks at a time\n\n foreach {X0 X1 X2 X3 X4 X5 X6 X7 X8 X9 X10 X11 X12 X13 X14 X15} $blocks {\n\t# Save A as AA, B as BB, C as CC, and D as DD.\n\tset AA $A\n\tset BB $B\n\tset CC $C\n\tset DD $D\n\n\t# Round 1.\n\t# Let [abcd k s i] denote the operation\n\t# a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s).\n\t# [ABCD 0 7 1] [DABC 1 12 2] [CDAB 2 17 3] [BCDA 3 22 4]\n\tset A [expr {$B + [<<< [expr {$A + [F $B $C $D] + $X0 + $T01}] 7]}]\n\tset D [expr {$A + [<<< [expr {$D + [F $A $B $C] + $X1 + $T02}] 12]}]\n\tset C [expr {$D + [<<< [expr {$C + [F $D $A $B] + $X2 + $T03}] 17]}]\n\tset B [expr {$C + [<<< [expr {$B + [F $C $D $A] + $X3 + $T04}] 22]}]\n\t# [ABCD 4 7 5] [DABC 5 12 6] [CDAB 6 17 7] [BCDA 7 22 8]\n\tset A [expr {$B + [<<< [expr {$A + [F $B $C $D] + $X4 + $T05}] 7]}]\n\tset D [expr {$A + [<<< [expr {$D + [F $A $B $C] + $X5 + $T06}] 12]}]\n\tset C [expr {$D + [<<< [expr {$C + [F $D $A $B] + $X6 + $T07}] 17]}]\n\tset B [expr {$C + [<<< [expr {$B + [F $C $D $A] + $X7 + $T08}] 22]}]\n\t# [ABCD 8 7 9] [DABC 9 12 10] [CDAB 10 17 11] [BCDA 11 22 12]\n\tset A [expr {$B + [<<< [expr {$A + [F $B $C $D] + $X8 + $T09}] 7]}]\n\tset D [expr {$A + [<<< [expr {$D + [F $A $B $C] + $X9 + $T10}] 12]}]\n\tset C [expr {$D + [<<< [expr {$C + [F $D $A $B] + $X10 + $T11}] 17]}]\n\tset B [expr {$C + [<<< [expr {$B + [F $C $D $A] + $X11 + $T12}] 22]}]\n\t# [ABCD 12 7 13] [DABC 13 12 14] [CDAB 14 17 15] [BCDA 15 22 16]\n\tset A [expr {$B + [<<< [expr {$A + [F $B $C $D] + $X12 + $T13}] 7]}]\n\tset D [expr {$A + [<<< [expr {$D + [F $A $B $C] + $X13 + $T14}] 12]}]\n\tset C [expr {$D + [<<< [expr {$C + [F $D $A $B] + $X14 + $T15}] 17]}]\n\tset B [expr {$C + [<<< [expr {$B + [F $C $D $A] + $X15 + $T16}] 22]}]\n\n\t# Round 2.\n\t# Let [abcd k s i] denote the operation\n\t# a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s).\n\t# Do the following 16 operations.\n\t# [ABCD 1 5 17] [DABC 6 9 18] [CDAB 11 14 19] [BCDA 0 20 20]\n\tset A [expr {$B + [<<< [expr {$A + [G $B $C $D] + $X1 + $T17}] 5]}]\n\tset D [expr {$A + [<<< [expr {$D + [G $A $B $C] + $X6 + $T18}] 9]}]\n\tset C [expr {$D + [<<< [expr {$C + [G $D $A $B] + $X11 + $T19}] 14]}]\n\tset B [expr {$C + [<<< [expr {$B + [G $C $D $A] + $X0 + $T20}] 20]}]\n\t# [ABCD 5 5 21] [DABC 10 9 22] [CDAB 15 14 23] [BCDA 4 20 24]\n\tset A [expr {$B + [<<< [expr {$A + [G $B $C $D] + $X5 + $T21}] 5]}]\n\tset D [expr {$A + [<<< [expr {$D + [G $A $B $C] + $X10 + $T22}] 9]}]\n\tset C [expr {$D + [<<< [expr {$C + [G $D $A $B] + $X15 + $T23}] 14]}]\n\tset B [expr {$C + [<<< [expr {$B + [G $C $D $A] + $X4 + $T24}] 20]}]\n\t# [ABCD 9 5 25] [DABC 14 9 26] [CDAB 3 14 27] [BCDA 8 20 28]\n\tset A [expr {$B + [<<< [expr {$A + [G $B $C $D] + $X9 + $T25}] 5]}]\n\tset D [expr {$A + [<<< [expr {$D + [G $A $B $C] + $X14 + $T26}] 9]}]\n\tset C [expr {$D + [<<< [expr {$C + [G $D $A $B] + $X3 + $T27}] 14]}]\n\tset B [expr {$C + [<<< [expr {$B + [G $C $D $A] + $X8 + $T28}] 20]}]\n\t# [ABCD 13 5 29] [DABC 2 9 30] [CDAB 7 14 31] [BCDA 12 20 32]\n\tset A [expr {$B + [<<< [expr {$A + [G $B $C $D] + $X13 + $T29}] 5]}]\n\tset D [expr {$A + [<<< [expr {$D + [G $A $B $C] + $X2 + $T30}] 9]}]\n\tset C [expr {$D + [<<< [expr {$C + [G $D $A $B] + $X7 + $T31}] 14]}]\n\tset B [expr {$C + [<<< [expr {$B + [G $C $D $A] + $X12 + $T32}] 20]}]\n\n\t# Round 3.\n\t# Let [abcd k s t] [sic] denote the operation\n\t# a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s).\n\t# Do the following 16 operations.\n\t# [ABCD 5 4 33] [DABC 8 11 34] [CDAB 11 16 35] [BCDA 14 23 36]\n\tset A [expr {$B + [<<< [expr {$A + [H $B $C $D] + $X5 + $T33}] 4]}]\n\tset D [expr {$A + [<<< [expr {$D + [H $A $B $C] + $X8 + $T34}] 11]}]\n\tset C [expr {$D + [<<< [expr {$C + [H $D $A $B] + $X11 + $T35}] 16]}]\n\tset B [expr {$C + [<<< [expr {$B + [H $C $D $A] + $X14 + $T36}] 23]}]\n\t# [ABCD 1 4 37] [DABC 4 11 38] [CDAB 7 16 39] [BCDA 10 23 40]\n\tset A [expr {$B + [<<< [expr {$A + [H $B $C $D] + $X1 + $T37}] 4]}]\n\tset D [expr {$A + [<<< [expr {$D + [H $A $B $C] + $X4 + $T38}] 11]}]\n\tset C [expr {$D + [<<< [expr {$C + [H $D $A $B] + $X7 + $T39}] 16]}]\n\tset B [expr {$C + [<<< [expr {$B + [H $C $D $A] + $X10 + $T40}] 23]}]\n\t# [ABCD 13 4 41] [DABC 0 11 42] [CDAB 3 16 43] [BCDA 6 23 44]\n\tset A [expr {$B + [<<< [expr {$A + [H $B $C $D] + $X13 + $T41}] 4]}]\n\tset D [expr {$A + [<<< [expr {$D + [H $A $B $C] + $X0 + $T42}] 11]}]\n\tset C [expr {$D + [<<< [expr {$C + [H $D $A $B] + $X3 + $T43}] 16]}]\n\tset B [expr {$C + [<<< [expr {$B + [H $C $D $A] + $X6 + $T44}] 23]}]\n\t# [ABCD 9 4 45] [DABC 12 11 46] [CDAB 15 16 47] [BCDA 2 23 48]\n\tset A [expr {$B + [<<< [expr {$A + [H $B $C $D] + $X9 + $T45}] 4]}]\n\tset D [expr {$A + [<<< [expr {$D + [H $A $B $C] + $X12 + $T46}] 11]}]\n\tset C [expr {$D + [<<< [expr {$C + [H $D $A $B] + $X15 + $T47}] 16]}]\n\tset B [expr {$C + [<<< [expr {$B + [H $C $D $A] + $X2 + $T48}] 23]}]\n\n\t# Round 4.\n\t# Let [abcd k s t] [sic] denote the operation\n\t# a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s).\n\t# Do the following 16 operations.\n\t# [ABCD 0 6 49] [DABC 7 10 50] [CDAB 14 15 51] [BCDA 5 21 52]\n\tset A [expr {$B + [<<< [expr {$A + [I $B $C $D] + $X0 + $T49}] 6]}]\n\tset D [expr {$A + [<<< [expr {$D + [I $A $B $C] + $X7 + $T50}] 10]}]\n\tset C [expr {$D + [<<< [expr {$C + [I $D $A $B] + $X14 + $T51}] 15]}]\n\tset B [expr {$C + [<<< [expr {$B + [I $C $D $A] + $X5 + $T52}] 21]}]\n\t# [ABCD 12 6 53] [DABC 3 10 54] [CDAB 10 15 55] [BCDA 1 21 56]\n\tset A [expr {$B + [<<< [expr {$A + [I $B $C $D] + $X12 + $T53}] 6]}]\n\tset D [expr {$A + [<<< [expr {$D + [I $A $B $C] + $X3 + $T54}] 10]}]\n\tset C [expr {$D + [<<< [expr {$C + [I $D $A $B] + $X10 + $T55}] 15]}]\n\tset B [expr {$C + [<<< [expr {$B + [I $C $D $A] + $X1 + $T56}] 21]}]\n\t# [ABCD 8 6 57] [DABC 15 10 58] [CDAB 6 15 59] [BCDA 13 21 60]\n\tset A [expr {$B + [<<< [expr {$A + [I $B $C $D] + $X8 + $T57}] 6]}]\n\tset D [expr {$A + [<<< [expr {$D + [I $A $B $C] + $X15 + $T58}] 10]}]\n\tset C [expr {$D + [<<< [expr {$C + [I $D $A $B] + $X6 + $T59}] 15]}]\n\tset B [expr {$C + [<<< [expr {$B + [I $C $D $A] + $X13 + $T60}] 21]}]\n\t# [ABCD 4 6 61] [DABC 11 10 62] [CDAB 2 15 63] [BCDA 9 21 64]\n\tset A [expr {$B + [<<< [expr {$A + [I $B $C $D] + $X4 + $T61}] 6]}]\n\tset D [expr {$A + [<<< [expr {$D + [I $A $B $C] + $X11 + $T62}] 10]}]\n\tset C [expr {$D + [<<< [expr {$C + [I $D $A $B] + $X2 + $T63}] 15]}]\n\tset B [expr {$C + [<<< [expr {$B + [I $C $D $A] + $X9 + $T64}] 21]}]\n\n\t# Then perform the following additions. (That is increment each of the\n\t# four registers by the value it had before this block was started.)\n\tincr A $AA\n\tincr B $BB\n\tincr C $CC\n\tincr D $DD\n }\n\n ### Step 5. Output\n\n # ... begin with the low-order byte of A, and end with the high-order byte\n # of D.\n\n return [bytes $A][bytes $B][bytes $C][bytes $D]\n}\n\n### Here we inline/regsub the functions F, G, H, I and <<<\n\nnamespace eval ::md5 {\n #proc md5pure::F {x y z} {expr {(($x & $y) | ((~$x) & $z))}}\n regsub -all -- {\\[ *F +(\\$.) +(\\$.) +(\\$.) *\\]} $md5body {((\\1 \\& \\2) | ((~\\1) \\& \\3))} md5body\n\n #proc md5pure::G {x y z} {expr {(($x & $z) | ($y & (~$z)))}}\n regsub -all -- {\\[ *G +(\\$.) +(\\$.) +(\\$.) *\\]} $md5body {((\\1 \\& \\3) | (\\2 \\& (~\\3)))} md5body\n\n #proc md5pure::H {x y z} {expr {$x ^ $y ^ $z}}\n regsub -all -- {\\[ *H +(\\$.) +(\\$.) +(\\$.) *\\]} $md5body {(\\1 ^ \\2 ^ \\3)} md5body\n\n #proc md5pure::I {x y z} {expr {$y ^ ($x | (~$z))}}\n regsub -all -- {\\[ *I +(\\$.) +(\\$.) +(\\$.) *\\]} $md5body {(\\2 ^ (\\1 | (~\\3)))} md5body\n\n # inline <<< (bitwise left-rotate)\n regsub -all -- {\\[ *<<< +\\[ *expr +({[^\\}]*})\\] +([0-9]+) *\\]} $md5body {(([set x [expr \\1]] << \\2) | (($x >> R\\2) \\& S\\2))} md5body\n\n # now replace the R and S\n variable map {}\n variable i\n foreach i {\n\t7 12 17 22\n\t5 9 14 20\n\t4 11 16 23\n\t6 10 15 21\n } {\n\tlappend map R$i [expr {32 - $i}] S$i [expr {0x7fffffff >> (31-$i)}]\n }\n\n # inline the values of T\n variable tName\n variable tVal\n foreach tName {\n\tT01 T02 T03 T04 T05 T06 T07 T08 T09 T10\n\tT11 T12 T13 T14 T15 T16 T17 T18 T19 T20\n\tT21 T22 T23 T24 T25 T26 T27 T28 T29 T30\n\tT31 T32 T33 T34 T35 T36 T37 T38 T39 T40\n\tT41 T42 T43 T44 T45 T46 T47 T48 T49 T50\n\tT51 T52 T53 T54 T55 T56 T57 T58 T59 T60\n\tT61 T62 T63 T64\n } tVal {\n\t0xd76aa478 0xe8c7b756 0x242070db 0xc1bdceee\n\t0xf57c0faf 0x4787c62a 0xa8304613 0xfd469501\n\t0x698098d8 0x8b44f7af 0xffff5bb1 0x895cd7be\n\t0x6b901122 0xfd987193 0xa679438e 0x49b40821\n\n\t0xf61e2562 0xc040b340 0x265e5a51 0xe9b6c7aa\n\t0xd62f105d 0x2441453 0xd8a1e681 0xe7d3fbc8\n\t0x21e1cde6 0xc33707d6 0xf4d50d87 0x455a14ed\n\t0xa9e3e905 0xfcefa3f8 0x676f02d9 0x8d2a4c8a\n\n\t0xfffa3942 0x8771f681 0x6d9d6122 0xfde5380c\n\t0xa4beea44 0x4bdecfa9 0xf6bb4b60 0xbebfbc70\n\t0x289b7ec6 0xeaa127fa 0xd4ef3085 0x4881d05\n\t0xd9d4d039 0xe6db99e5 0x1fa27cf8 0xc4ac5665\n\n\t0xf4292244 0x432aff97 0xab9423a7 0xfc93a039\n\t0x655b59c3 0x8f0ccc92 0xffeff47d 0x85845dd1\n\t0x6fa87e4f 0xfe2ce6e0 0xa3014314 0x4e0811a1\n\t0xf7537e82 0xbd3af235 0x2ad7d2bb 0xeb86d391\n } {\n\tlappend map \\$$tName $tVal\n }\n set md5body [string map $map $md5body]\n\n # Finally, define the proc\n proc md5 {msg} $md5body\n\n # unset auxiliary variables\n unset md5body tName tVal map\n\n proc byte0 {i} {expr {0xff & $i}}\n proc byte1 {i} {expr {(0xff00 & $i) >> 8}}\n proc byte2 {i} {expr {(0xff0000 & $i) >> 16}}\n proc byte3 {i} {expr {((0xff000000 & $i) >> 24) & 0xff}}\n proc bytes {i} {\n format %0.2x%0.2x%0.2x%0.2x [byte0 $i] [byte1 $i] [byte2 $i] [byte3 $i]\n }\n}\n","language":"Tcl"},{"code":"foreach {hash <- string} {\n 0xd41d8cd98f00b204e9800998ecf8427e ==> \"\"\n 0x0cc175b9c0f1b6a831c399e269772661 ==> \"a\"\n 0x900150983cd24fb0d6963f7d28e17f72 ==> \"abc\"\n 0xf96b697d7cb7938d525a2f31aaf161d0 ==> \"message digest\"\n 0xc3fcd3d76192e4007dfb496cca67e13b ==> \"abcdefghijklmnopqrstuvwxyz\"\n 0xd174ab98d277d9f5a5611c2c9f419d9f ==> \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\"\n 0x57edf4a22be3c955ac49da2e2107b67a ==> \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"\n} {\n puts \"“$string” -> [md5::md5 $string] (officially: $hash)\"\n}\n","language":"Tcl"},{"code":"import \"./fmt\" for Fmt\n\nvar k = [\n 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee ,\n 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501 ,\n 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be ,\n 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821 ,\n 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa ,\n 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8 ,\n 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed ,\n 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a ,\n 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c ,\n 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70 ,\n 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05 ,\n 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665 ,\n 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039 ,\n 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1 ,\n 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1 ,\n 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391\n]\n\nvar r = [\n 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21\n]\n\nvar leftRotate = Fn.new { |x, c| (x << c) | (x >> (32 - c)) }\n\nvar toBytes = Fn.new { |val|\n var bytes = List.filled(4, 0)\n bytes[0] = val & 255\n bytes[1] = (val >> 8) & 255\n bytes[2] = (val >> 16) & 255\n bytes[3] = (val >> 24) & 255\n return bytes\n}\n\nvar toInt = Fn.new { |bytes| bytes[0] | bytes[1] << 8 | bytes[2] << 16 | bytes[3] << 24 }\n\nvar md5 = Fn.new { |initMsg|\n var h0 = 0x67452301\n var h1 = 0xefcdab89\n var h2 = 0x98badcfe\n var h3 = 0x10325476\n var initBytes = initMsg.bytes\n var initLen = initBytes.count\n var newLen = initLen + 1\n while (newLen % 64 != 56) newLen = newLen + 1\n var msg = List.filled(newLen + 8, 0)\n for (i in 0...initLen) msg[i] = initBytes[i]\n msg[initLen] = 0x80 // remaining bytes already 0\n var lenBits = toBytes.call(initLen * 8)\n for (i in newLen...newLen+4) msg[i] = lenBits[i-newLen]\n var extraBits = toBytes.call(initLen >> 29)\n for (i in newLen+4...newLen+8) msg[i] = extraBits[i-newLen-4]\n var offset = 0\n var w = List.filled(16, 0)\n while (offset < newLen) {\n for (i in 0...16) w[i] = toInt.call(msg[offset+i*4...offset + i*4 + 4])\n var a = h0\n var b = h1\n var c = h2\n var d = h3\n var f\n var g\n for (i in 0...64) {\n if (i < 16) {\n f = (b & c) | ((~b) & d)\n g = i\n } else if (i < 32) {\n f = (d & b) | ((~d) & c)\n g = (5*i + 1) % 16\n } else if (i < 48) {\n f = b ^ c ^ d\n g = (3*i + 5) % 16\n } else {\n f = c ^ (b | (~d))\n g = (7*i) % 16\n }\n var temp = d\n d = c\n c = b\n b = b + leftRotate.call((a + f + k[i] + w[g]), r[i])\n a = temp\n }\n h0 = h0 + a\n h1 = h1 + b\n h2 = h2 + c\n h3 = h3 + d\n offset = offset + 64\n }\n var digest = List.filled(16, 0)\n var dBytes = toBytes.call(h0)\n for (i in 0...4) digest[i] = dBytes[i]\n dBytes = toBytes.call(h1)\n for (i in 0...4) digest[i+4] = dBytes[i]\n dBytes = toBytes.call(h2)\n for (i in 0...4) digest[i+8] = dBytes[i]\n dBytes = toBytes.call(h3)\n for (i in 0...4) digest[i+12] = dBytes[i]\n return digest\n}\n\nvar strings = [\n \"\",\n \"a\",\n \"abc\",\n \"message digest\",\n \"abcdefghijklmnopqrstuvwxyz\",\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\",\n \"12345678901234567890123456789012345678901234567890123456789012345678901234567890\"\n]\n\nfor (s in strings) {\n var digest = md5.call(s)\n Fmt.print(\"0x$s <== '$0s'\", Fmt.v(\"xz\", 2, digest, 0, \"\", \"\"), s)\n}\n","language":"Wren"},{"code":"section .text\norg 0x100\n\tmov\tdi, md5_for_display\n\tmov\tsi, test_input_1\n\tmov\tcx, test_input_1_len\n\tcall\tcompute_md5\n\tcall\tdisplay_md5\n\tmov\tsi, test_input_2\n\tmov\tcx, test_input_2_len\n\tcall\tcompute_md5\n\tcall\tdisplay_md5\n\tmov\tsi, test_input_3\n\tmov\tcx, test_input_3_len\n\tcall\tcompute_md5\n\tcall\tdisplay_md5\n\tmov\tsi, test_input_4\n\tmov\tcx, test_input_4_len\n\tcall\tcompute_md5\n\tcall\tdisplay_md5\n\tmov\tsi, test_input_5\n\tmov\tcx, test_input_5_len\n\tcall\tcompute_md5\n\tcall\tdisplay_md5\n\tmov\tsi, test_input_6\n\tmov\tcx, test_input_6_len\n\tcall\tcompute_md5\n\tcall\tdisplay_md5\n\tmov\tsi, test_input_7\n\tmov\tcx, test_input_7_len\n\tcall\tcompute_md5\n\tcall\tdisplay_md5\n\tmov\tax, 0x4c00\n\tint\t21h\n\nmd5_for_display times 16 db 0\nHEX_CHARS db '0123456789ABCDEF'\n\ndisplay_md5:\n\tmov\tah, 9\n\tmov\tdx, display_str_1\n\tint\t0x21\n\tpush\tcx\n\tpush\tsi\n\tmov\tcx, 16\n\tmov\tsi, di\n\txor\tbx, bx\n.loop:\n\tlodsb\n\tmov\tbl, al\n\tand\tbl, 0x0F\n\tpush\tbx\n\tmov\tbl, al\n\tshr\tbx, 4\n\tmov\tah, 2\n\tmov\tdl, [HEX_CHARS + bx]\n\tint\t0x21\n\tpop\tbx\n\tmov\tdl, [HEX_CHARS + bx]\n\tint\t0x21\n\tdec\tcx\n\tjnz\t.loop\n\tmov\tah, 9\n\tmov\tdx, display_str_2\n\tint\t0x21\n\tpop\tsi\n\tpop\tcx\n\ttest\tcx, cx\n\tjz\tdo_newline\n\tmov\tah, 2\ndisplay_string:\n\tlodsb\n\tmov\tdl, al\n\tint\t0x21\n\tdec\tcx\n\tjnz\tdisplay_string\ndo_newline:\n\tmov\tah, 9\n\tmov\tdx, display_str_3\n\tint\t0x21\n\tret;\n\ncompute_md5:\n\t; si --> input bytes, cx = input len, di --> 16-byte output buffer\n\t; assumes all in the same segment\n\tcld\n\tpusha\n\tpush\tdi\n\tpush\tsi\n\tmov\t[message_len], cx\n\n\tmov\tbx, cx\n\tshr\tbx, 6\n\tmov\t[ending_bytes_block_num], bx\n\tmov\t[num_blocks], bx\n\tinc\tword [num_blocks]\n\tshl\tbx, 6\n\tadd\tsi, bx\n\tand\tcx, 0x3f\n\tpush\tcx\n\tmov\tdi, ending_bytes\n\trep\tmovsb\n\tmov\tal, 0x80\n\tstosb\n\tpop\tcx\n\tsub\tcx, 55\n\tneg\tcx\n\tjge\tadd_padding\n\tadd\tcx, 64\n\tinc\tword [num_blocks]\nadd_padding:\n\tmov\tal, 0\n\trep\tstosb\n\txor\teax, eax\n\tmov\tax, [message_len]\n\tshl\teax, 3\n\tmov\tcx, 8\nstore_message_len:\n\tstosb\n\tshr\teax, 8\n\tdec\tcx\n\tjnz\tstore_message_len\n\tpop\tsi\n\tmov\t[md5_a], dword INIT_A\n\tmov\t[md5_b], dword INIT_B\n\tmov\t[md5_c], dword INIT_C\n\tmov\t[md5_d], dword INIT_D\nblock_loop:\n\tpush\tcx\n\tcmp\tcx, [ending_bytes_block_num]\n\tjne\tbackup_abcd\n\t; switch buffers if towards the end where padding needed\n\tmov\tsi, ending_bytes\nbackup_abcd:\n\tpush\tdword [md5_d]\n\tpush\tdword [md5_c]\n\tpush\tdword [md5_b]\n\tpush\tdword [md5_a]\n\txor\tcx, cx\n\txor\teax, eax\nmain_loop:\n\tpush\tcx\n\tmov\tax, cx\n\tshr\tax, 4\n\ttest\tal, al\n\tjz\tpass0\n\tcmp\tal, 1\n\tje\tpass1\n\tcmp\tal, 2\n\tje\tpass2\n\t; pass3\n\tmov\teax, [md5_c]\n\tmov\tebx, [md5_d]\n\tnot\tebx\n\tor\tebx, [md5_b]\n\txor\teax, ebx\n\tjmp\tdo_rotate\n\npass0:\n\tmov\teax, [md5_b]\n\tmov\tebx, eax\n\tand\teax, [md5_c]\n\tnot\tebx\n\tand\tebx, [md5_d]\n\tor\teax, ebx\n\tjmp\tdo_rotate\n\npass1:\n\tmov\teax, [md5_d]\n\tmov\tedx, eax\n\tand\teax, [md5_b]\n\tnot\tedx\n\tand\tedx, [md5_c]\n\tor\teax, edx\n\tjmp\tdo_rotate\n\npass2:\n\tmov\teax, [md5_b]\n\txor\teax, [md5_c]\n\txor\teax, [md5_d]\ndo_rotate:\n\tadd\teax, [md5_a]\n\tmov\tbx, cx\n\tshl\tbx, 1\n\tmov\tbx, [BUFFER_INDEX_TABLE + bx]\n\tadd\teax, [si + bx]\n\tmov\tbx, cx\n\tshl\tbx, 2\n\tadd\teax, dword [TABLE_T + bx]\n\tmov\tbx, cx\n\tror\tbx, 2\n\tshr\tbl, 2\n\trol\tbx, 2\n\tmov\tcl, [SHIFT_AMTS + bx]\n\trol\teax, cl\n\tadd\teax, [md5_b]\n\tpush\teax\n\tpush\tdword [md5_b]\n\tpush\tdword [md5_c]\n\tpush\tdword [md5_d]\n\tpop\tdword [md5_a]\n\tpop\tdword [md5_d]\n\tpop\tdword [md5_c]\n\tpop\tdword [md5_b]\n\tpop\tcx\n\tinc\tcx\n\tcmp\tcx, 64\n\tjb\tmain_loop\n\t; add to original values\n\tpop\teax\n\tadd\t[md5_a], eax\n\tpop\teax\n\tadd\t[md5_b], eax\n\tpop\teax\n\tadd\t[md5_c], eax\n\tpop\teax\n\tadd\t[md5_d], eax\n\t; advance pointers\n\tadd\tsi, 64\n\tpop\tcx\n\tinc\tcx\n\tcmp\tcx, [num_blocks]\n\tjne\tblock_loop\n\tmov\tcx, 4\n\tmov\tsi, md5_a\n\tpop\tdi\n\trep\tmovsd\n\tpopa\n\tret\n\nsection .data\n\nINIT_A equ 0x67452301\nINIT_B equ 0xEFCDAB89\nINIT_C equ 0x98BADCFE\nINIT_D equ 0x10325476\n\nSHIFT_AMTS db 7, 12, 17, 22, 5, 9, 14, 20, 4, 11, 16, 23, 6, 10, 15, 21\n\nTABLE_T dd 0xD76AA478, 0xE8C7B756, 0x242070DB, 0xC1BDCEEE, 0xF57C0FAF, 0x4787C62A, 0xA8304613, 0xFD469501, 0x698098D8, 0x8B44F7AF, 0xFFFF5BB1, 0x895CD7BE, 0x6B901122, 0xFD987193, 0xA679438E, 0x49B40821, 0xF61E2562, 0xC040B340, 0x265E5A51, 0xE9B6C7AA, 0xD62F105D, 0x02441453, 0xD8A1E681, 0xE7D3FBC8, 0x21E1CDE6, 0xC33707D6, 0xF4D50D87, 0x455A14ED, 0xA9E3E905, 0xFCEFA3F8, 0x676F02D9, 0x8D2A4C8A, 0xFFFA3942, 0x8771F681, 0x6D9D6122, 0xFDE5380C, 0xA4BEEA44, 0x4BDECFA9, 0xF6BB4B60, 0xBEBFBC70, 0x289B7EC6, 0xEAA127FA, 0xD4EF3085, 0x04881D05, 0xD9D4D039, 0xE6DB99E5, 0x1FA27CF8, 0xC4AC5665, 0xF4292244, 0x432AFF97, 0xAB9423A7, 0xFC93A039, 0x655B59C3, 0x8F0CCC92, 0xFFEFF47D, 0x85845DD1, 0x6FA87E4F, 0xFE2CE6E0, 0xA3014314, 0x4E0811A1, 0xF7537E82, 0xBD3AF235, 0x2AD7D2BB, 0xEB86D391\nBUFFER_INDEX_TABLE dw 0, 4, 8, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52, 56, 60, 4, 24, 44, 0, 20, 40, 60, 16, 36, 56, 12, 32, 52, 8, 28, 48, 20, 32, 44, 56, 4, 16, 28, 40, 52, 0, 12, 24, 36, 48, 60, 8, 0, 28, 56, 20, 48, 12, 40, 4, 32, 60, 24, 52, 16, 44, 8, 36\nending_bytes_block_num dw 0\nending_bytes times 128 db 0\nmessage_len dw 0\nnum_blocks dw 0\nmd5_a dd 0\nmd5_b dd 0\nmd5_c dd 0\nmd5_d dd 0\n\ndisplay_str_1 db '0x$'\ndisplay_str_2 db ' <== \"$'\ndisplay_str_3 db '\"', 13, 10, '$'\n\ntest_input_1:\ntest_input_1_len equ $ - test_input_1\ntest_input_2 db 'a'\ntest_input_2_len equ $ - test_input_2\ntest_input_3 db 'abc'\ntest_input_3_len equ $ - test_input_3\ntest_input_4 db 'message digest'\ntest_input_4_len equ $ - test_input_4\ntest_input_5 db 'abcdefghijklmnopqrstuvwxyz'\ntest_input_5_len equ $ - test_input_5\ntest_input_6 db 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'\ntest_input_6_len equ $ - test_input_6\ntest_input_7 db '12345678901234567890123456789012345678901234567890123456789012345678901234567890'\ntest_input_7_len equ $ - test_input_7\n","language":"X86-Assembly"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/MD5/Implementation\\nnote: Checksums\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"The purpose of this task to code and validate an implementation of the MD5 Message Digest Algorithm by coding the algorithm directly (not using a call to a built-in or external hashing library). For details of the algorithm refer to [[wp:Md5#Algorithm|MD5 on Wikipedia]] or the [http://www.ietf.org/rfc/rfc1321.txt MD5 definition in IETF RFC (1321)]. \\n\\n* The implementation needs to implement the key functionality namely producing a correct message digest for an input string. It is not necessary to mimic all of the calling modes such as adding to a digest one block at a time over subsequent calls. \\n* In addition to coding and verifying your implementation, note any challenges your language presented implementing the solution, implementation choices made, or limitations of your solution. \\n* Solutions on this page should implement MD5 directly and NOT use built in (MD5) functions, call outs to operating system calls or library routines written in other languages as is common in the original [[MD5]] task.\\n* The following are acceptable:\\n** An original implementation from the specification, reference implementation, or pseudo-code\\n** A translation of a correct implementation from another language\\n** A library routine in the same language; however, the source must be included here.\\n\\n\\nThe solutions shown here will provide practical illustrations of bit manipulation, unsigned integers, working with little-endian data. Additionally, the task requires an attention to details such as boundary conditions since being out by even 1 bit will produce dramatically different results. Subtle implementation bugs can result in some hashes being correct while others are wrong. Not only is it critical to get the individual sub functions working correctly, even small errors in padding, endianness, or data layout will result in failure.\\n\\nThe following verification strings and hashes come from RFC 1321:<pre> hash code <== string \\n 0xd41d8cd98f00b204e9800998ecf8427e <== \\\"\\\" \\n 0x0cc175b9c0f1b6a831c399e269772661 <== \\\"a\\\"\\n 0x900150983cd24fb0d6963f7d28e17f72 <== \\\"abc\\\"\\n 0xf96b697d7cb7938d525a2f31aaf161d0 <== \\\"message digest\\\"\\n 0xc3fcd3d76192e4007dfb496cca67e13b <== \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n 0xd174ab98d277d9f5a5611c2c9f419d9f <== \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"\\n 0x57edf4a22be3c955ac49da2e2107b67a <== \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"</pre>\\n\\nIn addition, intermediate outputs to aid in developing an implementation can be found [[MD5/Implementation Debug|here]].\\n\\nThe MD5 Message-Digest Algorithm was developed by [[wp:RSA_SecurityRSA|RSA Data Security, Inc.]] in 1991.\\n\\n{{alertbox|#ffff70|'''<big>Warning</big>'''<br/>Rosetta Code is '''not''' a place you should rely on for examples of code in critical roles, including security.<br/>Also, note that MD5 has been ''broken'' and should not be used in applications requiring security. For these consider [[wp:SHA2|SHA2]] or the upcoming [[wp:SHA3|SHA3]].}}\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"-V\\n rotate_amounts = [7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21]\\n\\n constants = (0.<64).map(i -> UInt32(UInt64(abs(sin(i + 1)) * 2.0 ^ 32) [&] FFFF'FFFF))\\n\\n init_values = (UInt32(6745'2301), UInt32(EFCD'AB89), UInt32(98BA'DCFE), UInt32(1032'5476))\\n\\n[((UInt32, UInt32, UInt32) -> UInt32)] functions\\nfunctions [+]= (b, c, d) -> (b [&] c) [|] (~b [&] d)\\nfunctions [+]= (b, c, d) -> (d [&] b) [|] (~d [&] c)\\nfunctions [+]= (b, c, d) -> b (+) c (+) d\\nfunctions [+]= (b, c, d) -> c (+) (b [|] ~d)\\n\\n[(Int -> Int)] index_functions\\nindex_functions [+]= i -> i\\nindex_functions [+]= i -> (5 * i + 1) % 16\\nindex_functions [+]= i -> (3 * i + 5) % 16\\nindex_functions [+]= i -> (7 * i) % 16\\n\\nF md5(=message)\\n V orig_len_in_bits = UInt64(8) * message.len\\n message.append(8'0)\\n L message.len % 64 != 56\\n message.append(0)\\n message.extend(bytes_from_int(orig_len_in_bits))\\n\\n V hash_pieces = init_values\\n\\n L(chunk_ofst) (0 .< message.len).step(64)\\n V (a, b, c, d) = hash_pieces\\n V chunk = message[chunk_ofst .+ 64]\\n L(i) 64\\n V f = :functions[i I/ 16](b, c, d)\\n V g = :index_functions[i I/ 16](i)\\n V to_rotate = a + f + :constants[i] + UInt32(bytes' chunk[4 * g .+ 4])\\n V new_b = UInt32(b + rotl(to_rotate, :rotate_amounts[i]))\\n (a, b, c, d) = (d, new_b, b, c)\\n L(val) (a, b, c, d)\\n hash_pieces[L.index] += val\\n\\n [Byte] r\\n L(x) hash_pieces\\n r.extend([x [&] F'F, (x >> 8) [&] F'F, (x >> 16) [&] F'F, (x >> 24) [&] F'F])\\n R r\\n\\nF md5_to_hex(digest)\\n V s = ‘’\\n L(d) digest\\n s ‘’= hex(d).lowercase().zfill(2)\\n R s\\n\\nV demo = [Bytes(‘’), Bytes(‘a’), Bytes(‘abc’), Bytes(‘message digest’), Bytes(‘abcdefghijklmnopqrstuvwxyz’),\\n Bytes(‘ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789’),\\n Bytes(‘12345678901234567890123456789012345678901234567890123456789012345678901234567890’)]\\nL(message) demo\\n print(md5_to_hex(md5(message))‘ <= \\\"’message.decode(‘ascii’)‘\\\"’)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"package MD5 is\\n\\n type Int32 is mod 2 ** 32;\\n type MD5_Hash is array (1 .. 4) of Int32;\\n function MD5 (Input : String) return MD5_Hash;\\n\\n -- 32 hexadecimal characters + '0x' prefix\\n subtype MD5_String is String (1 .. 34);\\n function To_String (Item : MD5_Hash) return MD5_String;\\n\\nend MD5;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Unchecked_Conversion;\\n\\npackage body MD5 is\\n type Int32_Array is array (Positive range <>) of Int32;\\n\\n function Rotate_Left (Value : Int32; Count : Int32) return Int32 is\\n Bit : Boolean;\\n Result : Int32 := Value;\\n begin\\n for I in 1 .. Count loop\\n Bit := (2 ** 31 and Result) = 2 ** 31;\\n Result := Result * 2;\\n if Bit then\\n Result := Result + 1;\\n end if;\\n end loop;\\n return Result;\\n end Rotate_Left;\\n\\n function Pad_String (Item : String) return Int32_Array is\\n -- always pad positive amount of Bytes\\n Padding_Bytes : Positive := 64 - Item'Length mod 64;\\n subtype String4 is String (1 .. 4);\\n function String4_To_Int32 is new Ada.Unchecked_Conversion\\n (Source => String4,\\n Target => Int32);\\n begin\\n if Padding_Bytes <= 2 then\\n Padding_Bytes := Padding_Bytes + 64;\\n end if;\\n declare\\n Result : Int32_Array (1 .. (Item'Length + Padding_Bytes) / 4);\\n Current_Index : Positive := 1;\\n begin\\n for I in 1 .. Item'Length / 4 loop\\n Result (I) :=\\n String4_To_Int32 (Item (4 * (I - 1) + 1 .. 4 * I));\\n Current_Index := Current_Index + 1;\\n end loop;\\n\\n declare\\n Last_String : String4 := (others => Character'Val (0));\\n Chars_Left : constant Natural := Item'Length mod 4;\\n begin\\n Last_String (1 .. Chars_Left) :=\\n Item (Item'Last - Chars_Left + 1 .. Item'Last);\\n Last_String (Chars_Left + 1) := Character'Val (2#1000_0000#);\\n Result (Current_Index) := String4_To_Int32 (Last_String);\\n Current_Index := Current_Index + 1;\\n end;\\n\\n Result (Current_Index .. Result'Last) := (others => 0);\\n -- append length as bit count\\n Result (Result'Last - 1) := Item'Length * 2 ** 3; -- mod 2 ** 32;\\n Result (Result'Last) := Item'Length / 2 ** (32 - 3);\\n return Result;\\n end;\\n end Pad_String;\\n\\n function Turn_Around (X : Int32) return Int32 is\\n Result : Int32 := 0;\\n begin\\n for Byte in 1 .. 4 loop\\n Result := Result * 16#100#;\\n Result := Result + (X / (2 ** (8 * (Byte - 1)))) mod 16#100#;\\n end loop;\\n return Result;\\n end Turn_Around;\\n\\n function MD5 (Input : String) return MD5_Hash is\\n function F (X, Y, Z : Int32) return Int32 is\\n begin\\n return Z xor (X and (Y xor Z));\\n end F;\\n function G (X, Y, Z : Int32) return Int32 is\\n begin\\n return (X and Z) or (Y and (not Z));\\n end G;\\n function H (X, Y, Z : Int32) return Int32 is\\n begin\\n return X xor Y xor Z;\\n end H;\\n function I (X, Y, Z : Int32) return Int32 is\\n begin\\n return Y xor (X or (not Z));\\n end I;\\n T : constant Int32_Array :=\\n (16#d76aa478#, 16#e8c7b756#, 16#242070db#, 16#c1bdceee#,\\n 16#f57c0faf#, 16#4787c62a#, 16#a8304613#, 16#fd469501#,\\n 16#698098d8#, 16#8b44f7af#, 16#ffff5bb1#, 16#895cd7be#,\\n 16#6b901122#, 16#fd987193#, 16#a679438e#, 16#49b40821#,\\n 16#f61e2562#, 16#c040b340#, 16#265e5a51#, 16#e9b6c7aa#,\\n 16#d62f105d#, 16#02441453#, 16#d8a1e681#, 16#e7d3fbc8#,\\n 16#21e1cde6#, 16#c33707d6#, 16#f4d50d87#, 16#455a14ed#,\\n 16#a9e3e905#, 16#fcefa3f8#, 16#676f02d9#, 16#8d2a4c8a#,\\n 16#fffa3942#, 16#8771f681#, 16#6d9d6122#, 16#fde5380c#,\\n 16#a4beea44#, 16#4bdecfa9#, 16#f6bb4b60#, 16#bebfbc70#,\\n 16#289b7ec6#, 16#eaa127fa#, 16#d4ef3085#, 16#04881d05#,\\n 16#d9d4d039#, 16#e6db99e5#, 16#1fa27cf8#, 16#c4ac5665#,\\n 16#f4292244#, 16#432aff97#, 16#ab9423a7#, 16#fc93a039#,\\n 16#655b59c3#, 16#8f0ccc92#, 16#ffeff47d#, 16#85845dd1#,\\n 16#6fa87e4f#, 16#fe2ce6e0#, 16#a3014314#, 16#4e0811a1#,\\n 16#f7537e82#, 16#bd3af235#, 16#2ad7d2bb#, 16#eb86d391#);\\n A : Int32 := 16#67452301#;\\n B : Int32 := 16#EFCDAB89#;\\n C : Int32 := 16#98BADCFE#;\\n D : Int32 := 16#10325476#;\\n Padded_String : constant Int32_Array := Pad_String (Input);\\n begin\\n for Block512 in 1 .. Padded_String'Length / 16 loop\\n declare\\n Words : constant Int32_Array (1 .. 16) :=\\n Padded_String (16 * (Block512 - 1) + 1 .. 16 * Block512);\\n AA : constant Int32 := A;\\n BB : constant Int32 := B;\\n CC : constant Int32 := C;\\n DD : constant Int32 := D;\\n begin\\n -- round 1\\n A := B + Rotate_Left ((A + F (B, C, D) + Words (1) + T (1)), 7);\\n D := A + Rotate_Left ((D + F (A, B, C) + Words (2) + T (2)), 12);\\n C := D + Rotate_Left ((C + F (D, A, B) + Words (3) + T (3)), 17);\\n B := C + Rotate_Left ((B + F (C, D, A) + Words (4) + T (4)), 22);\\n A := B + Rotate_Left ((A + F (B, C, D) + Words (5) + T (5)), 7);\\n D := A + Rotate_Left ((D + F (A, B, C) + Words (6) + T (6)), 12);\\n C := D + Rotate_Left ((C + F (D, A, B) + Words (7) + T (7)), 17);\\n B := C + Rotate_Left ((B + F (C, D, A) + Words (8) + T (8)), 22);\\n A := B + Rotate_Left ((A + F (B, C, D) + Words (9) + T (9)), 7);\\n D := A + Rotate_Left ((D + F (A, B, C) + Words (10) + T (10)), 12);\\n C := D + Rotate_Left ((C + F (D, A, B) + Words (11) + T (11)), 17);\\n B := C + Rotate_Left ((B + F (C, D, A) + Words (12) + T (12)), 22);\\n A := B + Rotate_Left ((A + F (B, C, D) + Words (13) + T (13)), 7);\\n D := A + Rotate_Left ((D + F (A, B, C) + Words (14) + T (14)), 12);\\n C := D + Rotate_Left ((C + F (D, A, B) + Words (15) + T (15)), 17);\\n B := C + Rotate_Left ((B + F (C, D, A) + Words (16) + T (16)), 22);\\n -- round 2\\n A := B + Rotate_Left ((A + G (B, C, D) + Words (2) + T (17)), 5);\\n D := A + Rotate_Left ((D + G (A, B, C) + Words (7) + T (18)), 9);\\n C := D + Rotate_Left ((C + G (D, A, B) + Words (12) + T (19)), 14);\\n B := C + Rotate_Left ((B + G (C, D, A) + Words (1) + T (20)), 20);\\n A := B + Rotate_Left ((A + G (B, C, D) + Words (6) + T (21)), 5);\\n D := A + Rotate_Left ((D + G (A, B, C) + Words (11) + T (22)), 9);\\n C := D + Rotate_Left ((C + G (D, A, B) + Words (16) + T (23)), 14);\\n B := C + Rotate_Left ((B + G (C, D, A) + Words (5) + T (24)), 20);\\n A := B + Rotate_Left ((A + G (B, C, D) + Words (10) + T (25)), 5);\\n D := A + Rotate_Left ((D + G (A, B, C) + Words (15) + T (26)), 9);\\n C := D + Rotate_Left ((C + G (D, A, B) + Words (4) + T (27)), 14);\\n B := C + Rotate_Left ((B + G (C, D, A) + Words (9) + T (28)), 20);\\n A := B + Rotate_Left ((A + G (B, C, D) + Words (14) + T (29)), 5);\\n D := A + Rotate_Left ((D + G (A, B, C) + Words (3) + T (30)), 9);\\n C := D + Rotate_Left ((C + G (D, A, B) + Words (8) + T (31)), 14);\\n B := C + Rotate_Left ((B + G (C, D, A) + Words (13) + T (32)), 20);\\n -- round 3\\n A := B + Rotate_Left ((A + H (B, C, D) + Words (6) + T (33)), 4);\\n D := A + Rotate_Left ((D + H (A, B, C) + Words (9) + T (34)), 11);\\n C := D + Rotate_Left ((C + H (D, A, B) + Words (12) + T (35)), 16);\\n B := C + Rotate_Left ((B + H (C, D, A) + Words (15) + T (36)), 23);\\n A := B + Rotate_Left ((A + H (B, C, D) + Words (2) + T (37)), 4);\\n D := A + Rotate_Left ((D + H (A, B, C) + Words (5) + T (38)), 11);\\n C := D + Rotate_Left ((C + H (D, A, B) + Words (8) + T (39)), 16);\\n B := C + Rotate_Left ((B + H (C, D, A) + Words (11) + T (40)), 23);\\n A := B + Rotate_Left ((A + H (B, C, D) + Words (14) + T (41)), 4);\\n D := A + Rotate_Left ((D + H (A, B, C) + Words (1) + T (42)), 11);\\n C := D + Rotate_Left ((C + H (D, A, B) + Words (4) + T (43)), 16);\\n B := C + Rotate_Left ((B + H (C, D, A) + Words (7) + T (44)), 23);\\n A := B + Rotate_Left ((A + H (B, C, D) + Words (10) + T (45)), 4);\\n D := A + Rotate_Left ((D + H (A, B, C) + Words (13) + T (46)), 11);\\n C := D + Rotate_Left ((C + H (D, A, B) + Words (16) + T (47)), 16);\\n B := C + Rotate_Left ((B + H (C, D, A) + Words (3) + T (48)), 23);\\n -- round 4\\n A := B + Rotate_Left ((A + I (B, C, D) + Words (1) + T (49)), 6);\\n D := A + Rotate_Left ((D + I (A, B, C) + Words (8) + T (50)), 10);\\n C := D + Rotate_Left ((C + I (D, A, B) + Words (15) + T (51)), 15);\\n B := C + Rotate_Left ((B + I (C, D, A) + Words (6) + T (52)), 21);\\n A := B + Rotate_Left ((A + I (B, C, D) + Words (13) + T (53)), 6);\\n D := A + Rotate_Left ((D + I (A, B, C) + Words (4) + T (54)), 10);\\n C := D + Rotate_Left ((C + I (D, A, B) + Words (11) + T (55)), 15);\\n B := C + Rotate_Left ((B + I (C, D, A) + Words (2) + T (56)), 21);\\n A := B + Rotate_Left ((A + I (B, C, D) + Words (9) + T (57)), 6);\\n D := A + Rotate_Left ((D + I (A, B, C) + Words (16) + T (58)), 10);\\n C := D + Rotate_Left ((C + I (D, A, B) + Words (7) + T (59)), 15);\\n B := C + Rotate_Left ((B + I (C, D, A) + Words (14) + T (60)), 21);\\n A := B + Rotate_Left ((A + I (B, C, D) + Words (5) + T (61)), 6);\\n D := A + Rotate_Left ((D + I (A, B, C) + Words (12) + T (62)), 10);\\n C := D + Rotate_Left ((C + I (D, A, B) + Words (3) + T (63)), 15);\\n B := C + Rotate_Left ((B + I (C, D, A) + Words (10) + T (64)), 21);\\n -- increment\\n A := A + AA;\\n B := B + BB;\\n C := C + CC;\\n D := D + DD;\\n end;\\n end loop;\\n return\\n (Turn_Around (A),\\n Turn_Around (B),\\n Turn_Around (C),\\n Turn_Around (D));\\n end MD5;\\n\\n function To_String (Item : MD5_Hash) return MD5_String is\\n Hex_Chars : constant array (0 .. 15) of Character :=\\n ('0', '1', '2', '3', '4', '5', '6', '7',\\n '8', '9', 'a', 'b', 'c', 'd', 'e', 'f');\\n Result : MD5_String := (1 => '0',\\n 2 => 'x',\\n others => '0');\\n Temp : Int32;\\n Position : Natural := Result'Last;\\n begin\\n for Part in reverse Item'Range loop\\n Temp := Item (Part);\\n while Position > Result'Last - (5 - Part) * 8 loop\\n Result (Position) := Hex_Chars (Natural (Temp mod 16));\\n Position := Position - 1;\\n Temp := Temp / 16;\\n end loop;\\n end loop;\\n return Result;\\n end To_String;\\n\\nend MD5;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Strings.Unbounded;\\nwith Ada.Text_IO;\\nwith MD5;\\n\\nprocedure Tester is\\n use Ada.Strings.Unbounded;\\n type String_Array is array (Positive range <>) of Unbounded_String;\\n Sources : constant String_Array :=\\n (To_Unbounded_String (\\\"\\\"),\\n To_Unbounded_String (\\\"a\\\"),\\n To_Unbounded_String (\\\"abc\\\"),\\n To_Unbounded_String (\\\"message digest\\\"),\\n To_Unbounded_String (\\\"abcdefghijklmnopqrstuvwxyz\\\"),\\n To_Unbounded_String\\n (\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"),\\n To_Unbounded_String\\n (\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\")\\n );\\n Digests : constant String_Array :=\\n (To_Unbounded_String (\\\"0xd41d8cd98f00b204e9800998ecf8427e\\\"),\\n To_Unbounded_String (\\\"0x0cc175b9c0f1b6a831c399e269772661\\\"),\\n To_Unbounded_String (\\\"0x900150983cd24fb0d6963f7d28e17f72\\\"),\\n To_Unbounded_String (\\\"0xf96b697d7cb7938d525a2f31aaf161d0\\\"),\\n To_Unbounded_String (\\\"0xc3fcd3d76192e4007dfb496cca67e13b\\\"),\\n To_Unbounded_String (\\\"0xd174ab98d277d9f5a5611c2c9f419d9f\\\"),\\n To_Unbounded_String (\\\"0x57edf4a22be3c955ac49da2e2107b67a\\\"));\\nbegin\\n for I in Sources'Range loop\\n Ada.Text_IO.Put_Line (\\\"MD5 (\\\"\\\"\\\" & To_String (Sources (I)) & \\\"\\\"\\\"):\\\");\\n Ada.Text_IO.Put_Line\\n (MD5.To_String (MD5.MD5 (To_String (Sources (I)))));\\n Ada.Text_IO.Put_Line (To_String (Digests (I)) & \\\" (correct value)\\\");\\n end loop;\\nend Tester;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \" PRINT FN_MD5(\\\"\\\")\\n PRINT FN_MD5(\\\"a\\\")\\n PRINT FN_MD5(\\\"abc\\\")\\n PRINT FN_MD5(\\\"message digest\\\")\\n PRINT FN_MD5(\\\"abcdefghijklmnopqrstuvwxyz\\\")\\n PRINT FN_MD5(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\")\\n PRINT FN_MD5(STRING$(8,\\\"1234567890\\\"))\\n END\\n\\n DEF FN_MD5(message$)\\n LOCAL a%, b%, c%, d%, f%, g%, h0%, h1%, h2%, h3%, i%, bits%, chunk%, temp%\\n LOCAL r&(), k%(), w%()\\n DIM r&(63), k%(63), w%(15)\\n\\n REM r specifies the per-round shift amounts:\\n r&() = 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, \\\\\\n \\\\ 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, \\\\\\n \\\\ 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, \\\\\\n \\\\ 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21\\n\\n REM Use binary integer part of the sines of integers (Radians) as constants:\\n FOR i% = 0 TO 63\\n k%(i%) = FN32(INT(ABS(SIN(i% + 1.0#)) * 2^32))\\n NEXT\\n\\n REM Initialize variables:\\n h0% = &67452301\\n h1% = &EFCDAB89\\n h2% = &98BADCFE\\n h3% = &10325476\\n\\n bits% = LEN(message$)*8\\n\\n REM Append '1' bit to message:\\n message$ += CHR$&80\\n\\n REM Append '0' bits until message length in bits = 448 (mod 512):\\n WHILE (LEN(message$) MOD 64) <> 56\\n message$ += CHR$0\\n ENDWHILE\\n\\n REM Append length of message (before pre-processing), in bits, as\\n REM 64-bit little-endian integer:\\n FOR i% = 0 TO 56 STEP 8\\n message$ += CHR$(bits% >>> i%)\\n NEXT\\n\\n REM Process the message in successive 512-bit chunks:\\n FOR chunk% = 0 TO LEN(message$) DIV 64 - 1\\n\\n REM Break chunk into sixteen 32-bit little-endian words:\\n FOR i% = 0 TO 15\\n w%(i%) = !(PTR(message$) + 64*chunk% + 4*i%)\\n NEXT i%\\n\\n REM Initialize hash value for this chunk:\\n a% = h0%\\n b% = h1%\\n c% = h2%\\n d% = h3%\\n\\n REM Main loop:\\n FOR i% = 0 TO 63\\n CASE TRUE OF\\n WHEN i% <= 15:\\n f% = d% EOR (b% AND (c% EOR d%))\\n g% = i%\\n WHEN 16 <= i% AND i% <= 31:\\n f% = c% EOR (d% AND (b% EOR c%))\\n g% = (5 * i% + 1) MOD 16\\n WHEN 32 <= i% AND i% <= 47:\\n f% = b% EOR c% EOR d%\\n g% = (3 * i% + 5) MOD 16\\n OTHERWISE:\\n f% = c% EOR (b% OR (NOT d%))\\n g% = (7 * i%) MOD 16\\n ENDCASE\\n\\n temp% = d%\\n d% = c%\\n c% = b%\\n b% = FN32(b% + FNlrot(FN32(a% + f%) + FN32(k%(i%) + w%(g%)), r&(i%)))\\n a% = temp%\\n\\n NEXT i%\\n\\n REM Add this chunk's hash to result so far:\\n h0% = FN32(h0% + a%)\\n h1% = FN32(h1% + b%)\\n h2% = FN32(h2% + c%)\\n h3% = FN32(h3% + d%)\\n\\n NEXT chunk%\\n\\n = FNrevhex(h0%) + FNrevhex(h1%) + FNrevhex(h2%) + FNrevhex(h3%)\\n\\n DEF FNrevhex(A%)\\n SWAP ?(^A%+0),?(^A%+3)\\n SWAP ?(^A%+1),?(^A%+2)\\n = RIGHT$(\\\"0000000\\\"+STR$~A%,8)\\n\\n DEF FNlrot(n#, r%)\\n n# = FN32(n#)\\n = (n# << r%) OR (n# >>> (32 - r%))\\n\\n DEF FN32(n#)\\n WHILE n# > &7FFFFFFF : n# -= 2^32 : ENDWHILE\\n WHILE n# < &80000000 : n# += 2^32 : ENDWHILE\\n = n#\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"\\t/// Represent digest with ABCD\\n\\tsealed public class Digest\\n\\t{\\n\\t\\tpublic uint A;\\n\\t\\tpublic uint B;\\n\\t\\tpublic uint C;\\n\\t\\tpublic uint D;\\n\\n\\t\\tpublic Digest()\\n\\t\\t{\\n\\t\\t\\tA=(uint)MD5InitializerConstant.A;\\n\\t\\t\\tB=(uint)MD5InitializerConstant.B;\\n\\t\\t\\tC=(uint)MD5InitializerConstant.C;\\n\\t\\t\\tD=(uint)MD5InitializerConstant.D;\\n \\t }\\n\\n\\t\\tpublic override string ToString()\\n\\t\\t{\\n\\t\\t\\tstring st ;\\n\\t\\t\\tst= MD5Helper.ReverseByte(A).ToString(\\\"X8\\\")+\\n\\t\\t\\t MD5Helper.ReverseByte(B).ToString(\\\"X8\\\")+\\n MD5Helper.ReverseByte(C).ToString(\\\"X8\\\")+\\n\\t\\t\\t MD5Helper.ReverseByte(D).ToString(\\\"X8\\\");\\n\\t\\t\\treturn st;\\n\\t\\t\\t\\n\\t\\t}\\n\\t}\\n\\n\\tpublic class MD5\\n\\t{\\n\\t\\t/***********************VARIABLES************************************/\\n\\n\\n\\t\\t/***********************Statics**************************************/\\n\\t\\t/// <summary>\\n\\t\\t/// lookup table 4294967296*sin(i)\\n\\t\\t/// </summary>\\n\\t\\tprotected readonly static uint [] T =new uint[64]\\n\\t\\t\\t{\\t0xd76aa478,0xe8c7b756,0x242070db,0xc1bdceee,\\n\\t\\t\\t\\t0xf57c0faf,0x4787c62a,0xa8304613,0xfd469501,\\n 0x698098d8,0x8b44f7af,0xffff5bb1,0x895cd7be,\\n 0x6b901122,0xfd987193,0xa679438e,0x49b40821,\\n\\t\\t\\t\\t0xf61e2562,0xc040b340,0x265e5a51,0xe9b6c7aa,\\n 0xd62f105d,0x2441453,0xd8a1e681,0xe7d3fbc8,\\n 0x21e1cde6,0xc33707d6,0xf4d50d87,0x455a14ed,\\n\\t\\t\\t\\t0xa9e3e905,0xfcefa3f8,0x676f02d9,0x8d2a4c8a,\\n 0xfffa3942,0x8771f681,0x6d9d6122,0xfde5380c,\\n 0xa4beea44,0x4bdecfa9,0xf6bb4b60,0xbebfbc70,\\n 0x289b7ec6,0xeaa127fa,0xd4ef3085,0x4881d05,\\n\\t\\t\\t\\t0xd9d4d039,0xe6db99e5,0x1fa27cf8,0xc4ac5665,\\n 0xf4292244,0x432aff97,0xab9423a7,0xfc93a039,\\n 0x655b59c3,0x8f0ccc92,0xffeff47d,0x85845dd1,\\n 0x6fa87e4f,0xfe2ce6e0,0xa3014314,0x4e0811a1,\\n\\t\\t\\t\\t0xf7537e82,0xbd3af235,0x2ad7d2bb,0xeb86d391};\\n\\t\\t\\n\\t\\t/*****instance variables**************/\\n\\t\\t/// <summary>\\n\\t\\t/// X used to proces data in\\n\\t\\t///\\t512 bits chunks as 16 32 bit word\\n\\t\\t/// </summary>\\n\\t\\tprotected uint [] X = new uint [16];\\t\\n\\t\\t\\n\\t\\t/// <summary>\\n\\t\\t/// the finger print obtained.\\n\\t\\t/// </summary>\\n\\t\\tprotected Digest dgFingerPrint;\\t\\t\\t\\n\\n\\t\\t/// <summary>\\n\\t\\t/// the input bytes\\n\\t\\t/// </summary>\\n\\t\\tprotected\\tbyte [] m_byteInput;\\t\\t\\n\\t\\t\\n\\t\\n\\t\\t\\n\\t\\t/**********************EVENTS AND DELEGATES*******************************************/\\n\\n\\t\\tpublic delegate void ValueChanging (object sender,MD5ChangingEventArgs Changing);\\n\\t\\tpublic delegate void ValueChanged (object sender,MD5ChangedEventArgs Changed);\\n\\n\\n\\t\\tpublic event ValueChanging OnValueChanging;\\n\\t\\tpublic event ValueChanged OnValueChanged;\\n\\n\\n\\t\\t\\n\\t\\t/********************************************************************/\\n\\t\\t/***********************PROPERTIES ***********************/\\n\\t\\t/// <summary>\\n\\t\\t///gets or sets as string\\n\\t\\t/// </summary>\\n\\t\\tpublic string Value\\n\\t\\t{\\n\\t\\t\\tget\\n\\t\\t\\t{\\n\\t\\t\\t\\tstring st ;\\n\\t\\t\\t\\tchar [] tempCharArray= new Char[m_byteInput.Length];\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tfor(int i =0; i<m_byteInput.Length;i++)\\n\\t\\t\\t\\t\\ttempCharArray[i]=(char)m_byteInput[i];\\n\\n\\t\\t\\t\\tst= new String(tempCharArray);\\n\\t\\t\\t\\treturn st;\\n\\t\\t\\t}\\n\\t\\t\\tset\\n\\t\\t\\t{\\n\\t\\t\\t\\t/// raise the event to notify the changing\\n\\t\\t\\t\\tif (this.OnValueChanging !=null)\\n\\t\\t\\t\\t\\tthis.OnValueChanging(this,new MD5ChangingEventArgs(value));\\n\\n\\n\\t\\t\\t\\tm_byteInput=new byte[value.Length];\\n\\t\\t\\t\\tfor (int i =0; i<value.Length;i++)\\n\\t\\t\\t\\t\\tm_byteInput[i]=(byte)value[i];\\n\\t\\t\\t\\tdgFingerPrint=CalculateMD5Value();\\t\\t\\t\\t\\n\\n\\t\\t\\t\\t/// raise the event to notify the change\\n\\t\\t\\t\\tif (this.OnValueChanged !=null)\\n\\t\\t\\t\\t\\tthis.OnValueChanged(this,new MD5ChangedEventArgs(value,dgFingerPrint.ToString()));\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\t\\t\\n\\t\\t\\n\\t\\t/// <summary>\\n\\t\\t/// get/sets as byte array\\n\\t\\t/// </summary>\\n\\t\\tpublic byte [] ValueAsByte\\n\\t\\t{\\n\\t\\t\\tget\\n\\t\\t\\t{\\n\\t\\t\\t\\tbyte [] bt = new byte[m_byteInput.Length];\\n\\t\\t\\t\\tfor (int i =0; i<m_byteInput.Length;i++)\\n\\t\\t\\t\\t\\tbt[i]=m_byteInput[i];\\n\\t\\t\\t\\treturn bt;\\n }\\n\\t\\t\\tset\\n\\t\\t\\t{\\n\\t\\t\\t\\t/// raise the event to notify the changing\\n\\t\\t\\t\\tif (this.OnValueChanging !=null)\\n\\t\\t\\t\\t\\tthis.OnValueChanging(this,new MD5ChangingEventArgs(value));\\n\\n\\t\\t\\t\\tm_byteInput=new byte[value.Length];\\n\\t\\t\\t\\tfor (int i =0; i<value.Length;i++)\\n\\t\\t\\t\\t\\tm_byteInput[i]=value[i];\\n\\t\\t\\t\\tdgFingerPrint=CalculateMD5Value();\\n\\n\\t\\n\\t\\t\\t\\t/// notify the changed value\\n\\t\\t\\t\\tif (this.OnValueChanged !=null)\\n\\t\\t\\t\\t\\tthis.OnValueChanged(this,new MD5ChangedEventArgs(value,dgFingerPrint.ToString()));\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//gets the signature/figner print as string\\n\\t\\tpublic string FingerPrint\\n\\t\\t{\\n\\t\\t\\tget\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn dgFingerPrint.ToString();\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\n\\t\\t/*************************************************************************/\\n\\t\\t/// <summary>\\n\\t\\t/// Constructor\\n\\t\\t/// </summary>\\n\\t\\tpublic MD5()\\n\\t\\t{\\t\\t\\t\\n\\t\\t\\tValue=\\\"\\\";\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\t/******************************************************************************/\\n\\t\\t/*********************METHODS**************************/\\n\\n\\t\\t/// <summary>\\n\\t\\t/// calculat md5 signature of the string in Input\\n\\t\\t/// </summary>\\n\\t\\t/// <returns> Digest: the finger print of msg</returns>\\n\\t\\tprotected Digest CalculateMD5Value()\\n\\t\\t{\\n\\t\\t\\t/***********vairable declaration**************/\\n\\t\\t\\tbyte [] bMsg;\\t//buffer to hold bits\\n\\t\\t\\tuint N;\\t\\t\\t//N is the size of msg as word (32 bit)\\n\\t\\t\\tDigest dg =new Digest();\\t\\t\\t// the value to be returned\\n\\n\\t\\t\\t// create a buffer with bits padded and length is alos padded\\n\\t\\t\\tbMsg=CreatePaddedBuffer();\\n\\n\\t\\t\\tN=(uint)(bMsg.Length*8)/32;\\t\\t//no of 32 bit blocks\\n\\t\\t\\t\\n\\t\\t\\tfor (uint i=0; i<N/16;i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tCopyBlock(bMsg,i);\\n\\t\\t\\t\\tPerformTransformation(ref dg.A,ref dg.B,ref dg.C,ref dg.D);\\n\\t\\t\\t}\\n\\t\\t\\treturn dg;\\n\\t\\t}\\n\\t\\n\\t\\t/********************************************************\\n\\t\\t * TRANSFORMATIONS : FF , GG , HH , II acc to RFC 1321\\n\\t\\t * where each Each letter represnets the aux function used\\n\\t\\t *********************************************************/\\n\\n\\n\\n\\t\\t/// <summary>\\n\\t\\t/// perform transformatio using f(((b&c) | (~(b)&d))\\n\\t\\t/// </summary>\\n\\t\\tprotected void TransF(ref uint a, uint b, uint c, uint d,uint k,ushort s, uint i )\\n\\t\\t{\\n\\t\\t\\ta = b + MD5Helper.RotateLeft((a + ((b&c) | (~(b)&d)) + X[k] + T[i-1]), s);\\n\\t\\t}\\n\\n\\t\\t/// <summary>\\n\\t\\t/// perform transformatio using g((b&d) | (c & ~d) )\\n\\t\\t/// </summary>\\n\\t\\tprotected void TransG(ref uint a, uint b, uint c, uint d,uint k,ushort s, uint i )\\n\\t\\t{\\n\\t\\t\\ta = b + MD5Helper.RotateLeft((a + ((b&d) | (c & ~d) ) + X[k] + T[i-1]), s);\\n\\t\\t}\\n\\t\\t\\n\\t\\t/// <summary>\\n\\t\\t/// perform transformatio using h(b^c^d)\\n\\t\\t/// </summary>\\n\\t\\tprotected void TransH(ref uint a, uint b, uint c, uint d,uint k,ushort s, uint i )\\n\\t\\t{\\n\\t\\t\\ta = b + MD5Helper.RotateLeft((a + (b^c^d) + X[k] + T[i-1]), s);\\n\\t\\t}\\n\\t\\t\\n\\t\\t/// <summary>\\n\\t\\t/// perform transformatio using i (c^(b|~d))\\n\\t\\t/// </summary>\\n\\t\\tprotected void TransI(ref uint a, uint b, uint c, uint d,uint k,ushort s, uint i )\\n\\t\\t{\\n\\t\\t\\ta = b + MD5Helper.RotateLeft((a + (c^(b|~d))+ X[k] + T[i-1]), s);\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t/// <summary>\\n\\t\\t/// Perform All the transformation on the data\\n\\t\\t/// </summary>\\n\\t\\t/// <param name=\\\"A\\\">A</param>\\n\\t\\t/// <param name=\\\"B\\\">B </param>\\n\\t\\t/// <param name=\\\"C\\\">C</param>\\n\\t\\t/// <param name=\\\"D\\\">D</param>\\n\\t\\tprotected void PerformTransformation(ref uint A,ref uint B,ref uint C, ref uint D)\\n\\t\\t{\\n\\t\\t\\t//// saving ABCD to be used in end of loop\\n\\t\\t\\t\\n\\t\\t\\tuint AA,BB,CC,DD;\\n\\n\\t\\t\\tAA=A;\\t\\n\\t\\t\\tBB=B;\\n\\t\\t\\tCC=C;\\n\\t\\t\\tDD=D;\\n\\n\\t\\t\\t/* Round 1\\n\\t\\t\\t\\t* [ABCD 0 7 1] [DABC 1 12 2] [CDAB 2 17 3] [BCDA 3 22 4]\\n\\t\\t\\t\\t* [ABCD 4 7 5] [DABC 5 12 6] [CDAB 6 17 7] [BCDA 7 22 8]\\n\\t\\t\\t\\t* [ABCD 8 7 9] [DABC 9 12 10] [CDAB 10 17 11] [BCDA 11 22 12]\\n\\t\\t\\t\\t* [ABCD 12 7 13] [DABC 13 12 14] [CDAB 14 17 15] [BCDA 15 22 16]\\n\\t\\t\\t\\t* * */\\n\\t\\t\\tTransF(ref A,B,C,D,0,7,1);TransF(ref D,A,B,C,1,12,2);TransF(ref C,D,A,B,2,17,3);TransF(ref B,C,D,A,3,22,4);\\n\\t\\t\\tTransF(ref A,B,C,D,4,7,5);TransF(ref D,A,B,C,5,12,6);TransF(ref C,D,A,B,6,17,7);TransF(ref B,C,D,A,7,22,8);\\n\\t\\t\\tTransF(ref A,B,C,D,8,7,9);TransF(ref D,A,B,C,9,12,10);TransF(ref C,D,A,B,10,17,11);TransF(ref B,C,D,A,11,22,12);\\n\\t\\t\\tTransF(ref A,B,C,D,12,7,13);TransF(ref D,A,B,C,13,12,14);TransF(ref C,D,A,B,14,17,15);TransF(ref B,C,D,A,15,22,16);\\n\\t\\t\\t/** rOUND 2\\n\\t\\t\\t\\t**[ABCD 1 5 17] [DABC 6 9 18] [CDAB 11 14 19] [BCDA 0 20 20]\\n\\t\\t\\t\\t*[ABCD 5 5 21] [DABC 10 9 22] [CDAB 15 14 23] [BCDA 4 20 24]\\n\\t\\t\\t\\t*[ABCD 9 5 25] [DABC 14 9 26] [CDAB 3 14 27] [BCDA 8 20 28]\\n\\t\\t\\t\\t*[ABCD 13 5 29] [DABC 2 9 30] [CDAB 7 14 31] [BCDA 12 20 32]\\n\\t\\t\\t*/\\n\\t\\t\\tTransG(ref A,B,C,D,1,5,17);TransG(ref D,A,B,C,6,9,18);TransG(ref C,D,A,B,11,14,19);TransG(ref B,C,D,A,0,20,20);\\n\\t\\t\\tTransG(ref A,B,C,D,5,5,21);TransG(ref D,A,B,C,10,9,22);TransG(ref C,D,A,B,15,14,23);TransG(ref B,C,D,A,4,20,24);\\n\\t\\t\\tTransG(ref A,B,C,D,9,5,25);TransG(ref D,A,B,C,14,9,26);TransG(ref C,D,A,B,3,14,27);TransG(ref B,C,D,A,8,20,28);\\n\\t\\t\\tTransG(ref A,B,C,D,13,5,29);TransG(ref D,A,B,C,2,9,30);TransG(ref C,D,A,B,7,14,31);TransG(ref B,C,D,A,12,20,32);\\n\\t\\t\\t/* rOUND 3\\n\\t\\t\\t\\t* [ABCD 5 4 33] [DABC 8 11 34] [CDAB 11 16 35] [BCDA 14 23 36]\\n\\t\\t\\t\\t* [ABCD 1 4 37] [DABC 4 11 38] [CDAB 7 16 39] [BCDA 10 23 40]\\n\\t\\t\\t\\t* [ABCD 13 4 41] [DABC 0 11 42] [CDAB 3 16 43] [BCDA 6 23 44]\\n\\t\\t\\t\\t* [ABCD 9 4 45] [DABC 12 11 46] [CDAB 15 16 47] [BCDA 2 23 48]\\n\\t\\t\\t * */\\n\\t\\t\\tTransH(ref A,B,C,D,5,4,33);TransH(ref D,A,B,C,8,11,34);TransH(ref C,D,A,B,11,16,35);TransH(ref B,C,D,A,14,23,36);\\n\\t\\t\\tTransH(ref A,B,C,D,1,4,37);TransH(ref D,A,B,C,4,11,38);TransH(ref C,D,A,B,7,16,39);TransH(ref B,C,D,A,10,23,40);\\n\\t\\t\\tTransH(ref A,B,C,D,13,4,41);TransH(ref D,A,B,C,0,11,42);TransH(ref C,D,A,B,3,16,43);TransH(ref B,C,D,A,6,23,44);\\n\\t\\t\\tTransH(ref A,B,C,D,9,4,45);TransH(ref D,A,B,C,12,11,46);TransH(ref C,D,A,B,15,16,47);TransH(ref B,C,D,A,2,23,48);\\n\\t\\t\\t/*ORUNF 4\\n\\t\\t\\t\\t*[ABCD 0 6 49] [DABC 7 10 50] [CDAB 14 15 51] [BCDA 5 21 52]\\n\\t\\t\\t\\t*[ABCD 12 6 53] [DABC 3 10 54] [CDAB 10 15 55] [BCDA 1 21 56]\\n\\t\\t\\t\\t*[ABCD 8 6 57] [DABC 15 10 58] [CDAB 6 15 59] [BCDA 13 21 60]\\n\\t\\t\\t\\t*[ABCD 4 6 61] [DABC 11 10 62] [CDAB 2 15 63] [BCDA 9 21 64]\\n\\t\\t\\t\\t\\t\\t * */\\n\\t\\t\\tTransI(ref A,B,C,D,0,6,49);TransI(ref D,A,B,C,7,10,50);TransI(ref C,D,A,B,14,15,51);TransI(ref B,C,D,A,5,21,52);\\n\\t\\t\\tTransI(ref A,B,C,D,12,6,53);TransI(ref D,A,B,C,3,10,54);TransI(ref C,D,A,B,10,15,55);TransI(ref B,C,D,A,1,21,56);\\n\\t\\t\\tTransI(ref A,B,C,D,8,6,57);TransI(ref D,A,B,C,15,10,58);TransI(ref C,D,A,B,6,15,59);TransI(ref B,C,D,A,13,21,60);\\n\\t\\t\\tTransI(ref A,B,C,D,4,6,61);TransI(ref D,A,B,C,11,10,62);TransI(ref C,D,A,B,2,15,63);TransI(ref B,C,D,A,9,21,64);\\n\\n\\n\\t\\t\\tA=A+AA;\\n\\t\\t\\tB=B+BB;\\n\\t\\t\\tC=C+CC;\\n\\t\\t\\tD=D+DD;\\n\\n\\n\\t\\t}\\n\\n\\n\\t\\t/// <summary>\\n\\t\\t/// Create Padded buffer for processing , buffer is padded with 0 along\\n\\t\\t/// with the size in the end\\n\\t\\t/// </summary>\\n\\t\\t/// <returns>the padded buffer as byte array</returns>\\n\\t\\tprotected byte[] CreatePaddedBuffer()\\n\\t\\t{\\n\\t\\t\\tuint pad;\\t\\t//no of padding bits for 448 mod 512\\n\\t\\t\\tbyte [] bMsg;\\t//buffer to hold bits\\n\\t\\t\\tulong sizeMsg;\\t\\t//64 bit size pad\\n\\t\\t\\tuint sizeMsgBuff;\\t//buffer size in multiple of bytes\\n\\t\\t\\tint temp=(448-((m_byteInput.Length*8)%512)); //temporary\\n\\n\\n\\t\\t\\tpad = (uint )((temp+512)%512);\\t\\t//getting no of bits to be pad\\n\\t\\t\\tif (pad==0)\\t\\t\\t\\t///pad is in bits\\n\\t\\t\\t\\tpad=512;\\t\\t\\t//at least 1 or max 512 can be added\\n\\n\\t\\t\\tsizeMsgBuff= (uint) ((m_byteInput.Length)+ (pad/8)+8);\\n\\t\\t\\tsizeMsg=(ulong)m_byteInput.Length*8;\\n\\t\\t\\tbMsg=new byte[sizeMsgBuff];\\t///no need to pad with 0 coz new bytes\\n\\t\\t\\t// are already initialize to 0 :)\\n\\n\\n\\n\\n\\t\\t\\t////copying string to buffer\\n\\t\\t\\tfor (int i =0; i<m_byteInput.Length;i++)\\n\\t\\t\\t\\tbMsg[i]=m_byteInput[i];\\n\\n\\t\\t\\tbMsg[m_byteInput.Length]|=0x80;\\t\\t///making first bit of padding 1,\\n\\t\\t\\t\\n\\t\\t\\t//wrting the size value\\n\\t\\t\\tfor (int i =8; i >0;i--)\\n\\t\\t\\t\\tbMsg[sizeMsgBuff-i]=(byte) (sizeMsg>>((8-i)*8) & 0x00000000000000ff);\\n\\n\\t\\t\\treturn bMsg;\\n\\t\\t}\\n\\n\\n\\t\\t/// <summary>\\n\\t\\t/// Copies a 512 bit block into X as 16 32 bit words\\n\\t\\t/// </summary>\\n\\t\\t/// <param name=\\\"bMsg\\\"> source buffer</param>\\n\\t\\t/// <param name=\\\"block\\\">no of block to copy starting from 0</param>\\n\\t\\tprotected void CopyBlock(byte[] bMsg,uint block)\\n\\t\\t{\\n\\n\\t\\t\\tblock=block<<6;\\n\\t\\t\\tfor (uint j=0; j<61;j+=4)\\n\\t\\t\\t{\\n\\t\\t\\t\\tX[j>>2]=(((uint) bMsg[block+(j+3)]) <<24 ) |\\n\\t\\t\\t\\t\\t\\t(((uint) bMsg[block+(j+2)]) <<16 ) |\\n\\t\\t\\t\\t\\t\\t(((uint) bMsg[block+(j+1)]) <<8 ) |\\n\\t\\t\\t\\t\\t\\t(((uint) bMsg[block+(j)]) ) ;\\n\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"System.Security.Cryptography.MD5CryptoServiceProvider x = new System.Security.Cryptography.MD5CryptoServiceProvider();\\nbyte[] bs = System.Text.Encoding.UTF8.GetBytes(password);\\nbs = x.ComputeHash(bs); //this function is not in the above classdefinition\\nSystem.Text.StringBuilder s = new System.Text.StringBuilder();\\nforeach (byte b in bs)\\n{\\n s.Append(b.ToString(\\\"x2\\\").ToLower());\\n}\\npassword = s.ToString();\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"# Array sum helper function.\\nsum = (array) ->\\n array.reduce (x, y) -> x + y\\n\\nmd5 = do ->\\n # Per-round shift amounts.\\n s = [738695, 669989, 770404, 703814]\\n s = (s[i >> 4] >> i % 4 * 5 & 31 for i in [0..63])\\n\\n # Constants cache generated by sine.\\n K = (Math.floor 2**32 * Math.abs Math.sin i for i in [1..64])\\n\\n # Bitwise left rotate helper function.\\n lrot = (x, y) ->\\n x << y | x >>> 32 - y;\\n\\n (input) ->\\n # Initialize values.\\n d0 = 0x10325476;\\n a0 = 0x67452301;\\n b0 = ~d0\\n c0 = ~a0;\\n\\n # Convert the message to 32-bit words, little-endian.\\n M =\\n for i in [0...input.length] by 4\\n sum (input.charCodeAt(i + j) << j*8 for j in [0..3])\\n\\n # Pre-processing: append a 1 bit, then message length % 2^64.\\n len = input.length * 8\\n M[len >> 5] |= 128 << len % 32\\n M[(len + 64 >>> 9 << 4) + 14] = len\\n\\n # Process the message in chunks of 16 32-bit words.\\n for x in [0...M.length] by 16\\n [A, B, C, D] = [a0, b0, c0, d0]\\n\\n # Main loop.\\n for i in [0..63]\\n if i < 16\\n F = B & C | ~B & D\\n g = i\\n else if i < 32\\n F = B & D | C & ~D\\n g = i * 5 + 1\\n else if i < 48\\n F = B ^ C ^ D\\n g = i * 3 + 5\\n else\\n F = C ^ (B | ~D)\\n g = i * 7\\n\\n [A, B, C, D] =\\n [D, B + lrot(A + F + K[i] + (M[x + g % 16] ? 0), s[i]), B, C]\\n\\n a0 += A\\n b0 += B\\n c0 += C\\n d0 += D\\n\\n # Convert the four words back to a string.\\n return (\\n for x in [a0, b0, c0, d0]\\n (String.fromCharCode x >>> 8 * y & 255 for y in [0..3]).join ''\\n ).join ''\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"str2hex = do ->\\n hex = ['0', '1', '2', '3', '4', '5', '6', '7',\\n '8', '9', 'a', 'b', 'c', 'd', 'e', 'f']\\n hex = (hex[x >> 4] + hex[x & 15] for x in [0..255])\\n (str) ->\\n (hex[c.charCodeAt()] for c in str).join ''\\n\\nconsole.log str2hex md5 message for message in [\\n \\\"\\\"\\n \\\"a\\\"\\n \\\"abc\\\"\\n \\\"message digest\\\"\\n \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"\\n \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"\\n]\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(defpackage #:md5\\n (:use #:cl))\\n\\n(in-package #:md5)\\n\\n(require :babel)\\n\\n(deftype word () '(unsigned-byte 32))\\n(deftype octet () '(unsigned-byte 8))\\n(deftype octets () '(vector octet))\\n\\n(defparameter *s*\\n (make-array 16 :element-type 'word\\n :initial-contents '(7 12 17 22\\n 5 9 14 20\\n 4 11 16 23\\n 6 10 15 21)))\\n\\n(defun s (i)\\n (declare ((integer 0 63) i))\\n (aref *s* (+ (ash (ash i -4) 2)\\n (ldb (byte 2 0) i))))\\n\\n(defparameter *k*\\n (loop with result = (make-array 64 :element-type 'word)\\n for i from 0 below 64\\n do (setf (aref result i) (floor (* (ash 1 32) (abs (sin (1+ (float i 1d0)))))))\\n finally (return result)))\\n\\n(defun wrap (bits integer)\\n (declare (fixnum bits) (integer integer))\\n (ldb (byte bits 0) integer))\\n\\n(defun integer->8octets (integer)\\n (declare (integer integer))\\n (loop for n = (wrap 64 integer) then (ash n -8)\\n repeat 8\\n collect (wrap 8 n)))\\n\\n(defun pad-octets (octets)\\n (declare (octets octets))\\n (let* ((octets-length (length octets))\\n (zero-pad-length (- 64 (mod (+ octets-length 9) 64)))\\n (zero-pads (loop repeat zero-pad-length collect 0)))\\n (concatenate 'octets octets '(#x80) zero-pads (integer->8octets (* 8 octets-length)))))\\n\\n(defun octets->words (octets)\\n (declare (octets octets))\\n (loop with result = (make-array (/ (length octets) 4) :element-type 'word)\\n for n from 0 below (length octets) by 4\\n for i from 0\\n do (setf (aref result i)\\n (dpb (aref octets (+ n 3)) (byte 8 24)\\n (dpb (aref octets (+ n 2)) (byte 8 16)\\n (dpb (aref octets (1+ n)) (byte 8 8)\\n (dpb (aref octets n) (byte 8 0) 0)))))\\n finally (return result)))\\n\\n(defun words->octets (&rest words)\\n (loop for word of-type word in words\\n collect (ldb (byte 8 0) word)\\n collect (ldb (byte 8 8) word)\\n collect (ldb (byte 8 16) word)\\n collect (ldb (byte 8 24) word)))\\n\\n(defun left-rotate (x c)\\n (declare (integer x) (fixnum c))\\n (let ((x (wrap 32 x)))\\n (wrap 32 (logior (ash x c)\\n (ash x (- c 32))))))\\n\\n(defun md5 (string)\\n (declare (string string))\\n (loop with m = (octets->words (pad-octets (babel:string-to-octets string)))\\n with a0 of-type word = #x67452301\\n with b0 of-type word = #xefcdab89\\n with c0 of-type word = #x98badcfe\\n with d0 of-type word = #x10325476\\n for j from 0 below (length m) by 16\\n do (loop for a of-type word = a0 then d\\n and b of-type word = b0 then new-b\\n and c of-type word = c0 then b\\n and d of-type word = d0 then c\\n for i from 0 below 64\\n for new-b = (multiple-value-bind (f g)\\n (ecase (ash i -4)\\n (0 (values (wrap 32 (logior (logand b c)\\n (logand (lognot b) d)))\\n i))\\n (1 (values (wrap 32 (logior (logand d b)\\n (logand (lognot d) c)))\\n (wrap 4 (1+ (* 5 i)))))\\n (2 (values (wrap 32 (logxor b c d))\\n (wrap 4 (+ (* 3 i) 5))))\\n (3 (values (wrap 32 (logxor c\\n (logior b (lognot d))))\\n (wrap 4 (* 7 i)))))\\n (declare (word f g))\\n (wrap 32 (+ b (left-rotate (+ a f (aref *k* i) (aref m (+ j g)))\\n (s i)))))\\n finally (setf a0 (wrap 32 (+ a0 a))\\n b0 (wrap 32 (+ b0 b))\\n c0 (wrap 32 (+ c0 c))\\n d0 (wrap 32 (+ d0 d))))\\n finally (return (with-output-to-string (s)\\n (dolist (o (words->octets a0 b0 c0 d0))\\n (format s \\\"~(~2,'0X~)\\\" o))))))\\n\\n(defun test-cases ()\\n (assert (string= \\\"d41d8cd98f00b204e9800998ecf8427e\\\"\\n (md5 \\\"\\\")))\\n (assert (string= \\\"0cc175b9c0f1b6a831c399e269772661\\\"\\n (md5 \\\"a\\\")))\\n (assert (string= \\\"900150983cd24fb0d6963f7d28e17f72\\\"\\n (md5 \\\"abc\\\")))\\n (assert (string= \\\"f96b697d7cb7938d525a2f31aaf161d0\\\"\\n (md5 \\\"message digest\\\")))\\n (assert (string= \\\"c3fcd3d76192e4007dfb496cca67e13b\\\"\\n (md5 \\\"abcdefghijklmnopqrstuvwxyz\\\")))\\n (assert (string= \\\"d174ab98d277d9f5a5611c2c9f419d9f\\\"\\n (md5 \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\")))\\n (assert (string= \\\"57edf4a22be3c955ac49da2e2107b67a\\\"\\n (md5 \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.bitmanip, core.stdc.string, std.conv, std.math, std.array,\\n std.string;\\n\\nversion (D_InlineAsm_X86) {} else {\\n static assert(false, \\\"For X86 machine only.\\\");\\n}\\n\\n// CTFE construction of transform expressions.\\nuint S(in uint n) pure nothrow @safe @nogc {\\n static immutable aux = [7u, 12, 17, 22, 5, 9, 14, 20, 4, 11,\\n 16, 23, 6, 10, 15, 21];\\n return aux[(n / 16) * 4 + (n % 4)];\\n}\\n\\nuint K(in uint n) pure nothrow @safe @nogc {\\n uint r = 0;\\n if (n <= 15)\\n r = n;\\n else if (n <= 31)\\n r = 5 * n + 1;\\n else if (n <= 47)\\n r = 3 * n + 5;\\n else\\n r = 7 * n;\\n return r % 16;\\n}\\n\\nuint T(in uint n) pure nothrow @nogc {\\n return cast(uint)(abs(sin(n + 1.0L)) * (2UL ^^ 32));\\n}\\n\\nstring[] ABCD(in int n) pure nothrow {\\n enum abcd = [\\\"EAX\\\", \\\"EBX\\\", \\\"ECX\\\", \\\"EDX\\\"];\\n return abcd[(64 - n) % 4 .. 4] ~ abcd[0 .. (64 - n) % 4];\\n}\\n\\nstring SUB(in int n, in string s) pure nothrow {\\n return s\\n .replace(\\\"ax\\\", n.ABCD[0])\\n .replace(\\\"bx\\\", n.ABCD[1])\\n .replace(\\\"cx\\\", n.ABCD[2])\\n .replace(\\\"dx\\\", n.ABCD[3]);\\n}\\n\\n// FF, GG, HH & II expressions part 1 (F, G, H, I).\\nstring fghi1(in int n) pure nothrow @nogc {\\n switch (n / 16) {\\n case 0:\\n // (bb & cc) | (~bb & dd)\\n return q{\\n mov ESI, bx;\\n mov EDI, bx;\\n not ESI;\\n and EDI, cx;\\n and ESI, dx;\\n or EDI, ESI;\\n add ax, EDI;\\n };\\n case 1:\\n // (dd & bb) | (~dd & cc)\\n return q{\\n mov ESI, dx;\\n mov EDI, dx;\\n not ESI;\\n and EDI, bx;\\n and ESI, cx;\\n or EDI, ESI;\\n add ax, EDI;\\n };\\n case 2: // (bb ^ cc ^ dd)\\n return q{\\n mov EDI, bx;\\n xor EDI, cx;\\n xor EDI, dx;\\n add ax, EDI;\\n };\\n case 3: // (cc ^ (bb | ~dd))\\n return q{\\n mov EDI, dx;\\n not EDI;\\n or EDI, bx;\\n xor EDI, cx;\\n add ax, EDI;\\n };\\n default:\\n assert(false);\\n }\\n}\\n\\n// FF, GG, HH & II expressions part 2.\\nstring fghi2(in int n) pure nothrow {\\n return q{\\n add ax, [EBP + 4 * KK];\\n add ax, TT;\\n } ~ n.fghi1;\\n}\\n\\n// FF, GG, HH & II expressions prepended with previous parts\\n// & subsitute ABCD.\\nstring FGHI(in int n) pure nothrow {\\n // aa = ((aa << SS)|( aa >>> (32 - SS))) + bb = ROL(aa, SS) + bb\\n return SUB(n, n.fghi2 ~ q{\\n rol ax, SS;\\n add ax, bx;\\n });\\n}\\n\\nstring genExpr(uint n) pure nothrow {\\n return FGHI(n)\\n .replace(\\\"SS\\\", n.S.text)\\n .replace(\\\"KK\\\", n.K.text)\\n .replace(\\\"TT\\\", \\\"0x\\\" ~ to!string(n.T, 16));\\n}\\n\\nstring genTransformCode(int n) pure nothrow {\\n return (n < 63) ? n.genExpr ~ genTransformCode(n + 1) : n.genExpr;\\n}\\n\\nenum string coreZMD5 = 0.genTransformCode;\\n\\nstruct ZMD5 {\\n uint[4] state = [0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476];\\n ulong count;\\n ubyte[64] buffer;\\n\\n ubyte[64] padding = [\\n 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\\n 0, 0];\\n\\n private void transform(ubyte* block) pure nothrow @nogc {\\n uint[16] x = void;\\n\\n version (BigEndian) {\\n foreach (immutable i; 0 .. 16)\\n x[i] = littleEndianToNative!uint(*cast(ubyte[4]*)&block[i * 4]);\\n } else {\\n (cast(ubyte*)x.ptr)[0 .. 64] = block[0 .. 64];\\n }\\n\\n auto pState = state.ptr;\\n auto pBuffer = x.ptr;\\n\\n asm pure nothrow @nogc {\\n mov ESI, pState[EBP];\\n mov EDX, [ESI + 3 * 4];\\n mov ECX, [ESI + 2 * 4];\\n mov EBX, [ESI + 1 * 4];\\n mov EAX, [ESI + 0 * 4];\\n push EBP;\\n push ESI;\\n\\n mov EBP, pBuffer[EBP];\\n }\\n\\n mixin(\\\"asm pure nothrow @nogc { \\\" ~ coreZMD5 ~ \\\"}\\\");\\n\\n asm pure nothrow @nogc {\\n pop ESI;\\n pop EBP;\\n add [ESI + 0 * 4], EAX;\\n add [ESI + 1 * 4], EBX;\\n add [ESI + 2 * 4], ECX;\\n add [ESI + 3 * 4], EDX;\\n }\\n x[] = 0;\\n }\\n\\n void update(in void[] input) pure nothrow @nogc {\\n auto inputLen = input.length;\\n uint index = (count >> 3) & 0b11_1111U;\\n count += inputLen * 8;\\n immutable uint partLen = 64 - index;\\n\\n uint i;\\n if (inputLen >= partLen) {\\n memcpy(&buffer[index], input.ptr, partLen);\\n transform(buffer.ptr);\\n for (i = partLen; i + 63 < inputLen; i += 64)\\n transform((cast(ubyte[])input)[i .. i + 64].ptr);\\n index = 0;\\n } else\\n i = 0;\\n\\n if (inputLen - i)\\n memcpy(&buffer[index], &input[i], inputLen - i);\\n }\\n\\n void finish(ref ubyte[16] digest) pure nothrow @nogc {\\n ubyte[8] bits = void;\\n bits[0 .. 8] = nativeToLittleEndian(count)[];\\n\\n immutable uint index = (count >> 3) & 0b11_1111U;\\n immutable uint padLen = (index < 56) ?\\n (56 - index) : (120 - index);\\n update(padding[0 .. padLen]);\\n update(bits);\\n\\n digest[0 .. 4] = nativeToLittleEndian(state[0])[];\\n digest[4 .. 8] = nativeToLittleEndian(state[1])[];\\n digest[8 .. 12] = nativeToLittleEndian(state[2])[];\\n digest[12 .. 16] = nativeToLittleEndian(state[3])[];\\n\\n // Zeroize sensitive information.\\n memset(&this, 0, ZMD5.sizeof);\\n }\\n}\\n\\nstring getDigestString(in void[][] data...) pure {\\n ZMD5 ctx;\\n foreach (datum; data)\\n ctx.update(datum);\\n ubyte[16] digest;\\n ctx.finish(digest);\\n return format(\\\"%-(%02X%)\\\", digest);\\n}\\n\\n\\nvoid main() { // Benchmark code --------------\\n import std.stdio, std.datetime, std.digest.md;\\n\\n writefln(`md5 digest(\\\"\\\") = %-(%02X%)`, \\\"\\\".md5Of);\\n writefln(`zmd5 digest(\\\"\\\") = %s`, \\\"\\\".getDigestString);\\n\\n enum megaBytes = 512;\\n writefln(\\\"\\\\nTest performance / message size %dMBytes:\\\", megaBytes);\\n auto data = new float[megaBytes * 0x40000 + 13];\\n\\n StopWatch sw;\\n sw.start;\\n immutable d1 = data.md5Of;\\n sw.stop;\\n immutable time1 = sw.peek.msecs / 1000.0;\\n writefln(\\\"digest(data) = %-(%02X%)\\\", d1);\\n writefln(\\\"std.md5: %8.2f M/sec ( %8.2f secs)\\\",\\n megaBytes / time1, time1);\\n\\n sw.reset;\\n sw.start;\\n immutable d2 = data.getDigestString;\\n sw.stop;\\n immutable time2 = sw.peek.msecs / 1000.0;\\n writefln(\\\"digest(data) = %s\\\", d2);\\n writefln(\\\"zmd5 : %8.2f M/sec ( %8.2f secs)\\\",\\n megaBytes / time2, time2);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program MD5Implementation;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils,\\n System.Classes;\\n\\ntype\\n TTestCase = record\\n hashCode: string;\\n _: string;\\n end;\\n\\nvar\\n testCases: array[0..6] of TTestCase = ((\\n hashCode: 'D41D8CD98F00B204E9800998ECF8427E';\\n _: ''\\n ), (\\n hashCode: '0CC175B9C0F1B6A831C399E269772661';\\n _: 'a'\\n ), (\\n hashCode: '900150983CD24FB0D6963F7D28E17F72';\\n _: 'abc'\\n ), (\\n hashCode: 'F96B697D7CB7938D525A2F31AAF161D0';\\n _: 'message digest'\\n ), (\\n hashCode: 'C3FCD3D76192E4007DFB496CCA67E13B';\\n _: 'abcdefghijklmnopqrstuvwxyz'\\n ), (\\n hashCode: 'D174AB98D277D9F5A5611C2C9F419D9F';\\n _: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'\\n ), (\\n hashCode: '57EDF4A22BE3C955AC49DA2E2107B67A';\\n _: '12345678901234567890123456789' + '012345678901234567890123456789012345678901234567890'\\n ));\\n shift: array of UInt32 = [7, 12, 17, 22, 5, 9, 14, 20, 4, 11, 16, 23, 6, 10, 15, 21];\\n table: array[0..63] of UInt32;\\n\\nprocedure Init();\\nvar\\n i: integer;\\n\\n function fAbs(x: Extended): Extended;\\n begin\\n if x < 0 then\\n exit(-x);\\n exit(x);\\n end;\\n\\nbegin\\n for i := 0 to High(table) do\\n table[i] := Trunc((UInt64(1) shl 32) * fAbs(Sin(i + 1.0)));\\nend;\\n\\nfunction Md5(s: string): TBytes;\\nconst\\n BUFFER_SIZE = 16;\\nvar\\n binary: TBytesStream;\\n buffer: Tarray<UInt32>;\\n messageLenBits: UInt64;\\n i, j, bufferIndex, count: integer;\\n byte_data: byte;\\n string_data: ansistring;\\n k, k1: Tarray<UInt32>;\\n f, rnd, sa: UInt32;\\n tmp: UInt64;\\nbegin\\n k := [$67452301, $EFCDAB89, $98BADCFE, $10325476];\\n\\n binary := TBytesStream.Create();\\n\\n if not s.IsEmpty then\\n begin\\n string_data := Utf8ToAnsi(s);\\n binary.Write(Tbytes(string_data), length(string_data));\\n end;\\n\\n byte_data := $80;\\n binary.Write(byte_data, 1);\\n\\n messageLenBits := UInt64(s.Length * 8);\\n count := s.Length + 1;\\n\\n while (count mod 64) <> 56 do\\n begin\\n byte_data := $00;\\n binary.Write(byte_data, 1);\\n inc(count);\\n end;\\n\\n binary.Write(messageLenBits, sizeof(messageLenBits));\\n\\n SetLength(buffer, BUFFER_SIZE);\\n SetLength(k1, length(k));\\n\\n binary.Seek(0, soFromBeginning);\\n\\n while binary.Read(buffer[0], BUFFER_SIZE * 4) > 0 do\\n begin\\n for i := 0 to 3 do\\n k1[i] := k[i];\\n\\n for i := 0 to 63 do\\n begin\\n f := 0;\\n bufferIndex := i;\\n rnd := i shr 4;\\n case rnd of\\n 0:\\n f := (k1[1] and k1[2]) or (not k1[1] and k1[3]);\\n 1:\\n begin\\n f := (k1[1] and k1[3]) or (k1[2] and not k1[3]);\\n bufferIndex := (bufferIndex * 5 + 1) and $0F\\n end;\\n 2:\\n begin\\n f := k1[1] xor k1[2] xor k1[3];\\n bufferIndex := (bufferIndex * 3 + 5) and $0F;\\n end;\\n 3:\\n begin\\n f := k1[2] xor (k1[1] or not k1[3]);\\n bufferIndex := (bufferIndex * 7) and $0F;\\n end;\\n end;\\n\\n sa := shift[(rnd shl 2) or (i and 3)];\\n\\n k1[0] := k1[0] + f + buffer[bufferIndex] + table[i];\\n\\n tmp := k1[0];\\n\\n k1[0] := k1[3];\\n k1[3] := k1[2];\\n k1[2] := k1[1];\\n\\n k1[1] := ((tmp shl sa) or (tmp shr (32 - sa))) + k1[1];\\n end;\\n\\n for i := 0 to 3 do\\n k[i] := k[i] + k1[i];\\n end;\\n\\n SetLength(result, BUFFER_SIZE);\\n\\n binary.Clear;\\n for i := 0 to 3 do\\n binary.Write(k[i], 4);\\n\\n binary.Seek(0, soBeginning);\\n\\n binary.Read(Result, BUFFER_SIZE);\\n\\n binary.Free;\\nend;\\n\\nfunction BytesToString(b: TBytes): string;\\nvar\\n v: byte;\\nbegin\\n Result := '';\\n for v in b do\\n Result := Result + v.ToHexString(2);\\nend;\\n\\nvar\\n tc: TTestCase;\\n\\nbegin\\n Init;\\n\\n for tc in testCases do\\n Writeln(Format('%s'#10'%s'#10, [tc.hashCode, BytesToString(md5(tc._))]));\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"len md5k[] 64\\nproc md5init . .\\n for i = 1 to 64\\n md5k[i] = floor (0x100000000 * abs sin (i * 180 / pi))\\n .\\n.\\nmd5init\\n#\\nproc md5 inp$ . s$ .\\n subr addinp\\n if inp4 = 1\\n inp[] &= 0\\n .\\n inp[len inp[]] += b * inp4\\n inp4 *= 0x100\\n if inp4 = 0x100000000\\n inp4 = 1\\n .\\n .\\n s[] = [ 7 12 17 22 7 12 17 22 7 12 17 22 7 12 17 22 5 9 14 20 5 9 14 20 5 9 14 20 5 9 14 20 4 11 16 23 4 11 16 23 4 11 16 23 4 11 16 23 6 10 15 21 6 10 15 21 6 10 15 21 6 10 15 21 ]\\n inp[] = [ ]\\n inp4 = 1\\n for i = 1 to len inp$\\n b = strcode substr inp$ i 1\\n addinp\\n .\\n b = 0x80\\n addinp\\n while len inp[] mod 16 <> 14 or inp4 <> 1\\n b = 0\\n addinp\\n .\\n h = len inp$ * 8\\n for i = 1 to 4\\n b = h mod 0x100\\n addinp\\n h = h div 0x100\\n .\\n inp[] &= 0\\n #\\n a0 = 0x67452301\\n b0 = 0xefcdab89\\n c0 = 0x98badcfe\\n d0 = 0x10325476\\n for chunk = 1 step 16 to len inp[] - 15\\n a = a0 ; b = b0 ; c = c0 ; d = d0\\n for i = 1 to 64\\n if i <= 16\\n h1 = bitand b c\\n h2 = bitand bitnot b d\\n f = bitor h1 h2\\n g = i - 1\\n elif i <= 32\\n h1 = bitand d b\\n h2 = bitand bitnot d c\\n f = bitor h1 h2\\n g = (5 * i - 4) mod 16\\n elif i <= 48\\n h1 = bitxor b c\\n f = bitxor h1 d\\n g = (3 * i + 2) mod 16\\n else\\n h1 = bitor b bitnot d\\n f = bitxor c h1\\n g = (7 * i - 7) mod 16\\n .\\n f = (f + a + md5k[i] + inp[chunk + g])\\n a = d\\n d = c\\n c = b\\n h1 = bitshift f s[i]\\n h2 = bitshift f (s[i] - 32)\\n b = (b + h1 + h2)\\n .\\n a0 += a ; b0 += b ; c0 += c ; d0 += d\\n .\\n s$ = \\\"\\\"\\n for a in [ a0 b0 c0 d0 ]\\n for i = 1 to 4\\n b = a mod 256\\n a = a div 256\\n for h in [ b div 16 b mod 16 ]\\n h += 48\\n if h > 57\\n h += 39\\n .\\n s$ &= strchar h\\n .\\n .\\n .\\n.\\nrepeat\\n s$ = input\\n until error = 1\\n md5 s$ h$\\n print h$\\n.\\ninput_data\\na\\nabc\\nmessage digest\\nabcdefghijklmnopqrstuvwxyz\\nABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\n12345678901234567890123456789012345678901234567890123456789012345678901234567890\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"let fxyz x y z : uint32 = (x &&& y) ||| (~~~x &&& z)\\nlet gxyz x y z : uint32 = (z &&& x) ||| (~~~z &&& y)\\nlet hxyz x y z : uint32 = x ^^^ y ^^^ z\\nlet ixyz x y z : uint32 = y ^^^ (x ||| ~~~z)\\nlet fghi = [ fxyz; gxyz; hxyz; ixyz ] |> List.collect (List.replicate 16)\\nlet g1Idx = id\\nlet g2Idx i = (5 * i + 1) % 16\\nlet g3Idx i = (3 * i + 5) % 16\\nlet g4Idx i = (7 * i) % 16\\n\\nlet gIdxs =\\n [ g1Idx; g2Idx; g3Idx; g4Idx ]\\n |> List.collect (List.replicate 16)\\n |> List.map2 (fun idx func -> func idx) [ 0..63 ]\\n\\nlet s =\\n [ [ 7; 12; 17; 22 ]\\n [ 5; 9; 14; 20 ]\\n [ 4; 11; 16; 23 ]\\n [ 6; 10; 15; 21 ] ]\\n |> List.collect (List.replicate 4)\\n |> List.concat\\n\\nlet k =\\n [ 1...64. ] |> List.map (sin\\n >> abs\\n >> ((*) (2. ** 32.))\\n >> floor\\n >> uint32)\\n\\ntype MD5 =\\n { a : uint32\\n b : uint32\\n c : uint32\\n d : uint32 }\\n\\nlet initialMD5 =\\n { a = 0x67452301u\\n b = 0xefcdab89u\\n c = 0x98badcfeu\\n d = 0x10325476u }\\n\\nlet md5round (msg : uint32 []) { MD5.a = a; MD5.b = b; MD5.c = c; MD5.d = d } i =\\n let rotateL32 r x = (x <<< r) ||| (x >>> (32 - r))\\n let f = fghi.[i] b c d\\n let a' = b + (a + f + k.[i] + msg.[gIdxs.[i]]\\n |> rotateL32 s.[i])\\n { a = d\\n b = a'\\n c = b\\n d = c }\\n\\nlet md5plus m (bs : byte []) =\\n let msg =\\n bs\\n |> Array.chunkBySize 4\\n |> Array.take 16\\n |> Array.map (fun elt -> System.BitConverter.ToUInt32(elt, 0))\\n\\n let m' = List.fold (md5round msg) m [ 0..63 ]\\n { a = m.a + m'.a\\n b = m.b + m'.b\\n c = m.c + m'.c\\n d = m.d + m'.d }\\n\\nlet padMessage (msg : byte []) =\\n let msgLen = Array.length msg\\n let msgLenInBits = (uint64 msgLen) * 8UL\\n\\n let lastSegmentSize =\\n let m = msgLen % 64\\n if m = 0 then 64\\n else m\\n\\n let padLen =\\n 64 - lastSegmentSize + (if lastSegmentSize >= 56 then 64\\n else 0)\\n\\n [| yield 128uy\\n for i in 2..padLen - 8 do\\n yield 0uy\\n for i in 0..7 do\\n yield ((msgLenInBits >>> (8 * i)) |> byte) |]\\n |> Array.append msg\\n\\nlet md5sum (msg : string) =\\n System.Text.Encoding.ASCII.GetBytes msg\\n |> padMessage\\n |> Array.chunkBySize 64\\n |> Array.fold md5plus initialMD5\\n |> (fun { MD5.a = a; MD5.b = b; MD5.c = c; MD5.d = d } ->\\n System.BitConverter.GetBytes a\\n |> (fun x -> System.BitConverter.GetBytes b |> Array.append x)\\n |> (fun x -> System.BitConverter.GetBytes c |> Array.append x)\\n |> (fun x -> System.BitConverter.GetBytes d |> Array.append x))\\n |> Array.map (sprintf \\\"%02X\\\")\\n |> Array.reduce (+)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"' version 19-10-2016\\n' MD5 from the Wikipedia page \\\"MD5\\\"\\n' compile with: fbc -s console\\n\\n' macro for a rotate left\\n#Macro ROtate_Left (x, n) ' rotate left\\n (x) = (x) Shl (n) + (x) Shr (32 - (n))\\n#EndMacro\\n\\nFunction MD5(test_str As String) As String\\n\\n Dim As String message = test_str ' strings are passed as ByRef's\\n\\n Dim As UByte sx, s(0 To ...) = { 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, _\\n 17, 22, 7, 12, 17, 22, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, _\\n 5, 9, 14, 20, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, _\\n 16, 23, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21 }\\n\\n Dim As UInteger<32> K(0 To ...) = { &Hd76aa478, &He8c7b756, &H242070db, _\\n &Hc1bdceee, &Hf57c0faf, &H4787c62a, &Ha8304613, &Hfd469501, &H698098d8, _\\n &H8b44f7af, &Hffff5bb1, &H895cd7be, &H6b901122, &Hfd987193, &Ha679438e, _\\n &H49b40821, &Hf61e2562, &Hc040b340, &H265e5a51, &He9b6c7aa, &Hd62f105d, _\\n &H02441453, &Hd8a1e681, &He7d3fbc8, &H21e1cde6, &Hc33707d6, &Hf4d50d87, _\\n &H455a14ed, &Ha9e3e905, &Hfcefa3f8, &H676f02d9, &H8d2a4c8a, &Hfffa3942, _\\n &H8771f681, &H6d9d6122, &Hfde5380c, &Ha4beea44, &H4bdecfa9, &Hf6bb4b60, _\\n &Hbebfbc70, &H289b7ec6, &Heaa127fa, &Hd4ef3085, &H04881d05, &Hd9d4d039, _\\n &He6db99e5, &H1fa27cf8, &Hc4ac5665, &Hf4292244, &H432aff97, &Hab9423a7, _\\n &Hfc93a039, &H655b59c3, &H8f0ccc92, &Hffeff47d, &H85845dd1, &H6fa87e4f, _\\n &Hfe2ce6e0, &Ha3014314, &H4e0811a1, &Hf7537e82, &Hbd3af235, &H2ad7d2bb, _\\n &Heb86d391 }\\n\\n ' Initialize variables\\n Dim As UInteger<32> A, a0 = &H67452301\\n Dim As UInteger<32> B, b0 = &Hefcdab89\\n Dim As UInteger<32> C, c0 = &H98badcfe\\n Dim As UInteger<32> D, d0 = &H10325476\\n Dim As UInteger<32> dtemp, F, g, temp\\n\\n Dim As Long i, j\\n\\n Dim As ULongInt l = Len(message)\\n ' set the first bit after the message to 1\\n message = message + Chr(1 Shl 7)\\n ' add one char to the length\\n Dim As ULong padding = 64 - ((l +1) Mod (512 \\\\ 8)) ' 512 \\\\ 8 = 64 char.\\n\\n ' check if we have enough room for inserting the length\\n If padding < 8 Then padding = padding + 64\\n\\n message = message + String(padding, Chr(0)) ' adjust length\\n Dim As ULong l1 = Len(message) ' new length\\n\\n l = l * 8 ' orignal length in bits\\n ' create ubyte ptr to point to l ( = length in bits)\\n Dim As UByte Ptr ub_ptr = Cast(UByte Ptr, @l)\\n\\n For i = 0 To 7 'copy length of message to the last 8 bytes\\n message[l1 -8 + i] = ub_ptr[i]\\n Next\\n\\n For j = 0 To (l1 -1) \\\\ 64 ' split into block of 64 bytes\\n\\n A = a0 : B = b0 : C = c0 : D = d0\\n\\n ' break chunk into 16 32bit uinteger\\n Dim As UInteger<32> Ptr M = Cast(UInteger<32> Ptr, @message[j * 64])\\n\\n For i = 0 To 63\\n Select Case As Const i\\n Case 0 To 15\\n F = (B And C) Or ((Not B) And D)\\n g = i\\n Case 16 To 31\\n F = (B And D) Or (C And (Not D))\\n g = (i * 5 +1) Mod 16\\n Case 32 To 47\\n F = (B Xor C Xor D)\\n g = (i * 3 +5) Mod 16\\n Case 48 To 63\\n F = C Xor (B Or (Not D))\\n g = (i * 7) Mod 16\\n End Select\\n dtemp = D\\n D = C\\n C = B\\n temp = A + F + K(i)+ M[g] : ROtate_left(temp, s(i))\\n B = B + temp\\n A = dtemp\\n Next\\n\\n a0 += A : b0 += B : c0 += C : d0 += D\\n\\n Next\\n\\n Dim As String answer\\n ' convert a0, b0, c0 and d0 in hex, then add, low order first\\n Dim As String s1 = Hex(a0, 8)\\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\\n s1 = Hex(b0, 8)\\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\\n s1 = Hex(c0, 8)\\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\\n s1 = Hex(d0, 8)\\n For i = 7 To 1 Step -2 : answer +=Mid(s1, i, 2) : Next\\n\\nReturn LCase(answer)\\n\\nEnd Function\\n\\n\\n' ------=< MAIN >=------\\n\\nDim As String test, hash, md5_hash\\nDim As ULong i\\n\\nFor i = 1 To 7\\n Read hash, test\\n md5_hash = MD5(test)\\n\\n Print\\n Print test\\n Print hash\\n Print md5_hash;\\n\\n If hash = md5_hash Then\\n Print \\\" PASS\\\"\\n Else\\n Print \\\" FAIL\\\"\\n Beep\\n End If\\n\\nNext\\n\\n' testdata\\nData \\\"d41d8cd98f00b204e9800998ecf8427e\\\", \\\"\\\"\\nData \\\"0cc175b9c0f1b6a831c399e269772661\\\", \\\"a\\\"\\nData \\\"900150983cd24fb0d6963f7d28e17f72\\\", \\\"abc\\\"\\nData \\\"f96b697d7cb7938d525a2f31aaf161d0\\\", \\\"message digest\\\"\\nData \\\"c3fcd3d76192e4007dfb496cca67e13b\\\", \\\"abcdefghijklmnopqrstuvwxyz\\\"\\nData \\\"d174ab98d277d9f5a5611c2c9f419d9f\\\"\\nData \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"\\nData \\\"57edf4a22be3c955ac49da2e2107b67a\\\"\\nData \\\"123456789012345678901234567890123456789012345678901234567890\\\" _\\n + \\\"12345678901234567890\\\"\\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\\\"\\n \\\"bytes\\\"\\n \\\"encoding/binary\\\"\\n)\\n\\ntype testCase struct {\\n hashCode string\\n string\\n}\\n\\nvar testCases = []testCase{\\n {\\\"d41d8cd98f00b204e9800998ecf8427e\\\", \\\"\\\"},\\n {\\\"0cc175b9c0f1b6a831c399e269772661\\\", \\\"a\\\"},\\n {\\\"900150983cd24fb0d6963f7d28e17f72\\\", \\\"abc\\\"},\\n {\\\"f96b697d7cb7938d525a2f31aaf161d0\\\", \\\"message digest\\\"},\\n {\\\"c3fcd3d76192e4007dfb496cca67e13b\\\", \\\"abcdefghijklmnopqrstuvwxyz\\\"},\\n {\\\"d174ab98d277d9f5a5611c2c9f419d9f\\\",\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"},\\n {\\\"57edf4a22be3c955ac49da2e2107b67a\\\", \\\"12345678901234567890\\\" +\\n \\\"123456789012345678901234567890123456789012345678901234567890\\\"},\\n}\\n\\nfunc main() {\\n for _, tc := range testCases {\\n fmt.Printf(\\\"%s\\\\n%x\\\\n\\\\n\\\", tc.hashCode, md5(tc.string))\\n }\\n}\\n\\nvar shift = [...]uint{7, 12, 17, 22, 5, 9, 14, 20, 4, 11, 16, 23, 6, 10, 15, 21}\\nvar table [64]uint32\\n\\nfunc init() {\\n for i := range table {\\n table[i] = uint32((1 << 32) * math.Abs(math.Sin(float64(i + 1))))\\n }\\n}\\n\\nfunc md5(s string) (r [16]byte) {\\n padded := bytes.NewBuffer([]byte(s))\\n padded.WriteByte(0x80)\\n for padded.Len() % 64 != 56 {\\n padded.WriteByte(0)\\n }\\n messageLenBits := uint64(len(s)) * 8\\n binary.Write(padded, binary.LittleEndian, messageLenBits)\\n\\n var a, b, c, d uint32 = 0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476\\n var buffer [16]uint32\\n for binary.Read(padded, binary.LittleEndian, buffer[:]) == nil { // read every 64 bytes\\n a1, b1, c1, d1 := a, b, c, d\\n for j := 0; j < 64; j++ {\\n var f uint32\\n bufferIndex := j\\n round := j >> 4\\n switch round {\\n case 0:\\n f = (b1 & c1) | (^b1 & d1)\\n case 1:\\n f = (b1 & d1) | (c1 & ^d1)\\n bufferIndex = (bufferIndex*5 + 1) & 0x0F\\n case 2:\\n f = b1 ^ c1 ^ d1\\n bufferIndex = (bufferIndex*3 + 5) & 0x0F\\n case 3:\\n f = c1 ^ (b1 | ^d1)\\n bufferIndex = (bufferIndex * 7) & 0x0F\\n }\\n sa := shift[(round<<2)|(j&3)]\\n a1 += f + buffer[bufferIndex] + table[j]\\n a1, d1, c1, b1 = d1, c1, b1, a1<<sa|a1>>(32-sa)+b1\\n }\\n a, b, c, d = a+a1, b+b1, c+c1, d+d1\\n }\\n\\n binary.Write(bytes.NewBuffer(r[:0]), binary.LittleEndian, []uint32{a, b, c, d})\\n return\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"class MD5 {\\n\\n private static final int INIT_A = 0x67452301\\n private static final int INIT_B = (int)0xEFCDAB89L\\n private static final int INIT_C = (int)0x98BADCFEL\\n private static final int INIT_D = 0x10325476\\n\\n private static final int[] SHIFT_AMTS = [\\n 7, 12, 17, 22,\\n 5, 9, 14, 20,\\n 4, 11, 16, 23,\\n 6, 10, 15, 21\\n ]\\n\\n private static final int[] TABLE_T = new int[64]\\n static\\n {\\n for (int i in 0..63)\\n TABLE_T[i] = (int)(long)((1L << 32) * Math.abs(Math.sin(i + 1)))\\n }\\n\\n static byte[] computeMD5(byte[] message)\\n {\\n int messageLenBytes = message.length\\n int numBlocks = ((messageLenBytes + 8) >>> 6) + 1\\n int totalLen = numBlocks << 6\\n byte[] paddingBytes = new byte[totalLen - messageLenBytes]\\n paddingBytes[0] = (byte)0x80\\n\\n long messageLenBits = (long)messageLenBytes << 3\\n for (int i in 0..7)\\n {\\n paddingBytes[paddingBytes.length - 8 + i] = (byte)messageLenBits\\n messageLenBits >>>= 8\\n }\\n\\n int a = INIT_A\\n int b = INIT_B\\n int c = INIT_C\\n int d = INIT_D\\n int[] buffer = new int[16]\\n for (int i in 0..(numBlocks - 1))\\n {\\n int index = i << 6\\n for (int j in 0..63) {\\n buffer[j >>> 2] = ((int) ((index < messageLenBytes) ? message[index] : paddingBytes[index - messageLenBytes]) << 24) | (buffer[j >>> 2] >>> 8)\\n index++\\n }\\n int originalA = a\\n int originalB = b\\n int originalC = c\\n int originalD = d\\n for (int j in 0..63)\\n {\\n int div16 = j >>> 4\\n int f = 0\\n int bufferIndex = j\\n switch (div16)\\n {\\n case 0:\\n f = (b & c) | (~b & d)\\n break\\n\\n case 1:\\n f = (b & d) | (c & ~d)\\n bufferIndex = (bufferIndex * 5 + 1) & 0x0F\\n break\\n\\n case 2:\\n f = b ^ c ^ d\\n bufferIndex = (bufferIndex * 3 + 5) & 0x0F\\n break\\n\\n case 3:\\n f = c ^ (b | ~d)\\n bufferIndex = (bufferIndex * 7) & 0x0F\\n break\\n }\\n int temp = b + Integer.rotateLeft(a + f + buffer[bufferIndex] + TABLE_T[j], SHIFT_AMTS[(div16 << 2) | (j & 3)])\\n a = d\\n d = c\\n c = b\\n b = temp\\n }\\n\\n a += originalA\\n b += originalB\\n c += originalC\\n d += originalD\\n }\\n\\n byte[] md5 = new byte[16]\\n int count = 0\\n for (int i in 0..3)\\n {\\n int n = (i == 0) ? a : ((i == 1) ? b : ((i == 2) ? c : d))\\n for (int j in 0..3)\\n {\\n md5[count++] = (byte)n\\n n >>>= 8\\n }\\n }\\n return md5\\n }\\n\\n static String toHexString(byte[] b)\\n {\\n StringBuilder sb = new StringBuilder()\\n for (int i in 0..(b.length - 1))\\n {\\n sb.append(String.format(\\\"%02X\\\", b[i] & 0xFF))\\n }\\n return sb.toString()\\n }\\n\\n static void main(String[] args)\\n {\\n String[] testStrings = [\\\"\\\", \\\"a\\\", \\\"abc\\\", \\\"message digest\\\", \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\",\\n \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\" ]\\n for (String s : testStrings)\\n System.out.println(\\\"0x\\\" + toHexString(computeMD5(s.getBytes())) + \\\" <== \\\\\\\"\\\" + s + \\\"\\\\\\\"\\\")\\n }\\n\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Control.Monad (replicateM)\\n\\nimport qualified Data.ByteString.Lazy as BL\\nimport qualified Data.ByteString.Lazy.Char8 as BLC\\nimport Data.Binary.Get\\nimport Data.Binary.Put\\nimport Data.Bits\\n\\nimport Data.Array (Array, listArray, (!))\\nimport Data.List (foldl)\\nimport Data.Word (Word32)\\n\\nimport Numeric (showHex)\\n\\n\\n-- functions\\ntype Fun = Word32 -> Word32 -> Word32 -> Word32\\n\\nfunF, funG, funH, funI :: Fun\\nfunF x y z = (x .&. y) .|. (complement x .&. z)\\nfunG x y z = (x .&. z) .|. (complement z .&. y)\\nfunH x y z = x `xor` y `xor` z\\nfunI x y z = y `xor` (complement z .|. x)\\n\\nidxF, idxG, idxH, idxI :: Int -> Int\\nidxF i = i\\nidxG i = (5 * i + 1) `mod` 16\\nidxH i = (3 * i + 5) `mod` 16\\nidxI i = 7 * i `mod` 16\\n\\n\\n-- arrays\\nfunA :: Array Int Fun\\nfunA = listArray (1,64) $ replicate 16 =<< [funF, funG, funH, funI]\\n\\nidxA :: Array Int Int\\nidxA = listArray (1,64) $ zipWith ($) (replicate 16 =<< [idxF, idxG, idxH, idxI]) [0..63]\\n\\nrotA :: Array Int Int\\nrotA = listArray (1,64) $ concat . replicate 4 =<<\\n [[7, 12, 17, 22], [5, 9, 14, 20], [4, 11, 16, 23], [6, 10, 15, 21]]\\n\\nsinA :: Array Int Word32\\nsinA = listArray (1,64) $ map (floor . (*mult) . abs . sin) [1..64]\\n where mult = 2 ** 32 :: Double\\n\\n\\n-- to lazily calculate MD5 sum for standart input:\\n-- main = putStrLn . md5sum =<< BL.getContents\\n\\nmain :: IO ()\\nmain = mapM_ (putStrLn . md5sum . BLC.pack)\\n [ \\\"\\\"\\n , \\\"a\\\"\\n , \\\"abc\\\"\\n , \\\"message digest\\\"\\n , \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n , \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"\\n , \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"\\n ]\\n\\n\\nmd5sum :: BL.ByteString -> String\\nmd5sum input =\\n let MD5 a b c d = getMD5 initial `runGet` input\\n in foldr hex [] . BL.unpack . runPut $ mapM_ putWord32le [a,b,c,d]\\n where\\n initial = MD5 0x67452301 0xEFCDAB89 0x98BADCFE 0x10325476\\n\\n hex x s | x < 16 = '0' : showHex x s -- quick hack: like \\\"%02x\\\"\\n | otherwise = showHex x s\\n\\n\\ndata MD5 = MD5\\n { a :: {-# UNPACK #-} !Word32\\n , b :: {-# UNPACK #-} !Word32\\n , c :: {-# UNPACK #-} !Word32\\n , d :: {-# UNPACK #-} !Word32\\n }\\n\\n\\ngetMD5 :: MD5 -> Get MD5\\ngetMD5 md5 = do\\n chunk <- getLazyByteString 64\\n let len = BL.length chunk\\n\\n if len == 64\\n then getMD5 $! md5 <+> chunk -- apply and process next chunk\\n\\n else do -- input is totally eaten, finalize\\n bytes <- bytesRead\\n let fin = runPut . putWord64le $ fromIntegral (bytes - 64 + len) * 8\\n pad n = chunk `BL.append` (0x80 `BL.cons` BL.replicate (n - 1) 0x00)\\n\\n return $ if len >= 56\\n then md5 <+> pad (64 - len) <+> BL.replicate 56 0x00 `BL.append` fin\\n else md5 <+> pad (56 - len) `BL.append` fin\\n\\n\\n(<+>) :: MD5 -> BL.ByteString -> MD5\\ninfixl 5 <+>\\nmd5@(MD5 a b c d) <+> bs =\\n let datA = listArray (0,15) $ replicateM 16 getWord32le `runGet` bs\\n MD5 a' b' c' d' = foldl' (md5round datA) md5 [1..64]\\n in MD5 (a + a') (b + b') (c + c') (d + d')\\n\\n\\nmd5round :: Array Int Word32 -> MD5 -> Int -> MD5\\nmd5round datA (MD5 a b c d) i =\\n let f = funA ! i\\n w = datA ! (idxA ! i)\\n a' = b + (a + f b c d + w + sinA ! i) `rotateL` rotA ! i\\n in MD5 d a' b c\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main() # validate against the RFC test strings and more\\n testMD5(\\\"The quick brown fox jumps over the lazy dog\\\", 16r9e107d9d372bb6826bd81d3542a419d6)\\n testMD5(\\\"The quick brown fox jumps over the lazy dog.\\\", 16re4d909c290d0fb1ca068ffaddf22cbd0)\\n testMD5(\\\"\\\", 16rd41d8cd98f00b204e9800998ecf8427e) #R = MD5 test suite from RFC\\n testMD5(\\\"a\\\", 16r0cc175b9c0f1b6a831c399e269772661) #R\\n testMD5(\\\"abc\\\", 16r900150983cd24fb0d6963f7d28e17f72) #R\\n testMD5(\\\"message digest\\\", 16rf96b697d7cb7938d525a2f31aaf161d0) #R\\n testMD5(\\\"abcdefghijklmnopqrstuvwxyz\\\", 16rc3fcd3d76192e4007dfb496cca67e13b) #R\\n testMD5(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\", 16rd174ab98d277d9f5a5611c2c9f419d9f) #R\\n testMD5(\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\", 16r57edf4a22be3c955ac49da2e2107b67a) #R\\nend\\n\\nprocedure testMD5(s,rh) # compute the MD5 hash and compare it to reference value\\n write(\\\"Message(length=\\\",*s,\\\") = \\\",image(s))\\n write(\\\"Digest = \\\",hexstring(h := MD5(s)),if h = rh then \\\" matches reference hash\\\" else (\\\" does not match reference hash = \\\" || hexstring(rh)),\\\"\\\\n\\\")\\nend\\n\\nlink hexcvt # for testMD5\\n\\n$define B32 4 # 32 bits\\n$define B64 8 # 64 bits in bytes\\n$define B512 64 # 512 bits in bytes\\n$define M32 16r100000000 # 2^32\\n$define M64 16r10000000000000000 # 2^64\\n\\nprocedure MD5(s) #: return MD5 hash of message s\\nlocal w,a,b,c,d,i,t,m\\nlocal mlength,message,hash\\nstatic rs,ks,istate,maxpad,g\\n\\ninitial {\\n every (rs := []) |||:=\\n (t := [ 7, 12, 17, 22] | [ 5, 9, 14, 20] | [ 4, 11, 16, 23] | [ 6, 10, 15, 21]) ||| t ||| t ||| t\\n every put(ks := [],integer(M32 * abs(sin(i := 1 to 64))))\\n istate := [ 16r67452301, 16rEFCDAB89, 16r98BADCFE, 16r10325476 ] # \\\"Magic\\\" IV\\n maxpad := left(char(16r80),B512+B64,char(16r00)) # maximum possible padding\\n g := []\\n every i := 0 to 63 do # precompute offsets\\n case round := i/16 of {\\n 0 : put(g,i + 1)\\n 1 : put(g,(5*i+1) % 16 + 1)\\n\\t 2 : put(g,(3*i+5) % 16 + 1)\\n 3 : put(g,(7*i) % 16 + 1)\\n }\\n if not (*rs = *ks = 64) then runerr(500,\\\"MD5 setup error\\\")\\n }\\n # 1. Construct prefix\\n t := (*s*8)%M64 # original message length\\n s ||:= maxpad # append maximum padding\\n s[0-:*s%B512] := \\\"\\\" # trim to final length\\n s[0-:B64] := reverse(unsigned2string(t,B64) ) # as little endian length\\n\\n message := [] # 2. Subdivide message\\n s ? while put(message,move(B512)) # into 512 bit blocks\\n\\n # 3. Transform message ...\\n state := copy(istate) # Initialize hashes\\n every m := !message do { # For each message block\\n w := []\\n m ? while put(w,unsigned(reverse(move(B32)))) # break into little-endian words\\n\\n a := state[1] # pick up hashes\\n b := state[2]\\n c := state[3]\\n d := state[4]\\n\\n every i := 1 to 64 do { # Process 4 rounds of hashes\\t\\n case round := (i-1)/16 of {\\n\\t 0 : a +:= ixor(d, iand(b,ixor(c,d))) # 0..15 - alternate F\\n 1 : a +:= ixor(c,iand(d,ixor(b,c))) # 16..31 - alternate G\\t\\n 2 : a +:= ixor(b,ixor(c,d)) # 32..47 - H\\n 3 : a +:= ixor(c,ior(b,ixor(d,16rffffffff))) # 48..64 - alternate I\\n\\t } # Core of FF, GG, HH, II\\n a +:= ks[i] + w[g[i]] # and the rest\\n a %:= M32\\n a := ior( ishift(a,rs[i]), ishift(a,-(32-rs[i]))) # 32bit rotate\\n a +:= b\\n a :=: b :=: c :=: d # rotate variables\\n\\t }\\n\\n state[1] +:= a # Add back new hashes\\n state[2] +:= b\\n state[3] +:= c\\n state[4] +:= d\\n every !state %:= M32 # mod 2^32\\n }\\n every (hash := \\\"\\\") ||:= reverse(unsigned2string(!state,4)) # little-endian digest\\n return unsigned(hash)\\nend\\n\\nprocedure unsigned2string(i,w) # uint to string pad to w bytes\\nlocal s\\n if i < 0 then runerr(500,i)\\n s := \\\"\\\"\\n while (0 < i) | (*s < \\\\w) do {\\n s ||:= char(i % 256)\\n i /:= 256\\n }\\n return reverse(s)\\nend\\n\\nlink unsigned # string to unsigned integer\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"NB. convert/misc/md5\\nNB. RSA Data Security, Inc. MD5 Message-Digest Algorithm\\nNB. version: 1.0.2\\nNB.\\nNB. See RFC 1321 for license details\\nNB. J implementation -- (C) 2003 Oleg Kobchenko;\\nNB.\\nNB. 09/04/2003 Oleg Kobchenko\\nNB. 03/31/2007 Oleg Kobchenko j601, JAL\\nNB. 12/17/2015 G.Pruss 64-bit\\nNB. ~60+ times slower than using the jqt library\\n\\nrequire 'convert'\\ncoclass 'pcrypt'\\n\\nNB. lt= (*. -.)~ gt= *. -. ge= +. -. xor= ~:\\n'`lt gt ge xor'=: (20 b.)`(18 b.)`(27 b.)`(22 b.)\\n'`and or sh'=: (17 b.)`(23 b.)`(33 b.)\\n\\n3 : 0 ''\\nif. IF64 do.\\nrot=: (16bffffffff and sh or ] sh~ 32 -~ [) NB. (y << x) | (y >>> (32 - x))\\nadd=: ((16bffffffff&and)@+)\\\"0\\nelse.\\nrot=: (32 b.)\\nadd=: (+&(_16&sh) (16&sh@(+ _16&sh) or and&65535@]) +&(and&65535))\\\"0\\nend.\\nEMPTY\\n)\\n\\nhexlist=: tolower@:,@:hfd@:,@:(|.\\\"1)@(256 256 256 256&#:)\\n\\ncmn=: 4 : 0\\n'x s t'=. x [ 'q a b'=. y\\nb add s rot (a add q) add (x add t)\\n)\\n\\nff=: cmn (((1&{ and 2&{) or 1&{ lt 3&{) , 2&{.)\\ngg=: cmn (((1&{ and 3&{) or 2&{ gt 3&{) , 2&{.)\\nhh=: cmn (((1&{ xor 2&{)xor 3&{ ) , 2&{.)\\nii=: cmn (( 2&{ xor 1&{ ge 3&{ ) , 2&{.)\\nop=: ff`gg`hh`ii\\n\\nI=: \\\".;._2(0 : 0)\\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15\\n1 6 11 0 5 10 15 4 9 14 3 8 13 2 7 12\\n5 8 11 14 1 4 7 10 13 0 3 6 9 12 15 2\\n0 7 14 5 12 3 10 1 8 15 6 13 4 11 2 9\\n)\\nS=: 4 4$7 12 17 22 5 9 14 20 4 11 16 23 6 10 15 21\\n\\nT=: |:\\\".;._2(0 : 0)\\n _680876936 _165796510 _378558 _198630844\\n _389564586 _1069501632 _2022574463 1126891415\\n 606105819 643717713 1839030562 _1416354905\\n_1044525330 _373897302 _35309556 _57434055\\n _176418897 _701558691 _1530992060 1700485571\\n 1200080426 38016083 1272893353 _1894986606\\n_1473231341 _660478335 _155497632 _1051523\\n _45705983 _405537848 _1094730640 _2054922799\\n 1770035416 568446438 681279174 1873313359\\n_1958414417 _1019803690 _358537222 _30611744\\n _42063 _187363961 _722521979 _1560198380\\n_1990404162 1163531501 76029189 1309151649\\n 1804603682 _1444681467 _640364487 _145523070\\n _40341101 _51403784 _421815835 _1120210379\\n_1502002290 1735328473 530742520 718787259\\n 1236535329 _1926607734 _995338651 _343485551\\n)\\n\\nnorm=: 3 : 0\\nn=. 16 * 1 + _6 sh 8 + #y\\nb=. n#0 [ y=. a.i.y\\nfor_i. i. #y do.\\n b=. ((j { b) or (8*4|i) sh i{y) (j=. _2 sh i) } b\\nend.\\nb=. ((j { b) or (8*4|i) sh 128) (j=._2 sh i=.#y) } b\\n_16]\\\\ (8 * #y) (n-2) } b\\n)\\n\\nNB.*md5 v MD5 Message-Digest Algorithm\\nNB. diagest=. md5 message\\nmd5=: 3 : 0\\nX=. norm y\\nq=. r=. 1732584193 _271733879 _1732584194 271733878\\nfor_x. X do.\\n for_j. i.4 do.\\n l=. ((j{I){x) ,. (16$j{S) ,. j{T\\n for_i. i.16 do.\\n r=. _1|.((i{l) (op@.j) r),}.r\\n end.\\n end.\\n q=. r=. r add q\\nend.\\nhexlist r\\n)\\n\\nmd5_z_=: md5_pcrypt_\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" md5''\\nd41d8cd98f00b204e9800998ecf8427e\\n md5'a'\\n0cc175b9c0f1b6a831c399e269772661\\n md5'abc'\\n900150983cd24fb0d6963f7d28e17f72\\n md5'message digest'\\nf96b697d7cb7938d525a2f31aaf161d0\\n md5'abcdefghijklmnopqrstuvwxyz'\\nc3fcd3d76192e4007dfb496cca67e13b\\n md5'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'\\nd174ab98d277d9f5a5611c2c9f419d9f\\n md5'12345678901234567890123456789012345678901234567890123456789012345678901234567890'\\n57edf4a22be3c955ac49da2e2107b67a\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"class MD5\\n{\\n\\n private static final int INIT_A = 0x67452301;\\n private static final int INIT_B = (int)0xEFCDAB89L;\\n private static final int INIT_C = (int)0x98BADCFEL;\\n private static final int INIT_D = 0x10325476;\\n\\n private static final int[] SHIFT_AMTS = {\\n 7, 12, 17, 22,\\n 5, 9, 14, 20,\\n 4, 11, 16, 23,\\n 6, 10, 15, 21\\n };\\n\\n private static final int[] TABLE_T = new int[64];\\n static\\n {\\n for (int i = 0; i < 64; i++)\\n TABLE_T[i] = (int)(long)((1L << 32) * Math.abs(Math.sin(i + 1)));\\n }\\n\\n public static byte[] computeMD5(byte[] message)\\n {\\n int messageLenBytes = message.length;\\n int numBlocks = ((messageLenBytes + 8) >>> 6) + 1;\\n int totalLen = numBlocks << 6;\\n byte[] paddingBytes = new byte[totalLen - messageLenBytes];\\n paddingBytes[0] = (byte)0x80;\\n\\n long messageLenBits = (long)messageLenBytes << 3;\\n for (int i = 0; i < 8; i++)\\n {\\n paddingBytes[paddingBytes.length - 8 + i] = (byte)messageLenBits;\\n messageLenBits >>>= 8;\\n }\\n\\n int a = INIT_A;\\n int b = INIT_B;\\n int c = INIT_C;\\n int d = INIT_D;\\n int[] buffer = new int[16];\\n for (int i = 0; i < numBlocks; i ++)\\n {\\n int index = i << 6;\\n for (int j = 0; j < 64; j++, index++)\\n buffer[j >>> 2] = ((int)((index < messageLenBytes) ? message[index] : paddingBytes[index - messageLenBytes]) << 24) | (buffer[j >>> 2] >>> 8);\\n int originalA = a;\\n int originalB = b;\\n int originalC = c;\\n int originalD = d;\\n for (int j = 0; j < 64; j++)\\n {\\n int div16 = j >>> 4;\\n int f = 0;\\n int bufferIndex = j;\\n switch (div16)\\n {\\n case 0:\\n f = (b & c) | (~b & d);\\n break;\\n\\n case 1:\\n f = (b & d) | (c & ~d);\\n bufferIndex = (bufferIndex * 5 + 1) & 0x0F;\\n break;\\n\\n case 2:\\n f = b ^ c ^ d;\\n bufferIndex = (bufferIndex * 3 + 5) & 0x0F;\\n break;\\n\\n case 3:\\n f = c ^ (b | ~d);\\n bufferIndex = (bufferIndex * 7) & 0x0F;\\n break;\\n }\\n int temp = b + Integer.rotateLeft(a + f + buffer[bufferIndex] + TABLE_T[j], SHIFT_AMTS[(div16 << 2) | (j & 3)]);\\n a = d;\\n d = c;\\n c = b;\\n b = temp;\\n }\\n\\n a += originalA;\\n b += originalB;\\n c += originalC;\\n d += originalD;\\n }\\n\\n byte[] md5 = new byte[16];\\n int count = 0;\\n for (int i = 0; i < 4; i++)\\n {\\n int n = (i == 0) ? a : ((i == 1) ? b : ((i == 2) ? c : d));\\n for (int j = 0; j < 4; j++)\\n {\\n md5[count++] = (byte)n;\\n n >>>= 8;\\n }\\n }\\n return md5;\\n }\\n\\n public static String toHexString(byte[] b)\\n {\\n StringBuilder sb = new StringBuilder();\\n for (int i = 0; i < b.length; i++)\\n {\\n sb.append(String.format(\\\"%02X\\\", b[i] & 0xFF));\\n }\\n return sb.toString();\\n }\\n\\n public static void main(String[] args)\\n {\\n String[] testStrings = { \\\"\\\", \\\"a\\\", \\\"abc\\\", \\\"message digest\\\", \\\"abcdefghijklmnopqrstuvwxyz\\\", \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\", \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\" };\\n for (String s : testStrings)\\n System.out.println(\\\"0x\\\" + toHexString(computeMD5(s.getBytes())) + \\\" <== \\\\\\\"\\\" + s + \\\"\\\\\\\"\\\");\\n return;\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.nio.ByteBuffer;\\nimport java.nio.ByteOrder;\\n\\nclass MD5\\n{\\n\\n private static final int INIT_A = 0x67452301;\\n private static final int INIT_B = (int)0xEFCDAB89L;\\n private static final int INIT_C = (int)0x98BADCFEL;\\n private static final int INIT_D = 0x10325476;\\n\\n private static final int[] SHIFT_AMTS = {\\n 7, 12, 17, 22,\\n 5, 9, 14, 20,\\n 4, 11, 16, 23,\\n 6, 10, 15, 21\\n };\\n\\n private static final int[] TABLE_T = new int[64];\\n static\\n {\\n for (int i = 0; i < 64; i++)\\n TABLE_T[i] = (int)(long)((1L << 32) * Math.abs(Math.sin(i + 1)));\\n }\\n\\n public static byte[] computeMD5(byte[] message)\\n {\\n ByteBuffer padded = ByteBuffer.allocate((((message.length + 8) / 64) + 1) * 64).order(ByteOrder.LITTLE_ENDIAN);\\n padded.put(message);\\n padded.put((byte)0x80);\\n long messageLenBits = (long)message.length * 8;\\n padded.putLong(padded.capacity() - 8, messageLenBits);\\n\\n padded.rewind();\\n\\n int a = INIT_A;\\n int b = INIT_B;\\n int c = INIT_C;\\n int d = INIT_D;\\n while (padded.hasRemaining()) {\\n // obtain a slice of the buffer from the current position,\\n // and view it as an array of 32-bit ints\\n IntBuffer chunk = padded.slice().order(ByteOrder.LITTLE_ENDIAN).asIntBuffer();\\n int originalA = a;\\n int originalB = b;\\n int originalC = c;\\n int originalD = d;\\n for (int j = 0; j < 64; j++)\\n {\\n int div16 = j >>> 4;\\n int f = 0;\\n int bufferIndex = j;\\n switch (div16)\\n {\\n case 0:\\n f = (b & c) | (~b & d);\\n break;\\n\\n case 1:\\n f = (b & d) | (c & ~d);\\n bufferIndex = (bufferIndex * 5 + 1) & 0x0F;\\n break;\\n\\n case 2:\\n f = b ^ c ^ d;\\n bufferIndex = (bufferIndex * 3 + 5) & 0x0F;\\n break;\\n\\n case 3:\\n f = c ^ (b | ~d);\\n bufferIndex = (bufferIndex * 7) & 0x0F;\\n break;\\n }\\n int temp = b + Integer.rotateLeft(a + f + chunk.get(bufferIndex) + TABLE_T[j], SHIFT_AMTS[(div16 << 2) | (j & 3)]);\\n a = d;\\n d = c;\\n c = b;\\n b = temp;\\n }\\n\\n a += originalA;\\n b += originalB;\\n c += originalC;\\n d += originalD;\\n padded.position(padded.position() + 64);\\n }\\n\\n ByteBuffer md5 = ByteBuffer.allocate(16).order(ByteOrder.LITTLE_ENDIAN);\\n for (int n : new int[]{a, b, c, d})\\n {\\n md5.putInt(n);\\n }\\n return md5.array();\\n }\\n\\n public static String toHexString(byte[] b)\\n {\\n StringBuilder sb = new StringBuilder();\\n for (int i = 0; i < b.length; i++)\\n {\\n sb.append(String.format(\\\"%02X\\\", b[i] & 0xFF));\\n }\\n return sb.toString();\\n }\\n\\n public static void main(String[] args)\\n {\\n String[] testStrings = { \\\"\\\", \\\"a\\\", \\\"abc\\\", \\\"message digest\\\", \\\"abcdefghijklmnopqrstuvwxyz\\\", \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\", \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\" };\\n for (String s : testStrings)\\n System.out.println(\\\"0x\\\" + toHexString(computeMD5(s.getBytes())) + \\\" <== \\\\\\\"\\\" + s + \\\"\\\\\\\"\\\");\\n return;\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# a rather literal translation of the pseudocode at https://en.wikipedia.org/wiki/MD5\\n\\nconst s = UInt32[7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21]\\n\\nconst K = UInt32[0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, 0xf57c0faf,\\n 0x4787c62a, 0xa8304613, 0xfd469501, 0x698098d8, 0x8b44f7af, 0xffff5bb1,\\n 0x895cd7be, 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821, 0xf61e2562,\\n 0xc040b340, 0x265e5a51, 0xe9b6c7aa, 0xd62f105d, 0x02441453, 0xd8a1e681,\\n 0xe7d3fbc8, 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed, 0xa9e3e905,\\n 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a, 0xfffa3942, 0x8771f681, 0x6d9d6122,\\n 0xfde5380c, 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70, 0x289b7ec6,\\n 0xeaa127fa, 0xd4ef3085, 0x04881d05, 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8,\\n 0xc4ac5665, 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, 0x655b59c3,\\n 0x8f0ccc92, 0xffeff47d, 0x85845dd1, 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314,\\n 0x4e0811a1, 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391]\\n\\nfunction md5(msgbytes)\\n a0::UInt32 = 0x67452301 # A\\n b0::UInt32 = 0xefcdab89 # B\\n c0::UInt32 = 0x98badcfe # C\\n d0::UInt32 = 0x10325476 # D\\n\\n oldlen = length(msgbytes)\\n umsg = push!([UInt8(b) for b in msgbytes], UInt8(0x80))\\n while length(umsg) % 64 != 56\\n push!(umsg, UInt8(0))\\n end\\n append!(umsg, reinterpret(UInt8, [htol(UInt64(oldlen) * 8)]))\\n\\n for j in 1:64:length(umsg)-1\\n arr = view(umsg, j:j+63)\\n M = [reinterpret(UInt32, arr[k:k+3])[1] for k in 1:4:62]\\n A = a0\\n B = b0\\n C = c0\\n D = d0\\n\\n for i in 0:63\\n if 0 ≤ i ≤ 15\\n F = D ⊻ (B & (C ⊻ D))\\n g = i\\n elseif 16 ≤ i ≤ 31\\n F = C ⊻ (D & (B ⊻ C))\\n g = (5 * i + 1) % 16\\n elseif 32 ≤ i ≤ 47\\n F = B ⊻ C ⊻ D\\n g = (3 * i + 5) % 16\\n elseif 48 ≤ i ≤ 63\\n F = C ⊻ (B | (~D))\\n g = (7 * i) % 16\\n end\\n F += A + K[i+1] + M[g+1]\\n A = D\\n D = C\\n C = B\\n B += ((F) << s[i+1]) | (F >> (32 - s[i+1]))\\n end\\n\\n a0 += A\\n b0 += B\\n c0 += C\\n d0 += D\\n end\\n digest = join(map(x -> lpad(string(x, base=16), 2, '0'), reinterpret(UInt8, [a0, b0, c0, d0])), \\\"\\\") # Output is in little-endian\\nend\\n\\nfor pair in [0xd41d8cd98f00b204e9800998ecf8427e => \\\"\\\", 0x0cc175b9c0f1b6a831c399e269772661 => \\\"a\\\",\\n 0x900150983cd24fb0d6963f7d28e17f72 => \\\"abc\\\", 0xf96b697d7cb7938d525a2f31aaf161d0 => \\\"message digest\\\",\\n 0xc3fcd3d76192e4007dfb496cca67e13b => \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n 0xd174ab98d277d9f5a5611c2c9f419d9f => \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\",\\n 0x57edf4a22be3c955ac49da2e2107b67a => \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"]\\n println(\\\"MD5 of $(pair[2]) is $(md5(pair[2])), which checks with $(string(pair[1], base=16)).\\\")\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.3\\n\\nobject MD5 {\\n\\n private val INIT_A = 0x67452301\\n private val INIT_B = 0xEFCDAB89L.toInt()\\n private val INIT_C = 0x98BADCFEL.toInt()\\n private val INIT_D = 0x10325476\\n\\n private val SHIFT_AMTS = intArrayOf(\\n 7, 12, 17, 22,\\n 5, 9, 14, 20,\\n 4, 11, 16, 23,\\n 6, 10, 15, 21\\n )\\n\\n private val TABLE_T = IntArray(64) {\\n ((1L shl 32) * Math.abs(Math.sin(it + 1.0))).toLong().toInt()\\n }\\n\\n fun compute(message: ByteArray): ByteArray {\\n val messageLenBytes = message.size\\n val numBlocks = ((messageLenBytes + 8) ushr 6) + 1\\n val totalLen = numBlocks shl 6\\n val paddingBytes = ByteArray(totalLen - messageLenBytes)\\n paddingBytes[0] = 0x80.toByte()\\n var messageLenBits = (messageLenBytes shl 3).toLong()\\n\\n for (i in 0..7) {\\n paddingBytes[paddingBytes.size - 8 + i] = messageLenBits.toByte()\\n messageLenBits = messageLenBits ushr 8\\n }\\n\\n var a = INIT_A\\n var b = INIT_B\\n var c = INIT_C\\n var d = INIT_D\\n val buffer = IntArray(16)\\n\\n for (i in 0 until numBlocks) {\\n var index = i shl 6\\n\\n for (j in 0..63) {\\n val temp = if (index < messageLenBytes) message[index] else\\n paddingBytes[index - messageLenBytes]\\n buffer[j ushr 2] = (temp.toInt() shl 24) or (buffer[j ushr 2] ushr 8)\\n index++\\n }\\n\\n val originalA = a\\n val originalB = b\\n val originalC = c\\n val originalD = d\\n\\n for (j in 0..63) {\\n val div16 = j ushr 4\\n var f = 0\\n var bufferIndex = j\\n when (div16) {\\n 0 -> {\\n f = (b and c) or (b.inv() and d)\\n }\\n\\n 1 -> {\\n f = (b and d) or (c and d.inv())\\n bufferIndex = (bufferIndex * 5 + 1) and 0x0F\\n }\\n\\n 2 -> {\\n f = b xor c xor d;\\n bufferIndex = (bufferIndex * 3 + 5) and 0x0F\\n }\\n\\n 3 -> {\\n f = c xor (b or d.inv());\\n bufferIndex = (bufferIndex * 7) and 0x0F\\n }\\n }\\n\\n val temp = b + Integer.rotateLeft(a + f + buffer[bufferIndex] +\\n TABLE_T[j], SHIFT_AMTS[(div16 shl 2) or (j and 3)])\\n a = d\\n d = c\\n c = b\\n b = temp\\n }\\n\\n a += originalA\\n b += originalB\\n c += originalC\\n d += originalD\\n }\\n\\n val md5 = ByteArray(16)\\n var count = 0\\n\\n for (i in 0..3) {\\n var n = if (i == 0) a else (if (i == 1) b else (if (i == 2) c else d))\\n\\n for (j in 0..3) {\\n md5[count++] = n.toByte()\\n n = n ushr 8\\n }\\n }\\n return md5\\n }\\n}\\n\\nfun ByteArray.toHexString(): String {\\n val sb = StringBuilder()\\n for (b in this) sb.append(String.format(\\\"%02x\\\", b.toInt() and 0xFF))\\n return sb.toString()\\n}\\n\\nfun main(args: Array<String>) {\\n val testStrings = arrayOf(\\n \\\"\\\",\\n \\\"a\\\",\\n \\\"abc\\\",\\n \\\"message digest\\\",\\n \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\",\\n \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"\\n )\\n\\n println(\\\"${\\\"hash code\\\".padStart(34)} <== string\\\")\\n for (s in testStrings) {\\n println(\\\"0x${MD5.compute(s.toByteArray()).toHexString()} <== \\\\\\\"$s\\\\\\\"\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"----------------------------------------\\n-- Calculates MD5 hash of string or bytearray\\n-- @param {bytearray|string} input\\n-- @return {bytearray} (16 bytes)\\n----------------------------------------\\non md5 (input)\\n if stringP(input) then input = bytearray(input)\\n\\n -- Convert string to list of little-endian words...\\n t_iLen = input.length * 8\\n t_iCnt = (t_iLen + 64) / 512 * 16 + 16\\n\\n -- Create list, fill with zeros...\\n x = []\\n x[t_iCnt] = 0\\n\\n t_fArr = [1, 256, 65536, 16777216]\\n i = 0\\n j = 0\\n repeat while i < t_iLen\\n j = j + 1\\n t_iNext = i / 32 + 1\\n t_iTemp = bitAnd(input[i/8+1], 255) * t_fArr[j]\\n x[t_iNext] = bitOr(x[t_iNext], t_iTemp)\\n i = i + 8\\n j = j mod 4\\n end repeat\\n\\n -- Append padding...\\n t_iNext = t_iLen / 32 + 1\\n x[t_iNext] = bitOr(x[t_iNext], 128 * t_fArr[j + 1])\\n x[(t_iLen + 64) / 512 * 16 + 15] = t_iLen\\n\\n -- Actual algorithm starts here...\\n a = 1732584193\\n b = -271733879\\n c = -1732584194\\n d = 271733878\\n i = 1\\n t_iWrap = the maxInteger + 1\\n t_iCount = x.count + 1\\n repeat while i < t_iCount\\n olda = a\\n oldb = b\\n oldc = c\\n oldd = d\\n\\n -- Round(1) --\\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i] - 680876936\\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\\n else a = bitOr(n * 128, n / 33554432) + b\\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 1] - 389564586\\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\\n else d = bitOr(n * 4096, n / 1048576) + a\\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 2] + 606105819\\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\\n else c = bitOr(n * 131072, n / 32768) + d\\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 3] - 1044525330\\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\\n else b = bitOr(n * 4194304, n / 1024) + c\\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i + 4] - 176418897\\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\\n else a = bitOr(n * 128, n / 33554432) + b\\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 5] + 1200080426\\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\\n else d = bitOr(n * 4096, n / 1048576) + a\\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 6] - 1473231341\\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\\n else c = bitOr(n * 131072, n / 32768) + d\\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 7] - 45705983\\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\\n else b = bitOr(n * 4194304, n / 1024) + c\\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i + 8] + 1770035416\\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\\n else a = bitOr(n * 128, n / 33554432) + b\\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 9] - 1958414417\\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\\n else d = bitOr(n * 4096, n / 1048576) + a\\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 10] - 42063\\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\\n else c = bitOr(n * 131072, n / 32768) + d\\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 11] - 1990404162\\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\\n else b = bitOr(n * 4194304, n / 1024) + c\\n n = bitOr(bitAnd(b, c), bitAnd(bitNot(b), d)) + a + x[i + 12] + 1804603682\\n if(n < 0) then a = bitOr(n * 128, bitOr((n + t_iWrap) / 33554432, 64)) + b\\n else a = bitOr(n * 128, n / 33554432) + b\\n n = bitOr(bitAnd(a, b), bitAnd(bitNot(a), c)) + d + x[i + 13] - 40341101\\n if(n < 0) then d = bitOr(n * 4096, bitOr((n + t_iWrap) / 1048576, 2048)) + a\\n else d = bitOr(n * 4096, n / 1048576) + a\\n n = bitOr(bitAnd(d, a), bitAnd(bitNot(d), b)) + c + x[i + 14] - 1502002290\\n if(n < 0) then c = bitOr(n * 131072, bitOr((n + t_iWrap) / 32768, 65536)) + d\\n else c = bitOr(n * 131072, n / 32768) + d\\n n = bitOr(bitAnd(c, d), bitAnd(bitNot(c), a)) + b + x[i + 15] + 1236535329\\n if(n < 0) then b = bitOr(n * 4194304, bitOr((n + t_iWrap) / 1024, 2097152)) + c\\n else b = bitOr(n * 4194304, n / 1024) + c\\n\\n -- Round(2) --\\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 1] - 165796510\\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\\n else a = bitOr(n * 32, n / 134217728) + b\\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 6] - 1069501632\\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\\n else d = bitOr(n * 512, n / 8388608) + a\\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 11] + 643717713\\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\\n else c = bitOr(n * 16384, n / 262144) + d\\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i] - 373897302\\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\\n else b = bitOr(n * 1048576, n / 4096) + c\\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 5] - 701558691\\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\\n else a = bitOr(n * 32, n / 134217728) + b\\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 10] + 38016083\\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\\n else d = bitOr(n * 512, n / 8388608) + a\\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 15] - 660478335\\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\\n else c = bitOr(n * 16384, n / 262144) + d\\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i + 4] - 405537848\\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\\n else b = bitOr(n * 1048576, n / 4096) + c\\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 9] + 568446438\\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\\n else a = bitOr(n * 32, n / 134217728) + b\\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 14] - 1019803690\\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\\n else d = bitOr(n * 512, n / 8388608) + a\\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 3] - 187363961\\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\\n else c = bitOr(n * 16384, n / 262144) + d\\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i + 8] + 1163531501\\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\\n else b = bitOr(n * 1048576, n / 4096) + c\\n n = bitOr(bitAnd(b, d), bitAnd(c, bitNot(d))) + a + x[i + 13] - 1444681467\\n if(n < 0) then a = bitOr(n * 32, bitOr((n + t_iWrap) / 134217728, 16)) + b\\n else a = bitOr(n * 32, n / 134217728) + b\\n n = bitOr(bitAnd(a, c), bitAnd(b, bitNot(c))) + d + x[i + 2] - 51403784\\n if(n < 0) then d = bitOr(n * 512, bitOr((n + t_iWrap) / 8388608, 256)) + a\\n else d = bitOr(n * 512, n / 8388608) + a\\n n = bitOr(bitAnd(d, b), bitAnd(a, bitNot(b))) + c + x[i + 7] + 1735328473\\n if(n < 0) then c = bitOr(n * 16384, bitOr((n + t_iWrap) / 262144, 8192)) + d\\n else c = bitOr(n * 16384, n / 262144) + d\\n n = bitOr(bitAnd(c, a), bitAnd(d, bitNot(a))) + b + x[i + 12] - 1926607734\\n if(n < 0) then b = bitOr(n * 1048576, bitOr((n + t_iWrap) / 4096, 524288)) + c\\n else b = bitOr(n * 1048576, n / 4096) + c\\n\\n -- Round(3) --\\n n = bitXor(bitXor(b, c), d) + a + x[i + 5] - 378558\\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\\n else a = bitOr(n * 16, n / 268435456) + b\\n n = bitXor(bitXor(a, b), c) + d + x[i + 8] - 2022574463\\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\\n else d = bitOr(n * 2048, n / 2097152) + a\\n n = bitXor(bitXor(d, a), b) + c + x[i + 11] + 1839030562\\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\\n else c = bitOr(n * 65536, n / 65536) + d\\n n = bitXor(bitXor(c, d), a) + b + x[i + 14] - 35309556\\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\\n else b = bitOr(n * 8388608, n / 512) + c\\n n = bitXor(bitXor(b, c), d) + a + x[i + 1] - 1530992060\\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\\n else a = bitOr(n * 16, n / 268435456) + b\\n n = bitXor(bitXor(a, b), c) + d + x[i + 4] + 1272893353\\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\\n else d = bitOr(n * 2048, n / 2097152) + a\\n n = bitXor(bitXor(d, a), b) + c + x[i + 7] - 155497632\\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\\n else c = bitOr(n * 65536, n / 65536) + d\\n n = bitXor(bitXor(c, d), a) + b + x[i + 10] - 1094730640\\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\\n else b = bitOr(n * 8388608, n / 512) + c\\n n = bitXor(bitXor(b, c), d) + a + x[i + 13] + 681279174\\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\\n else a = bitOr(n * 16, n / 268435456) + b\\n n = bitXor(bitXor(a, b), c) + d + x[i] - 358537222\\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\\n else d = bitOr(n * 2048, n / 2097152) + a\\n n = bitXor(bitXor(d, a), b) + c + x[i + 3] - 722521979\\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\\n else c = bitOr(n * 65536, n / 65536) + d\\n n = bitXor(bitXor(c, d), a) + b + x[i + 6] + 76029189\\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\\n else b = bitOr(n * 8388608, n / 512) + c\\n n = bitXor(bitXor(b, c), d) + a + x[i + 9] - 640364487\\n if(n < 0) then a = bitOr(n * 16, bitOr((n + t_iWrap) / 268435456, 8)) + b\\n else a = bitOr(n * 16, n / 268435456) + b\\n n = bitXor(bitXor(a, b), c) + d + x[i + 12] - 421815835\\n if(n < 0) then d = bitOr(n * 2048, bitOr((n + t_iWrap) / 2097152, 1024)) + a\\n else d = bitOr(n * 2048, n / 2097152) + a\\n n = bitXor(bitXor(d, a), b) + c + x[i + 15] + 530742520\\n if(n < 0) then c = bitOr(n * 65536, bitOr((n + t_iWrap) / 65536, 32768)) + d\\n else c = bitOr(n * 65536, n / 65536) + d\\n n = bitXor(bitXor(c, d), a) + b + x[i + 2] - 995338651\\n if(n < 0) then b = bitOr(n * 8388608, bitOr((n + t_iWrap) / 512, 4194304)) + c\\n else b = bitOr(n * 8388608, n / 512) + c\\n\\n -- Round(4) --\\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i] - 198630844\\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\\n else a = bitOr(n * 64, n / 67108864) + b\\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 7] + 1126891415\\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\\n else d = bitOr(n * 1024, n / 4194304) + a\\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 14] - 1416354905\\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\\n else c = bitOr(n * 32768, n / 131072) + d\\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 5] - 57434055\\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\\n else b = bitOr(n * 2097152, n / 2048) + c\\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i + 12] + 1700485571\\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\\n else a = bitOr(n * 64, n / 67108864) + b\\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 3] - 1894986606\\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\\n else d = bitOr(n * 1024, n / 4194304) + a\\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 10] - 1051523\\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\\n else c = bitOr(n * 32768, n / 131072) + d\\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 1] - 2054922799\\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\\n else b = bitOr(n * 2097152, n / 2048) + c\\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i + 8] + 1873313359\\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\\n else a = bitOr(n * 64, n / 67108864) + b\\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 15] - 30611744\\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\\n else d = bitOr(n * 1024, n / 4194304) + a\\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 6] - 1560198380\\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\\n else c = bitOr(n * 32768, n / 131072) + d\\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 13] + 1309151649\\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\\n else b = bitOr(n * 2097152, n / 2048) + c\\n n = bitXor(c, bitOr(b, bitNot(d))) + a + x[i + 4] - 145523070\\n if(n < 0) then a = bitOr(n * 64, bitOr((n + t_iWrap) / 67108864, 32)) + b\\n else a = bitOr(n * 64, n / 67108864) + b\\n n = bitXor(b, bitOr(a, bitNot(c))) + d + x[i + 11] - 1120210379\\n if(n < 0) then d = bitOr(n * 1024, bitOr((n + t_iWrap) / 4194304, 512)) + a\\n else d = bitOr(n * 1024, n / 4194304) + a\\n n = bitXor(a, bitOr(d, bitNot(b))) + c + x[i + 2] + 718787259\\n if(n < 0) then c = bitOr(n * 32768, bitOr((n + t_iWrap) / 131072, 16384)) + d\\n else c = bitOr(n * 32768, n / 131072) + d\\n n = bitXor(d, bitOr(c, bitNot(a))) + b + x[i + 9] - 343485551\\n if(n < 0) then b = bitOr(n * 2097152, bitOr((n + t_iWrap) / 2048, 1048576)) + c\\n else b = bitOr(n * 2097152, n / 2048) + c\\n a = a + olda\\n b = b + oldb\\n c = c + oldc\\n d = d + oldd\\n i = i + 16\\n end repeat\\n\\n t_iArr = [a, b, c, d]\\n ba = bytearray()\\n p = 1\\n repeat with i in t_iArr\\n if(i > 0) then\\n repeat with n = 1 to 4\\n ba[p] = (i mod 256)\\n i = i / 256\\n p = p+1\\n end repeat\\n else\\n i = bitNot(i)\\n repeat with n = 1 to 4\\n ba[p] = 255-(i mod 256)\\n i = i / 256\\n p = p+1\\n end repeat\\n end if\\n end repeat\\n ba.position = 1\\n return ba\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"tests = []\\ntests.add(\\\"\\\")\\ntests.add(\\\"a\\\")\\ntests.add(\\\"abc\\\")\\ntests.add(\\\"message digest\\\")\\ntests.add(\\\"abcdefghijklmnopqrstuvwxyz\\\")\\ntests.add(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\")\\ntests.add(\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\")\\nrepeat with t in tests\\n ba = md5(t)\\n put ba.toHexString(1, ba.length)\\nend repeat\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"-- shift amounts\\nlocal s = {\\n 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21\\n}\\n\\n-- constants\\nlocal K = {\\n 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,\\n 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,\\n 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,\\n 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,\\n 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,\\n 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,\\n 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,\\n 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,\\n 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,\\n 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,\\n 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,\\n 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,\\n 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,\\n 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,\\n 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,\\n 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,\\n}\\n\\nlocal function leftRotate(x, c)\\n return (x << c) | (x >> (32-c))\\nend\\n\\nlocal function getInt(byteArray, n)\\n return (byteArray[n+3]<<24) + (byteArray[n+2]<<16) + (byteArray[n+1]<<8) + byteArray[n]\\nend\\n\\n--- converts 32bit integer n to a little endian hex representation\\n-- @tparam integer n\\nlocal function lE(n)\\n local s = ''\\n for i = 0, 3 do\\n s = ('%s%02x'):format(s, (n>>(i*8))&0xff)\\n end\\n return s\\nend\\n\\n--- md5\\n-- @tparam string message\\nlocal function md5(message)\\n local a0, b0, c0, d0 = 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476\\n local bytes = {message:byte(1, -1)}\\n\\n -- insert 1 bit (and the rest of the byte)\\n table.insert(bytes, 0x80)\\n\\n -- pad with zeros until we have *just enough*\\n local p = #bytes%64\\n if p > 56 then\\n p = p - 64\\n end\\n for _ = p+1, 56 do\\n table.insert(bytes, 0)\\n end\\n\\n -- insert the initial message length, in little-endian\\n local len = ((#message)<<3)&0xffffffffffffffff -- length in bits\\n for i = 0, 7 do\\n table.insert(bytes, (len>>(i*8))&0xff)\\n end\\n\\n\\n for i = 0, #bytes//64-1 do\\n local a, b, c, d = a0, b0, c0, d0\\n for j = 0, 63 do\\n local F, g\\n -- permutate\\n if j <= 15 then\\n F = (b & c) | (~b & d)\\n g = j\\n elseif j <= 31 then\\n F = (d & b) | (~d & c)\\n g = (5*j + 1) & 15\\n elseif j <= 47 then\\n F = b ~ c ~ d\\n g = (3*j + 5) & 15\\n else\\n F = c ~ (b | ~d)\\n g = (7*j) & 15\\n end\\n\\n F = (F + a + K[j+1] + getInt(bytes, i*64+g*4+1))&0xffffffff\\n -- shuffle\\n a = d\\n d = c\\n c = b\\n b = (b + leftRotate(F, s[j+1]))&0xffffffff\\n end\\n -- update internal state\\n a0 = (a0 + a)&0xffffffff\\n b0 = (b0 + b)&0xffffffff\\n c0 = (c0 + c)&0xffffffff\\n d0 = (d0 + d)&0xffffffff\\n end\\n\\n -- lua doesn't support any other byte strings. Could convert to a wacky string but this is more printable.\\n return lE(a0)..lE(b0)..lE(c0)..lE(d0)\\nend\\n\\nlocal demo = {\\n [\\\"\\\"] = \\\"d41d8cd98f00b204e9800998ecf8427e\\\",\\n [\\\"a\\\"] = \\\"0cc175b9c0f1b6a831c399e269772661\\\",\\n [\\\"abc\\\"] = \\\"900150983cd24fb0d6963f7d28e17f72\\\",\\n [\\\"message digest\\\"] = \\\"f96b697d7cb7938d525a2f31aaf161d0\\\",\\n [\\\"abcdefghijklmnopqrstuvwxyz\\\"] = \\\"c3fcd3d76192e4007dfb496cca67e13b\\\",\\n [\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"] = \\\"d174ab98d277d9f5a5611c2c9f419d9f\\\",\\n [\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"] = \\\"57edf4a22be3c955ac49da2e2107b67a\\\",\\n}\\n\\nfor k, v in pairs(demo) do\\n local m = md5(k)\\n print((\\\"%s [%2s] <== \\\\\\\"%s\\\\\\\"\\\"):format(m, m==v and 'OK' or '', k))\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"f96b697d7cb7938d525a2f31aaf161d0 [OK] <== \\\"message digest\\\"\\nd174ab98d277d9f5a5611c2c9f419d9f [OK] <== \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"\\nc3fcd3d76192e4007dfb496cca67e13b [OK] <== \\\"abcdefghijklmnopqrstuvwxyz\\\"\\nd41d8cd98f00b204e9800998ecf8427e [OK] <== \\\"\\\"\\n900150983cd24fb0d6963f7d28e17f72 [OK] <== \\\"abc\\\"\\n57edf4a22be3c955ac49da2e2107b67a [OK] <== \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"\\n0cc175b9c0f1b6a831c399e269772661 [OK] <== \\\"a\\\"\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"md5[string_String] :=\\n Module[{r = {7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17,\\n 22, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 4,\\n 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 6, 10,\\n 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21},\\n k = Table[Floor[2^32*Abs@Sin@i], {i, 1, 64}], h0 = 16^^67452301,\\n h1 = 16^^efcdab89, h2 = 16^^98badcfe, h3 = 16^^10325476,\\n data = Partition[\\n Join[FromDigits[Reverse@#, 256] & /@\\n Partition[\\n PadRight[Append[#, 128], Mod[56, 64, Length@# + 1]], 4],\\n Reverse@IntegerDigits[8 Length@#, 2^32, 2]] &@\\n ImportString[string, \\\"Binary\\\"], 16], a, b, c, d, f, g},\\n Do[{a, b, c, d} = {h0, h1, h2, h3};\\n Do[Which[1 <= i <= 16,\\n f = BitOr[BitAnd[b, c], BitAnd[BitNot[b], d]]; g = i - 1,\\n 17 <= i <= 32, f = BitOr[BitAnd[d, b], BitAnd[BitNot[d], c]];\\n g = Mod[5 i - 4, 16], 33 <= i <= 48, f = BitXor[b, c, d];\\n g = Mod[3 i + 2, 16], 49 <= i <= 64,\\n f = BitXor[c, BitOr[b, BitNot[d] + 2^32]];\\n g = Mod[7 i - 7, 16]]; {a, b, c, d} = {d,\\n BitOr[BitShiftLeft[#1, #2], BitShiftRight[#1, 32 - #2]] &[\\n Mod[a + f + k[[i]] + w[[g + 1]], 2^32], r[[i]]] + b, b,\\n c}, {i, 1, 64}]; {h0, h1, h2, h3} =\\n Mod[{h0, h1, h2, h3} + {a, b, c, d}, 2^32], {w, data}];\\n \\\"0x\\\" ~~ IntegerString[\\n FromDigits[\\n Flatten[Reverse@IntegerDigits[#, 256, 4] & /@ {h0, h1, h2, h3}],\\n 256], 16, 32]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"md5[\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"0x57edf4a22be3c955ac49da2e2107b67a\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"INTERFACE MD5;\\n\\nIMPORT Word;\\n\\nTYPE Digest = ARRAY [0..15] OF CHAR;\\nTYPE Buffer = ARRAY [0..63] OF CHAR;\\n\\nTYPE T = RECORD\\n state: ARRAY [0..3] OF Word.T;\\n count: ARRAY [0..1] OF Word.T;\\n buffer: Buffer;\\nEND;\\n\\nPROCEDURE Init(VAR md5ctx: T);\\nPROCEDURE Update(VAR md5ctx: T; input: TEXT);\\nPROCEDURE Final(VAR md5ctx: T): Digest;\\nPROCEDURE ToText(hash: Digest): TEXT;\\n\\nEND MD5.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"MODULE MD5;\\n\\nIMPORT Word, Text, Fmt;\\n\\nCONST S11 = 7; S12 = 12; S13 = 17; S14 = 22;\\n S21 = 5; S22 = 9; S23 = 14; S24 = 20;\\n S31 = 4; S32 = 11; S33 = 16; S34 = 23;\\n S41 = 6; S42 = 10; S43 = 15; S44 = 21;\\n pad1 = \\\"\\\\200\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\";\\n pad2 = \\\"\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\";\\n pad3 = \\\"\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\";\\n pad4 = \\\"\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\\000\\\";\\n padding = pad1 & pad2 & pad3 & pad4;\\n\\nPROCEDURE Init(VAR md5ctx: T) =\\n BEGIN\\n <*ASSERT Word.Size = 32*>\\n md5ctx.count[0] := 0;\\n md5ctx.count[1] := 0;\\n\\n md5ctx.state[0] := 16_67452301;\\n md5ctx.state[1] := 16_efcdab89;\\n md5ctx.state[2] := 16_98badcfe;\\n md5ctx.state[3] := 16_10325476;\\n END Init;\\n\\nPROCEDURE Transform(VAR state: ARRAY [0..3] OF Word.T;\\n VAR input: Buffer) =\\n VAR a, b, c, d: INTEGER;\\n x: ARRAY [0..15] OF INTEGER;\\n\\n PROCEDURE Decode(VAR x: ARRAY [0..15] OF INTEGER;\\n VAR input: Buffer) =\\n BEGIN\\n FOR i := 0 TO 15 DO\\n x[i] := Word.Insert(x[i], ORD(input[4*i+0]), 0, 8);\\n x[i] := Word.Insert(x[i], ORD(input[4*i+1]), 8, 8);\\n x[i] := Word.Insert(x[i], ORD(input[4*i+2]), 16, 8);\\n x[i] := Word.Insert(x[i], ORD(input[4*i+3]), 24, 8);\\n END;\\n END Decode;\\n\\n PROCEDURE FF(VAR a: INTEGER; b, c, d, x, s, ac: INTEGER) =\\n PROCEDURE F(x, y, z: INTEGER): INTEGER =\\n BEGIN\\n RETURN Word.Or(Word.And(x, y), Word.And(Word.Not(x), z));\\n END F;\\n BEGIN\\n a := b + Word.Rotate(a + F(b, c, d) + x + ac, s);\\n END FF;\\n\\n PROCEDURE GG(VAR a: INTEGER; b, c, d, x, s, ac: INTEGER) =\\n PROCEDURE G(x, y, z: INTEGER): INTEGER =\\n BEGIN\\n RETURN Word.Or(Word.And(x, z), Word.And(y, Word.Not(z)));\\n END G;\\n BEGIN\\n a := b + Word.Rotate(a + G(b, c, d) + x + ac, s);\\n END GG;\\n\\n PROCEDURE HH(VAR a: INTEGER; b, c, d, x, s, ac: INTEGER) =\\n PROCEDURE H(x, y, z: INTEGER): INTEGER =\\n BEGIN\\n RETURN Word.Xor(x, Word.Xor(y,z));\\n END H;\\n BEGIN\\n a := b + Word.Rotate(a + H(b, c, d) + x + ac, s);\\n END HH;\\n\\n PROCEDURE II(VAR a: INTEGER; b, c, d, x, s, ac: INTEGER) =\\n PROCEDURE I(x, y, z: INTEGER): INTEGER =\\n BEGIN\\n RETURN Word.Xor(y, Word.Or(x, Word.Not(z)))\\n END I;\\n BEGIN\\n a := b + Word.Rotate(a + I(b, c, d) + x + ac, s)\\n END II;\\n\\n BEGIN\\n Decode(x, input);\\n\\n a := state[0];\\n b := state[1];\\n c := state[2];\\n d := state[3];\\n\\n (* Round 1 *)\\n FF(a, b, c, d, x[ 0], S11, 16_d76aa478); (* 1 *)\\n FF(d, a, b, c, x[ 1], S12, 16_e8c7b756); (* 2 *)\\n FF(c, d, a, b, x[ 2], S13, 16_242070db); (* 3 *)\\n FF(b, c, d, a, x[ 3], S14, 16_c1bdceee); (* 4 *)\\n FF(a, b, c, d, x[ 4], S11, 16_f57c0faf); (* 5 *)\\n FF(d, a, b, c, x[ 5], S12, 16_4787c62a); (* 6 *)\\n FF(c, d, a, b, x[ 6], S13, 16_a8304613); (* 7 *)\\n FF(b, c, d, a, x[ 7], S14, 16_fd469501); (* 8 *)\\n FF(a, b, c, d, x[ 8], S11, 16_698098d8); (* 9 *)\\n FF(d, a, b, c, x[ 9], S12, 16_8b44f7af); (* 10 *)\\n FF(c, d, a, b, x[10], S13, 16_ffff5bb1); (* 11 *)\\n FF(b, c, d, a, x[11], S14, 16_895cd7be); (* 12 *)\\n FF(a, b, c, d, x[12], S11, 16_6b901122); (* 13 *)\\n FF(d, a, b, c, x[13], S12, 16_fd987193); (* 14 *)\\n FF(c, d, a, b, x[14], S13, 16_a679438e); (* 15 *)\\n FF(b, c, d, a, x[15], S14, 16_49b40821); (* 16 *)\\n\\n (* Round 2 *)\\n GG(a, b, c, d, x[ 1], S21, 16_f61e2562); (* 17 *)\\n GG(d, a, b, c, x[ 6], S22, 16_c040b340); (* 18 *)\\n GG(c, d, a, b, x[11], S23, 16_265e5a51); (* 19 *)\\n GG(b, c, d, a, x[ 0], S24, 16_e9b6c7aa); (* 20 *)\\n GG(a, b, c, d, x[ 5], S21, 16_d62f105d); (* 21 *)\\n GG(d, a, b, c, x[10], S22, 16_02441453); (* 22 *)\\n GG(c, d, a, b, x[15], S23, 16_d8a1e681); (* 23 *)\\n GG(b, c, d, a, x[ 4], S24, 16_e7d3fbc8); (* 24 *)\\n GG(a, b, c, d, x[ 9], S21, 16_21e1cde6); (* 25 *)\\n GG(d, a, b, c, x[14], S22, 16_c33707d6); (* 26 *)\\n GG(c, d, a, b, x[ 3], S23, 16_f4d50d87); (* 27 *)\\n GG(b, c, d, a, x[ 8], S24, 16_455a14ed); (* 28 *)\\n GG(a, b, c, d, x[13], S21, 16_a9e3e905); (* 29 *)\\n GG(d, a, b, c, x[ 2], S22, 16_fcefa3f8); (* 30 *)\\n GG(c, d, a, b, x[ 7], S23, 16_676f02d9); (* 31 *)\\n GG(b, c, d, a, x[12], S24, 16_8d2a4c8a); (* 32 *)\\n\\n (* Round 3 *)\\n HH(a, b, c, d, x[ 5], S31, 16_fffa3942); (* 33 *)\\n HH(d, a, b, c, x[ 8], S32, 16_8771f681); (* 34 *)\\n HH(c, d, a, b, x[11], S33, 16_6d9d6122); (* 35 *)\\n HH(b, c, d, a, x[14], S34, 16_fde5380c); (* 36 *)\\n HH(a, b, c, d, x[ 1], S31, 16_a4beea44); (* 37 *)\\n HH(d, a, b, c, x[ 4], S32, 16_4bdecfa9); (* 38 *)\\n HH(c, d, a, b, x[ 7], S33, 16_f6bb4b60); (* 39 *)\\n HH(b, c, d, a, x[10], S34, 16_bebfbc70); (* 40 *)\\n HH(a, b, c, d, x[13], S31, 16_289b7ec6); (* 41 *)\\n HH(d, a, b, c, x[ 0], S32, 16_eaa127fa); (* 42 *)\\n HH(c, d, a, b, x[ 3], S33, 16_d4ef3085); (* 43 *)\\n HH(b, c, d, a, x[ 6], S34, 16_04881d05); (* 44 *)\\n HH(a, b, c, d, x[ 9], S31, 16_d9d4d039); (* 45 *)\\n HH(d, a, b, c, x[12], S32, 16_e6db99e5); (* 46 *)\\n HH(c, d, a, b, x[15], S33, 16_1fa27cf8); (* 47 *)\\n HH(b, c, d, a, x[ 2], S34, 16_c4ac5665); (* 48 *)\\n\\n (* Round 4 *)\\n II(a, b, c, d, x[ 0], S41, 16_f4292244); (* 49 *)\\n II(d, a, b, c, x[ 7], S42, 16_432aff97); (* 50 *)\\n II(c, d, a, b, x[14], S43, 16_ab9423a7); (* 51 *)\\n II(b, c, d, a, x[ 5], S44, 16_fc93a039); (* 52 *)\\n II(a, b, c, d, x[12], S41, 16_655b59c3); (* 53 *)\\n II(d, a, b, c, x[ 3], S42, 16_8f0ccc92); (* 54 *)\\n II(c, d, a, b, x[10], S43, 16_ffeff47d); (* 55 *)\\n II(b, c, d, a, x[ 1], S44, 16_85845dd1); (* 56 *)\\n II(a, b, c, d, x[ 8], S41, 16_6fa87e4f); (* 57 *)\\n II(d, a, b, c, x[15], S42, 16_fe2ce6e0); (* 58 *)\\n II(c, d, a, b, x[ 6], S43, 16_a3014314); (* 59 *)\\n II(b, c, d, a, x[13], S44, 16_4e0811a1); (* 60 *)\\n II(a, b, c, d, x[ 4], S41, 16_f7537e82); (* 61 *)\\n II(d, a, b, c, x[11], S42, 16_bd3af235); (* 62 *)\\n II(c, d, a, b, x[ 2], S43, 16_2ad7d2bb); (* 63 *)\\n II(b, c, d, a, x[ 9], S44, 16_eb86d391); (* 64 *)\\n\\n state[0] := Word.Plus(state[0], a);\\n state[1] := Word.Plus(state[1], b);\\n state[2] := Word.Plus(state[2], c);\\n state[3] := Word.Plus(state[3], d);\\n END Transform;\\n\\nPROCEDURE Update(VAR md5ctx: T; input: TEXT) =\\n VAR index, i, j, partLen: Word.T;\\n locbuff: Buffer;\\n\\n BEGIN\\n index := Word.And(Word.Shift(md5ctx.count[0], -3), 16_3F);\\n md5ctx.count[0] :=\\n Word.Plus(md5ctx.count[0], Word.Shift(Text.Length(input), 3));\\n\\n IF md5ctx.count[0] < Text.Length(input) THEN\\n INC(md5ctx.count[1]);\\n END;\\n md5ctx.count[1] := md5ctx.count[1] + Word.Shift(Text.Length(input), -29);\\n partLen := 64 - index;\\n IF Text.Length(input) >= partLen THEN\\n FOR i := index TO 63 DO\\n md5ctx.buffer[i] := Text.GetChar(input, i-index);\\n END;\\n Transform(md5ctx.state, md5ctx.buffer);\\n i := partLen;\\n WHILE (i + 63) < Text.Length(input) DO\\n FOR j := 0 TO 63 DO\\n locbuff[j] := Text.GetChar(input, i+j);\\n END;\\n Transform(md5ctx.state, locbuff);\\n INC(i, 64);\\n END;\\n index := 0;\\n ELSE\\n i := 0;\\n END;\\n\\n j := 0;\\n WHILE i+j < Text.Length(input) DO\\n md5ctx.buffer[j+index] := Text.GetChar(input, i+j);\\n INC(j);\\n END;\\n END Update;\\n\\nPROCEDURE Final(VAR md5ctx: T): Digest=\\n VAR bits: ARRAY [0..7] OF CHAR;\\n index, padLen: INTEGER;\\n digest: Digest;\\n\\n PROCEDURE Encode(VAR output: ARRAY OF CHAR;\\n VAR input: ARRAY OF Word.T;\\n count: INTEGER) =\\n BEGIN\\n FOR i := 0 TO count DO\\n output[i*4+0] := VAL(Word.Extract(input[i], 0, 8), CHAR);\\n output[i*4+1] := VAL(Word.Extract(input[i], 8, 8), CHAR);\\n output[i*4+2] := VAL(Word.Extract(input[i], 16, 8), CHAR);\\n output[i*4+3] := VAL(Word.Extract(input[i], 24, 8), CHAR)\\n END;\\n END Encode;\\n BEGIN\\n Encode(bits, md5ctx.count, 1);\\n index := Word.And(Word.Shift(md5ctx.count[0], -3), 16_3F);\\n IF index < 56 THEN\\n padLen := 56 - index;\\n ELSE\\n padLen := 120 - index;\\n END;\\n Update(md5ctx, Text.Sub(padding, 0, padLen));\\n Update(md5ctx, Text.FromChars(bits));\\n Encode(digest, md5ctx.state, 3);\\n RETURN digest;\\n END Final;\\n\\nPROCEDURE ToText(hash: Digest): TEXT =\\n VAR buf: TEXT := \\\"\\\";\\n BEGIN\\n FOR i := 0 TO 15 DO\\n buf := buf & Fmt.Pad(Fmt.Int(ORD(hash[i]), 16), 2, '0');\\n END;\\n RETURN buf;\\n END ToText;\\n\\nBEGIN\\nEND MD5.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"MODULE Main;\\n\\nIMPORT MD5, IO;\\n\\nVAR md5ctx: MD5.T;\\n\\nBEGIN\\n MD5.Init(md5ctx);\\n MD5.Update(md5ctx, \\\"The quick brown fox jumped over the lazy dog's back\\\");\\n IO.Put(MD5.ToText(MD5.Final(md5ctx)) & \\\"\\\\n\\\");\\nEND Main.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"import sequtils\\n\\nconst\\n ChunkSize = 512 div 8\\n SumSize = 128 div 8\\n\\nproc extractChunk(msg : seq[uint8], chunk: var openarray[uint32], offset: int) =\\n var\\n srcIndex = offset\\n\\n for dstIndex in 0 ..< 16:\\n chunk[dstIndex] = 0\\n for ii in 0 ..< 4:\\n chunk[dstIndex] = chunk[dstIndex] shr 8\\n chunk[dstIndex] = chunk[dstIndex] or (msg[srcIndex].uint32 shl 24)\\n srcIndex.inc\\n\\nproc leftRotate(val: uint32, shift: int) : uint32 =\\n result = (val shl shift) or (val shr (32 - shift))\\n\\nproc md5Sum(msg : seq[uint8]) : array[SumSize, uint8] =\\n const\\n s : array[ChunkSize, int] =\\n [ 7, 12, 17, 22, 7, 12, 17, 22,\\n 7, 12, 17, 22, 7, 12, 17, 22,\\n 5, 9, 14, 20, 5, 9, 14, 20,\\n 5, 9, 14, 20, 5, 9, 14, 20,\\n 4, 11, 16, 23, 4, 11, 16, 23,\\n 4, 11, 16, 23, 4, 11, 16, 23,\\n 6, 10, 15, 21, 6, 10, 15, 21,\\n 6, 10, 15, 21, 6, 10, 15, 21 ]\\n\\n K : array[ChunkSize, uint32] =\\n [ 0xd76aa478'u32, 0xe8c7b756'u32, 0x242070db'u32, 0xc1bdceee'u32,\\n 0xf57c0faf'u32, 0x4787c62a'u32, 0xa8304613'u32, 0xfd469501'u32,\\n 0x698098d8'u32, 0x8b44f7af'u32, 0xffff5bb1'u32, 0x895cd7be'u32,\\n 0x6b901122'u32, 0xfd987193'u32, 0xa679438e'u32, 0x49b40821'u32,\\n 0xf61e2562'u32, 0xc040b340'u32, 0x265e5a51'u32, 0xe9b6c7aa'u32,\\n 0xd62f105d'u32, 0x02441453'u32, 0xd8a1e681'u32, 0xe7d3fbc8'u32,\\n 0x21e1cde6'u32, 0xc33707d6'u32, 0xf4d50d87'u32, 0x455a14ed'u32,\\n 0xa9e3e905'u32, 0xfcefa3f8'u32, 0x676f02d9'u32, 0x8d2a4c8a'u32,\\n 0xfffa3942'u32, 0x8771f681'u32, 0x6d9d6122'u32, 0xfde5380c'u32,\\n 0xa4beea44'u32, 0x4bdecfa9'u32, 0xf6bb4b60'u32, 0xbebfbc70'u32,\\n 0x289b7ec6'u32, 0xeaa127fa'u32, 0xd4ef3085'u32, 0x04881d05'u32,\\n 0xd9d4d039'u32, 0xe6db99e5'u32, 0x1fa27cf8'u32, 0xc4ac5665'u32,\\n 0xf4292244'u32, 0x432aff97'u32, 0xab9423a7'u32, 0xfc93a039'u32,\\n 0x655b59c3'u32, 0x8f0ccc92'u32, 0xffeff47d'u32, 0x85845dd1'u32,\\n 0x6fa87e4f'u32, 0xfe2ce6e0'u32, 0xa3014314'u32, 0x4e0811a1'u32,\\n 0xf7537e82'u32, 0xbd3af235'u32, 0x2ad7d2bb'u32, 0xeb86d391'u32 ]\\n\\n\\n # Pad with 1-bit, and fill with 0's up to 448 bits mod 512\\n var paddedMsgSize = msg.len + 1\\n var remain = (msg.len + 1) mod ChunkSize\\n if remain > (448 div 8):\\n paddedMsgSize += ChunkSize - remain + (448 div 8)\\n else:\\n paddedMsgSize += (448 div 8) - remain\\n\\n var paddingSize = paddedMsgSize - msg.len\\n var padding = newSeq[uint8](paddingSize)\\n padding[0] = 0x80\\n\\n # Pad with number of *bits* in original message, little-endian\\n var sizePadding = newSeq[uint8](8)\\n var size = msg.len * 8\\n for ii in 0 ..< 4:\\n sizePadding[ii] = uint8(size and 0xff)\\n size = size shr 8\\n\\n var paddedMsg = concat(msg, padding, sizePadding)\\n\\n var accum = [ 0x67452301'u32, 0xefcdab89'u32, 0x98badcfe'u32, 0x10325476'u32 ]\\n\\n for offset in countup(0, paddedMsg.len - 1, ChunkSize):\\n var A = accum[0]\\n var B = accum[1]\\n var C = accum[2]\\n var D = accum[3]\\n var F : uint32\\n var g : int\\n var M : array[16, uint32]\\n var dTemp : uint32\\n\\n extractChunk(paddedMsg, M, offset)\\n\\n # This is pretty much the same as Wikipedia's MD5 entry\\n for ii in 0 .. 63:\\n if ii <= 15:\\n F = (B and C) or ((not B) and D)\\n g = ii\\n\\n elif ii <= 31:\\n F = (D and B) or ((not D) and C)\\n g = (5 * ii + 1) mod 16\\n\\n elif ii <= 47:\\n F = B xor C xor D\\n g = (3 * ii + 5) mod 16\\n\\n else:\\n F = C xor (B or (not D))\\n g = (7 * ii) mod 16\\n\\n dTemp = D\\n D = C\\n C = B\\n B = B + leftRotate((A + F + K[ii] + M[g]), s[ii])\\n A = dTemp\\n\\n accum[0] += A\\n accum[1] += B\\n accum[2] += C\\n accum[3] += D\\n\\n # Convert four 32-bit accumulators to 16 byte array, little-endian\\n var dstIdx : int\\n for acc in accum:\\n var tmp = acc\\n\\n for ii in 0 ..< 4:\\n result[dstIdx] = uint8(tmp and 0xff)\\n tmp = tmp shr 8\\n dstIdx.inc\\n\\n# Only needed to convert from string to uint8 sequence\\niterator items * (str : string) : uint8 =\\n for ii in 0 ..< len(str):\\n yield str[ii].uint8\\n\\nproc main =\\n var msg = \\\"\\\"\\n var sum = md5Sum(toSeq(msg.items()))\\n assert(sum == [ 0xD4'u8, 0x1D, 0x8C, 0xD9, 0x8F, 0x00, 0xB2, 0x04,\\n 0xE9, 0x80, 0x09, 0x98, 0xEC, 0xF8, 0x42, 0x7E ] )\\n\\n msg = \\\"The quick brown fox jumps over the lazy dog\\\"\\n sum = md5Sum(toSeq(msg.items()))\\n assert(sum == [ 0x9E'u8, 0x10, 0x7D, 0x9D, 0x37, 0x2B, 0xB6, 0x82,\\n 0x6B, 0xD8, 0x1D, 0x35, 0x42, 0xA4, 0x19, 0xD6 ] )\\n\\n msg = \\\"The quick brown fox jumps over the lazy dog.\\\"\\n sum = md5Sum(toSeq(msg.items()))\\n assert(sum == [ 0xE4'u8, 0xD9, 0x09, 0xC2, 0x90, 0xD0, 0xFB, 0x1C,\\n 0xA0, 0x68, 0xFF, 0xAD, 0xDF, 0x22, 0xCB, 0xD0 ])\\n\\n\\n # Message size around magic 512 bits\\n msg = \\\"01234567890123456789012345678901234567890123456789012345678901234\\\"\\n sum = md5Sum(toSeq(msg.items()))\\n assert(sum == [ 0xBE'u8, 0xB9, 0xF4, 0x8B, 0xC8, 0x02, 0xCA, 0x5C,\\n 0xA0, 0x43, 0xBC, 0xC1, 0x5E, 0x21, 0x9A, 0x5A ])\\n\\n msg = \\\"0123456789012345678901234567890123456789012345678901234567890123\\\"\\n sum = md5Sum(toSeq(msg.items()))\\n assert(sum == [ 0x7F'u8, 0x7B, 0xFD, 0x34, 0x87, 0x09, 0xDE, 0xEA,\\n 0xAC, 0xE1, 0x9E, 0x3F, 0x53, 0x5F, 0x8C, 0x54 ])\\n\\n msg = \\\"012345678901234567890123456789012345678901234567890123456789012\\\"\\n sum = md5Sum(toSeq(msg.items()))\\n assert(sum == [ 0xC5'u8, 0xE2, 0x56, 0x43, 0x7E, 0x75, 0x80, 0x92,\\n 0xDB, 0xFE, 0x06, 0x28, 0x3E, 0x48, 0x90, 0x19 ])\\n\\n\\n # Message size around magic 448 bits\\n msg = \\\"01234567890123456789012345678901234567890123456789012345\\\"\\n sum = md5Sum(toSeq(msg.items()))\\n assert(sum == [ 0x8A'u8, 0xF2, 0x70, 0xB2, 0x84, 0x76, 0x10, 0xE7,\\n 0x42, 0xB0, 0x79, 0x1B, 0x53, 0x64, 0x8C, 0x09 ])\\n\\n msg = \\\"0123456789012345678901234567890123456789012345678901234\\\"\\n sum = md5Sum(toSeq(msg.items()))\\n assert(sum == [ 0x6E'u8, 0x7A, 0x4F, 0xC9, 0x2E, 0xB1, 0xC3, 0xF6,\\n 0xE6, 0x52, 0x42, 0x5B, 0xCC, 0x8D, 0x44, 0xB5 ])\\n\\n msg = \\\"012345678901234567890123456789012345678901234567890123\\\"\\n sum = md5Sum(toSeq(msg.items()))\\n assert(sum == [ 0x3D'u8, 0xFF, 0x83, 0xC8, 0xFA, 0xDD, 0x26, 0x37,\\n 0x0D, 0x5B, 0x09, 0x84, 0x09, 0x64, 0x44, 0x57 ])\\n\\nmain()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#!/usr/bin/env rexx\\n\\n/* Expected results:\\n 0xd41d8cd98f00b204e9800998ecf8427e <== \\\"\\\"\\n 0x0cc175b9c0f1b6a831c399e269772661 <== \\\"a\\\"\\n 0x900150983cd24fb0d6963f7d28e17f72 <== \\\"abc\\\"\\n 0xf96b697d7cb7938d525a2f31aaf161d0 <== \\\"message digest\\\"\\n 0xc3fcd3d76192e4007dfb496cca67e13b <== \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n 0xd174ab98d277d9f5a5611c2c9f419d9f <== \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"\\n 0x57edf4a22be3c955ac49da2e2107b67a <== \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"\\n*/\\n\\nmd5 = .md5~new; md5~update(\\\"\\\"); say md5~digest\\nmd5 = .md5~new; md5~update(\\\"a\\\"); say md5~digest\\nmd5 = .md5~new; md5~update(\\\"abc\\\"); say md5~digest\\nmd5 = .md5~new; md5~update(\\\"message digest\\\"); say md5~digest\\nmd5 = .md5~new(\\\"abcdefghijklmnopqrstuvwxyz\\\"); say md5~digest\\nmd5 = .md5~new(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"); md5~update(\\\"abcdefghijklmnopqrstuvwxyz0123456789\\\"); say md5~digest\\nmd5 = .md5~new; md5~update(\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"); say md5~digest\\n\\n-- requires OORexx 4.2.0 or later\\n-- standard numeric digits of 9 is not enough in this case\\n::options digits 20\\n\\n-- Implementation mainly based on pseudocode in https://en.wikipedia.org/wiki/MD5\\n::class md5 public\\n\\n::method init\\nexpose a0 b0 c0 d0 count buffer index K. s -- instance variables\\nuse strict arg chunk=\\\"\\\"\\n-- Initialize message digest\\na0 = .int32~new('67452301'x,\\\"C\\\") -- A\\nb0 = .int32~new('efcdab89'x,\\\"C\\\") -- B\\nc0 = .int32~new('98badcfe'x,\\\"C\\\") -- C\\nd0 = .int32~new('10325476'x,\\\"C\\\") -- D\\n-- The 512 bit chunk buffer\\nbuffer = .mutablebuffer~new('00'x~copies(64),64)\\n-- The position in the buffer to insert new input\\nindex = 1\\n-- message bytecount\\ncount = 0\\n-- initialize leftrotate amounts\\nnrs = .array~of(7,12,17,22)\\ns = nrs~union(nrs)~union(nrs)~union(nrs)\\nnrs = .array~of(5,9,14,20)\\ns = s~union(nrs)~union(nrs)~union(nrs)~union(nrs)\\nnrs = .array~of(4,11,16,23)\\ns = s~union(nrs)~union(nrs)~union(nrs)~union(nrs)\\nnrs = .array~of(6,10,15,21)\\ns = s~union(nrs)~union(nrs)~union(nrs)~union(nrs)\\n-- initialize sinus derived constants.\\n-- sin function from RXMath Library shipped with OORexx\\n-- see ::routine directive at the end of the code\\ndo i=0 to 63\\n K.i = .int32~new(((2**32)*(sin(i+1,16,R)~abs))~floor)\\nend\\n-- process initial string if any\\nself~update(chunk)\\nexit\\n\\n::method update\\n expose a0 b0 c0 d0 count buffer index K. s -- instance variables\\n use strict arg chunk\\n count += chunk~length\\n if chunk~length<65-index then do\\n buffer~overlay(chunk,index)\\n index += chunk~length\\n end\\n else do\\n split = 65-index+1\\n parse var chunk part =(split) chunk\\n buffer~overlay(part,index)\\n index = 65\\n end\\n -- Only process completely filled buffer\\n do while index=65\\n A = a0\\n B = b0\\n C = c0\\n D = d0\\n do i=0 to 63\\n select\\n when i<16 then do\\n F = D~xor(B~and(C~xor(D)))\\n g = i\\n end\\n when i<32 then do\\n F = C~xor(D~and(B~xor(C)))\\n g = (5*i+1)//16\\n end\\n when i<48 then do\\n F = B~xor(C)~xor(D)\\n g = (3*i+5)//16\\n end\\n otherwise do\\n F = C~xor(B~or(D~xor(.int32~new('ffffffff'x,\\\"C\\\"))))\\n g = (7*i)//16\\n end\\n end\\n M = .int32~new(buffer~substr(g*4+1,4)~reverse,\\\"C\\\") -- 32bit word in little-endian\\n dTemp = D\\n D = C\\n C = B\\n B = (B + (A+F+K.i+M)~bitrotate(s[i+1]))\\n A = dTemp\\n end\\n a0 = a0+A\\n b0 = b0+B\\n c0 = c0+C\\n d0 = d0+D\\n parse var chunk part 65 chunk\\n index = part~length+1\\n buffer~overlay(part,1,part~length)\\n end\\nexit\\n\\n::method digest\\n expose a0 b0 c0 d0 count buffer index K s -- instance variables\\n padlen = 64\\n if index<57 then padlen = 57-index\\n if index>57 then padlen = 121-index\\n padding = '00'x~copies(padlen)~bitor('80'x)\\n bitcount = count*8//2**64\\n lowword = bitcount//2**32\\n hiword = bitcount%2**32\\n lowcount = lowword~d2c(4)~reverse -- make it little-endian\\n hicount = hiword~d2c(4)~reverse -- make it little-endian\\n self~update(padding || lowcount || hicount)\\nreturn a0~string || b0~string || c0~string || d0~string\\n\\n-- A convenience class to encapsulate operations on non OORexx-like\\n-- things such as little-endian 32-bit words\\n::class int32 public\\n\\n::attribute arch class\\n\\n::method init class\\n self~arch = \\\"little-endian\\\" -- can be adapted for multiple architectures\\n\\n-- Method to create an int32 like object\\n-- Input can be a OORexx whole number (type=\\\"I\\\") or\\n-- a character string of 4 bytes (type=\\\"C\\\")\\n-- input truncated or padded to 32-bit word/string\\n::method init\\n expose char4 int32\\n use strict arg input, type=\\\"Integer\\\"\\n -- type must be one of \\\"I\\\"nteger or \\\"C\\\"haracter\\n t = type~subchar(1)~upper\\n select\\n when t=='I' then do\\n char4 = input~d2c(4)\\n int32 = char4~c2d\\n end\\n when t=='C' then do\\n char4 = input~right(4,'00'x)\\n int32 = char4~c2d\\n end\\n otherwise do\\n raise syntax 93.915 array(\\\"IC\\\",type)\\n end\\n end\\nexit\\n\\n::method xor -- wrapper for OORexx bitxor method\\n expose char4\\n use strict arg other\\nreturn .int32~new(char4~bitxor(other~char),\\\"C\\\")\\n\\n::method and -- wrapper for OORexx bitand method\\n expose char4\\n use strict arg other\\nreturn .int32~new(char4~bitand(other~char),\\\"C\\\")\\n\\n::method or -- wrapper for OORexx bitor method\\n expose char4\\n use strict arg other\\nreturn .int32~new(char4~bitor(other~char),\\\"C\\\")\\n\\n::method bitleft -- OORexx shift (<<) implementation\\n expose char4\\n use strict arg bits\\n bstring = char4~c2x~x2b\\n bstring = bstring~substr(bits+1)~left(bstring~length,'0')\\nreturn .int32~new(bstring~b2x~x2d)\\n\\n-- For those who like to code the shift operation in a traditional way\\n::method '<<'\\n forward to (self) message(\\\"bitleft\\\")\\n\\n::method bitright -- OORexx shift (>>) implementation\\n expose char4\\n use strict arg bits, signed=.false\\n bstring = char4~c2x~x2b\\n fill = '0'\\n if signed then fill = bstring~subchar(1)\\n bstring = bstring~left(bstring~length-bits)~right(bstring~length,fill)\\nreturn .int32~new(bstring~b2x~x2d)\\n\\n-- For those who like to code the shift operation in a traditional way\\n::method '>>'\\n forward to (self) message(\\\"bitright\\\")\\n\\n::method bitnot -- OORexx not implementation\\n expose char4\\nreturn .int32~new(char4~bitxor('ffffffff'x)~c2d,\\\"C\\\")\\n\\n::method bitrotate -- OORexx (left) rotate method\\n expose char4\\n use strict arg bits, direction='left'\\n d = direction~subchar(1)~upper\\n if d=='L' then do\\n leftpart = self~bitleft(bits)\\n rightpart = self~bitright(32-bits)\\n end\\n else do\\n leftpart = self~bitleft(32-bits)\\n rightpart = self~bitright(bits)\\n end\\nreturn rightpart~or(leftpart)\\n\\n::method int -- retrieve integer as number\\n expose int32\\nreturn int32\\n\\n::method char -- retrieve integer as characters\\n expose char4\\nreturn char4\\n\\n::method '+' -- OORexx method to add 2 .int32 instances\\n expose int32\\n use strict arg other\\nreturn .int32~new(int32+other~int)\\n\\n::method string -- retrieve integer as hexadecimal string\\n expose char4\\nreturn char4~reverse~c2x~lower\\n\\n-- Simplify function names for the necessary 'RxMath' functions\\t\\n::routine sin EXTERNAL \\\"LIBRARY rxmath RxCalcSin\\\"\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse integer;\\nuse Test::More;\\n\\nBEGIN { plan tests => 7 }\\n\\nsub A() { 0x67_45_23_01 }\\nsub B() { 0xef_cd_ab_89 }\\nsub C() { 0x98_ba_dc_fe }\\nsub D() { 0x10_32_54_76 }\\nsub MAX() { 0xFFFFFFFF }\\n\\nsub padding {\\n my $l = length (my $msg = shift() . chr(128));\\n $msg .= \\\"\\\\0\\\" x (($l%64<=56?56:120)-$l%64);\\n $l = ($l-1)*8;\\n $msg .= pack 'VV', $l & MAX , ($l >> 16 >> 16);\\n}\\n\\nsub rotate_left {\\n ($_[0] << $_[1]) | (( $_[0] >> (32 - $_[1]) ) & ((1 << $_[1]) - 1));\\n}\\n\\nsub gen_code {\\n # Discard upper 32 bits on 64 bit archs.\\n my $MSK = ((1 << 16) << 16) ? ' & ' . MAX : '';\\n my %f = (\\n FF => \\\"X0=rotate_left((X3^(X1&(X2^X3)))+X0+X4+X6$MSK,X5)+X1$MSK;\\\",\\n GG => \\\"X0=rotate_left((X2^(X3&(X1^X2)))+X0+X4+X6$MSK,X5)+X1$MSK;\\\",\\n HH => \\\"X0=rotate_left((X1^X2^X3)+X0+X4+X6$MSK,X5)+X1$MSK;\\\",\\n II => \\\"X0=rotate_left((X2^(X1|(~X3)))+X0+X4+X6$MSK,X5)+X1$MSK;\\\",\\n );\\n\\n my %s = ( # shift lengths\\n S11 => 7, S12 => 12, S13 => 17, S14 => 22, S21 => 5, S22 => 9, S23 => 14,\\n S24 => 20, S31 => 4, S32 => 11, S33 => 16, S34 => 23, S41 => 6, S42 => 10,\\n S43 => 15, S44 => 21\\n );\\n\\n my $insert = \\\"\\\\n\\\";\\n while(defined( my $data = <DATA> )) {\\n chomp $data;\\n next unless $data =~ /^[FGHI]/;\\n my ($func,@x) = split /,/, $data;\\n my $c = $f{$func};\\n $c =~ s/X(\\\\d)/$x[$1]/g;\\n $c =~ s/(S\\\\d{2})/$s{$1}/;\\n $c =~ s/^(.*)=rotate_left\\\\((.*),(.*)\\\\)\\\\+(.*)$//;\\n\\n my $su = 32 - $3;\\n my $sh = (1 << $3) - 1;\\n\\n $c = \\\"$1=(((\\\\$r=$2)<<$3)|((\\\\$r>>$su)&$sh))+$4\\\";\\n\\n $insert .= \\\"\\\\t$c\\\\n\\\";\\n }\\n close DATA;\\n\\n my $dump = '\\n sub round {\\n my ($a,$b,$c,$d) = @_[0 .. 3];\\n my $r;' . $insert . '\\n $_[0]+$a' . $MSK . ', $_[1]+$b ' . $MSK .\\n ', $_[2]+$c' . $MSK . ', $_[3]+$d' . $MSK . ';\\n }';\\n eval $dump;\\n}\\n\\ngen_code();\\n\\nsub _encode_hex { unpack 'H*', $_[0] }\\n\\nsub md5 {\\n my $message = padding(join'',@_);\\n my ($a,$b,$c,$d) = (A,B,C,D);\\n my $i;\\n for $i (0 .. (length $message)/64-1) {\\n my @X = unpack 'V16', substr $message,$i*64,64;\\n ($a,$b,$c,$d) = round($a,$b,$c,$d,@X);\\n }\\n pack 'V4',$a,$b,$c,$d;\\n}\\n\\nmy $strings = {\\n 'd41d8cd98f00b204e9800998ecf8427e' => '',\\n '0cc175b9c0f1b6a831c399e269772661' => 'a',\\n '900150983cd24fb0d6963f7d28e17f72' => 'abc',\\n 'f96b697d7cb7938d525a2f31aaf161d0' => 'message digest',\\n 'c3fcd3d76192e4007dfb496cca67e13b' => 'abcdefghijklmnopqrstuvwxyz',\\n 'd174ab98d277d9f5a5611c2c9f419d9f' => 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789',\\n '57edf4a22be3c955ac49da2e2107b67a' => '12345678901234567890123456789012345678901234567890123456789012345678901234567890',\\n};\\n\\nfor my $k (keys %$strings) {\\n my $digest = _encode_hex md5($strings->{$k});\\n is($digest, $k, \\\"$digest is MD5 digest $strings->{$k}\\\");\\n}\\n\\n__DATA__\\nFF,$a,$b,$c,$d,$_[4],7,0xd76aa478,/* 1 */\\nFF,$d,$a,$b,$c,$_[5],12,0xe8c7b756,/* 2 */\\nFF,$c,$d,$a,$b,$_[6],17,0x242070db,/* 3 */\\nFF,$b,$c,$d,$a,$_[7],22,0xc1bdceee,/* 4 */\\nFF,$a,$b,$c,$d,$_[8],7,0xf57c0faf,/* 5 */\\nFF,$d,$a,$b,$c,$_[9],12,0x4787c62a,/* 6 */\\nFF,$c,$d,$a,$b,$_[10],17,0xa8304613,/* 7 */\\nFF,$b,$c,$d,$a,$_[11],22,0xfd469501,/* 8 */\\nFF,$a,$b,$c,$d,$_[12],7,0x698098d8,/* 9 */\\nFF,$d,$a,$b,$c,$_[13],12,0x8b44f7af,/* 10 */\\nFF,$c,$d,$a,$b,$_[14],17,0xffff5bb1,/* 11 */\\nFF,$b,$c,$d,$a,$_[15],22,0x895cd7be,/* 12 */\\nFF,$a,$b,$c,$d,$_[16],7,0x6b901122,/* 13 */\\nFF,$d,$a,$b,$c,$_[17],12,0xfd987193,/* 14 */\\nFF,$c,$d,$a,$b,$_[18],17,0xa679438e,/* 15 */\\nFF,$b,$c,$d,$a,$_[19],22,0x49b40821,/* 16 */\\nGG,$a,$b,$c,$d,$_[5],5,0xf61e2562,/* 17 */\\nGG,$d,$a,$b,$c,$_[10],9,0xc040b340,/* 18 */\\nGG,$c,$d,$a,$b,$_[15],14,0x265e5a51,/* 19 */\\nGG,$b,$c,$d,$a,$_[4],20,0xe9b6c7aa,/* 20 */\\nGG,$a,$b,$c,$d,$_[9],5,0xd62f105d,/* 21 */\\nGG,$d,$a,$b,$c,$_[14],9,0x2441453,/* 22 */\\nGG,$c,$d,$a,$b,$_[19],14,0xd8a1e681,/* 23 */\\nGG,$b,$c,$d,$a,$_[8],20,0xe7d3fbc8,/* 24 */\\nGG,$a,$b,$c,$d,$_[13],5,0x21e1cde6,/* 25 */\\nGG,$d,$a,$b,$c,$_[18],9,0xc33707d6,/* 26 */\\nGG,$c,$d,$a,$b,$_[7],14,0xf4d50d87,/* 27 */\\nGG,$b,$c,$d,$a,$_[12],20,0x455a14ed,/* 28 */\\nGG,$a,$b,$c,$d,$_[17],5,0xa9e3e905,/* 29 */\\nGG,$d,$a,$b,$c,$_[6],9,0xfcefa3f8,/* 30 */\\nGG,$c,$d,$a,$b,$_[11],14,0x676f02d9,/* 31 */\\nGG,$b,$c,$d,$a,$_[16],20,0x8d2a4c8a,/* 32 */\\nHH,$a,$b,$c,$d,$_[9],4,0xfffa3942,/* 33 */\\nHH,$d,$a,$b,$c,$_[12],11,0x8771f681,/* 34 */\\nHH,$c,$d,$a,$b,$_[15],16,0x6d9d6122,/* 35 */\\nHH,$b,$c,$d,$a,$_[18],23,0xfde5380c,/* 36 */\\nHH,$a,$b,$c,$d,$_[5],4,0xa4beea44,/* 37 */\\nHH,$d,$a,$b,$c,$_[8],11,0x4bdecfa9,/* 38 */\\nHH,$c,$d,$a,$b,$_[11],16,0xf6bb4b60,/* 39 */\\nHH,$b,$c,$d,$a,$_[14],23,0xbebfbc70,/* 40 */\\nHH,$a,$b,$c,$d,$_[17],4,0x289b7ec6,/* 41 */\\nHH,$d,$a,$b,$c,$_[4],11,0xeaa127fa,/* 42 */\\nHH,$c,$d,$a,$b,$_[7],16,0xd4ef3085,/* 43 */\\nHH,$b,$c,$d,$a,$_[10],23,0x4881d05,/* 44 */\\nHH,$a,$b,$c,$d,$_[13],4,0xd9d4d039,/* 45 */\\nHH,$d,$a,$b,$c,$_[16],11,0xe6db99e5,/* 46 */\\nHH,$c,$d,$a,$b,$_[19],16,0x1fa27cf8,/* 47 */\\nHH,$b,$c,$d,$a,$_[6],23,0xc4ac5665,/* 48 */\\nII,$a,$b,$c,$d,$_[4],6,0xf4292244,/* 49 */\\nII,$d,$a,$b,$c,$_[11],10,0x432aff97,/* 50 */\\nII,$c,$d,$a,$b,$_[18],15,0xab9423a7,/* 51 */\\nII,$b,$c,$d,$a,$_[9],21,0xfc93a039,/* 52 */\\nII,$a,$b,$c,$d,$_[16],6,0x655b59c3,/* 53 */\\nII,$d,$a,$b,$c,$_[7],10,0x8f0ccc92,/* 54 */\\nII,$c,$d,$a,$b,$_[14],15,0xffeff47d,/* 55 */\\nII,$b,$c,$d,$a,$_[5],21,0x85845dd1,/* 56 */\\nII,$a,$b,$c,$d,$_[12],6,0x6fa87e4f,/* 57 */\\nII,$d,$a,$b,$c,$_[19],10,0xfe2ce6e0,/* 58 */\\nII,$c,$d,$a,$b,$_[10],15,0xa3014314,/* 59 */\\nII,$b,$c,$d,$a,$_[17],21,0x4e0811a1,/* 60 */\\nII,$a,$b,$c,$d,$_[8],6,0xf7537e82,/* 61 */\\nII,$d,$a,$b,$c,$_[15],10,0xbd3af235,/* 62 */\\nII,$c,$d,$a,$b,$_[6],15,0x2ad7d2bb,/* 63 */\\nII,$b,$c,$d,$a,$_[13],21,0xeb86d391,/* 64 */\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- demo\\\\rosetta\\\\md5.exw</span>\\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;\\\">uxor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">data1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">data2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">result</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">xor_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">data1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">data2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">result</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">result</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">#100000000</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">result</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;\\\">uor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">data1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">data2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">result</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">or_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">data1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">data2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">result</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">result</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">#100000000</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">result</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;\\\">r32</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: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">#100000000</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;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">bits</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- left rotate the bits of a 32-bit number by the specified number of bits</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">bits</span><span style=\\\"color: #0000FF;\\\">))+</span><span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">bits</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;\\\">K</span> <span style=\\\"color: #0000FF;\\\">=</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">#d76aa478</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#e8c7b756</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#242070db</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#c1bdceee</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#f57c0faf</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#4787c62a</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#a8304613</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#fd469501</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">#698098d8</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#8b44f7af</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#ffff5bb1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#895cd7be</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#6b901122</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#fd987193</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#a679438e</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#49b40821</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">#f61e2562</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#c040b340</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#265e5a51</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#e9b6c7aa</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#d62f105d</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#02441453</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#d8a1e681</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#e7d3fbc8</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">#21e1cde6</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#c33707d6</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#f4d50d87</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#455a14ed</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#a9e3e905</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#fcefa3f8</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#676f02d9</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#8d2a4c8a</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">#fffa3942</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#8771f681</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#6d9d6122</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#fde5380c</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#a4beea44</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#4bdecfa9</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#f6bb4b60</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#bebfbc70</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">#289b7ec6</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#eaa127fa</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#d4ef3085</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#04881d05</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#d9d4d039</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#e6db99e5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#1fa27cf8</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#c4ac5665</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">#f4292244</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#432aff97</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#ab9423a7</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#fc93a039</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#655b59c3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#8f0ccc92</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#ffeff47d</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#85845dd1</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">#6fa87e4f</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#fe2ce6e0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#a3014314</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#4e0811a1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#f7537e82</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#bd3af235</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#2ad7d2bb</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#eb86d391</span><span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">m_block</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;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">13</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">14</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">15</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">16</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">16</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">15</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">14</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">13</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">15</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">14</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;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">13</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">16</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">15</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">13</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;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">16</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">14</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">c_words</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">#67452301</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">#efcdab89</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">#98badcfe</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">#10325476</span><span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">words</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">divide_in_words</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">message</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Divides the string into words (32-bit numbers)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">message</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;\\\">res</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>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">word</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;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">bytes_to_int</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">message</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">word</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;\\\">word</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">4</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;\\\">process_block</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Updates the words according to the contents of the block</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">d</span>\\n\\n <span style=\\\"color: #000000;\\\">block</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">divide_in_words</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000000;\\\">a</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>\\n <span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">]</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Round 1</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">16</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span> <span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span> <span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">not_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">))),</span> <span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</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><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">not_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">))),</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">not_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">))),</span><span style=\\\"color: #000000;\\\">17</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">not_bits</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;\\\">22</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Round 2</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">17</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">32</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span> <span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span> <span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">not_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)))),</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">not_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)))),</span> <span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">not_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">)))),</span><span style=\\\"color: #000000;\\\">14</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</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: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">not_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">)))),</span><span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Round 3</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">33</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">48</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span> <span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span> <span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uxor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">xor_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">))),</span> <span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uxor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">xor_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">))),</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uxor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">xor_bits</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><span style=\\\"color: #000000;\\\">16</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uxor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">xor_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">))),</span><span style=\\\"color: #000000;\\\">23</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Round 4</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">49</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">64</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span> <span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span> <span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uxor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">or_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">not_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)))),</span> <span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uxor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">or_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">not_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)))),</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uxor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">or_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">not_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">)))),</span><span style=\\\"color: #000000;\\\">15</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rol</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">m_block</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">]]+</span><span style=\\\"color: #000000;\\\">K</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">step</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">uxor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">or_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">not_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">)))),</span><span style=\\\"color: #000000;\\\">21</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Update the words</span>\\n <span style=\\\"color: #000000;\\\">words</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">deep_copy</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <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: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</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;\\\">a</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">words</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;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">words</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: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">4</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;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">pad_message</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">message</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Add bytes to the end of the message so it can be divided\\n -- in an exact number of 64-byte blocks.</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;\\\">message</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">bytes_to_add</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">64</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">64</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">bytes_to_add</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">64</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">bytes_to_add</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\\n <span style=\\\"color: #000000;\\\">message</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">deep_copy</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">message</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">message</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">#80</span>\\n <span style=\\\"color: #000000;\\\">message</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;\\\">bytes_to_add</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">message</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">int_to_bytes</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">8</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>\\n\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">message</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n\\n <span style=\\\"color: #008080;\\\">global</span> <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">md5</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">message</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Given a string, returns a 16-byte hash of it.</span>\\n\\n <span style=\\\"color: #000000;\\\">words</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">c_words</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- Initialize the H words</span>\\n\\n <span style=\\\"color: #000000;\\\">message</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pad_message</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">message</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- Add bytes to the message\\n\\n -- Process each 64-byte block</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">block</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;\\\">message</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">64</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">process_block</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">message</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">block</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">63</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Convert hash into bytes</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">int_to_bytes</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: #000080;font-style:italic;\\\">-- Return the hash</span>\\n <span style=\\\"color: #7060A8;\\\">int_to_bytes</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">])&</span>\\n <span style=\\\"color: #7060A8;\\\">int_to_bytes</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">])&</span>\\n <span style=\\\"color: #7060A8;\\\">int_to_bytes</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">])</span>\\n\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\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;\\\">or</span> <span style=\\\"color: #7060A8;\\\">include_file</span><span style=\\\"color: #0000FF;\\\">()=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">fmt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"0x%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X\\\\n\\\"</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: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">md5</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: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">md5</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"a\\\"</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: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">md5</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"abc\\\"</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: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">md5</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"message digest\\\"</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: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">md5</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"abcdefghijklmnopqrstuvwxyz\\\"</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: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">md5</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"</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: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">md5</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(scl 12)\\n(load \\\"@lib/math.l\\\") # For 'sin'\\n\\n(de *Md5-R\\n 7 12 17 22 7 12 17 22 7 12 17 22 7 12 17 22\\n 5 9 14 20 5 9 14 20 5 9 14 20 5 9 14 20\\n 4 11 16 23 4 11 16 23 4 11 16 23 4 11 16 23\\n 6 10 15 21 6 10 15 21 6 10 15 21 6 10 15 21 )\\n\\n(de *Md5-K\\n ~(make\\n (for I 64\\n (link\\n (/ (* (abs (sin (* I 1.0))) `(** 2 32)) 1.0) ) ) ) )\\n\\n(de mod32 (N)\\n (& N `(hex \\\"FFFFFFFF\\\")) )\\n\\n(de not32 (N)\\n (x| N `(hex \\\"FFFFFFFF\\\")) )\\n\\n(de add32 @\\n (mod32 (pass +)) )\\n\\n(de leftRotate (X C)\\n (| (mod32 (>> (- C) X)) (>> (- 32 C) X)) )\\n\\n(de md5 (Str)\\n (let Len (length Str)\\n (setq Str\\n (conc\\n (need\\n (- 8 (* 64 (/ (+ Len 1 8 63) 64))) # Pad to 64-8 bytes\\n (conc\\n (mapcar char (chop Str)) # Works only with ASCII characters\\n (cons `(hex \\\"80\\\")) ) # '1' bit\\n 0 ) # Pad with '0'\\n (make\\n (setq Len (* 8 Len))\\n (do 8\\n (link (& Len 255))\\n (setq Len (>> 8 Len )) ) ) ) ) )\\n (let\\n (H0 `(hex \\\"67452301\\\")\\n H1 `(hex \\\"EFCDAB89\\\")\\n H2 `(hex \\\"98BADCFE\\\")\\n H3 `(hex \\\"10325476\\\") )\\n (while Str\\n (let\\n (A H0 B H1 C H2 D H3\\n W (make\\n (do 16\\n (link\\n (apply |\\n (mapcar >> (0 -8 -16 -24) (cut 4 'Str)) ) ) ) ) )\\n (use (Tmp F G)\\n (for I 64\\n (cond\\n ((>= 16 I)\\n (setq\\n F (| (& B C) (& (not32 B) D))\\n G I ) )\\n ((>= 32 I)\\n (setq\\n F (| (& D B) (& (not32 D) C))\\n G (inc (& (inc (* 5 (dec I))) 15)) ) )\\n ((>= 48 I)\\n (setq\\n F (x| B C D)\\n G (inc (& (+ 5 (* 3 (dec I))) 15)) ) )\\n (T\\n (setq\\n F (x| C (| B (not32 D)))\\n G (inc (& (* 7 (dec I)) 15)) ) ) )\\n (setq\\n Tmp D\\n D C\\n C B\\n B\\n (add32 B\\n (leftRotate\\n (add32 A F (get *Md5-K I) (get W G))\\n (get *Md5-R I) ) )\\n A Tmp ) ) )\\n (setq\\n H0 (add32 H0 A)\\n H1 (add32 H1 B)\\n H2 (add32 H2 C)\\n H3 (add32 H3 D) ) ) )\\n (pack\\n (make\\n (for N (list H0 H1 H2 H3)\\n (do 4 # Convert to little endian hex string\\n (link (pad 2 (hex (& N 255))))\\n (setq N (>> 8 N)) ) ) ) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"import math\\n\\nrotate_amounts = [7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21]\\n\\nconstants = [int(abs(math.sin(i+1)) * 2**32) & 0xFFFFFFFF for i in range(64)]\\n\\ninit_values = [0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476]\\n\\nfunctions = 16*[lambda b, c, d: (b & c) | (~b & d)] + \\\\\\n 16*[lambda b, c, d: (d & b) | (~d & c)] + \\\\\\n 16*[lambda b, c, d: b ^ c ^ d] + \\\\\\n 16*[lambda b, c, d: c ^ (b | ~d)]\\n\\nindex_functions = 16*[lambda i: i] + \\\\\\n 16*[lambda i: (5*i + 1)%16] + \\\\\\n 16*[lambda i: (3*i + 5)%16] + \\\\\\n 16*[lambda i: (7*i)%16]\\n\\ndef left_rotate(x, amount):\\n x &= 0xFFFFFFFF\\n return ((x<<amount) | (x>>(32-amount))) & 0xFFFFFFFF\\n\\ndef md5(message):\\n\\n message = bytearray(message) #copy our input into a mutable buffer\\n orig_len_in_bits = (8 * len(message)) & 0xffffffffffffffff\\n message.append(0x80)\\n while len(message)%64 != 56:\\n message.append(0)\\n message += orig_len_in_bits.to_bytes(8, byteorder='little')\\n\\n hash_pieces = init_values[:]\\n\\n for chunk_ofst in range(0, len(message), 64):\\n a, b, c, d = hash_pieces\\n chunk = message[chunk_ofst:chunk_ofst+64]\\n for i in range(64):\\n f = functions[i](b, c, d)\\n g = index_functions[i](i)\\n to_rotate = a + f + constants[i] + int.from_bytes(chunk[4*g:4*g+4], byteorder='little')\\n new_b = (b + left_rotate(to_rotate, rotate_amounts[i])) & 0xFFFFFFFF\\n a, b, c, d = d, new_b, b, c\\n for i, val in enumerate([a, b, c, d]):\\n hash_pieces[i] += val\\n hash_pieces[i] &= 0xFFFFFFFF\\n\\n return sum(x<<(32*i) for i, x in enumerate(hash_pieces))\\n\\ndef md5_to_hex(digest):\\n raw = digest.to_bytes(16, byteorder='little')\\n return '{:032x}'.format(int.from_bytes(raw, byteorder='big'))\\n\\nif __name__=='__main__':\\n demo = [b\\\"\\\", b\\\"a\\\", b\\\"abc\\\", b\\\"message digest\\\", b\\\"abcdefghijklmnopqrstuvwxyz\\\",\\n b\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\",\\n b\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"]\\n for message in demo:\\n print(md5_to_hex(md5(message)),' <= \\\"',message.decode('ascii'),'\\\"', sep='')\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n(require file/md5)\\n(md5 #\\\"Rosetta Code\\\")\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#\\\"cca1bf66b09554e10f837838c3d3efb1\\\"\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"proto md5($msg) returns Blob is export {*}\\nmulti md5(Str $msg) { md5 $msg.encode }\\nmulti md5(Blob $msg) {\\n my \\\\bits = 8 * $msg.elems;\\n my buf8 $buf .= new;\\n $buf.write-uint32: $buf.elems, $_, LittleEndian for\\n reduce -> Blob $blob, blob32 $X {\\n blob32.new: $blob Z+\\n reduce -> $b, $i {\\n blob32.new:\\n $b[3],\\n $b[1] +\\n -> uint32 \\\\x, \\\\n { (x +< n) +| (x +> (32-n)) }(\\n ($b[0] + (BEGIN Array.new:\\n { ($^x +& $^y) +| (+^$x +& $^z) },\\n { ($^x +& $^z) +| ($^y +& +^$z) },\\n { $^x +^ $^y +^ $^z },\\n { $^y +^ ($^x +| +^$^z) }\\n )[$i div 16](|$b[1..3]) +\\n (BEGIN blob32.new: map &floor ∘ * * 2**32 ∘ &abs ∘ &sin ∘ * + 1, ^64)[$i] +\\n $X[(BEGIN Blob.new: 16 X[R%] flat ($++, 5*$++ + 1, 3*$++ + 5, 7*$++) Xxx 16)[$i]]\\n ) mod 2**32,\\n (BEGIN flat < 7 12 17 22 5 9 14 20 4 11 16 23 6 10 15 21 >.rotor(4) Xxx 4)[$i]\\n ),\\n $b[1],\\n $b[2]\\n }, $blob, |^64;\\n },\\n (BEGIN blob32.new: 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476),\\n |map { blob32.new: @$_ },\\n {\\n $^b.push(blob8.new(@$_).read-uint32(0)) for (@$msg, 0x80, 0x00 xx (-(bits div 8 + 1 + 8) % 64))\\n .flat.rotor(4);\\n $b.write-uint64: $b.elems, bits, LittleEndian;\\n $b;\\n }(buf32.new)\\n .rotor(16);\\n $buf;\\n}\\n\\nCHECK {\\n use Test;\\n\\n for 'd41d8cd98f00b204e9800998ecf8427e', '',\\n '0cc175b9c0f1b6a831c399e269772661', 'a',\\n '900150983cd24fb0d6963f7d28e17f72', 'abc',\\n 'f96b697d7cb7938d525a2f31aaf161d0', 'message digest',\\n 'c3fcd3d76192e4007dfb496cca67e13b', 'abcdefghijklmnopqrstuvwxyz',\\n 'd174ab98d277d9f5a5611c2c9f419d9f', 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789',\\n '57edf4a22be3c955ac49da2e2107b67a', '12345678901234567890123456789012345678901234567890123456789012345678901234567890'\\n -> $expected, $msg {\\n my $digest = md5($msg).list».fmt('%02x').join;\\n is($digest, $expected, \\\"$digest is MD5 digest of '$msg'\\\");\\n }\\n done-testing;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program tests the MD5 procedure (below) as per a test suite from IETF RFC (1321).*/\\n@.1 = /*─────MD5 test suite [from above doc].*/\\n@.2 = 'a'\\n@.3 = 'abc'\\n@.4 = 'message digest'\\n@.5 = 'abcdefghijklmnopqrstuvwxyz'\\n@.6 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'\\n@.7 = 12345678901234567890123456789012345678901234567890123456789012345678901234567890\\n@.0 = 7 /* [↑] last value doesn't need quotes.*/\\n do m=1 for @.0; say /*process each of the seven messages. */\\n say ' in =' @.m /*display the in message. */\\n say 'out =' MD5(@.m) /* \\\" \\\" out \\\" */\\n end /*m*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nMD5: procedure; parse arg !; numeric digits 20 /*insure there's enough decimal digits.*/\\n a= '67452301'x; b= \\\"efcdab89\\\"x; c= '98badcfe'x; d= \\\"10325476\\\"x\\n #= length(!) /*length in bytes of the input message.*/\\n L= #*8//512; if L<448 then plus= 448 - L /*is the length less than 448 ? */\\n if L>448 then plus= 960 - L /* \\\" \\\" \\\" greater \\\" \\\" */\\n if L=448 then plus= 512 /* \\\" \\\" \\\" equal to \\\" */\\n /* [↓] a little of this, ··· */\\n $=! || \\\"80\\\"x || copies('0'x,plus%8-1)reverse(right(d2c(8*#), 4, '0'x)) || '00000000'x\\n /* [↑] ··· and a little of that.*/\\n do j=0 for length($) % 64 /*process the message (lots of steps).*/\\n a_= a; b_= b; c_= c; d_= d /*save the original values for later.*/\\n chunk= j * 64 /*calculate the size of the chunks. */\\n do k=1 for 16 /*process the message in chunks. */\\n !.k= reverse( substr($, chunk + 1 + 4*(k-1), 4) ) /*magic stuff.*/\\n end /*k*/ /*────step────*/\\n a = .p1( a, b, c, d, 0, 7, 3614090360) /*■■■■ 1 ■■■■*/\\n d = .p1( d, a, b, c, 1, 12, 3905402710) /*■■■■ 2 ■■■■*/\\n c = .p1( c, d, a, b, 2, 17, 606105819) /*■■■■ 3 ■■■■*/\\n b = .p1( b, c, d, a, 3, 22, 3250441966) /*■■■■ 4 ■■■■*/\\n a = .p1( a, b, c, d, 4, 7, 4118548399) /*■■■■ 5 ■■■■*/\\n d = .p1( d, a, b, c, 5, 12, 1200080426) /*■■■■ 6 ■■■■*/\\n c = .p1( c, d, a, b, 6, 17, 2821735955) /*■■■■ 7 ■■■■*/\\n b = .p1( b, c, d, a, 7, 22, 4249261313) /*■■■■ 8 ■■■■*/\\n a = .p1( a, b, c, d, 8, 7, 1770035416) /*■■■■ 9 ■■■■*/\\n d = .p1( d, a, b, c, 9, 12, 2336552879) /*■■■■ 10 ■■■■*/\\n c = .p1( c, d, a, b, 10, 17, 4294925233) /*■■■■ 11 ■■■■*/\\n b = .p1( b, c, d, a, 11, 22, 2304563134) /*■■■■ 12 ■■■■*/\\n a = .p1( a, b, c, d, 12, 7, 1804603682) /*■■■■ 13 ■■■■*/\\n d = .p1( d, a, b, c, 13, 12, 4254626195) /*■■■■ 14 ■■■■*/\\n c = .p1( c, d, a, b, 14, 17, 2792965006) /*■■■■ 15 ■■■■*/\\n b = .p1( b, c, d, a, 15, 22, 1236535329) /*■■■■ 16 ■■■■*/\\n a = .p2( a, b, c, d, 1, 5, 4129170786) /*■■■■ 17 ■■■■*/\\n d = .p2( d, a, b, c, 6, 9, 3225465664) /*■■■■ 18 ■■■■*/\\n c = .p2( c, d, a, b, 11, 14, 643717713) /*■■■■ 19 ■■■■*/\\n b = .p2( b, c, d, a, 0, 20, 3921069994) /*■■■■ 20 ■■■■*/\\n a = .p2( a, b, c, d, 5, 5, 3593408605) /*■■■■ 21 ■■■■*/\\n d = .p2( d, a, b, c, 10, 9, 38016083) /*■■■■ 22 ■■■■*/\\n c = .p2( c, d, a, b, 15, 14, 3634488961) /*■■■■ 23 ■■■■*/\\n b = .p2( b, c, d, a, 4, 20, 3889429448) /*■■■■ 24 ■■■■*/\\n a = .p2( a, b, c, d, 9, 5, 568446438) /*■■■■ 25 ■■■■*/\\n d = .p2( d, a, b, c, 14, 9, 3275163606) /*■■■■ 26 ■■■■*/\\n c = .p2( c, d, a, b, 3, 14, 4107603335) /*■■■■ 27 ■■■■*/\\n b = .p2( b, c, d, a, 8, 20, 1163531501) /*■■■■ 28 ■■■■*/\\n a = .p2( a, b, c, d, 13, 5, 2850285829) /*■■■■ 29 ■■■■*/\\n d = .p2( d, a, b, c, 2, 9, 4243563512) /*■■■■ 30 ■■■■*/\\n c = .p2( c, d, a, b, 7, 14, 1735328473) /*■■■■ 31 ■■■■*/\\n b = .p2( b, c, d, a, 12, 20, 2368359562) /*■■■■ 32 ■■■■*/\\n a = .p3( a, b, c, d, 5, 4, 4294588738) /*■■■■ 33 ■■■■*/\\n d = .p3( d, a, b, c, 8, 11, 2272392833) /*■■■■ 34 ■■■■*/\\n c = .p3( c, d, a, b, 11, 16, 1839030562) /*■■■■ 35 ■■■■*/\\n b = .p3( b, c, d, a, 14, 23, 4259657740) /*■■■■ 36 ■■■■*/\\n a = .p3( a, b, c, d, 1, 4, 2763975236) /*■■■■ 37 ■■■■*/\\n d = .p3( d, a, b, c, 4, 11, 1272893353) /*■■■■ 38 ■■■■*/\\n c = .p3( c, d, a, b, 7, 16, 4139469664) /*■■■■ 39 ■■■■*/\\n b = .p3( b, c, d, a, 10, 23, 3200236656) /*■■■■ 40 ■■■■*/\\n a = .p3( a, b, c, d, 13, 4, 681279174) /*■■■■ 41 ■■■■*/\\n d = .p3( d, a, b, c, 0, 11, 3936430074) /*■■■■ 42 ■■■■*/\\n c = .p3( c, d, a, b, 3, 16, 3572445317) /*■■■■ 43 ■■■■*/\\n b = .p3( b, c, d, a, 6, 23, 76029189) /*■■■■ 44 ■■■■*/\\n a = .p3( a, b, c, d, 9, 4, 3654602809) /*■■■■ 45 ■■■■*/\\n d = .p3( d, a, b, c, 12, 11, 3873151461) /*■■■■ 46 ■■■■*/\\n c = .p3( c, d, a, b, 15, 16, 530742520) /*■■■■ 47 ■■■■*/\\n b = .p3( b, c, d, a, 2, 23, 3299628645) /*■■■■ 48 ■■■■*/\\n a = .p4( a, b, c, d, 0, 6, 4096336452) /*■■■■ 49 ■■■■*/\\n d = .p4( d, a, b, c, 7, 10, 1126891415) /*■■■■ 50 ■■■■*/\\n c = .p4( c, d, a, b, 14, 15, 2878612391) /*■■■■ 51 ■■■■*/\\n b = .p4( b, c, d, a, 5, 21, 4237533241) /*■■■■ 52 ■■■■*/\\n a = .p4( a, b, c, d, 12, 6, 1700485571) /*■■■■ 53 ■■■■*/\\n d = .p4( d, a, b, c, 3, 10, 2399980690) /*■■■■ 54 ■■■■*/\\n c = .p4( c, d, a, b, 10, 15, 4293915773) /*■■■■ 55 ■■■■*/\\n b = .p4( b, c, d, a, 1, 21, 2240044497) /*■■■■ 56 ■■■■*/\\n a = .p4( a, b, c, d, 8, 6, 1873313359) /*■■■■ 57 ■■■■*/\\n d = .p4( d, a, b, c, 15, 10, 4264355552) /*■■■■ 58 ■■■■*/\\n c = .p4( c, d, a, b, 6, 15, 2734768916) /*■■■■ 59 ■■■■*/\\n b = .p4( b, c, d, a, 13, 21, 1309151649) /*■■■■ 60 ■■■■*/\\n a = .p4( a, b, c, d, 4, 6, 4149444226) /*■■■■ 61 ■■■■*/\\n d = .p4( d, a, b, c, 11, 10, 3174756917) /*■■■■ 62 ■■■■*/\\n c = .p4( c, d, a, b, 2, 15, 718787259) /*■■■■ 63 ■■■■*/\\n b = .p4( b, c, d, a, 9, 21, 3951481745) /*■■■■ 64 ■■■■*/\\n a = .a(a_, a); b=.a(b_, b); c=.a(c_, c); d=.a(d_, d)\\n end /*j*/\\n return .rx(a).rx(b).rx(c).rx(d) /*same as: .rx(a) || .rx(b) || ··· */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n.a: return right( d2c( c2d( arg(1) ) + c2d( arg(2) ) ), 4, '0'x)\\n.h: return bitxor( bitxor( arg(1), arg(2) ), arg(3) )\\n.i: return bitxor( arg(2), bitor(arg(1), bitxor(arg(3), 'ffffffff'x) ) )\\n.f: return bitor( bitand(arg(1), arg(2)), bitand(bitxor(arg(1), 'ffffffff'x), arg(3) ) )\\n.g: return bitor( bitand(arg(1), arg(3)), bitand(arg(2), bitxor(arg(3), 'ffffffff'x) ) )\\n.rx: return c2x( reverse( arg(1) ) )\\n.Lr: procedure; parse arg _,#; if #==0 then return _ /*left bit rotate.*/\\n ?=x2b(c2x(_)); return x2c( b2x( right(? || left(?, #), length(?) ) ) )\\n.p1: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n + 1\\n return .a(.Lr(right(d2c(_+c2d(w) + c2d(.f(x,y,z)) + c2d(!.n)),4,'0'x),m),x)\\n.p2: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n + 1\\n return .a(.Lr(right(d2c(_+c2d(w) + c2d(.g(x,y,z)) + c2d(!.n)),4,'0'x),m),x)\\n.p3: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n + 1\\n return .a(.Lr(right(d2c(_+c2d(w) + c2d(.h(x,y,z)) + c2d(!.n)),4,'0'x),m),x)\\n.p4: procedure expose !.; parse arg w,x,y,z,n,m,_; n=n + 1\\n return .a(.Lr(right(d2c(c2d(w) + c2d(.i(x,y,z)) + c2d(!.n)+_),4,'0'x),m),x)\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"**FREE\\nCtl-opt MAIN(Main);\\nCtl-opt DFTACTGRP(*NO) ACTGRP(*NEW);\\n\\ndcl-pr QDCXLATE EXTPGM('QDCXLATE');\\n dataLen packed(5 : 0) CONST;\\n data char(32767) options(*VARSIZE);\\n conversionTable char(10) CONST;\\nend-pr;\\n\\ndcl-c MASK32 CONST(4294967295);\\ndcl-s SHIFT_AMTS int(3) dim(16) CTDATA PERRCD(16);\\ndcl-s MD5_TABLE_T int(20) dim(64) CTDATA PERRCD(4);\\n\\ndcl-proc Main;\\n dcl-s inputData char(45);\\n dcl-s inputDataLen int(10) INZ(0);\\n dcl-s outputHash char(16);\\n dcl-s outputHashHex char(32);\\n\\n DSPLY 'Input: ' '' inputData;\\n inputData = %trim(inputData);\\n inputDataLen = %len(%trim(inputData));\\n DSPLY ('Input=' + inputData);\\n DSPLY ('InputLen=' + %char(inputDataLen));\\n\\n // Convert from EBCDIC to ASCII\\n if inputDataLen > 0;\\n QDCXLATE(inputDataLen : inputData : 'QTCPASC');\\n endif;\\n CalculateMD5(inputData : inputDataLen : outputHash);\\n // Convert to hex\\n ConvertToHex(outputHash : 16 : outputHashHex);\\n DSPLY ('MD5: ' + outputHashHex);\\n return;\\nend-proc;\\n\\ndcl-proc CalculateMD5;\\n dcl-pi *N;\\n message char(65535) options(*VARSIZE) CONST;\\n messageLen int(10) value;\\n outputHash char(16);\\n end-pi;\\n dcl-s numBlocks int(10);\\n dcl-s padding char(72);\\n dcl-s a int(20) INZ(1732584193);\\n dcl-s b int(20) INZ(4023233417);\\n dcl-s c int(20) INZ(2562383102);\\n dcl-s d int(20) INZ(271733878);\\n dcl-s buffer int(20) dim(16) INZ(0);\\n dcl-s i int(10);\\n dcl-s j int(10);\\n dcl-s k int(10);\\n dcl-s multiplier int(20);\\n dcl-s index int(10);\\n dcl-s originalA int(20);\\n dcl-s originalB int(20);\\n dcl-s originalC int(20);\\n dcl-s originalD int(20);\\n dcl-s div16 int(10);\\n dcl-s f int(20);\\n dcl-s tempInt int(20);\\n dcl-s bufferIndex int(10);\\n dcl-ds byteToInt QUALIFIED;\\n n int(5) INZ(0);\\n c char(1) OVERLAY(n : 2);\\n end-ds;\\n\\n numBlocks = (messageLen + 8) / 64 + 1;\\n MD5_FillPadding(messageLen : numBlocks : padding);\\n for i = 0 to numBlocks - 1;\\n index = i * 64;\\n\\n // Read message as little-endian 32-bit words\\n for j = 1 to 16;\\n multiplier = 1;\\n for k = 1 to 4;\\n index += 1;\\n if index <= messageLen;\\n byteToInt.c = %subst(message : index : 1);\\n else;\\n byteToInt.c = %subst(padding : index - messageLen : 1);\\n endif;\\n buffer(j) += multiplier * byteToInt.n;\\n multiplier *= 256;\\n endfor;\\n endfor;\\n\\n originalA = a;\\n originalB = b;\\n originalC = c;\\n originalD = d;\\n\\n for j = 0 to 63;\\n div16 = j / 16;\\n select;\\n when div16 = 0;\\n f = %bitor(%bitand(b : c) : %bitand(%bitnot(b) : d));\\n bufferIndex = j;\\n\\n when div16 = 1;\\n f = %bitor(%bitand(b : d) : %bitand(c : %bitnot(d)));\\n bufferIndex = %bitand(j * 5 + 1 : 15);\\n\\n when div16 = 2;\\n f = %bitxor(b : %bitxor(c : d));\\n bufferIndex = %bitand(j * 3 + 5 : 15);\\n\\n when div16 = 3;\\n f = %bitxor(c : %bitor(b : Mask32Bit(%bitnot(d))));\\n bufferIndex = %bitand(j * 7 : 15);\\n endsl;\\n tempInt = Mask32Bit(b + RotateLeft32Bit(a + f + buffer(bufferIndex + 1) + MD5_TABLE_T(j + 1) :\\n SHIFT_AMTS(div16 * 4 + %bitand(j : 3) + 1)));\\n a = d;\\n d = c;\\n c = b;\\n b = tempInt;\\n endfor;\\n a = Mask32Bit(a + originalA);\\n b = Mask32Bit(b + originalB);\\n c = Mask32Bit(c + originalC);\\n d = Mask32Bit(d + originalD);\\n endfor;\\n\\n for i = 0 to 3;\\n if i = 0;\\n tempInt = a;\\n elseif i = 1;\\n tempInt = b;\\n elseif i = 2;\\n tempInt = c;\\n else;\\n tempInt = d;\\n endif;\\n\\n for j = 0 to 3;\\n byteToInt.n = %bitand(tempInt : 255);\\n %subst(outputHash : i * 4 + j + 1 : 1) = byteToInt.c;\\n tempInt /= 256;\\n endfor;\\n endfor;\\n return;\\nend-proc;\\n\\ndcl-proc MD5_FillPadding;\\n dcl-pi *N;\\n messageLen int(10);\\n numBlocks int(10);\\n padding char(72);\\n end-pi;\\n dcl-s totalLen int(10);\\n dcl-s paddingSize int(10);\\n dcl-ds *N;\\n messageLenBits int(20);\\n mlb_bytes char(8) OVERLAY(messageLenBits);\\n end-ds;\\n dcl-s i int(10);\\n\\n %subst(padding : 1 : 1) = X'80';\\n totalLen = numBlocks * 64;\\n paddingSize = totalLen - messageLen; // 9 to 72\\n messageLenBits = messageLen;\\n messageLenBits *= 8;\\n for i = 1 to 8;\\n %subst(padding : paddingSize - i + 1 : 1) = %subst(mlb_bytes : i : 1);\\n endfor;\\n for i = 2 to paddingSize - 8;\\n %subst(padding : i : 1) = X'00';\\n endfor;\\n return;\\nend-proc;\\n\\ndcl-proc RotateLeft32Bit;\\n dcl-pi *N int(20);\\n n int(20) value;\\n amount int(3) value;\\n end-pi;\\n dcl-s i int(3);\\n\\n n = Mask32Bit(n);\\n for i = 1 to amount;\\n n *= 2;\\n if n >= 4294967296;\\n n -= MASK32;\\n endif;\\n endfor;\\n return n;\\nend-proc;\\n\\ndcl-proc Mask32Bit;\\n dcl-pi *N int(20);\\n n int(20) value;\\n end-pi;\\n return %bitand(n : MASK32);\\nend-proc;\\n\\ndcl-proc ConvertToHex;\\n dcl-pi *N;\\n inputData char(32767) options(*VARSIZE) CONST;\\n inputDataLen int(10) value;\\n outputData char(65534) options(*VARSIZE);\\n end-pi;\\n dcl-c HEX_CHARS CONST('0123456789ABCDEF');\\n dcl-s i int(10);\\n dcl-s outputOffset int(10) INZ(1);\\n dcl-ds dataStruct QUALIFIED;\\n numField int(5) INZ(0);\\n // IBM i is big-endian\\n charField char(1) OVERLAY(numField : 2);\\n end-ds;\\n\\n for i = 1 to inputDataLen;\\n dataStruct.charField = %BitAnd(%subst(inputData : i : 1) : X'F0');\\n dataStruct.numField /= 16;\\n %subst(outputData : outputOffset : 1) = %subst(HEX_CHARS : dataStruct.numField + 1 : 1);\\n outputOffset += 1;\\n dataStruct.charField = %BitAnd(%subst(inputData : i : 1) : X'0F');\\n %subst(outputData : outputOffset : 1) = %subst(HEX_CHARS : dataStruct.numField + 1 : 1);\\n outputOffset += 1;\\n endfor;\\n return;\\nend-proc;\\n\\n**CTDATA SHIFT_AMTS\\n 7 12 17 22 5 9 14 20 4 11 16 23 6 10 15 21\\n**CTDATA MD5_TABLE_T\\n 3614090360 3905402710 606105819 3250441966\\n 4118548399 1200080426 2821735955 4249261313\\n 1770035416 2336552879 4294925233 2304563134\\n 1804603682 4254626195 2792965006 1236535329\\n 4129170786 3225465664 643717713 3921069994\\n 3593408605 38016083 3634488961 3889429448\\n 568446438 3275163606 4107603335 1163531501\\n 2850285829 4243563512 1735328473 2368359562\\n 4294588738 2272392833 1839030562 4259657740\\n 2763975236 1272893353 4139469664 3200236656\\n 681279174 3936430074 3572445317 76029189\\n 3654602809 3873151461 530742520 3299628645\\n 4096336452 1126891415 2878612391 4237533241\\n 1700485571 2399980690 4293915773 2240044497\\n 1873313359 4264355552 2734768916 1309151649\\n 4149444226 3174756917 718787259 3951481745\\n\",\n \"language\": \"RPG\"\n },\n {\n \"code\": \"#![allow(non_snake_case)] // RFC 1321 uses many capitalized variables\\nuse std::mem;\\n\\nfn md5(mut msg: Vec<u8>) -> (u32, u32, u32, u32) {\\n let bitcount = msg.len().saturating_mul(8) as u64;\\n\\n // Step 1: Append Padding Bits\\n msg.push(0b10000000);\\n while (msg.len() * 8) % 512 != 448 {\\n msg.push(0u8);\\n }\\n\\n // Step 2. Append Length (64 bit integer)\\n msg.extend(&[\\n bitcount as u8,\\n (bitcount >> 8) as u8,\\n (bitcount >> 16) as u8,\\n (bitcount >> 24) as u8,\\n (bitcount >> 32) as u8,\\n (bitcount >> 40) as u8,\\n (bitcount >> 48) as u8,\\n (bitcount >> 56) as u8,\\n ]);\\n\\n // Step 3. Initialize MD Buffer\\n /*A four-word buffer (A,B,C,D) is used to compute the message digest.\\n Here each of A, B, C, D is a 32-bit register.*/\\n let mut A = 0x67452301u32;\\n let mut B = 0xefcdab89u32;\\n let mut C = 0x98badcfeu32;\\n let mut D = 0x10325476u32;\\n\\n // Step 4. Process Message in 16-Word Blocks\\n /* We first define four auxiliary functions */\\n let F = |X: u32, Y: u32, Z: u32| -> u32 { X & Y | !X & Z };\\n let G = |X: u32, Y: u32, Z: u32| -> u32 { X & Z | Y & !Z };\\n let H = |X: u32, Y: u32, Z: u32| -> u32 { X ^ Y ^ Z };\\n let I = |X: u32, Y: u32, Z: u32| -> u32 { Y ^ (X | !Z) };\\n\\n /* This step uses a 64-element table T[1 ... 64] constructed from the sine function. */\\n let T = [\\n 0x00000000, // enable use as a 1-indexed table\\n 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, 0xf57c0faf, 0x4787c62a, 0xa8304613,\\n 0xfd469501, 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be, 0x6b901122, 0xfd987193,\\n 0xa679438e, 0x49b40821, 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa, 0xd62f105d,\\n 0x02441453, 0xd8a1e681, 0xe7d3fbc8, 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,\\n 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a, 0xfffa3942, 0x8771f681, 0x6d9d6122,\\n 0xfde5380c, 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70, 0x289b7ec6, 0xeaa127fa,\\n 0xd4ef3085, 0x04881d05, 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665, 0xf4292244,\\n 0x432aff97, 0xab9423a7, 0xfc93a039, 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,\\n 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1, 0xf7537e82, 0xbd3af235, 0x2ad7d2bb,\\n 0xeb86d391,\\n ];\\n\\n /* Process each 16-word block. (since 1 word is 4 bytes, then 16 words is 64 bytes) */\\n for mut block in msg.chunks_exact_mut(64) {\\n /* Copy block into X. */\\n #![allow(unused_mut)]\\n let mut X = unsafe { mem::transmute::<&mut [u8], &mut [u32]>(&mut block) };\\n #[cfg(target_endian = \\\"big\\\")]\\n for j in 0..16 {\\n X[j] = X[j].swap_bytes();\\n }\\n\\n /* Save Registers A,B,C,D */\\n let AA = A;\\n let BB = B;\\n let CC = C;\\n let DD = D;\\n\\n /* Round 1. Let [abcd k s i] denote the operation\\n a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */\\n macro_rules! op1 {\\n ($a:ident,$b:ident,$c:ident,$d:ident,$k:expr,$s:expr,$i:expr) => {\\n $a = $b.wrapping_add(\\n ($a.wrapping_add(F($b, $c, $d))\\n .wrapping_add(X[$k])\\n .wrapping_add(T[$i]))\\n .rotate_left($s),\\n )\\n };\\n }\\n\\n /* Do the following 16 operations. */\\n op1!(A, B, C, D, 0, 7, 1);\\n op1!(D, A, B, C, 1, 12, 2);\\n op1!(C, D, A, B, 2, 17, 3);\\n op1!(B, C, D, A, 3, 22, 4);\\n\\n op1!(A, B, C, D, 4, 7, 5);\\n op1!(D, A, B, C, 5, 12, 6);\\n op1!(C, D, A, B, 6, 17, 7);\\n op1!(B, C, D, A, 7, 22, 8);\\n\\n op1!(A, B, C, D, 8, 7, 9);\\n op1!(D, A, B, C, 9, 12, 10);\\n op1!(C, D, A, B, 10, 17, 11);\\n op1!(B, C, D, A, 11, 22, 12);\\n\\n op1!(A, B, C, D, 12, 7, 13);\\n op1!(D, A, B, C, 13, 12, 14);\\n op1!(C, D, A, B, 14, 17, 15);\\n op1!(B, C, D, A, 15, 22, 16);\\n\\n /* Round 2. Let [abcd k s i] denote the operation\\n a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */\\n macro_rules! op2 {\\n ($a:ident,$b:ident,$c:ident,$d:ident,$k:expr,$s:expr,$i:expr) => {\\n $a = $b.wrapping_add(\\n ($a.wrapping_add(G($b, $c, $d))\\n .wrapping_add(X[$k])\\n .wrapping_add(T[$i]))\\n .rotate_left($s),\\n )\\n };\\n }\\n\\n /* Do the following 16 operations. */\\n op2!(A, B, C, D, 1, 5, 17);\\n op2!(D, A, B, C, 6, 9, 18);\\n op2!(C, D, A, B, 11, 14, 19);\\n op2!(B, C, D, A, 0, 20, 20);\\n\\n op2!(A, B, C, D, 5, 5, 21);\\n op2!(D, A, B, C, 10, 9, 22);\\n op2!(C, D, A, B, 15, 14, 23);\\n op2!(B, C, D, A, 4, 20, 24);\\n\\n op2!(A, B, C, D, 9, 5, 25);\\n op2!(D, A, B, C, 14, 9, 26);\\n op2!(C, D, A, B, 3, 14, 27);\\n op2!(B, C, D, A, 8, 20, 28);\\n\\n op2!(A, B, C, D, 13, 5, 29);\\n op2!(D, A, B, C, 2, 9, 30);\\n op2!(C, D, A, B, 7, 14, 31);\\n op2!(B, C, D, A, 12, 20, 32);\\n\\n /* Round 3. Let [abcd k s t] denote the operation\\n a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */\\n macro_rules! op3 {\\n ($a:ident,$b:ident,$c:ident,$d:ident,$k:expr,$s:expr,$i:expr) => {\\n $a = $b.wrapping_add(\\n ($a.wrapping_add(H($b, $c, $d))\\n .wrapping_add(X[$k])\\n .wrapping_add(T[$i]))\\n .rotate_left($s),\\n )\\n };\\n }\\n\\n /* Do the following 16 operations. */\\n op3!(A, B, C, D, 5, 4, 33);\\n op3!(D, A, B, C, 8, 11, 34);\\n op3!(C, D, A, B, 11, 16, 35);\\n op3!(B, C, D, A, 14, 23, 36);\\n\\n op3!(A, B, C, D, 1, 4, 37);\\n op3!(D, A, B, C, 4, 11, 38);\\n op3!(C, D, A, B, 7, 16, 39);\\n op3!(B, C, D, A, 10, 23, 40);\\n\\n op3!(A, B, C, D, 13, 4, 41);\\n op3!(D, A, B, C, 0, 11, 42);\\n op3!(C, D, A, B, 3, 16, 43);\\n op3!(B, C, D, A, 6, 23, 44);\\n\\n op3!(A, B, C, D, 9, 4, 45);\\n op3!(D, A, B, C, 12, 11, 46);\\n op3!(C, D, A, B, 15, 16, 47);\\n op3!(B, C, D, A, 2, 23, 48);\\n\\n /* Round 4. Let [abcd k s t] denote the operation\\n a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */\\n macro_rules! op4 {\\n ($a:ident,$b:ident,$c:ident,$d:ident,$k:expr,$s:expr,$i:expr) => {\\n $a = $b.wrapping_add(\\n ($a.wrapping_add(I($b, $c, $d))\\n .wrapping_add(X[$k])\\n .wrapping_add(T[$i]))\\n .rotate_left($s),\\n )\\n };\\n }\\n\\n /* Do the following 16 operations. */\\n op4!(A, B, C, D, 0, 6, 49);\\n op4!(D, A, B, C, 7, 10, 50);\\n op4!(C, D, A, B, 14, 15, 51);\\n op4!(B, C, D, A, 5, 21, 52);\\n\\n op4!(A, B, C, D, 12, 6, 53);\\n op4!(D, A, B, C, 3, 10, 54);\\n op4!(C, D, A, B, 10, 15, 55);\\n op4!(B, C, D, A, 1, 21, 56);\\n\\n op4!(A, B, C, D, 8, 6, 57);\\n op4!(D, A, B, C, 15, 10, 58);\\n op4!(C, D, A, B, 6, 15, 59);\\n op4!(B, C, D, A, 13, 21, 60);\\n\\n op4!(A, B, C, D, 4, 6, 61);\\n op4!(D, A, B, C, 11, 10, 62);\\n op4!(C, D, A, B, 2, 15, 63);\\n op4!(B, C, D, A, 9, 21, 64);\\n\\n /* . . . increment each of the four registers by the value\\n it had before this block was started.) */\\n\\n A = A.wrapping_add(AA);\\n B = B.wrapping_add(BB);\\n C = C.wrapping_add(CC);\\n D = D.wrapping_add(DD);\\n }\\n (\\n A.swap_bytes(),\\n B.swap_bytes(),\\n C.swap_bytes(),\\n D.swap_bytes(),\\n )\\n}\\n\\nfn md5_utf8(smsg: &str) -> String {\\n let mut msg = vec![0u8; 0];\\n msg.extend(smsg.as_bytes());\\n let (A, B, C, D) = md5(msg);\\n format!(\\\"{:08x}{:08x}{:08x}{:08x}\\\", A, B, C, D)\\n}\\n\\nfn main() {\\n assert!(md5_utf8(\\\"\\\") == \\\"d41d8cd98f00b204e9800998ecf8427e\\\");\\n assert!(md5_utf8(\\\"a\\\") == \\\"0cc175b9c0f1b6a831c399e269772661\\\");\\n assert!(md5_utf8(\\\"abc\\\") == \\\"900150983cd24fb0d6963f7d28e17f72\\\");\\n assert!(md5_utf8(\\\"message digest\\\") == \\\"f96b697d7cb7938d525a2f31aaf161d0\\\");\\n assert!(md5_utf8(\\\"abcdefghijklmnopqrstuvwxyz\\\") == \\\"c3fcd3d76192e4007dfb496cca67e13b\\\");\\n assert!(md5_utf8(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\") == \\\"d174ab98d277d9f5a5611c2c9f419d9f\\\");\\n assert!(md5_utf8(\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\") == \\\"57edf4a22be3c955ac49da2e2107b67a\\\");\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import java.lang.Math\\n\\nobject MD5 {\\n private val INIT_A = 0x67452301\\n private val INIT_B = 0xEFCDAB89\\n private val INIT_C = 0x98BADCFE\\n private val INIT_D = 0x10325476\\n\\n private val SHIFT_AMTS = Array(\\n 7, 12, 17, 22,\\n 5, 9, 14, 20,\\n 4, 11, 16, 23,\\n 6, 10, 15, 21\\n )\\n\\n private val TABLE_T = Array.tabulate(64)(i => (Math.abs(Math.sin(i + 1)) * (1L << 32)).toLong.toInt)\\n\\n def computeMD5(message: Array[Byte]): Array[Byte] = {\\n val messageLenBytes = message.length\\n val numBlocks = ((messageLenBytes + 8) >>> 6) + 1\\n val totalLen = numBlocks << 6\\n val paddingBytes = Array.fill[Byte](totalLen - messageLenBytes)(0)\\n paddingBytes(0) = 0x80.toByte\\n\\n var messageLenBits = messageLenBytes.toLong << 3\\n for (i <- 0 until 8) {\\n paddingBytes(paddingBytes.length - 8 + i) = messageLenBits.toByte\\n messageLenBits >>>= 8\\n }\\n\\n var a = INIT_A\\n var b = INIT_B\\n var c = INIT_C\\n var d = INIT_D\\n val buffer = new Array[Int](16)\\n\\n for (i <- 0 until numBlocks) {\\n var index = i << 6\\n for (j <- 0 until 64) {\\n buffer(j >>> 2) = (((if (index < messageLenBytes) message(index) else paddingBytes(index - messageLenBytes)) << 24) | (buffer(j >>> 2) >>> 8)).toInt\\n index += 1\\n }\\n val originalA = a\\n val originalB = b\\n val originalC = c\\n val originalD = d\\n\\n for (j <- 0 until 64) {\\n val div16 = j >>> 4\\n val bufferIndex = j match {\\n case j if j < 16 => j\\n case j if j < 32 => (j * 5 + 1) & 0x0F\\n case j if j < 48 => (j * 3 + 5) & 0x0F\\n case j => (j * 7) & 0x0F\\n }\\n\\n val f = div16 match {\\n case 0 => (b & c) | (~b & d)\\n case 1 => (b & d) | (c & ~d)\\n case 2 => b ^ c ^ d\\n case 3 => c ^ (b | ~d)\\n }\\n\\n val temp = b + Integer.rotateLeft(a + f + buffer(bufferIndex) + TABLE_T(j), SHIFT_AMTS((div16 << 2) | (j & 3)))\\n a = d\\n d = c\\n c = b\\n b = temp\\n }\\n\\n a += originalA\\n b += originalB\\n c += originalC\\n d += originalD\\n }\\n\\n val md5 = new Array[Byte](16)\\n var count = 0\\n for (i <- 0 until 4) {\\n var n = i match {\\n case 0 => a\\n case 1 => b\\n case 2 => c\\n case 3 => d\\n }\\n for (j <- 0 until 4) {\\n md5(count) = n.toByte\\n n >>>= 8\\n count += 1\\n }\\n }\\n md5\\n }\\n\\n def toHexString(b: Array[Byte]): String = b.map(byte => f\\\"$byte%02X\\\").mkString\\n\\n def main(args: Array[String]): Unit = {\\n val testStrings = Array(\\\"\\\", \\\"a\\\", \\\"abc\\\", \\\"message digest\\\", \\\"abcdefghijklmnopqrstuvwxyz\\\", \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\", \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\")\\n testStrings.foreach { s =>\\n println(s\\\"0x${toHexString(computeMD5(s.getBytes))} <== \\\\\\\"$s\\\\\\\"\\\")\\n }\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"bytedata.s7i\\\";\\n include \\\"bin32.s7i\\\";\\n include \\\"float.s7i\\\";\\n include \\\"math.s7i\\\";\\n\\n# Use binary integer part of the sines of integers (Radians) as constants:\\nconst func array integer: createMd5Table is func\\n result\\n var array integer: k is 64 times 0;\\n local\\n var integer: index is 0;\\n begin\\n for index range 1 to 64 do\\n k[index] := trunc(abs(sin(flt(index))) * 2.0 ** 32);\\n end for;\\n end func;\\n\\nconst func string: md5 (in var string: message) is func\\n result\\n var string: digest is \\\"\\\";\\n local\\n # Specify the per-round shift amounts\\n const array integer: shiftAmount is [] (\\n 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21);\\n const array integer: k is createMd5Table;\\n var integer: length is 0;\\n var integer: wordIndex is 1;\\n var integer: index is 0;\\n var array bin32: m is 16 times bin32.value;\\n var integer: a0 is 16#67452301; # a\\n var integer: b0 is 16#efcdab89; # b\\n var integer: c0 is 16#98badcfe; # c\\n var integer: d0 is 16#10325476; # d\\n var bin32: a is bin32(0);\\n var bin32: b is bin32(0);\\n var bin32: c is bin32(0);\\n var bin32: d is bin32(0);\\n var bin32: f is bin32(0);\\n var integer: g is 0;\\n var bin32: temp is bin32(0);\\n begin\\n length := length(message);\\n # Append the bit '1' to the message.\\n message &:= '\\\\16#80;';\\n # Append '0' bits, so that the resulting bit length is congruent to 448 (mod 512).\\n message &:= \\\"\\\\0;\\\" mult 63 - (length + 8) mod 64;\\n # Append length of message (before pre-processing), in bits, as 64-bit little-endian integer.\\n message &:= bytes(8 * length, UNSIGNED, LE, 8);\\n\\n # Process the message in successive 512-bit chunks:\\n while wordIndex <= length(message) do\\n # Break chunk into sixteen 32-bit little-endian words.\\n for index range 1 to 16 do\\n m[index] := bin32(bytes2Int(message[wordIndex fixLen 4], UNSIGNED, LE));\\n wordIndex +:= 4;\\n end for;\\n\\n a := bin32(a0 mod 16#100000000);\\n b := bin32(b0 mod 16#100000000);\\n c := bin32(c0 mod 16#100000000);\\n d := bin32(d0 mod 16#100000000);\\n\\n for index range 1 to 64 do\\n if index <= 16 then\\n f := d >< (b & (c >< d));\\n g := index;\\n elsif index <= 32 then\\n f := c >< (d & (b >< c));\\n g := succ((5 * index - 4) mod 16);\\n elsif index <= 48 then\\n f := b >< c >< d;\\n g := succ((3 * index + 2) mod 16);\\n else\\n f := c >< (b | (bin32(16#ffffffff) >< d));\\n g := succ((7 * pred(index)) mod 16);\\n end if;\\n\\n temp := d;\\n d := c;\\n c := b;\\n b := bin32((ord(b) +\\n ord(rotLeft(bin32((ord(a) + ord(f) + k[index] + ord(m[g])) mod 16#100000000),\\n shiftAmount[index]))) mod 16#100000000);\\n a := temp;\\n end for;\\n\\n # Add this chunk's hash to result so far:\\n a0 +:= ord(a);\\n b0 +:= ord(b);\\n c0 +:= ord(c);\\n d0 +:= ord(d);\\n end while;\\n\\n # Produce the final hash value:\\n digest := bytes(a0 mod 16#100000000, UNSIGNED, LE, 4) &\\n bytes(b0 mod 16#100000000, UNSIGNED, LE, 4) &\\n bytes(c0 mod 16#100000000, UNSIGNED, LE, 4) &\\n bytes(d0 mod 16#100000000, UNSIGNED, LE, 4);\\n end func;\\n\\nconst func boolean: checkMd5 (in string: message, in string: hexMd5) is\\n return hex(md5(message)) = hexMd5;\\n\\nconst proc: main is func\\n begin\\n if checkMd5(\\\"\\\", \\\"d41d8cd98f00b204e9800998ecf8427e\\\") and\\n checkMd5(\\\"a\\\", \\\"0cc175b9c0f1b6a831c399e269772661\\\") and\\n checkMd5(\\\"abc\\\", \\\"900150983cd24fb0d6963f7d28e17f72\\\") and\\n checkMd5(\\\"message digest\\\", \\\"f96b697d7cb7938d525a2f31aaf161d0\\\") and\\n checkMd5(\\\"abcdefghijklmnopqrstuvwxyz\\\", \\\"c3fcd3d76192e4007dfb496cca67e13b\\\") and\\n checkMd5(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\", \\\"d174ab98d277d9f5a5611c2c9f419d9f\\\") and\\n checkMd5(\\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\", \\\"57edf4a22be3c955ac49da2e2107b67a\\\") then\\n writeln(\\\"md5 is computed correct\\\");\\n else\\n writeln(\\\"There is an error in the md5 function\\\");\\n end if;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"class MD5(String msg) {\\n\\n method init {\\n msg = msg.bytes\\n }\\n\\n const FGHI = [\\n {|a,b,c| (a & b) | (~a & c) },\\n {|a,b,c| (a & c) | (b & ~c) },\\n {|a,b,c| (a ^ b ^ c) },\\n {|a,b,c| (b ^ (a | ~c)) },\\n ]\\n\\n const S = [\\n [7, 12, 17, 22] * 4,\\n [5, 9, 14, 20] * 4,\\n [4, 11, 16, 23] * 4,\\n [6, 10, 15, 21] * 4,\\n ].flat\\n\\n const T = 64.of {|i| floor(abs(sin(i+1)) * 1<<32) }\\n\\n const K = [\\n ^16 -> map {|n| n },\\n ^16 -> map {|n| (5*n + 1) % 16 },\\n ^16 -> map {|n| (3*n + 5) % 16 },\\n ^16 -> map {|n| (7*n ) % 16 },\\n ].flat\\n\\n func radix(Number b, Array a) {\\n ^a -> sum {|i| b**i * a[i] }\\n }\\n\\n func little_endian(Number w, Number n, Array v) {\\n var step1 = (^n »*» w)\\n var step2 = (v ~X>> step1)\\n step2 »%» (1 << w)\\n }\\n\\n func block(Number a, Number b) { (a + b) & 0xffffffff }\\n func srble(Number a, Number n) { (a << n) & 0xffffffff | (a >> (32-n)) }\\n\\n func md5_pad(msg) {\\n var bits = 8*msg.len\\n var padded = [msg..., 128, [0] * (-(floor(bits / 8) + 1 + 8) % 64)].flat\\n\\n gather {\\n padded.each_slice(4, {|*a|\\n take(radix(256, a))\\n })\\n take(little_endian(32, 2, [bits]))\\n }.flat\\n }\\n\\n func md5_block(Array H, Array X) {\\n var (A, B, C, D) = H...\\n\\n for i in ^64 {\\n (A, B, C, D) = (D,\\n block(B, srble(\\n block(\\n block(\\n block(A, FGHI[floor(i / 16)](B, C, D)), T[i]\\n ), X[K[i]]\\n ), S[i])\\n ), B, C)\\n }\\n\\n for k,v in ([A, B, C, D].kv) {\\n H[k] = block(H[k], v)\\n }\\n\\n return H\\n }\\n\\n method md5_hex {\\n self.md5.map {|n| '%02x' % n }.join\\n }\\n\\n method md5 {\\n var M = md5_pad(msg)\\n var H = [0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476]\\n\\n for i in (range(0, M.end, 16)) {\\n md5_block(H, M.slice(i).first(16))\\n }\\n\\n little_endian(8, 4, H)\\n }\\n}\\n\\nvar tests = [\\n ['d41d8cd98f00b204e9800998ecf8427e', ''],\\n ['0cc175b9c0f1b6a831c399e269772661', 'a'],\\n ['900150983cd24fb0d6963f7d28e17f72', 'abc'],\\n ['f96b697d7cb7938d525a2f31aaf161d0', 'message digest'],\\n ['c3fcd3d76192e4007dfb496cca67e13b', 'abcdefghijklmnopqrstuvwxyz'],\\n ['d174ab98d277d9f5a5611c2c9f419d9f', 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'],\\n ['57edf4a22be3c955ac49da2e2107b67a', '12345678901234567890123456789012345678901234567890123456789012345678901234567890'],\\n]\\n\\nfor md5,msg in tests {\\n var hash = MD5(msg).md5_hex\\n say \\\"#{hash} : #{msg}\\\"\\n\\n if (hash != md5) {\\n say \\\"\\\\tHowever, that is incorrect (expected: #{md5})\\\"\\n }\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \" import Foundation\\n public class MD5 {\\n /** specifies the per-round shift amounts */\\n private let s: [UInt32] = [7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21]\\n\\n /** binary integer part of the sines of integers (Radians) */\\n private let K: [UInt32] = (0 ..< 64).map { UInt32(0x100000000 * abs(sin(Double($0 + 1)))) }\\n\\n let a0: UInt32 = 0x67452301\\n let b0: UInt32 = 0xefcdab89\\n let c0: UInt32 = 0x98badcfe\\n let d0: UInt32 = 0x10325476\\n\\n private var message: NSData\\n\\n //MARK: Public\\n\\n public init(_ message: NSData) {\\n self.message = message\\n }\\n\\n public func calculate() -> NSData? {\\n var tmpMessage: NSMutableData = NSMutableData(data: message)\\n let wordSize = sizeof(UInt32)\\n\\n var aa = a0\\n var bb = b0\\n var cc = c0\\n var dd = d0\\n\\n // Step 1. Append Padding Bits\\n tmpMessage.appendBytes([0x80]) // append one bit (Byte with one bit) to message\\n\\n // append \\\"0\\\" bit until message length in bits ≡ 448 (mod 512)\\n while tmpMessage.length % 64 != 56 {\\n tmpMessage.appendBytes([0x00])\\n }\\n\\n // Step 2. Append Length a 64-bit representation of lengthInBits\\n var lengthInBits = (message.length * 8)\\n var lengthBytes = lengthInBits.bytes(64 / 8)\\n tmpMessage.appendBytes(reverse(lengthBytes));\\n\\n // Process the message in successive 512-bit chunks:\\n let chunkSizeBytes = 512 / 8\\n var leftMessageBytes = tmpMessage.length\\n for var i = 0; i < tmpMessage.length; i = i + chunkSizeBytes, leftMessageBytes -= chunkSizeBytes {\\n let chunk = tmpMessage.subdataWithRange(NSRange(location: i, length: min(chunkSizeBytes,leftMessageBytes)))\\n\\n // break chunk into sixteen 32-bit words M[j], 0 ≤ j ≤ 15\\n // println(\\\"wordSize \\\\(wordSize)\\\");\\n var M:[UInt32] = [UInt32](count: 16, repeatedValue: 0)\\n for x in 0..<M.count {\\n var range = NSRange(location:x * wordSize, length: wordSize)\\n chunk.getBytes(&M[x], range:range);\\n }\\n\\n // Initialize hash value for this chunk:\\n var A:UInt32 = a0\\n var B:UInt32 = b0\\n var C:UInt32 = c0\\n var D:UInt32 = d0\\n\\n var dTemp:UInt32 = 0\\n\\n // Main loop\\n for j in 0...63 {\\n var g = 0\\n var F:UInt32 = 0\\n\\n switch (j) {\\n case 0...15:\\n F = (B & C) | ((~B) & D)\\n g = j\\n break\\n case 16...31:\\n F = (D & B) | (~D & C)\\n g = (5 * j + 1) % 16\\n break\\n case 32...47:\\n F = B ^ C ^ D\\n g = (3 * j + 5) % 16\\n break\\n case 48...63:\\n F = C ^ (B | (~D))\\n g = (7 * j) % 16\\n break\\n default:\\n break\\n }\\n dTemp = D\\n D = C\\n C = B\\n B = B &+ rotateLeft((A &+ F &+ K[j] &+ M[g]), s[j])\\n A = dTemp\\n }\\n\\n aa = aa &+ A\\n bb = bb &+ B\\n cc = cc &+ C\\n dd = dd &+ D\\n }\\n\\n var buf: NSMutableData = NSMutableData();\\n buf.appendBytes(&aa, length: wordSize)\\n buf.appendBytes(&bb, length: wordSize)\\n buf.appendBytes(&cc, length: wordSize)\\n buf.appendBytes(&dd, length: wordSize)\\n\\n return buf.copy() as? NSData;\\n }\\n\\n //MARK: Class\\n class func calculate(message: NSData) -> NSData?\\n {\\n return MD5(message).calculate();\\n }\\n\\n //MARK: Private\\n private func rotateLeft(x:UInt32, _ n:UInt32) -> UInt32 {\\n return (x &<< n) | (x &>> (32 - n))\\n }\\n }\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"import Foundation\\n\\nlet shift : [UInt32] = [7, 12, 17, 22, 5, 9, 14, 20, 4, 11, 16, 23, 6, 10, 15, 21]\\nlet table: [UInt32] = (0 ..< 64).map { UInt32(0x100000000 * abs(sin(Double($0 + 1)))) }\\n\\nfunc md5(var message: [UInt8]) -> [UInt8] {\\n var messageLenBits = UInt64(message.count) * 8\\n message.append(0x80)\\n while message.count % 64 != 56 {\\n message.append(0)\\n }\\n\\n var lengthBytes = [UInt8](count: 8, repeatedValue: 0)\\n UnsafeMutablePointer<UInt64>(lengthBytes).memory = messageLenBits.littleEndian\\n message += lengthBytes\\n\\n var a : UInt32 = 0x67452301\\n var b : UInt32 = 0xEFCDAB89\\n var c : UInt32 = 0x98BADCFE\\n var d : UInt32 = 0x10325476\\n for chunkOffset in stride(from: 0, to: message.count, by: 64) {\\n let chunk = UnsafePointer<UInt32>(UnsafePointer<UInt8>(message) + chunkOffset)\\n let originalA = a\\n let originalB = b\\n let originalC = c\\n let originalD = d\\n for j in 0 ..< 64 {\\n var f : UInt32 = 0\\n var bufferIndex = j\\n let round = j >> 4\\n switch round {\\n case 0:\\n f = (b & c) | (~b & d)\\n case 1:\\n f = (b & d) | (c & ~d)\\n bufferIndex = (bufferIndex*5 + 1) & 0x0F\\n case 2:\\n f = b ^ c ^ d\\n bufferIndex = (bufferIndex*3 + 5) & 0x0F\\n case 3:\\n f = c ^ (b | ~d)\\n bufferIndex = (bufferIndex * 7) & 0x0F\\n default:\\n assert(false)\\n }\\n let sa = shift[(round<<2)|(j&3)]\\n let tmp = a &+ f &+ UInt32(littleEndian: chunk[bufferIndex]) &+ table[j]\\n a = d\\n d = c\\n c = b\\n b = b &+ (tmp << sa | tmp >> (32-sa))\\n }\\n a = a &+ originalA\\n b = b &+ originalB\\n c = c &+ originalC\\n d = d &+ originalD\\n }\\n\\n var result = [UInt8](count: 16, repeatedValue: 0)\\n for (i, n) in enumerate([a, b, c, d]) {\\n UnsafeMutablePointer<UInt32>(result)[i] = n.littleEndian\\n }\\n return result\\n}\\n\\nfunc toHexString(bytes: [UInt8]) -> String {\\n return \\\"\\\".join(bytes.map { String(format:\\\"%02x\\\", $0) })\\n}\\n\\nfor (hashCode, string) in [\\n (\\\"d41d8cd98f00b204e9800998ecf8427e\\\", \\\"\\\"),\\n (\\\"0cc175b9c0f1b6a831c399e269772661\\\", \\\"a\\\"),\\n (\\\"900150983cd24fb0d6963f7d28e17f72\\\", \\\"abc\\\"),\\n (\\\"f96b697d7cb7938d525a2f31aaf161d0\\\", \\\"message digest\\\"),\\n (\\\"c3fcd3d76192e4007dfb496cca67e13b\\\", \\\"abcdefghijklmnopqrstuvwxyz\\\"),\\n (\\\"d174ab98d277d9f5a5611c2c9f419d9f\\\",\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"),\\n (\\\"57edf4a22be3c955ac49da2e2107b67a\\\", \\\"12345678901234567890\\\" +\\n \\\"123456789012345678901234567890123456789012345678901234567890\\\")] {\\n println(hashCode)\\n println(toHexString(md5(Array(string.utf8))))\\n println()\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"# We just define the body of md5::md5 here; later we regsub to inline a few\\n# function calls for speed\\nvariable ::md5::md5body {\\n ### Step 1. Append Padding Bits\\n\\n set msgLen [string length $msg]\\n\\n set padLen [expr {56 - $msgLen%64}]\\n if {$msgLen % 64 > 56} {\\n\\tincr padLen 64\\n }\\n\\n # pad even if no padding required\\n if {$padLen == 0} {\\n\\tincr padLen 64\\n }\\n\\n # append single 1b followed by 0b's\\n append msg [binary format \\\"a$padLen\\\" \\\\200]\\n\\n ### Step 2. Append Length\\n\\n # RFC doesn't say whether to use little- or big-endian; code demonstrates\\n # little-endian.\\n # This step limits our input to size 2^32b or 2^24B\\n append msg [binary format \\\"i1i1\\\" [expr {8*$msgLen}] 0]\\n\\n ### Step 3. Initialize MD Buffer\\n\\n set A [expr 0x67452301]\\n set B [expr 0xefcdab89]\\n set C [expr 0x98badcfe]\\n set D [expr 0x10325476]\\n\\n ### Step 4. Process Message in 16-Word Blocks\\n\\n # process each 16-word block\\n # RFC doesn't say whether to use little- or big-endian; code says\\n # little-endian.\\n binary scan $msg i* blocks\\n\\n # loop over the message taking 16 blocks at a time\\n\\n foreach {X0 X1 X2 X3 X4 X5 X6 X7 X8 X9 X10 X11 X12 X13 X14 X15} $blocks {\\n\\t# Save A as AA, B as BB, C as CC, and D as DD.\\n\\tset AA $A\\n\\tset BB $B\\n\\tset CC $C\\n\\tset DD $D\\n\\n\\t# Round 1.\\n\\t# Let [abcd k s i] denote the operation\\n\\t# a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s).\\n\\t# [ABCD 0 7 1] [DABC 1 12 2] [CDAB 2 17 3] [BCDA 3 22 4]\\n\\tset A [expr {$B + [<<< [expr {$A + [F $B $C $D] + $X0 + $T01}] 7]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [F $A $B $C] + $X1 + $T02}] 12]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [F $D $A $B] + $X2 + $T03}] 17]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [F $C $D $A] + $X3 + $T04}] 22]}]\\n\\t# [ABCD 4 7 5] [DABC 5 12 6] [CDAB 6 17 7] [BCDA 7 22 8]\\n\\tset A [expr {$B + [<<< [expr {$A + [F $B $C $D] + $X4 + $T05}] 7]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [F $A $B $C] + $X5 + $T06}] 12]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [F $D $A $B] + $X6 + $T07}] 17]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [F $C $D $A] + $X7 + $T08}] 22]}]\\n\\t# [ABCD 8 7 9] [DABC 9 12 10] [CDAB 10 17 11] [BCDA 11 22 12]\\n\\tset A [expr {$B + [<<< [expr {$A + [F $B $C $D] + $X8 + $T09}] 7]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [F $A $B $C] + $X9 + $T10}] 12]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [F $D $A $B] + $X10 + $T11}] 17]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [F $C $D $A] + $X11 + $T12}] 22]}]\\n\\t# [ABCD 12 7 13] [DABC 13 12 14] [CDAB 14 17 15] [BCDA 15 22 16]\\n\\tset A [expr {$B + [<<< [expr {$A + [F $B $C $D] + $X12 + $T13}] 7]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [F $A $B $C] + $X13 + $T14}] 12]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [F $D $A $B] + $X14 + $T15}] 17]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [F $C $D $A] + $X15 + $T16}] 22]}]\\n\\n\\t# Round 2.\\n\\t# Let [abcd k s i] denote the operation\\n\\t# a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s).\\n\\t# Do the following 16 operations.\\n\\t# [ABCD 1 5 17] [DABC 6 9 18] [CDAB 11 14 19] [BCDA 0 20 20]\\n\\tset A [expr {$B + [<<< [expr {$A + [G $B $C $D] + $X1 + $T17}] 5]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [G $A $B $C] + $X6 + $T18}] 9]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [G $D $A $B] + $X11 + $T19}] 14]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [G $C $D $A] + $X0 + $T20}] 20]}]\\n\\t# [ABCD 5 5 21] [DABC 10 9 22] [CDAB 15 14 23] [BCDA 4 20 24]\\n\\tset A [expr {$B + [<<< [expr {$A + [G $B $C $D] + $X5 + $T21}] 5]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [G $A $B $C] + $X10 + $T22}] 9]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [G $D $A $B] + $X15 + $T23}] 14]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [G $C $D $A] + $X4 + $T24}] 20]}]\\n\\t# [ABCD 9 5 25] [DABC 14 9 26] [CDAB 3 14 27] [BCDA 8 20 28]\\n\\tset A [expr {$B + [<<< [expr {$A + [G $B $C $D] + $X9 + $T25}] 5]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [G $A $B $C] + $X14 + $T26}] 9]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [G $D $A $B] + $X3 + $T27}] 14]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [G $C $D $A] + $X8 + $T28}] 20]}]\\n\\t# [ABCD 13 5 29] [DABC 2 9 30] [CDAB 7 14 31] [BCDA 12 20 32]\\n\\tset A [expr {$B + [<<< [expr {$A + [G $B $C $D] + $X13 + $T29}] 5]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [G $A $B $C] + $X2 + $T30}] 9]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [G $D $A $B] + $X7 + $T31}] 14]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [G $C $D $A] + $X12 + $T32}] 20]}]\\n\\n\\t# Round 3.\\n\\t# Let [abcd k s t] [sic] denote the operation\\n\\t# a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s).\\n\\t# Do the following 16 operations.\\n\\t# [ABCD 5 4 33] [DABC 8 11 34] [CDAB 11 16 35] [BCDA 14 23 36]\\n\\tset A [expr {$B + [<<< [expr {$A + [H $B $C $D] + $X5 + $T33}] 4]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [H $A $B $C] + $X8 + $T34}] 11]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [H $D $A $B] + $X11 + $T35}] 16]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [H $C $D $A] + $X14 + $T36}] 23]}]\\n\\t# [ABCD 1 4 37] [DABC 4 11 38] [CDAB 7 16 39] [BCDA 10 23 40]\\n\\tset A [expr {$B + [<<< [expr {$A + [H $B $C $D] + $X1 + $T37}] 4]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [H $A $B $C] + $X4 + $T38}] 11]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [H $D $A $B] + $X7 + $T39}] 16]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [H $C $D $A] + $X10 + $T40}] 23]}]\\n\\t# [ABCD 13 4 41] [DABC 0 11 42] [CDAB 3 16 43] [BCDA 6 23 44]\\n\\tset A [expr {$B + [<<< [expr {$A + [H $B $C $D] + $X13 + $T41}] 4]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [H $A $B $C] + $X0 + $T42}] 11]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [H $D $A $B] + $X3 + $T43}] 16]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [H $C $D $A] + $X6 + $T44}] 23]}]\\n\\t# [ABCD 9 4 45] [DABC 12 11 46] [CDAB 15 16 47] [BCDA 2 23 48]\\n\\tset A [expr {$B + [<<< [expr {$A + [H $B $C $D] + $X9 + $T45}] 4]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [H $A $B $C] + $X12 + $T46}] 11]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [H $D $A $B] + $X15 + $T47}] 16]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [H $C $D $A] + $X2 + $T48}] 23]}]\\n\\n\\t# Round 4.\\n\\t# Let [abcd k s t] [sic] denote the operation\\n\\t# a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s).\\n\\t# Do the following 16 operations.\\n\\t# [ABCD 0 6 49] [DABC 7 10 50] [CDAB 14 15 51] [BCDA 5 21 52]\\n\\tset A [expr {$B + [<<< [expr {$A + [I $B $C $D] + $X0 + $T49}] 6]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [I $A $B $C] + $X7 + $T50}] 10]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [I $D $A $B] + $X14 + $T51}] 15]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [I $C $D $A] + $X5 + $T52}] 21]}]\\n\\t# [ABCD 12 6 53] [DABC 3 10 54] [CDAB 10 15 55] [BCDA 1 21 56]\\n\\tset A [expr {$B + [<<< [expr {$A + [I $B $C $D] + $X12 + $T53}] 6]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [I $A $B $C] + $X3 + $T54}] 10]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [I $D $A $B] + $X10 + $T55}] 15]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [I $C $D $A] + $X1 + $T56}] 21]}]\\n\\t# [ABCD 8 6 57] [DABC 15 10 58] [CDAB 6 15 59] [BCDA 13 21 60]\\n\\tset A [expr {$B + [<<< [expr {$A + [I $B $C $D] + $X8 + $T57}] 6]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [I $A $B $C] + $X15 + $T58}] 10]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [I $D $A $B] + $X6 + $T59}] 15]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [I $C $D $A] + $X13 + $T60}] 21]}]\\n\\t# [ABCD 4 6 61] [DABC 11 10 62] [CDAB 2 15 63] [BCDA 9 21 64]\\n\\tset A [expr {$B + [<<< [expr {$A + [I $B $C $D] + $X4 + $T61}] 6]}]\\n\\tset D [expr {$A + [<<< [expr {$D + [I $A $B $C] + $X11 + $T62}] 10]}]\\n\\tset C [expr {$D + [<<< [expr {$C + [I $D $A $B] + $X2 + $T63}] 15]}]\\n\\tset B [expr {$C + [<<< [expr {$B + [I $C $D $A] + $X9 + $T64}] 21]}]\\n\\n\\t# Then perform the following additions. (That is increment each of the\\n\\t# four registers by the value it had before this block was started.)\\n\\tincr A $AA\\n\\tincr B $BB\\n\\tincr C $CC\\n\\tincr D $DD\\n }\\n\\n ### Step 5. Output\\n\\n # ... begin with the low-order byte of A, and end with the high-order byte\\n # of D.\\n\\n return [bytes $A][bytes $B][bytes $C][bytes $D]\\n}\\n\\n### Here we inline/regsub the functions F, G, H, I and <<<\\n\\nnamespace eval ::md5 {\\n #proc md5pure::F {x y z} {expr {(($x & $y) | ((~$x) & $z))}}\\n regsub -all -- {\\\\[ *F +(\\\\$.) +(\\\\$.) +(\\\\$.) *\\\\]} $md5body {((\\\\1 \\\\& \\\\2) | ((~\\\\1) \\\\& \\\\3))} md5body\\n\\n #proc md5pure::G {x y z} {expr {(($x & $z) | ($y & (~$z)))}}\\n regsub -all -- {\\\\[ *G +(\\\\$.) +(\\\\$.) +(\\\\$.) *\\\\]} $md5body {((\\\\1 \\\\& \\\\3) | (\\\\2 \\\\& (~\\\\3)))} md5body\\n\\n #proc md5pure::H {x y z} {expr {$x ^ $y ^ $z}}\\n regsub -all -- {\\\\[ *H +(\\\\$.) +(\\\\$.) +(\\\\$.) *\\\\]} $md5body {(\\\\1 ^ \\\\2 ^ \\\\3)} md5body\\n\\n #proc md5pure::I {x y z} {expr {$y ^ ($x | (~$z))}}\\n regsub -all -- {\\\\[ *I +(\\\\$.) +(\\\\$.) +(\\\\$.) *\\\\]} $md5body {(\\\\2 ^ (\\\\1 | (~\\\\3)))} md5body\\n\\n # inline <<< (bitwise left-rotate)\\n regsub -all -- {\\\\[ *<<< +\\\\[ *expr +({[^\\\\}]*})\\\\] +([0-9]+) *\\\\]} $md5body {(([set x [expr \\\\1]] << \\\\2) | (($x >> R\\\\2) \\\\& S\\\\2))} md5body\\n\\n # now replace the R and S\\n variable map {}\\n variable i\\n foreach i {\\n\\t7 12 17 22\\n\\t5 9 14 20\\n\\t4 11 16 23\\n\\t6 10 15 21\\n } {\\n\\tlappend map R$i [expr {32 - $i}] S$i [expr {0x7fffffff >> (31-$i)}]\\n }\\n\\n # inline the values of T\\n variable tName\\n variable tVal\\n foreach tName {\\n\\tT01 T02 T03 T04 T05 T06 T07 T08 T09 T10\\n\\tT11 T12 T13 T14 T15 T16 T17 T18 T19 T20\\n\\tT21 T22 T23 T24 T25 T26 T27 T28 T29 T30\\n\\tT31 T32 T33 T34 T35 T36 T37 T38 T39 T40\\n\\tT41 T42 T43 T44 T45 T46 T47 T48 T49 T50\\n\\tT51 T52 T53 T54 T55 T56 T57 T58 T59 T60\\n\\tT61 T62 T63 T64\\n } tVal {\\n\\t0xd76aa478 0xe8c7b756 0x242070db 0xc1bdceee\\n\\t0xf57c0faf 0x4787c62a 0xa8304613 0xfd469501\\n\\t0x698098d8 0x8b44f7af 0xffff5bb1 0x895cd7be\\n\\t0x6b901122 0xfd987193 0xa679438e 0x49b40821\\n\\n\\t0xf61e2562 0xc040b340 0x265e5a51 0xe9b6c7aa\\n\\t0xd62f105d 0x2441453 0xd8a1e681 0xe7d3fbc8\\n\\t0x21e1cde6 0xc33707d6 0xf4d50d87 0x455a14ed\\n\\t0xa9e3e905 0xfcefa3f8 0x676f02d9 0x8d2a4c8a\\n\\n\\t0xfffa3942 0x8771f681 0x6d9d6122 0xfde5380c\\n\\t0xa4beea44 0x4bdecfa9 0xf6bb4b60 0xbebfbc70\\n\\t0x289b7ec6 0xeaa127fa 0xd4ef3085 0x4881d05\\n\\t0xd9d4d039 0xe6db99e5 0x1fa27cf8 0xc4ac5665\\n\\n\\t0xf4292244 0x432aff97 0xab9423a7 0xfc93a039\\n\\t0x655b59c3 0x8f0ccc92 0xffeff47d 0x85845dd1\\n\\t0x6fa87e4f 0xfe2ce6e0 0xa3014314 0x4e0811a1\\n\\t0xf7537e82 0xbd3af235 0x2ad7d2bb 0xeb86d391\\n } {\\n\\tlappend map \\\\$$tName $tVal\\n }\\n set md5body [string map $map $md5body]\\n\\n # Finally, define the proc\\n proc md5 {msg} $md5body\\n\\n # unset auxiliary variables\\n unset md5body tName tVal map\\n\\n proc byte0 {i} {expr {0xff & $i}}\\n proc byte1 {i} {expr {(0xff00 & $i) >> 8}}\\n proc byte2 {i} {expr {(0xff0000 & $i) >> 16}}\\n proc byte3 {i} {expr {((0xff000000 & $i) >> 24) & 0xff}}\\n proc bytes {i} {\\n format %0.2x%0.2x%0.2x%0.2x [byte0 $i] [byte1 $i] [byte2 $i] [byte3 $i]\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"foreach {hash <- string} {\\n 0xd41d8cd98f00b204e9800998ecf8427e ==> \\\"\\\"\\n 0x0cc175b9c0f1b6a831c399e269772661 ==> \\\"a\\\"\\n 0x900150983cd24fb0d6963f7d28e17f72 ==> \\\"abc\\\"\\n 0xf96b697d7cb7938d525a2f31aaf161d0 ==> \\\"message digest\\\"\\n 0xc3fcd3d76192e4007dfb496cca67e13b ==> \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n 0xd174ab98d277d9f5a5611c2c9f419d9f ==> \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\"\\n 0x57edf4a22be3c955ac49da2e2107b67a ==> \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"\\n} {\\n puts \\\"“$string” -> [md5::md5 $string] (officially: $hash)\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar k = [\\n 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee ,\\n 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501 ,\\n 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be ,\\n 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821 ,\\n 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa ,\\n 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8 ,\\n 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed ,\\n 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a ,\\n 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c ,\\n 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70 ,\\n 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05 ,\\n 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665 ,\\n 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039 ,\\n 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1 ,\\n 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1 ,\\n 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391\\n]\\n\\nvar r = [\\n 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,\\n 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,\\n 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,\\n 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21\\n]\\n\\nvar leftRotate = Fn.new { |x, c| (x << c) | (x >> (32 - c)) }\\n\\nvar toBytes = Fn.new { |val|\\n var bytes = List.filled(4, 0)\\n bytes[0] = val & 255\\n bytes[1] = (val >> 8) & 255\\n bytes[2] = (val >> 16) & 255\\n bytes[3] = (val >> 24) & 255\\n return bytes\\n}\\n\\nvar toInt = Fn.new { |bytes| bytes[0] | bytes[1] << 8 | bytes[2] << 16 | bytes[3] << 24 }\\n\\nvar md5 = Fn.new { |initMsg|\\n var h0 = 0x67452301\\n var h1 = 0xefcdab89\\n var h2 = 0x98badcfe\\n var h3 = 0x10325476\\n var initBytes = initMsg.bytes\\n var initLen = initBytes.count\\n var newLen = initLen + 1\\n while (newLen % 64 != 56) newLen = newLen + 1\\n var msg = List.filled(newLen + 8, 0)\\n for (i in 0...initLen) msg[i] = initBytes[i]\\n msg[initLen] = 0x80 // remaining bytes already 0\\n var lenBits = toBytes.call(initLen * 8)\\n for (i in newLen...newLen+4) msg[i] = lenBits[i-newLen]\\n var extraBits = toBytes.call(initLen >> 29)\\n for (i in newLen+4...newLen+8) msg[i] = extraBits[i-newLen-4]\\n var offset = 0\\n var w = List.filled(16, 0)\\n while (offset < newLen) {\\n for (i in 0...16) w[i] = toInt.call(msg[offset+i*4...offset + i*4 + 4])\\n var a = h0\\n var b = h1\\n var c = h2\\n var d = h3\\n var f\\n var g\\n for (i in 0...64) {\\n if (i < 16) {\\n f = (b & c) | ((~b) & d)\\n g = i\\n } else if (i < 32) {\\n f = (d & b) | ((~d) & c)\\n g = (5*i + 1) % 16\\n } else if (i < 48) {\\n f = b ^ c ^ d\\n g = (3*i + 5) % 16\\n } else {\\n f = c ^ (b | (~d))\\n g = (7*i) % 16\\n }\\n var temp = d\\n d = c\\n c = b\\n b = b + leftRotate.call((a + f + k[i] + w[g]), r[i])\\n a = temp\\n }\\n h0 = h0 + a\\n h1 = h1 + b\\n h2 = h2 + c\\n h3 = h3 + d\\n offset = offset + 64\\n }\\n var digest = List.filled(16, 0)\\n var dBytes = toBytes.call(h0)\\n for (i in 0...4) digest[i] = dBytes[i]\\n dBytes = toBytes.call(h1)\\n for (i in 0...4) digest[i+4] = dBytes[i]\\n dBytes = toBytes.call(h2)\\n for (i in 0...4) digest[i+8] = dBytes[i]\\n dBytes = toBytes.call(h3)\\n for (i in 0...4) digest[i+12] = dBytes[i]\\n return digest\\n}\\n\\nvar strings = [\\n \\\"\\\",\\n \\\"a\\\",\\n \\\"abc\\\",\\n \\\"message digest\\\",\\n \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\\\",\\n \\\"12345678901234567890123456789012345678901234567890123456789012345678901234567890\\\"\\n]\\n\\nfor (s in strings) {\\n var digest = md5.call(s)\\n Fmt.print(\\\"0x$s <== '$0s'\\\", Fmt.v(\\\"xz\\\", 2, digest, 0, \\\"\\\", \\\"\\\"), s)\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"section .text\\norg 0x100\\n\\tmov\\tdi, md5_for_display\\n\\tmov\\tsi, test_input_1\\n\\tmov\\tcx, test_input_1_len\\n\\tcall\\tcompute_md5\\n\\tcall\\tdisplay_md5\\n\\tmov\\tsi, test_input_2\\n\\tmov\\tcx, test_input_2_len\\n\\tcall\\tcompute_md5\\n\\tcall\\tdisplay_md5\\n\\tmov\\tsi, test_input_3\\n\\tmov\\tcx, test_input_3_len\\n\\tcall\\tcompute_md5\\n\\tcall\\tdisplay_md5\\n\\tmov\\tsi, test_input_4\\n\\tmov\\tcx, test_input_4_len\\n\\tcall\\tcompute_md5\\n\\tcall\\tdisplay_md5\\n\\tmov\\tsi, test_input_5\\n\\tmov\\tcx, test_input_5_len\\n\\tcall\\tcompute_md5\\n\\tcall\\tdisplay_md5\\n\\tmov\\tsi, test_input_6\\n\\tmov\\tcx, test_input_6_len\\n\\tcall\\tcompute_md5\\n\\tcall\\tdisplay_md5\\n\\tmov\\tsi, test_input_7\\n\\tmov\\tcx, test_input_7_len\\n\\tcall\\tcompute_md5\\n\\tcall\\tdisplay_md5\\n\\tmov\\tax, 0x4c00\\n\\tint\\t21h\\n\\nmd5_for_display times 16 db 0\\nHEX_CHARS db '0123456789ABCDEF'\\n\\ndisplay_md5:\\n\\tmov\\tah, 9\\n\\tmov\\tdx, display_str_1\\n\\tint\\t0x21\\n\\tpush\\tcx\\n\\tpush\\tsi\\n\\tmov\\tcx, 16\\n\\tmov\\tsi, di\\n\\txor\\tbx, bx\\n.loop:\\n\\tlodsb\\n\\tmov\\tbl, al\\n\\tand\\tbl, 0x0F\\n\\tpush\\tbx\\n\\tmov\\tbl, al\\n\\tshr\\tbx, 4\\n\\tmov\\tah, 2\\n\\tmov\\tdl, [HEX_CHARS + bx]\\n\\tint\\t0x21\\n\\tpop\\tbx\\n\\tmov\\tdl, [HEX_CHARS + bx]\\n\\tint\\t0x21\\n\\tdec\\tcx\\n\\tjnz\\t.loop\\n\\tmov\\tah, 9\\n\\tmov\\tdx, display_str_2\\n\\tint\\t0x21\\n\\tpop\\tsi\\n\\tpop\\tcx\\n\\ttest\\tcx, cx\\n\\tjz\\tdo_newline\\n\\tmov\\tah, 2\\ndisplay_string:\\n\\tlodsb\\n\\tmov\\tdl, al\\n\\tint\\t0x21\\n\\tdec\\tcx\\n\\tjnz\\tdisplay_string\\ndo_newline:\\n\\tmov\\tah, 9\\n\\tmov\\tdx, display_str_3\\n\\tint\\t0x21\\n\\tret;\\n\\ncompute_md5:\\n\\t; si --> input bytes, cx = input len, di --> 16-byte output buffer\\n\\t; assumes all in the same segment\\n\\tcld\\n\\tpusha\\n\\tpush\\tdi\\n\\tpush\\tsi\\n\\tmov\\t[message_len], cx\\n\\n\\tmov\\tbx, cx\\n\\tshr\\tbx, 6\\n\\tmov\\t[ending_bytes_block_num], bx\\n\\tmov\\t[num_blocks], bx\\n\\tinc\\tword [num_blocks]\\n\\tshl\\tbx, 6\\n\\tadd\\tsi, bx\\n\\tand\\tcx, 0x3f\\n\\tpush\\tcx\\n\\tmov\\tdi, ending_bytes\\n\\trep\\tmovsb\\n\\tmov\\tal, 0x80\\n\\tstosb\\n\\tpop\\tcx\\n\\tsub\\tcx, 55\\n\\tneg\\tcx\\n\\tjge\\tadd_padding\\n\\tadd\\tcx, 64\\n\\tinc\\tword [num_blocks]\\nadd_padding:\\n\\tmov\\tal, 0\\n\\trep\\tstosb\\n\\txor\\teax, eax\\n\\tmov\\tax, [message_len]\\n\\tshl\\teax, 3\\n\\tmov\\tcx, 8\\nstore_message_len:\\n\\tstosb\\n\\tshr\\teax, 8\\n\\tdec\\tcx\\n\\tjnz\\tstore_message_len\\n\\tpop\\tsi\\n\\tmov\\t[md5_a], dword INIT_A\\n\\tmov\\t[md5_b], dword INIT_B\\n\\tmov\\t[md5_c], dword INIT_C\\n\\tmov\\t[md5_d], dword INIT_D\\nblock_loop:\\n\\tpush\\tcx\\n\\tcmp\\tcx, [ending_bytes_block_num]\\n\\tjne\\tbackup_abcd\\n\\t; switch buffers if towards the end where padding needed\\n\\tmov\\tsi, ending_bytes\\nbackup_abcd:\\n\\tpush\\tdword [md5_d]\\n\\tpush\\tdword [md5_c]\\n\\tpush\\tdword [md5_b]\\n\\tpush\\tdword [md5_a]\\n\\txor\\tcx, cx\\n\\txor\\teax, eax\\nmain_loop:\\n\\tpush\\tcx\\n\\tmov\\tax, cx\\n\\tshr\\tax, 4\\n\\ttest\\tal, al\\n\\tjz\\tpass0\\n\\tcmp\\tal, 1\\n\\tje\\tpass1\\n\\tcmp\\tal, 2\\n\\tje\\tpass2\\n\\t; pass3\\n\\tmov\\teax, [md5_c]\\n\\tmov\\tebx, [md5_d]\\n\\tnot\\tebx\\n\\tor\\tebx, [md5_b]\\n\\txor\\teax, ebx\\n\\tjmp\\tdo_rotate\\n\\npass0:\\n\\tmov\\teax, [md5_b]\\n\\tmov\\tebx, eax\\n\\tand\\teax, [md5_c]\\n\\tnot\\tebx\\n\\tand\\tebx, [md5_d]\\n\\tor\\teax, ebx\\n\\tjmp\\tdo_rotate\\n\\npass1:\\n\\tmov\\teax, [md5_d]\\n\\tmov\\tedx, eax\\n\\tand\\teax, [md5_b]\\n\\tnot\\tedx\\n\\tand\\tedx, [md5_c]\\n\\tor\\teax, edx\\n\\tjmp\\tdo_rotate\\n\\npass2:\\n\\tmov\\teax, [md5_b]\\n\\txor\\teax, [md5_c]\\n\\txor\\teax, [md5_d]\\ndo_rotate:\\n\\tadd\\teax, [md5_a]\\n\\tmov\\tbx, cx\\n\\tshl\\tbx, 1\\n\\tmov\\tbx, [BUFFER_INDEX_TABLE + bx]\\n\\tadd\\teax, [si + bx]\\n\\tmov\\tbx, cx\\n\\tshl\\tbx, 2\\n\\tadd\\teax, dword [TABLE_T + bx]\\n\\tmov\\tbx, cx\\n\\tror\\tbx, 2\\n\\tshr\\tbl, 2\\n\\trol\\tbx, 2\\n\\tmov\\tcl, [SHIFT_AMTS + bx]\\n\\trol\\teax, cl\\n\\tadd\\teax, [md5_b]\\n\\tpush\\teax\\n\\tpush\\tdword [md5_b]\\n\\tpush\\tdword [md5_c]\\n\\tpush\\tdword [md5_d]\\n\\tpop\\tdword [md5_a]\\n\\tpop\\tdword [md5_d]\\n\\tpop\\tdword [md5_c]\\n\\tpop\\tdword [md5_b]\\n\\tpop\\tcx\\n\\tinc\\tcx\\n\\tcmp\\tcx, 64\\n\\tjb\\tmain_loop\\n\\t; add to original values\\n\\tpop\\teax\\n\\tadd\\t[md5_a], eax\\n\\tpop\\teax\\n\\tadd\\t[md5_b], eax\\n\\tpop\\teax\\n\\tadd\\t[md5_c], eax\\n\\tpop\\teax\\n\\tadd\\t[md5_d], eax\\n\\t; advance pointers\\n\\tadd\\tsi, 64\\n\\tpop\\tcx\\n\\tinc\\tcx\\n\\tcmp\\tcx, [num_blocks]\\n\\tjne\\tblock_loop\\n\\tmov\\tcx, 4\\n\\tmov\\tsi, md5_a\\n\\tpop\\tdi\\n\\trep\\tmovsd\\n\\tpopa\\n\\tret\\n\\nsection .data\\n\\nINIT_A equ 0x67452301\\nINIT_B equ 0xEFCDAB89\\nINIT_C equ 0x98BADCFE\\nINIT_D equ 0x10325476\\n\\nSHIFT_AMTS db 7, 12, 17, 22, 5, 9, 14, 20, 4, 11, 16, 23, 6, 10, 15, 21\\n\\nTABLE_T dd 0xD76AA478, 0xE8C7B756, 0x242070DB, 0xC1BDCEEE, 0xF57C0FAF, 0x4787C62A, 0xA8304613, 0xFD469501, 0x698098D8, 0x8B44F7AF, 0xFFFF5BB1, 0x895CD7BE, 0x6B901122, 0xFD987193, 0xA679438E, 0x49B40821, 0xF61E2562, 0xC040B340, 0x265E5A51, 0xE9B6C7AA, 0xD62F105D, 0x02441453, 0xD8A1E681, 0xE7D3FBC8, 0x21E1CDE6, 0xC33707D6, 0xF4D50D87, 0x455A14ED, 0xA9E3E905, 0xFCEFA3F8, 0x676F02D9, 0x8D2A4C8A, 0xFFFA3942, 0x8771F681, 0x6D9D6122, 0xFDE5380C, 0xA4BEEA44, 0x4BDECFA9, 0xF6BB4B60, 0xBEBFBC70, 0x289B7EC6, 0xEAA127FA, 0xD4EF3085, 0x04881D05, 0xD9D4D039, 0xE6DB99E5, 0x1FA27CF8, 0xC4AC5665, 0xF4292244, 0x432AFF97, 0xAB9423A7, 0xFC93A039, 0x655B59C3, 0x8F0CCC92, 0xFFEFF47D, 0x85845DD1, 0x6FA87E4F, 0xFE2CE6E0, 0xA3014314, 0x4E0811A1, 0xF7537E82, 0xBD3AF235, 0x2AD7D2BB, 0xEB86D391\\nBUFFER_INDEX_TABLE dw 0, 4, 8, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52, 56, 60, 4, 24, 44, 0, 20, 40, 60, 16, 36, 56, 12, 32, 52, 8, 28, 48, 20, 32, 44, 56, 4, 16, 28, 40, 52, 0, 12, 24, 36, 48, 60, 8, 0, 28, 56, 20, 48, 12, 40, 4, 32, 60, 24, 52, 16, 44, 8, 36\\nending_bytes_block_num dw 0\\nending_bytes times 128 db 0\\nmessage_len dw 0\\nnum_blocks dw 0\\nmd5_a dd 0\\nmd5_b dd 0\\nmd5_c dd 0\\nmd5_d dd 0\\n\\ndisplay_str_1 db '0x$'\\ndisplay_str_2 db ' <== \\\"$'\\ndisplay_str_3 db '\\\"', 13, 10, '$'\\n\\ntest_input_1:\\ntest_input_1_len equ $ - test_input_1\\ntest_input_2 db 'a'\\ntest_input_2_len equ $ - test_input_2\\ntest_input_3 db 'abc'\\ntest_input_3_len equ $ - test_input_3\\ntest_input_4 db 'message digest'\\ntest_input_4_len equ $ - test_input_4\\ntest_input_5 db 'abcdefghijklmnopqrstuvwxyz'\\ntest_input_5_len equ $ - test_input_5\\ntest_input_6 db 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'\\ntest_input_6_len equ $ - test_input_6\\ntest_input_7 db '12345678901234567890123456789012345678901234567890123456789012345678901234567890'\\ntest_input_7_len equ $ - test_input_7\\n\",\n \"language\": \"X86-Assembly\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"MD5-Implementation"}}},{"rowIdx":480,"cells":{"solutions":{"kind":"list like","value":[{"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 reciprocal natural numbers, Meissel-Mertens' constant is important in calculating the sum of reciprocal primes.\n\n\n;Example:\nWe consider the finite sum of reciprocal natural numbers:\n\n''1 + 1/2 + 1/3 + 1/4 + 1/5 ... 1/n''\n\nthis sum can be well approximated with:\n\n''log(n) + E'' \n\nwhere ''E'' denotes Euler's constant: 0.57721...\n \n''log(n)'' denotes the natural logarithm of ''n''.\n\n\nNow consider the finite sum of reciprocal primes:\n\n''1/2 + 1/3 + 1/5 + 1/7 + 1/11 ... 1/p''\n\nthis sum can be well approximated with:\n\n''log( log(p) ) + M''\n\nwhere ''M'' denotes Meissel-Mertens constant: 0.26149...\n\n\n;See:\n:* Details in the Wikipedia article: [https://en.wikipedia.org/wiki/Meissel%E2%80%93Mertens_constant Meissel–Mertens constant]\n<br /><br />\n\n","language":"00-TASK"},{"code":"F primes_up_to_limit(Int limit)\n [Int] r\n I limit >= 2\n r.append(2)\n\n V isprime = [1B] * ((limit - 1) I/ 2)\n V sieveend = Int(sqrt(limit))\n L(i) 0 .< isprime.len\n I isprime[i]\n Int p = i * 2 + 3\n r.append(p)\n I i <= sieveend\n L(j) ((p * p - 3) >> 1 .< isprime.len).step(p)\n isprime[j] = 0B\n R r\n\nV euler = 0.57721566490153286\nV m = 0.0\nL(x) primes_up_to_limit(10'000'000)\n m += log(1 - (1 / x)) + (1 / x)\n\nprint(‘MM = #.16’.format(euler + m))\n","language":"11l"},{"code":"BEGIN # compute an approximation to the Meissel-Mertens constant #\n # construct a sieve of odd primes #\n [ 0 : 10 000 000 ]BOOL primes;\n BEGIN\n FOR i TO UPB primes DO primes[ i ] := TRUE OD;\n INT ip := 1;\n FOR i WHILE i + ( ip +:= 2 ) <= UPB primes DO\n IF primes[ i ] THEN\n FOR s FROM i + ip BY ip TO UPB primes DO primes[ s ] := FALSE OD\n FI\n OD\n END;\n # sum the reciprocals of the primes #\n INT p count := 1;\n INT last p := 0;\n LONG REAL sum := long ln( 0.5 ) + 0.5;\n INT p := 1;\n INT p10 := 10;\n # Euler's constant from the wikipedia, truncated for LONG REAL #\n LONG REAL eulers constant = 0.5772156649015328606 # 0651209008240243104215933593992 #;\n FOR i TO UPB primes DO\n p +:= 2;\n IF primes[ i ] THEN\n LONG REAL rp = 1 / LENG p;\n sum +:= long ln( 1 - rp ) + rp;\n p count +:= 1;\n last p := p;\n IF p count = p10 THEN\n print( ( \"after \", whole( p count, -8 ), \" primes, the approximation is: \"\n , fixed( sum + eulers constant, -14, 12 )\n , \", last prime considered: \", whole( last p, 0 )\n , newline\n )\n );\n p10 := IF p10 < 1 000 000 THEN p10 * 10 ELSE p10 + 1 000 000 FI\n FI\n FI\n OD;\n print( ( \"after \", whole( p count, -8 ), \" primes, the approximation is: \"\n , fixed( sum + eulers constant, -14, 12 )\n , \", last prime considered: \", whole( last p, 0 )\n , newline\n )\n )\nEND\n","language":"ALGOL-68"},{"code":"meisselMertens: function [depth][\n Euler: 0.57721566490153286\n m: (1//2) + ln 1-1//2\n loop range.step:2 3 depth 'x ->\n if prime? x ->\n m: m + (1//x) + ln 1-1//x\n\n return m + Euler\n]\n\nprint meisselMertens 10000000\n","language":"Arturo"},{"code":"Euler = 0.5772156649\nm = 0\nfor x = 2 to 1e6 # more prime numbers do not add more precision\n\tif isPrime(x) then m += log(1-(1/x)) + (1/x)\nnext x\nprint \"MM = \"; Euler + m\nprint Euler\nend\n\nfunction isPrime(v)\n\tif v < 2 then return False\n\tif v mod 2 = 0 then return v = 2\n\tif v mod 3 = 0 then return v = 3\n\td = 5\n\twhile d * d <= v\n\t\tif v mod d = 0 then return False else d += 2\n\tend while\n\treturn True\nend function\n","language":"BASIC256"},{"code":"#include <cmath>\n#include <cstdint>\n#include <iomanip>\n#include <iostream>\n#include <vector>\n\nstd::vector<double> list_prime_reciprocals(const int32_t& limit) {\n\tconst int32_t half_limit = ( limit % 2 == 0 ) ? limit / 2 : 1 + limit / 2;\n\tstd::vector<bool> composite(half_limit);\n\tfor ( int32_t i = 1, p = 3; i < half_limit; p += 2, ++i ) {\n\t\tif ( ! composite[i] ) {\n\t\t\tfor ( int32_t a = i + p; a < half_limit; a = a + p ) {\n\t\t\t\tcomposite[a] = true;\n\t\t\t}\n\t\t}\n\t}\n\n\tstd::vector<double> result(composite.size());\n\tresult[0] = 0.5;\n\tfor ( int32_t i = 1, p = 3; i < half_limit; p += 2, ++i ) {\n\t\tif ( ! composite[i] ) {\n\t\t\tresult.emplace_back(1.0 / p);\n\t\t}\n\t}\n\treturn result;\n}\n\nint main() {\n\tstd::vector<double> prime_reciprocals = list_prime_reciprocals(100'000'000);\n\tconst double euler = 0.577'215'664'901'532'861;\n\tdouble sum = 0.0;\n\tfor ( double reciprocal : prime_reciprocals ) {\n\t\tsum += reciprocal + log(1.0 - reciprocal);\n\t}\n\n\tconst double meissel_mertens = euler + sum;\n\tstd::cout << \"The Meissel-Mertens constant = \" << std::setprecision(8) << meissel_mertens << std::endl;\n}\n","language":"C++"},{"code":"import 'dart:math';\n\nbool isPrime(var n) {\n if (n <= 1) return false;\n if (n == 2) return true;\n for (var i = 2; i <= sqrt(n); i++) if (n % i == 0) return false;\n return true;\n}\n\nvoid main() {\n const double euler = 0.57721566490153286;\n\n double m = 0.0;\n for (var x = 2; x <= 1e8; x++)\n if (isPrime(x)) m += log(1 - (1 / x)) + (1 / x);\n\n print('MM = ${euler + m}');\n}\n","language":"Dart"},{"code":"function IsPrime(N: int64): boolean;\n{Fast, optimised prime test}\nvar I,Stop: int64;\nbegin\nif (N = 2) or (N=3) then Result:=true\nelse if (n <= 1) or ((n mod 2) = 0) or ((n mod 3) = 0) then Result:= false\nelse\n begin\n I:=5;\n Stop:=Trunc(sqrt(N+0.0));\n Result:=False;\n while I<=Stop do\n begin\n if ((N mod I) = 0) or ((N mod (I + 2)) = 0) then exit;\n Inc(I,6);\n end;\n Result:=True;\n end;\nend;\n\n\nfunction GetNextPrime(var Start: integer): integer;\n{Get the next prime number after Start}\n{Start is passed by \"reference,\" so the\n{original variable is incremented}\nbegin\nrepeat Inc(Start)\nuntil IsPrime(Start);\nResult:=Start;\nend;\n\n\nfunction MeisselMertens(Depth: integer; Prog: TProgress): extended;\n{Calculate MM value up a certain Depth}\nvar I,P: integer;\nconst Euler = 0.57721566490153286;\nbegin\nResult:=0;\nP:=1;\nfor I:=1 to Depth do\n\tbegin\n\tP:=GetNextPrime(P);\n\tResult:=Result+Ln(1-(1/P)) + (1/P);\n\tif Assigned(Prog) and ((I mod 10000)=0) then\n\t\tHandleProgress(MulDiv(100,I,Depth));\n\tend;\nResult:=Result+Euler;\nend;\n\n\nprocedure ShowMeisselMertens(Memo: TMemo; Prog: TProgress);\nvar I,IT,Digits: integer;\nvar M,Last: extended;\nbegin\nMemo.Lines.Add('Primes Digits M');\nMemo.Lines.Add('-----------------------------------------');\nLast:=0;\nIT:=1;\n{Calculate MM to specified Power of 10}\nfor I:=1 to 7 do\n\tbegin\n\tIT:=IT*10;\n\tM:=MeisselMertens(IT,Prog);\n\t{Calculated Digits of accuracy}\n\tDigits:=Trunc(abs(Log(abs(M-Last))));\n\tMemo.Lines.Add(Format('10^%2d %7d %25.18f',[I,Digits,M]));\n\tLast:=M\n\tend;\nend;\n","language":"Delphi"},{"code":"fastfunc isprim num .\n if num mod 2 = 0\n if num = 2\n return 1\n .\n return 0\n .\n i = 3\n while i <= sqrt num\n if num mod i = 0\n return 0\n .\n i += 2\n .\n return 1\n.\nfunc log x .\n return log10 x / log10 2.7182818284590452354\n.\neuler = 0.5772156649\nfor x = 2 to 1e6\n if isprim x = 1\n m += log (1 - (1 / x)) + (1 / x)\n .\n.\nnumfmt 11 0\nprint \"mm = \" & euler + m\n","language":"EasyLang"},{"code":"'#include \"isprime.bas\"\n\nConst As Double Euler = 0.57721566490153286\n\nDim As Double m = 0\nFor x As Ulongint = 2 To 1e8\n If isPrime(x) Then m += Log(1-(1/x)) + (1/x)\nNext x\nPrint \"MM =\"; Euler + m\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n \"rcu\"\n)\n\nfunc contains(a []int, f int) bool {\n for _, e := range a {\n if e == f {\n return true\n }\n }\n return false\n}\n\nfunc main() {\n const euler = 0.57721566490153286\n primes := rcu.Primes(1 << 31)\n pc := len(primes)\n sum := 0.0\n fmt.Println(\"Primes added M\")\n fmt.Println(\"------------ --------------\")\n for i, p := range primes {\n rp := 1.0 / float64(p)\n sum += math.Log(1.0-rp) + rp\n c := i + 1\n if (c%1e7) == 0 || c == pc {\n fmt.Printf(\"%11s %0.12f\\n\", rcu.Commatize(c), sum+euler)\n }\n }\n}\n","language":"Go"},{"code":"Euler=: 0.57721566490153286\nMM=: {{ Euler + +/ (+ ^.@-.)@% p: i. y }}\n","language":"J"},{"code":" 0j13 \": MM 1e8\n0.2614972128591\n","language":"J"},{"code":"mm=: (% 10x(^#)10#.inv]) 26149721284764278375542683860869585905156664826119920619206421392x\n","language":"J"},{"code":" 0j65\":mm\n0.26149721284764278375542683860869585905156664826119920619206421392\n","language":"J"},{"code":"import java.util.ArrayList;\nimport java.util.BitSet;\nimport java.util.List;\n\npublic final class MeisselMertensConstant {\n\t\n\tpublic static void main(String[] aArgs) {\n\t\tList<Double> primeReciprocals = listPrimeReciprocals(1_000_000_000);\n\t\tfinal double euler = 0.577_215_664_901_532_861;\n\t\tdouble sum = 0.0;\n\t for ( double reciprocal : primeReciprocals ) {\n\t \tsum += reciprocal + Math.log(1.0 - reciprocal);\n\t }\t\n\t\n\t final double meisselMertens = euler + sum;\t\n\t System.out.println(String.format(\"%s%.9f\", \"The Meissel-Mertens constant = \", meisselMertens));\n\t}\t\n\t\n\tprivate static List<Double> listPrimeReciprocals(int aLimit) {\n\t\tBitSet sieve = new BitSet(aLimit + 1);\n\t\tsieve.set(2, aLimit + 1);\n\t\t\n\t\tfor ( int i = 2; i <= Math.sqrt(aLimit); i = sieve.nextSetBit(i + 1) ) {\n\t\t\tfor ( int j = i * i; j <= aLimit; j += i ) {\n\t\t\t\tsieve.clear(j);\n\t\t\t}\n\t\t}\n\t\t\n\t\tList<Double> result = new ArrayList<Double>(sieve.cardinality());\n\t\tfor ( int i = 2; i >= 0; i = sieve.nextSetBit(i + 1) ) {\n\t\t\tresult.add(1.0 / i);\n\t\t}\n\t\t\n\t\treturn result;\n\t}\n\n}\n","language":"Java"},{"code":"using Base.MathConstants # sets constant γ = 0.5772156649015...\nusing Primes\n\n\"\"\" Approximate the Meissel-Mertons constant. \"\"\"\nfunction meissel_mertens(iterations = 100_000_000)\n return mapreduce(p ->(d = 1/p; log(1 - d) + d), +, primes(prime(iterations))) + γ\nend\n\n@show meissel_mertens(100_000_000) # meissel_mertens(100000000) = 0.2614972128591237\n","language":"Julia"},{"code":"PrimeNumbers = Select[Range[100000000], PrimeQ[#] &]; (*all primes in the first 100 000 000 numbers, this takes a toll on my computer's CPU and RAM*)\nMM = N[Total[Log[1 - 1/PrimeNumbers] + 1/PrimeNumbers] + EulerGamma, 10] (*Calculating it up to a precision of 10, this is correct up to 8 digits*)\nAnalyticMMto305 = N[EulerGamma + Sum[MoebiusMu[n]/n Log[Zeta[n]], {n, 2, 1000}], 1000] (*Precise up to 305 digits*)\nAnalyticMM = N[EulerGamma + Sum[MoebiusMu[n]/n Log[Zeta[n]], {n, 2, 10000}], 1001] (*Precise up to at least 1000 digits*)\n","language":"Mathematica"},{"code":"meissel_mertens:%gamma+lsum(log(1-(1/i))+(1/i),i,primes(2,10000000)),numer;\n","language":"Maxima"},{"code":"import std/[math, strformat, strutils]\n\nproc initPrimes(N: static int): seq[int] =\n ## Initialize the list of primes.\n\n const M = 2 * N - 1\n var composite = newSeq[bool](N)\n composite[0] = true # 1 is not prime.\n\n # Conversions from index to value and value to index.\n template index(n: int): int = (n - 1) shr 1\n template value(idx: int): int = idx shl 1 + 1\n\n # Fill the sieve.\n var n = 3\n while n * n <= M:\n if not composite[n.index]:\n for k in countup(n * n, M, 2 * n):\n composite[k.index] = true\n inc n, 2\n\n # Build list of primes.\n result = @[2]\n for idx in 0..composite.high:\n if not composite[idx]:\n result.add idx.value\n\n\nconst N = 2^30\nlet primes = initPrimes(N)\n\necho \"Primes added M\"\necho \"──────────── ──────────────\"\nconst γ = 0.57721566490153286 # Euler–Mascheroni constant.\nlet primeCount = primes.len\nvar sum = 0.0\nvar count = 0\nfor p in primes:\n let rp = 1 / p\n sum += ln(1 - rp) + rp\n inc count\n if count mod 10_000_000 == 0 or count == primeCount:\n echo &\"{insertSep($count):>11} {sum+γ:.12}\"\n","language":"Nim"},{"code":"{\nMM(t)=\n my(s=0);\n forprime(p = 2, t,\n s += log(1.-1./p)+1./p\n );\n Euler+s\n};\n","language":"PARI-GP"},{"code":"{\nMeissel_Mertens(d)=\n default(realprecision, d);\n my(prec = default(realprecision), z = 0, y = 0, q);\n forprime(p = 2 , 7,\n z += log(1.-1./p)+1./p\n );\n for(k = 2, prec,\n q = 1;\n forprime(p = 2, 7,\n q *= 1.-p^-k\n );\n y += moebius(k)*log(zeta(k)*q)/k\n );\n Euler+z+y\n};\n","language":"PARI-GP"},{"code":"use v5.36;\nuse ntheory qw(forprimes);\n\nmy $s;\nforprimes { $s += log(1 - 1/$_)+1/$_ } 1e9;\nsay my $result = $s + .57721566490153286;\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span> <span style=\"color: #000080;font-style:italic;\">-- (but perhaps a bit too slow)</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">mmc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0.2614972128476427837554268386086958590516</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">smmc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"0.2614972128476427837554268386086958590516\"</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0.57721566490153286</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">dpa</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">p10</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">pn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">adp</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">st</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"0\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">fmt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"%.0f\"</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;\">\"Primes added M\\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;\">\"------------ --------------\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">adp</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">10</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">rp</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #7060A8;\">get_prime</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #7060A8;\">log</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">rp</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">mmc</span><span style=\"color: #0000FF;\">)<</span><span style=\"color: #000000;\">dpa</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">ft</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;\">trunc</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">p10</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">p10</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (as below)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">ft</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">st</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000080;font-style:italic;\">--\n -- We have to artifically calculate a \"truncated t\", aka tt,\n -- to prevent say 0.2..299[>5..] being automatically rounded\n -- by printf() to 0.2..300, otherwise it just \"looks wrong\".\n --</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">tt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">trunc</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">1e12</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">1e12</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;\">\"%,11d %0.12f (accurate to %d d.p.)\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">pn</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">tt</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">adp</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">adp</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">fmt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%%.%df\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">adp</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">st</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">smmc</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;\">adp</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">dpa</span> <span style=\"color: #0000FF;\">/=</span> <span style=\"color: #000000;\">10</span>\n <span style=\"color: #000000;\">p10</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;\">if</span>\n <span style=\"color: #000000;\">pn</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: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"(actual value 0.26149721284764278375542683860869)\\n\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"-->\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- no mpfr_zeta[_ui]() in mpfr.js, as yet, or mpfr_log() or mpfr_const_euler(), for that matter</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: #008080;\">function</span> <span style=\"color: #000000;\">moebius</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;\">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> <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">f</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">prime_factors</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</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: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">f</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;\">i</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: #008080;\">return</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;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">odd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">length</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><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;\">Meissel_Mertens</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_set_default_precision</span><span style=\"color: #0000FF;\">(-</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (d decimal places)</span>\n <span style=\"color: #004080;\">mpfr</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rp</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;\">q</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpfr_inits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">p</span> <span style=\"color: #008080;\">in</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;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000080;font-style:italic;\">-- z += log(1-1/p)+1/p</span>\n <span style=\"color: #7060A8;\">mpfr_set_si</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_div_si</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_add</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;\">rp</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_si_sub</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_log</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_add</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;\">rp</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;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">d</span> <span style=\"color: #008080;\">do</span> <span style=\"color: #000080;font-style:italic;\">-- (see note)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">m</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">moebius</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;\">m</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">mpfr_set_si</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>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">p</span> <span style=\"color: #008080;\">in</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;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000080;font-style:italic;\">-- q *= 1-power(p,-k)</span>\n <span style=\"color: #7060A8;\">mpfr_set_si</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_pow_si</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_si_sub</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000080;font-style:italic;\">-- y += moebius(k)*log(zeta(k)*q)/k</span>\n <span style=\"color: #7060A8;\">mpfr_zeta_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_log</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_div_si</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_mul_si</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rp</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: #000080;font-style:italic;\">-- res := EULER+z+y</span>\n <span style=\"color: #000000;\">mpfr_const_euler</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_add</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;\">y</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_add</span><span style=\"color: #0000FF;\">(</span><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;\">z</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: #004080;\">mpfr</span> <span style=\"color: #000000;\">m</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">Meissel_Mertens</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1001</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">shorten</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">mpfr_get_str</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1001</span><span style=\"color: #0000FF;\">))</span>\n<!--\n","language":"Phix"},{"code":"Procedure isPrime(v.i)\n If v <= 1 : ProcedureReturn #False\n ElseIf v < 4 : ProcedureReturn #True\n ElseIf v % 2 = 0 : ProcedureReturn #False\n ElseIf v < 9 : ProcedureReturn #True\n ElseIf v % 3 = 0 : ProcedureReturn #False\n Else\n Protected r = Round(Sqr(v), #PB_Round_Down)\n Protected f = 5\n While f <= r\n If v % f = 0 Or v % (f + 2) = 0\n ProcedureReturn #False\n EndIf\n f + 6\n Wend\n EndIf\n ProcedureReturn #True\nEndProcedure\n\nOpenConsole()\nEuler.d = 0.5772156649 ;0153286\n\nFor x.i = 2 To 1e8\n If isPrime(x)\n m.d = m + Log(1-(1/x)) + (1/x)\n EndIf\nNext x\nPrintN(\"MM = \" + StrD(Euler + m))\nPrintN(#CRLF$ + \"--- terminado, pulsa RETURN---\"): Input()\nCloseConsole()\n","language":"PureBasic"},{"code":"#!/usr/bin/python\n\nfrom math import log\n\ndef isPrime(n):\n for i in range(2, int(n**0.5) + 1):\n if n % i == 0:\n return False\n return True\n\n\nif __name__ == '__main__':\n Euler = 0.57721566490153286\n m = 0\n for x in range(2, 10_000_000):\n if isPrime(x):\n m += log(1-(1/x)) + (1/x)\n\n print(\"MM =\", Euler + m)\n","language":"Python"},{"code":"# 20221011 Raku programming solution\n\nmy $s;\n.is-prime and $s += log(1-1/$_)+1/$_ for 2 .. 10**8;\nsay $s + .57721566490153286\n","language":"Raku"},{"code":"function isPrime(n)\nif n < 2 then isPrime = 0 : goto [exit]\nif n = 2 then isPrime = 1 : goto [exit]\nif n mod 2 = 0 then isPrime = 0 : goto [exit]\nisPrime = 1\nfor i = 3 to int(n^.5) step 2\n if n mod i = 0 then isPrime = 0 : goto [exit]\nnext i\n[exit]\nend function\n\ne = 0.5772156\n\nfor x = 2 to 100000 ' more prime numbers do not add more precision\n if isPrime(x) then m = m + log(1-(1/x)) + (1/x)\nnext x\nprint \"MM = \"; e + m\n","language":"Run-BASIC"},{"code":"var sum = 0\n1e7.each_prime {|p|\n with (1f/p) {|t|\n sum += (log(1 - t) + t)\n }\n}\nsay sum+Num.EulerGamma\n","language":"Sidef"},{"code":"FUNCTION isPrime (n)\n IF n = 2 THEN\n LET isPrime = 1\n ELSEIF n <= 1 OR REMAINDER(n, 2) = 0 THEN\n LET isPrime = 0\n ELSE\n LET isPrime = 1\n FOR i = 3 TO INT(SQR(n)) STEP 2\n IF REMAINDER(n, i) = 0 THEN\n LET isPrime = 0\n EXIT FUNCTION\n END IF\n NEXT i\n END IF\nEND FUNCTION\n\nLET e = .5772156649\n\nFOR x = 2 to 1e6 !more prime numbers do not add more precision\n IF isPrime(x) = 1 THEN\n LET m = m + LOG(1-(1/x)) + (1/x)\n END IF\nNEXT x\nPRINT \"MM =\"; e + m\nEND\n","language":"True-BASIC"},{"code":"import \"./math\" for Int\nimport \"./fmt\" for Fmt\n\nvar euler = 0.57721566490153286\nvar primes = Int.primeSieve(2.pow(31))\nvar pc = primes.count\nvar sum = 0\nvar c = 0\nSystem.print(\"Primes added M\")\nSystem.print(\"------------ --------------\")\nfor (p in primes) {\n var rp = 1/p\n sum = (1-rp).log + rp + sum\n c = c + 1\n if ((c % 1e7) == 0 || c == pc) Fmt.print(\"$,11d $0.12f\", c, sum + euler)\n}\n","language":"Wren"},{"code":"import \"./gmp\" for Mpf\nimport \"./math\" for Int\nimport \"./fmt\" for Fmt\n\nvar isSquareFree = Fn.new { |n|\n var i = 2\n while (i * i <= n) {\n if (n%(i*i) == 0) return false\n i = (i > 2) ? i + 2 : i + 1\n }\n return true\n}\n\nvar mu = Fn.new { |n|\n if (n < 1) Fiber.abort(\"Argument must be a positive integer\")\n if (n == 1) return 1\n var sqFree = isSquareFree.call(n)\n var factors = Int.primeFactors(n)\n if (sqFree && factors.count % 2 == 0) return 1\n if (sqFree) return -1\n return 0\n}\n\nvar meisselMertens = Fn.new { |d|\n Mpf.defaultPrec = d\n var z = Mpf.zero\n var y = Mpf.zero\n var r = Mpf.new()\n var q = Mpf.new()\n var t = Mpf.new()\n var m = Mpf.new()\n for (p in [2, 3, 5, 7]) {\n r.setUi(p).inv\n t.uiSub(1, r).log.add(r)\n z.add(t, z)\n }\n for (k in 2..d) {\n q.setUi(1)\n for (p in [2, 3, 5, 7]) {\n r.setUi(p).inv\n t.uiSub(1, r.pow(k))\n q.mul(t)\n }\n m.setSi(mu.call(k))\n t.zetaUi(k).mul(q).log.mul(m).div(k)\n y.add(t, y)\n }\n return Mpf.euler.add(z).add(y)\n}\n\nFmt.print(\"$20a\", meisselMertens.call(3300).toString(1001))\n","language":"Wren"},{"code":"func IsPrime(N); \\Return 'true' if N is prime\nint N, D;\n[if N < 2 then return false;\nif (N&1) = 0 then return N = 2;\nif rem(N/3) = 0 then return N = 3;\nD:= 5;\nwhile D*D <= N do\n [if rem(N/D) = 0 then return false;\n D:= D+2;\n if rem(N/D) = 0 then return false;\n D:= D+4;\n ];\nreturn true;\n];\n\ndef Euler = 0.57721566490153286;\nreal M; int P;\n[M:= 0.;\nfor P:= 2 to 100_000_000 do\n if IsPrime(P) then\n M:= M + Ln(1. - 1./float(P)) + 1./float(P);\nFormat(1, 16);\nText(0, \"MM = \"); RlOut(0, Euler + M); CrLf(0);\n]\n","language":"XPL0"},{"code":"e = 0.5772156\n\nfor x = 2 to 1e6 // more prime numbers do not add more precision\n\tif isPrime(x) m = m + log(1-(1/x)) + (1/x)\nnext x\nprint \"MM = \", e + m\nend\n\nsub isPrime(v)\n if v < 2 return False\n if mod(v, 2) = 0 return v = 2\n if mod(v, 3) = 0 return v = 3\n d = 5\n while d * d <= v\n if mod(v, d) = 0 then return False else d = d + 2 : fi\n wend\n return True\nend sub\n","language":"Yabasic"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Meissel–Mertens_constant\\n\",\n \"language\": \"00-META\"\n },\n {\n \"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 reciprocal natural numbers, Meissel-Mertens' constant is important in calculating the sum of reciprocal primes.\\n\\n\\n;Example:\\nWe consider the finite sum of reciprocal natural numbers:\\n\\n''1 + 1/2 + 1/3 + 1/4 + 1/5 ... 1/n''\\n\\nthis sum can be well approximated with:\\n\\n''log(n) + E'' \\n\\nwhere ''E'' denotes Euler's constant: 0.57721...\\n \\n''log(n)'' denotes the natural logarithm of ''n''.\\n\\n\\nNow consider the finite sum of reciprocal primes:\\n\\n''1/2 + 1/3 + 1/5 + 1/7 + 1/11 ... 1/p''\\n\\nthis sum can be well approximated with:\\n\\n''log( log(p) ) + M''\\n\\nwhere ''M'' denotes Meissel-Mertens constant: 0.26149...\\n\\n\\n;See:\\n:* Details in the Wikipedia article: [https://en.wikipedia.org/wiki/Meissel%E2%80%93Mertens_constant Meissel–Mertens constant]\\n<br /><br />\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F primes_up_to_limit(Int limit)\\n [Int] r\\n I limit >= 2\\n r.append(2)\\n\\n V isprime = [1B] * ((limit - 1) I/ 2)\\n V sieveend = Int(sqrt(limit))\\n L(i) 0 .< isprime.len\\n I isprime[i]\\n Int p = i * 2 + 3\\n r.append(p)\\n I i <= sieveend\\n L(j) ((p * p - 3) >> 1 .< isprime.len).step(p)\\n isprime[j] = 0B\\n R r\\n\\nV euler = 0.57721566490153286\\nV m = 0.0\\nL(x) primes_up_to_limit(10'000'000)\\n m += log(1 - (1 / x)) + (1 / x)\\n\\nprint(‘MM = #.16’.format(euler + m))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"BEGIN # compute an approximation to the Meissel-Mertens constant #\\n # construct a sieve of odd primes #\\n [ 0 : 10 000 000 ]BOOL primes;\\n BEGIN\\n FOR i TO UPB primes DO primes[ i ] := TRUE OD;\\n INT ip := 1;\\n FOR i WHILE i + ( ip +:= 2 ) <= UPB primes DO\\n IF primes[ i ] THEN\\n FOR s FROM i + ip BY ip TO UPB primes DO primes[ s ] := FALSE OD\\n FI\\n OD\\n END;\\n # sum the reciprocals of the primes #\\n INT p count := 1;\\n INT last p := 0;\\n LONG REAL sum := long ln( 0.5 ) + 0.5;\\n INT p := 1;\\n INT p10 := 10;\\n # Euler's constant from the wikipedia, truncated for LONG REAL #\\n LONG REAL eulers constant = 0.5772156649015328606 # 0651209008240243104215933593992 #;\\n FOR i TO UPB primes DO\\n p +:= 2;\\n IF primes[ i ] THEN\\n LONG REAL rp = 1 / LENG p;\\n sum +:= long ln( 1 - rp ) + rp;\\n p count +:= 1;\\n last p := p;\\n IF p count = p10 THEN\\n print( ( \\\"after \\\", whole( p count, -8 ), \\\" primes, the approximation is: \\\"\\n , fixed( sum + eulers constant, -14, 12 )\\n , \\\", last prime considered: \\\", whole( last p, 0 )\\n , newline\\n )\\n );\\n p10 := IF p10 < 1 000 000 THEN p10 * 10 ELSE p10 + 1 000 000 FI\\n FI\\n FI\\n OD;\\n print( ( \\\"after \\\", whole( p count, -8 ), \\\" primes, the approximation is: \\\"\\n , fixed( sum + eulers constant, -14, 12 )\\n , \\\", last prime considered: \\\", whole( last p, 0 )\\n , newline\\n )\\n )\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"meisselMertens: function [depth][\\n Euler: 0.57721566490153286\\n m: (1//2) + ln 1-1//2\\n loop range.step:2 3 depth 'x ->\\n if prime? x ->\\n m: m + (1//x) + ln 1-1//x\\n\\n return m + Euler\\n]\\n\\nprint meisselMertens 10000000\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"Euler = 0.5772156649\\nm = 0\\nfor x = 2 to 1e6 # more prime numbers do not add more precision\\n\\tif isPrime(x) then m += log(1-(1/x)) + (1/x)\\nnext x\\nprint \\\"MM = \\\"; Euler + m\\nprint Euler\\nend\\n\\nfunction isPrime(v)\\n\\tif v < 2 then return False\\n\\tif v mod 2 = 0 then return v = 2\\n\\tif v mod 3 = 0 then return v = 3\\n\\td = 5\\n\\twhile d * d <= v\\n\\t\\tif v mod d = 0 then return False else d += 2\\n\\tend while\\n\\treturn True\\nend function\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"#include <cmath>\\n#include <cstdint>\\n#include <iomanip>\\n#include <iostream>\\n#include <vector>\\n\\nstd::vector<double> list_prime_reciprocals(const int32_t& limit) {\\n\\tconst int32_t half_limit = ( limit % 2 == 0 ) ? limit / 2 : 1 + limit / 2;\\n\\tstd::vector<bool> composite(half_limit);\\n\\tfor ( int32_t i = 1, p = 3; i < half_limit; p += 2, ++i ) {\\n\\t\\tif ( ! composite[i] ) {\\n\\t\\t\\tfor ( int32_t a = i + p; a < half_limit; a = a + p ) {\\n\\t\\t\\t\\tcomposite[a] = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tstd::vector<double> result(composite.size());\\n\\tresult[0] = 0.5;\\n\\tfor ( int32_t i = 1, p = 3; i < half_limit; p += 2, ++i ) {\\n\\t\\tif ( ! composite[i] ) {\\n\\t\\t\\tresult.emplace_back(1.0 / p);\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\n\\nint main() {\\n\\tstd::vector<double> prime_reciprocals = list_prime_reciprocals(100'000'000);\\n\\tconst double euler = 0.577'215'664'901'532'861;\\n\\tdouble sum = 0.0;\\n\\tfor ( double reciprocal : prime_reciprocals ) {\\n\\t\\tsum += reciprocal + log(1.0 - reciprocal);\\n\\t}\\n\\n\\tconst double meissel_mertens = euler + sum;\\n\\tstd::cout << \\\"The Meissel-Mertens constant = \\\" << std::setprecision(8) << meissel_mertens << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"import 'dart:math';\\n\\nbool isPrime(var n) {\\n if (n <= 1) return false;\\n if (n == 2) return true;\\n for (var i = 2; i <= sqrt(n); i++) if (n % i == 0) return false;\\n return true;\\n}\\n\\nvoid main() {\\n const double euler = 0.57721566490153286;\\n\\n double m = 0.0;\\n for (var x = 2; x <= 1e8; x++)\\n if (isPrime(x)) m += log(1 - (1 / x)) + (1 / x);\\n\\n print('MM = ${euler + m}');\\n}\\n\",\n \"language\": \"Dart\"\n },\n {\n \"code\": \"function IsPrime(N: int64): boolean;\\n{Fast, optimised prime test}\\nvar I,Stop: int64;\\nbegin\\nif (N = 2) or (N=3) then Result:=true\\nelse if (n <= 1) or ((n mod 2) = 0) or ((n mod 3) = 0) then Result:= false\\nelse\\n begin\\n I:=5;\\n Stop:=Trunc(sqrt(N+0.0));\\n Result:=False;\\n while I<=Stop do\\n begin\\n if ((N mod I) = 0) or ((N mod (I + 2)) = 0) then exit;\\n Inc(I,6);\\n end;\\n Result:=True;\\n end;\\nend;\\n\\n\\nfunction GetNextPrime(var Start: integer): integer;\\n{Get the next prime number after Start}\\n{Start is passed by \\\"reference,\\\" so the\\n{original variable is incremented}\\nbegin\\nrepeat Inc(Start)\\nuntil IsPrime(Start);\\nResult:=Start;\\nend;\\n\\n\\nfunction MeisselMertens(Depth: integer; Prog: TProgress): extended;\\n{Calculate MM value up a certain Depth}\\nvar I,P: integer;\\nconst Euler = 0.57721566490153286;\\nbegin\\nResult:=0;\\nP:=1;\\nfor I:=1 to Depth do\\n\\tbegin\\n\\tP:=GetNextPrime(P);\\n\\tResult:=Result+Ln(1-(1/P)) + (1/P);\\n\\tif Assigned(Prog) and ((I mod 10000)=0) then\\n\\t\\tHandleProgress(MulDiv(100,I,Depth));\\n\\tend;\\nResult:=Result+Euler;\\nend;\\n\\n\\nprocedure ShowMeisselMertens(Memo: TMemo; Prog: TProgress);\\nvar I,IT,Digits: integer;\\nvar M,Last: extended;\\nbegin\\nMemo.Lines.Add('Primes Digits M');\\nMemo.Lines.Add('-----------------------------------------');\\nLast:=0;\\nIT:=1;\\n{Calculate MM to specified Power of 10}\\nfor I:=1 to 7 do\\n\\tbegin\\n\\tIT:=IT*10;\\n\\tM:=MeisselMertens(IT,Prog);\\n\\t{Calculated Digits of accuracy}\\n\\tDigits:=Trunc(abs(Log(abs(M-Last))));\\n\\tMemo.Lines.Add(Format('10^%2d %7d %25.18f',[I,Digits,M]));\\n\\tLast:=M\\n\\tend;\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"fastfunc isprim num .\\n if num mod 2 = 0\\n if num = 2\\n return 1\\n .\\n return 0\\n .\\n i = 3\\n while i <= sqrt num\\n if num mod i = 0\\n return 0\\n .\\n i += 2\\n .\\n return 1\\n.\\nfunc log x .\\n return log10 x / log10 2.7182818284590452354\\n.\\neuler = 0.5772156649\\nfor x = 2 to 1e6\\n if isprim x = 1\\n m += log (1 - (1 / x)) + (1 / x)\\n .\\n.\\nnumfmt 11 0\\nprint \\\"mm = \\\" & euler + m\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"'#include \\\"isprime.bas\\\"\\n\\nConst As Double Euler = 0.57721566490153286\\n\\nDim As Double m = 0\\nFor x As Ulongint = 2 To 1e8\\n If isPrime(x) Then m += Log(1-(1/x)) + (1/x)\\nNext x\\nPrint \\\"MM =\\\"; Euler + m\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n \\\"rcu\\\"\\n)\\n\\nfunc contains(a []int, f int) bool {\\n for _, e := range a {\\n if e == f {\\n return true\\n }\\n }\\n return false\\n}\\n\\nfunc main() {\\n const euler = 0.57721566490153286\\n primes := rcu.Primes(1 << 31)\\n pc := len(primes)\\n sum := 0.0\\n fmt.Println(\\\"Primes added M\\\")\\n fmt.Println(\\\"------------ --------------\\\")\\n for i, p := range primes {\\n rp := 1.0 / float64(p)\\n sum += math.Log(1.0-rp) + rp\\n c := i + 1\\n if (c%1e7) == 0 || c == pc {\\n fmt.Printf(\\\"%11s %0.12f\\\\n\\\", rcu.Commatize(c), sum+euler)\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"Euler=: 0.57721566490153286\\nMM=: {{ Euler + +/ (+ ^.@-.)@% p: i. y }}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 0j13 \\\": MM 1e8\\n0.2614972128591\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"mm=: (% 10x(^#)10#.inv]) 26149721284764278375542683860869585905156664826119920619206421392x\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 0j65\\\":mm\\n0.26149721284764278375542683860869585905156664826119920619206421392\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.BitSet;\\nimport java.util.List;\\n\\npublic final class MeisselMertensConstant {\\n\\t\\n\\tpublic static void main(String[] aArgs) {\\n\\t\\tList<Double> primeReciprocals = listPrimeReciprocals(1_000_000_000);\\n\\t\\tfinal double euler = 0.577_215_664_901_532_861;\\n\\t\\tdouble sum = 0.0;\\n\\t for ( double reciprocal : primeReciprocals ) {\\n\\t \\tsum += reciprocal + Math.log(1.0 - reciprocal);\\n\\t }\\t\\n\\t\\n\\t final double meisselMertens = euler + sum;\\t\\n\\t System.out.println(String.format(\\\"%s%.9f\\\", \\\"The Meissel-Mertens constant = \\\", meisselMertens));\\n\\t}\\t\\n\\t\\n\\tprivate static List<Double> listPrimeReciprocals(int aLimit) {\\n\\t\\tBitSet sieve = new BitSet(aLimit + 1);\\n\\t\\tsieve.set(2, aLimit + 1);\\n\\t\\t\\n\\t\\tfor ( int i = 2; i <= Math.sqrt(aLimit); i = sieve.nextSetBit(i + 1) ) {\\n\\t\\t\\tfor ( int j = i * i; j <= aLimit; j += i ) {\\n\\t\\t\\t\\tsieve.clear(j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tList<Double> result = new ArrayList<Double>(sieve.cardinality());\\n\\t\\tfor ( int i = 2; i >= 0; i = sieve.nextSetBit(i + 1) ) {\\n\\t\\t\\tresult.add(1.0 / i);\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn result;\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"using Base.MathConstants # sets constant γ = 0.5772156649015...\\nusing Primes\\n\\n\\\"\\\"\\\" Approximate the Meissel-Mertons constant. \\\"\\\"\\\"\\nfunction meissel_mertens(iterations = 100_000_000)\\n return mapreduce(p ->(d = 1/p; log(1 - d) + d), +, primes(prime(iterations))) + γ\\nend\\n\\n@show meissel_mertens(100_000_000) # meissel_mertens(100000000) = 0.2614972128591237\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"PrimeNumbers = Select[Range[100000000], PrimeQ[#] &]; (*all primes in the first 100 000 000 numbers, this takes a toll on my computer's CPU and RAM*)\\nMM = N[Total[Log[1 - 1/PrimeNumbers] + 1/PrimeNumbers] + EulerGamma, 10] (*Calculating it up to a precision of 10, this is correct up to 8 digits*)\\nAnalyticMMto305 = N[EulerGamma + Sum[MoebiusMu[n]/n Log[Zeta[n]], {n, 2, 1000}], 1000] (*Precise up to 305 digits*)\\nAnalyticMM = N[EulerGamma + Sum[MoebiusMu[n]/n Log[Zeta[n]], {n, 2, 10000}], 1001] (*Precise up to at least 1000 digits*)\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"meissel_mertens:%gamma+lsum(log(1-(1/i))+(1/i),i,primes(2,10000000)),numer;\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"import std/[math, strformat, strutils]\\n\\nproc initPrimes(N: static int): seq[int] =\\n ## Initialize the list of primes.\\n\\n const M = 2 * N - 1\\n var composite = newSeq[bool](N)\\n composite[0] = true # 1 is not prime.\\n\\n # Conversions from index to value and value to index.\\n template index(n: int): int = (n - 1) shr 1\\n template value(idx: int): int = idx shl 1 + 1\\n\\n # Fill the sieve.\\n var n = 3\\n while n * n <= M:\\n if not composite[n.index]:\\n for k in countup(n * n, M, 2 * n):\\n composite[k.index] = true\\n inc n, 2\\n\\n # Build list of primes.\\n result = @[2]\\n for idx in 0..composite.high:\\n if not composite[idx]:\\n result.add idx.value\\n\\n\\nconst N = 2^30\\nlet primes = initPrimes(N)\\n\\necho \\\"Primes added M\\\"\\necho \\\"──────────── ──────────────\\\"\\nconst γ = 0.57721566490153286 # Euler–Mascheroni constant.\\nlet primeCount = primes.len\\nvar sum = 0.0\\nvar count = 0\\nfor p in primes:\\n let rp = 1 / p\\n sum += ln(1 - rp) + rp\\n inc count\\n if count mod 10_000_000 == 0 or count == primeCount:\\n echo &\\\"{insertSep($count):>11} {sum+γ:.12}\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"{\\nMM(t)=\\n my(s=0);\\n forprime(p = 2, t,\\n s += log(1.-1./p)+1./p\\n );\\n Euler+s\\n};\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"{\\nMeissel_Mertens(d)=\\n default(realprecision, d);\\n my(prec = default(realprecision), z = 0, y = 0, q);\\n forprime(p = 2 , 7,\\n z += log(1.-1./p)+1./p\\n );\\n for(k = 2, prec,\\n q = 1;\\n forprime(p = 2, 7,\\n q *= 1.-p^-k\\n );\\n y += moebius(k)*log(zeta(k)*q)/k\\n );\\n Euler+z+y\\n};\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use v5.36;\\nuse ntheory qw(forprimes);\\n\\nmy $s;\\nforprimes { $s += log(1 - 1/$_)+1/$_ } 1e9;\\nsay my $result = $s + .57721566490153286;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (but perhaps a bit too slow)</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">mmc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0.2614972128476427837554268386086958590516</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">smmc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"0.2614972128476427837554268386086958590516\\\"</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0.57721566490153286</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">dpa</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">p10</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">pn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">adp</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">st</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"0\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">fmt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"%.0f\\\"</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;\\\">\\\"Primes added M\\\\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;\\\">\\\"------------ --------------\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">adp</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">10</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">rp</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #7060A8;\\\">get_prime</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #7060A8;\\\">log</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">rp</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">mmc</span><span style=\\\"color: #0000FF;\\\">)<</span><span style=\\\"color: #000000;\\\">dpa</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">ft</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;\\\">trunc</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">p10</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">p10</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (as below)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">ft</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">st</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- We have to artifically calculate a \\\"truncated t\\\", aka tt,\\n -- to prevent say 0.2..299[>5..] being automatically rounded\\n -- by printf() to 0.2..300, otherwise it just \\\"looks wrong\\\".\\n --</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">tt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">trunc</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">1e12</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">1e12</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;\\\">\\\"%,11d %0.12f (accurate to %d d.p.)\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">pn</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">tt</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">adp</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">adp</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">fmt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%%.%df\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">adp</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">st</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">smmc</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;\\\">adp</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">dpa</span> <span style=\\\"color: #0000FF;\\\">/=</span> <span style=\\\"color: #000000;\\\">10</span>\\n <span style=\\\"color: #000000;\\\">p10</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;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">pn</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: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"(actual value 0.26149721284764278375542683860869)\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- no mpfr_zeta[_ui]() in mpfr.js, as yet, or mpfr_log() or mpfr_const_euler(), for that matter</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: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">moebius</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;\\\">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> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">f</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">prime_factors</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</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: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">f</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;\\\">i</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: #008080;\\\">return</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;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">odd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">length</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><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;\\\">Meissel_Mertens</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_set_default_precision</span><span style=\\\"color: #0000FF;\\\">(-</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (d decimal places)</span>\\n <span style=\\\"color: #004080;\\\">mpfr</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rp</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;\\\">q</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpfr_inits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #008080;\\\">in</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;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- z += log(1-1/p)+1/p</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_set_si</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_div_si</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_add</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;\\\">rp</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_si_sub</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_log</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_add</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;\\\">rp</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;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #008080;\\\">do</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (see note)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">m</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">moebius</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;\\\">m</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_set_si</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>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #008080;\\\">in</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;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- q *= 1-power(p,-k)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_set_si</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_pow_si</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_si_sub</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- y += moebius(k)*log(zeta(k)*q)/k</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_zeta_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_log</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_div_si</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_mul_si</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rp</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: #000080;font-style:italic;\\\">-- res := EULER+z+y</span>\\n <span style=\\\"color: #000000;\\\">mpfr_const_euler</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_add</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;\\\">y</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_add</span><span style=\\\"color: #0000FF;\\\">(</span><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;\\\">z</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: #004080;\\\">mpfr</span> <span style=\\\"color: #000000;\\\">m</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">Meissel_Mertens</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1001</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">shorten</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">mpfr_get_str</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1001</span><span style=\\\"color: #0000FF;\\\">))</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"Procedure isPrime(v.i)\\n If v <= 1 : ProcedureReturn #False\\n ElseIf v < 4 : ProcedureReturn #True\\n ElseIf v % 2 = 0 : ProcedureReturn #False\\n ElseIf v < 9 : ProcedureReturn #True\\n ElseIf v % 3 = 0 : ProcedureReturn #False\\n Else\\n Protected r = Round(Sqr(v), #PB_Round_Down)\\n Protected f = 5\\n While f <= r\\n If v % f = 0 Or v % (f + 2) = 0\\n ProcedureReturn #False\\n EndIf\\n f + 6\\n Wend\\n EndIf\\n ProcedureReturn #True\\nEndProcedure\\n\\nOpenConsole()\\nEuler.d = 0.5772156649 ;0153286\\n\\nFor x.i = 2 To 1e8\\n If isPrime(x)\\n m.d = m + Log(1-(1/x)) + (1/x)\\n EndIf\\nNext x\\nPrintN(\\\"MM = \\\" + StrD(Euler + m))\\nPrintN(#CRLF$ + \\\"--- terminado, pulsa RETURN---\\\"): Input()\\nCloseConsole()\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"#!/usr/bin/python\\n\\nfrom math import log\\n\\ndef isPrime(n):\\n for i in range(2, int(n**0.5) + 1):\\n if n % i == 0:\\n return False\\n return True\\n\\n\\nif __name__ == '__main__':\\n Euler = 0.57721566490153286\\n m = 0\\n for x in range(2, 10_000_000):\\n if isPrime(x):\\n m += log(1-(1/x)) + (1/x)\\n\\n print(\\\"MM =\\\", Euler + m)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"# 20221011 Raku programming solution\\n\\nmy $s;\\n.is-prime and $s += log(1-1/$_)+1/$_ for 2 .. 10**8;\\nsay $s + .57721566490153286\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"function isPrime(n)\\nif n < 2 then isPrime = 0 : goto [exit]\\nif n = 2 then isPrime = 1 : goto [exit]\\nif n mod 2 = 0 then isPrime = 0 : goto [exit]\\nisPrime = 1\\nfor i = 3 to int(n^.5) step 2\\n if n mod i = 0 then isPrime = 0 : goto [exit]\\nnext i\\n[exit]\\nend function\\n\\ne = 0.5772156\\n\\nfor x = 2 to 100000 ' more prime numbers do not add more precision\\n if isPrime(x) then m = m + log(1-(1/x)) + (1/x)\\nnext x\\nprint \\\"MM = \\\"; e + m\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"var sum = 0\\n1e7.each_prime {|p|\\n with (1f/p) {|t|\\n sum += (log(1 - t) + t)\\n }\\n}\\nsay sum+Num.EulerGamma\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"FUNCTION isPrime (n)\\n IF n = 2 THEN\\n LET isPrime = 1\\n ELSEIF n <= 1 OR REMAINDER(n, 2) = 0 THEN\\n LET isPrime = 0\\n ELSE\\n LET isPrime = 1\\n FOR i = 3 TO INT(SQR(n)) STEP 2\\n IF REMAINDER(n, i) = 0 THEN\\n LET isPrime = 0\\n EXIT FUNCTION\\n END IF\\n NEXT i\\n END IF\\nEND FUNCTION\\n\\nLET e = .5772156649\\n\\nFOR x = 2 to 1e6 !more prime numbers do not add more precision\\n IF isPrime(x) = 1 THEN\\n LET m = m + LOG(1-(1/x)) + (1/x)\\n END IF\\nNEXT x\\nPRINT \\\"MM =\\\"; e + m\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"import \\\"./math\\\" for Int\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar euler = 0.57721566490153286\\nvar primes = Int.primeSieve(2.pow(31))\\nvar pc = primes.count\\nvar sum = 0\\nvar c = 0\\nSystem.print(\\\"Primes added M\\\")\\nSystem.print(\\\"------------ --------------\\\")\\nfor (p in primes) {\\n var rp = 1/p\\n sum = (1-rp).log + rp + sum\\n c = c + 1\\n if ((c % 1e7) == 0 || c == pc) Fmt.print(\\\"$,11d $0.12f\\\", c, sum + euler)\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"import \\\"./gmp\\\" for Mpf\\nimport \\\"./math\\\" for Int\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar isSquareFree = Fn.new { |n|\\n var i = 2\\n while (i * i <= n) {\\n if (n%(i*i) == 0) return false\\n i = (i > 2) ? i + 2 : i + 1\\n }\\n return true\\n}\\n\\nvar mu = Fn.new { |n|\\n if (n < 1) Fiber.abort(\\\"Argument must be a positive integer\\\")\\n if (n == 1) return 1\\n var sqFree = isSquareFree.call(n)\\n var factors = Int.primeFactors(n)\\n if (sqFree && factors.count % 2 == 0) return 1\\n if (sqFree) return -1\\n return 0\\n}\\n\\nvar meisselMertens = Fn.new { |d|\\n Mpf.defaultPrec = d\\n var z = Mpf.zero\\n var y = Mpf.zero\\n var r = Mpf.new()\\n var q = Mpf.new()\\n var t = Mpf.new()\\n var m = Mpf.new()\\n for (p in [2, 3, 5, 7]) {\\n r.setUi(p).inv\\n t.uiSub(1, r).log.add(r)\\n z.add(t, z)\\n }\\n for (k in 2..d) {\\n q.setUi(1)\\n for (p in [2, 3, 5, 7]) {\\n r.setUi(p).inv\\n t.uiSub(1, r.pow(k))\\n q.mul(t)\\n }\\n m.setSi(mu.call(k))\\n t.zetaUi(k).mul(q).log.mul(m).div(k)\\n y.add(t, y)\\n }\\n return Mpf.euler.add(z).add(y)\\n}\\n\\nFmt.print(\\\"$20a\\\", meisselMertens.call(3300).toString(1001))\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func IsPrime(N); \\\\Return 'true' if N is prime\\nint N, D;\\n[if N < 2 then return false;\\nif (N&1) = 0 then return N = 2;\\nif rem(N/3) = 0 then return N = 3;\\nD:= 5;\\nwhile D*D <= N do\\n [if rem(N/D) = 0 then return false;\\n D:= D+2;\\n if rem(N/D) = 0 then return false;\\n D:= D+4;\\n ];\\nreturn true;\\n];\\n\\ndef Euler = 0.57721566490153286;\\nreal M; int P;\\n[M:= 0.;\\nfor P:= 2 to 100_000_000 do\\n if IsPrime(P) then\\n M:= M + Ln(1. - 1./float(P)) + 1./float(P);\\nFormat(1, 16);\\nText(0, \\\"MM = \\\"); RlOut(0, Euler + M); CrLf(0);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"e = 0.5772156\\n\\nfor x = 2 to 1e6 // more prime numbers do not add more precision\\n\\tif isPrime(x) m = m + log(1-(1/x)) + (1/x)\\nnext x\\nprint \\\"MM = \\\", e + m\\nend\\n\\nsub isPrime(v)\\n if v < 2 return False\\n if mod(v, 2) = 0 return v = 2\\n if mod(v, 3) = 0 return v = 3\\n d = 5\\n while d * d <= v\\n if mod(v, d) = 0 then return False else d = d + 2 : fi\\n wend\\n return True\\nend sub\\n\",\n \"language\": \"Yabasic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Meissel-Mertens-constant"}}},{"rowIdx":481,"cells":{"solutions":{"kind":"list like","value":[{"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 stack|stack]], shared, foreign) if applicable.\n<br><br>\n\n","language":"00-TASK"},{"code":"* Request to Get Storage Managed by \"GETMAIN\" Supervisor Call (SVC 4)\n LA 1,PLIST Point Reg 1 to GETMAIN/FREEMAIN Parm List\n SVC 4 Issue GETMAIN SVC\n LTR 15,15 Register 15 = 0?\n BZ GOTSTG Yes: Got Storage\n* [...] No: Handle GETMAIN Failure\nGOTSTG L 2,STG@ Load Reg (any Reg) with Addr of Aquired Stg\n* [...] Continue\n* Request to Free Storage Managed by \"FREEMAIN\" Supervisor Call (SVC 5)\n LA 1,PLIST Point Reg 1 to GETMAIN/FREEMAIN Parm List\n SVC 5 Issue FREEMAIN SVC\n LTR 15,15 Register 15 = 0?\n BZ STGFRE Yes: Storage Freed\n* [...] No: Handle FREEMAIN Failure\nSTGFRE EQU * Storage Freed\n* [...] Continue\n*\nSTG@ DS A Address of Stg Area (Aquired or to be Freed)\nPLIST EQU * 10-Byte GETMAIN/FREEMAIN Parameter List\n DC A(256) Number of Bytes; Max=16777208 ((2**24)-8)\n DC A(STG@) Pointer to Address of Storage Area\n DC X'0000' (Unconditional Request; Subpool 0)\n","language":"360-Assembly"},{"code":"STOREXNO AMODE 31\nSTOREXNO RMODE ANY\nSTOREXNO CSECT ,\n SYSSTATE AMODE64=NO,ARCHLVL=3 gen z9+, z/OS 2.1+ bin code\n IEABRCX DEFINE convert based to relative branches\n BAKR 14,0 callers registers to linkage stack\n LARL 12,CONSTANTS load address relative long\n USING CONSTANTS,12 using for constants\n LA 9,WALEN load memory length in Register 9\n STORAGE OBTAIN,LENGTH=(9),EXECUTABLE=NO,LOC=ANY\n LR 10,1 Reg1 holds address of mem area\n USING DYNAREA,10 using for dynamic memory area\n LA 13,SAVEA PC routine convention: ...\n MVC SAVEA+4(4),=C'F1SA' ... format 1 savearea: L-stack\n*\n* copy instruction sequence SR Reg15,Reg15; Branch Reg14 to DATA1\n* in obtained storage location, and branch to it\n*\n MVC DATA1(8),=X'1BFF07FE00000000' SR 15,15; BR 14\n LA 7,DATA1\n BASR 14,7 This will OC4-4 with EXECUTABLE=NO\n STORAGE RELEASE,ADDR=(10),LENGTH=(9),EXECUTABLE=NO\n PR , return to caller\nCONSTANTS DS 0D constant section, aligned for LARL\n DC C'SOMEDATA'\n DC C'SOMEOTHERDATA'\n LTORG , have assembler build literal pool\nDYNAREA DSECT\nSAVEA DS 18F\nDATA1 DS 2F\nDATA2 DS CL256 can receive any value\nWALEN EQU *-DYNAREA length of obtained area\n END STOREXNO end of module\n","language":"360-Assembly"},{"code":"LDA #$FF ;load 255 into the accumulator\nSTA $00 ;store at zero page memory address $00\nSTA $0400 ;store at absolute memory address $0400\n","language":"6502-Assembly"},{"code":"MyFunction:\nLINK A6,#-16 ;create a stack frame of 16 bytes. Now you can safely write to (SP+0) thru (SP+15).\n\n;;;; your code goes here.\n\nUNLK A6 ;free the stack frame\nRTS\n","language":"68000-Assembly"},{"code":"MOVE.L An,-(SP)\nMOVEA.L SP,An\nLEA (-disp,SP),SP\n","language":"68000-Assembly"},{"code":"CARD EndProg ;required for ALLOCATE.ACT\n\nINCLUDE \"D2:ALLOCATE.ACT\" ;from the Action! Tool Kit. You must type 'SET EndProg=*' from the monitor after compiling, but before running this program!\n\nPROC Main()\n DEFINE SIZE=\"1000\"\n BYTE POINTER ptr\n\n AllocInit(EndProg) ;required before any memory allocation\n\n ptr=Alloc(SIZE) ;allocate memory of 1000 bytes\n SetBlock(ptr,SIZE,$FF) ;fill the memory block with $FF\n Free(ptr,SIZE) ;free allocated memory\nRETURN\n","language":"Action-"},{"code":"declare\n X : Integer; -- Allocated on the stack\nbegin\n ...\nend; -- X is freed\n","language":"Ada"},{"code":"declare\n type Integer_Ptr is access Integer;\n Ptr : Integer_Ptr := new Integer; -- Allocated in the heap\nbegin\n ...\nend; -- Memory is freed because Integer_Ptr is finalized\n","language":"Ada"},{"code":"declare\n type Integer_Ptr is access Integer;\n procedure Free is new Ada.Unchecked_Deallocation (Integer, Integer_Ptr)\n Ptr : Integer_Ptr := new Integer; -- Allocated in the heap\nbegin\n Free (Ptr); -- Explicit deallocation\n ...\nend;\n","language":"Ada"},{"code":"package P is\n X : Integer; -- Allocated in the result the package elaboration\nend P;\n","language":"Ada"},{"code":"MODE MYSTRUCT = STRUCT(INT i, j, k, REAL r, COMPL c);\n","language":"ALGOL-68"},{"code":"REF MYSTRUCT l = LOC MYSTRUCT;\n","language":"ALGOL-68"},{"code":"REF MYSTRUCT h = HEAP MYSTRUCT;\n","language":"ALGOL-68"},{"code":"[666]MYSTRUCT pool;\nINT new pool := LWB pool-1;\nREF MYSTRUCT p = pool[new pool +:=1];\n","language":"ALGOL-68"},{"code":"MYSTRUCT i;\n","language":"ALGOL-68"},{"code":"begin\n % define a record structure - instances must be created dynamically %\n record Element ( integer atomicNumber; string(16) name );\n reference(Element) X;\n % allocate and initialise memory for X - heap storage is the only option %\n X := Element( 1, \"Hydrogen\" );\n % allocate new memory for X, the original could now be garbage collected %\n X := Element( 2, \"Helium\" )\n % the memory allocated will now be garbage collected - there is no explicit de-allocation %\nend.\n","language":"ALGOL-W"},{"code":"myBlock: @[1 2 3]\n'myBlock ++ [4 5 6]\n","language":"Arturo"},{"code":"VarSetCapacity(Var, 10240000) ; allocate 10 megabytes\nVarSetCapacity(Var, 0) ; free it\n","language":"AutoHotkey"},{"code":"Buff(100)→Str1\n.Str1 points to a 100-byte memory region allocated at compile time\n","language":"Axe"},{"code":" size% = 12345\n DIM mem% size%-1\n PRINT ; size% \" bytes of heap allocated at \" ; mem%\n","language":"BBC-BASIC"},{"code":" size% = 12345\n PROCstack(size%)\n END\n\n DEF PROCstack(s%)\n LOCAL mem%\n DIM mem% LOCAL s%-1\n PRINT ; s% \" bytes of stack allocated at \" ; mem%\n ENDPROC\n","language":"BBC-BASIC"},{"code":"( alc$2000:?p {allocate 2000 bytes}\n& pok$(!p,123456789,4) { poke a large value as a 4 byte integer }\n& pok$(!p+4,0,4) { poke zeros in the next 4 bytes }\n& out$(pee$(!p,1)) { peek the first byte }\n& out$(pee$(!p+2,2)) { peek the short int located at the third and fourth byte }\n& out$(pee$(!p,4)) { peek the first four bytes }\n& out$(pee$(!p+6,2)) { peek the two bytes from the zeroed-out range }\n& out$(pee$(!p+1000,2)) { peek some uninitialized data }\n& fre$!p { free the memory }\n&);\n","language":"Bracmat"},{"code":"#include <stdlib.h>\n\n/* size of \"members\", in bytes */\n#define SIZEOF_MEMB (sizeof(int))\n#define NMEMB 100\n\nint main()\n{\n int *ints = malloc(SIZEOF_MEMB*NMEMB);\n /* realloc can be used to increase or decrease an already\n allocated memory (same as malloc if ints is NULL) */\n ints = realloc(ints, sizeof(int)*(NMEMB+1));\n /* calloc set the memory to 0s */\n int *int2 = calloc(NMEMB, SIZEOF_MEMB);\n /* all use the same free */\n free(ints); free(int2);\n return 0;\n}\n","language":"C"},{"code":"int func()\n{\n int ints[NMEMB]; /* it resembles malloc ... */\n int *int2; /* here the only thing allocated on the stack is a pointer */\n char intstack[SIZEOF_MEMB*NMEMB]; /* to show resemblance to malloc */\n int2 = (int *)intstack; /* but this is educative, do not do so unless... */\n\n {\n const char *pointers_to_char[NMEMB];\n /* use pointers_to_char */\n pointers_to_char[0] = \"educative\";\n } /* outside the block, the variable \"disappears\" */\n\n /* here we can use ints, int2, intstack vars, which are not seen elsewhere of course */\n\n return 0;\n}\n","language":"C"},{"code":"#include <alloca.h>\nint *funcA()\n{\n int *ints = alloca(SIZEOF_MEMB*NMEMB);\n ints[0] = 0; /* use it */\n return ints; /* BUT THIS IS WRONG! It is not like malloc: the memory\n does not \"survive\"! */\n}\n","language":"C"},{"code":"/* this is global */\nint integers[NMEMB]; /* should be initialized with 0s */\n\nint funcB()\n{\n static int ints[NMEMB]; /* this is \"static\", i.e. the memory \"survive\" even\n when the function exits, but the symbol's scope is local */\n return integers[0] + ints[0];\n}\n\nvoid funcC(int a)\n{\n integers[0] = a;\n}\n","language":"C"},{"code":"#include <string>\n\nint main()\n{\n int* p;\n\n p = new int; // allocate a single int, uninitialized\n delete p; // deallocate it\n\n p = new int(2); // allocate a single int, initialized with 2\n delete p; // deallocate it\n\n std::string* p2;\n\n p2 = new std::string; // allocate a single string, default-initialized\n delete p2; // deallocate it\n\n p = new int[10]; // allocate an array of 10 ints, uninitialized\n delete[] p; // deallocation of arrays must use delete[]\n\n p2 = new std::string[10]; // allocate an array of 10 strings, default-initialized\n delete[] p2; // deallocate it\n}\n","language":"C++"},{"code":"int main()\n{\n void* memory = operator new(20); // allocate 20 bytes of memory\n operator delete(memory); // deallocate it\n}\n","language":"C++"},{"code":"#include <new>\n\nint main()\n{\n union\n {\n int alignment_dummy; // make sure the block is correctly aligned for ints\n char data[2*sizeof(int)]; // enough space for 10 ints\n };\n int* p = new(&data) int(3); // construct an int at the beginning of data\n new(p+1) int(5); // construct another int directly following\n}\n","language":"C++"},{"code":"void* memory_for_p = operator new(sizeof(int));\nint* p = new(memory_for_p) int(3);\n","language":"C++"},{"code":"#include <new>\n\nint* p = new(std::nothrow) int(3);\n","language":"C++"},{"code":"#include <cstddef>\n#include <cstdlib>\n#include <new>\n\nclass MyClass\n{\npublic:\n void* operator new(std::size_t size)\n {\n void* p = std::malloc(size);\n if (!p) throw std::bad_alloc();\n return p;\n }\n void operator delete(void* p)\n {\n free(p);\n }\n};\n\nint main()\n{\n MyClass* p = new MyClass; // uses class specific operator new\n delete p; // uses class specific operator delete\n\n int* p2 = new int; // uses default operator new\n delete p2; // uses default operator delete\n}\n","language":"C++"},{"code":"class arena { /* ... */ };\n\nvoid* operator new(std::size_t size, arena& a)\n{\n return arena.alloc(size);\n}\n\nvoid operator delete(void* p, arena& a)\n{\n arena.dealloc(p);\n}\n\narena whatever(/* ... */);\n\nint* p = new(whatever) int(3); // uses operator new from above to allocate from the arena whatever\n","language":"C++"},{"code":"class MyClass { /*...*/ };\n\nint main()\n{\n MyClass* p = new(whatever) MyClass; // allocate memory for myclass from arena and construct a MyClass object there\n // ...\n p->~MyClass(); // explicitly destruct *p\n operator delete(p, whatever); // explicitly deallocate the memory\n}\n","language":"C++"},{"code":"using System;\nusing System.Runtime.InteropServices;\n\npublic unsafe class Program\n{\n public static unsafe void HeapMemory()\n {\n const int HEAP_ZERO_MEMORY = 0x00000008;\n const int size = 1000;\n int ph = GetProcessHeap();\n void* pointer = HeapAlloc(ph, HEAP_ZERO_MEMORY, size);\n if (pointer == null)\n throw new OutOfMemoryException();\n Console.WriteLine(HeapSize(ph, 0, pointer));\n HeapFree(ph, 0, pointer);\n }\n\n public static unsafe void StackMemory()\n {\n byte* buffer = stackalloc byte[1000];\n // buffer is automatically discarded when the method returns\n }\n public static void Main(string[] args)\n {\n HeapMemory();\n StackMemory();\n }\n [DllImport(\"kernel32\")]\n static extern void* HeapAlloc(int hHeap, int flags, int size);\n [DllImport(\"kernel32\")]\n static extern bool HeapFree(int hHeap, int flags, void* block);\n [DllImport(\"kernel32\")]\n static extern int GetProcessHeap();\n [DllImport(\"kernel32\")]\n static extern int HeapSize(int hHeap, int flags, void* block);\n\n}\n","language":"C-sharp"},{"code":" PROGRAM-ID. memory-allocation.\n\n DATA DIVISION.\n WORKING-STORAGE SECTION.\n 01 based-data PIC X(20) VALUE \"Hello, World!\"\n BASED.\n\n PROCEDURE DIVISION.\n *> INITIALIZED sets the data item to the VALUE.\n ALLOCATE based-data INITIALIZED\n DISPLAY based-data\n FREE based-data\n\n GOBACK\n .\n","language":"COBOL"},{"code":"(defun show-allocation ()\n (let ((a (cons 1 2))\n (b (cons 1 2)))\n (declare (dynamic-extent b))\n (list a b)))\n","language":"Common-Lisp"},{"code":"(show-allocation)\n","language":"Common-Lisp"},{"code":"// D is a system language so its memory management is refined.\n// D supports thread-local memory on default, global memory, memory\n// allocated on the stack, the C heap, or the D heap managed by a\n// garbage collector, both manually and automatically.\n\n// This program looks scary because its purpose is to show all the\n// variety. But lot of this stuff is only for special situations\n// (like alloca), and it's not necessary in most user code.\n\nenum int nInts = 10; // Compile-time constant.\n\n// This is thread-local:\nint[nInts] data1;\n\n// This is global:\n__gshared int[nInts] data2;\n\nvoid main() {\n // Static memory, it's thread-local but its name is usable\n // only locally:\n static int[nInts] data3;\n\n // Static memory, it's global but its name is usable only locally:\n __gshared static int[nInts] data4;\n\n // ----------------------\n // D supports the functions that manage memory of the C heap:\n import core.stdc.stdlib: malloc, calloc, realloc, free, alloca;\n\n // Allocates space for some integers on the heap,\n // the memory is not initialized:\n auto ptr1 = cast(int*)malloc(nInts * int.sizeof);\n if (ptr1 == null)\n return;\n\n // Increases the space for one more integer, the new space\n // is not initialized, but the old space is not modified:\n ptr1 = cast(int*)realloc(ptr1, (nInts + 1) * int.sizeof);\n if (ptr1 == null)\n return;\n\n // calloc allocates on the heap and zeros the memory:\n auto ptr2 = cast(int*)calloc(nInts, int.sizeof);\n if (ptr2 == null)\n return;\n\n // You can create a slice from a pointer:\n auto slice1 = ptr2[0 .. nInts];\n\n // Frees the memory:\n free(ptr2);\n free(ptr1);\n\n // ----------------------\n import core.stdc.stdio: puts;\n\n static struct Test {\n ~this() { puts(\"Test destructor\"); }\n }\n\n // Memory allocated on the stack:\n Test[2] array1;\n\n {\n // More memory allocated on the stack:\n Test[2] array2;\n // Here array2 is removed from the stack,\n // and all array2 destructors get called.\n }\n puts(\"Block end.\");\n\n // alloca is supported in D. It's similar to malloc but the\n // memory is allocated on the stack:\n int* ptr3 = cast(int*)alloca(nInts * int.sizeof);\n\n // You can create a slice from the pointer:\n auto slice2 = ptr3[0 .. nInts];\n\n // Do not free the memory allocated with alloca:\n // free(ptr3);\n\n // ----------------------\n // Allocates a dynamic array on the D heap managed by\n // the D garbage collector:\n auto array3 = new int[nInts];\n\n // Try to reserve capacity for a dynamic array on the D heap:\n int[] array4;\n array4.reserve(nInts);\n assert(array4.capacity >= nInts);\n assert(array4.length == 0);\n\n // Appends one integer to the dynamic array:\n array4 ~= 100;\n\n // Assume that it is safe to append to this array. Appends made\n // to this array after calling this function may append in place,\n // even if the array was a slice of a larger array to begin with:\n array4.assumeSafeAppend;\n array4 ~= 200;\n array4 ~= 300;\n assert(array4.length == 3);\n // See here for more info:\n // http://dlang.org/d-array-article.html\n\n\n // Allocates a struct and a class on the D GC heap:\n static class Foo { int x; }\n Test* t = new Test; // This destructor will not be called.\n Foo f1 = new Foo; // f1 is a class reference.\n\n // Optional. Destroys the given object and puts it in\n // an invalid state:\n f1.destroy;\n\n import std.typecons: scoped;\n\n // Allocates a class on the stack, unsafe:\n auto f3 = scoped!Foo();\n\n // ----------------------\n import core.memory: GC;\n\n // Allocates an aligned block from the GC, initialized to zero.\n // Plus it doesn't scan through this block on collect.\n auto ptr4 = cast(int*)GC.calloc(nInts * int.sizeof,\n GC.BlkAttr.NO_SCAN);\n\n // No need to test for this, because GC.calloc usually\n // throws OutOfMemoryError if it can't allocate.\n // if (ptr4 == null)\n // exit(1);\n\n GC.free(ptr4); // This is optional.\n}\n","language":"D"},{"code":"? <elib:tables.makeFlexList>.fromType(<type:java.lang.Byte>, 128)\n# value: [].diverge()\n","language":"E"},{"code":"2000 malloc (...do stuff..) free\n","language":"Factor"},{"code":"STRUCT: foo { a int } { b foo* } ;\n\n[\n foo malloc-struct &free ! gets freed at end of the current with-destructors scope\n ! do stuff\n] with-destructors\n","language":"Factor"},{"code":"unused . \\ memory available for use in dictionary\nhere . \\ current dictionary memory pointer\n: mem, ( addr len -- ) here over allot swap move ;\n: s, ( str len -- ) here over char+ allot place align ; \\ built-in on some forths\n: ,\" [char] \" parse s, ;\nvariable num\ncreate array 60 cells allot\ncreate struct 0 , 10 , char A c, ,\" string\"\nunused .\nhere .\n","language":"Forth"},{"code":"marker foo\n: temp ... ;\ncreate dummy 300 allot\n-150 allot \\ trim the size of dummy by 150 bytes\nfoo \\ removes foo, temp, and dummy from the list of definitions\n","language":"Forth"},{"code":"4096 allocate throw ( addr )\ndup 4096 erase\n( addr ) free throw\n","language":"Forth"},{"code":"program allocation_test\n implicit none\n real, dimension(:), allocatable :: vector\n real, dimension(:, :), allocatable :: matrix\n real, pointer :: ptr\n integer, parameter :: n = 100 ! Size to allocate\n\n allocate(vector(n)) ! Allocate a vector\n allocate(matrix(n, n)) ! Allocate a matrix\n allocate(ptr) ! Allocate a pointer\n\n deallocate(vector) ! Deallocate a vector\n deallocate(matrix) ! Deallocate a matrix\n deallocate(ptr) ! Deallocate a pointer\nend program allocation_test\n","language":"Fortran"},{"code":"Dim As Integer size = 12345\nDim As Integer mem = size-1\nPrint size; \" bytes of heap allocated at \" ; mem\nClear (mem, , 10)\nPrint size; \" bytes of heap allocated at \" ; mem\n","language":"FreeBASIC"},{"code":"Dim As Integer size = 12345\nDim As Integer mem = size-1\n\nSub Stack(s As Integer)\n Dim As Integer mem = s-1\n Print s; \" bytes of stack allocated at \" ; mem\nEnd Sub\n\nStack(size)\nPrint size; \" bytes of stack allocated at \" ; mem\n","language":"FreeBASIC"},{"code":"func inc(n int) {\n x := n + 1\n println(x)\n}\n","language":"Go"},{"code":"func inc(n int) *int {\n x := n + 1\n return &x\n}\n","language":"Go"},{"code":"type s struct{a, b int}\n","language":"Go"},{"code":"&s{}\n","language":"Go"},{"code":"new(s)\n","language":"Go"},{"code":"make([]int, 3)\nmake(map[int]int)\nmake(chan int)\n","language":"Go"},{"code":"import Foreign\n\nbytealloc :: IO ()\nbytealloc = do\n a0 <- mallocBytes 100 -- Allocate 100 bytes\n free a0 -- Free them again\n allocaBytes 100 $ \\a -> -- Allocate 100 bytes; automatically\n -- freed when closure finishes\n poke (a::Ptr Word32) 0\n","language":"Haskell"},{"code":"import Foreign\n\ntypedalloc :: IO ()\ntypedalloc = do\n w <- malloc\n poke w (100 :: Word32)\n free w\n alloca $ \\a -> poke a (100 :: Word32)\n","language":"Haskell"},{"code":" t := table() # The table's memory is allocated\n #... do things with t\n t := &null # The table's memory can be reclaimed\n","language":"Icon"},{"code":" require 'dll'\n mema 1000\n57139856\n","language":"J"},{"code":"memf 57139856\n","language":"J"},{"code":"//All of these objects will be deallocated automatically once the program leaves\n//their scope and there are no more pointers to the objects\nObject foo = new Object(); //Allocate an Object and a reference to it\nint[] fooArray = new int[size]; //Allocate all spaces in an array and a reference to it\nint x = 0; //Allocate an integer and set its value to 0\n","language":"Java"},{"code":"public class Blah{\n //...other methods/data members...\n protected void finalize() throws Throwable{\n //Finalization code here\n }\n //...other methods/data members...\n}\n","language":"Java"},{"code":"public class NoFinalize {\n public static final void main(String[] params) {\n NoFinalize nf = new NoFinalize();\n }\n public NoFinalize() {\n System.out.println(\"created\");\n }\n @Override\n protected void finalize() {\n System.out.println(\"finalized\");\n }\n}\n","language":"Java"},{"code":"matrix = Array{Float64,2}(100,100)\nmatrix[31,42] = pi\n","language":"Julia"},{"code":"// version 1.1.2\n\nclass MyClass(val myInt: Int) {\n // in theory this method should be called automatically prior to GC\n protected fun finalize() {\n println(\"MyClass being finalized...\")\n }\n}\n\nfun myFun() {\n val mc: MyClass = MyClass(2) // new non-nullable MyClass object allocated on the heap\n println(mc.myInt)\n var mc2: MyClass? = MyClass(3) // new nullable MyClass object allocated on the heap\n println(mc2?.myInt)\n mc2 = null // allowed as mc2 is nullable\n println(mc2?.myInt)\n // 'mc' and 'mc2' both become eligible for garbage collection here as no longer used\n}\n\nfun main(args: Array<String>) {\n myFun()\n Thread.sleep(3000) // allow time for GC to execute\n val i: Int = 4 // new non-nullable Int allocated on stack\n println(i)\n var j: Int? = 5 // new nullable Int allocated on heap\n println(j)\n j = null // allowed as 'j' is nullable\n println(j)\n // 'j' becomes eligible for garbage collection here as no longer used\n}\n","language":"Kotlin"},{"code":"-- Create a ByteArray of 100 Kb (pre-filled with 0 bytes)\nba = byteArray(102400)\n\n-- Lingo uses garbage-collection, so allocated memory is released when no more references exist.\n-- For the above variable ba, this can be achieved by calling:\nba = VOID\n","language":"Lingo"},{"code":"Module Checkit {\n Buffer Clear Mem1 as Byte*12345\n Print Len(Mem1)\n Hex Mem1(0) ' print in Hex address of first element\n Print Mem1(Len(Mem1)-1)-Mem1(0)+1=12345\n Buffer Mem1 as Byte*20000 ' redim block\n Print Mem1(Len(Mem1)-1)-Mem1(0)+1=20000\n Try {\n Print Mem1(20000) ' it is an error\n }\n Print Error$ ' return message: Buffer Locked, wrong use of pointer\n}\nCheckit\n","language":"M2000-Interpreter"},{"code":"a := Array( 1 .. 10^6, datatype = integer[1] ):\n","language":"Maple"},{"code":"unassign( a ):\n","language":"Maple"},{"code":"a := 'a':\n","language":"Maple"},{"code":" A = zeros(1000); \t% allocates memory for a 1000x1000 double precision matrix.\n clear A;\t\t% deallocates memory\n\n b = zeros(1,100000);\t% pre-allocate memory to improve performance\n for k=1:100000,\n\tb(k) = 5*k*k-3*k+2;\n end\n","language":"MATLAB"},{"code":"/* Maxima allocates memory dynamically and uses a garbage collector.\nHere is how to check available memory */\n\nroom();\n 3221/3221 72.3% 2 CONS RATIO COMPLEX STRUCTURE\n 272/307 61.6% FIXNUM SHORT-FLOAT CHARACTER RANDOM-STATE READTABLE SPICE\n 226/404 90.8% SYMBOL STREAM\n 1/2 37.2% PACKAGE\n 127/373 44.9% ARRAY HASH-TABLE VECTOR BIT-VECTOR PATHNAME CCLOSURE CLOSURE\n 370/370 49.1% 1 STRING\n 325/440 8.2% CFUN BIGNUM LONG-FLOAT\n 31/115 98.9% SFUN GFUN VFUN AFUN CFDATA\n 1188/1447 contiguous (478 blocks)\n 11532 hole\n 5242 5.0% relocatable\n 4573 pages for cells\n 22535 total pages\n 97138 pages available\n 11399 pages in heap but not gc'd + pages needed for gc marking\n 131072 maximum pages\n","language":"Maxima"},{"code":"import native\n\n// allocate 26 bytes\nptr = native.allocate(26)\n\n// store the uppercase alphabet\nfor i in range(0, 25)\n native.poke(ptr + i, ord(\"A\") + i)\nend\n\n// output the allocated memory\nfor i in range(0, 25)\n print chr(native.peek(ptr + i))\nend\n\n// free the allocated memory\nnative.free(ptr)\n","language":"Nanoquery"},{"code":"# Allocate thread local heap memory\nvar a = alloc(1000)\ndealloc(a)\n\n# Allocate memory block on shared heap\nvar b = allocShared(1000)\ndeallocShared(b)\n\n# Allocate and Dellocate a single int on the thread local heap\nvar p = create(int, sizeof(int)) # allocate memory\n# create zeroes memory; createU does not.\necho p[] # 0\np[] = 123 # assign a value\necho p[] # 123\ndiscard resize(p, 0) # deallocate it\n# p is now invalid. Let's set it to nil\np = nil # set pointer to nil\necho isNil(p) # true\n","language":"Nim"},{"code":"foo := Object->New(); // allocates an object on the heap\nfoo_array := Int->New[size]; // allocates an integer array on the heap\nx := 0; // allocates an integer on the stack\n","language":"Objeck"},{"code":"package main\n\nimport \"core:mem\"\n\nmain :: proc() {\n ptr := mem.alloc(1000) // Allocate heap memory\n mem.free(ptr)\n}\n","language":"Odin"},{"code":"'ALLOCATING MEMORY FROM DIFFERENT MEMORY SOURCES\n\nsys p\n\n\nstatic byte b[0x1000] 'global memory\np=@b\n\n\nfunction f()\nlocal byte b[0x1000] 'stack memory in a procedure\np=@b\nend function\n\n\np=getmemory 0x1000 'heap memory\n...\nfreememory p 'to disallocate\n\n\nsub rsp,0x1000 'stack memory direct\np=rsp\n...\nrsp=p 'to disallocate\n\n\n'Named Memory shared between processes is\n'also available using the Windows API (kernel32.dll)\n'see MSDN:\n'CreateFileMapping\n'OpenFileMapping\n'MapViewOfFile\n'UnmapViewOfFile\n'CloseHandle\n","language":"OxygenBasic"},{"code":"allocatemem(100<<20)\n","language":"PARI-GP"},{"code":"type\n TByteArray = array of byte;\nvar\n A: TByteArray;\nbegin\n setLength(A,1000);\n...\n setLength(A,0);\nend;\n","language":"Pascal"},{"code":"type\n Tcl = class\n dummy: longint;\n end;\nvar\n c1: cl;\nbegin\n c1:=Tcl.create;\n...\n c1.destroy;\nend;\n","language":"Pascal"},{"code":"-->\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">addr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">allocate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">512</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- limit is 1,610,612,728 bytes on 32-bit systems</span>\n <span style=\"color: #0000FF;\">...</span>\n <span style=\"color: #7060A8;\">free</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">addr</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">addr2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">allocate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">512</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- automatically freed when addr2 drops out of scope or re-assigned</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">addr3</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">allocate_string</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"a string\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- automatically freed when addr3 drops out of scope or re-assigned</span>\n<!--\n","language":"Phix"},{"code":" mainproc: proc options(main) reorder;\n\n subproc: proc;\n dcl subvar char init ('X');\n\n put skip data(subvar);\n subvar = 'Q';\n end subproc;\n\n call subproc();\n call subproc();\n end mainproc;\n","language":"PL-I"},{"code":" mainproc: proc options(main) reorder;\n dcl ctlvar char ctl;\n\n alloc ctlvar;\n ctlvar = 'A';\n alloc ctlvar;\n ctlvar = 'B';\n alloc ctlvar;\n ctlvar = 'C';\n\n put skip data(ctlvar);\n free ctlvar;\n put skip data(ctlvar);\n free ctlvar;\n put skip data(ctlvar);\n free ctlvar;\n end mainproc;\n","language":"PL-I"},{"code":" mainproc: proc options(main) reorder;\n dcl list_ptr ptr init (sysnull());\n dcl list_top ptr init (sysnull());\n dcl list_end ptr init (addr(list_top));\n dcl i fixed bin (31);\n\n dcl 1 list based(list_ptr),\n 2 list_nxt ptr init (sysnull()),\n 2 list_data fixed bin (31) init (i);\n\n /*\n * Allocate the list\n */\n do i = 1 to 4;\n alloc list;\n list_end -> list_nxt = list_ptr;\n list_end = list_ptr;\n end;\n\n /*\n * Print the list\n */\n do list_ptr = list_top repeat list_nxt\n while(list_ptr ^= sysnull());\n put skip list(list_data);\n end;\n end mainprog;\n","language":"PL-I"},{"code":"*buffer=AllocateMemory(20)\n\n*newBuffer = ReAllocateMemory(*buffer, 2000) ;increase size of buffer\n;*buffer value is still valid if newBuffer wasn't able to be reallocated\nIf *newBuffer <> 0\n *buffer = *newBuffer : *newBuffer = 0\nEndIf\n\nFreeMemory(*buffer)\n\n\nsize=20\n; allocate an image for use with image functions\nCreateImage(1,size,size)\nFreeImage(1)\n","language":"PureBasic"},{"code":">>> from array import array\n>>> argslist = [('l', []), ('c', 'hello world'), ('u', u'hello \\u2641'),\n\t('l', [1, 2, 3, 4, 5]), ('d', [1.0, 2.0, 3.14])]\n>>> for typecode, initializer in argslist:\n\ta = array(typecode, initializer)\n\tprint a\n\tdel a\n\n\t\narray('l')\narray('c', 'hello world')\narray('u', u'hello \\u2641')\narray('l', [1, 2, 3, 4, 5])\narray('d', [1.0, 2.0, 3.1400000000000001])\n>>>\n","language":"Python"},{"code":"x=numeric(10) # allocate a numeric vector of size 10 to x\nrm(x) # remove x\n\nx=vector(\"list\",10) #allocate a list of length 10\nx=vector(\"numeric\",10) #same as x=numeric(10), space allocated to list vector above now freed\nrm(x) # remove x\n","language":"R"},{"code":"#lang racket\n(collect-garbage) ; This function forces a garbage collection\n\n(current-memory-use) ;Gives an estimate on the memory use based on the last garbage collection\n\n(custodian-require-memory <limit-custodian>\n <amount>\n <stop-custodian>) ; Registers a check on required memory for the <limit-custodian>\n ; If amount of bytes can't be reached, <stop-custodian> is shutdown\n\n(custodian-limit-memory <custodian> <amount>) ; Register a limit on memory for the <custodian>\n","language":"Racket"},{"code":"my $buffer = Buf.new(0 xx 1024);\n","language":"Raku"},{"code":"display total memory available\n\n~~~\nEOM n:put\n~~~\n\ndisplay unused memory\n\n~~~\nEOM here - n:put\n~~~\n\ndisplay next free address\n\n~~~\nhere n:put\n~~~\n\nallocate 1000 cells\n\n~~~\n#1000 allot\n~~~\n\nfree 500 cells\n\n~~~\n#-500 allot\n~~~\n","language":"Retro"},{"code":"Axtec_god.3='Quetzalcoatl (\"feathered serpent\"), god of learning, civilization, regeneration, wind and storms'\n","language":"REXX"},{"code":"drop xyz NamesRoster j k m caves names. Axtec_god. Hopi Hopi\n\n/* it's not considered an error to DROP a variable that isn't defined.*/\n","language":"REXX"},{"code":"cVar = \" \" # create variable contains string of 5 bytes\ncVar = NULL # destroy the 5 bytes string !\n","language":"Ring"},{"code":"class Thingamajig\n def initialize\n fail 'not yet implemented'\n end\nend\nt = Thingamajig.allocate\n","language":"Ruby"},{"code":"// we have to use `unsafe` here because\n// we will be dereferencing a raw pointer\nunsafe {\n use std::alloc::{Layout, alloc, dealloc};\n // define a layout of a block of memory\n let int_layout = Layout::new::<i32>();\n\n // memory is allocated here\n let ptr = alloc(int_layout);\n\n // let us point to some data\n *ptr = 123;\n assert_eq!(*ptr, 123);\n\n // deallocate `ptr` with associated layout `int_layout`\n dealloc(ptr, int_layout);\n}\n","language":"Rust"},{"code":"PRINT PEEK 16388+256*16389\n","language":"Sinclair-ZX81-BASIC"},{"code":"10 REM ABCDEFGH\n20 LET P$=\"3E03010400814FC9\"\n30 LET ADDR=16514\n40 POKE ADDR,CODE P$*16+CODE P$(2)-476\n50 LET P$=P$(3 TO )\n60 LET ADDR=ADDR+1\n70 IF P$<>\"\" THEN GOTO 40\n80 CLEAR\n90 PRINT USR 16514\n","language":"Sinclair-ZX81-BASIC"},{"code":"3e 03 ld a, 3\n01 04 00 ld bc,0004\n81 add a, c\n4f ld c, a\nc9 ret\n","language":"Sinclair-ZX81-BASIC"},{"code":"10 REM Y▀▀:▖ ▟?TAN\n","language":"Sinclair-ZX81-BASIC"},{"code":"handle := ExternalBytes new:size\n...\nhandle free\n","language":"Smalltalk"},{"code":"handle := ExternalBytes unprotectedNew:size\n...\nhandle := nil \"or no longer reachable\"\n...\nmemory will be freed by the garbage collector eventually\n","language":"Smalltalk"},{"code":" newstring = \"This is creating and saving\" \" a new single string \" \"starting with three separate strings.\"\n","language":"SNOBOL4"},{"code":" newarray = array(100)\n","language":"SNOBOL4"},{"code":" newtable = table()\n","language":"SNOBOL4"},{"code":" data(\"listnode(next,prev,datafield1,datafield2)\")\n","language":"SNOBOL4"},{"code":" newnode = listnode(,,\"string data value1\",17)\n","language":"SNOBOL4"},{"code":" datafield1(newnode) = \"updated data value 1\"\n","language":"SNOBOL4"},{"code":" newnode =\n","language":"SNOBOL4"},{"code":" collect()\n","language":"SNOBOL4"},{"code":"#include <tcl.h>\n\n/* A data structure used to enforce data safety */\nstruct block {\n int size;\n unsigned char data[4];\n};\n\nstatic int\nMemalloc(\n ClientData clientData,\n Tcl_Interp *interp,\n int objc, Tcl_Obj *const *objv)\n{\n Tcl_HashTable *nameMap = clientData;\n static int nameCounter = 0;\n char nameBuf[30];\n Tcl_HashEntry *hPtr;\n int size, dummy;\n struct block *blockPtr;\n\n /* Parse arguments */\n if (objc != 2) {\n\tTcl_WrongNumArgs(interp, 1, objv, \"size\");\n\treturn TCL_ERROR;\n }\n if (Tcl_GetIntFromObj(interp, objv[1], &size) != TCL_OK) {\n\treturn TCL_ERROR;\n }\n if (size < 1) {\n\tTcl_AppendResult(interp, \"size must be positive\", NULL);\n\treturn TCL_ERROR;\n }\n\n /* The ckalloc() function will panic on failure to allocate. */\n blockPtr = (struct block *)\n\t ckalloc(sizeof(struct block) + (unsigned) (size<4 ? 0 : size-4));\n\n /* Set up block */\n blockPtr->size = size;\n memset(blockPtr->data, 0, blockPtr->size);\n\n /* Give it a name and return the name */\n sprintf(nameBuf, \"block%d\", nameCounter++);\n hPtr = Tcl_CreateHashEntry(nameMap, nameBuf, &dummy);\n Tcl_SetHashValue(hPtr, blockPtr);\n Tcl_SetObjResult(interp, Tcl_NewStringObj(nameBuf, -1));\n return TCL_OK;\n}\n\nstatic int\nMemfree(\n ClientData clientData,\n Tcl_Interp *interp,\n int objc, Tcl_Obj *const *objv)\n{\n Tcl_HashTable *nameMap = clientData;\n Tcl_HashEntry *hPtr;\n struct block *blockPtr;\n\n /* Parse the arguments */\n if (objc != 2) {\n\tTcl_WrongNumArgs(interp, 1, objv, \"handle\");\n\treturn TCL_ERROR;\n }\n hPtr = Tcl_FindHashEntry(nameMap, Tcl_GetString(objv[1]));\n if (hPtr == NULL) {\n\tTcl_AppendResult(interp, \"unknown handle\", NULL);\n\treturn TCL_ERROR;\n }\n blockPtr = Tcl_GetHashValue(hPtr);\n\n /* Squelch the memory */\n Tcl_DeleteHashEntry(hPtr);\n ckfree((char *) blockPtr);\n return TCL_OK;\n}\n\nstatic int\nMemset(\n ClientData clientData,\n Tcl_Interp *interp,\n int objc, Tcl_Obj *const *objv)\n{\n Tcl_HashTable *nameMap = clientData;\n Tcl_HashEntry *hPtr;\n struct block *blockPtr;\n int index, byte;\n\n /* Parse the arguments */\n if (objc != 4) {\n\tTcl_WrongNumArgs(interp, 1, objv, \"handle index byte\");\n\treturn TCL_ERROR;\n }\n hPtr = Tcl_FindHashEntry(nameMap, Tcl_GetString(objv[1]));\n if (hPtr == NULL) {\n\tTcl_AppendResult(interp, \"unknown handle\", NULL);\n\treturn TCL_ERROR;\n }\n blockPtr = Tcl_GetHashValue(hPtr);\n if (Tcl_GetIntFromObj(interp, objv[2], &index) != TCL_OK\n\t || Tcl_GetIntFromObj(interp, objv[3], &byte) != TCL_OK) {\n\treturn TCL_ERROR;\n }\n if (index < 0 || index >= blockPtr->size) {\n\tTcl_AppendResult(interp, \"index out of range\", NULL);\n\treturn TCL_ERROR;\n }\n\n /* Update the byte of the data block */\n blockPtr->data[index] = (unsigned char) byte;\n return TCL_OK;\n}\n\nstatic int\nMemget(\n ClientData clientData,\n Tcl_Interp *interp,\n int objc, Tcl_Obj *const *objv)\n{\n Tcl_HashTable *nameMap = clientData;\n Tcl_HashEntry *hPtr;\n struct block *blockPtr;\n int index, byte;\n\n /* Parse the arguments */\n if (objc != 3) {\n\tTcl_WrongNumArgs(interp, 1, objv, \"handle index\");\n\treturn TCL_ERROR;\n }\n hPtr = Tcl_FindHashEntry(nameMap, Tcl_GetString(objv[1]));\n if (hPtr == NULL) {\n\tTcl_AppendResult(interp, \"unknown handle\", NULL);\n\treturn TCL_ERROR;\n }\n blockPtr = Tcl_GetHashValue(hPtr);\n if (Tcl_GetIntFromObj(interp, objv[2], &index) != TCL_OK) {\n\treturn TCL_ERROR;\n }\n if (index < 0 || index >= blockPtr->size) {\n\tTcl_AppendResult(interp, \"index out of range\", NULL);\n\treturn TCL_ERROR;\n }\n\n /* Read the byte from the data block and return it */\n Tcl_SetObjResult(interp, Tcl_NewIntObj(blockPtr->data[index]));\n return TCL_OK;\n}\n\nstatic int\nMemaddr(\n ClientData clientData,\n Tcl_Interp *interp,\n int objc, Tcl_Obj *const *objv)\n{\n Tcl_HashTable *nameMap = clientData;\n Tcl_HashEntry *hPtr;\n struct block *blockPtr;\n int addr;\n\n /* Parse the arguments */\n if (objc != 2) {\n\tTcl_WrongNumArgs(interp, 1, objv, \"handle\");\n\treturn TCL_ERROR;\n }\n hPtr = Tcl_FindHashEntry(nameMap, Tcl_GetString(objv[1]));\n if (hPtr == NULL) {\n\tTcl_AppendResult(interp, \"unknown handle\", NULL);\n\treturn TCL_ERROR;\n }\n blockPtr = Tcl_GetHashValue(hPtr);\n\n /* This next line is non-portable */\n addr = (int) blockPtr->data;\n Tcl_SetObjResult(interp, Tcl_NewIntObj(addr));\n return TCL_OK;\n}\n\nint\nMemalloc_Init(Tcl_Interp *interp)\n{\n /* Make the hash table */\n Tcl_HashTable *hashPtr = (Tcl_HashTable *) ckalloc(sizeof(Tcl_HashTable));\n Tcl_InitHashTable(hashPtr, TCL_STRING_KEYS);\n\n /* Register the commands */\n Tcl_CreateObjCommand(interp, \"memalloc\", Memalloc, hashPtr, NULL);\n Tcl_CreateObjCommand(interp, \"memfree\", Memfree, hashPtr, NULL);\n Tcl_CreateObjCommand(interp, \"memset\", Memset, hashPtr, NULL);\n Tcl_CreateObjCommand(interp, \"memget\", Memget, hashPtr, NULL);\n Tcl_CreateObjCommand(interp, \"memaddr\", Memaddr, hashPtr, NULL);\n\n /* Register the package */\n return Tcl_PkgProvide(interp, \"memalloc\", \"1.0\");\n}\n","language":"Tcl"},{"code":"package require memalloc\n\nset block [memalloc 1000]\nputs \"allocated $block at [memaddr $block]\"\nmemset $block 42 79\nsomeOtherCommand [memaddr $block]\nputs \"$block\\[42\\] is now [memget $block 42]\"\nmemfree $block\n","language":"Tcl"},{"code":"// create a list with 10 elements all initialized to zero\nvar squares = List.filled(10, 0)\n// give them different values and print them\nfor (i in 0..9) squares[i] = i * i\nSystem.print(squares)\n// add another element to the list dynamically and print it again\nsquares.add(10 * 10)\nSystem.print(squares)\nsquares = null // make eligible for GC\n","language":"Wren"},{"code":"; linux x86_64\n\nstruc block\nfree: resb 1 ; whether or not this block is free\nsize: resb 2 ; size of the chunk of memory\nnext: resb 8 ; the next chunk after this one\nmem:\nendstruc\n\nsection .data\nhStart: dq 0 ; the beginning of our heap space\nbreak: dq 0 ; the current end of our heap space\n\n\nsection .text\n\nAllocate:\n\n push rdi ; save the size argument\n\n cmp qword [break], 0 ; if breakpoint is zero this\n je firstAlloc ; is the first call to allocate\n\n mov rdi, qword [hStart] ; else address of heap start\n\n findBlock: ; look for a suitable block of memory\n\n cmp byte [rdi + free], 2\n je newBlock ; end of heap reached, create new block\n\n cmp byte [rdi + free], 0\n je skipBlock ; this block taken\n\n ; this block is free, make\n ; sure it's big enough\n mov bx, word [rdi + size]\n mov rcx, qword [rsp] ; compare against our size arg\n cmp cx, bx\n jg skipBlock ; keep looking if not big enough\n\n mov byte [rdi + free], 0 ; else mark as taken\n add rdi, mem\n add rsp, 8 ; discard size arg, we didn't need it\n mov rax, rdi ; return pointer to this block\n ret\n\n skipBlock:\n mov rsi, qword [rdi + next] ; load next\n mov rdi, rsi ' block address\n jmp findBlock\n\n newBlock:\n mov rax, rdi\n add rdi, 1024\n cmp rdi, qword [break]\n jl initAndAllocate\n push rax\n mov rdi, qword [break] ; if we are getting low on\n add rdi, 4096 ; heap space, we ask OS for\n mov rax, 12 ; more memory with brk syscall\n syscall\n cmp rax, qword [break] ; if breakpoint has not increased,\n je allocFail ; then memory could not be allocated\n mov qword [break], rax\n pop rax\n jmp initAndAllocate\n\n\n firstAlloc: ; extra work has to be done on first\n mov rax, 12 ; call to this subroutine\n mov rdi, 0\n syscall\n mov qword [hStart], rax ; init heap start\n add rax, 4096\n mov rdi, rax\n mov rax, 12 ; get heap memory with sys brk\n syscall\n cmp rax, qword [hStart]\n je allocFail\n mov qword [break], rax\n mov rax, qword [hStart]\n\n initAndAllocate:\n mov byte [rax + free], 0 ; mark block free\n pop rdi ; pop size arg off stack\n mov word [rax + size], di ; mark it's size\n lea rsi, [rax + mem + rdi]\n mov byte [rsi + free], 2 ; mark heap end block\n mov qword [rax + next], rsi ; mark next block\n add rax, mem ; return pointer to block's memory space\n ret\n\nallocFail: ; exit(1) when allocation fails\n mov rax, 60\n mov rdi, 1\n syscall\n ret\n\n; free this block so it can be\n; reused in a subsequent call to allocate\nRelease:\n sub rdi, mem\n mov byte [rdi + free], 1\n ret\n","language":"X86-Assembly"},{"code":"int Array(10); \\allocates 10 integers (40 bytes) of heap space\nArray2:= Reserve(10*4); \\another way to allocate 10 integers of heap space\nArray3:= MAlloc(4); \\allocate 4 paragraphs (64 bytes) of conventional memory\n...\nRelease(Array3); \\release this memory so it can be used elsewhere\n","language":"XPL0"},{"code":"Data(123); // this bit bucket expects hold 123 bytes\nList.createLong(123); // this list expects to hold 123 elements\n","language":"Zkl"},{"code":"10 REM This code is written for a 48k spectrum\n20 CLEAR 65535 - 8192: REM reserve 8192 bytes of memory\n30 CLEAR 65535: REM unreserve the memory, moving the ramtop back to the top of the ram\n","language":"ZX-Spectrum-Basic"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Memory_allocation\\nnote: Basic language learning\\n\",\n \"language\": \"00-META\"\n },\n {\n \"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 stack|stack]], shared, foreign) if applicable.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"* Request to Get Storage Managed by \\\"GETMAIN\\\" Supervisor Call (SVC 4)\\n LA 1,PLIST Point Reg 1 to GETMAIN/FREEMAIN Parm List\\n SVC 4 Issue GETMAIN SVC\\n LTR 15,15 Register 15 = 0?\\n BZ GOTSTG Yes: Got Storage\\n* [...] No: Handle GETMAIN Failure\\nGOTSTG L 2,STG@ Load Reg (any Reg) with Addr of Aquired Stg\\n* [...] Continue\\n* Request to Free Storage Managed by \\\"FREEMAIN\\\" Supervisor Call (SVC 5)\\n LA 1,PLIST Point Reg 1 to GETMAIN/FREEMAIN Parm List\\n SVC 5 Issue FREEMAIN SVC\\n LTR 15,15 Register 15 = 0?\\n BZ STGFRE Yes: Storage Freed\\n* [...] No: Handle FREEMAIN Failure\\nSTGFRE EQU * Storage Freed\\n* [...] Continue\\n*\\nSTG@ DS A Address of Stg Area (Aquired or to be Freed)\\nPLIST EQU * 10-Byte GETMAIN/FREEMAIN Parameter List\\n DC A(256) Number of Bytes; Max=16777208 ((2**24)-8)\\n DC A(STG@) Pointer to Address of Storage Area\\n DC X'0000' (Unconditional Request; Subpool 0)\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"STOREXNO AMODE 31\\nSTOREXNO RMODE ANY\\nSTOREXNO CSECT ,\\n SYSSTATE AMODE64=NO,ARCHLVL=3 gen z9+, z/OS 2.1+ bin code\\n IEABRCX DEFINE convert based to relative branches\\n BAKR 14,0 callers registers to linkage stack\\n LARL 12,CONSTANTS load address relative long\\n USING CONSTANTS,12 using for constants\\n LA 9,WALEN load memory length in Register 9\\n STORAGE OBTAIN,LENGTH=(9),EXECUTABLE=NO,LOC=ANY\\n LR 10,1 Reg1 holds address of mem area\\n USING DYNAREA,10 using for dynamic memory area\\n LA 13,SAVEA PC routine convention: ...\\n MVC SAVEA+4(4),=C'F1SA' ... format 1 savearea: L-stack\\n*\\n* copy instruction sequence SR Reg15,Reg15; Branch Reg14 to DATA1\\n* in obtained storage location, and branch to it\\n*\\n MVC DATA1(8),=X'1BFF07FE00000000' SR 15,15; BR 14\\n LA 7,DATA1\\n BASR 14,7 This will OC4-4 with EXECUTABLE=NO\\n STORAGE RELEASE,ADDR=(10),LENGTH=(9),EXECUTABLE=NO\\n PR , return to caller\\nCONSTANTS DS 0D constant section, aligned for LARL\\n DC C'SOMEDATA'\\n DC C'SOMEOTHERDATA'\\n LTORG , have assembler build literal pool\\nDYNAREA DSECT\\nSAVEA DS 18F\\nDATA1 DS 2F\\nDATA2 DS CL256 can receive any value\\nWALEN EQU *-DYNAREA length of obtained area\\n END STOREXNO end of module\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"LDA #$FF ;load 255 into the accumulator\\nSTA $00 ;store at zero page memory address $00\\nSTA $0400 ;store at absolute memory address $0400\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"MyFunction:\\nLINK A6,#-16 ;create a stack frame of 16 bytes. Now you can safely write to (SP+0) thru (SP+15).\\n\\n;;;; your code goes here.\\n\\nUNLK A6 ;free the stack frame\\nRTS\\n\",\n \"language\": \"68000-Assembly\"\n },\n {\n \"code\": \"MOVE.L An,-(SP)\\nMOVEA.L SP,An\\nLEA (-disp,SP),SP\\n\",\n \"language\": \"68000-Assembly\"\n },\n {\n \"code\": \"CARD EndProg ;required for ALLOCATE.ACT\\n\\nINCLUDE \\\"D2:ALLOCATE.ACT\\\" ;from the Action! Tool Kit. You must type 'SET EndProg=*' from the monitor after compiling, but before running this program!\\n\\nPROC Main()\\n DEFINE SIZE=\\\"1000\\\"\\n BYTE POINTER ptr\\n\\n AllocInit(EndProg) ;required before any memory allocation\\n\\n ptr=Alloc(SIZE) ;allocate memory of 1000 bytes\\n SetBlock(ptr,SIZE,$FF) ;fill the memory block with $FF\\n Free(ptr,SIZE) ;free allocated memory\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"declare\\n X : Integer; -- Allocated on the stack\\nbegin\\n ...\\nend; -- X is freed\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"declare\\n type Integer_Ptr is access Integer;\\n Ptr : Integer_Ptr := new Integer; -- Allocated in the heap\\nbegin\\n ...\\nend; -- Memory is freed because Integer_Ptr is finalized\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"declare\\n type Integer_Ptr is access Integer;\\n procedure Free is new Ada.Unchecked_Deallocation (Integer, Integer_Ptr)\\n Ptr : Integer_Ptr := new Integer; -- Allocated in the heap\\nbegin\\n Free (Ptr); -- Explicit deallocation\\n ...\\nend;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package P is\\n X : Integer; -- Allocated in the result the package elaboration\\nend P;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"MODE MYSTRUCT = STRUCT(INT i, j, k, REAL r, COMPL c);\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"REF MYSTRUCT l = LOC MYSTRUCT;\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"REF MYSTRUCT h = HEAP MYSTRUCT;\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"[666]MYSTRUCT pool;\\nINT new pool := LWB pool-1;\\nREF MYSTRUCT p = pool[new pool +:=1];\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"MYSTRUCT i;\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin\\n % define a record structure - instances must be created dynamically %\\n record Element ( integer atomicNumber; string(16) name );\\n reference(Element) X;\\n % allocate and initialise memory for X - heap storage is the only option %\\n X := Element( 1, \\\"Hydrogen\\\" );\\n % allocate new memory for X, the original could now be garbage collected %\\n X := Element( 2, \\\"Helium\\\" )\\n % the memory allocated will now be garbage collected - there is no explicit de-allocation %\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"myBlock: @[1 2 3]\\n'myBlock ++ [4 5 6]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"VarSetCapacity(Var, 10240000) ; allocate 10 megabytes\\nVarSetCapacity(Var, 0) ; free it\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"Buff(100)→Str1\\n.Str1 points to a 100-byte memory region allocated at compile time\\n\",\n \"language\": \"Axe\"\n },\n {\n \"code\": \" size% = 12345\\n DIM mem% size%-1\\n PRINT ; size% \\\" bytes of heap allocated at \\\" ; mem%\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \" size% = 12345\\n PROCstack(size%)\\n END\\n\\n DEF PROCstack(s%)\\n LOCAL mem%\\n DIM mem% LOCAL s%-1\\n PRINT ; s% \\\" bytes of stack allocated at \\\" ; mem%\\n ENDPROC\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"( alc$2000:?p {allocate 2000 bytes}\\n& pok$(!p,123456789,4) { poke a large value as a 4 byte integer }\\n& pok$(!p+4,0,4) { poke zeros in the next 4 bytes }\\n& out$(pee$(!p,1)) { peek the first byte }\\n& out$(pee$(!p+2,2)) { peek the short int located at the third and fourth byte }\\n& out$(pee$(!p,4)) { peek the first four bytes }\\n& out$(pee$(!p+6,2)) { peek the two bytes from the zeroed-out range }\\n& out$(pee$(!p+1000,2)) { peek some uninitialized data }\\n& fre$!p { free the memory }\\n&);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdlib.h>\\n\\n/* size of \\\"members\\\", in bytes */\\n#define SIZEOF_MEMB (sizeof(int))\\n#define NMEMB 100\\n\\nint main()\\n{\\n int *ints = malloc(SIZEOF_MEMB*NMEMB);\\n /* realloc can be used to increase or decrease an already\\n allocated memory (same as malloc if ints is NULL) */\\n ints = realloc(ints, sizeof(int)*(NMEMB+1));\\n /* calloc set the memory to 0s */\\n int *int2 = calloc(NMEMB, SIZEOF_MEMB);\\n /* all use the same free */\\n free(ints); free(int2);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"int func()\\n{\\n int ints[NMEMB]; /* it resembles malloc ... */\\n int *int2; /* here the only thing allocated on the stack is a pointer */\\n char intstack[SIZEOF_MEMB*NMEMB]; /* to show resemblance to malloc */\\n int2 = (int *)intstack; /* but this is educative, do not do so unless... */\\n\\n {\\n const char *pointers_to_char[NMEMB];\\n /* use pointers_to_char */\\n pointers_to_char[0] = \\\"educative\\\";\\n } /* outside the block, the variable \\\"disappears\\\" */\\n\\n /* here we can use ints, int2, intstack vars, which are not seen elsewhere of course */\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <alloca.h>\\nint *funcA()\\n{\\n int *ints = alloca(SIZEOF_MEMB*NMEMB);\\n ints[0] = 0; /* use it */\\n return ints; /* BUT THIS IS WRONG! It is not like malloc: the memory\\n does not \\\"survive\\\"! */\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"/* this is global */\\nint integers[NMEMB]; /* should be initialized with 0s */\\n\\nint funcB()\\n{\\n static int ints[NMEMB]; /* this is \\\"static\\\", i.e. the memory \\\"survive\\\" even\\n when the function exits, but the symbol's scope is local */\\n return integers[0] + ints[0];\\n}\\n\\nvoid funcC(int a)\\n{\\n integers[0] = a;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <string>\\n\\nint main()\\n{\\n int* p;\\n\\n p = new int; // allocate a single int, uninitialized\\n delete p; // deallocate it\\n\\n p = new int(2); // allocate a single int, initialized with 2\\n delete p; // deallocate it\\n\\n std::string* p2;\\n\\n p2 = new std::string; // allocate a single string, default-initialized\\n delete p2; // deallocate it\\n\\n p = new int[10]; // allocate an array of 10 ints, uninitialized\\n delete[] p; // deallocation of arrays must use delete[]\\n\\n p2 = new std::string[10]; // allocate an array of 10 strings, default-initialized\\n delete[] p2; // deallocate it\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"int main()\\n{\\n void* memory = operator new(20); // allocate 20 bytes of memory\\n operator delete(memory); // deallocate it\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <new>\\n\\nint main()\\n{\\n union\\n {\\n int alignment_dummy; // make sure the block is correctly aligned for ints\\n char data[2*sizeof(int)]; // enough space for 10 ints\\n };\\n int* p = new(&data) int(3); // construct an int at the beginning of data\\n new(p+1) int(5); // construct another int directly following\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"void* memory_for_p = operator new(sizeof(int));\\nint* p = new(memory_for_p) int(3);\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <new>\\n\\nint* p = new(std::nothrow) int(3);\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <cstddef>\\n#include <cstdlib>\\n#include <new>\\n\\nclass MyClass\\n{\\npublic:\\n void* operator new(std::size_t size)\\n {\\n void* p = std::malloc(size);\\n if (!p) throw std::bad_alloc();\\n return p;\\n }\\n void operator delete(void* p)\\n {\\n free(p);\\n }\\n};\\n\\nint main()\\n{\\n MyClass* p = new MyClass; // uses class specific operator new\\n delete p; // uses class specific operator delete\\n\\n int* p2 = new int; // uses default operator new\\n delete p2; // uses default operator delete\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"class arena { /* ... */ };\\n\\nvoid* operator new(std::size_t size, arena& a)\\n{\\n return arena.alloc(size);\\n}\\n\\nvoid operator delete(void* p, arena& a)\\n{\\n arena.dealloc(p);\\n}\\n\\narena whatever(/* ... */);\\n\\nint* p = new(whatever) int(3); // uses operator new from above to allocate from the arena whatever\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"class MyClass { /*...*/ };\\n\\nint main()\\n{\\n MyClass* p = new(whatever) MyClass; // allocate memory for myclass from arena and construct a MyClass object there\\n // ...\\n p->~MyClass(); // explicitly destruct *p\\n operator delete(p, whatever); // explicitly deallocate the memory\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Runtime.InteropServices;\\n\\npublic unsafe class Program\\n{\\n public static unsafe void HeapMemory()\\n {\\n const int HEAP_ZERO_MEMORY = 0x00000008;\\n const int size = 1000;\\n int ph = GetProcessHeap();\\n void* pointer = HeapAlloc(ph, HEAP_ZERO_MEMORY, size);\\n if (pointer == null)\\n throw new OutOfMemoryException();\\n Console.WriteLine(HeapSize(ph, 0, pointer));\\n HeapFree(ph, 0, pointer);\\n }\\n\\n public static unsafe void StackMemory()\\n {\\n byte* buffer = stackalloc byte[1000];\\n // buffer is automatically discarded when the method returns\\n }\\n public static void Main(string[] args)\\n {\\n HeapMemory();\\n StackMemory();\\n }\\n [DllImport(\\\"kernel32\\\")]\\n static extern void* HeapAlloc(int hHeap, int flags, int size);\\n [DllImport(\\\"kernel32\\\")]\\n static extern bool HeapFree(int hHeap, int flags, void* block);\\n [DllImport(\\\"kernel32\\\")]\\n static extern int GetProcessHeap();\\n [DllImport(\\\"kernel32\\\")]\\n static extern int HeapSize(int hHeap, int flags, void* block);\\n\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \" PROGRAM-ID. memory-allocation.\\n\\n DATA DIVISION.\\n WORKING-STORAGE SECTION.\\n 01 based-data PIC X(20) VALUE \\\"Hello, World!\\\"\\n BASED.\\n\\n PROCEDURE DIVISION.\\n *> INITIALIZED sets the data item to the VALUE.\\n ALLOCATE based-data INITIALIZED\\n DISPLAY based-data\\n FREE based-data\\n\\n GOBACK\\n .\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"(defun show-allocation ()\\n (let ((a (cons 1 2))\\n (b (cons 1 2)))\\n (declare (dynamic-extent b))\\n (list a b)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(show-allocation)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"// D is a system language so its memory management is refined.\\n// D supports thread-local memory on default, global memory, memory\\n// allocated on the stack, the C heap, or the D heap managed by a\\n// garbage collector, both manually and automatically.\\n\\n// This program looks scary because its purpose is to show all the\\n// variety. But lot of this stuff is only for special situations\\n// (like alloca), and it's not necessary in most user code.\\n\\nenum int nInts = 10; // Compile-time constant.\\n\\n// This is thread-local:\\nint[nInts] data1;\\n\\n// This is global:\\n__gshared int[nInts] data2;\\n\\nvoid main() {\\n // Static memory, it's thread-local but its name is usable\\n // only locally:\\n static int[nInts] data3;\\n\\n // Static memory, it's global but its name is usable only locally:\\n __gshared static int[nInts] data4;\\n\\n // ----------------------\\n // D supports the functions that manage memory of the C heap:\\n import core.stdc.stdlib: malloc, calloc, realloc, free, alloca;\\n\\n // Allocates space for some integers on the heap,\\n // the memory is not initialized:\\n auto ptr1 = cast(int*)malloc(nInts * int.sizeof);\\n if (ptr1 == null)\\n return;\\n\\n // Increases the space for one more integer, the new space\\n // is not initialized, but the old space is not modified:\\n ptr1 = cast(int*)realloc(ptr1, (nInts + 1) * int.sizeof);\\n if (ptr1 == null)\\n return;\\n\\n // calloc allocates on the heap and zeros the memory:\\n auto ptr2 = cast(int*)calloc(nInts, int.sizeof);\\n if (ptr2 == null)\\n return;\\n\\n // You can create a slice from a pointer:\\n auto slice1 = ptr2[0 .. nInts];\\n\\n // Frees the memory:\\n free(ptr2);\\n free(ptr1);\\n\\n // ----------------------\\n import core.stdc.stdio: puts;\\n\\n static struct Test {\\n ~this() { puts(\\\"Test destructor\\\"); }\\n }\\n\\n // Memory allocated on the stack:\\n Test[2] array1;\\n\\n {\\n // More memory allocated on the stack:\\n Test[2] array2;\\n // Here array2 is removed from the stack,\\n // and all array2 destructors get called.\\n }\\n puts(\\\"Block end.\\\");\\n\\n // alloca is supported in D. It's similar to malloc but the\\n // memory is allocated on the stack:\\n int* ptr3 = cast(int*)alloca(nInts * int.sizeof);\\n\\n // You can create a slice from the pointer:\\n auto slice2 = ptr3[0 .. nInts];\\n\\n // Do not free the memory allocated with alloca:\\n // free(ptr3);\\n\\n // ----------------------\\n // Allocates a dynamic array on the D heap managed by\\n // the D garbage collector:\\n auto array3 = new int[nInts];\\n\\n // Try to reserve capacity for a dynamic array on the D heap:\\n int[] array4;\\n array4.reserve(nInts);\\n assert(array4.capacity >= nInts);\\n assert(array4.length == 0);\\n\\n // Appends one integer to the dynamic array:\\n array4 ~= 100;\\n\\n // Assume that it is safe to append to this array. Appends made\\n // to this array after calling this function may append in place,\\n // even if the array was a slice of a larger array to begin with:\\n array4.assumeSafeAppend;\\n array4 ~= 200;\\n array4 ~= 300;\\n assert(array4.length == 3);\\n // See here for more info:\\n // http://dlang.org/d-array-article.html\\n\\n\\n // Allocates a struct and a class on the D GC heap:\\n static class Foo { int x; }\\n Test* t = new Test; // This destructor will not be called.\\n Foo f1 = new Foo; // f1 is a class reference.\\n\\n // Optional. Destroys the given object and puts it in\\n // an invalid state:\\n f1.destroy;\\n\\n import std.typecons: scoped;\\n\\n // Allocates a class on the stack, unsafe:\\n auto f3 = scoped!Foo();\\n\\n // ----------------------\\n import core.memory: GC;\\n\\n // Allocates an aligned block from the GC, initialized to zero.\\n // Plus it doesn't scan through this block on collect.\\n auto ptr4 = cast(int*)GC.calloc(nInts * int.sizeof,\\n GC.BlkAttr.NO_SCAN);\\n\\n // No need to test for this, because GC.calloc usually\\n // throws OutOfMemoryError if it can't allocate.\\n // if (ptr4 == null)\\n // exit(1);\\n\\n GC.free(ptr4); // This is optional.\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"? <elib:tables.makeFlexList>.fromType(<type:java.lang.Byte>, 128)\\n# value: [].diverge()\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"2000 malloc (...do stuff..) free\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"STRUCT: foo { a int } { b foo* } ;\\n\\n[\\n foo malloc-struct &free ! gets freed at end of the current with-destructors scope\\n ! do stuff\\n] with-destructors\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"unused . \\\\ memory available for use in dictionary\\nhere . \\\\ current dictionary memory pointer\\n: mem, ( addr len -- ) here over allot swap move ;\\n: s, ( str len -- ) here over char+ allot place align ; \\\\ built-in on some forths\\n: ,\\\" [char] \\\" parse s, ;\\nvariable num\\ncreate array 60 cells allot\\ncreate struct 0 , 10 , char A c, ,\\\" string\\\"\\nunused .\\nhere .\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"marker foo\\n: temp ... ;\\ncreate dummy 300 allot\\n-150 allot \\\\ trim the size of dummy by 150 bytes\\nfoo \\\\ removes foo, temp, and dummy from the list of definitions\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"4096 allocate throw ( addr )\\ndup 4096 erase\\n( addr ) free throw\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"program allocation_test\\n implicit none\\n real, dimension(:), allocatable :: vector\\n real, dimension(:, :), allocatable :: matrix\\n real, pointer :: ptr\\n integer, parameter :: n = 100 ! Size to allocate\\n\\n allocate(vector(n)) ! Allocate a vector\\n allocate(matrix(n, n)) ! Allocate a matrix\\n allocate(ptr) ! Allocate a pointer\\n\\n deallocate(vector) ! Deallocate a vector\\n deallocate(matrix) ! Deallocate a matrix\\n deallocate(ptr) ! Deallocate a pointer\\nend program allocation_test\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Dim As Integer size = 12345\\nDim As Integer mem = size-1\\nPrint size; \\\" bytes of heap allocated at \\\" ; mem\\nClear (mem, , 10)\\nPrint size; \\\" bytes of heap allocated at \\\" ; mem\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"Dim As Integer size = 12345\\nDim As Integer mem = size-1\\n\\nSub Stack(s As Integer)\\n Dim As Integer mem = s-1\\n Print s; \\\" bytes of stack allocated at \\\" ; mem\\nEnd Sub\\n\\nStack(size)\\nPrint size; \\\" bytes of stack allocated at \\\" ; mem\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"func inc(n int) {\\n x := n + 1\\n println(x)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"func inc(n int) *int {\\n x := n + 1\\n return &x\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"type s struct{a, b int}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"&s{}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"new(s)\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"make([]int, 3)\\nmake(map[int]int)\\nmake(chan int)\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Foreign\\n\\nbytealloc :: IO ()\\nbytealloc = do\\n a0 <- mallocBytes 100 -- Allocate 100 bytes\\n free a0 -- Free them again\\n allocaBytes 100 $ \\\\a -> -- Allocate 100 bytes; automatically\\n -- freed when closure finishes\\n poke (a::Ptr Word32) 0\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Foreign\\n\\ntypedalloc :: IO ()\\ntypedalloc = do\\n w <- malloc\\n poke w (100 :: Word32)\\n free w\\n alloca $ \\\\a -> poke a (100 :: Word32)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" t := table() # The table's memory is allocated\\n #... do things with t\\n t := &null # The table's memory can be reclaimed\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \" require 'dll'\\n mema 1000\\n57139856\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"memf 57139856\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"//All of these objects will be deallocated automatically once the program leaves\\n//their scope and there are no more pointers to the objects\\nObject foo = new Object(); //Allocate an Object and a reference to it\\nint[] fooArray = new int[size]; //Allocate all spaces in an array and a reference to it\\nint x = 0; //Allocate an integer and set its value to 0\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"public class Blah{\\n //...other methods/data members...\\n protected void finalize() throws Throwable{\\n //Finalization code here\\n }\\n //...other methods/data members...\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"public class NoFinalize {\\n public static final void main(String[] params) {\\n NoFinalize nf = new NoFinalize();\\n }\\n public NoFinalize() {\\n System.out.println(\\\"created\\\");\\n }\\n @Override\\n protected void finalize() {\\n System.out.println(\\\"finalized\\\");\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"matrix = Array{Float64,2}(100,100)\\nmatrix[31,42] = pi\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nclass MyClass(val myInt: Int) {\\n // in theory this method should be called automatically prior to GC\\n protected fun finalize() {\\n println(\\\"MyClass being finalized...\\\")\\n }\\n}\\n\\nfun myFun() {\\n val mc: MyClass = MyClass(2) // new non-nullable MyClass object allocated on the heap\\n println(mc.myInt)\\n var mc2: MyClass? = MyClass(3) // new nullable MyClass object allocated on the heap\\n println(mc2?.myInt)\\n mc2 = null // allowed as mc2 is nullable\\n println(mc2?.myInt)\\n // 'mc' and 'mc2' both become eligible for garbage collection here as no longer used\\n}\\n\\nfun main(args: Array<String>) {\\n myFun()\\n Thread.sleep(3000) // allow time for GC to execute\\n val i: Int = 4 // new non-nullable Int allocated on stack\\n println(i)\\n var j: Int? = 5 // new nullable Int allocated on heap\\n println(j)\\n j = null // allowed as 'j' is nullable\\n println(j)\\n // 'j' becomes eligible for garbage collection here as no longer used\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"-- Create a ByteArray of 100 Kb (pre-filled with 0 bytes)\\nba = byteArray(102400)\\n\\n-- Lingo uses garbage-collection, so allocated memory is released when no more references exist.\\n-- For the above variable ba, this can be achieved by calling:\\nba = VOID\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"Module Checkit {\\n Buffer Clear Mem1 as Byte*12345\\n Print Len(Mem1)\\n Hex Mem1(0) ' print in Hex address of first element\\n Print Mem1(Len(Mem1)-1)-Mem1(0)+1=12345\\n Buffer Mem1 as Byte*20000 ' redim block\\n Print Mem1(Len(Mem1)-1)-Mem1(0)+1=20000\\n Try {\\n Print Mem1(20000) ' it is an error\\n }\\n Print Error$ ' return message: Buffer Locked, wrong use of pointer\\n}\\nCheckit\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"a := Array( 1 .. 10^6, datatype = integer[1] ):\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"unassign( a ):\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"a := 'a':\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \" A = zeros(1000); \\t% allocates memory for a 1000x1000 double precision matrix.\\n clear A;\\t\\t% deallocates memory\\n\\n b = zeros(1,100000);\\t% pre-allocate memory to improve performance\\n for k=1:100000,\\n\\tb(k) = 5*k*k-3*k+2;\\n end\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"/* Maxima allocates memory dynamically and uses a garbage collector.\\nHere is how to check available memory */\\n\\nroom();\\n 3221/3221 72.3% 2 CONS RATIO COMPLEX STRUCTURE\\n 272/307 61.6% FIXNUM SHORT-FLOAT CHARACTER RANDOM-STATE READTABLE SPICE\\n 226/404 90.8% SYMBOL STREAM\\n 1/2 37.2% PACKAGE\\n 127/373 44.9% ARRAY HASH-TABLE VECTOR BIT-VECTOR PATHNAME CCLOSURE CLOSURE\\n 370/370 49.1% 1 STRING\\n 325/440 8.2% CFUN BIGNUM LONG-FLOAT\\n 31/115 98.9% SFUN GFUN VFUN AFUN CFDATA\\n 1188/1447 contiguous (478 blocks)\\n 11532 hole\\n 5242 5.0% relocatable\\n 4573 pages for cells\\n 22535 total pages\\n 97138 pages available\\n 11399 pages in heap but not gc'd + pages needed for gc marking\\n 131072 maximum pages\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"import native\\n\\n// allocate 26 bytes\\nptr = native.allocate(26)\\n\\n// store the uppercase alphabet\\nfor i in range(0, 25)\\n native.poke(ptr + i, ord(\\\"A\\\") + i)\\nend\\n\\n// output the allocated memory\\nfor i in range(0, 25)\\n print chr(native.peek(ptr + i))\\nend\\n\\n// free the allocated memory\\nnative.free(ptr)\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"# Allocate thread local heap memory\\nvar a = alloc(1000)\\ndealloc(a)\\n\\n# Allocate memory block on shared heap\\nvar b = allocShared(1000)\\ndeallocShared(b)\\n\\n# Allocate and Dellocate a single int on the thread local heap\\nvar p = create(int, sizeof(int)) # allocate memory\\n# create zeroes memory; createU does not.\\necho p[] # 0\\np[] = 123 # assign a value\\necho p[] # 123\\ndiscard resize(p, 0) # deallocate it\\n# p is now invalid. Let's set it to nil\\np = nil # set pointer to nil\\necho isNil(p) # true\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"foo := Object->New(); // allocates an object on the heap\\nfoo_array := Int->New[size]; // allocates an integer array on the heap\\nx := 0; // allocates an integer on the stack\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"core:mem\\\"\\n\\nmain :: proc() {\\n ptr := mem.alloc(1000) // Allocate heap memory\\n mem.free(ptr)\\n}\\n\",\n \"language\": \"Odin\"\n },\n {\n \"code\": \"'ALLOCATING MEMORY FROM DIFFERENT MEMORY SOURCES\\n\\nsys p\\n\\n\\nstatic byte b[0x1000] 'global memory\\np=@b\\n\\n\\nfunction f()\\nlocal byte b[0x1000] 'stack memory in a procedure\\np=@b\\nend function\\n\\n\\np=getmemory 0x1000 'heap memory\\n...\\nfreememory p 'to disallocate\\n\\n\\nsub rsp,0x1000 'stack memory direct\\np=rsp\\n...\\nrsp=p 'to disallocate\\n\\n\\n'Named Memory shared between processes is\\n'also available using the Windows API (kernel32.dll)\\n'see MSDN:\\n'CreateFileMapping\\n'OpenFileMapping\\n'MapViewOfFile\\n'UnmapViewOfFile\\n'CloseHandle\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"allocatemem(100<<20)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"type\\n TByteArray = array of byte;\\nvar\\n A: TByteArray;\\nbegin\\n setLength(A,1000);\\n...\\n setLength(A,0);\\nend;\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"type\\n Tcl = class\\n dummy: longint;\\n end;\\nvar\\n c1: cl;\\nbegin\\n c1:=Tcl.create;\\n...\\n c1.destroy;\\nend;\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">addr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">allocate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">512</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- limit is 1,610,612,728 bytes on 32-bit systems</span>\\n <span style=\\\"color: #0000FF;\\\">...</span>\\n <span style=\\\"color: #7060A8;\\\">free</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">addr</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">addr2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">allocate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">512</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- automatically freed when addr2 drops out of scope or re-assigned</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">addr3</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">allocate_string</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"a string\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- automatically freed when addr3 drops out of scope or re-assigned</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \" mainproc: proc options(main) reorder;\\n\\n subproc: proc;\\n dcl subvar char init ('X');\\n\\n put skip data(subvar);\\n subvar = 'Q';\\n end subproc;\\n\\n call subproc();\\n call subproc();\\n end mainproc;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \" mainproc: proc options(main) reorder;\\n dcl ctlvar char ctl;\\n\\n alloc ctlvar;\\n ctlvar = 'A';\\n alloc ctlvar;\\n ctlvar = 'B';\\n alloc ctlvar;\\n ctlvar = 'C';\\n\\n put skip data(ctlvar);\\n free ctlvar;\\n put skip data(ctlvar);\\n free ctlvar;\\n put skip data(ctlvar);\\n free ctlvar;\\n end mainproc;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \" mainproc: proc options(main) reorder;\\n dcl list_ptr ptr init (sysnull());\\n dcl list_top ptr init (sysnull());\\n dcl list_end ptr init (addr(list_top));\\n dcl i fixed bin (31);\\n\\n dcl 1 list based(list_ptr),\\n 2 list_nxt ptr init (sysnull()),\\n 2 list_data fixed bin (31) init (i);\\n\\n /*\\n * Allocate the list\\n */\\n do i = 1 to 4;\\n alloc list;\\n list_end -> list_nxt = list_ptr;\\n list_end = list_ptr;\\n end;\\n\\n /*\\n * Print the list\\n */\\n do list_ptr = list_top repeat list_nxt\\n while(list_ptr ^= sysnull());\\n put skip list(list_data);\\n end;\\n end mainprog;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"*buffer=AllocateMemory(20)\\n\\n*newBuffer = ReAllocateMemory(*buffer, 2000) ;increase size of buffer\\n;*buffer value is still valid if newBuffer wasn't able to be reallocated\\nIf *newBuffer <> 0\\n *buffer = *newBuffer : *newBuffer = 0\\nEndIf\\n\\nFreeMemory(*buffer)\\n\\n\\nsize=20\\n; allocate an image for use with image functions\\nCreateImage(1,size,size)\\nFreeImage(1)\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \">>> from array import array\\n>>> argslist = [('l', []), ('c', 'hello world'), ('u', u'hello \\\\u2641'),\\n\\t('l', [1, 2, 3, 4, 5]), ('d', [1.0, 2.0, 3.14])]\\n>>> for typecode, initializer in argslist:\\n\\ta = array(typecode, initializer)\\n\\tprint a\\n\\tdel a\\n\\n\\t\\narray('l')\\narray('c', 'hello world')\\narray('u', u'hello \\\\u2641')\\narray('l', [1, 2, 3, 4, 5])\\narray('d', [1.0, 2.0, 3.1400000000000001])\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"x=numeric(10) # allocate a numeric vector of size 10 to x\\nrm(x) # remove x\\n\\nx=vector(\\\"list\\\",10) #allocate a list of length 10\\nx=vector(\\\"numeric\\\",10) #same as x=numeric(10), space allocated to list vector above now freed\\nrm(x) # remove x\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(collect-garbage) ; This function forces a garbage collection\\n\\n(current-memory-use) ;Gives an estimate on the memory use based on the last garbage collection\\n\\n(custodian-require-memory <limit-custodian>\\n <amount>\\n <stop-custodian>) ; Registers a check on required memory for the <limit-custodian>\\n ; If amount of bytes can't be reached, <stop-custodian> is shutdown\\n\\n(custodian-limit-memory <custodian> <amount>) ; Register a limit on memory for the <custodian>\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my $buffer = Buf.new(0 xx 1024);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"display total memory available\\n\\n~~~\\nEOM n:put\\n~~~\\n\\ndisplay unused memory\\n\\n~~~\\nEOM here - n:put\\n~~~\\n\\ndisplay next free address\\n\\n~~~\\nhere n:put\\n~~~\\n\\nallocate 1000 cells\\n\\n~~~\\n#1000 allot\\n~~~\\n\\nfree 500 cells\\n\\n~~~\\n#-500 allot\\n~~~\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"Axtec_god.3='Quetzalcoatl (\\\"feathered serpent\\\"), god of learning, civilization, regeneration, wind and storms'\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"drop xyz NamesRoster j k m caves names. Axtec_god. Hopi Hopi\\n\\n/* it's not considered an error to DROP a variable that isn't defined.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"cVar = \\\" \\\" # create variable contains string of 5 bytes\\ncVar = NULL # destroy the 5 bytes string !\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"class Thingamajig\\n def initialize\\n fail 'not yet implemented'\\n end\\nend\\nt = Thingamajig.allocate\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"// we have to use `unsafe` here because\\n// we will be dereferencing a raw pointer\\nunsafe {\\n use std::alloc::{Layout, alloc, dealloc};\\n // define a layout of a block of memory\\n let int_layout = Layout::new::<i32>();\\n\\n // memory is allocated here\\n let ptr = alloc(int_layout);\\n\\n // let us point to some data\\n *ptr = 123;\\n assert_eq!(*ptr, 123);\\n\\n // deallocate `ptr` with associated layout `int_layout`\\n dealloc(ptr, int_layout);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"PRINT PEEK 16388+256*16389\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"10 REM ABCDEFGH\\n20 LET P$=\\\"3E03010400814FC9\\\"\\n30 LET ADDR=16514\\n40 POKE ADDR,CODE P$*16+CODE P$(2)-476\\n50 LET P$=P$(3 TO )\\n60 LET ADDR=ADDR+1\\n70 IF P$<>\\\"\\\" THEN GOTO 40\\n80 CLEAR\\n90 PRINT USR 16514\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"3e 03 ld a, 3\\n01 04 00 ld bc,0004\\n81 add a, c\\n4f ld c, a\\nc9 ret\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"10 REM Y▀▀:▖ ▟?TAN\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"handle := ExternalBytes new:size\\n...\\nhandle free\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"handle := ExternalBytes unprotectedNew:size\\n...\\nhandle := nil \\\"or no longer reachable\\\"\\n...\\nmemory will be freed by the garbage collector eventually\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \" newstring = \\\"This is creating and saving\\\" \\\" a new single string \\\" \\\"starting with three separate strings.\\\"\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \" newarray = array(100)\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \" newtable = table()\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \" data(\\\"listnode(next,prev,datafield1,datafield2)\\\")\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \" newnode = listnode(,,\\\"string data value1\\\",17)\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \" datafield1(newnode) = \\\"updated data value 1\\\"\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \" newnode =\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \" collect()\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"#include <tcl.h>\\n\\n/* A data structure used to enforce data safety */\\nstruct block {\\n int size;\\n unsigned char data[4];\\n};\\n\\nstatic int\\nMemalloc(\\n ClientData clientData,\\n Tcl_Interp *interp,\\n int objc, Tcl_Obj *const *objv)\\n{\\n Tcl_HashTable *nameMap = clientData;\\n static int nameCounter = 0;\\n char nameBuf[30];\\n Tcl_HashEntry *hPtr;\\n int size, dummy;\\n struct block *blockPtr;\\n\\n /* Parse arguments */\\n if (objc != 2) {\\n\\tTcl_WrongNumArgs(interp, 1, objv, \\\"size\\\");\\n\\treturn TCL_ERROR;\\n }\\n if (Tcl_GetIntFromObj(interp, objv[1], &size) != TCL_OK) {\\n\\treturn TCL_ERROR;\\n }\\n if (size < 1) {\\n\\tTcl_AppendResult(interp, \\\"size must be positive\\\", NULL);\\n\\treturn TCL_ERROR;\\n }\\n\\n /* The ckalloc() function will panic on failure to allocate. */\\n blockPtr = (struct block *)\\n\\t ckalloc(sizeof(struct block) + (unsigned) (size<4 ? 0 : size-4));\\n\\n /* Set up block */\\n blockPtr->size = size;\\n memset(blockPtr->data, 0, blockPtr->size);\\n\\n /* Give it a name and return the name */\\n sprintf(nameBuf, \\\"block%d\\\", nameCounter++);\\n hPtr = Tcl_CreateHashEntry(nameMap, nameBuf, &dummy);\\n Tcl_SetHashValue(hPtr, blockPtr);\\n Tcl_SetObjResult(interp, Tcl_NewStringObj(nameBuf, -1));\\n return TCL_OK;\\n}\\n\\nstatic int\\nMemfree(\\n ClientData clientData,\\n Tcl_Interp *interp,\\n int objc, Tcl_Obj *const *objv)\\n{\\n Tcl_HashTable *nameMap = clientData;\\n Tcl_HashEntry *hPtr;\\n struct block *blockPtr;\\n\\n /* Parse the arguments */\\n if (objc != 2) {\\n\\tTcl_WrongNumArgs(interp, 1, objv, \\\"handle\\\");\\n\\treturn TCL_ERROR;\\n }\\n hPtr = Tcl_FindHashEntry(nameMap, Tcl_GetString(objv[1]));\\n if (hPtr == NULL) {\\n\\tTcl_AppendResult(interp, \\\"unknown handle\\\", NULL);\\n\\treturn TCL_ERROR;\\n }\\n blockPtr = Tcl_GetHashValue(hPtr);\\n\\n /* Squelch the memory */\\n Tcl_DeleteHashEntry(hPtr);\\n ckfree((char *) blockPtr);\\n return TCL_OK;\\n}\\n\\nstatic int\\nMemset(\\n ClientData clientData,\\n Tcl_Interp *interp,\\n int objc, Tcl_Obj *const *objv)\\n{\\n Tcl_HashTable *nameMap = clientData;\\n Tcl_HashEntry *hPtr;\\n struct block *blockPtr;\\n int index, byte;\\n\\n /* Parse the arguments */\\n if (objc != 4) {\\n\\tTcl_WrongNumArgs(interp, 1, objv, \\\"handle index byte\\\");\\n\\treturn TCL_ERROR;\\n }\\n hPtr = Tcl_FindHashEntry(nameMap, Tcl_GetString(objv[1]));\\n if (hPtr == NULL) {\\n\\tTcl_AppendResult(interp, \\\"unknown handle\\\", NULL);\\n\\treturn TCL_ERROR;\\n }\\n blockPtr = Tcl_GetHashValue(hPtr);\\n if (Tcl_GetIntFromObj(interp, objv[2], &index) != TCL_OK\\n\\t || Tcl_GetIntFromObj(interp, objv[3], &byte) != TCL_OK) {\\n\\treturn TCL_ERROR;\\n }\\n if (index < 0 || index >= blockPtr->size) {\\n\\tTcl_AppendResult(interp, \\\"index out of range\\\", NULL);\\n\\treturn TCL_ERROR;\\n }\\n\\n /* Update the byte of the data block */\\n blockPtr->data[index] = (unsigned char) byte;\\n return TCL_OK;\\n}\\n\\nstatic int\\nMemget(\\n ClientData clientData,\\n Tcl_Interp *interp,\\n int objc, Tcl_Obj *const *objv)\\n{\\n Tcl_HashTable *nameMap = clientData;\\n Tcl_HashEntry *hPtr;\\n struct block *blockPtr;\\n int index, byte;\\n\\n /* Parse the arguments */\\n if (objc != 3) {\\n\\tTcl_WrongNumArgs(interp, 1, objv, \\\"handle index\\\");\\n\\treturn TCL_ERROR;\\n }\\n hPtr = Tcl_FindHashEntry(nameMap, Tcl_GetString(objv[1]));\\n if (hPtr == NULL) {\\n\\tTcl_AppendResult(interp, \\\"unknown handle\\\", NULL);\\n\\treturn TCL_ERROR;\\n }\\n blockPtr = Tcl_GetHashValue(hPtr);\\n if (Tcl_GetIntFromObj(interp, objv[2], &index) != TCL_OK) {\\n\\treturn TCL_ERROR;\\n }\\n if (index < 0 || index >= blockPtr->size) {\\n\\tTcl_AppendResult(interp, \\\"index out of range\\\", NULL);\\n\\treturn TCL_ERROR;\\n }\\n\\n /* Read the byte from the data block and return it */\\n Tcl_SetObjResult(interp, Tcl_NewIntObj(blockPtr->data[index]));\\n return TCL_OK;\\n}\\n\\nstatic int\\nMemaddr(\\n ClientData clientData,\\n Tcl_Interp *interp,\\n int objc, Tcl_Obj *const *objv)\\n{\\n Tcl_HashTable *nameMap = clientData;\\n Tcl_HashEntry *hPtr;\\n struct block *blockPtr;\\n int addr;\\n\\n /* Parse the arguments */\\n if (objc != 2) {\\n\\tTcl_WrongNumArgs(interp, 1, objv, \\\"handle\\\");\\n\\treturn TCL_ERROR;\\n }\\n hPtr = Tcl_FindHashEntry(nameMap, Tcl_GetString(objv[1]));\\n if (hPtr == NULL) {\\n\\tTcl_AppendResult(interp, \\\"unknown handle\\\", NULL);\\n\\treturn TCL_ERROR;\\n }\\n blockPtr = Tcl_GetHashValue(hPtr);\\n\\n /* This next line is non-portable */\\n addr = (int) blockPtr->data;\\n Tcl_SetObjResult(interp, Tcl_NewIntObj(addr));\\n return TCL_OK;\\n}\\n\\nint\\nMemalloc_Init(Tcl_Interp *interp)\\n{\\n /* Make the hash table */\\n Tcl_HashTable *hashPtr = (Tcl_HashTable *) ckalloc(sizeof(Tcl_HashTable));\\n Tcl_InitHashTable(hashPtr, TCL_STRING_KEYS);\\n\\n /* Register the commands */\\n Tcl_CreateObjCommand(interp, \\\"memalloc\\\", Memalloc, hashPtr, NULL);\\n Tcl_CreateObjCommand(interp, \\\"memfree\\\", Memfree, hashPtr, NULL);\\n Tcl_CreateObjCommand(interp, \\\"memset\\\", Memset, hashPtr, NULL);\\n Tcl_CreateObjCommand(interp, \\\"memget\\\", Memget, hashPtr, NULL);\\n Tcl_CreateObjCommand(interp, \\\"memaddr\\\", Memaddr, hashPtr, NULL);\\n\\n /* Register the package */\\n return Tcl_PkgProvide(interp, \\\"memalloc\\\", \\\"1.0\\\");\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"package require memalloc\\n\\nset block [memalloc 1000]\\nputs \\\"allocated $block at [memaddr $block]\\\"\\nmemset $block 42 79\\nsomeOtherCommand [memaddr $block]\\nputs \\\"$block\\\\[42\\\\] is now [memget $block 42]\\\"\\nmemfree $block\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"// create a list with 10 elements all initialized to zero\\nvar squares = List.filled(10, 0)\\n// give them different values and print them\\nfor (i in 0..9) squares[i] = i * i\\nSystem.print(squares)\\n// add another element to the list dynamically and print it again\\nsquares.add(10 * 10)\\nSystem.print(squares)\\nsquares = null // make eligible for GC\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"; linux x86_64\\n\\nstruc block\\nfree: resb 1 ; whether or not this block is free\\nsize: resb 2 ; size of the chunk of memory\\nnext: resb 8 ; the next chunk after this one\\nmem:\\nendstruc\\n\\nsection .data\\nhStart: dq 0 ; the beginning of our heap space\\nbreak: dq 0 ; the current end of our heap space\\n\\n\\nsection .text\\n\\nAllocate:\\n\\n push rdi ; save the size argument\\n\\n cmp qword [break], 0 ; if breakpoint is zero this\\n je firstAlloc ; is the first call to allocate\\n\\n mov rdi, qword [hStart] ; else address of heap start\\n\\n findBlock: ; look for a suitable block of memory\\n\\n cmp byte [rdi + free], 2\\n je newBlock ; end of heap reached, create new block\\n\\n cmp byte [rdi + free], 0\\n je skipBlock ; this block taken\\n\\n ; this block is free, make\\n ; sure it's big enough\\n mov bx, word [rdi + size]\\n mov rcx, qword [rsp] ; compare against our size arg\\n cmp cx, bx\\n jg skipBlock ; keep looking if not big enough\\n\\n mov byte [rdi + free], 0 ; else mark as taken\\n add rdi, mem\\n add rsp, 8 ; discard size arg, we didn't need it\\n mov rax, rdi ; return pointer to this block\\n ret\\n\\n skipBlock:\\n mov rsi, qword [rdi + next] ; load next\\n mov rdi, rsi ' block address\\n jmp findBlock\\n\\n newBlock:\\n mov rax, rdi\\n add rdi, 1024\\n cmp rdi, qword [break]\\n jl initAndAllocate\\n push rax\\n mov rdi, qword [break] ; if we are getting low on\\n add rdi, 4096 ; heap space, we ask OS for\\n mov rax, 12 ; more memory with brk syscall\\n syscall\\n cmp rax, qword [break] ; if breakpoint has not increased,\\n je allocFail ; then memory could not be allocated\\n mov qword [break], rax\\n pop rax\\n jmp initAndAllocate\\n\\n\\n firstAlloc: ; extra work has to be done on first\\n mov rax, 12 ; call to this subroutine\\n mov rdi, 0\\n syscall\\n mov qword [hStart], rax ; init heap start\\n add rax, 4096\\n mov rdi, rax\\n mov rax, 12 ; get heap memory with sys brk\\n syscall\\n cmp rax, qword [hStart]\\n je allocFail\\n mov qword [break], rax\\n mov rax, qword [hStart]\\n\\n initAndAllocate:\\n mov byte [rax + free], 0 ; mark block free\\n pop rdi ; pop size arg off stack\\n mov word [rax + size], di ; mark it's size\\n lea rsi, [rax + mem + rdi]\\n mov byte [rsi + free], 2 ; mark heap end block\\n mov qword [rax + next], rsi ; mark next block\\n add rax, mem ; return pointer to block's memory space\\n ret\\n\\nallocFail: ; exit(1) when allocation fails\\n mov rax, 60\\n mov rdi, 1\\n syscall\\n ret\\n\\n; free this block so it can be\\n; reused in a subsequent call to allocate\\nRelease:\\n sub rdi, mem\\n mov byte [rdi + free], 1\\n ret\\n\",\n \"language\": \"X86-Assembly\"\n },\n {\n \"code\": \"int Array(10); \\\\allocates 10 integers (40 bytes) of heap space\\nArray2:= Reserve(10*4); \\\\another way to allocate 10 integers of heap space\\nArray3:= MAlloc(4); \\\\allocate 4 paragraphs (64 bytes) of conventional memory\\n...\\nRelease(Array3); \\\\release this memory so it can be used elsewhere\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"Data(123); // this bit bucket expects hold 123 bytes\\nList.createLong(123); // this list expects to hold 123 elements\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"10 REM This code is written for a 48k spectrum\\n20 CLEAR 65535 - 8192: REM reserve 8192 bytes of memory\\n30 CLEAR 65535: REM unreserve the memory, moving the ramtop back to the top of the ram\\n\",\n \"language\": \"ZX-Spectrum-Basic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Memory-allocation"}}},{"rowIdx":482,"cells":{"solutions":{"kind":"list like","value":[{"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 matching the RS-232 Plug Definition. Use the 9-pin definition for brevity.\n Pin Settings for Plug\n (Reverse order for socket.)\n __________________________________________\n 1 2 3 4 5 6 7 8 9 10 11 12 13\n 14 15 16 17 18 19 20 21 22 23 24 25\n _________________\n 1 2 3 4 5\n 6 7 8 9\n 25 pin 9 pin\n 1 - PG Protective ground\n 2 - TD Transmitted data 3\n 3 - RD Received data 2\n 4 - RTS Request to send 7\n 5 - CTS Clear to send 8\n 6 - DSR Data set ready 6\n 7 - SG Signal ground 5\n 8 - CD Carrier detect 1\n 9 - + voltage (testing)\n 10 - - voltage (testing)\n 11 -\n 12 - SCD Secondary CD\n 13 - SCS Secondary CTS\n 14 - STD Secondary TD\n 15 - TC Transmit clock\n 16 - SRD Secondary RD\n 17 - RC Receiver clock\n 18 -\n 19 - SRS Secondary RTS \n 20 - DTR Data terminal ready 4\n 21 - SQD Signal quality detector\n 22 - RI Ring indicator 9\n 23 - DRS Data rate select\n 24 - XTC External clock\n 25 -\n","language":"00-TASK"},{"code":"soft_rs232_lo equ $20 ;%87654321\nsoft_rs232_hi equ $21 ;%-------9\n","language":"6502-Assembly"},{"code":"LDA soft_rs232_lo\nora #%00000100\nsta soft_rs232_lo\n","language":"6502-Assembly"},{"code":"BIT_0 equ $1\nBIT_1 equ $2\nBIT_2 equ $4\nBIT_3 equ $8\nBIT_4 equ $10\nBIT_5 equ $20\nBIT_6 equ $40\nBIT_7 equ $80\n\nBIT_8 equ $100\nBIT_9 equ $200\n\nRS232_9_TD equ BIT_3\nRS232_9_RD equ BIT_2\nRS232_9_RTS equ BIT_7\nRS232_9_CTS equ BIT_8\nRS232_9_DSR equ BIT_6\nRS232_9_SG equ BIT_5\nRS232_9_CD equ BIT_1\n","language":"68000-Assembly"},{"code":"rs232_9pin_port equ $A00000\n;I chose $A00000 arbitrarily as an example, its actual address depends on the wiring.\n\nMOVE.W #RS232_9_CTS,rs232_9pin_port\nMOVE.W #RS232_9_CTS|RS232_9_RD|RS232_9_SG,rs232_9pin_port ;bitwise OR can be used at compile time to combine the labels.\n","language":"68000-Assembly"},{"code":"type Bit is mod 2;\ntype Rs_232_Layout is record\n Carrier_Detect : Bit;\n Received_Data : Bit;\n Transmitted_Data : Bit;\n Data_Terminal_ready : Bit;\n Signal_Ground : Bit;\n Data_Set_Ready : Bit;\n Request_To_Send : Bit;\n Clear_To_Send : Bit;\n Ring_Indicator : Bit;\nend record;\n\nfor Rs_232_Layout use record\n Carrier_Detect at 0 range 0..0;\n Received_Data at 0 range 1..1;\n Transmitted_Data at 0 range 2..2;\n Data_Terminal_Ready at 0 range 3..3;\n Signal_Ground at 0 range 4..4;\n Data_Set_Ready at 0 range 5..5;\n Request_To_Send at 0 range 6..6;\n Clear_To_Send at 0 range 7..7;\n Ring_Indicator at 0 range 8..8;\nend record;\n","language":"Ada"},{"code":"MODE RSTWOTHREETWO = BITS;\nINT ofs = bits width - 9;\nINT\n lwb rs232 = ofs + 1,\n carrier detect = ofs + 1,\n received data = ofs + 2,\n transmitted data = ofs + 3,\n data terminal ready = ofs + 4,\n signal ground = ofs + 5,\n data set ready = ofs + 6,\n request to send = ofs + 7,\n clear to send = ofs + 8,\n ring indicator = ofs + 9,\n upb rs232 = ofs + 9;\n\nRSTWOTHREETWO rs232 bits := 2r10000000; # up to bits width, OR #\nprint((\"received data: \",received data ELEM rs232bits, new line));\n\nrs232 bits := bits pack((FALSE, TRUE, FALSE, FALSE, FALSE, FALSE, FALSE, FALSE, FALSE));\nprint((\"received data: \",received data ELEM rs232bits, new line))\n","language":"ALGOL-68"},{"code":"struct RS232_data\n{\n unsigned carrier_detect : 1;\n unsigned received_data : 1;\n unsigned transmitted_data : 1;\n unsigned data_terminal_ready : 1;\n unsigned signal_ground : 1;\n unsigned data_set_ready : 1;\n unsigned request_to_send : 1;\n unsigned clear_to_send : 1;\n unsigned ring_indicator : 1;\n};\n","language":"C"},{"code":"module controlFieldsInStruct;\n\nimport tango.core.BitArray;\nimport tango.io.Stdout;\nimport tango.text.convert.Integer;\n\nclass RS232Wrapper(int Length = 9)\n{\n static assert(Length == 9 || Length == 25, \"ERROR, wrong type\");\n BitArray ba;\n static uint[char[]] _map;\n\n public:\n\n static if (Length == 9) {\n static this() {\n _map = [ cast(char[])\n \"CD\" : 1, \"RD\" : 2, \"TD\" : 3, \"DTR\" : 4, \"SG\" : 5,\n \"DSR\" : 6, \"RTS\" : 7, \"CTS\" : 8, \"RI\" : 9\n ];\n }\n } else {\n static this() {\n _map = [ cast(char[])\n \"PG\" : 1u, \"TD\" : 2, \"RD\" : 3, \"RTS\" : 4, \"CTS\" : 5,\n \"DSR\" : 6, \"SG\" : 7, \"CD\" : 8, \"+\" : 9, \"-\" : 10,\n \"SCD\" : 12, \"SCS\" : 13, \"STD\" : 14, \"TC\" : 15, \"SRD\" : 16,\n \"RC\" : 17, \"SRS\" : 19, \"DTR\" : 20, \"SQD\" : 21, \"RI\" : 22,\n \"DRS\" : 23, \"XTC\" : 24\n ];\n }\n }\n\n\n this() {\n ba.length = Length;\n }\n\n bool opIndex(uint pos) { return ba[pos]; }\n bool opIndexAssign(bool b, uint pos) { return (ba[pos] = b); }\n bool opIndex(char[] name) {\n assert (name in _map, \"don't know that plug: \" ~ name);\n return opIndex(_map[name]);\n }\n bool opIndexAssign(bool b, char[] name) {\n assert (name in _map, \"don't know that plug: \" ~ name);\n return opIndexAssign(b, _map[name]);\n }\n void opSliceAssign(bool b) { foreach (ref r; ba) r = b; }\n char[] toString() {\n char[] ret = \"[\";\n foreach (name, value; _map)\n ret ~= name ~ \":\" ~ (ba[value]?\"1\":\"0\") ~\", \";\n ret ~= \"]\";\n return ret;\n }\n}\n\nint main(char[][] args)\n{\n auto ba = new RS232Wrapper!(25);\n\n // set all bits\n ba[] = 1;\n ba[\"RD\"] = 0;\n ba[5] = 0;\n\n Stdout (ba).newline;\n\n return 0;\n}\n","language":"D"},{"code":"import std.bitmanip;\n\nstruct RS232_data {\n static if (std.system.endian == std.system.Endian.bigEndian) {\n mixin(bitfields!(bool, \"carrier_detect\", 1,\n bool, \"received_data\", 1,\n bool, \"transmitted_data\", 1,\n bool, \"data_terminal_ready\", 1,\n bool, \"signal_ground\", 1,\n bool, \"data_set_ready\", 1,\n bool, \"request_to_send\", 1,\n bool, \"clear_to_send\", 1,\n bool, \"ring_indicator\", 1,\n bool, \"\", 7));\n } else {\n mixin(bitfields!(bool, \"\", 7,\n bool, \"ring_indicator\", 1,\n bool, \"clear_to_send\", 1,\n bool, \"request_to_send\", 1,\n bool, \"data_set_ready\", 1,\n bool, \"signal_ground\", 1,\n bool, \"data_terminal_ready\", 1,\n bool, \"transmitted_data\", 1,\n bool, \"received_data\", 1,\n bool, \"carrier_detect\", 1));\n }\n\n static assert(RS232_data.sizeof == 2);\n}\n\nvoid main() {}\n","language":"D"},{"code":"{Enumerate pin assignments}\n\ntype TRS232Pins = (rpCarrierDetect, rpReceivedData, rpTransmittedData,\n\t\t rpDataTerminalReady, rpSignalGround, rpDataSetReady,\n\t\t rpRequestToSend, rpClearToSend, rpRingIndicator);\n{Make into a set}\ntype TPinSet = set of TRS232Pins;\n\nvar Pins: TPinSet;\t{Global variable holding a set of pins}\n\nprocedure ShowMemory(Memo: TMemo; Name: string; SetPins: TPinSet);\n{Extract the set data from memory and display it}\nvar S: string;\nvar P: PWord;\nbegin\nP:=@Pins;\nPins:=SetPins;\nS:=Name;\nS:=S+IntToBin(P^, 16, True);\nMemo.Lines.Add(S);\nend;\n\n\n\nprocedure ShowPinsMemory(Memo: TMemo);\nbegin\nShowMemory(Memo,'Empty: ',[]);\nShowMemory(Memo,'Carrier Detect: ',[rpCarrierDetect]);\nShowMemory(Memo,'Received Data: ',[rpReceivedData]);\nShowMemory(Memo,'Transmitted Data: ',[rpTransmittedData]);\nShowMemory(Memo,'Data Terminal Ready:',[rpDataTerminalReady]);\nShowMemory(Memo,'Signal Ground: ',[rpSignalGround]);\nShowMemory(Memo,'Data Set Ready: ',[rpDataSetReady]);\nShowMemory(Memo,'Request To Send: ',[rpRequestToSend]);\nShowMemory(Memo,'Clear To Send: ',[rpClearToSend]);\nShowMemory(Memo,'Ring Indicator: ',[rpRingIndicator]);\nend;\n","language":"Delphi"},{"code":" : masks ( n -- ) 0 do 1 i lshift constant loop ;\n\n 9 masks DCD RxD TxD DTR SG DSR RTS CTS RI\n","language":"Forth"},{"code":" hex\n 3fd constant com1-ctrl\n decimal\n\n : wait-ready\n begin\n com1-ctrl in\n CTS and\n until ;\n : wait-rx\n begin\n com1-ctrl in\n CTS and 0=\n until ;\n\n : send-byte ( b -- ) \\ send assuming N81 (no parity, 8 bits data, 1 bit frame)\n 255 and\n 9 0 do\n RTS com1-ctrl out\n wait-ready\n dup 1 and if TxD else 0 then com1-ctrl out\n wait-rx\n 2/\n loop drop ;\n","language":"Forth"},{"code":" TYPE RS232PIN9\n LOGICAL CARRIER_DETECT\t\t!1\n LOGICAL RECEIVED_DATA\t\t!2\n LOGICAL TRANSMITTED_DATA\t!3\n LOGICAL DATA_TERMINAL_READY\t!4\n LOGICAL SIGNAL_GROUND\t\t!5\n LOGICAL DATA_SET_READY\t\t!6\n LOGICAL REQUEST_TO_SEND\t\t!7\n LOGICAL CLEAR_TO_SEND\t\t!8\n LOGICAL RING_INDICATOR\t\t!9\n END TYPE RS232PIN9\n","language":"Fortran"},{"code":"program rs232(input, output, stdErr);\ntype\n\t{$packEnum 2}{$scopedEnums off}\n\tpin = (carrierDetect, receivedData, transmittedData, dataTerminalReady,\n\t\tsignalGround, dataSetReady, requestToSend, clearToSend, ringIndicator);\n\t{$packSet 2}\n\tpins = set of pin;\nvar\n\tsignal: pins;\n\t// for demonstration purposes, in order to reveal the memory layout\n\tsignalMemoryStructure: word absolute signal;\n\t{$if sizeOf(signal) <> sizeOf(word)} // just as safe-guard\n\t\t{$fatal signal size}\n\t{$endIf}\nbegin\n\tsignal := [];\n\tinclude(signal, signalGround); // equivalent to signal := signal + [signalGround];\n\t// for demonstration purposes: obviously we know this is always `true`\n\tif signalGround in signal then\n\tbegin\n\t\twriteLn(binStr(signalMemoryStructure, bitSizeOf(signal)));\n\tend;\nend.\n","language":"Free-Pascal-Lazarus"},{"code":"' FB 1.05.0 Win64\n\n' using bit fields\nType RS232_Pin9\n carrierDetect : 1 As UByte\n receivedData : 1 As UByte\n transmittedData : 1 As UByte\n dataTerminalReady : 1 As UByte\n signalGround : 1 As UByte\n dataSetReady : 1 As UByte\n requestToSend : 1 As UByte\n clearToSend : 1 As UByte\n ringIndicator : 1 As UByte\nEnd Type\n\nPrint SizeOf(RS232_Pin9) '' 2 bytes\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\ntype rs232p9 uint16\n\nconst (\n\tCD9 rs232p9 = 1 << iota // Carrier detect\n\tRD9 // Received data\n\tTD9 // Transmitted data\n\tDTR9 // Data terminal ready\n\tSG9 // signal ground\n\tDSR9 // Data set ready\n\tRTS9 // Request to send\n\tCTS9 // Clear to send\n\tRI9 // Ring indicator\n)\n\nfunc main() {\n\t// set some nonsense bits just for example\n\tp := RI9 | TD9 | CD9\n\tfmt.Printf(\"Type=%T value=%#04x\\n\", p, p)\n}\n","language":"Go"},{"code":"default=: 0#~#|:'labels comments'=:|:(4 ({.@;:@{. ; }.)]);._2 {{)n\nRD Received data\nTD Transmitted data\nDTR Data terminal ready\nSG Signal ground\nDSR Data set ready\nRTS Request to send\nCTS Clear to send\nRI Ring indicator\n}}\n\nindices=: labels (i. ;: ::]) ]\nndx=: [ {~ [ indices ]\nasgn=: {{ y (x indices m)} x }}\n","language":"J"},{"code":" example=: default NB. new instance\n example ndx 'RI CTS'\n0 0\n example=: example 'RI RTS TD' asgn 1 2 3\n example ndx 'RI CTS'\n1 0\n","language":"J"},{"code":"public final class MemoryLayoutOfDataStructure {\n\n\tpublic static void main(String[] aArgs) {\n\t\tRS232Pins9 plug = new RS232Pins9();\n\t\tSystem.out.println(plug.getPin(\"receivedData\"));\n\t\tplug.setPin(2, Status.ON);\n\t\tSystem.out.println(plug.getPin(\"receivedData\"));\n\t\tplug.setPin(\"signalGround\", Status.ON);\n\t\tplug.displayPinStatus();\n\t}\n\t\n}\n\nenum Status { OFF, ON }\n\t\nfinal class RS232Pins9 {\n\t\n\tpublic Status getPin(int aPinNumber) {\n\t\tfor ( Pin pin : Pin.values() ) {\n\t\t\tif ( pin.pinNumber == aPinNumber ) {\n\t\t\t\treturn pin.status;\n\t\t\t}\n\t\t}\n\t\tthrow new IllegalArgumentException(\"Unknown pin number: \" + aPinNumber);\n\t}\n\t\n\tpublic Status getPin(String aName) {\n\t\tfor ( Pin pin : Pin.values() ) {\n\t\t\tif ( pin.name() == aName ) {\n\t\t\t\treturn pin.status;\n\t\t\t}\n\t\t}\n\t\tthrow new IllegalArgumentException(\"Unknown pin name: \" + aName);\n\t}\n\t\n\tpublic void setPin(int aPinNumber, Status aStatus) {\n\t\tfor ( Pin pin : Pin.values() ) {\n\t\t\tif ( pin.pinNumber == aPinNumber ) {\n\t\t\t\tpin.status = aStatus;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tpublic void setPin(String aName, Status aStatus) {\n\t\tfor ( Pin pin : Pin.values() ) {\n\t\t\tif ( pin.name() == aName ) {\n\t\t\t\tpin.status = aStatus;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tpublic void displayPinStatus() {\n\t\tfor ( Pin pin : Pin.values() ) {\n\t\t\tSystem.out.println(String.format(\"%-29s%s\", pin.name() + \" has status \", pin.status));\n\t\t}\t\t\t\n\t}\n\t\n\tprivate enum Pin {\n\t\t\n\t\tcarrierDetect(1, Status.OFF), receivedData(2, Status.OFF), transmittedData(3, Status.OFF),\n\t\tdataTerminalReady(4, Status.OFF), signalGround(5, Status.OFF), dataSetReady(6, Status.OFF),\n\t\trequestToSend(7, Status.OFF), clearToSend(8, Status.OFF), ringIndicator(9, Status.OFF);\n\t\t\n\t\tprivate Pin(int aPinNumber, Status aStatus) {\n\t\t\tpinNumber = aPinNumber;\n\t\t\tstatus = aStatus;\n\t\t}\n\t\t\n\t\tprivate int pinNumber;\n\t\tprivate Status status;\t\t\n\t\t\n\t}\n\n}\n","language":"Java"},{"code":"mutable struct NinePinSerialPort\n pins::BitArray\n function NinePinSerialPort()\n this = new()\n this.pins = BitArray(9)\n end\nend\n\nconst CD = 1\nconst RD = 2\nconst TD = 3\nconst SG = 5\nconst DSR = 6\nconst RTS = 7\nconst CTS = 8\n\n# Here we test the type's code.\nport = NinePinSerialPort()\nprintln(\"Port is now at defaults, which are $port\")\nport[CTS] = true\nprintln(\"CD pin of port, which is pin $CD, is now $(port[CD])\")\nprintln(\"CTS pin of port, which is pin $CTS, is now $(port[CTS])\")\nprintln(\"port is now: $port\")\n","language":"Julia"},{"code":"// version 1.0.6\n\nconst val OFF = false\nconst val ON = true\n\nfun toOnOff(b: Boolean) = if (b) \"ON\" else \"OFF\"\n\ndata class Rs232Pins9(\n var carrierDetect : Boolean = OFF,\n var receivedData : Boolean = OFF,\n var transmittedData : Boolean = OFF,\n var dataTerminalReady : Boolean = OFF,\n var signalGround : Boolean = OFF,\n var dataSetReady : Boolean = OFF,\n var requestToSend : Boolean = OFF,\n var clearToSend : Boolean = OFF,\n var ringIndicator : Boolean = OFF\n) {\n fun setPin(n: Int, v: Boolean) {\n when (n) {\n 1 -> carrierDetect = v\n 2 -> receivedData = v\n 3 -> transmittedData = v\n 4 -> dataTerminalReady = v\n 5 -> signalGround = v\n 6 -> dataSetReady = v\n 7 -> requestToSend = v\n 8 -> clearToSend = v\n 9 -> ringIndicator = v\n }\n }\n}\n\nfun main(args: Array<String>) {\n val plug = Rs232Pins9(carrierDetect = ON, receivedData = ON) // set first two pins, say\n println(toOnOff(plug.component2())) // print value of pin 2 by number\n plug.transmittedData = ON // set pin 3 by name\n plug.setPin(4, ON) // set pin 4 by number\n println(toOnOff(plug.component3())) // print value of pin 3 by number\n println(toOnOff(plug.dataTerminalReady)) // print value of pin 4 by name\n println(toOnOff(plug.ringIndicator)) // print value of pin 9 by name\n}\n","language":"Kotlin"},{"code":">> rs232 = struct('carrier_detect', logical(1),...\n'received_data' , logical(1), ...\n'transmitted_data', logical(1),...\n'data_terminal_ready', logical(1),...\n'signal_ground', logical(1),...\n'data_set_ready', logical(1),...\n'request_to_send', logical(1),...\n'clear_to_send', logical(1),...\n'ring_indicator', logical(1))\n\nrs232 =\n\n carrier_detect: 1\n received_data: 1\n transmitted_data: 1\n data_terminal_ready: 1\n signal_ground: 1\n data_set_ready: 1\n request_to_send: 1\n clear_to_send: 1\n ring_indicator: 1\n\n>> struct2cell(rs232)\n\nans =\n\n [1]\n [1]\n [1]\n [1]\n [1]\n [1]\n [1]\n [1]\n [1]\n","language":"MATLAB"},{"code":":- module rs232.\n\n:- interface.\n\n:- import_module bool, io, list, string.\n\n:- type rs232_pin\n ---> carrier_detect\n ; received_data\n ; transmitted_data\n ; data_terminal_ready\n ; signal_ground\n ; data_set_ready\n ; request_to_send\n ; clear_to_send\n ; ring_indicator.\n\n:- type rs232.\n\n:- func rs232_bits = rs232.\n:- func rs232_bits(bool) = rs232.\n\n:- func rs232_set(rs232, rs232_pin) = rs232.\n:- func rs232_clear(rs232, rs232_pin) = rs232.\n\n:- pred rs232_is_set(rs232::in, rs232_pin::in) is semidet.\n:- pred rs232_is_clear(rs232::in, rs232_pin::in) is semidet.\n\n:- func rs232_set_bits(rs232, list(rs232_pin)) = rs232.\n:- func rs232_clear_bits(rs232, list(rs232_pin)) = rs232.\n\n:- func to_string(rs232) = string.\n\n:- pred write_rs232(rs232::in, io::di, io::uo) is det.\n\n:- implementation.\n\n:- import_module bitmap.\n\n:- type rs232 == bitmap.\n\nrs232_bits = rs232_bits(no).\nrs232_bits(Default) = bitmap.init(9, Default).\n\nrs232_set(A, Pin) = unsafe_set(A, to_index(Pin)).\nrs232_clear(A, Pin) = unsafe_clear(A, to_index(Pin)).\n\nrs232_is_set(A, Pin) :- unsafe_is_set(A, to_index(Pin)).\nrs232_is_clear(A, Pin) :- unsafe_is_clear(A, to_index(Pin)).\n\nrs232_set_bits(A, Pins) = foldl((func(Pin, B) = rs232_set(B, Pin)), Pins, A).\nrs232_clear_bits(A, Pins) = foldl((func(Pin, B) = rs232_clear(B, Pin)), Pins, A).\n\nto_string(A) = bitmap.to_string(A).\n\nwrite_rs232(A, !IO) :- write_bitmap(resize(A, 16, no), !IO).\n % cannot write a bitmap that isn't byte-divisible\n\n:- func to_index(rs232_pin) = bit_index.\nto_index(carrier_detect) = 0.\nto_index(received_data) = 1.\nto_index(transmitted_data) = 2.\nto_index(data_terminal_ready) = 3.\nto_index(signal_ground) = 4.\nto_index(data_set_ready) = 5.\nto_index(request_to_send) = 6.\nto_index(clear_to_send) = 7.\nto_index(ring_indicator) = 8.\n\n:- end_module rs232.\n","language":"Mercury"},{"code":":- module rs232_main.\n\n:- interface.\n\n:- import_module io.\n\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\n\n:- import_module bitmap, bool, list, rs232.\n\nmain(!IO) :-\n Com1 = rs232_set_bits(rs232_bits, [data_terminal_ready, data_set_ready]),\n Com2 = rs232_clear_bits(rs232_bits(yes), [data_terminal_ready, data_set_ready]),\n\n write_string(\"Com1 bits = \", !IO),\n write_string(to_string(Com1), !IO), nl(!IO),\n\n write_string(\"Com2 bits = \", !IO),\n write_string(to_string(Com2), !IO), nl(!IO),\n\n write_string(\"Com1 DTR is \", !IO),\n ( if rs232_is_set(Com1, data_terminal_ready) then\n write_string(\"set.\", !IO), nl(!IO)\n else\n write_string(\"clear.\", !IO), nl(!IO)\n ),\n\n write_string(\"Com2 DSR is \", !IO),\n ( if rs232_is_clear(Com2, data_set_ready) then\n write_string(\"clear.\", !IO), nl(!IO)\n else\n write_string(\"set.\", !IO), nl(!IO)\n ).\n\n:- end_module rs232_main.\n","language":"Mercury"},{"code":"type\n rs232Data = enum\n carrierDetect,\n receivedData,\n transmittedData,\n dataTerminalReady,\n signalGround,\n dataSetReady,\n requestToSend,\n clearToSend,\n ringIndicator\n\n# Bit vector of 9 bits\nvar bv = {carrierDetect, signalGround, ringIndicator}\necho cast[uint16](bv) # Conversion of bitvector to 2 bytes for writing\n\nlet readValue: uint16 = 123\nbv = cast[set[rs232Data]](readValue) # Conversion of a read value to bitvector\necho bv\n","language":"Nim"},{"code":"open ExtLib\nclass rs232_data = object\n val d = BitSet.create 9\n\n method carrier_detect = BitSet.is_set d 0\n method received_data = BitSet.is_set d 1\n method transmitted_data = BitSet.is_set d 2\n method data_terminal_ready = BitSet.is_set d 3\n method signal_ground = BitSet.is_set d 4\n method data_set_ready = BitSet.is_set d 5\n method request_to_send = BitSet.is_set d 6\n method clear_to_send = BitSet.is_set d 7\n method ring_indicator = BitSet.is_set d 8\n\n method set_carrier_detect b = (if b then BitSet.set else BitSet.unset) d 0\n method set_received_data b = (if b then BitSet.set else BitSet.unset) d 1\n method set_transmitted_data b = (if b then BitSet.set else BitSet.unset) d 2\n method set_data_terminal_ready b = (if b then BitSet.set else BitSet.unset) d 3\n method set_signal_ground b = (if b then BitSet.set else BitSet.unset) d 4\n method set_data_set_ready b = (if b then BitSet.set else BitSet.unset) d 5\n method set_request_to_send b = (if b then BitSet.set else BitSet.unset) d 6\n method set_clear_to_send b = (if b then BitSet.set else BitSet.unset) d 7\n method set_ring_indicator b = (if b then BitSet.set else BitSet.unset) d 8\nend\n;;\n","language":"OCaml"},{"code":"use Bit::Vector::Minimal qw();\nmy $vec = Bit::Vector::Minimal->new(size => 24);\n\nmy %rs232 = reverse (\n 1 => 'PG Protective ground',\n 2 => 'TD Transmitted data',\n 3 => 'RD Received data',\n 4 => 'RTS Request to send',\n 5 => 'CTS Clear to send',\n 6 => 'DSR Data set ready',\n 7 => 'SG Signal ground',\n 8 => 'CD Carrier detect',\n 9 => '+ voltage (testing)',\n 10 => '- voltage (testing)',\n 12 => 'SCD Secondary CD',\n 13 => 'SCS Secondary CTS',\n 14 => 'STD Secondary TD',\n 15 => 'TC Transmit clock',\n 16 => 'SRD Secondary RD',\n 17 => 'RC Receiver clock',\n 19 => 'SRS Secondary RTS',\n 20 => 'DTR Data terminal ready',\n 21 => 'SQD Signal quality detector',\n 22 => 'RI Ring indicator',\n 23 => 'DRS Data rate select',\n 24 => 'XTC External clock',\n);\n\n$vec->set($rs232{'RD Received data'}, 1);\n$vec->get($rs232{'TC Transmit clock'});\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">CD</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">RD</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">TD</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">DTR</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">...</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">addr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">allocate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- or wherever\n --read</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">bits</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">int_to_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">peek2u</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">addr</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">16</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">dtr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">bits</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">DTR</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000080;font-style:italic;\">--write</span>\n <span style=\"color: #000000;\">bits</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">DTR</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #7060A8;\">poke2</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">addr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">bits_to_int</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">bits</span><span style=\"color: #0000FF;\">))</span>\n<!--\n","language":"Phix"},{"code":"# Define bit constants\n(for (N . Mask) '(CD RD TD DTR SG DSR RTS CTS RI)\n (def Mask (>> (- 1 N) 1)) )\n\n# Test if Clear to send\n(when (bit? CTS Data)\n ... )\n","language":"PicoLisp"},{"code":"declare 1 RS232_layout,\n 2 Carrier_Detect Bit(1),\n 2 Received_Data Bit(1),\n 2 Transmitted_Data Bit(1),\n 2 Data_Terminal_ready Bit(1),\n 2 Signal_Ground Bit(1),\n 2 Data_Set_Ready Bit(1),\n 2 Request_To_Send Bit(1),\n 2 Clear_To_Send Bit(1),\n 2 Ring_Indicator Bit(1);\n","language":"PL-I"},{"code":"from ctypes import Structure, c_int\n\nrs232_9pin = \"_0 CD RD TD DTR SG DSR RTS CTS RI\".split()\nrs232_25pin = ( \"_0 PG TD RD RTS CTS DSR SG CD pos neg\"\n \"_11 SCD SCS STD TC SRD RC\"\n \"_18 SRS DTR SQD RI DRS XTC\" ).split()\n\nclass RS232_9pin(Structure):\n _fields_ = [(__, c_int, 1) for __ in rs232_9pin]\n\n\t\nclass RS232_25pin(Structure):\n _fields_ = [(__, c_int, 1) for __ in rs232_25pin]\n","language":"Python"},{"code":"#lang racket\n\n(require ffi/unsafe)\n\n(define (_autobitmask l)\n (_bitmask (append* (for/list ([x l] [i (in-naturals)]) `(,x = ,(expt 2 i))))))\n\n(define _rs232 (_autobitmask '(CD RD TD DTR SG DSR RTS CTS RI )))\n\n;; Usually it will get used when using foreign functions automatically, but\n;; this demonstrates the conversions explicitly\n(require (only-in '#%foreign ctype-scheme->c ctype-c->scheme))\n((ctype-scheme->c _rs232) '(SG TD RI)) ; -> 276\n((ctype-c->scheme _rs232) 276) ; -> '(TD SG RI)\n","language":"Racket"},{"code":"enum T_RS232 <\n carrier_detect\n received_data\n transmitted_data\n data_terminal_ready\n signal_ground\n data_set_ready\n request_to_send\n clear_to_send\n ring_indicator\n>;\n\nmy bit @signal[T_RS232];\n\n@signal[signal_ground] = 1;\n","language":"Raku"},{"code":"$signal +|= 1 +< signal_ground;\n","language":"Raku"},{"code":"/* REXX ***************************************************************\n* Decode Memory structure of RS-232 Plug Definition\n* Not sure if I understood it completely :-) Open for corrections\n* You never stop learning (as long as you live)\n* 03.08.2012 Walter Pachl\n**********************************************************************/\nCall decode 'ABC'\nCall decode 'XY'\nExit\n\ndecode:\n Parse Arg c\n cb=c2b(c)\n If length(cb)=24 Then Do\n Parse Var cb,\n /* 1 - PG */ Protective ground +1,\n /* 3 2 - TD */ Transmitted_data +1,\n /* 2 3 - RD */ Received_data +1,\n /* 7 4 - RTS */ Request_to_send +1,\n /* 8 5 - CTS */ Clear_to_send +1,\n /* 6 6 - DSR */ Data_set_ready +1,\n /* 5 7 - SG */ Signal_ground +1,\n /* 1 8 - CD */ Carrier_detect +1,\n /* 9 - + */ plus_voltage +1,\n /* 10 - - */ minus_voltage +1,\n /* 11 - */ . +1,\n /* 12 - SCD */ Secondary_CD +1,\n /* 13 - SCS */ Secondary_CTS +1,\n /* 14 - STD */ Secondary_TD +1,\n /* 15 - TC */ Transmit_clock +1,\n /* 16 - SRD */ Secondary_RD +1,\n /* 17 - RC */ Receiver_clock +1,\n /* 18 - */ . +1,\n /* 19 - SRS */ Secondary_RTS +1,\n /* 4 20 - DTR */ Data_terminal_ready +1,\n /* 21 - SQD */ Signal_quality_detector+1,\n /* 9 22 - RI */ Ring_indicator +1,\n /* 23 - DRS */ Data_rate_select +1,\n /* 24 - XTC */ External_clock +1\n Say '24 bins:' cb\n Say ' 1 - PG Protective ground ='Protective ground\n Say ' 2 - TD Transmitted data ='Transmitted_data\n Say ' 3 - RD Received data ='Received_data\n Say ' 4 - RTS Request to send ='Request_to_send\n Say ' 5 - CTS Clear to send ='Clear_to_send\n Say ' 6 - DSR Data set ready ='Data_set_ready\n Say ' 7 - SG Signal ground ='Signal_ground\n Say ' 8 - CD Carrier detect ='Carrier_detect\n Say ' 9 - + plus voltage ='plus_voltage\n Say '10 - - minus voltage ='minus_voltage\n Say ' '\n Say '12 - SCD Secondary CD ='Secondary_CD\n Say '13 - SCS Secondary CTS ='Secondary_CTS\n Say '14 - STD Secondary TD ='Secondary_TD\n Say '15 - TC Transmit clock ='Transmit_clock\n Say '16 - SRD Secondary RD ='Secondary_RD\n Say '17 - RC Receiver clock ='Receiver_clock\n Say ' '\n Say '19 - SRS Secondary RTS ='Secondary_RTS\n Say '20 - DTR Data terminal ready ='Data_terminal_ready\n Say '21 - SQD Signal quality detector ='Signal_quality_detector\n Say '22 - RI Ring indicator ='Ring_indicator\n Say '23 - DRS Data rate select ='Data_rate_select\n Say '24 - XTC External hlock ='External_clock\n End\n Else Do\n Parse Var cb,\n /* 1 8 - CD */ Carrier_detect +1,\n /* 2 3 - RD */ Received_data +1,\n /* 3 2 - TD */ Transmitted_data +1,\n /* 4 20 - DTR */ Data_terminal_ready +1,\n /* 5 7 - SG */ Signal_ground +1,\n /* 6 6 - DSR */ Data_set_ready +1,\n /* 7 4 - RTS */ Request_to_send +1,\n /* 8 5 - CTS */ Clear_to_send +1,\n /* 9 22 - RI */ Ring_indicator +1\n Say ' '\n Say '9-bin:' left(cb,9)\n Say ' 1 CD Carrier detect ='Carrier_detect\n Say ' 2 RD Received data ='Received_data\n Say ' 3 TD Transmitted data ='Transmitted_data\n Say ' 4 DTR Data terminal ready ='Data_terminal_ready\n Say ' 5 SG Signal ground ='Signal_ground\n Say ' 6 DSR Data set ready ='Data_set_ready\n Say ' 7 RTS Request to send ='Request_to_send\n Say ' 8 CTS Clear to send ='Clear_to_send\n Say ' 9 RI Ring indicator ='Ring_indicator\n End\n Return\nc2b: Procedure\n/* REXX ***************************************************************\n* c2b Convert a character string to a bit string\n* 03.08.2012 Walter Pachl\n**********************************************************************/\nParse Arg c\nx=c2x(c)\nres=''\nDo While x<>''\n Parse Var x hb +1 x\n Select\n When hb='0' Then bs='0000'\n When hb='1' Then bs='0001'\n When hb='2' Then bs='0010'\n When hb='3' Then bs='0011'\n When hb='4' Then bs='0100'\n When hb='5' Then bs='0101'\n When hb='6' Then bs='0110'\n When hb='7' Then bs='0111'\n When hb='8' Then bs='1000'\n When hb='9' Then bs='1001'\n When hb='A' Then bs='1010'\n When hb='B' Then bs='1011'\n When hb='C' Then bs='1100'\n When hb='D' Then bs='1101'\n When hb='E' Then bs='1110'\n When hb='F' Then bs='1111'\n End\n res=res||bs\n End\nReturn res\n","language":"REXX"},{"code":"/*REXX program displays which pins are active of a 9 or 24 pin RS-232 plug. */\ncall rs_232 24, 127 /*the value for an RS-232 24 pin plug.*/\ncall rs_232 24, '020304x' /* \" \" \" \" \" \" \" \" */\ncall rs_232 9, '10100000b' /* \" \" \" \" \" 9 \" \" */\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nrs_232: arg ,x; parse arg pins,ox /*X is uppercased when using ARG. */\n @. = '??? unassigned pin' /*assign a default for all the pins. */\n @.24.1 = 'PG protective ground'\n @.24.2 = 'TD transmitted data' ; @.9.3 = @.24.2\n @.24.3 = 'RD received data' ; @.9.2 = @.24.3\n @.24.4 = 'RTS request to send' ; @.9.7 = @.24.4\n @.24.5 = 'CTS clear to send' ; @.9.8 = @.24.5\n @.24.6 = 'DSR data set ready' ; @.9.6 = @.24.6\n @.24.7 = 'SG signal ground' ; @.9.5 = @.24.7\n @.24.8 = 'CD carrier detect' ; @.9.1 = @.24.8\n @.24.9 = '+ positive voltage'\n @.24.10 = '- negative voltage'\n @.24.12 = 'SCD secondary CD'\n @.24.13 = 'SCS secondary CTS'\n @.24.14 = 'STD secondary td'\n @.24.15 = 'TC transmit clock'\n @.24.16 = 'SRD secondary RD'\n @.24.17 = 'RC receiver clock'\n @.24.19 = 'SRS secondary RTS'\n @.24.20 = 'DTR data terminal ready' ; @.9.4 = @.24.20\n @.24.21 = 'SQD signal quality detector'\n @.24.22 = 'RI ring indicator' ; @.9.9 = @.24.22\n @.24.23 = 'DRS data rate select'\n @.24.24 = 'XTC external clock'\n\n select\n when right(x, 1)=='B' then bits= strip(x, 'T', \"B\")\n when right(x, 1)=='X' then bits=x2b(strip(x, 'T', \"X\"))\n otherwise bits=x2b( d2x(x) )\n end /*select*/\n say\n bits=right(bits, pins, 0) /*right justify pin readings (values). */\n say '───────── For a' pins \"pin RS─232 plug, with a reading of: \" ox\n say\n do j=1 for pins; z=substr(bits, j, 1); if z==0 then iterate\n say right(j, 5) 'pin is \"on\": ' @.pins.j\n end /*j*/\n return\n","language":"REXX"},{"code":"require 'bit-struct'\n\nclass RS232_9 < BitStruct\n unsigned :cd, 1, \"Carrier detect\" #1\n unsigned :rd, 1, \"Received data\" #2\n unsigned :td, 1, \"Transmitted data\" #3\n unsigned :dtr, 1, \"Data terminal ready\" #4\n unsigned :sg, 1, \"Signal ground\" #5\n unsigned :dsr, 1, \"Data set ready\" #6\n unsigned :rts, 1, \"Request to send\" #7\n unsigned :cts, 1, \"Clear to send\" #8\n unsigned :ri, 1, \"Ring indicator\" #9\n\n def self.new_with_int(value)\n data = {}\n fields.each_with_index {|f, i| data[f.name] = value[i]}\n new(data)\n end\nend\n\nnum = rand(2**9 - 1)\nputs \"num = #{num}\"\n\nsample1 = RS232_9.new([(\"%09d\" % num.to_s(2)).reverse].pack(\"B*\"))\nputs sample1.inspect_detailed\n\nsample2 = RS232_9.new_with_int(num)\nputs sample2.inspect_detailed\n\nputs \"CD is #{sample2.cd == 1 ? 'on' : 'off'}\"\n","language":"Ruby"},{"code":"object Rs232Pins9 extends App {\n\n val (off: Boolean, on: Boolean) = (false, true)\n val plug = new Rs232Pins9(carrierDetect = on, receivedData = on) // set first two pins, say\n\n def toOnOff(b: Boolean) = if (b) \"on\" else \"off\"\n\n class Rs232Pins9(\n var carrierDetect: Boolean = off,\n var receivedData: Boolean = off,\n var transmittedData: Boolean = off,\n var dataTerminalReady: Boolean = off,\n var signalGround: Boolean = off,\n var dataSetReady: Boolean = off,\n var requestToSend: Boolean = off,\n var clearToSend: Boolean = off,\n var ringIndicator: Boolean = off\n ) {\n def setPin(n: Int, v: Boolean) {\n (n) match {\n case 1 => carrierDetect = v\n case 2 => receivedData = v\n case 3 => transmittedData = v\n case 4 => dataTerminalReady = v\n case 5 => signalGround = v\n case 6 => dataSetReady = v\n case 7 => requestToSend = v\n case 8 => clearToSend = v\n case 9 => ringIndicator = v\n }\n }\n }\n\n // println(toOnOff(plug.component2())) // print value of pin 2 by number\n plug.transmittedData = on // set pin 3 by name\n plug.setPin(4, on) // set pin 4 by number\n // println(toOnOff(plug.component3())) // print value of pin 3 by number\n println(toOnOff(plug.dataTerminalReady)) // print value of pin 4 by name\n println(toOnOff(plug.ringIndicator)) // print value of pin 9 by name\n}\n","language":"Scala"},{"code":"set rs232_bits {CD RD TD DTR SG DSR RTS CTS RI}\n\nproc rs232_encode args {\n set res 0\n foreach arg $args {\n set pos [lsearch $::rs232_bits $arg]\n if {$pos >=0} {set res [expr {$res | 1<<$pos}]}\n }\n return $res\n}\nproc rs232_decode int {\n set res {}\n set i -1\n foreach bit $::rs232_bits {\n incr i\n if {$int & 1<<$i} {lappend res $bit}\n }\n return $res\n}\n#------------------------------ Test suite\nforeach {test => expected} {\n {rs232_encode CD} -> 1\n {rs232_decode 1} -> CD\n {rs232_encode CD RD TD} -> 7\n {rs232_decode 7} -> {CD RD TD}\n} {\n catch $test res\n if {$res ne $expected} {puts \"$test -> $res, expected $expected\"}\n}\n","language":"Tcl"},{"code":"import \"./seq\" for Lst\nimport \"./fmt\" for Fmt\n\nvar ON = true\nvar OFF = false\n\n// Converts \"ON\"/\"OFF\" string to true/false.\nvar AsBool = Fn.new { |s| s == \"ON\" }\n\nclass RS232_9 {\n static names { [\"CD\", \"RD\", \"TD\", \"DTR\", \"SG\", \"DSR\", \"RTS\", \"CTS\", \"RI\"] }\n\n construct new() { _settings = [OFF] * 9 } // all pins OFF\n\n // get pin setting as an ON/OFF string by pin name or number; returns null if invalid\n [p] {\n if (p is String) {\n var ix = Lst.indexOf(RS232_9.names, p)\n return (ix >= 0 && ix < 9) ? (_settings[ix] ? \"ON\" : \"OFF\") : null\n }\n if (p is Num) {\n return (p.isInteger && p >= 1 && p <= 9) ? (_settings[p-1] ? \"ON\" : \"OFF\") : null\n }\n return null\n }\n\n // set pin by pin name or number; does nothing if invalid\n [p] = (v) {\n if (v.type == String && (v == \"ON\" || v == \"OFF\")) v = AsBool.call(v)\n if (v.type != Bool) return\n if (p is String) {\n var ix = Lst.indexOf(RS232_9.names, p)\n if (ix >= 0 && ix < 9) _settings[ix] = v\n }\n if (p is Num && p.isInteger && p >= 1 && p <= 9) _settings[p-1] = v\n }\n\n // prints all pin settings\n toString { (1..9).map { |i| \"%(i) %(Fmt.s(-3, RS232_9.names[i-1])) = %(this[i])\" }.join(\"\\n\") }\n}\n\nvar plug = RS232_9.new()\nplug[\"CD\"] = ON // set pin 1 by name\nplug[3] = ON // set pin 3 by number\nplug[\"DSR\"] = \"ON\" // set pin 6 by name and using a string\nSystem.print(plug) // print the state of the pins\n","language":"Wren"},{"code":"Assuming RS-232 pin 1 is connected to bit 0 of an I/O port et cetera, the\nbits can be assigned names, such as these:\n\ndef CD=1<<0, RD=1<<1, TD=1<<2, DTR=1<<3, DSR=1<<4, RTS=1<<5, CTS=1<<6, RI=1<<7;\ndef RS232=$10;\n\nThe 'port' command can then be used to access these pin signals by name like this:\nport(RS232):= TD ! RTS;\nif port(RS232) & RD then ...\n\nNote: The 'port' command is implemented in the Intel x86 versions but not\nin the Raspberry Pi or Windows (EXPL32) versions.\n]\n","language":"XPL0"},{"code":"softRS232_LO equ &C000 ;%87654321 (each bit represents the state of a numbered pin)\nsoftRS232_HI equ &C001 ;%-------9\n\nld hl,softRS232_LO ;memory location of soft RS232 port\nld c,&00 ;&00 = the port that the RS232 is connected to.\n ;This is just an example, the actual port number depends on where the hardware is connected.\n\nouti ;send the value contained in softRS232_LO thru port &00\nouti ;send the value contained in softRS232_HI thru port &00\n","language":"Z80-Assembly"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Memory_layout_of_a_data_structure\\n\",\n \"language\": \"00-META\"\n },\n {\n \"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 matching the RS-232 Plug Definition. Use the 9-pin definition for brevity.\\n Pin Settings for Plug\\n (Reverse order for socket.)\\n __________________________________________\\n 1 2 3 4 5 6 7 8 9 10 11 12 13\\n 14 15 16 17 18 19 20 21 22 23 24 25\\n _________________\\n 1 2 3 4 5\\n 6 7 8 9\\n 25 pin 9 pin\\n 1 - PG Protective ground\\n 2 - TD Transmitted data 3\\n 3 - RD Received data 2\\n 4 - RTS Request to send 7\\n 5 - CTS Clear to send 8\\n 6 - DSR Data set ready 6\\n 7 - SG Signal ground 5\\n 8 - CD Carrier detect 1\\n 9 - + voltage (testing)\\n 10 - - voltage (testing)\\n 11 -\\n 12 - SCD Secondary CD\\n 13 - SCS Secondary CTS\\n 14 - STD Secondary TD\\n 15 - TC Transmit clock\\n 16 - SRD Secondary RD\\n 17 - RC Receiver clock\\n 18 -\\n 19 - SRS Secondary RTS \\n 20 - DTR Data terminal ready 4\\n 21 - SQD Signal quality detector\\n 22 - RI Ring indicator 9\\n 23 - DRS Data rate select\\n 24 - XTC External clock\\n 25 -\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"soft_rs232_lo equ $20 ;%87654321\\nsoft_rs232_hi equ $21 ;%-------9\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"LDA soft_rs232_lo\\nora #%00000100\\nsta soft_rs232_lo\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"BIT_0 equ $1\\nBIT_1 equ $2\\nBIT_2 equ $4\\nBIT_3 equ $8\\nBIT_4 equ $10\\nBIT_5 equ $20\\nBIT_6 equ $40\\nBIT_7 equ $80\\n\\nBIT_8 equ $100\\nBIT_9 equ $200\\n\\nRS232_9_TD equ BIT_3\\nRS232_9_RD equ BIT_2\\nRS232_9_RTS equ BIT_7\\nRS232_9_CTS equ BIT_8\\nRS232_9_DSR equ BIT_6\\nRS232_9_SG equ BIT_5\\nRS232_9_CD equ BIT_1\\n\",\n \"language\": \"68000-Assembly\"\n },\n {\n \"code\": \"rs232_9pin_port equ $A00000\\n;I chose $A00000 arbitrarily as an example, its actual address depends on the wiring.\\n\\nMOVE.W #RS232_9_CTS,rs232_9pin_port\\nMOVE.W #RS232_9_CTS|RS232_9_RD|RS232_9_SG,rs232_9pin_port ;bitwise OR can be used at compile time to combine the labels.\\n\",\n \"language\": \"68000-Assembly\"\n },\n {\n \"code\": \"type Bit is mod 2;\\ntype Rs_232_Layout is record\\n Carrier_Detect : Bit;\\n Received_Data : Bit;\\n Transmitted_Data : Bit;\\n Data_Terminal_ready : Bit;\\n Signal_Ground : Bit;\\n Data_Set_Ready : Bit;\\n Request_To_Send : Bit;\\n Clear_To_Send : Bit;\\n Ring_Indicator : Bit;\\nend record;\\n\\nfor Rs_232_Layout use record\\n Carrier_Detect at 0 range 0..0;\\n Received_Data at 0 range 1..1;\\n Transmitted_Data at 0 range 2..2;\\n Data_Terminal_Ready at 0 range 3..3;\\n Signal_Ground at 0 range 4..4;\\n Data_Set_Ready at 0 range 5..5;\\n Request_To_Send at 0 range 6..6;\\n Clear_To_Send at 0 range 7..7;\\n Ring_Indicator at 0 range 8..8;\\nend record;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"MODE RSTWOTHREETWO = BITS;\\nINT ofs = bits width - 9;\\nINT\\n lwb rs232 = ofs + 1,\\n carrier detect = ofs + 1,\\n received data = ofs + 2,\\n transmitted data = ofs + 3,\\n data terminal ready = ofs + 4,\\n signal ground = ofs + 5,\\n data set ready = ofs + 6,\\n request to send = ofs + 7,\\n clear to send = ofs + 8,\\n ring indicator = ofs + 9,\\n upb rs232 = ofs + 9;\\n\\nRSTWOTHREETWO rs232 bits := 2r10000000; # up to bits width, OR #\\nprint((\\\"received data: \\\",received data ELEM rs232bits, new line));\\n\\nrs232 bits := bits pack((FALSE, TRUE, FALSE, FALSE, FALSE, FALSE, FALSE, FALSE, FALSE));\\nprint((\\\"received data: \\\",received data ELEM rs232bits, new line))\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"struct RS232_data\\n{\\n unsigned carrier_detect : 1;\\n unsigned received_data : 1;\\n unsigned transmitted_data : 1;\\n unsigned data_terminal_ready : 1;\\n unsigned signal_ground : 1;\\n unsigned data_set_ready : 1;\\n unsigned request_to_send : 1;\\n unsigned clear_to_send : 1;\\n unsigned ring_indicator : 1;\\n};\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"module controlFieldsInStruct;\\n\\nimport tango.core.BitArray;\\nimport tango.io.Stdout;\\nimport tango.text.convert.Integer;\\n\\nclass RS232Wrapper(int Length = 9)\\n{\\n static assert(Length == 9 || Length == 25, \\\"ERROR, wrong type\\\");\\n BitArray ba;\\n static uint[char[]] _map;\\n\\n public:\\n\\n static if (Length == 9) {\\n static this() {\\n _map = [ cast(char[])\\n \\\"CD\\\" : 1, \\\"RD\\\" : 2, \\\"TD\\\" : 3, \\\"DTR\\\" : 4, \\\"SG\\\" : 5,\\n \\\"DSR\\\" : 6, \\\"RTS\\\" : 7, \\\"CTS\\\" : 8, \\\"RI\\\" : 9\\n ];\\n }\\n } else {\\n static this() {\\n _map = [ cast(char[])\\n \\\"PG\\\" : 1u, \\\"TD\\\" : 2, \\\"RD\\\" : 3, \\\"RTS\\\" : 4, \\\"CTS\\\" : 5,\\n \\\"DSR\\\" : 6, \\\"SG\\\" : 7, \\\"CD\\\" : 8, \\\"+\\\" : 9, \\\"-\\\" : 10,\\n \\\"SCD\\\" : 12, \\\"SCS\\\" : 13, \\\"STD\\\" : 14, \\\"TC\\\" : 15, \\\"SRD\\\" : 16,\\n \\\"RC\\\" : 17, \\\"SRS\\\" : 19, \\\"DTR\\\" : 20, \\\"SQD\\\" : 21, \\\"RI\\\" : 22,\\n \\\"DRS\\\" : 23, \\\"XTC\\\" : 24\\n ];\\n }\\n }\\n\\n\\n this() {\\n ba.length = Length;\\n }\\n\\n bool opIndex(uint pos) { return ba[pos]; }\\n bool opIndexAssign(bool b, uint pos) { return (ba[pos] = b); }\\n bool opIndex(char[] name) {\\n assert (name in _map, \\\"don't know that plug: \\\" ~ name);\\n return opIndex(_map[name]);\\n }\\n bool opIndexAssign(bool b, char[] name) {\\n assert (name in _map, \\\"don't know that plug: \\\" ~ name);\\n return opIndexAssign(b, _map[name]);\\n }\\n void opSliceAssign(bool b) { foreach (ref r; ba) r = b; }\\n char[] toString() {\\n char[] ret = \\\"[\\\";\\n foreach (name, value; _map)\\n ret ~= name ~ \\\":\\\" ~ (ba[value]?\\\"1\\\":\\\"0\\\") ~\\\", \\\";\\n ret ~= \\\"]\\\";\\n return ret;\\n }\\n}\\n\\nint main(char[][] args)\\n{\\n auto ba = new RS232Wrapper!(25);\\n\\n // set all bits\\n ba[] = 1;\\n ba[\\\"RD\\\"] = 0;\\n ba[5] = 0;\\n\\n Stdout (ba).newline;\\n\\n return 0;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.bitmanip;\\n\\nstruct RS232_data {\\n static if (std.system.endian == std.system.Endian.bigEndian) {\\n mixin(bitfields!(bool, \\\"carrier_detect\\\", 1,\\n bool, \\\"received_data\\\", 1,\\n bool, \\\"transmitted_data\\\", 1,\\n bool, \\\"data_terminal_ready\\\", 1,\\n bool, \\\"signal_ground\\\", 1,\\n bool, \\\"data_set_ready\\\", 1,\\n bool, \\\"request_to_send\\\", 1,\\n bool, \\\"clear_to_send\\\", 1,\\n bool, \\\"ring_indicator\\\", 1,\\n bool, \\\"\\\", 7));\\n } else {\\n mixin(bitfields!(bool, \\\"\\\", 7,\\n bool, \\\"ring_indicator\\\", 1,\\n bool, \\\"clear_to_send\\\", 1,\\n bool, \\\"request_to_send\\\", 1,\\n bool, \\\"data_set_ready\\\", 1,\\n bool, \\\"signal_ground\\\", 1,\\n bool, \\\"data_terminal_ready\\\", 1,\\n bool, \\\"transmitted_data\\\", 1,\\n bool, \\\"received_data\\\", 1,\\n bool, \\\"carrier_detect\\\", 1));\\n }\\n\\n static assert(RS232_data.sizeof == 2);\\n}\\n\\nvoid main() {}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"{Enumerate pin assignments}\\n\\ntype TRS232Pins = (rpCarrierDetect, rpReceivedData, rpTransmittedData,\\n\\t\\t rpDataTerminalReady, rpSignalGround, rpDataSetReady,\\n\\t\\t rpRequestToSend, rpClearToSend, rpRingIndicator);\\n{Make into a set}\\ntype TPinSet = set of TRS232Pins;\\n\\nvar Pins: TPinSet;\\t{Global variable holding a set of pins}\\n\\nprocedure ShowMemory(Memo: TMemo; Name: string; SetPins: TPinSet);\\n{Extract the set data from memory and display it}\\nvar S: string;\\nvar P: PWord;\\nbegin\\nP:=@Pins;\\nPins:=SetPins;\\nS:=Name;\\nS:=S+IntToBin(P^, 16, True);\\nMemo.Lines.Add(S);\\nend;\\n\\n\\n\\nprocedure ShowPinsMemory(Memo: TMemo);\\nbegin\\nShowMemory(Memo,'Empty: ',[]);\\nShowMemory(Memo,'Carrier Detect: ',[rpCarrierDetect]);\\nShowMemory(Memo,'Received Data: ',[rpReceivedData]);\\nShowMemory(Memo,'Transmitted Data: ',[rpTransmittedData]);\\nShowMemory(Memo,'Data Terminal Ready:',[rpDataTerminalReady]);\\nShowMemory(Memo,'Signal Ground: ',[rpSignalGround]);\\nShowMemory(Memo,'Data Set Ready: ',[rpDataSetReady]);\\nShowMemory(Memo,'Request To Send: ',[rpRequestToSend]);\\nShowMemory(Memo,'Clear To Send: ',[rpClearToSend]);\\nShowMemory(Memo,'Ring Indicator: ',[rpRingIndicator]);\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \" : masks ( n -- ) 0 do 1 i lshift constant loop ;\\n\\n 9 masks DCD RxD TxD DTR SG DSR RTS CTS RI\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" hex\\n 3fd constant com1-ctrl\\n decimal\\n\\n : wait-ready\\n begin\\n com1-ctrl in\\n CTS and\\n until ;\\n : wait-rx\\n begin\\n com1-ctrl in\\n CTS and 0=\\n until ;\\n\\n : send-byte ( b -- ) \\\\ send assuming N81 (no parity, 8 bits data, 1 bit frame)\\n 255 and\\n 9 0 do\\n RTS com1-ctrl out\\n wait-ready\\n dup 1 and if TxD else 0 then com1-ctrl out\\n wait-rx\\n 2/\\n loop drop ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" TYPE RS232PIN9\\n LOGICAL CARRIER_DETECT\\t\\t!1\\n LOGICAL RECEIVED_DATA\\t\\t!2\\n LOGICAL TRANSMITTED_DATA\\t!3\\n LOGICAL DATA_TERMINAL_READY\\t!4\\n LOGICAL SIGNAL_GROUND\\t\\t!5\\n LOGICAL DATA_SET_READY\\t\\t!6\\n LOGICAL REQUEST_TO_SEND\\t\\t!7\\n LOGICAL CLEAR_TO_SEND\\t\\t!8\\n LOGICAL RING_INDICATOR\\t\\t!9\\n END TYPE RS232PIN9\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"program rs232(input, output, stdErr);\\ntype\\n\\t{$packEnum 2}{$scopedEnums off}\\n\\tpin = (carrierDetect, receivedData, transmittedData, dataTerminalReady,\\n\\t\\tsignalGround, dataSetReady, requestToSend, clearToSend, ringIndicator);\\n\\t{$packSet 2}\\n\\tpins = set of pin;\\nvar\\n\\tsignal: pins;\\n\\t// for demonstration purposes, in order to reveal the memory layout\\n\\tsignalMemoryStructure: word absolute signal;\\n\\t{$if sizeOf(signal) <> sizeOf(word)} // just as safe-guard\\n\\t\\t{$fatal signal size}\\n\\t{$endIf}\\nbegin\\n\\tsignal := [];\\n\\tinclude(signal, signalGround); // equivalent to signal := signal + [signalGround];\\n\\t// for demonstration purposes: obviously we know this is always `true`\\n\\tif signalGround in signal then\\n\\tbegin\\n\\t\\twriteLn(binStr(signalMemoryStructure, bitSizeOf(signal)));\\n\\tend;\\nend.\\n\",\n \"language\": \"Free-Pascal-Lazarus\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\n' using bit fields\\nType RS232_Pin9\\n carrierDetect : 1 As UByte\\n receivedData : 1 As UByte\\n transmittedData : 1 As UByte\\n dataTerminalReady : 1 As UByte\\n signalGround : 1 As UByte\\n dataSetReady : 1 As UByte\\n requestToSend : 1 As UByte\\n clearToSend : 1 As UByte\\n ringIndicator : 1 As UByte\\nEnd Type\\n\\nPrint SizeOf(RS232_Pin9) '' 2 bytes\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\ntype rs232p9 uint16\\n\\nconst (\\n\\tCD9 rs232p9 = 1 << iota // Carrier detect\\n\\tRD9 // Received data\\n\\tTD9 // Transmitted data\\n\\tDTR9 // Data terminal ready\\n\\tSG9 // signal ground\\n\\tDSR9 // Data set ready\\n\\tRTS9 // Request to send\\n\\tCTS9 // Clear to send\\n\\tRI9 // Ring indicator\\n)\\n\\nfunc main() {\\n\\t// set some nonsense bits just for example\\n\\tp := RI9 | TD9 | CD9\\n\\tfmt.Printf(\\\"Type=%T value=%#04x\\\\n\\\", p, p)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"default=: 0#~#|:'labels comments'=:|:(4 ({.@;:@{. ; }.)]);._2 {{)n\\nRD Received data\\nTD Transmitted data\\nDTR Data terminal ready\\nSG Signal ground\\nDSR Data set ready\\nRTS Request to send\\nCTS Clear to send\\nRI Ring indicator\\n}}\\n\\nindices=: labels (i. ;: ::]) ]\\nndx=: [ {~ [ indices ]\\nasgn=: {{ y (x indices m)} x }}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" example=: default NB. new instance\\n example ndx 'RI CTS'\\n0 0\\n example=: example 'RI RTS TD' asgn 1 2 3\\n example ndx 'RI CTS'\\n1 0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public final class MemoryLayoutOfDataStructure {\\n\\n\\tpublic static void main(String[] aArgs) {\\n\\t\\tRS232Pins9 plug = new RS232Pins9();\\n\\t\\tSystem.out.println(plug.getPin(\\\"receivedData\\\"));\\n\\t\\tplug.setPin(2, Status.ON);\\n\\t\\tSystem.out.println(plug.getPin(\\\"receivedData\\\"));\\n\\t\\tplug.setPin(\\\"signalGround\\\", Status.ON);\\n\\t\\tplug.displayPinStatus();\\n\\t}\\n\\t\\n}\\n\\nenum Status { OFF, ON }\\n\\t\\nfinal class RS232Pins9 {\\n\\t\\n\\tpublic Status getPin(int aPinNumber) {\\n\\t\\tfor ( Pin pin : Pin.values() ) {\\n\\t\\t\\tif ( pin.pinNumber == aPinNumber ) {\\n\\t\\t\\t\\treturn pin.status;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tthrow new IllegalArgumentException(\\\"Unknown pin number: \\\" + aPinNumber);\\n\\t}\\n\\t\\n\\tpublic Status getPin(String aName) {\\n\\t\\tfor ( Pin pin : Pin.values() ) {\\n\\t\\t\\tif ( pin.name() == aName ) {\\n\\t\\t\\t\\treturn pin.status;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tthrow new IllegalArgumentException(\\\"Unknown pin name: \\\" + aName);\\n\\t}\\n\\t\\n\\tpublic void setPin(int aPinNumber, Status aStatus) {\\n\\t\\tfor ( Pin pin : Pin.values() ) {\\n\\t\\t\\tif ( pin.pinNumber == aPinNumber ) {\\n\\t\\t\\t\\tpin.status = aStatus;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tpublic void setPin(String aName, Status aStatus) {\\n\\t\\tfor ( Pin pin : Pin.values() ) {\\n\\t\\t\\tif ( pin.name() == aName ) {\\n\\t\\t\\t\\tpin.status = aStatus;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tpublic void displayPinStatus() {\\n\\t\\tfor ( Pin pin : Pin.values() ) {\\n\\t\\t\\tSystem.out.println(String.format(\\\"%-29s%s\\\", pin.name() + \\\" has status \\\", pin.status));\\n\\t\\t}\\t\\t\\t\\n\\t}\\n\\t\\n\\tprivate enum Pin {\\n\\t\\t\\n\\t\\tcarrierDetect(1, Status.OFF), receivedData(2, Status.OFF), transmittedData(3, Status.OFF),\\n\\t\\tdataTerminalReady(4, Status.OFF), signalGround(5, Status.OFF), dataSetReady(6, Status.OFF),\\n\\t\\trequestToSend(7, Status.OFF), clearToSend(8, Status.OFF), ringIndicator(9, Status.OFF);\\n\\t\\t\\n\\t\\tprivate Pin(int aPinNumber, Status aStatus) {\\n\\t\\t\\tpinNumber = aPinNumber;\\n\\t\\t\\tstatus = aStatus;\\n\\t\\t}\\n\\t\\t\\n\\t\\tprivate int pinNumber;\\n\\t\\tprivate Status status;\\t\\t\\n\\t\\t\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"mutable struct NinePinSerialPort\\n pins::BitArray\\n function NinePinSerialPort()\\n this = new()\\n this.pins = BitArray(9)\\n end\\nend\\n\\nconst CD = 1\\nconst RD = 2\\nconst TD = 3\\nconst SG = 5\\nconst DSR = 6\\nconst RTS = 7\\nconst CTS = 8\\n\\n# Here we test the type's code.\\nport = NinePinSerialPort()\\nprintln(\\\"Port is now at defaults, which are $port\\\")\\nport[CTS] = true\\nprintln(\\\"CD pin of port, which is pin $CD, is now $(port[CD])\\\")\\nprintln(\\\"CTS pin of port, which is pin $CTS, is now $(port[CTS])\\\")\\nprintln(\\\"port is now: $port\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nconst val OFF = false\\nconst val ON = true\\n\\nfun toOnOff(b: Boolean) = if (b) \\\"ON\\\" else \\\"OFF\\\"\\n\\ndata class Rs232Pins9(\\n var carrierDetect : Boolean = OFF,\\n var receivedData : Boolean = OFF,\\n var transmittedData : Boolean = OFF,\\n var dataTerminalReady : Boolean = OFF,\\n var signalGround : Boolean = OFF,\\n var dataSetReady : Boolean = OFF,\\n var requestToSend : Boolean = OFF,\\n var clearToSend : Boolean = OFF,\\n var ringIndicator : Boolean = OFF\\n) {\\n fun setPin(n: Int, v: Boolean) {\\n when (n) {\\n 1 -> carrierDetect = v\\n 2 -> receivedData = v\\n 3 -> transmittedData = v\\n 4 -> dataTerminalReady = v\\n 5 -> signalGround = v\\n 6 -> dataSetReady = v\\n 7 -> requestToSend = v\\n 8 -> clearToSend = v\\n 9 -> ringIndicator = v\\n }\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val plug = Rs232Pins9(carrierDetect = ON, receivedData = ON) // set first two pins, say\\n println(toOnOff(plug.component2())) // print value of pin 2 by number\\n plug.transmittedData = ON // set pin 3 by name\\n plug.setPin(4, ON) // set pin 4 by number\\n println(toOnOff(plug.component3())) // print value of pin 3 by number\\n println(toOnOff(plug.dataTerminalReady)) // print value of pin 4 by name\\n println(toOnOff(plug.ringIndicator)) // print value of pin 9 by name\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \">> rs232 = struct('carrier_detect', logical(1),...\\n'received_data' , logical(1), ...\\n'transmitted_data', logical(1),...\\n'data_terminal_ready', logical(1),...\\n'signal_ground', logical(1),...\\n'data_set_ready', logical(1),...\\n'request_to_send', logical(1),...\\n'clear_to_send', logical(1),...\\n'ring_indicator', logical(1))\\n\\nrs232 =\\n\\n carrier_detect: 1\\n received_data: 1\\n transmitted_data: 1\\n data_terminal_ready: 1\\n signal_ground: 1\\n data_set_ready: 1\\n request_to_send: 1\\n clear_to_send: 1\\n ring_indicator: 1\\n\\n>> struct2cell(rs232)\\n\\nans =\\n\\n [1]\\n [1]\\n [1]\\n [1]\\n [1]\\n [1]\\n [1]\\n [1]\\n [1]\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \":- module rs232.\\n\\n:- interface.\\n\\n:- import_module bool, io, list, string.\\n\\n:- type rs232_pin\\n ---> carrier_detect\\n ; received_data\\n ; transmitted_data\\n ; data_terminal_ready\\n ; signal_ground\\n ; data_set_ready\\n ; request_to_send\\n ; clear_to_send\\n ; ring_indicator.\\n\\n:- type rs232.\\n\\n:- func rs232_bits = rs232.\\n:- func rs232_bits(bool) = rs232.\\n\\n:- func rs232_set(rs232, rs232_pin) = rs232.\\n:- func rs232_clear(rs232, rs232_pin) = rs232.\\n\\n:- pred rs232_is_set(rs232::in, rs232_pin::in) is semidet.\\n:- pred rs232_is_clear(rs232::in, rs232_pin::in) is semidet.\\n\\n:- func rs232_set_bits(rs232, list(rs232_pin)) = rs232.\\n:- func rs232_clear_bits(rs232, list(rs232_pin)) = rs232.\\n\\n:- func to_string(rs232) = string.\\n\\n:- pred write_rs232(rs232::in, io::di, io::uo) is det.\\n\\n:- implementation.\\n\\n:- import_module bitmap.\\n\\n:- type rs232 == bitmap.\\n\\nrs232_bits = rs232_bits(no).\\nrs232_bits(Default) = bitmap.init(9, Default).\\n\\nrs232_set(A, Pin) = unsafe_set(A, to_index(Pin)).\\nrs232_clear(A, Pin) = unsafe_clear(A, to_index(Pin)).\\n\\nrs232_is_set(A, Pin) :- unsafe_is_set(A, to_index(Pin)).\\nrs232_is_clear(A, Pin) :- unsafe_is_clear(A, to_index(Pin)).\\n\\nrs232_set_bits(A, Pins) = foldl((func(Pin, B) = rs232_set(B, Pin)), Pins, A).\\nrs232_clear_bits(A, Pins) = foldl((func(Pin, B) = rs232_clear(B, Pin)), Pins, A).\\n\\nto_string(A) = bitmap.to_string(A).\\n\\nwrite_rs232(A, !IO) :- write_bitmap(resize(A, 16, no), !IO).\\n % cannot write a bitmap that isn't byte-divisible\\n\\n:- func to_index(rs232_pin) = bit_index.\\nto_index(carrier_detect) = 0.\\nto_index(received_data) = 1.\\nto_index(transmitted_data) = 2.\\nto_index(data_terminal_ready) = 3.\\nto_index(signal_ground) = 4.\\nto_index(data_set_ready) = 5.\\nto_index(request_to_send) = 6.\\nto_index(clear_to_send) = 7.\\nto_index(ring_indicator) = 8.\\n\\n:- end_module rs232.\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \":- module rs232_main.\\n\\n:- interface.\\n\\n:- import_module io.\\n\\n:- pred main(io::di, io::uo) is det.\\n\\n:- implementation.\\n\\n:- import_module bitmap, bool, list, rs232.\\n\\nmain(!IO) :-\\n Com1 = rs232_set_bits(rs232_bits, [data_terminal_ready, data_set_ready]),\\n Com2 = rs232_clear_bits(rs232_bits(yes), [data_terminal_ready, data_set_ready]),\\n\\n write_string(\\\"Com1 bits = \\\", !IO),\\n write_string(to_string(Com1), !IO), nl(!IO),\\n\\n write_string(\\\"Com2 bits = \\\", !IO),\\n write_string(to_string(Com2), !IO), nl(!IO),\\n\\n write_string(\\\"Com1 DTR is \\\", !IO),\\n ( if rs232_is_set(Com1, data_terminal_ready) then\\n write_string(\\\"set.\\\", !IO), nl(!IO)\\n else\\n write_string(\\\"clear.\\\", !IO), nl(!IO)\\n ),\\n\\n write_string(\\\"Com2 DSR is \\\", !IO),\\n ( if rs232_is_clear(Com2, data_set_ready) then\\n write_string(\\\"clear.\\\", !IO), nl(!IO)\\n else\\n write_string(\\\"set.\\\", !IO), nl(!IO)\\n ).\\n\\n:- end_module rs232_main.\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"type\\n rs232Data = enum\\n carrierDetect,\\n receivedData,\\n transmittedData,\\n dataTerminalReady,\\n signalGround,\\n dataSetReady,\\n requestToSend,\\n clearToSend,\\n ringIndicator\\n\\n# Bit vector of 9 bits\\nvar bv = {carrierDetect, signalGround, ringIndicator}\\necho cast[uint16](bv) # Conversion of bitvector to 2 bytes for writing\\n\\nlet readValue: uint16 = 123\\nbv = cast[set[rs232Data]](readValue) # Conversion of a read value to bitvector\\necho bv\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"open ExtLib\\nclass rs232_data = object\\n val d = BitSet.create 9\\n\\n method carrier_detect = BitSet.is_set d 0\\n method received_data = BitSet.is_set d 1\\n method transmitted_data = BitSet.is_set d 2\\n method data_terminal_ready = BitSet.is_set d 3\\n method signal_ground = BitSet.is_set d 4\\n method data_set_ready = BitSet.is_set d 5\\n method request_to_send = BitSet.is_set d 6\\n method clear_to_send = BitSet.is_set d 7\\n method ring_indicator = BitSet.is_set d 8\\n\\n method set_carrier_detect b = (if b then BitSet.set else BitSet.unset) d 0\\n method set_received_data b = (if b then BitSet.set else BitSet.unset) d 1\\n method set_transmitted_data b = (if b then BitSet.set else BitSet.unset) d 2\\n method set_data_terminal_ready b = (if b then BitSet.set else BitSet.unset) d 3\\n method set_signal_ground b = (if b then BitSet.set else BitSet.unset) d 4\\n method set_data_set_ready b = (if b then BitSet.set else BitSet.unset) d 5\\n method set_request_to_send b = (if b then BitSet.set else BitSet.unset) d 6\\n method set_clear_to_send b = (if b then BitSet.set else BitSet.unset) d 7\\n method set_ring_indicator b = (if b then BitSet.set else BitSet.unset) d 8\\nend\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"use Bit::Vector::Minimal qw();\\nmy $vec = Bit::Vector::Minimal->new(size => 24);\\n\\nmy %rs232 = reverse (\\n 1 => 'PG Protective ground',\\n 2 => 'TD Transmitted data',\\n 3 => 'RD Received data',\\n 4 => 'RTS Request to send',\\n 5 => 'CTS Clear to send',\\n 6 => 'DSR Data set ready',\\n 7 => 'SG Signal ground',\\n 8 => 'CD Carrier detect',\\n 9 => '+ voltage (testing)',\\n 10 => '- voltage (testing)',\\n 12 => 'SCD Secondary CD',\\n 13 => 'SCS Secondary CTS',\\n 14 => 'STD Secondary TD',\\n 15 => 'TC Transmit clock',\\n 16 => 'SRD Secondary RD',\\n 17 => 'RC Receiver clock',\\n 19 => 'SRS Secondary RTS',\\n 20 => 'DTR Data terminal ready',\\n 21 => 'SQD Signal quality detector',\\n 22 => 'RI Ring indicator',\\n 23 => 'DRS Data rate select',\\n 24 => 'XTC External clock',\\n);\\n\\n$vec->set($rs232{'RD Received data'}, 1);\\n$vec->get($rs232{'TC Transmit clock'});\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">CD</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">RD</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">TD</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">DTR</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">...</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">addr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">allocate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- or wherever\\n --read</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">bits</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">int_to_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">peek2u</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">addr</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">16</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">dtr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">bits</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">DTR</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--write</span>\\n <span style=\\\"color: #000000;\\\">bits</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">DTR</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #7060A8;\\\">poke2</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">addr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">bits_to_int</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">bits</span><span style=\\\"color: #0000FF;\\\">))</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"# Define bit constants\\n(for (N . Mask) '(CD RD TD DTR SG DSR RTS CTS RI)\\n (def Mask (>> (- 1 N) 1)) )\\n\\n# Test if Clear to send\\n(when (bit? CTS Data)\\n ... )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"declare 1 RS232_layout,\\n 2 Carrier_Detect Bit(1),\\n 2 Received_Data Bit(1),\\n 2 Transmitted_Data Bit(1),\\n 2 Data_Terminal_ready Bit(1),\\n 2 Signal_Ground Bit(1),\\n 2 Data_Set_Ready Bit(1),\\n 2 Request_To_Send Bit(1),\\n 2 Clear_To_Send Bit(1),\\n 2 Ring_Indicator Bit(1);\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"from ctypes import Structure, c_int\\n\\nrs232_9pin = \\\"_0 CD RD TD DTR SG DSR RTS CTS RI\\\".split()\\nrs232_25pin = ( \\\"_0 PG TD RD RTS CTS DSR SG CD pos neg\\\"\\n \\\"_11 SCD SCS STD TC SRD RC\\\"\\n \\\"_18 SRS DTR SQD RI DRS XTC\\\" ).split()\\n\\nclass RS232_9pin(Structure):\\n _fields_ = [(__, c_int, 1) for __ in rs232_9pin]\\n\\n\\t\\nclass RS232_25pin(Structure):\\n _fields_ = [(__, c_int, 1) for __ in rs232_25pin]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require ffi/unsafe)\\n\\n(define (_autobitmask l)\\n (_bitmask (append* (for/list ([x l] [i (in-naturals)]) `(,x = ,(expt 2 i))))))\\n\\n(define _rs232 (_autobitmask '(CD RD TD DTR SG DSR RTS CTS RI )))\\n\\n;; Usually it will get used when using foreign functions automatically, but\\n;; this demonstrates the conversions explicitly\\n(require (only-in '#%foreign ctype-scheme->c ctype-c->scheme))\\n((ctype-scheme->c _rs232) '(SG TD RI)) ; -> 276\\n((ctype-c->scheme _rs232) 276) ; -> '(TD SG RI)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"enum T_RS232 <\\n carrier_detect\\n received_data\\n transmitted_data\\n data_terminal_ready\\n signal_ground\\n data_set_ready\\n request_to_send\\n clear_to_send\\n ring_indicator\\n>;\\n\\nmy bit @signal[T_RS232];\\n\\n@signal[signal_ground] = 1;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"$signal +|= 1 +< signal_ground;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/* REXX ***************************************************************\\n* Decode Memory structure of RS-232 Plug Definition\\n* Not sure if I understood it completely :-) Open for corrections\\n* You never stop learning (as long as you live)\\n* 03.08.2012 Walter Pachl\\n**********************************************************************/\\nCall decode 'ABC'\\nCall decode 'XY'\\nExit\\n\\ndecode:\\n Parse Arg c\\n cb=c2b(c)\\n If length(cb)=24 Then Do\\n Parse Var cb,\\n /* 1 - PG */ Protective ground +1,\\n /* 3 2 - TD */ Transmitted_data +1,\\n /* 2 3 - RD */ Received_data +1,\\n /* 7 4 - RTS */ Request_to_send +1,\\n /* 8 5 - CTS */ Clear_to_send +1,\\n /* 6 6 - DSR */ Data_set_ready +1,\\n /* 5 7 - SG */ Signal_ground +1,\\n /* 1 8 - CD */ Carrier_detect +1,\\n /* 9 - + */ plus_voltage +1,\\n /* 10 - - */ minus_voltage +1,\\n /* 11 - */ . +1,\\n /* 12 - SCD */ Secondary_CD +1,\\n /* 13 - SCS */ Secondary_CTS +1,\\n /* 14 - STD */ Secondary_TD +1,\\n /* 15 - TC */ Transmit_clock +1,\\n /* 16 - SRD */ Secondary_RD +1,\\n /* 17 - RC */ Receiver_clock +1,\\n /* 18 - */ . +1,\\n /* 19 - SRS */ Secondary_RTS +1,\\n /* 4 20 - DTR */ Data_terminal_ready +1,\\n /* 21 - SQD */ Signal_quality_detector+1,\\n /* 9 22 - RI */ Ring_indicator +1,\\n /* 23 - DRS */ Data_rate_select +1,\\n /* 24 - XTC */ External_clock +1\\n Say '24 bins:' cb\\n Say ' 1 - PG Protective ground ='Protective ground\\n Say ' 2 - TD Transmitted data ='Transmitted_data\\n Say ' 3 - RD Received data ='Received_data\\n Say ' 4 - RTS Request to send ='Request_to_send\\n Say ' 5 - CTS Clear to send ='Clear_to_send\\n Say ' 6 - DSR Data set ready ='Data_set_ready\\n Say ' 7 - SG Signal ground ='Signal_ground\\n Say ' 8 - CD Carrier detect ='Carrier_detect\\n Say ' 9 - + plus voltage ='plus_voltage\\n Say '10 - - minus voltage ='minus_voltage\\n Say ' '\\n Say '12 - SCD Secondary CD ='Secondary_CD\\n Say '13 - SCS Secondary CTS ='Secondary_CTS\\n Say '14 - STD Secondary TD ='Secondary_TD\\n Say '15 - TC Transmit clock ='Transmit_clock\\n Say '16 - SRD Secondary RD ='Secondary_RD\\n Say '17 - RC Receiver clock ='Receiver_clock\\n Say ' '\\n Say '19 - SRS Secondary RTS ='Secondary_RTS\\n Say '20 - DTR Data terminal ready ='Data_terminal_ready\\n Say '21 - SQD Signal quality detector ='Signal_quality_detector\\n Say '22 - RI Ring indicator ='Ring_indicator\\n Say '23 - DRS Data rate select ='Data_rate_select\\n Say '24 - XTC External hlock ='External_clock\\n End\\n Else Do\\n Parse Var cb,\\n /* 1 8 - CD */ Carrier_detect +1,\\n /* 2 3 - RD */ Received_data +1,\\n /* 3 2 - TD */ Transmitted_data +1,\\n /* 4 20 - DTR */ Data_terminal_ready +1,\\n /* 5 7 - SG */ Signal_ground +1,\\n /* 6 6 - DSR */ Data_set_ready +1,\\n /* 7 4 - RTS */ Request_to_send +1,\\n /* 8 5 - CTS */ Clear_to_send +1,\\n /* 9 22 - RI */ Ring_indicator +1\\n Say ' '\\n Say '9-bin:' left(cb,9)\\n Say ' 1 CD Carrier detect ='Carrier_detect\\n Say ' 2 RD Received data ='Received_data\\n Say ' 3 TD Transmitted data ='Transmitted_data\\n Say ' 4 DTR Data terminal ready ='Data_terminal_ready\\n Say ' 5 SG Signal ground ='Signal_ground\\n Say ' 6 DSR Data set ready ='Data_set_ready\\n Say ' 7 RTS Request to send ='Request_to_send\\n Say ' 8 CTS Clear to send ='Clear_to_send\\n Say ' 9 RI Ring indicator ='Ring_indicator\\n End\\n Return\\nc2b: Procedure\\n/* REXX ***************************************************************\\n* c2b Convert a character string to a bit string\\n* 03.08.2012 Walter Pachl\\n**********************************************************************/\\nParse Arg c\\nx=c2x(c)\\nres=''\\nDo While x<>''\\n Parse Var x hb +1 x\\n Select\\n When hb='0' Then bs='0000'\\n When hb='1' Then bs='0001'\\n When hb='2' Then bs='0010'\\n When hb='3' Then bs='0011'\\n When hb='4' Then bs='0100'\\n When hb='5' Then bs='0101'\\n When hb='6' Then bs='0110'\\n When hb='7' Then bs='0111'\\n When hb='8' Then bs='1000'\\n When hb='9' Then bs='1001'\\n When hb='A' Then bs='1010'\\n When hb='B' Then bs='1011'\\n When hb='C' Then bs='1100'\\n When hb='D' Then bs='1101'\\n When hb='E' Then bs='1110'\\n When hb='F' Then bs='1111'\\n End\\n res=res||bs\\n End\\nReturn res\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program displays which pins are active of a 9 or 24 pin RS-232 plug. */\\ncall rs_232 24, 127 /*the value for an RS-232 24 pin plug.*/\\ncall rs_232 24, '020304x' /* \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\" */\\ncall rs_232 9, '10100000b' /* \\\" \\\" \\\" \\\" \\\" 9 \\\" \\\" */\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nrs_232: arg ,x; parse arg pins,ox /*X is uppercased when using ARG. */\\n @. = '??? unassigned pin' /*assign a default for all the pins. */\\n @.24.1 = 'PG protective ground'\\n @.24.2 = 'TD transmitted data' ; @.9.3 = @.24.2\\n @.24.3 = 'RD received data' ; @.9.2 = @.24.3\\n @.24.4 = 'RTS request to send' ; @.9.7 = @.24.4\\n @.24.5 = 'CTS clear to send' ; @.9.8 = @.24.5\\n @.24.6 = 'DSR data set ready' ; @.9.6 = @.24.6\\n @.24.7 = 'SG signal ground' ; @.9.5 = @.24.7\\n @.24.8 = 'CD carrier detect' ; @.9.1 = @.24.8\\n @.24.9 = '+ positive voltage'\\n @.24.10 = '- negative voltage'\\n @.24.12 = 'SCD secondary CD'\\n @.24.13 = 'SCS secondary CTS'\\n @.24.14 = 'STD secondary td'\\n @.24.15 = 'TC transmit clock'\\n @.24.16 = 'SRD secondary RD'\\n @.24.17 = 'RC receiver clock'\\n @.24.19 = 'SRS secondary RTS'\\n @.24.20 = 'DTR data terminal ready' ; @.9.4 = @.24.20\\n @.24.21 = 'SQD signal quality detector'\\n @.24.22 = 'RI ring indicator' ; @.9.9 = @.24.22\\n @.24.23 = 'DRS data rate select'\\n @.24.24 = 'XTC external clock'\\n\\n select\\n when right(x, 1)=='B' then bits= strip(x, 'T', \\\"B\\\")\\n when right(x, 1)=='X' then bits=x2b(strip(x, 'T', \\\"X\\\"))\\n otherwise bits=x2b( d2x(x) )\\n end /*select*/\\n say\\n bits=right(bits, pins, 0) /*right justify pin readings (values). */\\n say '───────── For a' pins \\\"pin RS─232 plug, with a reading of: \\\" ox\\n say\\n do j=1 for pins; z=substr(bits, j, 1); if z==0 then iterate\\n say right(j, 5) 'pin is \\\"on\\\": ' @.pins.j\\n end /*j*/\\n return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"require 'bit-struct'\\n\\nclass RS232_9 < BitStruct\\n unsigned :cd, 1, \\\"Carrier detect\\\" #1\\n unsigned :rd, 1, \\\"Received data\\\" #2\\n unsigned :td, 1, \\\"Transmitted data\\\" #3\\n unsigned :dtr, 1, \\\"Data terminal ready\\\" #4\\n unsigned :sg, 1, \\\"Signal ground\\\" #5\\n unsigned :dsr, 1, \\\"Data set ready\\\" #6\\n unsigned :rts, 1, \\\"Request to send\\\" #7\\n unsigned :cts, 1, \\\"Clear to send\\\" #8\\n unsigned :ri, 1, \\\"Ring indicator\\\" #9\\n\\n def self.new_with_int(value)\\n data = {}\\n fields.each_with_index {|f, i| data[f.name] = value[i]}\\n new(data)\\n end\\nend\\n\\nnum = rand(2**9 - 1)\\nputs \\\"num = #{num}\\\"\\n\\nsample1 = RS232_9.new([(\\\"%09d\\\" % num.to_s(2)).reverse].pack(\\\"B*\\\"))\\nputs sample1.inspect_detailed\\n\\nsample2 = RS232_9.new_with_int(num)\\nputs sample2.inspect_detailed\\n\\nputs \\\"CD is #{sample2.cd == 1 ? 'on' : 'off'}\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"object Rs232Pins9 extends App {\\n\\n val (off: Boolean, on: Boolean) = (false, true)\\n val plug = new Rs232Pins9(carrierDetect = on, receivedData = on) // set first two pins, say\\n\\n def toOnOff(b: Boolean) = if (b) \\\"on\\\" else \\\"off\\\"\\n\\n class Rs232Pins9(\\n var carrierDetect: Boolean = off,\\n var receivedData: Boolean = off,\\n var transmittedData: Boolean = off,\\n var dataTerminalReady: Boolean = off,\\n var signalGround: Boolean = off,\\n var dataSetReady: Boolean = off,\\n var requestToSend: Boolean = off,\\n var clearToSend: Boolean = off,\\n var ringIndicator: Boolean = off\\n ) {\\n def setPin(n: Int, v: Boolean) {\\n (n) match {\\n case 1 => carrierDetect = v\\n case 2 => receivedData = v\\n case 3 => transmittedData = v\\n case 4 => dataTerminalReady = v\\n case 5 => signalGround = v\\n case 6 => dataSetReady = v\\n case 7 => requestToSend = v\\n case 8 => clearToSend = v\\n case 9 => ringIndicator = v\\n }\\n }\\n }\\n\\n // println(toOnOff(plug.component2())) // print value of pin 2 by number\\n plug.transmittedData = on // set pin 3 by name\\n plug.setPin(4, on) // set pin 4 by number\\n // println(toOnOff(plug.component3())) // print value of pin 3 by number\\n println(toOnOff(plug.dataTerminalReady)) // print value of pin 4 by name\\n println(toOnOff(plug.ringIndicator)) // print value of pin 9 by name\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"set rs232_bits {CD RD TD DTR SG DSR RTS CTS RI}\\n\\nproc rs232_encode args {\\n set res 0\\n foreach arg $args {\\n set pos [lsearch $::rs232_bits $arg]\\n if {$pos >=0} {set res [expr {$res | 1<<$pos}]}\\n }\\n return $res\\n}\\nproc rs232_decode int {\\n set res {}\\n set i -1\\n foreach bit $::rs232_bits {\\n incr i\\n if {$int & 1<<$i} {lappend res $bit}\\n }\\n return $res\\n}\\n#------------------------------ Test suite\\nforeach {test => expected} {\\n {rs232_encode CD} -> 1\\n {rs232_decode 1} -> CD\\n {rs232_encode CD RD TD} -> 7\\n {rs232_decode 7} -> {CD RD TD}\\n} {\\n catch $test res\\n if {$res ne $expected} {puts \\\"$test -> $res, expected $expected\\\"}\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"./seq\\\" for Lst\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar ON = true\\nvar OFF = false\\n\\n// Converts \\\"ON\\\"/\\\"OFF\\\" string to true/false.\\nvar AsBool = Fn.new { |s| s == \\\"ON\\\" }\\n\\nclass RS232_9 {\\n static names { [\\\"CD\\\", \\\"RD\\\", \\\"TD\\\", \\\"DTR\\\", \\\"SG\\\", \\\"DSR\\\", \\\"RTS\\\", \\\"CTS\\\", \\\"RI\\\"] }\\n\\n construct new() { _settings = [OFF] * 9 } // all pins OFF\\n\\n // get pin setting as an ON/OFF string by pin name or number; returns null if invalid\\n [p] {\\n if (p is String) {\\n var ix = Lst.indexOf(RS232_9.names, p)\\n return (ix >= 0 && ix < 9) ? (_settings[ix] ? \\\"ON\\\" : \\\"OFF\\\") : null\\n }\\n if (p is Num) {\\n return (p.isInteger && p >= 1 && p <= 9) ? (_settings[p-1] ? \\\"ON\\\" : \\\"OFF\\\") : null\\n }\\n return null\\n }\\n\\n // set pin by pin name or number; does nothing if invalid\\n [p] = (v) {\\n if (v.type == String && (v == \\\"ON\\\" || v == \\\"OFF\\\")) v = AsBool.call(v)\\n if (v.type != Bool) return\\n if (p is String) {\\n var ix = Lst.indexOf(RS232_9.names, p)\\n if (ix >= 0 && ix < 9) _settings[ix] = v\\n }\\n if (p is Num && p.isInteger && p >= 1 && p <= 9) _settings[p-1] = v\\n }\\n\\n // prints all pin settings\\n toString { (1..9).map { |i| \\\"%(i) %(Fmt.s(-3, RS232_9.names[i-1])) = %(this[i])\\\" }.join(\\\"\\\\n\\\") }\\n}\\n\\nvar plug = RS232_9.new()\\nplug[\\\"CD\\\"] = ON // set pin 1 by name\\nplug[3] = ON // set pin 3 by number\\nplug[\\\"DSR\\\"] = \\\"ON\\\" // set pin 6 by name and using a string\\nSystem.print(plug) // print the state of the pins\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"Assuming RS-232 pin 1 is connected to bit 0 of an I/O port et cetera, the\\nbits can be assigned names, such as these:\\n\\ndef CD=1<<0, RD=1<<1, TD=1<<2, DTR=1<<3, DSR=1<<4, RTS=1<<5, CTS=1<<6, RI=1<<7;\\ndef RS232=$10;\\n\\nThe 'port' command can then be used to access these pin signals by name like this:\\nport(RS232):= TD ! RTS;\\nif port(RS232) & RD then ...\\n\\nNote: The 'port' command is implemented in the Intel x86 versions but not\\nin the Raspberry Pi or Windows (EXPL32) versions.\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"softRS232_LO equ &C000 ;%87654321 (each bit represents the state of a numbered pin)\\nsoftRS232_HI equ &C001 ;%-------9\\n\\nld hl,softRS232_LO ;memory location of soft RS232 port\\nld c,&00 ;&00 = the port that the RS232 is connected to.\\n ;This is just an example, the actual port number depends on where the hardware is connected.\\n\\nouti ;send the value contained in softRS232_LO thru port &00\\nouti ;send the value contained in softRS232_HI thru port &00\\n\",\n \"language\": \"Z80-Assembly\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Memory-layout-of-a-data-structure"}}},{"rowIdx":483,"cells":{"solutions":{"kind":"list like","value":[{"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 the appropriate methods and data structures depending on the programming language. \n\nUse the most common libraries only when built-in functionality is not sufficient.\n\n\n;Note:\nEither load the data from the '''.csv''' files or create the required data structures hard-coded.\n\n\n'''patients.csv''' file contents:\n<pre>\nPATIENT_ID,LASTNAME\n1001,Hopper\n4004,Wirth\n3003,Kemeny\n2002,Gosling\n5005,Kurtz\n</pre>\n\n\n'''visits.csv''' file contents:\n<pre>\nPATIENT_ID,VISIT_DATE,SCORE\n2002,2020-09-10,6.8\n1001,2020-09-17,5.5\n4004,2020-09-24,8.4\n2002,2020-10-08,\n1001,,6.6\n3003,2020-11-12,\n4004,2020-11-05,7.0\n1001,2020-11-19,5.3\n</pre>\n\n\nCreate a resulting dataset in-memory or output it to screen or file, whichever is appropriate for the programming language at hand.\n\nMerge and group per patient id and last name, get the maximum visit date, and get the sum and average of the scores per patient to get the resulting dataset.\n\n\nNote that the visit date is purposefully provided as ISO format, so that it could also be processed as text and sorted alphabetically to determine the maximum date.\n<pre>\n| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\n| 1001 | Hopper | 2020-11-19 | 17.4 | 5.80 |\n| 2002 | Gosling | 2020-10-08 | 6.8 | 6.80 |\n| 3003 | Kemeny | 2020-11-12 | | |\n| 4004 | Wirth | 2020-11-05 | 15.4 | 7.70 |\n| 5005 | Kurtz | | | |\n</pre>\n\n\n;Note:\nThis task is aimed in particular at programming languages that are used in data science and data processing, such as F#, Python, R, SPSS, MATLAB etc.\n\n\n;Related tasks:\n* [[CSV data manipulation]]\n* [[CSV to HTML translation]]\n* [[Read entire file]]\n* [[Read a file line by line]]\n<br><br>\n\n","language":"00-TASK"},{"code":"V patients_csv =\n‘PATIENT_ID,LASTNAME\n1001,Hopper\n4004,Wirth\n3003,Kemeny\n2002,Gosling\n5005,Kurtz’\n\nV visits_csv =\n‘PATIENT_ID,VISIT_DATE,SCORE\n2002,2020-09-10,6.8\n1001,2020-09-17,5.5\n4004,2020-09-24,8.4\n2002,2020-10-08,\n1001,,6.6\n3003,2020-11-12,\n4004,2020-11-05,7.0\n1001,2020-11-19,5.3’\n\nF csv2list(s)\n [[String]] rows\n L(row) s.split(\"\\n\")\n rows [+]= row.split(‘,’)\n R rows\n\nV patients = csv2list(patients_csv)\nV visits = csv2list(visits_csv)\n\nV result = copy(patients)\nresult.sort_range(1..)\nresult[0].append(‘LAST_VISIT’)\nV last = Dict(visits[1..], p_vis -> (p_vis[0], p_vis[1]))\nL(record) 1 .< result.len\n result[record].append(last.get(result[record][0], ‘’))\nresult[0] [+]= [‘SCORE_SUM’, ‘SCORE_AVG’]\n\nV n = Dict(patients[1..], p -> (p[0], 0))\nV tot = Dict(patients[1..], p -> (p[0], 0.0))\n\nL(record) visits[1..]\n V p = record[0]\n V score = record[2]\n I !score.empty\n n[p]++\n tot[p] += Float(score)\n\nL(record) 1 .< result.len\n V p = result[record][0]\n I n[p] != 0\n result[record] [+]= [‘#3.1’.format(tot[p]), ‘#2.2’.format(tot[p] / n[p])]\n E\n result[record] [+]= [‘’, ‘’]\n\nL(record) result\n print(‘| ’record.map(r -> r.center(10)).join(‘ | ’)‘ |’)\n","language":"11l"},{"code":"Merge_and_aggregate(patients, visits){\n ID := [], LAST_VISIT := [], SCORE_SUM := [], VISIT := []\n for i, line in StrSplit(patients, \"`n\", \"`r\"){\n if (i=1)\n continue\n x := StrSplit(line, \",\")\n ID[x.1] := x.2\n }\n\n for i, line in StrSplit(visits, \"`n\", \"`r\"){\n if (i=1)\n continue\n x := StrSplit(line, \",\")\n LAST_VISIT[x.1] := x.2 > LAST_VISIT[x.1] ? x.2 : LAST_VISIT[x.1]\n SCORE_SUM[x.1] := (SCORE_SUM[x.1] ? SCORE_SUM[x.1] : 0) + (x.3 ? x.3 : 0)\n if x.3\n VISIT[x.1] := (VISIT[x.1] ? VISIT[x.1] : 0) + 1\n }\n\n output := \"PATIENT_ID`tLASTNAME`tLAST_VISIT`tSCORE_SUM`tSCORE_AVG`n\"\n for id, name in ID\n output .= ID \"`t\" name \"`t\" LAST_VISIT[id] \"`t\" SCORE_SUM[id] \"`t\" SCORE_SUM[id]/VISIT[id] \"`n\"\n return output\n}\n","language":"AutoHotkey"},{"code":"patients =\n(\nPATIENT_ID,LASTNAME\n1001,Hopper\n4004,Wirth\n3003,Kemeny\n2002,Gosling\n5005,Kurtz\n)\n\nvisits =\n(\nPATIENT_ID,VISIT_DATE,SCORE\n2002,2020-09-10,6.8\n1001,2020-09-17,5.5\n4004,2020-09-24,8.4\n2002,2020-10-08,\n1001,,6.6\n3003,2020-11-12,\n4004,2020-11-05,7.0\n1001,2020-11-19,5.3\n)\n\nMsgBox % Merge_and_aggregate(patients, visits)\nreturn\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f MERGE_AND_AGGREGATE_DATASETS.AWK RC-PATIENTS.CSV RC-VISITS.CSV\n# files may appear in any order\n#\n# sorting:\n# PROCINFO[\"sorted_in\"] is used by GAWK\n# SORTTYPE is used by Thompson Automation's TAWK\n#\n{ # printf(\"%s %s\\n\",FILENAME,$0) # print input\n split($0,arr,\",\")\n if (FNR == 1) {\n file = (arr[2] == \"LASTNAME\") ? \"patients\" : \"visits\"\n next\n }\n patient_id_arr[key] = key = arr[1]\n if (file == \"patients\") {\n lastname_arr[key] = arr[2]\n }\n else if (file == \"visits\") {\n if (arr[2] > visit_date_arr[key]) {\n visit_date_arr[key] = arr[2]\n }\n if (arr[3] != \"\") {\n score_arr[key] += arr[3]\n score_count_arr[key]++\n }\n }\n}\nEND {\n print(\"\")\n PROCINFO[\"sorted_in\"] = \"@ind_str_asc\" ; SORTTYPE = 1\n fmt = \"%-10s %-10s %-10s %9s %9s %6s\\n\"\n printf(fmt,\"patient_id\",\"lastname\",\"last_visit\",\"score_sum\",\"score_avg\",\"scores\")\n for (i in patient_id_arr) {\n avg = (score_count_arr[i] > 0) ? score_arr[i] / score_count_arr[i] : \"\"\n printf(fmt,patient_id_arr[i],lastname_arr[i],visit_date_arr[i],score_arr[i],avg,score_count_arr[i]+0)\n }\n exit(0)\n}\n","language":"AWK"},{"code":"#include <iostream>\n#include <optional>\n#include <ranges>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nstruct Patient\n{\n string ID;\n string LastName;\n};\n\nstruct Visit\n{\n string PatientID;\n string Date;\n optional<float> Score;\n};\n\nint main(void)\n{\n auto patients = vector<Patient> {\n {\"1001\", \"Hopper\"},\n {\"4004\", \"Wirth\"},\n {\"3003\", \"Kemeny\"},\n {\"2002\", \"Gosling\"},\n {\"5005\", \"Kurtz\"}};\n\n auto visits = vector<Visit> {\n {\"2002\", \"2020-09-10\", 6.8},\n {\"1001\", \"2020-09-17\", 5.5},\n {\"4004\", \"2020-09-24\", 8.4},\n {\"2002\", \"2020-10-08\", },\n {\"1001\", \"\" , 6.6},\n {\"3003\", \"2020-11-12\", },\n {\"4004\", \"2020-11-05\", 7.0},\n {\"1001\", \"2020-11-19\", 5.3}};\n\n // sort the patients by ID\n sort(patients.begin(), patients.end(),\n [](const auto& a, const auto&b){ return a.ID < b.ID;});\n\n cout << \"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\\n\";\n for(const auto& patient : patients)\n {\n // loop over all of the patients and determine the fields\n string lastVisit;\n float sum = 0;\n int numScores = 0;\n\n // use C++20 ranges to filter the visits by patients\n auto patientFilter = [&patient](const Visit &v){return v.PatientID == patient.ID;};\n for(const auto& visit : visits | views::filter( patientFilter ))\n {\n if(visit.Score)\n {\n sum += *visit.Score;\n numScores++;\n }\n lastVisit = max(lastVisit, visit.Date);\n }\n\n // format the output\n cout << \"| \" << patient.ID << \" | \";\n cout.width(8); cout << patient.LastName << \" | \";\n cout.width(10); cout << lastVisit << \" | \";\n if(numScores > 0)\n {\n cout.width(9); cout << sum << \" | \";\n cout.width(9); cout << (sum / float(numScores));\n }\n else cout << \" | \";\n cout << \" |\\n\";\n }\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Globalization;\nusing System.Linq;\nusing System.Runtime.Serialization;\n\npublic static class MergeAndAggregateDatasets\n{\n public static void Main()\n {\n string patientsCsv = @\"\nPATIENT_ID,LASTNAME\n1001,Hopper\n4004,Wirth\n3003,Kemeny\n2002,Gosling\n5005,Kurtz\";\n\n string visitsCsv = @\"\nPATIENT_ID,VISIT_DATE,SCORE\n2002,2020-09-10,6.8\n1001,2020-09-17,5.5\n4004,2020-09-24,8.4\n2002,2020-10-08,\n1001,,6.6\n3003,2020-11-12,\n4004,2020-11-05,7.0\n1001,2020-11-19,5.3\";\n\n string format = \"yyyy-MM-dd\";\n var formatProvider = new DateTimeFormat(format).FormatProvider;\n\n var patients = ParseCsv(\n patientsCsv.Split(Environment.NewLine, StringSplitOptions.RemoveEmptyEntries),\n line => (PatientId: int.Parse(line[0]), LastName: line[1]));\n\n var visits = ParseCsv(\n visitsCsv.Split(Environment.NewLine, StringSplitOptions.RemoveEmptyEntries),\n line => (\n PatientId: int.Parse(line[0]),\n VisitDate: DateTime.TryParse(line[1], formatProvider, DateTimeStyles.None, out var date) ? date : default(DateTime?),\n Score: double.TryParse(line[2], out double score) ? score : default(double?)\n )\n );\n\n var results =\n patients.GroupJoin(visits,\n p => p.PatientId,\n v => v.PatientId,\n (p, vs) => (\n p.PatientId,\n p.LastName,\n LastVisit: vs.Max(v => v.VisitDate),\n ScoreSum: vs.Sum(v => v.Score),\n ScoreAvg: vs.Average(v => v.Score)\n )\n ).OrderBy(r => r.PatientId);\n\n Console.WriteLine(\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\");\n foreach (var r in results) {\n Console.WriteLine($\"| {r.PatientId,-10} | {r.LastName,-8} | {r.LastVisit?.ToString(format) ?? \"\",-10} | {r.ScoreSum,9} | {r.ScoreAvg,9} |\");\n }\n }\n\n private static IEnumerable<T> ParseCsv<T>(string[] contents, Func<string[], T> constructor)\n {\n for (int i = 1; i < contents.Length; i++) {\n var line = contents[i].Split(',');\n yield return constructor(line);\n }\n }\n\n}\n","language":"C-sharp"},{"code":"// datetime.cpp\n#include <ctime>\n#include <cstdint>\nextern \"C\" {\n int64_t from date(const char* string) {\n struct tm tmInfo = {0};\n strptime(string, \"%Y-%m-%d\", &tmInfo);\n return mktime(&tmInfo); // localtime\n }\n}\n","language":"Datalog"},{"code":"/* rosetta.dl */\n#define NaN to_float(\"NaN\")\n.functor from_date(date:symbol) : number\n.decl Patient(id:number, lastname:symbol)\n.decl Visit(id:number, date:symbol, score:float)\n.decl SummaryDates(id:number, lastname:symbol, last_date:symbol)\n.decl SummaryScores(id:number, lastname:symbol, score_sum:float, score_mean:float)\n.decl MissingDates(x:number)\n\nPatient(1001,\"Hopper\").\nPatient(4004,\"Wirth\").\nPatient(3003,\"Kemeny\").\nPatient(2002,\"Gosling\").\nPatient(5005,\"Kurtz\").\n\nVisit(2002,\"2020-09-10\",6.8).\nVisit(1001,\"2020-09-17\",5.5).\nVisit(4004,\"2020-09-24\",8.4).\nVisit(2002,\"2020-10-08\",NaN).\nVisit(1001,\"\",6.6).\nVisit(3003,\"2020-11-12\",NaN).\nVisit(4004,\"2020-11-05\",7.0).\nVisit(1001,\"2020-11-19\",5.3).\n\nMissingDates(@from_date(\"\")) :- true.\n\nSummaryDates(id, lastname, last_date) :-\n Patient(id,lastname),\n last_timestamp = max ts: {Visit(id, date, _), ts = @from_date(date), !MissingDates(ts)},\n Visit(id, last_date, _), last_timestamp = @from_date(last_date).\nSummaryScores(id, lastname, score_sum, score_mean) :-\n Patient(id,lastname),\n score_sum = sum score: {Visit(id, _, score), score != NaN},\n score_mean = mean score: {Visit(id, _, score), score != NaN}.\n.output SummaryDates\n.output SummaryScores\n","language":"Datalog"},{"code":"g++ -shared -fPIC datetime.cpp -o libfunctors.so\nsouffle -D- rosetta.dl\n","language":"Datalog"},{"code":"// Merge and aggregate datasets. Nigel Galloway: January 6th., 2021\nlet rFile(fName)=seq{use n=System.IO.File.OpenText(fName)\n n.ReadLine() |> ignore\n while not n.EndOfStream do yield n.ReadLine().Split [|','|]}\nlet N=rFile(\"file1.txt\") |> Seq.sort\nlet G=rFile(\"file2.txt\") |> Seq.groupBy(fun n->n.[0]) |> Map.ofSeq\nlet fN n i g e l=printfn \"| %-10s | %-8s | %10s | %-9s | %-9s |\" n i g e l\nlet fG n g=let z=G.[n]|>Seq.sumBy(fun n->try float n.[2] with :? System.FormatException->0.0)\n fN n g (G.[n]|>Seq.sort|>Seq.last).[1] (if z=0.0 then \"\" else string z) (if z=0.0 then \"\" else string(z/(float(Seq.length G.[n]))))\n","language":"F-Sharp"},{"code":"Type Patient\n ID As String\n LastName As String\nEnd Type\n\nType Visit\n PatientID As String\n Fecha As String\n Score As Single\n HasScore As Integer\nEnd Type\n\nDim As Patient patients(5)\nDim As Visit visits(8)\n\npatients(1).ID = \"1001\": patients(1).LastName = \"Hopper\"\npatients(2).ID = \"4004\": patients(2).LastName = \"Wirth\"\npatients(3).ID = \"3003\": patients(3).LastName = \"Kemeny\"\npatients(4).ID = \"2002\": patients(4).LastName = \"Gosling\"\npatients(5).ID = \"5005\": patients(5).LastName = \"Kurtz\"\n\nvisits(1).PatientID = \"2002\": visits(1).Fecha = \"2020-09-10\": visits(1).Score = 6.8: visits(1).HasScore = -1\nvisits(2).PatientID = \"1001\": visits(2).Fecha = \"2020-09-17\": visits(2).Score = 5.5: visits(2).HasScore = -1\nvisits(3).PatientID = \"4004\": visits(3).Fecha = \"2020-09-24\": visits(3).Score = 8.4: visits(3).HasScore = -1\nvisits(4).PatientID = \"2002\": visits(4).Fecha = \"2020-10-08\": visits(4).HasScore = 0\nvisits(5).PatientID = \"1001\": visits(5).Fecha = \"\" : visits(5).Score = 6.6: visits(5).HasScore = -1\nvisits(6).PatientID = \"3003\": visits(6).Fecha = \"2020-11-12\": visits(6).HasScore = 0\nvisits(7).PatientID = \"4004\": visits(7).Fecha = \"2020-11-05\": visits(7).Score = 7.0: visits(7).HasScore = -1\nvisits(8).PatientID = \"1001\": visits(8).Fecha = \"2020-11-19\": visits(8).Score = 5.3: visits(8).HasScore = -1\n\nPrint \"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\"\nFor i As Integer = 1 To 5\n Dim As String lastVisit = \"\"\n Dim As Single sum = 0\n Dim As Integer numScores = 0\n For j As Integer = 1 To 8\n If patients(i).ID = visits(j).PatientID Then\n If visits(j).HasScore Then\n sum += visits(j).Score\n numScores += 1\n End If\n If visits(j).Fecha > lastVisit Then\n lastVisit = visits(j).Fecha\n End If\n End If\n Next j\n Print \"| \"; patients(i).ID; \" | \";\n Print Using \"\\ \\ | \\ \\ | \"; patients(i).LastName; lastVisit;\n If numScores > 0 Then\n Print Using \"#######.# | #######.#\"; sum; (sum / Csng(numScores));\n Else\n Print \" | \";\n End If\n Print \" |\"\nNext i\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n \"sort\"\n)\n\ntype Patient struct {\n id int\n lastName string\n}\n\n// maps an id to a lastname\nvar patientDir = make(map[int]string)\n\n// maintains a sorted list of ids\nvar patientIds []int\n\nfunc patientNew(id int, lastName string) Patient {\n patientDir[id] = lastName\n patientIds = append(patientIds, id)\n sort.Ints(patientIds)\n return Patient{id, lastName}\n}\n\ntype DS struct {\n dates []string\n scores []float64\n}\n\ntype Visit struct {\n id int\n date string\n score float64\n}\n\n// maps an id to lists of dates and scores\nvar visitDir = make(map[int]DS)\n\nfunc visitNew(id int, date string, score float64) Visit {\n if date == \"\" {\n date = \"0000-00-00\"\n }\n v, ok := visitDir[id]\n if ok {\n v.dates = append(v.dates, date)\n v.scores = append(v.scores, score)\n visitDir[id] = DS{v.dates, v.scores}\n } else {\n visitDir[id] = DS{[]string{date}, []float64{score}}\n }\n return Visit{id, date, score}\n}\n\ntype Merge struct{ id int }\n\nfunc (m Merge) lastName() string { return patientDir[m.id] }\nfunc (m Merge) dates() []string { return visitDir[m.id].dates }\nfunc (m Merge) scores() []float64 { return visitDir[m.id].scores }\n\nfunc (m Merge) lastVisit() string {\n dates := m.dates()\n dates2 := make([]string, len(dates))\n copy(dates2, dates)\n sort.Strings(dates2)\n return dates2[len(dates2)-1]\n}\n\nfunc (m Merge) scoreSum() float64 {\n sum := 0.0\n for _, score := range m.scores() {\n if score != -1 {\n sum += score\n }\n }\n return sum\n}\n\nfunc (m Merge) scoreAvg() float64 {\n count := 0\n for _, score := range m.scores() {\n if score != -1 {\n count++\n }\n }\n return m.scoreSum() / float64(count)\n}\n\nfunc mergePrint(merges []Merge) {\n fmt.Println(\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\")\n f := \"| %d | %-7s | %s | %4s | %4s |\\n\"\n for _, m := range merges {\n _, ok := visitDir[m.id]\n if ok {\n lv := m.lastVisit()\n if lv == \"0000-00-00\" {\n lv = \" \"\n }\n scoreSum := m.scoreSum()\n ss := fmt.Sprintf(\"%4.1f\", scoreSum)\n if scoreSum == 0 {\n ss = \" \"\n }\n scoreAvg := m.scoreAvg()\n sa := \" \"\n if !math.IsNaN(scoreAvg) {\n sa = fmt.Sprintf(\"%4.2f\", scoreAvg)\n }\n fmt.Printf(f, m.id, m.lastName(), lv, ss, sa)\n } else {\n fmt.Printf(f, m.id, m.lastName(), \" \", \" \", \" \")\n }\n }\n}\n\nfunc main() {\n patientNew(1001, \"Hopper\")\n patientNew(4004, \"Wirth\")\n patientNew(3003, \"Kemeny\")\n patientNew(2002, \"Gosling\")\n patientNew(5005, \"Kurtz\")\n\n visitNew(2002, \"2020-09-10\", 6.8)\n visitNew(1001, \"2020-09-17\", 5.5)\n visitNew(4004, \"2020-09-24\", 8.4)\n visitNew(2002, \"2020-10-08\", -1) // -1 signifies no score\n visitNew(1001, \"\", 6.6) // \"\" signifies no date\n visitNew(3003, \"2020-11-12\", -1)\n visitNew(4004, \"2020-11-05\", 7.0)\n visitNew(1001, \"2020-11-19\", 5.3)\n\n merges := make([]Merge, len(patientIds))\n for i, id := range patientIds {\n merges[i] = Merge{id}\n }\n mergePrint(merges)\n}\n","language":"Go"},{"code":"#xcommand INSERT INTO <table> ( <uField1>[, <uFieldN> ] ) VALUE ( <uVal1>[, <uValN> ] ) => ;\n <table>->(dbAppend()); <table>-><uField1> := <uVal1> [; <table>-><uFieldN> := <uValN>]\n#xcommand INSERT INTO <table> ( <uFieldList,...> ) VALUES ( <uValList1,...> ) [, ( <uValListN,...> )] => ;\n INSERT INTO <table> ( <uFieldList> ) VALUE ( <uValList1> ) ;\n [; INSERT INTO <table> ( <uFieldList> ) VALUE ( <uValListN> )]\n&& Singular cases (so we can use VALUES for all instances)\n#xcommand INSERT INTO <table> (<uField>) VALUE (<uVal>) => ;\n <table>->(dbAppend()); <table>-><uField> := <uVal>\n#xcommand INSERT INTO <table> ( <uFieldList,...> ) VALUES ( <uValList,...> ) => ;\n INSERT INTO <table> ( <uFieldList> ) VALUE ( <uValList> )\n\nPROCEDURE Main()\nLOCAL pStruct, vStruct, rStruct, xCurId, aAgg\n\n SET DATE FORMAT \"yyyy-mm-dd\"\n\n && create and populate the patient table\n pStruct := {{\"patient_id\", \"n\", 8, 0}, {\"lastname\", \"c\", 10, 0 }}\n dbCreate( \"patient\", pStruct,, .T., \"patient\" )\n INSERT INTO patient (patient_id, lastname) VALUES (1001, \"Hopper\"), (4004, \"Wirth\"), ;\n (3003, \"Kemeny\"), (2002, \"Gosling\"), (5005, \"Kurtz\")\n INDEX ON patient_id TO pat_id\n\n && create and populate the visit table\n vStruct := {{\"patient_id\", \"n\", 8, 0}, {\"visit_date\", \"d\", 10, 0}, {\"score\", \"n\", 8, 1}}\n dbCreate( \"visit\", vStruct,, .T., \"visit\" )\n INSERT INTO visit (patient_id, visit_date, score) VALUES (2002, ctod(\"2020-09-10\"), 6.8), ;\n (1001, ctod(\"2020-09-17\"), 5.5), (4004, ctod(\"2020-09-24\"), 8.4), ;\n (2002, ctod(\"2020-10-08\"), -999), (1001, ctod(\"1900-01-01\"), 6.6), ;\n (3003, ctod(\"2020-11-12\"), -999), (4004, ctod(\"2020-11-05\"), 7.0), ;\n (1001, ctod(\"2020-11-19\"), 5.3)\n INDEX ON patient_id TO visit_id\n\n && create the result table\n rStruct := { {\"patient_id\", \"n\", 8, 0}, ;\n {\"n\", \"i\", 8, 0}, {\"sum_score\", \"n\", 8, 1}, ;\n {\"avg_score\", \"n\", 8, 1}, {\"max_date\", \"d\", 10, 0}}\n dbCreate(\"report\", rStruct,, .T., \"report\")\n\n SELECT visit\n DO WHILE ! Eof()\n xCurId := patient_id && grouping variable\n aAgg := {0, 0, 0.0, ctod(\"1900-01-01\")} && initial values\n DO WHILE ! Eof() .AND. xCurId == patient_id\n\t aAgg := {1+aAgg[1], iif(score==-999,aAgg[2],1+aAgg[2]), ;\n\t iif(score==-999, aAgg[3], score+aAgg[3]), max(visit_date, aAgg[4])} && update\n\t SKIP\n ENDDO\n INSERT INTO report (patient_id, n, sum_score, avg_score, max_date) ;\n VALUES (xCurId, aAgg[1], aAgg[3], aAgg[3]/aAgg[2], aAgg[4])\n ENDDO\n\n SELECT report\n INDEX ON patient_id TO report_id\n\n SELECT patient\n SET RELATION TO patient_id INTO report\n ? \"NUM\", \"PATIENT_ID\", \"LASTNAME\", \"N\", \"SUM_SCORE\", \"AVG_SCORE\", \"MAX_DATE\"\n LIST patient_id, lastname, report->n, report->sum_score, report->avg_score, report->max_date\n\n RETURN\n","language":"Harbour"},{"code":"import Data.List\nimport Data.Maybe\nimport System.IO (readFile)\nimport Text.Read (readMaybe)\nimport Control.Applicative ((<|>))\n\n------------------------------------------------------------\n\nnewtype DB = DB { entries :: [Patient] }\n deriving Show\n\ninstance Semigroup DB where\n DB a <> DB b = normalize $ a <> b\n\ninstance Monoid DB where\n mempty = DB []\n\nnormalize :: [Patient] -> DB\nnormalize = DB\n . map mconcat\n . groupBy (\\x y -> pid x == pid y)\n . sortOn pid\n\n------------------------------------------------------------\n\ndata Patient = Patient { pid :: String\n , name :: Maybe String\n , visits :: [String]\n , scores :: [Float] }\n deriving Show\n\ninstance Semigroup Patient where\n Patient p1 n1 v1 s1 <> Patient p2 n2 v2 s2 =\n Patient (fromJust $ Just p1 <|> Just p2)\n (n1 <|> n2)\n (v1 <|> v2)\n (s1 <|> s2)\n\ninstance Monoid Patient where\n mempty = Patient mempty mempty mempty mempty\n\n------------------------------------------------------------\n\nreadDB :: String -> DB\nreadDB = normalize\n . mapMaybe readPatient\n . readCSV\n\nreadPatient r = do\n i <- lookup \"PATIENT_ID\" r\n let n = lookup \"LASTNAME\" r\n let d = lookup \"VISIT_DATE\" r >>= readDate\n let s = lookup \"SCORE\" r >>= readMaybe\n return $ Patient i n (maybeToList d) (maybeToList s)\n where\n readDate [] = Nothing\n readDate d = Just d\n\nreadCSV :: String -> [(String, String)]\nreadCSV txt = zip header <$> body\n where\n header:body = splitBy ',' <$> lines txt\n splitBy ch = unfoldr go\n where\n go [] = Nothing\n go s = Just $ drop 1 <$> span (/= ch) s\n","language":"Haskell"},{"code":"tabulateDB (DB ps) header cols = intercalate \"|\" <$> body\n where\n body = transpose $ zipWith pad width table\n table = transpose $ header : map showPatient ps\n showPatient p = sequence cols p\n width = maximum . map length <$> table\n pad n col = (' ' :) . take (n+1) . (++ repeat ' ') <$> col\n\nmain = do\n a <- readDB <$> readFile \"patients.csv\"\n b <- readDB <$> readFile \"visits.csv\"\n mapM_ putStrLn $ tabulateDB (a <> b) header fields\n where\n header = [ \"PATIENT_ID\", \"LASTNAME\", \"VISIT_DATE\"\n , \"SCORES SUM\",\"SCORES AVG\"]\n fields = [ pid\n , fromMaybe [] . name\n , \\p -> case visits p of {[] -> []; l -> last l}\n , \\p -> case scores p of {[] -> []; s -> show (sum s)}\n , \\p -> case scores p of {[] -> []; s -> show (mean s)} ]\n\n mean lst = sum lst / genericLength lst\n","language":"Haskell"},{"code":"NB. setup:\nrequire'jd pacman'\nload JDP,'tools/csv_load.ijs'\nF=: jpath '~temp/rosettacode/example/CSV'\njdcreatefolder_jd_ CSVFOLDER=: F\n\nassert 0<{{)n\nPATIENTID,LASTNAME\n1001,Hopper\n4004,Wirth\n3003,Kemeny\n2002,Gosling\n5005,Kurtz\n}} fwrite F,'patients.csv'\n\nassert 0<{{)n\nPATIENTID,VISIT_DATE,SCORE\n2002,2020-09-10,6.8\n1001,2020-09-17,5.5\n4004,2020-09-24,8.4\n2002,2020-10-08,\n1001,,6.6\n3003,2020-11-12,\n4004,2020-11-05,7.0\n1001,2020-11-19,5.3\n}} fwrite F,'visits.csv'\n\ncsvprepare 'patients';F,'patients.csv'\ncsvprepare 'visits';F,'visits.csv'\n\ncsvload 'patients';1\ncsvload 'visits';1\n\njd'ref patients PATIENTID visits PATIENTID'\n","language":"J"},{"code":"require'jd'\n\necho jd {{)n\n reads\n PATIENT_ID: first p.PATIENTID,\n LASTNAME: first p.LASTNAME,\n LAST_VISIT: max v.VISIT_DATE,\n SCORE_SUM: sum v.SCORE,\n SCORE_AVG: avg v.SCORE\n by\n p.PATIENTID\n from\n p:patients,\n v:p.visits\n}} -.LF\n","language":"J"},{"code":"require'csv'\npatients=: fixcsv {{)n\nPATIENTID,LASTNAME\n1001,Hopper\n4004,Wirth\n3003,Kemeny\n2002,Gosling\n5005,Kurtz\n}}\n\nvisits=: fixcsv {{)n\nPATIENTID,VISIT_DATE,SCORE\n2002,2020-09-10,6.8\n1001,2020-09-17,5.5\n4004,2020-09-24,8.4\n2002,2020-10-08,\n1001,,6.6\n3003,2020-11-12,\n4004,2020-11-05,7.0\n1001,2020-11-19,5.3\n}}\n\ntask=: {{\n P=. <@:>\"1|:/:~}.patients\n V=. <@:>\"1|:/:~}.visits\n id=. 0 {:: P\n nm=. 1 {:: P\n sel1=. (0 {:: P) e. 0 {:: V\n sel2=. (~.0 {:: V) e. 0 {:: P NB. unnecessary for this example\n exp=. sel1 #inv sel2 # ]\n agg=. /.(&.:\".)\n vdt=. exp (0 {:: V) {:/. 1 {:: V\n sum=. exp \":,.(0 {:: V) +//. 0\". 2 {:: V\n avg=. exp \":,.(0 {:: V) (+/%#)/. 0\". 2 {:: V\n labels=. ;:'PATIENT_ID LASTNAME LAST_VISIT SCORE_SUM SCORE_AVG'\n labels,:id;nm;vdt;sum;avg\n}}\n","language":"J"},{"code":" task''\n┌──────────┬────────┬──────────┬─────────┬─────────┐\n│PATIENT_ID│LASTNAME│LAST_VISIT│SCORE_SUM│SCORE_AVG│\n├──────────┼────────┼──────────┼─────────┼─────────┤\n│1001 │Hopper │2020-11-19│17.4 │5.8 │\n│2002 │Gosling │2020-10-08│ 6.8 │3.4 │\n│3003 │Kemeny │2020-11-12│ 0 │ 0 │\n│4004 │Wirth │2020-11-05│15.4 │7.7 │\n│5005 │Kurtz │ │ │ │\n└──────────┴────────┴──────────┴─────────┴─────────┘\n","language":"J"},{"code":"task=: {{\n P=. <@:>\"1|:/:~}.patients\n V=. <@:>\"1|:/:~}.visits\n id=. 0 {:: P\n nm=. 1 {:: P\n sel1=. (0 {:: P) e. 0 {:: V\n sel2=. (~.0 {:: V) e. 0 {:: P NB. unnecessary for this example\n exp=. sel1 #inv sel2 # ]\n agg=. /.(&.:\".)\n vdt=. exp (0 {:: V) {:/. 1 {:: V\n sel3=. (0 {:: V) +.//. 2 *@#@{::\"1 }.visits\n exp2=: [:exp sel3 #inv sel3 #]\n sum=. exp2 \":,.(0 {:: V) +//. 0\". 2 {:: V\n avg=. exp2 \":,.(0 {:: V) (+/%#)/. 0\". 2 {:: V\n labels=. ;:'PATIENT_ID LASTNAME LAST_VISIT SCORE_SUM SCORE_AVG'\n labels,:id;nm;vdt;sum;avg\n}}\n","language":"J"},{"code":" task''\n┌──────────┬────────┬──────────┬─────────┬─────────┐\n│PATIENT_ID│LASTNAME│LAST_VISIT│SCORE_SUM│SCORE_AVG│\n├──────────┼────────┼──────────┼─────────┼─────────┤\n│1001 │Hopper │2020-11-19│17.4 │5.8 │\n│2002 │Gosling │2020-10-08│ 6.8 │3.4 │\n│3003 │Kemeny │2020-11-12│ │ │\n│4004 │Wirth │2020-11-05│15.4 │7.7 │\n│5005 │Kurtz │ │ │ │\n└──────────┴────────┴──────────┴─────────┴─────────┘\n","language":"J"},{"code":"import java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Comparator;\nimport java.util.DoubleSummaryStatistics;\nimport java.util.List;\n\npublic final class MergeAndAggregateDatasets {\n\n\tpublic static void main(String[] args) {\n\t\tList<Patient> patients = Arrays.asList(\n\t\t\tnew Patient(\"1001\", \"Hopper\"),\n\t\t\tnew Patient(\"4004\", \"Wirth\"),\n\t\t\tnew Patient(\"3003\", \"Kemeny\"),\n\t\t\tnew Patient(\"2002\", \"Gosling\"),\n\t\t\tnew Patient(\"5005\", \"Kurtz\") );\n\n\t\tList<Visit> visits = Arrays.asList(\t\t\t\t\n\t\t new Visit(\"2002\", \"2020-09-10\", 6.8),\n\t\t new Visit(\"1001\", \"2020-09-17\", 5.5),\n\t\t new Visit(\"4004\", \"2020-09-24\", 8.4),\n\t\t new Visit(\"2002\", \"2020-10-08\", null),\n\t\t new Visit(\"1001\", \"\" , 6.6),\n\t\t new Visit(\"3003\", \"2020-11-12\", null),\n\t\t new Visit(\"4004\", \"2020-11-05\", 7.0),\n\t\t new Visit(\"1001\", \"2020-11-19\", 5.3) );\n\t\t\n\t\tCollections.sort(patients, Comparator.comparing(Patient::patientID));\t\t\n\t\tSystem.out.println(\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\");\t\t\n\t for ( Patient patient : patients ) {\t \t\n\t \tList<Visit> patientVisits = visits.stream().filter( v -> v.visitID == patient.patientID() ).toList();\n\t \tString lastVisit = patientVisits.stream()\n\t \t\t.map( v -> v.visitDate ).max(Comparator.naturalOrder()).orElseGet( () -> \" None \" );\t \t\n\t \tDoubleSummaryStatistics statistics = patientVisits.stream()\n\t \t\t.filter( v -> v.score != null ).mapToDouble(Visit::score).summaryStatistics();\t \t\t \t\n\t \tdouble scoreSum = statistics.getSum();\n\t \tdouble scoreAverage = statistics.getAverage();\t \t\n\t \tString patientDetails = String.format(\"%12s%11s%13s%12.2f%12.2f\",\n\t \t\tpatient.patientID, patient.lastName, lastVisit, scoreSum, scoreAverage);\t \t\n\t \tSystem.out.println(patientDetails);\n\t }\n\n private static record Patient(String patientID, String lastName) {};\n\t private static record Visit(String visitID, String visitDate, Double score) {};\n\n\t}\n\n}\n","language":"Java"},{"code":"# objectify/1 takes an array of atomic values as inputs, and packages\n# these into an object with keys specified by the \"headers\" array and\n# values obtained by trimming string values, replacing empty strings\n# by null, and converting strings to numbers if possible.\ndef objectify(headers):\n def tonumberq: tonumber? // .;\n def trimq: if type == \"string\" then sub(\"^ +\";\"\") | sub(\" +$\";\"\") else . end;\n def tonullq: if . == \"\" then null else . end;\n . as $in\n | reduce range(0; headers|length) as $i\n ({}; .[headers[$i]] = ($in[$i] | trimq | tonumberq | tonullq) );\n\ndef csv2jsonHelper:\n .[0] as $headers\n | reduce (.[1:][] | select(length > 0) ) as $row\n ([]; . + [ $row|objectify($headers) ]);\n","language":"Jq"},{"code":"# output {LAST_VISIT}\ndef LAST_VISIT($patient_id):\n {LAST_VISIT: (map(select( .PATIENT_ID == $patient_id).VISIT_DATE) | max)};\n\n# output {SCORE_SUM, SCORE_AVG}\ndef SCORE_SUMMARY($patient_id):\n map(select( .PATIENT_ID == $patient_id).SCORE)\n | {SCORE_SUM: add, count: length}\n | {SCORE_SUM, SCORE_AVG: (if .SCORE_SUM and .count > 0 then .SCORE_SUM/.count else null end)};\n","language":"Jq"},{"code":"# Read the two tables:\nINDEX($patients | [splits(\"\\n\")] | map(split(\",\")) | csv2jsonHelper[]; .PATIENT_ID) as $patients\n| ($visits | [splits(\"\\n\")] | map(split(\",\")) | csv2jsonHelper) as $visits\n# Construct the new table:\n| $visits\n| map(.PATIENT_ID as $PATIENT_ID\n | {$PATIENT_ID} +\n ($visits | {LASTNAME: $patients[$PATIENT_ID|tostring]} + LAST_VISIT($PATIENT_ID) + SCORE_SUMMARY($PATIENT_ID)))\n# ... but display it as a sequence of JSON objects\n| .[]\n","language":"Jq"},{"code":"using CSV, DataFrames, Statistics\n\n# load data from csv files\n#df_patients = CSV.read(\"patients.csv\", DataFrame)\n#df_visits = CSV.read(\"visits.csv\", DataFrame)\n\n# create DataFrames from text that is hard coded, so use IOBuffer(String) as input\nstr_patients = IOBuffer(\"\"\"PATIENT_ID,LASTNAME\n1001,Hopper\n4004,Wirth\n3003,Kemeny\n2002,Gosling\n5005,Kurtz\n\"\"\")\ndf_patients = CSV.read(str_patients, DataFrame)\nstr_visits = IOBuffer(\"\"\"PATIENT_ID,VISIT_DATE,SCORE\n2002,2020-09-10,6.8\n1001,2020-09-17,5.5\n4004,2020-09-24,8.4\n2002,2020-10-08,\n1001,,6.6\n3003,2020-11-12,\n4004,2020-11-05,7.0\n1001,2020-11-19,5.3\n\"\"\")\ndf_visits = CSV.read(str_visits, DataFrame)\n\n# merge on PATIENT_ID, using an :outer join or we lose Kurtz, who has no data, sort by ID\ndf_merge = sort(join(df_patients, df_visits, on=\"PATIENT_ID\", kind=:outer), (:PATIENT_ID,))\n\nfnonmissing(a, f) = isempty(a) ? [] : isempty(skipmissing(a)) ? a[1] : f(skipmissing(a))\n\n# group by patient id / last name and then aggregate to get latest visit and mean score\ndf_result = by(df_merge, [:PATIENT_ID, :LASTNAME]) do df\n DataFrame(LATEST_VISIT = fnonmissing(df[:VISIT_DATE], maximum),\n SUM_SCORE = fnonmissing(df[:SCORE], sum),\n MEAN_SCORE = fnonmissing(df[:SCORE], mean))\nend\nprintln(df_result)\n","language":"Julia"},{"code":"a = ImportString[\"PATIENT_ID,LASTNAME\n1001,Hopper\n4004,Wirth\n3003,Kemeny\n2002,Gosling\n5005,Kurtz\", \"CSV\"];\nb = ImportString[\"PATIENT_ID,VISIT_DATE,SCORE\n2002,2020-09-10,6.8\n1001,2020-09-17,5.5\n4004,2020-09-24,8.4\n2002,2020-10-08,\n1001,,6.6\n3003,2020-11-12,\n4004,2020-11-05,7.0\n1001,2020-11-19,5.3\", \"CSV\"];\na = <|a[[1, 1]] -> #1, a[[1, 2]] -> #2|> & @@@ Rest[a];\nb = <|b[[1, 1]] -> #1, b[[1, 2]] -> If[#2 != \"\", DateObject[#2], Missing[]], b[[1, 3]] -> If[#3 =!= \"\", #3, Missing[]]|> & @@@ Rest[b];\nj = JoinAcross[a, b, Key[\"PATIENT_ID\"], \"Outer\"];\ngr = GroupBy[j, #[\"PATIENT_ID\"] &];\n<|\"PATIENT_ID\" -> #[[1, \"PATIENT_ID\"]],\n \"LASTNAME\" -> #[[1, \"LASTNAME\"]],\n \"VISIT_DATE\" -> If[DeleteMissing[#[[All, \"VISIT_DATE\"]]] =!= {}, Max@DeleteMissing[#[[All, \"VISIT_DATE\"]]], Missing[]],\n \"SCORE_SUM\" -> If[DeleteMissing@#[[All, \"SCORE\"]] =!= {}, Total@DeleteMissing@#[[All, \"SCORE\"]], Missing[]],\n \"SCORE_AVG\" -> If[DeleteMissing@#[[All, \"SCORE\"]] =!= {}, Mean@DeleteMissing@#[[All, \"SCORE\"]], Missing[]]|> & /@\n gr // Dataset\n","language":"Mathematica"},{"code":":- module rosetta.\n\n:- interface.\n:- import_module io.\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\n:- import_module list, int, float, string, maybe, solutions.\n\n:- pred patient(int::out, string::out) is multi.\npatient(1001, \"Hopper\").\npatient(4004, \"Wirth\").\npatient(3003, \"Kemeny\").\npatient(2002, \"Gosling\").\npatient(5005, \"Kurtz\").\n\n:- func nan = float.\nnan = det_to_float(\"NaN\").\n\n:- type maybe_date ---> date(year::int, month::int, day::int); no.\n\n:- pred visit(int::out, maybe_date::out, float::out) is multi.\nvisit(2002, date(2020,09,10), 6.8).\nvisit(1001, date(2020,09,17), 5.5).\nvisit(4004, date(2020,09,24), 8.4).\nvisit(2002, date(2020,10,08), nan).\nvisit(1001, no, 6.6).\nvisit(3003, date(2020,11,12), nan).\nvisit(4004, date(2020,11,05), 7.0).\nvisit(1001, date(2020,11,19), 5.3).\n\n%% Utilities\n:- pred bag_aggr(pred(T)::(pred(out) is nondet), pred(T,U,U)::pred(in,in,out) is det,\n\t\t U::in, U::out) is det.\n:- pred bag_count(pred(T)::(pred(out) is nondet), int::out) is det.\n:- pred bag_sum(pred(float)::(pred(out) is nondet), float::out) is det.\n:- pred bag_avg(pred(float)::(pred(out) is nondet), float::out) is det.\n:- pred bag_max(pred(T)::(pred(out) is nondet), T::in, T::out) is det.\n:- pred bag_max_date(pred(maybe_date)::(pred(out) is nondet), maybe_date::out) is det.\nbag_aggr(Predicate, Aggregator, Initial, Result) :-\n promise_equivalent_solutions[Result] (\n\tunsorted_aggregate(Predicate, Aggregator, Initial, Result)).\nbag_count(Predicate, Count) :-\n bag_aggr(Predicate, (pred(_X::in,Y::in,Z::out) is det :- Z = Y+1), 0, Count).\nbag_sum(Predicate, Sum) :-\n bag_aggr(Predicate, (pred(X::in,Y::in,Z::out) is det :- Z = X+Y), 0.0, Sum).\nbag_avg(Predicate, Avg) :-\n bag_count(Predicate, N),\n bag_sum(Predicate, Sum),\n (if N = 0 then Avg = nan else Avg = Sum/float(N)).\nbag_max(Predicate, Initial, Max) :-\n bag_aggr(Predicate,\n\t (pred(X::in,Y::in,Z::out) is det :-\n\t\t compare(R,X,Y),\n\t\t (if R = (>) then Z = X else Z = Y)),\n\t Initial, Max).\nbag_max_date(Predicate, MaxDate) :-\n bag_max(Predicate, date(0,0,0), MaxDate1),\n (if MaxDate1 = date(0,0,0) then MaxDate = no else MaxDate = MaxDate1).\n\nmain(!IO) :-\n print_line(\"{Id, Lastname, SumScores, AvgScores, MaxDate}:\", !IO),\n aggregate((pred({Id,Lastname,Sum,Avg,MaxDate}::out) is nondet :-\n\t patient(Id,Lastname),\n\t Scores = (pred(Score::out) is nondet :- visit(Id,_,Score), \\+is_nan(Score)),\n\t bag_avg(Scores, Avg),\n\t \t bag_sum(Scores, Sum),\n\t Dates = (pred(Date::out) is nondet :- visit(Id,Date,_), Date\\=no),\n\t bag_max_date(Dates, MaxDate)),\n\t print_line,\n\t !IO).\n","language":"Mercury"},{"code":"import algorithm, parsecsv, strformat, strutils, tables\n\nconst NoValue = -1.0\n\ntype\n\n Names = OrderedTable[Positive, string] # Mapping id -> last name.\n\n Visit = tuple[date: string; score: float]\n Visits = Table[Positive, seq[Visit]] # Mapping id -> list of visits.\n\n\nproc readNames(path: string): Names =\n ## Read the records (id, lastname) from the CSV file and fill a Names table.\n var parser: CsvParser\n parser.open(path)\n parser.readHeaderRow()\n while parser.readRow():\n let id = parser.row[0].parseInt\n let name = parser.row[1]\n result[id] = name\n\nproc readVisits(path: string): Visits =\n ## Read the records (id, date, score) from the CSV file and fill a Visits table.\n var parser: CsvParser\n parser.open(path)\n parser.readHeaderRow()\n while parser.readRow():\n let id = parser.row[0].parseInt\n let date = parser.row[1]\n let score = if parser.row[2].len == 0: NoValue else: parser.row[2].parseFloat\n result.mgetOrPut(id, @[]).add (date, score)\n\n\nvar\n names = readNames(\"patients1.csv\")\n visits = readVisits(\"patients2.csv\")\n\nnames.sort(system.cmp)\n\necho \"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\"\nfor (id, name) in names.pairs:\n let visitList = visits.getOrDefault(id).sorted()\n let lastVisit = if visitList.len == 0: \"\" else: visitList[^1].date\n var sum = 0.0\n var count = 0\n for visit in visitList:\n if visit.score != NoValue:\n sum += visit.score\n inc count\n let scoreSum = if count == 0: \"\" else: &\"{sum:>4.1f}\"\n let scoreAvg = if count == 0: \"\" else: &\"{sum / count.toFloat: >4.2f}\"\n echo &\"| {id:^10} | {name:^10} | {lastVisit:^10} | {scoreSum:>7} | {scoreAvg:>6} |\"\n","language":"Nim"},{"code":"import parseCsv, db_sqlite, sequtils, strutils\n\nconst FNames = [\"patients1.csv\", \"patients2.csv\"]\n\nproc createTableHeaders(conn: DbConn) =\n conn.exec(sql\"CREATE TABLE names(PATIENT_ID INT, LASTNAME TEXT);\")\n conn.exec(sql\"CREATE TABLE visits(PATIENT_ID INT, VISIT_DATE DATE, SCORE NUMERIC(4,1));\")\n\n\nproc fillTables(dbc: DbConn) =\n for idx, fname in FNames:\n dbc.exec(sql\"BEGIN\")\n var parser: CsvParser\n parser.open(fname)\n parser.readHeaderRow()\n while parser.readRow():\n if idx == 0: # \"names\" table.\n dbc.exec(sql\"INSERT INTO names VALUES (?, ?);\", parser.row)\n else: # \"visits\" table\n dbc.exec(sql\"INSERT INTO visits VALUES (?, ?, ?);\", parser.row)\n dbc.exec(sql\"COMMIT\")\n\n\nproc joinTablesAndGroup(dbc: DbConn): seq[Row] =\n dbc.exec(sql\"\"\"CREATE TABLE answer AS\n SELECT\n names.PATIENT_ID,\n names.LASTNAME,\n MAX(VISIT_DATE) AS LAST_VISIT,\n SUM(SCORE) AS SCORE_SUM,\n CAST(AVG(SCORE) AS DECIMAL(10,2)) AS SCORE_AVG\n FROM\n names\n LEFT JOIN visits\n ON visits.PATIENT_ID = names.PATIENT_ID\n GROUP BY\n names.PATIENT_ID,\n names.LASTNAME\n ORDER BY\n names.PATIENT_ID;\"\"\")\n result = dbc.getAllRows(sql\"SELECT * FROM ANSWER\")\n\n# Build the database and execute the request to get the result.\nlet dbc = open(\":memory:\", \"\", \"\", \"\")\ndbc.createTableHeaders()\ndbc.fillTables()\nlet result = dbc.joinTablesAndGroup()\ndbc.close()\n\n# Print the result.\necho \"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\"\nfor row in result:\n echo \"| \" & row.mapit(it.center(10)).join(\" | \") & '|'\n","language":"Nim"},{"code":"#!/usr/bin/perl\nmy $fmt = '| %-11s' x 5 . \"|\\n\";\nprintf $fmt, qw( PATIENT_ID LASTNAME LAST_VISIT SCORE_SUM SCORE_AVG);\nmy ($names, $visits) = do { local $/; split /^\\n/m, <DATA> };\nmy %score;\nfor ( $visits =~ /^\\d.*/gm )\n {\n my ($id, undef, $score) = split /,/;\n $score{$id} //= ['', ''];\n $score and $score{$id}[0]++, $score{$id}[1] += $score;\n }\nfor ( sort $names =~ /^\\d.*/gm )\n {\n my ($id, $name) = split /,/;\n printf $fmt, $id, $name, ( sort $visits =~ /^$id,(.*?),/gm, '' )[-1],\n $score{$id}[0]\n ? ( $score{$id}[1], $score{$id}[1] / $score{$id}[0])\n : ('', '');\n }\n\n__DATA__\nPATIENT_ID,LASTNAME\n1001,Hopper\n4004,Wirth\n3003,Kemeny\n2002,Gosling\n5005,Kurtz\n\nPATIENT_ID,VISIT_DATE,SCORE\n2002,2020-09-10,6.8\n1001,2020-09-17,5.5\n4004,2020-09-24,8.4\n2002,2020-10-08,\n1001,,6.6\n3003,2020-11-12,\n4004,2020-11-05,7.0\n1001,2020-11-19,5.3\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">patients_txt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"\"\"\n PATIENT_ID,LASTNAME\n 1001,Hopper\n 4004,Wirth\n 3003,Kemeny\n 2002,Gosling\n 5005,Kurtz\"\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">'\\n'</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">visits_txt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"\"\"\n PATIENT_ID,VISIT_DATE,SCORE\n 2002,2020-09-10,6.8\n 1001,2020-09-17,5.5\n 4004,2020-09-24,8.4\n 2002,2020-10-08,\n 1001,,6.6\n 3003,2020-11-12,\n 4004,2020-11-05,7.0\n 1001,2020-11-19,5.3\"\"\"</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;\">--or, assuming these files contain exactly the same actual raw text,\n -- and the use of GT_LF_STRIPPED is instead of above split('\\n'):\n --constant patients_txt = get_text(\"patients.csv\",GT_LF_STRIPPED),\n -- visits_txt = get_text(\"visits.csv\",GT_LF_STRIPPED)</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">sap</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">split</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: #004600;\">false</span><span style=\"color: #0000FF;\">)&{</span><span style=\"color: #008000;\">\"\"</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: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">svp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">split</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: #004600;\">false</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">patient_data</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">apply</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">patients_txt</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">..$],</span><span style=\"color: #000000;\">sap</span><span style=\"color: #0000FF;\">)),</span>\n <span style=\"color: #000000;\">visit_data</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sort_columns</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">apply</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">visits_txt</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">..$],</span><span style=\"color: #000000;\">svp</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: #000000;\">visit_data</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">visit_data</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;\">\"0\"</span><span style=\"color: #0000FF;\">})</span> <span style=\"color: #000080;font-style:italic;\">-- (add a sentinel)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">last_id</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">id</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">scstr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">avstr</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">score</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">score_total</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">average</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">visit_count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pdx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">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;\">visit_data</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">id</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">scstr</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">visit_data</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">score</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">scstr</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #7060A8;\">scanf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">scstr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%f\"</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: #7060A8;\">id</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">last_id</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">visit_count</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">average</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">score_total</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">visit_count</span>\n <span style=\"color: #000000;\">patient_data</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">pdx</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">score_total</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">average</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;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">visit_data</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> <span style=\"color: #000080;font-style:italic;\">-- (sentinel)</span>\n <span style=\"color: #000000;\">score_total</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">score</span>\n <span style=\"color: #000000;\">visit_count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">score</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: #7060A8;\">id</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">patient_data</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">pdx</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #008080;\">do</span> <span style=\"color: #000000;\">pdx</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #000000;\">patient_data</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">pdx</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: #000000;\">dt</span>\n <span style=\"color: #000000;\">last_id</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">id</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">score</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">score_total</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">score</span>\n <span style=\"color: #000000;\">visit_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;\">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;\">\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\\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;\">patient_data</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">id</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">score</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">average</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">patient_data</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">scstr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">score</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%4.1f\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">score</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">avstr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">average</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%4.2f\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">average</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;\">\"| %-10s | %-7s | %10s | %-9s | %-9s |\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">id</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">scstr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">avstr</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"patient(1001,'Hopper').\npatient(4004,'Wirth').\npatient(3003,'Kemeny').\npatient(2002,'Gosling').\npatient(5005,'Kurtz').\n\nvisit(2002,'2020-09-10',6.8).\nvisit(1001,'2020-09-17',5.5).\nvisit(4004,'2020-09-24',8.4).\nvisit(2002,'2020-10-08',nan).\nvisit(1001,'',6.6).\nvisit(3003,'2020-11-12',nan).\nvisit(4004,'2020-11-05',7.0).\nvisit(1001,'2020-11-19',5.3).\n\nsummaryDates(Id, Lastname, LastDate) :-\n aggregate(max(Ts),\n\t Score^Date^(visit(Id, Date, Score), Date \\= '', parse_time(Date, iso_8601, Ts)),\n\t MaxTs),\n format_time(atom(LastDate), '%Y-%m-%d', MaxTs),\n patient(Id,Lastname).\n\nsummaryScores(Id, Lastname, Sum, Mean) :-\n aggregate(r(sum(Score),count), Date^(visit(Id, Date, Score), Score \\= nan), r(Sum,Count)),\n patient(Id,Lastname),\n Mean is Sum/Count.\n\ntest :-\n summaryDates(Id, Lastname, LastDate),\n writeln(summaryDates(Id, Lastname, LastDate)),\n fail.\n\ntest :-\n summaryScores(Id, Lastname, ScoreSum, ScoreMean),\n writeln(summaryScores(Id, Lastname, ScoreSum, ScoreMean)),\n fail.\n","language":"Prolog"},{"code":":- import bagMax/2, bagCount/2, bagSum/2, bagReduce/4 from aggregs.\n:- import julian_date/7, date_string/3 from iso8601.\n:- import load_csv/2, add_cvt_type_hook/2 from proc_files.\n\n?- add_cvt_type_hook(date,date_converter(_,_)).\n\ndate_converter(Atom,Date) :- date_string('YYYY-MM-DD',Date,Atom).\n\n:- load_csv('visit.csv',visit(integer,date,float)).\n:- load_csv('patient.csv',patient(integer,atom)).\n\nis_nan(Number) :- X is Number, X =\\= Number.\n\nsummaryDates(Id, Lastname, LastDate) :-\n bagMax(date_number(Id), LastDateNumber),\n patient(Id,Lastname),\n julian_date(LastDateNumber, Y, M, D, _, _, _),\n date_converter(LastDate, date(Y,M,D)).\n\nsummaryScores(Id, Lastname, Sum, Mean) :-\n bagSum(scores(Id), Sum),\n bagCount(scores(Id), Count),\n Mean is Sum/Count,\n patient(Id,Lastname).\n\ntest :-\n summaryDates(Id,Lastname,LastDate),\n writeln(summaryDates(Id,Lastname,LastDate)), fail.\n\ntest :-\n summaryScores(Id, Lastname, ScoreSum, ScoreMean),\n writeln(summaryScores(Id, Lastname, ScoreSum, ScoreMean)), fail.\n\n/* Put hilog declarations together */\n\ndate_number(Id)(Number) :-\n visit(Id, date(Y,M,D), _),\n julian_date(Number, Y, M, D, _, _, _).\n\t\t\nscores(Id)(Score) :-\n visit(Id, _, Score),\n \\+is_nan(Score).\n\n:- hilog maximum.\nmaximum(X,Y,Z) :- X @> Y -> Z=X ; Z=Y.\n:- hilog sum.\nsum(X,Y,Z) :- Z is X+Y.\n:- hilog successor.\nsuccessor(X,_Y,Z) :- Z is X+1.\n","language":"Prolog"},{"code":"Structure Person\n Name$\nEndStructure\n\nStructure Visits\n Datum$\n Score$\nEndStructure\n\nStructure Merge\n Patient.Person\n List PVisit.Visits()\nEndStructure\n\nNewMap P.Merge()\nNewList ID$()\n\nIf ReadFile(1,\"./Data/patients.csv\")=0 : End 1 : EndIf\nheader=1\nWhile Not Eof(1)\n buf1$=ReadString(1)\n If header=1 : header=0 : Continue : EndIf\n bufId$=StringField(buf1$,1,\",\")\n P(bufId$)\\Patient\\Name$=StringField(buf1$,2,\",\")\n AddElement(ID$()) : ID$()=bufId$\nWend\nCloseFile(1)\n\nIf ReadFile(2,\"./Data/visits.csv\")=0 : End 2 : EndIf\nheader=1\nWhile Not Eof(2)\n buf1$=ReadString(2)\n If header=1 : header=0 : Continue : EndIf\n bufId$=StringField(buf1$,1,\",\")\n AddElement(P(bufId$)\\PVisit())\n P(bufId$)\\PVisit()\\Datum$=StringField(buf1$,2,\",\")\n P(bufId$)\\PVisit()\\Score$=StringField(buf1$,3,\",\")\nWend\nCloseFile(2)\n\nIf OpenConsole()=0 : End 3 : EndIf\nSortList(ID$(),#PB_Sort_Ascending)\nPrintN(\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\")\nForEach ID$()\n Print(\"| \"+LSet(ID$(),11))\n Print(\"| \"+LSet(P(ID$())\\Patient\\Name$,9)+\"|\")\n SortStructuredList(P(ID$())\\PVisit(),#PB_Sort_Ascending,OffsetOf(Visits\\Datum$),TypeOf(Visits\\Datum$))\n ForEach P(ID$())\\PVisit()\n scs.f+ValF(p(ID$())\\PVisit()\\Score$) : c+Bool(ValF(p(ID$())\\PVisit()\\Score$))\n Next\n If LastElement(P(ID$())\\PVisit())\n sca.f=scs/c\n Print(\" \"+LSet(P(ID$())\\PVisit()\\Datum$,10)+\" |\")\n Print(RSet(StrF(scs,1),10)+\" |\")\n If Not IsNAN(sca) : Print(RSet(StrF(sca,2),10)+\" |\") : Else : Print(Space(11)+\"|\") : EndIf\n Else\n Print(Space(12)+\"|\"+Space(11)+\"|\"+Space(11)+\"|\")\n EndIf\n PrintN(\"\") : scs=0 : c=0\nNext\nInput()\n","language":"PureBasic"},{"code":"# to install pandas library go to cmd prompt and type:\n# cd %USERPROFILE%\\AppData\\Local\\Programs\\Python\\Python38-32\\Scripts\\\n# pip install pandas\nimport pandas as pd\n\n# load data from csv files\ndf_patients = pd.read_csv (r'patients.csv', sep = \",\", decimal=\".\")\ndf_visits = pd.read_csv (r'visits.csv', sep = \",\", decimal=\".\")\n\n''' # load data hard coded, create data frames\nimport io\nstr_patients = \"\"\"PATIENT_ID,LASTNAME\n1001,Hopper\n4004,Wirth\n3003,Kemeny\n2002,Gosling\n5005,Kurtz\n\"\"\"\ndf_patients = pd.read_csv(io.StringIO(str_patients), sep = \",\", decimal=\".\")\nstr_visits = \"\"\"PATIENT_ID,VISIT_DATE,SCORE\n2002,2020-09-10,6.8\n1001,2020-09-17,5.5\n4004,2020-09-24,8.4\n2002,2020-10-08,\n1001,,6.6\n3003,2020-11-12,\n4004,2020-11-05,7.0\n1001,2020-11-19,5.3\n\"\"\"\ndf_visits = pd.read_csv(io.StringIO(str_visits), sep = \",\", decimal=\".\")\n'''\n\n# typecast from string to datetime so .agg can 'max' it\ndf_visits['VISIT_DATE'] = pd.to_datetime(df_visits['VISIT_DATE'])\n\n# merge on PATIENT_ID\ndf_merge = df_patients.merge(df_visits, on='PATIENT_ID', how='left')\n\n# groupby is an intermediate object\ndf_group = df_merge.groupby(['PATIENT_ID','LASTNAME'], as_index=False)\n\n# note: you can use 'sum' instead of the lambda function but that returns NaN as 0 (zero)\ndf_result = df_group.agg({'VISIT_DATE': 'max', 'SCORE': [lambda x: x.sum(min_count=1),'mean']})\n\nprint(df_result)\n","language":"Python"},{"code":"import csv\n\nfnames = 'patients.csv patients_visits.csv'.split()\n\ndef csv2list(fname):\n with open(fname) as f:\n rows = list(csv.reader(f))\n return rows\n\npatients, visits = data = [csv2list(fname) for fname in fnames]\nresult = [record.copy() for record in patients]\nresult[1:] = sorted(result[1:])\n#%%\nresult[0].append('LAST_VISIT')\nlast = {p: vis for p, vis, *score in visits[1:]}\nfor record in result[1:]:\n p = record[0]\n record.append(last.get(p, ''))\n#%%\nresult[0] += ['SCORE_SUM', 'SCORE_AVG']\nn = {p: 0 for p, *_ in patients[1:]}\ntot = n.copy()\nfor record in visits[1:]:\n p, _, score = record\n if score:\n n[p] += 1\n tot[p] += float(score)\nfor record in result[1:]:\n p = record[0]\n if n[p]:\n record += [f\"{tot[p]:5.1f}\", f\"{tot[p] / n[p]:5.2f}\"]\n else:\n record += ['', '']\n#%%\nfor record in result:\n print(f\"| {' | '.join(f'{r:^10}' for r in record)} |\")\n","language":"Python"},{"code":"import sqlite3\nimport csv\n\n\nfnames = 'patients.csv patients_visits.csv'.split()\nconn = sqlite3.connect(\":memory:\")\n#%%\n\ndef create_table_headers(conn):\n curs = conn.cursor()\n curs.execute('''\n CREATE TABLE patients(PATIENT_ID INT, LASTNAME TEXT);\n ''')\n curs.execute('''\n CREATE TABLE patients_visits(PATIENT_ID INT, VISIT_DATE DATE, SCORE NUMERIC(4,1));\n ''')\n conn.commit()\n\ndef fill_tables(conn, fnames):\n curs = conn.cursor()\n for fname in fnames:\n with open(fname) as f:\n tablename = fname.replace('.csv', '')\n #\n csvdata = csv.reader(f)\n header = next(csvdata)\n fields = ','.join('?' for _ in header)\n for row in csvdata:\n row = [(None if r == '' else r) for r in row]\n curs.execute(f\"INSERT INTO {tablename} VALUES ({fields});\", row)\n conn.commit()\n\ndef join_tables_and_group(conn):\n curs = conn.cursor()\n curs.execute('''\nCREATE TABLE answer AS\n SELECT\n \tpatients.PATIENT_ID,\n \tpatients.LASTNAME,\n \tMAX(VISIT_DATE) AS LAST_VISIT,\n \tSUM(SCORE) AS SCORE_SUM,\n \tCAST(AVG(SCORE) AS DECIMAL(10,2)) AS SCORE_AVG\n FROM\n \tpatients\n \tLEFT JOIN patients_visits\n \t\tON patients_visits.PATIENT_ID = patients.PATIENT_ID\n GROUP BY\n \tpatients.PATIENT_ID,\n \tpatients.LASTNAME\n ORDER BY\n \tpatients.PATIENT_ID;\n ''')\n curs.execute('''\nSELECT * FROM answer;\n ''')\n conn.commit()\n rows = list(curs.fetchall())\n headers = tuple(d[0] for d in curs.description)\n return [headers] + rows\n\ncreate_table_headers(conn)\nfill_tables(conn, fnames)\nresult = join_tables_and_group(conn)\nfor record in result:\n print(f\"| {' | '.join(f'{str(r):^10}' for r in record)} |\")\n","language":"Python"},{"code":"# load data from csv files\n# setwd(\"C:\\Temp\\csv\\\")\n# df_patient <- read.csv(file=\"patients.csv\", header = TRUE, sep = \",\")\n# df_visits <- read.csv(file=\"visits.csv\", header = TRUE, sep = \",\", dec = \".\", colClasses=c(\"character\",\"character\",\"numeric\"))\n\n# load data hard coded, create data frames\ndf_patient <- read.table(text = \"\nPATIENT_ID,LASTNAME\n1001,Hopper\n4004,Wirth\n3003,Kemeny\n2002,Gosling\n5005,Kurtz\n\", header = TRUE, sep = \",\") # character fields so no need for extra parameters colClasses etc.\n\ndf_visits <- read.table(text = \"\nPATIENT_ID,VISIT_DATE,SCORE\n2002,2020-09-10,6.8\n1001,2020-09-17,5.5\n4004,2020-09-24,8.4\n2002,2020-10-08,\n1001,,6.6\n3003,2020-11-12,\n4004,2020-11-05,7.0\n1001,2020-11-19,5.3\n\", header = TRUE, dec = \".\", sep = \",\", colClasses=c(\"character\",\"character\",\"numeric\"))\n\n# aggregate visit date and scores\ndf_agg <- data.frame(\n cbind(\n PATIENT_ID = names(tapply(df_visits$VISIT_DATE, list(df_visits$PATIENT_ID), max, na.rm=TRUE)),\n last_visit = tapply(df_visits$VISIT_DATE, list(df_visits$PATIENT_ID), max, na.rm=TRUE),\n score_sum = tapply(df_visits$SCORE, list(df_visits$PATIENT_ID), sum, na.rm=TRUE),\n score_avg = tapply(df_visits$SCORE, list(df_visits$PATIENT_ID), mean, na.rm=TRUE)\n )\n)\n\n# merge patients and aggregate dataset\n# all.x = all the non matching cases of df_patient are appended to the result as well (i.e. 'left join')\ndf_result <- merge(df_patient, df_agg, by = 'PATIENT_ID', all.x = TRUE)\n\nprint(df_result)\n","language":"R"},{"code":"my @names = map { ( <PATIENT_ID LASTNAME> Z=> .list ).hash },\n ( 1001, 'Hopper' ),\n ( 4004, 'Wirth' ),\n ( 3003, 'Kemeny' ),\n ( 2002, 'Gosling' ),\n ( 5005, 'Kurtz' ),\n;\nmy @visits = map { ( <PATIENT_ID VISIT_DATE SCORE> Z=> .list ).hash },\n ( 2002, '2020-09-10', 6.8 ),\n ( 1001, '2020-09-17', 5.5 ),\n ( 4004, '2020-09-24', 8.4 ),\n ( 2002, '2020-10-08', Nil ),\n ( 1001, Nil , 6.6 ),\n ( 3003, '2020-11-12', Nil ),\n ( 4004, '2020-11-05', 7.0 ),\n ( 1001, '2020-11-19', 5.3 ),\n;\n\nmy %v = @visits.classify: *.<PATIENT_ID>;\n\nmy @result = gather for @names -> %n {\n my @p = %v{ %n.<PATIENT_ID> }<>;\n\n my @dates = @p».<VISIT_DATE>.grep: *.defined;\n my @scores = @p».< SCORE>.grep: *.defined;\n\n take {\n %n,\n LAST_VISIT => ( @dates.max if @dates ),\n SCORE_AVG => ( @scores.sum/@scores if @scores ),\n SCORE_SUM => ( @scores.sum if @scores ),\n };\n}\n\nmy @out_field_names = <PATIENT_ID LASTNAME LAST_VISIT SCORE_SUM SCORE_AVG>;\nmy @rows = @result.sort(*.<PATIENT_ID>).map(*.{@out_field_names});\nsay .map({$_ // ''}).fmt('%-10s', ' | ') for @out_field_names, |@rows;\n","language":"Raku"},{"code":"/* REXX */\npatients='patients.csv'\nl=linein(patients)\nParse Var l h1 ',' h2\nn=0\nidl=''\nDo n=1 By 1 While lines(patients)>0\n l=linein(patients)\n Parse Var l id ',' lastname.id\n idl=idl id\n End\nn=n-1 /* number of patients */\nvisits='visits.csv'\nl=linein(visits) /* skip the header line of this file */\nh3='LAST_VISIT'\nh4='SCORE_SUM'\nh5='SCORE_AVG'\ndate.=''\nscore.=0\nSay '|' h1 '|' h2 '|' h3 '|' h4 '|' h5 '|'\nDo While lines(visits)>0\n l=linein(visits)\n Parse Var l id ',' date ',' score\n if date>date.id Then date.id=date\n If score>'' Then Do\n z=score.id.0+1\n score.id.z=score\n score.id.0=z\n End\n end\nidl=wordsort(idl)\nDo While idl<>''\n Parse Var idl id idl\n If date.id='' Then date.id=copies(' ',10)\n ol='|' left(id,length(h1)) '|' left(lastname.id,length(h2)),\n '|' left(date.id,length(h3))\n If score.id.0=0 Then Do\n ol=ol '|' left(' ',length(h4)) '|',\n left(' ',length(h5)) '|'\n score_sum=copies(' ',length(h4))\n score_avg=copies(' ',length(h4))\n End\n Else Do\n score_sum=0\n Do j=1 To score.id.0\n score_sum=score_sum+score.id.j\n End\n score_avg=score_sum/score.id.0\n ol=ol '|' left(format(score_sum,2,1),length(h4)) '|',\n left(format(score_avg,2,1),length(h5)) '|'\n End\n Say ol\n End\nExit\n\nwordsort: Procedure\n/**********************************************************************\n* Sort the list of words supplied as argument. Return the sorted list\n**********************************************************************/\n Parse Arg wl\n wa.=''\n wa.0=0\n Do While wl<>''\n Parse Var wl w wl\n Do i=1 To wa.0\n If wa.i>w Then Leave\n End\n If i<=wa.0 Then Do\n Do j=wa.0 To i By -1\n ii=j+1\n wa.ii=wa.j\n End\n End\n wa.i=w\n wa.0=wa.0+1\n End\n swl=''\n Do i=1 To wa.0\n swl=swl wa.i\n End\n Return strip(swl)\n","language":"REXX"},{"code":" %let datefmt=E8601DA10.;\n data patient;\n infile \"patient.csv\" dsd dlm=',';\n attrib\n id length=4\n lastname length=$10;\n input id lastname;\n data visit;\n infile \"visit.csv\" dsd dlm=',';\n attrib\n id length=4\n date informat=&datefmt format=&datefmt\n score length=8;\n input id date score;\n proc sql;\n select * from\n (select id, max(date) format=&datefmt as max_date, sum(score) as sum_score,\n \tavg(score) as avg_score from visit group by id)\n natural right join patient\n order by id;\n","language":"SAS"},{"code":"* set working directory to location of .csv files\n\nCD 'C:\\Temp\\csv\\'.\n\n* load patients csv data\n\nGET DATA /TYPE=TXT\n /FILE=\"patients.csv\"\n /ENCODING='UTF8'\n /DELCASE=LINE\n /DELIMITERS=\",\"\n /QUALIFIER='\"'\n /ARRANGEMENT=DELIMITED\n /FIRSTCASE=2\n /IMPORTCASE=ALL\n /VARIABLES=\nPATIENT_ID F5.0\nLASTNAME A20\n.\nCACHE.\nEXECUTE.\n\n* sort cases is needed to match files\n\nSORT CASES BY PATIENT_ID (A).\nDATASET NAME Patients WINDOW=FRONT.\n\n* load visits csv data\n\nGET DATA /TYPE=TXT\n /FILE=\"visit.csv\"\n /ENCODING='UTF8'\n /DELCASE=LINE\n /DELIMITERS=\",\"\n /QUALIFIER='\"'\n /ARRANGEMENT=DELIMITED\n /FIRSTCASE=2\n /IMPORTCASE=ALL\n /VARIABLES=\nPATIENT_ID F5.0\nVISIT_DATE SDATE10\nSCORE F4.1\n.\nCACHE.\nEXECUTE.\n\n* sort cases is needed, else match files will raise error \"Files out of order\"\n\nSORT CASES BY PATIENT_ID (A) VISIT_DATE (A).\nDATASET NAME Visits WINDOW=FRONT.\n\n* load visits csv data\n\n* merge datasets, one to many, FILE is the 'one', TABLE is 'many'\n\nMATCH FILES TABLE = Patients / FILE = Visits\n/BY PATIENT_ID.\nEXECUTE.\n\n* aggregate visit date and scores, group by and order (A)=ascending or (D)=descending\n\nAGGREGATE OUTFILE *\n/BREAK=PATIENT_ID(A)\n/last_visit = MAX(VISIT_DATE)\n/score_avg = MEAN(SCORE)\n/score_sum = SUM(SCORE).\n","language":"SPSS"},{"code":"-- drop tables\nDROP TABLE IF EXISTS tmp_patients;\nDROP TABLE IF EXISTS tmp_visits;\n\n-- create tables\nCREATE TABLE tmp_patients(\n\tPATIENT_ID INT,\n\tLASTNAME VARCHAR(20)\n);\n\nCREATE TABLE tmp_visits(\n\tPATIENT_ID INT,\n\tVISIT_DATE DATE,\n\tSCORE NUMERIC(4,1)\n);\n\n-- load data from csv files\n/*\n-- Note: LOAD DATA LOCAL requires `local-infile` enabled on both the client and server else you get error \"#1148 command is not allowed..\"\nLOAD DATA LOCAL INFILE '/home/csv/patients.csv' INTO TABLE `tmp_patients` FIELDS TERMINATED BY ',' LINES TERMINATED BY '\\n' IGNORE 1 LINES;\nLOAD DATA LOCAL INFILE '/home/csv/visits.csv' INTO TABLE `tmp_visits` FIELDS TERMINATED BY ',' LINES TERMINATED BY '\\n' IGNORE 1 LINES;\n*/\n\n-- load data hard coded\nINSERT INTO tmp_patients(PATIENT_ID, LASTNAME)\nVALUES\n(1001, 'Hopper'),\n(4004, 'Wirth'),\n(3003, 'Kemeny'),\n(2002, 'Gosling'),\n(5005, 'Kurtz');\n\nINSERT INTO tmp_visits(PATIENT_ID, VISIT_DATE, SCORE)\nVALUES\n(2002, '2020-09-10', 6.8),\n(1001, '2020-09-17', 5.5),\n(4004, '2020-09-24', 8.4),\n(2002, '2020-10-08', NULL),\n(1001, NULL, 6.6),\n(3003, '2020-11-12', NULL),\n(4004, '2020-11-05', 7.0),\n(1001, '2020-11-19', 5.3);\n\n-- join tables and group\nSELECT\n\tp.PATIENT_ID,\n\tp.LASTNAME,\n\tMAX(VISIT_DATE) AS LAST_VISIT,\n\tSUM(SCORE) AS SCORE_SUM,\n\tCAST(AVG(SCORE) AS DECIMAL(10,2)) AS SCORE_AVG\nFROM\n\ttmp_patients p\n\tLEFT JOIN tmp_visits v\n\t\tON v.PATIENT_ID = p.PATIENT_ID\nGROUP BY\n\tp.PATIENT_ID,\n\tp.LASTNAME\nORDER BY\n\tp.PATIENT_ID;\n","language":"SQL"},{"code":"#lang transd\n\nMainModule: {\n\ntbl: `1001,Hopper\n4004,Wirth\n3003,Kemeny\n2002,Gosling\n5005,Kurtz`,\n\ntbl1: `\n2002,2020-09-10,6.8\n1001,2020-09-17,5.5\n4004,2020-09-24,8.4\n2002,2020-10-08,\n1001,,6.6\n3003,2020-11-12,\n4004,2020-11-05,7.0\n1001,2020-11-19,5.3`,\n\ncols: `@key_PATIENT_ID:Int,\n LASTNAME:String,\n VISIT_DATE:DateTime,\n SCORE:Double,\n SCORE_AVG:Double,\n NUM_VISITS:Int`,\n\nRecord : typealias(Tuple<Int DateTime Double>()),\n\n\t_start: (λ (with base TSDBase()\n\t\t(load-table base tbl colNames: cols)\n (build-index base \"PATIENT_ID\")\n\n (with vizs Vector<Record>()\n (load-table vizs tbl1 :mixedTypes fieldSep: \",\" rowSep: \"\\n\" )\n (for viz in vizs do\n (tsd-query base\n :update set:\n (lambda PATIENT_ID Int() VISIT_DATE DateTime()\n SCORE Double() SCORE_AVG Double() NUM_VISITS Int()\n (+= NUM_VISITS 1)\n (set VISIT_DATE (get viz 1))\n (set SCORE (+ SCORE (get viz 2)))\n (set SCORE_AVG (/ SCORE NUM_VISITS)))\n where: (lambda PATIENT_ID Int() (eq PATIENT_ID (get viz 0))))\n ))\n\n (with cols [\"PATIENT_ID\",\"LASTNAME\",\"VISIT_DATE\",\"SCORE\",\"SCORE_AVG\"]\n (with recs (tsd-query base select: cols\n as: [[Int(), String(), DateTime(), Double(), Double()]]\n where: (lambda PATIENT_ID Int() true)\n )\n (for i in cols do (textout width: 10 i \"|\")) (lout \"\")\n (for rec in recs do\n (for-each rec (λ i :Data() (textout width: 10 i \"|\" )))\n (lout \"\"))\n\t\t))\n\t))\n}\n","language":"Transd"},{"code":"BEGIN;\n TYPE Date UNION;\n TYPE DateValid IS {Date POSSREP {year INTEGER, month INTEGER, day INTEGER}};\n TYPE DateNone IS {Date POSSREP {}};\n TYPE DateUnknown IS {Date POSSREP {}};\nEND;\n\nVAR patient REAL RELATION {id INT, lastname CHAR} KEY {id};\n\nINSERT patient RELATION\n{TUPLE {id 1001, lastname 'Hopper'},\n TUPLE {id 4004, lastname 'Wirth'},\n TUPLE {id 3003, lastname 'Kemeny'},\n TUPLE {id 2002, lastname 'Gosling'},\n TUPLE {id 5005, lastname 'Kurtz'}\n };\n\nVAR visit REAL RELATION {id INT, date Date, score RATIONAL} KEY {id, date};\n\nINSERT visit RELATION\n{\nTUPLE {id 2002, date DateValid(2020,09,10), score 6.8},\nTUPLE {id 1001, date DateValid(2020,09,17), score 5.5},\nTUPLE {id 4004, date DateValid(2020,09,24), score 8.4},\nTUPLE {id 2002, date DateValid(2020,10,08), score NAN},\nTUPLE {id 1001, date DateNone(), score 6.6},\nTUPLE {id 3003, date DateValid(2020,11,12), score NAN},\nTUPLE {id 4004, date DateValid(2020,11,05), score 7.0},\nTUPLE {id 1001, date DateValid(2020,11,19), score 5.3}\n};\n\n((SUMMARIZE (visit WHERE score>0.0) BY {id}: {sumscore := SUM(score), avgscore := AVG(score)}) UNION\n (EXTEND (patient {id} MINUS ((visit WHERE score>0.0) {id})): {sumscore := NaN, avgscore := NaN})) JOIN\n (SUMMARIZE visit BY {id}: {maxdate := MAX(date)} UNION\n (EXTEND (patient {id} MINUS (visit {id})): {maxdate := DateUnknown()})) JOIN\n patient\n","language":"TutorialD"},{"code":"import \"./fmt\" for Fmt\nimport \"./sort\" for Sort\n\nclass Patient {\n construct new(id, lastName) {\n _id = id\n _lastName = lastName\n if (!__dir) __dir = {}\n __dir[id] = lastName\n if (!__ids) {\n __ids = [id]\n } else {\n __ids.add(id)\n Sort.insertion(__ids)\n }\n }\n\n id { _id }\n lastName { _lastName }\n\n // maps an id to a lastname\n static dir { __dir }\n\n // maintains a sorted list of ids\n static ids { __ids }\n}\n\nclass Visit {\n construct new(id, date, score) {\n _id = id\n _date = date || \"0000-00-00\"\n _score = score\n if (!__dir) __dir = {}\n if (!__dir[id]) {\n __dir[id] = [ [_date], [score] ]\n } else {\n __dir[id][0].add(_date)\n __dir[id][1].add(score)\n }\n }\n\n id { _id }\n date { _date }\n score { _score }\n\n // maps an id to lists of dates and scores\n static dir { __dir }\n}\n\nclass Merge {\n construct new(id) {\n _id = id\n }\n\n id { _id }\n lastName { Patient.dir[_id] }\n dates { Visit.dir[_id][0] }\n scores { Visit.dir[_id][1] }\n lastVisit { Sort.merge(dates)[-1] }\n\n scoreSum { scores.reduce(0) { |acc, s| s ? acc + s : acc } }\n scoreAvg { scoreSum / scores.count { |s| s } }\n\n static print(merges) {\n System.print(\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\")\n var fmt = \"| $d | $-7s | $s | $4s | $4s |\"\n for (m in merges) {\n if (Visit.dir[m.id]) {\n var lv = (m.lastVisit != \"0000-00-00\") ? m.lastVisit : \" \"\n var ss = (m.scoreSum > 0) ? Fmt.f(4, m.scoreSum, 1) : \" \"\n var sa = (!m.scoreAvg.isNan) ? Fmt.f(4, m.scoreAvg, 2) : \" \"\n Fmt.print(fmt, m.id, m.lastName, lv, ss, sa)\n } else {\n Fmt.print(fmt, m.id, m.lastName, \" \", \" \", \" \")\n }\n }\n }\n}\n\nPatient.new(1001, \"Hopper\")\nPatient.new(4004, \"Wirth\")\nPatient.new(3003, \"Kemeny\")\nPatient.new(2002, \"Gosling\")\nPatient.new(5005, \"Kurtz\")\n\nVisit.new(2002, \"2020-09-10\", 6.8)\nVisit.new(1001, \"2020-09-17\", 5.5)\nVisit.new(4004, \"2020-09-24\", 8.4)\nVisit.new(2002, \"2020-10-08\", null)\nVisit.new(1001, null , 6.6)\nVisit.new(3003, \"2020-11-12\", null)\nVisit.new(4004, \"2020-11-05\", 7.0)\nVisit.new(1001, \"2020-11-19\", 5.3)\n\nvar merges = Patient.ids.map { |id| Merge.new(id) }.toList\nMerge.print(merges)\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Merge_and_aggregate_datasets\\nnote: Data Structures\\n\",\n \"language\": \"00-META\"\n },\n {\n \"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 the appropriate methods and data structures depending on the programming language. \\n\\nUse the most common libraries only when built-in functionality is not sufficient.\\n\\n\\n;Note:\\nEither load the data from the '''.csv''' files or create the required data structures hard-coded.\\n\\n\\n'''patients.csv''' file contents:\\n<pre>\\nPATIENT_ID,LASTNAME\\n1001,Hopper\\n4004,Wirth\\n3003,Kemeny\\n2002,Gosling\\n5005,Kurtz\\n</pre>\\n\\n\\n'''visits.csv''' file contents:\\n<pre>\\nPATIENT_ID,VISIT_DATE,SCORE\\n2002,2020-09-10,6.8\\n1001,2020-09-17,5.5\\n4004,2020-09-24,8.4\\n2002,2020-10-08,\\n1001,,6.6\\n3003,2020-11-12,\\n4004,2020-11-05,7.0\\n1001,2020-11-19,5.3\\n</pre>\\n\\n\\nCreate a resulting dataset in-memory or output it to screen or file, whichever is appropriate for the programming language at hand.\\n\\nMerge and group per patient id and last name, get the maximum visit date, and get the sum and average of the scores per patient to get the resulting dataset.\\n\\n\\nNote that the visit date is purposefully provided as ISO format, so that it could also be processed as text and sorted alphabetically to determine the maximum date.\\n<pre>\\n| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\\n| 1001 | Hopper | 2020-11-19 | 17.4 | 5.80 |\\n| 2002 | Gosling | 2020-10-08 | 6.8 | 6.80 |\\n| 3003 | Kemeny | 2020-11-12 | | |\\n| 4004 | Wirth | 2020-11-05 | 15.4 | 7.70 |\\n| 5005 | Kurtz | | | |\\n</pre>\\n\\n\\n;Note:\\nThis task is aimed in particular at programming languages that are used in data science and data processing, such as F#, Python, R, SPSS, MATLAB etc.\\n\\n\\n;Related tasks:\\n* [[CSV data manipulation]]\\n* [[CSV to HTML translation]]\\n* [[Read entire file]]\\n* [[Read a file line by line]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V patients_csv =\\n‘PATIENT_ID,LASTNAME\\n1001,Hopper\\n4004,Wirth\\n3003,Kemeny\\n2002,Gosling\\n5005,Kurtz’\\n\\nV visits_csv =\\n‘PATIENT_ID,VISIT_DATE,SCORE\\n2002,2020-09-10,6.8\\n1001,2020-09-17,5.5\\n4004,2020-09-24,8.4\\n2002,2020-10-08,\\n1001,,6.6\\n3003,2020-11-12,\\n4004,2020-11-05,7.0\\n1001,2020-11-19,5.3’\\n\\nF csv2list(s)\\n [[String]] rows\\n L(row) s.split(\\\"\\\\n\\\")\\n rows [+]= row.split(‘,’)\\n R rows\\n\\nV patients = csv2list(patients_csv)\\nV visits = csv2list(visits_csv)\\n\\nV result = copy(patients)\\nresult.sort_range(1..)\\nresult[0].append(‘LAST_VISIT’)\\nV last = Dict(visits[1..], p_vis -> (p_vis[0], p_vis[1]))\\nL(record) 1 .< result.len\\n result[record].append(last.get(result[record][0], ‘’))\\nresult[0] [+]= [‘SCORE_SUM’, ‘SCORE_AVG’]\\n\\nV n = Dict(patients[1..], p -> (p[0], 0))\\nV tot = Dict(patients[1..], p -> (p[0], 0.0))\\n\\nL(record) visits[1..]\\n V p = record[0]\\n V score = record[2]\\n I !score.empty\\n n[p]++\\n tot[p] += Float(score)\\n\\nL(record) 1 .< result.len\\n V p = result[record][0]\\n I n[p] != 0\\n result[record] [+]= [‘#3.1’.format(tot[p]), ‘#2.2’.format(tot[p] / n[p])]\\n E\\n result[record] [+]= [‘’, ‘’]\\n\\nL(record) result\\n print(‘| ’record.map(r -> r.center(10)).join(‘ | ’)‘ |’)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"Merge_and_aggregate(patients, visits){\\n ID := [], LAST_VISIT := [], SCORE_SUM := [], VISIT := []\\n for i, line in StrSplit(patients, \\\"`n\\\", \\\"`r\\\"){\\n if (i=1)\\n continue\\n x := StrSplit(line, \\\",\\\")\\n ID[x.1] := x.2\\n }\\n\\n for i, line in StrSplit(visits, \\\"`n\\\", \\\"`r\\\"){\\n if (i=1)\\n continue\\n x := StrSplit(line, \\\",\\\")\\n LAST_VISIT[x.1] := x.2 > LAST_VISIT[x.1] ? x.2 : LAST_VISIT[x.1]\\n SCORE_SUM[x.1] := (SCORE_SUM[x.1] ? SCORE_SUM[x.1] : 0) + (x.3 ? x.3 : 0)\\n if x.3\\n VISIT[x.1] := (VISIT[x.1] ? VISIT[x.1] : 0) + 1\\n }\\n\\n output := \\\"PATIENT_ID`tLASTNAME`tLAST_VISIT`tSCORE_SUM`tSCORE_AVG`n\\\"\\n for id, name in ID\\n output .= ID \\\"`t\\\" name \\\"`t\\\" LAST_VISIT[id] \\\"`t\\\" SCORE_SUM[id] \\\"`t\\\" SCORE_SUM[id]/VISIT[id] \\\"`n\\\"\\n return output\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"patients =\\n(\\nPATIENT_ID,LASTNAME\\n1001,Hopper\\n4004,Wirth\\n3003,Kemeny\\n2002,Gosling\\n5005,Kurtz\\n)\\n\\nvisits =\\n(\\nPATIENT_ID,VISIT_DATE,SCORE\\n2002,2020-09-10,6.8\\n1001,2020-09-17,5.5\\n4004,2020-09-24,8.4\\n2002,2020-10-08,\\n1001,,6.6\\n3003,2020-11-12,\\n4004,2020-11-05,7.0\\n1001,2020-11-19,5.3\\n)\\n\\nMsgBox % Merge_and_aggregate(patients, visits)\\nreturn\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f MERGE_AND_AGGREGATE_DATASETS.AWK RC-PATIENTS.CSV RC-VISITS.CSV\\n# files may appear in any order\\n#\\n# sorting:\\n# PROCINFO[\\\"sorted_in\\\"] is used by GAWK\\n# SORTTYPE is used by Thompson Automation's TAWK\\n#\\n{ # printf(\\\"%s %s\\\\n\\\",FILENAME,$0) # print input\\n split($0,arr,\\\",\\\")\\n if (FNR == 1) {\\n file = (arr[2] == \\\"LASTNAME\\\") ? \\\"patients\\\" : \\\"visits\\\"\\n next\\n }\\n patient_id_arr[key] = key = arr[1]\\n if (file == \\\"patients\\\") {\\n lastname_arr[key] = arr[2]\\n }\\n else if (file == \\\"visits\\\") {\\n if (arr[2] > visit_date_arr[key]) {\\n visit_date_arr[key] = arr[2]\\n }\\n if (arr[3] != \\\"\\\") {\\n score_arr[key] += arr[3]\\n score_count_arr[key]++\\n }\\n }\\n}\\nEND {\\n print(\\\"\\\")\\n PROCINFO[\\\"sorted_in\\\"] = \\\"@ind_str_asc\\\" ; SORTTYPE = 1\\n fmt = \\\"%-10s %-10s %-10s %9s %9s %6s\\\\n\\\"\\n printf(fmt,\\\"patient_id\\\",\\\"lastname\\\",\\\"last_visit\\\",\\\"score_sum\\\",\\\"score_avg\\\",\\\"scores\\\")\\n for (i in patient_id_arr) {\\n avg = (score_count_arr[i] > 0) ? score_arr[i] / score_count_arr[i] : \\\"\\\"\\n printf(fmt,patient_id_arr[i],lastname_arr[i],visit_date_arr[i],score_arr[i],avg,score_count_arr[i]+0)\\n }\\n exit(0)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <optional>\\n#include <ranges>\\n#include <string>\\n#include <vector>\\n\\nusing namespace std;\\n\\nstruct Patient\\n{\\n string ID;\\n string LastName;\\n};\\n\\nstruct Visit\\n{\\n string PatientID;\\n string Date;\\n optional<float> Score;\\n};\\n\\nint main(void)\\n{\\n auto patients = vector<Patient> {\\n {\\\"1001\\\", \\\"Hopper\\\"},\\n {\\\"4004\\\", \\\"Wirth\\\"},\\n {\\\"3003\\\", \\\"Kemeny\\\"},\\n {\\\"2002\\\", \\\"Gosling\\\"},\\n {\\\"5005\\\", \\\"Kurtz\\\"}};\\n\\n auto visits = vector<Visit> {\\n {\\\"2002\\\", \\\"2020-09-10\\\", 6.8},\\n {\\\"1001\\\", \\\"2020-09-17\\\", 5.5},\\n {\\\"4004\\\", \\\"2020-09-24\\\", 8.4},\\n {\\\"2002\\\", \\\"2020-10-08\\\", },\\n {\\\"1001\\\", \\\"\\\" , 6.6},\\n {\\\"3003\\\", \\\"2020-11-12\\\", },\\n {\\\"4004\\\", \\\"2020-11-05\\\", 7.0},\\n {\\\"1001\\\", \\\"2020-11-19\\\", 5.3}};\\n\\n // sort the patients by ID\\n sort(patients.begin(), patients.end(),\\n [](const auto& a, const auto&b){ return a.ID < b.ID;});\\n\\n cout << \\\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\\\\n\\\";\\n for(const auto& patient : patients)\\n {\\n // loop over all of the patients and determine the fields\\n string lastVisit;\\n float sum = 0;\\n int numScores = 0;\\n\\n // use C++20 ranges to filter the visits by patients\\n auto patientFilter = [&patient](const Visit &v){return v.PatientID == patient.ID;};\\n for(const auto& visit : visits | views::filter( patientFilter ))\\n {\\n if(visit.Score)\\n {\\n sum += *visit.Score;\\n numScores++;\\n }\\n lastVisit = max(lastVisit, visit.Date);\\n }\\n\\n // format the output\\n cout << \\\"| \\\" << patient.ID << \\\" | \\\";\\n cout.width(8); cout << patient.LastName << \\\" | \\\";\\n cout.width(10); cout << lastVisit << \\\" | \\\";\\n if(numScores > 0)\\n {\\n cout.width(9); cout << sum << \\\" | \\\";\\n cout.width(9); cout << (sum / float(numScores));\\n }\\n else cout << \\\" | \\\";\\n cout << \\\" |\\\\n\\\";\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Globalization;\\nusing System.Linq;\\nusing System.Runtime.Serialization;\\n\\npublic static class MergeAndAggregateDatasets\\n{\\n public static void Main()\\n {\\n string patientsCsv = @\\\"\\nPATIENT_ID,LASTNAME\\n1001,Hopper\\n4004,Wirth\\n3003,Kemeny\\n2002,Gosling\\n5005,Kurtz\\\";\\n\\n string visitsCsv = @\\\"\\nPATIENT_ID,VISIT_DATE,SCORE\\n2002,2020-09-10,6.8\\n1001,2020-09-17,5.5\\n4004,2020-09-24,8.4\\n2002,2020-10-08,\\n1001,,6.6\\n3003,2020-11-12,\\n4004,2020-11-05,7.0\\n1001,2020-11-19,5.3\\\";\\n\\n string format = \\\"yyyy-MM-dd\\\";\\n var formatProvider = new DateTimeFormat(format).FormatProvider;\\n\\n var patients = ParseCsv(\\n patientsCsv.Split(Environment.NewLine, StringSplitOptions.RemoveEmptyEntries),\\n line => (PatientId: int.Parse(line[0]), LastName: line[1]));\\n\\n var visits = ParseCsv(\\n visitsCsv.Split(Environment.NewLine, StringSplitOptions.RemoveEmptyEntries),\\n line => (\\n PatientId: int.Parse(line[0]),\\n VisitDate: DateTime.TryParse(line[1], formatProvider, DateTimeStyles.None, out var date) ? date : default(DateTime?),\\n Score: double.TryParse(line[2], out double score) ? score : default(double?)\\n )\\n );\\n\\n var results =\\n patients.GroupJoin(visits,\\n p => p.PatientId,\\n v => v.PatientId,\\n (p, vs) => (\\n p.PatientId,\\n p.LastName,\\n LastVisit: vs.Max(v => v.VisitDate),\\n ScoreSum: vs.Sum(v => v.Score),\\n ScoreAvg: vs.Average(v => v.Score)\\n )\\n ).OrderBy(r => r.PatientId);\\n\\n Console.WriteLine(\\\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\\\");\\n foreach (var r in results) {\\n Console.WriteLine($\\\"| {r.PatientId,-10} | {r.LastName,-8} | {r.LastVisit?.ToString(format) ?? \\\"\\\",-10} | {r.ScoreSum,9} | {r.ScoreAvg,9} |\\\");\\n }\\n }\\n\\n private static IEnumerable<T> ParseCsv<T>(string[] contents, Func<string[], T> constructor)\\n {\\n for (int i = 1; i < contents.Length; i++) {\\n var line = contents[i].Split(',');\\n yield return constructor(line);\\n }\\n }\\n\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"// datetime.cpp\\n#include <ctime>\\n#include <cstdint>\\nextern \\\"C\\\" {\\n int64_t from date(const char* string) {\\n struct tm tmInfo = {0};\\n strptime(string, \\\"%Y-%m-%d\\\", &tmInfo);\\n return mktime(&tmInfo); // localtime\\n }\\n}\\n\",\n \"language\": \"Datalog\"\n },\n {\n \"code\": \"/* rosetta.dl */\\n#define NaN to_float(\\\"NaN\\\")\\n.functor from_date(date:symbol) : number\\n.decl Patient(id:number, lastname:symbol)\\n.decl Visit(id:number, date:symbol, score:float)\\n.decl SummaryDates(id:number, lastname:symbol, last_date:symbol)\\n.decl SummaryScores(id:number, lastname:symbol, score_sum:float, score_mean:float)\\n.decl MissingDates(x:number)\\n\\nPatient(1001,\\\"Hopper\\\").\\nPatient(4004,\\\"Wirth\\\").\\nPatient(3003,\\\"Kemeny\\\").\\nPatient(2002,\\\"Gosling\\\").\\nPatient(5005,\\\"Kurtz\\\").\\n\\nVisit(2002,\\\"2020-09-10\\\",6.8).\\nVisit(1001,\\\"2020-09-17\\\",5.5).\\nVisit(4004,\\\"2020-09-24\\\",8.4).\\nVisit(2002,\\\"2020-10-08\\\",NaN).\\nVisit(1001,\\\"\\\",6.6).\\nVisit(3003,\\\"2020-11-12\\\",NaN).\\nVisit(4004,\\\"2020-11-05\\\",7.0).\\nVisit(1001,\\\"2020-11-19\\\",5.3).\\n\\nMissingDates(@from_date(\\\"\\\")) :- true.\\n\\nSummaryDates(id, lastname, last_date) :-\\n Patient(id,lastname),\\n last_timestamp = max ts: {Visit(id, date, _), ts = @from_date(date), !MissingDates(ts)},\\n Visit(id, last_date, _), last_timestamp = @from_date(last_date).\\nSummaryScores(id, lastname, score_sum, score_mean) :-\\n Patient(id,lastname),\\n score_sum = sum score: {Visit(id, _, score), score != NaN},\\n score_mean = mean score: {Visit(id, _, score), score != NaN}.\\n.output SummaryDates\\n.output SummaryScores\\n\",\n \"language\": \"Datalog\"\n },\n {\n \"code\": \"g++ -shared -fPIC datetime.cpp -o libfunctors.so\\nsouffle -D- rosetta.dl\\n\",\n \"language\": \"Datalog\"\n },\n {\n \"code\": \"// Merge and aggregate datasets. Nigel Galloway: January 6th., 2021\\nlet rFile(fName)=seq{use n=System.IO.File.OpenText(fName)\\n n.ReadLine() |> ignore\\n while not n.EndOfStream do yield n.ReadLine().Split [|','|]}\\nlet N=rFile(\\\"file1.txt\\\") |> Seq.sort\\nlet G=rFile(\\\"file2.txt\\\") |> Seq.groupBy(fun n->n.[0]) |> Map.ofSeq\\nlet fN n i g e l=printfn \\\"| %-10s | %-8s | %10s | %-9s | %-9s |\\\" n i g e l\\nlet fG n g=let z=G.[n]|>Seq.sumBy(fun n->try float n.[2] with :? System.FormatException->0.0)\\n fN n g (G.[n]|>Seq.sort|>Seq.last).[1] (if z=0.0 then \\\"\\\" else string z) (if z=0.0 then \\\"\\\" else string(z/(float(Seq.length G.[n]))))\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"Type Patient\\n ID As String\\n LastName As String\\nEnd Type\\n\\nType Visit\\n PatientID As String\\n Fecha As String\\n Score As Single\\n HasScore As Integer\\nEnd Type\\n\\nDim As Patient patients(5)\\nDim As Visit visits(8)\\n\\npatients(1).ID = \\\"1001\\\": patients(1).LastName = \\\"Hopper\\\"\\npatients(2).ID = \\\"4004\\\": patients(2).LastName = \\\"Wirth\\\"\\npatients(3).ID = \\\"3003\\\": patients(3).LastName = \\\"Kemeny\\\"\\npatients(4).ID = \\\"2002\\\": patients(4).LastName = \\\"Gosling\\\"\\npatients(5).ID = \\\"5005\\\": patients(5).LastName = \\\"Kurtz\\\"\\n\\nvisits(1).PatientID = \\\"2002\\\": visits(1).Fecha = \\\"2020-09-10\\\": visits(1).Score = 6.8: visits(1).HasScore = -1\\nvisits(2).PatientID = \\\"1001\\\": visits(2).Fecha = \\\"2020-09-17\\\": visits(2).Score = 5.5: visits(2).HasScore = -1\\nvisits(3).PatientID = \\\"4004\\\": visits(3).Fecha = \\\"2020-09-24\\\": visits(3).Score = 8.4: visits(3).HasScore = -1\\nvisits(4).PatientID = \\\"2002\\\": visits(4).Fecha = \\\"2020-10-08\\\": visits(4).HasScore = 0\\nvisits(5).PatientID = \\\"1001\\\": visits(5).Fecha = \\\"\\\" : visits(5).Score = 6.6: visits(5).HasScore = -1\\nvisits(6).PatientID = \\\"3003\\\": visits(6).Fecha = \\\"2020-11-12\\\": visits(6).HasScore = 0\\nvisits(7).PatientID = \\\"4004\\\": visits(7).Fecha = \\\"2020-11-05\\\": visits(7).Score = 7.0: visits(7).HasScore = -1\\nvisits(8).PatientID = \\\"1001\\\": visits(8).Fecha = \\\"2020-11-19\\\": visits(8).Score = 5.3: visits(8).HasScore = -1\\n\\nPrint \\\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\\\"\\nFor i As Integer = 1 To 5\\n Dim As String lastVisit = \\\"\\\"\\n Dim As Single sum = 0\\n Dim As Integer numScores = 0\\n For j As Integer = 1 To 8\\n If patients(i).ID = visits(j).PatientID Then\\n If visits(j).HasScore Then\\n sum += visits(j).Score\\n numScores += 1\\n End If\\n If visits(j).Fecha > lastVisit Then\\n lastVisit = visits(j).Fecha\\n End If\\n End If\\n Next j\\n Print \\\"| \\\"; patients(i).ID; \\\" | \\\";\\n Print Using \\\"\\\\ \\\\ | \\\\ \\\\ | \\\"; patients(i).LastName; lastVisit;\\n If numScores > 0 Then\\n Print Using \\\"#######.# | #######.#\\\"; sum; (sum / Csng(numScores));\\n Else\\n Print \\\" | \\\";\\n End If\\n Print \\\" |\\\"\\nNext i\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n \\\"sort\\\"\\n)\\n\\ntype Patient struct {\\n id int\\n lastName string\\n}\\n\\n// maps an id to a lastname\\nvar patientDir = make(map[int]string)\\n\\n// maintains a sorted list of ids\\nvar patientIds []int\\n\\nfunc patientNew(id int, lastName string) Patient {\\n patientDir[id] = lastName\\n patientIds = append(patientIds, id)\\n sort.Ints(patientIds)\\n return Patient{id, lastName}\\n}\\n\\ntype DS struct {\\n dates []string\\n scores []float64\\n}\\n\\ntype Visit struct {\\n id int\\n date string\\n score float64\\n}\\n\\n// maps an id to lists of dates and scores\\nvar visitDir = make(map[int]DS)\\n\\nfunc visitNew(id int, date string, score float64) Visit {\\n if date == \\\"\\\" {\\n date = \\\"0000-00-00\\\"\\n }\\n v, ok := visitDir[id]\\n if ok {\\n v.dates = append(v.dates, date)\\n v.scores = append(v.scores, score)\\n visitDir[id] = DS{v.dates, v.scores}\\n } else {\\n visitDir[id] = DS{[]string{date}, []float64{score}}\\n }\\n return Visit{id, date, score}\\n}\\n\\ntype Merge struct{ id int }\\n\\nfunc (m Merge) lastName() string { return patientDir[m.id] }\\nfunc (m Merge) dates() []string { return visitDir[m.id].dates }\\nfunc (m Merge) scores() []float64 { return visitDir[m.id].scores }\\n\\nfunc (m Merge) lastVisit() string {\\n dates := m.dates()\\n dates2 := make([]string, len(dates))\\n copy(dates2, dates)\\n sort.Strings(dates2)\\n return dates2[len(dates2)-1]\\n}\\n\\nfunc (m Merge) scoreSum() float64 {\\n sum := 0.0\\n for _, score := range m.scores() {\\n if score != -1 {\\n sum += score\\n }\\n }\\n return sum\\n}\\n\\nfunc (m Merge) scoreAvg() float64 {\\n count := 0\\n for _, score := range m.scores() {\\n if score != -1 {\\n count++\\n }\\n }\\n return m.scoreSum() / float64(count)\\n}\\n\\nfunc mergePrint(merges []Merge) {\\n fmt.Println(\\\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\\\")\\n f := \\\"| %d | %-7s | %s | %4s | %4s |\\\\n\\\"\\n for _, m := range merges {\\n _, ok := visitDir[m.id]\\n if ok {\\n lv := m.lastVisit()\\n if lv == \\\"0000-00-00\\\" {\\n lv = \\\" \\\"\\n }\\n scoreSum := m.scoreSum()\\n ss := fmt.Sprintf(\\\"%4.1f\\\", scoreSum)\\n if scoreSum == 0 {\\n ss = \\\" \\\"\\n }\\n scoreAvg := m.scoreAvg()\\n sa := \\\" \\\"\\n if !math.IsNaN(scoreAvg) {\\n sa = fmt.Sprintf(\\\"%4.2f\\\", scoreAvg)\\n }\\n fmt.Printf(f, m.id, m.lastName(), lv, ss, sa)\\n } else {\\n fmt.Printf(f, m.id, m.lastName(), \\\" \\\", \\\" \\\", \\\" \\\")\\n }\\n }\\n}\\n\\nfunc main() {\\n patientNew(1001, \\\"Hopper\\\")\\n patientNew(4004, \\\"Wirth\\\")\\n patientNew(3003, \\\"Kemeny\\\")\\n patientNew(2002, \\\"Gosling\\\")\\n patientNew(5005, \\\"Kurtz\\\")\\n\\n visitNew(2002, \\\"2020-09-10\\\", 6.8)\\n visitNew(1001, \\\"2020-09-17\\\", 5.5)\\n visitNew(4004, \\\"2020-09-24\\\", 8.4)\\n visitNew(2002, \\\"2020-10-08\\\", -1) // -1 signifies no score\\n visitNew(1001, \\\"\\\", 6.6) // \\\"\\\" signifies no date\\n visitNew(3003, \\\"2020-11-12\\\", -1)\\n visitNew(4004, \\\"2020-11-05\\\", 7.0)\\n visitNew(1001, \\\"2020-11-19\\\", 5.3)\\n\\n merges := make([]Merge, len(patientIds))\\n for i, id := range patientIds {\\n merges[i] = Merge{id}\\n }\\n mergePrint(merges)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"#xcommand INSERT INTO <table> ( <uField1>[, <uFieldN> ] ) VALUE ( <uVal1>[, <uValN> ] ) => ;\\n <table>->(dbAppend()); <table>-><uField1> := <uVal1> [; <table>-><uFieldN> := <uValN>]\\n#xcommand INSERT INTO <table> ( <uFieldList,...> ) VALUES ( <uValList1,...> ) [, ( <uValListN,...> )] => ;\\n INSERT INTO <table> ( <uFieldList> ) VALUE ( <uValList1> ) ;\\n [; INSERT INTO <table> ( <uFieldList> ) VALUE ( <uValListN> )]\\n&& Singular cases (so we can use VALUES for all instances)\\n#xcommand INSERT INTO <table> (<uField>) VALUE (<uVal>) => ;\\n <table>->(dbAppend()); <table>-><uField> := <uVal>\\n#xcommand INSERT INTO <table> ( <uFieldList,...> ) VALUES ( <uValList,...> ) => ;\\n INSERT INTO <table> ( <uFieldList> ) VALUE ( <uValList> )\\n\\nPROCEDURE Main()\\nLOCAL pStruct, vStruct, rStruct, xCurId, aAgg\\n\\n SET DATE FORMAT \\\"yyyy-mm-dd\\\"\\n\\n && create and populate the patient table\\n pStruct := {{\\\"patient_id\\\", \\\"n\\\", 8, 0}, {\\\"lastname\\\", \\\"c\\\", 10, 0 }}\\n dbCreate( \\\"patient\\\", pStruct,, .T., \\\"patient\\\" )\\n INSERT INTO patient (patient_id, lastname) VALUES (1001, \\\"Hopper\\\"), (4004, \\\"Wirth\\\"), ;\\n (3003, \\\"Kemeny\\\"), (2002, \\\"Gosling\\\"), (5005, \\\"Kurtz\\\")\\n INDEX ON patient_id TO pat_id\\n\\n && create and populate the visit table\\n vStruct := {{\\\"patient_id\\\", \\\"n\\\", 8, 0}, {\\\"visit_date\\\", \\\"d\\\", 10, 0}, {\\\"score\\\", \\\"n\\\", 8, 1}}\\n dbCreate( \\\"visit\\\", vStruct,, .T., \\\"visit\\\" )\\n INSERT INTO visit (patient_id, visit_date, score) VALUES (2002, ctod(\\\"2020-09-10\\\"), 6.8), ;\\n (1001, ctod(\\\"2020-09-17\\\"), 5.5), (4004, ctod(\\\"2020-09-24\\\"), 8.4), ;\\n (2002, ctod(\\\"2020-10-08\\\"), -999), (1001, ctod(\\\"1900-01-01\\\"), 6.6), ;\\n (3003, ctod(\\\"2020-11-12\\\"), -999), (4004, ctod(\\\"2020-11-05\\\"), 7.0), ;\\n (1001, ctod(\\\"2020-11-19\\\"), 5.3)\\n INDEX ON patient_id TO visit_id\\n\\n && create the result table\\n rStruct := { {\\\"patient_id\\\", \\\"n\\\", 8, 0}, ;\\n {\\\"n\\\", \\\"i\\\", 8, 0}, {\\\"sum_score\\\", \\\"n\\\", 8, 1}, ;\\n {\\\"avg_score\\\", \\\"n\\\", 8, 1}, {\\\"max_date\\\", \\\"d\\\", 10, 0}}\\n dbCreate(\\\"report\\\", rStruct,, .T., \\\"report\\\")\\n\\n SELECT visit\\n DO WHILE ! Eof()\\n xCurId := patient_id && grouping variable\\n aAgg := {0, 0, 0.0, ctod(\\\"1900-01-01\\\")} && initial values\\n DO WHILE ! Eof() .AND. xCurId == patient_id\\n\\t aAgg := {1+aAgg[1], iif(score==-999,aAgg[2],1+aAgg[2]), ;\\n\\t iif(score==-999, aAgg[3], score+aAgg[3]), max(visit_date, aAgg[4])} && update\\n\\t SKIP\\n ENDDO\\n INSERT INTO report (patient_id, n, sum_score, avg_score, max_date) ;\\n VALUES (xCurId, aAgg[1], aAgg[3], aAgg[3]/aAgg[2], aAgg[4])\\n ENDDO\\n\\n SELECT report\\n INDEX ON patient_id TO report_id\\n\\n SELECT patient\\n SET RELATION TO patient_id INTO report\\n ? \\\"NUM\\\", \\\"PATIENT_ID\\\", \\\"LASTNAME\\\", \\\"N\\\", \\\"SUM_SCORE\\\", \\\"AVG_SCORE\\\", \\\"MAX_DATE\\\"\\n LIST patient_id, lastname, report->n, report->sum_score, report->avg_score, report->max_date\\n\\n RETURN\\n\",\n \"language\": \"Harbour\"\n },\n {\n \"code\": \"import Data.List\\nimport Data.Maybe\\nimport System.IO (readFile)\\nimport Text.Read (readMaybe)\\nimport Control.Applicative ((<|>))\\n\\n------------------------------------------------------------\\n\\nnewtype DB = DB { entries :: [Patient] }\\n deriving Show\\n\\ninstance Semigroup DB where\\n DB a <> DB b = normalize $ a <> b\\n\\ninstance Monoid DB where\\n mempty = DB []\\n\\nnormalize :: [Patient] -> DB\\nnormalize = DB\\n . map mconcat\\n . groupBy (\\\\x y -> pid x == pid y)\\n . sortOn pid\\n\\n------------------------------------------------------------\\n\\ndata Patient = Patient { pid :: String\\n , name :: Maybe String\\n , visits :: [String]\\n , scores :: [Float] }\\n deriving Show\\n\\ninstance Semigroup Patient where\\n Patient p1 n1 v1 s1 <> Patient p2 n2 v2 s2 =\\n Patient (fromJust $ Just p1 <|> Just p2)\\n (n1 <|> n2)\\n (v1 <|> v2)\\n (s1 <|> s2)\\n\\ninstance Monoid Patient where\\n mempty = Patient mempty mempty mempty mempty\\n\\n------------------------------------------------------------\\n\\nreadDB :: String -> DB\\nreadDB = normalize\\n . mapMaybe readPatient\\n . readCSV\\n\\nreadPatient r = do\\n i <- lookup \\\"PATIENT_ID\\\" r\\n let n = lookup \\\"LASTNAME\\\" r\\n let d = lookup \\\"VISIT_DATE\\\" r >>= readDate\\n let s = lookup \\\"SCORE\\\" r >>= readMaybe\\n return $ Patient i n (maybeToList d) (maybeToList s)\\n where\\n readDate [] = Nothing\\n readDate d = Just d\\n\\nreadCSV :: String -> [(String, String)]\\nreadCSV txt = zip header <$> body\\n where\\n header:body = splitBy ',' <$> lines txt\\n splitBy ch = unfoldr go\\n where\\n go [] = Nothing\\n go s = Just $ drop 1 <$> span (/= ch) s\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"tabulateDB (DB ps) header cols = intercalate \\\"|\\\" <$> body\\n where\\n body = transpose $ zipWith pad width table\\n table = transpose $ header : map showPatient ps\\n showPatient p = sequence cols p\\n width = maximum . map length <$> table\\n pad n col = (' ' :) . take (n+1) . (++ repeat ' ') <$> col\\n\\nmain = do\\n a <- readDB <$> readFile \\\"patients.csv\\\"\\n b <- readDB <$> readFile \\\"visits.csv\\\"\\n mapM_ putStrLn $ tabulateDB (a <> b) header fields\\n where\\n header = [ \\\"PATIENT_ID\\\", \\\"LASTNAME\\\", \\\"VISIT_DATE\\\"\\n , \\\"SCORES SUM\\\",\\\"SCORES AVG\\\"]\\n fields = [ pid\\n , fromMaybe [] . name\\n , \\\\p -> case visits p of {[] -> []; l -> last l}\\n , \\\\p -> case scores p of {[] -> []; s -> show (sum s)}\\n , \\\\p -> case scores p of {[] -> []; s -> show (mean s)} ]\\n\\n mean lst = sum lst / genericLength lst\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"NB. setup:\\nrequire'jd pacman'\\nload JDP,'tools/csv_load.ijs'\\nF=: jpath '~temp/rosettacode/example/CSV'\\njdcreatefolder_jd_ CSVFOLDER=: F\\n\\nassert 0<{{)n\\nPATIENTID,LASTNAME\\n1001,Hopper\\n4004,Wirth\\n3003,Kemeny\\n2002,Gosling\\n5005,Kurtz\\n}} fwrite F,'patients.csv'\\n\\nassert 0<{{)n\\nPATIENTID,VISIT_DATE,SCORE\\n2002,2020-09-10,6.8\\n1001,2020-09-17,5.5\\n4004,2020-09-24,8.4\\n2002,2020-10-08,\\n1001,,6.6\\n3003,2020-11-12,\\n4004,2020-11-05,7.0\\n1001,2020-11-19,5.3\\n}} fwrite F,'visits.csv'\\n\\ncsvprepare 'patients';F,'patients.csv'\\ncsvprepare 'visits';F,'visits.csv'\\n\\ncsvload 'patients';1\\ncsvload 'visits';1\\n\\njd'ref patients PATIENTID visits PATIENTID'\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"require'jd'\\n\\necho jd {{)n\\n reads\\n PATIENT_ID: first p.PATIENTID,\\n LASTNAME: first p.LASTNAME,\\n LAST_VISIT: max v.VISIT_DATE,\\n SCORE_SUM: sum v.SCORE,\\n SCORE_AVG: avg v.SCORE\\n by\\n p.PATIENTID\\n from\\n p:patients,\\n v:p.visits\\n}} -.LF\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"require'csv'\\npatients=: fixcsv {{)n\\nPATIENTID,LASTNAME\\n1001,Hopper\\n4004,Wirth\\n3003,Kemeny\\n2002,Gosling\\n5005,Kurtz\\n}}\\n\\nvisits=: fixcsv {{)n\\nPATIENTID,VISIT_DATE,SCORE\\n2002,2020-09-10,6.8\\n1001,2020-09-17,5.5\\n4004,2020-09-24,8.4\\n2002,2020-10-08,\\n1001,,6.6\\n3003,2020-11-12,\\n4004,2020-11-05,7.0\\n1001,2020-11-19,5.3\\n}}\\n\\ntask=: {{\\n P=. <@:>\\\"1|:/:~}.patients\\n V=. <@:>\\\"1|:/:~}.visits\\n id=. 0 {:: P\\n nm=. 1 {:: P\\n sel1=. (0 {:: P) e. 0 {:: V\\n sel2=. (~.0 {:: V) e. 0 {:: P NB. unnecessary for this example\\n exp=. sel1 #inv sel2 # ]\\n agg=. /.(&.:\\\".)\\n vdt=. exp (0 {:: V) {:/. 1 {:: V\\n sum=. exp \\\":,.(0 {:: V) +//. 0\\\". 2 {:: V\\n avg=. exp \\\":,.(0 {:: V) (+/%#)/. 0\\\". 2 {:: V\\n labels=. ;:'PATIENT_ID LASTNAME LAST_VISIT SCORE_SUM SCORE_AVG'\\n labels,:id;nm;vdt;sum;avg\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" task''\\n┌──────────┬────────┬──────────┬─────────┬─────────┐\\n│PATIENT_ID│LASTNAME│LAST_VISIT│SCORE_SUM│SCORE_AVG│\\n├──────────┼────────┼──────────┼─────────┼─────────┤\\n│1001 │Hopper │2020-11-19│17.4 │5.8 │\\n│2002 │Gosling │2020-10-08│ 6.8 │3.4 │\\n│3003 │Kemeny │2020-11-12│ 0 │ 0 │\\n│4004 │Wirth │2020-11-05│15.4 │7.7 │\\n│5005 │Kurtz │ │ │ │\\n└──────────┴────────┴──────────┴─────────┴─────────┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"task=: {{\\n P=. <@:>\\\"1|:/:~}.patients\\n V=. <@:>\\\"1|:/:~}.visits\\n id=. 0 {:: P\\n nm=. 1 {:: P\\n sel1=. (0 {:: P) e. 0 {:: V\\n sel2=. (~.0 {:: V) e. 0 {:: P NB. unnecessary for this example\\n exp=. sel1 #inv sel2 # ]\\n agg=. /.(&.:\\\".)\\n vdt=. exp (0 {:: V) {:/. 1 {:: V\\n sel3=. (0 {:: V) +.//. 2 *@#@{::\\\"1 }.visits\\n exp2=: [:exp sel3 #inv sel3 #]\\n sum=. exp2 \\\":,.(0 {:: V) +//. 0\\\". 2 {:: V\\n avg=. exp2 \\\":,.(0 {:: V) (+/%#)/. 0\\\". 2 {:: V\\n labels=. ;:'PATIENT_ID LASTNAME LAST_VISIT SCORE_SUM SCORE_AVG'\\n labels,:id;nm;vdt;sum;avg\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" task''\\n┌──────────┬────────┬──────────┬─────────┬─────────┐\\n│PATIENT_ID│LASTNAME│LAST_VISIT│SCORE_SUM│SCORE_AVG│\\n├──────────┼────────┼──────────┼─────────┼─────────┤\\n│1001 │Hopper │2020-11-19│17.4 │5.8 │\\n│2002 │Gosling │2020-10-08│ 6.8 │3.4 │\\n│3003 │Kemeny │2020-11-12│ │ │\\n│4004 │Wirth │2020-11-05│15.4 │7.7 │\\n│5005 │Kurtz │ │ │ │\\n└──────────┴────────┴──────────┴─────────┴─────────┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.Arrays;\\nimport java.util.Collections;\\nimport java.util.Comparator;\\nimport java.util.DoubleSummaryStatistics;\\nimport java.util.List;\\n\\npublic final class MergeAndAggregateDatasets {\\n\\n\\tpublic static void main(String[] args) {\\n\\t\\tList<Patient> patients = Arrays.asList(\\n\\t\\t\\tnew Patient(\\\"1001\\\", \\\"Hopper\\\"),\\n\\t\\t\\tnew Patient(\\\"4004\\\", \\\"Wirth\\\"),\\n\\t\\t\\tnew Patient(\\\"3003\\\", \\\"Kemeny\\\"),\\n\\t\\t\\tnew Patient(\\\"2002\\\", \\\"Gosling\\\"),\\n\\t\\t\\tnew Patient(\\\"5005\\\", \\\"Kurtz\\\") );\\n\\n\\t\\tList<Visit> visits = Arrays.asList(\\t\\t\\t\\t\\n\\t\\t new Visit(\\\"2002\\\", \\\"2020-09-10\\\", 6.8),\\n\\t\\t new Visit(\\\"1001\\\", \\\"2020-09-17\\\", 5.5),\\n\\t\\t new Visit(\\\"4004\\\", \\\"2020-09-24\\\", 8.4),\\n\\t\\t new Visit(\\\"2002\\\", \\\"2020-10-08\\\", null),\\n\\t\\t new Visit(\\\"1001\\\", \\\"\\\" , 6.6),\\n\\t\\t new Visit(\\\"3003\\\", \\\"2020-11-12\\\", null),\\n\\t\\t new Visit(\\\"4004\\\", \\\"2020-11-05\\\", 7.0),\\n\\t\\t new Visit(\\\"1001\\\", \\\"2020-11-19\\\", 5.3) );\\n\\t\\t\\n\\t\\tCollections.sort(patients, Comparator.comparing(Patient::patientID));\\t\\t\\n\\t\\tSystem.out.println(\\\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\\\");\\t\\t\\n\\t for ( Patient patient : patients ) {\\t \\t\\n\\t \\tList<Visit> patientVisits = visits.stream().filter( v -> v.visitID == patient.patientID() ).toList();\\n\\t \\tString lastVisit = patientVisits.stream()\\n\\t \\t\\t.map( v -> v.visitDate ).max(Comparator.naturalOrder()).orElseGet( () -> \\\" None \\\" );\\t \\t\\n\\t \\tDoubleSummaryStatistics statistics = patientVisits.stream()\\n\\t \\t\\t.filter( v -> v.score != null ).mapToDouble(Visit::score).summaryStatistics();\\t \\t\\t \\t\\n\\t \\tdouble scoreSum = statistics.getSum();\\n\\t \\tdouble scoreAverage = statistics.getAverage();\\t \\t\\n\\t \\tString patientDetails = String.format(\\\"%12s%11s%13s%12.2f%12.2f\\\",\\n\\t \\t\\tpatient.patientID, patient.lastName, lastVisit, scoreSum, scoreAverage);\\t \\t\\n\\t \\tSystem.out.println(patientDetails);\\n\\t }\\n\\n private static record Patient(String patientID, String lastName) {};\\n\\t private static record Visit(String visitID, String visitDate, Double score) {};\\n\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# objectify/1 takes an array of atomic values as inputs, and packages\\n# these into an object with keys specified by the \\\"headers\\\" array and\\n# values obtained by trimming string values, replacing empty strings\\n# by null, and converting strings to numbers if possible.\\ndef objectify(headers):\\n def tonumberq: tonumber? // .;\\n def trimq: if type == \\\"string\\\" then sub(\\\"^ +\\\";\\\"\\\") | sub(\\\" +$\\\";\\\"\\\") else . end;\\n def tonullq: if . == \\\"\\\" then null else . end;\\n . as $in\\n | reduce range(0; headers|length) as $i\\n ({}; .[headers[$i]] = ($in[$i] | trimq | tonumberq | tonullq) );\\n\\ndef csv2jsonHelper:\\n .[0] as $headers\\n | reduce (.[1:][] | select(length > 0) ) as $row\\n ([]; . + [ $row|objectify($headers) ]);\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# output {LAST_VISIT}\\ndef LAST_VISIT($patient_id):\\n {LAST_VISIT: (map(select( .PATIENT_ID == $patient_id).VISIT_DATE) | max)};\\n\\n# output {SCORE_SUM, SCORE_AVG}\\ndef SCORE_SUMMARY($patient_id):\\n map(select( .PATIENT_ID == $patient_id).SCORE)\\n | {SCORE_SUM: add, count: length}\\n | {SCORE_SUM, SCORE_AVG: (if .SCORE_SUM and .count > 0 then .SCORE_SUM/.count else null end)};\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Read the two tables:\\nINDEX($patients | [splits(\\\"\\\\n\\\")] | map(split(\\\",\\\")) | csv2jsonHelper[]; .PATIENT_ID) as $patients\\n| ($visits | [splits(\\\"\\\\n\\\")] | map(split(\\\",\\\")) | csv2jsonHelper) as $visits\\n# Construct the new table:\\n| $visits\\n| map(.PATIENT_ID as $PATIENT_ID\\n | {$PATIENT_ID} +\\n ($visits | {LASTNAME: $patients[$PATIENT_ID|tostring]} + LAST_VISIT($PATIENT_ID) + SCORE_SUMMARY($PATIENT_ID)))\\n# ... but display it as a sequence of JSON objects\\n| .[]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using CSV, DataFrames, Statistics\\n\\n# load data from csv files\\n#df_patients = CSV.read(\\\"patients.csv\\\", DataFrame)\\n#df_visits = CSV.read(\\\"visits.csv\\\", DataFrame)\\n\\n# create DataFrames from text that is hard coded, so use IOBuffer(String) as input\\nstr_patients = IOBuffer(\\\"\\\"\\\"PATIENT_ID,LASTNAME\\n1001,Hopper\\n4004,Wirth\\n3003,Kemeny\\n2002,Gosling\\n5005,Kurtz\\n\\\"\\\"\\\")\\ndf_patients = CSV.read(str_patients, DataFrame)\\nstr_visits = IOBuffer(\\\"\\\"\\\"PATIENT_ID,VISIT_DATE,SCORE\\n2002,2020-09-10,6.8\\n1001,2020-09-17,5.5\\n4004,2020-09-24,8.4\\n2002,2020-10-08,\\n1001,,6.6\\n3003,2020-11-12,\\n4004,2020-11-05,7.0\\n1001,2020-11-19,5.3\\n\\\"\\\"\\\")\\ndf_visits = CSV.read(str_visits, DataFrame)\\n\\n# merge on PATIENT_ID, using an :outer join or we lose Kurtz, who has no data, sort by ID\\ndf_merge = sort(join(df_patients, df_visits, on=\\\"PATIENT_ID\\\", kind=:outer), (:PATIENT_ID,))\\n\\nfnonmissing(a, f) = isempty(a) ? [] : isempty(skipmissing(a)) ? a[1] : f(skipmissing(a))\\n\\n# group by patient id / last name and then aggregate to get latest visit and mean score\\ndf_result = by(df_merge, [:PATIENT_ID, :LASTNAME]) do df\\n DataFrame(LATEST_VISIT = fnonmissing(df[:VISIT_DATE], maximum),\\n SUM_SCORE = fnonmissing(df[:SCORE], sum),\\n MEAN_SCORE = fnonmissing(df[:SCORE], mean))\\nend\\nprintln(df_result)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"a = ImportString[\\\"PATIENT_ID,LASTNAME\\n1001,Hopper\\n4004,Wirth\\n3003,Kemeny\\n2002,Gosling\\n5005,Kurtz\\\", \\\"CSV\\\"];\\nb = ImportString[\\\"PATIENT_ID,VISIT_DATE,SCORE\\n2002,2020-09-10,6.8\\n1001,2020-09-17,5.5\\n4004,2020-09-24,8.4\\n2002,2020-10-08,\\n1001,,6.6\\n3003,2020-11-12,\\n4004,2020-11-05,7.0\\n1001,2020-11-19,5.3\\\", \\\"CSV\\\"];\\na = <|a[[1, 1]] -> #1, a[[1, 2]] -> #2|> & @@@ Rest[a];\\nb = <|b[[1, 1]] -> #1, b[[1, 2]] -> If[#2 != \\\"\\\", DateObject[#2], Missing[]], b[[1, 3]] -> If[#3 =!= \\\"\\\", #3, Missing[]]|> & @@@ Rest[b];\\nj = JoinAcross[a, b, Key[\\\"PATIENT_ID\\\"], \\\"Outer\\\"];\\ngr = GroupBy[j, #[\\\"PATIENT_ID\\\"] &];\\n<|\\\"PATIENT_ID\\\" -> #[[1, \\\"PATIENT_ID\\\"]],\\n \\\"LASTNAME\\\" -> #[[1, \\\"LASTNAME\\\"]],\\n \\\"VISIT_DATE\\\" -> If[DeleteMissing[#[[All, \\\"VISIT_DATE\\\"]]] =!= {}, Max@DeleteMissing[#[[All, \\\"VISIT_DATE\\\"]]], Missing[]],\\n \\\"SCORE_SUM\\\" -> If[DeleteMissing@#[[All, \\\"SCORE\\\"]] =!= {}, Total@DeleteMissing@#[[All, \\\"SCORE\\\"]], Missing[]],\\n \\\"SCORE_AVG\\\" -> If[DeleteMissing@#[[All, \\\"SCORE\\\"]] =!= {}, Mean@DeleteMissing@#[[All, \\\"SCORE\\\"]], Missing[]]|> & /@\\n gr // Dataset\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \":- module rosetta.\\n\\n:- interface.\\n:- import_module io.\\n:- pred main(io::di, io::uo) is det.\\n\\n:- implementation.\\n:- import_module list, int, float, string, maybe, solutions.\\n\\n:- pred patient(int::out, string::out) is multi.\\npatient(1001, \\\"Hopper\\\").\\npatient(4004, \\\"Wirth\\\").\\npatient(3003, \\\"Kemeny\\\").\\npatient(2002, \\\"Gosling\\\").\\npatient(5005, \\\"Kurtz\\\").\\n\\n:- func nan = float.\\nnan = det_to_float(\\\"NaN\\\").\\n\\n:- type maybe_date ---> date(year::int, month::int, day::int); no.\\n\\n:- pred visit(int::out, maybe_date::out, float::out) is multi.\\nvisit(2002, date(2020,09,10), 6.8).\\nvisit(1001, date(2020,09,17), 5.5).\\nvisit(4004, date(2020,09,24), 8.4).\\nvisit(2002, date(2020,10,08), nan).\\nvisit(1001, no, 6.6).\\nvisit(3003, date(2020,11,12), nan).\\nvisit(4004, date(2020,11,05), 7.0).\\nvisit(1001, date(2020,11,19), 5.3).\\n\\n%% Utilities\\n:- pred bag_aggr(pred(T)::(pred(out) is nondet), pred(T,U,U)::pred(in,in,out) is det,\\n\\t\\t U::in, U::out) is det.\\n:- pred bag_count(pred(T)::(pred(out) is nondet), int::out) is det.\\n:- pred bag_sum(pred(float)::(pred(out) is nondet), float::out) is det.\\n:- pred bag_avg(pred(float)::(pred(out) is nondet), float::out) is det.\\n:- pred bag_max(pred(T)::(pred(out) is nondet), T::in, T::out) is det.\\n:- pred bag_max_date(pred(maybe_date)::(pred(out) is nondet), maybe_date::out) is det.\\nbag_aggr(Predicate, Aggregator, Initial, Result) :-\\n promise_equivalent_solutions[Result] (\\n\\tunsorted_aggregate(Predicate, Aggregator, Initial, Result)).\\nbag_count(Predicate, Count) :-\\n bag_aggr(Predicate, (pred(_X::in,Y::in,Z::out) is det :- Z = Y+1), 0, Count).\\nbag_sum(Predicate, Sum) :-\\n bag_aggr(Predicate, (pred(X::in,Y::in,Z::out) is det :- Z = X+Y), 0.0, Sum).\\nbag_avg(Predicate, Avg) :-\\n bag_count(Predicate, N),\\n bag_sum(Predicate, Sum),\\n (if N = 0 then Avg = nan else Avg = Sum/float(N)).\\nbag_max(Predicate, Initial, Max) :-\\n bag_aggr(Predicate,\\n\\t (pred(X::in,Y::in,Z::out) is det :-\\n\\t\\t compare(R,X,Y),\\n\\t\\t (if R = (>) then Z = X else Z = Y)),\\n\\t Initial, Max).\\nbag_max_date(Predicate, MaxDate) :-\\n bag_max(Predicate, date(0,0,0), MaxDate1),\\n (if MaxDate1 = date(0,0,0) then MaxDate = no else MaxDate = MaxDate1).\\n\\nmain(!IO) :-\\n print_line(\\\"{Id, Lastname, SumScores, AvgScores, MaxDate}:\\\", !IO),\\n aggregate((pred({Id,Lastname,Sum,Avg,MaxDate}::out) is nondet :-\\n\\t patient(Id,Lastname),\\n\\t Scores = (pred(Score::out) is nondet :- visit(Id,_,Score), \\\\+is_nan(Score)),\\n\\t bag_avg(Scores, Avg),\\n\\t \\t bag_sum(Scores, Sum),\\n\\t Dates = (pred(Date::out) is nondet :- visit(Id,Date,_), Date\\\\=no),\\n\\t bag_max_date(Dates, MaxDate)),\\n\\t print_line,\\n\\t !IO).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"import algorithm, parsecsv, strformat, strutils, tables\\n\\nconst NoValue = -1.0\\n\\ntype\\n\\n Names = OrderedTable[Positive, string] # Mapping id -> last name.\\n\\n Visit = tuple[date: string; score: float]\\n Visits = Table[Positive, seq[Visit]] # Mapping id -> list of visits.\\n\\n\\nproc readNames(path: string): Names =\\n ## Read the records (id, lastname) from the CSV file and fill a Names table.\\n var parser: CsvParser\\n parser.open(path)\\n parser.readHeaderRow()\\n while parser.readRow():\\n let id = parser.row[0].parseInt\\n let name = parser.row[1]\\n result[id] = name\\n\\nproc readVisits(path: string): Visits =\\n ## Read the records (id, date, score) from the CSV file and fill a Visits table.\\n var parser: CsvParser\\n parser.open(path)\\n parser.readHeaderRow()\\n while parser.readRow():\\n let id = parser.row[0].parseInt\\n let date = parser.row[1]\\n let score = if parser.row[2].len == 0: NoValue else: parser.row[2].parseFloat\\n result.mgetOrPut(id, @[]).add (date, score)\\n\\n\\nvar\\n names = readNames(\\\"patients1.csv\\\")\\n visits = readVisits(\\\"patients2.csv\\\")\\n\\nnames.sort(system.cmp)\\n\\necho \\\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\\\"\\nfor (id, name) in names.pairs:\\n let visitList = visits.getOrDefault(id).sorted()\\n let lastVisit = if visitList.len == 0: \\\"\\\" else: visitList[^1].date\\n var sum = 0.0\\n var count = 0\\n for visit in visitList:\\n if visit.score != NoValue:\\n sum += visit.score\\n inc count\\n let scoreSum = if count == 0: \\\"\\\" else: &\\\"{sum:>4.1f}\\\"\\n let scoreAvg = if count == 0: \\\"\\\" else: &\\\"{sum / count.toFloat: >4.2f}\\\"\\n echo &\\\"| {id:^10} | {name:^10} | {lastVisit:^10} | {scoreSum:>7} | {scoreAvg:>6} |\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"import parseCsv, db_sqlite, sequtils, strutils\\n\\nconst FNames = [\\\"patients1.csv\\\", \\\"patients2.csv\\\"]\\n\\nproc createTableHeaders(conn: DbConn) =\\n conn.exec(sql\\\"CREATE TABLE names(PATIENT_ID INT, LASTNAME TEXT);\\\")\\n conn.exec(sql\\\"CREATE TABLE visits(PATIENT_ID INT, VISIT_DATE DATE, SCORE NUMERIC(4,1));\\\")\\n\\n\\nproc fillTables(dbc: DbConn) =\\n for idx, fname in FNames:\\n dbc.exec(sql\\\"BEGIN\\\")\\n var parser: CsvParser\\n parser.open(fname)\\n parser.readHeaderRow()\\n while parser.readRow():\\n if idx == 0: # \\\"names\\\" table.\\n dbc.exec(sql\\\"INSERT INTO names VALUES (?, ?);\\\", parser.row)\\n else: # \\\"visits\\\" table\\n dbc.exec(sql\\\"INSERT INTO visits VALUES (?, ?, ?);\\\", parser.row)\\n dbc.exec(sql\\\"COMMIT\\\")\\n\\n\\nproc joinTablesAndGroup(dbc: DbConn): seq[Row] =\\n dbc.exec(sql\\\"\\\"\\\"CREATE TABLE answer AS\\n SELECT\\n names.PATIENT_ID,\\n names.LASTNAME,\\n MAX(VISIT_DATE) AS LAST_VISIT,\\n SUM(SCORE) AS SCORE_SUM,\\n CAST(AVG(SCORE) AS DECIMAL(10,2)) AS SCORE_AVG\\n FROM\\n names\\n LEFT JOIN visits\\n ON visits.PATIENT_ID = names.PATIENT_ID\\n GROUP BY\\n names.PATIENT_ID,\\n names.LASTNAME\\n ORDER BY\\n names.PATIENT_ID;\\\"\\\"\\\")\\n result = dbc.getAllRows(sql\\\"SELECT * FROM ANSWER\\\")\\n\\n# Build the database and execute the request to get the result.\\nlet dbc = open(\\\":memory:\\\", \\\"\\\", \\\"\\\", \\\"\\\")\\ndbc.createTableHeaders()\\ndbc.fillTables()\\nlet result = dbc.joinTablesAndGroup()\\ndbc.close()\\n\\n# Print the result.\\necho \\\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\\\"\\nfor row in result:\\n echo \\\"| \\\" & row.mapit(it.center(10)).join(\\\" | \\\") & '|'\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\nmy $fmt = '| %-11s' x 5 . \\\"|\\\\n\\\";\\nprintf $fmt, qw( PATIENT_ID LASTNAME LAST_VISIT SCORE_SUM SCORE_AVG);\\nmy ($names, $visits) = do { local $/; split /^\\\\n/m, <DATA> };\\nmy %score;\\nfor ( $visits =~ /^\\\\d.*/gm )\\n {\\n my ($id, undef, $score) = split /,/;\\n $score{$id} //= ['', ''];\\n $score and $score{$id}[0]++, $score{$id}[1] += $score;\\n }\\nfor ( sort $names =~ /^\\\\d.*/gm )\\n {\\n my ($id, $name) = split /,/;\\n printf $fmt, $id, $name, ( sort $visits =~ /^$id,(.*?),/gm, '' )[-1],\\n $score{$id}[0]\\n ? ( $score{$id}[1], $score{$id}[1] / $score{$id}[0])\\n : ('', '');\\n }\\n\\n__DATA__\\nPATIENT_ID,LASTNAME\\n1001,Hopper\\n4004,Wirth\\n3003,Kemeny\\n2002,Gosling\\n5005,Kurtz\\n\\nPATIENT_ID,VISIT_DATE,SCORE\\n2002,2020-09-10,6.8\\n1001,2020-09-17,5.5\\n4004,2020-09-24,8.4\\n2002,2020-10-08,\\n1001,,6.6\\n3003,2020-11-12,\\n4004,2020-11-05,7.0\\n1001,2020-11-19,5.3\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">patients_txt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n PATIENT_ID,LASTNAME\\n 1001,Hopper\\n 4004,Wirth\\n 3003,Kemeny\\n 2002,Gosling\\n 5005,Kurtz\\\"\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">'\\\\n'</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">visits_txt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n PATIENT_ID,VISIT_DATE,SCORE\\n 2002,2020-09-10,6.8\\n 1001,2020-09-17,5.5\\n 4004,2020-09-24,8.4\\n 2002,2020-10-08,\\n 1001,,6.6\\n 3003,2020-11-12,\\n 4004,2020-11-05,7.0\\n 1001,2020-11-19,5.3\\\"\\\"\\\"</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;\\\">--or, assuming these files contain exactly the same actual raw text,\\n -- and the use of GT_LF_STRIPPED is instead of above split('\\\\n'):\\n --constant patients_txt = get_text(\\\"patients.csv\\\",GT_LF_STRIPPED),\\n -- visits_txt = get_text(\\\"visits.csv\\\",GT_LF_STRIPPED)</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">sap</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">split</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: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">)&{</span><span style=\\\"color: #008000;\\\">\\\"\\\"</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: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">svp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">split</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: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">patient_data</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">apply</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">patients_txt</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">..$],</span><span style=\\\"color: #000000;\\\">sap</span><span style=\\\"color: #0000FF;\\\">)),</span>\\n <span style=\\\"color: #000000;\\\">visit_data</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sort_columns</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">apply</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">visits_txt</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">..$],</span><span style=\\\"color: #000000;\\\">svp</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: #000000;\\\">visit_data</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">visit_data</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;\\\">\\\"0\\\"</span><span style=\\\"color: #0000FF;\\\">})</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (add a sentinel)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">last_id</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">id</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">scstr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">avstr</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">score</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">score_total</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">average</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">visit_count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pdx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">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;\\\">visit_data</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">id</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">scstr</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">visit_data</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">score</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">scstr</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #7060A8;\\\">scanf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">scstr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%f\\\"</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: #7060A8;\\\">id</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">last_id</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">visit_count</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">average</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">score_total</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">visit_count</span>\\n <span style=\\\"color: #000000;\\\">patient_data</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">pdx</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">score_total</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">average</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;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">visit_data</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> <span style=\\\"color: #000080;font-style:italic;\\\">-- (sentinel)</span>\\n <span style=\\\"color: #000000;\\\">score_total</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">score</span>\\n <span style=\\\"color: #000000;\\\">visit_count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">score</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: #7060A8;\\\">id</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">patient_data</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">pdx</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">do</span> <span style=\\\"color: #000000;\\\">pdx</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #000000;\\\">patient_data</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">pdx</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: #000000;\\\">dt</span>\\n <span style=\\\"color: #000000;\\\">last_id</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">id</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">score</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">score_total</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">score</span>\\n <span style=\\\"color: #000000;\\\">visit_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;\\\">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;\\\">\\\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\\\\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;\\\">patient_data</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">id</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">score</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">average</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">patient_data</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">scstr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">score</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%4.1f\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">score</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">avstr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">average</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%4.2f\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">average</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;\\\">\\\"| %-10s | %-7s | %10s | %-9s | %-9s |\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">id</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">scstr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">avstr</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\": \"patient(1001,'Hopper').\\npatient(4004,'Wirth').\\npatient(3003,'Kemeny').\\npatient(2002,'Gosling').\\npatient(5005,'Kurtz').\\n\\nvisit(2002,'2020-09-10',6.8).\\nvisit(1001,'2020-09-17',5.5).\\nvisit(4004,'2020-09-24',8.4).\\nvisit(2002,'2020-10-08',nan).\\nvisit(1001,'',6.6).\\nvisit(3003,'2020-11-12',nan).\\nvisit(4004,'2020-11-05',7.0).\\nvisit(1001,'2020-11-19',5.3).\\n\\nsummaryDates(Id, Lastname, LastDate) :-\\n aggregate(max(Ts),\\n\\t Score^Date^(visit(Id, Date, Score), Date \\\\= '', parse_time(Date, iso_8601, Ts)),\\n\\t MaxTs),\\n format_time(atom(LastDate), '%Y-%m-%d', MaxTs),\\n patient(Id,Lastname).\\n\\nsummaryScores(Id, Lastname, Sum, Mean) :-\\n aggregate(r(sum(Score),count), Date^(visit(Id, Date, Score), Score \\\\= nan), r(Sum,Count)),\\n patient(Id,Lastname),\\n Mean is Sum/Count.\\n\\ntest :-\\n summaryDates(Id, Lastname, LastDate),\\n writeln(summaryDates(Id, Lastname, LastDate)),\\n fail.\\n\\ntest :-\\n summaryScores(Id, Lastname, ScoreSum, ScoreMean),\\n writeln(summaryScores(Id, Lastname, ScoreSum, ScoreMean)),\\n fail.\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \":- import bagMax/2, bagCount/2, bagSum/2, bagReduce/4 from aggregs.\\n:- import julian_date/7, date_string/3 from iso8601.\\n:- import load_csv/2, add_cvt_type_hook/2 from proc_files.\\n\\n?- add_cvt_type_hook(date,date_converter(_,_)).\\n\\ndate_converter(Atom,Date) :- date_string('YYYY-MM-DD',Date,Atom).\\n\\n:- load_csv('visit.csv',visit(integer,date,float)).\\n:- load_csv('patient.csv',patient(integer,atom)).\\n\\nis_nan(Number) :- X is Number, X =\\\\= Number.\\n\\nsummaryDates(Id, Lastname, LastDate) :-\\n bagMax(date_number(Id), LastDateNumber),\\n patient(Id,Lastname),\\n julian_date(LastDateNumber, Y, M, D, _, _, _),\\n date_converter(LastDate, date(Y,M,D)).\\n\\nsummaryScores(Id, Lastname, Sum, Mean) :-\\n bagSum(scores(Id), Sum),\\n bagCount(scores(Id), Count),\\n Mean is Sum/Count,\\n patient(Id,Lastname).\\n\\ntest :-\\n summaryDates(Id,Lastname,LastDate),\\n writeln(summaryDates(Id,Lastname,LastDate)), fail.\\n\\ntest :-\\n summaryScores(Id, Lastname, ScoreSum, ScoreMean),\\n writeln(summaryScores(Id, Lastname, ScoreSum, ScoreMean)), fail.\\n\\n/* Put hilog declarations together */\\n\\ndate_number(Id)(Number) :-\\n visit(Id, date(Y,M,D), _),\\n julian_date(Number, Y, M, D, _, _, _).\\n\\t\\t\\nscores(Id)(Score) :-\\n visit(Id, _, Score),\\n \\\\+is_nan(Score).\\n\\n:- hilog maximum.\\nmaximum(X,Y,Z) :- X @> Y -> Z=X ; Z=Y.\\n:- hilog sum.\\nsum(X,Y,Z) :- Z is X+Y.\\n:- hilog successor.\\nsuccessor(X,_Y,Z) :- Z is X+1.\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Structure Person\\n Name$\\nEndStructure\\n\\nStructure Visits\\n Datum$\\n Score$\\nEndStructure\\n\\nStructure Merge\\n Patient.Person\\n List PVisit.Visits()\\nEndStructure\\n\\nNewMap P.Merge()\\nNewList ID$()\\n\\nIf ReadFile(1,\\\"./Data/patients.csv\\\")=0 : End 1 : EndIf\\nheader=1\\nWhile Not Eof(1)\\n buf1$=ReadString(1)\\n If header=1 : header=0 : Continue : EndIf\\n bufId$=StringField(buf1$,1,\\\",\\\")\\n P(bufId$)\\\\Patient\\\\Name$=StringField(buf1$,2,\\\",\\\")\\n AddElement(ID$()) : ID$()=bufId$\\nWend\\nCloseFile(1)\\n\\nIf ReadFile(2,\\\"./Data/visits.csv\\\")=0 : End 2 : EndIf\\nheader=1\\nWhile Not Eof(2)\\n buf1$=ReadString(2)\\n If header=1 : header=0 : Continue : EndIf\\n bufId$=StringField(buf1$,1,\\\",\\\")\\n AddElement(P(bufId$)\\\\PVisit())\\n P(bufId$)\\\\PVisit()\\\\Datum$=StringField(buf1$,2,\\\",\\\")\\n P(bufId$)\\\\PVisit()\\\\Score$=StringField(buf1$,3,\\\",\\\")\\nWend\\nCloseFile(2)\\n\\nIf OpenConsole()=0 : End 3 : EndIf\\nSortList(ID$(),#PB_Sort_Ascending)\\nPrintN(\\\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\\\")\\nForEach ID$()\\n Print(\\\"| \\\"+LSet(ID$(),11))\\n Print(\\\"| \\\"+LSet(P(ID$())\\\\Patient\\\\Name$,9)+\\\"|\\\")\\n SortStructuredList(P(ID$())\\\\PVisit(),#PB_Sort_Ascending,OffsetOf(Visits\\\\Datum$),TypeOf(Visits\\\\Datum$))\\n ForEach P(ID$())\\\\PVisit()\\n scs.f+ValF(p(ID$())\\\\PVisit()\\\\Score$) : c+Bool(ValF(p(ID$())\\\\PVisit()\\\\Score$))\\n Next\\n If LastElement(P(ID$())\\\\PVisit())\\n sca.f=scs/c\\n Print(\\\" \\\"+LSet(P(ID$())\\\\PVisit()\\\\Datum$,10)+\\\" |\\\")\\n Print(RSet(StrF(scs,1),10)+\\\" |\\\")\\n If Not IsNAN(sca) : Print(RSet(StrF(sca,2),10)+\\\" |\\\") : Else : Print(Space(11)+\\\"|\\\") : EndIf\\n Else\\n Print(Space(12)+\\\"|\\\"+Space(11)+\\\"|\\\"+Space(11)+\\\"|\\\")\\n EndIf\\n PrintN(\\\"\\\") : scs=0 : c=0\\nNext\\nInput()\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"# to install pandas library go to cmd prompt and type:\\n# cd %USERPROFILE%\\\\AppData\\\\Local\\\\Programs\\\\Python\\\\Python38-32\\\\Scripts\\\\\\n# pip install pandas\\nimport pandas as pd\\n\\n# load data from csv files\\ndf_patients = pd.read_csv (r'patients.csv', sep = \\\",\\\", decimal=\\\".\\\")\\ndf_visits = pd.read_csv (r'visits.csv', sep = \\\",\\\", decimal=\\\".\\\")\\n\\n''' # load data hard coded, create data frames\\nimport io\\nstr_patients = \\\"\\\"\\\"PATIENT_ID,LASTNAME\\n1001,Hopper\\n4004,Wirth\\n3003,Kemeny\\n2002,Gosling\\n5005,Kurtz\\n\\\"\\\"\\\"\\ndf_patients = pd.read_csv(io.StringIO(str_patients), sep = \\\",\\\", decimal=\\\".\\\")\\nstr_visits = \\\"\\\"\\\"PATIENT_ID,VISIT_DATE,SCORE\\n2002,2020-09-10,6.8\\n1001,2020-09-17,5.5\\n4004,2020-09-24,8.4\\n2002,2020-10-08,\\n1001,,6.6\\n3003,2020-11-12,\\n4004,2020-11-05,7.0\\n1001,2020-11-19,5.3\\n\\\"\\\"\\\"\\ndf_visits = pd.read_csv(io.StringIO(str_visits), sep = \\\",\\\", decimal=\\\".\\\")\\n'''\\n\\n# typecast from string to datetime so .agg can 'max' it\\ndf_visits['VISIT_DATE'] = pd.to_datetime(df_visits['VISIT_DATE'])\\n\\n# merge on PATIENT_ID\\ndf_merge = df_patients.merge(df_visits, on='PATIENT_ID', how='left')\\n\\n# groupby is an intermediate object\\ndf_group = df_merge.groupby(['PATIENT_ID','LASTNAME'], as_index=False)\\n\\n# note: you can use 'sum' instead of the lambda function but that returns NaN as 0 (zero)\\ndf_result = df_group.agg({'VISIT_DATE': 'max', 'SCORE': [lambda x: x.sum(min_count=1),'mean']})\\n\\nprint(df_result)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import csv\\n\\nfnames = 'patients.csv patients_visits.csv'.split()\\n\\ndef csv2list(fname):\\n with open(fname) as f:\\n rows = list(csv.reader(f))\\n return rows\\n\\npatients, visits = data = [csv2list(fname) for fname in fnames]\\nresult = [record.copy() for record in patients]\\nresult[1:] = sorted(result[1:])\\n#%%\\nresult[0].append('LAST_VISIT')\\nlast = {p: vis for p, vis, *score in visits[1:]}\\nfor record in result[1:]:\\n p = record[0]\\n record.append(last.get(p, ''))\\n#%%\\nresult[0] += ['SCORE_SUM', 'SCORE_AVG']\\nn = {p: 0 for p, *_ in patients[1:]}\\ntot = n.copy()\\nfor record in visits[1:]:\\n p, _, score = record\\n if score:\\n n[p] += 1\\n tot[p] += float(score)\\nfor record in result[1:]:\\n p = record[0]\\n if n[p]:\\n record += [f\\\"{tot[p]:5.1f}\\\", f\\\"{tot[p] / n[p]:5.2f}\\\"]\\n else:\\n record += ['', '']\\n#%%\\nfor record in result:\\n print(f\\\"| {' | '.join(f'{r:^10}' for r in record)} |\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import sqlite3\\nimport csv\\n\\n\\nfnames = 'patients.csv patients_visits.csv'.split()\\nconn = sqlite3.connect(\\\":memory:\\\")\\n#%%\\n\\ndef create_table_headers(conn):\\n curs = conn.cursor()\\n curs.execute('''\\n CREATE TABLE patients(PATIENT_ID INT, LASTNAME TEXT);\\n ''')\\n curs.execute('''\\n CREATE TABLE patients_visits(PATIENT_ID INT, VISIT_DATE DATE, SCORE NUMERIC(4,1));\\n ''')\\n conn.commit()\\n\\ndef fill_tables(conn, fnames):\\n curs = conn.cursor()\\n for fname in fnames:\\n with open(fname) as f:\\n tablename = fname.replace('.csv', '')\\n #\\n csvdata = csv.reader(f)\\n header = next(csvdata)\\n fields = ','.join('?' for _ in header)\\n for row in csvdata:\\n row = [(None if r == '' else r) for r in row]\\n curs.execute(f\\\"INSERT INTO {tablename} VALUES ({fields});\\\", row)\\n conn.commit()\\n\\ndef join_tables_and_group(conn):\\n curs = conn.cursor()\\n curs.execute('''\\nCREATE TABLE answer AS\\n SELECT\\n \\tpatients.PATIENT_ID,\\n \\tpatients.LASTNAME,\\n \\tMAX(VISIT_DATE) AS LAST_VISIT,\\n \\tSUM(SCORE) AS SCORE_SUM,\\n \\tCAST(AVG(SCORE) AS DECIMAL(10,2)) AS SCORE_AVG\\n FROM\\n \\tpatients\\n \\tLEFT JOIN patients_visits\\n \\t\\tON patients_visits.PATIENT_ID = patients.PATIENT_ID\\n GROUP BY\\n \\tpatients.PATIENT_ID,\\n \\tpatients.LASTNAME\\n ORDER BY\\n \\tpatients.PATIENT_ID;\\n ''')\\n curs.execute('''\\nSELECT * FROM answer;\\n ''')\\n conn.commit()\\n rows = list(curs.fetchall())\\n headers = tuple(d[0] for d in curs.description)\\n return [headers] + rows\\n\\ncreate_table_headers(conn)\\nfill_tables(conn, fnames)\\nresult = join_tables_and_group(conn)\\nfor record in result:\\n print(f\\\"| {' | '.join(f'{str(r):^10}' for r in record)} |\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"# load data from csv files\\n# setwd(\\\"C:\\\\Temp\\\\csv\\\\\\\")\\n# df_patient <- read.csv(file=\\\"patients.csv\\\", header = TRUE, sep = \\\",\\\")\\n# df_visits <- read.csv(file=\\\"visits.csv\\\", header = TRUE, sep = \\\",\\\", dec = \\\".\\\", colClasses=c(\\\"character\\\",\\\"character\\\",\\\"numeric\\\"))\\n\\n# load data hard coded, create data frames\\ndf_patient <- read.table(text = \\\"\\nPATIENT_ID,LASTNAME\\n1001,Hopper\\n4004,Wirth\\n3003,Kemeny\\n2002,Gosling\\n5005,Kurtz\\n\\\", header = TRUE, sep = \\\",\\\") # character fields so no need for extra parameters colClasses etc.\\n\\ndf_visits <- read.table(text = \\\"\\nPATIENT_ID,VISIT_DATE,SCORE\\n2002,2020-09-10,6.8\\n1001,2020-09-17,5.5\\n4004,2020-09-24,8.4\\n2002,2020-10-08,\\n1001,,6.6\\n3003,2020-11-12,\\n4004,2020-11-05,7.0\\n1001,2020-11-19,5.3\\n\\\", header = TRUE, dec = \\\".\\\", sep = \\\",\\\", colClasses=c(\\\"character\\\",\\\"character\\\",\\\"numeric\\\"))\\n\\n# aggregate visit date and scores\\ndf_agg <- data.frame(\\n cbind(\\n PATIENT_ID = names(tapply(df_visits$VISIT_DATE, list(df_visits$PATIENT_ID), max, na.rm=TRUE)),\\n last_visit = tapply(df_visits$VISIT_DATE, list(df_visits$PATIENT_ID), max, na.rm=TRUE),\\n score_sum = tapply(df_visits$SCORE, list(df_visits$PATIENT_ID), sum, na.rm=TRUE),\\n score_avg = tapply(df_visits$SCORE, list(df_visits$PATIENT_ID), mean, na.rm=TRUE)\\n )\\n)\\n\\n# merge patients and aggregate dataset\\n# all.x = all the non matching cases of df_patient are appended to the result as well (i.e. 'left join')\\ndf_result <- merge(df_patient, df_agg, by = 'PATIENT_ID', all.x = TRUE)\\n\\nprint(df_result)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"my @names = map { ( <PATIENT_ID LASTNAME> Z=> .list ).hash },\\n ( 1001, 'Hopper' ),\\n ( 4004, 'Wirth' ),\\n ( 3003, 'Kemeny' ),\\n ( 2002, 'Gosling' ),\\n ( 5005, 'Kurtz' ),\\n;\\nmy @visits = map { ( <PATIENT_ID VISIT_DATE SCORE> Z=> .list ).hash },\\n ( 2002, '2020-09-10', 6.8 ),\\n ( 1001, '2020-09-17', 5.5 ),\\n ( 4004, '2020-09-24', 8.4 ),\\n ( 2002, '2020-10-08', Nil ),\\n ( 1001, Nil , 6.6 ),\\n ( 3003, '2020-11-12', Nil ),\\n ( 4004, '2020-11-05', 7.0 ),\\n ( 1001, '2020-11-19', 5.3 ),\\n;\\n\\nmy %v = @visits.classify: *.<PATIENT_ID>;\\n\\nmy @result = gather for @names -> %n {\\n my @p = %v{ %n.<PATIENT_ID> }<>;\\n\\n my @dates = @p».<VISIT_DATE>.grep: *.defined;\\n my @scores = @p».< SCORE>.grep: *.defined;\\n\\n take {\\n %n,\\n LAST_VISIT => ( @dates.max if @dates ),\\n SCORE_AVG => ( @scores.sum/@scores if @scores ),\\n SCORE_SUM => ( @scores.sum if @scores ),\\n };\\n}\\n\\nmy @out_field_names = <PATIENT_ID LASTNAME LAST_VISIT SCORE_SUM SCORE_AVG>;\\nmy @rows = @result.sort(*.<PATIENT_ID>).map(*.{@out_field_names});\\nsay .map({$_ // ''}).fmt('%-10s', ' | ') for @out_field_names, |@rows;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/* REXX */\\npatients='patients.csv'\\nl=linein(patients)\\nParse Var l h1 ',' h2\\nn=0\\nidl=''\\nDo n=1 By 1 While lines(patients)>0\\n l=linein(patients)\\n Parse Var l id ',' lastname.id\\n idl=idl id\\n End\\nn=n-1 /* number of patients */\\nvisits='visits.csv'\\nl=linein(visits) /* skip the header line of this file */\\nh3='LAST_VISIT'\\nh4='SCORE_SUM'\\nh5='SCORE_AVG'\\ndate.=''\\nscore.=0\\nSay '|' h1 '|' h2 '|' h3 '|' h4 '|' h5 '|'\\nDo While lines(visits)>0\\n l=linein(visits)\\n Parse Var l id ',' date ',' score\\n if date>date.id Then date.id=date\\n If score>'' Then Do\\n z=score.id.0+1\\n score.id.z=score\\n score.id.0=z\\n End\\n end\\nidl=wordsort(idl)\\nDo While idl<>''\\n Parse Var idl id idl\\n If date.id='' Then date.id=copies(' ',10)\\n ol='|' left(id,length(h1)) '|' left(lastname.id,length(h2)),\\n '|' left(date.id,length(h3))\\n If score.id.0=0 Then Do\\n ol=ol '|' left(' ',length(h4)) '|',\\n left(' ',length(h5)) '|'\\n score_sum=copies(' ',length(h4))\\n score_avg=copies(' ',length(h4))\\n End\\n Else Do\\n score_sum=0\\n Do j=1 To score.id.0\\n score_sum=score_sum+score.id.j\\n End\\n score_avg=score_sum/score.id.0\\n ol=ol '|' left(format(score_sum,2,1),length(h4)) '|',\\n left(format(score_avg,2,1),length(h5)) '|'\\n End\\n Say ol\\n End\\nExit\\n\\nwordsort: Procedure\\n/**********************************************************************\\n* Sort the list of words supplied as argument. Return the sorted list\\n**********************************************************************/\\n Parse Arg wl\\n wa.=''\\n wa.0=0\\n Do While wl<>''\\n Parse Var wl w wl\\n Do i=1 To wa.0\\n If wa.i>w Then Leave\\n End\\n If i<=wa.0 Then Do\\n Do j=wa.0 To i By -1\\n ii=j+1\\n wa.ii=wa.j\\n End\\n End\\n wa.i=w\\n wa.0=wa.0+1\\n End\\n swl=''\\n Do i=1 To wa.0\\n swl=swl wa.i\\n End\\n Return strip(swl)\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \" %let datefmt=E8601DA10.;\\n data patient;\\n infile \\\"patient.csv\\\" dsd dlm=',';\\n attrib\\n id length=4\\n lastname length=$10;\\n input id lastname;\\n data visit;\\n infile \\\"visit.csv\\\" dsd dlm=',';\\n attrib\\n id length=4\\n date informat=&datefmt format=&datefmt\\n score length=8;\\n input id date score;\\n proc sql;\\n select * from\\n (select id, max(date) format=&datefmt as max_date, sum(score) as sum_score,\\n \\tavg(score) as avg_score from visit group by id)\\n natural right join patient\\n order by id;\\n\",\n \"language\": \"SAS\"\n },\n {\n \"code\": \"* set working directory to location of .csv files\\n\\nCD 'C:\\\\Temp\\\\csv\\\\'.\\n\\n* load patients csv data\\n\\nGET DATA /TYPE=TXT\\n /FILE=\\\"patients.csv\\\"\\n /ENCODING='UTF8'\\n /DELCASE=LINE\\n /DELIMITERS=\\\",\\\"\\n /QUALIFIER='\\\"'\\n /ARRANGEMENT=DELIMITED\\n /FIRSTCASE=2\\n /IMPORTCASE=ALL\\n /VARIABLES=\\nPATIENT_ID F5.0\\nLASTNAME A20\\n.\\nCACHE.\\nEXECUTE.\\n\\n* sort cases is needed to match files\\n\\nSORT CASES BY PATIENT_ID (A).\\nDATASET NAME Patients WINDOW=FRONT.\\n\\n* load visits csv data\\n\\nGET DATA /TYPE=TXT\\n /FILE=\\\"visit.csv\\\"\\n /ENCODING='UTF8'\\n /DELCASE=LINE\\n /DELIMITERS=\\\",\\\"\\n /QUALIFIER='\\\"'\\n /ARRANGEMENT=DELIMITED\\n /FIRSTCASE=2\\n /IMPORTCASE=ALL\\n /VARIABLES=\\nPATIENT_ID F5.0\\nVISIT_DATE SDATE10\\nSCORE F4.1\\n.\\nCACHE.\\nEXECUTE.\\n\\n* sort cases is needed, else match files will raise error \\\"Files out of order\\\"\\n\\nSORT CASES BY PATIENT_ID (A) VISIT_DATE (A).\\nDATASET NAME Visits WINDOW=FRONT.\\n\\n* load visits csv data\\n\\n* merge datasets, one to many, FILE is the 'one', TABLE is 'many'\\n\\nMATCH FILES TABLE = Patients / FILE = Visits\\n/BY PATIENT_ID.\\nEXECUTE.\\n\\n* aggregate visit date and scores, group by and order (A)=ascending or (D)=descending\\n\\nAGGREGATE OUTFILE *\\n/BREAK=PATIENT_ID(A)\\n/last_visit = MAX(VISIT_DATE)\\n/score_avg = MEAN(SCORE)\\n/score_sum = SUM(SCORE).\\n\",\n \"language\": \"SPSS\"\n },\n {\n \"code\": \"-- drop tables\\nDROP TABLE IF EXISTS tmp_patients;\\nDROP TABLE IF EXISTS tmp_visits;\\n\\n-- create tables\\nCREATE TABLE tmp_patients(\\n\\tPATIENT_ID INT,\\n\\tLASTNAME VARCHAR(20)\\n);\\n\\nCREATE TABLE tmp_visits(\\n\\tPATIENT_ID INT,\\n\\tVISIT_DATE DATE,\\n\\tSCORE NUMERIC(4,1)\\n);\\n\\n-- load data from csv files\\n/*\\n-- Note: LOAD DATA LOCAL requires `local-infile` enabled on both the client and server else you get error \\\"#1148 command is not allowed..\\\"\\nLOAD DATA LOCAL INFILE '/home/csv/patients.csv' INTO TABLE `tmp_patients` FIELDS TERMINATED BY ',' LINES TERMINATED BY '\\\\n' IGNORE 1 LINES;\\nLOAD DATA LOCAL INFILE '/home/csv/visits.csv' INTO TABLE `tmp_visits` FIELDS TERMINATED BY ',' LINES TERMINATED BY '\\\\n' IGNORE 1 LINES;\\n*/\\n\\n-- load data hard coded\\nINSERT INTO tmp_patients(PATIENT_ID, LASTNAME)\\nVALUES\\n(1001, 'Hopper'),\\n(4004, 'Wirth'),\\n(3003, 'Kemeny'),\\n(2002, 'Gosling'),\\n(5005, 'Kurtz');\\n\\nINSERT INTO tmp_visits(PATIENT_ID, VISIT_DATE, SCORE)\\nVALUES\\n(2002, '2020-09-10', 6.8),\\n(1001, '2020-09-17', 5.5),\\n(4004, '2020-09-24', 8.4),\\n(2002, '2020-10-08', NULL),\\n(1001, NULL, 6.6),\\n(3003, '2020-11-12', NULL),\\n(4004, '2020-11-05', 7.0),\\n(1001, '2020-11-19', 5.3);\\n\\n-- join tables and group\\nSELECT\\n\\tp.PATIENT_ID,\\n\\tp.LASTNAME,\\n\\tMAX(VISIT_DATE) AS LAST_VISIT,\\n\\tSUM(SCORE) AS SCORE_SUM,\\n\\tCAST(AVG(SCORE) AS DECIMAL(10,2)) AS SCORE_AVG\\nFROM\\n\\ttmp_patients p\\n\\tLEFT JOIN tmp_visits v\\n\\t\\tON v.PATIENT_ID = p.PATIENT_ID\\nGROUP BY\\n\\tp.PATIENT_ID,\\n\\tp.LASTNAME\\nORDER BY\\n\\tp.PATIENT_ID;\\n\",\n \"language\": \"SQL\"\n },\n {\n \"code\": \"#lang transd\\n\\nMainModule: {\\n\\ntbl: `1001,Hopper\\n4004,Wirth\\n3003,Kemeny\\n2002,Gosling\\n5005,Kurtz`,\\n\\ntbl1: `\\n2002,2020-09-10,6.8\\n1001,2020-09-17,5.5\\n4004,2020-09-24,8.4\\n2002,2020-10-08,\\n1001,,6.6\\n3003,2020-11-12,\\n4004,2020-11-05,7.0\\n1001,2020-11-19,5.3`,\\n\\ncols: `@key_PATIENT_ID:Int,\\n LASTNAME:String,\\n VISIT_DATE:DateTime,\\n SCORE:Double,\\n SCORE_AVG:Double,\\n NUM_VISITS:Int`,\\n\\nRecord : typealias(Tuple<Int DateTime Double>()),\\n\\n\\t_start: (λ (with base TSDBase()\\n\\t\\t(load-table base tbl colNames: cols)\\n (build-index base \\\"PATIENT_ID\\\")\\n\\n (with vizs Vector<Record>()\\n (load-table vizs tbl1 :mixedTypes fieldSep: \\\",\\\" rowSep: \\\"\\\\n\\\" )\\n (for viz in vizs do\\n (tsd-query base\\n :update set:\\n (lambda PATIENT_ID Int() VISIT_DATE DateTime()\\n SCORE Double() SCORE_AVG Double() NUM_VISITS Int()\\n (+= NUM_VISITS 1)\\n (set VISIT_DATE (get viz 1))\\n (set SCORE (+ SCORE (get viz 2)))\\n (set SCORE_AVG (/ SCORE NUM_VISITS)))\\n where: (lambda PATIENT_ID Int() (eq PATIENT_ID (get viz 0))))\\n ))\\n\\n (with cols [\\\"PATIENT_ID\\\",\\\"LASTNAME\\\",\\\"VISIT_DATE\\\",\\\"SCORE\\\",\\\"SCORE_AVG\\\"]\\n (with recs (tsd-query base select: cols\\n as: [[Int(), String(), DateTime(), Double(), Double()]]\\n where: (lambda PATIENT_ID Int() true)\\n )\\n (for i in cols do (textout width: 10 i \\\"|\\\")) (lout \\\"\\\")\\n (for rec in recs do\\n (for-each rec (λ i :Data() (textout width: 10 i \\\"|\\\" )))\\n (lout \\\"\\\"))\\n\\t\\t))\\n\\t))\\n}\\n\",\n \"language\": \"Transd\"\n },\n {\n \"code\": \"BEGIN;\\n TYPE Date UNION;\\n TYPE DateValid IS {Date POSSREP {year INTEGER, month INTEGER, day INTEGER}};\\n TYPE DateNone IS {Date POSSREP {}};\\n TYPE DateUnknown IS {Date POSSREP {}};\\nEND;\\n\\nVAR patient REAL RELATION {id INT, lastname CHAR} KEY {id};\\n\\nINSERT patient RELATION\\n{TUPLE {id 1001, lastname 'Hopper'},\\n TUPLE {id 4004, lastname 'Wirth'},\\n TUPLE {id 3003, lastname 'Kemeny'},\\n TUPLE {id 2002, lastname 'Gosling'},\\n TUPLE {id 5005, lastname 'Kurtz'}\\n };\\n\\nVAR visit REAL RELATION {id INT, date Date, score RATIONAL} KEY {id, date};\\n\\nINSERT visit RELATION\\n{\\nTUPLE {id 2002, date DateValid(2020,09,10), score 6.8},\\nTUPLE {id 1001, date DateValid(2020,09,17), score 5.5},\\nTUPLE {id 4004, date DateValid(2020,09,24), score 8.4},\\nTUPLE {id 2002, date DateValid(2020,10,08), score NAN},\\nTUPLE {id 1001, date DateNone(), score 6.6},\\nTUPLE {id 3003, date DateValid(2020,11,12), score NAN},\\nTUPLE {id 4004, date DateValid(2020,11,05), score 7.0},\\nTUPLE {id 1001, date DateValid(2020,11,19), score 5.3}\\n};\\n\\n((SUMMARIZE (visit WHERE score>0.0) BY {id}: {sumscore := SUM(score), avgscore := AVG(score)}) UNION\\n (EXTEND (patient {id} MINUS ((visit WHERE score>0.0) {id})): {sumscore := NaN, avgscore := NaN})) JOIN\\n (SUMMARIZE visit BY {id}: {maxdate := MAX(date)} UNION\\n (EXTEND (patient {id} MINUS (visit {id})): {maxdate := DateUnknown()})) JOIN\\n patient\\n\",\n \"language\": \"TutorialD\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\nimport \\\"./sort\\\" for Sort\\n\\nclass Patient {\\n construct new(id, lastName) {\\n _id = id\\n _lastName = lastName\\n if (!__dir) __dir = {}\\n __dir[id] = lastName\\n if (!__ids) {\\n __ids = [id]\\n } else {\\n __ids.add(id)\\n Sort.insertion(__ids)\\n }\\n }\\n\\n id { _id }\\n lastName { _lastName }\\n\\n // maps an id to a lastname\\n static dir { __dir }\\n\\n // maintains a sorted list of ids\\n static ids { __ids }\\n}\\n\\nclass Visit {\\n construct new(id, date, score) {\\n _id = id\\n _date = date || \\\"0000-00-00\\\"\\n _score = score\\n if (!__dir) __dir = {}\\n if (!__dir[id]) {\\n __dir[id] = [ [_date], [score] ]\\n } else {\\n __dir[id][0].add(_date)\\n __dir[id][1].add(score)\\n }\\n }\\n\\n id { _id }\\n date { _date }\\n score { _score }\\n\\n // maps an id to lists of dates and scores\\n static dir { __dir }\\n}\\n\\nclass Merge {\\n construct new(id) {\\n _id = id\\n }\\n\\n id { _id }\\n lastName { Patient.dir[_id] }\\n dates { Visit.dir[_id][0] }\\n scores { Visit.dir[_id][1] }\\n lastVisit { Sort.merge(dates)[-1] }\\n\\n scoreSum { scores.reduce(0) { |acc, s| s ? acc + s : acc } }\\n scoreAvg { scoreSum / scores.count { |s| s } }\\n\\n static print(merges) {\\n System.print(\\\"| PATIENT_ID | LASTNAME | LAST_VISIT | SCORE_SUM | SCORE_AVG |\\\")\\n var fmt = \\\"| $d | $-7s | $s | $4s | $4s |\\\"\\n for (m in merges) {\\n if (Visit.dir[m.id]) {\\n var lv = (m.lastVisit != \\\"0000-00-00\\\") ? m.lastVisit : \\\" \\\"\\n var ss = (m.scoreSum > 0) ? Fmt.f(4, m.scoreSum, 1) : \\\" \\\"\\n var sa = (!m.scoreAvg.isNan) ? Fmt.f(4, m.scoreAvg, 2) : \\\" \\\"\\n Fmt.print(fmt, m.id, m.lastName, lv, ss, sa)\\n } else {\\n Fmt.print(fmt, m.id, m.lastName, \\\" \\\", \\\" \\\", \\\" \\\")\\n }\\n }\\n }\\n}\\n\\nPatient.new(1001, \\\"Hopper\\\")\\nPatient.new(4004, \\\"Wirth\\\")\\nPatient.new(3003, \\\"Kemeny\\\")\\nPatient.new(2002, \\\"Gosling\\\")\\nPatient.new(5005, \\\"Kurtz\\\")\\n\\nVisit.new(2002, \\\"2020-09-10\\\", 6.8)\\nVisit.new(1001, \\\"2020-09-17\\\", 5.5)\\nVisit.new(4004, \\\"2020-09-24\\\", 8.4)\\nVisit.new(2002, \\\"2020-10-08\\\", null)\\nVisit.new(1001, null , 6.6)\\nVisit.new(3003, \\\"2020-11-12\\\", null)\\nVisit.new(4004, \\\"2020-11-05\\\", 7.0)\\nVisit.new(1001, \\\"2020-11-19\\\", 5.3)\\n\\nvar merges = Patient.ids.map { |id| Merge.new(id) }.toList\\nMerge.print(merges)\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Merge-and-aggregate-datasets"}}},{"rowIdx":484,"cells":{"solutions":{"kind":"list like","value":[{"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''' of those that have an '''odd number'''. \n\nIt is an extension of the [[Möbius function]]. Given the Möbius function '''μ(n)''', the Mertens function '''M(x)''' is the sum of the Möbius numbers from '''n == 1''' through '''n == x'''.\n\n\n;Task:\n\n:* Write a routine (function, procedure, whatever) to find the Mertens number for any positive integer '''x'''.\n\n:* Use that routine to find and display here, on this page, at least the first 99 terms in a grid layout. (Not just one long line or column of numbers.)\n\n:* Use that routine to find and display here, on this page, the number of times the Mertens function sequence '''is equal to zero''' in the range '''M(1)''' through '''M(1000)'''.\n\n:* Use that routine to find and display here, on this page, the number of times the Mertens function sequence '''crosses zero''' in the range '''M(1)''' through '''M(1000)'''. (Crossing defined as this term equal to zero but preceding term '''not'''.)\n\n\n;See also:\n:* [[wp:Mertens function|Wikipedia: Mertens function]]\n:* [[wp:Möbius function|Wikipedia: Möbius function]]\n:* [[oeis:A002321|OEIS: A002321 - Mertens's function]]\n:* [[oeis:A028442|OEIS: A028442 - Numbers n such that Mertens's function M(n) is zero]]\n:* [https://www.youtube.com/watch?v=uvMGZb0Suyc Numberphile - Mertens Conjecture]\n:* [https://codegolf.stackexchange.com/questions/94814/compute-the-mertens-function Stackexchange: compute the mertens function]\n\n\n''This is not code golf. The stackexchange link is provided as an algorithm reference, not as a guide.''\n\n\n;Related tasks:\n:* [[Möbius function]]\n<br><br>\n\n","language":"00-TASK"},{"code":"F mertens(count)\n ‘Generate Mertens numbers’\n V m = [-1, 1]\n L(n) 2 .. count\n m.append(1)\n L(k) 2 .. n\n m[n] -= m[n I/ k]\n R m\n\nV ms = mertens(1000)\n\nprint(‘The first 99 Mertens numbers are:’)\nprint(‘ ’, end' ‘ ’)\nV col = 1\nL(n) ms[1.<100]\n print(‘#2’.format(n), end' ‘ ’)\n col++\n I col == 10\n print()\n col = 0\n\nV zeroes = sum(ms.map(x -> Int(x == 0)))\nV crosses = sum(zip(ms, ms[1..]).map((a, b) -> Int(a != 0 & b == 0)))\nprint(‘M(N) equals zero #. times.’.format(zeroes))\nprint(‘M(N) crosses zero #. times.’.format(crosses))\n","language":"11l"},{"code":"* Mertens function - 01/05/2023\nMERTENS CSECT\n USING MERTENS,R13 base register\n B 72(R15) skip savearea\n DC 17F'0' savearea\n SAVE (14,12) save previous context\n ST R13,4(R15) link backward\n ST R15,8(R13) link forward\n LR R13,R15 set addressability\n LA R0,1 1\n STH R0,MM m(1)=1\n LA R6,2 i=2\n DO WHILE=(CH,R6,LE,=AL2(NN)) do i=2 to n\n LR R1,R6 i\n SLA R1,1 *2 (H)\n LA R0,1 1\n STH R0,MM-2(R1) m(i)=1\n LA R7,2 j=2\n DO WHILE=(CR,R7,LE,R6) do j=2 to i\n LR R4,R6 i\n SRDA R4,32 ~\n LR R1,R7 j\n DR R4,R1 i/j\n LR R8,R5 d=i/j\n LR R4,R6 i\n SLA R4,1 *2 (H)\n LH R2,MM-2(R4) m(i)\n LR R1,R8 d\n SLA R1,1 *2 (H)\n LH R3,MM-2(R1) m(d)\n SR R2,R3 m(i)-m(d)\n STH R2,MM-2(R4) m(i)=m(i)-m(d)\n LA R7,1(R7) j++\n ENDDO , enddo j\n LA R6,1(R6) i++\n ENDDO , enddo i\n XPRNT =C'the first 99 Mertens numbers are:',34 print buffer\n LA R9,PG @buffer=pg\n MVC PG,=CL80' ' clean buffer\n MVC 0(3,R9),=CL3' ' output ' '\n LA R9,3(R9) @buffer+=3\n LA R7,9 j=9\n LA R6,1 i=1\n DO WHILE=(CH,R6,LE,=AL2(99)) do i=1 to 99\n LR R1,R6 i\n SLA R1,1 *2 (H)\n LH R2,MM-2(R1) m(i)\n XDECO R2,XDEC edit m(i)\n MVC 0(3,R9),XDEC+9 output m(i)\n LA R9,3(R9) @buffer+=3\n BCTR R7,0 j=j-1\n IF LTR,R7,Z,R7 THEN if j=0 then do;\n LA R7,10 j=10\n XPRNT PG,L'PG print buffer\n LA R9,PG @buffer=pg\n ENDIF , endif\n LA R6,1(R6) i++\n ENDDO , enddo i\n SR R10,R10 zero=0\n SR R11,R11 cross=0\n LA R6,1 i=2\n DO WHILE=(CH,R6,LE,=AL2(NN)) do i=2 to n\n LR R1,R6 i\n SLA R1,1 *2 (H)\n LH R2,MM-2(R1) m(i)\n IF LTR,R2,Z,R2 THEN if m(i)=0 then\n LA R10,1(R10) zero=zero+1\n LR R1,R6 i\n BCTR R1,0 i-1\n SLA R1,1 *2 (H)\n LH R2,MM-2(R1) m(i-1)\n IF LTR,R2,NZ,R2 THEN if m(i-1)^=0 then\n LA R11,1(R11) cross=cross+1\n ENDIF , endif\n ENDIF , endif\n LA R6,1(R6) i++\n ENDDO , enddo i\n MVC PG,=CL80' ' clean buffer\n MVC PG(13),=C'm(i) is zero '\n XDECO R10,XDEC edit zero\n MVC PG+13(2),XDEC+10 output zero\n MVC PG+15(7),=C' times.'\n XPRNT PG,L'PG print buffer\n MVC PGI,=H'0'\n MVC PG,=CL80' ' clean buffer\n MVC PG(18),=C'm(i) crosses zero '\n XDECO R11,XDEC edit cross\n MVC PG+18(2),XDEC+10 output cross\n MVC PG+20(7),=C' times.'\n XPRNT PG,L'PG print buffer\n L R13,4(0,R13) restore previous savearea pointer\n RETURN (14,12),RC=0 restore registers from calling save\nNN EQU 1000 n\nPG DS CL80 buffer\nPGI DC H'0' buffer index\nXDEC DS CL12 temp for xdeci xdeco\nMM DS (NN)H m\n REGEQU\n END MERTENS\n","language":"360-Assembly"},{"code":"MAX:\tequ\t1000\t; Amount of numbers to generate\n\torg\t100h\n\t;;;\tGenerate Mertens numbers\n\tlxi\tb,1\t; Start at place 1; BC = current Mertens number\t\n\tlxi\th,MM\t; First one is 1\n\tdad\tb\n\tmvi\tm,1\nouter:\tinx \tb\t; Next Mertens number\n\tlxi\th,MM\n\tdad\tb\n\tmvi\tm,1\t; Initialize at 1\n\tlxi\td,2\t; DE = inner loop counter ('k'), starts at 2\n\t;;;\tNow we need to find BC/DE, but there is no hardware divide\n\t;;;\tWe also need to be somewhat clever so it doesn't take forever\ninner:\tpush\td\t; Keep both loop counters safe on the stack\n\tpush \tb\n\txchg\t\t; Divisor in HL\n\tmov\td,b\t; Dividend in DE\n\tmov\te,c\n\tlxi\tb,100h\t; B = counter, C = zero\ndouble:\tdad\th\t; Double divisor\n\tinr\tb\t; Increment counter\n\tcall\tcdehl\t; Dividend <= divisor?\n\tjnc\tdouble\t; If so, keep doubling\t\n\tmov\ta,b\t; Keep counter\n\tmov\tb,c\t; BC = 0\n\tpush \tb\t; Push result variable on stakc (initial 0)\n\tmov\tb,a\t; Restore counter\n\txchg\t\t; HL = dividend, DE = doubled divisor\nsubtr:\tmov\ta,l\t; Try HL -= DE\n\tsub\te\n\tmov\tl,a\n\tmov\ta,h\n\tsbb\td\n\tmov\th,a\t\n\txthl\t\t; Get result accumulator from stack\n\tcmc\t\t; Flip borrow\n\tmov\ta,l\t; Rotate into result\n\tral\n\tmov\tl,a\n\tmov\ta,h\n\tral\n\tmov\th,a\n\tmov\ta,l\t; Retrieve flag\n\trar\n\txthl\t\t; Retrieve rest of divisor\n\tjc\t$+4\t; If borrow,\n\tdad\td\t; Add dividend back into divisor\t\n\txra a ; DE >> 1\n\tora d\n\trar\n\tmov d,a\n\tmov a,e\n\trar\n\tmov e,a\n\tdcr b ; Are we there yet?\n\tjnz subtr ; If not, try another subtraction\n\tpop\th \t; HL = quotient\n\t;;;\tDivision is done, do lookup and subraction\n\tlxi\td,MM\t; Look up M[outer/inner]\n\tdad\td\n\tmov\te,m\t; E = M[BC/DE]\n\tpop\tb\t; Restore BC (n)\n\tlxi\th,MM\n\tdad\tb\n\tmov\ta,m \t; A = M[BC]\n\tsub\te\t; A = M[BC] - M[BC/DE]\n\tmov\tm,a\t; M[BC] = A\n\tpop\td\t; Restore DE (k)\n\t;;;\tUpdate loops\n\tinx\td\t; k++\t\n\tcall\tcbcde\t; DE <= BC?\n\tjnc\tinner\n\tlxi\th,MAX\n\tcall\tchlbc\t; BC <= MAX?\n\tjnc\touter\n\t;;;\tPrint table\n\tlxi\td,frst99\n\tcall\tputs\n\tlxi\th,MM+1\t; Start of Merten numbers\n\tmvi\tc,9\t; Column counter\ntable:\tmov\ta,m\t; Get Merten number\n\tana\ta\t; Set flags\n\tmvi\tb,' '\t; Space\n\tjp \tprtab\t; If positive, print space-number-space\n\tmvi\tb,'-'\t; Otherwise, print minus sign\n\tcma\t\t; And negate the number (make positive)\n\tinr\ta\nprtab:\tadi\t'0'\t; Make ASCII digit\n\tmov\td,a\t; Keep number\n\tmov\ta,b\t; Print space or minus sign\n\tcall\tputc\n\tmov\ta,d\t; Restore number\n\tcall\tputc\t; Print number\n\tmvi\ta,' '\t; Print space\n\tcall\tputc\n\tdcr\tc\t; Decrement column counter\n\tjnz\ttnext\n\tlxi\td,nl\t; End of columns - print newline\n\tcall\tputs\n\tmvi\tc,10\t; Column counter\ntnext:\tinx\th\t; Table done?\n\tmov\ta,l\n\tcpi\t100\n\tjnz\ttable\t; If not, keep going\n\t;;;\tFind zeroes and crossings\n\tlxi\tb,0\t; B=zeroes, C=crossings\n\tlxi\td,MAX\t; Counter\n\tlxi\th,MM+1\ncount:\tmov\ta,m\t; Get number\n\tana\ta \t; Zero?\n\tjnz\tcnext\n\tinr\tb\t; If so, add zero\n\tdcx\th\t; Previous number also zero?\n\tmov\ta,m\n\tinx\th\n\tana\ta\n\tjz\tcnext\n\tinr\tc\t; If not, add crossiong\ncnext:\tinx\th\n\tdcx\td\n\tmov\ta,d\n\tora\te\n\tjnz\tcount\n\tlxi\td,zero\t; Print zeroes\n\tcall\tputs\n\tmov\ta,b\n\tcall\tputa\n\tlxi\td,cross ; Print crossings\n\tcall\tputs\n\tmov\ta,c\n\tcall\tputa\n\tlxi\td,tms\n\tjmp\tputs\n\t;;;\tPrint character in A using CP/M, keeping registers\nputc:\tpush\tb\n\tpush\td\n\tpush\th\n\tmov\te,a\n\tmvi\tc,2\n\tcall\t5\n\tjmp\tresrgs\n\t;;;\tPrint number in A, keeping registers\nputa:\tpush\tb\n\tpush\td\n\tpush \th\n\tlxi\th,num\nputad:\tmvi\tc,-1\t\nputal:\tinr \tc\n\tsui\t10\n\tjnc\tputal\n\tadi\t10+'0'\n\tdcx\th\n\tmov\tm,a\n\tmov\ta,c\n\tana\ta\n\tjnz\tputad\n\txchg\n\tmvi\tc,9\n\tcall\t5\n\tjmp\tresrgs\n\t;;;\tPrint string in DE using CP/M, keeping registers\nputs:\tpush\tb\n\tpush\td\n\tpush\th\n\tmvi\tc,9\n\tcall\t5\nresrgs:\tpop\th\n\tpop\td\n\tpop \tb\n\tret\ncdehl:\tmov\ta,d\n\tcmp \th\n\trnz\n\tmov\ta,e\n\tcmp\tl\n\tret\ncbcde:\tmov\ta,b\n\tcmp\td\n\trnz\n\tmov\ta,c\n\tcmp\te\n\tret\nchlbc:\tmov\ta,h\n\tcmp\tb\n\trnz\n\tmov\ta,l\n\tcmp\tc\n\tret\n\t;;;\tStrings\n\tdb\t'***'\nnum:\tdb\t'$'\nfrst99:\tdb\t'First 99 Mertens numbers:',13,10,' $'\nnl:\tdb\t13,10,'$'\t\nzero:\tdb\t'M(N) is zero $'\ncross:\tdb\t' times.',13,10,'M(N) crosses zero $'\ntms:\tdb\t' times.$'\n\t;;; Numbers are stored page-aligned after program\nMM:\tequ\t($/256)*256+256\t\n","language":"8080-Assembly"},{"code":"MAX:\tequ\t1000\t\t; Amount of Mertens numbers to generate\nputs:\tequ\t9\t\t; MS-DOS syscall to print a string\nputch:\tequ\t2\t\t; MS-DOS syscall to print a character\n\tcpu\t8086\n\torg\t100h\nsection\t.text\n\t;;;\tGenerate Mertens numbers\n\tmov\tbx,M\t\t; BX = pointer to start of Mertens numbers\n\tmov\tsi,1\t\t; Current Mertens number\n\tmov\t[si+bx],byte 1\t; First Mertens number is 1\nouter:\tinc\tsi\t\t; Next Mertens number\n\tmov\t[si+bx],byte 1\t; Starts out at 1...\n\tmov\tcx,2\t\t; CX = from 2 to current number,\ninner:\tmov\tax,si\t\t; Divide current number,\n\txor\tdx,dx\n\tdiv\tcx\t\t; By CX\n\tmov\tdi,ax\n\tmov\tal,[di+bx]\t; Get value at that location\n\tsub\t[si+bx],al \t; Subtract from current number\n\tinc\tcx\n\tcmp\tcx,si\n\tjbe\tinner\n\tcmp\tsi,MAX\n\tjbe\touter\n\t;;;\tPrint the table\n\tmov\tdx,frst99\t; First string\n\tcall\toutstr\n\tmov\tsi,1\t\t; Start at index 1\n\tmov\tdh,9\t\t; Column count\ntable:\tmov\tcl,[si+bx]\t; Get item\n\ttest\tcl,cl\n\tmov\tdl,' '\n\tjns\t.print\t\t; Positive?\n\tmov\tdl,'-'\t\t; Otherwise, it is negative,\n\tneg\tcl\t\t; print ' ' and negate\n.print:\tcall\tputc\t\t; Print space or minus\n\tadd\tcl,'0'\t\t; Add ASCII 0\n\tmov\tdl,cl\n\tcall\tputc\t\t; Print number\n\tmov \tdl,' '\n\tcall\tputc\t\t; Print space\n\tdec\tdh\t\t; One less column left\n\tjnz\t.next\n\tmov\tdx,nl\t\t; Print newline\n\tcall\toutstr\n\tmov\tdh,10\n.next:\tinc\tsi\t\t; Done yet?\n\tcmp\tsi,100\n\tjb\ttable\t\t; If not, print next item from table\n\t;;;\tCalculate zeroes and crossings\n\txor\tcx,cx\t\t; CL = zeroes, CH = crossings\n\tmov\tsi,1\n\tmov\tal,[si+bx]\t; AL = current item\nzc:\tinc\tsi\n\tmov\tah,al\t\t; AH = previous item\n\tmov\tal,[si+bx]\n\ttest\tal,al\t\t; Zero?\n\tjnz\t.next\n\tinc\tcx\t\t; Then increment zero counter\n\ttest\tah,ah\t\t; Previous one also zero?\n\tjz \t.next\n\tinc\tch\t\t; Then increment crossing counter\n.next:\tcmp\tsi,MAX\t\t; Done yet?\n\tjbe\tzc\n\t;;;\tPrint zeroes and crossings\n\tmov\tdx,zero\n\tcall\toutstr\n\tmov\tal,cl\n\tcall\tputal\n\tmov\tdx,cross\n\tcall \toutstr\n\tmov\tal,ch\n\tcall\tputal\n\tmov\tdx,tms\n\tjmp\toutstr\nputc:\tmov\tah,putch\t; Print character\n\tint\t21h\n\tret\n\t;;;\tPrint AL in decimal format\nputal:\tmov\tdi,num\n.loop:\taam\t\t\t; Extract digit\n\tadd\tal,'0'\t\t; Store digit\n\tdec\tdi\n\tmov\t[di],al\n\tmov\tal,ah\t\t; Rest of number\n\ttest\tal,al\t\t; Done?\n\tjnz\t.loop\t\t; If not, get more digits\n\tmov\tdx,di\t\t; Otherwise, print string\noutstr:\tmov\tah,puts\n\tint\t21h\n\tret\nsection .data\n\tdb\t'***'\t\t; Number output placeholder\nnum:\tdb\t'$'\nfrst99:\tdb\t'First 99 Mertens numbers:',13,10,' $'\nnl:\tdb\t13,10,'$'\t\nzero:\tdb\t'M(N) is zero $'\ncross:\tdb\t' times.',13,10,'M(N) crosses zero $'\ntms:\tdb\t' times.$'\nsection .bss\nmm:\tresb\tMAX\t; Mertens numbers\nM:\tequ\tmm-1\t; 1-based indexing\n","language":"8086-Assembly"},{"code":"INCLUDE \"D2:PRINTF.ACT\" ;from the Action! Tool Kit\n\nPROC MertensNumbers(INT ARRAY m INT count)\n INT n,k\n\n m(1)=1\n FOR n=2 TO count\n DO\n m(n)=1\n FOR k=2 TO n\n DO\n m(n)==-m(n/k)\n OD\n OD\nRETURN\n\nPROC PrintMertens(INT ARRAY m INT count)\n CHAR ARRAY s(6)\n INT i,col\n\n PrintF(\"First %I Mertens numbers:%E \",count)\n col=1\n FOR i=1 TO count\n DO\n StrI(m(i),s)\n PrintF(\"%3S\",s)\n col==+1\n IF col=10 THEN\n col=0 PutE()\n FI\n OD\nRETURN\n\nPROC Main()\n DEFINE MAX=\"1001\"\n INT ARRAY m(MAX)\n INT i,zeroCnt=[0],crossCnt=[0],prev=[0]\n\n Put(125) PutE() ;clear the screen\n PrintF(\"Calculation of Mertens numbers,%E please wait...\")\n MertensNumbers(m,MAX)\n\n Put(125) PutE() ;clear the screen\n PrintMertens(m,99)\n\n FOR i=1 TO MAX\n DO\n IF m(i)=0 THEN\n zeroCnt==+1\n IF prev THEN\n crossCnt==+1\n FI\n FI\n prev=m(i)\n OD\n PrintF(\"%EM(n) is zero %I times for 1<=n<=%I.%E\",zeroCnt,MAX-1)\n PrintF(\"%EM(n) crosses zero %I times for 1<=n<=%I.%E\",crossCnt,MAX-1)\nRETURN\n","language":"Action-"},{"code":"BEGIN # compute values of the Mertens function #\n # Generate Mertens numbers #\n [ 1 : 1000 ]INT m;\n m[ 1 ] := 1;\n FOR n FROM 2 TO UPB m DO\n m[ n ] := 1;\n FOR k FROM 2 TO n DO m[ n ] -:= m[ n OVER k ] OD\n OD;\n # Print table #\n print( ( \"The first 99 Mertens numbers are:\", newline ) );\n print( ( \" \" ) );\n INT k := 9;\n FOR n TO 99 DO\n print( ( whole( m[ n ], -3 ) ) );\n IF ( k -:= 1 ) = 0 THEN\n k := 10;\n print( ( newline ) )\n FI\n OD;\n # Calculate zeroes and crossings #\n INT zero := 0;\n INT cross := 0;\n FOR n FROM 2 TO UPB m DO\n IF m[ n ] = 0 THEN\n zero +:= 1;\n IF m[ n - 1 ] /= 0 THEN cross +:= 1 FI\n FI\n OD;\n print( ( newline ) );\n print( ( \"M(N) is zero \", whole( zero, -4 ), \" times.\", newline ) );\n print( ( \"M(N) crosses zero \", whole( cross, -4 ), \" times.\", newline ) )\nEND\n","language":"ALGOL-68"},{"code":"begin % compute values of the Mertens function %\n integer array M ( 1 :: 1000 );\n integer k, zero, cross;\n % Generate Mertens numbers %\n M( 1 ) := 1;\n for n := 2 until 1000 do begin\n M( n ) := 1;\n for k := 2 until n do M( n ) := M( n ) - M( n div k )\n end for_n ;\n % Print table %\n write( \"The first 99 Mertens numbers are:\" );\n write( \" \" );\n k := 9;\n for n := 1 until 99 do begin\n writeon( i_w := 3, s_w := 0, M( n ) );\n k := k - 1;\n if k = 0 then begin\n k := 10;\n write()\n end if_k_eq_0\n end for_n ;\n % Calculate zeroes and crossings %\n zero := 0;\n cross := 0;\n for n :=2 until 1000 do begin\n if M( n ) = 0 then begin\n zero := zero + 1;\n if M( n - 1 ) not = 0 then cross := cross + 1\n end if_M_n_eq_0\n end for_n ;\n write( i_w := 2, s_w := 0, \"M(N) is zero \", zero, \" times.\" );\n write( i_w := 2, s_w := 0, \"M(N) crosses zero \", cross, \" times.\" )\nend.\n","language":"ALGOL-W"},{"code":"mertens←{\n step ← {⍵,-⍨/⌽1,⍵[⌊n÷1↓⍳n←1+≢⍵]}\n m1000 ← step⍣999⊢,1\n zero ← m1000+.=0\n cross ← +/(~∧1⌽⊢)m1000≠0\n ⎕←'First 99 Mertens numbers:'\n ⎕←10 10⍴'∘',m1000\n ⎕←'M(N) is zero ',(⍕zero),' times.'\n ⎕←'M(N) crosses zero ',(⍕cross),' times.'\n}\n","language":"APL"},{"code":"mobius: function [n][\n if n=0 -> return \"\"\n if n=1 -> return 1\n f: factors.prime n\n\n if f <> unique f -> return 0\n if? odd? size f -> return neg 1\n else -> return 1\n]\n\nmertens: function [z][sum map 1..z => mobius]\n\nprint \"The first 99 Mertens numbers are:\"\nloop split.every:20 [\"\"]++map 1..99 => mertens 'a [\n print map a 'item -> pad to :string item 2\n]\n\nprint \"\"\n\nmertens1000: map 1..1000 => mertens\nprint [\"Times M(x) is zero between 1 and 1000:\" size select mertens1000 => zero?]\n\ncrossed: new 0\nfold mertens1000 [a,b][if and? zero? b not? zero? a -> inc 'crossed, b]\nprint [\"Times M(x) crosses zero between 1 and 1000:\" crossed]\n","language":"Arturo"},{"code":"result := \"first 100 terms:`n\"\nloop 100\n result .= SubStr(\" \" Mertens(A_Index), -1) . (Mod(A_Index, 10) ? \" \" : \"`n\")\n\neqZero := crZero := 0, preced:=1\nloop 1000\n{\n if !(x := Mertens(A_Index))\n eqZero++, crZero += preced<>0 ? 1 : 0\n preced := x\n}\nresult .= \"`nfirst 1000 terms:\"\nMsgBox, 262144, , % result .= \"`nequal to zero : \" eqZero \"`ncrosses zero : \" crZero\nreturn\n\nMertens(n){\n loop % n\n result += Möbius(A_Index)\n return result\n}\n\n\nMöbius(n){\n if n=1\n return 1\n x := prime_factors(n)\n c := x.Count()\n sq := []\n for i, v in x\n if sq[v]\n return 0\n else\n sq[v] := 1\n return (c/2 = floor(c/2)) ? 1 : -1\n}\n\nprime_factors(n) {\n if (n <= 3)\n return [n]\n ans := [], done := false\n while !done {\n if !Mod(n, 2)\n ans.push(2), n /= 2\n else if !Mod(n, 3)\n ans.push(3), n /= 3\n else if (n = 1)\n return ans\n else {\n sr := sqrt(n), done := true, i := 6\n while (i <= sr+6) {\n if !Mod(n, i-1) { ; is n divisible by i-1?\n ans.push(i-1), n /= i-1, done := false\n break\n }\n if !Mod(n, i+1) { ; is n divisible by i+1?\n ans.push(i+1), n /= i+1, done := false\n break\n }\n i += 6\n }}}\n ans.push(Format(\"{:d}\", n))\n return ans\n}\n","language":"AutoHotkey"},{"code":"10 DEFINT C,Z,N,K,M: DIM M(1000)\n20 M(1)=1\n30 FOR N=2 TO 1000\n40 M(N)=1\n50 FOR K=2 TO N: M(N) = M(N)-M(INT(N/K)): NEXT\n60 NEXT\n70 PRINT \"First 99 Mertens numbers:\"\n80 PRINT \" \";\n90 FOR N=1 TO 99\n100 PRINT USING \"###\";M(N);\n110 IF N MOD 10 = 9 THEN PRINT\n120 NEXT\n130 C=0: Z=0\n140 FOR N=1 TO 1000\n150 IF M(N)=0 THEN Z=Z+1: IF M(N-1)<>0 THEN C=C+1\n160 NEXT\n170 PRINT \"M(N) is zero\";Z;\"times.\"\n180 PRINT \"M(N) crosses zero\";C;\"times.\"\n190 END\n","language":"BASIC"},{"code":"arraybase 1\ndim M(1000)\nM[1] = 1\nfor n = 2 to 1000\n\tM[n] = 1\n\tfor k = 2 to n\n\t\tM[n] = M[n] - M[int(n/k)]\n\tnext k\nnext n\nprint \"First 99 Mertens numbers:\"\nprint \" \";\nfor n = 1 to 99\n\tprint rjust(string(M[n]),3);\n\tif n mod 10 = 9 then print\nnext n\nnumCruza = 0\nnumEsCero = 0\nfor n = 1 to 1000\n\tif M[n] = 0 then\n\t\tnumEsCero += 1\n\t\tif M[n-1] <> 0 then numCruza += 1\n\tend if\nnext n\nprint\nprint \"M(n) is zero \"; numEsCero; \" times.\"\nprint \"M(n) crosses zero \"; numCruza; \" times.\"\n","language":"BASIC256"},{"code":"get \"libhdr\"\n\nmanifest $( limit = 1000 $)\n\nlet mertens(v, max) be\n$( v!1 := 1\n for n = 2 to max do\n $( v!n := 1\n for k = 2 to n do\n v!n := v!n - v!(n/k)\n $)\n$)\n\nlet start() be\n$( let m = vec limit\n let eqz, crossz = 0, 0\n\n writes(\"The first 99 Mertens numbers are:*N\")\n mertens(m, limit)\n for y=0 to 90 by 10 do\n $( for x=0 to 9 do\n test x+y=0\n then writes(\" \")\n else writed(m!(x+y),3)\n wrch('*N')\n $)\n\n for x=2 to limit do\n if m!x=0 then\n $( eqz := eqz + 1\n unless m!(x-1)=0 do crossz := crossz + 1\n $)\n\n writef(\"M(N) is zero %N times.*N\", eqz)\n writef(\"M(N) crosses zero %N times.*N\", crossz)\n$)\n","language":"BCPL"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n\nint* mertens_numbers(int max) {\n int* m = malloc((max + 1) * sizeof(int));\n if (m == NULL)\n return m;\n m[1] = 1;\n for (int n = 2; n <= max; ++n) {\n m[n] = 1;\n for (int k = 2; k <= n; ++k)\n m[n] -= m[n/k];\n }\n return m;\n}\n\nint main() {\n const int max = 1000;\n int* mertens = mertens_numbers(max);\n if (mertens == NULL) {\n fprintf(stderr, \"Out of memory\\n\");\n return 1;\n }\n printf(\"First 199 Mertens numbers:\\n\");\n const int count = 200;\n for (int i = 0, column = 0; i < count; ++i) {\n if (column > 0)\n printf(\" \");\n if (i == 0)\n printf(\" \");\n else\n printf(\"%2d\", mertens[i]);\n ++column;\n if (column == 20) {\n printf(\"\\n\");\n column = 0;\n }\n }\n int zero = 0, cross = 0, previous = 0;\n for (int i = 1; i <= max; ++i) {\n int m = mertens[i];\n if (m == 0) {\n ++zero;\n if (previous != 0)\n ++cross;\n }\n previous = m;\n }\n free(mertens);\n printf(\"M(n) is zero %d times for 1 <= n <= %d.\\n\", zero, max);\n printf(\"M(n) crosses zero %d times for 1 <= n <= %d.\\n\", cross, max);\n return 0;\n}\n","language":"C"},{"code":"#include <iomanip>\n#include <iostream>\n#include <vector>\n\nstd::vector<int> mertens_numbers(int max) {\n std::vector<int> m(max + 1, 1);\n for (int n = 2; n <= max; ++n) {\n for (int k = 2; k <= n; ++k)\n m[n] -= m[n / k];\n }\n return m;\n}\n\nint main() {\n const int max = 1000;\n auto m(mertens_numbers(max));\n std::cout << \"First 199 Mertens numbers:\\n\";\n for (int i = 0, column = 0; i < 200; ++i) {\n if (column > 0)\n std::cout << ' ';\n if (i == 0)\n std::cout << \" \";\n else\n std::cout << std::setw(2) << m[i];\n ++column;\n if (column == 20) {\n std::cout << '\\n';\n column = 0;\n }\n }\n int zero = 0, cross = 0, previous = 0;\n for (int i = 1; i <= max; ++i) {\n if (m[i] == 0) {\n ++zero;\n if (previous != 0)\n ++cross;\n }\n previous = m[i];\n }\n std::cout << \"M(n) is zero \" << zero << \" times for 1 <= n <= 1000.\\n\";\n std::cout << \"M(n) crosses zero \" << cross << \" times for 1 <= n <= 1000.\\n\";\n return 0;\n}\n","language":"C++"},{"code":"% Generate Mertens numbers up to a given limit\nmertens = proc (limit: int) returns (array[int])\n M: array[int] := array[int]$fill(1,limit,0)\n M[1] := 1\n for n: int in int$from_to(2,limit) do\n M[n] := 1\n for k: int in int$from_to(2,n) do\n M[n] := M[n] - M[n/k]\n end\n end\n return (M)\nend mertens\n\nstart_up = proc ()\n max = 1000\n\n po: stream := stream$primary_output()\n M: array[int] := mertens(max)\n\n stream$putl(po, \"The first 99 Mertens numbers are:\")\n for y: int in int$from_to_by(0,90,10) do\n for x: int in int$from_to(0,9) do\n stream$putright(po, int$unparse(M[x+y]), 3)\n except when bounds:\n stream$putright(po, \"\", 3)\n end\n end\n stream$putl(po, \"\")\n end\n\n eqz: int := 0\n crossz: int := 0\n for i: int in int$from_to(2,max) do\n if M[i]=0 then\n eqz := eqz + 1\n if M[i-1]~=0 then crossz := crossz + 1 end\n end\n end\n\n stream$putl(po, \"M(N) is zero \" || int$unparse(eqz) || \" times.\")\n stream$putl(po, \"M(N) crosses zero \" || int$unparse(crossz) || \" times.\")\nend start_up\n","language":"CLU"},{"code":" IDENTIFICATION DIVISION.\n PROGRAM-ID. MERTENS.\n\n DATA DIVISION.\n WORKING-STORAGE SECTION.\n 01 VARIABLES.\n 03 M PIC S99 OCCURS 1000 TIMES.\n 03 N PIC 9(4).\n 03 K PIC 9(4).\n 03 V PIC 9(4).\n 03 IS-ZERO PIC 99 VALUE 0.\n 03 CROSS-ZERO PIC 99 VALUE 0.\n\n 01 OUTPUT-FORMAT.\n 03 OUT-ITEM.\n 05 OUT-NUM PIC -9.\n 05 FILLER PIC X VALUE SPACE.\n 03 OUT-LINE PIC X(30) VALUE SPACES.\n 03 OUT-PTR PIC 99 VALUE 4.\n\n PROCEDURE DIVISION.\n BEGIN.\n PERFORM GENERATE-MERTENS.\n PERFORM WRITE-TABLE.\n PERFORM COUNT-ZEROES.\n STOP RUN.\n\n GENERATE-MERTENS.\n MOVE 1 TO M(1).\n PERFORM MERTENS-OUTER-LOOP VARYING N FROM 2 BY 1\n UNTIL N IS GREATER THAN 1000.\n\n MERTENS-OUTER-LOOP.\n MOVE 1 TO M(N).\n PERFORM MERTENS-INNER-LOOP VARYING K FROM 2 BY 1\n UNTIL K IS GREATER THAN N.\n\n MERTENS-INNER-LOOP.\n DIVIDE N BY K GIVING V.\n SUBTRACT M(V) FROM M(N).\n\n WRITE-TABLE.\n DISPLAY \"The first 99 Mertens numbers are: \"\n PERFORM WRITE-ITEM VARYING N FROM 1 BY 1\n UNTIL N IS GREATER THAN 99.\n\n WRITE-ITEM.\n MOVE M(N) TO OUT-NUM.\n STRING OUT-ITEM DELIMITED BY SIZE INTO OUT-LINE\n WITH POINTER OUT-PTR.\n IF OUT-PTR IS EQUAL TO 31,\n DISPLAY OUT-LINE,\n MOVE 1 TO OUT-PTR.\n\n COUNT-ZEROES.\n PERFORM TEST-N-ZERO VARYING N FROM 2 BY 1\n UNTIL N IS GREATER THAN 1000.\n DISPLAY \"M(N) is zero \" IS-ZERO \" times.\".\n DISPLAY \"M(N) crosses zero \" CROSS-ZERO \" times.\".\n\n TEST-N-ZERO.\n IF M(N) IS EQUAL TO ZERO,\n ADD 1 TO IS-ZERO,\n SUBTRACT 1 FROM N GIVING K,\n IF M(K) IS NOT EQUAL TO ZERO,\n ADD 1 TO CROSS-ZERO.\n","language":"COBOL"},{"code":"include \"cowgol.coh\";\n\nconst MAX := 1000;\n\n# Table output\nsub printtab(n: int8) is\n if n<0 then\n print_char('-');\n n := -n;\n else\n print_char(' ');\n end if;\n print_char(n as uint8 + '0');\n print_char(' ');\nend sub;\n\n# Generate Merten numbers\nvar M: int8[MAX+1];\nM[0] := 0;\nM[1] := 1;\n\nvar n: @indexof M := 2;\nwhile n < @sizeof M loop\n M[n] := 1;\n var k: @indexof M := 2;\n while k <= n loop\n M[n] := M[n] - M[n/k];\n k := k + 1;\n end loop;\n n := n + 1;\nend loop;\n\n# Find zeroes and crossings\nvar zero: uint8 := 0;\nvar cross: uint8 := 0;\nn := 1;\nwhile n < @sizeof M loop\n if M[n] == 0 then\n zero := zero + 1;\n if M[n-1] != 0 then\n cross := cross + 1;\n end if;\n end if;\n n := n + 1;\nend loop;\n\n# Print table\nprint(\"The first 99 Mertens numbers are:\\n\");\nprint(\" \");\nn := 1;\nvar col: uint8 := 9;\nwhile n < 100 loop\n printtab(M[n]);\n col := col - 1;\n if col == 0 then\n print_nl();\n col := 10;\n end if;\n n := n + 1;\nend loop;\n\nprint(\"M(n) is zero \"); print_i8(zero); print(\" times\\n\");\nprint(\"M(n) crosses zero \"); print_i8(cross); print(\" times\\n\");\n","language":"Cowgol"},{"code":"program Mertens_function;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils;\n\ntype\n TMertens = record\n merts: TArray<Integer>;\n zeros, crosses: Integer;\n class function Mertens(_to: Integer): TMertens; static;\n end;\n\n{ TMertens }\n\nclass function TMertens.Mertens(_to: Integer): TMertens;\nvar\n sum, zeros, crosses: Integer;\nbegin\n if _to < 1 then\n _to := 1;\n\n sum := 0;\n zeros := 0;\n crosses := 0;\n\n SetLength(Result.merts, _to + 1);\n var primes := [2];\n for var i := 1 to _to do\n begin\n var j := i;\n var cp := 0;\n var spf := false;\n for var p in primes do\n begin\n if p > j then\n Break;\n if j mod p = 0 then\n begin\n j := j div p;\n inc(cp);\n end;\n\n if j mod p = 0 then\n begin\n spf := true;\n Break;\n end;\n end;\n if (cp = 0) and (i > 2) then\n begin\n cp := 1;\n SetLength(primes, Length(primes) + 1);\n primes[High(primes)] := i;\n end;\n\n if not spf then\n begin\n if cp mod 2 = 0 then\n inc(sum)\n else\n dec(sum);\n end;\n\n Result.merts[i] := sum;\n if sum = 0 then\n begin\n inc(zeros);\n if (i > 1) and (Result.merts[i - 1] <> 0) then\n inc(crosses);\n end;\n end;\n Result.zeros := zeros;\n Result.crosses := crosses;\nend;\n\nbegin\n var m := TMertens.mertens(1000);\n writeln('Mertens sequence - First 199 terms:');\n for var i := 0 to 199 do\n begin\n if i = 0 then\n begin\n write(' ');\n Continue;\n end;\n if i mod 20 = 0 then\n writeln;\n write(format(' %3d', [m.merts[i]]));\n end;\n writeln(#10#10'Equals zero ', m.zeros, ' times between 1 and 1000');\n writeln(#10'Crosses zero ', m.crosses, ' times between 1 and 1000');\n {$IFNDEF UNIX} readln; {$ENDIF}\nend.\n","language":"Delphi"},{"code":"proc nonrec mertens([*] short m) void:\n word n,k;\n m[1] := 1;\n for n from 2 upto dim(m,1)-1 do\n m[n] := 1;\n for k from 2 upto n do\n m[n] := m[n] - m[n/k]\n od\n od\ncorp\n\nproc nonrec main() void:\n [1001] short m;\n word x, y, eqz, crossz;\n\n mertens(m);\n writeln(\"The first 99 Mertens numbers are:\");\n for y from 0 by 10 upto 90 do\n for x from 0 upto 9 do\n if x+y=0\n then write(\" \")\n else write(m[x+y]:3)\n fi\n od;\n writeln()\n od;\n\n eqz := 0;\n crossz := 0;\n for x from 2 upto dim(m,1)-1 do\n if m[x]=0 then\n eqz := eqz + 1;\n if m[x-1]~=0 then crossz := crossz + 1 fi\n fi\n od;\n writeln(\"M(N) is zero \",eqz,\" times.\");\n writeln(\"M(N) crosses zero \",crossz,\" times.\")\ncorp\n","language":"Draco"},{"code":"func mertensNumbers(max) {\n let mertens = Array.Empty(max + 1, 1)\n for n in 2..max {\n for k in 2..n {\n mertens[n] -= mertens[n / k]\n }\n }\n mertens\n}\n\nlet max = 1000\nlet mertens = mertensNumbers(max)\n\nlet count = 200\nlet columns = 20\nprint(\"First \\(count - 1) Mertens numbers:\")\n\nfor i in 0..<count {\n if i % columns > 0 {\n print(\" \", terminator: \"\")\n }\n print(i == 0 ? \" \" : mertens[i].ToString().PadLeft(2, ' ') + \" \", terminator: \"\")\n if (i + 1) % columns == 0 {\n print()\n }\n}\n\nvar (zero, cross, previous) = (0, 0, 0)\nfor i in 1..max {\n let m = mertens[i]\n if m == 0 {\n zero += 1\n if previous != 0 {\n cross += 1\n }\n }\n previous = m\n}\n\nprint(\"M(n) is zero \\(zero) times for 1 <= n <= \\(max).\")\nprint(\"M(n) crosses zero \\(cross) times for 1 <= n <= \\(max).\")\n","language":"Dyalect"},{"code":"len mertens[] 1000\nmertens[1] = 1\nfor n = 2 to 1000\n mertens[n] = 1\n for k = 2 to n\n mertens[n] -= mertens[n div k]\n .\n.\nprint \"First 99 Mertens numbers:\"\nwrite \" \"\nnumfmt 0 2\nfor n = 1 to 99\n write mertens[n] & \" \"\n if n mod 10 = 9\n print \"\"\n .\n.\nfor n = 1 to 1000\n if mertens[n] = 0\n zeros += 1\n if mertens[n - 1] <> 0\n crosses += 1\n .\n .\n.\nprint \"\"\nprint \"In the first 1000 terms of the Mertens sequence there are:\"\nprint zeros & \" zeros\"\nprint crosses & \" zero crosses\"\n","language":"EasyLang"},{"code":"// Mertens function. Nigel Galloway: January 31st., 2021\nlet mertens=mobius|>Seq.scan((+)) 0|>Seq.tail\nmertens|>Seq.take 500|>Seq.chunkBySize 25|>Seq.iter(fun n->Array.iter(printf \"%3d\") n;printfn \"\\n####\")\nlet n=mertens|>Seq.take 1000|>Seq.mapi(fun n g->(n+1,g))|>Seq.groupBy snd|>Map.ofSeq\nn|>Map.iter(fun n g->printf \"%3d->\" n; g|>Seq.iter(fun(n,_)->printf \"%3d \" n); printfn \"\\n####\")\nprintfn \"%d Zeroes\\n####\" (Seq.length (snd n.[0]))\nprintfn \"Crosses zero %d times\" (mertens|>Seq.take 1000|>Seq.pairwise|>Seq.sumBy(fun(n,g)->if n<>0 && g=0 then 1 else 0)))\n","language":"F-Sharp"},{"code":"USING: formatting grouping io kernel math math.extras\nmath.ranges math.statistics prettyprint sequences ;\n\n! Take the cumulative sum of the mobius sequence to avoid\n! summing lower terms over and over.\n: mertens-upto ( n -- seq ) [1,b] [ mobius ] map cum-sum ;\n\n\"The first 199 terms of the Mertens sequence:\" print\n199 mertens-upto \" \" prefix 20 group\n[ [ \"%3s\" printf ] each nl ] each nl\n\n\"In the first 1,000 terms of the Mertens sequence there are:\"\nprint 1000 mertens-upto\n[ [ zero? ] count bl pprint bl \"zeros.\" print ]\n[\n 2 <clumps> [ first2 [ 0 = not ] [ zero? ] bi* and ] count bl\n pprint bl \"zero crossings.\" print\n] bi\n","language":"Factor"},{"code":": AMOUNT 1000 ;\n\nvariable mertens AMOUNT cells allot\n: M 1- cells mertens + ; \\ 1-indexed array\n\n: make-mertens\n 1 1 M !\n 2 begin dup AMOUNT <= while\n 1 over M !\n 2 begin over over >= while\n over over / M @\n 2 pick M @ swap -\n 2 pick M !\n 1+ repeat\n drop\n 1+ repeat\n drop\n;\n\n: print-row\n begin dup while\n swap dup M @ 3 .r 1+\n swap 1-\n repeat\n drop\n;\n\n: print-table .\" \"\n 1 9 print-row cr\n begin dup 100 < while 10 print-row cr repeat\n drop\n;\n\n: find-zero-cross\n 0 0\n 1 begin dup AMOUNT <= while\n dup M @ 0= if\n swap 1+ swap\n dup 1- M @ 0<> if rot 1+ -rot then\n then\n 1+\n repeat\n drop\n;\n\nmake-mertens\n.\" The first 99 Mertens numbers are:\" cr print-table\nfind-zero-cross\n.\" M(N) is zero \" . .\" times.\" cr\n.\" M(N) crosses zero \" . .\" times.\" cr\nbye\n","language":"Forth"},{"code":" program Mertens\n implicit none\n integer M(1000), n, k, zero, cross\n\nC Generate Mertens numbers\n M(1) = 1\n do 10 n=2, 1000\n M(n) = 1\n do 10 k=2, n\n M(n) = M(n) - M(n/k)\n 10 continue\n\nC Print table\n write (*,\"('The first 99 Mertens numbers are:')\")\n write (*,\"(' ')\",advance='no')\n k = 9\n do 20 n=1, 99\n write (*,'(I3)',advance='no') M(n)\n k = k-1\n if (k .EQ. 0) then\n k=10\n write (*,*)\n end if\n 20 continue\n\nC Calculate zeroes and crossings\n zero = 0\n cross = 0\n do 30 n=2, 1000\n if (M(n) .EQ. 0) then\n zero = zero + 1\n if (M(n-1) .NE. 0) cross = cross+1\n end if\n 30 continue\n\n 40 format(\"M(N) is zero \",I2,\" times.\")\n write (*,40) zero\n 50 format(\"M(N) crosses zero \",I2,\" times.\")\n write (*,50) cross\n end program\n","language":"Fortran"},{"code":"function padto( i as ubyte, j as integer ) as string\n return wspace(i-len(str(j)))+str(j)\nend function\n\ndim as integer M( 1 to 1000 ), n, col, k, psum\ndim as integer num_zeroes = 0, num_cross = 0\ndim as string outstr\n\nM(1) = 1\nfor n = 2 to 1000\n psum = 0\n for k = 2 to n\n psum += M(int(n/k))\n next k\n M(n) = 1 - psum\n if M(n) = 0 then\n num_zeroes += 1\n if M(n-1)<>0 then\n num_cross += 1\n end if\n end if\nnext n\n\nprint using \"There are ### zeroes in the range 1 to 1000.\"; num_zeroes\nprint using \"There are ### crossings in the range 1 to 1000.\"; num_cross\nprint \"The first 100 Mertens numbers are: \"\n\nfor n=1 to 100\n outstr += padto(3, M(n))+\" \"\n if n mod 10 = 0 then\n print outstr\n outstr = \"\"\n end if\nnext n\n","language":"FreeBASIC"},{"code":"void local fn MertensFunction\n long mertens(1000), n, k, crossesTotal = 0, zerosTotal = 0\n\n mertens(1) = 1\n\n for n = 2 to 1000\n mertens(n) = 1\n for k = 2 to n\n mertens(n) = mertens(n) - mertens(n/k)\n next\n next\n\n printf @\"First 99 Mertens numbers:\\n \\b\"\n\n for n = 1 to 99\n printf @\"%3ld \\b\", mertens(n)\n if ( n mod 10 == 9 ) then print\n next\n\n for n = 1 to 1000\n if ( mertens(n) == 0 )\n zerosTotal++\n if mertens(n-1) != 0 then crossesTotal++\n end if\n next\n\n print\n printf @\"mertens(n) array is zero %ld times.\", zerosTotal\n printf @\"mertens(n) array crosses zero %ld times.\", crossesTotal\nend fn\n\nfn MertensFunction\n\nHandleEvents\n","language":"FutureBasic"},{"code":"package main\n\nimport \"fmt\"\n\nfunc mertens(to int) ([]int, int, int) {\n if to < 1 {\n to = 1\n }\n merts := make([]int, to+1)\n primes := []int{2}\n var sum, zeros, crosses int\n for i := 1; i <= to; i++ {\n j := i\n cp := 0 // counts prime factors\n spf := false // true if there is a square prime factor\n for _, p := range primes {\n if p > j {\n break\n }\n if j%p == 0 {\n j /= p\n cp++\n }\n if j%p == 0 {\n spf = true\n break\n }\n }\n if cp == 0 && i > 2 {\n cp = 1\n primes = append(primes, i)\n }\n if !spf {\n if cp%2 == 0 {\n sum++\n } else {\n sum--\n }\n }\n merts[i] = sum\n if sum == 0 {\n zeros++\n if i > 1 && merts[i-1] != 0 {\n crosses++\n }\n }\n }\n return merts, zeros, crosses\n}\n\nfunc main() {\n merts, zeros, crosses := mertens(1000)\n fmt.Println(\"Mertens sequence - First 199 terms:\")\n for i := 0; i < 200; i++ {\n if i == 0 {\n fmt.Print(\" \")\n continue\n }\n if i%20 == 0 {\n fmt.Println()\n }\n fmt.Printf(\" % d\", merts[i])\n }\n fmt.Println(\"\\n\\nEquals zero\", zeros, \"times between 1 and 1000\")\n fmt.Println(\"\\nCrosses zero\", crosses, \"times between 1 and 1000\")\n}\n","language":"Go"},{"code":"import Data.List.Split (chunksOf)\nimport qualified Data.MemoCombinators as Memo\nimport Math.NumberTheory.Primes (unPrime, factorise)\nimport Text.Printf (printf)\n\nmoebius :: Integer -> Int\nmoebius = product . fmap m . factorise\n where\n m (p, e)\n | unPrime p == 0 = 0\n | e == 1 = -1\n | otherwise = 0\n\nmertens :: Integer -> Int\nmertens = Memo.integral (\\n -> sum $ fmap moebius [1..n])\n\ncountZeros :: [Integer] -> Int\ncountZeros = length . filter ((==0) . mertens)\n\ncrossesZero :: [Integer] -> Int\ncrossesZero = length . go . fmap mertens\n where\n go (x:y:xs)\n | y == 0 && x /= 0 = y : go (y:xs)\n | otherwise = go (y:xs)\n go _ = []\n\nmain :: IO ()\nmain = do\n printf \"The first 99 terms for M(1..99):\\n\\n \"\n mapM_ (printf \"%3d\" . mertens) [1..9] >> printf \"\\n\"\n mapM_ (\\row -> mapM_ (printf \"%3d\" . mertens) row >> printf \"\\n\") $ chunksOf 10 [10..99]\n printf \"\\nM(n) is zero %d times for 1 <= n <= 1000.\\n\" $ countZeros [1..1000]\n printf \"M(n) crosses zero %d times for 1 <= n <= 1000.\\n\" $ crossesZero [1..1000]\n","language":"Haskell"},{"code":"mu =: 0:`(1 - 2 * 2|#@{.)@.(1: = */@{:)@(2&p:)\"0\nM =: +/@([: mu 1:+i.)\n\nm1000 =: (M\"0) 1+i.1000\nzero =: +/ m1000 = 0\ncross =: +/ (-.*.1:|]) m1000 ~: 0\n\necho 'The first 99 Merten numbers are'\necho 10 10$ __, 99{.m1000\necho 'M(N) is zero ',(\":zero),' times.'\necho 'M(N) crosses zero ',(\":cross),' times.'\nexit''\n","language":"J"},{"code":"public class MertensFunction {\n\n public static void main(String[] args) {\n System.out.printf(\"First 199 terms of the merten function are as follows:%n \");\n for ( int n = 1 ; n < 200 ; n++ ) {\n System.out.printf(\"%2d \", mertenFunction(n));\n if ( (n+1) % 20 == 0 ) {\n System.out.printf(\"%n\");\n }\n }\n\n for ( int exponent = 3 ; exponent<= 8 ; exponent++ ) {\n int zeroCount = 0;\n int zeroCrossingCount = 0;\n int positiveCount = 0;\n int negativeCount = 0;\n int mSum = 0;\n int mMin = Integer.MAX_VALUE;\n int mMinIndex = 0;\n int mMax = Integer.MIN_VALUE;\n int mMaxIndex = 0;\n int nMax = (int) Math.pow(10, exponent);\n for ( int n = 1 ; n <= nMax ; n++ ) {\n int m = mertenFunction(n);\n mSum += m;\n if ( m < mMin ) {\n mMin = m;\n mMinIndex = n;\n }\n if ( m > mMax ) {\n mMax = m;\n mMaxIndex = n;\n }\n if ( m > 0 ) {\n positiveCount++;\n }\n if ( m < 0 ) {\n negativeCount++;\n }\n if ( m == 0 ) {\n zeroCount++;\n }\n if ( m == 0 && mertenFunction(n - 1) != 0 ) {\n zeroCrossingCount++;\n }\n }\n System.out.printf(\"%nFor M(x) with x from 1 to %,d%n\", nMax);\n System.out.printf(\"The maximum of M(x) is M(%,d) = %,d.%n\", mMaxIndex, mMax);\n System.out.printf(\"The minimum of M(x) is M(%,d) = %,d.%n\", mMinIndex, mMin);\n System.out.printf(\"The sum of M(x) is %,d.%n\", mSum);\n System.out.printf(\"The count of positive M(x) is %,d, count of negative M(x) is %,d.%n\", positiveCount, negativeCount);\n System.out.printf(\"M(x) has %,d zeroes in the interval.%n\", zeroCount);\n System.out.printf(\"M(x) has %,d crossings in the interval.%n\", zeroCrossingCount);\n }\n }\n\n private static int MU_MAX = 100_000_000;\n private static int[] MU = null;\n private static int[] MERTEN = null;\n\n // Compute mobius and merten function via sieve\n private static int mertenFunction(int n) {\n if ( MERTEN != null ) {\n return MERTEN[n];\n }\n\n // Populate array\n MU = new int[MU_MAX+1];\n MERTEN = new int[MU_MAX+1];\n MERTEN[1] = 1;\n int sqrt = (int) Math.sqrt(MU_MAX);\n for ( int i = 0 ; i < MU_MAX ; i++ ) {\n MU[i] = 1;\n }\n\n for ( int i = 2 ; i <= sqrt ; i++ ) {\n if ( MU[i] == 1 ) {\n // for each factor found, swap + and -\n for ( int j = i ; j <= MU_MAX ; j += i ) {\n MU[j] *= -i;\n }\n // square factor = 0\n for ( int j = i*i ; j <= MU_MAX ; j += i*i ) {\n MU[j] = 0;\n }\n }\n }\n\n int sum = 1;\n for ( int i = 2 ; i <= MU_MAX ; i++ ) {\n if ( MU[i] == i ) {\n MU[i] = 1;\n }\n else if ( MU[i] == -i ) {\n MU[i] = -1;\n }\n else if ( MU[i] < 0 ) {\n MU[i] = 1;\n }\n else if ( MU[i] > 0 ) {\n MU[i] = -1;\n }\n sum += MU[i];\n MERTEN[i] = sum;\n }\n return MERTEN[n];\n }\n\n}\n","language":"Java"},{"code":"def sum(s): reduce s as $x (null; . + $x);\n\ndef nwise($n):\n def n: if length <= $n then . else .[0:$n] , (.[$n:] | n) end;\n n;\n\ndef lpad($len): tostring | ($len - length) as $l | (\" \" * $l)[:$l] + .;\n\n# input: an array\n# output: number of crossings at $value\ndef count_crossings($value):\n . as $a\n | reduce range(0; length) as $i ({};\n if $a[$i] == $value\n then if $i == 0 or .prev != $value then .count += 1 else . end\n else .\n end\n | .prev = $a[$i] )\n | .count;\n","language":"Jq"},{"code":"# Input: $max >= 1\n# Output: an array of size $max with $max mertenNumbers beginning with 1\ndef mertensNumbers:\n . as $max\n | reduce range(2; $max + 1) as $n ( [1];\n .[$n-1]=1\n | reduce range(2; $n+1) as $k (.;\n .[$n-1] -= .[($n / $k) | floor - 1] ));\n","language":"Jq"},{"code":"# Task 0:\ndef mertens_number:\n mertensNumbers[.-1];\n\ndef task1:\n \"The first \\(.) Mertens numbers are:\",\n (mertensNumbers | nwise(10) | map(lpad(2)) | join(\" \") );\n\ndef task2:\n . as $n\n | sum(mertensNumbers[] | select(.==0) | 1)\n | \"M(n) is zero \\(.) times for 1 <= n <= \\($n)\\n\";\n\ndef task3:\n . as $n\n | mertensNumbers\n | count_crossings(0)\n | \"M(n) crosses zero \\(.) times for 1 <= n <= \\($n).\\n\" ;\n\n(99|task1),\n\"\",\n(1000 | (task2, task3))\n","language":"Jq"},{"code":"using Primes, Formatting\n\nfunction moebius(n::Integer)\n @assert n > 0\n m(p, e) = p == 0 ? 0 : e == 1 ? -1 : 0\n return reduce(*, m(p, e) for (p, e) in factor(n) if p ≥ 0; init=1)\nend\nμ(n) = moebius(n)\n\nmertens(x) = sum(n -> μ(n), 1:x)\nM(x) = mertens(x)\n\nprint(\"First 99 terms of the Mertens function for positive integers:\\n \")\nfor n in 1:99\n print(lpad(M(n), 3), n % 10 == 9 ? \"\\n\" : \"\")\nend\n\nfunction maximinM(N)\n z, cros, lastM, maxi, maxM, mini, minM, sumM, pos, neg = 0, 0, 0, 0, 0, 0, 0, 0, 0, 0\n for i in 1:N\n m = μ(i) + lastM\n if m == 0 && lastM != 0\n cros += 1\n end\n sumM += m\n lastM = m\n if m > maxM\n maxi = i\n maxM = m\n elseif m < minM\n mini = i\n minM = m\n end\n if m > 0\n pos += 1\n elseif m < 0\n neg += 1\n else\n z += 1\n end\n end\n println(\"\\nFor M(x) with x from 1 to $(format(N, commas=true)):\")\n println(\"The maximum of M(x) is M($(format(maxi, commas=true)) = $maxM.\")\n println(\"The minimum of M(x) is M($(format(mini, commas=true))) = $minM.\")\n println(\"The sum of M(x) is $(format(sumM, commas=true)).\")\n println(\"The count of positive M(x) is $(format(pos, commas=true)), count of negative M(x) is $(format(neg, commas=true)).\")\n println(\"M(x) has $(format(z, commas=true)) zeroes in the interval.\")\n println(\"M(x) has $(format(cros, commas=true)) crossings in the interval.\")\n diff = pos - neg\n if diff > 0\n println(\"Positive M(x) exceed negative ones by $(format(diff, commas=true)).\")\n else\n println(\"Negative M(x) exceed positive ones by $(format(-diff, commas=true)).\")\n end\nend\n\nforeach(maximinM, (1000, 1_000_000, 1_000_000_000))\n","language":"Julia"},{"code":" NORMAL MODE IS INTEGER\n DIMENSION M(1000)\n\n M(1) = 1\n THROUGH GENMRT, FOR N=2, 1, N.G.1000\n M(N) = 1\n THROUGH GENMRT, FOR K=2, 1, K.G.N\nGENMRT M(N) = M(N) - M(N/K)\n\n PRINT COMMENT $ FIRST 99 MERTEN NUMBERS ARE$\n VECTOR VALUES F9 = $S3,9(I2,S1)*$\n VECTOR VALUES F10 = $10(I2,S1)*$\n\n PRINT FORMAT F9, M(1), M(2), M(3), M(4), M(5), M(6),\n 0 M(7), M(8), M(9)\n\n THROUGH SHOW, FOR N=10, 10, N.GE.100\nSHOW PRINT FORMAT F10, M(N), M(N+1), M(N+2), M(N+3), M(N+4),\n 0 M(N+5), M(N+6), M(N+7), M(N+8), M(N+9), M(N+10)\n\n ZERO = 0\n CROSS = 0\n THROUGH ZC, FOR N=1, 1, N.G.1000\n WHENEVER M(N).E.0, ZERO = ZERO + 1\nZC WHENEVER M(N).E.0 .AND. M(N-1).NE.0, CROSS = CROSS + 1\n\n VECTOR VALUES FZ = $13HM(N) IS ZERO ,I2,S1,5HTIMES*$\n PRINT FORMAT FZ, ZERO\n\n VECTOR VALUES FC = $18HM(N) CROSSES ZERO ,I2,S1,5HTIMES*$\n PRINT FORMAT FC, CROSS\n\n END OF PROGRAM\n","language":"MAD"},{"code":"ClearAll[Mertens]\nMertens[n_] := Total[MoebiusMu[Range[n]]]\nGrid[Partition[Mertens /@ Range[99], UpTo[10]]]\nCount[Mertens /@ Range[1000], 0]\nSequenceCount[Mertens /@ Range[1000], {Except[0], 0}]\n","language":"Mathematica"},{"code":"MODULE Mertens;\nFROM InOut IMPORT WriteString, WriteInt, WriteCard, WriteLn;\n\nCONST Max = 1000;\nVAR n, k, x, y, zero, cross: CARDINAL;\n M: ARRAY [1..Max] OF INTEGER;\n\nBEGIN\n M[1] := 1;\n FOR n := 2 TO Max DO\n M[n] := 1;\n FOR k := 2 TO n DO\n M[n] := M[n] - M[n DIV k];\n END;\n END;\n\n WriteString(\"The first 99 Mertens numbers are:\");\n WriteLn();\n FOR y := 0 TO 90 BY 10 DO\n FOR x := 0 TO 9 DO\n IF x+y=0 THEN WriteString(\" \");\n ELSE WriteInt(M[x+y], 3);\n END;\n END;\n WriteLn();\n END;\n\n zero := 0;\n cross := 0;\n FOR n := 2 TO Max DO\n IF M[n] = 0 THEN\n zero := zero + 1;\n IF M[n-1] # 0 THEN\n cross := cross + 1;\n END;\n END;\n END;\n\n WriteString(\"M(n) is zero \");\n WriteCard(zero,0);\n WriteString(\" times.\");\n WriteLn();\n WriteString(\"M(n) crosses zero \");\n WriteCard(cross,0);\n WriteString(\" times.\");\n WriteLn();\nEND Mertens.\n","language":"Modula-2"},{"code":"import sequtils, strformat\n\nfunc mertensNumbers(max: int): seq[int] =\n result = repeat(1, max + 1)\n for n in 2..max:\n for k in 2..n:\n dec result[n], result[n div k]\n\nconst Max = 1000\nlet mertens = mertensNumbers(Max)\n\necho \"First 199 Mertens numbers:\"\nconst Count = 200\nvar column = 0\nfor i in 0..<Count:\n if column > 0: stdout.write ' '\n stdout.write if i == 0: \" \" else: &\"{mertens[i]:>2}\"\n inc column\n if column == 20:\n stdout.write '\\n'\n column = 0\n\nvar zero, cross, previous = 0\nfor i in 1..Max:\n let m = mertens[i]\n if m == 0:\n inc zero\n if previous != 0:\n inc cross\n previous = m\n\necho \"\"\necho &\"M(n) is zero {zero} times for 1 ⩽ n ⩽ {Max}.\"\necho &\"M(n) crosses zero {cross} times for 1 ⩽ n ⩽ {Max}.\"\n","language":"Nim"},{"code":"program Merten;\n{$IFDEF FPC}\n {$MODE DELPHI}\n {$Optimization ON,ALL}\n{$ELSE}\n {$APPTYPE CONSOLE}\n{$ENDIF}\nuses\n sysutils;\nconst\n BigLimit = 10*1000*1000*1000;//1e10\n\ntype\n tSieveElement = Int8;\n tpSieve = pInt8;\n tMoebVal = array[-1..1] of Int64;\nvar\n MertensValues : array[-40000..50500] of NativeInt;\n primes : array of byte;\n sieve : array of tSieveElement;\n\nprocedure CompactPrimes;\n//searching for needed primes\n//last primes are marked with -1\nvar\n pSieve : tpSieve;\n i,lmt,dp:NativeInt;\nBegin\n setlength(Primes,74500);//suffices for primes to calc square upto 1e12\n //extract difference of primes\n i := 2;\n lmt := 0;\n dp := 2;\n pSieve :=@sieve[0];\n repeat\n IF pSieve[i]= 0 then\n Begin\n //mark for Moebius\n pSieve[i]:= -1;\n primes[lmt] := dp;\n dp := 0;\n inc(lmt);\n end;\n inc(dp);\n inc(i);\n until i*i >BigLimit;\n setlength(Primes,lmt+1);\n\n repeat\n IF pSieve[i]= 0 then\n //mark for Moebius\n pSieve[i]:= -1;\n inc(i);\n until i >BigLimit;\nend;\n\nprocedure SieveSquares;\n//mark all powers >=2 of prime => all powers = 2 is sufficient\nvar\n pSieve : tpSieve;\n i,sq,k,prime : NativeInt;\nBegin\n pSieve := @sieve[0];\n prime := 0;\n For i := 0 to High(primes) do\n Begin\n prime := prime+primes[i];\n sq := prime*prime;\n k := sq;\n if sq > BigLimit then\n break;\n repeat\n pSieve[k] := 0;\n inc(k,sq);\n until k> BigLimit;\n end;\nend;\n\nprocedure initPrimes;\nvar\n pSieve : tpSieve;\n fakt,\n sieveprime : NativeUint;\nbegin\n pSieve := @sieve[0];\n sieveprime := 2;\n repeat\n if pSieve[sieveprime]=0 then\n begin\n fakt := sieveprime+sieveprime;\n while fakt <=BigLimit do\n Begin\n //count divisors\n inc(pSieve[fakt]);\n inc(fakt,sieveprime);\n end;\n end;\n inc(sieveprime);\n until sieveprime>BigLimit DIV 2;\n //Möbius of 1\n pSieve[1] := 1;\n\n //convert to Moebius\n For fakt := 2 to BigLimit do\n Begin\n sieveprime := pSieve[fakt];\n IF sieveprime<>0 then\n pSieve[fakt] := 1-(2*(sieveprime AND 1)) ;\n end;\n CompactPrimes;\n SieveSquares;\nend;\n\nprocedure OutMerten10(Lmt,ZeroCross:NativeInt;Const MoebVal:tMoebVal);\nvar\n i,j: NativeInt;\nBegin\n Writeln(lmt:11,MoebVal[-1]:11,MoebVal[1]:11,MoebVal[-1]+MoebVal[1]:11,\n MoebVal[-1]-MoebVal[1]:7,MoebVal[0]:11);\n i:= low(MertensValues);\n while MertensValues[i] = 0 do\n inc(i);\n j:= High(MertensValues);\n while MertensValues[j] = 0 do\n dec(j);\n write('Merten min ',i:6,' max ',j:6,' zero''s ',MertensValues[0]:8);\n writeln(' zeroCross ',ZeroCross);\n writeln;\nend;\n\nprocedure Count_x10;\nvar\n MoebCount: tMoebVal;\n pSieve : tpSieve;\n i,lmt,Merten,Moebius,LastMert,ZeroCross: NativeInt;\nbegin\n writeln('[1 to limit]');\n Writeln('Limit Moeb. odd Moeb.even sqr-free Merten Zero''s');\n\n pSieve := @sieve[0];\n For i := -1 to 1 do\n MoebCount[i]:=0;\n ZeroCross := 0;\n LastMert :=1;\n Merten :=0;\n lmt := 10;\n i := 1;\n repeat\n while i <= lmt do\n Begin\n Moebius := pSieve[i];\n inc(MoebCount[Moebius]);\n inc(Merten,Moebius);\n inc(MertensValues[Merten]);//MoebCount[1]-MoebCount[-1]]);\n inc(ZeroCross,ORD( (Merten = 0) AND (LastMert <> 0)));\n LastMert := Merten;\n inc(i);\n end;\n OutMerten10(Lmt,ZeroCross,MoebCount);\n\n IF lmt >= BigLimit then\n BREAK;\n lmt := lmt*10;\n IF lmt >BigLimit then\n lmt := BigLimit;\n until false;\n writeln;\nend;\n\nprocedure OutMerten(lmt:NativeInt);\nvar\n i,k,m : NativeInt;\nBegin\n iF lmt> BigLimit then\n lmt := BigLimit;\n writeln('Mertens numbers from 1 to ',lmt);\n k := 9;\n write('':3);\n m := 0;\n For i := 1 to lmt do\n Begin\n inc(m,sieve[i]);\n write(m:3);\n dec(k);\n IF k = 0 then\n Begin\n writeln;\n k := 10;\n end;\n end;\n writeln;\nend;\n\nprocedure OutMoebius(lmt:NativeInt);\nvar\n i,k : NativeInt;\nBegin\n iF lmt> BigLimit then\n lmt := BigLimit;\n writeln('Möbius numbers from 1 to ',lmt);\n k := 19;\n write('':3);\n For i := 1 to lmt do\n Begin\n write(sieve[i]:3);\n dec(k);\n IF k = 0 then\n Begin\n writeln;\n k := 20;\n end;\n end;\n writeln;\nend;\n\nBegin\n setlength(sieve,BigLimit+1);\n InitPrimes;\n SieveSquares;\n Count_x10;\n OutMoebius(199);\n OutMerten(99);\n setlength(primes,0);\n setlength(sieve,0);\nend.\n","language":"Pascal"},{"code":"use utf8;\nuse strict;\nuse warnings;\nuse feature 'say';\nuse List::Util 'uniq';\n\nsub prime_factors {\n my ($n, $d, @factors) = (shift, 1);\n while ($n > 1 and $d++) {\n $n /= $d, push @factors, $d until $n % $d;\n }\n @factors\n}\n\nsub μ {\n my @p = prime_factors(shift);\n @p == uniq(@p) ? 0 == @p%2 ? 1 : -1 : 0\n}\n\nsub progressive_sum {\n my @sum = shift @_;\n push @sum, $sum[-1] + $_ for @_;\n @sum\n}\n\nmy($upto, $show, @möebius) = (1000, 199, ());\npush @möebius, μ($_) for 1..$upto;\nmy @mertens = progressive_sum @möebius;\n\nsay \"Mertens sequence - First $show terms:\\n\" .\n (' 'x4 . sprintf \"@{['%4d' x $show]}\", @mertens[0..$show-1]) =~ s/((.){80})/$1\\n/gr .\n sprintf(\"\\nEquals zero %3d times between 1 and $upto\", scalar grep { ! $_ } @mertens) .\n sprintf \"\\nCrosses zero%3d times between 1 and $upto\", scalar grep { ! $mertens[$_-1] and $mertens[$_] } 1 .. @mertens;\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;\">-- (skip arg added to join_by)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">mcache</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">Mertens</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;\">for</span> <span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">mcache</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;\">integer</span> <span style=\"color: #000000;\">mm</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">m</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">mm</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">mcache</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">)]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">mcache</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">mm</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;\">mcache</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 <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">first</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">99</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">perline</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">10</span>\n <span style=\"color: #000080;font-style:italic;\">--constant first = 199, perline = 20 -- matches C/Go/etc\n --constant first = 143, perline = 12 -- matches wp</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\" .\"</span><span style=\"color: #0000FF;\">}&</span><span style=\"color: #7060A8;\">apply</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">first</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">Mertens</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 %d Mertens numbers:\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">first</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_by</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;\">perline</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;\">\"%3d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">skip</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;\">prev</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">zeroes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">crosses</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\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;\">1000</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">m</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">Mertens</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;\">m</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">zeroes</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">crosses</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">prev</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: #000000;\">prev</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">m</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;\">\"\\nMertens[1..1000] equals zero %d times and crosses zero %d times\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">zeroes</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">crosses</span><span style=\"color: #0000FF;\">})</span>\n<!--\n","language":"Phix"},{"code":"mertens: procedure options(main);\n %replace MAX by 1000;\n\n declare M(1:MAX) fixed binary(5);\n declare (n, k) fixed binary(10);\n declare (isZero, crossZero) fixed binary(8);\n\n M(1) = 1;\n do n = 2 to MAX;\n M(n) = 1;\n do k = 2 to n;\n M(n) = M(n) - M(divide(n,k,10));\n end;\n end;\n\n put skip list('The first 99 Mertens numbers are:');\n put skip list(' ');\n do n = 1 to 99;\n put edit(M(n)) (F(3));\n if mod(n,10) = 9 then put skip;\n end;\n\n isZero = 0;\n crossZero = 0;\n do n = 2 to MAX;\n if M(n) = 0 then do;\n isZero = isZero + 1;\n if M(n-1) ^= 0 then\n crossZero = crossZero + 1;\n end;\n end;\n\n put skip list('Zeroes: ',isZero);\n put skip list('Crossings:',crossZero);\nend mertens;\n","language":"PL-I"},{"code":":- dynamic mertens_number_cache/2.\n\nmertens_number(1, 1):- !.\nmertens_number(N, M):-\n mertens_number_cache(N, M),\n !.\nmertens_number(N, M):-\n N >= 2,\n mertens_number(N, 2, M, 0),\n assertz(mertens_number_cache(N, M)).\n\nmertens_number(N, N, M, M):- !.\nmertens_number(N, K, M, S):-\n N1 is N // K,\n mertens_number(N1, M1),\n K1 is K + 1,\n S1 is S - M1,\n mertens_number(N, K1, M, S1).\n\nprint_mertens_numbers(Count):-\n print_mertens_numbers(Count, 0).\n\nprint_mertens_numbers(Count, Count):-!.\nprint_mertens_numbers(Count, N):-\n (N == 0 ->\n write(' ')\n ;\n mertens_number(N, M),\n writef('%3r', [M])\n ),\n N1 is N + 1,\n Column is N1 mod 20,\n (N > 0, Column == 0 ->\n nl\n ;\n true\n ),\n print_mertens_numbers(Count, N1).\n\ncount_zeros(From, To, Z, C):-\n count_zeros(From, To, Z, C, 0, 0, 0).\n\ncount_zeros(From, To, Z, C, Z, C, _):-\n From > To,\n !.\ncount_zeros(From, To, Z, C, Z1, C1, P):-\n mertens_number(From, M),\n (M == 0 -> Z2 is Z1 + 1 ; Z2 = Z1),\n (M == 0, P \\= 0 -> C2 is C1 + 1 ; C2 = C1),\n Next is From + 1,\n count_zeros(Next, To, Z, C, Z2, C2, M).\n\nmain:-\n writeln('First 199 Mertens numbers:'),\n print_mertens_numbers(200),\n count_zeros(1, 1000, Z, C),\n writef('M(n) is zero %t times for 1 <= n <= 1000.\\n', [Z]),\n writef('M(n) crosses zero %t times for 1 <= n <= 1000.\\n', [C]).\n","language":"Prolog"},{"code":"Dim M.i(1000)\n\nM(1)=1\nFor n=2 To 1000\n psum=0\n For k=2 To n : psum+M(Int(n/k)) : Next : M(n)=1-psum\n If M(n)=0 : z+1 : If M(n-1)<>0 : c+1 : EndIf : EndIf\nNext\n\nOpenConsole(\"\")\nPrintN(\"First 99 Mertens numbers:\") : Print(Space(4))\nFor n=1 To 99 : Print(RSet(Str(M(n)),4)) : If n%10=9 : PrintN(\"\") : EndIf : Next\nPrintN(\"M(N) is zero \"+Str(z)+\" times.\") : PrintN(\"M(N) crosses zero \"+Str(c)+\" times.\")\nInput()\n","language":"PureBasic"},{"code":"def mertens(count):\n \"\"\"Generate Mertens numbers\"\"\"\n m = [None, 1]\n for n in range(2, count+1):\n m.append(1)\n for k in range(2, n+1):\n m[n] -= m[n//k]\n return m\n\n\nms = mertens(1000)\n\nprint(\"The first 99 Mertens numbers are:\")\nprint(\" \", end=' ')\ncol = 1\nfor n in ms[1:100]:\n print(\"{:2d}\".format(n), end=' ')\n col += 1\n if col == 10:\n print()\n col = 0\n\nzeroes = sum(x==0 for x in ms)\ncrosses = sum(a!=0 and b==0 for a,b in zip(ms, ms[1:]))\nprint(\"M(N) equals zero {} times.\".format(zeroes))\nprint(\"M(N) crosses zero {} times.\".format(crosses))\n","language":"Python"},{"code":" [ ' [ 0 ]\n swap 1+ times\n [ dup -1 peek\n i^ 1+ mobius\n + join ]\n behead drop ] is mertens ( n --> [ )\n\n [ say \" \"\n 99 times\n [ dup i^ peek\n dup dup\n -1 > if sp\n abs 10 < if sp\n echo\n i^ 1+ 10 mod\n 9 = if cr ]\n drop ] is grid ( [ --> )\n\n [ 0 swap\n witheach\n [ 0 = + ] ] is zeroes ( [ --> n )\n\n [ 0 0\n rot witheach\n [ dup 0 =\n rot 0 !=\n and\n rot + swap ]\n drop ] is crossings ( [ --> n )\n\n 1000 mertens\n say \"First 99 terms:\"\n cr\n dup grid\n cr\n dup zeroes echo say \" zeroes and \"\n crossings echo say \" crossings\"\n","language":"Quackery"},{"code":"use Prime::Factor;\n\nsub μ (Int \\n) {\n return 0 if n %% 4 or n %% 9 or n %% 25 or n %% 49 or n %% 121;\n my @p = prime-factors(n);\n +@p == +@p.unique ?? +@p %% 2 ?? 1 !! -1 !! 0\n}\n\nmy @mertens = lazy [\\+] flat '', 1, (2..*).hyper.map: -> \\n { μ(n) };\n\nput \"Mertens sequence - First 199 terms:\\n\",\n @mertens[^200]».fmt('%3s').batch(20).join(\"\\n\"),\n \"\\n\\nEquals zero \", +@mertens[1..1000].grep( !* ),\n ' times between 1 and 1000', \"\\n\\nCrosses zero \",\n +@mertens[1..1000].kv.grep( {!$^v and @mertens[$^k]} ),\n \" times between 1 and 1000\\n\\nFirst Mertens equal to:\";\n\nfor 10, 20, 30 … 100 -> $threshold {\n printf \"%4d: M(%d)\\n\", -$threshold, @mertens.first: * == -$threshold, :k;\n printf \"%4d: M(%d)\\n\", $threshold, @mertens.first: * == $threshold, :k;\n}\n","language":"Raku"},{"code":"/*REXX pgm computes & shows a value grid of the Mertens function for a range of integers*/\nparse arg LO HI grp eqZ xZ . /*obtain optional arguments from the CL*/\nif LO=='' | LO==\",\" then LO= 0 /*Not specified? Then use the default.*/\nif HI=='' | HI==\",\" then HI= 199 /* \" \" \" \" \" \" */\nif grp=='' | grp==\",\" then grp= 20 /* \" \" \" \" \" \" */\nif eqZ=='' | eqZ==\",\" then eqZ= 1000 /* \" \" \" \" \" \" */\nif xZ=='' | xZ==\",\" then xZ= 1000 /* \" \" \" \" \" \" */\ncall genP /*generate primes up to max √ HIHI */\n call Franz LO, HI\nif eqZ>0 then call Franz 1, -eqZ\nif xZ>0 then call Franz -1, xZ\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nFranz: parse arg a 1 oa,b 1 ob; @Mertens= ' The Mertens sequence from '\na= abs(a); b= abs(b); grid= oa>=0 & ob>=0 /*semaphore used to show a grid title. */\nif grid then say center(@Mertens LO \" ──► \" HI\" \", max(50, grp*3), '═') /*show title*/\n else say\nzeros= 0 /*# of 0's found for Mertens function.*/\nXzero= 0 /*number of times that zero was crossed*/\n$=; prev= /*$ holds output grid of GRP numbers. */\n do j=a to b; _= Mertens(j) /*process some numbers from LO ──► HI.*/\n if _==0 then zeros= zeros + 1 /*Is Zero? Then bump the zeros counter*/\n if _==0 then if prev\\==0 then Xzero= Xzero+1 /*prev ¬=0? \" \" \" Xzero \" */\n prev= _\n if grid then $= $ right(_, 2) /*build grid if A & B are non─negative.*/\n if words($)==grp then do; say substr($, 2); $= /*show grid if fully populated, */\n end /* and nullify it for more #s. */\n end /*j*/ /*for small grids, using wordCnt is OK.*/\n\nif $\\=='' then say substr($, 2) /*handle any residual numbers not shown*/\nif oa<0 then say @Mertens a \" to \" b ' has crossed zero ' Xzero \" times.\"\nif ob<0 then say @Mertens a \" to \" b ' has ' zeros \" zeros.\"\nreturn\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nMertens: procedure expose @. !!. M.; parse arg n; if M.n\\==. then return M.n\n if n<1 then return '∙'; m= 0 /*handle special cases of non─positive#*/\n do k=1 for n; m= m + mobius(k) /*sum the MU's up to N. */\n end /*k*/ /* [↑] mobius function uses memoization*/\n M.n= m; return m /*return the sum of all the MU's. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nmobius: procedure expose @. !!.; parse arg x 1 ox /*get integer to be tested for mu */\n if !!.x\\==. then return !!.x /*X computed before? Return that value*/\n if x<1 then return '∙'; mu= 0 /*handle special case of non-positive #*/\n do k=1; p= @.k; if p>x then leave /* (P) > X? Then we're done.*/\n if p*p>x then do; mu= mu+1; leave; end /* (P**2) > X? Bump # and leave*/\n if x//p==0 then do; mu= mu+1 /*X divisible by P? Bump mu number.*/\n x= x % p /* Divide by prime. */\n if x//p==0 then return 0 /*X÷by P? Then return zero*/\n end\n end /*k*/ /*MU (below) is almost always small, <9*/\n !!.ox= -1 ** mu; return !!.ox /*raise -1 to the mu power, memoize it.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngenP: @.1=2; @.2=3; @.3=5; @.4=7; @.5=11; @.6=13 /*initialize some low primes; # primes.*/\n !!.=.; M.=!!.; #= 6; sq.#= @.6**2 /* \" 2 arrays for memoization. */\n do j=@.#+4 by 2 to max(HI, eqZ, xZ); parse var j '' -1 _ /*odd Ps from now on*/\n if _==5 then iterate; if j//3==0 then iterate; if j//7==0 then iterate /*÷ 5 3 7*/\n do k=7 while sq.k<=j /*divide by some generated odd primes. */\n if j//@.k==0 then iterate j /*Is J divisible by P? Then not prime*/\n end /*k*/ /* [↓] a prime (J) has been found. */\n #= #+1; @.#=j; sq.j= j*j /*bump P count; P──►@.; compute J**2*/\n end /*j*/; return /*calculate the squares of some primes.*/\n","language":"REXX"},{"code":"require 'prime'\n\ndef μ(n)\n return 1 if self == 1\n pd = n.prime_division\n return 0 unless pd.map(&:last).all?(1)\n pd.size.even? ? 1 : -1\nend\n\ndef M(n)\n (1..n).sum{|n| μ(n)}\nend\n\n([\" \"] + (1..199).map{|n|\"%2s\" % M(n)}).each_slice(20){|line| puts line.join(\" \") }\n\nar = (1..1000).map{|n| M(n)}\nputs \"\\nThe Mertens function is zero #{ar.count(0)} times in the range (1..1000);\"\nputs \"it crosses zero #{ar.each_cons(2).count{|m1, m2| m1 != 0 && m2 == 0}} times.\"\n","language":"Ruby"},{"code":"dim M(1000)\nM(1) = 1\nfor n = 2 to 1000\n M(n) = 1\n for k = 2 to n\n M(n) = M(n)-M(int(n/k))\n next k\nnext n\nprint \"First 99 Mertens numbers:\"\nprint \" \";\nfor n = 1 to 99\n print using(\"###\", M(n));\n if n mod 10 = 9 then print\nnext n\nnumCruza = 0\nnumEsCero = 0\nfor n = 1 to 1000\n if M(n) = 0 then\n numEsCero = numEsCero +1\n if M(n-1) <> 0 then numCruza = numCruza +1\n end if\nnext n\nprint\nprint \"M(n) is zero \"; numEsCero; \" times.\"\nprint \"M(n) crosses zero \"; numCruza; \" times.\"\n","language":"Run-BASIC"},{"code":"program mertens;\n m := [1] * 1000;\n loop for n in [1..#m] do\n m(n) -:= 0 +/[m(n div k) : k in [2..n]];\n end loop;\n\n print(\"The first 99 Mertens numbers:\");\n putchar(\" \");\n loop for n in [1..99] do\n putchar(lpad(str m(n), 3));\n if n mod 10=9 then print; end if;\n end loop;\n\n zero := #[n : n in [1..#m] | m(n) = 0];\n cross := #[n : n in [1..#m] | m(n) = 0 and m(n-1) /= 0];\n\n print(\"M(N) is zero \" + str zero + \" times.\");\n print(\"M(N) crosses zero \" + str cross + \" times.\");\nend program;\n","language":"SETL"},{"code":"say mertens(123456789) #=> 1170\nsay mertens(1234567890) #=> 9163\n","language":"Sidef"},{"code":"func mertens(n) is cached {\n\n var lookup_size = (2 * n.iroot(3)**2)\n var mertens_lookup = [0]\n\n for k in (1..lookup_size) {\n mertens_lookup[k] = (mertens_lookup[k-1] + k.moebius)\n }\n\n static cache = Hash()\n\n func (n) {\n\n if (n <= lookup_size) {\n return mertens_lookup[n]\n }\n\n if (cache.has(n)) {\n return cache{n}\n }\n\n var M = 1\n var s = n.isqrt\n\n for k in (2 .. floor(n/(s+1))) {\n M -= __FUNC__(floor(n/k))\n }\n\n for k in (1..s) {\n M -= (mertens_lookup[k] * (floor(n/k) - floor(n/(k+1))))\n }\n\n cache{n} = M\n }(n)\n}\n","language":"Sidef"},{"code":"with (200) {|n|\n say \"Mertens function in the range 1..#{n}:\"\n (1..n).map { mertens(_) }.slices(20).each {|line|\n say line.map{ \"%2s\" % _ }.join(' ')\n }\n}\n\nwith (1000) {|n|\n say \"\\nIn the range 1..#{n}, there are:\"\n say (1..n->count_by { mertens(_)==0 }, \" zeros\")\n say (1..n->count_by { mertens(_)==0 && mertens(_-1)!=0 }, \" zero crossings\")\n}\n","language":"Sidef"},{"code":"import Foundation\n\nfunc mertensNumbers(max: Int) -> [Int] {\n var mertens = Array(repeating: 1, count: max + 1)\n for n in 2...max {\n for k in 2...n {\n mertens[n] -= mertens[n / k]\n }\n }\n return mertens\n}\n\nlet max = 1000\nlet mertens = mertensNumbers(max: max)\n\nlet count = 200\nlet columns = 20\nprint(\"First \\(count - 1) Mertens numbers:\")\nfor i in 0..<count {\n if i % columns > 0 {\n print(\" \", terminator: \"\")\n }\n print(i == 0 ? \" \" : String(format: \"%2d\", mertens[i]), terminator: \"\")\n if (i + 1) % columns == 0 {\n print()\n }\n}\n\nvar zero = 0, cross = 0, previous = 0\nfor i in 1...max {\n let m = mertens[i]\n if m == 0 {\n zero += 1\n if previous != 0 {\n cross += 1\n }\n }\n previous = m\n}\nprint(\"M(n) is zero \\(zero) times for 1 <= n <= \\(max).\")\nprint(\"M(n) crosses zero \\(cross) times for 1 <= n <= \\(max).\")\n","language":"Swift"},{"code":"DIM m(1000)\nLET m(1) = 1\nFOR n = 2 TO 1000\n LET m(n) = 1\n FOR k = 2 TO n\n LET m(n) = m(n)-m(INT(n/k))\n NEXT k\nNEXT n\nPRINT \"First 99 Mertens numbers:\"\nPRINT \" \";\nFOR n = 1 TO 99\n PRINT \" \";\n PRINT USING \"##\": m(n);\n !IF REMAINDER(ROUND(n),10) = 9 THEN PRINT\n IF MOD(n,10) = 9 THEN PRINT\nNEXT n\nLET numcruza = 0\nLET numeszero = 0\nFOR n = 1 TO 1000\n IF m(n) = 0 THEN\n LET numeszero = numeszero+1\n IF m(n-1) <> 0 THEN LET numcruza = numcruza+1\n END IF\nNEXT n\nPRINT\nPRINT \"M(n) is zero\"; numeszero; \"times.\"\nPRINT \"M(n) crosses zero\"; numcruza; \"times.\"\nEND\n","language":"True-BASIC"},{"code":"fn mertens(t int) ([]int, int, int) {\n mut to:=t\n if to < 1 {\n to = 1\n }\n mut merts := []int{len:to+1}\n mut primes := [2]\n mut sum := 0\n mut zeros := 0\n mut crosses := 0\n for i := 1; i <= to; i++ {\n mut j := i\n mut cp := 0 // counts prime factors\n mut spf := false // true if there is a square prime factor\n for p in primes {\n if p > j {\n break\n }\n if j%p == 0 {\n j /= p\n cp++\n }\n if j%p == 0 {\n spf = true\n break\n }\n }\n if cp == 0 && i > 2 {\n cp = 1\n primes << i\n }\n if !spf {\n if cp%2 == 0 {\n sum++\n } else {\n sum--\n }\n }\n merts[i] = sum\n if sum == 0 {\n zeros++\n if i > 1 && merts[i-1] != 0 {\n crosses++\n }\n }\n }\n return merts, zeros, crosses\n}\n\nfn main() {\n merts, zeros, crosses := mertens(1000)\n println(\"Mertens sequence - First 199 terms:\")\n for i := 0; i < 200; i++ {\n if i == 0 {\n print(\" \")\n continue\n }\n if i%20 == 0 {\n println('')\n }\n print(\" ${merts[i]:2}\")\n }\n println(\"\\n\\nEquals zero $zeros times between 1 and 1000\")\n println(\"\\nCrosses zero $crosses times between 1 and 1000\")\n}\n","language":"V-(Vlang)"},{"code":"import \"./fmt\" for Fmt\nimport \"./math\" for Int\n\nvar isSquareFree = Fn.new { |n|\n var i = 2\n while (i * i <= n) {\n if (n%(i*i) == 0) return false\n i = (i > 2) ? i + 2 : i + 1\n }\n return true\n}\n\nvar mu = Fn.new { |n|\n if (n < 1) Fiber.abort(\"Argument must be a positive integer\")\n if (n == 1) return 1\n var sqFree = isSquareFree.call(n)\n var factors = Int.primeFactors(n)\n if (sqFree && factors.count % 2 == 0) return 1\n if (sqFree) return -1\n return 0\n}\n\nvar M = Fn.new { |x| (1..x).reduce { |sum, n| sum + mu.call(n) } }\n\nSystem.print(\"The first 199 Mertens numbers are:\")\nfor (i in 0..9) {\n for (j in 0..19) {\n if (i == 0 && j == 0) {\n System.write(\" \")\n } else {\n System.write(\"%(Fmt.dm(3, M.call(i*20 + j))) \")\n }\n }\n System.print()\n}\n\n// use the recurrence relationship for the last 2 parts rather than calling M directly\nvar count = 0\nvar mertens = M.call(1)\nfor (i in 2..1000) {\n mertens = mertens + mu.call(i)\n if (mertens == 0) count = count + 1\n}\nSystem.print(\"\\nThe Mertens function is zero %(count) times in the range [1, 1000].\")\n\ncount = 0\nvar prev = M.call(1)\nfor (i in 2..1000) {\n var next = prev + mu.call(i)\n if (next == 0 && prev != 0) count = count + 1\n prev = next\n}\nSystem.print(\"\\nThe Mertens function crosses zero %(count) times in the range [1, 1000].\")\n","language":"Wren"},{"code":"PROGRAM\t\"Mertens\"\nVERSION\t\"0.0000\"\n\nDECLARE FUNCTION Entry ()\n\nFUNCTION Entry ()\nDIM M[1000]\nM[1] = 1\nFOR n = 2 TO 1000\n\tM[n] = 1\n\tFOR k = 2 TO n\n\t\tM[n] = M[n] - M[INT(n/k)]\n\tNEXT k\nNEXT n\nPRINT \"First 99 Mertens numbers:\"\nPRINT \" \";\nFOR n = 1 TO 99\n\tPRINT FORMAT$(\"###\", M[n]);\n\tIF n MOD 10 = 9 THEN PRINT\nNEXT n\nnumCruza = 0\nnumEsCero = 0\nFOR n = 1 TO 1000\n\tIF M[n] = 0 THEN\n\t\tINC numEsCero\n\t\tIF M[n-1] <> 0 THEN INC numCruza\n\tEND IF\nNEXT n\nPRINT\nPRINT \"M(n) is zero\"; numEsCero; \" times.\"\nPRINT \"M(n) crosses zero\"; numCruza; \" times.\"\n\nEND FUNCTION\nEND PROGRAM\n","language":"XBasic"},{"code":"integer M ( 1+1000 );\ninteger K, Zero, Cross, N;\nbegin \\compute values of the Mertens function\n\\Generate Mertens numbers\nM( 1 ) := 1;\nfor N := 2 to 1000 do begin\n M( N ) := 1;\n for K := 2 to N do M( N ) := M( N ) - M( N / K )\n end;\n\\Print table\nText(0, \"The first 99 Mertens numbers are:^m^j\");\nText(0, \" \" );\nK := 9;\nfor N := 1 to 99 do begin\n Format(3, 0);\n RlOut(0, float(M(N)));\n K := K - 1;\n if K = 0 then begin\n K := 10;\n CrLf(0);\n end\n end;\n\\Calculate zeroes and crossings\nZero := 0;\nCross := 0;\nfor N :=2 to 1000 do begin\n if M( N ) = 0 then begin\n Zero := Zero + 1;\n if M( N - 1 ) # 0 then Cross := Cross + 1\n end\n end;\nText(0, \"M(N) is zero \"); IntOut(0, Zero); Text(0, \" times.^m^j\" );\nText(0, \"M(N) crosses zero \"); IntOut(0, Cross); Text(0, \" times.^m^j\" );\nend\n","language":"XPL0"},{"code":"dim M(1000)\nM(1) = 1\nfor n = 2 to 1000\n\tM(n) = 1\n\tfor k = 2 to n\n\t\tM(n) = M(n) - M(int(n/k))\n\tnext k\nnext n\nprint \"First 99 Mertens numbers:\"\nprint \" \";\nfor n = 1 to 99\n\tprint M(n) using(\"###\");\n\tif mod(n, 10) = 9 print\nnext n\nnumCruza = 0\nnumEsCero = 0\nfor n = 1 to 1000\n\tif M(n) = 0 then\n\t\tnumEsCero = numEsCero + 1\n\t\tif M(n-1) <> 0 numCruza = numCruza + 1\n\tend if\nnext n\nprint\nprint \"M(n) is zero \", numEsCero, \" times.\"\nprint \"M(n) crosses zero \", numCruza, \" times.\"\n","language":"Yabasic"},{"code":"#!/bin/bash\nMAX=1000\n\nm[1]=1\nfor n in `seq 2 $MAX`\ndo\n m[n]=1\n for k in `seq 2 $n`\n do\n m[n]=$((m[n]-m[n/k]))\n done\ndone\n\necho 'The first 99 Mertens numbers are:'\necho -n ' '\nfor n in `seq 1 99`\ndo\n printf '%2d ' ${m[n]}\n test $((n%10)) -eq 9 && echo\ndone\n\nzero=0\ncross=0\nfor n in `seq 1 $MAX`\ndo\n if [ ${m[n]} -eq 0 ]\n then\n ((zero++))\n test ${m[n-1]} -ne 0 && ((cross++))\n fi\ndone\n\necho \"M(N) is zero $zero times.\"\necho \"M(N) crosses zero $cross times.\"\n","language":"Yabasic"},{"code":"fcn mertensW(n){\n [1..].tweak(fcn(n,pm){\n pm.incN(mobius(n));\n pm.value\n }.fp1(Ref(0)))\n}\nfcn mobius(n){\n pf:=primeFactors(n);\n sq:=pf.filter1('wrap(f){ (n % (f*f))==0 }); // False if square free\n if(sq==False){ if(pf.len().isEven) 1 else -1 }\n else 0\n}\nfcn primeFactors(n){ // Return a list of prime 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)) # both are tail recursion\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"},{"code":"mertensW().walk(199)\n.pump(Console.println, T(Void.Read,19,False),\n\tfcn{ vm.arglist.pump(String,\"%3d\".fmt) });\n\nprintln(\"\\nIn the first 1,000 terms of the Mertens sequence there are:\");\notm:=mertensW().pump(1_000,List);\notm.reduce(fcn(s,m){ s + (m==0) },0) : println(_,\" zeros\");\notm.reduce(fcn(p,m,rs){ rs.incN(m==0 and p!=0); m }.fp2( s:=Ref(0) ));\nprintln(s.value,\" zero crossings\");\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Mertens_function\\nnote: Prime Numbers\\n\",\n \"language\": \"00-META\"\n },\n {\n \"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''' of those that have an '''odd number'''. \\n\\nIt is an extension of the [[Möbius function]]. Given the Möbius function '''μ(n)''', the Mertens function '''M(x)''' is the sum of the Möbius numbers from '''n == 1''' through '''n == x'''.\\n\\n\\n;Task:\\n\\n:* Write a routine (function, procedure, whatever) to find the Mertens number for any positive integer '''x'''.\\n\\n:* Use that routine to find and display here, on this page, at least the first 99 terms in a grid layout. (Not just one long line or column of numbers.)\\n\\n:* Use that routine to find and display here, on this page, the number of times the Mertens function sequence '''is equal to zero''' in the range '''M(1)''' through '''M(1000)'''.\\n\\n:* Use that routine to find and display here, on this page, the number of times the Mertens function sequence '''crosses zero''' in the range '''M(1)''' through '''M(1000)'''. (Crossing defined as this term equal to zero but preceding term '''not'''.)\\n\\n\\n;See also:\\n:* [[wp:Mertens function|Wikipedia: Mertens function]]\\n:* [[wp:Möbius function|Wikipedia: Möbius function]]\\n:* [[oeis:A002321|OEIS: A002321 - Mertens's function]]\\n:* [[oeis:A028442|OEIS: A028442 - Numbers n such that Mertens's function M(n) is zero]]\\n:* [https://www.youtube.com/watch?v=uvMGZb0Suyc Numberphile - Mertens Conjecture]\\n:* [https://codegolf.stackexchange.com/questions/94814/compute-the-mertens-function Stackexchange: compute the mertens function]\\n\\n\\n''This is not code golf. The stackexchange link is provided as an algorithm reference, not as a guide.''\\n\\n\\n;Related tasks:\\n:* [[Möbius function]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F mertens(count)\\n ‘Generate Mertens numbers’\\n V m = [-1, 1]\\n L(n) 2 .. count\\n m.append(1)\\n L(k) 2 .. n\\n m[n] -= m[n I/ k]\\n R m\\n\\nV ms = mertens(1000)\\n\\nprint(‘The first 99 Mertens numbers are:’)\\nprint(‘ ’, end' ‘ ’)\\nV col = 1\\nL(n) ms[1.<100]\\n print(‘#2’.format(n), end' ‘ ’)\\n col++\\n I col == 10\\n print()\\n col = 0\\n\\nV zeroes = sum(ms.map(x -> Int(x == 0)))\\nV crosses = sum(zip(ms, ms[1..]).map((a, b) -> Int(a != 0 & b == 0)))\\nprint(‘M(N) equals zero #. times.’.format(zeroes))\\nprint(‘M(N) crosses zero #. times.’.format(crosses))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Mertens function - 01/05/2023\\nMERTENS CSECT\\n USING MERTENS,R13 base register\\n B 72(R15) skip savearea\\n DC 17F'0' savearea\\n SAVE (14,12) save previous context\\n ST R13,4(R15) link backward\\n ST R15,8(R13) link forward\\n LR R13,R15 set addressability\\n LA R0,1 1\\n STH R0,MM m(1)=1\\n LA R6,2 i=2\\n DO WHILE=(CH,R6,LE,=AL2(NN)) do i=2 to n\\n LR R1,R6 i\\n SLA R1,1 *2 (H)\\n LA R0,1 1\\n STH R0,MM-2(R1) m(i)=1\\n LA R7,2 j=2\\n DO WHILE=(CR,R7,LE,R6) do j=2 to i\\n LR R4,R6 i\\n SRDA R4,32 ~\\n LR R1,R7 j\\n DR R4,R1 i/j\\n LR R8,R5 d=i/j\\n LR R4,R6 i\\n SLA R4,1 *2 (H)\\n LH R2,MM-2(R4) m(i)\\n LR R1,R8 d\\n SLA R1,1 *2 (H)\\n LH R3,MM-2(R1) m(d)\\n SR R2,R3 m(i)-m(d)\\n STH R2,MM-2(R4) m(i)=m(i)-m(d)\\n LA R7,1(R7) j++\\n ENDDO , enddo j\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n XPRNT =C'the first 99 Mertens numbers are:',34 print buffer\\n LA R9,PG @buffer=pg\\n MVC PG,=CL80' ' clean buffer\\n MVC 0(3,R9),=CL3' ' output ' '\\n LA R9,3(R9) @buffer+=3\\n LA R7,9 j=9\\n LA R6,1 i=1\\n DO WHILE=(CH,R6,LE,=AL2(99)) do i=1 to 99\\n LR R1,R6 i\\n SLA R1,1 *2 (H)\\n LH R2,MM-2(R1) m(i)\\n XDECO R2,XDEC edit m(i)\\n MVC 0(3,R9),XDEC+9 output m(i)\\n LA R9,3(R9) @buffer+=3\\n BCTR R7,0 j=j-1\\n IF LTR,R7,Z,R7 THEN if j=0 then do;\\n LA R7,10 j=10\\n XPRNT PG,L'PG print buffer\\n LA R9,PG @buffer=pg\\n ENDIF , endif\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n SR R10,R10 zero=0\\n SR R11,R11 cross=0\\n LA R6,1 i=2\\n DO WHILE=(CH,R6,LE,=AL2(NN)) do i=2 to n\\n LR R1,R6 i\\n SLA R1,1 *2 (H)\\n LH R2,MM-2(R1) m(i)\\n IF LTR,R2,Z,R2 THEN if m(i)=0 then\\n LA R10,1(R10) zero=zero+1\\n LR R1,R6 i\\n BCTR R1,0 i-1\\n SLA R1,1 *2 (H)\\n LH R2,MM-2(R1) m(i-1)\\n IF LTR,R2,NZ,R2 THEN if m(i-1)^=0 then\\n LA R11,1(R11) cross=cross+1\\n ENDIF , endif\\n ENDIF , endif\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n MVC PG,=CL80' ' clean buffer\\n MVC PG(13),=C'm(i) is zero '\\n XDECO R10,XDEC edit zero\\n MVC PG+13(2),XDEC+10 output zero\\n MVC PG+15(7),=C' times.'\\n XPRNT PG,L'PG print buffer\\n MVC PGI,=H'0'\\n MVC PG,=CL80' ' clean buffer\\n MVC PG(18),=C'm(i) crosses zero '\\n XDECO R11,XDEC edit cross\\n MVC PG+18(2),XDEC+10 output cross\\n MVC PG+20(7),=C' times.'\\n XPRNT PG,L'PG print buffer\\n L R13,4(0,R13) restore previous savearea pointer\\n RETURN (14,12),RC=0 restore registers from calling save\\nNN EQU 1000 n\\nPG DS CL80 buffer\\nPGI DC H'0' buffer index\\nXDEC DS CL12 temp for xdeci xdeco\\nMM DS (NN)H m\\n REGEQU\\n END MERTENS\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"MAX:\\tequ\\t1000\\t; Amount of numbers to generate\\n\\torg\\t100h\\n\\t;;;\\tGenerate Mertens numbers\\n\\tlxi\\tb,1\\t; Start at place 1; BC = current Mertens number\\t\\n\\tlxi\\th,MM\\t; First one is 1\\n\\tdad\\tb\\n\\tmvi\\tm,1\\nouter:\\tinx \\tb\\t; Next Mertens number\\n\\tlxi\\th,MM\\n\\tdad\\tb\\n\\tmvi\\tm,1\\t; Initialize at 1\\n\\tlxi\\td,2\\t; DE = inner loop counter ('k'), starts at 2\\n\\t;;;\\tNow we need to find BC/DE, but there is no hardware divide\\n\\t;;;\\tWe also need to be somewhat clever so it doesn't take forever\\ninner:\\tpush\\td\\t; Keep both loop counters safe on the stack\\n\\tpush \\tb\\n\\txchg\\t\\t; Divisor in HL\\n\\tmov\\td,b\\t; Dividend in DE\\n\\tmov\\te,c\\n\\tlxi\\tb,100h\\t; B = counter, C = zero\\ndouble:\\tdad\\th\\t; Double divisor\\n\\tinr\\tb\\t; Increment counter\\n\\tcall\\tcdehl\\t; Dividend <= divisor?\\n\\tjnc\\tdouble\\t; If so, keep doubling\\t\\n\\tmov\\ta,b\\t; Keep counter\\n\\tmov\\tb,c\\t; BC = 0\\n\\tpush \\tb\\t; Push result variable on stakc (initial 0)\\n\\tmov\\tb,a\\t; Restore counter\\n\\txchg\\t\\t; HL = dividend, DE = doubled divisor\\nsubtr:\\tmov\\ta,l\\t; Try HL -= DE\\n\\tsub\\te\\n\\tmov\\tl,a\\n\\tmov\\ta,h\\n\\tsbb\\td\\n\\tmov\\th,a\\t\\n\\txthl\\t\\t; Get result accumulator from stack\\n\\tcmc\\t\\t; Flip borrow\\n\\tmov\\ta,l\\t; Rotate into result\\n\\tral\\n\\tmov\\tl,a\\n\\tmov\\ta,h\\n\\tral\\n\\tmov\\th,a\\n\\tmov\\ta,l\\t; Retrieve flag\\n\\trar\\n\\txthl\\t\\t; Retrieve rest of divisor\\n\\tjc\\t$+4\\t; If borrow,\\n\\tdad\\td\\t; Add dividend back into divisor\\t\\n\\txra a ; DE >> 1\\n\\tora d\\n\\trar\\n\\tmov d,a\\n\\tmov a,e\\n\\trar\\n\\tmov e,a\\n\\tdcr b ; Are we there yet?\\n\\tjnz subtr ; If not, try another subtraction\\n\\tpop\\th \\t; HL = quotient\\n\\t;;;\\tDivision is done, do lookup and subraction\\n\\tlxi\\td,MM\\t; Look up M[outer/inner]\\n\\tdad\\td\\n\\tmov\\te,m\\t; E = M[BC/DE]\\n\\tpop\\tb\\t; Restore BC (n)\\n\\tlxi\\th,MM\\n\\tdad\\tb\\n\\tmov\\ta,m \\t; A = M[BC]\\n\\tsub\\te\\t; A = M[BC] - M[BC/DE]\\n\\tmov\\tm,a\\t; M[BC] = A\\n\\tpop\\td\\t; Restore DE (k)\\n\\t;;;\\tUpdate loops\\n\\tinx\\td\\t; k++\\t\\n\\tcall\\tcbcde\\t; DE <= BC?\\n\\tjnc\\tinner\\n\\tlxi\\th,MAX\\n\\tcall\\tchlbc\\t; BC <= MAX?\\n\\tjnc\\touter\\n\\t;;;\\tPrint table\\n\\tlxi\\td,frst99\\n\\tcall\\tputs\\n\\tlxi\\th,MM+1\\t; Start of Merten numbers\\n\\tmvi\\tc,9\\t; Column counter\\ntable:\\tmov\\ta,m\\t; Get Merten number\\n\\tana\\ta\\t; Set flags\\n\\tmvi\\tb,' '\\t; Space\\n\\tjp \\tprtab\\t; If positive, print space-number-space\\n\\tmvi\\tb,'-'\\t; Otherwise, print minus sign\\n\\tcma\\t\\t; And negate the number (make positive)\\n\\tinr\\ta\\nprtab:\\tadi\\t'0'\\t; Make ASCII digit\\n\\tmov\\td,a\\t; Keep number\\n\\tmov\\ta,b\\t; Print space or minus sign\\n\\tcall\\tputc\\n\\tmov\\ta,d\\t; Restore number\\n\\tcall\\tputc\\t; Print number\\n\\tmvi\\ta,' '\\t; Print space\\n\\tcall\\tputc\\n\\tdcr\\tc\\t; Decrement column counter\\n\\tjnz\\ttnext\\n\\tlxi\\td,nl\\t; End of columns - print newline\\n\\tcall\\tputs\\n\\tmvi\\tc,10\\t; Column counter\\ntnext:\\tinx\\th\\t; Table done?\\n\\tmov\\ta,l\\n\\tcpi\\t100\\n\\tjnz\\ttable\\t; If not, keep going\\n\\t;;;\\tFind zeroes and crossings\\n\\tlxi\\tb,0\\t; B=zeroes, C=crossings\\n\\tlxi\\td,MAX\\t; Counter\\n\\tlxi\\th,MM+1\\ncount:\\tmov\\ta,m\\t; Get number\\n\\tana\\ta \\t; Zero?\\n\\tjnz\\tcnext\\n\\tinr\\tb\\t; If so, add zero\\n\\tdcx\\th\\t; Previous number also zero?\\n\\tmov\\ta,m\\n\\tinx\\th\\n\\tana\\ta\\n\\tjz\\tcnext\\n\\tinr\\tc\\t; If not, add crossiong\\ncnext:\\tinx\\th\\n\\tdcx\\td\\n\\tmov\\ta,d\\n\\tora\\te\\n\\tjnz\\tcount\\n\\tlxi\\td,zero\\t; Print zeroes\\n\\tcall\\tputs\\n\\tmov\\ta,b\\n\\tcall\\tputa\\n\\tlxi\\td,cross ; Print crossings\\n\\tcall\\tputs\\n\\tmov\\ta,c\\n\\tcall\\tputa\\n\\tlxi\\td,tms\\n\\tjmp\\tputs\\n\\t;;;\\tPrint character in A using CP/M, keeping registers\\nputc:\\tpush\\tb\\n\\tpush\\td\\n\\tpush\\th\\n\\tmov\\te,a\\n\\tmvi\\tc,2\\n\\tcall\\t5\\n\\tjmp\\tresrgs\\n\\t;;;\\tPrint number in A, keeping registers\\nputa:\\tpush\\tb\\n\\tpush\\td\\n\\tpush \\th\\n\\tlxi\\th,num\\nputad:\\tmvi\\tc,-1\\t\\nputal:\\tinr \\tc\\n\\tsui\\t10\\n\\tjnc\\tputal\\n\\tadi\\t10+'0'\\n\\tdcx\\th\\n\\tmov\\tm,a\\n\\tmov\\ta,c\\n\\tana\\ta\\n\\tjnz\\tputad\\n\\txchg\\n\\tmvi\\tc,9\\n\\tcall\\t5\\n\\tjmp\\tresrgs\\n\\t;;;\\tPrint string in DE using CP/M, keeping registers\\nputs:\\tpush\\tb\\n\\tpush\\td\\n\\tpush\\th\\n\\tmvi\\tc,9\\n\\tcall\\t5\\nresrgs:\\tpop\\th\\n\\tpop\\td\\n\\tpop \\tb\\n\\tret\\ncdehl:\\tmov\\ta,d\\n\\tcmp \\th\\n\\trnz\\n\\tmov\\ta,e\\n\\tcmp\\tl\\n\\tret\\ncbcde:\\tmov\\ta,b\\n\\tcmp\\td\\n\\trnz\\n\\tmov\\ta,c\\n\\tcmp\\te\\n\\tret\\nchlbc:\\tmov\\ta,h\\n\\tcmp\\tb\\n\\trnz\\n\\tmov\\ta,l\\n\\tcmp\\tc\\n\\tret\\n\\t;;;\\tStrings\\n\\tdb\\t'***'\\nnum:\\tdb\\t'$'\\nfrst99:\\tdb\\t'First 99 Mertens numbers:',13,10,' $'\\nnl:\\tdb\\t13,10,'$'\\t\\nzero:\\tdb\\t'M(N) is zero $'\\ncross:\\tdb\\t' times.',13,10,'M(N) crosses zero $'\\ntms:\\tdb\\t' times.$'\\n\\t;;; Numbers are stored page-aligned after program\\nMM:\\tequ\\t($/256)*256+256\\t\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \"MAX:\\tequ\\t1000\\t\\t; Amount of Mertens numbers to generate\\nputs:\\tequ\\t9\\t\\t; MS-DOS syscall to print a string\\nputch:\\tequ\\t2\\t\\t; MS-DOS syscall to print a character\\n\\tcpu\\t8086\\n\\torg\\t100h\\nsection\\t.text\\n\\t;;;\\tGenerate Mertens numbers\\n\\tmov\\tbx,M\\t\\t; BX = pointer to start of Mertens numbers\\n\\tmov\\tsi,1\\t\\t; Current Mertens number\\n\\tmov\\t[si+bx],byte 1\\t; First Mertens number is 1\\nouter:\\tinc\\tsi\\t\\t; Next Mertens number\\n\\tmov\\t[si+bx],byte 1\\t; Starts out at 1...\\n\\tmov\\tcx,2\\t\\t; CX = from 2 to current number,\\ninner:\\tmov\\tax,si\\t\\t; Divide current number,\\n\\txor\\tdx,dx\\n\\tdiv\\tcx\\t\\t; By CX\\n\\tmov\\tdi,ax\\n\\tmov\\tal,[di+bx]\\t; Get value at that location\\n\\tsub\\t[si+bx],al \\t; Subtract from current number\\n\\tinc\\tcx\\n\\tcmp\\tcx,si\\n\\tjbe\\tinner\\n\\tcmp\\tsi,MAX\\n\\tjbe\\touter\\n\\t;;;\\tPrint the table\\n\\tmov\\tdx,frst99\\t; First string\\n\\tcall\\toutstr\\n\\tmov\\tsi,1\\t\\t; Start at index 1\\n\\tmov\\tdh,9\\t\\t; Column count\\ntable:\\tmov\\tcl,[si+bx]\\t; Get item\\n\\ttest\\tcl,cl\\n\\tmov\\tdl,' '\\n\\tjns\\t.print\\t\\t; Positive?\\n\\tmov\\tdl,'-'\\t\\t; Otherwise, it is negative,\\n\\tneg\\tcl\\t\\t; print ' ' and negate\\n.print:\\tcall\\tputc\\t\\t; Print space or minus\\n\\tadd\\tcl,'0'\\t\\t; Add ASCII 0\\n\\tmov\\tdl,cl\\n\\tcall\\tputc\\t\\t; Print number\\n\\tmov \\tdl,' '\\n\\tcall\\tputc\\t\\t; Print space\\n\\tdec\\tdh\\t\\t; One less column left\\n\\tjnz\\t.next\\n\\tmov\\tdx,nl\\t\\t; Print newline\\n\\tcall\\toutstr\\n\\tmov\\tdh,10\\n.next:\\tinc\\tsi\\t\\t; Done yet?\\n\\tcmp\\tsi,100\\n\\tjb\\ttable\\t\\t; If not, print next item from table\\n\\t;;;\\tCalculate zeroes and crossings\\n\\txor\\tcx,cx\\t\\t; CL = zeroes, CH = crossings\\n\\tmov\\tsi,1\\n\\tmov\\tal,[si+bx]\\t; AL = current item\\nzc:\\tinc\\tsi\\n\\tmov\\tah,al\\t\\t; AH = previous item\\n\\tmov\\tal,[si+bx]\\n\\ttest\\tal,al\\t\\t; Zero?\\n\\tjnz\\t.next\\n\\tinc\\tcx\\t\\t; Then increment zero counter\\n\\ttest\\tah,ah\\t\\t; Previous one also zero?\\n\\tjz \\t.next\\n\\tinc\\tch\\t\\t; Then increment crossing counter\\n.next:\\tcmp\\tsi,MAX\\t\\t; Done yet?\\n\\tjbe\\tzc\\n\\t;;;\\tPrint zeroes and crossings\\n\\tmov\\tdx,zero\\n\\tcall\\toutstr\\n\\tmov\\tal,cl\\n\\tcall\\tputal\\n\\tmov\\tdx,cross\\n\\tcall \\toutstr\\n\\tmov\\tal,ch\\n\\tcall\\tputal\\n\\tmov\\tdx,tms\\n\\tjmp\\toutstr\\nputc:\\tmov\\tah,putch\\t; Print character\\n\\tint\\t21h\\n\\tret\\n\\t;;;\\tPrint AL in decimal format\\nputal:\\tmov\\tdi,num\\n.loop:\\taam\\t\\t\\t; Extract digit\\n\\tadd\\tal,'0'\\t\\t; Store digit\\n\\tdec\\tdi\\n\\tmov\\t[di],al\\n\\tmov\\tal,ah\\t\\t; Rest of number\\n\\ttest\\tal,al\\t\\t; Done?\\n\\tjnz\\t.loop\\t\\t; If not, get more digits\\n\\tmov\\tdx,di\\t\\t; Otherwise, print string\\noutstr:\\tmov\\tah,puts\\n\\tint\\t21h\\n\\tret\\nsection .data\\n\\tdb\\t'***'\\t\\t; Number output placeholder\\nnum:\\tdb\\t'$'\\nfrst99:\\tdb\\t'First 99 Mertens numbers:',13,10,' $'\\nnl:\\tdb\\t13,10,'$'\\t\\nzero:\\tdb\\t'M(N) is zero $'\\ncross:\\tdb\\t' times.',13,10,'M(N) crosses zero $'\\ntms:\\tdb\\t' times.$'\\nsection .bss\\nmm:\\tresb\\tMAX\\t; Mertens numbers\\nM:\\tequ\\tmm-1\\t; 1-based indexing\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \"INCLUDE \\\"D2:PRINTF.ACT\\\" ;from the Action! Tool Kit\\n\\nPROC MertensNumbers(INT ARRAY m INT count)\\n INT n,k\\n\\n m(1)=1\\n FOR n=2 TO count\\n DO\\n m(n)=1\\n FOR k=2 TO n\\n DO\\n m(n)==-m(n/k)\\n OD\\n OD\\nRETURN\\n\\nPROC PrintMertens(INT ARRAY m INT count)\\n CHAR ARRAY s(6)\\n INT i,col\\n\\n PrintF(\\\"First %I Mertens numbers:%E \\\",count)\\n col=1\\n FOR i=1 TO count\\n DO\\n StrI(m(i),s)\\n PrintF(\\\"%3S\\\",s)\\n col==+1\\n IF col=10 THEN\\n col=0 PutE()\\n FI\\n OD\\nRETURN\\n\\nPROC Main()\\n DEFINE MAX=\\\"1001\\\"\\n INT ARRAY m(MAX)\\n INT i,zeroCnt=[0],crossCnt=[0],prev=[0]\\n\\n Put(125) PutE() ;clear the screen\\n PrintF(\\\"Calculation of Mertens numbers,%E please wait...\\\")\\n MertensNumbers(m,MAX)\\n\\n Put(125) PutE() ;clear the screen\\n PrintMertens(m,99)\\n\\n FOR i=1 TO MAX\\n DO\\n IF m(i)=0 THEN\\n zeroCnt==+1\\n IF prev THEN\\n crossCnt==+1\\n FI\\n FI\\n prev=m(i)\\n OD\\n PrintF(\\\"%EM(n) is zero %I times for 1<=n<=%I.%E\\\",zeroCnt,MAX-1)\\n PrintF(\\\"%EM(n) crosses zero %I times for 1<=n<=%I.%E\\\",crossCnt,MAX-1)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"BEGIN # compute values of the Mertens function #\\n # Generate Mertens numbers #\\n [ 1 : 1000 ]INT m;\\n m[ 1 ] := 1;\\n FOR n FROM 2 TO UPB m DO\\n m[ n ] := 1;\\n FOR k FROM 2 TO n DO m[ n ] -:= m[ n OVER k ] OD\\n OD;\\n # Print table #\\n print( ( \\\"The first 99 Mertens numbers are:\\\", newline ) );\\n print( ( \\\" \\\" ) );\\n INT k := 9;\\n FOR n TO 99 DO\\n print( ( whole( m[ n ], -3 ) ) );\\n IF ( k -:= 1 ) = 0 THEN\\n k := 10;\\n print( ( newline ) )\\n FI\\n OD;\\n # Calculate zeroes and crossings #\\n INT zero := 0;\\n INT cross := 0;\\n FOR n FROM 2 TO UPB m DO\\n IF m[ n ] = 0 THEN\\n zero +:= 1;\\n IF m[ n - 1 ] /= 0 THEN cross +:= 1 FI\\n FI\\n OD;\\n print( ( newline ) );\\n print( ( \\\"M(N) is zero \\\", whole( zero, -4 ), \\\" times.\\\", newline ) );\\n print( ( \\\"M(N) crosses zero \\\", whole( cross, -4 ), \\\" times.\\\", newline ) )\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin % compute values of the Mertens function %\\n integer array M ( 1 :: 1000 );\\n integer k, zero, cross;\\n % Generate Mertens numbers %\\n M( 1 ) := 1;\\n for n := 2 until 1000 do begin\\n M( n ) := 1;\\n for k := 2 until n do M( n ) := M( n ) - M( n div k )\\n end for_n ;\\n % Print table %\\n write( \\\"The first 99 Mertens numbers are:\\\" );\\n write( \\\" \\\" );\\n k := 9;\\n for n := 1 until 99 do begin\\n writeon( i_w := 3, s_w := 0, M( n ) );\\n k := k - 1;\\n if k = 0 then begin\\n k := 10;\\n write()\\n end if_k_eq_0\\n end for_n ;\\n % Calculate zeroes and crossings %\\n zero := 0;\\n cross := 0;\\n for n :=2 until 1000 do begin\\n if M( n ) = 0 then begin\\n zero := zero + 1;\\n if M( n - 1 ) not = 0 then cross := cross + 1\\n end if_M_n_eq_0\\n end for_n ;\\n write( i_w := 2, s_w := 0, \\\"M(N) is zero \\\", zero, \\\" times.\\\" );\\n write( i_w := 2, s_w := 0, \\\"M(N) crosses zero \\\", cross, \\\" times.\\\" )\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"mertens←{\\n step ← {⍵,-⍨/⌽1,⍵[⌊n÷1↓⍳n←1+≢⍵]}\\n m1000 ← step⍣999⊢,1\\n zero ← m1000+.=0\\n cross ← +/(~∧1⌽⊢)m1000≠0\\n ⎕←'First 99 Mertens numbers:'\\n ⎕←10 10⍴'∘',m1000\\n ⎕←'M(N) is zero ',(⍕zero),' times.'\\n ⎕←'M(N) crosses zero ',(⍕cross),' times.'\\n}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"mobius: function [n][\\n if n=0 -> return \\\"\\\"\\n if n=1 -> return 1\\n f: factors.prime n\\n\\n if f <> unique f -> return 0\\n if? odd? size f -> return neg 1\\n else -> return 1\\n]\\n\\nmertens: function [z][sum map 1..z => mobius]\\n\\nprint \\\"The first 99 Mertens numbers are:\\\"\\nloop split.every:20 [\\\"\\\"]++map 1..99 => mertens 'a [\\n print map a 'item -> pad to :string item 2\\n]\\n\\nprint \\\"\\\"\\n\\nmertens1000: map 1..1000 => mertens\\nprint [\\\"Times M(x) is zero between 1 and 1000:\\\" size select mertens1000 => zero?]\\n\\ncrossed: new 0\\nfold mertens1000 [a,b][if and? zero? b not? zero? a -> inc 'crossed, b]\\nprint [\\\"Times M(x) crosses zero between 1 and 1000:\\\" crossed]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"result := \\\"first 100 terms:`n\\\"\\nloop 100\\n result .= SubStr(\\\" \\\" Mertens(A_Index), -1) . (Mod(A_Index, 10) ? \\\" \\\" : \\\"`n\\\")\\n\\neqZero := crZero := 0, preced:=1\\nloop 1000\\n{\\n if !(x := Mertens(A_Index))\\n eqZero++, crZero += preced<>0 ? 1 : 0\\n preced := x\\n}\\nresult .= \\\"`nfirst 1000 terms:\\\"\\nMsgBox, 262144, , % result .= \\\"`nequal to zero : \\\" eqZero \\\"`ncrosses zero : \\\" crZero\\nreturn\\n\\nMertens(n){\\n loop % n\\n result += Möbius(A_Index)\\n return result\\n}\\n\\n\\nMöbius(n){\\n if n=1\\n return 1\\n x := prime_factors(n)\\n c := x.Count()\\n sq := []\\n for i, v in x\\n if sq[v]\\n return 0\\n else\\n sq[v] := 1\\n return (c/2 = floor(c/2)) ? 1 : -1\\n}\\n\\nprime_factors(n) {\\n if (n <= 3)\\n return [n]\\n ans := [], done := false\\n while !done {\\n if !Mod(n, 2)\\n ans.push(2), n /= 2\\n else if !Mod(n, 3)\\n ans.push(3), n /= 3\\n else if (n = 1)\\n return ans\\n else {\\n sr := sqrt(n), done := true, i := 6\\n while (i <= sr+6) {\\n if !Mod(n, i-1) { ; is n divisible by i-1?\\n ans.push(i-1), n /= i-1, done := false\\n break\\n }\\n if !Mod(n, i+1) { ; is n divisible by i+1?\\n ans.push(i+1), n /= i+1, done := false\\n break\\n }\\n i += 6\\n }}}\\n ans.push(Format(\\\"{:d}\\\", n))\\n return ans\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"10 DEFINT C,Z,N,K,M: DIM M(1000)\\n20 M(1)=1\\n30 FOR N=2 TO 1000\\n40 M(N)=1\\n50 FOR K=2 TO N: M(N) = M(N)-M(INT(N/K)): NEXT\\n60 NEXT\\n70 PRINT \\\"First 99 Mertens numbers:\\\"\\n80 PRINT \\\" \\\";\\n90 FOR N=1 TO 99\\n100 PRINT USING \\\"###\\\";M(N);\\n110 IF N MOD 10 = 9 THEN PRINT\\n120 NEXT\\n130 C=0: Z=0\\n140 FOR N=1 TO 1000\\n150 IF M(N)=0 THEN Z=Z+1: IF M(N-1)<>0 THEN C=C+1\\n160 NEXT\\n170 PRINT \\\"M(N) is zero\\\";Z;\\\"times.\\\"\\n180 PRINT \\\"M(N) crosses zero\\\";C;\\\"times.\\\"\\n190 END\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"arraybase 1\\ndim M(1000)\\nM[1] = 1\\nfor n = 2 to 1000\\n\\tM[n] = 1\\n\\tfor k = 2 to n\\n\\t\\tM[n] = M[n] - M[int(n/k)]\\n\\tnext k\\nnext n\\nprint \\\"First 99 Mertens numbers:\\\"\\nprint \\\" \\\";\\nfor n = 1 to 99\\n\\tprint rjust(string(M[n]),3);\\n\\tif n mod 10 = 9 then print\\nnext n\\nnumCruza = 0\\nnumEsCero = 0\\nfor n = 1 to 1000\\n\\tif M[n] = 0 then\\n\\t\\tnumEsCero += 1\\n\\t\\tif M[n-1] <> 0 then numCruza += 1\\n\\tend if\\nnext n\\nprint\\nprint \\\"M(n) is zero \\\"; numEsCero; \\\" times.\\\"\\nprint \\\"M(n) crosses zero \\\"; numCruza; \\\" times.\\\"\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\nmanifest $( limit = 1000 $)\\n\\nlet mertens(v, max) be\\n$( v!1 := 1\\n for n = 2 to max do\\n $( v!n := 1\\n for k = 2 to n do\\n v!n := v!n - v!(n/k)\\n $)\\n$)\\n\\nlet start() be\\n$( let m = vec limit\\n let eqz, crossz = 0, 0\\n\\n writes(\\\"The first 99 Mertens numbers are:*N\\\")\\n mertens(m, limit)\\n for y=0 to 90 by 10 do\\n $( for x=0 to 9 do\\n test x+y=0\\n then writes(\\\" \\\")\\n else writed(m!(x+y),3)\\n wrch('*N')\\n $)\\n\\n for x=2 to limit do\\n if m!x=0 then\\n $( eqz := eqz + 1\\n unless m!(x-1)=0 do crossz := crossz + 1\\n $)\\n\\n writef(\\\"M(N) is zero %N times.*N\\\", eqz)\\n writef(\\\"M(N) crosses zero %N times.*N\\\", crossz)\\n$)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n\\nint* mertens_numbers(int max) {\\n int* m = malloc((max + 1) * sizeof(int));\\n if (m == NULL)\\n return m;\\n m[1] = 1;\\n for (int n = 2; n <= max; ++n) {\\n m[n] = 1;\\n for (int k = 2; k <= n; ++k)\\n m[n] -= m[n/k];\\n }\\n return m;\\n}\\n\\nint main() {\\n const int max = 1000;\\n int* mertens = mertens_numbers(max);\\n if (mertens == NULL) {\\n fprintf(stderr, \\\"Out of memory\\\\n\\\");\\n return 1;\\n }\\n printf(\\\"First 199 Mertens numbers:\\\\n\\\");\\n const int count = 200;\\n for (int i = 0, column = 0; i < count; ++i) {\\n if (column > 0)\\n printf(\\\" \\\");\\n if (i == 0)\\n printf(\\\" \\\");\\n else\\n printf(\\\"%2d\\\", mertens[i]);\\n ++column;\\n if (column == 20) {\\n printf(\\\"\\\\n\\\");\\n column = 0;\\n }\\n }\\n int zero = 0, cross = 0, previous = 0;\\n for (int i = 1; i <= max; ++i) {\\n int m = mertens[i];\\n if (m == 0) {\\n ++zero;\\n if (previous != 0)\\n ++cross;\\n }\\n previous = m;\\n }\\n free(mertens);\\n printf(\\\"M(n) is zero %d times for 1 <= n <= %d.\\\\n\\\", zero, max);\\n printf(\\\"M(n) crosses zero %d times for 1 <= n <= %d.\\\\n\\\", cross, max);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iomanip>\\n#include <iostream>\\n#include <vector>\\n\\nstd::vector<int> mertens_numbers(int max) {\\n std::vector<int> m(max + 1, 1);\\n for (int n = 2; n <= max; ++n) {\\n for (int k = 2; k <= n; ++k)\\n m[n] -= m[n / k];\\n }\\n return m;\\n}\\n\\nint main() {\\n const int max = 1000;\\n auto m(mertens_numbers(max));\\n std::cout << \\\"First 199 Mertens numbers:\\\\n\\\";\\n for (int i = 0, column = 0; i < 200; ++i) {\\n if (column > 0)\\n std::cout << ' ';\\n if (i == 0)\\n std::cout << \\\" \\\";\\n else\\n std::cout << std::setw(2) << m[i];\\n ++column;\\n if (column == 20) {\\n std::cout << '\\\\n';\\n column = 0;\\n }\\n }\\n int zero = 0, cross = 0, previous = 0;\\n for (int i = 1; i <= max; ++i) {\\n if (m[i] == 0) {\\n ++zero;\\n if (previous != 0)\\n ++cross;\\n }\\n previous = m[i];\\n }\\n std::cout << \\\"M(n) is zero \\\" << zero << \\\" times for 1 <= n <= 1000.\\\\n\\\";\\n std::cout << \\\"M(n) crosses zero \\\" << cross << \\\" times for 1 <= n <= 1000.\\\\n\\\";\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"% Generate Mertens numbers up to a given limit\\nmertens = proc (limit: int) returns (array[int])\\n M: array[int] := array[int]$fill(1,limit,0)\\n M[1] := 1\\n for n: int in int$from_to(2,limit) do\\n M[n] := 1\\n for k: int in int$from_to(2,n) do\\n M[n] := M[n] - M[n/k]\\n end\\n end\\n return (M)\\nend mertens\\n\\nstart_up = proc ()\\n max = 1000\\n\\n po: stream := stream$primary_output()\\n M: array[int] := mertens(max)\\n\\n stream$putl(po, \\\"The first 99 Mertens numbers are:\\\")\\n for y: int in int$from_to_by(0,90,10) do\\n for x: int in int$from_to(0,9) do\\n stream$putright(po, int$unparse(M[x+y]), 3)\\n except when bounds:\\n stream$putright(po, \\\"\\\", 3)\\n end\\n end\\n stream$putl(po, \\\"\\\")\\n end\\n\\n eqz: int := 0\\n crossz: int := 0\\n for i: int in int$from_to(2,max) do\\n if M[i]=0 then\\n eqz := eqz + 1\\n if M[i-1]~=0 then crossz := crossz + 1 end\\n end\\n end\\n\\n stream$putl(po, \\\"M(N) is zero \\\" || int$unparse(eqz) || \\\" times.\\\")\\n stream$putl(po, \\\"M(N) crosses zero \\\" || int$unparse(crossz) || \\\" times.\\\")\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. MERTENS.\\n\\n DATA DIVISION.\\n WORKING-STORAGE SECTION.\\n 01 VARIABLES.\\n 03 M PIC S99 OCCURS 1000 TIMES.\\n 03 N PIC 9(4).\\n 03 K PIC 9(4).\\n 03 V PIC 9(4).\\n 03 IS-ZERO PIC 99 VALUE 0.\\n 03 CROSS-ZERO PIC 99 VALUE 0.\\n\\n 01 OUTPUT-FORMAT.\\n 03 OUT-ITEM.\\n 05 OUT-NUM PIC -9.\\n 05 FILLER PIC X VALUE SPACE.\\n 03 OUT-LINE PIC X(30) VALUE SPACES.\\n 03 OUT-PTR PIC 99 VALUE 4.\\n\\n PROCEDURE DIVISION.\\n BEGIN.\\n PERFORM GENERATE-MERTENS.\\n PERFORM WRITE-TABLE.\\n PERFORM COUNT-ZEROES.\\n STOP RUN.\\n\\n GENERATE-MERTENS.\\n MOVE 1 TO M(1).\\n PERFORM MERTENS-OUTER-LOOP VARYING N FROM 2 BY 1\\n UNTIL N IS GREATER THAN 1000.\\n\\n MERTENS-OUTER-LOOP.\\n MOVE 1 TO M(N).\\n PERFORM MERTENS-INNER-LOOP VARYING K FROM 2 BY 1\\n UNTIL K IS GREATER THAN N.\\n\\n MERTENS-INNER-LOOP.\\n DIVIDE N BY K GIVING V.\\n SUBTRACT M(V) FROM M(N).\\n\\n WRITE-TABLE.\\n DISPLAY \\\"The first 99 Mertens numbers are: \\\"\\n PERFORM WRITE-ITEM VARYING N FROM 1 BY 1\\n UNTIL N IS GREATER THAN 99.\\n\\n WRITE-ITEM.\\n MOVE M(N) TO OUT-NUM.\\n STRING OUT-ITEM DELIMITED BY SIZE INTO OUT-LINE\\n WITH POINTER OUT-PTR.\\n IF OUT-PTR IS EQUAL TO 31,\\n DISPLAY OUT-LINE,\\n MOVE 1 TO OUT-PTR.\\n\\n COUNT-ZEROES.\\n PERFORM TEST-N-ZERO VARYING N FROM 2 BY 1\\n UNTIL N IS GREATER THAN 1000.\\n DISPLAY \\\"M(N) is zero \\\" IS-ZERO \\\" times.\\\".\\n DISPLAY \\\"M(N) crosses zero \\\" CROSS-ZERO \\\" times.\\\".\\n\\n TEST-N-ZERO.\\n IF M(N) IS EQUAL TO ZERO,\\n ADD 1 TO IS-ZERO,\\n SUBTRACT 1 FROM N GIVING K,\\n IF M(K) IS NOT EQUAL TO ZERO,\\n ADD 1 TO CROSS-ZERO.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\nconst MAX := 1000;\\n\\n# Table output\\nsub printtab(n: int8) is\\n if n<0 then\\n print_char('-');\\n n := -n;\\n else\\n print_char(' ');\\n end if;\\n print_char(n as uint8 + '0');\\n print_char(' ');\\nend sub;\\n\\n# Generate Merten numbers\\nvar M: int8[MAX+1];\\nM[0] := 0;\\nM[1] := 1;\\n\\nvar n: @indexof M := 2;\\nwhile n < @sizeof M loop\\n M[n] := 1;\\n var k: @indexof M := 2;\\n while k <= n loop\\n M[n] := M[n] - M[n/k];\\n k := k + 1;\\n end loop;\\n n := n + 1;\\nend loop;\\n\\n# Find zeroes and crossings\\nvar zero: uint8 := 0;\\nvar cross: uint8 := 0;\\nn := 1;\\nwhile n < @sizeof M loop\\n if M[n] == 0 then\\n zero := zero + 1;\\n if M[n-1] != 0 then\\n cross := cross + 1;\\n end if;\\n end if;\\n n := n + 1;\\nend loop;\\n\\n# Print table\\nprint(\\\"The first 99 Mertens numbers are:\\\\n\\\");\\nprint(\\\" \\\");\\nn := 1;\\nvar col: uint8 := 9;\\nwhile n < 100 loop\\n printtab(M[n]);\\n col := col - 1;\\n if col == 0 then\\n print_nl();\\n col := 10;\\n end if;\\n n := n + 1;\\nend loop;\\n\\nprint(\\\"M(n) is zero \\\"); print_i8(zero); print(\\\" times\\\\n\\\");\\nprint(\\\"M(n) crosses zero \\\"); print_i8(cross); print(\\\" times\\\\n\\\");\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"program Mertens_function;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils;\\n\\ntype\\n TMertens = record\\n merts: TArray<Integer>;\\n zeros, crosses: Integer;\\n class function Mertens(_to: Integer): TMertens; static;\\n end;\\n\\n{ TMertens }\\n\\nclass function TMertens.Mertens(_to: Integer): TMertens;\\nvar\\n sum, zeros, crosses: Integer;\\nbegin\\n if _to < 1 then\\n _to := 1;\\n\\n sum := 0;\\n zeros := 0;\\n crosses := 0;\\n\\n SetLength(Result.merts, _to + 1);\\n var primes := [2];\\n for var i := 1 to _to do\\n begin\\n var j := i;\\n var cp := 0;\\n var spf := false;\\n for var p in primes do\\n begin\\n if p > j then\\n Break;\\n if j mod p = 0 then\\n begin\\n j := j div p;\\n inc(cp);\\n end;\\n\\n if j mod p = 0 then\\n begin\\n spf := true;\\n Break;\\n end;\\n end;\\n if (cp = 0) and (i > 2) then\\n begin\\n cp := 1;\\n SetLength(primes, Length(primes) + 1);\\n primes[High(primes)] := i;\\n end;\\n\\n if not spf then\\n begin\\n if cp mod 2 = 0 then\\n inc(sum)\\n else\\n dec(sum);\\n end;\\n\\n Result.merts[i] := sum;\\n if sum = 0 then\\n begin\\n inc(zeros);\\n if (i > 1) and (Result.merts[i - 1] <> 0) then\\n inc(crosses);\\n end;\\n end;\\n Result.zeros := zeros;\\n Result.crosses := crosses;\\nend;\\n\\nbegin\\n var m := TMertens.mertens(1000);\\n writeln('Mertens sequence - First 199 terms:');\\n for var i := 0 to 199 do\\n begin\\n if i = 0 then\\n begin\\n write(' ');\\n Continue;\\n end;\\n if i mod 20 = 0 then\\n writeln;\\n write(format(' %3d', [m.merts[i]]));\\n end;\\n writeln(#10#10'Equals zero ', m.zeros, ' times between 1 and 1000');\\n writeln(#10'Crosses zero ', m.crosses, ' times between 1 and 1000');\\n {$IFNDEF UNIX} readln; {$ENDIF}\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"proc nonrec mertens([*] short m) void:\\n word n,k;\\n m[1] := 1;\\n for n from 2 upto dim(m,1)-1 do\\n m[n] := 1;\\n for k from 2 upto n do\\n m[n] := m[n] - m[n/k]\\n od\\n od\\ncorp\\n\\nproc nonrec main() void:\\n [1001] short m;\\n word x, y, eqz, crossz;\\n\\n mertens(m);\\n writeln(\\\"The first 99 Mertens numbers are:\\\");\\n for y from 0 by 10 upto 90 do\\n for x from 0 upto 9 do\\n if x+y=0\\n then write(\\\" \\\")\\n else write(m[x+y]:3)\\n fi\\n od;\\n writeln()\\n od;\\n\\n eqz := 0;\\n crossz := 0;\\n for x from 2 upto dim(m,1)-1 do\\n if m[x]=0 then\\n eqz := eqz + 1;\\n if m[x-1]~=0 then crossz := crossz + 1 fi\\n fi\\n od;\\n writeln(\\\"M(N) is zero \\\",eqz,\\\" times.\\\");\\n writeln(\\\"M(N) crosses zero \\\",crossz,\\\" times.\\\")\\ncorp\\n\",\n \"language\": \"Draco\"\n },\n {\n \"code\": \"func mertensNumbers(max) {\\n let mertens = Array.Empty(max + 1, 1)\\n for n in 2..max {\\n for k in 2..n {\\n mertens[n] -= mertens[n / k]\\n }\\n }\\n mertens\\n}\\n\\nlet max = 1000\\nlet mertens = mertensNumbers(max)\\n\\nlet count = 200\\nlet columns = 20\\nprint(\\\"First \\\\(count - 1) Mertens numbers:\\\")\\n\\nfor i in 0..<count {\\n if i % columns > 0 {\\n print(\\\" \\\", terminator: \\\"\\\")\\n }\\n print(i == 0 ? \\\" \\\" : mertens[i].ToString().PadLeft(2, ' ') + \\\" \\\", terminator: \\\"\\\")\\n if (i + 1) % columns == 0 {\\n print()\\n }\\n}\\n\\nvar (zero, cross, previous) = (0, 0, 0)\\nfor i in 1..max {\\n let m = mertens[i]\\n if m == 0 {\\n zero += 1\\n if previous != 0 {\\n cross += 1\\n }\\n }\\n previous = m\\n}\\n\\nprint(\\\"M(n) is zero \\\\(zero) times for 1 <= n <= \\\\(max).\\\")\\nprint(\\\"M(n) crosses zero \\\\(cross) times for 1 <= n <= \\\\(max).\\\")\\n\",\n \"language\": \"Dyalect\"\n },\n {\n \"code\": \"len mertens[] 1000\\nmertens[1] = 1\\nfor n = 2 to 1000\\n mertens[n] = 1\\n for k = 2 to n\\n mertens[n] -= mertens[n div k]\\n .\\n.\\nprint \\\"First 99 Mertens numbers:\\\"\\nwrite \\\" \\\"\\nnumfmt 0 2\\nfor n = 1 to 99\\n write mertens[n] & \\\" \\\"\\n if n mod 10 = 9\\n print \\\"\\\"\\n .\\n.\\nfor n = 1 to 1000\\n if mertens[n] = 0\\n zeros += 1\\n if mertens[n - 1] <> 0\\n crosses += 1\\n .\\n .\\n.\\nprint \\\"\\\"\\nprint \\\"In the first 1000 terms of the Mertens sequence there are:\\\"\\nprint zeros & \\\" zeros\\\"\\nprint crosses & \\\" zero crosses\\\"\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"// Mertens function. Nigel Galloway: January 31st., 2021\\nlet mertens=mobius|>Seq.scan((+)) 0|>Seq.tail\\nmertens|>Seq.take 500|>Seq.chunkBySize 25|>Seq.iter(fun n->Array.iter(printf \\\"%3d\\\") n;printfn \\\"\\\\n####\\\")\\nlet n=mertens|>Seq.take 1000|>Seq.mapi(fun n g->(n+1,g))|>Seq.groupBy snd|>Map.ofSeq\\nn|>Map.iter(fun n g->printf \\\"%3d->\\\" n; g|>Seq.iter(fun(n,_)->printf \\\"%3d \\\" n); printfn \\\"\\\\n####\\\")\\nprintfn \\\"%d Zeroes\\\\n####\\\" (Seq.length (snd n.[0]))\\nprintfn \\\"Crosses zero %d times\\\" (mertens|>Seq.take 1000|>Seq.pairwise|>Seq.sumBy(fun(n,g)->if n<>0 && g=0 then 1 else 0)))\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: formatting grouping io kernel math math.extras\\nmath.ranges math.statistics prettyprint sequences ;\\n\\n! Take the cumulative sum of the mobius sequence to avoid\\n! summing lower terms over and over.\\n: mertens-upto ( n -- seq ) [1,b] [ mobius ] map cum-sum ;\\n\\n\\\"The first 199 terms of the Mertens sequence:\\\" print\\n199 mertens-upto \\\" \\\" prefix 20 group\\n[ [ \\\"%3s\\\" printf ] each nl ] each nl\\n\\n\\\"In the first 1,000 terms of the Mertens sequence there are:\\\"\\nprint 1000 mertens-upto\\n[ [ zero? ] count bl pprint bl \\\"zeros.\\\" print ]\\n[\\n 2 <clumps> [ first2 [ 0 = not ] [ zero? ] bi* and ] count bl\\n pprint bl \\\"zero crossings.\\\" print\\n] bi\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": AMOUNT 1000 ;\\n\\nvariable mertens AMOUNT cells allot\\n: M 1- cells mertens + ; \\\\ 1-indexed array\\n\\n: make-mertens\\n 1 1 M !\\n 2 begin dup AMOUNT <= while\\n 1 over M !\\n 2 begin over over >= while\\n over over / M @\\n 2 pick M @ swap -\\n 2 pick M !\\n 1+ repeat\\n drop\\n 1+ repeat\\n drop\\n;\\n\\n: print-row\\n begin dup while\\n swap dup M @ 3 .r 1+\\n swap 1-\\n repeat\\n drop\\n;\\n\\n: print-table .\\\" \\\"\\n 1 9 print-row cr\\n begin dup 100 < while 10 print-row cr repeat\\n drop\\n;\\n\\n: find-zero-cross\\n 0 0\\n 1 begin dup AMOUNT <= while\\n dup M @ 0= if\\n swap 1+ swap\\n dup 1- M @ 0<> if rot 1+ -rot then\\n then\\n 1+\\n repeat\\n drop\\n;\\n\\nmake-mertens\\n.\\\" The first 99 Mertens numbers are:\\\" cr print-table\\nfind-zero-cross\\n.\\\" M(N) is zero \\\" . .\\\" times.\\\" cr\\n.\\\" M(N) crosses zero \\\" . .\\\" times.\\\" cr\\nbye\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" program Mertens\\n implicit none\\n integer M(1000), n, k, zero, cross\\n\\nC Generate Mertens numbers\\n M(1) = 1\\n do 10 n=2, 1000\\n M(n) = 1\\n do 10 k=2, n\\n M(n) = M(n) - M(n/k)\\n 10 continue\\n\\nC Print table\\n write (*,\\\"('The first 99 Mertens numbers are:')\\\")\\n write (*,\\\"(' ')\\\",advance='no')\\n k = 9\\n do 20 n=1, 99\\n write (*,'(I3)',advance='no') M(n)\\n k = k-1\\n if (k .EQ. 0) then\\n k=10\\n write (*,*)\\n end if\\n 20 continue\\n\\nC Calculate zeroes and crossings\\n zero = 0\\n cross = 0\\n do 30 n=2, 1000\\n if (M(n) .EQ. 0) then\\n zero = zero + 1\\n if (M(n-1) .NE. 0) cross = cross+1\\n end if\\n 30 continue\\n\\n 40 format(\\\"M(N) is zero \\\",I2,\\\" times.\\\")\\n write (*,40) zero\\n 50 format(\\\"M(N) crosses zero \\\",I2,\\\" times.\\\")\\n write (*,50) cross\\n end program\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"function padto( i as ubyte, j as integer ) as string\\n return wspace(i-len(str(j)))+str(j)\\nend function\\n\\ndim as integer M( 1 to 1000 ), n, col, k, psum\\ndim as integer num_zeroes = 0, num_cross = 0\\ndim as string outstr\\n\\nM(1) = 1\\nfor n = 2 to 1000\\n psum = 0\\n for k = 2 to n\\n psum += M(int(n/k))\\n next k\\n M(n) = 1 - psum\\n if M(n) = 0 then\\n num_zeroes += 1\\n if M(n-1)<>0 then\\n num_cross += 1\\n end if\\n end if\\nnext n\\n\\nprint using \\\"There are ### zeroes in the range 1 to 1000.\\\"; num_zeroes\\nprint using \\\"There are ### crossings in the range 1 to 1000.\\\"; num_cross\\nprint \\\"The first 100 Mertens numbers are: \\\"\\n\\nfor n=1 to 100\\n outstr += padto(3, M(n))+\\\" \\\"\\n if n mod 10 = 0 then\\n print outstr\\n outstr = \\\"\\\"\\n end if\\nnext n\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"void local fn MertensFunction\\n long mertens(1000), n, k, crossesTotal = 0, zerosTotal = 0\\n\\n mertens(1) = 1\\n\\n for n = 2 to 1000\\n mertens(n) = 1\\n for k = 2 to n\\n mertens(n) = mertens(n) - mertens(n/k)\\n next\\n next\\n\\n printf @\\\"First 99 Mertens numbers:\\\\n \\\\b\\\"\\n\\n for n = 1 to 99\\n printf @\\\"%3ld \\\\b\\\", mertens(n)\\n if ( n mod 10 == 9 ) then print\\n next\\n\\n for n = 1 to 1000\\n if ( mertens(n) == 0 )\\n zerosTotal++\\n if mertens(n-1) != 0 then crossesTotal++\\n end if\\n next\\n\\n print\\n printf @\\\"mertens(n) array is zero %ld times.\\\", zerosTotal\\n printf @\\\"mertens(n) array crosses zero %ld times.\\\", crossesTotal\\nend fn\\n\\nfn MertensFunction\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc mertens(to int) ([]int, int, int) {\\n if to < 1 {\\n to = 1\\n }\\n merts := make([]int, to+1)\\n primes := []int{2}\\n var sum, zeros, crosses int\\n for i := 1; i <= to; i++ {\\n j := i\\n cp := 0 // counts prime factors\\n spf := false // true if there is a square prime factor\\n for _, p := range primes {\\n if p > j {\\n break\\n }\\n if j%p == 0 {\\n j /= p\\n cp++\\n }\\n if j%p == 0 {\\n spf = true\\n break\\n }\\n }\\n if cp == 0 && i > 2 {\\n cp = 1\\n primes = append(primes, i)\\n }\\n if !spf {\\n if cp%2 == 0 {\\n sum++\\n } else {\\n sum--\\n }\\n }\\n merts[i] = sum\\n if sum == 0 {\\n zeros++\\n if i > 1 && merts[i-1] != 0 {\\n crosses++\\n }\\n }\\n }\\n return merts, zeros, crosses\\n}\\n\\nfunc main() {\\n merts, zeros, crosses := mertens(1000)\\n fmt.Println(\\\"Mertens sequence - First 199 terms:\\\")\\n for i := 0; i < 200; i++ {\\n if i == 0 {\\n fmt.Print(\\\" \\\")\\n continue\\n }\\n if i%20 == 0 {\\n fmt.Println()\\n }\\n fmt.Printf(\\\" % d\\\", merts[i])\\n }\\n fmt.Println(\\\"\\\\n\\\\nEquals zero\\\", zeros, \\\"times between 1 and 1000\\\")\\n fmt.Println(\\\"\\\\nCrosses zero\\\", crosses, \\\"times between 1 and 1000\\\")\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List.Split (chunksOf)\\nimport qualified Data.MemoCombinators as Memo\\nimport Math.NumberTheory.Primes (unPrime, factorise)\\nimport Text.Printf (printf)\\n\\nmoebius :: Integer -> Int\\nmoebius = product . fmap m . factorise\\n where\\n m (p, e)\\n | unPrime p == 0 = 0\\n | e == 1 = -1\\n | otherwise = 0\\n\\nmertens :: Integer -> Int\\nmertens = Memo.integral (\\\\n -> sum $ fmap moebius [1..n])\\n\\ncountZeros :: [Integer] -> Int\\ncountZeros = length . filter ((==0) . mertens)\\n\\ncrossesZero :: [Integer] -> Int\\ncrossesZero = length . go . fmap mertens\\n where\\n go (x:y:xs)\\n | y == 0 && x /= 0 = y : go (y:xs)\\n | otherwise = go (y:xs)\\n go _ = []\\n\\nmain :: IO ()\\nmain = do\\n printf \\\"The first 99 terms for M(1..99):\\\\n\\\\n \\\"\\n mapM_ (printf \\\"%3d\\\" . mertens) [1..9] >> printf \\\"\\\\n\\\"\\n mapM_ (\\\\row -> mapM_ (printf \\\"%3d\\\" . mertens) row >> printf \\\"\\\\n\\\") $ chunksOf 10 [10..99]\\n printf \\\"\\\\nM(n) is zero %d times for 1 <= n <= 1000.\\\\n\\\" $ countZeros [1..1000]\\n printf \\\"M(n) crosses zero %d times for 1 <= n <= 1000.\\\\n\\\" $ crossesZero [1..1000]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"mu =: 0:`(1 - 2 * 2|#@{.)@.(1: = */@{:)@(2&p:)\\\"0\\nM =: +/@([: mu 1:+i.)\\n\\nm1000 =: (M\\\"0) 1+i.1000\\nzero =: +/ m1000 = 0\\ncross =: +/ (-.*.1:|]) m1000 ~: 0\\n\\necho 'The first 99 Merten numbers are'\\necho 10 10$ __, 99{.m1000\\necho 'M(N) is zero ',(\\\":zero),' times.'\\necho 'M(N) crosses zero ',(\\\":cross),' times.'\\nexit''\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class MertensFunction {\\n\\n public static void main(String[] args) {\\n System.out.printf(\\\"First 199 terms of the merten function are as follows:%n \\\");\\n for ( int n = 1 ; n < 200 ; n++ ) {\\n System.out.printf(\\\"%2d \\\", mertenFunction(n));\\n if ( (n+1) % 20 == 0 ) {\\n System.out.printf(\\\"%n\\\");\\n }\\n }\\n\\n for ( int exponent = 3 ; exponent<= 8 ; exponent++ ) {\\n int zeroCount = 0;\\n int zeroCrossingCount = 0;\\n int positiveCount = 0;\\n int negativeCount = 0;\\n int mSum = 0;\\n int mMin = Integer.MAX_VALUE;\\n int mMinIndex = 0;\\n int mMax = Integer.MIN_VALUE;\\n int mMaxIndex = 0;\\n int nMax = (int) Math.pow(10, exponent);\\n for ( int n = 1 ; n <= nMax ; n++ ) {\\n int m = mertenFunction(n);\\n mSum += m;\\n if ( m < mMin ) {\\n mMin = m;\\n mMinIndex = n;\\n }\\n if ( m > mMax ) {\\n mMax = m;\\n mMaxIndex = n;\\n }\\n if ( m > 0 ) {\\n positiveCount++;\\n }\\n if ( m < 0 ) {\\n negativeCount++;\\n }\\n if ( m == 0 ) {\\n zeroCount++;\\n }\\n if ( m == 0 && mertenFunction(n - 1) != 0 ) {\\n zeroCrossingCount++;\\n }\\n }\\n System.out.printf(\\\"%nFor M(x) with x from 1 to %,d%n\\\", nMax);\\n System.out.printf(\\\"The maximum of M(x) is M(%,d) = %,d.%n\\\", mMaxIndex, mMax);\\n System.out.printf(\\\"The minimum of M(x) is M(%,d) = %,d.%n\\\", mMinIndex, mMin);\\n System.out.printf(\\\"The sum of M(x) is %,d.%n\\\", mSum);\\n System.out.printf(\\\"The count of positive M(x) is %,d, count of negative M(x) is %,d.%n\\\", positiveCount, negativeCount);\\n System.out.printf(\\\"M(x) has %,d zeroes in the interval.%n\\\", zeroCount);\\n System.out.printf(\\\"M(x) has %,d crossings in the interval.%n\\\", zeroCrossingCount);\\n }\\n }\\n\\n private static int MU_MAX = 100_000_000;\\n private static int[] MU = null;\\n private static int[] MERTEN = null;\\n\\n // Compute mobius and merten function via sieve\\n private static int mertenFunction(int n) {\\n if ( MERTEN != null ) {\\n return MERTEN[n];\\n }\\n\\n // Populate array\\n MU = new int[MU_MAX+1];\\n MERTEN = new int[MU_MAX+1];\\n MERTEN[1] = 1;\\n int sqrt = (int) Math.sqrt(MU_MAX);\\n for ( int i = 0 ; i < MU_MAX ; i++ ) {\\n MU[i] = 1;\\n }\\n\\n for ( int i = 2 ; i <= sqrt ; i++ ) {\\n if ( MU[i] == 1 ) {\\n // for each factor found, swap + and -\\n for ( int j = i ; j <= MU_MAX ; j += i ) {\\n MU[j] *= -i;\\n }\\n // square factor = 0\\n for ( int j = i*i ; j <= MU_MAX ; j += i*i ) {\\n MU[j] = 0;\\n }\\n }\\n }\\n\\n int sum = 1;\\n for ( int i = 2 ; i <= MU_MAX ; i++ ) {\\n if ( MU[i] == i ) {\\n MU[i] = 1;\\n }\\n else if ( MU[i] == -i ) {\\n MU[i] = -1;\\n }\\n else if ( MU[i] < 0 ) {\\n MU[i] = 1;\\n }\\n else if ( MU[i] > 0 ) {\\n MU[i] = -1;\\n }\\n sum += MU[i];\\n MERTEN[i] = sum;\\n }\\n return MERTEN[n];\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"def sum(s): reduce s as $x (null; . + $x);\\n\\ndef nwise($n):\\n def n: if length <= $n then . else .[0:$n] , (.[$n:] | n) end;\\n n;\\n\\ndef lpad($len): tostring | ($len - length) as $l | (\\\" \\\" * $l)[:$l] + .;\\n\\n# input: an array\\n# output: number of crossings at $value\\ndef count_crossings($value):\\n . as $a\\n | reduce range(0; length) as $i ({};\\n if $a[$i] == $value\\n then if $i == 0 or .prev != $value then .count += 1 else . end\\n else .\\n end\\n | .prev = $a[$i] )\\n | .count;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Input: $max >= 1\\n# Output: an array of size $max with $max mertenNumbers beginning with 1\\ndef mertensNumbers:\\n . as $max\\n | reduce range(2; $max + 1) as $n ( [1];\\n .[$n-1]=1\\n | reduce range(2; $n+1) as $k (.;\\n .[$n-1] -= .[($n / $k) | floor - 1] ));\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Task 0:\\ndef mertens_number:\\n mertensNumbers[.-1];\\n\\ndef task1:\\n \\\"The first \\\\(.) Mertens numbers are:\\\",\\n (mertensNumbers | nwise(10) | map(lpad(2)) | join(\\\" \\\") );\\n\\ndef task2:\\n . as $n\\n | sum(mertensNumbers[] | select(.==0) | 1)\\n | \\\"M(n) is zero \\\\(.) times for 1 <= n <= \\\\($n)\\\\n\\\";\\n\\ndef task3:\\n . as $n\\n | mertensNumbers\\n | count_crossings(0)\\n | \\\"M(n) crosses zero \\\\(.) times for 1 <= n <= \\\\($n).\\\\n\\\" ;\\n\\n(99|task1),\\n\\\"\\\",\\n(1000 | (task2, task3))\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Primes, Formatting\\n\\nfunction moebius(n::Integer)\\n @assert n > 0\\n m(p, e) = p == 0 ? 0 : e == 1 ? -1 : 0\\n return reduce(*, m(p, e) for (p, e) in factor(n) if p ≥ 0; init=1)\\nend\\nμ(n) = moebius(n)\\n\\nmertens(x) = sum(n -> μ(n), 1:x)\\nM(x) = mertens(x)\\n\\nprint(\\\"First 99 terms of the Mertens function for positive integers:\\\\n \\\")\\nfor n in 1:99\\n print(lpad(M(n), 3), n % 10 == 9 ? \\\"\\\\n\\\" : \\\"\\\")\\nend\\n\\nfunction maximinM(N)\\n z, cros, lastM, maxi, maxM, mini, minM, sumM, pos, neg = 0, 0, 0, 0, 0, 0, 0, 0, 0, 0\\n for i in 1:N\\n m = μ(i) + lastM\\n if m == 0 && lastM != 0\\n cros += 1\\n end\\n sumM += m\\n lastM = m\\n if m > maxM\\n maxi = i\\n maxM = m\\n elseif m < minM\\n mini = i\\n minM = m\\n end\\n if m > 0\\n pos += 1\\n elseif m < 0\\n neg += 1\\n else\\n z += 1\\n end\\n end\\n println(\\\"\\\\nFor M(x) with x from 1 to $(format(N, commas=true)):\\\")\\n println(\\\"The maximum of M(x) is M($(format(maxi, commas=true)) = $maxM.\\\")\\n println(\\\"The minimum of M(x) is M($(format(mini, commas=true))) = $minM.\\\")\\n println(\\\"The sum of M(x) is $(format(sumM, commas=true)).\\\")\\n println(\\\"The count of positive M(x) is $(format(pos, commas=true)), count of negative M(x) is $(format(neg, commas=true)).\\\")\\n println(\\\"M(x) has $(format(z, commas=true)) zeroes in the interval.\\\")\\n println(\\\"M(x) has $(format(cros, commas=true)) crossings in the interval.\\\")\\n diff = pos - neg\\n if diff > 0\\n println(\\\"Positive M(x) exceed negative ones by $(format(diff, commas=true)).\\\")\\n else\\n println(\\\"Negative M(x) exceed positive ones by $(format(-diff, commas=true)).\\\")\\n end\\nend\\n\\nforeach(maximinM, (1000, 1_000_000, 1_000_000_000))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \" NORMAL MODE IS INTEGER\\n DIMENSION M(1000)\\n\\n M(1) = 1\\n THROUGH GENMRT, FOR N=2, 1, N.G.1000\\n M(N) = 1\\n THROUGH GENMRT, FOR K=2, 1, K.G.N\\nGENMRT M(N) = M(N) - M(N/K)\\n\\n PRINT COMMENT $ FIRST 99 MERTEN NUMBERS ARE$\\n VECTOR VALUES F9 = $S3,9(I2,S1)*$\\n VECTOR VALUES F10 = $10(I2,S1)*$\\n\\n PRINT FORMAT F9, M(1), M(2), M(3), M(4), M(5), M(6),\\n 0 M(7), M(8), M(9)\\n\\n THROUGH SHOW, FOR N=10, 10, N.GE.100\\nSHOW PRINT FORMAT F10, M(N), M(N+1), M(N+2), M(N+3), M(N+4),\\n 0 M(N+5), M(N+6), M(N+7), M(N+8), M(N+9), M(N+10)\\n\\n ZERO = 0\\n CROSS = 0\\n THROUGH ZC, FOR N=1, 1, N.G.1000\\n WHENEVER M(N).E.0, ZERO = ZERO + 1\\nZC WHENEVER M(N).E.0 .AND. M(N-1).NE.0, CROSS = CROSS + 1\\n\\n VECTOR VALUES FZ = $13HM(N) IS ZERO ,I2,S1,5HTIMES*$\\n PRINT FORMAT FZ, ZERO\\n\\n VECTOR VALUES FC = $18HM(N) CROSSES ZERO ,I2,S1,5HTIMES*$\\n PRINT FORMAT FC, CROSS\\n\\n END OF PROGRAM\\n\",\n \"language\": \"MAD\"\n },\n {\n \"code\": \"ClearAll[Mertens]\\nMertens[n_] := Total[MoebiusMu[Range[n]]]\\nGrid[Partition[Mertens /@ Range[99], UpTo[10]]]\\nCount[Mertens /@ Range[1000], 0]\\nSequenceCount[Mertens /@ Range[1000], {Except[0], 0}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"MODULE Mertens;\\nFROM InOut IMPORT WriteString, WriteInt, WriteCard, WriteLn;\\n\\nCONST Max = 1000;\\nVAR n, k, x, y, zero, cross: CARDINAL;\\n M: ARRAY [1..Max] OF INTEGER;\\n\\nBEGIN\\n M[1] := 1;\\n FOR n := 2 TO Max DO\\n M[n] := 1;\\n FOR k := 2 TO n DO\\n M[n] := M[n] - M[n DIV k];\\n END;\\n END;\\n\\n WriteString(\\\"The first 99 Mertens numbers are:\\\");\\n WriteLn();\\n FOR y := 0 TO 90 BY 10 DO\\n FOR x := 0 TO 9 DO\\n IF x+y=0 THEN WriteString(\\\" \\\");\\n ELSE WriteInt(M[x+y], 3);\\n END;\\n END;\\n WriteLn();\\n END;\\n\\n zero := 0;\\n cross := 0;\\n FOR n := 2 TO Max DO\\n IF M[n] = 0 THEN\\n zero := zero + 1;\\n IF M[n-1] # 0 THEN\\n cross := cross + 1;\\n END;\\n END;\\n END;\\n\\n WriteString(\\\"M(n) is zero \\\");\\n WriteCard(zero,0);\\n WriteString(\\\" times.\\\");\\n WriteLn();\\n WriteString(\\\"M(n) crosses zero \\\");\\n WriteCard(cross,0);\\n WriteString(\\\" times.\\\");\\n WriteLn();\\nEND Mertens.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"import sequtils, strformat\\n\\nfunc mertensNumbers(max: int): seq[int] =\\n result = repeat(1, max + 1)\\n for n in 2..max:\\n for k in 2..n:\\n dec result[n], result[n div k]\\n\\nconst Max = 1000\\nlet mertens = mertensNumbers(Max)\\n\\necho \\\"First 199 Mertens numbers:\\\"\\nconst Count = 200\\nvar column = 0\\nfor i in 0..<Count:\\n if column > 0: stdout.write ' '\\n stdout.write if i == 0: \\\" \\\" else: &\\\"{mertens[i]:>2}\\\"\\n inc column\\n if column == 20:\\n stdout.write '\\\\n'\\n column = 0\\n\\nvar zero, cross, previous = 0\\nfor i in 1..Max:\\n let m = mertens[i]\\n if m == 0:\\n inc zero\\n if previous != 0:\\n inc cross\\n previous = m\\n\\necho \\\"\\\"\\necho &\\\"M(n) is zero {zero} times for 1 ⩽ n ⩽ {Max}.\\\"\\necho &\\\"M(n) crosses zero {cross} times for 1 ⩽ n ⩽ {Max}.\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"program Merten;\\n{$IFDEF FPC}\\n {$MODE DELPHI}\\n {$Optimization ON,ALL}\\n{$ELSE}\\n {$APPTYPE CONSOLE}\\n{$ENDIF}\\nuses\\n sysutils;\\nconst\\n BigLimit = 10*1000*1000*1000;//1e10\\n\\ntype\\n tSieveElement = Int8;\\n tpSieve = pInt8;\\n tMoebVal = array[-1..1] of Int64;\\nvar\\n MertensValues : array[-40000..50500] of NativeInt;\\n primes : array of byte;\\n sieve : array of tSieveElement;\\n\\nprocedure CompactPrimes;\\n//searching for needed primes\\n//last primes are marked with -1\\nvar\\n pSieve : tpSieve;\\n i,lmt,dp:NativeInt;\\nBegin\\n setlength(Primes,74500);//suffices for primes to calc square upto 1e12\\n //extract difference of primes\\n i := 2;\\n lmt := 0;\\n dp := 2;\\n pSieve :=@sieve[0];\\n repeat\\n IF pSieve[i]= 0 then\\n Begin\\n //mark for Moebius\\n pSieve[i]:= -1;\\n primes[lmt] := dp;\\n dp := 0;\\n inc(lmt);\\n end;\\n inc(dp);\\n inc(i);\\n until i*i >BigLimit;\\n setlength(Primes,lmt+1);\\n\\n repeat\\n IF pSieve[i]= 0 then\\n //mark for Moebius\\n pSieve[i]:= -1;\\n inc(i);\\n until i >BigLimit;\\nend;\\n\\nprocedure SieveSquares;\\n//mark all powers >=2 of prime => all powers = 2 is sufficient\\nvar\\n pSieve : tpSieve;\\n i,sq,k,prime : NativeInt;\\nBegin\\n pSieve := @sieve[0];\\n prime := 0;\\n For i := 0 to High(primes) do\\n Begin\\n prime := prime+primes[i];\\n sq := prime*prime;\\n k := sq;\\n if sq > BigLimit then\\n break;\\n repeat\\n pSieve[k] := 0;\\n inc(k,sq);\\n until k> BigLimit;\\n end;\\nend;\\n\\nprocedure initPrimes;\\nvar\\n pSieve : tpSieve;\\n fakt,\\n sieveprime : NativeUint;\\nbegin\\n pSieve := @sieve[0];\\n sieveprime := 2;\\n repeat\\n if pSieve[sieveprime]=0 then\\n begin\\n fakt := sieveprime+sieveprime;\\n while fakt <=BigLimit do\\n Begin\\n //count divisors\\n inc(pSieve[fakt]);\\n inc(fakt,sieveprime);\\n end;\\n end;\\n inc(sieveprime);\\n until sieveprime>BigLimit DIV 2;\\n //Möbius of 1\\n pSieve[1] := 1;\\n\\n //convert to Moebius\\n For fakt := 2 to BigLimit do\\n Begin\\n sieveprime := pSieve[fakt];\\n IF sieveprime<>0 then\\n pSieve[fakt] := 1-(2*(sieveprime AND 1)) ;\\n end;\\n CompactPrimes;\\n SieveSquares;\\nend;\\n\\nprocedure OutMerten10(Lmt,ZeroCross:NativeInt;Const MoebVal:tMoebVal);\\nvar\\n i,j: NativeInt;\\nBegin\\n Writeln(lmt:11,MoebVal[-1]:11,MoebVal[1]:11,MoebVal[-1]+MoebVal[1]:11,\\n MoebVal[-1]-MoebVal[1]:7,MoebVal[0]:11);\\n i:= low(MertensValues);\\n while MertensValues[i] = 0 do\\n inc(i);\\n j:= High(MertensValues);\\n while MertensValues[j] = 0 do\\n dec(j);\\n write('Merten min ',i:6,' max ',j:6,' zero''s ',MertensValues[0]:8);\\n writeln(' zeroCross ',ZeroCross);\\n writeln;\\nend;\\n\\nprocedure Count_x10;\\nvar\\n MoebCount: tMoebVal;\\n pSieve : tpSieve;\\n i,lmt,Merten,Moebius,LastMert,ZeroCross: NativeInt;\\nbegin\\n writeln('[1 to limit]');\\n Writeln('Limit Moeb. odd Moeb.even sqr-free Merten Zero''s');\\n\\n pSieve := @sieve[0];\\n For i := -1 to 1 do\\n MoebCount[i]:=0;\\n ZeroCross := 0;\\n LastMert :=1;\\n Merten :=0;\\n lmt := 10;\\n i := 1;\\n repeat\\n while i <= lmt do\\n Begin\\n Moebius := pSieve[i];\\n inc(MoebCount[Moebius]);\\n inc(Merten,Moebius);\\n inc(MertensValues[Merten]);//MoebCount[1]-MoebCount[-1]]);\\n inc(ZeroCross,ORD( (Merten = 0) AND (LastMert <> 0)));\\n LastMert := Merten;\\n inc(i);\\n end;\\n OutMerten10(Lmt,ZeroCross,MoebCount);\\n\\n IF lmt >= BigLimit then\\n BREAK;\\n lmt := lmt*10;\\n IF lmt >BigLimit then\\n lmt := BigLimit;\\n until false;\\n writeln;\\nend;\\n\\nprocedure OutMerten(lmt:NativeInt);\\nvar\\n i,k,m : NativeInt;\\nBegin\\n iF lmt> BigLimit then\\n lmt := BigLimit;\\n writeln('Mertens numbers from 1 to ',lmt);\\n k := 9;\\n write('':3);\\n m := 0;\\n For i := 1 to lmt do\\n Begin\\n inc(m,sieve[i]);\\n write(m:3);\\n dec(k);\\n IF k = 0 then\\n Begin\\n writeln;\\n k := 10;\\n end;\\n end;\\n writeln;\\nend;\\n\\nprocedure OutMoebius(lmt:NativeInt);\\nvar\\n i,k : NativeInt;\\nBegin\\n iF lmt> BigLimit then\\n lmt := BigLimit;\\n writeln('Möbius numbers from 1 to ',lmt);\\n k := 19;\\n write('':3);\\n For i := 1 to lmt do\\n Begin\\n write(sieve[i]:3);\\n dec(k);\\n IF k = 0 then\\n Begin\\n writeln;\\n k := 20;\\n end;\\n end;\\n writeln;\\nend;\\n\\nBegin\\n setlength(sieve,BigLimit+1);\\n InitPrimes;\\n SieveSquares;\\n Count_x10;\\n OutMoebius(199);\\n OutMerten(99);\\n setlength(primes,0);\\n setlength(sieve,0);\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use utf8;\\nuse strict;\\nuse warnings;\\nuse feature 'say';\\nuse List::Util 'uniq';\\n\\nsub prime_factors {\\n my ($n, $d, @factors) = (shift, 1);\\n while ($n > 1 and $d++) {\\n $n /= $d, push @factors, $d until $n % $d;\\n }\\n @factors\\n}\\n\\nsub μ {\\n my @p = prime_factors(shift);\\n @p == uniq(@p) ? 0 == @p%2 ? 1 : -1 : 0\\n}\\n\\nsub progressive_sum {\\n my @sum = shift @_;\\n push @sum, $sum[-1] + $_ for @_;\\n @sum\\n}\\n\\nmy($upto, $show, @möebius) = (1000, 199, ());\\npush @möebius, μ($_) for 1..$upto;\\nmy @mertens = progressive_sum @möebius;\\n\\nsay \\\"Mertens sequence - First $show terms:\\\\n\\\" .\\n (' 'x4 . sprintf \\\"@{['%4d' x $show]}\\\", @mertens[0..$show-1]) =~ s/((.){80})/$1\\\\n/gr .\\n sprintf(\\\"\\\\nEquals zero %3d times between 1 and $upto\\\", scalar grep { ! $_ } @mertens) .\\n sprintf \\\"\\\\nCrosses zero%3d times between 1 and $upto\\\", scalar grep { ! $mertens[$_-1] and $mertens[$_] } 1 .. @mertens;\\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;\\\">-- (skip arg added to join_by)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">mcache</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">Mertens</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;\\\">for</span> <span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">mcache</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;\\\">integer</span> <span style=\\\"color: #000000;\\\">mm</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">m</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">mm</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">mcache</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">)]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">mcache</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">mm</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;\\\">mcache</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 <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">first</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">99</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">perline</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">10</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--constant first = 199, perline = 20 -- matches C/Go/etc\\n --constant first = 143, perline = 12 -- matches wp</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\" .\\\"</span><span style=\\\"color: #0000FF;\\\">}&</span><span style=\\\"color: #7060A8;\\\">apply</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">first</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">Mertens</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 %d Mertens numbers:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">first</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_by</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;\\\">perline</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;\\\">\\\"%3d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">skip</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;\\\">prev</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">zeroes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">crosses</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\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;\\\">1000</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">m</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">Mertens</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;\\\">m</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">zeroes</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">crosses</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">prev</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: #000000;\\\">prev</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">m</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;\\\">\\\"\\\\nMertens[1..1000] equals zero %d times and crosses zero %d times\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">zeroes</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">crosses</span><span style=\\\"color: #0000FF;\\\">})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"mertens: procedure options(main);\\n %replace MAX by 1000;\\n\\n declare M(1:MAX) fixed binary(5);\\n declare (n, k) fixed binary(10);\\n declare (isZero, crossZero) fixed binary(8);\\n\\n M(1) = 1;\\n do n = 2 to MAX;\\n M(n) = 1;\\n do k = 2 to n;\\n M(n) = M(n) - M(divide(n,k,10));\\n end;\\n end;\\n\\n put skip list('The first 99 Mertens numbers are:');\\n put skip list(' ');\\n do n = 1 to 99;\\n put edit(M(n)) (F(3));\\n if mod(n,10) = 9 then put skip;\\n end;\\n\\n isZero = 0;\\n crossZero = 0;\\n do n = 2 to MAX;\\n if M(n) = 0 then do;\\n isZero = isZero + 1;\\n if M(n-1) ^= 0 then\\n crossZero = crossZero + 1;\\n end;\\n end;\\n\\n put skip list('Zeroes: ',isZero);\\n put skip list('Crossings:',crossZero);\\nend mertens;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \":- dynamic mertens_number_cache/2.\\n\\nmertens_number(1, 1):- !.\\nmertens_number(N, M):-\\n mertens_number_cache(N, M),\\n !.\\nmertens_number(N, M):-\\n N >= 2,\\n mertens_number(N, 2, M, 0),\\n assertz(mertens_number_cache(N, M)).\\n\\nmertens_number(N, N, M, M):- !.\\nmertens_number(N, K, M, S):-\\n N1 is N // K,\\n mertens_number(N1, M1),\\n K1 is K + 1,\\n S1 is S - M1,\\n mertens_number(N, K1, M, S1).\\n\\nprint_mertens_numbers(Count):-\\n print_mertens_numbers(Count, 0).\\n\\nprint_mertens_numbers(Count, Count):-!.\\nprint_mertens_numbers(Count, N):-\\n (N == 0 ->\\n write(' ')\\n ;\\n mertens_number(N, M),\\n writef('%3r', [M])\\n ),\\n N1 is N + 1,\\n Column is N1 mod 20,\\n (N > 0, Column == 0 ->\\n nl\\n ;\\n true\\n ),\\n print_mertens_numbers(Count, N1).\\n\\ncount_zeros(From, To, Z, C):-\\n count_zeros(From, To, Z, C, 0, 0, 0).\\n\\ncount_zeros(From, To, Z, C, Z, C, _):-\\n From > To,\\n !.\\ncount_zeros(From, To, Z, C, Z1, C1, P):-\\n mertens_number(From, M),\\n (M == 0 -> Z2 is Z1 + 1 ; Z2 = Z1),\\n (M == 0, P \\\\= 0 -> C2 is C1 + 1 ; C2 = C1),\\n Next is From + 1,\\n count_zeros(Next, To, Z, C, Z2, C2, M).\\n\\nmain:-\\n writeln('First 199 Mertens numbers:'),\\n print_mertens_numbers(200),\\n count_zeros(1, 1000, Z, C),\\n writef('M(n) is zero %t times for 1 <= n <= 1000.\\\\n', [Z]),\\n writef('M(n) crosses zero %t times for 1 <= n <= 1000.\\\\n', [C]).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Dim M.i(1000)\\n\\nM(1)=1\\nFor n=2 To 1000\\n psum=0\\n For k=2 To n : psum+M(Int(n/k)) : Next : M(n)=1-psum\\n If M(n)=0 : z+1 : If M(n-1)<>0 : c+1 : EndIf : EndIf\\nNext\\n\\nOpenConsole(\\\"\\\")\\nPrintN(\\\"First 99 Mertens numbers:\\\") : Print(Space(4))\\nFor n=1 To 99 : Print(RSet(Str(M(n)),4)) : If n%10=9 : PrintN(\\\"\\\") : EndIf : Next\\nPrintN(\\\"M(N) is zero \\\"+Str(z)+\\\" times.\\\") : PrintN(\\\"M(N) crosses zero \\\"+Str(c)+\\\" times.\\\")\\nInput()\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"def mertens(count):\\n \\\"\\\"\\\"Generate Mertens numbers\\\"\\\"\\\"\\n m = [None, 1]\\n for n in range(2, count+1):\\n m.append(1)\\n for k in range(2, n+1):\\n m[n] -= m[n//k]\\n return m\\n\\n\\nms = mertens(1000)\\n\\nprint(\\\"The first 99 Mertens numbers are:\\\")\\nprint(\\\" \\\", end=' ')\\ncol = 1\\nfor n in ms[1:100]:\\n print(\\\"{:2d}\\\".format(n), end=' ')\\n col += 1\\n if col == 10:\\n print()\\n col = 0\\n\\nzeroes = sum(x==0 for x in ms)\\ncrosses = sum(a!=0 and b==0 for a,b in zip(ms, ms[1:]))\\nprint(\\\"M(N) equals zero {} times.\\\".format(zeroes))\\nprint(\\\"M(N) crosses zero {} times.\\\".format(crosses))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ ' [ 0 ]\\n swap 1+ times\\n [ dup -1 peek\\n i^ 1+ mobius\\n + join ]\\n behead drop ] is mertens ( n --> [ )\\n\\n [ say \\\" \\\"\\n 99 times\\n [ dup i^ peek\\n dup dup\\n -1 > if sp\\n abs 10 < if sp\\n echo\\n i^ 1+ 10 mod\\n 9 = if cr ]\\n drop ] is grid ( [ --> )\\n\\n [ 0 swap\\n witheach\\n [ 0 = + ] ] is zeroes ( [ --> n )\\n\\n [ 0 0\\n rot witheach\\n [ dup 0 =\\n rot 0 !=\\n and\\n rot + swap ]\\n drop ] is crossings ( [ --> n )\\n\\n 1000 mertens\\n say \\\"First 99 terms:\\\"\\n cr\\n dup grid\\n cr\\n dup zeroes echo say \\\" zeroes and \\\"\\n crossings echo say \\\" crossings\\\"\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"use Prime::Factor;\\n\\nsub μ (Int \\\\n) {\\n return 0 if n %% 4 or n %% 9 or n %% 25 or n %% 49 or n %% 121;\\n my @p = prime-factors(n);\\n +@p == +@p.unique ?? +@p %% 2 ?? 1 !! -1 !! 0\\n}\\n\\nmy @mertens = lazy [\\\\+] flat '', 1, (2..*).hyper.map: -> \\\\n { μ(n) };\\n\\nput \\\"Mertens sequence - First 199 terms:\\\\n\\\",\\n @mertens[^200]».fmt('%3s').batch(20).join(\\\"\\\\n\\\"),\\n \\\"\\\\n\\\\nEquals zero \\\", +@mertens[1..1000].grep( !* ),\\n ' times between 1 and 1000', \\\"\\\\n\\\\nCrosses zero \\\",\\n +@mertens[1..1000].kv.grep( {!$^v and @mertens[$^k]} ),\\n \\\" times between 1 and 1000\\\\n\\\\nFirst Mertens equal to:\\\";\\n\\nfor 10, 20, 30 … 100 -> $threshold {\\n printf \\\"%4d: M(%d)\\\\n\\\", -$threshold, @mertens.first: * == -$threshold, :k;\\n printf \\\"%4d: M(%d)\\\\n\\\", $threshold, @mertens.first: * == $threshold, :k;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm computes & shows a value grid of the Mertens function for a range of integers*/\\nparse arg LO HI grp eqZ xZ . /*obtain optional arguments from the CL*/\\nif LO=='' | LO==\\\",\\\" then LO= 0 /*Not specified? Then use the default.*/\\nif HI=='' | HI==\\\",\\\" then HI= 199 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif grp=='' | grp==\\\",\\\" then grp= 20 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif eqZ=='' | eqZ==\\\",\\\" then eqZ= 1000 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif xZ=='' | xZ==\\\",\\\" then xZ= 1000 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\ncall genP /*generate primes up to max √ HIHI */\\n call Franz LO, HI\\nif eqZ>0 then call Franz 1, -eqZ\\nif xZ>0 then call Franz -1, xZ\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nFranz: parse arg a 1 oa,b 1 ob; @Mertens= ' The Mertens sequence from '\\na= abs(a); b= abs(b); grid= oa>=0 & ob>=0 /*semaphore used to show a grid title. */\\nif grid then say center(@Mertens LO \\\" ──► \\\" HI\\\" \\\", max(50, grp*3), '═') /*show title*/\\n else say\\nzeros= 0 /*# of 0's found for Mertens function.*/\\nXzero= 0 /*number of times that zero was crossed*/\\n$=; prev= /*$ holds output grid of GRP numbers. */\\n do j=a to b; _= Mertens(j) /*process some numbers from LO ──► HI.*/\\n if _==0 then zeros= zeros + 1 /*Is Zero? Then bump the zeros counter*/\\n if _==0 then if prev\\\\==0 then Xzero= Xzero+1 /*prev ¬=0? \\\" \\\" \\\" Xzero \\\" */\\n prev= _\\n if grid then $= $ right(_, 2) /*build grid if A & B are non─negative.*/\\n if words($)==grp then do; say substr($, 2); $= /*show grid if fully populated, */\\n end /* and nullify it for more #s. */\\n end /*j*/ /*for small grids, using wordCnt is OK.*/\\n\\nif $\\\\=='' then say substr($, 2) /*handle any residual numbers not shown*/\\nif oa<0 then say @Mertens a \\\" to \\\" b ' has crossed zero ' Xzero \\\" times.\\\"\\nif ob<0 then say @Mertens a \\\" to \\\" b ' has ' zeros \\\" zeros.\\\"\\nreturn\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nMertens: procedure expose @. !!. M.; parse arg n; if M.n\\\\==. then return M.n\\n if n<1 then return '∙'; m= 0 /*handle special cases of non─positive#*/\\n do k=1 for n; m= m + mobius(k) /*sum the MU's up to N. */\\n end /*k*/ /* [↑] mobius function uses memoization*/\\n M.n= m; return m /*return the sum of all the MU's. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nmobius: procedure expose @. !!.; parse arg x 1 ox /*get integer to be tested for mu */\\n if !!.x\\\\==. then return !!.x /*X computed before? Return that value*/\\n if x<1 then return '∙'; mu= 0 /*handle special case of non-positive #*/\\n do k=1; p= @.k; if p>x then leave /* (P) > X? Then we're done.*/\\n if p*p>x then do; mu= mu+1; leave; end /* (P**2) > X? Bump # and leave*/\\n if x//p==0 then do; mu= mu+1 /*X divisible by P? Bump mu number.*/\\n x= x % p /* Divide by prime. */\\n if x//p==0 then return 0 /*X÷by P? Then return zero*/\\n end\\n end /*k*/ /*MU (below) is almost always small, <9*/\\n !!.ox= -1 ** mu; return !!.ox /*raise -1 to the mu power, memoize it.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngenP: @.1=2; @.2=3; @.3=5; @.4=7; @.5=11; @.6=13 /*initialize some low primes; # primes.*/\\n !!.=.; M.=!!.; #= 6; sq.#= @.6**2 /* \\\" 2 arrays for memoization. */\\n do j=@.#+4 by 2 to max(HI, eqZ, xZ); parse var j '' -1 _ /*odd Ps from now on*/\\n if _==5 then iterate; if j//3==0 then iterate; if j//7==0 then iterate /*÷ 5 3 7*/\\n do k=7 while sq.k<=j /*divide by some generated odd primes. */\\n if j//@.k==0 then iterate j /*Is J divisible by P? Then not prime*/\\n end /*k*/ /* [↓] a prime (J) has been found. */\\n #= #+1; @.#=j; sq.j= j*j /*bump P count; P──►@.; compute J**2*/\\n end /*j*/; return /*calculate the squares of some primes.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"require 'prime'\\n\\ndef μ(n)\\n return 1 if self == 1\\n pd = n.prime_division\\n return 0 unless pd.map(&:last).all?(1)\\n pd.size.even? ? 1 : -1\\nend\\n\\ndef M(n)\\n (1..n).sum{|n| μ(n)}\\nend\\n\\n([\\\" \\\"] + (1..199).map{|n|\\\"%2s\\\" % M(n)}).each_slice(20){|line| puts line.join(\\\" \\\") }\\n\\nar = (1..1000).map{|n| M(n)}\\nputs \\\"\\\\nThe Mertens function is zero #{ar.count(0)} times in the range (1..1000);\\\"\\nputs \\\"it crosses zero #{ar.each_cons(2).count{|m1, m2| m1 != 0 && m2 == 0}} times.\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"dim M(1000)\\nM(1) = 1\\nfor n = 2 to 1000\\n M(n) = 1\\n for k = 2 to n\\n M(n) = M(n)-M(int(n/k))\\n next k\\nnext n\\nprint \\\"First 99 Mertens numbers:\\\"\\nprint \\\" \\\";\\nfor n = 1 to 99\\n print using(\\\"###\\\", M(n));\\n if n mod 10 = 9 then print\\nnext n\\nnumCruza = 0\\nnumEsCero = 0\\nfor n = 1 to 1000\\n if M(n) = 0 then\\n numEsCero = numEsCero +1\\n if M(n-1) <> 0 then numCruza = numCruza +1\\n end if\\nnext n\\nprint\\nprint \\\"M(n) is zero \\\"; numEsCero; \\\" times.\\\"\\nprint \\\"M(n) crosses zero \\\"; numCruza; \\\" times.\\\"\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"program mertens;\\n m := [1] * 1000;\\n loop for n in [1..#m] do\\n m(n) -:= 0 +/[m(n div k) : k in [2..n]];\\n end loop;\\n\\n print(\\\"The first 99 Mertens numbers:\\\");\\n putchar(\\\" \\\");\\n loop for n in [1..99] do\\n putchar(lpad(str m(n), 3));\\n if n mod 10=9 then print; end if;\\n end loop;\\n\\n zero := #[n : n in [1..#m] | m(n) = 0];\\n cross := #[n : n in [1..#m] | m(n) = 0 and m(n-1) /= 0];\\n\\n print(\\\"M(N) is zero \\\" + str zero + \\\" times.\\\");\\n print(\\\"M(N) crosses zero \\\" + str cross + \\\" times.\\\");\\nend program;\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"say mertens(123456789) #=> 1170\\nsay mertens(1234567890) #=> 9163\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"func mertens(n) is cached {\\n\\n var lookup_size = (2 * n.iroot(3)**2)\\n var mertens_lookup = [0]\\n\\n for k in (1..lookup_size) {\\n mertens_lookup[k] = (mertens_lookup[k-1] + k.moebius)\\n }\\n\\n static cache = Hash()\\n\\n func (n) {\\n\\n if (n <= lookup_size) {\\n return mertens_lookup[n]\\n }\\n\\n if (cache.has(n)) {\\n return cache{n}\\n }\\n\\n var M = 1\\n var s = n.isqrt\\n\\n for k in (2 .. floor(n/(s+1))) {\\n M -= __FUNC__(floor(n/k))\\n }\\n\\n for k in (1..s) {\\n M -= (mertens_lookup[k] * (floor(n/k) - floor(n/(k+1))))\\n }\\n\\n cache{n} = M\\n }(n)\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"with (200) {|n|\\n say \\\"Mertens function in the range 1..#{n}:\\\"\\n (1..n).map { mertens(_) }.slices(20).each {|line|\\n say line.map{ \\\"%2s\\\" % _ }.join(' ')\\n }\\n}\\n\\nwith (1000) {|n|\\n say \\\"\\\\nIn the range 1..#{n}, there are:\\\"\\n say (1..n->count_by { mertens(_)==0 }, \\\" zeros\\\")\\n say (1..n->count_by { mertens(_)==0 && mertens(_-1)!=0 }, \\\" zero crossings\\\")\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"import Foundation\\n\\nfunc mertensNumbers(max: Int) -> [Int] {\\n var mertens = Array(repeating: 1, count: max + 1)\\n for n in 2...max {\\n for k in 2...n {\\n mertens[n] -= mertens[n / k]\\n }\\n }\\n return mertens\\n}\\n\\nlet max = 1000\\nlet mertens = mertensNumbers(max: max)\\n\\nlet count = 200\\nlet columns = 20\\nprint(\\\"First \\\\(count - 1) Mertens numbers:\\\")\\nfor i in 0..<count {\\n if i % columns > 0 {\\n print(\\\" \\\", terminator: \\\"\\\")\\n }\\n print(i == 0 ? \\\" \\\" : String(format: \\\"%2d\\\", mertens[i]), terminator: \\\"\\\")\\n if (i + 1) % columns == 0 {\\n print()\\n }\\n}\\n\\nvar zero = 0, cross = 0, previous = 0\\nfor i in 1...max {\\n let m = mertens[i]\\n if m == 0 {\\n zero += 1\\n if previous != 0 {\\n cross += 1\\n }\\n }\\n previous = m\\n}\\nprint(\\\"M(n) is zero \\\\(zero) times for 1 <= n <= \\\\(max).\\\")\\nprint(\\\"M(n) crosses zero \\\\(cross) times for 1 <= n <= \\\\(max).\\\")\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"DIM m(1000)\\nLET m(1) = 1\\nFOR n = 2 TO 1000\\n LET m(n) = 1\\n FOR k = 2 TO n\\n LET m(n) = m(n)-m(INT(n/k))\\n NEXT k\\nNEXT n\\nPRINT \\\"First 99 Mertens numbers:\\\"\\nPRINT \\\" \\\";\\nFOR n = 1 TO 99\\n PRINT \\\" \\\";\\n PRINT USING \\\"##\\\": m(n);\\n !IF REMAINDER(ROUND(n),10) = 9 THEN PRINT\\n IF MOD(n,10) = 9 THEN PRINT\\nNEXT n\\nLET numcruza = 0\\nLET numeszero = 0\\nFOR n = 1 TO 1000\\n IF m(n) = 0 THEN\\n LET numeszero = numeszero+1\\n IF m(n-1) <> 0 THEN LET numcruza = numcruza+1\\n END IF\\nNEXT n\\nPRINT\\nPRINT \\\"M(n) is zero\\\"; numeszero; \\\"times.\\\"\\nPRINT \\\"M(n) crosses zero\\\"; numcruza; \\\"times.\\\"\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"fn mertens(t int) ([]int, int, int) {\\n mut to:=t\\n if to < 1 {\\n to = 1\\n }\\n mut merts := []int{len:to+1}\\n mut primes := [2]\\n mut sum := 0\\n mut zeros := 0\\n mut crosses := 0\\n for i := 1; i <= to; i++ {\\n mut j := i\\n mut cp := 0 // counts prime factors\\n mut spf := false // true if there is a square prime factor\\n for p in primes {\\n if p > j {\\n break\\n }\\n if j%p == 0 {\\n j /= p\\n cp++\\n }\\n if j%p == 0 {\\n spf = true\\n break\\n }\\n }\\n if cp == 0 && i > 2 {\\n cp = 1\\n primes << i\\n }\\n if !spf {\\n if cp%2 == 0 {\\n sum++\\n } else {\\n sum--\\n }\\n }\\n merts[i] = sum\\n if sum == 0 {\\n zeros++\\n if i > 1 && merts[i-1] != 0 {\\n crosses++\\n }\\n }\\n }\\n return merts, zeros, crosses\\n}\\n\\nfn main() {\\n merts, zeros, crosses := mertens(1000)\\n println(\\\"Mertens sequence - First 199 terms:\\\")\\n for i := 0; i < 200; i++ {\\n if i == 0 {\\n print(\\\" \\\")\\n continue\\n }\\n if i%20 == 0 {\\n println('')\\n }\\n print(\\\" ${merts[i]:2}\\\")\\n }\\n println(\\\"\\\\n\\\\nEquals zero $zeros times between 1 and 1000\\\")\\n println(\\\"\\\\nCrosses zero $crosses times between 1 and 1000\\\")\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\nimport \\\"./math\\\" for Int\\n\\nvar isSquareFree = Fn.new { |n|\\n var i = 2\\n while (i * i <= n) {\\n if (n%(i*i) == 0) return false\\n i = (i > 2) ? i + 2 : i + 1\\n }\\n return true\\n}\\n\\nvar mu = Fn.new { |n|\\n if (n < 1) Fiber.abort(\\\"Argument must be a positive integer\\\")\\n if (n == 1) return 1\\n var sqFree = isSquareFree.call(n)\\n var factors = Int.primeFactors(n)\\n if (sqFree && factors.count % 2 == 0) return 1\\n if (sqFree) return -1\\n return 0\\n}\\n\\nvar M = Fn.new { |x| (1..x).reduce { |sum, n| sum + mu.call(n) } }\\n\\nSystem.print(\\\"The first 199 Mertens numbers are:\\\")\\nfor (i in 0..9) {\\n for (j in 0..19) {\\n if (i == 0 && j == 0) {\\n System.write(\\\" \\\")\\n } else {\\n System.write(\\\"%(Fmt.dm(3, M.call(i*20 + j))) \\\")\\n }\\n }\\n System.print()\\n}\\n\\n// use the recurrence relationship for the last 2 parts rather than calling M directly\\nvar count = 0\\nvar mertens = M.call(1)\\nfor (i in 2..1000) {\\n mertens = mertens + mu.call(i)\\n if (mertens == 0) count = count + 1\\n}\\nSystem.print(\\\"\\\\nThe Mertens function is zero %(count) times in the range [1, 1000].\\\")\\n\\ncount = 0\\nvar prev = M.call(1)\\nfor (i in 2..1000) {\\n var next = prev + mu.call(i)\\n if (next == 0 && prev != 0) count = count + 1\\n prev = next\\n}\\nSystem.print(\\\"\\\\nThe Mertens function crosses zero %(count) times in the range [1, 1000].\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"PROGRAM\\t\\\"Mertens\\\"\\nVERSION\\t\\\"0.0000\\\"\\n\\nDECLARE FUNCTION Entry ()\\n\\nFUNCTION Entry ()\\nDIM M[1000]\\nM[1] = 1\\nFOR n = 2 TO 1000\\n\\tM[n] = 1\\n\\tFOR k = 2 TO n\\n\\t\\tM[n] = M[n] - M[INT(n/k)]\\n\\tNEXT k\\nNEXT n\\nPRINT \\\"First 99 Mertens numbers:\\\"\\nPRINT \\\" \\\";\\nFOR n = 1 TO 99\\n\\tPRINT FORMAT$(\\\"###\\\", M[n]);\\n\\tIF n MOD 10 = 9 THEN PRINT\\nNEXT n\\nnumCruza = 0\\nnumEsCero = 0\\nFOR n = 1 TO 1000\\n\\tIF M[n] = 0 THEN\\n\\t\\tINC numEsCero\\n\\t\\tIF M[n-1] <> 0 THEN INC numCruza\\n\\tEND IF\\nNEXT n\\nPRINT\\nPRINT \\\"M(n) is zero\\\"; numEsCero; \\\" times.\\\"\\nPRINT \\\"M(n) crosses zero\\\"; numCruza; \\\" times.\\\"\\n\\nEND FUNCTION\\nEND PROGRAM\\n\",\n \"language\": \"XBasic\"\n },\n {\n \"code\": \"integer M ( 1+1000 );\\ninteger K, Zero, Cross, N;\\nbegin \\\\compute values of the Mertens function\\n\\\\Generate Mertens numbers\\nM( 1 ) := 1;\\nfor N := 2 to 1000 do begin\\n M( N ) := 1;\\n for K := 2 to N do M( N ) := M( N ) - M( N / K )\\n end;\\n\\\\Print table\\nText(0, \\\"The first 99 Mertens numbers are:^m^j\\\");\\nText(0, \\\" \\\" );\\nK := 9;\\nfor N := 1 to 99 do begin\\n Format(3, 0);\\n RlOut(0, float(M(N)));\\n K := K - 1;\\n if K = 0 then begin\\n K := 10;\\n CrLf(0);\\n end\\n end;\\n\\\\Calculate zeroes and crossings\\nZero := 0;\\nCross := 0;\\nfor N :=2 to 1000 do begin\\n if M( N ) = 0 then begin\\n Zero := Zero + 1;\\n if M( N - 1 ) # 0 then Cross := Cross + 1\\n end\\n end;\\nText(0, \\\"M(N) is zero \\\"); IntOut(0, Zero); Text(0, \\\" times.^m^j\\\" );\\nText(0, \\\"M(N) crosses zero \\\"); IntOut(0, Cross); Text(0, \\\" times.^m^j\\\" );\\nend\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"dim M(1000)\\nM(1) = 1\\nfor n = 2 to 1000\\n\\tM(n) = 1\\n\\tfor k = 2 to n\\n\\t\\tM(n) = M(n) - M(int(n/k))\\n\\tnext k\\nnext n\\nprint \\\"First 99 Mertens numbers:\\\"\\nprint \\\" \\\";\\nfor n = 1 to 99\\n\\tprint M(n) using(\\\"###\\\");\\n\\tif mod(n, 10) = 9 print\\nnext n\\nnumCruza = 0\\nnumEsCero = 0\\nfor n = 1 to 1000\\n\\tif M(n) = 0 then\\n\\t\\tnumEsCero = numEsCero + 1\\n\\t\\tif M(n-1) <> 0 numCruza = numCruza + 1\\n\\tend if\\nnext n\\nprint\\nprint \\\"M(n) is zero \\\", numEsCero, \\\" times.\\\"\\nprint \\\"M(n) crosses zero \\\", numCruza, \\\" times.\\\"\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"#!/bin/bash\\nMAX=1000\\n\\nm[1]=1\\nfor n in `seq 2 $MAX`\\ndo\\n m[n]=1\\n for k in `seq 2 $n`\\n do\\n m[n]=$((m[n]-m[n/k]))\\n done\\ndone\\n\\necho 'The first 99 Mertens numbers are:'\\necho -n ' '\\nfor n in `seq 1 99`\\ndo\\n printf '%2d ' ${m[n]}\\n test $((n%10)) -eq 9 && echo\\ndone\\n\\nzero=0\\ncross=0\\nfor n in `seq 1 $MAX`\\ndo\\n if [ ${m[n]} -eq 0 ]\\n then\\n ((zero++))\\n test ${m[n-1]} -ne 0 && ((cross++))\\n fi\\ndone\\n\\necho \\\"M(N) is zero $zero times.\\\"\\necho \\\"M(N) crosses zero $cross times.\\\"\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"fcn mertensW(n){\\n [1..].tweak(fcn(n,pm){\\n pm.incN(mobius(n));\\n pm.value\\n }.fp1(Ref(0)))\\n}\\nfcn mobius(n){\\n pf:=primeFactors(n);\\n sq:=pf.filter1('wrap(f){ (n % (f*f))==0 }); // False if square free\\n if(sq==False){ if(pf.len().isEven) 1 else -1 }\\n else 0\\n}\\nfcn primeFactors(n){ // Return a list of prime 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)) # both are tail recursion\\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 {\n \"code\": \"mertensW().walk(199)\\n.pump(Console.println, T(Void.Read,19,False),\\n\\tfcn{ vm.arglist.pump(String,\\\"%3d\\\".fmt) });\\n\\nprintln(\\\"\\\\nIn the first 1,000 terms of the Mertens sequence there are:\\\");\\notm:=mertensW().pump(1_000,List);\\notm.reduce(fcn(s,m){ s + (m==0) },0) : println(_,\\\" zeros\\\");\\notm.reduce(fcn(p,m,rs){ rs.incN(m==0 and p!=0); m }.fp2( s:=Ref(0) ));\\nprintln(s.value,\\\" zero crossings\\\");\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Mertens-function"}}},{"rowIdx":485,"cells":{"solutions":{"kind":"list like","value":[{"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''' was discovered and named by ancient civilizations as it was\nthought to be the most pure and beautiful (like Gold). The '''Silver ratio''' was was\nalso known to the early Greeks, though was not named so until later as a nod to\nthe '''Golden ratio''' to which it is closely related. The series has been extended to\nencompass all of the related ratios and was given the general name '''Metallic ratios''' (or ''Metallic means'').\n''Somewhat incongruously as the original Golden ratio referred to the adjective \"golden\" rather than the metal \"gold\".''\n\n'''Metallic ratios''' are the real roots of the general form equation:\n\n <big> x<sup>2</sup> - bx - 1 = 0 </big>\n\nwhere the integer '''b''' determines which specific one it is.\n\nUsing the quadratic equation:\n\n <big> ( -b ± √(b<sup>2</sup> - 4ac) ) / 2a = x </big>\n\nSubstitute in (from the top equation) '''1''' for '''a''', '''-1''' for '''c''', and recognising that -b is negated we get:\n\n <big> ( b ± √(b<sup>2</sup> + 4) ) ) / 2 = x </big>\n\nWe only want the real root:\n\n <big> ( b + √(b<sup>2</sup> + 4) ) ) / 2 = x </big>\n\nWhen we set '''b''' to '''1''', we get an irrational number: the '''Golden ratio'''.\n\n <big> ( 1 + √(1<sup>2</sup> + 4) ) / 2 = (1 + √5) / 2 = ~1.618033989... </big>\n\nWith '''b''' set to '''2''', we get a different irrational number: the '''Silver ratio'''.\n\n <big> ( 2 + √(2<sup>2</sup> + 4) ) / 2 = (2 + √8) / 2 = ~2.414213562... </big>\n\nWhen the ratio '''b''' is '''3''', it is commonly referred to as the '''Bronze''' ratio, '''4''' and '''5'''\nare sometimes called the '''Copper''' and '''Nickel''' ratios, though they aren't as\nstandard. After that there isn't really any attempt at standardized names. They\nare given names here on this page, but consider the names fanciful rather than\ncanonical.\n\nNote that technically, '''b''' can be '''0''' for a \"smaller\" ratio than the '''Golden ratio'''.\nWe will refer to it here as the '''Platinum ratio''', though it is kind-of a\ndegenerate case.\n\n'''Metallic ratios''' where '''b''' > '''0''' are also defined by the irrational continued fractions:\n\n <big> [b;b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b...] </big>\n\n\nSo, The first ten '''Metallic ratios''' are:\n\n:::::: {| class=\"wikitable\" style=\"text-align: center;\"\n|+ Metallic ratios\n!Name!!'''b'''!!Equation!!Value!!Continued fraction!!OEIS link\n|-\n|Platinum||0||(0 + √4) / 2|| 1||-||-\n|-\n|Golden||1||(1 + √5) / 2|| 1.618033988749895...||[1;1,1,1,1,1,1,1,1,1,1...]||[[OEIS:A001622]]\n|-\n|Silver||2||(2 + √8) / 2|| 2.414213562373095...||[2;2,2,2,2,2,2,2,2,2,2...]||[[OEIS:A014176]]\n|-\n|Bronze||3||(3 + √13) / 2|| 3.302775637731995...||[3;3,3,3,3,3,3,3,3,3,3...]||[[OEIS:A098316]]\n|-\n|Copper||4||(4 + √20) / 2|| 4.23606797749979...||[4;4,4,4,4,4,4,4,4,4,4...]||[[OEIS:A098317]]\n|-\n|Nickel||5||(5 + √29) / 2|| 5.192582403567252...||[5;5,5,5,5,5,5,5,5,5,5...]||[[OEIS:A098318]]\n|-\n|Aluminum||6||(6 + √40) / 2|| 6.16227766016838...||[6;6,6,6,6,6,6,6,6,6,6...]||[[OEIS:A176398]]\n|-\n|Iron||7||(7 + √53) / 2|| 7.140054944640259...||[7;7,7,7,7,7,7,7,7,7,7...]||[[OEIS:A176439]]\n|-\n|Tin||8||(8 + √68) / 2|| 8.123105625617661...||[8;8,8,8,8,8,8,8,8,8,8...]||[[OEIS:A176458]]\n|-\n|Lead||9||(9 + √85) / 2|| 9.109772228646444...||[9;9,9,9,9,9,9,9,9,9,9...]||[[OEIS:A176522]]\n|}\n\n<hr>\n\n\nThere are other ways to find the '''Metallic ratios'''; one, (the focus of this task)\nis through '''successive approximations of Lucas sequences'''.\n\nA traditional '''Lucas sequence''' is of the form:\n\n <big>x<sub>''n''</sub> = P * x<sub>''n-1''</sub> - Q * x<sub>''n-2''</sub></big>\n\nand starts with the first 2 values '''0, 1'''. \n\nFor our purposes in this task, to find the metallic ratios we'll use the form:\n\n <big>x<sub>''n''</sub> = b * x<sub>''n-1''</sub> + x<sub>''n-2''</sub></big>\n\n( '''P''' is set to '''b''' and '''Q''' is set to '''-1'''. ) To avoid \"divide by zero\" issues we'll start the sequence with the first two terms '''1, 1'''. The initial starting value has very little effect on the final ratio or convergence rate. ''Perhaps it would be more accurate to call it a Lucas-like sequence.'' \n\nAt any rate, when '''b = 1''' we get:\n\n <big>x<sub>''n''</sub> = x<sub>''n-1''</sub> + x<sub>''n-2''</sub></big>\n\n 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144...\n\nmore commonly known as the Fibonacci sequence.\n\nWhen '''b = 2''':\n\n <big>x<sub>''n''</sub> = 2 * x<sub>''n-1''</sub> + x<sub>''n-2''</sub></big>\n\n 1, 1, 3, 7, 17, 41, 99, 239, 577, 1393...\n\n\nAnd so on.\n\n\nTo find the ratio by successive approximations, divide the ('''n+1''')th term by the\n'''n'''th. As '''n''' grows larger, the ratio will approach the '''b''' metallic ratio.\n\nFor '''b = 1''' (Fibonacci sequence):\n\n 1/1 = 1\n 2/1 = 2\n 3/2 = 1.5\n 5/3 = 1.666667\n 8/5 = 1.6\n 13/8 = 1.625\n 21/13 = 1.615385\n 34/21 = 1.619048\n 55/34 = 1.617647\n 89/55 = 1.618182\n etc.\n\nIt converges, but pretty slowly. In fact, the '''Golden ratio''' has the slowest\npossible convergence for any irrational number.\n\n\n;Task\n\nFor each of the first '''10 Metallic ratios'''; '''b''' = '''0''' through '''9''':\n\n* Generate the corresponding \"Lucas\" sequence.\n* Show here, on this page, at least the first '''15''' elements of the \"Lucas\" sequence.\n* Using successive approximations, calculate the value of the ratio accurate to '''32''' decimal places.\n* Show the '''value''' of the '''approximation''' at the required accuracy.\n* Show the '''value''' of '''n''' when the approximation reaches the required accuracy (How many iterations did it take?).\n\nOptional, stretch goal - Show the '''value''' and number of iterations '''n''', to approximate the '''Golden ratio''' to '''256''' decimal places.\n\nYou may assume that the approximation has been reached when the next iteration does not cause the value (to the desired places) to change.\n\n;See also\n* [[wp:Metallic_mean|Wikipedia: Metallic mean]]\n* [[wp:Lucas_sequence|Wikipedia: Lucas sequence]]\n\n","language":"00-TASK"},{"code":"#include <boost/multiprecision/cpp_dec_float.hpp>\n#include <iostream>\n\nconst char* names[] = { \"Platinum\", \"Golden\", \"Silver\", \"Bronze\", \"Copper\", \"Nickel\", \"Aluminium\", \"Iron\", \"Tin\", \"Lead\" };\n\ntemplate<const uint N>\nvoid lucas(ulong b) {\n std::cout << \"Lucas sequence for \" << names[b] << \" ratio, where b = \" << b << \":\\nFirst \" << N << \" elements: \";\n auto x0 = 1L, x1 = 1L;\n std::cout << x0 << \", \" << x1;\n for (auto i = 1u; i <= N - 1 - 1; i++) {\n auto x2 = b * x1 + x0;\n std::cout << \", \" << x2;\n x0 = x1;\n x1 = x2;\n }\n std::cout << std::endl;\n}\n\ntemplate<const ushort P>\nvoid metallic(ulong b) {\n using namespace boost::multiprecision;\n using bfloat = number<cpp_dec_float<P+1>>;\n bfloat x0(1), x1(1);\n auto prev = bfloat(1).str(P+1);\n for (auto i = 0u;;) {\n i++;\n bfloat x2(b * x1 + x0);\n auto thiz = bfloat(x2 / x1).str(P+1);\n if (prev == thiz) {\n std::cout << \"Value after \" << i << \" iteration\" << (i == 1 ? \": \" : \"s: \") << thiz << std::endl << std::endl;\n break;\n }\n prev = thiz;\n x0 = x1;\n x1 = x2;\n }\n}\n\nint main() {\n for (auto b = 0L; b < 10L; b++) {\n lucas<15>(b);\n metallic<32>(b);\n }\n std::cout << \"Golden ratio, where b = 1:\" << std::endl;\n metallic<256>(1);\n\n return 0;\n}\n","language":"C++"},{"code":"using static System.Math;\nusing static System.Console;\nusing BI = System.Numerics.BigInteger;\n\nclass Program {\n\n static BI IntSqRoot(BI v, BI res) { // res is the initial guess\n BI term = 0, d = 0, dl = 1; while (dl != d) { term = v / res; res = (res + term) >> 1;\n dl = d; d = term - res; } return term; }\n\n static string doOne(int b, int digs) { // calculates result via square root, not iterations\n int s = b * b + 4; BI g = (BI)(Sqrt((double)s) * Pow(10, ++digs)),\n bs = IntSqRoot(s * BI.Parse('1' + new string('0', digs << 1)), g);\n bs += b * BI.Parse('1' + new string('0', digs));\n bs >>= 1; bs += 4; string st = bs.ToString();\n return string.Format(\"{0}.{1}\", st[0], st.Substring(1, --digs)); }\n\n static string divIt(BI a, BI b, int digs) { // performs division\n int al = a.ToString().Length, bl = b.ToString().Length;\n a *= BI.Pow(10, ++digs << 1); b *= BI.Pow(10, digs);\n string s = (a / b + 5).ToString(); return s[0] + \".\" + s.Substring(1, --digs); }\n\n // custom formating\n static string joined(BI[] x) { int[] wids = {1, 1, 2, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13};\n string res = \"\"; for (int i = 0; i < x.Length; i++) res +=\n string.Format(\"{0,\" + (-wids[i]).ToString() + \"} \", x[i]); return res; }\n\n static void Main(string[] args) { // calculates and checks each \"metal\"\n WriteLine(\"Metal B Sq.Rt Iters /---- 32 decimal place value ----\\\\ Matches Sq.Rt Calc\");\n int k; string lt, t = \"\"; BI n, nm1, on; for (int b = 0; b < 10; b++) {\n BI[] lst = new BI[15]; lst[0] = lst[1] = 1;\n for (int i = 2; i < 15; i++) lst[i] = b * lst[i - 1] + lst[i - 2];\n // since all the iterations (except Pt) are > 15, continue iterating from the end of the list of 15\n n = lst[14]; nm1 = lst[13]; k = 0; for (int j = 13; k == 0; j++) {\n lt = t; if (lt == (t = divIt(n, nm1, 32))) k = b == 0 ? 1 : j;\n on = n; n = b * n + nm1; nm1 = on; }\n WriteLine(\"{0,4} {1} {2,2} {3, 2} {4} {5}\\n{6,19} {7}\", \"Pt Au Ag CuSn Cu Ni Al Fe Sn Pb\"\n .Split(' ')[b], b, b * b + 4, k, t, t == doOne(b, 32), \"\", joined(lst)); }\n // now calculate and check big one\n n = nm1 =1; k = 0; for (int j = 1; k == 0; j++) {\n lt = t; if (lt == (t = divIt(n, nm1, 256))) k = j;\n on = n; n += nm1; nm1 = on; }\n WriteLine(\"\\nAu to 256 digits:\"); WriteLine(t);\n WriteLine(\"Iteration count: {0} Matched Sq.Rt Calc: {1}\", k, t == doOne(1, 256)); }\n}\n","language":"C-sharp"},{"code":"// Metallic Ration. Nigel Galloway: September 16th., 2020\nlet rec fN i g (e,l)=match i with 0->g |_->fN (i-1) (int(l/e)::g) (e,(l%e)*10I)\nlet fI(P:int)=Seq.unfold(fun(n,g)->Some(g,((bigint P)*n+g,n)))(1I,1I)\nlet fG fI fN=let _,(n,g)=fI|>Seq.pairwise|>Seq.mapi(fun n g->(n,fN g))|>Seq.pairwise|>Seq.find(fun((_,n),(_,g))->n=g) in (n,List.rev g)\nlet mR n g=printf \"First 15 elements when P = %d -> \" n; fI n|>Seq.take 15|>Seq.iter(printf \"%A \"); printf \"\\n%d decimal places \" g\n let Σ,n=fG(fI n)(fN (g+1) []) in printf \"required %d iterations -> %d.\" Σ n.Head; List.iter(printf \"%d\")n.Tail ;printfn \"\"\n[0..9]|>Seq.iter(fun n->mR n 32; printfn \"\"); mR 1 256\n","language":"F-Sharp"},{"code":"USING: combinators decimals formatting generalizations io kernel\nmath prettyprint qw sequences ;\nIN: rosetta-code.metallic-ratios\n\n: lucas ( n a b -- n a' b' ) tuck reach * + ;\n\n: lucas. ( n -- )\n 1 pprint bl 1 1 14 [ lucas over pprint bl ] times 3drop nl ;\n\n: approx ( a b -- d ) swap [ 0 <decimal> ] bi@ 32 D/ ;\n\n: approximate ( n -- value iter )\n -1 swap 1 1 0 1 [ 2dup = ]\n [ [ 1 + ] 5 ndip [ lucas 2dup approx ] 2dip drop ] until\n 4nip decimal>ratio swap ;\n\nqw{\n Platinum Golden Silver Bronze Copper Nickel Aluminum Iron\n Tin Lead\n}\n[\n dup dup approximate {\n [ \"Lucas sequence for %s ratio \" printf ]\n [ \"where b = %d:\\n\" printf ]\n [ \"First 15 elements: \" write lucas. ]\n [ \"Approximated value: %.32f \" printf ]\n [ \"- reached after %d iteration(s)\\n\\n\" printf ]\n } spread\n] each-index\n","language":"Factor"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/big\"\n)\n\nvar names = [10]string{\"Platinum\", \"Golden\", \"Silver\", \"Bronze\", \"Copper\",\n \"Nickel\", \"Aluminium\", \"Iron\", \"Tin\", \"Lead\"}\n\nfunc lucas(b int64) {\n fmt.Printf(\"Lucas sequence for %s ratio, where b = %d:\\n\", names[b], b)\n fmt.Print(\"First 15 elements: \")\n var x0, x1 int64 = 1, 1\n fmt.Printf(\"%d, %d\", x0, x1)\n for i := 1; i <= 13; i++ {\n x2 := b*x1 + x0\n fmt.Printf(\", %d\", x2)\n x0, x1 = x1, x2\n }\n fmt.Println()\n}\n\nfunc metallic(b int64, dp int) {\n x0, x1, x2, bb := big.NewInt(1), big.NewInt(1), big.NewInt(0), big.NewInt(b)\n ratio := big.NewRat(1, 1)\n iters := 0\n prev := ratio.FloatString(dp)\n for {\n iters++\n x2.Mul(bb, x1)\n x2.Add(x2, x0)\n this := ratio.SetFrac(x2, x1).FloatString(dp)\n if prev == this {\n plural := \"s\"\n if iters == 1 {\n plural = \" \"\n }\n fmt.Printf(\"Value to %d dp after %2d iteration%s: %s\\n\\n\", dp, iters, plural, this)\n return\n }\n prev = this\n x0.Set(x1)\n x1.Set(x2)\n }\n}\n\nfunc main() {\n for b := int64(0); b < 10; b++ {\n lucas(b)\n metallic(b, 32)\n }\n fmt.Println(\"Golden ratio, where b = 1:\")\n metallic(1, 256)\n}\n","language":"Go"},{"code":"class MetallicRatios {\n private static List<String> names = new ArrayList<>()\n static {\n names.add(\"Platinum\")\n names.add(\"Golden\")\n names.add(\"Silver\")\n names.add(\"Bronze\")\n names.add(\"Copper\")\n names.add(\"Nickel\")\n names.add(\"Aluminum\")\n names.add(\"Iron\")\n names.add(\"Tin\")\n names.add(\"Lead\")\n }\n\n private static void lucas(long b) {\n printf(\"Lucas sequence for %s ratio, where b = %d\\n\", names[b], b)\n print(\"First 15 elements: \")\n long x0 = 1\n long x1 = 1\n printf(\"%d, %d\", x0, x1)\n for (int i = 1; i < 13; ++i) {\n long x2 = b * x1 + x0\n printf(\", %d\", x2)\n x0 = x1\n x1 = x2\n }\n println()\n }\n\n private static void metallic(long b, int dp) {\n BigInteger x0 = BigInteger.ONE\n BigInteger x1 = BigInteger.ONE\n BigInteger x2\n BigInteger bb = BigInteger.valueOf(b)\n BigDecimal ratio = BigDecimal.ONE.setScale(dp)\n int iters = 0\n String prev = ratio.toString()\n while (true) {\n iters++\n x2 = bb * x1 + x0\n String thiz = (x2.toBigDecimal().setScale(dp) / x1.toBigDecimal().setScale(dp)).toString()\n if (prev == thiz) {\n String plural = \"s\"\n if (iters == 1) {\n plural = \"\"\n }\n printf(\"Value after %d iteration%s: %s\\n\\n\", iters, plural, thiz)\n return\n }\n prev = thiz\n x0 = x1\n x1 = x2\n }\n }\n\n static void main(String[] args) {\n for (int b = 0; b < 10; ++b) {\n lucas(b)\n metallic(b, 32)\n }\n println(\"Golden ratio, where b = 1:\")\n metallic(1, 256)\n }\n}\n","language":"Groovy"},{"code":" 258j256\":%~/+/+/ .*~^:10 x:*i.2 2\n1.6180339887498948482045868343656381177203091798057628621354486227052604628189024497072072041893911374847540880753868917521266338622235369317931800607667263544333890865959395829056383226613199282902678806752087668925017116962070322210432162695486262963136144\n","language":"J"},{"code":"task=:{{\n 32 task y\n:\n echo 'b=',\":y\n echo 'seq=',\":(,(1,y) X _2{.])^:15]1 1x\n k=. 0\n prev=.val=. ''\n rat=. 1 1x\n whilst.-.prev-:val do.\n k=. k+1\n prev=. val\n rat=. }.rat,rat X 1,y\n val=. (j./2 0+x)\":%~/rat\n end.\n echo (\":k),' iterations: ',val\n}}\n\n task 0\nb=0\nseq=1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n2 iterations: 1.00000000000000000000000000000000\n task 1\nb=1\nseq=1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597\n78 iterations: 1.61803398874989484820458683436564\n task 2\nb=2\nseq=1 1 3 7 17 41 99 239 577 1393 3363 8119 19601 47321 114243 275807 665857\n44 iterations: 2.41421356237309504880168872420970\n task 3\nb=3\nseq=1 1 4 13 43 142 469 1549 5116 16897 55807 184318 608761 2010601 6640564 21932293 72437443\n34 iterations: 3.30277563773199464655961063373525\n task 4\nb=4\nseq=1 1 5 21 89 377 1597 6765 28657 121393 514229 2178309 9227465 39088169 165580141 701408733 2971215073\n28 iterations: 4.23606797749978969640917366873128\n task 5\nb=5\nseq=1 1 6 31 161 836 4341 22541 117046 607771 3155901 16387276 85092281 441848681 2294335686 11913527111 61861971241\n25 iterations: 5.19258240356725201562535524577016\n task 6\nb=6\nseq=1 1 7 43 265 1633 10063 62011 382129 2354785 14510839 89419819 551029753 3395598337 20924619775 128943316987 794584521697\n23 iterations: 6.16227766016837933199889354443272\n task 7\nb=7\nseq=1 1 8 57 407 2906 20749 148149 1057792 7552693 53926643 385039194 2749201001 19629446201 140155324408 1000716717057 7145172343807\n22 iterations: 7.14005494464025913554865124576352\n task 8\nb=8\nseq=1 1 9 73 593 4817 39129 317849 2581921 20973217 170367657 1383914473 11241683441 91317382001 741780739449 6025563297593 48946287120193\n20 iterations: 8.12310562561766054982140985597408\n task 9\nb=9\nseq=1 1 10 91 829 7552 68797 626725 5709322 52010623 473804929 4316254984 39320099785 358197153049 3263094477226 29726047448083 270797521509973\n20 iterations: 9.10977222864644365500113714088140\n\n 256 task 1\nb=1\nseq=1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597\n615 iterations: 1.6180339887498948482045868343656381177203091798057628621354486227052604628189024497072072041893911374847540880753868917521266338622235369317931800607667263544333890865959395829056383226613199282902678806752087668925017116962070322210432162695486262963136144\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 class MetallicRatios {\n\n private static String[] ratioDescription = new String[] {\"Platinum\", \"Golden\", \"Silver\", \"Bronze\", \"Copper\", \"Nickel\", \"Aluminum\", \"Iron\", \"Tin\", \"Lead\"};\n\n public static void main(String[] args) {\n int elements = 15;\n for ( int b = 0 ; b < 10 ; b++ ) {\n System.out.printf(\"Lucas sequence for %s ratio, where b = %d:%n\", ratioDescription[b], b);\n System.out.printf(\"First %d elements: %s%n\", elements, lucasSequence(1, 1, b, elements));\n int decimalPlaces = 32;\n BigDecimal[] ratio = lucasSequenceRatio(1, 1, b, decimalPlaces+1);\n System.out.printf(\"Value to %d decimal places after %s iterations : %s%n\", decimalPlaces, ratio[1], ratio[0]);\n System.out.printf(\"%n\");\n }\n int b = 1;\n int decimalPlaces = 256;\n System.out.printf(\"%s ratio, where b = %d:%n\", ratioDescription[b], b);\n BigDecimal[] ratio = lucasSequenceRatio(1, 1, b, decimalPlaces+1);\n System.out.printf(\"Value to %d decimal places after %s iterations : %s%n\", decimalPlaces, ratio[1], ratio[0]);\n }\n\n private static BigDecimal[] lucasSequenceRatio(int x0, int x1, int b, int digits) {\n BigDecimal x0Bi = BigDecimal.valueOf(x0);\n BigDecimal x1Bi = BigDecimal.valueOf(x1);\n BigDecimal bBi = BigDecimal.valueOf(b);\n MathContext mc = new MathContext(digits);\n BigDecimal fractionPrior = x1Bi.divide(x0Bi, mc);\n int iterations = 0;\n while ( true ) {\n iterations++;\n BigDecimal x = bBi.multiply(x1Bi).add(x0Bi);\n BigDecimal fractionCurrent = x.divide(x1Bi, mc);\n if ( fractionCurrent.compareTo(fractionPrior) == 0 ) {\n break;\n }\n x0Bi = x1Bi;\n x1Bi = x;\n fractionPrior = fractionCurrent;\n }\n return new BigDecimal[] {fractionPrior, BigDecimal.valueOf(iterations)};\n }\n\n private static List<BigInteger> lucasSequence(int x0, int x1, int b, int n) {\n List<BigInteger> list = new ArrayList<>();\n BigInteger x0Bi = BigInteger.valueOf(x0);\n BigInteger x1Bi = BigInteger.valueOf(x1);\n BigInteger bBi = BigInteger.valueOf(b);\n if ( n > 0 ) {\n list.add(x0Bi);\n }\n if ( n > 1 ) {\n list.add(x1Bi);\n }\n while ( n > 2 ) {\n BigInteger x = bBi.multiply(x1Bi).add(x0Bi);\n list.add(x);\n n--;\n x0Bi = x1Bi;\n x1Bi = x;\n }\n return list;\n }\n\n}\n","language":"Java"},{"code":"include \"rational\" {search: \".\"}; the defs at [[Arithmetic/Rational#jq]]\n\ndef names:\n [\"Platinum\", \"Golden\", \"Silver\", \"Bronze\", \"Copper\",\"Nickel\", \"Aluminium\", \"Iron\", \"Tin\", \"Lead\"];\n\ndef lucas($b):\n [1,1] | recurse( [last, first + $b*last] ) | first;\n\ndef lucas($b; $n):\n \"Lucas sequence for \\(names[$b]) ratio, where b = \\($b):\",\n \"First \\(n) elements: \",\n [limit($n; lucas($b))];\n\n# dp = integer (degrees of precision)\ndef metallic(b; dp):\n { x0: 1,\n x1: 1,\n x2: 0,\n ratio: r(1; 1),\n iters: 0 }\n | .prev = (.ratio|r_to_decimal(dp)) # a string\n | until(.emit;\n .iters += 1\n | .x2 = .b * .x1 + .x0\n | .ratio = r(.x2; .x1)\n | .curr = (.ratio|r_to_decimal(dp)) # a string\n | if .prev == .curr\n then (if (.iters == 1) then \" \" else \"s\" end) as $plural\n | .emit = \"Value to \\(dp) dp after \\(.iters) iteration\\($plural): \\(.curr)\\n\"\n else .prev = .curr\n | .x0 = .x1\n | .x1 = .x2\n\tend )\n | .emit;\n\n(range( 0;10) | lucas(.; 15), metallic(.; 32)),\n\n\"Golden ratio, where b = 1:\", metallic(1; 256)\n","language":"Jq"},{"code":"using Formatting\nimport Base.iterate, Base.IteratorSize, Base.IteratorEltype, Base.Iterators.take\n\nconst metallicnames = [\"Platinum\", \"Golden\", \"Silver\", \"Bronze\", \"Copper\", \"Nickel\",\n \"Aluminium\", \"Iron\", \"Tin\", \"Lead\"]\n\nstruct Lucas b::Int end\nBase.IteratorSize(s::Lucas) = Base.IsInfinite()\nBase.IteratorEltype(s::Lucas) = BigInt\nBase.iterate(s::Lucas, (x1, x2) = (big\"1\", big\"1\")) = (t = x2 * s.b + x1; (x1, (x2, t)))\n\nprintlucas(b, len=15) = (for i in take(Lucas(b), len) print(i, \", \") end; println(\"...\"))\n\nfunction lucasratios(b, len)\n\titer = BigFloat.(collect(take(Lucas(b), len + 1)))\n\treturn map(i -> iter[i + 1] / iter[i], 1:length(iter)-1)\nend\t\t\n\nfunction metallic(b, dplaces=32)\n setprecision(dplaces * 5)\n ratios, err = lucasratios(b, dplaces * 50), BigFloat(10)^(-dplaces)\n errors = map(i -> abs(ratios[i + 1] - ratios[i]), 1:length(ratios)-1)\n iternum = findfirst(x -> x < err, errors)\n println(\"After $(iternum + 1) iterations, the value of \",\n\t\tformat(ratios[iternum + 1], precision=dplaces),\n\t\t\" is stable to $dplaces decimal places.\\n\")\nend\n\nfor (b, name) in enumerate(metallicnames)\n println(\"The first 15 elements of the Lucas sequence named \",\n metallicnames[b], \" and b of $(b - 1) are:\")\n printlucas(b - 1)\n metallic(b - 1)\nend\nprintln(\"Golden ratio to 256 decimal places:\")\nmetallic(1, 256)\n","language":"Julia"},{"code":"import java.math.BigDecimal\nimport java.math.BigInteger\n\nval names = listOf(\"Platinum\", \"Golden\", \"Silver\", \"Bronze\", \"Copper\", \"Nickel\", \"Aluminium\", \"Iron\", \"Tin\", \"Lead\")\n\nfun lucas(b: Long) {\n println(\"Lucas sequence for ${names[b.toInt()]} ratio, where b = $b:\")\n print(\"First 15 elements: \")\n var x0 = 1L\n var x1 = 1L\n print(\"$x0, $x1\")\n for (i in 1..13) {\n val x2 = b * x1 + x0\n print(\", $x2\")\n x0 = x1\n x1 = x2\n }\n println()\n}\n\nfun metallic(b: Long, dp:Int) {\n var x0 = BigInteger.ONE\n var x1 = BigInteger.ONE\n var x2: BigInteger\n val bb = BigInteger.valueOf(b)\n val ratio = BigDecimal.ONE.setScale(dp)\n var iters = 0\n var prev = ratio.toString()\n while (true) {\n iters++\n x2 = bb * x1 + x0\n val thiz = (x2.toBigDecimal(dp) / x1.toBigDecimal(dp)).toString()\n if (prev == thiz) {\n var plural = \"s\"\n if (iters == 1) {\n plural = \"\"\n }\n println(\"Value after $iters iteration$plural: $thiz\\n\")\n return\n }\n prev = thiz\n x0 = x1\n x1 = x2\n }\n}\n\nfun main() {\n for (b in 0L until 10L) {\n lucas(b)\n metallic(b, 32)\n }\n println(\"Golden ration, where b = 1:\")\n metallic(1, 256)\n}\n","language":"Kotlin"},{"code":"ClearAll[FindMetallicRatio]\nFindMetallicRatio[b_, digits_] :=\n Module[{n, m, data, acc, old, done = False},\n {n, m} = {1, 1};\n old = -100;\n data = {};\n While[done == False,\n {n, m} = {m, b m + n};\n AppendTo[data, {m, m/n}];\n If[Length[data] > 15,\n If[-N[Log10[Abs[data[[-1, 2]] - data[[-2, 2]]]]] > digits,\n done = True\n ]\n ]\n ];\n acc = -N[Log10[Abs[data[[-1, 2]] - data[[-2, 2]]]]];\n <|\"sequence\" -> Join[{1, 1}, data[[All, 1]]],\n \"ratio\" -> data[[All, 2]], \"acc\" -> acc,\n \"steps\" -> Length[data]|>\n ]\nDo[\n out = FindMetallicRatio[b, 32];\n Print[\"b=\", b];\n Print[\"b=\", b, \" first 15=\", Take[out[\"sequence\"], 15]];\n Print[\"b=\", b, \" ratio=\", N[Last[out[\"ratio\"]], {\\[Infinity], 33}]];\n Print[\"b=\", b, \" Number of steps=\", out[\"steps\"]];\n ,\n {b, 0, 9}\n ]\nout = FindMetallicRatio[1, 256];\nout[\"steps\"]\nN[out[\"ratio\"][[-1]], 256]\n","language":"Mathematica"},{"code":"import strformat\nimport bignum\n\ntype Metal {.pure.} = enum platinum, golden, silver, bronze, copper, nickel, aluminium, iron, tin, lead\n\niterator sequence(b: int): Int =\n ## Yield the successive terms if a “Lucas” sequence.\n ## The first two terms are ignored.\n var x, y = newInt(1)\n while true:\n x += b * y\n swap x, y\n yield y\n\n\ntemplate plural(n: int): string =\n if n >= 2: \"s\" else: \"\"\n\n\nproc computeRatio(b: Natural; digits: Positive) =\n ## Compute the ratio for the given \"n\" with the required number of digits.\n\n let M = 10^culong(digits)\n\n var niter = 0 # Number of iterations.\n var prevN = newInt(1) # Previous value of \"n\".\n var ratio = M # Current value of ratio.\n\n for n in sequence(b):\n inc niter\n let nextRatio = n * M div prevN\n if nextRatio == ratio: break\n prevN = n.clone\n ratio = nextRatio\n\n var str = $ratio\n str.insert(\".\", 1)\n echo &\"Value to {digits} decimal places after {niter} iteration{plural(niter)}: \", str\n\n\nwhen isMainModule:\n\n for b in 0..9:\n echo &\"“Lucas” sequence for {Metal(b)} ratio where b = {b}:\"\n stdout.write \"First 15 elements: 1 1\"\n var count = 2\n for n in sequence(b):\n stdout.write ' ', n\n inc count\n if count == 15: break\n echo \"\"\n computeRatio(b, 32)\n echo \"\"\n\n echo \"Golden ratio where b = 1:\"\n computeRatio(1, 256)\n","language":"Nim"},{"code":"use strict;\nuse warnings;\nuse feature qw(say state);\nuse Math::AnyNum qw<:overload as_dec>;\n\nsub gen_lucas {\n my $b = shift;\n my $i = 0;\n return sub {\n state @seq = (state $v1 = 1, state $v2 = 1);\n ($v2, $v1) = ($v1, $v2 + $b*$v1) and push(@seq, $v1) unless defined $seq[$i+1];\n return $seq[$i++];\n }\n}\n\nsub metallic {\n my $lucas = shift;\n my $places = shift || 32;\n my $n = my $last = 0;\n my @seq = $lucas->();\n while (1) {\n push @seq, $lucas->();\n my $this = as_dec( $seq[-1]/$seq[-2], $places+1 );\n last if $this eq $last;\n $last = $this;\n $n++;\n }\n $last, $n\n}\n\nmy @name = <Platinum Golden Silver Bronze Copper Nickel Aluminum Iron Tin Lead>;\n\nfor my $b (0..$#name) {\n my $lucas = gen_lucas($b);\n printf \"\\n'Lucas' sequence for $name[$b] ratio, where b = $b:\\nFirst 15 elements: \" . join ', ', map { $lucas->() } 1..15;\n printf \"Approximated value %s reached after %d iterations\\n\", metallic(gen_lucas($b));\n}\n\nprintf \"\\nGolden ratio to 256 decimal places %s reached after %d iterations\", metallic(gen_lucas(1),256);\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: #004080;\">mpfr</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">names</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"Platinum\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Golden\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Silver\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Bronze\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Copper\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"Nickel\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Aluminium\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Iron\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Tin\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Lead\"</span><span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">lucas</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">b</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;\">\"Lucas sequence for %s ratio, where b = %d:\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">names</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;\">b</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">x0</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x2</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 elements: %d, %d\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">x0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x1</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;\">13</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">x2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">x1</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">x0</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\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">x0</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">x1</span>\n <span style=\"color: #000000;\">x1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">x2</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;\">\"\\n\"</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;\">procedure</span> <span style=\"color: #000000;\">metallic</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">dp</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">x0</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> <span style=\"color: #000000;\">bb</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;\">4</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;\">b</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #004080;\">mpfr</span> <span style=\"color: #000000;\">ratio</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpfr_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-(</span><span style=\"color: #000000;\">dp</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">iterations</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">prev</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpfr_get_fixed</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ratio</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dp</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;\">iterations</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #7060A8;\">mpz_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">bb</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">x2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">x0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_set_z</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ratio</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">x2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_div_z</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ratio</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ratio</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">curr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpfr_get_fixed</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ratio</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dp</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;\">curr</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">plural</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">iterations</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;\">\"s\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">curr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shorten</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curr</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;\">\"Value to %d dp after %2d iteration%s: %s\\n\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">dp</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">iterations</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">plural</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">curr</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;\">prev</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">curr</span>\n <span style=\"color: #7060A8;\">mpz_set</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_set</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: #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: #008080;\">for</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">9</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">lucas</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">metallic</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">32</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;\">\"Golden ratio, where b = 1:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">metallic</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">256</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":"from itertools import count, islice\nfrom _pydecimal import getcontext, Decimal\n\ndef metallic_ratio(b):\n m, n = 1, 1\n while True:\n yield m, n\n m, n = m*b + n, m\n\ndef stable(b, prec):\n def to_decimal(b):\n for m,n in metallic_ratio(b):\n yield Decimal(m)/Decimal(n)\n\n getcontext().prec = prec\n last = 0\n for i,x in zip(count(), to_decimal(b)):\n if x == last:\n print(f'after {i} iterations:\\n\\t{x}')\n break\n last = x\n\nfor b in range(4):\n coefs = [n for _,n in islice(metallic_ratio(b), 15)]\n print(f'\\nb = {b}: {coefs}')\n stable(b, 32)\n\nprint(f'\\nb = 1 with 256 digits:')\nstable(1, 256)\n","language":"Python"},{"code":" [ $ \"bigrat.qky\" loadfile ] now!\n\n [ [ table\n $ \"Platinum\" $ \"Golden\"\n $ \"Silver\" $ \"Bronze\"\n $ \"Copper\" $ \"Nickel\"\n $ \"Aluminium\" $ \"Iron\"\n $ \"Tin\" $ \"Lead\" ]\n do echo$ ] is echoname ( n --> )\n\n [ temp put\n ' [ 1 1 ]\n 13 times\n [ dup -1 peek\n temp share *\n over -2 peek +\n join ]\n temp release ] is task1 ( n --> [ )\n\n [ temp put\n ' [ 0 1 1 ]\n [ dup -3 split nip\n do dip tuck swap\n 32 approx= if done\n dup -1 peek\n temp share *\n over -2 peek +\n join\n again ]\n temp release\n dup size 3 - swap\n -3 split nip\n -1 split drop\n do swap rot ] is task2 ( n --> n/d n )\n\n 10 times\n [ i^ echoname cr\n i^ task1\n witheach [ echo sp ] cr\n i^ task2\n echo sp\n 32 point$ echo$\n cr cr ]\n","language":"Quackery"},{"code":"use Rat::Precise;\nuse Lingua::EN::Numbers;\n\nsub lucas ($b) { 1, 1, * + $b * * … * }\n\nsub metallic ($seq, $places = 32) {\n my $n = 0;\n my $last = 0;\n loop {\n my $approx = FatRat.new($seq[$n + 1], $seq[$n]);\n my $this = $approx.precise($places, :z);\n last if $this eq $last;\n $last = $this;\n $n++;\n }\n $last, $n\n}\n\nsub display ($value, $n) {\n \"Approximated value:\", $value, \"Reached after {$n} iterations: \" ~\n \"{ordinal-digit $n}/{ordinal-digit $n - 1} element.\"\n}\n\nfor <Platinum Golden Silver Bronze Copper Nickel Aluminum Iron Tin Lead>.kv\n -> \\b, $name {\n my $lucas = lucas b;\n print \"\\nLucas sequence for $name ratio; where b = {b}:\\nFirst 15 elements: \";\n say join ', ', $lucas[^15];\n say join ' ', display |metallic($lucas);\n}\n\n# Stretch goal\nsay join \"\\n\", \"\\nGolden ratio to 256 decimal places:\", display |metallic lucas(1), 256;\n","language":"Raku"},{"code":"/*REXX pgm computes the 1st N elements of the Lucas sequence for Metallic ratios 0──►9. */\nparse arg n bLO bHI digs . /*obtain optional arguments from the CL*/\nif n=='' | n==\",\" then n= 15 /*Not specified? Then use the default.*/\nif bLO=='' | bLO==\",\" then bLO= 0 /* \" \" \" \" \" \" */\nif bHI=='' | bHI==\",\" then bHI= 9 /* \" \" \" \" \" \" */\nif digs=='' | digs==\",\" then digs= 32 /* \" \" \" \" \" \" */\nnumeric digits digs + length(.) /*specify number of decimal digs to use*/\nmetals= 'platinum golden silver bronze copper nickel aluminum iron tin lead'\n@decDigs= ' decimal digits past the decimal point:' /*a literal used in SAY.*/\n!.= /*the default name for a metallic ratio*/\n do k=0 to 9; !.k= word(metals, k+1) /*assign the (ten) metallic ratio names*/\n end /*k*/\n\n do m=bLO to bHI; @.= 1; $= 1 1 /*compute the sequence numbers & ratios*/\n r=. /*the ratio (so far). */\n do #=2 until r=old; old= r /*compute sequence numbers & the ratio.*/\n #_1= #-1; #_2= #-2 /*use variables for previous numbers. */\n @.#= m * @.#_1 + @.#_2 /*calculate a number i the sequence. */\n if #<n then $= $ @.# /*build a sequence list of N numbers.*/\n r= @.# / @.#_1 /*calculate ratio of the last 2 numbers*/\n end /*#*/\n\n if words($)<n then $= subword($ copies('1 ', n), 1, n) /*extend list if too short*/\n L= max(108, length($) ) /*ensure width of title. */\n say center(' Lucas sequence for the' !.m \"ratio, where B is \" m' ', L, \"═\")\n if n>0 then do; say 'the first ' n \" elements are:\"; say $\n end /*if N is positive, then show N nums.*/\n @approx= 'approximate' /*literal (1 word) that is used for SAY*/\n r= format(r,,digs) /*limit decimal digits for R to digs.*/\n if datatype(r, 'W') then do; r= r/1; @approx= \"exact\"; end\n say 'the' @approx \"value reached after\" #-1 \" iterations with \" digs @DecDigs\n say r; say /*display the ration plus a blank line.*/\n end /*m*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"require('bigdecimal')\nrequire('bigdecimal/util')\n\n# An iterator over the Lucas Sequence for 'b'.\n# (The special case of: x(n) = b * x(n-1) + x(n-2).)\n\ndef lucas(b)\n Enumerator.new do |yielder|\n xn2 = 1 ; yielder.yield(xn2)\n xn1 = 1 ; yielder.yield(xn1)\n loop { xn2, xn1 = xn1, b * xn1 + xn2 ; yielder.yield(xn1) }\n end\nend\n\n# Compute the Metallic Ratio to 'precision' from the Lucas Sequence for 'b'.\n# (Uses the lucas(b) iterator, above.)\n# The metallic ratio is approximated by x(n) / x(n-1).\n# Returns a struct of the approximate metallic ratio (.ratio) and the\n# number of terms required to achieve the given precision (.terms).\n\ndef metallic_ratio(b, precision)\n xn2 = xn1 = prev = this = 0\n lucas(b).each.with_index do |xn, inx|\n case inx\n when 0\n xn2 = BigDecimal(xn)\n when 1\n xn1 = BigDecimal(xn)\n prev = xn1.div(xn2, 2 * precision).round(precision)\n else\n xn2, xn1 = xn1, BigDecimal(xn)\n this = xn1.div(xn2, 2 * precision).round(precision)\n return Struct.new(:ratio, :terms).new(prev, inx - 1) if prev == this\n prev = this\n end\n end\nend\n\nNAMES = [ 'Platinum', 'Golden', 'Silver', 'Bronze', 'Copper',\n 'Nickel', 'Aluminum', 'Iron', 'Tin', 'Lead' ]\n\nputs\nputs('Lucas Sequences...')\nputs('%1s %s' % ['b', 'sequence'])\n(0..9).each do |b|\n puts('%1d %s' % [b, lucas(b).first(15)])\nend\n\nputs\nputs('Metallic Ratios to 32 places...')\nputs('%-9s %1s %3s %s' % ['name', 'b', 'n', 'ratio'])\n(0..9).each do |b|\n rn = metallic_ratio(b, 32)\n puts('%-9s %1d %3d %s' % [NAMES[b], b, rn.terms, rn.ratio.to_s('F')])\nend\n\nputs\nputs('Golden Ratio to 256 places...')\nputs('%-9s %1s %3s %s' % ['name', 'b', 'n', 'ratio'])\ngold_rn = metallic_ratio(1, 256)\nputs('%-9s %1d %3d %s' % [NAMES[1], 1, gold_rn.terms, gold_rn.ratio.to_s('F')])\n","language":"Ruby"},{"code":"func seqRatio(f, places = 32) {\n 1..Inf -> reduce {|t,n|\n var r = (f(n+1)/f(n)).round(-places)\n return(n, r.as_dec(places + r.abs.int.len)) if (r == t)\n r\n }\n}\n\nfor k,v in (%w(Platinum Golden Silver Bronze Copper Nickel Aluminum Iron Tin Lead).kv) {\n next if (k == 0) # undefined ratio\n say \"Lucas sequence U_n(#{k},-1) for #{v} ratio\"\n var f = {|n| lucasu(k, -1, n) }\n say (\"First 15 elements: \", 15.of(f).join(', '))\n var (n, r) = seqRatio(f)\n say \"Approximated value: #{r} reached after #{n} iterations\"\n say ''\n}\n\nwith (seqRatio({|n| fib(n) }, 256)) {|n,v|\n say \"Golden ratio to 256 decimal places:\"\n say \"Approximated value: #{v}\"\n say \"Reached after #{n} iterations\"\n}\n","language":"Sidef"},{"code":"Imports BI = System.Numerics.BigInteger\n\nModule Module1\n\n Function IntSqRoot(v As BI, res As BI) As BI\n REM res is the initial guess\n Dim term As BI = 0\n Dim d As BI = 0\n Dim dl As BI = 1\n While dl <> d\n term = v / res\n res = (res + term) >> 1\n dl = d\n d = term - res\n End While\n Return term\n End Function\n\n Function DoOne(b As Integer, digs As Integer) As String\n REM calculates result via square root, not iterations\n Dim s = b * b + 4\n digs += 1\n Dim g As BI = Math.Sqrt(s * Math.Pow(10, digs))\n Dim bs = IntSqRoot(s * BI.Parse(\"1\" + New String(\"0\", digs << 1)), g)\n bs += b * BI.Parse(\"1\" + New String(\"0\", digs))\n bs >>= 1\n bs += 4\n Dim st = bs.ToString\n digs -= 1\n Return String.Format(\"{0}.{1}\", st(0), st.Substring(1, digs))\n End Function\n\n Function DivIt(a As BI, b As BI, digs As Integer) As String\n REM performs division\n Dim al = a.ToString.Length\n Dim bl = b.ToString.Length\n digs += 1\n a *= BI.Pow(10, digs << 1)\n b *= BI.Pow(10, digs)\n Dim s = (a / b + 5).ToString\n digs -= 1\n Return s(0) + \".\" + s.Substring(1, digs)\n End Function\n\n REM custom formatting\n Function Joined(x() As BI) As String\n Dim wids() = {1, 1, 2, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13}\n Dim res = \"\"\n For i = 0 To x.Length - 1\n res += String.Format(\"{0,\" + (-wids(i)).ToString + \"} \", x(i))\n Next\n Return res\n End Function\n\n Sub Main()\n REM calculates and checks each \"metal\"\n Console.WriteLine(\"Metal B Sq.Rt Iters /---- 32 decimal place value ----\\\\ Matches Sq.Rt Calc\")\n Dim t = \"\"\n Dim n As BI\n Dim nm1 As BI\n Dim k As Integer\n Dim j As Integer\n For b = 0 To 9\n Dim lst(14) As BI\n lst(0) = 1\n lst(1) = 1\n For i = 2 To 14\n lst(i) = b * lst(i - 1) + lst(i - 2)\n Next\n REM since all the iterations (except Pt) are > 15, continue iterating from the end of the list of 15\n n = lst(14)\n nm1 = lst(13)\n k = 0\n j = 13\n While k = 0\n Dim lt = t\n t = DivIt(n, nm1, 32)\n If lt = t Then\n k = If(b = 0, 1, j)\n End If\n Dim onn = n\n n = b * n + nm1\n nm1 = onn\n\n j += 1\n End While\n Console.WriteLine(\"{0,4} {1} {2,2} {3, 2} {4} {5}\" + vbNewLine + \"{6,19} {7}\", \"Pt Au Ag CuSn Cu Ni Al Fe Sn Pb\".Split(\" \")(b), b, b * b + 4, k, t, t = DoOne(b, 32), \"\", Joined(lst))\n Next\n REM now calculate and check big one\n n = 1\n nm1 = 1\n k = 0\n j = 1\n While k = 0\n Dim lt = t\n t = DivIt(n, nm1, 256)\n If lt = t Then\n k = j\n End If\n Dim onn = n\n n += nm1\n nm1 = onn\n\n j += 1\n End While\n Console.WriteLine()\n Console.WriteLine(\"Au to 256 digits:\")\n Console.WriteLine(t)\n Console.WriteLine(\"Iteration count: {0} Matched Sq.Rt Calc: {1}\", k, t = DoOne(1, 256))\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"./big\" for BigInt, BigRat\nimport \"./fmt\" for Fmt\n\nvar names = [\"Platinum\", \"Golden\", \"Silver\", \"Bronze\", \"Copper\",\"Nickel\", \"Aluminium\", \"Iron\", \"Tin\", \"Lead\"]\n\nvar lucas = Fn.new { |b|\n Fmt.print(\"Lucas sequence for $s ratio, where b = $d:\", names[b], b)\n System.write(\"First 15 elements: \")\n var x0 = 1\n var x1 = 1\n Fmt.write(\"$d, $d\", x0, x1)\n for (i in 1..13) {\n var x2 = b*x1 + x0\n Fmt.write(\", $d\", x2)\n x0 = x1\n x1 = x2\n }\n System.print()\n}\n\nvar metallic = Fn.new { |b, dp|\n var x0 = BigInt.one\n var x1 = BigInt.one\n var x2 = BigInt.zero\n var bb = BigInt.new(b)\n var ratio = BigRat.new(BigInt.one, BigInt.one)\n var iters = 0\n var prev = ratio.toDecimal(dp)\n while (true) {\n iters = iters + 1\n x2 = bb*x1 + x0\n ratio = BigRat.new(x2, x1)\n var curr = ratio.toDecimal(dp)\n if (prev == curr) {\n var plural = (iters == 1) ? \" \" : \"s\"\n Fmt.print(\"Value to $d dp after $2d iteration$s: $s\\n\", dp, iters, plural, curr)\n return\n }\n prev = curr\n x0 = x1\n x1 = x2\n }\n}\n\nfor (b in 0..9) {\n lucas.call(b)\n metallic.call(b, 32)\n}\nSystem.print(\"Golden ratio, where b = 1:\")\nmetallic.call(1, 256)\n","language":"Wren"},{"code":"var [const] BI=Import(\"zklBigNum\"); // libGMP\nfcn lucasSeq(b){\n Walker.zero().tweak('wrap(xs){\n xm2,xm1 := xs;\t// x[n-2], x[n-1]\n xn:=xm1*b + xm2;\n xs.append(xn).del(0);\n xn\n }.fp(L(BI(1),BI(1)))).push(1,1) // xn can get big so use BigInts\n}\nfcn metallicRatio(lucasSeq,digits=32,roundup=True){ #-->(String,num iterations)\n bige:=BI(\"1e\"+(digits+1)); # x[n-1]*bige*b / x[n-2] to get our digits from Ints\n a,b,mr := lucasSeq.next(), lucasSeq.next(), (bige*b).div(a);\n do(20_000){\t// limit iterations\n c,mr2 := lucasSeq.next(), (bige*c).div(b);\n if(mr==mr2){\n\t mr=mr2.add(5*roundup).div(10).toString();\n\t return(String(mr[0],\".\",mr.del(0)),\n\t lucasSeq.idx); // idx ignores push(), ie first 2 terms\n }\n b,mr = c,mr2;\n }\n}\n","language":"Zkl"},{"code":"metals:=\"Platinum Golden Silver Bronze Copper Nickel Aluminum Iron Tin Lead\";\nforeach metal in (metals.split(\" \")){ n:=__metalWalker.idx;\n println(\"\\nLucas sequence for %s ratio; where b = %d:\".fmt(metal,n));\n println(\"First 15 elements: \",lucasSeq(n).walk(15).concat(\" \"));\n mr,i := metallicRatio(lucasSeq(n));\n println(\"Approximated value: %s - Reached after ~%d iterations.\".fmt(mr,i));\n}\n","language":"Zkl"},{"code":"println(\"Golden ratio (B==1) to 256 digits:\");\nmr,i := metallicRatio(lucasSeq(1),256);\nprintln(\"Approximated value: %s\\nReached after ~%d iterations.\".fmt(mr,i));\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Metallic_ratios\\n\",\n \"language\": \"00-META\"\n },\n {\n \"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''' was discovered and named by ancient civilizations as it was\\nthought to be the most pure and beautiful (like Gold). The '''Silver ratio''' was was\\nalso known to the early Greeks, though was not named so until later as a nod to\\nthe '''Golden ratio''' to which it is closely related. The series has been extended to\\nencompass all of the related ratios and was given the general name '''Metallic ratios''' (or ''Metallic means'').\\n''Somewhat incongruously as the original Golden ratio referred to the adjective \\\"golden\\\" rather than the metal \\\"gold\\\".''\\n\\n'''Metallic ratios''' are the real roots of the general form equation:\\n\\n <big> x<sup>2</sup> - bx - 1 = 0 </big>\\n\\nwhere the integer '''b''' determines which specific one it is.\\n\\nUsing the quadratic equation:\\n\\n <big> ( -b ± √(b<sup>2</sup> - 4ac) ) / 2a = x </big>\\n\\nSubstitute in (from the top equation) '''1''' for '''a''', '''-1''' for '''c''', and recognising that -b is negated we get:\\n\\n <big> ( b ± √(b<sup>2</sup> + 4) ) ) / 2 = x </big>\\n\\nWe only want the real root:\\n\\n <big> ( b + √(b<sup>2</sup> + 4) ) ) / 2 = x </big>\\n\\nWhen we set '''b''' to '''1''', we get an irrational number: the '''Golden ratio'''.\\n\\n <big> ( 1 + √(1<sup>2</sup> + 4) ) / 2 = (1 + √5) / 2 = ~1.618033989... </big>\\n\\nWith '''b''' set to '''2''', we get a different irrational number: the '''Silver ratio'''.\\n\\n <big> ( 2 + √(2<sup>2</sup> + 4) ) / 2 = (2 + √8) / 2 = ~2.414213562... </big>\\n\\nWhen the ratio '''b''' is '''3''', it is commonly referred to as the '''Bronze''' ratio, '''4''' and '''5'''\\nare sometimes called the '''Copper''' and '''Nickel''' ratios, though they aren't as\\nstandard. After that there isn't really any attempt at standardized names. They\\nare given names here on this page, but consider the names fanciful rather than\\ncanonical.\\n\\nNote that technically, '''b''' can be '''0''' for a \\\"smaller\\\" ratio than the '''Golden ratio'''.\\nWe will refer to it here as the '''Platinum ratio''', though it is kind-of a\\ndegenerate case.\\n\\n'''Metallic ratios''' where '''b''' > '''0''' are also defined by the irrational continued fractions:\\n\\n <big> [b;b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b...] </big>\\n\\n\\nSo, The first ten '''Metallic ratios''' are:\\n\\n:::::: {| class=\\\"wikitable\\\" style=\\\"text-align: center;\\\"\\n|+ Metallic ratios\\n!Name!!'''b'''!!Equation!!Value!!Continued fraction!!OEIS link\\n|-\\n|Platinum||0||(0 + √4) / 2|| 1||-||-\\n|-\\n|Golden||1||(1 + √5) / 2|| 1.618033988749895...||[1;1,1,1,1,1,1,1,1,1,1...]||[[OEIS:A001622]]\\n|-\\n|Silver||2||(2 + √8) / 2|| 2.414213562373095...||[2;2,2,2,2,2,2,2,2,2,2...]||[[OEIS:A014176]]\\n|-\\n|Bronze||3||(3 + √13) / 2|| 3.302775637731995...||[3;3,3,3,3,3,3,3,3,3,3...]||[[OEIS:A098316]]\\n|-\\n|Copper||4||(4 + √20) / 2|| 4.23606797749979...||[4;4,4,4,4,4,4,4,4,4,4...]||[[OEIS:A098317]]\\n|-\\n|Nickel||5||(5 + √29) / 2|| 5.192582403567252...||[5;5,5,5,5,5,5,5,5,5,5...]||[[OEIS:A098318]]\\n|-\\n|Aluminum||6||(6 + √40) / 2|| 6.16227766016838...||[6;6,6,6,6,6,6,6,6,6,6...]||[[OEIS:A176398]]\\n|-\\n|Iron||7||(7 + √53) / 2|| 7.140054944640259...||[7;7,7,7,7,7,7,7,7,7,7...]||[[OEIS:A176439]]\\n|-\\n|Tin||8||(8 + √68) / 2|| 8.123105625617661...||[8;8,8,8,8,8,8,8,8,8,8...]||[[OEIS:A176458]]\\n|-\\n|Lead||9||(9 + √85) / 2|| 9.109772228646444...||[9;9,9,9,9,9,9,9,9,9,9...]||[[OEIS:A176522]]\\n|}\\n\\n<hr>\\n\\n\\nThere are other ways to find the '''Metallic ratios'''; one, (the focus of this task)\\nis through '''successive approximations of Lucas sequences'''.\\n\\nA traditional '''Lucas sequence''' is of the form:\\n\\n <big>x<sub>''n''</sub> = P * x<sub>''n-1''</sub> - Q * x<sub>''n-2''</sub></big>\\n\\nand starts with the first 2 values '''0, 1'''. \\n\\nFor our purposes in this task, to find the metallic ratios we'll use the form:\\n\\n <big>x<sub>''n''</sub> = b * x<sub>''n-1''</sub> + x<sub>''n-2''</sub></big>\\n\\n( '''P''' is set to '''b''' and '''Q''' is set to '''-1'''. ) To avoid \\\"divide by zero\\\" issues we'll start the sequence with the first two terms '''1, 1'''. The initial starting value has very little effect on the final ratio or convergence rate. ''Perhaps it would be more accurate to call it a Lucas-like sequence.'' \\n\\nAt any rate, when '''b = 1''' we get:\\n\\n <big>x<sub>''n''</sub> = x<sub>''n-1''</sub> + x<sub>''n-2''</sub></big>\\n\\n 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144...\\n\\nmore commonly known as the Fibonacci sequence.\\n\\nWhen '''b = 2''':\\n\\n <big>x<sub>''n''</sub> = 2 * x<sub>''n-1''</sub> + x<sub>''n-2''</sub></big>\\n\\n 1, 1, 3, 7, 17, 41, 99, 239, 577, 1393...\\n\\n\\nAnd so on.\\n\\n\\nTo find the ratio by successive approximations, divide the ('''n+1''')th term by the\\n'''n'''th. As '''n''' grows larger, the ratio will approach the '''b''' metallic ratio.\\n\\nFor '''b = 1''' (Fibonacci sequence):\\n\\n 1/1 = 1\\n 2/1 = 2\\n 3/2 = 1.5\\n 5/3 = 1.666667\\n 8/5 = 1.6\\n 13/8 = 1.625\\n 21/13 = 1.615385\\n 34/21 = 1.619048\\n 55/34 = 1.617647\\n 89/55 = 1.618182\\n etc.\\n\\nIt converges, but pretty slowly. In fact, the '''Golden ratio''' has the slowest\\npossible convergence for any irrational number.\\n\\n\\n;Task\\n\\nFor each of the first '''10 Metallic ratios'''; '''b''' = '''0''' through '''9''':\\n\\n* Generate the corresponding \\\"Lucas\\\" sequence.\\n* Show here, on this page, at least the first '''15''' elements of the \\\"Lucas\\\" sequence.\\n* Using successive approximations, calculate the value of the ratio accurate to '''32''' decimal places.\\n* Show the '''value''' of the '''approximation''' at the required accuracy.\\n* Show the '''value''' of '''n''' when the approximation reaches the required accuracy (How many iterations did it take?).\\n\\nOptional, stretch goal - Show the '''value''' and number of iterations '''n''', to approximate the '''Golden ratio''' to '''256''' decimal places.\\n\\nYou may assume that the approximation has been reached when the next iteration does not cause the value (to the desired places) to change.\\n\\n;See also\\n* [[wp:Metallic_mean|Wikipedia: Metallic mean]]\\n* [[wp:Lucas_sequence|Wikipedia: Lucas sequence]]\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"#include <boost/multiprecision/cpp_dec_float.hpp>\\n#include <iostream>\\n\\nconst char* names[] = { \\\"Platinum\\\", \\\"Golden\\\", \\\"Silver\\\", \\\"Bronze\\\", \\\"Copper\\\", \\\"Nickel\\\", \\\"Aluminium\\\", \\\"Iron\\\", \\\"Tin\\\", \\\"Lead\\\" };\\n\\ntemplate<const uint N>\\nvoid lucas(ulong b) {\\n std::cout << \\\"Lucas sequence for \\\" << names[b] << \\\" ratio, where b = \\\" << b << \\\":\\\\nFirst \\\" << N << \\\" elements: \\\";\\n auto x0 = 1L, x1 = 1L;\\n std::cout << x0 << \\\", \\\" << x1;\\n for (auto i = 1u; i <= N - 1 - 1; i++) {\\n auto x2 = b * x1 + x0;\\n std::cout << \\\", \\\" << x2;\\n x0 = x1;\\n x1 = x2;\\n }\\n std::cout << std::endl;\\n}\\n\\ntemplate<const ushort P>\\nvoid metallic(ulong b) {\\n using namespace boost::multiprecision;\\n using bfloat = number<cpp_dec_float<P+1>>;\\n bfloat x0(1), x1(1);\\n auto prev = bfloat(1).str(P+1);\\n for (auto i = 0u;;) {\\n i++;\\n bfloat x2(b * x1 + x0);\\n auto thiz = bfloat(x2 / x1).str(P+1);\\n if (prev == thiz) {\\n std::cout << \\\"Value after \\\" << i << \\\" iteration\\\" << (i == 1 ? \\\": \\\" : \\\"s: \\\") << thiz << std::endl << std::endl;\\n break;\\n }\\n prev = thiz;\\n x0 = x1;\\n x1 = x2;\\n }\\n}\\n\\nint main() {\\n for (auto b = 0L; b < 10L; b++) {\\n lucas<15>(b);\\n metallic<32>(b);\\n }\\n std::cout << \\\"Golden ratio, where b = 1:\\\" << std::endl;\\n metallic<256>(1);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using static System.Math;\\nusing static System.Console;\\nusing BI = System.Numerics.BigInteger;\\n\\nclass Program {\\n\\n static BI IntSqRoot(BI v, BI res) { // res is the initial guess\\n BI term = 0, d = 0, dl = 1; while (dl != d) { term = v / res; res = (res + term) >> 1;\\n dl = d; d = term - res; } return term; }\\n\\n static string doOne(int b, int digs) { // calculates result via square root, not iterations\\n int s = b * b + 4; BI g = (BI)(Sqrt((double)s) * Pow(10, ++digs)),\\n bs = IntSqRoot(s * BI.Parse('1' + new string('0', digs << 1)), g);\\n bs += b * BI.Parse('1' + new string('0', digs));\\n bs >>= 1; bs += 4; string st = bs.ToString();\\n return string.Format(\\\"{0}.{1}\\\", st[0], st.Substring(1, --digs)); }\\n\\n static string divIt(BI a, BI b, int digs) { // performs division\\n int al = a.ToString().Length, bl = b.ToString().Length;\\n a *= BI.Pow(10, ++digs << 1); b *= BI.Pow(10, digs);\\n string s = (a / b + 5).ToString(); return s[0] + \\\".\\\" + s.Substring(1, --digs); }\\n\\n // custom formating\\n static string joined(BI[] x) { int[] wids = {1, 1, 2, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13};\\n string res = \\\"\\\"; for (int i = 0; i < x.Length; i++) res +=\\n string.Format(\\\"{0,\\\" + (-wids[i]).ToString() + \\\"} \\\", x[i]); return res; }\\n\\n static void Main(string[] args) { // calculates and checks each \\\"metal\\\"\\n WriteLine(\\\"Metal B Sq.Rt Iters /---- 32 decimal place value ----\\\\\\\\ Matches Sq.Rt Calc\\\");\\n int k; string lt, t = \\\"\\\"; BI n, nm1, on; for (int b = 0; b < 10; b++) {\\n BI[] lst = new BI[15]; lst[0] = lst[1] = 1;\\n for (int i = 2; i < 15; i++) lst[i] = b * lst[i - 1] + lst[i - 2];\\n // since all the iterations (except Pt) are > 15, continue iterating from the end of the list of 15\\n n = lst[14]; nm1 = lst[13]; k = 0; for (int j = 13; k == 0; j++) {\\n lt = t; if (lt == (t = divIt(n, nm1, 32))) k = b == 0 ? 1 : j;\\n on = n; n = b * n + nm1; nm1 = on; }\\n WriteLine(\\\"{0,4} {1} {2,2} {3, 2} {4} {5}\\\\n{6,19} {7}\\\", \\\"Pt Au Ag CuSn Cu Ni Al Fe Sn Pb\\\"\\n .Split(' ')[b], b, b * b + 4, k, t, t == doOne(b, 32), \\\"\\\", joined(lst)); }\\n // now calculate and check big one\\n n = nm1 =1; k = 0; for (int j = 1; k == 0; j++) {\\n lt = t; if (lt == (t = divIt(n, nm1, 256))) k = j;\\n on = n; n += nm1; nm1 = on; }\\n WriteLine(\\\"\\\\nAu to 256 digits:\\\"); WriteLine(t);\\n WriteLine(\\\"Iteration count: {0} Matched Sq.Rt Calc: {1}\\\", k, t == doOne(1, 256)); }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"// Metallic Ration. Nigel Galloway: September 16th., 2020\\nlet rec fN i g (e,l)=match i with 0->g |_->fN (i-1) (int(l/e)::g) (e,(l%e)*10I)\\nlet fI(P:int)=Seq.unfold(fun(n,g)->Some(g,((bigint P)*n+g,n)))(1I,1I)\\nlet fG fI fN=let _,(n,g)=fI|>Seq.pairwise|>Seq.mapi(fun n g->(n,fN g))|>Seq.pairwise|>Seq.find(fun((_,n),(_,g))->n=g) in (n,List.rev g)\\nlet mR n g=printf \\\"First 15 elements when P = %d -> \\\" n; fI n|>Seq.take 15|>Seq.iter(printf \\\"%A \\\"); printf \\\"\\\\n%d decimal places \\\" g\\n let Σ,n=fG(fI n)(fN (g+1) []) in printf \\\"required %d iterations -> %d.\\\" Σ n.Head; List.iter(printf \\\"%d\\\")n.Tail ;printfn \\\"\\\"\\n[0..9]|>Seq.iter(fun n->mR n 32; printfn \\\"\\\"); mR 1 256\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: combinators decimals formatting generalizations io kernel\\nmath prettyprint qw sequences ;\\nIN: rosetta-code.metallic-ratios\\n\\n: lucas ( n a b -- n a' b' ) tuck reach * + ;\\n\\n: lucas. ( n -- )\\n 1 pprint bl 1 1 14 [ lucas over pprint bl ] times 3drop nl ;\\n\\n: approx ( a b -- d ) swap [ 0 <decimal> ] bi@ 32 D/ ;\\n\\n: approximate ( n -- value iter )\\n -1 swap 1 1 0 1 [ 2dup = ]\\n [ [ 1 + ] 5 ndip [ lucas 2dup approx ] 2dip drop ] until\\n 4nip decimal>ratio swap ;\\n\\nqw{\\n Platinum Golden Silver Bronze Copper Nickel Aluminum Iron\\n Tin Lead\\n}\\n[\\n dup dup approximate {\\n [ \\\"Lucas sequence for %s ratio \\\" printf ]\\n [ \\\"where b = %d:\\\\n\\\" printf ]\\n [ \\\"First 15 elements: \\\" write lucas. ]\\n [ \\\"Approximated value: %.32f \\\" printf ]\\n [ \\\"- reached after %d iteration(s)\\\\n\\\\n\\\" printf ]\\n } spread\\n] each-index\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/big\\\"\\n)\\n\\nvar names = [10]string{\\\"Platinum\\\", \\\"Golden\\\", \\\"Silver\\\", \\\"Bronze\\\", \\\"Copper\\\",\\n \\\"Nickel\\\", \\\"Aluminium\\\", \\\"Iron\\\", \\\"Tin\\\", \\\"Lead\\\"}\\n\\nfunc lucas(b int64) {\\n fmt.Printf(\\\"Lucas sequence for %s ratio, where b = %d:\\\\n\\\", names[b], b)\\n fmt.Print(\\\"First 15 elements: \\\")\\n var x0, x1 int64 = 1, 1\\n fmt.Printf(\\\"%d, %d\\\", x0, x1)\\n for i := 1; i <= 13; i++ {\\n x2 := b*x1 + x0\\n fmt.Printf(\\\", %d\\\", x2)\\n x0, x1 = x1, x2\\n }\\n fmt.Println()\\n}\\n\\nfunc metallic(b int64, dp int) {\\n x0, x1, x2, bb := big.NewInt(1), big.NewInt(1), big.NewInt(0), big.NewInt(b)\\n ratio := big.NewRat(1, 1)\\n iters := 0\\n prev := ratio.FloatString(dp)\\n for {\\n iters++\\n x2.Mul(bb, x1)\\n x2.Add(x2, x0)\\n this := ratio.SetFrac(x2, x1).FloatString(dp)\\n if prev == this {\\n plural := \\\"s\\\"\\n if iters == 1 {\\n plural = \\\" \\\"\\n }\\n fmt.Printf(\\\"Value to %d dp after %2d iteration%s: %s\\\\n\\\\n\\\", dp, iters, plural, this)\\n return\\n }\\n prev = this\\n x0.Set(x1)\\n x1.Set(x2)\\n }\\n}\\n\\nfunc main() {\\n for b := int64(0); b < 10; b++ {\\n lucas(b)\\n metallic(b, 32)\\n }\\n fmt.Println(\\\"Golden ratio, where b = 1:\\\")\\n metallic(1, 256)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"class MetallicRatios {\\n private static List<String> names = new ArrayList<>()\\n static {\\n names.add(\\\"Platinum\\\")\\n names.add(\\\"Golden\\\")\\n names.add(\\\"Silver\\\")\\n names.add(\\\"Bronze\\\")\\n names.add(\\\"Copper\\\")\\n names.add(\\\"Nickel\\\")\\n names.add(\\\"Aluminum\\\")\\n names.add(\\\"Iron\\\")\\n names.add(\\\"Tin\\\")\\n names.add(\\\"Lead\\\")\\n }\\n\\n private static void lucas(long b) {\\n printf(\\\"Lucas sequence for %s ratio, where b = %d\\\\n\\\", names[b], b)\\n print(\\\"First 15 elements: \\\")\\n long x0 = 1\\n long x1 = 1\\n printf(\\\"%d, %d\\\", x0, x1)\\n for (int i = 1; i < 13; ++i) {\\n long x2 = b * x1 + x0\\n printf(\\\", %d\\\", x2)\\n x0 = x1\\n x1 = x2\\n }\\n println()\\n }\\n\\n private static void metallic(long b, int dp) {\\n BigInteger x0 = BigInteger.ONE\\n BigInteger x1 = BigInteger.ONE\\n BigInteger x2\\n BigInteger bb = BigInteger.valueOf(b)\\n BigDecimal ratio = BigDecimal.ONE.setScale(dp)\\n int iters = 0\\n String prev = ratio.toString()\\n while (true) {\\n iters++\\n x2 = bb * x1 + x0\\n String thiz = (x2.toBigDecimal().setScale(dp) / x1.toBigDecimal().setScale(dp)).toString()\\n if (prev == thiz) {\\n String plural = \\\"s\\\"\\n if (iters == 1) {\\n plural = \\\"\\\"\\n }\\n printf(\\\"Value after %d iteration%s: %s\\\\n\\\\n\\\", iters, plural, thiz)\\n return\\n }\\n prev = thiz\\n x0 = x1\\n x1 = x2\\n }\\n }\\n\\n static void main(String[] args) {\\n for (int b = 0; b < 10; ++b) {\\n lucas(b)\\n metallic(b, 32)\\n }\\n println(\\\"Golden ratio, where b = 1:\\\")\\n metallic(1, 256)\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \" 258j256\\\":%~/+/+/ .*~^:10 x:*i.2 2\\n1.6180339887498948482045868343656381177203091798057628621354486227052604628189024497072072041893911374847540880753868917521266338622235369317931800607667263544333890865959395829056383226613199282902678806752087668925017116962070322210432162695486262963136144\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"task=:{{\\n 32 task y\\n:\\n echo 'b=',\\\":y\\n echo 'seq=',\\\":(,(1,y) X _2{.])^:15]1 1x\\n k=. 0\\n prev=.val=. ''\\n rat=. 1 1x\\n whilst.-.prev-:val do.\\n k=. k+1\\n prev=. val\\n rat=. }.rat,rat X 1,y\\n val=. (j./2 0+x)\\\":%~/rat\\n end.\\n echo (\\\":k),' iterations: ',val\\n}}\\n\\n task 0\\nb=0\\nseq=1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n2 iterations: 1.00000000000000000000000000000000\\n task 1\\nb=1\\nseq=1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597\\n78 iterations: 1.61803398874989484820458683436564\\n task 2\\nb=2\\nseq=1 1 3 7 17 41 99 239 577 1393 3363 8119 19601 47321 114243 275807 665857\\n44 iterations: 2.41421356237309504880168872420970\\n task 3\\nb=3\\nseq=1 1 4 13 43 142 469 1549 5116 16897 55807 184318 608761 2010601 6640564 21932293 72437443\\n34 iterations: 3.30277563773199464655961063373525\\n task 4\\nb=4\\nseq=1 1 5 21 89 377 1597 6765 28657 121393 514229 2178309 9227465 39088169 165580141 701408733 2971215073\\n28 iterations: 4.23606797749978969640917366873128\\n task 5\\nb=5\\nseq=1 1 6 31 161 836 4341 22541 117046 607771 3155901 16387276 85092281 441848681 2294335686 11913527111 61861971241\\n25 iterations: 5.19258240356725201562535524577016\\n task 6\\nb=6\\nseq=1 1 7 43 265 1633 10063 62011 382129 2354785 14510839 89419819 551029753 3395598337 20924619775 128943316987 794584521697\\n23 iterations: 6.16227766016837933199889354443272\\n task 7\\nb=7\\nseq=1 1 8 57 407 2906 20749 148149 1057792 7552693 53926643 385039194 2749201001 19629446201 140155324408 1000716717057 7145172343807\\n22 iterations: 7.14005494464025913554865124576352\\n task 8\\nb=8\\nseq=1 1 9 73 593 4817 39129 317849 2581921 20973217 170367657 1383914473 11241683441 91317382001 741780739449 6025563297593 48946287120193\\n20 iterations: 8.12310562561766054982140985597408\\n task 9\\nb=9\\nseq=1 1 10 91 829 7552 68797 626725 5709322 52010623 473804929 4316254984 39320099785 358197153049 3263094477226 29726047448083 270797521509973\\n20 iterations: 9.10977222864644365500113714088140\\n\\n 256 task 1\\nb=1\\nseq=1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597\\n615 iterations: 1.6180339887498948482045868343656381177203091798057628621354486227052604628189024497072072041893911374847540880753868917521266338622235369317931800607667263544333890865959395829056383226613199282902678806752087668925017116962070322210432162695486262963136144\\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 class MetallicRatios {\\n\\n private static String[] ratioDescription = new String[] {\\\"Platinum\\\", \\\"Golden\\\", \\\"Silver\\\", \\\"Bronze\\\", \\\"Copper\\\", \\\"Nickel\\\", \\\"Aluminum\\\", \\\"Iron\\\", \\\"Tin\\\", \\\"Lead\\\"};\\n\\n public static void main(String[] args) {\\n int elements = 15;\\n for ( int b = 0 ; b < 10 ; b++ ) {\\n System.out.printf(\\\"Lucas sequence for %s ratio, where b = %d:%n\\\", ratioDescription[b], b);\\n System.out.printf(\\\"First %d elements: %s%n\\\", elements, lucasSequence(1, 1, b, elements));\\n int decimalPlaces = 32;\\n BigDecimal[] ratio = lucasSequenceRatio(1, 1, b, decimalPlaces+1);\\n System.out.printf(\\\"Value to %d decimal places after %s iterations : %s%n\\\", decimalPlaces, ratio[1], ratio[0]);\\n System.out.printf(\\\"%n\\\");\\n }\\n int b = 1;\\n int decimalPlaces = 256;\\n System.out.printf(\\\"%s ratio, where b = %d:%n\\\", ratioDescription[b], b);\\n BigDecimal[] ratio = lucasSequenceRatio(1, 1, b, decimalPlaces+1);\\n System.out.printf(\\\"Value to %d decimal places after %s iterations : %s%n\\\", decimalPlaces, ratio[1], ratio[0]);\\n }\\n\\n private static BigDecimal[] lucasSequenceRatio(int x0, int x1, int b, int digits) {\\n BigDecimal x0Bi = BigDecimal.valueOf(x0);\\n BigDecimal x1Bi = BigDecimal.valueOf(x1);\\n BigDecimal bBi = BigDecimal.valueOf(b);\\n MathContext mc = new MathContext(digits);\\n BigDecimal fractionPrior = x1Bi.divide(x0Bi, mc);\\n int iterations = 0;\\n while ( true ) {\\n iterations++;\\n BigDecimal x = bBi.multiply(x1Bi).add(x0Bi);\\n BigDecimal fractionCurrent = x.divide(x1Bi, mc);\\n if ( fractionCurrent.compareTo(fractionPrior) == 0 ) {\\n break;\\n }\\n x0Bi = x1Bi;\\n x1Bi = x;\\n fractionPrior = fractionCurrent;\\n }\\n return new BigDecimal[] {fractionPrior, BigDecimal.valueOf(iterations)};\\n }\\n\\n private static List<BigInteger> lucasSequence(int x0, int x1, int b, int n) {\\n List<BigInteger> list = new ArrayList<>();\\n BigInteger x0Bi = BigInteger.valueOf(x0);\\n BigInteger x1Bi = BigInteger.valueOf(x1);\\n BigInteger bBi = BigInteger.valueOf(b);\\n if ( n > 0 ) {\\n list.add(x0Bi);\\n }\\n if ( n > 1 ) {\\n list.add(x1Bi);\\n }\\n while ( n > 2 ) {\\n BigInteger x = bBi.multiply(x1Bi).add(x0Bi);\\n list.add(x);\\n n--;\\n x0Bi = x1Bi;\\n x1Bi = x;\\n }\\n return list;\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"include \\\"rational\\\" {search: \\\".\\\"}; the defs at [[Arithmetic/Rational#jq]]\\n\\ndef names:\\n [\\\"Platinum\\\", \\\"Golden\\\", \\\"Silver\\\", \\\"Bronze\\\", \\\"Copper\\\",\\\"Nickel\\\", \\\"Aluminium\\\", \\\"Iron\\\", \\\"Tin\\\", \\\"Lead\\\"];\\n\\ndef lucas($b):\\n [1,1] | recurse( [last, first + $b*last] ) | first;\\n\\ndef lucas($b; $n):\\n \\\"Lucas sequence for \\\\(names[$b]) ratio, where b = \\\\($b):\\\",\\n \\\"First \\\\(n) elements: \\\",\\n [limit($n; lucas($b))];\\n\\n# dp = integer (degrees of precision)\\ndef metallic(b; dp):\\n { x0: 1,\\n x1: 1,\\n x2: 0,\\n ratio: r(1; 1),\\n iters: 0 }\\n | .prev = (.ratio|r_to_decimal(dp)) # a string\\n | until(.emit;\\n .iters += 1\\n | .x2 = .b * .x1 + .x0\\n | .ratio = r(.x2; .x1)\\n | .curr = (.ratio|r_to_decimal(dp)) # a string\\n | if .prev == .curr\\n then (if (.iters == 1) then \\\" \\\" else \\\"s\\\" end) as $plural\\n | .emit = \\\"Value to \\\\(dp) dp after \\\\(.iters) iteration\\\\($plural): \\\\(.curr)\\\\n\\\"\\n else .prev = .curr\\n | .x0 = .x1\\n | .x1 = .x2\\n\\tend )\\n | .emit;\\n\\n(range( 0;10) | lucas(.; 15), metallic(.; 32)),\\n\\n\\\"Golden ratio, where b = 1:\\\", metallic(1; 256)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Formatting\\nimport Base.iterate, Base.IteratorSize, Base.IteratorEltype, Base.Iterators.take\\n\\nconst metallicnames = [\\\"Platinum\\\", \\\"Golden\\\", \\\"Silver\\\", \\\"Bronze\\\", \\\"Copper\\\", \\\"Nickel\\\",\\n \\\"Aluminium\\\", \\\"Iron\\\", \\\"Tin\\\", \\\"Lead\\\"]\\n\\nstruct Lucas b::Int end\\nBase.IteratorSize(s::Lucas) = Base.IsInfinite()\\nBase.IteratorEltype(s::Lucas) = BigInt\\nBase.iterate(s::Lucas, (x1, x2) = (big\\\"1\\\", big\\\"1\\\")) = (t = x2 * s.b + x1; (x1, (x2, t)))\\n\\nprintlucas(b, len=15) = (for i in take(Lucas(b), len) print(i, \\\", \\\") end; println(\\\"...\\\"))\\n\\nfunction lucasratios(b, len)\\n\\titer = BigFloat.(collect(take(Lucas(b), len + 1)))\\n\\treturn map(i -> iter[i + 1] / iter[i], 1:length(iter)-1)\\nend\\t\\t\\n\\nfunction metallic(b, dplaces=32)\\n setprecision(dplaces * 5)\\n ratios, err = lucasratios(b, dplaces * 50), BigFloat(10)^(-dplaces)\\n errors = map(i -> abs(ratios[i + 1] - ratios[i]), 1:length(ratios)-1)\\n iternum = findfirst(x -> x < err, errors)\\n println(\\\"After $(iternum + 1) iterations, the value of \\\",\\n\\t\\tformat(ratios[iternum + 1], precision=dplaces),\\n\\t\\t\\\" is stable to $dplaces decimal places.\\\\n\\\")\\nend\\n\\nfor (b, name) in enumerate(metallicnames)\\n println(\\\"The first 15 elements of the Lucas sequence named \\\",\\n metallicnames[b], \\\" and b of $(b - 1) are:\\\")\\n printlucas(b - 1)\\n metallic(b - 1)\\nend\\nprintln(\\\"Golden ratio to 256 decimal places:\\\")\\nmetallic(1, 256)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import java.math.BigDecimal\\nimport java.math.BigInteger\\n\\nval names = listOf(\\\"Platinum\\\", \\\"Golden\\\", \\\"Silver\\\", \\\"Bronze\\\", \\\"Copper\\\", \\\"Nickel\\\", \\\"Aluminium\\\", \\\"Iron\\\", \\\"Tin\\\", \\\"Lead\\\")\\n\\nfun lucas(b: Long) {\\n println(\\\"Lucas sequence for ${names[b.toInt()]} ratio, where b = $b:\\\")\\n print(\\\"First 15 elements: \\\")\\n var x0 = 1L\\n var x1 = 1L\\n print(\\\"$x0, $x1\\\")\\n for (i in 1..13) {\\n val x2 = b * x1 + x0\\n print(\\\", $x2\\\")\\n x0 = x1\\n x1 = x2\\n }\\n println()\\n}\\n\\nfun metallic(b: Long, dp:Int) {\\n var x0 = BigInteger.ONE\\n var x1 = BigInteger.ONE\\n var x2: BigInteger\\n val bb = BigInteger.valueOf(b)\\n val ratio = BigDecimal.ONE.setScale(dp)\\n var iters = 0\\n var prev = ratio.toString()\\n while (true) {\\n iters++\\n x2 = bb * x1 + x0\\n val thiz = (x2.toBigDecimal(dp) / x1.toBigDecimal(dp)).toString()\\n if (prev == thiz) {\\n var plural = \\\"s\\\"\\n if (iters == 1) {\\n plural = \\\"\\\"\\n }\\n println(\\\"Value after $iters iteration$plural: $thiz\\\\n\\\")\\n return\\n }\\n prev = thiz\\n x0 = x1\\n x1 = x2\\n }\\n}\\n\\nfun main() {\\n for (b in 0L until 10L) {\\n lucas(b)\\n metallic(b, 32)\\n }\\n println(\\\"Golden ration, where b = 1:\\\")\\n metallic(1, 256)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"ClearAll[FindMetallicRatio]\\nFindMetallicRatio[b_, digits_] :=\\n Module[{n, m, data, acc, old, done = False},\\n {n, m} = {1, 1};\\n old = -100;\\n data = {};\\n While[done == False,\\n {n, m} = {m, b m + n};\\n AppendTo[data, {m, m/n}];\\n If[Length[data] > 15,\\n If[-N[Log10[Abs[data[[-1, 2]] - data[[-2, 2]]]]] > digits,\\n done = True\\n ]\\n ]\\n ];\\n acc = -N[Log10[Abs[data[[-1, 2]] - data[[-2, 2]]]]];\\n <|\\\"sequence\\\" -> Join[{1, 1}, data[[All, 1]]],\\n \\\"ratio\\\" -> data[[All, 2]], \\\"acc\\\" -> acc,\\n \\\"steps\\\" -> Length[data]|>\\n ]\\nDo[\\n out = FindMetallicRatio[b, 32];\\n Print[\\\"b=\\\", b];\\n Print[\\\"b=\\\", b, \\\" first 15=\\\", Take[out[\\\"sequence\\\"], 15]];\\n Print[\\\"b=\\\", b, \\\" ratio=\\\", N[Last[out[\\\"ratio\\\"]], {\\\\[Infinity], 33}]];\\n Print[\\\"b=\\\", b, \\\" Number of steps=\\\", out[\\\"steps\\\"]];\\n ,\\n {b, 0, 9}\\n ]\\nout = FindMetallicRatio[1, 256];\\nout[\\\"steps\\\"]\\nN[out[\\\"ratio\\\"][[-1]], 256]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import strformat\\nimport bignum\\n\\ntype Metal {.pure.} = enum platinum, golden, silver, bronze, copper, nickel, aluminium, iron, tin, lead\\n\\niterator sequence(b: int): Int =\\n ## Yield the successive terms if a “Lucas” sequence.\\n ## The first two terms are ignored.\\n var x, y = newInt(1)\\n while true:\\n x += b * y\\n swap x, y\\n yield y\\n\\n\\ntemplate plural(n: int): string =\\n if n >= 2: \\\"s\\\" else: \\\"\\\"\\n\\n\\nproc computeRatio(b: Natural; digits: Positive) =\\n ## Compute the ratio for the given \\\"n\\\" with the required number of digits.\\n\\n let M = 10^culong(digits)\\n\\n var niter = 0 # Number of iterations.\\n var prevN = newInt(1) # Previous value of \\\"n\\\".\\n var ratio = M # Current value of ratio.\\n\\n for n in sequence(b):\\n inc niter\\n let nextRatio = n * M div prevN\\n if nextRatio == ratio: break\\n prevN = n.clone\\n ratio = nextRatio\\n\\n var str = $ratio\\n str.insert(\\\".\\\", 1)\\n echo &\\\"Value to {digits} decimal places after {niter} iteration{plural(niter)}: \\\", str\\n\\n\\nwhen isMainModule:\\n\\n for b in 0..9:\\n echo &\\\"“Lucas” sequence for {Metal(b)} ratio where b = {b}:\\\"\\n stdout.write \\\"First 15 elements: 1 1\\\"\\n var count = 2\\n for n in sequence(b):\\n stdout.write ' ', n\\n inc count\\n if count == 15: break\\n echo \\\"\\\"\\n computeRatio(b, 32)\\n echo \\\"\\\"\\n\\n echo \\\"Golden ratio where b = 1:\\\"\\n computeRatio(1, 256)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature qw(say state);\\nuse Math::AnyNum qw<:overload as_dec>;\\n\\nsub gen_lucas {\\n my $b = shift;\\n my $i = 0;\\n return sub {\\n state @seq = (state $v1 = 1, state $v2 = 1);\\n ($v2, $v1) = ($v1, $v2 + $b*$v1) and push(@seq, $v1) unless defined $seq[$i+1];\\n return $seq[$i++];\\n }\\n}\\n\\nsub metallic {\\n my $lucas = shift;\\n my $places = shift || 32;\\n my $n = my $last = 0;\\n my @seq = $lucas->();\\n while (1) {\\n push @seq, $lucas->();\\n my $this = as_dec( $seq[-1]/$seq[-2], $places+1 );\\n last if $this eq $last;\\n $last = $this;\\n $n++;\\n }\\n $last, $n\\n}\\n\\nmy @name = <Platinum Golden Silver Bronze Copper Nickel Aluminum Iron Tin Lead>;\\n\\nfor my $b (0..$#name) {\\n my $lucas = gen_lucas($b);\\n printf \\\"\\\\n'Lucas' sequence for $name[$b] ratio, where b = $b:\\\\nFirst 15 elements: \\\" . join ', ', map { $lucas->() } 1..15;\\n printf \\\"Approximated value %s reached after %d iterations\\\\n\\\", metallic(gen_lucas($b));\\n}\\n\\nprintf \\\"\\\\nGolden ratio to 256 decimal places %s reached after %d iterations\\\", metallic(gen_lucas(1),256);\\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: #004080;\\\">mpfr</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">names</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"Platinum\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Golden\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Silver\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Bronze\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Copper\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"Nickel\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Aluminium\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Iron\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Tin\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Lead\\\"</span><span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">lucas</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">b</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;\\\">\\\"Lucas sequence for %s ratio, where b = %d:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">names</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;\\\">b</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">x0</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x2</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 elements: %d, %d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">x0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x1</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;\\\">13</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">x2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">x1</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">x0</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\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">x0</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">x1</span>\\n <span style=\\\"color: #000000;\\\">x1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">x2</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;\\\">\\\"\\\\n\\\"</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;\\\">procedure</span> <span style=\\\"color: #000000;\\\">metallic</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">dp</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">x0</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> <span style=\\\"color: #000000;\\\">bb</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;\\\">4</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;\\\">b</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #004080;\\\">mpfr</span> <span style=\\\"color: #000000;\\\">ratio</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpfr_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-(</span><span style=\\\"color: #000000;\\\">dp</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">iterations</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">prev</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpfr_get_fixed</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ratio</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dp</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;\\\">iterations</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">bb</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">x2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">x0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_set_z</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ratio</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">x2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_div_z</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ratio</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ratio</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">curr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpfr_get_fixed</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ratio</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dp</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;\\\">curr</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">plural</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">iterations</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;\\\">\\\"s\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">curr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shorten</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curr</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;\\\">\\\"Value to %d dp after %2d iteration%s: %s\\\\n\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">dp</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">iterations</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">plural</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">curr</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;\\\">prev</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">curr</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_set</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_set</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: #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: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">9</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">lucas</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">metallic</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">32</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;\\\">\\\"Golden ratio, where b = 1:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">metallic</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">256</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\": \"from itertools import count, islice\\nfrom _pydecimal import getcontext, Decimal\\n\\ndef metallic_ratio(b):\\n m, n = 1, 1\\n while True:\\n yield m, n\\n m, n = m*b + n, m\\n\\ndef stable(b, prec):\\n def to_decimal(b):\\n for m,n in metallic_ratio(b):\\n yield Decimal(m)/Decimal(n)\\n\\n getcontext().prec = prec\\n last = 0\\n for i,x in zip(count(), to_decimal(b)):\\n if x == last:\\n print(f'after {i} iterations:\\\\n\\\\t{x}')\\n break\\n last = x\\n\\nfor b in range(4):\\n coefs = [n for _,n in islice(metallic_ratio(b), 15)]\\n print(f'\\\\nb = {b}: {coefs}')\\n stable(b, 32)\\n\\nprint(f'\\\\nb = 1 with 256 digits:')\\nstable(1, 256)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ $ \\\"bigrat.qky\\\" loadfile ] now!\\n\\n [ [ table\\n $ \\\"Platinum\\\" $ \\\"Golden\\\"\\n $ \\\"Silver\\\" $ \\\"Bronze\\\"\\n $ \\\"Copper\\\" $ \\\"Nickel\\\"\\n $ \\\"Aluminium\\\" $ \\\"Iron\\\"\\n $ \\\"Tin\\\" $ \\\"Lead\\\" ]\\n do echo$ ] is echoname ( n --> )\\n\\n [ temp put\\n ' [ 1 1 ]\\n 13 times\\n [ dup -1 peek\\n temp share *\\n over -2 peek +\\n join ]\\n temp release ] is task1 ( n --> [ )\\n\\n [ temp put\\n ' [ 0 1 1 ]\\n [ dup -3 split nip\\n do dip tuck swap\\n 32 approx= if done\\n dup -1 peek\\n temp share *\\n over -2 peek +\\n join\\n again ]\\n temp release\\n dup size 3 - swap\\n -3 split nip\\n -1 split drop\\n do swap rot ] is task2 ( n --> n/d n )\\n\\n 10 times\\n [ i^ echoname cr\\n i^ task1\\n witheach [ echo sp ] cr\\n i^ task2\\n echo sp\\n 32 point$ echo$\\n cr cr ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"use Rat::Precise;\\nuse Lingua::EN::Numbers;\\n\\nsub lucas ($b) { 1, 1, * + $b * * … * }\\n\\nsub metallic ($seq, $places = 32) {\\n my $n = 0;\\n my $last = 0;\\n loop {\\n my $approx = FatRat.new($seq[$n + 1], $seq[$n]);\\n my $this = $approx.precise($places, :z);\\n last if $this eq $last;\\n $last = $this;\\n $n++;\\n }\\n $last, $n\\n}\\n\\nsub display ($value, $n) {\\n \\\"Approximated value:\\\", $value, \\\"Reached after {$n} iterations: \\\" ~\\n \\\"{ordinal-digit $n}/{ordinal-digit $n - 1} element.\\\"\\n}\\n\\nfor <Platinum Golden Silver Bronze Copper Nickel Aluminum Iron Tin Lead>.kv\\n -> \\\\b, $name {\\n my $lucas = lucas b;\\n print \\\"\\\\nLucas sequence for $name ratio; where b = {b}:\\\\nFirst 15 elements: \\\";\\n say join ', ', $lucas[^15];\\n say join ' ', display |metallic($lucas);\\n}\\n\\n# Stretch goal\\nsay join \\\"\\\\n\\\", \\\"\\\\nGolden ratio to 256 decimal places:\\\", display |metallic lucas(1), 256;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm computes the 1st N elements of the Lucas sequence for Metallic ratios 0──►9. */\\nparse arg n bLO bHI digs . /*obtain optional arguments from the CL*/\\nif n=='' | n==\\\",\\\" then n= 15 /*Not specified? Then use the default.*/\\nif bLO=='' | bLO==\\\",\\\" then bLO= 0 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif bHI=='' | bHI==\\\",\\\" then bHI= 9 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif digs=='' | digs==\\\",\\\" then digs= 32 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nnumeric digits digs + length(.) /*specify number of decimal digs to use*/\\nmetals= 'platinum golden silver bronze copper nickel aluminum iron tin lead'\\n@decDigs= ' decimal digits past the decimal point:' /*a literal used in SAY.*/\\n!.= /*the default name for a metallic ratio*/\\n do k=0 to 9; !.k= word(metals, k+1) /*assign the (ten) metallic ratio names*/\\n end /*k*/\\n\\n do m=bLO to bHI; @.= 1; $= 1 1 /*compute the sequence numbers & ratios*/\\n r=. /*the ratio (so far). */\\n do #=2 until r=old; old= r /*compute sequence numbers & the ratio.*/\\n #_1= #-1; #_2= #-2 /*use variables for previous numbers. */\\n @.#= m * @.#_1 + @.#_2 /*calculate a number i the sequence. */\\n if #<n then $= $ @.# /*build a sequence list of N numbers.*/\\n r= @.# / @.#_1 /*calculate ratio of the last 2 numbers*/\\n end /*#*/\\n\\n if words($)<n then $= subword($ copies('1 ', n), 1, n) /*extend list if too short*/\\n L= max(108, length($) ) /*ensure width of title. */\\n say center(' Lucas sequence for the' !.m \\\"ratio, where B is \\\" m' ', L, \\\"═\\\")\\n if n>0 then do; say 'the first ' n \\\" elements are:\\\"; say $\\n end /*if N is positive, then show N nums.*/\\n @approx= 'approximate' /*literal (1 word) that is used for SAY*/\\n r= format(r,,digs) /*limit decimal digits for R to digs.*/\\n if datatype(r, 'W') then do; r= r/1; @approx= \\\"exact\\\"; end\\n say 'the' @approx \\\"value reached after\\\" #-1 \\\" iterations with \\\" digs @DecDigs\\n say r; say /*display the ration plus a blank line.*/\\n end /*m*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"require('bigdecimal')\\nrequire('bigdecimal/util')\\n\\n# An iterator over the Lucas Sequence for 'b'.\\n# (The special case of: x(n) = b * x(n-1) + x(n-2).)\\n\\ndef lucas(b)\\n Enumerator.new do |yielder|\\n xn2 = 1 ; yielder.yield(xn2)\\n xn1 = 1 ; yielder.yield(xn1)\\n loop { xn2, xn1 = xn1, b * xn1 + xn2 ; yielder.yield(xn1) }\\n end\\nend\\n\\n# Compute the Metallic Ratio to 'precision' from the Lucas Sequence for 'b'.\\n# (Uses the lucas(b) iterator, above.)\\n# The metallic ratio is approximated by x(n) / x(n-1).\\n# Returns a struct of the approximate metallic ratio (.ratio) and the\\n# number of terms required to achieve the given precision (.terms).\\n\\ndef metallic_ratio(b, precision)\\n xn2 = xn1 = prev = this = 0\\n lucas(b).each.with_index do |xn, inx|\\n case inx\\n when 0\\n xn2 = BigDecimal(xn)\\n when 1\\n xn1 = BigDecimal(xn)\\n prev = xn1.div(xn2, 2 * precision).round(precision)\\n else\\n xn2, xn1 = xn1, BigDecimal(xn)\\n this = xn1.div(xn2, 2 * precision).round(precision)\\n return Struct.new(:ratio, :terms).new(prev, inx - 1) if prev == this\\n prev = this\\n end\\n end\\nend\\n\\nNAMES = [ 'Platinum', 'Golden', 'Silver', 'Bronze', 'Copper',\\n 'Nickel', 'Aluminum', 'Iron', 'Tin', 'Lead' ]\\n\\nputs\\nputs('Lucas Sequences...')\\nputs('%1s %s' % ['b', 'sequence'])\\n(0..9).each do |b|\\n puts('%1d %s' % [b, lucas(b).first(15)])\\nend\\n\\nputs\\nputs('Metallic Ratios to 32 places...')\\nputs('%-9s %1s %3s %s' % ['name', 'b', 'n', 'ratio'])\\n(0..9).each do |b|\\n rn = metallic_ratio(b, 32)\\n puts('%-9s %1d %3d %s' % [NAMES[b], b, rn.terms, rn.ratio.to_s('F')])\\nend\\n\\nputs\\nputs('Golden Ratio to 256 places...')\\nputs('%-9s %1s %3s %s' % ['name', 'b', 'n', 'ratio'])\\ngold_rn = metallic_ratio(1, 256)\\nputs('%-9s %1d %3d %s' % [NAMES[1], 1, gold_rn.terms, gold_rn.ratio.to_s('F')])\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"func seqRatio(f, places = 32) {\\n 1..Inf -> reduce {|t,n|\\n var r = (f(n+1)/f(n)).round(-places)\\n return(n, r.as_dec(places + r.abs.int.len)) if (r == t)\\n r\\n }\\n}\\n\\nfor k,v in (%w(Platinum Golden Silver Bronze Copper Nickel Aluminum Iron Tin Lead).kv) {\\n next if (k == 0) # undefined ratio\\n say \\\"Lucas sequence U_n(#{k},-1) for #{v} ratio\\\"\\n var f = {|n| lucasu(k, -1, n) }\\n say (\\\"First 15 elements: \\\", 15.of(f).join(', '))\\n var (n, r) = seqRatio(f)\\n say \\\"Approximated value: #{r} reached after #{n} iterations\\\"\\n say ''\\n}\\n\\nwith (seqRatio({|n| fib(n) }, 256)) {|n,v|\\n say \\\"Golden ratio to 256 decimal places:\\\"\\n say \\\"Approximated value: #{v}\\\"\\n say \\\"Reached after #{n} iterations\\\"\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"Imports BI = System.Numerics.BigInteger\\n\\nModule Module1\\n\\n Function IntSqRoot(v As BI, res As BI) As BI\\n REM res is the initial guess\\n Dim term As BI = 0\\n Dim d As BI = 0\\n Dim dl As BI = 1\\n While dl <> d\\n term = v / res\\n res = (res + term) >> 1\\n dl = d\\n d = term - res\\n End While\\n Return term\\n End Function\\n\\n Function DoOne(b As Integer, digs As Integer) As String\\n REM calculates result via square root, not iterations\\n Dim s = b * b + 4\\n digs += 1\\n Dim g As BI = Math.Sqrt(s * Math.Pow(10, digs))\\n Dim bs = IntSqRoot(s * BI.Parse(\\\"1\\\" + New String(\\\"0\\\", digs << 1)), g)\\n bs += b * BI.Parse(\\\"1\\\" + New String(\\\"0\\\", digs))\\n bs >>= 1\\n bs += 4\\n Dim st = bs.ToString\\n digs -= 1\\n Return String.Format(\\\"{0}.{1}\\\", st(0), st.Substring(1, digs))\\n End Function\\n\\n Function DivIt(a As BI, b As BI, digs As Integer) As String\\n REM performs division\\n Dim al = a.ToString.Length\\n Dim bl = b.ToString.Length\\n digs += 1\\n a *= BI.Pow(10, digs << 1)\\n b *= BI.Pow(10, digs)\\n Dim s = (a / b + 5).ToString\\n digs -= 1\\n Return s(0) + \\\".\\\" + s.Substring(1, digs)\\n End Function\\n\\n REM custom formatting\\n Function Joined(x() As BI) As String\\n Dim wids() = {1, 1, 2, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13}\\n Dim res = \\\"\\\"\\n For i = 0 To x.Length - 1\\n res += String.Format(\\\"{0,\\\" + (-wids(i)).ToString + \\\"} \\\", x(i))\\n Next\\n Return res\\n End Function\\n\\n Sub Main()\\n REM calculates and checks each \\\"metal\\\"\\n Console.WriteLine(\\\"Metal B Sq.Rt Iters /---- 32 decimal place value ----\\\\\\\\ Matches Sq.Rt Calc\\\")\\n Dim t = \\\"\\\"\\n Dim n As BI\\n Dim nm1 As BI\\n Dim k As Integer\\n Dim j As Integer\\n For b = 0 To 9\\n Dim lst(14) As BI\\n lst(0) = 1\\n lst(1) = 1\\n For i = 2 To 14\\n lst(i) = b * lst(i - 1) + lst(i - 2)\\n Next\\n REM since all the iterations (except Pt) are > 15, continue iterating from the end of the list of 15\\n n = lst(14)\\n nm1 = lst(13)\\n k = 0\\n j = 13\\n While k = 0\\n Dim lt = t\\n t = DivIt(n, nm1, 32)\\n If lt = t Then\\n k = If(b = 0, 1, j)\\n End If\\n Dim onn = n\\n n = b * n + nm1\\n nm1 = onn\\n\\n j += 1\\n End While\\n Console.WriteLine(\\\"{0,4} {1} {2,2} {3, 2} {4} {5}\\\" + vbNewLine + \\\"{6,19} {7}\\\", \\\"Pt Au Ag CuSn Cu Ni Al Fe Sn Pb\\\".Split(\\\" \\\")(b), b, b * b + 4, k, t, t = DoOne(b, 32), \\\"\\\", Joined(lst))\\n Next\\n REM now calculate and check big one\\n n = 1\\n nm1 = 1\\n k = 0\\n j = 1\\n While k = 0\\n Dim lt = t\\n t = DivIt(n, nm1, 256)\\n If lt = t Then\\n k = j\\n End If\\n Dim onn = n\\n n += nm1\\n nm1 = onn\\n\\n j += 1\\n End While\\n Console.WriteLine()\\n Console.WriteLine(\\\"Au to 256 digits:\\\")\\n Console.WriteLine(t)\\n Console.WriteLine(\\\"Iteration count: {0} Matched Sq.Rt Calc: {1}\\\", k, t = DoOne(1, 256))\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./big\\\" for BigInt, BigRat\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar names = [\\\"Platinum\\\", \\\"Golden\\\", \\\"Silver\\\", \\\"Bronze\\\", \\\"Copper\\\",\\\"Nickel\\\", \\\"Aluminium\\\", \\\"Iron\\\", \\\"Tin\\\", \\\"Lead\\\"]\\n\\nvar lucas = Fn.new { |b|\\n Fmt.print(\\\"Lucas sequence for $s ratio, where b = $d:\\\", names[b], b)\\n System.write(\\\"First 15 elements: \\\")\\n var x0 = 1\\n var x1 = 1\\n Fmt.write(\\\"$d, $d\\\", x0, x1)\\n for (i in 1..13) {\\n var x2 = b*x1 + x0\\n Fmt.write(\\\", $d\\\", x2)\\n x0 = x1\\n x1 = x2\\n }\\n System.print()\\n}\\n\\nvar metallic = Fn.new { |b, dp|\\n var x0 = BigInt.one\\n var x1 = BigInt.one\\n var x2 = BigInt.zero\\n var bb = BigInt.new(b)\\n var ratio = BigRat.new(BigInt.one, BigInt.one)\\n var iters = 0\\n var prev = ratio.toDecimal(dp)\\n while (true) {\\n iters = iters + 1\\n x2 = bb*x1 + x0\\n ratio = BigRat.new(x2, x1)\\n var curr = ratio.toDecimal(dp)\\n if (prev == curr) {\\n var plural = (iters == 1) ? \\\" \\\" : \\\"s\\\"\\n Fmt.print(\\\"Value to $d dp after $2d iteration$s: $s\\\\n\\\", dp, iters, plural, curr)\\n return\\n }\\n prev = curr\\n x0 = x1\\n x1 = x2\\n }\\n}\\n\\nfor (b in 0..9) {\\n lucas.call(b)\\n metallic.call(b, 32)\\n}\\nSystem.print(\\\"Golden ratio, where b = 1:\\\")\\nmetallic.call(1, 256)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"var [const] BI=Import(\\\"zklBigNum\\\"); // libGMP\\nfcn lucasSeq(b){\\n Walker.zero().tweak('wrap(xs){\\n xm2,xm1 := xs;\\t// x[n-2], x[n-1]\\n xn:=xm1*b + xm2;\\n xs.append(xn).del(0);\\n xn\\n }.fp(L(BI(1),BI(1)))).push(1,1) // xn can get big so use BigInts\\n}\\nfcn metallicRatio(lucasSeq,digits=32,roundup=True){ #-->(String,num iterations)\\n bige:=BI(\\\"1e\\\"+(digits+1)); # x[n-1]*bige*b / x[n-2] to get our digits from Ints\\n a,b,mr := lucasSeq.next(), lucasSeq.next(), (bige*b).div(a);\\n do(20_000){\\t// limit iterations\\n c,mr2 := lucasSeq.next(), (bige*c).div(b);\\n if(mr==mr2){\\n\\t mr=mr2.add(5*roundup).div(10).toString();\\n\\t return(String(mr[0],\\\".\\\",mr.del(0)),\\n\\t lucasSeq.idx); // idx ignores push(), ie first 2 terms\\n }\\n b,mr = c,mr2;\\n }\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"metals:=\\\"Platinum Golden Silver Bronze Copper Nickel Aluminum Iron Tin Lead\\\";\\nforeach metal in (metals.split(\\\" \\\")){ n:=__metalWalker.idx;\\n println(\\\"\\\\nLucas sequence for %s ratio; where b = %d:\\\".fmt(metal,n));\\n println(\\\"First 15 elements: \\\",lucasSeq(n).walk(15).concat(\\\" \\\"));\\n mr,i := metallicRatio(lucasSeq(n));\\n println(\\\"Approximated value: %s - Reached after ~%d iterations.\\\".fmt(mr,i));\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"println(\\\"Golden ratio (B==1) to 256 digits:\\\");\\nmr,i := metallicRatio(lucasSeq(1),256);\\nprintln(\\\"Approximated value: %s\\\\nReached after ~%d iterations.\\\".fmt(mr,i));\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Metallic-ratios"}}},{"rowIdx":486,"cells":{"solutions":{"kind":"list like","value":[{"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. This task intends to demonstrate coordination of active concurrent units through the use of a passive concurrent unit. The operations for a counting semaphore are ''acquire'', ''release'', and ''count''. Each active concurrent unit should attempt to acquire the counting semaphore before executing its assigned duties. In this case the active concurrent unit should report that it has acquired the semaphore. It should sleep for 2 seconds and then release the semaphore.\n\n","language":"00-TASK"},{"code":"package Semaphores is\n protected type Counting_Semaphore(Max : Positive) is\n entry Acquire;\n procedure Release;\n function Count return Natural;\n private\n Lock_Count : Natural := 0;\n end Counting_Semaphore;\nend Semaphores;\n","language":"Ada"},{"code":"package body Semaphores is\n\n ------------------------\n -- Counting_Semaphore --\n ------------------------\n\n protected body Counting_Semaphore is\n\n -------------\n -- Acquire --\n -------------\n\n entry Acquire when Lock_Count < Max is\n begin\n Lock_Count := Lock_Count + 1;\n end Acquire;\n\n -----------\n -- Count --\n -----------\n\n function Count return Natural is\n begin\n return Lock_Count;\n end Count;\n\n -------------\n -- Release --\n -------------\n\n procedure Release is\n begin\n if Lock_Count > 0 then\n Lock_Count := Lock_Count - 1;\n end if;\n end Release;\n\n end Counting_Semaphore;\n\nend Semaphores;\n","language":"Ada"},{"code":"with Semaphores;\nwith Ada.Text_Io; use Ada.Text_Io;\n\nprocedure Semaphores_Main is\n -- Create an instance of a Counting_Semaphore with Max set to 3\n Lock : Semaphores.Counting_Semaphore(3);\n\n -- Define a task type to interact with the Lock object declared above\n task type Worker is\n entry Start (Sleep : in Duration; Id : in Positive);\n end Worker;\n\n task body Worker is\n Sleep_Time : Duration;\n My_Id : Positive;\n begin\n accept Start(Sleep : in Duration; Id : in Positive) do\n My_Id := Id;\n Sleep_Time := Sleep;\n end Start;\n --Acquire the lock. The task will suspend until the Acquire call completes\n Lock.Acquire;\n Put_Line(\"Task #\" & Positive'Image(My_Id) & \" acquired the lock.\");\n -- Suspend the task for Sleep_Time seconds\n delay Sleep_Time;\n -- Release the lock. Release is unconditional and happens without suspension\n Lock.Release;\n end Worker;\n\n -- Create an array of 5 Workers\n type Staff is array(Positive range 1..5) of Worker;\n Crew : Staff;\nbegin\n for I in Crew'range loop\n Crew(I).Start(2.0, I);\n end loop;\nend Semaphores_Main;\n","language":"Ada"},{"code":"SEMA sem = LEVEL 1;\n\nPROC job = (INT n)VOID: (\n printf(($\" Job \"d\" acquired Semaphore ...\"$,n));\n TO 10000000 DO SKIP OD;\n printf(($\" Job \"d\" releasing Semaphore\"l$,n))\n);\n\nPAR (\n ( DOWN sem ; job(1) ; UP sem ) ,\n ( DOWN sem ; job(2) ; UP sem ) ,\n ( DOWN sem ; job(3) ; UP sem )\n)\n","language":"ALGOL-68"},{"code":" INSTALL @lib$+\"TIMERLIB\"\n DIM tID%(6)\n\n REM Two workers may be concurrent\n DIM Semaphore%(2)\n\n tID%(6) = FN_ontimer(11, PROCtimer6, 1)\n tID%(5) = FN_ontimer(10, PROCtimer5, 1)\n tID%(4) = FN_ontimer(11, PROCtimer4, 1)\n tID%(3) = FN_ontimer(10, PROCtimer3, 1)\n tID%(2) = FN_ontimer(11, PROCtimer2, 1)\n tID%(1) = FN_ontimer(10, PROCtimer1, 1)\n\n ON CLOSE PROCcleanup : QUIT\n ON ERROR PRINT REPORT$ : PROCcleanup : END\n\n sc% = 0\n REPEAT\n oldsc% = sc%\n sc% = -SUM(Semaphore%())\n IF sc%<>oldsc% PRINT \"Semaphore count now \";sc%\n WAIT 0\n UNTIL FALSE\n\n DEF PROCtimer1 : PROCtask(1) : ENDPROC\n DEF PROCtimer2 : PROCtask(2) : ENDPROC\n DEF PROCtimer3 : PROCtask(3) : ENDPROC\n DEF PROCtimer4 : PROCtask(4) : ENDPROC\n DEF PROCtimer5 : PROCtask(5) : ENDPROC\n DEF PROCtimer6 : PROCtask(6) : ENDPROC\n\n DEF PROCtask(n%)\n LOCAL i%, temp%\n PRIVATE delay%(), sem%()\n DIM delay%(6), sem%(6)\n IF delay%(n%) THEN\n delay%(n%) -= 1\n IF delay%(n%) = 0 THEN\n SWAP Semaphore%(sem%(n%)),temp%\n delay%(n%) = -1\n PRINT \"Task \" ; n% \" released semaphore\"\n ENDIF\n ENDPROC\n ENDIF\n FOR i% = 1 TO DIM(Semaphore%(),1)\n temp% = TRUE\n SWAP Semaphore%(i%),temp%\n IF NOT temp% EXIT FOR\n NEXT\n IF temp% THEN ENDPROC : REM Waiting to acquire semaphore\n sem%(n%) = i%\n delay%(n%) = 200\n PRINT \"Task \"; n% \" acquired semaphore\"\n ENDPROC\n\n DEF PROCcleanup\n LOCAL i%\n FOR i% = 1 TO 6\n PROC_killtimer(tID%(i%))\n NEXT\n ENDPROC\n","language":"BBC-BASIC"},{"code":"#include <semaphore.h>\n#include <pthread.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <unistd.h>\n\nsem_t sem;\nint count = 3;\n\n/* the whole point of a semaphore is that you don't count it:\n * p/v are atomic. Unless it's locked while you are doing\n * something with the count, the value is only informative */\n#define getcount() count\nvoid acquire()\n{\n\tsem_wait(&sem);\n\tcount--;\n}\n\nvoid release()\n{\n\tcount++;\n\tsem_post(&sem);\n}\n\nvoid* work(void * id)\n{\n\tint i = 10;\n\twhile (i--) {\n\t\tacquire();\n\t\tprintf(\"#%d acquired sema at %d\\n\", *(int*)id, getcount());\n\t\tusleep(rand() % 4000000); /* sleep 2 sec on average */\n\t\trelease();\n\t\tusleep(0); /* effectively yield */\n\t}\n\treturn 0;\n}\n\nint main()\n{\n\tpthread_t th[4];\n\tint i, ids[] = {1, 2, 3, 4};\n\n\tsem_init(&sem, 0, count);\n\n\tfor (i = 4; i--;) pthread_create(th + i, 0, work, ids + i);\n\tfor (i = 4; i--;) pthread_join(th[i], 0);\n\tprintf(\"all workers done\\n\");\n\n\treturn sem_destroy(&sem);\n}\n","language":"C"},{"code":"#include <chrono>\n#include <iostream>\n#include <format>\n#include <semaphore>\n#include <thread>\n\nusing namespace std::literals;\n\nvoid Worker(std::counting_semaphore<>& semaphore, int id)\n{\t\n semaphore.acquire();\n std::cout << std::format(\"Thread {} has a semaphore & is now working.\\n\", id); // response message\n std::this_thread::sleep_for(2s);\n std::cout << std::format(\"Thread {} done.\\n\", id);\n semaphore.release();\n}\n\nint main()\n{\n const auto numOfThreads = static_cast<int>( std::thread::hardware_concurrency() );\n std::counting_semaphore<> semaphore{numOfThreads / 2};\n\n std::vector<std::jthread> tasks;\n for (int id = 0; id < numOfThreads; ++id)\n\ttasks.emplace_back(Worker, std::ref(semaphore), id);\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Threading;\nusing System.Threading.Tasks;\n\nnamespace RosettaCode\n{\n internal sealed class Program\n {\n private static void Worker(object arg, int id)\n {\n var sem = arg as SemaphoreSlim;\n sem.Wait();\n Console.WriteLine(\"Thread {0} has a semaphore & is now working.\", id);\n Thread.Sleep(2*1000);\n Console.WriteLine(\"#{0} done.\", id);\n sem.Release();\n }\n\n private static void Main()\n {\n var semaphore = new SemaphoreSlim(Environment.ProcessorCount*2, int.MaxValue);\n\n Console.WriteLine(\"You have {0} processors availiabe\", Environment.ProcessorCount);\n Console.WriteLine(\"This program will use {0} semaphores.\\n\", semaphore.CurrentCount);\n\n Parallel.For(0, Environment.ProcessorCount*3, y => Worker(semaphore, y));\n }\n }\n}\n","language":"C-sharp"},{"code":"module meteredconcurrency ;\nimport std.stdio ;\nimport std.thread ;\nimport std.c.time ;\n\nclass Semaphore {\n private int lockCnt, maxCnt ;\n this(int count) { maxCnt = lockCnt = count ;}\n void acquire() {\n if(lockCnt < 0 || maxCnt <= 0)\n throw new Exception(\"Negative Lock or Zero init. Lock\") ;\n while(lockCnt == 0)\n Thread.getThis.yield ; // let other threads release lock\n synchronized lockCnt-- ;\n }\n void release() {\n synchronized\n if (lockCnt < maxCnt)\n lockCnt++ ;\n else\n throw new Exception(\"Release lock before acquire\") ;\n }\n int getCnt() { synchronized return lockCnt ; }\n}\n\nclass Worker : Thread {\n private static int Id = 0 ;\n private Semaphore lock ;\n private int myId ;\n this (Semaphore l) { super() ; lock = l ; myId = Id++ ; }\n override int run() {\n lock.acquire ;\n writefln(\"Worker %d got a lock(%d left).\", myId, lock.getCnt) ;\n msleep(2000) ; // wait 2.0 sec\n lock.release ;\n writefln(\"Worker %d released a lock(%d left).\", myId, lock.getCnt) ;\n return 0 ;\n }\n}\n\nvoid main() {\n Worker[10] crew ;\n Semaphore lock = new Semaphore(4) ;\n\n foreach(inout c ; crew)\n (c = new Worker(lock)).start ;\n foreach(inout c ; crew)\n c.wait ;\n}\n","language":"D"},{"code":"module metered;\n\nimport tools.threads, tools.log, tools.time, tools.threadpool;\n\nvoid main() {\n log_threads = false;\n auto done = new Semaphore, lock = new Semaphore(4);\n auto tp = new Threadpool(10);\n for (int i = 0; i < 10; ++i) {\n tp.addTask(i /apply/ (int i) {\n scope(exit) done.release;\n lock.acquire;\n logln(i, \": lock acquired\");\n sleep(2.0);\n lock.release;\n logln(i, \": lock released\");\n });\n }\n for (int i = 0; i < 10; ++i)\n done.acquire;\n}\n","language":"D"},{"code":"def makeSemaphore(maximum :(int > 0)) {\n var current := 0\n def waiters := <elib:vat.makeQueue>()\n def notify() {\n while (current < maximum && waiters.hasMoreElements()) {\n current += 1\n waiters.optDequeue().resolve(def released)\n when (released) -> {\n current -= 1\n notify()\n }\n }\n }\n def semaphore {\n to acquire() {\n waiters.enqueue(def response)\n notify()\n return response\n }\n to count() { return current }\n }\n return semaphore\n}\n\ndef work(label, interval, semaphore, timer, println) {\n when (def releaser := semaphore <- acquire()) -> {\n println(`$label: I have acquired the lock.`)\n releaser.resolve(\n timer.whenPast(timer.now() + interval, fn {\n println(`$label: I will have released the lock.`)\n })\n )\n }\n}\n\ndef semaphore := makeSemaphore(3)\nfor i in 1..5 {\n work(i, 2000, semaphore, timer, println)\n}\n","language":"E"},{"code":"(require 'tasks) ;; tasks library\n\n(define (task id)\n\t(wait S) ;; acquire, p-op\n\t(printf \"task %d acquires semaphore @ %a\" id (date->time-string (current-date)))\n\t(sleep 2000)\n\t(signal S) ;; release, v-op\n\tid)\n\t\n(define S (make-semaphore 4)) ;; semaphore with init count 4\n\n;; run 10 // tasks\n(for ([i 10]) (task-run (make-task task i ) (random 500)))\n","language":"EchoLisp"},{"code":"-module(metered).\n-compile(export_all).\n\ncreate_semaphore(N) ->\n spawn(?MODULE, sem_loop, [N,N]).\n\nsem_loop(0,Max) ->\n io:format(\"Resources exhausted~n\"),\n receive\n {release, PID} ->\n PID ! released,\n sem_loop(1,Max);\n {stop, _PID} ->\n ok\n end;\nsem_loop(N,N) ->\n receive\n {acquire, PID} ->\n PID ! acquired,\n sem_loop(N-1,N);\n {stop, _PID} ->\n ok\n end;\nsem_loop(N,Max) ->\n receive\n {release, PID} ->\n PID ! released,\n sem_loop(N+1,Max);\n {acquire, PID} ->\n PID ! acquired,\n sem_loop(N-1,Max);\n {stop, _PID} ->\n ok\n end.\n\nrelease(Sem) ->\n Sem ! {release, self()},\n receive\n released ->\n ok\n end.\nacquire(Sem) ->\n Sem ! {acquire, self()},\n receive\n acquired ->\n ok\n end.\n\nstart() -> create_semaphore(10).\n\nstop(Sem) -> Sem ! {stop, self()}.\n\nworker(P,N,Sem) ->\n acquire(Sem),\n io:format(\"Worker ~b has the acquired semaphore~n\",[N]),\n timer:sleep(500 * random:uniform(4)),\n release(Sem),\n io:format(\"Worker ~b has released the semaphore~n\",[N]),\n P ! {done, self()}.\n\ntest() ->\n Sem = start(),\n Pids = lists:map(fun (N) ->\n spawn(?MODULE, worker, [self(),N,Sem])\n end, lists:seq(1,20)),\n lists:foreach(fun (P) -> receive {done, P} -> ok end end, Pids),\n stop(Sem).\n","language":"Erlang"},{"code":"sequence sems\nsems = {}\nconstant COUNTER = 1, QUEUE = 2\n\nfunction semaphore(integer n)\n if n > 0 then\n sems = append(sems,{n,{}})\n return length(sems)\n else\n return 0\n end if\nend function\n\nprocedure acquire(integer id)\n if sems[id][COUNTER] = 0 then\n task_suspend(task_self())\n sems[id][QUEUE] &= task_self()\n task_yield()\n end if\n sems[id][COUNTER] -= 1\nend procedure\n\nprocedure release(integer id)\n sems[id][COUNTER] += 1\n if length(sems[id][QUEUE])>0 then\n task_schedule(sems[id][QUEUE][1],1)\n sems[id][QUEUE] = sems[id][QUEUE][2..$]\n end if\nend procedure\n\nfunction count(integer id)\n return sems[id][COUNTER]\nend function\n\nprocedure delay(atom delaytime)\n atom t\n t = time()\n while time() - t < delaytime do\n task_yield()\n end while\nend procedure\n\ninteger sem\n\nprocedure worker()\n acquire(sem)\n printf(1,\"- Task %d acquired semaphore.\\n\",task_self())\n delay(2)\n release(sem)\n printf(1,\"+ Task %d released semaphore.\\n\",task_self())\nend procedure\n\ninteger task\n\nsem = semaphore(4)\n\nfor i = 1 to 10 do\n task = task_create(routine_id(\"worker\"),{})\n task_schedule(task,1)\n task_yield()\nend for\n\nwhile length(task_list())>1 do\n task_yield()\nend while\n","language":"Euphoria"},{"code":"USING: calendar calendar.format concurrency.combinators\nconcurrency.semaphores formatting kernel sequences threads ;\n\n10 <iota> 2 <semaphore>\n[\n [\n dup now timestamp>hms\n \"task %d acquired semaphore at %s\\n\" printf\n 2 seconds sleep\n ] with-semaphore\n \"task %d released\\n\" printf\n] curry parallel-each\n","language":"Factor"},{"code":"#define MaxThreads 10\n\nDim Shared As Any Ptr ttylock\n\n' Teletype unfurls some text across the screen at a given location\nSub teletype(Byref texto As String, Byval x As Integer, Byval y As Integer)\n ' This MutexLock makes simultaneously running threads wait for each other,\n ' so only one at a time can continue and print output.\n ' Otherwise, their Locates would interfere, since there is only one cursor.\n '\n ' It's impossible to predict the order in which threads will arrive here and\n ' which one will be the first to acquire the lock thus causing the rest to wait.\n\n Mutexlock ttylock\n\n For i As Integer = 0 To (Len(texto) - 1)\n Locate x, y + i : Print Chr(texto[i])\n Sleep 25, 1\n Next i\n\n ' MutexUnlock releases the lock and lets other threads acquire it.\n Mutexunlock ttylock\nEnd Sub\n\nSub thread(Byval userdata As Any Ptr)\n Dim As Integer id = Cint(userdata)\n teletype \"Thread #\" & id & \" .........\", 1 + id, 1\nEnd Sub\n\n' Create a mutex to syncronize the threads\nttylock = Mutexcreate()\n\n' Create child threads\nDim As Any Ptr handles(0 To MaxThreads-1)\nFor i As Integer = 0 To MaxThreads-1\n handles(i) = Threadcreate(@thread, Cptr(Any Ptr, i))\n If handles(i) = 0 Then Print \"Error creating thread:\"; i : Exit For\nNext i\n\n' This is the main thread. Now wait until all child threads have finished.\nFor i As Integer = 0 To MaxThreads-1\n If handles(i) <> 0 Then Threadwait(handles(i))\nNext i\n\n' Clean up when finished\nMutexdestroy(ttylock)\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"log\"\n \"os\"\n \"sync\"\n \"time\"\n)\n\n// counting semaphore implemented with a buffered channel\ntype sem chan struct{}\n\nfunc (s sem) acquire() { s <- struct{}{} }\nfunc (s sem) release() { <-s }\nfunc (s sem) count() int { return cap(s) - len(s) }\n\n// log package serializes output\nvar fmt = log.New(os.Stdout, \"\", 0)\n\n// library analogy per WP article\nconst nRooms = 10\nconst nStudents = 20\n\nfunc main() {\n rooms := make(sem, nRooms)\n // WaitGroup used to wait for all students to have studied\n // before terminating program\n var studied sync.WaitGroup\n studied.Add(nStudents)\n // nStudents run concurrently\n for i := 0; i < nStudents; i++ {\n go student(rooms, &studied)\n }\n studied.Wait()\n}\n\nfunc student(rooms sem, studied *sync.WaitGroup) {\n rooms.acquire()\n // report per task descrption. also exercise count operation\n fmt.Printf(\"Room entered. Count is %d. Studying...\\n\",\n rooms.count())\n time.Sleep(2 * time.Second) // sleep per task description\n rooms.release()\n studied.Done() // signal that student is done\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"log\"\n \"os\"\n \"sync\"\n \"time\"\n)\n\nvar fmt = log.New(os.Stdout, \"\", 0)\n\ntype countSem struct {\n int\n sync.Cond\n}\n\nfunc newCount(n int) *countSem {\n return &countSem{n, sync.Cond{L: &sync.Mutex{}}}\n}\n\nfunc (cs *countSem) count() int {\n cs.L.Lock()\n c := cs.int\n cs.L.Unlock()\n return c\n}\n\nfunc (cs *countSem) acquire() {\n cs.L.Lock()\n cs.int--\n for cs.int < 0 {\n cs.Wait()\n }\n cs.L.Unlock()\n}\n\nfunc (cs *countSem) release() {\n cs.L.Lock()\n cs.int++\n cs.L.Unlock()\n cs.Broadcast()\n}\n\nfunc main() {\n librarian := newCount(10)\n nStudents := 20\n var studied sync.WaitGroup\n studied.Add(nStudents)\n for i := 0; i < nStudents; i++ {\n go student(librarian, &studied)\n }\n studied.Wait()\n}\n\nfunc student(studyRoom *countSem, studied *sync.WaitGroup) {\n studyRoom.acquire()\n fmt.Printf(\"Room entered. Count is %d. Studying...\\n\", studyRoom.count())\n time.Sleep(2 * time.Second)\n studyRoom.release()\n studied.Done()\n}\n","language":"Go"},{"code":"class CountingSemaphore {\n private int count = 0\n private final int max\n\n CountingSemaphore(int max) { this.max = max }\n\n synchronized int acquire() {\n while (count >= max) { wait() }\n ++count\n }\n\n synchronized int release() {\n if (count) { count--; notifyAll() }\n count\n }\n\n synchronized int getCount() { count }\n}\n","language":"Groovy"},{"code":"def cs = new CountingSemaphore(4)\n(1..12).each { threadID ->\n Thread.start {\n def id = \"Thread #${(threadID as String).padLeft(2,'0')}\"\n try {\n def sCount = cs.acquire()\n println(\"${id} has acquired Semaphore at count = ${sCount}\")\n sleep(2000)\n } finally {\n println(\"${id} is releasing Semaphore at count = ${cs.count}\")\n cs.release()\n }\n }\n}\n","language":"Groovy"},{"code":"import Control.Concurrent\n ( newQSem,\n signalQSem,\n waitQSem,\n threadDelay,\n forkIO,\n newEmptyMVar,\n putMVar,\n takeMVar,\n QSem,\n MVar )\nimport Control.Monad ( replicateM_ )\n\nworker :: QSem -> MVar String -> Int -> IO ()\nworker q m n = do\n waitQSem q\n putMVar m $ \"Worker \" <> show n <> \" has acquired the lock.\"\n threadDelay 2000000 -- microseconds!\n signalQSem q\n putMVar m $ \"Worker \" <> show n <> \" has released the lock.\"\n\nmain :: IO ()\nmain = do\n q <- newQSem 3\n m <- newEmptyMVar\n let workers = 5\n prints = 2 * workers\n mapM_ (forkIO . worker q m) [1 .. workers]\n replicateM_ prints $ takeMVar m >>= putStrLn\n","language":"Haskell"},{"code":"procedure main(A)\n n := integer(A[1] | 3) # Max. number of active tasks\n m := integer(A[2] | 2) # Number of visits by each task\n k := integer(A[3] | 5) # Number of tasks\n sem := [: |mutex([])\\n :]\n every put(threads := [], (i := 1 to k, thread\n every 1 to m do {\n write(\"unit \",i,\" ready\")\n until flag := trylock(!sem)\n write(\"unit \",i,\" running\")\n delay(2000)\n write(\"unit \",i,\" done\")\n unlock(flag)\n }))\n\n every wait(!threads)\nend\n","language":"Haskell"},{"code":"metcon=: {{\n sleep=: 6!:3\n task=: {{\n 11 T. lock NB. wait\n sleep 2\n echo 'Task ',y,&\":' has the semaphore'\n 13 T. lock NB. release\n }}\n lock=: 10 T. 0\n 0&T.@'' each i.0>.4-1 T.'' NB. ensure at least four threads\n > task t.''\"0 i.10 NB. dispatch and wait for 10 tasks\n 14 T. lock NB. discard lock\n}}\n","language":"J"},{"code":" metcon''\nTask 0 has the semaphore\nTask 1 has the semaphore\nTask 2 has the semaphore\nTask 3 has the semaphore\nTask 4 has the semaphore\nTask 9 has the semaphore\nTask 5 has the semaphore\nTask 7 has the semaphore\nTask 8 has the semaphore\nTask 6 has the semaphore\n","language":"J"},{"code":"scheduledumb=: {{\n id=:'dumb',\":x:6!:9''\n wd 'pc ',id\n (t)=: u {{u 0{::n[y[erase 1{::n}} (y;t=. id,'_timer')\n wd 'ptimer ',\":?100\n}}\n\nsleep=: 6!:3 NB. seconds\ntimestamp=: 6!:1 NB. seconds\n\nacquire=: {{\n imprison y\n while. 1<count y do.\n release y\n sleep 0.1\n imprison y\n end.\n}}\n\nrelease=: {{ counter=: (<:y{counter) y} counter }}\nimprison=: {{ counter=: (>:y{counter) y} counter }}\ncount=: {{ y { counter }}\n\ncounter=: 0 0\n\ndemo=: {{\n acquire 0\n echo 'unit ',y,&\":' acquired semaphore, t=',\":timestamp''\n sleep 2\n release 0\n}}\n","language":"J"},{"code":" demo scheduledumb\"0 i.5\nunit 1 acquired semaphore, t=54683.6\nunit 0 acquired semaphore, t=54685.6\nunit 4 acquired semaphore, t=54687.7\nunit 2 acquired semaphore, t=54689.7\nunit 3 acquired semaphore, t=54691.7\n","language":"J"},{"code":"public class CountingSemaphore{\n private int lockCount = 0;\n private int maxCount;\n\n CountingSemaphore(int Max){\n maxCount = Max;\n }\n\n public synchronized void acquire() throws InterruptedException{\n while( lockCount >= maxCount){\n wait();\n }\n lockCount++;\n }\n public synchronized void release(){\n if (lockCount > 0)\n {\n lockCount--;\n notifyAll();\n }\n }\n public synchronized int getCount(){\n return lockCount;\n }\n}\n\npublic class Worker extends Thread{\n private CountingSemaphore lock;\n private int id;\n\n Worker(CountingSemaphore coordinator, int num){\n lock = coordinator;\n id = num;\n }\n Worker(){\n }\n public void run(){\n try{\n lock.acquire();\n System.out.println(\"Worker \" + id + \" has acquired the lock.\");\n sleep(2000);\n }\n catch (InterruptedException e){\n }\n finally{\n lock.release();\n }\n }\n public static void main(String[] args){\n CountingSemaphore lock = new CountingSemaphore(3);\n Worker crew[];\n crew = new Worker[5];\n for (int i = 0; i < 5; i++){\n crew[i] = new Worker(lock, i);\n crew[i].start();\n }\n\n }\n}\n","language":"Java"},{"code":"function acquire(num, sem)\n sleep(rand())\n println(\"Task $num waiting for semaphore\")\n lock(sem)\n println(\"Task $num has acquired semaphore\")\n sleep(rand())\n unlock(sem)\nend\n\n\nfunction runsem(numtasks)\n println(\"Sleeping and running $numtasks tasks.\")\n sem = Base.Threads.RecursiveSpinLock()\n @sync(\n for i in 1:numtasks\n @async acquire(i, sem)\n end)\n println(\"Done.\")\nend\n\nrunsem(4)\n","language":"Julia"},{"code":"// version 1.1.51\n\nimport java.util.concurrent.Semaphore\nimport kotlin.concurrent.thread\n\nfun main(args: Array<String>) {\n val numPermits = 4\n val numThreads = 9\n val semaphore = Semaphore(numPermits)\n for (i in 1..numThreads) {\n thread {\n val name = \"Unit #$i\"\n semaphore.acquire()\n println(\"$name has acquired the semaphore\")\n Thread.sleep(2000)\n semaphore.release()\n println(\"$name has released the semaphore\")\n }\n }\n}\n","language":"Kotlin"},{"code":":- object(metered_concurrency).\n\n :- threaded.\n\n :- public(run/2).\n run(Workers, Max) :-\n % start the semaphore and the workers\n threaded_ignore(semaphore(Max, Max)),\n forall(\n integer::between(1, Workers, Worker),\n threaded_call(worker(Worker))\n ),\n % wait for the workers to finish\n forall(\n integer::between(1, Workers, Worker),\n threaded_exit(worker(Worker))\n ),\n % tell the semaphore thread to stop\n threaded_notify(worker(stop, _)).\n\n :- public(run/0).\n run :-\n % default values: 7 workers, 2 concurrent workers\n run(7, 2).\n\n semaphore(N, Max) :-\n threaded_wait(worker(Action, Worker)),\n ( Action == acquire, N > 0 ->\n M is N - 1,\n threaded_notify(semaphore(acquired, Worker)),\n semaphore(M, Max)\n ; Action == release ->\n M is N + 1,\n threaded_notify(semaphore(released, Worker)),\n semaphore(M, Max)\n ; Action == stop ->\n true\n ; % Action == acquire, N =:= 0,\n threaded_wait(worker(release, OtherWorker)),\n threaded_notify(semaphore(released, OtherWorker)),\n threaded_notify(semaphore(acquired, Worker)),\n semaphore(N, Max)\n ).\n\n worker(Worker) :-\n % use a random setup time for the worker\n random::random(0.0, 2.0, Setup),\n thread_sleep(Setup),\n threaded_notify(worker(acquire, Worker)),\n threaded_wait(semaphore(acquired, Worker)),\n write('Worker '), write(Worker), write(' acquired semaphore\\n'),\n thread_sleep(2),\n threaded_notify(worker(release, Worker)),\n write('Worker '), write(Worker), write(' releasing semaphore\\n'),\n threaded_wait(semaphore(released, Worker)).\n\n:- end_object.\n","language":"Logtalk"},{"code":"| ?- metered_concurrency::run.\nWorker 1 acquired semaphore\nWorker 6 acquired semaphore\nWorker 1 releasing semaphore\nWorker 2 acquired semaphore\nWorker 6 releasing semaphore\nWorker 5 acquired semaphore\nWorker 2 releasing semaphore\nWorker 7 acquired semaphore\nWorker 5 releasing semaphore\nWorker 3 acquired semaphore\nWorker 7 releasing semaphore\nWorker 4 acquired semaphore\nWorker 3 releasing semaphore\nWorker 4 releasing semaphore\nyes\n","language":"Logtalk"},{"code":"import os, posix, strformat\n\ntype SemaphoreError = object of CatchableError\n\nvar\n sem: Sem\n running = true\n\nproc init(sem: var Sem; count: Natural) =\n if sem_init(sem.addr, 0, count.cint) != 0:\n raise newException(SemaphoreError, \"unable to initialize semaphore\")\n\nproc count(sem: var Sem): int =\n var c: cint\n if sem_getvalue(sem.addr, c) != 0:\n raise newException(SemaphoreError, \"unable to get value of semaphore\")\n result = c\n\nproc acquire(sem: var Sem) =\n if sem_wait(sem.addr) != 0:\n raise newException(SemaphoreError, \"unable to acquire semaphore\")\n\nproc release(sem: var Sem) =\n if sem_post(sem.addr) != 0:\n raise newException(SemaphoreError, \"unable to get release semaphore\")\n\nproc close(sem: var Sem) =\n if sem_destroy(sem.addr) != 0:\n raise newException(SemaphoreError, \"unable to close the semaphore\")\n\nproc task(id: int) {.thread.} =\n echo &\"Task {id} started.\"\n while running:\n sem.acquire()\n echo &\"Task {id} acquired semaphore. Count is {sem.count()}.\"\n sleep(2000)\n sem.release()\n echo &\"Task {id} released semaphore. Count is {sem.count()}.\"\n sleep(100) # Give time to other tasks.\n echo &\"Task {id} terminated.\"\n\nproc stop() {.noconv.} = running = false\n\n\nvar threads: array[10, Thread[int]]\n\nsem.init(4)\nsetControlCHook(stop) # Catch control-C to terminate gracefully.\n\nfor n in 0..9: createThread(threads[n], task, n)\nthreads.joinThreads()\nsem.close()\n","language":"Nim"},{"code":"import locks, os, strformat\n\ntype Semaphore = object\n lock: Lock\n cond: Cond\n maxCount: int\n currCount: int\n\nvar\n sem: Semaphore\n running = true\n\nproc init(sem: var Semaphore; maxCount: Positive) =\n sem.lock.initLock()\n sem.cond.initCond()\n sem.maxCount = maxCount\n sem.currCount = maxCount\n\nproc count(sem: var Semaphore): int =\n sem.lock.acquire()\n result = sem.currCount\n sem.lock.release()\n\nproc acquire(sem: var Semaphore) =\n sem.lock.acquire()\n while sem.currCount == 0:\n sem.cond.wait(sem.lock)\n dec sem.currCount\n sem.lock.release()\n\nproc release(sem: var Semaphore) =\n sem.lock.acquire()\n if sem.currCount < sem.maxCount:\n inc sem.currCount\n sem.lock.release()\n sem.cond.signal()\n\nproc close(sem: var Semaphore) =\n sem.lock.deinitLock()\n sem.cond.deinitCond()\n\nproc task(id: int) {.thread.} =\n echo &\"Task {id} started.\"\n while running:\n sem.acquire()\n echo &\"Task {id} acquired semaphore.\"\n sleep(2000)\n sem.release()\n echo &\"Task {id} released semaphore.\"\n sleep(100) # Give time to other tasks.\n echo &\"Task {id} terminated.\"\n\nproc stop() {.noconv.} = running = false\n\n\nvar threads: array[10, Thread[int]]\n\nsem.init(4)\nsetControlCHook(stop) # Catch control-C to terminate gracefully.\n\nfor n in 0..9: createThread(threads[n], task, n)\nthreads.joinThreads()\nsem.close()\n","language":"Nim"},{"code":"import: parallel\n\nObject Class new: Semaphore(ch)\n\nSemaphore method: initialize(n)\n Channel newSize(n) dup := ch\n #[ 1 over send drop ] times(n) drop ;\n\nSemaphore method: acquire @ch receive drop ;\nSemaphore method: release 1 @ch send drop ;\n","language":"Oforth"},{"code":": mytask(s)\n while( true ) [\n s acquire \"Semaphore acquired\" .cr\n 2000 sleep\n s release \"Semaphore released\" .cr\n ] ;\n\n: test(n)\n| s i |\n Semaphore new(n) ->s\n 10 loop: i [ #[ s mytask ] & ] ;\n","language":"Oforth"},{"code":"declare\n fun {NewSemaphore N}\n sem(max:N count:{NewCell 0} 'lock':{NewLock} sync:{NewCell _})\n end\n\n proc {Acquire Sem=sem(max:N count:C 'lock':L sync:S)}\n Sync\n Acquired\n in\n lock L then\n if @C < N then\n C := @C + 1\n Acquired = true\n else\n Sync = @S\n Acquired = false\n end\n end\n if {Not Acquired} then\n {Wait Sync}\n {Acquire Sem}\n end\n end\n\n proc {Release sem(count:C 'lock':L sync:S ...)}\n lock L then\n C := @C - 1\n @S = unit %% wake up waiting threads\n S := _ %% prepare for new waiters\n end\n end\n\n proc {WithSemaphore Sem Proc}\n {Acquire Sem}\n try\n {Proc}\n finally\n {Release Sem}\n end\n end\n\n S = {NewSemaphore 4}\n\n proc {StartWorker Name}\n thread\n\tfor do\n\t {WithSemaphore S\n\t proc {$}\n\t {System.showInfo Name#\" acquired semaphore\"}\n\t {Delay 2000}\n\t end\n\t }\n\t {Delay 100}\n\tend\n end\n end\nin\n for I in 1..10 do\n {StartWorker I}\n end\n","language":"Oz"},{"code":"(notonline)-->\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- (tasks)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">sems</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">COUNTER</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">QUEUE</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">semaphore</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;\">if</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">sems</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sems</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,{}})</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sems</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</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;\">if</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;\">acquire</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">id</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">sems</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">id</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">COUNTER</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">task_suspend</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">task_self</span><span style=\"color: #0000FF;\">())</span>\n <span style=\"color: #000000;\">sems</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">id</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">QUEUE</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">task_self</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">task_yield</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">sems</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">id</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">COUNTER</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">1</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;\">release</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">id</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">sems</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">id</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">COUNTER</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sems</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">id</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">QUEUE</span><span style=\"color: #0000FF;\">])></span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">task_schedule</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sems</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">id</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">QUEUE</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;\">sems</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">id</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">QUEUE</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">sems</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">id</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">QUEUE</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;\">procedure</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">id</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">sems</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">id</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">COUNTER</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;\">delay</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">delaytime</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()-</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">delaytime</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">task_yield</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;\">procedure</span>\n\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">sem</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">semaphore</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">worker</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">acquire</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sem</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;\">\"- Task %d acquired semaphore.\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">task_self</span><span style=\"color: #0000FF;\">())</span>\n <span style=\"color: #000000;\">delay</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">release</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sem</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;\">\"+ Task %d released semaphore.\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">task_self</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;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</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;\">task</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">task_create</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">routine_id</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"worker\"</span><span style=\"color: #0000FF;\">),{})</span>\n <span style=\"color: #000000;\">task_schedule</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">task</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">task_yield</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">sc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</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;\">1</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">task_list</span><span style=\"color: #0000FF;\">())></span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">task_yield</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">scnew</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sem</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">scnew</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">sc</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()></span><span style=\"color: #000000;\">t0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">sc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">scnew</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;\">\"Semaphore count now %d\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">sc</span><span style=\"color: #0000FF;\">})</span>\n <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;\">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;\">while</span>\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":"(let Sem (tmp \"sem\")\n (for U 4 # Create 4 concurrent units\n (unless (fork)\n (ctl Sem\n (prinl \"Unit \" U \" aquired the semaphore\")\n (wait 2000)\n (prinl \"Unit \" U \" releasing the semaphore\") )\n (bye) ) ) )\n","language":"PicoLisp"},{"code":"#Threads=10\n#Parallels=3\nGlobal Semaphore=CreateSemaphore(#Parallels)\n\nProcedure Worker(*arg.i)\n WaitSemaphore(Semaphore)\n Debug \"Thread #\"+Str(*arg)+\" active.\"\n Delay(Random(2000))\n SignalSemaphore(Semaphore)\nEndProcedure\n\n; Start a multi-thread based work\nDim thread(#Threads)\nFor i=0 To #Threads\n thread(i)=CreateThread(@Worker(),i)\nNext\nDebug \"Launcher done.\"\n\n; Wait for all threads to finish before closing down\nFor i=0 To #Threads\n If IsThread(i)\n WaitThread(i)\n EndIf\nNext\n","language":"PureBasic"},{"code":"import time\nimport threading\n\n# Only 4 workers can run in the same time\nsem = threading.Semaphore(4)\n\nworkers = []\nrunning = 1\n\n\ndef worker():\n me = threading.currentThread()\n while 1:\n sem.acquire()\n try:\n if not running:\n break\n print '%s acquired semaphore' % me.getName()\n time.sleep(2.0)\n finally:\n sem.release()\n time.sleep(0.01) # Let others acquire\n\n# Start 10 workers\nfor i in range(10):\n t = threading.Thread(name=str(i), target=worker)\n workers.append(t)\n t.start()\n\n# Main loop\ntry:\n while 1:\n time.sleep(0.1)\nexcept KeyboardInterrupt:\n running = 0\n for t in workers:\n t.join()\n","language":"Python"},{"code":"#lang racket\n\n(define sema (make-semaphore 4)) ; allow 4 concurrent jobs\n\n;; start 20 jobs and wait for all of them to end\n(for-each\n thread-wait\n (for/list ([i 20])\n (thread (λ() (semaphore-wait sema)\n (printf \"Job #~a acquired semaphore\\n\" i)\n (sleep 2)\n (printf \"Job #~a done\\n\" i)\n (semaphore-post sema)))))\n","language":"Racket"},{"code":"class Semaphore {\n has $.tickets = Channel.new;\n method new ($max) {\n my $s = self.bless;\n $s.tickets.send(True) xx $max;\n $s;\n }\n method acquire { $.tickets.receive }\n method release { $.tickets.send(True) }\n}\n\nsub MAIN ($units = 5, $max = 2) {\n my $sem = Semaphore.new($max);\n\n my @units = do for ^$units -> $u {\n start {\n $sem.acquire; say \"unit $u acquired\";\n sleep 2;\n $sem.release; say \"unit $u released\";\n }\n }\n await @units;\n}\n","language":"Raku"},{"code":"# four workers may be concurrent\n4 semaphore as sem\n\nthread worker\n 5 each as i\n sem acquire\n # tid is thread id\n tid \"%d acquired semaphore\\n\" print\n 2000 ms\n sem release\n # let others acquire\n 100 ms\n\n# start 10 threads\ngroup\n 10 each drop worker\nlist as workers\n","language":"Raven"},{"code":"require 'thread'\n\n# Simple Semaphore implementation\nclass Semaphore\n def initialize(size = 1)\n @queue = SizedQueue.new(size)\n size.times { acquire }\n end\n\n def acquire\n tap { @queue.push(nil) }\n end\n\n def release\n tap { @queue.pop }\n end\n\n # @return [Integer]\n def count\n @queue.length\n end\n\n def synchronize\n release\n yield\n ensure\n acquire\n end\nend\n\ndef foo(id, sem)\n sem.synchronize do\n puts \"Thread #{id} Acquired lock\"\n sleep(2)\n end\nend\n\nthreads = []\nn = 5\ns = Semaphore.new(3)\nn.times do |i|\n threads << Thread.new { foo i, s }\nend\nthreads.each(&:join)\n","language":"Ruby"},{"code":"//! Rust has a perfectly good Semaphore type already. It lacks count(), though, so we can't use it\n//! directly.\n\nuse std::sync::atomic::AtomicUsize;\nuse std::sync::atomic::Ordering::SeqCst;\nuse std::sync::mpsc::channel;\nuse std::sync::Arc;\nuse std::thread::{self, spawn};\nuse std::time::Duration;\n\npub struct CountingSemaphore {\n /// Remaining resource count\n count: AtomicUsize,\n\n /// How long to sleep if a resource is being contended\n backoff: Duration,\n}\n\npub struct CountingSemaphoreGuard<'a> {\n /// A reference to the owning semaphore.\n sem: &'a CountingSemaphore,\n}\n\nimpl CountingSemaphore {\n /// Create a semaphore with `max` available resources and a linearly increasing backoff of\n /// `backoff` (used during spinlock contention).\n pub fn new(max: usize, backoff: Duration) -> CountingSemaphore {\n CountingSemaphore {\n count: AtomicUsize::new(max),\n backoff,\n }\n }\n\n /// Acquire a resource, returning a RAII CountingSemaphoreGuard.\n pub fn acquire(&self) -> CountingSemaphoreGuard {\n // Spinlock until remaining resource count is at least 1\n let mut backoff = self.backoff;\n loop {\n // Probably don't need SeqCst here, but it doesn't hurt.\n let count = self.count.load(SeqCst);\n // The check for 0 is necessary to make sure we don't go negative, which is why this\n // must be a compare-and-swap rather than a straight decrement.\n if count == 0\n || self\n .count\n .compare_exchange(count, count - 1, SeqCst, SeqCst)\n .is_err()\n {\n // Linear backoff a la Servo's spinlock contention.\n thread::sleep(backoff);\n backoff += self.backoff;\n } else {\n // We successfully acquired the resource.\n break;\n }\n }\n CountingSemaphoreGuard { sem: self }\n }\n\n // Return remaining resource count\n pub fn count(&self) -> usize {\n self.count.load(SeqCst)\n }\n}\n\nimpl<'a> Drop for CountingSemaphoreGuard<'a> {\n /// When the guard is dropped, a resource is released back to the pool.\n fn drop(&mut self) {\n self.sem.count.fetch_add(1, SeqCst);\n }\n}\n\nfn metered(duration: Duration) {\n static MAX_COUNT: usize = 4; // Total available resources\n static NUM_WORKERS: u8 = 10; // Number of workers contending for the resources\n let backoff = Duration::from_millis(1); // Linear backoff time\n // Create a shared reference to the semaphore\n let sem = Arc::new(CountingSemaphore::new(MAX_COUNT, backoff));\n // Create a channel for notifying the main task that the workers are done\n let (tx, rx) = channel();\n for i in 0..NUM_WORKERS {\n let sem = Arc::clone(&sem);\n let tx = tx.clone();\n spawn(move || {\n // Acquire the resource\n let guard = sem.acquire();\n let count = sem.count();\n // Make sure the count is legal\n assert!(count < MAX_COUNT);\n println!(\"Worker {} after acquire: count = {}\", i, count);\n // Sleep for `duration`\n thread::sleep(duration);\n // Release the resource\n drop(guard);\n // Make sure the count is legal\n let count = sem.count();\n assert!(count <= MAX_COUNT);\n println!(\"Worker {} after release: count = {}\", i, count);\n // Notify the main task of completion\n tx.send(()).unwrap();\n });\n }\n drop(tx);\n // Wait for all the subtasks to finish\n for _ in 0..NUM_WORKERS {\n rx.recv().unwrap();\n }\n}\n\nfn main() {\n // Hold each resource for 2 seconds per worker\n metered(Duration::from_secs(2));\n}\n","language":"Rust"},{"code":"class CountingSemaphore(var maxCount: Int) {\n private var lockCount = 0\n\n def acquire(): Unit = {\n while ( {\n lockCount >= maxCount\n }) wait()\n lockCount += 1\n }\n\n def release(): Unit = {\n if (lockCount > 0) {\n lockCount -= 1\n notifyAll()\n }\n }\n\n def getCount: Int = lockCount\n}\n\nobject Worker {\n def main(args: Array[String]): Unit = {\n val (lock, crew) = (new CountingSemaphore(3), new Array[Worker](5))\n\n for { i <- 0 until 5} {\n crew(i) = new Worker(lock, i)\n crew(i).start()\n }\n }\n}\n","language":"Scala"},{"code":"package require Tcl 8.6\npackage require Thread\n\n# Create the global shared state of the semaphore\nset handle semaphore0\ntsv::set $handle mutex [thread::mutex create]\ntsv::set $handle cv [thread::cond create]\ntsv::set $handle count 0\ntsv::set $handle max 3\n\n# Make five worker tasks\nfor {set i 0} {$i<5} {incr i} {\n lappend threads [thread::create -preserved {\n\t# Not bothering to wrap this in an object for demonstration\n\tproc init {handle} {\n\t global mutex cv count max\n\t set mutex [tsv::object $handle mutex]\n\t set cv [tsv::object $handle cv]\n\t set count [tsv::object $handle count]\n\t set max [tsv::get $handle max]\n\t}\n\tproc acquire {} {\n\t global mutex cv count max\n\t thread::mutex lock [$mutex get]\n\t while {[$count get] >= $max} {\n\t\tthread::cond wait [$cv get] [$mutex get]\n\t }\n\t $count incr\n\t thread::mutex unlock [$mutex get]\n\t}\n\tproc release {} {\n\t global mutex cv count max\n\t thread::mutex lock [$mutex get]\n\t if {[$count get] > 0} {\n\t\t$count incr -1\n\t\tthread::cond notify [$cv get]\n\t }\n\t thread::mutex unlock [$mutex get]\n\t}\n\n # The core task of the worker\n\tproc run {handle id} {\n\t init $handle\n\t acquire\n\t puts \"worker $id has acquired the lock\"\n\t after 2000\n\t release\n\t puts \"worker $id is done\"\n\t}\n\n # Wait for further instructions from the main thread\n\tthread::wait\n }]\n}\n\n# Start the workers doing useful work, giving each a unique id for pretty printing\nset i 0\nforeach t $threads {\n puts \"starting thread [incr i]\"\n thread::send -async $t [list run $handle $i]\n}\n\n# Wait for all the workers to finish\nforeach t $threads {\n thread::release -wait $t\n}\n","language":"Tcl"},{"code":"rm -f sem ; mkfifo sem\n\nacquire() {\n x='';while test -z \"$x\"; do read x; done;\n}\n\nrelease() {\n echo '1'\n}\n\njob() {\n n=$1; echo \"Job $n acquired Semaphore\">&2 ; sleep 2; echo \"Job $n released Semaphore\">&2 ;\n}\n\n( acquire < sem ; job 1 ; release > sem ) &\n( acquire < sem ; job 2 ; release > sem ) &\n( acquire < sem ; job 3 ; release > sem ) &\n\necho 'Initialize Jobs' >&2 ; echo '1' > sem\n","language":"UnixPipes"},{"code":"Dim sem As New Semaphore(5, 5) 'Indicates that up to 5 resources can be aquired\nsem.WaitOne() 'Blocks until a resouce can be aquired\nDim oldCount = sem.Release() 'Returns a resource to the pool\n'oldCount has the Semaphore's count before Release was called\n","language":"Visual-Basic-.NET"},{"code":"import \"scheduler\" for Scheduler\nimport \"timer\" for Timer\nimport \"./queue\" for Queue\n\nclass CountingSemaphore {\n construct new(numRes) {\n _count = numRes\n _queue = Queue.new()\n }\n\n count { _count }\n\n acquire(task) {\n if (_count > 0) {\n _count = _count - 1\n return true\n }\n _queue.push(task)\n return false\n }\n\n release() {\n if (!_queue.isEmpty) {\n var task = _queue.pop()\n task.transfer()\n } else {\n _count = _count + 1\n }\n }\n}\n\nvar numRes = 3\nvar numTasks = 6\nvar tasks = List.filled(6, null)\nvar cs = CountingSemaphore.new(numRes)\nvar main = Fiber.current\n\nvar duty = Fn.new { |n|\n System.print(\"Task %(n) started when count = %(cs.count).\")\n var acquired = cs.acquire(Fiber.current)\n if (!acquired) {\n System.print(\"Task %(n) waiting for semaphore.\")\n Fiber.yield() // return to calling fiber in the meantime\n }\n System.print(\"Task %(n) has acquired the semaphore.\")\n Scheduler.add {\n // whilst this fiber is sleeping, start the next task if there is one\n var next = n + 1\n if (next <= numTasks) {\n tasks[next-1].call(next)\n }\n }\n Timer.sleep(2000)\n System.print(\"Task %(n) has released the semaphore.\")\n cs.release()\n if (n == numTasks) main.transfer() // on completion of last task, return to main fiber\n}\n\n// create fibers for tasks\nfor (i in 0..5) tasks[i] = Fiber.new(duty)\n\n// call the first one\ntasks[0].call(1)\nSystem.print(\"\\nAll %(numTasks) tasks completed!\")\n","language":"Wren"},{"code":"fcn job(name,sem){\n name.println(\" wait\"); sem.acquire();\n name.println(\" go\"); Atomic.sleep(2);\n sem.release(); name.println(\" done\")\n}\n // start 3 threads using the same semphore\ns:=Thread.Semaphore(1);\njob.launch(\"1\",s); job.launch(\"2\",s); job.launch(\"3\",s);\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Metered_concurrency\\nnote: Concurrency\\nrequires:\\n- Concurrency\\n\",\n \"language\": \"00-META\"\n },\n {\n \"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. This task intends to demonstrate coordination of active concurrent units through the use of a passive concurrent unit. The operations for a counting semaphore are ''acquire'', ''release'', and ''count''. Each active concurrent unit should attempt to acquire the counting semaphore before executing its assigned duties. In this case the active concurrent unit should report that it has acquired the semaphore. It should sleep for 2 seconds and then release the semaphore.\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"package Semaphores is\\n protected type Counting_Semaphore(Max : Positive) is\\n entry Acquire;\\n procedure Release;\\n function Count return Natural;\\n private\\n Lock_Count : Natural := 0;\\n end Counting_Semaphore;\\nend Semaphores;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package body Semaphores is\\n\\n ------------------------\\n -- Counting_Semaphore --\\n ------------------------\\n\\n protected body Counting_Semaphore is\\n\\n -------------\\n -- Acquire --\\n -------------\\n\\n entry Acquire when Lock_Count < Max is\\n begin\\n Lock_Count := Lock_Count + 1;\\n end Acquire;\\n\\n -----------\\n -- Count --\\n -----------\\n\\n function Count return Natural is\\n begin\\n return Lock_Count;\\n end Count;\\n\\n -------------\\n -- Release --\\n -------------\\n\\n procedure Release is\\n begin\\n if Lock_Count > 0 then\\n Lock_Count := Lock_Count - 1;\\n end if;\\n end Release;\\n\\n end Counting_Semaphore;\\n\\nend Semaphores;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Semaphores;\\nwith Ada.Text_Io; use Ada.Text_Io;\\n\\nprocedure Semaphores_Main is\\n -- Create an instance of a Counting_Semaphore with Max set to 3\\n Lock : Semaphores.Counting_Semaphore(3);\\n\\n -- Define a task type to interact with the Lock object declared above\\n task type Worker is\\n entry Start (Sleep : in Duration; Id : in Positive);\\n end Worker;\\n\\n task body Worker is\\n Sleep_Time : Duration;\\n My_Id : Positive;\\n begin\\n accept Start(Sleep : in Duration; Id : in Positive) do\\n My_Id := Id;\\n Sleep_Time := Sleep;\\n end Start;\\n --Acquire the lock. The task will suspend until the Acquire call completes\\n Lock.Acquire;\\n Put_Line(\\\"Task #\\\" & Positive'Image(My_Id) & \\\" acquired the lock.\\\");\\n -- Suspend the task for Sleep_Time seconds\\n delay Sleep_Time;\\n -- Release the lock. Release is unconditional and happens without suspension\\n Lock.Release;\\n end Worker;\\n\\n -- Create an array of 5 Workers\\n type Staff is array(Positive range 1..5) of Worker;\\n Crew : Staff;\\nbegin\\n for I in Crew'range loop\\n Crew(I).Start(2.0, I);\\n end loop;\\nend Semaphores_Main;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"SEMA sem = LEVEL 1;\\n\\nPROC job = (INT n)VOID: (\\n printf(($\\\" Job \\\"d\\\" acquired Semaphore ...\\\"$,n));\\n TO 10000000 DO SKIP OD;\\n printf(($\\\" Job \\\"d\\\" releasing Semaphore\\\"l$,n))\\n);\\n\\nPAR (\\n ( DOWN sem ; job(1) ; UP sem ) ,\\n ( DOWN sem ; job(2) ; UP sem ) ,\\n ( DOWN sem ; job(3) ; UP sem )\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \" INSTALL @lib$+\\\"TIMERLIB\\\"\\n DIM tID%(6)\\n\\n REM Two workers may be concurrent\\n DIM Semaphore%(2)\\n\\n tID%(6) = FN_ontimer(11, PROCtimer6, 1)\\n tID%(5) = FN_ontimer(10, PROCtimer5, 1)\\n tID%(4) = FN_ontimer(11, PROCtimer4, 1)\\n tID%(3) = FN_ontimer(10, PROCtimer3, 1)\\n tID%(2) = FN_ontimer(11, PROCtimer2, 1)\\n tID%(1) = FN_ontimer(10, PROCtimer1, 1)\\n\\n ON CLOSE PROCcleanup : QUIT\\n ON ERROR PRINT REPORT$ : PROCcleanup : END\\n\\n sc% = 0\\n REPEAT\\n oldsc% = sc%\\n sc% = -SUM(Semaphore%())\\n IF sc%<>oldsc% PRINT \\\"Semaphore count now \\\";sc%\\n WAIT 0\\n UNTIL FALSE\\n\\n DEF PROCtimer1 : PROCtask(1) : ENDPROC\\n DEF PROCtimer2 : PROCtask(2) : ENDPROC\\n DEF PROCtimer3 : PROCtask(3) : ENDPROC\\n DEF PROCtimer4 : PROCtask(4) : ENDPROC\\n DEF PROCtimer5 : PROCtask(5) : ENDPROC\\n DEF PROCtimer6 : PROCtask(6) : ENDPROC\\n\\n DEF PROCtask(n%)\\n LOCAL i%, temp%\\n PRIVATE delay%(), sem%()\\n DIM delay%(6), sem%(6)\\n IF delay%(n%) THEN\\n delay%(n%) -= 1\\n IF delay%(n%) = 0 THEN\\n SWAP Semaphore%(sem%(n%)),temp%\\n delay%(n%) = -1\\n PRINT \\\"Task \\\" ; n% \\\" released semaphore\\\"\\n ENDIF\\n ENDPROC\\n ENDIF\\n FOR i% = 1 TO DIM(Semaphore%(),1)\\n temp% = TRUE\\n SWAP Semaphore%(i%),temp%\\n IF NOT temp% EXIT FOR\\n NEXT\\n IF temp% THEN ENDPROC : REM Waiting to acquire semaphore\\n sem%(n%) = i%\\n delay%(n%) = 200\\n PRINT \\\"Task \\\"; n% \\\" acquired semaphore\\\"\\n ENDPROC\\n\\n DEF PROCcleanup\\n LOCAL i%\\n FOR i% = 1 TO 6\\n PROC_killtimer(tID%(i%))\\n NEXT\\n ENDPROC\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <semaphore.h>\\n#include <pthread.h>\\n#include <stdlib.h>\\n#include <stdio.h>\\n#include <unistd.h>\\n\\nsem_t sem;\\nint count = 3;\\n\\n/* the whole point of a semaphore is that you don't count it:\\n * p/v are atomic. Unless it's locked while you are doing\\n * something with the count, the value is only informative */\\n#define getcount() count\\nvoid acquire()\\n{\\n\\tsem_wait(&sem);\\n\\tcount--;\\n}\\n\\nvoid release()\\n{\\n\\tcount++;\\n\\tsem_post(&sem);\\n}\\n\\nvoid* work(void * id)\\n{\\n\\tint i = 10;\\n\\twhile (i--) {\\n\\t\\tacquire();\\n\\t\\tprintf(\\\"#%d acquired sema at %d\\\\n\\\", *(int*)id, getcount());\\n\\t\\tusleep(rand() % 4000000); /* sleep 2 sec on average */\\n\\t\\trelease();\\n\\t\\tusleep(0); /* effectively yield */\\n\\t}\\n\\treturn 0;\\n}\\n\\nint main()\\n{\\n\\tpthread_t th[4];\\n\\tint i, ids[] = {1, 2, 3, 4};\\n\\n\\tsem_init(&sem, 0, count);\\n\\n\\tfor (i = 4; i--;) pthread_create(th + i, 0, work, ids + i);\\n\\tfor (i = 4; i--;) pthread_join(th[i], 0);\\n\\tprintf(\\\"all workers done\\\\n\\\");\\n\\n\\treturn sem_destroy(&sem);\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <chrono>\\n#include <iostream>\\n#include <format>\\n#include <semaphore>\\n#include <thread>\\n\\nusing namespace std::literals;\\n\\nvoid Worker(std::counting_semaphore<>& semaphore, int id)\\n{\\t\\n semaphore.acquire();\\n std::cout << std::format(\\\"Thread {} has a semaphore & is now working.\\\\n\\\", id); // response message\\n std::this_thread::sleep_for(2s);\\n std::cout << std::format(\\\"Thread {} done.\\\\n\\\", id);\\n semaphore.release();\\n}\\n\\nint main()\\n{\\n const auto numOfThreads = static_cast<int>( std::thread::hardware_concurrency() );\\n std::counting_semaphore<> semaphore{numOfThreads / 2};\\n\\n std::vector<std::jthread> tasks;\\n for (int id = 0; id < numOfThreads; ++id)\\n\\ttasks.emplace_back(Worker, std::ref(semaphore), id);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Threading;\\nusing System.Threading.Tasks;\\n\\nnamespace RosettaCode\\n{\\n internal sealed class Program\\n {\\n private static void Worker(object arg, int id)\\n {\\n var sem = arg as SemaphoreSlim;\\n sem.Wait();\\n Console.WriteLine(\\\"Thread {0} has a semaphore & is now working.\\\", id);\\n Thread.Sleep(2*1000);\\n Console.WriteLine(\\\"#{0} done.\\\", id);\\n sem.Release();\\n }\\n\\n private static void Main()\\n {\\n var semaphore = new SemaphoreSlim(Environment.ProcessorCount*2, int.MaxValue);\\n\\n Console.WriteLine(\\\"You have {0} processors availiabe\\\", Environment.ProcessorCount);\\n Console.WriteLine(\\\"This program will use {0} semaphores.\\\\n\\\", semaphore.CurrentCount);\\n\\n Parallel.For(0, Environment.ProcessorCount*3, y => Worker(semaphore, y));\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"module meteredconcurrency ;\\nimport std.stdio ;\\nimport std.thread ;\\nimport std.c.time ;\\n\\nclass Semaphore {\\n private int lockCnt, maxCnt ;\\n this(int count) { maxCnt = lockCnt = count ;}\\n void acquire() {\\n if(lockCnt < 0 || maxCnt <= 0)\\n throw new Exception(\\\"Negative Lock or Zero init. Lock\\\") ;\\n while(lockCnt == 0)\\n Thread.getThis.yield ; // let other threads release lock\\n synchronized lockCnt-- ;\\n }\\n void release() {\\n synchronized\\n if (lockCnt < maxCnt)\\n lockCnt++ ;\\n else\\n throw new Exception(\\\"Release lock before acquire\\\") ;\\n }\\n int getCnt() { synchronized return lockCnt ; }\\n}\\n\\nclass Worker : Thread {\\n private static int Id = 0 ;\\n private Semaphore lock ;\\n private int myId ;\\n this (Semaphore l) { super() ; lock = l ; myId = Id++ ; }\\n override int run() {\\n lock.acquire ;\\n writefln(\\\"Worker %d got a lock(%d left).\\\", myId, lock.getCnt) ;\\n msleep(2000) ; // wait 2.0 sec\\n lock.release ;\\n writefln(\\\"Worker %d released a lock(%d left).\\\", myId, lock.getCnt) ;\\n return 0 ;\\n }\\n}\\n\\nvoid main() {\\n Worker[10] crew ;\\n Semaphore lock = new Semaphore(4) ;\\n\\n foreach(inout c ; crew)\\n (c = new Worker(lock)).start ;\\n foreach(inout c ; crew)\\n c.wait ;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"module metered;\\n\\nimport tools.threads, tools.log, tools.time, tools.threadpool;\\n\\nvoid main() {\\n log_threads = false;\\n auto done = new Semaphore, lock = new Semaphore(4);\\n auto tp = new Threadpool(10);\\n for (int i = 0; i < 10; ++i) {\\n tp.addTask(i /apply/ (int i) {\\n scope(exit) done.release;\\n lock.acquire;\\n logln(i, \\\": lock acquired\\\");\\n sleep(2.0);\\n lock.release;\\n logln(i, \\\": lock released\\\");\\n });\\n }\\n for (int i = 0; i < 10; ++i)\\n done.acquire;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"def makeSemaphore(maximum :(int > 0)) {\\n var current := 0\\n def waiters := <elib:vat.makeQueue>()\\n def notify() {\\n while (current < maximum && waiters.hasMoreElements()) {\\n current += 1\\n waiters.optDequeue().resolve(def released)\\n when (released) -> {\\n current -= 1\\n notify()\\n }\\n }\\n }\\n def semaphore {\\n to acquire() {\\n waiters.enqueue(def response)\\n notify()\\n return response\\n }\\n to count() { return current }\\n }\\n return semaphore\\n}\\n\\ndef work(label, interval, semaphore, timer, println) {\\n when (def releaser := semaphore <- acquire()) -> {\\n println(`$label: I have acquired the lock.`)\\n releaser.resolve(\\n timer.whenPast(timer.now() + interval, fn {\\n println(`$label: I will have released the lock.`)\\n })\\n )\\n }\\n}\\n\\ndef semaphore := makeSemaphore(3)\\nfor i in 1..5 {\\n work(i, 2000, semaphore, timer, println)\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"(require 'tasks) ;; tasks library\\n\\n(define (task id)\\n\\t(wait S) ;; acquire, p-op\\n\\t(printf \\\"task %d acquires semaphore @ %a\\\" id (date->time-string (current-date)))\\n\\t(sleep 2000)\\n\\t(signal S) ;; release, v-op\\n\\tid)\\n\\t\\n(define S (make-semaphore 4)) ;; semaphore with init count 4\\n\\n;; run 10 // tasks\\n(for ([i 10]) (task-run (make-task task i ) (random 500)))\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"-module(metered).\\n-compile(export_all).\\n\\ncreate_semaphore(N) ->\\n spawn(?MODULE, sem_loop, [N,N]).\\n\\nsem_loop(0,Max) ->\\n io:format(\\\"Resources exhausted~n\\\"),\\n receive\\n {release, PID} ->\\n PID ! released,\\n sem_loop(1,Max);\\n {stop, _PID} ->\\n ok\\n end;\\nsem_loop(N,N) ->\\n receive\\n {acquire, PID} ->\\n PID ! acquired,\\n sem_loop(N-1,N);\\n {stop, _PID} ->\\n ok\\n end;\\nsem_loop(N,Max) ->\\n receive\\n {release, PID} ->\\n PID ! released,\\n sem_loop(N+1,Max);\\n {acquire, PID} ->\\n PID ! acquired,\\n sem_loop(N-1,Max);\\n {stop, _PID} ->\\n ok\\n end.\\n\\nrelease(Sem) ->\\n Sem ! {release, self()},\\n receive\\n released ->\\n ok\\n end.\\nacquire(Sem) ->\\n Sem ! {acquire, self()},\\n receive\\n acquired ->\\n ok\\n end.\\n\\nstart() -> create_semaphore(10).\\n\\nstop(Sem) -> Sem ! {stop, self()}.\\n\\nworker(P,N,Sem) ->\\n acquire(Sem),\\n io:format(\\\"Worker ~b has the acquired semaphore~n\\\",[N]),\\n timer:sleep(500 * random:uniform(4)),\\n release(Sem),\\n io:format(\\\"Worker ~b has released the semaphore~n\\\",[N]),\\n P ! {done, self()}.\\n\\ntest() ->\\n Sem = start(),\\n Pids = lists:map(fun (N) ->\\n spawn(?MODULE, worker, [self(),N,Sem])\\n end, lists:seq(1,20)),\\n lists:foreach(fun (P) -> receive {done, P} -> ok end end, Pids),\\n stop(Sem).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"sequence sems\\nsems = {}\\nconstant COUNTER = 1, QUEUE = 2\\n\\nfunction semaphore(integer n)\\n if n > 0 then\\n sems = append(sems,{n,{}})\\n return length(sems)\\n else\\n return 0\\n end if\\nend function\\n\\nprocedure acquire(integer id)\\n if sems[id][COUNTER] = 0 then\\n task_suspend(task_self())\\n sems[id][QUEUE] &= task_self()\\n task_yield()\\n end if\\n sems[id][COUNTER] -= 1\\nend procedure\\n\\nprocedure release(integer id)\\n sems[id][COUNTER] += 1\\n if length(sems[id][QUEUE])>0 then\\n task_schedule(sems[id][QUEUE][1],1)\\n sems[id][QUEUE] = sems[id][QUEUE][2..$]\\n end if\\nend procedure\\n\\nfunction count(integer id)\\n return sems[id][COUNTER]\\nend function\\n\\nprocedure delay(atom delaytime)\\n atom t\\n t = time()\\n while time() - t < delaytime do\\n task_yield()\\n end while\\nend procedure\\n\\ninteger sem\\n\\nprocedure worker()\\n acquire(sem)\\n printf(1,\\\"- Task %d acquired semaphore.\\\\n\\\",task_self())\\n delay(2)\\n release(sem)\\n printf(1,\\\"+ Task %d released semaphore.\\\\n\\\",task_self())\\nend procedure\\n\\ninteger task\\n\\nsem = semaphore(4)\\n\\nfor i = 1 to 10 do\\n task = task_create(routine_id(\\\"worker\\\"),{})\\n task_schedule(task,1)\\n task_yield()\\nend for\\n\\nwhile length(task_list())>1 do\\n task_yield()\\nend while\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"USING: calendar calendar.format concurrency.combinators\\nconcurrency.semaphores formatting kernel sequences threads ;\\n\\n10 <iota> 2 <semaphore>\\n[\\n [\\n dup now timestamp>hms\\n \\\"task %d acquired semaphore at %s\\\\n\\\" printf\\n 2 seconds sleep\\n ] with-semaphore\\n \\\"task %d released\\\\n\\\" printf\\n] curry parallel-each\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"#define MaxThreads 10\\n\\nDim Shared As Any Ptr ttylock\\n\\n' Teletype unfurls some text across the screen at a given location\\nSub teletype(Byref texto As String, Byval x As Integer, Byval y As Integer)\\n ' This MutexLock makes simultaneously running threads wait for each other,\\n ' so only one at a time can continue and print output.\\n ' Otherwise, their Locates would interfere, since there is only one cursor.\\n '\\n ' It's impossible to predict the order in which threads will arrive here and\\n ' which one will be the first to acquire the lock thus causing the rest to wait.\\n\\n Mutexlock ttylock\\n\\n For i As Integer = 0 To (Len(texto) - 1)\\n Locate x, y + i : Print Chr(texto[i])\\n Sleep 25, 1\\n Next i\\n\\n ' MutexUnlock releases the lock and lets other threads acquire it.\\n Mutexunlock ttylock\\nEnd Sub\\n\\nSub thread(Byval userdata As Any Ptr)\\n Dim As Integer id = Cint(userdata)\\n teletype \\\"Thread #\\\" & id & \\\" .........\\\", 1 + id, 1\\nEnd Sub\\n\\n' Create a mutex to syncronize the threads\\nttylock = Mutexcreate()\\n\\n' Create child threads\\nDim As Any Ptr handles(0 To MaxThreads-1)\\nFor i As Integer = 0 To MaxThreads-1\\n handles(i) = Threadcreate(@thread, Cptr(Any Ptr, i))\\n If handles(i) = 0 Then Print \\\"Error creating thread:\\\"; i : Exit For\\nNext i\\n\\n' This is the main thread. Now wait until all child threads have finished.\\nFor i As Integer = 0 To MaxThreads-1\\n If handles(i) <> 0 Then Threadwait(handles(i))\\nNext i\\n\\n' Clean up when finished\\nMutexdestroy(ttylock)\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"log\\\"\\n \\\"os\\\"\\n \\\"sync\\\"\\n \\\"time\\\"\\n)\\n\\n// counting semaphore implemented with a buffered channel\\ntype sem chan struct{}\\n\\nfunc (s sem) acquire() { s <- struct{}{} }\\nfunc (s sem) release() { <-s }\\nfunc (s sem) count() int { return cap(s) - len(s) }\\n\\n// log package serializes output\\nvar fmt = log.New(os.Stdout, \\\"\\\", 0)\\n\\n// library analogy per WP article\\nconst nRooms = 10\\nconst nStudents = 20\\n\\nfunc main() {\\n rooms := make(sem, nRooms)\\n // WaitGroup used to wait for all students to have studied\\n // before terminating program\\n var studied sync.WaitGroup\\n studied.Add(nStudents)\\n // nStudents run concurrently\\n for i := 0; i < nStudents; i++ {\\n go student(rooms, &studied)\\n }\\n studied.Wait()\\n}\\n\\nfunc student(rooms sem, studied *sync.WaitGroup) {\\n rooms.acquire()\\n // report per task descrption. also exercise count operation\\n fmt.Printf(\\\"Room entered. Count is %d. Studying...\\\\n\\\",\\n rooms.count())\\n time.Sleep(2 * time.Second) // sleep per task description\\n rooms.release()\\n studied.Done() // signal that student is done\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"log\\\"\\n \\\"os\\\"\\n \\\"sync\\\"\\n \\\"time\\\"\\n)\\n\\nvar fmt = log.New(os.Stdout, \\\"\\\", 0)\\n\\ntype countSem struct {\\n int\\n sync.Cond\\n}\\n\\nfunc newCount(n int) *countSem {\\n return &countSem{n, sync.Cond{L: &sync.Mutex{}}}\\n}\\n\\nfunc (cs *countSem) count() int {\\n cs.L.Lock()\\n c := cs.int\\n cs.L.Unlock()\\n return c\\n}\\n\\nfunc (cs *countSem) acquire() {\\n cs.L.Lock()\\n cs.int--\\n for cs.int < 0 {\\n cs.Wait()\\n }\\n cs.L.Unlock()\\n}\\n\\nfunc (cs *countSem) release() {\\n cs.L.Lock()\\n cs.int++\\n cs.L.Unlock()\\n cs.Broadcast()\\n}\\n\\nfunc main() {\\n librarian := newCount(10)\\n nStudents := 20\\n var studied sync.WaitGroup\\n studied.Add(nStudents)\\n for i := 0; i < nStudents; i++ {\\n go student(librarian, &studied)\\n }\\n studied.Wait()\\n}\\n\\nfunc student(studyRoom *countSem, studied *sync.WaitGroup) {\\n studyRoom.acquire()\\n fmt.Printf(\\\"Room entered. Count is %d. Studying...\\\\n\\\", studyRoom.count())\\n time.Sleep(2 * time.Second)\\n studyRoom.release()\\n studied.Done()\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"class CountingSemaphore {\\n private int count = 0\\n private final int max\\n\\n CountingSemaphore(int max) { this.max = max }\\n\\n synchronized int acquire() {\\n while (count >= max) { wait() }\\n ++count\\n }\\n\\n synchronized int release() {\\n if (count) { count--; notifyAll() }\\n count\\n }\\n\\n synchronized int getCount() { count }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def cs = new CountingSemaphore(4)\\n(1..12).each { threadID ->\\n Thread.start {\\n def id = \\\"Thread #${(threadID as String).padLeft(2,'0')}\\\"\\n try {\\n def sCount = cs.acquire()\\n println(\\\"${id} has acquired Semaphore at count = ${sCount}\\\")\\n sleep(2000)\\n } finally {\\n println(\\\"${id} is releasing Semaphore at count = ${cs.count}\\\")\\n cs.release()\\n }\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Control.Concurrent\\n ( newQSem,\\n signalQSem,\\n waitQSem,\\n threadDelay,\\n forkIO,\\n newEmptyMVar,\\n putMVar,\\n takeMVar,\\n QSem,\\n MVar )\\nimport Control.Monad ( replicateM_ )\\n\\nworker :: QSem -> MVar String -> Int -> IO ()\\nworker q m n = do\\n waitQSem q\\n putMVar m $ \\\"Worker \\\" <> show n <> \\\" has acquired the lock.\\\"\\n threadDelay 2000000 -- microseconds!\\n signalQSem q\\n putMVar m $ \\\"Worker \\\" <> show n <> \\\" has released the lock.\\\"\\n\\nmain :: IO ()\\nmain = do\\n q <- newQSem 3\\n m <- newEmptyMVar\\n let workers = 5\\n prints = 2 * workers\\n mapM_ (forkIO . worker q m) [1 .. workers]\\n replicateM_ prints $ takeMVar m >>= putStrLn\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main(A)\\n n := integer(A[1] | 3) # Max. number of active tasks\\n m := integer(A[2] | 2) # Number of visits by each task\\n k := integer(A[3] | 5) # Number of tasks\\n sem := [: |mutex([])\\\\n :]\\n every put(threads := [], (i := 1 to k, thread\\n every 1 to m do {\\n write(\\\"unit \\\",i,\\\" ready\\\")\\n until flag := trylock(!sem)\\n write(\\\"unit \\\",i,\\\" running\\\")\\n delay(2000)\\n write(\\\"unit \\\",i,\\\" done\\\")\\n unlock(flag)\\n }))\\n\\n every wait(!threads)\\nend\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"metcon=: {{\\n sleep=: 6!:3\\n task=: {{\\n 11 T. lock NB. wait\\n sleep 2\\n echo 'Task ',y,&\\\":' has the semaphore'\\n 13 T. lock NB. release\\n }}\\n lock=: 10 T. 0\\n 0&T.@'' each i.0>.4-1 T.'' NB. ensure at least four threads\\n > task t.''\\\"0 i.10 NB. dispatch and wait for 10 tasks\\n 14 T. lock NB. discard lock\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" metcon''\\nTask 0 has the semaphore\\nTask 1 has the semaphore\\nTask 2 has the semaphore\\nTask 3 has the semaphore\\nTask 4 has the semaphore\\nTask 9 has the semaphore\\nTask 5 has the semaphore\\nTask 7 has the semaphore\\nTask 8 has the semaphore\\nTask 6 has the semaphore\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"scheduledumb=: {{\\n id=:'dumb',\\\":x:6!:9''\\n wd 'pc ',id\\n (t)=: u {{u 0{::n[y[erase 1{::n}} (y;t=. id,'_timer')\\n wd 'ptimer ',\\\":?100\\n}}\\n\\nsleep=: 6!:3 NB. seconds\\ntimestamp=: 6!:1 NB. seconds\\n\\nacquire=: {{\\n imprison y\\n while. 1<count y do.\\n release y\\n sleep 0.1\\n imprison y\\n end.\\n}}\\n\\nrelease=: {{ counter=: (<:y{counter) y} counter }}\\nimprison=: {{ counter=: (>:y{counter) y} counter }}\\ncount=: {{ y { counter }}\\n\\ncounter=: 0 0\\n\\ndemo=: {{\\n acquire 0\\n echo 'unit ',y,&\\\":' acquired semaphore, t=',\\\":timestamp''\\n sleep 2\\n release 0\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" demo scheduledumb\\\"0 i.5\\nunit 1 acquired semaphore, t=54683.6\\nunit 0 acquired semaphore, t=54685.6\\nunit 4 acquired semaphore, t=54687.7\\nunit 2 acquired semaphore, t=54689.7\\nunit 3 acquired semaphore, t=54691.7\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class CountingSemaphore{\\n private int lockCount = 0;\\n private int maxCount;\\n\\n CountingSemaphore(int Max){\\n maxCount = Max;\\n }\\n\\n public synchronized void acquire() throws InterruptedException{\\n while( lockCount >= maxCount){\\n wait();\\n }\\n lockCount++;\\n }\\n public synchronized void release(){\\n if (lockCount > 0)\\n {\\n lockCount--;\\n notifyAll();\\n }\\n }\\n public synchronized int getCount(){\\n return lockCount;\\n }\\n}\\n\\npublic class Worker extends Thread{\\n private CountingSemaphore lock;\\n private int id;\\n\\n Worker(CountingSemaphore coordinator, int num){\\n lock = coordinator;\\n id = num;\\n }\\n Worker(){\\n }\\n public void run(){\\n try{\\n lock.acquire();\\n System.out.println(\\\"Worker \\\" + id + \\\" has acquired the lock.\\\");\\n sleep(2000);\\n }\\n catch (InterruptedException e){\\n }\\n finally{\\n lock.release();\\n }\\n }\\n public static void main(String[] args){\\n CountingSemaphore lock = new CountingSemaphore(3);\\n Worker crew[];\\n crew = new Worker[5];\\n for (int i = 0; i < 5; i++){\\n crew[i] = new Worker(lock, i);\\n crew[i].start();\\n }\\n\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function acquire(num, sem)\\n sleep(rand())\\n println(\\\"Task $num waiting for semaphore\\\")\\n lock(sem)\\n println(\\\"Task $num has acquired semaphore\\\")\\n sleep(rand())\\n unlock(sem)\\nend\\n\\n\\nfunction runsem(numtasks)\\n println(\\\"Sleeping and running $numtasks tasks.\\\")\\n sem = Base.Threads.RecursiveSpinLock()\\n @sync(\\n for i in 1:numtasks\\n @async acquire(i, sem)\\n end)\\n println(\\\"Done.\\\")\\nend\\n\\nrunsem(4)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.51\\n\\nimport java.util.concurrent.Semaphore\\nimport kotlin.concurrent.thread\\n\\nfun main(args: Array<String>) {\\n val numPermits = 4\\n val numThreads = 9\\n val semaphore = Semaphore(numPermits)\\n for (i in 1..numThreads) {\\n thread {\\n val name = \\\"Unit #$i\\\"\\n semaphore.acquire()\\n println(\\\"$name has acquired the semaphore\\\")\\n Thread.sleep(2000)\\n semaphore.release()\\n println(\\\"$name has released the semaphore\\\")\\n }\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \":- object(metered_concurrency).\\n\\n :- threaded.\\n\\n :- public(run/2).\\n run(Workers, Max) :-\\n % start the semaphore and the workers\\n threaded_ignore(semaphore(Max, Max)),\\n forall(\\n integer::between(1, Workers, Worker),\\n threaded_call(worker(Worker))\\n ),\\n % wait for the workers to finish\\n forall(\\n integer::between(1, Workers, Worker),\\n threaded_exit(worker(Worker))\\n ),\\n % tell the semaphore thread to stop\\n threaded_notify(worker(stop, _)).\\n\\n :- public(run/0).\\n run :-\\n % default values: 7 workers, 2 concurrent workers\\n run(7, 2).\\n\\n semaphore(N, Max) :-\\n threaded_wait(worker(Action, Worker)),\\n ( Action == acquire, N > 0 ->\\n M is N - 1,\\n threaded_notify(semaphore(acquired, Worker)),\\n semaphore(M, Max)\\n ; Action == release ->\\n M is N + 1,\\n threaded_notify(semaphore(released, Worker)),\\n semaphore(M, Max)\\n ; Action == stop ->\\n true\\n ; % Action == acquire, N =:= 0,\\n threaded_wait(worker(release, OtherWorker)),\\n threaded_notify(semaphore(released, OtherWorker)),\\n threaded_notify(semaphore(acquired, Worker)),\\n semaphore(N, Max)\\n ).\\n\\n worker(Worker) :-\\n % use a random setup time for the worker\\n random::random(0.0, 2.0, Setup),\\n thread_sleep(Setup),\\n threaded_notify(worker(acquire, Worker)),\\n threaded_wait(semaphore(acquired, Worker)),\\n write('Worker '), write(Worker), write(' acquired semaphore\\\\n'),\\n thread_sleep(2),\\n threaded_notify(worker(release, Worker)),\\n write('Worker '), write(Worker), write(' releasing semaphore\\\\n'),\\n threaded_wait(semaphore(released, Worker)).\\n\\n:- end_object.\\n\",\n \"language\": \"Logtalk\"\n },\n {\n \"code\": \"| ?- metered_concurrency::run.\\nWorker 1 acquired semaphore\\nWorker 6 acquired semaphore\\nWorker 1 releasing semaphore\\nWorker 2 acquired semaphore\\nWorker 6 releasing semaphore\\nWorker 5 acquired semaphore\\nWorker 2 releasing semaphore\\nWorker 7 acquired semaphore\\nWorker 5 releasing semaphore\\nWorker 3 acquired semaphore\\nWorker 7 releasing semaphore\\nWorker 4 acquired semaphore\\nWorker 3 releasing semaphore\\nWorker 4 releasing semaphore\\nyes\\n\",\n \"language\": \"Logtalk\"\n },\n {\n \"code\": \"import os, posix, strformat\\n\\ntype SemaphoreError = object of CatchableError\\n\\nvar\\n sem: Sem\\n running = true\\n\\nproc init(sem: var Sem; count: Natural) =\\n if sem_init(sem.addr, 0, count.cint) != 0:\\n raise newException(SemaphoreError, \\\"unable to initialize semaphore\\\")\\n\\nproc count(sem: var Sem): int =\\n var c: cint\\n if sem_getvalue(sem.addr, c) != 0:\\n raise newException(SemaphoreError, \\\"unable to get value of semaphore\\\")\\n result = c\\n\\nproc acquire(sem: var Sem) =\\n if sem_wait(sem.addr) != 0:\\n raise newException(SemaphoreError, \\\"unable to acquire semaphore\\\")\\n\\nproc release(sem: var Sem) =\\n if sem_post(sem.addr) != 0:\\n raise newException(SemaphoreError, \\\"unable to get release semaphore\\\")\\n\\nproc close(sem: var Sem) =\\n if sem_destroy(sem.addr) != 0:\\n raise newException(SemaphoreError, \\\"unable to close the semaphore\\\")\\n\\nproc task(id: int) {.thread.} =\\n echo &\\\"Task {id} started.\\\"\\n while running:\\n sem.acquire()\\n echo &\\\"Task {id} acquired semaphore. Count is {sem.count()}.\\\"\\n sleep(2000)\\n sem.release()\\n echo &\\\"Task {id} released semaphore. Count is {sem.count()}.\\\"\\n sleep(100) # Give time to other tasks.\\n echo &\\\"Task {id} terminated.\\\"\\n\\nproc stop() {.noconv.} = running = false\\n\\n\\nvar threads: array[10, Thread[int]]\\n\\nsem.init(4)\\nsetControlCHook(stop) # Catch control-C to terminate gracefully.\\n\\nfor n in 0..9: createThread(threads[n], task, n)\\nthreads.joinThreads()\\nsem.close()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"import locks, os, strformat\\n\\ntype Semaphore = object\\n lock: Lock\\n cond: Cond\\n maxCount: int\\n currCount: int\\n\\nvar\\n sem: Semaphore\\n running = true\\n\\nproc init(sem: var Semaphore; maxCount: Positive) =\\n sem.lock.initLock()\\n sem.cond.initCond()\\n sem.maxCount = maxCount\\n sem.currCount = maxCount\\n\\nproc count(sem: var Semaphore): int =\\n sem.lock.acquire()\\n result = sem.currCount\\n sem.lock.release()\\n\\nproc acquire(sem: var Semaphore) =\\n sem.lock.acquire()\\n while sem.currCount == 0:\\n sem.cond.wait(sem.lock)\\n dec sem.currCount\\n sem.lock.release()\\n\\nproc release(sem: var Semaphore) =\\n sem.lock.acquire()\\n if sem.currCount < sem.maxCount:\\n inc sem.currCount\\n sem.lock.release()\\n sem.cond.signal()\\n\\nproc close(sem: var Semaphore) =\\n sem.lock.deinitLock()\\n sem.cond.deinitCond()\\n\\nproc task(id: int) {.thread.} =\\n echo &\\\"Task {id} started.\\\"\\n while running:\\n sem.acquire()\\n echo &\\\"Task {id} acquired semaphore.\\\"\\n sleep(2000)\\n sem.release()\\n echo &\\\"Task {id} released semaphore.\\\"\\n sleep(100) # Give time to other tasks.\\n echo &\\\"Task {id} terminated.\\\"\\n\\nproc stop() {.noconv.} = running = false\\n\\n\\nvar threads: array[10, Thread[int]]\\n\\nsem.init(4)\\nsetControlCHook(stop) # Catch control-C to terminate gracefully.\\n\\nfor n in 0..9: createThread(threads[n], task, n)\\nthreads.joinThreads()\\nsem.close()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"import: parallel\\n\\nObject Class new: Semaphore(ch)\\n\\nSemaphore method: initialize(n)\\n Channel newSize(n) dup := ch\\n #[ 1 over send drop ] times(n) drop ;\\n\\nSemaphore method: acquire @ch receive drop ;\\nSemaphore method: release 1 @ch send drop ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \": mytask(s)\\n while( true ) [\\n s acquire \\\"Semaphore acquired\\\" .cr\\n 2000 sleep\\n s release \\\"Semaphore released\\\" .cr\\n ] ;\\n\\n: test(n)\\n| s i |\\n Semaphore new(n) ->s\\n 10 loop: i [ #[ s mytask ] & ] ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"declare\\n fun {NewSemaphore N}\\n sem(max:N count:{NewCell 0} 'lock':{NewLock} sync:{NewCell _})\\n end\\n\\n proc {Acquire Sem=sem(max:N count:C 'lock':L sync:S)}\\n Sync\\n Acquired\\n in\\n lock L then\\n if @C < N then\\n C := @C + 1\\n Acquired = true\\n else\\n Sync = @S\\n Acquired = false\\n end\\n end\\n if {Not Acquired} then\\n {Wait Sync}\\n {Acquire Sem}\\n end\\n end\\n\\n proc {Release sem(count:C 'lock':L sync:S ...)}\\n lock L then\\n C := @C - 1\\n @S = unit %% wake up waiting threads\\n S := _ %% prepare for new waiters\\n end\\n end\\n\\n proc {WithSemaphore Sem Proc}\\n {Acquire Sem}\\n try\\n {Proc}\\n finally\\n {Release Sem}\\n end\\n end\\n\\n S = {NewSemaphore 4}\\n\\n proc {StartWorker Name}\\n thread\\n\\tfor do\\n\\t {WithSemaphore S\\n\\t proc {$}\\n\\t {System.showInfo Name#\\\" acquired semaphore\\\"}\\n\\t {Delay 2000}\\n\\t end\\n\\t }\\n\\t {Delay 100}\\n\\tend\\n end\\n end\\nin\\n for I in 1..10 do\\n {StartWorker I}\\n end\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (tasks)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">sems</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">COUNTER</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">QUEUE</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">semaphore</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;\\\">if</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">sems</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sems</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,{}})</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sems</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</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;\\\">if</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;\\\">acquire</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">id</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">sems</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">id</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">COUNTER</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">task_suspend</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">task_self</span><span style=\\\"color: #0000FF;\\\">())</span>\\n <span style=\\\"color: #000000;\\\">sems</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">id</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">QUEUE</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">task_self</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">task_yield</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">sems</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">id</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">COUNTER</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">1</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;\\\">release</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">id</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">sems</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">id</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">COUNTER</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sems</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">id</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">QUEUE</span><span style=\\\"color: #0000FF;\\\">])></span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">task_schedule</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sems</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">id</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">QUEUE</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;\\\">sems</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">id</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">QUEUE</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">sems</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">id</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">QUEUE</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;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">id</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">sems</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">id</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">COUNTER</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;\\\">delay</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">delaytime</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()-</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">delaytime</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">task_yield</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;\\\">procedure</span>\\n\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">sem</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">semaphore</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">worker</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">acquire</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sem</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;\\\">\\\"- Task %d acquired semaphore.\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">task_self</span><span style=\\\"color: #0000FF;\\\">())</span>\\n <span style=\\\"color: #000000;\\\">delay</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">release</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sem</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;\\\">\\\"+ Task %d released semaphore.\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">task_self</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;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</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;\\\">task</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">task_create</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">routine_id</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"worker\\\"</span><span style=\\\"color: #0000FF;\\\">),{})</span>\\n <span style=\\\"color: #000000;\\\">task_schedule</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">task</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">task_yield</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">sc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</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;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">task_list</span><span style=\\\"color: #0000FF;\\\">())></span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">task_yield</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">scnew</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sem</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">scnew</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">sc</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()></span><span style=\\\"color: #000000;\\\">t0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">sc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">scnew</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;\\\">\\\"Semaphore count now %d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">sc</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <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;\\\">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;\\\">while</span>\\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\": \"(let Sem (tmp \\\"sem\\\")\\n (for U 4 # Create 4 concurrent units\\n (unless (fork)\\n (ctl Sem\\n (prinl \\\"Unit \\\" U \\\" aquired the semaphore\\\")\\n (wait 2000)\\n (prinl \\\"Unit \\\" U \\\" releasing the semaphore\\\") )\\n (bye) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"#Threads=10\\n#Parallels=3\\nGlobal Semaphore=CreateSemaphore(#Parallels)\\n\\nProcedure Worker(*arg.i)\\n WaitSemaphore(Semaphore)\\n Debug \\\"Thread #\\\"+Str(*arg)+\\\" active.\\\"\\n Delay(Random(2000))\\n SignalSemaphore(Semaphore)\\nEndProcedure\\n\\n; Start a multi-thread based work\\nDim thread(#Threads)\\nFor i=0 To #Threads\\n thread(i)=CreateThread(@Worker(),i)\\nNext\\nDebug \\\"Launcher done.\\\"\\n\\n; Wait for all threads to finish before closing down\\nFor i=0 To #Threads\\n If IsThread(i)\\n WaitThread(i)\\n EndIf\\nNext\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import time\\nimport threading\\n\\n# Only 4 workers can run in the same time\\nsem = threading.Semaphore(4)\\n\\nworkers = []\\nrunning = 1\\n\\n\\ndef worker():\\n me = threading.currentThread()\\n while 1:\\n sem.acquire()\\n try:\\n if not running:\\n break\\n print '%s acquired semaphore' % me.getName()\\n time.sleep(2.0)\\n finally:\\n sem.release()\\n time.sleep(0.01) # Let others acquire\\n\\n# Start 10 workers\\nfor i in range(10):\\n t = threading.Thread(name=str(i), target=worker)\\n workers.append(t)\\n t.start()\\n\\n# Main loop\\ntry:\\n while 1:\\n time.sleep(0.1)\\nexcept KeyboardInterrupt:\\n running = 0\\n for t in workers:\\n t.join()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define sema (make-semaphore 4)) ; allow 4 concurrent jobs\\n\\n;; start 20 jobs and wait for all of them to end\\n(for-each\\n thread-wait\\n (for/list ([i 20])\\n (thread (λ() (semaphore-wait sema)\\n (printf \\\"Job #~a acquired semaphore\\\\n\\\" i)\\n (sleep 2)\\n (printf \\\"Job #~a done\\\\n\\\" i)\\n (semaphore-post sema)))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"class Semaphore {\\n has $.tickets = Channel.new;\\n method new ($max) {\\n my $s = self.bless;\\n $s.tickets.send(True) xx $max;\\n $s;\\n }\\n method acquire { $.tickets.receive }\\n method release { $.tickets.send(True) }\\n}\\n\\nsub MAIN ($units = 5, $max = 2) {\\n my $sem = Semaphore.new($max);\\n\\n my @units = do for ^$units -> $u {\\n start {\\n $sem.acquire; say \\\"unit $u acquired\\\";\\n sleep 2;\\n $sem.release; say \\\"unit $u released\\\";\\n }\\n }\\n await @units;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"# four workers may be concurrent\\n4 semaphore as sem\\n\\nthread worker\\n 5 each as i\\n sem acquire\\n # tid is thread id\\n tid \\\"%d acquired semaphore\\\\n\\\" print\\n 2000 ms\\n sem release\\n # let others acquire\\n 100 ms\\n\\n# start 10 threads\\ngroup\\n 10 each drop worker\\nlist as workers\\n\",\n \"language\": \"Raven\"\n },\n {\n \"code\": \"require 'thread'\\n\\n# Simple Semaphore implementation\\nclass Semaphore\\n def initialize(size = 1)\\n @queue = SizedQueue.new(size)\\n size.times { acquire }\\n end\\n\\n def acquire\\n tap { @queue.push(nil) }\\n end\\n\\n def release\\n tap { @queue.pop }\\n end\\n\\n # @return [Integer]\\n def count\\n @queue.length\\n end\\n\\n def synchronize\\n release\\n yield\\n ensure\\n acquire\\n end\\nend\\n\\ndef foo(id, sem)\\n sem.synchronize do\\n puts \\\"Thread #{id} Acquired lock\\\"\\n sleep(2)\\n end\\nend\\n\\nthreads = []\\nn = 5\\ns = Semaphore.new(3)\\nn.times do |i|\\n threads << Thread.new { foo i, s }\\nend\\nthreads.each(&:join)\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"//! Rust has a perfectly good Semaphore type already. It lacks count(), though, so we can't use it\\n//! directly.\\n\\nuse std::sync::atomic::AtomicUsize;\\nuse std::sync::atomic::Ordering::SeqCst;\\nuse std::sync::mpsc::channel;\\nuse std::sync::Arc;\\nuse std::thread::{self, spawn};\\nuse std::time::Duration;\\n\\npub struct CountingSemaphore {\\n /// Remaining resource count\\n count: AtomicUsize,\\n\\n /// How long to sleep if a resource is being contended\\n backoff: Duration,\\n}\\n\\npub struct CountingSemaphoreGuard<'a> {\\n /// A reference to the owning semaphore.\\n sem: &'a CountingSemaphore,\\n}\\n\\nimpl CountingSemaphore {\\n /// Create a semaphore with `max` available resources and a linearly increasing backoff of\\n /// `backoff` (used during spinlock contention).\\n pub fn new(max: usize, backoff: Duration) -> CountingSemaphore {\\n CountingSemaphore {\\n count: AtomicUsize::new(max),\\n backoff,\\n }\\n }\\n\\n /// Acquire a resource, returning a RAII CountingSemaphoreGuard.\\n pub fn acquire(&self) -> CountingSemaphoreGuard {\\n // Spinlock until remaining resource count is at least 1\\n let mut backoff = self.backoff;\\n loop {\\n // Probably don't need SeqCst here, but it doesn't hurt.\\n let count = self.count.load(SeqCst);\\n // The check for 0 is necessary to make sure we don't go negative, which is why this\\n // must be a compare-and-swap rather than a straight decrement.\\n if count == 0\\n || self\\n .count\\n .compare_exchange(count, count - 1, SeqCst, SeqCst)\\n .is_err()\\n {\\n // Linear backoff a la Servo's spinlock contention.\\n thread::sleep(backoff);\\n backoff += self.backoff;\\n } else {\\n // We successfully acquired the resource.\\n break;\\n }\\n }\\n CountingSemaphoreGuard { sem: self }\\n }\\n\\n // Return remaining resource count\\n pub fn count(&self) -> usize {\\n self.count.load(SeqCst)\\n }\\n}\\n\\nimpl<'a> Drop for CountingSemaphoreGuard<'a> {\\n /// When the guard is dropped, a resource is released back to the pool.\\n fn drop(&mut self) {\\n self.sem.count.fetch_add(1, SeqCst);\\n }\\n}\\n\\nfn metered(duration: Duration) {\\n static MAX_COUNT: usize = 4; // Total available resources\\n static NUM_WORKERS: u8 = 10; // Number of workers contending for the resources\\n let backoff = Duration::from_millis(1); // Linear backoff time\\n // Create a shared reference to the semaphore\\n let sem = Arc::new(CountingSemaphore::new(MAX_COUNT, backoff));\\n // Create a channel for notifying the main task that the workers are done\\n let (tx, rx) = channel();\\n for i in 0..NUM_WORKERS {\\n let sem = Arc::clone(&sem);\\n let tx = tx.clone();\\n spawn(move || {\\n // Acquire the resource\\n let guard = sem.acquire();\\n let count = sem.count();\\n // Make sure the count is legal\\n assert!(count < MAX_COUNT);\\n println!(\\\"Worker {} after acquire: count = {}\\\", i, count);\\n // Sleep for `duration`\\n thread::sleep(duration);\\n // Release the resource\\n drop(guard);\\n // Make sure the count is legal\\n let count = sem.count();\\n assert!(count <= MAX_COUNT);\\n println!(\\\"Worker {} after release: count = {}\\\", i, count);\\n // Notify the main task of completion\\n tx.send(()).unwrap();\\n });\\n }\\n drop(tx);\\n // Wait for all the subtasks to finish\\n for _ in 0..NUM_WORKERS {\\n rx.recv().unwrap();\\n }\\n}\\n\\nfn main() {\\n // Hold each resource for 2 seconds per worker\\n metered(Duration::from_secs(2));\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"class CountingSemaphore(var maxCount: Int) {\\n private var lockCount = 0\\n\\n def acquire(): Unit = {\\n while ( {\\n lockCount >= maxCount\\n }) wait()\\n lockCount += 1\\n }\\n\\n def release(): Unit = {\\n if (lockCount > 0) {\\n lockCount -= 1\\n notifyAll()\\n }\\n }\\n\\n def getCount: Int = lockCount\\n}\\n\\nobject Worker {\\n def main(args: Array[String]): Unit = {\\n val (lock, crew) = (new CountingSemaphore(3), new Array[Worker](5))\\n\\n for { i <- 0 until 5} {\\n crew(i) = new Worker(lock, i)\\n crew(i).start()\\n }\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"package require Tcl 8.6\\npackage require Thread\\n\\n# Create the global shared state of the semaphore\\nset handle semaphore0\\ntsv::set $handle mutex [thread::mutex create]\\ntsv::set $handle cv [thread::cond create]\\ntsv::set $handle count 0\\ntsv::set $handle max 3\\n\\n# Make five worker tasks\\nfor {set i 0} {$i<5} {incr i} {\\n lappend threads [thread::create -preserved {\\n\\t# Not bothering to wrap this in an object for demonstration\\n\\tproc init {handle} {\\n\\t global mutex cv count max\\n\\t set mutex [tsv::object $handle mutex]\\n\\t set cv [tsv::object $handle cv]\\n\\t set count [tsv::object $handle count]\\n\\t set max [tsv::get $handle max]\\n\\t}\\n\\tproc acquire {} {\\n\\t global mutex cv count max\\n\\t thread::mutex lock [$mutex get]\\n\\t while {[$count get] >= $max} {\\n\\t\\tthread::cond wait [$cv get] [$mutex get]\\n\\t }\\n\\t $count incr\\n\\t thread::mutex unlock [$mutex get]\\n\\t}\\n\\tproc release {} {\\n\\t global mutex cv count max\\n\\t thread::mutex lock [$mutex get]\\n\\t if {[$count get] > 0} {\\n\\t\\t$count incr -1\\n\\t\\tthread::cond notify [$cv get]\\n\\t }\\n\\t thread::mutex unlock [$mutex get]\\n\\t}\\n\\n # The core task of the worker\\n\\tproc run {handle id} {\\n\\t init $handle\\n\\t acquire\\n\\t puts \\\"worker $id has acquired the lock\\\"\\n\\t after 2000\\n\\t release\\n\\t puts \\\"worker $id is done\\\"\\n\\t}\\n\\n # Wait for further instructions from the main thread\\n\\tthread::wait\\n }]\\n}\\n\\n# Start the workers doing useful work, giving each a unique id for pretty printing\\nset i 0\\nforeach t $threads {\\n puts \\\"starting thread [incr i]\\\"\\n thread::send -async $t [list run $handle $i]\\n}\\n\\n# Wait for all the workers to finish\\nforeach t $threads {\\n thread::release -wait $t\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"rm -f sem ; mkfifo sem\\n\\nacquire() {\\n x='';while test -z \\\"$x\\\"; do read x; done;\\n}\\n\\nrelease() {\\n echo '1'\\n}\\n\\njob() {\\n n=$1; echo \\\"Job $n acquired Semaphore\\\">&2 ; sleep 2; echo \\\"Job $n released Semaphore\\\">&2 ;\\n}\\n\\n( acquire < sem ; job 1 ; release > sem ) &\\n( acquire < sem ; job 2 ; release > sem ) &\\n( acquire < sem ; job 3 ; release > sem ) &\\n\\necho 'Initialize Jobs' >&2 ; echo '1' > sem\\n\",\n \"language\": \"UnixPipes\"\n },\n {\n \"code\": \"Dim sem As New Semaphore(5, 5) 'Indicates that up to 5 resources can be aquired\\nsem.WaitOne() 'Blocks until a resouce can be aquired\\nDim oldCount = sem.Release() 'Returns a resource to the pool\\n'oldCount has the Semaphore's count before Release was called\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"scheduler\\\" for Scheduler\\nimport \\\"timer\\\" for Timer\\nimport \\\"./queue\\\" for Queue\\n\\nclass CountingSemaphore {\\n construct new(numRes) {\\n _count = numRes\\n _queue = Queue.new()\\n }\\n\\n count { _count }\\n\\n acquire(task) {\\n if (_count > 0) {\\n _count = _count - 1\\n return true\\n }\\n _queue.push(task)\\n return false\\n }\\n\\n release() {\\n if (!_queue.isEmpty) {\\n var task = _queue.pop()\\n task.transfer()\\n } else {\\n _count = _count + 1\\n }\\n }\\n}\\n\\nvar numRes = 3\\nvar numTasks = 6\\nvar tasks = List.filled(6, null)\\nvar cs = CountingSemaphore.new(numRes)\\nvar main = Fiber.current\\n\\nvar duty = Fn.new { |n|\\n System.print(\\\"Task %(n) started when count = %(cs.count).\\\")\\n var acquired = cs.acquire(Fiber.current)\\n if (!acquired) {\\n System.print(\\\"Task %(n) waiting for semaphore.\\\")\\n Fiber.yield() // return to calling fiber in the meantime\\n }\\n System.print(\\\"Task %(n) has acquired the semaphore.\\\")\\n Scheduler.add {\\n // whilst this fiber is sleeping, start the next task if there is one\\n var next = n + 1\\n if (next <= numTasks) {\\n tasks[next-1].call(next)\\n }\\n }\\n Timer.sleep(2000)\\n System.print(\\\"Task %(n) has released the semaphore.\\\")\\n cs.release()\\n if (n == numTasks) main.transfer() // on completion of last task, return to main fiber\\n}\\n\\n// create fibers for tasks\\nfor (i in 0..5) tasks[i] = Fiber.new(duty)\\n\\n// call the first one\\ntasks[0].call(1)\\nSystem.print(\\\"\\\\nAll %(numTasks) tasks completed!\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn job(name,sem){\\n name.println(\\\" wait\\\"); sem.acquire();\\n name.println(\\\" go\\\"); Atomic.sleep(2);\\n sem.release(); name.println(\\\" done\\\")\\n}\\n // start 3 threads using the same semphore\\ns:=Thread.Semaphore(1);\\njob.launch(\\\"1\\\",s); job.launch(\\\"2\\\",s); job.launch(\\\"3\\\",s);\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Metered-concurrency"}}},{"rowIdx":487,"cells":{"solutions":{"kind":"list like","value":[{"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 indicator, and the beat pattern and tempo should be configurable.\n\nFor the purpose of this task, it is acceptable to play sound files for production of the beat notes, and an external player may be used. \n\nHowever, the playing of the sounds should not interfere with the timing of the metronome.\n\nThe visual indicator can simply be a blinking red or green area of the screen (depending on whether a high or low beat is being produced), and the metronome can be implemented using a terminal display, or optionally, a graphical display, depending on the language capabilities. \n\nIf the language has no facility to output sound, then it is permissible for this to implemented using just the visual indicator.\n<br><br>\n\n","language":"00-TASK"},{"code":"F main(bpm = 72, bpb = 4)\n V t = 60.0 / bpm\n V counter = 0\n L\n counter++\n I counter % bpb != 0\n print(‘tick’)\n E\n print(‘TICK’)\n sleep(t)\n\nmain()\n","language":"11l"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\n\n --This package is for the delay.\nwith Ada.Calendar; use Ada.Calendar;\n\n --This package adds sound\nwith Ada.Characters.Latin_1;\n\nprocedure Main is\n\nbegin\n\n Put_Line (\"Hello, this is 60 BPM\");\n\n loop\n\n Ada.Text_IO.Put (Ada.Characters.Latin_1.BEL);\n delay 0.9; --Delay in seconds. If you change to 0.0 the program will crash.\n\n end loop;\n\nend Main;\n","language":"Ada"},{"code":"set bpm to the text returned of (display dialog \"How many beats per minute?\" default answer 60)\nset pauseBetweenBeeps to (60 / bpm)\nrepeat\n\tbeep\n\tdelay pauseBetweenBeeps\nend repeat\n","language":"AppleScript"},{"code":"startMetronome: function [bpm,msr][\n freq: 60000/bpm\n i: 0\n while [true][\n loop msr-1 'x[\n prints \"\\a\"\n pause freq\n ]\n inc 'i\n print ~\"\\aAND |i|\"\n pause freq\n ]\n]\n\ntempo: to :integer arg\\0\nbeats: to :integer arg\\1\n\nstartMetronome tempo beats\n","language":"Arturo"},{"code":"bpm = 120 ; Beats per minute\npattern = 4/4 ;\nduration = 100 ; Milliseconds\nbeats = 0 ; internal counter\n\nGui -Caption\n\nStringSplit, p, pattern, /\n\nStart := A_TickCount\n\nLoop\n{\n\tGui Color, 0xFF0000\n\tGui Show, w200 h200 Na\n\tSoundBeep 750, duration\n\tbeats++\n\tSleep 1000 * 60 / bpm - duration\n\tLoop % p1 -1\n\t{\n\t\tGui Color, 0x00FF00\n\t\tGui Show, w200 h200 Na\n\t\tSoundBeep, , duration\n\t\tbeats++\n\t\tSleep 1000 * 60 / bpm - duration\n\t}\n}\n\nEsc::\n\tMsgBox % \"Metronome beeped \" beats \" beats, over \" (A_TickCount-Start)/1000 \" seconds. \"\n\tExitApp\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f METRONOME.AWK\n@load \"time\"\nBEGIN {\n metronome(120,6,10)\n metronome(72,4)\n exit(0)\n}\nfunction metronome(beats_per_min,beats_per_bar,limit, beats,delay,errors) {\n print(\"\")\n if (beats_per_min+0 <= 0) { print(\"error: beats per minute is invalid\") ; errors++ }\n if (beats_per_bar+0 <= 0) { print(\"error: beats per bar is invalid\") ; errors++ }\n if (limit+0 <= 0) { limit = 999999 }\n if (errors > 0) { return }\n delay = 60 / beats_per_min\n printf(\"delay=%f\",delay)\n while (beats < limit) {\n printf((beats++ % beats_per_bar == 0) ? \"\\nTICK\" : \" tick\")\n sleep(delay)\n }\n}\n","language":"AWK"},{"code":" BeatPattern$ = \"HLLL\"\n Tempo% = 100\n\n *font Arial,36\n REPEAT\n FOR beat% = 1 TO LEN(BeatPattern$)\n IF MID$(BeatPattern$, beat%, 1) = \"H\" THEN\n SOUND 1,-15,148,1\n ELSE\n SOUND 1,-15,100,1\n ENDIF\n VDU 30\n COLOUR 2\n PRINT LEFT$(BeatPattern$,beat%-1);\n COLOUR 9\n PRINT MID$(BeatPattern$,beat%,1);\n COLOUR 2\n PRINT MID$(BeatPattern$,beat%+1);\n WAIT 6000/Tempo%\n NEXT\n UNTIL FALSE\n","language":"BBC-BASIC"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <stdint.h>\n#include <signal.h>\n#include <time.h>\n#include <sys/time.h>\n\nstruct timeval start, last;\n\ninline int64_t tv_to_u(struct timeval s)\n{\n\treturn s.tv_sec * 1000000 + s.tv_usec;\n}\n\ninline struct timeval u_to_tv(int64_t x)\n{\n\tstruct timeval s;\n\ts.tv_sec = x / 1000000;\n\ts.tv_usec = x % 1000000;\n\treturn s;\n}\n\nvoid draw(int dir, int64_t period, int64_t cur, int64_t next)\n{\n\tint len = 40 * (next - cur) / period;\n\tint s, i;\n\n\tif (len > 20) len = 40 - len;\n\ts = 20 + (dir ? len : -len);\n\n\tprintf(\"\\033[H\");\n\tfor (i = 0; i <= 40; i++) putchar(i == 20 ? '|': i == s ? '#' : '-');\n}\n\nvoid beat(int delay)\n{\n\tstruct timeval tv = start;\n\tint dir = 0;\n\tint64_t d = 0, corr = 0, slp, cur, next = tv_to_u(start) + delay;\n\tint64_t draw_interval = 20000;\n\tprintf(\"\\033[H\\033[J\");\n\twhile (1) {\n\t\tgettimeofday(&tv, 0);\n\t\tslp = next - tv_to_u(tv) - corr;\n\t\tusleep(slp);\n\t\tgettimeofday(&tv, 0);\n\n\t\tputchar(7); /* bell */\n\t\tfflush(stdout);\n\n\t\tprintf(\"\\033[5;1Hdrift: %d compensate: %d (usec) \",\n\t\t\t(int)d, (int)corr);\n\t\tdir = !dir;\n\n\t\tcur = tv_to_u(tv);\n\t\td = cur - next;\n\t\tcorr = (corr + d) / 2;\n\t\tnext += delay;\n\n\t\twhile (cur + d + draw_interval < next) {\n\t\t\tusleep(draw_interval);\n\t\t\tgettimeofday(&tv, 0);\n\t\t\tcur = tv_to_u(tv);\n\t\t\tdraw(dir, delay, cur, next);\n\t\t\tfflush(stdout);\n\t\t}\n\t}\n}\n\nint main(int c, char**v)\n{\n\tint bpm;\n\n\tif (c < 2 || (bpm = atoi(v[1])) <= 0) bpm = 60;\n\tif (bpm > 600) {\n\t\tfprintf(stderr, \"frequency %d too high\\n\", bpm);\n\t\texit(1);\n\t}\n\n\tgettimeofday(&start, 0);\n\tlast = start;\n\tbeat(60 * 1000000 / bpm);\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <chrono>\n#include <cstdint>\n#include <iostream>\n#include <thread>\n\nclass Metronome {\npublic:\n\tMetronome(const int32_t& aBeats_per_minute, const int32_t& aMeasure, const int32_t& aDuration_in_minutes)\n\t: beats_per_minute(aBeats_per_minute), measure(aMeasure), duration_in_minutes(aDuration_in_minutes) {\n\t\tcounter = 0;\n\t}\n\n\tvoid start() {\n\t\twhile ( counter < duration_in_minutes * beats_per_minute ) {\n\t\t\tstart_time = std::chrono::system_clock::now();\n\n\t\t\tstd::this_thread::sleep_until(time_to_awake());\n\t\t\tcounter++;\n\t\t\tif ( counter % measure != 0 ) {\n\t\t\t\tstd::cout << \"Tick \" << std::flush;\n\t\t\t} else {\n\t\t\t\tstd::cout << \"Tock\" << std::endl;\n\t\t\t}\n\t\t}\n\t}\n\nprivate:\n\tstd::chrono::system_clock::time_point time_to_awake() const {\n\t\treturn start_time + std::chrono::seconds(1);\n\t}\n\n\tstd::chrono::system_clock::time_point start_time;\n\tint32_t counter;\n\n\tconst int32_t beats_per_minute, measure, duration_in_minutes;\n};\n\nint main() {\n\tMetronome metronome(60, 4, 1);\n\tmetronome.start();\n}\n","language":"C++"},{"code":"using System;\nusing System.Threading;\n\npublic class Program\n{\n public static void Main(string[] args)\n {\n Metronome metronome1 = new Metronome(120, 4);\n metronome1.Start();\n }\n}\n\npublic class Metronome\n{\n private double bpm;\n private int measure;\n private int counter;\n\n public Metronome(double bpm, int measure)\n {\n this.bpm = bpm;\n this.measure = measure;\n }\n\n public void Start()\n {\n Thread thread = new Thread(() =>\n {\n while (true)\n {\n try\n {\n Thread.Sleep((int)(1000 * (60.0 / bpm)));\n }\n catch (ThreadInterruptedException e)\n {\n Console.WriteLine(e.StackTrace);\n }\n counter++;\n if (counter % measure == 0)\n {\n Console.WriteLine(\"TICK\");\n }\n else\n {\n Console.WriteLine(\"TOCK\");\n }\n }\n });\n\n thread.Start();\n }\n}\n","language":"C-sharp"},{"code":"(ql:quickload '(cl-openal cl-alc))\n\n(defparameter *short-max* (- (expt 2 15) 1))\n(defparameter *2-pi* (* 2 pi))\n\n(defun make-sin (period)\n \"Create a generator for a sine wave of the given PERIOD.\"\n (lambda (x)\n (sin (* *2-pi* (/ x period)))))\n\n(defun make-tone (length frequency sampling-frequency)\n \"Create a vector containing sound information of the given LENGTH,\nFREQUENCY, and SAMPLING-FREQUENCY.\"\n (let ((data (make-array (truncate (* length sampling-frequency))\n :element-type '(signed-byte 16)))\n (generator (make-sin (/ sampling-frequency frequency))))\n (dotimes (i (length data))\n (setf (aref data i)\n (truncate (* *short-max* (funcall generator i)))))\n data))\n\n(defun internal-time-ms ()\n \"Get the process's real time in ms.\"\n (* 1000 (/ (get-internal-real-time) internal-time-units-per-second)))\n\n(defun spin-wait (next-real-time)\n \"Wait until the process's real time has reached the given time.\"\n (loop while (< (internal-time-ms) next-real-time)))\n\n(defun upload (buffer data sampling-frequency)\n \"Upload the given vector DATA to a BUFFER at the given SAMPLING-FREQUENCY.\"\n (cffi:with-pointer-to-vector-data (data-ptr data)\n (al:buffer-data buffer :mono16 data-ptr (* 2 (length data))\n sampling-frequency)))\n\n(defun metronome (beats/minute pattern &optional (sampling-frequency 44100))\n \"Play a metronome until interrupted.\"\n (let ((ms/beat (/ 60000 beats/minute)))\n (alc:with-device (device)\n (alc:with-context (context device)\n (alc:make-context-current context)\n (al:with-buffer (low-buffer)\n (al:with-buffer (high-buffer)\n (al:with-source (source)\n (al:source source :gain 0.5)\n (flet ((play-it (buffer)\n (al:source source :buffer buffer)\n (al:source-play source))\n (upload-it (buffer time frequency)\n (upload buffer\n (make-tone time frequency sampling-frequency)\n sampling-frequency)))\n (upload-it low-buffer 0.1 440)\n (upload-it high-buffer 0.15 880)\n (let ((next-scheduled-tone (internal-time-ms)))\n (loop\n (loop for symbol in pattern do\n (spin-wait next-scheduled-tone)\n (incf next-scheduled-tone ms/beat)\n (case symbol\n (l (play-it low-buffer))\n (h (play-it high-buffer)))\n (princ symbol))\n (terpri)))))))))))\n","language":"Common-Lisp"},{"code":"program Metronome;\n\n{$APPTYPE CONSOLE}\n\nuses\n Winapi.Windows,\n System.SysUtils;\n\nprocedure StartMetronome(bpm: double; measure: Integer);\nvar\n counter: Integer;\nbegin\n counter := 0;\n while True do\n begin\n Sleep(Trunc(1000 * (60.0 / bpm)));\n inc(counter);\n if counter mod measure = 0 then\n writeln('TICK')\n else\n writeln('TOCK');\n end;\nend;\n\nbegin\n StartMetronome(120, 4);\nend.\n","language":"Delphi"},{"code":";; available preloaded sounds are : ok, ko, tick, tack, woosh, beep, digit .\n(lib 'timer)\n\n(define (metronome) (blink) (play-sound 'tack))\n(at-every 1000 'metronome) ;; every 1000 msec\n;; CTRL-C to stop\n","language":"EchoLisp"},{"code":"open System\nopen System.Threading\n// You can use .wav files for your clicks.\n// If used, make sure they are in the same file\n// as this program's executable file.\nlet high_pitch =\n new System.Media.SoundPlayer(\"Ping Hi.wav\")\nlet low_pitch =\n new System.Media.SoundPlayer(\"Ping Low.wav\")\nlet factor x y = x / y\n// Notice that exact bpm would not work by using\n// Thread.Sleep() as there are additional function calls\n// that would consume a miniscule amount of time.\n// This number may need to be adjusted based on the cpu.\nlet cpu_error = -750.0\nlet print = function\n| 1 -> high_pitch.Play(); printf \"\\nTICK \"\n| _ -> low_pitch.Play(); printf \"tick \"\nlet wait (time:int) =\n Thread.Sleep(time)\n// Composition of functions\nlet tick = float>>factor (60000.0+cpu_error)>>int>>wait\nlet rec play beats_per_measure current_beat beats_per_minute =\n match current_beat, beats_per_measure with\n | a, b ->\n current_beat |> print\n beats_per_minute |> tick\n if a <> b then\n beats_per_minute |> play beats_per_measure (current_beat + 1)\n[<EntryPointAttribute>]\nlet main (args : string[]) =\n let tempo, beats = int args.[0], int args.[1]\n Seq.initInfinite (fun i -> i + 1)\n |> Seq.iter (fun _ -> tempo |> play beats 1 |> ignore)\n 0\n","language":"F-Sharp"},{"code":"USING: accessors calendar circular colors.constants colors.hsv\ncommand-line continuations io kernel math math.parser namespaces\nopenal.example sequences system timers ui ui.gadgets\nui.pens.solid ;\nIN: rosetta-code.metronome\n\n: bpm>duration ( bpm -- duration ) 60 swap / seconds ;\n\n: blink-gadget ( gadget freq -- )\n 1.0 1.0 1.0 <hsva> <solid> >>interior relayout-1 ;\n\n: blank-gadget ( gadget -- )\n COLOR: white <solid> >>interior relayout-1 ;\n\n: play-note ( gadget freq -- )\n [ blink-gadget ] [ 0.3 play-sine blank-gadget ] 2bi ;\n\n: metronome-iteration ( gadget circular -- )\n [ first play-note ] [ rotate-circular ] bi ;\n\nTUPLE: metronome-gadget < gadget bpm notes timer ;\n\n: <metronome-gadget> ( bpm notes -- gadget )\n \\ metronome-gadget new swap >>notes swap >>bpm ;\n\n: metronome-quot ( gadget -- quot )\n dup notes>> <circular> [ metronome-iteration ] 2curry ;\n\n: metronome-timer ( gadget -- timer )\n [ metronome-quot ] [ bpm>> bpm>duration ] bi every ;\n\nM: metronome-gadget graft* ( gadget -- )\n [ metronome-timer ] keep timer<< ;\n\nM: metronome-gadget ungraft*\n timer>> stop-timer ;\n\nM: metronome-gadget pref-dim* drop { 200 200 } ;\n\n: metronome-defaults ( -- bpm notes ) 60 { 440 220 330 } ;\n\n: metronome-ui ( bpm notes -- ) <metronome-gadget> \"Metronome\" open-window ;\n\n: metronome-example ( -- ) metronome-defaults metronome-ui ;\n\n: validate-args ( int-args -- )\n [ length 2 < ] [ [ 0 <= ] any? ] bi or [ \"args error\" throw ] when ;\n\n: (metronome-cmdline) ( args -- bpm notes )\n [ string>number ] map dup validate-args\n unclip swap ;\n\n: metronome-cmdline ( -- bpm notes )\n command-line get [ metronome-defaults ] [ (metronome-cmdline) ] if-empty ;\n\n: print-defaults ( -- )\n metronome-defaults swap prefix\n [ \" \" write ] [ number>string write ] interleave nl ;\n\n: metronome-usage ( -- )\n \"Usage: metronome [BPM FREQUENCIES...]\" print\n \"Arguments must be non-zero\" print\n \"Example: metronome \" write print-defaults flush ;\n\n: metronome-main ( -- )\n [ [ metronome-cmdline metronome-ui ] [ drop metronome-usage 1 exit ] recover ] with-ui ;\n\nMAIN: metronome-main\n","language":"Factor"},{"code":"REM FreeBASIC no tiene la capacidad de emitir sonido de forma nativa.\nREM La función Sound no es mía, incluyo los créditos correspondientes.\n' Sound Function v0.3 For DOS/Linux/Win by yetifoot\n' Credits:\n' http://www.frontiernet.net/~fys/snd.htm\n' http://delphi.about.com/cs/adptips2003/a/bltip0303_3.htm\n#ifdef __FB_WIN32__\n#include Once \"windows.bi\"\n#endif\nSub Sound_DOS_LIN(Byval freq As Uinteger, dur As Uinteger)\n Dim t As Double\n Dim As Ushort fixed_freq = 1193181 \\ freq\n\n Asm\n mov dx, &H61 ' turn speaker on\n in al, dx\n or al, &H03\n out dx, al\n mov dx, &H43 ' get the timer ready\n mov al, &HB6\n out dx, al\n mov ax, word Ptr [fixed_freq] ' move freq to ax\n mov dx, &H42 ' port to out\n out dx, al ' out low order\n xchg ah, al\n out dx, al ' out high order\n End Asm\n\n t = Timer\n While ((Timer - t) * 1000) < dur ' wait for out specified duration\n Sleep(1)\n Wend\n\n Asm\n mov dx, &H61 ' turn speaker off\n in al, dx\n and al, &HFC\n out dx, al\n End Asm\nEnd Sub\n\nSub Sound(Byval freq As Uinteger, dur As Uinteger)\n #ifndef __fb_win32__\n ' If not windows Then call the asm version.\n Sound_DOS_LIN(freq, dur)\n #Else\n ' If Windows\n Dim osv As OSVERSIONINFO\n\n osv.dwOSVersionInfoSize = Sizeof(OSVERSIONINFO)\n GetVersionEx(@osv)\n\n Select Case osv.dwPlatformId\n Case VER_PLATFORM_WIN32_NT\n ' If NT then use Beep from API\n Beep_(freq, dur)\n Case Else\n ' If not on NT then use the same as DOS/Linux\n Sound_DOS_LIN(freq, dur)\n End Select\n #endif\nEnd Sub\n\n'----------\n\nSub metronome()\n Dim As Double bpm = 120.0 ' beats por minuto\n Dim As Long retardo = 1000*(60.0 / bpm)\n Dim As Integer bpb = 4 ' beats por compás\n Dim As Integer counter = 0 ' contador interno\n Do\n counter += 1\n If counter Mod bpb <> 0 Then\n Sound(100, 60)\n Color 10: Print \"tick \";\n Else\n Sound(119, 60)\n Color 11: Print \"TICK \"\n End If\n Sleep(retardo)\n Loop\nEnd Sub\n","language":"FreeBASIC"},{"code":"/*\nBasic Tempo Markings from slowest to fastest:\n\n• Larghissimo – very, very slow (24 bpm and under)\n• Grave – very slow (25–45 bpm)\n• Largo – broadly (40–60 bpm)\n• Lento – slowly (45–60 bpm)\n• Larghetto – rather broadly (60–66 bpm)\n• Adagio – slow & (literally (66–76 bpm)\n• Adagietto – slower than andante (72–76 bpm)\n• Andante – walking pace (76–108 bpm)\n• Andantino – slightly faster (80–108 bpm)\n• Marcia moderato – moderately, a march (83–85 bpm)\n• Andante moderato – between andante and moderato (92–112 bpm)\n• Moderato – moderately (108–120 bpm)\n• Allegretto – moderately fast (112–120 bpm)\n• Allegro moderato – not quite allegro (116–120 bpm)\n• Allegro – fast, quick, bright (120–168 bpm)\n• Vivace – lively and fast (168–176 bpm)\n• Vivacissimo – very fast and lively (172–176 bpm)\n• Allegrissimo – very fast (172–176 bpm)\n• Presto – very, very fast (168–200 bpm)\n• Prestissimo – even faster (200 bpm and over)\n*/\n\noutput file \"Metronome\"\n\ninclude \"Tlbx AVFoundation.incl\"\n\n// Uncomment next line to use external sound file, and make necessary adjustments in fn RunMetronome\n// include resources \"toc.wav\"\n\nbegin enum\n_mApplication\n_mFile\n_mEdit\n_mColor\nend enum\n\nbegin enum 1\n_iSeparator\n_iPreferences\nend enum\n\nbegin enum\n_iClose\nend enum\n\n_window = 1\nbegin enum 1\n_slider = 30\n_bpmIndicator\nend enum\n\n_initialBPM = 100\n\nvoid local fn BuildMenus\n'~'1\n// application\nmenu _mApplication, _iSeparator\nmenu _mApplication, _iPreferences,, @\"Preferences…\", @\",\"\n\n// file\nmenu _mFile, -1,, @\"File\"\nmenu _mFile, _iClose,, @\"Close\", @\"w\"\nMenuItemSetAction( _mFile, _iClose, @\"performClose:\" )\n\neditmenu _mEdit\nend fn\n\n\nvoid local fn BuildWindow\n'~'1\nNSUInteger i\n\nCGRect r = fn CGRectMake( 0, 0, 200, 500 )\nwindow _window, @\"Metronome\", r, NSWindowStyleMaskTitled + NSWindowStyleMaskClosable + NSWindowStyleMaskMiniaturizable\n\nr = fn CGRectMake( 160, 20, 32, 465 )\nslider _slider, YES, _initialBPM, r, 20, 190, _window\n\nr = fn CGRectMake( 25, 458, 24, 24 )\ncolorwell _bpmIndicator, YES, fn ColorGreen, r, NO, _window\nColorWellSetBordered( _bpmIndicator, NO )\n\nCFArrayRef tempo = @[¬\n@\"Prestissimo\", @\"Presto\", @\"Allegrissimo\", @\"Vivacissimo\", @\"Vivace\",¬\n@\"Allegro\", @\"Allegro moderato\", @\"Allegretto\", @\"Moderato\", @\"Andante moderato\",¬\n@\"Marcia moderato\", @\"Andantino\", @\"Andante\", @\"Adagietto\", @\"Adagio\", @\"Larghetto\",¬\n@\"Lento\", @\"Largo\", @\"Grave\", @\"Larghissimo\"]\n\nr = fn CGRectMake( 10, 460, 140, 22 )\nfor i = 1 to 20\ntextlabel i, tempo[i-1], r, _window\nControlSetAlignment( i, NSTextAlignmentRight )\nControlSetFontWithName( i, @\"Menlo\", 11.5 )\nr = fn CGRectOffset( r, 0, -23.2 )\nnext\nend fn\n\n\nlocal fn StopTimer\n'~'1\nCFRunLoopTimerRef t = (CFRunLoopTimerRef)fn AppProperty( @\"timer\" )\nif ( fn TimerIsValid( t ) )\nTimerInvalidate( t )\nColorWellSetColor( _bpmIndicator, fn ColorGreen )\nend if\nend fn\n\n\nlocal fn RunMetronome( bpm as CFTimeInterval )\n'~'1\n\n// Uncomment these lines to use an external sound file name toc.wave\n// CFURLRef soundURL = fn BundleURLForSoundResource( fn BundleMain, @\"toc.wav\" )\n// SoundRef tocSound = fn SoundWithContentsOfURL( soundURL, NO )\n\n// Comment this line out to use external sound file for tock sound\nSoundRef tocSound = fn SoundNamed( @\"Pop\" )\n\nCFTimeInterval interval = 60.0 / bpm\nCFRunLoopTimerRef tocTimer = timerbegin 0.0, interval, YES\nColorRef color\nif ( fn ObjectIsEqual( fn ColorWellColor( _bpmIndicator ), fn ColorGreen ) )\ncolor = fn ColorGray\nColorWellSetColor( _bpmIndicator, color )\nelse\ncolor = fn ColorGreen\nColorWellSetColor( _bpmIndicator, color )\nend if\n\nfn SoundStop( tocSound )\nfn SoundPlay( tocSound )\ntimerend\nAppSetProperty( @\"timer\", tocTimer )\nend fn\n\n\nvoid local fn DoAppEvent( ev as long )\n'~'1\nselect (ev)\ncase _appDidFinishLaunching\nfn BuildMenus\nfn BuildWindow\nfn RunMetronome( _initialBPM )\n\ncase _appShouldTerminateAfterLastWindowClosed\nAppEventSetBool(YES)\nend select\nend fn\n\n\nvoid local fn DoMenu( menuID as long, itemID as long )\n'~'1\nselect (menuID)\ncase _mApplication\nselect (itemID)\ncase _iPreferences\nend select\nend select\nend fn\n\n\nvoid local fn DoDialog( ev as long, tag as long, wnd as long )\n'~'1\nselect ( ev )\ncase _btnClick\nselect ( tag )\ncase _slider : fn StopTimer : fn RunMetronome( fn ControlIntegerValue( tag ) )\nend select\nend select\nend fn\n\non AppEvent fn DoAppEvent\non menu fn DoMenu\non dialog fn DoDialog\n\nHandleEvents\n","language":"FutureBasic"},{"code":"package main\n\nimport (\n\t\"fmt\"\n\t\"time\"\n)\n\nfunc main() {\n\tvar bpm = 72.0 // Beats Per Minute\n\tvar bpb = 4 // Beats Per Bar\n\n\td := time.Duration(float64(time.Minute) / bpm)\n\tfmt.Println(\"Delay:\", d)\n\tt := time.NewTicker(d)\n\ti := 1\n\tfor _ = range t.C {\n\t\ti--\n\t\tif i == 0 {\n\t\t\ti = bpb\n\t\t\tfmt.Printf(\"\\nTICK \")\n\t\t} else {\n\t\t\tfmt.Printf(\"tick \")\n\t\t}\n\t}\n}\n","language":"Go"},{"code":"import Control.Concurrent\nimport Control.Concurrent.MVar\nimport System.Process (runCommand)\n\n-- This program works only on the GHC compiler because of the use of\n-- threadDelay\n\ndata Beep = Stop | Hi | Low\n\ntype Pattern = [Beep]\n\ntype BeatsPerMinute = Int\n\nminute = 60000000 -- 1 minute = 60,000,000 microseconds\n\n-- give one of the following example patterns to the metronome function\n\npattern4_4 = [Hi, Low, Low, Low]\npattern2_4 = [Hi, Low]\npattern3_4 = [Hi, Low, Low]\npattern6_8 = [Hi, Low, Low, Low, Low, Low]\n\n-- use this version if you can't play audio, use Windows or don't\n-- have audio files to play\n-- beep :: Beep -> IO ()\n-- beep Stop = return ()\n-- beep Hi = putChar 'H'\n-- beep Low = putChar 'L'\n\n-- use this version if you can and want to play audio on Linux using\n-- Alsa. Change the name of the files to those of your choice\n\nbeep Stop = return ()\nbeep Hi = putChar 'H' >> runCommand \"aplay hi.wav &> /dev/null\" >> return ()\nbeep Low = putChar 'L' >> runCommand \"aplay low.wav &> /dev/null\" >> return ()\n\ntick :: MVar Pattern -> BeatsPerMinute -> IO ()\ntick b i = do\n t <- readMVar b\n case t of\n [Stop] -> return ()\n x -> do\n mapM_ (\\v -> forkIO (beep v) >> threadDelay (minute `div` i)) t\n tick b i\n\nmetronome :: Pattern -> BeatsPerMinute -> IO ()\nmetronome p i = do\n putStrLn \"Press any key to stop the metronome.\"\n b <- newMVar p\n _ <- forkIO $ tick b i\n _ <- getChar\n putMVar b [Stop]\n","language":"Haskell"},{"code":"MET=: _ _&$: :(4 : 0)\n\n 'BEL BS LF CR'=. 7 8 10 13 { a.\n '`print stime delay'=. 1!:2&4`(6!:1)`(6!:3)\n ticker=. 2 2$'\\ /'\n 'small large'=. (BEL,2#BS) ; 5#BS\n clrln=. CR,(79#' '),CR\n\n x=. 2 ({.,) x\n y=. _1 |.&.> 2 ({.,) y\n 'i j'=. 0\n print 'bpb \\ bpm \\ ' , 2#BS\n delay 1\n\n x=. ({. , ('ti t'=. stime'') + {:) x\n while. x *./@:> i,t do.\n\n 'bpb bpm'=. {.@> y=. 1 |.&.> y\n dl=. 60 % bpm\n\n print clrln,(\":bpb),' ',(ticker {~ 2 | i=. >: i),' ',(\":bpm),' '\n\n for. i. bpb do.\n print small ,~ ticker {~ 2 | j=. >: j\n delay 0 >. (t=. t + dl) - stime ''\n end.\n\n end.\n\n print clrln\n i , j , t - ti\n\n)\n\n\nNB. Basic tacit version; this is probably considered bad coding style. At least I removed the \"magic constants\". Sort of.\nNB. The above version is by far superior.\n'BEL BS LF'=: 7 8 10 { a.\n'`print delay'=: 1!:2&4`(6!:3)\nmet=: _&$: :((] ({:@] [ LF print@[ (-.@{.@] [ delay@[ print@] (BEL,2#BS) , (2 2$'\\ /') {~ {.@])^:({:@])) 1 , <.@%) 60&% [ print@('\\ '\"_))\n","language":"J"},{"code":"class Metronome{\n\tdouble bpm;\n\tint measure, counter;\n\tpublic Metronome(double bpm, int measure){\n\t\tthis.bpm = bpm;\n\t\tthis.measure = measure;\t\n\t}\n\tpublic void start(){\n\t\twhile(true){\n\t\t\ttry {\n\t\t\t\tThread.sleep((long)(1000*(60.0/bpm)));\n\t\t\t}catch(InterruptedException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tcounter++;\n\t\t\tif (counter%measure==0){\n\t\t\t\t System.out.println(\"TICK\");\n\t\t\t}else{\n\t\t\t\t System.out.println(\"TOCK\");\n\t\t\t}\n\t\t}\n\t}\n}\npublic class test {\n\tpublic static void main(String[] args) {\n\t\tMetronome metronome1 = new Metronome(120,4);\n\t\tmetronome1.start();\n\t}\n}\n","language":"Java"},{"code":"import java.awt.Color;\nimport java.awt.Dimension;\nimport java.awt.EventQueue;\nimport java.io.IOException;\nimport java.net.URL;\nimport java.util.concurrent.Executors;\nimport java.util.concurrent.ScheduledExecutorService;\nimport java.util.concurrent.TimeUnit;\n\nimport javax.sound.sampled.AudioInputStream;\nimport javax.sound.sampled.AudioSystem;\nimport javax.sound.sampled.Clip;\nimport javax.sound.sampled.LineUnavailableException;\nimport javax.sound.sampled.UnsupportedAudioFileException;\nimport javax.swing.ImageIcon;\nimport javax.swing.JFrame;\nimport javax.swing.JPanel;\n\npublic final class MetronomeTask {\n\n\tpublic static void main(String[] aArgs) {\n\t\tEventQueue.invokeLater( () -> { new Metronome(60, 4, 1).start(); } );\n\t}\t\n\n}\n\nfinal class Metronome extends JPanel {\n\t\n\tpublic Metronome(int aBeatsPerMinute, int aMeasure, int aDurationInMinutes) {\n\t\tbeatsPerMinute = aBeatsPerMinute; measure = aMeasure; durationInMinutes = aDurationInMinutes;\n\t\tSoundEffect.initialise();\n\t\tcreateAndShowGUI();\n\t}\n\t\n\tpublic void start() {\n\t\texecutorService = Executors.newSingleThreadScheduledExecutor();\n\t\texecutorService.scheduleAtFixedRate(provideService, 1, 1, TimeUnit.SECONDS);\t\n\t}\t\n\t\n\tprivate void createAndShowGUI() {\n\t\tJFrame.setDefaultLookAndFeelDecorated(true);\n frame = new JFrame(\"Metronome\");\n frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\n frame.setIconImage( new ImageIcon(\"./metronomeJava.png\").getImage() );\n frame.add(createPanel());\n frame.pack();\n\t\tframe.setLocationRelativeTo(null);\n\t\tframe.setResizable(false);\n frame.setVisible(true);\n\t}\n\t\n\tprivate JPanel createPanel() {\n\t\tsetPreferredSize( new Dimension(800, 600) );\n setBackground(Color.CYAN);\n return this;\n\t}\t\n\t\n\tprivate JFrame frame;\n\tprivate ScheduledExecutorService executorService;\n\tprivate int beatsPerMinute, measure, durationInMinutes, counter;\t\n\t\n\tprivate Runnable provideService = () -> {\t\n\t\tif ( counter < durationInMinutes * beatsPerMinute ) {\n\t\t\tcounter++;\n\t\t\tif ( counter % measure != 0 ) {\n\t\t\t\tSoundEffect.Tick.play();\n\t\t\t\tif ( getBackground() != Color.PINK ) {\n\t\t\t\t\tsetBackground(Color.PINK);\n\t\t\t\t} else {\n\t\t\t\t\tsetBackground(Color.CYAN);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tSoundEffect.Tock.play();\n\t\t\t\tsetBackground(Color.ORANGE);\n\t\t\t}\n\t\t} else {\n\t\t\texecutorService.shutdown();\n\t\t\tframe.dispose();\n\t\t\tRuntime.getRuntime().exit(0);\n\t\t}\n\t};\n\t\n}\n\nenum SoundEffect {\n\t\n Tick(\"./metronomeTickJava.wav\"), Tock(\"./metronomeTockJava.wav\");\n\t\n public static void initialise() {\n \tvalues();\n }\n\n public void play() {\n \tif ( clip.isRunning() ) {\n \t\tclip.stop();\n \t}\n\t\t\tclip.setFramePosition(0);\n\t\t\tclip.start();\n }\n\n private SoundEffect(String soundFileName) {\n \tURL url = getClass().getClassLoader().getResource(soundFileName);\n try ( AudioInputStream audioInputStream = AudioSystem.getAudioInputStream(url) ) {\n clip = AudioSystem.getClip();\n clip.open(audioInputStream);\n } catch (IOException | LineUnavailableException | UnsupportedAudioFileException ex) {\n ex.printStackTrace();\n }\n }\n\n private Clip clip;\n\n}\n","language":"Java"},{"code":"function metronome(bpm::Real=72, bpb::Int=4)\n s = 60.0 / bpm\n counter = 0\n while true\n counter += 1\n if counter % bpb != 0\n println(\"tick\")\n else\n println(\"TICK\")\n end\n sleep(s)\n end\nend\n","language":"Julia"},{"code":"// version 1.1.2\n\nfun metronome(bpm: Int, bpb: Int, maxBeats: Int = Int.MAX_VALUE) {\n val delay = 60_000L / bpm\n var beats = 0\n do {\n Thread.sleep(delay)\n if (beats % bpb == 0) print(\"\\nTICK \")\n else print(\"tick \")\n beats++\n }\n while (beats < maxBeats)\n println()\n}\n\nfun main(args: Array<String>) = metronome(120, 4, 20) // limit to 20 beats\n","language":"Kotlin"},{"code":" WindowWidth =230\n WindowHeight =220\n\n button #w.b1 \"Start\", [start], LR, 110, 90, 55, 20\n button #w.b2 \"Tempo\", [tempo], LR, 180, 90, 55, 20\n button #w.b3 \"Pattern\", [pattern], LR, 40, 90, 55, 20\n\n open \"Metronome\" for graphics_nsb_nf as #w\n\n #w \"trapclose quit\"\n #w \"down\"\n #w \"fill darkblue ; backcolor darkblue ; color white\"\n\n tempo = 60 ' per minute\n interval =1000 /(tempo /60) ' timer works in ms\n tickCount = 0 ' cycle counter\n running = 1 ' flag for state\n bar$ = \"HLLL\" ' initially strong-weak-weak-weak\n count = len( bar$)\n\n wait\n\nsub quit w$\n close #w$\n end\nend sub\n\n[start]\n if running =1 then\n running =0\n #w.b1 \"Stop\"\n #w.b2 \"!disable\"\n #w.b3 \"!disable\"\n else\n running =1\n #w.b1 \"Start\"\n #w.b2 \"!enable\"\n #w.b3 \"!enable\"\n end if\n if running =0 then timer interval, [tick] else timer 0\n wait\n\n[tempo]\n prompt \"New tempo 30...360\"; tempo$\n tempo =val( tempo$)\n tempo =min( tempo, 360)\n tempo =max( tempo, 30)\n interval =int( 1000 /(tempo /60))\n wait\n\n[pattern]\n prompt \"New Pattern, eg 'HLLL' \"; bar$\n count =len( bar$)\n if count <2 or count >8 then goto [pattern]\n\n wait\n\n[tick]\n 'beep and flash\n #w \"place 115 40\"\n\n if mid$( bar$, tickCount +1, 1) =\"H\" then\n playwave \"mHi.wav\", async\n #w \"backcolor blue ; color white ; circlefilled \"; 20 -tickCount *2\n else\n playwave \"mLo.wav\", async\n #w \"backcolor cyan ; circlefilled \"; 20 -tickCount *2\n end if\n\n #w \"place 50 140 ; backcolor darkblue ; color white\"\n #w \"\\ \"; tempo; \" beats /min.\"\n #w \"place 85 160\"\n #w \"\\\"; bar$\n\n #w \"place 85 120\"\n #w \"\\Beat # \"; tickCount +1\n\n #w \"place 115 40\"\n #w \"color darkblue\"\n\n tickCount =( tickCount +1) mod count\n\n #w \"flush\"\n\n wait\n","language":"Liberty-BASIC"},{"code":"10 bpm=120:bpb=4\n20 sleep=50*60/bpm\n30 counter=0\n40 every sleep gosub 100\n50 goto 50\n100 print counter+1;\" \";\n110 if counter=0 then print \">TICK<\":sound 1,60,10,15 else print \" tick \":sound 1,119,10\n120 counter=counter+1\n130 if counter=bpb then counter=0\n140 return\n","language":"Locomotive-Basic"},{"code":"s = Sound[Play[Sin[1000 t], {t, 0, 0.05}]];\nss = Sound[Play[Sin[2000 t], {t, 0, 0.05}]];\nbpm = 180;\nslp = 60/bpm;\ncolor = White;\ni = 0;\nDynamic[Graphics[{color, Disk[]}, ImageSize -> 50]]\nWhile[True,\n i = Mod[i + 1, 4, 1];\n color = {Green, Red, Darker@Red, Red, Darker@Red}[[i]];\n If[i == 1,\n EmitSound[ss]\n ,\n EmitSound[s]\n ];\n Pause[slp];\n ]\n","language":"Mathematica"},{"code":"import os\n\nproc metronome(tempo, pattern: Positive) =\n let delay = 60_000 div tempo # In milliseconds.\n var beats = 0\n while true:\n stdout.write if beats mod pattern == 0: \"\\nTICK\" else: \" tick\"\n stdout.flushFile\n inc beats\n sleep(delay)\n\nmetronome(72, 4)\n","language":"Nim"},{"code":"use Time::HiRes qw(sleep gettimeofday);\n\nlocal $| = 1; # autoflush\n\nmy $beats_per_minute = shift || 72;\nmy $beats_per_bar = shift || 4;\n\nmy $i = 0;\nmy $duration = 60 / $beats_per_minute;\nmy $base_time = gettimeofday() + $duration;\n\nfor (my $next_time = $base_time ; ; $next_time += $duration) {\n if ($i++ % $beats_per_bar == 0) {\n print \"\\nTICK\";\n }\n else {\n print \" tick\";\n }\n sleep($next_time - gettimeofday());\n}\n","language":"Perl"},{"code":"#!/usr/bin/perl\n\nuse strict;\nuse warnings;\nuse Tk;\n\nmy $active = 0;\nmy $bpm = 60;\nmy $x = 100;\n\nmy $mw = MainWindow->new;\n$mw->title( \"Metronome\" );\nmy $c = $mw->Canvas(\n )->pack(-fill => 'both', -expand => 1);\n$mw->Scale( -orient => 'horizontal', -from => 30, -to => 150,\n -variable => \\$bpm, -label => 'Beats per Minute',\n )->pack(-fill => 'x');\n$mw->Button( -text => 'Exit', -command => sub {$mw->destroy},\n )->pack(-side => 'right');\n$mw->Button( -text => 'Start / Pause', -command => sub {$active ^= 1; tick()},\n )->pack(-side => 'right');\n$mw->bind('<Configure>' => sub {$x = $c->width >> 2} );\n\nMainLoop;\n\nsub tick\n {\n $active or return;\n# $mw->bell;\n $x *= -1;\n $c->delete('all');\n $c->createLine( $c->width >> 1, $c->height, $c->width / 2 + $x, 30,\n -width => 5);\n $mw->after( 60_000 / $bpm / 2 => \\&tick );\n }\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\virtunome.exw\n --\n -- Originally by ghaberek\n -- Translated from win32lib by Pete Lomax\n --\n -- I will note that accuracy drops sharply above 5 beats per second.\n --</span>\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span> <span style=\"color: #000080;font-style:italic;\">-- needs some work though, usual sizing stuff [DEV]\n -- NB: don't break Morse_code.exw when fixing this!</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: #004080;\">Ihandle</span> <span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">frame_1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">radio</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">frame_2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">val_lbl</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">frame_3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">bpm_lbl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">spb_lbl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">act_lbl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">acc_lbl</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">onbtn</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">onoff</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">timer</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">notes</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">rle_decode_image</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">data</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- (not my best work, may benefit from a rethink...)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">img</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;\">data</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">rle</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;\">line</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span> <span style=\"color: #000000;\">val</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">rpt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rle</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;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rle</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</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;\">RGB</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rle</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rle</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;\">if</span> <span style=\"color: #000000;\">RGB</span><span style=\"color: #0000FF;\">=-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">RGBs</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupGetGlobal</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"DLGBGCOLOR\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">val</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">scanf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">RGBs</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%d %d %d\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">RGB</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">val</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;\">3</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">9</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: #000000;\">val</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">#FF</span>\n <span style=\"color: #000000;\">line</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">flatten</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">val</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">img</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">flatten</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">line</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rpt</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;\">img</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">constant</span>\n <span style=\"color: #000000;\">Whole_note</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">13</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">32</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;\">12</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</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;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</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;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">9</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;\">9</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;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">8</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;\">8</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;\">6</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;\">8</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;\">8</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;\">6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</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;\">8</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</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><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</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;\">8</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</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><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;\">8</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;\">9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</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;\">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;\">9</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;\">11</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000000;\">Half_note</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">30</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">21</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;\">10</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;\">14</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</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><span style=\"color: #000000;\">10</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;\">12</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</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;\">11</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</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;\">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;\">10</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;\">10</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;\">5</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;\">10</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;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</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><span style=\"color: #000000;\">0</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;\">10</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;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</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;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</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;\">10</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;\">5</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;\">10</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;\">10</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;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</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;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</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: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><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;\">7</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">14</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000000;\">Eigth_note</span> <span style=\"color: #0000FF;\">=</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;\">17</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;\">14</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;\">17</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;\">13</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;\">17</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</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;\">12</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;\">17</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</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;\">17</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;\">10</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;\">17</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">9</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;\">17</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;\">5</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">8</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;\">17</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;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</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;\">17</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;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</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;\">17</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;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</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;\">6</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;\">17</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;\">6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</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;\">5</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;\">17</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;\">7</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;\">5</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;\">17</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;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</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;\">4</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;\">17</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;\">8</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;\">4</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">17</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;\">9</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;\">4</span><span style=\"color: #0000FF;\">},</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: #000000;\">17</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;\">8</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;\">5</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">17</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;\">14</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;\">11</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">14</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;\">9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">14</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;\">8</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">14</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;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">14</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;\">6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">14</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;\">6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</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>\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;\">6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">16</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;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">18</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;\">9</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;\">21</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000000;\">Quarter_note</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">30</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">21</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;\">10</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;\">15</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</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;\">13</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</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;\">12</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</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;\">11</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</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;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</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;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</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;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</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: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><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;\">7</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">14</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;\">13</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;\">17</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000000;\">Sixteenth_note</span> <span style=\"color: #0000FF;\">=</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;\">17</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;\">14</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;\">17</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;\">13</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;\">17</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</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;\">12</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;\">17</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</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;\">17</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;\">10</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;\">17</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">9</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;\">17</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">8</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;\">17</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;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</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;\">17</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;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</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;\">17</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;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</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;\">6</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;\">17</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</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;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</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;\">5</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;\">17</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</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;\">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;\">5</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;\">17</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;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</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;\">4</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;\">17</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</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;\">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;\">4</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;\">17</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</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;\">2</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>\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;\">17</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;\">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;\">1</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;\">4</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;\">17</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;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</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>\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;\">17</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;\">5</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;\">4</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;\">17</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;\">6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</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>\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;\">17</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;\">8</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;\">4</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;\">17</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;\">9</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;\">4</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">17</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;\">9</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;\">3</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;\">17</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;\">9</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;\">4</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;\">11</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">8</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;\">4</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;\">9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">8</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;\">5</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;\">8</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">8</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;\">5</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;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">14</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;\">6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">14</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;\">6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</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>\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;\">6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">16</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;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">18</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;\">9</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;\">21</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">note</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">4</span> <span style=\"color: #000080;font-style:italic;\">-- quarter initially</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">vLastTime</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0.0</span> <span style=\"color: #000080;font-style:italic;\">-- for time resolution</span>\n\n <span style=\"color: #008080;\">constant</span>\n <span style=\"color: #000080;font-style:italic;\">-- in bpm</span>\n <span style=\"color: #000000;\">MIN_TEMPO</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">DEF_TEMPO</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">90</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">MAX_TEMPO</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">200</span>\n\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">vMSPB</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">667</span> <span style=\"color: #000080;font-style:italic;\">-- default milliseconds per beat</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">Tempos</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"Grave\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Largo\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Adagio\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Lento\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Adante\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Moderato\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"Allegretto\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Allegro\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Presto\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Vivance\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Prestissimo\"</span><span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">set_tempo</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">pBPM</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">pNote</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- returns tempo index</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">index</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(((</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">Tempos</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">pBPM</span><span style=\"color: #0000FF;\">)/(</span><span style=\"color: #000000;\">MAX_TEMPO</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">MIN_TEMPO</span><span style=\"color: #0000FF;\">))+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">lSPB</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">60</span> <span style=\"color: #0000FF;\">/</span> <span style=\"color: #000000;\">pBPM</span> <span style=\"color: #0000FF;\">/</span> <span style=\"color: #000000;\">pNote</span> <span style=\"color: #000080;font-style:italic;\">-- seconds per beat</span>\n <span style=\"color: #000000;\">vMSPB</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span> <span style=\"color: #000000;\">lSPB</span> <span style=\"color: #0000FF;\">*</span> <span style=\"color: #000000;\">1000</span> <span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #7060A8;\">IupSetStrAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">spb_lbl</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"TITLE\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%.2f\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">lSPB</span><span style=\"color: #0000FF;\">})</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;\">\"TIME\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">vMSPB</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</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> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000080;font-style:italic;\">-- restart needed to apply new TIME (not doc?)</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: #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;\">true</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;\">index</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;\">tempo_change</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">lBPM</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupGetInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">val_lbl</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"TITLE\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">lIndex</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">set_tempo</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lBPM</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">note</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetStrAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">frame_2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"TITLE\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Tempo: %s \"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">Tempos</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">lIndex</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #000000;\">vLastTime</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</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;\">toggle_state_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">ih</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">state</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">state</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">note</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ih</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">notes</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- 1/2/4/8/16</span>\n <span style=\"color: #000000;\">tempo_change</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000080;font-style:italic;\">-- and shift focus away, since it looks ugly w/o any text</span>\n <span style=\"color: #7060A8;\">IupSetFocus</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">onbtn</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;\">valuechanged_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">val</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">v</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupGetInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">val</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"VALUE\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">val_lbl</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"TITLE\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetStrAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">bpm_lbl</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"TITLE\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%.2f\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">tempo_change</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;\">include</span> <span style=\"color: #000000;\">builtins</span><span style=\"color: #0000FF;\">\\</span><span style=\"color: #7060A8;\">beep</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</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: #7060A8;\">beep</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">#200</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">lThisTime</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">vLastTime</span> <span style=\"color: #0000FF;\">></span> <span style=\"color: #000000;\">0.0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">lDiff</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lThisTime</span> <span style=\"color: #0000FF;\">-</span> <span style=\"color: #000000;\">vLastTime</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">lResolution</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">((</span><span style=\"color: #000000;\">lDiff</span> <span style=\"color: #0000FF;\">*</span> <span style=\"color: #000000;\">1000</span><span style=\"color: #0000FF;\">)/</span> <span style=\"color: #000000;\">vMSPB</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">*</span> <span style=\"color: #000000;\">100</span>\n <span style=\"color: #7060A8;\">IupSetStrAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">act_lbl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"TITLE\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"%0.2f\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">lDiff</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #7060A8;\">IupSetStrAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">acc_lbl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"TITLE\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"%d%%\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">lResolution</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">vLastTime</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">lThisTime</span>\n\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;\">button_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: #004080;\">bool</span> <span style=\"color: #000000;\">active</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: #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: #000000;\">active</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ih</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"TITLE\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"Off\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"On\"</span><span style=\"color: #0000FF;\">}[</span><span style=\"color: #000000;\">active</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: #004600;\">IUP_DEFAULT</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #7060A8;\">IupOpen</span><span style=\"color: #0000FF;\">()</span>\n\n <span style=\"color: #000000;\">notes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">IupImageRGBA</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">rle_decode_image</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">Whole_note</span><span style=\"color: #0000FF;\">)),</span>\n <span style=\"color: #7060A8;\">IupImageRGBA</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">40</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">rle_decode_image</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">Half_note</span><span style=\"color: #0000FF;\">)),</span>\n <span style=\"color: #7060A8;\">IupImageRGBA</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">40</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">rle_decode_image</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">Quarter_note</span><span style=\"color: #0000FF;\">)),</span>\n <span style=\"color: #7060A8;\">IupImageRGBA</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">40</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">rle_decode_image</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">Eigth_note</span><span style=\"color: #0000FF;\">)),</span>\n <span style=\"color: #7060A8;\">IupImageRGBA</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">40</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">rle_decode_image</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">Sixteenth_note</span><span style=\"color: #0000FF;\">))}</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">btns</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;\">notes</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">btn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupToggle</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">NULL</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"toggle_state_cb\"</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #008000;\">\"CANFOCUS=NO\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">lbl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupLabel</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">IupSetAttributeHandle</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lbl</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"IMAGE\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">notes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #000000;\">btns</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">btn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">lbl</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #000000;\">notes</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;\">btn</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">radio</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupRadio</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">IupHbox</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">btns</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"GAP=20\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">frame_1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupFrame</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">radio</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"MARGIN=20x10\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">frame_1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"TITLE\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Note \"</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000000;\">val_lbl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupLabel</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\" 200\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"ALIGNMENT=ARIGHT\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">val</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupValuator</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"HORIZONTAL\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"EXPAND=HORIZONTAL, CANFOCUS=NO\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">val</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"MIN\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">MIN_TEMPO</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">val</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"MAX\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">MAX_TEMPO</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">val</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"VALUE\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">DEF_TEMPO</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetCallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">val</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\n <span style=\"color: #000000;\">frame_2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupFrame</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">IupHbox</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">val_lbl</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">val</span><span style=\"color: #0000FF;\">}),</span><span style=\"color: #008000;\">`TITLE=\"Tempo: \"`</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000000;\">bpm_lbl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupLabel</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"90.00\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"ALIGNMENT=ARIGHT, EXPAND=HORIZONTAL\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">act_lbl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupLabel</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"0.00\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"ALIGNMENT=ARIGHT, EXPAND=HORIZONTAL\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">spb_lbl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupLabel</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"0.67\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"ALIGNMENT=ARIGHT, EXPAND=HORIZONTAL\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">acc_lbl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupLabel</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"0%\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"ALIGNMENT=ARIGHT, EXPAND=HORIZONTAL\"</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000000;\">frame_3</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupFrame</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">IupHbox</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: #7060A8;\">IupLabel</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Beats Per Minute:\"</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">bpm_lbl</span><span style=\"color: #0000FF;\">}),</span>\n <span style=\"color: #7060A8;\">IupHbox</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #7060A8;\">IupLabel</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Seconds Per Beat:\"</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">spb_lbl</span><span style=\"color: #0000FF;\">})},</span>\n <span style=\"color: #008000;\">\"GAP=10,MARGIN=10x0\"</span><span style=\"color: #0000FF;\">),</span>\n <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: #7060A8;\">IupLabel</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Actual Seconds Per Beat:\"</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">act_lbl</span><span style=\"color: #0000FF;\">}),</span>\n <span style=\"color: #7060A8;\">IupHbox</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #7060A8;\">IupLabel</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Accuracy:\"</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">acc_lbl</span><span style=\"color: #0000FF;\">})},</span>\n <span style=\"color: #008000;\">\"GAP=10,MARGIN=10x0\"</span><span style=\"color: #0000FF;\">)}),</span>\n <span style=\"color: #008000;\">`TITLE=\"Statistics \",MARGIN=4x8`</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000000;\">onbtn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupButton</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"On\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"button_cb\"</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #008000;\">\"PADDING=30x0\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">onoff</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupHbox</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #7060A8;\">IupFill</span><span style=\"color: #0000FF;\">(),</span><span style=\"color: #000000;\">onbtn</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #008000;\">\"MARGIN=0x20\"</span><span style=\"color: #0000FF;\">)</span>\n\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: #000000;\">frame_1</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">frame_2</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">frame_3</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">onoff</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #008000;\">\"MARGIN=10x5, GAP=5\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000080;font-style:italic;\">-- `TITLE=\"Virtunome\",RASTERSIZE=500x330`)</span>\n <span style=\"color: #008000;\">`TITLE=\"Virtunome\"`</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #7060A8;\">IupShow</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- The TIME and RUN attributes are set dynamically:</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;\">vMSPB</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\n <span style=\"color: #7060A8;\">IupSetInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">val_lbl</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"TITLE\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">DEF_TEMPO</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetAttributeHandle</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">radio</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"VALUE\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">btns</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #000000;\">tempo_change</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<!--\n","language":"Phix"},{"code":"(de metronome (Bpm)\n (if (fork)\n (let Pid @\n (for Pendulum '(\" /\" . (\"^H^H\\\\ \" \"^H^H /\" .))\n (tell Pid 'call \"/usr/bin/beep\" \"-f\" 440 \"-l\" 40)\n (prin Pendulum)\n (T (key (*/ 30000 Bpm)) (tell Pid 'bye)) )\n (prinl) )\n (wait) ) )\n","language":"PicoLisp"},{"code":": (metronome 60)\n /\n-> NIL # A key was hit\n","language":"PicoLisp"},{"code":"Structure METRONOMEs\n msPerBeat.i\n BeatsPerMinute.i\n BeatsPerCycle.i\n volume.i\n canvasGadget.i\n w.i\n h.i\n originX.i\n originY.i\n radius.i\n activityStatus.i\nEndStructure\n\nEnumeration ;gadgets\n #TEXT_MSPB ;milliseconds per beat\n #STRING_MSPB ;milliseconds per beat\n #TEXT_BPM ;beats per minute\n #STRING_BPM ;beats per minute\n #TEXT_BPC ;beats per cycle\n #STRING_BPC ;beats per cycle\n #BUTTON_VOLM ;volume -\n #BUTTON_VOLP ;volume +\n #BUTTON_START ;start\n #SPIN_BPM\n #CANVAS_METRONOME\nEndEnumeration\n\nEnumeration ;sounds\n #SOUND_LOW\n #SOUND_HIGH\nEndEnumeration\n\n#WINDOW = 0 ;window\n\nProcedure handleError(Value, text.s)\n If Not Value: MessageRequester(\"Error\", text): End: EndIf\nEndProcedure\n\nProcedure drawMetronome(*m.METRONOMEs, Angle.f, cycleCount = 0)\n Protected CircleX, CircleY, circleColor\n If StartDrawing(CanvasOutput(*m\\canvasGadget))\n Box(0, 0, *m\\w, *m\\h, RGB(0, 0, 0))\n CircleX = Int(*m\\radius * Cos(Radian(Angle)))\n CircleY = Int(*m\\radius * Sin(Radian(Angle)))\n If Angle = 90\n If cycleCount: circleColor = RGB(255, 0, 0): Else: circleColor = RGB(0, 255, 0): EndIf\n LineXY(*m\\originX, *m\\originY, *m\\originX, *m\\originY - CircleY, RGB(255, 255, 0))\n Circle(*m\\originX + CircleX, *m\\originY - CircleY - *m\\radius * 0.15, 10, circleColor)\n Else\n LineXY(*m\\originX, *m\\originY - *m\\radius * 1.02, *m\\originX, *m\\originY - *m\\radius, RGB(255, 255, 0))\n LineXY(*m\\originX, *m\\originY, *m\\originX + CircleX, *m\\originY - CircleY, RGB(255, 255, 0))\n EndIf\n\n StopDrawing()\n\n ProcedureReturn 1\n EndIf\nEndProcedure\n\nProcedure.i Metronome(*m.METRONOMEs)\n Protected milliseconds = Int((60 * 1000) / *m\\BeatsPerMinute)\n Protected msPerFrame, framesPerBeat\n Protected i, j, cycleCount, startTime, frameEndTime, delayTime, delayError, h.f\n\n ;calculate metronome angles for each frame of animation\n If *m\\BeatsPerMinute < 60\n framesPerBeat = Round(milliseconds / 150, #PB_Round_Nearest)\n Else\n framesPerBeat = Round((*m\\BeatsPerMinute - 420) / -60, #PB_Round_Nearest)\n EndIf\n\n If framesPerBeat < 1\n framesPerBeat = 1\n Dim metronomeFrameAngle.f(1, framesPerBeat)\n metronomeFrameAngle(0, 1) = 90\n metronomeFrameAngle(1, 1) = 90\n Else\n Dim metronomeFrameAngle.f(1, framesPerBeat * 2)\n For j = 1 To framesPerBeat\n h = 45 / framesPerBeat\n metronomeFrameAngle(0, j) = 90 - h * (j - 1)\n metronomeFrameAngle(0, framesPerBeat + j) = 45 + h * (j - 1)\n metronomeFrameAngle(1, j) = 90 + h * (j - 1)\n metronomeFrameAngle(1, framesPerBeat + j) = 135 - h * (j - 1)\n Next\n framesPerBeat * 2\n EndIf\n msPerFrame = milliseconds / framesPerBeat\n\n PlaySound(#SOUND_HIGH)\n startTime = ElapsedMilliseconds()\n Repeat\n For i = 0 To 1\n frameEndTime = startTime + msPerFrame\n For j = 1 To framesPerBeat\n drawMetronome(*m, metronomeFrameAngle(i, j), cycleCount)\n\n ;check for thread exit\n If *m\\activityStatus < 0\n *m\\activityStatus = 0\n ProcedureReturn\n EndIf\n\n delayTime = frameEndTime - ElapsedMilliseconds()\n If (delayTime - delayError) >= 0\n Delay(frameEndTime - ElapsedMilliseconds() - delayError) ;wait the remainder of frame\n ElseIf delayTime < 0\n delayError = - delayTime\n EndIf\n frameEndTime + msPerFrame\n Next\n\n ;check for thread exit\n If *m\\activityStatus < 0\n *m\\activityStatus = 0\n ProcedureReturn\n EndIf\n\n While (ElapsedMilliseconds() - startTime) < milliseconds: Wend\n\n SetGadgetText(*m\\msPerBeat, Str(ElapsedMilliseconds() - startTime))\n cycleCount + 1: cycleCount % *m\\BeatsPerCycle\n If cycleCount = 0\n PlaySound(#SOUND_HIGH)\n Else\n PlaySound(#SOUND_LOW)\n EndIf\n startTime + milliseconds\n Next\n ForEver\nEndProcedure\n\nProcedure startMetronome(*m.METRONOMEs, MetronomeThread) ;start up the thread with new values\n *m\\BeatsPerMinute = Val(GetGadgetText(#STRING_BPM))\n *m\\BeatsPerCycle = Val(GetGadgetText(#STRING_BPC))\n *m\\activityStatus = 1\n\n If *m\\BeatsPerMinute\n MetronomeThread = CreateThread(@Metronome(), *m)\n EndIf\n ProcedureReturn MetronomeThread\nEndProcedure\n\nProcedure stopMetronome(*m.METRONOMEs, MetronomeThread) ;if the thread is running: stop it\n If IsThread(MetronomeThread)\n *m\\activityStatus = -1 ;signal thread to stop\n EndIf\n drawMetronome(*m, 90)\nEndProcedure\n\n\nDefine w = 360, h = 360, ourMetronome.METRONOMEs\n\n;initialize the metronome\nWith ourMetronome\n \\msPerBeat = #STRING_MSPB\n \\canvasGadget = #CANVAS_METRONOME\n \\volume = 10\n \\w = w\n \\h = h\n \\originX = w / 2\n \\originY = h / 2\n \\radius = 100\nEndWith\n\nourMetronome\\canvasGadget = #CANVAS_METRONOME\n\n;initialize sounds\nhandleError(InitSound(), \"Sound system is Not available\")\nhandleError(CatchSound(#SOUND_LOW, ?sClick, ?eClick - ?sClick), \"Could Not CatchSound\")\nhandleError(CatchSound(#SOUND_HIGH, ?sClick, ?eClick - ?sClick), \"Could Not CatchSound\")\nSetSoundFrequency(#SOUND_HIGH, 50000)\nSoundVolume(#SOUND_LOW, ourMetronome\\volume)\nSoundVolume(#SOUND_HIGH, ourMetronome\\volume)\n\n;setup window & GUI\nDefine Style, i, wp, gh\n\nStyle = #PB_Window_SystemMenu | #PB_Window_ScreenCentered | #PB_Window_MinimizeGadget\nhandleError(OpenWindow(#WINDOW, 0, 0, w + 200 + 12, h + 4, \"Metronome\", Style), \"Not OpenWindow\")\nSetWindowColor(#WINDOW, $505050)\n\nIf LoadFont(0, \"tahoma\", 9, #PB_Font_HighQuality | #PB_Font_Bold)\n SetGadgetFont(#PB_Default, FontID(0))\nEndIf\n\ni = 3: wp = 10: gh = 22\nTextGadget(#TEXT_MSPB, w + wp, gh * i, 100, gh, \"MilliSecs/Beat \", #PB_Text_Center)\nStringGadget(#STRING_MSPB, w + wp + 108, gh * i, 90, gh, \"0\", #PB_String_ReadOnly): i + 2\nTextGadget(#TEXT_BPM, w + wp, gh * i, 100, gh,\"Beats/Min \", #PB_Text_Center)\nStringGadget(#STRING_BPM, w + wp + 108, gh * i, 90, gh, \"120\", #PB_String_Numeric): i + 2\nGadgetToolTip(#STRING_BPM, \"Valid range is 20 -> 240\")\nTextGadget(#TEXT_BPC, w + wp, gh * i, 100, gh,\"Beats/Cycle \", #PB_Text_Center)\nStringGadget(#STRING_BPC, w + wp + 108, gh * i, 90, gh, \"4\", #PB_String_Numeric): i + 2\nGadgetToolTip(#STRING_BPC, \"Valid range is 1 -> BPM\")\nButtonGadget(#BUTTON_START, w + wp, gh * i, 200, gh, \"Start\", #PB_Button_Toggle): i + 2\nButtonGadget(#BUTTON_VOLM, w + wp, gh * i, 100, gh, \"-Volume\")\nButtonGadget(#BUTTON_VOLP, w + wp + 100, gh * i, 100, gh, \"+Volume\")\nCanvasGadget(ourMetronome\\canvasGadget, 0, 0, ourMetronome\\w, ourMetronome\\h, #PB_Image_Border)\ndrawMetronome(ourMetronome, 90)\n\nDefine msg, GID, MetronomeThread, Value\nRepeat ;the control loop for our application\n msg = WaitWindowEvent(1)\n GID = EventGadget()\n etp = EventType()\n\n If GetAsyncKeyState_(#VK_ESCAPE): End: EndIf ;remove when app is o.k.\n\n Select msg\n\n Case #PB_Event_CloseWindow\n End\n\n Case #PB_Event_Gadget\n Select GID\n\n Case #STRING_BPM\n If etp = #PB_EventType_LostFocus\n Value = Val(GetGadgetText(#STRING_BPM))\n If Value > 390\n Value = 390\n ElseIf Value < 20\n Value = 20\n EndIf\n SetGadgetText(#STRING_BPM, Str(Value))\n EndIf\n\n Case #STRING_BPC\n If etp = #PB_EventType_LostFocus\n Value = Val(GetGadgetText(#STRING_BPC))\n If Value > Val(GetGadgetText(#STRING_BPM))\n Value = Val(GetGadgetText(#STRING_BPM))\n ElseIf Value < 1\n Value = 1\n EndIf\n SetGadgetText(#STRING_BPC, Str(Value))\n EndIf\n\n Case #BUTTON_VOLP, #BUTTON_VOLM ;change volume\n If GID = #BUTTON_VOLP And ourMetronome\\volume < 100\n ourMetronome\\volume + 10\n ElseIf GID = #BUTTON_VOLM And ourMetronome\\volume > 0\n ourMetronome\\volume - 10\n EndIf\n SoundVolume(#SOUND_LOW, ourMetronome\\volume)\n SoundVolume(#SOUND_HIGH, ourMetronome\\volume)\n\n Case #BUTTON_START ;the toggle button for start/stop\n Select GetGadgetState(#BUTTON_START)\n Case 1\n stopMetronome(ourMetronome, MetronomeThread)\n MetronomeThread = startMetronome(ourMetronome, MetronomeThread)\n SetGadgetText(#BUTTON_START,\"Stop\")\n Case 0\n stopMetronome(ourMetronome, MetronomeThread)\n SetGadgetText(#BUTTON_START,\"Start\")\n EndSelect\n\n EndSelect\n EndSelect\nForEver\nEnd\n\nDataSection\n ;a small wav file saved as raw data\n sClick:\n Data.q $0000082E46464952,$20746D6645564157,$0001000100000010,$0000AC440000AC44\n Data.q $6174616400080001,$8484848300000602,$8B8A898886868585,$C0B3A9A29C95918E\n Data.q $31479BD3CED0CFCF,$3233323232323331,$BDAEC4C9A1423133,$D0CFCFD0CFD1CDD4\n Data.q $323232333770A9CB,$2E34313332333232,$CFD0CFCACFCFAF53,$9783AAD3CED0CFD0\n Data.q $3233313332448AA1,$4430333233323233,$CFD0CFAE7D7E9483,$B7B9C3B8BFD1CED0\n Data.q $3233313037476898,$3E48493D32333233,$85959187775C4338,$898A8F8D807A7978\n Data.q $737F898381888D8D,$3131435564717A77,$332F36413A343234,$827B7873695C4D37\n Data.q $9C9B949191908F8A,$4D50515A67758694,$5451484341414245,$7B83868782756559\n Data.q $565D5F616365676E,$7871675F57504B4E,$797C8083827E7C7B,$4D525E686C6D7176\n Data.q $4D4B4B474343464A,$8B82796F655D5953,$7B7C83888B909392,$5153595E666F767B\n Data.q $5A5A5B5B59575553,$696C6E6D67615E5B,$7879777573726F6B,$71727376797C7B79\n Data.q $505352505159646C,$6B6153463C3B414A,$A09B908379706D6E,$6F767A7E858C949C\n Data.q $4D4D4845484E5662,$80796F645B544E4C,$8487888885828283,$555A5D606369737D\n Data.q $6A665F58524E4E51,$878E8F8B867D736D,$54606B72797F8081,$5852504F4E4E4C4D\n Data.q $7E7B7A79756F675F,$6B6C6F757C7F8182,$6D6865676C6F6E6C,$6E6B6C7074777773\n Data.q $615E5D60676F7372,$7069636061636463,$81817F7C7A797976,$65676B6E72797E80\n Data.q $65625F5E5D5D5F62,$7D7C7B7875716E6A,$6F74777B7E7F7F7E,$454950565D63676A\n Data.q $605A55504B464343,$9E9F9D978E817469,$6E7D8A93989A9B9C,$444546494C505861\n Data.q $7B756F665C534C46,$7E82858788888580,$5C5D61666B70757A,$6A6B6B6B6965615E\n Data.q $646B717676736F6B,$727272716D676261,$8285878885817A74,$5F5F636A72797D80\n Data.q $645D58585A5E6060,$827D79777877746D,$7878797C80848685,$6A686664666B7075\n Data.q $76726C666364686B,$807E7B7878787878,$656A6F74797B7D7F,$59585A5C5D5F6163\n Data.q $84807C79746D665E,$777C81878B8C8B89,$555352555B636B72,$82776B625C595957\n Data.q $989B9A979493918B,$656A6E7277818A92,$535457575656585E,$6E6E6F6D675E5753\n Data.q $898C9398968D7F74,$69717E8C9697918B,$3B39414F5D656767,$695B56565A595145\n Data.q $8986878A8F90897B,$7A7875757B848A8C,$747168605E636D76,$7B7365585257636F\n Data.q $8C8981777272777C,$70757676767A8188,$6A6D6D68625F6269,$8687847D746C6868\n Data.q $8485888A89868484,$585A616B747B8083,$5B555355595C5C5A,$8C898786847D7265\n Data.q $888C9096999A9892,$6163666C72797F83,$5E554E4B4C52595E,$91887C7169676663\n Data.q $8E8E8A88888C9193,$656666676A737E88,$655F585352555B62,$8B88837C756F6B69\n Data.q $7E858B8E8E8B898B,$62676B6D6D6C6E74,$6C6C6B6A6764605F,$7C7978787775736F\n Data.q $8E8C8C8C8D8D8982,$686D747C858C9091,$625C58585B5E6265,$908A837C75706C68\n Data.q $848A8E9396989896,$545960676E757A7F,$65605E5D5B575352,$A19D9890877C746C\n Data.q $8992979A9C9FA1A2,$525355575C64707E,$736D665D56514F50,$8D8D8B8986827E79\n Data.q $7777797B7F84898C,$78746F6A6A6E7376,$7B79767372747879,$6C6B69686A6F757A\n Data.q $7C78746F6D6C6C6D,$888B8C8B88858280,$6F75797B7D7F8184,$6F6D6B686565676A\n Data.q $8785817D79747270,$868B8D8D8C8A8988,$6F73777A7C7D7F82,$6F6B68656465666A\n Data.q $8A837D7976757472,$76787A7D82888C8D,$6562606064696F73,$8E8A847C756F6B68\n Data.q $8D90939494929190,$606264686F788088,$73685D58585A5D5F,$9B96918C8987837D\n Data.q $71767B838C959B9D,$5B5756585D63686D,$8C86817B756F6962,$888F939597979591\n Data.q $5C606366696F7780,$7A756D6259535458,$9EA2A0988D837E7C,$79858D8F8F8E9097\n Data.q $656B6E6D6865666E,$797A79746C656060,$7F7F7F7F7E7C7978,$8381828384848280\n Data.q $7F82888E92918D88,$59606A757C7F7F7F,$655E5A5A59585656,$A59F97918A82796E\n Data.q $7E848A939CA6ABAA,$48454548515E6B76,$8A7C6E6057514E4B,$A9ACABA8A4A09B94\n Data.q $5A626A737F8C98A3,$60554D49484A4E54,$A9A19A928A81776B,$848C969FA7ADAFAD\n Data.q $4B494C525C67717B,$8A7D7167605A544F,$A2A4A5A6A6A49F96,$626970777F89949C\n Data.q $6B655E56504F545A,$A19F988F8379736E,$848C9296989A9C9F,$61626465676B717A\n Data.q $807E79736D676261,$86898B8C8A888583,$797A7E8284848484,$77777A7C7E7E7C7A\n Data.q $7979797B7D7E7C79,$7D7C7B7B7C7C7B7A,$7D7D7C7B7A7B7C7D,$797978777677797B\n Data.q $787A7A7976757678,$415380817C777576,$2C31000002005255,$30202C36202C3020\n eClick:\nEndDataSection\n","language":"PureBasic"},{"code":"#lang Python\nimport time\n\ndef main(bpm = 72, bpb = 4):\n sleep = 60.0 / bpm\n counter = 0\n while True:\n counter += 1\n if counter % bpb:\n print 'tick'\n else:\n print 'TICK'\n time.sleep(sleep)\n\n\n\nmain()\n","language":"Python"},{"code":"#lang racket\n\n(require racket/gui)\n\n(define msec 500)\n(define sounds '(\"hi.wav\" \"lo.wav\"))\n(define colors '(\"red\" \"green\"))\n\n(define f\n (new frame% [label \"Metronome\"] [width 200] [height 200]))\n(define c\n (new (class canvas%\n (define brushes\n (map (λ(c) (new brush% [color c] [style 'solid])) colors))\n (define cur 0)\n (define/override (on-paint)\n (send* (send this get-dc)\n (clear)\n (set-brush (list-ref brushes cur))\n (draw-rectangle 0 0 200 200)))\n (define/public (flip!)\n (set! cur (modulo (add1 cur) (length sounds)))\n (play-sound (list-ref sounds cur) #f)\n (on-paint))\n (super-new))\n [parent f]))\n\n(define (flip)\n (define init (current-inexact-milliseconds))\n (define next (+ msec init))\n (define ticks 1)\n (let loop ()\n (when (> (current-inexact-milliseconds) next)\n (set! ticks (add1 ticks))\n (set! next (+ init (* msec ticks)))\n (queue-callback (λ() (send c flip!))))\n (sleep 0.01)\n (loop)))\n\n(send* f (center) (show #t))\n(void (thread flip))\n","language":"Racket"},{"code":"sub MAIN ($beats-per-minute = 72, $beats-per-bar = 4) {\n my $duration = 60 / $beats-per-minute;\n my $base-time = now + $duration;\n my $i;\n\n for $base-time, $base-time + $duration ... * -> $next-time {\n if $i++ %% $beats-per-bar {\n print \"\\nTICK\";\n }\n else {\n print \" tick\";\n }\n sleep $next-time - now;\n }\n}\n","language":"Raku"},{"code":"/*REXX program simulates a visual (textual) metronome (with no sound). */\nparse arg bpm bpb dur . /*obtain optional arguments from the CL*/\nif bpm=='' | bpm==\",\" then bpm=72 /*the number of beats per minute. */\nif bpb=='' | bpb==\",\" then bpb= 4 /* \" \" \" \" \" bar. */\nif dur=='' | dur==\",\" then dur= 5 /*duration of the run in seconds. */\ncall time 'Reset' /*reset the REXX elapsed timer. */\nbt=1/bpb /*calculate a tock-time interval. */\n\n do until et>=dur; et=time('Elasped') /*process tick-tocks for the duration*/\n say; call charout ,'TICK' /*show the first tick for the period. */\n es=et+1 /*bump the elapsed time \"limiter\". */\n $t=et+bt\n do until e>=es; e=time('Elapsed')\n if e<$t then iterate /*time for tock? */\n call charout , ' tock' /*show a \"tock\". */\n $t=$t+bt /*bump the TOCK time.*/\n end /*until e≥es*/\n end /*until et≥dur*/\n /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"/*REXX program simulates a metronome (with sound). Regina REXX only. */\nparse arg bpm bpb dur tockf tockd tickf tickd . /*obtain optional arguments from the CL*/\nif bpm=='' | bpm==\",\" then bpm= 72 /*the number of beats per minute. */\nif bpb=='' | bpb==\",\" then bpb= 4 /* \" \" \" \" \" bar. */\nif dur=='' | dur==\",\" then dur= 5 /*duration of the run in secs*/\nif tockf=='' | tockf==\",\" then tockf=400 /*frequency \" \" tock sound \" HZ. */\nif tockd=='' | tockd==\",\" then tockd= 20 /*duration \" \" \" \" \" msec*/\nif tickf=='' | tickf==\",\" then tickf=600 /*frequency \" \" tick \" \" HZ. */\nif tickd=='' | tickd==\",\" then tickd= 10 /*duration \" \" \" \" \" msec*/\ncall time 'Reset' /*reset the REXX elapsed timer. */\nbt=1/bpb /*calculate a tock─time interval. */\n\n do until et>=dur; et=time('Elasped') /*process tick-tocks for the duration*/\n call beep tockf, tockd /*sound a beep for the \"TOCK\". */\n es=et+1 /*bump the elapsed time \"limiter\". */\n $t=et+bt\n do until e>=es; e=time('Elapsed')\n if e<$t then iterate /*time for tock? */\n call beep tickf, tickd /*sound a \"tick\". */\n $t=$t+bt /*bump the TOCK time.*/\n end /*until e≥es*/\n end /*until et≥dur*/\n /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"/*REXX program simulates a metronome (with sound). PC/REXX or Personal REXX only.*/\nparse arg bpm bpb dur tockf tockd tickf tickd . /*obtain optional arguments from the CL*/\nif bpm=='' | bpm==\",\" then bpm= 72 /*the number of beats per minute. */\nif bpb=='' | bpb==\",\" then bpb= 4 /* \" \" \" \" \" bar. */\nif dur=='' | dur==\",\" then dur= 5 /*duration of the run in secs*/\nif tockf=='' | tockf==\",\" then tockf=400 /*frequency \" \" tock sound \" HZ. */\nif tockd=='' | tockd==\",\" then tockd= .02 /*duration \" \" \" \" \" sec.*/\nif tickf=='' | tickf==\",\" then tickf=600 /*frequency \" \" tick \" \" HZ. */\nif tickd=='' | tickd==\",\" then tickd= .01 /*duration \" \" \" \" \" sec.*/\ncall time 'Reset' /*reset the REXX elapsed timer. */\nbt=1/bpb /*calculate a tock─time interval. */\n\n do until et>=dur; et=time('Elasped') /*process tick-tocks for the duration*/\n call sound tockf, tockd /*sound a beep for the \"TOCK\". */\n es=et+1 /*bump the elapsed time \"limiter\". */\n $t=et+bt\n do until e>=es; e=time('Elapsed')\n if e<$t then iterate /*time for tock? */\n call sound tickf, tickd /*sound a tick. */\n $t=$t+bt /*bump the TOCK time.*/\n end /*until e≥es*/\n end /*until et≥dur*/\n /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"#!/usr/bin/ruby\n\nbpm = Integer(ARGV[0]) rescue 60 # sets BPM by the first command line argument, set to 60 if none provided\nmsr = Integer(ARGV[1]) rescue 4 # sets number of beats in a measure by the second command line argument, set to 4 if none provided\ni = 0\n\nloop do\n (msr-1).times do\n puts \"\\a\"\n sleep(60.0/bpm)\n end\n puts \"\\aAND #{i += 1}\"\n sleep(60.0/bpm)\nend\n","language":"Ruby"},{"code":"def metronome(bpm: Int, bpb: Int, maxBeats: Int = Int.MaxValue) {\n val delay = 60000L / bpm\n var beats = 0\n do {\n Thread.sleep(delay)\n if (beats % bpb == 0) print(\"\\nTICK \")\n else print(\"tick \")\n beats+=1\n }\n while (beats < maxBeats)\n println()\n}\n\nmetronome(120, 4, 20) // limit to 20\n","language":"Scala"},{"code":"func metronome (beats_per_minute = 72, beats_per_bar = 4) {\n\n var counter = 0\n var duration = 60/beats_per_minute\n var base_time = Time.micro+duration\n\n STDOUT.autoflush(true)\n\n for next_time in (base_time..Inf `by` duration) {\n if (counter++ %% beats_per_bar) {\n print \"\\nTICK\"\n }\n else {\n print \" tick\"\n }\n Sys.sleep(next_time - Time.micro)\n }\n}\n\nsay metronome(ARGV.map{ Num(_) }...)\n","language":"Sidef"},{"code":"package require Tcl 8.5\n\nlassign $argv bpm bpb\nif {$argc < 2} {set bpb 4}\nif {$argc < 1} {set bpm 60}\n\nfconfigure stdout -buffering none\nset intervalMS [expr {round(60000.0 / $bpm)}]\nset ctr 0\n\nproc beat {} {\n global intervalMS ctr bpb\n after $intervalMS beat ;# Reschedule first, to encourage minimal drift\n if {[incr ctr] == 1} {\n\tputs -nonewline \"\\r\\a[string repeat { } [expr {$bpb+4}]]\\rTICK\"\n } else {\n\tputs -nonewline \"\\rtick[string repeat . [expr {$ctr-1}]]\"\n }\n if {$ctr >= $bpb} {\n\tset ctr 0\n }\n}\n\n# Run the metronome until the user uses Ctrl+C...\nbeat\nvwait forever\n","language":"Tcl"},{"code":"tclsh8.5 metronome.tcl 90 4\n","language":"Tcl"},{"code":"import \"timer\" for Timer\nimport \"io\" for Stdout\n\nvar metronome = Fn.new { |bpm, bpb, maxBeats|\n var delay = (60000/bpm).floor\n var beats = 0\n while (true) {\n Timer.sleep(delay)\n System.write((beats % bpb == 0) ? \"\\n\\aTICK \" : \"\\atick \")\n Stdout.flush()\n beats = beats + 1\n if (beats == maxBeats) break\n }\n System.print()\n}\n\nmetronome.call(120, 4, 20) // limit to 20 beats\n","language":"Wren"},{"code":"int BPM, Odd, Time0, Delay;\n[Text(0, \"Beats per minute: \");\nBPM:= IntIn(0);\nOdd:= true;\nDelay:= 60_000_000/BPM; \\microseconds per beat\nrepeat Time0:= GetTime;\n repeat until GetTime-Time0 >= Delay;\n Text(0, if Odd then \"tick\" else \" TOCK^m^j\");\n Odd:= not Odd;\nuntil KeyHit;\n]\n","language":"XPL0"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Metronome\\n\",\n \"language\": \"00-META\"\n },\n {\n \"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 indicator, and the beat pattern and tempo should be configurable.\\n\\nFor the purpose of this task, it is acceptable to play sound files for production of the beat notes, and an external player may be used. \\n\\nHowever, the playing of the sounds should not interfere with the timing of the metronome.\\n\\nThe visual indicator can simply be a blinking red or green area of the screen (depending on whether a high or low beat is being produced), and the metronome can be implemented using a terminal display, or optionally, a graphical display, depending on the language capabilities. \\n\\nIf the language has no facility to output sound, then it is permissible for this to implemented using just the visual indicator.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F main(bpm = 72, bpb = 4)\\n V t = 60.0 / bpm\\n V counter = 0\\n L\\n counter++\\n I counter % bpb != 0\\n print(‘tick’)\\n E\\n print(‘TICK’)\\n sleep(t)\\n\\nmain()\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\n\\n --This package is for the delay.\\nwith Ada.Calendar; use Ada.Calendar;\\n\\n --This package adds sound\\nwith Ada.Characters.Latin_1;\\n\\nprocedure Main is\\n\\nbegin\\n\\n Put_Line (\\\"Hello, this is 60 BPM\\\");\\n\\n loop\\n\\n Ada.Text_IO.Put (Ada.Characters.Latin_1.BEL);\\n delay 0.9; --Delay in seconds. If you change to 0.0 the program will crash.\\n\\n end loop;\\n\\nend Main;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"set bpm to the text returned of (display dialog \\\"How many beats per minute?\\\" default answer 60)\\nset pauseBetweenBeeps to (60 / bpm)\\nrepeat\\n\\tbeep\\n\\tdelay pauseBetweenBeeps\\nend repeat\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"startMetronome: function [bpm,msr][\\n freq: 60000/bpm\\n i: 0\\n while [true][\\n loop msr-1 'x[\\n prints \\\"\\\\a\\\"\\n pause freq\\n ]\\n inc 'i\\n print ~\\\"\\\\aAND |i|\\\"\\n pause freq\\n ]\\n]\\n\\ntempo: to :integer arg\\\\0\\nbeats: to :integer arg\\\\1\\n\\nstartMetronome tempo beats\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"bpm = 120 ; Beats per minute\\npattern = 4/4 ;\\nduration = 100 ; Milliseconds\\nbeats = 0 ; internal counter\\n\\nGui -Caption\\n\\nStringSplit, p, pattern, /\\n\\nStart := A_TickCount\\n\\nLoop\\n{\\n\\tGui Color, 0xFF0000\\n\\tGui Show, w200 h200 Na\\n\\tSoundBeep 750, duration\\n\\tbeats++\\n\\tSleep 1000 * 60 / bpm - duration\\n\\tLoop % p1 -1\\n\\t{\\n\\t\\tGui Color, 0x00FF00\\n\\t\\tGui Show, w200 h200 Na\\n\\t\\tSoundBeep, , duration\\n\\t\\tbeats++\\n\\t\\tSleep 1000 * 60 / bpm - duration\\n\\t}\\n}\\n\\nEsc::\\n\\tMsgBox % \\\"Metronome beeped \\\" beats \\\" beats, over \\\" (A_TickCount-Start)/1000 \\\" seconds. \\\"\\n\\tExitApp\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f METRONOME.AWK\\n@load \\\"time\\\"\\nBEGIN {\\n metronome(120,6,10)\\n metronome(72,4)\\n exit(0)\\n}\\nfunction metronome(beats_per_min,beats_per_bar,limit, beats,delay,errors) {\\n print(\\\"\\\")\\n if (beats_per_min+0 <= 0) { print(\\\"error: beats per minute is invalid\\\") ; errors++ }\\n if (beats_per_bar+0 <= 0) { print(\\\"error: beats per bar is invalid\\\") ; errors++ }\\n if (limit+0 <= 0) { limit = 999999 }\\n if (errors > 0) { return }\\n delay = 60 / beats_per_min\\n printf(\\\"delay=%f\\\",delay)\\n while (beats < limit) {\\n printf((beats++ % beats_per_bar == 0) ? \\\"\\\\nTICK\\\" : \\\" tick\\\")\\n sleep(delay)\\n }\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \" BeatPattern$ = \\\"HLLL\\\"\\n Tempo% = 100\\n\\n *font Arial,36\\n REPEAT\\n FOR beat% = 1 TO LEN(BeatPattern$)\\n IF MID$(BeatPattern$, beat%, 1) = \\\"H\\\" THEN\\n SOUND 1,-15,148,1\\n ELSE\\n SOUND 1,-15,100,1\\n ENDIF\\n VDU 30\\n COLOUR 2\\n PRINT LEFT$(BeatPattern$,beat%-1);\\n COLOUR 9\\n PRINT MID$(BeatPattern$,beat%,1);\\n COLOUR 2\\n PRINT MID$(BeatPattern$,beat%+1);\\n WAIT 6000/Tempo%\\n NEXT\\n UNTIL FALSE\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <unistd.h>\\n#include <stdint.h>\\n#include <signal.h>\\n#include <time.h>\\n#include <sys/time.h>\\n\\nstruct timeval start, last;\\n\\ninline int64_t tv_to_u(struct timeval s)\\n{\\n\\treturn s.tv_sec * 1000000 + s.tv_usec;\\n}\\n\\ninline struct timeval u_to_tv(int64_t x)\\n{\\n\\tstruct timeval s;\\n\\ts.tv_sec = x / 1000000;\\n\\ts.tv_usec = x % 1000000;\\n\\treturn s;\\n}\\n\\nvoid draw(int dir, int64_t period, int64_t cur, int64_t next)\\n{\\n\\tint len = 40 * (next - cur) / period;\\n\\tint s, i;\\n\\n\\tif (len > 20) len = 40 - len;\\n\\ts = 20 + (dir ? len : -len);\\n\\n\\tprintf(\\\"\\\\033[H\\\");\\n\\tfor (i = 0; i <= 40; i++) putchar(i == 20 ? '|': i == s ? '#' : '-');\\n}\\n\\nvoid beat(int delay)\\n{\\n\\tstruct timeval tv = start;\\n\\tint dir = 0;\\n\\tint64_t d = 0, corr = 0, slp, cur, next = tv_to_u(start) + delay;\\n\\tint64_t draw_interval = 20000;\\n\\tprintf(\\\"\\\\033[H\\\\033[J\\\");\\n\\twhile (1) {\\n\\t\\tgettimeofday(&tv, 0);\\n\\t\\tslp = next - tv_to_u(tv) - corr;\\n\\t\\tusleep(slp);\\n\\t\\tgettimeofday(&tv, 0);\\n\\n\\t\\tputchar(7); /* bell */\\n\\t\\tfflush(stdout);\\n\\n\\t\\tprintf(\\\"\\\\033[5;1Hdrift: %d compensate: %d (usec) \\\",\\n\\t\\t\\t(int)d, (int)corr);\\n\\t\\tdir = !dir;\\n\\n\\t\\tcur = tv_to_u(tv);\\n\\t\\td = cur - next;\\n\\t\\tcorr = (corr + d) / 2;\\n\\t\\tnext += delay;\\n\\n\\t\\twhile (cur + d + draw_interval < next) {\\n\\t\\t\\tusleep(draw_interval);\\n\\t\\t\\tgettimeofday(&tv, 0);\\n\\t\\t\\tcur = tv_to_u(tv);\\n\\t\\t\\tdraw(dir, delay, cur, next);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t}\\n\\t}\\n}\\n\\nint main(int c, char**v)\\n{\\n\\tint bpm;\\n\\n\\tif (c < 2 || (bpm = atoi(v[1])) <= 0) bpm = 60;\\n\\tif (bpm > 600) {\\n\\t\\tfprintf(stderr, \\\"frequency %d too high\\\\n\\\", bpm);\\n\\t\\texit(1);\\n\\t}\\n\\n\\tgettimeofday(&start, 0);\\n\\tlast = start;\\n\\tbeat(60 * 1000000 / bpm);\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <chrono>\\n#include <cstdint>\\n#include <iostream>\\n#include <thread>\\n\\nclass Metronome {\\npublic:\\n\\tMetronome(const int32_t& aBeats_per_minute, const int32_t& aMeasure, const int32_t& aDuration_in_minutes)\\n\\t: beats_per_minute(aBeats_per_minute), measure(aMeasure), duration_in_minutes(aDuration_in_minutes) {\\n\\t\\tcounter = 0;\\n\\t}\\n\\n\\tvoid start() {\\n\\t\\twhile ( counter < duration_in_minutes * beats_per_minute ) {\\n\\t\\t\\tstart_time = std::chrono::system_clock::now();\\n\\n\\t\\t\\tstd::this_thread::sleep_until(time_to_awake());\\n\\t\\t\\tcounter++;\\n\\t\\t\\tif ( counter % measure != 0 ) {\\n\\t\\t\\t\\tstd::cout << \\\"Tick \\\" << std::flush;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tstd::cout << \\\"Tock\\\" << std::endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\nprivate:\\n\\tstd::chrono::system_clock::time_point time_to_awake() const {\\n\\t\\treturn start_time + std::chrono::seconds(1);\\n\\t}\\n\\n\\tstd::chrono::system_clock::time_point start_time;\\n\\tint32_t counter;\\n\\n\\tconst int32_t beats_per_minute, measure, duration_in_minutes;\\n};\\n\\nint main() {\\n\\tMetronome metronome(60, 4, 1);\\n\\tmetronome.start();\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Threading;\\n\\npublic class Program\\n{\\n public static void Main(string[] args)\\n {\\n Metronome metronome1 = new Metronome(120, 4);\\n metronome1.Start();\\n }\\n}\\n\\npublic class Metronome\\n{\\n private double bpm;\\n private int measure;\\n private int counter;\\n\\n public Metronome(double bpm, int measure)\\n {\\n this.bpm = bpm;\\n this.measure = measure;\\n }\\n\\n public void Start()\\n {\\n Thread thread = new Thread(() =>\\n {\\n while (true)\\n {\\n try\\n {\\n Thread.Sleep((int)(1000 * (60.0 / bpm)));\\n }\\n catch (ThreadInterruptedException e)\\n {\\n Console.WriteLine(e.StackTrace);\\n }\\n counter++;\\n if (counter % measure == 0)\\n {\\n Console.WriteLine(\\\"TICK\\\");\\n }\\n else\\n {\\n Console.WriteLine(\\\"TOCK\\\");\\n }\\n }\\n });\\n\\n thread.Start();\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(ql:quickload '(cl-openal cl-alc))\\n\\n(defparameter *short-max* (- (expt 2 15) 1))\\n(defparameter *2-pi* (* 2 pi))\\n\\n(defun make-sin (period)\\n \\\"Create a generator for a sine wave of the given PERIOD.\\\"\\n (lambda (x)\\n (sin (* *2-pi* (/ x period)))))\\n\\n(defun make-tone (length frequency sampling-frequency)\\n \\\"Create a vector containing sound information of the given LENGTH,\\nFREQUENCY, and SAMPLING-FREQUENCY.\\\"\\n (let ((data (make-array (truncate (* length sampling-frequency))\\n :element-type '(signed-byte 16)))\\n (generator (make-sin (/ sampling-frequency frequency))))\\n (dotimes (i (length data))\\n (setf (aref data i)\\n (truncate (* *short-max* (funcall generator i)))))\\n data))\\n\\n(defun internal-time-ms ()\\n \\\"Get the process's real time in ms.\\\"\\n (* 1000 (/ (get-internal-real-time) internal-time-units-per-second)))\\n\\n(defun spin-wait (next-real-time)\\n \\\"Wait until the process's real time has reached the given time.\\\"\\n (loop while (< (internal-time-ms) next-real-time)))\\n\\n(defun upload (buffer data sampling-frequency)\\n \\\"Upload the given vector DATA to a BUFFER at the given SAMPLING-FREQUENCY.\\\"\\n (cffi:with-pointer-to-vector-data (data-ptr data)\\n (al:buffer-data buffer :mono16 data-ptr (* 2 (length data))\\n sampling-frequency)))\\n\\n(defun metronome (beats/minute pattern &optional (sampling-frequency 44100))\\n \\\"Play a metronome until interrupted.\\\"\\n (let ((ms/beat (/ 60000 beats/minute)))\\n (alc:with-device (device)\\n (alc:with-context (context device)\\n (alc:make-context-current context)\\n (al:with-buffer (low-buffer)\\n (al:with-buffer (high-buffer)\\n (al:with-source (source)\\n (al:source source :gain 0.5)\\n (flet ((play-it (buffer)\\n (al:source source :buffer buffer)\\n (al:source-play source))\\n (upload-it (buffer time frequency)\\n (upload buffer\\n (make-tone time frequency sampling-frequency)\\n sampling-frequency)))\\n (upload-it low-buffer 0.1 440)\\n (upload-it high-buffer 0.15 880)\\n (let ((next-scheduled-tone (internal-time-ms)))\\n (loop\\n (loop for symbol in pattern do\\n (spin-wait next-scheduled-tone)\\n (incf next-scheduled-tone ms/beat)\\n (case symbol\\n (l (play-it low-buffer))\\n (h (play-it high-buffer)))\\n (princ symbol))\\n (terpri)))))))))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"program Metronome;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n Winapi.Windows,\\n System.SysUtils;\\n\\nprocedure StartMetronome(bpm: double; measure: Integer);\\nvar\\n counter: Integer;\\nbegin\\n counter := 0;\\n while True do\\n begin\\n Sleep(Trunc(1000 * (60.0 / bpm)));\\n inc(counter);\\n if counter mod measure = 0 then\\n writeln('TICK')\\n else\\n writeln('TOCK');\\n end;\\nend;\\n\\nbegin\\n StartMetronome(120, 4);\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \";; available preloaded sounds are : ok, ko, tick, tack, woosh, beep, digit .\\n(lib 'timer)\\n\\n(define (metronome) (blink) (play-sound 'tack))\\n(at-every 1000 'metronome) ;; every 1000 msec\\n;; CTRL-C to stop\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"open System\\nopen System.Threading\\n// You can use .wav files for your clicks.\\n// If used, make sure they are in the same file\\n// as this program's executable file.\\nlet high_pitch =\\n new System.Media.SoundPlayer(\\\"Ping Hi.wav\\\")\\nlet low_pitch =\\n new System.Media.SoundPlayer(\\\"Ping Low.wav\\\")\\nlet factor x y = x / y\\n// Notice that exact bpm would not work by using\\n// Thread.Sleep() as there are additional function calls\\n// that would consume a miniscule amount of time.\\n// This number may need to be adjusted based on the cpu.\\nlet cpu_error = -750.0\\nlet print = function\\n| 1 -> high_pitch.Play(); printf \\\"\\\\nTICK \\\"\\n| _ -> low_pitch.Play(); printf \\\"tick \\\"\\nlet wait (time:int) =\\n Thread.Sleep(time)\\n// Composition of functions\\nlet tick = float>>factor (60000.0+cpu_error)>>int>>wait\\nlet rec play beats_per_measure current_beat beats_per_minute =\\n match current_beat, beats_per_measure with\\n | a, b ->\\n current_beat |> print\\n beats_per_minute |> tick\\n if a <> b then\\n beats_per_minute |> play beats_per_measure (current_beat + 1)\\n[<EntryPointAttribute>]\\nlet main (args : string[]) =\\n let tempo, beats = int args.[0], int args.[1]\\n Seq.initInfinite (fun i -> i + 1)\\n |> Seq.iter (fun _ -> tempo |> play beats 1 |> ignore)\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: accessors calendar circular colors.constants colors.hsv\\ncommand-line continuations io kernel math math.parser namespaces\\nopenal.example sequences system timers ui ui.gadgets\\nui.pens.solid ;\\nIN: rosetta-code.metronome\\n\\n: bpm>duration ( bpm -- duration ) 60 swap / seconds ;\\n\\n: blink-gadget ( gadget freq -- )\\n 1.0 1.0 1.0 <hsva> <solid> >>interior relayout-1 ;\\n\\n: blank-gadget ( gadget -- )\\n COLOR: white <solid> >>interior relayout-1 ;\\n\\n: play-note ( gadget freq -- )\\n [ blink-gadget ] [ 0.3 play-sine blank-gadget ] 2bi ;\\n\\n: metronome-iteration ( gadget circular -- )\\n [ first play-note ] [ rotate-circular ] bi ;\\n\\nTUPLE: metronome-gadget < gadget bpm notes timer ;\\n\\n: <metronome-gadget> ( bpm notes -- gadget )\\n \\\\ metronome-gadget new swap >>notes swap >>bpm ;\\n\\n: metronome-quot ( gadget -- quot )\\n dup notes>> <circular> [ metronome-iteration ] 2curry ;\\n\\n: metronome-timer ( gadget -- timer )\\n [ metronome-quot ] [ bpm>> bpm>duration ] bi every ;\\n\\nM: metronome-gadget graft* ( gadget -- )\\n [ metronome-timer ] keep timer<< ;\\n\\nM: metronome-gadget ungraft*\\n timer>> stop-timer ;\\n\\nM: metronome-gadget pref-dim* drop { 200 200 } ;\\n\\n: metronome-defaults ( -- bpm notes ) 60 { 440 220 330 } ;\\n\\n: metronome-ui ( bpm notes -- ) <metronome-gadget> \\\"Metronome\\\" open-window ;\\n\\n: metronome-example ( -- ) metronome-defaults metronome-ui ;\\n\\n: validate-args ( int-args -- )\\n [ length 2 < ] [ [ 0 <= ] any? ] bi or [ \\\"args error\\\" throw ] when ;\\n\\n: (metronome-cmdline) ( args -- bpm notes )\\n [ string>number ] map dup validate-args\\n unclip swap ;\\n\\n: metronome-cmdline ( -- bpm notes )\\n command-line get [ metronome-defaults ] [ (metronome-cmdline) ] if-empty ;\\n\\n: print-defaults ( -- )\\n metronome-defaults swap prefix\\n [ \\\" \\\" write ] [ number>string write ] interleave nl ;\\n\\n: metronome-usage ( -- )\\n \\\"Usage: metronome [BPM FREQUENCIES...]\\\" print\\n \\\"Arguments must be non-zero\\\" print\\n \\\"Example: metronome \\\" write print-defaults flush ;\\n\\n: metronome-main ( -- )\\n [ [ metronome-cmdline metronome-ui ] [ drop metronome-usage 1 exit ] recover ] with-ui ;\\n\\nMAIN: metronome-main\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"REM FreeBASIC no tiene la capacidad de emitir sonido de forma nativa.\\nREM La función Sound no es mía, incluyo los créditos correspondientes.\\n' Sound Function v0.3 For DOS/Linux/Win by yetifoot\\n' Credits:\\n' http://www.frontiernet.net/~fys/snd.htm\\n' http://delphi.about.com/cs/adptips2003/a/bltip0303_3.htm\\n#ifdef __FB_WIN32__\\n#include Once \\\"windows.bi\\\"\\n#endif\\nSub Sound_DOS_LIN(Byval freq As Uinteger, dur As Uinteger)\\n Dim t As Double\\n Dim As Ushort fixed_freq = 1193181 \\\\ freq\\n\\n Asm\\n mov dx, &H61 ' turn speaker on\\n in al, dx\\n or al, &H03\\n out dx, al\\n mov dx, &H43 ' get the timer ready\\n mov al, &HB6\\n out dx, al\\n mov ax, word Ptr [fixed_freq] ' move freq to ax\\n mov dx, &H42 ' port to out\\n out dx, al ' out low order\\n xchg ah, al\\n out dx, al ' out high order\\n End Asm\\n\\n t = Timer\\n While ((Timer - t) * 1000) < dur ' wait for out specified duration\\n Sleep(1)\\n Wend\\n\\n Asm\\n mov dx, &H61 ' turn speaker off\\n in al, dx\\n and al, &HFC\\n out dx, al\\n End Asm\\nEnd Sub\\n\\nSub Sound(Byval freq As Uinteger, dur As Uinteger)\\n #ifndef __fb_win32__\\n ' If not windows Then call the asm version.\\n Sound_DOS_LIN(freq, dur)\\n #Else\\n ' If Windows\\n Dim osv As OSVERSIONINFO\\n\\n osv.dwOSVersionInfoSize = Sizeof(OSVERSIONINFO)\\n GetVersionEx(@osv)\\n\\n Select Case osv.dwPlatformId\\n Case VER_PLATFORM_WIN32_NT\\n ' If NT then use Beep from API\\n Beep_(freq, dur)\\n Case Else\\n ' If not on NT then use the same as DOS/Linux\\n Sound_DOS_LIN(freq, dur)\\n End Select\\n #endif\\nEnd Sub\\n\\n'----------\\n\\nSub metronome()\\n Dim As Double bpm = 120.0 ' beats por minuto\\n Dim As Long retardo = 1000*(60.0 / bpm)\\n Dim As Integer bpb = 4 ' beats por compás\\n Dim As Integer counter = 0 ' contador interno\\n Do\\n counter += 1\\n If counter Mod bpb <> 0 Then\\n Sound(100, 60)\\n Color 10: Print \\\"tick \\\";\\n Else\\n Sound(119, 60)\\n Color 11: Print \\\"TICK \\\"\\n End If\\n Sleep(retardo)\\n Loop\\nEnd Sub\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"/*\\nBasic Tempo Markings from slowest to fastest:\\n\\n• Larghissimo – very, very slow (24 bpm and under)\\n• Grave – very slow (25–45 bpm)\\n• Largo – broadly (40–60 bpm)\\n• Lento – slowly (45–60 bpm)\\n• Larghetto – rather broadly (60–66 bpm)\\n• Adagio – slow & (literally (66–76 bpm)\\n• Adagietto – slower than andante (72–76 bpm)\\n• Andante – walking pace (76–108 bpm)\\n• Andantino – slightly faster (80–108 bpm)\\n• Marcia moderato – moderately, a march (83–85 bpm)\\n• Andante moderato – between andante and moderato (92–112 bpm)\\n• Moderato – moderately (108–120 bpm)\\n• Allegretto – moderately fast (112–120 bpm)\\n• Allegro moderato – not quite allegro (116–120 bpm)\\n• Allegro – fast, quick, bright (120–168 bpm)\\n• Vivace – lively and fast (168–176 bpm)\\n• Vivacissimo – very fast and lively (172–176 bpm)\\n• Allegrissimo – very fast (172–176 bpm)\\n• Presto – very, very fast (168–200 bpm)\\n• Prestissimo – even faster (200 bpm and over)\\n*/\\n\\noutput file \\\"Metronome\\\"\\n\\ninclude \\\"Tlbx AVFoundation.incl\\\"\\n\\n// Uncomment next line to use external sound file, and make necessary adjustments in fn RunMetronome\\n// include resources \\\"toc.wav\\\"\\n\\nbegin enum\\n_mApplication\\n_mFile\\n_mEdit\\n_mColor\\nend enum\\n\\nbegin enum 1\\n_iSeparator\\n_iPreferences\\nend enum\\n\\nbegin enum\\n_iClose\\nend enum\\n\\n_window = 1\\nbegin enum 1\\n_slider = 30\\n_bpmIndicator\\nend enum\\n\\n_initialBPM = 100\\n\\nvoid local fn BuildMenus\\n'~'1\\n// application\\nmenu _mApplication, _iSeparator\\nmenu _mApplication, _iPreferences,, @\\\"Preferences…\\\", @\\\",\\\"\\n\\n// file\\nmenu _mFile, -1,, @\\\"File\\\"\\nmenu _mFile, _iClose,, @\\\"Close\\\", @\\\"w\\\"\\nMenuItemSetAction( _mFile, _iClose, @\\\"performClose:\\\" )\\n\\neditmenu _mEdit\\nend fn\\n\\n\\nvoid local fn BuildWindow\\n'~'1\\nNSUInteger i\\n\\nCGRect r = fn CGRectMake( 0, 0, 200, 500 )\\nwindow _window, @\\\"Metronome\\\", r, NSWindowStyleMaskTitled + NSWindowStyleMaskClosable + NSWindowStyleMaskMiniaturizable\\n\\nr = fn CGRectMake( 160, 20, 32, 465 )\\nslider _slider, YES, _initialBPM, r, 20, 190, _window\\n\\nr = fn CGRectMake( 25, 458, 24, 24 )\\ncolorwell _bpmIndicator, YES, fn ColorGreen, r, NO, _window\\nColorWellSetBordered( _bpmIndicator, NO )\\n\\nCFArrayRef tempo = @[¬\\n@\\\"Prestissimo\\\", @\\\"Presto\\\", @\\\"Allegrissimo\\\", @\\\"Vivacissimo\\\", @\\\"Vivace\\\",¬\\n@\\\"Allegro\\\", @\\\"Allegro moderato\\\", @\\\"Allegretto\\\", @\\\"Moderato\\\", @\\\"Andante moderato\\\",¬\\n@\\\"Marcia moderato\\\", @\\\"Andantino\\\", @\\\"Andante\\\", @\\\"Adagietto\\\", @\\\"Adagio\\\", @\\\"Larghetto\\\",¬\\n@\\\"Lento\\\", @\\\"Largo\\\", @\\\"Grave\\\", @\\\"Larghissimo\\\"]\\n\\nr = fn CGRectMake( 10, 460, 140, 22 )\\nfor i = 1 to 20\\ntextlabel i, tempo[i-1], r, _window\\nControlSetAlignment( i, NSTextAlignmentRight )\\nControlSetFontWithName( i, @\\\"Menlo\\\", 11.5 )\\nr = fn CGRectOffset( r, 0, -23.2 )\\nnext\\nend fn\\n\\n\\nlocal fn StopTimer\\n'~'1\\nCFRunLoopTimerRef t = (CFRunLoopTimerRef)fn AppProperty( @\\\"timer\\\" )\\nif ( fn TimerIsValid( t ) )\\nTimerInvalidate( t )\\nColorWellSetColor( _bpmIndicator, fn ColorGreen )\\nend if\\nend fn\\n\\n\\nlocal fn RunMetronome( bpm as CFTimeInterval )\\n'~'1\\n\\n// Uncomment these lines to use an external sound file name toc.wave\\n// CFURLRef soundURL = fn BundleURLForSoundResource( fn BundleMain, @\\\"toc.wav\\\" )\\n// SoundRef tocSound = fn SoundWithContentsOfURL( soundURL, NO )\\n\\n// Comment this line out to use external sound file for tock sound\\nSoundRef tocSound = fn SoundNamed( @\\\"Pop\\\" )\\n\\nCFTimeInterval interval = 60.0 / bpm\\nCFRunLoopTimerRef tocTimer = timerbegin 0.0, interval, YES\\nColorRef color\\nif ( fn ObjectIsEqual( fn ColorWellColor( _bpmIndicator ), fn ColorGreen ) )\\ncolor = fn ColorGray\\nColorWellSetColor( _bpmIndicator, color )\\nelse\\ncolor = fn ColorGreen\\nColorWellSetColor( _bpmIndicator, color )\\nend if\\n\\nfn SoundStop( tocSound )\\nfn SoundPlay( tocSound )\\ntimerend\\nAppSetProperty( @\\\"timer\\\", tocTimer )\\nend fn\\n\\n\\nvoid local fn DoAppEvent( ev as long )\\n'~'1\\nselect (ev)\\ncase _appDidFinishLaunching\\nfn BuildMenus\\nfn BuildWindow\\nfn RunMetronome( _initialBPM )\\n\\ncase _appShouldTerminateAfterLastWindowClosed\\nAppEventSetBool(YES)\\nend select\\nend fn\\n\\n\\nvoid local fn DoMenu( menuID as long, itemID as long )\\n'~'1\\nselect (menuID)\\ncase _mApplication\\nselect (itemID)\\ncase _iPreferences\\nend select\\nend select\\nend fn\\n\\n\\nvoid local fn DoDialog( ev as long, tag as long, wnd as long )\\n'~'1\\nselect ( ev )\\ncase _btnClick\\nselect ( tag )\\ncase _slider : fn StopTimer : fn RunMetronome( fn ControlIntegerValue( tag ) )\\nend select\\nend 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\": \"package main\\n\\nimport (\\n\\t\\\"fmt\\\"\\n\\t\\\"time\\\"\\n)\\n\\nfunc main() {\\n\\tvar bpm = 72.0 // Beats Per Minute\\n\\tvar bpb = 4 // Beats Per Bar\\n\\n\\td := time.Duration(float64(time.Minute) / bpm)\\n\\tfmt.Println(\\\"Delay:\\\", d)\\n\\tt := time.NewTicker(d)\\n\\ti := 1\\n\\tfor _ = range t.C {\\n\\t\\ti--\\n\\t\\tif i == 0 {\\n\\t\\t\\ti = bpb\\n\\t\\t\\tfmt.Printf(\\\"\\\\nTICK \\\")\\n\\t\\t} else {\\n\\t\\t\\tfmt.Printf(\\\"tick \\\")\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Control.Concurrent\\nimport Control.Concurrent.MVar\\nimport System.Process (runCommand)\\n\\n-- This program works only on the GHC compiler because of the use of\\n-- threadDelay\\n\\ndata Beep = Stop | Hi | Low\\n\\ntype Pattern = [Beep]\\n\\ntype BeatsPerMinute = Int\\n\\nminute = 60000000 -- 1 minute = 60,000,000 microseconds\\n\\n-- give one of the following example patterns to the metronome function\\n\\npattern4_4 = [Hi, Low, Low, Low]\\npattern2_4 = [Hi, Low]\\npattern3_4 = [Hi, Low, Low]\\npattern6_8 = [Hi, Low, Low, Low, Low, Low]\\n\\n-- use this version if you can't play audio, use Windows or don't\\n-- have audio files to play\\n-- beep :: Beep -> IO ()\\n-- beep Stop = return ()\\n-- beep Hi = putChar 'H'\\n-- beep Low = putChar 'L'\\n\\n-- use this version if you can and want to play audio on Linux using\\n-- Alsa. Change the name of the files to those of your choice\\n\\nbeep Stop = return ()\\nbeep Hi = putChar 'H' >> runCommand \\\"aplay hi.wav &> /dev/null\\\" >> return ()\\nbeep Low = putChar 'L' >> runCommand \\\"aplay low.wav &> /dev/null\\\" >> return ()\\n\\ntick :: MVar Pattern -> BeatsPerMinute -> IO ()\\ntick b i = do\\n t <- readMVar b\\n case t of\\n [Stop] -> return ()\\n x -> do\\n mapM_ (\\\\v -> forkIO (beep v) >> threadDelay (minute `div` i)) t\\n tick b i\\n\\nmetronome :: Pattern -> BeatsPerMinute -> IO ()\\nmetronome p i = do\\n putStrLn \\\"Press any key to stop the metronome.\\\"\\n b <- newMVar p\\n _ <- forkIO $ tick b i\\n _ <- getChar\\n putMVar b [Stop]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"MET=: _ _&$: :(4 : 0)\\n\\n 'BEL BS LF CR'=. 7 8 10 13 { a.\\n '`print stime delay'=. 1!:2&4`(6!:1)`(6!:3)\\n ticker=. 2 2$'\\\\ /'\\n 'small large'=. (BEL,2#BS) ; 5#BS\\n clrln=. CR,(79#' '),CR\\n\\n x=. 2 ({.,) x\\n y=. _1 |.&.> 2 ({.,) y\\n 'i j'=. 0\\n print 'bpb \\\\ bpm \\\\ ' , 2#BS\\n delay 1\\n\\n x=. ({. , ('ti t'=. stime'') + {:) x\\n while. x *./@:> i,t do.\\n\\n 'bpb bpm'=. {.@> y=. 1 |.&.> y\\n dl=. 60 % bpm\\n\\n print clrln,(\\\":bpb),' ',(ticker {~ 2 | i=. >: i),' ',(\\\":bpm),' '\\n\\n for. i. bpb do.\\n print small ,~ ticker {~ 2 | j=. >: j\\n delay 0 >. (t=. t + dl) - stime ''\\n end.\\n\\n end.\\n\\n print clrln\\n i , j , t - ti\\n\\n)\\n\\n\\nNB. Basic tacit version; this is probably considered bad coding style. At least I removed the \\\"magic constants\\\". Sort of.\\nNB. The above version is by far superior.\\n'BEL BS LF'=: 7 8 10 { a.\\n'`print delay'=: 1!:2&4`(6!:3)\\nmet=: _&$: :((] ({:@] [ LF print@[ (-.@{.@] [ delay@[ print@] (BEL,2#BS) , (2 2$'\\\\ /') {~ {.@])^:({:@])) 1 , <.@%) 60&% [ print@('\\\\ '\\\"_))\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"class Metronome{\\n\\tdouble bpm;\\n\\tint measure, counter;\\n\\tpublic Metronome(double bpm, int measure){\\n\\t\\tthis.bpm = bpm;\\n\\t\\tthis.measure = measure;\\t\\n\\t}\\n\\tpublic void start(){\\n\\t\\twhile(true){\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tThread.sleep((long)(1000*(60.0/bpm)));\\n\\t\\t\\t}catch(InterruptedException e) {\\n\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t}\\n\\t\\t\\tcounter++;\\n\\t\\t\\tif (counter%measure==0){\\n\\t\\t\\t\\t System.out.println(\\\"TICK\\\");\\n\\t\\t\\t}else{\\n\\t\\t\\t\\t System.out.println(\\\"TOCK\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\npublic class test {\\n\\tpublic static void main(String[] args) {\\n\\t\\tMetronome metronome1 = new Metronome(120,4);\\n\\t\\tmetronome1.start();\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.awt.Color;\\nimport java.awt.Dimension;\\nimport java.awt.EventQueue;\\nimport java.io.IOException;\\nimport java.net.URL;\\nimport java.util.concurrent.Executors;\\nimport java.util.concurrent.ScheduledExecutorService;\\nimport java.util.concurrent.TimeUnit;\\n\\nimport javax.sound.sampled.AudioInputStream;\\nimport javax.sound.sampled.AudioSystem;\\nimport javax.sound.sampled.Clip;\\nimport javax.sound.sampled.LineUnavailableException;\\nimport javax.sound.sampled.UnsupportedAudioFileException;\\nimport javax.swing.ImageIcon;\\nimport javax.swing.JFrame;\\nimport javax.swing.JPanel;\\n\\npublic final class MetronomeTask {\\n\\n\\tpublic static void main(String[] aArgs) {\\n\\t\\tEventQueue.invokeLater( () -> { new Metronome(60, 4, 1).start(); } );\\n\\t}\\t\\n\\n}\\n\\nfinal class Metronome extends JPanel {\\n\\t\\n\\tpublic Metronome(int aBeatsPerMinute, int aMeasure, int aDurationInMinutes) {\\n\\t\\tbeatsPerMinute = aBeatsPerMinute; measure = aMeasure; durationInMinutes = aDurationInMinutes;\\n\\t\\tSoundEffect.initialise();\\n\\t\\tcreateAndShowGUI();\\n\\t}\\n\\t\\n\\tpublic void start() {\\n\\t\\texecutorService = Executors.newSingleThreadScheduledExecutor();\\n\\t\\texecutorService.scheduleAtFixedRate(provideService, 1, 1, TimeUnit.SECONDS);\\t\\n\\t}\\t\\n\\t\\n\\tprivate void createAndShowGUI() {\\n\\t\\tJFrame.setDefaultLookAndFeelDecorated(true);\\n frame = new JFrame(\\\"Metronome\\\");\\n frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\\n frame.setIconImage( new ImageIcon(\\\"./metronomeJava.png\\\").getImage() );\\n frame.add(createPanel());\\n frame.pack();\\n\\t\\tframe.setLocationRelativeTo(null);\\n\\t\\tframe.setResizable(false);\\n frame.setVisible(true);\\n\\t}\\n\\t\\n\\tprivate JPanel createPanel() {\\n\\t\\tsetPreferredSize( new Dimension(800, 600) );\\n setBackground(Color.CYAN);\\n return this;\\n\\t}\\t\\n\\t\\n\\tprivate JFrame frame;\\n\\tprivate ScheduledExecutorService executorService;\\n\\tprivate int beatsPerMinute, measure, durationInMinutes, counter;\\t\\n\\t\\n\\tprivate Runnable provideService = () -> {\\t\\n\\t\\tif ( counter < durationInMinutes * beatsPerMinute ) {\\n\\t\\t\\tcounter++;\\n\\t\\t\\tif ( counter % measure != 0 ) {\\n\\t\\t\\t\\tSoundEffect.Tick.play();\\n\\t\\t\\t\\tif ( getBackground() != Color.PINK ) {\\n\\t\\t\\t\\t\\tsetBackground(Color.PINK);\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tsetBackground(Color.CYAN);\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tSoundEffect.Tock.play();\\n\\t\\t\\t\\tsetBackground(Color.ORANGE);\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\texecutorService.shutdown();\\n\\t\\t\\tframe.dispose();\\n\\t\\t\\tRuntime.getRuntime().exit(0);\\n\\t\\t}\\n\\t};\\n\\t\\n}\\n\\nenum SoundEffect {\\n\\t\\n Tick(\\\"./metronomeTickJava.wav\\\"), Tock(\\\"./metronomeTockJava.wav\\\");\\n\\t\\n public static void initialise() {\\n \\tvalues();\\n }\\n\\n public void play() {\\n \\tif ( clip.isRunning() ) {\\n \\t\\tclip.stop();\\n \\t}\\n\\t\\t\\tclip.setFramePosition(0);\\n\\t\\t\\tclip.start();\\n }\\n\\n private SoundEffect(String soundFileName) {\\n \\tURL url = getClass().getClassLoader().getResource(soundFileName);\\n try ( AudioInputStream audioInputStream = AudioSystem.getAudioInputStream(url) ) {\\n clip = AudioSystem.getClip();\\n clip.open(audioInputStream);\\n } catch (IOException | LineUnavailableException | UnsupportedAudioFileException ex) {\\n ex.printStackTrace();\\n }\\n }\\n\\n private Clip clip;\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function metronome(bpm::Real=72, bpb::Int=4)\\n s = 60.0 / bpm\\n counter = 0\\n while true\\n counter += 1\\n if counter % bpb != 0\\n println(\\\"tick\\\")\\n else\\n println(\\\"TICK\\\")\\n end\\n sleep(s)\\n end\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nfun metronome(bpm: Int, bpb: Int, maxBeats: Int = Int.MAX_VALUE) {\\n val delay = 60_000L / bpm\\n var beats = 0\\n do {\\n Thread.sleep(delay)\\n if (beats % bpb == 0) print(\\\"\\\\nTICK \\\")\\n else print(\\\"tick \\\")\\n beats++\\n }\\n while (beats < maxBeats)\\n println()\\n}\\n\\nfun main(args: Array<String>) = metronome(120, 4, 20) // limit to 20 beats\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \" WindowWidth =230\\n WindowHeight =220\\n\\n button #w.b1 \\\"Start\\\", [start], LR, 110, 90, 55, 20\\n button #w.b2 \\\"Tempo\\\", [tempo], LR, 180, 90, 55, 20\\n button #w.b3 \\\"Pattern\\\", [pattern], LR, 40, 90, 55, 20\\n\\n open \\\"Metronome\\\" for graphics_nsb_nf as #w\\n\\n #w \\\"trapclose quit\\\"\\n #w \\\"down\\\"\\n #w \\\"fill darkblue ; backcolor darkblue ; color white\\\"\\n\\n tempo = 60 ' per minute\\n interval =1000 /(tempo /60) ' timer works in ms\\n tickCount = 0 ' cycle counter\\n running = 1 ' flag for state\\n bar$ = \\\"HLLL\\\" ' initially strong-weak-weak-weak\\n count = len( bar$)\\n\\n wait\\n\\nsub quit w$\\n close #w$\\n end\\nend sub\\n\\n[start]\\n if running =1 then\\n running =0\\n #w.b1 \\\"Stop\\\"\\n #w.b2 \\\"!disable\\\"\\n #w.b3 \\\"!disable\\\"\\n else\\n running =1\\n #w.b1 \\\"Start\\\"\\n #w.b2 \\\"!enable\\\"\\n #w.b3 \\\"!enable\\\"\\n end if\\n if running =0 then timer interval, [tick] else timer 0\\n wait\\n\\n[tempo]\\n prompt \\\"New tempo 30...360\\\"; tempo$\\n tempo =val( tempo$)\\n tempo =min( tempo, 360)\\n tempo =max( tempo, 30)\\n interval =int( 1000 /(tempo /60))\\n wait\\n\\n[pattern]\\n prompt \\\"New Pattern, eg 'HLLL' \\\"; bar$\\n count =len( bar$)\\n if count <2 or count >8 then goto [pattern]\\n\\n wait\\n\\n[tick]\\n 'beep and flash\\n #w \\\"place 115 40\\\"\\n\\n if mid$( bar$, tickCount +1, 1) =\\\"H\\\" then\\n playwave \\\"mHi.wav\\\", async\\n #w \\\"backcolor blue ; color white ; circlefilled \\\"; 20 -tickCount *2\\n else\\n playwave \\\"mLo.wav\\\", async\\n #w \\\"backcolor cyan ; circlefilled \\\"; 20 -tickCount *2\\n end if\\n\\n #w \\\"place 50 140 ; backcolor darkblue ; color white\\\"\\n #w \\\"\\\\ \\\"; tempo; \\\" beats /min.\\\"\\n #w \\\"place 85 160\\\"\\n #w \\\"\\\\\\\"; bar$\\n\\n #w \\\"place 85 120\\\"\\n #w \\\"\\\\Beat # \\\"; tickCount +1\\n\\n #w \\\"place 115 40\\\"\\n #w \\\"color darkblue\\\"\\n\\n tickCount =( tickCount +1) mod count\\n\\n #w \\\"flush\\\"\\n\\n wait\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"10 bpm=120:bpb=4\\n20 sleep=50*60/bpm\\n30 counter=0\\n40 every sleep gosub 100\\n50 goto 50\\n100 print counter+1;\\\" \\\";\\n110 if counter=0 then print \\\">TICK<\\\":sound 1,60,10,15 else print \\\" tick \\\":sound 1,119,10\\n120 counter=counter+1\\n130 if counter=bpb then counter=0\\n140 return\\n\",\n \"language\": \"Locomotive-Basic\"\n },\n {\n \"code\": \"s = Sound[Play[Sin[1000 t], {t, 0, 0.05}]];\\nss = Sound[Play[Sin[2000 t], {t, 0, 0.05}]];\\nbpm = 180;\\nslp = 60/bpm;\\ncolor = White;\\ni = 0;\\nDynamic[Graphics[{color, Disk[]}, ImageSize -> 50]]\\nWhile[True,\\n i = Mod[i + 1, 4, 1];\\n color = {Green, Red, Darker@Red, Red, Darker@Red}[[i]];\\n If[i == 1,\\n EmitSound[ss]\\n ,\\n EmitSound[s]\\n ];\\n Pause[slp];\\n ]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import os\\n\\nproc metronome(tempo, pattern: Positive) =\\n let delay = 60_000 div tempo # In milliseconds.\\n var beats = 0\\n while true:\\n stdout.write if beats mod pattern == 0: \\\"\\\\nTICK\\\" else: \\\" tick\\\"\\n stdout.flushFile\\n inc beats\\n sleep(delay)\\n\\nmetronome(72, 4)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use Time::HiRes qw(sleep gettimeofday);\\n\\nlocal $| = 1; # autoflush\\n\\nmy $beats_per_minute = shift || 72;\\nmy $beats_per_bar = shift || 4;\\n\\nmy $i = 0;\\nmy $duration = 60 / $beats_per_minute;\\nmy $base_time = gettimeofday() + $duration;\\n\\nfor (my $next_time = $base_time ; ; $next_time += $duration) {\\n if ($i++ % $beats_per_bar == 0) {\\n print \\\"\\\\nTICK\\\";\\n }\\n else {\\n print \\\" tick\\\";\\n }\\n sleep($next_time - gettimeofday());\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\n\\nuse strict;\\nuse warnings;\\nuse Tk;\\n\\nmy $active = 0;\\nmy $bpm = 60;\\nmy $x = 100;\\n\\nmy $mw = MainWindow->new;\\n$mw->title( \\\"Metronome\\\" );\\nmy $c = $mw->Canvas(\\n )->pack(-fill => 'both', -expand => 1);\\n$mw->Scale( -orient => 'horizontal', -from => 30, -to => 150,\\n -variable => \\\\$bpm, -label => 'Beats per Minute',\\n )->pack(-fill => 'x');\\n$mw->Button( -text => 'Exit', -command => sub {$mw->destroy},\\n )->pack(-side => 'right');\\n$mw->Button( -text => 'Start / Pause', -command => sub {$active ^= 1; tick()},\\n )->pack(-side => 'right');\\n$mw->bind('<Configure>' => sub {$x = $c->width >> 2} );\\n\\nMainLoop;\\n\\nsub tick\\n {\\n $active or return;\\n# $mw->bell;\\n $x *= -1;\\n $c->delete('all');\\n $c->createLine( $c->width >> 1, $c->height, $c->width / 2 + $x, 30,\\n -width => 5);\\n $mw->after( 60_000 / $bpm / 2 => \\\\&tick );\\n }\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\virtunome.exw\\n --\\n -- Originally by ghaberek\\n -- Translated from win32lib by Pete Lomax\\n --\\n -- I will note that accuracy drops sharply above 5 beats per second.\\n --</span>\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- needs some work though, usual sizing stuff [DEV]\\n -- NB: don't break Morse_code.exw when fixing this!</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: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">frame_1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">radio</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">frame_2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">val_lbl</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">frame_3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">bpm_lbl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">spb_lbl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">act_lbl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">acc_lbl</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">onbtn</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">onoff</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">timer</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">notes</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">rle_decode_image</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">data</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- (not my best work, may benefit from a rethink...)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">img</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;\\\">data</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">rle</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;\\\">line</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span> <span style=\\\"color: #000000;\\\">val</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">rpt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rle</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;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rle</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</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;\\\">RGB</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rle</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rle</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;\\\">if</span> <span style=\\\"color: #000000;\\\">RGB</span><span style=\\\"color: #0000FF;\\\">=-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">RGBs</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetGlobal</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"DLGBGCOLOR\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">val</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">scanf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">RGBs</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%d %d %d\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">RGB</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">val</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;\\\">3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">9</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: #000000;\\\">val</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">#FF</span>\\n <span style=\\\"color: #000000;\\\">line</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">flatten</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">val</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">img</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">flatten</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">line</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rpt</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;\\\">img</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span>\\n <span style=\\\"color: #000000;\\\">Whole_note</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">13</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">32</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;\\\">12</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</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;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</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;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">9</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;\\\">9</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;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">8</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;\\\">8</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;\\\">6</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;\\\">8</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;\\\">8</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;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</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;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</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><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</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;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</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><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;\\\">8</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;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</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;\\\">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;\\\">9</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;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000000;\\\">Half_note</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">30</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">21</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;\\\">10</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;\\\">14</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</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><span style=\\\"color: #000000;\\\">10</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;\\\">12</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</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;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</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;\\\">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;\\\">10</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;\\\">10</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;\\\">5</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;\\\">10</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;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</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><span style=\\\"color: #000000;\\\">0</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;\\\">10</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;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</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;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</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;\\\">10</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;\\\">5</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;\\\">10</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;\\\">10</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;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</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;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</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: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><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;\\\">7</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">14</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000000;\\\">Eigth_note</span> <span style=\\\"color: #0000FF;\\\">=</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;\\\">17</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;\\\">14</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;\\\">17</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;\\\">13</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;\\\">17</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</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;\\\">12</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;\\\">17</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</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;\\\">17</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;\\\">10</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;\\\">17</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">9</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;\\\">17</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;\\\">5</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">8</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;\\\">17</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;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</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;\\\">17</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;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</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;\\\">17</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;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</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;\\\">6</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;\\\">17</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;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</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;\\\">5</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;\\\">17</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;\\\">7</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;\\\">5</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;\\\">17</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;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</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;\\\">4</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;\\\">17</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;\\\">8</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;\\\">4</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">17</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;\\\">9</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;\\\">4</span><span style=\\\"color: #0000FF;\\\">},</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: #000000;\\\">17</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;\\\">8</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;\\\">5</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">17</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;\\\">14</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;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">14</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;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">14</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;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">14</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;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">14</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;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">14</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;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</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>\\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;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">16</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;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">18</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;\\\">9</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;\\\">21</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000000;\\\">Quarter_note</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">30</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">21</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;\\\">10</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;\\\">15</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</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;\\\">13</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</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;\\\">12</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</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;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</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;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</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;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</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;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</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: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><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;\\\">7</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">14</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;\\\">13</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;\\\">17</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000000;\\\">Sixteenth_note</span> <span style=\\\"color: #0000FF;\\\">=</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;\\\">17</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;\\\">14</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;\\\">17</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;\\\">13</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;\\\">17</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</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;\\\">12</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;\\\">17</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</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;\\\">17</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;\\\">10</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;\\\">17</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">9</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;\\\">17</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">8</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;\\\">17</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;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</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;\\\">17</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;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</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;\\\">17</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;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</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;\\\">6</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;\\\">17</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</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;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</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;\\\">5</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;\\\">17</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</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;\\\">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;\\\">5</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;\\\">17</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;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</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;\\\">4</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;\\\">17</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</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;\\\">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;\\\">4</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;\\\">17</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</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;\\\">2</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>\\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;\\\">17</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;\\\">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;\\\">1</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;\\\">4</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;\\\">17</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;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</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>\\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;\\\">17</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;\\\">5</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;\\\">4</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;\\\">17</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;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</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>\\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;\\\">17</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;\\\">8</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;\\\">4</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;\\\">17</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;\\\">9</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;\\\">4</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">17</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;\\\">9</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;\\\">3</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;\\\">17</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;\\\">9</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;\\\">4</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;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">8</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;\\\">4</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;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">8</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;\\\">5</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;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">8</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;\\\">5</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;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">14</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;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">14</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;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</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>\\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;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">16</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;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">18</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;\\\">9</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;\\\">21</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">note</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- quarter initially</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">vLastTime</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0.0</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- for time resolution</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- in bpm</span>\\n <span style=\\\"color: #000000;\\\">MIN_TEMPO</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">DEF_TEMPO</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">90</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">MAX_TEMPO</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">200</span>\\n\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">vMSPB</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">667</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- default milliseconds per beat</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">Tempos</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"Grave\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Largo\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Adagio\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Lento\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Adante\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Moderato\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"Allegretto\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Allegro\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Presto\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Vivance\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Prestissimo\\\"</span><span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">set_tempo</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">pBPM</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">pNote</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- returns tempo index</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">index</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(((</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">Tempos</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">pBPM</span><span style=\\\"color: #0000FF;\\\">)/(</span><span style=\\\"color: #000000;\\\">MAX_TEMPO</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">MIN_TEMPO</span><span style=\\\"color: #0000FF;\\\">))+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">lSPB</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">60</span> <span style=\\\"color: #0000FF;\\\">/</span> <span style=\\\"color: #000000;\\\">pBPM</span> <span style=\\\"color: #0000FF;\\\">/</span> <span style=\\\"color: #000000;\\\">pNote</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- seconds per beat</span>\\n <span style=\\\"color: #000000;\\\">vMSPB</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span> <span style=\\\"color: #000000;\\\">lSPB</span> <span style=\\\"color: #0000FF;\\\">*</span> <span style=\\\"color: #000000;\\\">1000</span> <span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #7060A8;\\\">IupSetStrAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">spb_lbl</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"TITLE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%.2f\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">lSPB</span><span style=\\\"color: #0000FF;\\\">})</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;\\\">\\\"TIME\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">vMSPB</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</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> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- restart needed to apply new TIME (not doc?)</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: #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;\\\">true</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;\\\">index</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;\\\">tempo_change</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">lBPM</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">val_lbl</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"TITLE\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">lIndex</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">set_tempo</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lBPM</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">note</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetStrAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">frame_2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"TITLE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Tempo: %s \\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">Tempos</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">lIndex</span><span style=\\\"color: #0000FF;\\\">]})</span>\\n <span style=\\\"color: #000000;\\\">vLastTime</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</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;\\\">toggle_state_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">ih</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">state</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">state</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">note</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ih</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">notes</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 1/2/4/8/16</span>\\n <span style=\\\"color: #000000;\\\">tempo_change</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- and shift focus away, since it looks ugly w/o any text</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetFocus</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">onbtn</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;\\\">valuechanged_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">val</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">v</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">val</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"VALUE\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">val_lbl</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"TITLE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetStrAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">bpm_lbl</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"TITLE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%.2f\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">tempo_change</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;\\\">include</span> <span style=\\\"color: #000000;\\\">builtins</span><span style=\\\"color: #0000FF;\\\">\\\\</span><span style=\\\"color: #7060A8;\\\">beep</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</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: #7060A8;\\\">beep</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">#200</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">lThisTime</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">vLastTime</span> <span style=\\\"color: #0000FF;\\\">></span> <span style=\\\"color: #000000;\\\">0.0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">lDiff</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lThisTime</span> <span style=\\\"color: #0000FF;\\\">-</span> <span style=\\\"color: #000000;\\\">vLastTime</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">lResolution</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">((</span><span style=\\\"color: #000000;\\\">lDiff</span> <span style=\\\"color: #0000FF;\\\">*</span> <span style=\\\"color: #000000;\\\">1000</span><span style=\\\"color: #0000FF;\\\">)/</span> <span style=\\\"color: #000000;\\\">vMSPB</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">*</span> <span style=\\\"color: #000000;\\\">100</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetStrAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">act_lbl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"TITLE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"%0.2f\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">lDiff</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetStrAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">acc_lbl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"TITLE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"%d%%\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">lResolution</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">vLastTime</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">lThisTime</span>\\n\\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;\\\">button_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: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">active</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: #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: #000000;\\\">active</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ih</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"TITLE\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"Off\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"On\\\"</span><span style=\\\"color: #0000FF;\\\">}[</span><span style=\\\"color: #000000;\\\">active</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: #004600;\\\">IUP_DEFAULT</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #7060A8;\\\">IupOpen</span><span style=\\\"color: #0000FF;\\\">()</span>\\n\\n <span style=\\\"color: #000000;\\\">notes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">IupImageRGBA</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">rle_decode_image</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">Whole_note</span><span style=\\\"color: #0000FF;\\\">)),</span>\\n <span style=\\\"color: #7060A8;\\\">IupImageRGBA</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">40</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">rle_decode_image</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">Half_note</span><span style=\\\"color: #0000FF;\\\">)),</span>\\n <span style=\\\"color: #7060A8;\\\">IupImageRGBA</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">40</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">rle_decode_image</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">Quarter_note</span><span style=\\\"color: #0000FF;\\\">)),</span>\\n <span style=\\\"color: #7060A8;\\\">IupImageRGBA</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">40</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">rle_decode_image</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">Eigth_note</span><span style=\\\"color: #0000FF;\\\">)),</span>\\n <span style=\\\"color: #7060A8;\\\">IupImageRGBA</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">40</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">rle_decode_image</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">Sixteenth_note</span><span style=\\\"color: #0000FF;\\\">))}</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">btns</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;\\\">notes</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">btn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupToggle</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"toggle_state_cb\\\"</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #008000;\\\">\\\"CANFOCUS=NO\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">lbl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupLabel</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetAttributeHandle</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lbl</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"IMAGE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">notes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #000000;\\\">btns</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">btn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">lbl</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #000000;\\\">notes</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;\\\">btn</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">radio</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupRadio</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">IupHbox</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">btns</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"GAP=20\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">frame_1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupFrame</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">radio</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"MARGIN=20x10\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">frame_1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"TITLE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Note \\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000000;\\\">val_lbl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupLabel</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\" 200\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"ALIGNMENT=ARIGHT\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">val</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupValuator</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"HORIZONTAL\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"EXPAND=HORIZONTAL, CANFOCUS=NO\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">val</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"MIN\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">MIN_TEMPO</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">val</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"MAX\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">MAX_TEMPO</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">val</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"VALUE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">DEF_TEMPO</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetCallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">val</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\\n <span style=\\\"color: #000000;\\\">frame_2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupFrame</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">IupHbox</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">val_lbl</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">val</span><span style=\\\"color: #0000FF;\\\">}),</span><span style=\\\"color: #008000;\\\">`TITLE=\\\"Tempo: \\\"`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000000;\\\">bpm_lbl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupLabel</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"90.00\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"ALIGNMENT=ARIGHT, EXPAND=HORIZONTAL\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">act_lbl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupLabel</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"0.00\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"ALIGNMENT=ARIGHT, EXPAND=HORIZONTAL\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">spb_lbl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupLabel</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"0.67\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"ALIGNMENT=ARIGHT, EXPAND=HORIZONTAL\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">acc_lbl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupLabel</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"0%\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"ALIGNMENT=ARIGHT, EXPAND=HORIZONTAL\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000000;\\\">frame_3</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupFrame</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">IupHbox</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: #7060A8;\\\">IupLabel</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Beats Per Minute:\\\"</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">bpm_lbl</span><span style=\\\"color: #0000FF;\\\">}),</span>\\n <span style=\\\"color: #7060A8;\\\">IupHbox</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #7060A8;\\\">IupLabel</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Seconds Per Beat:\\\"</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">spb_lbl</span><span style=\\\"color: #0000FF;\\\">})},</span>\\n <span style=\\\"color: #008000;\\\">\\\"GAP=10,MARGIN=10x0\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <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: #7060A8;\\\">IupLabel</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Actual Seconds Per Beat:\\\"</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">act_lbl</span><span style=\\\"color: #0000FF;\\\">}),</span>\\n <span style=\\\"color: #7060A8;\\\">IupHbox</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #7060A8;\\\">IupLabel</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Accuracy:\\\"</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">acc_lbl</span><span style=\\\"color: #0000FF;\\\">})},</span>\\n <span style=\\\"color: #008000;\\\">\\\"GAP=10,MARGIN=10x0\\\"</span><span style=\\\"color: #0000FF;\\\">)}),</span>\\n <span style=\\\"color: #008000;\\\">`TITLE=\\\"Statistics \\\",MARGIN=4x8`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000000;\\\">onbtn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupButton</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"On\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"button_cb\\\"</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">\\\"PADDING=30x0\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">onoff</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupHbox</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #7060A8;\\\">IupFill</span><span style=\\\"color: #0000FF;\\\">(),</span><span style=\\\"color: #000000;\\\">onbtn</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #008000;\\\">\\\"MARGIN=0x20\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\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: #000000;\\\">frame_1</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">frame_2</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">frame_3</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">onoff</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #008000;\\\">\\\"MARGIN=10x5, GAP=5\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- `TITLE=\\\"Virtunome\\\",RASTERSIZE=500x330`)</span>\\n <span style=\\\"color: #008000;\\\">`TITLE=\\\"Virtunome\\\"`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #7060A8;\\\">IupShow</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- The TIME and RUN attributes are set dynamically:</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;\\\">vMSPB</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\\n <span style=\\\"color: #7060A8;\\\">IupSetInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">val_lbl</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"TITLE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">DEF_TEMPO</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetAttributeHandle</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">radio</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"VALUE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">btns</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #000000;\\\">tempo_change</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<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(de metronome (Bpm)\\n (if (fork)\\n (let Pid @\\n (for Pendulum '(\\\" /\\\" . (\\\"^H^H\\\\\\\\ \\\" \\\"^H^H /\\\" .))\\n (tell Pid 'call \\\"/usr/bin/beep\\\" \\\"-f\\\" 440 \\\"-l\\\" 40)\\n (prin Pendulum)\\n (T (key (*/ 30000 Bpm)) (tell Pid 'bye)) )\\n (prinl) )\\n (wait) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \": (metronome 60)\\n /\\n-> NIL # A key was hit\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"Structure METRONOMEs\\n msPerBeat.i\\n BeatsPerMinute.i\\n BeatsPerCycle.i\\n volume.i\\n canvasGadget.i\\n w.i\\n h.i\\n originX.i\\n originY.i\\n radius.i\\n activityStatus.i\\nEndStructure\\n\\nEnumeration ;gadgets\\n #TEXT_MSPB ;milliseconds per beat\\n #STRING_MSPB ;milliseconds per beat\\n #TEXT_BPM ;beats per minute\\n #STRING_BPM ;beats per minute\\n #TEXT_BPC ;beats per cycle\\n #STRING_BPC ;beats per cycle\\n #BUTTON_VOLM ;volume -\\n #BUTTON_VOLP ;volume +\\n #BUTTON_START ;start\\n #SPIN_BPM\\n #CANVAS_METRONOME\\nEndEnumeration\\n\\nEnumeration ;sounds\\n #SOUND_LOW\\n #SOUND_HIGH\\nEndEnumeration\\n\\n#WINDOW = 0 ;window\\n\\nProcedure handleError(Value, text.s)\\n If Not Value: MessageRequester(\\\"Error\\\", text): End: EndIf\\nEndProcedure\\n\\nProcedure drawMetronome(*m.METRONOMEs, Angle.f, cycleCount = 0)\\n Protected CircleX, CircleY, circleColor\\n If StartDrawing(CanvasOutput(*m\\\\canvasGadget))\\n Box(0, 0, *m\\\\w, *m\\\\h, RGB(0, 0, 0))\\n CircleX = Int(*m\\\\radius * Cos(Radian(Angle)))\\n CircleY = Int(*m\\\\radius * Sin(Radian(Angle)))\\n If Angle = 90\\n If cycleCount: circleColor = RGB(255, 0, 0): Else: circleColor = RGB(0, 255, 0): EndIf\\n LineXY(*m\\\\originX, *m\\\\originY, *m\\\\originX, *m\\\\originY - CircleY, RGB(255, 255, 0))\\n Circle(*m\\\\originX + CircleX, *m\\\\originY - CircleY - *m\\\\radius * 0.15, 10, circleColor)\\n Else\\n LineXY(*m\\\\originX, *m\\\\originY - *m\\\\radius * 1.02, *m\\\\originX, *m\\\\originY - *m\\\\radius, RGB(255, 255, 0))\\n LineXY(*m\\\\originX, *m\\\\originY, *m\\\\originX + CircleX, *m\\\\originY - CircleY, RGB(255, 255, 0))\\n EndIf\\n\\n StopDrawing()\\n\\n ProcedureReturn 1\\n EndIf\\nEndProcedure\\n\\nProcedure.i Metronome(*m.METRONOMEs)\\n Protected milliseconds = Int((60 * 1000) / *m\\\\BeatsPerMinute)\\n Protected msPerFrame, framesPerBeat\\n Protected i, j, cycleCount, startTime, frameEndTime, delayTime, delayError, h.f\\n\\n ;calculate metronome angles for each frame of animation\\n If *m\\\\BeatsPerMinute < 60\\n framesPerBeat = Round(milliseconds / 150, #PB_Round_Nearest)\\n Else\\n framesPerBeat = Round((*m\\\\BeatsPerMinute - 420) / -60, #PB_Round_Nearest)\\n EndIf\\n\\n If framesPerBeat < 1\\n framesPerBeat = 1\\n Dim metronomeFrameAngle.f(1, framesPerBeat)\\n metronomeFrameAngle(0, 1) = 90\\n metronomeFrameAngle(1, 1) = 90\\n Else\\n Dim metronomeFrameAngle.f(1, framesPerBeat * 2)\\n For j = 1 To framesPerBeat\\n h = 45 / framesPerBeat\\n metronomeFrameAngle(0, j) = 90 - h * (j - 1)\\n metronomeFrameAngle(0, framesPerBeat + j) = 45 + h * (j - 1)\\n metronomeFrameAngle(1, j) = 90 + h * (j - 1)\\n metronomeFrameAngle(1, framesPerBeat + j) = 135 - h * (j - 1)\\n Next\\n framesPerBeat * 2\\n EndIf\\n msPerFrame = milliseconds / framesPerBeat\\n\\n PlaySound(#SOUND_HIGH)\\n startTime = ElapsedMilliseconds()\\n Repeat\\n For i = 0 To 1\\n frameEndTime = startTime + msPerFrame\\n For j = 1 To framesPerBeat\\n drawMetronome(*m, metronomeFrameAngle(i, j), cycleCount)\\n\\n ;check for thread exit\\n If *m\\\\activityStatus < 0\\n *m\\\\activityStatus = 0\\n ProcedureReturn\\n EndIf\\n\\n delayTime = frameEndTime - ElapsedMilliseconds()\\n If (delayTime - delayError) >= 0\\n Delay(frameEndTime - ElapsedMilliseconds() - delayError) ;wait the remainder of frame\\n ElseIf delayTime < 0\\n delayError = - delayTime\\n EndIf\\n frameEndTime + msPerFrame\\n Next\\n\\n ;check for thread exit\\n If *m\\\\activityStatus < 0\\n *m\\\\activityStatus = 0\\n ProcedureReturn\\n EndIf\\n\\n While (ElapsedMilliseconds() - startTime) < milliseconds: Wend\\n\\n SetGadgetText(*m\\\\msPerBeat, Str(ElapsedMilliseconds() - startTime))\\n cycleCount + 1: cycleCount % *m\\\\BeatsPerCycle\\n If cycleCount = 0\\n PlaySound(#SOUND_HIGH)\\n Else\\n PlaySound(#SOUND_LOW)\\n EndIf\\n startTime + milliseconds\\n Next\\n ForEver\\nEndProcedure\\n\\nProcedure startMetronome(*m.METRONOMEs, MetronomeThread) ;start up the thread with new values\\n *m\\\\BeatsPerMinute = Val(GetGadgetText(#STRING_BPM))\\n *m\\\\BeatsPerCycle = Val(GetGadgetText(#STRING_BPC))\\n *m\\\\activityStatus = 1\\n\\n If *m\\\\BeatsPerMinute\\n MetronomeThread = CreateThread(@Metronome(), *m)\\n EndIf\\n ProcedureReturn MetronomeThread\\nEndProcedure\\n\\nProcedure stopMetronome(*m.METRONOMEs, MetronomeThread) ;if the thread is running: stop it\\n If IsThread(MetronomeThread)\\n *m\\\\activityStatus = -1 ;signal thread to stop\\n EndIf\\n drawMetronome(*m, 90)\\nEndProcedure\\n\\n\\nDefine w = 360, h = 360, ourMetronome.METRONOMEs\\n\\n;initialize the metronome\\nWith ourMetronome\\n \\\\msPerBeat = #STRING_MSPB\\n \\\\canvasGadget = #CANVAS_METRONOME\\n \\\\volume = 10\\n \\\\w = w\\n \\\\h = h\\n \\\\originX = w / 2\\n \\\\originY = h / 2\\n \\\\radius = 100\\nEndWith\\n\\nourMetronome\\\\canvasGadget = #CANVAS_METRONOME\\n\\n;initialize sounds\\nhandleError(InitSound(), \\\"Sound system is Not available\\\")\\nhandleError(CatchSound(#SOUND_LOW, ?sClick, ?eClick - ?sClick), \\\"Could Not CatchSound\\\")\\nhandleError(CatchSound(#SOUND_HIGH, ?sClick, ?eClick - ?sClick), \\\"Could Not CatchSound\\\")\\nSetSoundFrequency(#SOUND_HIGH, 50000)\\nSoundVolume(#SOUND_LOW, ourMetronome\\\\volume)\\nSoundVolume(#SOUND_HIGH, ourMetronome\\\\volume)\\n\\n;setup window & GUI\\nDefine Style, i, wp, gh\\n\\nStyle = #PB_Window_SystemMenu | #PB_Window_ScreenCentered | #PB_Window_MinimizeGadget\\nhandleError(OpenWindow(#WINDOW, 0, 0, w + 200 + 12, h + 4, \\\"Metronome\\\", Style), \\\"Not OpenWindow\\\")\\nSetWindowColor(#WINDOW, $505050)\\n\\nIf LoadFont(0, \\\"tahoma\\\", 9, #PB_Font_HighQuality | #PB_Font_Bold)\\n SetGadgetFont(#PB_Default, FontID(0))\\nEndIf\\n\\ni = 3: wp = 10: gh = 22\\nTextGadget(#TEXT_MSPB, w + wp, gh * i, 100, gh, \\\"MilliSecs/Beat \\\", #PB_Text_Center)\\nStringGadget(#STRING_MSPB, w + wp + 108, gh * i, 90, gh, \\\"0\\\", #PB_String_ReadOnly): i + 2\\nTextGadget(#TEXT_BPM, w + wp, gh * i, 100, gh,\\\"Beats/Min \\\", #PB_Text_Center)\\nStringGadget(#STRING_BPM, w + wp + 108, gh * i, 90, gh, \\\"120\\\", #PB_String_Numeric): i + 2\\nGadgetToolTip(#STRING_BPM, \\\"Valid range is 20 -> 240\\\")\\nTextGadget(#TEXT_BPC, w + wp, gh * i, 100, gh,\\\"Beats/Cycle \\\", #PB_Text_Center)\\nStringGadget(#STRING_BPC, w + wp + 108, gh * i, 90, gh, \\\"4\\\", #PB_String_Numeric): i + 2\\nGadgetToolTip(#STRING_BPC, \\\"Valid range is 1 -> BPM\\\")\\nButtonGadget(#BUTTON_START, w + wp, gh * i, 200, gh, \\\"Start\\\", #PB_Button_Toggle): i + 2\\nButtonGadget(#BUTTON_VOLM, w + wp, gh * i, 100, gh, \\\"-Volume\\\")\\nButtonGadget(#BUTTON_VOLP, w + wp + 100, gh * i, 100, gh, \\\"+Volume\\\")\\nCanvasGadget(ourMetronome\\\\canvasGadget, 0, 0, ourMetronome\\\\w, ourMetronome\\\\h, #PB_Image_Border)\\ndrawMetronome(ourMetronome, 90)\\n\\nDefine msg, GID, MetronomeThread, Value\\nRepeat ;the control loop for our application\\n msg = WaitWindowEvent(1)\\n GID = EventGadget()\\n etp = EventType()\\n\\n If GetAsyncKeyState_(#VK_ESCAPE): End: EndIf ;remove when app is o.k.\\n\\n Select msg\\n\\n Case #PB_Event_CloseWindow\\n End\\n\\n Case #PB_Event_Gadget\\n Select GID\\n\\n Case #STRING_BPM\\n If etp = #PB_EventType_LostFocus\\n Value = Val(GetGadgetText(#STRING_BPM))\\n If Value > 390\\n Value = 390\\n ElseIf Value < 20\\n Value = 20\\n EndIf\\n SetGadgetText(#STRING_BPM, Str(Value))\\n EndIf\\n\\n Case #STRING_BPC\\n If etp = #PB_EventType_LostFocus\\n Value = Val(GetGadgetText(#STRING_BPC))\\n If Value > Val(GetGadgetText(#STRING_BPM))\\n Value = Val(GetGadgetText(#STRING_BPM))\\n ElseIf Value < 1\\n Value = 1\\n EndIf\\n SetGadgetText(#STRING_BPC, Str(Value))\\n EndIf\\n\\n Case #BUTTON_VOLP, #BUTTON_VOLM ;change volume\\n If GID = #BUTTON_VOLP And ourMetronome\\\\volume < 100\\n ourMetronome\\\\volume + 10\\n ElseIf GID = #BUTTON_VOLM And ourMetronome\\\\volume > 0\\n ourMetronome\\\\volume - 10\\n EndIf\\n SoundVolume(#SOUND_LOW, ourMetronome\\\\volume)\\n SoundVolume(#SOUND_HIGH, ourMetronome\\\\volume)\\n\\n Case #BUTTON_START ;the toggle button for start/stop\\n Select GetGadgetState(#BUTTON_START)\\n Case 1\\n stopMetronome(ourMetronome, MetronomeThread)\\n MetronomeThread = startMetronome(ourMetronome, MetronomeThread)\\n SetGadgetText(#BUTTON_START,\\\"Stop\\\")\\n Case 0\\n stopMetronome(ourMetronome, MetronomeThread)\\n SetGadgetText(#BUTTON_START,\\\"Start\\\")\\n EndSelect\\n\\n EndSelect\\n EndSelect\\nForEver\\nEnd\\n\\nDataSection\\n ;a small wav file saved as raw data\\n sClick:\\n Data.q $0000082E46464952,$20746D6645564157,$0001000100000010,$0000AC440000AC44\\n Data.q $6174616400080001,$8484848300000602,$8B8A898886868585,$C0B3A9A29C95918E\\n Data.q $31479BD3CED0CFCF,$3233323232323331,$BDAEC4C9A1423133,$D0CFCFD0CFD1CDD4\\n Data.q $323232333770A9CB,$2E34313332333232,$CFD0CFCACFCFAF53,$9783AAD3CED0CFD0\\n Data.q $3233313332448AA1,$4430333233323233,$CFD0CFAE7D7E9483,$B7B9C3B8BFD1CED0\\n Data.q $3233313037476898,$3E48493D32333233,$85959187775C4338,$898A8F8D807A7978\\n Data.q $737F898381888D8D,$3131435564717A77,$332F36413A343234,$827B7873695C4D37\\n Data.q $9C9B949191908F8A,$4D50515A67758694,$5451484341414245,$7B83868782756559\\n Data.q $565D5F616365676E,$7871675F57504B4E,$797C8083827E7C7B,$4D525E686C6D7176\\n Data.q $4D4B4B474343464A,$8B82796F655D5953,$7B7C83888B909392,$5153595E666F767B\\n Data.q $5A5A5B5B59575553,$696C6E6D67615E5B,$7879777573726F6B,$71727376797C7B79\\n Data.q $505352505159646C,$6B6153463C3B414A,$A09B908379706D6E,$6F767A7E858C949C\\n Data.q $4D4D4845484E5662,$80796F645B544E4C,$8487888885828283,$555A5D606369737D\\n Data.q $6A665F58524E4E51,$878E8F8B867D736D,$54606B72797F8081,$5852504F4E4E4C4D\\n Data.q $7E7B7A79756F675F,$6B6C6F757C7F8182,$6D6865676C6F6E6C,$6E6B6C7074777773\\n Data.q $615E5D60676F7372,$7069636061636463,$81817F7C7A797976,$65676B6E72797E80\\n Data.q $65625F5E5D5D5F62,$7D7C7B7875716E6A,$6F74777B7E7F7F7E,$454950565D63676A\\n Data.q $605A55504B464343,$9E9F9D978E817469,$6E7D8A93989A9B9C,$444546494C505861\\n Data.q $7B756F665C534C46,$7E82858788888580,$5C5D61666B70757A,$6A6B6B6B6965615E\\n Data.q $646B717676736F6B,$727272716D676261,$8285878885817A74,$5F5F636A72797D80\\n Data.q $645D58585A5E6060,$827D79777877746D,$7878797C80848685,$6A686664666B7075\\n Data.q $76726C666364686B,$807E7B7878787878,$656A6F74797B7D7F,$59585A5C5D5F6163\\n Data.q $84807C79746D665E,$777C81878B8C8B89,$555352555B636B72,$82776B625C595957\\n Data.q $989B9A979493918B,$656A6E7277818A92,$535457575656585E,$6E6E6F6D675E5753\\n Data.q $898C9398968D7F74,$69717E8C9697918B,$3B39414F5D656767,$695B56565A595145\\n Data.q $8986878A8F90897B,$7A7875757B848A8C,$747168605E636D76,$7B7365585257636F\\n Data.q $8C8981777272777C,$70757676767A8188,$6A6D6D68625F6269,$8687847D746C6868\\n Data.q $8485888A89868484,$585A616B747B8083,$5B555355595C5C5A,$8C898786847D7265\\n Data.q $888C9096999A9892,$6163666C72797F83,$5E554E4B4C52595E,$91887C7169676663\\n Data.q $8E8E8A88888C9193,$656666676A737E88,$655F585352555B62,$8B88837C756F6B69\\n Data.q $7E858B8E8E8B898B,$62676B6D6D6C6E74,$6C6C6B6A6764605F,$7C7978787775736F\\n Data.q $8E8C8C8C8D8D8982,$686D747C858C9091,$625C58585B5E6265,$908A837C75706C68\\n Data.q $848A8E9396989896,$545960676E757A7F,$65605E5D5B575352,$A19D9890877C746C\\n Data.q $8992979A9C9FA1A2,$525355575C64707E,$736D665D56514F50,$8D8D8B8986827E79\\n Data.q $7777797B7F84898C,$78746F6A6A6E7376,$7B79767372747879,$6C6B69686A6F757A\\n Data.q $7C78746F6D6C6C6D,$888B8C8B88858280,$6F75797B7D7F8184,$6F6D6B686565676A\\n Data.q $8785817D79747270,$868B8D8D8C8A8988,$6F73777A7C7D7F82,$6F6B68656465666A\\n Data.q $8A837D7976757472,$76787A7D82888C8D,$6562606064696F73,$8E8A847C756F6B68\\n Data.q $8D90939494929190,$606264686F788088,$73685D58585A5D5F,$9B96918C8987837D\\n Data.q $71767B838C959B9D,$5B5756585D63686D,$8C86817B756F6962,$888F939597979591\\n Data.q $5C606366696F7780,$7A756D6259535458,$9EA2A0988D837E7C,$79858D8F8F8E9097\\n Data.q $656B6E6D6865666E,$797A79746C656060,$7F7F7F7F7E7C7978,$8381828384848280\\n Data.q $7F82888E92918D88,$59606A757C7F7F7F,$655E5A5A59585656,$A59F97918A82796E\\n Data.q $7E848A939CA6ABAA,$48454548515E6B76,$8A7C6E6057514E4B,$A9ACABA8A4A09B94\\n Data.q $5A626A737F8C98A3,$60554D49484A4E54,$A9A19A928A81776B,$848C969FA7ADAFAD\\n Data.q $4B494C525C67717B,$8A7D7167605A544F,$A2A4A5A6A6A49F96,$626970777F89949C\\n Data.q $6B655E56504F545A,$A19F988F8379736E,$848C9296989A9C9F,$61626465676B717A\\n Data.q $807E79736D676261,$86898B8C8A888583,$797A7E8284848484,$77777A7C7E7E7C7A\\n Data.q $7979797B7D7E7C79,$7D7C7B7B7C7C7B7A,$7D7D7C7B7A7B7C7D,$797978777677797B\\n Data.q $787A7A7976757678,$415380817C777576,$2C31000002005255,$30202C36202C3020\\n eClick:\\nEndDataSection\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"#lang Python\\nimport time\\n\\ndef main(bpm = 72, bpb = 4):\\n sleep = 60.0 / bpm\\n counter = 0\\n while True:\\n counter += 1\\n if counter % bpb:\\n print 'tick'\\n else:\\n print 'TICK'\\n time.sleep(sleep)\\n\\n\\n\\nmain()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require racket/gui)\\n\\n(define msec 500)\\n(define sounds '(\\\"hi.wav\\\" \\\"lo.wav\\\"))\\n(define colors '(\\\"red\\\" \\\"green\\\"))\\n\\n(define f\\n (new frame% [label \\\"Metronome\\\"] [width 200] [height 200]))\\n(define c\\n (new (class canvas%\\n (define brushes\\n (map (λ(c) (new brush% [color c] [style 'solid])) colors))\\n (define cur 0)\\n (define/override (on-paint)\\n (send* (send this get-dc)\\n (clear)\\n (set-brush (list-ref brushes cur))\\n (draw-rectangle 0 0 200 200)))\\n (define/public (flip!)\\n (set! cur (modulo (add1 cur) (length sounds)))\\n (play-sound (list-ref sounds cur) #f)\\n (on-paint))\\n (super-new))\\n [parent f]))\\n\\n(define (flip)\\n (define init (current-inexact-milliseconds))\\n (define next (+ msec init))\\n (define ticks 1)\\n (let loop ()\\n (when (> (current-inexact-milliseconds) next)\\n (set! ticks (add1 ticks))\\n (set! next (+ init (* msec ticks)))\\n (queue-callback (λ() (send c flip!))))\\n (sleep 0.01)\\n (loop)))\\n\\n(send* f (center) (show #t))\\n(void (thread flip))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub MAIN ($beats-per-minute = 72, $beats-per-bar = 4) {\\n my $duration = 60 / $beats-per-minute;\\n my $base-time = now + $duration;\\n my $i;\\n\\n for $base-time, $base-time + $duration ... * -> $next-time {\\n if $i++ %% $beats-per-bar {\\n print \\\"\\\\nTICK\\\";\\n }\\n else {\\n print \\\" tick\\\";\\n }\\n sleep $next-time - now;\\n }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program simulates a visual (textual) metronome (with no sound). */\\nparse arg bpm bpb dur . /*obtain optional arguments from the CL*/\\nif bpm=='' | bpm==\\\",\\\" then bpm=72 /*the number of beats per minute. */\\nif bpb=='' | bpb==\\\",\\\" then bpb= 4 /* \\\" \\\" \\\" \\\" \\\" bar. */\\nif dur=='' | dur==\\\",\\\" then dur= 5 /*duration of the run in seconds. */\\ncall time 'Reset' /*reset the REXX elapsed timer. */\\nbt=1/bpb /*calculate a tock-time interval. */\\n\\n do until et>=dur; et=time('Elasped') /*process tick-tocks for the duration*/\\n say; call charout ,'TICK' /*show the first tick for the period. */\\n es=et+1 /*bump the elapsed time \\\"limiter\\\". */\\n $t=et+bt\\n do until e>=es; e=time('Elapsed')\\n if e<$t then iterate /*time for tock? */\\n call charout , ' tock' /*show a \\\"tock\\\". */\\n $t=$t+bt /*bump the TOCK time.*/\\n end /*until e≥es*/\\n end /*until et≥dur*/\\n /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program simulates a metronome (with sound). Regina REXX only. */\\nparse arg bpm bpb dur tockf tockd tickf tickd . /*obtain optional arguments from the CL*/\\nif bpm=='' | bpm==\\\",\\\" then bpm= 72 /*the number of beats per minute. */\\nif bpb=='' | bpb==\\\",\\\" then bpb= 4 /* \\\" \\\" \\\" \\\" \\\" bar. */\\nif dur=='' | dur==\\\",\\\" then dur= 5 /*duration of the run in secs*/\\nif tockf=='' | tockf==\\\",\\\" then tockf=400 /*frequency \\\" \\\" tock sound \\\" HZ. */\\nif tockd=='' | tockd==\\\",\\\" then tockd= 20 /*duration \\\" \\\" \\\" \\\" \\\" msec*/\\nif tickf=='' | tickf==\\\",\\\" then tickf=600 /*frequency \\\" \\\" tick \\\" \\\" HZ. */\\nif tickd=='' | tickd==\\\",\\\" then tickd= 10 /*duration \\\" \\\" \\\" \\\" \\\" msec*/\\ncall time 'Reset' /*reset the REXX elapsed timer. */\\nbt=1/bpb /*calculate a tock─time interval. */\\n\\n do until et>=dur; et=time('Elasped') /*process tick-tocks for the duration*/\\n call beep tockf, tockd /*sound a beep for the \\\"TOCK\\\". */\\n es=et+1 /*bump the elapsed time \\\"limiter\\\". */\\n $t=et+bt\\n do until e>=es; e=time('Elapsed')\\n if e<$t then iterate /*time for tock? */\\n call beep tickf, tickd /*sound a \\\"tick\\\". */\\n $t=$t+bt /*bump the TOCK time.*/\\n end /*until e≥es*/\\n end /*until et≥dur*/\\n /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program simulates a metronome (with sound). PC/REXX or Personal REXX only.*/\\nparse arg bpm bpb dur tockf tockd tickf tickd . /*obtain optional arguments from the CL*/\\nif bpm=='' | bpm==\\\",\\\" then bpm= 72 /*the number of beats per minute. */\\nif bpb=='' | bpb==\\\",\\\" then bpb= 4 /* \\\" \\\" \\\" \\\" \\\" bar. */\\nif dur=='' | dur==\\\",\\\" then dur= 5 /*duration of the run in secs*/\\nif tockf=='' | tockf==\\\",\\\" then tockf=400 /*frequency \\\" \\\" tock sound \\\" HZ. */\\nif tockd=='' | tockd==\\\",\\\" then tockd= .02 /*duration \\\" \\\" \\\" \\\" \\\" sec.*/\\nif tickf=='' | tickf==\\\",\\\" then tickf=600 /*frequency \\\" \\\" tick \\\" \\\" HZ. */\\nif tickd=='' | tickd==\\\",\\\" then tickd= .01 /*duration \\\" \\\" \\\" \\\" \\\" sec.*/\\ncall time 'Reset' /*reset the REXX elapsed timer. */\\nbt=1/bpb /*calculate a tock─time interval. */\\n\\n do until et>=dur; et=time('Elasped') /*process tick-tocks for the duration*/\\n call sound tockf, tockd /*sound a beep for the \\\"TOCK\\\". */\\n es=et+1 /*bump the elapsed time \\\"limiter\\\". */\\n $t=et+bt\\n do until e>=es; e=time('Elapsed')\\n if e<$t then iterate /*time for tock? */\\n call sound tickf, tickd /*sound a tick. */\\n $t=$t+bt /*bump the TOCK time.*/\\n end /*until e≥es*/\\n end /*until et≥dur*/\\n /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"#!/usr/bin/ruby\\n\\nbpm = Integer(ARGV[0]) rescue 60 # sets BPM by the first command line argument, set to 60 if none provided\\nmsr = Integer(ARGV[1]) rescue 4 # sets number of beats in a measure by the second command line argument, set to 4 if none provided\\ni = 0\\n\\nloop do\\n (msr-1).times do\\n puts \\\"\\\\a\\\"\\n sleep(60.0/bpm)\\n end\\n puts \\\"\\\\aAND #{i += 1}\\\"\\n sleep(60.0/bpm)\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"def metronome(bpm: Int, bpb: Int, maxBeats: Int = Int.MaxValue) {\\n val delay = 60000L / bpm\\n var beats = 0\\n do {\\n Thread.sleep(delay)\\n if (beats % bpb == 0) print(\\\"\\\\nTICK \\\")\\n else print(\\\"tick \\\")\\n beats+=1\\n }\\n while (beats < maxBeats)\\n println()\\n}\\n\\nmetronome(120, 4, 20) // limit to 20\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"func metronome (beats_per_minute = 72, beats_per_bar = 4) {\\n\\n var counter = 0\\n var duration = 60/beats_per_minute\\n var base_time = Time.micro+duration\\n\\n STDOUT.autoflush(true)\\n\\n for next_time in (base_time..Inf `by` duration) {\\n if (counter++ %% beats_per_bar) {\\n print \\\"\\\\nTICK\\\"\\n }\\n else {\\n print \\\" tick\\\"\\n }\\n Sys.sleep(next_time - Time.micro)\\n }\\n}\\n\\nsay metronome(ARGV.map{ Num(_) }...)\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"package require Tcl 8.5\\n\\nlassign $argv bpm bpb\\nif {$argc < 2} {set bpb 4}\\nif {$argc < 1} {set bpm 60}\\n\\nfconfigure stdout -buffering none\\nset intervalMS [expr {round(60000.0 / $bpm)}]\\nset ctr 0\\n\\nproc beat {} {\\n global intervalMS ctr bpb\\n after $intervalMS beat ;# Reschedule first, to encourage minimal drift\\n if {[incr ctr] == 1} {\\n\\tputs -nonewline \\\"\\\\r\\\\a[string repeat { } [expr {$bpb+4}]]\\\\rTICK\\\"\\n } else {\\n\\tputs -nonewline \\\"\\\\rtick[string repeat . [expr {$ctr-1}]]\\\"\\n }\\n if {$ctr >= $bpb} {\\n\\tset ctr 0\\n }\\n}\\n\\n# Run the metronome until the user uses Ctrl+C...\\nbeat\\nvwait forever\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"tclsh8.5 metronome.tcl 90 4\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"timer\\\" for Timer\\nimport \\\"io\\\" for Stdout\\n\\nvar metronome = Fn.new { |bpm, bpb, maxBeats|\\n var delay = (60000/bpm).floor\\n var beats = 0\\n while (true) {\\n Timer.sleep(delay)\\n System.write((beats % bpb == 0) ? \\\"\\\\n\\\\aTICK \\\" : \\\"\\\\atick \\\")\\n Stdout.flush()\\n beats = beats + 1\\n if (beats == maxBeats) break\\n }\\n System.print()\\n}\\n\\nmetronome.call(120, 4, 20) // limit to 20 beats\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"int BPM, Odd, Time0, Delay;\\n[Text(0, \\\"Beats per minute: \\\");\\nBPM:= IntIn(0);\\nOdd:= true;\\nDelay:= 60_000_000/BPM; \\\\microseconds per beat\\nrepeat Time0:= GetTime;\\n repeat until GetTime-Time0 >= Delay;\\n Text(0, if Odd then \\\"tick\\\" else \\\" TOCK^m^j\\\");\\n Odd:= not Odd;\\nuntil KeyHit;\\n]\\n\",\n \"language\": \"XPL0\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Metronome"}}},{"rowIdx":488,"cells":{"solutions":{"kind":"list like","value":[{"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 belongs to the class known as B₂ sequences.\n\n\nThe sequence starts with:\n\n::<span style=\"font-style:italic;font-weight:bold;font-size:125%;\">a<sub>1</sub> = 1</span>\n\nthen for <span style=\"font-style:italic;font-weight:bold;font-size:125%;padding:.3em;\">n > 1,</span> <span style=\"font-style:italic;font-weight:bold;font-size:125%;padding:.3em;\">a<sub>n</sub></span> is the smallest positive integer such that every pairwise sum\n\n::<span style=\"font-style:italic;font-weight:bold;font-size:125%;\">a<sub>i</sub> + a<sub>j</sub> \n\nis distinct, for all <span style=\"font-style:italic;font-weight:bold;font-size:125%;\">i</span> and <span style=\"font-style:italic;font-weight:bold;font-size:125%;\">j</span> less than or equal to <span style=\"font-style:italic;font-weight:bold;font-size:125%;\">n</span>.\n\n;The Task:\n\n:* Find and display, here, on this page the first 30 terms of the Mian–Chowla sequence.\n:* Find and display, here, on this page the 91st through 100th terms of the Mian–Chowla sequence.\n\n\nDemonstrating working through the first few terms longhand:\n\n::<span style=\"font-style:italic;font-weight:bold;font-size:125%;\">a<sub>1</sub> = 1</span>\n\n::<span style=\"font-weight:bold;\">1 + 1 = 2</span>\n\nSpeculatively try <span style=\"font-style:italic;font-weight:bold;font-size:125%;padding:.3em;\">a<sub>2</sub> = 2</span>\n\n::<span style=\"font-weight:bold;\">1 + 1 = 2</span>\n::<span style=\"font-weight:bold;\">1 + 2 = 3</span>\n::<span style=\"font-weight:bold;\">2 + 2 = 4</span>\n\nThere are no repeated sums so '''2''' is the next number in the sequence.\n\nSpeculatively try <span style=\"font-style:italic;font-weight:bold;font-size:125%;padding:.3em;\">a<sub>3</sub> = 3</span>\n\n::<span style=\"font-weight:bold;\">1 + 1 = 2</span>\n::<span style=\"font-weight:bold;\">1 + 2 = 3</span> \n::<span style=\"font-weight:bold;\">1 + 3 = <span style=\"background-color:yellow;\">4</span></span>\n::<span style=\"font-weight:bold;\">2 + 2 = <span style=\"background-color:yellow;\">4</span></span>\n::<span style=\"font-weight:bold;\">2 + 3 = 5</span>\n::<span style=\"font-weight:bold;\">3 + 3 = 6</span>\n\nSum of '''4''' is repeated so '''3''' is rejected.\n\nSpeculatively try <span style=\"font-style:italic;font-weight:bold;font-size:125%;padding:.3em;\">a<sub>3</sub> = 4</span>\n\n::<span style=\"font-weight:bold;\">1 + 1 = 2</span>\n::<span style=\"font-weight:bold;\">1 + 2 = 3</span>\n::<span style=\"font-weight:bold;\">1 + 4 = 5</span>\n::<span style=\"font-weight:bold;\">2 + 2 = 4</span>\n::<span style=\"font-weight:bold;\">2 + 4 = 6</span>\n::<span style=\"font-weight:bold;\">4 + 4 = 8</span>\n\nThere are no repeated sums so '''4''' is the next number in the sequence.\n\nAnd so on...\n\n;See also:\n\n:* [[oeis:A005282|OEIS:A005282 Mian-Chowla sequence]]\n\n","language":"00-TASK"},{"code":"F contains(sums, s, ss)\n L(i) 0 .< ss\n I sums[i] == s\n R 1B\n R 0B\n\nF mian_chowla()\n V n = 100\n V mc = [0] * n\n mc[0] = 1\n V sums = [0] * ((n * (n + 1)) >> 1)\n sums[0] = 2\n V ss = 1\n L(i) 1 .< n\n V le = ss\n V j = mc[i - 1] + 1\n L\n mc[i] = j\n V nxtJ = 0B\n L(k) 0 .. i\n V sum = mc[k] + j\n I contains(sums, sum, ss)\n ss = le\n nxtJ = 1B\n L.break\n sums[ss] = sum\n ss++\n I !nxtJ\n L.break\n j++\n R mc\n\nprint(‘The first 30 terms of the Mian-Chowla sequence are:’)\nV mc = mian_chowla()\nprint_elements(mc[0.<30])\nprint()\nprint(‘Terms 91 to 100 of the Mian-Chowla sequence are:’)\nprint_elements(mc[90..])\n","language":"11l"},{"code":"with Ada.Text_IO;\nwith Ada.Containers.Hashed_Sets;\n\nprocedure Mian_Chowla_Sequence\nis\n type Natural_Array is array(Positive range <>) of Natural;\n\n function Hash(P : in Positive) return Ada.Containers.Hash_Type is\n begin\n return Ada.Containers.Hash_Type(P);\n end Hash;\n\n package Positive_Sets is new Ada.Containers.Hashed_Sets(Positive, Hash, \"=\");\n\n function Mian_Chowla(N : in Positive) return Natural_Array\n is\n return_array : Natural_Array(1 .. N) := (others => 0);\n nth : Positive := 1;\n candidate : Positive := 1;\n seen : Positive_Sets.Set;\n begin\n while nth <= N loop\n declare\n sums : Positive_Sets.Set;\n terms : constant Natural_Array := return_array(1 .. nth-1) & candidate;\n found : Boolean := False;\n begin\n for term of terms loop\n if seen.Contains(term + candidate) then\n found := True;\n exit;\n else\n sums.Insert(term + candidate);\n end if;\n end loop;\n\n if not found then\n return_array(nth) := candidate;\n seen.Union(sums);\n nth := nth + 1;\n end if;\n candidate := candidate + 1;\n end;\n end loop;\n return return_array;\n end Mian_Chowla;\n\n length : constant Positive := 100;\n sequence : constant Natural_Array(1 .. length) := Mian_Chowla(length);\nbegin\n Ada.Text_IO.Put_Line(\"Mian Chowla sequence first 30 terms :\");\n for term of sequence(1 .. 30) loop\n Ada.Text_IO.Put(term'Img);\n end loop;\n Ada.Text_IO.New_Line;\n Ada.Text_IO.Put_Line(\"Mian Chowla sequence terms 91 to 100 :\");\n for term of sequence(91 .. 100) loop\n Ada.Text_IO.Put(term'Img);\n end loop;\nend Mian_Chowla_Sequence;\n","language":"Ada"},{"code":"# Find Mian-Chowla numbers: an\n where: ai = 1,\n and: an = smallest integer such that ai + aj is unique\n for all i, j in 1 .. n && i <= j\n#\nBEGIN\n INT max mc = 100;\n [ max mc ]INT mc;\n INT curr size := 0; # initial size of the array #\n INT size increment = 10 000; # size to increase the array by #\n REF[]BOOL is sum := HEAP[ 1 : 0 ]BOOL;\n INT mc count := 1;\n FOR i WHILE mc count <= max mc DO\n # assume i will be part of the sequence #\n mc[ mc count ] := i;\n # check the sums #\n IF ( 2 * i ) > curr size THEN\n # the is sum array is too small - make a larger one #\n REF[]BOOL new sum = HEAP[ curr size + size increment ]BOOL;\n new sum[ 1 : curr size ] := is sum;\n FOR n TO size increment DO new sum[ curr size + n ] := FALSE OD;\n curr size +:= size increment;\n is sum := new sum\n FI;\n BOOL is unique := TRUE;\n FOR mc pos TO mc count WHILE is unique := NOT is sum[ i + mc[ mc pos ] ] DO SKIP OD;\n IF is unique THEN\n # i is a sequence element - store the sums #\n FOR k TO mc count DO is sum[ i + mc[ k ] ] := TRUE OD;\n mc count +:= 1\n FI\n OD;\n\n # print parts of the sequence #\n print( ( \"Mian Chowla sequence elements 1..30:\", newline ) );\n FOR i TO 30 DO print( ( \" \", whole( mc[ i ], 0 ) ) ) OD;\n print( ( newline ) );\n print( ( \"Mian Chowla sequence elements 91..100:\", newline ) );\n FOR i FROM 91 TO 100 DO print( ( \" \", whole( mc[ i ], 0 ) ) ) OD\n\nEND\n","language":"ALGOL-68"},{"code":"mianChowla: function [n][\n result: new [1]\n sums: new [2]\n candidate: 1\n\n while [n > size result][\n fit: false\n 'result ++ 0\n while [not? fit][\n candidate: candidate + 1\n fit: true\n result\\[dec size result]: candidate\n loop result 'val [\n if contains? sums val + candidate [\n fit: false\n break\n ]\n ]\n ]\n\n loop result 'val [\n 'sums ++ val + candidate\n unique 'sums\n ]\n ]\n return result\n]\n\nseq100: mianChowla 100\n\nprint \"The first 30 terms of the Mian-Chowla sequence are:\"\nprint slice seq100 0 29\nprint \"\"\n\nprint \"Terms 91 to 100 of the sequence are:\"\nprint slice seq100 90 99\n","language":"Arturo"},{"code":"# Find Mian-Chowla numbers: an\n# where: ai = 1,\n# and: an = smallest integer such that ai + aj is unique\n# for all i, j in 1 .. n && i <= j\n#\nBEGIN \\\n{\n\n FALSE = 0;\n TRUE = 1;\n\n mcCount = 1;\n\n for( i = 1; mcCount <= 100; i ++ )\n {\n # assume i will be part of the sequence\n mc[ mcCount ] = i;\n # check the sums\n isUnique = TRUE;\n for( mcPos = 1; mcPos <= mcCount && isUnique; mcPos ++ )\n {\n isUnique = ! ( ( i + mc[ mcPos ] ) in isSum );\n } # for j\n if( isUnique )\n {\n # i is a sequence element - store the sums\n for( k = 1; k <= mcCount; k ++ )\n {\n isSum[ i + mc[ k ] ] = TRUE;\n } # for k\n mcCount ++;\n } # if isUnique\n } # for i\n # print the sequence\n printf( \"Mian Chowla sequence elements 1..30:\\n\" );\n for( i = 1; i <= 30; i ++ )\n {\n printf( \" %d\", mc[ i ] );\n } # for i\n printf( \"\\n\" );\n printf( \"Mian Chowla sequence elements 91..100:\\n\" );\n for( i = 91; i <= 100; i ++ )\n {\n printf( \" %d\", mc[ i ] );\n } # for i\n printf( \"\\n\" );\n\n} # BEGIN\n","language":"AWK"},{"code":"# helper functions\n#\n# determine if a list is empty or not\nfunction isEmpty(a) { for (ii in a) return 0; return 1 }\n# list concatination\nfunction concat(a, b) { for (cc in b) a[cc] = cc }\n\nBEGIN \\\n{\n mc[0] = 1; sums[2] = 0; # initialize lists\n for ( i = 1; i < 100; i ++ ) # iterate for each item in result\n {\n for ( j = mc[i-1]+1; ; j ++ ) # iterate thru trial values\n {\n mc[i] = j; # set trial value into result\n for ( k = 0; k <= i; k ++ ) # test new iteration of sums\n {\n # test trial sum against old sums list\n if ((sum = mc[k] + j) in sums)\n { # collision, so\n delete ts; # toss out any accumulated items,\n break; # and break out to the next j\n }\n ts[sum] = sum; # (else) accumulate to new sum list\n } # for k\n if ( isEmpty( ts ) ) # nothing to add,\n continue; # so try next j\n concat( sums, ts ); # combine new sums to old,\n delete ts; # clear out the new,\n break; # break out to next i\n } # for j\n } # for i\n # print the sequence\n ps = \"Mian Chowla sequence elements %d..%d:\\n\";\n for ( i = 0; i < 100; i ++ )\n {\n if ( i == 0 ) printf ps, 1, 30;\n if ( i == 90 ) printf \"\\n\\n\" ps, 91, 100;\n if ( i < 30 || i >= 90 ) printf \"%d \", mc[ i ];\n } # for i\n print \"\\n\"\n} # BEGIN\n","language":"AWK"},{"code":"#include <stdio.h>\n#include <stdbool.h>\n#include <time.h>\n\n#define n 100\n#define nn ((n * (n + 1)) >> 1)\n\nbool Contains(int lst[], int item, int size) {\n\tfor (int i = size - 1; i >= 0; i--)\n \t\tif (item == lst[i]) return true;\n\treturn false;\n}\n\nint * MianChowla()\n{\n\tstatic int mc[n]; mc[0] = 1;\n\tint sums[nn];\tsums[0] = 2;\n\tint sum, le, ss = 1;\n\tfor (int i = 1; i < n; i++) {\n\t\tle = ss;\n\t\tfor (int j = mc[i - 1] + 1; ; j++) {\n\t\t\tmc[i] = j;\n\t\t\tfor (int k = 0; k <= i; k++) {\n\t\t\t\tsum = mc[k] + j;\n\t\t\t\tif (Contains(sums, sum, ss)) {\n\t\t\t\t\tss = le; goto nxtJ;\n\t\t\t\t}\n\t\t\t\tsums[ss++] = sum;\n\t\t\t}\n\t\t\tbreak;\n\t\tnxtJ:;\n\t\t}\n\t}\n\treturn mc;\n}\n\nint main() {\n\tclock_t st = clock(); int * mc; mc = MianChowla();\n double et = ((double)(clock() - st)) / CLOCKS_PER_SEC;\n\tprintf(\"The first 30 terms of the Mian-Chowla sequence are:\\n\");\n\tfor (int i = 0; i < 30; i++) printf(\"%d \", mc[i]);\n\tprintf(\"\\n\\nTerms 91 to 100 of the Mian-Chowla sequence are:\\n\");\n\tfor (int i = 90; i < 100; i++) printf(\"%d \", mc[i]);\n\tprintf(\"\\n\\nComputation time was %f seconds.\", et);\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <stdbool.h>\n#include <time.h>\n\n// helper function for indicating memory used.\nvoid approx(char* buf, double count)\n{\n const char* suffixes[] = { \"Bytes\", \"KiB\", \"MiB\" };\n uint s = 0;\n while (count >= 1024 && s < 3) { s++; count /= 1024; }\n if (count - (double)((int)count) == 0.0)\n sprintf(buf, \"%d %s\", (int)count, suffixes[s]);\n else\n sprintf(buf, \"%.1f %s\", count, suffixes[s]);\n}\n\nint main() {\n int i, j, k, c = 0, n = 100, nn = 110;\n int* mc = (int*) malloc((n) * sizeof(int));\n bool* isSum = (bool*) calloc(nn, sizeof(bool));\n char em[] = \"unable to increase isSum array to %ld.\";\n if (n > 100) printf(\"Computing terms 1 to %d...\\n\", n);\n clock_t st = clock();\n for (i = 1; c < n; i++) {\n mc[c] = i;\n if (i + i > nn) {\n bool* newIs = (bool*)realloc(isSum, (nn <<= 1) * sizeof(bool));\n if (newIs == NULL) { printf(em, nn); return -1; }\n isSum = newIs;\n for (j = (nn >> 1); j < nn; j++) isSum[j] = false;\n }\n bool isUnique = true;\n for (j = 0; (j < c) && isUnique; j++) isUnique = !isSum[i + mc[j]];\n if (isUnique) {\n for (k = 1; k <= c; k++) isSum[i + mc[k]] = true;\n c++;\n }\n }\n double et = 1e3 * ((double)(clock() - st)) / CLOCKS_PER_SEC;\n free(isSum);\n printf(\"The first 30 terms of the Mian-Chowla sequence are:\\n\");\n for (i = 0; i < 30; i++) printf(\"%d \", mc[i]);\n printf(\"\\n\\nTerms 91 to 100 of the Mian-Chowla sequence are:\\n\");\n for (i = 90; i < 100; i++) printf(\"%d \", mc[i]);\n if (c > 100) printf(\"\\nTerm %d is: %d\" ,c , mc[c - 1]);\n free(mc);\n char buf[100]; approx(buf, nn * sizeof(bool));\n printf(\"\\n\\nComputation time was %6.3f ms. Allocation was %s.\", et, buf);\n}\n","language":"C"},{"code":"using namespace std;\n\n#include <iostream>\n#include <ctime>\n\n#define n 100\n#define nn ((n * (n + 1)) >> 1)\n\nbool Contains(int lst[], int item, int size) {\n\tfor (int i = 0; i < size; i++) if (item == lst[i]) return true;\n\treturn false;\n}\n\nint * MianChowla()\n{\n\tstatic int mc[n]; mc[0] = 1;\n\tint sums[nn];\tsums[0] = 2;\n\tint sum, le, ss = 1;\n\tfor (int i = 1; i < n; i++) {\n\t\tle = ss;\n\t\tfor (int j = mc[i - 1] + 1; ; j++) {\n\t\t\tmc[i] = j;\n\t\t\tfor (int k = 0; k <= i; k++) {\n\t\t\t\tsum = mc[k] + j;\n\t\t\t\tif (Contains(sums, sum, ss)) {\n\t\t\t\t\tss = le; goto nxtJ;\n\t\t\t\t}\n\t\t\t\tsums[ss++] = sum;\n\t\t\t}\n\t\t\tbreak;\n\t\tnxtJ:;\n\t\t}\n\t}\n\treturn mc;\n}\n\nint main() {\n\tclock_t st = clock(); int * mc; mc = MianChowla();\n\tdouble et = ((double)(clock() - st)) / CLOCKS_PER_SEC;\n\tcout << \"The first 30 terms of the Mian-Chowla sequence are:\\n\";\n\tfor (int i = 0; i < 30; i++) { cout << mc[i] << ' '; }\n\tcout << \"\\n\\nTerms 91 to 100 of the Mian-Chowla sequence are:\\n\";\n\tfor (int i = 90; i < 100; i++) { cout << mc[i] << ' '; }\n\tcout << \"\\n\\nComputation time was \" << et << \" seconds.\";\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Diagnostics;\nusing System.Linq;\n\nstatic class Program {\n static int[] MianChowla(int n) {\n int[] mc = new int[n - 1 + 1];\n HashSet<int> sums = new HashSet<int>(), ts = new HashSet<int>();\n int sum; mc[0] = 1; sums.Add(2);\n for (int i = 1; i <= n - 1; i++) {\n for (int j = mc[i - 1] + 1; ; j++) {\n mc[i] = j;\n for (int k = 0; k <= i; k++) {\n sum = mc[k] + j;\n if (sums.Contains(sum)) { ts.Clear(); break; }\n ts.Add(sum);\n }\n if (ts.Count > 0) { sums.UnionWith(ts); break; }\n }\n }\n return mc;\n }\n\n static void Main(string[] args)\n {\n const int n = 100; Stopwatch sw = new Stopwatch();\n string str = \" of the Mian-Chowla sequence are:\\n\";\n sw.Start(); int[] mc = MianChowla(n); sw.Stop();\n Console.Write(\"The first 30 terms{1}{2}{0}{0}Terms 91 to 100{1}{3}{0}{0}\" +\n \"Computation time was {4}ms.{0}\", '\\n', str, string.Join(\" \", mc.Take(30)),\n string.Join(\" \", mc.Skip(n - 10)), sw.ElapsedMilliseconds);\n }\n}\n","language":"C-sharp"},{"code":"// Generate Mian-Chowla sequence. Nigel Galloway: March 23rd., 2019\nlet mC=let rec fN i g l=seq{\n let a=(l*2)::[for i in i do yield i+l]@g\n let b=[l+1..l*2]|>Seq.find(fun e->Seq.forall(fun g->(Seq.contains (g-e)>>not) i) a)\n yield b; yield! fN (l::i) (a|>List.filter(fun n->n>b)) b}\n seq{yield 1; yield! fN [] [] 1}\n","language":"F-Sharp"},{"code":"mC |> Seq.take 30 |> Seq.iter(printf \"%d \");printfn \"\"\n","language":"F-Sharp"},{"code":"mC |> Seq.skip 90 |> Seq.take 10 |> Seq.iter(printf \"%d \");printfn \"\"\n","language":"F-Sharp"},{"code":"USING: fry hash-sets io kernel math prettyprint sequences sets ;\n\n: next ( seq sums speculative -- seq' sums' speculative' )\n dup reach [ + ] with map over dup + suffix! >hash-set pick\n over intersect null?\n [ swapd union [ [ suffix! ] keep ] dip swap ] [ drop ] if\n 1 + ;\n\n: mian-chowla ( n -- seq )\n [ V{ 1 } HS{ 2 } [ clone ] bi@ 2 ] dip\n '[ pick length _ < ] [ next ] while 2drop ;\n\n100 mian-chowla\n[ 30 head \"First 30 terms of the Mian-Chowla sequence:\" ]\n[ 10 tail* \"Terms 91-100 of the Mian-Chowla sequence:\" ] bi\n[ print [ pprint bl ] each nl nl ] 2bi@\n","language":"Factor"},{"code":"redim as uinteger mian(0 to 1)\nredim as uinteger sums(0 to 2)\nmian(0) = 1 : mian(1) = 2\nsums(0) = 2 : sums(1) = 3 : sums(2) = 4\ndim as uinteger n_mc = 2, n_sm = 3, curr = 3, tempsum\nwhile n_mc < 101\n for i as uinteger = 0 to n_mc - 1\n tempsum = curr + mian(i)\n for j as uinteger = 0 to n_sm - 1\n if tempsum = sums(j) then goto loopend\n next j\n next i\n redim preserve as uinteger mian(0 to n_mc)\n mian(n_mc) = curr\n redim preserve as uinteger sums(0 to n_sm + n_mc)\n for j as uinteger = 0 to n_mc - 1\n sums(n_sm + j) = mian(j) + mian(n_mc)\n next j\n n_mc += 1\n n_sm += n_mc\n sums(n_sm-1) = 2*curr\n loopend:\n curr += 1\nwend\n\nprint \"Mian-Chowla numbers 1 through 30: \",\nfor i as uinteger = 0 to 29\n print mian(i),\nnext i\nprint\nprint \"Mian-Chowla numbers 91 through 100: \",\nfor i as uinteger = 90 to 99\n print mian(i),\nnext i\nprint\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\nfunc contains(is []int, s int) bool {\n for _, i := range is {\n if s == i {\n return true\n }\n }\n return false\n}\n\nfunc mianChowla(n int) []int {\n mc := make([]int, n)\n mc[0] = 1\n is := []int{2}\n var sum int\n for i := 1; i < n; i++ {\n le := len(is)\n jloop:\n for j := mc[i-1] + 1; ; j++ {\n mc[i] = j\n for k := 0; k <= i; k++ {\n sum = mc[k] + j\n if contains(is, sum) {\n is = is[0:le]\n continue jloop\n }\n is = append(is, sum)\n }\n break\n }\n }\n return mc\n}\n\nfunc main() {\n mc := mianChowla(100)\n fmt.Println(\"The first 30 terms of the Mian-Chowla sequence are:\")\n fmt.Println(mc[0:30])\n fmt.Println(\"\\nTerms 91 to 100 of the Mian-Chowla sequence are:\")\n fmt.Println(mc[90:100])\n}\n","language":"Go"},{"code":"package main\n\nimport \"fmt\"\n\ntype set map[int]bool\n\nfunc mianChowla(n int) []int {\n mc := make([]int, n)\n mc[0] = 1\n is := make(set, n*(n+1)/2)\n is[2] = true\n var sum int\n isx := make([]int, 0, n)\n for i := 1; i < n; i++ {\n isx = isx[:0]\n jloop:\n for j := mc[i-1] + 1; ; j++ {\n mc[i] = j\n for k := 0; k <= i; k++ {\n sum = mc[k] + j\n if is[sum] {\n isx = isx[:0]\n continue jloop\n }\n isx = append(isx, sum)\n }\n for _, x := range isx {\n is[x] = true\n }\n break\n }\n }\n return mc\n}\n\nfunc main() {\n mc := mianChowla(100)\n fmt.Println(\"The first 30 terms of the Mian-Chowla sequence are:\")\n fmt.Println(mc[0:30])\n fmt.Println(\"\\nTerms 91 to 100 of the Mian-Chowla sequence are:\")\n fmt.Println(mc[90:100])\n}\n","language":"Go"},{"code":"import Data.Set (Set, fromList, insert, member)\n\n------------------- MIAN-CHOWLA SEQUENCE -----------------\nmianChowlas :: Int -> [Int]\nmianChowlas =\n reverse . snd . (iterate nextMC (fromList [2], [1]) !!) . subtract 1\n\nnextMC :: (Set Int, [Int]) -> (Set Int, [Int])\nnextMC (sumSet, mcs@(n:_)) =\n (foldr insert sumSet ((2 * m) : fmap (m +) mcs), m : mcs)\n where\n valid x = not $ any (flip member sumSet . (x +)) mcs\n m = until valid succ n\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain =\n (putStrLn . unlines)\n [ \"First 30 terms of the Mian-Chowla series:\"\n , show (mianChowlas 30)\n , []\n , \"Terms 91 to 100 of the Mian-Chowla series:\"\n , show $ drop 90 (mianChowlas 100)\n ]\n","language":"Haskell"},{"code":"NB. http://rosettacode.org/wiki/Mian-Chowla_sequence\n\nNB. Dreadfully inefficient implementation recomputes all the sums to n-1\nNB. and computes the full addition table rather than just a triangular region\nNB. However, this implementation is sufficiently quick to meet the requirements.\n\nNB. The vector head is the next speculative value\nNB. Beheaded, the vector is Mian-Chowla sequence.\n\n\nUntil =: conjunction def 'u^:(0 = v)^:_'\nunique =: -:&# ~. NB. tally of list matches that of set\n\nnext_mc =: [: (, {.) (>:@:{. , }.)Until(unique@:((<:/~@i.@# #&, +/~)@:(}. , {.)))\n\n\nprime_q =: 1&p: NB. for fun look at prime generation suitability\n","language":"J"},{"code":"import java.util.Arrays;\n\npublic class MianChowlaSequence {\n\n public static void main(String[] args) {\n long start = System.currentTimeMillis();\n System.out.println(\"First 30 terms of the Mian–Chowla sequence.\");\n mianChowla(1, 30);\n System.out.println(\"Terms 91 through 100 of the Mian–Chowla sequence.\");\n mianChowla(91, 100);\n long end = System.currentTimeMillis();\n System.out.printf(\"Elapsed = %d ms%n\", (end-start));\n }\n\n private static void mianChowla(int minIndex, int maxIndex) {\n int [] sums = new int[1];\n int [] chowla = new int[maxIndex+1];\n sums[0] = 2;\n chowla[0] = 0;\n chowla[1] = 1;\n if ( minIndex == 1 ) {\n System.out.printf(\"%d \", 1);\n }\n int chowlaLength = 1;\n for ( int n = 2 ; n <= maxIndex ; n++ ) {\n\n // Sequence is strictly increasing.\n int test = chowla[n - 1];\n // Bookkeeping. Generate only new sums.\n int[] sumsNew = Arrays.copyOf(sums, sums.length + n);\n int sumNewLength = sums.length;\n int savedsSumNewLength = sumNewLength;\n\n // Generate test candidates for the next value of the sequence.\n boolean found = false;\n while ( ! found ) {\n test++;\n found = true;\n sumNewLength = savedsSumNewLength;\n // Generate test sums\n for ( int j = 0 ; j <= chowlaLength ; j++ ) {\n int testSum = (j == 0 ? test : chowla[j]) + test;\n boolean duplicate = false;\n\n // Check if test Sum in array\n for ( int k = 0 ; k < sumNewLength ; k++ ) {\n if ( sumsNew[k] == testSum ) {\n duplicate = true;\n break;\n }\n }\n if ( ! duplicate ) {\n // Add to array\n sumsNew[sumNewLength] = testSum;\n sumNewLength++;\n }\n else {\n // Duplicate found. Therefore, test candidate of the next value of the sequence is not OK.\n found = false;\n break;\n }\n }\n }\n\n // Bingo! Now update bookkeeping.\n chowla[n] = test;\n chowlaLength++;\n sums = sumsNew;\n if ( n >= minIndex ) {\n System.out.printf(\"%d %s\", chowla[n], (n==maxIndex ? \"\\n\" : \"\"));\n }\n }\n }\n\n}\n","language":"Java"},{"code":"(() => {\n 'use strict';\n\n // main :: IO ()\n const main = () => {\n const genMianChowla = mianChowlas();\n console.log([\n 'Mian-Chowla terms 1-30:',\n take(30)(\n genMianChowla\n ),\n\n '\\nMian-Chowla terms 91-100:',\n (\n drop(60)(genMianChowla),\n take(10)(\n genMianChowla\n )\n )\n ].join('\\n') + '\\n');\n };\n\n // mianChowlas :: Gen [Int]\n function* mianChowlas() {\n let\n mcs = [1],\n sumSet = new Set([2]),\n x = 1;\n while (true) {\n yield x;\n [sumSet, mcs, x] = nextMC(sumSet, mcs, x);\n }\n }\n\n // nextMC :: Set Int -> [Int] -> Int -> (Set Int, [Int], Int)\n const nextMC = (setSums, mcs, n) => {\n // Set of sums -> Series up to n -> Next term in series\n const valid = x => {\n for (const m of mcs) {\n if (setSums.has(x + m)) return false;\n }\n return true;\n };\n const x = until(valid)(x => 1 + x)(n);\n return [\n sumList(mcs)(x)\n .reduce(\n (a, n) => (a.add(n), a),\n setSums\n ),\n mcs.concat(x),\n x\n ];\n };\n\n // sumList :: [Int] -> Int -> [Int]\n const sumList = xs =>\n // Series so far -> additional term -> new sums\n n => [2 * n].concat(xs.map(x => n + x));\n\n\n // ---------------- GENERIC FUNCTIONS ----------------\n\n // drop :: Int -> [a] -> [a]\n // drop :: Int -> Generator [a] -> Generator [a]\n // drop :: Int -> String -> String\n const drop = n =>\n xs => Infinity > length(xs) ? (\n xs.slice(n)\n ) : (take(n)(xs), xs);\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.apply([], Array.from({\n length: n\n }, () => {\n const x = xs.next();\n return x.done ? [] : [x.value];\n }));\n\n\n // until :: (a -> Bool) -> (a -> a) -> a -> a\n const until = p =>\n f => x => {\n let v = x;\n while (!p(v)) v = f(v);\n return v;\n };\n\n // MAIN ---\n return main();\n})();\n","language":"JavaScript"},{"code":"# Input: a bag-of-words (bow)\n# Output: either an augmented bow, or nothing if a duplicate is found\ndef augment_while_unique(stream):\n label $out\n | foreach ((stream|tostring), null) as $word (.;\n if $word == null then .\n elif has($word) then break $out\n else .[$word] = 1\n end;\n select($word == null) );\n\n# For speedup, store \"sums\" as a hash\ndef mian_chowlas:\n {m:[1], sums: {\"1\":1}}\n | recurse(\n .m as $m\n | .sums as $sums\n | first(range(1+$m[-1]; infinite) as $i\n\t | $sums\n\t | augment_while_unique( ($m[] | (.+$i)), (2*$i))\n\t | [$i, .] ) as [$i, $sums]\n | {m: ($m + [$i]), $sums} )\n | .m[-1] ;\n","language":"Jq"},{"code":"[limit(100; mian_chowlas)]\n| \"First thirty: \\(.[:30]);\",\n \"91st through 100th: \\(.[90:]).\"\n","language":"Jq"},{"code":"function mianchowla(n)\n seq = ones(Int, n)\n sums = Dict{Int,Int}()\n tempsums = Dict{Int,Int}()\n for i in 2:n\n seq[i] = seq[i - 1] + 1\n incrementing = true\n while incrementing\n for j in 1:i\n tsum = seq[j] + seq[i]\n if haskey(sums, tsum)\n seq[i] += 1\n empty!(tempsums)\n break\n else\n tempsums[tsum] = 0\n if j == i\n merge!(sums, tempsums)\n empty!(tempsums)\n incrementing = false\n end\n end\n end\n end\n end\n seq\nend\n\nfunction testmianchowla()\n println(\"The first 30 terms of the Mian-Chowla sequence are $(mianchowla(30)).\")\n println(\"The 91st through 100th terms of the Mian-Chowla sequence are $(mianchowla(100)[91:100]).\")\nend\n\ntestmianchowla()\n@time testmianchowla()\n","language":"Julia"},{"code":"// Version 1.3.21\n\nfun mianChowla(n: Int): List<Int> {\n val mc = MutableList(n) { 0 }\n mc[0] = 1\n val hs = HashSet<Int>(n * (n + 1) / 2)\n hs.add(2)\n val hsx = mutableListOf<Int>()\n for (i in 1 until n) {\n hsx.clear()\n var j = mc[i - 1]\n outer@ while (true) {\n j++\n mc[i] = j\n for (k in 0..i) {\n val sum = mc[k] + j\n if (hs.contains(sum)) {\n hsx.clear()\n continue@outer\n }\n hsx.add(sum)\n }\n hs.addAll(hsx)\n break\n }\n }\n return mc\n}\n\nfun main() {\n val mc = mianChowla(100)\n println(\"The first 30 terms of the Mian-Chowla sequence are:\")\n println(mc.subList(0, 30))\n println(\"\\nTerms 91 to 100 of the Mian-Chowla sequence are:\")\n println(mc.subList(90, 100))\n}\n","language":"Kotlin"},{"code":"fun sumsRemainDistinct(candidate: Int, seq: Iterable<Int>, sums: MutableSet<Int>): Boolean {\n val candidateSums = mutableListOf<Int>()\n\n for (s in seq) {\n when ((candidate + s) !in sums) {\n true -> candidateSums.add(candidate + s)\n false -> return false\n }\n }\n with(sums) {\n addAll(candidateSums)\n add(candidate + candidate)\n }\n return true\n}\n\nfun mianChowla(n: Int): List<Int> {\n val bufferSeq = linkedSetOf<Int>()\n val bufferSums = linkedSetOf<Int>()\n\n val sequence = generateSequence(1) { it + 1 } // [1,2,3,..]\n .filter { sumsRemainDistinct(it, bufferSeq, bufferSums) }\n .onEach { bufferSeq.add(it) }\n\n return sequence.take(n).toList()\n}\n\nfun main() {\n mianChowla(100).also {\n println(\"Mian-Chowla[1..30] = ${it.take(30)}\")\n println(\"Mian-Chowla[91..100] = ${it.drop(90)}\")\n }\n}\n","language":"Kotlin"},{"code":"n = {m} = {1};\ntmp = {2};\nDo[\n m++;\n While[ContainsAny[tmp, m + n],\n m++\n ];\n tmp = Join[tmp, n + m];\n AppendTo[tmp, 2 m];\n AppendTo[n, m]\n ,\n {99}\n ]\nRow[Take[n, 30], \",\"]\nRow[Take[n, {91, 100}], \",\"]\n","language":"Mathematica"},{"code":"import intsets, strutils, times\n\nproc mianchowla(n: Positive): seq[int] =\n result = @[1]\n var sums = [2].toIntSet()\n var candidate = 1\n\n while result.len < n:\n # Test successive candidates.\n var fit = false\n result.add 0 # Make room for next value.\n while not fit:\n inc candidate\n fit = true\n result[^1] = candidate\n # Check the sums.\n for val in result:\n if val + candidate in sums:\n # Failed to satisfy criterium.\n fit = false\n break\n # Add the new sums to the set of sums.\n for val in result:\n sums.incl val + candidate\n\nlet t0 = now()\nlet seq100 = mianchowla(100)\necho \"The first 30 terms of the Mian-Chowla sequence are:\"\necho seq100[0..29].join(\" \")\necho \"\"\necho \"Terms 91 to 100 of the sequence are:\"\necho seq100[90..99].join(\" \")\n\necho \"\"\necho \"Computation time: \", (now() - t0).inMilliseconds, \" ms\"\n","language":"Nim"},{"code":"program MianChowla;\n//compiling with /usr/lib/fpc/3.2.0/ppcx64.2 -MDelphi -O4 -al \"%f\"\n{$CODEALIGN proc=8,loop=4 }\nuses\n sysutils;\nconst\n deltaK = 100;\n maxCnt = 1000;\ntype\n tElem = Uint32;\n tpElem = pUint32;\n t_n = array[0..maxCnt+1] of tElem;\n t_n_sum_all = array[0..(maxCnt+1)*(maxCnt+2) DIV 2] of tElem;\n\nvar\n n_LastPos,\n n : t_n;\n\n n_sum_all : t_n_sum_all;\n\n maxIdx,\n maxN,\n max_SumIdx : NativeUInt;\n\nprocedure Init;\nvar\n i : NativeInt;\nbegin\n maxIdx := 1;\n maxN := 1;\n n[maxIdx] := maxN;\n max_SumIdx := 1;\n n_sum_all[max_SumIdx] := 2*maxN;\n\n For i := 0 to maxCnt do\n n_LastPos[i] := 1;\nend;\n\nprocedure InsertNew_sum(NewValue:NativeUint);\n//insertion already knowning the positions\nvar\n pElem :tpElem;\n InsIdx,chkIdx,oldIdx,newIdx : nativeInt;\nBegin\n newIdx := maxIdx;\n oldIdx := max_SumIdx;\n //append new value\n inc(maxIdx);\n n[maxIdx] := NewValue;\n //extend sum_\n inc(max_SumIdx,maxIdx);\n //heighest value already known\n InsIdx := max_SumIdx;\n n_sum_all[InsIdx] := 2*NewValue;\n //stop mark\n n_sum_all[InsIdx+1] := High(tElem);\n pElem := @n_sum_all[0];\n dec(InsIdx);\n //n_LastPos[newIdx]+newIdx-1 == InsIdx\n repeat\n //move old bigger values\n chkIdx := n_LastPos[newIdx]+newIdx-1;\n while InsIdx > chkIdx do\n Begin\n pElem[InsIdx] := pElem[oldIdx];\n dec(InsIdx);\n dec(oldIdx);\n end;\n //insert new value\n pElem[InsIdx] := NewValue+n[newIdx];\n dec(InsIdx);\n dec(newIdx);\n //all inserted\n until newIdx <= 0;\n //new minimum search position one behind, oldidx is one to small\n inc(oldidx,2);\n For newIdx := 1 to maxIdx do\n n_LastPos[newIdx] := oldIdx;\nend;\nprocedure FindNew;\nvar\n pSumAll,pn : tpElem;\n i,LastCheckPos,newValue,newSum : NativeUint;\n TestRes : boolean;\nbegin\n //start value = last inserted value\n newValue := n[maxIdx];\n pSumAll := @n_sum_all[0];\n pn := @n[0];\n repeat\n //try next number\n inc(newValue);\n LastCheckPos := n_LastPos[1];\n i := 1;\n //check if sum = new is already n all_sum\n repeat\n newSum := newValue+pn[i];\n IF LastCheckPos < n_LastPos[i] then\n LastCheckPos := n_LastPos[i];\n while pSumAll[LastCheckPos] < newSum do\n inc(LastCheckPos);\n //memorize LastCheckPos;\n n_LastPos[i] := LastCheckPos;\n TestRes:= pSumAll[LastCheckPos] = newSum;\n IF TestRes then\n BREAK;\n inc(i);\n until i>maxIdx;\n //found?\n If not(TestRes) then\n BREAK;\n until false;\n InsertNew_sum(newValue);\nend;\n\nvar\n T1,T0: Int64;\n i,k : NativeInt;\n\nprocedure Out_num(k:NativeInt);\nBegin\n T1 := GetTickCount64;\n // k n[k] average dist last deltak total time\n writeln(k:6,n[k]:12,(n[k]-n[k-deltaK+1]) DIV deltaK:8,T1-T0:8,' ms');\nend;\n\nBEGIN\n writeln('Allocated memory ',2*SizeOf(t_n)+Sizeof(t_n_sum_all));\n T0 := GetTickCount64;\n while t0 = GetTickCount64 do;\n T0 := GetTickCount64;\n Init;\n\n k := deltaK;\n i := 1;\n repeat\n repeat\n FindNew;\n inc(i);\n until i=k;\n Out_num(k);\n k := k+deltaK;\n until k>maxCnt;\n writeln;\n writeln(#13,'The first 30 terms of the Mian-Chowla sequence are');\n For i := 1 to 30 do\n write(n[i],' ');\n writeln;\n writeln;\n writeln('The terms 91 - 100 of the Mian-Chowla sequence are');\n For i := 91 to 100 do\n write(n[i],' ');\n writeln;\nEND.\n","language":"Pascal"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\n\nsub generate_mc {\n my($max) = @_;\n my $index = 0;\n my $test = 1;\n my %sums = (2 => 1);\n my @mc = 1;\n while ($test++) {\n my %these = %sums;\n map { next if ++$these{$_ + $test} > 1 } @mc[0..$index], $test;\n %sums = %these;\n $index++;\n return @mc if (push @mc, $test) > $max-1;\n }\n}\n\nmy @mian_chowla = generate_mc(100);\nsay \"First 30 terms in the Mian–Chowla sequence:\\n\", join(' ', @mian_chowla[ 0..29]),\n \"\\nTerms 91 through 100:\\n\", join(' ', @mian_chowla[90..99]);\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">mian_chowla</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;\">sequence</span> <span style=\"color: #000000;\">mc</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: #000000;\">is</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #004600;\">false</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;\">len_is</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2</span><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: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">isx</span> <span style=\"color: #0000FF;\">=</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: #000000;\">mc</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>\n <span style=\"color: #000000;\">mc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">mc</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">j</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: #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;\">mc</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">mc</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">j</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">len_is</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">is</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: #000000;\">isx</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: #000000;\">isx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">isx</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;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">isx</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;\">isx</span><span style=\"color: #0000FF;\">[$]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">len_is</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">is</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;\">s</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">len_is</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">len_is</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">is</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;\">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;\">isx</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">is</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">isx</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</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;\">for</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;\">j</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">mc</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;\">while</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;\">mc</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;\">sequence</span> <span style=\"color: #000000;\">mc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">mian_chowla</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">100</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 30 terms of the Mian-Chowla sequence are:\\n %V\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">mc</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">30</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;\">\"Terms 91 to 100 of the Mian-Chowla sequence are:\\n %V\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">mc</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">91</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">100</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;\">\"completed in %s\\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":"from itertools import count, islice, chain\nimport time\n\ndef mian_chowla():\n mc = [1]\n yield mc[-1]\n psums = set([2])\n newsums = set([])\n for trial in count(2):\n for n in chain(mc, [trial]):\n sum = n + trial\n if sum in psums:\n newsums.clear()\n break\n newsums.add(sum)\n else:\n psums |= newsums\n newsums.clear()\n mc.append(trial)\n yield trial\n\ndef pretty(p, t, s, f):\n print(p, t, \" \".join(str(n) for n in (islice(mian_chowla(), s, f))))\n\nif __name__ == '__main__':\n st = time.time()\n ts = \"of the Mian-Chowla sequence are:\\n\"\n pretty(\"The first 30 terms\", ts, 0, 30)\n pretty(\"\\nTerms 91 to 100\", ts, 90, 100)\n print(\"\\nComputation time was\", (time.time()-st) * 1000, \"ms\")\n","language":"Python"},{"code":"'''Mian-Chowla series'''\n\nfrom itertools import (islice)\nfrom time import time\n\n\n# mianChowlas :: Gen [Int]\ndef mianChowlas():\n '''Mian-Chowla series - Generator constructor\n '''\n mcs = [1]\n sumSet = set([2])\n x = 1\n while True:\n yield x\n (sumSet, mcs, x) = nextMC(sumSet, mcs, x)\n\n\n# nextMC :: (Set Int, [Int], Int) -> (Set Int, [Int], Int)\ndef nextMC(setSums, mcs, n):\n '''(Set of sums, series so far, current term) ->\n (updated sum set, updated series, next term)\n '''\n def valid(x):\n for m in mcs:\n if x + m in setSums:\n return False\n return True\n\n x = until(valid)(succ)(n)\n setSums.update(\n [x + y for y in mcs] + [2 * x]\n )\n return (setSums, mcs + [x], x)\n\n\n# TEST ----------------------------------------------------\n# main :: IO ()\ndef main():\n '''Tests'''\n\n start = time()\n genMianChowlas = mianChowlas()\n print(\n 'First 30 terms of the Mian-Chowla series:\\n',\n take(30)(genMianChowlas)\n )\n drop(60)(genMianChowlas)\n print(\n '\\n\\nTerms 91 to 100 of the Mian-Chowla series:\\n',\n take(10)(genMianChowlas),\n '\\n'\n )\n print(\n '(Computation time c. ' + str(round(\n 1000 * (time() - start)\n )) + ' ms)'\n )\n\n\n# GENERIC -------------------------------------------------\n\n# drop :: Int -> [a] -> [a]\n# drop :: Int -> String -> String\ndef drop(n):\n '''The suffix of xs after the\n first n elements, or [] if n > length xs'''\n def go(xs):\n if isinstance(xs, list):\n return xs[n:]\n else:\n take(n)(xs)\n return xs\n return lambda xs: go(xs)\n\n\n# succ :: Int -> Int\ndef succ(x):\n '''The successor of a numeric value (1 +)'''\n return 1 + x\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 return lambda xs: (\n xs[0:n]\n if isinstance(xs, list)\n else list(islice(xs, n))\n )\n\n\n# until :: (a -> Bool) -> (a -> a) -> a -> a\ndef until(p):\n '''The result of applying f until p holds.\n The initial seed value is x.'''\n def go(f, x):\n v = x\n while not p(v):\n v = f(v)\n return v\n return lambda f: lambda x: go(f, x)\n\n\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":" [ stack ] is makeable ( --> s )\n\n [ temp put\n 1 bit makeable put\n ' [ 1 ] 1\n [ true temp put\n 1+\n over witheach\n [ over + bit\n makeable share & if\n [ false temp replace\n conclude ] ]\n temp take if\n [ dup dip join\n over witheach\n [ over + bit\n makeable take\n | makeable put ] ]\n over size temp share = until ]\n makeable release\n temp release\n drop ] is mian-chowla ( n --> [ )\n\n100 mian-chowla\n30 split swap echo cr\n-10 split nip echo\n","language":"Quackery"},{"code":"my @mian-chowla = 1, |(2..Inf).map: -> $test {\n state $index = 1;\n state %sums = 2 => 1;\n my $next;\n my %these;\n @mian-chowla[^$index].map: { ++$next and last if %sums{$_ + $test}:exists; ++%these{$_ + $test} };\n next if $next;\n ++%sums{$test + $test};\n %sums.push: %these;\n ++$index;\n $test\n};\n\nput \"First 30 terms in the Mian–Chowla sequence:\\n\", @mian-chowla[^30];\nput \"\\nTerms 91 through 100:\\n\", @mian-chowla[90..99];\n","language":"Raku"},{"code":"/*REXX program computes and displays any range of the Mian─Chowla integer sequence.*/\nparse arg LO HI . /*obtain optional arguments from the CL*/\nif LO=='' | LO==\",\" then LO= 1 /*Not specified? Then use the default.*/\nif HI=='' | HI==\",\" then HI= 30 /* \" \" \" \" \" \" */\nr.= 0 /*initialize the rejects stemmed array.*/\n#= 0 /*count of numbers in sequence (so far)*/\n$= /*the Mian─Chowla sequence (so far). */\n do t=1 until #=HI; @.= r.0 /*process numbers until range is filled*/\n do i=1 for t; if r.i then iterate /*I already rejected? Then ignore it.*/\n do j=i for t-i+1; if r.j then iterate /*J \" \" \" \" \" */\n _= i + j /*calculate the sum of I and J. */\n if @._ then do; r.t= 1; iterate t; end /*reject T from Mian─Chowla sequence.*/\n @._= 1 /*mark _ as one of the sequence sums.*/\n end /*j*/\n end /*i*/\n #= # + 1 /*bump the counter of terms in the list*/\n if #>=LO then if #<=HI then $= $ t /*In the specified range? Add to list.*/\n end /*t*/\n /*stick a fork in it, we're all done. */\nsay 'The Mian─Chowla sequence for terms ' LO \"──►\" HI ' (inclusive):'\nsay strip($) /*ignore the leading superfluous blank.*/\n","language":"REXX"},{"code":"require 'set'\nn, ts, mc, sums = 100, [], [1], Set.new\nsums << 2\nst = Time.now\nfor i in (1 .. (n-1))\n for j in mc[i-1]+1 .. Float::INFINITY\n mc[i] = j\n for k in (0 .. i)\n if (sums.include?(sum = mc[k]+j))\n ts.clear\n break\n end\n ts << sum\n end\n if (ts.length > 0)\n sums = sums | ts\n break\n end\n end\nend\net = (Time.now - st) * 1000\ns = \" of the Mian-Chowla sequence are:\\n\"\nputs \"The first 30 terms#{s}#{mc.slice(0..29).join(' ')}\\n\\n\"\nputs \"Terms 91 to 100#{s}#{mc.slice(90..99).join(' ')}\\n\\n\"\nputs \"Computation time was #{et.round(1)}ms.\"\n","language":"Ruby"},{"code":"mian_chowla = Enumerator.new do |yielder|\n mc, sums = [1], {}\n 1.step do |n|\n mc << n\n if mc.none?{|k| sums[k+n] } then\n mc.each{|k| sums[k+n] = true }\n yielder << n\n else\n mc.pop # n didn't work, get rid of it.\n end\n end\nend\n\nres = mian_chowla.take(100).to_a\n\ns = \" of the Mian-Chowla sequence are:\\n\"\nputs \"The first 30 terms#{s}#{res[0,30].join(' ')}\\n\nTerms 91 to 100#{s}#{res[90,10].join(' ')}\"\n","language":"Ruby"},{"code":"var (n, sums, ts, mc) = (100, Set(2), [], [1])\nvar st = Time.micro\nfor i in (1 ..^ n) {\n for j in (mc[i-1]+1 .. Inf) {\n mc[i] = j\n for k in (0 .. i) {\n var sum = mc[k]+j\n if (sums.has(sum)) {\n ts.clear\n break\n }\n ts << sum\n }\n if (ts.len > 0) {\n sums |= Set(ts...)\n break\n }\n }\n}\nvar et = (Time.micro - st)\nvar s = \" of the Mian-Chowla sequence are:\\n\"\nsay \"The first 30 terms#{s}#{mc.first(30).join(' ')}\\n\"\nsay \"Terms 91 to 100#{s}#{mc.slice(90).first(10).join(' ')}\\n\"\nsay \"Computation time was #{et} seconds.\"\n","language":"Sidef"},{"code":"public func mianChowla(n: Int) -> [Int] {\n var mc = Array(repeating: 0, count: n)\n var ls = [2: true]\n var sum = 0\n\n mc[0] = 1\n\n for i in 1..<n {\n var lsx = [Int]()\n\n jLoop: for j in (mc[i-1]+1)... {\n mc[i] = j\n\n for k in 0...i {\n sum = mc[k] + j\n\n if ls[sum] ?? false {\n lsx = []\n continue jLoop\n }\n\n lsx.append(sum)\n }\n\n for n in lsx {\n ls[n] = true\n }\n\n break\n }\n }\n\n return mc\n}\n\nlet seq = mianChowla(n: 100)\n\nprint(\"First 30 terms in sequence are: \\(Array(seq.prefix(30)))\")\nprint(\"Terms 91 to 100 are: \\(Array(seq[90..<100]))\")\n","language":"Swift"},{"code":"' Mian-Chowla sequence - VBScript - 15/03/2019\n Const m = 100, mm=28000\n ReDim r(mm), v(mm * 2)\n Dim n, t, i, j, l, s1, s2, iterate_t\n ReDim seq(m)\n t0=Timer\n s1 = \"1\": s2 = \"\"\n seq(1) = 1: n = 1: t = 1\n Do While n < m\n t = t + 1\n iterate_t = False\n For i = 1 to t * 2\n v(i) = 0\n Next\n i = 1\n Do While i <= t And Not iterate_t\n If r(i) = 0 Then\n j = i\n Do While j <= t And Not iterate_t\n If r(j) = 0 Then\n l = i + j\n If v(l) = 1 Then\n r(t) = 1\n iterate_t = True\n End If\n If Not iterate_t Then v(l) = 1\n End If\n j = j + 1\n Loop\n End If\n i = i + 1\n Loop\n If Not iterate_t Then\n n = n + 1\n seq(n) = t\n if n<= 30 then s1 = s1 & \" \" & t\n if n>=91 and n<=100 then s2 = s2 & \" \" & t\n End If\n Loop\n wscript.echo \"t=\"& t\n wscript.echo \"The Mian-Chowla sequence for elements 1 to 30:\"\n wscript.echo s1\n wscript.echo \"The Mian-Chowla sequence for elements 91 to 100:\"\n wscript.echo s2\n wscript.echo \"Computation time: \"& Int(Timer-t0) &\" sec\"\n","language":"VBScript"},{"code":"' Mian-Chowla sequence - VBScript - March 19th, 2019\n\n Function Find(x(), val) ' finds val on a pre-sorted list\n Dim l, u, h : l = 0 : u = ubound(x) : Do : h = (l + u) \\ 2\n If val = x(h) Then Find = h : Exit Function\n If val > x(h) Then l = h + 1 Else u = h - 1\n Loop Until l > u : Find = -1\n End Function\n\n ' adds next item from a() to result (r()), adds all remaining items\n ' from b(), once a() is exhausted\n Sub Shuffle(ByRef r(), a(), b(), ByRef i, ByRef ai, ByRef bi, al, bl)\n r(i) = a(ai) : ai = ai + 1 : If ai > al Then Do : i = i + 1 : _\n r(i) = b(bi) : bi = bi + 1 : Loop until bi = bl\n End Sub\n\n Function Merger(a(), b(), bl) ' merges two pre-sorted lists\n Dim res(), ai, bi, i : ReDim res(ubound(a) + bl) : ai = 0 : bi = 0\n For i = 0 To ubound(res)\n If a(ai) < b(bi) Then Shuffle res, a, b, i, ai, bi, ubound(a), bl _\n Else Shuffle res, b, a, i, bi, ai, bl, ubound(a)\n Next : Merger = res\n End Function\n\n Const n = 100 : Dim mc(), sums(), ts(), sp, tc : sp = 1 : tc = 0\n ReDim mc(n - 1), sums(0), ts(n - 1) : mc(0) = 1 : sums(sp - 1) = 2\n Dim sum, i, j, k, st : st = Timer\n wscript.echo \"The Mian-Chowla sequence for elements 1 to 30:\"\n wscript.stdout.write(\"1 \")\n For i = 1 To n - 1 : j = mc(i - 1) + 1 : Do\n mc(i) = j : For k = 0 To i\n sum = mc(k) + j : If Find(sums, sum) >= 0 Then _\n tc = 0 : Exit For Else ts(tc) = sum : tc = tc + 1\n Next : If tc > 0 Then\n nu = Merger(sums, ts, tc) : ReDim sums(ubound(nu))\n For e = 0 To ubound(nu) : sums(e) = nu(e) : Next\n tc = 0 : Exit Do\n End If : j = j + 1 : Loop\n if i = 90 then wscript.echo vblf & vbLf & _\n \"The Mian-Chowla sequence for elements 91 to 100:\"\n If i < 30 or i >= 90 Then wscript.stdout.write(mc(i) & \" \")\n Next\n wscript.echo vblf & vbLf & \"Computation time: \"& Timer - st &\" seconds.\"\n","language":"VBScript"},{"code":"Module Module1\nFunction MianChowla(ByVal n As Integer) As Integer()\n Dim mc(n - 1) As Integer, sums, ts As New HashSet(Of Integer),\n sum As Integer : mc(0) = 1 : sums.Add(2)\n For i As Integer = 1 To n - 1\n For j As Integer = mc(i - 1) + 1 To Integer.MaxValue\n mc(i) = j\n For k As Integer = 0 To i\n sum = mc(k) + j\n If sums.Contains(sum) Then ts.Clear() : Exit For\n ts.Add(sum)\n Next\n If ts.Count > 0 Then sums.UnionWith(ts) : Exit For\n Next\n Next\n Return mc\n End Function\n\n Sub Main(ByVal args As String())\n Const n As Integer = 100\n Dim sw As New Stopwatch(), str As String = \" of the Mian-Chowla sequence are:\" & vbLf\n sw.Start() : Dim mc As Integer() = MianChowla(n) : sw.Stop()\n Console.Write(\"The first 30 terms{1}{2}{0}{0}Terms 91 to 100{1}{3}{0}{0}\" &\n \"Computation time was {4}ms.{0}\", vbLf, str,\n String.Join(\" \", mc.Take(30)), String.Join(\" \", mc.Skip(n - 10)), sw.ElapsedMilliseconds)\n End Sub\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"var mianChowla = Fn.new { |n|\n var mc = List.filled(n, 0)\n var sums = {}\n var ts = {}\n mc[0] = 1\n sums[2] = true\n for (i in 1...n) {\n var j = mc[i-1] + 1\n while (true) {\n mc[i] = j\n for (k in 0..i) {\n var sum = mc[k] + j\n if (sums[sum]) {\n ts.clear()\n break\n }\n ts[sum] = true\n }\n if (ts.count > 0) {\n for (key in ts.keys) sums[key] = true\n break\n }\n j = j + 1\n }\n }\n return mc\n}\n\nvar start = System.clock\nvar mc = mianChowla.call(100)\nSystem.print(\"The first 30 terms of the Mian-Chowla sequence are:\\n%(mc[0..29].join(\" \"))\")\nSystem.print(\"\\nTerms 91 to 100 of the Mian-Chowla sequence are:\\n%(mc[90..99].join(\" \"))\")\nSystem.print(\"\\nTook %(((System.clock - start)*1000).round) milliseconds\")\n","language":"Wren"},{"code":"define N = 100;\ndefine NN = (N * (N+1)) >> 1;\n\nfunc Contains(Lst, Item, Size);\nint Lst, Item, Size, I;\n[for I:= Size-1 downto 0 do\n if Item = Lst(I) then return true;\nreturn false;\n];\n\nint MC(N);\n\nproc MianChowla;\nint Sums(NN), Sum, LE, SS, I, J, K;\n[MC(0):= 1;\nSums(0):= 2;\nSS:= 1;\nfor I:= 1 to N-1 do\n [LE:= SS;\n J:= MC(I-1) + 1;\n MC(I):= J;\n K:= 0;\n loop [Sum:= MC(K) + J;\n if Contains(Sums, Sum, SS) then\n [SS:= LE;\n J:= J+1;\n MC(I):= J;\n K:= 0;\n ]\n else\n [Sums(SS):= Sum;\n SS:= SS+1;\n K:= K+1;\n if K > I then quit;\n ];\n ];\n ];\n];\n\nint I;\n[MianChowla;\nText(0, \"The first 30 terms of the Mian-Chowla sequence are:^m^j\");\nfor I:= 0 to 30-1 do\n [IntOut(0, MC(I)); ChOut(0, ^ )];\nText(0, \"^m^j^m^jTerms 91 to 100 of the Mian-Chowla sequence are:^m^j\");\nfor I:= 90 to 100-1 do\n [IntOut(0, MC(I)); ChOut(0, ^ )];\nCrLf(0);\n]\n","language":"XPL0"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Mian-Chowla_sequence\\n\",\n \"language\": \"00-META\"\n },\n {\n \"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 belongs to the class known as B₂ sequences.\\n\\n\\nThe sequence starts with:\\n\\n::<span style=\\\"font-style:italic;font-weight:bold;font-size:125%;\\\">a<sub>1</sub> = 1</span>\\n\\nthen for <span style=\\\"font-style:italic;font-weight:bold;font-size:125%;padding:.3em;\\\">n > 1,</span> <span style=\\\"font-style:italic;font-weight:bold;font-size:125%;padding:.3em;\\\">a<sub>n</sub></span> is the smallest positive integer such that every pairwise sum\\n\\n::<span style=\\\"font-style:italic;font-weight:bold;font-size:125%;\\\">a<sub>i</sub> + a<sub>j</sub> \\n\\nis distinct, for all <span style=\\\"font-style:italic;font-weight:bold;font-size:125%;\\\">i</span> and <span style=\\\"font-style:italic;font-weight:bold;font-size:125%;\\\">j</span> less than or equal to <span style=\\\"font-style:italic;font-weight:bold;font-size:125%;\\\">n</span>.\\n\\n;The Task:\\n\\n:* Find and display, here, on this page the first 30 terms of the Mian–Chowla sequence.\\n:* Find and display, here, on this page the 91st through 100th terms of the Mian–Chowla sequence.\\n\\n\\nDemonstrating working through the first few terms longhand:\\n\\n::<span style=\\\"font-style:italic;font-weight:bold;font-size:125%;\\\">a<sub>1</sub> = 1</span>\\n\\n::<span style=\\\"font-weight:bold;\\\">1 + 1 = 2</span>\\n\\nSpeculatively try <span style=\\\"font-style:italic;font-weight:bold;font-size:125%;padding:.3em;\\\">a<sub>2</sub> = 2</span>\\n\\n::<span style=\\\"font-weight:bold;\\\">1 + 1 = 2</span>\\n::<span style=\\\"font-weight:bold;\\\">1 + 2 = 3</span>\\n::<span style=\\\"font-weight:bold;\\\">2 + 2 = 4</span>\\n\\nThere are no repeated sums so '''2''' is the next number in the sequence.\\n\\nSpeculatively try <span style=\\\"font-style:italic;font-weight:bold;font-size:125%;padding:.3em;\\\">a<sub>3</sub> = 3</span>\\n\\n::<span style=\\\"font-weight:bold;\\\">1 + 1 = 2</span>\\n::<span style=\\\"font-weight:bold;\\\">1 + 2 = 3</span> \\n::<span style=\\\"font-weight:bold;\\\">1 + 3 = <span style=\\\"background-color:yellow;\\\">4</span></span>\\n::<span style=\\\"font-weight:bold;\\\">2 + 2 = <span style=\\\"background-color:yellow;\\\">4</span></span>\\n::<span style=\\\"font-weight:bold;\\\">2 + 3 = 5</span>\\n::<span style=\\\"font-weight:bold;\\\">3 + 3 = 6</span>\\n\\nSum of '''4''' is repeated so '''3''' is rejected.\\n\\nSpeculatively try <span style=\\\"font-style:italic;font-weight:bold;font-size:125%;padding:.3em;\\\">a<sub>3</sub> = 4</span>\\n\\n::<span style=\\\"font-weight:bold;\\\">1 + 1 = 2</span>\\n::<span style=\\\"font-weight:bold;\\\">1 + 2 = 3</span>\\n::<span style=\\\"font-weight:bold;\\\">1 + 4 = 5</span>\\n::<span style=\\\"font-weight:bold;\\\">2 + 2 = 4</span>\\n::<span style=\\\"font-weight:bold;\\\">2 + 4 = 6</span>\\n::<span style=\\\"font-weight:bold;\\\">4 + 4 = 8</span>\\n\\nThere are no repeated sums so '''4''' is the next number in the sequence.\\n\\nAnd so on...\\n\\n;See also:\\n\\n:* [[oeis:A005282|OEIS:A005282 Mian-Chowla sequence]]\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F contains(sums, s, ss)\\n L(i) 0 .< ss\\n I sums[i] == s\\n R 1B\\n R 0B\\n\\nF mian_chowla()\\n V n = 100\\n V mc = [0] * n\\n mc[0] = 1\\n V sums = [0] * ((n * (n + 1)) >> 1)\\n sums[0] = 2\\n V ss = 1\\n L(i) 1 .< n\\n V le = ss\\n V j = mc[i - 1] + 1\\n L\\n mc[i] = j\\n V nxtJ = 0B\\n L(k) 0 .. i\\n V sum = mc[k] + j\\n I contains(sums, sum, ss)\\n ss = le\\n nxtJ = 1B\\n L.break\\n sums[ss] = sum\\n ss++\\n I !nxtJ\\n L.break\\n j++\\n R mc\\n\\nprint(‘The first 30 terms of the Mian-Chowla sequence are:’)\\nV mc = mian_chowla()\\nprint_elements(mc[0.<30])\\nprint()\\nprint(‘Terms 91 to 100 of the Mian-Chowla sequence are:’)\\nprint_elements(mc[90..])\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\nwith Ada.Containers.Hashed_Sets;\\n\\nprocedure Mian_Chowla_Sequence\\nis\\n type Natural_Array is array(Positive range <>) of Natural;\\n\\n function Hash(P : in Positive) return Ada.Containers.Hash_Type is\\n begin\\n return Ada.Containers.Hash_Type(P);\\n end Hash;\\n\\n package Positive_Sets is new Ada.Containers.Hashed_Sets(Positive, Hash, \\\"=\\\");\\n\\n function Mian_Chowla(N : in Positive) return Natural_Array\\n is\\n return_array : Natural_Array(1 .. N) := (others => 0);\\n nth : Positive := 1;\\n candidate : Positive := 1;\\n seen : Positive_Sets.Set;\\n begin\\n while nth <= N loop\\n declare\\n sums : Positive_Sets.Set;\\n terms : constant Natural_Array := return_array(1 .. nth-1) & candidate;\\n found : Boolean := False;\\n begin\\n for term of terms loop\\n if seen.Contains(term + candidate) then\\n found := True;\\n exit;\\n else\\n sums.Insert(term + candidate);\\n end if;\\n end loop;\\n\\n if not found then\\n return_array(nth) := candidate;\\n seen.Union(sums);\\n nth := nth + 1;\\n end if;\\n candidate := candidate + 1;\\n end;\\n end loop;\\n return return_array;\\n end Mian_Chowla;\\n\\n length : constant Positive := 100;\\n sequence : constant Natural_Array(1 .. length) := Mian_Chowla(length);\\nbegin\\n Ada.Text_IO.Put_Line(\\\"Mian Chowla sequence first 30 terms :\\\");\\n for term of sequence(1 .. 30) loop\\n Ada.Text_IO.Put(term'Img);\\n end loop;\\n Ada.Text_IO.New_Line;\\n Ada.Text_IO.Put_Line(\\\"Mian Chowla sequence terms 91 to 100 :\\\");\\n for term of sequence(91 .. 100) loop\\n Ada.Text_IO.Put(term'Img);\\n end loop;\\nend Mian_Chowla_Sequence;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# Find Mian-Chowla numbers: an\\n where: ai = 1,\\n and: an = smallest integer such that ai + aj is unique\\n for all i, j in 1 .. n && i <= j\\n#\\nBEGIN\\n INT max mc = 100;\\n [ max mc ]INT mc;\\n INT curr size := 0; # initial size of the array #\\n INT size increment = 10 000; # size to increase the array by #\\n REF[]BOOL is sum := HEAP[ 1 : 0 ]BOOL;\\n INT mc count := 1;\\n FOR i WHILE mc count <= max mc DO\\n # assume i will be part of the sequence #\\n mc[ mc count ] := i;\\n # check the sums #\\n IF ( 2 * i ) > curr size THEN\\n # the is sum array is too small - make a larger one #\\n REF[]BOOL new sum = HEAP[ curr size + size increment ]BOOL;\\n new sum[ 1 : curr size ] := is sum;\\n FOR n TO size increment DO new sum[ curr size + n ] := FALSE OD;\\n curr size +:= size increment;\\n is sum := new sum\\n FI;\\n BOOL is unique := TRUE;\\n FOR mc pos TO mc count WHILE is unique := NOT is sum[ i + mc[ mc pos ] ] DO SKIP OD;\\n IF is unique THEN\\n # i is a sequence element - store the sums #\\n FOR k TO mc count DO is sum[ i + mc[ k ] ] := TRUE OD;\\n mc count +:= 1\\n FI\\n OD;\\n\\n # print parts of the sequence #\\n print( ( \\\"Mian Chowla sequence elements 1..30:\\\", newline ) );\\n FOR i TO 30 DO print( ( \\\" \\\", whole( mc[ i ], 0 ) ) ) OD;\\n print( ( newline ) );\\n print( ( \\\"Mian Chowla sequence elements 91..100:\\\", newline ) );\\n FOR i FROM 91 TO 100 DO print( ( \\\" \\\", whole( mc[ i ], 0 ) ) ) OD\\n\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"mianChowla: function [n][\\n result: new [1]\\n sums: new [2]\\n candidate: 1\\n\\n while [n > size result][\\n fit: false\\n 'result ++ 0\\n while [not? fit][\\n candidate: candidate + 1\\n fit: true\\n result\\\\[dec size result]: candidate\\n loop result 'val [\\n if contains? sums val + candidate [\\n fit: false\\n break\\n ]\\n ]\\n ]\\n\\n loop result 'val [\\n 'sums ++ val + candidate\\n unique 'sums\\n ]\\n ]\\n return result\\n]\\n\\nseq100: mianChowla 100\\n\\nprint \\\"The first 30 terms of the Mian-Chowla sequence are:\\\"\\nprint slice seq100 0 29\\nprint \\\"\\\"\\n\\nprint \\\"Terms 91 to 100 of the sequence are:\\\"\\nprint slice seq100 90 99\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"# Find Mian-Chowla numbers: an\\n# where: ai = 1,\\n# and: an = smallest integer such that ai + aj is unique\\n# for all i, j in 1 .. n && i <= j\\n#\\nBEGIN \\\\\\n{\\n\\n FALSE = 0;\\n TRUE = 1;\\n\\n mcCount = 1;\\n\\n for( i = 1; mcCount <= 100; i ++ )\\n {\\n # assume i will be part of the sequence\\n mc[ mcCount ] = i;\\n # check the sums\\n isUnique = TRUE;\\n for( mcPos = 1; mcPos <= mcCount && isUnique; mcPos ++ )\\n {\\n isUnique = ! ( ( i + mc[ mcPos ] ) in isSum );\\n } # for j\\n if( isUnique )\\n {\\n # i is a sequence element - store the sums\\n for( k = 1; k <= mcCount; k ++ )\\n {\\n isSum[ i + mc[ k ] ] = TRUE;\\n } # for k\\n mcCount ++;\\n } # if isUnique\\n } # for i\\n # print the sequence\\n printf( \\\"Mian Chowla sequence elements 1..30:\\\\n\\\" );\\n for( i = 1; i <= 30; i ++ )\\n {\\n printf( \\\" %d\\\", mc[ i ] );\\n } # for i\\n printf( \\\"\\\\n\\\" );\\n printf( \\\"Mian Chowla sequence elements 91..100:\\\\n\\\" );\\n for( i = 91; i <= 100; i ++ )\\n {\\n printf( \\\" %d\\\", mc[ i ] );\\n } # for i\\n printf( \\\"\\\\n\\\" );\\n\\n} # BEGIN\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"# helper functions\\n#\\n# determine if a list is empty or not\\nfunction isEmpty(a) { for (ii in a) return 0; return 1 }\\n# list concatination\\nfunction concat(a, b) { for (cc in b) a[cc] = cc }\\n\\nBEGIN \\\\\\n{\\n mc[0] = 1; sums[2] = 0; # initialize lists\\n for ( i = 1; i < 100; i ++ ) # iterate for each item in result\\n {\\n for ( j = mc[i-1]+1; ; j ++ ) # iterate thru trial values\\n {\\n mc[i] = j; # set trial value into result\\n for ( k = 0; k <= i; k ++ ) # test new iteration of sums\\n {\\n # test trial sum against old sums list\\n if ((sum = mc[k] + j) in sums)\\n { # collision, so\\n delete ts; # toss out any accumulated items,\\n break; # and break out to the next j\\n }\\n ts[sum] = sum; # (else) accumulate to new sum list\\n } # for k\\n if ( isEmpty( ts ) ) # nothing to add,\\n continue; # so try next j\\n concat( sums, ts ); # combine new sums to old,\\n delete ts; # clear out the new,\\n break; # break out to next i\\n } # for j\\n } # for i\\n # print the sequence\\n ps = \\\"Mian Chowla sequence elements %d..%d:\\\\n\\\";\\n for ( i = 0; i < 100; i ++ )\\n {\\n if ( i == 0 ) printf ps, 1, 30;\\n if ( i == 90 ) printf \\\"\\\\n\\\\n\\\" ps, 91, 100;\\n if ( i < 30 || i >= 90 ) printf \\\"%d \\\", mc[ i ];\\n } # for i\\n print \\\"\\\\n\\\"\\n} # BEGIN\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdbool.h>\\n#include <time.h>\\n\\n#define n 100\\n#define nn ((n * (n + 1)) >> 1)\\n\\nbool Contains(int lst[], int item, int size) {\\n\\tfor (int i = size - 1; i >= 0; i--)\\n \\t\\tif (item == lst[i]) return true;\\n\\treturn false;\\n}\\n\\nint * MianChowla()\\n{\\n\\tstatic int mc[n]; mc[0] = 1;\\n\\tint sums[nn];\\tsums[0] = 2;\\n\\tint sum, le, ss = 1;\\n\\tfor (int i = 1; i < n; i++) {\\n\\t\\tle = ss;\\n\\t\\tfor (int j = mc[i - 1] + 1; ; j++) {\\n\\t\\t\\tmc[i] = j;\\n\\t\\t\\tfor (int k = 0; k <= i; k++) {\\n\\t\\t\\t\\tsum = mc[k] + j;\\n\\t\\t\\t\\tif (Contains(sums, sum, ss)) {\\n\\t\\t\\t\\t\\tss = le; goto nxtJ;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tsums[ss++] = sum;\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\tnxtJ:;\\n\\t\\t}\\n\\t}\\n\\treturn mc;\\n}\\n\\nint main() {\\n\\tclock_t st = clock(); int * mc; mc = MianChowla();\\n double et = ((double)(clock() - st)) / CLOCKS_PER_SEC;\\n\\tprintf(\\\"The first 30 terms of the Mian-Chowla sequence are:\\\\n\\\");\\n\\tfor (int i = 0; i < 30; i++) printf(\\\"%d \\\", mc[i]);\\n\\tprintf(\\\"\\\\n\\\\nTerms 91 to 100 of the Mian-Chowla sequence are:\\\\n\\\");\\n\\tfor (int i = 90; i < 100; i++) printf(\\\"%d \\\", mc[i]);\\n\\tprintf(\\\"\\\\n\\\\nComputation time was %f seconds.\\\", et);\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <stdbool.h>\\n#include <time.h>\\n\\n// helper function for indicating memory used.\\nvoid approx(char* buf, double count)\\n{\\n const char* suffixes[] = { \\\"Bytes\\\", \\\"KiB\\\", \\\"MiB\\\" };\\n uint s = 0;\\n while (count >= 1024 && s < 3) { s++; count /= 1024; }\\n if (count - (double)((int)count) == 0.0)\\n sprintf(buf, \\\"%d %s\\\", (int)count, suffixes[s]);\\n else\\n sprintf(buf, \\\"%.1f %s\\\", count, suffixes[s]);\\n}\\n\\nint main() {\\n int i, j, k, c = 0, n = 100, nn = 110;\\n int* mc = (int*) malloc((n) * sizeof(int));\\n bool* isSum = (bool*) calloc(nn, sizeof(bool));\\n char em[] = \\\"unable to increase isSum array to %ld.\\\";\\n if (n > 100) printf(\\\"Computing terms 1 to %d...\\\\n\\\", n);\\n clock_t st = clock();\\n for (i = 1; c < n; i++) {\\n mc[c] = i;\\n if (i + i > nn) {\\n bool* newIs = (bool*)realloc(isSum, (nn <<= 1) * sizeof(bool));\\n if (newIs == NULL) { printf(em, nn); return -1; }\\n isSum = newIs;\\n for (j = (nn >> 1); j < nn; j++) isSum[j] = false;\\n }\\n bool isUnique = true;\\n for (j = 0; (j < c) && isUnique; j++) isUnique = !isSum[i + mc[j]];\\n if (isUnique) {\\n for (k = 1; k <= c; k++) isSum[i + mc[k]] = true;\\n c++;\\n }\\n }\\n double et = 1e3 * ((double)(clock() - st)) / CLOCKS_PER_SEC;\\n free(isSum);\\n printf(\\\"The first 30 terms of the Mian-Chowla sequence are:\\\\n\\\");\\n for (i = 0; i < 30; i++) printf(\\\"%d \\\", mc[i]);\\n printf(\\\"\\\\n\\\\nTerms 91 to 100 of the Mian-Chowla sequence are:\\\\n\\\");\\n for (i = 90; i < 100; i++) printf(\\\"%d \\\", mc[i]);\\n if (c > 100) printf(\\\"\\\\nTerm %d is: %d\\\" ,c , mc[c - 1]);\\n free(mc);\\n char buf[100]; approx(buf, nn * sizeof(bool));\\n printf(\\\"\\\\n\\\\nComputation time was %6.3f ms. Allocation was %s.\\\", et, buf);\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"using namespace std;\\n\\n#include <iostream>\\n#include <ctime>\\n\\n#define n 100\\n#define nn ((n * (n + 1)) >> 1)\\n\\nbool Contains(int lst[], int item, int size) {\\n\\tfor (int i = 0; i < size; i++) if (item == lst[i]) return true;\\n\\treturn false;\\n}\\n\\nint * MianChowla()\\n{\\n\\tstatic int mc[n]; mc[0] = 1;\\n\\tint sums[nn];\\tsums[0] = 2;\\n\\tint sum, le, ss = 1;\\n\\tfor (int i = 1; i < n; i++) {\\n\\t\\tle = ss;\\n\\t\\tfor (int j = mc[i - 1] + 1; ; j++) {\\n\\t\\t\\tmc[i] = j;\\n\\t\\t\\tfor (int k = 0; k <= i; k++) {\\n\\t\\t\\t\\tsum = mc[k] + j;\\n\\t\\t\\t\\tif (Contains(sums, sum, ss)) {\\n\\t\\t\\t\\t\\tss = le; goto nxtJ;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tsums[ss++] = sum;\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\tnxtJ:;\\n\\t\\t}\\n\\t}\\n\\treturn mc;\\n}\\n\\nint main() {\\n\\tclock_t st = clock(); int * mc; mc = MianChowla();\\n\\tdouble et = ((double)(clock() - st)) / CLOCKS_PER_SEC;\\n\\tcout << \\\"The first 30 terms of the Mian-Chowla sequence are:\\\\n\\\";\\n\\tfor (int i = 0; i < 30; i++) { cout << mc[i] << ' '; }\\n\\tcout << \\\"\\\\n\\\\nTerms 91 to 100 of the Mian-Chowla sequence are:\\\\n\\\";\\n\\tfor (int i = 90; i < 100; i++) { cout << mc[i] << ' '; }\\n\\tcout << \\\"\\\\n\\\\nComputation time was \\\" << et << \\\" seconds.\\\";\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Diagnostics;\\nusing System.Linq;\\n\\nstatic class Program {\\n static int[] MianChowla(int n) {\\n int[] mc = new int[n - 1 + 1];\\n HashSet<int> sums = new HashSet<int>(), ts = new HashSet<int>();\\n int sum; mc[0] = 1; sums.Add(2);\\n for (int i = 1; i <= n - 1; i++) {\\n for (int j = mc[i - 1] + 1; ; j++) {\\n mc[i] = j;\\n for (int k = 0; k <= i; k++) {\\n sum = mc[k] + j;\\n if (sums.Contains(sum)) { ts.Clear(); break; }\\n ts.Add(sum);\\n }\\n if (ts.Count > 0) { sums.UnionWith(ts); break; }\\n }\\n }\\n return mc;\\n }\\n\\n static void Main(string[] args)\\n {\\n const int n = 100; Stopwatch sw = new Stopwatch();\\n string str = \\\" of the Mian-Chowla sequence are:\\\\n\\\";\\n sw.Start(); int[] mc = MianChowla(n); sw.Stop();\\n Console.Write(\\\"The first 30 terms{1}{2}{0}{0}Terms 91 to 100{1}{3}{0}{0}\\\" +\\n \\\"Computation time was {4}ms.{0}\\\", '\\\\n', str, string.Join(\\\" \\\", mc.Take(30)),\\n string.Join(\\\" \\\", mc.Skip(n - 10)), sw.ElapsedMilliseconds);\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"// Generate Mian-Chowla sequence. Nigel Galloway: March 23rd., 2019\\nlet mC=let rec fN i g l=seq{\\n let a=(l*2)::[for i in i do yield i+l]@g\\n let b=[l+1..l*2]|>Seq.find(fun e->Seq.forall(fun g->(Seq.contains (g-e)>>not) i) a)\\n yield b; yield! fN (l::i) (a|>List.filter(fun n->n>b)) b}\\n seq{yield 1; yield! fN [] [] 1}\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"mC |> Seq.take 30 |> Seq.iter(printf \\\"%d \\\");printfn \\\"\\\"\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"mC |> Seq.skip 90 |> Seq.take 10 |> Seq.iter(printf \\\"%d \\\");printfn \\\"\\\"\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: fry hash-sets io kernel math prettyprint sequences sets ;\\n\\n: next ( seq sums speculative -- seq' sums' speculative' )\\n dup reach [ + ] with map over dup + suffix! >hash-set pick\\n over intersect null?\\n [ swapd union [ [ suffix! ] keep ] dip swap ] [ drop ] if\\n 1 + ;\\n\\n: mian-chowla ( n -- seq )\\n [ V{ 1 } HS{ 2 } [ clone ] bi@ 2 ] dip\\n '[ pick length _ < ] [ next ] while 2drop ;\\n\\n100 mian-chowla\\n[ 30 head \\\"First 30 terms of the Mian-Chowla sequence:\\\" ]\\n[ 10 tail* \\\"Terms 91-100 of the Mian-Chowla sequence:\\\" ] bi\\n[ print [ pprint bl ] each nl nl ] 2bi@\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"redim as uinteger mian(0 to 1)\\nredim as uinteger sums(0 to 2)\\nmian(0) = 1 : mian(1) = 2\\nsums(0) = 2 : sums(1) = 3 : sums(2) = 4\\ndim as uinteger n_mc = 2, n_sm = 3, curr = 3, tempsum\\nwhile n_mc < 101\\n for i as uinteger = 0 to n_mc - 1\\n tempsum = curr + mian(i)\\n for j as uinteger = 0 to n_sm - 1\\n if tempsum = sums(j) then goto loopend\\n next j\\n next i\\n redim preserve as uinteger mian(0 to n_mc)\\n mian(n_mc) = curr\\n redim preserve as uinteger sums(0 to n_sm + n_mc)\\n for j as uinteger = 0 to n_mc - 1\\n sums(n_sm + j) = mian(j) + mian(n_mc)\\n next j\\n n_mc += 1\\n n_sm += n_mc\\n sums(n_sm-1) = 2*curr\\n loopend:\\n curr += 1\\nwend\\n\\nprint \\\"Mian-Chowla numbers 1 through 30: \\\",\\nfor i as uinteger = 0 to 29\\n print mian(i),\\nnext i\\nprint\\nprint \\\"Mian-Chowla numbers 91 through 100: \\\",\\nfor i as uinteger = 90 to 99\\n print mian(i),\\nnext i\\nprint\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc contains(is []int, s int) bool {\\n for _, i := range is {\\n if s == i {\\n return true\\n }\\n }\\n return false\\n}\\n\\nfunc mianChowla(n int) []int {\\n mc := make([]int, n)\\n mc[0] = 1\\n is := []int{2}\\n var sum int\\n for i := 1; i < n; i++ {\\n le := len(is)\\n jloop:\\n for j := mc[i-1] + 1; ; j++ {\\n mc[i] = j\\n for k := 0; k <= i; k++ {\\n sum = mc[k] + j\\n if contains(is, sum) {\\n is = is[0:le]\\n continue jloop\\n }\\n is = append(is, sum)\\n }\\n break\\n }\\n }\\n return mc\\n}\\n\\nfunc main() {\\n mc := mianChowla(100)\\n fmt.Println(\\\"The first 30 terms of the Mian-Chowla sequence are:\\\")\\n fmt.Println(mc[0:30])\\n fmt.Println(\\\"\\\\nTerms 91 to 100 of the Mian-Chowla sequence are:\\\")\\n fmt.Println(mc[90:100])\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\ntype set map[int]bool\\n\\nfunc mianChowla(n int) []int {\\n mc := make([]int, n)\\n mc[0] = 1\\n is := make(set, n*(n+1)/2)\\n is[2] = true\\n var sum int\\n isx := make([]int, 0, n)\\n for i := 1; i < n; i++ {\\n isx = isx[:0]\\n jloop:\\n for j := mc[i-1] + 1; ; j++ {\\n mc[i] = j\\n for k := 0; k <= i; k++ {\\n sum = mc[k] + j\\n if is[sum] {\\n isx = isx[:0]\\n continue jloop\\n }\\n isx = append(isx, sum)\\n }\\n for _, x := range isx {\\n is[x] = true\\n }\\n break\\n }\\n }\\n return mc\\n}\\n\\nfunc main() {\\n mc := mianChowla(100)\\n fmt.Println(\\\"The first 30 terms of the Mian-Chowla sequence are:\\\")\\n fmt.Println(mc[0:30])\\n fmt.Println(\\\"\\\\nTerms 91 to 100 of the Mian-Chowla sequence are:\\\")\\n fmt.Println(mc[90:100])\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.Set (Set, fromList, insert, member)\\n\\n------------------- MIAN-CHOWLA SEQUENCE -----------------\\nmianChowlas :: Int -> [Int]\\nmianChowlas =\\n reverse . snd . (iterate nextMC (fromList [2], [1]) !!) . subtract 1\\n\\nnextMC :: (Set Int, [Int]) -> (Set Int, [Int])\\nnextMC (sumSet, mcs@(n:_)) =\\n (foldr insert sumSet ((2 * m) : fmap (m +) mcs), m : mcs)\\n where\\n valid x = not $ any (flip member sumSet . (x +)) mcs\\n m = until valid succ n\\n\\n--------------------------- TEST -------------------------\\nmain :: IO ()\\nmain =\\n (putStrLn . unlines)\\n [ \\\"First 30 terms of the Mian-Chowla series:\\\"\\n , show (mianChowlas 30)\\n , []\\n , \\\"Terms 91 to 100 of the Mian-Chowla series:\\\"\\n , show $ drop 90 (mianChowlas 100)\\n ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"NB. http://rosettacode.org/wiki/Mian-Chowla_sequence\\n\\nNB. Dreadfully inefficient implementation recomputes all the sums to n-1\\nNB. and computes the full addition table rather than just a triangular region\\nNB. However, this implementation is sufficiently quick to meet the requirements.\\n\\nNB. The vector head is the next speculative value\\nNB. Beheaded, the vector is Mian-Chowla sequence.\\n\\n\\nUntil =: conjunction def 'u^:(0 = v)^:_'\\nunique =: -:&# ~. NB. tally of list matches that of set\\n\\nnext_mc =: [: (, {.) (>:@:{. , }.)Until(unique@:((<:/~@i.@# #&, +/~)@:(}. , {.)))\\n\\n\\nprime_q =: 1&p: NB. for fun look at prime generation suitability\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.Arrays;\\n\\npublic class MianChowlaSequence {\\n\\n public static void main(String[] args) {\\n long start = System.currentTimeMillis();\\n System.out.println(\\\"First 30 terms of the Mian–Chowla sequence.\\\");\\n mianChowla(1, 30);\\n System.out.println(\\\"Terms 91 through 100 of the Mian–Chowla sequence.\\\");\\n mianChowla(91, 100);\\n long end = System.currentTimeMillis();\\n System.out.printf(\\\"Elapsed = %d ms%n\\\", (end-start));\\n }\\n\\n private static void mianChowla(int minIndex, int maxIndex) {\\n int [] sums = new int[1];\\n int [] chowla = new int[maxIndex+1];\\n sums[0] = 2;\\n chowla[0] = 0;\\n chowla[1] = 1;\\n if ( minIndex == 1 ) {\\n System.out.printf(\\\"%d \\\", 1);\\n }\\n int chowlaLength = 1;\\n for ( int n = 2 ; n <= maxIndex ; n++ ) {\\n\\n // Sequence is strictly increasing.\\n int test = chowla[n - 1];\\n // Bookkeeping. Generate only new sums.\\n int[] sumsNew = Arrays.copyOf(sums, sums.length + n);\\n int sumNewLength = sums.length;\\n int savedsSumNewLength = sumNewLength;\\n\\n // Generate test candidates for the next value of the sequence.\\n boolean found = false;\\n while ( ! found ) {\\n test++;\\n found = true;\\n sumNewLength = savedsSumNewLength;\\n // Generate test sums\\n for ( int j = 0 ; j <= chowlaLength ; j++ ) {\\n int testSum = (j == 0 ? test : chowla[j]) + test;\\n boolean duplicate = false;\\n\\n // Check if test Sum in array\\n for ( int k = 0 ; k < sumNewLength ; k++ ) {\\n if ( sumsNew[k] == testSum ) {\\n duplicate = true;\\n break;\\n }\\n }\\n if ( ! duplicate ) {\\n // Add to array\\n sumsNew[sumNewLength] = testSum;\\n sumNewLength++;\\n }\\n else {\\n // Duplicate found. Therefore, test candidate of the next value of the sequence is not OK.\\n found = false;\\n break;\\n }\\n }\\n }\\n\\n // Bingo! Now update bookkeeping.\\n chowla[n] = test;\\n chowlaLength++;\\n sums = sumsNew;\\n if ( n >= minIndex ) {\\n System.out.printf(\\\"%d %s\\\", chowla[n], (n==maxIndex ? \\\"\\\\n\\\" : \\\"\\\"));\\n }\\n }\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"(() => {\\n 'use strict';\\n\\n // main :: IO ()\\n const main = () => {\\n const genMianChowla = mianChowlas();\\n console.log([\\n 'Mian-Chowla terms 1-30:',\\n take(30)(\\n genMianChowla\\n ),\\n\\n '\\\\nMian-Chowla terms 91-100:',\\n (\\n drop(60)(genMianChowla),\\n take(10)(\\n genMianChowla\\n )\\n )\\n ].join('\\\\n') + '\\\\n');\\n };\\n\\n // mianChowlas :: Gen [Int]\\n function* mianChowlas() {\\n let\\n mcs = [1],\\n sumSet = new Set([2]),\\n x = 1;\\n while (true) {\\n yield x;\\n [sumSet, mcs, x] = nextMC(sumSet, mcs, x);\\n }\\n }\\n\\n // nextMC :: Set Int -> [Int] -> Int -> (Set Int, [Int], Int)\\n const nextMC = (setSums, mcs, n) => {\\n // Set of sums -> Series up to n -> Next term in series\\n const valid = x => {\\n for (const m of mcs) {\\n if (setSums.has(x + m)) return false;\\n }\\n return true;\\n };\\n const x = until(valid)(x => 1 + x)(n);\\n return [\\n sumList(mcs)(x)\\n .reduce(\\n (a, n) => (a.add(n), a),\\n setSums\\n ),\\n mcs.concat(x),\\n x\\n ];\\n };\\n\\n // sumList :: [Int] -> Int -> [Int]\\n const sumList = xs =>\\n // Series so far -> additional term -> new sums\\n n => [2 * n].concat(xs.map(x => n + x));\\n\\n\\n // ---------------- GENERIC FUNCTIONS ----------------\\n\\n // drop :: Int -> [a] -> [a]\\n // drop :: Int -> Generator [a] -> Generator [a]\\n // drop :: Int -> String -> String\\n const drop = n =>\\n xs => Infinity > length(xs) ? (\\n xs.slice(n)\\n ) : (take(n)(xs), xs);\\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.apply([], Array.from({\\n length: n\\n }, () => {\\n const x = xs.next();\\n return x.done ? [] : [x.value];\\n }));\\n\\n\\n // until :: (a -> Bool) -> (a -> a) -> a -> a\\n const until = p =>\\n f => x => {\\n let v = x;\\n while (!p(v)) v = f(v);\\n return v;\\n };\\n\\n // MAIN ---\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Input: a bag-of-words (bow)\\n# Output: either an augmented bow, or nothing if a duplicate is found\\ndef augment_while_unique(stream):\\n label $out\\n | foreach ((stream|tostring), null) as $word (.;\\n if $word == null then .\\n elif has($word) then break $out\\n else .[$word] = 1\\n end;\\n select($word == null) );\\n\\n# For speedup, store \\\"sums\\\" as a hash\\ndef mian_chowlas:\\n {m:[1], sums: {\\\"1\\\":1}}\\n | recurse(\\n .m as $m\\n | .sums as $sums\\n | first(range(1+$m[-1]; infinite) as $i\\n\\t | $sums\\n\\t | augment_while_unique( ($m[] | (.+$i)), (2*$i))\\n\\t | [$i, .] ) as [$i, $sums]\\n | {m: ($m + [$i]), $sums} )\\n | .m[-1] ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"[limit(100; mian_chowlas)]\\n| \\\"First thirty: \\\\(.[:30]);\\\",\\n \\\"91st through 100th: \\\\(.[90:]).\\\"\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function mianchowla(n)\\n seq = ones(Int, n)\\n sums = Dict{Int,Int}()\\n tempsums = Dict{Int,Int}()\\n for i in 2:n\\n seq[i] = seq[i - 1] + 1\\n incrementing = true\\n while incrementing\\n for j in 1:i\\n tsum = seq[j] + seq[i]\\n if haskey(sums, tsum)\\n seq[i] += 1\\n empty!(tempsums)\\n break\\n else\\n tempsums[tsum] = 0\\n if j == i\\n merge!(sums, tempsums)\\n empty!(tempsums)\\n incrementing = false\\n end\\n end\\n end\\n end\\n end\\n seq\\nend\\n\\nfunction testmianchowla()\\n println(\\\"The first 30 terms of the Mian-Chowla sequence are $(mianchowla(30)).\\\")\\n println(\\\"The 91st through 100th terms of the Mian-Chowla sequence are $(mianchowla(100)[91:100]).\\\")\\nend\\n\\ntestmianchowla()\\n@time testmianchowla()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// Version 1.3.21\\n\\nfun mianChowla(n: Int): List<Int> {\\n val mc = MutableList(n) { 0 }\\n mc[0] = 1\\n val hs = HashSet<Int>(n * (n + 1) / 2)\\n hs.add(2)\\n val hsx = mutableListOf<Int>()\\n for (i in 1 until n) {\\n hsx.clear()\\n var j = mc[i - 1]\\n outer@ while (true) {\\n j++\\n mc[i] = j\\n for (k in 0..i) {\\n val sum = mc[k] + j\\n if (hs.contains(sum)) {\\n hsx.clear()\\n continue@outer\\n }\\n hsx.add(sum)\\n }\\n hs.addAll(hsx)\\n break\\n }\\n }\\n return mc\\n}\\n\\nfun main() {\\n val mc = mianChowla(100)\\n println(\\\"The first 30 terms of the Mian-Chowla sequence are:\\\")\\n println(mc.subList(0, 30))\\n println(\\\"\\\\nTerms 91 to 100 of the Mian-Chowla sequence are:\\\")\\n println(mc.subList(90, 100))\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"fun sumsRemainDistinct(candidate: Int, seq: Iterable<Int>, sums: MutableSet<Int>): Boolean {\\n val candidateSums = mutableListOf<Int>()\\n\\n for (s in seq) {\\n when ((candidate + s) !in sums) {\\n true -> candidateSums.add(candidate + s)\\n false -> return false\\n }\\n }\\n with(sums) {\\n addAll(candidateSums)\\n add(candidate + candidate)\\n }\\n return true\\n}\\n\\nfun mianChowla(n: Int): List<Int> {\\n val bufferSeq = linkedSetOf<Int>()\\n val bufferSums = linkedSetOf<Int>()\\n\\n val sequence = generateSequence(1) { it + 1 } // [1,2,3,..]\\n .filter { sumsRemainDistinct(it, bufferSeq, bufferSums) }\\n .onEach { bufferSeq.add(it) }\\n\\n return sequence.take(n).toList()\\n}\\n\\nfun main() {\\n mianChowla(100).also {\\n println(\\\"Mian-Chowla[1..30] = ${it.take(30)}\\\")\\n println(\\\"Mian-Chowla[91..100] = ${it.drop(90)}\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"n = {m} = {1};\\ntmp = {2};\\nDo[\\n m++;\\n While[ContainsAny[tmp, m + n],\\n m++\\n ];\\n tmp = Join[tmp, n + m];\\n AppendTo[tmp, 2 m];\\n AppendTo[n, m]\\n ,\\n {99}\\n ]\\nRow[Take[n, 30], \\\",\\\"]\\nRow[Take[n, {91, 100}], \\\",\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import intsets, strutils, times\\n\\nproc mianchowla(n: Positive): seq[int] =\\n result = @[1]\\n var sums = [2].toIntSet()\\n var candidate = 1\\n\\n while result.len < n:\\n # Test successive candidates.\\n var fit = false\\n result.add 0 # Make room for next value.\\n while not fit:\\n inc candidate\\n fit = true\\n result[^1] = candidate\\n # Check the sums.\\n for val in result:\\n if val + candidate in sums:\\n # Failed to satisfy criterium.\\n fit = false\\n break\\n # Add the new sums to the set of sums.\\n for val in result:\\n sums.incl val + candidate\\n\\nlet t0 = now()\\nlet seq100 = mianchowla(100)\\necho \\\"The first 30 terms of the Mian-Chowla sequence are:\\\"\\necho seq100[0..29].join(\\\" \\\")\\necho \\\"\\\"\\necho \\\"Terms 91 to 100 of the sequence are:\\\"\\necho seq100[90..99].join(\\\" \\\")\\n\\necho \\\"\\\"\\necho \\\"Computation time: \\\", (now() - t0).inMilliseconds, \\\" ms\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"program MianChowla;\\n//compiling with /usr/lib/fpc/3.2.0/ppcx64.2 -MDelphi -O4 -al \\\"%f\\\"\\n{$CODEALIGN proc=8,loop=4 }\\nuses\\n sysutils;\\nconst\\n deltaK = 100;\\n maxCnt = 1000;\\ntype\\n tElem = Uint32;\\n tpElem = pUint32;\\n t_n = array[0..maxCnt+1] of tElem;\\n t_n_sum_all = array[0..(maxCnt+1)*(maxCnt+2) DIV 2] of tElem;\\n\\nvar\\n n_LastPos,\\n n : t_n;\\n\\n n_sum_all : t_n_sum_all;\\n\\n maxIdx,\\n maxN,\\n max_SumIdx : NativeUInt;\\n\\nprocedure Init;\\nvar\\n i : NativeInt;\\nbegin\\n maxIdx := 1;\\n maxN := 1;\\n n[maxIdx] := maxN;\\n max_SumIdx := 1;\\n n_sum_all[max_SumIdx] := 2*maxN;\\n\\n For i := 0 to maxCnt do\\n n_LastPos[i] := 1;\\nend;\\n\\nprocedure InsertNew_sum(NewValue:NativeUint);\\n//insertion already knowning the positions\\nvar\\n pElem :tpElem;\\n InsIdx,chkIdx,oldIdx,newIdx : nativeInt;\\nBegin\\n newIdx := maxIdx;\\n oldIdx := max_SumIdx;\\n //append new value\\n inc(maxIdx);\\n n[maxIdx] := NewValue;\\n //extend sum_\\n inc(max_SumIdx,maxIdx);\\n //heighest value already known\\n InsIdx := max_SumIdx;\\n n_sum_all[InsIdx] := 2*NewValue;\\n //stop mark\\n n_sum_all[InsIdx+1] := High(tElem);\\n pElem := @n_sum_all[0];\\n dec(InsIdx);\\n //n_LastPos[newIdx]+newIdx-1 == InsIdx\\n repeat\\n //move old bigger values\\n chkIdx := n_LastPos[newIdx]+newIdx-1;\\n while InsIdx > chkIdx do\\n Begin\\n pElem[InsIdx] := pElem[oldIdx];\\n dec(InsIdx);\\n dec(oldIdx);\\n end;\\n //insert new value\\n pElem[InsIdx] := NewValue+n[newIdx];\\n dec(InsIdx);\\n dec(newIdx);\\n //all inserted\\n until newIdx <= 0;\\n //new minimum search position one behind, oldidx is one to small\\n inc(oldidx,2);\\n For newIdx := 1 to maxIdx do\\n n_LastPos[newIdx] := oldIdx;\\nend;\\nprocedure FindNew;\\nvar\\n pSumAll,pn : tpElem;\\n i,LastCheckPos,newValue,newSum : NativeUint;\\n TestRes : boolean;\\nbegin\\n //start value = last inserted value\\n newValue := n[maxIdx];\\n pSumAll := @n_sum_all[0];\\n pn := @n[0];\\n repeat\\n //try next number\\n inc(newValue);\\n LastCheckPos := n_LastPos[1];\\n i := 1;\\n //check if sum = new is already n all_sum\\n repeat\\n newSum := newValue+pn[i];\\n IF LastCheckPos < n_LastPos[i] then\\n LastCheckPos := n_LastPos[i];\\n while pSumAll[LastCheckPos] < newSum do\\n inc(LastCheckPos);\\n //memorize LastCheckPos;\\n n_LastPos[i] := LastCheckPos;\\n TestRes:= pSumAll[LastCheckPos] = newSum;\\n IF TestRes then\\n BREAK;\\n inc(i);\\n until i>maxIdx;\\n //found?\\n If not(TestRes) then\\n BREAK;\\n until false;\\n InsertNew_sum(newValue);\\nend;\\n\\nvar\\n T1,T0: Int64;\\n i,k : NativeInt;\\n\\nprocedure Out_num(k:NativeInt);\\nBegin\\n T1 := GetTickCount64;\\n // k n[k] average dist last deltak total time\\n writeln(k:6,n[k]:12,(n[k]-n[k-deltaK+1]) DIV deltaK:8,T1-T0:8,' ms');\\nend;\\n\\nBEGIN\\n writeln('Allocated memory ',2*SizeOf(t_n)+Sizeof(t_n_sum_all));\\n T0 := GetTickCount64;\\n while t0 = GetTickCount64 do;\\n T0 := GetTickCount64;\\n Init;\\n\\n k := deltaK;\\n i := 1;\\n repeat\\n repeat\\n FindNew;\\n inc(i);\\n until i=k;\\n Out_num(k);\\n k := k+deltaK;\\n until k>maxCnt;\\n writeln;\\n writeln(#13,'The first 30 terms of the Mian-Chowla sequence are');\\n For i := 1 to 30 do\\n write(n[i],' ');\\n writeln;\\n writeln;\\n writeln('The terms 91 - 100 of the Mian-Chowla sequence are');\\n For i := 91 to 100 do\\n write(n[i],' ');\\n writeln;\\nEND.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\n\\nsub generate_mc {\\n my($max) = @_;\\n my $index = 0;\\n my $test = 1;\\n my %sums = (2 => 1);\\n my @mc = 1;\\n while ($test++) {\\n my %these = %sums;\\n map { next if ++$these{$_ + $test} > 1 } @mc[0..$index], $test;\\n %sums = %these;\\n $index++;\\n return @mc if (push @mc, $test) > $max-1;\\n }\\n}\\n\\nmy @mian_chowla = generate_mc(100);\\nsay \\\"First 30 terms in the Mian–Chowla sequence:\\\\n\\\", join(' ', @mian_chowla[ 0..29]),\\n \\\"\\\\nTerms 91 through 100:\\\\n\\\", join(' ', @mian_chowla[90..99]);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">mian_chowla</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;\\\">sequence</span> <span style=\\\"color: #000000;\\\">mc</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: #000000;\\\">is</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004600;\\\">false</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;\\\">len_is</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2</span><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: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">isx</span> <span style=\\\"color: #0000FF;\\\">=</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: #000000;\\\">mc</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>\\n <span style=\\\"color: #000000;\\\">mc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">mc</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">j</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: #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;\\\">mc</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">mc</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">j</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">len_is</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">is</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: #000000;\\\">isx</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: #000000;\\\">isx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">isx</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;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">isx</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;\\\">isx</span><span style=\\\"color: #0000FF;\\\">[$]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">len_is</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">is</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;\\\">s</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">len_is</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">len_is</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">is</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;\\\">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;\\\">isx</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">is</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">isx</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</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;\\\">for</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;\\\">j</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">mc</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;\\\">while</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;\\\">mc</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;\\\">sequence</span> <span style=\\\"color: #000000;\\\">mc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">mian_chowla</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">100</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 30 terms of the Mian-Chowla sequence are:\\\\n %V\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">mc</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">30</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;\\\">\\\"Terms 91 to 100 of the Mian-Chowla sequence are:\\\\n %V\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">mc</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">91</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">100</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;\\\">\\\"completed in %s\\\\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\": \"from itertools import count, islice, chain\\nimport time\\n\\ndef mian_chowla():\\n mc = [1]\\n yield mc[-1]\\n psums = set([2])\\n newsums = set([])\\n for trial in count(2):\\n for n in chain(mc, [trial]):\\n sum = n + trial\\n if sum in psums:\\n newsums.clear()\\n break\\n newsums.add(sum)\\n else:\\n psums |= newsums\\n newsums.clear()\\n mc.append(trial)\\n yield trial\\n\\ndef pretty(p, t, s, f):\\n print(p, t, \\\" \\\".join(str(n) for n in (islice(mian_chowla(), s, f))))\\n\\nif __name__ == '__main__':\\n st = time.time()\\n ts = \\\"of the Mian-Chowla sequence are:\\\\n\\\"\\n pretty(\\\"The first 30 terms\\\", ts, 0, 30)\\n pretty(\\\"\\\\nTerms 91 to 100\\\", ts, 90, 100)\\n print(\\\"\\\\nComputation time was\\\", (time.time()-st) * 1000, \\\"ms\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Mian-Chowla series'''\\n\\nfrom itertools import (islice)\\nfrom time import time\\n\\n\\n# mianChowlas :: Gen [Int]\\ndef mianChowlas():\\n '''Mian-Chowla series - Generator constructor\\n '''\\n mcs = [1]\\n sumSet = set([2])\\n x = 1\\n while True:\\n yield x\\n (sumSet, mcs, x) = nextMC(sumSet, mcs, x)\\n\\n\\n# nextMC :: (Set Int, [Int], Int) -> (Set Int, [Int], Int)\\ndef nextMC(setSums, mcs, n):\\n '''(Set of sums, series so far, current term) ->\\n (updated sum set, updated series, next term)\\n '''\\n def valid(x):\\n for m in mcs:\\n if x + m in setSums:\\n return False\\n return True\\n\\n x = until(valid)(succ)(n)\\n setSums.update(\\n [x + y for y in mcs] + [2 * x]\\n )\\n return (setSums, mcs + [x], x)\\n\\n\\n# TEST ----------------------------------------------------\\n# main :: IO ()\\ndef main():\\n '''Tests'''\\n\\n start = time()\\n genMianChowlas = mianChowlas()\\n print(\\n 'First 30 terms of the Mian-Chowla series:\\\\n',\\n take(30)(genMianChowlas)\\n )\\n drop(60)(genMianChowlas)\\n print(\\n '\\\\n\\\\nTerms 91 to 100 of the Mian-Chowla series:\\\\n',\\n take(10)(genMianChowlas),\\n '\\\\n'\\n )\\n print(\\n '(Computation time c. ' + str(round(\\n 1000 * (time() - start)\\n )) + ' ms)'\\n )\\n\\n\\n# GENERIC -------------------------------------------------\\n\\n# drop :: Int -> [a] -> [a]\\n# drop :: Int -> String -> String\\ndef drop(n):\\n '''The suffix of xs after the\\n first n elements, or [] if n > length xs'''\\n def go(xs):\\n if isinstance(xs, list):\\n return xs[n:]\\n else:\\n take(n)(xs)\\n return xs\\n return lambda xs: go(xs)\\n\\n\\n# succ :: Int -> Int\\ndef succ(x):\\n '''The successor of a numeric value (1 +)'''\\n return 1 + x\\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 return lambda xs: (\\n xs[0:n]\\n if isinstance(xs, list)\\n else list(islice(xs, n))\\n )\\n\\n\\n# until :: (a -> Bool) -> (a -> a) -> a -> a\\ndef until(p):\\n '''The result of applying f until p holds.\\n The initial seed value is x.'''\\n def go(f, x):\\n v = x\\n while not p(v):\\n v = f(v)\\n return v\\n return lambda f: lambda x: go(f, x)\\n\\n\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ stack ] is makeable ( --> s )\\n\\n [ temp put\\n 1 bit makeable put\\n ' [ 1 ] 1\\n [ true temp put\\n 1+\\n over witheach\\n [ over + bit\\n makeable share & if\\n [ false temp replace\\n conclude ] ]\\n temp take if\\n [ dup dip join\\n over witheach\\n [ over + bit\\n makeable take\\n | makeable put ] ]\\n over size temp share = until ]\\n makeable release\\n temp release\\n drop ] is mian-chowla ( n --> [ )\\n\\n100 mian-chowla\\n30 split swap echo cr\\n-10 split nip echo\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"my @mian-chowla = 1, |(2..Inf).map: -> $test {\\n state $index = 1;\\n state %sums = 2 => 1;\\n my $next;\\n my %these;\\n @mian-chowla[^$index].map: { ++$next and last if %sums{$_ + $test}:exists; ++%these{$_ + $test} };\\n next if $next;\\n ++%sums{$test + $test};\\n %sums.push: %these;\\n ++$index;\\n $test\\n};\\n\\nput \\\"First 30 terms in the Mian–Chowla sequence:\\\\n\\\", @mian-chowla[^30];\\nput \\\"\\\\nTerms 91 through 100:\\\\n\\\", @mian-chowla[90..99];\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program computes and displays any range of the Mian─Chowla integer sequence.*/\\nparse arg LO HI . /*obtain optional arguments from the CL*/\\nif LO=='' | LO==\\\",\\\" then LO= 1 /*Not specified? Then use the default.*/\\nif HI=='' | HI==\\\",\\\" then HI= 30 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nr.= 0 /*initialize the rejects stemmed array.*/\\n#= 0 /*count of numbers in sequence (so far)*/\\n$= /*the Mian─Chowla sequence (so far). */\\n do t=1 until #=HI; @.= r.0 /*process numbers until range is filled*/\\n do i=1 for t; if r.i then iterate /*I already rejected? Then ignore it.*/\\n do j=i for t-i+1; if r.j then iterate /*J \\\" \\\" \\\" \\\" \\\" */\\n _= i + j /*calculate the sum of I and J. */\\n if @._ then do; r.t= 1; iterate t; end /*reject T from Mian─Chowla sequence.*/\\n @._= 1 /*mark _ as one of the sequence sums.*/\\n end /*j*/\\n end /*i*/\\n #= # + 1 /*bump the counter of terms in the list*/\\n if #>=LO then if #<=HI then $= $ t /*In the specified range? Add to list.*/\\n end /*t*/\\n /*stick a fork in it, we're all done. */\\nsay 'The Mian─Chowla sequence for terms ' LO \\\"──►\\\" HI ' (inclusive):'\\nsay strip($) /*ignore the leading superfluous blank.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"require 'set'\\nn, ts, mc, sums = 100, [], [1], Set.new\\nsums << 2\\nst = Time.now\\nfor i in (1 .. (n-1))\\n for j in mc[i-1]+1 .. Float::INFINITY\\n mc[i] = j\\n for k in (0 .. i)\\n if (sums.include?(sum = mc[k]+j))\\n ts.clear\\n break\\n end\\n ts << sum\\n end\\n if (ts.length > 0)\\n sums = sums | ts\\n break\\n end\\n end\\nend\\net = (Time.now - st) * 1000\\ns = \\\" of the Mian-Chowla sequence are:\\\\n\\\"\\nputs \\\"The first 30 terms#{s}#{mc.slice(0..29).join(' ')}\\\\n\\\\n\\\"\\nputs \\\"Terms 91 to 100#{s}#{mc.slice(90..99).join(' ')}\\\\n\\\\n\\\"\\nputs \\\"Computation time was #{et.round(1)}ms.\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"mian_chowla = Enumerator.new do |yielder|\\n mc, sums = [1], {}\\n 1.step do |n|\\n mc << n\\n if mc.none?{|k| sums[k+n] } then\\n mc.each{|k| sums[k+n] = true }\\n yielder << n\\n else\\n mc.pop # n didn't work, get rid of it.\\n end\\n end\\nend\\n\\nres = mian_chowla.take(100).to_a\\n\\ns = \\\" of the Mian-Chowla sequence are:\\\\n\\\"\\nputs \\\"The first 30 terms#{s}#{res[0,30].join(' ')}\\\\n\\nTerms 91 to 100#{s}#{res[90,10].join(' ')}\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"var (n, sums, ts, mc) = (100, Set(2), [], [1])\\nvar st = Time.micro\\nfor i in (1 ..^ n) {\\n for j in (mc[i-1]+1 .. Inf) {\\n mc[i] = j\\n for k in (0 .. i) {\\n var sum = mc[k]+j\\n if (sums.has(sum)) {\\n ts.clear\\n break\\n }\\n ts << sum\\n }\\n if (ts.len > 0) {\\n sums |= Set(ts...)\\n break\\n }\\n }\\n}\\nvar et = (Time.micro - st)\\nvar s = \\\" of the Mian-Chowla sequence are:\\\\n\\\"\\nsay \\\"The first 30 terms#{s}#{mc.first(30).join(' ')}\\\\n\\\"\\nsay \\\"Terms 91 to 100#{s}#{mc.slice(90).first(10).join(' ')}\\\\n\\\"\\nsay \\\"Computation time was #{et} seconds.\\\"\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"public func mianChowla(n: Int) -> [Int] {\\n var mc = Array(repeating: 0, count: n)\\n var ls = [2: true]\\n var sum = 0\\n\\n mc[0] = 1\\n\\n for i in 1..<n {\\n var lsx = [Int]()\\n\\n jLoop: for j in (mc[i-1]+1)... {\\n mc[i] = j\\n\\n for k in 0...i {\\n sum = mc[k] + j\\n\\n if ls[sum] ?? false {\\n lsx = []\\n continue jLoop\\n }\\n\\n lsx.append(sum)\\n }\\n\\n for n in lsx {\\n ls[n] = true\\n }\\n\\n break\\n }\\n }\\n\\n return mc\\n}\\n\\nlet seq = mianChowla(n: 100)\\n\\nprint(\\\"First 30 terms in sequence are: \\\\(Array(seq.prefix(30)))\\\")\\nprint(\\\"Terms 91 to 100 are: \\\\(Array(seq[90..<100]))\\\")\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"' Mian-Chowla sequence - VBScript - 15/03/2019\\n Const m = 100, mm=28000\\n ReDim r(mm), v(mm * 2)\\n Dim n, t, i, j, l, s1, s2, iterate_t\\n ReDim seq(m)\\n t0=Timer\\n s1 = \\\"1\\\": s2 = \\\"\\\"\\n seq(1) = 1: n = 1: t = 1\\n Do While n < m\\n t = t + 1\\n iterate_t = False\\n For i = 1 to t * 2\\n v(i) = 0\\n Next\\n i = 1\\n Do While i <= t And Not iterate_t\\n If r(i) = 0 Then\\n j = i\\n Do While j <= t And Not iterate_t\\n If r(j) = 0 Then\\n l = i + j\\n If v(l) = 1 Then\\n r(t) = 1\\n iterate_t = True\\n End If\\n If Not iterate_t Then v(l) = 1\\n End If\\n j = j + 1\\n Loop\\n End If\\n i = i + 1\\n Loop\\n If Not iterate_t Then\\n n = n + 1\\n seq(n) = t\\n if n<= 30 then s1 = s1 & \\\" \\\" & t\\n if n>=91 and n<=100 then s2 = s2 & \\\" \\\" & t\\n End If\\n Loop\\n wscript.echo \\\"t=\\\"& t\\n wscript.echo \\\"The Mian-Chowla sequence for elements 1 to 30:\\\"\\n wscript.echo s1\\n wscript.echo \\\"The Mian-Chowla sequence for elements 91 to 100:\\\"\\n wscript.echo s2\\n wscript.echo \\\"Computation time: \\\"& Int(Timer-t0) &\\\" sec\\\"\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"' Mian-Chowla sequence - VBScript - March 19th, 2019\\n\\n Function Find(x(), val) ' finds val on a pre-sorted list\\n Dim l, u, h : l = 0 : u = ubound(x) : Do : h = (l + u) \\\\ 2\\n If val = x(h) Then Find = h : Exit Function\\n If val > x(h) Then l = h + 1 Else u = h - 1\\n Loop Until l > u : Find = -1\\n End Function\\n\\n ' adds next item from a() to result (r()), adds all remaining items\\n ' from b(), once a() is exhausted\\n Sub Shuffle(ByRef r(), a(), b(), ByRef i, ByRef ai, ByRef bi, al, bl)\\n r(i) = a(ai) : ai = ai + 1 : If ai > al Then Do : i = i + 1 : _\\n r(i) = b(bi) : bi = bi + 1 : Loop until bi = bl\\n End Sub\\n\\n Function Merger(a(), b(), bl) ' merges two pre-sorted lists\\n Dim res(), ai, bi, i : ReDim res(ubound(a) + bl) : ai = 0 : bi = 0\\n For i = 0 To ubound(res)\\n If a(ai) < b(bi) Then Shuffle res, a, b, i, ai, bi, ubound(a), bl _\\n Else Shuffle res, b, a, i, bi, ai, bl, ubound(a)\\n Next : Merger = res\\n End Function\\n\\n Const n = 100 : Dim mc(), sums(), ts(), sp, tc : sp = 1 : tc = 0\\n ReDim mc(n - 1), sums(0), ts(n - 1) : mc(0) = 1 : sums(sp - 1) = 2\\n Dim sum, i, j, k, st : st = Timer\\n wscript.echo \\\"The Mian-Chowla sequence for elements 1 to 30:\\\"\\n wscript.stdout.write(\\\"1 \\\")\\n For i = 1 To n - 1 : j = mc(i - 1) + 1 : Do\\n mc(i) = j : For k = 0 To i\\n sum = mc(k) + j : If Find(sums, sum) >= 0 Then _\\n tc = 0 : Exit For Else ts(tc) = sum : tc = tc + 1\\n Next : If tc > 0 Then\\n nu = Merger(sums, ts, tc) : ReDim sums(ubound(nu))\\n For e = 0 To ubound(nu) : sums(e) = nu(e) : Next\\n tc = 0 : Exit Do\\n End If : j = j + 1 : Loop\\n if i = 90 then wscript.echo vblf & vbLf & _\\n \\\"The Mian-Chowla sequence for elements 91 to 100:\\\"\\n If i < 30 or i >= 90 Then wscript.stdout.write(mc(i) & \\\" \\\")\\n Next\\n wscript.echo vblf & vbLf & \\\"Computation time: \\\"& Timer - st &\\\" seconds.\\\"\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"Module Module1\\nFunction MianChowla(ByVal n As Integer) As Integer()\\n Dim mc(n - 1) As Integer, sums, ts As New HashSet(Of Integer),\\n sum As Integer : mc(0) = 1 : sums.Add(2)\\n For i As Integer = 1 To n - 1\\n For j As Integer = mc(i - 1) + 1 To Integer.MaxValue\\n mc(i) = j\\n For k As Integer = 0 To i\\n sum = mc(k) + j\\n If sums.Contains(sum) Then ts.Clear() : Exit For\\n ts.Add(sum)\\n Next\\n If ts.Count > 0 Then sums.UnionWith(ts) : Exit For\\n Next\\n Next\\n Return mc\\n End Function\\n\\n Sub Main(ByVal args As String())\\n Const n As Integer = 100\\n Dim sw As New Stopwatch(), str As String = \\\" of the Mian-Chowla sequence are:\\\" & vbLf\\n sw.Start() : Dim mc As Integer() = MianChowla(n) : sw.Stop()\\n Console.Write(\\\"The first 30 terms{1}{2}{0}{0}Terms 91 to 100{1}{3}{0}{0}\\\" &\\n \\\"Computation time was {4}ms.{0}\\\", vbLf, str,\\n String.Join(\\\" \\\", mc.Take(30)), String.Join(\\\" \\\", mc.Skip(n - 10)), sw.ElapsedMilliseconds)\\n End Sub\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"var mianChowla = Fn.new { |n|\\n var mc = List.filled(n, 0)\\n var sums = {}\\n var ts = {}\\n mc[0] = 1\\n sums[2] = true\\n for (i in 1...n) {\\n var j = mc[i-1] + 1\\n while (true) {\\n mc[i] = j\\n for (k in 0..i) {\\n var sum = mc[k] + j\\n if (sums[sum]) {\\n ts.clear()\\n break\\n }\\n ts[sum] = true\\n }\\n if (ts.count > 0) {\\n for (key in ts.keys) sums[key] = true\\n break\\n }\\n j = j + 1\\n }\\n }\\n return mc\\n}\\n\\nvar start = System.clock\\nvar mc = mianChowla.call(100)\\nSystem.print(\\\"The first 30 terms of the Mian-Chowla sequence are:\\\\n%(mc[0..29].join(\\\" \\\"))\\\")\\nSystem.print(\\\"\\\\nTerms 91 to 100 of the Mian-Chowla sequence are:\\\\n%(mc[90..99].join(\\\" \\\"))\\\")\\nSystem.print(\\\"\\\\nTook %(((System.clock - start)*1000).round) milliseconds\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"define N = 100;\\ndefine NN = (N * (N+1)) >> 1;\\n\\nfunc Contains(Lst, Item, Size);\\nint Lst, Item, Size, I;\\n[for I:= Size-1 downto 0 do\\n if Item = Lst(I) then return true;\\nreturn false;\\n];\\n\\nint MC(N);\\n\\nproc MianChowla;\\nint Sums(NN), Sum, LE, SS, I, J, K;\\n[MC(0):= 1;\\nSums(0):= 2;\\nSS:= 1;\\nfor I:= 1 to N-1 do\\n [LE:= SS;\\n J:= MC(I-1) + 1;\\n MC(I):= J;\\n K:= 0;\\n loop [Sum:= MC(K) + J;\\n if Contains(Sums, Sum, SS) then\\n [SS:= LE;\\n J:= J+1;\\n MC(I):= J;\\n K:= 0;\\n ]\\n else\\n [Sums(SS):= Sum;\\n SS:= SS+1;\\n K:= K+1;\\n if K > I then quit;\\n ];\\n ];\\n ];\\n];\\n\\nint I;\\n[MianChowla;\\nText(0, \\\"The first 30 terms of the Mian-Chowla sequence are:^m^j\\\");\\nfor I:= 0 to 30-1 do\\n [IntOut(0, MC(I)); ChOut(0, ^ )];\\nText(0, \\\"^m^j^m^jTerms 91 to 100 of the Mian-Chowla sequence are:^m^j\\\");\\nfor I:= 90 to 100-1 do\\n [IntOut(0, MC(I)); ChOut(0, ^ )];\\nCrLf(0);\\n]\\n\",\n \"language\": \"XPL0\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Mian-Chowla-sequence"}}},{"rowIdx":489,"cells":{"solutions":{"kind":"list like","value":[{"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 given number is prime or not.\n\nThe algorithm, as modified by [[wp:Michael O. Rabin|Michael O. Rabin]] to avoid the [[wp:generalized Riemann hypothesis|generalized Riemann hypothesis]], is a probabilistic algorithm.\n\nThe pseudocode, from [[wp:Miller-Rabin primality test#Algorithm_and_running_time|Wikipedia]] is:\n '''Input''': ''n'' > 2, an odd integer to be tested for primality;\n ''k'', a parameter that determines the accuracy of the test\n '''Output''': ''composite'' if ''n'' is composite, otherwise ''probably prime''\n write ''n'' − 1 as 2<sup>''s''</sup>·''d'' with ''d'' odd by factoring powers of 2 from ''n'' − 1\n LOOP: '''repeat''' ''k'' times:\n pick ''a'' randomly in the range [2, ''n'' − 1]\n ''x'' ← ''a''<sup>''d''</sup> mod ''n''\n '''if''' ''x'' = 1 or ''x'' = ''n'' − 1 '''then''' '''do''' '''next''' LOOP\n '''repeat''' ''s'' − 1 times:\n ''x'' ← ''x''<sup>2</sup> mod ''n''\n '''if''' ''x'' = 1 '''then''' '''return''' ''composite''\n '''if''' ''x'' = ''n'' − 1 '''then''' '''do''' '''next''' LOOP\n '''return''' ''composite''\n '''return''' ''probably prime''\n\n* The nature of the test involves big numbers, so the use of \"big numbers\" libraries (or similar features of the language of your choice) are suggested, but '''not''' mandatory.\n* Deterministic variants of the test exist and can be implemented as extra (not mandatory to complete the task)\n<br><br>\n\n","language":"00-TASK"},{"code":"F isProbablePrime(n, k = 10)\n I n < 2 | n % 2 == 0\n R n == 2\n\n V d = n - 1\n V s = 0\n L d % 2 == 0\n d I/= 2\n s++\n\n assert(2 ^ s * d == n - 1)\n\n L 0 .< k\n V a = random:(2 .< n)\n V x = pow(a, d, n)\n I x == 1 | x == n - 1\n L.continue\n L 0 .< s - 1\n x = pow(x, 2, n)\n I x == 1\n R 0B\n I x == n - 1\n L.break\n L.was_no_break\n R 0B\n\n R 1B\n\nprint((2..29).filter(x -> isProbablePrime(x)))\n","language":"11l"},{"code":"/* ARM assembly AARCH64 Raspberry PI 3B */\n/* program testmiller64B.s */\n// optimisation : one routine\n\n/************************************/\n/* Constantes */\n/************************************/\n/* for this file see task include a file in language AArch64 assembly*/\n.include \"../includeConstantesARM64.inc\"\n\n.equ NBLOOP, 5 // loop number change this if necessary\n // if modify, thinck to add test to little prime value\n // in routine\n//.include \"../../ficmacros64.inc\" // use for developper debugging\n/*******************************************/\n/* Initialized data */\n/*******************************************/\n.data\nszMessStartPgm: .asciz \"Program 64 bits start \\n\"\nszMessEndPgm: .asciz \"Program normal end.\\n\"\nszMessPrime: .asciz \" is prime !!!.\\n\"\nszMessNotPrime: .asciz \" is not prime !!!.\\n\"\nszCarriageReturn: .asciz \"\\n\"\n\n/*******************************************/\n/* UnInitialized data */\n/*******************************************/\n.bss\n.align 4\nsZoneConv: .skip 24\n/*******************************************/\n/* code section */\n/*******************************************/\n.text\n.global main\nmain: // program start\n ldr x0,qAdrszMessStartPgm // display start message\n bl affichageMess\n ldr x4,iStart // start number\n ldr x5,iLimit // end number\n tst x4,#1\n cinc x4,x4,eq // start with odd number\n1:\n mov x0,x4\n bl isPrimeMiller // test miller rabin\n cmp x0,#0\n beq 2f\n mov x0,x4\n ldr x1,qAdrsZoneConv\n bl conversion10 // decimal conversion\n ldr x0,qAdrsZoneConv\n bl affichageMess\n ldr x0,qAdrszMessPrime\n bl affichageMess\n b 3f\n2:\n ldr x0,qAdrszMessNotPrime\n // bl affichageMess\n3:\n add x4,x4,#2\n cmp x4,x5\n blo 1b\n\n ldr x0,qAdrszMessEndPgm // display end message\n bl affichageMess\n\n100: // standard end of the program\n mov x0, #0 // return code\n mov x8, #EXIT // request to exit program\n svc 0 // perform system call\nqAdrszMessStartPgm: .quad szMessStartPgm\nqAdrszMessEndPgm: .quad szMessEndPgm\nqAdrszCarriageReturn: .quad szCarriageReturn\nqAdrsZoneConv: .quad sZoneConv\nqAdrszMessPrime: .quad szMessPrime\nqAdrszMessNotPrime: .quad szMessNotPrime\n//iStart: .quad 0x0\n//iLimit: .quad 0x100\niStart: .quad 0xFFFFFFFFFFFFFF00\niLimit: .quad 0xFFFFFFFFFFFFFFF0\n//iStart: .quad 341550071728360\n//iLimit: .quad 341550071728380\n//359341550071728361\n\n/***************************************************/\n/* test miller rabin algorithme wikipedia */\n/* unsigned */\n/***************************************************/\n/* x0 contains number */\n/* x1 contains parameter */\n/* x0 return 1 if prime 0 if composite */\nisPrimeMiller:\n stp x1,lr,[sp,-16]! // TODO: save à completer\n stp x2,x3,[sp,-16]!\n stp x4,x5,[sp,-16]!\n stp x6,x7,[sp,-16]!\n stp x8,x9,[sp,-16]!\n cmp x0,#1 // control 0 or 1\n csel x0,xzr,x0,ls\n bls 100f\n cmp x0,#2 // control = 2\n mov x1,1\n csel x0,x1,x0,eq\n beq 100f\n cmp x0,#3 // control = 3\n csel x0,x1,x0,eq\n beq 100f\n cmp x0,#5 // control = 5\n csel x0,x1,x0,eq\n beq 100f\n cmp x0,#7 // control = 7\n csel x0,x1,x0,eq\n beq 100f\n cmp x0,#11 // control = 11\n csel x0,x1,x0,eq\n beq 100f\n tst x0,#1\n csel x0,xzr,x0,eq // even\n beq 100f\n mov x4,x0 // N\n sub x3,x0,#1 // D\n mov x2,#2\n mov x6,#0 // S\n1: // compute D * 2 power S\n lsr x3,x3,#1 // D= D/2\n add x6,x6,#1 // increment S\n tst x3,#1 // D even ?\n beq 1b\n2:\n mov x8,#0 // loop counter\n sub x5,x0,#3\n mov x7,3\n3:\n mov x0,x7\n mov x1,x3 // exposant = D\n mov x2,x4 // modulo N\n bl moduloPur64\n cmp x0,#1\n beq 5f\n sub x1,x4,#1 // n -1\n cmp x0,x1\n beq 5f\n sub x9,x6,#1 // S - 1\n4:\n mov x2,x0\n\n mul x0,x2,x2 // compute square lower\n umulh x1,x2,x2 // compute square upper\n mov x2,x4 // and compute modulo N\n bl division64R2023\n mov x0,x2\n cmp x0,#1\n csel x0,xzr,x0,eq // composite\n beq 100f\n sub x1,x4,#1 // n -1\n cmp x0,x1\n beq 5f\n subs x9,x9,#1\n bge 4b\n mov x0,#0 // composite\n b 100f\n5:\n add x7,x7,2\n add x8,x8,#1\n cmp x8,NBLOOP\n blt 3b\n mov x0,#1 // prime\n100:\n ldp x8,x9,[sp],16\n ldp x6,x7,[sp],16\n ldp x4,x5,[sp],16\n ldp x2,x3,[sp],16\n ldp x1,lr,[sp],16 // TODO: retaur à completer\n ret\n/********************************************************/\n/* Calcul modulo de b puissance e modulo m */\n/* Exemple 4 puissance 13 modulo 497 = 445 */\n/********************************************************/\n/* x0 nombre */\n/* x1 exposant */\n/* x2 modulo */\nmoduloPur64:\n stp x1,lr,[sp,-16]! // save registres\n stp x3,x4,[sp,-16]! // save registres\n stp x5,x6,[sp,-16]! // save registres\n stp x7,x8,[sp,-16]! // save registres\n stp x9,x10,[sp,-16]! // save registres\n cbz x0,100f\n cbz x1,100f\n mov x8,x0\n mov x7,x1\n mov x10,x2 // modulo\n mov x6,1 // resultat\n udiv x4,x8,x10\n msub x9,x4,x10,x8 // contient le reste\n1:\n tst x7,1\n beq 2f\n mul x4,x9,x6\n umulh x5,x9,x6\n mov x6,x4\n mov x0,x6\n mov x1,x5\n mov x2,x10\n bl division64R2023\n mov x6,x2\n2:\n mul x8,x9,x9\n umulh x5,x9,x9\n mov x0,x8\n mov x1,x5\n mov x2,x10\n bl division64R2023\n mov x9,x2\n lsr x7,x7,1\n cbnz x7,1b\n mov x0,x6 // result\n cmn x0,0 // clear carry not error\n\n100:\n ldp x9,x10,[sp],16 // restaur des 2 registres\n ldp x7,x8,[sp],16 // restaur des 2 registres\n ldp x5,x6,[sp],16 // restaur des 2 registres\n ldp x3,x4,[sp],16 // restaur des 2 registres\n ldp x1,lr,[sp],16 // restaur des 2 registres\n ret // retour adresse lr x30\n/***************************************************/\n/* division number 128 bits in 2 registers by number 64 bits */\n/* unsigned */\n/***************************************************/\n/* x0 contains lower part dividende */\n/* x1 contains upper part dividende */\n/* x2 contains divisor */\n/* x0 return lower part quotient */\n/* x1 return upper part quotient */\n/* x2 return remainder */\ndivision64R2023:\n stp x3,lr,[sp,-16]!\n stp x4,x5,[sp,-16]!\n stp x6,x7,[sp,-16]!\n mov x4,x2 // save divisor\n mov x5,#0 // init upper part divisor\n mov x2,x0 // save dividende\n mov x3,x1\n mov x0,#0 // init result\n mov x1,#0\n mov x6,#0 // init shift counter\n1: // loop shift divisor\n cmp x5,#0 // upper divisor <0\n blt 2f\n cmp x5,x3\n bhi 2f\n blo 11f\n cmp x4,x2\n bhi 2f // new divisor > dividende\n11:\n lsl x5,x5,#1 // shift left one bit upper divisor\n tst x4,#0x8000000000000000\n lsl x4,x4,#1 // shift left one bit lower divisor\n orr x7,x5,#1\n csel x5,x7,x5,ne // move bit 63 lower on upper\n add x6,x6,#1 // increment shift counter\n b 1b\n\n2: // loop 2\n lsl x1,x1,#1 // shift left one bit upper quotient\n tst x0,#0x8000000000000000\n lsl x0,x0,#1 // shift left one bit lower quotient\n orr x7,x1,#1\n csel x1,x7,x1,ne // move bit 63 lower on upper\n cmp x5,x3 // compare divisor and dividende\n bhi 3f\n blo 21f\n cmp x4,x2\n bhi 3f\n21:\n subs x2,x2,x4 // < sub divisor from dividende lower\n sbc x3,x3,x5 // and upper\n orr x0,x0,#1 // move 1 on quotient\n3:\n lsr x4,x4,#1 // shift right one bit upper divisor\n tst x5,1\n lsr x5,x5,#1 // and lower\n orr x7,x4,#0x8000000000000000 // move bit 0 upper to 31 bit lower\n csel x4,x7,x4,ne // move bit 0 upper to 63 bit lower\n subs x6,x6,#1 // decrement shift counter\n bge 2b // if > 0 loop 2\n\n100:\n ldp x6,x7,[sp],16\n ldp x4,x5,[sp],16\n ldp x3,lr,[sp],16\n ret\n\n/***************************************************/\n/* ROUTINES INCLUDE */\n/***************************************************/\n.include \"../includeARM64.inc\"\n","language":"AArch64-Assembly"},{"code":"generic\n type Number is range <>;\npackage Miller_Rabin is\n\n type Result_Type is (Composite, Probably_Prime);\n\n function Is_Prime (N : Number; K : Positive := 10) return Result_Type;\n\nend Miller_Rabin;\n","language":"Ada"},{"code":"with Ada.Numerics.Discrete_Random;\n\npackage body Miller_Rabin is\n\n function Is_Prime (N : Number; K : Positive := 10)\n return Result_Type\n is\n subtype Number_Range is Number range 2 .. N - 1;\n package Random is new Ada.Numerics.Discrete_Random (Number_Range);\n\n function Mod_Exp (Base, Exponent, Modulus : Number) return Number is\n Result : Number := 1;\n begin\n for E in 1 .. Exponent loop\n Result := Result * Base mod Modulus;\n end loop;\n return Result;\n end Mod_Exp;\n\n Generator : Random.Generator;\n D : Number := N - 1;\n S : Natural := 0;\n X : Number;\n begin\n -- exclude 2 and even numbers\n if N = 2 then\n return Probably_Prime;\n elsif N mod 2 = 0 then\n return Composite;\n end if;\n\n -- write N-1 as 2**S * D, with D mod 2 /= 0\n while D mod 2 = 0 loop\n D := D / 2;\n S := S + 1;\n end loop;\n\n -- initialize RNG\n Random.Reset (Generator);\n for Loops in 1 .. K loop\n X := Mod_Exp(Random.Random (Generator), D, N);\n if X /= 1 and X /= N - 1 then\n Inner : for R in 1 .. S - 1 loop\n X := Mod_Exp (X, 2, N);\n if X = 1 then return Composite; end if;\n exit Inner when X = N - 1;\n end loop Inner;\n if X /= N - 1 then return Composite; end if;\n end if;\n end loop;\n\n return Probably_Prime;\n end Is_Prime;\n\nend Miller_Rabin;\n","language":"Ada"},{"code":"with Ada.Text_IO, Miller_Rabin;\n\nprocedure Mr_Tst is\n\n type Number is range 0 .. (2**48)-1;\n\n package Num_IO is new Ada.Text_IO.Integer_IO (Number);\n package Pos_IO is new Ada.Text_IO.Integer_IO (Positive);\n package MR is new Miller_Rabin(Number); use MR;\n\n N : Number;\n K : Positive;\n\nbegin\n for I in Number(2) .. 1000 loop\n if Is_Prime (I) = Probably_Prime then\n Ada.Text_IO.Put (Number'Image (I));\n end if;\n end loop;\n Ada.Text_IO.Put_Line (\".\");\n\n Ada.Text_IO.Put (\"Enter a Number: \"); Num_IO.Get (N);\n Ada.Text_IO.Put (\"Enter the count of loops: \"); Pos_IO.Get (K);\n Ada.Text_IO.Put_Line (\"What is it? \" & Result_Type'Image (Is_Prime(N, K)));\nend MR_Tst;\n","language":"Ada"},{"code":"with Ada.Text_IO, Crypto.Types.Big_Numbers, Ada.Numerics.Discrete_Random;\n\nprocedure Miller_Rabin is\n\n Bound: constant Positive := 256; -- can be any multiple of 32\n\n package LN is new Crypto.Types.Big_Numbers (Bound);\n use type LN.Big_Unsigned; -- all computations \"mod 2**Bound\"\n\n function \"+\"(S: String) return LN.Big_Unsigned\n renames LN.Utils.To_Big_Unsigned;\n\n function Is_Prime (N : LN.Big_Unsigned; K : Positive := 10) return Boolean is\n\n subtype Mod_32 is Crypto.Types.Mod_Type;\n use type Mod_32;\n package R_32 is new Ada.Numerics.Discrete_Random (Mod_32);\n Generator : R_32.Generator;\n\n function Random return LN.Big_Unsigned is\n X: LN.Big_Unsigned := LN.Big_Unsigned_Zero;\n begin\n for I in 1 .. Bound/32 loop\n X := (X * 2**16) * 2**16;\n X := X + R_32.Random(Generator);\n end loop;\n return X;\n end Random;\n\n D: LN.Big_Unsigned := N - LN.Big_Unsigned_One;\n S: Natural := 0;\n A, X: LN.Big_Unsigned;\n begin\n -- exclude 2 and even numbers\n if N = 2 then\n return True;\n elsif N mod 2 = LN.Big_Unsigned_Zero then\n return False;\n else\n\n -- write N-1 as 2**S * D, with odd D\n while D mod 2 = LN.Big_Unsigned_Zero loop\n D := D / 2;\n S := S + 1;\n end loop;\n\n -- initialize RNG\n R_32.Reset (Generator);\n\n -- run the real test\n for Loops in 1 .. K loop\n loop\n A := Random;\n exit when (A > 1) and (A < (N - 1));\n end loop;\n X := LN.Mod_Utils.Pow(A, D, N); -- X := (Random**D) mod N\n if X /= 1 and X /= N - 1 then\n Inner:\n for R in 1 .. S - 1 loop\n X := LN.Mod_Utils.Pow(X, LN.Big_Unsigned_Two, N);\n if X = 1 then\n return False;\n end if;\n exit Inner when X = N - 1;\n end loop Inner;\n if X /= N - 1 then\n return False;\n end if;\n end if;\n end loop;\n end if;\n\n return True;\n end Is_Prime;\n\n S: constant String :=\n \"4547337172376300111955330758342147474062293202868155909489\";\n T: constant String :=\n \"4547337172376300111955330758342147474062293202868155909393\";\n\n K: constant Positive := 10;\n\nbegin\n Ada.Text_IO.Put_Line(\"Prime(\" & S & \")=\" & Boolean'Image(Is_Prime(+S, K)));\n Ada.Text_IO.Put_Line(\"Prime(\" & T & \")=\" & Boolean'Image(Is_Prime(+T, K)));\nend Miller_Rabin;\n","language":"Ada"},{"code":"with Ada.Text_IO, Crypto.Types.Big_Numbers, Ada.Numerics.Discrete_Random;\n\nprocedure Miller_Rabin is\n\n Bound: constant Positive := 256; -- can be any multiple of 32\n\n package LN is new Crypto.Types.Big_Numbers (Bound);\n use type LN.Big_Unsigned; -- all computations \"mod 2**Bound\"\n\n function \"+\"(S: String) return LN.Big_Unsigned\n renames LN.Utils.To_Big_Unsigned;\n\n S: constant String :=\n \"4547337172376300111955330758342147474062293202868155909489\";\n T: constant String :=\n \"4547337172376300111955330758342147474062293202868155909393\";\n\n K: constant Positive := 10;\n\n\nbegin\n Ada.Text_IO.Put_Line(\"Prime(\" & S & \")=\"\n & Boolean'Image (LN.Mod_Utils.Passed_Miller_Rabin_Test(+S, K)));\n Ada.Text_IO.Put_Line(\"Prime(\" & T & \")=\"\n & Boolean'Image (LN.Mod_Utils.Passed_Miller_Rabin_Test(+T, K)));\nend Miller_Rabin;\n","language":"Ada"},{"code":"MODE LINT=LONG INT;\nMODE LOOPINT = INT;\n\nMODE POWMODSTRUCT = LINT;\nPR READ \"prelude/pow_mod.a68\" PR;\n\nPROC miller rabin = (LINT n, LOOPINT k)BOOL: (\n IF n<=3 THEN TRUE\n ELIF NOT ODD n THEN FALSE\n ELSE\n LINT d := n - 1;\n INT s := 0;\n WHILE NOT ODD d DO\n d := d OVER 2;\n s +:= 1\n OD;\n TO k DO\n LINT a := 2 + ENTIER (random*(n-3));\n LINT x := pow mod(a, d, n);\n IF x /= 1 THEN\n TO s DO\n IF x = n-1 THEN done FI;\n x := x*x %* n\n OD;\n else: IF x /= n-1 THEN return false FI;\n done: EMPTY\n FI\n OD;\n TRUE EXIT\n return false: FALSE\n FI\n);\n\nFOR i FROM 937 TO 1000 DO\n IF miller rabin(i, 10) THEN\n print((\" \",whole(i,0)))\n FI\nOD\n","language":"ALGOL-68"},{"code":"/* ARM assembly Raspberry PI */\n/* program testmiller.s */\n\n/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes */\n/************************************/\n.include \"../constantes.inc\"\n\n.equ NBDIVISORS, 2000\n\n//.include \"../../ficmacros32.inc\" @ use for developper debugging\n/*******************************************/\n/* Initialized data */\n/*******************************************/\n.data\nszMessStartPgm: .asciz \"Program 32 bits start \\n\"\nszMessEndPgm: .asciz \"Program normal end.\\n\"\nszMessErrorArea: .asciz \"\\033[31mError : area divisors too small.\\n\"\nszMessPrime: .asciz \" is prime !!!.\\n\"\nszMessNotPrime: .asciz \" is not prime !!!.\\n\"\nszCarriageReturn: .asciz \"\\n\"\n\n.align 4\niGraine: .int 123456\n/*******************************************/\n/* UnInitialized data */\n/*******************************************/\n.bss\n.align 4\nsZoneConv: .skip 24\n/*******************************************/\n/* code section */\n/*******************************************/\n.text\n.global main\nmain: @ program start\n ldr r0,iAdrszMessStartPgm @ display start message\n bl affichageMess\n ldr r4,iStart @ start number\n ldr r5,iLimit @ end number\n tst r4,#1\n addeq r4,#1 @ start with odd number\n1:\n mov r0,r4\n ldr r1,iAdrsZoneConv\n bl conversion10 @ decimal conversion\n ldr r0,iAdrsZoneConv\n bl affichageMess\n mov r0,r4\n bl isPrimeMiller @ test miller rabin\n cmp r0,#0\n beq 2f\n ldr r0,iAdrszMessPrime\n bl affichageMess\n b 3f\n2:\n ldr r0,iAdrszMessNotPrime\n bl affichageMess\n3:\n add r4,r4,#2\n cmp r4,r5\n ble 1b\n\n ldr r0,iAdrszMessEndPgm @ display end message\n bl affichageMess\n\n100: @ standard end of the program\n mov r0, #0 @ return code\n mov r7, #EXIT @ request to exit program\n svc 0 @ perform system call\niAdrszMessStartPgm: .int szMessStartPgm\niAdrszMessEndPgm: .int szMessEndPgm\niAdrszCarriageReturn: .int szCarriageReturn\niAdrsZoneConv: .int sZoneConv\niAdrszMessPrime: .int szMessPrime\niAdrszMessNotPrime: .int szMessNotPrime\niStart: .int 4294967270\niLimit: .int 4294967295\n\n\n/***************************************************/\n/* check if a number is prime test miller rabin */\n/***************************************************/\n/* r0 contains the number */\n/* r0 return 1 if prime 0 else */\n@2147483647\n@4294967297\n@131071\nisPrimeMiller:\n push {r1-r6,lr} @ save registers\n cmp r0,#1 @ control 0 or 1\n movls r0,#0\n bls 100f\n cmp r0,#2 @ control = 2\n moveq r0,#1\n beq 100f\n tst r0,#1\n moveq r0,#0 @ even\n beq 100f\n mov r1,#5 @ loop number\n bl testMiller\n100:\n pop {r1-r6,pc}\n/***************************************************/\n/* test miller rabin algorithme wikipedia */\n/* unsigned */\n/***************************************************/\n/* r0 contains number */\n/* r1 contains parameter */\n/* r0 return 1 if prime 0 if composite */\ntestMiller:\n push {r1-r9,lr} @ save registers\n mov r4,r0 @ N\n mov r7,r1 @ loop maxi\n sub r3,r0,#1 @ D\n mov r2,#2\n mov r6,#0 @ S\n1: @ compute D * 2 power S\n lsr r3,#1 @ D= D/2\n add r6,r6,#1 @ increment S\n tst r3,#1 @ D even ?\n beq 1b\n2:\n mov r8,#0 @ loop counter\n sub r5,r0,#3\n3:\n mov r0,r5\n bl genereraleas\n add r0,r0,#2 @ alea (entre 2 et n-1)\n mov r1,r3 @ exposant = D\n mov r2,r4 @ modulo N\n bl moduloPuR32\n cmp r0,#1\n beq 5f\n sub r1,r4,#1 @ n -1\n cmp r0,r1\n beq 5f\n sub r9,r6,#1 @ S - 1\n4:\n mov r2,r0\n umull r0,r1,r2,r0 @ compute square\n mov r2,r4 @ and compute modulo N\n bl division32R2023\n mov r0,r2\n cmp r0,#1\n moveq r0,#0 @ composite\n beq 100f\n sub r1,r4,#1 @ n -1\n cmp r0,r1\n beq 5f\n subs r9,r9,#1\n bge 4b\n mov r0,#0 @ composite\n b 100f\n5:\n add r8,r8,#1\n cmp r8,r7\n blt 3b\n mov r0,#1 @ prime\n100:\n pop {r1-r9,pc}\n/********************************************************/\n/* Calcul modulo de b puissance e modulo m */\n/* Exemple 4 puissance 13 modulo 497 = 445 */\n/* */\n/********************************************************/\n/* r0 nombre */\n/* r1 exposant */\n/* r2 modulo */\n/* r0 return result */\nmoduloPuR32:\n push {r1-r6,lr} @ save registers\n cmp r0,#0 @ control <> zero\n beq 100f\n cmp r2,#0 @ control <> zero\n beq 100f\n1:\n mov r4,r2 @ save modulo\n mov r5,r1 @ save exposant\n mov r6,r0 @ save base\n mov r3,#1 @ start result\n\n mov r1,#0 @ division r0,r1 by r2\n bl division32R2023\n mov r6,r2 @ base <- remainder\n2:\n tst r5,#1 @ exposant even or odd\n beq 3f\n umull r0,r1,r6,r3 @ multiplication base\n mov r2,r4 @ and compute modulo N\n bl division32R2023\n mov r3,r2 @ result <- remainder\n3:\n umull r0,r1,r6,r6 @ compute base square\n mov r2,r4 @ and compute modulo N\n bl division32R2023\n mov r6,r2 @ base <- remainder\n\n lsr r5,#1 @ left shift 1 bit\n cmp r5,#0 @ end ?\n bne 2b\n mov r0,r3\n100:\n pop {r1-r6,pc}\n\n/***************************************************/\n/* division number 64 bits in 2 registers by number 32 bits */\n/* unsigned */\n/***************************************************/\n/* r0 contains lower part dividende */\n/* r1 contains upper part dividende */\n/* r2 contains divisor */\n/* r0 return lower part quotient */\n/* r1 return upper part quotient */\n/* r2 return remainder */\ndivision32R2023:\n push {r3-r6,lr} @ save registers\n mov r4,r2 @ save divisor\n mov r5,#0 @ init upper part divisor\n mov r2,r0 @ save dividende\n mov r3,r1\n mov r0,#0 @ init result\n mov r1,#0\n mov r6,#0 @ init shift counter\n1: @ loop shift divisor\n cmp r5,#0 @ upper divisor <0\n blt 2f\n cmp r5,r3\n cmpeq r4,r2\n bhs 2f @ new divisor > dividende\n lsl r5,#1 @ shift left one bit upper divisor\n lsls r4,#1 @ shift left one bit lower divisor\n orrcs r5,r5,#1 @ move bit 31 lower on upper\n add r6,r6,#1 @ increment shift counter\n b 1b\n2: @ loop 2\n lsl r1,#1 @ shift left one bit upper quotient\n lsls r0,#1 @ shift left one bit lower quotient\n orrcs r1,#1 @ move bit 31 lower on upper\n cmp r5,r3 @ compare divisor and dividende\n cmpeq r4,r2\n bhi 3f\n subs r2,r2,r4 @ < sub divisor from dividende lower\n sbc r3,r3,r5 @ and upper\n orr r0,r0,#1 @ move 1 on quotient\n3:\n lsr r4,r4,#1 @ shift right one bit upper divisor\n lsrs r5,#1 @ and lower\n orrcs r4,#0x80000000 @ move bit 0 upper to 31 bit lower\n subs r6,#1 @ decrement shift counter\n bge 2b @ if > 0 loop 2\n\n100:\n pop {r3-r6,pc}\n\n\n/***************************************************/\n/* Generation random number */\n/***************************************************/\n/* r0 contains limit */\ngenereraleas:\n push {r1-r4,lr} @ save registers\n ldr r4,iAdriGraine\n ldr r2,[r4]\n ldr r3,iNbDep1\n mul r2,r3,r2\n ldr r3,iNbDep1\n add r2,r2,r3\n str r2,[r4] @ save seed for next call\n cmp r0,#0\n beq 100f\n mov r1,r0 @ divisor\n mov r0,r2 @ dividende\n bl division\n mov r0,r3 @ résult = remainder\n\n100: @ end function\n pop {r1-r4,pc} @ restaur registers\niAdriGraine: .int iGraine\niNbDep1: .int 0x343FD\niNbDep2: .int 0x269EC3\n/***************************************************/\n/* ROUTINES INCLUDE */\n/***************************************************/\n.include \"../affichage.inc\"\n","language":"ARM-Assembly"},{"code":"MsgBox % MillerRabin(999983,10) ; 1\nMsgBox % MillerRabin(999809,10) ; 1\nMsgBox % MillerRabin(999727,10) ; 1\nMsgBox % MillerRabin(52633,10) ; 0\nMsgBox % MillerRabin(60787,10) ; 0\nMsgBox % MillerRabin(999999,10) ; 0\nMsgBox % MillerRabin(999995,10) ; 0\nMsgBox % MillerRabin(999991,10) ; 0\n\nMillerRabin(n,k) { ; 0: composite, 1: probable prime (n < 2**31)\n d := n-1, s := 0\n While !(d&1)\n d>>=1, s++\n\n Loop %k% {\n Random a, 2, n-2 ; if n < 4,759,123,141, it is enough to test a = 2, 7, and 61.\n x := PowMod(a,d,n)\n If (x=1 || x=n-1)\n Continue\n Cont := 0\n Loop % s-1 {\n x := PowMod(x,2,n)\n If (x = 1)\n Return 0\n If (x = n-1) {\n Cont = 1\n Break\n }\n }\n IfEqual Cont,1, Continue\n Return 0\n }\n Return 1\n}\n\nPowMod(x,n,m) { ; x**n mod m\n y := 1, i := n, z := x\n While i>0\n y := i&1 ? mod(y*z,m) : y, z := mod(z*z,m), i >>= 1\n Return y\n}\n","language":"AutoHotkey"},{"code":"seed = 1 /* seed of the random number generator */\nscale = 0\n\n/* Random number from 0 to 32767. */\ndefine rand() {\n /* Cheap formula (from POSIX) for random numbers of low quality. */\n seed = (seed * 1103515245 + 12345) % 4294967296\n return ((seed / 65536) % 32768)\n}\n\n/* Random number in range [from, to]. */\ndefine rangerand(from, to) {\n auto b, h, i, m, n, r\n\n m = to - from + 1\n h = length(m) / 2 + 1 /* want h iterations of rand() % 100 */\n b = 100 ^ h % m /* want n >= b */\n while (1) {\n n = 0 /* pick n in range [b, 100 ^ h) */\n for (i = h; i > 0; i--) {\n r = rand()\n while (r < 68) { r = rand(); } /* loop if the modulo bias */\n n = (n * 100) + (r % 100) /* append 2 digits to n */\n }\n if (n >= b) { break; } /* break unless the modulo bias */\n }\n return (from + (n % m))\n}\n\n\n\n/* n is probably prime? */\ndefine miller_rabin_test(n, k) {\n auto d, r, a, x, s\n\n if (n <= 3) { return (1); }\n if ((n % 2) == 0) { return (0); }\n\n /* find s and d so that d * 2^s = n - 1 */\n d = n - 1\n s = 0\n while((d % 2) == 0) {\n d /= 2\n s += 1\n }\n\n while (k-- > 0) {\n a = rangerand(2, n - 2)\n x = (a ^ d) % n\n if (x != 1) {\n for (r = 0; r < s; r++) {\n if (x == (n - 1)) { break; }\n x = (x * x) % n\n }\n if (x != (n - 1)) {\n return (0)\n }\n }\n }\n return (1)\n}\n\nfor (i = 1; i < 1000; i++) {\n if (miller_rabin_test(i, 10) == 1) {\n i\n }\n}\nquit\n","language":"Bc"},{"code":"_modMul ← { n _𝕣: n|× }\nMillerRabin ← { 𝕊n: 10𝕊n ; iter 𝕊 n: !2|n\n # n = 1 + d×2⋆s\n s ← 0 {𝕨 2⊸|◶⟨+⟜1𝕊2⌊∘÷˜⊢,⊣⟩ 𝕩} n-1\n d ← (n-1) ÷ 2⋆s\n\n # Arithmetic mod n\n Mul ← n _modMul\n Pow ← Mul{𝔽´𝔽˜⍟(/2|⌊∘÷⟜2⍟(↕1+·⌊2⋆⁼⊢)𝕩)𝕨}\n\n # Miller-Rabin test\n MR ← {\n 1 =𝕩 ? 𝕨≠s ;\n (n-1)=𝕩 ? 0 ;\n 𝕨≤1 ? 1 ;\n (𝕨-1) 𝕊 Mul˜𝕩\n }\n C ← { 𝕊a: s MR a Pow d } # Is composite\n {0:1; C •rand.Range⌾(-⟜2) n ? 0; 𝕊𝕩-1} iter\n}\n","language":"BQN"},{"code":"# Compute n|𝕨×𝕩 in high precision\n_modMul ← { n _𝕣:\n # Split each argument into two 26-bit numbers, with the remaining\n # mantissa bit encoded in the sign of the lower-order part.\n q←1+2⋆27\n Split ← { h←(q×𝕩)(⊣--)𝕩 ⋄ ⟨𝕩-h,h⟩ }\n # The product, and an error relative to precise split multiplication.\n Mul ← × (⊣ ⋈ -⊸(+´)) ·⥊×⌜○Split\n ((n×<⟜0)⊸+ -⟜n+⊢)´ n | Mul\n}\n","language":"BQN"},{"code":" MillerRabin 15485867\n1\n MillerRabin¨⊸/ 101+2×↕10\n⟨ 101 103 107 109 113 ⟩\n","language":"BQN"},{"code":"( 1:?seed\n& ( rand\n =\n . mod$(!seed*1103515245+12345.4294967296):?seed\n & mod$(div$(!seed.65536).32768)\n )\n& ( rangerand\n = from to b h i m n r length\n . !arg:(?from,?to)\n & !to+-1*!from+1:?m\n & @(!m:? [?length)\n & div$(!length+1.2)+1:?h\n & 100^mod$(!h.!m):?b\n & whl\n ' ( 0:?n\n & !h+1:?i\n & whl\n ' ( !i+-1:>0:?i\n & rand$:?r\n & whl'(!r:<68&rand$:?r)\n & !n*100+mod$(!r.100):?n\n )\n & !n:>!b\n )\n & !from+mod$(!n.!m)\n )\n& ( miller-rabin-test\n = n k d r a x s return\n . !arg:(?n,?k)\n & ( !n:~>3&1\n | mod$(!n.2):0\n | !n+-1:?d\n & 0:?s\n & whl\n ' ( mod$(!d.2):0\n & !d*1/2:?d\n & 1+!s:?s\n )\n & 1:?return\n & whl\n ' ( !k+-1:?k:~<0\n & rangerand$(2,!n+-2):?a\n & mod$(!a^!d.!n):?x\n & ( !x:1\n | 0:?r\n & whl\n ' ( !r+1:~>!s:?r\n & !n+-1:~!x\n & mod$(!x*!x.!n):?x\n )\n & ( !n+-1:!x\n | 0:?return&~\n )\n )\n )\n & !return\n )\n )\n& 0:?i\n& :?primes\n& whl\n ' ( 1+!i:<1000:?i\n & ( miller-rabin-test$(!i,10):1\n & !primes !i:?primes\n |\n )\n )\n& !primes:? [-11 ?last\n& out$!last\n);\n","language":"Bracmat"},{"code":"#ifndef _MILLER_RABIN_H_\n#define _MILLER_RABIN_H\n#include <gmp.h>\nbool miller_rabin_test(mpz_t n, int j);\n#endif\n","language":"C"},{"code":"#include <stdbool.h>\n#include <gmp.h>\n#include \"primedecompose.h\"\n\n#define MAX_DECOMPOSE 100\n\nbool miller_rabin_test(mpz_t n, int j)\n{\n bool res;\n mpz_t f[MAX_DECOMPOSE];\n mpz_t s, d, a, x, r;\n mpz_t n_1, n_3;\n gmp_randstate_t rs;\n int l=0, k;\n\n res = false;\n gmp_randinit_default(rs);\n\n mpz_init(s); mpz_init(d);\n mpz_init(a); mpz_init(x); mpz_init(r);\n mpz_init(n_1); mpz_init(n_3);\n\n if ( mpz_cmp_si(n, 3) <= 0 ) { // let us consider 1, 2, 3 as prime\n gmp_randclear(rs);\n return true;\n }\n if ( mpz_odd_p(n) != 0 ) {\n mpz_sub_ui(n_1, n, 1); // n-1\n mpz_sub_ui(n_3, n, 3); // n-3\n l = decompose(n_1, f);\n mpz_set_ui(s, 0);\n mpz_set_ui(d, 1);\n for(k=0; k < l; k++) {\n if ( mpz_cmp_ui(f[k], 2) == 0 )\n\tmpz_add_ui(s, s, 1);\n else\n\tmpz_mul(d, d, f[k]);\n } // 2^s * d = n-1\n while(j-- > 0) {\n mpz_urandomm(a, rs, n_3); // random from 0 to n-4\n mpz_add_ui(a, a, 2); // random from 2 to n-2\n mpz_powm(x, a, d, n);\n if ( mpz_cmp_ui(x, 1) == 0 ) continue;\n mpz_set_ui(r, 0);\n while( mpz_cmp(r, s) < 0 ) {\n\tif ( mpz_cmp(x, n_1) == 0 ) break;\n\tmpz_powm_ui(x, x, 2, n);\n\tmpz_add_ui(r, r, 1);\n }\n if ( mpz_cmp(x, n_1) == 0 ) continue;\n goto flush; // woops\n }\n res = true;\n }\n\nflush:\n for(k=0; k < l; k++) mpz_clear(f[k]);\n mpz_clear(s); mpz_clear(d);\n mpz_clear(a); mpz_clear(x); mpz_clear(r);\n mpz_clear(n_1); mpz_clear(n_3);\n gmp_randclear(rs);\n return res;\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <stdbool.h>\n#include <gmp.h>\n#include \"miller-rabin.h\"\n\n#define PREC 10\n#define TOP 4000\n\nint main()\n{\n mpz_t num;\n\n mpz_init(num);\n mpz_set_ui(num, 1);\n\n while ( mpz_cmp_ui(num, TOP) < 0 ) {\n if ( miller_rabin_test(num, PREC) ) {\n gmp_printf(\"%Zd maybe prime\\n\", num);\n } /*else {\n gmp_printf(\"%Zd not prime\\n\", num);\n }*/ // remove the comment iff you're interested in\n // sure non-prime.\n mpz_add_ui(num, num, 1);\n }\n\n mpz_clear(num);\n return EXIT_SUCCESS;\n}\n","language":"C"},{"code":"// calcul a^n%mod\nsize_t power(size_t a, size_t n, size_t mod)\n{\n size_t power = a;\n size_t result = 1;\n\n while (n)\n {\n if (n & 1)\n result = (result * power) % mod;\n power = (power * power) % mod;\n n >>= 1;\n }\n return result;\n}\n\n// n−1 = 2^s * d with d odd by factoring powers of 2 from n−1\nbool witness(size_t n, size_t s, size_t d, size_t a)\n{\n size_t x = power(a, d, n);\n size_t y;\n\n while (s) {\n y = (x * x) % n;\n if (y == 1 && x != 1 && x != n-1)\n return false;\n x = y;\n --s;\n }\n if (y != 1)\n return false;\n return true;\n}\n\n/*\n * if n < 1,373,653, it is enough to test a = 2 and 3;\n * if n < 9,080,191, it is enough to test a = 31 and 73;\n * if n < 4,759,123,141, it is enough to test a = 2, 7, and 61;\n * if n < 1,122,004,669,633, it is enough to test a = 2, 13, 23, and 1662803;\n * if n < 2,152,302,898,747, it is enough to test a = 2, 3, 5, 7, and 11;\n * if n < 3,474,749,660,383, it is enough to test a = 2, 3, 5, 7, 11, and 13;\n * if n < 341,550,071,728,321, it is enough to test a = 2, 3, 5, 7, 11, 13, and 17.\n */\n\nbool is_prime_mr(size_t n)\n{\n if (((!(n & 1)) && n != 2 ) || (n < 2) || (n % 3 == 0 && n != 3))\n return false;\n if (n <= 3)\n return true;\n\n size_t d = n / 2;\n size_t s = 1;\n while (!(d & 1)) {\n d /= 2;\n ++s;\n }\n\n if (n < 1373653)\n return witness(n, s, d, 2) && witness(n, s, d, 3);\n if (n < 9080191)\n return witness(n, s, d, 31) && witness(n, s, d, 73);\n if (n < 4759123141)\n return witness(n, s, d, 2) && witness(n, s, d, 7) && witness(n, s, d, 61);\n if (n < 1122004669633)\n return witness(n, s, d, 2) && witness(n, s, d, 13) && witness(n, s, d, 23) && witness(n, s, d, 1662803);\n if (n < 2152302898747)\n return witness(n, s, d, 2) && witness(n, s, d, 3) && witness(n, s, d, 5) && witness(n, s, d, 7) && witness(n, s, d, 11);\n if (n < 3474749660383)\n return witness(n, s, d, 2) && witness(n, s, d, 3) && witness(n, s, d, 5) && witness(n, s, d, 7) && witness(n, s, d, 11) && witness(n, s, d, 13);\n return witness(n, s, d, 2) && witness(n, s, d, 3) && witness(n, s, d, 5) && witness(n, s, d, 7) && witness(n, s, d, 11) && witness(n, s, d, 13) && witness(n, s, d, 17);\n}\n","language":"C"},{"code":"typedef unsigned long long int ulong;\n\nulong mul_mod(ulong a, ulong b, const ulong mod) {\n\tulong res = 0, c; // return (a * b) % mod, avoiding overflow errors while doing modular multiplication.\n\tfor (b %= mod; a; a & 1 ? b >= mod - res ? res -= mod : 0, res += b : 0, a >>= 1, (c = b) >= mod - b ? c -= mod : 0, b += c);\n\treturn res % mod;\n}\n\nulong pow_mod(ulong n, ulong exp, const ulong mod) {\n\tulong res = 1; // return (n ^ exp) % mod\n\tfor (n %= mod; exp; exp & 1 ? res = mul_mod(res, n, mod) : 0, n = mul_mod(n, n, mod), exp >>= 1);\n\treturn res;\n}\n\nint is_prime(ulong N) {\n\t// Perform a Miller-Rabin test, it should be a deterministic version.\n\tconst ulong n_primes = 9, primes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23};\n\tfor (ulong i = 0; i < n_primes; ++i)\n\t\tif (N % primes[i] == 0) return N == primes[i];\n\tif (N < primes[n_primes - 1]) return 0;\n\tint res = 1, s = 0;\n\tulong t;\n\tfor (t = N - 1; ~t & 1; t >>= 1, ++s);\n\tfor (ulong i = 0; i < n_primes && res; ++i) {\n\t\tulong B = pow_mod(primes[i], t, N);\n\t\tif (B != 1) {\n\t\t\tfor (int b = s; b-- && (res = B + 1 != N);)\n\t\t\t\tB = mul_mod(B, B, N);\n\t\t\tres = !res;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main(void){\n\treturn is_prime(8193145868754512737);\n}\n","language":"C"},{"code":"#include <algorithm>\n#include <cmath>\n#include <cstdint>\n#include <iostream>\n#include <vector>\n\nstd::vector<uint32_t> small_primes{ 2, 3 };\n\nuint64_t add_modulus(const uint64_t& a, const uint64_t& b, const uint64_t& modulus) {\n uint64_t am = ( a < modulus ) ? a : a % modulus;\n if ( b == 0 ) {\n \treturn am;\n }\n uint64_t bm = ( b < modulus ) ? b : b % modulus;\n uint64_t b_from_m = modulus - bm;\n if ( am >= b_from_m ) {\n \treturn am - b_from_m;\n }\n return am + bm;\n}\n\nuint64_t multiply_modulus(const uint64_t& a, const uint64_t& b, const uint64_t& modulus) {\n\tuint64_t am = ( a < modulus ) ? a : a % modulus;\n\tuint64_t bm = ( b < modulus ) ? b : b % modulus;\n if ( bm > am ) {\n \tstd::swap(am, bm);\n }\n uint64_t result;\n while ( bm > 0 ) {\n \tif ( ( bm & 1) == 1 ) {\n \t\tresult = add_modulus(result, am, modulus);\n \t}\n \tam = ( am << 1 ) - ( am >= ( modulus - am ) ? modulus : 0 );\n\t\tbm >>= 1;\n }\n return result;\n}\n\nuint64_t exponentiation_modulus(const uint64_t& base, const uint64_t& exponent, const uint64_t& modulus) {\n\tuint64_t b = base;\n\tuint64_t e = exponent;\n\tuint64_t result = 1;\n\twhile ( e > 0 ) {\n\t\tif ( ( e & 1 ) == 1 ) {\n\t\t\tresult = multiply_modulus(result, b, modulus);\n\t\t}\n \te >>= 1;\n\t\tb = multiply_modulus(b, b, modulus);\n\t}\n\treturn result;\n}\n\nbool is_composite(const uint32_t& a, const uint64_t& d, const uint64_t& n, const uint32_t& s) {\n if ( exponentiation_modulus(a, d, n) == 1 ) {\n return false;\n }\n for ( uint64_t i = 0; i < s; ++i ) {\n if ( exponentiation_modulus(a, pow(2, i) * d, n) == n - 1 ) {\n return false;\n }\n }\n return true;\n}\n\nbool composite_test(const std::vector<uint32_t>& primes, const uint64_t& d, const uint64_t& n, const uint32_t& s) {\n\tfor ( const uint32_t& prime : primes ) {\n\t\tif ( is_composite(prime, d, n, s) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool is_prime(const uint64_t& n) {\n\tif ( n == 0 || n == 1 ) {\n\t\treturn false;\n\t}\n if ( std::find(small_primes.begin(), small_primes.end(), n) != small_primes.end() ) {\n return true;\n }\n if ( std::any_of(small_primes.begin(), small_primes.end(), [n](uint32_t p) { return n % p == 0; }) ) {\n return false;\n }\n\n uint64_t d = n - 1;\n uint32_t s = 0;\n while ( ! d % 2 ) {\n d >>= 1;\n s++;\n }\n\n if ( n < 1'373'653 ) {\n \treturn composite_test({ 2, 3 }, d, n, s);\n }\n if ( n < 25'326'001 ) {\n return composite_test({ 2, 3, 5 }, d, n, s);\n }\n if ( n < 118'670'087'467 ) {\n if ( n == 3'215'031'751 ) {\n return false;\n }\n return composite_test({ 2, 3, 5, 7 }, d, n, s);\n }\n if ( n < 2'152'302'898'747 ) {\n return composite_test({ 2, 3, 5, 7, 11 }, d, n, s);\n }\n if ( n < 3'474'749'660'383 ) {\n return composite_test({ 2, 3, 5, 7, 11, 13 }, d, n, s);\n }\n if ( n < 341'550'071'728'321 ) {\n return composite_test({ 2, 3, 5, 7, 11, 13, 17 }, d, n, s);\n }\n\n const std::vector<uint32_t> test_primes(small_primes.begin(), small_primes.begin() + 16);\n return composite_test(test_primes, d, n, s);\n}\n\nvoid create_small_primes() {\n\tfor ( uint32_t i = 5; i < 1'000; i += 2 ) {\n\t\tif ( is_prime(i) ) {\n\t\t\tsmall_primes.emplace_back(i);\n\t\t}\n\t}\n}\n\nint main() {\n\tcreate_small_primes();\n\n\tfor ( const uint64_t number : { 1'234'567'890'123'456'733, 1'234'567'890'123'456'737 } ) {\n\t\tstd::cout << \"is_prime(\" << number << \") = \" << std::boolalpha << is_prime(number) << std::endl;\n\t}\n}\n","language":"C++"},{"code":"public static class RabinMiller\n{\n public static bool IsPrime(int n, int k)\n {\n if ((n < 2) || (n % 2 == 0)) return (n == 2);\n\n int s = n - 1;\n while (s % 2 == 0) s >>= 1;\n\n Random r = new Random();\n for (int i = 0; i < k; i++)\n {\n int a = r.Next(n - 1) + 1;\n int temp = s;\n long mod = 1;\n for (int j = 0; j < temp; ++j) mod = (mod * a) % n;\n while (temp != n - 1 && mod != 1 && mod != n - 1)\n {\n mod = (mod * mod) % n;\n temp *= 2;\n }\n\n if (mod != n - 1 && temp % 2 == 0) return false;\n }\n return true;\n }\n}\n","language":"C-sharp"},{"code":"// Miller-Rabin primality test as an extension method on the BigInteger type.\n// Based on the Ruby implementation on this page.\npublic static class BigIntegerExtensions\n{\n public static bool IsProbablePrime(this BigInteger source, int certainty)\n {\n if(source == 2 || source == 3)\n return true;\n if(source < 2 || source % 2 == 0)\n return false;\n\n BigInteger d = source - 1;\n int s = 0;\n\n while(d % 2 == 0)\n {\n d /= 2;\n s += 1;\n }\n\n // There is no built-in method for generating random BigInteger values.\n // Instead, random BigIntegers are constructed from randomly generated\n // byte arrays of the same length as the source.\n RandomNumberGenerator rng = RandomNumberGenerator.Create();\n byte[] bytes = new byte[source.ToByteArray().LongLength];\n BigInteger a;\n\n for(int i = 0; i < certainty; i++)\n {\n do\n {\n // This may raise an exception in Mono 2.10.8 and earlier.\n // http://bugzilla.xamarin.com/show_bug.cgi?id=2761\n rng.GetBytes(bytes);\n a = new BigInteger(bytes);\n }\n while(a < 2 || a >= source - 2);\n\n BigInteger x = BigInteger.ModPow(a, d, source);\n if(x == 1 || x == source - 1)\n continue;\n\n for(int r = 1; r < s; r++)\n {\n x = BigInteger.ModPow(x, 2, source);\n if(x == 1)\n return false;\n if(x == source - 1)\n break;\n }\n\n if(x != source - 1)\n return false;\n }\n\n return true;\n }\n}\n","language":"C-sharp"},{"code":"(ns test-p.core\n (:require [clojure.math.numeric-tower :as math])\n (:require [clojure.set :as set]))\n\n(def WITNESSLOOP \"witness\")\n(def COMPOSITE \"composite\")\n\n(defn m* [p q m]\n \" Computes (p*q) mod m \"\n (mod (*' p q) m))\n\n(defn power\n \"modular exponentiation (i.e. b^e mod m\"\n [b e m]\n (loop [b b, e e, x 1]\n (if (zero? e)\n x\n (if (even? e) (recur (m* b b m) (quot e 2) x)\n (recur (m* b b m) (quot e 2) (m* b x m))))))\n\n; Sequence of random numbers to use in the test\n(defn rand-num [n]\n \" random number between 2 and n-2 \"\n (bigint (math/floor (+' 2 (*' (- n 4) (rand))))))\n\n; Unique set of random numbers\n(defn unique-random-numbers [n k]\n \" k unique random numbers between 2 and n-2 \"\n (loop [a-set #{}]\n (cond\n (>= (count a-set) k) a-set\n :else (recur (conj a-set (rand-num n))))))\n\n(defn find-d-s [n]\n \" write n − 1 as 2s·d with d odd \"\n (loop [d (dec n), s 0]\n (if (odd? d)\n [d s]\n (recur (quot d 2) (inc s)))))\n\n(defn random-test\n ([n] (random-test n (min 1000 (bigint (/ n 2)))))\n ([n k]\n \" Random version of primality test\"\n (let [[d s] (find-d-s n)\n ; Individual Primality Test\n single-test (fn [a s]\n (let [z (power a d n)]\n (if (some #{z} [1 (dec n)])\n WITNESSLOOP\n (loop [x (power z 2 n), r s]\n (cond\n (= x 1) COMPOSITE\n (= x (dec n)) WITNESSLOOP\n (= r 0) COMPOSITE\n :else (recur (power x 2 n) (dec r)))))))]\n ; Apply Test\n ;(not-any? #(= COMPOSITE (local-test % s))\n ; (unique-random-numbers n k))))\n (not-any? #(= COMPOSITE (single-test % s)) (unique-random-numbers n k)))))\n\n;; Testing\n(println \"Primes beteen 900-1000:\")\n(doseq [q (range 900 1000)\n :when (random-test q)]\n (print \" \" q))\n(println)\n(println \"Is Prime?\" 4547337172376300111955330758342147474062293202868155909489 (random-test 4547337172376300111955330758342147474062293202868155909489))\n(println \"Is Prime?\" 4547337172376300111955330758342147474062293202868155909393 (random-test 4547337172376300111955330758342147474062293202868155909393))\n(println \"Is Prime?\" 643808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153\n (random-test 643808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153))\n\n(println \"Is Prime?\" 743808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153\n (random-test 743808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153))\n","language":"Clojure"},{"code":"(ns test-p.core\n (:require [clojure.math.numeric-tower :as math]))\n\n(def WITNESSLOOP \"witness\")\n(def COMPOSITE \"composite\")\n\n(defn m* [p q m]\n \" Computes (p*q) mod m \"\n (mod (*' p q) m))\n\n(defn power\n \"modular exponentiation (i.e. b^e mod m\"\n [b e m]\n (loop [b b, e e, x 1]\n (if (zero? e)\n x\n (if (even? e) (recur (m* b b m) (quot e 2) x)\n (recur (m* b b m) (quot e 2) (m* b x m))))))\n\n(defn find-d-s [n]\n\" write n − 1 as 2s·d with d odd \"\n(loop [d (dec n), s 0]\n (if (odd? d)\n [d s]\n (recur (quot d 2) (inc s)))))\n\n;; Deterministic Test\n(defn individual-deterministic-test [a d n s]\n \" Deterministic Primality Test \"\n (let [z (power a d n)]\n (if (= z 1)\n WITNESSLOOP\n (loop [x z, r s]\n (cond\n (= x (dec n)) WITNESSLOOP\n (zero? r) COMPOSITE\n :else (recur (power x 2 n) (dec r)))))))\n\n(defn deterministic-test [n]\n \" Sequence of Primality Tests \"\n (cond\n (some #{n} [0 1 4]) false\n (some #{n} [2 3]) true\n (even? n) false\n :else (let [[d s] (find-d-s n)]\n (cond\n (< n 2047) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 ])\n (< n 1373653) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3])\n (< n 9090191) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [31 73])\n (< n 25326001) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5])\n (< n 3215031751) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7])\n (< n 1122004669633) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 13 23 1662803])\n (< n 2152302898747) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11])\n (< n 2152302898747) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11])\n (< n 3474749660383) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11 13])\n (< n 341550071728321) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11 13 17])\n (< n 3825123056546,413,051) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11 13 17 19 23])\n (< n (math/expt 2 64) ) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11 13 17 19 23 29 31 37])\n (< n 318665857834031151167461) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11 13 17 19 23 29 31 37])\n (< n 3317044064679887385961981) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11 13 17 19 23 29 31 37 41])\n :else (let [k (min (dec n) (int (math/expt (Math/log n) 2)))]\n (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) (range 2 (inc k))))))))\n\n\n;; Testing\n(println \"Primes beteen 900-1000:\")\n(doseq [q (range 900 1000)\n :when (deterministic-test q)]\n (print \" \" q))\n(println)\n(println \"Is Prime?\" 4547337172376300111955330758342147474062293202868155909489 (deterministic-test 4547337172376300111955330758342147474062293202868155909489))\n(println \"Is Prime?\" 4547337172376300111955330758342147474062293202868155909393 (deterministic-test 4547337172376300111955330758342147474062293202868155909393))\nprintln \"Is Prime?\" 643808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153\n (deterministic-test 643808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153))\n\n(println \"Is Prime?\" 743808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153\n (deterministic-test 743808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153))\n(println \"Is Prime?\" 643808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153\n (deterministic-test 643808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153))\n\n(println \"Is Prime?\" 743808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153\n (deterministic-test 743808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153))\n","language":"Clojure"},{"code":"100 PRINT CHR$(147); CHR$(18); \"**** MILLER-RABIN PRIMALITY TEST ****\": PRINT\n110 INPUT \"NUMBER TO TEST\"; N$\n120 N = VAL(N$): IF N < 2 THEN 110\n130 IF 0 = (N AND 1) THEN PRINT \"(EVEN)\": GOTO 380\n140 INPUT \"ITERATIONS\"; K$\n150 K = VAL(K$): IF K < 1 THEN 140\n160 PRINT\n170 DEF FNMD(M) = M - N * INT(M / N)\n180 D = N - 1\n190 S = 0\n200 D = D / 2: S = S + 1\n210 IF 0 = (D AND 1) THEN 200\n220 P = 1\n230 FOR I = 1 TO K\n240 : A = INT(RND(.) * (N - 2)) + 2\n250 : X = 1\n260 : FOR J = 1 TO D\n270 : X = FNMD(X * A)\n280 : NEXT J\n290 : IF (X = 1) OR (X = (N - 1)) THEN 360\n300 : FOR J = 1 TO S - 1\n310 : X = FNMD(X * X)\n320 : IF X = 1 THEN P = 0: GOTO 370\n330 : IF X = N - 1 THEN 360\n340 : NEXT J\n350 : P = 0: GOTO 370\n360 NEXT I\n370 P = P * (1 - 1 / (4 * K))\n380 IF P THEN PRINT \"PROBABLY PRIME ( P >=\"; P; \")\": END\n390 PRINT \"COMPOSITE.\"\n","language":"Commodore-BASIC"},{"code":"(defun factor-out (number divisor)\n \"Return two values R and E such that NUMBER = DIVISOR^E * R,\n and R is not divisible by DIVISOR.\"\n (do ((e 0 (1+ e))\n (r number (/ r divisor)))\n ((/= (mod r divisor) 0) (values r e))))\n\n(defun mult-mod (x y modulus) (mod (* x y) modulus))\n\n(defun expt-mod (base exponent modulus)\n \"Fast modular exponentiation by repeated squaring.\"\n (labels ((expt-mod-iter (b e p)\n (cond ((= e 0) p)\n ((evenp e)\n (expt-mod-iter (mult-mod b b modulus)\n (/ e 2)\n p))\n (t\n (expt-mod-iter b\n (1- e)\n (mult-mod b p modulus))))))\n (expt-mod-iter base exponent 1)))\n\n(defun random-in-range (lower upper)\n \"Return a random integer from the range [lower..upper].\"\n (+ lower (random (+ (- upper lower) 1))))\n\n(defun miller-rabin-test (n k)\n \"Test N for primality by performing the Miller-Rabin test K times.\n Return NIL if N is composite, and T if N is probably prime.\"\n (cond ((= n 1) nil)\n ((< n 4) t)\n ((evenp n) nil)\n (t\n (multiple-value-bind (d s) (factor-out (- n 1) 2)\n (labels ((strong-liar? (a)\n (let ((x (expt-mod a d n)))\n (or (= x 1)\n (loop repeat s\n for y = x then (mult-mod y y n)\n thereis (= y (- n 1)))))))\n (loop repeat k\n always (strong-liar? (random-in-range 2 (- n 2)))))))))\n","language":"Common-Lisp"},{"code":"require \"big\"\n\nmodule Primes\n module MillerRabin\n\n def prime?(k = 15) # increase k for more confidence\n neg_one_mod = d = self - 1\n s = 0\n while d.even?; d >>= 1; s += 1 end # d is odd after s shifts\n k.times do\n b = 2 + rand(self - 4) # random witness base b\n y = powmod(b, d, self) # y = (b**d) mod self\n next if y == 1 || y == neg_one_mod\n (s - 1).times do\n y = (y * y) % self # y = (y**2) mod self\n return false if y == 1\n break if y == neg_one_mod\n end\n return false if y != neg_one_mod\n end\n true # prime (with high probability)\n end\n\n # Compute b**e mod m\n private def powmod(b, e, m)\n r, b = 1, b.to_big_i\n while e > 0\n r = (b * r) % m if e.odd?\n b = (b * b) % m\n e >>= 1\n end\n r\n end\n end\nend\n\nstruct Int; include Primes::MillerRabin end\n\nputs 341521.prime?(20) # => true\nputs 341531.prime? # => false\n","language":"Crystal"},{"code":"# For crystal >= 0.31.x, compile without overflow check, as either\n# crystal build miller-rabin.cr -Ddisable_overflow --release\n# crystal build -Ddisable_overflow miller-rabin.cr --release\n\nrequire \"big\"\n\nmodule Primes\n module MillerRabin\n\n # Returns true if +self+ is a prime number, else returns false.\n def primemr?(k = 10)\n primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47}\n return primes.includes? self if self <= primes.last\n modp47 = 614_889_782_588_491_410.to_big_i # => primes.product, largest < 2^64\n return false if modp47.gcd(self.to_big_i) != 1 # eliminates 86.2% of all integers\n # Choose input witness bases: wits = [range, [wit_bases]] or nil\n wits = WITNESS_RANGES.find { |range, wits| range > self }\n witnesses = wits && wits[1] || k.times.map{ 2 + rand(self - 4) }\n miller_rabin_test(witnesses)\n end\n\n # Returns true if +self+ passes Miller-Rabin Test on witnesses +b+\n private def miller_rabin_test(witnesses) # list of witnesses for testing\n neg_one_mod = n = d = self - 1 # these are even as self is always odd\n d >>= d.trailing_zeros_count # shift out factors of 2 to make d odd\n witnesses.each do |b| # do M-R test with each witness base\n next if (b % self) == 0 # **skip base if a multiple of input**\n y = powmod(b, d, self) # y = (b**d) mod self\n s = d\n until y == 1 || y == neg_one_mod || s == n\n y = (y * y) % self # y = (y**2) mod self\n s <<= 1\n end\n return false unless y == neg_one_mod || s.odd?\n end\n true\n end\n\n # Best known deterministic witnesses for given range and set of bases\n # https://miller-rabin.appspot.com/\n # https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test\n private WITNESS_RANGES = {\n 341_531 => {9345883071009581737},\n 1_050_535_501 => {336781006125, 9639812373923155},\n 350_269_456_337 => {4230279247111683200, 14694767155120705706, 16641139526367750375},\n 55_245_642_489_451 => {2, 141889084524735, 1199124725622454117, 11096072698276303650},\n 7_999_252_175_582_851 => {2, 4130806001517, 149795463772692060, 186635894390467037,\n 3967304179347715805},\n 585_226_005_592_931_977 => {2, 123635709730000, 9233062284813009, 43835965440333360,\n 761179012939631437, 1263739024124850375},\n 18_446_744_073_709_551_615 => {2, 325, 9375, 28178, 450775, 9780504, 1795265022},\n \"318665857834031151167461\".to_big_i => {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37},\n \"3317044064679887385961981\".to_big_i => {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41}\n }\n\n # Compute b**e mod m\n private def powmod(b, e, m)\n r, b = 1, b.to_big_i\n while e > 0\n r = (b * r) % m if e.odd?\n b = (b * b) % m\n e >>= 1\n end\n r\n end\n end\nend\n\nstruct Int; include Primes::MillerRabin end\n\ndef tm; t = Time.monotonic; yield; (Time.monotonic - t).total_seconds.round(6) end\n\n# 10 digit prime\nn = 2147483647\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 18 digit non-prime\nn = 844674407370955389\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 19 digit prime\nn = 9241386435364257883.to_big_i\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 20 digit prime; largest < 2^64\nn = 18446744073709551533.to_big_i\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 58 digit prime\nn = \"4547337172376300111955330758342147474062293202868155909489\".to_big_i\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 58 digit non-prime\nn = \"4547337172376300111955330758342147474062293202868155909393\".to_big_i\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 81 digit prime\nn = \"100000000000000000000000000000000000000000000000000000000000000000000000001309503\".to_big_i\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 81 digit non-prime\nn = \"100000000000000000000000000000000000000000000000000000000000000000000000001309509\".to_big_i\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 308 digit prime\nn = \"94366396730334173383107353049414959521528815310548187030165936229578960209523421808912459795329035203510284576187160076386643700441216547732914250578934261891510827140267043592007225160798348913639472564715055445201512461359359488795427875530231001298552452230535485049737222714000227878890892901228389026881\".to_big_i\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\nn = \"138028649176899647846076023812164793645371887571371559091892986639999096471811910222267538577825033963552683101137782650479906670021895135954212738694784814783986671046107023185842481502719762055887490765764329237651328922972514308635045190654896041748716218441926626988737664133219271115413563418353821396401\".to_big_i\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\nn = \"123301261697053560451930527879636974557474268923771832437126939266601921428796348203611050423256894847735769138870460373141723679005090549101566289920247264982095246187318303659027201708559916949810035265951104246512008259674244307851578647894027803356820480862664695522389066327012330793517771435385653616841\".to_big_i\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\nn = \"119432521682023078841121052226157857003721669633106050345198988740042219728400958282159638484144822421840470442893056822510584029066504295892189315912923804894933736660559950053226576719285711831138657839435060908151231090715952576998400120335346005544083959311246562842277496260598128781581003807229557518839\".to_big_i\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\nn = \"132082885240291678440073580124226578272473600569147812319294626601995619845059779715619475871419551319029519794232989255381829366374647864619189704922722431776563860747714706040922215308646535910589305924065089149684429555813953571007126408164577035854428632242206880193165045777949624510896312005014225526731\".to_big_i\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\nn = \"153410708946188157980279532372610756837706984448408515364579602515073276538040155990230789600191915021209039203172105094957316552912585741177975853552299222501069267567888742458519569317286299134843250075228359900070009684517875782331709619287588451883575354340318132216817231993558066067063143257425853927599\".to_big_i\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\nn = \"103130593592068072608023213244858971741946977638988649427937324034014356815504971087381663169829571046157738503075005527471064224791270584831779395959349442093395294980019731027051356344056416276026592333932610954020105156667883269888206386119513058400355612571198438511950152690467372712488391425876725831041\".to_big_i\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\nn = \"94366396730334173383107353049414959521528815310548187030165936229578960209523421808912459795329035203510284576187160076386643700441216547732914250578934261891510827140267043592007225160798348913639472564715055445201512461359359488795427875530231001298552452230535485049737222714000227878890892901228389026881\".to_big_i\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n","language":"Crystal"},{"code":"import std.random;\n\nbool isProbablePrime(in ulong n, in uint k=10) /*nothrow*/ @safe /*@nogc*/ {\n static ulong modPow(ulong b, ulong e, in ulong m)\n pure nothrow @safe @nogc {\n ulong result = 1;\n while (e > 0) {\n if ((e & 1) == 1)\n result = (result * b) % m;\n b = (b ^^ 2) % m;\n e >>= 1;\n }\n return result;\n }\n\n if (n < 2 || n % 2 == 0)\n return n == 2;\n\n ulong d = n - 1;\n ulong s = 0;\n while (d % 2 == 0) {\n d /= 2;\n s++;\n }\n assert(2 ^^ s * d == n - 1);\n\n outer:\n foreach (immutable _; 0 .. k) {\n immutable ulong a = uniform(2, n);\n ulong x = modPow(a, d, n);\n if (x == 1 || x == n - 1)\n continue;\n foreach (immutable __; 1 .. s) {\n x = modPow(x, 2, n);\n if (x == 1)\n return false;\n if (x == n - 1)\n continue outer;\n }\n return false;\n }\n\n return true;\n}\n\nvoid main() { // Demo code.\n import std.stdio, std.range, std.algorithm;\n\n iota(2, 30).filter!isProbablePrime.writeln;\n}\n","language":"D"},{"code":"def millerRabinPrimalityTest(n :(int > 0), k :int, random) :boolean {\n if (n <=> 2 || n <=> 3) { return true }\n if (n <=> 1 || n %% 2 <=> 0) { return false }\n var d := n - 1\n var s := 0\n while (d %% 2 <=> 0) {\n d //= 2\n s += 1\n }\n for _ in 1..k {\n def nextTrial := __continue\n def a := random.nextInt(n - 3) + 2 # [2, n - 2] = [0, n - 4] + 2 = [0, n - 3) + 2\n var x := a**d %% n # Note: Will do optimized modular exponentiation\n if (x <=> 1 || x <=> n - 1) { nextTrial() }\n for _ in 1 .. (s - 1) {\n x := x**2 %% n\n if (x <=> 1) { return false }\n if (x <=> n - 1) { nextTrial() }\n }\n return false\n }\n return true\n}\n","language":"E"},{"code":"for i ? (millerRabinPrimalityTest(i, 1, entropy)) in 4..1000 {\n print(i, \" \")\n}\nprintln()\n","language":"E"},{"code":"(lib 'bigint)\n\n;; output : #t if n probably prime\n(define (miller-rabin n (k 7) (composite #f)(x))\n(define d (1- n))\n(define s 0)\n(define a 0)\n(while (even? d)\n\t(set! s (1+ s))\n\t(set! d (quotient d 2)))\n\n(for [(i k)]\n\t(set! a (+ 2 (random (- n 3))))\n\t(set! x (powmod a d n))\n\t#:continue (or (= x 1) (= x (1- n)))\n\t(set! composite\n\t(for [(r (in-range 1 s))]\n\t\t(set! x (powmod x 2 n))\n\t\t#:break (= x 1) => #t\n\t\t#:break (= x (1- n)) => #f\n\t\t#t\n\t\t))\n\t #:break composite => #f )\n (not composite))\n\n;; output\n(miller-rabin #101)\n → #t\n(miller-rabin #111)\n → #f\n(define big-prime (random-prime 1e+100))\n3461396142610375479080862553800503306376298093021233334170610435506057862777898396429\n6627816219192601527\n(miller-rabin big-prime)\n → #t\n(miller-rabin (1+ (factorial 100)))\n → #f\n(prime? (1+ (factorial 100))) ;; native\n → #f\n","language":"EchoLisp"},{"code":"defmodule Prime do\n use Application\n alias :math, as: Math\n alias :rand, as: Rand\n\n def start( _type, _args ) do\n primes = 5..1000\n |> Enum.filter( fn( x ) -> (rem x, 2) == 1 end )\n |> Enum.filter( fn( x ) -> miller_rabin?( x, 10) == True end )\n IO.inspect( primes, label: \"Primes: \", limit: :infinity )\n\n { :ok, self() }\n end\n\n def modular_exp( x, y, mod ) do\n with [ _ | bits ] = Integer.digits( y, 2 ) do\n Enum.reduce bits, x, fn( bit, acc ) -> acc * acc |> ( &( if bit == 1, do: &1 * x, else: &1 ) ).() |> rem( mod ) end\n end\n end\n\n def miller_rabin( d, s ) when rem( d, 2 ) == 0, do: { s, d }\n def miller_rabin( d, s ), do: miller_rabin( div( d, 2 ), s + 1 )\n\n def miller_rabin?( n, g ) do\n { s, d } = miller_rabin( n - 1, 0 )\n miller_rabin( n, g, s, d )\n end\n\n def miller_rabin( n, 0, _, _ ), do: True\n def miller_rabin( n, g, s, d ) do\n a = 1 + Rand.uniform( n - 3 )\n x = modular_exp( a, d, n )\n if x == 1 or x == n - 1 do\n miller_rabin( n, g - 1, s, d )\n else\n if miller_rabin( n, x, s - 1) == True, do: miller_rabin( n, g - 1, s, d ), else: False\n end\n end\n\n def miller_rabin( n, x, r ) when r <= 0, do: False\n def miller_rabin( n, x, r ) do\n x = modular_exp( x, 2, n )\n unless x == 1 do\n unless x == n - 1, do: miller_rabin( n, x, r - 1 ), else: True\n else\n False\n end\n end\nend\n","language":"Elixir"},{"code":"miller_rabin?( 94366396730334173383107353049414959521528815310548187030165936229578960209523421808912459795329035203510284576187160076386643700441216547732914250578934261891510827140267043592007225160798348913639472564715055445201512461359359488795427875530231001298552452230535485049737222714000227878890892901228389026881, 1000 )\nmiller_rabin?( 138028649176899647846076023812164793645371887571371559091892986639999096471811910222267538577825033963552683101137782650479906670021895135954212738694784814783986671046107023185842481502719762055887490765764329237651328922972514308635045190654896041748716218441926626988737664133219271115413563418353821396401, 1000 )\nmiller_rabin?( 123301261697053560451930527879636974557474268923771832437126939266601921428796348203611050423256894847735769138870460373141723679005090549101566289920247264982095246187318303659027201708559916949810035265951104246512008259674244307851578647894027803356820480862664695522389066327012330793517771435385653616841, 1000 )\nmiller_rabin?( 119432521682023078841121052226157857003721669633106050345198988740042219728400958282159638484144822421840470442893056822510584029066504295892189315912923804894933736660559950053226576719285711831138657839435060908151231090715952576998400120335346005544083959311246562842277496260598128781581003807229557518839, 1000 )\nmiller_rabin?( 132082885240291678440073580124226578272473600569147812319294626601995619845059779715619475871419551319029519794232989255381829366374647864619189704922722431776563860747714706040922215308646535910589305924065089149684429555813953571007126408164577035854428632242206880193165045777949624510896312005014225526731, 1000 )\nmiller_rabin?( 153410708946188157980279532372610756837706984448408515364579602515073276538040155990230789600191915021209039203172105094957316552912585741177975853552299222501069267567888742458519569317286299134843250075228359900070009684517875782331709619287588451883575354340318132216817231993558066067063143257425853927599, 1000 )\nmiller_rabin?( 103130593592068072608023213244858971741946977638988649427937324034014356815504971087381663169829571046157738503075005527471064224791270584831779395959349442093395294980019731027051356344056416276026592333932610954020105156667883269888206386119513058400355612571198438511950152690467372712488391425876725831041, 1000 )\n","language":"Elixir"},{"code":"-module(miller_rabin).\n\n-export([is_prime/1, power/2]).\n\nis_prime(1) -> false;\nis_prime(2) -> true;\nis_prime(3) -> true;\nis_prime(N) when N > 3, ((N rem 2) == 0) -> false;\nis_prime(N) when ((N rem 2) ==1), N < 341550071728321 ->\n \t\t\tis_mr_prime(N, proving_bases(N));\nis_prime(N) when ((N rem 2) == 1) ->\n\t\t\tis_mr_prime(N, random_bases(N, 100)).\n\n\nproving_bases(N) when N < 1373653 ->\n\t[2, 3];\nproving_bases(N) when N < 9080191 ->\n [31, 73];\nproving_bases(N) when N < 25326001 ->\n\t[2, 3, 5];\nproving_bases(N) when N < 3215031751 ->\n\t[2, 3, 5, 7];\nproving_bases(N) when N < 4759123141 ->\n [2, 7, 61];\nproving_bases(N) when N < 1122004669633 ->\n\t[2, 13, 23, 1662803];\nproving_bases(N) when N < 2152302898747 ->\n\t[2, 3, 5, 7, 11];\nproving_bases(N) when N < 3474749660383 ->\n [2, 3, 5, 7, 11, 13];\nproving_bases(N) when N < 341550071728321 ->\n [2, 3, 5, 7, 11, 13, 17].\n\n\nis_mr_prime(N, As) when N>2, N rem 2 == 1 ->\n {D, S} = find_ds(N),\n %% this is a test for compositeness; the two case patterns disprove\n %% compositeness.\n not lists:any(fun(A) ->\n case mr_series(N, A, D, S) of\n [1|_] -> false; % first elem of list = 1\n L -> not lists:member(N-1, L) % some elem of list = N-1\n end\n end,\n As).\n\n\nfind_ds(N) ->\n find_ds(N-1, 0).\n\n\nfind_ds(D, S) ->\n case D rem 2 == 0 of\n true ->\n find_ds(D div 2, S+1);\n false ->\n {D, S}\n end.\n\n\nmr_series(N, A, D, S) when N rem 2 == 1 ->\n Js = lists:seq(0, S),\n lists:map(fun(J) -> pow_mod(A, power(2, J)*D, N) end, Js).\n\n\npow_mod(B, E, M) ->\n case E of\n 0 -> 1;\n _ -> case ((E rem 2) == 0) of\n true -> (power(pow_mod(B, (E div 2), M), 2)) rem M;\n false -> (B*pow_mod(B, E-1, M)) rem M\n end\n end.\n\n\nrandom_bases(N, K) ->\n [basis(N) || _ <- lists:seq(1, K)].\n\n\nbasis(N) when N>2 ->\n 1 + random:uniform(N-3). % random:uniform returns a single random number in range 1 -> N-3, to which is added 1, shifting the range to 2 -> N-2\n\n\npower(B, E) ->\n power(B, E, 1).\n\npower(_, 0, Acc) ->\n Acc;\npower(B, E, Acc) ->\n power(B, E - 1, B * Acc).\n","language":"Erlang"},{"code":"%%% @author Tony Wallace <tony@resurrection>\n%%% @copyright (C) 2021, Tony Wallace\n%%% @doc\n%%% For details of the algorithms used see\n%%% https://en.wikipedia.org/wiki/Modular_exponentiation\n%%% @end\n%%% Created : 21 Jul 2021 by Tony Wallace <tony@resurrection>\n\n-module mod.\n-export [mod_mult/3,mod_exp/3,binary_exp/2,test/0].\n\nmod_mult(I1,I2,Mod) when\n I1 > Mod,\n is_integer(I1), is_integer(I2), is_integer(Mod) ->\n mod_mult(I1 rem Mod,I2,Mod);\nmod_mult(I1,I2,Mod) when\n I2 > Mod,\n is_integer(I1), is_integer(I2), is_integer(Mod) ->\n mod_mult(I1,I2 rem Mod,Mod);\nmod_mult(I1,I2,Mod) when\n is_integer(I1), is_integer(I2), is_integer(Mod) ->\n (I1 * I2) rem Mod.\n\nmod_exp(Base,Exp,Mod) when\n is_integer(Base),\n is_integer(Exp),\n is_integer(Mod),\n Base > 0,\n Exp > 0,\n Mod > 0 ->\n binary_exp_mod(Base,Exp,Mod);\nmod_exp(_,0,_) -> 1.\n\n\nbinary_exp(Base,Exponent) when\n is_integer(Base),\n is_integer(Exponent),\n Base > 0,\n Exponent > 0 ->\n binary_exp(Base,Exponent,1);\nbinary_exp(_,0) ->\n 1.\n\nbinary_exp(_,0,Result) ->\n Result;\nbinary_exp(Base,Exponent,Acc) ->\n binary_exp(Base*Base,Exponent bsr 1,Acc * exp_factor(Base,Exponent)).\n\n\nbinary_exp_mod(Base,Exponent,Mod) ->\n binary_exp_mod(Base rem Mod,Exponent,Mod,1).\nbinary_exp_mod(_,0,_,Result) ->\n Result;\nbinary_exp_mod(Base,Exponent,Mod,Acc) ->\n binary_exp_mod((Base*Base) rem Mod,\n\t\t Exponent bsr 1,Mod,(Acc * exp_factor(Base,Exponent))rem Mod).\n\nexp_factor(_,0) ->\n 1;\nexp_factor(Base,1) ->\n Base;\nexp_factor(Base,Exponent) ->\n exp_factor(Base,Exponent band 1).\n\ntest() ->\n 445 = mod_exp(4,13,497),\n %% Rosetta code example:\n R = 1527229998585248450016808958343740453059 =\n\tmod_exp(2988348162058574136915891421498819466320163312926952423791023078876139,\n\t\t2351399303373464486466122544523690094744975233415544072992656881240319,\n\t\tbinary_exp(10,40)),\n R.\n% mod module ends here\n\n\n%% Modified version of rosetta code entry\n%% Modification was more efficient exponentiation\n%% Modification - use of rpc:pmap to utilise multithreaded CPUs\n-module(miller_rabin).\n\n-export([is_prime/1,mr_series_test/4,mersennes/1,test/0]).\n\nis_prime(1) -> false;\nis_prime(2) -> true;\nis_prime(3) -> true;\nis_prime(N) when N > 3, ((N rem 2) == 0) -> false;\nis_prime(N) when ((N rem 2) ==1), N < 341550071728321 ->\n \t\t\tis_mr_prime(N, proving_bases(N));\nis_prime(N) when ((N rem 2) == 1) ->\n\t\t\tis_mr_prime(N, random_bases(N, 100)).\n\n\nproving_bases(N) when N < 1373653 ->\n\t[2, 3];\nproving_bases(N) when N < 9080191 ->\n [31, 73];\nproving_bases(N) when N < 25326001 ->\n\t[2, 3, 5];\nproving_bases(N) when N < 3215031751 ->\n\t[2, 3, 5, 7];\nproving_bases(N) when N < 4759123141 ->\n [2, 7, 61];\nproving_bases(N) when N < 1122004669633 ->\n\t[2, 13, 23, 1662803];\nproving_bases(N) when N < 2152302898747 ->\n\t[2, 3, 5, 7, 11];\nproving_bases(N) when N < 3474749660383 ->\n [2, 3, 5, 7, 11, 13];\nproving_bases(N) when N < 341550071728321 ->\n [2, 3, 5, 7, 11, 13, 17].\n\n\nis_mr_prime(N, As) when N>2, N rem 2 == 1 ->\n% TStart = erlang:monotonic_time(),\n {D, S} = find_ds(N),\n% elapsed(TStart,\"find_ds took ~p.~p seconds~n\"),\n %% this is a test for compositeness; the two case patterns disprove\n %% compositeness.\n TestResults =\n\trpc:pmap({miller_rabin,mr_series_test},[N,D,S],As),\n\n R= not lists:any(fun(X) -> X end,TestResults),\n% elapsed(TStart,\"is_mr_prime took ~p.~p seconds~n\"),\n R.\n\nmr_series_test(A,N,D,S) ->\n% TMrS = erlang:monotonic_time(),\n R = case mr_series(N, A, D, S) of\n\t [1|_] -> false; % first elem of list = 1\n\t L -> not lists:member(N-1, L) % some elem of list = N-1\n\tend,\n% elapsed(TMrS,\"mr_series took ~p.~p seconds~n\"),\n R.\n\n%elapsed(TStart,Msg) ->\n% TElapsed_ms = erlang:convert_time_unit(erlang:monotonic_time()-TStart,native,1000),\n% TSec = TElapsed_ms div 1000,\n% Tms = TElapsed_ms rem 1000,\n% io:format(Msg, [TSec,Tms]).\n\n\nfind_ds(N) ->\n find_ds(N-1, 0).\n\nfind_ds(D, S) ->\n case D rem 2 == 0 of\n true ->\n find_ds(D div 2, S+1);\n false ->\n {D, S}\n end.\n\n\nmr_series(N, A, D, S) when N rem 2 == 1 ->\n Js = lists:seq(0, S),\n lists:map(fun(J) -> mod:mod_exp(A, mod:binary_exp(2, J)*D, N) end, Js).\n\nrandom_bases(N, K) ->\n [basis(N) || _ <- lists:seq(1, K)].\n\n\nbasis(N) when N>2 ->\n % random:uniform returns a single random number in range 1 -> N-3,\n % to which is added 1, shifting the range to 2 -> N-2\n 1 + rand:uniform(N-3).\n\nmersennes(N) when N>0, is_integer(N) ->\n 1 bsl N - 1.\n\ntest() ->\n TStart = erlang:monotonic_time(),\n true = is_prime(7),\n true = is_prime(41),\n false = is_prime(42),\n true = is_prime(mersennes(31)),\n true = is_prime(mersennes(127)), % M(127) checks okay if 64 bit word size exceeded,\n true = is_prime(mersennes(3217)), % about the size of an rsa key,\n TFinish = erlang:monotonic_time(),\n ElapsedSeconds = erlang:convert_time_unit(TFinish - TStart,native,1),\n io:format(\"Time seconds = ~p~n\",[ElapsedSeconds]),\n ok\n .\n","language":"Erlang"},{"code":"// Miller primality test for n<3317044064679887385961981. Nigel Galloway: April 1st., 2021\nlet a=[(2047I,[2I]);(1373653I,[2I;3I]);(9080191I,[31I;73I]);(25326001I,[2I;3I;5I]);(3215031751I,[2I;3I;5I;7I]);(4759123141I,[2I;7I;61I]);(1122004669633I,[2I;13I;23I;1662803I]);\n (2152302898747I,[2I;3I;5I;7I;11I]);(3474749660383I,[2I;3I;5I;7I;11I;13I]);(341550071728321I,[2I;3I;5I;7I;11I;13I;17I]);(3825123056546413051I,[2I;3I;5I;7I;11I;13I;17I;19I;23I]);\n (18446744073709551616I,[2I;3I;5I;7I;11I;13I;17I;19I;23I;29I;31I;37I]);(318665857834031151167461I,[2I;3I;5I;7I;11I;13I;17I;19I;23I;29I;31I;37I]);(3317044064679887385961981I,[2I;3I;5I;7I;11I;13I;17I;19I;23I;29I;31I;37I;41I])]\nlet rec fN g=function (n:bigint) when n.IsEven->fN(g+1)(n/2I) |n->(n,g)\nlet rec fG n d r=function a::t->match bigint.ModPow(a,d,n) with g when g=1I || g=n-1I->fG n d r t |g->fL(bigint.ModPow(g,2I,n)) n d t r\n |_->true\n and fL x n d a=function 1->false |r when x=n-1I->fG n d r a |r->fL(bigint.ModPow(x,2I,n)) n d a (r-1)\nlet mrP n=let (d,r)=fN 0 (n-1I) in fG n d r (snd(a|>List.find(fst>>(<)n)))\n\nprintfn \"%A %A\" (mrP 2147483647I)(mrP 844674407370955389I)\n","language":"F-Sharp"},{"code":"\\ modular multiplication and exponentiation\n\\\n: 3rd s\" 2 pick\" evaluate ; immediate\n\n: mod* ( a b m -- a*b {mod m} )\n >r um* r> ud/mod 2drop ;\n\n: mod^ ( x n m -- x^n {mod m} )\n >r 1 swap\n begin ?dup while\n dup 1 and 1 =\n if\n swap 3rd r@ mod* swap 1-\n then dup 0>\n if\n rot dup r@ mod* -rot 2/\n then\n repeat nip rdrop ;\n\n\\ small divisor check: true => possibly prime; false => definitely not prime.\n\\\n31 constant π-128\ncreate maybe-prime?\n 2 c, 3 c, 5 c, 7 c, 11 c, 13 c, 17 c, 19 c, 23 c, 29 c,\n 31 c, 37 c, 41 c, 43 c, 47 c, 53 c, 59 c, 61 c, 67 c, 71 c,\n 73 c, 79 c, 83 c, 89 c, 97 c, 101 c, 103 c, 107 c, 109 c, 113 c,\n 127 c,\ndoes>\n true -rot\n π-128 bounds do\n i c@ dup * over > if leave then\n dup i c@ mod 0= if 2drop false unloop exit then\n loop drop ;\n\n\\ actual Miller-Rabin test\n\\\n: factor-2s ( n -- s d )\n 0 swap\n begin dup 1 and 0= while\n swap 1+ swap 2/\n repeat ;\n\n: fermat-square-test ( n m s -- ? ) \\ perform n = n^2 (mod m), s-1 times\n 1- 0 ?do\n 2dup - -1 =\n if leave\n then >r dup r@ mod* r>\n loop\n - -1 = ;\n\n: strong-fermat-pseudoprime? ( n a -- ? )\n over >r \\ keep the modulus on the return stack\n >r 1- factor-2s r> \\ -- s d a\n swap r@ mod^ \\ s d a -- s, a^d (mod n)\n dup 1 = \\ a^d == 1 (mod n) => Fermat pseudoprime\n if 2drop rdrop true\n else r> rot fermat-square-test\n then ;\n\n4.759.123.141 drop constant mr-det-3 \\ Deterministic threshold; 3 bases\n\ncreate small-prime-bases 2 , 7 , 61 , \\ deterministic up to mr-det-3\ncreate large-prime-bases 2 , 325 , 9375 , 28178 , 450775 , 9780504 , 1795265022 , \\ known to be deterministic for 64 bit integers.\n\n: miler-rabin-bases ( n -- addr n )\n mr-det-3 <\n if small-prime-bases 3\n else large-prime-bases 7\n then ;\n\n: miller-rabin-primality-test ( n -- f )\n dup miler-rabin-bases cells bounds do\n dup i @ strong-fermat-pseudoprime? invert\n if drop false unloop exit then\n cell +loop drop true ;\n\n: prime? ( n -- f )\n dup 2 <\n if drop false\n else\n dup maybe-prime?\n if dup [ 127 dup * 1+ ] literal <\n if drop true\n else miller-rabin-primality-test\n then\n else drop false\n then\n then ;\n","language":"Forth"},{"code":" module Miller_Rabin\n use PrimeDecompose\n implicit none\n\n integer, parameter :: max_decompose = 100\n\n private :: int_rrand, max_decompose\n\ncontains\n\n function int_rrand(from, to)\n integer(huge) :: int_rrand\n integer(huge), intent(in) :: from, to\n\n real :: o\n call random_number(o)\n int_rrand = floor(from + o * real(max(from,to) - min(from, to)))\n end function int_rrand\n\n function miller_rabin_test(n, k) result(res)\n logical :: res\n integer(huge), intent(in) :: n\n integer, intent(in) :: k\n\n integer(huge), dimension(max_decompose) :: f\n integer(huge) :: s, d, i, a, x, r\n\n res = .true.\n f = 0\n\n if ( (n <= 2) .and. (n > 0) ) return\n if ( mod(n, 2) == 0 ) then\n res = .false.\n return\n end if\n\n call find_factors(n-1, f)\n s = count(f == 2)\n d = (n-1) / (2 ** s)\n loop: do i = 1, k\n a = int_rrand(2_huge, n-2)\n x = mod(a ** d, n)\n\n if ( x == 1 ) cycle\n do r = 0, s-1\n if ( x == ( n - 1 ) ) cycle loop\n x = mod(x*x, n)\n end do\n if ( x == (n-1) ) cycle\n res = .false.\n return\n end do loop\n res = .true.\n end function miller_rabin_test\n\nend module Miller_Rabin\n","language":"Fortran"},{"code":"program TestMiller\n use Miller_Rabin\n implicit none\n\n integer, parameter :: prec = 30\n integer(huge) :: i\n\n ! this is limited since we're not using a bignum lib\n call do_test( (/ (i, i=1, 29) /) )\n\ncontains\n\n subroutine do_test(a)\n integer(huge), dimension(:), intent(in) :: a\n\n integer :: i\n\n do i = 1, size(a,1)\n print *, a(i), miller_rabin_test(a(i), prec)\n end do\n\n end subroutine do_test\n\nend program TestMiller\n","language":"Fortran"},{"code":" MODULE MRTEST\t!Try the Miller-Rabin primality test.\n CONTAINS\t\t!Working only with in-built integers.\n LOGICAL FUNCTION MRPRIME(N,TRIALS)\t!Could N be a prime number?\n USE DFPORT\t!To get RAND.\n INTEGER N\t!The number.\n INTEGER TRIALS\t!The count of trials to make.\n INTEGER D,S\t!Represents a number in a special form.\n INTEGER TRIAL\n INTEGER A,X,R\nCatch some annoying cases.\n IF (N .LE. 4) THEN\t!A single-digit number?\n MRPRIME = N.GT.1 .AND. N.LE.3\t!Yes. Some special values.\n RETURN\t\t!Thus allow 2 to be reported as prime.\n END IF\t\t!Yet, test for 2 as a possible factor for larger numbers.\n MRPRIME = .FALSE.\t!Pessimism prevails.\n IF (MOD(N,2).EQ.0 .OR. MOD(N,3).EQ.0) RETURN\t!Thus.\nConstruct D such that N - 1 = D*2**S. By here, N is odd, and greater than three.\n D = N - 1\t\t!Thus, D becomes an even number.\n S = 1\t\t\t!So, it has at least one power of two.\n 10 D = D/2\t\t!Divide it out.\n IF (MOD(D,2).EQ.0) THEN\t!If there is another,\n S = S + 1\t\t\t!Count it,\n GO TO 10\t\t\t!And divide it out also.\n END IF\t\t!So, D is no longer even. N = 1 + D*2**S\n WRITE (6,11) N,D,S\n 11 FORMAT(\"For \",I0,\", D=\",I0,\",S=\",I0)\nConvince through repetition..\n T:DO TRIAL = 1,TRIALS\t!Some trials yield a definite result.\n A = RAND(0)*(N - 2) + 2\t!For small N, the birthday problem.\n X = MODEXP(N,A,D)\t\t!A**D mod N.\n WRITE (6,22) TRIAL,A,X,INT8(A)**D,N,MOD(INT8(A)**D,N)\n 22 FORMAT(6X,\"Trial \",I0,\",A=\",I4,\",X=\",I4,\n 1 \"=MOD(\",I0,\",\",I0,\")=\",I0)\n IF (X.EQ.1 .OR. X.EQ.N - 1) CYCLE T\t!Pox. A prime yields these.\n DO R = 1,S - 1\t!Step through the powers of two in N - 1.\n X = MODEXP(N,X,2)\t\t!X**2 mod N.\n WRITE (6,23) R,X\n 23 FORMAT (14X,\"R=\",I4,\",X=\",I0)\n IF (X.EQ.1) RETURN\t!Definitely composite. No prime does this.\n IF (X.EQ.N - 1) CYCLE T\t!Pox. Try something else.\n END DO\t\t!Another power of two?\n RETURN\t\t!Definitely composite.\n END DO T\t\t!Have another go.\n MRPRIME = .TRUE.\t!Would further trials yield greater assurance?\n END FUNCTION MRPRIME\t!Are some numbers resistant to this scheme?\n\n INTEGER FUNCTION MODEXP(N,X,P)\t!Calculate X**P mod N without overflowing...\nC Relies on a.b mod n = (a mod n)(b mod n) mod n\n INTEGER N,X,P\t!All presumed positive, and X < N.\n INTEGER I\t!A stepper.\n INTEGER*8 V,W\t!Broad scratchpads, otherwise N > 46340 may incur overflow in 32-bit.\n V = 1\t\t!=X**0\n IF (P.GT.0) THEN\t!Something to do?\n I = P\t\t\t!Yes. Get a copy I can mess with.\n W = X\t\t\t!=X**1, X**2, X**4, X**8, ... except, all are mod N.\n 1 IF (MOD(I,2).EQ.1) V = MOD(V*W,N)\t!Incorporate W if the low-end calls for it.\n I = I/2\t\t\t!Used. Shift the next one down.\n IF (I.GT.0) THEN\t\t!Still something to do?\n W = MOD(W**2,N)\t\t\t!Yes. Square W ready for the next bit up.\n GO TO 1\t\t\t\t!Consider it.\n END IF\t\t\t\t!Don't square W if nothing remains. It might overflow.\n END IF\t\t!Negative powers are ignored.\n MODEXP = V\t\t!Done, in lb(P) iterations!\n END FUNCTION MODEXP\t!\"Bit\" presence by arithmetic: works for non-binary arithmetic too.\n\n PROGRAM POKEMR\n USE MRTEST\n INTEGER I\n LOGICAL HIC\n\n DO I = 3,36,2\n HIC = MRPRIME(I,6)\n WRITE (6,11) I,HIC\n 11 FORMAT (I6,1X,L)\n END DO\n\n END\n","language":"Fortran"},{"code":"' version 29-11-2016\n' compile with: fbc -s console\n\n' TRUE/FALSE are built-in constants since FreeBASIC 1.04\n' But we have to define them for older versions.\n#Ifndef TRUE\n #Define FALSE 0\n #Define TRUE Not FALSE\n#EndIf\n\nFunction mul_mod(a As ULongInt, b As ULongInt, modulus As ULongInt) As ULongInt\n ' returns a * b mod modulus\n Dim As ULongInt x, y = a ' a mod modulus, but a is already smaller then modulus\n\n While b > 0\n If (b And 1) = 1 Then\n x = (x + y) Mod modulus\n End If\n y = (y Shl 1) Mod modulus\n b = b Shr 1\n Wend\n\n Return x\n\nEnd Function\n\nFunction pow_mod(b As ULongInt, power As ULongInt, modulus As ULongInt) As ULongInt\n ' returns b ^ power mod modulus\n Dim As ULongInt x = 1\n\n While power > 0\n If (power And 1) = 1 Then\n ' x = (x * b) Mod modulus\n x = mul_mod(x, b, modulus)\n End If\n ' b = (b * b) Mod modulus\n b = mul_mod(b, b, modulus)\n power = power Shr 1\n Wend\n\n Return x\n\nEnd Function\n\nFunction miller_rabin_test(n As ULongInt, k As Integer) As Byte\n\n If n > 9223372036854775808ull Then ' limit 2^63, pow_mod/mul_mod can't handle bigger numbers\n Print \"number is to big, program will end\"\n Sleep\n End\n End If\n\n ' 2 is a prime, if n is smaller then 2 or n is even then n = composite\n If n = 2 Then Return TRUE\n If (n < 2) OrElse ((n And 1) = 0) Then Return FALSE\n\n Dim As ULongInt a, x, n_one = n - 1, d = n_one\n Dim As UInteger s\n\n While (d And 1) = 0\n d = d Shr 1\n s = s + 1\n Wend\n\n While k > 0\n k = k - 1\n a = Int(Rnd * (n -2)) +2 ' 2 <= a < n\n x = pow_mod(a, d, n)\n If (x = 1) Or (x = n_one) Then Continue While\n For r As Integer = 1 To s -1\n x = pow_mod(x, 2, n)\n If x = 1 Then Return FALSE\n If x = n_one Then Continue While\n Next\n If x <> n_one Then Return FALSE\n Wend\n Return TRUE\n\nEnd Function\n' ------=< MAIN >=------\n\nRandomize Timer\n\nDim As Integer total\nDim As ULongInt y, limit = 2^63-1\n\nFor y = limit - 1000 To limit\n If miller_rabin_test(y, 5) = TRUE Then\n total = total + 1\n Print y,\n End If\nNext\n\nPrint : Print\nPrint total; \" primes between \"; limit - 1000; \" and \"; y -1\n\n' empty keyboard buffer\nWhile Inkey <> \"\" : Wend\nPrint : Print \"hit any key to end program\"\nSleep\nEnd\n","language":"FreeBASIC"},{"code":"' version 05-04-2017\n' compile with: fbc -s console\n\n' TRUE/FALSE are built-in constants since FreeBASIC 1.04\n' But we have to define them for older versions.\n#Ifndef TRUE\n #Define FALSE 0\n #Define TRUE Not FALSE\n#EndIf\n\n#Include Once \"gmp.bi\"\n\n#Macro big_int(a)\n Dim As Mpz_ptr a = Allocate( Len( __mpz_struct))\n Mpz_init(a)\n#EndMacro\n\nDim Shared As __gmp_randstate_struct rnd_\n\nFunction miller_rabin(big_n As Mpz_ptr, num_of_tests As ULong) As Byte\n\n If mpz_cmp_ui(big_n, 1) < 1 Then\n Print \"Numbers smaller then 1 not allowed\"\n Sleep 5000\n End If\n\n If mpz_cmp_ui(big_n, 2) = 0 OrElse mpz_cmp_ui(big_n, 3) = 0 Then\n Return TRUE ' 2 = prime , 3 = prime\n End If\n\n If mpz_tstbit(big_n, 0) = 0 Then Return FALSE ' even number, no prime\n\n Dim As ULong r, s\n Dim As Byte return_value = TRUE\n\n big_int(n_1) : big_int(n_2) : big_int(a) : big_int(d) : big_int(x)\n\n mpz_sub_ui(n_1, big_n, 1) : mpz_sub_ui(n_2, big_n, 2) : mpz_set(d, n_1)\n\n While mpz_tstbit(d, 0) = 0\n mpz_fdiv_q_2exp(d, d, 1)\n s += 1\n Wend\n\n While num_of_tests > 0\n num_of_tests -= 1\n mpz_urandomm(a, @rnd_, n_2)\n mpz_add_ui(a, a, 2)\n mpz_powm(x, a, d, big_n)\n If mpz_cmp_ui(x, 1) = 0 Or mpz_cmp(x, n_1) = 0 Then Continue While\n\n For r = 1 To s -1\n mpz_powm_ui(x, x, 2, big_n)\n If mpz_cmp_ui(x, 1) = 0 Then\n return_value = FALSE\n Exit While\n End If\n If mpz_cmp(x, n_1) = 0 Then Continue While\n Next\n\n If mpz_cmp(x, n_1) <> 0 Then\n Return_value = FALSE\n Exit while\n End If\n Wend\n\n mpz_clear(n_1) : mpz_clear(a) : mpz_clear(d)\n mpz_clear(n_2) : mpz_clear(x)\n\n Return return_value\n\nEnd Function\n\n' ------=< MAIN >=------\n\nDim As Long x\nDim As String tmp\nDim As ZString Ptr gmp_str : gmp_str = Allocate(1000000)\nbig_int(big_n)\n\nRandomize Timer\ngmp_randinit_mt(@rnd_)\nFor x = 0 To 200 'create seed for random generator\n tmp += Str(Int(Rnd * 10))\nNext\nMpz_set_str(big_n, tmp, 10)\ngmp_randseed(@rnd_, big_n) ' seed the random number generator\n\nFor x = 2 To 100\n mpz_set_ui(big_n, x)\n If miller_rabin(big_n, 5) = TRUE Then\n Print Using \"####\"; x;\n End If\nNext\n\nPrint : Print\nFor x = 2 To 3300\n mpz_set_ui(big_n, 1)\n mpz_mul_2exp(big_n, big_n, x)\n mpz_sub_ui(big_n, big_n, 1)\n If miller_rabin(big_n, 5) = TRUE Then\n gmp_str = Mpz_get_str(0, 10, big_n)\n Print \"2^\";Str(x);\"-1 = prime\"\n End If\nNext\n\ngmp_randclear(@rnd_)\nmpz_clear(big_n)\nDeAllocate(gmp_str)\n\n' empty keyboard buffer\nPrint : While Inkey <> \"\" : Wend\nPrint : Print \"hit any key to end program\"\nSleep\nEnd\n","language":"FreeBASIC"},{"code":"import util.rnd\n\ndef isProbablyPrimeMillerRabin( n, k ) =\n d = n - 1\n s = 0\n\n while 2|d\n s++\n d /= 2\n\n repeat k\n a = rnd( 2, n )\n x = a^d mod n\n\n if x == 1 or x == n - 1 then continue\n\n repeat s - 1\n x = x^2 mod n\n\n if x == 1 then return false\n\n if x == n - 1 then break\n else\n return false\n\n true\n\nfor i <- 3..100\n if isProbablyPrimeMillerRabin( i, 5 )\n println( i )\n","language":"FunL"},{"code":"package main\n\nimport \"log\"\n\nfunc main() {\n // max uint32 is not prime\n c := uint32(1<<32 - 1)\n // a few primes near the top of the range. source: prime pages.\n for _, p := range []uint32{1<<32 - 5, 1<<32 - 17, 1<<32 - 65, 1<<32 - 99} {\n for ; c > p; c-- {\n if prime(c) {\n log.Fatalf(\"prime(%d) returned true\", c)\n }\n }\n if !prime(p) {\n log.Fatalf(\"prime(%d) returned false\", p)\n }\n c--\n }\n}\n\nfunc prime(n uint32) bool {\n // bases of 2, 7, 61 are sufficient to cover 2^32\n switch n {\n case 0, 1:\n return false\n case 2, 7, 61:\n return true\n }\n // compute s, d where 2^s * d = n-1\n nm1 := n - 1\n d := nm1\n s := 0\n for d&1 == 0 {\n d >>= 1\n s++\n }\n n64 := uint64(n)\n for _, a := range []uint32{2, 7, 61} {\n // compute x := a^d % n\n x := uint64(1)\n p := uint64(a)\n for dr := d; dr > 0; dr >>= 1 {\n if dr&1 != 0 {\n x = x * p % n64\n }\n p = p * p % n64\n }\n if x == 1 || uint32(x) == nm1 {\n continue\n }\n for r := 1; ; r++ {\n if r >= s {\n return false\n }\n x = x * x % n64\n if x == 1 {\n return false\n }\n if uint32(x) == nm1 {\n break\n }\n }\n }\n return true\n}\n","language":"Go"},{"code":"module Primes where\n\nimport System.Random\nimport System.IO.Unsafe\n\n-- Miller-Rabin wrapped up as an (almost deterministic) pure function\nisPrime :: Integer -> Bool\nisPrime n = unsafePerformIO (isMillerRabinPrime 100 n)\n\n\nisMillerRabinPrime :: Int -> Integer -> IO Bool\nisMillerRabinPrime k n\n | even n = return (n==2)\n | n < 100 = return (n `elem` primesTo100)\n | otherwise = do ws <- witnesses k n\n return $ and [test n (pred n) evens (head odds) a | a <- ws]\n where\n (evens,odds) = span even (iterate (`div` 2) (pred n))\n\ntest :: Integral nat => nat -> nat -> [nat] -> nat -> nat -> Bool\ntest n n_1 evens d a = x `elem` [1,n_1] || n_1 `elem` powers\n where\n x = powerMod n a d\n powers = map (powerMod n a) evens\n\nwitnesses :: (Num a, Ord a, Random a) => Int -> a -> IO [a]\nwitnesses k n\n | n < 9080191 = return [31,73]\n | n < 4759123141 = return [2,7,61]\n | n < 3474749660383 = return [2,3,5,7,11,13]\n | n < 341550071728321 = return [2,3,5,7,11,13,17]\n | otherwise = do g <- newStdGen\n return $ take k (randomRs (2,n-1) g)\n\nprimesTo100 :: [Integer]\nprimesTo100 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97]\n\n-- powerMod m x n = x^n `mod` m\npowerMod :: Integral nat => nat -> nat -> nat -> nat\npowerMod m x n = f (n - 1) x x `rem` m\n where\n f d a y = if d==0 then y else g d a y\n g i b y | even i = g (i `quot` 2) (b*b `rem` m) y\n | otherwise = f (i-1) b (b*y `rem` m)\n","language":"Haskell"},{"code":"import Control.Monad (liftM)\nimport Data.Bits (Bits, testBit, shiftR)\nimport System.Random (Random, getStdGen, randomRs)\nimport System.IO.Unsafe (unsafePerformIO)\nimport Prelude hiding (even, odd)\n\nodd :: (Integral a, Bits a) => a -> Bool\nodd = (`testBit` 0)\n\neven :: (Integral a, Bits a) => a -> Bool\neven = not . odd\n\n-- modPow - Recursive modular exponentiation by taking successive powers of two\nmodPow :: (Integral a, Bits a) => a -> a -> a -> a\nmodPow _ 0 _ = 1\nmodPow base ex m = let term\n | testBit ex 0 = base `mod` m\n | otherwise = 1\n in (term * modPow (base^2 `mod` m) (ex `shiftR` 1) m) `mod` m\n\nisPrime :: (Integral a, Bits a, Random a) => a -> a -> Bool\nisPrime n k\n | n < 4 = if n > 1 then True else False -- Deal with 0-3.\n | even n = False\n | otherwise = let randPool = unsafePerformIO $ randNums (n - 2)\n in witness k randPool\n where\n randNums upper = do\n g <- getStdGen\n return (randomRs (2, upper) g)\n\n (d, r) = let decompose d r\n | odd d = (d, r)\n | otherwise = decompose (d `shiftR` 1) (r + 1)\n in decompose (n - 1) 0\n\n witness 0 _ = True\n witness k (a:rands)\n | x == 1 || x == n - 1 = witness (k - 1) rands\n | otherwise = check x (r - 1)\n where\n x = modPow a d n\n\n check _ 0 = False\n check x count\n | x' == 1 = False\n | x' == n - 1 = witness (k - 1) rands\n | otherwise = check x' (count - 1)\n where x' = modPow x 2 n\n\n-- main function for testing\nmain :: IO()\nmain = do\n [n,k] <- liftM (map (\\x -> read x :: Integer) . words) getLine\n print $ isPrime n k\n","language":"Haskell"},{"code":"procedure main(A)\n every n := !A do write(n,\" is \",(mrp(n,5),\"probably prime\")|\"composite\")\nend\n\nprocedure mrp(n, k)\n if n = 2 then return \"\"\n if n%2 = 0 then fail\n nm1 := decompose(n-1)\n s := nm1[1]\n d := nm1[2]\n every !k do {\n a := ?(n-2)+1\n x := (a^d)%n\n if x = (1|(n-1)) then next\n every !(s-1) do {\n x := (x*x)%n\n if x = 1 then fail\n if x = (n-1) then break next\n }\n fail\n }\n return \"\"\nend\n\nprocedure decompose(nm1)\n s := 1\n d := nm1\n while d%2 = 0 do {\n d /:= 2\n s +:= 1\n }\n return [s,d]\nend\n","language":"Icon"},{"code":"import java.math.BigInteger;\n\npublic class MillerRabinPrimalityTest {\n public static void main(String[] args) {\n BigInteger n = new BigInteger(args[0]);\n int certainty = Integer.parseInt(args[1]);\n System.out.println(n.toString() + \" is \" + (n.isProbablePrime(certainty) ? \"probably prime\" : \"composite\"));\n }\n}\n","language":"Java"},{"code":"import java.math.BigInteger;\n\npublic class Prime {\n\n // this is the RabinMiller test, deterministically correct for n < 341,550,071,728,321\n // http://rosettacode.org/wiki/Miller-Rabin_primality_test#Python:_Proved_correct_up_to_large_N\n public static boolean isPrime(BigInteger n, int precision) {\n\n if (n.compareTo(new BigInteger(\"341550071728321\")) >= 0) {\n return n.isProbablePrime(precision);\n }\n\n int intN = n.intValue();\n if (intN == 1 || intN == 4 || intN == 6 || intN == 8) return false;\n if (intN == 2 || intN == 3 || intN == 5 || intN == 7) return true;\n\n int[] primesToTest = getPrimesToTest(n);\n if (n.equals(new BigInteger(\"3215031751\"))) {\n return false;\n }\n BigInteger d = n.subtract(BigInteger.ONE);\n BigInteger s = BigInteger.ZERO;\n while (d.mod(BigInteger.valueOf(2)).equals(BigInteger.ZERO)) {\n d = d.shiftRight(1);\n s = s.add(BigInteger.ONE);\n }\n for (int a : primesToTest) {\n if (try_composite(a, d, n, s)) {\n return false;\n }\n }\n return true;\n }\n\n public static boolean isPrime(BigInteger n) {\n return isPrime(n, 100);\n }\n\n public static boolean isPrime(int n) {\n return isPrime(BigInteger.valueOf(n), 100);\n }\n\n public static boolean isPrime(long n) {\n return isPrime(BigInteger.valueOf(n), 100);\n }\n\n private static int[] getPrimesToTest(BigInteger n) {\n if (n.compareTo(new BigInteger(\"3474749660383\")) >= 0) {\n return new int[]{2, 3, 5, 7, 11, 13, 17};\n }\n if (n.compareTo(new BigInteger(\"2152302898747\")) >= 0) {\n return new int[]{2, 3, 5, 7, 11, 13};\n }\n if (n.compareTo(new BigInteger(\"118670087467\")) >= 0) {\n return new int[]{2, 3, 5, 7, 11};\n }\n if (n.compareTo(new BigInteger(\"25326001\")) >= 0) {\n return new int[]{2, 3, 5, 7};\n }\n if (n.compareTo(new BigInteger(\"1373653\")) >= 0) {\n return new int[]{2, 3, 5};\n }\n return new int[]{2, 3};\n }\n\n private static boolean try_composite(int a, BigInteger d, BigInteger n, BigInteger s) {\n BigInteger aB = BigInteger.valueOf(a);\n if (aB.modPow(d, n).equals(BigInteger.ONE)) {\n return false;\n }\n for (int i = 0; BigInteger.valueOf(i).compareTo(s) < 0; i++) {\n // if pow(a, 2**i * d, n) == n-1\n if (aB.modPow(BigInteger.valueOf(2).pow(i).multiply(d), n).equals(n.subtract(BigInteger.ONE))) {\n return false;\n }\n }\n return true;\n }\n}\n","language":"Java"},{"code":"function probablyPrime(n) {\n if (n === 2 || n === 3) return true\n if (n % 2 === 0 || n < 2) return false\n\n // Write (n - 1) as 2^s * d\n var s = 0,\n d = n - 1\n while ((d & 1) == 0) {\n d >>= 1\n ++s\n }\n\n let base = 2\n var x = Math.pow(base, d) % n\n\n if (x == 1 || x == n - 1) return true\n\n for (var i = 1; i <= s; i++) {\n x = (x * x) % n\n\n if (x === n - 1) return true\n }\n return false\n}\n","language":"JavaScript"},{"code":"witnesses(n::Union(Uint8,Int8,Uint16,Int16)) = (2,3)\nwitnesses(n::Union(Uint32,Int32)) = n < 1373653 ? (2,3) : (2,7,61)\nwitnesses(n::Union(Uint64,Int64)) =\n n < 1373653 ? (2,3) :\n n < 4759123141 ? (2,7,61) :\n n < 2152302898747 ? (2,3,5,7,11) :\n n < 3474749660383 ? (2,3,5,7,11,13) :\n (2,325,9375,28178,450775,9780504,1795265022)\n\nfunction isprime(n::Integer)\n n == 2 && return true\n (n < 2) | iseven(n) && return false\n s = trailing_zeros(n-1)\n d = (n-1) >>> s\n for a in witnesses(n)\n a < n || break\n x = powermod(a,d,n)\n x == 1 && continue\n t = s\n while x != n-1\n (t-=1) <= 0 && return false\n x = oftype(n, Base.widemul(x,x) % n)\n x == 1 && return false\n end\n end\n return true\nend\n","language":"Julia"},{"code":"// version 1.1.2\n\nimport java.math.BigInteger\nimport java.util.Random\n\nval bigTwo = BigInteger.valueOf(2L)\n\nfun isProbablyPrime(n: BigInteger, k: Int): Boolean {\n require (n > bigTwo && n % bigTwo == BigInteger.ONE) { \"Must be odd and greater than 2\" }\n var s = 0\n val nn = n - BigInteger.ONE\n var d: BigInteger\n do {\n s++\n d = nn.shiftRight(s)\n }\n while (d % bigTwo == BigInteger.ZERO)\n\n val rand = Random()\n loop@ for (i in 1..k) {\n var a: BigInteger\n do {\n a = BigInteger(n.bitLength(), rand)\n }\n while(a < bigTwo || a > nn) // make sure it's in the interval [2, n - 1]\n\n var x = a.modPow(d, n)\n if (x == BigInteger.ONE || x == nn) continue\n for (r in 1 until s) {\n x = (x * x) % n\n if (x == BigInteger.ONE) return false\n if (x == nn) break@loop\n }\n return false\n }\n return true\n}\n\nfun main(args: Array<String>) {\n val k = 20 // say\n // obtain all primes up to 100\n println(\"The following numbers less than 100 are prime:\")\n for (i in 3..99 step 2)\n if (isProbablyPrime(BigInteger.valueOf(i.toLong()), k)) print(\"$i \")\n println(\"\\n\")\n // check if some big numbers are probably prime\n val bia = arrayOf(\n BigInteger(\"4547337172376300111955330758342147474062293202868155909489\"),\n BigInteger(\"4547337172376300111955330758342147474062293202868155909393\")\n )\n for (bi in bia)\n println(\"$bi is ${if (isProbablyPrime(bi, k)) \"probably prime\" else \"composite\"}\")\n}\n","language":"Kotlin"},{"code":"DIM mersenne(11)\nmersenne(1)=7\nmersenne(2)=31\nmersenne(3)=127\nmersenne(4)=8191\nmersenne(5)=131071\nmersenne(6)=524287\nmersenne(7)=2147483647\nmersenne(8)=2305843009213693951\nmersenne(9)=618970019642690137449562111\nmersenne(10)=162259276829213363391578010288127\nmersenne(11)=170141183460469231731687303715884105727\n\n\ndim SmallPrimes(1000)\ndata 2, 3, 5, 7, 11, 13, 17, 19, 23, 29\ndata 31, 37, 41, 43, 47, 53, 59, 61, 67, 71\ndata 73, 79, 83, 89, 97, 101, 103, 107, 109, 113\ndata 127, 131, 137, 139, 149, 151, 157, 163, 167, 173\ndata 179, 181, 191, 193, 197, 199, 211, 223, 227, 229\ndata 233, 239, 241, 251, 257, 263, 269, 271, 277, 281\ndata 283, 293, 307, 311, 313, 317, 331, 337, 347, 349\ndata 353, 359, 367, 373, 379, 383, 389, 397, 401, 409\ndata 419, 421, 431, 433, 439, 443, 449, 457, 461, 463\ndata 467, 479, 487, 491, 499, 503, 509, 521, 523, 541\ndata 547, 557, 563, 569, 571, 577, 587, 593, 599, 601\ndata 607, 613, 617, 619, 631, 641, 643, 647, 653, 659\ndata 661, 673, 677, 683, 691, 701, 709, 719, 727, 733\ndata 739, 743, 751, 757, 761, 769, 773, 787, 797, 809\ndata 811, 821, 823, 827, 829, 839, 853, 857, 859, 863\ndata 877, 881, 883, 887, 907, 911, 919, 929, 937, 941\ndata 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013\ndata 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069\ndata 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151\ndata 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223\ndata 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291\ndata 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373\ndata 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451\ndata 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511\ndata 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583\ndata 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657\ndata 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733\ndata 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811\ndata 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889\ndata 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987\ndata 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053\ndata 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129\ndata 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213\ndata 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287\ndata 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357\ndata 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423\ndata 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531\ndata 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617\ndata 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687\ndata 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741\ndata 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819\ndata 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903\ndata 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999\ndata 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079\ndata 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181\ndata 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257\ndata 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331\ndata 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413\ndata 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511\ndata 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571\ndata 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643\ndata 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727\ndata 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821\ndata 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907\ndata 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989\ndata 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057\ndata 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139\ndata 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231\ndata 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297\ndata 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409\ndata 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493\ndata 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583\ndata 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657\ndata 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751\ndata 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831\ndata 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937\ndata 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003\ndata 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087\ndata 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179\ndata 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279\ndata 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387\ndata 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443\ndata 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521\ndata 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639\ndata 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693\ndata 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791\ndata 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857\ndata 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939\ndata 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053\ndata 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133\ndata 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221\ndata 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301\ndata 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367\ndata 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473\ndata 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571\ndata 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673\ndata 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761\ndata 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833\ndata 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917\ndata 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997\ndata 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103\ndata 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207\ndata 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297\ndata 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411\ndata 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499\ndata 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561\ndata 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643\ndata 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723\ndata 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829\ndata 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919\n\n\nprint \"Liberty Miller Rabin Demonstration\"\nprint \"Loading Small Primes\"\nfor i=1 to 1000: read x : SmallPrimes(i)=x :next :NoOfSmallPrimes=1000\nprint NoOfSmallPrimes;\" Primes Loaded\"\n\n'Prompt \"Enter number to test:\";resp$\n'x=val(resp$)\n'goto [Jump]\n\n\nFor i=1 to 11\n\n x=mersenne(i)\n\n\n t1=time$(\"ms\")\n [TryAnother]\n print\n\n iterations=0\n [Loop]\n iterations=iterations+1\n\n if MillerRabin(x,7)=1 then\n t2=time$(\"ms\")\n print \"Composite, found in \";t2-t1;\" milliseconds\"\n else\n t2=time$(\"ms\")\n print x;\" Probably Prime. Tested in \";t2-t1;\" milliseconds\"\n playwave \"tada.wav\", async\n end if\n print\n\nnext\n\nEND\n\n\nFunction GCD( m,n )\n' Find greatest common divisor with Extend Euclidian Algorithm\n' Knuth Vol 1 P.13 Algorithm E\n\nap =1 :b =1 :a =0 :bp =0: c =m :d =n\n\n[StepE2]\nq = int(c/d) :r = c-q*d\n\nif r<>0 then\n c=d :d=r :t=ap :ap=a :a=t-q*a :t=bp :bp=b :b=t-q*b\n 'print ap;\" \";b;\" \";a;\" \";bp;\" \";c;\" \";d;\" \";t;\" \";q\n goto [StepE2]\nend if\n\nGCD=a*m+b*n\n\n'print ap;\" \";b;\" \";a;\" \";bp;\" \";c;\" \";d;\" \";t;\" \";q\n\nEnd Function 'Extended Euclidian GCD\n\n function IsEven( x )\n if ( x MOD 2 )=0 then\n IsEven=1\n else\n IsEven=0\n end if\nend function\n\n\nfunction IsOdd( x )\n if ( x MOD 2 )=0 then\n IsOdd=0\n else\n IsOdd=1\n end if\nend function\n\n\nFunction FastExp(x, y, N)\n\n if (y=1) then 'MOD(x,N)\n FastExp=x-int(x/N)*N\n goto [ExitFunction]\n end if\n\n\n if ( y and 1) = 0 then\n\n dum1=y/2\n dum2=y-int(y/2)*2 'MOD(y,2)\n\n temp=FastExp(x,dum1,N)\n z=temp*temp\n FastExp=z-int(z/N)*N 'MOD(temp*temp,N)\n goto [ExitFunction]\n else\n\n dum1=y-1\n dum1=dum1/2\n temp=FastExp(x,dum1,N)\n dum2=temp*temp\n temp=dum2-int(dum2/N)*N 'MOD(dum2,N)\n\n z=temp*x\n FastExp=z-int(z/N)*N 'MOD(temp*x,N)\n goto [ExitFunction]\n end if\n [ExitFunction]\n\nend function\n\n\nFunction MillerRabin(n,b)\n\n'print \"Miller Rabin\"\n't1=time$(\"ms\")\n\n if IsEven(n) then\n MillerRabin=1\n goto [ExtFn]\n end if\n\n i=0\n [Loop]\n i=i+1\n if i>1000 then goto [Continue]\n if ( n MOD SmallPrimes(i) )=0 then\n MillerRabin=0\n goto [ExtFn]\n end if\n goto [Loop]\n [Continue]\n\n if GCD(n,b)>1 then\n MillerRabin=1\n goto [ExtFn]\n end if\n\n q=n-1\n\n t=0\n\n while (int(q) AND 1 )=0\n t=t+1\n q=int(q/2)\n wend\n\n\n r=FastExp(b, q, n)\n\n if ( r <> 1 ) then\n e=0\n while ( e < (t-1) )\n if ( r <> (n-1) ) then\n r=FastExp(r, r, n)\n else\n Exit While\n end if\n\n e=e+1\n wend\n [ExitLoop]\n end if\n\n\n if ( (r=1) OR (r=(n-1)) ) then\n MillerRabin=0\n else\n MillerRabin=1\n end if\n\n[ExtFn]\n\nEnd Function\n","language":"Liberty-BASIC"},{"code":" function MRIsPrime(n, k)\n -- If n is prime, returns true (without fail).\n -- If n is not prime, then returns false with probability ≥ 4^(-k), true otherwise.\n -- First, deal with 1 and multiples of 2.\n if n == 1 then\n return false\n elseif n == 2 then\n return true\n elseif n%2 == 0 then\n return false\n end\n -- Now n is odd and greater than 1.\n -- Find the unique expression n = 1 + t*2^h for n, where t is odd and h≥1.\n t = (n-1)/2\n h = 1\n while t%2 == 0 do\n t = t/2\n h = h + 1\n end\n for i = 1, k do\n -- Generate a random integer between 1 and n-1 inclusive.\n a = math.random(n-1)\n -- Test whether a is an element of the set L, and return false if not.\n if not IsInL(n, a, t, h) then\n return false\n end\n end\n -- All generated a were in the set L; thus with high probability, n is prime.\n return true\nend\n\nfunction IsInL(n, a, t, h)\n local b = PowerMod(a, t, n)\n if b == 1 then\n return true\n end\n for j = 0, h-1 do\n if b == n-1 then\n return true\n elseif b == 1 then\n return false\n end\n b = (b^2)%n\n end\n return false\nend\n\nfunction PowerMod(x, y, m)\n -- Computes x^y mod m.\n local z = 1\n while y > 0 do\n if y%2 == 0 then\n x, y, z = (x^2)%m, y//2, z\n else\n x, y, z = (x^2)%m, y//2, (x*z)%m\n end\n end\n return z\nend\n","language":"Lua"},{"code":"MillerRabin[n_,k_]:=Module[{d=n-1,s=0,test=True},While[Mod[d,2]==0 ,d/=2 ;s++]\nDo[\n a=RandomInteger[{2,n-1}]; x=PowerMod[a,d,n];\n If[x!=1,\n For[ r = 0, r < s, r++, If[x==n-1, Continue[]]; x = Mod[x*x, n]; ];\n If[ x != n-1, test=False ];\n ];\n,{k}];\nPrint[test] ]\n","language":"Mathematica"},{"code":"MillerRabin[17388,10]\n->False\n","language":"Mathematica"},{"code":"/* Miller-Rabin algorithm is builtin, see function primep. Here is another implementation */\n\n\n/* find highest power of p, p^s, that divide n, and return s and n / p^s */\n\nfacpow(n, p) := block(\n [s: 0],\n while mod(n, p) = 0 do (s: s + 1, n: quotient(n, p)),\n [s, n]\n)$\n\n/* check whether n is a strong pseudoprime to base a; s and d are given by facpow(n - 1, 2) */\n\nsppp(n, a, s, d) := block(\n [x: power_mod(a, d, n), q: false],\n if x = 1 or x = n - 1 then true else (\n from 2 thru s do (\n x: mod(x * x, n),\n if x = 1 then return(q: false) elseif x = n - 1 then return(q: true)\n ),\n q\n )\n)$\n\n/* Miller-Rabin primality test. For n < 341550071728321, the test is deterministic;\n for larger n, the number of bases tested is given by the option variable\n primep_number_of_tests, which is used by Maxima in primep. The bound for deterministic\n test is also the same as in primep. */\n\nmiller_rabin(n) := block(\n [v: [2, 3, 5, 7, 11, 13, 17], s, d, q: true, a],\n if n < 19 then member(n, v) else (\n [s, d]: facpow(n - 1, 2),\n if n < 341550071728321 then ( /* see http://oeis.org/A014233 */\n for a in v do (\n if not sppp(n, a, s, d) then return(q: false)\n ),\n q\n ) else (\n thru primep_number_of_tests do (\n a: 2 + random(n - 3),\n if not sppp(n, a, s, d) then return(q: false)\n ),\n q\n )\n )\n)$\n","language":"Maxima"},{"code":"%----------------------------------------------------------------------%\n:- module primality.\n\n:- interface.\n\n:- import_module integer.\n:- pred is_prime(integer::in, integer::out) is multi.\n\n%----------------------------------------------------------------------%\n:- implementation.\n\n:- import_module bool, int, list, math, require, string.\n\n%----------------------------------------------------------------------%\n % is_prime/2 implements a Miller-Rabin primality test, is\n % deterministic for N < 3.415e+14, and is probabilistic for\n % larger N. Returns integer(0) if not prime, integer(1) if prime,\n % and -integer(1) if fails.\n\n% :- pred is_prime(integer::in, integer::out) is multi.\n\t\nis_prime(N, P) :-\n\tN < integer(2), P = integer(0).\nis_prime(N, P) :-\n\tN = integer(2), P = integer(1).\nis_prime(N, P) :-\n\tN = integer(3), P = integer(1).\nis_prime(N, P) :- %% even numbers > 3: false\n\tN > integer(3),\n\t(N mod integer(2)) = integer(0),\n\tP = integer(0).\n\t\t%%-------------deterministic--------\nis_prime(N, P) :- %% 3 < odd number < 3.415e+14\n\tN > integer(3),\n\t(N mod integer(2)) = integer(1),\n\tN < integer(341550071728321),\n\tdeterministic_witnesses(N, DList),\n\tis_mr_prime(N, DList, R),\n\tP = R.\n\t\t%%-------------probabilistic--------\nis_prime(N, P) :- %% 3.415e+14 =< odd number\n\tN > integer(3),\n\t(N mod integer(2)) = integer(1),\n\tN >= integer(341550071728321),\n\trandom_witnesses(N, 20, RList),\n\tis_mr_prime(N, RList, R),\n\tP = R.\nis_prime(_N, P) :- P = -integer(1).\n\t\n%----------------------------------------------------------------------%\n% returns list of deterministic witnesses\n\n:- pred deterministic_witnesses(integer::in,\n list(integer)::out) is multi.\n\ndeterministic_witnesses(N, L) :- N < integer(1373653),\n\tL = [integer(2), integer(3)].\ndeterministic_witnesses(N, L) :- N < integer(9080191),\n\tL = [integer(31), integer(73)].\ndeterministic_witnesses(N, L) :- N < integer(25326001),\n\tL = [integer(2), integer(3), integer(5)].\ndeterministic_witnesses(N, L) :- N < integer(3215031751),\n\tL = [integer(2), integer(3), integer(5), integer(7)].\ndeterministic_witnesses(N, L) :- N < integer(4759123141),\n\tL = [integer(2), integer(7), integer(61)].\ndeterministic_witnesses(N, L) :- N < integer(1122004669633),\n\tL = [integer(2), integer(13), integer(23), integer(1662803)].\ndeterministic_witnesses(N, L) :- N < integer(2152302898747),\n\tL = [integer(2), integer(3), integer(5), integer(7), integer(11)].\ndeterministic_witnesses(N, L) :- N < integer(3474749660383),\n\tL = [integer(2), integer(3), integer(5), integer(7), integer(11),\n integer(13)].\ndeterministic_witnesses(N, L) :- N < integer(341550071728321),\n\tL = [integer(2), integer(3), integer(5), integer(7),\n\t integer(11), integer(13), integer(17)].\ndeterministic_witnesses(_N, L) :- L = []. %% signals failure\n\n%----------------------------------------------------------------------%\n\t%% random_witnesses/3 receives an integer, X, an int, K, and\n\t%% returns a list, P, of K pseudo-random integers in a range\n\t%% 1 to X-1.\n\t\n:- pred random_witnesses(integer::in, int::in,\n list(integer)::out) is det.\n\nrandom_witnesses(X, K, P) :-\n\tA = integer(6364136223846793005),\n\tB = integer(1442695040888963407),\n\tC = X - integer(2),\n\trw_loop(X, A, B, C, K, [], P).\n\t\n:- pred rw_loop(integer::in, integer::in, integer::in, integer::in,\n int::in, list(integer)::in, list(integer)::out) is det.\n\t\t\t\t\t\nrw_loop(X, A, B, C, K, L, P) :-\n\tX1 = (((X * A) + B) mod C) + integer(1),\n\t( if K = 0 then P = L\n\t else rw_loop(X1, A, B, C, K-1, [X1|L], P)\n\t).\n\n%----------------------------------------------------------------------%\n\t% is_mr_prime/2 receives integer N and list As and returns true if\n\t% N is probably prime, and false otherwise\n\t\n:- pred is_mr_prime(integer::in, list(integer)::in, integer::out) is nondet.\n\nis_mr_prime(N, As, R) :-\n find_ds(N, L),\n L = [D|T],\n T = [S|_],\n outer_loop(N, As, D, S, R).\n\n:- pred outer_loop(integer::in, list(integer)::in, integer::in,\n integer::in, integer::out) is nondet.\n\t\t\t\t\t\t\t\nouter_loop(N, As, D, S, R) :-\n As = [A|At],\n Base = powm(A, D, N), %% = A^D mod N\n inner_loop(Base, N, integer(0), S, U),\n\t( if U = integer(0) then R = integer(0)\n\t else ( if At = [] then R = integer(1)\n else outer_loop(N, At, D, S, R)\n )\n\t).\n\n:- pred inner_loop(integer::in, integer::in, integer::in,\n integer::in, integer::out) is multi.\n\t\t\t\t\t\t\t\ninner_loop(Base, N, Loop, S, U) :-\n Next_Base = (Base * Base) mod N,\n Next_Loop = Loop + integer(1),\n\t( if Loop = integer(0) then\n\t \t ( if Base = integer(1) then U = integer(1) % true\n else if Base = N - integer(1) then U = integer(1) % true\n else if Next_Loop = S then U = integer(0) % false\n else inner_loop(Next_Base, N, Next_Loop, S, U)\n )\n\t else if Base = N - integer(1) then U = integer(1) % true\n\t else if Next_Loop = S then U = integer(0) % false\n\t else inner_loop(Next_Base, N, Next_Loop, S, U)\n\t).\n\n%----------------------------------------------------------------------%\n\t% find_ds/2 receives odd integer N\n\t% and returns [D, S] such that N-1 = 2^S * D\n\t\n:- pred find_ds(integer::in, list(integer)::out) is multi.\n\nfind_ds(N, L) :-\n A = N - integer(1),\n find_ds1(A, integer(0), L).\n\n:- pred find_ds1(integer::in, integer::in, list(integer)::out) is multi.\n\nfind_ds1(D, S, L) :-\n\tD mod integer(2) = integer(0),\n\tP = D div integer(2),\n\tQ = S + integer(1),\n\tfind_ds1(P, Q, L).\nfind_ds1(D, S, L) :-\n\tL = [D, S].\n\t\n%----------------------------------------------------------------------%\n:- func powm(integer, integer, integer) = integer.\n\n\t% computes A^D mod N\n\npowm(A, D, N) =\t\t\t\n ( if D = integer(0) then integer(1)\n else ( if (D mod integer(2)) = integer(0) then\n (integer.pow(powm(A, (D div integer(2)), N),\n integer(2))) mod N\n else (A * powm(A, D - integer(1), N)) mod N\n )\n\t).\n\n%----------------------------------------------------------------------%\n:- end_module primality.\n\n% A means of testing the predicate is_prime/2\n%----------------------------------------------------------------------%\n\n:- module test_is_prime.\n\n:- interface.\n\n:- import_module io.\n:- pred main(io::di, io::uo) is cc_multi.\n\n%----------------------------------------------------------------------%\n\n:- implementation.\n\n:- import_module bool, char, int, integer, list, math, require, string.\n:- import_module primality.\n\n%----------------------------------------------------------------------%\n % TEST THE IS_PRIME PREDICATE\n % $ ./test_is_prime <integer>\n %---------------------------------------------%\n\nmain(!IO) :-\n command_line_arguments(Args, !IO),\n filter(is_all_digits, Args, CleanArgs),\n Arg1 = list.det_index0(CleanArgs, 0),\n M = integer.det_from_string(Arg1),\n\tis_prime(M,P),\n\tio.format(\" is_prime(%s) = \", [s(integer.to_string(M))], !IO),\n\t( if P = integer(0) then io.write_string(\"false.\\n\", !IO)\n\t else if P = integer(1) then io.write_string(\"true.\\n\", !IO)\n\t else if P = -integer(1) then\n io.write_string(\"N fails all tests.\\n\", !IO)\n\t else io.write_string(\"Has reported neither true nor false\n nor any error condition.\\n\", !IO)\n\t).\n\t\n%----------------------------------------------------------------------%\n:- end_module test_is_prime.\n","language":"Mercury"},{"code":"## Nim currently doesn't have a BigInt standard library\n## so we translate the version from Go which uses a\n## deterministic approach, which is correct for all\n## possible values in uint32.\n\nproc isPrime*(n: uint32): bool =\n # bases of 2, 7, 61 are sufficient to cover 2^32\n case n\n of 0, 1: return false\n of 2, 7, 61: return true\n else: discard\n\n var\n nm1 = n-1\n d = nm1.int\n s = 0\n n = n.uint64\n\n while d mod 2 == 0:\n d = d shr 1\n s += 1\n\n for a in [2, 7, 61]:\n var\n x = 1.uint64\n p = a.uint64\n dr = d\n\n while dr > 0:\n if dr mod 2 == 1:\n x = x * p mod n\n p = p * p mod n\n dr = dr shr 1\n\n if x == 1 or x.uint32 == nm1:\n continue\n\n var r = 1\n while true:\n if r >= s:\n return false\n x = x * x mod n\n if x == 1:\n return false\n if x.uint32 == nm1:\n break\n r += 1\n\n return true\n\nproc isPrime*(n: int32): bool =\n ## Overload for int32\n n >= 0 and n.uint32.isPrime\n\nwhen isMainModule:\n const primeNumber1000 = 7919 # source: https://en.wikipedia.org/wiki/List_of_prime_numbers\n var\n i = 0u32\n numberPrimes = 0\n while true:\n if isPrime(i):\n if numberPrimes == 999:\n break\n numberPrimes += 1\n i += 1\n\n assert i == primeNumber1000\n assert isPrime(2u32)\n assert isPrime(31u32)\n assert isPrime(37u32)\n assert isPrime(1123u32)\n assert isPrime(492366587u32)\n assert isPrime(1645333507u32)\n","language":"Nim"},{"code":"# Compile as: $ nim c -d:release mrtest.nim\n# Run using: $ ./mrtest\n\nimport math # for gcd and mod\nimport bitops # for countTrailingZeroBits\nimport strutils, typetraits # for number input\nimport times, os # for timing code execution\n\nproc addmod*[T: SomeInteger](a, b, modulus: T): T =\n ## Modular addition\n let a_m = if a < modulus: a else: a mod modulus\n if b == 0.T: return a_m\n let b_m = if b < modulus: b else: b mod modulus\n\n # Avoid doing a + b that could overflow here\n let b_from_m = modulus - b_m\n if a_m >= b_from_m: return a_m - b_from_m\n return a_m + b_m # safe to add here; a + b < modulus\n\nproc mulmod*[T: SomeInteger](a, b, modulus: T): T =\n ## Modular multiplication\n var a_m = if a < modulus: a else: a mod modulus\n var b_m = if b < modulus: b else: b mod modulus\n if b_m > a_m: swap(a_m, b_m)\n while b_m > 0.T:\n if (b_m and 1) == 1: result = addmod(result, a_m, modulus)\n a_m = (a_m shl 1) - (if a_m >= (modulus - a_m): modulus else: 0)\n b_m = b_m shr 1\n\nproc expmod*[T: SomeInteger](base, exponent, modulus: T): T =\n ## Modular exponentiation\n result = 1 # (exp 0 = 1)\n var (e, b) = (exponent, base)\n while e > 0.T:\n if (e and 1) == 1: result = mulmod(result, b, modulus)\n e = e shr 1\n b = mulmod(b, b, modulus)\n\n# Returns true if +self+ passes Miller-Rabin Test on witnesses +b+\nproc miller_rabin_test[T: SomeInteger](num: T, witnesses: seq[uint64]): bool =\n var d = num - 1\n let (neg_one_mod, n) = (d, d)\n d = d shr countTrailingZeroBits(d) # suck out factors of 2 from d\n for b in witnesses: # do M-R test with each witness base\n if b.T mod num == 0: continue # **skip base if a multiple of input**\n var s = d\n var y = expmod(b.T, d, num)\n while s != n and y != 1 and y != neg_one_mod:\n y = mulmod(y, y, num)\n s = s shl 1\n if y != neg_one_mod and (s and 1) != 1: return false\n true\n\nproc selectWitnesses[T: SomeInteger](num: T): seq[uint64] =\n ## Best known deterministic witnesses for given range and number of bases\n ## https://miller-rabin.appspot.com/\n ## https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test\n if num < 341_531u:\n result = @[9345883071009581737u64]\n elif num < 1_050_535_501u:\n result = @[336781006125u64, 9639812373923155u64]\n elif num < 350_269_456_337u:\n result = @[4230279247111683200u64, 14694767155120705706u64, 16641139526367750375u64]\n elif num < 55_245_642_489_451u:\n result = @[2u64, 141889084524735u64, 1199124725622454117u64, 11096072698276303650u64]\n elif num < 7_999_252_175_582_851u:\n result = @[2u64, 4130806001517u64, 149795463772692060u64, 186635894390467037u64, 3967304179347715805u64]\n elif num < 585_226_005_592_931_977u:\n result = @[2u64, 123635709730000u64, 9233062284813009u64, 43835965440333360u64, 761179012939631437u64, 1263739024124850375u64]\n elif num.uint64 < 18_446_744_073_709_551_615u64:\n result = @[2u64, 325, 9375, 28178, 450775, 9780504, 1795265022]\n else:\n result = @[2u64, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\n\nproc primemr*[T: SomeInteger](n: T): bool =\n let primes = @[2u64, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\n if n <= primes[^1].T: return (n in primes) # for n <= primes.last\n let modp47 = 614889782588491410u # => primes.product, largest < 2^64\n if gcd(n, modp47) != 1: return false # eliminates 86.2% of all integers\n let witnesses = selectWitnesses(n)\n miller_rabin_test(n, witnesses)\n\necho \"\\nprimemr?\"\necho(\"n = \", 1645333507u)\nvar te = epochTime()\necho primemr 1645333507u\necho (epochTime()-te).formatFloat(ffDecimal, 6)\n\necho \"\\nprimemr?\"\necho(\"n = \", 2147483647u)\nte = epochTime()\necho primemr 2147483647u\necho (epochTime()-te).formatFloat(ffDecimal, 6)\n\necho \"\\nprimemr?\"\necho(\"n = \", 844674407370955389u)\nte = epochTime()\necho primemr 844674407370955389u\necho (epochTime()-te).formatFloat(ffDecimal, 6)\n\necho \"\\nprimemr?\"\necho(\"n = \", 1844674407370954349u)\nte = epochTime()\necho primemr 1844674407370954349u\necho (epochTime()-te).formatFloat(ffDecimal, 6)\n\necho \"\\nprimemr?\"\necho(\"n = \", 1844674407370954351u)\nte = epochTime()\necho primemr 1844674407370954351u\necho (epochTime()-te).formatFloat(ffDecimal, 6)\n\necho \"\\nprimemr?\"\necho(\"n = \", 9223372036854775783u)\nte = epochTime()\necho primemr 9223372036854775783u\necho (epochTime()-te).formatFloat(ffDecimal, 6)\n\necho \"\\nprimemr?\"\necho(\"n = \", 9241386435364257883u64)\nte = epochTime()\necho primemr 9241386435364257883u64\necho (epochTime()-te).formatFloat(ffDecimal, 6)\n\necho \"\\nprimemr?\"\necho(\"n = \", 18446744073709551533u64, \", is largest prime < 2^64\")\nte = epochTime()\necho 18446744073709551533u64.primemr\necho (epochTime()-te).formatFloat(ffDecimal, 6)\n\necho \"\\nprimemr?\"\nlet num = 5_000_000u # => 348_513 primes\nvar primes: seq[uint] = @[]\necho(\"find primes < \", num)\nte = epochTime()\nfor n in 0u..num:\n if n.primemr: primes.add(n)\n stdout.write(\"\\r\",((float64(n) / float64(num))*100).formatFloat(ffDecimal, 1), \"%\")\necho(\"\\nnumber of primes < \",num, \" are \", primes.len)\necho (epochTime()-te).formatFloat(ffDecimal, 6)\n","language":"Nim"},{"code":"(* Translated from the wikipedia pseudo-code *)\nlet miller_rabin n ~iter:k =\n (* return r and d where n = 2^r*d (from scheme implementation) *)\n let get_rd n =\n let rec loop r d =\n (* not even *)\n if Z.(equal (logand d one) one) then\n (r,d)\n else\n loop Z.(r + one) Z.(div d ~$2)\n in\n loop Z.zero n\n in\n let single_miller n r d =\n (* (random (n - 4)) + 2 *)\n let a = Bigint.to_zarith_bigint\n Bigint.((random ((of_zarith_bigint n) - (of_int 4))) + (of_int 2))\n in\n let x = Z.(powm a d n) in\n if Z.(equal x ~$1) || Z.(equal x (n - ~$1)) then true\n else\n let rec loop i x =\n if Z.(equal ~$i (r - ~$1)) then false\n else\n let x = Z.(powm x ~$2 n) in\n if Z.(equal x (n - ~$1)) then true\n else loop (i + 1) x\n in\n loop 0 x\n in\n let n = Z.abs n in\n if Z.(equal n one) then false\n else if Z.(equal (logand n one) zero) then false\n else if Z.(equal (n mod ~$3) zero) then false\n else\n let r, d = get_rd Z.(n - one) in\n let rec loop i bool =\n if i = k then bool\n else loop (i + 1) (bool && single_miller n r d)\n in\n loop 0 true\n","language":"Nim"},{"code":"%--------------------------------------------------------------------------%\n% module: Primality\n% file: Primality.oz\n% version: 17 DEC 2014 @ 6:50AM\n%--------------------------------------------------------------------------%\n\ndeclare\n%--------------------------------------------------------------------------%\n\nfun {IsPrime N}\t\t\t% main interface of module\n\tif N < 2 then false\n\telseif N < 4 then true\n\telseif (N mod 2) == 0 then false\n\telseif N < 341330071728321 then {IsMRprime N {DetWit N}}\n\telse {IsMRprime N {ProbWit N 20}}\n\tend\nend\n%--------------------------------------------------------------------------%\n\nfun {DetWit N}\t\t\t% deterministic witnesses\n\tif N < 1373653 then [2 3]\n\telseif N < 9080191 then [31 73]\n\telseif N < 25326001 then [2 3 5]\n\telseif N < 3215031751 then [2 3 5 7]\n\telseif N < 4759123141 then [2 7 61]\n\telseif N < 1122004669633 then [2 13 23 1662803]\n\telseif N < 2152302898747 then [2 3 5 7 11]\n\telseif N < 3474749660383 then [2 3 5 7 11 13]\n\telseif N < 341550071728321 then [2 3 5 7 11 13 17]\n\telse nil\n\tend\nend\n%--------------------------------------------------------------------------%\n\nfun {ProbWit N K}\t\t% probabilistic witnesses\n\tlocal A B C in\n\tA = 6364136223846793005\n\tB = 1442695040888963407\n\tC = N - 2\n\t{RWloop N A B C K nil}\n\tend\nend\n\nfun {RWloop N A B C K L}\n\tlocal N1 in\n\t\tN1 = (((N * A) + B) mod C) + 1\n\t\tif K == 0 then L\n\t\telse {RWloop N1 A B C (K - 1) N1|L}\n\t\tend\n\tend\nend\n%--------------------------------------------------------------------------%\n\nfun {IsMRprime N As}\t% the Miller-Rabin algorithm\t\n\tlocal D S T Ts in\n\t{FindDS N} = D|S\n\t{OuterLoop N As D S}\n\tend\nend\n\nfun {OuterLoop N As D S}\n\tlocal A At Base C in\n\tAs = A|At\n\tBase = {Powm A D N}\n\tC = {InnerLoop Base N 0 S}\n\tif {Not C} then false\n\telseif {And C (At == nil)} then true\n\telse {OuterLoop N At D S}\n\tend\n\tend\nend\n\t\t\t\t\t\t\t\nfun {InnerLoop Base N Loop S}\n\tlocal NextBase NextLoop in\n\tNextBase = (Base * Base) mod N\n\tNextLoop = Loop + 1\n\t if {And (Loop == 0) (Base == 1)} then true\n\t elseif Base == (N - 1) then true\n\t elseif NextLoop == S then false\n\t else {InnerLoop NextBase N NextLoop S}\n\t end\n\tend\nend\n%--------------------------------------------------------------------------%\n\nfun {FindDS N}\n\t{FindDS1 (N - 1) 0}\nend\n\nfun {FindDS1 D S}\n\tif (D mod 2 == 0) then {FindDS1 (D div 2) (S + 1)}\n\telse D|S\n\tend\nend\n%--------------------------------------------------------------------------%\n\t\nfun {Powm A D N} \t\t% returns (A ^ D) mod N\n\tif D == 0 then 1\n\telseif (D mod 2) == 0 then {Pow {Powm A (D div 2) N} 2} mod N\n\telse (A * {Powm A (D - 1) N}) mod N\n\tend\nend\n%--------------------------------------------------------------------------%\t\n% end_module Primality\n","language":"Oz"},{"code":"MR(n,k)=ispseudoprime(n,k);\n","language":"PARI-GP"},{"code":"sprp(n,b)={\n\tmy(s = valuation(n-1, 2), d = Mod(b, n)^(n >> s));\n\tif (d == 1, return(1));\n\tfor(i=1,s-1,\n\t\tif (d == -1, return(1));\n\t\td = d^2;\n\t);\n\td == -1\n};\n\nMR(n,k)={\n for(i=1,k,\n if(!sprp(n,random(n-2)+2), return(0))\n );\n 1\n};\n","language":"PARI-GP"},{"code":"A006945=[9, 2047, 1373653, 25326001, 3215031751, 2152302898747, 3474749660383, 341550071728321, 341550071728321, 3825123056546413051];\nMiller(n)={\n if (n%2 == 0, return(n == 2)); \\\\ Handle even numbers\n if (n < 3, return(0)); \\\\ Handle 0, 1, and negative numbers\n\n if (n < 1<<64,\n \\\\ Feitsma\n for(i=1,#A006945,\n if (n < A006945[i], return(1));\n if(!sprp(n, prime(i)), return(0));\n );\n sprp(n,31)&sprp(n,37)\n ,\n \\\\ Miller + Bach\n for(b=2,2*log(n)^2,\n if(!sprp(n, b), return(0))\n );\n 1\n )\n};\n","language":"PARI-GP"},{"code":"use bigint try => 'GMP';\n\nsub is_prime {\n my ($n, $k) = @_;\n return 1 if $n == 2;\n return 0 if $n < 2 or $n % 2 == 0;\n\n my $d = $n - 1;\n my $s = 0;\n\n while (!($d % 2)) {\n $d /= 2;\n $s++;\n }\n\n LOOP: for (1 .. $k) {\n my $a = 2 + int(rand($n - 2));\n\n my $x = $a->bmodpow($d, $n);\n next if $x == 1 or $x == $n - 1;\n\n for (1 .. $s - 1) {\n $x = ($x * $x) % $n;\n return 0 if $x == 1;\n next LOOP if $x == $n - 1;\n }\n return 0;\n }\n return 1;\n}\n\nprint join \", \", grep { is_prime $_, 10 } (1 .. 1000);\n","language":"Perl"},{"code":"use ntheory qw/is_strong_pseudoprime miller_rabin_random/;\nsub is_prime_mr {\n my $n = shift;\n # If 32-bit, we can do this with 3 bases.\n return is_strong_pseudoprime($n, 2, 7, 61) if ($n >> 32) == 0;\n # If 64-bit, 7 is all we need.\n return is_strong_pseudoprime($n, 2, 325, 9375, 28178, 450775, 9780504, 1795265022) if ($n >> 64) == 0;\n # Otherwise, perform a number of random base tests, and the result is a probable prime test.\n return miller_rabin_random($n, 20);\n}\n","language":"Perl"},{"code":"use Math::Primality qw/is_strong_pseudoprime/;\nsub is_prime_mr {\n my $n = shift;\n return 0 if $n < 2;\n for (2,3,5,7,11,13,17,19,23,29,31,37) {\n return 0 unless $n <= $_ || is_strong_pseudoprime($n,$_);\n }\n 1;\n}\nfor (1..100) { say if is_prime_mr($_) }\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;\">powermod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- calculate a^n%mod</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</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> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">p</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;\">if</span>\n <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">n</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;\">2</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;\">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;\">witness</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- n-1 = 2^s * d with d odd by factoring powers of 2 from n-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;\">a</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">x</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">powermod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</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;\">y</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">s</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">w</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">y</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;\">x</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;\">y</span> <span style=\"color: #0000FF;\">==</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">and</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;\">x</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;\">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: #000000;\">x</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">y</span>\n <span style=\"color: #000000;\">w</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;\">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>\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: #008080;\">return</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;\">is_prime_mr</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">mod</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;\">0</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">or</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>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">mod</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;\">0</span> <span style=\"color: #008080;\">and</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: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">3</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;\">atom</span> <span style=\"color: #000000;\">d</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;\">2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</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;\">while</span> <span style=\"color: #7060A8;\">and_bits</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><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">/=</span> <span style=\"color: #000000;\">2</span>\n <span style=\"color: #000000;\">s</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\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">a</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\"><</span> <span style=\"color: #000000;\">1373653</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">a</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;\">3</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\"><</span> <span style=\"color: #000000;\">9080191</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">31</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">73</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">elsif</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: #008080;\">and</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\"><</span> <span style=\"color: #000000;\">94910107</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">machine_bits</span><span style=\"color: #0000FF;\">()=</span><span style=\"color: #000000;\">64</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\"><</span> <span style=\"color: #000000;\">4295041217</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">a</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;\">7</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">61</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">else</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;\">\"limits exceeded\\n\"</span><span style=\"color: #0000FF;\">)</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;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">witness</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;\">d</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">a</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: #000000;\">999983</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">999809</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">999727</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">52633</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">60787</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">999999</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">999995</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">999991</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;\">tests</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;\">\"%d is %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: #008000;\">\"composite\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"prime\"</span><span style=\"color: #0000FF;\">}[</span><span style=\"color: #000000;\">is_prime_mr</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;\">1</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">-- this is transpiled (then manually copied) to mpz_prime() in mpfr.js:</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">modp47</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">NULL</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">w</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">witness_ranges</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">mpz_prime_mr</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- deterministic to 3,317,044,064,679,887,385,961,981</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">primes</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;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">13</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">17</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">19</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">23</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">29</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">31</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">37</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">41</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">43</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">47</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">mpz_cmp_si</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">primes</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: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">mpz_get_integer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">primes</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;\">modp47</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">NULL</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">modp47</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"614_889_782_588_491_410\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- === product(primes), largest < 2^64</span>\n <span style=\"color: #000000;\">w</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000080;font-style:italic;\">-- Best known deterministic witnesses for given range and set of bases\n -- https://miller-rabin.appspot.com/\n -- https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test</span>\n <span style=\"color: #000000;\">witness_ranges</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #008000;\">\"341_531\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"9345883071009581737\"</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"1_050_535_501\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"336781006125\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"9639812373923155\"</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"350_269_456_337\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"4230279247111683200\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"14694767155120705706\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"16641139526367750375\"</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"55_245_642_489_451\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"2\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"141889084524735\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"1199124725622454117\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"11096072698276303650\"</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"7_999_252_175_582_851\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"2\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"4130806001517\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"149795463772692060\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"186635894390467037\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"3967304179347715805\"</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"585_226_005_592_931_977\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"2\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"123635709730000\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"9233062284813009\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"43835965440333360\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"761179012939631437\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"1263739024124850375\"</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"18_446_744_073_709_551_615\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"2\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"325\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"9375\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"28178\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"450775\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"9780504\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"1795265022\"</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"318_665_857_834_031_151_167_461\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"2\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"3\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"5\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"7\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"11\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"13\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"17\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"19\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"23\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"29\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"31\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"37\"</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"3_317_044_064_679_887_385_961_981\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"2\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"3\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"5\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"7\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"11\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"13\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"17\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"19\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"23\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"29\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"31\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"37\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"41\"</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;\">witness_ranges</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">witness_ranges</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: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">witness_ranges</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;\">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;\">witness_ranges</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: #000000;\">witness_ranges</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> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">witness_ranges</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;\">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;\">if</span>\n <span style=\"color: #7060A8;\">mpz_gcd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">modp47</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">mpz_cmp_si</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: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">false</span> <span style=\"color: #000080;font-style:italic;\">-- eliminates 86.2% of all integers</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000080;font-style:italic;\">--\n -- Choose input witness bases:\n --</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">witnesses</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">mpz_cmp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">witness_ranges</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;\">then</span>\n <span style=\"color: #000000;\">witnesses</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;\">k</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;\">k</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">mpz_sub_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</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>\n <span style=\"color: #7060A8;\">mpz_rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- a := 0..a-1 (cf rand(n) yields 1..n)</span>\n <span style=\"color: #7060A8;\">mpz_add_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">witnesses</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;\">a</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">else</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;\">witness_ranges</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">mpz_cmp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">witness_ranges</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: #008080;\">then</span>\n <span style=\"color: #000000;\">witnesses</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">witness_ranges</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>\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;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">mpz_sub_ui</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;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">nm1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init_set</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- d >>= 4 while (d & 0xf) == 0 # suck out factors of 2\n -- (d >>= (d & 3)^2; d >>= (d & 1)^1) if d.even? # 4 bits at a time</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">mpz_even</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">mpz_fdiv_q_2exp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</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;\">end</span> <span style=\"color: #008080;\">while</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;\">witnesses</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">witnesses</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: #008080;\">not</span> <span style=\"color: #7060A8;\">mpz_divisible_p</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000080;font-style:italic;\">-- skip multiples of input</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init_set</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">y</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">mpz_powm</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">b</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: #000080;font-style:italic;\">-- y := b^d % p</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">mpz_cmp_si</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;\">0</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #7060A8;\">mpz_cmp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">nm1</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #7060A8;\">mpz_cmp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">nm1</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">mpz_powm_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y</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;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- y := y^2 mod p</span>\n <span style=\"color: #7060A8;\">mpz_mul_2exp</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;\">1</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- s << 1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">mpz_cmp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">nm1</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;\">mpz_even</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">false</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;\">end</span> <span style=\"color: #008080;\">for</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","language":"Phix"},{"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: #004080;\">mpfr</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"9223372036854774808\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">c</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;\">4808</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">5808</span> <span style=\"color: #008080;\">do</span> <span style=\"color: #000080;font-style:italic;\">-- (b ends thus)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">mpz_prime</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">c</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;\">\" %s%s\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">mpz_get_str</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #7060A8;\">mod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</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: #7060A8;\">mpz_add_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</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>\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;\">\"\\n%d primes found\\n\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</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: #008000;\">\"4547337172376300111955330758342147474062293202868155909489\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"4547337172376300111955330758342147474062293202868155909393\"</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;\">tests</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">mpz_set_str</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</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;\">string</span> <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">mpz_prime</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">)?</span><span style=\"color: #008000;\">\"is prime\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">\"is composite\"</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\\n\\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;\">p</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;\">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;\">1300</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">mpz_ui_pow_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</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>\n <span style=\"color: #7060A8;\">mpz_sub_si</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</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>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">mpz_prime</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</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;\">\"2^%d-1 is prime\\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;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"<?php\nfunction is_prime($n, $k) {\n if ($n == 2)\n return true;\n if ($n < 2 || $n % 2 == 0)\n return false;\n\n $d = $n - 1;\n $s = 0;\n\n while ($d % 2 == 0) {\n $d /= 2;\n $s++;\n }\n\n for ($i = 0; $i < $k; $i++) {\n $a = rand(2, $n-1);\n\n $x = bcpowmod($a, $d, $n);\n if ($x == 1 || $x == $n-1)\n continue;\n\n for ($j = 1; $j < $s; $j++) {\n $x = bcmod(bcmul($x, $x), $n);\n if ($x == 1)\n return false;\n if ($x == $n-1)\n continue 2;\n }\n return false;\n }\n return true;\n}\n\nfor ($i = 1; $i <= 1000; $i++)\n if (is_prime($i, 10))\n echo \"$i, \";\necho \"\\n\";\n?>\n","language":"PHP"},{"code":"(de longRand (N)\n (use (R D)\n (while (=0 (setq R (abs (rand)))))\n (until (> R N)\n (unless (=0 (setq D (abs (rand))))\n (setq R (* R D)) ) )\n (% R N) ) )\n\n(de **Mod (X Y N)\n (let M 1\n (loop\n (when (bit? 1 Y)\n (setq M (% (* M X) N)) )\n (T (=0 (setq Y (>> 1 Y)))\n M )\n (setq X (% (* X X) N)) ) ) )\n\n(de _prim? (N D S)\n (use (A X R)\n (while (> 2 (setq A (longRand N))))\n (setq R 0 X (**Mod A D N))\n (loop\n (T\n (or\n (and (=0 R) (= 1 X))\n (= X (dec N)) )\n T )\n (T\n (or\n (and (> R 0) (= 1 X))\n (>= (inc 'R) S) )\n NIL )\n (setq X (% (* X X) N)) ) ) )\n\n(de prime? (N K)\n (default K 50)\n (and\n (> N 1)\n (bit? 1 N)\n (let (D (dec N) S 0)\n (until (bit? 1 D)\n (setq\n D (>> 1 D)\n S (inc S) ) )\n (do K\n (NIL (_prim? N D S))\n T ) ) ) )\n","language":"PicoLisp"},{"code":"int pow_mod(int m, int i,int mod){\n\tint x=1,y=m%mod;\n\twhile(i){\n\t\tif(i&1) x = x*y%mod;\n\t\ty = y*y%mod;\n\t\ti>>=1;\n\t}\n\treturn x;\n}\nbool mr_pass(int a, int s, int d, int n){\n int a_to_power = pow_mod(a, d, n);\n if(a_to_power == 1)\n return true;\n for(int i = 0; i< s - 1; i++){\n if(a_to_power == n - 1)\n return true;\n a_to_power = (a_to_power * a_to_power) % n;\n }\n return a_to_power == n - 1;\n}\n\nint is_prime(int n){\n\tarray(int) prime ;\n\tprime = ({2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 47, 53, 59, 61, 67, 71, 79, 83, 89, 97, 101, 103, 107, 109, 113});\n int idx = search( prime, n);\n if( n < 113 && n == prime[idx] ){\n return 1;\n }\n if(n < 2047) prime = ({2, 3});\n if(n < 1373653)prime = ({2, 3});\n if(n < 9080191)prime = ({31, 73});\n if(n < 25326001)prime = ({2, 3, 5});\n if(n < 3215031751)prime = ({2, 3, 5, 7});\n if(n < 4759123141)prime = ({2, 7, 61});\n if(n < 1122004669633)prime = ({2, 13, 23, 1662803});\n if(n < 2152302898747)prime = ({2, 3, 5, 7, 11});\n if(n < 3474749660383)prime = ({2, 3, 5, 7, 11, 13});\n if(n < 341550071728321)prime = ({2, 3, 5, 7, 11, 13, 17});\n if(n < 3825123056546413051)prime = ({2, 3, 5, 7, 11, 13, 17, 19, 23});\n if(n < 18446744073709551616)prime = ({2, 3, 5, 7, 11, 13, 17, 19, 23, 29});\n if(n < 318665857834031151167461)prime = ({2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31});\n if(n < 3317044064679887385961981)prime = ({2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37});\n else prime = ({2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 47, 53, 59, 61, 67, 71});\n int d = n - 1;\n int s = 0;\n while(d % 2 == 0){\n \td >>= 1;\n \ts += 1;\n }\n for (int repeat=0 ; repeat < sizeof(prime); repeat++){\n int a = prime[repeat];\n if(!mr_pass(a, s, d, n)){\n return 0;\n }\n }\n return 1;\n}\nint main() {\n\tarray(int) lists;\n\tlists =({35201546659608842026088328007565866231962578784643756647773109869245232364730066609837018108561065242031153677,\n10513733234846849736873637829838635104309714688896631127438692162131857778044158273164093838937083421380041997,\n24684249032065892333066123534168930441269525239006410135714283699648991959894332868446109170827166448301044689,\n76921421106760125285550929240903354966370431827792714920086011488103952094969175731459908117375995349245839343,\n32998886283809577512914881459957314326750856532546837122557861905096711274255431870995137546575954361422085081,\n30925729459015376480470394633122420870296099995740154747268426836472045107181955644451858184784072167623952123,\n14083359469338511572632447718747493405040362318205860500297736061630222431052998057250747900577940212317413063,\n10422980533212493227764163121880874101060283221003967986026457372472702684601194916229693974417851408689550781,\n36261430139487433507414165833468680972181038593593271409697364115931523786727274410257181186996611100786935727,\n15579763548573297857414066649875054392128789371879472432457450095645164702139048181789700140949438093329334293});\n\tfor(int i=0;i<sizeof(lists);i++){\n\t\tint n = lists[i];\n\t\tint chk = is_prime(n);\n\t\tif(chk == 1) write(sprintf(\"%d %s\\n\",n,\"PRIME\"));\n\t\telse write(sprintf(\"%d %s\\n\",n,\"COMPOSIT\"));\n\t}\n}\n\nTEST\n\n35201546659608842026088328007565866231962578784643756647773109869245232364730066609837018108561065242031153677 PRIME\n10513733234846849736873637829838635104309714688896631127438692162131857778044158273164093838937083421380041997 PRIME\n24684249032065892333066123534168930441269525239006410135714283699648991959894332868446109170827166448301044689 PRIME\n76921421106760125285550929240903354966370431827792714920086011488103952094969175731459908117375995349245839343 PRIME\n32998886283809577512914881459957314326750856532546837122557861905096711274255431870995137546575954361422085081 PRIME\n30925729459015376480470394633122420870296099995740154747268426836472045107181955644451858184784072167623952123 PRIME\n14083359469338511572632447718747493405040362318205860500297736061630222431052998057250747900577940212317413063 PRIME\n10422980533212493227764163121880874101060283221003967986026457372472702684601194916229693974417851408689550781 PRIME\n36261430139487433507414165833468680972181038593593271409697364115931523786727274410257181186996611100786935727 PRIME\n15579763548573297857414066649875054392128789371879472432457450095645164702139048181789700140949438093329334293 PRIME\n","language":"Pike"},{"code":":- module(primality, [is_prime/2]).\n\n% is_prime/2 returns false if N is composite, true if N probably prime\n% implements a Miller-Rabin primality test and is deterministic for N < 3.415e+14,\n% and is probabilistic for larger N. Adapted from the Erlang version.\nis_prime(1, Ret) :- Ret = false, !. % 1 is non-prime\nis_prime(2, Ret) :- Ret = true, !. % 2 is prime\nis_prime(3, Ret) :- Ret = true, !. % 3 is prime\nis_prime(N, Ret) :-\n\tN > 3, (N mod 2 =:= 0), Ret = false, !. % even number > 3 is composite\nis_prime(N, Ret) :-\n\tN > 3, (N mod 2 =:= 1), % odd number > 3\n\tN < 341550071728321,\n\tdeterministic_witnesses(N, L),\n \tis_mr_prime(N, L, Ret), !. % deterministic test\nis_prime(N, Ret) :-\n\trandom_witnesses(N, 100, [], Out),\n\tis_mr_prime(N, Out, Ret), !. % probabilistic test\n\n% returns list of deterministic witnesses\ndeterministic_witnesses(N, L) :- N < 1373653,\n\tL = [2, 3].\ndeterministic_witnesses(N, L) :- N < 9080191,\n\tL = [31, 73].\ndeterministic_witnesses(N, L) :- N < 25326001,\n\tL = [2, 3, 5].\ndeterministic_witnesses(N, L) :- N < 3215031751,\n\tL = [2, 3, 5, 7].\ndeterministic_witnesses(N, L) :- N < 4759123141,\n\tL = [2, 7, 61].\ndeterministic_witnesses(N, L) :- N < 1122004669633,\n\tL = [2, 13, 23, 1662803].\ndeterministic_witnesses(N, L) :- N < 2152302898747,\n\tL = [2, 3, 5, 7, 11].\ndeterministic_witnesses(N, L) :- N < 3474749660383,\n\tL = [2, 3, 5, 7, 11, 13].\ndeterministic_witnesses(N, L) :- N < 341550071728321,\n\tL = [2, 3, 5, 7, 11, 13, 17].\n\n% random_witnesses/4 returns a list of K witnesses selected at random with range 2 -> N-2\nrandom_witnesses(_, 0, T, T).\nrandom_witnesses(N, K, T, Out) :-\n\t\tG is N - 2,\n\t\tH is 1 + random(G),\n\t\tI is K - 1,\n \trandom_witnesses(N, I, [H | T], Out), !.\n\n% find_ds/2 receives odd integer N and returns [D, S] s.t. N-1 = 2^S * D\nfind_ds(N, L) :-\n\tA is N - 1,\n find_ds(A, 0, L), !.\n\nfind_ds(D, S, L) :-\n\tD mod 2 =:= 0,\n\tP is D // 2,\n\tQ is S + 1,\n\tfind_ds(P, Q, L), !.\nfind_ds(D, S, L) :-\n\tL = [D, S].\n\nis_mr_prime(N, As, Ret) :-\n find_ds(N, L),\n L = [D | T],\n T = [S | _],\n outer_loop(N, As, D, S, Ret), !.\n\nouter_loop(N, As, D, S, Ret) :-\n As = [A | At],\n Base is powm(A, D, N),\n inner_loop(Base, N, 0, S, Result),\n\t( Result == false -> Ret = false\n\t; Result == true, At == [] -> Ret = true\n\t; outer_loop(N, At, D, S, Ret)\n\t).\n\ninner_loop(Base, N, Loop, S, Result) :-\n Next_Base is (Base * Base) mod N,\n Next_Loop is Loop + 1,\n\t( Loop =:= 0, Base =:= 1 -> Result = true\n\t; Base =:= N-1 -> Result = true\n\t; Next_Loop =:= S -> Result = false\n\t; inner_loop(Next_Base, N, Next_Loop, S, Result)\n\t).\n","language":"Prolog"},{"code":"Enumeration\n #Composite\n #Probably_prime\nEndEnumeration\n\nProcedure Miller_Rabin(n, k)\n Protected d=n-1, s, x, r\n If n=2\n ProcedureReturn #Probably_prime\n ElseIf n%2=0 Or n<2\n ProcedureReturn #Composite\n EndIf\n While d%2=0\n d/2\n s+1\n Wend\n While k>0\n k-1\n x=Int(Pow(2+Random(n-4),d))%n\n If x=1 Or x=n-1: Continue: EndIf\n For r=1 To s-1\n x=(x*x)%n\n If x=1: ProcedureReturn #Composite: EndIf\n If x=n-1: Break: EndIf\n Next\n If x<>n-1: ProcedureReturn #Composite: EndIf\n Wend\n ProcedureReturn #Probably_prime\nEndProcedure\n","language":"PureBasic"},{"code":"import random\n\ndef is_Prime(n):\n \"\"\"\n Miller-Rabin primality test.\n\n A return value of False means n is certainly not prime. A return value of\n True means n is very likely a prime.\n \"\"\"\n if n!=int(n):\n return False\n n=int(n)\n #Miller-Rabin test for prime\n if n==0 or n==1 or n==4 or n==6 or n==8 or n==9:\n return False\n\n if n==2 or n==3 or n==5 or n==7:\n return True\n s = 0\n d = n-1\n while d%2==0:\n d>>=1\n s+=1\n assert(2**s * d == n-1)\n\n def trial_composite(a):\n if pow(a, d, n) == 1:\n return False\n for i in range(s):\n if pow(a, 2**i * d, n) == n-1:\n return False\n return True\n\n for i in range(8):#number of trials\n a = random.randrange(2, n)\n if trial_composite(a):\n return False\n\n return True\n","language":"Python"},{"code":"def _try_composite(a, d, n, s):\n if pow(a, d, n) == 1:\n return False\n for i in range(s):\n if pow(a, 2**i * d, n) == n-1:\n return False\n return True # n is definitely composite\n\ndef is_prime(n, _precision_for_huge_n=16):\n if n in _known_primes:\n return True\n if any((n % p) == 0 for p in _known_primes) or n in (0, 1):\n return False\n d, s = n - 1, 0\n while not d % 2:\n d, s = d >> 1, s + 1\n # Returns exact according to http://primes.utm.edu/prove/prove2_3.html\n if n < 1373653:\n return not any(_try_composite(a, d, n, s) for a in (2, 3))\n if n < 25326001:\n return not any(_try_composite(a, d, n, s) for a in (2, 3, 5))\n if n < 118670087467:\n if n == 3215031751:\n return False\n return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7))\n if n < 2152302898747:\n return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7, 11))\n if n < 3474749660383:\n return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7, 11, 13))\n if n < 341550071728321:\n return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7, 11, 13, 17))\n # otherwise\n return not any(_try_composite(a, d, n, s)\n for a in _known_primes[:_precision_for_huge_n])\n\n_known_primes = [2, 3]\n_known_primes += [x for x in range(5, 1000, 2) if is_prime(x)]\n","language":"Python"},{"code":" [ nextword\n dup $ \"\" = if\n [ $ \"var needs a name\"\n message put bail ]\n $ \" [ stack 0 ] is \"\n over join\n $ \" [ \"\n join over join\n $ \" replace ] is ->\"\n join over join\n $ \" [ \"\n join over join\n $ \" share ] is \"\n join swap join\n $ \"-> \" join\n swap join ] builds var ( [ $ --> [ $ )\n\n 10000 eratosthenes\n\n [ 1 & not ] is even ( n --> b )\n\n var n var d var s var a\n var t var x var y var c\n\n [ dup 10000 < iff isprime done\n dup even iff\n [ drop false ] done\n dup ->n\n [ 1 - 0 swap\n [ dup even while\n 1 >> dip 1+ again ] ]\n ->d ->s\n false ->c\n 20 times\n [ n-> 2 - random 2 + ->a\n s-> ->t\n a-> d-> n-> **mod ->x\n s-> times\n [ x-> 2 n-> **mod ->y\n y-> 1 =\n x-> 1 !=\n x-> n-> 1 - !=\n and and iff\n [ true ->c conclude ]\n done\n y-> ->x ]\n c-> iff conclude done\n y-> 1 != if\n [ true ->c conclude ] ]\n c-> not ] is prime ( n --> b )\n\n say \"Primes < 100:\" cr\n 100 times [ i^ prime if [ i^ echo sp ] ]\n cr cr\n [] 1000 times\n [ i^ 9223372036854774808 + dup\n prime iff join else drop ]\n say \"There are \"\n dup size echo\n say \" primes between 9223372036854774808 and 9223372036854775808:\"\n cr cr\n witheach [ echo i^ 1+ 4 mod iff sp else cr ]\n cr cr\n 4547337172376300111955330758342147474062293202868155909489 dup echo\n prime iff\n [ say \" is prime.\" ]\n else\n [ say \" is not prime.\" ]\n cr cr\n 4547337172376300111955330758342147474062293202868155909393 dup echo\n prime iff\n [ say \"is prime.\" ]\n else\n [ say \" is not prime.\" ]\n","language":"Quackery"},{"code":"#lang racket\n(define (miller-rabin-expmod base exp m)\n (define (squaremod-with-check x)\n (define (check-nontrivial-sqrt1 x square)\n (if (and (= square 1)\n (not (= x 1))\n (not (= x (- m 1))))\n 0\n square))\n (check-nontrivial-sqrt1 x (remainder (expt x 2) m)))\n (cond ((= exp 0) 1)\n ((even? exp) (squaremod-with-check\n (miller-rabin-expmod base (/ exp 2) m)))\n (else\n (remainder (* base (miller-rabin-expmod base (- exp 1) m))\n m))))\n\n(define (miller-rabin-test n)\n (define (try-it a)\n (define (check-it x)\n (and (not (= x 0)) (= x 1)))\n (check-it (miller-rabin-expmod a (- n 1) n)))\n (try-it (+ 1 (random (remainder (- n 1) 4294967087)))))\n\n(define (fast-prime? n times)\n (for/and ((i (in-range times)))\n (miller-rabin-test n)))\n\n(define (prime? n(times 100))\n (fast-prime? n times))\n\n(prime? 4547337172376300111955330758342147474062293202868155909489) ;-> outputs true\n","language":"Racket"},{"code":"# the expmod-function from: http://rosettacode.org/wiki/Modular_exponentiation\nsub expmod(Int $a is copy, Int $b is copy, $n) {\n\tmy $c = 1;\n\trepeat while $b div= 2 {\n\t\t($c *= $a) %= $n if $b % 2;\n\t\t($a *= $a) %= $n;\n\t}\n\t$c;\n}\n\nsubset PrimeCandidate of Int where { $_ > 2 and $_ % 2 };\n\nmy Bool multi sub is_prime(Int $n, Int $k) { return False; }\nmy Bool multi sub is_prime(2, Int $k) { return True; }\nmy Bool multi sub is_prime(PrimeCandidate $n, Int $k) {\n\tmy Int $d = $n - 1;\n\tmy Int $s = 0;\n\n\twhile $d %% 2 {\n\t\t$d div= 2;\n\t\t$s++;\n\t}\n\n\tfor (2 ..^ $n).pick($k) -> $a {\n\t\tmy $x = expmod($a, $d, $n);\n\n\t\t# one could just write \"next if $x == 1 | $n - 1\"\n\t\t# but this takes much more time in current rakudo/nom\n\t\tnext if $x == 1 or $x == $n - 1;\n\n\t\tfor 1 ..^ $s {\n\t\t\t$x = $x ** 2 mod $n;\n\t\t\treturn False if $x == 1;\n\t\t\tlast if $x == $n - 1;\n\t\t}\n\t\treturn False if $x !== $n - 1;\n\t}\n\n\treturn True;\n}\n\nsay (1..1000).grep({ is_prime($_, 10) }).join(\", \");\n","language":"Raku"},{"code":"/*REXX program puts the Miller─Rabin primality test through its paces. */\nparse arg limit times seed . /*obtain optional arguments from the CL*/\nif limit=='' | limit==\",\" then limit= 1000 /*Not specified? Then use the default.*/\nif times=='' | times==\",\" then times= 10 /* \" \" \" \" \" \" */\nif datatype(seed, 'W') then call random ,,seed /*If seed specified, use it for RANDOM.*/\nnumeric digits max(200, 2*limit) /*we're dealing with some ginormous #s.*/\ntell= times<0 /*display primes only if times is neg.*/\ntimes= abs(times); w= length(times) /*use absolute value of TIMES; get len.*/\ncall genP limit /*suspenders now, use a belt later ··· */\n@MR= 'Miller─Rabin primality test' /*define a character literal for SAY. */\nsay \"There are\" # 'primes ≤' limit /*might as well display some stuff. */\nsay /* [↓] (skipping unity); show sep line*/\n do a=2 to times; say copies('─', 89) /*(skipping unity) do range of TIMEs.*/\n p= 0 /*the counter of primes for this pass. */\n do z=1 for limit /*now, let's get busy and crank primes.*/\n if \\M_Rt(z, a) then iterate /*Not prime? Then try another number.*/\n p= p + 1 /*well, we found another one, by gum! */\n if tell then say z 'is prime according to' @MR \"with K=\"a\n if !.z then iterate\n say '[K='a\"] \" z \"isn't prime !\" /*oopsy─doopsy and/or whoopsy─daisy !*/\n end /*z*/\n say ' for 1──►'limit\", K=\"right(a,w)',' @MR \"found\" p 'primes {out of' #\"}.\"\n end /*a*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngenP: parse arg high; @.=0; @.1=2; @.2=3; !.=@.; !.2=1; !.3=1; #=2\n do j=@.#+2 by 2 to high /*just examine odd integers from here. */\n do k=2 while k*k<=j; if j//@.k==0 then iterate j; end /*k*/\n #= # + 1; @.#= j; !.j= 1 /*bump prime counter; add prime to the */\n end /*j*/; return /*@. array; define a prime in !. array.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nM_Rt: procedure; parse arg n,k; d= n-1; nL=d /*Miller─Rabin: A.K.A. Rabin─Miller.*/\n if n==2 then return 1 /*special case of (the) even prime. */\n if n<2 | n//2==0 then return 0 /*check for too low, or an even number.*/\n\n do s=-1 while d//2==0; d= d % 2 /*keep halving until a zero remainder.*/\n end /*while*/\n\n do k; ?= random(2, nL) /* [↓] perform the DO loop K times.*/\n x= ?**d // n /*X can get real gihugeic really fast.*/\n if x==1 | x==nL then iterate /*First or penultimate? Try another pow*/\n do s; x= x**2 // n /*compute new X ≡ X² modulus N. */\n if x==1 then return 0 /*if unity, it's definitely not prime.*/\n if x==nL then leave /*if N-1, then it could be prime. */\n end /*r*/ /* [↑] // is REXX's division remainder*/\n if x\\==nL then return 0 /*nope, it ain't prime nohows, noway. */\n end /*k*/ /*maybe it's prime, maybe it ain't ··· */\n return 1 /*coulda/woulda/shoulda be prime; yup.*/\n","language":"REXX"},{"code":"# Project : Miller–Rabin primality test\n\nsee \"Input a number: \" give n\nsee \"Input test: \" give k\n\ntest = millerrabin(n,k)\nif test = 0\n see \"Probably Prime\" + nl\nelse\n see \"Composite\" + nl\nok\n\nfunc millerrabin(n, k)\n if n = 2\n millerRabin = 0\n return millerRabin\n ok\n if n % 2 = 0 or n < 2\n millerRabin = 1\n return millerRabin\n ok\n d = n - 1\n s = 0\n while d % 2 = 0\n d = d / 2\n s = s + 1\n end\n while k > 0\n k = k - 1\n base = 2 + floor((random(10)/10)*(n-3))\n x = pow(base, d) % n\n if x != 1 and x != n-1\n for r=1 to s-1\n x = (x * x) % n\n if x = 1\n millerRabin = 1\n return millerRabin\n ok\n if x = n-1\n exit\n ok\n next\n if x != n-1\n millerRabin = 1\n return millerRabin\n ok\n ok\n end\n","language":"Ring"},{"code":"def miller_rabin_prime?(n, g)\n d = n - 1\n s = 0\n while d % 2 == 0\n d /= 2\n s += 1\n end\n g.times do\n a = 2 + rand(n - 4)\n x = a.pow(d, n) # x = (a**d) % n\n next if x == 1 || x == n - 1\n for r in (1..s - 1)\n x = x.pow(2, n) # x = (x**2) % n\n return false if x == 1\n break if x == n - 1\n end\n return false if x != n - 1\n end\n true # probably\nend\n\np primes = (3..1000).step(2).find_all {|i| miller_rabin_prime?(i,10)}\n","language":"Ruby"},{"code":"puts miller_rabin_prime?(94366396730334173383107353049414959521528815310548187030165936229578960209523421808912459795329035203510284576187160076386643700441216547732914250578934261891510827140267043592007225160798348913639472564715055445201512461359359488795427875530231001298552452230535485049737222714000227878890892901228389026881,1000)\nputs miller_rabin_prime?(138028649176899647846076023812164793645371887571371559091892986639999096471811910222267538577825033963552683101137782650479906670021895135954212738694784814783986671046107023185842481502719762055887490765764329237651328922972514308635045190654896041748716218441926626988737664133219271115413563418353821396401,1000)\nputs miller_rabin_prime?(123301261697053560451930527879636974557474268923771832437126939266601921428796348203611050423256894847735769138870460373141723679005090549101566289920247264982095246187318303659027201708559916949810035265951104246512008259674244307851578647894027803356820480862664695522389066327012330793517771435385653616841,1000)\nputs miller_rabin_prime?(119432521682023078841121052226157857003721669633106050345198988740042219728400958282159638484144822421840470442893056822510584029066504295892189315912923804894933736660559950053226576719285711831138657839435060908151231090715952576998400120335346005544083959311246562842277496260598128781581003807229557518839,1000)\nputs miller_rabin_prime?(132082885240291678440073580124226578272473600569147812319294626601995619845059779715619475871419551319029519794232989255381829366374647864619189704922722431776563860747714706040922215308646535910589305924065089149684429555813953571007126408164577035854428632242206880193165045777949624510896312005014225526731,1000)\nputs miller_rabin_prime?(153410708946188157980279532372610756837706984448408515364579602515073276538040155990230789600191915021209039203172105094957316552912585741177975853552299222501069267567888742458519569317286299134843250075228359900070009684517875782331709619287588451883575354340318132216817231993558066067063143257425853927599,1000)\nputs miller_rabin_prime?(103130593592068072608023213244858971741946977638988649427937324034014356815504971087381663169829571046157738503075005527471064224791270584831779395959349442093395294980019731027051356344056416276026592333932610954020105156667883269888206386119513058400355612571198438511950152690467372712488391425876725831041,1000)\n","language":"Ruby"},{"code":"class Integer\n # Returns true if +self+ is a prime number, else returns false.\n def primemr?(k = 10)\n primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\n return primes.include? self if self <= primes.last\n modp47 = 614_889_782_588_491_410 # => primes.reduce(:*), largest < 2^64\n return false if self.gcd(modp47) != 1 # eliminates 86.2% of all integers\n # Choose input witness bases: wits = [range, [wit_bases]] or nil\n wits = WITNESS_RANGES.find { |range, wits| range > self }\n witnesses = wits && wits[1] || k.times.map{ 2 + rand(self - 4) }\n miller_rabin_test(witnesses)\n end\n\n private\n # Returns true if +self+ passes Miller-Rabin Test with witness bases +b+\n def miller_rabin_test(witnesses) # use witness list to test with\n neg_one_mod = n = d = self - 1 # these are even as 'self' always odd\n d >>= 4 while (d & 0xf) == 0 # suck out factors of 2\n (d >>= (d & 3)^2; d >>= (d & 1)^1) if d.even? # 4 bits at a time\n witnesses.each do |b| # do M-R test with each witness base\n next if (b % self) == 0 # **skip base if a multiple of input**\n s = d\n y = b.pow(d, self) # y = (b**d) mod self\n until y == 1 || y == neg_one_mod || s == n\n y = y.pow(2, self) # y = (y**2) mod self\n s <<= 1\n end\n return false unless y == neg_one_mod || s.odd?\n end\n true\n end\n\n # Best known deterministic witnesses for given range and set of bases\n # https://miller-rabin.appspot.com/\n # https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test\n WITNESS_RANGES = {\n 341_531 => [9345883071009581737],\n 1_050_535_501 => [336781006125, 9639812373923155],\n 350_269_456_337 => [4230279247111683200, 14694767155120705706, 16641139526367750375],\n 55_245_642_489_451 => [2, 141889084524735, 1199124725622454117, 11096072698276303650],\n 7_999_252_175_582_851 => [2, 4130806001517, 149795463772692060, 186635894390467037,\n 3967304179347715805],\n 585_226_005_592_931_977 => [2, 123635709730000, 9233062284813009, 43835965440333360,\n 761179012939631437, 1263739024124850375],\n 18_446_744_073_709_551_615 => [2, 325, 9375, 28178, 450775, 9780504, 1795265022],\n 318_665_857_834_031_151_167_461 => [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37],\n 3_317_044_064_679_887_385_961_981 => [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41]\n }\nend\n\ndef tm; t = Time.now; yield; Time.now - t end\n\n# 10 digit primes\nn = 2147483647\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 18 digit non-prime\nn = 844674407370955389\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 19 digit primes\nn = 9241386435364257883\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 20 digit primes; largest < 2^64\nn = 18446744073709551533\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 58 digit prime\nn = 4547337172376300111955330758342147474062293202868155909489\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 58 digit non-prime\nn = 4547337172376300111955330758342147474062293202868155909393\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 81 digit prime\nn = 100000000000000000000000000000000000000000000000000000000000000000000000001309503\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 81 digit non-prime\nn = 100000000000000000000000000000000000000000000000000000000000000000000000001309509\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\n# 308 digit prime\nn = 94366396730334173383107353049414959521528815310548187030165936229578960209523421808912459795329035203510284576187160076386643700441216547732914250578934261891510827140267043592007225160798348913639472564715055445201512461359359488795427875530231001298552452230535485049737222714000227878890892901228389026881\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\nn = 138028649176899647846076023812164793645371887571371559091892986639999096471811910222267538577825033963552683101137782650479906670021895135954212738694784814783986671046107023185842481502719762055887490765764329237651328922972514308635045190654896041748716218441926626988737664133219271115413563418353821396401\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\nn = 123301261697053560451930527879636974557474268923771832437126939266601921428796348203611050423256894847735769138870460373141723679005090549101566289920247264982095246187318303659027201708559916949810035265951104246512008259674244307851578647894027803356820480862664695522389066327012330793517771435385653616841\nprint \"\\n number = #{n} is prime \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\nn = 119432521682023078841121052226157857003721669633106050345198988740042219728400958282159638484144822421840470442893056822510584029066504295892189315912923804894933736660559950053226576719285711831138657839435060908151231090715952576998400120335346005544083959311246562842277496260598128781581003807229557518839\nprint \"\\n number = #{n} is prime \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\nn = 132082885240291678440073580124226578272473600569147812319294626601995619845059779715619475871419551319029519794232989255381829366374647864619189704922722431776563860747714706040922215308646535910589305924065089149684429555813953571007126408164577035854428632242206880193165045777949624510896312005014225526731\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\nn = 153410708946188157980279532372610756837706984448408515364579602515073276538040155990230789600191915021209039203172105094957316552912585741177975853552299222501069267567888742458519569317286299134843250075228359900070009684517875782331709619287588451883575354340318132216817231993558066067063143257425853927599\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\nn = 103130593592068072608023213244858971741946977638988649427937324034014356815504971087381663169829571046157738503075005527471064224791270584831779395959349442093395294980019731027051356344056416276026592333932610954020105156667883269888206386119513058400355612571198438511950152690467372712488391425876725831041\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n\nn = 94366396730334173383107353049414959521528815310548187030165936229578960209523421808912459795329035203510284576187160076386643700441216547732914250578934261891510827140267043592007225160798348913639472564715055445201512461359359488795427875530231001298552452230535485049737222714000227878890892901228389026881\nprint \"\\n number = #{n} is prime? \"; print \" in \", tm{ print n.primemr? }, \" secs\"\nputs\n","language":"Ruby"},{"code":"input \"Input a number:\";n\ninput \"Input test:\";k\n\ntest = millerRabin(n,k)\nif test = 0 then\n print \"Probably Prime\"\n else\n print \"Composite\"\nend if\nwait\n\n' ----------------------------------------\n' Returns\n' Composite = 1\n' Probably Prime = 0\n' ----------------------------------------\n FUNCTION millerRabin(n, k)\n if n = 2 then\n millerRabin = 0 'probablyPrime\n goto [funEnd]\n end if\n\n if n mod 2 = 0 or n < 2 then\n millerRabin = 1 'composite\n goto [funEnd]\n end if\n\nd = n - 1\nwhile d mod 2 = 0\n d = d / 2\n s = s + 1\nwend\n\nwhile k > 0\n k = k - 1\n base = 2 + int(rnd(1)*(n-3))\n x = (base^d) mod n\n if x <> 1 and x <> n-1 then\n for r=1 To s-1\n x =(x * x) mod n\n if x=1 then\n millerRabin = 1 ' composite\n goto [funEnd]\n end if\n if x = n-1 then exit for\n next r\n\n if x<>n-1 then\n millerRabin = 1 ' composite\n goto [funEnd]\n end if\n end if\nwend\n[funEnd]\nEND FUNCTION\n","language":"Run-BASIC"},{"code":"/* Add these lines to the [dependencies] section of your Cargo.toml file:\nnum = \"0.2.0\"\nrand = \"0.6.5\"\n*/\n\nuse num::bigint::BigInt;\nuse num::bigint::ToBigInt;\n\n\n// The modular_exponentiation() function takes three identical types\n// (which get cast to BigInt), and returns a BigInt:\nfn modular_exponentiation<T: ToBigInt>(n: &T, e: &T, m: &T) -> BigInt {\n // Convert n, e, and m to BigInt:\n let n = n.to_bigint().unwrap();\n let e = e.to_bigint().unwrap();\n let m = m.to_bigint().unwrap();\n\n // Sanity check: Verify that the exponent is not negative:\n assert!(e >= Zero::zero());\n\n use num::traits::{Zero, One};\n\n // As most modular exponentiations do, return 1 if the exponent is 0:\n if e == Zero::zero() {\n return One::one()\n }\n\n // Now do the modular exponentiation algorithm:\n let mut result: BigInt = One::one();\n let mut base = n % &m;\n let mut exp = e;\n\n loop { // Loop until we can return our result.\n if &exp % 2 == One::one() {\n result *= &base;\n result %= &m;\n }\n\n if exp == One::one() {\n return result\n }\n\n exp /= 2;\n base *= base.clone();\n base %= &m;\n }\n}\n\n\n// is_prime() checks the passed-in number against many known small primes.\n// If that doesn't determine if the number is prime or not, then the number\n// will be passed to the is_rabin_miller_prime() function:\nfn is_prime<T: ToBigInt>(n: &T) -> bool {\n let n = n.to_bigint().unwrap();\n if n.clone() < 2.to_bigint().unwrap() {\n return false\n }\n\n let small_primes = vec![2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43,\n 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101,\n 103, 107, 109, 113, 127, 131, 137, 139, 149, 151,\n 157, 163, 167, 173, 179, 181, 191, 193, 197, 199,\n 211, 223, 227, 229, 233, 239, 241, 251, 257, 263,\n 269, 271, 277, 281, 283, 293, 307, 311, 313, 317,\n 331, 337, 347, 349, 353, 359, 367, 373, 379, 383,\n 389, 397, 401, 409, 419, 421, 431, 433, 439, 443,\n 449, 457, 461, 463, 467, 479, 487, 491, 499, 503,\n 509, 521, 523, 541, 547, 557, 563, 569, 571, 577,\n 587, 593, 599, 601, 607, 613, 617, 619, 631, 641,\n 643, 647, 653, 659, 661, 673, 677, 683, 691, 701,\n 709, 719, 727, 733, 739, 743, 751, 757, 761, 769,\n 773, 787, 797, 809, 811, 821, 823, 827, 829, 839,\n 853, 857, 859, 863, 877, 881, 883, 887, 907, 911,\n 919, 929, 937, 941, 947, 953, 967, 971, 977, 983,\n 991, 997, 1009, 1013];\n\n use num::traits::Zero; // for Zero::zero()\n\n // Check to see if our number is a small prime (which means it's prime),\n // or a multiple of a small prime (which means it's not prime):\n for sp in small_primes {\n let sp = sp.to_bigint().unwrap();\n\n if n.clone() == sp {\n return true\n } else if n.clone() % sp == Zero::zero() {\n return false\n }\n }\n\n is_rabin_miller_prime(&n, None)\n}\n\n\n// Note: \"use bigint::RandBigInt;\" (which is needed for gen_bigint_range())\n// fails to work in the Rust playground ( https://play.rust-lang.org ).\n// Therefore, I'll create my own here:\nfn get_random_bigint(low: &BigInt, high: &BigInt) -> BigInt {\n if low == high { // base case\n return low.clone()\n }\n\n let middle = (low.clone() + high) / 2.to_bigint().unwrap();\n\n let go_low: bool = rand::random();\n\n if go_low {\n return get_random_bigint(low, &middle)\n } else {\n return get_random_bigint(&middle, high)\n }\n}\n\n\n// k is the number of times for testing (pass in None to use 5 (the default)).\nfn is_rabin_miller_prime<T: ToBigInt>(n: &T, k: Option<usize>) -> bool {\n let n = n.to_bigint().unwrap();\n let k = k.unwrap_or(10); // number of times for testing (defaults to 10)\n\n use num::traits::{Zero, One}; // for Zero::zero() and One::one()\n let zero: BigInt = Zero::zero();\n let one: BigInt = One::one();\n let two: BigInt = 2.to_bigint().unwrap();\n\n // The call to is_prime() should have already checked this,\n // but check for two, less than two, and multiples of two:\n if n <= one {\n return false\n } else if n == two {\n return true // 2 is prime\n } else if n.clone() % &two == Zero::zero() {\n return false // even number (that's not 2) is not prime\n }\n\n let mut t: BigInt = zero.clone();\n let n_minus_one: BigInt = n.clone() - &one;\n let mut s = n_minus_one.clone();\n while &s % &two == one {\n s /= &two;\n t += &one;\n }\n\n // Try k times to test if our number is non-prime:\n 'outer: for _ in 0..k {\n let a = get_random_bigint(&two, &n_minus_one);\n let mut v = modular_exponentiation(&a, &s, &n);\n if v == one {\n continue 'outer;\n }\n let mut i: BigInt = zero.clone();\n 'inner: while &i < &t {\n v = (v.clone() * &v) % &n;\n if &v == &n_minus_one {\n continue 'outer;\n }\n i += &one;\n }\n return false;\n }\n // If we get here, then we have a degree of certainty\n // that n really is a prime number, so return true:\n true\n}\n","language":"Rust"},{"code":"fn main() {\n let n = 1234687;\n let result = is_prime(&n);\n println!(\"Q: Is {} prime? A: {}\", n, result);\n\n let n = 1234689;\n let result = is_prime(&n);\n println!(\"Q: Is {} prime? A: {}\", n, result);\n\n let n = BigInt::parse_bytes(\"123123423463\".as_bytes(), 10).unwrap();\n let result = is_prime(&n);\n println!(\"Q: Is {} prime? A: {}\", n, result);\n\n let n = BigInt::parse_bytes(\"123123423465\".as_bytes(), 10).unwrap();\n let result = is_prime(&n);\n println!(\"Q: Is {} prime? A: {}\", n, result);\n\n let n = BigInt::parse_bytes(\"123123423467\".as_bytes(), 10).unwrap();\n let result = is_prime(&n);\n println!(\"Q: Is {} prime? A: {}\", n, result);\n\n let n = BigInt::parse_bytes(\"123123423469\".as_bytes(), 10).unwrap();\n let result = is_prime(&n);\n println!(\"Q: Is {} prime? A: {}\", n, result);\n}\n","language":"Rust"},{"code":"import scala.math.BigInt\n\nobject MillerRabinPrimalityTest extends App {\n val (n, certainty )= (BigInt(args(0)), args(1).toInt)\n println(s\"$n is ${if (n.isProbablePrime(certainty)) \"probably prime\" else \"composite\"}\")\n}\n","language":"Scala"},{"code":"import scala.annotation.tailrec\nimport scala.language.{implicitConversions, postfixOps}\nimport scala.util.Random\n\nobject MillerRabin {\n\n implicit def int2Bools(b: Int): Seq[Boolean] = 31 to 0 by -1 map isBitSet(b)\n\n def isBitSet(byte: Int)(bit: Int): Boolean = ((byte >> bit) & 1) == 1\n\n def mod(num: Int, denom: Int) = if (num % denom >= 0) num % denom else (num % denom) + denom\n\n @tailrec\n def isSimple(p: Int, s: Int): Boolean = {\n if (s == 0) {\n true\n }\n else if (witness(Random.nextInt(p - 1), p)) {\n false\n }\n else {\n isSimple(p, s - 1)\n }\n }\n\n def witness(a: Int, p: Int): Boolean = {\n val b: Seq[Boolean] = p - 1\n\n b.foldLeft(1)((d, b) => if (mod(d * d, p) == 1 && d != 1 && d != p - 1) {\n return true\n } else {\n b match {\n case true => mod(mod(d*d, p)*a,p)\n case false => mod(d*d, p)\n }\n }) != 1\n }\n}\n","language":"Scala"},{"code":"#!r6rs\n(import (rnrs base (6))\n (srfi :27 random-bits))\n\n;; Fast modular exponentiation.\n(define (modexpt b e M)\n (cond\n ((zero? e) 1)\n ((even? e) (modexpt (mod (* b b) M) (div e 2) M))\n ((odd? e) (mod (* b (modexpt b (- e 1) M)) M))))\n\n;; Return s, d such that d is odd and 2^s * d = n.\n(define (split n)\n (let recur ((s 0) (d n))\n (if (odd? d)\n (values s d)\n (recur (+ s 1) (div d 2)))))\n\n;; Test whether the number a proves that n is composite.\n(define (composite-witness? n a)\n (let*-values (((s d) (split (- n 1)))\n ((x) (modexpt a d n)))\n (and (not (= x 1))\n (not (= x (- n 1)))\n (let try ((r (- s 1)))\n (set! x (modexpt x 2 n))\n (or (zero? r)\n (= x 1)\n (and (not (= x (- n 1)))\n (try (- r 1))))))))\n\n;; Test whether n > 2 is a Miller-Rabin pseudoprime, k trials.\n(define (pseudoprime? n k)\n (or (zero? k)\n (let ((a (+ 2 (random-integer (- n 2)))))\n (and (not (composite-witness? n a))\n (pseudoprime? n (- k 1))))))\n\n;; Test whether any integer is prime.\n(define (prime? n)\n (and (> n 1)\n (or (= n 2)\n (pseudoprime? n 50))))\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n include \"bigint.s7i\";\n\nconst func boolean: millerRabin (in bigInteger: n, in integer: k) is func\n result\n var boolean: probablyPrime is TRUE;\n local\n var bigInteger: d is 0_;\n var integer: r is 0;\n var integer: s is 0;\n var bigInteger: a is 0_;\n var bigInteger: x is 0_;\n var integer: tests is 0;\n begin\n if n < 2_ or (n > 2_ and not odd(n)) then\n probablyPrime := FALSE;\n elsif n > 3_ then\n d := pred(n);\n s := lowestSetBit(d);\n d >>:= s;\n while tests < k and probablyPrime do\n a := rand(2_, pred(n));\n x := modPow(a, d, n);\n if x <> 1_ and x <> pred(n) then\n r := 1;\n while r < s and x <> 1_ and x <> pred(n) do\n x := modPow(x, 2_, n);\n incr(r);\n end while;\n probablyPrime := x = pred(n);\n end if;\n incr(tests);\n end while;\n end if;\n end func;\n\nconst proc: main is func\n local\n var bigInteger: number is 0_;\n begin\n for number range 2_ to 1000_ do\n if millerRabin(number, 10) then\n writeln(number);\n end if;\n end for;\n end func;\n","language":"Seed7"},{"code":"func miller_rabin(n, k=10) {\n\n return false if (n <= 1)\n return true if (n == 2)\n return false if (n.is_even)\n\n var t = n-1\n var s = t.valuation(2)\n var d = t>>s\n\n k.times {\n var a = irand(2, t)\n var x = powmod(a, d, n)\n next if (x ~~ [1, t])\n\n (s-1).times {\n x.powmod!(2, n)\n return false if (x == 1)\n break if (x == t)\n }\n\n return false if (x != t)\n }\n\n return true\n}\n\nsay miller_rabin.grep(^1000).join(', ')\n","language":"Sidef"},{"code":"Integer extend [\n millerRabinTest: kl [ |k| k := kl.\n self <= 3\n ifTrue: [ ^true ]\n ifFalse: [\n (self even)\n ifTrue: [ ^false ]\n ifFalse: [ |d s|\n d := self - 1.\n s := 0.\n [ (d rem: 2) == 0 ]\n whileTrue: [\n d := d / 2.\n s := s + 1.\n ].\n [ k:=k-1. k >= 0 ]\n whileTrue: [ |a x r|\n a := Random between: 2 and: (self - 2).\n x := (a raisedTo: d) rem: self.\n ( x = 1 )\n ifFalse: [ |r|\n\t\t r := -1.\n [ r := r + 1. (r < s) & (x ~= (self - 1)) ]\n whileTrue: [\n \t x := (x raisedTo: 2) rem: self\n ].\n ( x ~= (self - 1) ) ifTrue: [ ^false ]\n ]\n ].\n ^true\n ]\n ]\n ]\n].\n","language":"Smalltalk"},{"code":"1 to: 1000 do: [ :n |\n (n millerRabinTest: 10) ifTrue: [ n printNl ]\n].\n","language":"Smalltalk"},{"code":"open LargeInt;\n\nval mr_iterations = Int.toLarge 20;\nval rng = Random.rand (557216670, 13504100); (* arbitrary pair to seed RNG *)\n\nfun expmod base 0 m = 1\n | expmod base exp m =\n if exp mod 2 = 0\n then let val rt = expmod base (exp div 2) m;\n val sq = (rt*rt) mod m\n in if sq = 1\n andalso rt <> 1 (* ignore the two *)\n andalso rt <> (m-1) (* 'trivial' roots *)\n then 0\n else sq\n end\n else (base*(expmod base (exp-1) m)) mod m;\n\n(* arbitrary precision random number [0,n) *)\nfun rand n =\n let val base = Int.toLarge(valOf Int.maxInt)+1;\n fun step r lim =\n if lim < n then step (Int.toLarge(Random.randNat rng) + r*base) (lim*base)\n else r mod n\n in step 0 1 end;\n\nfun miller_rabin n =\n let fun trial n 0 = true\n | trial n t = let val a = 1+rand(n-1)\n in (expmod a (n-1) n) = 1\n andalso trial n (t-1)\n end\n in trial n mr_iterations end;\n\nfun trylist label lst = (label, ListPair.zip (lst, map miller_rabin lst));\n\ntrylist \"test the first six Carmichael numbers\"\n [561, 1105, 1729, 2465, 2821, 6601];\n\ntrylist \"test some known primes\"\n [7369, 7393, 7411, 27367, 27397, 27407];\n\n(* find ten random 30 digit primes (according to Miller-Rabin) *)\nlet fun findPrime trials = let val t = trials+1;\n val n = 2*rand(500000000000000000000000000000)+1\n in if miller_rabin n\n then (n,t)\n else findPrime t end\nin List.tabulate (10, fn e => findPrime 0) end;\n","language":"Standard-ML"},{"code":"import BigInt\n\nprivate let numTrails = 5\n\nfunc isPrime(_ n: BigInt) -> Bool {\n guard n >= 2 else { fatalError() }\n guard n != 2 else { return true }\n guard n % 2 != 0 else { return false }\n\n var s = 0\n var d = n - 1\n\n while true {\n let (quo, rem) = (d / 2, d % 2)\n\n guard rem != 1 else { break }\n\n s += 1\n d = quo\n }\n\n func tryComposite(_ a: BigInt) -> Bool {\n guard a.power(d, modulus: n) != 1 else { return false }\n\n for i in 0..<s where a.power((2 as BigInt).power(i) * d, modulus: n) == n - 1 {\n return false\n }\n\n return true\n }\n\n for _ in 0..<numTrails where tryComposite(BigInt(BigUInt.randomInteger(lessThan: BigUInt(n)))) {\n return false\n }\n\n return true\n}\n","language":"Swift"},{"code":"package require Tcl 8.5\n\nproc miller_rabin {n k} {\n if {$n <= 3} {return true}\n if {$n % 2 == 0} {return false}\n\n # write n - 1 as 2^s·d with d odd by factoring powers of 2 from n − 1\n set d [expr {$n - 1}]\n set s 0\n while {$d % 2 == 0} {\n set d [expr {$d / 2}]\n incr s\n }\n\n while {$k > 0} {\n incr k -1\n set a [expr {2 + int(rand()*($n - 4))}]\n set x [expr {($a ** $d) % $n}]\n if {$x == 1 || $x == $n - 1} continue\n for {set r 1} {$r < $s} {incr r} {\n set x [expr {($x ** 2) % $n}]\n if {$x == 1} {return false}\n if {$x == $n - 1} break\n }\n\tif {$x != $n-1} {return false}\n }\n return true\n}\n\nfor {set i 1} {$i < 1000} {incr i} {\n if {[miller_rabin $i 10]} {\n puts $i\n }\n}\n","language":"Tcl"},{"code":"import \"./big\" for BigInt\n\nvar iters = 10\n// find all primes < 100\nSystem.print(\"The following numbers less than 100 are prime:\")\nSystem.write(\"2 \")\nfor (i in 3..99) {\n if (BigInt.new(i).isProbablePrime(iters)) System.write(\"%(i) \")\n}\nSystem.print(\"\\n\")\nvar bia = [\n BigInt.new(\"4547337172376300111955330758342147474062293202868155909489\"),\n BigInt.new(\"4547337172376300111955330758342147474062293202868155909393\")\n]\nfor (bi in bia) {\n System.print(\"%(bi) is %(bi.isProbablePrime(iters) ? \"probably prime\" : \"composite\")\")\n}\n","language":"Wren"},{"code":"zkl: var BN=Import(\"zklBigNum\");\nzkl: BN(\"4547337172376300111955330758342147474062293202868155909489\").probablyPrime()\nTrue\nzkl: BN(\"4547337172376300111955330758342147474062293202868155909393\").probablyPrime()\nFalse\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Miller–Rabin_primality_test\\nnote: Prime Numbers\\n\",\n \"language\": \"00-META\"\n },\n {\n \"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 given number is prime or not.\\n\\nThe algorithm, as modified by [[wp:Michael O. Rabin|Michael O. Rabin]] to avoid the [[wp:generalized Riemann hypothesis|generalized Riemann hypothesis]], is a probabilistic algorithm.\\n\\nThe pseudocode, from [[wp:Miller-Rabin primality test#Algorithm_and_running_time|Wikipedia]] is:\\n '''Input''': ''n'' > 2, an odd integer to be tested for primality;\\n ''k'', a parameter that determines the accuracy of the test\\n '''Output''': ''composite'' if ''n'' is composite, otherwise ''probably prime''\\n write ''n'' − 1 as 2<sup>''s''</sup>·''d'' with ''d'' odd by factoring powers of 2 from ''n'' − 1\\n LOOP: '''repeat''' ''k'' times:\\n pick ''a'' randomly in the range [2, ''n'' − 1]\\n ''x'' ← ''a''<sup>''d''</sup> mod ''n''\\n '''if''' ''x'' = 1 or ''x'' = ''n'' − 1 '''then''' '''do''' '''next''' LOOP\\n '''repeat''' ''s'' − 1 times:\\n ''x'' ← ''x''<sup>2</sup> mod ''n''\\n '''if''' ''x'' = 1 '''then''' '''return''' ''composite''\\n '''if''' ''x'' = ''n'' − 1 '''then''' '''do''' '''next''' LOOP\\n '''return''' ''composite''\\n '''return''' ''probably prime''\\n\\n* The nature of the test involves big numbers, so the use of \\\"big numbers\\\" libraries (or similar features of the language of your choice) are suggested, but '''not''' mandatory.\\n* Deterministic variants of the test exist and can be implemented as extra (not mandatory to complete the task)\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F isProbablePrime(n, k = 10)\\n I n < 2 | n % 2 == 0\\n R n == 2\\n\\n V d = n - 1\\n V s = 0\\n L d % 2 == 0\\n d I/= 2\\n s++\\n\\n assert(2 ^ s * d == n - 1)\\n\\n L 0 .< k\\n V a = random:(2 .< n)\\n V x = pow(a, d, n)\\n I x == 1 | x == n - 1\\n L.continue\\n L 0 .< s - 1\\n x = pow(x, 2, n)\\n I x == 1\\n R 0B\\n I x == n - 1\\n L.break\\n L.was_no_break\\n R 0B\\n\\n R 1B\\n\\nprint((2..29).filter(x -> isProbablePrime(x)))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"/* ARM assembly AARCH64 Raspberry PI 3B */\\n/* program testmiller64B.s */\\n// optimisation : one routine\\n\\n/************************************/\\n/* Constantes */\\n/************************************/\\n/* for this file see task include a file in language AArch64 assembly*/\\n.include \\\"../includeConstantesARM64.inc\\\"\\n\\n.equ NBLOOP, 5 // loop number change this if necessary\\n // if modify, thinck to add test to little prime value\\n // in routine\\n//.include \\\"../../ficmacros64.inc\\\" // use for developper debugging\\n/*******************************************/\\n/* Initialized data */\\n/*******************************************/\\n.data\\nszMessStartPgm: .asciz \\\"Program 64 bits start \\\\n\\\"\\nszMessEndPgm: .asciz \\\"Program normal end.\\\\n\\\"\\nszMessPrime: .asciz \\\" is prime !!!.\\\\n\\\"\\nszMessNotPrime: .asciz \\\" is not prime !!!.\\\\n\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\n\\n/*******************************************/\\n/* UnInitialized data */\\n/*******************************************/\\n.bss\\n.align 4\\nsZoneConv: .skip 24\\n/*******************************************/\\n/* code section */\\n/*******************************************/\\n.text\\n.global main\\nmain: // program start\\n ldr x0,qAdrszMessStartPgm // display start message\\n bl affichageMess\\n ldr x4,iStart // start number\\n ldr x5,iLimit // end number\\n tst x4,#1\\n cinc x4,x4,eq // start with odd number\\n1:\\n mov x0,x4\\n bl isPrimeMiller // test miller rabin\\n cmp x0,#0\\n beq 2f\\n mov x0,x4\\n ldr x1,qAdrsZoneConv\\n bl conversion10 // decimal conversion\\n ldr x0,qAdrsZoneConv\\n bl affichageMess\\n ldr x0,qAdrszMessPrime\\n bl affichageMess\\n b 3f\\n2:\\n ldr x0,qAdrszMessNotPrime\\n // bl affichageMess\\n3:\\n add x4,x4,#2\\n cmp x4,x5\\n blo 1b\\n\\n ldr x0,qAdrszMessEndPgm // display end message\\n bl affichageMess\\n\\n100: // standard end of the program\\n mov x0, #0 // return code\\n mov x8, #EXIT // request to exit program\\n svc 0 // perform system call\\nqAdrszMessStartPgm: .quad szMessStartPgm\\nqAdrszMessEndPgm: .quad szMessEndPgm\\nqAdrszCarriageReturn: .quad szCarriageReturn\\nqAdrsZoneConv: .quad sZoneConv\\nqAdrszMessPrime: .quad szMessPrime\\nqAdrszMessNotPrime: .quad szMessNotPrime\\n//iStart: .quad 0x0\\n//iLimit: .quad 0x100\\niStart: .quad 0xFFFFFFFFFFFFFF00\\niLimit: .quad 0xFFFFFFFFFFFFFFF0\\n//iStart: .quad 341550071728360\\n//iLimit: .quad 341550071728380\\n//359341550071728361\\n\\n/***************************************************/\\n/* test miller rabin algorithme wikipedia */\\n/* unsigned */\\n/***************************************************/\\n/* x0 contains number */\\n/* x1 contains parameter */\\n/* x0 return 1 if prime 0 if composite */\\nisPrimeMiller:\\n stp x1,lr,[sp,-16]! // TODO: save à completer\\n stp x2,x3,[sp,-16]!\\n stp x4,x5,[sp,-16]!\\n stp x6,x7,[sp,-16]!\\n stp x8,x9,[sp,-16]!\\n cmp x0,#1 // control 0 or 1\\n csel x0,xzr,x0,ls\\n bls 100f\\n cmp x0,#2 // control = 2\\n mov x1,1\\n csel x0,x1,x0,eq\\n beq 100f\\n cmp x0,#3 // control = 3\\n csel x0,x1,x0,eq\\n beq 100f\\n cmp x0,#5 // control = 5\\n csel x0,x1,x0,eq\\n beq 100f\\n cmp x0,#7 // control = 7\\n csel x0,x1,x0,eq\\n beq 100f\\n cmp x0,#11 // control = 11\\n csel x0,x1,x0,eq\\n beq 100f\\n tst x0,#1\\n csel x0,xzr,x0,eq // even\\n beq 100f\\n mov x4,x0 // N\\n sub x3,x0,#1 // D\\n mov x2,#2\\n mov x6,#0 // S\\n1: // compute D * 2 power S\\n lsr x3,x3,#1 // D= D/2\\n add x6,x6,#1 // increment S\\n tst x3,#1 // D even ?\\n beq 1b\\n2:\\n mov x8,#0 // loop counter\\n sub x5,x0,#3\\n mov x7,3\\n3:\\n mov x0,x7\\n mov x1,x3 // exposant = D\\n mov x2,x4 // modulo N\\n bl moduloPur64\\n cmp x0,#1\\n beq 5f\\n sub x1,x4,#1 // n -1\\n cmp x0,x1\\n beq 5f\\n sub x9,x6,#1 // S - 1\\n4:\\n mov x2,x0\\n\\n mul x0,x2,x2 // compute square lower\\n umulh x1,x2,x2 // compute square upper\\n mov x2,x4 // and compute modulo N\\n bl division64R2023\\n mov x0,x2\\n cmp x0,#1\\n csel x0,xzr,x0,eq // composite\\n beq 100f\\n sub x1,x4,#1 // n -1\\n cmp x0,x1\\n beq 5f\\n subs x9,x9,#1\\n bge 4b\\n mov x0,#0 // composite\\n b 100f\\n5:\\n add x7,x7,2\\n add x8,x8,#1\\n cmp x8,NBLOOP\\n blt 3b\\n mov x0,#1 // prime\\n100:\\n ldp x8,x9,[sp],16\\n ldp x6,x7,[sp],16\\n ldp x4,x5,[sp],16\\n ldp x2,x3,[sp],16\\n ldp x1,lr,[sp],16 // TODO: retaur à completer\\n ret\\n/********************************************************/\\n/* Calcul modulo de b puissance e modulo m */\\n/* Exemple 4 puissance 13 modulo 497 = 445 */\\n/********************************************************/\\n/* x0 nombre */\\n/* x1 exposant */\\n/* x2 modulo */\\nmoduloPur64:\\n stp x1,lr,[sp,-16]! // save registres\\n stp x3,x4,[sp,-16]! // save registres\\n stp x5,x6,[sp,-16]! // save registres\\n stp x7,x8,[sp,-16]! // save registres\\n stp x9,x10,[sp,-16]! // save registres\\n cbz x0,100f\\n cbz x1,100f\\n mov x8,x0\\n mov x7,x1\\n mov x10,x2 // modulo\\n mov x6,1 // resultat\\n udiv x4,x8,x10\\n msub x9,x4,x10,x8 // contient le reste\\n1:\\n tst x7,1\\n beq 2f\\n mul x4,x9,x6\\n umulh x5,x9,x6\\n mov x6,x4\\n mov x0,x6\\n mov x1,x5\\n mov x2,x10\\n bl division64R2023\\n mov x6,x2\\n2:\\n mul x8,x9,x9\\n umulh x5,x9,x9\\n mov x0,x8\\n mov x1,x5\\n mov x2,x10\\n bl division64R2023\\n mov x9,x2\\n lsr x7,x7,1\\n cbnz x7,1b\\n mov x0,x6 // result\\n cmn x0,0 // clear carry not error\\n\\n100:\\n ldp x9,x10,[sp],16 // restaur des 2 registres\\n ldp x7,x8,[sp],16 // restaur des 2 registres\\n ldp x5,x6,[sp],16 // restaur des 2 registres\\n ldp x3,x4,[sp],16 // restaur des 2 registres\\n ldp x1,lr,[sp],16 // restaur des 2 registres\\n ret // retour adresse lr x30\\n/***************************************************/\\n/* division number 128 bits in 2 registers by number 64 bits */\\n/* unsigned */\\n/***************************************************/\\n/* x0 contains lower part dividende */\\n/* x1 contains upper part dividende */\\n/* x2 contains divisor */\\n/* x0 return lower part quotient */\\n/* x1 return upper part quotient */\\n/* x2 return remainder */\\ndivision64R2023:\\n stp x3,lr,[sp,-16]!\\n stp x4,x5,[sp,-16]!\\n stp x6,x7,[sp,-16]!\\n mov x4,x2 // save divisor\\n mov x5,#0 // init upper part divisor\\n mov x2,x0 // save dividende\\n mov x3,x1\\n mov x0,#0 // init result\\n mov x1,#0\\n mov x6,#0 // init shift counter\\n1: // loop shift divisor\\n cmp x5,#0 // upper divisor <0\\n blt 2f\\n cmp x5,x3\\n bhi 2f\\n blo 11f\\n cmp x4,x2\\n bhi 2f // new divisor > dividende\\n11:\\n lsl x5,x5,#1 // shift left one bit upper divisor\\n tst x4,#0x8000000000000000\\n lsl x4,x4,#1 // shift left one bit lower divisor\\n orr x7,x5,#1\\n csel x5,x7,x5,ne // move bit 63 lower on upper\\n add x6,x6,#1 // increment shift counter\\n b 1b\\n\\n2: // loop 2\\n lsl x1,x1,#1 // shift left one bit upper quotient\\n tst x0,#0x8000000000000000\\n lsl x0,x0,#1 // shift left one bit lower quotient\\n orr x7,x1,#1\\n csel x1,x7,x1,ne // move bit 63 lower on upper\\n cmp x5,x3 // compare divisor and dividende\\n bhi 3f\\n blo 21f\\n cmp x4,x2\\n bhi 3f\\n21:\\n subs x2,x2,x4 // < sub divisor from dividende lower\\n sbc x3,x3,x5 // and upper\\n orr x0,x0,#1 // move 1 on quotient\\n3:\\n lsr x4,x4,#1 // shift right one bit upper divisor\\n tst x5,1\\n lsr x5,x5,#1 // and lower\\n orr x7,x4,#0x8000000000000000 // move bit 0 upper to 31 bit lower\\n csel x4,x7,x4,ne // move bit 0 upper to 63 bit lower\\n subs x6,x6,#1 // decrement shift counter\\n bge 2b // if > 0 loop 2\\n\\n100:\\n ldp x6,x7,[sp],16\\n ldp x4,x5,[sp],16\\n ldp x3,lr,[sp],16\\n ret\\n\\n/***************************************************/\\n/* ROUTINES INCLUDE */\\n/***************************************************/\\n.include \\\"../includeARM64.inc\\\"\\n\",\n \"language\": \"AArch64-Assembly\"\n },\n {\n \"code\": \"generic\\n type Number is range <>;\\npackage Miller_Rabin is\\n\\n type Result_Type is (Composite, Probably_Prime);\\n\\n function Is_Prime (N : Number; K : Positive := 10) return Result_Type;\\n\\nend Miller_Rabin;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Numerics.Discrete_Random;\\n\\npackage body Miller_Rabin is\\n\\n function Is_Prime (N : Number; K : Positive := 10)\\n return Result_Type\\n is\\n subtype Number_Range is Number range 2 .. N - 1;\\n package Random is new Ada.Numerics.Discrete_Random (Number_Range);\\n\\n function Mod_Exp (Base, Exponent, Modulus : Number) return Number is\\n Result : Number := 1;\\n begin\\n for E in 1 .. Exponent loop\\n Result := Result * Base mod Modulus;\\n end loop;\\n return Result;\\n end Mod_Exp;\\n\\n Generator : Random.Generator;\\n D : Number := N - 1;\\n S : Natural := 0;\\n X : Number;\\n begin\\n -- exclude 2 and even numbers\\n if N = 2 then\\n return Probably_Prime;\\n elsif N mod 2 = 0 then\\n return Composite;\\n end if;\\n\\n -- write N-1 as 2**S * D, with D mod 2 /= 0\\n while D mod 2 = 0 loop\\n D := D / 2;\\n S := S + 1;\\n end loop;\\n\\n -- initialize RNG\\n Random.Reset (Generator);\\n for Loops in 1 .. K loop\\n X := Mod_Exp(Random.Random (Generator), D, N);\\n if X /= 1 and X /= N - 1 then\\n Inner : for R in 1 .. S - 1 loop\\n X := Mod_Exp (X, 2, N);\\n if X = 1 then return Composite; end if;\\n exit Inner when X = N - 1;\\n end loop Inner;\\n if X /= N - 1 then return Composite; end if;\\n end if;\\n end loop;\\n\\n return Probably_Prime;\\n end Is_Prime;\\n\\nend Miller_Rabin;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO, Miller_Rabin;\\n\\nprocedure Mr_Tst is\\n\\n type Number is range 0 .. (2**48)-1;\\n\\n package Num_IO is new Ada.Text_IO.Integer_IO (Number);\\n package Pos_IO is new Ada.Text_IO.Integer_IO (Positive);\\n package MR is new Miller_Rabin(Number); use MR;\\n\\n N : Number;\\n K : Positive;\\n\\nbegin\\n for I in Number(2) .. 1000 loop\\n if Is_Prime (I) = Probably_Prime then\\n Ada.Text_IO.Put (Number'Image (I));\\n end if;\\n end loop;\\n Ada.Text_IO.Put_Line (\\\".\\\");\\n\\n Ada.Text_IO.Put (\\\"Enter a Number: \\\"); Num_IO.Get (N);\\n Ada.Text_IO.Put (\\\"Enter the count of loops: \\\"); Pos_IO.Get (K);\\n Ada.Text_IO.Put_Line (\\\"What is it? \\\" & Result_Type'Image (Is_Prime(N, K)));\\nend MR_Tst;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO, Crypto.Types.Big_Numbers, Ada.Numerics.Discrete_Random;\\n\\nprocedure Miller_Rabin is\\n\\n Bound: constant Positive := 256; -- can be any multiple of 32\\n\\n package LN is new Crypto.Types.Big_Numbers (Bound);\\n use type LN.Big_Unsigned; -- all computations \\\"mod 2**Bound\\\"\\n\\n function \\\"+\\\"(S: String) return LN.Big_Unsigned\\n renames LN.Utils.To_Big_Unsigned;\\n\\n function Is_Prime (N : LN.Big_Unsigned; K : Positive := 10) return Boolean is\\n\\n subtype Mod_32 is Crypto.Types.Mod_Type;\\n use type Mod_32;\\n package R_32 is new Ada.Numerics.Discrete_Random (Mod_32);\\n Generator : R_32.Generator;\\n\\n function Random return LN.Big_Unsigned is\\n X: LN.Big_Unsigned := LN.Big_Unsigned_Zero;\\n begin\\n for I in 1 .. Bound/32 loop\\n X := (X * 2**16) * 2**16;\\n X := X + R_32.Random(Generator);\\n end loop;\\n return X;\\n end Random;\\n\\n D: LN.Big_Unsigned := N - LN.Big_Unsigned_One;\\n S: Natural := 0;\\n A, X: LN.Big_Unsigned;\\n begin\\n -- exclude 2 and even numbers\\n if N = 2 then\\n return True;\\n elsif N mod 2 = LN.Big_Unsigned_Zero then\\n return False;\\n else\\n\\n -- write N-1 as 2**S * D, with odd D\\n while D mod 2 = LN.Big_Unsigned_Zero loop\\n D := D / 2;\\n S := S + 1;\\n end loop;\\n\\n -- initialize RNG\\n R_32.Reset (Generator);\\n\\n -- run the real test\\n for Loops in 1 .. K loop\\n loop\\n A := Random;\\n exit when (A > 1) and (A < (N - 1));\\n end loop;\\n X := LN.Mod_Utils.Pow(A, D, N); -- X := (Random**D) mod N\\n if X /= 1 and X /= N - 1 then\\n Inner:\\n for R in 1 .. S - 1 loop\\n X := LN.Mod_Utils.Pow(X, LN.Big_Unsigned_Two, N);\\n if X = 1 then\\n return False;\\n end if;\\n exit Inner when X = N - 1;\\n end loop Inner;\\n if X /= N - 1 then\\n return False;\\n end if;\\n end if;\\n end loop;\\n end if;\\n\\n return True;\\n end Is_Prime;\\n\\n S: constant String :=\\n \\\"4547337172376300111955330758342147474062293202868155909489\\\";\\n T: constant String :=\\n \\\"4547337172376300111955330758342147474062293202868155909393\\\";\\n\\n K: constant Positive := 10;\\n\\nbegin\\n Ada.Text_IO.Put_Line(\\\"Prime(\\\" & S & \\\")=\\\" & Boolean'Image(Is_Prime(+S, K)));\\n Ada.Text_IO.Put_Line(\\\"Prime(\\\" & T & \\\")=\\\" & Boolean'Image(Is_Prime(+T, K)));\\nend Miller_Rabin;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO, Crypto.Types.Big_Numbers, Ada.Numerics.Discrete_Random;\\n\\nprocedure Miller_Rabin is\\n\\n Bound: constant Positive := 256; -- can be any multiple of 32\\n\\n package LN is new Crypto.Types.Big_Numbers (Bound);\\n use type LN.Big_Unsigned; -- all computations \\\"mod 2**Bound\\\"\\n\\n function \\\"+\\\"(S: String) return LN.Big_Unsigned\\n renames LN.Utils.To_Big_Unsigned;\\n\\n S: constant String :=\\n \\\"4547337172376300111955330758342147474062293202868155909489\\\";\\n T: constant String :=\\n \\\"4547337172376300111955330758342147474062293202868155909393\\\";\\n\\n K: constant Positive := 10;\\n\\n\\nbegin\\n Ada.Text_IO.Put_Line(\\\"Prime(\\\" & S & \\\")=\\\"\\n & Boolean'Image (LN.Mod_Utils.Passed_Miller_Rabin_Test(+S, K)));\\n Ada.Text_IO.Put_Line(\\\"Prime(\\\" & T & \\\")=\\\"\\n & Boolean'Image (LN.Mod_Utils.Passed_Miller_Rabin_Test(+T, K)));\\nend Miller_Rabin;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"MODE LINT=LONG INT;\\nMODE LOOPINT = INT;\\n\\nMODE POWMODSTRUCT = LINT;\\nPR READ \\\"prelude/pow_mod.a68\\\" PR;\\n\\nPROC miller rabin = (LINT n, LOOPINT k)BOOL: (\\n IF n<=3 THEN TRUE\\n ELIF NOT ODD n THEN FALSE\\n ELSE\\n LINT d := n - 1;\\n INT s := 0;\\n WHILE NOT ODD d DO\\n d := d OVER 2;\\n s +:= 1\\n OD;\\n TO k DO\\n LINT a := 2 + ENTIER (random*(n-3));\\n LINT x := pow mod(a, d, n);\\n IF x /= 1 THEN\\n TO s DO\\n IF x = n-1 THEN done FI;\\n x := x*x %* n\\n OD;\\n else: IF x /= n-1 THEN return false FI;\\n done: EMPTY\\n FI\\n OD;\\n TRUE EXIT\\n return false: FALSE\\n FI\\n);\\n\\nFOR i FROM 937 TO 1000 DO\\n IF miller rabin(i, 10) THEN\\n print((\\\" \\\",whole(i,0)))\\n FI\\nOD\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"/* ARM assembly Raspberry PI */\\n/* program testmiller.s */\\n\\n/* for constantes see task include a file in arm assembly */\\n/************************************/\\n/* Constantes */\\n/************************************/\\n.include \\\"../constantes.inc\\\"\\n\\n.equ NBDIVISORS, 2000\\n\\n//.include \\\"../../ficmacros32.inc\\\" @ use for developper debugging\\n/*******************************************/\\n/* Initialized data */\\n/*******************************************/\\n.data\\nszMessStartPgm: .asciz \\\"Program 32 bits start \\\\n\\\"\\nszMessEndPgm: .asciz \\\"Program normal end.\\\\n\\\"\\nszMessErrorArea: .asciz \\\"\\\\033[31mError : area divisors too small.\\\\n\\\"\\nszMessPrime: .asciz \\\" is prime !!!.\\\\n\\\"\\nszMessNotPrime: .asciz \\\" is not prime !!!.\\\\n\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\n\\n.align 4\\niGraine: .int 123456\\n/*******************************************/\\n/* UnInitialized data */\\n/*******************************************/\\n.bss\\n.align 4\\nsZoneConv: .skip 24\\n/*******************************************/\\n/* code section */\\n/*******************************************/\\n.text\\n.global main\\nmain: @ program start\\n ldr r0,iAdrszMessStartPgm @ display start message\\n bl affichageMess\\n ldr r4,iStart @ start number\\n ldr r5,iLimit @ end number\\n tst r4,#1\\n addeq r4,#1 @ start with odd number\\n1:\\n mov r0,r4\\n ldr r1,iAdrsZoneConv\\n bl conversion10 @ decimal conversion\\n ldr r0,iAdrsZoneConv\\n bl affichageMess\\n mov r0,r4\\n bl isPrimeMiller @ test miller rabin\\n cmp r0,#0\\n beq 2f\\n ldr r0,iAdrszMessPrime\\n bl affichageMess\\n b 3f\\n2:\\n ldr r0,iAdrszMessNotPrime\\n bl affichageMess\\n3:\\n add r4,r4,#2\\n cmp r4,r5\\n ble 1b\\n\\n ldr r0,iAdrszMessEndPgm @ display end message\\n bl affichageMess\\n\\n100: @ standard end of the program\\n mov r0, #0 @ return code\\n mov r7, #EXIT @ request to exit program\\n svc 0 @ perform system call\\niAdrszMessStartPgm: .int szMessStartPgm\\niAdrszMessEndPgm: .int szMessEndPgm\\niAdrszCarriageReturn: .int szCarriageReturn\\niAdrsZoneConv: .int sZoneConv\\niAdrszMessPrime: .int szMessPrime\\niAdrszMessNotPrime: .int szMessNotPrime\\niStart: .int 4294967270\\niLimit: .int 4294967295\\n\\n\\n/***************************************************/\\n/* check if a number is prime test miller rabin */\\n/***************************************************/\\n/* r0 contains the number */\\n/* r0 return 1 if prime 0 else */\\n@2147483647\\n@4294967297\\n@131071\\nisPrimeMiller:\\n push {r1-r6,lr} @ save registers\\n cmp r0,#1 @ control 0 or 1\\n movls r0,#0\\n bls 100f\\n cmp r0,#2 @ control = 2\\n moveq r0,#1\\n beq 100f\\n tst r0,#1\\n moveq r0,#0 @ even\\n beq 100f\\n mov r1,#5 @ loop number\\n bl testMiller\\n100:\\n pop {r1-r6,pc}\\n/***************************************************/\\n/* test miller rabin algorithme wikipedia */\\n/* unsigned */\\n/***************************************************/\\n/* r0 contains number */\\n/* r1 contains parameter */\\n/* r0 return 1 if prime 0 if composite */\\ntestMiller:\\n push {r1-r9,lr} @ save registers\\n mov r4,r0 @ N\\n mov r7,r1 @ loop maxi\\n sub r3,r0,#1 @ D\\n mov r2,#2\\n mov r6,#0 @ S\\n1: @ compute D * 2 power S\\n lsr r3,#1 @ D= D/2\\n add r6,r6,#1 @ increment S\\n tst r3,#1 @ D even ?\\n beq 1b\\n2:\\n mov r8,#0 @ loop counter\\n sub r5,r0,#3\\n3:\\n mov r0,r5\\n bl genereraleas\\n add r0,r0,#2 @ alea (entre 2 et n-1)\\n mov r1,r3 @ exposant = D\\n mov r2,r4 @ modulo N\\n bl moduloPuR32\\n cmp r0,#1\\n beq 5f\\n sub r1,r4,#1 @ n -1\\n cmp r0,r1\\n beq 5f\\n sub r9,r6,#1 @ S - 1\\n4:\\n mov r2,r0\\n umull r0,r1,r2,r0 @ compute square\\n mov r2,r4 @ and compute modulo N\\n bl division32R2023\\n mov r0,r2\\n cmp r0,#1\\n moveq r0,#0 @ composite\\n beq 100f\\n sub r1,r4,#1 @ n -1\\n cmp r0,r1\\n beq 5f\\n subs r9,r9,#1\\n bge 4b\\n mov r0,#0 @ composite\\n b 100f\\n5:\\n add r8,r8,#1\\n cmp r8,r7\\n blt 3b\\n mov r0,#1 @ prime\\n100:\\n pop {r1-r9,pc}\\n/********************************************************/\\n/* Calcul modulo de b puissance e modulo m */\\n/* Exemple 4 puissance 13 modulo 497 = 445 */\\n/* */\\n/********************************************************/\\n/* r0 nombre */\\n/* r1 exposant */\\n/* r2 modulo */\\n/* r0 return result */\\nmoduloPuR32:\\n push {r1-r6,lr} @ save registers\\n cmp r0,#0 @ control <> zero\\n beq 100f\\n cmp r2,#0 @ control <> zero\\n beq 100f\\n1:\\n mov r4,r2 @ save modulo\\n mov r5,r1 @ save exposant\\n mov r6,r0 @ save base\\n mov r3,#1 @ start result\\n\\n mov r1,#0 @ division r0,r1 by r2\\n bl division32R2023\\n mov r6,r2 @ base <- remainder\\n2:\\n tst r5,#1 @ exposant even or odd\\n beq 3f\\n umull r0,r1,r6,r3 @ multiplication base\\n mov r2,r4 @ and compute modulo N\\n bl division32R2023\\n mov r3,r2 @ result <- remainder\\n3:\\n umull r0,r1,r6,r6 @ compute base square\\n mov r2,r4 @ and compute modulo N\\n bl division32R2023\\n mov r6,r2 @ base <- remainder\\n\\n lsr r5,#1 @ left shift 1 bit\\n cmp r5,#0 @ end ?\\n bne 2b\\n mov r0,r3\\n100:\\n pop {r1-r6,pc}\\n\\n/***************************************************/\\n/* division number 64 bits in 2 registers by number 32 bits */\\n/* unsigned */\\n/***************************************************/\\n/* r0 contains lower part dividende */\\n/* r1 contains upper part dividende */\\n/* r2 contains divisor */\\n/* r0 return lower part quotient */\\n/* r1 return upper part quotient */\\n/* r2 return remainder */\\ndivision32R2023:\\n push {r3-r6,lr} @ save registers\\n mov r4,r2 @ save divisor\\n mov r5,#0 @ init upper part divisor\\n mov r2,r0 @ save dividende\\n mov r3,r1\\n mov r0,#0 @ init result\\n mov r1,#0\\n mov r6,#0 @ init shift counter\\n1: @ loop shift divisor\\n cmp r5,#0 @ upper divisor <0\\n blt 2f\\n cmp r5,r3\\n cmpeq r4,r2\\n bhs 2f @ new divisor > dividende\\n lsl r5,#1 @ shift left one bit upper divisor\\n lsls r4,#1 @ shift left one bit lower divisor\\n orrcs r5,r5,#1 @ move bit 31 lower on upper\\n add r6,r6,#1 @ increment shift counter\\n b 1b\\n2: @ loop 2\\n lsl r1,#1 @ shift left one bit upper quotient\\n lsls r0,#1 @ shift left one bit lower quotient\\n orrcs r1,#1 @ move bit 31 lower on upper\\n cmp r5,r3 @ compare divisor and dividende\\n cmpeq r4,r2\\n bhi 3f\\n subs r2,r2,r4 @ < sub divisor from dividende lower\\n sbc r3,r3,r5 @ and upper\\n orr r0,r0,#1 @ move 1 on quotient\\n3:\\n lsr r4,r4,#1 @ shift right one bit upper divisor\\n lsrs r5,#1 @ and lower\\n orrcs r4,#0x80000000 @ move bit 0 upper to 31 bit lower\\n subs r6,#1 @ decrement shift counter\\n bge 2b @ if > 0 loop 2\\n\\n100:\\n pop {r3-r6,pc}\\n\\n\\n/***************************************************/\\n/* Generation random number */\\n/***************************************************/\\n/* r0 contains limit */\\ngenereraleas:\\n push {r1-r4,lr} @ save registers\\n ldr r4,iAdriGraine\\n ldr r2,[r4]\\n ldr r3,iNbDep1\\n mul r2,r3,r2\\n ldr r3,iNbDep1\\n add r2,r2,r3\\n str r2,[r4] @ save seed for next call\\n cmp r0,#0\\n beq 100f\\n mov r1,r0 @ divisor\\n mov r0,r2 @ dividende\\n bl division\\n mov r0,r3 @ résult = remainder\\n\\n100: @ end function\\n pop {r1-r4,pc} @ restaur registers\\niAdriGraine: .int iGraine\\niNbDep1: .int 0x343FD\\niNbDep2: .int 0x269EC3\\n/***************************************************/\\n/* ROUTINES INCLUDE */\\n/***************************************************/\\n.include \\\"../affichage.inc\\\"\\n\",\n \"language\": \"ARM-Assembly\"\n },\n {\n \"code\": \"MsgBox % MillerRabin(999983,10) ; 1\\nMsgBox % MillerRabin(999809,10) ; 1\\nMsgBox % MillerRabin(999727,10) ; 1\\nMsgBox % MillerRabin(52633,10) ; 0\\nMsgBox % MillerRabin(60787,10) ; 0\\nMsgBox % MillerRabin(999999,10) ; 0\\nMsgBox % MillerRabin(999995,10) ; 0\\nMsgBox % MillerRabin(999991,10) ; 0\\n\\nMillerRabin(n,k) { ; 0: composite, 1: probable prime (n < 2**31)\\n d := n-1, s := 0\\n While !(d&1)\\n d>>=1, s++\\n\\n Loop %k% {\\n Random a, 2, n-2 ; if n < 4,759,123,141, it is enough to test a = 2, 7, and 61.\\n x := PowMod(a,d,n)\\n If (x=1 || x=n-1)\\n Continue\\n Cont := 0\\n Loop % s-1 {\\n x := PowMod(x,2,n)\\n If (x = 1)\\n Return 0\\n If (x = n-1) {\\n Cont = 1\\n Break\\n }\\n }\\n IfEqual Cont,1, Continue\\n Return 0\\n }\\n Return 1\\n}\\n\\nPowMod(x,n,m) { ; x**n mod m\\n y := 1, i := n, z := x\\n While i>0\\n y := i&1 ? mod(y*z,m) : y, z := mod(z*z,m), i >>= 1\\n Return y\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"seed = 1 /* seed of the random number generator */\\nscale = 0\\n\\n/* Random number from 0 to 32767. */\\ndefine rand() {\\n /* Cheap formula (from POSIX) for random numbers of low quality. */\\n seed = (seed * 1103515245 + 12345) % 4294967296\\n return ((seed / 65536) % 32768)\\n}\\n\\n/* Random number in range [from, to]. */\\ndefine rangerand(from, to) {\\n auto b, h, i, m, n, r\\n\\n m = to - from + 1\\n h = length(m) / 2 + 1 /* want h iterations of rand() % 100 */\\n b = 100 ^ h % m /* want n >= b */\\n while (1) {\\n n = 0 /* pick n in range [b, 100 ^ h) */\\n for (i = h; i > 0; i--) {\\n r = rand()\\n while (r < 68) { r = rand(); } /* loop if the modulo bias */\\n n = (n * 100) + (r % 100) /* append 2 digits to n */\\n }\\n if (n >= b) { break; } /* break unless the modulo bias */\\n }\\n return (from + (n % m))\\n}\\n\\n\\n\\n/* n is probably prime? */\\ndefine miller_rabin_test(n, k) {\\n auto d, r, a, x, s\\n\\n if (n <= 3) { return (1); }\\n if ((n % 2) == 0) { return (0); }\\n\\n /* find s and d so that d * 2^s = n - 1 */\\n d = n - 1\\n s = 0\\n while((d % 2) == 0) {\\n d /= 2\\n s += 1\\n }\\n\\n while (k-- > 0) {\\n a = rangerand(2, n - 2)\\n x = (a ^ d) % n\\n if (x != 1) {\\n for (r = 0; r < s; r++) {\\n if (x == (n - 1)) { break; }\\n x = (x * x) % n\\n }\\n if (x != (n - 1)) {\\n return (0)\\n }\\n }\\n }\\n return (1)\\n}\\n\\nfor (i = 1; i < 1000; i++) {\\n if (miller_rabin_test(i, 10) == 1) {\\n i\\n }\\n}\\nquit\\n\",\n \"language\": \"Bc\"\n },\n {\n \"code\": \"_modMul ← { n _𝕣: n|× }\\nMillerRabin ← { 𝕊n: 10𝕊n ; iter 𝕊 n: !2|n\\n # n = 1 + d×2⋆s\\n s ← 0 {𝕨 2⊸|◶⟨+⟜1𝕊2⌊∘÷˜⊢,⊣⟩ 𝕩} n-1\\n d ← (n-1) ÷ 2⋆s\\n\\n # Arithmetic mod n\\n Mul ← n _modMul\\n Pow ← Mul{𝔽´𝔽˜⍟(/2|⌊∘÷⟜2⍟(↕1+·⌊2⋆⁼⊢)𝕩)𝕨}\\n\\n # Miller-Rabin test\\n MR ← {\\n 1 =𝕩 ? 𝕨≠s ;\\n (n-1)=𝕩 ? 0 ;\\n 𝕨≤1 ? 1 ;\\n (𝕨-1) 𝕊 Mul˜𝕩\\n }\\n C ← { 𝕊a: s MR a Pow d } # Is composite\\n {0:1; C •rand.Range⌾(-⟜2) n ? 0; 𝕊𝕩-1} iter\\n}\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"# Compute n|𝕨×𝕩 in high precision\\n_modMul ← { n _𝕣:\\n # Split each argument into two 26-bit numbers, with the remaining\\n # mantissa bit encoded in the sign of the lower-order part.\\n q←1+2⋆27\\n Split ← { h←(q×𝕩)(⊣--)𝕩 ⋄ ⟨𝕩-h,h⟩ }\\n # The product, and an error relative to precise split multiplication.\\n Mul ← × (⊣ ⋈ -⊸(+´)) ·⥊×⌜○Split\\n ((n×<⟜0)⊸+ -⟜n+⊢)´ n | Mul\\n}\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \" MillerRabin 15485867\\n1\\n MillerRabin¨⊸/ 101+2×↕10\\n⟨ 101 103 107 109 113 ⟩\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"( 1:?seed\\n& ( rand\\n =\\n . mod$(!seed*1103515245+12345.4294967296):?seed\\n & mod$(div$(!seed.65536).32768)\\n )\\n& ( rangerand\\n = from to b h i m n r length\\n . !arg:(?from,?to)\\n & !to+-1*!from+1:?m\\n & @(!m:? [?length)\\n & div$(!length+1.2)+1:?h\\n & 100^mod$(!h.!m):?b\\n & whl\\n ' ( 0:?n\\n & !h+1:?i\\n & whl\\n ' ( !i+-1:>0:?i\\n & rand$:?r\\n & whl'(!r:<68&rand$:?r)\\n & !n*100+mod$(!r.100):?n\\n )\\n & !n:>!b\\n )\\n & !from+mod$(!n.!m)\\n )\\n& ( miller-rabin-test\\n = n k d r a x s return\\n . !arg:(?n,?k)\\n & ( !n:~>3&1\\n | mod$(!n.2):0\\n | !n+-1:?d\\n & 0:?s\\n & whl\\n ' ( mod$(!d.2):0\\n & !d*1/2:?d\\n & 1+!s:?s\\n )\\n & 1:?return\\n & whl\\n ' ( !k+-1:?k:~<0\\n & rangerand$(2,!n+-2):?a\\n & mod$(!a^!d.!n):?x\\n & ( !x:1\\n | 0:?r\\n & whl\\n ' ( !r+1:~>!s:?r\\n & !n+-1:~!x\\n & mod$(!x*!x.!n):?x\\n )\\n & ( !n+-1:!x\\n | 0:?return&~\\n )\\n )\\n )\\n & !return\\n )\\n )\\n& 0:?i\\n& :?primes\\n& whl\\n ' ( 1+!i:<1000:?i\\n & ( miller-rabin-test$(!i,10):1\\n & !primes !i:?primes\\n |\\n )\\n )\\n& !primes:? [-11 ?last\\n& out$!last\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#ifndef _MILLER_RABIN_H_\\n#define _MILLER_RABIN_H\\n#include <gmp.h>\\nbool miller_rabin_test(mpz_t n, int j);\\n#endif\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdbool.h>\\n#include <gmp.h>\\n#include \\\"primedecompose.h\\\"\\n\\n#define MAX_DECOMPOSE 100\\n\\nbool miller_rabin_test(mpz_t n, int j)\\n{\\n bool res;\\n mpz_t f[MAX_DECOMPOSE];\\n mpz_t s, d, a, x, r;\\n mpz_t n_1, n_3;\\n gmp_randstate_t rs;\\n int l=0, k;\\n\\n res = false;\\n gmp_randinit_default(rs);\\n\\n mpz_init(s); mpz_init(d);\\n mpz_init(a); mpz_init(x); mpz_init(r);\\n mpz_init(n_1); mpz_init(n_3);\\n\\n if ( mpz_cmp_si(n, 3) <= 0 ) { // let us consider 1, 2, 3 as prime\\n gmp_randclear(rs);\\n return true;\\n }\\n if ( mpz_odd_p(n) != 0 ) {\\n mpz_sub_ui(n_1, n, 1); // n-1\\n mpz_sub_ui(n_3, n, 3); // n-3\\n l = decompose(n_1, f);\\n mpz_set_ui(s, 0);\\n mpz_set_ui(d, 1);\\n for(k=0; k < l; k++) {\\n if ( mpz_cmp_ui(f[k], 2) == 0 )\\n\\tmpz_add_ui(s, s, 1);\\n else\\n\\tmpz_mul(d, d, f[k]);\\n } // 2^s * d = n-1\\n while(j-- > 0) {\\n mpz_urandomm(a, rs, n_3); // random from 0 to n-4\\n mpz_add_ui(a, a, 2); // random from 2 to n-2\\n mpz_powm(x, a, d, n);\\n if ( mpz_cmp_ui(x, 1) == 0 ) continue;\\n mpz_set_ui(r, 0);\\n while( mpz_cmp(r, s) < 0 ) {\\n\\tif ( mpz_cmp(x, n_1) == 0 ) break;\\n\\tmpz_powm_ui(x, x, 2, n);\\n\\tmpz_add_ui(r, r, 1);\\n }\\n if ( mpz_cmp(x, n_1) == 0 ) continue;\\n goto flush; // woops\\n }\\n res = true;\\n }\\n\\nflush:\\n for(k=0; k < l; k++) mpz_clear(f[k]);\\n mpz_clear(s); mpz_clear(d);\\n mpz_clear(a); mpz_clear(x); mpz_clear(r);\\n mpz_clear(n_1); mpz_clear(n_3);\\n gmp_randclear(rs);\\n return res;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <stdbool.h>\\n#include <gmp.h>\\n#include \\\"miller-rabin.h\\\"\\n\\n#define PREC 10\\n#define TOP 4000\\n\\nint main()\\n{\\n mpz_t num;\\n\\n mpz_init(num);\\n mpz_set_ui(num, 1);\\n\\n while ( mpz_cmp_ui(num, TOP) < 0 ) {\\n if ( miller_rabin_test(num, PREC) ) {\\n gmp_printf(\\\"%Zd maybe prime\\\\n\\\", num);\\n } /*else {\\n gmp_printf(\\\"%Zd not prime\\\\n\\\", num);\\n }*/ // remove the comment iff you're interested in\\n // sure non-prime.\\n mpz_add_ui(num, num, 1);\\n }\\n\\n mpz_clear(num);\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"// calcul a^n%mod\\nsize_t power(size_t a, size_t n, size_t mod)\\n{\\n size_t power = a;\\n size_t result = 1;\\n\\n while (n)\\n {\\n if (n & 1)\\n result = (result * power) % mod;\\n power = (power * power) % mod;\\n n >>= 1;\\n }\\n return result;\\n}\\n\\n// n−1 = 2^s * d with d odd by factoring powers of 2 from n−1\\nbool witness(size_t n, size_t s, size_t d, size_t a)\\n{\\n size_t x = power(a, d, n);\\n size_t y;\\n\\n while (s) {\\n y = (x * x) % n;\\n if (y == 1 && x != 1 && x != n-1)\\n return false;\\n x = y;\\n --s;\\n }\\n if (y != 1)\\n return false;\\n return true;\\n}\\n\\n/*\\n * if n < 1,373,653, it is enough to test a = 2 and 3;\\n * if n < 9,080,191, it is enough to test a = 31 and 73;\\n * if n < 4,759,123,141, it is enough to test a = 2, 7, and 61;\\n * if n < 1,122,004,669,633, it is enough to test a = 2, 13, 23, and 1662803;\\n * if n < 2,152,302,898,747, it is enough to test a = 2, 3, 5, 7, and 11;\\n * if n < 3,474,749,660,383, it is enough to test a = 2, 3, 5, 7, 11, and 13;\\n * if n < 341,550,071,728,321, it is enough to test a = 2, 3, 5, 7, 11, 13, and 17.\\n */\\n\\nbool is_prime_mr(size_t n)\\n{\\n if (((!(n & 1)) && n != 2 ) || (n < 2) || (n % 3 == 0 && n != 3))\\n return false;\\n if (n <= 3)\\n return true;\\n\\n size_t d = n / 2;\\n size_t s = 1;\\n while (!(d & 1)) {\\n d /= 2;\\n ++s;\\n }\\n\\n if (n < 1373653)\\n return witness(n, s, d, 2) && witness(n, s, d, 3);\\n if (n < 9080191)\\n return witness(n, s, d, 31) && witness(n, s, d, 73);\\n if (n < 4759123141)\\n return witness(n, s, d, 2) && witness(n, s, d, 7) && witness(n, s, d, 61);\\n if (n < 1122004669633)\\n return witness(n, s, d, 2) && witness(n, s, d, 13) && witness(n, s, d, 23) && witness(n, s, d, 1662803);\\n if (n < 2152302898747)\\n return witness(n, s, d, 2) && witness(n, s, d, 3) && witness(n, s, d, 5) && witness(n, s, d, 7) && witness(n, s, d, 11);\\n if (n < 3474749660383)\\n return witness(n, s, d, 2) && witness(n, s, d, 3) && witness(n, s, d, 5) && witness(n, s, d, 7) && witness(n, s, d, 11) && witness(n, s, d, 13);\\n return witness(n, s, d, 2) && witness(n, s, d, 3) && witness(n, s, d, 5) && witness(n, s, d, 7) && witness(n, s, d, 11) && witness(n, s, d, 13) && witness(n, s, d, 17);\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"typedef unsigned long long int ulong;\\n\\nulong mul_mod(ulong a, ulong b, const ulong mod) {\\n\\tulong res = 0, c; // return (a * b) % mod, avoiding overflow errors while doing modular multiplication.\\n\\tfor (b %= mod; a; a & 1 ? b >= mod - res ? res -= mod : 0, res += b : 0, a >>= 1, (c = b) >= mod - b ? c -= mod : 0, b += c);\\n\\treturn res % mod;\\n}\\n\\nulong pow_mod(ulong n, ulong exp, const ulong mod) {\\n\\tulong res = 1; // return (n ^ exp) % mod\\n\\tfor (n %= mod; exp; exp & 1 ? res = mul_mod(res, n, mod) : 0, n = mul_mod(n, n, mod), exp >>= 1);\\n\\treturn res;\\n}\\n\\nint is_prime(ulong N) {\\n\\t// Perform a Miller-Rabin test, it should be a deterministic version.\\n\\tconst ulong n_primes = 9, primes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23};\\n\\tfor (ulong i = 0; i < n_primes; ++i)\\n\\t\\tif (N % primes[i] == 0) return N == primes[i];\\n\\tif (N < primes[n_primes - 1]) return 0;\\n\\tint res = 1, s = 0;\\n\\tulong t;\\n\\tfor (t = N - 1; ~t & 1; t >>= 1, ++s);\\n\\tfor (ulong i = 0; i < n_primes && res; ++i) {\\n\\t\\tulong B = pow_mod(primes[i], t, N);\\n\\t\\tif (B != 1) {\\n\\t\\t\\tfor (int b = s; b-- && (res = B + 1 != N);)\\n\\t\\t\\t\\tB = mul_mod(B, B, N);\\n\\t\\t\\tres = !res;\\n\\t\\t}\\n\\t}\\n\\treturn res;\\n}\\n\\nint main(void){\\n\\treturn is_prime(8193145868754512737);\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <cmath>\\n#include <cstdint>\\n#include <iostream>\\n#include <vector>\\n\\nstd::vector<uint32_t> small_primes{ 2, 3 };\\n\\nuint64_t add_modulus(const uint64_t& a, const uint64_t& b, const uint64_t& modulus) {\\n uint64_t am = ( a < modulus ) ? a : a % modulus;\\n if ( b == 0 ) {\\n \\treturn am;\\n }\\n uint64_t bm = ( b < modulus ) ? b : b % modulus;\\n uint64_t b_from_m = modulus - bm;\\n if ( am >= b_from_m ) {\\n \\treturn am - b_from_m;\\n }\\n return am + bm;\\n}\\n\\nuint64_t multiply_modulus(const uint64_t& a, const uint64_t& b, const uint64_t& modulus) {\\n\\tuint64_t am = ( a < modulus ) ? a : a % modulus;\\n\\tuint64_t bm = ( b < modulus ) ? b : b % modulus;\\n if ( bm > am ) {\\n \\tstd::swap(am, bm);\\n }\\n uint64_t result;\\n while ( bm > 0 ) {\\n \\tif ( ( bm & 1) == 1 ) {\\n \\t\\tresult = add_modulus(result, am, modulus);\\n \\t}\\n \\tam = ( am << 1 ) - ( am >= ( modulus - am ) ? modulus : 0 );\\n\\t\\tbm >>= 1;\\n }\\n return result;\\n}\\n\\nuint64_t exponentiation_modulus(const uint64_t& base, const uint64_t& exponent, const uint64_t& modulus) {\\n\\tuint64_t b = base;\\n\\tuint64_t e = exponent;\\n\\tuint64_t result = 1;\\n\\twhile ( e > 0 ) {\\n\\t\\tif ( ( e & 1 ) == 1 ) {\\n\\t\\t\\tresult = multiply_modulus(result, b, modulus);\\n\\t\\t}\\n \\te >>= 1;\\n\\t\\tb = multiply_modulus(b, b, modulus);\\n\\t}\\n\\treturn result;\\n}\\n\\nbool is_composite(const uint32_t& a, const uint64_t& d, const uint64_t& n, const uint32_t& s) {\\n if ( exponentiation_modulus(a, d, n) == 1 ) {\\n return false;\\n }\\n for ( uint64_t i = 0; i < s; ++i ) {\\n if ( exponentiation_modulus(a, pow(2, i) * d, n) == n - 1 ) {\\n return false;\\n }\\n }\\n return true;\\n}\\n\\nbool composite_test(const std::vector<uint32_t>& primes, const uint64_t& d, const uint64_t& n, const uint32_t& s) {\\n\\tfor ( const uint32_t& prime : primes ) {\\n\\t\\tif ( is_composite(prime, d, n, s) ) {\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\\n\\nbool is_prime(const uint64_t& n) {\\n\\tif ( n == 0 || n == 1 ) {\\n\\t\\treturn false;\\n\\t}\\n if ( std::find(small_primes.begin(), small_primes.end(), n) != small_primes.end() ) {\\n return true;\\n }\\n if ( std::any_of(small_primes.begin(), small_primes.end(), [n](uint32_t p) { return n % p == 0; }) ) {\\n return false;\\n }\\n\\n uint64_t d = n - 1;\\n uint32_t s = 0;\\n while ( ! d % 2 ) {\\n d >>= 1;\\n s++;\\n }\\n\\n if ( n < 1'373'653 ) {\\n \\treturn composite_test({ 2, 3 }, d, n, s);\\n }\\n if ( n < 25'326'001 ) {\\n return composite_test({ 2, 3, 5 }, d, n, s);\\n }\\n if ( n < 118'670'087'467 ) {\\n if ( n == 3'215'031'751 ) {\\n return false;\\n }\\n return composite_test({ 2, 3, 5, 7 }, d, n, s);\\n }\\n if ( n < 2'152'302'898'747 ) {\\n return composite_test({ 2, 3, 5, 7, 11 }, d, n, s);\\n }\\n if ( n < 3'474'749'660'383 ) {\\n return composite_test({ 2, 3, 5, 7, 11, 13 }, d, n, s);\\n }\\n if ( n < 341'550'071'728'321 ) {\\n return composite_test({ 2, 3, 5, 7, 11, 13, 17 }, d, n, s);\\n }\\n\\n const std::vector<uint32_t> test_primes(small_primes.begin(), small_primes.begin() + 16);\\n return composite_test(test_primes, d, n, s);\\n}\\n\\nvoid create_small_primes() {\\n\\tfor ( uint32_t i = 5; i < 1'000; i += 2 ) {\\n\\t\\tif ( is_prime(i) ) {\\n\\t\\t\\tsmall_primes.emplace_back(i);\\n\\t\\t}\\n\\t}\\n}\\n\\nint main() {\\n\\tcreate_small_primes();\\n\\n\\tfor ( const uint64_t number : { 1'234'567'890'123'456'733, 1'234'567'890'123'456'737 } ) {\\n\\t\\tstd::cout << \\\"is_prime(\\\" << number << \\\") = \\\" << std::boolalpha << is_prime(number) << std::endl;\\n\\t}\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"public static class RabinMiller\\n{\\n public static bool IsPrime(int n, int k)\\n {\\n if ((n < 2) || (n % 2 == 0)) return (n == 2);\\n\\n int s = n - 1;\\n while (s % 2 == 0) s >>= 1;\\n\\n Random r = new Random();\\n for (int i = 0; i < k; i++)\\n {\\n int a = r.Next(n - 1) + 1;\\n int temp = s;\\n long mod = 1;\\n for (int j = 0; j < temp; ++j) mod = (mod * a) % n;\\n while (temp != n - 1 && mod != 1 && mod != n - 1)\\n {\\n mod = (mod * mod) % n;\\n temp *= 2;\\n }\\n\\n if (mod != n - 1 && temp % 2 == 0) return false;\\n }\\n return true;\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"// Miller-Rabin primality test as an extension method on the BigInteger type.\\n// Based on the Ruby implementation on this page.\\npublic static class BigIntegerExtensions\\n{\\n public static bool IsProbablePrime(this BigInteger source, int certainty)\\n {\\n if(source == 2 || source == 3)\\n return true;\\n if(source < 2 || source % 2 == 0)\\n return false;\\n\\n BigInteger d = source - 1;\\n int s = 0;\\n\\n while(d % 2 == 0)\\n {\\n d /= 2;\\n s += 1;\\n }\\n\\n // There is no built-in method for generating random BigInteger values.\\n // Instead, random BigIntegers are constructed from randomly generated\\n // byte arrays of the same length as the source.\\n RandomNumberGenerator rng = RandomNumberGenerator.Create();\\n byte[] bytes = new byte[source.ToByteArray().LongLength];\\n BigInteger a;\\n\\n for(int i = 0; i < certainty; i++)\\n {\\n do\\n {\\n // This may raise an exception in Mono 2.10.8 and earlier.\\n // http://bugzilla.xamarin.com/show_bug.cgi?id=2761\\n rng.GetBytes(bytes);\\n a = new BigInteger(bytes);\\n }\\n while(a < 2 || a >= source - 2);\\n\\n BigInteger x = BigInteger.ModPow(a, d, source);\\n if(x == 1 || x == source - 1)\\n continue;\\n\\n for(int r = 1; r < s; r++)\\n {\\n x = BigInteger.ModPow(x, 2, source);\\n if(x == 1)\\n return false;\\n if(x == source - 1)\\n break;\\n }\\n\\n if(x != source - 1)\\n return false;\\n }\\n\\n return true;\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(ns test-p.core\\n (:require [clojure.math.numeric-tower :as math])\\n (:require [clojure.set :as set]))\\n\\n(def WITNESSLOOP \\\"witness\\\")\\n(def COMPOSITE \\\"composite\\\")\\n\\n(defn m* [p q m]\\n \\\" Computes (p*q) mod m \\\"\\n (mod (*' p q) m))\\n\\n(defn power\\n \\\"modular exponentiation (i.e. b^e mod m\\\"\\n [b e m]\\n (loop [b b, e e, x 1]\\n (if (zero? e)\\n x\\n (if (even? e) (recur (m* b b m) (quot e 2) x)\\n (recur (m* b b m) (quot e 2) (m* b x m))))))\\n\\n; Sequence of random numbers to use in the test\\n(defn rand-num [n]\\n \\\" random number between 2 and n-2 \\\"\\n (bigint (math/floor (+' 2 (*' (- n 4) (rand))))))\\n\\n; Unique set of random numbers\\n(defn unique-random-numbers [n k]\\n \\\" k unique random numbers between 2 and n-2 \\\"\\n (loop [a-set #{}]\\n (cond\\n (>= (count a-set) k) a-set\\n :else (recur (conj a-set (rand-num n))))))\\n\\n(defn find-d-s [n]\\n \\\" write n − 1 as 2s·d with d odd \\\"\\n (loop [d (dec n), s 0]\\n (if (odd? d)\\n [d s]\\n (recur (quot d 2) (inc s)))))\\n\\n(defn random-test\\n ([n] (random-test n (min 1000 (bigint (/ n 2)))))\\n ([n k]\\n \\\" Random version of primality test\\\"\\n (let [[d s] (find-d-s n)\\n ; Individual Primality Test\\n single-test (fn [a s]\\n (let [z (power a d n)]\\n (if (some #{z} [1 (dec n)])\\n WITNESSLOOP\\n (loop [x (power z 2 n), r s]\\n (cond\\n (= x 1) COMPOSITE\\n (= x (dec n)) WITNESSLOOP\\n (= r 0) COMPOSITE\\n :else (recur (power x 2 n) (dec r)))))))]\\n ; Apply Test\\n ;(not-any? #(= COMPOSITE (local-test % s))\\n ; (unique-random-numbers n k))))\\n (not-any? #(= COMPOSITE (single-test % s)) (unique-random-numbers n k)))))\\n\\n;; Testing\\n(println \\\"Primes beteen 900-1000:\\\")\\n(doseq [q (range 900 1000)\\n :when (random-test q)]\\n (print \\\" \\\" q))\\n(println)\\n(println \\\"Is Prime?\\\" 4547337172376300111955330758342147474062293202868155909489 (random-test 4547337172376300111955330758342147474062293202868155909489))\\n(println \\\"Is Prime?\\\" 4547337172376300111955330758342147474062293202868155909393 (random-test 4547337172376300111955330758342147474062293202868155909393))\\n(println \\\"Is Prime?\\\" 643808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153\\n (random-test 643808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153))\\n\\n(println \\\"Is Prime?\\\" 743808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153\\n (random-test 743808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(ns test-p.core\\n (:require [clojure.math.numeric-tower :as math]))\\n\\n(def WITNESSLOOP \\\"witness\\\")\\n(def COMPOSITE \\\"composite\\\")\\n\\n(defn m* [p q m]\\n \\\" Computes (p*q) mod m \\\"\\n (mod (*' p q) m))\\n\\n(defn power\\n \\\"modular exponentiation (i.e. b^e mod m\\\"\\n [b e m]\\n (loop [b b, e e, x 1]\\n (if (zero? e)\\n x\\n (if (even? e) (recur (m* b b m) (quot e 2) x)\\n (recur (m* b b m) (quot e 2) (m* b x m))))))\\n\\n(defn find-d-s [n]\\n\\\" write n − 1 as 2s·d with d odd \\\"\\n(loop [d (dec n), s 0]\\n (if (odd? d)\\n [d s]\\n (recur (quot d 2) (inc s)))))\\n\\n;; Deterministic Test\\n(defn individual-deterministic-test [a d n s]\\n \\\" Deterministic Primality Test \\\"\\n (let [z (power a d n)]\\n (if (= z 1)\\n WITNESSLOOP\\n (loop [x z, r s]\\n (cond\\n (= x (dec n)) WITNESSLOOP\\n (zero? r) COMPOSITE\\n :else (recur (power x 2 n) (dec r)))))))\\n\\n(defn deterministic-test [n]\\n \\\" Sequence of Primality Tests \\\"\\n (cond\\n (some #{n} [0 1 4]) false\\n (some #{n} [2 3]) true\\n (even? n) false\\n :else (let [[d s] (find-d-s n)]\\n (cond\\n (< n 2047) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 ])\\n (< n 1373653) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3])\\n (< n 9090191) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [31 73])\\n (< n 25326001) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5])\\n (< n 3215031751) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7])\\n (< n 1122004669633) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 13 23 1662803])\\n (< n 2152302898747) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11])\\n (< n 2152302898747) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11])\\n (< n 3474749660383) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11 13])\\n (< n 341550071728321) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11 13 17])\\n (< n 3825123056546,413,051) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11 13 17 19 23])\\n (< n (math/expt 2 64) ) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11 13 17 19 23 29 31 37])\\n (< n 318665857834031151167461) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11 13 17 19 23 29 31 37])\\n (< n 3317044064679887385961981) (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) [2 3 5 7 11 13 17 19 23 29 31 37 41])\\n :else (let [k (min (dec n) (int (math/expt (Math/log n) 2)))]\\n (not-any? #(= COMPOSITE (individual-deterministic-test % d n s)) (range 2 (inc k))))))))\\n\\n\\n;; Testing\\n(println \\\"Primes beteen 900-1000:\\\")\\n(doseq [q (range 900 1000)\\n :when (deterministic-test q)]\\n (print \\\" \\\" q))\\n(println)\\n(println \\\"Is Prime?\\\" 4547337172376300111955330758342147474062293202868155909489 (deterministic-test 4547337172376300111955330758342147474062293202868155909489))\\n(println \\\"Is Prime?\\\" 4547337172376300111955330758342147474062293202868155909393 (deterministic-test 4547337172376300111955330758342147474062293202868155909393))\\nprintln \\\"Is Prime?\\\" 643808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153\\n (deterministic-test 643808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153))\\n\\n(println \\\"Is Prime?\\\" 743808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153\\n (deterministic-test 743808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153))\\n(println \\\"Is Prime?\\\" 643808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153\\n (deterministic-test 643808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153))\\n\\n(println \\\"Is Prime?\\\" 743808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153\\n (deterministic-test 743808006803554439230129854961492699151386107534013432918073439524138264842370630061369715394739134090922937332590384720397133335969549256322620979036686633213903952966175107096769180017646161851573147596390153))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"100 PRINT CHR$(147); CHR$(18); \\\"**** MILLER-RABIN PRIMALITY TEST ****\\\": PRINT\\n110 INPUT \\\"NUMBER TO TEST\\\"; N$\\n120 N = VAL(N$): IF N < 2 THEN 110\\n130 IF 0 = (N AND 1) THEN PRINT \\\"(EVEN)\\\": GOTO 380\\n140 INPUT \\\"ITERATIONS\\\"; K$\\n150 K = VAL(K$): IF K < 1 THEN 140\\n160 PRINT\\n170 DEF FNMD(M) = M - N * INT(M / N)\\n180 D = N - 1\\n190 S = 0\\n200 D = D / 2: S = S + 1\\n210 IF 0 = (D AND 1) THEN 200\\n220 P = 1\\n230 FOR I = 1 TO K\\n240 : A = INT(RND(.) * (N - 2)) + 2\\n250 : X = 1\\n260 : FOR J = 1 TO D\\n270 : X = FNMD(X * A)\\n280 : NEXT J\\n290 : IF (X = 1) OR (X = (N - 1)) THEN 360\\n300 : FOR J = 1 TO S - 1\\n310 : X = FNMD(X * X)\\n320 : IF X = 1 THEN P = 0: GOTO 370\\n330 : IF X = N - 1 THEN 360\\n340 : NEXT J\\n350 : P = 0: GOTO 370\\n360 NEXT I\\n370 P = P * (1 - 1 / (4 * K))\\n380 IF P THEN PRINT \\\"PROBABLY PRIME ( P >=\\\"; P; \\\")\\\": END\\n390 PRINT \\\"COMPOSITE.\\\"\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"(defun factor-out (number divisor)\\n \\\"Return two values R and E such that NUMBER = DIVISOR^E * R,\\n and R is not divisible by DIVISOR.\\\"\\n (do ((e 0 (1+ e))\\n (r number (/ r divisor)))\\n ((/= (mod r divisor) 0) (values r e))))\\n\\n(defun mult-mod (x y modulus) (mod (* x y) modulus))\\n\\n(defun expt-mod (base exponent modulus)\\n \\\"Fast modular exponentiation by repeated squaring.\\\"\\n (labels ((expt-mod-iter (b e p)\\n (cond ((= e 0) p)\\n ((evenp e)\\n (expt-mod-iter (mult-mod b b modulus)\\n (/ e 2)\\n p))\\n (t\\n (expt-mod-iter b\\n (1- e)\\n (mult-mod b p modulus))))))\\n (expt-mod-iter base exponent 1)))\\n\\n(defun random-in-range (lower upper)\\n \\\"Return a random integer from the range [lower..upper].\\\"\\n (+ lower (random (+ (- upper lower) 1))))\\n\\n(defun miller-rabin-test (n k)\\n \\\"Test N for primality by performing the Miller-Rabin test K times.\\n Return NIL if N is composite, and T if N is probably prime.\\\"\\n (cond ((= n 1) nil)\\n ((< n 4) t)\\n ((evenp n) nil)\\n (t\\n (multiple-value-bind (d s) (factor-out (- n 1) 2)\\n (labels ((strong-liar? (a)\\n (let ((x (expt-mod a d n)))\\n (or (= x 1)\\n (loop repeat s\\n for y = x then (mult-mod y y n)\\n thereis (= y (- n 1)))))))\\n (loop repeat k\\n always (strong-liar? (random-in-range 2 (- n 2)))))))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"require \\\"big\\\"\\n\\nmodule Primes\\n module MillerRabin\\n\\n def prime?(k = 15) # increase k for more confidence\\n neg_one_mod = d = self - 1\\n s = 0\\n while d.even?; d >>= 1; s += 1 end # d is odd after s shifts\\n k.times do\\n b = 2 + rand(self - 4) # random witness base b\\n y = powmod(b, d, self) # y = (b**d) mod self\\n next if y == 1 || y == neg_one_mod\\n (s - 1).times do\\n y = (y * y) % self # y = (y**2) mod self\\n return false if y == 1\\n break if y == neg_one_mod\\n end\\n return false if y != neg_one_mod\\n end\\n true # prime (with high probability)\\n end\\n\\n # Compute b**e mod m\\n private def powmod(b, e, m)\\n r, b = 1, b.to_big_i\\n while e > 0\\n r = (b * r) % m if e.odd?\\n b = (b * b) % m\\n e >>= 1\\n end\\n r\\n end\\n end\\nend\\n\\nstruct Int; include Primes::MillerRabin end\\n\\nputs 341521.prime?(20) # => true\\nputs 341531.prime? # => false\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"# For crystal >= 0.31.x, compile without overflow check, as either\\n# crystal build miller-rabin.cr -Ddisable_overflow --release\\n# crystal build -Ddisable_overflow miller-rabin.cr --release\\n\\nrequire \\\"big\\\"\\n\\nmodule Primes\\n module MillerRabin\\n\\n # Returns true if +self+ is a prime number, else returns false.\\n def primemr?(k = 10)\\n primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47}\\n return primes.includes? self if self <= primes.last\\n modp47 = 614_889_782_588_491_410.to_big_i # => primes.product, largest < 2^64\\n return false if modp47.gcd(self.to_big_i) != 1 # eliminates 86.2% of all integers\\n # Choose input witness bases: wits = [range, [wit_bases]] or nil\\n wits = WITNESS_RANGES.find { |range, wits| range > self }\\n witnesses = wits && wits[1] || k.times.map{ 2 + rand(self - 4) }\\n miller_rabin_test(witnesses)\\n end\\n\\n # Returns true if +self+ passes Miller-Rabin Test on witnesses +b+\\n private def miller_rabin_test(witnesses) # list of witnesses for testing\\n neg_one_mod = n = d = self - 1 # these are even as self is always odd\\n d >>= d.trailing_zeros_count # shift out factors of 2 to make d odd\\n witnesses.each do |b| # do M-R test with each witness base\\n next if (b % self) == 0 # **skip base if a multiple of input**\\n y = powmod(b, d, self) # y = (b**d) mod self\\n s = d\\n until y == 1 || y == neg_one_mod || s == n\\n y = (y * y) % self # y = (y**2) mod self\\n s <<= 1\\n end\\n return false unless y == neg_one_mod || s.odd?\\n end\\n true\\n end\\n\\n # Best known deterministic witnesses for given range and set of bases\\n # https://miller-rabin.appspot.com/\\n # https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test\\n private WITNESS_RANGES = {\\n 341_531 => {9345883071009581737},\\n 1_050_535_501 => {336781006125, 9639812373923155},\\n 350_269_456_337 => {4230279247111683200, 14694767155120705706, 16641139526367750375},\\n 55_245_642_489_451 => {2, 141889084524735, 1199124725622454117, 11096072698276303650},\\n 7_999_252_175_582_851 => {2, 4130806001517, 149795463772692060, 186635894390467037,\\n 3967304179347715805},\\n 585_226_005_592_931_977 => {2, 123635709730000, 9233062284813009, 43835965440333360,\\n 761179012939631437, 1263739024124850375},\\n 18_446_744_073_709_551_615 => {2, 325, 9375, 28178, 450775, 9780504, 1795265022},\\n \\\"318665857834031151167461\\\".to_big_i => {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37},\\n \\\"3317044064679887385961981\\\".to_big_i => {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41}\\n }\\n\\n # Compute b**e mod m\\n private def powmod(b, e, m)\\n r, b = 1, b.to_big_i\\n while e > 0\\n r = (b * r) % m if e.odd?\\n b = (b * b) % m\\n e >>= 1\\n end\\n r\\n end\\n end\\nend\\n\\nstruct Int; include Primes::MillerRabin end\\n\\ndef tm; t = Time.monotonic; yield; (Time.monotonic - t).total_seconds.round(6) end\\n\\n# 10 digit prime\\nn = 2147483647\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 18 digit non-prime\\nn = 844674407370955389\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 19 digit prime\\nn = 9241386435364257883.to_big_i\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 20 digit prime; largest < 2^64\\nn = 18446744073709551533.to_big_i\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 58 digit prime\\nn = \\\"4547337172376300111955330758342147474062293202868155909489\\\".to_big_i\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 58 digit non-prime\\nn = \\\"4547337172376300111955330758342147474062293202868155909393\\\".to_big_i\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 81 digit prime\\nn = \\\"100000000000000000000000000000000000000000000000000000000000000000000000001309503\\\".to_big_i\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 81 digit non-prime\\nn = \\\"100000000000000000000000000000000000000000000000000000000000000000000000001309509\\\".to_big_i\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 308 digit prime\\nn = \\\"94366396730334173383107353049414959521528815310548187030165936229578960209523421808912459795329035203510284576187160076386643700441216547732914250578934261891510827140267043592007225160798348913639472564715055445201512461359359488795427875530231001298552452230535485049737222714000227878890892901228389026881\\\".to_big_i\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\nn = \\\"138028649176899647846076023812164793645371887571371559091892986639999096471811910222267538577825033963552683101137782650479906670021895135954212738694784814783986671046107023185842481502719762055887490765764329237651328922972514308635045190654896041748716218441926626988737664133219271115413563418353821396401\\\".to_big_i\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\nn = \\\"123301261697053560451930527879636974557474268923771832437126939266601921428796348203611050423256894847735769138870460373141723679005090549101566289920247264982095246187318303659027201708559916949810035265951104246512008259674244307851578647894027803356820480862664695522389066327012330793517771435385653616841\\\".to_big_i\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\nn = \\\"119432521682023078841121052226157857003721669633106050345198988740042219728400958282159638484144822421840470442893056822510584029066504295892189315912923804894933736660559950053226576719285711831138657839435060908151231090715952576998400120335346005544083959311246562842277496260598128781581003807229557518839\\\".to_big_i\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\nn = \\\"132082885240291678440073580124226578272473600569147812319294626601995619845059779715619475871419551319029519794232989255381829366374647864619189704922722431776563860747714706040922215308646535910589305924065089149684429555813953571007126408164577035854428632242206880193165045777949624510896312005014225526731\\\".to_big_i\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\nn = \\\"153410708946188157980279532372610756837706984448408515364579602515073276538040155990230789600191915021209039203172105094957316552912585741177975853552299222501069267567888742458519569317286299134843250075228359900070009684517875782331709619287588451883575354340318132216817231993558066067063143257425853927599\\\".to_big_i\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\nn = \\\"103130593592068072608023213244858971741946977638988649427937324034014356815504971087381663169829571046157738503075005527471064224791270584831779395959349442093395294980019731027051356344056416276026592333932610954020105156667883269888206386119513058400355612571198438511950152690467372712488391425876725831041\\\".to_big_i\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\nn = \\\"94366396730334173383107353049414959521528815310548187030165936229578960209523421808912459795329035203510284576187160076386643700441216547732914250578934261891510827140267043592007225160798348913639472564715055445201512461359359488795427875530231001298552452230535485049737222714000227878890892901228389026881\\\".to_big_i\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.random;\\n\\nbool isProbablePrime(in ulong n, in uint k=10) /*nothrow*/ @safe /*@nogc*/ {\\n static ulong modPow(ulong b, ulong e, in ulong m)\\n pure nothrow @safe @nogc {\\n ulong result = 1;\\n while (e > 0) {\\n if ((e & 1) == 1)\\n result = (result * b) % m;\\n b = (b ^^ 2) % m;\\n e >>= 1;\\n }\\n return result;\\n }\\n\\n if (n < 2 || n % 2 == 0)\\n return n == 2;\\n\\n ulong d = n - 1;\\n ulong s = 0;\\n while (d % 2 == 0) {\\n d /= 2;\\n s++;\\n }\\n assert(2 ^^ s * d == n - 1);\\n\\n outer:\\n foreach (immutable _; 0 .. k) {\\n immutable ulong a = uniform(2, n);\\n ulong x = modPow(a, d, n);\\n if (x == 1 || x == n - 1)\\n continue;\\n foreach (immutable __; 1 .. s) {\\n x = modPow(x, 2, n);\\n if (x == 1)\\n return false;\\n if (x == n - 1)\\n continue outer;\\n }\\n return false;\\n }\\n\\n return true;\\n}\\n\\nvoid main() { // Demo code.\\n import std.stdio, std.range, std.algorithm;\\n\\n iota(2, 30).filter!isProbablePrime.writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"def millerRabinPrimalityTest(n :(int > 0), k :int, random) :boolean {\\n if (n <=> 2 || n <=> 3) { return true }\\n if (n <=> 1 || n %% 2 <=> 0) { return false }\\n var d := n - 1\\n var s := 0\\n while (d %% 2 <=> 0) {\\n d //= 2\\n s += 1\\n }\\n for _ in 1..k {\\n def nextTrial := __continue\\n def a := random.nextInt(n - 3) + 2 # [2, n - 2] = [0, n - 4] + 2 = [0, n - 3) + 2\\n var x := a**d %% n # Note: Will do optimized modular exponentiation\\n if (x <=> 1 || x <=> n - 1) { nextTrial() }\\n for _ in 1 .. (s - 1) {\\n x := x**2 %% n\\n if (x <=> 1) { return false }\\n if (x <=> n - 1) { nextTrial() }\\n }\\n return false\\n }\\n return true\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"for i ? (millerRabinPrimalityTest(i, 1, entropy)) in 4..1000 {\\n print(i, \\\" \\\")\\n}\\nprintln()\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"(lib 'bigint)\\n\\n;; output : #t if n probably prime\\n(define (miller-rabin n (k 7) (composite #f)(x))\\n(define d (1- n))\\n(define s 0)\\n(define a 0)\\n(while (even? d)\\n\\t(set! s (1+ s))\\n\\t(set! d (quotient d 2)))\\n\\n(for [(i k)]\\n\\t(set! a (+ 2 (random (- n 3))))\\n\\t(set! x (powmod a d n))\\n\\t#:continue (or (= x 1) (= x (1- n)))\\n\\t(set! composite\\n\\t(for [(r (in-range 1 s))]\\n\\t\\t(set! x (powmod x 2 n))\\n\\t\\t#:break (= x 1) => #t\\n\\t\\t#:break (= x (1- n)) => #f\\n\\t\\t#t\\n\\t\\t))\\n\\t #:break composite => #f )\\n (not composite))\\n\\n;; output\\n(miller-rabin #101)\\n → #t\\n(miller-rabin #111)\\n → #f\\n(define big-prime (random-prime 1e+100))\\n3461396142610375479080862553800503306376298093021233334170610435506057862777898396429\\n6627816219192601527\\n(miller-rabin big-prime)\\n → #t\\n(miller-rabin (1+ (factorial 100)))\\n → #f\\n(prime? (1+ (factorial 100))) ;; native\\n → #f\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"defmodule Prime do\\n use Application\\n alias :math, as: Math\\n alias :rand, as: Rand\\n\\n def start( _type, _args ) do\\n primes = 5..1000\\n |> Enum.filter( fn( x ) -> (rem x, 2) == 1 end )\\n |> Enum.filter( fn( x ) -> miller_rabin?( x, 10) == True end )\\n IO.inspect( primes, label: \\\"Primes: \\\", limit: :infinity )\\n\\n { :ok, self() }\\n end\\n\\n def modular_exp( x, y, mod ) do\\n with [ _ | bits ] = Integer.digits( y, 2 ) do\\n Enum.reduce bits, x, fn( bit, acc ) -> acc * acc |> ( &( if bit == 1, do: &1 * x, else: &1 ) ).() |> rem( mod ) end\\n end\\n end\\n\\n def miller_rabin( d, s ) when rem( d, 2 ) == 0, do: { s, d }\\n def miller_rabin( d, s ), do: miller_rabin( div( d, 2 ), s + 1 )\\n\\n def miller_rabin?( n, g ) do\\n { s, d } = miller_rabin( n - 1, 0 )\\n miller_rabin( n, g, s, d )\\n end\\n\\n def miller_rabin( n, 0, _, _ ), do: True\\n def miller_rabin( n, g, s, d ) do\\n a = 1 + Rand.uniform( n - 3 )\\n x = modular_exp( a, d, n )\\n if x == 1 or x == n - 1 do\\n miller_rabin( n, g - 1, s, d )\\n else\\n if miller_rabin( n, x, s - 1) == True, do: miller_rabin( n, g - 1, s, d ), else: False\\n end\\n end\\n\\n def miller_rabin( n, x, r ) when r <= 0, do: False\\n def miller_rabin( n, x, r ) do\\n x = modular_exp( x, 2, n )\\n unless x == 1 do\\n unless x == n - 1, do: miller_rabin( n, x, r - 1 ), else: True\\n else\\n False\\n end\\n end\\nend\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"miller_rabin?( 94366396730334173383107353049414959521528815310548187030165936229578960209523421808912459795329035203510284576187160076386643700441216547732914250578934261891510827140267043592007225160798348913639472564715055445201512461359359488795427875530231001298552452230535485049737222714000227878890892901228389026881, 1000 )\\nmiller_rabin?( 138028649176899647846076023812164793645371887571371559091892986639999096471811910222267538577825033963552683101137782650479906670021895135954212738694784814783986671046107023185842481502719762055887490765764329237651328922972514308635045190654896041748716218441926626988737664133219271115413563418353821396401, 1000 )\\nmiller_rabin?( 123301261697053560451930527879636974557474268923771832437126939266601921428796348203611050423256894847735769138870460373141723679005090549101566289920247264982095246187318303659027201708559916949810035265951104246512008259674244307851578647894027803356820480862664695522389066327012330793517771435385653616841, 1000 )\\nmiller_rabin?( 119432521682023078841121052226157857003721669633106050345198988740042219728400958282159638484144822421840470442893056822510584029066504295892189315912923804894933736660559950053226576719285711831138657839435060908151231090715952576998400120335346005544083959311246562842277496260598128781581003807229557518839, 1000 )\\nmiller_rabin?( 132082885240291678440073580124226578272473600569147812319294626601995619845059779715619475871419551319029519794232989255381829366374647864619189704922722431776563860747714706040922215308646535910589305924065089149684429555813953571007126408164577035854428632242206880193165045777949624510896312005014225526731, 1000 )\\nmiller_rabin?( 153410708946188157980279532372610756837706984448408515364579602515073276538040155990230789600191915021209039203172105094957316552912585741177975853552299222501069267567888742458519569317286299134843250075228359900070009684517875782331709619287588451883575354340318132216817231993558066067063143257425853927599, 1000 )\\nmiller_rabin?( 103130593592068072608023213244858971741946977638988649427937324034014356815504971087381663169829571046157738503075005527471064224791270584831779395959349442093395294980019731027051356344056416276026592333932610954020105156667883269888206386119513058400355612571198438511950152690467372712488391425876725831041, 1000 )\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-module(miller_rabin).\\n\\n-export([is_prime/1, power/2]).\\n\\nis_prime(1) -> false;\\nis_prime(2) -> true;\\nis_prime(3) -> true;\\nis_prime(N) when N > 3, ((N rem 2) == 0) -> false;\\nis_prime(N) when ((N rem 2) ==1), N < 341550071728321 ->\\n \\t\\t\\tis_mr_prime(N, proving_bases(N));\\nis_prime(N) when ((N rem 2) == 1) ->\\n\\t\\t\\tis_mr_prime(N, random_bases(N, 100)).\\n\\n\\nproving_bases(N) when N < 1373653 ->\\n\\t[2, 3];\\nproving_bases(N) when N < 9080191 ->\\n [31, 73];\\nproving_bases(N) when N < 25326001 ->\\n\\t[2, 3, 5];\\nproving_bases(N) when N < 3215031751 ->\\n\\t[2, 3, 5, 7];\\nproving_bases(N) when N < 4759123141 ->\\n [2, 7, 61];\\nproving_bases(N) when N < 1122004669633 ->\\n\\t[2, 13, 23, 1662803];\\nproving_bases(N) when N < 2152302898747 ->\\n\\t[2, 3, 5, 7, 11];\\nproving_bases(N) when N < 3474749660383 ->\\n [2, 3, 5, 7, 11, 13];\\nproving_bases(N) when N < 341550071728321 ->\\n [2, 3, 5, 7, 11, 13, 17].\\n\\n\\nis_mr_prime(N, As) when N>2, N rem 2 == 1 ->\\n {D, S} = find_ds(N),\\n %% this is a test for compositeness; the two case patterns disprove\\n %% compositeness.\\n not lists:any(fun(A) ->\\n case mr_series(N, A, D, S) of\\n [1|_] -> false; % first elem of list = 1\\n L -> not lists:member(N-1, L) % some elem of list = N-1\\n end\\n end,\\n As).\\n\\n\\nfind_ds(N) ->\\n find_ds(N-1, 0).\\n\\n\\nfind_ds(D, S) ->\\n case D rem 2 == 0 of\\n true ->\\n find_ds(D div 2, S+1);\\n false ->\\n {D, S}\\n end.\\n\\n\\nmr_series(N, A, D, S) when N rem 2 == 1 ->\\n Js = lists:seq(0, S),\\n lists:map(fun(J) -> pow_mod(A, power(2, J)*D, N) end, Js).\\n\\n\\npow_mod(B, E, M) ->\\n case E of\\n 0 -> 1;\\n _ -> case ((E rem 2) == 0) of\\n true -> (power(pow_mod(B, (E div 2), M), 2)) rem M;\\n false -> (B*pow_mod(B, E-1, M)) rem M\\n end\\n end.\\n\\n\\nrandom_bases(N, K) ->\\n [basis(N) || _ <- lists:seq(1, K)].\\n\\n\\nbasis(N) when N>2 ->\\n 1 + random:uniform(N-3). % random:uniform returns a single random number in range 1 -> N-3, to which is added 1, shifting the range to 2 -> N-2\\n\\n\\npower(B, E) ->\\n power(B, E, 1).\\n\\npower(_, 0, Acc) ->\\n Acc;\\npower(B, E, Acc) ->\\n power(B, E - 1, B * Acc).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"%%% @author Tony Wallace <tony@resurrection>\\n%%% @copyright (C) 2021, Tony Wallace\\n%%% @doc\\n%%% For details of the algorithms used see\\n%%% https://en.wikipedia.org/wiki/Modular_exponentiation\\n%%% @end\\n%%% Created : 21 Jul 2021 by Tony Wallace <tony@resurrection>\\n\\n-module mod.\\n-export [mod_mult/3,mod_exp/3,binary_exp/2,test/0].\\n\\nmod_mult(I1,I2,Mod) when\\n I1 > Mod,\\n is_integer(I1), is_integer(I2), is_integer(Mod) ->\\n mod_mult(I1 rem Mod,I2,Mod);\\nmod_mult(I1,I2,Mod) when\\n I2 > Mod,\\n is_integer(I1), is_integer(I2), is_integer(Mod) ->\\n mod_mult(I1,I2 rem Mod,Mod);\\nmod_mult(I1,I2,Mod) when\\n is_integer(I1), is_integer(I2), is_integer(Mod) ->\\n (I1 * I2) rem Mod.\\n\\nmod_exp(Base,Exp,Mod) when\\n is_integer(Base),\\n is_integer(Exp),\\n is_integer(Mod),\\n Base > 0,\\n Exp > 0,\\n Mod > 0 ->\\n binary_exp_mod(Base,Exp,Mod);\\nmod_exp(_,0,_) -> 1.\\n\\n\\nbinary_exp(Base,Exponent) when\\n is_integer(Base),\\n is_integer(Exponent),\\n Base > 0,\\n Exponent > 0 ->\\n binary_exp(Base,Exponent,1);\\nbinary_exp(_,0) ->\\n 1.\\n\\nbinary_exp(_,0,Result) ->\\n Result;\\nbinary_exp(Base,Exponent,Acc) ->\\n binary_exp(Base*Base,Exponent bsr 1,Acc * exp_factor(Base,Exponent)).\\n\\n\\nbinary_exp_mod(Base,Exponent,Mod) ->\\n binary_exp_mod(Base rem Mod,Exponent,Mod,1).\\nbinary_exp_mod(_,0,_,Result) ->\\n Result;\\nbinary_exp_mod(Base,Exponent,Mod,Acc) ->\\n binary_exp_mod((Base*Base) rem Mod,\\n\\t\\t Exponent bsr 1,Mod,(Acc * exp_factor(Base,Exponent))rem Mod).\\n\\nexp_factor(_,0) ->\\n 1;\\nexp_factor(Base,1) ->\\n Base;\\nexp_factor(Base,Exponent) ->\\n exp_factor(Base,Exponent band 1).\\n\\ntest() ->\\n 445 = mod_exp(4,13,497),\\n %% Rosetta code example:\\n R = 1527229998585248450016808958343740453059 =\\n\\tmod_exp(2988348162058574136915891421498819466320163312926952423791023078876139,\\n\\t\\t2351399303373464486466122544523690094744975233415544072992656881240319,\\n\\t\\tbinary_exp(10,40)),\\n R.\\n% mod module ends here\\n\\n\\n%% Modified version of rosetta code entry\\n%% Modification was more efficient exponentiation\\n%% Modification - use of rpc:pmap to utilise multithreaded CPUs\\n-module(miller_rabin).\\n\\n-export([is_prime/1,mr_series_test/4,mersennes/1,test/0]).\\n\\nis_prime(1) -> false;\\nis_prime(2) -> true;\\nis_prime(3) -> true;\\nis_prime(N) when N > 3, ((N rem 2) == 0) -> false;\\nis_prime(N) when ((N rem 2) ==1), N < 341550071728321 ->\\n \\t\\t\\tis_mr_prime(N, proving_bases(N));\\nis_prime(N) when ((N rem 2) == 1) ->\\n\\t\\t\\tis_mr_prime(N, random_bases(N, 100)).\\n\\n\\nproving_bases(N) when N < 1373653 ->\\n\\t[2, 3];\\nproving_bases(N) when N < 9080191 ->\\n [31, 73];\\nproving_bases(N) when N < 25326001 ->\\n\\t[2, 3, 5];\\nproving_bases(N) when N < 3215031751 ->\\n\\t[2, 3, 5, 7];\\nproving_bases(N) when N < 4759123141 ->\\n [2, 7, 61];\\nproving_bases(N) when N < 1122004669633 ->\\n\\t[2, 13, 23, 1662803];\\nproving_bases(N) when N < 2152302898747 ->\\n\\t[2, 3, 5, 7, 11];\\nproving_bases(N) when N < 3474749660383 ->\\n [2, 3, 5, 7, 11, 13];\\nproving_bases(N) when N < 341550071728321 ->\\n [2, 3, 5, 7, 11, 13, 17].\\n\\n\\nis_mr_prime(N, As) when N>2, N rem 2 == 1 ->\\n% TStart = erlang:monotonic_time(),\\n {D, S} = find_ds(N),\\n% elapsed(TStart,\\\"find_ds took ~p.~p seconds~n\\\"),\\n %% this is a test for compositeness; the two case patterns disprove\\n %% compositeness.\\n TestResults =\\n\\trpc:pmap({miller_rabin,mr_series_test},[N,D,S],As),\\n\\n R= not lists:any(fun(X) -> X end,TestResults),\\n% elapsed(TStart,\\\"is_mr_prime took ~p.~p seconds~n\\\"),\\n R.\\n\\nmr_series_test(A,N,D,S) ->\\n% TMrS = erlang:monotonic_time(),\\n R = case mr_series(N, A, D, S) of\\n\\t [1|_] -> false; % first elem of list = 1\\n\\t L -> not lists:member(N-1, L) % some elem of list = N-1\\n\\tend,\\n% elapsed(TMrS,\\\"mr_series took ~p.~p seconds~n\\\"),\\n R.\\n\\n%elapsed(TStart,Msg) ->\\n% TElapsed_ms = erlang:convert_time_unit(erlang:monotonic_time()-TStart,native,1000),\\n% TSec = TElapsed_ms div 1000,\\n% Tms = TElapsed_ms rem 1000,\\n% io:format(Msg, [TSec,Tms]).\\n\\n\\nfind_ds(N) ->\\n find_ds(N-1, 0).\\n\\nfind_ds(D, S) ->\\n case D rem 2 == 0 of\\n true ->\\n find_ds(D div 2, S+1);\\n false ->\\n {D, S}\\n end.\\n\\n\\nmr_series(N, A, D, S) when N rem 2 == 1 ->\\n Js = lists:seq(0, S),\\n lists:map(fun(J) -> mod:mod_exp(A, mod:binary_exp(2, J)*D, N) end, Js).\\n\\nrandom_bases(N, K) ->\\n [basis(N) || _ <- lists:seq(1, K)].\\n\\n\\nbasis(N) when N>2 ->\\n % random:uniform returns a single random number in range 1 -> N-3,\\n % to which is added 1, shifting the range to 2 -> N-2\\n 1 + rand:uniform(N-3).\\n\\nmersennes(N) when N>0, is_integer(N) ->\\n 1 bsl N - 1.\\n\\ntest() ->\\n TStart = erlang:monotonic_time(),\\n true = is_prime(7),\\n true = is_prime(41),\\n false = is_prime(42),\\n true = is_prime(mersennes(31)),\\n true = is_prime(mersennes(127)), % M(127) checks okay if 64 bit word size exceeded,\\n true = is_prime(mersennes(3217)), % about the size of an rsa key,\\n TFinish = erlang:monotonic_time(),\\n ElapsedSeconds = erlang:convert_time_unit(TFinish - TStart,native,1),\\n io:format(\\\"Time seconds = ~p~n\\\",[ElapsedSeconds]),\\n ok\\n .\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"// Miller primality test for n<3317044064679887385961981. Nigel Galloway: April 1st., 2021\\nlet a=[(2047I,[2I]);(1373653I,[2I;3I]);(9080191I,[31I;73I]);(25326001I,[2I;3I;5I]);(3215031751I,[2I;3I;5I;7I]);(4759123141I,[2I;7I;61I]);(1122004669633I,[2I;13I;23I;1662803I]);\\n (2152302898747I,[2I;3I;5I;7I;11I]);(3474749660383I,[2I;3I;5I;7I;11I;13I]);(341550071728321I,[2I;3I;5I;7I;11I;13I;17I]);(3825123056546413051I,[2I;3I;5I;7I;11I;13I;17I;19I;23I]);\\n (18446744073709551616I,[2I;3I;5I;7I;11I;13I;17I;19I;23I;29I;31I;37I]);(318665857834031151167461I,[2I;3I;5I;7I;11I;13I;17I;19I;23I;29I;31I;37I]);(3317044064679887385961981I,[2I;3I;5I;7I;11I;13I;17I;19I;23I;29I;31I;37I;41I])]\\nlet rec fN g=function (n:bigint) when n.IsEven->fN(g+1)(n/2I) |n->(n,g)\\nlet rec fG n d r=function a::t->match bigint.ModPow(a,d,n) with g when g=1I || g=n-1I->fG n d r t |g->fL(bigint.ModPow(g,2I,n)) n d t r\\n |_->true\\n and fL x n d a=function 1->false |r when x=n-1I->fG n d r a |r->fL(bigint.ModPow(x,2I,n)) n d a (r-1)\\nlet mrP n=let (d,r)=fN 0 (n-1I) in fG n d r (snd(a|>List.find(fst>>(<)n)))\\n\\nprintfn \\\"%A %A\\\" (mrP 2147483647I)(mrP 844674407370955389I)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"\\\\ modular multiplication and exponentiation\\n\\\\\\n: 3rd s\\\" 2 pick\\\" evaluate ; immediate\\n\\n: mod* ( a b m -- a*b {mod m} )\\n >r um* r> ud/mod 2drop ;\\n\\n: mod^ ( x n m -- x^n {mod m} )\\n >r 1 swap\\n begin ?dup while\\n dup 1 and 1 =\\n if\\n swap 3rd r@ mod* swap 1-\\n then dup 0>\\n if\\n rot dup r@ mod* -rot 2/\\n then\\n repeat nip rdrop ;\\n\\n\\\\ small divisor check: true => possibly prime; false => definitely not prime.\\n\\\\\\n31 constant π-128\\ncreate maybe-prime?\\n 2 c, 3 c, 5 c, 7 c, 11 c, 13 c, 17 c, 19 c, 23 c, 29 c,\\n 31 c, 37 c, 41 c, 43 c, 47 c, 53 c, 59 c, 61 c, 67 c, 71 c,\\n 73 c, 79 c, 83 c, 89 c, 97 c, 101 c, 103 c, 107 c, 109 c, 113 c,\\n 127 c,\\ndoes>\\n true -rot\\n π-128 bounds do\\n i c@ dup * over > if leave then\\n dup i c@ mod 0= if 2drop false unloop exit then\\n loop drop ;\\n\\n\\\\ actual Miller-Rabin test\\n\\\\\\n: factor-2s ( n -- s d )\\n 0 swap\\n begin dup 1 and 0= while\\n swap 1+ swap 2/\\n repeat ;\\n\\n: fermat-square-test ( n m s -- ? ) \\\\ perform n = n^2 (mod m), s-1 times\\n 1- 0 ?do\\n 2dup - -1 =\\n if leave\\n then >r dup r@ mod* r>\\n loop\\n - -1 = ;\\n\\n: strong-fermat-pseudoprime? ( n a -- ? )\\n over >r \\\\ keep the modulus on the return stack\\n >r 1- factor-2s r> \\\\ -- s d a\\n swap r@ mod^ \\\\ s d a -- s, a^d (mod n)\\n dup 1 = \\\\ a^d == 1 (mod n) => Fermat pseudoprime\\n if 2drop rdrop true\\n else r> rot fermat-square-test\\n then ;\\n\\n4.759.123.141 drop constant mr-det-3 \\\\ Deterministic threshold; 3 bases\\n\\ncreate small-prime-bases 2 , 7 , 61 , \\\\ deterministic up to mr-det-3\\ncreate large-prime-bases 2 , 325 , 9375 , 28178 , 450775 , 9780504 , 1795265022 , \\\\ known to be deterministic for 64 bit integers.\\n\\n: miler-rabin-bases ( n -- addr n )\\n mr-det-3 <\\n if small-prime-bases 3\\n else large-prime-bases 7\\n then ;\\n\\n: miller-rabin-primality-test ( n -- f )\\n dup miler-rabin-bases cells bounds do\\n dup i @ strong-fermat-pseudoprime? invert\\n if drop false unloop exit then\\n cell +loop drop true ;\\n\\n: prime? ( n -- f )\\n dup 2 <\\n if drop false\\n else\\n dup maybe-prime?\\n if dup [ 127 dup * 1+ ] literal <\\n if drop true\\n else miller-rabin-primality-test\\n then\\n else drop false\\n then\\n then ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" module Miller_Rabin\\n use PrimeDecompose\\n implicit none\\n\\n integer, parameter :: max_decompose = 100\\n\\n private :: int_rrand, max_decompose\\n\\ncontains\\n\\n function int_rrand(from, to)\\n integer(huge) :: int_rrand\\n integer(huge), intent(in) :: from, to\\n\\n real :: o\\n call random_number(o)\\n int_rrand = floor(from + o * real(max(from,to) - min(from, to)))\\n end function int_rrand\\n\\n function miller_rabin_test(n, k) result(res)\\n logical :: res\\n integer(huge), intent(in) :: n\\n integer, intent(in) :: k\\n\\n integer(huge), dimension(max_decompose) :: f\\n integer(huge) :: s, d, i, a, x, r\\n\\n res = .true.\\n f = 0\\n\\n if ( (n <= 2) .and. (n > 0) ) return\\n if ( mod(n, 2) == 0 ) then\\n res = .false.\\n return\\n end if\\n\\n call find_factors(n-1, f)\\n s = count(f == 2)\\n d = (n-1) / (2 ** s)\\n loop: do i = 1, k\\n a = int_rrand(2_huge, n-2)\\n x = mod(a ** d, n)\\n\\n if ( x == 1 ) cycle\\n do r = 0, s-1\\n if ( x == ( n - 1 ) ) cycle loop\\n x = mod(x*x, n)\\n end do\\n if ( x == (n-1) ) cycle\\n res = .false.\\n return\\n end do loop\\n res = .true.\\n end function miller_rabin_test\\n\\nend module Miller_Rabin\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"program TestMiller\\n use Miller_Rabin\\n implicit none\\n\\n integer, parameter :: prec = 30\\n integer(huge) :: i\\n\\n ! this is limited since we're not using a bignum lib\\n call do_test( (/ (i, i=1, 29) /) )\\n\\ncontains\\n\\n subroutine do_test(a)\\n integer(huge), dimension(:), intent(in) :: a\\n\\n integer :: i\\n\\n do i = 1, size(a,1)\\n print *, a(i), miller_rabin_test(a(i), prec)\\n end do\\n\\n end subroutine do_test\\n\\nend program TestMiller\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" MODULE MRTEST\\t!Try the Miller-Rabin primality test.\\n CONTAINS\\t\\t!Working only with in-built integers.\\n LOGICAL FUNCTION MRPRIME(N,TRIALS)\\t!Could N be a prime number?\\n USE DFPORT\\t!To get RAND.\\n INTEGER N\\t!The number.\\n INTEGER TRIALS\\t!The count of trials to make.\\n INTEGER D,S\\t!Represents a number in a special form.\\n INTEGER TRIAL\\n INTEGER A,X,R\\nCatch some annoying cases.\\n IF (N .LE. 4) THEN\\t!A single-digit number?\\n MRPRIME = N.GT.1 .AND. N.LE.3\\t!Yes. Some special values.\\n RETURN\\t\\t!Thus allow 2 to be reported as prime.\\n END IF\\t\\t!Yet, test for 2 as a possible factor for larger numbers.\\n MRPRIME = .FALSE.\\t!Pessimism prevails.\\n IF (MOD(N,2).EQ.0 .OR. MOD(N,3).EQ.0) RETURN\\t!Thus.\\nConstruct D such that N - 1 = D*2**S. By here, N is odd, and greater than three.\\n D = N - 1\\t\\t!Thus, D becomes an even number.\\n S = 1\\t\\t\\t!So, it has at least one power of two.\\n 10 D = D/2\\t\\t!Divide it out.\\n IF (MOD(D,2).EQ.0) THEN\\t!If there is another,\\n S = S + 1\\t\\t\\t!Count it,\\n GO TO 10\\t\\t\\t!And divide it out also.\\n END IF\\t\\t!So, D is no longer even. N = 1 + D*2**S\\n WRITE (6,11) N,D,S\\n 11 FORMAT(\\\"For \\\",I0,\\\", D=\\\",I0,\\\",S=\\\",I0)\\nConvince through repetition..\\n T:DO TRIAL = 1,TRIALS\\t!Some trials yield a definite result.\\n A = RAND(0)*(N - 2) + 2\\t!For small N, the birthday problem.\\n X = MODEXP(N,A,D)\\t\\t!A**D mod N.\\n WRITE (6,22) TRIAL,A,X,INT8(A)**D,N,MOD(INT8(A)**D,N)\\n 22 FORMAT(6X,\\\"Trial \\\",I0,\\\",A=\\\",I4,\\\",X=\\\",I4,\\n 1 \\\"=MOD(\\\",I0,\\\",\\\",I0,\\\")=\\\",I0)\\n IF (X.EQ.1 .OR. X.EQ.N - 1) CYCLE T\\t!Pox. A prime yields these.\\n DO R = 1,S - 1\\t!Step through the powers of two in N - 1.\\n X = MODEXP(N,X,2)\\t\\t!X**2 mod N.\\n WRITE (6,23) R,X\\n 23 FORMAT (14X,\\\"R=\\\",I4,\\\",X=\\\",I0)\\n IF (X.EQ.1) RETURN\\t!Definitely composite. No prime does this.\\n IF (X.EQ.N - 1) CYCLE T\\t!Pox. Try something else.\\n END DO\\t\\t!Another power of two?\\n RETURN\\t\\t!Definitely composite.\\n END DO T\\t\\t!Have another go.\\n MRPRIME = .TRUE.\\t!Would further trials yield greater assurance?\\n END FUNCTION MRPRIME\\t!Are some numbers resistant to this scheme?\\n\\n INTEGER FUNCTION MODEXP(N,X,P)\\t!Calculate X**P mod N without overflowing...\\nC Relies on a.b mod n = (a mod n)(b mod n) mod n\\n INTEGER N,X,P\\t!All presumed positive, and X < N.\\n INTEGER I\\t!A stepper.\\n INTEGER*8 V,W\\t!Broad scratchpads, otherwise N > 46340 may incur overflow in 32-bit.\\n V = 1\\t\\t!=X**0\\n IF (P.GT.0) THEN\\t!Something to do?\\n I = P\\t\\t\\t!Yes. Get a copy I can mess with.\\n W = X\\t\\t\\t!=X**1, X**2, X**4, X**8, ... except, all are mod N.\\n 1 IF (MOD(I,2).EQ.1) V = MOD(V*W,N)\\t!Incorporate W if the low-end calls for it.\\n I = I/2\\t\\t\\t!Used. Shift the next one down.\\n IF (I.GT.0) THEN\\t\\t!Still something to do?\\n W = MOD(W**2,N)\\t\\t\\t!Yes. Square W ready for the next bit up.\\n GO TO 1\\t\\t\\t\\t!Consider it.\\n END IF\\t\\t\\t\\t!Don't square W if nothing remains. It might overflow.\\n END IF\\t\\t!Negative powers are ignored.\\n MODEXP = V\\t\\t!Done, in lb(P) iterations!\\n END FUNCTION MODEXP\\t!\\\"Bit\\\" presence by arithmetic: works for non-binary arithmetic too.\\n\\n PROGRAM POKEMR\\n USE MRTEST\\n INTEGER I\\n LOGICAL HIC\\n\\n DO I = 3,36,2\\n HIC = MRPRIME(I,6)\\n WRITE (6,11) I,HIC\\n 11 FORMAT (I6,1X,L)\\n END DO\\n\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' version 29-11-2016\\n' compile with: fbc -s console\\n\\n' TRUE/FALSE are built-in constants since FreeBASIC 1.04\\n' But we have to define them for older versions.\\n#Ifndef TRUE\\n #Define FALSE 0\\n #Define TRUE Not FALSE\\n#EndIf\\n\\nFunction mul_mod(a As ULongInt, b As ULongInt, modulus As ULongInt) As ULongInt\\n ' returns a * b mod modulus\\n Dim As ULongInt x, y = a ' a mod modulus, but a is already smaller then modulus\\n\\n While b > 0\\n If (b And 1) = 1 Then\\n x = (x + y) Mod modulus\\n End If\\n y = (y Shl 1) Mod modulus\\n b = b Shr 1\\n Wend\\n\\n Return x\\n\\nEnd Function\\n\\nFunction pow_mod(b As ULongInt, power As ULongInt, modulus As ULongInt) As ULongInt\\n ' returns b ^ power mod modulus\\n Dim As ULongInt x = 1\\n\\n While power > 0\\n If (power And 1) = 1 Then\\n ' x = (x * b) Mod modulus\\n x = mul_mod(x, b, modulus)\\n End If\\n ' b = (b * b) Mod modulus\\n b = mul_mod(b, b, modulus)\\n power = power Shr 1\\n Wend\\n\\n Return x\\n\\nEnd Function\\n\\nFunction miller_rabin_test(n As ULongInt, k As Integer) As Byte\\n\\n If n > 9223372036854775808ull Then ' limit 2^63, pow_mod/mul_mod can't handle bigger numbers\\n Print \\\"number is to big, program will end\\\"\\n Sleep\\n End\\n End If\\n\\n ' 2 is a prime, if n is smaller then 2 or n is even then n = composite\\n If n = 2 Then Return TRUE\\n If (n < 2) OrElse ((n And 1) = 0) Then Return FALSE\\n\\n Dim As ULongInt a, x, n_one = n - 1, d = n_one\\n Dim As UInteger s\\n\\n While (d And 1) = 0\\n d = d Shr 1\\n s = s + 1\\n Wend\\n\\n While k > 0\\n k = k - 1\\n a = Int(Rnd * (n -2)) +2 ' 2 <= a < n\\n x = pow_mod(a, d, n)\\n If (x = 1) Or (x = n_one) Then Continue While\\n For r As Integer = 1 To s -1\\n x = pow_mod(x, 2, n)\\n If x = 1 Then Return FALSE\\n If x = n_one Then Continue While\\n Next\\n If x <> n_one Then Return FALSE\\n Wend\\n Return TRUE\\n\\nEnd Function\\n' ------=< MAIN >=------\\n\\nRandomize Timer\\n\\nDim As Integer total\\nDim As ULongInt y, limit = 2^63-1\\n\\nFor y = limit - 1000 To limit\\n If miller_rabin_test(y, 5) = TRUE Then\\n total = total + 1\\n Print y,\\n End If\\nNext\\n\\nPrint : Print\\nPrint total; \\\" primes between \\\"; limit - 1000; \\\" and \\\"; y -1\\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\": \"' version 05-04-2017\\n' compile with: fbc -s console\\n\\n' TRUE/FALSE are built-in constants since FreeBASIC 1.04\\n' But we have to define them for older versions.\\n#Ifndef TRUE\\n #Define FALSE 0\\n #Define TRUE Not FALSE\\n#EndIf\\n\\n#Include Once \\\"gmp.bi\\\"\\n\\n#Macro big_int(a)\\n Dim As Mpz_ptr a = Allocate( Len( __mpz_struct))\\n Mpz_init(a)\\n#EndMacro\\n\\nDim Shared As __gmp_randstate_struct rnd_\\n\\nFunction miller_rabin(big_n As Mpz_ptr, num_of_tests As ULong) As Byte\\n\\n If mpz_cmp_ui(big_n, 1) < 1 Then\\n Print \\\"Numbers smaller then 1 not allowed\\\"\\n Sleep 5000\\n End If\\n\\n If mpz_cmp_ui(big_n, 2) = 0 OrElse mpz_cmp_ui(big_n, 3) = 0 Then\\n Return TRUE ' 2 = prime , 3 = prime\\n End If\\n\\n If mpz_tstbit(big_n, 0) = 0 Then Return FALSE ' even number, no prime\\n\\n Dim As ULong r, s\\n Dim As Byte return_value = TRUE\\n\\n big_int(n_1) : big_int(n_2) : big_int(a) : big_int(d) : big_int(x)\\n\\n mpz_sub_ui(n_1, big_n, 1) : mpz_sub_ui(n_2, big_n, 2) : mpz_set(d, n_1)\\n\\n While mpz_tstbit(d, 0) = 0\\n mpz_fdiv_q_2exp(d, d, 1)\\n s += 1\\n Wend\\n\\n While num_of_tests > 0\\n num_of_tests -= 1\\n mpz_urandomm(a, @rnd_, n_2)\\n mpz_add_ui(a, a, 2)\\n mpz_powm(x, a, d, big_n)\\n If mpz_cmp_ui(x, 1) = 0 Or mpz_cmp(x, n_1) = 0 Then Continue While\\n\\n For r = 1 To s -1\\n mpz_powm_ui(x, x, 2, big_n)\\n If mpz_cmp_ui(x, 1) = 0 Then\\n return_value = FALSE\\n Exit While\\n End If\\n If mpz_cmp(x, n_1) = 0 Then Continue While\\n Next\\n\\n If mpz_cmp(x, n_1) <> 0 Then\\n Return_value = FALSE\\n Exit while\\n End If\\n Wend\\n\\n mpz_clear(n_1) : mpz_clear(a) : mpz_clear(d)\\n mpz_clear(n_2) : mpz_clear(x)\\n\\n Return return_value\\n\\nEnd Function\\n\\n' ------=< MAIN >=------\\n\\nDim As Long x\\nDim As String tmp\\nDim As ZString Ptr gmp_str : gmp_str = Allocate(1000000)\\nbig_int(big_n)\\n\\nRandomize Timer\\ngmp_randinit_mt(@rnd_)\\nFor x = 0 To 200 'create seed for random generator\\n tmp += Str(Int(Rnd * 10))\\nNext\\nMpz_set_str(big_n, tmp, 10)\\ngmp_randseed(@rnd_, big_n) ' seed the random number generator\\n\\nFor x = 2 To 100\\n mpz_set_ui(big_n, x)\\n If miller_rabin(big_n, 5) = TRUE Then\\n Print Using \\\"####\\\"; x;\\n End If\\nNext\\n\\nPrint : Print\\nFor x = 2 To 3300\\n mpz_set_ui(big_n, 1)\\n mpz_mul_2exp(big_n, big_n, x)\\n mpz_sub_ui(big_n, big_n, 1)\\n If miller_rabin(big_n, 5) = TRUE Then\\n gmp_str = Mpz_get_str(0, 10, big_n)\\n Print \\\"2^\\\";Str(x);\\\"-1 = prime\\\"\\n End If\\nNext\\n\\ngmp_randclear(@rnd_)\\nmpz_clear(big_n)\\nDeAllocate(gmp_str)\\n\\n' empty keyboard buffer\\nPrint : While Inkey <> \\\"\\\" : Wend\\nPrint : Print \\\"hit any key to end program\\\"\\nSleep\\nEnd\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"import util.rnd\\n\\ndef isProbablyPrimeMillerRabin( n, k ) =\\n d = n - 1\\n s = 0\\n\\n while 2|d\\n s++\\n d /= 2\\n\\n repeat k\\n a = rnd( 2, n )\\n x = a^d mod n\\n\\n if x == 1 or x == n - 1 then continue\\n\\n repeat s - 1\\n x = x^2 mod n\\n\\n if x == 1 then return false\\n\\n if x == n - 1 then break\\n else\\n return false\\n\\n true\\n\\nfor i <- 3..100\\n if isProbablyPrimeMillerRabin( i, 5 )\\n println( i )\\n\",\n \"language\": \"FunL\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"log\\\"\\n\\nfunc main() {\\n // max uint32 is not prime\\n c := uint32(1<<32 - 1)\\n // a few primes near the top of the range. source: prime pages.\\n for _, p := range []uint32{1<<32 - 5, 1<<32 - 17, 1<<32 - 65, 1<<32 - 99} {\\n for ; c > p; c-- {\\n if prime(c) {\\n log.Fatalf(\\\"prime(%d) returned true\\\", c)\\n }\\n }\\n if !prime(p) {\\n log.Fatalf(\\\"prime(%d) returned false\\\", p)\\n }\\n c--\\n }\\n}\\n\\nfunc prime(n uint32) bool {\\n // bases of 2, 7, 61 are sufficient to cover 2^32\\n switch n {\\n case 0, 1:\\n return false\\n case 2, 7, 61:\\n return true\\n }\\n // compute s, d where 2^s * d = n-1\\n nm1 := n - 1\\n d := nm1\\n s := 0\\n for d&1 == 0 {\\n d >>= 1\\n s++\\n }\\n n64 := uint64(n)\\n for _, a := range []uint32{2, 7, 61} {\\n // compute x := a^d % n\\n x := uint64(1)\\n p := uint64(a)\\n for dr := d; dr > 0; dr >>= 1 {\\n if dr&1 != 0 {\\n x = x * p % n64\\n }\\n p = p * p % n64\\n }\\n if x == 1 || uint32(x) == nm1 {\\n continue\\n }\\n for r := 1; ; r++ {\\n if r >= s {\\n return false\\n }\\n x = x * x % n64\\n if x == 1 {\\n return false\\n }\\n if uint32(x) == nm1 {\\n break\\n }\\n }\\n }\\n return true\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"module Primes where\\n\\nimport System.Random\\nimport System.IO.Unsafe\\n\\n-- Miller-Rabin wrapped up as an (almost deterministic) pure function\\nisPrime :: Integer -> Bool\\nisPrime n = unsafePerformIO (isMillerRabinPrime 100 n)\\n\\n\\nisMillerRabinPrime :: Int -> Integer -> IO Bool\\nisMillerRabinPrime k n\\n | even n = return (n==2)\\n | n < 100 = return (n `elem` primesTo100)\\n | otherwise = do ws <- witnesses k n\\n return $ and [test n (pred n) evens (head odds) a | a <- ws]\\n where\\n (evens,odds) = span even (iterate (`div` 2) (pred n))\\n\\ntest :: Integral nat => nat -> nat -> [nat] -> nat -> nat -> Bool\\ntest n n_1 evens d a = x `elem` [1,n_1] || n_1 `elem` powers\\n where\\n x = powerMod n a d\\n powers = map (powerMod n a) evens\\n\\nwitnesses :: (Num a, Ord a, Random a) => Int -> a -> IO [a]\\nwitnesses k n\\n | n < 9080191 = return [31,73]\\n | n < 4759123141 = return [2,7,61]\\n | n < 3474749660383 = return [2,3,5,7,11,13]\\n | n < 341550071728321 = return [2,3,5,7,11,13,17]\\n | otherwise = do g <- newStdGen\\n return $ take k (randomRs (2,n-1) g)\\n\\nprimesTo100 :: [Integer]\\nprimesTo100 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97]\\n\\n-- powerMod m x n = x^n `mod` m\\npowerMod :: Integral nat => nat -> nat -> nat -> nat\\npowerMod m x n = f (n - 1) x x `rem` m\\n where\\n f d a y = if d==0 then y else g d a y\\n g i b y | even i = g (i `quot` 2) (b*b `rem` m) y\\n | otherwise = f (i-1) b (b*y `rem` m)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Control.Monad (liftM)\\nimport Data.Bits (Bits, testBit, shiftR)\\nimport System.Random (Random, getStdGen, randomRs)\\nimport System.IO.Unsafe (unsafePerformIO)\\nimport Prelude hiding (even, odd)\\n\\nodd :: (Integral a, Bits a) => a -> Bool\\nodd = (`testBit` 0)\\n\\neven :: (Integral a, Bits a) => a -> Bool\\neven = not . odd\\n\\n-- modPow - Recursive modular exponentiation by taking successive powers of two\\nmodPow :: (Integral a, Bits a) => a -> a -> a -> a\\nmodPow _ 0 _ = 1\\nmodPow base ex m = let term\\n | testBit ex 0 = base `mod` m\\n | otherwise = 1\\n in (term * modPow (base^2 `mod` m) (ex `shiftR` 1) m) `mod` m\\n\\nisPrime :: (Integral a, Bits a, Random a) => a -> a -> Bool\\nisPrime n k\\n | n < 4 = if n > 1 then True else False -- Deal with 0-3.\\n | even n = False\\n | otherwise = let randPool = unsafePerformIO $ randNums (n - 2)\\n in witness k randPool\\n where\\n randNums upper = do\\n g <- getStdGen\\n return (randomRs (2, upper) g)\\n\\n (d, r) = let decompose d r\\n | odd d = (d, r)\\n | otherwise = decompose (d `shiftR` 1) (r + 1)\\n in decompose (n - 1) 0\\n\\n witness 0 _ = True\\n witness k (a:rands)\\n | x == 1 || x == n - 1 = witness (k - 1) rands\\n | otherwise = check x (r - 1)\\n where\\n x = modPow a d n\\n\\n check _ 0 = False\\n check x count\\n | x' == 1 = False\\n | x' == n - 1 = witness (k - 1) rands\\n | otherwise = check x' (count - 1)\\n where x' = modPow x 2 n\\n\\n-- main function for testing\\nmain :: IO()\\nmain = do\\n [n,k] <- liftM (map (\\\\x -> read x :: Integer) . words) getLine\\n print $ isPrime n k\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main(A)\\n every n := !A do write(n,\\\" is \\\",(mrp(n,5),\\\"probably prime\\\")|\\\"composite\\\")\\nend\\n\\nprocedure mrp(n, k)\\n if n = 2 then return \\\"\\\"\\n if n%2 = 0 then fail\\n nm1 := decompose(n-1)\\n s := nm1[1]\\n d := nm1[2]\\n every !k do {\\n a := ?(n-2)+1\\n x := (a^d)%n\\n if x = (1|(n-1)) then next\\n every !(s-1) do {\\n x := (x*x)%n\\n if x = 1 then fail\\n if x = (n-1) then break next\\n }\\n fail\\n }\\n return \\\"\\\"\\nend\\n\\nprocedure decompose(nm1)\\n s := 1\\n d := nm1\\n while d%2 = 0 do {\\n d /:= 2\\n s +:= 1\\n }\\n return [s,d]\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"import java.math.BigInteger;\\n\\npublic class MillerRabinPrimalityTest {\\n public static void main(String[] args) {\\n BigInteger n = new BigInteger(args[0]);\\n int certainty = Integer.parseInt(args[1]);\\n System.out.println(n.toString() + \\\" is \\\" + (n.isProbablePrime(certainty) ? \\\"probably prime\\\" : \\\"composite\\\"));\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.math.BigInteger;\\n\\npublic class Prime {\\n\\n // this is the RabinMiller test, deterministically correct for n < 341,550,071,728,321\\n // http://rosettacode.org/wiki/Miller-Rabin_primality_test#Python:_Proved_correct_up_to_large_N\\n public static boolean isPrime(BigInteger n, int precision) {\\n\\n if (n.compareTo(new BigInteger(\\\"341550071728321\\\")) >= 0) {\\n return n.isProbablePrime(precision);\\n }\\n\\n int intN = n.intValue();\\n if (intN == 1 || intN == 4 || intN == 6 || intN == 8) return false;\\n if (intN == 2 || intN == 3 || intN == 5 || intN == 7) return true;\\n\\n int[] primesToTest = getPrimesToTest(n);\\n if (n.equals(new BigInteger(\\\"3215031751\\\"))) {\\n return false;\\n }\\n BigInteger d = n.subtract(BigInteger.ONE);\\n BigInteger s = BigInteger.ZERO;\\n while (d.mod(BigInteger.valueOf(2)).equals(BigInteger.ZERO)) {\\n d = d.shiftRight(1);\\n s = s.add(BigInteger.ONE);\\n }\\n for (int a : primesToTest) {\\n if (try_composite(a, d, n, s)) {\\n return false;\\n }\\n }\\n return true;\\n }\\n\\n public static boolean isPrime(BigInteger n) {\\n return isPrime(n, 100);\\n }\\n\\n public static boolean isPrime(int n) {\\n return isPrime(BigInteger.valueOf(n), 100);\\n }\\n\\n public static boolean isPrime(long n) {\\n return isPrime(BigInteger.valueOf(n), 100);\\n }\\n\\n private static int[] getPrimesToTest(BigInteger n) {\\n if (n.compareTo(new BigInteger(\\\"3474749660383\\\")) >= 0) {\\n return new int[]{2, 3, 5, 7, 11, 13, 17};\\n }\\n if (n.compareTo(new BigInteger(\\\"2152302898747\\\")) >= 0) {\\n return new int[]{2, 3, 5, 7, 11, 13};\\n }\\n if (n.compareTo(new BigInteger(\\\"118670087467\\\")) >= 0) {\\n return new int[]{2, 3, 5, 7, 11};\\n }\\n if (n.compareTo(new BigInteger(\\\"25326001\\\")) >= 0) {\\n return new int[]{2, 3, 5, 7};\\n }\\n if (n.compareTo(new BigInteger(\\\"1373653\\\")) >= 0) {\\n return new int[]{2, 3, 5};\\n }\\n return new int[]{2, 3};\\n }\\n\\n private static boolean try_composite(int a, BigInteger d, BigInteger n, BigInteger s) {\\n BigInteger aB = BigInteger.valueOf(a);\\n if (aB.modPow(d, n).equals(BigInteger.ONE)) {\\n return false;\\n }\\n for (int i = 0; BigInteger.valueOf(i).compareTo(s) < 0; i++) {\\n // if pow(a, 2**i * d, n) == n-1\\n if (aB.modPow(BigInteger.valueOf(2).pow(i).multiply(d), n).equals(n.subtract(BigInteger.ONE))) {\\n return false;\\n }\\n }\\n return true;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function probablyPrime(n) {\\n if (n === 2 || n === 3) return true\\n if (n % 2 === 0 || n < 2) return false\\n\\n // Write (n - 1) as 2^s * d\\n var s = 0,\\n d = n - 1\\n while ((d & 1) == 0) {\\n d >>= 1\\n ++s\\n }\\n\\n let base = 2\\n var x = Math.pow(base, d) % n\\n\\n if (x == 1 || x == n - 1) return true\\n\\n for (var i = 1; i <= s; i++) {\\n x = (x * x) % n\\n\\n if (x === n - 1) return true\\n }\\n return false\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"witnesses(n::Union(Uint8,Int8,Uint16,Int16)) = (2,3)\\nwitnesses(n::Union(Uint32,Int32)) = n < 1373653 ? (2,3) : (2,7,61)\\nwitnesses(n::Union(Uint64,Int64)) =\\n n < 1373653 ? (2,3) :\\n n < 4759123141 ? (2,7,61) :\\n n < 2152302898747 ? (2,3,5,7,11) :\\n n < 3474749660383 ? (2,3,5,7,11,13) :\\n (2,325,9375,28178,450775,9780504,1795265022)\\n\\nfunction isprime(n::Integer)\\n n == 2 && return true\\n (n < 2) | iseven(n) && return false\\n s = trailing_zeros(n-1)\\n d = (n-1) >>> s\\n for a in witnesses(n)\\n a < n || break\\n x = powermod(a,d,n)\\n x == 1 && continue\\n t = s\\n while x != n-1\\n (t-=1) <= 0 && return false\\n x = oftype(n, Base.widemul(x,x) % n)\\n x == 1 && return false\\n end\\n end\\n return true\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nimport java.math.BigInteger\\nimport java.util.Random\\n\\nval bigTwo = BigInteger.valueOf(2L)\\n\\nfun isProbablyPrime(n: BigInteger, k: Int): Boolean {\\n require (n > bigTwo && n % bigTwo == BigInteger.ONE) { \\\"Must be odd and greater than 2\\\" }\\n var s = 0\\n val nn = n - BigInteger.ONE\\n var d: BigInteger\\n do {\\n s++\\n d = nn.shiftRight(s)\\n }\\n while (d % bigTwo == BigInteger.ZERO)\\n\\n val rand = Random()\\n loop@ for (i in 1..k) {\\n var a: BigInteger\\n do {\\n a = BigInteger(n.bitLength(), rand)\\n }\\n while(a < bigTwo || a > nn) // make sure it's in the interval [2, n - 1]\\n\\n var x = a.modPow(d, n)\\n if (x == BigInteger.ONE || x == nn) continue\\n for (r in 1 until s) {\\n x = (x * x) % n\\n if (x == BigInteger.ONE) return false\\n if (x == nn) break@loop\\n }\\n return false\\n }\\n return true\\n}\\n\\nfun main(args: Array<String>) {\\n val k = 20 // say\\n // obtain all primes up to 100\\n println(\\\"The following numbers less than 100 are prime:\\\")\\n for (i in 3..99 step 2)\\n if (isProbablyPrime(BigInteger.valueOf(i.toLong()), k)) print(\\\"$i \\\")\\n println(\\\"\\\\n\\\")\\n // check if some big numbers are probably prime\\n val bia = arrayOf(\\n BigInteger(\\\"4547337172376300111955330758342147474062293202868155909489\\\"),\\n BigInteger(\\\"4547337172376300111955330758342147474062293202868155909393\\\")\\n )\\n for (bi in bia)\\n println(\\\"$bi is ${if (isProbablyPrime(bi, k)) \\\"probably prime\\\" else \\\"composite\\\"}\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"DIM mersenne(11)\\nmersenne(1)=7\\nmersenne(2)=31\\nmersenne(3)=127\\nmersenne(4)=8191\\nmersenne(5)=131071\\nmersenne(6)=524287\\nmersenne(7)=2147483647\\nmersenne(8)=2305843009213693951\\nmersenne(9)=618970019642690137449562111\\nmersenne(10)=162259276829213363391578010288127\\nmersenne(11)=170141183460469231731687303715884105727\\n\\n\\ndim SmallPrimes(1000)\\ndata 2, 3, 5, 7, 11, 13, 17, 19, 23, 29\\ndata 31, 37, 41, 43, 47, 53, 59, 61, 67, 71\\ndata 73, 79, 83, 89, 97, 101, 103, 107, 109, 113\\ndata 127, 131, 137, 139, 149, 151, 157, 163, 167, 173\\ndata 179, 181, 191, 193, 197, 199, 211, 223, 227, 229\\ndata 233, 239, 241, 251, 257, 263, 269, 271, 277, 281\\ndata 283, 293, 307, 311, 313, 317, 331, 337, 347, 349\\ndata 353, 359, 367, 373, 379, 383, 389, 397, 401, 409\\ndata 419, 421, 431, 433, 439, 443, 449, 457, 461, 463\\ndata 467, 479, 487, 491, 499, 503, 509, 521, 523, 541\\ndata 547, 557, 563, 569, 571, 577, 587, 593, 599, 601\\ndata 607, 613, 617, 619, 631, 641, 643, 647, 653, 659\\ndata 661, 673, 677, 683, 691, 701, 709, 719, 727, 733\\ndata 739, 743, 751, 757, 761, 769, 773, 787, 797, 809\\ndata 811, 821, 823, 827, 829, 839, 853, 857, 859, 863\\ndata 877, 881, 883, 887, 907, 911, 919, 929, 937, 941\\ndata 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013\\ndata 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069\\ndata 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151\\ndata 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223\\ndata 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291\\ndata 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373\\ndata 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451\\ndata 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511\\ndata 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583\\ndata 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657\\ndata 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733\\ndata 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811\\ndata 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889\\ndata 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987\\ndata 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053\\ndata 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129\\ndata 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213\\ndata 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287\\ndata 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357\\ndata 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423\\ndata 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531\\ndata 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617\\ndata 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687\\ndata 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741\\ndata 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819\\ndata 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903\\ndata 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999\\ndata 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079\\ndata 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181\\ndata 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257\\ndata 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331\\ndata 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413\\ndata 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511\\ndata 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571\\ndata 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643\\ndata 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727\\ndata 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821\\ndata 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907\\ndata 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989\\ndata 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057\\ndata 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139\\ndata 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231\\ndata 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297\\ndata 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409\\ndata 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493\\ndata 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583\\ndata 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657\\ndata 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751\\ndata 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831\\ndata 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937\\ndata 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003\\ndata 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087\\ndata 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179\\ndata 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279\\ndata 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387\\ndata 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443\\ndata 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521\\ndata 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639\\ndata 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693\\ndata 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791\\ndata 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857\\ndata 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939\\ndata 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053\\ndata 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133\\ndata 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221\\ndata 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301\\ndata 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367\\ndata 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473\\ndata 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571\\ndata 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673\\ndata 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761\\ndata 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833\\ndata 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917\\ndata 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997\\ndata 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103\\ndata 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207\\ndata 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297\\ndata 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411\\ndata 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499\\ndata 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561\\ndata 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643\\ndata 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723\\ndata 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829\\ndata 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919\\n\\n\\nprint \\\"Liberty Miller Rabin Demonstration\\\"\\nprint \\\"Loading Small Primes\\\"\\nfor i=1 to 1000: read x : SmallPrimes(i)=x :next :NoOfSmallPrimes=1000\\nprint NoOfSmallPrimes;\\\" Primes Loaded\\\"\\n\\n'Prompt \\\"Enter number to test:\\\";resp$\\n'x=val(resp$)\\n'goto [Jump]\\n\\n\\nFor i=1 to 11\\n\\n x=mersenne(i)\\n\\n\\n t1=time$(\\\"ms\\\")\\n [TryAnother]\\n print\\n\\n iterations=0\\n [Loop]\\n iterations=iterations+1\\n\\n if MillerRabin(x,7)=1 then\\n t2=time$(\\\"ms\\\")\\n print \\\"Composite, found in \\\";t2-t1;\\\" milliseconds\\\"\\n else\\n t2=time$(\\\"ms\\\")\\n print x;\\\" Probably Prime. Tested in \\\";t2-t1;\\\" milliseconds\\\"\\n playwave \\\"tada.wav\\\", async\\n end if\\n print\\n\\nnext\\n\\nEND\\n\\n\\nFunction GCD( m,n )\\n' Find greatest common divisor with Extend Euclidian Algorithm\\n' Knuth Vol 1 P.13 Algorithm E\\n\\nap =1 :b =1 :a =0 :bp =0: c =m :d =n\\n\\n[StepE2]\\nq = int(c/d) :r = c-q*d\\n\\nif r<>0 then\\n c=d :d=r :t=ap :ap=a :a=t-q*a :t=bp :bp=b :b=t-q*b\\n 'print ap;\\\" \\\";b;\\\" \\\";a;\\\" \\\";bp;\\\" \\\";c;\\\" \\\";d;\\\" \\\";t;\\\" \\\";q\\n goto [StepE2]\\nend if\\n\\nGCD=a*m+b*n\\n\\n'print ap;\\\" \\\";b;\\\" \\\";a;\\\" \\\";bp;\\\" \\\";c;\\\" \\\";d;\\\" \\\";t;\\\" \\\";q\\n\\nEnd Function 'Extended Euclidian GCD\\n\\n function IsEven( x )\\n if ( x MOD 2 )=0 then\\n IsEven=1\\n else\\n IsEven=0\\n end if\\nend function\\n\\n\\nfunction IsOdd( x )\\n if ( x MOD 2 )=0 then\\n IsOdd=0\\n else\\n IsOdd=1\\n end if\\nend function\\n\\n\\nFunction FastExp(x, y, N)\\n\\n if (y=1) then 'MOD(x,N)\\n FastExp=x-int(x/N)*N\\n goto [ExitFunction]\\n end if\\n\\n\\n if ( y and 1) = 0 then\\n\\n dum1=y/2\\n dum2=y-int(y/2)*2 'MOD(y,2)\\n\\n temp=FastExp(x,dum1,N)\\n z=temp*temp\\n FastExp=z-int(z/N)*N 'MOD(temp*temp,N)\\n goto [ExitFunction]\\n else\\n\\n dum1=y-1\\n dum1=dum1/2\\n temp=FastExp(x,dum1,N)\\n dum2=temp*temp\\n temp=dum2-int(dum2/N)*N 'MOD(dum2,N)\\n\\n z=temp*x\\n FastExp=z-int(z/N)*N 'MOD(temp*x,N)\\n goto [ExitFunction]\\n end if\\n [ExitFunction]\\n\\nend function\\n\\n\\nFunction MillerRabin(n,b)\\n\\n'print \\\"Miller Rabin\\\"\\n't1=time$(\\\"ms\\\")\\n\\n if IsEven(n) then\\n MillerRabin=1\\n goto [ExtFn]\\n end if\\n\\n i=0\\n [Loop]\\n i=i+1\\n if i>1000 then goto [Continue]\\n if ( n MOD SmallPrimes(i) )=0 then\\n MillerRabin=0\\n goto [ExtFn]\\n end if\\n goto [Loop]\\n [Continue]\\n\\n if GCD(n,b)>1 then\\n MillerRabin=1\\n goto [ExtFn]\\n end if\\n\\n q=n-1\\n\\n t=0\\n\\n while (int(q) AND 1 )=0\\n t=t+1\\n q=int(q/2)\\n wend\\n\\n\\n r=FastExp(b, q, n)\\n\\n if ( r <> 1 ) then\\n e=0\\n while ( e < (t-1) )\\n if ( r <> (n-1) ) then\\n r=FastExp(r, r, n)\\n else\\n Exit While\\n end if\\n\\n e=e+1\\n wend\\n [ExitLoop]\\n end if\\n\\n\\n if ( (r=1) OR (r=(n-1)) ) then\\n MillerRabin=0\\n else\\n MillerRabin=1\\n end if\\n\\n[ExtFn]\\n\\nEnd Function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \" function MRIsPrime(n, k)\\n -- If n is prime, returns true (without fail).\\n -- If n is not prime, then returns false with probability ≥ 4^(-k), true otherwise.\\n -- First, deal with 1 and multiples of 2.\\n if n == 1 then\\n return false\\n elseif n == 2 then\\n return true\\n elseif n%2 == 0 then\\n return false\\n end\\n -- Now n is odd and greater than 1.\\n -- Find the unique expression n = 1 + t*2^h for n, where t is odd and h≥1.\\n t = (n-1)/2\\n h = 1\\n while t%2 == 0 do\\n t = t/2\\n h = h + 1\\n end\\n for i = 1, k do\\n -- Generate a random integer between 1 and n-1 inclusive.\\n a = math.random(n-1)\\n -- Test whether a is an element of the set L, and return false if not.\\n if not IsInL(n, a, t, h) then\\n return false\\n end\\n end\\n -- All generated a were in the set L; thus with high probability, n is prime.\\n return true\\nend\\n\\nfunction IsInL(n, a, t, h)\\n local b = PowerMod(a, t, n)\\n if b == 1 then\\n return true\\n end\\n for j = 0, h-1 do\\n if b == n-1 then\\n return true\\n elseif b == 1 then\\n return false\\n end\\n b = (b^2)%n\\n end\\n return false\\nend\\n\\nfunction PowerMod(x, y, m)\\n -- Computes x^y mod m.\\n local z = 1\\n while y > 0 do\\n if y%2 == 0 then\\n x, y, z = (x^2)%m, y//2, z\\n else\\n x, y, z = (x^2)%m, y//2, (x*z)%m\\n end\\n end\\n return z\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"MillerRabin[n_,k_]:=Module[{d=n-1,s=0,test=True},While[Mod[d,2]==0 ,d/=2 ;s++]\\nDo[\\n a=RandomInteger[{2,n-1}]; x=PowerMod[a,d,n];\\n If[x!=1,\\n For[ r = 0, r < s, r++, If[x==n-1, Continue[]]; x = Mod[x*x, n]; ];\\n If[ x != n-1, test=False ];\\n ];\\n,{k}];\\nPrint[test] ]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"MillerRabin[17388,10]\\n->False\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"/* Miller-Rabin algorithm is builtin, see function primep. Here is another implementation */\\n\\n\\n/* find highest power of p, p^s, that divide n, and return s and n / p^s */\\n\\nfacpow(n, p) := block(\\n [s: 0],\\n while mod(n, p) = 0 do (s: s + 1, n: quotient(n, p)),\\n [s, n]\\n)$\\n\\n/* check whether n is a strong pseudoprime to base a; s and d are given by facpow(n - 1, 2) */\\n\\nsppp(n, a, s, d) := block(\\n [x: power_mod(a, d, n), q: false],\\n if x = 1 or x = n - 1 then true else (\\n from 2 thru s do (\\n x: mod(x * x, n),\\n if x = 1 then return(q: false) elseif x = n - 1 then return(q: true)\\n ),\\n q\\n )\\n)$\\n\\n/* Miller-Rabin primality test. For n < 341550071728321, the test is deterministic;\\n for larger n, the number of bases tested is given by the option variable\\n primep_number_of_tests, which is used by Maxima in primep. The bound for deterministic\\n test is also the same as in primep. */\\n\\nmiller_rabin(n) := block(\\n [v: [2, 3, 5, 7, 11, 13, 17], s, d, q: true, a],\\n if n < 19 then member(n, v) else (\\n [s, d]: facpow(n - 1, 2),\\n if n < 341550071728321 then ( /* see http://oeis.org/A014233 */\\n for a in v do (\\n if not sppp(n, a, s, d) then return(q: false)\\n ),\\n q\\n ) else (\\n thru primep_number_of_tests do (\\n a: 2 + random(n - 3),\\n if not sppp(n, a, s, d) then return(q: false)\\n ),\\n q\\n )\\n )\\n)$\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"%----------------------------------------------------------------------%\\n:- module primality.\\n\\n:- interface.\\n\\n:- import_module integer.\\n:- pred is_prime(integer::in, integer::out) is multi.\\n\\n%----------------------------------------------------------------------%\\n:- implementation.\\n\\n:- import_module bool, int, list, math, require, string.\\n\\n%----------------------------------------------------------------------%\\n % is_prime/2 implements a Miller-Rabin primality test, is\\n % deterministic for N < 3.415e+14, and is probabilistic for\\n % larger N. Returns integer(0) if not prime, integer(1) if prime,\\n % and -integer(1) if fails.\\n\\n% :- pred is_prime(integer::in, integer::out) is multi.\\n\\t\\nis_prime(N, P) :-\\n\\tN < integer(2), P = integer(0).\\nis_prime(N, P) :-\\n\\tN = integer(2), P = integer(1).\\nis_prime(N, P) :-\\n\\tN = integer(3), P = integer(1).\\nis_prime(N, P) :- %% even numbers > 3: false\\n\\tN > integer(3),\\n\\t(N mod integer(2)) = integer(0),\\n\\tP = integer(0).\\n\\t\\t%%-------------deterministic--------\\nis_prime(N, P) :- %% 3 < odd number < 3.415e+14\\n\\tN > integer(3),\\n\\t(N mod integer(2)) = integer(1),\\n\\tN < integer(341550071728321),\\n\\tdeterministic_witnesses(N, DList),\\n\\tis_mr_prime(N, DList, R),\\n\\tP = R.\\n\\t\\t%%-------------probabilistic--------\\nis_prime(N, P) :- %% 3.415e+14 =< odd number\\n\\tN > integer(3),\\n\\t(N mod integer(2)) = integer(1),\\n\\tN >= integer(341550071728321),\\n\\trandom_witnesses(N, 20, RList),\\n\\tis_mr_prime(N, RList, R),\\n\\tP = R.\\nis_prime(_N, P) :- P = -integer(1).\\n\\t\\n%----------------------------------------------------------------------%\\n% returns list of deterministic witnesses\\n\\n:- pred deterministic_witnesses(integer::in,\\n list(integer)::out) is multi.\\n\\ndeterministic_witnesses(N, L) :- N < integer(1373653),\\n\\tL = [integer(2), integer(3)].\\ndeterministic_witnesses(N, L) :- N < integer(9080191),\\n\\tL = [integer(31), integer(73)].\\ndeterministic_witnesses(N, L) :- N < integer(25326001),\\n\\tL = [integer(2), integer(3), integer(5)].\\ndeterministic_witnesses(N, L) :- N < integer(3215031751),\\n\\tL = [integer(2), integer(3), integer(5), integer(7)].\\ndeterministic_witnesses(N, L) :- N < integer(4759123141),\\n\\tL = [integer(2), integer(7), integer(61)].\\ndeterministic_witnesses(N, L) :- N < integer(1122004669633),\\n\\tL = [integer(2), integer(13), integer(23), integer(1662803)].\\ndeterministic_witnesses(N, L) :- N < integer(2152302898747),\\n\\tL = [integer(2), integer(3), integer(5), integer(7), integer(11)].\\ndeterministic_witnesses(N, L) :- N < integer(3474749660383),\\n\\tL = [integer(2), integer(3), integer(5), integer(7), integer(11),\\n integer(13)].\\ndeterministic_witnesses(N, L) :- N < integer(341550071728321),\\n\\tL = [integer(2), integer(3), integer(5), integer(7),\\n\\t integer(11), integer(13), integer(17)].\\ndeterministic_witnesses(_N, L) :- L = []. %% signals failure\\n\\n%----------------------------------------------------------------------%\\n\\t%% random_witnesses/3 receives an integer, X, an int, K, and\\n\\t%% returns a list, P, of K pseudo-random integers in a range\\n\\t%% 1 to X-1.\\n\\t\\n:- pred random_witnesses(integer::in, int::in,\\n list(integer)::out) is det.\\n\\nrandom_witnesses(X, K, P) :-\\n\\tA = integer(6364136223846793005),\\n\\tB = integer(1442695040888963407),\\n\\tC = X - integer(2),\\n\\trw_loop(X, A, B, C, K, [], P).\\n\\t\\n:- pred rw_loop(integer::in, integer::in, integer::in, integer::in,\\n int::in, list(integer)::in, list(integer)::out) is det.\\n\\t\\t\\t\\t\\t\\nrw_loop(X, A, B, C, K, L, P) :-\\n\\tX1 = (((X * A) + B) mod C) + integer(1),\\n\\t( if K = 0 then P = L\\n\\t else rw_loop(X1, A, B, C, K-1, [X1|L], P)\\n\\t).\\n\\n%----------------------------------------------------------------------%\\n\\t% is_mr_prime/2 receives integer N and list As and returns true if\\n\\t% N is probably prime, and false otherwise\\n\\t\\n:- pred is_mr_prime(integer::in, list(integer)::in, integer::out) is nondet.\\n\\nis_mr_prime(N, As, R) :-\\n find_ds(N, L),\\n L = [D|T],\\n T = [S|_],\\n outer_loop(N, As, D, S, R).\\n\\n:- pred outer_loop(integer::in, list(integer)::in, integer::in,\\n integer::in, integer::out) is nondet.\\n\\t\\t\\t\\t\\t\\t\\t\\nouter_loop(N, As, D, S, R) :-\\n As = [A|At],\\n Base = powm(A, D, N), %% = A^D mod N\\n inner_loop(Base, N, integer(0), S, U),\\n\\t( if U = integer(0) then R = integer(0)\\n\\t else ( if At = [] then R = integer(1)\\n else outer_loop(N, At, D, S, R)\\n )\\n\\t).\\n\\n:- pred inner_loop(integer::in, integer::in, integer::in,\\n integer::in, integer::out) is multi.\\n\\t\\t\\t\\t\\t\\t\\t\\ninner_loop(Base, N, Loop, S, U) :-\\n Next_Base = (Base * Base) mod N,\\n Next_Loop = Loop + integer(1),\\n\\t( if Loop = integer(0) then\\n\\t \\t ( if Base = integer(1) then U = integer(1) % true\\n else if Base = N - integer(1) then U = integer(1) % true\\n else if Next_Loop = S then U = integer(0) % false\\n else inner_loop(Next_Base, N, Next_Loop, S, U)\\n )\\n\\t else if Base = N - integer(1) then U = integer(1) % true\\n\\t else if Next_Loop = S then U = integer(0) % false\\n\\t else inner_loop(Next_Base, N, Next_Loop, S, U)\\n\\t).\\n\\n%----------------------------------------------------------------------%\\n\\t% find_ds/2 receives odd integer N\\n\\t% and returns [D, S] such that N-1 = 2^S * D\\n\\t\\n:- pred find_ds(integer::in, list(integer)::out) is multi.\\n\\nfind_ds(N, L) :-\\n A = N - integer(1),\\n find_ds1(A, integer(0), L).\\n\\n:- pred find_ds1(integer::in, integer::in, list(integer)::out) is multi.\\n\\nfind_ds1(D, S, L) :-\\n\\tD mod integer(2) = integer(0),\\n\\tP = D div integer(2),\\n\\tQ = S + integer(1),\\n\\tfind_ds1(P, Q, L).\\nfind_ds1(D, S, L) :-\\n\\tL = [D, S].\\n\\t\\n%----------------------------------------------------------------------%\\n:- func powm(integer, integer, integer) = integer.\\n\\n\\t% computes A^D mod N\\n\\npowm(A, D, N) =\\t\\t\\t\\n ( if D = integer(0) then integer(1)\\n else ( if (D mod integer(2)) = integer(0) then\\n (integer.pow(powm(A, (D div integer(2)), N),\\n integer(2))) mod N\\n else (A * powm(A, D - integer(1), N)) mod N\\n )\\n\\t).\\n\\n%----------------------------------------------------------------------%\\n:- end_module primality.\\n\\n% A means of testing the predicate is_prime/2\\n%----------------------------------------------------------------------%\\n\\n:- module test_is_prime.\\n\\n:- interface.\\n\\n:- import_module io.\\n:- pred main(io::di, io::uo) is cc_multi.\\n\\n%----------------------------------------------------------------------%\\n\\n:- implementation.\\n\\n:- import_module bool, char, int, integer, list, math, require, string.\\n:- import_module primality.\\n\\n%----------------------------------------------------------------------%\\n % TEST THE IS_PRIME PREDICATE\\n % $ ./test_is_prime <integer>\\n %---------------------------------------------%\\n\\nmain(!IO) :-\\n command_line_arguments(Args, !IO),\\n filter(is_all_digits, Args, CleanArgs),\\n Arg1 = list.det_index0(CleanArgs, 0),\\n M = integer.det_from_string(Arg1),\\n\\tis_prime(M,P),\\n\\tio.format(\\\" is_prime(%s) = \\\", [s(integer.to_string(M))], !IO),\\n\\t( if P = integer(0) then io.write_string(\\\"false.\\\\n\\\", !IO)\\n\\t else if P = integer(1) then io.write_string(\\\"true.\\\\n\\\", !IO)\\n\\t else if P = -integer(1) then\\n io.write_string(\\\"N fails all tests.\\\\n\\\", !IO)\\n\\t else io.write_string(\\\"Has reported neither true nor false\\n nor any error condition.\\\\n\\\", !IO)\\n\\t).\\n\\t\\n%----------------------------------------------------------------------%\\n:- end_module test_is_prime.\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"## Nim currently doesn't have a BigInt standard library\\n## so we translate the version from Go which uses a\\n## deterministic approach, which is correct for all\\n## possible values in uint32.\\n\\nproc isPrime*(n: uint32): bool =\\n # bases of 2, 7, 61 are sufficient to cover 2^32\\n case n\\n of 0, 1: return false\\n of 2, 7, 61: return true\\n else: discard\\n\\n var\\n nm1 = n-1\\n d = nm1.int\\n s = 0\\n n = n.uint64\\n\\n while d mod 2 == 0:\\n d = d shr 1\\n s += 1\\n\\n for a in [2, 7, 61]:\\n var\\n x = 1.uint64\\n p = a.uint64\\n dr = d\\n\\n while dr > 0:\\n if dr mod 2 == 1:\\n x = x * p mod n\\n p = p * p mod n\\n dr = dr shr 1\\n\\n if x == 1 or x.uint32 == nm1:\\n continue\\n\\n var r = 1\\n while true:\\n if r >= s:\\n return false\\n x = x * x mod n\\n if x == 1:\\n return false\\n if x.uint32 == nm1:\\n break\\n r += 1\\n\\n return true\\n\\nproc isPrime*(n: int32): bool =\\n ## Overload for int32\\n n >= 0 and n.uint32.isPrime\\n\\nwhen isMainModule:\\n const primeNumber1000 = 7919 # source: https://en.wikipedia.org/wiki/List_of_prime_numbers\\n var\\n i = 0u32\\n numberPrimes = 0\\n while true:\\n if isPrime(i):\\n if numberPrimes == 999:\\n break\\n numberPrimes += 1\\n i += 1\\n\\n assert i == primeNumber1000\\n assert isPrime(2u32)\\n assert isPrime(31u32)\\n assert isPrime(37u32)\\n assert isPrime(1123u32)\\n assert isPrime(492366587u32)\\n assert isPrime(1645333507u32)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"# Compile as: $ nim c -d:release mrtest.nim\\n# Run using: $ ./mrtest\\n\\nimport math # for gcd and mod\\nimport bitops # for countTrailingZeroBits\\nimport strutils, typetraits # for number input\\nimport times, os # for timing code execution\\n\\nproc addmod*[T: SomeInteger](a, b, modulus: T): T =\\n ## Modular addition\\n let a_m = if a < modulus: a else: a mod modulus\\n if b == 0.T: return a_m\\n let b_m = if b < modulus: b else: b mod modulus\\n\\n # Avoid doing a + b that could overflow here\\n let b_from_m = modulus - b_m\\n if a_m >= b_from_m: return a_m - b_from_m\\n return a_m + b_m # safe to add here; a + b < modulus\\n\\nproc mulmod*[T: SomeInteger](a, b, modulus: T): T =\\n ## Modular multiplication\\n var a_m = if a < modulus: a else: a mod modulus\\n var b_m = if b < modulus: b else: b mod modulus\\n if b_m > a_m: swap(a_m, b_m)\\n while b_m > 0.T:\\n if (b_m and 1) == 1: result = addmod(result, a_m, modulus)\\n a_m = (a_m shl 1) - (if a_m >= (modulus - a_m): modulus else: 0)\\n b_m = b_m shr 1\\n\\nproc expmod*[T: SomeInteger](base, exponent, modulus: T): T =\\n ## Modular exponentiation\\n result = 1 # (exp 0 = 1)\\n var (e, b) = (exponent, base)\\n while e > 0.T:\\n if (e and 1) == 1: result = mulmod(result, b, modulus)\\n e = e shr 1\\n b = mulmod(b, b, modulus)\\n\\n# Returns true if +self+ passes Miller-Rabin Test on witnesses +b+\\nproc miller_rabin_test[T: SomeInteger](num: T, witnesses: seq[uint64]): bool =\\n var d = num - 1\\n let (neg_one_mod, n) = (d, d)\\n d = d shr countTrailingZeroBits(d) # suck out factors of 2 from d\\n for b in witnesses: # do M-R test with each witness base\\n if b.T mod num == 0: continue # **skip base if a multiple of input**\\n var s = d\\n var y = expmod(b.T, d, num)\\n while s != n and y != 1 and y != neg_one_mod:\\n y = mulmod(y, y, num)\\n s = s shl 1\\n if y != neg_one_mod and (s and 1) != 1: return false\\n true\\n\\nproc selectWitnesses[T: SomeInteger](num: T): seq[uint64] =\\n ## Best known deterministic witnesses for given range and number of bases\\n ## https://miller-rabin.appspot.com/\\n ## https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test\\n if num < 341_531u:\\n result = @[9345883071009581737u64]\\n elif num < 1_050_535_501u:\\n result = @[336781006125u64, 9639812373923155u64]\\n elif num < 350_269_456_337u:\\n result = @[4230279247111683200u64, 14694767155120705706u64, 16641139526367750375u64]\\n elif num < 55_245_642_489_451u:\\n result = @[2u64, 141889084524735u64, 1199124725622454117u64, 11096072698276303650u64]\\n elif num < 7_999_252_175_582_851u:\\n result = @[2u64, 4130806001517u64, 149795463772692060u64, 186635894390467037u64, 3967304179347715805u64]\\n elif num < 585_226_005_592_931_977u:\\n result = @[2u64, 123635709730000u64, 9233062284813009u64, 43835965440333360u64, 761179012939631437u64, 1263739024124850375u64]\\n elif num.uint64 < 18_446_744_073_709_551_615u64:\\n result = @[2u64, 325, 9375, 28178, 450775, 9780504, 1795265022]\\n else:\\n result = @[2u64, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\\n\\nproc primemr*[T: SomeInteger](n: T): bool =\\n let primes = @[2u64, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\\n if n <= primes[^1].T: return (n in primes) # for n <= primes.last\\n let modp47 = 614889782588491410u # => primes.product, largest < 2^64\\n if gcd(n, modp47) != 1: return false # eliminates 86.2% of all integers\\n let witnesses = selectWitnesses(n)\\n miller_rabin_test(n, witnesses)\\n\\necho \\\"\\\\nprimemr?\\\"\\necho(\\\"n = \\\", 1645333507u)\\nvar te = epochTime()\\necho primemr 1645333507u\\necho (epochTime()-te).formatFloat(ffDecimal, 6)\\n\\necho \\\"\\\\nprimemr?\\\"\\necho(\\\"n = \\\", 2147483647u)\\nte = epochTime()\\necho primemr 2147483647u\\necho (epochTime()-te).formatFloat(ffDecimal, 6)\\n\\necho \\\"\\\\nprimemr?\\\"\\necho(\\\"n = \\\", 844674407370955389u)\\nte = epochTime()\\necho primemr 844674407370955389u\\necho (epochTime()-te).formatFloat(ffDecimal, 6)\\n\\necho \\\"\\\\nprimemr?\\\"\\necho(\\\"n = \\\", 1844674407370954349u)\\nte = epochTime()\\necho primemr 1844674407370954349u\\necho (epochTime()-te).formatFloat(ffDecimal, 6)\\n\\necho \\\"\\\\nprimemr?\\\"\\necho(\\\"n = \\\", 1844674407370954351u)\\nte = epochTime()\\necho primemr 1844674407370954351u\\necho (epochTime()-te).formatFloat(ffDecimal, 6)\\n\\necho \\\"\\\\nprimemr?\\\"\\necho(\\\"n = \\\", 9223372036854775783u)\\nte = epochTime()\\necho primemr 9223372036854775783u\\necho (epochTime()-te).formatFloat(ffDecimal, 6)\\n\\necho \\\"\\\\nprimemr?\\\"\\necho(\\\"n = \\\", 9241386435364257883u64)\\nte = epochTime()\\necho primemr 9241386435364257883u64\\necho (epochTime()-te).formatFloat(ffDecimal, 6)\\n\\necho \\\"\\\\nprimemr?\\\"\\necho(\\\"n = \\\", 18446744073709551533u64, \\\", is largest prime < 2^64\\\")\\nte = epochTime()\\necho 18446744073709551533u64.primemr\\necho (epochTime()-te).formatFloat(ffDecimal, 6)\\n\\necho \\\"\\\\nprimemr?\\\"\\nlet num = 5_000_000u # => 348_513 primes\\nvar primes: seq[uint] = @[]\\necho(\\\"find primes < \\\", num)\\nte = epochTime()\\nfor n in 0u..num:\\n if n.primemr: primes.add(n)\\n stdout.write(\\\"\\\\r\\\",((float64(n) / float64(num))*100).formatFloat(ffDecimal, 1), \\\"%\\\")\\necho(\\\"\\\\nnumber of primes < \\\",num, \\\" are \\\", primes.len)\\necho (epochTime()-te).formatFloat(ffDecimal, 6)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"(* Translated from the wikipedia pseudo-code *)\\nlet miller_rabin n ~iter:k =\\n (* return r and d where n = 2^r*d (from scheme implementation) *)\\n let get_rd n =\\n let rec loop r d =\\n (* not even *)\\n if Z.(equal (logand d one) one) then\\n (r,d)\\n else\\n loop Z.(r + one) Z.(div d ~$2)\\n in\\n loop Z.zero n\\n in\\n let single_miller n r d =\\n (* (random (n - 4)) + 2 *)\\n let a = Bigint.to_zarith_bigint\\n Bigint.((random ((of_zarith_bigint n) - (of_int 4))) + (of_int 2))\\n in\\n let x = Z.(powm a d n) in\\n if Z.(equal x ~$1) || Z.(equal x (n - ~$1)) then true\\n else\\n let rec loop i x =\\n if Z.(equal ~$i (r - ~$1)) then false\\n else\\n let x = Z.(powm x ~$2 n) in\\n if Z.(equal x (n - ~$1)) then true\\n else loop (i + 1) x\\n in\\n loop 0 x\\n in\\n let n = Z.abs n in\\n if Z.(equal n one) then false\\n else if Z.(equal (logand n one) zero) then false\\n else if Z.(equal (n mod ~$3) zero) then false\\n else\\n let r, d = get_rd Z.(n - one) in\\n let rec loop i bool =\\n if i = k then bool\\n else loop (i + 1) (bool && single_miller n r d)\\n in\\n loop 0 true\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"%--------------------------------------------------------------------------%\\n% module: Primality\\n% file: Primality.oz\\n% version: 17 DEC 2014 @ 6:50AM\\n%--------------------------------------------------------------------------%\\n\\ndeclare\\n%--------------------------------------------------------------------------%\\n\\nfun {IsPrime N}\\t\\t\\t% main interface of module\\n\\tif N < 2 then false\\n\\telseif N < 4 then true\\n\\telseif (N mod 2) == 0 then false\\n\\telseif N < 341330071728321 then {IsMRprime N {DetWit N}}\\n\\telse {IsMRprime N {ProbWit N 20}}\\n\\tend\\nend\\n%--------------------------------------------------------------------------%\\n\\nfun {DetWit N}\\t\\t\\t% deterministic witnesses\\n\\tif N < 1373653 then [2 3]\\n\\telseif N < 9080191 then [31 73]\\n\\telseif N < 25326001 then [2 3 5]\\n\\telseif N < 3215031751 then [2 3 5 7]\\n\\telseif N < 4759123141 then [2 7 61]\\n\\telseif N < 1122004669633 then [2 13 23 1662803]\\n\\telseif N < 2152302898747 then [2 3 5 7 11]\\n\\telseif N < 3474749660383 then [2 3 5 7 11 13]\\n\\telseif N < 341550071728321 then [2 3 5 7 11 13 17]\\n\\telse nil\\n\\tend\\nend\\n%--------------------------------------------------------------------------%\\n\\nfun {ProbWit N K}\\t\\t% probabilistic witnesses\\n\\tlocal A B C in\\n\\tA = 6364136223846793005\\n\\tB = 1442695040888963407\\n\\tC = N - 2\\n\\t{RWloop N A B C K nil}\\n\\tend\\nend\\n\\nfun {RWloop N A B C K L}\\n\\tlocal N1 in\\n\\t\\tN1 = (((N * A) + B) mod C) + 1\\n\\t\\tif K == 0 then L\\n\\t\\telse {RWloop N1 A B C (K - 1) N1|L}\\n\\t\\tend\\n\\tend\\nend\\n%--------------------------------------------------------------------------%\\n\\nfun {IsMRprime N As}\\t% the Miller-Rabin algorithm\\t\\n\\tlocal D S T Ts in\\n\\t{FindDS N} = D|S\\n\\t{OuterLoop N As D S}\\n\\tend\\nend\\n\\nfun {OuterLoop N As D S}\\n\\tlocal A At Base C in\\n\\tAs = A|At\\n\\tBase = {Powm A D N}\\n\\tC = {InnerLoop Base N 0 S}\\n\\tif {Not C} then false\\n\\telseif {And C (At == nil)} then true\\n\\telse {OuterLoop N At D S}\\n\\tend\\n\\tend\\nend\\n\\t\\t\\t\\t\\t\\t\\t\\nfun {InnerLoop Base N Loop S}\\n\\tlocal NextBase NextLoop in\\n\\tNextBase = (Base * Base) mod N\\n\\tNextLoop = Loop + 1\\n\\t if {And (Loop == 0) (Base == 1)} then true\\n\\t elseif Base == (N - 1) then true\\n\\t elseif NextLoop == S then false\\n\\t else {InnerLoop NextBase N NextLoop S}\\n\\t end\\n\\tend\\nend\\n%--------------------------------------------------------------------------%\\n\\nfun {FindDS N}\\n\\t{FindDS1 (N - 1) 0}\\nend\\n\\nfun {FindDS1 D S}\\n\\tif (D mod 2 == 0) then {FindDS1 (D div 2) (S + 1)}\\n\\telse D|S\\n\\tend\\nend\\n%--------------------------------------------------------------------------%\\n\\t\\nfun {Powm A D N} \\t\\t% returns (A ^ D) mod N\\n\\tif D == 0 then 1\\n\\telseif (D mod 2) == 0 then {Pow {Powm A (D div 2) N} 2} mod N\\n\\telse (A * {Powm A (D - 1) N}) mod N\\n\\tend\\nend\\n%--------------------------------------------------------------------------%\\t\\n% end_module Primality\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"MR(n,k)=ispseudoprime(n,k);\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"sprp(n,b)={\\n\\tmy(s = valuation(n-1, 2), d = Mod(b, n)^(n >> s));\\n\\tif (d == 1, return(1));\\n\\tfor(i=1,s-1,\\n\\t\\tif (d == -1, return(1));\\n\\t\\td = d^2;\\n\\t);\\n\\td == -1\\n};\\n\\nMR(n,k)={\\n for(i=1,k,\\n if(!sprp(n,random(n-2)+2), return(0))\\n );\\n 1\\n};\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"A006945=[9, 2047, 1373653, 25326001, 3215031751, 2152302898747, 3474749660383, 341550071728321, 341550071728321, 3825123056546413051];\\nMiller(n)={\\n if (n%2 == 0, return(n == 2)); \\\\\\\\ Handle even numbers\\n if (n < 3, return(0)); \\\\\\\\ Handle 0, 1, and negative numbers\\n\\n if (n < 1<<64,\\n \\\\\\\\ Feitsma\\n for(i=1,#A006945,\\n if (n < A006945[i], return(1));\\n if(!sprp(n, prime(i)), return(0));\\n );\\n sprp(n,31)&sprp(n,37)\\n ,\\n \\\\\\\\ Miller + Bach\\n for(b=2,2*log(n)^2,\\n if(!sprp(n, b), return(0))\\n );\\n 1\\n )\\n};\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use bigint try => 'GMP';\\n\\nsub is_prime {\\n my ($n, $k) = @_;\\n return 1 if $n == 2;\\n return 0 if $n < 2 or $n % 2 == 0;\\n\\n my $d = $n - 1;\\n my $s = 0;\\n\\n while (!($d % 2)) {\\n $d /= 2;\\n $s++;\\n }\\n\\n LOOP: for (1 .. $k) {\\n my $a = 2 + int(rand($n - 2));\\n\\n my $x = $a->bmodpow($d, $n);\\n next if $x == 1 or $x == $n - 1;\\n\\n for (1 .. $s - 1) {\\n $x = ($x * $x) % $n;\\n return 0 if $x == 1;\\n next LOOP if $x == $n - 1;\\n }\\n return 0;\\n }\\n return 1;\\n}\\n\\nprint join \\\", \\\", grep { is_prime $_, 10 } (1 .. 1000);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use ntheory qw/is_strong_pseudoprime miller_rabin_random/;\\nsub is_prime_mr {\\n my $n = shift;\\n # If 32-bit, we can do this with 3 bases.\\n return is_strong_pseudoprime($n, 2, 7, 61) if ($n >> 32) == 0;\\n # If 64-bit, 7 is all we need.\\n return is_strong_pseudoprime($n, 2, 325, 9375, 28178, 450775, 9780504, 1795265022) if ($n >> 64) == 0;\\n # Otherwise, perform a number of random base tests, and the result is a probable prime test.\\n return miller_rabin_random($n, 20);\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use Math::Primality qw/is_strong_pseudoprime/;\\nsub is_prime_mr {\\n my $n = shift;\\n return 0 if $n < 2;\\n for (2,3,5,7,11,13,17,19,23,29,31,37) {\\n return 0 unless $n <= $_ || is_strong_pseudoprime($n,$_);\\n }\\n 1;\\n}\\nfor (1..100) { say if is_prime_mr($_) }\\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;\\\">powermod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- calculate a^n%mod</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</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> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">p</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;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">n</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;\\\">2</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;\\\">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;\\\">witness</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- n-1 = 2^s * d with d odd by factoring powers of 2 from n-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;\\\">a</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">powermod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</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;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">s</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">w</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">y</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;\\\">x</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;\\\">y</span> <span style=\\\"color: #0000FF;\\\">==</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">and</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;\\\">x</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;\\\">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: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">y</span>\\n <span style=\\\"color: #000000;\\\">w</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;\\\">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>\\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: #008080;\\\">return</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;\\\">is_prime_mr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">mod</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;\\\">0</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">or</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>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">mod</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;\\\">0</span> <span style=\\\"color: #008080;\\\">and</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: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">3</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;\\\">atom</span> <span style=\\\"color: #000000;\\\">d</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;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</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;\\\">while</span> <span style=\\\"color: #7060A8;\\\">and_bits</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><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">/=</span> <span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #000000;\\\">s</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\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">a</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\"><</span> <span style=\\\"color: #000000;\\\">1373653</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">a</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;\\\">3</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\"><</span> <span style=\\\"color: #000000;\\\">9080191</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">31</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">73</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">elsif</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: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\"><</span> <span style=\\\"color: #000000;\\\">94910107</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">machine_bits</span><span style=\\\"color: #0000FF;\\\">()=</span><span style=\\\"color: #000000;\\\">64</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\"><</span> <span style=\\\"color: #000000;\\\">4295041217</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">a</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;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">61</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">else</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;\\\">\\\"limits exceeded\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</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;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">witness</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;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">a</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: #000000;\\\">999983</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">999809</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">999727</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">52633</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">60787</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">999999</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">999995</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">999991</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;\\\">tests</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;\\\">\\\"%d is %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: #008000;\\\">\\\"composite\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"prime\\\"</span><span style=\\\"color: #0000FF;\\\">}[</span><span style=\\\"color: #000000;\\\">is_prime_mr</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;\\\">1</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\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- this is transpiled (then manually copied) to mpz_prime() in mpfr.js:</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">modp47</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">w</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">witness_ranges</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">mpz_prime_mr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- deterministic to 3,317,044,064,679,887,385,961,981</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">primes</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;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">13</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">17</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">19</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">23</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">29</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">31</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">37</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">41</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">43</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">47</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mpz_cmp_si</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">primes</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: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">mpz_get_integer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">primes</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;\\\">modp47</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">NULL</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">modp47</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"614_889_782_588_491_410\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- === product(primes), largest < 2^64</span>\\n <span style=\\\"color: #000000;\\\">w</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Best known deterministic witnesses for given range and set of bases\\n -- https://miller-rabin.appspot.com/\\n -- https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test</span>\\n <span style=\\\"color: #000000;\\\">witness_ranges</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #008000;\\\">\\\"341_531\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"9345883071009581737\\\"</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"1_050_535_501\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"336781006125\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"9639812373923155\\\"</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"350_269_456_337\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"4230279247111683200\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"14694767155120705706\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"16641139526367750375\\\"</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"55_245_642_489_451\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"2\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"141889084524735\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"1199124725622454117\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"11096072698276303650\\\"</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"7_999_252_175_582_851\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"2\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"4130806001517\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"149795463772692060\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"186635894390467037\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"3967304179347715805\\\"</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"585_226_005_592_931_977\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"2\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"123635709730000\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"9233062284813009\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"43835965440333360\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"761179012939631437\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"1263739024124850375\\\"</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"18_446_744_073_709_551_615\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"2\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"325\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"9375\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"28178\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"450775\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"9780504\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"1795265022\\\"</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"318_665_857_834_031_151_167_461\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"2\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"3\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"5\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"7\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"11\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"13\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"17\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"19\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"23\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"29\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"31\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"37\\\"</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"3_317_044_064_679_887_385_961_981\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"2\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"3\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"5\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"7\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"11\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"13\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"17\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"19\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"23\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"29\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"31\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"37\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"41\\\"</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;\\\">witness_ranges</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">witness_ranges</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: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">witness_ranges</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;\\\">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;\\\">witness_ranges</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: #000000;\\\">witness_ranges</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> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">witness_ranges</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;\\\">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;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_gcd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">modp47</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mpz_cmp_si</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: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">false</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- eliminates 86.2% of all integers</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- Choose input witness bases:\\n --</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">witnesses</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mpz_cmp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">witness_ranges</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;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">witnesses</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;\\\">k</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;\\\">k</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_sub_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</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>\\n <span style=\\\"color: #7060A8;\\\">mpz_rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- a := 0..a-1 (cf rand(n) yields 1..n)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">witnesses</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;\\\">a</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">else</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;\\\">witness_ranges</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mpz_cmp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">witness_ranges</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: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">witnesses</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">witness_ranges</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>\\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;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_sub_ui</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;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">nm1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init_set</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- d >>= 4 while (d & 0xf) == 0 # suck out factors of 2\\n -- (d >>= (d & 3)^2; d >>= (d & 1)^1) if d.even? # 4 bits at a time</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">mpz_even</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_fdiv_q_2exp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</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;\\\">end</span> <span style=\\\"color: #008080;\\\">while</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;\\\">witnesses</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">witnesses</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: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">mpz_divisible_p</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- skip multiples of input</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init_set</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_powm</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">b</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: #000080;font-style:italic;\\\">-- y := b^d % p</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">mpz_cmp_si</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;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #7060A8;\\\">mpz_cmp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">nm1</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #7060A8;\\\">mpz_cmp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">nm1</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_powm_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y</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;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- y := y^2 mod p</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_mul_2exp</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;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- s << 1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mpz_cmp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">nm1</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;\\\">mpz_even</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">false</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;\\\">end</span> <span style=\\\"color: #008080;\\\">for</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\",\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;\\\">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: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"9223372036854774808\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">c</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;\\\">4808</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">5808</span> <span style=\\\"color: #008080;\\\">do</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (b ends thus)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mpz_prime</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">c</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;\\\">\\\" %s%s\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">mpz_get_str</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #7060A8;\\\">mod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</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: #7060A8;\\\">mpz_add_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</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>\\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;\\\">\\\"\\\\n%d primes found\\\\n\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</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: #008000;\\\">\\\"4547337172376300111955330758342147474062293202868155909489\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"4547337172376300111955330758342147474062293202868155909393\\\"</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;\\\">tests</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_set_str</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</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;\\\">string</span> <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">mpz_prime</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">)?</span><span style=\\\"color: #008000;\\\">\\\"is prime\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">\\\"is composite\\\"</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\\\\n\\\\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;\\\">p</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;\\\">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;\\\">1300</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_ui_pow_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</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>\\n <span style=\\\"color: #7060A8;\\\">mpz_sub_si</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</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>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mpz_prime</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</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;\\\">\\\"2^%d-1 is prime\\\\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;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\nfunction is_prime($n, $k) {\\n if ($n == 2)\\n return true;\\n if ($n < 2 || $n % 2 == 0)\\n return false;\\n\\n $d = $n - 1;\\n $s = 0;\\n\\n while ($d % 2 == 0) {\\n $d /= 2;\\n $s++;\\n }\\n\\n for ($i = 0; $i < $k; $i++) {\\n $a = rand(2, $n-1);\\n\\n $x = bcpowmod($a, $d, $n);\\n if ($x == 1 || $x == $n-1)\\n continue;\\n\\n for ($j = 1; $j < $s; $j++) {\\n $x = bcmod(bcmul($x, $x), $n);\\n if ($x == 1)\\n return false;\\n if ($x == $n-1)\\n continue 2;\\n }\\n return false;\\n }\\n return true;\\n}\\n\\nfor ($i = 1; $i <= 1000; $i++)\\n if (is_prime($i, 10))\\n echo \\\"$i, \\\";\\necho \\\"\\\\n\\\";\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(de longRand (N)\\n (use (R D)\\n (while (=0 (setq R (abs (rand)))))\\n (until (> R N)\\n (unless (=0 (setq D (abs (rand))))\\n (setq R (* R D)) ) )\\n (% R N) ) )\\n\\n(de **Mod (X Y N)\\n (let M 1\\n (loop\\n (when (bit? 1 Y)\\n (setq M (% (* M X) N)) )\\n (T (=0 (setq Y (>> 1 Y)))\\n M )\\n (setq X (% (* X X) N)) ) ) )\\n\\n(de _prim? (N D S)\\n (use (A X R)\\n (while (> 2 (setq A (longRand N))))\\n (setq R 0 X (**Mod A D N))\\n (loop\\n (T\\n (or\\n (and (=0 R) (= 1 X))\\n (= X (dec N)) )\\n T )\\n (T\\n (or\\n (and (> R 0) (= 1 X))\\n (>= (inc 'R) S) )\\n NIL )\\n (setq X (% (* X X) N)) ) ) )\\n\\n(de prime? (N K)\\n (default K 50)\\n (and\\n (> N 1)\\n (bit? 1 N)\\n (let (D (dec N) S 0)\\n (until (bit? 1 D)\\n (setq\\n D (>> 1 D)\\n S (inc S) ) )\\n (do K\\n (NIL (_prim? N D S))\\n T ) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"int pow_mod(int m, int i,int mod){\\n\\tint x=1,y=m%mod;\\n\\twhile(i){\\n\\t\\tif(i&1) x = x*y%mod;\\n\\t\\ty = y*y%mod;\\n\\t\\ti>>=1;\\n\\t}\\n\\treturn x;\\n}\\nbool mr_pass(int a, int s, int d, int n){\\n int a_to_power = pow_mod(a, d, n);\\n if(a_to_power == 1)\\n return true;\\n for(int i = 0; i< s - 1; i++){\\n if(a_to_power == n - 1)\\n return true;\\n a_to_power = (a_to_power * a_to_power) % n;\\n }\\n return a_to_power == n - 1;\\n}\\n\\nint is_prime(int n){\\n\\tarray(int) prime ;\\n\\tprime = ({2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 47, 53, 59, 61, 67, 71, 79, 83, 89, 97, 101, 103, 107, 109, 113});\\n int idx = search( prime, n);\\n if( n < 113 && n == prime[idx] ){\\n return 1;\\n }\\n if(n < 2047) prime = ({2, 3});\\n if(n < 1373653)prime = ({2, 3});\\n if(n < 9080191)prime = ({31, 73});\\n if(n < 25326001)prime = ({2, 3, 5});\\n if(n < 3215031751)prime = ({2, 3, 5, 7});\\n if(n < 4759123141)prime = ({2, 7, 61});\\n if(n < 1122004669633)prime = ({2, 13, 23, 1662803});\\n if(n < 2152302898747)prime = ({2, 3, 5, 7, 11});\\n if(n < 3474749660383)prime = ({2, 3, 5, 7, 11, 13});\\n if(n < 341550071728321)prime = ({2, 3, 5, 7, 11, 13, 17});\\n if(n < 3825123056546413051)prime = ({2, 3, 5, 7, 11, 13, 17, 19, 23});\\n if(n < 18446744073709551616)prime = ({2, 3, 5, 7, 11, 13, 17, 19, 23, 29});\\n if(n < 318665857834031151167461)prime = ({2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31});\\n if(n < 3317044064679887385961981)prime = ({2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37});\\n else prime = ({2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 47, 53, 59, 61, 67, 71});\\n int d = n - 1;\\n int s = 0;\\n while(d % 2 == 0){\\n \\td >>= 1;\\n \\ts += 1;\\n }\\n for (int repeat=0 ; repeat < sizeof(prime); repeat++){\\n int a = prime[repeat];\\n if(!mr_pass(a, s, d, n)){\\n return 0;\\n }\\n }\\n return 1;\\n}\\nint main() {\\n\\tarray(int) lists;\\n\\tlists =({35201546659608842026088328007565866231962578784643756647773109869245232364730066609837018108561065242031153677,\\n10513733234846849736873637829838635104309714688896631127438692162131857778044158273164093838937083421380041997,\\n24684249032065892333066123534168930441269525239006410135714283699648991959894332868446109170827166448301044689,\\n76921421106760125285550929240903354966370431827792714920086011488103952094969175731459908117375995349245839343,\\n32998886283809577512914881459957314326750856532546837122557861905096711274255431870995137546575954361422085081,\\n30925729459015376480470394633122420870296099995740154747268426836472045107181955644451858184784072167623952123,\\n14083359469338511572632447718747493405040362318205860500297736061630222431052998057250747900577940212317413063,\\n10422980533212493227764163121880874101060283221003967986026457372472702684601194916229693974417851408689550781,\\n36261430139487433507414165833468680972181038593593271409697364115931523786727274410257181186996611100786935727,\\n15579763548573297857414066649875054392128789371879472432457450095645164702139048181789700140949438093329334293});\\n\\tfor(int i=0;i<sizeof(lists);i++){\\n\\t\\tint n = lists[i];\\n\\t\\tint chk = is_prime(n);\\n\\t\\tif(chk == 1) write(sprintf(\\\"%d %s\\\\n\\\",n,\\\"PRIME\\\"));\\n\\t\\telse write(sprintf(\\\"%d %s\\\\n\\\",n,\\\"COMPOSIT\\\"));\\n\\t}\\n}\\n\\nTEST\\n\\n35201546659608842026088328007565866231962578784643756647773109869245232364730066609837018108561065242031153677 PRIME\\n10513733234846849736873637829838635104309714688896631127438692162131857778044158273164093838937083421380041997 PRIME\\n24684249032065892333066123534168930441269525239006410135714283699648991959894332868446109170827166448301044689 PRIME\\n76921421106760125285550929240903354966370431827792714920086011488103952094969175731459908117375995349245839343 PRIME\\n32998886283809577512914881459957314326750856532546837122557861905096711274255431870995137546575954361422085081 PRIME\\n30925729459015376480470394633122420870296099995740154747268426836472045107181955644451858184784072167623952123 PRIME\\n14083359469338511572632447718747493405040362318205860500297736061630222431052998057250747900577940212317413063 PRIME\\n10422980533212493227764163121880874101060283221003967986026457372472702684601194916229693974417851408689550781 PRIME\\n36261430139487433507414165833468680972181038593593271409697364115931523786727274410257181186996611100786935727 PRIME\\n15579763548573297857414066649875054392128789371879472432457450095645164702139048181789700140949438093329334293 PRIME\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \":- module(primality, [is_prime/2]).\\n\\n% is_prime/2 returns false if N is composite, true if N probably prime\\n% implements a Miller-Rabin primality test and is deterministic for N < 3.415e+14,\\n% and is probabilistic for larger N. Adapted from the Erlang version.\\nis_prime(1, Ret) :- Ret = false, !. % 1 is non-prime\\nis_prime(2, Ret) :- Ret = true, !. % 2 is prime\\nis_prime(3, Ret) :- Ret = true, !. % 3 is prime\\nis_prime(N, Ret) :-\\n\\tN > 3, (N mod 2 =:= 0), Ret = false, !. % even number > 3 is composite\\nis_prime(N, Ret) :-\\n\\tN > 3, (N mod 2 =:= 1), % odd number > 3\\n\\tN < 341550071728321,\\n\\tdeterministic_witnesses(N, L),\\n \\tis_mr_prime(N, L, Ret), !. % deterministic test\\nis_prime(N, Ret) :-\\n\\trandom_witnesses(N, 100, [], Out),\\n\\tis_mr_prime(N, Out, Ret), !. % probabilistic test\\n\\n% returns list of deterministic witnesses\\ndeterministic_witnesses(N, L) :- N < 1373653,\\n\\tL = [2, 3].\\ndeterministic_witnesses(N, L) :- N < 9080191,\\n\\tL = [31, 73].\\ndeterministic_witnesses(N, L) :- N < 25326001,\\n\\tL = [2, 3, 5].\\ndeterministic_witnesses(N, L) :- N < 3215031751,\\n\\tL = [2, 3, 5, 7].\\ndeterministic_witnesses(N, L) :- N < 4759123141,\\n\\tL = [2, 7, 61].\\ndeterministic_witnesses(N, L) :- N < 1122004669633,\\n\\tL = [2, 13, 23, 1662803].\\ndeterministic_witnesses(N, L) :- N < 2152302898747,\\n\\tL = [2, 3, 5, 7, 11].\\ndeterministic_witnesses(N, L) :- N < 3474749660383,\\n\\tL = [2, 3, 5, 7, 11, 13].\\ndeterministic_witnesses(N, L) :- N < 341550071728321,\\n\\tL = [2, 3, 5, 7, 11, 13, 17].\\n\\n% random_witnesses/4 returns a list of K witnesses selected at random with range 2 -> N-2\\nrandom_witnesses(_, 0, T, T).\\nrandom_witnesses(N, K, T, Out) :-\\n\\t\\tG is N - 2,\\n\\t\\tH is 1 + random(G),\\n\\t\\tI is K - 1,\\n \\trandom_witnesses(N, I, [H | T], Out), !.\\n\\n% find_ds/2 receives odd integer N and returns [D, S] s.t. N-1 = 2^S * D\\nfind_ds(N, L) :-\\n\\tA is N - 1,\\n find_ds(A, 0, L), !.\\n\\nfind_ds(D, S, L) :-\\n\\tD mod 2 =:= 0,\\n\\tP is D // 2,\\n\\tQ is S + 1,\\n\\tfind_ds(P, Q, L), !.\\nfind_ds(D, S, L) :-\\n\\tL = [D, S].\\n\\nis_mr_prime(N, As, Ret) :-\\n find_ds(N, L),\\n L = [D | T],\\n T = [S | _],\\n outer_loop(N, As, D, S, Ret), !.\\n\\nouter_loop(N, As, D, S, Ret) :-\\n As = [A | At],\\n Base is powm(A, D, N),\\n inner_loop(Base, N, 0, S, Result),\\n\\t( Result == false -> Ret = false\\n\\t; Result == true, At == [] -> Ret = true\\n\\t; outer_loop(N, At, D, S, Ret)\\n\\t).\\n\\ninner_loop(Base, N, Loop, S, Result) :-\\n Next_Base is (Base * Base) mod N,\\n Next_Loop is Loop + 1,\\n\\t( Loop =:= 0, Base =:= 1 -> Result = true\\n\\t; Base =:= N-1 -> Result = true\\n\\t; Next_Loop =:= S -> Result = false\\n\\t; inner_loop(Next_Base, N, Next_Loop, S, Result)\\n\\t).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Enumeration\\n #Composite\\n #Probably_prime\\nEndEnumeration\\n\\nProcedure Miller_Rabin(n, k)\\n Protected d=n-1, s, x, r\\n If n=2\\n ProcedureReturn #Probably_prime\\n ElseIf n%2=0 Or n<2\\n ProcedureReturn #Composite\\n EndIf\\n While d%2=0\\n d/2\\n s+1\\n Wend\\n While k>0\\n k-1\\n x=Int(Pow(2+Random(n-4),d))%n\\n If x=1 Or x=n-1: Continue: EndIf\\n For r=1 To s-1\\n x=(x*x)%n\\n If x=1: ProcedureReturn #Composite: EndIf\\n If x=n-1: Break: EndIf\\n Next\\n If x<>n-1: ProcedureReturn #Composite: EndIf\\n Wend\\n ProcedureReturn #Probably_prime\\nEndProcedure\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import random\\n\\ndef is_Prime(n):\\n \\\"\\\"\\\"\\n Miller-Rabin primality test.\\n\\n A return value of False means n is certainly not prime. A return value of\\n True means n is very likely a prime.\\n \\\"\\\"\\\"\\n if n!=int(n):\\n return False\\n n=int(n)\\n #Miller-Rabin test for prime\\n if n==0 or n==1 or n==4 or n==6 or n==8 or n==9:\\n return False\\n\\n if n==2 or n==3 or n==5 or n==7:\\n return True\\n s = 0\\n d = n-1\\n while d%2==0:\\n d>>=1\\n s+=1\\n assert(2**s * d == n-1)\\n\\n def trial_composite(a):\\n if pow(a, d, n) == 1:\\n return False\\n for i in range(s):\\n if pow(a, 2**i * d, n) == n-1:\\n return False\\n return True\\n\\n for i in range(8):#number of trials\\n a = random.randrange(2, n)\\n if trial_composite(a):\\n return False\\n\\n return True\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def _try_composite(a, d, n, s):\\n if pow(a, d, n) == 1:\\n return False\\n for i in range(s):\\n if pow(a, 2**i * d, n) == n-1:\\n return False\\n return True # n is definitely composite\\n\\ndef is_prime(n, _precision_for_huge_n=16):\\n if n in _known_primes:\\n return True\\n if any((n % p) == 0 for p in _known_primes) or n in (0, 1):\\n return False\\n d, s = n - 1, 0\\n while not d % 2:\\n d, s = d >> 1, s + 1\\n # Returns exact according to http://primes.utm.edu/prove/prove2_3.html\\n if n < 1373653:\\n return not any(_try_composite(a, d, n, s) for a in (2, 3))\\n if n < 25326001:\\n return not any(_try_composite(a, d, n, s) for a in (2, 3, 5))\\n if n < 118670087467:\\n if n == 3215031751:\\n return False\\n return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7))\\n if n < 2152302898747:\\n return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7, 11))\\n if n < 3474749660383:\\n return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7, 11, 13))\\n if n < 341550071728321:\\n return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7, 11, 13, 17))\\n # otherwise\\n return not any(_try_composite(a, d, n, s)\\n for a in _known_primes[:_precision_for_huge_n])\\n\\n_known_primes = [2, 3]\\n_known_primes += [x for x in range(5, 1000, 2) if is_prime(x)]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ nextword\\n dup $ \\\"\\\" = if\\n [ $ \\\"var needs a name\\\"\\n message put bail ]\\n $ \\\" [ stack 0 ] is \\\"\\n over join\\n $ \\\" [ \\\"\\n join over join\\n $ \\\" replace ] is ->\\\"\\n join over join\\n $ \\\" [ \\\"\\n join over join\\n $ \\\" share ] is \\\"\\n join swap join\\n $ \\\"-> \\\" join\\n swap join ] builds var ( [ $ --> [ $ )\\n\\n 10000 eratosthenes\\n\\n [ 1 & not ] is even ( n --> b )\\n\\n var n var d var s var a\\n var t var x var y var c\\n\\n [ dup 10000 < iff isprime done\\n dup even iff\\n [ drop false ] done\\n dup ->n\\n [ 1 - 0 swap\\n [ dup even while\\n 1 >> dip 1+ again ] ]\\n ->d ->s\\n false ->c\\n 20 times\\n [ n-> 2 - random 2 + ->a\\n s-> ->t\\n a-> d-> n-> **mod ->x\\n s-> times\\n [ x-> 2 n-> **mod ->y\\n y-> 1 =\\n x-> 1 !=\\n x-> n-> 1 - !=\\n and and iff\\n [ true ->c conclude ]\\n done\\n y-> ->x ]\\n c-> iff conclude done\\n y-> 1 != if\\n [ true ->c conclude ] ]\\n c-> not ] is prime ( n --> b )\\n\\n say \\\"Primes < 100:\\\" cr\\n 100 times [ i^ prime if [ i^ echo sp ] ]\\n cr cr\\n [] 1000 times\\n [ i^ 9223372036854774808 + dup\\n prime iff join else drop ]\\n say \\\"There are \\\"\\n dup size echo\\n say \\\" primes between 9223372036854774808 and 9223372036854775808:\\\"\\n cr cr\\n witheach [ echo i^ 1+ 4 mod iff sp else cr ]\\n cr cr\\n 4547337172376300111955330758342147474062293202868155909489 dup echo\\n prime iff\\n [ say \\\" is prime.\\\" ]\\n else\\n [ say \\\" is not prime.\\\" ]\\n cr cr\\n 4547337172376300111955330758342147474062293202868155909393 dup echo\\n prime iff\\n [ say \\\"is prime.\\\" ]\\n else\\n [ say \\\" is not prime.\\\" ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"#lang racket\\n(define (miller-rabin-expmod base exp m)\\n (define (squaremod-with-check x)\\n (define (check-nontrivial-sqrt1 x square)\\n (if (and (= square 1)\\n (not (= x 1))\\n (not (= x (- m 1))))\\n 0\\n square))\\n (check-nontrivial-sqrt1 x (remainder (expt x 2) m)))\\n (cond ((= exp 0) 1)\\n ((even? exp) (squaremod-with-check\\n (miller-rabin-expmod base (/ exp 2) m)))\\n (else\\n (remainder (* base (miller-rabin-expmod base (- exp 1) m))\\n m))))\\n\\n(define (miller-rabin-test n)\\n (define (try-it a)\\n (define (check-it x)\\n (and (not (= x 0)) (= x 1)))\\n (check-it (miller-rabin-expmod a (- n 1) n)))\\n (try-it (+ 1 (random (remainder (- n 1) 4294967087)))))\\n\\n(define (fast-prime? n times)\\n (for/and ((i (in-range times)))\\n (miller-rabin-test n)))\\n\\n(define (prime? n(times 100))\\n (fast-prime? n times))\\n\\n(prime? 4547337172376300111955330758342147474062293202868155909489) ;-> outputs true\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"# the expmod-function from: http://rosettacode.org/wiki/Modular_exponentiation\\nsub expmod(Int $a is copy, Int $b is copy, $n) {\\n\\tmy $c = 1;\\n\\trepeat while $b div= 2 {\\n\\t\\t($c *= $a) %= $n if $b % 2;\\n\\t\\t($a *= $a) %= $n;\\n\\t}\\n\\t$c;\\n}\\n\\nsubset PrimeCandidate of Int where { $_ > 2 and $_ % 2 };\\n\\nmy Bool multi sub is_prime(Int $n, Int $k) { return False; }\\nmy Bool multi sub is_prime(2, Int $k) { return True; }\\nmy Bool multi sub is_prime(PrimeCandidate $n, Int $k) {\\n\\tmy Int $d = $n - 1;\\n\\tmy Int $s = 0;\\n\\n\\twhile $d %% 2 {\\n\\t\\t$d div= 2;\\n\\t\\t$s++;\\n\\t}\\n\\n\\tfor (2 ..^ $n).pick($k) -> $a {\\n\\t\\tmy $x = expmod($a, $d, $n);\\n\\n\\t\\t# one could just write \\\"next if $x == 1 | $n - 1\\\"\\n\\t\\t# but this takes much more time in current rakudo/nom\\n\\t\\tnext if $x == 1 or $x == $n - 1;\\n\\n\\t\\tfor 1 ..^ $s {\\n\\t\\t\\t$x = $x ** 2 mod $n;\\n\\t\\t\\treturn False if $x == 1;\\n\\t\\t\\tlast if $x == $n - 1;\\n\\t\\t}\\n\\t\\treturn False if $x !== $n - 1;\\n\\t}\\n\\n\\treturn True;\\n}\\n\\nsay (1..1000).grep({ is_prime($_, 10) }).join(\\\", \\\");\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program puts the Miller─Rabin primality test through its paces. */\\nparse arg limit times seed . /*obtain optional arguments from the CL*/\\nif limit=='' | limit==\\\",\\\" then limit= 1000 /*Not specified? Then use the default.*/\\nif times=='' | times==\\\",\\\" then times= 10 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif datatype(seed, 'W') then call random ,,seed /*If seed specified, use it for RANDOM.*/\\nnumeric digits max(200, 2*limit) /*we're dealing with some ginormous #s.*/\\ntell= times<0 /*display primes only if times is neg.*/\\ntimes= abs(times); w= length(times) /*use absolute value of TIMES; get len.*/\\ncall genP limit /*suspenders now, use a belt later ··· */\\n@MR= 'Miller─Rabin primality test' /*define a character literal for SAY. */\\nsay \\\"There are\\\" # 'primes ≤' limit /*might as well display some stuff. */\\nsay /* [↓] (skipping unity); show sep line*/\\n do a=2 to times; say copies('─', 89) /*(skipping unity) do range of TIMEs.*/\\n p= 0 /*the counter of primes for this pass. */\\n do z=1 for limit /*now, let's get busy and crank primes.*/\\n if \\\\M_Rt(z, a) then iterate /*Not prime? Then try another number.*/\\n p= p + 1 /*well, we found another one, by gum! */\\n if tell then say z 'is prime according to' @MR \\\"with K=\\\"a\\n if !.z then iterate\\n say '[K='a\\\"] \\\" z \\\"isn't prime !\\\" /*oopsy─doopsy and/or whoopsy─daisy !*/\\n end /*z*/\\n say ' for 1──►'limit\\\", K=\\\"right(a,w)',' @MR \\\"found\\\" p 'primes {out of' #\\\"}.\\\"\\n end /*a*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngenP: parse arg high; @.=0; @.1=2; @.2=3; !.=@.; !.2=1; !.3=1; #=2\\n do j=@.#+2 by 2 to high /*just examine odd integers from here. */\\n do k=2 while k*k<=j; if j//@.k==0 then iterate j; end /*k*/\\n #= # + 1; @.#= j; !.j= 1 /*bump prime counter; add prime to the */\\n end /*j*/; return /*@. array; define a prime in !. array.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nM_Rt: procedure; parse arg n,k; d= n-1; nL=d /*Miller─Rabin: A.K.A. Rabin─Miller.*/\\n if n==2 then return 1 /*special case of (the) even prime. */\\n if n<2 | n//2==0 then return 0 /*check for too low, or an even number.*/\\n\\n do s=-1 while d//2==0; d= d % 2 /*keep halving until a zero remainder.*/\\n end /*while*/\\n\\n do k; ?= random(2, nL) /* [↓] perform the DO loop K times.*/\\n x= ?**d // n /*X can get real gihugeic really fast.*/\\n if x==1 | x==nL then iterate /*First or penultimate? Try another pow*/\\n do s; x= x**2 // n /*compute new X ≡ X² modulus N. */\\n if x==1 then return 0 /*if unity, it's definitely not prime.*/\\n if x==nL then leave /*if N-1, then it could be prime. */\\n end /*r*/ /* [↑] // is REXX's division remainder*/\\n if x\\\\==nL then return 0 /*nope, it ain't prime nohows, noway. */\\n end /*k*/ /*maybe it's prime, maybe it ain't ··· */\\n return 1 /*coulda/woulda/shoulda be prime; yup.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Miller–Rabin primality test\\n\\nsee \\\"Input a number: \\\" give n\\nsee \\\"Input test: \\\" give k\\n\\ntest = millerrabin(n,k)\\nif test = 0\\n see \\\"Probably Prime\\\" + nl\\nelse\\n see \\\"Composite\\\" + nl\\nok\\n\\nfunc millerrabin(n, k)\\n if n = 2\\n millerRabin = 0\\n return millerRabin\\n ok\\n if n % 2 = 0 or n < 2\\n millerRabin = 1\\n return millerRabin\\n ok\\n d = n - 1\\n s = 0\\n while d % 2 = 0\\n d = d / 2\\n s = s + 1\\n end\\n while k > 0\\n k = k - 1\\n base = 2 + floor((random(10)/10)*(n-3))\\n x = pow(base, d) % n\\n if x != 1 and x != n-1\\n for r=1 to s-1\\n x = (x * x) % n\\n if x = 1\\n millerRabin = 1\\n return millerRabin\\n ok\\n if x = n-1\\n exit\\n ok\\n next\\n if x != n-1\\n millerRabin = 1\\n return millerRabin\\n ok\\n ok\\n end\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def miller_rabin_prime?(n, g)\\n d = n - 1\\n s = 0\\n while d % 2 == 0\\n d /= 2\\n s += 1\\n end\\n g.times do\\n a = 2 + rand(n - 4)\\n x = a.pow(d, n) # x = (a**d) % n\\n next if x == 1 || x == n - 1\\n for r in (1..s - 1)\\n x = x.pow(2, n) # x = (x**2) % n\\n return false if x == 1\\n break if x == n - 1\\n end\\n return false if x != n - 1\\n end\\n true # probably\\nend\\n\\np primes = (3..1000).step(2).find_all {|i| miller_rabin_prime?(i,10)}\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"puts miller_rabin_prime?(94366396730334173383107353049414959521528815310548187030165936229578960209523421808912459795329035203510284576187160076386643700441216547732914250578934261891510827140267043592007225160798348913639472564715055445201512461359359488795427875530231001298552452230535485049737222714000227878890892901228389026881,1000)\\nputs miller_rabin_prime?(138028649176899647846076023812164793645371887571371559091892986639999096471811910222267538577825033963552683101137782650479906670021895135954212738694784814783986671046107023185842481502719762055887490765764329237651328922972514308635045190654896041748716218441926626988737664133219271115413563418353821396401,1000)\\nputs miller_rabin_prime?(123301261697053560451930527879636974557474268923771832437126939266601921428796348203611050423256894847735769138870460373141723679005090549101566289920247264982095246187318303659027201708559916949810035265951104246512008259674244307851578647894027803356820480862664695522389066327012330793517771435385653616841,1000)\\nputs miller_rabin_prime?(119432521682023078841121052226157857003721669633106050345198988740042219728400958282159638484144822421840470442893056822510584029066504295892189315912923804894933736660559950053226576719285711831138657839435060908151231090715952576998400120335346005544083959311246562842277496260598128781581003807229557518839,1000)\\nputs miller_rabin_prime?(132082885240291678440073580124226578272473600569147812319294626601995619845059779715619475871419551319029519794232989255381829366374647864619189704922722431776563860747714706040922215308646535910589305924065089149684429555813953571007126408164577035854428632242206880193165045777949624510896312005014225526731,1000)\\nputs miller_rabin_prime?(153410708946188157980279532372610756837706984448408515364579602515073276538040155990230789600191915021209039203172105094957316552912585741177975853552299222501069267567888742458519569317286299134843250075228359900070009684517875782331709619287588451883575354340318132216817231993558066067063143257425853927599,1000)\\nputs miller_rabin_prime?(103130593592068072608023213244858971741946977638988649427937324034014356815504971087381663169829571046157738503075005527471064224791270584831779395959349442093395294980019731027051356344056416276026592333932610954020105156667883269888206386119513058400355612571198438511950152690467372712488391425876725831041,1000)\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"class Integer\\n # Returns true if +self+ is a prime number, else returns false.\\n def primemr?(k = 10)\\n primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\\n return primes.include? self if self <= primes.last\\n modp47 = 614_889_782_588_491_410 # => primes.reduce(:*), largest < 2^64\\n return false if self.gcd(modp47) != 1 # eliminates 86.2% of all integers\\n # Choose input witness bases: wits = [range, [wit_bases]] or nil\\n wits = WITNESS_RANGES.find { |range, wits| range > self }\\n witnesses = wits && wits[1] || k.times.map{ 2 + rand(self - 4) }\\n miller_rabin_test(witnesses)\\n end\\n\\n private\\n # Returns true if +self+ passes Miller-Rabin Test with witness bases +b+\\n def miller_rabin_test(witnesses) # use witness list to test with\\n neg_one_mod = n = d = self - 1 # these are even as 'self' always odd\\n d >>= 4 while (d & 0xf) == 0 # suck out factors of 2\\n (d >>= (d & 3)^2; d >>= (d & 1)^1) if d.even? # 4 bits at a time\\n witnesses.each do |b| # do M-R test with each witness base\\n next if (b % self) == 0 # **skip base if a multiple of input**\\n s = d\\n y = b.pow(d, self) # y = (b**d) mod self\\n until y == 1 || y == neg_one_mod || s == n\\n y = y.pow(2, self) # y = (y**2) mod self\\n s <<= 1\\n end\\n return false unless y == neg_one_mod || s.odd?\\n end\\n true\\n end\\n\\n # Best known deterministic witnesses for given range and set of bases\\n # https://miller-rabin.appspot.com/\\n # https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test\\n WITNESS_RANGES = {\\n 341_531 => [9345883071009581737],\\n 1_050_535_501 => [336781006125, 9639812373923155],\\n 350_269_456_337 => [4230279247111683200, 14694767155120705706, 16641139526367750375],\\n 55_245_642_489_451 => [2, 141889084524735, 1199124725622454117, 11096072698276303650],\\n 7_999_252_175_582_851 => [2, 4130806001517, 149795463772692060, 186635894390467037,\\n 3967304179347715805],\\n 585_226_005_592_931_977 => [2, 123635709730000, 9233062284813009, 43835965440333360,\\n 761179012939631437, 1263739024124850375],\\n 18_446_744_073_709_551_615 => [2, 325, 9375, 28178, 450775, 9780504, 1795265022],\\n 318_665_857_834_031_151_167_461 => [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37],\\n 3_317_044_064_679_887_385_961_981 => [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41]\\n }\\nend\\n\\ndef tm; t = Time.now; yield; Time.now - t end\\n\\n# 10 digit primes\\nn = 2147483647\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 18 digit non-prime\\nn = 844674407370955389\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 19 digit primes\\nn = 9241386435364257883\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 20 digit primes; largest < 2^64\\nn = 18446744073709551533\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 58 digit prime\\nn = 4547337172376300111955330758342147474062293202868155909489\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 58 digit non-prime\\nn = 4547337172376300111955330758342147474062293202868155909393\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 81 digit prime\\nn = 100000000000000000000000000000000000000000000000000000000000000000000000001309503\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 81 digit non-prime\\nn = 100000000000000000000000000000000000000000000000000000000000000000000000001309509\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\n# 308 digit prime\\nn = 94366396730334173383107353049414959521528815310548187030165936229578960209523421808912459795329035203510284576187160076386643700441216547732914250578934261891510827140267043592007225160798348913639472564715055445201512461359359488795427875530231001298552452230535485049737222714000227878890892901228389026881\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\nn = 138028649176899647846076023812164793645371887571371559091892986639999096471811910222267538577825033963552683101137782650479906670021895135954212738694784814783986671046107023185842481502719762055887490765764329237651328922972514308635045190654896041748716218441926626988737664133219271115413563418353821396401\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\nn = 123301261697053560451930527879636974557474268923771832437126939266601921428796348203611050423256894847735769138870460373141723679005090549101566289920247264982095246187318303659027201708559916949810035265951104246512008259674244307851578647894027803356820480862664695522389066327012330793517771435385653616841\\nprint \\\"\\\\n number = #{n} is prime \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\nn = 119432521682023078841121052226157857003721669633106050345198988740042219728400958282159638484144822421840470442893056822510584029066504295892189315912923804894933736660559950053226576719285711831138657839435060908151231090715952576998400120335346005544083959311246562842277496260598128781581003807229557518839\\nprint \\\"\\\\n number = #{n} is prime \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\nn = 132082885240291678440073580124226578272473600569147812319294626601995619845059779715619475871419551319029519794232989255381829366374647864619189704922722431776563860747714706040922215308646535910589305924065089149684429555813953571007126408164577035854428632242206880193165045777949624510896312005014225526731\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\nn = 153410708946188157980279532372610756837706984448408515364579602515073276538040155990230789600191915021209039203172105094957316552912585741177975853552299222501069267567888742458519569317286299134843250075228359900070009684517875782331709619287588451883575354340318132216817231993558066067063143257425853927599\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\nn = 103130593592068072608023213244858971741946977638988649427937324034014356815504971087381663169829571046157738503075005527471064224791270584831779395959349442093395294980019731027051356344056416276026592333932610954020105156667883269888206386119513058400355612571198438511950152690467372712488391425876725831041\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\\nn = 94366396730334173383107353049414959521528815310548187030165936229578960209523421808912459795329035203510284576187160076386643700441216547732914250578934261891510827140267043592007225160798348913639472564715055445201512461359359488795427875530231001298552452230535485049737222714000227878890892901228389026881\\nprint \\\"\\\\n number = #{n} is prime? \\\"; print \\\" in \\\", tm{ print n.primemr? }, \\\" secs\\\"\\nputs\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"input \\\"Input a number:\\\";n\\ninput \\\"Input test:\\\";k\\n\\ntest = millerRabin(n,k)\\nif test = 0 then\\n print \\\"Probably Prime\\\"\\n else\\n print \\\"Composite\\\"\\nend if\\nwait\\n\\n' ----------------------------------------\\n' Returns\\n' Composite = 1\\n' Probably Prime = 0\\n' ----------------------------------------\\n FUNCTION millerRabin(n, k)\\n if n = 2 then\\n millerRabin = 0 'probablyPrime\\n goto [funEnd]\\n end if\\n\\n if n mod 2 = 0 or n < 2 then\\n millerRabin = 1 'composite\\n goto [funEnd]\\n end if\\n\\nd = n - 1\\nwhile d mod 2 = 0\\n d = d / 2\\n s = s + 1\\nwend\\n\\nwhile k > 0\\n k = k - 1\\n base = 2 + int(rnd(1)*(n-3))\\n x = (base^d) mod n\\n if x <> 1 and x <> n-1 then\\n for r=1 To s-1\\n x =(x * x) mod n\\n if x=1 then\\n millerRabin = 1 ' composite\\n goto [funEnd]\\n end if\\n if x = n-1 then exit for\\n next r\\n\\n if x<>n-1 then\\n millerRabin = 1 ' composite\\n goto [funEnd]\\n end if\\n end if\\nwend\\n[funEnd]\\nEND FUNCTION\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"/* Add these lines to the [dependencies] section of your Cargo.toml file:\\nnum = \\\"0.2.0\\\"\\nrand = \\\"0.6.5\\\"\\n*/\\n\\nuse num::bigint::BigInt;\\nuse num::bigint::ToBigInt;\\n\\n\\n// The modular_exponentiation() function takes three identical types\\n// (which get cast to BigInt), and returns a BigInt:\\nfn modular_exponentiation<T: ToBigInt>(n: &T, e: &T, m: &T) -> BigInt {\\n // Convert n, e, and m to BigInt:\\n let n = n.to_bigint().unwrap();\\n let e = e.to_bigint().unwrap();\\n let m = m.to_bigint().unwrap();\\n\\n // Sanity check: Verify that the exponent is not negative:\\n assert!(e >= Zero::zero());\\n\\n use num::traits::{Zero, One};\\n\\n // As most modular exponentiations do, return 1 if the exponent is 0:\\n if e == Zero::zero() {\\n return One::one()\\n }\\n\\n // Now do the modular exponentiation algorithm:\\n let mut result: BigInt = One::one();\\n let mut base = n % &m;\\n let mut exp = e;\\n\\n loop { // Loop until we can return our result.\\n if &exp % 2 == One::one() {\\n result *= &base;\\n result %= &m;\\n }\\n\\n if exp == One::one() {\\n return result\\n }\\n\\n exp /= 2;\\n base *= base.clone();\\n base %= &m;\\n }\\n}\\n\\n\\n// is_prime() checks the passed-in number against many known small primes.\\n// If that doesn't determine if the number is prime or not, then the number\\n// will be passed to the is_rabin_miller_prime() function:\\nfn is_prime<T: ToBigInt>(n: &T) -> bool {\\n let n = n.to_bigint().unwrap();\\n if n.clone() < 2.to_bigint().unwrap() {\\n return false\\n }\\n\\n let small_primes = vec![2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43,\\n 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101,\\n 103, 107, 109, 113, 127, 131, 137, 139, 149, 151,\\n 157, 163, 167, 173, 179, 181, 191, 193, 197, 199,\\n 211, 223, 227, 229, 233, 239, 241, 251, 257, 263,\\n 269, 271, 277, 281, 283, 293, 307, 311, 313, 317,\\n 331, 337, 347, 349, 353, 359, 367, 373, 379, 383,\\n 389, 397, 401, 409, 419, 421, 431, 433, 439, 443,\\n 449, 457, 461, 463, 467, 479, 487, 491, 499, 503,\\n 509, 521, 523, 541, 547, 557, 563, 569, 571, 577,\\n 587, 593, 599, 601, 607, 613, 617, 619, 631, 641,\\n 643, 647, 653, 659, 661, 673, 677, 683, 691, 701,\\n 709, 719, 727, 733, 739, 743, 751, 757, 761, 769,\\n 773, 787, 797, 809, 811, 821, 823, 827, 829, 839,\\n 853, 857, 859, 863, 877, 881, 883, 887, 907, 911,\\n 919, 929, 937, 941, 947, 953, 967, 971, 977, 983,\\n 991, 997, 1009, 1013];\\n\\n use num::traits::Zero; // for Zero::zero()\\n\\n // Check to see if our number is a small prime (which means it's prime),\\n // or a multiple of a small prime (which means it's not prime):\\n for sp in small_primes {\\n let sp = sp.to_bigint().unwrap();\\n\\n if n.clone() == sp {\\n return true\\n } else if n.clone() % sp == Zero::zero() {\\n return false\\n }\\n }\\n\\n is_rabin_miller_prime(&n, None)\\n}\\n\\n\\n// Note: \\\"use bigint::RandBigInt;\\\" (which is needed for gen_bigint_range())\\n// fails to work in the Rust playground ( https://play.rust-lang.org ).\\n// Therefore, I'll create my own here:\\nfn get_random_bigint(low: &BigInt, high: &BigInt) -> BigInt {\\n if low == high { // base case\\n return low.clone()\\n }\\n\\n let middle = (low.clone() + high) / 2.to_bigint().unwrap();\\n\\n let go_low: bool = rand::random();\\n\\n if go_low {\\n return get_random_bigint(low, &middle)\\n } else {\\n return get_random_bigint(&middle, high)\\n }\\n}\\n\\n\\n// k is the number of times for testing (pass in None to use 5 (the default)).\\nfn is_rabin_miller_prime<T: ToBigInt>(n: &T, k: Option<usize>) -> bool {\\n let n = n.to_bigint().unwrap();\\n let k = k.unwrap_or(10); // number of times for testing (defaults to 10)\\n\\n use num::traits::{Zero, One}; // for Zero::zero() and One::one()\\n let zero: BigInt = Zero::zero();\\n let one: BigInt = One::one();\\n let two: BigInt = 2.to_bigint().unwrap();\\n\\n // The call to is_prime() should have already checked this,\\n // but check for two, less than two, and multiples of two:\\n if n <= one {\\n return false\\n } else if n == two {\\n return true // 2 is prime\\n } else if n.clone() % &two == Zero::zero() {\\n return false // even number (that's not 2) is not prime\\n }\\n\\n let mut t: BigInt = zero.clone();\\n let n_minus_one: BigInt = n.clone() - &one;\\n let mut s = n_minus_one.clone();\\n while &s % &two == one {\\n s /= &two;\\n t += &one;\\n }\\n\\n // Try k times to test if our number is non-prime:\\n 'outer: for _ in 0..k {\\n let a = get_random_bigint(&two, &n_minus_one);\\n let mut v = modular_exponentiation(&a, &s, &n);\\n if v == one {\\n continue 'outer;\\n }\\n let mut i: BigInt = zero.clone();\\n 'inner: while &i < &t {\\n v = (v.clone() * &v) % &n;\\n if &v == &n_minus_one {\\n continue 'outer;\\n }\\n i += &one;\\n }\\n return false;\\n }\\n // If we get here, then we have a degree of certainty\\n // that n really is a prime number, so return true:\\n true\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"fn main() {\\n let n = 1234687;\\n let result = is_prime(&n);\\n println!(\\\"Q: Is {} prime? A: {}\\\", n, result);\\n\\n let n = 1234689;\\n let result = is_prime(&n);\\n println!(\\\"Q: Is {} prime? A: {}\\\", n, result);\\n\\n let n = BigInt::parse_bytes(\\\"123123423463\\\".as_bytes(), 10).unwrap();\\n let result = is_prime(&n);\\n println!(\\\"Q: Is {} prime? A: {}\\\", n, result);\\n\\n let n = BigInt::parse_bytes(\\\"123123423465\\\".as_bytes(), 10).unwrap();\\n let result = is_prime(&n);\\n println!(\\\"Q: Is {} prime? A: {}\\\", n, result);\\n\\n let n = BigInt::parse_bytes(\\\"123123423467\\\".as_bytes(), 10).unwrap();\\n let result = is_prime(&n);\\n println!(\\\"Q: Is {} prime? A: {}\\\", n, result);\\n\\n let n = BigInt::parse_bytes(\\\"123123423469\\\".as_bytes(), 10).unwrap();\\n let result = is_prime(&n);\\n println!(\\\"Q: Is {} prime? A: {}\\\", n, result);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import scala.math.BigInt\\n\\nobject MillerRabinPrimalityTest extends App {\\n val (n, certainty )= (BigInt(args(0)), args(1).toInt)\\n println(s\\\"$n is ${if (n.isProbablePrime(certainty)) \\\"probably prime\\\" else \\\"composite\\\"}\\\")\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"import scala.annotation.tailrec\\nimport scala.language.{implicitConversions, postfixOps}\\nimport scala.util.Random\\n\\nobject MillerRabin {\\n\\n implicit def int2Bools(b: Int): Seq[Boolean] = 31 to 0 by -1 map isBitSet(b)\\n\\n def isBitSet(byte: Int)(bit: Int): Boolean = ((byte >> bit) & 1) == 1\\n\\n def mod(num: Int, denom: Int) = if (num % denom >= 0) num % denom else (num % denom) + denom\\n\\n @tailrec\\n def isSimple(p: Int, s: Int): Boolean = {\\n if (s == 0) {\\n true\\n }\\n else if (witness(Random.nextInt(p - 1), p)) {\\n false\\n }\\n else {\\n isSimple(p, s - 1)\\n }\\n }\\n\\n def witness(a: Int, p: Int): Boolean = {\\n val b: Seq[Boolean] = p - 1\\n\\n b.foldLeft(1)((d, b) => if (mod(d * d, p) == 1 && d != 1 && d != p - 1) {\\n return true\\n } else {\\n b match {\\n case true => mod(mod(d*d, p)*a,p)\\n case false => mod(d*d, p)\\n }\\n }) != 1\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"#!r6rs\\n(import (rnrs base (6))\\n (srfi :27 random-bits))\\n\\n;; Fast modular exponentiation.\\n(define (modexpt b e M)\\n (cond\\n ((zero? e) 1)\\n ((even? e) (modexpt (mod (* b b) M) (div e 2) M))\\n ((odd? e) (mod (* b (modexpt b (- e 1) M)) M))))\\n\\n;; Return s, d such that d is odd and 2^s * d = n.\\n(define (split n)\\n (let recur ((s 0) (d n))\\n (if (odd? d)\\n (values s d)\\n (recur (+ s 1) (div d 2)))))\\n\\n;; Test whether the number a proves that n is composite.\\n(define (composite-witness? n a)\\n (let*-values (((s d) (split (- n 1)))\\n ((x) (modexpt a d n)))\\n (and (not (= x 1))\\n (not (= x (- n 1)))\\n (let try ((r (- s 1)))\\n (set! x (modexpt x 2 n))\\n (or (zero? r)\\n (= x 1)\\n (and (not (= x (- n 1)))\\n (try (- r 1))))))))\\n\\n;; Test whether n > 2 is a Miller-Rabin pseudoprime, k trials.\\n(define (pseudoprime? n k)\\n (or (zero? k)\\n (let ((a (+ 2 (random-integer (- n 2)))))\\n (and (not (composite-witness? n a))\\n (pseudoprime? n (- k 1))))))\\n\\n;; Test whether any integer is prime.\\n(define (prime? n)\\n (and (> n 1)\\n (or (= n 2)\\n (pseudoprime? n 50))))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"bigint.s7i\\\";\\n\\nconst func boolean: millerRabin (in bigInteger: n, in integer: k) is func\\n result\\n var boolean: probablyPrime is TRUE;\\n local\\n var bigInteger: d is 0_;\\n var integer: r is 0;\\n var integer: s is 0;\\n var bigInteger: a is 0_;\\n var bigInteger: x is 0_;\\n var integer: tests is 0;\\n begin\\n if n < 2_ or (n > 2_ and not odd(n)) then\\n probablyPrime := FALSE;\\n elsif n > 3_ then\\n d := pred(n);\\n s := lowestSetBit(d);\\n d >>:= s;\\n while tests < k and probablyPrime do\\n a := rand(2_, pred(n));\\n x := modPow(a, d, n);\\n if x <> 1_ and x <> pred(n) then\\n r := 1;\\n while r < s and x <> 1_ and x <> pred(n) do\\n x := modPow(x, 2_, n);\\n incr(r);\\n end while;\\n probablyPrime := x = pred(n);\\n end if;\\n incr(tests);\\n end while;\\n end if;\\n end func;\\n\\nconst proc: main is func\\n local\\n var bigInteger: number is 0_;\\n begin\\n for number range 2_ to 1000_ do\\n if millerRabin(number, 10) then\\n writeln(number);\\n end if;\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"func miller_rabin(n, k=10) {\\n\\n return false if (n <= 1)\\n return true if (n == 2)\\n return false if (n.is_even)\\n\\n var t = n-1\\n var s = t.valuation(2)\\n var d = t>>s\\n\\n k.times {\\n var a = irand(2, t)\\n var x = powmod(a, d, n)\\n next if (x ~~ [1, t])\\n\\n (s-1).times {\\n x.powmod!(2, n)\\n return false if (x == 1)\\n break if (x == t)\\n }\\n\\n return false if (x != t)\\n }\\n\\n return true\\n}\\n\\nsay miller_rabin.grep(^1000).join(', ')\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"Integer extend [\\n millerRabinTest: kl [ |k| k := kl.\\n self <= 3\\n ifTrue: [ ^true ]\\n ifFalse: [\\n (self even)\\n ifTrue: [ ^false ]\\n ifFalse: [ |d s|\\n d := self - 1.\\n s := 0.\\n [ (d rem: 2) == 0 ]\\n whileTrue: [\\n d := d / 2.\\n s := s + 1.\\n ].\\n [ k:=k-1. k >= 0 ]\\n whileTrue: [ |a x r|\\n a := Random between: 2 and: (self - 2).\\n x := (a raisedTo: d) rem: self.\\n ( x = 1 )\\n ifFalse: [ |r|\\n\\t\\t r := -1.\\n [ r := r + 1. (r < s) & (x ~= (self - 1)) ]\\n whileTrue: [\\n \\t x := (x raisedTo: 2) rem: self\\n ].\\n ( x ~= (self - 1) ) ifTrue: [ ^false ]\\n ]\\n ].\\n ^true\\n ]\\n ]\\n ]\\n].\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"1 to: 1000 do: [ :n |\\n (n millerRabinTest: 10) ifTrue: [ n printNl ]\\n].\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"open LargeInt;\\n\\nval mr_iterations = Int.toLarge 20;\\nval rng = Random.rand (557216670, 13504100); (* arbitrary pair to seed RNG *)\\n\\nfun expmod base 0 m = 1\\n | expmod base exp m =\\n if exp mod 2 = 0\\n then let val rt = expmod base (exp div 2) m;\\n val sq = (rt*rt) mod m\\n in if sq = 1\\n andalso rt <> 1 (* ignore the two *)\\n andalso rt <> (m-1) (* 'trivial' roots *)\\n then 0\\n else sq\\n end\\n else (base*(expmod base (exp-1) m)) mod m;\\n\\n(* arbitrary precision random number [0,n) *)\\nfun rand n =\\n let val base = Int.toLarge(valOf Int.maxInt)+1;\\n fun step r lim =\\n if lim < n then step (Int.toLarge(Random.randNat rng) + r*base) (lim*base)\\n else r mod n\\n in step 0 1 end;\\n\\nfun miller_rabin n =\\n let fun trial n 0 = true\\n | trial n t = let val a = 1+rand(n-1)\\n in (expmod a (n-1) n) = 1\\n andalso trial n (t-1)\\n end\\n in trial n mr_iterations end;\\n\\nfun trylist label lst = (label, ListPair.zip (lst, map miller_rabin lst));\\n\\ntrylist \\\"test the first six Carmichael numbers\\\"\\n [561, 1105, 1729, 2465, 2821, 6601];\\n\\ntrylist \\\"test some known primes\\\"\\n [7369, 7393, 7411, 27367, 27397, 27407];\\n\\n(* find ten random 30 digit primes (according to Miller-Rabin) *)\\nlet fun findPrime trials = let val t = trials+1;\\n val n = 2*rand(500000000000000000000000000000)+1\\n in if miller_rabin n\\n then (n,t)\\n else findPrime t end\\nin List.tabulate (10, fn e => findPrime 0) end;\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"import BigInt\\n\\nprivate let numTrails = 5\\n\\nfunc isPrime(_ n: BigInt) -> Bool {\\n guard n >= 2 else { fatalError() }\\n guard n != 2 else { return true }\\n guard n % 2 != 0 else { return false }\\n\\n var s = 0\\n var d = n - 1\\n\\n while true {\\n let (quo, rem) = (d / 2, d % 2)\\n\\n guard rem != 1 else { break }\\n\\n s += 1\\n d = quo\\n }\\n\\n func tryComposite(_ a: BigInt) -> Bool {\\n guard a.power(d, modulus: n) != 1 else { return false }\\n\\n for i in 0..<s where a.power((2 as BigInt).power(i) * d, modulus: n) == n - 1 {\\n return false\\n }\\n\\n return true\\n }\\n\\n for _ in 0..<numTrails where tryComposite(BigInt(BigUInt.randomInteger(lessThan: BigUInt(n)))) {\\n return false\\n }\\n\\n return true\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"package require Tcl 8.5\\n\\nproc miller_rabin {n k} {\\n if {$n <= 3} {return true}\\n if {$n % 2 == 0} {return false}\\n\\n # write n - 1 as 2^s·d with d odd by factoring powers of 2 from n − 1\\n set d [expr {$n - 1}]\\n set s 0\\n while {$d % 2 == 0} {\\n set d [expr {$d / 2}]\\n incr s\\n }\\n\\n while {$k > 0} {\\n incr k -1\\n set a [expr {2 + int(rand()*($n - 4))}]\\n set x [expr {($a ** $d) % $n}]\\n if {$x == 1 || $x == $n - 1} continue\\n for {set r 1} {$r < $s} {incr r} {\\n set x [expr {($x ** 2) % $n}]\\n if {$x == 1} {return false}\\n if {$x == $n - 1} break\\n }\\n\\tif {$x != $n-1} {return false}\\n }\\n return true\\n}\\n\\nfor {set i 1} {$i < 1000} {incr i} {\\n if {[miller_rabin $i 10]} {\\n puts $i\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"./big\\\" for BigInt\\n\\nvar iters = 10\\n// find all primes < 100\\nSystem.print(\\\"The following numbers less than 100 are prime:\\\")\\nSystem.write(\\\"2 \\\")\\nfor (i in 3..99) {\\n if (BigInt.new(i).isProbablePrime(iters)) System.write(\\\"%(i) \\\")\\n}\\nSystem.print(\\\"\\\\n\\\")\\nvar bia = [\\n BigInt.new(\\\"4547337172376300111955330758342147474062293202868155909489\\\"),\\n BigInt.new(\\\"4547337172376300111955330758342147474062293202868155909393\\\")\\n]\\nfor (bi in bia) {\\n System.print(\\\"%(bi) is %(bi.isProbablePrime(iters) ? \\\"probably prime\\\" : \\\"composite\\\")\\\")\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"zkl: var BN=Import(\\\"zklBigNum\\\");\\nzkl: BN(\\\"4547337172376300111955330758342147474062293202868155909489\\\").probablyPrime()\\nTrue\\nzkl: BN(\\\"4547337172376300111955330758342147474062293202868155909393\\\").probablyPrime()\\nFalse\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Miller-Rabin-primality-test"}}},{"rowIdx":490,"cells":{"solutions":{"kind":"list like","value":[{"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 semblance of order from chaos.\n\nThe task is to simulate the trick in a way that mimics the steps shown in the video.\n\n; 1. Cards.\n# Create a common deck of cards of 52 cards (which are half red, half black).\n# Give the pack a good shuffle.\n; 2. Deal from the shuffled deck, you'll be creating three piles.\n# Assemble the cards face down.\n## Turn up the ''top card'' and hold it in your hand. \n### if the card is black, then add the ''next'' card (unseen) to the \"black\" pile. \n### If the card is red, then add the ''next'' card (unseen) to the \"red\" pile.\n## Add the ''top card'' that you're holding to the '''discard''' pile. (You might optionally show these discarded cards to get an idea of the randomness).\n# Repeat the above for the rest of the shuffled deck.\n; 3. Choose a random number (call it '''X''') that will be used to swap cards from the \"red\" and \"black\" piles.\n# Randomly choose '''X''' cards from the \"red\" pile (unseen), let's call this the \"red\" bunch. \n# Randomly choose '''X''' cards from the \"black\" pile (unseen), let's call this the \"black\" bunch.\n# Put the \"red\" bunch into the \"black\" pile.\n# Put the \"black\" bunch into the \"red\" pile.\n# (The above two steps complete the swap of '''X''' cards of the \"red\" and \"black\" piles. <br> (Without knowing what those cards are --- they could be red or black, nobody knows).\n; 4. Order from randomness?\n# Verify (or not) the mathematician's assertion that: \n <big> '''The number of black cards in the \"black\" pile equals the number of red cards in the \"red\" pile.''' </big>\n\n\n(Optionally, run this simulation a number of times, gathering more evidence of the truthfulness of the assertion.)\n\nShow output on this page.\n<br><br>\n\n","language":"00-TASK"},{"code":"//import random\nV n = 52\nV Black = ‘Black’\nV Red = ‘Red’\nV blacks = [Black] * (n I/ 2)\nV reds = [Red] * (n I/ 2)\nV pack = blacks [+] reds\nrandom:shuffle(&pack)\n\n[String] black_stack, red_stack, discard\nL !pack.empty\n V top = pack.pop()\n I top == Black\n black_stack.append(pack.pop())\n E\n red_stack.append(pack.pop())\n discard.append(top)\nprint(‘(Discards: ’(discard.map(d -> d[0]).join(‘ ’))\" )\\n\")\n\nV max_swaps = min(black_stack.len, red_stack.len)\nV swap_count = random:(0 .. max_swaps)\nprint(‘Swapping ’swap_count)\n\nF random_partition(stack, count)\n V stack_copy = copy(stack)\n random:shuffle(&stack_copy)\n R (stack_copy[count ..], stack_copy[0 .< count])\n\n(black_stack, V black_swap) = random_partition(black_stack, swap_count)\n(red_stack, V red_swap) = random_partition(red_stack, swap_count)\n\nblack_stack [+]= red_swap\nred_stack [+]= black_swap\n\nI black_stack.count(Black) == red_stack.count(Red)\n print(‘Yeha! The mathematicians assertion is correct.’)\nE\n print(‘Whoops - The mathematicians (or my card manipulations) are flakey’)\n","language":"11l"},{"code":"use AppleScript version \"2.5\" -- OS X 10.11 (El Capitan) or later\nuse framework \"Foundation\"\nuse framework \"GameplayKit\" -- For randomising functions.\n\non cardTrick()\n (* Create a pack of \"cards\" and shuffle it. *)\n set suits to {\"♥️\", \"♣️\", \"♦️\", \"♠️\"}\n set cards to {\"A\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"10\", \"J\", \"Q\", \"K\"}\n set deck to {}\n repeat with s from 1 to (count suits)\n set suit to item s of suits\n repeat with c from 1 to (count cards)\n set end of deck to item c of cards & suit\n end repeat\n end repeat\n set deck to (current application's class \"GKRandomSource\"'s new()'s arrayByShufflingObjectsInArray:(deck)) as list\n\n (* Perform the black pile/red pile/discard stuff. *)\n set {blackPile, redPile, discardPile} to {{}, {}, {}}\n repeat with c from 1 to (count deck) by 2\n set topCard to item c of deck\n if (character -1 of topCard is in \"♣️♠️\") then\n set end of blackPile to item (c + 1) of deck\n else\n set end of redPile to item (c + 1) of deck\n end if\n set end of discardPile to topCard\n end repeat\n -- When equal numbers of two possibilities are randomly paired, the number of pairs whose members are\n -- both one of the possibilities is the same as the number whose members are both the other. The cards\n -- in the red and black piles have effectively been paired with cards of the eponymous colours, so\n -- the number of reds in the red pile is already the same as the number of blacks in the black.\n\n (* Take a random number of random cards from one pile and swap them with an equal number from the other,\n religiously following the \"red bunch\"/\"black bunch\" ritual instead of simply swapping pairs of cards. *)\n -- Where swapped cards are the same colour, this will make no difference at all. Where the colours\n -- are different, both piles will either gain or lose a card of their relevant colour, maintaining\n -- the defining balance either way.\n set {redBunch, blackBunch} to {{}, {}}\n set {redPileCount, blackPileCount} to {(count redPile), (count blackPile)}\n set maxX to blackPileCount\n if (redPileCount < maxX) then set maxX to redPileCount\n set X to (current application's class \"GKRandomDistribution\"'s distributionForDieWithSideCount:(maxX))'s nextInt()\n set RNG to current application's class \"GKShuffledDistribution\"'s distributionForDieWithSideCount:(redPileCount)\n repeat X times\n set r to RNG's nextInt()\n set end of redBunch to item r of redPile\n set item r of redPile to missing value\n end repeat\n set RNG to current application's class \"GKShuffledDistribution\"'s distributionForDieWithSideCount:(blackPileCount)\n repeat X times\n set b to RNG's nextInt()\n set end of blackBunch to item b of blackPile\n set item b of blackPile to missing value\n end repeat\n set blackPile to (blackPile's text) & redBunch\n set redPile to (redPile's text) & blackBunch\n\n (* Count and compare the number of blacks in the black pile and the number of reds in the red. *)\n set blacksInBlackPile to 0\n repeat with card in blackPile\n if (character -1 of card is in \"♣️♠️\") then set blacksInBlackPile to blacksInBlackPile + 1\n end repeat\n set redsInRedPile to 0\n repeat with card in redPile\n if (character -1 of card is in \"♥️♦️\") then set redsInRedPile to redsInRedPile + 1\n end repeat\n\n return {truth:(blacksInBlackPile = redsInRedPile), reds:redPile, blacks:blackPile, discards:discardPile}\nend cardTrick\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\non task()\n set output to {}\n repeat with i from 1 to 5\n set {truth:truth, reds:reds, blacks:blacks, discards:discards} to cardTrick()\n set end of output to \"Test \" & i & \": Assertion is \" & truth\n set end of output to \"Red pile: \" & join(reds, \", \")\n set end of output to \"Black pile: \" & join(blacks, \", \")\n set end of output to \"Discards: \" & join(items 1 thru 13 of discards, \", \")\n set end of output to \" \" & (join(items 14 thru 26 of discards, \", \") & linefeed)\n end repeat\n return text 1 thru -2 of join(output, linefeed)\nend task\nreturn task()\n","language":"AppleScript"},{"code":"\"Test 1: Assertion is true\nRed pile: 3♦️, 2♦️, 9♣️, 6♣️, 3♥️, 9♥️, A♠️, 3♠️, 2♥️, Q♠️, 7♥️, K♥️\nBlack pile: Q♥️, J♣️, 7♦️, 4♦️, 8♦️, 5♥️, K♣️, 10♠️, 10♣️, 7♣️, 2♣️, 9♦️, 5♣️, 6♦️\nDiscards: 9♠️, Q♦️, 3♣️, 6♠️, 8♠️, 8♥️, Q♣️, 4♠️, J♠️, K♦️, 7♠️, A♦️, 5♦️\n 10♥️, J♦️, A♥️, 4♥️, 6♥️, J♥️, K♠️, 5♠️, 10♦️, 4♣️, 2♠️, 8♣️, A♣️\n\nTest 2: Assertion is true\nRed pile: 7♣️, Q♠️, 2♦️, K♣️, J♠️, A♠️, J♣️, 5♣️, 6♥️, 7♦️, 5♥️, 9♥️, 8♠️, 3♠️, 6♣️, 4♠️\nBlack pile: K♠️, J♦️, 4♣️, 10♠️, 4♥️, 3♥️, 6♠️, 4♦️, 10♣️, 9♦️\nDiscards: 8♦️, J♥️, A♣️, 10♥️, 8♣️, 9♠️, A♦️, 2♣️, K♥️, Q♣️, A♥️, 5♦️, 9♣️\n K♦️, 3♣️, 2♠️, 7♠️, 5♠️, 2♥️, 6♦️, 10♦️, 3♦️, Q♦️, 8♥️, 7♥️, Q♥️\n\nTest 3: Assertion is true\nRed pile: 4♥️, 2♠️, Q♦️, 9♣️, 4♣️, 7♥️, A♣️, 6♠️, 3♥️, 8♣️, A♦️, 2♣️, 6♥️, 5♦️\nBlack pile: K♦️, 2♦️, 5♠️, 10♠️, J♠️, 9♦️, 4♦️, 4♠️, Q♣️, 6♣️, 3♣️, 10♦️\nDiscards: J♦️, 9♥️, K♠️, 10♥️, 5♥️, 10♣️, K♣️, 8♠️, 8♥️, A♠️, 7♣️, 7♦️, 8♦️\n Q♠️, 9♠️, 6♦️, 3♠️, 2♥️, J♣️, A♥️, K♥️, Q♥️, 5♣️, 7♠️, 3♦️, J♥️\n\nTest 4: Assertion is true\nRed pile: 6♠️, A♣️, 8♥️, 4♣️, 5♥️, J♠️, 9♠️, 7♥️, 7♣️, 4♦️, A♠️, A♥️, 8♠️, 6♦️, 5♣️, Q♣️, 6♥️, K♠️\nBlack pile: 5♦️, 4♠️, 2♣️, 6♣️, 10♣️, 8♣️, Q♠️, 10♠️\nDiscards: J♥️, A♦️, 7♠️, 9♥️, K♦️, 10♥️, Q♦️, 10♦️, 8♦️, 3♥️, 3♠️, 2♦️, J♣️\n 9♦️, J♦️, 9♣️, 2♠️, 3♦️, 2♥️, 7♦️, Q♥️, 3♣️, K♥️, K♣️, 5♠️, 4♥️\n\nTest 5: Assertion is true\nRed pile: 2♣️, 9♠️, 5♦️, 4♥️, K♥️, 5♥️, 8♦️, 2♠️, 3♦️, 10♥️, 10♦️\nBlack pile: 2♦️, 2♥️, 8♣️, 9♣️, 7♥️, 3♣️, Q♠️, 10♠️, 8♥️, 10♣️, K♣️, 5♠️, 4♦️, 3♥️, 6♥️\nDiscards: 7♦️, J♥️, 7♣️, 4♠️, 6♦️, 4♣️, 7♠️, Q♥️, J♠️, Q♦️, 6♠️, J♣️, A♥️\n 9♦️, K♦️, J♦️, 3♠️, 5♣️, Q♣️, A♣️, K♠️, 8♠️, 9♥️, A♠️, 6♣️, A♦️\"\n","language":"AppleScript"},{"code":";==========================================================\n; create cards\ncards := [], suits := [\"♠\",\"♥\",\"♦\",\"♣\"], num := 0\nfor i, v in StrSplit(\"A,2,3,4,5,6,7,8,9,10,J,Q,K\",\",\")\n\tfor i, suit in suits\n\t\tcards[++num] := v suit\n;==========================================================\n; create gui\nw := 40\nGui, font, S10\nGui, font, S10 CRed\nGui, add, text, w100 , Face Up Red\nloop, 26\n\tGui, add, button, % \"x+0 w\" w \" vFR\" A_Index\nGui, add, text, xs w100 , Face Down\nloop, 26\n\tGui, add, button, % \"x+0 w\" w \" vHR\" A_Index\nGui, font, S10 CBlack\nGui, add, text, xs w100 , Face Up Black\nloop, 26\n\tGui, add, button, % \"x+0 w\" w \" vFB\" A_Index\nGui, add, text, xs w100 , Face Down\nloop, 26\n\tGui, add, button, % \"x+0 w\" w \" vHB\" A_Index\nGui, add, button, xs gShuffle , Shuffle\nGui, add, button, x+1 Disabled vDeal gDeal , Deal\nGui, add, button, x+1 Disabled vMove gMove, Move\nGui, add, button, x+1 Disabled vShowAll gShowAll , Show All\nGui, add, button, x+1 Disabled vPeak gPeak, Peak\nGui, add, StatusBar\nGui, show\nSB_SetParts(200,200)\nSB_SetText(\"0 Face Down Red Cards\", 1)\nSB_SetText(\"0 Face Down Black Cards\", 2)\nreturn\n;==========================================================\nShuffle:\nlist := \"\", shuffled := []\nLoop, 52\n\tlist .= A_Index \",\"\nlist := Trim(list, \",\")\nSort, list, Random D,\nloop, parse, list, `,\n\tshuffled[A_Index] := cards[A_LoopField]\nloop, 26{\n\tGuiControl,, % \"FR\" A_Index\n\tGuiControl,, % \"FB\" A_Index\n\tGuiControl,, % \"HR\" A_Index\n\tGuiControl,, % \"HB\" A_Index\n}\nGuiControl, Enable, Deal\nGuiControl, Disable, Move\nGuiControl, Disable, ShowAll\nGuiControl, Enable, Peak\nreturn\n;==========================================================\npeak:\nlist := \"\"\nfor i, v in shuffled\n\tlist .= i \": \" v (mod(i,2)?\"`t\":\"`n\")\nToolTip , % list, 1000, 0\nreturn\n;==========================================================\nDeal:\nColor := \"\",\nGuiControl, Disable, Deal\nFaceRed:= [], FaceBlack := [], HiddenRed := [], HiddenBlack := [], toggle := 0\nfor i, card in shuffled\n\tif toggle:=!toggle\t{\n\t\tif InStr(card, \"♥\") || InStr(card, \"♦\") {\n\t\t\tColor := \"Red\"\n\t\t\tfaceRed.push(card)\n\t\t\tGuiControl,, % \"FR\" faceRed.Count(), % card\n\t\t}\n\t\telse if InStr(card, \"♠\") || InStr(card, \"♣\") {\n\t\t\tColor := \"Black\"\n\t\t\tfaceBlack.push(card)\n\t\t\tGuiControl,, % \"FB\" faceBlack.Count(), % card\n\t\t}\n\t}\n\telse{\n\t\tHidden%Color%.push(card)\n\t\tGuiControl,, % (color=\"red\"?\"HR\":\"HB\") Hidden%Color%.Count(), % \"?\"\n\t\tSleep, 50\n\t}\nGuiControl, Enable, Move\nGuiControl, Enable, ShowAll\nreturn\n;==========================================================\nMove:\ntempR := [], tempB := []\nRandom, rndcount, 1, % HiddenRed.Count() < HiddenBlack.Count() ? HiddenRed.Count() : HiddenBlack.Count()\nloop, % rndcount{\n\tRandom, rnd, 1, % HiddenRed.Count()\n\tRandom, rnd, 1, % HiddenBlack.Count()\n\ttempR.push(HiddenRed.RemoveAt(rnd))\n\ttempB.push(HiddenBlack.RemoveAt(rnd))\n}\nlist := \"\"\nfor i, v in tempR\n\tlist .= v \"`t\" tempB[i] \"`n\"\nMsgBox % \"swapping \" rndcount \" cards between face down Red and face down Black`n\" (ShowAll?\"Red`tBlack`n\" list:\"\")\nfor i, v in tempR\n\tHiddenBlack.Push(v)\nfor i, v in tempB\n\tHiddenRed.push(v)\nif ShowAll\n\tgosub, ShowAll\nreturn\n;==========================================================\nShowAll:\nShowAll := true, countR := countB := 0\nloop, 26{\n\tGuiControl,, % \"HR\" A_Index\n\tGuiControl,, % \"HB\" A_Index\n}\nfor i, card in HiddenRed\n\tGuiControl,, % \"HR\" i, % (card~= \"[♥♦]\"?\"[\":\"\") card (card~= \"[♥♦]\"?\"]\":\"\")\n\t, countR := (card~= \"[♥♦]\") ? countR+1 : countR\nfor i, card in HiddenBlack\n\tGuiControl,, % \"HB\" i, % (card~= \"[♠♣]\"?\"[\":\"\") card (card~= \"[♠♣]\"?\"]\":\"\")\n\t, countB := (card~= \"[♠♣]\") ? countB+1 : countB\nSB_SetText(countR \" Face Down Red Cards\", 1)\nSB_SetText(countB \" Face Down Black Cards\", 2)\nreturn\n;==========================================================\n","language":"AutoHotkey"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <stdint.h>\n\n#define SIM_N 5 /* Run 5 simulations */\n#define PRINT_DISCARDED 1 /* Whether or not to print the discard pile */\n\n#define min(x,y) ((x<y)?(x):(y))\n\ntypedef uint8_t card_t;\n\n/* Return a random number from an uniform distribution (0..n-1) */\nunsigned int rand_n(unsigned int n) {\n unsigned int out, mask = 1;\n /* Find how many bits to mask off */\n while (mask < n) mask = mask<<1 | 1;\n /* Generate random number */\n do {\n out = rand() & mask;\n } while (out >= n);\n return out;\n}\n\n/* Return a random card (0..51) from an uniform distribution */\ncard_t rand_card() {\n return rand_n(52);\n}\n\n/* Print a card */\nvoid print_card(card_t card) {\n static char *suits = \"HCDS\"; /* hearts, clubs, diamonds and spades */\n static char *cards[] = {\"A\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\",\"10\",\"J\",\"Q\",\"K\"};\n printf(\" %s%c\", cards[card>>2], suits[card&3]);\n}\n\n/* Shuffle a pack */\nvoid shuffle(card_t *pack) {\n int card;\n card_t temp, randpos;\n for (card=0; card<52; card++) {\n randpos = rand_card();\n temp = pack[card];\n pack[card] = pack[randpos];\n pack[randpos] = temp;\n }\n}\n\n/* Do the card trick, return whether cards match */\nint trick() {\n card_t pack[52];\n card_t blacks[52/4], reds[52/4];\n card_t top, x, card;\n int blackn=0, redn=0, blacksw=0, redsw=0, result;\n\n /* Create and shuffle a pack */\n for (card=0; card<52; card++) pack[card] = card;\n shuffle(pack);\n\n /* Deal cards */\n#if PRINT_DISCARDED\n printf(\"Discarded:\"); /* Print the discard pile */\n#endif\n for (card=0; card<52; card += 2) {\n top = pack[card]; /* Take card */\n if (top & 1) { /* Add next card to black or red pile */\n blacks[blackn++] = pack[card+1];\n } else {\n reds[redn++] = pack[card+1];\n }\n#if PRINT_DISCARDED\n print_card(top); /* Show which card is discarded */\n#endif\n }\n#if PRINT_DISCARDED\n printf(\"\\n\");\n#endif\n\n /* Swap an amount of cards */\n x = rand_n(min(blackn, redn));\n for (card=0; card<x; card++) {\n /* Pick a random card from the black and red pile to swap */\n blacksw = rand_n(blackn);\n redsw = rand_n(redn);\n /* Swap them */\n top = blacks[blacksw];\n blacks[blacksw] = reds[redsw];\n reds[redsw] = top;\n }\n\n /* Verify the assertion */\n result = 0;\n for (card=0; card<blackn; card++)\n result += (blacks[card] & 1) == 1;\n for (card=0; card<redn; card++)\n result -= (reds[card] & 1) == 0;\n result = !result;\n\n printf(\"The number of black cards in the 'black' pile\"\n \" %s the number of red cards in the 'red' pile.\\n\",\n result? \"equals\" : \"does not equal\");\n return result;\n}\n\nint main() {\n unsigned int seed, i, successes = 0;\n FILE *r;\n\n /* Seed the RNG with bytes from from /dev/urandom */\n if ((r = fopen(\"/dev/urandom\", \"r\")) == NULL) {\n fprintf(stderr, \"cannot open /dev/urandom\\n\");\n return 255;\n }\n if (fread(&seed, sizeof(unsigned int), 1, r) != 1) {\n fprintf(stderr, \"failed to read from /dev/urandom\\n\");\n return 255;\n }\n fclose(r);\n srand(seed);\n\n /* Do simulations. */\n for (i=1; i<=SIM_N; i++) {\n printf(\"Simulation %d\\n\", i);\n successes += trick();\n printf(\"\\n\");\n }\n\n printf(\"Result: %d successes out of %d simulations\\n\",\n successes, SIM_N);\n\n return 0;\n}\n","language":"C"},{"code":"#include <algorithm>\n#include <cstdint>\n#include <iomanip>\n#include <iostream>\n#include <numeric>\n#include <random>\n#include <vector>\n\ntemplate <typename T>\nvoid print_vector(const std::vector<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\nint main() {\n\tstd::vector<char> cards;\n\tfor ( int32_t i = 0; i < 26; ++i ) {\n\t\tcards.emplace_back('R');\n\t\tcards.emplace_back('B');\n\t}\n\n\tstd::random_device rand;\n\tstd::mt19937 mersenne_twister(rand());\n\tstd::shuffle(cards.begin(), cards.end(), mersenne_twister);\n\n\tstd::vector<char> red_pile;\n\tstd::vector<char> black_pile;\n\tstd::vector<char> discard_pile;\n\n\tfor ( int32_t i = 0; i < 52; i += 2 ) {\n\t\tif ( cards[i] == 'R' ) {\n\t\t\tred_pile.emplace_back(cards[i + 1]);\n\t\t} else {\n\t\t\tblack_pile.emplace_back(cards[i + 1]);\n\t\t}\n\t\tdiscard_pile.emplace_back(cards[i]);\n\t}\n\n\tstd::cout << \"A sample run.\" << \"\\n\" << std::endl;\n\tstd::cout << \"After dealing the cards the state of the piles is:\" << std::endl;\n\tstd::cout << \" Red : \" << std::setw(2) << red_pile.size() << \" cards -> \"; print_vector<char>(red_pile);\n\tstd::cout << \" Black : \" << std::setw(2) << black_pile.size() << \" cards -> \"; print_vector<char>(black_pile);\n\tstd::cout << \" Discard: \" << std::setw(2) << discard_pile.size()\n << \" cards -> \"; print_vector<char>(discard_pile);\n\n\tconst int32_t minimum_size = std::min(red_pile.size(), black_pile.size());\n\tstd::uniform_int_distribution<int> uniform_random{ 1, minimum_size };\n\tconst int32_t choice = uniform_random(mersenne_twister);\n\n\tstd::vector<int32_t> red_indexes(red_pile.size());\n\tstd::iota(red_indexes.begin(), red_indexes.end(), 0);\n\tstd::vector<int32_t> black_indexes(black_pile.size());\n\tstd::iota(black_indexes.begin(), black_indexes.end(), 0);\n\n\tstd::shuffle(red_indexes.begin(), red_indexes.end(), mersenne_twister);\n\tstd::shuffle(black_indexes.begin(), black_indexes.end(), mersenne_twister);\n\n\tstd::vector<int32_t> red_chosen_indexes(red_indexes.begin(), red_indexes.begin() + choice);\n\tstd::vector<int32_t> black_chosen_indexes(black_indexes.begin(), black_indexes.begin() + choice);\n\n\tstd::cout << \"\\n\" << \"Number of cards are to be swapped: \" << choice << std::endl;\n\tstd::cout << \"The respective zero-based indices of the cards to be swapped are:\" << std::endl;\n\tstd::cout << \" Red : \"; print_vector<int32_t>(red_chosen_indexes);\n\tstd::cout << \" Black: \"; print_vector<int32_t>(black_chosen_indexes);\n\n\tfor ( int32_t i = 0; i < choice; ++i ) {\n\t\tconst char temp = red_pile[red_chosen_indexes[i]];\n\t\tred_pile[red_chosen_indexes[i]] = black_pile[black_chosen_indexes[i]];\n\t\tblack_pile[black_chosen_indexes[i]] = temp;\n\t}\n\n\tstd::cout << \"\\n\" << \"After swapping cards the state of the red and black piles is:\" << std::endl;\n\tstd::cout << \" Red : \"; print_vector<char>(red_pile);\n\tstd::cout << \" Black: \"; print_vector<char>(black_pile);\n\n\tint32_t red_count = 0;\n\tfor ( const char& ch : red_pile ) {\n\t\tif ( ch == 'R' ) {\n\t\t\tred_count++;\n\t\t}\n\t}\n\n\tint32_t black_count = 0;\n\tfor ( const char& ch : black_pile ) {\n\t\tif ( ch == 'B' ) {\n\t\t\tblack_count++;\n\t\t}\n\t}\n\n\tstd::cout << \"\\n\" << \"The number of red cards in the red pile: \" << red_count << std::endl;\n\tstd::cout << \"The number of black cards in the black pile: \" << black_count << std::endl;\n\tif ( red_count == black_count ) {\n\t\tstd::cout << \"So the assertion is correct.\" << std::endl;\n\t} else {\n\t\tstd::cout << \"So the assertion is incorrect.\" << std::endl;\n\t}\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\npublic class MindBogglingCardTrick\n{\n public static void Main(string[] args)\n {\n List<char> cards = new List<char>();\n cards.AddRange(Enumerable.Repeat('R', 26));\n cards.AddRange(Enumerable.Repeat('B', 26));\n Shuffle(cards);\n\n List<char> redPile = new List<char>();\n List<char> blackPile = new List<char>();\n List<char> discardPile = new List<char>();\n\n for (int i = 0; i < 52; i += 2)\n {\n if (cards[i] == 'R')\n {\n redPile.Add(cards[i + 1]);\n }\n else\n {\n blackPile.Add(cards[i + 1]);\n }\n discardPile.Add(cards[i]);\n }\n\n Console.WriteLine(\"A sample run.\\n\");\n Console.WriteLine(\"After dealing the cards the state of the piles is:\");\n Console.WriteLine($\" Red : {redPile.Count} cards -> {string.Join(\",\", redPile)}\");\n Console.WriteLine($\" Black : {blackPile.Count} cards -> {string.Join(\",\", blackPile)}\");\n Console.WriteLine($\" Discard: {discardPile.Count} cards -> {string.Join(\",\", discardPile)}\");\n\n Random random = new Random();\n int minimumSize = Math.Min(redPile.Count, blackPile.Count);\n int choice = random.Next(1, minimumSize + 1);\n\n List<int> redIndexes = Enumerable.Range(0, redPile.Count).ToList();\n List<int> blackIndexes = Enumerable.Range(0, blackPile.Count).ToList();\n Shuffle(redIndexes);\n Shuffle(blackIndexes);\n List<int> redChosenIndexes = redIndexes.Take(choice).ToList();\n List<int> blackChosenIndexes = blackIndexes.Take(choice).ToList();\n\n Console.WriteLine($\"\\nNumber of cards are to be swapped: {choice}\");\n Console.WriteLine(\"The respective zero-based indices of the cards to be swapped are:\");\n Console.WriteLine($\" Red : {string.Join(\", \", redChosenIndexes)}\");\n Console.WriteLine($\" Black: {string.Join(\", \", blackChosenIndexes)}\");\n\n for (int i = 0; i < choice; i++)\n {\n char temp = redPile[redChosenIndexes[i]];\n redPile[redChosenIndexes[i]] = blackPile[blackChosenIndexes[i]];\n blackPile[blackChosenIndexes[i]] = temp;\n }\n\n Console.WriteLine($\"\\nAfter swapping cards the state of the red and black piles is:\");\n Console.WriteLine($\" Red : {string.Join(\", \", redPile)}\");\n Console.WriteLine($\" Black: {string.Join(\", \", blackPile)}\");\n\n int redCount = redPile.Count(ch => ch == 'R');\n int blackCount = blackPile.Count(ch => ch == 'B');\n\n Console.WriteLine($\"\\nThe number of red cards in the red pile: {redCount}\");\n Console.WriteLine($\"The number of black cards in the black pile: {blackCount}\");\n if (redCount == blackCount)\n {\n Console.WriteLine(\"So the assertion is correct.\");\n }\n else\n {\n Console.WriteLine(\"So the assertion is incorrect.\");\n }\n }\n\n private static void Shuffle<T>(List<T> list)\n {\n Random rng = new Random();\n int n = list.Count;\n while (n > 1)\n {\n n--;\n int k = rng.Next(n + 1);\n T value = list[k];\n list[k] = list[n];\n list[n] = value;\n }\n }\n}\n","language":"C-sharp"},{"code":"deck = ([:black, :red] * 26 ).shuffle\nblack_pile, red_pile, discard = [] of Symbol, [] of Symbol, [] of Symbol\n\nuntil deck.empty?\n discard << deck.pop\n discard.last == :black ? black_pile << deck.pop : red_pile << deck.pop\nend\n\nx = rand( [black_pile.size, red_pile.size].min )\n\nred_bunch = (0...x).map { red_pile.delete_at( rand( red_pile.size )) }\nblack_bunch = (0...x).map { black_pile.delete_at( rand( black_pile.size )) }\n\nblack_pile += red_bunch\nred_pile += black_bunch\n\nputs \"The magician predicts there will be #{black_pile.count( :black )} red cards in the other pile.\nDrumroll...\nThere were #{red_pile.count( :red )}!\"\n","language":"Crystal"},{"code":"proc shuffle . a[] .\n for i = len a[] downto 2\n r = randint i\n swap a[r] a[i]\n .\n.\nfunc$ a2str a[] .\n for v in a[]\n r$ &= strchar v & \" \"\n .\n return r$\n.\nR = strcode \"R\"\nB = strcode \"B\"\nfor i to 26\n pack[] &= R\n pack[] &= B\n.\nshuffle pack[]\n#\nfor i = 1 step 2 to 51\n if pack[i] = B\n black[] &= pack[i + 1]\n else\n red[] &= pack[i + 1]\n .\n discard[] &= pack[i]\n.\nprint \"After dealing the cards the state of the stacks is:\"\nprint \" Red : \" & a2str red[]\nprint \" Black : \" & a2str black[]\nprint \" Discard: \" & a2str discard[]\nfor i to len red[]\n rp[] &= i\n.\nfor i to len black[]\n bp[] &= i\n.\nshuffle rp[]\nshuffle bp[]\nn = randint lower len red[] len black[]\nlen rp[] n\nlen bp[] n\n#\nfor i to n\n h = red[rp[i]]\n red[rp[i]] = black[bp[i]]\n black[bp[i]] = h\n.\nprint \"\"\nprint \"After swapping \" & n & \" cards the state of the stacks is:\"\nprint \" Red : \" & a2str red[]\nprint \" Black : \" & a2str black[]\n#\nfor c in red[]\n red += if c = R\n.\nfor c in black[]\n black += if c = B\n.\nprint \"\"\nprint \"The number of red cards in the red stack = \" & red\nprint \"The number of black cards in the black stack = \" & black\nif red = black\n print \"So the asssertion is correct!\"\n.\n","language":"EasyLang"},{"code":"//Be boggled? Nigel Galloway: September 19th., 2018\nlet N=System.Random()\nlet fN=List.unfold(function |(0,0)->None |(n,g)->let ng=N.Next (n+g) in Some (if ng>=n then (\"Black\",(n,g-1)) else (\"Red\",(n-1,g))))(26,26)\nlet fG n=let (n,n')::(g,g')::_=List.countBy(fun (n::g::_)->if n=g then n else g) n in sprintf \"%d %s cards and %d %s cards\" n' n g' g\nprintf \"A well shuffled deck -> \"; List.iter (printf \"%s \") fN; printfn \"\"\nfN |> List.chunkBySize 2 |> List.groupBy List.head |> List.iter(fun(n,n')->printfn \"The %s pile contains %s\" n (fG n'))\n","language":"F-Sharp"},{"code":"USING: accessors combinators.extras formatting fry\ngeneralizations io kernel math math.ranges random sequences\nsequences.extras ;\nIN: rosetta-code.mind-boggling-card-trick\n\nSYMBOLS: R B ;\n\nTUPLE: piles deck red black discard ;\n\n: initialize-deck ( -- seq )\n [ R ] [ B ] [ '[ 26 _ V{ } replicate-as ] call ] bi@ append\n randomize ;\n\n: <piles> ( -- piles )\n initialize-deck [ V{ } clone ] thrice piles boa ;\n\n: deal-step ( piles -- piles' )\n dup [ deck>> pop dup ] [ discard>> push ] [ deck>> pop ] tri\n B = [ over black>> ] [ over red>> ] if push ;\n\n: deal ( piles -- piles' ) 26 [ deal-step ] times ;\n\n: choose-sample-size ( piles -- n )\n [ red>> ] [ black>> ] bi shorter length [0,b] random ;\n\n! Partition a sequence into n random samples in one sequence and\n! the leftovers in another.\n: sample-partition ( vec n -- leftovers sample )\n [ 3 dupn ] dip sample dup\n [ [ swap remove-first! drop ] with each ] dip ;\n\n: perform-swaps ( piles -- piles' )\n dup dup choose-sample-size dup \"Swapping %d\\n\" printf\n [ [ red>> ] dip ] [ [ black>> ] dip ] 2bi\n [ sample-partition ] 2bi@ [ append ] dip rot append\n [ >>black ] dip >>red ;\n\n: test-assertion ( piles -- )\n [ red>> ] [ black>> ] bi\n [ [ R = ] count ] [ [ B = ] count ] bi* 2dup =\n [ \"Assertion correct!\" ]\n [ \"Assertion incorrect!\" ] if print\n \"R in red: %d\\nB in black: %d\\n\" printf ;\n\n: main ( -- )\n <piles> ! step 1\n deal ! step 2\n dup \"Post-deal state:\\n%u\\n\" printf\n perform-swaps ! step 3\n dup \"Post-swap state:\\n%u\\n\" printf\n test-assertion ; ! step 4\n\nMAIN: main\n","language":"Factor"},{"code":"Randomize Timer\nDim Shared As String Deck(52), BlackPile(52), RedPile(52), DiscardPile(52)\nDim Shared As Integer BlP, ReP, DiP\n\nSub Show\n Dim As Integer i\n Print \"Black pile: \";\n For i = 0 To BlP-1\n Print BlackPile(i);\n Next i\n Print !\"\\nRed pile: \";\n For i = 0 To ReP-1\n Print RedPile(i);\n Next i\n Print !\"\\nDiscard pile: \";\n For i = 0 To DiP-1\n Print DiscardPile(i);\n Next i\n Print\nEnd Sub\n\nDim As String BlackBunch(52), RedBunch(52)\nDim As Integer i, j, m, x, y, BB, RB, BC, RC\nDim As Integer ub = Ubound(Deck)\n\nFor i = 0 To (ub/2)-1\n Deck(i) = \"r\"\n Deck(i+26) = \"b\"\nNext i\nFor i = 0 To ub-1\n y = Int(Rnd * 51) + 1\n Swap Deck(y), Deck(i)\nNext i\nBlP = 0\nReP = 0\nDiP = 0\nFor i = 0 To ub-1\n If Deck(i) = \"b\" Then\n BlackPile(BlP) = Deck(i+1)\n BlP += 1\n Else\n RedPile(ReP) = Deck(i+1)\n ReP += 1\n End If\n DiscardPile(DiP) = Deck(i)\n DiP += 1\n i += 1\nNext i\n\nShow\nm = BlP\nIf ReP < m Then m = ReP\nx = Int(Rnd * m) + 1\nPrint \"Swap \"; x; \" cards between the red and black piles.\"\nRB = 0\nBB = 0\nFor i = 0 To x-1\n Do\n y = Int(Rnd * ReP)\n Loop Until RedPile(y) <> \"0\"\n RedBunch(RB) = RedPile(y)\n RB += 1\n RedPile(y) = \"0\"\nNext i\nFor i = 0 To x-1\n Do\n y = Int(Rnd * BlP)\n Loop Until BlackPile(y) <> \"0\"\n BlackBunch(BB) = BlackPile(y)\n BB += 1\n BlackPile(y) = \"0\"\nNext i\nRB = 0\nFor i = 0 To x-1\n j = 0\n While BlackPile(j) <> \"0\"\n j += 1\n Wend\n BlackPile(j) = RedBunch(RB)\n RB += 1\nNext i\nBB = 0\nFor i = 0 To x-1\n j = 0\n While RedPile(j) <> \"0\"\n j += 1\n Wend\n RedPile(j) = BlackBunch(BB)\n BB += 1\nNext i\n\nShow\nBC = 0\nFor i = 0 To BlP-1\n If BlackPile(i) = \"b\" Then BC += 1\nNext i\nRC = 0\nFor i = 0 To ReP-1\n If RedPile(i) = \"r\" Then RC += 1\nNext i\nPrint \"The number of black cards in the black pile is \"; BC\nPrint \"The number of red cards in the red pile is \"; RC\nPrint Using \"The mathematician's assertion is &correct.\"; Iif(BC <>RC, \"not \", \"\")\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/rand\"\n \"time\"\n)\n\nfunc main() {\n // Create pack, half red, half black and shuffle it.\n var pack [52]byte\n for i := 0; i < 26; i++ {\n pack[i] = 'R'\n pack[26+i] = 'B'\n }\n rand.Seed(time.Now().UnixNano())\n rand.Shuffle(52, func(i, j int) {\n pack[i], pack[j] = pack[j], pack[i]\n })\n\n // Deal from pack into 3 stacks.\n var red, black, discard []byte\n for i := 0; i < 51; i += 2 {\n switch pack[i] {\n case 'B':\n black = append(black, pack[i+1])\n case 'R':\n red = append(red, pack[i+1])\n }\n discard = append(discard, pack[i])\n }\n lr, lb, ld := len(red), len(black), len(discard)\n fmt.Println(\"After dealing the cards the state of the stacks is:\")\n fmt.Printf(\" Red : %2d cards -> %c\\n\", lr, red)\n fmt.Printf(\" Black : %2d cards -> %c\\n\", lb, black)\n fmt.Printf(\" Discard: %2d cards -> %c\\n\", ld, discard)\n\n // Swap the same, random, number of cards between the red and black stacks.\n min := lr\n if lb < min {\n min = lb\n }\n n := 1 + rand.Intn(min)\n rp := rand.Perm(lr)[:n]\n bp := rand.Perm(lb)[:n]\n fmt.Printf(\"\\n%d card(s) are to be swapped.\\n\\n\", n)\n fmt.Println(\"The respective zero-based indices of the cards(s) to be swapped are:\")\n fmt.Printf(\" Red : %2d\\n\", rp)\n fmt.Printf(\" Black : %2d\\n\", bp)\n for i := 0; i < n; i++ {\n red[rp[i]], black[bp[i]] = black[bp[i]], red[rp[i]]\n }\n fmt.Println(\"\\nAfter swapping, the state of the red and black stacks is:\")\n fmt.Printf(\" Red : %c\\n\", red)\n fmt.Printf(\" Black : %c\\n\", black)\n\n // Check that the number of black cards in the black stack equals\n // the number of red cards in the red stack.\n rcount, bcount := 0, 0\n for _, c := range red {\n if c == 'R' {\n rcount++\n }\n }\n for _, c := range black {\n if c == 'B' {\n bcount++\n }\n }\n\n fmt.Println(\"\\nThe number of red cards in the red stack =\", rcount)\n fmt.Println(\"The number of black cards in the black stack =\", bcount)\n if rcount == bcount {\n fmt.Println(\"So the asssertion is correct!\")\n } else {\n fmt.Println(\"So the asssertion is incorrect!\")\n }\n}\n","language":"Go"},{"code":"import System.Random (randomRIO)\nimport Data.List (partition)\nimport Data.Monoid ((<>))\n\nmain :: IO [Int]\nmain = do\n\n -- DEALT\n ns <- knuthShuffle [1 .. 52]\n let (rs_, bs_, discards) = threeStacks (rb <$> ns)\n\n -- SWAPPED\n nSwap <- randomRIO (1, min (length rs_) (length bs_))\n let (rs, bs) = exchange nSwap rs_ bs_\n\n -- CHECKED\n let rrs = filter ('R' ==) rs\n let bbs = filter ('B' ==) bs\n putStrLn $\n unlines\n [ \"Discarded: \" <> discards\n , \"Swapped: \" <> show nSwap\n , \"Red pile: \" <> rs\n , \"Black pile: \" <> bs\n , rrs <> \" = Red cards in the red pile\"\n , bbs <> \" = Black cards in the black pile\"\n , show $ length rrs == length bbs\n ]\n return ns\n\n-- RED vs BLACK ----------------------------------------\nrb :: Int -> Char\nrb n\n | even n = 'R'\n | otherwise = 'B'\n\n-- THREE STACKS ----------------------------------------\nthreeStacks :: String -> (String, String, String)\nthreeStacks = go ([], [], [])\n where\n go tpl [] = tpl\n go (rs, bs, ds) [x] = (rs, bs, x : ds)\n go (rs, bs, ds) (x:y:xs)\n | 'R' == x = go (y : rs, bs, x : ds) xs\n | otherwise = go (rs, y : bs, x : ds) xs\n\nexchange :: Int -> [a] -> [a] -> ([a], [a])\nexchange n xs ys =\n let [xs_, ys_] = splitAt n <$> [xs, ys]\n in (fst ys_ <> snd xs_, fst xs_ <> snd ys_)\n\n-- SHUFFLE -----------------------------------------------\n-- (See Knuth Shuffle task)\nknuthShuffle :: [a] -> IO [a]\nknuthShuffle xs = (foldr swapElems xs . zip [1 ..]) <$> randoms (length xs)\n\nrandoms :: Int -> IO [Int]\nrandoms x = traverse (randomRIO . (,) 0) [1 .. (pred x)]\n\nswapElems :: (Int, Int) -> [a] -> [a]\nswapElems (i, j) xs\n | i == j = xs\n | otherwise = replaceAt j (xs !! i) $ replaceAt i (xs !! j) xs\n\nreplaceAt :: Int -> a -> [a] -> [a]\nreplaceAt i c l =\n let (a, b) = splitAt i l\n in a ++ c : drop 1 b\n","language":"Haskell"},{"code":" NB. A failed assertion looks like this\n assert 0\n|assertion failure: assert\n| assert 0\n","language":"J"},{"code":"shuffle =: {~ ?~@:#\nf =: (,&.> {:)~\ng =: ({.@],(f {:))`((f {.),{:@])@.({.@[)\n\ntrick =: 3 :0\n DECK =: shuffle 2 | i. 52\n 'B R' =: shuffle L:_1 > g&.>/(_2 <\\ DECK) , < 2 # a:\n NB. although I swap the first N cards of each pile,\n NB. the piles were shuffled following placement\n N =: ? R <.&# B\n echo 'prior to swap of ',(\":N),' cards'\n echo 'black pile ',B{'rB'\n echo 'red pile ',R{'rB'\n BR =: N {. B\n RB =: N {. R\n B =: RB , N }. B\n R =: BR , N }. R\n echo 'after swap'\n echo 'black pile ',B{'rB'\n echo 'red pile ',R{'rB'\n B (-:&(+/) -.) R\n)\n\n\n assert trick''\nprior to swap of 10 cards\nblack pile rBrrrrrBBrrrBrr\nred pile BBrBrBBrBBr\nafter swap\nblack pile BBrBrBBrBBrrBrr\nred pile rBrrrrrBBrr\n\n assert trick''\nprior to swap of 6 cards\nblack pile rBBBBrBBr\nred pile rrBBBBrBrBBBBrrBB\nafter swap\nblack pile rrBBBBBBr\nred pile rBBBBrrBrBBBBrrBB\n\n assert trick''\nprior to swap of 3 cards\nblack pile rBrBrrrBBrr\nred pile BrrBrBBrBBBBBBB\nafter swap\nblack pile BrrBrrrBBrr\nred pile rBrBrBBrBBBBBBB\n","language":"J"},{"code":"import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\nimport java.util.concurrent.ThreadLocalRandom;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\npublic final class MindBogglingCardTrick {\n\n\tpublic static void main(String[] aArgs) {\t\t\n\t\tList<Character> cards = new ArrayList<Character>(52);\n\t\tcards.addAll(Collections.nCopies(26, 'R'));\n\t\tcards.addAll(Collections.nCopies(26, 'B'));\n\t\tCollections.shuffle(cards);\n\t\t\n\t\tList<Character> redPile = new ArrayList<Character>();\n\t\tList<Character> blackPile = new ArrayList<Character>();\n\t\tList<Character> discardPile = new ArrayList<Character>();\t\n\t\n\t\tfor ( int i = 0; i < 52; i += 2 ) {\n\t\t\tif ( cards.get(i) == 'R' ) {\n\t\t\t\tredPile.add(cards.get(i + 1));\n\t\t\t} else {\n\t\t\t\tblackPile.add(cards.get(i + 1));\n\t\t\t}\t\n\t discardPile.add(cards.get(i));\n\t }\n\t\t\n\t\tSystem.out.println(\"A sample run.\" + System.lineSeparator());\n\t\tSystem.out.println(\"After dealing the cards the state of the piles is:\");\n\t\tSystem.out.println(String.format(\" Red : %2d cards -> %s\", redPile.size(), redPile));\n\t\tSystem.out.println(String.format(\" Black : %2d cards -> %s\", blackPile.size(), blackPile));\n\t\tSystem.out.println(String.format(\" Discard: %2d cards -> %s\", discardPile.size(), discardPile));\n\t\t\n\t\tThreadLocalRandom random = ThreadLocalRandom.current();\n\t final int minimumSize = Math.min(redPile.size(), blackPile.size());\n\t final int choice = random.nextInt(1, minimumSize + 1);\n\t\n\t List<Integer> redIndexes = IntStream.range(0, redPile.size()).boxed().collect(Collectors.toList());\n\t List<Integer> blackIndexes = IntStream.range(0, blackPile.size()).boxed().collect(Collectors.toList());\n\t Collections.shuffle(redIndexes);\n\t Collections.shuffle(blackIndexes);\n\t List<Integer> redChosenIndexes = redIndexes.subList(0, choice);\n\t List<Integer> blackChosenIndexes = blackIndexes.subList(0, choice);\n\n\t System.out.println(System.lineSeparator() + \"Number of cards are to be swapped: \" + choice);\n\t System.out.println(\"The respective zero-based indices of the cards to be swapped are:\");\n\t System.out.println(\" Red : \" + redChosenIndexes);\n\t System.out.println(\" Black: \" + blackChosenIndexes);\n\t\t\n\t for ( int i = 0; i < choice; i++ ) {\n\t final char temp = redPile.get(redChosenIndexes.get(i));\n\t redPile.set(redChosenIndexes.get(i), blackPile.get(blackChosenIndexes.get(i)));\n\t blackPile.set(blackChosenIndexes.get(i), temp);\n\t }\n\t\n\t System.out.println(System.lineSeparator() + \"After swapping cards the state of the red and black piles is:\");\n\t System.out.println(\" Red : \" + redPile);\n\t System.out.println(\" Black: \" + blackPile);\n\t\n\t int redCount = 0;\n\t for ( char ch : redPile ) {\n\t \tif ( ch == 'R' ) {\n\t \t\tredCount += 1;\n\t \t}\n\t }\n\t\n\t int blackCount = 0;\n\t for ( char ch : blackPile ) {\n\t \tif ( ch == 'B' ) {\n\t \t\tblackCount += 1;\n\t \t}\n\t }\n\t\n\t System.out.println(System.lineSeparator() + \"The number of red cards in the red pile: \" + redCount);\n\t System.out.println(\"The number of black cards in the black pile: \" + blackCount);\n\t if ( redCount == blackCount ) {\n\t \tSystem.out.println(\"So the assertion is correct.\");\n\t } else {\n\t \tSystem.out.println(\"So the assertion is incorrect.\");\n\t }\t\t\n\t}\n\n}\n","language":"Java"},{"code":"(() => {\n 'use strict';\n\n const main = () => {\n const\n // DEALT\n [rs_, bs_, discards] = threeStacks(\n map(n =>\n even(n) ? (\n 'R'\n ) : 'B', knuthShuffle(\n enumFromTo(1, 52)\n )\n )\n ),\n\n // SWAPPED\n nSwap = randomRInt(1, min(rs_.length, bs_.length)),\n [rs, bs] = exchange(nSwap, rs_, bs_),\n\n // CHECKED\n rrs = filter(c => 'R' === c, rs).join(''),\n bbs = filter(c => 'B' === c, bs).join('');\n return unlines([\n 'Discarded: ' + discards.join(''),\n 'Swapped: ' + nSwap,\n 'Red pile: ' + rs.join(''),\n 'Black pile: ' + bs.join(''),\n rrs + ' = Red cards in the red pile',\n bbs + ' = Black cards in the black pile',\n (rrs.length === bbs.length).toString()\n ]);\n };\n\n // THREE STACKS ---------------------------------------\n\n // threeStacks :: [Chars] -> ([Chars], [Chars], [Chars])\n const threeStacks = cards => {\n const go = ([rs, bs, ds]) => xs => {\n const lng = xs.length;\n return 0 < lng ? (\n 1 < lng ? (() => {\n const [x, y] = take(2, xs),\n ds_ = cons(x, ds);\n return (\n 'R' === x ? (\n go([cons(y, rs), bs, ds_])\n ) : go([rs, cons(y, bs), ds_])\n )(drop(2, xs));\n })() : [rs, bs, ds_]\n ) : [rs, bs, ds];\n };\n return go([\n [],\n [],\n []\n ])(cards);\n };\n\n // exchange :: Int -> [a] -> [a] -> ([a], [a])\n const exchange = (n, xs, ys) => {\n const [xs_, ys_] = map(splitAt(n), [xs, ys]);\n return [\n fst(ys_).concat(snd(xs_)),\n fst(xs_).concat(snd(ys_))\n ];\n };\n\n // SHUFFLE --------------------------------------------\n\n // knuthShuffle :: [a] -> [a]\n const knuthShuffle = xs =>\n enumFromTo(0, xs.length - 1)\n .reduceRight((a, i) => {\n const iRand = randomRInt(0, i);\n return i !== iRand ? (\n swapped(i, iRand, a)\n ) : a;\n }, xs);\n\n // swapped :: Int -> Int -> [a] -> [a]\n const swapped = (iFrom, iTo, xs) =>\n xs.map(\n (x, i) => iFrom !== i ? (\n iTo !== i ? (\n x\n ) : xs[iFrom]\n ) : xs[iTo]\n );\n\n // GENERIC FUNCTIONS ----------------------------------\n\n // cons :: a -> [a] -> [a]\n const cons = (x, xs) =>\n Array.isArray(xs) ? (\n [x].concat(xs)\n ) : (x + xs);\n\n // drop :: Int -> [a] -> [a]\n // drop :: Int -> String -> String\n const drop = (n, xs) => xs.slice(n);\n\n // enumFromTo :: Int -> Int -> [Int]\n const enumFromTo = (m, n) =>\n m <= n ? iterateUntil(\n x => n <= x,\n x => 1 + x,\n m\n ) : [];\n\n // even :: Int -> Bool\n const even = n => 0 === n % 2;\n\n // filter :: (a -> Bool) -> [a] -> [a]\n const filter = (f, xs) => xs.filter(f);\n\n // fst :: (a, b) -> a\n const fst = tpl => tpl[0];\n\n // iterateUntil :: (a -> Bool) -> (a -> a) -> a -> [a]\n const iterateUntil = (p, f, x) => {\n const vs = [x];\n let h = x;\n while (!p(h))(h = f(h), vs.push(h));\n return vs;\n };\n\n // map :: (a -> b) -> [a] -> [b]\n const map = (f, xs) => xs.map(f);\n\n // min :: Ord a => a -> a -> a\n const min = (a, b) => b < a ? b : a;\n\n // randomRInt :: Int -> Int -> Int\n const randomRInt = (low, high) =>\n low + Math.floor(\n (Math.random() * ((high - low) + 1))\n );\n\n // snd :: (a, b) -> b\n const snd = tpl => tpl[1];\n\n // splitAt :: Int -> [a] -> ([a],[a])\n const splitAt = n => xs => Tuple(xs.slice(0, n), xs.slice(n));\n\n // take :: Int -> [a] -> [a]\n const take = (n, xs) => xs.slice(0, n);\n\n // Tuple (,) :: a -> b -> (a, b)\n const Tuple = (a, b) => ({\n type: 'Tuple',\n '0': a,\n '1': b,\n length: 2\n });\n\n // unlines :: [String] -> String\n const unlines = xs => xs.join('\\n');\n\n // MAIN ---\n return main();\n})();\n","language":"JavaScript"},{"code":"using Random\n\nconst rbdeck = split(repeat('R', 26) * repeat('B', 26), \"\")\nshuffledeck() = shuffle(rbdeck)\n\nfunction deal!(deck, dpile, bpile, rpile)\n while !isempty(deck)\n if (topcard = pop!(deck)) == \"R\"\n push!(rpile, pop!(deck))\n else\n push!(bpile, pop!(deck))\n end\n push!(dpile, topcard)\n end\nend\n\nfunction swap!(rpile, bpile, nswapping)\n rpick = sort(randperm(length(rpile))[1:nswapping])\n bpick = sort(randperm(length(bpile))[1:nswapping])\n rrm = rpile[rpick]; brm = bpile[bpick]\n deleteat!(rpile, rpick); deleteat!(bpile, bpick)\n append!(rpile, brm); append!(bpile, rrm)\nend\n\nfunction mindbogglingcardtrick(verbose=true)\n prif(cond, txt) = (if(cond) println(txt) end)\n deck = shuffledeck()\n prif(verbose, \"Shuffled deck is: $deck\")\n\n dpile, rpile, bpile = [], [], []\n deal!(deck, dpile, bpile, rpile)\n\n prif(verbose, \"Before swap:\")\n prif(verbose, \"Discard pile: $dpile\")\n prif(verbose, \"Red card pile: $rpile\")\n prif(verbose, \"Black card pile: $bpile\")\n\n amount = rand(1:min(length(rpile), length(bpile)))\n prif(verbose, \"Swapping a random number of cards: $amount will be swapped.\")\n swap!(rpile, bpile, amount)\n\n prif(verbose, \"Red pile after swaps: $rpile\")\n prif(verbose, \"Black pile after swaps: $bpile\")\n println(\"There are $(sum(map(x->x==\"B\", bpile))) black cards in the black card pile:\")\n println(\"there are $(sum(map(x->x==\"R\", rpile))) red cards in the red card pile.\")\n prif(verbose, \"\")\nend\n\nmindbogglingcardtrick()\n\nfor _ in 1:10\n mindbogglingcardtrick(false)\nend\n","language":"Julia"},{"code":"// Version 1.2.61\n\nimport java.util.Random\n\nfun main(args: Array<String>) {\n // Create pack, half red, half black and shuffle it.\n val pack = MutableList(52) { if (it < 26) 'R' else 'B' }\n pack.shuffle()\n\n // Deal from pack into 3 stacks.\n val red = mutableListOf<Char>()\n val black = mutableListOf<Char>()\n val discard = mutableListOf<Char>()\n for (i in 0 until 52 step 2) {\n when (pack[i]) {\n 'B' -> black.add(pack[i + 1])\n 'R' -> red.add(pack[i + 1])\n }\n discard.add(pack[i])\n }\n val sr = red.size\n val sb = black.size\n val sd = discard.size\n println(\"After dealing the cards the state of the stacks is:\")\n System.out.printf(\" Red : %2d cards -> %s\\n\", sr, red)\n System.out.printf(\" Black : %2d cards -> %s\\n\", sb, black)\n System.out.printf(\" Discard: %2d cards -> %s\\n\", sd, discard)\n\n // Swap the same, random, number of cards between the red and black stacks.\n val rand = Random()\n val min = minOf(sr, sb)\n val n = 1 + rand.nextInt(min)\n var rp = MutableList(sr) { it }.shuffled().subList(0, n)\n var bp = MutableList(sb) { it }.shuffled().subList(0, n)\n println(\"\\n$n card(s) are to be swapped\\n\")\n println(\"The respective zero-based indices of the cards(s) to be swapped are:\")\n println(\" Red : $rp\")\n println(\" Black : $bp\")\n for (i in 0 until n) {\n val temp = red[rp[i]]\n red[rp[i]] = black[bp[i]]\n black[bp[i]] = temp\n }\n println(\"\\nAfter swapping, the state of the red and black stacks is:\")\n println(\" Red : $red\")\n println(\" Black : $black\")\n\n // Check that the number of black cards in the black stack equals\n // the number of red cards in the red stack.\n var rcount = 0\n var bcount = 0\n for (c in red) if (c == 'R') rcount++\n for (c in black) if (c == 'B') bcount++\n println(\"\\nThe number of red cards in the red stack = $rcount\")\n println(\"The number of black cards in the black stack = $bcount\")\n if (rcount == bcount) {\n println(\"So the asssertion is correct!\")\n }\n else {\n println(\"So the asssertion is incorrect!\")\n }\n}\n","language":"Kotlin"},{"code":"-- support:\nfunction T(t) return setmetatable(t, {__index=table}) end\ntable.range = function(t,n) local s=T{} for i=1,n do s[i]=i end return s end\ntable.map = function(t,f) local s=T{} for i=1,#t do s[i]=f(t[i]) end return s end\ntable.filter = function(t,f) local s=T{} for i=1,#t do if f(t[i]) then s[#s+1]=t[i] end end return s end\ntable.clone = function(t) local s=T{} for k,v in ipairs(t) do s[k]=v end return s end\ntable.head = function(t,n) local s=T{} n=n>#t and #t or n for i = 1,n do s[i]=t[i] end return s end\ntable.tail = function(t,n) local s=T{} n=n>#t and #t or n for i = 1,n do s[i]=t[#t-n+i] end return s end\ntable.append = function(t,v) local s=t:clone() for i=1,#v do s[#s+1]=v[i] end return s end\ntable.shuffle = function(t) for i=#t,2,-1 do local j=math.random(i) t[i],t[j]=t[j],t[i] end return t end -- inplace!\n\n-- task:\nfunction cardtrick()\n -- 1.\n local deck = T{}:range(52):map(function(v) return v%2==0 and \"B\" or \"R\" end):shuffle()\n print(\"1. DECK : \" .. deck:concat())\n -- 2. (which guarantees the outcome)\n local bpile, rpile, discs = T{}, T{}, T{}\n local xpile = {B=bpile, R=rpile}\n while #deck>0 do\n local card, next = deck:remove(), deck:remove()\n xpile[card]:insert(next)\n discs:insert(card)\n end\n print(\"2. BLACK PILE: \" .. bpile:concat())\n print(\"2. RED PILE : \" .. rpile:concat())\n print(\"2. DISCARDS : \" .. discs:concat())\n -- 3. (which cannot change the outcome)\n local x = math.random(0, math.min(#bpile, #rpile))\n local btake, rtake = T{}, T{}\n for i = 1, x do\n btake:insert((bpile:remove(math.random(#bpile))))\n rtake:insert((rpile:remove(math.random(#rpile))))\n end\n print(\"3. SWAPPING X: \" .. x)\n print(\"3. BLACK SWAP: keep:\" .. bpile:concat() .. \" take:\" .. btake:concat())\n print(\"3. RED SWAP : keep:\" .. rpile:concat() .. \" take:\" .. rtake:concat())\n bpile, rpile = bpile:append(rtake), rpile:append(btake)\n print(\"3. BLACK PILE: \" .. bpile:concat())\n print(\"3. RED PILE : \" .. rpile:concat())\n -- 4. (\"proving\" that which was guaranteed earlier)\n local binb, rinr = bpile:filter(function(v) return v==\"B\" end), rpile:filter(function(v) return v==\"R\" end)\n print(\"4. BLACK PILE: contains \" .. #binb .. \" B's\")\n print(\"4. RED PILE : contains \" .. #rinr .. \" R's\")\n print(#binb==#rinr and \"VERIFIED\" or \"NOT VERIFIED\")\n print()\nend\n\n-- demo:\nmath.randomseed(os.time())\nfor i = 1,3 do cardtrick() end\n","language":"Lua"},{"code":"s = RandomSample@Flatten[{Table[0, 26], Table[1, 26]}]\ng = Take[s, {1, -1, 2}]\nd = Take[s, {2, -1, 2}]\na = b = {};\nTable[If[g[[i]] == 1, AppendTo[a, d[[i]]], AppendTo[b, d[[i]]]], {i,\n Length@g}];\na\nb\ndice = RandomInteger[{1, 6}]\nra = Sort@RandomSample[Range@Length@a, dice]\na = {Delete[a, List /@ ra], a[[ra]]}\nrb = Sort@RandomSample[Range@Length@b, dice]\nb = {Delete[b, List /@ rb], b[[rb]]}\nfinala = Join[a[[1]], b[[2]]]\nfinalb = Join[b[[1]], a[[2]]]\nCount[finala, 1] == Count[finalb, 0]\n","language":"Mathematica"},{"code":"import random, sequtils, strformat, strutils\n\ntype Color {.pure.} = enum Red = \"R\", Black = \"B\"\n\nproc `$`(s: seq[Color]): string = s.join(\" \")\n\n# Create pack, half red, half black and shuffle it.\nvar pack = newSeq[Color](52)\nfor i in 0..51: pack[i] = Color(i < 26)\npack.shuffle()\n\n# Deal from pack into 3 stacks.\nvar red, black, others: seq[Color]\nfor i in countup(0, 51, 2):\n case pack[i]\n of Red: red.add pack[i + 1]\n of Black: black.add pack[i + 1]\n others.add pack[i]\necho \"After dealing the cards the state of the stacks is:\"\necho &\" Red: {red.len:>2} cards -> {red}\"\necho &\" Black: {black.len:>2} cards -> {black}\"\necho &\" Discard: {others.len:>2} cards -> {others}\"\n\n# Swap the same, random, number of cards between the red and black stacks.\nlet m = min(red.len, black.len)\nlet n = rand(1..m)\nvar rp = toSeq(0..red.high)\nrp.shuffle()\nrp.setLen(n)\nvar bp = toSeq(0..black.high)\nbp.shuffle()\nbp.setLen(n)\necho &\"\\n{n} card(s) are to be swapped.\\n\"\necho \"The respective zero-based indices of the cards(s) to be swapped are:\"\necho \" Red : \", rp.join(\" \")\necho \" Black : \", bp.join(\" \")\nfor i in 0..<n:\n swap red[rp[i]], black[bp[i]]\necho \"\\nAfter swapping, the state of the red and black stacks is:\"\necho \" Red : \", red\necho \" Black : \", black\n\n# Check that the number of black cards in the black stack equals\n# the number of red cards in the red stack.\nlet rcount = red.count(Red)\nlet bcount = black.count(Black)\necho \"\"\necho \"The number of red cards in the red stack is \", rcount\necho \"The number of black cards in the black stack is \", bcount\nif rcount == bcount:\n echo \"So the asssertion is correct.\"\nelse:\n echo \"So the asssertion is incorrect.\"\n","language":"Nim"},{"code":"sub trick {\n my(@deck) = @_;\n my $result .= sprintf \"%-28s @deck\\n\", 'Starting deck:';\n\n my(@discard, @red, @black);\n deal(\\@deck, \\@discard, \\@red, \\@black);\n\n $result .= sprintf \"%-28s @red\\n\", 'Red pile:';\n $result .= sprintf \"%-28s @black\\n\", 'Black pile:';\n\n my $n = int rand(+@red < +@black ? +@red : +@black);\n swap(\\@red, \\@black, $n);\n\n $result .= sprintf \"Red pile after %2d swapped: @red\\n\", $n;\n $result .= sprintf \"Black pile after %2d swapped: @black\\n\", $n;\n\n $result .= sprintf \"Red in Red, Black in Black: %d = %d\\n\", (scalar grep {/R/} @red), scalar grep {/B/} @black;\n return \"$result\\n\";\n}\n\nsub deal {\n my($c, $d, $r, $b) = @_;\n while (@$c) {\n my $top = shift @$c;\n if ($top eq 'R') { push @$r, shift @$c }\n else { push @$b, shift @$c }\n push @$d, $top;\n }\n}\n\nsub swap {\n my($r, $b, $n) = @_;\n push @$r, splice @$b, 0, $n;\n push @$b, splice @$r, 0, $n;\n}\n\n@deck = split '', 'RB' x 26; # alternating red and black\nprint trick(@deck);\n@deck = split '', 'RRBB' x 13; # alternating pairs of reds and blacks\nprint trick(@deck);\n@deck = sort @deck; # all blacks precede reds\nprint trick(@deck);\n@deck = sort { -1 + 2*int(rand 2) } @deck; # poor man's shuffle\nprint trick(@deck);\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;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">52</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">pack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shuffle</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">'r'</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: #7060A8;\">repeat</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><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">))</span>\n\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">black</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">red</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">discard</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;\">pack</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;\">top</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pack</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #000000;\">next</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pack</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;\">top</span><span style=\"color: #0000FF;\">==</span><span style=\"color: #008000;\">'b'</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">black</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">next</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">red</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">next</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">discard</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">top</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">black</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shuffle</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">black</span><span style=\"color: #0000FF;\">);</span> <span style=\"color: #000000;\">red</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shuffle</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">red</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (optional)\n --printf(1,\"Discards : %s\\n\",{discard})</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;\">\"Reds : %s\\nBlacks : %s\\n\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">red</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">black</span><span style=\"color: #0000FF;\">})</span>\n\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">lb</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">black</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000000;\">lr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">red</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">ns</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lb</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">lr</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;\">\"Swap %d cards:\\n\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ns</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">b1ns</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">black</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">ns</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #000000;\">r1ns</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">red</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">ns</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">black</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">ns</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r1ns</span>\n <span style=\"color: #000000;\">red</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">ns</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">b1ns</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;\">\"Reds : %s\\nBlacks : %s\\n\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">red</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">black</span><span style=\"color: #0000FF;\">})</span>\n\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">nb</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_eq</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">black</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">'b'</span><span style=\"color: #0000FF;\">)),</span>\n <span style=\"color: #000000;\">nr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_eq</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">red</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">'r'</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">correct</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nr</span><span style=\"color: #0000FF;\">==</span><span style=\"color: #000000;\">nb</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"correct\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">\"**INCORRECT**\"</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 r in red, %d b in black - assertion %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">nr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">nb</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">correct</span><span style=\"color: #0000FF;\">})</span>\n<!--\n","language":"Phix"},{"code":"import random\n\n## 1. Cards\nn = 52\nBlack, Red = 'Black', 'Red'\nblacks = [Black] * (n // 2)\nreds = [Red] * (n // 2)\npack = blacks + reds\n# Give the pack a good shuffle.\nrandom.shuffle(pack)\n\n## 2. Deal from the randomised pack into three stacks\nblack_stack, red_stack, discard = [], [], []\nwhile pack:\n top = pack.pop()\n if top == Black:\n black_stack.append(pack.pop())\n else:\n red_stack.append(pack.pop())\n discard.append(top)\nprint('(Discards:', ' '.join(d[0] for d in discard), ')\\n')\n\n## 3. Swap the same, random, number of cards between the two stacks.\n# We can't swap more than the number of cards in a stack.\nmax_swaps = min(len(black_stack), len(red_stack))\n# Randomly choose the number of cards to swap.\nswap_count = random.randint(0, max_swaps)\nprint('Swapping', swap_count)\n# Randomly choose that number of cards out of each stack to swap.\ndef random_partition(stack, count):\n \"Partition the stack into 'count' randomly selected members and the rest\"\n sample = random.sample(stack, count)\n rest = stack[::]\n for card in sample:\n rest.remove(card)\n return rest, sample\n\nblack_stack, black_swap = random_partition(black_stack, swap_count)\nred_stack, red_swap = random_partition(red_stack, swap_count)\n\n# Perform the swap.\nblack_stack += red_swap\nred_stack += black_swap\n\n## 4. Order from randomness?\nif black_stack.count(Black) == red_stack.count(Red):\n print('Yeha! The mathematicians assertion is correct.')\nelse:\n print('Whoops - The mathematicians (or my card manipulations) are flakey')\n","language":"Python"},{"code":" [ stack ] is discards ( --> s )\n [ stack ] is red-card ( --> s )\n [ stack ] is black-card ( --> s )\n\n [ dup take rot join swap put ] is to-pile ( n s --> )\n\n [ $ \"\" discards put\n $ \"\" red-card put\n $ \"\" black-card put\n char R 26 of\n char B 26 of join shuffle\n 26 times\n [ behead tuck discards to-pile\n behead rot char R =\n iff red-card else black-card\n to-pile ]\n drop\n discards take witheach\n [ emit sp ] cr\n red-card take shuffle\n black-card take shuffle\n over size over size min random\n say \"Swapping \" dup echo\n say \" cards.\" cr\n dup dip [ split rot ] split\n dip join rot join\n 0 swap witheach\n [ char R = + ]\n 0 rot witheach\n [ char B = + ]\n say \"The assertion is \"\n = iff [ say \"true.\" ]\n else [ say \"false.\" ] cr cr ] is task ( --> )\n\n 5 times task\n","language":"Quackery"},{"code":"magictrick<-function(){\n deck=c(rep(\"B\",26),rep(\"R\",26))\n deck=sample(deck,52)\n blackpile=character(0)\n redpile=character(0)\n discardpile=character(0)\n while(length(deck)>0){\n if(deck[1]==\"B\"){\n blackpile=c(blackpile,deck[2])\n deck=deck[-2]\n }else{\n redpile=c(redpile,deck[2])\n deck=deck[-2]\n }\n discardpile=c(discardpile,deck[1])\n deck=deck[-1]\n }\n cat(\"After the deal the state of the piles is:\",\"\\n\",\n \"Black pile:\",blackpile,\"\\n\",\"Red pile:\",redpile,\"\\n\",\n \"Discard pile:\",discardpile,\"\\n\",\"\\n\")\n X=sample(1:min(length(redpile),length(blackpile)),1)\n if(X==1){s=\" is\"}else{s=\"s are\"}\n cat(X,\" card\",s,\" being swapped.\",\"\\n\",\"\\n\",sep=\"\")\n redindex=sample(1:length(redpile),X)\n blackindex=sample(1:length(blackpile),X)\n redbunch=redpile[redindex]\n redpile=redpile[-redindex]\n blackbunch=blackpile[blackindex]\n blackpile=blackpile[-blackindex]\n redpile=c(redpile,blackbunch)\n blackpile=c(blackpile,redbunch)\n cat(\"After the swap the state of the piles is:\",\"\\n\",\n \"Black pile:\",blackpile,\"\\n\",\"Red pile:\",redpile,\"\\n\",\"\\n\")\n cat(\"There are \", length(which(blackpile==\"B\")), \" black cards in the black pile.\",\"\\n\",\n \"There are \", length(which(redpile==\"R\")), \" red cards in the red pile.\",\"\\n\",sep=\"\")\n if(length(which(blackpile==\"B\"))==length(which(redpile==\"R\"))){\n cat(\"The assertion is true!\")\n }\n}\n","language":"R"},{"code":"# Generate a shuffled deck\nmy @deck = shuffle;\nput 'Shuffled deck: ', @deck;\n\nmy (@discard, @red, @black);\n# Deal cards following task description\ndeal(@deck, @discard, @red, @black);\n\nput 'Discard pile: ', @discard;\nput '\"Red\" pile: ', @red;\nput '\"Black\" pile: ', @black;\n\n# swap the same random number of random\n# cards between the red and black piles\nmy $amount = ^(+@red min +@black) .roll;\nput 'Number of cards to swap: ', $amount;\nswap(@red, @black, $amount);\n\nput 'Red pile after swaps: ', @red;\nput 'Black pile after swaps: ', @black;\n\nsay 'Number of Red cards in the Red pile: ', +@red.grep('R');\nsay 'Number of Black cards in the Black pile: ', +@black.grep('B');\n\nsub shuffle { (flat 'R' xx 26, 'B' xx 26).pick: * }\n\nsub deal (@deck, @d, @r, @b) {\n while @deck.elems {\n my $top = @deck.shift;\n if $top eq 'R' {\n @r.push: @deck.shift;\n }\n else {\n @b.push: @deck.shift;\n }\n @d.push: $top;\n }\n}\n\nsub swap (@r, @b, $a) {\n my @ri = ^@r .pick($a);\n my @bi = ^@b .pick($a);\n my @rs = @r[@ri];\n my @bs = @b[@bi];\n @r[@ri] = @bs;\n @b[@bi] = @rs;\n}\n","language":"Raku"},{"code":"/*REXX pgm mimics a boggling card trick; separates cards into 3 piles based on color ···*/\nparse arg trials # shuffs seed . /*obtain optional arguments from the CL*/\nif trials=='' | trials==\",\" then trials= 1000 /*Not specified? Then use the default.*/\nif #=='' | #==\",\" then #= 52 /* \" \" \" \" \" \" */\nif shuffs=='' | shuffs==\",\" then shuffs= #%4 /* \" \" \" \" \" \" */\nif datatype(seed, 'W') then call random ,,seed /*if integer, use this as a RANDOM seed*/\nok=0 /*the number of \"expected\" good trials.*/\n do trials /*perform a number of trials to be safe*/\n call create /*odd numbers≡RED, even numbers≡BLACK.*/\n call shuffle /*shuffle the deck a number of times. */\n call deal /*put cards into three piles of cards. */\n call swap /*swap rand # of cards in R & B piles*/\n call count /*count #blacks in B, #reds in R piles*/\n end /*trials*/ /*#: is the number of cards in the deck*/\npc= (100*ok/trials)'%' /*calculate the % asserted correctly.*/\nsay \"Correctness of the mathematician's assertion:\" pc ' (out of' commas(trials),\n \"trial\"s(trials)') using a deck of ' commas(#) ,\n \" card\"s(#)', and doing ' commas(shuffs) ' shuffle's(shuffs).\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n?: return random(1, word( arg(1) #, 1) ) /*gen a random number from 1 ──► arg. */\ncommas: parse arg _; do j=length(_)-3 to 1 by -3; _=insert(',', _, j); end; return _\ncreate: @.=; k=0; do j=1 by 4 for #; k=k+1; @.k= j; if k//13==0 then j=j+1; end; return\nisRed: return arg(1) // 2 /*if arg(1) is odd, the card is RED.*/\ns: if arg(1)==1 then return arg(3); return word( arg(2) 's', 1) /*pluralizer.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncount: Rn=0; Bn=0; do j=1 for words(R); Rn=Rn+ isRed(word(R,j)) ; end\n do k=1 for words(B); Bn=Bn+ (\\isRed(word(B,k))); end\n if Rn==Bn then ok= ok+1; return /*Was it a good trial? Bump OK counter*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ndeal: R=; B=; D=; do j=1 for #%2 by 2 /*deal all the cards. */\n next= j+1; card= @.next /*obtain the next card. */\n if isRed(@.j) then R=R card /*add to the RED pile?*/\n else B=B card /* \" \" \" BLACK \" */\n D= D @.j /* \" \" \" discard \" */\n end /*j*/\n return /*discard pile not used.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nshuffle: do j=1 for shuffs; x=?(); do until y\\==x | #==1; y=?(); end /*until*/\n parse value @.x @.y with @.y @.x; end /*j*/; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nswap: $= min( words(R), words(B) ); Rc=; Bc= /*ensure we can swap $ cards.*/\n if $==0 then return /*A pile has no cards? return*/\n do ?($) /*$: is the number of swaps.*/\n R?= ?( words(R) ) /*a random card in RED pile.*/\n B?= ?( words(B) ) /*\" \" \" \" BLACK \" */\n /* \"reds\" to be swapped.*/ Rc= Rc word(R, R?); R= delword(R, R?, 1) /*del card*/\n /*\"blacks\" \" \" \" */ Bc= Bc word(B, B?); B= delword(B, B?, 1) /* \" \" */\n end /*?($)*/\n R=R Bc; B=B Rc; return /*add swapped cards to piles.*/\n","language":"REXX"},{"code":"deck = ([:black, :red] * 26 ).shuffle\nblack_pile, red_pile, discard = [], [], []\n\nuntil deck.empty? do\n discard << deck.pop\n discard.last == :black ? black_pile << deck.pop : red_pile << deck.pop\nend\n\nx = rand( [black_pile.size, red_pile.size].min )\n\nred_bunch = x.times.map{ red_pile.delete_at( rand( red_pile.size )) }\nblack_bunch = x.times.map{ black_pile.delete_at( rand( black_pile.size )) }\n\nblack_pile += red_bunch\nred_pile += black_bunch\n\nputs \"The magician predicts there will be #{black_pile.count( :black )} red cards in the other pile.\nDrumroll...\nThere were #{red_pile.count( :red )}!\"\n","language":"Ruby"},{"code":"extern crate rand; // 0.5.5\nuse rand::Rng;\nuse std::iter::repeat;\n\n#[derive(Debug, Eq, PartialEq, Clone)]\nenum Colour {\n Black,\n Red,\n}\nuse Colour::*;\n\nfn main() {\n let mut rng = rand::thread_rng();\n\n //Create our deck.\n let mut deck: Vec<_> = repeat(Black).take(26)\n .chain(repeat(Red).take(26))\n .collect();\n\n rng.shuffle(&mut deck);\n\n let mut black_stack = vec![];\n let mut red_stack = vec![];\n let mut discarded = vec![];\n\n //Deal our cards.\n print!(\"Discarding:\");\n while let (Some(card), Some(next)) = (deck.pop(), deck.pop()) {\n print!(\" {}\", if card == Black { \"B\" } else { \"R\" });\n match card {\n Red => red_stack.push(next),\n Black => black_stack.push(next),\n }\n discarded.push(card);\n }\n println!();\n\n // Choose how many to swap.\n let max = red_stack.len().min(black_stack.len());\n let num = rng.gen_range(1, max);\n println!(\"Exchanging {} cards\", num);\n\n // Actually swap our cards.\n for _ in 0..num {\n let red = rng.choose_mut(&mut red_stack).unwrap();\n let black = rng.choose_mut(&mut black_stack).unwrap();\n std::mem::swap(red, black);\n }\n\n //Count how many are red and black.\n let num_black = black_stack.iter()\n .filter(|&c| c == &Black)\n .count();\n let num_red = red_stack.iter()\n .filter(|&c| c == &Red)\n .count();\n\n println!(\"Number of black cards in black stack: {}\", num_black);\n println!(\"Number of red cards in red stack: {}\", num_red);\n}\n","language":"Rust"},{"code":"import \"random\" for Random\nimport \"./fmt\" for Fmt\n\nvar R = 82 // ASCII 'R'\nvar B = 66 // ASCII 'B'\n\n// Create pack, half red, half black and shuffle it.\nvar pack = [0] * 52\nfor (i in 0..25) {\n pack[i] = R\n pack[26+i] = B\n}\nvar rand = Random.new()\nrand.shuffle(pack)\n\n// Deal from pack into 3 stacks.\nvar red = []\nvar black = []\nvar discard = []\nvar i = 0\nwhile (i < 51) {\n if (pack[i] == B) {\n black.add(pack[i+1])\n } else {\n red.add(pack[i+1])\n }\n discard.add(pack[i])\n i = i + 2\n}\nvar lr = red.count\nvar lb = black.count\nvar ld = discard.count\nSystem.print(\"After dealing the cards the state of the stacks is:\")\nFmt.print(\" Red : $2d cards -> $c\", lr, red)\nFmt.print(\" Black : $2d cards -> $c\", lb, black)\nFmt.print(\" Discard: $2d cards -> $c\", ld, discard)\n\n// Swap the same, random, number of cards between the red and black stacks.\nvar min = (lr < lb) ? lr : lb\nvar n = rand.int(1, min + 1)\nvar rp = [0] * lr\nvar bp = [0] * lb\nfor (i in 0...lr) rp[i] = i\nfor (i in 0...lb) bp[i] = i\nrand.shuffle(rp)\nrand.shuffle(bp)\nrp = rp[0...n]\nbp = bp[0...n]\nSystem.print(\"\\n%(n) card(s) are to be swapped.\\n\")\nSystem.print(\"The respective zero-based indices of the cards(s) to be swapped are:\")\nFmt.print(\" Red : $2d\", rp)\nFmt.print(\" Black : $2d\", bp)\nfor (i in 0...n) {\n var t = red[rp[i]]\n red[rp[i]] = black[bp[i]]\n black[bp[i]] = t\n}\nSystem.print(\"\\nAfter swapping, the state of the red and black stacks is:\")\nFmt.print(\" Red : $c\", red)\nFmt.print(\" Black : $c\", black)\n\n// Check that the number of black cards in the black stack equals\n// the number of red cards in the red stack.\nvar rcount = red.count { |c| c == R }\nvar bcount = black.count { |c| c == B }\nSystem.print(\"\\nThe number of red cards in the red stack = %(rcount)\")\nSystem.print(\"The number of black cards in the black stack = %(bcount)\")\nif (rcount == bcount) {\n System.print(\"So the asssertion is correct!\")\n} else {\n System.print(\"So the asssertion is incorrect!\")\n}\n","language":"Wren"},{"code":"include xpllib; \\for Print\n\nchar Deck(52), BlackPile(52), RedPile(52), DiscardPile(52),\n BlackBunch(52), RedBunch(52);\nint I, J, T, M, X, Y, BP, RP, DP, BB, RB, BC, RC;\n\nproc Show;\n[Print(\"Black pile: \");\nfor I:= 0 to BP-1 do ChOut(0, BlackPile(I));\nPrint(\"\\nRed pile: \");\nfor I:= 0 to RP-1 do ChOut(0, RedPile(I));\nPrint(\"\\nDiscard pile: \");\nfor I:= 0 to DP-1 do ChOut(0, DiscardPile(I));\nPrint(\"\\n\");\n];\n\n[for I:= 0 to 26-1 do\n [Deck(I):= ^r; Deck(I+26):= ^b];\nfor I:= 0 to 52-1 do\n [Y:= Ran(52); \\0..51\n T:= Deck(I); Deck(I):= Deck(Y); Deck(Y):= T;\n ];\nBP:= 0; RP:= 0; DP:= 0;\nfor I:= 0 to 52-1 do\n [if Deck(I) = ^b then\n [BlackPile(BP):= Deck(I+1); BP:= BP+1]\n else\n [RedPile (RP):= Deck(I+1); RP:= RP+1];\n DiscardPile(DP):= Deck(I); DP:= DP+1;\n I:= I+1;\n ];\nShow;\nM:= BP;\nif RP < M then M:= RP;\nX:= Ran(M) + 1;\nPrint(\"Swap %d cards between the red and black piles.\\n\", X);\nRB:= 0; BB:= 0;\nfor I:= 0 to X-1 do\n [repeat Y:= Ran(RP); until RedPile(Y) # 0;\n RedBunch(RB):= RedPile(Y); RB:= RB+1; RedPile(Y):= 0;\n ];\nfor I:= 0 to X-1 do\n [repeat Y:= Ran(BP); until BlackPile(Y) # 0;\n BlackBunch(BB):= BlackPile(Y); BB:= BB+1; BlackPile(Y):= 0;\n ];\nRB:= 0;\nfor I:= 0 to X-1 do\n [J:= 0;\n while BlackPile(J) # 0 do J:= J+1;\n BlackPile(J):= RedBunch(RB); RB:= RB+1;\n ];\nBB:= 0;\nfor I:= 0 to X-1 do\n [J:= 0;\n while RedPile(J) # 0 do J:= J+1;\n RedPile(J):= BlackBunch(BB); BB:= BB+1;\n ];\nShow;\nBC:= 0;\nfor I:= 0 to BP-1 do\n if BlackPile(I) = ^b then BC:= BC+1;\nRC:= 0;\nfor I:= 0 to RP-1 do\n if RedPile(I) = ^r then RC:= RC+1;\nPrint(\"The number of black cards in the black pile is %d.\\n\", BC);\nPrint(\"The number of red cards in the red pile is %d.\\n\", RC);\nPrint(\"The mathematician's assertion is%s correct.\\n\",\n if BC#RC then \" not\" else \"\");\n]\n","language":"XPL0"},{"code":"cards:=[1..52].pump(List,\"isEven\",\"toInt\").shuffle(); // red==1\nstacks:=T(List(),List()); // black stack [0], red stack [1]\nblkStk,redStk := stacks;\nforeach card in (cards){ stacks[card].append(__cardWalker.next()) }\nprintln(\"Stacks:\\n Black stack: \",redBlack(blkStk),\"\\n Red stack: \",redBlack(redStk));\n\nnumSwaps:=(1).random(1000); // do lots of swaps\ndo(numSwaps){ blkStk.append(redStk.pop(0)); redStk.append(blkStk.pop(0)); }\nprintln(\"Post %d swaps:\\n Black stack: %s\\n Red stack: %s\"\n .fmt(numSwaps,redBlack(blkStk),redBlack(redStk)));\n\nnumBlack,numRed := blkStk.filter('==(0)).len(), redStk.sum(0);\nif(numBlack==numRed)\n println(\"Agreed, black stack has same number of black cards\\n \"\n \"as red stack has number of red cards: \",numRed);\nelse println(\"Boo, different stack lenghts\");\n\nfcn redBlack(cards){ cards.pump(String,fcn(c){ c and \"R \" or \"B \" }) }\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Puzzles\\nfrom: http://rosettacode.org/wiki/Mind_boggling_card_trick\\n\",\n \"language\": \"00-META\"\n },\n {\n \"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 semblance of order from chaos.\\n\\nThe task is to simulate the trick in a way that mimics the steps shown in the video.\\n\\n; 1. Cards.\\n# Create a common deck of cards of 52 cards (which are half red, half black).\\n# Give the pack a good shuffle.\\n; 2. Deal from the shuffled deck, you'll be creating three piles.\\n# Assemble the cards face down.\\n## Turn up the ''top card'' and hold it in your hand. \\n### if the card is black, then add the ''next'' card (unseen) to the \\\"black\\\" pile. \\n### If the card is red, then add the ''next'' card (unseen) to the \\\"red\\\" pile.\\n## Add the ''top card'' that you're holding to the '''discard''' pile. (You might optionally show these discarded cards to get an idea of the randomness).\\n# Repeat the above for the rest of the shuffled deck.\\n; 3. Choose a random number (call it '''X''') that will be used to swap cards from the \\\"red\\\" and \\\"black\\\" piles.\\n# Randomly choose '''X''' cards from the \\\"red\\\" pile (unseen), let's call this the \\\"red\\\" bunch. \\n# Randomly choose '''X''' cards from the \\\"black\\\" pile (unseen), let's call this the \\\"black\\\" bunch.\\n# Put the \\\"red\\\" bunch into the \\\"black\\\" pile.\\n# Put the \\\"black\\\" bunch into the \\\"red\\\" pile.\\n# (The above two steps complete the swap of '''X''' cards of the \\\"red\\\" and \\\"black\\\" piles. <br> (Without knowing what those cards are --- they could be red or black, nobody knows).\\n; 4. Order from randomness?\\n# Verify (or not) the mathematician's assertion that: \\n <big> '''The number of black cards in the \\\"black\\\" pile equals the number of red cards in the \\\"red\\\" pile.''' </big>\\n\\n\\n(Optionally, run this simulation a number of times, gathering more evidence of the truthfulness of the assertion.)\\n\\nShow output on this page.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"//import random\\nV n = 52\\nV Black = ‘Black’\\nV Red = ‘Red’\\nV blacks = [Black] * (n I/ 2)\\nV reds = [Red] * (n I/ 2)\\nV pack = blacks [+] reds\\nrandom:shuffle(&pack)\\n\\n[String] black_stack, red_stack, discard\\nL !pack.empty\\n V top = pack.pop()\\n I top == Black\\n black_stack.append(pack.pop())\\n E\\n red_stack.append(pack.pop())\\n discard.append(top)\\nprint(‘(Discards: ’(discard.map(d -> d[0]).join(‘ ’))\\\" )\\\\n\\\")\\n\\nV max_swaps = min(black_stack.len, red_stack.len)\\nV swap_count = random:(0 .. max_swaps)\\nprint(‘Swapping ’swap_count)\\n\\nF random_partition(stack, count)\\n V stack_copy = copy(stack)\\n random:shuffle(&stack_copy)\\n R (stack_copy[count ..], stack_copy[0 .< count])\\n\\n(black_stack, V black_swap) = random_partition(black_stack, swap_count)\\n(red_stack, V red_swap) = random_partition(red_stack, swap_count)\\n\\nblack_stack [+]= red_swap\\nred_stack [+]= black_swap\\n\\nI black_stack.count(Black) == red_stack.count(Red)\\n print(‘Yeha! The mathematicians assertion is correct.’)\\nE\\n print(‘Whoops - The mathematicians (or my card manipulations) are flakey’)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"use AppleScript version \\\"2.5\\\" -- OS X 10.11 (El Capitan) or later\\nuse framework \\\"Foundation\\\"\\nuse framework \\\"GameplayKit\\\" -- For randomising functions.\\n\\non cardTrick()\\n (* Create a pack of \\\"cards\\\" and shuffle it. *)\\n set suits to {\\\"♥️\\\", \\\"♣️\\\", \\\"♦️\\\", \\\"♠️\\\"}\\n set cards to {\\\"A\\\", \\\"2\\\", \\\"3\\\", \\\"4\\\", \\\"5\\\", \\\"6\\\", \\\"7\\\", \\\"8\\\", \\\"9\\\", \\\"10\\\", \\\"J\\\", \\\"Q\\\", \\\"K\\\"}\\n set deck to {}\\n repeat with s from 1 to (count suits)\\n set suit to item s of suits\\n repeat with c from 1 to (count cards)\\n set end of deck to item c of cards & suit\\n end repeat\\n end repeat\\n set deck to (current application's class \\\"GKRandomSource\\\"'s new()'s arrayByShufflingObjectsInArray:(deck)) as list\\n\\n (* Perform the black pile/red pile/discard stuff. *)\\n set {blackPile, redPile, discardPile} to {{}, {}, {}}\\n repeat with c from 1 to (count deck) by 2\\n set topCard to item c of deck\\n if (character -1 of topCard is in \\\"♣️♠️\\\") then\\n set end of blackPile to item (c + 1) of deck\\n else\\n set end of redPile to item (c + 1) of deck\\n end if\\n set end of discardPile to topCard\\n end repeat\\n -- When equal numbers of two possibilities are randomly paired, the number of pairs whose members are\\n -- both one of the possibilities is the same as the number whose members are both the other. The cards\\n -- in the red and black piles have effectively been paired with cards of the eponymous colours, so\\n -- the number of reds in the red pile is already the same as the number of blacks in the black.\\n\\n (* Take a random number of random cards from one pile and swap them with an equal number from the other,\\n religiously following the \\\"red bunch\\\"/\\\"black bunch\\\" ritual instead of simply swapping pairs of cards. *)\\n -- Where swapped cards are the same colour, this will make no difference at all. Where the colours\\n -- are different, both piles will either gain or lose a card of their relevant colour, maintaining\\n -- the defining balance either way.\\n set {redBunch, blackBunch} to {{}, {}}\\n set {redPileCount, blackPileCount} to {(count redPile), (count blackPile)}\\n set maxX to blackPileCount\\n if (redPileCount < maxX) then set maxX to redPileCount\\n set X to (current application's class \\\"GKRandomDistribution\\\"'s distributionForDieWithSideCount:(maxX))'s nextInt()\\n set RNG to current application's class \\\"GKShuffledDistribution\\\"'s distributionForDieWithSideCount:(redPileCount)\\n repeat X times\\n set r to RNG's nextInt()\\n set end of redBunch to item r of redPile\\n set item r of redPile to missing value\\n end repeat\\n set RNG to current application's class \\\"GKShuffledDistribution\\\"'s distributionForDieWithSideCount:(blackPileCount)\\n repeat X times\\n set b to RNG's nextInt()\\n set end of blackBunch to item b of blackPile\\n set item b of blackPile to missing value\\n end repeat\\n set blackPile to (blackPile's text) & redBunch\\n set redPile to (redPile's text) & blackBunch\\n\\n (* Count and compare the number of blacks in the black pile and the number of reds in the red. *)\\n set blacksInBlackPile to 0\\n repeat with card in blackPile\\n if (character -1 of card is in \\\"♣️♠️\\\") then set blacksInBlackPile to blacksInBlackPile + 1\\n end repeat\\n set redsInRedPile to 0\\n repeat with card in redPile\\n if (character -1 of card is in \\\"♥️♦️\\\") then set redsInRedPile to redsInRedPile + 1\\n end repeat\\n\\n return {truth:(blacksInBlackPile = redsInRedPile), reds:redPile, blacks:blackPile, discards:discardPile}\\nend cardTrick\\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\\non task()\\n set output to {}\\n repeat with i from 1 to 5\\n set {truth:truth, reds:reds, blacks:blacks, discards:discards} to cardTrick()\\n set end of output to \\\"Test \\\" & i & \\\": Assertion is \\\" & truth\\n set end of output to \\\"Red pile: \\\" & join(reds, \\\", \\\")\\n set end of output to \\\"Black pile: \\\" & join(blacks, \\\", \\\")\\n set end of output to \\\"Discards: \\\" & join(items 1 thru 13 of discards, \\\", \\\")\\n set end of output to \\\" \\\" & (join(items 14 thru 26 of discards, \\\", \\\") & linefeed)\\n end repeat\\n return text 1 thru -2 of join(output, linefeed)\\nend task\\nreturn task()\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"\\\"Test 1: Assertion is true\\nRed pile: 3♦️, 2♦️, 9♣️, 6♣️, 3♥️, 9♥️, A♠️, 3♠️, 2♥️, Q♠️, 7♥️, K♥️\\nBlack pile: Q♥️, J♣️, 7♦️, 4♦️, 8♦️, 5♥️, K♣️, 10♠️, 10♣️, 7♣️, 2♣️, 9♦️, 5♣️, 6♦️\\nDiscards: 9♠️, Q♦️, 3♣️, 6♠️, 8♠️, 8♥️, Q♣️, 4♠️, J♠️, K♦️, 7♠️, A♦️, 5♦️\\n 10♥️, J♦️, A♥️, 4♥️, 6♥️, J♥️, K♠️, 5♠️, 10♦️, 4♣️, 2♠️, 8♣️, A♣️\\n\\nTest 2: Assertion is true\\nRed pile: 7♣️, Q♠️, 2♦️, K♣️, J♠️, A♠️, J♣️, 5♣️, 6♥️, 7♦️, 5♥️, 9♥️, 8♠️, 3♠️, 6♣️, 4♠️\\nBlack pile: K♠️, J♦️, 4♣️, 10♠️, 4♥️, 3♥️, 6♠️, 4♦️, 10♣️, 9♦️\\nDiscards: 8♦️, J♥️, A♣️, 10♥️, 8♣️, 9♠️, A♦️, 2♣️, K♥️, Q♣️, A♥️, 5♦️, 9♣️\\n K♦️, 3♣️, 2♠️, 7♠️, 5♠️, 2♥️, 6♦️, 10♦️, 3♦️, Q♦️, 8♥️, 7♥️, Q♥️\\n\\nTest 3: Assertion is true\\nRed pile: 4♥️, 2♠️, Q♦️, 9♣️, 4♣️, 7♥️, A♣️, 6♠️, 3♥️, 8♣️, A♦️, 2♣️, 6♥️, 5♦️\\nBlack pile: K♦️, 2♦️, 5♠️, 10♠️, J♠️, 9♦️, 4♦️, 4♠️, Q♣️, 6♣️, 3♣️, 10♦️\\nDiscards: J♦️, 9♥️, K♠️, 10♥️, 5♥️, 10♣️, K♣️, 8♠️, 8♥️, A♠️, 7♣️, 7♦️, 8♦️\\n Q♠️, 9♠️, 6♦️, 3♠️, 2♥️, J♣️, A♥️, K♥️, Q♥️, 5♣️, 7♠️, 3♦️, J♥️\\n\\nTest 4: Assertion is true\\nRed pile: 6♠️, A♣️, 8♥️, 4♣️, 5♥️, J♠️, 9♠️, 7♥️, 7♣️, 4♦️, A♠️, A♥️, 8♠️, 6♦️, 5♣️, Q♣️, 6♥️, K♠️\\nBlack pile: 5♦️, 4♠️, 2♣️, 6♣️, 10♣️, 8♣️, Q♠️, 10♠️\\nDiscards: J♥️, A♦️, 7♠️, 9♥️, K♦️, 10♥️, Q♦️, 10♦️, 8♦️, 3♥️, 3♠️, 2♦️, J♣️\\n 9♦️, J♦️, 9♣️, 2♠️, 3♦️, 2♥️, 7♦️, Q♥️, 3♣️, K♥️, K♣️, 5♠️, 4♥️\\n\\nTest 5: Assertion is true\\nRed pile: 2♣️, 9♠️, 5♦️, 4♥️, K♥️, 5♥️, 8♦️, 2♠️, 3♦️, 10♥️, 10♦️\\nBlack pile: 2♦️, 2♥️, 8♣️, 9♣️, 7♥️, 3♣️, Q♠️, 10♠️, 8♥️, 10♣️, K♣️, 5♠️, 4♦️, 3♥️, 6♥️\\nDiscards: 7♦️, J♥️, 7♣️, 4♠️, 6♦️, 4♣️, 7♠️, Q♥️, J♠️, Q♦️, 6♠️, J♣️, A♥️\\n 9♦️, K♦️, J♦️, 3♠️, 5♣️, Q♣️, A♣️, K♠️, 8♠️, 9♥️, A♠️, 6♣️, A♦️\\\"\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \";==========================================================\\n; create cards\\ncards := [], suits := [\\\"♠\\\",\\\"♥\\\",\\\"♦\\\",\\\"♣\\\"], num := 0\\nfor i, v in StrSplit(\\\"A,2,3,4,5,6,7,8,9,10,J,Q,K\\\",\\\",\\\")\\n\\tfor i, suit in suits\\n\\t\\tcards[++num] := v suit\\n;==========================================================\\n; create gui\\nw := 40\\nGui, font, S10\\nGui, font, S10 CRed\\nGui, add, text, w100 , Face Up Red\\nloop, 26\\n\\tGui, add, button, % \\\"x+0 w\\\" w \\\" vFR\\\" A_Index\\nGui, add, text, xs w100 , Face Down\\nloop, 26\\n\\tGui, add, button, % \\\"x+0 w\\\" w \\\" vHR\\\" A_Index\\nGui, font, S10 CBlack\\nGui, add, text, xs w100 , Face Up Black\\nloop, 26\\n\\tGui, add, button, % \\\"x+0 w\\\" w \\\" vFB\\\" A_Index\\nGui, add, text, xs w100 , Face Down\\nloop, 26\\n\\tGui, add, button, % \\\"x+0 w\\\" w \\\" vHB\\\" A_Index\\nGui, add, button, xs gShuffle , Shuffle\\nGui, add, button, x+1 Disabled vDeal gDeal , Deal\\nGui, add, button, x+1 Disabled vMove gMove, Move\\nGui, add, button, x+1 Disabled vShowAll gShowAll , Show All\\nGui, add, button, x+1 Disabled vPeak gPeak, Peak\\nGui, add, StatusBar\\nGui, show\\nSB_SetParts(200,200)\\nSB_SetText(\\\"0 Face Down Red Cards\\\", 1)\\nSB_SetText(\\\"0 Face Down Black Cards\\\", 2)\\nreturn\\n;==========================================================\\nShuffle:\\nlist := \\\"\\\", shuffled := []\\nLoop, 52\\n\\tlist .= A_Index \\\",\\\"\\nlist := Trim(list, \\\",\\\")\\nSort, list, Random D,\\nloop, parse, list, `,\\n\\tshuffled[A_Index] := cards[A_LoopField]\\nloop, 26{\\n\\tGuiControl,, % \\\"FR\\\" A_Index\\n\\tGuiControl,, % \\\"FB\\\" A_Index\\n\\tGuiControl,, % \\\"HR\\\" A_Index\\n\\tGuiControl,, % \\\"HB\\\" A_Index\\n}\\nGuiControl, Enable, Deal\\nGuiControl, Disable, Move\\nGuiControl, Disable, ShowAll\\nGuiControl, Enable, Peak\\nreturn\\n;==========================================================\\npeak:\\nlist := \\\"\\\"\\nfor i, v in shuffled\\n\\tlist .= i \\\": \\\" v (mod(i,2)?\\\"`t\\\":\\\"`n\\\")\\nToolTip , % list, 1000, 0\\nreturn\\n;==========================================================\\nDeal:\\nColor := \\\"\\\",\\nGuiControl, Disable, Deal\\nFaceRed:= [], FaceBlack := [], HiddenRed := [], HiddenBlack := [], toggle := 0\\nfor i, card in shuffled\\n\\tif toggle:=!toggle\\t{\\n\\t\\tif InStr(card, \\\"♥\\\") || InStr(card, \\\"♦\\\") {\\n\\t\\t\\tColor := \\\"Red\\\"\\n\\t\\t\\tfaceRed.push(card)\\n\\t\\t\\tGuiControl,, % \\\"FR\\\" faceRed.Count(), % card\\n\\t\\t}\\n\\t\\telse if InStr(card, \\\"♠\\\") || InStr(card, \\\"♣\\\") {\\n\\t\\t\\tColor := \\\"Black\\\"\\n\\t\\t\\tfaceBlack.push(card)\\n\\t\\t\\tGuiControl,, % \\\"FB\\\" faceBlack.Count(), % card\\n\\t\\t}\\n\\t}\\n\\telse{\\n\\t\\tHidden%Color%.push(card)\\n\\t\\tGuiControl,, % (color=\\\"red\\\"?\\\"HR\\\":\\\"HB\\\") Hidden%Color%.Count(), % \\\"?\\\"\\n\\t\\tSleep, 50\\n\\t}\\nGuiControl, Enable, Move\\nGuiControl, Enable, ShowAll\\nreturn\\n;==========================================================\\nMove:\\ntempR := [], tempB := []\\nRandom, rndcount, 1, % HiddenRed.Count() < HiddenBlack.Count() ? HiddenRed.Count() : HiddenBlack.Count()\\nloop, % rndcount{\\n\\tRandom, rnd, 1, % HiddenRed.Count()\\n\\tRandom, rnd, 1, % HiddenBlack.Count()\\n\\ttempR.push(HiddenRed.RemoveAt(rnd))\\n\\ttempB.push(HiddenBlack.RemoveAt(rnd))\\n}\\nlist := \\\"\\\"\\nfor i, v in tempR\\n\\tlist .= v \\\"`t\\\" tempB[i] \\\"`n\\\"\\nMsgBox % \\\"swapping \\\" rndcount \\\" cards between face down Red and face down Black`n\\\" (ShowAll?\\\"Red`tBlack`n\\\" list:\\\"\\\")\\nfor i, v in tempR\\n\\tHiddenBlack.Push(v)\\nfor i, v in tempB\\n\\tHiddenRed.push(v)\\nif ShowAll\\n\\tgosub, ShowAll\\nreturn\\n;==========================================================\\nShowAll:\\nShowAll := true, countR := countB := 0\\nloop, 26{\\n\\tGuiControl,, % \\\"HR\\\" A_Index\\n\\tGuiControl,, % \\\"HB\\\" A_Index\\n}\\nfor i, card in HiddenRed\\n\\tGuiControl,, % \\\"HR\\\" i, % (card~= \\\"[♥♦]\\\"?\\\"[\\\":\\\"\\\") card (card~= \\\"[♥♦]\\\"?\\\"]\\\":\\\"\\\")\\n\\t, countR := (card~= \\\"[♥♦]\\\") ? countR+1 : countR\\nfor i, card in HiddenBlack\\n\\tGuiControl,, % \\\"HB\\\" i, % (card~= \\\"[♠♣]\\\"?\\\"[\\\":\\\"\\\") card (card~= \\\"[♠♣]\\\"?\\\"]\\\":\\\"\\\")\\n\\t, countB := (card~= \\\"[♠♣]\\\") ? countB+1 : countB\\nSB_SetText(countR \\\" Face Down Red Cards\\\", 1)\\nSB_SetText(countB \\\" Face Down Black Cards\\\", 2)\\nreturn\\n;==========================================================\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <stdint.h>\\n\\n#define SIM_N 5 /* Run 5 simulations */\\n#define PRINT_DISCARDED 1 /* Whether or not to print the discard pile */\\n\\n#define min(x,y) ((x<y)?(x):(y))\\n\\ntypedef uint8_t card_t;\\n\\n/* Return a random number from an uniform distribution (0..n-1) */\\nunsigned int rand_n(unsigned int n) {\\n unsigned int out, mask = 1;\\n /* Find how many bits to mask off */\\n while (mask < n) mask = mask<<1 | 1;\\n /* Generate random number */\\n do {\\n out = rand() & mask;\\n } while (out >= n);\\n return out;\\n}\\n\\n/* Return a random card (0..51) from an uniform distribution */\\ncard_t rand_card() {\\n return rand_n(52);\\n}\\n\\n/* Print a card */\\nvoid print_card(card_t card) {\\n static char *suits = \\\"HCDS\\\"; /* hearts, clubs, diamonds and spades */\\n static char *cards[] = {\\\"A\\\",\\\"2\\\",\\\"3\\\",\\\"4\\\",\\\"5\\\",\\\"6\\\",\\\"7\\\",\\\"8\\\",\\\"9\\\",\\\"10\\\",\\\"J\\\",\\\"Q\\\",\\\"K\\\"};\\n printf(\\\" %s%c\\\", cards[card>>2], suits[card&3]);\\n}\\n\\n/* Shuffle a pack */\\nvoid shuffle(card_t *pack) {\\n int card;\\n card_t temp, randpos;\\n for (card=0; card<52; card++) {\\n randpos = rand_card();\\n temp = pack[card];\\n pack[card] = pack[randpos];\\n pack[randpos] = temp;\\n }\\n}\\n\\n/* Do the card trick, return whether cards match */\\nint trick() {\\n card_t pack[52];\\n card_t blacks[52/4], reds[52/4];\\n card_t top, x, card;\\n int blackn=0, redn=0, blacksw=0, redsw=0, result;\\n\\n /* Create and shuffle a pack */\\n for (card=0; card<52; card++) pack[card] = card;\\n shuffle(pack);\\n\\n /* Deal cards */\\n#if PRINT_DISCARDED\\n printf(\\\"Discarded:\\\"); /* Print the discard pile */\\n#endif\\n for (card=0; card<52; card += 2) {\\n top = pack[card]; /* Take card */\\n if (top & 1) { /* Add next card to black or red pile */\\n blacks[blackn++] = pack[card+1];\\n } else {\\n reds[redn++] = pack[card+1];\\n }\\n#if PRINT_DISCARDED\\n print_card(top); /* Show which card is discarded */\\n#endif\\n }\\n#if PRINT_DISCARDED\\n printf(\\\"\\\\n\\\");\\n#endif\\n\\n /* Swap an amount of cards */\\n x = rand_n(min(blackn, redn));\\n for (card=0; card<x; card++) {\\n /* Pick a random card from the black and red pile to swap */\\n blacksw = rand_n(blackn);\\n redsw = rand_n(redn);\\n /* Swap them */\\n top = blacks[blacksw];\\n blacks[blacksw] = reds[redsw];\\n reds[redsw] = top;\\n }\\n\\n /* Verify the assertion */\\n result = 0;\\n for (card=0; card<blackn; card++)\\n result += (blacks[card] & 1) == 1;\\n for (card=0; card<redn; card++)\\n result -= (reds[card] & 1) == 0;\\n result = !result;\\n\\n printf(\\\"The number of black cards in the 'black' pile\\\"\\n \\\" %s the number of red cards in the 'red' pile.\\\\n\\\",\\n result? \\\"equals\\\" : \\\"does not equal\\\");\\n return result;\\n}\\n\\nint main() {\\n unsigned int seed, i, successes = 0;\\n FILE *r;\\n\\n /* Seed the RNG with bytes from from /dev/urandom */\\n if ((r = fopen(\\\"/dev/urandom\\\", \\\"r\\\")) == NULL) {\\n fprintf(stderr, \\\"cannot open /dev/urandom\\\\n\\\");\\n return 255;\\n }\\n if (fread(&seed, sizeof(unsigned int), 1, r) != 1) {\\n fprintf(stderr, \\\"failed to read from /dev/urandom\\\\n\\\");\\n return 255;\\n }\\n fclose(r);\\n srand(seed);\\n\\n /* Do simulations. */\\n for (i=1; i<=SIM_N; i++) {\\n printf(\\\"Simulation %d\\\\n\\\", i);\\n successes += trick();\\n printf(\\\"\\\\n\\\");\\n }\\n\\n printf(\\\"Result: %d successes out of %d simulations\\\\n\\\",\\n successes, SIM_N);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <cstdint>\\n#include <iomanip>\\n#include <iostream>\\n#include <numeric>\\n#include <random>\\n#include <vector>\\n\\ntemplate <typename T>\\nvoid print_vector(const std::vector<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\\nint main() {\\n\\tstd::vector<char> cards;\\n\\tfor ( int32_t i = 0; i < 26; ++i ) {\\n\\t\\tcards.emplace_back('R');\\n\\t\\tcards.emplace_back('B');\\n\\t}\\n\\n\\tstd::random_device rand;\\n\\tstd::mt19937 mersenne_twister(rand());\\n\\tstd::shuffle(cards.begin(), cards.end(), mersenne_twister);\\n\\n\\tstd::vector<char> red_pile;\\n\\tstd::vector<char> black_pile;\\n\\tstd::vector<char> discard_pile;\\n\\n\\tfor ( int32_t i = 0; i < 52; i += 2 ) {\\n\\t\\tif ( cards[i] == 'R' ) {\\n\\t\\t\\tred_pile.emplace_back(cards[i + 1]);\\n\\t\\t} else {\\n\\t\\t\\tblack_pile.emplace_back(cards[i + 1]);\\n\\t\\t}\\n\\t\\tdiscard_pile.emplace_back(cards[i]);\\n\\t}\\n\\n\\tstd::cout << \\\"A sample run.\\\" << \\\"\\\\n\\\" << std::endl;\\n\\tstd::cout << \\\"After dealing the cards the state of the piles is:\\\" << std::endl;\\n\\tstd::cout << \\\" Red : \\\" << std::setw(2) << red_pile.size() << \\\" cards -> \\\"; print_vector<char>(red_pile);\\n\\tstd::cout << \\\" Black : \\\" << std::setw(2) << black_pile.size() << \\\" cards -> \\\"; print_vector<char>(black_pile);\\n\\tstd::cout << \\\" Discard: \\\" << std::setw(2) << discard_pile.size()\\n << \\\" cards -> \\\"; print_vector<char>(discard_pile);\\n\\n\\tconst int32_t minimum_size = std::min(red_pile.size(), black_pile.size());\\n\\tstd::uniform_int_distribution<int> uniform_random{ 1, minimum_size };\\n\\tconst int32_t choice = uniform_random(mersenne_twister);\\n\\n\\tstd::vector<int32_t> red_indexes(red_pile.size());\\n\\tstd::iota(red_indexes.begin(), red_indexes.end(), 0);\\n\\tstd::vector<int32_t> black_indexes(black_pile.size());\\n\\tstd::iota(black_indexes.begin(), black_indexes.end(), 0);\\n\\n\\tstd::shuffle(red_indexes.begin(), red_indexes.end(), mersenne_twister);\\n\\tstd::shuffle(black_indexes.begin(), black_indexes.end(), mersenne_twister);\\n\\n\\tstd::vector<int32_t> red_chosen_indexes(red_indexes.begin(), red_indexes.begin() + choice);\\n\\tstd::vector<int32_t> black_chosen_indexes(black_indexes.begin(), black_indexes.begin() + choice);\\n\\n\\tstd::cout << \\\"\\\\n\\\" << \\\"Number of cards are to be swapped: \\\" << choice << std::endl;\\n\\tstd::cout << \\\"The respective zero-based indices of the cards to be swapped are:\\\" << std::endl;\\n\\tstd::cout << \\\" Red : \\\"; print_vector<int32_t>(red_chosen_indexes);\\n\\tstd::cout << \\\" Black: \\\"; print_vector<int32_t>(black_chosen_indexes);\\n\\n\\tfor ( int32_t i = 0; i < choice; ++i ) {\\n\\t\\tconst char temp = red_pile[red_chosen_indexes[i]];\\n\\t\\tred_pile[red_chosen_indexes[i]] = black_pile[black_chosen_indexes[i]];\\n\\t\\tblack_pile[black_chosen_indexes[i]] = temp;\\n\\t}\\n\\n\\tstd::cout << \\\"\\\\n\\\" << \\\"After swapping cards the state of the red and black piles is:\\\" << std::endl;\\n\\tstd::cout << \\\" Red : \\\"; print_vector<char>(red_pile);\\n\\tstd::cout << \\\" Black: \\\"; print_vector<char>(black_pile);\\n\\n\\tint32_t red_count = 0;\\n\\tfor ( const char& ch : red_pile ) {\\n\\t\\tif ( ch == 'R' ) {\\n\\t\\t\\tred_count++;\\n\\t\\t}\\n\\t}\\n\\n\\tint32_t black_count = 0;\\n\\tfor ( const char& ch : black_pile ) {\\n\\t\\tif ( ch == 'B' ) {\\n\\t\\t\\tblack_count++;\\n\\t\\t}\\n\\t}\\n\\n\\tstd::cout << \\\"\\\\n\\\" << \\\"The number of red cards in the red pile: \\\" << red_count << std::endl;\\n\\tstd::cout << \\\"The number of black cards in the black pile: \\\" << black_count << std::endl;\\n\\tif ( red_count == black_count ) {\\n\\t\\tstd::cout << \\\"So the assertion is correct.\\\" << std::endl;\\n\\t} else {\\n\\t\\tstd::cout << \\\"So the assertion is incorrect.\\\" << std::endl;\\n\\t}\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\npublic class MindBogglingCardTrick\\n{\\n public static void Main(string[] args)\\n {\\n List<char> cards = new List<char>();\\n cards.AddRange(Enumerable.Repeat('R', 26));\\n cards.AddRange(Enumerable.Repeat('B', 26));\\n Shuffle(cards);\\n\\n List<char> redPile = new List<char>();\\n List<char> blackPile = new List<char>();\\n List<char> discardPile = new List<char>();\\n\\n for (int i = 0; i < 52; i += 2)\\n {\\n if (cards[i] == 'R')\\n {\\n redPile.Add(cards[i + 1]);\\n }\\n else\\n {\\n blackPile.Add(cards[i + 1]);\\n }\\n discardPile.Add(cards[i]);\\n }\\n\\n Console.WriteLine(\\\"A sample run.\\\\n\\\");\\n Console.WriteLine(\\\"After dealing the cards the state of the piles is:\\\");\\n Console.WriteLine($\\\" Red : {redPile.Count} cards -> {string.Join(\\\",\\\", redPile)}\\\");\\n Console.WriteLine($\\\" Black : {blackPile.Count} cards -> {string.Join(\\\",\\\", blackPile)}\\\");\\n Console.WriteLine($\\\" Discard: {discardPile.Count} cards -> {string.Join(\\\",\\\", discardPile)}\\\");\\n\\n Random random = new Random();\\n int minimumSize = Math.Min(redPile.Count, blackPile.Count);\\n int choice = random.Next(1, minimumSize + 1);\\n\\n List<int> redIndexes = Enumerable.Range(0, redPile.Count).ToList();\\n List<int> blackIndexes = Enumerable.Range(0, blackPile.Count).ToList();\\n Shuffle(redIndexes);\\n Shuffle(blackIndexes);\\n List<int> redChosenIndexes = redIndexes.Take(choice).ToList();\\n List<int> blackChosenIndexes = blackIndexes.Take(choice).ToList();\\n\\n Console.WriteLine($\\\"\\\\nNumber of cards are to be swapped: {choice}\\\");\\n Console.WriteLine(\\\"The respective zero-based indices of the cards to be swapped are:\\\");\\n Console.WriteLine($\\\" Red : {string.Join(\\\", \\\", redChosenIndexes)}\\\");\\n Console.WriteLine($\\\" Black: {string.Join(\\\", \\\", blackChosenIndexes)}\\\");\\n\\n for (int i = 0; i < choice; i++)\\n {\\n char temp = redPile[redChosenIndexes[i]];\\n redPile[redChosenIndexes[i]] = blackPile[blackChosenIndexes[i]];\\n blackPile[blackChosenIndexes[i]] = temp;\\n }\\n\\n Console.WriteLine($\\\"\\\\nAfter swapping cards the state of the red and black piles is:\\\");\\n Console.WriteLine($\\\" Red : {string.Join(\\\", \\\", redPile)}\\\");\\n Console.WriteLine($\\\" Black: {string.Join(\\\", \\\", blackPile)}\\\");\\n\\n int redCount = redPile.Count(ch => ch == 'R');\\n int blackCount = blackPile.Count(ch => ch == 'B');\\n\\n Console.WriteLine($\\\"\\\\nThe number of red cards in the red pile: {redCount}\\\");\\n Console.WriteLine($\\\"The number of black cards in the black pile: {blackCount}\\\");\\n if (redCount == blackCount)\\n {\\n Console.WriteLine(\\\"So the assertion is correct.\\\");\\n }\\n else\\n {\\n Console.WriteLine(\\\"So the assertion is incorrect.\\\");\\n }\\n }\\n\\n private static void Shuffle<T>(List<T> list)\\n {\\n Random rng = new Random();\\n int n = list.Count;\\n while (n > 1)\\n {\\n n--;\\n int k = rng.Next(n + 1);\\n T value = list[k];\\n list[k] = list[n];\\n list[n] = value;\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"deck = ([:black, :red] * 26 ).shuffle\\nblack_pile, red_pile, discard = [] of Symbol, [] of Symbol, [] of Symbol\\n\\nuntil deck.empty?\\n discard << deck.pop\\n discard.last == :black ? black_pile << deck.pop : red_pile << deck.pop\\nend\\n\\nx = rand( [black_pile.size, red_pile.size].min )\\n\\nred_bunch = (0...x).map { red_pile.delete_at( rand( red_pile.size )) }\\nblack_bunch = (0...x).map { black_pile.delete_at( rand( black_pile.size )) }\\n\\nblack_pile += red_bunch\\nred_pile += black_bunch\\n\\nputs \\\"The magician predicts there will be #{black_pile.count( :black )} red cards in the other pile.\\nDrumroll...\\nThere were #{red_pile.count( :red )}!\\\"\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"proc shuffle . a[] .\\n for i = len a[] downto 2\\n r = randint i\\n swap a[r] a[i]\\n .\\n.\\nfunc$ a2str a[] .\\n for v in a[]\\n r$ &= strchar v & \\\" \\\"\\n .\\n return r$\\n.\\nR = strcode \\\"R\\\"\\nB = strcode \\\"B\\\"\\nfor i to 26\\n pack[] &= R\\n pack[] &= B\\n.\\nshuffle pack[]\\n#\\nfor i = 1 step 2 to 51\\n if pack[i] = B\\n black[] &= pack[i + 1]\\n else\\n red[] &= pack[i + 1]\\n .\\n discard[] &= pack[i]\\n.\\nprint \\\"After dealing the cards the state of the stacks is:\\\"\\nprint \\\" Red : \\\" & a2str red[]\\nprint \\\" Black : \\\" & a2str black[]\\nprint \\\" Discard: \\\" & a2str discard[]\\nfor i to len red[]\\n rp[] &= i\\n.\\nfor i to len black[]\\n bp[] &= i\\n.\\nshuffle rp[]\\nshuffle bp[]\\nn = randint lower len red[] len black[]\\nlen rp[] n\\nlen bp[] n\\n#\\nfor i to n\\n h = red[rp[i]]\\n red[rp[i]] = black[bp[i]]\\n black[bp[i]] = h\\n.\\nprint \\\"\\\"\\nprint \\\"After swapping \\\" & n & \\\" cards the state of the stacks is:\\\"\\nprint \\\" Red : \\\" & a2str red[]\\nprint \\\" Black : \\\" & a2str black[]\\n#\\nfor c in red[]\\n red += if c = R\\n.\\nfor c in black[]\\n black += if c = B\\n.\\nprint \\\"\\\"\\nprint \\\"The number of red cards in the red stack = \\\" & red\\nprint \\\"The number of black cards in the black stack = \\\" & black\\nif red = black\\n print \\\"So the asssertion is correct!\\\"\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"//Be boggled? Nigel Galloway: September 19th., 2018\\nlet N=System.Random()\\nlet fN=List.unfold(function |(0,0)->None |(n,g)->let ng=N.Next (n+g) in Some (if ng>=n then (\\\"Black\\\",(n,g-1)) else (\\\"Red\\\",(n-1,g))))(26,26)\\nlet fG n=let (n,n')::(g,g')::_=List.countBy(fun (n::g::_)->if n=g then n else g) n in sprintf \\\"%d %s cards and %d %s cards\\\" n' n g' g\\nprintf \\\"A well shuffled deck -> \\\"; List.iter (printf \\\"%s \\\") fN; printfn \\\"\\\"\\nfN |> List.chunkBySize 2 |> List.groupBy List.head |> List.iter(fun(n,n')->printfn \\\"The %s pile contains %s\\\" n (fG n'))\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: accessors combinators.extras formatting fry\\ngeneralizations io kernel math math.ranges random sequences\\nsequences.extras ;\\nIN: rosetta-code.mind-boggling-card-trick\\n\\nSYMBOLS: R B ;\\n\\nTUPLE: piles deck red black discard ;\\n\\n: initialize-deck ( -- seq )\\n [ R ] [ B ] [ '[ 26 _ V{ } replicate-as ] call ] bi@ append\\n randomize ;\\n\\n: <piles> ( -- piles )\\n initialize-deck [ V{ } clone ] thrice piles boa ;\\n\\n: deal-step ( piles -- piles' )\\n dup [ deck>> pop dup ] [ discard>> push ] [ deck>> pop ] tri\\n B = [ over black>> ] [ over red>> ] if push ;\\n\\n: deal ( piles -- piles' ) 26 [ deal-step ] times ;\\n\\n: choose-sample-size ( piles -- n )\\n [ red>> ] [ black>> ] bi shorter length [0,b] random ;\\n\\n! Partition a sequence into n random samples in one sequence and\\n! the leftovers in another.\\n: sample-partition ( vec n -- leftovers sample )\\n [ 3 dupn ] dip sample dup\\n [ [ swap remove-first! drop ] with each ] dip ;\\n\\n: perform-swaps ( piles -- piles' )\\n dup dup choose-sample-size dup \\\"Swapping %d\\\\n\\\" printf\\n [ [ red>> ] dip ] [ [ black>> ] dip ] 2bi\\n [ sample-partition ] 2bi@ [ append ] dip rot append\\n [ >>black ] dip >>red ;\\n\\n: test-assertion ( piles -- )\\n [ red>> ] [ black>> ] bi\\n [ [ R = ] count ] [ [ B = ] count ] bi* 2dup =\\n [ \\\"Assertion correct!\\\" ]\\n [ \\\"Assertion incorrect!\\\" ] if print\\n \\\"R in red: %d\\\\nB in black: %d\\\\n\\\" printf ;\\n\\n: main ( -- )\\n <piles> ! step 1\\n deal ! step 2\\n dup \\\"Post-deal state:\\\\n%u\\\\n\\\" printf\\n perform-swaps ! step 3\\n dup \\\"Post-swap state:\\\\n%u\\\\n\\\" printf\\n test-assertion ; ! step 4\\n\\nMAIN: main\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Randomize Timer\\nDim Shared As String Deck(52), BlackPile(52), RedPile(52), DiscardPile(52)\\nDim Shared As Integer BlP, ReP, DiP\\n\\nSub Show\\n Dim As Integer i\\n Print \\\"Black pile: \\\";\\n For i = 0 To BlP-1\\n Print BlackPile(i);\\n Next i\\n Print !\\\"\\\\nRed pile: \\\";\\n For i = 0 To ReP-1\\n Print RedPile(i);\\n Next i\\n Print !\\\"\\\\nDiscard pile: \\\";\\n For i = 0 To DiP-1\\n Print DiscardPile(i);\\n Next i\\n Print\\nEnd Sub\\n\\nDim As String BlackBunch(52), RedBunch(52)\\nDim As Integer i, j, m, x, y, BB, RB, BC, RC\\nDim As Integer ub = Ubound(Deck)\\n\\nFor i = 0 To (ub/2)-1\\n Deck(i) = \\\"r\\\"\\n Deck(i+26) = \\\"b\\\"\\nNext i\\nFor i = 0 To ub-1\\n y = Int(Rnd * 51) + 1\\n Swap Deck(y), Deck(i)\\nNext i\\nBlP = 0\\nReP = 0\\nDiP = 0\\nFor i = 0 To ub-1\\n If Deck(i) = \\\"b\\\" Then\\n BlackPile(BlP) = Deck(i+1)\\n BlP += 1\\n Else\\n RedPile(ReP) = Deck(i+1)\\n ReP += 1\\n End If\\n DiscardPile(DiP) = Deck(i)\\n DiP += 1\\n i += 1\\nNext i\\n\\nShow\\nm = BlP\\nIf ReP < m Then m = ReP\\nx = Int(Rnd * m) + 1\\nPrint \\\"Swap \\\"; x; \\\" cards between the red and black piles.\\\"\\nRB = 0\\nBB = 0\\nFor i = 0 To x-1\\n Do\\n y = Int(Rnd * ReP)\\n Loop Until RedPile(y) <> \\\"0\\\"\\n RedBunch(RB) = RedPile(y)\\n RB += 1\\n RedPile(y) = \\\"0\\\"\\nNext i\\nFor i = 0 To x-1\\n Do\\n y = Int(Rnd * BlP)\\n Loop Until BlackPile(y) <> \\\"0\\\"\\n BlackBunch(BB) = BlackPile(y)\\n BB += 1\\n BlackPile(y) = \\\"0\\\"\\nNext i\\nRB = 0\\nFor i = 0 To x-1\\n j = 0\\n While BlackPile(j) <> \\\"0\\\"\\n j += 1\\n Wend\\n BlackPile(j) = RedBunch(RB)\\n RB += 1\\nNext i\\nBB = 0\\nFor i = 0 To x-1\\n j = 0\\n While RedPile(j) <> \\\"0\\\"\\n j += 1\\n Wend\\n RedPile(j) = BlackBunch(BB)\\n BB += 1\\nNext i\\n\\nShow\\nBC = 0\\nFor i = 0 To BlP-1\\n If BlackPile(i) = \\\"b\\\" Then BC += 1\\nNext i\\nRC = 0\\nFor i = 0 To ReP-1\\n If RedPile(i) = \\\"r\\\" Then RC += 1\\nNext i\\nPrint \\\"The number of black cards in the black pile is \\\"; BC\\nPrint \\\"The number of red cards in the red pile is \\\"; RC\\nPrint Using \\\"The mathematician's assertion is &correct.\\\"; Iif(BC <>RC, \\\"not \\\", \\\"\\\")\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/rand\\\"\\n \\\"time\\\"\\n)\\n\\nfunc main() {\\n // Create pack, half red, half black and shuffle it.\\n var pack [52]byte\\n for i := 0; i < 26; i++ {\\n pack[i] = 'R'\\n pack[26+i] = 'B'\\n }\\n rand.Seed(time.Now().UnixNano())\\n rand.Shuffle(52, func(i, j int) {\\n pack[i], pack[j] = pack[j], pack[i]\\n })\\n\\n // Deal from pack into 3 stacks.\\n var red, black, discard []byte\\n for i := 0; i < 51; i += 2 {\\n switch pack[i] {\\n case 'B':\\n black = append(black, pack[i+1])\\n case 'R':\\n red = append(red, pack[i+1])\\n }\\n discard = append(discard, pack[i])\\n }\\n lr, lb, ld := len(red), len(black), len(discard)\\n fmt.Println(\\\"After dealing the cards the state of the stacks is:\\\")\\n fmt.Printf(\\\" Red : %2d cards -> %c\\\\n\\\", lr, red)\\n fmt.Printf(\\\" Black : %2d cards -> %c\\\\n\\\", lb, black)\\n fmt.Printf(\\\" Discard: %2d cards -> %c\\\\n\\\", ld, discard)\\n\\n // Swap the same, random, number of cards between the red and black stacks.\\n min := lr\\n if lb < min {\\n min = lb\\n }\\n n := 1 + rand.Intn(min)\\n rp := rand.Perm(lr)[:n]\\n bp := rand.Perm(lb)[:n]\\n fmt.Printf(\\\"\\\\n%d card(s) are to be swapped.\\\\n\\\\n\\\", n)\\n fmt.Println(\\\"The respective zero-based indices of the cards(s) to be swapped are:\\\")\\n fmt.Printf(\\\" Red : %2d\\\\n\\\", rp)\\n fmt.Printf(\\\" Black : %2d\\\\n\\\", bp)\\n for i := 0; i < n; i++ {\\n red[rp[i]], black[bp[i]] = black[bp[i]], red[rp[i]]\\n }\\n fmt.Println(\\\"\\\\nAfter swapping, the state of the red and black stacks is:\\\")\\n fmt.Printf(\\\" Red : %c\\\\n\\\", red)\\n fmt.Printf(\\\" Black : %c\\\\n\\\", black)\\n\\n // Check that the number of black cards in the black stack equals\\n // the number of red cards in the red stack.\\n rcount, bcount := 0, 0\\n for _, c := range red {\\n if c == 'R' {\\n rcount++\\n }\\n }\\n for _, c := range black {\\n if c == 'B' {\\n bcount++\\n }\\n }\\n\\n fmt.Println(\\\"\\\\nThe number of red cards in the red stack =\\\", rcount)\\n fmt.Println(\\\"The number of black cards in the black stack =\\\", bcount)\\n if rcount == bcount {\\n fmt.Println(\\\"So the asssertion is correct!\\\")\\n } else {\\n fmt.Println(\\\"So the asssertion is incorrect!\\\")\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import System.Random (randomRIO)\\nimport Data.List (partition)\\nimport Data.Monoid ((<>))\\n\\nmain :: IO [Int]\\nmain = do\\n\\n -- DEALT\\n ns <- knuthShuffle [1 .. 52]\\n let (rs_, bs_, discards) = threeStacks (rb <$> ns)\\n\\n -- SWAPPED\\n nSwap <- randomRIO (1, min (length rs_) (length bs_))\\n let (rs, bs) = exchange nSwap rs_ bs_\\n\\n -- CHECKED\\n let rrs = filter ('R' ==) rs\\n let bbs = filter ('B' ==) bs\\n putStrLn $\\n unlines\\n [ \\\"Discarded: \\\" <> discards\\n , \\\"Swapped: \\\" <> show nSwap\\n , \\\"Red pile: \\\" <> rs\\n , \\\"Black pile: \\\" <> bs\\n , rrs <> \\\" = Red cards in the red pile\\\"\\n , bbs <> \\\" = Black cards in the black pile\\\"\\n , show $ length rrs == length bbs\\n ]\\n return ns\\n\\n-- RED vs BLACK ----------------------------------------\\nrb :: Int -> Char\\nrb n\\n | even n = 'R'\\n | otherwise = 'B'\\n\\n-- THREE STACKS ----------------------------------------\\nthreeStacks :: String -> (String, String, String)\\nthreeStacks = go ([], [], [])\\n where\\n go tpl [] = tpl\\n go (rs, bs, ds) [x] = (rs, bs, x : ds)\\n go (rs, bs, ds) (x:y:xs)\\n | 'R' == x = go (y : rs, bs, x : ds) xs\\n | otherwise = go (rs, y : bs, x : ds) xs\\n\\nexchange :: Int -> [a] -> [a] -> ([a], [a])\\nexchange n xs ys =\\n let [xs_, ys_] = splitAt n <$> [xs, ys]\\n in (fst ys_ <> snd xs_, fst xs_ <> snd ys_)\\n\\n-- SHUFFLE -----------------------------------------------\\n-- (See Knuth Shuffle task)\\nknuthShuffle :: [a] -> IO [a]\\nknuthShuffle xs = (foldr swapElems xs . zip [1 ..]) <$> randoms (length xs)\\n\\nrandoms :: Int -> IO [Int]\\nrandoms x = traverse (randomRIO . (,) 0) [1 .. (pred x)]\\n\\nswapElems :: (Int, Int) -> [a] -> [a]\\nswapElems (i, j) xs\\n | i == j = xs\\n | otherwise = replaceAt j (xs !! i) $ replaceAt i (xs !! j) xs\\n\\nreplaceAt :: Int -> a -> [a] -> [a]\\nreplaceAt i c l =\\n let (a, b) = splitAt i l\\n in a ++ c : drop 1 b\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" NB. A failed assertion looks like this\\n assert 0\\n|assertion failure: assert\\n| assert 0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"shuffle =: {~ ?~@:#\\nf =: (,&.> {:)~\\ng =: ({.@],(f {:))`((f {.),{:@])@.({.@[)\\n\\ntrick =: 3 :0\\n DECK =: shuffle 2 | i. 52\\n 'B R' =: shuffle L:_1 > g&.>/(_2 <\\\\ DECK) , < 2 # a:\\n NB. although I swap the first N cards of each pile,\\n NB. the piles were shuffled following placement\\n N =: ? R <.&# B\\n echo 'prior to swap of ',(\\\":N),' cards'\\n echo 'black pile ',B{'rB'\\n echo 'red pile ',R{'rB'\\n BR =: N {. B\\n RB =: N {. R\\n B =: RB , N }. B\\n R =: BR , N }. R\\n echo 'after swap'\\n echo 'black pile ',B{'rB'\\n echo 'red pile ',R{'rB'\\n B (-:&(+/) -.) R\\n)\\n\\n\\n assert trick''\\nprior to swap of 10 cards\\nblack pile rBrrrrrBBrrrBrr\\nred pile BBrBrBBrBBr\\nafter swap\\nblack pile BBrBrBBrBBrrBrr\\nred pile rBrrrrrBBrr\\n\\n assert trick''\\nprior to swap of 6 cards\\nblack pile rBBBBrBBr\\nred pile rrBBBBrBrBBBBrrBB\\nafter swap\\nblack pile rrBBBBBBr\\nred pile rBBBBrrBrBBBBrrBB\\n\\n assert trick''\\nprior to swap of 3 cards\\nblack pile rBrBrrrBBrr\\nred pile BrrBrBBrBBBBBBB\\nafter swap\\nblack pile BrrBrrrBBrr\\nred pile rBrBrBBrBBBBBBB\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.Collections;\\nimport java.util.List;\\nimport java.util.concurrent.ThreadLocalRandom;\\nimport java.util.stream.Collectors;\\nimport java.util.stream.IntStream;\\n\\npublic final class MindBogglingCardTrick {\\n\\n\\tpublic static void main(String[] aArgs) {\\t\\t\\n\\t\\tList<Character> cards = new ArrayList<Character>(52);\\n\\t\\tcards.addAll(Collections.nCopies(26, 'R'));\\n\\t\\tcards.addAll(Collections.nCopies(26, 'B'));\\n\\t\\tCollections.shuffle(cards);\\n\\t\\t\\n\\t\\tList<Character> redPile = new ArrayList<Character>();\\n\\t\\tList<Character> blackPile = new ArrayList<Character>();\\n\\t\\tList<Character> discardPile = new ArrayList<Character>();\\t\\n\\t\\n\\t\\tfor ( int i = 0; i < 52; i += 2 ) {\\n\\t\\t\\tif ( cards.get(i) == 'R' ) {\\n\\t\\t\\t\\tredPile.add(cards.get(i + 1));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tblackPile.add(cards.get(i + 1));\\n\\t\\t\\t}\\t\\n\\t discardPile.add(cards.get(i));\\n\\t }\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"A sample run.\\\" + System.lineSeparator());\\n\\t\\tSystem.out.println(\\\"After dealing the cards the state of the piles is:\\\");\\n\\t\\tSystem.out.println(String.format(\\\" Red : %2d cards -> %s\\\", redPile.size(), redPile));\\n\\t\\tSystem.out.println(String.format(\\\" Black : %2d cards -> %s\\\", blackPile.size(), blackPile));\\n\\t\\tSystem.out.println(String.format(\\\" Discard: %2d cards -> %s\\\", discardPile.size(), discardPile));\\n\\t\\t\\n\\t\\tThreadLocalRandom random = ThreadLocalRandom.current();\\n\\t final int minimumSize = Math.min(redPile.size(), blackPile.size());\\n\\t final int choice = random.nextInt(1, minimumSize + 1);\\n\\t\\n\\t List<Integer> redIndexes = IntStream.range(0, redPile.size()).boxed().collect(Collectors.toList());\\n\\t List<Integer> blackIndexes = IntStream.range(0, blackPile.size()).boxed().collect(Collectors.toList());\\n\\t Collections.shuffle(redIndexes);\\n\\t Collections.shuffle(blackIndexes);\\n\\t List<Integer> redChosenIndexes = redIndexes.subList(0, choice);\\n\\t List<Integer> blackChosenIndexes = blackIndexes.subList(0, choice);\\n\\n\\t System.out.println(System.lineSeparator() + \\\"Number of cards are to be swapped: \\\" + choice);\\n\\t System.out.println(\\\"The respective zero-based indices of the cards to be swapped are:\\\");\\n\\t System.out.println(\\\" Red : \\\" + redChosenIndexes);\\n\\t System.out.println(\\\" Black: \\\" + blackChosenIndexes);\\n\\t\\t\\n\\t for ( int i = 0; i < choice; i++ ) {\\n\\t final char temp = redPile.get(redChosenIndexes.get(i));\\n\\t redPile.set(redChosenIndexes.get(i), blackPile.get(blackChosenIndexes.get(i)));\\n\\t blackPile.set(blackChosenIndexes.get(i), temp);\\n\\t }\\n\\t\\n\\t System.out.println(System.lineSeparator() + \\\"After swapping cards the state of the red and black piles is:\\\");\\n\\t System.out.println(\\\" Red : \\\" + redPile);\\n\\t System.out.println(\\\" Black: \\\" + blackPile);\\n\\t\\n\\t int redCount = 0;\\n\\t for ( char ch : redPile ) {\\n\\t \\tif ( ch == 'R' ) {\\n\\t \\t\\tredCount += 1;\\n\\t \\t}\\n\\t }\\n\\t\\n\\t int blackCount = 0;\\n\\t for ( char ch : blackPile ) {\\n\\t \\tif ( ch == 'B' ) {\\n\\t \\t\\tblackCount += 1;\\n\\t \\t}\\n\\t }\\n\\t\\n\\t System.out.println(System.lineSeparator() + \\\"The number of red cards in the red pile: \\\" + redCount);\\n\\t System.out.println(\\\"The number of black cards in the black pile: \\\" + blackCount);\\n\\t if ( redCount == blackCount ) {\\n\\t \\tSystem.out.println(\\\"So the assertion is correct.\\\");\\n\\t } else {\\n\\t \\tSystem.out.println(\\\"So the assertion is incorrect.\\\");\\n\\t }\\t\\t\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"(() => {\\n 'use strict';\\n\\n const main = () => {\\n const\\n // DEALT\\n [rs_, bs_, discards] = threeStacks(\\n map(n =>\\n even(n) ? (\\n 'R'\\n ) : 'B', knuthShuffle(\\n enumFromTo(1, 52)\\n )\\n )\\n ),\\n\\n // SWAPPED\\n nSwap = randomRInt(1, min(rs_.length, bs_.length)),\\n [rs, bs] = exchange(nSwap, rs_, bs_),\\n\\n // CHECKED\\n rrs = filter(c => 'R' === c, rs).join(''),\\n bbs = filter(c => 'B' === c, bs).join('');\\n return unlines([\\n 'Discarded: ' + discards.join(''),\\n 'Swapped: ' + nSwap,\\n 'Red pile: ' + rs.join(''),\\n 'Black pile: ' + bs.join(''),\\n rrs + ' = Red cards in the red pile',\\n bbs + ' = Black cards in the black pile',\\n (rrs.length === bbs.length).toString()\\n ]);\\n };\\n\\n // THREE STACKS ---------------------------------------\\n\\n // threeStacks :: [Chars] -> ([Chars], [Chars], [Chars])\\n const threeStacks = cards => {\\n const go = ([rs, bs, ds]) => xs => {\\n const lng = xs.length;\\n return 0 < lng ? (\\n 1 < lng ? (() => {\\n const [x, y] = take(2, xs),\\n ds_ = cons(x, ds);\\n return (\\n 'R' === x ? (\\n go([cons(y, rs), bs, ds_])\\n ) : go([rs, cons(y, bs), ds_])\\n )(drop(2, xs));\\n })() : [rs, bs, ds_]\\n ) : [rs, bs, ds];\\n };\\n return go([\\n [],\\n [],\\n []\\n ])(cards);\\n };\\n\\n // exchange :: Int -> [a] -> [a] -> ([a], [a])\\n const exchange = (n, xs, ys) => {\\n const [xs_, ys_] = map(splitAt(n), [xs, ys]);\\n return [\\n fst(ys_).concat(snd(xs_)),\\n fst(xs_).concat(snd(ys_))\\n ];\\n };\\n\\n // SHUFFLE --------------------------------------------\\n\\n // knuthShuffle :: [a] -> [a]\\n const knuthShuffle = xs =>\\n enumFromTo(0, xs.length - 1)\\n .reduceRight((a, i) => {\\n const iRand = randomRInt(0, i);\\n return i !== iRand ? (\\n swapped(i, iRand, a)\\n ) : a;\\n }, xs);\\n\\n // swapped :: Int -> Int -> [a] -> [a]\\n const swapped = (iFrom, iTo, xs) =>\\n xs.map(\\n (x, i) => iFrom !== i ? (\\n iTo !== i ? (\\n x\\n ) : xs[iFrom]\\n ) : xs[iTo]\\n );\\n\\n // GENERIC FUNCTIONS ----------------------------------\\n\\n // cons :: a -> [a] -> [a]\\n const cons = (x, xs) =>\\n Array.isArray(xs) ? (\\n [x].concat(xs)\\n ) : (x + xs);\\n\\n // drop :: Int -> [a] -> [a]\\n // drop :: Int -> String -> String\\n const drop = (n, xs) => xs.slice(n);\\n\\n // enumFromTo :: Int -> Int -> [Int]\\n const enumFromTo = (m, n) =>\\n m <= n ? iterateUntil(\\n x => n <= x,\\n x => 1 + x,\\n m\\n ) : [];\\n\\n // even :: Int -> Bool\\n const even = n => 0 === n % 2;\\n\\n // filter :: (a -> Bool) -> [a] -> [a]\\n const filter = (f, xs) => xs.filter(f);\\n\\n // fst :: (a, b) -> a\\n const fst = tpl => tpl[0];\\n\\n // iterateUntil :: (a -> Bool) -> (a -> a) -> a -> [a]\\n const iterateUntil = (p, f, x) => {\\n const vs = [x];\\n let h = x;\\n while (!p(h))(h = f(h), vs.push(h));\\n return vs;\\n };\\n\\n // map :: (a -> b) -> [a] -> [b]\\n const map = (f, xs) => xs.map(f);\\n\\n // min :: Ord a => a -> a -> a\\n const min = (a, b) => b < a ? b : a;\\n\\n // randomRInt :: Int -> Int -> Int\\n const randomRInt = (low, high) =>\\n low + Math.floor(\\n (Math.random() * ((high - low) + 1))\\n );\\n\\n // snd :: (a, b) -> b\\n const snd = tpl => tpl[1];\\n\\n // splitAt :: Int -> [a] -> ([a],[a])\\n const splitAt = n => xs => Tuple(xs.slice(0, n), xs.slice(n));\\n\\n // take :: Int -> [a] -> [a]\\n const take = (n, xs) => xs.slice(0, n);\\n\\n // Tuple (,) :: a -> b -> (a, b)\\n const Tuple = (a, b) => ({\\n type: 'Tuple',\\n '0': a,\\n '1': b,\\n length: 2\\n });\\n\\n // unlines :: [String] -> String\\n const unlines = xs => xs.join('\\\\n');\\n\\n // MAIN ---\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"using Random\\n\\nconst rbdeck = split(repeat('R', 26) * repeat('B', 26), \\\"\\\")\\nshuffledeck() = shuffle(rbdeck)\\n\\nfunction deal!(deck, dpile, bpile, rpile)\\n while !isempty(deck)\\n if (topcard = pop!(deck)) == \\\"R\\\"\\n push!(rpile, pop!(deck))\\n else\\n push!(bpile, pop!(deck))\\n end\\n push!(dpile, topcard)\\n end\\nend\\n\\nfunction swap!(rpile, bpile, nswapping)\\n rpick = sort(randperm(length(rpile))[1:nswapping])\\n bpick = sort(randperm(length(bpile))[1:nswapping])\\n rrm = rpile[rpick]; brm = bpile[bpick]\\n deleteat!(rpile, rpick); deleteat!(bpile, bpick)\\n append!(rpile, brm); append!(bpile, rrm)\\nend\\n\\nfunction mindbogglingcardtrick(verbose=true)\\n prif(cond, txt) = (if(cond) println(txt) end)\\n deck = shuffledeck()\\n prif(verbose, \\\"Shuffled deck is: $deck\\\")\\n\\n dpile, rpile, bpile = [], [], []\\n deal!(deck, dpile, bpile, rpile)\\n\\n prif(verbose, \\\"Before swap:\\\")\\n prif(verbose, \\\"Discard pile: $dpile\\\")\\n prif(verbose, \\\"Red card pile: $rpile\\\")\\n prif(verbose, \\\"Black card pile: $bpile\\\")\\n\\n amount = rand(1:min(length(rpile), length(bpile)))\\n prif(verbose, \\\"Swapping a random number of cards: $amount will be swapped.\\\")\\n swap!(rpile, bpile, amount)\\n\\n prif(verbose, \\\"Red pile after swaps: $rpile\\\")\\n prif(verbose, \\\"Black pile after swaps: $bpile\\\")\\n println(\\\"There are $(sum(map(x->x==\\\"B\\\", bpile))) black cards in the black card pile:\\\")\\n println(\\\"there are $(sum(map(x->x==\\\"R\\\", rpile))) red cards in the red card pile.\\\")\\n prif(verbose, \\\"\\\")\\nend\\n\\nmindbogglingcardtrick()\\n\\nfor _ in 1:10\\n mindbogglingcardtrick(false)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// Version 1.2.61\\n\\nimport java.util.Random\\n\\nfun main(args: Array<String>) {\\n // Create pack, half red, half black and shuffle it.\\n val pack = MutableList(52) { if (it < 26) 'R' else 'B' }\\n pack.shuffle()\\n\\n // Deal from pack into 3 stacks.\\n val red = mutableListOf<Char>()\\n val black = mutableListOf<Char>()\\n val discard = mutableListOf<Char>()\\n for (i in 0 until 52 step 2) {\\n when (pack[i]) {\\n 'B' -> black.add(pack[i + 1])\\n 'R' -> red.add(pack[i + 1])\\n }\\n discard.add(pack[i])\\n }\\n val sr = red.size\\n val sb = black.size\\n val sd = discard.size\\n println(\\\"After dealing the cards the state of the stacks is:\\\")\\n System.out.printf(\\\" Red : %2d cards -> %s\\\\n\\\", sr, red)\\n System.out.printf(\\\" Black : %2d cards -> %s\\\\n\\\", sb, black)\\n System.out.printf(\\\" Discard: %2d cards -> %s\\\\n\\\", sd, discard)\\n\\n // Swap the same, random, number of cards between the red and black stacks.\\n val rand = Random()\\n val min = minOf(sr, sb)\\n val n = 1 + rand.nextInt(min)\\n var rp = MutableList(sr) { it }.shuffled().subList(0, n)\\n var bp = MutableList(sb) { it }.shuffled().subList(0, n)\\n println(\\\"\\\\n$n card(s) are to be swapped\\\\n\\\")\\n println(\\\"The respective zero-based indices of the cards(s) to be swapped are:\\\")\\n println(\\\" Red : $rp\\\")\\n println(\\\" Black : $bp\\\")\\n for (i in 0 until n) {\\n val temp = red[rp[i]]\\n red[rp[i]] = black[bp[i]]\\n black[bp[i]] = temp\\n }\\n println(\\\"\\\\nAfter swapping, the state of the red and black stacks is:\\\")\\n println(\\\" Red : $red\\\")\\n println(\\\" Black : $black\\\")\\n\\n // Check that the number of black cards in the black stack equals\\n // the number of red cards in the red stack.\\n var rcount = 0\\n var bcount = 0\\n for (c in red) if (c == 'R') rcount++\\n for (c in black) if (c == 'B') bcount++\\n println(\\\"\\\\nThe number of red cards in the red stack = $rcount\\\")\\n println(\\\"The number of black cards in the black stack = $bcount\\\")\\n if (rcount == bcount) {\\n println(\\\"So the asssertion is correct!\\\")\\n }\\n else {\\n println(\\\"So the asssertion is incorrect!\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"-- support:\\nfunction T(t) return setmetatable(t, {__index=table}) end\\ntable.range = function(t,n) local s=T{} for i=1,n do s[i]=i end return s end\\ntable.map = function(t,f) local s=T{} for i=1,#t do s[i]=f(t[i]) end return s end\\ntable.filter = function(t,f) local s=T{} for i=1,#t do if f(t[i]) then s[#s+1]=t[i] end end return s end\\ntable.clone = function(t) local s=T{} for k,v in ipairs(t) do s[k]=v end return s end\\ntable.head = function(t,n) local s=T{} n=n>#t and #t or n for i = 1,n do s[i]=t[i] end return s end\\ntable.tail = function(t,n) local s=T{} n=n>#t and #t or n for i = 1,n do s[i]=t[#t-n+i] end return s end\\ntable.append = function(t,v) local s=t:clone() for i=1,#v do s[#s+1]=v[i] end return s end\\ntable.shuffle = function(t) for i=#t,2,-1 do local j=math.random(i) t[i],t[j]=t[j],t[i] end return t end -- inplace!\\n\\n-- task:\\nfunction cardtrick()\\n -- 1.\\n local deck = T{}:range(52):map(function(v) return v%2==0 and \\\"B\\\" or \\\"R\\\" end):shuffle()\\n print(\\\"1. DECK : \\\" .. deck:concat())\\n -- 2. (which guarantees the outcome)\\n local bpile, rpile, discs = T{}, T{}, T{}\\n local xpile = {B=bpile, R=rpile}\\n while #deck>0 do\\n local card, next = deck:remove(), deck:remove()\\n xpile[card]:insert(next)\\n discs:insert(card)\\n end\\n print(\\\"2. BLACK PILE: \\\" .. bpile:concat())\\n print(\\\"2. RED PILE : \\\" .. rpile:concat())\\n print(\\\"2. DISCARDS : \\\" .. discs:concat())\\n -- 3. (which cannot change the outcome)\\n local x = math.random(0, math.min(#bpile, #rpile))\\n local btake, rtake = T{}, T{}\\n for i = 1, x do\\n btake:insert((bpile:remove(math.random(#bpile))))\\n rtake:insert((rpile:remove(math.random(#rpile))))\\n end\\n print(\\\"3. SWAPPING X: \\\" .. x)\\n print(\\\"3. BLACK SWAP: keep:\\\" .. bpile:concat() .. \\\" take:\\\" .. btake:concat())\\n print(\\\"3. RED SWAP : keep:\\\" .. rpile:concat() .. \\\" take:\\\" .. rtake:concat())\\n bpile, rpile = bpile:append(rtake), rpile:append(btake)\\n print(\\\"3. BLACK PILE: \\\" .. bpile:concat())\\n print(\\\"3. RED PILE : \\\" .. rpile:concat())\\n -- 4. (\\\"proving\\\" that which was guaranteed earlier)\\n local binb, rinr = bpile:filter(function(v) return v==\\\"B\\\" end), rpile:filter(function(v) return v==\\\"R\\\" end)\\n print(\\\"4. BLACK PILE: contains \\\" .. #binb .. \\\" B's\\\")\\n print(\\\"4. RED PILE : contains \\\" .. #rinr .. \\\" R's\\\")\\n print(#binb==#rinr and \\\"VERIFIED\\\" or \\\"NOT VERIFIED\\\")\\n print()\\nend\\n\\n-- demo:\\nmath.randomseed(os.time())\\nfor i = 1,3 do cardtrick() end\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"s = RandomSample@Flatten[{Table[0, 26], Table[1, 26]}]\\ng = Take[s, {1, -1, 2}]\\nd = Take[s, {2, -1, 2}]\\na = b = {};\\nTable[If[g[[i]] == 1, AppendTo[a, d[[i]]], AppendTo[b, d[[i]]]], {i,\\n Length@g}];\\na\\nb\\ndice = RandomInteger[{1, 6}]\\nra = Sort@RandomSample[Range@Length@a, dice]\\na = {Delete[a, List /@ ra], a[[ra]]}\\nrb = Sort@RandomSample[Range@Length@b, dice]\\nb = {Delete[b, List /@ rb], b[[rb]]}\\nfinala = Join[a[[1]], b[[2]]]\\nfinalb = Join[b[[1]], a[[2]]]\\nCount[finala, 1] == Count[finalb, 0]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import random, sequtils, strformat, strutils\\n\\ntype Color {.pure.} = enum Red = \\\"R\\\", Black = \\\"B\\\"\\n\\nproc `$`(s: seq[Color]): string = s.join(\\\" \\\")\\n\\n# Create pack, half red, half black and shuffle it.\\nvar pack = newSeq[Color](52)\\nfor i in 0..51: pack[i] = Color(i < 26)\\npack.shuffle()\\n\\n# Deal from pack into 3 stacks.\\nvar red, black, others: seq[Color]\\nfor i in countup(0, 51, 2):\\n case pack[i]\\n of Red: red.add pack[i + 1]\\n of Black: black.add pack[i + 1]\\n others.add pack[i]\\necho \\\"After dealing the cards the state of the stacks is:\\\"\\necho &\\\" Red: {red.len:>2} cards -> {red}\\\"\\necho &\\\" Black: {black.len:>2} cards -> {black}\\\"\\necho &\\\" Discard: {others.len:>2} cards -> {others}\\\"\\n\\n# Swap the same, random, number of cards between the red and black stacks.\\nlet m = min(red.len, black.len)\\nlet n = rand(1..m)\\nvar rp = toSeq(0..red.high)\\nrp.shuffle()\\nrp.setLen(n)\\nvar bp = toSeq(0..black.high)\\nbp.shuffle()\\nbp.setLen(n)\\necho &\\\"\\\\n{n} card(s) are to be swapped.\\\\n\\\"\\necho \\\"The respective zero-based indices of the cards(s) to be swapped are:\\\"\\necho \\\" Red : \\\", rp.join(\\\" \\\")\\necho \\\" Black : \\\", bp.join(\\\" \\\")\\nfor i in 0..<n:\\n swap red[rp[i]], black[bp[i]]\\necho \\\"\\\\nAfter swapping, the state of the red and black stacks is:\\\"\\necho \\\" Red : \\\", red\\necho \\\" Black : \\\", black\\n\\n# Check that the number of black cards in the black stack equals\\n# the number of red cards in the red stack.\\nlet rcount = red.count(Red)\\nlet bcount = black.count(Black)\\necho \\\"\\\"\\necho \\\"The number of red cards in the red stack is \\\", rcount\\necho \\\"The number of black cards in the black stack is \\\", bcount\\nif rcount == bcount:\\n echo \\\"So the asssertion is correct.\\\"\\nelse:\\n echo \\\"So the asssertion is incorrect.\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"sub trick {\\n my(@deck) = @_;\\n my $result .= sprintf \\\"%-28s @deck\\\\n\\\", 'Starting deck:';\\n\\n my(@discard, @red, @black);\\n deal(\\\\@deck, \\\\@discard, \\\\@red, \\\\@black);\\n\\n $result .= sprintf \\\"%-28s @red\\\\n\\\", 'Red pile:';\\n $result .= sprintf \\\"%-28s @black\\\\n\\\", 'Black pile:';\\n\\n my $n = int rand(+@red < +@black ? +@red : +@black);\\n swap(\\\\@red, \\\\@black, $n);\\n\\n $result .= sprintf \\\"Red pile after %2d swapped: @red\\\\n\\\", $n;\\n $result .= sprintf \\\"Black pile after %2d swapped: @black\\\\n\\\", $n;\\n\\n $result .= sprintf \\\"Red in Red, Black in Black: %d = %d\\\\n\\\", (scalar grep {/R/} @red), scalar grep {/B/} @black;\\n return \\\"$result\\\\n\\\";\\n}\\n\\nsub deal {\\n my($c, $d, $r, $b) = @_;\\n while (@$c) {\\n my $top = shift @$c;\\n if ($top eq 'R') { push @$r, shift @$c }\\n else { push @$b, shift @$c }\\n push @$d, $top;\\n }\\n}\\n\\nsub swap {\\n my($r, $b, $n) = @_;\\n push @$r, splice @$b, 0, $n;\\n push @$b, splice @$r, 0, $n;\\n}\\n\\n@deck = split '', 'RB' x 26; # alternating red and black\\nprint trick(@deck);\\n@deck = split '', 'RRBB' x 13; # alternating pairs of reds and blacks\\nprint trick(@deck);\\n@deck = sort @deck; # all blacks precede reds\\nprint trick(@deck);\\n@deck = sort { -1 + 2*int(rand 2) } @deck; # poor man's shuffle\\nprint trick(@deck);\\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;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">52</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">pack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shuffle</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">'r'</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: #7060A8;\\\">repeat</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><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">))</span>\\n\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">black</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">red</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">discard</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;\\\">pack</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;\\\">top</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pack</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">next</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pack</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;\\\">top</span><span style=\\\"color: #0000FF;\\\">==</span><span style=\\\"color: #008000;\\\">'b'</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">black</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">next</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">red</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">next</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">discard</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">top</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">black</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shuffle</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">black</span><span style=\\\"color: #0000FF;\\\">);</span> <span style=\\\"color: #000000;\\\">red</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shuffle</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">red</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (optional)\\n --printf(1,\\\"Discards : %s\\\\n\\\",{discard})</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;\\\">\\\"Reds : %s\\\\nBlacks : %s\\\\n\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">red</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">black</span><span style=\\\"color: #0000FF;\\\">})</span>\\n\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">lb</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">black</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000000;\\\">lr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">red</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">ns</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lb</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">lr</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;\\\">\\\"Swap %d cards:\\\\n\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ns</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">b1ns</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">black</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">ns</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">r1ns</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">red</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">ns</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">black</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">ns</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r1ns</span>\\n <span style=\\\"color: #000000;\\\">red</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">ns</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">b1ns</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;\\\">\\\"Reds : %s\\\\nBlacks : %s\\\\n\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">red</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">black</span><span style=\\\"color: #0000FF;\\\">})</span>\\n\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">nb</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_eq</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">black</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">'b'</span><span style=\\\"color: #0000FF;\\\">)),</span>\\n <span style=\\\"color: #000000;\\\">nr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_eq</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">red</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">'r'</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">correct</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nr</span><span style=\\\"color: #0000FF;\\\">==</span><span style=\\\"color: #000000;\\\">nb</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"correct\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">\\\"**INCORRECT**\\\"</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 r in red, %d b in black - assertion %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">nr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">nb</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">correct</span><span style=\\\"color: #0000FF;\\\">})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"import random\\n\\n## 1. Cards\\nn = 52\\nBlack, Red = 'Black', 'Red'\\nblacks = [Black] * (n // 2)\\nreds = [Red] * (n // 2)\\npack = blacks + reds\\n# Give the pack a good shuffle.\\nrandom.shuffle(pack)\\n\\n## 2. Deal from the randomised pack into three stacks\\nblack_stack, red_stack, discard = [], [], []\\nwhile pack:\\n top = pack.pop()\\n if top == Black:\\n black_stack.append(pack.pop())\\n else:\\n red_stack.append(pack.pop())\\n discard.append(top)\\nprint('(Discards:', ' '.join(d[0] for d in discard), ')\\\\n')\\n\\n## 3. Swap the same, random, number of cards between the two stacks.\\n# We can't swap more than the number of cards in a stack.\\nmax_swaps = min(len(black_stack), len(red_stack))\\n# Randomly choose the number of cards to swap.\\nswap_count = random.randint(0, max_swaps)\\nprint('Swapping', swap_count)\\n# Randomly choose that number of cards out of each stack to swap.\\ndef random_partition(stack, count):\\n \\\"Partition the stack into 'count' randomly selected members and the rest\\\"\\n sample = random.sample(stack, count)\\n rest = stack[::]\\n for card in sample:\\n rest.remove(card)\\n return rest, sample\\n\\nblack_stack, black_swap = random_partition(black_stack, swap_count)\\nred_stack, red_swap = random_partition(red_stack, swap_count)\\n\\n# Perform the swap.\\nblack_stack += red_swap\\nred_stack += black_swap\\n\\n## 4. Order from randomness?\\nif black_stack.count(Black) == red_stack.count(Red):\\n print('Yeha! The mathematicians assertion is correct.')\\nelse:\\n print('Whoops - The mathematicians (or my card manipulations) are flakey')\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ stack ] is discards ( --> s )\\n [ stack ] is red-card ( --> s )\\n [ stack ] is black-card ( --> s )\\n\\n [ dup take rot join swap put ] is to-pile ( n s --> )\\n\\n [ $ \\\"\\\" discards put\\n $ \\\"\\\" red-card put\\n $ \\\"\\\" black-card put\\n char R 26 of\\n char B 26 of join shuffle\\n 26 times\\n [ behead tuck discards to-pile\\n behead rot char R =\\n iff red-card else black-card\\n to-pile ]\\n drop\\n discards take witheach\\n [ emit sp ] cr\\n red-card take shuffle\\n black-card take shuffle\\n over size over size min random\\n say \\\"Swapping \\\" dup echo\\n say \\\" cards.\\\" cr\\n dup dip [ split rot ] split\\n dip join rot join\\n 0 swap witheach\\n [ char R = + ]\\n 0 rot witheach\\n [ char B = + ]\\n say \\\"The assertion is \\\"\\n = iff [ say \\\"true.\\\" ]\\n else [ say \\\"false.\\\" ] cr cr ] is task ( --> )\\n\\n 5 times task\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"magictrick<-function(){\\n deck=c(rep(\\\"B\\\",26),rep(\\\"R\\\",26))\\n deck=sample(deck,52)\\n blackpile=character(0)\\n redpile=character(0)\\n discardpile=character(0)\\n while(length(deck)>0){\\n if(deck[1]==\\\"B\\\"){\\n blackpile=c(blackpile,deck[2])\\n deck=deck[-2]\\n }else{\\n redpile=c(redpile,deck[2])\\n deck=deck[-2]\\n }\\n discardpile=c(discardpile,deck[1])\\n deck=deck[-1]\\n }\\n cat(\\\"After the deal the state of the piles is:\\\",\\\"\\\\n\\\",\\n \\\"Black pile:\\\",blackpile,\\\"\\\\n\\\",\\\"Red pile:\\\",redpile,\\\"\\\\n\\\",\\n \\\"Discard pile:\\\",discardpile,\\\"\\\\n\\\",\\\"\\\\n\\\")\\n X=sample(1:min(length(redpile),length(blackpile)),1)\\n if(X==1){s=\\\" is\\\"}else{s=\\\"s are\\\"}\\n cat(X,\\\" card\\\",s,\\\" being swapped.\\\",\\\"\\\\n\\\",\\\"\\\\n\\\",sep=\\\"\\\")\\n redindex=sample(1:length(redpile),X)\\n blackindex=sample(1:length(blackpile),X)\\n redbunch=redpile[redindex]\\n redpile=redpile[-redindex]\\n blackbunch=blackpile[blackindex]\\n blackpile=blackpile[-blackindex]\\n redpile=c(redpile,blackbunch)\\n blackpile=c(blackpile,redbunch)\\n cat(\\\"After the swap the state of the piles is:\\\",\\\"\\\\n\\\",\\n \\\"Black pile:\\\",blackpile,\\\"\\\\n\\\",\\\"Red pile:\\\",redpile,\\\"\\\\n\\\",\\\"\\\\n\\\")\\n cat(\\\"There are \\\", length(which(blackpile==\\\"B\\\")), \\\" black cards in the black pile.\\\",\\\"\\\\n\\\",\\n \\\"There are \\\", length(which(redpile==\\\"R\\\")), \\\" red cards in the red pile.\\\",\\\"\\\\n\\\",sep=\\\"\\\")\\n if(length(which(blackpile==\\\"B\\\"))==length(which(redpile==\\\"R\\\"))){\\n cat(\\\"The assertion is true!\\\")\\n }\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"# Generate a shuffled deck\\nmy @deck = shuffle;\\nput 'Shuffled deck: ', @deck;\\n\\nmy (@discard, @red, @black);\\n# Deal cards following task description\\ndeal(@deck, @discard, @red, @black);\\n\\nput 'Discard pile: ', @discard;\\nput '\\\"Red\\\" pile: ', @red;\\nput '\\\"Black\\\" pile: ', @black;\\n\\n# swap the same random number of random\\n# cards between the red and black piles\\nmy $amount = ^(+@red min +@black) .roll;\\nput 'Number of cards to swap: ', $amount;\\nswap(@red, @black, $amount);\\n\\nput 'Red pile after swaps: ', @red;\\nput 'Black pile after swaps: ', @black;\\n\\nsay 'Number of Red cards in the Red pile: ', +@red.grep('R');\\nsay 'Number of Black cards in the Black pile: ', +@black.grep('B');\\n\\nsub shuffle { (flat 'R' xx 26, 'B' xx 26).pick: * }\\n\\nsub deal (@deck, @d, @r, @b) {\\n while @deck.elems {\\n my $top = @deck.shift;\\n if $top eq 'R' {\\n @r.push: @deck.shift;\\n }\\n else {\\n @b.push: @deck.shift;\\n }\\n @d.push: $top;\\n }\\n}\\n\\nsub swap (@r, @b, $a) {\\n my @ri = ^@r .pick($a);\\n my @bi = ^@b .pick($a);\\n my @rs = @r[@ri];\\n my @bs = @b[@bi];\\n @r[@ri] = @bs;\\n @b[@bi] = @rs;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm mimics a boggling card trick; separates cards into 3 piles based on color ···*/\\nparse arg trials # shuffs seed . /*obtain optional arguments from the CL*/\\nif trials=='' | trials==\\\",\\\" then trials= 1000 /*Not specified? Then use the default.*/\\nif #=='' | #==\\\",\\\" then #= 52 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif shuffs=='' | shuffs==\\\",\\\" then shuffs= #%4 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif datatype(seed, 'W') then call random ,,seed /*if integer, use this as a RANDOM seed*/\\nok=0 /*the number of \\\"expected\\\" good trials.*/\\n do trials /*perform a number of trials to be safe*/\\n call create /*odd numbers≡RED, even numbers≡BLACK.*/\\n call shuffle /*shuffle the deck a number of times. */\\n call deal /*put cards into three piles of cards. */\\n call swap /*swap rand # of cards in R & B piles*/\\n call count /*count #blacks in B, #reds in R piles*/\\n end /*trials*/ /*#: is the number of cards in the deck*/\\npc= (100*ok/trials)'%' /*calculate the % asserted correctly.*/\\nsay \\\"Correctness of the mathematician's assertion:\\\" pc ' (out of' commas(trials),\\n \\\"trial\\\"s(trials)') using a deck of ' commas(#) ,\\n \\\" card\\\"s(#)', and doing ' commas(shuffs) ' shuffle's(shuffs).\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n?: return random(1, word( arg(1) #, 1) ) /*gen a random number from 1 ──► arg. */\\ncommas: parse arg _; do j=length(_)-3 to 1 by -3; _=insert(',', _, j); end; return _\\ncreate: @.=; k=0; do j=1 by 4 for #; k=k+1; @.k= j; if k//13==0 then j=j+1; end; return\\nisRed: return arg(1) // 2 /*if arg(1) is odd, the card is RED.*/\\ns: if arg(1)==1 then return arg(3); return word( arg(2) 's', 1) /*pluralizer.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncount: Rn=0; Bn=0; do j=1 for words(R); Rn=Rn+ isRed(word(R,j)) ; end\\n do k=1 for words(B); Bn=Bn+ (\\\\isRed(word(B,k))); end\\n if Rn==Bn then ok= ok+1; return /*Was it a good trial? Bump OK counter*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ndeal: R=; B=; D=; do j=1 for #%2 by 2 /*deal all the cards. */\\n next= j+1; card= @.next /*obtain the next card. */\\n if isRed(@.j) then R=R card /*add to the RED pile?*/\\n else B=B card /* \\\" \\\" \\\" BLACK \\\" */\\n D= D @.j /* \\\" \\\" \\\" discard \\\" */\\n end /*j*/\\n return /*discard pile not used.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nshuffle: do j=1 for shuffs; x=?(); do until y\\\\==x | #==1; y=?(); end /*until*/\\n parse value @.x @.y with @.y @.x; end /*j*/; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nswap: $= min( words(R), words(B) ); Rc=; Bc= /*ensure we can swap $ cards.*/\\n if $==0 then return /*A pile has no cards? return*/\\n do ?($) /*$: is the number of swaps.*/\\n R?= ?( words(R) ) /*a random card in RED pile.*/\\n B?= ?( words(B) ) /*\\\" \\\" \\\" \\\" BLACK \\\" */\\n /* \\\"reds\\\" to be swapped.*/ Rc= Rc word(R, R?); R= delword(R, R?, 1) /*del card*/\\n /*\\\"blacks\\\" \\\" \\\" \\\" */ Bc= Bc word(B, B?); B= delword(B, B?, 1) /* \\\" \\\" */\\n end /*?($)*/\\n R=R Bc; B=B Rc; return /*add swapped cards to piles.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"deck = ([:black, :red] * 26 ).shuffle\\nblack_pile, red_pile, discard = [], [], []\\n\\nuntil deck.empty? do\\n discard << deck.pop\\n discard.last == :black ? black_pile << deck.pop : red_pile << deck.pop\\nend\\n\\nx = rand( [black_pile.size, red_pile.size].min )\\n\\nred_bunch = x.times.map{ red_pile.delete_at( rand( red_pile.size )) }\\nblack_bunch = x.times.map{ black_pile.delete_at( rand( black_pile.size )) }\\n\\nblack_pile += red_bunch\\nred_pile += black_bunch\\n\\nputs \\\"The magician predicts there will be #{black_pile.count( :black )} red cards in the other pile.\\nDrumroll...\\nThere were #{red_pile.count( :red )}!\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"extern crate rand; // 0.5.5\\nuse rand::Rng;\\nuse std::iter::repeat;\\n\\n#[derive(Debug, Eq, PartialEq, Clone)]\\nenum Colour {\\n Black,\\n Red,\\n}\\nuse Colour::*;\\n\\nfn main() {\\n let mut rng = rand::thread_rng();\\n\\n //Create our deck.\\n let mut deck: Vec<_> = repeat(Black).take(26)\\n .chain(repeat(Red).take(26))\\n .collect();\\n\\n rng.shuffle(&mut deck);\\n\\n let mut black_stack = vec![];\\n let mut red_stack = vec![];\\n let mut discarded = vec![];\\n\\n //Deal our cards.\\n print!(\\\"Discarding:\\\");\\n while let (Some(card), Some(next)) = (deck.pop(), deck.pop()) {\\n print!(\\\" {}\\\", if card == Black { \\\"B\\\" } else { \\\"R\\\" });\\n match card {\\n Red => red_stack.push(next),\\n Black => black_stack.push(next),\\n }\\n discarded.push(card);\\n }\\n println!();\\n\\n // Choose how many to swap.\\n let max = red_stack.len().min(black_stack.len());\\n let num = rng.gen_range(1, max);\\n println!(\\\"Exchanging {} cards\\\", num);\\n\\n // Actually swap our cards.\\n for _ in 0..num {\\n let red = rng.choose_mut(&mut red_stack).unwrap();\\n let black = rng.choose_mut(&mut black_stack).unwrap();\\n std::mem::swap(red, black);\\n }\\n\\n //Count how many are red and black.\\n let num_black = black_stack.iter()\\n .filter(|&c| c == &Black)\\n .count();\\n let num_red = red_stack.iter()\\n .filter(|&c| c == &Red)\\n .count();\\n\\n println!(\\\"Number of black cards in black stack: {}\\\", num_black);\\n println!(\\\"Number of red cards in red stack: {}\\\", num_red);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import \\\"random\\\" for Random\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar R = 82 // ASCII 'R'\\nvar B = 66 // ASCII 'B'\\n\\n// Create pack, half red, half black and shuffle it.\\nvar pack = [0] * 52\\nfor (i in 0..25) {\\n pack[i] = R\\n pack[26+i] = B\\n}\\nvar rand = Random.new()\\nrand.shuffle(pack)\\n\\n// Deal from pack into 3 stacks.\\nvar red = []\\nvar black = []\\nvar discard = []\\nvar i = 0\\nwhile (i < 51) {\\n if (pack[i] == B) {\\n black.add(pack[i+1])\\n } else {\\n red.add(pack[i+1])\\n }\\n discard.add(pack[i])\\n i = i + 2\\n}\\nvar lr = red.count\\nvar lb = black.count\\nvar ld = discard.count\\nSystem.print(\\\"After dealing the cards the state of the stacks is:\\\")\\nFmt.print(\\\" Red : $2d cards -> $c\\\", lr, red)\\nFmt.print(\\\" Black : $2d cards -> $c\\\", lb, black)\\nFmt.print(\\\" Discard: $2d cards -> $c\\\", ld, discard)\\n\\n// Swap the same, random, number of cards between the red and black stacks.\\nvar min = (lr < lb) ? lr : lb\\nvar n = rand.int(1, min + 1)\\nvar rp = [0] * lr\\nvar bp = [0] * lb\\nfor (i in 0...lr) rp[i] = i\\nfor (i in 0...lb) bp[i] = i\\nrand.shuffle(rp)\\nrand.shuffle(bp)\\nrp = rp[0...n]\\nbp = bp[0...n]\\nSystem.print(\\\"\\\\n%(n) card(s) are to be swapped.\\\\n\\\")\\nSystem.print(\\\"The respective zero-based indices of the cards(s) to be swapped are:\\\")\\nFmt.print(\\\" Red : $2d\\\", rp)\\nFmt.print(\\\" Black : $2d\\\", bp)\\nfor (i in 0...n) {\\n var t = red[rp[i]]\\n red[rp[i]] = black[bp[i]]\\n black[bp[i]] = t\\n}\\nSystem.print(\\\"\\\\nAfter swapping, the state of the red and black stacks is:\\\")\\nFmt.print(\\\" Red : $c\\\", red)\\nFmt.print(\\\" Black : $c\\\", black)\\n\\n// Check that the number of black cards in the black stack equals\\n// the number of red cards in the red stack.\\nvar rcount = red.count { |c| c == R }\\nvar bcount = black.count { |c| c == B }\\nSystem.print(\\\"\\\\nThe number of red cards in the red stack = %(rcount)\\\")\\nSystem.print(\\\"The number of black cards in the black stack = %(bcount)\\\")\\nif (rcount == bcount) {\\n System.print(\\\"So the asssertion is correct!\\\")\\n} else {\\n System.print(\\\"So the asssertion is incorrect!\\\")\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"include xpllib; \\\\for Print\\n\\nchar Deck(52), BlackPile(52), RedPile(52), DiscardPile(52),\\n BlackBunch(52), RedBunch(52);\\nint I, J, T, M, X, Y, BP, RP, DP, BB, RB, BC, RC;\\n\\nproc Show;\\n[Print(\\\"Black pile: \\\");\\nfor I:= 0 to BP-1 do ChOut(0, BlackPile(I));\\nPrint(\\\"\\\\nRed pile: \\\");\\nfor I:= 0 to RP-1 do ChOut(0, RedPile(I));\\nPrint(\\\"\\\\nDiscard pile: \\\");\\nfor I:= 0 to DP-1 do ChOut(0, DiscardPile(I));\\nPrint(\\\"\\\\n\\\");\\n];\\n\\n[for I:= 0 to 26-1 do\\n [Deck(I):= ^r; Deck(I+26):= ^b];\\nfor I:= 0 to 52-1 do\\n [Y:= Ran(52); \\\\0..51\\n T:= Deck(I); Deck(I):= Deck(Y); Deck(Y):= T;\\n ];\\nBP:= 0; RP:= 0; DP:= 0;\\nfor I:= 0 to 52-1 do\\n [if Deck(I) = ^b then\\n [BlackPile(BP):= Deck(I+1); BP:= BP+1]\\n else\\n [RedPile (RP):= Deck(I+1); RP:= RP+1];\\n DiscardPile(DP):= Deck(I); DP:= DP+1;\\n I:= I+1;\\n ];\\nShow;\\nM:= BP;\\nif RP < M then M:= RP;\\nX:= Ran(M) + 1;\\nPrint(\\\"Swap %d cards between the red and black piles.\\\\n\\\", X);\\nRB:= 0; BB:= 0;\\nfor I:= 0 to X-1 do\\n [repeat Y:= Ran(RP); until RedPile(Y) # 0;\\n RedBunch(RB):= RedPile(Y); RB:= RB+1; RedPile(Y):= 0;\\n ];\\nfor I:= 0 to X-1 do\\n [repeat Y:= Ran(BP); until BlackPile(Y) # 0;\\n BlackBunch(BB):= BlackPile(Y); BB:= BB+1; BlackPile(Y):= 0;\\n ];\\nRB:= 0;\\nfor I:= 0 to X-1 do\\n [J:= 0;\\n while BlackPile(J) # 0 do J:= J+1;\\n BlackPile(J):= RedBunch(RB); RB:= RB+1;\\n ];\\nBB:= 0;\\nfor I:= 0 to X-1 do\\n [J:= 0;\\n while RedPile(J) # 0 do J:= J+1;\\n RedPile(J):= BlackBunch(BB); BB:= BB+1;\\n ];\\nShow;\\nBC:= 0;\\nfor I:= 0 to BP-1 do\\n if BlackPile(I) = ^b then BC:= BC+1;\\nRC:= 0;\\nfor I:= 0 to RP-1 do\\n if RedPile(I) = ^r then RC:= RC+1;\\nPrint(\\\"The number of black cards in the black pile is %d.\\\\n\\\", BC);\\nPrint(\\\"The number of red cards in the red pile is %d.\\\\n\\\", RC);\\nPrint(\\\"The mathematician's assertion is%s correct.\\\\n\\\",\\n if BC#RC then \\\" not\\\" else \\\"\\\");\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"cards:=[1..52].pump(List,\\\"isEven\\\",\\\"toInt\\\").shuffle(); // red==1\\nstacks:=T(List(),List()); // black stack [0], red stack [1]\\nblkStk,redStk := stacks;\\nforeach card in (cards){ stacks[card].append(__cardWalker.next()) }\\nprintln(\\\"Stacks:\\\\n Black stack: \\\",redBlack(blkStk),\\\"\\\\n Red stack: \\\",redBlack(redStk));\\n\\nnumSwaps:=(1).random(1000); // do lots of swaps\\ndo(numSwaps){ blkStk.append(redStk.pop(0)); redStk.append(blkStk.pop(0)); }\\nprintln(\\\"Post %d swaps:\\\\n Black stack: %s\\\\n Red stack: %s\\\"\\n .fmt(numSwaps,redBlack(blkStk),redBlack(redStk)));\\n\\nnumBlack,numRed := blkStk.filter('==(0)).len(), redStk.sum(0);\\nif(numBlack==numRed)\\n println(\\\"Agreed, black stack has same number of black cards\\\\n \\\"\\n \\\"as red stack has number of red cards: \\\",numRed);\\nelse println(\\\"Boo, different stack lenghts\\\");\\n\\nfcn redBlack(cards){ cards.pump(String,fcn(c){ c and \\\"R \\\" or \\\"B \\\" }) }\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Mind-boggling-card-trick"}}},{"rowIdx":491,"cells":{"solutions":{"kind":"list like","value":[{"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 that need to be found.\n\nPositions in the grid are modified by entering their coordinates where the first coordinate is horizontal in the grid and the second vertical. The top left of the grid is position 1,1; the bottom right is at n,m.\n\n* The total number of mines to be found is shown at the beginning of the game.\n* Each mine occupies a single grid point, and its position is initially unknown to the player\n* The grid is shown as a rectangle of characters between moves.\n* You are initially shown all grids as obscured, by a single dot '.'\n* You may mark what you think is the position of a mine which will show as a '?'\n* You can mark what you think is free space by entering its coordinates.\n:* If the point is free space then it is cleared, as are any adjacent points that are also free space- this is repeated recursively for subsequent adjacent free points unless that point is marked as a mine or is a mine.\n::* Points marked as a mine show as a '?'.\n::* Other free points show as an integer count of the number of adjacent true mines in its immediate neighborhood, or as a single space ' ' if the free point is not adjacent to any true mines.\n* Of course you lose if you try to clear space that has a hidden mine.\n* You win when you have correctly identified all mines.\n\nThe Task is to '''create a program that allows you to play minesweeper on a 6 by 4 grid, and that assumes all user input is formatted correctly''' and so checking inputs for correct form may be omitted.\nYou may also omit all GUI parts of the task and work using text input and output.\n\nNote: Changes may be made to the method of clearing mines to more closely follow a particular implementation of the game so long as such differences and the implementation that they more accurately follow are described.\n\n<br>C.F: [[wp:Minesweeper (computer game)]]\n\n","language":"00-TASK"},{"code":"with Ada.Numerics.Discrete_Random;\nwith Ada.Text_IO;\n\nprocedure Minesweeper is\n package IO renames Ada.Text_IO;\n package Nat_IO is new IO.Integer_IO (Natural);\n package Nat_RNG is new Ada.Numerics.Discrete_Random (Natural);\n\n type Stuff is (Empty, Mine);\n type Field is record\n Contents : Stuff := Empty;\n Opened : Boolean := False;\n Marked : Boolean := False;\n end record;\n type Grid is array (Positive range <>, Positive range <>) of Field;\n\n -- counts how many mines are in the surrounding fields\n function Mines_Nearby (Item : Grid; X, Y : Positive) return Natural is\n Result : Natural := 0;\n begin\n -- left of X:Y\n if X > Item'First (1) then\n -- above X-1:Y\n if Y > Item'First (2) then\n if Item (X - 1, Y - 1).Contents = Mine then\n Result := Result + 1;\n end if;\n end if;\n -- X-1:Y\n if Item (X - 1, Y).Contents = Mine then\n Result := Result + 1;\n end if;\n -- below X-1:Y\n if Y < Item'Last (2) then\n if Item (X - 1, Y + 1).Contents = Mine then\n Result := Result + 1;\n end if;\n end if;\n end if;\n -- above of X:Y\n if Y > Item'First (2) then\n if Item (X, Y - 1).Contents = Mine then\n Result := Result + 1;\n end if;\n end if;\n -- below of X:Y\n if Y < Item'Last (2) then\n if Item (X, Y + 1).Contents = Mine then\n Result := Result + 1;\n end if;\n end if;\n -- right of X:Y\n if X < Item'Last (1) then\n -- above X+1:Y\n if Y > Item'First (2) then\n if Item (X + 1, Y - 1).Contents = Mine then\n Result := Result + 1;\n end if;\n end if;\n -- X+1:Y\n if Item (X + 1, Y).Contents = Mine then\n Result := Result + 1;\n end if;\n -- below X+1:Y\n if Y < Item'Last (2) then\n if Item (X + 1, Y + 1).Contents = Mine then\n Result := Result + 1;\n end if;\n end if;\n end if;\n return Result;\n end Mines_Nearby;\n\n -- outputs the grid\n procedure Put (Item : Grid) is\n Mines : Natural := 0;\n begin\n IO.Put (\" \");\n for X in Item'Range (1) loop\n Nat_IO.Put (Item => X, Width => 3);\n end loop;\n IO.New_Line;\n IO.Put (\" +\");\n for X in Item'Range (1) loop\n IO.Put (\"---\");\n end loop;\n IO.Put ('+');\n IO.New_Line;\n for Y in Item'Range (2) loop\n Nat_IO.Put (Item => Y, Width => 3);\n IO.Put ('|');\n for X in Item'Range (1) loop\n if Item (X, Y).Opened then\n if Item (X, Y).Contents = Empty then\n if Item (X, Y).Marked then\n IO.Put (\" - \");\n else\n Mines := Mines_Nearby (Item, X, Y);\n if Mines > 0 then\n Nat_IO.Put (Item => Mines, Width => 2);\n IO.Put (' ');\n else\n IO.Put (\" \");\n end if;\n end if;\n else\n if Item (X, Y).Marked then\n IO.Put (\" + \");\n else\n IO.Put (\" X \");\n end if;\n end if;\n elsif Item (X, Y).Marked then\n IO.Put (\" ? \");\n else\n IO.Put (\" . \");\n end if;\n end loop;\n IO.Put ('|');\n IO.New_Line;\n end loop;\n IO.Put (\" +\");\n for X in Item'Range (1) loop\n IO.Put (\"---\");\n end loop;\n IO.Put ('+');\n IO.New_Line;\n end Put;\n\n -- marks a field as possible bomb\n procedure Mark (Item : in out Grid; X, Y : in Positive) is\n begin\n if Item (X, Y).Opened then\n IO.Put_Line (\"Field already open!\");\n else\n Item (X, Y).Marked := not Item (X, Y).Marked;\n end if;\n end Mark;\n\n -- clears a field and it's neighbours, if they don't have mines\n procedure Clear\n (Item : in out Grid;\n X, Y : in Positive;\n Killed : out Boolean)\n is\n -- clears the neighbours, if they don't have mines\n procedure Clear_Neighbours (The_X, The_Y : Positive) is\n begin\n -- mark current field opened\n Item (The_X, The_Y).Opened := True;\n -- only proceed if neighbours don't have mines\n if Mines_Nearby (Item, The_X, The_Y) = 0 then\n -- left of X:Y\n if The_X > Item'First (1) then\n -- above X-1:Y\n if The_Y > Item'First (2) then\n if not Item (The_X - 1, The_Y - 1).Opened and\n not Item (The_X - 1, The_Y - 1).Marked\n then\n Clear_Neighbours (The_X - 1, The_Y - 1);\n end if;\n end if;\n -- X-1:Y\n if not Item (The_X - 1, The_Y).Opened and\n not Item (The_X - 1, The_Y).Marked\n then\n Clear_Neighbours (The_X - 1, The_Y);\n end if;\n -- below X-1:Y\n if The_Y < Item'Last (2) then\n if not Item (The_X - 1, The_Y + 1).Opened and\n not Item (The_X - 1, The_Y + 1).Marked\n then\n Clear_Neighbours (The_X - 1, The_Y + 1);\n end if;\n end if;\n end if;\n -- above X:Y\n if The_Y > Item'First (2) then\n if not Item (The_X, The_Y - 1).Opened and\n not Item (The_X, The_Y - 1).Marked\n then\n Clear_Neighbours (The_X, The_Y - 1);\n end if;\n end if;\n -- below X:Y\n if The_Y < Item'Last (2) then\n if not Item (The_X, The_Y + 1).Opened and\n not Item (The_X, The_Y + 1).Marked\n then\n Clear_Neighbours (The_X, The_Y + 1);\n end if;\n end if;\n -- right of X:Y\n if The_X < Item'Last (1) then\n -- above X+1:Y\n if The_Y > Item'First (2) then\n if not Item (The_X + 1, The_Y - 1).Opened and\n not Item (The_X + 1, The_Y - 1).Marked\n then\n Clear_Neighbours (The_X + 1, The_Y - 1);\n end if;\n end if;\n -- X+1:Y\n if not Item (The_X + 1, The_Y).Opened and\n not Item (The_X + 1, The_Y).Marked\n then\n Clear_Neighbours (The_X + 1, The_Y);\n end if;\n -- below X+1:Y\n if The_Y < Item'Last (2) then\n if not Item (The_X + 1, The_Y + 1).Opened and\n not Item (The_X + 1, The_Y + 1).Marked\n then\n Clear_Neighbours (The_X + 1, The_Y + 1);\n end if;\n end if;\n end if;\n end if;\n end Clear_Neighbours;\n begin\n Killed := False;\n -- only clear closed and unmarked fields\n if Item (X, Y).Opened then\n IO.Put_Line (\"Field already open!\");\n elsif Item (X, Y).Marked then\n IO.Put_Line (\"Field already marked!\");\n else\n Killed := Item (X, Y).Contents = Mine;\n -- game over if killed, no need to clear\n if not Killed then\n Clear_Neighbours (X, Y);\n end if;\n end if;\n end Clear;\n\n -- marks all fields as open\n procedure Open_All (Item : in out Grid) is\n begin\n for X in Item'Range (1) loop\n for Y in Item'Range (2) loop\n Item (X, Y).Opened := True;\n end loop;\n end loop;\n end Open_All;\n\n -- counts the number of marks\n function Count_Marks (Item : Grid) return Natural is\n Result : Natural := 0;\n begin\n for X in Item'Range (1) loop\n for Y in Item'Range (2) loop\n if Item (X, Y).Marked then\n Result := Result + 1;\n end if;\n end loop;\n end loop;\n return Result;\n end Count_Marks;\n\n -- read and validate user input\n procedure Get_Coordinates\n (Max_X, Max_Y : Positive;\n X, Y : out Positive;\n Valid : out Boolean)\n is\n begin\n Valid := False;\n IO.Put (\"X: \");\n Nat_IO.Get (X);\n IO.Put (\"Y: \");\n Nat_IO.Get (Y);\n Valid := X > 0 and X <= Max_X and Y > 0 and Y <= Max_Y;\n exception\n when Constraint_Error =>\n Valid := False;\n end Get_Coordinates;\n\n -- randomly place bombs\n procedure Set_Bombs (Item : in out Grid; Max_X, Max_Y, Count : Positive) is\n Generator : Nat_RNG.Generator;\n X, Y : Positive;\n begin\n Nat_RNG.Reset (Generator);\n for I in 1 .. Count loop\n Placement : loop\n X := Nat_RNG.Random (Generator) mod Max_X + 1;\n Y := Nat_RNG.Random (Generator) mod Max_Y + 1;\n -- redo placement if X:Y already full\n if Item (X, Y).Contents = Empty then\n Item (X, Y).Contents := Mine;\n exit Placement;\n end if;\n end loop Placement;\n end loop;\n end Set_Bombs;\n\n Width, Height : Positive;\n\nbegin\n -- can be dynamically set\n Width := 6;\n Height := 4;\n declare\n The_Grid : Grid (1 .. Width, 1 .. Height);\n -- 20% bombs\n Bomb_Count : Positive := Width * Height * 20 / 100;\n Finished : Boolean := False;\n Action : Character;\n Chosen_X, Chosen_Y : Positive;\n Valid_Entry : Boolean;\n begin\n IO.Put (\"Nr. Bombs: \");\n Nat_IO.Put (Item => Bomb_Count, Width => 0);\n IO.New_Line;\n Set_Bombs\n (Item => The_Grid,\n Max_X => Width,\n Max_Y => Height,\n Count => Bomb_Count);\n while not Finished and Count_Marks (The_Grid) /= Bomb_Count loop\n Put (The_Grid);\n IO.Put (\"Input (c/m/r): \");\n IO.Get (Action);\n case Action is\n when 'c' | 'C' =>\n Get_Coordinates\n (Max_X => Width,\n Max_Y => Height,\n X => Chosen_X,\n Y => Chosen_Y,\n Valid => Valid_Entry);\n if Valid_Entry then\n Clear\n (Item => The_Grid,\n X => Chosen_X,\n Y => Chosen_Y,\n Killed => Finished);\n if Finished then\n IO.Put_Line (\"You stepped on a mine!\");\n end if;\n else\n IO.Put_Line (\"Invalid input, retry!\");\n end if;\n when 'm' | 'M' =>\n Get_Coordinates\n (Max_X => Width,\n Max_Y => Height,\n X => Chosen_X,\n Y => Chosen_Y,\n Valid => Valid_Entry);\n if Valid_Entry then\n Mark (Item => The_Grid, X => Chosen_X, Y => Chosen_Y);\n else\n IO.Put_Line (\"Invalid input, retry!\");\n end if;\n when 'r' | 'R' =>\n Finished := True;\n when others =>\n IO.Put_Line (\"Invalid input, retry!\");\n end case;\n end loop;\n Open_All (The_Grid);\n IO.Put_Line\n (\"Solution: (+ = correctly marked, - = incorrectly marked)\");\n Put (The_Grid);\n end;\nend Minesweeper;\n","language":"Ada"},{"code":"; Minesweeper.ahk - v1.0.6\n; (c) Dec 28, 2008 by derRaphael\n; Licensed under the Terms of EUPL 1.0\n; Modded by Sobriquet and re-licenced as CeCILL v2\n; Modded (again) by Sobriquet and re-licenced as GPL v1.3\n\n#NoEnv\n#NoTrayIcon\nSetBatchLines,-1\n#SingleInstance,Off\n/*\n[InGameSettings]\n*/\nLevel\t=Beginner\nWidth\t=9\nHeight\t=9\nMineMax\t=10\nMarks\t=1\nColor\t=1\nSound\t=0\nBestTimeBeginner\t=999 seconds\tAnonymous\nBestTimeIntermediate=999 seconds\tAnonymous\nBestTimeExpert\t\t=999 seconds\tAnonymous\n; above settings are accessed as variables AND modified by IniWrite - be careful\nBlockSize\t=16\nTitle\t\t=Minesweeper\nMineCount\t=0\nmColor\t\t=Blue,Green,Red,Purple,Navy,Olive,Maroon,Teal\nGameOver\t=0\nTimePassed\t=0\n\n; Add mines randomly\nWhile (MineCount<MineMax)\t\t\t\t\t\t\t\t\t; loop as long as neccessary\n{\n\tRandom,x,1,%Width%\t\t\t\t\t\t\t\t\t\t; get random horizontal position\n\tRandom,y,1,%Height%\t\t\t\t\t\t\t\t\t\t; get random vertical position\n\tIf (T_x%x%y%y%!=\"M\")\t\t\t\t\t\t\t\t\t; only if not already a mine\n\t\tT_x%x%y%y%:=\"M\"\t\t\t\t\t\t\t\t\t; assign as mine\n\t\t,MineCount++\t\t\t\t\t\t\t\t\t\t; keep count\n}\n\nGui +OwnDialogs\n;Menu,Tray,Icon,C:\\WINDOWS\\system32\\winmine.exe,1\nMenu,GameMenu,Add,&New\tF2,NewGame\nMenu,GameMenu,Add\nMenu,GameMenu,Add,&Beginner,LevelMenu\nMenu,GameMenu,Add,&Intermediate,LevelMenu\nMenu,GameMenu,Add,&Expert,LevelMenu\nMenu,GameMenu,Add,&Custom...,CustomMenu\nMenu,GameMenu,Add\nMenu,GameMenu,Add,&Marks (?),ToggleMenu\nMenu,GameMenu,Add,Co&lor,ToggleMenu\nMenu,GameMenu,Add,&Sound,ToggleMenu\nMenu,GameMenu,Add\nMenu,GameMenu,Add,Best &Times...,BestTimesMenu\nMenu,GameMenu,Add\nMenu,GameMenu,Add,E&xit,GuiClose\nMenu,GameMenu,Check,% \"&\" level . (level=\"Custom\" ? \"...\" : \"\")\nIf (Marks)\n\tMenu,GameMenu,Check,&Marks (?)\nIf (Color)\n\tMenu,GameMenu,Check,Co&lor\nIf (Sound)\n\tMenu,GameMenu,Check,&Sound\n\nMenu,HelpMenu,Add,&Contents\tF1,HelpMenu\nMenu,HelpMenu,Add,&Search for Help on...,HelpMenu\nMenu,HelpMenu,Add,Using &Help,HelpMenu\nMenu,HelpMenu,Add\nMenu,HelpMenu,Add,&About Minesweeper...,AboutMenu\n\nMenu,MainMenu,Add,&Game,:GameMenu\nMenu,MainMenu,Add,&Help,:HelpMenu\nGui,Menu,MainMenu\n\nGui,Font,s22,WingDings\nGui,Add,Button,% \"h31 w31 y13 gNewGame vNewGame x\" Width*BlockSize/2-4,K\t; J=Smiley / K=Line / L=Frowny / m=Circle\nGui,Font,s16 Bold,Arial\nGui,Add,Text,% \"x13 y14 w45 Border Center vMineCount c\" (color ? \"Red\" : \"White\"),% SubStr(\"00\" MineCount,-2)\t; Remaining mine count\nGui,Add,Text,% \"x\" Width*BlockSize-34 \" y14 w45 Border Center vTimer c\" (color ? \"Red\" : \"White\"),000\t\t\t; Timer\n\n; Buttons\nGui,Font,s11,WingDings\nLoop,% Height\t\t\t\t\t\t\t\t\t\t\t\t\t; iterate vertically\n{\n\ty:=A_Index\t\t\t\t\t\t\t\t\t\t\t\t; remember line\n\tLoop,% Width\t\t\t\t\t\t\t\t\t\t\t\t; set covers\n\t{\n\t\tx:=A_Index\n\t\tGui,Add,Button,% \"vB_x\" x \"y\" y\t\" w\" BlockSize \t\t\t; mark variable / width\n\t\t\t\t\t\t. \" h\" BlockSize \" \" (x = 1\t\t\t\t; height / if 1st block\n\t\t\t\t\t\t\t? \"x\" 12 \" y\" y*BlockSize+39\t\t; fix vertical offset\n\t\t\t\t\t\t\t: \"yp x+0\")\t\t\t\t\t\t\t; otherwise stay inline /w prev. box\n\t}\n}\n\n; Show Gui\nGui,Show,% \"w\" ((Width>9 ? Width : 9))*BlockSize+24 \" h\" Height*BlockSize+68,%Title%\nOnMessage(0x53,\"WM_HELP\")\t\t\t\t\t\t\t\t\t\t; invoke Help handling for tooltips\nReturn ;--------------------------------------------------------; End of auto-execute section\n#IfWinActive Minesweeper ahk_class AutoHotkeyGUI \t\t\t\t; variable %title% not supported\n\nStartGame(x,y) {\n\tGlobal\n\tIf (TimePassed)\n\t\tReturn\n\tIf (T_x%x%y%y%=\"M\")\t\t\t\t\t\t\t\t\t\t\t; we'll save you this time\n\t{\n\t\tT_x%x%y%y%:=\"\"\t\t\t\t\t\t\t\t\t\t; remove this mine\n\t\tLoop,% Height\n\t\t{\n\t\t\ty:=A_Index\n\t\t\tLoop,% Width\n\t\t\t{\n\t\t\t\tx:=A_Index\n\t\t\t\tIf ( T_x%x%y%y%!=\"M\")\t\t\t\t\t\t\t; add it to first available non-mine square\n\t\t\t\t\tT_x%x%y%y%:=\"M\"\n\t\t\t\t\t,break:=1\n\t\t\tIfEqual,break,1,Break\n\t\t\t}\n\t\tIfEqual,break,1,Break\n\t\t}\n\t}\n\tLoop,% Height\t\t\t\t\t\t\t\t\t\t\t\t; iterate over height\n\t{\n\t\ty:=A_Index\n\t\tLoop,% Width\t\t\t\t\t\t\t\t\t\t\t; iterate over width\n\t\t{\n\t\t\tx:=A_Index\n\t\t\tGui,Font\n\t\t\tIf (T_x%x%y%y%=\"M\") {\t\t\t\t\t\t\t\t; check for mine\n\t\t\t\tGui,Font,s11,WingDings\n\t\t\t\thColor:=\"Black\"\t\t\t\t\t\t\t\t; set color for text\n\t\t\t} Else {\n\t\t\t\tLoop,3 {\t\t\t\t\t\t\t\t\t\t; loop over neighbors: three columns vertically\n\t\t\t\t\tty:=y-2+A_Index\t\t\t\t\t\t\t; calculate top offset\n\t\t\t\t\tLoop,3 {\t\t\t\t\t\t\t\t\t; and three horizontally\n\t\t\t\t\t\ttx:=x-2+A_Index\t\t\t\t\t\t; calculate left offset\n\t\t\t\t\t\tIf (T_x%tx%y%ty%=\"M\")\t\t\t\t\t; no mine and inbound\n\t\t\t\t\t\t\tT_x%x%y%y%++\t\t\t\t\t\t; update hint txt\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tGui,Font,s11 Bold,Courier New Bold\n\t\t\t\tIf (Color)\n\t\t\t\t\tLoop,Parse,mColor,`,\t\t\t\t\t\t; find color\n\t\t\t\t\t\tIf (T_x%x%y%y% = A_Index) {\t\t\t\t; hinttxt to color\n\t\t\t\t\t\t\thColor:=A_LoopField\t\t\t\t; set color for text\n\t\t\t\t\t\t\tBreak\n\t\t\t\t\t\t}\n\t\t\t\tElse hColor:=\"Black\"\n\t\t\t}\n\t\t\tGui,Add,Text,% \"c\" hColor \" Border +Center vT_x\" x \"y\" y\t; set color / variable\n\t\t\t\t\t\t\t. \" w\" BlockSize \" h\" BlockSize \" \"\t(x = 1\t; width / height / if 1st block\n\t\t\t\t\t\t\t\t? \"x\" 12 \" y\" y*BlockSize+39\t\t\t; fix vertical position\n\t\t\t\t\t\t\t\t: \"yp x+0\")\t\t\t\t\t\t\t\t; otherwise align to previous box\n\t\t\t\t\t\t\t,% T_x%x%y%y%\t\t\t\t\t\t\t\t; M is WingDings for mine\n\t\t\tGuiControl,Hide,T_x%x%y%y%\t\n\t\t}\n\t}\n\tGuiControl,,Timer,% \"00\" . TimePassed:=1\n\tSetTimer,UpdateTimer,1000\t\t\t\t\t\t\t\t\t\t; start timer\n\tIf (Sound)\n\t\tSoundPlay,C:\\WINDOWS\\media\\chord.wav\n}\n\nGuiSize:\n\tIf (TimePassed)\n\t\tSetTimer,UpdateTimer,On \t\t\t\t\t\t\t\t\t; for cheat below\nReturn\n\nUpdateTimer:\t\t\t\t\t\t\t\t\t\t\t\t\t\t; timer\n\tGuiControl,,Timer,% (++TimePassed < 999) ? SubStr(\"00\" TimePassed,-2) : 999\n\tIf (Sound)\n\t\tSoundPlay,C:\\WINDOWS\\media\\chord.wav\nReturn\n\nCheck(x,y){\n\tGlobal\n\tIf (GameOver || B_x%x%y%y% != \"\"\t\t\t\t\t\t; the game is over / prevent click on flagged squares and already-opened squares\n\t\t|| x<1 || x>Width || y<1 || y>Height)\t\t\t\t; do not check neighbor on illegal squares\n\t\tReturn\n\tIf (T_x%x%y%y%=\"\") {\t\t\t\t\t\t\t\t\t; empty field?\n\t\tCheckNeighbor(x,y)\t\t\t\t\t\t\t\t\t; uncover it and any neighbours\n\t} Else If (T_x%x%y%y% != \"M\") {\t\t\t\t\t\t\t; no Mine, ok?\n\t\tGuiControl,Hide,B_x%x%y%y%\t\t\t\t\t\t\t; hide covering button\n\t\tGuiControl,Show,T_x%x%y%y%\n\t\tB_x%x%y%y%:=1\t\t\t\t\t\t\t\t\t\t; remember we been here\n\t\tUpdateChecks()\n\t} Else {\t\t\t\t\t\t\t\t\t\t\t\t; ewww ... it's a mine!\n\t\tSetTimer,UpdateTimer,Off\t\t\t\t\t\t\t; kill timer\n\t\tGuiControl,,T_x%x%y%y%,N\t\t\t\t\t\t\t; set to Jolly Roger=N to mark death location\n\t\tGuiControl,,NewGame,L\t\t\t\t\t\t\t\t; set Smiley Btn to Frown=L\n\t\tRevealAll()\n\t\tIf (Sound)\t\t\t\t\t\t\t\t\t\t\t; do we sound?\n\t\t\tIf (FileExist(\"C:\\Program Files\\Microsoft Office\\Office12\\MEDIA\\Explode.wav\"))\n\t\t\t\tSoundPlay,C:\\Program Files\\Microsoft Office\\Office12\\MEDIA\\Explode.wav\n\t\t\tElse\n\t\t\t\tSoundPlay,C:\\WINDOWS\\Media\\notify.wav\n\t}\n}\n\nCheckNeighbor(x,y) {\t\t\t\t\t\t\t\t; This function checks neighbours of the clicked\n\tGlobal\t\t\t\t\t\t\t\t\t\t\t; field and uncovers empty fields plus adjacent hint fields\n\tIf (GameOver || B_x%x%y%y%!=\"\")\n\t\tReturn\n\tGuiControl,Hide,B_x%x%y%y%\t\t\t\t\t\t; uncover it\n\tGuiControl,Show,T_x%x%y%y%\n\tB_x%x%y%y%:=1\t\t\t\t\t\t\t\t\t; remember it\n\tUpdateChecks()\n\tIf (T_x%x%y%y%!=\"\")\t\t\t\t\t\t\t\t; is neighbour an nonchecked 0 value field?\n\t\tReturn\n\tIf (y-1>=1)\t\t\t\t\t\t\t\t\t\t; check upper neighbour\n\t\tCheckNeighbor(x,y-1)\n\tIf (y+1<=Height)\t\t\t\t\t\t\t\t; check lower neighbour\n\t\tCheckNeighbor(x,y+1)\n\tIf (x-1>=1)\t\t\t\t\t\t\t\t\t\t; check left neighbour\n\t\tCheckNeighbor(x-1,y)\n\tIf (x+1<=Width)\t\t\t\t\t\t\t\t\t; check right neighbour\n\t\tCheckNeighbor(x+1,y)\n\tIf (x-1>=1 && y-1>=1)\t\t\t\t\t\t\t; check corner neighbour\n\t\tCheckNeighbor(x-1,y-1)\n\tIf (x-1>=1 && y+1<=Height)\t\t\t\t\t\t; check corner neighbour\n\t\tCheckNeighbor(x-1,y+1)\n\tIf (x+1<=Width && y-1>=1)\t\t\t\t\t\t; check corner neighbour\n\t\tCheckNeighbor(x+1,y-1)\n\tIf (x+1<=Width && y+1<=Height)\t\t\t\t\t; check corner neighbour\n\t\tCheckNeighbor(x+1,y+1)\n}\n\nUpdateChecks() {\n\tGlobal\n\tMineCount:=MineMax, Die1:=Die2:=0\n\tLoop,% Height\n\t{\n\t\ty:=A_Index\n\t\tLoop,% Width\n\t\t{\n\t\t\tx:=A_Index\n\t\t\tIf (B_x%x%y%y%=\"O\")\n\t\t\t\tMineCount--\n\t\t\tIf (T_x%x%y%y%=\"M\" && B_x%x%y%y%!=\"O\") || (T_x%x%y%y%!=\"M\" && B_x%x%y%y%=\"O\")\n\t\t\t\tDie1++\n\t\t\tIf (B_x%x%y%y%=\"\" && T_x%x%y%y%!=\"M\")\n\t\t\t\tDie2++\n\t\t}\n\t}\n\tGuiControl,,MineCount,% SubStr(\"00\" MineCount,-2)\n\tIf (Die1 && Die2)\n\t\tReturn\t; only get past here if flags+untouched squares match mines perfectly\n\tSetTimer,UpdateTimer,Off\t\t\t\t\t\t\t; game won - kill timer\n\tGuiControl,,NewGame,J\t\t\t\t\t\t\t\t; set Smiley Btn to Smile=J\n\tRevealAll()\n\tIf (Sound)\t\t\t\t\t\t\t\t\t\t\t; play sound\n\t\tSoundPlay,C:\\WINDOWS\\Media\\tada.wav\n\tIf (level!=\"Custom\" && TimePassed < SubStr(BestTime%level%,1,InStr(BestTime%level%,\" \")-1) )\n\t{\n\t\tInputBox,name,Congratulations!,You have the fastest time`nfor level %level%.`nPlease enter your name.`n,,,,,,,,%A_UserName%\n\t\tIf (name && !ErrorLevel)\n\t\t{\n\t\t\tBestTime%level%:=%TimePassed% seconds\t%name%\n\t\t\tIniWrite,BestTime%level%,%A_ScriptFullPath%,InGameSettings,BestTime%level%\n\t\t}\n\t}\n}\n\nRevealAll(){\n\tGlobal\n\tLoop,% Height\t\t\t\t\t\t\t\t\t\t; uncover all\n\t{\n\t\ty:=A_Index\n\t\tLoop,% Width\n\t\t{\n\t\t\tx:=A_Index\n\t\t\tIf(T_x%x%y%y%=\"M\")\n\t\t\t{\n\t\t\t\tGuiControl,Hide,B_x%x%y%y%\n\t\t\t\tGuiControl,Show,T_x%x%y%y%\n\t\t\t}\n\t\t}\n\t}\n\tGameOver:=True\t\t\t\t\t\t\t\t\t; remember the game's over to block clicks\n}\n\n~F2::NewGame()\nNewGame(){\nNewGame:\n\tReload\n\tExitApp\n}\n\nLevelMenu:\n\tIf (A_ThisMenuItem=\"&Beginner\")\n\t\tlevel:=\"Beginner\", Width:=9, Height:=9, MineMax:=10\n\tElse If (A_ThisMenuItem=\"&Intermediate\")\n\t\tlevel:=\"Intermediate\", Width:=16, Height:=16, MineMax:=40\n\tElse If (A_ThisMenuItem=\"&Expert\")\n\t\tlevel:=\"Expert\", Width:=30, Height:=16, MineMax:=99\n\tIniWrite,%level%,%A_ScriptFullPath%,InGameSettings,level\n\tIniWrite,%Width%,%A_ScriptFullPath%,InGameSettings,Width\n\tIniWrite,%Height%,%A_ScriptFullPath%,InGameSettings,Height\n\tIniWrite,%MineMax%,%A_ScriptFullPath%,InGameSettings,MineMax\n\tIniWrite,%Marks%,%A_ScriptFullPath%,InGameSettings,Marks\n\tIniWrite,%Sound%,%A_ScriptFullPath%,InGameSettings,Sound\n\tIniWrite,%Color%,%A_ScriptFullPath%,InGameSettings,Color\n\tNewGame()\nReturn\n\nCustomMenu:\t\t\t\t\t\t\t\t\t\t\t\t; label for setting window\n\tGui,2:+Owner1\t\t\t\t\t\t\t\t\t\t; make Gui#2 owned by gameWindow\n\tGui,2:Default\t\t\t\t\t\t\t\t\t\t; set to default\n\tGui,1:+Disabled\t\t\t\t\t\t\t\t\t\t; disable gameWindow\n\tGui,-MinimizeBox +E0x00000400\n\tGui,Add,Text,x15 y36 w38 h16,&Height:\n\tGui,Add,Edit,Number x60 y33 w38 h20 vHeight HwndHwndHeight,%Height%\t; use inGame settings\n\tGui,Add,Text,x15 y60 w38 h16,&Width:\n\tGui,Add,Edit,Number x60 y57 w38 h20 vWidth HwndHwndWidth,%Width%\n\tGui,Add,Text,x15 y85 w38 h16,&Mines:\n\tGui,Add,Edit,Number x60 y81 w38 h20 vMineMax HwndHwndMines,%MineMax%\n\tGui,Add,Button,x120 y33 w60 h26 Default HwndHwndOK,OK\n\tGui,Add,Button,x120 y75 w60 h26 g2GuiClose HwndHwndCancel,Cancel\t\t; jump directly to 2GuiClose label\n\tGui,Show,w195 h138,Custom Field\nReturn\n\n2ButtonOK:\t\t\t\t\t\t\t\t\t\t\t\t\t; label for OK button in settings window\n\tGui,2:Submit,NoHide\n\tlevel:=\"Custom\"\n\tMineMax:=MineMax<10 ? 10 : MineMax>((Width-1)*(Height-1)) ? ((Width-1)*(Height-1)) : MineMax\n\tWidth:=Width<9 ? 9 : Width>30 ? 30 : Width\n\tHeight:=Height<9 ? 9 : Height>24 ? 24 : Height\n\tGoSub,LevelMenu\nReturn\n\n2GuiClose:\n2GuiEscape:\n\tGui,1:-Disabled\t\t\t\t\t\t\t\t; reset GUI status and destroy setting window\n\tGui,1:Default\n\tGui,2:Destroy\nReturn\n\nToggleMenu:\n\tToggle:=RegExReplace(RegExReplace(A_ThisMenuItem,\"\\s.*\"),\"&\")\n\ttemp:=%Toggle%\n\t%Toggle%:=!%Toggle%\n\tMenu,GameMenu,ToggleCheck,%A_ThisMenuItem%\n\tIniWrite,% %Toggle%,%A_ScriptFullPath%,InGameSettings,%Toggle%\nReturn\n\nBestTimesMenu:\n\tGui,3:+Owner1\n\tGui,3:Default\n\tGui,1:+Disabled\n\tGui,-MinimizeBox +E0x00000400\n\tGui,Add,Text,x15 y22 w250 vBestTimeBeginner HwndHwndBTB,Beginner:\t%BestTimeBeginner%\n\tGui,Add,Text,x15 y38 w250 vBestTimeIntermediate HwndHwndBTI,Intermediate:\t%BestTimeIntermediate%\n\tGui,Add,Text,x15 y54 w250 vBestTimeExpert HwndHwndBTE,Expert:\t\t%BestTimeExpert%\n\tGui,Add,Button,x38 y89 w75 h20 HwndHwndRS,&Reset Scores\n\tGui,Add,Button,x173 y89 w45 h20 Default HwndHwndOK,OK\n\tGui,Show,w255 h122,Fastest Mine Sweepers\nReturn\n\n3ButtonResetScores:\n\tBestTimeBeginner\t=999 seconds\tAnonymous\n\tBestTimeIntermediate=999 seconds\tAnonymous\n\tBestTimeExpert\t\t=999 seconds\tAnonymous\n\tGuiControl,,BestTimeBeginner,Beginner:\t%BestTimeBeginner%`nIntermediate:\t%BestTimeIntermediate%`nExpert:\t\t%BestTimeExpert%\n\tGuiControl,,BestTimeIntermediate,Intermediate:\t%BestTimeIntermediate%`nExpert:\t\t%BestTimeExpert%\n\tGuiControl,,BestTimeExpert,Expert:\t\t%BestTimeExpert%\n\tIniWrite,%BestTimeBeginner%,%A_ScriptFullPath%,InGameSettings,BestTimeBeginner\n\tIniWrite,%BestTimeIntermediate%,%A_ScriptFullPath%,InGameSettings,BestTimeIntermediate\n\tIniWrite,%BestTimeExpert%,%A_ScriptFullPath%,InGameSettings,BestTimeExpert\n3GuiEscape:\t; fall through:\n3GuiClose:\n3ButtonOK:\n\tGui,1:-Disabled\t\t\t\t\t\t\t\t\t; reset GUI status and destroy setting window\n\tGui,1:Default\n\tGui,3:Destroy\nReturn\n\n^q::\nGuiClose:\n\tExitApp\n\nHelpMenu:\n\t;Run C:\\WINDOWS\\Help\\winmine.chm\nReturn\n\nAboutMenu:\n\tMsgbox,64,About Minesweeper,AutoHotkey (r) Minesweeper`nVersion 1.0.6`nCopyright (c) 2014`nby derRaphael and Sobriquet\nReturn\n\n~LButton::\n~!LButton::\n~^LButton::\n~#LButton::\n\tTooltip\n\tIf (GetKeyState(\"RButton\",\"P\"))\n\t\tReturn\n\tIf A_OSVersion not in WIN_2003,WIN_XP,WIN_2000,WIN_NT4,WIN_95,WIN_98,WIN_ME\n\t\tIf(A_PriorHotkey=\"~*LButton Up\" && A_TimeSincePriorHotkey<100)\n\t\t\tGoTo,*MButton Up\t; invoke MButton handling for autofill on left double-click in vista+\n\tIf (GameOver)\n\t\tReturn\n\tMouseGetPos,,y\n\tIf (y>47)\n\t\tGuiControl,,NewGame,m\nReturn\n\n~*LButton Up::\n\tIf (GetKeyState(\"RButton\",\"P\"))\n\t\tGoTo,*MButton Up\n\tIf (GameOver)\n\t\tReturn\n\tGuiControl,,NewGame,K\n\tcontrol:=GetControlFromClassNN(), NumX:=NumY:=0\n\tRegExMatch(control,\"Si)T_x(?P<X>\\d+)y(?P<Y>\\d+)\",Num)\t\t; get Position\n\tStartGame(NumX,NumY)\t\t\t\t\t\t\t\t\t\t; start game if neccessary\n\tCheck(NumX,NumY)\nReturn\n\n+LButton::\n*MButton::\n\tTooltip\n\tIf (GameOver)\n\t\tReturn\n\tMouseGetPos,,y\n\tIf (y>47)\n\t\tGuiControl,,NewGame,m\nReturn\n\n+LButton Up::\n*MButton Up::\n\tIf (GameOver)\n\t\tReturn\n\tGuiControl,,NewGame,K\n\tStartGame(NumX,NumY)\t\t\t\t\t\t\t\t\t\t\t; start game if neccessary\n\tIf (GetKeyState(\"Esc\",\"P\"))\n\t{\n\t\tSetTimer,UpdateTimer,Off\n\t\tReturn\n\t}\n\tcontrol:=GetControlFromClassNN(), NumX:=NumY:=0\n\tRegExMatch(control,\"Si)T_x(?P<X>\\d+)y(?P<y>\\d+)\",Num)\n\tIf ( !NumX || !NumY || B_x%NumX%y%NumY%!=1)\n\t\tReturn\n\ttemp:=0\n\tLoop,3 {\t\t\t\t\t\t\t\t\t\t\t\t\t\t; loop over neighbors: three columns vertically\n\t\tty:=NumY-2+A_Index\t\t\t\t\t\t\t\t\t\t; calculate top offset\n\t\tLoop,3 {\t\t\t\t\t\t\t\t\t\t\t\t\t; and three horizontally\n\t\t\ttx:=NumX-2+A_Index\t\t\t\t\t\t\t\t\t; calculate left offset\n\t\t\tIf (B_x%tx%y%ty% = \"O\")\t\t\t\t\t\t\t\t\t; count number of marked mines around position\n\t\t\t\ttemp++\n\t\t}\n\t}\n\tIf (temp=T_x%NumX%y%NumY%)\n\t\tLoop,3 {\t\t\t\t\t\t\t\t\t\t\t\t\t; loop over neighbors: three columns vertically\n\t\t\tty:=NumY-2+A_Index\t\t\t\t\t\t\t\t\t; calculate top offset\n\t\t\tLoop,3 {\t\t\t\t\t\t\t\t\t\t\t\t; and three horizontally\n\t\t\t\ttx:=NumX-2+A_Index\t\t\t\t\t\t\t\t; calculate left offset\n\t\t\t\tCheck(tx,ty)\t\t\t\t\t\t\t\t\t\t; simulate user clicking on each surrounding square\n\t\t\t}\n\t\t}\nReturn\n\n~*RButton::\n\tIf (GameOver || GetKeyState(\"LButton\",\"P\"))\n\t\tReturn\n\tcontrol:=GetControlFromClassNN(), NumX:=NumY:=0\n\tRegExMatch(control,\"Si)T_x(?P<X>\\d+)y(?P<y>\\d+)\",Num)\t\t\t; grab 'em\n\tIf ( !NumX || !NumY || B_x%NumX%y%NumY%=1)\n\t\tReturn\n\tStartGame(NumX,NumY)\t\t\t\t\t\t\t\t\t\t\t; start counter if neccessary\n\tB_x%NumX%y%NumY%:=(B_x%NumX%y%NumY%=\"\" ? \"O\" : (B_x%NumX%y%NumY%=\"O\" && Marks=1 ? \"I\" : \"\"))\n\tGuiControl,,B_x%NumX%y%NumY%,% B_x%NumX%y%NumY%\n\tUpdateChecks()\nReturn\n\n~*RButton Up::\n\tIf (GetKeyState(\"LButton\",\"P\"))\n\t\tGoTo,*MButton Up\nReturn\n\nGetControlFromClassNN(){\n\tGlobal width\n\tMouseGetPos,,,,control\n\tIf (SubStr(control,1,6)=\"Button\")\n\t\tNumX:=mod(SubStr(control,7)-2,width)+1,NumY:=(SubStr(control,7)-2)//width+1\n\tElse If (SubStr(control,1,6)=\"Static\")\n\t\tNumX:=mod(SubStr(control,7)-3,width)+1,NumY:=(SubStr(control,7)-3)//width+1\n\tReturn \"T_x\" NumX \"y\" NumY\n}\n\nWM_HELP(_,_lphi)\n{\n\tGlobal\n\thItemHandle:=NumGet(_lphi+0,12)\n\tIf (hItemHandle=HwndBTB || hItemHandle=HwndBTI || hItemHandle=HwndBTE)\n\t\tToolTip Displays a player's best game time`, and the player's name`, for`neach level of play: Beginner`, Intermediate`, and Expert.\n\tElse If (hItemHandle=HwndRS)\n\t\tToolTip Click to clear the current high scores.\n\tElse If (hItemHandle=HwndOK)\n\t\tToolTip Closes the dialog box and saves any changes you`nhave made.\n\tElse If (hItemHandle=HwndCancel)\n\t\tToolTip Closes the dialog box without saving any changes you have`nmade.\n\tElse If (hItemHandle=HwndHeight)\n\t\tToolTip Specifies the number of vertical squares on the`nplaying field.\n\tElse If (hItemHandle=HwndWidth)\n\t\tToolTip Specifies the number of horizontal squares on the`nplaying field.\n\tElse If (hItemHandle=HwndMines)\n\t\tToolTip Specifies the number of mines to be placed on the`nplaying field.\n}\n\n:*?B0:xyzzy:: ; cheat\n\tKeyWait,Shift,D T1\t\t\t\t\t\t\t\t\t; 1 sec grace period to press shift\n\tIf (ErrorLevel)\n\t\tReturn\n\tWhile,GetKeyState(\"Shift\",\"P\")\n\t{\n\t\tcontrol:=GetControlFromClassNN()\n\t\tIf (%control% = \"M\")\n\t\t\tSplashImage,,B X0 Y0 W1 H1 CW000000\t\t\t; black pixel\n\t\tElse\n\t\t\tSplashImage,,B X0 Y0 W1 H1 CWFFFFFF\t\t\t; white pixel\n\t\tSleep 100\n\t}\n\tSplashImage,Off\nReturn\n\n/*\n Version History\n=================\nDec 29, 2008\n1.0.0\tInitial Release\n1.0.1\tBugFix\n\t\t- Game Restart Issues mentioned by Frankie\n\t\t- Guess count fixup I\n\t\t- Startbehaviour of game (time didnt start when 1st click was RMB Guess)\nDec 30, 2008\n1.0.2\tBugFix\n\t\t- Field Size Control vs Max MineCount / mentioned by °digit° / IsNull\n1.0.3\tBugFix\n\t\t- Guess count fixup II mentioned by °digit°\n\t\t- Corrected count when 'guessed' field uncovered\nDec 31, 2008\n1.0.4\tBugFix\n\t\t- Fix of Min Field & MineSettings\nMar 7, 2014\n1.0.5\tAddFeatures\n\t\t- Make appearance more like original\n\t\t- Make first click always safe\n\t\t- Re-license as CeCILL v2\nMar 8, 2014\n1.0.6\tAddFeatures\n\t\t- Add cheat code\n\t\t- Add middle-button shortcut\n\t\t- Re-license as GPL 1.3\n*/\n","language":"AutoHotkey"},{"code":"N = 6 : M = 5 : H = 25 : P = 0.2\n\nfastgraphics\ngraphsize N*H,(M+1)*H\nfont \"Arial\",H/2+1,75\ndim f(N,M) # 1 open, 2 mine, 4 expected mine\ndim s(N,M) # count of mines in a neighborhood\n\ntrian1 = {1,1,H-1,1,H-1,H-1} : trian2 = {1,1,1,H-1,H-1,H-1}\nmine = {2,2, H/2,H/2-2, H-2,2, H/2+2,H/2, H-2,H-2, H/2,H/2+2, 2,H-2, H/2-2,H/2}\nflag = {H/2-1,3, H/2+1,3, H-4,H/5, H/2+1,H*2/5, H/2+1,H*0.9-2, H*0.8,H-2, H*0.2,H-2, H/2-1,H*0.9-2}\n\nmines = int(N*M*P) : k = mines : act = 0\nwhile k>0\n\ti = int(rand*N) : j = int(rand*M)\n\tif not f[i,j] then\n\t\tf[i,j] = 2 : k = k - 1\t\t# set mine\n\t\ts[i,j] = s[i,j] + 1 : gosub adj\t# count it\n\t\t\n\tend if\nend while\ntogo = M*N-mines : over = 0 : act = 1\n\ngosub redraw\nwhile not over\n\tclickclear\n\twhile not clickb\n\t\tpause 0.01\n\tend while\n\ti = int(clickx/H) : j = int(clicky/H)\n\tif i<N and j<M then\n\t\tif clickb=1 then\n\t\t\tif not (f[i,j]&4) then ai = i : aj = j : gosub opencell\n\t\t\tif not s[i,j] then gosub adj\n\t\telse\n\t\t\tif not (f[i,j]&1) then\n\t\t\t\tif f[i,j]&4 then mines = mines+1\n\t\t\t\tif not (f[i,j]&4) then mines = mines-1\n\t\t\t\tf[i,j] = (f[i,j]&~4)|(~f[i,j]&4)\n\t\t\tend if\n\t\tend if\n\t\tif not (togo or mines) then over = 1\n\t\tgosub redraw\n\tend if\nend while\nimgsave \"Minesweeper_game_BASIC-256.png\", \"PNG\"\nend\n\nredraw:\n\tfor i = 0 to N-1\n\t\tfor j = 0 to M-1\n\t\t\tif over=-1 and f[i,j]&2 then f[i,j] = f[i,j]|1\n\t\t\tgosub drawcell\n\t\tnext j\n\tnext i\n\t# Counter\n\tcolor (32,32,32) : rect 0,M*H,N*H,H\n\tcolor white : x = 5 : y = M*H+H*0.05\n\tif not over then text x,y,\"Mines: \" + mines\n\tif over=1 then text x,y,\"You won!\"\n\tif over=-1 then text x,y,\"You lost\"\n\trefresh\n\treturn\n\ndrawcell:\n\tcolor darkgrey\n\trect i*H,j*H,H,H\n\tif f[i,j]&1=0 then\t# closed\n\t\tcolor black : stamp i*H,j*H,trian1\n\t\tcolor white : stamp i*H,j*H,trian2\n\t\tcolor grey : rect i*H+2,j*H+2,H-4,H-4\n\t\tif f[i,j]&4 then color blue : stamp i*H,j*H,flag\n\telse\n\t\tcolor 192,192,192 : rect i*H+1,j*H+1,H-2,H-2\n\t\t# Draw\n\t\tif f[i,j]&2 then\t# mine\n\t\t\tif not (f[i,j]&4) then color red\n\t\t\tif f[i,j]&4 then color darkgreen\n\t\t\tcircle i*H+H/2,j*H+H/2,H/5 : stamp i*H,j*H,mine\n\t\telse\n\t\t\tif s[i,j] then color (32,32,32) : text i*H+H/3,j*H+1,s[i,j]\n\t\tend if\n\tend if\n\treturn\n\nadj:\n\taj = j-1\n\tif j and i then ai = i-1 : gosub adjact\n\tif j then ai = i : gosub adjact\n\tif j and i<N-1 then ai = i+1 : gosub adjact\n\taj = j\n\tif i then ai = i-1 : gosub adjact\n\tif i<N-1 then ai = i+1 : gosub adjact\n\taj = j+1\n\tif j<M-1 and i then ai = i-1 : gosub adjact\n\tif j<M-1 then ai = i : gosub adjact\n\tif j<M-1 and i<N-1 then ai = i+1 : gosub adjact\n\treturn\n\nadjact:\n\tif not act then s[ai,aj] = s[ai,aj]+1 : return\n\tif act then gosub opencell : return\n\nopencell:\n\tif not (f[ai,aj]&1) then\n\t\tf[ai,aj] = f[ai,aj]|1\n\t\ttogo = togo-1\n\tend if\n\tif f[ai,aj]&2 then over = -1\n\treturn\n","language":"BASIC256"},{"code":"get \"libhdr\"\n\nstatic $( randstate = 0 $)\n\nmanifest $(\n nummask = #XF\n flagmask = #X10\n bombmask = #X20\n revealed = #X40\n MAXINT = (~0)>>1\n MININT = ~MAXINT\n$)\n\nlet min(x,y) = x<y -> x, y\nand max(x,y) = x>y -> x, y\n\nlet rand() = valof\n$( randstate := random(randstate)\n resultis randstate >> 7\n$)\n\nlet randto(x) = valof\n$( let r, mask = ?, 1\n while mask<x do mask := (mask << 1) | 1\n r := rand() & mask repeatuntil r < x\n resultis r\n$)\n\n// Place a bomb on the field (if not already a bomb)\nlet placebomb(field, xsize, ysize, x, y) =\n (field!(y*xsize+x) & bombmask) ~= 0 -> false,\n valof\n$( for xa = max(x-1, 0) to min(x+1, xsize-1)\n for ya = max(y-1, 0) to min(y+1, ysize-1)\n $( let loc = ya*xsize+xa\n let n = field!loc & nummask\n field!loc := (field!loc & ~nummask) | (n + 1)\n $)\n field!(y*xsize+x) := field!(y*xsize+x) | bombmask\n resultis true\n$)\n\n// Populate the field with N bombs\nlet populate(field, xsize, ysize, nbombs) be\n$( for i=0 to xsize*ysize-1 do field!i := 0\n while nbombs > 0\n $( let x, y = randto(xsize), randto(ysize)\n if placebomb(field, xsize, ysize, x, y) then\n nbombs := nbombs - 1\n $)\n$)\n\n// Reveal field (X,Y) - returns true if stepped on a bomb\nlet reveal(field, xsize, ysize, x, y) =\n (field!(y*xsize+x) & bombmask) ~= 0 -> true,\n valof\n$( let loc = y*xsize+x\n field!loc := field!loc | revealed\n if (field!loc & nummask) = 0 then\n for xa = max(x-1, 0) to min(x+1, xsize-1)\n for ya = max(y-1, 0) to min(y+1, ysize-1)\n if (field!(ya*xsize+xa) &\n (bombmask | flagmask | revealed)) = 0 do\n reveal(field, xsize, ysize, xa, ya)\n resultis false\n$)\n\n// Toggle flag\nlet toggleflag(field, xsize, ysize, x, y) be\n$( let loc = y*xsize+x\n field!loc := field!loc neqv flagmask\n$)\n\n// Show the field. Returns true if won.\nlet showfield(field, xsize, ysize, kaboom) = valof\n$( let bombs, flags, hidden, found = 0, 0, 0, 0\n for i=0 to xsize*ysize-1\n $( if (field!i & revealed) = 0 do hidden := hidden + 1\n unless (field!i & bombmask) = 0 do bombs := bombs + 1\n unless (field!i & flagmask) = 0 do flags := flags + 1\n if (field!i & bombmask) ~= 0 & (field!i & flagmask) ~= 0\n do found := found + 1\n $)\n writef(\"Bombs: %N - Flagged: %N - Hidden: %N*N\", bombs, flags, hidden)\n wrch('+')\n for x=0 to xsize-1 do wrch('-')\n writes(\"+*N\")\n for y=0 to ysize-1\n $( wrch('|')\n for x=0 to xsize-1\n $( let loc = y*xsize+x\n test kaboom & (field!loc & bombmask) ~= 0 do\n wrch('**')\n or test (field!loc & (flagmask | revealed)) = flagmask do\n wrch('?')\n or test (field!loc & revealed) = 0 do\n wrch('.')\n or test (field!loc & nummask) = 0 do\n wrch(' ')\n or\n wrch('0' + (field!loc & nummask))\n $)\n writes(\"|*N\")\n $)\n wrch('+')\n for x=0 to xsize-1 do wrch('-')\n writes(\"+*N\")\n resultis found = bombs\n$)\n\n// Ask a question, get number\nlet ask(q, min, max) = valof\n$( let n = ?\n $( writes(q)\n n := readn()\n $) repeatuntil min <= n <= max\n resultis n\n$)\n\n// Read string\nlet reads(v) = valof\n$( let ch = ?\n v%0 := 0\n $( ch := rdch()\n if ch = endstreamch then resultis false\n v%0 := v%0 + 1\n v%(v%0) := ch\n $) repeatuntil ch = '*N'\n resultis true\n$)\n\n// Play game given field\nlet play(field, xsize, ysize) be\n$( let x = ?\n let y = ?\n let ans = vec 80\n if showfield(field, xsize, ysize, false)\n $( writes(\"*NYou win!*N\")\n finish\n $)\n $( writes(\"*NR)eveal, F)lag, Q)uit? \")\n unless reads(ans) finish\n unless ans%0 = 2 & ans%2='*N' loop\n ans%1 := ans%1 | 32\n if ans%1 = 'q' then finish\n $) repeatuntil ans%1='r' | ans%1='f'\n\n y := ask(\"Row? \", 1, ysize)-1\n x := ask(\"Column? \", 1, xsize)-1\n\n switchon ans%1 into\n $( case 'r':\n unless (field!(y*xsize+x) & flagmask) = 0\n $( writes(\"*NError: that field is flagged, unflag it first.*N\")\n endcase\n $)\n unless (field!(y*xsize+x) & revealed) = 0\n $( writes(\"*NError: that field is already revealed.*N\")\n endcase\n $)\n if reveal(field, xsize, ysize, x, y)\n $( writes(\"*N K A B O O M *N*N\")\n showfield(field, xsize, ysize, true)\n finish\n $)\n endcase\n case 'f':\n test (field!(y*xsize+x) & revealed) = 0\n do toggleflag(field, xsize, ysize, x, y)\n or writes(\"*NError: that field is already revealed.*N\")\n endcase\n $)\n wrch('*N')\n$) repeat\n\nlet start() be\n$( let field, xsize, ysize, bombs = ?, ?, ?, ?\n\n writes(\"Minesweeper*N-----------*N*N\")\n randstate := ask(\"Random seed? \", MININT, MAXINT)\n xsize := ask(\"Width (4-64)? \", 4, 64)\n ysize := ask(\"Height (4-22)? \", 4, 22)\n\n // 10 to 20% bombs\n bombs := muldiv(xsize,ysize,10) + randto(muldiv(xsize,ysize,10)+1)\n\n field := getvec(xsize*ysize)\n populate(field, xsize, ysize, bombs)\n play(field, xsize, ysize)\n$)\n","language":"BCPL"},{"code":"#if 0\n\n Unix build:\n\n make CPPFLAGS=-DNDEBUG LDLIBS=-lcurses mines\n\n dwlmines, by David Lambert; sometime in the twentieth Century. The\n program is meant to run in a terminal window compatible with curses\n if unix is defined to cpp, or to an ANSI terminal when compiled\n without unix macro defined. I suppose I have built this on a\n windows 98 computer using gcc running in a cmd window. The original\n probably came from a VAX running VMS with a vt100 sort of terminal.\n Today I have xterm and gcc available so I will claim only that it\n works with this combination.\n\n As this program can automatically play all the trivially counted\n safe squares. Action is quick leaving the player with only the\n thoughtful action. Whereas 's' steps on the spot with the cursor,\n capital 'S' (Stomp) invokes autoplay.\n\n The cursor motion keys are as in the vi editor; hjkl move the cursor.\n\n 'd' displays the number of unclaimed bombs and cells.\n\n 'f' flags a cell.\n\n The numbers on the field indicate the number of bombs in the\n unclaimed neighboring cells. This is more useful than showing the\n values you expect. You may find unflagging a cell adjacent to a\n number will help you understand this.\n\n There is extra code here. The multidimensional array allocator\n allocarray is much better than those of Numerical Recipes in C. If\n you subtracted the offset 1 to make the arrays FORTRAN like then\n allocarray could substitute for those of NR in C.\n#endif\n\n#include <stdarg.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <ctype.h>\n\n#ifndef NDEBUG\n# define DEBUG_CODE(A) A\n#else\n# define DEBUG_CODE(A)\n#endif\n\n\n#include <time.h>\n\n#define DIM(A) (sizeof((A))/sizeof(*(A)))\n#define MAX(A,B) ((A)<(B)?(B):(A))\n#define BIND(A,L,H) ((L)<(A)?(A)<(H)?(A):(H):(L))\n\n#define SET_BIT(A,B) ((A)|=1<<(B))\n#define CLR_BIT(A,B) ((A)&=~(1<<(B)))\n#define TGL_BIT(A,B) ((A)^=1<<(B))\n#define INQ_BIT(A,B) ((A)&(1<<(B)))\n#define FOREVER for(;;)\n#define MODINC(i,mod) ((i)+1<(mod)?(i)+1:0)\n#define MODDEC(i,mod) (((i)<=0?(mod):(i))-1)\n\nvoid error(int status,const char *message) {\n fprintf(stderr, \"%s\\n\", message);\n exit(status);\n}\n\nvoid*dwlcalloc(int n,size_t bytes) {\n void*rv = (void*)calloc(n,bytes);\n if (NULL == rv)\n error(1,\"memory allocation failure\");\n DEBUG_CODE(fprintf(stderr,\"allocated address %p\\n\",rv);)\n return rv;\n}\n\nvoid*allocarray(int rank,size_t*shape,size_t itemSize) {\n /*\n Allocates arbitrary dimensional arrays (and inits all pointers)\n with only 1 call to malloc. David W. Lambert, written before 1990.\n This is wonderful because one only need call free once to deallocate\n the space. Special routines for each size array are not need for\n allocation of for deallocation. Also calls to malloc might be expensive\n because they might have to place operating system requests. One call\n seems optimal.\n */\n size_t size,i,j,dataSpace,pointerSpace,pointers,nextLevelIncrement;\n char*memory,*pc,*nextpc;\n if (rank < 2) {\n if (rank < 0)\n error(1,\"invalid negative rank argument passed to allocarray\");\n size = rank < 1 ? 1 : *shape;\n return dwlcalloc(size,itemSize);\n }\n pointerSpace = 0, dataSpace = 1;\n for (i = 0; i < rank-1; ++i)\n pointerSpace += (dataSpace *= shape[i]);\n pointerSpace *= sizeof(char*);\n dataSpace *= shape[i]*itemSize;\n memory = pc = dwlcalloc(1,pointerSpace+dataSpace);\n pointers = 1;\n for (i = 0; i < rank-2; ) {\n nextpc = pc + (pointers *= shape[i])*sizeof(char*);\n nextLevelIncrement = shape[++i]*sizeof(char*);\n for (j = 0; j < pointers; ++j)\n *((char**)pc) = nextpc, pc+=sizeof(char*), nextpc += nextLevelIncrement;\n }\n nextpc = pc + (pointers *= shape[i])*sizeof(char*);\n nextLevelIncrement = shape[++i]*itemSize;\n for (j = 0; j < pointers; ++j)\n *((char**)pc) = nextpc, pc+=sizeof(char*), nextpc += nextLevelIncrement;\n return memory;\n}\n\n#define PRINT(element) \\\n if (NULL == print_elt) \\\n printf(\"%10.3e\",*(double*)(element)); \\\n else \\\n (*print_elt)(element)\n\n/* matprint prints an array in APL\\360 style */\n/* with a NULL element printing function matprint assumes an array of double */\nvoid matprint(void*a,int rank,size_t*shape,size_t size,void(*print_elt)()) {\n union {\n unsigned **ppu;\n unsigned *pu;\n unsigned u;\n } b;\n int i;\n if (rank <= 0 || NULL == shape)\n PRINT(a);\n else if (1 < rank) {\n for (i = 0; i < shape[0]; ++i)\n matprint(((void**)a)[i], rank-1,shape+1,size,print_elt);\n putchar('\\n');\n for (i = 0, b.pu = a; i < shape[0]; ++i, b.u += size) {\n PRINT(b.pu);\n putchar(' ');\n }\n }\n}\n\n#ifdef __unix__\n# include <curses.h>\n# include <unistd.h>\n# define SRANDOM srandom\n# define RANDOM random\n#else\n# include <windows.h>\n void addch(int c) { putchar(c); }\n void addstr(const char*s) { fputs(s,stdout); }\n# define ANSI putchar(27),putchar('[')\n void initscr(void) { printf(\"%d\\n\",AllocConsole()); }\n void cbreak(void) { ; }\n void noecho(void) { ; }\n void nonl(void) { ; }\n int move(int r,int c) { ANSI; return printf(\"%d;%dH\",r+1,c+1); }\n int mvaddch(int r,int c,int ch) { move(r,c); addch(ch); }\n void refresh(void) { ; }\n# define WA_STANDOUT 32\n int attr_on(int a,void*p) { ANSI; return printf(\"%dm\",a); }\n int attr_off(int a,void*p) { attr_on(0,NULL); }\n# include <stdarg.h>\n void printw(const char*fmt,...) {\n va_list args;\n va_start(args,fmt);\n vprintf(fmt,args);\n va_end(args);\n }\n void clrtoeol(void) {\n ANSI;addstr(\"0J\");\n }\n# define SRANDOM srand\n# define RANDOM rand\n#endif\n\n#ifndef EXIT_SUCCESS\n# define EXIT_SUCCESS 1\t\t/* just a guess */\n#endif\n\n\n#if 0\n cell status\n UNKN --- contains virgin earth (initial state)\n MINE --- has a mine\n FLAG --- was flagged\n#endif\n\nenum {UNKN,MINE,FLAG};\t/* bit numbers */\n\n#define DETECT(CELL,PROPERTY) (!!INQ_BIT(CELL,PROPERTY))\n\nDEBUG_CODE( \\\n void pchr(void*a) {\t\t/* odd comment removed */ \\\n putchar('A'+*(char*a));\t/* should print the nth char of alphabet */\\\n } /* where 'A' is 0 */ \\\n)\n\nchar**bd;\t\t\t/* the board */\nsize_t shape[2];\n#define RWS (shape[0])\n#define CLS (shape[1])\n\nvoid populate(int x,int y,int pct) { /* finished size in col, row, % mines */\n int i,j,c;\n x = BIND(x,4,200), y = BIND(y,4,400); /* confine input as piecewise linear */\n shape[0] = x+2, shape[1] = y+2; bd = (char**)allocarray(2,shape,sizeof(char));\n memset(*bd,1<<UNKN,shape[0]*shape[1]*sizeof(char)); /* all unknown */\n for (i = 0; i < shape[0]; ++i)\t\t /* border is safe */\n bd[i][0] = bd[i][shape[1]-1] = 0;\n for (i = 0; i < shape[1]; ++i)\n bd[0][i] = bd[shape[0]-1][i] = 0;\n {\n time_t seed; /* now I would choose /dev/random */\n printf(\"seed is %u\\n\",(unsigned)seed);\n time(&seed), SRANDOM((unsigned)seed);\n }\n c = BIND(pct,1,99)*x*y/100;\t/* number of mines to set */\n while(c) {\n i = RANDOM(), j = 1+i%y, i = 1+(i>>16)%x;\n if (! DETECT(bd[i][j],MINE)) /* 1 mine per site */\n --c, SET_BIT(bd[i][j],MINE);\n }\n DEBUG_CODE(matprint(bd,2,shape,sizeof(int),pchr);)\n RWS = x+1, CLS = y+1;\t/* shape now stores the upper bounds */\n}\n\nstruct {\n int i,j;\n} neighbor[] = {\n {-1,-1}, {-1, 0}, {-1, 1},\n { 0,-1}, /*home*/ { 0, 1},\n { 1,-1}, { 1, 0}, { 1, 1}\n};\n/* NEIGHBOR seems to map 0..8 to local 2D positions */\n#define NEIGHBOR(I,J,K) (bd[(I)+neighbor[K].i][(J)+neighbor[K].j])\n\nint cnx(int i,int j,char w) {\t/* count neighbors with property w */\n int k,c = 0;\n for (k = 0; k < DIM(neighbor); ++k)\n c += DETECT(NEIGHBOR(i,j,k),w);\n return c;\n}\n\nint row,col;\n#define ME bd[row+1][col+1]\n\nint step(void) {\n if (DETECT(ME,FLAG)) return 1; /* flags offer protection */\n if (DETECT(ME,MINE)) return 0; /* lose */\n CLR_BIT(ME,UNKN);\n return 1;\n}\n\nint autoplay(void) {\n int i,j,k,change,m;\n if (!step()) return 0;\n do\t\t\t\t/* while changing */\n for (change = 0, i = 1; i < RWS; ++i)\n for (j = 1; j < CLS; ++j)\n\tif (!DETECT(bd[i][j],UNKN)) { /* consider nghbrs of safe cells */\n\t m = cnx(i,j,MINE);\n\t if (cnx(i,j,FLAG) == m) { /* mines appear flagged */\n\t for (k = 0; k < DIM(neighbor); ++k)\n\t if (DETECT(NEIGHBOR(i,j,k),UNKN)&&!DETECT(NEIGHBOR(i,j,k),FLAG)) {\n\t\tif (DETECT(NEIGHBOR(i,j,k),MINE)) { /* OOPS! */\n\t\t row = i+neighbor[k].i-1, col = j+neighbor[k].j-1;\n\t\t return 0;\n\t\t}\n\t\tchange = 1, CLR_BIT(NEIGHBOR(i,j,k),UNKN);\n\t }\n\t } else if (cnx(i,j,UNKN) == m)\n\t for (k = 0; k < DIM(neighbor); ++k)\n\t if (DETECT(NEIGHBOR(i,j,k),UNKN))\n\t\tchange = 1, SET_BIT(NEIGHBOR(i,j,k),FLAG);\n\t}\n while (change);\n return 1;\n}\n\nvoid takedisplay(void) { initscr(), cbreak(), noecho(), nonl(); }\n\nvoid help(void) {\n move(RWS,1),clrtoeol(), printw(\"move:hjkl flag:Ff step:Ss other:qd?\");\n}\n\nvoid draw(void) {\n int i,j,w;\n const char*s1 = \" 12345678\";\n move(1,1);\n for (i = 1; i < RWS; ++i, addstr(\"\\n \"))\n for (j = 1; j < CLS; ++j, addch(' ')) {\n w = bd[i][j];\n if (!DETECT(w,UNKN)) {\n\tw = cnx(i,j,MINE)-cnx(i,j,FLAG);\n\tif (w < 0) attr_on(WA_STANDOUT,NULL), w = -w;\n\taddch(s1[w]);\n\tattr_off(WA_STANDOUT,NULL);\n }\n else if (DETECT(w,FLAG)) addch('F');\n else addch('*');\n }\n move(row+1,2*col+1);\n refresh();\n}\n\nvoid show(int win) {\n int i,j,w;\n const char*s1 = \" 12345678\";\n move(1,1);\n for (i = 1; i < RWS; ++i, addstr(\"\\n \"))\n for (j = 1; j < CLS; ++j, addch(' ')) {\n w = bd[i][j];\n if (!DETECT(w,UNKN)) {\n\tw = cnx(i,j,MINE)-cnx(i,j,FLAG);\n\tif (w < 0) attr_on(WA_STANDOUT,NULL), w = -w;\n\taddch(s1[w]);\n\tattr_off(WA_STANDOUT,NULL);\n }\n else if (DETECT(w,FLAG))\n\tif (DETECT(w,MINE)) addch('F');\n\telse attr_on(WA_STANDOUT,NULL), addch('F'),attr_off(WA_STANDOUT,NULL);\n else if (DETECT(w,MINE)) addch('M');\n else addch('*');\n }\n mvaddch(row+1,2*col,'('), mvaddch(row+1,2*(col+1),')');\n move(RWS,0);\n refresh();\n}\n\n#define HINTBIT(W) s3[DETECT(bd[r][c],(W))]\n#define NEIGCNT(W) s4[cnx(r,c,(W))]\n\nconst char*s3=\"01\", *s4=\"012345678\";\n\nvoid dbg(int r, int c) {\n int i,j,unkns=0,mines=0,flags=0,pct;\n char o[6];\n static int hint;\n for (i = 1; i < RWS; ++i)\n for (j = 1; j < CLS; ++j)\n unkns += DETECT(bd[i][j],UNKN),\n\tmines += DETECT(bd[i][j],MINE),\n\tflags += DETECT(bd[i][j],FLAG);\n move(RWS,1), clrtoeol();\n pct = 0.5+100.0*(mines-flags)/MAX(1,unkns-flags);\n if (++hint<4)\n o[0] = HINTBIT(UNKN), o[1] = HINTBIT(MINE), o[2] = HINTBIT(FLAG),\n o[3] = HINTBIT(UNKN), o[4] = NEIGCNT(MINE), o[5] = NEIGCNT(FLAG);\n else\n memset(o,'?',sizeof(o));\n printw(\"(%c%c%c) u=%c, m=%c, f=%c, %d/%d (%d%%) remain.\",\n\t o[0],o[1],o[2],o[3],o[4],o[5],mines-flags,unkns-flags,pct);\n}\n#undef NEIGCNT\n#undef HINTBIT\n\nvoid toggleflag(void) {\n if (DETECT(ME,UNKN))\n TGL_BIT(ME,FLAG);\n}\nint sureflag(void) {\n toggleflag();\n return autoplay();\n}\nint play(int*win) {\n int c = getch(), d = tolower(c);\n if ('q' == d) return 0;\n else if ('?' == c) help();\n else if ('h' == d) col = MODDEC(col,CLS-1);\n else if ('l' == d) col = MODINC(col,CLS-1);\n else if ('k' == d) row = MODDEC(row,RWS-1);\n else if ('j' == d) row = MODINC(row,RWS-1);\n else if ('f' == c) toggleflag();\n else if ('s' == c) return *win = step();\n else if ('S' == c) return *win = autoplay();\n else if ('F' == c) return *win = sureflag();\n else if ('d' == d) dbg(row+1,col+1);\n return 1;\n}\n\nint convert(const char*name,const char*s) {\n if (strlen(s) == strspn(s,\"0123456789\"))\n return atoi(s);\n fprintf(stderr,\" use: %s [rows [columns [percentBombs]]]\\n\",name);\n fprintf(stderr,\"default: %s 20 30 25\\n\",name);\n exit(EXIT_SUCCESS);\n}\n\nvoid parse_command_line(int ac,char*av[],int*a,int*b,int*c) {\n switch (ac) {\n default:\n case 4: *c = convert(*av,av[3]);\n case 3: *b = convert(*av,av[2]);\n case 2: *a = convert(*av,av[1]);\n case 1: ;\n }\n}\n\nint main(int ac,char*av[],char*env[]) {\n int win = 1, rows = 20, cols = 30, prct = 25;\n parse_command_line(ac,av,&rows,&cols,&prct);\n populate(rows,cols,prct);\n takedisplay();\n while(draw(), play(&win));\n show(win);\n free(bd);\n# ifdef __unix__\n {\n const char*s = \"/bin/stty\";\n execl(s,s,\"sane\",(const char*)NULL);\n }\n# endif\n return 0;\n}\n","language":"C"},{"code":"#include <ncurses.h>\n#include <locale.h>\n#include <stdlib.h>\n\nint width = 0, height = 0;\nint mine_ratio = 10, n_mines;\nint reveal = 0;\n\nWINDOW *win, *wrap;\n\nenum {\n\tM_NONE = 0,\n\tM_CLEARED = 1 << 0,\n\tM_MARKED = 1 << 1,\n\tM_MINED = 1 << 2,\n\tM_BOMBED = 1 << 3,\n};\ntypedef struct { unsigned short flag, cnt; } mine_t;\n\n#define for_i for (int i = 0; i < height; i++)\n#define for_j for (int j = 0; j < width; j++)\nvoid init_mines(void * ptr)\n{\n\tmine_t (*m)[width] = ptr;\n\tfor_i for_j\n\t\tif (rand() % mine_ratio)\n\t\t\tm[i][j].flag = M_NONE;\n\t\telse {\n\t\t\tm[i][j].flag = M_MINED;\n\t\t\tn_mines ++;\n\t\t}\n\n\tfor_i for_j {\n\t\tm[i][j].cnt = 0;\n\t\tfor (int x = j - 1; x <= j + 1; x++) {\n\t\t\tif (x < 0 || x > width) continue;\n\t\t\tfor (int y = i - 1; y <= i + 1; y++) {\n\t\t\t\tif (y < 0 || y >= width) continue;\n\t\t\t\tm[i][j].cnt += 1 && (m[y][x].flag & M_MINED);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint mine_clear(void *ptr, int x, int y, int mass_clear)\n{\n\tmine_t (*m)[width] = ptr;\n\tunsigned short flag;\n\tif (x < 0 || x >= width || y < 0 || y >= height)\n\t\treturn 1;\n\tflag = m[y][x].flag;\n\n\tif (((flag & M_CLEARED) && 1) != mass_clear) return 1;\n\n\tif ((flag & M_MINED) && !(flag & M_MARKED)) {\n\t\tm[y][x].flag |= M_BOMBED;\n\t\treveal = 1;\n\t\treturn 0;\n\t}\n\n\tif (!(flag & M_MARKED))\n\t\tflag = (m[y][x].flag |= M_CLEARED);\n\n\tif (m[y][x].cnt && !mass_clear) return 1;\n\tif (flag & M_MARKED) return 1;\n\n\tfor (int i = y - 1; i <= y + 1; i++)\n\t\tfor (int j = x - 1; j <= x + 1; j++)\n\t\t\tif (!mine_clear(ptr, j, i, 0)) return 0;\n\treturn 1;\n}\n\nvoid mine_mark(void *ptr, int x, int y)\n{\n\tmine_t (*m)[width] = ptr;\n\tif (m[y][x].flag & M_CLEARED) return;\n\tif (m[y][x].flag & M_MARKED)\n\t\tn_mines ++;\n\telse\n\t\tn_mines --;\n\tm[y][x].flag ^= M_MARKED;\n}\n\nint check_wining(void *ptr)\n{\n\tmine_t (*m)[width] = ptr;\n\tint good = 1;\n\tfor_i for_j {\n\t\tint f = m[i][j].flag;\n\t\tif ((f & M_MINED) && !(f & M_MARKED)) {\n\t\t\tm[i][j].flag = M_BOMBED;\n\t\t\tgood = 0;\n\t\t}\n\t}\n\tmvwprintw(wrap, height + 1, 0, good ? \"All clear! \" : \"BOOM! \");\n\treveal = 1;\n\treturn good;\n}\n\nvoid repaint(void *ptr)\n{\n\tmine_t (*m)[width] = ptr, *p;\n\tbox(win, 0, 0);\n\tfor_i for_j {\n\t\tchar c;\n\t\tp = &m[i][j];\n\t\tint f = p->flag;\n\t\tif (reveal)\n\t\t\tc = (f & M_BOMBED) ? 'X' : (f & M_MINED) ? 'o' : ' ';\n\t\telse if (p->flag & M_BOMBED)\n\t\t\tc = 'X';\n\t\telse if (p->flag & M_MARKED)\n\t\t\tc = '?';\n\t\telse if (p->flag & M_CLEARED)\n\t\t\tc = p->cnt ? p->cnt + '0' : ' ';\n\t\telse\n\t\t\tc = '.';\n\t\tmvwprintw(win, i + 1, 2 * j + 1, \" %c\", c);\n\t}\n\tif (reveal);\n\telse if (n_mines)\n\t\tmvwprintw(wrap, height + 1, 0, \"Mines:%6d \", n_mines);\n\telse\n\t\tmvwprintw(wrap, height + 1, 0, \"Claim victory? \");\n\twrefresh(wrap);\n\twrefresh(win);\n}\n\nint main(int c, char **v)\n{\n\tMEVENT evt;\n\n\tprintf(\"%d\\n\", c);\n\n\tif (c >= 3) {\n\t\theight = atoi(v[1]);\n\t\twidth = atoi(v[2]);\n\t}\n\tif (height < 3) height = 15;\n\tif (width < 3) width = 30;\n\n\tinitscr();\n\tint mines[height][width];\n\tinit_mines(mines);\n\n\twin = newwin(height + 2, 2 * width + 2, 0, 0);\n\twrap = newwin(height + 3, 2 * width + 2, 1, 0);\n\n\tkeypad(wrap, 1);\n\tmousemask(BUTTON1_CLICKED | BUTTON2_CLICKED | BUTTON3_CLICKED, 0);\n\n\twhile (1) {\n\t\tint ch;\n\t\trepaint(mines);\n\t\tif ((ch = wgetch(wrap)) != KEY_MOUSE) {\n\t\t\tif (ch != 'r') break;\n\t\t\treveal = !reveal;\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (getmouse(&evt) != OK) continue;\n\n\t\tif ((evt.bstate & BUTTON1_CLICKED)) {\n\t\t\tif (evt.y == height + 2 && !n_mines) {\n\t\t\t\tcheck_wining(mines);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (!mine_clear(mines, (evt.x - 1) / 2, evt.y - 1, 0))\n\t\t\t\tbreak;\n\t\t}\n\t\telse if ((evt.bstate & BUTTON2_CLICKED)) {\n\t\t\tif (!mine_clear(mines, (evt.x - 1) / 2, evt.y - 1, 1))\n\t\t\t\tbreak;\n\t\t}\n\t\telse if ((evt.bstate & BUTTON3_CLICKED))\n\t\t\tmine_mark(mines, (evt.x - 1)/2, evt.y - 1);\n\t}\n\trepaint(mines);\n\n\tmousemask(0, 0);\n\tkeypad(wrap, 0);\n\tendwin();\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <string>\n#include <windows.h>\nusing namespace std;\ntypedef unsigned char byte;\n\nenum fieldValues : byte { OPEN, CLOSED = 10, MINE, UNKNOWN, FLAG, ERR };\n\nclass fieldData\n{\npublic:\n fieldData() : value( CLOSED ), open( false ) {}\n byte value;\n bool open, mine;\n};\n\nclass game\n{\npublic:\n ~game()\n { if( field ) delete [] field; }\n\n game( int x, int y )\n {\n go = false; wid = x; hei = y;\n\tfield = new fieldData[x * y];\n\tmemset( field, 0, x * y * sizeof( fieldData ) );\n\toMines = ( ( 22 - rand() % 11 ) * x * y ) / 100;\n\tmMines = 0;\n\tint mx, my, m = 0;\n\tfor( ; m < oMines; m++ )\n\t{\n\t do\n\t { mx = rand() % wid; my = rand() % hei; }\n\t while( field[mx + wid * my].mine );\n\t field[mx + wid * my].mine = true;\n\t}\n\tgraphs[0] = ' '; graphs[1] = '.'; graphs[2] = '*';\n\tgraphs[3] = '?'; graphs[4] = '!'; graphs[5] = 'X';\n }\n\t\n void gameLoop()\n {\n\tstring c, r, a;\n\tint col, row;\n\twhile( !go )\n\t{\n\t drawBoard();\n\t cout << \"Enter column, row and an action( c r a ):\\nActions: o => open, f => flag, ? => unknown\\n\";\n\t cin >> c >> r >> a;\n\t if( c[0] > 'Z' ) c[0] -= 32; if( a[0] > 'Z' ) a[0] -= 32;\n\t col = c[0] - 65; row = r[0] - 49;\n\t makeMove( col, row, a );\n\t}\n }\n\nprivate:\n void makeMove( int x, int y, string a )\n {\n\tfieldData* fd = &field[wid * y + x];\n\tif( fd->open && fd->value < CLOSED )\n\t{\n\t cout << \"This cell is already open!\";\n\t Sleep( 3000 ); return;\n\t}\n\tif( a[0] == 'O' ) openCell( x, y );\n\telse if( a[0] == 'F' )\n\t{\n\t fd->open = true;\n\t fd->value = FLAG;\n\t mMines++;\n\t checkWin();\n\t}\n\telse\n\t{\n\t fd->open = true;\n\t fd->value = UNKNOWN;\n\t}\n }\n\n bool openCell( int x, int y )\n {\n\tif( !isInside( x, y ) ) return false;\n\tif( field[x + y * wid].mine ) boom();\n\telse\n\t{\n\t if( field[x + y * wid].value == FLAG )\n\t {\n\t\tfield[x + y * wid].value = CLOSED;\n\t\tfield[x + y * wid].open = false;\n\t\tmMines--;\n\t }\n\t recOpen( x, y );\n\t checkWin();\n\t}\n\treturn true;\n }\n\n void drawBoard()\n {\n\tsystem( \"cls\" );\n\tcout << \"Marked mines: \" << mMines << \" from \" << oMines << \"\\n\\n\";\t\t\n\tfor( int x = 0; x < wid; x++ )\n\t cout << \" \" << ( char )( 65 + x ) << \" \";\n\tcout << \"\\n\"; int yy;\n\tfor( int y = 0; y < hei; y++ )\n\t{\n\t yy = y * wid;\n\t for( int x = 0; x < wid; x++ )\n\t\tcout << \"+---\";\n\n\t cout << \"+\\n\"; fieldData* fd;\n\t for( int x = 0; x < wid; x++ )\n\t {\n\t\tfd = &field[x + yy]; cout<< \"| \";\n\t\tif( !fd->open ) cout << ( char )graphs[1] << \" \";\n\t\telse\n\t\t{\n\t\t if( fd->value > 9 )\n\t\t\tcout << ( char )graphs[fd->value - 9] << \" \";\n\t\t else\n\t\t {\n\t\t\tif( fd->value < 1 ) cout << \" \";\n\t\t\t else cout << ( char )(fd->value + 48 ) << \" \";\n\t\t }\n\t\t}\n\t }\n\t cout << \"| \" << y + 1 << \"\\n\";\n\t}\n\tfor( int x = 0; x < wid; x++ )\n\t cout << \"+---\";\n\n\tcout << \"+\\n\\n\";\n }\n\n void checkWin()\n {\n\tint z = wid * hei - oMines, yy;\n\tfieldData* fd;\n\tfor( int y = 0; y < hei; y++ )\n\t{\n\t yy = wid * y;\n\t for( int x = 0; x < wid; x++ )\n\t {\n\t\tfd = &field[x + yy];\n\t\tif( fd->open && fd->value != FLAG ) z--;\n\t }\n\t}\n\tif( !z ) lastMsg( \"Congratulations, you won the game!\");\n }\n\n void boom()\n {\n\tint yy; fieldData* fd;\n\tfor( int y = 0; y < hei; y++ )\n\t{\n\t yy = wid * y;\n\t for( int x = 0; x < wid; x++ )\n\t {\n\t\tfd = &field[x + yy];\n\t\tif( fd->value == FLAG )\n\t\t{\n\t\t fd->open = true;\n\t\t fd->value = fd->mine ? MINE : ERR;\n\t\t}\n\t\telse if( fd->mine )\n\t\t{\n\t\t fd->open = true;\n\t\t fd->value = MINE;\n\t\t}\n\t }\n\t}\n\tlastMsg( \"B O O O M M M M M !\" );\n }\n\n void lastMsg( string s )\n {\n\tgo = true; drawBoard();\n\tcout << s << \"\\n\\n\";\n }\n\n bool isInside( int x, int y ) { return ( x > -1 && y > -1 && x < wid && y < hei ); }\n\n void recOpen( int x, int y )\n {\n\tif( !isInside( x, y ) || field[x + y * wid].open ) return;\n\tint bc = getMineCount( x, y );\n\tfield[x + y * wid].open = true;\n\tfield[x + y * wid].value = bc;\n\tif( bc ) return;\n\n\tfor( int yy = -1; yy < 2; yy++ )\n\t for( int xx = -1; xx < 2; xx++ )\n\t {\n\t\tif( xx == 0 && yy == 0 ) continue;\n\t\trecOpen( x + xx, y + yy );\n\t }\n }\n\n int getMineCount( int x, int y )\n {\n\tint m = 0;\n\tfor( int yy = -1; yy < 2; yy++ )\n\t for( int xx = -1; xx < 2; xx++ )\n\t {\n\t\tif( xx == 0 && yy == 0 ) continue;\n\t\tif( isInside( x + xx, y + yy ) && field[x + xx + ( y + yy ) * wid].mine ) m++;\n\t }\n\t\t\n\treturn m;\n }\n\t\n int wid, hei, mMines, oMines;\n fieldData* field; bool go;\n int graphs[6];\n};\n\nint main( int argc, char* argv[] )\n{\n srand( GetTickCount() );\n game g( 4, 6 ); g.gameLoop();\n return system( \"pause\" );\n}\n","language":"C++"},{"code":"using System;\nusing System.Drawing;\nusing System.Windows.Forms;\n\nclass MineFieldModel\n{\n public int RemainingMinesCount{\n get{\n var count = 0;\n ForEachCell((i,j)=>{\n if (Mines[i,j] && !Marked[i,j])\n count++;\n });\n return count;\n }\n }\n\n public bool[,] Mines{get; private set;}\n public bool[,] Opened{get;private set;}\n public bool[,] Marked{get; private set;}\n public int[,] Values{get;private set; }\n public int Width{ get{return Mines.GetLength(1);} }\n public int Height{ get{return Mines.GetLength(0);} }\n\n public MineFieldModel(bool[,] mines)\n {\n this.Mines = mines;\n this.Opened = new bool[Height, Width]; // filled with 'false' by default\n this.Marked = new bool[Height, Width];\n this.Values = CalculateValues();\n }\n\n private int[,] CalculateValues()\n {\n int[,] values = new int[Height, Width];\n ForEachCell((i,j) =>{\n var value = 0;\n ForEachNeighbor(i,j, (i1,j1)=>{\n if (Mines[i1,j1])\n value++;\n });\n values[i,j] = value;\n });\n return values;\n }\n\n // Helper method for iterating over cells\n public void ForEachCell(Action<int,int> action)\n {\n for (var i = 0; i < Height; i++)\n for (var j = 0; j < Width; j++)\n action(i,j);\n }\n\n // Helper method for iterating over cells' neighbors\n public void ForEachNeighbor(int i, int j, Action<int,int> action)\n {\n for (var i1 = i-1; i1 <= i+1; i1++)\n for (var j1 = j-1; j1 <= j+1; j1++)\n if (InBounds(j1, i1) && !(i1==i && j1 ==j))\n action(i1, j1);\n }\n\n private bool InBounds(int x, int y)\n {\n return y >= 0 && y < Height && x >=0 && x < Width;\n }\n\n public event Action Exploded = delegate{};\n public event Action Win = delegate{};\n public event Action Updated = delegate{};\n\n public void OpenCell(int i, int j){\n if(!Opened[i,j]){\n if (Mines[i,j])\n Exploded();\n else{\n OpenCellsStartingFrom(i,j);\n Updated();\n CheckForVictory();\n }\n }\n }\n\n void OpenCellsStartingFrom(int i, int j)\n {\n Opened[i,j] = true;\n ForEachNeighbor(i,j, (i1,j1)=>{\n if (!Mines[i1,j1] && !Opened[i1,j1] && !Marked[i1,j1])\n OpenCellsStartingFrom(i1, j1);\n });\n }\n\n void CheckForVictory(){\n int notMarked = 0;\n int wrongMarked = 0;\n ForEachCell((i,j)=>{\n if (Mines[i,j] && !Marked[i,j])\n notMarked++;\n if (!Mines[i,j] && Marked[i,j])\n wrongMarked++;\n });\n if (notMarked == 0 && wrongMarked == 0)\n Win();\n }\n\n public void Mark(int i, int j){\n if (!Opened[i,j])\n Marked[i,j] = true;\n Updated();\n CheckForVictory();\n }\n}\n\nclass MineFieldView: UserControl{\n public const int CellSize = 40;\n\n MineFieldModel _model;\n public MineFieldModel Model{\n get{ return _model; }\n set\n {\n _model = value;\n this.Size = new Size(_model.Width * CellSize+1, _model.Height * CellSize+2);\n }\n }\n\n public MineFieldView(){\n //Enable double-buffering to eliminate flicker\n this.SetStyle(ControlStyles.AllPaintingInWmPaint | ControlStyles.UserPaint | ControlStyles.DoubleBuffer,true);\n this.Font = new Font(FontFamily.GenericSansSerif, 14, FontStyle.Bold);\n\n this.MouseUp += (o,e)=>{\n Point cellCoords = GetCell(e.Location);\n if (Model != null)\n {\n if (e.Button == MouseButtons.Left)\n Model.OpenCell(cellCoords.Y, cellCoords.X);\n else if (e.Button == MouseButtons.Right)\n Model.Mark(cellCoords.Y, cellCoords.X);\n }\n };\n }\n\n Point GetCell(Point coords)\n {\n var rgn = ClientRectangle;\n var x = (coords.X - rgn.X)/CellSize;\n var y = (coords.Y - rgn.Y)/CellSize;\n return new Point(x,y);\n }\n\n static readonly Brush MarkBrush = new SolidBrush(Color.Blue);\n static readonly Brush ValueBrush = new SolidBrush(Color.Black);\n static readonly Brush UnexploredBrush = new SolidBrush(SystemColors.Control);\n static readonly Brush OpenBrush = new SolidBrush(SystemColors.ControlDark);\n\n\n protected override void OnPaint(PaintEventArgs e)\n {\n base.OnPaint(e);\n var g = e.Graphics;\n if (Model != null)\n {\n Model.ForEachCell((i,j)=>\n {\n var bounds = new Rectangle(j * CellSize, i * CellSize, CellSize, CellSize);\n if (Model.Opened[i,j])\n {\n g.FillRectangle(OpenBrush, bounds);\n if (Model.Values[i,j] > 0)\n {\n DrawStringInCenter(g, Model.Values[i,j].ToString(), ValueBrush, bounds);\n }\n }\n else\n {\n g.FillRectangle(UnexploredBrush, bounds);\n if (Model.Marked[i,j])\n {\n DrawStringInCenter(g, \"?\", MarkBrush, bounds);\n }\n var outlineOffset = 1;\n var outline = new Rectangle(bounds.X+outlineOffset, bounds.Y+outlineOffset, bounds.Width-2*outlineOffset, bounds.Height-2*outlineOffset);\n g.DrawRectangle(Pens.Gray, outline);\n }\n g.DrawRectangle(Pens.Black, bounds);\n });\n }\n\n }\n\n static readonly StringFormat FormatCenter = new StringFormat\n {\n LineAlignment = StringAlignment.Center,\n Alignment=StringAlignment.Center\n };\n\n void DrawStringInCenter(Graphics g, string s, Brush brush, Rectangle bounds)\n {\n PointF center = new PointF(bounds.X + bounds.Width/2, bounds.Y + bounds.Height/2);\n g.DrawString(s, this.Font, brush, center, FormatCenter);\n }\n\n}\n\nclass MineSweepForm: Form\n{\n\n MineFieldModel CreateField(int width, int height)\n{\n var field = new bool[height, width];\n int mineCount = (int)(0.2 * height * width);\n var rnd = new Random();\n while(mineCount > 0)\n {\n var x = rnd.Next(width);\n var y = rnd.Next(height);\n if (!field[y,x])\n {\n field[y,x] = true;\n mineCount--;\n }\n }\n return new MineFieldModel(field);\n }\n\n public MineSweepForm()\n {\n var model = CreateField(6, 4);\n var counter = new Label{ };\n counter.Text = model.RemainingMinesCount.ToString();\n var view = new MineFieldView\n {\n Model = model, BorderStyle = BorderStyle.FixedSingle,\n };\n var stackPanel = new FlowLayoutPanel\n {\n Dock = DockStyle.Fill,\n FlowDirection = FlowDirection.TopDown,\n Controls = {counter, view}\n };\n this.Controls.Add(stackPanel);\n model.Updated += delegate{\n view.Invalidate();\n counter.Text = model.RemainingMinesCount.ToString();\n };\n model.Exploded += delegate {\n MessageBox.Show(\"FAIL!\");\n Close();\n };\n model.Win += delegate {\n MessageBox.Show(\"WIN!\");\n view.Enabled = false;\n };\n\n }\n}\n\nclass Program\n{\n static void Main()\n {\n Application.Run(new MineSweepForm());\n }\n}\n","language":"C-sharp"},{"code":"import ceylon.random {\n\n\tDefaultRandom\n}\n\nclass Cell() {\n\t\n\tshared variable Boolean covered = true;\n\tshared variable Boolean flagged = false;\n\tshared variable Boolean mined = false;\n\tshared variable Integer adjacentMines = 0;\n\t\n\tstring =>\n\t\t\tif (covered && !flagged)\n\t\t\tthen \".\"\n\t\t\telse if (covered && flagged)\n\t\t\tthen \"?\"\n\t\t\telse if (!covered && mined)\n\t\t\tthen \"X\"\n\t\t\telse if (!covered && adjacentMines > 0)\n\t\t\tthen adjacentMines.string\n\t\t\telse \" \";\n}\n\n\"The main function of the module. Run this one.\"\nshared void run() {\n\t\n\tvalue random = DefaultRandom();\n\tvalue chanceOfBomb = 0.2;\n\t\n\tvalue width = 6;\n\tvalue height = 4;\n\t\n\tvalue grid = Array { for (j in 1..height) Array { for (i in 1..width) Cell() } };\n\t\n\tfunction getCell(Integer x, Integer y) => grid[y]?.get(x);\n\t\n\tvoid initializeGrid() {\n\t\t\n\t\tfor (row in grid) {\n\t\t\tfor (cell in row) {\n\t\t\t\tcell.covered = true;\n\t\t\t\tcell.flagged = false;\n\t\t\t\tcell.mined = random.nextFloat() < chanceOfBomb;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfunction countAdjacentMines(Integer x, Integer y) => count {\n\t\t\tfor (j in y - 1 .. y + 1)\n\t\t\tfor (i in x - 1 .. x + 1)\n\t\t\tif (exists cell = getCell(i, j))\n\t\t\tcell.mined\n\t\t};\n\t\t\n\t\tfor (j->row in grid.indexed) {\n\t\t\tfor (i->cell in row.indexed) {\n\t\t\t\tcell.adjacentMines = countAdjacentMines(i, j);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvoid displayGrid() {\n\t\tprint(\" \" + \"\".join(1..width));\n\t\tprint(\" \" + \"-\".repeat(width));\n\t\tfor (j->row in grid.indexed) {\n\t\t\tprint(\"``j + 1``|``\"\".join(row)``|``j + 1``\");\n\t\t}\n\t\tprint(\" \" + \"-\".repeat(width));\n\t\tprint(\" \" + \"\".join(1..width));\n\t}\n\t\n\tBoolean won() =>\n\t\texpand(grid).every((cell) => (cell.flagged && cell.mined) || (!cell.flagged && !cell.mined));\n\n\tvoid uncoverNeighbours(Integer x, Integer y) {\n\t\tfor (j in y - 1 .. y + 1) {\n\t\t\tfor (i in x - 1 .. x + 1) {\n\t\t\t\tif (exists cell = getCell(i, j), cell.covered, !cell.flagged, !cell.mined) {\n\t\t\t\t\tcell.covered = false;\n\t\t\t\t\tif (cell.adjacentMines == 0) {\n\t\t\t\t\t\tuncoverNeighbours(i, j);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\twhile (true) {\n\t\tprint(\"Welcome to minesweeper!\n\t\t -----------------------\");\n\t\tinitializeGrid();\n\t\twhile (true) {\n\t\t\tdisplayGrid();\n\t\t\tprint(\"\n\t\t\t The number of mines to find is ``count(expand(grid)*.mined)``.\n\t\t\t What would you like to do?\n\t\t\t [1] reveal a free space (or blow yourself up)\n\t\t\t [2] mark (or unmark) a mine\");\n\t\t\tassert (exists instruction = process.readLine());\n\t\t\tprint(\"Please enter the coordinates. eg 2 4\");\n\t\t\tassert (exists line2 = process.readLine());\n\t\t\tvalue coords = line2.split().map(Integer.parse).narrow<Integer>().sequence();\n\t\t\tif (exists x = coords[0], exists y = coords[1], exists cell = getCell(x - 1, y - 1)) {\n\t\t\t\tswitch (instruction)\n\t\t\t\tcase (\"1\") {\n\t\t\t\t\tif (cell.mined) {\n\t\t\t\t\t\tprint(\"=================\n\t\t\t\t\t\t === You lose! ===\n\t\t\t\t\t\t =================\");\n\t\t\t\t\t\texpand(grid).each((cell) => cell.covered = false);\n\t\t\t\t\t\tdisplayGrid();\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\telse if (cell.covered) {\n\t\t\t\t\t\tcell.covered = false;\n\t\t\t\t\t\tuncoverNeighbours(x - 1, y - 1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcase (\"2\") {\n\t\t\t\t\tif (cell.covered) {\n\t\t\t\t\t\tcell.flagged = !cell.flagged;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse { print(\"bad choice\"); }\n\t\t\t\tif (won()) {\n\t\t\t\t\tprint(\"****************\n\t\t\t\t\t *** You win! ***\n\t\t\t\t\t ****************\");\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n","language":"Ceylon"},{"code":"(defn take-random [n coll]\n (->> (repeatedly #(rand-nth coll))\n distinct\n (take n ,)))\n\n(defn postwalk-fs\n \"Depth first post-order traversal of form, apply successive fs at each level.\n (f1 (map f2 [..]))\"\n [[f & fs] form]\n (f\n (if (and (seq fs) (coll? form))\n (into (empty form) (map (partial postwalk-fs fs) form))\n form)))\n\n(defn neighbors [x y n m pred]\n (for [dx (range (Math/max 0 (dec x)) (Math/min n (+ 2 x)))\n\tdy (range (Math/max 0 (dec y)) (Math/min m (+ 2 y)))\n\t:when (pred dx dy)]\n [dx dy]))\n\n(defn new-game [n m density]\n (let [mines (set (take-random (Math/floor (* n m density)) (range (* n m))))]\n (->> (for [y (range m)\n\t x (range n)\n\t :let [neighbor-mines (count (neighbors x y n m #(mines (+ %1 (* %2 n)))))]]\n\t (#(if (mines (+ (* y n) x)) (assoc % :mine true) %) {:value neighbor-mines}))\n\t (partition n ,)\n\t (postwalk-fs [vec vec] ,))))\n\n(defn display [board]\n (postwalk-fs [identity println #(condp % nil\n\t\t\t\t :marked \\?\n\t\t\t\t :opened (:value %)\n\t\t\t\t \\.)] board))\n\n(defn boom [{board :board}]\n (postwalk-fs [identity println #(if (:mine %) \\* (:value %))] board)\n true)\n\n(defn open* [board [[x y] & rest]]\n (if-let [value (get-in board [y x :value])] ; if nil? value -> nil? x -> nil? queue\n (recur\n (assoc-in board [y x :opened] true)\n (if (pos? value)\n rest\n (concat rest\n\t (neighbors x y (count (first board)) (count board)\n\t\t\t #(not (get-in board [%2 %1 :opened]))))))\n board))\n\n(defn open [board x y]\n (let [x (dec x), y (dec y)]\n (condp (get-in board [y x]) nil\n :mine {:boom true :board board}\n :opened board\n (open* board [[x y]]))))\n\n(defn mark [board x y]\n (let [x (dec x), y (dec y)]\n (assoc-in board [y x :marked] (not (get-in board [y x :marked])))))\n\n(defn done? [board]\n (if (:boom board)\n (boom board)\n (do (display board)\n\t(->> (flatten board)\n\t (remove :mine ,)\n\t (every? :opened ,)))))\n\n(defn play [n m density]\n (let [board (new-game n m density)]\n (println [:mines (count (filter :mine (flatten board)))])\n (loop [board board]\n (when-not (done? board)\n\t(print \">\")\n\t(let [[cmd & xy] (.split #\" \" (read-line))\n\t [x y] (map #(Integer. %) xy)]\n\t (recur ((if (= cmd \"mark\") mark open) board x y)))))))\n","language":"Clojure"},{"code":"(defclass minefield ()\n ((mines :initform (make-hash-table :test #'equal))\n (width :initarg :width)\n (height :initarg :height)\n (grid :initarg :grid)))\n\n(defun make-minefield (width height num-mines)\n (let ((minefield (make-instance 'minefield\n :width width\n :height height\n :grid (make-array\n (list width height)\n :initial-element #\\.)))\n (mine-count 0))\n (with-slots (grid mines) minefield\n (loop while (< mine-count num-mines)\n do (let ((coords (list (random width) (random height))))\n (unless (gethash coords mines)\n (setf (gethash coords mines) T)\n (incf mine-count))))\n minefield)))\n\n(defun print-field (minefield)\n (with-slots (width height grid) minefield\n (dotimes (y height)\n (dotimes (x width)\n (princ (aref grid x y)))\n (format t \"~%\"))))\n\n(defun mine-list (minefield)\n (loop for key being the hash-keys of (slot-value minefield 'mines) collect key))\n\n(defun count-nearby-mines (minefield coords)\n (length (remove-if-not\n (lambda (mine-coord)\n (and\n (> 2 (abs (- (car coords) (car mine-coord))))\n (> 2 (abs (- (cadr coords) (cadr mine-coord))))))\n (mine-list minefield))))\n\n(defun clear (minefield coords)\n (with-slots (mines grid) minefield\n (if (gethash coords mines)\n (progn\n (format t \"MINE! You lose.~%\")\n (dolist (mine-coords (mine-list minefield))\n (setf (aref grid (car mine-coords) (cadr mine-coords)) #\\x))\n (setf (aref grid (car coords) (cadr coords)) #\\X)\n nil)\n (setf (aref grid (car coords) (cadr coords))\n (elt \" 123456789\"(count-nearby-mines minefield coords))))))\n\n(defun mark (minefield coords)\n (with-slots (mines grid) minefield\n (setf (aref grid (car coords) (cadr coords)) #\\?)))\n\n(defun win-p (minefield)\n (with-slots (width height grid mines) minefield\n (let ((num-uncleared 0))\n (dotimes (y height)\n (dotimes (x width)\n (let ((square (aref grid x y)))\n (when (member square '(#\\. #\\?) :test #'char=)\n (incf num-uncleared)))))\n (= num-uncleared (hash-table-count mines)))))\n\n(defun play-game ()\n (let ((minefield (make-minefield 6 4 5)))\n (format t \"Greetings player, there are ~a mines.~%\"\n (hash-table-count (slot-value minefield 'mines)))\n (loop\n (print-field minefield)\n (format t \"Enter your command, examples: \\\"clear 0 1\\\" \\\"mark 1 2\\\" \\\"quit\\\".~%\")\n (princ \"> \")\n (let ((user-command (read-from-string (format nil \"(~a)\" (read-line)))))\n (format t \"Your command: ~a~%\" user-command)\n (case (car user-command)\n (quit (return-from play-game nil))\n (clear (unless (clear minefield (cdr user-command))\n (print-field minefield)\n (return-from play-game nil)))\n (mark (mark minefield (cdr user-command))))\n (when (win-p minefield)\n (format t \"Congratulations, you've won!\")\n (return-from play-game T))))))\n\n(play-game)\n","language":"Common-Lisp"},{"code":"len cell[] 56\nlen cnt[] 56\nlen flag[] 56\n#\nsubr initvars\n state = 0\n ticks = 0\n indx = -1\n no_time = 0\n.\nfunc getind r c .\n ind = -1\n if r >= 0 and r <= 6 and c >= 0 and c <= 7\n ind = r * 8 + c + 1\n .\n return ind\n.\nproc draw_cell ind h . .\n ind -= 1\n r = ind div 8\n c = ind mod 8\n x = c * 12 + 2.5\n y = r * 12 + 2.5\n move x y\n rect 11 11\n if h > 0\n # count\n move x + 3 y + 3\n color 000\n text h\n elif h = -3\n # flag\n x += 4\n color 000\n linewidth 0.8\n move x y + 3\n line x y + 8\n color 600\n linewidth 2\n move x + 0.5 y + 7\n line x + 2 y + 7\n elif h <> 0\n # mine\n color 333\n if h = -2\n color 800\n .\n move x + 5 y + 5\n circle 3\n line x + 8 y + 9\n .\n.\nproc open ind . .\n if ind <> -1 and cell[ind] = 0\n cell[ind] = 2\n flag[ind] = 0\n color 686\n draw_cell ind cnt[ind]\n if cnt[ind] = 0\n ind -= 1\n r0 = ind div 8\n c0 = ind mod 8\n for r = r0 - 1 to r0 + 1\n for c = c0 - 1 to c0 + 1\n if r <> r0 or c <> c0\n open getind r c\n .\n .\n .\n .\n .\n.\nproc show_mines m . .\n for ind to 56\n if cell[ind] = 1\n color 686\n if m = -1\n color 353\n .\n draw_cell ind m\n .\n .\n.\nproc outp col s$ . .\n move 2.5 87\n color col\n rect 59 11\n color 000\n move 5 90\n text s$\n.\nproc upd_info . .\n for i to 56\n nm += flag[i]\n if cell[i] < 2\n nc += 1\n .\n .\n if nc = 8\n outp 484 \"Well done\"\n show_mines -1\n state = 1\n else\n outp 464 8 - nm & \" mines left\"\n .\n.\nproc test ind . .\n if cell[ind] < 2 and flag[ind] = 0\n if cell[ind] = 1\n show_mines -1\n color 686\n draw_cell ind -2\n outp 844 \"B O O M !\"\n state = 1\n else\n open ind\n upd_info\n .\n .\n.\nbackground 676\nproc start . .\n clear\n color 353\n for ind to 56\n cnt[ind] = 0\n cell[ind] = 0\n flag[ind] = 0\n draw_cell ind 0\n .\n n = 8\n while n > 0\n c = randint 8 - 1\n r = randint 7 - 1\n ind = r * 8 + c + 1\n if cell[ind] = 0\n n -= 1\n cell[ind] = 1\n for rx = r - 1 to r + 1\n for cx = c - 1 to c + 1\n ind = getind rx cx\n if ind > -1\n cnt[ind] += 1\n .\n .\n .\n .\n .\n initvars\n outp 464 \"\"\n textsize 4\n move 5 93\n text \"Minesweeper - 8 mines\"\n move 5 88.2\n text \"Long-press for flagging\"\n textsize 6\n timer 0\n.\non mouse_down\n if state = 0\n if mouse_y > 86 and mouse_x > 60\n no_time = 1\n move 64.5 87\n color 464\n rect 33 11\n .\n indx = getind ((mouse_y - 2) div 12) ((mouse_x - 2) div 12)\n ticks0 = ticks\n elif state = 3\n start\n .\n.\non mouse_up\n if state = 0 and indx <> -1\n test indx\n .\n indx = -1\n.\non timer\n if state = 1\n state = 2\n timer 1\n elif state = 2\n state = 3\n elif no_time = 0 and ticks > 3000\n outp 844 \"B O O M !\"\n show_mines -2\n state = 2\n timer 1\n else\n if indx > 0 and ticks = ticks0 + 2\n if cell[indx] < 2\n color 353\n flag[indx] = 1 - flag[indx]\n opt = 0\n if flag[indx] = 1\n opt = -3\n .\n draw_cell indx opt\n upd_info\n .\n indx = -1\n .\n if no_time = 0 and ticks mod 10 = 0\n move 64.5 87\n color 464\n if ticks >= 2500\n color 844\n .\n rect 33 11\n color 000\n move 66 90\n text \"Time:\" & 300 - ticks / 10\n .\n ticks += 1\n timer 0.1\n .\n.\nstart\n","language":"EasyLang"},{"code":"'--- Declaration of global variables ---\nType mina\n Dim mina As Byte\n Dim flag As Byte\n Dim ok As Byte\n Dim numero As Byte\nEnd Type\n\nDim Shared As Integer size = 16, NX = 20, NY = 20\nDim Shared As Double mina = 0.10\n\nDim Shared tablero(NX+1,NY+1) As mina\nDim Shared As Integer GameOver, ddx, ddy, kolor, nbDESCANSO\nDim Shared As Double temps\nDim As String tecla\n\n'--- SUBroutines and FUNCtions ---\nSub VerTodo\n Dim As Integer x, y\n For x = 1 To NX\n For y = 1 To NY\n With tablero(x,y)\n If .mina = 1 Or .flag > 0 Then .ok = 1\n End With\n Next y\n Next x\nEnd Sub\n\nSub ShowGrid\n Dim As Integer x, y\n Line(ddx-1,ddy-1)-(1+ddx+size*NX,1+ddy+size*NY),&hFF0000,B\n For x = 1 To NX\n For y = 1 To NY\n With tablero(x,y)\n 'Si la casilla no se hace click\n If .ok = 0 Then\n Line(ddx+x*size,ddy+y*size)-(ddx+(x-1)*size,ddy+(y-1)*size),&h888888,BF\n Line(ddx+x*size,ddy+y*size)-(ddx+(x-1)*size,ddy+(y-1)*size),&h444444,B\n 'bandera verde\n If .flag = 1 Then\n Circle (ddx+x*size-size/2,ddy+y*size-size/2),size/4,&h00FF00,,,,F\n Circle (ddx+x*size-size/2,ddy+y*size-size/2),size/4,&h0\n End If\n 'bandera azul\n If .flag = 2 Then\n Circle (ddx+x*size-size/2,ddy+y*size-size/2),size/4,&h0000FF,,,,F\n Circle (ddx+x*size-size/2,ddy+y*size-size/2),size/4,&h0\n End If\n 'Si se hace clic\n Else\n If .mina = 0 Then\n If .numero > 0 Then\n Select Case .numero\n Case 1: kolor = &h3333FF\n Case 2: kolor = &h33FF33\n Case 3: kolor = &hFF3333\n Case 4: kolor = &hFFFF33\n Case 5: kolor = &h33FFFF\n Case 6: kolor = &hFF33FF\n Case 7: kolor = &h999999\n Case 8: kolor = &hFFFFFF\n End Select\n Draw String(ddx+x*size-size/1.5,ddy+y*size-size/1.5),Str(.numero),kolor\n End If\n If GameOver = 1 Then\n 'Si no hay Mina y una bandera verde >> rojo completo\n If .flag = 1 Then\n Circle (ddx+x*size-size/2,ddy+y*size-size/2),size/4,&h330000,,,,F\n Circle (ddx+x*size-size/2,ddy+y*size-size/2),size/4,&h555555\n End If\n 'Si no hay Mina y una bandera azul >> azul oscuro\n If .flag = 2 Then\n Circle (ddx+x*size-size/2,ddy+y*size-size/2),size/4,&h000033,,,,F\n Circle (ddx+x*size-size/2,ddy+y*size-size/2),size/4,&h555555\n End If\n End If\n Else\n 'Si hay una Mina sin bandera >> rojo\n If .flag = 0 Then\n Circle (ddx+x*size-size/2,ddy+y*size-size/2),size/4,&hFF0000,,,,F\n Circle (ddx+x*size-size/2,ddy+y*size-size/2),size/4,&hFFFF00\n Else\n 'Si hay una Mina con bandera verde >>> verde\n If .flag = 1 Then\n Circle (ddx+x*size-size/2,ddy+y*size-size/2),size/4,&h00FF00,,,,F\n Circle (ddx+x*size-size/2,ddy+y*size-size/2),size/4,&hFFFF00\n End If\n If .flag = 2 Then\n 'Si hay una Mina con bandera azul >>>> verde oscuro\n Circle (ddx+x*size-size/2,ddy+y*size-size/2),size/4,&h003300,,,,F\n Circle (ddx+x*size-size/2,ddy+y*size-size/2),size/4,&hFFFF00\n End If\n End If\n End If\n End If\n End With\n Next y\n Next x\nEnd Sub\n\nSub Calcul\n Dim As Integer x, y\n For x = 1 To NX\n For y = 1 To NY\n tablero(x,y).numero = _\n Iif(tablero(x+1,y).mina=1,1,0) + Iif(tablero(x-1,y).mina=1,1,0) + _\n Iif(tablero(x,y+1).mina=1,1,0) + Iif(tablero(x,y-1).mina=1,1,0) + _\n Iif(tablero(x+1,y-1).mina=1,1,0) + Iif(tablero(x+1,y+1).mina=1,1,0) + _\n Iif(tablero(x-1,y-1).mina=1,1,0) + Iif(tablero(x-1,y+1).mina=1,1,0)\n Next y\n Next x\nEnd Sub\n\nSub Inicio\n size = 20\n If NX > 720/size Then size = 720/NX\n If NY > 520/size Then size = 520/NY\n\n Redim tablero(NX+1,NY+1) As mina\n Dim As Integer x, y\n For x = 1 To NX\n For y = 1 To NY\n With tablero(x,y)\n .mina = Iif(Rnd > (1-mina), 1, 0)\n .ok = 0\n .flag = 0\n .numero = 0\n End With\n Next y\n Next x\n ddx = (((800/size)-NX)/2)*size\n ddy = (((600/size)-NY)/2)*size\n Calcul\nEnd Sub\n\nFunction isGameOver As Integer\n Dim As Integer x, y, nbMINA, nbOK, nbAZUL, nbVERT\n For x = 1 To NX\n For y = 1 To NY\n If tablero(x,y).ok = 1 And tablero(X,y).mina = 1 Then\n Return -1\n End If\n If tablero(x,y).ok = 0 And tablero(x,y).flag = 1 And tablero(X,y).mina = 1 Then\n nbOK += 1\n End If\n If tablero(X,y).mina = 1 Then\n nbMINA + =1\n End If\n If tablero(X,y).flag = 2 Then\n nbAZUL += 1\n 'End If\n Elseif tablero(X,y).flag = 1 Then\n nbVERT += 1\n End If\n Next y\n Next x\n\n If nbMINA = nbOK And nbAZUL = 0 Then Return 1\n nbDESCANSO = nbMINA - nbVERT\nEnd Function\n\nSub ClicRecursivo(ZX As Integer, ZY As Integer)\n If tablero(ZX,ZY).ok = 1 Then Exit Sub\n If tablero(ZX,ZY).flag > 0 Then Exit Sub\n 'CLICK\n tablero(ZX,ZY).ok = 1\n\n If tablero(ZX,ZY).mina = 1 Then Exit Sub\n If tablero(ZX,ZY).numero > 0 Then Exit Sub\n\n If ZX > 0 And ZX <= NX And ZY > 0 And ZY <= NY Then\n ClicRecursivo(ZX+1,ZY)\n ClicRecursivo(ZX-1,ZY)\n ClicRecursivo(ZX,ZY+1)\n ClicRecursivo(ZX,ZY-1)\n ClicRecursivo(ZX+1,ZY+1)\n ClicRecursivo(ZX+1,ZY-1)\n ClicRecursivo(ZX-1,ZY+1)\n ClicRecursivo(ZX-1,ZY-1)\n End If\nEnd Sub\n\n\n'--- Main Program ---\nScreenres 800,600,24\nWindowtitle\"Minesweeper game\"\nRandomize Timer\nCls\nDim As Integer mx, my, mb, fmb, ZX, ZY, r, tt\nDim As Double t\nInicio\nGameOver = 1\nDo\n tecla = Inkey\n If GameOver = 1 Then\n Select Case Ucase(tecla)\n Case Chr(Asc(\"X\"))\n NX += 5\n If NX > 80 Then NX = 10\n Inicio\n Case Chr(Asc(\"Y\"))\n NY += 5\n If NY > 60 Then NY = 10\n Inicio\n Case Chr(Asc(\"M\"))\n mina += 0.01\n If mina > 0.26 Then mina = 0.05\n Inicio\n Case Chr(Asc(\"S\"))\n Inicio\n GameOver = 0\n temps = Timer\n End Select\n End If\n\n Getmouse mx,my,,mb\n mx -= ddx-size\n my -= ddy-size\n ZX = (MX-size/2)/size\n ZY = (MY-size/2)/size\n\n If GameOver = 0 And zx > 0 And zx <= nx And zy > 0 And zy <= ny Then\n If MB=1 And fmb=0 Then ClicRecursivo(ZX,ZY)\n If MB=2 And fmb=0 Then\n tablero(ZX,ZY).flag += 1\n If tablero(ZX,ZY).flag > 2 Then tablero(ZX,ZY).flag = 0\n End If\n fmb = mb\n End If\n\n r = isGameOver\n If r = -1 And GameOver = 0 Then\n VerTodo\n GameOver = 1\n End If\n If r = 1 And GameOver = 0 Then GameOver = 1\n If GameOver = 0 Then tt = Timer-temps\n\n Screenlock\n Cls\n ShowGrid\n If GameOver = 0 Then\n Draw String (210,4), \"X:\" & NX & \" Y:\" & NY & \" MINA:\" & Int(mina*100) & \"% TIMER : \" & Int(TT) & \" S REMAINING:\" & nbDESCANSO,&hFFFF00\n Else\n Draw String (260,4), \"PRESS: 'S' TO START X,Y,M TO SIZE\" ,&hFFFF00\n Draw String (330,17), \"X:\" & NX & \" Y:\" & NY & \" MINA:\" & Int(mina*100) & \"%\" ,&hFFFF00\n If r = 1 Then\n t += 0.01\n If t > 1000 Then t = 0\n Draw String (320,280+Cos(t)*100),\"!! CONGRATULATION !!\",&hFFFF00\n End If\n End If\n Screenunlock\nLoop Until tecla = Chr(27)\nBsave \"Minesweeper.bmp\",0\nEnd\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"bufio\"\n \"fmt\"\n \"math\"\n \"math/rand\"\n \"os\"\n \"strconv\"\n \"strings\"\n \"time\"\n)\n\ntype cell struct {\n isMine bool\n display byte // display character for cell\n}\n\nconst lMargin = 4\n\nvar (\n grid [][]cell\n mineCount int\n minesMarked int\n isGameOver bool\n)\n\nvar scanner = bufio.NewScanner(os.Stdin)\n\nfunc makeGrid(n, m int) {\n if n <= 0 || m <= 0 {\n panic(\"Grid dimensions must be positive.\")\n }\n grid = make([][]cell, n)\n for i := 0; i < n; i++ {\n grid[i] = make([]cell, m)\n for j := 0; j < m; j++ {\n grid[i][j].display = '.'\n }\n }\n min := int(math.Round(float64(n*m) * 0.1)) // 10% of tiles\n max := int(math.Round(float64(n*m) * 0.2)) // 20% of tiles\n mineCount = min + rand.Intn(max-min+1)\n rm := mineCount\n for rm > 0 {\n x, y := rand.Intn(n), rand.Intn(m)\n if !grid[x][y].isMine {\n rm--\n grid[x][y].isMine = true\n }\n }\n minesMarked = 0\n isGameOver = false\n}\n\nfunc displayGrid(isEndOfGame bool) {\n if !isEndOfGame {\n fmt.Println(\"Grid has\", mineCount, \"mine(s),\", minesMarked, \"mine(s) marked.\")\n }\n margin := strings.Repeat(\" \", lMargin)\n fmt.Print(margin, \" \")\n for i := 1; i <= len(grid); i++ {\n fmt.Print(i)\n }\n fmt.Println()\n fmt.Println(margin, strings.Repeat(\"-\", len(grid)))\n for y := 0; y < len(grid[0]); y++ {\n fmt.Printf(\"%*d:\", lMargin, y+1)\n for x := 0; x < len(grid); x++ {\n fmt.Printf(\"%c\", grid[x][y].display)\n }\n fmt.Println()\n }\n}\n\nfunc endGame(msg string) {\n isGameOver = true\n fmt.Println(msg)\n ans := \"\"\n for ans != \"y\" && ans != \"n\" {\n fmt.Print(\"Another game (y/n)? : \")\n scanner.Scan()\n ans = strings.ToLower(scanner.Text())\n }\n if scanner.Err() != nil || ans == \"n\" {\n return\n }\n makeGrid(6, 4)\n displayGrid(false)\n}\n\nfunc resign() {\n found := 0\n for y := 0; y < len(grid[0]); y++ {\n for x := 0; x < len(grid); x++ {\n if grid[x][y].isMine {\n if grid[x][y].display == '?' {\n grid[x][y].display = 'Y'\n found++\n } else if grid[x][y].display != 'x' {\n grid[x][y].display = 'N'\n }\n }\n }\n }\n displayGrid(true)\n msg := fmt.Sprint(\"You found \", found, \" out of \", mineCount, \" mine(s).\")\n endGame(msg)\n}\n\nfunc usage() {\n fmt.Println(\"h or ? - this help,\")\n fmt.Println(\"c x y - clear cell (x,y),\")\n fmt.Println(\"m x y - marks (toggles) cell (x,y),\")\n fmt.Println(\"n - start a new game,\")\n fmt.Println(\"q - quit/resign the game,\")\n fmt.Println(\"where x is the (horizontal) column number and y is the (vertical) row number.\\n\")\n}\n\nfunc markCell(x, y int) {\n if grid[x][y].display == '?' {\n minesMarked--\n grid[x][y].display = '.'\n } else if grid[x][y].display == '.' {\n minesMarked++\n grid[x][y].display = '?'\n }\n}\n\nfunc countAdjMines(x, y int) int {\n count := 0\n for j := y - 1; j <= y+1; j++ {\n if j >= 0 && j < len(grid[0]) {\n for i := x - 1; i <= x+1; i++ {\n if i >= 0 && i < len(grid) {\n if grid[i][j].isMine {\n count++\n }\n }\n }\n }\n }\n return count\n}\n\nfunc clearCell(x, y int) bool {\n if x >= 0 && x < len(grid) && y >= 0 && y < len(grid[0]) {\n if grid[x][y].display == '.' {\n if !grid[x][y].isMine {\n count := countAdjMines(x, y)\n if count > 0 {\n grid[x][y].display = string(48 + count)[0]\n } else {\n grid[x][y].display = ' '\n clearCell(x+1, y)\n clearCell(x+1, y+1)\n clearCell(x, y+1)\n clearCell(x-1, y+1)\n clearCell(x-1, y)\n clearCell(x-1, y-1)\n clearCell(x, y-1)\n clearCell(x+1, y-1)\n }\n } else {\n grid[x][y].display = 'x'\n fmt.Println(\"Kaboom! You lost!\")\n return false\n }\n }\n }\n return true\n}\n\nfunc testForWin() bool {\n isCleared := false\n if minesMarked == mineCount {\n isCleared = true\n for x := 0; x < len(grid); x++ {\n for y := 0; y < len(grid[0]); y++ {\n if grid[x][y].display == '.' {\n isCleared = false\n }\n }\n }\n }\n if isCleared {\n fmt.Println(\"You won!\")\n }\n return isCleared\n}\n\nfunc splitAction(action string) (int, int, bool) {\n fields := strings.Fields(action)\n if len(fields) != 3 {\n return 0, 0, false\n }\n x, err := strconv.Atoi(fields[1])\n if err != nil || x < 1 || x > len(grid) {\n return 0, 0, false\n }\n y, err := strconv.Atoi(fields[2])\n if err != nil || y < 1 || y > len(grid[0]) {\n return 0, 0, false\n }\n return x, y, true\n}\n\nfunc main() {\n rand.Seed(time.Now().UnixNano())\n usage()\n makeGrid(6, 4)\n displayGrid(false)\n for !isGameOver {\n fmt.Print(\"\\n>\")\n scanner.Scan()\n action := strings.ToLower(scanner.Text())\n if scanner.Err() != nil || len(action) == 0 {\n continue\n }\n switch action[0] {\n case 'h', '?':\n usage()\n case 'n':\n makeGrid(6, 4)\n displayGrid(false)\n case 'c':\n x, y, ok := splitAction(action)\n if !ok {\n continue\n }\n if clearCell(x-1, y-1) {\n displayGrid(false)\n if testForWin() {\n resign()\n }\n } else {\n resign()\n }\n case 'm':\n x, y, ok := splitAction(action)\n if !ok {\n continue\n }\n markCell(x-1, y-1)\n displayGrid(false)\n if testForWin() {\n resign()\n }\n case 'q':\n resign()\n }\n }\n}\n","language":"Go"},{"code":"{-# LANGUAGE TemplateHaskell #-}\n\nmodule MineSweeper\n ( Board\n , Cell(..)\n , CellState(..)\n , Pos\n -- lenses / prisms\n , pos\n , coveredLens\n , coveredFlaggedLens\n , coveredMinedLens\n , xCoordLens\n , yCoordLens\n -- Functions\n , emptyBoard\n , groupedByRows\n , displayCell\n , isLoss\n , isWin\n , exposeMines\n , openCell\n , flagCell\n , mineBoard\n , totalRows\n , totalCols )\nwhere\n\nimport Control.Lens ((%~), (&), (.~), (^.), (^?), Lens', Traversal', _1, _2,\n anyOf, filtered, folded, lengthOf, makeLenses, makePrisms,\n preview, to, view)\nimport Data.List (find, groupBy, nub, delete, sortBy)\nimport Data.Maybe (isJust)\nimport System.Random (getStdGen, getStdRandom, randomR, randomRs)\n\ntype Pos = (Int, Int)\ntype Board = [Cell]\n\ndata CellState = Covered { _mined :: Bool, _flagged :: Bool }\n | UnCovered { _mined :: Bool }\n deriving (Show, Eq)\n\ndata Cell = Cell\n { _pos :: Pos\n , _state :: CellState\n , _cellId :: Int\n , _adjacentMines :: Int }\n deriving (Show, Eq)\n\nmakePrisms ''CellState\nmakeLenses ''CellState\nmakeLenses ''Cell\n\n-- Re-useable lens.\ncoveredLens :: Traversal' Cell (Bool, Bool) --'\ncoveredLens = state . _Covered\n\ncoveredMinedLens, coveredFlaggedLens, unCoveredLens :: Traversal' Cell Bool --'\ncoveredMinedLens = coveredLens . _1\ncoveredFlaggedLens = coveredLens . _2\nunCoveredLens = state . _UnCovered\n\nxCoordLens, yCoordLens :: Lens' Cell Int --'\nxCoordLens = pos . _1\nyCoordLens = pos . _2\n\n-- Adjust row and column size to your preference.\ntotalRows, totalCols :: Int\ntotalRows = 4\ntotalCols = 6\n\nemptyBoard :: Board\nemptyBoard = (\\(n, p) -> Cell { _pos = p\n , _state = Covered False False\n , _adjacentMines = 0\n , _cellId = n }) <$> zip [1..] positions\n where\n positions = (,) <$> [1..totalCols] <*> [1..totalRows]\n\nupdateCell :: Cell -> Board -> Board\nupdateCell cell = fmap (\\c -> if cell ^. cellId == c ^. cellId then cell else c)\n\nupdateBoard :: Board -> [Cell] -> Board\nupdateBoard = foldr updateCell\n\nokToOpen :: [Cell] -> [Cell]\nokToOpen = filter (\\c -> c ^? coveredLens == Just (False, False))\n\nopenUnMined :: Cell -> Cell\nopenUnMined = state .~ UnCovered False\n\nopenCell :: Pos -> Board -> Board\nopenCell p b = f $ find (\\c -> c ^. pos == p) b\n where\n f (Just c)\n | c ^? coveredFlaggedLens == Just True = b\n | c ^? coveredMinedLens == Just True = updateCell\n (c & state .~ UnCovered True)\n b\n | isCovered c = if c ^. adjacentMines == 0 && not (isFirstMove b)\n then updateCell (openUnMined c) $ expandEmptyCells b c\n else updateCell (openUnMined c) b\n | otherwise = b\n f Nothing = b\n isCovered = isJust . preview coveredLens\n\nexpandEmptyCells :: Board -> Cell -> Board\nexpandEmptyCells board cell\n | null openedCells = board\n | otherwise = foldr (flip expandEmptyCells) updatedBoard (zeroAdjacent openedCells)\n where\n findMore _ [] = []\n findMore exclude (c : xs)\n | c `elem` exclude = findMore exclude xs\n | c ^. adjacentMines == 0 = c : adjacent c <>\n findMore (c : exclude <> adjacent c) xs\n | otherwise = c : findMore (c : exclude) xs\n adjacent = okToOpen . flip adjacentCells board\n openedCells = openUnMined <$> nub (findMore [cell] (adjacent cell))\n zeroAdjacent = filter (view (adjacentMines . to (== 0)))\n updatedBoard = updateBoard board openedCells\n\nflagCell :: Pos -> Board -> Board\nflagCell p board = case find ((== p) . view pos) board of\n Just c -> updateCell (c & state . flagged %~ not) board\n Nothing -> board\n\nadjacentCells :: Cell -> Board -> [Cell]\nadjacentCells Cell {_pos = c@(x1, y1)} = filter (\\c -> c ^. pos `elem` positions)\n where\n f n = [pred n, n, succ n]\n positions = delete c $ [(x, y) | x <- f x1, x > 0, y <- f y1, y > 0]\n\nisLoss, isWin, allUnMinedOpen, allMinesFlagged, isFirstMove :: Board -> Bool\nisLoss = anyOf (traverse . unCoveredLens) (== True)\nisWin b = allUnMinedOpen b || allMinesFlagged b\n\nallUnMinedOpen = (== 0) . lengthOf (traverse . coveredMinedLens . filtered (== False))\nallMinesFlagged b = minedCount b == flaggedMineCount b\n where\n minedCount = lengthOf (traverse . coveredMinedLens . filtered (== True))\n flaggedMineCount = lengthOf (traverse . coveredLens . filtered (== (True, True)))\n\nisFirstMove = (== totalCols * totalRows) . lengthOf (folded . coveredFlaggedLens . filtered (== False))\n\ngroupedByRows :: Board -> [Board]\ngroupedByRows = groupBy (\\c1 c2 -> yAxis c1 == yAxis c2)\n . sortBy (\\c1 c2 -> yAxis c1 `compare` yAxis c2)\n where\n yAxis = view yCoordLens\n\ndisplayCell :: Cell -> String\ndisplayCell c\n | c ^? unCoveredLens == Just True = \"X\"\n | c ^? coveredFlaggedLens == Just True = \"?\"\n | c ^? (unCoveredLens . to not) == Just True =\n if c ^. adjacentMines > 0 then show $ c ^. adjacentMines else \"▢\"\n | otherwise = \".\"\n\nexposeMines :: Board -> Board\nexposeMines = fmap (\\c -> c & state . filtered (\\s -> s ^? _Covered . _1 == Just True) .~ UnCovered True)\n\nupdateMineCount :: Board -> Board\nupdateMineCount b = go b\n where\n go [] = []\n go (x : xs) = (x & adjacentMines .~ totalAdjacentMines b) : go xs\n where\n totalAdjacentMines =\n foldr (\\c acc -> if c ^. (state . mined) then succ acc else acc) 0 . adjacentCells x\n\n-- IO\nmineBoard :: Pos -> Board -> IO Board\nmineBoard p board = do\n totalMines <- randomMinedCount\n minedBoard totalMines >>= \\mb -> pure $ updateMineCount mb\n where\n mines n = take n <$> randomCellIds\n minedBoard n = (\\m ->\n fmap (\\c -> if c ^. cellId `elem` m then c & state . mined .~ True else c)\n board) . filter (\\c -> openedCell ^. cellId /= c)\n <$> mines n\n openedCell = head $ filter (\\c -> c ^. pos == p) board\n\nrandomCellIds :: IO [Int]\nrandomCellIds = randomRs (1, totalCols * totalRows) <$> getStdGen\n\nrandomMinedCount :: IO Int\nrandomMinedCount = getStdRandom $ randomR (minMinedCells, maxMinedCells)\n where\n maxMinedCells = floor $ realToFrac (totalCols * totalRows) * 0.2\n minMinedCells = floor $ realToFrac (totalCols * totalRows) * 0.1\n","language":"Haskell"},{"code":"module Main\n\nwhere\n\nimport MineSweeper (Board, Cell (..), Pos, coveredLens, coveredMinedLens,\n coveredFlaggedLens, xCoordLens, yCoordLens, pos, emptyBoard,\n groupedByRows, displayCell, isLoss, isWin, exposeMines,\n openCell, flagCell, mineBoard, totalRows, totalCols)\nimport Text.Printf (printf)\nimport Text.Read (readMaybe)\nimport System.IO (hSetBuffering, stdout, BufferMode(..))\nimport Control.Monad (join, guard)\nimport Control.Lens (lengthOf, filtered, view, preview)\n\ndata Command = Open Pos | Flag Pos | Invalid\n\nparseInput :: String -> Command\nparseInput s | length input /= 3 = Invalid\n | otherwise = maybe Invalid command parsedPos\n where\n input = words s\n parsedPos = do\n x <- readMaybe (input !! 1)\n y <- readMaybe (input !! 2)\n guard (x <= totalCols && y <= totalRows)\n pure (x, y)\n command p = case head input of\n \"o\" -> Open p\n \"f\" -> Flag p\n _ -> Invalid\n\ncheat :: Board -> String\ncheat = show . fmap (view pos) . filter ((== Just True) . preview coveredMinedLens)\n\ntotalMines, totalFlagged, totalCovered :: Board -> Int\ntotalMines = lengthOf (traverse . coveredMinedLens . filtered (==True))\ntotalFlagged = lengthOf (traverse . coveredFlaggedLens . filtered (==True))\ntotalCovered = lengthOf (traverse . coveredLens)\n\n-- IO\ndrawBoard :: Board -> IO ()\ndrawBoard b = do\n -- printf \"Cheat: %s\\n\" $ cheat b\n printf \" Mines: %d Covered: %d Flagged: %d\\n\\n\"\n (totalMines b) (totalCovered b) (totalFlagged b)\n printf \"%3s\" \"\"\n mapM_ (printf \"%3d\") $ view xCoordLens <$> head rows\n printf \"\\n\"\n mapM_ (\\row -> do\n printf \"%3d\" $ yCoord row\n mapM_ (printf \"%3s\" . displayCell) row\n printf \"\\n\" ) rows\n where\n rows = groupedByRows b\n yCoord = view yCoordLens . head\n\ngameLoop :: Board -> IO ()\ngameLoop b\n | isLoss b = drawBoard (exposeMines b) >> printf \"\\nYou Lose.\\n\"\n | isWin b = drawBoard b >> printf \"\\nYou Win.\\n\"\n | otherwise = do\n drawBoard b\n putStr \"\\nPick a cell: \"\n c <- getLine\n case parseInput c of\n Open p -> gameLoop $ openCell p b\n Flag p -> gameLoop $ flagCell p b\n Invalid -> gameLoop b\n\nmain :: IO ()\nmain = do\n hSetBuffering stdout NoBuffering\n drawBoard emptyBoard\n putStr \"\\nPick a cell: \"\n c <- getLine\n case parseInput c of\n Open p -> join $ startGame p emptyBoard\n _ -> main\n where\n startGame p b = gameLoop . openCell p <$> mineBoard p b\n","language":"Haskell"},{"code":"global DEFARGS,MF\n\nrecord minefield(mask,grid,rows,cols,mines,density,marked)\n\n$define _DEFAULTS [6, 4, .2, .6] # task defaults\n#$define _DEFAULTS [6, 7, .05, .1] # defaults for debugging\n$define _INDENT 6\n$define _MINE \"Y\"\n$define _TRUEMINE \"Y\"\n$define _FALSEMINE \"N\"\n$define _MASK \".\"\n$define _MARK \"?\"\n$define _TOGGLE1 \".?\"\n$define _TOGGLE2 \"?.\"\n\nprocedure main(arglist) #: play the game\nstatic trace\ninitial trace := -1\n\nDEFARGS := _DEFAULTS\nif *arglist = 0 then arglist := DEFARGS\n\nnewgame!arglist\nwhile c := trim(read()) do {\n c ? { tab(many(' '))\n case move(1) of {\n # required commands\n \"c\": clear() & showgrid() # c clear 1 sq and show\n \"m\": mark() # m flag/unflag a mine\n \"p\": showgrid() # p show the mine field\n \"r\": endgame(\"Resigning.\") # r resign this game\n # optional commands\n \"n\": newgame!arglist # n new game grid\n \"k\": clearunmarked() & showgrid() # k clears adjecent unmarked cells if #flags = count\n \"x\": clearallunmarked() # x clears every unflagged cell at once win/loose fast\n \"q\": stop(\"Quitting\") # q quit\n \"t\": &trace :=: trace # t toggle tracing for debugging\n default: usage()\n }}\n testforwin(g)\n }\nend\n\nprocedure newgame(r,c,l,h) #: start a new game\nlocal i,j,t\n\nMF := minefield()\n\nMF.rows := 0 < integer(\\r) | DEFARGS[1]\nMF.cols := 0 < integer(\\c) | DEFARGS[2]\n\nevery !(MF.mask := list(MF.rows)) := list(MF.cols,_MASK) # set mask\nevery !(MF.grid := list(MF.rows)) := list(MF.cols,0) # default count\n\nl := 1 > (0 < real(\\l)) | DEFARGS[3]\nh := 1 > (0 < real(\\h)) | DEFARGS[4]\nif l > h then l :=: h\n\nuntil MF.density := l <= ( h >= ?0 ) # random density between l:h\nMF.mines := integer(MF.rows * MF.cols * MF.density) # mines needed\nMF.marked := 0\n\nwrite(\"Creating \",r,\"x\",c,\" mine field with \",MF.mines,\" (\",MF.density * 100,\"%).\")\nevery 1 to MF.mines do until \\MF.grid[r := ?MF.rows, c := ?MF.cols] := &null # set mines\nevery \\MF.grid[i := 1 to MF.rows,j:= 1 to MF.cols] +:= (/MF.grid[i-1 to i+1,j-1 to j+1], 1) # set counts\n\nshowgrid()\nreturn\nend\n\nprocedure usage() #: show usage\nreturn write(\n\"h or ? - this help\\n\",\n\"n - start a new game\\n\",\n\"c i j - clears x,y and displays the grid\\n\",\n\"m i j - marks (toggles) x,y\\n\",\n\"p - displays the grid\\n\",\n\"k i j - clears adjecent unmarked cells if #marks = count\\n\",\n\"x - clears ALL unmarked flags at once\\n\",\n\"r - resign the game\\n\",\n\"q - quit the game\\n\",\n\"where i is the (vertical) row number and j is the (horizontal) column number.\" )\nend\n\nprocedure getn(n) #: command parsing\n tab(many(' '))\n if n := n >= ( 0 < integer(tab(many(&digits)))) then return n\n else write(\"Invalid or out of bounds grid square.\")\nend\n\nprocedure showgrid() #: show grid\nlocal r,c,x\n\n write(right(\"\",_INDENT),\" \",repl(\"----+----|\",MF.cols / 10 + 1)[1+:MF.cols])\n every r := 1 to *MF.mask do {\n writes(right(r,_INDENT),\" : \")\n every c := 1 to *MF.mask[r] do\n writes( \\MF.mask[r,c] | map(\\MF.grid[r,c],\"0\",\" \") | _MINE)\n write()\n }\n write(MF.marked,\" marked mines and \",MF.mines - MF.marked,\" mines left to be marked.\")\nend\n\nprocedure mark() #: mark/toggle squares\nlocal i,j\n\n if \\MF.mask[i := getn(MF.rows), j :=getn(MF.cols)] := map(MF.mask[i,j],_TOGGLE1,_TOGGLE2) then {\n case MF.mask[i,j] of {\n _MASK : MF.marked -:= 1\n _MARK : MF.marked +:= 1\n }\n }\nend\n\nprocedure clear() #: clear a square\nlocal i,j\n\n if ( i := getn(MF.rows) ) & ( j :=getn(MF.cols) ) then\n if /MF.mask[i,j] then\n write(i,\" \",j,\" was already clear\")\n else if /MF.grid[i,j] then endgame(\"KABOOM! You lost.\")\n else return revealclearing(i,j)\nend\n\nprocedure revealclearing(i,j) #: reaveal any clearing\n\n if \\MF.mask[i,j] := &null then {\n if MF.grid[i,j] = 0 then\n every revealclearing(i-1 to i+1,j-1 to j+1)\n return\n }\nend\n\nprocedure clearunmarked() #: clears adjecent unmarked cells if #flags = count\nlocal i,j,k,m,n\n\n if ( i := getn(MF.rows) ) & ( j :=getn(MF.cols) ) then\n if /MF.mask[i,j] & ( k := 0 < MF.grid[i,j] ) then {\n every (\\MF.mask[i-1 to i+1,j-1 to j+1] == _MARK) & ( k -:= 1)\n if k = 0 then {\n every (m := i-1 to i+1) & ( n := j-1 to j+1) do\n if \\MF.mask[m,n] == _MASK then MF.mask[m,n] := &null\n revealclearing(i,j)\n return\n }\n else\n write(\"Marked squares must match adjacent mine count.\")\n }\n else write(\"Must be adjecent to one or more marks to clear surrounding squares.\")\nend\n\nprocedure clearallunmarked() #: fast win or loose\nlocal i,j,k\n\n every (i := 1 to MF.rows) & (j := 1 to MF.cols) do {\n if \\MF.mask[i,j] == _MASK then {\n MF.mask[i,j] := &null\n if /MF.grid[i,j] then k := 1\n }\n }\n if \\k then endgame(\"Kaboom - you loose.\")\nend\n\nprocedure testforwin() #: win when rows*cols-#_MARK-#_MASK are clear and no Kaboom\nlocal t,x\n\n t := MF.rows * MF.cols - MF.mines\n every x := !!MF.mask do if /x then t -:= 1\n if t = 0 then endgame(\"You won!\")\nend\n\nprocedure endgame(tag) #: end the game\nlocal i,j,m\n\n every !(m := list(MF.rows)) := list(MF.cols) # new mask\n every (i := 1 to MF.rows) & (j := 1 to MF.cols) do\n if \\MF.mask[i,j] == _MARK then\n m[i,j] := if /MF.grid[i,j] then _TRUEMINE else _FALSEMINE\n MF.mask := m\n write(tag) & showgrid()\nend\n","language":"Icon"},{"code":"NB. minefield.ijs script\nNB. =========================================================\nNB. Game engine\n\nNB.require 'guid'\nNB.([ 9!:1) _2 (3!:4) , guids 1 NB. randomly set initial random seed\n\ncoclass 'mineswpeng'\n\nnewMinefield=: 3 : 0\n if. 0=#y do. y=. 9 9 end.\n Marked=: Cleared=: y$0\n NMines=: <. */(0.01*10+?20),y NB. 10..20% of tiles are mines\n mines=. (i. e. NMines ? */) y NB. place mines\n Map=: (9*mines) >. y{. (1,:3 3) +/@,;.3 (-1+y){.mines\n)\n\nmarkTiles=: 3 : 0\n Marked=: (<\"1 <:y) (-.@{)`[`]} Marked NB. toggle marked state of cell(s)\n)\n\nclearTiles=: clearcell@:<: NB. decrement coords - J arrays are 0-based\n\nclearcell=: verb define\n if. #y do.\n free=. (#~ (Cleared < 0 = Map) {~ <\"1) y\n Cleared=: 1 (<\"1 y)} Cleared NB. set cell(s) as cleared\n if. #free do.\n clearcell (#~ Cleared -.@{~ <\"1) ~. (<:$Map) (<.\"1) 0 >. getNbrs free\n end.\n end.\n)\n\ngetNbrs=: [: ,/^:(3=#@$) +\"1/&(<: 3 3#: i.9)\n\neval=: verb define\n if. 9 e. Cleared #&, Map do. NB. cleared mine(s)?\n 1; 'KABOOM!!'\n elseif. *./ 9 = (-.Cleared) #&, Map do. NB. all cleared except mines?\n 1; 'Minefield cleared.'\n elseif. do. NB. else...\n 0; (\": +/, Marked>Cleared),' of ',(\":NMines),' mines marked.'\n end. NB. result: isEnd; message\n)\n\nshowField=: 4 : 0\n idx=. y{ (2 <. Marked + +:Cleared) ,: 2\n |: idx} (11&{ , 12&{ ,: Map&{) x NB. transpose result - J arrays are row,column\n)\n\nNB. =========================================================\nNB. User interface\n\nMinesweeper_z_=: conew&'mineswp'\n\ncoclass 'mineswp'\ncoinsert 'mineswpeng' NB. insert game engine locale in copath\n\nTiles=: ' 12345678**.?'\n\ncreate=: verb define\n smoutput Instructions\n startgame y\n)\ndestroy=: codestroy\nquit=: destroy\n\nstartgame=: update@newMinefield\nclear=: update@clearTiles\nmark=: update@markTiles\n\nupdate=: 3 : 0\n 'isend msg'=. eval ''\n smoutput msg\n smoutput < Tiles showField isend\n if. isend do.\n msg=. ('K'={.msg) {:: 'won';'lost'\n smoutput 'You ',msg,'! Try again?'\n destroy ''\n end.\n empty''\n)\n\nInstructions=: 0 : 0\n=== MineSweeper ===\nObject:\n Uncover (clear) all the tiles that are not mines.\n\nHow to play:\n - the left, top tile is: 1 1\n - clear an uncleared tile (.) using the command:\n clear__fld <column index> <row index>\n - mark and uncleared tile (?) as a suspected mine using the command:\n mark__fld <column index> <row index>\n - if you uncover a number, that is the number of mines adjacent\n to the tile\n - if you uncover a mine (*) the game ends (you lose)\n - if you uncover all tiles that are not mines the game ends (you win).\n - quit a game before winning or losing using the command:\n quit__fld ''\n - start a new game using the command:\n fld=: MineSweeper <num columns> <num rows>\n)\n","language":"J"},{"code":" load 'minefield.ijs'\n fld=: Minesweeper 6 4\n=== MineSweeper ===\nObject:\n Uncover (clear) all the tiles that are not mines.\n\nHow to play:\n - the left, top tile is: 1 1\n - clear an uncleared tile (.) using the command:\n clear__fld <column index> <row index>\n - mark and uncleared tile (?) as a suspected mine using the command:\n mark__fld <column index> <row index>\n - if you uncover a number, that is the number of mines adjacent\n to the tile\n - if you uncover a mine (*) the game ends (you lose)\n - if you uncover all tiles that are not mines the game ends (you win).\n - quit a game before winning or losing using the command:\n quit__fld ''\n - start a new game using the command:\n fld=: MineSweeper <num columns> <num rows>\n\n0 of 5 mines marked.\n┌──────┐\n│......│\n│......│\n│......│\n│......│\n└──────┘\n clear__fld 1 1\n0 of 5 mines marked.\n┌──────┐\n│2.....│\n│......│\n│......│\n│......│\n└──────┘\n clear__fld 6 4\n0 of 5 mines marked.\n┌──────┐\n│2..2 │\n│...2 │\n│..31 │\n│..1 │\n└──────┘\n mark__fld 3 1 ,: 3 2 NB. mark and clear both accept lists of coordinates\n2 of 5 mines marked.\n┌──────┐\n│2.?2 │\n│..?2 │\n│..31 │\n│..1 │\n└──────┘\n clear__fld 1 2 , 1 3 ,: 1 4\n2 of 5 mines marked.\n┌──────┐\n│2.?2 │\n│3.?2 │\n│2.31 │\n│1.1 │\n└──────┘\n clear__fld 2 1\nKABOOM!!\n┌──────┐\n│2**2 │\n│3**2 │\n│2*31 │\n│111 │\n└──────┘\nYou lost! Try again?\n fld=: Minesweeper 20 10 NB. create bigger minefield\n... NB. instructions elided\n0 of 50 mines marked.\n┌────────────────────┐\n│....................│\n│....................│\n│....................│\n│....................│\n│....................│\n│....................│\n│....................│\n│....................│\n│....................│\n│....................│\n└────────────────────┘\n clear__fld >: 4$.$. 9 > Map__fld NB. Autosolve ;-)\nMinefield cleared.\n┌────────────────────┐\n│1***2**2**2*2*2*1111│\n│123222222221212222*1│\n│11 1223*421│\n│*3321 11223**5**1 │\n│3***211 1*2**6**432 │\n│2*433*222223**423*2 │\n│1111*4*4*2 13*2 3*41│\n│11112*3**321211 2**1│\n│3*3112334*3*211 1332│\n│***1 1*12*312*1 1*1│\n└────────────────────┘\nYou won! Try again?\n","language":"J"},{"code":"--------------------------------- START of Main.java ---------------------------------\n//By xykmz. Enjoy!\n\nimport java.util.Scanner;\n\npublic class Main {\n\n static int intErrorTrap (int x, int y){\n\n int max, min;\n\n if (x < y) {\n min = x;\n max = y;\n } else {\n min = y;\n max = x;\n }\n\n int input;\n boolean loopEnd;\n\n do {\n\n System.out.println(\"Please enter an integer between \" + min + \" to \" + max + \".\");\n Scanner userInput = new Scanner(System.in); //Player inputs a guess\n\n try\n {\n input = userInput.nextInt();\n\n if(input > max) //Input is too high\n {\n loopEnd = false;\n System.out.println(\"Input is invalid.\");\n return -1;\n }\n\n else if(input < min) //Input is too low\n {\n loopEnd = false;\n System.out.println(\"Input is invalid.\");\n return -1;\n }\n\n else //Input is within acceptable range\n {\n loopEnd = true;\n System.out.println(input + \" is a valid input.\");\n return input;\n\n }\n }\n\n catch (Exception e)\n {\n loopEnd = false;\n userInput.next();\n System.out.println(\"Input is invalid.\");\n return 0;\n }\n\n } while (loopEnd == false);\n }\n\n\n public static void main(String[] args) {\n\n \tSystem.out.println (\"Enter width.\");\n \tint x = intErrorTrap (0,60);\n \t\n \tSystem.out.println (\"Enter height.\");\n \tint y = intErrorTrap (0,30);\n \t\n \tSystem.out.println (\"Enter difficulty.\");\n \tint d = intErrorTrap (0,100);\n\n new Minesweeper(x, y, d); //Suggested: (60, 30, 15)\n }\n\n}\n\n\n//--------------------------------- END of Main.java ---------------------------------\n\n//--------------------------------- START of Cell.java ---------------------------------\n\n\n\npublic class Cell{ //This entire class is quite self-explanatory. All we're really doing is setting booleans.\n\t\n private boolean isMine, isFlagged, isCovered;\n private int number;\n\n public Cell(){\n isMine = false;\n isFlagged = false;\n isCovered = true;\n number = 0;\n }\n\n public void flag(){\n isFlagged = true;\n }\n\n public void unflag(){\n isFlagged = false;\n }\n\n public void setMine(){\n isMine = true;\n }\n\n public boolean isMine(){\n return isMine;\n }\n\n public void reveal(){\n isCovered = false;\n }\n\n public void setNumber(int i){ //Set the number of the cell\n number = i;\n }\n\n public int getNumber(){ //Request the program for the number of the cell\n return number;\n }\n\n public boolean isFlagged(){\n return isFlagged;\n }\n\n public boolean isCovered(){\n return isCovered;\n }\n\n\n}\n\n//--------------------------------- END of Cell.java ---------------------------------\n\n//--------------------------------- START of Board.java ---------------------------------\n\nimport java.awt.Color;\nimport java.awt.Dimension;\nimport java.awt.Graphics;\nimport javax.swing.JPanel;\n\npublic class Board extends JPanel{\n\t\n private static final long serialVersionUID = 1L; //Guarantees consistent serialVersionUID value across different java compiler implementations,\n \t\t\t\t\t\t\t\t\t\t\t\t //Auto-generated value might screw things up\n\n private Minesweeper mine;\n private Cell[][] cells;\n\n\n public void paintComponent(Graphics g){\n \t\n cells = mine.getCells();\n\n for (int i = 0; i < mine.getx(); i++){\n \t\n for (int j = 0; j < mine.gety(); j++){\n \t\n Cell current = cells[i][j];\n\n\n //Flagged cells\n if (current.isFlagged()){\n \t\n if (current.isMine() && mine.isFinished()){\n \t\n g.setColor(Color.ORANGE); //Let's the player know which mines they got right when the game is finished.\n g.fillRect(i * 20, j * 20, i * 20 + 20, j * 20 + 20);\n g.setColor(Color.BLACK);\n\n g.drawLine(i * 20, j * 20, i * 20 + 20, j * 20 + 20);\n g.drawLine(i * 20, j * 20 + 20, i * 20 + 20, j * 20);\n }\n else if (mine.isFinished()){ //Shows cells that the player incorrectly identified as mines.\n g.setColor(Color.YELLOW);\n g.fillRect(i * 20, j * 20, i * 20 + 20, j * 20 + 20);\n g.setColor(Color.BLACK);\n }\n else{\n g.setColor(Color.GREEN); //Flagging a mine.\n g.fillRect(i * 20, j * 20, i * 20 + 20, j * 20 + 20);\n g.setColor(Color.BLACK);\n }\n }\n\n //Unflagged cells\n else if (current.isCovered()){ //Covered cells\n g.setColor(Color.DARK_GRAY);\n g.fillRect(i * 20, j * 20, i * 20 + 20, j * 20 + 20);\n g.setColor(Color.BLACK);\n }\n else if (current.isMine()){ //Incorrect cells are shown when the game is over.=\n g.setColor(Color.RED);\n g.fillRect(i * 20, j * 20, i * 20 + 20, j * 20 + 20);\n g.setColor(Color.BLACK);\n g.drawLine(i * 20, j * 20, i * 20 + 20, j * 20 + 20);\n g.drawLine(i * 20, j * 20 + 20, i * 20 + 20, j * 20);\n }\n else{ //Empty cells or numbered cells\n g.setColor(Color.LIGHT_GRAY);\n g.fillRect(i * 20, j * 20, i * 20 + 20, j * 20 + 20);\n g.setColor(Color.BLACK);\n }\n\n //The following part is very self explanatory - drawing the numbers.\n //Not very interesting work.\n //Not a fun time.\n //Rating: 0/10. Would not recommend.\n\n if (!current.isCovered()){\n if (current.getNumber() == 1){\n g.drawLine(i * 20 + 13, j * 20 + 5, i * 20 + 13, j * 20 + 9); //3\n g.drawLine(i * 20 + 13, j * 20 + 11, i * 20 + 13, j * 20 + 15); //6\n }\n else if (current.getNumber() == 2){\n g.drawLine(i * 20 + 8, j * 20 + 4, i * 20 + 12, j * 20 + 4); //2\n g.drawLine(i * 20 + 13, j * 20 + 5, i * 20 + 13, j * 20 + 9); //3\n g.drawLine(i * 20 + 8, j * 20 + 10, i * 20 + 12, j * 20 + 10); //4\n g.drawLine(i * 20 + 7, j * 20 + 11, i * 20 + 7, j * 20 + 15); //5\n g.drawLine(i * 20 + 8, j * 20 + 16, i * 20 + 12, j * 20 + 16); //7\n }\n else if (current.getNumber() == 3){\n g.drawLine(i * 20 + 8, j * 20 + 4, i * 20 + 12, j * 20 + 4); //2\n g.drawLine(i * 20 + 13, j * 20 + 5, i * 20 + 13, j * 20 + 9); //3\n g.drawLine(i * 20 + 8, j * 20 + 10, i * 20 + 12, j * 20 + 10); //4\n g.drawLine(i * 20 + 13, j * 20 + 11, i * 20 + 13, j * 20 + 15); //6\n g.drawLine(i * 20 + 8, j * 20 + 16, i * 20 + 12, j * 20 + 16); //7\n }\n else if (current.getNumber() == 4){\n g.drawLine(i * 20 + 7, j * 20 + 5, i * 20 + 7, j * 20 + 9); //1\n g.drawLine(i * 20 + 13, j * 20 + 5, i * 20 + 13, j * 20 + 9); //3\n g.drawLine(i * 20 + 8, j * 20 + 10, i * 20 + 12, j * 20 + 10); //4\n g.drawLine(i * 20 + 13, j * 20 + 11, i * 20 + 13, j * 20 + 15); //6\n }\n else if (current.getNumber() == 5){\n g.drawLine(i * 20 + 7, j * 20 + 5, i * 20 + 7, j * 20 + 9); //1\n g.drawLine(i * 20 + 8, j * 20 + 4, i * 20 + 12, j * 20 + 4); //2\n g.drawLine(i * 20 + 8, j * 20 + 10, i * 20 + 12, j * 20 + 10); //4\n g.drawLine(i * 20 + 13, j * 20 + 11, i * 20 + 13, j * 20 + 15); //6\n g.drawLine(i * 20 + 8, j * 20 + 16, i * 20 + 12, j * 20 + 16); //7\n }\n else if (current.getNumber() == 6){\n g.drawLine(i * 20 + 7, j * 20 + 5, i * 20 + 7, j * 20 + 9); //1\n g.drawLine(i * 20 + 8, j * 20 + 4, i * 20 + 12, j * 20 + 4); //2\n g.drawLine(i * 20 + 8, j * 20 + 10, i * 20 + 12, j * 20 + 10); //4\n g.drawLine(i * 20 + 7, j * 20 + 11, i * 20 + 7, j * 20 + 15); //5\n g.drawLine(i * 20 + 13, j * 20 + 11, i * 20 + 13, j * 20 + 15); //6\n g.drawLine(i * 20 + 8, j * 20 + 16, i * 20 + 12, j * 20 + 16); //7\n }\n else if (current.getNumber() == 7){\n g.drawLine(i * 20 + 8, j * 20 + 4, i * 20 + 12, j * 20 + 4); //2\n g.drawLine(i * 20 + 13, j * 20 + 5, i * 20 + 13, j * 20 + 9); //3\n g.drawLine(i * 20 + 13, j * 20 + 11, i * 20 + 13, j * 20 + 15); //6\n }\n else if (current.getNumber() == 8){\n g.drawLine(i * 20 + 7, j * 20 + 5, i * 20 + 7, j * 20 + 9); //1\n g.drawLine(i * 20 + 8, j * 20 + 4, i * 20 + 12, j * 20 + 4); //2\n g.drawLine(i * 20 + 13, j * 20 + 5, i * 20 + 13, j * 20 + 9); //3\n g.drawLine(i * 20 + 8, j * 20 + 10, i * 20 + 12, j * 20 + 10); //4\n g.drawLine(i * 20 + 7, j * 20 + 11, i * 20 + 7, j * 20 + 15); //5\n g.drawLine(i * 20 + 13, j * 20 + 11, i * 20 + 13, j * 20 + 15); //6\n g.drawLine(i * 20 + 8, j * 20 + 16, i * 20 + 12, j * 20 + 16); //7\n }\n }\n g.setColor(Color.BLACK);\n g.drawRect(i * 20, j * 20, i * 20 + 20, j * 20 + 20);\n }\n }\n }\n\n public Board(Minesweeper m){ //Creating a new game so we can draw a board for it\n mine = m;\n cells = mine.getCells();\n\n addMouseListener(new Actions(mine));\n\n setPreferredSize(new Dimension(mine.getx() * 20, mine.gety() * 20));\n }\n\n}\n\n//--------------------------------- END of Board.java ---------------------------------\n\n//--------------------------------- START of Actions.java ---------------------------------\n\nimport java.awt.event.ActionEvent;\nimport java.awt.event.ActionListener;\nimport java.awt.event.MouseEvent;\nimport java.awt.event.MouseListener;\n\npublic class Actions implements ActionListener, MouseListener{\n\t\n private Minesweeper mine;\n\n //These following four are not important. We simply tell the machine to pay no mind when mouse is pressed, released, etc.\n //If these weren't here the computer would freak out and panic over what to do because no instructions were given.\n\n public void mouseEntered(MouseEvent e){\n \t\n }\n\n public void mouseExited(MouseEvent e){\n\n }\n\n public void mousePressed(MouseEvent e){\n\n }\n\n public void mouseReleased(MouseEvent e){\n\n }\n\n //Where the fun begins\n\n public Actions(Minesweeper m){\n \t\n mine = m;\n }\n\n //Any time an action is performed, redraw the board and keep it up to date.\n public void actionPerformed(ActionEvent e){\n \t\n mine.reset();\n\n mine.refresh();\n }\n\n //Mouse clicky clicky\n public void mouseClicked(MouseEvent e){\n \t\n \t//Left click - opens mine\n if (e.getButton() == 1)\n {\n int x = e.getX() / 20;\n int y = e.getY() / 20;\n\n mine.select(x, y);\n }\n\n //Right click - marks mine\n if (e.getButton() == 3)\n {\n int x = e.getX() / 20;\n int y = e.getY() / 20;\n\n mine.mark(x, y);\n }\n\n\n mine.refresh(); //Gotta keep it fresh\n }\n\n\n}\n\n//--------------------------------- END of Actions.java ---------------------------------\n\n//--------------------------------- START of Minesweeper.java ---------------------------------\n\nimport java.awt.BorderLayout;\nimport java.util.Random;\nimport javax.swing.JButton;\nimport javax.swing.JFrame;\nimport javax.swing.JOptionPane;\n\npublic class Minesweeper extends JFrame\n{\n private static final long serialVersionUID = 1L;\n private int width, height;\n private int difficulty;\n private Cell[][] cells;\n private Board board;\n private JButton reset;\n private boolean finished;\n\n\n public void select(int x, int y){ //Select a mine on the board\n \t\n if (cells[x][y].isFlagged()) //Is the mine flagged?\n \treturn;\n\n cells[x][y].reveal(); //Reveal the cell\n resetMarks(); //Reset marks and redraw board\n refresh();\n\n if (cells[x][y].isMine()) //If a mine is revealed, you lose.\n {\n lose();\n }\n else if (won()) //If the game has been won, you win. Hahahahahaha.\n {\n win();\n }\n }\n\n private void setNumbers(){ //For each cell, count the amount of mines in surrounding squares.\n \t //Because the board is modeled as a 2D array, this is relatively easy - simply check the surrounding addresses for mines.\n \t\t\t\t\t\t //If there's a mine, add to the count.\n \t\n for (int i = 0; i < width; i++){\n \t\n for (int j = 0; j < height; j++){\n \t\n int count = 0;\n\n if (i > 0 && j > 0 && cells[i - 1][j - 1].isMine())\n \tcount++;\n\n if (j > 0 && cells[i][j - 1].isMine())\n \tcount++;\n\n if (i < width - 1 && j > 0 && cells[i + 1][j - 1].isMine())\n \tcount++;\n\n if (i > 0 && cells[i - 1][j].isMine())\n \tcount++;\n\n if (i < width - 1 && cells[i + 1][j].isMine())\n \tcount++;\n\n if (i > 0 && j < height - 1 && cells[i - 1][j + 1].isMine())\n \tcount++;\n\n if (j < height - 1 && cells[i] [j + 1].isMine())\n \tcount++;\n\n if (i < width - 1 && j < height - 1 && cells[i + 1][j + 1].isMine())\n \tcount++;\n\n cells[i][j].setNumber(count);\n\n\n if (cells[i][j].isMine())\n cells[i][j].setNumber(-1);\n\n\n if (cells[i][j].getNumber() == 0)\n cells[i][j].reveal();\n\n }\n }\n\n for (int i = 0; i < width; i++){ //This is for the beginning of the game.\n \t //If the 8 cells around certain cell have no mines beside them (hence getNumber() = 0) beside them, this cell is empty.\n \t\n for (int j = 0; j < height; j++){\n \t\n if (i > 0 && j > 0 && cells[i - 1][j - 1].getNumber() == 0)\n \tcells[i][j].reveal();\n\n if (j > 0 && cells[i][j - 1].getNumber() == 0)\n \tcells[i][j].reveal();\n\n if (i < width - 1 && j > 0 && cells[i + 1][j - 1].getNumber() == 0)\n \tcells[i][j].reveal();\n\n if (i > 0 && cells[i - 1][j].getNumber() == 0)\n \tcells[i][j].reveal();\n\n if (i < width - 1 && cells[i + 1][j].getNumber() == 0)\n \tcells[i][j].reveal();\n\n if (i > 0 && j < height - 1 && cells[i - 1][j + 1].getNumber() == 0)\n \tcells[i][j].reveal();\n\n if (j < height - 1 && cells[i][j + 1].getNumber() == 0)\n \tcells[i][j].reveal();\n\n if (i < width - 1 && j < height - 1 && cells[i + 1][j + 1].getNumber() == 0)\n \tcells[i][j].reveal();\n }\n }\n }\n\n public void mark(int x, int y){ //When a player wants to flag/unflag a cell\n \t\n if (cells[x][y].isFlagged()) //If the cell is already flagged, unflag it.\n \tcells[x][y].unflag();\n\n else if (cells[x][y].isCovered()) //If the cell has nothing on it and is covered, flag it.\n \tcells[x][y].flag();\n\n resetMarks();\n }\n\n private void resetMarks(){ //If a cell is not covered, then it cannot be flagged.\n \t //Every time a player does something, this should be called to redraw the board.\n \t\n for (int i = 0; i < width; i++){\n for (int j = 0; j < height; j++){\n \t\n if (!cells[i][j].isCovered())\n \tcells[i][j].unflag();\n\n }\n }\n }\n\n public void reset(){ //Reset the positions of the mines on the board\n \t //If randomly generated number from 0 to 100 is less than the chosen difficulty, a mine is placed down.\n \t //This will somewhat accurately reflect the mine percentage that the user requested - the more cells, the more accurate.\n \t\n Random random = new Random();\n finished = false;\n\n for (int i = 0; i < width; i++) {\n for (int j = 0; j < height; j++) {\n \t\n Cell c = new Cell();\n cells[i][j] = c;\n int r = random.nextInt(100);\n\n if (r < difficulty)\n {\n cells[i][j].setMine(); //Put down a mine.\n }\n\n }\n }\n setNumbers(); //Set the numbers after mines have been put down.\n }\n\n public int getx() {\n return width;\n }\n\n public int gety() {\n return height;\n }\n\n public Cell[][] getCells() {\n return cells;\n }\n\n\n public void refresh(){ //Refresh the drawing of the board\n board.repaint();\n }\n\n private void win(){ //Winning a game\n finished = true;\n for (int i = 0; i < width; i++)\n {\n for (int j = 0; j < height; j++)\n {\n cells[i][j].reveal();//Reveal all cells\n\n if (!cells[i][j].isMine())\n \tcells[i][j].unflag();\n }\n }\n\n refresh();\n JOptionPane.showMessageDialog(null, \"Congratulations! You won!\"); //Tell the user they won. They probably deserve to know.\n reset();\n }\n\n private void lose(){ //Losing a game...basically the same as above.\n finished = true;\n for (int i = 0; i < width; i++)\n {\n for (int j = 0; j < height; j++)\n {\n if (!cells[i][j].isCovered())\n \tcells[i][j].unflag();\n\n cells[i][j].reveal();\n }\n }\n refresh();\n JOptionPane.showMessageDialog(null, \"GAME OVER.\"); //Dialogue window letting the user know that they lost.\n reset();\n }\n\n\n private boolean won(){ //Check if the game has been won\n for (int i = 0; i < width; i++){\n for (int j = 0; j < height; j++){\n \t\n if (cells[i][j].isCovered() && !cells[i][j].isMine())\n {\n return false;\n }\n }\n }\n\n return true;\n }\n\n\n public boolean isFinished(){ //Extremely self-explanatory.\n return finished;\n }\n\n public Minesweeper(int x, int y, int d){\n \t\n width = x; //Width of the board\n height = y; //Height of the board\n difficulty = d; //Percentage of mines in the board\n cells = new Cell[width][height];\n\n reset(); //Set mines on the board\n\n board = new Board(this); //Create new board\n reset = new JButton(\"Reset\"); //Reset button\n\n add(board, BorderLayout.CENTER); //Put board in the center\n add(reset, BorderLayout.SOUTH); //IT'S A BUTTON! AND IT WORKS! VERY COOL\n\n reset.addActionListener(new Actions(this)); //ActionListener to watch for mouse actions\n\n //GUI window settings\n setTitle(\"Minesweeper\");\n setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\n setResizable(false);\n pack();\n setVisible(true);\n }\n\n}\n\n\n//--------------------------------- END of Minesweeper.java ---------------------------------\n","language":"Java"},{"code":"# Minesweeper:\n\nmutable struct Field\n size::Tuple{Int, Int}\n numbers::Array{Int, 2}\n possible_mines::Array{Bool, 2}\n actual_mines::Array{Bool, 2}\n visible::Array{Bool, 2}\nend\n\nfunction Field(x, y)\n size = (x, y)\n actual_mines = convert(Array{Bool, 2}, rand(x, y) .< 0.15)\n possible_mines = zeros(Bool, x, y)\n numbers = zeros(Int, x, y)\n visible = zeros(Bool, x, y)\n for i = 1:x\n for j = 1:y\n n = 0\n for di = -1:1\n for dj = -1:1\n n += (0 < di+i <= x && 0 < dj+j <= y) ?\n (actual_mines[di+i, dj+j] ? 1 : 0) : 0\n end\n end\n numbers[i, j] = n\n end\n end\n return Field(size, numbers, possible_mines, actual_mines, visible)\nend\n\nfunction printfield(f::Field; showall = false)\n spaces = Int(floor(log(10, f.size[2])))\n\n str = \" \"^(4+spaces)\n for i in 1:f.size[1]\n str *= string(\" \", i, \" \")\n end\n str *= \"\\n\" * \" \"^(4+spaces) * \"___\"^f.size[1] * \"\\n\"\n for j = 1:f.size[2]\n str *= \" \" * string(j) * \" \"^(floor(log(10, j)) > 0 ? 1 : spaces+1) * \"|\"\n for i = 1:f.size[1]\n if showall\n str *= f.actual_mines[i, j] ? \" * \" : \" \"\n else\n if f.visible[i, j]\n str *= \" \" * string(f.numbers[i, j] > 0 ? f.numbers[i, j] : \" \") * \" \"\n elseif f.possible_mines[i, j]\n str *= \" ? \"\n else\n str *= \" . \"\n end\n end\n end\n str *= \"\\r\\n\"\n end\n println(\"Found \" * string(length(f.possible_mines[f.possible_mines.==true])) *\n \" of \" * string(length(f.actual_mines[f.actual_mines.==true])) * \" mines.\\n\")\n print(str)\nend\n\nfunction parse_input(str::String)\n input = split(chomp(str), \" \")\n mode = input[1]\n println(str)\n coords = length(input) > 1 ? (parse(Int,input[2]), parse(Int,input[3])) : (0, 0)\n return mode, coords\nend\n\nfunction eval_input(f::Field, str::String)\n mode, coords = parse_input(str)\n (coords[1] > f.size[1] || coords[2] > f.size[2]) && return true\n if mode == \"o\"\n reveal(f, coords...) || return false\n elseif mode == \"m\" && f.visible[coords...] == false\n f.possible_mines[coords...] = !f.possible_mines[coords...]\n elseif mode == \"close\"\n error(\"You closed the game.\")\n end\n return true\nend\n\nfunction reveal(f::Field, x::Int, y::Int)\n (x > f.size[1] || y > f.size[2]) && return true # check for index out of bounds\n f.actual_mines[x, y] && return false # check for mines\n f.visible[x, y] = true\n if f.numbers[x, y] == 0\n for di = -1:1\n for dj = -1:1\n if (0 < di+x <= f.size[1] && 0 < dj+y <= f.size[2]) &&\n f.actual_mines[x+di, y+dj] == false &&\n f.visible[x+di, y+dj] == false\n reveal(f, x+di, y+dj)\n end\n end\n end\n end\n return true\nend\n\nfunction play()\n print(\"\\nWelcome to Minesweeper\\n\\nEnter the gridsize x y:\\n\")\n s = split(readline(), \" \")\n f = Field(parse.(Int,s)...)\n won = false\n while true\n printfield(f)\n print(\"\\nWhat do you do? (\\\"o x y\\\" to reveal a field; \\\"m x y\\\" to toggle a mine; close)\\n\")\n eval_input(f, readline()) || break\n print(\"_\"^80 * \"\\n\")\n (f.actual_mines == f.possible_mines ||\n f.visible == .!f.actual_mines) && (won = true; break)\n end\n println(won ? \"You won the game!\" : \"You lost the game:\\n\")\n printfield(f, showall = true)\nend\n\nplay()\n","language":"Julia"},{"code":"julia> include(\"minesweeper.jl\")\n\nWelcome to Minesweeper\n\nEnter the gridsize x y:\n6 4\nFound 0 of 5 mines.\n\n 1 2 3 4 5 6\n __________________\n 1 | . . . . . .\n 2 | . . . . . .\n 3 | . . . . . .\n 4 | . . . . . .\n\nWhat do you do? (\"o x y\" to reveal a field; \"m x y\" to toggle a mine; close)\no 1 1\n________________________________________________________________________________\n\nFound 0 of 5 mines.\n\n 1 2 3 4 5 6\n __________________\n 1 | 1 . . . . .\n 2 | . . . . . .\n 3 | . . . . . .\n 4 | . . . . . .\n\nWhat do you do? (\"o x y\" to reveal a field; \"m x y\" to toggle a mine; close)\no 1 2\n________________________________________________________________________________\n\nFound 0 of 5 mines.\n\n 1 2 3 4 5 6\n __________________\n 1 | 1 . . . . .\n 2 | 2 . . . . .\n 3 | . . . . . .\n 4 | . . . . . .\n\nWhat do you do? (\"o x y\" to reveal a field; \"m x y\" to toggle a mine; close)\no 2 1\n________________________________________________________________________________\n\nFound 0 of 5 mines.\n\n 1 2 3 4 5 6\n __________________\n 1 | 1 2 . . . .\n 2 | 2 . . . . .\n 3 | . . . . . .\n 4 | . . . . . .\n\nWhat do you do? (\"o x y\" to reveal a field; \"m x y\" to toggle a mine; close)\no 6 4\n________________________________________________________________________________\n\nFound 0 of 5 mines.\n\n 1 2 3 4 5 6\n __________________\n 1 | 1 2 . . . .\n 2 | 2 . 2 1 1 1\n 3 | . . 2\n 4 | . . 1\n\nWhat do you do? (\"o x y\" to reveal a field; \"m x y\" to toggle a mine; close)\nm 2 2\n________________________________________________________________________________\n\nFound 1 of 5 mines.\n\n 1 2 3 4 5 6\n __________________\n 1 | 1 2 . . . .\n 2 | 2 ? 2 1 1 1\n 3 | . . 2\n 4 | . . 1\n\nWhat do you do? (\"o x y\" to reveal a field; \"m x y\" to toggle a mine; close)\nclose\nERROR: You closed the game.\n","language":"Julia"},{"code":"10 mode 1:randomize time\n20 defint a-z\n30 boardx=6:boardy=4\n40 dim a(boardx,boardy)\n50 dim c(boardx+2,boardy+2)\n60 dim c2(boardx+2,boardy+2)\n70 nmines=int((rnd/3+.1)*boardx*boardy)\n80 for i=1 to nmines\n90 ' place random mines\n100 xp=int(rnd*(boardx-1)+1)\n110 yp=int(rnd*(boardy-1)+1)\n120 if a(xp,yp) then 100\n130 a(xp,yp)=64\n140 for xx=xp to xp+2\n150 for yy=yp to yp+2\n160 c(xx,yy)=c(xx,yy)+1\n170 next yy\n180 next xx\n190 next i\n200 gosub 350\n210 x=1:y=1\n220 gosub 600\n230 ' wait for key press\n240 k$=lower$(inkey$)\n250 if k$=\"\" then 240\n260 if k$=\"q\" and y>1 then gosub 660:y=y-1:gosub 600\n270 if k$=\"a\" and y<boardy then gosub 660:y=y+1:gosub 600\n280 if k$=\"o\" and x>1 then gosub 660:x=x-1:gosub 600\n290 if k$=\"p\" and x<boardx then gosub 660:x=x+1:gosub 600\n300 if k$=\"m\" then a(x,y)=a(x,y) xor 128:gosub 600:gosub 1070\n310 if k$=\" \" then a(x,y)=a(x,y) or 512:gosub 700:sx=x:sy=y:gosub 450:x=sx:y=sy:gosub 600\n320 goto 240\n330 end\n340 ' print board\n350 mode 1\n360 gosub 450\n370 locate 1,12\n380 print \"Move on the board with the Q,A,O,P keys\"\n390 print \"Press Space to clear\"\n400 print \"Press M to mark as a potential mine\"\n410 print\n420 print \"There are\"nmines\"mines.\"\n430 return\n440 ' update board\n450 for y=1 to boardy\n460 for x=1 to boardx\n470 locate 2*x,y\n480 gosub 530\n490 next\n500 next\n510 return\n520 ' print tile\n530 if a(x,y) and 128 then print \"?\":return\n540 if c(x+1,y+1)=0 then d$=\" \" else d$=chr$(c(x+1,y+1)+48)\n550 if a(x,y) and 256 then print d$:return\n560 'if a(x,y) and 64 then print \"M\":return\n570 print \".\"\n580 return\n590 ' turn on tile\n600 locate 2*x,y\n610 pen 0:paper 1\n620 gosub 530\n630 pen 1:paper 0\n640 return\n650 ' turn off tile\n660 locate 2*x,y\n670 gosub 530\n680 return\n690 ' clear tile\n700 if a(x,y) and 64 then locate 15,20:print \"*** BOOM! ***\":end\n710 locate 1,25:print \"-WAIT-\";\n720 for x2=1 to boardx\n730 for y2=1 to boardy\n740 c2(x2+1,y2+1)=a(x2,y2)\n750 next\n760 next\n770 ' iterate clearing\n780 cl=0\n790 for x2=1 to boardx\n800 for y2=1 to boardy\n810 if c2(x2+1,y2+1) and 512 then gosub 940:cl=cl+1\n820 next y2\n830 next x2\n840 if cl then 780\n850 for x2=1 to boardx\n860 for y2=1 to boardy\n870 vv=c2(x2+1,y2+1)\n880 if vv>1000 then a(x2,y2)=vv xor 1024\n890 next y2\n900 next x2\n910 locate 1,25:print \" \";\n920 return\n930 ' find neighbors\n940 c2(x2+1,y2+1)=(c2(x2+1,y2+1) xor 512) or 256 or 1024\n950 for ii=0 to 2\n960 for jj=0 to 2\n970 if ii=0 and jj=0 then 1030\n980 if c2(x2+ii,y2+jj) and 64 then 1030\n990 if c2(x2+ii,y2+jj) and 128 then 1030\n1000 if c2(x2+ii,y2+jj) and 1024 then 1030\n1010 c2(x2+ii,y2+jj)=c2(x2+ii,y2+jj) or 512\n1020 ' next tile\n1030 next jj\n1040 next ii\n1050 return\n1060 ' update discovered mine count\n1070 mm=0\n1080 for x2=1 to boardx\n1090 for y2=1 to boardy\n1100 if (a(x2,y2) and 128)>0 and (a(x2,y2) and 64)>0 then mm=mm+1\n1110 next\n1120 next\n1130 if mm=nmines then locate 5,22:print \"Congratulations, you've won!\":end\n1140 return\n","language":"Locomotive-Basic"},{"code":"Module Minesweeper {\n Font \"Arial Black\"\n Bold 0\n Form 60,40\n Refresh 1000\n Def com$, com_label$\n Def x, b_row, b_col, where, top_where\n Def rows=4, columns=6, swap_first%\n Def boolean skiptest, end_game, cheat\n Dim Board$(0 to rows+1, 0 to columns+1)=\"? \"\n Def mines%, i%, j%, used%, acc%, n%, m%\n mines%=max.data(random(int(columns*rows*.1),int(columns*rows*.2)-1), 1)\n For i%=1 to rows:For j%=1 to columns\n Board$(i%,j%)=\". \"\n Next j%:Next i%\n used%=mines%\n While used%\n used%--\n Do\n i%=random(1,rows)\n j%=random(1, columns)\n Until right$(Board$(i%,j%),1)=\" \"\n Board$(i%,j%)=\".*\"\n End While\n used%=rows*columns-mines%\n \\\\ remove rem so to never loose from first open\n Rem :\n swap_first%=used%\n \\\\ when mines%=0 or used%=0 then player win\n Report {Minesweeper - rosettacode task\n Commands:\n - ? 1 2 flag/unflag 1 2\n - 1 2 open 1 2\n - q to quit\n You can pass multiple commands in a line, but q erase all before execute\n }\n top_where=Row\n While not End_Game {GameLoop()}\n End\n Sub PrintBoard()\n Cls, top_where\n Print\n Print \" X \";\n For j%=1 to columns {\n Print format$(\"{0::-3} \", j%);\n }\n Print\n For i%=1 to rows {\n Print format$(\" {0::-3} \", i%);\n For j%=1 to columns {\n Print \" \";Left$(Board$(i%,j%),1);\" \";\n \\\\ rem above and unrem follow line to display mines\n Rem: Print \" \";Board$(i%,j%)+\" \";\n }\n Print\n }\n End Sub\n Sub PrintMines()\n Cls, top_where\n Print\n Print \" X \";\n For j%=1 to columns {\n Print format$(\"{0::-3} \", j%);\n }\n Print\n For i%=1 to rows {\n Print format$(\" {0::-3} \", i%);\n For j%=1 to columns {\n Print \" \";Right$(Board$(i%,j%),1);\" \";\n }\n Print\n }\n End Sub\n Sub GameLoop()\n Local com$, loopagain as boolean\n PrintBoard()\n InputCommand()\n do\n loopagain=true\n while not empty\n \\\\ process game command\n Read com$\n if com$=\"q \" Then\n Print \"Quit\" : end_game=True : exit\n Else.if com$=\"o \" Then\n OpenCell()\n Else.if com$=\"n \" Then\n OpenCell2()\n Else.if com$=\"? \" Then\n SwapCell()\n Else.if com$=\"c \" Then\n Exit Sub\n End if\n End While\n If mines%=0 or used%=0 then\n PrintBoard(): Print \"Player Win\": end_game=True: Exit Sub\n End if\n If mines%=-1 then\n if swap_first%=used% then\n mines%=rows*columns-used%\n Local n%, m%\n While mines%\n Let n%=random(1,rows), m%=random(1, columns)\n If Board$(n%, m%)=\". \" then Board$(n%, m%)=\".*\" : mines%=0\n End While\n Board$(i%, j%)=\". \"\n mines%=rows*columns-used%\n swap_first%=-100\n Push i%, j%, \"o \"\n loopagain=false\n else\n PrintMines(): Print \"Player Loose\": end_game=True : Exit Sub\n end if\n End If\n Until loopagain\n Flush\n Refresh if(End_Game->10,1000)\n End Sub\n Sub InputCommand()\n where=row\n While com$=\"\"\n cls, where\n Print \"x x | ? x x | q >\";\n Refresh 10\n Try {\n Input \"\", com$\n }\n End While\n x=1\n Flush\n While com$<>\"\"\n com_label$=\"\"\n ParseCommand()\n if len(com_label$)<>2 then\n com$=\"\" : Print com_label$ : Flush\n Refresh 10\n push key$ : drop\n else\n Data com_label$, b_col, b_row\n End if\n End While\n Refresh 1000\n End Sub\n Sub ParseCommand()\n com_label$=\"o \"\n skiptest=true\n ReadColumn()\n if len(com_label$)<>2 then\n com$=\"\"\n Else.if x=-1 then\n com_label$=lcase$(Left$(com$,1))+\" \"\n com$=mid$(com$, 2)\n x=1\n if len(com_label$)<>2 then\n com_label$=\"no command found\"\n else.if com_label$=\"? \" then\n ReadColumn()\n if x>-1 then ReadRow()\n else.if com_label$=\"c \" then\n cheat=true\n else.if com_label$=\"q \" then\n flush\n com$=\"\"\n else\n com_label$=\"Use q or ? for commands\"\n com$=\"\"\n End if\n else\n ReadRow()\n if x>-1 then com_label$=\"o \"\n End if\n End Sub\n Sub ReadRow()\n com$=mid$(com$,x)\n b_row=val(com$, \"??\", x)\n if x=-1 then\n com_label$=\"Need a row\"\n else.if b_row<1 or b_row>rows then\n com_label$=\"Need a row from 1 to \"+str$(rows)\n x=-1\n else\n com$=mid$(com$,x+1)\n x=1\n End if\n End Sub\n Sub ReadColumn()\n com$=mid$(com$,x)\n b_col=val(com$, \"??\", x)\n if x=-1 then\n if not skiptest then com_label$=\"Need a column\"\n else.if b_col<1 or b_col>columns then\n com_label$=\"Need a column from 1 to\"+str$(columns)\n else\n com$=mid$(com$,x+1)\n x=1\n End if\n skiptest=false\n End Sub\n Sub SwapCell()\n Read j%, i%\n If left$(Board$(i%,j%),1)=\"?\" then\n Board$(i%,j%) =\".\"+Right$(Board$(i%,j%),1)\n If cheat Then if Right$(Board$(i%,j%),1)=\"*\" then mines%++\n Else.If left$(Board$(i%,j%),1)=\".\" then\n Board$(i%,j%) =\"?\"+Right$(Board$(i%,j%),1)\n If cheat Then if Right$(Board$(i%,j%),1)=\"*\" then mines%--\n End if\n End Sub\n Sub OpenCell()\n Read j%, i%\n If left$(Board$(i%,j%),1)=\".\" then {\n if Right$(Board$(i%,j%),1)=\"*\" then mines%=-1 : flush : exit\n acc%=0\n used%--\n Local n%, m%\n For n%=i%-1 to i%+1 {\n For m%=j%-1 to j%+1 {\n If Right$(Board$(n%,m%),1)=\"*\" then acc%++\n }\n }\n For n%=i%-1 to i%+1 {\n For m%=j%-1 to j%+1 {\n if not (n%=i% and m%=j%) then\n if not Right$(Board$(n%,m%),1)=\"*\" then\n If left$(Board$(n%,m%),1)=\".\" then\n Push n%, m%, \"n \" ' reverse to stack\n Rem : Print stack.size : Refresh\n End If\n End If\n End If\n }\n }\n Board$(i%,j%)=if$(acc%=0->\" \",str$(acc%, \"# \"))\n }\n End Sub\n Sub OpenCell2()\n Read J%, i%\n If left$(Board$(i%,j%),1)=\".\" then {\n if Right$(Board$(i%,j%),1)=\"*\" then exit\n acc%=0\n used%--\n For n%=i%-1 to i%+1 {\n For m%=j%-1 to j%+1 {\n If Right$(Board$(n%,m%),1)=\"*\" then acc%++\n }\n }\n \\\\ if cell has no mines around then we check all\n if acc%=0 then\n Local n%, m%\n For n%=i%-1 to i%+1\n For m%=j%-1 to j%+1\n if not (n%=i% and m%=j%) then\n if not Right$(Board$(n%,m%),1)=\"*\" then\n If left$(Board$(n%,m%),1)=\".\" then\n Push n%, m%, \"o \" ' reverse to stack\n Rem : Print stack.size : Refresh\n End If\n End If\n End If\n Next m%\n Next n%\n End If\n Board$(i%,j%)=if$(acc%=0->\" \",str$(acc%, \"# \"))\n }\n End Sub\n}\nMinesweeper\n","language":"M2000-Interpreter"},{"code":"DynamicModule[{m = 6, n = 4, minecount, grid, win, reset, clear,\n checkwin},\n reset[] :=\n Module[{minesdata, adjacentmines},\n minecount = RandomInteger[Round[{.1, .2} m*n]];\n minesdata =\n Normal@SparseArray[# -> 1 & /@\n RandomSample[Tuples[Range /@ {m, n}], minecount], {m, n}];\n adjacentmines =\n ArrayPad[\n Total[RotateLeft[\n ArrayPad[minesdata,\n 1], #] & /@ {{-1, -1}, {0, -1}, {1, -1}, {-1, 0}, {1,\n 0}, {-1, 1}, {0, 1}, {1, 1}}], -1];\n grid = Array[{If[minesdata[[#1, #2]] == 1, \"*\",\n adjacentmines[[#1, #2]]], \".\", 1} &, {m, n}]; win = \"\"];\n clear[i_, j_] :=\n If[grid[[i, j, 1]] == \"*\", win = \"You lost.\";\n grid = grid /. {{n_Integer, \"?\", _} :> {n, \"x\", 0}, {\"*\",\n \".\", _} :> {\"*\", \"*\", 0}},\n grid[[i, j]] = {grid[[i, j, 1]], grid[[i, j, 1]], 0};\n If[grid[[i, j, 2]] == 0, grid[[i, j, 2]] = \"\";\n clear[i + #[[1]],\n j + #[[2]]] & /@ {{-1, -1}, {0, -1}, {1, -1}, {-1, 0}, {1,\n 0}, {-1, 1}, {0, 1}, {1, 1}}]] /;\n 1 <= i <= m && 1 <= j <= n && grid[[i, j, 2]] == \".\";\n checkwin[] :=\n If[FreeQ[grid, {_Integer, \"?\", _} | {_, \"*\", _} | {_Integer,\n \".\", _}], win = \"You win.\";\n grid = grid /. {{\"*\", \".\", _} :> {\"*\", \"?\", 1}}];\n reset[];\n Panel@Column@{Row@{Dynamic@minecount, \"\\t\",\n Button[\"Reset\", reset[]]},\n Grid[Table[\n With[{i = i, j = j},\n EventHandler[\n Button[Dynamic[grid[[i, j, 2]]], Null, ImageSize -> {17, 17},\n Appearance ->\n Dynamic[If[grid[[i, j, 3]] == 0, \"Pressed\",\n \"DialogBox\"]]], {{\"MouseClicked\", 1} :>\n If[win == \"\", clear[i, j]; checkwin[]], {\"MouseClicked\",\n 2} :> If[win == \"\",\n Switch[grid[[i, j, 2]], \".\", grid[[i, j, 2]] = \"?\";\n minecount--, \"?\", grid[[i, j, 2]] = \".\"; minecount++];\n checkwin[]]}]], {i, 1, m}, {j, 1, n}], Spacings -> {0, 0}],\n Dynamic[win]}]\n","language":"Mathematica"},{"code":"xpbombs\n","language":"MATLAB"},{"code":"function Minesweeper\n\n % Game parameters (should be modified by user)\n nRows = 6;\n nCols = 4;\n percentMines = 0.15;\n\n % Create minefield\n nMines = ceil(percentMines*nRows*nCols);\n field = makeGrid(nRows, nCols, nMines);\n\n % Create timer for updating in axes title\n stopwatch = timer('TimerFcn', {@updateTime, field}, ...\n 'ExecutionMode', 'fixedRate', 'Period', 1, 'StartDelay', 1, ...\n 'TasksToExecute', 999);\n\n % Specify callbacks\n set(gcf, 'CloseRequestFcn', {@cleanUp, stopwatch})\n set(gca, 'ButtonDownFcn', {@onClick, field, stopwatch})\n\n\nend\n\nfunction field = makeGrid(nRows, nCols, nMines)\n % Create minefield with unit squares\n % Use quadrant IV to make indexing semi-consistent\n % i.e. square in ith row, jth column has lower-right corner at (j, -i)\n figure\n set(gcf, 'Color', [1 1 1])\n axis([0 nCols -nRows 0])\n axis square\n axis manual\n hold on\n set(gca, 'GridLineStyle', '-')\n grid on\n set(gca, 'XTick', 0:nCols)\n set(gca, 'YTick', -nRows:0)\n set(gca, 'XTickLabel', [])\n set(gca, 'YTickLabel', [])\n set(gca, 'Color', [0.6 0.6 0.6])\n setTitle(nMines, ': )', 0)\n xlabel('left-click to dig, right-click to mark')\n\n % Set up field structure\n % text will contain the handles to the labels in each square\n % One character per square (or other functions will break)\n % . Nothing noted\n % M Marked as mine\n % ? Marked as unknown\n % 1-8 Digits indicate how many mines this square touches\n % * Mine (game over)\n % (blank) Square has been (dug) and is not mined nor touching any mines\n % squares will contain handles to the colored \"fill\" objects\n % fill objects will be deleted once square is \"dug\"\n % Use ishandle() to determine if square is not yet dug\n % mines will contain a logical array indicating positions of mines\n % true Mine\n % false No mine\n % Later versions of MATLAB use gobjects() to preallocate text and squares\n field = struct('text', zeros(nRows, nCols), ...\n 'squares', zeros(nRows, nCols), ...\n 'mines', false(nRows, nCols));\n\n % Create individual square color and label objects\n for r = 1:nRows\n for c = 1:nCols\n field.squares(r, c) = ...\n fill([c-1 c-1 c c c-1], [-r+1 -r -r -r+1 -r+1], [0.9 0.9 0.9]);\n set(field.squares(r, c), 'HitTest', 'off')\n field.text(r, c) = text(c-0.5, -r+0.5, '.');\n set(field.text(r, c), 'FontSize', 12, 'FontWeight', 'bold', ...\n 'HorizontalAlignment', 'center', 'HitTest', 'off');\n end\n end\n\n % Place mines randomly without repeats\n k = 0;\n while k < nMines\n idx = randi(nRows*nCols);\n if ~field.mines(idx)\n field.mines(idx) = true;\n k = k+1;\n end\n end\nend\n\nfunction onClick(obj, event, field, stopwatch)\n if strcmp(stopwatch.Running, 'off')\n start(stopwatch)\n end\n\n pt = get(obj, 'CurrentPoint');\n r = ceil(-pt(1, 2));\n c = ceil(pt(1, 1));\n\n if r > 0 && c > 0 && r <= size(field.squares, 1) && ... % Not yet been \"dug\"\n c <= size(field.squares, 2) && ishandle(field.squares(r, c))\n buttons = {'normal' 'alt' 'extend'};\n btn = find(strcmp(get(get(obj, 'Parent'), 'SelectionType'), buttons));\n labels = '.M?'; % Unmarked, mine flag, unknown flag\n currLabel = get(field.text(r, c), 'String');\n\n if btn == 1 % Left click\n if currLabel ~= labels(2); % Don't dig if flagged as mine\n if field.mines(r, c) % Mine there -> you lose\n gameLost(field, stopwatch, r, c)\n else % No mine -> free to dig\n minesLeft = countMineFlags(field);\n digSquare(field, r, c)\n if all(all(ishandle(field.squares) == field.mines))\n gameWon(field, stopwatch)\n else\n faceTimer = timer('StartDelay', 0.5, ...\n 'StartFcn', {@setTitleOnTimer, minesLeft, ...\n ': o', stopwatch.TasksExecuted}, ...\n 'TimerFcn', {@setTitleOnTimer, minesLeft, ...\n ': )', stopwatch.TasksExecuted}, ...\n 'StopFcn', @deleteTimer);\n start(faceTimer)\n end\n end\n end\n\n elseif btn == 2 % Right-click\n % Rotate through labels list to the next one\n switch find(currLabel == labels)\n case 1\n newLabel = labels(2);\n case 2\n newLabel = labels(3);\n case 3\n newLabel = labels(1);\n end\n set(field.text(r, c), 'String', newLabel);\n setTitle(countMineFlags(field), ': )', stopwatch.TasksExecuted)\n\n elseif btn == 3 % Middle-click\n % Mark/unmark unknown flag\n if currLabel == labels(1)\n set(field.text(r, c), 'String', labels(3));\n elseif currLabel == labels(3)\n set(field.text(r, c), 'String', labels(1));\n end\n end\n end\nend\n\nfunction updateTime(obj, event, field)\n setTitle(countMineFlags(field), ': )', obj.TasksExecuted)\nend\n\nfunction deleteTimer(obj, event)\n delete(obj)\nend\n\nfunction setTitleOnTimer(obj, event, mines, face, time)\n setTitle(mines, face, time)\nend\n\nfunction setTitle(mines, face, time)\n title(sprintf('%03d Mines %s Timer %03d', mines, face, time))\nend\n\nfunction minesLeft = countMineFlags(field)\n% Determine how many mines are unmarked (negative means too many mines marked)\n minesLeft = sum(field.mines(:));\n for k = 1:numel(field.text)\n if get(field.text(k), 'String') % Not an empty string\n minesLeft = minesLeft-(get(field.text(k), 'String') == 'M');\n end\n end\nend\n\nfunction digSquare(field, r, c)\n% If square is touching one or more mines then indicate the number\n% Otherwise indicate no mines and dig surrounding squares recursively\n% Assumes current square is clear of mines\n delete(field.squares(r, c))\n [nRows, nCols] = size(field.mines);\n surrR = [r-1 r r+1 r-1 r+1 r-1 r r+1];\n surrC = [c-1 c-1 c-1 c c c+1 c+1 c+1];\n toDelete = surrR < 1 | surrR > nRows | surrC < 1 | surrC > nCols;\n surrR(toDelete) = [];\n surrC(toDelete) = [];\n nearMines = sum(field.mines(sub2ind([nRows nCols], surrR, surrC)));\n label = sprintf('%d', nearMines);\n textColor = [0 0 0 ; 0 0 1 ; 0 1 0 ; 1 0 0 ; 0.5 0.1 0.9 ; ...\n 0.6 0 0 ; 0.2 0.5 0.3 ; 0.2 0.2 0.1 ; 0 0 0];\n if ~nearMines\n label = '';\n for k = 1:length(surrR)\n if ~field.mines(surrR(k), surrC(k)) && ...\n ishandle(field.squares(surrR(k), surrC(k))) && ...\n ~strcmp(get(field.text(k), 'String'), 'M')\n digSquare(field, surrR(k), surrC(k))\n end\n end\n end\n set(field.text(r, c), 'String', label, 'Color', textColor(nearMines+1, :))\nend\n\nfunction gameLost(field, stopwatch, r, c)\n stop(stopwatch)\n setTitle(countMineFlags(field), 'X (', stopwatch.TasksExecuted)\n set(field.squares(r, c), 'FaceColor', [1 0 0])\n for k = 1:numel(field.text)\n if field.mines(k) && any(get(field.text(k), 'String') == '.?')\n set(field.text(k), 'String', '*', 'FontSize', 20)\n elseif ~field.mines(k) && ishandle(field.squares(k)) && ...\n get(field.text(k), 'String') == 'M'\n set(field.text(k), 'String', 'X', 'Color', [1 0 0])\n end\n end\n set(gca, 'HitTest', 'off')\n queryPlayAgain('Game over')\nend\n\nfunction gameWon(field, stopwatch)\n% Flag any leftover mines and indicate win\n stop(stopwatch)\n set(field.text(ishandle(field.squares)), 'String', 'M')\n setTitle(0, 'B )', stopwatch.TasksExecuted)\n set(gca, 'HitTest', 'off')\n queryPlayAgain('Minefield cleared!')\nend\n\nfunction queryPlayAgain(msg)\n% Ask player if they want to play again\n% Reset game by closing and reopening figure\n choice = questdlg(sprintf('%s\\nWould you like to play again?', msg), ...\n '', 'Yes', 'No', 'No');\n if strcmp(choice, 'Yes')\n close\n Minesweeper\n end\nend\n\nfunction cleanUp(obj, event, stopwatch)\n% Stop and close down all necessary processes\n stop(stopwatch)\n delete(stopwatch)\n delete(obj)\nend\n","language":"MATLAB"},{"code":"import random, sequtils, strformat, strscans, strutils\n\nconst LMargin = 4\n\ntype\n\n Cell = object\n isMine: bool\n display: char\n\n Grid = seq[seq[Cell]]\n\n Game = object\n grid: Grid\n mineCount: Natural\n minesMarked: Natural\n isOver: bool\n\n\nproc initGame(m, n: Positive): Game =\n result.grid = newSeqWith(m, repeat(Cell(isMine: false, display: '.'), n))\n let min = (float(m * n) * 0.1).toInt\n let max = (float(m * n) * 0.2).toInt\n result.mineCount = min + rand(max - min)\n var rm = result.mineCount\n while rm > 0:\n let x = rand(m - 1)\n let y = rand(n - 1)\n if not result.grid[x][y].isMine:\n dec rm\n result.grid[x][y].isMine = true\n result.minesMarked = 0\n\n\ntemplate `[]`(grid: Grid; x, y: int): Cell = grid[x][y]\n\n\niterator cells(grid: var Grid): var Cell =\n for y in 0..grid[0].high:\n for x in 0..grid.high:\n yield grid[x, y]\n\n\nproc display(game: Game; endOfGame: bool) =\n if not endOfGame:\n echo &\"Grid has {game.mineCount} mine(s), {game.minesMarked} mine(s) marked.\"\n let margin = repeat(' ', LMargin)\n echo margin, toSeq(1..game.grid.len).join()\n echo margin, repeat('-', game.grid.len)\n for y in 0..game.grid[0].high:\n stdout.write align($(y + 1), LMargin)\n for x in 0..game.grid.high:\n stdout.write game.grid[x][y].display\n stdout.write '\\n'\n\n\nproc terminate(game: var Game; msg: string) =\n game.isOver = true\n echo msg\n var answer = \"\"\n while answer notin [\"y\", \"n\"]:\n stdout.write \"Another game (y/n)? \"\n answer = try: stdin.readLine().toLowerAscii\n except EOFError: \"n\"\n if answer == \"y\":\n game = initGame(6, 4)\n game.display(false)\n\n\nproc resign(game: var Game) =\n var found = 0\n for cell in game.grid.cells:\n if cell.isMine:\n if cell.display == '?':\n cell.display = 'Y'\n inc found\n elif cell.display == 'x':\n cell.display = 'N'\n game.display(true)\n let msg = &\"You found {found} out of {game.mineCount} mine(s).\"\n game.terminate(msg)\n\n\nproc markCell(game: var Game; x, y: int) =\n if game.grid[x, y].display == '?':\n dec game.minesMarked\n game.grid[x, y].display = '.'\n elif game.grid[x, y].display == '.':\n inc game.minesMarked\n game.grid[x, y].display = '?'\n\n\nproc countAdjMines(game: Game; x, y: Natural): int =\n for j in (y - 1)..(y + 1):\n if j in 0..game.grid[0].high:\n for i in (x - 1)..(x + 1):\n if i in 0..game.grid.high:\n if game.grid[i, j].isMine:\n inc result\n\n\nproc clearCell(game: var Game; x, y: int): bool =\n\n if x in 0..game.grid.high and y in 0..game.grid[0].high:\n if game.grid[x, y].display == '.':\n\n if game.grid[x, y].isMine:\n game.grid[x][y].display = 'x'\n echo \"Kaboom! You lost!\"\n return false\n\n let count = game.countAdjMines(x, y)\n if count > 0:\n game.grid[x][y].display = chr(ord('0') + count)\n else:\n game.grid[x][y].display = ' '\n for dx in -1..1:\n for dy in -1..1:\n if dx != 0 or dy != 0:\n discard game.clearCell(x + dx, y + dy)\n\n result = true\n\n\nproc testForWin(game: var Game): bool =\n if game.minesMarked != game.mineCount: return false\n for cell in game.grid.cells:\n if cell.display == '.': return false\n result = true\n echo \"You won!\"\n\n\nproc splitAction(game: Game; action: string): tuple[x, y: int; ok: bool] =\n var command: string\n if not action.scanf(\"$w $s$i $s$i$s$.\", command, result.x, result.y): return\n if command.len != 1: return\n if result.x notin 1..game.grid.len or result.y notin 1..game.grid.len: return\n result.ok = true\n\n\nproc printUsage() =\n echo \"h or ? - this help,\"\n echo \"c x y - clear cell (x,y),\"\n echo \"m x y - marks (toggles) cell (x,y),\"\n echo \"n - start a new game,\"\n echo \"q - quit/resign the game,\"\n echo \"where 'x' is the (horizontal) column number and 'y' is the (vertical) row number.\\n\"\n\n\nrandomize()\nprintUsage()\nvar game = initGame(6, 4)\ngame.display(false)\n\nwhile not game.isOver:\n stdout.write \"\\n>\"\n let action = try: stdin.readLine().toLowerAscii\n except EOFError: \"q\"\n case action[0]\n\n of 'h', '?':\n printUsage()\n\n of 'n':\n game = initGame(6, 4)\n game.display(false)\n\n of 'c':\n let (x, y, ok) = game.splitAction(action)\n if not ok: continue\n if game.clearCell(x - 1, y - 1):\n game.display(false)\n if game.testForwin(): game.resign()\n else:\n game.resign()\n\n of 'm':\n let (x, y, ok) = game.splitAction(action)\n if not ok: continue\n game.markCell(x - 1, y - 1)\n game.display(false)\n if game.testForWin(): game.resign()\n\n of 'q':\n game.resign()\n\n else:\n continue\n","language":"Nim"},{"code":"exception Lost\nexception Won\n\nlet put_mines g m n mines_number =\n let rec aux i =\n if i < mines_number then\n begin\n let x = Random.int n\n and y = Random.int m in\n if g.(y).(x)\n then aux i\n else begin\n g.(y).(x) <- true;\n aux (succ i)\n end\n end\n in\n aux 0\n\nlet print_abscissas n =\n print_string \"\\n \"; for x = 1 to n do print_int (x mod 10) done;\n print_string \"\\n \"; for x = 1 to n do print_char '|' done;\n print_newline()\n\nlet print_display d n =\n print_abscissas n;\n Array.iteri (fun y line ->\n Printf.printf \" %2d - \" (y+1); (* print ordinates *)\n Array.iter print_char line;\n print_newline()\n ) d;\n print_newline()\n\nlet reveal d g n =\n print_abscissas n;\n Array.iteri (fun y line ->\n Printf.printf \" %2d - \" (y+1); (* print ordinates *)\n Array.iteri (fun x c ->\n print_char (\n match c, g.(y).(x) with\n | '0'..'9', _ -> c\n | '.', true -> 'x'\n | '?', true -> 'X'\n | '?', false -> 'N'\n | '.', false -> '.'\n | _ -> c)\n ) line;\n print_newline()\n ) d;\n print_newline()\n\nlet toggle_mark d x y =\n match d.(y).(x) with\n | '.' -> d.(y).(x) <- '?'\n | '?' -> d.(y).(x) <- '.'\n | _ -> ()\n\nlet rec feedback g d x y =\n if d.(y).(x) = '.' then\n begin\n let n = ref 0 in (* the number of mines around *)\n for i = (pred y) to (succ y) do\n for j = (pred x) to (succ x) do\n try if g.(i).(j) then incr n\n with _ -> ()\n done;\n done;\n match !n with\n | 0 ->\n (* recursive feedback when no mines are around *)\n d.(y).(x) <- ' ';\n for j = (pred y) to (succ y) do\n for i = (pred x) to (succ x) do\n try feedback g d i j\n with _ -> ()\n done\n done\n | _ ->\n d.(y).(x) <- (string_of_int !n).[0]\n end\n\nlet clear_cell g d x y =\n if g.(y).(x)\n then (d.(y).(x) <- '!'; raise Lost)\n else feedback g d x y\n\nlet rec user_input g d =\n try\n let s = read_line() in\n match Scanf.sscanf s \"%c %d %d\" (fun c x y -> c,x,y) with\n | 'm', x, y -> toggle_mark d (x-1) (y-1)\n | 'c', x, y -> clear_cell g d (x-1) (y-1)\n | _ -> raise Exit\n with Exit | Scanf.Scan_failure _\n | Invalid_argument \"index out of bounds\" ->\n print_string \"# wrong input, try again\\n> \";\n user_input g d\n\nlet check_won g d =\n let won = ref true in\n Array.iteri (fun y line ->\n Array.iteri (fun x c ->\n match c, g.(y).(x) with\n | '.', _ -> won := false\n | '?', false -> won := false\n | _ -> ()\n ) line\n ) d;\n if !won then raise Won\n\nlet minesweeper n m percent =\n let round x = int_of_float (floor (x +. 0.5)) in\n let mines_number = round ((float (n * m)) *. percent) in\n (* the ground containing the mines *)\n let g = Array.make_matrix m n false in\n put_mines g m n mines_number;\n Printf.printf \"# You have to find %d mines\\n\" mines_number;\n (* what's displayed to the user *)\n let d = Array.make_matrix m n '.' in\n try\n while true do\n print_display d n;\n print_string \"> \";\n user_input g d;\n check_won g d;\n done\n with\n | Lost ->\n print_endline \"# You lost!\";\n reveal d g n\n | Won ->\n print_endline \"# You won!\";\n reveal d g n\n\nlet () =\n Random.self_init();\n let ios, fos = int_of_string, float_of_string in\n let n, m, percent =\n try ios Sys.argv.(1), ios Sys.argv.(2), fos Sys.argv.(3)\n with _ ->\n try ios Sys.argv.(1), ios Sys.argv.(2), 0.2\n with _ -> (6, 4, 0.2)\n in\n minesweeper n m percent;\n;;\n","language":"OCaml"},{"code":"#!/usr/bin/perl\nuse warnings;\nuse strict;\n\n{ package Local::Field;\n\n use constant {\n REAL => 0,\n SHOW => 1,\n COUNT => 2,\n };\n\n sub new {\n my ($class, $width, $height, $percent) = @_;\n my $field;\n for my $x (1 .. $width) {\n for my $y (1 .. $height) {\n $field->[$x - 1][$y - 1][REAL] = ' ';\n $field->[$x - 1][$y - 1][SHOW] = '.';\n }\n }\n for (1 .. $percent / 100 * $width * $height) {\n my ($x, $y) = map int rand $_, $width, $height;\n redo if 'm' eq $field->[$x][$y][REAL];\n $field->[$x][$y][REAL] = 'm';\n for my $i ($x - 1 .. $x + 1) {\n for my $j ($y - 1 .. $y + 1) {\n $field->[$i][$j][COUNT]++\n if $i >= 0 and $j >= 0\n and $i <= $#$field and $j <= $#{ $field->[0] };\n }\n }\n }\n bless $field, $class;\n }\n\n\n sub show {\n my ($self) = @_;\n print \"\\n \";\n printf '%2d ', $_ + 1 for 0 .. $#$self;\n print \"\\n\";\n\n for my $row (0 .. $#{ $self->[0] }) {\n printf '%2d ', 1 + $row;\n for my $column (0 .. $#$self) {\n print $self->[$column][$row][SHOW], ' ';\n }\n print \"\\n\";\n }\n }\n\n\n sub mark {\n my ($self, $x, $y) = @_;\n $_-- for $x, $y;\n\n if ('.' eq $self->[$x][$y][SHOW]) {\n $self->[$x][$y][SHOW] = '?';\n\n } elsif ('?' eq $self->[$x][$y][SHOW]) {\n $self->[$x][$y][SHOW] = '.';\n }\n }\n\n\n sub end {\n my $self = shift;\n for my $y (0 .. $#{ $self->[0] }) {\n for my $x (0 .. $#$self) {\n $self->[$x][$y][SHOW] = '!' if '.' eq $self->[$x][$y][SHOW]\n and 'm' eq $self->[$x][$y][REAL];\n $self->[$x][$y][SHOW] = 'x' if '?' eq $self->[$x][$y][SHOW]\n and 'm' ne $self->[$x][$y][REAL];\n }\n }\n $self->show;\n exit;\n }\n\n sub _declassify {\n my ($self, $x, $y) = @_;\n return if '.' ne $self->[$x][$y][SHOW];\n if (' ' eq $self->[$x][$y][REAL] and '.' eq $self->[$x][$y][SHOW]) {\n $self->[$x][$y][SHOW] = $self->[$x][$y][COUNT] || ' ';\n }\n return if ' ' ne $self->[$x][$y][SHOW];\n\n for my $i ($x - 1 .. $x + 1) {\n next if $i < 0 or $i > $#$self;\n for my $j ($y - 1 .. $y + 1) {\n next if $j < 0 or $j > $#{ $self->[0] };\n no warnings 'recursion';\n $self->_declassify($i, $j);\n }\n }\n }\n\n\n sub clear {\n my ($self, $x, $y) = @_;\n $_-- for $x, $y;\n return unless '.' eq $self->[$x][$y][SHOW];\n\n print \"You lost.\\n\" and $self->end if 'm' eq $self->[$x][$y][REAL];\n\n $self->_declassify($x, $y);\n }\n\n\n sub remain {\n my $self = shift;\n my $unclear = 0;\n for my $column (@$self) {\n for my $cell (@$column) {\n $unclear++ if '.' eq $cell->[SHOW];\n }\n }\n return $unclear;\n }\n\n}\n\nsub help {\n print << '__HELP__';\nCommands:\nh ... help\nq ... quit\nm X Y ... mark/unmark X Y\nc X Y ... clear X Y\n__HELP__\n}\n\n\nmy ($width, $height, $percent) = @ARGV;\n$width ||= 6;\n$height ||= 4;\n$percent ||= 15;\n\nmy $field = 'Local::Field'->new($width, $height, $percent);\n\nmy $help = 1;\nwhile (1) {\n $field->show;\n help() if $help;\n $help = 0;\n my $remain = $field->remain;\n last if 0 == $remain;\n print \"Cells remaining: $remain.\\n\";\n my $command = <STDIN>;\n exit if $command =~ /^q/i;\n\n if ($command =~ /^m.*?([0-9]+).*?([0-9]+)/i) {\n $field->mark($1, $2);\n\n } elsif ($command =~ /^c.*?([0-9]+).*?([0-9]+)/i) {\n $field->clear($1, $2);\n\n } elsif ($command =~ /^h/i) {\n $help = 1;\n\n } else {\n print \"Huh?\\n\";\n }\n}\nprint \"You won!\\n\";\n","language":"Perl"},{"code":"constant help = \"\"\"\n\nMinesweeper\n===========\n\nEnter eg A1 to open a cell, FA1 to flag a cell, Q to quit.\n\nThe board is initially displayed with 10-20% of cells mined, as follows:\n\n. - an unknown cell (unopened and not flagged)\n_ - an empty cell, with no surrounding mines\n1..8 - an empty cell, with some nearby mines\n? - a cell you have flagged as a mine\n (a flag can only be cleared by opening)\n\nOn completion:\nX - the mine you detonated (if any)\n* - a mine which was not flagged\n+ - a mine which was correctly flagged\n\"\"\"\n\nstring board = \"\"\"\n\n 123456\nA......\nB......\nC......\nD......\n\"\"\"\n\nsequence data = repeat(repeat(0,6),4)\n-- 0: empty, no nearby mines\n-- 1-8: empty, with surrounding mines\n-- 9: a mine\n\n-- data[row][col] maps to board[row*8+4+col], lets quickly verify that:\nif find('.',board)!=13 then ?9/0 end if\nif rfind('.',board)!=42 then ?9/0 end if\n-- (above may trigger if copy/paste/dowload etc messed up whitespace)\n\nconstant prompt = \"\\nEnter eg A1 to open a cell, FA1 to flag a cell, Q to quit, or ? for help:\"\n\ninteger mines = round((6*4)*0.10+rand(6*4)*0.10), -- 10-20%\n cleared = 0,\n flagged = 0,\n flag = false,\n row = 0,\n col\n\nprocedure plant_mines()\n for i=1 to mines do\n while 1 do\n row = rand(4)\n col = rand(6)\n if data[row][col]!=9 then\n data[row][col] = 9\n for rx=row-1 to row+1 do\n if rx>=1 and rx<=4 then\n for cx=col-1 to col+1 do\n if cx>=1 and cx<=6 then\n if data[rx][cx]!=9 then\n data[rx][cx] += 1\n end if\n end if\n end for\n end if\n end for\n exit\n end if\n end while\n end for\n printf(1,\"%d mines planted\\n\",mines)\n row = 0\nend procedure\n\nprocedure clear_cell(integer row, col, drc)\n board[row*8+4+col] = iff(drc?drc+'0':' ')\n cleared += 1\n if drc=0 then\n for rx=row-1 to row+1 do\n if rx>=1 and rx<=4 then\n for cx=col-1 to col+1 do\n if cx>=1 and cx<=6 then\n drc = data[rx][cx]\n if drc!=9\n and board[rx*8+4+cx]='.' then\n clear_cell(rx,cx,drc)\n end if\n end if\n end for\n end if\n end for\n end if\nend procedure\n\nfunction make_move()\n integer brc = row*8+4+col\n if flag then\n if board[brc]='.' then\n board[brc] = '?'\n flagged += 1\n end if\n else\n integer drc = data[row][col]\n if drc=9 then\n board[brc] = 'X'\n puts(1,\"\\n\\n***BOOM!***\")\n return true\n end if\n if find(board[brc],\".?\") then\n clear_cell(row,col,drc)\n end if\n end if\n row = 0\n flag = false\n -- nb: flagged and cleared may be wrong following incorrect input.\n if flagged=mines\n or cleared=6*4-mines then\n puts(1,\"\\n\\n***You Win!***\")\n return true\n end if\n return false -- no \"BOOM\" yet!\nend function\n\nprocedure disclose()\n for row=1 to 4 do\n for col=1 to 6 do\n if data[row][col]=9 then\n integer bdx = row*8+4+col,\n bch = board[bdx]\n if bch='.' then\n bch = '*'\n elsif bch='?' then\n bch = '+'\n elsif bch!='X' then\n ?9/0\n end if\n board[bdx] = bch\n end if\n end for\n end for\nend procedure\n\nplant_mines()\nwhile 1 do\n if not flag and row=0 then\n puts(1,board)\n puts(1,prompt)\n end if\n integer ch = upper(getc(0))\n puts(1,ch)\n if ch='Q' then exit end if\n if ch='?' then\n puts(1,help)\n elsif ch='F' then\n flag = true\n elsif ch>='A'\n and ch<='D' then\n row = ch-'@'\n elsif ch>='1'\n and ch<='6' then\n col = ch-'0'\n if make_move() then exit end if\n else\n printf(1,\"\\n\\nunrecognised:%c\\n\\n\",ch)\n flag = false\n row = 0\n end if\nend while\ndisclose()\nputs(1,board&\"game over\\n\\n\")\n{} = wait_key()\n","language":"Phix"},{"code":"<?php\ndefine('MINEGRID_WIDTH', 6);\ndefine('MINEGRID_HEIGHT', 4);\n\ndefine('MINESWEEPER_NOT_EXPLORED', -1);\ndefine('MINESWEEPER_MINE', -2);\ndefine('MINESWEEPER_FLAGGED', -3);\ndefine('MINESWEEPER_FLAGGED_MINE', -4);\ndefine('ACTIVATED_MINE', -5);\n\nfunction check_field($field) {\n if ($field === MINESWEEPER_MINE || $field === MINESWEEPER_FLAGGED_MINE) {\n return true;\n }\n else {\n return false;\n }\n}\n\nfunction explore_field($field) {\n if (!isset($_SESSION['minesweeper'][$field])\n || !in_array($_SESSION['minesweeper'][$field],\n array(MINESWEEPER_NOT_EXPLORED, MINESWEEPER_FLAGGED))) {\n return;\n }\n\n $mines = 0;\n\n // Make reference to that long name\n $fields = &$_SESSION['minesweeper'];\n\n // @ operator helps avoiding isset()... (it removes E_NOTICEs)\n\n // left side options\n if ($field % MINEGRID_WIDTH !== 1) {\n $mines += check_field(@$fields[$field - MINEGRID_WIDTH - 1]);\n $mines += check_field(@$fields[$field - 1]);\n $mines += check_field(@$fields[$field + MINEGRID_WIDTH - 1]);\n }\n\n // bottom and top\n $mines += check_field(@$fields[$field - MINEGRID_WIDTH]);\n $mines += check_field(@$fields[$field + MINEGRID_WIDTH]);\n\n // right side options\n if ($field % MINEGRID_WIDTH !== 0) {\n $mines += check_field(@$fields[$field - MINEGRID_WIDTH + 1]);\n $mines += check_field(@$fields[$field + 1]);\n $mines += check_field(@$fields[$field + MINEGRID_WIDTH + 1]);\n }\n\n $fields[$field] = $mines;\n\n if ($mines === 0) {\n if ($field % MINEGRID_WIDTH !== 1) {\n explore_field($field - MINEGRID_WIDTH - 1);\n explore_field($field - 1);\n explore_field($field + MINEGRID_WIDTH - 1);\n }\n\n explore_field($field - MINEGRID_WIDTH);\n explore_field($field + MINEGRID_WIDTH);\n\n if ($field % MINEGRID_WIDTH !== 0) {\n explore_field($field - MINEGRID_WIDTH + 1);\n explore_field($field + 1);\n explore_field($field + MINEGRID_WIDTH + 1);\n }\n }\n}\n\nsession_start(); // will start session storage\n\nif (!isset($_SESSION['minesweeper'])) {\n // Fill grid with not explored tiles\n $_SESSION['minesweeper'] = array_fill(1,\n MINEGRID_WIDTH * MINEGRID_HEIGHT,\n MINESWEEPER_NOT_EXPLORED);\n\n // Generate random number of mines between 0.1 and 0.2\n $number_of_mines = (int) mt_rand(0.1 * MINEGRID_WIDTH * MINEGRID_HEIGHT,\n 0.2 * MINEGRID_WIDTH * MINEGRID_HEIGHT);\n\n // generate mines randomly\n $random_keys = array_rand($_SESSION['minesweeper'], $number_of_mines);\n\n foreach ($random_keys as $key) {\n $_SESSION['minesweeper'][$key] = MINESWEEPER_MINE;\n }\n\n // to make calculations shorter use SESSION variable to store the result\n $_SESSION['numberofmines'] = $number_of_mines;\n}\n\nif (isset($_GET['explore'])) {\n if(isset($_SESSION['minesweeper'][$_GET['explore']])) {\n switch ($_SESSION['minesweeper'][$_GET['explore']]) {\n case MINESWEEPER_NOT_EXPLORED:\n explore_field($_GET['explore']);\n break;\n case MINESWEEPER_MINE:\n $lost = 1;\n $_SESSION['minesweeper'][$_GET['explore']] = ACTIVATED_MINE;\n break;\n default:\n // The tile was discovered already. Ignore it.\n break;\n }\n }\n else {\n die('Tile doesn\\'t exist.');\n }\n}\nelseif (isset($_GET['flag'])) {\n if(isset($_SESSION['minesweeper'][$_GET['flag']])) {\n $tile = &$_SESSION['minesweeper'][$_GET['flag']];\n switch ($tile) {\n case MINESWEEPER_NOT_EXPLORED:\n $tile = MINESWEEPER_FLAGGED;\n break;\n case MINESWEEPER_MINE:\n $tile = MINESWEEPER_FLAGGED_MINE;\n break;\n case MINESWEEPER_FLAGGED:\n $tile = MINESWEEPER_NOT_EXPLORED;\n break;\n case MINESWEEPER_FLAGGED_MINE:\n $tile = MINESWEEPER_MINE;\n break;\n default:\n // This tile shouldn't be flagged. Ignore it.\n break;\n }\n }\n else {\n die('Tile doesn\\'t exist.');\n }\n}\n\n// Check if the player won...\nif (!in_array(MINESWEEPER_NOT_EXPLORED, $_SESSION['minesweeper'])\n && !in_array(MINESWEEPER_FLAGGED, $_SESSION['minesweeper'])) {\n $won = true;\n}\n?>\n<!DOCTYPE html>\n<title>Minesweeper</title>\n<style>\ntable {\n border-collapse: collapse;\n}\n\ntd, a {\n text-align: center;\n width: 1em;\n height: 1em;\n}\n\na {\n display: block;\n color: black;\n text-decoration: none;\n font-size: 2em;\n}\n</style>\n<script>\nfunction flag(number, e) {\n if (e.which === 2 || e.which === 3) {\n location = '?flag=' + number;\n return false;\n }\n}\n</script>\n<?php\n echo \"<p>This field contains $_SESSION[numberofmines] mines.\";\n?>\n<table border=\"1\">\n<?php\n// array_shift() affects array, so we need a copy\n$mine_copy = $_SESSION['minesweeper'];\n\nfor ($x = 1; $x <= MINEGRID_HEIGHT; $x++) {\n echo '<tr>';\n for ($y = 1; $y <= MINEGRID_WIDTH; $y++) {\n echo '<td>';\n\n $number = array_shift($mine_copy);\n switch ($number) {\n case MINESWEEPER_FLAGGED:\n case MINESWEEPER_FLAGGED_MINE:\n if (!empty($lost) || !empty($won)) {\n if ($number === MINESWEEPER_FLAGGED_MINE) {\n echo '<a>*</a>';\n }\n else {\n echo '<a>.<